1 /* Handle parameterized types (templates) for GNU -*- C++ -*-.
2 Copyright (C) 1992-2016 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
copy_template_args (tree
);
182 static tree
tsubst_template_arg (tree
, tree
, tsubst_flags_t
, tree
);
183 static tree
tsubst_template_args (tree
, tree
, tsubst_flags_t
, tree
);
184 static tree
tsubst_template_parms (tree
, tree
, tsubst_flags_t
);
185 static void regenerate_decl_from_template (tree
, tree
);
186 static tree
most_specialized_partial_spec (tree
, tsubst_flags_t
);
187 static tree
tsubst_aggr_type (tree
, tree
, tsubst_flags_t
, tree
, int);
188 static tree
tsubst_arg_types (tree
, tree
, tree
, tsubst_flags_t
, tree
);
189 static tree
tsubst_function_type (tree
, tree
, tsubst_flags_t
, tree
);
190 static bool check_specialization_scope (void);
191 static tree
process_partial_specialization (tree
);
192 static void set_current_access_from_decl (tree
);
193 static enum template_base_result
get_template_base (tree
, tree
, tree
, tree
,
195 static tree
try_class_unification (tree
, tree
, tree
, tree
, bool);
196 static int coerce_template_template_parms (tree
, tree
, tsubst_flags_t
,
198 static bool template_template_parm_bindings_ok_p (tree
, tree
);
199 static int template_args_equal (tree
, tree
);
200 static void tsubst_default_arguments (tree
, tsubst_flags_t
);
201 static tree
for_each_template_parm_r (tree
*, int *, void *);
202 static tree
copy_default_args_to_explicit_spec_1 (tree
, tree
);
203 static void copy_default_args_to_explicit_spec (tree
);
204 static int invalid_nontype_parm_type_p (tree
, tsubst_flags_t
);
205 static bool dependent_template_arg_p (tree
);
206 static bool any_template_arguments_need_structural_equality_p (tree
);
207 static bool dependent_type_p_r (tree
);
208 static tree
tsubst_copy (tree
, tree
, tsubst_flags_t
, tree
);
209 static tree
tsubst_decl (tree
, tree
, tsubst_flags_t
);
210 static void perform_typedefs_access_check (tree tmpl
, tree targs
);
211 static void append_type_to_template_for_access_check_1 (tree
, tree
, tree
,
213 static tree
listify (tree
);
214 static tree
listify_autos (tree
, tree
);
215 static tree
tsubst_template_parm (tree
, tree
, tsubst_flags_t
);
216 static tree
instantiate_alias_template (tree
, tree
, tsubst_flags_t
);
217 static bool complex_alias_template_p (const_tree tmpl
);
218 static tree
tsubst_attributes (tree
, tree
, tsubst_flags_t
, tree
);
220 /* Make the current scope suitable for access checking when we are
221 processing T. T can be FUNCTION_DECL for instantiated function
222 template, VAR_DECL for static member variable, or TYPE_DECL for
223 alias template (needed by instantiate_decl). */
226 push_access_scope (tree t
)
228 gcc_assert (VAR_OR_FUNCTION_DECL_P (t
)
229 || TREE_CODE (t
) == TYPE_DECL
);
231 if (DECL_FRIEND_CONTEXT (t
))
232 push_nested_class (DECL_FRIEND_CONTEXT (t
));
233 else if (DECL_CLASS_SCOPE_P (t
))
234 push_nested_class (DECL_CONTEXT (t
));
236 push_to_top_level ();
238 if (TREE_CODE (t
) == FUNCTION_DECL
)
240 saved_access_scope
= tree_cons
241 (NULL_TREE
, current_function_decl
, saved_access_scope
);
242 current_function_decl
= t
;
246 /* Restore the scope set up by push_access_scope. T is the node we
250 pop_access_scope (tree t
)
252 if (TREE_CODE (t
) == FUNCTION_DECL
)
254 current_function_decl
= TREE_VALUE (saved_access_scope
);
255 saved_access_scope
= TREE_CHAIN (saved_access_scope
);
258 if (DECL_FRIEND_CONTEXT (t
) || DECL_CLASS_SCOPE_P (t
))
261 pop_from_top_level ();
264 /* Do any processing required when DECL (a member template
265 declaration) is finished. Returns the TEMPLATE_DECL corresponding
266 to DECL, unless it is a specialization, in which case the DECL
267 itself is returned. */
270 finish_member_template_decl (tree decl
)
272 if (decl
== error_mark_node
)
273 return error_mark_node
;
275 gcc_assert (DECL_P (decl
));
277 if (TREE_CODE (decl
) == TYPE_DECL
)
281 type
= TREE_TYPE (decl
);
282 if (type
== error_mark_node
)
283 return error_mark_node
;
284 if (MAYBE_CLASS_TYPE_P (type
)
285 && CLASSTYPE_TEMPLATE_INFO (type
)
286 && !CLASSTYPE_TEMPLATE_SPECIALIZATION (type
))
288 tree tmpl
= CLASSTYPE_TI_TEMPLATE (type
);
289 check_member_template (tmpl
);
294 else if (TREE_CODE (decl
) == FIELD_DECL
)
295 error ("data member %qD cannot be a member template", decl
);
296 else if (DECL_TEMPLATE_INFO (decl
))
298 if (!DECL_TEMPLATE_SPECIALIZATION (decl
))
300 check_member_template (DECL_TI_TEMPLATE (decl
));
301 return DECL_TI_TEMPLATE (decl
);
307 error ("invalid member template declaration %qD", decl
);
309 return error_mark_node
;
312 /* Create a template info node. */
315 build_template_info (tree template_decl
, tree template_args
)
317 tree result
= make_node (TEMPLATE_INFO
);
318 TI_TEMPLATE (result
) = template_decl
;
319 TI_ARGS (result
) = template_args
;
323 /* Return the template info node corresponding to T, whatever T is. */
326 get_template_info (const_tree t
)
328 tree tinfo
= NULL_TREE
;
330 if (!t
|| t
== error_mark_node
)
333 if (TREE_CODE (t
) == NAMESPACE_DECL
334 || TREE_CODE (t
) == PARM_DECL
)
337 if (DECL_P (t
) && DECL_LANG_SPECIFIC (t
))
338 tinfo
= DECL_TEMPLATE_INFO (t
);
340 if (!tinfo
&& DECL_IMPLICIT_TYPEDEF_P (t
))
343 if (OVERLOAD_TYPE_P (t
))
344 tinfo
= TYPE_TEMPLATE_INFO (t
);
345 else if (TREE_CODE (t
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
346 tinfo
= TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (t
);
351 /* Returns the template nesting level of the indicated class TYPE.
361 A<T>::B<U> has depth two, while A<T> has depth one.
362 Both A<T>::B<int> and A<int>::B<U> have depth one, if
363 they are instantiations, not specializations.
365 This function is guaranteed to return 0 if passed NULL_TREE so
366 that, for example, `template_class_depth (current_class_type)' is
370 template_class_depth (tree type
)
374 for (depth
= 0; type
&& TREE_CODE (type
) != NAMESPACE_DECL
; )
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
))))
383 type
= CP_DECL_CONTEXT (type
);
384 else if (LAMBDA_TYPE_P (type
))
385 type
= LAMBDA_TYPE_EXTRA_SCOPE (type
);
387 type
= CP_TYPE_CONTEXT (type
);
393 /* Subroutine of maybe_begin_member_template_processing.
394 Returns true if processing DECL needs us to push template parms. */
397 inline_needs_template_parms (tree decl
, bool nsdmi
)
399 if (!decl
|| (!nsdmi
&& ! DECL_TEMPLATE_INFO (decl
)))
402 return (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (most_general_template (decl
)))
403 > (processing_template_decl
+ DECL_TEMPLATE_SPECIALIZATION (decl
)));
406 /* Subroutine of maybe_begin_member_template_processing.
407 Push the template parms in PARMS, starting from LEVELS steps into the
408 chain, and ending at the beginning, since template parms are listed
412 push_inline_template_parms_recursive (tree parmlist
, int levels
)
414 tree parms
= TREE_VALUE (parmlist
);
418 push_inline_template_parms_recursive (TREE_CHAIN (parmlist
), levels
- 1);
420 ++processing_template_decl
;
421 current_template_parms
422 = tree_cons (size_int (processing_template_decl
),
423 parms
, current_template_parms
);
424 TEMPLATE_PARMS_FOR_INLINE (current_template_parms
) = 1;
426 begin_scope (TREE_VEC_LENGTH (parms
) ? sk_template_parms
: sk_template_spec
,
428 for (i
= 0; i
< TREE_VEC_LENGTH (parms
); ++i
)
430 tree parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
432 if (error_operand_p (parm
))
435 gcc_assert (DECL_P (parm
));
437 switch (TREE_CODE (parm
))
445 /* Push the CONST_DECL. */
446 pushdecl (TEMPLATE_PARM_DECL (DECL_INITIAL (parm
)));
455 /* Restore the template parameter context for a member template, a
456 friend template defined in a class definition, or a non-template
457 member of template class. */
460 maybe_begin_member_template_processing (tree decl
)
464 bool nsdmi
= TREE_CODE (decl
) == FIELD_DECL
;
468 tree ctx
= DECL_CONTEXT (decl
);
469 decl
= (CLASSTYPE_TEMPLATE_INFO (ctx
)
470 /* Disregard full specializations (c++/60999). */
471 && uses_template_parms (ctx
)
472 ? CLASSTYPE_TI_TEMPLATE (ctx
) : NULL_TREE
);
475 if (inline_needs_template_parms (decl
, nsdmi
))
477 parms
= DECL_TEMPLATE_PARMS (most_general_template (decl
));
478 levels
= TMPL_PARMS_DEPTH (parms
) - processing_template_decl
;
480 if (DECL_TEMPLATE_SPECIALIZATION (decl
))
483 parms
= TREE_CHAIN (parms
);
486 push_inline_template_parms_recursive (parms
, levels
);
489 /* Remember how many levels of template parameters we pushed so that
490 we can pop them later. */
491 inline_parm_levels
.safe_push (levels
);
494 /* Undo the effects of maybe_begin_member_template_processing. */
497 maybe_end_member_template_processing (void)
502 if (inline_parm_levels
.length () == 0)
505 last
= inline_parm_levels
.pop ();
506 for (i
= 0; i
< last
; ++i
)
508 --processing_template_decl
;
509 current_template_parms
= TREE_CHAIN (current_template_parms
);
514 /* Return a new template argument vector which contains all of ARGS,
515 but has as its innermost set of arguments the EXTRA_ARGS. */
518 add_to_template_args (tree args
, tree extra_args
)
525 if (args
== NULL_TREE
|| extra_args
== error_mark_node
)
528 extra_depth
= TMPL_ARGS_DEPTH (extra_args
);
529 new_args
= make_tree_vec (TMPL_ARGS_DEPTH (args
) + extra_depth
);
531 for (i
= 1; i
<= TMPL_ARGS_DEPTH (args
); ++i
)
532 SET_TMPL_ARGS_LEVEL (new_args
, i
, TMPL_ARGS_LEVEL (args
, i
));
534 for (j
= 1; j
<= extra_depth
; ++j
, ++i
)
535 SET_TMPL_ARGS_LEVEL (new_args
, i
, TMPL_ARGS_LEVEL (extra_args
, j
));
540 /* Like add_to_template_args, but only the outermost ARGS are added to
541 the EXTRA_ARGS. In particular, all but TMPL_ARGS_DEPTH
542 (EXTRA_ARGS) levels are added. This function is used to combine
543 the template arguments from a partial instantiation with the
544 template arguments used to attain the full instantiation from the
545 partial instantiation. */
548 add_outermost_template_args (tree args
, tree extra_args
)
552 /* If there are more levels of EXTRA_ARGS than there are ARGS,
553 something very fishy is going on. */
554 gcc_assert (TMPL_ARGS_DEPTH (args
) >= TMPL_ARGS_DEPTH (extra_args
));
556 /* If *all* the new arguments will be the EXTRA_ARGS, just return
558 if (TMPL_ARGS_DEPTH (args
) == TMPL_ARGS_DEPTH (extra_args
))
561 /* For the moment, we make ARGS look like it contains fewer levels. */
562 TREE_VEC_LENGTH (args
) -= TMPL_ARGS_DEPTH (extra_args
);
564 new_args
= add_to_template_args (args
, extra_args
);
566 /* Now, we restore ARGS to its full dimensions. */
567 TREE_VEC_LENGTH (args
) += TMPL_ARGS_DEPTH (extra_args
);
572 /* Return the N levels of innermost template arguments from the ARGS. */
575 get_innermost_template_args (tree args
, int n
)
583 /* If N is 1, just return the innermost set of template arguments. */
585 return TMPL_ARGS_LEVEL (args
, TMPL_ARGS_DEPTH (args
));
587 /* If we're not removing anything, just return the arguments we were
589 extra_levels
= TMPL_ARGS_DEPTH (args
) - n
;
590 gcc_assert (extra_levels
>= 0);
591 if (extra_levels
== 0)
594 /* Make a new set of arguments, not containing the outer arguments. */
595 new_args
= make_tree_vec (n
);
596 for (i
= 1; i
<= n
; ++i
)
597 SET_TMPL_ARGS_LEVEL (new_args
, i
,
598 TMPL_ARGS_LEVEL (args
, i
+ extra_levels
));
603 /* The inverse of get_innermost_template_args: Return all but the innermost
604 EXTRA_LEVELS levels of template arguments from the ARGS. */
607 strip_innermost_template_args (tree args
, int extra_levels
)
610 int n
= TMPL_ARGS_DEPTH (args
) - extra_levels
;
615 /* If N is 1, just return the outermost set of template arguments. */
617 return TMPL_ARGS_LEVEL (args
, 1);
619 /* If we're not removing anything, just return the arguments we were
621 gcc_assert (extra_levels
>= 0);
622 if (extra_levels
== 0)
625 /* Make a new set of arguments, not containing the inner arguments. */
626 new_args
= make_tree_vec (n
);
627 for (i
= 1; i
<= n
; ++i
)
628 SET_TMPL_ARGS_LEVEL (new_args
, i
,
629 TMPL_ARGS_LEVEL (args
, i
));
634 /* We've got a template header coming up; push to a new level for storing
638 begin_template_parm_list (void)
640 /* We use a non-tag-transparent scope here, which causes pushtag to
641 put tags in this scope, rather than in the enclosing class or
642 namespace scope. This is the right thing, since we want
643 TEMPLATE_DECLS, and not TYPE_DECLS for template classes. For a
644 global template class, push_template_decl handles putting the
645 TEMPLATE_DECL into top-level scope. For a nested template class,
648 template <class T> struct S1 {
649 template <class T> struct S2 {};
652 pushtag contains special code to call pushdecl_with_scope on the
653 TEMPLATE_DECL for S2. */
654 begin_scope (sk_template_parms
, NULL
);
655 ++processing_template_decl
;
656 ++processing_template_parmlist
;
657 note_template_header (0);
659 /* Add a dummy parameter level while we process the parameter list. */
660 current_template_parms
661 = tree_cons (size_int (processing_template_decl
),
663 current_template_parms
);
666 /* This routine is called when a specialization is declared. If it is
667 invalid to declare a specialization here, an error is reported and
668 false is returned, otherwise this routine will return true. */
671 check_specialization_scope (void)
673 tree scope
= current_scope ();
677 An explicit specialization shall be declared in the namespace of
678 which the template is a member, or, for member templates, in the
679 namespace of which the enclosing class or enclosing class
680 template is a member. An explicit specialization of a member
681 function, member class or static data member of a class template
682 shall be declared in the namespace of which the class template
684 if (scope
&& TREE_CODE (scope
) != NAMESPACE_DECL
)
686 error ("explicit specialization in non-namespace scope %qD", scope
);
692 In an explicit specialization declaration for a member of a class
693 template or a member template that appears in namespace scope,
694 the member template and some of its enclosing class templates may
695 remain unspecialized, except that the declaration shall not
696 explicitly specialize a class member template if its enclosing
697 class templates are not explicitly specialized as well. */
698 if (current_template_parms
)
700 error ("enclosing class templates are not explicitly specialized");
707 /* We've just seen template <>. */
710 begin_specialization (void)
712 begin_scope (sk_template_spec
, NULL
);
713 note_template_header (1);
714 return check_specialization_scope ();
717 /* Called at then end of processing a declaration preceded by
721 end_specialization (void)
724 reset_specialization ();
727 /* Any template <>'s that we have seen thus far are not referring to a
728 function specialization. */
731 reset_specialization (void)
733 processing_specialization
= 0;
734 template_header_count
= 0;
737 /* We've just seen a template header. If SPECIALIZATION is nonzero,
738 it was of the form template <>. */
741 note_template_header (int specialization
)
743 processing_specialization
= specialization
;
744 template_header_count
++;
747 /* We're beginning an explicit instantiation. */
750 begin_explicit_instantiation (void)
752 gcc_assert (!processing_explicit_instantiation
);
753 processing_explicit_instantiation
= true;
758 end_explicit_instantiation (void)
760 gcc_assert (processing_explicit_instantiation
);
761 processing_explicit_instantiation
= false;
764 /* An explicit specialization or partial specialization of TMPL is being
765 declared. Check that the namespace in which the specialization is
766 occurring is permissible. Returns false iff it is invalid to
767 specialize TMPL in the current namespace. */
770 check_specialization_namespace (tree tmpl
)
772 tree tpl_ns
= decl_namespace_context (tmpl
);
776 An explicit specialization shall be declared in the namespace of
777 which the template is a member, or, for member templates, in the
778 namespace of which the enclosing class or enclosing class
779 template is a member. An explicit specialization of a member
780 function, member class or static data member of a class template
781 shall be declared in the namespace of which the class template is
783 if (current_scope() != DECL_CONTEXT (tmpl
)
784 && !at_namespace_scope_p ())
786 error ("specialization of %qD must appear at namespace scope", tmpl
);
789 if (is_associated_namespace (current_namespace
, tpl_ns
))
790 /* Same or super-using namespace. */
794 permerror (input_location
,
795 "specialization of %qD in different namespace", tmpl
);
796 permerror (DECL_SOURCE_LOCATION (tmpl
),
797 " from definition of %q#D", tmpl
);
802 /* SPEC is an explicit instantiation. Check that it is valid to
803 perform this explicit instantiation in the current namespace. */
806 check_explicit_instantiation_namespace (tree spec
)
810 /* DR 275: An explicit instantiation shall appear in an enclosing
811 namespace of its template. */
812 ns
= decl_namespace_context (spec
);
813 if (!is_ancestor (current_namespace
, ns
))
814 permerror (input_location
, "explicit instantiation of %qD in namespace %qD "
815 "(which does not enclose namespace %qD)",
816 spec
, current_namespace
, ns
);
819 // Returns the type of a template specialization only if that
820 // specialization needs to be defined. Otherwise (e.g., if the type has
821 // already been defined), the function returns NULL_TREE.
823 maybe_new_partial_specialization (tree type
)
825 // An implicit instantiation of an incomplete type implies
826 // the definition of a new class template.
828 // template<typename T>
831 // template<typename T>
834 // Here, S<T*> is an implicit instantiation of S whose type
836 if (CLASSTYPE_IMPLICIT_INSTANTIATION (type
) && !COMPLETE_TYPE_P (type
))
839 // It can also be the case that TYPE is a completed specialization.
840 // Continuing the previous example, suppose we also declare:
842 // template<typename T>
843 // requires Integral<T>
846 // Here, S<T*> refers to the specialization S<T*> defined
847 // above. However, we need to differentiate definitions because
848 // we intend to define a new partial specialization. In this case,
849 // we rely on the fact that the constraints are different for
850 // this declaration than that above.
852 // Note that we also get here for injected class names and
853 // late-parsed template definitions. We must ensure that we
854 // do not create new type declarations for those cases.
855 if (flag_concepts
&& CLASSTYPE_TEMPLATE_SPECIALIZATION (type
))
857 tree tmpl
= CLASSTYPE_TI_TEMPLATE (type
);
858 tree args
= CLASSTYPE_TI_ARGS (type
);
860 // If there are no template parameters, this cannot be a new
861 // partial template specializtion?
862 if (!current_template_parms
)
865 // The injected-class-name is not a new partial specialization.
866 if (DECL_SELF_REFERENCE_P (TYPE_NAME (type
)))
869 // If the constraints are not the same as those of the primary
870 // then, we can probably create a new specialization.
871 tree type_constr
= current_template_constraints ();
873 if (type
== TREE_TYPE (tmpl
))
875 tree main_constr
= get_constraints (tmpl
);
876 if (equivalent_constraints (type_constr
, main_constr
))
880 // Also, if there's a pre-existing specialization with matching
881 // constraints, then this also isn't new.
882 tree specs
= DECL_TEMPLATE_SPECIALIZATIONS (tmpl
);
885 tree spec_tmpl
= TREE_VALUE (specs
);
886 tree spec_args
= TREE_PURPOSE (specs
);
887 tree spec_constr
= get_constraints (spec_tmpl
);
888 if (comp_template_args (args
, spec_args
)
889 && equivalent_constraints (type_constr
, spec_constr
))
891 specs
= TREE_CHAIN (specs
);
894 // Create a new type node (and corresponding type decl)
895 // for the newly declared specialization.
896 tree t
= make_class_type (TREE_CODE (type
));
897 CLASSTYPE_DECLARED_CLASS (t
) = CLASSTYPE_DECLARED_CLASS (type
);
898 TYPE_FOR_JAVA (t
) = TYPE_FOR_JAVA (type
);
899 SET_TYPE_TEMPLATE_INFO (t
, build_template_info (tmpl
, args
));
901 /* We only need a separate type node for storing the definition of this
902 partial specialization; uses of S<T*> are unconstrained, so all are
903 equivalent. So keep TYPE_CANONICAL the same. */
904 TYPE_CANONICAL (t
) = TYPE_CANONICAL (type
);
906 // Build the corresponding type decl.
907 tree d
= create_implicit_typedef (DECL_NAME (tmpl
), t
);
908 DECL_CONTEXT (d
) = TYPE_CONTEXT (t
);
909 DECL_SOURCE_LOCATION (d
) = input_location
;
917 /* The TYPE is being declared. If it is a template type, that means it
918 is a partial specialization. Do appropriate error-checking. */
921 maybe_process_partial_specialization (tree type
)
925 if (type
== error_mark_node
)
926 return error_mark_node
;
928 /* A lambda that appears in specialization context is not itself a
930 if (CLASS_TYPE_P (type
) && CLASSTYPE_LAMBDA_EXPR (type
))
933 if (TREE_CODE (type
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
935 error ("name of class shadows template template parameter %qD",
937 return error_mark_node
;
940 context
= TYPE_CONTEXT (type
);
942 if (TYPE_ALIAS_P (type
))
944 if (TYPE_TEMPLATE_INFO (type
)
945 && DECL_ALIAS_TEMPLATE_P (TYPE_TI_TEMPLATE (type
)))
946 error ("specialization of alias template %qD",
947 TYPE_TI_TEMPLATE (type
));
949 error ("explicit specialization of non-template %qT", type
);
950 return error_mark_node
;
952 else if (CLASS_TYPE_P (type
) && CLASSTYPE_USE_TEMPLATE (type
))
954 /* This is for ordinary explicit specialization and partial
955 specialization of a template class such as:
957 template <> class C<int>;
961 template <class T> class C<T*>;
963 Make sure that `C<int>' and `C<T*>' are implicit instantiations. */
965 if (tree t
= maybe_new_partial_specialization (type
))
967 if (!check_specialization_namespace (CLASSTYPE_TI_TEMPLATE (t
))
968 && !at_namespace_scope_p ())
969 return error_mark_node
;
970 SET_CLASSTYPE_TEMPLATE_SPECIALIZATION (t
);
971 DECL_SOURCE_LOCATION (TYPE_MAIN_DECL (t
)) = input_location
;
972 if (processing_template_decl
)
974 tree decl
= push_template_decl (TYPE_MAIN_DECL (t
));
975 if (decl
== error_mark_node
)
976 return error_mark_node
;
977 return TREE_TYPE (decl
);
980 else if (CLASSTYPE_TEMPLATE_INSTANTIATION (type
))
981 error ("specialization of %qT after instantiation", type
);
982 else if (errorcount
&& !processing_specialization
983 && CLASSTYPE_TEMPLATE_SPECIALIZATION (type
)
984 && !uses_template_parms (CLASSTYPE_TI_ARGS (type
)))
985 /* Trying to define a specialization either without a template<> header
986 or in an inappropriate place. We've already given an error, so just
987 bail now so we don't actually define the specialization. */
988 return error_mark_node
;
990 else if (CLASS_TYPE_P (type
)
991 && !CLASSTYPE_USE_TEMPLATE (type
)
992 && CLASSTYPE_TEMPLATE_INFO (type
)
993 && context
&& CLASS_TYPE_P (context
)
994 && CLASSTYPE_TEMPLATE_INFO (context
))
996 /* This is for an explicit specialization of member class
997 template according to [temp.expl.spec/18]:
999 template <> template <class U> class C<int>::D;
1001 The context `C<int>' must be an implicit instantiation.
1002 Otherwise this is just a member class template declared
1005 template <> class C<int> { template <class U> class D; };
1006 template <> template <class U> class C<int>::D;
1008 In the first case, `C<int>::D' is a specialization of `C<T>::D'
1009 while in the second case, `C<int>::D' is a primary template
1010 and `C<T>::D' may not exist. */
1012 if (CLASSTYPE_IMPLICIT_INSTANTIATION (context
)
1013 && !COMPLETE_TYPE_P (type
))
1016 tree tmpl
= CLASSTYPE_TI_TEMPLATE (type
);
1018 if (current_namespace
1019 != decl_namespace_context (tmpl
))
1021 permerror (input_location
,
1022 "specializing %q#T in different namespace", type
);
1023 permerror (DECL_SOURCE_LOCATION (tmpl
),
1024 " from definition of %q#D", tmpl
);
1027 /* Check for invalid specialization after instantiation:
1029 template <> template <> class C<int>::D<int>;
1030 template <> template <class U> class C<int>::D; */
1032 for (t
= DECL_TEMPLATE_INSTANTIATIONS (tmpl
);
1033 t
; t
= TREE_CHAIN (t
))
1035 tree inst
= TREE_VALUE (t
);
1036 if (CLASSTYPE_TEMPLATE_SPECIALIZATION (inst
)
1037 || !COMPLETE_OR_OPEN_TYPE_P (inst
))
1039 /* We already have a full specialization of this partial
1040 instantiation, or a full specialization has been
1041 looked up but not instantiated. Reassign it to the
1042 new member specialization template. */
1046 elt
.tmpl
= most_general_template (tmpl
);
1047 elt
.args
= CLASSTYPE_TI_ARGS (inst
);
1050 type_specializations
->remove_elt (&elt
);
1053 elt
.args
= INNERMOST_TEMPLATE_ARGS (elt
.args
);
1056 = type_specializations
->find_slot (&elt
, INSERT
);
1057 entry
= ggc_alloc
<spec_entry
> ();
1062 /* But if we've had an implicit instantiation, that's a
1063 problem ([temp.expl.spec]/6). */
1064 error ("specialization %qT after instantiation %qT",
1068 /* Mark TYPE as a specialization. And as a result, we only
1069 have one level of template argument for the innermost
1071 SET_CLASSTYPE_TEMPLATE_SPECIALIZATION (type
);
1072 DECL_SOURCE_LOCATION (TYPE_MAIN_DECL (type
)) = input_location
;
1073 CLASSTYPE_TI_ARGS (type
)
1074 = INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (type
));
1077 else if (processing_specialization
)
1079 /* Someday C++0x may allow for enum template specialization. */
1080 if (cxx_dialect
> cxx98
&& TREE_CODE (type
) == ENUMERAL_TYPE
1081 && CLASS_TYPE_P (context
) && CLASSTYPE_USE_TEMPLATE (context
))
1082 pedwarn (input_location
, OPT_Wpedantic
, "template specialization "
1083 "of %qD not allowed by ISO C++", type
);
1086 error ("explicit specialization of non-template %qT", type
);
1087 return error_mark_node
;
1094 /* Returns nonzero if we can optimize the retrieval of specializations
1095 for TMPL, a TEMPLATE_DECL. In particular, for such a template, we
1096 do not use DECL_TEMPLATE_SPECIALIZATIONS at all. */
1099 optimize_specialization_lookup_p (tree tmpl
)
1101 return (DECL_FUNCTION_TEMPLATE_P (tmpl
)
1102 && DECL_CLASS_SCOPE_P (tmpl
)
1103 /* DECL_CLASS_SCOPE_P holds of T::f even if T is a template
1105 && CLASS_TYPE_P (DECL_CONTEXT (tmpl
))
1106 /* The optimized lookup depends on the fact that the
1107 template arguments for the member function template apply
1108 purely to the containing class, which is not true if the
1109 containing class is an explicit or partial
1111 && !CLASSTYPE_TEMPLATE_SPECIALIZATION (DECL_CONTEXT (tmpl
))
1112 && !DECL_MEMBER_TEMPLATE_P (tmpl
)
1113 && !DECL_CONV_FN_P (tmpl
)
1114 /* It is possible to have a template that is not a member
1115 template and is not a member of a template class:
1117 template <typename T>
1118 struct S { friend A::f(); };
1120 Here, the friend function is a template, but the context does
1121 not have template information. The optimized lookup relies
1122 on having ARGS be the template arguments for both the class
1123 and the function template. */
1124 && !DECL_FRIEND_P (DECL_TEMPLATE_RESULT (tmpl
)));
1127 /* Make sure ARGS doesn't use any inappropriate typedefs; we should have
1128 gone through coerce_template_parms by now. */
1131 verify_unstripped_args (tree args
)
1133 ++processing_template_decl
;
1134 if (!any_dependent_template_arguments_p (args
))
1136 tree inner
= INNERMOST_TEMPLATE_ARGS (args
);
1137 for (int i
= 0; i
< TREE_VEC_LENGTH (inner
); ++i
)
1139 tree arg
= TREE_VEC_ELT (inner
, i
);
1140 if (TREE_CODE (arg
) == TEMPLATE_DECL
)
1142 else if (TYPE_P (arg
))
1143 gcc_assert (strip_typedefs (arg
, NULL
) == arg
);
1144 else if (strip_typedefs (TREE_TYPE (arg
), NULL
) != TREE_TYPE (arg
))
1145 /* Allow typedefs on the type of a non-type argument, since a
1146 parameter can have them. */;
1148 gcc_assert (strip_typedefs_expr (arg
, NULL
) == arg
);
1151 --processing_template_decl
;
1154 /* Retrieve the specialization (in the sense of [temp.spec] - a
1155 specialization is either an instantiation or an explicit
1156 specialization) of TMPL for the given template ARGS. If there is
1157 no such specialization, return NULL_TREE. The ARGS are a vector of
1158 arguments, or a vector of vectors of arguments, in the case of
1159 templates with more than one level of parameters.
1161 If TMPL is a type template and CLASS_SPECIALIZATIONS_P is true,
1162 then we search for a partial specialization matching ARGS. This
1163 parameter is ignored if TMPL is not a class template.
1165 We can also look up a FIELD_DECL, if it is a lambda capture pack; the
1166 result is a NONTYPE_ARGUMENT_PACK. */
1169 retrieve_specialization (tree tmpl
, tree args
, hashval_t hash
)
1171 if (tmpl
== NULL_TREE
)
1174 if (args
== error_mark_node
)
1177 gcc_assert (TREE_CODE (tmpl
) == TEMPLATE_DECL
1178 || TREE_CODE (tmpl
) == FIELD_DECL
);
1180 /* There should be as many levels of arguments as there are
1181 levels of parameters. */
1182 gcc_assert (TMPL_ARGS_DEPTH (args
)
1183 == (TREE_CODE (tmpl
) == TEMPLATE_DECL
1184 ? TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl
))
1185 : template_class_depth (DECL_CONTEXT (tmpl
))));
1188 verify_unstripped_args (args
);
1190 if (optimize_specialization_lookup_p (tmpl
))
1192 tree class_template
;
1193 tree class_specialization
;
1194 vec
<tree
, va_gc
> *methods
;
1198 /* The template arguments actually apply to the containing
1199 class. Find the class specialization with those
1201 class_template
= CLASSTYPE_TI_TEMPLATE (DECL_CONTEXT (tmpl
));
1202 class_specialization
1203 = retrieve_specialization (class_template
, args
, 0);
1204 if (!class_specialization
)
1206 /* Now, find the appropriate entry in the CLASSTYPE_METHOD_VEC
1207 for the specialization. */
1208 idx
= class_method_index_for_fn (class_specialization
, tmpl
);
1211 /* Iterate through the methods with the indicated name, looking
1212 for the one that has an instance of TMPL. */
1213 methods
= CLASSTYPE_METHOD_VEC (class_specialization
);
1214 for (fns
= (*methods
)[idx
]; fns
; fns
= OVL_NEXT (fns
))
1216 tree fn
= OVL_CURRENT (fns
);
1217 if (DECL_TEMPLATE_INFO (fn
) && DECL_TI_TEMPLATE (fn
) == tmpl
1218 /* using-declarations can add base methods to the method vec,
1219 and we don't want those here. */
1220 && DECL_CONTEXT (fn
) == class_specialization
)
1229 hash_table
<spec_hasher
> *specializations
;
1233 elt
.spec
= NULL_TREE
;
1235 if (DECL_CLASS_TEMPLATE_P (tmpl
))
1236 specializations
= type_specializations
;
1238 specializations
= decl_specializations
;
1241 hash
= spec_hasher::hash (&elt
);
1242 found
= specializations
->find_with_hash (&elt
, hash
);
1250 /* Like retrieve_specialization, but for local declarations. */
1253 retrieve_local_specialization (tree tmpl
)
1255 if (local_specializations
== NULL
)
1258 tree
*slot
= local_specializations
->get (tmpl
);
1259 return slot
? *slot
: NULL_TREE
;
1262 /* Returns nonzero iff DECL is a specialization of TMPL. */
1265 is_specialization_of (tree decl
, tree tmpl
)
1269 if (TREE_CODE (decl
) == FUNCTION_DECL
)
1273 t
= DECL_TEMPLATE_INFO (t
) ? DECL_TI_TEMPLATE (t
) : NULL_TREE
)
1279 gcc_assert (TREE_CODE (decl
) == TYPE_DECL
);
1281 for (t
= TREE_TYPE (decl
);
1283 t
= CLASSTYPE_USE_TEMPLATE (t
)
1284 ? TREE_TYPE (CLASSTYPE_TI_TEMPLATE (t
)) : NULL_TREE
)
1285 if (same_type_ignoring_top_level_qualifiers_p (t
, TREE_TYPE (tmpl
)))
1292 /* Returns nonzero iff DECL is a specialization of friend declaration
1293 FRIEND_DECL according to [temp.friend]. */
1296 is_specialization_of_friend (tree decl
, tree friend_decl
)
1298 bool need_template
= true;
1301 gcc_assert (TREE_CODE (decl
) == FUNCTION_DECL
1302 || TREE_CODE (decl
) == TYPE_DECL
);
1304 /* For [temp.friend/6] when FRIEND_DECL is an ordinary member function
1305 of a template class, we want to check if DECL is a specialization
1307 if (TREE_CODE (friend_decl
) == FUNCTION_DECL
1308 && DECL_TEMPLATE_INFO (friend_decl
)
1309 && !DECL_USE_TEMPLATE (friend_decl
))
1311 /* We want a TEMPLATE_DECL for `is_specialization_of'. */
1312 friend_decl
= DECL_TI_TEMPLATE (friend_decl
);
1313 need_template
= false;
1315 else if (TREE_CODE (friend_decl
) == TEMPLATE_DECL
1316 && !PRIMARY_TEMPLATE_P (friend_decl
))
1317 need_template
= false;
1319 /* There is nothing to do if this is not a template friend. */
1320 if (TREE_CODE (friend_decl
) != TEMPLATE_DECL
)
1323 if (is_specialization_of (decl
, friend_decl
))
1327 A member of a class template may be declared to be a friend of a
1328 non-template class. In this case, the corresponding member of
1329 every specialization of the class template is a friend of the
1330 class granting friendship.
1332 For example, given a template friend declaration
1334 template <class T> friend void A<T>::f();
1336 the member function below is considered a friend
1338 template <> struct A<int> {
1342 For this type of template friend, TEMPLATE_DEPTH below will be
1343 nonzero. To determine if DECL is a friend of FRIEND, we first
1344 check if the enclosing class is a specialization of another. */
1346 template_depth
= template_class_depth (CP_DECL_CONTEXT (friend_decl
));
1348 && DECL_CLASS_SCOPE_P (decl
)
1349 && is_specialization_of (TYPE_NAME (DECL_CONTEXT (decl
)),
1350 CLASSTYPE_TI_TEMPLATE (DECL_CONTEXT (friend_decl
))))
1352 /* Next, we check the members themselves. In order to handle
1353 a few tricky cases, such as when FRIEND_DECL's are
1355 template <class T> friend void A<T>::g(T t);
1356 template <class T> template <T t> friend void A<T>::h();
1360 void A<int>::g(int);
1361 template <int> void A<int>::h();
1363 we need to figure out ARGS, the template arguments from
1364 the context of DECL. This is required for template substitution
1365 of `T' in the function parameter of `g' and template parameter
1366 of `h' in the above examples. Here ARGS corresponds to `int'. */
1368 tree context
= DECL_CONTEXT (decl
);
1369 tree args
= NULL_TREE
;
1370 int current_depth
= 0;
1372 while (current_depth
< template_depth
)
1374 if (CLASSTYPE_TEMPLATE_INFO (context
))
1376 if (current_depth
== 0)
1377 args
= TYPE_TI_ARGS (context
);
1379 args
= add_to_template_args (TYPE_TI_ARGS (context
), args
);
1382 context
= TYPE_CONTEXT (context
);
1385 if (TREE_CODE (decl
) == FUNCTION_DECL
)
1390 tree friend_args_type
;
1391 tree decl_args_type
;
1393 /* Make sure that both DECL and FRIEND_DECL are templates or
1395 is_template
= DECL_TEMPLATE_INFO (decl
)
1396 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (decl
));
1397 if (need_template
^ is_template
)
1399 else if (is_template
)
1401 /* If both are templates, check template parameter list. */
1403 = tsubst_template_parms (DECL_TEMPLATE_PARMS (friend_decl
),
1405 if (!comp_template_parms
1406 (DECL_TEMPLATE_PARMS (DECL_TI_TEMPLATE (decl
)),
1410 decl_type
= TREE_TYPE (DECL_TI_TEMPLATE (decl
));
1413 decl_type
= TREE_TYPE (decl
);
1415 friend_type
= tsubst_function_type (TREE_TYPE (friend_decl
), args
,
1416 tf_none
, NULL_TREE
);
1417 if (friend_type
== error_mark_node
)
1420 /* Check if return types match. */
1421 if (!same_type_p (TREE_TYPE (decl_type
), TREE_TYPE (friend_type
)))
1424 /* Check if function parameter types match, ignoring the
1425 `this' parameter. */
1426 friend_args_type
= TYPE_ARG_TYPES (friend_type
);
1427 decl_args_type
= TYPE_ARG_TYPES (decl_type
);
1428 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (friend_decl
))
1429 friend_args_type
= TREE_CHAIN (friend_args_type
);
1430 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
1431 decl_args_type
= TREE_CHAIN (decl_args_type
);
1433 return compparms (decl_args_type
, friend_args_type
);
1437 /* DECL is a TYPE_DECL */
1439 tree decl_type
= TREE_TYPE (decl
);
1441 /* Make sure that both DECL and FRIEND_DECL are templates or
1444 = CLASSTYPE_TEMPLATE_INFO (decl_type
)
1445 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (decl_type
));
1447 if (need_template
^ is_template
)
1449 else if (is_template
)
1452 /* If both are templates, check the name of the two
1453 TEMPLATE_DECL's first because is_friend didn't. */
1454 if (DECL_NAME (CLASSTYPE_TI_TEMPLATE (decl_type
))
1455 != DECL_NAME (friend_decl
))
1458 /* Now check template parameter list. */
1460 = tsubst_template_parms (DECL_TEMPLATE_PARMS (friend_decl
),
1462 return comp_template_parms
1463 (DECL_TEMPLATE_PARMS (CLASSTYPE_TI_TEMPLATE (decl_type
)),
1467 return (DECL_NAME (decl
)
1468 == DECL_NAME (friend_decl
));
1474 /* Register the specialization SPEC as a specialization of TMPL with
1475 the indicated ARGS. IS_FRIEND indicates whether the specialization
1476 is actually just a friend declaration. Returns SPEC, or an
1477 equivalent prior declaration, if available.
1479 We also store instantiations of field packs in the hash table, even
1480 though they are not themselves templates, to make lookup easier. */
1483 register_specialization (tree spec
, tree tmpl
, tree args
, bool is_friend
,
1487 spec_entry
**slot
= NULL
;
1490 gcc_assert ((TREE_CODE (tmpl
) == TEMPLATE_DECL
&& DECL_P (spec
))
1491 || (TREE_CODE (tmpl
) == FIELD_DECL
1492 && TREE_CODE (spec
) == NONTYPE_ARGUMENT_PACK
));
1494 if (TREE_CODE (spec
) == FUNCTION_DECL
1495 && uses_template_parms (DECL_TI_ARGS (spec
)))
1496 /* This is the FUNCTION_DECL for a partial instantiation. Don't
1497 register it; we want the corresponding TEMPLATE_DECL instead.
1498 We use `uses_template_parms (DECL_TI_ARGS (spec))' rather than
1499 the more obvious `uses_template_parms (spec)' to avoid problems
1500 with default function arguments. In particular, given
1501 something like this:
1503 template <class T> void f(T t1, T t = T())
1505 the default argument expression is not substituted for in an
1506 instantiation unless and until it is actually needed. */
1509 if (optimize_specialization_lookup_p (tmpl
))
1510 /* We don't put these specializations in the hash table, but we might
1511 want to give an error about a mismatch. */
1512 fn
= retrieve_specialization (tmpl
, args
, 0);
1520 hash
= spec_hasher::hash (&elt
);
1523 decl_specializations
->find_slot_with_hash (&elt
, hash
, INSERT
);
1525 fn
= ((spec_entry
*) *slot
)->spec
;
1530 /* We can sometimes try to re-register a specialization that we've
1531 already got. In particular, regenerate_decl_from_template calls
1532 duplicate_decls which will update the specialization list. But,
1533 we'll still get called again here anyhow. It's more convenient
1534 to simply allow this than to try to prevent it. */
1537 else if (fn
&& DECL_TEMPLATE_SPECIALIZATION (spec
))
1539 if (DECL_TEMPLATE_INSTANTIATION (fn
))
1541 if (DECL_ODR_USED (fn
)
1542 || DECL_EXPLICIT_INSTANTIATION (fn
))
1544 error ("specialization of %qD after instantiation",
1546 return error_mark_node
;
1551 /* This situation should occur only if the first
1552 specialization is an implicit instantiation, the
1553 second is an explicit specialization, and the
1554 implicit instantiation has not yet been used. That
1555 situation can occur if we have implicitly
1556 instantiated a member function and then specialized
1559 We can also wind up here if a friend declaration that
1560 looked like an instantiation turns out to be a
1563 template <class T> void foo(T);
1564 class S { friend void foo<>(int) };
1565 template <> void foo(int);
1567 We transform the existing DECL in place so that any
1568 pointers to it become pointers to the updated
1571 If there was a definition for the template, but not
1572 for the specialization, we want this to look as if
1573 there were no definition, and vice versa. */
1574 DECL_INITIAL (fn
) = NULL_TREE
;
1575 duplicate_decls (spec
, fn
, is_friend
);
1576 /* The call to duplicate_decls will have applied
1579 An explicit specialization of a function template
1580 is inline only if it is explicitly declared to be,
1581 and independently of whether its function template
1584 to the primary function; now copy the inline bits to
1585 the various clones. */
1586 FOR_EACH_CLONE (clone
, fn
)
1588 DECL_DECLARED_INLINE_P (clone
)
1589 = DECL_DECLARED_INLINE_P (fn
);
1590 DECL_SOURCE_LOCATION (clone
)
1591 = DECL_SOURCE_LOCATION (fn
);
1592 DECL_DELETED_FN (clone
)
1593 = DECL_DELETED_FN (fn
);
1595 check_specialization_namespace (tmpl
);
1600 else if (DECL_TEMPLATE_SPECIALIZATION (fn
))
1602 if (!duplicate_decls (spec
, fn
, is_friend
) && DECL_INITIAL (spec
))
1603 /* Dup decl failed, but this is a new definition. Set the
1604 line number so any errors match this new
1606 DECL_SOURCE_LOCATION (fn
) = DECL_SOURCE_LOCATION (spec
);
1612 return duplicate_decls (spec
, fn
, is_friend
);
1614 /* A specialization must be declared in the same namespace as the
1615 template it is specializing. */
1616 if (DECL_P (spec
) && DECL_TEMPLATE_SPECIALIZATION (spec
)
1617 && !check_specialization_namespace (tmpl
))
1618 DECL_CONTEXT (spec
) = DECL_CONTEXT (tmpl
);
1620 if (slot
!= NULL
/* !optimize_specialization_lookup_p (tmpl) */)
1622 spec_entry
*entry
= ggc_alloc
<spec_entry
> ();
1623 gcc_assert (tmpl
&& args
&& spec
);
1626 if ((TREE_CODE (spec
) == FUNCTION_DECL
&& DECL_NAMESPACE_SCOPE_P (spec
)
1627 && PRIMARY_TEMPLATE_P (tmpl
)
1628 && DECL_SAVED_TREE (DECL_TEMPLATE_RESULT (tmpl
)) == NULL_TREE
)
1629 || variable_template_p (tmpl
))
1630 /* If TMPL is a forward declaration of a template function, keep a list
1631 of all specializations in case we need to reassign them to a friend
1632 template later in tsubst_friend_function.
1634 Also keep a list of all variable template instantiations so that
1635 process_partial_specialization can check whether a later partial
1636 specialization would have used it. */
1637 DECL_TEMPLATE_INSTANTIATIONS (tmpl
)
1638 = tree_cons (args
, spec
, DECL_TEMPLATE_INSTANTIATIONS (tmpl
));
1644 /* Returns true iff two spec_entry nodes are equivalent. */
1646 int comparing_specializations
;
1649 spec_hasher::equal (spec_entry
*e1
, spec_entry
*e2
)
1653 ++comparing_specializations
;
1654 equal
= (e1
->tmpl
== e2
->tmpl
1655 && comp_template_args (e1
->args
, e2
->args
));
1656 if (equal
&& flag_concepts
1657 /* tmpl could be a FIELD_DECL for a capture pack. */
1658 && TREE_CODE (e1
->tmpl
) == TEMPLATE_DECL
1659 && VAR_P (DECL_TEMPLATE_RESULT (e1
->tmpl
))
1660 && uses_template_parms (e1
->args
))
1662 /* Partial specializations of a variable template can be distinguished by
1664 tree c1
= e1
->spec
? get_constraints (e1
->spec
) : NULL_TREE
;
1665 tree c2
= e2
->spec
? get_constraints (e2
->spec
) : NULL_TREE
;
1666 equal
= equivalent_constraints (c1
, c2
);
1668 --comparing_specializations
;
1673 /* Returns a hash for a template TMPL and template arguments ARGS. */
1676 hash_tmpl_and_args (tree tmpl
, tree args
)
1678 hashval_t val
= iterative_hash_object (DECL_UID (tmpl
), 0);
1679 return iterative_hash_template_arg (args
, val
);
1682 /* Returns a hash for a spec_entry node based on the TMPL and ARGS members,
1686 spec_hasher::hash (spec_entry
*e
)
1688 return hash_tmpl_and_args (e
->tmpl
, e
->args
);
1691 /* Recursively calculate a hash value for a template argument ARG, for use
1692 in the hash tables of template specializations. */
1695 iterative_hash_template_arg (tree arg
, hashval_t val
)
1697 unsigned HOST_WIDE_INT i
;
1698 enum tree_code code
;
1701 if (arg
== NULL_TREE
)
1702 return iterative_hash_object (arg
, val
);
1707 if (TREE_CODE (arg
) == ARGUMENT_PACK_SELECT
)
1708 /* We can get one of these when re-hashing a previous entry in the middle
1709 of substituting into a pack expansion. Just look through it. */
1710 arg
= ARGUMENT_PACK_SELECT_FROM_PACK (arg
);
1712 code
= TREE_CODE (arg
);
1713 tclass
= TREE_CODE_CLASS (code
);
1715 val
= iterative_hash_object (code
, val
);
1722 case IDENTIFIER_NODE
:
1723 return iterative_hash_object (IDENTIFIER_HASH_VALUE (arg
), val
);
1727 int i
, len
= TREE_VEC_LENGTH (arg
);
1728 for (i
= 0; i
< len
; ++i
)
1729 val
= iterative_hash_template_arg (TREE_VEC_ELT (arg
, i
), val
);
1733 case TYPE_PACK_EXPANSION
:
1734 case EXPR_PACK_EXPANSION
:
1735 val
= iterative_hash_template_arg (PACK_EXPANSION_PATTERN (arg
), val
);
1736 return iterative_hash_template_arg (PACK_EXPANSION_EXTRA_ARGS (arg
), val
);
1738 case TYPE_ARGUMENT_PACK
:
1739 case NONTYPE_ARGUMENT_PACK
:
1740 return iterative_hash_template_arg (ARGUMENT_PACK_ARGS (arg
), val
);
1743 for (; arg
; arg
= TREE_CHAIN (arg
))
1744 val
= iterative_hash_template_arg (TREE_VALUE (arg
), val
);
1748 for (; arg
; arg
= OVL_NEXT (arg
))
1749 val
= iterative_hash_template_arg (OVL_CURRENT (arg
), val
);
1755 iterative_hash_template_arg (TREE_TYPE (arg
), val
);
1756 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (arg
), i
, field
, value
)
1758 val
= iterative_hash_template_arg (field
, val
);
1759 val
= iterative_hash_template_arg (value
, val
);
1765 if (!DECL_ARTIFICIAL (arg
))
1767 val
= iterative_hash_object (DECL_PARM_INDEX (arg
), val
);
1768 val
= iterative_hash_object (DECL_PARM_LEVEL (arg
), val
);
1770 return iterative_hash_template_arg (TREE_TYPE (arg
), val
);
1773 return iterative_hash_template_arg (TARGET_EXPR_INITIAL (arg
), val
);
1776 val
= iterative_hash_template_arg (PTRMEM_CST_CLASS (arg
), val
);
1777 return iterative_hash_template_arg (PTRMEM_CST_MEMBER (arg
), val
);
1779 case TEMPLATE_PARM_INDEX
:
1780 val
= iterative_hash_template_arg
1781 (TREE_TYPE (TEMPLATE_PARM_DECL (arg
)), val
);
1782 val
= iterative_hash_object (TEMPLATE_PARM_LEVEL (arg
), val
);
1783 return iterative_hash_object (TEMPLATE_PARM_IDX (arg
), val
);
1786 val
= iterative_hash_object (TRAIT_EXPR_KIND (arg
), val
);
1787 val
= iterative_hash_template_arg (TRAIT_EXPR_TYPE1 (arg
), val
);
1788 return iterative_hash_template_arg (TRAIT_EXPR_TYPE2 (arg
), val
);
1791 val
= iterative_hash_template_arg (BINFO_TYPE (BASELINK_BINFO (arg
)),
1793 return iterative_hash_template_arg (DECL_NAME (get_first_fn (arg
)),
1797 val
= iterative_hash_template_arg (TREE_OPERAND (arg
, 0), val
);
1798 code
= TREE_CODE (TREE_OPERAND (arg
, 1));
1799 val
= iterative_hash_object (code
, val
);
1800 return iterative_hash_template_arg (TREE_OPERAND (arg
, 2), val
);
1803 /* A lambda can't appear in a template arg, but don't crash on
1805 gcc_assert (seen_error ());
1809 case IMPLICIT_CONV_EXPR
:
1810 case STATIC_CAST_EXPR
:
1811 case REINTERPRET_CAST_EXPR
:
1812 case CONST_CAST_EXPR
:
1813 case DYNAMIC_CAST_EXPR
:
1815 val
= iterative_hash_template_arg (TREE_TYPE (arg
), val
);
1816 /* Now hash operands as usual. */
1826 if (alias_template_specialization_p (arg
))
1828 // We want an alias specialization that survived strip_typedefs
1829 // to hash differently from its TYPE_CANONICAL, to avoid hash
1830 // collisions that compare as different in template_args_equal.
1831 // These could be dependent specializations that strip_typedefs
1832 // left alone, or untouched specializations because
1833 // coerce_template_parms returns the unconverted template
1834 // arguments if it sees incomplete argument packs.
1835 tree ti
= TYPE_TEMPLATE_INFO (arg
);
1836 return hash_tmpl_and_args (TI_TEMPLATE (ti
), TI_ARGS (ti
));
1838 if (TYPE_CANONICAL (arg
))
1839 return iterative_hash_object (TYPE_HASH (TYPE_CANONICAL (arg
)),
1841 else if (TREE_CODE (arg
) == DECLTYPE_TYPE
)
1842 return iterative_hash_template_arg (DECLTYPE_TYPE_EXPR (arg
), val
);
1843 /* Otherwise just compare the types during lookup. */
1846 case tcc_declaration
:
1848 return iterative_hash_expr (arg
, val
);
1851 gcc_assert (IS_EXPR_CODE_CLASS (tclass
));
1853 unsigned n
= cp_tree_operand_length (arg
);
1854 for (i
= 0; i
< n
; ++i
)
1855 val
= iterative_hash_template_arg (TREE_OPERAND (arg
, i
), val
);
1863 /* Unregister the specialization SPEC as a specialization of TMPL.
1864 Replace it with NEW_SPEC, if NEW_SPEC is non-NULL. Returns true
1865 if the SPEC was listed as a specialization of TMPL.
1867 Note that SPEC has been ggc_freed, so we can't look inside it. */
1870 reregister_specialization (tree spec
, tree tinfo
, tree new_spec
)
1875 elt
.tmpl
= most_general_template (TI_TEMPLATE (tinfo
));
1876 elt
.args
= TI_ARGS (tinfo
);
1877 elt
.spec
= NULL_TREE
;
1879 entry
= decl_specializations
->find (&elt
);
1882 gcc_assert (entry
->spec
== spec
|| entry
->spec
== new_spec
);
1883 gcc_assert (new_spec
!= NULL_TREE
);
1884 entry
->spec
= new_spec
;
1891 /* Like register_specialization, but for local declarations. We are
1892 registering SPEC, an instantiation of TMPL. */
1895 register_local_specialization (tree spec
, tree tmpl
)
1897 local_specializations
->put (tmpl
, spec
);
1900 /* TYPE is a class type. Returns true if TYPE is an explicitly
1901 specialized class. */
1904 explicit_class_specialization_p (tree type
)
1906 if (!CLASSTYPE_TEMPLATE_SPECIALIZATION (type
))
1908 return !uses_template_parms (CLASSTYPE_TI_ARGS (type
));
1911 /* Print the list of functions at FNS, going through all the overloads
1912 for each element of the list. Alternatively, FNS can not be a
1913 TREE_LIST, in which case it will be printed together with all the
1916 MORE and *STR should respectively be FALSE and NULL when the function
1917 is called from the outside. They are used internally on recursive
1918 calls. print_candidates manages the two parameters and leaves NULL
1919 in *STR when it ends. */
1922 print_candidates_1 (tree fns
, bool more
, const char **str
)
1925 char *spaces
= NULL
;
1927 for (fn
= fns
; fn
; fn
= OVL_NEXT (fn
))
1928 if (TREE_CODE (fn
) == TREE_LIST
)
1930 for (fn2
= fn
; fn2
!= NULL_TREE
; fn2
= TREE_CHAIN (fn2
))
1931 print_candidates_1 (TREE_VALUE (fn2
),
1932 TREE_CHAIN (fn2
) || more
, str
);
1936 tree cand
= OVL_CURRENT (fn
);
1939 /* Pick the prefix string. */
1940 if (!more
&& !OVL_NEXT (fns
))
1942 inform (DECL_SOURCE_LOCATION (cand
),
1943 "candidate is: %#D", cand
);
1947 *str
= _("candidates are:");
1948 spaces
= get_spaces (*str
);
1950 inform (DECL_SOURCE_LOCATION (cand
), "%s %#D", *str
, cand
);
1951 *str
= spaces
? spaces
: *str
;
1961 /* Print the list of candidate FNS in an error message. FNS can also
1962 be a TREE_LIST of non-functions in the case of an ambiguous lookup. */
1965 print_candidates (tree fns
)
1967 const char *str
= NULL
;
1968 print_candidates_1 (fns
, false, &str
);
1969 gcc_assert (str
== NULL
);
1972 /* Get a (possibly) constrained template declaration for the
1973 purpose of ordering candidates. */
1975 get_template_for_ordering (tree list
)
1977 gcc_assert (TREE_CODE (list
) == TREE_LIST
);
1978 tree f
= TREE_VALUE (list
);
1979 if (tree ti
= DECL_TEMPLATE_INFO (f
))
1980 return TI_TEMPLATE (ti
);
1984 /* Among candidates having the same signature, return the
1985 most constrained or NULL_TREE if there is no best candidate.
1986 If the signatures of candidates vary (e.g., template
1987 specialization vs. member function), then there can be no
1990 Note that we don't compare constraints on the functions
1991 themselves, but rather those of their templates. */
1993 most_constrained_function (tree candidates
)
1995 // Try to find the best candidate in a first pass.
1996 tree champ
= candidates
;
1997 for (tree c
= TREE_CHAIN (champ
); c
; c
= TREE_CHAIN (c
))
1999 int winner
= more_constrained (get_template_for_ordering (champ
),
2000 get_template_for_ordering (c
));
2002 champ
= c
; // The candidate is more constrained
2003 else if (winner
== 0)
2004 return NULL_TREE
; // Neither is more constrained
2007 // Verify that the champ is better than previous candidates.
2008 for (tree c
= candidates
; c
!= champ
; c
= TREE_CHAIN (c
)) {
2009 if (!more_constrained (get_template_for_ordering (champ
),
2010 get_template_for_ordering (c
)))
2018 /* Returns the template (one of the functions given by TEMPLATE_ID)
2019 which can be specialized to match the indicated DECL with the
2020 explicit template args given in TEMPLATE_ID. The DECL may be
2021 NULL_TREE if none is available. In that case, the functions in
2022 TEMPLATE_ID are non-members.
2024 If NEED_MEMBER_TEMPLATE is nonzero the function is known to be a
2025 specialization of a member template.
2027 The TEMPLATE_COUNT is the number of references to qualifying
2028 template classes that appeared in the name of the function. See
2029 check_explicit_specialization for a more accurate description.
2031 TSK indicates what kind of template declaration (if any) is being
2032 declared. TSK_TEMPLATE indicates that the declaration given by
2033 DECL, though a FUNCTION_DECL, has template parameters, and is
2034 therefore a template function.
2036 The template args (those explicitly specified and those deduced)
2037 are output in a newly created vector *TARGS_OUT.
2039 If it is impossible to determine the result, an error message is
2040 issued. The error_mark_node is returned to indicate failure. */
2043 determine_specialization (tree template_id
,
2046 int need_member_template
,
2052 tree explicit_targs
;
2053 tree candidates
= NULL_TREE
;
2055 /* A TREE_LIST of templates of which DECL may be a specialization.
2056 The TREE_VALUE of each node is a TEMPLATE_DECL. The
2057 corresponding TREE_PURPOSE is the set of template arguments that,
2058 when used to instantiate the template, would produce a function
2059 with the signature of DECL. */
2060 tree templates
= NULL_TREE
;
2062 cp_binding_level
*b
;
2064 *targs_out
= NULL_TREE
;
2066 if (template_id
== error_mark_node
|| decl
== error_mark_node
)
2067 return error_mark_node
;
2069 /* We shouldn't be specializing a member template of an
2070 unspecialized class template; we already gave an error in
2071 check_specialization_scope, now avoid crashing. */
2072 if (template_count
&& DECL_CLASS_SCOPE_P (decl
)
2073 && template_class_depth (DECL_CONTEXT (decl
)) > 0)
2075 gcc_assert (errorcount
);
2076 return error_mark_node
;
2079 fns
= TREE_OPERAND (template_id
, 0);
2080 explicit_targs
= TREE_OPERAND (template_id
, 1);
2082 if (fns
== error_mark_node
)
2083 return error_mark_node
;
2085 /* Check for baselinks. */
2086 if (BASELINK_P (fns
))
2087 fns
= BASELINK_FUNCTIONS (fns
);
2089 if (TREE_CODE (decl
) == FUNCTION_DECL
&& !is_overloaded_fn (fns
))
2091 error ("%qD is not a function template", fns
);
2092 return error_mark_node
;
2094 else if (VAR_P (decl
) && !variable_template_p (fns
))
2096 error ("%qD is not a variable template", fns
);
2097 return error_mark_node
;
2100 /* Count the number of template headers specified for this
2103 for (b
= current_binding_level
;
2104 b
->kind
== sk_template_parms
;
2108 tree orig_fns
= fns
;
2110 if (variable_template_p (fns
))
2112 tree parms
= INNERMOST_TEMPLATE_PARMS (DECL_TEMPLATE_PARMS (fns
));
2113 targs
= coerce_template_parms (parms
, explicit_targs
, fns
,
2114 tf_warning_or_error
,
2115 /*req_all*/true, /*use_defarg*/true);
2116 if (targs
!= error_mark_node
)
2117 templates
= tree_cons (targs
, fns
, templates
);
2119 else for (; fns
; fns
= OVL_NEXT (fns
))
2121 tree fn
= OVL_CURRENT (fns
);
2123 if (TREE_CODE (fn
) == TEMPLATE_DECL
)
2125 tree decl_arg_types
;
2129 /* In case of explicit specialization, we need to check if
2130 the number of template headers appearing in the specialization
2131 is correct. This is usually done in check_explicit_specialization,
2132 but the check done there cannot be exhaustive when specializing
2133 member functions. Consider the following code:
2135 template <> void A<int>::f(int);
2136 template <> template <> void A<int>::f(int);
2138 Assuming that A<int> is not itself an explicit specialization
2139 already, the first line specializes "f" which is a non-template
2140 member function, whilst the second line specializes "f" which
2141 is a template member function. So both lines are syntactically
2142 correct, and check_explicit_specialization does not reject
2145 Here, we can do better, as we are matching the specialization
2146 against the declarations. We count the number of template
2147 headers, and we check if they match TEMPLATE_COUNT + 1
2148 (TEMPLATE_COUNT is the number of qualifying template classes,
2149 plus there must be another header for the member template
2152 Notice that if header_count is zero, this is not a
2153 specialization but rather a template instantiation, so there
2154 is no check we can perform here. */
2155 if (header_count
&& header_count
!= template_count
+ 1)
2158 /* Check that the number of template arguments at the
2159 innermost level for DECL is the same as for FN. */
2160 if (current_binding_level
->kind
== sk_template_parms
2161 && !current_binding_level
->explicit_spec_p
2162 && (TREE_VEC_LENGTH (DECL_INNERMOST_TEMPLATE_PARMS (fn
))
2163 != TREE_VEC_LENGTH (INNERMOST_TEMPLATE_PARMS
2164 (current_template_parms
))))
2167 /* DECL might be a specialization of FN. */
2168 decl_arg_types
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
2169 fn_arg_types
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
2171 /* For a non-static member function, we need to make sure
2172 that the const qualification is the same. Since
2173 get_bindings does not try to merge the "this" parameter,
2174 we must do the comparison explicitly. */
2175 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
)
2176 && !same_type_p (TREE_VALUE (fn_arg_types
),
2177 TREE_VALUE (decl_arg_types
)))
2180 /* Skip the "this" parameter and, for constructors of
2181 classes with virtual bases, the VTT parameter. A
2182 full specialization of a constructor will have a VTT
2183 parameter, but a template never will. */
2185 = skip_artificial_parms_for (decl
, decl_arg_types
);
2187 = skip_artificial_parms_for (fn
, fn_arg_types
);
2189 /* Function templates cannot be specializations; there are
2190 no partial specializations of functions. Therefore, if
2191 the type of DECL does not match FN, there is no
2194 Note that it should never be the case that we have both
2195 candidates added here, and for regular member functions
2197 if (tsk
== tsk_template
)
2199 if (compparms (fn_arg_types
, decl_arg_types
))
2200 candidates
= tree_cons (NULL_TREE
, fn
, candidates
);
2204 /* See whether this function might be a specialization of this
2205 template. Suppress access control because we might be trying
2206 to make this specialization a friend, and we have already done
2207 access control for the declaration of the specialization. */
2208 push_deferring_access_checks (dk_no_check
);
2209 targs
= get_bindings (fn
, decl
, explicit_targs
, /*check_ret=*/true);
2210 pop_deferring_access_checks ();
2213 /* We cannot deduce template arguments that when used to
2214 specialize TMPL will produce DECL. */
2217 /* Remove, from the set of candidates, all those functions
2218 whose constraints are not satisfied. */
2219 if (flag_concepts
&& !constraints_satisfied_p (fn
, targs
))
2222 // Then, try to form the new function type.
2223 insttype
= tsubst (TREE_TYPE (fn
), targs
, tf_none
, NULL_TREE
);
2224 if (insttype
== error_mark_node
)
2227 = skip_artificial_parms_for (fn
, TYPE_ARG_TYPES (insttype
));
2228 if (!compparms (fn_arg_types
, decl_arg_types
))
2231 /* Save this template, and the arguments deduced. */
2232 templates
= tree_cons (targs
, fn
, templates
);
2234 else if (need_member_template
)
2235 /* FN is an ordinary member function, and we need a
2236 specialization of a member template. */
2238 else if (TREE_CODE (fn
) != FUNCTION_DECL
)
2239 /* We can get IDENTIFIER_NODEs here in certain erroneous
2242 else if (!DECL_FUNCTION_MEMBER_P (fn
))
2243 /* This is just an ordinary non-member function. Nothing can
2244 be a specialization of that. */
2246 else if (DECL_ARTIFICIAL (fn
))
2247 /* Cannot specialize functions that are created implicitly. */
2251 tree decl_arg_types
;
2253 /* This is an ordinary member function. However, since
2254 we're here, we can assume its enclosing class is a
2255 template class. For example,
2257 template <typename T> struct S { void f(); };
2258 template <> void S<int>::f() {}
2260 Here, S<int>::f is a non-template, but S<int> is a
2261 template class. If FN has the same type as DECL, we
2262 might be in business. */
2264 if (!DECL_TEMPLATE_INFO (fn
))
2265 /* Its enclosing class is an explicit specialization
2266 of a template class. This is not a candidate. */
2269 if (!same_type_p (TREE_TYPE (TREE_TYPE (decl
)),
2270 TREE_TYPE (TREE_TYPE (fn
))))
2271 /* The return types differ. */
2274 /* Adjust the type of DECL in case FN is a static member. */
2275 decl_arg_types
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
2276 if (DECL_STATIC_FUNCTION_P (fn
)
2277 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
2278 decl_arg_types
= TREE_CHAIN (decl_arg_types
);
2280 if (!compparms (TYPE_ARG_TYPES (TREE_TYPE (fn
)),
2284 // If the deduced arguments do not satisfy the constraints,
2285 // this is not a candidate.
2286 if (flag_concepts
&& !constraints_satisfied_p (fn
))
2289 // Add the candidate.
2290 candidates
= tree_cons (NULL_TREE
, fn
, candidates
);
2294 if (templates
&& TREE_CHAIN (templates
))
2300 It is possible for a specialization with a given function
2301 signature to be instantiated from more than one function
2302 template. In such cases, explicit specification of the
2303 template arguments must be used to uniquely identify the
2304 function template specialization being specialized.
2306 Note that here, there's no suggestion that we're supposed to
2307 determine which of the candidate templates is most
2308 specialized. However, we, also have:
2312 Partial ordering of overloaded function template
2313 declarations is used in the following contexts to select
2314 the function template to which a function template
2315 specialization refers:
2317 -- when an explicit specialization refers to a function
2320 So, we do use the partial ordering rules, at least for now.
2321 This extension can only serve to make invalid programs valid,
2322 so it's safe. And, there is strong anecdotal evidence that
2323 the committee intended the partial ordering rules to apply;
2324 the EDG front end has that behavior, and John Spicer claims
2325 that the committee simply forgot to delete the wording in
2326 [temp.expl.spec]. */
2327 tree tmpl
= most_specialized_instantiation (templates
);
2328 if (tmpl
!= error_mark_node
)
2331 TREE_CHAIN (templates
) = NULL_TREE
;
2335 // Concepts allows multiple declarations of member functions
2336 // with the same signature. Like above, we need to rely on
2337 // on the partial ordering of those candidates to determine which
2339 if (flag_concepts
&& candidates
&& TREE_CHAIN (candidates
))
2341 if (tree cand
= most_constrained_function (candidates
))
2344 TREE_CHAIN (cand
) = NULL_TREE
;
2348 if (templates
== NULL_TREE
&& candidates
== NULL_TREE
)
2350 error ("template-id %qD for %q+D does not match any template "
2351 "declaration", template_id
, decl
);
2352 if (header_count
&& header_count
!= template_count
+ 1)
2353 inform (input_location
, "saw %d %<template<>%>, need %d for "
2354 "specializing a member function template",
2355 header_count
, template_count
+ 1);
2357 print_candidates (orig_fns
);
2358 return error_mark_node
;
2360 else if ((templates
&& TREE_CHAIN (templates
))
2361 || (candidates
&& TREE_CHAIN (candidates
))
2362 || (templates
&& candidates
))
2364 error ("ambiguous template specialization %qD for %q+D",
2366 candidates
= chainon (candidates
, templates
);
2367 print_candidates (candidates
);
2368 return error_mark_node
;
2371 /* We have one, and exactly one, match. */
2374 tree fn
= TREE_VALUE (candidates
);
2375 *targs_out
= copy_node (DECL_TI_ARGS (fn
));
2377 // Propagate the candidate's constraints to the declaration.
2378 set_constraints (decl
, get_constraints (fn
));
2380 /* DECL is a re-declaration or partial instantiation of a template
2382 if (TREE_CODE (fn
) == TEMPLATE_DECL
)
2384 /* It was a specialization of an ordinary member function in a
2386 return DECL_TI_TEMPLATE (fn
);
2389 /* It was a specialization of a template. */
2390 targs
= DECL_TI_ARGS (DECL_TEMPLATE_RESULT (TREE_VALUE (templates
)));
2391 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (targs
))
2393 *targs_out
= copy_node (targs
);
2394 SET_TMPL_ARGS_LEVEL (*targs_out
,
2395 TMPL_ARGS_DEPTH (*targs_out
),
2396 TREE_PURPOSE (templates
));
2399 *targs_out
= TREE_PURPOSE (templates
);
2400 return TREE_VALUE (templates
);
2403 /* Returns a chain of parameter types, exactly like the SPEC_TYPES,
2404 but with the default argument values filled in from those in the
2408 copy_default_args_to_explicit_spec_1 (tree spec_types
,
2411 tree new_spec_types
;
2416 if (spec_types
== void_list_node
)
2417 return void_list_node
;
2419 /* Substitute into the rest of the list. */
2421 copy_default_args_to_explicit_spec_1 (TREE_CHAIN (spec_types
),
2422 TREE_CHAIN (tmpl_types
));
2424 /* Add the default argument for this parameter. */
2425 return hash_tree_cons (TREE_PURPOSE (tmpl_types
),
2426 TREE_VALUE (spec_types
),
2430 /* DECL is an explicit specialization. Replicate default arguments
2431 from the template it specializes. (That way, code like:
2433 template <class T> void f(T = 3);
2434 template <> void f(double);
2437 works, as required.) An alternative approach would be to look up
2438 the correct default arguments at the call-site, but this approach
2439 is consistent with how implicit instantiations are handled. */
2442 copy_default_args_to_explicit_spec (tree decl
)
2447 tree new_spec_types
;
2451 tree object_type
= NULL_TREE
;
2452 tree in_charge
= NULL_TREE
;
2453 tree vtt
= NULL_TREE
;
2455 /* See if there's anything we need to do. */
2456 tmpl
= DECL_TI_TEMPLATE (decl
);
2457 tmpl_types
= TYPE_ARG_TYPES (TREE_TYPE (DECL_TEMPLATE_RESULT (tmpl
)));
2458 for (t
= tmpl_types
; t
; t
= TREE_CHAIN (t
))
2459 if (TREE_PURPOSE (t
))
2464 old_type
= TREE_TYPE (decl
);
2465 spec_types
= TYPE_ARG_TYPES (old_type
);
2467 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
2469 /* Remove the this pointer, but remember the object's type for
2471 object_type
= TREE_TYPE (TREE_VALUE (spec_types
));
2472 spec_types
= TREE_CHAIN (spec_types
);
2473 tmpl_types
= TREE_CHAIN (tmpl_types
);
2475 if (DECL_HAS_IN_CHARGE_PARM_P (decl
))
2477 /* DECL may contain more parameters than TMPL due to the extra
2478 in-charge parameter in constructors and destructors. */
2479 in_charge
= spec_types
;
2480 spec_types
= TREE_CHAIN (spec_types
);
2482 if (DECL_HAS_VTT_PARM_P (decl
))
2485 spec_types
= TREE_CHAIN (spec_types
);
2489 /* Compute the merged default arguments. */
2491 copy_default_args_to_explicit_spec_1 (spec_types
, tmpl_types
);
2493 /* Compute the new FUNCTION_TYPE. */
2497 new_spec_types
= hash_tree_cons (TREE_PURPOSE (vtt
),
2502 /* Put the in-charge parameter back. */
2503 new_spec_types
= hash_tree_cons (TREE_PURPOSE (in_charge
),
2504 TREE_VALUE (in_charge
),
2507 new_type
= build_method_type_directly (object_type
,
2508 TREE_TYPE (old_type
),
2512 new_type
= build_function_type (TREE_TYPE (old_type
),
2514 new_type
= cp_build_type_attribute_variant (new_type
,
2515 TYPE_ATTRIBUTES (old_type
));
2516 new_type
= build_exception_variant (new_type
,
2517 TYPE_RAISES_EXCEPTIONS (old_type
));
2519 if (TYPE_HAS_LATE_RETURN_TYPE (old_type
))
2520 TYPE_HAS_LATE_RETURN_TYPE (new_type
) = 1;
2522 TREE_TYPE (decl
) = new_type
;
2525 /* Return the number of template headers we expect to see for a definition
2526 or specialization of CTYPE or one of its non-template members. */
2529 num_template_headers_for_class (tree ctype
)
2531 int num_templates
= 0;
2533 while (ctype
&& CLASS_TYPE_P (ctype
))
2535 /* You're supposed to have one `template <...>' for every
2536 template class, but you don't need one for a full
2537 specialization. For example:
2539 template <class T> struct S{};
2540 template <> struct S<int> { void f(); };
2541 void S<int>::f () {}
2543 is correct; there shouldn't be a `template <>' for the
2544 definition of `S<int>::f'. */
2545 if (!CLASSTYPE_TEMPLATE_INFO (ctype
))
2546 /* If CTYPE does not have template information of any
2547 kind, then it is not a template, nor is it nested
2548 within a template. */
2550 if (explicit_class_specialization_p (ctype
))
2552 if (PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (ctype
)))
2555 ctype
= TYPE_CONTEXT (ctype
);
2558 return num_templates
;
2561 /* Do a simple sanity check on the template headers that precede the
2562 variable declaration DECL. */
2565 check_template_variable (tree decl
)
2567 tree ctx
= CP_DECL_CONTEXT (decl
);
2568 int wanted
= num_template_headers_for_class (ctx
);
2569 if (DECL_LANG_SPECIFIC (decl
) && DECL_TEMPLATE_INFO (decl
)
2570 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (decl
)))
2572 if (cxx_dialect
< cxx14
)
2573 pedwarn (DECL_SOURCE_LOCATION (decl
), 0,
2574 "variable templates only available with "
2575 "-std=c++14 or -std=gnu++14");
2577 // Namespace-scope variable templates should have a template header.
2580 if (template_header_count
> wanted
)
2582 bool warned
= pedwarn (DECL_SOURCE_LOCATION (decl
), 0,
2583 "too many template headers for %D (should be %d)",
2585 if (warned
&& CLASS_TYPE_P (ctx
)
2586 && CLASSTYPE_TEMPLATE_SPECIALIZATION (ctx
))
2587 inform (DECL_SOURCE_LOCATION (decl
),
2588 "members of an explicitly specialized class are defined "
2589 "without a template header");
2593 /* Check to see if the function just declared, as indicated in
2594 DECLARATOR, and in DECL, is a specialization of a function
2595 template. We may also discover that the declaration is an explicit
2596 instantiation at this point.
2598 Returns DECL, or an equivalent declaration that should be used
2599 instead if all goes well. Issues an error message if something is
2600 amiss. Returns error_mark_node if the error is not easily
2603 FLAGS is a bitmask consisting of the following flags:
2605 2: The function has a definition.
2606 4: The function is a friend.
2608 The TEMPLATE_COUNT is the number of references to qualifying
2609 template classes that appeared in the name of the function. For
2612 template <class T> struct S { void f(); };
2615 the TEMPLATE_COUNT would be 1. However, explicitly specialized
2616 classes are not counted in the TEMPLATE_COUNT, so that in
2618 template <class T> struct S {};
2619 template <> struct S<int> { void f(); }
2620 template <> void S<int>::f();
2622 the TEMPLATE_COUNT would be 0. (Note that this declaration is
2623 invalid; there should be no template <>.)
2625 If the function is a specialization, it is marked as such via
2626 DECL_TEMPLATE_SPECIALIZATION. Furthermore, its DECL_TEMPLATE_INFO
2627 is set up correctly, and it is added to the list of specializations
2628 for that template. */
2631 check_explicit_specialization (tree declarator
,
2636 int have_def
= flags
& 2;
2637 int is_friend
= flags
& 4;
2638 bool is_concept
= flags
& 8;
2639 int specialization
= 0;
2640 int explicit_instantiation
= 0;
2641 int member_specialization
= 0;
2642 tree ctype
= DECL_CLASS_CONTEXT (decl
);
2643 tree dname
= DECL_NAME (decl
);
2648 if (!processing_specialization
)
2651 tsk
= tsk_excessive_parms
;
2654 tsk
= current_tmpl_spec_kind (template_count
);
2659 if (processing_specialization
&& !VAR_P (decl
))
2662 SET_DECL_TEMPLATE_SPECIALIZATION (decl
);
2664 else if (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
)
2667 /* This could be something like:
2669 template <class T> void f(T);
2670 class S { friend void f<>(int); } */
2674 /* This case handles bogus declarations like template <>
2675 template <class T> void f<int>(); */
2677 error ("template-id %qD in declaration of primary template",
2684 case tsk_invalid_member_spec
:
2685 /* The error has already been reported in
2686 check_specialization_scope. */
2687 return error_mark_node
;
2689 case tsk_invalid_expl_inst
:
2690 error ("template parameter list used in explicit instantiation");
2696 error ("definition provided for explicit instantiation");
2698 explicit_instantiation
= 1;
2701 case tsk_excessive_parms
:
2702 case tsk_insufficient_parms
:
2703 if (tsk
== tsk_excessive_parms
)
2704 error ("too many template parameter lists in declaration of %qD",
2706 else if (template_header_count
)
2707 error("too few template parameter lists in declaration of %qD", decl
);
2709 error("explicit specialization of %qD must be introduced by "
2710 "%<template <>%>", decl
);
2715 error ("explicit specialization declared %<concept%>");
2717 if (VAR_P (decl
) && TREE_CODE (declarator
) != TEMPLATE_ID_EXPR
)
2718 /* In cases like template<> constexpr bool v = true;
2719 We'll give an error in check_template_variable. */
2722 SET_DECL_TEMPLATE_SPECIALIZATION (decl
);
2724 member_specialization
= 1;
2730 if (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
)
2732 /* This case handles bogus declarations like template <>
2733 template <class T> void f<int>(); */
2735 if (!uses_template_parms (declarator
))
2736 error ("template-id %qD in declaration of primary template",
2738 else if (variable_template_p (TREE_OPERAND (declarator
, 0)))
2740 /* Partial specialization of variable template. */
2741 SET_DECL_TEMPLATE_SPECIALIZATION (decl
);
2745 else if (cxx_dialect
< cxx14
)
2746 error ("non-type partial specialization %qD "
2747 "is not allowed", declarator
);
2749 error ("non-class, non-variable partial specialization %qD "
2750 "is not allowed", declarator
);
2755 if (ctype
&& CLASSTYPE_TEMPLATE_INSTANTIATION (ctype
))
2756 /* This is a specialization of a member template, without
2757 specialization the containing class. Something like:
2759 template <class T> struct S {
2760 template <class U> void f (U);
2762 template <> template <class U> void S<int>::f(U) {}
2764 That's a specialization -- but of the entire template. */
2772 if ((specialization
|| member_specialization
)
2773 /* This doesn't apply to variable templates. */
2774 && (TREE_CODE (TREE_TYPE (decl
)) == FUNCTION_TYPE
2775 || TREE_CODE (TREE_TYPE (decl
)) == METHOD_TYPE
))
2777 tree t
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
2778 for (; t
; t
= TREE_CHAIN (t
))
2779 if (TREE_PURPOSE (t
))
2781 permerror (input_location
,
2782 "default argument specified in explicit specialization");
2787 if (specialization
|| member_specialization
|| explicit_instantiation
)
2789 tree tmpl
= NULL_TREE
;
2790 tree targs
= NULL_TREE
;
2791 bool was_template_id
= (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
);
2793 /* Make sure that the declarator is a TEMPLATE_ID_EXPR. */
2794 if (!was_template_id
)
2798 gcc_assert (identifier_p (declarator
));
2803 /* If there is no class context, the explicit instantiation
2804 must be at namespace scope. */
2805 gcc_assert (DECL_NAMESPACE_SCOPE_P (decl
));
2807 /* Find the namespace binding, using the declaration
2809 fns
= lookup_qualified_name (CP_DECL_CONTEXT (decl
), dname
,
2811 if (fns
== error_mark_node
|| !is_overloaded_fn (fns
))
2813 error ("%qD is not a template function", dname
);
2814 fns
= error_mark_node
;
2818 declarator
= lookup_template_function (fns
, NULL_TREE
);
2821 if (declarator
== error_mark_node
)
2822 return error_mark_node
;
2824 if (ctype
!= NULL_TREE
&& TYPE_BEING_DEFINED (ctype
))
2826 if (!explicit_instantiation
)
2827 /* A specialization in class scope. This is invalid,
2828 but the error will already have been flagged by
2829 check_specialization_scope. */
2830 return error_mark_node
;
2833 /* It's not valid to write an explicit instantiation in
2836 class C { template void f(); }
2838 This case is caught by the parser. However, on
2841 template class C { void f(); };
2843 (which is invalid) we can get here. The error will be
2850 else if (ctype
!= NULL_TREE
2851 && (identifier_p (TREE_OPERAND (declarator
, 0))))
2853 // We'll match variable templates in start_decl.
2857 /* Find the list of functions in ctype that have the same
2858 name as the declared function. */
2859 tree name
= TREE_OPERAND (declarator
, 0);
2860 tree fns
= NULL_TREE
;
2863 if (constructor_name_p (name
, ctype
))
2865 int is_constructor
= DECL_CONSTRUCTOR_P (decl
);
2867 if (is_constructor
? !TYPE_HAS_USER_CONSTRUCTOR (ctype
)
2868 : !CLASSTYPE_DESTRUCTORS (ctype
))
2870 /* From [temp.expl.spec]:
2872 If such an explicit specialization for the member
2873 of a class template names an implicitly-declared
2874 special member function (clause _special_), the
2875 program is ill-formed.
2877 Similar language is found in [temp.explicit]. */
2878 error ("specialization of implicitly-declared special member function");
2879 return error_mark_node
;
2882 name
= is_constructor
? ctor_identifier
: dtor_identifier
;
2885 if (!DECL_CONV_FN_P (decl
))
2887 idx
= lookup_fnfields_1 (ctype
, name
);
2889 fns
= (*CLASSTYPE_METHOD_VEC (ctype
))[idx
];
2893 vec
<tree
, va_gc
> *methods
;
2896 /* For a type-conversion operator, we cannot do a
2897 name-based lookup. We might be looking for `operator
2898 int' which will be a specialization of `operator T'.
2899 So, we find *all* the conversion operators, and then
2900 select from them. */
2903 methods
= CLASSTYPE_METHOD_VEC (ctype
);
2905 for (idx
= CLASSTYPE_FIRST_CONVERSION_SLOT
;
2906 methods
->iterate (idx
, &ovl
);
2909 if (!DECL_CONV_FN_P (OVL_CURRENT (ovl
)))
2910 /* There are no more conversion functions. */
2913 /* Glue all these conversion functions together
2914 with those we already have. */
2915 for (; ovl
; ovl
= OVL_NEXT (ovl
))
2916 fns
= ovl_cons (OVL_CURRENT (ovl
), fns
);
2920 if (fns
== NULL_TREE
)
2922 error ("no member function %qD declared in %qT", name
, ctype
);
2923 return error_mark_node
;
2926 TREE_OPERAND (declarator
, 0) = fns
;
2929 /* Figure out what exactly is being specialized at this point.
2930 Note that for an explicit instantiation, even one for a
2931 member function, we cannot tell apriori whether the
2932 instantiation is for a member template, or just a member
2933 function of a template class. Even if a member template is
2934 being instantiated, the member template arguments may be
2935 elided if they can be deduced from the rest of the
2937 tmpl
= determine_specialization (declarator
, decl
,
2939 member_specialization
,
2943 if (!tmpl
|| tmpl
== error_mark_node
)
2944 /* We couldn't figure out what this declaration was
2946 return error_mark_node
;
2949 if (!ctype
&& !was_template_id
2950 && (specialization
|| member_specialization
2951 || explicit_instantiation
)
2952 && !is_associated_namespace (CP_DECL_CONTEXT (decl
),
2953 CP_DECL_CONTEXT (tmpl
)))
2954 error ("%qD is not declared in %qD",
2955 tmpl
, current_namespace
);
2957 tree gen_tmpl
= most_general_template (tmpl
);
2959 if (explicit_instantiation
)
2961 /* We don't set DECL_EXPLICIT_INSTANTIATION here; that
2962 is done by do_decl_instantiation later. */
2964 int arg_depth
= TMPL_ARGS_DEPTH (targs
);
2965 int parm_depth
= TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl
));
2967 if (arg_depth
> parm_depth
)
2969 /* If TMPL is not the most general template (for
2970 example, if TMPL is a friend template that is
2971 injected into namespace scope), then there will
2972 be too many levels of TARGS. Remove some of them
2977 new_targs
= make_tree_vec (parm_depth
);
2978 for (i
= arg_depth
- parm_depth
; i
< arg_depth
; ++i
)
2979 TREE_VEC_ELT (new_targs
, i
- (arg_depth
- parm_depth
))
2980 = TREE_VEC_ELT (targs
, i
);
2984 return instantiate_template (tmpl
, targs
, tf_error
);
2987 /* If we thought that the DECL was a member function, but it
2988 turns out to be specializing a static member function,
2989 make DECL a static member function as well. */
2990 if (DECL_FUNCTION_TEMPLATE_P (tmpl
)
2991 && DECL_STATIC_FUNCTION_P (tmpl
)
2992 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
2993 revert_static_member_fn (decl
);
2995 /* If this is a specialization of a member template of a
2996 template class, we want to return the TEMPLATE_DECL, not
2997 the specialization of it. */
2998 if (tsk
== tsk_template
&& !was_template_id
)
3000 tree result
= DECL_TEMPLATE_RESULT (tmpl
);
3001 SET_DECL_TEMPLATE_SPECIALIZATION (tmpl
);
3002 DECL_INITIAL (result
) = NULL_TREE
;
3006 DECL_SOURCE_LOCATION (tmpl
) = DECL_SOURCE_LOCATION (decl
);
3007 DECL_SOURCE_LOCATION (result
)
3008 = DECL_SOURCE_LOCATION (decl
);
3009 /* We want to use the argument list specified in the
3010 definition, not in the original declaration. */
3011 DECL_ARGUMENTS (result
) = DECL_ARGUMENTS (decl
);
3012 for (parm
= DECL_ARGUMENTS (result
); parm
;
3013 parm
= DECL_CHAIN (parm
))
3014 DECL_CONTEXT (parm
) = result
;
3016 return register_specialization (tmpl
, gen_tmpl
, targs
,
3020 /* Set up the DECL_TEMPLATE_INFO for DECL. */
3021 DECL_TEMPLATE_INFO (decl
) = build_template_info (tmpl
, targs
);
3023 if (was_template_id
)
3024 TINFO_USED_TEMPLATE_ID (DECL_TEMPLATE_INFO (decl
)) = true;
3026 /* Inherit default function arguments from the template
3027 DECL is specializing. */
3028 if (DECL_FUNCTION_TEMPLATE_P (tmpl
))
3029 copy_default_args_to_explicit_spec (decl
);
3031 /* This specialization has the same protection as the
3032 template it specializes. */
3033 TREE_PRIVATE (decl
) = TREE_PRIVATE (gen_tmpl
);
3034 TREE_PROTECTED (decl
) = TREE_PROTECTED (gen_tmpl
);
3036 /* 7.1.1-1 [dcl.stc]
3038 A storage-class-specifier shall not be specified in an
3039 explicit specialization...
3041 The parser rejects these, so unless action is taken here,
3042 explicit function specializations will always appear with
3045 The action recommended by the C++ CWG in response to C++
3046 defect report 605 is to make the storage class and linkage
3047 of the explicit specialization match the templated function:
3049 http://www.open-std.org/jtc1/sc22/wg21/docs/cwg_active.html#605
3051 if (tsk
== tsk_expl_spec
&& DECL_FUNCTION_TEMPLATE_P (gen_tmpl
))
3053 tree tmpl_func
= DECL_TEMPLATE_RESULT (gen_tmpl
);
3054 gcc_assert (TREE_CODE (tmpl_func
) == FUNCTION_DECL
);
3056 /* A concept cannot be specialized. */
3057 if (DECL_DECLARED_CONCEPT_P (tmpl_func
))
3059 error ("explicit specialization of function concept %qD",
3061 return error_mark_node
;
3064 /* This specialization has the same linkage and visibility as
3065 the function template it specializes. */
3066 TREE_PUBLIC (decl
) = TREE_PUBLIC (tmpl_func
);
3067 if (! TREE_PUBLIC (decl
))
3069 DECL_INTERFACE_KNOWN (decl
) = 1;
3070 DECL_NOT_REALLY_EXTERN (decl
) = 1;
3072 DECL_THIS_STATIC (decl
) = DECL_THIS_STATIC (tmpl_func
);
3073 if (DECL_VISIBILITY_SPECIFIED (tmpl_func
))
3075 DECL_VISIBILITY_SPECIFIED (decl
) = 1;
3076 DECL_VISIBILITY (decl
) = DECL_VISIBILITY (tmpl_func
);
3080 /* If DECL is a friend declaration, declared using an
3081 unqualified name, the namespace associated with DECL may
3082 have been set incorrectly. For example, in:
3084 template <typename T> void f(T);
3086 struct S { friend void f<int>(int); }
3089 we will have set the DECL_CONTEXT for the friend
3090 declaration to N, rather than to the global namespace. */
3091 if (DECL_NAMESPACE_SCOPE_P (decl
))
3092 DECL_CONTEXT (decl
) = DECL_CONTEXT (tmpl
);
3094 if (is_friend
&& !have_def
)
3095 /* This is not really a declaration of a specialization.
3096 It's just the name of an instantiation. But, it's not
3097 a request for an instantiation, either. */
3098 SET_DECL_IMPLICIT_INSTANTIATION (decl
);
3099 else if (TREE_CODE (decl
) == FUNCTION_DECL
)
3100 /* A specialization is not necessarily COMDAT. */
3101 DECL_COMDAT (decl
) = (TREE_PUBLIC (decl
)
3102 && DECL_DECLARED_INLINE_P (decl
));
3103 else if (VAR_P (decl
))
3104 DECL_COMDAT (decl
) = false;
3106 /* If this is a full specialization, register it so that we can find
3107 it again. Partial specializations will be registered in
3108 process_partial_specialization. */
3109 if (!processing_template_decl
)
3110 decl
= register_specialization (decl
, gen_tmpl
, targs
,
3113 /* A 'structor should already have clones. */
3114 gcc_assert (decl
== error_mark_node
3115 || variable_template_p (tmpl
)
3116 || !(DECL_CONSTRUCTOR_P (decl
)
3117 || DECL_DESTRUCTOR_P (decl
))
3118 || DECL_CLONED_FUNCTION_P (DECL_CHAIN (decl
)));
3125 /* Returns 1 iff PARMS1 and PARMS2 are identical sets of template
3126 parameters. These are represented in the same format used for
3127 DECL_TEMPLATE_PARMS. */
3130 comp_template_parms (const_tree parms1
, const_tree parms2
)
3135 if (parms1
== parms2
)
3138 for (p1
= parms1
, p2
= parms2
;
3139 p1
!= NULL_TREE
&& p2
!= NULL_TREE
;
3140 p1
= TREE_CHAIN (p1
), p2
= TREE_CHAIN (p2
))
3142 tree t1
= TREE_VALUE (p1
);
3143 tree t2
= TREE_VALUE (p2
);
3146 gcc_assert (TREE_CODE (t1
) == TREE_VEC
);
3147 gcc_assert (TREE_CODE (t2
) == TREE_VEC
);
3149 if (TREE_VEC_LENGTH (t1
) != TREE_VEC_LENGTH (t2
))
3152 for (i
= 0; i
< TREE_VEC_LENGTH (t2
); ++i
)
3154 tree parm1
= TREE_VALUE (TREE_VEC_ELT (t1
, i
));
3155 tree parm2
= TREE_VALUE (TREE_VEC_ELT (t2
, i
));
3157 /* If either of the template parameters are invalid, assume
3158 they match for the sake of error recovery. */
3159 if (error_operand_p (parm1
) || error_operand_p (parm2
))
3162 if (TREE_CODE (parm1
) != TREE_CODE (parm2
))
3165 if (TREE_CODE (parm1
) == TEMPLATE_TYPE_PARM
3166 && (TEMPLATE_TYPE_PARAMETER_PACK (parm1
)
3167 == TEMPLATE_TYPE_PARAMETER_PACK (parm2
)))
3169 else if (!same_type_p (TREE_TYPE (parm1
), TREE_TYPE (parm2
)))
3174 if ((p1
!= NULL_TREE
) != (p2
!= NULL_TREE
))
3175 /* One set of parameters has more parameters lists than the
3182 /* Determine whether PARM is a parameter pack. */
3185 template_parameter_pack_p (const_tree parm
)
3187 /* Determine if we have a non-type template parameter pack. */
3188 if (TREE_CODE (parm
) == PARM_DECL
)
3189 return (DECL_TEMPLATE_PARM_P (parm
)
3190 && TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm
)));
3191 if (TREE_CODE (parm
) == TEMPLATE_PARM_INDEX
)
3192 return TEMPLATE_PARM_PARAMETER_PACK (parm
);
3194 /* If this is a list of template parameters, we could get a
3195 TYPE_DECL or a TEMPLATE_DECL. */
3196 if (TREE_CODE (parm
) == TYPE_DECL
|| TREE_CODE (parm
) == TEMPLATE_DECL
)
3197 parm
= TREE_TYPE (parm
);
3199 /* Otherwise it must be a type template parameter. */
3200 return ((TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
3201 || TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
)
3202 && TEMPLATE_TYPE_PARAMETER_PACK (parm
));
3205 /* Determine if T is a function parameter pack. */
3208 function_parameter_pack_p (const_tree t
)
3210 if (t
&& TREE_CODE (t
) == PARM_DECL
)
3211 return DECL_PACK_P (t
);
3215 /* Return the function template declaration of PRIMARY_FUNC_TMPL_INST.
3216 PRIMARY_FUNC_TMPL_INST is a primary function template instantiation. */
3219 get_function_template_decl (const_tree primary_func_tmpl_inst
)
3221 if (! primary_func_tmpl_inst
3222 || TREE_CODE (primary_func_tmpl_inst
) != FUNCTION_DECL
3223 || ! primary_template_instantiation_p (primary_func_tmpl_inst
))
3226 return DECL_TEMPLATE_RESULT (DECL_TI_TEMPLATE (primary_func_tmpl_inst
));
3229 /* Return true iff the function parameter PARAM_DECL was expanded
3230 from the function parameter pack PACK. */
3233 function_parameter_expanded_from_pack_p (tree param_decl
, tree pack
)
3235 if (DECL_ARTIFICIAL (param_decl
)
3236 || !function_parameter_pack_p (pack
))
3239 /* The parameter pack and its pack arguments have the same
3241 return DECL_PARM_INDEX (pack
) == DECL_PARM_INDEX (param_decl
);
3244 /* Determine whether ARGS describes a variadic template args list,
3245 i.e., one that is terminated by a template argument pack. */
3248 template_args_variadic_p (tree args
)
3253 if (args
== NULL_TREE
)
3256 args
= INNERMOST_TEMPLATE_ARGS (args
);
3257 nargs
= TREE_VEC_LENGTH (args
);
3262 last_parm
= TREE_VEC_ELT (args
, nargs
- 1);
3264 return ARGUMENT_PACK_P (last_parm
);
3267 /* Generate a new name for the parameter pack name NAME (an
3268 IDENTIFIER_NODE) that incorporates its */
3271 make_ith_pack_parameter_name (tree name
, int i
)
3273 /* Munge the name to include the parameter index. */
3274 #define NUMBUF_LEN 128
3275 char numbuf
[NUMBUF_LEN
];
3279 if (name
== NULL_TREE
)
3281 snprintf (numbuf
, NUMBUF_LEN
, "%i", i
);
3282 newname_len
= IDENTIFIER_LENGTH (name
)
3283 + strlen (numbuf
) + 2;
3284 newname
= (char*)alloca (newname_len
);
3285 snprintf (newname
, newname_len
,
3286 "%s#%i", IDENTIFIER_POINTER (name
), i
);
3287 return get_identifier (newname
);
3290 /* Return true if T is a primary function, class or alias template
3294 primary_template_instantiation_p (const_tree t
)
3299 if (TREE_CODE (t
) == FUNCTION_DECL
)
3300 return DECL_LANG_SPECIFIC (t
)
3301 && DECL_TEMPLATE_INSTANTIATION (t
)
3302 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (t
));
3303 else if (CLASS_TYPE_P (t
) && !TYPE_DECL_ALIAS_P (TYPE_NAME (t
)))
3304 return CLASSTYPE_TEMPLATE_INSTANTIATION (t
)
3305 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (t
));
3306 else if (alias_template_specialization_p (t
))
3311 /* Return true if PARM is a template template parameter. */
3314 template_template_parameter_p (const_tree parm
)
3316 return DECL_TEMPLATE_TEMPLATE_PARM_P (parm
);
3319 /* Return true iff PARM is a DECL representing a type template
3323 template_type_parameter_p (const_tree parm
)
3326 && (TREE_CODE (parm
) == TYPE_DECL
3327 || TREE_CODE (parm
) == TEMPLATE_DECL
)
3328 && DECL_TEMPLATE_PARM_P (parm
));
3331 /* Return the template parameters of T if T is a
3332 primary template instantiation, NULL otherwise. */
3335 get_primary_template_innermost_parameters (const_tree t
)
3337 tree parms
= NULL
, template_info
= NULL
;
3339 if ((template_info
= get_template_info (t
))
3340 && primary_template_instantiation_p (t
))
3341 parms
= INNERMOST_TEMPLATE_PARMS
3342 (DECL_TEMPLATE_PARMS (TI_TEMPLATE (template_info
)));
3347 /* Return the template parameters of the LEVELth level from the full list
3348 of template parameters PARMS. */
3351 get_template_parms_at_level (tree parms
, int level
)
3355 || TREE_CODE (parms
) != TREE_LIST
3356 || level
> TMPL_PARMS_DEPTH (parms
))
3359 for (p
= parms
; p
; p
= TREE_CHAIN (p
))
3360 if (TMPL_PARMS_DEPTH (p
) == level
)
3366 /* Returns the template arguments of T if T is a template instantiation,
3370 get_template_innermost_arguments (const_tree t
)
3372 tree args
= NULL
, template_info
= NULL
;
3374 if ((template_info
= get_template_info (t
))
3375 && TI_ARGS (template_info
))
3376 args
= INNERMOST_TEMPLATE_ARGS (TI_ARGS (template_info
));
3381 /* Return the argument pack elements of T if T is a template argument pack,
3385 get_template_argument_pack_elems (const_tree t
)
3387 if (TREE_CODE (t
) != TYPE_ARGUMENT_PACK
3388 && TREE_CODE (t
) != NONTYPE_ARGUMENT_PACK
)
3391 return ARGUMENT_PACK_ARGS (t
);
3394 /* Structure used to track the progress of find_parameter_packs_r. */
3395 struct find_parameter_pack_data
3397 /* TREE_LIST that will contain all of the parameter packs found by
3399 tree
* parameter_packs
;
3401 /* Set of AST nodes that have been visited by the traversal. */
3402 hash_set
<tree
> *visited
;
3404 /* True iff we're making a type pack expansion. */
3405 bool type_pack_expansion_p
;
3408 /* Identifies all of the argument packs that occur in a template
3409 argument and appends them to the TREE_LIST inside DATA, which is a
3410 find_parameter_pack_data structure. This is a subroutine of
3411 make_pack_expansion and uses_parameter_packs. */
3413 find_parameter_packs_r (tree
*tp
, int *walk_subtrees
, void* data
)
3416 struct find_parameter_pack_data
* ppd
=
3417 (struct find_parameter_pack_data
*)data
;
3418 bool parameter_pack_p
= false;
3420 /* Handle type aliases/typedefs. */
3421 if (TYPE_ALIAS_P (t
))
3423 if (TYPE_TEMPLATE_INFO (t
))
3424 cp_walk_tree (&TYPE_TI_ARGS (t
),
3425 &find_parameter_packs_r
,
3431 /* Identify whether this is a parameter pack or not. */
3432 switch (TREE_CODE (t
))
3434 case TEMPLATE_PARM_INDEX
:
3435 if (TEMPLATE_PARM_PARAMETER_PACK (t
))
3436 parameter_pack_p
= true;
3439 case TEMPLATE_TYPE_PARM
:
3440 t
= TYPE_MAIN_VARIANT (t
);
3441 case TEMPLATE_TEMPLATE_PARM
:
3442 /* If the placeholder appears in the decl-specifier-seq of a function
3443 parameter pack (14.6.3), or the type-specifier-seq of a type-id that
3444 is a pack expansion, the invented template parameter is a template
3446 if (ppd
->type_pack_expansion_p
&& is_auto_or_concept (t
))
3447 TEMPLATE_TYPE_PARAMETER_PACK (t
) = true;
3448 if (TEMPLATE_TYPE_PARAMETER_PACK (t
))
3449 parameter_pack_p
= true;
3454 if (DECL_PACK_P (t
))
3456 /* We don't want to walk into the type of a PARM_DECL,
3457 because we don't want to see the type parameter pack. */
3459 parameter_pack_p
= true;
3463 /* Look through a lambda capture proxy to the field pack. */
3465 if (DECL_HAS_VALUE_EXPR_P (t
))
3467 tree v
= DECL_VALUE_EXPR (t
);
3469 &find_parameter_packs_r
,
3473 else if (variable_template_specialization_p (t
))
3475 cp_walk_tree (&DECL_TI_ARGS (t
),
3476 find_parameter_packs_r
,
3483 parameter_pack_p
= true;
3486 /* Not a parameter pack. */
3490 if (parameter_pack_p
)
3492 /* Add this parameter pack to the list. */
3493 *ppd
->parameter_packs
= tree_cons (NULL_TREE
, t
, *ppd
->parameter_packs
);
3497 cp_walk_tree (&TYPE_CONTEXT (t
),
3498 &find_parameter_packs_r
, ppd
, ppd
->visited
);
3500 /* This switch statement will return immediately if we don't find a
3502 switch (TREE_CODE (t
))
3504 case TEMPLATE_PARM_INDEX
:
3507 case BOUND_TEMPLATE_TEMPLATE_PARM
:
3508 /* Check the template itself. */
3509 cp_walk_tree (&TREE_TYPE (TYPE_TI_TEMPLATE (t
)),
3510 &find_parameter_packs_r
, ppd
, ppd
->visited
);
3511 /* Check the template arguments. */
3512 cp_walk_tree (&TYPE_TI_ARGS (t
), &find_parameter_packs_r
, ppd
,
3517 case TEMPLATE_TYPE_PARM
:
3518 case TEMPLATE_TEMPLATE_PARM
:
3525 if (TYPE_PTRMEMFUNC_P (t
))
3531 if (TYPE_TEMPLATE_INFO (t
))
3532 cp_walk_tree (&TYPE_TI_ARGS (t
),
3533 &find_parameter_packs_r
, ppd
, ppd
->visited
);
3540 cp_walk_tree (&TREE_TYPE (t
),
3541 &find_parameter_packs_r
, ppd
, ppd
->visited
);
3545 cp_walk_tree (&TYPENAME_TYPE_FULLNAME (t
), &find_parameter_packs_r
,
3550 case TYPE_PACK_EXPANSION
:
3551 case EXPR_PACK_EXPANSION
:
3556 cp_walk_tree (&TYPE_MAX_VALUE (t
), &find_parameter_packs_r
,
3561 case IDENTIFIER_NODE
:
3562 cp_walk_tree (&TREE_TYPE (t
), &find_parameter_packs_r
, ppd
,
3569 /* When traversing a DECLTYPE_TYPE_EXPR, we need to set
3570 type_pack_expansion_p to false so that any placeholders
3571 within the expression don't get marked as parameter packs. */
3572 bool type_pack_expansion_p
= ppd
->type_pack_expansion_p
;
3573 ppd
->type_pack_expansion_p
= false;
3574 cp_walk_tree (&DECLTYPE_TYPE_EXPR (t
), &find_parameter_packs_r
,
3576 ppd
->type_pack_expansion_p
= type_pack_expansion_p
;
3588 /* Determines if the expression or type T uses any parameter packs. */
3590 uses_parameter_packs (tree t
)
3592 tree parameter_packs
= NULL_TREE
;
3593 struct find_parameter_pack_data ppd
;
3594 ppd
.parameter_packs
= ¶meter_packs
;
3595 ppd
.visited
= new hash_set
<tree
>;
3596 ppd
.type_pack_expansion_p
= false;
3597 cp_walk_tree (&t
, &find_parameter_packs_r
, &ppd
, ppd
.visited
);
3599 return parameter_packs
!= NULL_TREE
;
3602 /* Turn ARG, which may be an expression, type, or a TREE_LIST
3603 representation a base-class initializer into a parameter pack
3604 expansion. If all goes well, the resulting node will be an
3605 EXPR_PACK_EXPANSION, TYPE_PACK_EXPANSION, or TREE_LIST,
3608 make_pack_expansion (tree arg
)
3611 tree parameter_packs
= NULL_TREE
;
3612 bool for_types
= false;
3613 struct find_parameter_pack_data ppd
;
3615 if (!arg
|| arg
== error_mark_node
)
3618 if (TREE_CODE (arg
) == TREE_LIST
&& TREE_PURPOSE (arg
))
3620 /* A TREE_LIST with a non-null TREE_PURPOSE is for a base
3621 class initializer. In this case, the TREE_PURPOSE will be a
3622 _TYPE node (representing the base class expansion we're
3623 initializing) and the TREE_VALUE will be a TREE_LIST
3624 containing the initialization arguments.
3626 The resulting expansion looks somewhat different from most
3627 expansions. Rather than returning just one _EXPANSION, we
3628 return a TREE_LIST whose TREE_PURPOSE is a
3629 TYPE_PACK_EXPANSION containing the bases that will be
3630 initialized. The TREE_VALUE will be identical to the
3631 original TREE_VALUE, which is a list of arguments that will
3632 be passed to each base. We do not introduce any new pack
3633 expansion nodes into the TREE_VALUE (although it is possible
3634 that some already exist), because the TREE_PURPOSE and
3635 TREE_VALUE all need to be expanded together with the same
3636 _EXPANSION node. Note that the TYPE_PACK_EXPANSION in the
3637 resulting TREE_PURPOSE will mention the parameter packs in
3638 both the bases and the arguments to the bases. */
3641 tree parameter_packs
= NULL_TREE
;
3643 /* Determine which parameter packs will be used by the base
3645 ppd
.visited
= new hash_set
<tree
>;
3646 ppd
.parameter_packs
= ¶meter_packs
;
3647 ppd
.type_pack_expansion_p
= true;
3648 gcc_assert (TYPE_P (TREE_PURPOSE (arg
)));
3649 cp_walk_tree (&TREE_PURPOSE (arg
), &find_parameter_packs_r
,
3652 if (parameter_packs
== NULL_TREE
)
3654 error ("base initializer expansion %<%T%> contains no parameter packs", arg
);
3656 return error_mark_node
;
3659 if (TREE_VALUE (arg
) != void_type_node
)
3661 /* Collect the sets of parameter packs used in each of the
3662 initialization arguments. */
3663 for (value
= TREE_VALUE (arg
); value
; value
= TREE_CHAIN (value
))
3665 /* Determine which parameter packs will be expanded in this
3667 cp_walk_tree (&TREE_VALUE (value
), &find_parameter_packs_r
,
3674 /* Create the pack expansion type for the base type. */
3675 purpose
= cxx_make_type (TYPE_PACK_EXPANSION
);
3676 SET_PACK_EXPANSION_PATTERN (purpose
, TREE_PURPOSE (arg
));
3677 PACK_EXPANSION_PARAMETER_PACKS (purpose
) = parameter_packs
;
3679 /* Just use structural equality for these TYPE_PACK_EXPANSIONS;
3680 they will rarely be compared to anything. */
3681 SET_TYPE_STRUCTURAL_EQUALITY (purpose
);
3683 return tree_cons (purpose
, TREE_VALUE (arg
), NULL_TREE
);
3686 if (TYPE_P (arg
) || TREE_CODE (arg
) == TEMPLATE_DECL
)
3689 /* Build the PACK_EXPANSION_* node. */
3691 ? cxx_make_type (TYPE_PACK_EXPANSION
)
3692 : make_node (EXPR_PACK_EXPANSION
);
3693 SET_PACK_EXPANSION_PATTERN (result
, arg
);
3694 if (TREE_CODE (result
) == EXPR_PACK_EXPANSION
)
3696 /* Propagate type and const-expression information. */
3697 TREE_TYPE (result
) = TREE_TYPE (arg
);
3698 TREE_CONSTANT (result
) = TREE_CONSTANT (arg
);
3701 /* Just use structural equality for these TYPE_PACK_EXPANSIONS;
3702 they will rarely be compared to anything. */
3703 SET_TYPE_STRUCTURAL_EQUALITY (result
);
3705 /* Determine which parameter packs will be expanded. */
3706 ppd
.parameter_packs
= ¶meter_packs
;
3707 ppd
.visited
= new hash_set
<tree
>;
3708 ppd
.type_pack_expansion_p
= TYPE_P (arg
);
3709 cp_walk_tree (&arg
, &find_parameter_packs_r
, &ppd
, ppd
.visited
);
3712 /* Make sure we found some parameter packs. */
3713 if (parameter_packs
== NULL_TREE
)
3716 error ("expansion pattern %<%T%> contains no argument packs", arg
);
3718 error ("expansion pattern %<%E%> contains no argument packs", arg
);
3719 return error_mark_node
;
3721 PACK_EXPANSION_PARAMETER_PACKS (result
) = parameter_packs
;
3723 PACK_EXPANSION_LOCAL_P (result
) = at_function_scope_p ();
3728 /* Checks T for any "bare" parameter packs, which have not yet been
3729 expanded, and issues an error if any are found. This operation can
3730 only be done on full expressions or types (e.g., an expression
3731 statement, "if" condition, etc.), because we could have expressions like:
3733 foo(f(g(h(args)))...)
3735 where "args" is a parameter pack. check_for_bare_parameter_packs
3736 should not be called for the subexpressions args, h(args),
3737 g(h(args)), or f(g(h(args))), because we would produce erroneous
3740 Returns TRUE and emits an error if there were bare parameter packs,
3741 returns FALSE otherwise. */
3743 check_for_bare_parameter_packs (tree t
)
3745 tree parameter_packs
= NULL_TREE
;
3746 struct find_parameter_pack_data ppd
;
3748 if (!processing_template_decl
|| !t
|| t
== error_mark_node
)
3751 if (TREE_CODE (t
) == TYPE_DECL
)
3754 ppd
.parameter_packs
= ¶meter_packs
;
3755 ppd
.visited
= new hash_set
<tree
>;
3756 ppd
.type_pack_expansion_p
= false;
3757 cp_walk_tree (&t
, &find_parameter_packs_r
, &ppd
, ppd
.visited
);
3760 if (parameter_packs
)
3762 error ("parameter packs not expanded with %<...%>:");
3763 while (parameter_packs
)
3765 tree pack
= TREE_VALUE (parameter_packs
);
3766 tree name
= NULL_TREE
;
3768 if (TREE_CODE (pack
) == TEMPLATE_TYPE_PARM
3769 || TREE_CODE (pack
) == TEMPLATE_TEMPLATE_PARM
)
3770 name
= TYPE_NAME (pack
);
3771 else if (TREE_CODE (pack
) == TEMPLATE_PARM_INDEX
)
3772 name
= DECL_NAME (TEMPLATE_PARM_DECL (pack
));
3774 name
= DECL_NAME (pack
);
3777 inform (input_location
, " %qD", name
);
3779 inform (input_location
, " <anonymous>");
3781 parameter_packs
= TREE_CHAIN (parameter_packs
);
3790 /* Expand any parameter packs that occur in the template arguments in
3793 expand_template_argument_pack (tree args
)
3795 tree result_args
= NULL_TREE
;
3796 int in_arg
, out_arg
= 0, nargs
= args
? TREE_VEC_LENGTH (args
) : 0;
3797 int num_result_args
= -1;
3798 int non_default_args_count
= -1;
3800 /* First, determine if we need to expand anything, and the number of
3801 slots we'll need. */
3802 for (in_arg
= 0; in_arg
< nargs
; ++in_arg
)
3804 tree arg
= TREE_VEC_ELT (args
, in_arg
);
3805 if (arg
== NULL_TREE
)
3807 if (ARGUMENT_PACK_P (arg
))
3809 int num_packed
= TREE_VEC_LENGTH (ARGUMENT_PACK_ARGS (arg
));
3810 if (num_result_args
< 0)
3811 num_result_args
= in_arg
+ num_packed
;
3813 num_result_args
+= num_packed
;
3817 if (num_result_args
>= 0)
3822 /* If no expansion is necessary, we're done. */
3823 if (num_result_args
< 0)
3826 /* Expand arguments. */
3827 result_args
= make_tree_vec (num_result_args
);
3828 if (NON_DEFAULT_TEMPLATE_ARGS_COUNT (args
))
3829 non_default_args_count
=
3830 GET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (args
);
3831 for (in_arg
= 0; in_arg
< nargs
; ++in_arg
)
3833 tree arg
= TREE_VEC_ELT (args
, in_arg
);
3834 if (ARGUMENT_PACK_P (arg
))
3836 tree packed
= ARGUMENT_PACK_ARGS (arg
);
3837 int i
, num_packed
= TREE_VEC_LENGTH (packed
);
3838 for (i
= 0; i
< num_packed
; ++i
, ++out_arg
)
3839 TREE_VEC_ELT (result_args
, out_arg
) = TREE_VEC_ELT(packed
, i
);
3840 if (non_default_args_count
> 0)
3841 non_default_args_count
+= num_packed
- 1;
3845 TREE_VEC_ELT (result_args
, out_arg
) = arg
;
3849 if (non_default_args_count
>= 0)
3850 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (result_args
, non_default_args_count
);
3854 /* Checks if DECL shadows a template parameter.
3856 [temp.local]: A template-parameter shall not be redeclared within its
3857 scope (including nested scopes).
3859 Emits an error and returns TRUE if the DECL shadows a parameter,
3860 returns FALSE otherwise. */
3863 check_template_shadow (tree decl
)
3867 /* If we're not in a template, we can't possibly shadow a template
3869 if (!current_template_parms
)
3872 /* Figure out what we're shadowing. */
3873 if (TREE_CODE (decl
) == OVERLOAD
)
3874 decl
= OVL_CURRENT (decl
);
3875 olddecl
= innermost_non_namespace_value (DECL_NAME (decl
));
3877 /* If there's no previous binding for this name, we're not shadowing
3878 anything, let alone a template parameter. */
3882 /* If we're not shadowing a template parameter, we're done. Note
3883 that OLDDECL might be an OVERLOAD (or perhaps even an
3884 ERROR_MARK), so we can't just blithely assume it to be a _DECL
3886 if (!DECL_P (olddecl
) || !DECL_TEMPLATE_PARM_P (olddecl
))
3889 /* We check for decl != olddecl to avoid bogus errors for using a
3890 name inside a class. We check TPFI to avoid duplicate errors for
3891 inline member templates. */
3893 || (DECL_TEMPLATE_PARM_P (decl
)
3894 && TEMPLATE_PARMS_FOR_INLINE (current_template_parms
)))
3897 /* Don't complain about the injected class name, as we've already
3898 complained about the class itself. */
3899 if (DECL_SELF_REFERENCE_P (decl
))
3902 if (DECL_TEMPLATE_PARM_P (decl
))
3903 error ("declaration of template parameter %q+D shadows "
3904 "template parameter", decl
);
3906 error ("declaration of %q+#D shadows template parameter", decl
);
3907 inform (DECL_SOURCE_LOCATION (olddecl
),
3908 "template parameter %qD declared here", olddecl
);
3912 /* Return a new TEMPLATE_PARM_INDEX with the indicated INDEX, LEVEL,
3913 ORIG_LEVEL, DECL, and TYPE. */
3916 build_template_parm_index (int index
,
3922 tree t
= make_node (TEMPLATE_PARM_INDEX
);
3923 TEMPLATE_PARM_IDX (t
) = index
;
3924 TEMPLATE_PARM_LEVEL (t
) = level
;
3925 TEMPLATE_PARM_ORIG_LEVEL (t
) = orig_level
;
3926 TEMPLATE_PARM_DECL (t
) = decl
;
3927 TREE_TYPE (t
) = type
;
3928 TREE_CONSTANT (t
) = TREE_CONSTANT (decl
);
3929 TREE_READONLY (t
) = TREE_READONLY (decl
);
3934 /* Find the canonical type parameter for the given template type
3935 parameter. Returns the canonical type parameter, which may be TYPE
3936 if no such parameter existed. */
3939 canonical_type_parameter (tree type
)
3942 int idx
= TEMPLATE_TYPE_IDX (type
);
3943 if (!canonical_template_parms
)
3944 vec_alloc (canonical_template_parms
, idx
+1);
3946 while (canonical_template_parms
->length () <= (unsigned)idx
)
3947 vec_safe_push (canonical_template_parms
, NULL_TREE
);
3949 list
= (*canonical_template_parms
)[idx
];
3950 while (list
&& !comptypes (type
, TREE_VALUE (list
), COMPARE_STRUCTURAL
))
3951 list
= TREE_CHAIN (list
);
3954 return TREE_VALUE (list
);
3957 (*canonical_template_parms
)[idx
]
3958 = tree_cons (NULL_TREE
, type
,
3959 (*canonical_template_parms
)[idx
]);
3964 /* Return a TEMPLATE_PARM_INDEX, similar to INDEX, but whose
3965 TEMPLATE_PARM_LEVEL has been decreased by LEVELS. If such a
3966 TEMPLATE_PARM_INDEX already exists, it is returned; otherwise, a
3967 new one is created. */
3970 reduce_template_parm_level (tree index
, tree type
, int levels
, tree args
,
3971 tsubst_flags_t complain
)
3973 if (TEMPLATE_PARM_DESCENDANTS (index
) == NULL_TREE
3974 || (TEMPLATE_PARM_LEVEL (TEMPLATE_PARM_DESCENDANTS (index
))
3975 != TEMPLATE_PARM_LEVEL (index
) - levels
)
3976 || !same_type_p (type
, TREE_TYPE (TEMPLATE_PARM_DESCENDANTS (index
))))
3978 tree orig_decl
= TEMPLATE_PARM_DECL (index
);
3981 decl
= build_decl (DECL_SOURCE_LOCATION (orig_decl
),
3982 TREE_CODE (orig_decl
), DECL_NAME (orig_decl
), type
);
3983 TREE_CONSTANT (decl
) = TREE_CONSTANT (orig_decl
);
3984 TREE_READONLY (decl
) = TREE_READONLY (orig_decl
);
3985 DECL_ARTIFICIAL (decl
) = 1;
3986 SET_DECL_TEMPLATE_PARM_P (decl
);
3988 t
= build_template_parm_index (TEMPLATE_PARM_IDX (index
),
3989 TEMPLATE_PARM_LEVEL (index
) - levels
,
3990 TEMPLATE_PARM_ORIG_LEVEL (index
),
3992 TEMPLATE_PARM_DESCENDANTS (index
) = t
;
3993 TEMPLATE_PARM_PARAMETER_PACK (t
)
3994 = TEMPLATE_PARM_PARAMETER_PACK (index
);
3996 /* Template template parameters need this. */
3997 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
3999 DECL_TEMPLATE_RESULT (decl
)
4000 = build_decl (DECL_SOURCE_LOCATION (decl
),
4001 TYPE_DECL
, DECL_NAME (decl
), type
);
4002 DECL_ARTIFICIAL (DECL_TEMPLATE_RESULT (decl
)) = true;
4003 DECL_TEMPLATE_PARMS (decl
) = tsubst_template_parms
4004 (DECL_TEMPLATE_PARMS (orig_decl
), args
, complain
);
4008 return TEMPLATE_PARM_DESCENDANTS (index
);
4011 /* Process information from new template parameter PARM and append it
4012 to the LIST being built. This new parameter is a non-type
4013 parameter iff IS_NON_TYPE is true. This new parameter is a
4014 parameter pack iff IS_PARAMETER_PACK is true. The location of PARM
4018 process_template_parm (tree list
, location_t parm_loc
, tree parm
,
4019 bool is_non_type
, bool is_parameter_pack
)
4024 gcc_assert (TREE_CODE (parm
) == TREE_LIST
);
4025 tree defval
= TREE_PURPOSE (parm
);
4026 tree constr
= TREE_TYPE (parm
);
4030 tree p
= tree_last (list
);
4032 if (p
&& TREE_VALUE (p
) != error_mark_node
)
4035 if (TREE_CODE (p
) == TYPE_DECL
|| TREE_CODE (p
) == TEMPLATE_DECL
)
4036 idx
= TEMPLATE_TYPE_IDX (TREE_TYPE (p
));
4038 idx
= TEMPLATE_PARM_IDX (DECL_INITIAL (p
));
4046 parm
= TREE_VALUE (parm
);
4048 SET_DECL_TEMPLATE_PARM_P (parm
);
4050 if (TREE_TYPE (parm
) != error_mark_node
)
4054 The top-level cv-qualifiers on the template-parameter are
4055 ignored when determining its type. */
4056 TREE_TYPE (parm
) = TYPE_MAIN_VARIANT (TREE_TYPE (parm
));
4057 if (invalid_nontype_parm_type_p (TREE_TYPE (parm
), 1))
4058 TREE_TYPE (parm
) = error_mark_node
;
4059 else if (uses_parameter_packs (TREE_TYPE (parm
))
4060 && !is_parameter_pack
4061 /* If we're in a nested template parameter list, the template
4062 template parameter could be a parameter pack. */
4063 && processing_template_parmlist
== 1)
4065 /* This template parameter is not a parameter pack, but it
4066 should be. Complain about "bare" parameter packs. */
4067 check_for_bare_parameter_packs (TREE_TYPE (parm
));
4069 /* Recover by calling this a parameter pack. */
4070 is_parameter_pack
= true;
4074 /* A template parameter is not modifiable. */
4075 TREE_CONSTANT (parm
) = 1;
4076 TREE_READONLY (parm
) = 1;
4077 decl
= build_decl (parm_loc
,
4078 CONST_DECL
, DECL_NAME (parm
), TREE_TYPE (parm
));
4079 TREE_CONSTANT (decl
) = 1;
4080 TREE_READONLY (decl
) = 1;
4081 DECL_INITIAL (parm
) = DECL_INITIAL (decl
)
4082 = build_template_parm_index (idx
, processing_template_decl
,
4083 processing_template_decl
,
4084 decl
, TREE_TYPE (parm
));
4086 TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm
))
4087 = is_parameter_pack
;
4092 parm
= TREE_VALUE (TREE_VALUE (parm
));
4094 if (parm
&& TREE_CODE (parm
) == TEMPLATE_DECL
)
4096 t
= cxx_make_type (TEMPLATE_TEMPLATE_PARM
);
4097 /* This is for distinguishing between real templates and template
4098 template parameters */
4099 TREE_TYPE (parm
) = t
;
4100 TREE_TYPE (DECL_TEMPLATE_RESULT (parm
)) = t
;
4105 t
= cxx_make_type (TEMPLATE_TYPE_PARM
);
4106 /* parm is either IDENTIFIER_NODE or NULL_TREE. */
4107 decl
= build_decl (parm_loc
,
4108 TYPE_DECL
, parm
, t
);
4111 TYPE_NAME (t
) = decl
;
4112 TYPE_STUB_DECL (t
) = decl
;
4114 TEMPLATE_TYPE_PARM_INDEX (t
)
4115 = build_template_parm_index (idx
, processing_template_decl
,
4116 processing_template_decl
,
4117 decl
, TREE_TYPE (parm
));
4118 TEMPLATE_TYPE_PARAMETER_PACK (t
) = is_parameter_pack
;
4119 TYPE_CANONICAL (t
) = canonical_type_parameter (t
);
4121 DECL_ARTIFICIAL (decl
) = 1;
4122 SET_DECL_TEMPLATE_PARM_P (decl
);
4124 /* Build requirements for the type/template parameter.
4125 This must be done after SET_DECL_TEMPLATE_PARM_P or
4126 process_template_parm could fail. */
4127 tree reqs
= finish_shorthand_constraint (parm
, constr
);
4131 /* Build the parameter node linking the parameter declaration,
4132 its default argument (if any), and its constraints (if any). */
4133 parm
= build_tree_list (defval
, parm
);
4134 TEMPLATE_PARM_CONSTRAINTS (parm
) = reqs
;
4136 return chainon (list
, parm
);
4139 /* The end of a template parameter list has been reached. Process the
4140 tree list into a parameter vector, converting each parameter into a more
4141 useful form. Type parameters are saved as IDENTIFIER_NODEs, and others
4145 end_template_parm_list (tree parms
)
4149 tree saved_parmlist
= make_tree_vec (list_length (parms
));
4151 /* Pop the dummy parameter level and add the real one. */
4152 current_template_parms
= TREE_CHAIN (current_template_parms
);
4154 current_template_parms
4155 = tree_cons (size_int (processing_template_decl
),
4156 saved_parmlist
, current_template_parms
);
4158 for (parm
= parms
, nparms
= 0; parm
; parm
= next
, nparms
++)
4160 next
= TREE_CHAIN (parm
);
4161 TREE_VEC_ELT (saved_parmlist
, nparms
) = parm
;
4162 TREE_CHAIN (parm
) = NULL_TREE
;
4165 --processing_template_parmlist
;
4167 return saved_parmlist
;
4170 // Explicitly indicate the end of the template parameter list. We assume
4171 // that the current template parameters have been constructed and/or
4172 // managed explicitly, as when creating new template template parameters
4173 // from a shorthand constraint.
4175 end_template_parm_list ()
4177 --processing_template_parmlist
;
4180 /* end_template_decl is called after a template declaration is seen. */
4183 end_template_decl (void)
4185 reset_specialization ();
4187 if (! processing_template_decl
)
4190 /* This matches the pushlevel in begin_template_parm_list. */
4193 --processing_template_decl
;
4194 current_template_parms
= TREE_CHAIN (current_template_parms
);
4197 /* Takes a TREE_LIST representing a template parameter and convert it
4198 into an argument suitable to be passed to the type substitution
4199 functions. Note that If the TREE_LIST contains an error_mark
4200 node, the returned argument is error_mark_node. */
4203 template_parm_to_arg (tree t
)
4207 || TREE_CODE (t
) != TREE_LIST
)
4210 if (error_operand_p (TREE_VALUE (t
)))
4211 return error_mark_node
;
4215 if (TREE_CODE (t
) == TYPE_DECL
4216 || TREE_CODE (t
) == TEMPLATE_DECL
)
4220 if (TEMPLATE_TYPE_PARAMETER_PACK (t
))
4222 /* Turn this argument into a TYPE_ARGUMENT_PACK
4223 with a single element, which expands T. */
4224 tree vec
= make_tree_vec (1);
4226 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (vec
, TREE_VEC_LENGTH (vec
));
4228 TREE_VEC_ELT (vec
, 0) = make_pack_expansion (t
);
4230 t
= cxx_make_type (TYPE_ARGUMENT_PACK
);
4231 SET_ARGUMENT_PACK_ARGS (t
, vec
);
4236 t
= DECL_INITIAL (t
);
4238 if (TEMPLATE_PARM_PARAMETER_PACK (t
))
4240 /* Turn this argument into a NONTYPE_ARGUMENT_PACK
4241 with a single element, which expands T. */
4242 tree vec
= make_tree_vec (1);
4243 tree type
= TREE_TYPE (TEMPLATE_PARM_DECL (t
));
4245 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (vec
, TREE_VEC_LENGTH (vec
));
4247 t
= convert_from_reference (t
);
4248 TREE_VEC_ELT (vec
, 0) = make_pack_expansion (t
);
4250 t
= make_node (NONTYPE_ARGUMENT_PACK
);
4251 SET_ARGUMENT_PACK_ARGS (t
, vec
);
4252 TREE_TYPE (t
) = type
;
4255 t
= convert_from_reference (t
);
4260 /* Given a set of template parameters, return them as a set of template
4261 arguments. The template parameters are represented as a TREE_VEC, in
4262 the form documented in cp-tree.h for template arguments. */
4265 template_parms_to_args (tree parms
)
4268 tree args
= NULL_TREE
;
4269 int length
= TMPL_PARMS_DEPTH (parms
);
4272 /* If there is only one level of template parameters, we do not
4273 create a TREE_VEC of TREE_VECs. Instead, we return a single
4274 TREE_VEC containing the arguments. */
4276 args
= make_tree_vec (length
);
4278 for (header
= parms
; header
; header
= TREE_CHAIN (header
))
4280 tree a
= copy_node (TREE_VALUE (header
));
4283 TREE_TYPE (a
) = NULL_TREE
;
4284 for (i
= TREE_VEC_LENGTH (a
) - 1; i
>= 0; --i
)
4285 TREE_VEC_ELT (a
, i
) = template_parm_to_arg (TREE_VEC_ELT (a
, i
));
4288 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (a
, TREE_VEC_LENGTH (a
));
4291 TREE_VEC_ELT (args
, --l
) = a
;
4299 /* Within the declaration of a template, return the currently active
4300 template parameters as an argument TREE_VEC. */
4303 current_template_args (void)
4305 return template_parms_to_args (current_template_parms
);
4308 /* Update the declared TYPE by doing any lookups which were thought to be
4309 dependent, but are not now that we know the SCOPE of the declarator. */
4312 maybe_update_decl_type (tree orig_type
, tree scope
)
4314 tree type
= orig_type
;
4316 if (type
== NULL_TREE
)
4319 if (TREE_CODE (orig_type
) == TYPE_DECL
)
4320 type
= TREE_TYPE (type
);
4322 if (scope
&& TYPE_P (scope
) && dependent_type_p (scope
)
4323 && dependent_type_p (type
)
4324 /* Don't bother building up the args in this case. */
4325 && TREE_CODE (type
) != TEMPLATE_TYPE_PARM
)
4327 /* tsubst in the args corresponding to the template parameters,
4328 including auto if present. Most things will be unchanged, but
4329 make_typename_type and tsubst_qualified_id will resolve
4330 TYPENAME_TYPEs and SCOPE_REFs that were previously dependent. */
4331 tree args
= current_template_args ();
4332 tree auto_node
= type_uses_auto (type
);
4336 tree auto_vec
= make_tree_vec (1);
4337 TREE_VEC_ELT (auto_vec
, 0) = auto_node
;
4338 args
= add_to_template_args (args
, auto_vec
);
4340 pushed
= push_scope (scope
);
4341 type
= tsubst (type
, args
, tf_warning_or_error
, NULL_TREE
);
4346 if (type
== error_mark_node
)
4349 if (TREE_CODE (orig_type
) == TYPE_DECL
)
4351 if (same_type_p (type
, TREE_TYPE (orig_type
)))
4354 type
= TYPE_NAME (type
);
4359 /* Return a TEMPLATE_DECL corresponding to DECL, using the indicated
4360 template PARMS and constraints, CONSTR. If MEMBER_TEMPLATE_P is true,
4361 the new template is a member template. */
4364 build_template_decl (tree decl
, tree parms
, bool member_template_p
)
4366 tree tmpl
= build_lang_decl (TEMPLATE_DECL
, DECL_NAME (decl
), NULL_TREE
);
4367 DECL_TEMPLATE_PARMS (tmpl
) = parms
;
4368 DECL_CONTEXT (tmpl
) = DECL_CONTEXT (decl
);
4369 DECL_SOURCE_LOCATION (tmpl
) = DECL_SOURCE_LOCATION (decl
);
4370 DECL_MEMBER_TEMPLATE_P (tmpl
) = member_template_p
;
4375 struct template_parm_data
4377 /* The level of the template parameters we are currently
4381 /* The index of the specialization argument we are currently
4385 /* An array whose size is the number of template parameters. The
4386 elements are nonzero if the parameter has been used in any one
4387 of the arguments processed so far. */
4390 /* An array whose size is the number of template arguments. The
4391 elements are nonzero if the argument makes use of template
4392 parameters of this level. */
4393 int* arg_uses_template_parms
;
4396 /* Subroutine of push_template_decl used to see if each template
4397 parameter in a partial specialization is used in the explicit
4398 argument list. If T is of the LEVEL given in DATA (which is
4399 treated as a template_parm_data*), then DATA->PARMS is marked
4403 mark_template_parm (tree t
, void* data
)
4407 struct template_parm_data
* tpd
= (struct template_parm_data
*) data
;
4409 template_parm_level_and_index (t
, &level
, &idx
);
4411 if (level
== tpd
->level
)
4413 tpd
->parms
[idx
] = 1;
4414 tpd
->arg_uses_template_parms
[tpd
->current_arg
] = 1;
4417 /* Return zero so that for_each_template_parm will continue the
4418 traversal of the tree; we want to mark *every* template parm. */
4422 /* Process the partial specialization DECL. */
4425 process_partial_specialization (tree decl
)
4427 tree type
= TREE_TYPE (decl
);
4428 tree tinfo
= get_template_info (decl
);
4429 tree maintmpl
= TI_TEMPLATE (tinfo
);
4430 tree specargs
= TI_ARGS (tinfo
);
4431 tree inner_args
= INNERMOST_TEMPLATE_ARGS (specargs
);
4432 tree main_inner_parms
= DECL_INNERMOST_TEMPLATE_PARMS (maintmpl
);
4435 int nargs
= TREE_VEC_LENGTH (inner_args
);
4438 bool did_error_intro
= false;
4439 struct template_parm_data tpd
;
4440 struct template_parm_data tpd2
;
4442 gcc_assert (current_template_parms
);
4444 /* A concept cannot be specialized. */
4445 if (flag_concepts
&& variable_concept_p (maintmpl
))
4447 error ("specialization of variable concept %q#D", maintmpl
);
4448 return error_mark_node
;
4451 inner_parms
= INNERMOST_TEMPLATE_PARMS (current_template_parms
);
4452 ntparms
= TREE_VEC_LENGTH (inner_parms
);
4454 /* We check that each of the template parameters given in the
4455 partial specialization is used in the argument list to the
4456 specialization. For example:
4458 template <class T> struct S;
4459 template <class T> struct S<T*>;
4461 The second declaration is OK because `T*' uses the template
4462 parameter T, whereas
4464 template <class T> struct S<int>;
4466 is no good. Even trickier is:
4477 The S2<T> declaration is actually invalid; it is a
4478 full-specialization. Of course,
4481 struct S2<T (*)(U)>;
4483 or some such would have been OK. */
4484 tpd
.level
= TMPL_PARMS_DEPTH (current_template_parms
);
4485 tpd
.parms
= XALLOCAVEC (int, ntparms
);
4486 memset (tpd
.parms
, 0, sizeof (int) * ntparms
);
4488 tpd
.arg_uses_template_parms
= XALLOCAVEC (int, nargs
);
4489 memset (tpd
.arg_uses_template_parms
, 0, sizeof (int) * nargs
);
4490 for (i
= 0; i
< nargs
; ++i
)
4492 tpd
.current_arg
= i
;
4493 for_each_template_parm (TREE_VEC_ELT (inner_args
, i
),
4494 &mark_template_parm
,
4497 /*include_nondeduced_p=*/false);
4499 for (i
= 0; i
< ntparms
; ++i
)
4500 if (tpd
.parms
[i
] == 0)
4502 /* One of the template parms was not used in a deduced context in the
4504 if (!did_error_intro
)
4506 error ("template parameters not deducible in "
4507 "partial specialization:");
4508 did_error_intro
= true;
4511 inform (input_location
, " %qD",
4512 TREE_VALUE (TREE_VEC_ELT (inner_parms
, i
)));
4515 if (did_error_intro
)
4516 return error_mark_node
;
4518 /* [temp.class.spec]
4520 The argument list of the specialization shall not be identical to
4521 the implicit argument list of the primary template. */
4523 = TI_ARGS (get_template_info (DECL_TEMPLATE_RESULT (maintmpl
)));
4524 if (comp_template_args (inner_args
, INNERMOST_TEMPLATE_ARGS (main_args
))
4526 || !strictly_subsumes (current_template_constraints (),
4527 get_constraints (maintmpl
))))
4530 error ("partial specialization %q+D does not specialize "
4531 "any template arguments", decl
);
4533 error ("partial specialization %q+D does not specialize any "
4534 "template arguments and is not more constrained than", decl
);
4535 inform (DECL_SOURCE_LOCATION (maintmpl
), "primary template here");
4538 /* A partial specialization that replaces multiple parameters of the
4539 primary template with a pack expansion is less specialized for those
4541 if (nargs
< DECL_NTPARMS (maintmpl
))
4543 error ("partial specialization is not more specialized than the "
4544 "primary template because it replaces multiple parameters "
4545 "with a pack expansion");
4546 inform (DECL_SOURCE_LOCATION (maintmpl
), "primary template here");
4550 /* [temp.class.spec]
4552 A partially specialized non-type argument expression shall not
4553 involve template parameters of the partial specialization except
4554 when the argument expression is a simple identifier.
4556 The type of a template parameter corresponding to a specialized
4557 non-type argument shall not be dependent on a parameter of the
4560 Also, we verify that pack expansions only occur at the
4561 end of the argument list. */
4562 gcc_assert (nargs
== DECL_NTPARMS (maintmpl
));
4564 for (i
= 0; i
< nargs
; ++i
)
4566 tree parm
= TREE_VALUE (TREE_VEC_ELT (main_inner_parms
, i
));
4567 tree arg
= TREE_VEC_ELT (inner_args
, i
);
4568 tree packed_args
= NULL_TREE
;
4571 if (ARGUMENT_PACK_P (arg
))
4573 /* Extract the arguments from the argument pack. We'll be
4574 iterating over these in the following loop. */
4575 packed_args
= ARGUMENT_PACK_ARGS (arg
);
4576 len
= TREE_VEC_LENGTH (packed_args
);
4579 for (j
= 0; j
< len
; j
++)
4582 /* Get the Jth argument in the parameter pack. */
4583 arg
= TREE_VEC_ELT (packed_args
, j
);
4585 if (PACK_EXPANSION_P (arg
))
4587 /* Pack expansions must come at the end of the
4589 if ((packed_args
&& j
< len
- 1)
4590 || (!packed_args
&& i
< nargs
- 1))
4592 if (TREE_CODE (arg
) == EXPR_PACK_EXPANSION
)
4593 error ("parameter pack argument %qE must be at the "
4594 "end of the template argument list", arg
);
4596 error ("parameter pack argument %qT must be at the "
4597 "end of the template argument list", arg
);
4601 if (TREE_CODE (arg
) == EXPR_PACK_EXPANSION
)
4602 /* We only care about the pattern. */
4603 arg
= PACK_EXPANSION_PATTERN (arg
);
4605 if (/* These first two lines are the `non-type' bit. */
4607 && TREE_CODE (arg
) != TEMPLATE_DECL
4608 /* This next two lines are the `argument expression is not just a
4609 simple identifier' condition and also the `specialized
4610 non-type argument' bit. */
4611 && TREE_CODE (arg
) != TEMPLATE_PARM_INDEX
4612 && !(REFERENCE_REF_P (arg
)
4613 && TREE_CODE (TREE_OPERAND (arg
, 0)) == TEMPLATE_PARM_INDEX
))
4615 if ((!packed_args
&& tpd
.arg_uses_template_parms
[i
])
4616 || (packed_args
&& uses_template_parms (arg
)))
4617 error ("template argument %qE involves template parameter(s)",
4621 /* Look at the corresponding template parameter,
4622 marking which template parameters its type depends
4624 tree type
= TREE_TYPE (parm
);
4628 /* We haven't yet initialized TPD2. Do so now. */
4629 tpd2
.arg_uses_template_parms
= XALLOCAVEC (int, nargs
);
4630 /* The number of parameters here is the number in the
4631 main template, which, as checked in the assertion
4633 tpd2
.parms
= XALLOCAVEC (int, nargs
);
4635 TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (maintmpl
));
4638 /* Mark the template parameters. But this time, we're
4639 looking for the template parameters of the main
4640 template, not in the specialization. */
4641 tpd2
.current_arg
= i
;
4642 tpd2
.arg_uses_template_parms
[i
] = 0;
4643 memset (tpd2
.parms
, 0, sizeof (int) * nargs
);
4644 for_each_template_parm (type
,
4645 &mark_template_parm
,
4648 /*include_nondeduced_p=*/false);
4650 if (tpd2
.arg_uses_template_parms
[i
])
4652 /* The type depended on some template parameters.
4653 If they are fully specialized in the
4654 specialization, that's OK. */
4657 for (j
= 0; j
< nargs
; ++j
)
4658 if (tpd2
.parms
[j
] != 0
4659 && tpd
.arg_uses_template_parms
[j
])
4662 error_n (input_location
, count
,
4663 "type %qT of template argument %qE depends "
4664 "on a template parameter",
4665 "type %qT of template argument %qE depends "
4666 "on template parameters",
4675 /* We should only get here once. */
4676 if (TREE_CODE (decl
) == TYPE_DECL
)
4677 gcc_assert (!COMPLETE_TYPE_P (type
));
4679 // Build the template decl.
4680 tree tmpl
= build_template_decl (decl
, current_template_parms
,
4681 DECL_MEMBER_TEMPLATE_P (maintmpl
));
4682 TREE_TYPE (tmpl
) = type
;
4683 DECL_TEMPLATE_RESULT (tmpl
) = decl
;
4684 SET_DECL_TEMPLATE_SPECIALIZATION (tmpl
);
4685 DECL_TEMPLATE_INFO (tmpl
) = build_template_info (maintmpl
, specargs
);
4686 DECL_PRIMARY_TEMPLATE (tmpl
) = maintmpl
;
4689 /* We didn't register this in check_explicit_specialization so we could
4690 wait until the constraints were set. */
4691 decl
= register_specialization (decl
, maintmpl
, specargs
, false, 0);
4693 associate_classtype_constraints (type
);
4695 DECL_TEMPLATE_SPECIALIZATIONS (maintmpl
)
4696 = tree_cons (specargs
, tmpl
,
4697 DECL_TEMPLATE_SPECIALIZATIONS (maintmpl
));
4698 TREE_TYPE (DECL_TEMPLATE_SPECIALIZATIONS (maintmpl
)) = type
;
4700 for (inst
= DECL_TEMPLATE_INSTANTIATIONS (maintmpl
); inst
;
4701 inst
= TREE_CHAIN (inst
))
4703 tree instance
= TREE_VALUE (inst
);
4704 if (TYPE_P (instance
)
4705 ? (COMPLETE_TYPE_P (instance
)
4706 && CLASSTYPE_IMPLICIT_INSTANTIATION (instance
))
4707 : DECL_TEMPLATE_INSTANTIATION (instance
))
4709 tree spec
= most_specialized_partial_spec (instance
, tf_none
);
4710 tree inst_decl
= (DECL_P (instance
)
4711 ? instance
: TYPE_NAME (instance
));
4714 else if (spec
== error_mark_node
)
4715 permerror (input_location
,
4716 "declaration of %qD ambiguates earlier template "
4717 "instantiation for %qD", decl
, inst_decl
);
4718 else if (TREE_VALUE (spec
) == tmpl
)
4719 permerror (input_location
,
4720 "partial specialization of %qD after instantiation "
4721 "of %qD", decl
, inst_decl
);
4728 /* PARM is a template parameter of some form; return the corresponding
4729 TEMPLATE_PARM_INDEX. */
4732 get_template_parm_index (tree parm
)
4734 if (TREE_CODE (parm
) == PARM_DECL
4735 || TREE_CODE (parm
) == CONST_DECL
)
4736 parm
= DECL_INITIAL (parm
);
4737 else if (TREE_CODE (parm
) == TYPE_DECL
4738 || TREE_CODE (parm
) == TEMPLATE_DECL
)
4739 parm
= TREE_TYPE (parm
);
4740 if (TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
4741 || TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
4742 || TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
)
4743 parm
= TEMPLATE_TYPE_PARM_INDEX (parm
);
4744 gcc_assert (TREE_CODE (parm
) == TEMPLATE_PARM_INDEX
);
4748 /* Subroutine of fixed_parameter_pack_p below. Look for any template
4749 parameter packs used by the template parameter PARM. */
4752 fixed_parameter_pack_p_1 (tree parm
, struct find_parameter_pack_data
*ppd
)
4754 /* A type parm can't refer to another parm. */
4755 if (TREE_CODE (parm
) == TYPE_DECL
)
4757 else if (TREE_CODE (parm
) == PARM_DECL
)
4759 cp_walk_tree (&TREE_TYPE (parm
), &find_parameter_packs_r
,
4764 gcc_assert (TREE_CODE (parm
) == TEMPLATE_DECL
);
4766 tree vec
= INNERMOST_TEMPLATE_PARMS (DECL_TEMPLATE_PARMS (parm
));
4767 for (int i
= 0; i
< TREE_VEC_LENGTH (vec
); ++i
)
4768 fixed_parameter_pack_p_1 (TREE_VALUE (TREE_VEC_ELT (vec
, i
)), ppd
);
4771 /* PARM is a template parameter pack. Return any parameter packs used in
4772 its type or the type of any of its template parameters. If there are
4773 any such packs, it will be instantiated into a fixed template parameter
4774 list by partial instantiation rather than be fully deduced. */
4777 fixed_parameter_pack_p (tree parm
)
4779 /* This can only be true in a member template. */
4780 if (TEMPLATE_PARM_ORIG_LEVEL (get_template_parm_index (parm
)) < 2)
4782 /* This can only be true for a parameter pack. */
4783 if (!template_parameter_pack_p (parm
))
4785 /* A type parm can't refer to another parm. */
4786 if (TREE_CODE (parm
) == TYPE_DECL
)
4789 tree parameter_packs
= NULL_TREE
;
4790 struct find_parameter_pack_data ppd
;
4791 ppd
.parameter_packs
= ¶meter_packs
;
4792 ppd
.visited
= new hash_set
<tree
>;
4793 ppd
.type_pack_expansion_p
= false;
4795 fixed_parameter_pack_p_1 (parm
, &ppd
);
4798 return parameter_packs
;
4801 /* Check that a template declaration's use of default arguments and
4802 parameter packs is not invalid. Here, PARMS are the template
4803 parameters. IS_PRIMARY is true if DECL is the thing declared by
4804 a primary template. IS_PARTIAL is true if DECL is a partial
4807 IS_FRIEND_DECL is nonzero if DECL is a friend function template
4808 declaration (but not a definition); 1 indicates a declaration, 2
4809 indicates a redeclaration. When IS_FRIEND_DECL=2, no errors are
4810 emitted for extraneous default arguments.
4812 Returns TRUE if there were no errors found, FALSE otherwise. */
4815 check_default_tmpl_args (tree decl
, tree parms
, bool is_primary
,
4816 bool is_partial
, int is_friend_decl
)
4819 int last_level_to_check
;
4821 bool no_errors
= true;
4825 A default template-argument shall not be specified in a
4826 function template declaration or a function template definition, nor
4827 in the template-parameter-list of the definition of a member of a
4830 if (TREE_CODE (CP_DECL_CONTEXT (decl
)) == FUNCTION_DECL
4831 || (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_LOCAL_FUNCTION_P (decl
)))
4832 /* You can't have a function template declaration in a local
4833 scope, nor you can you define a member of a class template in a
4837 if ((TREE_CODE (decl
) == TYPE_DECL
4839 && LAMBDA_TYPE_P (TREE_TYPE (decl
)))
4840 || (TREE_CODE (decl
) == FUNCTION_DECL
4841 && LAMBDA_FUNCTION_P (decl
)))
4842 /* A lambda doesn't have an explicit declaration; don't complain
4843 about the parms of the enclosing class. */
4846 if (current_class_type
4847 && !TYPE_BEING_DEFINED (current_class_type
)
4848 && DECL_LANG_SPECIFIC (decl
)
4849 && DECL_DECLARES_FUNCTION_P (decl
)
4850 /* If this is either a friend defined in the scope of the class
4851 or a member function. */
4852 && (DECL_FUNCTION_MEMBER_P (decl
)
4853 ? same_type_p (DECL_CONTEXT (decl
), current_class_type
)
4854 : DECL_FRIEND_CONTEXT (decl
)
4855 ? same_type_p (DECL_FRIEND_CONTEXT (decl
), current_class_type
)
4857 /* And, if it was a member function, it really was defined in
4858 the scope of the class. */
4859 && (!DECL_FUNCTION_MEMBER_P (decl
)
4860 || DECL_INITIALIZED_IN_CLASS_P (decl
)))
4861 /* We already checked these parameters when the template was
4862 declared, so there's no need to do it again now. This function
4863 was defined in class scope, but we're processing its body now
4864 that the class is complete. */
4867 /* Core issue 226 (C++0x only): the following only applies to class
4870 && ((cxx_dialect
== cxx98
) || TREE_CODE (decl
) != FUNCTION_DECL
))
4874 If a template-parameter has a default template-argument, all
4875 subsequent template-parameters shall have a default
4876 template-argument supplied. */
4877 for (parm_level
= parms
; parm_level
; parm_level
= TREE_CHAIN (parm_level
))
4879 tree inner_parms
= TREE_VALUE (parm_level
);
4880 int ntparms
= TREE_VEC_LENGTH (inner_parms
);
4881 int seen_def_arg_p
= 0;
4884 for (i
= 0; i
< ntparms
; ++i
)
4886 tree parm
= TREE_VEC_ELT (inner_parms
, i
);
4888 if (parm
== error_mark_node
)
4891 if (TREE_PURPOSE (parm
))
4893 else if (seen_def_arg_p
4894 && !template_parameter_pack_p (TREE_VALUE (parm
)))
4896 error ("no default argument for %qD", TREE_VALUE (parm
));
4897 /* For better subsequent error-recovery, we indicate that
4898 there should have been a default argument. */
4899 TREE_PURPOSE (parm
) = error_mark_node
;
4902 else if (!is_partial
4904 /* Don't complain about an enclosing partial
4906 && parm_level
== parms
4907 && TREE_CODE (decl
) == TYPE_DECL
4909 && template_parameter_pack_p (TREE_VALUE (parm
))
4910 /* A fixed parameter pack will be partially
4911 instantiated into a fixed length list. */
4912 && !fixed_parameter_pack_p (TREE_VALUE (parm
)))
4914 /* A primary class template can only have one
4915 parameter pack, at the end of the template
4918 error ("parameter pack %q+D must be at the end of the"
4919 " template parameter list", TREE_VALUE (parm
));
4921 TREE_VALUE (TREE_VEC_ELT (inner_parms
, i
))
4929 if (((cxx_dialect
== cxx98
) && TREE_CODE (decl
) != TYPE_DECL
)
4933 /* For an ordinary class template, default template arguments are
4934 allowed at the innermost level, e.g.:
4935 template <class T = int>
4937 but, in a partial specialization, they're not allowed even
4938 there, as we have in [temp.class.spec]:
4940 The template parameter list of a specialization shall not
4941 contain default template argument values.
4943 So, for a partial specialization, or for a function template
4944 (in C++98/C++03), we look at all of them. */
4947 /* But, for a primary class template that is not a partial
4948 specialization we look at all template parameters except the
4950 parms
= TREE_CHAIN (parms
);
4952 /* Figure out what error message to issue. */
4953 if (is_friend_decl
== 2)
4954 msg
= G_("default template arguments may not be used in function template "
4955 "friend re-declaration");
4956 else if (is_friend_decl
)
4957 msg
= G_("default template arguments may not be used in function template "
4958 "friend declarations");
4959 else if (TREE_CODE (decl
) == FUNCTION_DECL
&& (cxx_dialect
== cxx98
))
4960 msg
= G_("default template arguments may not be used in function templates "
4961 "without -std=c++11 or -std=gnu++11");
4962 else if (is_partial
)
4963 msg
= G_("default template arguments may not be used in "
4964 "partial specializations");
4965 else if (current_class_type
&& CLASSTYPE_IS_TEMPLATE (current_class_type
))
4966 msg
= G_("default argument for template parameter for class enclosing %qD");
4968 /* Per [temp.param]/9, "A default template-argument shall not be
4969 specified in the template-parameter-lists of the definition of
4970 a member of a class template that appears outside of the member's
4971 class.", thus if we aren't handling a member of a class template
4972 there is no need to examine the parameters. */
4975 if (current_class_type
&& TYPE_BEING_DEFINED (current_class_type
))
4976 /* If we're inside a class definition, there's no need to
4977 examine the parameters to the class itself. On the one
4978 hand, they will be checked when the class is defined, and,
4979 on the other, default arguments are valid in things like:
4980 template <class T = double>
4981 struct S { template <class U> void f(U); };
4982 Here the default argument for `S' has no bearing on the
4983 declaration of `f'. */
4984 last_level_to_check
= template_class_depth (current_class_type
) + 1;
4986 /* Check everything. */
4987 last_level_to_check
= 0;
4989 for (parm_level
= parms
;
4990 parm_level
&& TMPL_PARMS_DEPTH (parm_level
) >= last_level_to_check
;
4991 parm_level
= TREE_CHAIN (parm_level
))
4993 tree inner_parms
= TREE_VALUE (parm_level
);
4997 ntparms
= TREE_VEC_LENGTH (inner_parms
);
4998 for (i
= 0; i
< ntparms
; ++i
)
5000 if (TREE_VEC_ELT (inner_parms
, i
) == error_mark_node
)
5003 if (TREE_PURPOSE (TREE_VEC_ELT (inner_parms
, i
)))
5008 if (is_friend_decl
== 2)
5015 /* Clear out the default argument so that we are not
5017 TREE_PURPOSE (TREE_VEC_ELT (inner_parms
, i
)) = NULL_TREE
;
5021 /* At this point, if we're still interested in issuing messages,
5022 they must apply to classes surrounding the object declared. */
5024 msg
= G_("default argument for template parameter for class "
5031 /* Worker for push_template_decl_real, called via
5032 for_each_template_parm. DATA is really an int, indicating the
5033 level of the parameters we are interested in. If T is a template
5034 parameter of that level, return nonzero. */
5037 template_parm_this_level_p (tree t
, void* data
)
5039 int this_level
= *(int *)data
;
5042 if (TREE_CODE (t
) == TEMPLATE_PARM_INDEX
)
5043 level
= TEMPLATE_PARM_LEVEL (t
);
5045 level
= TEMPLATE_TYPE_LEVEL (t
);
5046 return level
== this_level
;
5049 /* Creates a TEMPLATE_DECL for the indicated DECL using the template
5050 parameters given by current_template_args, or reuses a
5051 previously existing one, if appropriate. Returns the DECL, or an
5052 equivalent one, if it is replaced via a call to duplicate_decls.
5054 If IS_FRIEND is true, DECL is a friend declaration. */
5057 push_template_decl_real (tree decl
, bool is_friend
)
5065 int new_template_p
= 0;
5066 /* True if the template is a member template, in the sense of
5068 bool member_template_p
= false;
5070 if (decl
== error_mark_node
|| !current_template_parms
)
5071 return error_mark_node
;
5073 /* See if this is a partial specialization. */
5074 is_partial
= ((DECL_IMPLICIT_TYPEDEF_P (decl
)
5075 && TREE_CODE (TREE_TYPE (decl
)) != ENUMERAL_TYPE
5076 && CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_TYPE (decl
)))
5078 && DECL_LANG_SPECIFIC (decl
)
5079 && DECL_TEMPLATE_SPECIALIZATION (decl
)
5080 && TINFO_USED_TEMPLATE_ID (DECL_TEMPLATE_INFO (decl
))));
5082 if (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_FRIEND_P (decl
))
5086 /* For a friend, we want the context of the friend function, not
5087 the type of which it is a friend. */
5088 ctx
= CP_DECL_CONTEXT (decl
);
5089 else if (CP_DECL_CONTEXT (decl
)
5090 && TREE_CODE (CP_DECL_CONTEXT (decl
)) != NAMESPACE_DECL
)
5091 /* In the case of a virtual function, we want the class in which
5093 ctx
= CP_DECL_CONTEXT (decl
);
5095 /* Otherwise, if we're currently defining some class, the DECL
5096 is assumed to be a member of the class. */
5097 ctx
= current_scope ();
5099 if (ctx
&& TREE_CODE (ctx
) == NAMESPACE_DECL
)
5102 if (!DECL_CONTEXT (decl
))
5103 DECL_CONTEXT (decl
) = FROB_CONTEXT (current_namespace
);
5105 /* See if this is a primary template. */
5106 if (is_friend
&& ctx
5107 && uses_template_parms_level (ctx
, processing_template_decl
))
5108 /* A friend template that specifies a class context, i.e.
5109 template <typename T> friend void A<T>::f();
5112 else if (TREE_CODE (decl
) == TYPE_DECL
5113 && LAMBDA_TYPE_P (TREE_TYPE (decl
)))
5116 is_primary
= template_parm_scope_p ();
5120 warning (OPT_Wtemplates
, "template %qD declared", decl
);
5122 if (DECL_CLASS_SCOPE_P (decl
))
5123 member_template_p
= true;
5124 if (TREE_CODE (decl
) == TYPE_DECL
5125 && anon_aggrname_p (DECL_NAME (decl
)))
5127 error ("template class without a name");
5128 return error_mark_node
;
5130 else if (TREE_CODE (decl
) == FUNCTION_DECL
)
5132 if (member_template_p
)
5134 if (DECL_OVERRIDE_P (decl
) || DECL_FINAL_P (decl
))
5135 error ("member template %qD may not have virt-specifiers", decl
);
5137 if (DECL_DESTRUCTOR_P (decl
))
5141 A destructor shall not be a member template. */
5142 error ("destructor %qD declared as member template", decl
);
5143 return error_mark_node
;
5145 if (NEW_DELETE_OPNAME_P (DECL_NAME (decl
))
5146 && (!prototype_p (TREE_TYPE (decl
))
5147 || TYPE_ARG_TYPES (TREE_TYPE (decl
)) == void_list_node
5148 || !TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (decl
)))
5149 || (TREE_CHAIN (TYPE_ARG_TYPES ((TREE_TYPE (decl
))))
5150 == void_list_node
)))
5152 /* [basic.stc.dynamic.allocation]
5154 An allocation function can be a function
5155 template. ... Template allocation functions shall
5156 have two or more parameters. */
5157 error ("invalid template declaration of %qD", decl
);
5158 return error_mark_node
;
5161 else if (DECL_IMPLICIT_TYPEDEF_P (decl
)
5162 && CLASS_TYPE_P (TREE_TYPE (decl
)))
5164 else if (TREE_CODE (decl
) == TYPE_DECL
5165 && TYPE_DECL_ALIAS_P (decl
))
5166 /* alias-declaration */
5167 gcc_assert (!DECL_ARTIFICIAL (decl
));
5168 else if (VAR_P (decl
))
5169 /* C++14 variable template. */;
5172 error ("template declaration of %q#D", decl
);
5173 return error_mark_node
;
5177 /* Check to see that the rules regarding the use of default
5178 arguments are not being violated. */
5179 check_default_tmpl_args (decl
, current_template_parms
,
5180 is_primary
, is_partial
, /*is_friend_decl=*/0);
5182 /* Ensure that there are no parameter packs in the type of this
5183 declaration that have not been expanded. */
5184 if (TREE_CODE (decl
) == FUNCTION_DECL
)
5186 /* Check each of the arguments individually to see if there are
5187 any bare parameter packs. */
5188 tree type
= TREE_TYPE (decl
);
5189 tree arg
= DECL_ARGUMENTS (decl
);
5190 tree argtype
= TYPE_ARG_TYPES (type
);
5192 while (arg
&& argtype
)
5194 if (!DECL_PACK_P (arg
)
5195 && check_for_bare_parameter_packs (TREE_TYPE (arg
)))
5197 /* This is a PARM_DECL that contains unexpanded parameter
5198 packs. We have already complained about this in the
5199 check_for_bare_parameter_packs call, so just replace
5200 these types with ERROR_MARK_NODE. */
5201 TREE_TYPE (arg
) = error_mark_node
;
5202 TREE_VALUE (argtype
) = error_mark_node
;
5205 arg
= DECL_CHAIN (arg
);
5206 argtype
= TREE_CHAIN (argtype
);
5209 /* Check for bare parameter packs in the return type and the
5210 exception specifiers. */
5211 if (check_for_bare_parameter_packs (TREE_TYPE (type
)))
5212 /* Errors were already issued, set return type to int
5213 as the frontend doesn't expect error_mark_node as
5215 TREE_TYPE (type
) = integer_type_node
;
5216 if (check_for_bare_parameter_packs (TYPE_RAISES_EXCEPTIONS (type
)))
5217 TYPE_RAISES_EXCEPTIONS (type
) = NULL_TREE
;
5219 else if (check_for_bare_parameter_packs ((TREE_CODE (decl
) == TYPE_DECL
5220 && TYPE_DECL_ALIAS_P (decl
))
5221 ? DECL_ORIGINAL_TYPE (decl
)
5222 : TREE_TYPE (decl
)))
5224 TREE_TYPE (decl
) = error_mark_node
;
5225 return error_mark_node
;
5229 return process_partial_specialization (decl
);
5231 args
= current_template_args ();
5234 || TREE_CODE (ctx
) == FUNCTION_DECL
5235 || (CLASS_TYPE_P (ctx
) && TYPE_BEING_DEFINED (ctx
))
5236 || (TREE_CODE (decl
) == TYPE_DECL
5237 && LAMBDA_TYPE_P (TREE_TYPE (decl
)))
5238 || (is_friend
&& !DECL_TEMPLATE_INFO (decl
)))
5240 if (DECL_LANG_SPECIFIC (decl
)
5241 && DECL_TEMPLATE_INFO (decl
)
5242 && DECL_TI_TEMPLATE (decl
))
5243 tmpl
= DECL_TI_TEMPLATE (decl
);
5244 /* If DECL is a TYPE_DECL for a class-template, then there won't
5245 be DECL_LANG_SPECIFIC. The information equivalent to
5246 DECL_TEMPLATE_INFO is found in TYPE_TEMPLATE_INFO instead. */
5247 else if (DECL_IMPLICIT_TYPEDEF_P (decl
)
5248 && TYPE_TEMPLATE_INFO (TREE_TYPE (decl
))
5249 && TYPE_TI_TEMPLATE (TREE_TYPE (decl
)))
5251 /* Since a template declaration already existed for this
5252 class-type, we must be redeclaring it here. Make sure
5253 that the redeclaration is valid. */
5254 redeclare_class_template (TREE_TYPE (decl
),
5255 current_template_parms
,
5256 current_template_constraints ());
5257 /* We don't need to create a new TEMPLATE_DECL; just use the
5258 one we already had. */
5259 tmpl
= TYPE_TI_TEMPLATE (TREE_TYPE (decl
));
5263 tmpl
= build_template_decl (decl
, current_template_parms
,
5267 if (DECL_LANG_SPECIFIC (decl
)
5268 && DECL_TEMPLATE_SPECIALIZATION (decl
))
5270 /* A specialization of a member template of a template
5272 SET_DECL_TEMPLATE_SPECIALIZATION (tmpl
);
5273 DECL_TEMPLATE_INFO (tmpl
) = DECL_TEMPLATE_INFO (decl
);
5274 DECL_TEMPLATE_INFO (decl
) = NULL_TREE
;
5280 tree a
, t
, current
, parms
;
5282 tree tinfo
= get_template_info (decl
);
5286 error ("template definition of non-template %q#D", decl
);
5287 return error_mark_node
;
5290 tmpl
= TI_TEMPLATE (tinfo
);
5292 if (DECL_FUNCTION_TEMPLATE_P (tmpl
)
5293 && DECL_TEMPLATE_INFO (decl
) && DECL_TI_ARGS (decl
)
5294 && DECL_TEMPLATE_SPECIALIZATION (decl
)
5295 && DECL_MEMBER_TEMPLATE_P (tmpl
))
5299 /* The declaration is a specialization of a member
5300 template, declared outside the class. Therefore, the
5301 innermost template arguments will be NULL, so we
5302 replace them with the arguments determined by the
5303 earlier call to check_explicit_specialization. */
5304 args
= DECL_TI_ARGS (decl
);
5307 = build_template_decl (decl
, current_template_parms
,
5309 DECL_TEMPLATE_RESULT (new_tmpl
) = decl
;
5310 TREE_TYPE (new_tmpl
) = TREE_TYPE (decl
);
5311 DECL_TI_TEMPLATE (decl
) = new_tmpl
;
5312 SET_DECL_TEMPLATE_SPECIALIZATION (new_tmpl
);
5313 DECL_TEMPLATE_INFO (new_tmpl
)
5314 = build_template_info (tmpl
, args
);
5316 register_specialization (new_tmpl
,
5317 most_general_template (tmpl
),
5323 /* Make sure the template headers we got make sense. */
5325 parms
= DECL_TEMPLATE_PARMS (tmpl
);
5326 i
= TMPL_PARMS_DEPTH (parms
);
5327 if (TMPL_ARGS_DEPTH (args
) != i
)
5329 error ("expected %d levels of template parms for %q#D, got %d",
5330 i
, decl
, TMPL_ARGS_DEPTH (args
));
5331 DECL_INTERFACE_KNOWN (decl
) = 1;
5332 return error_mark_node
;
5335 for (current
= decl
; i
> 0; --i
, parms
= TREE_CHAIN (parms
))
5337 a
= TMPL_ARGS_LEVEL (args
, i
);
5338 t
= INNERMOST_TEMPLATE_PARMS (parms
);
5340 if (TREE_VEC_LENGTH (t
) != TREE_VEC_LENGTH (a
))
5342 if (current
== decl
)
5343 error ("got %d template parameters for %q#D",
5344 TREE_VEC_LENGTH (a
), decl
);
5346 error ("got %d template parameters for %q#T",
5347 TREE_VEC_LENGTH (a
), current
);
5348 error (" but %d required", TREE_VEC_LENGTH (t
));
5349 /* Avoid crash in import_export_decl. */
5350 DECL_INTERFACE_KNOWN (decl
) = 1;
5351 return error_mark_node
;
5354 if (current
== decl
)
5356 else if (current
== NULL_TREE
)
5357 /* Can happen in erroneous input. */
5360 current
= get_containing_scope (current
);
5363 /* Check that the parms are used in the appropriate qualifying scopes
5364 in the declarator. */
5365 if (!comp_template_args
5367 TI_ARGS (get_template_info (DECL_TEMPLATE_RESULT (tmpl
)))))
5370 template arguments to %qD do not match original template %qD",
5371 decl
, DECL_TEMPLATE_RESULT (tmpl
));
5372 if (!uses_template_parms (TI_ARGS (tinfo
)))
5373 inform (input_location
, "use template<> for an explicit specialization");
5374 /* Avoid crash in import_export_decl. */
5375 DECL_INTERFACE_KNOWN (decl
) = 1;
5376 return error_mark_node
;
5380 DECL_TEMPLATE_RESULT (tmpl
) = decl
;
5381 TREE_TYPE (tmpl
) = TREE_TYPE (decl
);
5383 /* Push template declarations for global functions and types. Note
5384 that we do not try to push a global template friend declared in a
5385 template class; such a thing may well depend on the template
5386 parameters of the class. */
5387 if (new_template_p
&& !ctx
5388 && !(is_friend
&& template_class_depth (current_class_type
) > 0))
5390 tmpl
= pushdecl_namespace_level (tmpl
, is_friend
);
5391 if (tmpl
== error_mark_node
)
5392 return error_mark_node
;
5394 /* Hide template friend classes that haven't been declared yet. */
5395 if (is_friend
&& TREE_CODE (decl
) == TYPE_DECL
)
5397 DECL_ANTICIPATED (tmpl
) = 1;
5398 DECL_FRIEND_P (tmpl
) = 1;
5404 tree parms
= DECL_TEMPLATE_PARMS (tmpl
);
5407 DECL_PRIMARY_TEMPLATE (tmpl
) = tmpl
;
5408 if (DECL_CONV_FN_P (tmpl
))
5410 int depth
= TMPL_PARMS_DEPTH (parms
);
5412 /* It is a conversion operator. See if the type converted to
5413 depends on innermost template operands. */
5415 if (uses_template_parms_level (TREE_TYPE (TREE_TYPE (tmpl
)),
5417 DECL_TEMPLATE_CONV_FN_P (tmpl
) = 1;
5420 /* Give template template parms a DECL_CONTEXT of the template
5421 for which they are a parameter. */
5422 parms
= INNERMOST_TEMPLATE_PARMS (parms
);
5423 for (i
= TREE_VEC_LENGTH (parms
) - 1; i
>= 0; --i
)
5425 tree parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
5426 if (TREE_CODE (parm
) == TEMPLATE_DECL
)
5427 DECL_CONTEXT (parm
) = tmpl
;
5430 if (TREE_CODE (decl
) == TYPE_DECL
5431 && TYPE_DECL_ALIAS_P (decl
)
5432 && complex_alias_template_p (tmpl
))
5433 TEMPLATE_DECL_COMPLEX_ALIAS_P (tmpl
) = true;
5436 /* The DECL_TI_ARGS of DECL contains full set of arguments referring
5437 back to its most general template. If TMPL is a specialization,
5438 ARGS may only have the innermost set of arguments. Add the missing
5439 argument levels if necessary. */
5440 if (DECL_TEMPLATE_INFO (tmpl
))
5441 args
= add_outermost_template_args (DECL_TI_ARGS (tmpl
), args
);
5443 info
= build_template_info (tmpl
, args
);
5445 if (DECL_IMPLICIT_TYPEDEF_P (decl
))
5446 SET_TYPE_TEMPLATE_INFO (TREE_TYPE (tmpl
), info
);
5449 if (is_primary
&& !DECL_LANG_SPECIFIC (decl
))
5450 retrofit_lang_decl (decl
);
5451 if (DECL_LANG_SPECIFIC (decl
))
5452 DECL_TEMPLATE_INFO (decl
) = info
;
5455 if (flag_implicit_templates
5457 && TREE_PUBLIC (decl
)
5458 && VAR_OR_FUNCTION_DECL_P (decl
))
5459 /* Set DECL_COMDAT on template instantiations; if we force
5460 them to be emitted by explicit instantiation or -frepo,
5461 mark_needed will tell cgraph to do the right thing. */
5462 DECL_COMDAT (decl
) = true;
5464 return DECL_TEMPLATE_RESULT (tmpl
);
5468 push_template_decl (tree decl
)
5470 return push_template_decl_real (decl
, false);
5473 /* FN is an inheriting constructor that inherits from the constructor
5474 template INHERITED; turn FN into a constructor template with a matching
5478 add_inherited_template_parms (tree fn
, tree inherited
)
5481 = INNERMOST_TEMPLATE_PARMS (DECL_TEMPLATE_PARMS (inherited
));
5482 inner_parms
= copy_node (inner_parms
);
5484 = tree_cons (size_int (processing_template_decl
+ 1),
5485 inner_parms
, current_template_parms
);
5486 tree tmpl
= build_template_decl (fn
, parms
, /*member*/true);
5487 tree args
= template_parms_to_args (parms
);
5488 DECL_TEMPLATE_INFO (fn
) = build_template_info (tmpl
, args
);
5489 TREE_TYPE (tmpl
) = TREE_TYPE (fn
);
5490 DECL_TEMPLATE_RESULT (tmpl
) = fn
;
5491 DECL_ARTIFICIAL (tmpl
) = true;
5492 DECL_PRIMARY_TEMPLATE (tmpl
) = tmpl
;
5496 /* Called when a class template TYPE is redeclared with the indicated
5497 template PARMS, e.g.:
5499 template <class T> struct S;
5500 template <class T> struct S {}; */
5503 redeclare_class_template (tree type
, tree parms
, tree cons
)
5509 if (!TYPE_TEMPLATE_INFO (type
))
5511 error ("%qT is not a template type", type
);
5515 tmpl
= TYPE_TI_TEMPLATE (type
);
5516 if (!PRIMARY_TEMPLATE_P (tmpl
))
5517 /* The type is nested in some template class. Nothing to worry
5518 about here; there are no new template parameters for the nested
5524 error ("template specifiers not specified in declaration of %qD",
5529 parms
= INNERMOST_TEMPLATE_PARMS (parms
);
5530 tmpl_parms
= DECL_INNERMOST_TEMPLATE_PARMS (tmpl
);
5532 if (TREE_VEC_LENGTH (parms
) != TREE_VEC_LENGTH (tmpl_parms
))
5534 error_n (input_location
, TREE_VEC_LENGTH (parms
),
5535 "redeclared with %d template parameter",
5536 "redeclared with %d template parameters",
5537 TREE_VEC_LENGTH (parms
));
5538 inform_n (DECL_SOURCE_LOCATION (tmpl
), TREE_VEC_LENGTH (tmpl_parms
),
5539 "previous declaration %qD used %d template parameter",
5540 "previous declaration %qD used %d template parameters",
5541 tmpl
, TREE_VEC_LENGTH (tmpl_parms
));
5545 for (i
= 0; i
< TREE_VEC_LENGTH (tmpl_parms
); ++i
)
5552 if (TREE_VEC_ELT (tmpl_parms
, i
) == error_mark_node
5553 || TREE_VEC_ELT (parms
, i
) == error_mark_node
)
5556 tmpl_parm
= TREE_VALUE (TREE_VEC_ELT (tmpl_parms
, i
));
5557 if (error_operand_p (tmpl_parm
))
5560 parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
5561 tmpl_default
= TREE_PURPOSE (TREE_VEC_ELT (tmpl_parms
, i
));
5562 parm_default
= TREE_PURPOSE (TREE_VEC_ELT (parms
, i
));
5564 /* TMPL_PARM and PARM can be either TYPE_DECL, PARM_DECL, or
5566 if (TREE_CODE (tmpl_parm
) != TREE_CODE (parm
)
5567 || (TREE_CODE (tmpl_parm
) != TYPE_DECL
5568 && !same_type_p (TREE_TYPE (tmpl_parm
), TREE_TYPE (parm
)))
5569 || (TREE_CODE (tmpl_parm
) != PARM_DECL
5570 && (TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (tmpl_parm
))
5571 != TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (parm
))))
5572 || (TREE_CODE (tmpl_parm
) == PARM_DECL
5573 && (TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (tmpl_parm
))
5574 != TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm
)))))
5576 error ("template parameter %q+#D", tmpl_parm
);
5577 error ("redeclared here as %q#D", parm
);
5581 if (tmpl_default
!= NULL_TREE
&& parm_default
!= NULL_TREE
)
5583 /* We have in [temp.param]:
5585 A template-parameter may not be given default arguments
5586 by two different declarations in the same scope. */
5587 error_at (input_location
, "redefinition of default argument for %q#D", parm
);
5588 inform (DECL_SOURCE_LOCATION (tmpl_parm
),
5589 "original definition appeared here");
5593 if (parm_default
!= NULL_TREE
)
5594 /* Update the previous template parameters (which are the ones
5595 that will really count) with the new default value. */
5596 TREE_PURPOSE (TREE_VEC_ELT (tmpl_parms
, i
)) = parm_default
;
5597 else if (tmpl_default
!= NULL_TREE
)
5598 /* Update the new parameters, too; they'll be used as the
5599 parameters for any members. */
5600 TREE_PURPOSE (TREE_VEC_ELT (parms
, i
)) = tmpl_default
;
5602 /* Give each template template parm in this redeclaration a
5603 DECL_CONTEXT of the template for which they are a parameter. */
5604 if (TREE_CODE (parm
) == TEMPLATE_DECL
)
5606 gcc_assert (DECL_CONTEXT (parm
) == NULL_TREE
);
5607 DECL_CONTEXT (parm
) = tmpl
;
5611 // Cannot redeclare a class template with a different set of constraints.
5612 if (!equivalent_constraints (get_constraints (tmpl
), cons
))
5614 error_at (input_location
, "redeclaration %q#D with different "
5615 "constraints", tmpl
);
5616 inform (DECL_SOURCE_LOCATION (tmpl
),
5617 "original declaration appeared here");
5623 /* The actual substitution part of instantiate_non_dependent_expr_sfinae,
5624 to be used when the caller has already checked
5625 (processing_template_decl
5626 && !instantiation_dependent_expression_p (expr)
5627 && potential_constant_expression (expr))
5628 and cleared processing_template_decl. */
5631 instantiate_non_dependent_expr_internal (tree expr
, tsubst_flags_t complain
)
5633 return tsubst_copy_and_build (expr
,
5636 /*in_decl=*/NULL_TREE
,
5637 /*function_p=*/false,
5638 /*integral_constant_expression_p=*/true);
5641 /* Simplify EXPR if it is a non-dependent expression. Returns the
5642 (possibly simplified) expression. */
5645 instantiate_non_dependent_expr_sfinae (tree expr
, tsubst_flags_t complain
)
5647 if (expr
== NULL_TREE
)
5650 /* If we're in a template, but EXPR isn't value dependent, simplify
5651 it. We're supposed to treat:
5653 template <typename T> void f(T[1 + 1]);
5654 template <typename T> void f(T[2]);
5656 as two declarations of the same function, for example. */
5657 if (processing_template_decl
5658 && !instantiation_dependent_expression_p (expr
)
5659 && potential_constant_expression (expr
))
5661 processing_template_decl_sentinel s
;
5662 expr
= instantiate_non_dependent_expr_internal (expr
, complain
);
5668 instantiate_non_dependent_expr (tree expr
)
5670 return instantiate_non_dependent_expr_sfinae (expr
, tf_error
);
5673 /* Like instantiate_non_dependent_expr, but return NULL_TREE rather than
5674 an uninstantiated expression. */
5677 instantiate_non_dependent_or_null (tree expr
)
5679 if (expr
== NULL_TREE
)
5681 if (processing_template_decl
)
5683 if (instantiation_dependent_expression_p (expr
)
5684 || !potential_constant_expression (expr
))
5688 processing_template_decl_sentinel s
;
5689 expr
= instantiate_non_dependent_expr_internal (expr
, tf_error
);
5695 /* True iff T is a specialization of a variable template. */
5698 variable_template_specialization_p (tree t
)
5700 if (!VAR_P (t
) || !DECL_LANG_SPECIFIC (t
) || !DECL_TEMPLATE_INFO (t
))
5702 tree tmpl
= DECL_TI_TEMPLATE (t
);
5703 return variable_template_p (tmpl
);
5706 /* Return TRUE iff T is a type alias, a TEMPLATE_DECL for an alias
5707 template declaration, or a TYPE_DECL for an alias declaration. */
5710 alias_type_or_template_p (tree t
)
5714 return ((TREE_CODE (t
) == TYPE_DECL
&& TYPE_DECL_ALIAS_P (t
))
5717 && TYPE_DECL_ALIAS_P (TYPE_NAME (t
)))
5718 || DECL_ALIAS_TEMPLATE_P (t
));
5721 /* Return TRUE iff T is a specialization of an alias template. */
5724 alias_template_specialization_p (const_tree t
)
5726 /* It's an alias template specialization if it's an alias and its
5727 TYPE_NAME is a specialization of a primary template. */
5728 if (TYPE_ALIAS_P (t
))
5730 tree name
= TYPE_NAME (t
);
5731 if (DECL_LANG_SPECIFIC (name
))
5732 if (tree ti
= DECL_TEMPLATE_INFO (name
))
5734 tree tmpl
= TI_TEMPLATE (ti
);
5735 return PRIMARY_TEMPLATE_P (tmpl
);
5741 /* An alias template is complex from a SFINAE perspective if a template-id
5742 using that alias can be ill-formed when the expansion is not, as with
5743 the void_t template. We determine this by checking whether the
5744 expansion for the alias template uses all its template parameters. */
5746 struct uses_all_template_parms_data
5753 uses_all_template_parms_r (tree t
, void *data_
)
5755 struct uses_all_template_parms_data
&data
5756 = *(struct uses_all_template_parms_data
*)data_
;
5757 tree idx
= get_template_parm_index (t
);
5759 if (TEMPLATE_PARM_LEVEL (idx
) == data
.level
)
5760 data
.seen
[TEMPLATE_PARM_IDX (idx
)] = true;
5765 complex_alias_template_p (const_tree tmpl
)
5767 struct uses_all_template_parms_data data
;
5768 tree pat
= DECL_ORIGINAL_TYPE (DECL_TEMPLATE_RESULT (tmpl
));
5769 tree parms
= DECL_TEMPLATE_PARMS (tmpl
);
5770 data
.level
= TMPL_PARMS_DEPTH (parms
);
5771 int len
= TREE_VEC_LENGTH (INNERMOST_TEMPLATE_PARMS (parms
));
5772 data
.seen
= XALLOCAVEC (bool, len
);
5773 for (int i
= 0; i
< len
; ++i
)
5774 data
.seen
[i
] = false;
5776 for_each_template_parm (pat
, uses_all_template_parms_r
, &data
, NULL
, true);
5777 for (int i
= 0; i
< len
; ++i
)
5783 /* Return TRUE iff T is a specialization of a complex alias template with
5784 dependent template-arguments. */
5787 dependent_alias_template_spec_p (const_tree t
)
5789 return (alias_template_specialization_p (t
)
5790 && TEMPLATE_DECL_COMPLEX_ALIAS_P (DECL_TI_TEMPLATE (TYPE_NAME (t
)))
5791 && (any_dependent_template_arguments_p
5792 (INNERMOST_TEMPLATE_ARGS (TYPE_TI_ARGS (t
)))));
5795 /* Return the number of innermost template parameters in TMPL. */
5798 num_innermost_template_parms (tree tmpl
)
5800 tree parms
= INNERMOST_TEMPLATE_PARMS (DECL_TEMPLATE_PARMS (tmpl
));
5801 return TREE_VEC_LENGTH (parms
);
5804 /* Return either TMPL or another template that it is equivalent to under DR
5805 1286: An alias that just changes the name of a template is equivalent to
5806 the other template. */
5809 get_underlying_template (tree tmpl
)
5811 gcc_assert (TREE_CODE (tmpl
) == TEMPLATE_DECL
);
5812 while (DECL_ALIAS_TEMPLATE_P (tmpl
))
5814 tree result
= DECL_ORIGINAL_TYPE (DECL_TEMPLATE_RESULT (tmpl
));
5815 if (TYPE_TEMPLATE_INFO (result
))
5817 tree sub
= TYPE_TI_TEMPLATE (result
);
5818 if (PRIMARY_TEMPLATE_P (sub
)
5819 && (num_innermost_template_parms (tmpl
)
5820 == num_innermost_template_parms (sub
)))
5822 tree alias_args
= INNERMOST_TEMPLATE_ARGS
5823 (template_parms_to_args (DECL_TEMPLATE_PARMS (tmpl
)));
5824 if (!comp_template_args (TYPE_TI_ARGS (result
), alias_args
))
5826 /* The alias type is equivalent to the pattern of the
5827 underlying template, so strip the alias. */
5837 /* Subroutine of convert_nontype_argument. Converts EXPR to TYPE, which
5838 must be a function or a pointer-to-function type, as specified
5839 in [temp.arg.nontype]: disambiguate EXPR if it is an overload set,
5840 and check that the resulting function has external linkage. */
5843 convert_nontype_argument_function (tree type
, tree expr
,
5844 tsubst_flags_t complain
)
5848 linkage_kind linkage
;
5850 fn
= instantiate_type (type
, fns
, tf_none
);
5851 if (fn
== error_mark_node
)
5852 return error_mark_node
;
5855 if (TREE_CODE (fn_no_ptr
) == ADDR_EXPR
)
5856 fn_no_ptr
= TREE_OPERAND (fn_no_ptr
, 0);
5857 if (BASELINK_P (fn_no_ptr
))
5858 fn_no_ptr
= BASELINK_FUNCTIONS (fn_no_ptr
);
5860 /* [temp.arg.nontype]/1
5862 A template-argument for a non-type, non-template template-parameter
5865 -- the address of an object or function with external [C++11: or
5866 internal] linkage. */
5868 if (TREE_CODE (fn_no_ptr
) != FUNCTION_DECL
)
5870 if (complain
& tf_error
)
5872 error ("%qE is not a valid template argument for type %qT",
5874 if (TYPE_PTR_P (type
))
5875 error ("it must be the address of a function with "
5876 "external linkage");
5878 error ("it must be the name of a function with "
5879 "external linkage");
5884 linkage
= decl_linkage (fn_no_ptr
);
5885 if (cxx_dialect
>= cxx11
? linkage
== lk_none
: linkage
!= lk_external
)
5887 if (complain
& tf_error
)
5889 if (cxx_dialect
>= cxx11
)
5890 error ("%qE is not a valid template argument for type %qT "
5891 "because %qD has no linkage",
5892 expr
, type
, fn_no_ptr
);
5894 error ("%qE is not a valid template argument for type %qT "
5895 "because %qD does not have external linkage",
5896 expr
, type
, fn_no_ptr
);
5904 /* Subroutine of convert_nontype_argument.
5905 Check if EXPR of type TYPE is a valid pointer-to-member constant.
5906 Emit an error otherwise. */
5909 check_valid_ptrmem_cst_expr (tree type
, tree expr
,
5910 tsubst_flags_t complain
)
5913 if (expr
&& (null_ptr_cst_p (expr
) || TREE_CODE (expr
) == PTRMEM_CST
))
5915 if (cxx_dialect
>= cxx11
&& null_member_pointer_value_p (expr
))
5917 if (processing_template_decl
5918 && TREE_CODE (expr
) == ADDR_EXPR
5919 && TREE_CODE (TREE_OPERAND (expr
, 0)) == OFFSET_REF
)
5921 if (complain
& tf_error
)
5923 error ("%qE is not a valid template argument for type %qT",
5925 error ("it must be a pointer-to-member of the form %<&X::Y%>");
5930 /* Returns TRUE iff the address of OP is value-dependent.
5932 14.6.2.4 [temp.dep.temp]:
5933 A non-integral non-type template-argument is dependent if its type is
5934 dependent or it has either of the following forms
5937 and contains a nested-name-specifier which specifies a class-name that
5938 names a dependent type.
5940 We generalize this to just say that the address of a member of a
5941 dependent class is value-dependent; the above doesn't cover the
5942 address of a static data member named with an unqualified-id. */
5945 has_value_dependent_address (tree op
)
5947 /* We could use get_inner_reference here, but there's no need;
5948 this is only relevant for template non-type arguments, which
5949 can only be expressed as &id-expression. */
5952 tree ctx
= CP_DECL_CONTEXT (op
);
5953 if (TYPE_P (ctx
) && dependent_type_p (ctx
))
5960 /* The next set of functions are used for providing helpful explanatory
5961 diagnostics for failed overload resolution. Their messages should be
5962 indented by two spaces for consistency with the messages in
5966 unify_success (bool /*explain_p*/)
5972 unify_parameter_deduction_failure (bool explain_p
, tree parm
)
5975 inform (input_location
,
5976 " couldn't deduce template parameter %qD", parm
);
5981 unify_invalid (bool /*explain_p*/)
5987 unify_cv_qual_mismatch (bool explain_p
, tree parm
, tree arg
)
5990 inform (input_location
,
5991 " types %qT and %qT have incompatible cv-qualifiers",
5997 unify_type_mismatch (bool explain_p
, tree parm
, tree arg
)
6000 inform (input_location
, " mismatched types %qT and %qT", parm
, arg
);
6005 unify_parameter_pack_mismatch (bool explain_p
, tree parm
, tree arg
)
6008 inform (input_location
,
6009 " template parameter %qD is not a parameter pack, but "
6016 unify_ptrmem_cst_mismatch (bool explain_p
, tree parm
, tree arg
)
6019 inform (input_location
,
6020 " template argument %qE does not match "
6021 "pointer-to-member constant %qE",
6027 unify_expression_unequal (bool explain_p
, tree parm
, tree arg
)
6030 inform (input_location
, " %qE is not equivalent to %qE", parm
, arg
);
6035 unify_parameter_pack_inconsistent (bool explain_p
, tree old_arg
, tree new_arg
)
6038 inform (input_location
,
6039 " inconsistent parameter pack deduction with %qT and %qT",
6045 unify_inconsistency (bool explain_p
, tree parm
, tree first
, tree second
)
6050 inform (input_location
,
6051 " deduced conflicting types for parameter %qT (%qT and %qT)",
6052 parm
, first
, second
);
6054 inform (input_location
,
6055 " deduced conflicting values for non-type parameter "
6056 "%qE (%qE and %qE)", parm
, first
, second
);
6062 unify_vla_arg (bool explain_p
, tree arg
)
6065 inform (input_location
,
6066 " variable-sized array type %qT is not "
6067 "a valid template argument",
6073 unify_method_type_error (bool explain_p
, tree arg
)
6076 inform (input_location
,
6077 " member function type %qT is not a valid template argument",
6083 unify_arity (bool explain_p
, int have
, int wanted
, bool least_p
= false)
6088 inform_n (input_location
, wanted
,
6089 " candidate expects at least %d argument, %d provided",
6090 " candidate expects at least %d arguments, %d provided",
6093 inform_n (input_location
, wanted
,
6094 " candidate expects %d argument, %d provided",
6095 " candidate expects %d arguments, %d provided",
6102 unify_too_many_arguments (bool explain_p
, int have
, int wanted
)
6104 return unify_arity (explain_p
, have
, wanted
);
6108 unify_too_few_arguments (bool explain_p
, int have
, int wanted
,
6109 bool least_p
= false)
6111 return unify_arity (explain_p
, have
, wanted
, least_p
);
6115 unify_arg_conversion (bool explain_p
, tree to_type
,
6116 tree from_type
, tree arg
)
6119 inform (EXPR_LOC_OR_LOC (arg
, input_location
),
6120 " cannot convert %qE (type %qT) to type %qT",
6121 arg
, from_type
, to_type
);
6126 unify_no_common_base (bool explain_p
, enum template_base_result r
,
6127 tree parm
, tree arg
)
6132 case tbr_ambiguous_baseclass
:
6133 inform (input_location
, " %qT is an ambiguous base class of %qT",
6137 inform (input_location
, " %qT is not derived from %qT", arg
, parm
);
6144 unify_inconsistent_template_template_parameters (bool explain_p
)
6147 inform (input_location
,
6148 " template parameters of a template template argument are "
6149 "inconsistent with other deduced template arguments");
6154 unify_template_deduction_failure (bool explain_p
, tree parm
, tree arg
)
6157 inform (input_location
,
6158 " can't deduce a template for %qT from non-template type %qT",
6164 unify_template_argument_mismatch (bool explain_p
, tree parm
, tree arg
)
6167 inform (input_location
,
6168 " template argument %qE does not match %qD", arg
, parm
);
6173 unify_overload_resolution_failure (bool explain_p
, tree arg
)
6176 inform (input_location
,
6177 " could not resolve address from overloaded function %qE",
6182 /* Attempt to convert the non-type template parameter EXPR to the
6183 indicated TYPE. If the conversion is successful, return the
6184 converted value. If the conversion is unsuccessful, return
6185 NULL_TREE if we issued an error message, or error_mark_node if we
6186 did not. We issue error messages for out-and-out bad template
6187 parameters, but not simply because the conversion failed, since we
6188 might be just trying to do argument deduction. Both TYPE and EXPR
6189 must be non-dependent.
6191 The conversion follows the special rules described in
6192 [temp.arg.nontype], and it is much more strict than an implicit
6195 This function is called twice for each template argument (see
6196 lookup_template_class for a more accurate description of this
6197 problem). This means that we need to handle expressions which
6198 are not valid in a C++ source, but can be created from the
6199 first call (for instance, casts to perform conversions). These
6200 hacks can go away after we fix the double coercion problem. */
6203 convert_nontype_argument (tree type
, tree expr
, tsubst_flags_t complain
)
6207 /* Detect immediately string literals as invalid non-type argument.
6208 This special-case is not needed for correctness (we would easily
6209 catch this later), but only to provide better diagnostic for this
6210 common user mistake. As suggested by DR 100, we do not mention
6211 linkage issues in the diagnostic as this is not the point. */
6212 /* FIXME we're making this OK. */
6213 if (TREE_CODE (expr
) == STRING_CST
)
6215 if (complain
& tf_error
)
6216 error ("%qE is not a valid template argument for type %qT "
6217 "because string literals can never be used in this context",
6222 /* Add the ADDR_EXPR now for the benefit of
6223 value_dependent_expression_p. */
6224 if (TYPE_PTROBV_P (type
)
6225 && TREE_CODE (TREE_TYPE (expr
)) == ARRAY_TYPE
)
6227 expr
= decay_conversion (expr
, complain
);
6228 if (expr
== error_mark_node
)
6229 return error_mark_node
;
6232 /* If we are in a template, EXPR may be non-dependent, but still
6233 have a syntactic, rather than semantic, form. For example, EXPR
6234 might be a SCOPE_REF, rather than the VAR_DECL to which the
6235 SCOPE_REF refers. Preserving the qualifying scope is necessary
6236 so that access checking can be performed when the template is
6237 instantiated -- but here we need the resolved form so that we can
6238 convert the argument. */
6239 bool non_dep
= false;
6240 if (TYPE_REF_OBJ_P (type
)
6241 && has_value_dependent_address (expr
))
6242 /* If we want the address and it's value-dependent, don't fold. */;
6243 else if (!type_unknown_p (expr
)
6244 && processing_template_decl
6245 && !instantiation_dependent_expression_p (expr
)
6246 && potential_constant_expression (expr
))
6248 if (error_operand_p (expr
))
6249 return error_mark_node
;
6250 expr_type
= TREE_TYPE (expr
);
6251 if (TREE_CODE (type
) == REFERENCE_TYPE
)
6252 expr
= mark_lvalue_use (expr
);
6254 expr
= mark_rvalue_use (expr
);
6256 /* If the argument is non-dependent, perform any conversions in
6257 non-dependent context as well. */
6258 processing_template_decl_sentinel
s (non_dep
);
6260 expr
= instantiate_non_dependent_expr_internal (expr
, complain
);
6262 /* 14.3.2/5: The null pointer{,-to-member} conversion is applied
6263 to a non-type argument of "nullptr". */
6264 if (expr
== nullptr_node
&& TYPE_PTR_OR_PTRMEM_P (type
))
6265 expr
= fold_simple (convert (type
, expr
));
6267 /* In C++11, integral or enumeration non-type template arguments can be
6268 arbitrary constant expressions. Pointer and pointer to
6269 member arguments can be general constant expressions that evaluate
6270 to a null value, but otherwise still need to be of a specific form. */
6271 if (cxx_dialect
>= cxx11
)
6273 if (TREE_CODE (expr
) == PTRMEM_CST
)
6274 /* A PTRMEM_CST is already constant, and a valid template
6275 argument for a parameter of pointer to member type, we just want
6276 to leave it in that form rather than lower it to a
6278 else if (INTEGRAL_OR_ENUMERATION_TYPE_P (type
))
6279 expr
= maybe_constant_value (expr
);
6280 else if (cxx_dialect
>= cxx1z
)
6282 if (TREE_CODE (type
) != REFERENCE_TYPE
)
6283 expr
= maybe_constant_value (expr
);
6284 else if (REFERENCE_REF_P (expr
))
6286 expr
= TREE_OPERAND (expr
, 0);
6287 expr
= maybe_constant_value (expr
);
6288 expr
= convert_from_reference (expr
);
6291 else if (TYPE_PTR_OR_PTRMEM_P (type
))
6293 tree folded
= maybe_constant_value (expr
);
6294 if (TYPE_PTR_P (type
) ? integer_zerop (folded
)
6295 : null_member_pointer_value_p (folded
))
6300 /* HACK: Due to double coercion, we can get a
6301 NOP_EXPR<REFERENCE_TYPE>(ADDR_EXPR<POINTER_TYPE> (arg)) here,
6302 which is the tree that we built on the first call (see
6303 below when coercing to reference to object or to reference to
6304 function). We just strip everything and get to the arg.
6305 See g++.old-deja/g++.oliva/template4.C and g++.dg/template/nontype9.C
6307 if (TYPE_REF_OBJ_P (type
) || TYPE_REFFN_P (type
))
6309 tree probe_type
, probe
= expr
;
6310 if (REFERENCE_REF_P (probe
))
6311 probe
= TREE_OPERAND (probe
, 0);
6312 probe_type
= TREE_TYPE (probe
);
6313 if (TREE_CODE (probe
) == NOP_EXPR
)
6315 /* ??? Maybe we could use convert_from_reference here, but we
6316 would need to relax its constraints because the NOP_EXPR
6317 could actually change the type to something more cv-qualified,
6318 and this is not folded by convert_from_reference. */
6319 tree addr
= TREE_OPERAND (probe
, 0);
6320 if (TREE_CODE (probe_type
) == REFERENCE_TYPE
6321 && TREE_CODE (addr
) == ADDR_EXPR
6322 && TYPE_PTR_P (TREE_TYPE (addr
))
6323 && (same_type_ignoring_top_level_qualifiers_p
6324 (TREE_TYPE (probe_type
),
6325 TREE_TYPE (TREE_TYPE (addr
)))))
6327 expr
= TREE_OPERAND (addr
, 0);
6328 expr_type
= TREE_TYPE (probe_type
);
6333 /* We could also generate a NOP_EXPR(ADDR_EXPR()) when the
6334 parameter is a pointer to object, through decay and
6335 qualification conversion. Let's strip everything. */
6336 else if (TREE_CODE (expr
) == NOP_EXPR
&& TYPE_PTROBV_P (type
))
6340 if (TREE_CODE (probe
) == ADDR_EXPR
6341 && TYPE_PTR_P (TREE_TYPE (probe
)))
6343 /* Skip the ADDR_EXPR only if it is part of the decay for
6344 an array. Otherwise, it is part of the original argument
6345 in the source code. */
6346 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (probe
, 0))) == ARRAY_TYPE
)
6347 probe
= TREE_OPERAND (probe
, 0);
6349 expr_type
= TREE_TYPE (expr
);
6353 /* [temp.arg.nontype]/5, bullet 1
6355 For a non-type template-parameter of integral or enumeration type,
6356 integral promotions (_conv.prom_) and integral conversions
6357 (_conv.integral_) are applied. */
6358 if (INTEGRAL_OR_ENUMERATION_TYPE_P (type
))
6360 tree t
= build_integral_nontype_arg_conv (type
, expr
, complain
);
6361 t
= maybe_constant_value (t
);
6362 if (t
!= error_mark_node
)
6365 if (!same_type_ignoring_top_level_qualifiers_p (type
, TREE_TYPE (expr
)))
6366 return error_mark_node
;
6368 /* Notice that there are constant expressions like '4 % 0' which
6369 do not fold into integer constants. */
6370 if (TREE_CODE (expr
) != INTEGER_CST
)
6372 if (complain
& tf_error
)
6374 int errs
= errorcount
, warns
= warningcount
+ werrorcount
;
6375 if (processing_template_decl
6376 && !require_potential_constant_expression (expr
))
6378 expr
= cxx_constant_value (expr
);
6379 if (errorcount
> errs
|| warningcount
+ werrorcount
> warns
)
6380 inform (EXPR_LOC_OR_LOC (expr
, input_location
),
6381 "in template argument for type %qT ", type
);
6382 if (expr
== error_mark_node
)
6384 /* else cxx_constant_value complained but gave us
6385 a real constant, so go ahead. */
6386 gcc_assert (TREE_CODE (expr
) == INTEGER_CST
);
6392 /* Avoid typedef problems. */
6393 if (TREE_TYPE (expr
) != type
)
6394 expr
= fold_convert (type
, expr
);
6396 /* [temp.arg.nontype]/5, bullet 2
6398 For a non-type template-parameter of type pointer to object,
6399 qualification conversions (_conv.qual_) and the array-to-pointer
6400 conversion (_conv.array_) are applied. */
6401 else if (TYPE_PTROBV_P (type
))
6403 /* [temp.arg.nontype]/1 (TC1 version, DR 49):
6405 A template-argument for a non-type, non-template template-parameter
6406 shall be one of: [...]
6408 -- the name of a non-type template-parameter;
6409 -- the address of an object or function with external linkage, [...]
6410 expressed as "& id-expression" where the & is optional if the name
6411 refers to a function or array, or if the corresponding
6412 template-parameter is a reference.
6414 Here, we do not care about functions, as they are invalid anyway
6415 for a parameter of type pointer-to-object. */
6417 if (DECL_P (expr
) && DECL_TEMPLATE_PARM_P (expr
))
6418 /* Non-type template parameters are OK. */
6420 else if (cxx_dialect
>= cxx11
&& integer_zerop (expr
))
6421 /* Null pointer values are OK in C++11. */;
6422 else if (TREE_CODE (expr
) != ADDR_EXPR
6423 && TREE_CODE (expr_type
) != ARRAY_TYPE
)
6427 if (complain
& tf_error
)
6428 error ("%qD is not a valid template argument "
6429 "because %qD is a variable, not the address of "
6430 "a variable", expr
, expr
);
6433 if (POINTER_TYPE_P (expr_type
))
6435 if (complain
& tf_error
)
6436 error ("%qE is not a valid template argument for %qT "
6437 "because it is not the address of a variable",
6441 /* Other values, like integer constants, might be valid
6442 non-type arguments of some other type. */
6443 return error_mark_node
;
6449 decl
= ((TREE_CODE (expr
) == ADDR_EXPR
)
6450 ? TREE_OPERAND (expr
, 0) : expr
);
6453 if (complain
& tf_error
)
6454 error ("%qE is not a valid template argument of type %qT "
6455 "because %qE is not a variable", expr
, type
, decl
);
6458 else if (cxx_dialect
< cxx11
&& !DECL_EXTERNAL_LINKAGE_P (decl
))
6460 if (complain
& tf_error
)
6461 error ("%qE is not a valid template argument of type %qT "
6462 "because %qD does not have external linkage",
6466 else if (cxx_dialect
>= cxx11
&& decl_linkage (decl
) == lk_none
)
6468 if (complain
& tf_error
)
6469 error ("%qE is not a valid template argument of type %qT "
6470 "because %qD has no linkage", expr
, type
, decl
);
6475 expr
= decay_conversion (expr
, complain
);
6476 if (expr
== error_mark_node
)
6477 return error_mark_node
;
6479 expr
= perform_qualification_conversions (type
, expr
);
6480 if (expr
== error_mark_node
)
6481 return error_mark_node
;
6483 /* [temp.arg.nontype]/5, bullet 3
6485 For a non-type template-parameter of type reference to object, no
6486 conversions apply. The type referred to by the reference may be more
6487 cv-qualified than the (otherwise identical) type of the
6488 template-argument. The template-parameter is bound directly to the
6489 template-argument, which must be an lvalue. */
6490 else if (TYPE_REF_OBJ_P (type
))
6492 if (!same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (type
),
6494 return error_mark_node
;
6496 if (!at_least_as_qualified_p (TREE_TYPE (type
), expr_type
))
6498 if (complain
& tf_error
)
6499 error ("%qE is not a valid template argument for type %qT "
6500 "because of conflicts in cv-qualification", expr
, type
);
6504 if (!real_lvalue_p (expr
))
6506 if (complain
& tf_error
)
6507 error ("%qE is not a valid template argument for type %qT "
6508 "because it is not an lvalue", expr
, type
);
6512 /* [temp.arg.nontype]/1
6514 A template-argument for a non-type, non-template template-parameter
6515 shall be one of: [...]
6517 -- the address of an object or function with external linkage. */
6518 if (INDIRECT_REF_P (expr
)
6519 && TYPE_REF_OBJ_P (TREE_TYPE (TREE_OPERAND (expr
, 0))))
6521 expr
= TREE_OPERAND (expr
, 0);
6524 if (complain
& tf_error
)
6525 error ("%q#D is not a valid template argument for type %qT "
6526 "because a reference variable does not have a constant "
6527 "address", expr
, type
);
6534 if (complain
& tf_error
)
6535 error ("%qE is not a valid template argument for type %qT "
6536 "because it is not an object with linkage",
6541 /* DR 1155 allows internal linkage in C++11 and up. */
6542 linkage_kind linkage
= decl_linkage (expr
);
6543 if (linkage
< (cxx_dialect
>= cxx11
? lk_internal
: lk_external
))
6545 if (complain
& tf_error
)
6546 error ("%qE is not a valid template argument for type %qT "
6547 "because object %qD does not have linkage",
6552 expr
= build_nop (type
, build_address (expr
));
6554 /* [temp.arg.nontype]/5, bullet 4
6556 For a non-type template-parameter of type pointer to function, only
6557 the function-to-pointer conversion (_conv.func_) is applied. If the
6558 template-argument represents a set of overloaded functions (or a
6559 pointer to such), the matching function is selected from the set
6561 else if (TYPE_PTRFN_P (type
))
6563 /* If the argument is a template-id, we might not have enough
6564 context information to decay the pointer. */
6565 if (!type_unknown_p (expr_type
))
6567 expr
= decay_conversion (expr
, complain
);
6568 if (expr
== error_mark_node
)
6569 return error_mark_node
;
6572 if (cxx_dialect
>= cxx11
&& integer_zerop (expr
))
6573 /* Null pointer values are OK in C++11. */
6574 return perform_qualification_conversions (type
, expr
);
6576 expr
= convert_nontype_argument_function (type
, expr
, complain
);
6577 if (!expr
|| expr
== error_mark_node
)
6580 /* [temp.arg.nontype]/5, bullet 5
6582 For a non-type template-parameter of type reference to function, no
6583 conversions apply. If the template-argument represents a set of
6584 overloaded functions, the matching function is selected from the set
6586 else if (TYPE_REFFN_P (type
))
6588 if (TREE_CODE (expr
) == ADDR_EXPR
)
6590 if (complain
& tf_error
)
6592 error ("%qE is not a valid template argument for type %qT "
6593 "because it is a pointer", expr
, type
);
6594 inform (input_location
, "try using %qE instead",
6595 TREE_OPERAND (expr
, 0));
6600 expr
= convert_nontype_argument_function (type
, expr
, complain
);
6601 if (!expr
|| expr
== error_mark_node
)
6604 expr
= build_nop (type
, build_address (expr
));
6606 /* [temp.arg.nontype]/5, bullet 6
6608 For a non-type template-parameter of type pointer to member function,
6609 no conversions apply. If the template-argument represents a set of
6610 overloaded member functions, the matching member function is selected
6611 from the set (_over.over_). */
6612 else if (TYPE_PTRMEMFUNC_P (type
))
6614 expr
= instantiate_type (type
, expr
, tf_none
);
6615 if (expr
== error_mark_node
)
6616 return error_mark_node
;
6618 /* [temp.arg.nontype] bullet 1 says the pointer to member
6619 expression must be a pointer-to-member constant. */
6620 if (!check_valid_ptrmem_cst_expr (type
, expr
, complain
))
6621 return error_mark_node
;
6623 /* There is no way to disable standard conversions in
6624 resolve_address_of_overloaded_function (called by
6625 instantiate_type). It is possible that the call succeeded by
6626 converting &B::I to &D::I (where B is a base of D), so we need
6627 to reject this conversion here.
6629 Actually, even if there was a way to disable standard conversions,
6630 it would still be better to reject them here so that we can
6631 provide a superior diagnostic. */
6632 if (!same_type_p (TREE_TYPE (expr
), type
))
6634 if (complain
& tf_error
)
6636 error ("%qE is not a valid template argument for type %qT "
6637 "because it is of type %qT", expr
, type
,
6639 /* If we are just one standard conversion off, explain. */
6640 if (can_convert_standard (type
, TREE_TYPE (expr
), complain
))
6641 inform (input_location
,
6642 "standard conversions are not allowed in this context");
6647 /* [temp.arg.nontype]/5, bullet 7
6649 For a non-type template-parameter of type pointer to data member,
6650 qualification conversions (_conv.qual_) are applied. */
6651 else if (TYPE_PTRDATAMEM_P (type
))
6653 /* [temp.arg.nontype] bullet 1 says the pointer to member
6654 expression must be a pointer-to-member constant. */
6655 if (!check_valid_ptrmem_cst_expr (type
, expr
, complain
))
6656 return error_mark_node
;
6658 expr
= perform_qualification_conversions (type
, expr
);
6659 if (expr
== error_mark_node
)
6662 else if (NULLPTR_TYPE_P (type
))
6664 if (expr
!= nullptr_node
)
6666 if (complain
& tf_error
)
6667 error ("%qE is not a valid template argument for type %qT "
6668 "because it is of type %qT", expr
, type
, TREE_TYPE (expr
));
6673 /* A template non-type parameter must be one of the above. */
6677 /* Sanity check: did we actually convert the argument to the
6679 gcc_assert (same_type_ignoring_top_level_qualifiers_p
6680 (type
, TREE_TYPE (expr
)));
6681 return convert_from_reference (expr
);
6684 /* Subroutine of coerce_template_template_parms, which returns 1 if
6685 PARM_PARM and ARG_PARM match using the rule for the template
6686 parameters of template template parameters. Both PARM and ARG are
6687 template parameters; the rest of the arguments are the same as for
6688 coerce_template_template_parms.
6691 coerce_template_template_parm (tree parm
,
6693 tsubst_flags_t complain
,
6697 if (arg
== NULL_TREE
|| error_operand_p (arg
)
6698 || parm
== NULL_TREE
|| error_operand_p (parm
))
6701 if (TREE_CODE (arg
) != TREE_CODE (parm
))
6704 switch (TREE_CODE (parm
))
6707 /* We encounter instantiations of templates like
6708 template <template <template <class> class> class TT>
6711 tree parmparm
= DECL_INNERMOST_TEMPLATE_PARMS (parm
);
6712 tree argparm
= DECL_INNERMOST_TEMPLATE_PARMS (arg
);
6714 if (!coerce_template_template_parms
6715 (parmparm
, argparm
, complain
, in_decl
, outer_args
))
6721 if (TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (arg
))
6722 && !TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (parm
)))
6723 /* Argument is a parameter pack but parameter is not. */
6728 /* The tsubst call is used to handle cases such as
6730 template <int> class C {};
6731 template <class T, template <T> class TT> class D {};
6734 i.e. the parameter list of TT depends on earlier parameters. */
6735 if (!uses_template_parms (TREE_TYPE (arg
)))
6737 tree t
= tsubst (TREE_TYPE (parm
), outer_args
, complain
, in_decl
);
6738 if (!uses_template_parms (t
)
6739 && !same_type_p (t
, TREE_TYPE (arg
)))
6743 if (TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (arg
))
6744 && !TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm
)))
6745 /* Argument is a parameter pack but parameter is not. */
6758 /* Return 1 if PARM_PARMS and ARG_PARMS matches using rule for
6759 template template parameters. Both PARM_PARMS and ARG_PARMS are
6760 vectors of TREE_LIST nodes containing TYPE_DECL, TEMPLATE_DECL
6763 Consider the example:
6764 template <class T> class A;
6765 template<template <class U> class TT> class B;
6767 For B<A>, PARM_PARMS are the parameters to TT, while ARG_PARMS are
6768 the parameters to A, and OUTER_ARGS contains A. */
6771 coerce_template_template_parms (tree parm_parms
,
6773 tsubst_flags_t complain
,
6777 int nparms
, nargs
, i
;
6781 gcc_assert (TREE_CODE (parm_parms
) == TREE_VEC
);
6782 gcc_assert (TREE_CODE (arg_parms
) == TREE_VEC
);
6784 nparms
= TREE_VEC_LENGTH (parm_parms
);
6785 nargs
= TREE_VEC_LENGTH (arg_parms
);
6787 /* Determine whether we have a parameter pack at the end of the
6788 template template parameter's template parameter list. */
6789 if (TREE_VEC_ELT (parm_parms
, nparms
- 1) != error_mark_node
)
6791 parm
= TREE_VALUE (TREE_VEC_ELT (parm_parms
, nparms
- 1));
6793 if (error_operand_p (parm
))
6796 switch (TREE_CODE (parm
))
6800 if (TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (parm
)))
6805 if (TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm
)))
6815 && !(variadic_p
&& nargs
>= nparms
- 1))
6818 /* Check all of the template parameters except the parameter pack at
6819 the end (if any). */
6820 for (i
= 0; i
< nparms
- variadic_p
; ++i
)
6822 if (TREE_VEC_ELT (parm_parms
, i
) == error_mark_node
6823 || TREE_VEC_ELT (arg_parms
, i
) == error_mark_node
)
6826 parm
= TREE_VALUE (TREE_VEC_ELT (parm_parms
, i
));
6827 arg
= TREE_VALUE (TREE_VEC_ELT (arg_parms
, i
));
6829 if (!coerce_template_template_parm (parm
, arg
, complain
, in_decl
,
6837 /* Check each of the template parameters in the template
6838 argument against the template parameter pack at the end of
6839 the template template parameter. */
6840 if (TREE_VEC_ELT (parm_parms
, i
) == error_mark_node
)
6843 parm
= TREE_VALUE (TREE_VEC_ELT (parm_parms
, i
));
6845 for (; i
< nargs
; ++i
)
6847 if (TREE_VEC_ELT (arg_parms
, i
) == error_mark_node
)
6850 arg
= TREE_VALUE (TREE_VEC_ELT (arg_parms
, i
));
6852 if (!coerce_template_template_parm (parm
, arg
, complain
, in_decl
,
6861 /* Verifies that the deduced template arguments (in TARGS) for the
6862 template template parameters (in TPARMS) represent valid bindings,
6863 by comparing the template parameter list of each template argument
6864 to the template parameter list of its corresponding template
6865 template parameter, in accordance with DR150. This
6866 routine can only be called after all template arguments have been
6867 deduced. It will return TRUE if all of the template template
6868 parameter bindings are okay, FALSE otherwise. */
6870 template_template_parm_bindings_ok_p (tree tparms
, tree targs
)
6872 int i
, ntparms
= TREE_VEC_LENGTH (tparms
);
6875 /* We're dealing with template parms in this process. */
6876 ++processing_template_decl
;
6878 targs
= INNERMOST_TEMPLATE_ARGS (targs
);
6880 for (i
= 0; i
< ntparms
; ++i
)
6882 tree tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, i
));
6883 tree targ
= TREE_VEC_ELT (targs
, i
);
6885 if (TREE_CODE (tparm
) == TEMPLATE_DECL
&& targ
)
6887 tree packed_args
= NULL_TREE
;
6890 if (ARGUMENT_PACK_P (targ
))
6892 /* Look inside the argument pack. */
6893 packed_args
= ARGUMENT_PACK_ARGS (targ
);
6894 len
= TREE_VEC_LENGTH (packed_args
);
6897 for (idx
= 0; idx
< len
; ++idx
)
6899 tree targ_parms
= NULL_TREE
;
6902 /* Extract the next argument from the argument
6904 targ
= TREE_VEC_ELT (packed_args
, idx
);
6906 if (PACK_EXPANSION_P (targ
))
6907 /* Look at the pattern of the pack expansion. */
6908 targ
= PACK_EXPANSION_PATTERN (targ
);
6910 /* Extract the template parameters from the template
6912 if (TREE_CODE (targ
) == TEMPLATE_DECL
)
6913 targ_parms
= DECL_INNERMOST_TEMPLATE_PARMS (targ
);
6914 else if (TREE_CODE (targ
) == TEMPLATE_TEMPLATE_PARM
)
6915 targ_parms
= DECL_INNERMOST_TEMPLATE_PARMS (TYPE_NAME (targ
));
6917 /* Verify that we can coerce the template template
6918 parameters from the template argument to the template
6919 parameter. This requires an exact match. */
6921 && !coerce_template_template_parms
6922 (DECL_INNERMOST_TEMPLATE_PARMS (tparm
),
6937 --processing_template_decl
;
6941 /* Since type attributes aren't mangled, we need to strip them from
6942 template type arguments. */
6945 canonicalize_type_argument (tree arg
, tsubst_flags_t complain
)
6947 if (!arg
|| arg
== error_mark_node
|| arg
== TYPE_CANONICAL (arg
))
6949 bool removed_attributes
= false;
6950 tree canon
= strip_typedefs (arg
, &removed_attributes
);
6951 if (removed_attributes
6952 && (complain
& tf_warning
))
6953 warning (OPT_Wignored_attributes
,
6954 "ignoring attributes on template argument %qT", arg
);
6958 // A template declaration can be substituted for a constrained
6959 // template template parameter only when the argument is more
6960 // constrained than the parameter.
6962 is_compatible_template_arg (tree parm
, tree arg
)
6964 tree parm_cons
= get_constraints (parm
);
6966 /* For now, allow constrained template template arguments
6967 and unconstrained template template parameters. */
6968 if (parm_cons
== NULL_TREE
)
6971 tree arg_cons
= get_constraints (arg
);
6973 // If the template parameter is constrained, we need to rewrite its
6974 // constraints in terms of the ARG's template parameters. This ensures
6975 // that all of the template parameter types will have the same depth.
6977 // Note that this is only valid when coerce_template_template_parm is
6978 // true for the innermost template parameters of PARM and ARG. In other
6979 // words, because coercion is successful, this conversion will be valid.
6982 tree args
= template_parms_to_args (DECL_TEMPLATE_PARMS (arg
));
6983 parm_cons
= tsubst_constraint_info (parm_cons
,
6984 INNERMOST_TEMPLATE_ARGS (args
),
6985 tf_none
, NULL_TREE
);
6986 if (parm_cons
== error_mark_node
)
6990 return subsumes (parm_cons
, arg_cons
);
6993 // Convert a placeholder argument into a binding to the original
6994 // parameter. The original parameter is saved as the TREE_TYPE of
6997 convert_wildcard_argument (tree parm
, tree arg
)
6999 TREE_TYPE (arg
) = parm
;
7003 /* Convert the indicated template ARG as necessary to match the
7004 indicated template PARM. Returns the converted ARG, or
7005 error_mark_node if the conversion was unsuccessful. Error and
7006 warning messages are issued under control of COMPLAIN. This
7007 conversion is for the Ith parameter in the parameter list. ARGS is
7008 the full set of template arguments deduced so far. */
7011 convert_template_argument (tree parm
,
7014 tsubst_flags_t complain
,
7020 int is_type
, requires_type
, is_tmpl_type
, requires_tmpl_type
;
7022 if (parm
== error_mark_node
)
7023 return error_mark_node
;
7025 /* Trivially convert placeholders. */
7026 if (TREE_CODE (arg
) == WILDCARD_DECL
)
7027 return convert_wildcard_argument (parm
, arg
);
7029 if (TREE_CODE (arg
) == TREE_LIST
7030 && TREE_CODE (TREE_VALUE (arg
)) == OFFSET_REF
)
7032 /* The template argument was the name of some
7033 member function. That's usually
7034 invalid, but static members are OK. In any
7035 case, grab the underlying fields/functions
7036 and issue an error later if required. */
7037 orig_arg
= TREE_VALUE (arg
);
7038 TREE_TYPE (arg
) = unknown_type_node
;
7043 requires_tmpl_type
= TREE_CODE (parm
) == TEMPLATE_DECL
;
7044 requires_type
= (TREE_CODE (parm
) == TYPE_DECL
7045 || requires_tmpl_type
);
7047 /* When determining whether an argument pack expansion is a template,
7048 look at the pattern. */
7049 if (TREE_CODE (arg
) == TYPE_PACK_EXPANSION
)
7050 arg
= PACK_EXPANSION_PATTERN (arg
);
7052 /* Deal with an injected-class-name used as a template template arg. */
7053 if (requires_tmpl_type
&& CLASS_TYPE_P (arg
))
7055 tree t
= maybe_get_template_decl_from_type_decl (TYPE_NAME (arg
));
7056 if (TREE_CODE (t
) == TEMPLATE_DECL
)
7058 if (cxx_dialect
>= cxx11
)
7059 /* OK under DR 1004. */;
7060 else if (complain
& tf_warning_or_error
)
7061 pedwarn (input_location
, OPT_Wpedantic
, "injected-class-name %qD"
7062 " used as template template argument", TYPE_NAME (arg
));
7063 else if (flag_pedantic_errors
)
7071 ((TREE_CODE (arg
) == TEMPLATE_DECL
7072 && TREE_CODE (DECL_TEMPLATE_RESULT (arg
)) == TYPE_DECL
)
7073 || (requires_tmpl_type
&& TREE_CODE (arg
) == TYPE_ARGUMENT_PACK
)
7074 || TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
7075 || TREE_CODE (arg
) == UNBOUND_CLASS_TEMPLATE
);
7078 && (TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
7079 || TREE_CODE (arg
) == UNBOUND_CLASS_TEMPLATE
))
7080 arg
= TYPE_STUB_DECL (arg
);
7082 is_type
= TYPE_P (arg
) || is_tmpl_type
;
7084 if (requires_type
&& ! is_type
&& TREE_CODE (arg
) == SCOPE_REF
7085 && TREE_CODE (TREE_OPERAND (arg
, 0)) == TEMPLATE_TYPE_PARM
)
7087 if (TREE_CODE (TREE_OPERAND (arg
, 1)) == BIT_NOT_EXPR
)
7089 if (complain
& tf_error
)
7090 error ("invalid use of destructor %qE as a type", orig_arg
);
7091 return error_mark_node
;
7094 permerror (input_location
,
7095 "to refer to a type member of a template parameter, "
7096 "use %<typename %E%>", orig_arg
);
7098 orig_arg
= make_typename_type (TREE_OPERAND (arg
, 0),
7099 TREE_OPERAND (arg
, 1),
7105 if (is_type
!= requires_type
)
7109 if (complain
& tf_error
)
7111 error ("type/value mismatch at argument %d in template "
7112 "parameter list for %qD",
7115 inform (input_location
,
7116 " expected a constant of type %qT, got %qT",
7118 (DECL_P (arg
) ? DECL_NAME (arg
) : orig_arg
));
7119 else if (requires_tmpl_type
)
7120 inform (input_location
,
7121 " expected a class template, got %qE", orig_arg
);
7123 inform (input_location
,
7124 " expected a type, got %qE", orig_arg
);
7127 return error_mark_node
;
7129 if (is_tmpl_type
^ requires_tmpl_type
)
7131 if (in_decl
&& (complain
& tf_error
))
7133 error ("type/value mismatch at argument %d in template "
7134 "parameter list for %qD",
7137 inform (input_location
,
7138 " expected a type, got %qT", DECL_NAME (arg
));
7140 inform (input_location
,
7141 " expected a class template, got %qT", orig_arg
);
7143 return error_mark_node
;
7148 if (requires_tmpl_type
)
7150 if (template_parameter_pack_p (parm
) && ARGUMENT_PACK_P (orig_arg
))
7152 else if (TREE_CODE (TREE_TYPE (arg
)) == UNBOUND_CLASS_TEMPLATE
)
7153 /* The number of argument required is not known yet.
7154 Just accept it for now. */
7155 val
= TREE_TYPE (arg
);
7158 tree parmparm
= DECL_INNERMOST_TEMPLATE_PARMS (parm
);
7161 /* Strip alias templates that are equivalent to another
7163 arg
= get_underlying_template (arg
);
7164 argparm
= DECL_INNERMOST_TEMPLATE_PARMS (arg
);
7166 if (coerce_template_template_parms (parmparm
, argparm
,
7172 /* TEMPLATE_TEMPLATE_PARM node is preferred over
7174 if (val
!= error_mark_node
)
7176 if (DECL_TEMPLATE_TEMPLATE_PARM_P (val
))
7177 val
= TREE_TYPE (val
);
7178 if (TREE_CODE (orig_arg
) == TYPE_PACK_EXPANSION
)
7179 val
= make_pack_expansion (val
);
7184 if (in_decl
&& (complain
& tf_error
))
7186 error ("type/value mismatch at argument %d in "
7187 "template parameter list for %qD",
7189 inform (input_location
,
7190 " expected a template of type %qD, got %qT",
7194 val
= error_mark_node
;
7197 // Check that the constraints are compatible before allowing the
7199 if (val
!= error_mark_node
)
7200 if (!is_compatible_template_arg (parm
, arg
))
7202 if (in_decl
&& (complain
& tf_error
))
7204 error ("constraint mismatch at argument %d in "
7205 "template parameter list for %qD",
7207 inform (input_location
, " expected %qD but got %qD",
7210 val
= error_mark_node
;
7216 /* We only form one instance of each template specialization.
7217 Therefore, if we use a non-canonical variant (i.e., a
7218 typedef), any future messages referring to the type will use
7219 the typedef, which is confusing if those future uses do not
7220 themselves also use the typedef. */
7222 val
= canonicalize_type_argument (val
, complain
);
7226 tree t
= tsubst (TREE_TYPE (parm
), args
, complain
, in_decl
);
7228 if (invalid_nontype_parm_type_p (t
, complain
))
7229 return error_mark_node
;
7231 if (template_parameter_pack_p (parm
) && ARGUMENT_PACK_P (orig_arg
))
7233 if (same_type_p (t
, TREE_TYPE (orig_arg
)))
7237 /* Not sure if this is reachable, but it doesn't hurt
7239 error ("type mismatch in nontype parameter pack");
7240 val
= error_mark_node
;
7243 else if (!dependent_template_arg_p (orig_arg
)
7244 && !uses_template_parms (t
))
7245 /* We used to call digest_init here. However, digest_init
7246 will report errors, which we don't want when complain
7247 is zero. More importantly, digest_init will try too
7248 hard to convert things: for example, `0' should not be
7249 converted to pointer type at this point according to
7250 the standard. Accepting this is not merely an
7251 extension, since deciding whether or not these
7252 conversions can occur is part of determining which
7253 function template to call, or whether a given explicit
7254 argument specification is valid. */
7255 val
= convert_nontype_argument (t
, orig_arg
, complain
);
7258 bool removed_attr
= false;
7259 val
= strip_typedefs_expr (orig_arg
, &removed_attr
);
7262 if (val
== NULL_TREE
)
7263 val
= error_mark_node
;
7264 else if (val
== error_mark_node
&& (complain
& tf_error
))
7265 error ("could not convert template argument %qE to %qT", orig_arg
, t
);
7267 if (INDIRECT_REF_P (val
))
7269 /* Reject template arguments that are references to built-in
7270 functions with no library fallbacks. */
7271 const_tree inner
= TREE_OPERAND (val
, 0);
7272 if (TREE_CODE (TREE_TYPE (inner
)) == REFERENCE_TYPE
7273 && TREE_CODE (TREE_TYPE (TREE_TYPE (inner
))) == FUNCTION_TYPE
7274 && TREE_CODE (TREE_TYPE (inner
)) == REFERENCE_TYPE
7275 && 0 < TREE_OPERAND_LENGTH (inner
)
7276 && reject_gcc_builtin (TREE_OPERAND (inner
, 0)))
7277 return error_mark_node
;
7280 if (TREE_CODE (val
) == SCOPE_REF
)
7282 /* Strip typedefs from the SCOPE_REF. */
7283 tree type
= canonicalize_type_argument (TREE_TYPE (val
), complain
);
7284 tree scope
= canonicalize_type_argument (TREE_OPERAND (val
, 0),
7286 val
= build_qualified_name (type
, scope
, TREE_OPERAND (val
, 1),
7287 QUALIFIED_NAME_IS_TEMPLATE (val
));
7294 /* Coerces the remaining template arguments in INNER_ARGS (from
7295 ARG_IDX to the end) into the parameter pack at PARM_IDX in PARMS.
7296 Returns the coerced argument pack. PARM_IDX is the position of this
7297 parameter in the template parameter list. ARGS is the original
7298 template argument list. */
7300 coerce_template_parameter_pack (tree parms
,
7308 tsubst_flags_t complain
)
7310 tree parm
= TREE_VEC_ELT (parms
, parm_idx
);
7311 int nargs
= inner_args
? NUM_TMPL_ARGS (inner_args
) : 0;
7314 tree packed_parms
= NULL_TREE
;
7316 if (arg_idx
> nargs
)
7319 if (tree packs
= fixed_parameter_pack_p (TREE_VALUE (parm
)))
7321 /* When the template parameter is a non-type template parameter pack
7322 or template template parameter pack whose type or template
7323 parameters use parameter packs, we know exactly how many arguments
7324 we are looking for. Build a vector of the instantiated decls for
7325 these template parameters in PACKED_PARMS. */
7326 /* We can't use make_pack_expansion here because it would interpret a
7327 _DECL as a use rather than a declaration. */
7328 tree decl
= TREE_VALUE (parm
);
7329 tree exp
= cxx_make_type (TYPE_PACK_EXPANSION
);
7330 SET_PACK_EXPANSION_PATTERN (exp
, decl
);
7331 PACK_EXPANSION_PARAMETER_PACKS (exp
) = packs
;
7332 SET_TYPE_STRUCTURAL_EQUALITY (exp
);
7334 TREE_VEC_LENGTH (args
)--;
7335 packed_parms
= tsubst_pack_expansion (exp
, args
, complain
, decl
);
7336 TREE_VEC_LENGTH (args
)++;
7338 if (packed_parms
== error_mark_node
)
7339 return error_mark_node
;
7341 /* If we're doing a partial instantiation of a member template,
7342 verify that all of the types used for the non-type
7343 template parameter pack are, in fact, valid for non-type
7344 template parameters. */
7346 && PACK_EXPANSION_P (TREE_VEC_ELT (inner_args
, arg_idx
)))
7348 int j
, len
= TREE_VEC_LENGTH (packed_parms
);
7349 for (j
= 0; j
< len
; ++j
)
7351 tree t
= TREE_TYPE (TREE_VEC_ELT (packed_parms
, j
));
7352 if (invalid_nontype_parm_type_p (t
, complain
))
7353 return error_mark_node
;
7355 /* We don't know how many args we have yet, just
7356 use the unconverted ones for now. */
7360 packed_args
= make_tree_vec (TREE_VEC_LENGTH (packed_parms
));
7362 /* Check if we have a placeholder pack, which indicates we're
7363 in the context of a introduction list. In that case we want
7364 to match this pack to the single placeholder. */
7365 else if (arg_idx
< nargs
7366 && TREE_CODE (TREE_VEC_ELT (inner_args
, arg_idx
)) == WILDCARD_DECL
7367 && WILDCARD_PACK_P (TREE_VEC_ELT (inner_args
, arg_idx
)))
7369 nargs
= arg_idx
+ 1;
7370 packed_args
= make_tree_vec (1);
7373 packed_args
= make_tree_vec (nargs
- arg_idx
);
7375 /* Convert the remaining arguments, which will be a part of the
7376 parameter pack "parm". */
7377 for (; arg_idx
< nargs
; ++arg_idx
)
7379 tree arg
= TREE_VEC_ELT (inner_args
, arg_idx
);
7380 tree actual_parm
= TREE_VALUE (parm
);
7381 int pack_idx
= arg_idx
- parm_idx
;
7385 /* Once we've packed as many args as we have types, stop. */
7386 if (pack_idx
>= TREE_VEC_LENGTH (packed_parms
))
7388 else if (PACK_EXPANSION_P (arg
))
7389 /* We don't know how many args we have yet, just
7390 use the unconverted ones for now. */
7393 actual_parm
= TREE_VEC_ELT (packed_parms
, pack_idx
);
7396 if (arg
== error_mark_node
)
7398 if (complain
& tf_error
)
7399 error ("template argument %d is invalid", arg_idx
+ 1);
7402 arg
= convert_template_argument (actual_parm
,
7403 arg
, new_args
, complain
, parm_idx
,
7405 if (arg
== error_mark_node
)
7407 TREE_VEC_ELT (packed_args
, pack_idx
) = arg
;
7410 if (arg_idx
- parm_idx
< TREE_VEC_LENGTH (packed_args
)
7411 && TREE_VEC_LENGTH (packed_args
) > 0)
7413 if (complain
& tf_error
)
7414 error ("wrong number of template arguments (%d, should be %d)",
7415 arg_idx
- parm_idx
, TREE_VEC_LENGTH (packed_args
));
7416 return error_mark_node
;
7419 if (TREE_CODE (TREE_VALUE (parm
)) == TYPE_DECL
7420 || TREE_CODE (TREE_VALUE (parm
)) == TEMPLATE_DECL
)
7421 argument_pack
= cxx_make_type (TYPE_ARGUMENT_PACK
);
7424 argument_pack
= make_node (NONTYPE_ARGUMENT_PACK
);
7425 TREE_TYPE (argument_pack
)
7426 = tsubst (TREE_TYPE (TREE_VALUE (parm
)), new_args
, complain
, in_decl
);
7427 TREE_CONSTANT (argument_pack
) = 1;
7430 SET_ARGUMENT_PACK_ARGS (argument_pack
, packed_args
);
7432 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (packed_args
,
7433 TREE_VEC_LENGTH (packed_args
));
7434 return argument_pack
;
7437 /* Returns the number of pack expansions in the template argument vector
7441 pack_expansion_args_count (tree args
)
7446 for (i
= 0; i
< TREE_VEC_LENGTH (args
); ++i
)
7448 tree elt
= TREE_VEC_ELT (args
, i
);
7449 if (elt
&& PACK_EXPANSION_P (elt
))
7455 /* Convert all template arguments to their appropriate types, and
7456 return a vector containing the innermost resulting template
7457 arguments. If any error occurs, return error_mark_node. Error and
7458 warning messages are issued under control of COMPLAIN.
7460 If REQUIRE_ALL_ARGS is false, argument deduction will be performed
7461 for arguments not specified in ARGS. Otherwise, if
7462 USE_DEFAULT_ARGS is true, default arguments will be used to fill in
7463 unspecified arguments. If REQUIRE_ALL_ARGS is true, but
7464 USE_DEFAULT_ARGS is false, then all arguments must be specified in
7468 coerce_template_parms (tree parms
,
7471 tsubst_flags_t complain
,
7472 bool require_all_args
,
7473 bool use_default_args
)
7475 int nparms
, nargs
, parm_idx
, arg_idx
, lost
= 0;
7476 tree orig_inner_args
;
7479 tree new_inner_args
;
7480 int saved_unevaluated_operand
;
7481 int saved_inhibit_evaluation_warnings
;
7483 /* When used as a boolean value, indicates whether this is a
7484 variadic template parameter list. Since it's an int, we can also
7485 subtract it from nparms to get the number of non-variadic
7488 int variadic_args_p
= 0;
7489 int post_variadic_parms
= 0;
7491 /* Likewise for parameters with default arguments. */
7494 if (args
== error_mark_node
)
7495 return error_mark_node
;
7497 nparms
= TREE_VEC_LENGTH (parms
);
7499 /* Determine if there are any parameter packs or default arguments. */
7500 for (parm_idx
= 0; parm_idx
< nparms
; ++parm_idx
)
7502 tree parm
= TREE_VEC_ELT (parms
, parm_idx
);
7504 ++post_variadic_parms
;
7505 if (template_parameter_pack_p (TREE_VALUE (parm
)))
7507 if (TREE_PURPOSE (parm
))
7511 inner_args
= orig_inner_args
= INNERMOST_TEMPLATE_ARGS (args
);
7512 /* If there are no parameters that follow a parameter pack, we need to
7513 expand any argument packs so that we can deduce a parameter pack from
7514 some non-packed args followed by an argument pack, as in variadic85.C.
7515 If there are such parameters, we need to leave argument packs intact
7516 so the arguments are assigned properly. This can happen when dealing
7517 with a nested class inside a partial specialization of a class
7518 template, as in variadic92.C, or when deducing a template parameter pack
7519 from a sub-declarator, as in variadic114.C. */
7520 if (!post_variadic_parms
)
7521 inner_args
= expand_template_argument_pack (inner_args
);
7523 /* Count any pack expansion args. */
7524 variadic_args_p
= pack_expansion_args_count (inner_args
);
7526 nargs
= inner_args
? NUM_TMPL_ARGS (inner_args
) : 0;
7527 if ((nargs
> nparms
&& !variadic_p
)
7528 || (nargs
< nparms
- variadic_p
7531 && (!use_default_args
7532 || (TREE_VEC_ELT (parms
, nargs
) != error_mark_node
7533 && !TREE_PURPOSE (TREE_VEC_ELT (parms
, nargs
))))))
7535 if (complain
& tf_error
)
7537 if (variadic_p
|| default_p
)
7539 nparms
-= variadic_p
+ default_p
;
7540 error ("wrong number of template arguments "
7541 "(%d, should be at least %d)", nargs
, nparms
);
7544 error ("wrong number of template arguments "
7545 "(%d, should be %d)", nargs
, nparms
);
7548 inform (DECL_SOURCE_LOCATION (in_decl
),
7549 "provided for %qD", in_decl
);
7552 return error_mark_node
;
7554 /* We can't pass a pack expansion to a non-pack parameter of an alias
7555 template (DR 1430). */
7557 && (DECL_ALIAS_TEMPLATE_P (in_decl
)
7558 || concept_template_p (in_decl
))
7560 && nargs
- variadic_args_p
< nparms
- variadic_p
)
7562 if (complain
& tf_error
)
7564 for (int i
= 0; i
< TREE_VEC_LENGTH (inner_args
); ++i
)
7566 tree arg
= TREE_VEC_ELT (inner_args
, i
);
7567 tree parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
7569 if (PACK_EXPANSION_P (arg
)
7570 && !template_parameter_pack_p (parm
))
7572 if (DECL_ALIAS_TEMPLATE_P (in_decl
))
7573 error_at (location_of (arg
),
7574 "pack expansion argument for non-pack parameter "
7575 "%qD of alias template %qD", parm
, in_decl
);
7577 error_at (location_of (arg
),
7578 "pack expansion argument for non-pack parameter "
7579 "%qD of concept %qD", parm
, in_decl
);
7580 inform (DECL_SOURCE_LOCATION (parm
), "declared here");
7587 return error_mark_node
;
7590 /* We need to evaluate the template arguments, even though this
7591 template-id may be nested within a "sizeof". */
7592 saved_unevaluated_operand
= cp_unevaluated_operand
;
7593 cp_unevaluated_operand
= 0;
7594 saved_inhibit_evaluation_warnings
= c_inhibit_evaluation_warnings
;
7595 c_inhibit_evaluation_warnings
= 0;
7596 new_inner_args
= make_tree_vec (nparms
);
7597 new_args
= add_outermost_template_args (args
, new_inner_args
);
7598 int pack_adjust
= 0;
7599 for (parm_idx
= 0, arg_idx
= 0; parm_idx
< nparms
; parm_idx
++, arg_idx
++)
7604 /* Get the Ith template parameter. */
7605 parm
= TREE_VEC_ELT (parms
, parm_idx
);
7607 if (parm
== error_mark_node
)
7609 TREE_VEC_ELT (new_inner_args
, arg_idx
) = error_mark_node
;
7613 /* Calculate the next argument. */
7614 if (arg_idx
< nargs
)
7615 arg
= TREE_VEC_ELT (inner_args
, arg_idx
);
7619 if (template_parameter_pack_p (TREE_VALUE (parm
))
7620 && !(arg
&& ARGUMENT_PACK_P (arg
)))
7622 /* Some arguments will be placed in the
7623 template parameter pack PARM. */
7624 arg
= coerce_template_parameter_pack (parms
, parm_idx
, args
,
7625 inner_args
, arg_idx
,
7629 if (arg
== NULL_TREE
)
7631 /* We don't know how many args we have yet, just use the
7632 unconverted (and still packed) ones for now. */
7633 new_inner_args
= orig_inner_args
;
7638 TREE_VEC_ELT (new_inner_args
, parm_idx
) = arg
;
7640 /* Store this argument. */
7641 if (arg
== error_mark_node
)
7644 /* We are done with all of the arguments. */
7649 pack_adjust
= TREE_VEC_LENGTH (ARGUMENT_PACK_ARGS (arg
)) - 1;
7650 arg_idx
+= pack_adjust
;
7657 if (PACK_EXPANSION_P (arg
))
7659 /* "If every valid specialization of a variadic template
7660 requires an empty template parameter pack, the template is
7661 ill-formed, no diagnostic required." So check that the
7662 pattern works with this parameter. */
7663 tree pattern
= PACK_EXPANSION_PATTERN (arg
);
7664 tree conv
= convert_template_argument (TREE_VALUE (parm
),
7668 if (conv
== error_mark_node
)
7670 inform (input_location
, "so any instantiation with a "
7671 "non-empty parameter pack would be ill-formed");
7674 else if (TYPE_P (conv
) && !TYPE_P (pattern
))
7675 /* Recover from missing typename. */
7676 TREE_VEC_ELT (inner_args
, arg_idx
)
7677 = make_pack_expansion (conv
);
7679 /* We don't know how many args we have yet, just
7680 use the unconverted ones for now. */
7681 new_inner_args
= inner_args
;
7686 else if (require_all_args
)
7688 /* There must be a default arg in this case. */
7689 arg
= tsubst_template_arg (TREE_PURPOSE (parm
), new_args
,
7691 /* The position of the first default template argument,
7692 is also the number of non-defaulted arguments in NEW_INNER_ARGS.
7694 if (!NON_DEFAULT_TEMPLATE_ARGS_COUNT (new_inner_args
))
7695 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (new_inner_args
,
7696 arg_idx
- pack_adjust
);
7701 if (arg
== error_mark_node
)
7703 if (complain
& tf_error
)
7704 error ("template argument %d is invalid", arg_idx
+ 1);
7707 /* This only occurs if there was an error in the template
7708 parameter list itself (which we would already have
7709 reported) that we are trying to recover from, e.g., a class
7710 template with a parameter list such as
7711 template<typename..., typename>. */
7714 arg
= convert_template_argument (TREE_VALUE (parm
),
7715 arg
, new_args
, complain
,
7718 if (arg
== error_mark_node
)
7720 TREE_VEC_ELT (new_inner_args
, arg_idx
- pack_adjust
) = arg
;
7722 cp_unevaluated_operand
= saved_unevaluated_operand
;
7723 c_inhibit_evaluation_warnings
= saved_inhibit_evaluation_warnings
;
7725 if (variadic_p
&& arg_idx
< nargs
)
7727 if (complain
& tf_error
)
7729 error ("wrong number of template arguments "
7730 "(%d, should be %d)", nargs
, arg_idx
);
7732 error ("provided for %q+D", in_decl
);
7734 return error_mark_node
;
7738 return error_mark_node
;
7740 if (CHECKING_P
&& !NON_DEFAULT_TEMPLATE_ARGS_COUNT (new_inner_args
))
7741 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (new_inner_args
,
7742 TREE_VEC_LENGTH (new_inner_args
));
7744 return new_inner_args
;
7747 /* Convert all template arguments to their appropriate types, and
7748 return a vector containing the innermost resulting template
7749 arguments. If any error occurs, return error_mark_node. Error and
7750 warning messages are not issued.
7752 Note that no function argument deduction is performed, and default
7753 arguments are used to fill in unspecified arguments. */
7755 coerce_template_parms (tree parms
, tree args
, tree in_decl
)
7757 return coerce_template_parms (parms
, args
, in_decl
, tf_none
, true, true);
7760 /* Convert all template arguments to their appropriate type, and
7761 instantiate default arguments as needed. This returns a vector
7762 containing the innermost resulting template arguments, or
7763 error_mark_node if unsuccessful. */
7765 coerce_template_parms (tree parms
, tree args
, tree in_decl
,
7766 tsubst_flags_t complain
)
7768 return coerce_template_parms (parms
, args
, in_decl
, complain
, true, true);
7771 /* Like coerce_template_parms. If PARMS represents all template
7772 parameters levels, this function returns a vector of vectors
7773 representing all the resulting argument levels. Note that in this
7774 case, only the innermost arguments are coerced because the
7775 outermost ones are supposed to have been coerced already.
7777 Otherwise, if PARMS represents only (the innermost) vector of
7778 parameters, this function returns a vector containing just the
7779 innermost resulting arguments. */
7782 coerce_innermost_template_parms (tree parms
,
7785 tsubst_flags_t complain
,
7786 bool require_all_args
,
7787 bool use_default_args
)
7789 int parms_depth
= TMPL_PARMS_DEPTH (parms
);
7790 int args_depth
= TMPL_ARGS_DEPTH (args
);
7793 if (parms_depth
> 1)
7795 coerced_args
= make_tree_vec (parms_depth
);
7799 for (level
= parms
, cur_depth
= parms_depth
;
7800 parms_depth
> 0 && level
!= NULL_TREE
;
7801 level
= TREE_CHAIN (level
), --cur_depth
)
7804 if (cur_depth
== args_depth
)
7805 l
= coerce_template_parms (TREE_VALUE (level
),
7806 args
, in_decl
, complain
,
7810 l
= TMPL_ARGS_LEVEL (args
, cur_depth
);
7812 if (l
== error_mark_node
)
7813 return error_mark_node
;
7815 SET_TMPL_ARGS_LEVEL (coerced_args
, cur_depth
, l
);
7819 coerced_args
= coerce_template_parms (INNERMOST_TEMPLATE_PARMS (parms
),
7820 args
, in_decl
, complain
,
7823 return coerced_args
;
7826 /* Returns 1 if template args OT and NT are equivalent. */
7829 template_args_equal (tree ot
, tree nt
)
7833 if (nt
== NULL_TREE
|| ot
== NULL_TREE
)
7836 if (TREE_CODE (nt
) == TREE_VEC
)
7837 /* For member templates */
7838 return TREE_CODE (ot
) == TREE_VEC
&& comp_template_args (ot
, nt
);
7839 else if (PACK_EXPANSION_P (ot
))
7840 return (PACK_EXPANSION_P (nt
)
7841 && template_args_equal (PACK_EXPANSION_PATTERN (ot
),
7842 PACK_EXPANSION_PATTERN (nt
))
7843 && template_args_equal (PACK_EXPANSION_EXTRA_ARGS (ot
),
7844 PACK_EXPANSION_EXTRA_ARGS (nt
)));
7845 else if (ARGUMENT_PACK_P (ot
))
7850 if (!ARGUMENT_PACK_P (nt
))
7853 opack
= ARGUMENT_PACK_ARGS (ot
);
7854 npack
= ARGUMENT_PACK_ARGS (nt
);
7855 len
= TREE_VEC_LENGTH (opack
);
7856 if (TREE_VEC_LENGTH (npack
) != len
)
7858 for (i
= 0; i
< len
; ++i
)
7859 if (!template_args_equal (TREE_VEC_ELT (opack
, i
),
7860 TREE_VEC_ELT (npack
, i
)))
7864 else if (ot
&& TREE_CODE (ot
) == ARGUMENT_PACK_SELECT
)
7866 /* We get here probably because we are in the middle of substituting
7867 into the pattern of a pack expansion. In that case the
7868 ARGUMENT_PACK_SELECT temporarily replaces the pack argument we are
7869 interested in. So we want to use the initial pack argument for
7871 ot
= ARGUMENT_PACK_SELECT_FROM_PACK (ot
);
7872 if (nt
&& TREE_CODE (nt
) == ARGUMENT_PACK_SELECT
)
7873 nt
= ARGUMENT_PACK_SELECT_FROM_PACK (nt
);
7874 return template_args_equal (ot
, nt
);
7876 else if (TYPE_P (nt
))
7880 /* Don't treat an alias template specialization with dependent
7881 arguments as equivalent to its underlying type when used as a
7882 template argument; we need them to be distinct so that we
7883 substitute into the specialization arguments at instantiation
7884 time. And aliases can't be equivalent without being ==, so
7885 we don't need to look any deeper. */
7886 if (TYPE_ALIAS_P (nt
) || TYPE_ALIAS_P (ot
))
7889 return same_type_p (ot
, nt
);
7891 else if (TREE_CODE (ot
) == TREE_VEC
|| TYPE_P (ot
))
7895 /* Try to treat a template non-type argument that has been converted
7896 to the parameter type as equivalent to one that hasn't yet. */
7897 for (enum tree_code code1
= TREE_CODE (ot
);
7898 CONVERT_EXPR_CODE_P (code1
)
7899 || code1
== NON_LVALUE_EXPR
;
7900 code1
= TREE_CODE (ot
))
7901 ot
= TREE_OPERAND (ot
, 0);
7902 for (enum tree_code code2
= TREE_CODE (nt
);
7903 CONVERT_EXPR_CODE_P (code2
)
7904 || code2
== NON_LVALUE_EXPR
;
7905 code2
= TREE_CODE (nt
))
7906 nt
= TREE_OPERAND (nt
, 0);
7908 return cp_tree_equal (ot
, nt
);
7912 /* Returns 1 iff the OLDARGS and NEWARGS are in fact identical sets of
7913 template arguments. Returns 0 otherwise, and updates OLDARG_PTR and
7914 NEWARG_PTR with the offending arguments if they are non-NULL. */
7917 comp_template_args (tree oldargs
, tree newargs
,
7918 tree
*oldarg_ptr
, tree
*newarg_ptr
)
7922 if (oldargs
== newargs
)
7925 if (!oldargs
|| !newargs
)
7928 if (TREE_VEC_LENGTH (oldargs
) != TREE_VEC_LENGTH (newargs
))
7931 for (i
= 0; i
< TREE_VEC_LENGTH (oldargs
); ++i
)
7933 tree nt
= TREE_VEC_ELT (newargs
, i
);
7934 tree ot
= TREE_VEC_ELT (oldargs
, i
);
7936 if (! template_args_equal (ot
, nt
))
7938 if (oldarg_ptr
!= NULL
)
7940 if (newarg_ptr
!= NULL
)
7949 add_pending_template (tree d
)
7951 tree ti
= (TYPE_P (d
)
7952 ? CLASSTYPE_TEMPLATE_INFO (d
)
7953 : DECL_TEMPLATE_INFO (d
));
7954 struct pending_template
*pt
;
7957 if (TI_PENDING_TEMPLATE_FLAG (ti
))
7960 /* We are called both from instantiate_decl, where we've already had a
7961 tinst_level pushed, and instantiate_template, where we haven't.
7963 level
= !current_tinst_level
|| current_tinst_level
->decl
!= d
;
7966 push_tinst_level (d
);
7968 pt
= ggc_alloc
<pending_template
> ();
7970 pt
->tinst
= current_tinst_level
;
7971 if (last_pending_template
)
7972 last_pending_template
->next
= pt
;
7974 pending_templates
= pt
;
7976 last_pending_template
= pt
;
7978 TI_PENDING_TEMPLATE_FLAG (ti
) = 1;
7985 /* Return a TEMPLATE_ID_EXPR corresponding to the indicated FNS and
7986 ARGLIST. Valid choices for FNS are given in the cp-tree.def
7987 documentation for TEMPLATE_ID_EXPR. */
7990 lookup_template_function (tree fns
, tree arglist
)
7994 if (fns
== error_mark_node
|| arglist
== error_mark_node
)
7995 return error_mark_node
;
7997 gcc_assert (!arglist
|| TREE_CODE (arglist
) == TREE_VEC
);
7999 if (!is_overloaded_fn (fns
) && !identifier_p (fns
))
8001 error ("%q#D is not a function template", fns
);
8002 return error_mark_node
;
8005 if (BASELINK_P (fns
))
8007 BASELINK_FUNCTIONS (fns
) = build2 (TEMPLATE_ID_EXPR
,
8009 BASELINK_FUNCTIONS (fns
),
8014 type
= TREE_TYPE (fns
);
8015 if (TREE_CODE (fns
) == OVERLOAD
|| !type
)
8016 type
= unknown_type_node
;
8018 return build2 (TEMPLATE_ID_EXPR
, type
, fns
, arglist
);
8021 /* Within the scope of a template class S<T>, the name S gets bound
8022 (in build_self_reference) to a TYPE_DECL for the class, not a
8023 TEMPLATE_DECL. If DECL is a TYPE_DECL for current_class_type,
8024 or one of its enclosing classes, and that type is a template,
8025 return the associated TEMPLATE_DECL. Otherwise, the original
8028 Also handle the case when DECL is a TREE_LIST of ambiguous
8029 injected-class-names from different bases. */
8032 maybe_get_template_decl_from_type_decl (tree decl
)
8034 if (decl
== NULL_TREE
)
8037 /* DR 176: A lookup that finds an injected-class-name (10.2
8038 [class.member.lookup]) can result in an ambiguity in certain cases
8039 (for example, if it is found in more than one base class). If all of
8040 the injected-class-names that are found refer to specializations of
8041 the same class template, and if the name is followed by a
8042 template-argument-list, the reference refers to the class template
8043 itself and not a specialization thereof, and is not ambiguous. */
8044 if (TREE_CODE (decl
) == TREE_LIST
)
8046 tree t
, tmpl
= NULL_TREE
;
8047 for (t
= decl
; t
; t
= TREE_CHAIN (t
))
8049 tree elt
= maybe_get_template_decl_from_type_decl (TREE_VALUE (t
));
8052 else if (tmpl
!= elt
)
8055 if (tmpl
&& t
== NULL_TREE
)
8061 return (decl
!= NULL_TREE
8062 && DECL_SELF_REFERENCE_P (decl
)
8063 && CLASSTYPE_TEMPLATE_INFO (TREE_TYPE (decl
)))
8064 ? CLASSTYPE_TI_TEMPLATE (TREE_TYPE (decl
)) : decl
;
8067 /* Given an IDENTIFIER_NODE (or type TEMPLATE_DECL) and a chain of
8068 parameters, find the desired type.
8070 D1 is the PTYPENAME terminal, and ARGLIST is the list of arguments.
8072 IN_DECL, if non-NULL, is the template declaration we are trying to
8075 If ENTERING_SCOPE is nonzero, we are about to enter the scope of
8076 the class we are looking up.
8078 Issue error and warning messages under control of COMPLAIN.
8080 If the template class is really a local class in a template
8081 function, then the FUNCTION_CONTEXT is the function in which it is
8084 ??? Note that this function is currently called *twice* for each
8085 template-id: the first time from the parser, while creating the
8086 incomplete type (finish_template_type), and the second type during the
8087 real instantiation (instantiate_template_class). This is surely something
8088 that we want to avoid. It also causes some problems with argument
8089 coercion (see convert_nontype_argument for more information on this). */
8092 lookup_template_class_1 (tree d1
, tree arglist
, tree in_decl
, tree context
,
8093 int entering_scope
, tsubst_flags_t complain
)
8095 tree templ
= NULL_TREE
, parmlist
;
8102 if (identifier_p (d1
))
8104 tree value
= innermost_non_namespace_value (d1
);
8105 if (value
&& DECL_TEMPLATE_TEMPLATE_PARM_P (value
))
8110 push_decl_namespace (context
);
8111 templ
= lookup_name (d1
);
8112 templ
= maybe_get_template_decl_from_type_decl (templ
);
8114 pop_decl_namespace ();
8117 context
= DECL_CONTEXT (templ
);
8119 else if (TREE_CODE (d1
) == TYPE_DECL
&& MAYBE_CLASS_TYPE_P (TREE_TYPE (d1
)))
8121 tree type
= TREE_TYPE (d1
);
8123 /* If we are declaring a constructor, say A<T>::A<T>, we will get
8124 an implicit typename for the second A. Deal with it. */
8125 if (TREE_CODE (type
) == TYPENAME_TYPE
&& TREE_TYPE (type
))
8126 type
= TREE_TYPE (type
);
8128 if (CLASSTYPE_TEMPLATE_INFO (type
))
8130 templ
= CLASSTYPE_TI_TEMPLATE (type
);
8131 d1
= DECL_NAME (templ
);
8134 else if (TREE_CODE (d1
) == ENUMERAL_TYPE
8135 || (TYPE_P (d1
) && MAYBE_CLASS_TYPE_P (d1
)))
8137 templ
= TYPE_TI_TEMPLATE (d1
);
8138 d1
= DECL_NAME (templ
);
8140 else if (DECL_TYPE_TEMPLATE_P (d1
))
8143 d1
= DECL_NAME (templ
);
8144 context
= DECL_CONTEXT (templ
);
8146 else if (DECL_TEMPLATE_TEMPLATE_PARM_P (d1
))
8149 d1
= DECL_NAME (templ
);
8152 /* Issue an error message if we didn't find a template. */
8155 if (complain
& tf_error
)
8156 error ("%qT is not a template", d1
);
8157 return error_mark_node
;
8160 if (TREE_CODE (templ
) != TEMPLATE_DECL
8161 /* Make sure it's a user visible template, if it was named by
8163 || ((complain
& tf_user
) && !DECL_TEMPLATE_PARM_P (templ
)
8164 && !PRIMARY_TEMPLATE_P (templ
)))
8166 if (complain
& tf_error
)
8168 error ("non-template type %qT used as a template", d1
);
8170 error ("for template declaration %q+D", in_decl
);
8172 return error_mark_node
;
8175 complain
&= ~tf_user
;
8177 /* An alias that just changes the name of a template is equivalent to the
8178 other template, so if any of the arguments are pack expansions, strip
8179 the alias to avoid problems with a pack expansion passed to a non-pack
8180 alias template parameter (DR 1430). */
8181 if (pack_expansion_args_count (INNERMOST_TEMPLATE_ARGS (arglist
)))
8182 templ
= get_underlying_template (templ
);
8184 if (DECL_TEMPLATE_TEMPLATE_PARM_P (templ
))
8186 /* Create a new TEMPLATE_DECL and TEMPLATE_TEMPLATE_PARM node to store
8187 template arguments */
8193 parmlist
= DECL_INNERMOST_TEMPLATE_PARMS (templ
);
8195 /* Consider an example where a template template parameter declared as
8197 template <class T, class U = std::allocator<T> > class TT
8199 The template parameter level of T and U are one level larger than
8200 of TT. To proper process the default argument of U, say when an
8201 instantiation `TT<int>' is seen, we need to build the full
8202 arguments containing {int} as the innermost level. Outer levels,
8203 available when not appearing as default template argument, can be
8204 obtained from the arguments of the enclosing template.
8206 Suppose that TT is later substituted with std::vector. The above
8207 instantiation is `TT<int, std::allocator<T> >' with TT at
8208 level 1, and T at level 2, while the template arguments at level 1
8209 becomes {std::vector} and the inner level 2 is {int}. */
8211 outer
= DECL_CONTEXT (templ
);
8213 outer
= TI_ARGS (get_template_info (DECL_TEMPLATE_RESULT (outer
)));
8214 else if (current_template_parms
)
8216 /* This is an argument of the current template, so we haven't set
8217 DECL_CONTEXT yet. */
8218 tree relevant_template_parms
;
8220 /* Parameter levels that are greater than the level of the given
8221 template template parm are irrelevant. */
8222 relevant_template_parms
= current_template_parms
;
8223 while (TMPL_PARMS_DEPTH (relevant_template_parms
)
8224 != TEMPLATE_TYPE_LEVEL (TREE_TYPE (templ
)))
8225 relevant_template_parms
= TREE_CHAIN (relevant_template_parms
);
8227 outer
= template_parms_to_args (relevant_template_parms
);
8231 arglist
= add_to_template_args (outer
, arglist
);
8233 arglist2
= coerce_template_parms (parmlist
, arglist
, templ
,
8235 /*require_all_args=*/true,
8236 /*use_default_args=*/true);
8237 if (arglist2
== error_mark_node
8238 || (!uses_template_parms (arglist2
)
8239 && check_instantiated_args (templ
, arglist2
, complain
)))
8240 return error_mark_node
;
8242 parm
= bind_template_template_parm (TREE_TYPE (templ
), arglist2
);
8247 tree template_type
= TREE_TYPE (templ
);
8250 tree found
= NULL_TREE
;
8253 int is_dependent_type
;
8254 int use_partial_inst_tmpl
= false;
8256 if (template_type
== error_mark_node
)
8257 /* An error occurred while building the template TEMPL, and a
8258 diagnostic has most certainly been emitted for that
8259 already. Let's propagate that error. */
8260 return error_mark_node
;
8262 gen_tmpl
= most_general_template (templ
);
8263 parmlist
= DECL_TEMPLATE_PARMS (gen_tmpl
);
8264 parm_depth
= TMPL_PARMS_DEPTH (parmlist
);
8265 arg_depth
= TMPL_ARGS_DEPTH (arglist
);
8267 if (arg_depth
== 1 && parm_depth
> 1)
8269 /* We've been given an incomplete set of template arguments.
8272 template <class T> struct S1 {
8273 template <class U> struct S2 {};
8274 template <class U> struct S2<U*> {};
8277 we will be called with an ARGLIST of `U*', but the
8278 TEMPLATE will be `template <class T> template
8279 <class U> struct S1<T>::S2'. We must fill in the missing
8282 = add_outermost_template_args (TYPE_TI_ARGS (TREE_TYPE (templ
)),
8284 arg_depth
= TMPL_ARGS_DEPTH (arglist
);
8287 /* Now we should have enough arguments. */
8288 gcc_assert (parm_depth
== arg_depth
);
8290 /* From here on, we're only interested in the most general
8293 /* Calculate the BOUND_ARGS. These will be the args that are
8294 actually tsubst'd into the definition to create the
8296 arglist
= coerce_innermost_template_parms (parmlist
, arglist
, gen_tmpl
,
8298 /*require_all_args=*/true,
8299 /*use_default_args=*/true);
8301 if (arglist
== error_mark_node
)
8302 /* We were unable to bind the arguments. */
8303 return error_mark_node
;
8305 /* In the scope of a template class, explicit references to the
8306 template class refer to the type of the template, not any
8307 instantiation of it. For example, in:
8309 template <class T> class C { void f(C<T>); }
8311 the `C<T>' is just the same as `C'. Outside of the
8312 class, however, such a reference is an instantiation. */
8314 || !PRIMARY_TEMPLATE_P (gen_tmpl
)
8315 || currently_open_class (template_type
))
8316 /* comp_template_args is expensive, check it last. */
8317 && comp_template_args (TYPE_TI_ARGS (template_type
),
8319 return template_type
;
8321 /* If we already have this specialization, return it. */
8322 elt
.tmpl
= gen_tmpl
;
8324 elt
.spec
= NULL_TREE
;
8325 hash
= spec_hasher::hash (&elt
);
8326 entry
= type_specializations
->find_with_hash (&elt
, hash
);
8331 /* If the the template's constraints are not satisfied,
8332 then we cannot form a valid type.
8334 Note that the check is deferred until after the hash
8335 lookup. This prevents redundant checks on previously
8336 instantiated specializations. */
8337 if (flag_concepts
&& !constraints_satisfied_p (gen_tmpl
, arglist
))
8339 if (complain
& tf_error
)
8341 error ("template constraint failure");
8342 diagnose_constraints (input_location
, gen_tmpl
, arglist
);
8344 return error_mark_node
;
8347 is_dependent_type
= uses_template_parms (arglist
);
8349 /* If the deduced arguments are invalid, then the binding
8351 if (!is_dependent_type
8352 && check_instantiated_args (gen_tmpl
,
8353 INNERMOST_TEMPLATE_ARGS (arglist
),
8355 return error_mark_node
;
8357 if (!is_dependent_type
8358 && !PRIMARY_TEMPLATE_P (gen_tmpl
)
8359 && !LAMBDA_TYPE_P (TREE_TYPE (gen_tmpl
))
8360 && TREE_CODE (CP_DECL_CONTEXT (gen_tmpl
)) == NAMESPACE_DECL
)
8362 found
= xref_tag_from_type (TREE_TYPE (gen_tmpl
),
8363 DECL_NAME (gen_tmpl
),
8364 /*tag_scope=*/ts_global
);
8368 context
= tsubst (DECL_CONTEXT (gen_tmpl
), arglist
,
8370 if (context
== error_mark_node
)
8371 return error_mark_node
;
8374 context
= global_namespace
;
8376 /* Create the type. */
8377 if (DECL_ALIAS_TEMPLATE_P (gen_tmpl
))
8379 /* The user referred to a specialization of an alias
8380 template represented by GEN_TMPL.
8382 [temp.alias]/2 says:
8384 When a template-id refers to the specialization of an
8385 alias template, it is equivalent to the associated
8386 type obtained by substitution of its
8387 template-arguments for the template-parameters in the
8388 type-id of the alias template. */
8390 t
= tsubst (TREE_TYPE (gen_tmpl
), arglist
, complain
, in_decl
);
8391 /* Note that the call above (by indirectly calling
8392 register_specialization in tsubst_decl) registers the
8393 TYPE_DECL representing the specialization of the alias
8394 template. So next time someone substitutes ARGLIST for
8395 the template parms into the alias template (GEN_TMPL),
8396 she'll get that TYPE_DECL back. */
8398 if (t
== error_mark_node
)
8401 else if (TREE_CODE (template_type
) == ENUMERAL_TYPE
)
8403 if (!is_dependent_type
)
8405 set_current_access_from_decl (TYPE_NAME (template_type
));
8406 t
= start_enum (TYPE_IDENTIFIER (template_type
), NULL_TREE
,
8407 tsubst (ENUM_UNDERLYING_TYPE (template_type
),
8408 arglist
, complain
, in_decl
),
8409 tsubst_attributes (TYPE_ATTRIBUTES (template_type
),
8410 arglist
, complain
, in_decl
),
8411 SCOPED_ENUM_P (template_type
), NULL
);
8413 if (t
== error_mark_node
)
8418 /* We don't want to call start_enum for this type, since
8419 the values for the enumeration constants may involve
8420 template parameters. And, no one should be interested
8421 in the enumeration constants for such a type. */
8422 t
= cxx_make_type (ENUMERAL_TYPE
);
8423 SET_SCOPED_ENUM_P (t
, SCOPED_ENUM_P (template_type
));
8425 SET_OPAQUE_ENUM_P (t
, OPAQUE_ENUM_P (template_type
));
8426 ENUM_FIXED_UNDERLYING_TYPE_P (t
)
8427 = ENUM_FIXED_UNDERLYING_TYPE_P (template_type
);
8429 else if (CLASS_TYPE_P (template_type
))
8431 t
= make_class_type (TREE_CODE (template_type
));
8432 CLASSTYPE_DECLARED_CLASS (t
)
8433 = CLASSTYPE_DECLARED_CLASS (template_type
);
8434 SET_CLASSTYPE_IMPLICIT_INSTANTIATION (t
);
8435 TYPE_FOR_JAVA (t
) = TYPE_FOR_JAVA (template_type
);
8437 /* A local class. Make sure the decl gets registered properly. */
8438 if (context
== current_function_decl
)
8439 pushtag (DECL_NAME (gen_tmpl
), t
, /*tag_scope=*/ts_current
);
8441 if (comp_template_args (CLASSTYPE_TI_ARGS (template_type
), arglist
))
8442 /* This instantiation is another name for the primary
8443 template type. Set the TYPE_CANONICAL field
8445 TYPE_CANONICAL (t
) = template_type
;
8446 else if (any_template_arguments_need_structural_equality_p (arglist
))
8447 /* Some of the template arguments require structural
8448 equality testing, so this template class requires
8449 structural equality testing. */
8450 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8455 /* If we called start_enum or pushtag above, this information
8456 will already be set up. */
8459 TYPE_CONTEXT (t
) = FROB_CONTEXT (context
);
8461 type_decl
= create_implicit_typedef (DECL_NAME (gen_tmpl
), t
);
8462 DECL_CONTEXT (type_decl
) = TYPE_CONTEXT (t
);
8463 DECL_SOURCE_LOCATION (type_decl
)
8464 = DECL_SOURCE_LOCATION (TYPE_STUB_DECL (template_type
));
8467 type_decl
= TYPE_NAME (t
);
8469 if (CLASS_TYPE_P (template_type
))
8471 TREE_PRIVATE (type_decl
)
8472 = TREE_PRIVATE (TYPE_MAIN_DECL (template_type
));
8473 TREE_PROTECTED (type_decl
)
8474 = TREE_PROTECTED (TYPE_MAIN_DECL (template_type
));
8475 if (CLASSTYPE_VISIBILITY_SPECIFIED (template_type
))
8477 DECL_VISIBILITY_SPECIFIED (type_decl
) = 1;
8478 DECL_VISIBILITY (type_decl
) = CLASSTYPE_VISIBILITY (template_type
);
8482 if (OVERLOAD_TYPE_P (t
)
8483 && !DECL_ALIAS_TEMPLATE_P (gen_tmpl
))
8485 static const char *tags
[] = {"abi_tag", "may_alias"};
8487 for (unsigned ix
= 0; ix
!= 2; ix
++)
8490 = lookup_attribute (tags
[ix
], TYPE_ATTRIBUTES (template_type
));
8494 = tree_cons (TREE_PURPOSE (attributes
),
8495 TREE_VALUE (attributes
),
8496 TYPE_ATTRIBUTES (t
));
8500 /* Let's consider the explicit specialization of a member
8501 of a class template specialization that is implicitly instantiated,
8506 template<class U> struct M {}; //#0
8511 struct S<int>::M<char> //#1
8515 [temp.expl.spec]/4 says this is valid.
8517 In this case, when we write:
8520 M is instantiated from the CLASSTYPE_TI_TEMPLATE of #1, not from
8523 When we encounter #1, we want to store the partial instantiation
8524 of M (template<class T> S<int>::M<T>) in its CLASSTYPE_TI_TEMPLATE.
8526 For all cases other than this "explicit specialization of member of a
8527 class template", we just want to store the most general template into
8528 the CLASSTYPE_TI_TEMPLATE of M.
8530 This case of "explicit specialization of member of a class template"
8532 1/ the enclosing class is an instantiation of, and therefore not
8533 the same as, the context of the most general template, and
8534 2/ we aren't looking at the partial instantiation itself, i.e.
8535 the innermost arguments are not the same as the innermost parms of
8536 the most general template.
8538 So it's only when 1/ and 2/ happens that we want to use the partial
8539 instantiation of the member template in lieu of its most general
8542 if (PRIMARY_TEMPLATE_P (gen_tmpl
)
8543 && TMPL_ARGS_HAVE_MULTIPLE_LEVELS (arglist
)
8544 /* the enclosing class must be an instantiation... */
8545 && CLASS_TYPE_P (context
)
8546 && !same_type_p (context
, DECL_CONTEXT (gen_tmpl
)))
8548 tree partial_inst_args
;
8549 TREE_VEC_LENGTH (arglist
)--;
8550 ++processing_template_decl
;
8552 tsubst (INNERMOST_TEMPLATE_ARGS
8553 (TYPE_TI_ARGS (TREE_TYPE (gen_tmpl
))),
8554 arglist
, complain
, NULL_TREE
);
8555 --processing_template_decl
;
8556 TREE_VEC_LENGTH (arglist
)++;
8557 if (partial_inst_args
== error_mark_node
)
8558 return error_mark_node
;
8559 use_partial_inst_tmpl
=
8560 /*...and we must not be looking at the partial instantiation
8562 !comp_template_args (INNERMOST_TEMPLATE_ARGS (arglist
),
8566 if (!use_partial_inst_tmpl
)
8567 /* This case is easy; there are no member templates involved. */
8571 /* This is a full instantiation of a member template. Find
8572 the partial instantiation of which this is an instance. */
8574 /* Temporarily reduce by one the number of levels in the ARGLIST
8575 so as to avoid comparing the last set of arguments. */
8576 TREE_VEC_LENGTH (arglist
)--;
8577 found
= tsubst (gen_tmpl
, arglist
, complain
, NULL_TREE
);
8578 TREE_VEC_LENGTH (arglist
)++;
8579 /* FOUND is either a proper class type, or an alias
8580 template specialization. In the later case, it's a
8581 TYPE_DECL, resulting from the substituting of arguments
8582 for parameters in the TYPE_DECL of the alias template
8583 done earlier. So be careful while getting the template
8585 found
= TREE_CODE (found
) == TYPE_DECL
8586 ? TYPE_TI_TEMPLATE (TREE_TYPE (found
))
8587 : CLASSTYPE_TI_TEMPLATE (found
);
8590 // Build template info for the new specialization.
8591 SET_TYPE_TEMPLATE_INFO (t
, build_template_info (found
, arglist
));
8594 slot
= type_specializations
->find_slot_with_hash (&elt
, hash
, INSERT
);
8595 entry
= ggc_alloc
<spec_entry
> ();
8599 /* Note this use of the partial instantiation so we can check it
8600 later in maybe_process_partial_specialization. */
8601 DECL_TEMPLATE_INSTANTIATIONS (found
)
8602 = tree_cons (arglist
, t
,
8603 DECL_TEMPLATE_INSTANTIATIONS (found
));
8605 if (TREE_CODE (template_type
) == ENUMERAL_TYPE
&& !is_dependent_type
8606 && !DECL_ALIAS_TEMPLATE_P (gen_tmpl
))
8607 /* Now that the type has been registered on the instantiations
8608 list, we set up the enumerators. Because the enumeration
8609 constants may involve the enumeration type itself, we make
8610 sure to register the type first, and then create the
8611 constants. That way, doing tsubst_expr for the enumeration
8612 constants won't result in recursive calls here; we'll find
8613 the instantiation and exit above. */
8614 tsubst_enum (template_type
, t
, arglist
);
8616 if (CLASS_TYPE_P (template_type
) && is_dependent_type
)
8617 /* If the type makes use of template parameters, the
8618 code that generates debugging information will crash. */
8619 DECL_IGNORED_P (TYPE_MAIN_DECL (t
)) = 1;
8621 /* Possibly limit visibility based on template args. */
8622 TREE_PUBLIC (type_decl
) = 1;
8623 determine_visibility (type_decl
);
8625 inherit_targ_abi_tags (t
);
8631 /* Wrapper for lookup_template_class_1. */
8634 lookup_template_class (tree d1
, tree arglist
, tree in_decl
, tree context
,
8635 int entering_scope
, tsubst_flags_t complain
)
8638 timevar_push (TV_TEMPLATE_INST
);
8639 ret
= lookup_template_class_1 (d1
, arglist
, in_decl
, context
,
8640 entering_scope
, complain
);
8641 timevar_pop (TV_TEMPLATE_INST
);
8645 /* Return a TEMPLATE_ID_EXPR for the given variable template and ARGLIST. */
8648 lookup_template_variable (tree templ
, tree arglist
)
8650 /* The type of the expression is NULL_TREE since the template-id could refer
8651 to an explicit or partial specialization. */
8652 tree type
= NULL_TREE
;
8653 if (flag_concepts
&& variable_concept_p (templ
))
8654 /* Except that concepts are always bool. */
8655 type
= boolean_type_node
;
8656 return build2 (TEMPLATE_ID_EXPR
, type
, templ
, arglist
);
8659 /* Instantiate a variable declaration from a TEMPLATE_ID_EXPR for use. */
8662 finish_template_variable (tree var
, tsubst_flags_t complain
)
8664 tree templ
= TREE_OPERAND (var
, 0);
8665 tree arglist
= TREE_OPERAND (var
, 1);
8667 /* We never want to return a VAR_DECL for a variable concept, since they
8668 aren't instantiated. In a template, leave the TEMPLATE_ID_EXPR alone. */
8669 bool concept_p
= flag_concepts
&& variable_concept_p (templ
);
8670 if (concept_p
&& processing_template_decl
)
8673 tree tmpl_args
= DECL_TI_ARGS (DECL_TEMPLATE_RESULT (templ
));
8674 arglist
= add_outermost_template_args (tmpl_args
, arglist
);
8676 tree parms
= DECL_TEMPLATE_PARMS (templ
);
8677 arglist
= coerce_innermost_template_parms (parms
, arglist
, templ
, complain
,
8679 /*use_default*/true);
8681 if (flag_concepts
&& !constraints_satisfied_p (templ
, arglist
))
8683 if (complain
& tf_error
)
8685 error ("constraints for %qD not satisfied", templ
);
8686 diagnose_constraints (location_of (var
), templ
, arglist
);
8688 return error_mark_node
;
8691 /* If a template-id refers to a specialization of a variable
8692 concept, then the expression is true if and only if the
8693 concept's constraints are satisfied by the given template
8696 NOTE: This is an extension of Concepts Lite TS that
8697 allows constraints to be used in expressions. */
8700 tree decl
= DECL_TEMPLATE_RESULT (templ
);
8701 return evaluate_variable_concept (decl
, arglist
);
8704 return instantiate_template (templ
, arglist
, complain
);
8707 /* Construct a TEMPLATE_ID_EXPR for the given variable template TEMPL having
8708 TARGS template args, and instantiate it if it's not dependent. */
8711 lookup_and_finish_template_variable (tree templ
, tree targs
,
8712 tsubst_flags_t complain
)
8714 templ
= lookup_template_variable (templ
, targs
);
8715 if (!any_dependent_template_arguments_p (targs
))
8717 templ
= finish_template_variable (templ
, complain
);
8721 return convert_from_reference (templ
);
8729 /* True when we should also visit template parameters that occur in
8730 non-deduced contexts. */
8731 bool include_nondeduced_p
;
8732 hash_set
<tree
> *visited
;
8735 /* Called from for_each_template_parm via walk_tree. */
8738 for_each_template_parm_r (tree
*tp
, int *walk_subtrees
, void *d
)
8741 struct pair_fn_data
*pfd
= (struct pair_fn_data
*) d
;
8742 tree_fn_t fn
= pfd
->fn
;
8743 void *data
= pfd
->data
;
8744 tree result
= NULL_TREE
;
8746 #define WALK_SUBTREE(NODE) \
8749 result = for_each_template_parm (NODE, fn, data, pfd->visited, \
8750 pfd->include_nondeduced_p); \
8751 if (result) goto out; \
8756 && (pfd
->include_nondeduced_p
|| TREE_CODE (t
) != TYPENAME_TYPE
))
8757 WALK_SUBTREE (TYPE_CONTEXT (t
));
8759 switch (TREE_CODE (t
))
8762 if (TYPE_PTRMEMFUNC_P (t
))
8768 if (!TYPE_TEMPLATE_INFO (t
))
8771 WALK_SUBTREE (TYPE_TI_ARGS (t
));
8775 WALK_SUBTREE (TYPE_MIN_VALUE (t
));
8776 WALK_SUBTREE (TYPE_MAX_VALUE (t
));
8780 /* Since we're not going to walk subtrees, we have to do this
8782 WALK_SUBTREE (TYPE_METHOD_BASETYPE (t
));
8786 /* Check the return type. */
8787 WALK_SUBTREE (TREE_TYPE (t
));
8789 /* Check the parameter types. Since default arguments are not
8790 instantiated until they are needed, the TYPE_ARG_TYPES may
8791 contain expressions that involve template parameters. But,
8792 no-one should be looking at them yet. And, once they're
8793 instantiated, they don't contain template parameters, so
8794 there's no point in looking at them then, either. */
8798 for (parm
= TYPE_ARG_TYPES (t
); parm
; parm
= TREE_CHAIN (parm
))
8799 WALK_SUBTREE (TREE_VALUE (parm
));
8801 /* Since we've already handled the TYPE_ARG_TYPES, we don't
8802 want walk_tree walking into them itself. */
8808 case UNDERLYING_TYPE
:
8809 if (pfd
->include_nondeduced_p
8810 && for_each_template_parm (TYPE_VALUES_RAW (t
), fn
, data
,
8812 pfd
->include_nondeduced_p
))
8813 return error_mark_node
;
8818 if (DECL_LANG_SPECIFIC (t
) && DECL_TEMPLATE_INFO (t
))
8819 WALK_SUBTREE (DECL_TI_ARGS (t
));
8824 if (TREE_CODE (t
) == CONST_DECL
&& DECL_TEMPLATE_PARM_P (t
))
8825 WALK_SUBTREE (DECL_INITIAL (t
));
8826 if (DECL_CONTEXT (t
)
8827 && pfd
->include_nondeduced_p
)
8828 WALK_SUBTREE (DECL_CONTEXT (t
));
8831 case BOUND_TEMPLATE_TEMPLATE_PARM
:
8832 /* Record template parameters such as `T' inside `TT<T>'. */
8833 WALK_SUBTREE (TYPE_TI_ARGS (t
));
8836 case TEMPLATE_TEMPLATE_PARM
:
8837 case TEMPLATE_TYPE_PARM
:
8838 case TEMPLATE_PARM_INDEX
:
8839 if (fn
&& (*fn
)(t
, data
))
8846 /* A template template parameter is encountered. */
8847 if (DECL_TEMPLATE_TEMPLATE_PARM_P (t
))
8848 WALK_SUBTREE (TREE_TYPE (t
));
8850 /* Already substituted template template parameter */
8855 /* A template-id in a TYPENAME_TYPE might be a deduced context after
8856 partial instantiation. */
8857 WALK_SUBTREE (TYPENAME_TYPE_FULLNAME (t
));
8861 if (TREE_TYPE (t
) && TYPE_PTRMEMFUNC_P (TREE_TYPE (t
))
8862 && pfd
->include_nondeduced_p
)
8863 WALK_SUBTREE (TYPE_PTRMEMFUNC_FN_TYPE (TREE_TYPE (t
)));
8868 /* If there's no type, then this thing must be some expression
8869 involving template parameters. */
8870 if (!fn
&& !TREE_TYPE (t
))
8871 return error_mark_node
;
8876 case IMPLICIT_CONV_EXPR
:
8877 case REINTERPRET_CAST_EXPR
:
8878 case CONST_CAST_EXPR
:
8879 case STATIC_CAST_EXPR
:
8880 case DYNAMIC_CAST_EXPR
:
8884 case PSEUDO_DTOR_EXPR
:
8886 return error_mark_node
;
8895 /* We didn't find any template parameters we liked. */
8900 /* For each TEMPLATE_TYPE_PARM, TEMPLATE_TEMPLATE_PARM,
8901 BOUND_TEMPLATE_TEMPLATE_PARM or TEMPLATE_PARM_INDEX in T,
8902 call FN with the parameter and the DATA.
8903 If FN returns nonzero, the iteration is terminated, and
8904 for_each_template_parm returns 1. Otherwise, the iteration
8905 continues. If FN never returns a nonzero value, the value
8906 returned by for_each_template_parm is 0. If FN is NULL, it is
8907 considered to be the function which always returns 1.
8909 If INCLUDE_NONDEDUCED_P, then this routine will also visit template
8910 parameters that occur in non-deduced contexts. When false, only
8911 visits those template parameters that can be deduced. */
8914 for_each_template_parm (tree t
, tree_fn_t fn
, void* data
,
8915 hash_set
<tree
> *visited
,
8916 bool include_nondeduced_p
)
8918 struct pair_fn_data pfd
;
8924 pfd
.include_nondeduced_p
= include_nondeduced_p
;
8926 /* Walk the tree. (Conceptually, we would like to walk without
8927 duplicates, but for_each_template_parm_r recursively calls
8928 for_each_template_parm, so we would need to reorganize a fair
8929 bit to use walk_tree_without_duplicates, so we keep our own
8932 pfd
.visited
= visited
;
8934 pfd
.visited
= new hash_set
<tree
>;
8935 result
= cp_walk_tree (&t
,
8936 for_each_template_parm_r
,
8950 /* Returns true if T depends on any template parameter. */
8953 uses_template_parms (tree t
)
8959 int saved_processing_template_decl
;
8961 saved_processing_template_decl
= processing_template_decl
;
8962 if (!saved_processing_template_decl
)
8963 processing_template_decl
= 1;
8965 dependent_p
= dependent_type_p (t
);
8966 else if (TREE_CODE (t
) == TREE_VEC
)
8967 dependent_p
= any_dependent_template_arguments_p (t
);
8968 else if (TREE_CODE (t
) == TREE_LIST
)
8969 dependent_p
= (uses_template_parms (TREE_VALUE (t
))
8970 || uses_template_parms (TREE_CHAIN (t
)));
8971 else if (TREE_CODE (t
) == TYPE_DECL
)
8972 dependent_p
= dependent_type_p (TREE_TYPE (t
));
8975 || TREE_CODE (t
) == TEMPLATE_PARM_INDEX
8976 || TREE_CODE (t
) == OVERLOAD
8979 || TREE_CODE (t
) == TRAIT_EXPR
8980 || TREE_CODE (t
) == CONSTRUCTOR
8981 || CONSTANT_CLASS_P (t
))
8982 dependent_p
= (type_dependent_expression_p (t
)
8983 || value_dependent_expression_p (t
));
8986 gcc_assert (t
== error_mark_node
);
8987 dependent_p
= false;
8990 processing_template_decl
= saved_processing_template_decl
;
8995 /* Returns true iff current_function_decl is an incompletely instantiated
8996 template. Useful instead of processing_template_decl because the latter
8997 is set to 0 during instantiate_non_dependent_expr. */
9000 in_template_function (void)
9002 tree fn
= current_function_decl
;
9004 ++processing_template_decl
;
9005 ret
= (fn
&& DECL_LANG_SPECIFIC (fn
)
9006 && DECL_TEMPLATE_INFO (fn
)
9007 && any_dependent_template_arguments_p (DECL_TI_ARGS (fn
)));
9008 --processing_template_decl
;
9012 /* Returns true if T depends on any template parameter with level LEVEL. */
9015 uses_template_parms_level (tree t
, int level
)
9017 return for_each_template_parm (t
, template_parm_this_level_p
, &level
, NULL
,
9018 /*include_nondeduced_p=*/true);
9021 /* Returns TRUE iff INST is an instantiation we don't need to do in an
9022 ill-formed translation unit, i.e. a variable or function that isn't
9023 usable in a constant expression. */
9026 neglectable_inst_p (tree d
)
9029 && !(TREE_CODE (d
) == FUNCTION_DECL
? DECL_DECLARED_CONSTEXPR_P (d
)
9030 : decl_maybe_constant_var_p (d
)));
9033 /* Returns TRUE iff we should refuse to instantiate DECL because it's
9034 neglectable and instantiated from within an erroneous instantiation. */
9037 limit_bad_template_recursion (tree decl
)
9039 struct tinst_level
*lev
= current_tinst_level
;
9040 int errs
= errorcount
+ sorrycount
;
9041 if (lev
== NULL
|| errs
== 0 || !neglectable_inst_p (decl
))
9044 for (; lev
; lev
= lev
->next
)
9045 if (neglectable_inst_p (lev
->decl
))
9048 return (lev
&& errs
> lev
->errors
);
9051 static int tinst_depth
;
9052 extern int max_tinst_depth
;
9055 static GTY(()) struct tinst_level
*last_error_tinst_level
;
9057 /* We're starting to instantiate D; record the template instantiation context
9058 for diagnostics and to restore it later. */
9061 push_tinst_level (tree d
)
9063 return push_tinst_level_loc (d
, input_location
);
9066 /* We're starting to instantiate D; record the template instantiation context
9067 at LOC for diagnostics and to restore it later. */
9070 push_tinst_level_loc (tree d
, location_t loc
)
9072 struct tinst_level
*new_level
;
9074 if (tinst_depth
>= max_tinst_depth
)
9076 fatal_error (input_location
,
9077 "template instantiation depth exceeds maximum of %d"
9078 " (use -ftemplate-depth= to increase the maximum)",
9083 /* If the current instantiation caused problems, don't let it instantiate
9084 anything else. Do allow deduction substitution and decls usable in
9085 constant expressions. */
9086 if (limit_bad_template_recursion (d
))
9089 new_level
= ggc_alloc
<tinst_level
> ();
9090 new_level
->decl
= d
;
9091 new_level
->locus
= loc
;
9092 new_level
->errors
= errorcount
+sorrycount
;
9093 new_level
->in_system_header_p
= in_system_header_at (input_location
);
9094 new_level
->next
= current_tinst_level
;
9095 current_tinst_level
= new_level
;
9098 if (GATHER_STATISTICS
&& (tinst_depth
> depth_reached
))
9099 depth_reached
= tinst_depth
;
9104 /* We're done instantiating this template; return to the instantiation
9108 pop_tinst_level (void)
9110 /* Restore the filename and line number stashed away when we started
9111 this instantiation. */
9112 input_location
= current_tinst_level
->locus
;
9113 current_tinst_level
= current_tinst_level
->next
;
9117 /* We're instantiating a deferred template; restore the template
9118 instantiation context in which the instantiation was requested, which
9119 is one step out from LEVEL. Return the corresponding DECL or TYPE. */
9122 reopen_tinst_level (struct tinst_level
*level
)
9124 struct tinst_level
*t
;
9127 for (t
= level
; t
; t
= t
->next
)
9130 current_tinst_level
= level
;
9132 if (current_tinst_level
)
9133 current_tinst_level
->errors
= errorcount
+sorrycount
;
9137 /* Returns the TINST_LEVEL which gives the original instantiation
9140 struct tinst_level
*
9141 outermost_tinst_level (void)
9143 struct tinst_level
*level
= current_tinst_level
;
9146 level
= level
->next
;
9150 /* DECL is a friend FUNCTION_DECL or TEMPLATE_DECL. ARGS is the
9151 vector of template arguments, as for tsubst.
9153 Returns an appropriate tsubst'd friend declaration. */
9156 tsubst_friend_function (tree decl
, tree args
)
9160 if (TREE_CODE (decl
) == FUNCTION_DECL
9161 && DECL_TEMPLATE_INSTANTIATION (decl
)
9162 && TREE_CODE (DECL_TI_TEMPLATE (decl
)) != TEMPLATE_DECL
)
9163 /* This was a friend declared with an explicit template
9164 argument list, e.g.:
9168 to indicate that f was a template instantiation, not a new
9169 function declaration. Now, we have to figure out what
9170 instantiation of what template. */
9172 tree template_id
, arglist
, fns
;
9175 tree ns
= decl_namespace_context (TYPE_MAIN_DECL (current_class_type
));
9177 /* Friend functions are looked up in the containing namespace scope.
9178 We must enter that scope, to avoid finding member functions of the
9179 current class with same name. */
9180 push_nested_namespace (ns
);
9181 fns
= tsubst_expr (DECL_TI_TEMPLATE (decl
), args
,
9182 tf_warning_or_error
, NULL_TREE
,
9183 /*integral_constant_expression_p=*/false);
9184 pop_nested_namespace (ns
);
9185 arglist
= tsubst (DECL_TI_ARGS (decl
), args
,
9186 tf_warning_or_error
, NULL_TREE
);
9187 template_id
= lookup_template_function (fns
, arglist
);
9189 new_friend
= tsubst (decl
, args
, tf_warning_or_error
, NULL_TREE
);
9190 tmpl
= determine_specialization (template_id
, new_friend
,
9192 /*need_member_template=*/0,
9193 TREE_VEC_LENGTH (args
),
9195 return instantiate_template (tmpl
, new_args
, tf_error
);
9198 new_friend
= tsubst (decl
, args
, tf_warning_or_error
, NULL_TREE
);
9200 /* The NEW_FRIEND will look like an instantiation, to the
9201 compiler, but is not an instantiation from the point of view of
9202 the language. For example, we might have had:
9204 template <class T> struct S {
9205 template <class U> friend void f(T, U);
9208 Then, in S<int>, template <class U> void f(int, U) is not an
9209 instantiation of anything. */
9210 if (new_friend
== error_mark_node
)
9211 return error_mark_node
;
9213 DECL_USE_TEMPLATE (new_friend
) = 0;
9214 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
9216 DECL_USE_TEMPLATE (DECL_TEMPLATE_RESULT (new_friend
)) = 0;
9217 DECL_SAVED_TREE (DECL_TEMPLATE_RESULT (new_friend
))
9218 = DECL_SAVED_TREE (DECL_TEMPLATE_RESULT (decl
));
9221 /* The mangled name for the NEW_FRIEND is incorrect. The function
9222 is not a template instantiation and should not be mangled like
9223 one. Therefore, we forget the mangling here; we'll recompute it
9224 later if we need it. */
9225 if (TREE_CODE (new_friend
) != TEMPLATE_DECL
)
9227 SET_DECL_RTL (new_friend
, NULL
);
9228 SET_DECL_ASSEMBLER_NAME (new_friend
, NULL_TREE
);
9231 if (DECL_NAMESPACE_SCOPE_P (new_friend
))
9234 tree new_friend_template_info
;
9235 tree new_friend_result_template_info
;
9237 int new_friend_is_defn
;
9239 /* We must save some information from NEW_FRIEND before calling
9240 duplicate decls since that function will free NEW_FRIEND if
9242 new_friend_template_info
= DECL_TEMPLATE_INFO (new_friend
);
9243 new_friend_is_defn
=
9244 (DECL_INITIAL (DECL_TEMPLATE_RESULT
9245 (template_for_substitution (new_friend
)))
9247 if (TREE_CODE (new_friend
) == TEMPLATE_DECL
)
9249 /* This declaration is a `primary' template. */
9250 DECL_PRIMARY_TEMPLATE (new_friend
) = new_friend
;
9252 new_friend_result_template_info
9253 = DECL_TEMPLATE_INFO (DECL_TEMPLATE_RESULT (new_friend
));
9256 new_friend_result_template_info
= NULL_TREE
;
9258 /* Make the init_value nonzero so pushdecl knows this is a defn. */
9259 if (new_friend_is_defn
)
9260 DECL_INITIAL (new_friend
) = error_mark_node
;
9262 /* Inside pushdecl_namespace_level, we will push into the
9263 current namespace. However, the friend function should go
9264 into the namespace of the template. */
9265 ns
= decl_namespace_context (new_friend
);
9266 push_nested_namespace (ns
);
9267 old_decl
= pushdecl_namespace_level (new_friend
, /*is_friend=*/true);
9268 pop_nested_namespace (ns
);
9270 if (old_decl
== error_mark_node
)
9271 return error_mark_node
;
9273 if (old_decl
!= new_friend
)
9275 /* This new friend declaration matched an existing
9276 declaration. For example, given:
9278 template <class T> void f(T);
9279 template <class U> class C {
9280 template <class T> friend void f(T) {}
9283 the friend declaration actually provides the definition
9284 of `f', once C has been instantiated for some type. So,
9285 old_decl will be the out-of-class template declaration,
9286 while new_friend is the in-class definition.
9288 But, if `f' was called before this point, the
9289 instantiation of `f' will have DECL_TI_ARGS corresponding
9290 to `T' but not to `U', references to which might appear
9291 in the definition of `f'. Previously, the most general
9292 template for an instantiation of `f' was the out-of-class
9293 version; now it is the in-class version. Therefore, we
9294 run through all specialization of `f', adding to their
9295 DECL_TI_ARGS appropriately. In particular, they need a
9296 new set of outer arguments, corresponding to the
9297 arguments for this class instantiation.
9299 The same situation can arise with something like this:
9302 template <class T> class C {
9306 when `C<int>' is instantiated. Now, `f(int)' is defined
9309 if (!new_friend_is_defn
)
9310 /* On the other hand, if the in-class declaration does
9311 *not* provide a definition, then we don't want to alter
9312 existing definitions. We can just leave everything
9317 tree new_template
= TI_TEMPLATE (new_friend_template_info
);
9318 tree new_args
= TI_ARGS (new_friend_template_info
);
9320 /* Overwrite whatever template info was there before, if
9321 any, with the new template information pertaining to
9323 DECL_TEMPLATE_INFO (old_decl
) = new_friend_template_info
;
9325 if (TREE_CODE (old_decl
) != TEMPLATE_DECL
)
9327 /* We should have called reregister_specialization in
9329 gcc_assert (retrieve_specialization (new_template
,
9333 /* Instantiate it if the global has already been used. */
9334 if (DECL_ODR_USED (old_decl
))
9335 instantiate_decl (old_decl
, /*defer_ok=*/true,
9336 /*expl_inst_class_mem_p=*/false);
9342 /* Indicate that the old function template is a partial
9344 DECL_TEMPLATE_INFO (DECL_TEMPLATE_RESULT (old_decl
))
9345 = new_friend_result_template_info
;
9347 gcc_assert (new_template
9348 == most_general_template (new_template
));
9349 gcc_assert (new_template
!= old_decl
);
9351 /* Reassign any specializations already in the hash table
9352 to the new more general template, and add the
9353 additional template args. */
9354 for (t
= DECL_TEMPLATE_INSTANTIATIONS (old_decl
);
9358 tree spec
= TREE_VALUE (t
);
9361 elt
.tmpl
= old_decl
;
9362 elt
.args
= DECL_TI_ARGS (spec
);
9363 elt
.spec
= NULL_TREE
;
9365 decl_specializations
->remove_elt (&elt
);
9368 = add_outermost_template_args (new_args
,
9369 DECL_TI_ARGS (spec
));
9371 register_specialization
9372 (spec
, new_template
, DECL_TI_ARGS (spec
), true, 0);
9375 DECL_TEMPLATE_INSTANTIATIONS (old_decl
) = NULL_TREE
;
9379 /* The information from NEW_FRIEND has been merged into OLD_DECL
9380 by duplicate_decls. */
9381 new_friend
= old_decl
;
9386 tree context
= DECL_CONTEXT (new_friend
);
9390 template <class T> class C {
9391 template <class U> friend void C1<U>::f (); // case 1
9392 friend void C2<T>::f (); // case 2
9394 we only need to make sure CONTEXT is a complete type for
9395 case 2. To distinguish between the two cases, we note that
9396 CONTEXT of case 1 remains dependent type after tsubst while
9397 this isn't true for case 2. */
9398 ++processing_template_decl
;
9399 dependent_p
= dependent_type_p (context
);
9400 --processing_template_decl
;
9403 && !complete_type_or_else (context
, NULL_TREE
))
9404 return error_mark_node
;
9406 if (COMPLETE_TYPE_P (context
))
9408 tree fn
= new_friend
;
9409 /* do_friend adds the TEMPLATE_DECL for any member friend
9410 template even if it isn't a member template, i.e.
9411 template <class T> friend A<T>::f();
9412 Look through it in that case. */
9413 if (TREE_CODE (fn
) == TEMPLATE_DECL
9414 && !PRIMARY_TEMPLATE_P (fn
))
9415 fn
= DECL_TEMPLATE_RESULT (fn
);
9416 /* Check to see that the declaration is really present, and,
9417 possibly obtain an improved declaration. */
9418 fn
= check_classfn (context
, fn
, NULL_TREE
);
9428 /* FRIEND_TMPL is a friend TEMPLATE_DECL. ARGS is the vector of
9429 template arguments, as for tsubst.
9431 Returns an appropriate tsubst'd friend type or error_mark_node on
9435 tsubst_friend_class (tree friend_tmpl
, tree args
)
9441 if (DECL_TEMPLATE_TEMPLATE_PARM_P (friend_tmpl
))
9443 tree t
= tsubst (TREE_TYPE (friend_tmpl
), args
, tf_none
, NULL_TREE
);
9444 return TREE_TYPE (t
);
9447 context
= CP_DECL_CONTEXT (friend_tmpl
);
9449 if (context
!= global_namespace
)
9451 if (TREE_CODE (context
) == NAMESPACE_DECL
)
9452 push_nested_namespace (context
);
9454 push_nested_class (tsubst (context
, args
, tf_none
, NULL_TREE
));
9457 /* Look for a class template declaration. We look for hidden names
9458 because two friend declarations of the same template are the
9459 same. For example, in:
9462 template <typename> friend class F;
9464 template <typename> struct B {
9465 template <typename> friend class F;
9468 both F templates are the same. */
9469 tmpl
= lookup_name_real (DECL_NAME (friend_tmpl
), 0, 0,
9470 /*block_p=*/true, 0, LOOKUP_HIDDEN
);
9472 /* But, if we don't find one, it might be because we're in a
9473 situation like this:
9481 Here, in the scope of (say) S<int>, `S' is bound to a TYPE_DECL
9482 for `S<int>', not the TEMPLATE_DECL. */
9483 if (!tmpl
|| !DECL_CLASS_TEMPLATE_P (tmpl
))
9485 tmpl
= lookup_name_prefer_type (DECL_NAME (friend_tmpl
), 1);
9486 tmpl
= maybe_get_template_decl_from_type_decl (tmpl
);
9489 if (tmpl
&& DECL_CLASS_TEMPLATE_P (tmpl
))
9491 /* The friend template has already been declared. Just
9492 check to see that the declarations match, and install any new
9493 default parameters. We must tsubst the default parameters,
9494 of course. We only need the innermost template parameters
9495 because that is all that redeclare_class_template will look
9497 if (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (friend_tmpl
))
9498 > TMPL_ARGS_DEPTH (args
))
9501 location_t saved_input_location
;
9502 parms
= tsubst_template_parms (DECL_TEMPLATE_PARMS (friend_tmpl
),
9503 args
, tf_warning_or_error
);
9505 saved_input_location
= input_location
;
9506 input_location
= DECL_SOURCE_LOCATION (friend_tmpl
);
9507 tree cons
= get_constraints (tmpl
);
9508 redeclare_class_template (TREE_TYPE (tmpl
), parms
, cons
);
9509 input_location
= saved_input_location
;
9513 friend_type
= TREE_TYPE (tmpl
);
9517 /* The friend template has not already been declared. In this
9518 case, the instantiation of the template class will cause the
9519 injection of this template into the global scope. */
9520 tmpl
= tsubst (friend_tmpl
, args
, tf_warning_or_error
, NULL_TREE
);
9521 if (tmpl
== error_mark_node
)
9522 return error_mark_node
;
9524 /* The new TMPL is not an instantiation of anything, so we
9525 forget its origins. We don't reset CLASSTYPE_TI_TEMPLATE for
9526 the new type because that is supposed to be the corresponding
9527 template decl, i.e., TMPL. */
9528 DECL_USE_TEMPLATE (tmpl
) = 0;
9529 DECL_TEMPLATE_INFO (tmpl
) = NULL_TREE
;
9530 CLASSTYPE_USE_TEMPLATE (TREE_TYPE (tmpl
)) = 0;
9531 CLASSTYPE_TI_ARGS (TREE_TYPE (tmpl
))
9532 = INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (TREE_TYPE (tmpl
)));
9534 /* Inject this template into the global scope. */
9535 friend_type
= TREE_TYPE (pushdecl_top_level_maybe_friend (tmpl
, true));
9538 if (context
!= global_namespace
)
9540 if (TREE_CODE (context
) == NAMESPACE_DECL
)
9541 pop_nested_namespace (context
);
9543 pop_nested_class ();
9549 /* Returns zero if TYPE cannot be completed later due to circularity.
9550 Otherwise returns one. */
9553 can_complete_type_without_circularity (tree type
)
9555 if (type
== NULL_TREE
|| type
== error_mark_node
)
9557 else if (COMPLETE_TYPE_P (type
))
9559 else if (TREE_CODE (type
) == ARRAY_TYPE
&& TYPE_DOMAIN (type
))
9560 return can_complete_type_without_circularity (TREE_TYPE (type
));
9561 else if (CLASS_TYPE_P (type
)
9562 && TYPE_BEING_DEFINED (TYPE_MAIN_VARIANT (type
)))
9568 static tree
tsubst_omp_clauses (tree
, bool, bool, tree
, tsubst_flags_t
, tree
);
9570 /* Instantiate a single dependent attribute T (a TREE_LIST), and return either
9571 T or a new TREE_LIST, possibly a chain in the case of a pack expansion. */
9574 tsubst_attribute (tree t
, tree
*decl_p
, tree args
,
9575 tsubst_flags_t complain
, tree in_decl
)
9577 gcc_assert (ATTR_IS_DEPENDENT (t
));
9579 tree val
= TREE_VALUE (t
);
9580 if (val
== NULL_TREE
)
9581 /* Nothing to do. */;
9582 else if ((flag_openmp
|| flag_openmp_simd
|| flag_cilkplus
)
9583 && is_attribute_p ("omp declare simd",
9584 get_attribute_name (t
)))
9586 tree clauses
= TREE_VALUE (val
);
9587 clauses
= tsubst_omp_clauses (clauses
, true, false, args
,
9589 c_omp_declare_simd_clauses_to_decls (*decl_p
, clauses
);
9590 clauses
= finish_omp_clauses (clauses
, false, true);
9591 tree parms
= DECL_ARGUMENTS (*decl_p
);
9593 = c_omp_declare_simd_clauses_to_numbers (parms
, clauses
);
9595 val
= build_tree_list (NULL_TREE
, clauses
);
9599 /* If the first attribute argument is an identifier, don't
9600 pass it through tsubst. Attributes like mode, format,
9601 cleanup and several target specific attributes expect it
9603 else if (attribute_takes_identifier_p (get_attribute_name (t
)))
9606 = tsubst_expr (TREE_CHAIN (val
), args
, complain
, in_decl
,
9607 /*integral_constant_expression_p=*/false);
9608 if (chain
!= TREE_CHAIN (val
))
9609 val
= tree_cons (NULL_TREE
, TREE_VALUE (val
), chain
);
9611 else if (PACK_EXPANSION_P (val
))
9613 /* An attribute pack expansion. */
9614 tree purp
= TREE_PURPOSE (t
);
9615 tree pack
= tsubst_pack_expansion (val
, args
, complain
, in_decl
);
9616 int len
= TREE_VEC_LENGTH (pack
);
9617 tree list
= NULL_TREE
;
9619 for (int i
= 0; i
< len
; ++i
)
9621 tree elt
= TREE_VEC_ELT (pack
, i
);
9622 *q
= build_tree_list (purp
, elt
);
9623 q
= &TREE_CHAIN (*q
);
9628 val
= tsubst_expr (val
, args
, complain
, in_decl
,
9629 /*integral_constant_expression_p=*/false);
9631 if (val
!= TREE_VALUE (t
))
9632 return build_tree_list (TREE_PURPOSE (t
), val
);
9636 /* Instantiate any dependent attributes in ATTRIBUTES, returning either it
9637 unchanged or a new TREE_LIST chain. */
9640 tsubst_attributes (tree attributes
, tree args
,
9641 tsubst_flags_t complain
, tree in_decl
)
9643 tree last_dep
= NULL_TREE
;
9645 for (tree t
= attributes
; t
; t
= TREE_CHAIN (t
))
9646 if (ATTR_IS_DEPENDENT (t
))
9649 attributes
= copy_list (attributes
);
9654 for (tree
*p
= &attributes
; *p
; p
= &TREE_CHAIN (*p
))
9657 if (ATTR_IS_DEPENDENT (t
))
9659 tree subst
= tsubst_attribute (t
, NULL
, args
, complain
, in_decl
);
9664 p
= &TREE_CHAIN (*p
);
9666 *p
= TREE_CHAIN (t
);
9673 /* Apply any attributes which had to be deferred until instantiation
9674 time. DECL_P, ATTRIBUTES and ATTR_FLAGS are as cplus_decl_attributes;
9675 ARGS, COMPLAIN, IN_DECL are as tsubst. */
9678 apply_late_template_attributes (tree
*decl_p
, tree attributes
, int attr_flags
,
9679 tree args
, tsubst_flags_t complain
, tree in_decl
)
9681 tree last_dep
= NULL_TREE
;
9685 for (t
= attributes
; t
; t
= TREE_CHAIN (t
))
9686 if (ATTR_IS_DEPENDENT (t
))
9689 attributes
= copy_list (attributes
);
9693 if (DECL_P (*decl_p
))
9695 if (TREE_TYPE (*decl_p
) == error_mark_node
)
9697 p
= &DECL_ATTRIBUTES (*decl_p
);
9700 p
= &TYPE_ATTRIBUTES (*decl_p
);
9704 tree late_attrs
= NULL_TREE
;
9705 tree
*q
= &late_attrs
;
9707 for (*p
= attributes
; *p
; )
9710 if (ATTR_IS_DEPENDENT (t
))
9712 *p
= TREE_CHAIN (t
);
9713 TREE_CHAIN (t
) = NULL_TREE
;
9714 *q
= tsubst_attribute (t
, decl_p
, args
, complain
, in_decl
);
9716 q
= &TREE_CHAIN (*q
);
9720 p
= &TREE_CHAIN (t
);
9723 cplus_decl_attributes (decl_p
, late_attrs
, attr_flags
);
9727 /* Perform (or defer) access check for typedefs that were referenced
9728 from within the template TMPL code.
9729 This is a subroutine of instantiate_decl and instantiate_class_template.
9730 TMPL is the template to consider and TARGS is the list of arguments of
9734 perform_typedefs_access_check (tree tmpl
, tree targs
)
9736 location_t saved_location
;
9738 qualified_typedef_usage_t
*iter
;
9741 || (!CLASS_TYPE_P (tmpl
)
9742 && TREE_CODE (tmpl
) != FUNCTION_DECL
))
9745 saved_location
= input_location
;
9746 FOR_EACH_VEC_SAFE_ELT (get_types_needing_access_check (tmpl
), i
, iter
)
9748 tree type_decl
= iter
->typedef_decl
;
9749 tree type_scope
= iter
->context
;
9751 if (!type_decl
|| !type_scope
|| !CLASS_TYPE_P (type_scope
))
9754 if (uses_template_parms (type_decl
))
9755 type_decl
= tsubst (type_decl
, targs
, tf_error
, NULL_TREE
);
9756 if (uses_template_parms (type_scope
))
9757 type_scope
= tsubst (type_scope
, targs
, tf_error
, NULL_TREE
);
9759 /* Make access check error messages point to the location
9760 of the use of the typedef. */
9761 input_location
= iter
->locus
;
9762 perform_or_defer_access_check (TYPE_BINFO (type_scope
),
9763 type_decl
, type_decl
,
9764 tf_warning_or_error
);
9766 input_location
= saved_location
;
9770 instantiate_class_template_1 (tree type
)
9772 tree templ
, args
, pattern
, t
, member
;
9776 unsigned int saved_maximum_field_alignment
;
9779 if (type
== error_mark_node
)
9780 return error_mark_node
;
9782 if (COMPLETE_OR_OPEN_TYPE_P (type
)
9783 || uses_template_parms (type
))
9786 /* Figure out which template is being instantiated. */
9787 templ
= most_general_template (CLASSTYPE_TI_TEMPLATE (type
));
9788 gcc_assert (TREE_CODE (templ
) == TEMPLATE_DECL
);
9790 /* Determine what specialization of the original template to
9792 t
= most_specialized_partial_spec (type
, tf_warning_or_error
);
9793 if (t
== error_mark_node
)
9795 TYPE_BEING_DEFINED (type
) = 1;
9796 return error_mark_node
;
9800 /* This TYPE is actually an instantiation of a partial
9801 specialization. We replace the innermost set of ARGS with
9802 the arguments appropriate for substitution. For example,
9805 template <class T> struct S {};
9806 template <class T> struct S<T*> {};
9808 and supposing that we are instantiating S<int*>, ARGS will
9809 presently be {int*} -- but we need {int}. */
9810 pattern
= TREE_TYPE (t
);
9811 args
= TREE_PURPOSE (t
);
9815 pattern
= TREE_TYPE (templ
);
9816 args
= CLASSTYPE_TI_ARGS (type
);
9819 /* If the template we're instantiating is incomplete, then clearly
9820 there's nothing we can do. */
9821 if (!COMPLETE_TYPE_P (pattern
))
9824 /* If we've recursively instantiated too many templates, stop. */
9825 if (! push_tinst_level (type
))
9828 /* Now we're really doing the instantiation. Mark the type as in
9829 the process of being defined. */
9830 TYPE_BEING_DEFINED (type
) = 1;
9832 /* We may be in the middle of deferred access check. Disable
9834 push_deferring_access_checks (dk_no_deferred
);
9836 int saved_unevaluated_operand
= cp_unevaluated_operand
;
9837 int saved_inhibit_evaluation_warnings
= c_inhibit_evaluation_warnings
;
9839 fn_context
= decl_function_context (TYPE_MAIN_DECL (type
));
9840 /* Also avoid push_to_top_level for a lambda in an NSDMI. */
9841 if (!fn_context
&& LAMBDA_TYPE_P (type
) && TYPE_CLASS_SCOPE_P (type
))
9842 fn_context
= error_mark_node
;
9844 push_to_top_level ();
9847 cp_unevaluated_operand
= 0;
9848 c_inhibit_evaluation_warnings
= 0;
9850 /* Use #pragma pack from the template context. */
9851 saved_maximum_field_alignment
= maximum_field_alignment
;
9852 maximum_field_alignment
= TYPE_PRECISION (pattern
);
9854 SET_CLASSTYPE_INTERFACE_UNKNOWN (type
);
9856 /* Set the input location to the most specialized template definition.
9857 This is needed if tsubsting causes an error. */
9858 typedecl
= TYPE_MAIN_DECL (pattern
);
9859 input_location
= DECL_SOURCE_LOCATION (TYPE_NAME (type
)) =
9860 DECL_SOURCE_LOCATION (typedecl
);
9862 TYPE_PACKED (type
) = TYPE_PACKED (pattern
);
9863 TYPE_ALIGN (type
) = TYPE_ALIGN (pattern
);
9864 TYPE_USER_ALIGN (type
) = TYPE_USER_ALIGN (pattern
);
9865 TYPE_FOR_JAVA (type
) = TYPE_FOR_JAVA (pattern
); /* For libjava's JArray<T> */
9866 if (ANON_AGGR_TYPE_P (pattern
))
9867 SET_ANON_AGGR_TYPE_P (type
);
9868 if (CLASSTYPE_VISIBILITY_SPECIFIED (pattern
))
9870 CLASSTYPE_VISIBILITY_SPECIFIED (type
) = 1;
9871 CLASSTYPE_VISIBILITY (type
) = CLASSTYPE_VISIBILITY (pattern
);
9872 /* Adjust visibility for template arguments. */
9873 determine_visibility (TYPE_MAIN_DECL (type
));
9875 if (CLASS_TYPE_P (type
))
9876 CLASSTYPE_FINAL (type
) = CLASSTYPE_FINAL (pattern
);
9878 pbinfo
= TYPE_BINFO (pattern
);
9880 /* We should never instantiate a nested class before its enclosing
9881 class; we need to look up the nested class by name before we can
9882 instantiate it, and that lookup should instantiate the enclosing
9884 gcc_assert (!DECL_CLASS_SCOPE_P (TYPE_MAIN_DECL (pattern
))
9885 || COMPLETE_OR_OPEN_TYPE_P (TYPE_CONTEXT (type
)));
9887 base_list
= NULL_TREE
;
9888 if (BINFO_N_BASE_BINFOS (pbinfo
))
9894 /* We must enter the scope containing the type, as that is where
9895 the accessibility of types named in dependent bases are
9897 pushed_scope
= push_scope (CP_TYPE_CONTEXT (type
));
9899 /* Substitute into each of the bases to determine the actual
9901 for (i
= 0; BINFO_BASE_ITERATE (pbinfo
, i
, pbase_binfo
); i
++)
9904 tree access
= BINFO_BASE_ACCESS (pbinfo
, i
);
9905 tree expanded_bases
= NULL_TREE
;
9908 if (PACK_EXPANSION_P (BINFO_TYPE (pbase_binfo
)))
9911 tsubst_pack_expansion (BINFO_TYPE (pbase_binfo
),
9912 args
, tf_error
, NULL_TREE
);
9913 if (expanded_bases
== error_mark_node
)
9916 len
= TREE_VEC_LENGTH (expanded_bases
);
9919 for (idx
= 0; idx
< len
; idx
++)
9922 /* Extract the already-expanded base class. */
9923 base
= TREE_VEC_ELT (expanded_bases
, idx
);
9925 /* Substitute to figure out the base class. */
9926 base
= tsubst (BINFO_TYPE (pbase_binfo
), args
, tf_error
,
9929 if (base
== error_mark_node
)
9932 base_list
= tree_cons (access
, base
, base_list
);
9933 if (BINFO_VIRTUAL_P (pbase_binfo
))
9934 TREE_TYPE (base_list
) = integer_type_node
;
9938 /* The list is now in reverse order; correct that. */
9939 base_list
= nreverse (base_list
);
9942 pop_scope (pushed_scope
);
9944 /* Now call xref_basetypes to set up all the base-class
9946 xref_basetypes (type
, base_list
);
9948 apply_late_template_attributes (&type
, TYPE_ATTRIBUTES (pattern
),
9949 (int) ATTR_FLAG_TYPE_IN_PLACE
,
9950 args
, tf_error
, NULL_TREE
);
9951 fixup_attribute_variants (type
);
9953 /* Now that our base classes are set up, enter the scope of the
9954 class, so that name lookups into base classes, etc. will work
9955 correctly. This is precisely analogous to what we do in
9956 begin_class_definition when defining an ordinary non-template
9957 class, except we also need to push the enclosing classes. */
9958 push_nested_class (type
);
9960 /* Now members are processed in the order of declaration. */
9961 for (member
= CLASSTYPE_DECL_LIST (pattern
);
9962 member
; member
= TREE_CHAIN (member
))
9964 tree t
= TREE_VALUE (member
);
9966 if (TREE_PURPOSE (member
))
9970 /* Build new CLASSTYPE_NESTED_UTDS. */
9973 bool class_template_p
;
9975 class_template_p
= (TREE_CODE (t
) != ENUMERAL_TYPE
9976 && TYPE_LANG_SPECIFIC (t
)
9977 && CLASSTYPE_IS_TEMPLATE (t
));
9978 /* If the member is a class template, then -- even after
9979 substitution -- there may be dependent types in the
9980 template argument list for the class. We increment
9981 PROCESSING_TEMPLATE_DECL so that dependent_type_p, as
9982 that function will assume that no types are dependent
9983 when outside of a template. */
9984 if (class_template_p
)
9985 ++processing_template_decl
;
9986 newtag
= tsubst (t
, args
, tf_error
, NULL_TREE
);
9987 if (class_template_p
)
9988 --processing_template_decl
;
9989 if (newtag
== error_mark_node
)
9992 if (TREE_CODE (newtag
) != ENUMERAL_TYPE
)
9994 tree name
= TYPE_IDENTIFIER (t
);
9996 if (class_template_p
)
9997 /* Unfortunately, lookup_template_class sets
9998 CLASSTYPE_IMPLICIT_INSTANTIATION for a partial
9999 instantiation (i.e., for the type of a member
10000 template class nested within a template class.)
10001 This behavior is required for
10002 maybe_process_partial_specialization to work
10003 correctly, but is not accurate in this case;
10004 the TAG is not an instantiation of anything.
10005 (The corresponding TEMPLATE_DECL is an
10006 instantiation, but the TYPE is not.) */
10007 CLASSTYPE_USE_TEMPLATE (newtag
) = 0;
10009 /* Now, we call pushtag to put this NEWTAG into the scope of
10010 TYPE. We first set up the IDENTIFIER_TYPE_VALUE to avoid
10011 pushtag calling push_template_decl. We don't have to do
10012 this for enums because it will already have been done in
10015 SET_IDENTIFIER_TYPE_VALUE (name
, newtag
);
10016 pushtag (name
, newtag
, /*tag_scope=*/ts_current
);
10019 else if (DECL_DECLARES_FUNCTION_P (t
))
10021 /* Build new TYPE_METHODS. */
10024 if (TREE_CODE (t
) == TEMPLATE_DECL
)
10025 ++processing_template_decl
;
10026 r
= tsubst (t
, args
, tf_error
, NULL_TREE
);
10027 if (TREE_CODE (t
) == TEMPLATE_DECL
)
10028 --processing_template_decl
;
10029 set_current_access_from_decl (r
);
10030 finish_member_declaration (r
);
10031 /* Instantiate members marked with attribute used. */
10032 if (r
!= error_mark_node
&& DECL_PRESERVE_P (r
))
10034 if (TREE_CODE (r
) == FUNCTION_DECL
10035 && DECL_OMP_DECLARE_REDUCTION_P (r
))
10036 cp_check_omp_declare_reduction (r
);
10038 else if (DECL_CLASS_TEMPLATE_P (t
)
10039 && LAMBDA_TYPE_P (TREE_TYPE (t
)))
10040 /* A closure type for a lambda in a default argument for a
10041 member template. Ignore it; it will be instantiated with
10042 the default argument. */;
10045 /* Build new TYPE_FIELDS. */
10046 if (TREE_CODE (t
) == STATIC_ASSERT
)
10050 ++c_inhibit_evaluation_warnings
;
10052 tsubst_expr (STATIC_ASSERT_CONDITION (t
), args
,
10053 tf_warning_or_error
, NULL_TREE
,
10054 /*integral_constant_expression_p=*/true);
10055 --c_inhibit_evaluation_warnings
;
10057 finish_static_assert (condition
,
10058 STATIC_ASSERT_MESSAGE (t
),
10059 STATIC_ASSERT_SOURCE_LOCATION (t
),
10060 /*member_p=*/true);
10062 else if (TREE_CODE (t
) != CONST_DECL
)
10065 tree vec
= NULL_TREE
;
10068 /* The file and line for this declaration, to
10069 assist in error message reporting. Since we
10070 called push_tinst_level above, we don't need to
10072 input_location
= DECL_SOURCE_LOCATION (t
);
10074 if (TREE_CODE (t
) == TEMPLATE_DECL
)
10075 ++processing_template_decl
;
10076 r
= tsubst (t
, args
, tf_warning_or_error
, NULL_TREE
);
10077 if (TREE_CODE (t
) == TEMPLATE_DECL
)
10078 --processing_template_decl
;
10080 if (TREE_CODE (r
) == TREE_VEC
)
10082 /* A capture pack became multiple fields. */
10084 len
= TREE_VEC_LENGTH (vec
);
10087 for (int i
= 0; i
< len
; ++i
)
10090 r
= TREE_VEC_ELT (vec
, i
);
10095 [t]he initialization (and any associated
10096 side-effects) of a static data member does
10097 not occur unless the static data member is
10098 itself used in a way that requires the
10099 definition of the static data member to
10102 Therefore, we do not substitute into the
10103 initialized for the static data member here. */
10104 finish_static_data_member_decl
10106 /*init=*/NULL_TREE
,
10107 /*init_const_expr_p=*/false,
10108 /*asmspec_tree=*/NULL_TREE
,
10110 /* Instantiate members marked with attribute used. */
10111 if (r
!= error_mark_node
&& DECL_PRESERVE_P (r
))
10114 else if (TREE_CODE (r
) == FIELD_DECL
)
10116 /* Determine whether R has a valid type and can be
10117 completed later. If R is invalid, then its type
10118 is replaced by error_mark_node. */
10119 tree rtype
= TREE_TYPE (r
);
10120 if (can_complete_type_without_circularity (rtype
))
10121 complete_type (rtype
);
10123 if (TREE_CODE (r
) == FIELD_DECL
10124 && TREE_CODE (rtype
) == ARRAY_TYPE
10125 && COMPLETE_TYPE_P (TREE_TYPE (rtype
))
10126 && !COMPLETE_TYPE_P (rtype
))
10128 /* Flexible array mmembers of elements
10129 of complete type have an incomplete type
10130 and that's okay. */
10132 else if (!COMPLETE_TYPE_P (rtype
))
10134 cxx_incomplete_type_error (r
, rtype
);
10135 TREE_TYPE (r
) = error_mark_node
;
10139 /* If it is a TYPE_DECL for a class-scoped ENUMERAL_TYPE,
10140 such a thing will already have been added to the field
10141 list by tsubst_enum in finish_member_declaration in the
10142 CLASSTYPE_NESTED_UTDS case above. */
10143 if (!(TREE_CODE (r
) == TYPE_DECL
10144 && TREE_CODE (TREE_TYPE (r
)) == ENUMERAL_TYPE
10145 && DECL_ARTIFICIAL (r
)))
10147 set_current_access_from_decl (r
);
10148 finish_member_declaration (r
);
10156 if (TYPE_P (t
) || DECL_CLASS_TEMPLATE_P (t
)
10157 || DECL_TEMPLATE_TEMPLATE_PARM_P (t
))
10159 /* Build new CLASSTYPE_FRIEND_CLASSES. */
10161 tree friend_type
= t
;
10162 bool adjust_processing_template_decl
= false;
10164 if (TREE_CODE (friend_type
) == TEMPLATE_DECL
)
10166 /* template <class T> friend class C; */
10167 friend_type
= tsubst_friend_class (friend_type
, args
);
10168 adjust_processing_template_decl
= true;
10170 else if (TREE_CODE (friend_type
) == UNBOUND_CLASS_TEMPLATE
)
10172 /* template <class T> friend class C::D; */
10173 friend_type
= tsubst (friend_type
, args
,
10174 tf_warning_or_error
, NULL_TREE
);
10175 if (TREE_CODE (friend_type
) == TEMPLATE_DECL
)
10176 friend_type
= TREE_TYPE (friend_type
);
10177 adjust_processing_template_decl
= true;
10179 else if (TREE_CODE (friend_type
) == TYPENAME_TYPE
10180 || TREE_CODE (friend_type
) == TEMPLATE_TYPE_PARM
)
10182 /* This could be either
10186 when dependent_type_p is false or
10188 template <class U> friend class T::C;
10191 /* Bump processing_template_decl in case this is something like
10192 template <class T> friend struct A<T>::B. */
10193 ++processing_template_decl
;
10194 friend_type
= tsubst (friend_type
, args
,
10195 tf_warning_or_error
, NULL_TREE
);
10196 if (dependent_type_p (friend_type
))
10197 adjust_processing_template_decl
= true;
10198 --processing_template_decl
;
10200 else if (!CLASSTYPE_USE_TEMPLATE (friend_type
)
10201 && hidden_name_p (TYPE_NAME (friend_type
)))
10205 where C hasn't been declared yet. Let's lookup name
10206 from namespace scope directly, bypassing any name that
10207 come from dependent base class. */
10208 tree ns
= decl_namespace_context (TYPE_MAIN_DECL (friend_type
));
10210 /* The call to xref_tag_from_type does injection for friend
10212 push_nested_namespace (ns
);
10214 xref_tag_from_type (friend_type
, NULL_TREE
,
10215 /*tag_scope=*/ts_current
);
10216 pop_nested_namespace (ns
);
10218 else if (uses_template_parms (friend_type
))
10219 /* friend class C<T>; */
10220 friend_type
= tsubst (friend_type
, args
,
10221 tf_warning_or_error
, NULL_TREE
);
10226 where C is already declared or
10228 friend class C<int>;
10230 We don't have to do anything in these cases. */
10232 if (adjust_processing_template_decl
)
10233 /* Trick make_friend_class into realizing that the friend
10234 we're adding is a template, not an ordinary class. It's
10235 important that we use make_friend_class since it will
10236 perform some error-checking and output cross-reference
10238 ++processing_template_decl
;
10240 if (friend_type
!= error_mark_node
)
10241 make_friend_class (type
, friend_type
, /*complain=*/false);
10243 if (adjust_processing_template_decl
)
10244 --processing_template_decl
;
10248 /* Build new DECL_FRIENDLIST. */
10251 /* The file and line for this declaration, to
10252 assist in error message reporting. Since we
10253 called push_tinst_level above, we don't need to
10255 input_location
= DECL_SOURCE_LOCATION (t
);
10257 if (TREE_CODE (t
) == TEMPLATE_DECL
)
10259 ++processing_template_decl
;
10260 push_deferring_access_checks (dk_no_check
);
10263 r
= tsubst_friend_function (t
, args
);
10264 add_friend (type
, r
, /*complain=*/false);
10265 if (TREE_CODE (t
) == TEMPLATE_DECL
)
10267 pop_deferring_access_checks ();
10268 --processing_template_decl
;
10276 /* Restore these before substituting into the lambda capture
10278 cp_unevaluated_operand
= saved_unevaluated_operand
;
10279 c_inhibit_evaluation_warnings
= saved_inhibit_evaluation_warnings
;
10282 if (tree expr
= CLASSTYPE_LAMBDA_EXPR (type
))
10284 tree decl
= lambda_function (type
);
10287 if (!DECL_TEMPLATE_INFO (decl
)
10288 || DECL_TEMPLATE_RESULT (DECL_TI_TEMPLATE (decl
)) != decl
)
10290 /* Set function_depth to avoid garbage collection. */
10292 instantiate_decl (decl
, false, false);
10296 /* We need to instantiate the capture list from the template
10297 after we've instantiated the closure members, but before we
10298 consider adding the conversion op. Also keep any captures
10299 that may have been added during instantiation of the op(). */
10300 tree tmpl_expr
= CLASSTYPE_LAMBDA_EXPR (pattern
);
10302 = tsubst_copy_and_build (LAMBDA_EXPR_CAPTURE_LIST (tmpl_expr
),
10303 args
, tf_warning_or_error
, NULL_TREE
,
10306 LAMBDA_EXPR_CAPTURE_LIST (expr
)
10307 = chainon (tmpl_cap
, nreverse (LAMBDA_EXPR_CAPTURE_LIST (expr
)));
10309 maybe_add_lambda_conv_op (type
);
10312 gcc_assert (errorcount
);
10315 /* Set the file and line number information to whatever is given for
10316 the class itself. This puts error messages involving generated
10317 implicit functions at a predictable point, and the same point
10318 that would be used for non-template classes. */
10319 input_location
= DECL_SOURCE_LOCATION (typedecl
);
10321 unreverse_member_declarations (type
);
10322 finish_struct_1 (type
);
10323 TYPE_BEING_DEFINED (type
) = 0;
10325 /* We don't instantiate default arguments for member functions. 14.7.1:
10327 The implicit instantiation of a class template specialization causes
10328 the implicit instantiation of the declarations, but not of the
10329 definitions or default arguments, of the class member functions,
10330 member classes, static data members and member templates.... */
10332 /* Some typedefs referenced from within the template code need to be access
10333 checked at template instantiation time, i.e now. These types were
10334 added to the template at parsing time. Let's get those and perform
10335 the access checks then. */
10336 perform_typedefs_access_check (pattern
, args
);
10337 perform_deferred_access_checks (tf_warning_or_error
);
10338 pop_nested_class ();
10339 maximum_field_alignment
= saved_maximum_field_alignment
;
10341 pop_from_top_level ();
10342 pop_deferring_access_checks ();
10343 pop_tinst_level ();
10345 /* The vtable for a template class can be emitted in any translation
10346 unit in which the class is instantiated. When there is no key
10347 method, however, finish_struct_1 will already have added TYPE to
10348 the keyed_classes list. */
10349 if (TYPE_CONTAINS_VPTR_P (type
) && CLASSTYPE_KEY_METHOD (type
))
10350 keyed_classes
= tree_cons (NULL_TREE
, type
, keyed_classes
);
10355 /* Wrapper for instantiate_class_template_1. */
10358 instantiate_class_template (tree type
)
10361 timevar_push (TV_TEMPLATE_INST
);
10362 ret
= instantiate_class_template_1 (type
);
10363 timevar_pop (TV_TEMPLATE_INST
);
10368 tsubst_template_arg (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
10374 else if (TYPE_P (t
))
10375 r
= tsubst (t
, args
, complain
, in_decl
);
10378 if (!(complain
& tf_warning
))
10379 ++c_inhibit_evaluation_warnings
;
10380 r
= tsubst_expr (t
, args
, complain
, in_decl
,
10381 /*integral_constant_expression_p=*/true);
10382 if (!(complain
& tf_warning
))
10383 --c_inhibit_evaluation_warnings
;
10388 /* Given a function parameter pack TMPL_PARM and some function parameters
10389 instantiated from it at *SPEC_P, return a NONTYPE_ARGUMENT_PACK of them
10390 and set *SPEC_P to point at the next point in the list. */
10393 extract_fnparm_pack (tree tmpl_parm
, tree
*spec_p
)
10395 /* Collect all of the extra "packed" parameters into an
10399 tree argpack
= make_node (NONTYPE_ARGUMENT_PACK
);
10400 tree argtypepack
= cxx_make_type (TYPE_ARGUMENT_PACK
);
10401 tree spec_parm
= *spec_p
;
10404 for (len
= 0; spec_parm
; ++len
, spec_parm
= TREE_CHAIN (spec_parm
))
10406 && !function_parameter_expanded_from_pack_p (spec_parm
, tmpl_parm
))
10409 /* Fill in PARMVEC and PARMTYPEVEC with all of the parameters. */
10410 parmvec
= make_tree_vec (len
);
10411 parmtypevec
= make_tree_vec (len
);
10412 spec_parm
= *spec_p
;
10413 for (i
= 0; i
< len
; i
++, spec_parm
= DECL_CHAIN (spec_parm
))
10415 TREE_VEC_ELT (parmvec
, i
) = spec_parm
;
10416 TREE_VEC_ELT (parmtypevec
, i
) = TREE_TYPE (spec_parm
);
10419 /* Build the argument packs. */
10420 SET_ARGUMENT_PACK_ARGS (argpack
, parmvec
);
10421 SET_ARGUMENT_PACK_ARGS (argtypepack
, parmtypevec
);
10422 TREE_TYPE (argpack
) = argtypepack
;
10423 *spec_p
= spec_parm
;
10428 /* Give a chain SPEC_PARM of PARM_DECLs, pack them into a
10429 NONTYPE_ARGUMENT_PACK. */
10432 make_fnparm_pack (tree spec_parm
)
10434 return extract_fnparm_pack (NULL_TREE
, &spec_parm
);
10437 /* Return 1 if the Ith element of the argument pack ARG_PACK is a
10438 pack expansion with no extra args, 2 if it has extra args, or 0
10439 if it is not a pack expansion. */
10442 argument_pack_element_is_expansion_p (tree arg_pack
, int i
)
10444 tree vec
= ARGUMENT_PACK_ARGS (arg_pack
);
10445 if (i
>= TREE_VEC_LENGTH (vec
))
10447 tree elt
= TREE_VEC_ELT (vec
, i
);
10449 /* A decl pack is itself an expansion. */
10450 elt
= TREE_TYPE (elt
);
10451 if (!PACK_EXPANSION_P (elt
))
10453 if (PACK_EXPANSION_EXTRA_ARGS (elt
))
10459 /* Creates and return an ARGUMENT_PACK_SELECT tree node. */
10462 make_argument_pack_select (tree arg_pack
, unsigned index
)
10464 tree aps
= make_node (ARGUMENT_PACK_SELECT
);
10466 ARGUMENT_PACK_SELECT_FROM_PACK (aps
) = arg_pack
;
10467 ARGUMENT_PACK_SELECT_INDEX (aps
) = index
;
10472 /* This is a subroutine of tsubst_pack_expansion.
10474 It returns TRUE if we need to use the PACK_EXPANSION_EXTRA_ARGS
10475 mechanism to store the (non complete list of) arguments of the
10476 substitution and return a non substituted pack expansion, in order
10477 to wait for when we have enough arguments to really perform the
10481 use_pack_expansion_extra_args_p (tree parm_packs
,
10483 bool has_empty_arg
)
10485 /* If one pack has an expansion and another pack has a normal
10486 argument or if one pack has an empty argument and an another
10487 one hasn't then tsubst_pack_expansion cannot perform the
10488 substitution and need to fall back on the
10489 PACK_EXPANSION_EXTRA mechanism. */
10490 if (parm_packs
== NULL_TREE
)
10492 else if (has_empty_arg
)
10495 bool has_expansion_arg
= false;
10496 for (int i
= 0 ; i
< arg_pack_len
; ++i
)
10498 bool has_non_expansion_arg
= false;
10499 for (tree parm_pack
= parm_packs
;
10501 parm_pack
= TREE_CHAIN (parm_pack
))
10503 tree arg
= TREE_VALUE (parm_pack
);
10505 int exp
= argument_pack_element_is_expansion_p (arg
, i
);
10507 /* We can't substitute a pack expansion with extra args into
10511 has_expansion_arg
= true;
10513 has_non_expansion_arg
= true;
10516 if (has_expansion_arg
&& has_non_expansion_arg
)
10522 /* [temp.variadic]/6 says that:
10524 The instantiation of a pack expansion [...]
10525 produces a list E1,E2, ..., En, where N is the number of elements
10526 in the pack expansion parameters.
10528 This subroutine of tsubst_pack_expansion produces one of these Ei.
10530 PATTERN is the pattern of the pack expansion. PARM_PACKS is a
10531 TREE_LIST in which each TREE_PURPOSE is a parameter pack of
10532 PATTERN, and each TREE_VALUE is its corresponding argument pack.
10533 INDEX is the index 'i' of the element Ei to produce. ARGS,
10534 COMPLAIN, and IN_DECL are the same parameters as for the
10535 tsubst_pack_expansion function.
10537 The function returns the resulting Ei upon successful completion,
10538 or error_mark_node.
10540 Note that this function possibly modifies the ARGS parameter, so
10541 it's the responsibility of the caller to restore it. */
10544 gen_elem_of_pack_expansion_instantiation (tree pattern
,
10547 tree args
/* This parm gets
10549 tsubst_flags_t complain
,
10553 bool ith_elem_is_expansion
= false;
10555 /* For each parameter pack, change the substitution of the parameter
10556 pack to the ith argument in its argument pack, then expand the
10558 for (tree pack
= parm_packs
; pack
; pack
= TREE_CHAIN (pack
))
10560 tree parm
= TREE_PURPOSE (pack
);
10561 tree arg_pack
= TREE_VALUE (pack
);
10562 tree aps
; /* instance of ARGUMENT_PACK_SELECT. */
10564 ith_elem_is_expansion
|=
10565 argument_pack_element_is_expansion_p (arg_pack
, index
);
10567 /* Select the Ith argument from the pack. */
10568 if (TREE_CODE (parm
) == PARM_DECL
10569 || TREE_CODE (parm
) == FIELD_DECL
)
10573 aps
= make_argument_pack_select (arg_pack
, index
);
10574 if (!mark_used (parm
, complain
) && !(complain
& tf_error
))
10575 return error_mark_node
;
10576 register_local_specialization (aps
, parm
);
10579 aps
= retrieve_local_specialization (parm
);
10584 template_parm_level_and_index (parm
, &level
, &idx
);
10588 aps
= make_argument_pack_select (arg_pack
, index
);
10589 /* Update the corresponding argument. */
10590 TMPL_ARG (args
, level
, idx
) = aps
;
10593 /* Re-use the ARGUMENT_PACK_SELECT. */
10594 aps
= TMPL_ARG (args
, level
, idx
);
10596 ARGUMENT_PACK_SELECT_INDEX (aps
) = index
;
10599 /* Substitute into the PATTERN with the (possibly altered)
10601 if (pattern
== in_decl
)
10602 /* Expanding a fixed parameter pack from
10603 coerce_template_parameter_pack. */
10604 t
= tsubst_decl (pattern
, args
, complain
);
10605 else if (pattern
== error_mark_node
)
10606 t
= error_mark_node
;
10607 else if (constraint_p (pattern
))
10609 if (processing_template_decl
)
10610 t
= tsubst_constraint (pattern
, args
, complain
, in_decl
);
10612 t
= (constraints_satisfied_p (pattern
, args
)
10613 ? boolean_true_node
: boolean_false_node
);
10615 else if (!TYPE_P (pattern
))
10616 t
= tsubst_expr (pattern
, args
, complain
, in_decl
,
10617 /*integral_constant_expression_p=*/false);
10619 t
= tsubst (pattern
, args
, complain
, in_decl
);
10621 /* If the Ith argument pack element is a pack expansion, then
10622 the Ith element resulting from the substituting is going to
10623 be a pack expansion as well. */
10624 if (ith_elem_is_expansion
)
10625 t
= make_pack_expansion (t
);
10630 /* When the unexpanded parameter pack in a fold expression expands to an empty
10631 sequence, the value of the expression is as follows; the program is
10632 ill-formed if the operator is not listed in this table.
10639 expand_empty_fold (tree t
, tsubst_flags_t complain
)
10641 tree_code code
= (tree_code
)TREE_INT_CST_LOW (TREE_OPERAND (t
, 0));
10642 if (!FOLD_EXPR_MODIFY_P (t
))
10645 case TRUTH_ANDIF_EXPR
:
10646 return boolean_true_node
;
10647 case TRUTH_ORIF_EXPR
:
10648 return boolean_false_node
;
10649 case COMPOUND_EXPR
:
10655 if (complain
& tf_error
)
10656 error_at (location_of (t
),
10657 "fold of empty expansion over %O", code
);
10658 return error_mark_node
;
10661 /* Given a fold-expression T and a current LEFT and RIGHT operand,
10662 form an expression that combines the two terms using the
10666 fold_expression (tree t
, tree left
, tree right
, tsubst_flags_t complain
)
10668 tree op
= FOLD_EXPR_OP (t
);
10669 tree_code code
= (tree_code
)TREE_INT_CST_LOW (op
);
10671 // Handle compound assignment operators.
10672 if (FOLD_EXPR_MODIFY_P (t
))
10673 return build_x_modify_expr (input_location
, left
, code
, right
, complain
);
10677 case COMPOUND_EXPR
:
10678 return build_x_compound_expr (input_location
, left
, right
, complain
);
10680 return build_m_component_ref (left
, right
, complain
);
10682 return build_x_binary_op (input_location
, code
,
10683 left
, TREE_CODE (left
),
10684 right
, TREE_CODE (right
),
10690 /* Substitute ARGS into the pack of a fold expression T. */
10693 tsubst_fold_expr_pack (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
10695 return tsubst_pack_expansion (FOLD_EXPR_PACK (t
), args
, complain
, in_decl
);
10698 /* Substitute ARGS into the pack of a fold expression T. */
10701 tsubst_fold_expr_init (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
10703 return tsubst_expr (FOLD_EXPR_INIT (t
), args
, complain
, in_decl
, false);
10706 /* Expand a PACK of arguments into a grouped as left fold.
10707 Given a pack containing elements A0, A1, ..., An and an
10708 operator @, this builds the expression:
10710 ((A0 @ A1) @ A2) ... @ An
10712 Note that PACK must not be empty.
10714 The operator is defined by the original fold expression T. */
10717 expand_left_fold (tree t
, tree pack
, tsubst_flags_t complain
)
10719 tree left
= TREE_VEC_ELT (pack
, 0);
10720 for (int i
= 1; i
< TREE_VEC_LENGTH (pack
); ++i
)
10722 tree right
= TREE_VEC_ELT (pack
, i
);
10723 left
= fold_expression (t
, left
, right
, complain
);
10728 /* Substitute into a unary left fold expression. */
10731 tsubst_unary_left_fold (tree t
, tree args
, tsubst_flags_t complain
,
10734 tree pack
= tsubst_fold_expr_pack (t
, args
, complain
, in_decl
);
10735 if (pack
== error_mark_node
)
10736 return error_mark_node
;
10737 if (TREE_VEC_LENGTH (pack
) == 0)
10738 return expand_empty_fold (t
, complain
);
10740 return expand_left_fold (t
, pack
, complain
);
10743 /* Substitute into a binary left fold expression.
10745 Do ths by building a single (non-empty) vector of argumnts and
10746 building the expression from those elements. */
10749 tsubst_binary_left_fold (tree t
, tree args
, tsubst_flags_t complain
,
10752 tree pack
= tsubst_fold_expr_pack (t
, args
, complain
, in_decl
);
10753 if (pack
== error_mark_node
)
10754 return error_mark_node
;
10755 tree init
= tsubst_fold_expr_init (t
, args
, complain
, in_decl
);
10756 if (init
== error_mark_node
)
10757 return error_mark_node
;
10759 tree vec
= make_tree_vec (TREE_VEC_LENGTH (pack
) + 1);
10760 TREE_VEC_ELT (vec
, 0) = init
;
10761 for (int i
= 0; i
< TREE_VEC_LENGTH (pack
); ++i
)
10762 TREE_VEC_ELT (vec
, i
+ 1) = TREE_VEC_ELT (pack
, i
);
10764 return expand_left_fold (t
, vec
, complain
);
10767 /* Expand a PACK of arguments into a grouped as right fold.
10768 Given a pack containing elementns A0, A1, ..., and an
10769 operator @, this builds the expression:
10771 A0@ ... (An-2 @ (An-1 @ An))
10773 Note that PACK must not be empty.
10775 The operator is defined by the original fold expression T. */
10778 expand_right_fold (tree t
, tree pack
, tsubst_flags_t complain
)
10780 // Build the expression.
10781 int n
= TREE_VEC_LENGTH (pack
);
10782 tree right
= TREE_VEC_ELT (pack
, n
- 1);
10783 for (--n
; n
!= 0; --n
)
10785 tree left
= TREE_VEC_ELT (pack
, n
- 1);
10786 right
= fold_expression (t
, left
, right
, complain
);
10791 /* Substitute into a unary right fold expression. */
10794 tsubst_unary_right_fold (tree t
, tree args
, tsubst_flags_t complain
,
10797 tree pack
= tsubst_fold_expr_pack (t
, args
, complain
, in_decl
);
10798 if (pack
== error_mark_node
)
10799 return error_mark_node
;
10800 if (TREE_VEC_LENGTH (pack
) == 0)
10801 return expand_empty_fold (t
, complain
);
10803 return expand_right_fold (t
, pack
, complain
);
10806 /* Substitute into a binary right fold expression.
10808 Do ths by building a single (non-empty) vector of arguments and
10809 building the expression from those elements. */
10812 tsubst_binary_right_fold (tree t
, tree args
, tsubst_flags_t complain
,
10815 tree pack
= tsubst_fold_expr_pack (t
, args
, complain
, in_decl
);
10816 if (pack
== error_mark_node
)
10817 return error_mark_node
;
10818 tree init
= tsubst_fold_expr_init (t
, args
, complain
, in_decl
);
10819 if (init
== error_mark_node
)
10820 return error_mark_node
;
10822 int n
= TREE_VEC_LENGTH (pack
);
10823 tree vec
= make_tree_vec (n
+ 1);
10824 for (int i
= 0; i
< n
; ++i
)
10825 TREE_VEC_ELT (vec
, i
) = TREE_VEC_ELT (pack
, i
);
10826 TREE_VEC_ELT (vec
, n
) = init
;
10828 return expand_right_fold (t
, vec
, complain
);
10832 /* Substitute ARGS into T, which is an pack expansion
10833 (i.e. TYPE_PACK_EXPANSION or EXPR_PACK_EXPANSION). Returns a
10834 TREE_VEC with the substituted arguments, a PACK_EXPANSION_* node
10835 (if only a partial substitution could be performed) or
10836 ERROR_MARK_NODE if there was an error. */
10838 tsubst_pack_expansion (tree t
, tree args
, tsubst_flags_t complain
,
10842 tree pack
, packs
= NULL_TREE
;
10843 bool unsubstituted_packs
= false;
10846 hash_map
<tree
, tree
> *saved_local_specializations
= NULL
;
10847 bool need_local_specializations
= false;
10850 gcc_assert (PACK_EXPANSION_P (t
));
10851 pattern
= PACK_EXPANSION_PATTERN (t
);
10853 /* Add in any args remembered from an earlier partial instantiation. */
10854 args
= add_to_template_args (PACK_EXPANSION_EXTRA_ARGS (t
), args
);
10856 levels
= TMPL_ARGS_DEPTH (args
);
10858 /* Determine the argument packs that will instantiate the parameter
10859 packs used in the expansion expression. While we're at it,
10860 compute the number of arguments to be expanded and make sure it
10862 for (pack
= PACK_EXPANSION_PARAMETER_PACKS (t
); pack
;
10863 pack
= TREE_CHAIN (pack
))
10865 tree parm_pack
= TREE_VALUE (pack
);
10866 tree arg_pack
= NULL_TREE
;
10867 tree orig_arg
= NULL_TREE
;
10870 if (TREE_CODE (parm_pack
) == BASES
)
10872 if (BASES_DIRECT (parm_pack
))
10873 return calculate_direct_bases (tsubst_expr (BASES_TYPE (parm_pack
),
10874 args
, complain
, in_decl
, false));
10876 return calculate_bases (tsubst_expr (BASES_TYPE (parm_pack
),
10877 args
, complain
, in_decl
, false));
10879 if (TREE_CODE (parm_pack
) == PARM_DECL
)
10881 /* We know we have correct local_specializations if this
10882 expansion is at function scope, or if we're dealing with a
10883 local parameter in a requires expression; for the latter,
10884 tsubst_requires_expr set it up appropriately. */
10885 if (PACK_EXPANSION_LOCAL_P (t
) || CONSTRAINT_VAR_P (parm_pack
))
10886 arg_pack
= retrieve_local_specialization (parm_pack
);
10888 /* We can't rely on local_specializations for a parameter
10889 name used later in a function declaration (such as in a
10890 late-specified return type). Even if it exists, it might
10891 have the wrong value for a recursive call. */
10892 need_local_specializations
= true;
10896 /* This parameter pack was used in an unevaluated context. Just
10897 make a dummy decl, since it's only used for its type. */
10898 arg_pack
= tsubst_decl (parm_pack
, args
, complain
);
10899 if (arg_pack
&& DECL_PACK_P (arg_pack
))
10900 /* Partial instantiation of the parm_pack, we can't build
10901 up an argument pack yet. */
10902 arg_pack
= NULL_TREE
;
10904 arg_pack
= make_fnparm_pack (arg_pack
);
10907 else if (TREE_CODE (parm_pack
) == FIELD_DECL
)
10908 arg_pack
= tsubst_copy (parm_pack
, args
, complain
, in_decl
);
10912 template_parm_level_and_index (parm_pack
, &level
, &idx
);
10914 if (level
<= levels
)
10915 arg_pack
= TMPL_ARG (args
, level
, idx
);
10918 orig_arg
= arg_pack
;
10919 if (arg_pack
&& TREE_CODE (arg_pack
) == ARGUMENT_PACK_SELECT
)
10920 arg_pack
= ARGUMENT_PACK_SELECT_FROM_PACK (arg_pack
);
10922 if (arg_pack
&& !ARGUMENT_PACK_P (arg_pack
))
10923 /* This can only happen if we forget to expand an argument
10924 pack somewhere else. Just return an error, silently. */
10926 result
= make_tree_vec (1);
10927 TREE_VEC_ELT (result
, 0) = error_mark_node
;
10934 TREE_VEC_LENGTH (ARGUMENT_PACK_ARGS (arg_pack
));
10936 /* Don't bother trying to do a partial substitution with
10937 incomplete packs; we'll try again after deduction. */
10938 if (ARGUMENT_PACK_INCOMPLETE_P (arg_pack
))
10943 else if (len
!= my_len
)
10945 if (!(complain
& tf_error
))
10946 /* Fail quietly. */;
10947 else if (TREE_CODE (t
) == TYPE_PACK_EXPANSION
)
10948 error ("mismatched argument pack lengths while expanding "
10952 error ("mismatched argument pack lengths while expanding "
10955 return error_mark_node
;
10958 /* Keep track of the parameter packs and their corresponding
10960 packs
= tree_cons (parm_pack
, arg_pack
, packs
);
10961 TREE_TYPE (packs
) = orig_arg
;
10965 /* We can't substitute for this parameter pack. We use a flag as
10966 well as the missing_level counter because function parameter
10967 packs don't have a level. */
10968 unsubstituted_packs
= true;
10972 /* If the expansion is just T..., return the matching argument pack, unless
10973 we need to call convert_from_reference on all the elements. This is an
10974 important optimization; see c++/68422. */
10975 if (!unsubstituted_packs
10976 && TREE_PURPOSE (packs
) == pattern
)
10978 tree args
= ARGUMENT_PACK_ARGS (TREE_VALUE (packs
));
10979 /* Types need no adjustment, nor does sizeof..., and if we still have
10980 some pack expansion args we won't do anything yet. */
10981 if (TREE_CODE (t
) == TYPE_PACK_EXPANSION
10982 || PACK_EXPANSION_SIZEOF_P (t
)
10983 || pack_expansion_args_count (args
))
10985 /* Also optimize expression pack expansions if we can tell that the
10986 elements won't have reference type. */
10987 tree type
= TREE_TYPE (pattern
);
10988 if (type
&& TREE_CODE (type
) != REFERENCE_TYPE
10989 && !PACK_EXPANSION_P (type
)
10990 && !WILDCARD_TYPE_P (type
))
10992 /* Otherwise use the normal path so we get convert_from_reference. */
10995 /* We cannot expand this expansion expression, because we don't have
10996 all of the argument packs we need. */
10997 if (use_pack_expansion_extra_args_p (packs
, len
, unsubstituted_packs
))
10999 /* We got some full packs, but we can't substitute them in until we
11000 have values for all the packs. So remember these until then. */
11002 t
= make_pack_expansion (pattern
);
11003 PACK_EXPANSION_EXTRA_ARGS (t
) = args
;
11006 else if (unsubstituted_packs
)
11008 /* There were no real arguments, we're just replacing a parameter
11009 pack with another version of itself. Substitute into the
11010 pattern and return a PACK_EXPANSION_*. The caller will need to
11012 if (TREE_CODE (t
) == EXPR_PACK_EXPANSION
)
11013 t
= tsubst_expr (pattern
, args
, complain
, in_decl
,
11014 /*integral_constant_expression_p=*/false);
11016 t
= tsubst (pattern
, args
, complain
, in_decl
);
11017 t
= make_pack_expansion (t
);
11021 gcc_assert (len
>= 0);
11023 if (need_local_specializations
)
11025 /* We're in a late-specified return type, so create our own local
11026 specializations map; the current map is either NULL or (in the
11027 case of recursive unification) might have bindings that we don't
11028 want to use or alter. */
11029 saved_local_specializations
= local_specializations
;
11030 local_specializations
= new hash_map
<tree
, tree
>;
11033 /* For each argument in each argument pack, substitute into the
11035 result
= make_tree_vec (len
);
11036 tree elem_args
= copy_template_args (args
);
11037 for (i
= 0; i
< len
; ++i
)
11039 t
= gen_elem_of_pack_expansion_instantiation (pattern
, packs
,
11041 elem_args
, complain
,
11043 TREE_VEC_ELT (result
, i
) = t
;
11044 if (t
== error_mark_node
)
11046 result
= error_mark_node
;
11051 /* Update ARGS to restore the substitution from parameter packs to
11052 their argument packs. */
11053 for (pack
= packs
; pack
; pack
= TREE_CHAIN (pack
))
11055 tree parm
= TREE_PURPOSE (pack
);
11057 if (TREE_CODE (parm
) == PARM_DECL
11058 || TREE_CODE (parm
) == FIELD_DECL
)
11059 register_local_specialization (TREE_TYPE (pack
), parm
);
11064 if (TREE_VALUE (pack
) == NULL_TREE
)
11067 template_parm_level_and_index (parm
, &level
, &idx
);
11069 /* Update the corresponding argument. */
11070 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (args
))
11071 TREE_VEC_ELT (TREE_VEC_ELT (args
, level
-1 ), idx
) =
11074 TREE_VEC_ELT (args
, idx
) = TREE_TYPE (pack
);
11078 if (need_local_specializations
)
11080 delete local_specializations
;
11081 local_specializations
= saved_local_specializations
;
11087 /* Given PARM_DECL PARM, find the corresponding PARM_DECL in the template
11088 TMPL. We do this using DECL_PARM_INDEX, which should work even with
11089 parameter packs; all parms generated from a function parameter pack will
11090 have the same DECL_PARM_INDEX. */
11093 get_pattern_parm (tree parm
, tree tmpl
)
11095 tree pattern
= DECL_TEMPLATE_RESULT (tmpl
);
11098 if (DECL_ARTIFICIAL (parm
))
11100 for (patparm
= DECL_ARGUMENTS (pattern
);
11101 patparm
; patparm
= DECL_CHAIN (patparm
))
11102 if (DECL_ARTIFICIAL (patparm
)
11103 && DECL_NAME (parm
) == DECL_NAME (patparm
))
11108 patparm
= FUNCTION_FIRST_USER_PARM (DECL_TEMPLATE_RESULT (tmpl
));
11109 patparm
= chain_index (DECL_PARM_INDEX (parm
)-1, patparm
);
11110 gcc_assert (DECL_PARM_INDEX (patparm
)
11111 == DECL_PARM_INDEX (parm
));
11117 /* Make an argument pack out of the TREE_VEC VEC. */
11120 make_argument_pack (tree vec
)
11123 tree elt
= TREE_VEC_ELT (vec
, 0);
11125 pack
= cxx_make_type (TYPE_ARGUMENT_PACK
);
11128 pack
= make_node (NONTYPE_ARGUMENT_PACK
);
11129 TREE_TYPE (pack
) = TREE_TYPE (elt
);
11130 TREE_CONSTANT (pack
) = 1;
11132 SET_ARGUMENT_PACK_ARGS (pack
, vec
);
11136 /* Return an exact copy of template args T that can be modified
11140 copy_template_args (tree t
)
11142 if (t
== error_mark_node
)
11145 int len
= TREE_VEC_LENGTH (t
);
11146 tree new_vec
= make_tree_vec (len
);
11148 for (int i
= 0; i
< len
; ++i
)
11150 tree elt
= TREE_VEC_ELT (t
, i
);
11151 if (elt
&& TREE_CODE (elt
) == TREE_VEC
)
11152 elt
= copy_template_args (elt
);
11153 TREE_VEC_ELT (new_vec
, i
) = elt
;
11156 NON_DEFAULT_TEMPLATE_ARGS_COUNT (new_vec
)
11157 = NON_DEFAULT_TEMPLATE_ARGS_COUNT (t
);
11162 /* Substitute ARGS into the vector or list of template arguments T. */
11165 tsubst_template_args (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
11168 int len
, need_new
= 0, i
, expanded_len_adjust
= 0, out
;
11171 if (t
== error_mark_node
)
11172 return error_mark_node
;
11174 len
= TREE_VEC_LENGTH (t
);
11175 elts
= XALLOCAVEC (tree
, len
);
11177 for (i
= 0; i
< len
; i
++)
11179 tree orig_arg
= TREE_VEC_ELT (t
, i
);
11182 if (TREE_CODE (orig_arg
) == TREE_VEC
)
11183 new_arg
= tsubst_template_args (orig_arg
, args
, complain
, in_decl
);
11184 else if (PACK_EXPANSION_P (orig_arg
))
11186 /* Substitute into an expansion expression. */
11187 new_arg
= tsubst_pack_expansion (orig_arg
, args
, complain
, in_decl
);
11189 if (TREE_CODE (new_arg
) == TREE_VEC
)
11190 /* Add to the expanded length adjustment the number of
11191 expanded arguments. We subtract one from this
11192 measurement, because the argument pack expression
11193 itself is already counted as 1 in
11194 LEN. EXPANDED_LEN_ADJUST can actually be negative, if
11195 the argument pack is empty. */
11196 expanded_len_adjust
+= TREE_VEC_LENGTH (new_arg
) - 1;
11198 else if (ARGUMENT_PACK_P (orig_arg
))
11200 /* Substitute into each of the arguments. */
11201 new_arg
= TYPE_P (orig_arg
)
11202 ? cxx_make_type (TREE_CODE (orig_arg
))
11203 : make_node (TREE_CODE (orig_arg
));
11205 SET_ARGUMENT_PACK_ARGS (
11207 tsubst_template_args (ARGUMENT_PACK_ARGS (orig_arg
),
11208 args
, complain
, in_decl
));
11210 if (ARGUMENT_PACK_ARGS (new_arg
) == error_mark_node
)
11211 new_arg
= error_mark_node
;
11213 if (TREE_CODE (new_arg
) == NONTYPE_ARGUMENT_PACK
) {
11214 TREE_TYPE (new_arg
) = tsubst (TREE_TYPE (orig_arg
), args
,
11215 complain
, in_decl
);
11216 TREE_CONSTANT (new_arg
) = TREE_CONSTANT (orig_arg
);
11218 if (TREE_TYPE (new_arg
) == error_mark_node
)
11219 new_arg
= error_mark_node
;
11223 new_arg
= tsubst_template_arg (orig_arg
, args
, complain
, in_decl
);
11225 if (new_arg
== error_mark_node
)
11226 return error_mark_node
;
11229 if (new_arg
!= orig_arg
)
11236 /* Make space for the expanded arguments coming from template
11238 t
= make_tree_vec (len
+ expanded_len_adjust
);
11239 /* ORIG_T can contain TREE_VECs. That happens if ORIG_T contains the
11240 arguments for a member template.
11241 In that case each TREE_VEC in ORIG_T represents a level of template
11242 arguments, and ORIG_T won't carry any non defaulted argument count.
11243 It will rather be the nested TREE_VECs that will carry one.
11244 In other words, ORIG_T carries a non defaulted argument count only
11245 if it doesn't contain any nested TREE_VEC. */
11246 if (NON_DEFAULT_TEMPLATE_ARGS_COUNT (orig_t
))
11248 int count
= GET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (orig_t
);
11249 count
+= expanded_len_adjust
;
11250 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (t
, count
);
11252 for (i
= 0, out
= 0; i
< len
; i
++)
11254 if ((PACK_EXPANSION_P (TREE_VEC_ELT (orig_t
, i
))
11255 || ARGUMENT_PACK_P (TREE_VEC_ELT (orig_t
, i
)))
11256 && TREE_CODE (elts
[i
]) == TREE_VEC
)
11260 /* Now expand the template argument pack "in place". */
11261 for (idx
= 0; idx
< TREE_VEC_LENGTH (elts
[i
]); idx
++, out
++)
11262 TREE_VEC_ELT (t
, out
) = TREE_VEC_ELT (elts
[i
], idx
);
11266 TREE_VEC_ELT (t
, out
) = elts
[i
];
11274 /* Return the result of substituting ARGS into the template parameters
11275 given by PARMS. If there are m levels of ARGS and m + n levels of
11276 PARMS, then the result will contain n levels of PARMS. For
11277 example, if PARMS is `template <class T> template <class U>
11278 template <T*, U, class V>' and ARGS is {{int}, {double}} then the
11279 result will be `template <int*, double, class V>'. */
11282 tsubst_template_parms (tree parms
, tree args
, tsubst_flags_t complain
)
11284 tree r
= NULL_TREE
;
11287 /* When substituting into a template, we must set
11288 PROCESSING_TEMPLATE_DECL as the template parameters may be
11289 dependent if they are based on one-another, and the dependency
11290 predicates are short-circuit outside of templates. */
11291 ++processing_template_decl
;
11293 for (new_parms
= &r
;
11294 parms
&& TMPL_PARMS_DEPTH (parms
) > TMPL_ARGS_DEPTH (args
);
11295 new_parms
= &(TREE_CHAIN (*new_parms
)),
11296 parms
= TREE_CHAIN (parms
))
11299 make_tree_vec (TREE_VEC_LENGTH (TREE_VALUE (parms
)));
11302 for (i
= 0; i
< TREE_VEC_LENGTH (new_vec
); ++i
)
11306 if (parms
== error_mark_node
)
11309 tuple
= TREE_VEC_ELT (TREE_VALUE (parms
), i
);
11311 if (tuple
== error_mark_node
)
11314 TREE_VEC_ELT (new_vec
, i
) =
11315 tsubst_template_parm (tuple
, args
, complain
);
11319 tree_cons (size_int (TMPL_PARMS_DEPTH (parms
)
11320 - TMPL_ARGS_DEPTH (args
)),
11321 new_vec
, NULL_TREE
);
11324 --processing_template_decl
;
11329 /* Return the result of substituting ARGS into one template parameter
11330 given by T. T Must be a TREE_LIST which TREE_VALUE is the template
11331 parameter and which TREE_PURPOSE is the default argument of the
11332 template parameter. */
11335 tsubst_template_parm (tree t
, tree args
, tsubst_flags_t complain
)
11337 tree default_value
, parm_decl
;
11339 if (args
== NULL_TREE
11341 || t
== error_mark_node
)
11344 gcc_assert (TREE_CODE (t
) == TREE_LIST
);
11346 default_value
= TREE_PURPOSE (t
);
11347 parm_decl
= TREE_VALUE (t
);
11349 parm_decl
= tsubst (parm_decl
, args
, complain
, NULL_TREE
);
11350 if (TREE_CODE (parm_decl
) == PARM_DECL
11351 && invalid_nontype_parm_type_p (TREE_TYPE (parm_decl
), complain
))
11352 parm_decl
= error_mark_node
;
11353 default_value
= tsubst_template_arg (default_value
, args
,
11354 complain
, NULL_TREE
);
11356 return build_tree_list (default_value
, parm_decl
);
11359 /* Substitute the ARGS into the indicated aggregate (or enumeration)
11360 type T. If T is not an aggregate or enumeration type, it is
11361 handled as if by tsubst. IN_DECL is as for tsubst. If
11362 ENTERING_SCOPE is nonzero, T is the context for a template which
11363 we are presently tsubst'ing. Return the substituted value. */
11366 tsubst_aggr_type (tree t
,
11368 tsubst_flags_t complain
,
11370 int entering_scope
)
11372 if (t
== NULL_TREE
)
11375 switch (TREE_CODE (t
))
11378 if (TYPE_PTRMEMFUNC_P (t
))
11379 return tsubst (TYPE_PTRMEMFUNC_FN_TYPE (t
), args
, complain
, in_decl
);
11381 /* Else fall through. */
11382 case ENUMERAL_TYPE
:
11384 if (TYPE_TEMPLATE_INFO (t
) && uses_template_parms (t
))
11389 int saved_unevaluated_operand
;
11390 int saved_inhibit_evaluation_warnings
;
11392 /* In "sizeof(X<I>)" we need to evaluate "I". */
11393 saved_unevaluated_operand
= cp_unevaluated_operand
;
11394 cp_unevaluated_operand
= 0;
11395 saved_inhibit_evaluation_warnings
= c_inhibit_evaluation_warnings
;
11396 c_inhibit_evaluation_warnings
= 0;
11398 /* First, determine the context for the type we are looking
11400 context
= TYPE_CONTEXT (t
);
11401 if (context
&& TYPE_P (context
))
11403 context
= tsubst_aggr_type (context
, args
, complain
,
11404 in_decl
, /*entering_scope=*/1);
11405 /* If context is a nested class inside a class template,
11406 it may still need to be instantiated (c++/33959). */
11407 context
= complete_type (context
);
11410 /* Then, figure out what arguments are appropriate for the
11411 type we are trying to find. For example, given:
11413 template <class T> struct S;
11414 template <class T, class U> void f(T, U) { S<U> su; }
11416 and supposing that we are instantiating f<int, double>,
11417 then our ARGS will be {int, double}, but, when looking up
11418 S we only want {double}. */
11419 argvec
= tsubst_template_args (TYPE_TI_ARGS (t
), args
,
11420 complain
, in_decl
);
11421 if (argvec
== error_mark_node
)
11422 r
= error_mark_node
;
11425 r
= lookup_template_class (t
, argvec
, in_decl
, context
,
11426 entering_scope
, complain
);
11427 r
= cp_build_qualified_type_real (r
, cp_type_quals (t
), complain
);
11430 cp_unevaluated_operand
= saved_unevaluated_operand
;
11431 c_inhibit_evaluation_warnings
= saved_inhibit_evaluation_warnings
;
11436 /* This is not a template type, so there's nothing to do. */
11440 return tsubst (t
, args
, complain
, in_decl
);
11444 /* Substitute into the default argument ARG (a default argument for
11445 FN), which has the indicated TYPE. */
11448 tsubst_default_argument (tree fn
, tree type
, tree arg
, tsubst_flags_t complain
)
11450 tree saved_class_ptr
= NULL_TREE
;
11451 tree saved_class_ref
= NULL_TREE
;
11452 int errs
= errorcount
+ sorrycount
;
11454 /* This can happen in invalid code. */
11455 if (TREE_CODE (arg
) == DEFAULT_ARG
)
11458 /* This default argument came from a template. Instantiate the
11459 default argument here, not in tsubst. In the case of
11468 we must be careful to do name lookup in the scope of S<T>,
11469 rather than in the current class. */
11470 push_access_scope (fn
);
11471 /* The "this" pointer is not valid in a default argument. */
11474 saved_class_ptr
= current_class_ptr
;
11475 cp_function_chain
->x_current_class_ptr
= NULL_TREE
;
11476 saved_class_ref
= current_class_ref
;
11477 cp_function_chain
->x_current_class_ref
= NULL_TREE
;
11480 push_deferring_access_checks(dk_no_deferred
);
11481 /* The default argument expression may cause implicitly defined
11482 member functions to be synthesized, which will result in garbage
11483 collection. We must treat this situation as if we were within
11484 the body of function so as to avoid collecting live data on the
11487 arg
= tsubst_expr (arg
, DECL_TI_ARGS (fn
),
11488 complain
, NULL_TREE
,
11489 /*integral_constant_expression_p=*/false);
11491 pop_deferring_access_checks();
11493 /* Restore the "this" pointer. */
11496 cp_function_chain
->x_current_class_ptr
= saved_class_ptr
;
11497 cp_function_chain
->x_current_class_ref
= saved_class_ref
;
11500 if (errorcount
+sorrycount
> errs
11501 && (complain
& tf_warning_or_error
))
11502 inform (input_location
,
11503 " when instantiating default argument for call to %D", fn
);
11505 /* Make sure the default argument is reasonable. */
11506 arg
= check_default_argument (type
, arg
, complain
);
11508 pop_access_scope (fn
);
11513 /* Substitute into all the default arguments for FN. */
11516 tsubst_default_arguments (tree fn
, tsubst_flags_t complain
)
11521 tmpl_args
= DECL_TI_ARGS (fn
);
11523 /* If this function is not yet instantiated, we certainly don't need
11524 its default arguments. */
11525 if (uses_template_parms (tmpl_args
))
11527 /* Don't do this again for clones. */
11528 if (DECL_CLONED_FUNCTION_P (fn
))
11531 for (arg
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
11533 arg
= TREE_CHAIN (arg
))
11534 if (TREE_PURPOSE (arg
))
11535 TREE_PURPOSE (arg
) = tsubst_default_argument (fn
,
11537 TREE_PURPOSE (arg
),
11541 /* Substitute the ARGS into the T, which is a _DECL. Return the
11542 result of the substitution. Issue error and warning messages under
11543 control of COMPLAIN. */
11546 tsubst_decl (tree t
, tree args
, tsubst_flags_t complain
)
11548 #define RETURN(EXP) do { r = (EXP); goto out; } while(0)
11549 location_t saved_loc
;
11550 tree r
= NULL_TREE
;
11552 hashval_t hash
= 0;
11554 /* Set the filename and linenumber to improve error-reporting. */
11555 saved_loc
= input_location
;
11556 input_location
= DECL_SOURCE_LOCATION (t
);
11558 switch (TREE_CODE (t
))
11560 case TEMPLATE_DECL
:
11562 /* We can get here when processing a member function template,
11563 member class template, or template template parameter. */
11564 tree decl
= DECL_TEMPLATE_RESULT (t
);
11569 if (DECL_TEMPLATE_TEMPLATE_PARM_P (t
))
11571 /* Template template parameter is treated here. */
11572 tree new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
11573 if (new_type
== error_mark_node
)
11574 r
= error_mark_node
;
11575 /* If we get a real template back, return it. This can happen in
11576 the context of most_specialized_partial_spec. */
11577 else if (TREE_CODE (new_type
) == TEMPLATE_DECL
)
11580 /* The new TEMPLATE_DECL was built in
11581 reduce_template_parm_level. */
11582 r
= TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL (new_type
);
11586 /* We might already have an instance of this template.
11587 The ARGS are for the surrounding class type, so the
11588 full args contain the tsubst'd args for the context,
11589 plus the innermost args from the template decl. */
11590 tmpl_args
= DECL_CLASS_TEMPLATE_P (t
)
11591 ? CLASSTYPE_TI_ARGS (TREE_TYPE (t
))
11592 : DECL_TI_ARGS (DECL_TEMPLATE_RESULT (t
));
11593 /* Because this is a template, the arguments will still be
11594 dependent, even after substitution. If
11595 PROCESSING_TEMPLATE_DECL is not set, the dependency
11596 predicates will short-circuit. */
11597 ++processing_template_decl
;
11598 full_args
= tsubst_template_args (tmpl_args
, args
,
11599 complain
, in_decl
);
11600 --processing_template_decl
;
11601 if (full_args
== error_mark_node
)
11602 RETURN (error_mark_node
);
11604 /* If this is a default template template argument,
11605 tsubst might not have changed anything. */
11606 if (full_args
== tmpl_args
)
11609 hash
= hash_tmpl_and_args (t
, full_args
);
11610 spec
= retrieve_specialization (t
, full_args
, hash
);
11611 if (spec
!= NULL_TREE
)
11617 /* Make a new template decl. It will be similar to the
11618 original, but will record the current template arguments.
11619 We also create a new function declaration, which is just
11620 like the old one, but points to this new template, rather
11621 than the old one. */
11623 gcc_assert (DECL_LANG_SPECIFIC (r
) != 0);
11624 DECL_CHAIN (r
) = NULL_TREE
;
11626 // Build new template info linking to the original template decl.
11627 DECL_TEMPLATE_INFO (r
) = build_template_info (t
, args
);
11629 if (TREE_CODE (decl
) == TYPE_DECL
11630 && !TYPE_DECL_ALIAS_P (decl
))
11633 ++processing_template_decl
;
11634 new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
11635 --processing_template_decl
;
11636 if (new_type
== error_mark_node
)
11637 RETURN (error_mark_node
);
11639 TREE_TYPE (r
) = new_type
;
11640 /* For a partial specialization, we need to keep pointing to
11641 the primary template. */
11642 if (!DECL_TEMPLATE_SPECIALIZATION (t
))
11643 CLASSTYPE_TI_TEMPLATE (new_type
) = r
;
11644 DECL_TEMPLATE_RESULT (r
) = TYPE_MAIN_DECL (new_type
);
11645 DECL_TI_ARGS (r
) = CLASSTYPE_TI_ARGS (new_type
);
11646 DECL_CONTEXT (r
) = TYPE_CONTEXT (new_type
);
11651 ++processing_template_decl
;
11652 new_decl
= tsubst (decl
, args
, complain
, in_decl
);
11653 --processing_template_decl
;
11654 if (new_decl
== error_mark_node
)
11655 RETURN (error_mark_node
);
11657 DECL_TEMPLATE_RESULT (r
) = new_decl
;
11658 DECL_TI_TEMPLATE (new_decl
) = r
;
11659 TREE_TYPE (r
) = TREE_TYPE (new_decl
);
11660 DECL_TI_ARGS (r
) = DECL_TI_ARGS (new_decl
);
11661 DECL_CONTEXT (r
) = DECL_CONTEXT (new_decl
);
11664 SET_DECL_IMPLICIT_INSTANTIATION (r
);
11665 DECL_TEMPLATE_INSTANTIATIONS (r
) = NULL_TREE
;
11666 DECL_TEMPLATE_SPECIALIZATIONS (r
) = NULL_TREE
;
11668 /* The template parameters for this new template are all the
11669 template parameters for the old template, except the
11670 outermost level of parameters. */
11671 DECL_TEMPLATE_PARMS (r
)
11672 = tsubst_template_parms (DECL_TEMPLATE_PARMS (t
), args
,
11675 if (PRIMARY_TEMPLATE_P (t
))
11676 DECL_PRIMARY_TEMPLATE (r
) = r
;
11678 if (TREE_CODE (decl
) != TYPE_DECL
&& !VAR_P (decl
))
11679 /* Record this non-type partial instantiation. */
11680 register_specialization (r
, t
,
11681 DECL_TI_ARGS (DECL_TEMPLATE_RESULT (r
)),
11686 case FUNCTION_DECL
:
11689 tree argvec
= NULL_TREE
;
11697 /* Nobody should be tsubst'ing into non-template functions. */
11698 gcc_assert (DECL_TEMPLATE_INFO (t
) != NULL_TREE
);
11700 if (TREE_CODE (DECL_TI_TEMPLATE (t
)) == TEMPLATE_DECL
)
11705 /* If T is not dependent, just return it. We have to
11706 increment PROCESSING_TEMPLATE_DECL because
11707 value_dependent_expression_p assumes that nothing is
11708 dependent when PROCESSING_TEMPLATE_DECL is zero. */
11709 ++processing_template_decl
;
11710 dependent_p
= value_dependent_expression_p (t
);
11711 --processing_template_decl
;
11715 /* Calculate the most general template of which R is a
11716 specialization, and the complete set of arguments used to
11718 gen_tmpl
= most_general_template (DECL_TI_TEMPLATE (t
));
11719 argvec
= tsubst_template_args (DECL_TI_ARGS
11720 (DECL_TEMPLATE_RESULT
11721 (DECL_TI_TEMPLATE (t
))),
11722 args
, complain
, in_decl
);
11723 if (argvec
== error_mark_node
)
11724 RETURN (error_mark_node
);
11726 /* Check to see if we already have this specialization. */
11727 hash
= hash_tmpl_and_args (gen_tmpl
, argvec
);
11728 spec
= retrieve_specialization (gen_tmpl
, argvec
, hash
);
11736 /* We can see more levels of arguments than parameters if
11737 there was a specialization of a member template, like
11740 template <class T> struct S { template <class U> void f(); }
11741 template <> template <class U> void S<int>::f(U);
11743 Here, we'll be substituting into the specialization,
11744 because that's where we can find the code we actually
11745 want to generate, but we'll have enough arguments for
11746 the most general template.
11748 We also deal with the peculiar case:
11750 template <class T> struct S {
11751 template <class U> friend void f();
11753 template <class U> void f() {}
11755 template void f<double>();
11757 Here, the ARGS for the instantiation of will be {int,
11758 double}. But, we only need as many ARGS as there are
11759 levels of template parameters in CODE_PATTERN. We are
11760 careful not to get fooled into reducing the ARGS in
11763 template <class T> struct S { template <class U> void f(U); }
11764 template <class T> template <> void S<T>::f(int) {}
11766 which we can spot because the pattern will be a
11767 specialization in this case. */
11768 args_depth
= TMPL_ARGS_DEPTH (args
);
11770 TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (DECL_TI_TEMPLATE (t
)));
11771 if (args_depth
> parms_depth
11772 && !DECL_TEMPLATE_SPECIALIZATION (t
))
11773 args
= get_innermost_template_args (args
, parms_depth
);
11777 /* This special case arises when we have something like this:
11779 template <class T> struct S {
11780 friend void f<int>(int, double);
11783 Here, the DECL_TI_TEMPLATE for the friend declaration
11784 will be an IDENTIFIER_NODE. We are being called from
11785 tsubst_friend_function, and we want only to create a
11786 new decl (R) with appropriate types so that we can call
11787 determine_specialization. */
11788 gen_tmpl
= NULL_TREE
;
11791 if (DECL_CLASS_SCOPE_P (t
))
11793 if (DECL_NAME (t
) == constructor_name (DECL_CONTEXT (t
)))
11797 ctx
= tsubst_aggr_type (DECL_CONTEXT (t
), args
,
11798 complain
, t
, /*entering_scope=*/1);
11803 ctx
= DECL_CONTEXT (t
);
11805 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
11806 if (type
== error_mark_node
)
11807 RETURN (error_mark_node
);
11809 /* If we hit excessive deduction depth, the type is bogus even if
11810 it isn't error_mark_node, so don't build a decl. */
11811 if (excessive_deduction_depth
)
11812 RETURN (error_mark_node
);
11814 /* We do NOT check for matching decls pushed separately at this
11815 point, as they may not represent instantiations of this
11816 template, and in any case are considered separate under the
11819 DECL_USE_TEMPLATE (r
) = 0;
11820 TREE_TYPE (r
) = type
;
11821 /* Clear out the mangled name and RTL for the instantiation. */
11822 SET_DECL_ASSEMBLER_NAME (r
, NULL_TREE
);
11823 SET_DECL_RTL (r
, NULL
);
11824 /* Leave DECL_INITIAL set on deleted instantiations. */
11825 if (!DECL_DELETED_FN (r
))
11826 DECL_INITIAL (r
) = NULL_TREE
;
11827 DECL_CONTEXT (r
) = ctx
;
11829 /* OpenMP UDRs have the only argument a reference to the declared
11830 type. We want to diagnose if the declared type is a reference,
11831 which is invalid, but as references to references are usually
11832 quietly merged, diagnose it here. */
11833 if (DECL_OMP_DECLARE_REDUCTION_P (t
))
11836 = TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (t
))));
11837 argtype
= tsubst (argtype
, args
, complain
, in_decl
);
11838 if (TREE_CODE (argtype
) == REFERENCE_TYPE
)
11839 error_at (DECL_SOURCE_LOCATION (t
),
11840 "reference type %qT in "
11841 "%<#pragma omp declare reduction%>", argtype
);
11842 if (strchr (IDENTIFIER_POINTER (DECL_NAME (t
)), '~') == NULL
)
11843 DECL_NAME (r
) = omp_reduction_id (ERROR_MARK
, DECL_NAME (t
),
11847 if (member
&& DECL_CONV_FN_P (r
))
11848 /* Type-conversion operator. Reconstruct the name, in
11849 case it's the name of one of the template's parameters. */
11850 DECL_NAME (r
) = mangle_conv_op_name_for_type (TREE_TYPE (type
));
11852 DECL_ARGUMENTS (r
) = tsubst (DECL_ARGUMENTS (t
), args
,
11854 DECL_RESULT (r
) = NULL_TREE
;
11856 TREE_STATIC (r
) = 0;
11857 TREE_PUBLIC (r
) = TREE_PUBLIC (t
);
11858 DECL_EXTERNAL (r
) = 1;
11859 /* If this is an instantiation of a function with internal
11860 linkage, we already know what object file linkage will be
11861 assigned to the instantiation. */
11862 DECL_INTERFACE_KNOWN (r
) = !TREE_PUBLIC (r
);
11863 DECL_DEFER_OUTPUT (r
) = 0;
11864 DECL_CHAIN (r
) = NULL_TREE
;
11865 DECL_PENDING_INLINE_INFO (r
) = 0;
11866 DECL_PENDING_INLINE_P (r
) = 0;
11867 DECL_SAVED_TREE (r
) = NULL_TREE
;
11868 DECL_STRUCT_FUNCTION (r
) = NULL
;
11870 /* We'll re-clone as appropriate in instantiate_template. */
11871 DECL_CLONED_FUNCTION (r
) = NULL_TREE
;
11873 /* If we aren't complaining now, return on error before we register
11874 the specialization so that we'll complain eventually. */
11875 if ((complain
& tf_error
) == 0
11876 && IDENTIFIER_OPNAME_P (DECL_NAME (r
))
11877 && !grok_op_properties (r
, /*complain=*/false))
11878 RETURN (error_mark_node
);
11880 /* When instantiating a constrained member, substitute
11881 into the constraints to create a new constraint. */
11882 if (tree ci
= get_constraints (t
))
11885 ci
= tsubst_constraint_info (ci
, argvec
, complain
, NULL_TREE
);
11886 set_constraints (r
, ci
);
11889 /* Set up the DECL_TEMPLATE_INFO for R. There's no need to do
11890 this in the special friend case mentioned above where
11891 GEN_TMPL is NULL. */
11894 DECL_TEMPLATE_INFO (r
)
11895 = build_template_info (gen_tmpl
, argvec
);
11896 SET_DECL_IMPLICIT_INSTANTIATION (r
);
11899 = register_specialization (r
, gen_tmpl
, argvec
, false, hash
);
11901 /* We instantiated this while substituting into
11902 the type earlier (template/friend54.C). */
11905 /* We're not supposed to instantiate default arguments
11906 until they are called, for a template. But, for a
11909 template <class T> void f ()
11910 { extern void g(int i = T()); }
11912 we should do the substitution when the template is
11913 instantiated. We handle the member function case in
11914 instantiate_class_template since the default arguments
11915 might refer to other members of the class. */
11917 && !PRIMARY_TEMPLATE_P (gen_tmpl
)
11918 && !uses_template_parms (argvec
))
11919 tsubst_default_arguments (r
, complain
);
11922 DECL_TEMPLATE_INFO (r
) = NULL_TREE
;
11924 /* Copy the list of befriending classes. */
11925 for (friends
= &DECL_BEFRIENDING_CLASSES (r
);
11927 friends
= &TREE_CHAIN (*friends
))
11929 *friends
= copy_node (*friends
);
11930 TREE_VALUE (*friends
) = tsubst (TREE_VALUE (*friends
),
11935 if (DECL_CONSTRUCTOR_P (r
) || DECL_DESTRUCTOR_P (r
))
11937 maybe_retrofit_in_chrg (r
);
11938 if (DECL_CONSTRUCTOR_P (r
))
11939 grok_ctor_properties (ctx
, r
);
11940 if (DECL_INHERITED_CTOR_BASE (r
))
11941 deduce_inheriting_ctor (r
);
11942 /* If this is an instantiation of a member template, clone it.
11943 If it isn't, that'll be handled by
11944 clone_constructors_and_destructors. */
11945 if (PRIMARY_TEMPLATE_P (gen_tmpl
))
11946 clone_function_decl (r
, /*update_method_vec_p=*/0);
11948 else if ((complain
& tf_error
) != 0
11949 && IDENTIFIER_OPNAME_P (DECL_NAME (r
))
11950 && !grok_op_properties (r
, /*complain=*/true))
11951 RETURN (error_mark_node
);
11953 if (DECL_FRIEND_P (t
) && DECL_FRIEND_CONTEXT (t
))
11954 SET_DECL_FRIEND_CONTEXT (r
,
11955 tsubst (DECL_FRIEND_CONTEXT (t
),
11956 args
, complain
, in_decl
));
11958 /* Possibly limit visibility based on template args. */
11959 DECL_VISIBILITY (r
) = VISIBILITY_DEFAULT
;
11960 if (DECL_VISIBILITY_SPECIFIED (t
))
11962 DECL_VISIBILITY_SPECIFIED (r
) = 0;
11963 DECL_ATTRIBUTES (r
)
11964 = remove_attribute ("visibility", DECL_ATTRIBUTES (r
));
11966 determine_visibility (r
);
11967 if (DECL_DEFAULTED_OUTSIDE_CLASS_P (r
)
11968 && !processing_template_decl
)
11969 defaulted_late_check (r
);
11971 apply_late_template_attributes (&r
, DECL_ATTRIBUTES (r
), 0,
11972 args
, complain
, in_decl
);
11978 tree type
= NULL_TREE
;
11980 tree expanded_types
= NULL_TREE
;
11981 tree prev_r
= NULL_TREE
;
11982 tree first_r
= NULL_TREE
;
11984 if (DECL_PACK_P (t
))
11986 /* If there is a local specialization that isn't a
11987 parameter pack, it means that we're doing a "simple"
11988 substitution from inside tsubst_pack_expansion. Just
11989 return the local specialization (which will be a single
11991 tree spec
= retrieve_local_specialization (t
);
11993 && TREE_CODE (spec
) == PARM_DECL
11994 && TREE_CODE (TREE_TYPE (spec
)) != TYPE_PACK_EXPANSION
)
11997 /* Expand the TYPE_PACK_EXPANSION that provides the types for
11998 the parameters in this function parameter pack. */
11999 expanded_types
= tsubst_pack_expansion (TREE_TYPE (t
), args
,
12000 complain
, in_decl
);
12001 if (TREE_CODE (expanded_types
) == TREE_VEC
)
12003 len
= TREE_VEC_LENGTH (expanded_types
);
12005 /* Zero-length parameter packs are boring. Just substitute
12008 RETURN (tsubst (TREE_CHAIN (t
), args
, complain
,
12013 /* All we did was update the type. Make a note of that. */
12014 type
= expanded_types
;
12015 expanded_types
= NULL_TREE
;
12019 /* Loop through all of the parameters we'll build. When T is
12020 a function parameter pack, LEN is the number of expanded
12021 types in EXPANDED_TYPES; otherwise, LEN is 1. */
12023 for (i
= 0; i
< len
; ++i
)
12027 if (DECL_TEMPLATE_PARM_P (t
))
12028 SET_DECL_TEMPLATE_PARM_P (r
);
12030 if (expanded_types
)
12031 /* We're on the Ith parameter of the function parameter
12034 /* Get the Ith type. */
12035 type
= TREE_VEC_ELT (expanded_types
, i
);
12037 /* Rename the parameter to include the index. */
12039 = make_ith_pack_parameter_name (DECL_NAME (r
), i
);
12042 /* We're dealing with a normal parameter. */
12043 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
12045 type
= type_decays_to (type
);
12046 TREE_TYPE (r
) = type
;
12047 cp_apply_type_quals_to_decl (cp_type_quals (type
), r
);
12049 if (DECL_INITIAL (r
))
12051 if (TREE_CODE (DECL_INITIAL (r
)) != TEMPLATE_PARM_INDEX
)
12052 DECL_INITIAL (r
) = TREE_TYPE (r
);
12054 DECL_INITIAL (r
) = tsubst (DECL_INITIAL (r
), args
,
12055 complain
, in_decl
);
12058 DECL_CONTEXT (r
) = NULL_TREE
;
12060 if (!DECL_TEMPLATE_PARM_P (r
))
12061 DECL_ARG_TYPE (r
) = type_passed_as (type
);
12063 apply_late_template_attributes (&r
, DECL_ATTRIBUTES (r
), 0,
12064 args
, complain
, in_decl
);
12066 /* Keep track of the first new parameter we
12067 generate. That's what will be returned to the
12072 /* Build a proper chain of parameters when substituting
12073 into a function parameter pack. */
12075 DECL_CHAIN (prev_r
) = r
;
12078 /* If cp_unevaluated_operand is set, we're just looking for a
12079 single dummy parameter, so don't keep going. */
12080 if (DECL_CHAIN (t
) && !cp_unevaluated_operand
)
12081 DECL_CHAIN (r
) = tsubst (DECL_CHAIN (t
), args
,
12082 complain
, DECL_CHAIN (t
));
12084 /* FIRST_R contains the start of the chain we've built. */
12091 tree type
= NULL_TREE
;
12092 tree vec
= NULL_TREE
;
12093 tree expanded_types
= NULL_TREE
;
12096 if (PACK_EXPANSION_P (TREE_TYPE (t
)))
12098 /* This field is a lambda capture pack. Return a TREE_VEC of
12099 the expanded fields to instantiate_class_template_1 and
12100 store them in the specializations hash table as a
12101 NONTYPE_ARGUMENT_PACK so that tsubst_copy can find them. */
12102 expanded_types
= tsubst_pack_expansion (TREE_TYPE (t
), args
,
12103 complain
, in_decl
);
12104 if (TREE_CODE (expanded_types
) == TREE_VEC
)
12106 len
= TREE_VEC_LENGTH (expanded_types
);
12107 vec
= make_tree_vec (len
);
12111 /* All we did was update the type. Make a note of that. */
12112 type
= expanded_types
;
12113 expanded_types
= NULL_TREE
;
12117 for (int i
= 0; i
< len
; ++i
)
12120 if (expanded_types
)
12122 type
= TREE_VEC_ELT (expanded_types
, i
);
12124 = make_ith_pack_parameter_name (DECL_NAME (r
), i
);
12127 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
12129 if (type
== error_mark_node
)
12130 RETURN (error_mark_node
);
12131 TREE_TYPE (r
) = type
;
12132 cp_apply_type_quals_to_decl (cp_type_quals (type
), r
);
12134 if (DECL_C_BIT_FIELD (r
))
12135 /* For bit-fields, DECL_INITIAL gives the number of bits. For
12136 non-bit-fields DECL_INITIAL is a non-static data member
12137 initializer, which gets deferred instantiation. */
12139 = tsubst_expr (DECL_INITIAL (t
), args
,
12141 /*integral_constant_expression_p=*/true);
12142 else if (DECL_INITIAL (t
))
12144 /* Set up DECL_TEMPLATE_INFO so that we can get at the
12145 NSDMI in perform_member_init. Still set DECL_INITIAL
12146 so that we know there is one. */
12147 DECL_INITIAL (r
) = void_node
;
12148 gcc_assert (DECL_LANG_SPECIFIC (r
) == NULL
);
12149 retrofit_lang_decl (r
);
12150 DECL_TEMPLATE_INFO (r
) = build_template_info (t
, args
);
12152 /* We don't have to set DECL_CONTEXT here; it is set by
12153 finish_member_declaration. */
12154 DECL_CHAIN (r
) = NULL_TREE
;
12156 apply_late_template_attributes (&r
, DECL_ATTRIBUTES (r
), 0,
12157 args
, complain
, in_decl
);
12160 TREE_VEC_ELT (vec
, i
) = r
;
12166 tree pack
= make_node (NONTYPE_ARGUMENT_PACK
);
12167 tree tpack
= cxx_make_type (TYPE_ARGUMENT_PACK
);
12168 SET_ARGUMENT_PACK_ARGS (pack
, vec
);
12169 SET_ARGUMENT_PACK_ARGS (tpack
, expanded_types
);
12170 TREE_TYPE (pack
) = tpack
;
12171 register_specialization (pack
, t
, args
, false, 0);
12177 /* We reach here only for member using decls. We also need to check
12178 uses_template_parms because DECL_DEPENDENT_P is not set for a
12179 using-declaration that designates a member of the current
12180 instantiation (c++/53549). */
12181 if (DECL_DEPENDENT_P (t
)
12182 || uses_template_parms (USING_DECL_SCOPE (t
)))
12184 tree inst_scope
= tsubst_copy (USING_DECL_SCOPE (t
), args
,
12185 complain
, in_decl
);
12186 tree name
= tsubst_copy (DECL_NAME (t
), args
, complain
, in_decl
);
12187 r
= do_class_using_decl (inst_scope
, name
);
12189 r
= error_mark_node
;
12192 TREE_PROTECTED (r
) = TREE_PROTECTED (t
);
12193 TREE_PRIVATE (r
) = TREE_PRIVATE (t
);
12199 DECL_CHAIN (r
) = NULL_TREE
;
12206 tree argvec
= NULL_TREE
;
12207 tree gen_tmpl
= NULL_TREE
;
12209 tree tmpl
= NULL_TREE
;
12211 tree type
= NULL_TREE
;
12214 if (TREE_TYPE (t
) == error_mark_node
)
12215 RETURN (error_mark_node
);
12217 if (TREE_CODE (t
) == TYPE_DECL
12218 && t
== TYPE_MAIN_DECL (TREE_TYPE (t
)))
12220 /* If this is the canonical decl, we don't have to
12221 mess with instantiations, and often we can't (for
12222 typename, template type parms and such). Note that
12223 TYPE_NAME is not correct for the above test if
12224 we've copied the type for a typedef. */
12225 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
12226 if (type
== error_mark_node
)
12227 RETURN (error_mark_node
);
12228 r
= TYPE_NAME (type
);
12232 /* Check to see if we already have the specialization we
12235 if (DECL_CLASS_SCOPE_P (t
) || DECL_NAMESPACE_SCOPE_P (t
))
12237 /* T is a static data member or namespace-scope entity.
12238 We have to substitute into namespace-scope variables
12239 (not just variable templates) because of cases like:
12241 template <class T> void f() { extern T t; }
12243 where the entity referenced is not known until
12244 instantiation time. */
12246 ctx
= DECL_CONTEXT (t
);
12247 if (DECL_CLASS_SCOPE_P (t
))
12249 ctx
= tsubst_aggr_type (ctx
, args
,
12251 in_decl
, /*entering_scope=*/1);
12252 /* If CTX is unchanged, then T is in fact the
12253 specialization we want. That situation occurs when
12254 referencing a static data member within in its own
12255 class. We can use pointer equality, rather than
12256 same_type_p, because DECL_CONTEXT is always
12258 if (ctx
== DECL_CONTEXT (t
)
12259 /* ... unless T is a member template; in which
12260 case our caller can be willing to create a
12261 specialization of that template represented
12263 && !(DECL_TI_TEMPLATE (t
)
12264 && DECL_MEMBER_TEMPLATE_P (DECL_TI_TEMPLATE (t
))))
12270 tmpl
= DECL_TI_TEMPLATE (t
);
12271 gen_tmpl
= most_general_template (tmpl
);
12272 argvec
= tsubst (DECL_TI_ARGS (t
), args
, complain
, in_decl
);
12273 if (argvec
!= error_mark_node
)
12274 argvec
= (coerce_innermost_template_parms
12275 (DECL_TEMPLATE_PARMS (gen_tmpl
),
12276 argvec
, t
, complain
,
12277 /*all*/true, /*defarg*/true));
12278 if (argvec
== error_mark_node
)
12279 RETURN (error_mark_node
);
12280 hash
= hash_tmpl_and_args (gen_tmpl
, argvec
);
12281 spec
= retrieve_specialization (gen_tmpl
, argvec
, hash
);
12286 /* A local variable. */
12288 /* Subsequent calls to pushdecl will fill this in. */
12290 spec
= retrieve_local_specialization (t
);
12292 /* If we already have the specialization we need, there is
12293 nothing more to do. */
12300 /* Create a new node for the specialization we need. */
12302 if (type
== NULL_TREE
)
12304 if (is_typedef_decl (t
))
12305 type
= DECL_ORIGINAL_TYPE (t
);
12307 type
= TREE_TYPE (t
);
12309 && VAR_HAD_UNKNOWN_BOUND (t
)
12310 && type
!= error_mark_node
)
12311 type
= strip_array_domain (type
);
12312 type
= tsubst (type
, args
, complain
, in_decl
);
12316 /* Even if the original location is out of scope, the
12317 newly substituted one is not. */
12318 DECL_DEAD_FOR_LOCAL (r
) = 0;
12319 DECL_INITIALIZED_P (r
) = 0;
12320 DECL_TEMPLATE_INSTANTIATED (r
) = 0;
12321 if (type
== error_mark_node
)
12322 RETURN (error_mark_node
);
12323 if (TREE_CODE (type
) == FUNCTION_TYPE
)
12325 /* It may seem that this case cannot occur, since:
12330 declares a function, not a variable. However:
12333 template <typename T> void g() { T t; }
12334 template void g<f>();
12336 is an attempt to declare a variable with function
12338 error ("variable %qD has function type",
12339 /* R is not yet sufficiently initialized, so we
12340 just use its name. */
12342 RETURN (error_mark_node
);
12344 type
= complete_type (type
);
12345 /* Wait until cp_finish_decl to set this again, to handle
12346 circular dependency (template/instantiate6.C). */
12347 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (r
) = 0;
12348 type
= check_var_type (DECL_NAME (r
), type
);
12350 if (DECL_HAS_VALUE_EXPR_P (t
))
12352 tree ve
= DECL_VALUE_EXPR (t
);
12353 ve
= tsubst_expr (ve
, args
, complain
, in_decl
,
12354 /*constant_expression_p=*/false);
12355 if (REFERENCE_REF_P (ve
))
12357 gcc_assert (TREE_CODE (type
) == REFERENCE_TYPE
);
12358 ve
= TREE_OPERAND (ve
, 0);
12360 SET_DECL_VALUE_EXPR (r
, ve
);
12362 if (CP_DECL_THREAD_LOCAL_P (r
)
12363 && !processing_template_decl
)
12364 set_decl_tls_model (r
, decl_default_tls_model (r
));
12366 else if (DECL_SELF_REFERENCE_P (t
))
12367 SET_DECL_SELF_REFERENCE_P (r
);
12368 TREE_TYPE (r
) = type
;
12369 cp_apply_type_quals_to_decl (cp_type_quals (type
), r
);
12370 DECL_CONTEXT (r
) = ctx
;
12371 /* Clear out the mangled name and RTL for the instantiation. */
12372 SET_DECL_ASSEMBLER_NAME (r
, NULL_TREE
);
12373 if (CODE_CONTAINS_STRUCT (TREE_CODE (t
), TS_DECL_WRTL
))
12374 SET_DECL_RTL (r
, NULL
);
12375 /* The initializer must not be expanded until it is required;
12376 see [temp.inst]. */
12377 DECL_INITIAL (r
) = NULL_TREE
;
12379 DECL_MODE (r
) = VOIDmode
;
12380 if (CODE_CONTAINS_STRUCT (TREE_CODE (t
), TS_DECL_WRTL
))
12381 SET_DECL_RTL (r
, NULL
);
12382 DECL_SIZE (r
) = DECL_SIZE_UNIT (r
) = 0;
12385 /* Possibly limit visibility based on template args. */
12386 DECL_VISIBILITY (r
) = VISIBILITY_DEFAULT
;
12387 if (DECL_VISIBILITY_SPECIFIED (t
))
12389 DECL_VISIBILITY_SPECIFIED (r
) = 0;
12390 DECL_ATTRIBUTES (r
)
12391 = remove_attribute ("visibility", DECL_ATTRIBUTES (r
));
12393 determine_visibility (r
);
12398 /* A static data member declaration is always marked
12399 external when it is declared in-class, even if an
12400 initializer is present. We mimic the non-template
12401 processing here. */
12402 DECL_EXTERNAL (r
) = 1;
12403 if (DECL_NAMESPACE_SCOPE_P (t
))
12404 DECL_NOT_REALLY_EXTERN (r
) = 1;
12406 DECL_TEMPLATE_INFO (r
) = build_template_info (tmpl
, argvec
);
12407 SET_DECL_IMPLICIT_INSTANTIATION (r
);
12408 register_specialization (r
, gen_tmpl
, argvec
, false, hash
);
12412 if (DECL_LANG_SPECIFIC (r
))
12413 DECL_TEMPLATE_INFO (r
) = NULL_TREE
;
12414 if (!cp_unevaluated_operand
)
12415 register_local_specialization (r
, t
);
12418 DECL_CHAIN (r
) = NULL_TREE
;
12420 apply_late_template_attributes (&r
, DECL_ATTRIBUTES (r
),
12422 args
, complain
, in_decl
);
12424 /* Preserve a typedef that names a type. */
12425 if (is_typedef_decl (r
))
12427 DECL_ORIGINAL_TYPE (r
) = NULL_TREE
;
12428 set_underlying_type (r
);
12429 if (TYPE_DECL_ALIAS_P (r
) && type
!= error_mark_node
)
12430 /* An alias template specialization can be dependent
12431 even if its underlying type is not. */
12432 TYPE_DEPENDENT_P_VALID (TREE_TYPE (r
)) = false;
12435 layout_decl (r
, 0);
12440 gcc_unreachable ();
12445 /* Restore the file and line information. */
12446 input_location
= saved_loc
;
12451 /* Substitute into the ARG_TYPES of a function type.
12452 If END is a TREE_CHAIN, leave it and any following types
12456 tsubst_arg_types (tree arg_types
,
12459 tsubst_flags_t complain
,
12462 tree remaining_arg_types
;
12463 tree type
= NULL_TREE
;
12465 tree expanded_args
= NULL_TREE
;
12468 if (!arg_types
|| arg_types
== void_list_node
|| arg_types
== end
)
12471 remaining_arg_types
= tsubst_arg_types (TREE_CHAIN (arg_types
),
12472 args
, end
, complain
, in_decl
);
12473 if (remaining_arg_types
== error_mark_node
)
12474 return error_mark_node
;
12476 if (PACK_EXPANSION_P (TREE_VALUE (arg_types
)))
12478 /* For a pack expansion, perform substitution on the
12479 entire expression. Later on, we'll handle the arguments
12481 expanded_args
= tsubst_pack_expansion (TREE_VALUE (arg_types
),
12482 args
, complain
, in_decl
);
12484 if (TREE_CODE (expanded_args
) == TREE_VEC
)
12485 /* So that we'll spin through the parameters, one by one. */
12486 i
= TREE_VEC_LENGTH (expanded_args
);
12489 /* We only partially substituted into the parameter
12490 pack. Our type is TYPE_PACK_EXPANSION. */
12491 type
= expanded_args
;
12492 expanded_args
= NULL_TREE
;
12500 type
= TREE_VEC_ELT (expanded_args
, i
);
12502 type
= tsubst (TREE_VALUE (arg_types
), args
, complain
, in_decl
);
12504 if (type
== error_mark_node
)
12505 return error_mark_node
;
12506 if (VOID_TYPE_P (type
))
12508 if (complain
& tf_error
)
12510 error ("invalid parameter type %qT", type
);
12512 error ("in declaration %q+D", in_decl
);
12514 return error_mark_node
;
12517 if (abstract_virtuals_error_sfinae (ACU_PARM
, type
, complain
))
12518 return error_mark_node
;
12520 /* Do array-to-pointer, function-to-pointer conversion, and ignore
12521 top-level qualifiers as required. */
12522 type
= cv_unqualified (type_decays_to (type
));
12524 /* We do not substitute into default arguments here. The standard
12525 mandates that they be instantiated only when needed, which is
12526 done in build_over_call. */
12527 default_arg
= TREE_PURPOSE (arg_types
);
12529 if (default_arg
&& TREE_CODE (default_arg
) == DEFAULT_ARG
)
12531 /* We've instantiated a template before its default arguments
12532 have been parsed. This can happen for a nested template
12533 class, and is not an error unless we require the default
12534 argument in a call of this function. */
12535 remaining_arg_types
=
12536 tree_cons (default_arg
, type
, remaining_arg_types
);
12537 vec_safe_push (DEFARG_INSTANTIATIONS(default_arg
), remaining_arg_types
);
12540 remaining_arg_types
=
12541 hash_tree_cons (default_arg
, type
, remaining_arg_types
);
12544 return remaining_arg_types
;
12547 /* Substitute into a FUNCTION_TYPE or METHOD_TYPE. This routine does
12548 *not* handle the exception-specification for FNTYPE, because the
12549 initial substitution of explicitly provided template parameters
12550 during argument deduction forbids substitution into the
12551 exception-specification:
12555 All references in the function type of the function template to the
12556 corresponding template parameters are replaced by the specified tem-
12557 plate argument values. If a substitution in a template parameter or
12558 in the function type of the function template results in an invalid
12559 type, type deduction fails. [Note: The equivalent substitution in
12560 exception specifications is done only when the function is instanti-
12561 ated, at which point a program is ill-formed if the substitution
12562 results in an invalid type.] */
12565 tsubst_function_type (tree t
,
12567 tsubst_flags_t complain
,
12571 tree arg_types
= NULL_TREE
;
12574 /* The TYPE_CONTEXT is not used for function/method types. */
12575 gcc_assert (TYPE_CONTEXT (t
) == NULL_TREE
);
12577 /* DR 1227: Mixing immediate and non-immediate contexts in deduction
12579 bool late_return_type_p
= TYPE_HAS_LATE_RETURN_TYPE (t
);
12581 if (late_return_type_p
)
12583 /* Substitute the argument types. */
12584 arg_types
= tsubst_arg_types (TYPE_ARG_TYPES (t
), args
, NULL_TREE
,
12585 complain
, in_decl
);
12586 if (arg_types
== error_mark_node
)
12587 return error_mark_node
;
12589 tree save_ccp
= current_class_ptr
;
12590 tree save_ccr
= current_class_ref
;
12591 tree this_type
= (TREE_CODE (t
) == METHOD_TYPE
12592 ? TREE_TYPE (TREE_VALUE (arg_types
)) : NULL_TREE
);
12593 bool do_inject
= this_type
&& CLASS_TYPE_P (this_type
);
12596 /* DR 1207: 'this' is in scope in the trailing return type. */
12597 inject_this_parameter (this_type
, cp_type_quals (this_type
));
12600 /* Substitute the return type. */
12601 return_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
12605 current_class_ptr
= save_ccp
;
12606 current_class_ref
= save_ccr
;
12610 /* Substitute the return type. */
12611 return_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
12613 if (return_type
== error_mark_node
)
12614 return error_mark_node
;
12615 /* DR 486 clarifies that creation of a function type with an
12616 invalid return type is a deduction failure. */
12617 if (TREE_CODE (return_type
) == ARRAY_TYPE
12618 || TREE_CODE (return_type
) == FUNCTION_TYPE
)
12620 if (complain
& tf_error
)
12622 if (TREE_CODE (return_type
) == ARRAY_TYPE
)
12623 error ("function returning an array");
12625 error ("function returning a function");
12627 return error_mark_node
;
12630 if (abstract_virtuals_error_sfinae (ACU_RETURN
, return_type
, complain
))
12631 return error_mark_node
;
12633 if (!late_return_type_p
)
12635 /* Substitute the argument types. */
12636 arg_types
= tsubst_arg_types (TYPE_ARG_TYPES (t
), args
, NULL_TREE
,
12637 complain
, in_decl
);
12638 if (arg_types
== error_mark_node
)
12639 return error_mark_node
;
12642 /* Construct a new type node and return it. */
12643 if (TREE_CODE (t
) == FUNCTION_TYPE
)
12645 fntype
= build_function_type (return_type
, arg_types
);
12646 fntype
= apply_memfn_quals (fntype
,
12647 type_memfn_quals (t
),
12648 type_memfn_rqual (t
));
12652 tree r
= TREE_TYPE (TREE_VALUE (arg_types
));
12653 /* Don't pick up extra function qualifiers from the basetype. */
12654 r
= cp_build_qualified_type_real (r
, type_memfn_quals (t
), complain
);
12655 if (! MAYBE_CLASS_TYPE_P (r
))
12659 Type deduction may fail for any of the following
12662 -- Attempting to create "pointer to member of T" when T
12663 is not a class type. */
12664 if (complain
& tf_error
)
12665 error ("creating pointer to member function of non-class type %qT",
12667 return error_mark_node
;
12670 fntype
= build_method_type_directly (r
, return_type
,
12671 TREE_CHAIN (arg_types
));
12672 fntype
= build_ref_qualified_type (fntype
, type_memfn_rqual (t
));
12674 fntype
= cp_build_type_attribute_variant (fntype
, TYPE_ATTRIBUTES (t
));
12676 if (late_return_type_p
)
12677 TYPE_HAS_LATE_RETURN_TYPE (fntype
) = 1;
12682 /* FNTYPE is a FUNCTION_TYPE or METHOD_TYPE. Substitute the template
12683 ARGS into that specification, and return the substituted
12684 specification. If there is no specification, return NULL_TREE. */
12687 tsubst_exception_specification (tree fntype
,
12689 tsubst_flags_t complain
,
12696 specs
= TYPE_RAISES_EXCEPTIONS (fntype
);
12697 new_specs
= NULL_TREE
;
12698 if (specs
&& TREE_PURPOSE (specs
))
12700 /* A noexcept-specifier. */
12701 tree expr
= TREE_PURPOSE (specs
);
12702 if (TREE_CODE (expr
) == INTEGER_CST
)
12706 /* Defer instantiation of noexcept-specifiers to avoid
12707 excessive instantiations (c++/49107). */
12708 new_specs
= make_node (DEFERRED_NOEXCEPT
);
12709 if (DEFERRED_NOEXCEPT_SPEC_P (specs
))
12711 /* We already partially instantiated this member template,
12712 so combine the new args with the old. */
12713 DEFERRED_NOEXCEPT_PATTERN (new_specs
)
12714 = DEFERRED_NOEXCEPT_PATTERN (expr
);
12715 DEFERRED_NOEXCEPT_ARGS (new_specs
)
12716 = add_to_template_args (DEFERRED_NOEXCEPT_ARGS (expr
), args
);
12720 DEFERRED_NOEXCEPT_PATTERN (new_specs
) = expr
;
12721 DEFERRED_NOEXCEPT_ARGS (new_specs
) = args
;
12725 new_specs
= tsubst_copy_and_build
12726 (expr
, args
, complain
, in_decl
, /*function_p=*/false,
12727 /*integral_constant_expression_p=*/true);
12728 new_specs
= build_noexcept_spec (new_specs
, complain
);
12732 if (! TREE_VALUE (specs
))
12739 tree expanded_specs
= NULL_TREE
;
12741 if (PACK_EXPANSION_P (TREE_VALUE (specs
)))
12743 /* Expand the pack expansion type. */
12744 expanded_specs
= tsubst_pack_expansion (TREE_VALUE (specs
),
12748 if (expanded_specs
== error_mark_node
)
12749 return error_mark_node
;
12750 else if (TREE_CODE (expanded_specs
) == TREE_VEC
)
12751 len
= TREE_VEC_LENGTH (expanded_specs
);
12754 /* We're substituting into a member template, so
12755 we got a TYPE_PACK_EXPANSION back. Add that
12756 expansion and move on. */
12757 gcc_assert (TREE_CODE (expanded_specs
)
12758 == TYPE_PACK_EXPANSION
);
12759 new_specs
= add_exception_specifier (new_specs
,
12762 specs
= TREE_CHAIN (specs
);
12767 for (i
= 0; i
< len
; ++i
)
12769 if (expanded_specs
)
12770 spec
= TREE_VEC_ELT (expanded_specs
, i
);
12772 spec
= tsubst (TREE_VALUE (specs
), args
, complain
, in_decl
);
12773 if (spec
== error_mark_node
)
12775 new_specs
= add_exception_specifier (new_specs
, spec
,
12779 specs
= TREE_CHAIN (specs
);
12785 /* Take the tree structure T and replace template parameters used
12786 therein with the argument vector ARGS. IN_DECL is an associated
12787 decl for diagnostics. If an error occurs, returns ERROR_MARK_NODE.
12788 Issue error and warning messages under control of COMPLAIN. Note
12789 that we must be relatively non-tolerant of extensions here, in
12790 order to preserve conformance; if we allow substitutions that
12791 should not be allowed, we may allow argument deductions that should
12792 not succeed, and therefore report ambiguous overload situations
12793 where there are none. In theory, we could allow the substitution,
12794 but indicate that it should have failed, and allow our caller to
12795 make sure that the right thing happens, but we don't try to do this
12798 This function is used for dealing with types, decls and the like;
12799 for expressions, use tsubst_expr or tsubst_copy. */
12802 tsubst (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
12804 enum tree_code code
;
12805 tree type
, r
= NULL_TREE
;
12807 if (t
== NULL_TREE
|| t
== error_mark_node
12808 || t
== integer_type_node
12809 || t
== void_type_node
12810 || t
== char_type_node
12811 || t
== unknown_type_node
12812 || TREE_CODE (t
) == NAMESPACE_DECL
12813 || TREE_CODE (t
) == TRANSLATION_UNIT_DECL
)
12817 return tsubst_decl (t
, args
, complain
);
12819 if (args
== NULL_TREE
)
12822 code
= TREE_CODE (t
);
12824 if (code
== IDENTIFIER_NODE
)
12825 type
= IDENTIFIER_TYPE_VALUE (t
);
12827 type
= TREE_TYPE (t
);
12829 gcc_assert (type
!= unknown_type_node
);
12831 /* Reuse typedefs. We need to do this to handle dependent attributes,
12832 such as attribute aligned. */
12834 && typedef_variant_p (t
))
12836 tree decl
= TYPE_NAME (t
);
12838 if (alias_template_specialization_p (t
))
12840 /* DECL represents an alias template and we want to
12842 tree tmpl
= most_general_template (DECL_TI_TEMPLATE (decl
));
12843 tree gen_args
= tsubst (DECL_TI_ARGS (decl
), args
, complain
, in_decl
);
12844 r
= instantiate_alias_template (tmpl
, gen_args
, complain
);
12846 else if (DECL_CLASS_SCOPE_P (decl
)
12847 && CLASSTYPE_TEMPLATE_INFO (DECL_CONTEXT (decl
))
12848 && uses_template_parms (DECL_CONTEXT (decl
)))
12850 tree tmpl
= most_general_template (DECL_TI_TEMPLATE (decl
));
12851 tree gen_args
= tsubst (DECL_TI_ARGS (decl
), args
, complain
, in_decl
);
12852 r
= retrieve_specialization (tmpl
, gen_args
, 0);
12854 else if (DECL_FUNCTION_SCOPE_P (decl
)
12855 && DECL_TEMPLATE_INFO (DECL_CONTEXT (decl
))
12856 && uses_template_parms (DECL_TI_ARGS (DECL_CONTEXT (decl
))))
12857 r
= retrieve_local_specialization (decl
);
12859 /* The typedef is from a non-template context. */
12865 r
= cp_build_qualified_type_real
12866 (r
, cp_type_quals (t
) | cp_type_quals (r
),
12867 complain
| tf_ignore_bad_quals
);
12872 /* We don't have an instantiation yet, so drop the typedef. */
12873 int quals
= cp_type_quals (t
);
12874 t
= DECL_ORIGINAL_TYPE (decl
);
12875 t
= cp_build_qualified_type_real (t
, quals
,
12876 complain
| tf_ignore_bad_quals
);
12881 && code
!= TYPENAME_TYPE
12882 && code
!= TEMPLATE_TYPE_PARM
12883 && code
!= IDENTIFIER_NODE
12884 && code
!= FUNCTION_TYPE
12885 && code
!= METHOD_TYPE
)
12886 type
= tsubst (type
, args
, complain
, in_decl
);
12887 if (type
== error_mark_node
)
12888 return error_mark_node
;
12894 case ENUMERAL_TYPE
:
12895 return tsubst_aggr_type (t
, args
, complain
, in_decl
,
12896 /*entering_scope=*/0);
12899 case IDENTIFIER_NODE
:
12910 if (t
== integer_type_node
)
12913 if (TREE_CODE (TYPE_MIN_VALUE (t
)) == INTEGER_CST
12914 && TREE_CODE (TYPE_MAX_VALUE (t
)) == INTEGER_CST
)
12918 tree max
, omax
= TREE_OPERAND (TYPE_MAX_VALUE (t
), 0);
12920 max
= tsubst_expr (omax
, args
, complain
, in_decl
,
12921 /*integral_constant_expression_p=*/false);
12923 /* Fix up type of the magic NOP_EXPR with TREE_SIDE_EFFECTS if
12925 if (TREE_CODE (max
) == NOP_EXPR
12926 && TREE_SIDE_EFFECTS (omax
)
12927 && !TREE_TYPE (max
))
12928 TREE_TYPE (max
) = TREE_TYPE (TREE_OPERAND (max
, 0));
12930 /* If we're in a partial instantiation, preserve the magic NOP_EXPR
12931 with TREE_SIDE_EFFECTS that indicates this is not an integral
12932 constant expression. */
12933 if (processing_template_decl
12934 && TREE_SIDE_EFFECTS (omax
) && TREE_CODE (omax
) == NOP_EXPR
)
12936 gcc_assert (TREE_CODE (max
) == NOP_EXPR
);
12937 TREE_SIDE_EFFECTS (max
) = 1;
12940 return compute_array_index_type (NULL_TREE
, max
, complain
);
12943 case TEMPLATE_TYPE_PARM
:
12944 case TEMPLATE_TEMPLATE_PARM
:
12945 case BOUND_TEMPLATE_TEMPLATE_PARM
:
12946 case TEMPLATE_PARM_INDEX
:
12951 tree arg
= NULL_TREE
;
12953 /* Early in template argument deduction substitution, we don't
12954 want to reduce the level of 'auto', or it will be confused
12955 with a normal template parm in subsequent deduction. */
12956 if (is_auto (t
) && (complain
& tf_partial
))
12961 gcc_assert (TREE_VEC_LENGTH (args
) > 0);
12962 template_parm_level_and_index (t
, &level
, &idx
);
12964 levels
= TMPL_ARGS_DEPTH (args
);
12965 if (level
<= levels
12966 && TREE_VEC_LENGTH (TMPL_ARGS_LEVEL (args
, level
)) > 0)
12968 arg
= TMPL_ARG (args
, level
, idx
);
12970 if (arg
&& TREE_CODE (arg
) == ARGUMENT_PACK_SELECT
)
12972 /* See through ARGUMENT_PACK_SELECT arguments. */
12973 arg
= ARGUMENT_PACK_SELECT_ARG (arg
);
12974 /* If the selected argument is an expansion E, that most
12975 likely means we were called from
12976 gen_elem_of_pack_expansion_instantiation during the
12977 substituting of pack an argument pack (which Ith
12978 element is a pack expansion, where I is
12979 ARGUMENT_PACK_SELECT_INDEX) into a pack expansion.
12980 In this case, the Ith element resulting from this
12981 substituting is going to be a pack expansion, which
12982 pattern is the pattern of E. Let's return the
12984 gen_elem_of_pack_expansion_instantiation will
12985 build the resulting pack expansion from it. */
12986 if (PACK_EXPANSION_P (arg
))
12988 /* Make sure we aren't throwing away arg info. */
12989 gcc_assert (!PACK_EXPANSION_EXTRA_ARGS (arg
));
12990 arg
= PACK_EXPANSION_PATTERN (arg
);
12995 if (arg
== error_mark_node
)
12996 return error_mark_node
;
12997 else if (arg
!= NULL_TREE
)
12999 if (ARGUMENT_PACK_P (arg
))
13000 /* If ARG is an argument pack, we don't actually want to
13001 perform a substitution here, because substitutions
13002 for argument packs are only done
13003 element-by-element. We can get to this point when
13004 substituting the type of a non-type template
13005 parameter pack, when that type actually contains
13006 template parameter packs from an outer template, e.g.,
13008 template<typename... Types> struct A {
13009 template<Types... Values> struct B { };
13013 if (code
== TEMPLATE_TYPE_PARM
)
13016 gcc_assert (TYPE_P (arg
));
13018 quals
= cp_type_quals (arg
) | cp_type_quals (t
);
13020 return cp_build_qualified_type_real
13021 (arg
, quals
, complain
| tf_ignore_bad_quals
);
13023 else if (code
== BOUND_TEMPLATE_TEMPLATE_PARM
)
13025 /* We are processing a type constructed from a
13026 template template parameter. */
13027 tree argvec
= tsubst (TYPE_TI_ARGS (t
),
13028 args
, complain
, in_decl
);
13029 if (argvec
== error_mark_node
)
13030 return error_mark_node
;
13032 gcc_assert (TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
13033 || TREE_CODE (arg
) == TEMPLATE_DECL
13034 || TREE_CODE (arg
) == UNBOUND_CLASS_TEMPLATE
);
13036 if (TREE_CODE (arg
) == UNBOUND_CLASS_TEMPLATE
)
13037 /* Consider this code:
13039 template <template <class> class Template>
13041 template <class Arg> using Bind = Template<Arg>;
13044 template <template <class> class Template, class Arg>
13045 using Instantiate = Template<Arg>; //#0
13047 template <template <class> class Template,
13050 Instantiate<Internal<Template>::template Bind,
13053 When #1 is parsed, the
13054 BOUND_TEMPLATE_TEMPLATE_PARM representing the
13055 parameter `Template' in #0 matches the
13056 UNBOUND_CLASS_TEMPLATE representing the argument
13057 `Internal<Template>::template Bind'; We then want
13058 to assemble the type `Bind<Argument>' that can't
13059 be fully created right now, because
13060 `Internal<Template>' not being complete, the Bind
13061 template cannot be looked up in that context. So
13062 we need to "store" `Bind<Argument>' for later
13063 when the context of Bind becomes complete. Let's
13064 store that in a TYPENAME_TYPE. */
13065 return make_typename_type (TYPE_CONTEXT (arg
),
13066 build_nt (TEMPLATE_ID_EXPR
,
13067 TYPE_IDENTIFIER (arg
),
13072 /* We can get a TEMPLATE_TEMPLATE_PARM here when we
13073 are resolving nested-types in the signature of a
13074 member function templates. Otherwise ARG is a
13075 TEMPLATE_DECL and is the real template to be
13077 if (TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
)
13078 arg
= TYPE_NAME (arg
);
13080 r
= lookup_template_class (arg
,
13082 DECL_CONTEXT (arg
),
13083 /*entering_scope=*/0,
13085 return cp_build_qualified_type_real
13086 (r
, cp_type_quals (t
) | cp_type_quals (r
), complain
);
13089 /* TEMPLATE_TEMPLATE_PARM or TEMPLATE_PARM_INDEX. */
13090 return convert_from_reference (unshare_expr (arg
));
13094 /* This can happen during the attempted tsubst'ing in
13095 unify. This means that we don't yet have any information
13096 about the template parameter in question. */
13099 /* If we get here, we must have been looking at a parm for a
13100 more deeply nested template. Make a new version of this
13101 template parameter, but with a lower level. */
13104 case TEMPLATE_TYPE_PARM
:
13105 case TEMPLATE_TEMPLATE_PARM
:
13106 case BOUND_TEMPLATE_TEMPLATE_PARM
:
13107 if (cp_type_quals (t
))
13109 r
= tsubst (TYPE_MAIN_VARIANT (t
), args
, complain
, in_decl
);
13110 r
= cp_build_qualified_type_real
13111 (r
, cp_type_quals (t
),
13112 complain
| (code
== TEMPLATE_TYPE_PARM
13113 ? tf_ignore_bad_quals
: 0));
13115 else if (TREE_CODE (t
) == TEMPLATE_TYPE_PARM
13116 && PLACEHOLDER_TYPE_CONSTRAINTS (t
)
13117 && (r
= (TEMPLATE_PARM_DESCENDANTS
13118 (TEMPLATE_TYPE_PARM_INDEX (t
))))
13119 && (r
= TREE_TYPE (r
))
13120 && !PLACEHOLDER_TYPE_CONSTRAINTS (r
))
13121 /* Break infinite recursion when substituting the constraints
13122 of a constrained placeholder. */;
13126 TEMPLATE_TYPE_PARM_INDEX (r
)
13127 = reduce_template_parm_level (TEMPLATE_TYPE_PARM_INDEX (t
),
13128 r
, levels
, args
, complain
);
13129 TYPE_STUB_DECL (r
) = TYPE_NAME (r
) = TEMPLATE_TYPE_DECL (r
);
13130 TYPE_MAIN_VARIANT (r
) = r
;
13131 TYPE_POINTER_TO (r
) = NULL_TREE
;
13132 TYPE_REFERENCE_TO (r
) = NULL_TREE
;
13134 /* Propagate constraints on placeholders. */
13135 if (TREE_CODE (t
) == TEMPLATE_TYPE_PARM
)
13136 if (tree constr
= PLACEHOLDER_TYPE_CONSTRAINTS (t
))
13137 PLACEHOLDER_TYPE_CONSTRAINTS (r
)
13138 = tsubst_constraint (constr
, args
, complain
, in_decl
);
13140 if (TREE_CODE (r
) == TEMPLATE_TEMPLATE_PARM
)
13141 /* We have reduced the level of the template
13142 template parameter, but not the levels of its
13143 template parameters, so canonical_type_parameter
13144 will not be able to find the canonical template
13145 template parameter for this level. Thus, we
13146 require structural equality checking to compare
13147 TEMPLATE_TEMPLATE_PARMs. */
13148 SET_TYPE_STRUCTURAL_EQUALITY (r
);
13149 else if (TYPE_STRUCTURAL_EQUALITY_P (t
))
13150 SET_TYPE_STRUCTURAL_EQUALITY (r
);
13152 TYPE_CANONICAL (r
) = canonical_type_parameter (r
);
13154 if (code
== BOUND_TEMPLATE_TEMPLATE_PARM
)
13156 tree argvec
= tsubst (TYPE_TI_ARGS (t
), args
,
13157 complain
, in_decl
);
13158 if (argvec
== error_mark_node
)
13159 return error_mark_node
;
13161 TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (r
)
13162 = build_template_info (TYPE_TI_TEMPLATE (t
), argvec
);
13167 case TEMPLATE_PARM_INDEX
:
13168 r
= reduce_template_parm_level (t
, type
, levels
, args
, complain
);
13172 gcc_unreachable ();
13180 tree purpose
, value
, chain
;
13182 if (t
== void_list_node
)
13185 purpose
= TREE_PURPOSE (t
);
13188 purpose
= tsubst (purpose
, args
, complain
, in_decl
);
13189 if (purpose
== error_mark_node
)
13190 return error_mark_node
;
13192 value
= TREE_VALUE (t
);
13195 value
= tsubst (value
, args
, complain
, in_decl
);
13196 if (value
== error_mark_node
)
13197 return error_mark_node
;
13199 chain
= TREE_CHAIN (t
);
13200 if (chain
&& chain
!= void_type_node
)
13202 chain
= tsubst (chain
, args
, complain
, in_decl
);
13203 if (chain
== error_mark_node
)
13204 return error_mark_node
;
13206 if (purpose
== TREE_PURPOSE (t
)
13207 && value
== TREE_VALUE (t
)
13208 && chain
== TREE_CHAIN (t
))
13210 return hash_tree_cons (purpose
, value
, chain
);
13214 /* We should never be tsubsting a binfo. */
13215 gcc_unreachable ();
13218 /* A vector of template arguments. */
13219 gcc_assert (!type
);
13220 return tsubst_template_args (t
, args
, complain
, in_decl
);
13223 case REFERENCE_TYPE
:
13225 if (type
== TREE_TYPE (t
) && TREE_CODE (type
) != METHOD_TYPE
)
13230 Type deduction may fail for any of the following
13233 -- Attempting to create a pointer to reference type.
13234 -- Attempting to create a reference to a reference type or
13235 a reference to void.
13237 Core issue 106 says that creating a reference to a reference
13238 during instantiation is no longer a cause for failure. We
13239 only enforce this check in strict C++98 mode. */
13240 if ((TREE_CODE (type
) == REFERENCE_TYPE
13241 && (((cxx_dialect
== cxx98
) && flag_iso
) || code
!= REFERENCE_TYPE
))
13242 || (code
== REFERENCE_TYPE
&& VOID_TYPE_P (type
)))
13244 static location_t last_loc
;
13246 /* We keep track of the last time we issued this error
13247 message to avoid spewing a ton of messages during a
13248 single bad template instantiation. */
13249 if (complain
& tf_error
13250 && last_loc
!= input_location
)
13252 if (VOID_TYPE_P (type
))
13253 error ("forming reference to void");
13254 else if (code
== POINTER_TYPE
)
13255 error ("forming pointer to reference type %qT", type
);
13257 error ("forming reference to reference type %qT", type
);
13258 last_loc
= input_location
;
13261 return error_mark_node
;
13263 else if (TREE_CODE (type
) == FUNCTION_TYPE
13264 && (type_memfn_quals (type
) != TYPE_UNQUALIFIED
13265 || type_memfn_rqual (type
) != REF_QUAL_NONE
))
13267 if (complain
& tf_error
)
13269 if (code
== POINTER_TYPE
)
13270 error ("forming pointer to qualified function type %qT",
13273 error ("forming reference to qualified function type %qT",
13276 return error_mark_node
;
13278 else if (code
== POINTER_TYPE
)
13280 r
= build_pointer_type (type
);
13281 if (TREE_CODE (type
) == METHOD_TYPE
)
13282 r
= build_ptrmemfunc_type (r
);
13284 else if (TREE_CODE (type
) == REFERENCE_TYPE
)
13285 /* In C++0x, during template argument substitution, when there is an
13286 attempt to create a reference to a reference type, reference
13287 collapsing is applied as described in [14.3.1/4 temp.arg.type]:
13289 "If a template-argument for a template-parameter T names a type
13290 that is a reference to a type A, an attempt to create the type
13291 'lvalue reference to cv T' creates the type 'lvalue reference to
13292 A,' while an attempt to create the type type rvalue reference to
13293 cv T' creates the type T"
13295 r
= cp_build_reference_type
13297 TYPE_REF_IS_RVALUE (t
) && TYPE_REF_IS_RVALUE (type
));
13299 r
= cp_build_reference_type (type
, TYPE_REF_IS_RVALUE (t
));
13300 r
= cp_build_qualified_type_real (r
, cp_type_quals (t
), complain
);
13302 if (r
!= error_mark_node
)
13303 /* Will this ever be needed for TYPE_..._TO values? */
13310 r
= tsubst (TYPE_OFFSET_BASETYPE (t
), args
, complain
, in_decl
);
13311 if (r
== error_mark_node
|| !MAYBE_CLASS_TYPE_P (r
))
13315 Type deduction may fail for any of the following
13318 -- Attempting to create "pointer to member of T" when T
13319 is not a class type. */
13320 if (complain
& tf_error
)
13321 error ("creating pointer to member of non-class type %qT", r
);
13322 return error_mark_node
;
13324 if (TREE_CODE (type
) == REFERENCE_TYPE
)
13326 if (complain
& tf_error
)
13327 error ("creating pointer to member reference type %qT", type
);
13328 return error_mark_node
;
13330 if (VOID_TYPE_P (type
))
13332 if (complain
& tf_error
)
13333 error ("creating pointer to member of type void");
13334 return error_mark_node
;
13336 gcc_assert (TREE_CODE (type
) != METHOD_TYPE
);
13337 if (TREE_CODE (type
) == FUNCTION_TYPE
)
13339 /* The type of the implicit object parameter gets its
13340 cv-qualifiers from the FUNCTION_TYPE. */
13343 = build_memfn_type (type
, r
, type_memfn_quals (type
),
13344 type_memfn_rqual (type
));
13345 memptr
= build_ptrmemfunc_type (build_pointer_type (method_type
));
13346 return cp_build_qualified_type_real (memptr
, cp_type_quals (t
),
13350 return cp_build_qualified_type_real (build_ptrmem_type (r
, type
),
13354 case FUNCTION_TYPE
:
13359 fntype
= tsubst_function_type (t
, args
, complain
, in_decl
);
13360 if (fntype
== error_mark_node
)
13361 return error_mark_node
;
13363 /* Substitute the exception specification. */
13364 specs
= tsubst_exception_specification (t
, args
, complain
,
13365 in_decl
, /*defer_ok*/true);
13366 if (specs
== error_mark_node
)
13367 return error_mark_node
;
13369 fntype
= build_exception_variant (fntype
, specs
);
13374 tree domain
= tsubst (TYPE_DOMAIN (t
), args
, complain
, in_decl
);
13375 if (domain
== error_mark_node
)
13376 return error_mark_node
;
13378 /* As an optimization, we avoid regenerating the array type if
13379 it will obviously be the same as T. */
13380 if (type
== TREE_TYPE (t
) && domain
== TYPE_DOMAIN (t
))
13383 /* These checks should match the ones in create_array_type_for_decl.
13387 The deduction may fail for any of the following reasons:
13389 -- Attempting to create an array with an element type that
13390 is void, a function type, or a reference type, or [DR337]
13391 an abstract class type. */
13392 if (VOID_TYPE_P (type
)
13393 || TREE_CODE (type
) == FUNCTION_TYPE
13394 || (TREE_CODE (type
) == ARRAY_TYPE
13395 && TYPE_DOMAIN (type
) == NULL_TREE
)
13396 || TREE_CODE (type
) == REFERENCE_TYPE
)
13398 if (complain
& tf_error
)
13399 error ("creating array of %qT", type
);
13400 return error_mark_node
;
13403 if (abstract_virtuals_error_sfinae (ACU_ARRAY
, type
, complain
))
13404 return error_mark_node
;
13406 r
= build_cplus_array_type (type
, domain
);
13408 if (TYPE_USER_ALIGN (t
))
13410 TYPE_ALIGN (r
) = TYPE_ALIGN (t
);
13411 TYPE_USER_ALIGN (r
) = 1;
13417 case TYPENAME_TYPE
:
13419 tree ctx
= tsubst_aggr_type (TYPE_CONTEXT (t
), args
, complain
,
13420 in_decl
, /*entering_scope=*/1);
13421 tree f
= tsubst_copy (TYPENAME_TYPE_FULLNAME (t
), args
,
13422 complain
, in_decl
);
13424 if (ctx
== error_mark_node
|| f
== error_mark_node
)
13425 return error_mark_node
;
13427 if (!MAYBE_CLASS_TYPE_P (ctx
))
13429 if (complain
& tf_error
)
13430 error ("%qT is not a class, struct, or union type", ctx
);
13431 return error_mark_node
;
13433 else if (!uses_template_parms (ctx
) && !TYPE_BEING_DEFINED (ctx
))
13435 /* Normally, make_typename_type does not require that the CTX
13436 have complete type in order to allow things like:
13438 template <class T> struct S { typename S<T>::X Y; };
13440 But, such constructs have already been resolved by this
13441 point, so here CTX really should have complete type, unless
13442 it's a partial instantiation. */
13443 ctx
= complete_type (ctx
);
13444 if (!COMPLETE_TYPE_P (ctx
))
13446 if (complain
& tf_error
)
13447 cxx_incomplete_type_error (NULL_TREE
, ctx
);
13448 return error_mark_node
;
13452 f
= make_typename_type (ctx
, f
, typename_type
,
13453 complain
| tf_keep_type_decl
);
13454 if (f
== error_mark_node
)
13456 if (TREE_CODE (f
) == TYPE_DECL
)
13458 complain
|= tf_ignore_bad_quals
;
13462 if (TREE_CODE (f
) != TYPENAME_TYPE
)
13464 if (TYPENAME_IS_ENUM_P (t
) && TREE_CODE (f
) != ENUMERAL_TYPE
)
13466 if (complain
& tf_error
)
13467 error ("%qT resolves to %qT, which is not an enumeration type",
13470 return error_mark_node
;
13472 else if (TYPENAME_IS_CLASS_P (t
) && !CLASS_TYPE_P (f
))
13474 if (complain
& tf_error
)
13475 error ("%qT resolves to %qT, which is is not a class type",
13478 return error_mark_node
;
13482 return cp_build_qualified_type_real
13483 (f
, cp_type_quals (f
) | cp_type_quals (t
), complain
);
13486 case UNBOUND_CLASS_TEMPLATE
:
13488 tree ctx
= tsubst_aggr_type (TYPE_CONTEXT (t
), args
, complain
,
13489 in_decl
, /*entering_scope=*/1);
13490 tree name
= TYPE_IDENTIFIER (t
);
13491 tree parm_list
= DECL_TEMPLATE_PARMS (TYPE_NAME (t
));
13493 if (ctx
== error_mark_node
|| name
== error_mark_node
)
13494 return error_mark_node
;
13497 parm_list
= tsubst_template_parms (parm_list
, args
, complain
);
13498 return make_unbound_class_template (ctx
, name
, parm_list
, complain
);
13505 ++cp_unevaluated_operand
;
13506 ++c_inhibit_evaluation_warnings
;
13508 type
= tsubst_expr (TYPEOF_TYPE_EXPR (t
), args
,
13510 /*integral_constant_expression_p=*/false);
13512 --cp_unevaluated_operand
;
13513 --c_inhibit_evaluation_warnings
;
13515 type
= finish_typeof (type
);
13516 return cp_build_qualified_type_real (type
,
13518 | cp_type_quals (type
),
13522 case DECLTYPE_TYPE
:
13526 ++cp_unevaluated_operand
;
13527 ++c_inhibit_evaluation_warnings
;
13529 type
= tsubst_copy_and_build (DECLTYPE_TYPE_EXPR (t
), args
,
13530 complain
|tf_decltype
, in_decl
,
13531 /*function_p*/false,
13532 /*integral_constant_expression*/false);
13534 --cp_unevaluated_operand
;
13535 --c_inhibit_evaluation_warnings
;
13537 if (DECLTYPE_FOR_LAMBDA_CAPTURE (t
))
13538 type
= lambda_capture_field_type (type
,
13539 DECLTYPE_FOR_INIT_CAPTURE (t
));
13540 else if (DECLTYPE_FOR_LAMBDA_PROXY (t
))
13541 type
= lambda_proxy_type (type
);
13544 bool id
= DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (t
);
13545 if (id
&& TREE_CODE (DECLTYPE_TYPE_EXPR (t
)) == BIT_NOT_EXPR
13547 /* In a template ~id could be either a complement expression
13548 or an unqualified-id naming a destructor; if instantiating
13549 it produces an expression, it's not an id-expression or
13552 type
= finish_decltype_type (type
, id
, complain
);
13554 return cp_build_qualified_type_real (type
,
13556 | cp_type_quals (type
),
13557 complain
| tf_ignore_bad_quals
);
13560 case UNDERLYING_TYPE
:
13562 tree type
= tsubst (UNDERLYING_TYPE_TYPE (t
), args
,
13563 complain
, in_decl
);
13564 return finish_underlying_type (type
);
13567 case TYPE_ARGUMENT_PACK
:
13568 case NONTYPE_ARGUMENT_PACK
:
13570 tree r
= TYPE_P (t
) ? cxx_make_type (code
) : make_node (code
);
13572 tsubst_template_args (ARGUMENT_PACK_ARGS (t
),
13576 SET_ARGUMENT_PACK_ARGS (r
, packed_out
);
13578 /* For template nontype argument packs, also substitute into
13580 if (code
== NONTYPE_ARGUMENT_PACK
)
13581 TREE_TYPE (r
) = tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
13600 /* We should use one of the expression tsubsts for these codes. */
13601 gcc_unreachable ();
13604 sorry ("use of %qs in template", get_tree_code_name (code
));
13605 return error_mark_node
;
13609 /* Like tsubst_expr for a BASELINK. OBJECT_TYPE, if non-NULL, is the
13610 type of the expression on the left-hand side of the "." or "->"
13614 tsubst_baselink (tree baselink
, tree object_type
,
13615 tree args
, tsubst_flags_t complain
, tree in_decl
)
13618 tree qualifying_scope
;
13621 tree template_args
= 0;
13622 bool template_id_p
= false;
13623 bool qualified
= BASELINK_QUALIFIED_P (baselink
);
13625 /* A baselink indicates a function from a base class. Both the
13626 BASELINK_ACCESS_BINFO and the base class referenced may
13627 indicate bases of the template class, rather than the
13628 instantiated class. In addition, lookups that were not
13629 ambiguous before may be ambiguous now. Therefore, we perform
13630 the lookup again. */
13631 qualifying_scope
= BINFO_TYPE (BASELINK_ACCESS_BINFO (baselink
));
13632 qualifying_scope
= tsubst (qualifying_scope
, args
,
13633 complain
, in_decl
);
13634 fns
= BASELINK_FUNCTIONS (baselink
);
13635 optype
= tsubst (BASELINK_OPTYPE (baselink
), args
, complain
, in_decl
);
13636 if (TREE_CODE (fns
) == TEMPLATE_ID_EXPR
)
13638 template_id_p
= true;
13639 template_args
= TREE_OPERAND (fns
, 1);
13640 fns
= TREE_OPERAND (fns
, 0);
13642 template_args
= tsubst_template_args (template_args
, args
,
13643 complain
, in_decl
);
13645 name
= DECL_NAME (get_first_fn (fns
));
13646 if (IDENTIFIER_TYPENAME_P (name
))
13647 name
= mangle_conv_op_name_for_type (optype
);
13648 baselink
= lookup_fnfields (qualifying_scope
, name
, /*protect=*/1);
13651 if (constructor_name_p (name
, qualifying_scope
))
13653 if (complain
& tf_error
)
13654 error ("cannot call constructor %<%T::%D%> directly",
13655 qualifying_scope
, name
);
13657 return error_mark_node
;
13660 /* If lookup found a single function, mark it as used at this
13661 point. (If it lookup found multiple functions the one selected
13662 later by overload resolution will be marked as used at that
13664 if (BASELINK_P (baselink
))
13665 fns
= BASELINK_FUNCTIONS (baselink
);
13666 if (!template_id_p
&& !really_overloaded_fn (fns
)
13667 && !mark_used (OVL_CURRENT (fns
), complain
) && !(complain
& tf_error
))
13668 return error_mark_node
;
13670 /* Add back the template arguments, if present. */
13671 if (BASELINK_P (baselink
) && template_id_p
)
13672 BASELINK_FUNCTIONS (baselink
)
13673 = build_nt (TEMPLATE_ID_EXPR
,
13674 BASELINK_FUNCTIONS (baselink
),
13676 /* Update the conversion operator type. */
13677 BASELINK_OPTYPE (baselink
) = optype
;
13680 object_type
= current_class_type
;
13683 baselink
= adjust_result_of_qualified_name_lookup (baselink
,
13689 /* Like tsubst_expr for a SCOPE_REF, given by QUALIFIED_ID. DONE is
13690 true if the qualified-id will be a postfix-expression in-and-of
13691 itself; false if more of the postfix-expression follows the
13692 QUALIFIED_ID. ADDRESS_P is true if the qualified-id is the operand
13696 tsubst_qualified_id (tree qualified_id
, tree args
,
13697 tsubst_flags_t complain
, tree in_decl
,
13698 bool done
, bool address_p
)
13704 tree template_args
;
13705 location_t loc
= UNKNOWN_LOCATION
;
13707 gcc_assert (TREE_CODE (qualified_id
) == SCOPE_REF
);
13709 /* Figure out what name to look up. */
13710 name
= TREE_OPERAND (qualified_id
, 1);
13711 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
13713 is_template
= true;
13714 loc
= EXPR_LOCATION (name
);
13715 template_args
= TREE_OPERAND (name
, 1);
13717 template_args
= tsubst_template_args (template_args
, args
,
13718 complain
, in_decl
);
13719 name
= TREE_OPERAND (name
, 0);
13723 is_template
= false;
13724 template_args
= NULL_TREE
;
13727 /* Substitute into the qualifying scope. When there are no ARGS, we
13728 are just trying to simplify a non-dependent expression. In that
13729 case the qualifying scope may be dependent, and, in any case,
13730 substituting will not help. */
13731 scope
= TREE_OPERAND (qualified_id
, 0);
13734 scope
= tsubst (scope
, args
, complain
, in_decl
);
13735 expr
= tsubst_copy (name
, args
, complain
, in_decl
);
13740 if (dependent_scope_p (scope
))
13743 expr
= build_min_nt_loc (loc
, TEMPLATE_ID_EXPR
, expr
, template_args
);
13744 return build_qualified_name (NULL_TREE
, scope
, expr
,
13745 QUALIFIED_NAME_IS_TEMPLATE (qualified_id
));
13748 if (!BASELINK_P (name
) && !DECL_P (expr
))
13750 if (TREE_CODE (expr
) == BIT_NOT_EXPR
)
13752 /* A BIT_NOT_EXPR is used to represent a destructor. */
13753 if (!check_dtor_name (scope
, TREE_OPERAND (expr
, 0)))
13755 error ("qualifying type %qT does not match destructor name ~%qT",
13756 scope
, TREE_OPERAND (expr
, 0));
13757 expr
= error_mark_node
;
13760 expr
= lookup_qualified_name (scope
, complete_dtor_identifier
,
13761 /*is_type_p=*/0, false);
13764 expr
= lookup_qualified_name (scope
, expr
, /*is_type_p=*/0, false);
13765 if (TREE_CODE (TREE_CODE (expr
) == TEMPLATE_DECL
13766 ? DECL_TEMPLATE_RESULT (expr
) : expr
) == TYPE_DECL
)
13768 if (complain
& tf_error
)
13770 error ("dependent-name %qE is parsed as a non-type, but "
13771 "instantiation yields a type", qualified_id
);
13772 inform (input_location
, "say %<typename %E%> if a type is meant", qualified_id
);
13774 return error_mark_node
;
13780 check_accessibility_of_qualified_id (expr
, /*object_type=*/NULL_TREE
,
13782 /* Remember that there was a reference to this entity. */
13783 if (!mark_used (expr
, complain
) && !(complain
& tf_error
))
13784 return error_mark_node
;
13787 if (expr
== error_mark_node
|| TREE_CODE (expr
) == TREE_LIST
)
13789 if (complain
& tf_error
)
13790 qualified_name_lookup_error (scope
,
13791 TREE_OPERAND (qualified_id
, 1),
13792 expr
, input_location
);
13793 return error_mark_node
;
13798 if (variable_template_p (expr
))
13799 expr
= lookup_and_finish_template_variable (expr
, template_args
,
13802 expr
= lookup_template_function (expr
, template_args
);
13805 if (expr
== error_mark_node
&& complain
& tf_error
)
13806 qualified_name_lookup_error (scope
, TREE_OPERAND (qualified_id
, 1),
13807 expr
, input_location
);
13808 else if (TYPE_P (scope
))
13810 expr
= (adjust_result_of_qualified_name_lookup
13811 (expr
, scope
, current_nonlambda_class_type ()));
13812 expr
= (finish_qualified_id_expr
13813 (scope
, expr
, done
, address_p
&& PTRMEM_OK_P (qualified_id
),
13814 QUALIFIED_NAME_IS_TEMPLATE (qualified_id
),
13815 /*template_arg_p=*/false, complain
));
13818 /* Expressions do not generally have reference type. */
13819 if (TREE_CODE (expr
) != SCOPE_REF
13820 /* However, if we're about to form a pointer-to-member, we just
13821 want the referenced member referenced. */
13822 && TREE_CODE (expr
) != OFFSET_REF
)
13823 expr
= convert_from_reference (expr
);
13828 /* tsubst the initializer for a VAR_DECL. INIT is the unsubstituted
13829 initializer, DECL is the substituted VAR_DECL. Other arguments are as
13833 tsubst_init (tree init
, tree decl
, tree args
,
13834 tsubst_flags_t complain
, tree in_decl
)
13839 init
= tsubst_expr (init
, args
, complain
, in_decl
, false);
13843 /* If we had an initializer but it
13844 instantiated to nothing,
13845 value-initialize the object. This will
13846 only occur when the initializer was a
13847 pack expansion where the parameter packs
13848 used in that expansion were of length
13850 init
= build_value_init (TREE_TYPE (decl
),
13852 if (TREE_CODE (init
) == AGGR_INIT_EXPR
)
13853 init
= get_target_expr_sfinae (init
, complain
);
13859 /* Like tsubst, but deals with expressions. This function just replaces
13860 template parms; to finish processing the resultant expression, use
13861 tsubst_copy_and_build or tsubst_expr. */
13864 tsubst_copy (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
13866 enum tree_code code
;
13869 if (t
== NULL_TREE
|| t
== error_mark_node
|| args
== NULL_TREE
)
13872 code
= TREE_CODE (t
);
13877 r
= retrieve_local_specialization (t
);
13879 if (r
== NULL_TREE
)
13881 /* We get here for a use of 'this' in an NSDMI as part of a
13882 constructor call or as part of an aggregate initialization. */
13883 if (DECL_NAME (t
) == this_identifier
13884 && ((current_function_decl
13885 && DECL_CONSTRUCTOR_P (current_function_decl
))
13886 || (current_class_ref
13887 && TREE_CODE (current_class_ref
) == PLACEHOLDER_EXPR
)))
13888 return current_class_ptr
;
13890 /* This can happen for a parameter name used later in a function
13891 declaration (such as in a late-specified return type). Just
13892 make a dummy decl, since it's only used for its type. */
13893 gcc_assert (cp_unevaluated_operand
!= 0);
13894 r
= tsubst_decl (t
, args
, complain
);
13895 /* Give it the template pattern as its context; its true context
13896 hasn't been instantiated yet and this is good enough for
13898 DECL_CONTEXT (r
) = DECL_CONTEXT (t
);
13901 if (TREE_CODE (r
) == ARGUMENT_PACK_SELECT
)
13902 r
= ARGUMENT_PACK_SELECT_ARG (r
);
13903 if (!mark_used (r
, complain
) && !(complain
& tf_error
))
13904 return error_mark_node
;
13912 if (DECL_TEMPLATE_PARM_P (t
))
13913 return tsubst_copy (DECL_INITIAL (t
), args
, complain
, in_decl
);
13914 /* There is no need to substitute into namespace-scope
13916 if (DECL_NAMESPACE_SCOPE_P (t
))
13918 /* If ARGS is NULL, then T is known to be non-dependent. */
13919 if (args
== NULL_TREE
)
13920 return scalar_constant_value (t
);
13922 /* Unfortunately, we cannot just call lookup_name here.
13925 template <int I> int f() {
13927 struct S { void g() { E e = a; } };
13930 When we instantiate f<7>::S::g(), say, lookup_name is not
13931 clever enough to find f<7>::a. */
13933 = tsubst_aggr_type (DECL_CONTEXT (t
), args
, complain
, in_decl
,
13934 /*entering_scope=*/0);
13936 for (v
= TYPE_VALUES (enum_type
);
13938 v
= TREE_CHAIN (v
))
13939 if (TREE_PURPOSE (v
) == DECL_NAME (t
))
13940 return TREE_VALUE (v
);
13942 /* We didn't find the name. That should never happen; if
13943 name-lookup found it during preliminary parsing, we
13944 should find it again here during instantiation. */
13945 gcc_unreachable ();
13950 if (PACK_EXPANSION_P (TREE_TYPE (t
)))
13952 /* Check for a local specialization set up by
13953 tsubst_pack_expansion. */
13954 if (tree r
= retrieve_local_specialization (t
))
13956 if (TREE_CODE (r
) == ARGUMENT_PACK_SELECT
)
13957 r
= ARGUMENT_PACK_SELECT_ARG (r
);
13961 /* When retrieving a capture pack from a generic lambda, remove the
13962 lambda call op's own template argument list from ARGS. Only the
13963 template arguments active for the closure type should be used to
13964 retrieve the pack specialization. */
13965 if (LAMBDA_FUNCTION_P (current_function_decl
)
13966 && (template_class_depth (DECL_CONTEXT (t
))
13967 != TMPL_ARGS_DEPTH (args
)))
13968 args
= strip_innermost_template_args (args
, 1);
13970 /* Otherwise return the full NONTYPE_ARGUMENT_PACK that
13971 tsubst_decl put in the hash table. */
13972 return retrieve_specialization (t
, args
, 0);
13975 if (DECL_CONTEXT (t
))
13979 ctx
= tsubst_aggr_type (DECL_CONTEXT (t
), args
, complain
, in_decl
,
13980 /*entering_scope=*/1);
13981 if (ctx
!= DECL_CONTEXT (t
))
13983 tree r
= lookup_field (ctx
, DECL_NAME (t
), 0, false);
13986 if (complain
& tf_error
)
13987 error ("using invalid field %qD", t
);
13988 return error_mark_node
;
13997 case FUNCTION_DECL
:
13998 if (DECL_LANG_SPECIFIC (t
) && DECL_TEMPLATE_INFO (t
))
13999 r
= tsubst (t
, args
, complain
, in_decl
);
14000 else if (local_variable_p (t
))
14002 r
= retrieve_local_specialization (t
);
14003 if (r
== NULL_TREE
)
14005 /* First try name lookup to find the instantiation. */
14006 r
= lookup_name (DECL_NAME (t
));
14009 /* Make sure that the one we found is the one we want. */
14010 tree ctx
= DECL_CONTEXT (t
);
14011 if (DECL_LANG_SPECIFIC (ctx
) && DECL_TEMPLATE_INFO (ctx
))
14012 ctx
= tsubst (ctx
, args
, complain
, in_decl
);
14013 if (ctx
!= DECL_CONTEXT (r
))
14021 /* This can happen for a variable used in a
14022 late-specified return type of a local lambda, or for a
14023 local static or constant. Building a new VAR_DECL
14024 should be OK in all those cases. */
14025 r
= tsubst_decl (t
, args
, complain
);
14026 if (decl_maybe_constant_var_p (r
))
14028 /* We can't call cp_finish_decl, so handle the
14029 initializer by hand. */
14030 tree init
= tsubst_init (DECL_INITIAL (t
), r
, args
,
14031 complain
, in_decl
);
14032 if (!processing_template_decl
)
14033 init
= maybe_constant_init (init
);
14034 if (processing_template_decl
14035 ? potential_constant_expression (init
)
14036 : reduced_constant_expression_p (init
))
14037 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (r
)
14038 = TREE_CONSTANT (r
) = true;
14039 DECL_INITIAL (r
) = init
;
14041 gcc_assert (cp_unevaluated_operand
|| TREE_STATIC (r
)
14042 || decl_constant_var_p (r
)
14043 || errorcount
|| sorrycount
);
14044 if (!processing_template_decl
)
14046 if (TREE_STATIC (r
))
14047 rest_of_decl_compilation (r
, toplevel_bindings_p (),
14050 r
= process_outer_var_ref (r
, complain
);
14053 /* Remember this for subsequent uses. */
14054 if (local_specializations
)
14055 register_local_specialization (r
, t
);
14060 if (!mark_used (r
, complain
) && !(complain
& tf_error
))
14061 return error_mark_node
;
14064 case NAMESPACE_DECL
:
14068 /* An OVERLOAD will always be a non-dependent overload set; an
14069 overload set from function scope will just be represented with an
14070 IDENTIFIER_NODE, and from class scope with a BASELINK. */
14071 gcc_assert (!uses_template_parms (t
));
14075 return tsubst_baselink (t
, current_nonlambda_class_type (),
14076 args
, complain
, in_decl
);
14078 case TEMPLATE_DECL
:
14079 if (DECL_TEMPLATE_TEMPLATE_PARM_P (t
))
14080 return tsubst (TREE_TYPE (DECL_TEMPLATE_RESULT (t
)),
14081 args
, complain
, in_decl
);
14082 else if (DECL_FUNCTION_TEMPLATE_P (t
) && DECL_MEMBER_TEMPLATE_P (t
))
14083 return tsubst (t
, args
, complain
, in_decl
);
14084 else if (DECL_CLASS_SCOPE_P (t
)
14085 && uses_template_parms (DECL_CONTEXT (t
)))
14087 /* Template template argument like the following example need
14090 template <template <class> class TT> struct C {};
14091 template <class T> struct D {
14092 template <class U> struct E {};
14097 We are processing the template argument `E' in #1 for
14098 the template instantiation #2. Originally, `E' is a
14099 TEMPLATE_DECL with `D<T>' as its DECL_CONTEXT. Now we
14100 have to substitute this with one having context `D<int>'. */
14102 tree context
= tsubst (DECL_CONTEXT (t
), args
, complain
, in_decl
);
14103 return lookup_field (context
, DECL_NAME(t
), 0, false);
14106 /* Ordinary template template argument. */
14110 case REINTERPRET_CAST_EXPR
:
14111 case CONST_CAST_EXPR
:
14112 case STATIC_CAST_EXPR
:
14113 case DYNAMIC_CAST_EXPR
:
14114 case IMPLICIT_CONV_EXPR
:
14118 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
14119 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
14120 return build1 (code
, type
, op0
);
14124 if (PACK_EXPANSION_P (TREE_OPERAND (t
, 0))
14125 || ARGUMENT_PACK_P (TREE_OPERAND (t
, 0)))
14127 tree expanded
, op
= TREE_OPERAND (t
, 0);
14130 if (SIZEOF_EXPR_TYPE_P (t
))
14131 op
= TREE_TYPE (op
);
14133 ++cp_unevaluated_operand
;
14134 ++c_inhibit_evaluation_warnings
;
14135 /* We only want to compute the number of arguments. */
14136 if (PACK_EXPANSION_P (op
))
14137 expanded
= tsubst_pack_expansion (op
, args
, complain
, in_decl
);
14139 expanded
= tsubst_template_args (ARGUMENT_PACK_ARGS (op
),
14140 args
, complain
, in_decl
);
14141 --cp_unevaluated_operand
;
14142 --c_inhibit_evaluation_warnings
;
14144 if (TREE_CODE (expanded
) == TREE_VEC
)
14146 len
= TREE_VEC_LENGTH (expanded
);
14147 /* Set TREE_USED for the benefit of -Wunused. */
14148 for (int i
= 0; i
< len
; i
++)
14149 TREE_USED (TREE_VEC_ELT (expanded
, i
)) = true;
14152 if (expanded
== error_mark_node
)
14153 return error_mark_node
;
14154 else if (PACK_EXPANSION_P (expanded
)
14155 || (TREE_CODE (expanded
) == TREE_VEC
14156 && pack_expansion_args_count (expanded
)))
14159 if (PACK_EXPANSION_P (expanded
))
14161 else if (TREE_VEC_LENGTH (expanded
) == 1)
14162 expanded
= TREE_VEC_ELT (expanded
, 0);
14164 expanded
= make_argument_pack (expanded
);
14166 if (TYPE_P (expanded
))
14167 return cxx_sizeof_or_alignof_type (expanded
, SIZEOF_EXPR
,
14168 complain
& tf_error
);
14170 return cxx_sizeof_or_alignof_expr (expanded
, SIZEOF_EXPR
,
14171 complain
& tf_error
);
14174 return build_int_cst (size_type_node
, len
);
14176 if (SIZEOF_EXPR_TYPE_P (t
))
14178 r
= tsubst (TREE_TYPE (TREE_OPERAND (t
, 0)),
14179 args
, complain
, in_decl
);
14180 r
= build1 (NOP_EXPR
, r
, error_mark_node
);
14181 r
= build1 (SIZEOF_EXPR
,
14182 tsubst (TREE_TYPE (t
), args
, complain
, in_decl
), r
);
14183 SIZEOF_EXPR_TYPE_P (r
) = 1;
14190 case TRUTH_NOT_EXPR
:
14193 case UNARY_PLUS_EXPR
: /* Unary + */
14195 case AT_ENCODE_EXPR
:
14199 case REALPART_EXPR
:
14200 case IMAGPART_EXPR
:
14203 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
14204 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
14205 return build1 (code
, type
, op0
);
14208 case COMPONENT_REF
:
14213 object
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
14214 name
= TREE_OPERAND (t
, 1);
14215 if (TREE_CODE (name
) == BIT_NOT_EXPR
)
14217 name
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
14218 complain
, in_decl
);
14219 name
= build1 (BIT_NOT_EXPR
, NULL_TREE
, name
);
14221 else if (TREE_CODE (name
) == SCOPE_REF
14222 && TREE_CODE (TREE_OPERAND (name
, 1)) == BIT_NOT_EXPR
)
14224 tree base
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
14225 complain
, in_decl
);
14226 name
= TREE_OPERAND (name
, 1);
14227 name
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
14228 complain
, in_decl
);
14229 name
= build1 (BIT_NOT_EXPR
, NULL_TREE
, name
);
14230 name
= build_qualified_name (/*type=*/NULL_TREE
,
14232 /*template_p=*/false);
14234 else if (BASELINK_P (name
))
14235 name
= tsubst_baselink (name
,
14236 non_reference (TREE_TYPE (object
)),
14240 name
= tsubst_copy (name
, args
, complain
, in_decl
);
14241 return build_nt (COMPONENT_REF
, object
, name
, NULL_TREE
);
14247 case TRUNC_DIV_EXPR
:
14248 case CEIL_DIV_EXPR
:
14249 case FLOOR_DIV_EXPR
:
14250 case ROUND_DIV_EXPR
:
14251 case EXACT_DIV_EXPR
:
14255 case TRUNC_MOD_EXPR
:
14256 case FLOOR_MOD_EXPR
:
14257 case TRUTH_ANDIF_EXPR
:
14258 case TRUTH_ORIF_EXPR
:
14259 case TRUTH_AND_EXPR
:
14260 case TRUTH_OR_EXPR
:
14273 case COMPOUND_EXPR
:
14276 case PREDECREMENT_EXPR
:
14277 case PREINCREMENT_EXPR
:
14278 case POSTDECREMENT_EXPR
:
14279 case POSTINCREMENT_EXPR
:
14281 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
14282 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
14283 return build_nt (code
, op0
, op1
);
14288 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
14289 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
14290 return build_qualified_name (/*type=*/NULL_TREE
, op0
, op1
,
14291 QUALIFIED_NAME_IS_TEMPLATE (t
));
14296 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
14297 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
14298 return build_nt (ARRAY_REF
, op0
, op1
, NULL_TREE
, NULL_TREE
);
14303 int n
= VL_EXP_OPERAND_LENGTH (t
);
14304 tree result
= build_vl_exp (CALL_EXPR
, n
);
14306 for (i
= 0; i
< n
; i
++)
14307 TREE_OPERAND (t
, i
) = tsubst_copy (TREE_OPERAND (t
, i
), args
,
14308 complain
, in_decl
);
14314 case PSEUDO_DTOR_EXPR
:
14315 case VEC_PERM_EXPR
:
14317 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
14318 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
14319 tree op2
= tsubst_copy (TREE_OPERAND (t
, 2), args
, complain
, in_decl
);
14320 r
= build_nt (code
, op0
, op1
, op2
);
14321 TREE_NO_WARNING (r
) = TREE_NO_WARNING (t
);
14327 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
14328 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
14329 tree op2
= tsubst_copy (TREE_OPERAND (t
, 2), args
, complain
, in_decl
);
14330 r
= build_nt (code
, op0
, op1
, op2
);
14331 NEW_EXPR_USE_GLOBAL (r
) = NEW_EXPR_USE_GLOBAL (t
);
14337 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
14338 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
14339 r
= build_nt (code
, op0
, op1
);
14340 DELETE_EXPR_USE_GLOBAL (r
) = DELETE_EXPR_USE_GLOBAL (t
);
14341 DELETE_EXPR_USE_VEC (r
) = DELETE_EXPR_USE_VEC (t
);
14345 case TEMPLATE_ID_EXPR
:
14347 /* Substituted template arguments */
14348 tree fn
= TREE_OPERAND (t
, 0);
14349 tree targs
= TREE_OPERAND (t
, 1);
14351 fn
= tsubst_copy (fn
, args
, complain
, in_decl
);
14353 targs
= tsubst_template_args (targs
, args
, complain
, in_decl
);
14355 return lookup_template_function (fn
, targs
);
14360 tree purpose
, value
, chain
;
14362 if (t
== void_list_node
)
14365 purpose
= TREE_PURPOSE (t
);
14367 purpose
= tsubst_copy (purpose
, args
, complain
, in_decl
);
14368 value
= TREE_VALUE (t
);
14370 value
= tsubst_copy (value
, args
, complain
, in_decl
);
14371 chain
= TREE_CHAIN (t
);
14372 if (chain
&& chain
!= void_type_node
)
14373 chain
= tsubst_copy (chain
, args
, complain
, in_decl
);
14374 if (purpose
== TREE_PURPOSE (t
)
14375 && value
== TREE_VALUE (t
)
14376 && chain
== TREE_CHAIN (t
))
14378 return tree_cons (purpose
, value
, chain
);
14383 case ENUMERAL_TYPE
:
14385 case TEMPLATE_TYPE_PARM
:
14386 case TEMPLATE_TEMPLATE_PARM
:
14387 case BOUND_TEMPLATE_TEMPLATE_PARM
:
14388 case TEMPLATE_PARM_INDEX
:
14390 case REFERENCE_TYPE
:
14392 case FUNCTION_TYPE
:
14395 case TYPENAME_TYPE
:
14396 case UNBOUND_CLASS_TEMPLATE
:
14398 case DECLTYPE_TYPE
:
14400 return tsubst (t
, args
, complain
, in_decl
);
14404 /* Fall through. */
14405 case IDENTIFIER_NODE
:
14406 if (IDENTIFIER_TYPENAME_P (t
))
14408 tree new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
14409 return mangle_conv_op_name_for_type (new_type
);
14415 /* This is handled by tsubst_copy_and_build. */
14416 gcc_unreachable ();
14420 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
14421 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
14422 return build_x_va_arg (EXPR_LOCATION (t
), op0
, type
);
14425 case CLEANUP_POINT_EXPR
:
14426 /* We shouldn't have built any of these during initial template
14427 generation. Instead, they should be built during instantiation
14428 in response to the saved STMT_IS_FULL_EXPR_P setting. */
14429 gcc_unreachable ();
14433 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
14434 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
14435 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
14436 r
= build2 (code
, type
, op0
, op1
);
14437 PTRMEM_OK_P (r
) = PTRMEM_OK_P (t
);
14438 if (!mark_used (TREE_OPERAND (r
, 1), complain
)
14439 && !(complain
& tf_error
))
14440 return error_mark_node
;
14444 case EXPR_PACK_EXPANSION
:
14445 error ("invalid use of pack expansion expression");
14446 return error_mark_node
;
14448 case NONTYPE_ARGUMENT_PACK
:
14449 error ("use %<...%> to expand argument pack");
14450 return error_mark_node
;
14453 gcc_checking_assert (t
== void_node
&& VOID_TYPE_P (TREE_TYPE (t
)));
14461 /* Instantiate any typedefs in the type. */
14462 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
14463 r
= fold_convert (type
, t
);
14464 gcc_assert (TREE_CODE (r
) == code
);
14469 /* These can sometimes show up in a partial instantiation, but never
14470 involve template parms. */
14471 gcc_assert (!uses_template_parms (t
));
14474 case UNARY_LEFT_FOLD_EXPR
:
14475 return tsubst_unary_left_fold (t
, args
, complain
, in_decl
);
14476 case UNARY_RIGHT_FOLD_EXPR
:
14477 return tsubst_unary_right_fold (t
, args
, complain
, in_decl
);
14478 case BINARY_LEFT_FOLD_EXPR
:
14479 return tsubst_binary_left_fold (t
, args
, complain
, in_decl
);
14480 case BINARY_RIGHT_FOLD_EXPR
:
14481 return tsubst_binary_right_fold (t
, args
, complain
, in_decl
);
14484 /* We shouldn't get here, but keep going if !flag_checking. */
14486 gcc_unreachable ();
14491 /* Helper function for tsubst_omp_clauses, used for instantiation of
14492 OMP_CLAUSE_DECL of clauses. */
14495 tsubst_omp_clause_decl (tree decl
, tree args
, tsubst_flags_t complain
,
14498 if (decl
== NULL_TREE
)
14501 /* Handle an OpenMP array section represented as a TREE_LIST (or
14502 OMP_CLAUSE_DEPEND_KIND). An OMP_CLAUSE_DEPEND (with a depend
14503 kind of OMP_CLAUSE_DEPEND_SINK) can also be represented as a
14504 TREE_LIST. We can handle it exactly the same as an array section
14505 (purpose, value, and a chain), even though the nomenclature
14506 (low_bound, length, etc) is different. */
14507 if (TREE_CODE (decl
) == TREE_LIST
)
14510 = tsubst_expr (TREE_PURPOSE (decl
), args
, complain
, in_decl
,
14511 /*integral_constant_expression_p=*/false);
14512 tree length
= tsubst_expr (TREE_VALUE (decl
), args
, complain
, in_decl
,
14513 /*integral_constant_expression_p=*/false);
14514 tree chain
= tsubst_omp_clause_decl (TREE_CHAIN (decl
), args
, complain
,
14516 if (TREE_PURPOSE (decl
) == low_bound
14517 && TREE_VALUE (decl
) == length
14518 && TREE_CHAIN (decl
) == chain
)
14520 tree ret
= tree_cons (low_bound
, length
, chain
);
14521 OMP_CLAUSE_DEPEND_SINK_NEGATIVE (ret
)
14522 = OMP_CLAUSE_DEPEND_SINK_NEGATIVE (decl
);
14525 tree ret
= tsubst_expr (decl
, args
, complain
, in_decl
,
14526 /*integral_constant_expression_p=*/false);
14527 /* Undo convert_from_reference tsubst_expr could have called. */
14529 && REFERENCE_REF_P (ret
)
14530 && !REFERENCE_REF_P (decl
))
14531 ret
= TREE_OPERAND (ret
, 0);
14535 /* Like tsubst_copy, but specifically for OpenMP clauses. */
14538 tsubst_omp_clauses (tree clauses
, bool declare_simd
, bool allow_fields
,
14539 tree args
, tsubst_flags_t complain
, tree in_decl
)
14541 tree new_clauses
= NULL_TREE
, nc
, oc
;
14542 tree linear_no_step
= NULL_TREE
;
14544 for (oc
= clauses
; oc
; oc
= OMP_CLAUSE_CHAIN (oc
))
14546 nc
= copy_node (oc
);
14547 OMP_CLAUSE_CHAIN (nc
) = new_clauses
;
14550 switch (OMP_CLAUSE_CODE (nc
))
14552 case OMP_CLAUSE_LASTPRIVATE
:
14553 if (OMP_CLAUSE_LASTPRIVATE_STMT (oc
))
14555 OMP_CLAUSE_LASTPRIVATE_STMT (nc
) = push_stmt_list ();
14556 tsubst_expr (OMP_CLAUSE_LASTPRIVATE_STMT (oc
), args
, complain
,
14557 in_decl
, /*integral_constant_expression_p=*/false);
14558 OMP_CLAUSE_LASTPRIVATE_STMT (nc
)
14559 = pop_stmt_list (OMP_CLAUSE_LASTPRIVATE_STMT (nc
));
14562 case OMP_CLAUSE_PRIVATE
:
14563 case OMP_CLAUSE_SHARED
:
14564 case OMP_CLAUSE_FIRSTPRIVATE
:
14565 case OMP_CLAUSE_COPYIN
:
14566 case OMP_CLAUSE_COPYPRIVATE
:
14567 case OMP_CLAUSE_UNIFORM
:
14568 case OMP_CLAUSE_DEPEND
:
14569 case OMP_CLAUSE_FROM
:
14570 case OMP_CLAUSE_TO
:
14571 case OMP_CLAUSE_MAP
:
14572 case OMP_CLAUSE_USE_DEVICE_PTR
:
14573 case OMP_CLAUSE_IS_DEVICE_PTR
:
14574 OMP_CLAUSE_DECL (nc
)
14575 = tsubst_omp_clause_decl (OMP_CLAUSE_DECL (oc
), args
, complain
,
14578 case OMP_CLAUSE_IF
:
14579 case OMP_CLAUSE_NUM_THREADS
:
14580 case OMP_CLAUSE_SCHEDULE
:
14581 case OMP_CLAUSE_COLLAPSE
:
14582 case OMP_CLAUSE_FINAL
:
14583 case OMP_CLAUSE_DEVICE
:
14584 case OMP_CLAUSE_DIST_SCHEDULE
:
14585 case OMP_CLAUSE_NUM_TEAMS
:
14586 case OMP_CLAUSE_THREAD_LIMIT
:
14587 case OMP_CLAUSE_SAFELEN
:
14588 case OMP_CLAUSE_SIMDLEN
:
14589 case OMP_CLAUSE_NUM_TASKS
:
14590 case OMP_CLAUSE_GRAINSIZE
:
14591 case OMP_CLAUSE_PRIORITY
:
14592 case OMP_CLAUSE_ORDERED
:
14593 case OMP_CLAUSE_HINT
:
14594 case OMP_CLAUSE_NUM_GANGS
:
14595 case OMP_CLAUSE_NUM_WORKERS
:
14596 case OMP_CLAUSE_VECTOR_LENGTH
:
14597 case OMP_CLAUSE_WORKER
:
14598 case OMP_CLAUSE_VECTOR
:
14599 case OMP_CLAUSE_ASYNC
:
14600 case OMP_CLAUSE_WAIT
:
14601 OMP_CLAUSE_OPERAND (nc
, 0)
14602 = tsubst_expr (OMP_CLAUSE_OPERAND (oc
, 0), args
, complain
,
14603 in_decl
, /*integral_constant_expression_p=*/false);
14605 case OMP_CLAUSE_REDUCTION
:
14606 if (OMP_CLAUSE_REDUCTION_PLACEHOLDER (oc
))
14608 tree placeholder
= OMP_CLAUSE_REDUCTION_PLACEHOLDER (oc
);
14609 if (TREE_CODE (placeholder
) == SCOPE_REF
)
14611 tree scope
= tsubst (TREE_OPERAND (placeholder
, 0), args
,
14612 complain
, in_decl
);
14613 OMP_CLAUSE_REDUCTION_PLACEHOLDER (nc
)
14614 = build_qualified_name (NULL_TREE
, scope
,
14615 TREE_OPERAND (placeholder
, 1),
14619 gcc_assert (identifier_p (placeholder
));
14621 OMP_CLAUSE_DECL (nc
)
14622 = tsubst_omp_clause_decl (OMP_CLAUSE_DECL (oc
), args
, complain
,
14625 case OMP_CLAUSE_GANG
:
14626 case OMP_CLAUSE_ALIGNED
:
14627 OMP_CLAUSE_DECL (nc
)
14628 = tsubst_omp_clause_decl (OMP_CLAUSE_DECL (oc
), args
, complain
,
14630 OMP_CLAUSE_OPERAND (nc
, 1)
14631 = tsubst_expr (OMP_CLAUSE_OPERAND (oc
, 1), args
, complain
,
14632 in_decl
, /*integral_constant_expression_p=*/false);
14634 case OMP_CLAUSE_LINEAR
:
14635 OMP_CLAUSE_DECL (nc
)
14636 = tsubst_omp_clause_decl (OMP_CLAUSE_DECL (oc
), args
, complain
,
14638 if (OMP_CLAUSE_LINEAR_STEP (oc
) == NULL_TREE
)
14640 gcc_assert (!linear_no_step
);
14641 linear_no_step
= nc
;
14643 else if (OMP_CLAUSE_LINEAR_VARIABLE_STRIDE (oc
))
14644 OMP_CLAUSE_LINEAR_STEP (nc
)
14645 = tsubst_omp_clause_decl (OMP_CLAUSE_LINEAR_STEP (oc
), args
,
14646 complain
, in_decl
);
14648 OMP_CLAUSE_LINEAR_STEP (nc
)
14649 = tsubst_expr (OMP_CLAUSE_LINEAR_STEP (oc
), args
, complain
,
14651 /*integral_constant_expression_p=*/false);
14653 case OMP_CLAUSE_NOWAIT
:
14654 case OMP_CLAUSE_DEFAULT
:
14655 case OMP_CLAUSE_UNTIED
:
14656 case OMP_CLAUSE_MERGEABLE
:
14657 case OMP_CLAUSE_INBRANCH
:
14658 case OMP_CLAUSE_NOTINBRANCH
:
14659 case OMP_CLAUSE_PROC_BIND
:
14660 case OMP_CLAUSE_FOR
:
14661 case OMP_CLAUSE_PARALLEL
:
14662 case OMP_CLAUSE_SECTIONS
:
14663 case OMP_CLAUSE_TASKGROUP
:
14664 case OMP_CLAUSE_NOGROUP
:
14665 case OMP_CLAUSE_THREADS
:
14666 case OMP_CLAUSE_SIMD
:
14667 case OMP_CLAUSE_DEFAULTMAP
:
14668 case OMP_CLAUSE_INDEPENDENT
:
14669 case OMP_CLAUSE_AUTO
:
14670 case OMP_CLAUSE_SEQ
:
14672 case OMP_CLAUSE_TILE
:
14675 for (lnc
= OMP_CLAUSE_TILE_LIST (nc
),
14676 loc
= OMP_CLAUSE_TILE_LIST (oc
);
14678 loc
= TREE_CHAIN (loc
), lnc
= TREE_CHAIN (lnc
))
14680 TREE_VALUE (lnc
) = tsubst_expr (TREE_VALUE (loc
), args
,
14681 complain
, in_decl
, false);
14686 gcc_unreachable ();
14689 switch (OMP_CLAUSE_CODE (nc
))
14691 case OMP_CLAUSE_SHARED
:
14692 case OMP_CLAUSE_PRIVATE
:
14693 case OMP_CLAUSE_FIRSTPRIVATE
:
14694 case OMP_CLAUSE_LASTPRIVATE
:
14695 case OMP_CLAUSE_COPYPRIVATE
:
14696 case OMP_CLAUSE_LINEAR
:
14697 case OMP_CLAUSE_REDUCTION
:
14698 case OMP_CLAUSE_USE_DEVICE_PTR
:
14699 case OMP_CLAUSE_IS_DEVICE_PTR
:
14700 /* tsubst_expr on SCOPE_REF results in returning
14701 finish_non_static_data_member result. Undo that here. */
14702 if (TREE_CODE (OMP_CLAUSE_DECL (oc
)) == SCOPE_REF
14703 && (TREE_CODE (TREE_OPERAND (OMP_CLAUSE_DECL (oc
), 1))
14704 == IDENTIFIER_NODE
))
14706 tree t
= OMP_CLAUSE_DECL (nc
);
14709 switch (TREE_CODE (v
))
14711 case COMPONENT_REF
:
14715 case POINTER_PLUS_EXPR
:
14716 v
= TREE_OPERAND (v
, 0);
14719 if (DECL_CONTEXT (v
) == current_function_decl
14720 && DECL_ARTIFICIAL (v
)
14721 && DECL_NAME (v
) == this_identifier
)
14722 OMP_CLAUSE_DECL (nc
) = TREE_OPERAND (t
, 1);
14729 else if (VAR_P (OMP_CLAUSE_DECL (oc
))
14730 && DECL_HAS_VALUE_EXPR_P (OMP_CLAUSE_DECL (oc
))
14731 && DECL_ARTIFICIAL (OMP_CLAUSE_DECL (oc
))
14732 && DECL_LANG_SPECIFIC (OMP_CLAUSE_DECL (oc
))
14733 && DECL_OMP_PRIVATIZED_MEMBER (OMP_CLAUSE_DECL (oc
)))
14735 tree decl
= OMP_CLAUSE_DECL (nc
);
14738 if (!DECL_LANG_SPECIFIC (decl
))
14739 retrofit_lang_decl (decl
);
14740 DECL_OMP_PRIVATIZED_MEMBER (decl
) = 1;
14749 new_clauses
= nreverse (new_clauses
);
14752 new_clauses
= finish_omp_clauses (new_clauses
, allow_fields
);
14753 if (linear_no_step
)
14754 for (nc
= new_clauses
; nc
; nc
= OMP_CLAUSE_CHAIN (nc
))
14755 if (nc
== linear_no_step
)
14757 OMP_CLAUSE_LINEAR_STEP (nc
) = NULL_TREE
;
14761 return new_clauses
;
14764 /* Like tsubst_copy_and_build, but unshare TREE_LIST nodes. */
14767 tsubst_copy_asm_operands (tree t
, tree args
, tsubst_flags_t complain
,
14770 #define RECUR(t) tsubst_copy_asm_operands (t, args, complain, in_decl)
14772 tree purpose
, value
, chain
;
14777 if (TREE_CODE (t
) != TREE_LIST
)
14778 return tsubst_copy_and_build (t
, args
, complain
, in_decl
,
14779 /*function_p=*/false,
14780 /*integral_constant_expression_p=*/false);
14782 if (t
== void_list_node
)
14785 purpose
= TREE_PURPOSE (t
);
14787 purpose
= RECUR (purpose
);
14788 value
= TREE_VALUE (t
);
14791 if (TREE_CODE (value
) != LABEL_DECL
)
14792 value
= RECUR (value
);
14795 value
= lookup_label (DECL_NAME (value
));
14796 gcc_assert (TREE_CODE (value
) == LABEL_DECL
);
14797 TREE_USED (value
) = 1;
14800 chain
= TREE_CHAIN (t
);
14801 if (chain
&& chain
!= void_type_node
)
14802 chain
= RECUR (chain
);
14803 return tree_cons (purpose
, value
, chain
);
14807 /* Used to temporarily communicate the list of #pragma omp parallel
14808 clauses to #pragma omp for instantiation if they are combined
14811 static tree
*omp_parallel_combined_clauses
;
14813 /* Substitute one OMP_FOR iterator. */
14816 tsubst_omp_for_iterator (tree t
, int i
, tree declv
, tree orig_declv
,
14817 tree initv
, tree condv
, tree incrv
, tree
*clauses
,
14818 tree args
, tsubst_flags_t complain
, tree in_decl
,
14819 bool integral_constant_expression_p
)
14821 #define RECUR(NODE) \
14822 tsubst_expr ((NODE), args, complain, in_decl, \
14823 integral_constant_expression_p)
14824 tree decl
, init
, cond
, incr
;
14826 init
= TREE_VEC_ELT (OMP_FOR_INIT (t
), i
);
14827 gcc_assert (TREE_CODE (init
) == MODIFY_EXPR
);
14829 if (orig_declv
&& OMP_FOR_ORIG_DECLS (t
))
14831 tree o
= TREE_VEC_ELT (OMP_FOR_ORIG_DECLS (t
), i
);
14832 TREE_VEC_ELT (orig_declv
, i
) = RECUR (o
);
14835 decl
= TREE_OPERAND (init
, 0);
14836 init
= TREE_OPERAND (init
, 1);
14837 tree decl_expr
= NULL_TREE
;
14838 if (init
&& TREE_CODE (init
) == DECL_EXPR
)
14840 /* We need to jump through some hoops to handle declarations in the
14841 for-init-statement, since we might need to handle auto deduction,
14842 but we need to keep control of initialization. */
14844 init
= DECL_INITIAL (DECL_EXPR_DECL (init
));
14845 decl
= tsubst_decl (decl
, args
, complain
);
14849 if (TREE_CODE (decl
) == SCOPE_REF
)
14851 decl
= RECUR (decl
);
14852 if (TREE_CODE (decl
) == COMPONENT_REF
)
14856 switch (TREE_CODE (v
))
14858 case COMPONENT_REF
:
14862 case POINTER_PLUS_EXPR
:
14863 v
= TREE_OPERAND (v
, 0);
14866 if (DECL_CONTEXT (v
) == current_function_decl
14867 && DECL_ARTIFICIAL (v
)
14868 && DECL_NAME (v
) == this_identifier
)
14870 decl
= TREE_OPERAND (decl
, 1);
14871 decl
= omp_privatize_field (decl
, false);
14881 decl
= RECUR (decl
);
14883 init
= RECUR (init
);
14885 tree auto_node
= type_uses_auto (TREE_TYPE (decl
));
14886 if (auto_node
&& init
)
14888 = do_auto_deduction (TREE_TYPE (decl
), init
, auto_node
);
14890 gcc_assert (!type_dependent_expression_p (decl
));
14892 if (!CLASS_TYPE_P (TREE_TYPE (decl
)))
14896 /* Declare the variable, but don't let that initialize it. */
14897 tree init_sav
= DECL_INITIAL (DECL_EXPR_DECL (decl_expr
));
14898 DECL_INITIAL (DECL_EXPR_DECL (decl_expr
)) = NULL_TREE
;
14900 DECL_INITIAL (DECL_EXPR_DECL (decl_expr
)) = init_sav
;
14903 cond
= RECUR (TREE_VEC_ELT (OMP_FOR_COND (t
), i
));
14904 incr
= TREE_VEC_ELT (OMP_FOR_INCR (t
), i
);
14905 if (TREE_CODE (incr
) == MODIFY_EXPR
)
14907 tree lhs
= RECUR (TREE_OPERAND (incr
, 0));
14908 tree rhs
= RECUR (TREE_OPERAND (incr
, 1));
14909 incr
= build_x_modify_expr (EXPR_LOCATION (incr
), lhs
,
14910 NOP_EXPR
, rhs
, complain
);
14913 incr
= RECUR (incr
);
14914 TREE_VEC_ELT (declv
, i
) = decl
;
14915 TREE_VEC_ELT (initv
, i
) = init
;
14916 TREE_VEC_ELT (condv
, i
) = cond
;
14917 TREE_VEC_ELT (incrv
, i
) = incr
;
14923 /* Declare and initialize the variable. */
14931 for (j
= (omp_parallel_combined_clauses
== NULL
? 1 : 0); j
< 2; j
++)
14933 for (pc
= j
? clauses
: omp_parallel_combined_clauses
; *pc
; )
14935 if (OMP_CLAUSE_CODE (*pc
) == OMP_CLAUSE_PRIVATE
14936 && OMP_CLAUSE_DECL (*pc
) == decl
)
14938 else if (OMP_CLAUSE_CODE (*pc
) == OMP_CLAUSE_LASTPRIVATE
14939 && OMP_CLAUSE_DECL (*pc
) == decl
)
14943 /* Move lastprivate (decl) clause to OMP_FOR_CLAUSES. */
14945 *pc
= OMP_CLAUSE_CHAIN (c
);
14946 OMP_CLAUSE_CHAIN (c
) = *clauses
;
14949 else if (OMP_CLAUSE_CODE (*pc
) == OMP_CLAUSE_FIRSTPRIVATE
14950 && OMP_CLAUSE_DECL (*pc
) == decl
)
14952 error ("iteration variable %qD should not be firstprivate",
14954 *pc
= OMP_CLAUSE_CHAIN (*pc
);
14956 else if (OMP_CLAUSE_CODE (*pc
) == OMP_CLAUSE_REDUCTION
14957 && OMP_CLAUSE_DECL (*pc
) == decl
)
14959 error ("iteration variable %qD should not be reduction",
14961 *pc
= OMP_CLAUSE_CHAIN (*pc
);
14964 pc
= &OMP_CLAUSE_CHAIN (*pc
);
14969 if (*pc
== NULL_TREE
)
14971 tree c
= build_omp_clause (input_location
, OMP_CLAUSE_PRIVATE
);
14972 OMP_CLAUSE_DECL (c
) = decl
;
14973 c
= finish_omp_clauses (c
, true);
14976 OMP_CLAUSE_CHAIN (c
) = *clauses
;
14981 cond
= TREE_VEC_ELT (OMP_FOR_COND (t
), i
);
14982 if (COMPARISON_CLASS_P (cond
))
14984 tree op0
= RECUR (TREE_OPERAND (cond
, 0));
14985 tree op1
= RECUR (TREE_OPERAND (cond
, 1));
14986 cond
= build2 (TREE_CODE (cond
), boolean_type_node
, op0
, op1
);
14989 cond
= RECUR (cond
);
14990 incr
= TREE_VEC_ELT (OMP_FOR_INCR (t
), i
);
14991 switch (TREE_CODE (incr
))
14993 case PREINCREMENT_EXPR
:
14994 case PREDECREMENT_EXPR
:
14995 case POSTINCREMENT_EXPR
:
14996 case POSTDECREMENT_EXPR
:
14997 incr
= build2 (TREE_CODE (incr
), TREE_TYPE (decl
),
14998 RECUR (TREE_OPERAND (incr
, 0)), NULL_TREE
);
15001 if (TREE_CODE (TREE_OPERAND (incr
, 1)) == PLUS_EXPR
15002 || TREE_CODE (TREE_OPERAND (incr
, 1)) == MINUS_EXPR
)
15004 tree rhs
= TREE_OPERAND (incr
, 1);
15005 tree lhs
= RECUR (TREE_OPERAND (incr
, 0));
15006 tree rhs0
= RECUR (TREE_OPERAND (rhs
, 0));
15007 tree rhs1
= RECUR (TREE_OPERAND (rhs
, 1));
15008 incr
= build2 (MODIFY_EXPR
, TREE_TYPE (decl
), lhs
,
15009 build2 (TREE_CODE (rhs
), TREE_TYPE (decl
),
15013 incr
= RECUR (incr
);
15016 if (TREE_CODE (TREE_OPERAND (incr
, 1)) == PLUS_EXPR
15017 || TREE_CODE (TREE_OPERAND (incr
, 1)) == MINUS_EXPR
)
15019 tree lhs
= RECUR (TREE_OPERAND (incr
, 0));
15020 incr
= build2 (MODIFY_EXPR
, TREE_TYPE (decl
), lhs
,
15021 build2 (TREE_CODE (TREE_OPERAND (incr
, 1)),
15022 TREE_TYPE (decl
), lhs
,
15023 RECUR (TREE_OPERAND (incr
, 2))));
15025 else if (TREE_CODE (TREE_OPERAND (incr
, 1)) == NOP_EXPR
15026 && (TREE_CODE (TREE_OPERAND (incr
, 2)) == PLUS_EXPR
15027 || (TREE_CODE (TREE_OPERAND (incr
, 2)) == MINUS_EXPR
)))
15029 tree rhs
= TREE_OPERAND (incr
, 2);
15030 tree lhs
= RECUR (TREE_OPERAND (incr
, 0));
15031 tree rhs0
= RECUR (TREE_OPERAND (rhs
, 0));
15032 tree rhs1
= RECUR (TREE_OPERAND (rhs
, 1));
15033 incr
= build2 (MODIFY_EXPR
, TREE_TYPE (decl
), lhs
,
15034 build2 (TREE_CODE (rhs
), TREE_TYPE (decl
),
15038 incr
= RECUR (incr
);
15041 incr
= RECUR (incr
);
15045 TREE_VEC_ELT (declv
, i
) = decl
;
15046 TREE_VEC_ELT (initv
, i
) = init
;
15047 TREE_VEC_ELT (condv
, i
) = cond
;
15048 TREE_VEC_ELT (incrv
, i
) = incr
;
15052 /* Helper function of tsubst_expr, find OMP_TEAMS inside
15053 of OMP_TARGET's body. */
15056 tsubst_find_omp_teams (tree
*tp
, int *walk_subtrees
, void *)
15058 *walk_subtrees
= 0;
15059 switch (TREE_CODE (*tp
))
15064 case STATEMENT_LIST
:
15065 *walk_subtrees
= 1;
15073 /* Like tsubst_copy for expressions, etc. but also does semantic
15077 tsubst_expr (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
,
15078 bool integral_constant_expression_p
)
15080 #define RETURN(EXP) do { r = (EXP); goto out; } while(0)
15081 #define RECUR(NODE) \
15082 tsubst_expr ((NODE), args, complain, in_decl, \
15083 integral_constant_expression_p)
15089 if (t
== NULL_TREE
|| t
== error_mark_node
)
15092 loc
= input_location
;
15093 if (EXPR_HAS_LOCATION (t
))
15094 input_location
= EXPR_LOCATION (t
);
15095 if (STATEMENT_CODE_P (TREE_CODE (t
)))
15096 current_stmt_tree ()->stmts_are_full_exprs_p
= STMT_IS_FULL_EXPR_P (t
);
15098 switch (TREE_CODE (t
))
15100 case STATEMENT_LIST
:
15102 tree_stmt_iterator i
;
15103 for (i
= tsi_start (t
); !tsi_end_p (i
); tsi_next (&i
))
15104 RECUR (tsi_stmt (i
));
15108 case CTOR_INITIALIZER
:
15109 finish_mem_initializers (tsubst_initializer_list
15110 (TREE_OPERAND (t
, 0), args
));
15114 finish_return_stmt (RECUR (TREE_OPERAND (t
, 0)));
15118 tmp
= RECUR (EXPR_STMT_EXPR (t
));
15119 if (EXPR_STMT_STMT_EXPR_RESULT (t
))
15120 finish_stmt_expr_expr (tmp
, cur_stmt_expr
);
15122 finish_expr_stmt (tmp
);
15126 do_using_directive (USING_STMT_NAMESPACE (t
));
15131 tree decl
, pattern_decl
;
15134 pattern_decl
= decl
= DECL_EXPR_DECL (t
);
15135 if (TREE_CODE (decl
) == LABEL_DECL
)
15136 finish_label_decl (DECL_NAME (decl
));
15137 else if (TREE_CODE (decl
) == USING_DECL
)
15139 tree scope
= USING_DECL_SCOPE (decl
);
15140 tree name
= DECL_NAME (decl
);
15143 scope
= tsubst (scope
, args
, complain
, in_decl
);
15144 decl
= lookup_qualified_name (scope
, name
,
15145 /*is_type_p=*/false,
15146 /*complain=*/false);
15147 if (decl
== error_mark_node
|| TREE_CODE (decl
) == TREE_LIST
)
15148 qualified_name_lookup_error (scope
, name
, decl
, input_location
);
15150 do_local_using_decl (decl
, scope
, name
);
15152 else if (DECL_PACK_P (decl
))
15154 /* Don't build up decls for a variadic capture proxy, we'll
15155 instantiate the elements directly as needed. */
15160 init
= DECL_INITIAL (decl
);
15161 decl
= tsubst (decl
, args
, complain
, in_decl
);
15162 if (decl
!= error_mark_node
)
15164 /* By marking the declaration as instantiated, we avoid
15165 trying to instantiate it. Since instantiate_decl can't
15166 handle local variables, and since we've already done
15167 all that needs to be done, that's the right thing to
15170 DECL_TEMPLATE_INSTANTIATED (decl
) = 1;
15172 && ANON_AGGR_TYPE_P (TREE_TYPE (decl
)))
15173 /* Anonymous aggregates are a special case. */
15174 finish_anon_union (decl
);
15175 else if (is_capture_proxy (DECL_EXPR_DECL (t
)))
15177 DECL_CONTEXT (decl
) = current_function_decl
;
15178 if (DECL_NAME (decl
) == this_identifier
)
15180 tree lam
= DECL_CONTEXT (current_function_decl
);
15181 lam
= CLASSTYPE_LAMBDA_EXPR (lam
);
15182 LAMBDA_EXPR_THIS_CAPTURE (lam
) = decl
;
15184 insert_capture_proxy (decl
);
15186 else if (DECL_IMPLICIT_TYPEDEF_P (t
))
15187 /* We already did a pushtag. */;
15188 else if (TREE_CODE (decl
) == FUNCTION_DECL
15189 && DECL_OMP_DECLARE_REDUCTION_P (decl
)
15190 && DECL_FUNCTION_SCOPE_P (pattern_decl
))
15192 DECL_CONTEXT (decl
) = NULL_TREE
;
15194 DECL_CONTEXT (decl
) = current_function_decl
;
15195 cp_check_omp_declare_reduction (decl
);
15197 else if (VAR_P (decl
)
15198 && DECL_PRETTY_FUNCTION_P (decl
))
15200 /* For __PRETTY_FUNCTION__ we have to adjust the
15202 const char *const name
15203 = cxx_printable_name (current_function_decl
, 2);
15204 init
= cp_fname_init (name
, &TREE_TYPE (decl
));
15205 SET_DECL_VALUE_EXPR (decl
, init
);
15206 DECL_HAS_VALUE_EXPR_P (decl
) = 1;
15207 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (decl
) = 1;
15208 maybe_push_decl (decl
);
15212 int const_init
= false;
15213 maybe_push_decl (decl
);
15215 init
= tsubst_init (init
, decl
, args
, complain
, in_decl
);
15218 const_init
= (DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P
15220 cp_finish_decl (decl
, init
, const_init
, NULL_TREE
, 0);
15229 stmt
= begin_for_stmt (NULL_TREE
, NULL_TREE
);
15230 RECUR (FOR_INIT_STMT (t
));
15231 finish_for_init_stmt (stmt
);
15232 tmp
= RECUR (FOR_COND (t
));
15233 finish_for_cond (tmp
, stmt
, false);
15234 tmp
= RECUR (FOR_EXPR (t
));
15235 finish_for_expr (tmp
, stmt
);
15236 RECUR (FOR_BODY (t
));
15237 finish_for_stmt (stmt
);
15240 case RANGE_FOR_STMT
:
15243 stmt
= begin_for_stmt (NULL_TREE
, NULL_TREE
);
15244 decl
= RANGE_FOR_DECL (t
);
15245 decl
= tsubst (decl
, args
, complain
, in_decl
);
15246 maybe_push_decl (decl
);
15247 expr
= RECUR (RANGE_FOR_EXPR (t
));
15248 stmt
= cp_convert_range_for (stmt
, decl
, expr
, RANGE_FOR_IVDEP (t
));
15249 RECUR (RANGE_FOR_BODY (t
));
15250 finish_for_stmt (stmt
);
15255 stmt
= begin_while_stmt ();
15256 tmp
= RECUR (WHILE_COND (t
));
15257 finish_while_stmt_cond (tmp
, stmt
, false);
15258 RECUR (WHILE_BODY (t
));
15259 finish_while_stmt (stmt
);
15263 stmt
= begin_do_stmt ();
15264 RECUR (DO_BODY (t
));
15265 finish_do_body (stmt
);
15266 tmp
= RECUR (DO_COND (t
));
15267 finish_do_stmt (tmp
, stmt
, false);
15271 stmt
= begin_if_stmt ();
15272 tmp
= RECUR (IF_COND (t
));
15273 finish_if_stmt_cond (tmp
, stmt
);
15274 RECUR (THEN_CLAUSE (t
));
15275 finish_then_clause (stmt
);
15277 if (ELSE_CLAUSE (t
))
15279 begin_else_clause (stmt
);
15280 RECUR (ELSE_CLAUSE (t
));
15281 finish_else_clause (stmt
);
15284 finish_if_stmt (stmt
);
15288 if (BIND_EXPR_BODY_BLOCK (t
))
15289 stmt
= begin_function_body ();
15291 stmt
= begin_compound_stmt (BIND_EXPR_TRY_BLOCK (t
)
15292 ? BCS_TRY_BLOCK
: 0);
15294 RECUR (BIND_EXPR_BODY (t
));
15296 if (BIND_EXPR_BODY_BLOCK (t
))
15297 finish_function_body (stmt
);
15299 finish_compound_stmt (stmt
);
15303 finish_break_stmt ();
15306 case CONTINUE_STMT
:
15307 finish_continue_stmt ();
15311 stmt
= begin_switch_stmt ();
15312 tmp
= RECUR (SWITCH_STMT_COND (t
));
15313 finish_switch_cond (tmp
, stmt
);
15314 RECUR (SWITCH_STMT_BODY (t
));
15315 finish_switch_stmt (stmt
);
15318 case CASE_LABEL_EXPR
:
15320 tree low
= RECUR (CASE_LOW (t
));
15321 tree high
= RECUR (CASE_HIGH (t
));
15322 finish_case_label (EXPR_LOCATION (t
), low
, high
);
15328 tree decl
= LABEL_EXPR_LABEL (t
);
15331 label
= finish_label_stmt (DECL_NAME (decl
));
15332 if (DECL_ATTRIBUTES (decl
) != NULL_TREE
)
15333 cplus_decl_attributes (&label
, DECL_ATTRIBUTES (decl
), 0);
15338 tmp
= GOTO_DESTINATION (t
);
15339 if (TREE_CODE (tmp
) != LABEL_DECL
)
15340 /* Computed goto's must be tsubst'd into. On the other hand,
15341 non-computed gotos must not be; the identifier in question
15342 will have no binding. */
15345 tmp
= DECL_NAME (tmp
);
15346 finish_goto_stmt (tmp
);
15351 tree string
= RECUR (ASM_STRING (t
));
15352 tree outputs
= tsubst_copy_asm_operands (ASM_OUTPUTS (t
), args
,
15353 complain
, in_decl
);
15354 tree inputs
= tsubst_copy_asm_operands (ASM_INPUTS (t
), args
,
15355 complain
, in_decl
);
15356 tree clobbers
= tsubst_copy_asm_operands (ASM_CLOBBERS (t
), args
,
15357 complain
, in_decl
);
15358 tree labels
= tsubst_copy_asm_operands (ASM_LABELS (t
), args
,
15359 complain
, in_decl
);
15360 tmp
= finish_asm_stmt (ASM_VOLATILE_P (t
), string
, outputs
, inputs
,
15362 tree asm_expr
= tmp
;
15363 if (TREE_CODE (asm_expr
) == CLEANUP_POINT_EXPR
)
15364 asm_expr
= TREE_OPERAND (asm_expr
, 0);
15365 ASM_INPUT_P (asm_expr
) = ASM_INPUT_P (t
);
15372 stmt
= begin_try_block ();
15373 RECUR (TRY_STMTS (t
));
15374 finish_cleanup_try_block (stmt
);
15375 finish_cleanup (RECUR (TRY_HANDLERS (t
)), stmt
);
15379 tree compound_stmt
= NULL_TREE
;
15381 if (FN_TRY_BLOCK_P (t
))
15382 stmt
= begin_function_try_block (&compound_stmt
);
15384 stmt
= begin_try_block ();
15386 RECUR (TRY_STMTS (t
));
15388 if (FN_TRY_BLOCK_P (t
))
15389 finish_function_try_block (stmt
);
15391 finish_try_block (stmt
);
15393 RECUR (TRY_HANDLERS (t
));
15394 if (FN_TRY_BLOCK_P (t
))
15395 finish_function_handler_sequence (stmt
, compound_stmt
);
15397 finish_handler_sequence (stmt
);
15403 tree decl
= HANDLER_PARMS (t
);
15407 decl
= tsubst (decl
, args
, complain
, in_decl
);
15408 /* Prevent instantiate_decl from trying to instantiate
15409 this variable. We've already done all that needs to be
15411 if (decl
!= error_mark_node
)
15412 DECL_TEMPLATE_INSTANTIATED (decl
) = 1;
15414 stmt
= begin_handler ();
15415 finish_handler_parms (decl
, stmt
);
15416 RECUR (HANDLER_BODY (t
));
15417 finish_handler (stmt
);
15422 tmp
= tsubst (TREE_TYPE (t
), args
, complain
, NULL_TREE
);
15423 if (CLASS_TYPE_P (tmp
))
15425 /* Local classes are not independent templates; they are
15426 instantiated along with their containing function. And this
15427 way we don't have to deal with pushing out of one local class
15428 to instantiate a member of another local class. */
15430 /* Closures are handled by the LAMBDA_EXPR. */
15431 gcc_assert (!LAMBDA_TYPE_P (TREE_TYPE (t
)));
15432 complete_type (tmp
);
15433 for (fn
= TYPE_METHODS (tmp
); fn
; fn
= DECL_CHAIN (fn
))
15434 if (!DECL_ARTIFICIAL (fn
))
15435 instantiate_decl (fn
, /*defer_ok*/0, /*expl_inst_class*/false);
15439 case STATIC_ASSERT
:
15443 ++c_inhibit_evaluation_warnings
;
15445 tsubst_expr (STATIC_ASSERT_CONDITION (t
),
15448 /*integral_constant_expression_p=*/true);
15449 --c_inhibit_evaluation_warnings
;
15451 finish_static_assert (condition
,
15452 STATIC_ASSERT_MESSAGE (t
),
15453 STATIC_ASSERT_SOURCE_LOCATION (t
),
15454 /*member_p=*/false);
15459 case OACC_PARALLEL
:
15460 tmp
= tsubst_omp_clauses (OMP_CLAUSES (t
), false, false, args
, complain
,
15462 stmt
= begin_omp_parallel ();
15463 RECUR (OMP_BODY (t
));
15464 finish_omp_construct (TREE_CODE (t
), stmt
, tmp
);
15468 r
= push_omp_privatization_clauses (OMP_PARALLEL_COMBINED (t
));
15469 tmp
= tsubst_omp_clauses (OMP_PARALLEL_CLAUSES (t
), false, true,
15470 args
, complain
, in_decl
);
15471 if (OMP_PARALLEL_COMBINED (t
))
15472 omp_parallel_combined_clauses
= &tmp
;
15473 stmt
= begin_omp_parallel ();
15474 RECUR (OMP_PARALLEL_BODY (t
));
15475 gcc_assert (omp_parallel_combined_clauses
== NULL
);
15476 OMP_PARALLEL_COMBINED (finish_omp_parallel (tmp
, stmt
))
15477 = OMP_PARALLEL_COMBINED (t
);
15478 pop_omp_privatization_clauses (r
);
15482 r
= push_omp_privatization_clauses (false);
15483 tmp
= tsubst_omp_clauses (OMP_TASK_CLAUSES (t
), false, true,
15484 args
, complain
, in_decl
);
15485 stmt
= begin_omp_task ();
15486 RECUR (OMP_TASK_BODY (t
));
15487 finish_omp_task (tmp
, stmt
);
15488 pop_omp_privatization_clauses (r
);
15495 case OMP_DISTRIBUTE
:
15499 tree clauses
, body
, pre_body
;
15500 tree declv
= NULL_TREE
, initv
= NULL_TREE
, condv
= NULL_TREE
;
15501 tree orig_declv
= NULL_TREE
;
15502 tree incrv
= NULL_TREE
;
15505 r
= push_omp_privatization_clauses (OMP_FOR_INIT (t
) == NULL_TREE
);
15506 clauses
= tsubst_omp_clauses (OMP_FOR_CLAUSES (t
), false,
15507 TREE_CODE (t
) != OACC_LOOP
,
15508 args
, complain
, in_decl
);
15509 if (OMP_FOR_INIT (t
) != NULL_TREE
)
15511 declv
= make_tree_vec (TREE_VEC_LENGTH (OMP_FOR_INIT (t
)));
15512 if (OMP_FOR_ORIG_DECLS (t
))
15513 orig_declv
= make_tree_vec (TREE_VEC_LENGTH (OMP_FOR_INIT (t
)));
15514 initv
= make_tree_vec (TREE_VEC_LENGTH (OMP_FOR_INIT (t
)));
15515 condv
= make_tree_vec (TREE_VEC_LENGTH (OMP_FOR_INIT (t
)));
15516 incrv
= make_tree_vec (TREE_VEC_LENGTH (OMP_FOR_INIT (t
)));
15519 stmt
= begin_omp_structured_block ();
15521 pre_body
= push_stmt_list ();
15522 RECUR (OMP_FOR_PRE_BODY (t
));
15523 pre_body
= pop_stmt_list (pre_body
);
15525 if (OMP_FOR_INIT (t
) != NULL_TREE
)
15526 for (i
= 0; i
< TREE_VEC_LENGTH (OMP_FOR_INIT (t
)); i
++)
15527 tsubst_omp_for_iterator (t
, i
, declv
, orig_declv
, initv
, condv
,
15528 incrv
, &clauses
, args
, complain
, in_decl
,
15529 integral_constant_expression_p
);
15530 omp_parallel_combined_clauses
= NULL
;
15532 body
= push_stmt_list ();
15533 RECUR (OMP_FOR_BODY (t
));
15534 body
= pop_stmt_list (body
);
15536 if (OMP_FOR_INIT (t
) != NULL_TREE
)
15537 t
= finish_omp_for (EXPR_LOCATION (t
), TREE_CODE (t
), declv
,
15538 orig_declv
, initv
, condv
, incrv
, body
, pre_body
,
15542 t
= make_node (TREE_CODE (t
));
15543 TREE_TYPE (t
) = void_type_node
;
15544 OMP_FOR_BODY (t
) = body
;
15545 OMP_FOR_PRE_BODY (t
) = pre_body
;
15546 OMP_FOR_CLAUSES (t
) = clauses
;
15547 SET_EXPR_LOCATION (t
, EXPR_LOCATION (t
));
15551 add_stmt (finish_omp_structured_block (stmt
));
15552 pop_omp_privatization_clauses (r
);
15557 omp_parallel_combined_clauses
= NULL
;
15562 r
= push_omp_privatization_clauses (TREE_CODE (t
) == OMP_TEAMS
15563 && OMP_TEAMS_COMBINED (t
));
15564 tmp
= tsubst_omp_clauses (OMP_CLAUSES (t
), false, true,
15565 args
, complain
, in_decl
);
15566 stmt
= push_stmt_list ();
15567 RECUR (OMP_BODY (t
));
15568 stmt
= pop_stmt_list (stmt
);
15571 OMP_BODY (t
) = stmt
;
15572 OMP_CLAUSES (t
) = tmp
;
15574 pop_omp_privatization_clauses (r
);
15578 case OMP_TARGET_DATA
:
15580 tmp
= tsubst_omp_clauses (OMP_CLAUSES (t
), false,
15581 TREE_CODE (t
) != OACC_DATA
,
15582 args
, complain
, in_decl
);
15583 keep_next_level (true);
15584 stmt
= begin_omp_structured_block ();
15586 RECUR (OMP_BODY (t
));
15587 stmt
= finish_omp_structured_block (stmt
);
15590 OMP_BODY (t
) = stmt
;
15591 OMP_CLAUSES (t
) = tmp
;
15592 if (TREE_CODE (t
) == OMP_TARGET
&& OMP_TARGET_COMBINED (t
))
15594 tree teams
= cp_walk_tree (&stmt
, tsubst_find_omp_teams
, NULL
, NULL
);
15597 /* For combined target teams, ensure the num_teams and
15598 thread_limit clause expressions are evaluated on the host,
15599 before entering the target construct. */
15601 for (c
= OMP_TEAMS_CLAUSES (teams
);
15602 c
; c
= OMP_CLAUSE_CHAIN (c
))
15603 if ((OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_NUM_TEAMS
15604 || OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_THREAD_LIMIT
)
15605 && TREE_CODE (OMP_CLAUSE_OPERAND (c
, 0)) != INTEGER_CST
)
15607 tree expr
= OMP_CLAUSE_OPERAND (c
, 0);
15608 expr
= force_target_expr (TREE_TYPE (expr
), expr
, tf_none
);
15609 if (expr
== error_mark_node
)
15611 tmp
= TARGET_EXPR_SLOT (expr
);
15613 OMP_CLAUSE_OPERAND (c
, 0) = expr
;
15614 tree tc
= build_omp_clause (OMP_CLAUSE_LOCATION (c
),
15615 OMP_CLAUSE_FIRSTPRIVATE
);
15616 OMP_CLAUSE_DECL (tc
) = tmp
;
15617 OMP_CLAUSE_CHAIN (tc
) = OMP_TARGET_CLAUSES (t
);
15618 OMP_TARGET_CLAUSES (t
) = tc
;
15627 tmp
= tsubst_omp_clauses (OACC_DECLARE_CLAUSES (t
), false, false,
15628 args
, complain
, in_decl
);
15629 OACC_DECLARE_CLAUSES (t
) = tmp
;
15633 case OMP_TARGET_UPDATE
:
15634 case OMP_TARGET_ENTER_DATA
:
15635 case OMP_TARGET_EXIT_DATA
:
15636 tmp
= tsubst_omp_clauses (OMP_STANDALONE_CLAUSES (t
), false, true,
15637 args
, complain
, in_decl
);
15639 OMP_STANDALONE_CLAUSES (t
) = tmp
;
15643 case OACC_ENTER_DATA
:
15644 case OACC_EXIT_DATA
:
15646 tmp
= tsubst_omp_clauses (OMP_STANDALONE_CLAUSES (t
), false, false,
15647 args
, complain
, in_decl
);
15649 OMP_STANDALONE_CLAUSES (t
) = tmp
;
15654 tmp
= tsubst_omp_clauses (OMP_ORDERED_CLAUSES (t
), false, true,
15655 args
, complain
, in_decl
);
15656 stmt
= push_stmt_list ();
15657 RECUR (OMP_BODY (t
));
15658 stmt
= pop_stmt_list (stmt
);
15661 OMP_BODY (t
) = stmt
;
15662 OMP_ORDERED_CLAUSES (t
) = tmp
;
15668 case OMP_TASKGROUP
:
15669 stmt
= push_stmt_list ();
15670 RECUR (OMP_BODY (t
));
15671 stmt
= pop_stmt_list (stmt
);
15674 OMP_BODY (t
) = stmt
;
15679 gcc_assert (OMP_ATOMIC_DEPENDENT_P (t
));
15680 if (TREE_CODE (TREE_OPERAND (t
, 1)) != MODIFY_EXPR
)
15682 tree op1
= TREE_OPERAND (t
, 1);
15683 tree rhs1
= NULL_TREE
;
15685 if (TREE_CODE (op1
) == COMPOUND_EXPR
)
15687 rhs1
= RECUR (TREE_OPERAND (op1
, 0));
15688 op1
= TREE_OPERAND (op1
, 1);
15690 lhs
= RECUR (TREE_OPERAND (op1
, 0));
15691 rhs
= RECUR (TREE_OPERAND (op1
, 1));
15692 finish_omp_atomic (OMP_ATOMIC
, TREE_CODE (op1
), lhs
, rhs
,
15693 NULL_TREE
, NULL_TREE
, rhs1
,
15694 OMP_ATOMIC_SEQ_CST (t
));
15698 tree op1
= TREE_OPERAND (t
, 1);
15699 tree v
= NULL_TREE
, lhs
, rhs
= NULL_TREE
, lhs1
= NULL_TREE
;
15700 tree rhs1
= NULL_TREE
;
15701 enum tree_code code
= TREE_CODE (TREE_OPERAND (op1
, 1));
15702 enum tree_code opcode
= NOP_EXPR
;
15703 if (code
== OMP_ATOMIC_READ
)
15705 v
= RECUR (TREE_OPERAND (op1
, 0));
15706 lhs
= RECUR (TREE_OPERAND (TREE_OPERAND (op1
, 1), 0));
15708 else if (code
== OMP_ATOMIC_CAPTURE_OLD
15709 || code
== OMP_ATOMIC_CAPTURE_NEW
)
15711 tree op11
= TREE_OPERAND (TREE_OPERAND (op1
, 1), 1);
15712 v
= RECUR (TREE_OPERAND (op1
, 0));
15713 lhs1
= RECUR (TREE_OPERAND (TREE_OPERAND (op1
, 1), 0));
15714 if (TREE_CODE (op11
) == COMPOUND_EXPR
)
15716 rhs1
= RECUR (TREE_OPERAND (op11
, 0));
15717 op11
= TREE_OPERAND (op11
, 1);
15719 lhs
= RECUR (TREE_OPERAND (op11
, 0));
15720 rhs
= RECUR (TREE_OPERAND (op11
, 1));
15721 opcode
= TREE_CODE (op11
);
15722 if (opcode
== MODIFY_EXPR
)
15728 lhs
= RECUR (TREE_OPERAND (op1
, 0));
15729 rhs
= RECUR (TREE_OPERAND (op1
, 1));
15731 finish_omp_atomic (code
, opcode
, lhs
, rhs
, v
, lhs1
, rhs1
,
15732 OMP_ATOMIC_SEQ_CST (t
));
15736 case TRANSACTION_EXPR
:
15739 flags
|= (TRANSACTION_EXPR_OUTER (t
) ? TM_STMT_ATTR_OUTER
: 0);
15740 flags
|= (TRANSACTION_EXPR_RELAXED (t
) ? TM_STMT_ATTR_RELAXED
: 0);
15742 if (TRANSACTION_EXPR_IS_STMT (t
))
15744 tree body
= TRANSACTION_EXPR_BODY (t
);
15745 tree noex
= NULL_TREE
;
15746 if (TREE_CODE (body
) == MUST_NOT_THROW_EXPR
)
15748 noex
= MUST_NOT_THROW_COND (body
);
15749 if (noex
== NULL_TREE
)
15750 noex
= boolean_true_node
;
15751 body
= TREE_OPERAND (body
, 0);
15753 stmt
= begin_transaction_stmt (input_location
, NULL
, flags
);
15755 finish_transaction_stmt (stmt
, NULL
, flags
, RECUR (noex
));
15759 stmt
= build_transaction_expr (EXPR_LOCATION (t
),
15760 RECUR (TRANSACTION_EXPR_BODY (t
)),
15767 case MUST_NOT_THROW_EXPR
:
15769 tree op0
= RECUR (TREE_OPERAND (t
, 0));
15770 tree cond
= RECUR (MUST_NOT_THROW_COND (t
));
15771 RETURN (build_must_not_throw_expr (op0
, cond
));
15774 case EXPR_PACK_EXPANSION
:
15775 error ("invalid use of pack expansion expression");
15776 RETURN (error_mark_node
);
15778 case NONTYPE_ARGUMENT_PACK
:
15779 error ("use %<...%> to expand argument pack");
15780 RETURN (error_mark_node
);
15782 case CILK_SPAWN_STMT
:
15783 cfun
->calls_cilk_spawn
= 1;
15784 RETURN (build_cilk_spawn (EXPR_LOCATION (t
), RECUR (CILK_SPAWN_FN (t
))));
15786 case CILK_SYNC_STMT
:
15787 RETURN (build_cilk_sync ());
15789 case COMPOUND_EXPR
:
15790 tmp
= RECUR (TREE_OPERAND (t
, 0));
15791 if (tmp
== NULL_TREE
)
15792 /* If the first operand was a statement, we're done with it. */
15793 RETURN (RECUR (TREE_OPERAND (t
, 1)));
15794 RETURN (build_x_compound_expr (EXPR_LOCATION (t
), tmp
,
15795 RECUR (TREE_OPERAND (t
, 1)),
15798 case ANNOTATE_EXPR
:
15799 tmp
= RECUR (TREE_OPERAND (t
, 0));
15800 RETURN (build2_loc (EXPR_LOCATION (t
), ANNOTATE_EXPR
,
15801 TREE_TYPE (tmp
), tmp
, RECUR (TREE_OPERAND (t
, 1))));
15804 gcc_assert (!STATEMENT_CODE_P (TREE_CODE (t
)));
15806 RETURN (tsubst_copy_and_build (t
, args
, complain
, in_decl
,
15807 /*function_p=*/false,
15808 integral_constant_expression_p
));
15811 RETURN (NULL_TREE
);
15813 input_location
= loc
;
15819 /* Instantiate the special body of the artificial DECL_OMP_DECLARE_REDUCTION
15820 function. For description of the body see comment above
15821 cp_parser_omp_declare_reduction_exprs. */
15824 tsubst_omp_udr (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
15826 if (t
== NULL_TREE
|| t
== error_mark_node
)
15829 gcc_assert (TREE_CODE (t
) == STATEMENT_LIST
);
15831 tree_stmt_iterator tsi
;
15834 memset (stmts
, 0, sizeof stmts
);
15835 for (i
= 0, tsi
= tsi_start (t
);
15836 i
< 7 && !tsi_end_p (tsi
);
15837 i
++, tsi_next (&tsi
))
15838 stmts
[i
] = tsi_stmt (tsi
);
15839 gcc_assert (tsi_end_p (tsi
));
15843 gcc_assert (TREE_CODE (stmts
[0]) == DECL_EXPR
15844 && TREE_CODE (stmts
[1]) == DECL_EXPR
);
15845 tree omp_out
= tsubst (DECL_EXPR_DECL (stmts
[0]),
15846 args
, complain
, in_decl
);
15847 tree omp_in
= tsubst (DECL_EXPR_DECL (stmts
[1]),
15848 args
, complain
, in_decl
);
15849 DECL_CONTEXT (omp_out
) = current_function_decl
;
15850 DECL_CONTEXT (omp_in
) = current_function_decl
;
15851 keep_next_level (true);
15852 tree block
= begin_omp_structured_block ();
15853 tsubst_expr (stmts
[2], args
, complain
, in_decl
, false);
15854 block
= finish_omp_structured_block (block
);
15855 block
= maybe_cleanup_point_expr_void (block
);
15856 add_decl_expr (omp_out
);
15857 if (TREE_NO_WARNING (DECL_EXPR_DECL (stmts
[0])))
15858 TREE_NO_WARNING (omp_out
) = 1;
15859 add_decl_expr (omp_in
);
15860 finish_expr_stmt (block
);
15864 gcc_assert (TREE_CODE (stmts
[3]) == DECL_EXPR
15865 && TREE_CODE (stmts
[4]) == DECL_EXPR
);
15866 tree omp_priv
= tsubst (DECL_EXPR_DECL (stmts
[3]),
15867 args
, complain
, in_decl
);
15868 tree omp_orig
= tsubst (DECL_EXPR_DECL (stmts
[4]),
15869 args
, complain
, in_decl
);
15870 DECL_CONTEXT (omp_priv
) = current_function_decl
;
15871 DECL_CONTEXT (omp_orig
) = current_function_decl
;
15872 keep_next_level (true);
15873 tree block
= begin_omp_structured_block ();
15874 tsubst_expr (stmts
[5], args
, complain
, in_decl
, false);
15875 block
= finish_omp_structured_block (block
);
15876 block
= maybe_cleanup_point_expr_void (block
);
15877 cp_walk_tree (&block
, cp_remove_omp_priv_cleanup_stmt
, omp_priv
, NULL
);
15878 add_decl_expr (omp_priv
);
15879 add_decl_expr (omp_orig
);
15880 finish_expr_stmt (block
);
15882 add_decl_expr (omp_orig
);
15886 /* T is a postfix-expression that is not being used in a function
15887 call. Return the substituted version of T. */
15890 tsubst_non_call_postfix_expression (tree t
, tree args
,
15891 tsubst_flags_t complain
,
15894 if (TREE_CODE (t
) == SCOPE_REF
)
15895 t
= tsubst_qualified_id (t
, args
, complain
, in_decl
,
15896 /*done=*/false, /*address_p=*/false);
15898 t
= tsubst_copy_and_build (t
, args
, complain
, in_decl
,
15899 /*function_p=*/false,
15900 /*integral_constant_expression_p=*/false);
15905 /* Like tsubst but deals with expressions and performs semantic
15906 analysis. FUNCTION_P is true if T is the "F" in "F (ARGS)". */
15909 tsubst_copy_and_build (tree t
,
15911 tsubst_flags_t complain
,
15914 bool integral_constant_expression_p
)
15916 #define RETURN(EXP) do { retval = (EXP); goto out; } while(0)
15917 #define RECUR(NODE) \
15918 tsubst_copy_and_build (NODE, args, complain, in_decl, \
15919 /*function_p=*/false, \
15920 integral_constant_expression_p)
15925 if (t
== NULL_TREE
|| t
== error_mark_node
)
15928 loc
= input_location
;
15929 if (EXPR_HAS_LOCATION (t
))
15930 input_location
= EXPR_LOCATION (t
);
15932 /* N3276 decltype magic only applies to calls at the top level or on the
15933 right side of a comma. */
15934 tsubst_flags_t decltype_flag
= (complain
& tf_decltype
);
15935 complain
&= ~tf_decltype
;
15937 switch (TREE_CODE (t
))
15941 /* Fall through. */
15942 case IDENTIFIER_NODE
:
15946 bool non_integral_constant_expression_p
;
15947 const char *error_msg
;
15949 if (IDENTIFIER_TYPENAME_P (t
))
15951 tree new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
15952 t
= mangle_conv_op_name_for_type (new_type
);
15955 /* Look up the name. */
15956 decl
= lookup_name (t
);
15958 /* By convention, expressions use ERROR_MARK_NODE to indicate
15959 failure, not NULL_TREE. */
15960 if (decl
== NULL_TREE
)
15961 decl
= error_mark_node
;
15963 decl
= finish_id_expression (t
, decl
, NULL_TREE
,
15965 integral_constant_expression_p
,
15966 /*allow_non_integral_constant_expression_p=*/(cxx_dialect
>= cxx11
),
15967 &non_integral_constant_expression_p
,
15968 /*template_p=*/false,
15970 /*address_p=*/false,
15971 /*template_arg_p=*/false,
15976 if (!function_p
&& identifier_p (decl
))
15978 if (complain
& tf_error
)
15979 unqualified_name_lookup_error (decl
);
15980 decl
= error_mark_node
;
15985 case TEMPLATE_ID_EXPR
:
15988 tree templ
= RECUR (TREE_OPERAND (t
, 0));
15989 tree targs
= TREE_OPERAND (t
, 1);
15992 targs
= tsubst_template_args (targs
, args
, complain
, in_decl
);
15993 if (targs
== error_mark_node
)
15994 return error_mark_node
;
15996 if (variable_template_p (templ
))
15997 RETURN (lookup_and_finish_template_variable (templ
, targs
, complain
));
15999 if (TREE_CODE (templ
) == COMPONENT_REF
)
16001 object
= TREE_OPERAND (templ
, 0);
16002 templ
= TREE_OPERAND (templ
, 1);
16005 object
= NULL_TREE
;
16006 templ
= lookup_template_function (templ
, targs
);
16009 RETURN (build3 (COMPONENT_REF
, TREE_TYPE (templ
),
16010 object
, templ
, NULL_TREE
));
16012 RETURN (baselink_for_fns (templ
));
16017 tree r
= RECUR (TREE_OPERAND (t
, 0));
16019 if (REFERENCE_REF_P (t
))
16021 /* A type conversion to reference type will be enclosed in
16022 such an indirect ref, but the substitution of the cast
16023 will have also added such an indirect ref. */
16024 if (TREE_CODE (TREE_TYPE (r
)) == REFERENCE_TYPE
)
16025 r
= convert_from_reference (r
);
16028 r
= build_x_indirect_ref (input_location
, r
, RO_UNARY_STAR
,
16029 complain
|decltype_flag
);
16031 if (TREE_CODE (r
) == INDIRECT_REF
)
16032 REF_PARENTHESIZED_P (r
) = REF_PARENTHESIZED_P (t
);
16039 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
16040 tree op0
= RECUR (TREE_OPERAND (t
, 0));
16041 RETURN (build_nop (type
, op0
));
16044 case IMPLICIT_CONV_EXPR
:
16046 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
16047 tree expr
= RECUR (TREE_OPERAND (t
, 0));
16048 int flags
= LOOKUP_IMPLICIT
;
16049 if (IMPLICIT_CONV_EXPR_DIRECT_INIT (t
))
16050 flags
= LOOKUP_NORMAL
;
16051 RETURN (perform_implicit_conversion_flags (type
, expr
, complain
,
16057 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
16058 tree op0
= RECUR (TREE_OPERAND (t
, 0));
16059 RETURN (build1 (CONVERT_EXPR
, type
, op0
));
16063 case REINTERPRET_CAST_EXPR
:
16064 case CONST_CAST_EXPR
:
16065 case DYNAMIC_CAST_EXPR
:
16066 case STATIC_CAST_EXPR
:
16069 tree op
, r
= NULL_TREE
;
16071 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
16072 if (integral_constant_expression_p
16073 && !cast_valid_in_integral_constant_expression_p (type
))
16075 if (complain
& tf_error
)
16076 error ("a cast to a type other than an integral or "
16077 "enumeration type cannot appear in a constant-expression");
16078 RETURN (error_mark_node
);
16081 op
= RECUR (TREE_OPERAND (t
, 0));
16083 warning_sentinel
s(warn_useless_cast
);
16084 switch (TREE_CODE (t
))
16087 r
= build_functional_cast (type
, op
, complain
);
16089 case REINTERPRET_CAST_EXPR
:
16090 r
= build_reinterpret_cast (type
, op
, complain
);
16092 case CONST_CAST_EXPR
:
16093 r
= build_const_cast (type
, op
, complain
);
16095 case DYNAMIC_CAST_EXPR
:
16096 r
= build_dynamic_cast (type
, op
, complain
);
16098 case STATIC_CAST_EXPR
:
16099 r
= build_static_cast (type
, op
, complain
);
16102 gcc_unreachable ();
16108 case POSTDECREMENT_EXPR
:
16109 case POSTINCREMENT_EXPR
:
16110 op1
= tsubst_non_call_postfix_expression (TREE_OPERAND (t
, 0),
16111 args
, complain
, in_decl
);
16112 RETURN (build_x_unary_op (input_location
, TREE_CODE (t
), op1
,
16113 complain
|decltype_flag
));
16115 case PREDECREMENT_EXPR
:
16116 case PREINCREMENT_EXPR
:
16120 case TRUTH_NOT_EXPR
:
16121 case UNARY_PLUS_EXPR
: /* Unary + */
16122 case REALPART_EXPR
:
16123 case IMAGPART_EXPR
:
16124 RETURN (build_x_unary_op (input_location
, TREE_CODE (t
),
16125 RECUR (TREE_OPERAND (t
, 0)),
16126 complain
|decltype_flag
));
16128 case FIX_TRUNC_EXPR
:
16129 RETURN (cp_build_unary_op (FIX_TRUNC_EXPR
, RECUR (TREE_OPERAND (t
, 0)),
16133 op1
= TREE_OPERAND (t
, 0);
16134 if (TREE_CODE (op1
) == LABEL_DECL
)
16135 RETURN (finish_label_address_expr (DECL_NAME (op1
),
16136 EXPR_LOCATION (op1
)));
16137 if (TREE_CODE (op1
) == SCOPE_REF
)
16138 op1
= tsubst_qualified_id (op1
, args
, complain
, in_decl
,
16139 /*done=*/true, /*address_p=*/true);
16141 op1
= tsubst_non_call_postfix_expression (op1
, args
, complain
,
16143 RETURN (build_x_unary_op (input_location
, ADDR_EXPR
, op1
,
16144 complain
|decltype_flag
));
16149 case TRUNC_DIV_EXPR
:
16150 case CEIL_DIV_EXPR
:
16151 case FLOOR_DIV_EXPR
:
16152 case ROUND_DIV_EXPR
:
16153 case EXACT_DIV_EXPR
:
16157 case TRUNC_MOD_EXPR
:
16158 case FLOOR_MOD_EXPR
:
16159 case TRUTH_ANDIF_EXPR
:
16160 case TRUTH_ORIF_EXPR
:
16161 case TRUTH_AND_EXPR
:
16162 case TRUTH_OR_EXPR
:
16178 warning_sentinel
s1(warn_type_limits
);
16179 warning_sentinel
s2(warn_div_by_zero
);
16180 warning_sentinel
s3(warn_logical_op
);
16181 warning_sentinel
s4(warn_tautological_compare
);
16182 tree op0
= RECUR (TREE_OPERAND (t
, 0));
16183 tree op1
= RECUR (TREE_OPERAND (t
, 1));
16184 tree r
= build_x_binary_op
16185 (input_location
, TREE_CODE (t
),
16187 (TREE_NO_WARNING (TREE_OPERAND (t
, 0))
16189 : TREE_CODE (TREE_OPERAND (t
, 0))),
16191 (TREE_NO_WARNING (TREE_OPERAND (t
, 1))
16193 : TREE_CODE (TREE_OPERAND (t
, 1))),
16195 complain
|decltype_flag
);
16196 if (EXPR_P (r
) && TREE_NO_WARNING (t
))
16197 TREE_NO_WARNING (r
) = TREE_NO_WARNING (t
);
16202 case POINTER_PLUS_EXPR
:
16204 tree op0
= RECUR (TREE_OPERAND (t
, 0));
16205 tree op1
= RECUR (TREE_OPERAND (t
, 1));
16206 return fold_build_pointer_plus (op0
, op1
);
16210 RETURN (tsubst_qualified_id (t
, args
, complain
, in_decl
, /*done=*/true,
16211 /*address_p=*/false));
16213 op1
= tsubst_non_call_postfix_expression (TREE_OPERAND (t
, 0),
16214 args
, complain
, in_decl
);
16215 RETURN (build_x_array_ref (EXPR_LOCATION (t
), op1
,
16216 RECUR (TREE_OPERAND (t
, 1)),
16217 complain
|decltype_flag
));
16219 case ARRAY_NOTATION_REF
:
16221 tree start_index
, length
, stride
;
16222 op1
= tsubst_non_call_postfix_expression (ARRAY_NOTATION_ARRAY (t
),
16223 args
, complain
, in_decl
);
16224 start_index
= RECUR (ARRAY_NOTATION_START (t
));
16225 length
= RECUR (ARRAY_NOTATION_LENGTH (t
));
16226 stride
= RECUR (ARRAY_NOTATION_STRIDE (t
));
16227 RETURN (build_array_notation_ref (EXPR_LOCATION (t
), op1
, start_index
,
16228 length
, stride
, TREE_TYPE (op1
)));
16231 if (PACK_EXPANSION_P (TREE_OPERAND (t
, 0))
16232 || ARGUMENT_PACK_P (TREE_OPERAND (t
, 0)))
16233 RETURN (tsubst_copy (t
, args
, complain
, in_decl
));
16240 op1
= TREE_OPERAND (t
, 0);
16241 if (TREE_CODE (t
) == SIZEOF_EXPR
&& SIZEOF_EXPR_TYPE_P (t
))
16242 op1
= TREE_TYPE (op1
);
16245 /* When there are no ARGS, we are trying to evaluate a
16246 non-dependent expression from the parser. Trying to do
16247 the substitutions may not work. */
16249 op1
= TREE_TYPE (op1
);
16253 ++cp_unevaluated_operand
;
16254 ++c_inhibit_evaluation_warnings
;
16256 op1
= tsubst (op1
, args
, complain
, in_decl
);
16258 op1
= tsubst_copy_and_build (op1
, args
, complain
, in_decl
,
16259 /*function_p=*/false,
16260 /*integral_constant_expression_p=*/
16262 --cp_unevaluated_operand
;
16263 --c_inhibit_evaluation_warnings
;
16266 r
= cxx_sizeof_or_alignof_type (op1
, TREE_CODE (t
),
16267 complain
& tf_error
);
16269 r
= cxx_sizeof_or_alignof_expr (op1
, TREE_CODE (t
),
16270 complain
& tf_error
);
16271 if (TREE_CODE (t
) == SIZEOF_EXPR
&& r
!= error_mark_node
)
16273 if (TREE_CODE (r
) != SIZEOF_EXPR
|| TYPE_P (op1
))
16275 if (!processing_template_decl
&& TYPE_P (op1
))
16277 r
= build_min (SIZEOF_EXPR
, size_type_node
,
16278 build1 (NOP_EXPR
, op1
, error_mark_node
));
16279 SIZEOF_EXPR_TYPE_P (r
) = 1;
16282 r
= build_min (SIZEOF_EXPR
, size_type_node
, op1
);
16283 TREE_SIDE_EFFECTS (r
) = 0;
16284 TREE_READONLY (r
) = 1;
16286 SET_EXPR_LOCATION (r
, EXPR_LOCATION (t
));
16291 case AT_ENCODE_EXPR
:
16293 op1
= TREE_OPERAND (t
, 0);
16294 ++cp_unevaluated_operand
;
16295 ++c_inhibit_evaluation_warnings
;
16296 op1
= tsubst_copy_and_build (op1
, args
, complain
, in_decl
,
16297 /*function_p=*/false,
16298 /*integral_constant_expression_p=*/false);
16299 --cp_unevaluated_operand
;
16300 --c_inhibit_evaluation_warnings
;
16301 RETURN (objc_build_encode_expr (op1
));
16304 case NOEXCEPT_EXPR
:
16305 op1
= TREE_OPERAND (t
, 0);
16306 ++cp_unevaluated_operand
;
16307 ++c_inhibit_evaluation_warnings
;
16308 ++cp_noexcept_operand
;
16309 op1
= tsubst_copy_and_build (op1
, args
, complain
, in_decl
,
16310 /*function_p=*/false,
16311 /*integral_constant_expression_p=*/false);
16312 --cp_unevaluated_operand
;
16313 --c_inhibit_evaluation_warnings
;
16314 --cp_noexcept_operand
;
16315 RETURN (finish_noexcept_expr (op1
, complain
));
16319 warning_sentinel
s(warn_div_by_zero
);
16320 tree lhs
= RECUR (TREE_OPERAND (t
, 0));
16321 tree rhs
= RECUR (TREE_OPERAND (t
, 2));
16322 tree r
= build_x_modify_expr
16323 (EXPR_LOCATION (t
), lhs
, TREE_CODE (TREE_OPERAND (t
, 1)), rhs
,
16324 complain
|decltype_flag
);
16325 /* TREE_NO_WARNING must be set if either the expression was
16326 parenthesized or it uses an operator such as >>= rather
16327 than plain assignment. In the former case, it was already
16328 set and must be copied. In the latter case,
16329 build_x_modify_expr sets it and it must not be reset
16331 if (TREE_NO_WARNING (t
))
16332 TREE_NO_WARNING (r
) = TREE_NO_WARNING (t
);
16338 op1
= tsubst_non_call_postfix_expression (TREE_OPERAND (t
, 0),
16339 args
, complain
, in_decl
);
16340 /* Remember that there was a reference to this entity. */
16342 && !mark_used (op1
, complain
) && !(complain
& tf_error
))
16343 RETURN (error_mark_node
);
16344 RETURN (build_x_arrow (input_location
, op1
, complain
));
16348 tree placement
= RECUR (TREE_OPERAND (t
, 0));
16349 tree init
= RECUR (TREE_OPERAND (t
, 3));
16350 vec
<tree
, va_gc
> *placement_vec
;
16351 vec
<tree
, va_gc
> *init_vec
;
16354 if (placement
== NULL_TREE
)
16355 placement_vec
= NULL
;
16358 placement_vec
= make_tree_vector ();
16359 for (; placement
!= NULL_TREE
; placement
= TREE_CHAIN (placement
))
16360 vec_safe_push (placement_vec
, TREE_VALUE (placement
));
16363 /* If there was an initializer in the original tree, but it
16364 instantiated to an empty list, then we should pass a
16365 non-NULL empty vector to tell build_new that it was an
16366 empty initializer() rather than no initializer. This can
16367 only happen when the initializer is a pack expansion whose
16368 parameter packs are of length zero. */
16369 if (init
== NULL_TREE
&& TREE_OPERAND (t
, 3) == NULL_TREE
)
16373 init_vec
= make_tree_vector ();
16374 if (init
== void_node
)
16375 gcc_assert (init_vec
!= NULL
);
16378 for (; init
!= NULL_TREE
; init
= TREE_CHAIN (init
))
16379 vec_safe_push (init_vec
, TREE_VALUE (init
));
16383 tree op1
= tsubst (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
16384 tree op2
= RECUR (TREE_OPERAND (t
, 2));
16385 ret
= build_new (&placement_vec
, op1
, op2
, &init_vec
,
16386 NEW_EXPR_USE_GLOBAL (t
),
16389 if (placement_vec
!= NULL
)
16390 release_tree_vector (placement_vec
);
16391 if (init_vec
!= NULL
)
16392 release_tree_vector (init_vec
);
16399 tree op0
= RECUR (TREE_OPERAND (t
, 0));
16400 tree op1
= RECUR (TREE_OPERAND (t
, 1));
16401 RETURN (delete_sanity (op0
, op1
,
16402 DELETE_EXPR_USE_VEC (t
),
16403 DELETE_EXPR_USE_GLOBAL (t
),
16407 case COMPOUND_EXPR
:
16409 tree op0
= tsubst_copy_and_build (TREE_OPERAND (t
, 0), args
,
16410 complain
& ~tf_decltype
, in_decl
,
16411 /*function_p=*/false,
16412 integral_constant_expression_p
);
16413 RETURN (build_x_compound_expr (EXPR_LOCATION (t
),
16415 RECUR (TREE_OPERAND (t
, 1)),
16416 complain
|decltype_flag
));
16422 vec
<tree
, va_gc
> *call_args
;
16423 unsigned int nargs
, i
;
16428 function
= CALL_EXPR_FN (t
);
16429 /* When we parsed the expression, we determined whether or
16430 not Koenig lookup should be performed. */
16431 koenig_p
= KOENIG_LOOKUP_P (t
);
16432 if (TREE_CODE (function
) == SCOPE_REF
)
16434 qualified_p
= true;
16435 function
= tsubst_qualified_id (function
, args
, complain
, in_decl
,
16437 /*address_p=*/false);
16439 else if (koenig_p
&& identifier_p (function
))
16441 /* Do nothing; calling tsubst_copy_and_build on an identifier
16442 would incorrectly perform unqualified lookup again.
16444 Note that we can also have an IDENTIFIER_NODE if the earlier
16445 unqualified lookup found a member function; in that case
16446 koenig_p will be false and we do want to do the lookup
16447 again to find the instantiated member function.
16449 FIXME but doing that causes c++/15272, so we need to stop
16450 using IDENTIFIER_NODE in that situation. */
16451 qualified_p
= false;
16455 if (TREE_CODE (function
) == COMPONENT_REF
)
16457 tree op
= TREE_OPERAND (function
, 1);
16459 qualified_p
= (TREE_CODE (op
) == SCOPE_REF
16460 || (BASELINK_P (op
)
16461 && BASELINK_QUALIFIED_P (op
)));
16464 qualified_p
= false;
16466 if (TREE_CODE (function
) == ADDR_EXPR
16467 && TREE_CODE (TREE_OPERAND (function
, 0)) == FUNCTION_DECL
)
16468 /* Avoid error about taking the address of a constructor. */
16469 function
= TREE_OPERAND (function
, 0);
16471 function
= tsubst_copy_and_build (function
, args
, complain
,
16474 integral_constant_expression_p
);
16476 if (BASELINK_P (function
))
16477 qualified_p
= true;
16480 nargs
= call_expr_nargs (t
);
16481 call_args
= make_tree_vector ();
16482 for (i
= 0; i
< nargs
; ++i
)
16484 tree arg
= CALL_EXPR_ARG (t
, i
);
16486 if (!PACK_EXPANSION_P (arg
))
16487 vec_safe_push (call_args
, RECUR (CALL_EXPR_ARG (t
, i
)));
16490 /* Expand the pack expansion and push each entry onto
16492 arg
= tsubst_pack_expansion (arg
, args
, complain
, in_decl
);
16493 if (TREE_CODE (arg
) == TREE_VEC
)
16495 unsigned int len
, j
;
16497 len
= TREE_VEC_LENGTH (arg
);
16498 for (j
= 0; j
< len
; ++j
)
16500 tree value
= TREE_VEC_ELT (arg
, j
);
16501 if (value
!= NULL_TREE
)
16502 value
= convert_from_reference (value
);
16503 vec_safe_push (call_args
, value
);
16508 /* A partial substitution. Add one entry. */
16509 vec_safe_push (call_args
, arg
);
16514 /* We do not perform argument-dependent lookup if normal
16515 lookup finds a non-function, in accordance with the
16516 expected resolution of DR 218. */
16518 && ((is_overloaded_fn (function
)
16519 /* If lookup found a member function, the Koenig lookup is
16520 not appropriate, even if an unqualified-name was used
16521 to denote the function. */
16522 && !DECL_FUNCTION_MEMBER_P (get_first_fn (function
)))
16523 || identifier_p (function
))
16524 /* Only do this when substitution turns a dependent call
16525 into a non-dependent call. */
16526 && type_dependent_expression_p_push (t
)
16527 && !any_type_dependent_arguments_p (call_args
))
16528 function
= perform_koenig_lookup (function
, call_args
, tf_none
);
16530 if (identifier_p (function
)
16531 && !any_type_dependent_arguments_p (call_args
))
16533 if (koenig_p
&& (complain
& tf_warning_or_error
))
16535 /* For backwards compatibility and good diagnostics, try
16536 the unqualified lookup again if we aren't in SFINAE
16538 tree unq
= (tsubst_copy_and_build
16539 (function
, args
, complain
, in_decl
, true,
16540 integral_constant_expression_p
));
16541 if (unq
== error_mark_node
)
16542 RETURN (error_mark_node
);
16544 if (unq
!= function
)
16547 if (INDIRECT_REF_P (fn
))
16548 fn
= TREE_OPERAND (fn
, 0);
16549 if (TREE_CODE (fn
) == COMPONENT_REF
)
16550 fn
= TREE_OPERAND (fn
, 1);
16551 if (is_overloaded_fn (fn
))
16552 fn
= get_first_fn (fn
);
16553 if (permerror (EXPR_LOC_OR_LOC (t
, input_location
),
16554 "%qD was not declared in this scope, "
16555 "and no declarations were found by "
16556 "argument-dependent lookup at the point "
16557 "of instantiation", function
))
16560 /* Can't say anything more. */;
16561 else if (DECL_CLASS_SCOPE_P (fn
))
16563 location_t loc
= EXPR_LOC_OR_LOC (t
,
16566 "declarations in dependent base %qT are "
16567 "not found by unqualified lookup",
16568 DECL_CLASS_CONTEXT (fn
));
16569 if (current_class_ptr
)
16571 "use %<this->%D%> instead", function
);
16574 "use %<%T::%D%> instead",
16575 current_class_name
, function
);
16578 inform (DECL_SOURCE_LOCATION (fn
),
16579 "%qD declared here, later in the "
16580 "translation unit", fn
);
16585 if (identifier_p (function
))
16587 if (complain
& tf_error
)
16588 unqualified_name_lookup_error (function
);
16589 release_tree_vector (call_args
);
16590 RETURN (error_mark_node
);
16594 /* Remember that there was a reference to this entity. */
16595 if (DECL_P (function
)
16596 && !mark_used (function
, complain
) && !(complain
& tf_error
))
16597 RETURN (error_mark_node
);
16599 /* Put back tf_decltype for the actual call. */
16600 complain
|= decltype_flag
;
16602 if (TREE_CODE (function
) == OFFSET_REF
)
16603 ret
= build_offset_ref_call_from_tree (function
, &call_args
,
16605 else if (TREE_CODE (function
) == COMPONENT_REF
)
16607 tree instance
= TREE_OPERAND (function
, 0);
16608 tree fn
= TREE_OPERAND (function
, 1);
16610 if (processing_template_decl
16611 && (type_dependent_expression_p (instance
)
16612 || (!BASELINK_P (fn
)
16613 && TREE_CODE (fn
) != FIELD_DECL
)
16614 || type_dependent_expression_p (fn
)
16615 || any_type_dependent_arguments_p (call_args
)))
16616 ret
= build_nt_call_vec (function
, call_args
);
16617 else if (!BASELINK_P (fn
))
16618 ret
= finish_call_expr (function
, &call_args
,
16619 /*disallow_virtual=*/false,
16620 /*koenig_p=*/false,
16623 ret
= (build_new_method_call
16625 &call_args
, NULL_TREE
,
16626 qualified_p
? LOOKUP_NONVIRTUAL
: LOOKUP_NORMAL
,
16631 ret
= finish_call_expr (function
, &call_args
,
16632 /*disallow_virtual=*/qualified_p
,
16636 release_tree_vector (call_args
);
16643 tree cond
= RECUR (TREE_OPERAND (t
, 0));
16644 tree folded_cond
= fold_non_dependent_expr (cond
);
16647 if (TREE_CODE (folded_cond
) == INTEGER_CST
)
16649 if (integer_zerop (folded_cond
))
16651 ++c_inhibit_evaluation_warnings
;
16652 exp1
= RECUR (TREE_OPERAND (t
, 1));
16653 --c_inhibit_evaluation_warnings
;
16654 exp2
= RECUR (TREE_OPERAND (t
, 2));
16658 exp1
= RECUR (TREE_OPERAND (t
, 1));
16659 ++c_inhibit_evaluation_warnings
;
16660 exp2
= RECUR (TREE_OPERAND (t
, 2));
16661 --c_inhibit_evaluation_warnings
;
16663 cond
= folded_cond
;
16667 exp1
= RECUR (TREE_OPERAND (t
, 1));
16668 exp2
= RECUR (TREE_OPERAND (t
, 2));
16671 RETURN (build_x_conditional_expr (EXPR_LOCATION (t
),
16672 cond
, exp1
, exp2
, complain
));
16675 case PSEUDO_DTOR_EXPR
:
16677 tree op0
= RECUR (TREE_OPERAND (t
, 0));
16678 tree op1
= RECUR (TREE_OPERAND (t
, 1));
16679 tree op2
= tsubst (TREE_OPERAND (t
, 2), args
, complain
, in_decl
);
16680 RETURN (finish_pseudo_destructor_expr (op0
, op1
, op2
,
16686 tree purpose
, value
, chain
;
16688 if (t
== void_list_node
)
16691 if ((TREE_PURPOSE (t
) && PACK_EXPANSION_P (TREE_PURPOSE (t
)))
16692 || (TREE_VALUE (t
) && PACK_EXPANSION_P (TREE_VALUE (t
))))
16694 /* We have pack expansions, so expand those and
16695 create a new list out of it. */
16696 tree purposevec
= NULL_TREE
;
16697 tree valuevec
= NULL_TREE
;
16701 /* Expand the argument expressions. */
16702 if (TREE_PURPOSE (t
))
16703 purposevec
= tsubst_pack_expansion (TREE_PURPOSE (t
), args
,
16704 complain
, in_decl
);
16705 if (TREE_VALUE (t
))
16706 valuevec
= tsubst_pack_expansion (TREE_VALUE (t
), args
,
16707 complain
, in_decl
);
16709 /* Build the rest of the list. */
16710 chain
= TREE_CHAIN (t
);
16711 if (chain
&& chain
!= void_type_node
)
16712 chain
= RECUR (chain
);
16714 /* Determine the number of arguments. */
16715 if (purposevec
&& TREE_CODE (purposevec
) == TREE_VEC
)
16717 len
= TREE_VEC_LENGTH (purposevec
);
16718 gcc_assert (!valuevec
|| len
== TREE_VEC_LENGTH (valuevec
));
16720 else if (TREE_CODE (valuevec
) == TREE_VEC
)
16721 len
= TREE_VEC_LENGTH (valuevec
);
16724 /* Since we only performed a partial substitution into
16725 the argument pack, we only RETURN (a single list
16727 if (purposevec
== TREE_PURPOSE (t
)
16728 && valuevec
== TREE_VALUE (t
)
16729 && chain
== TREE_CHAIN (t
))
16732 RETURN (tree_cons (purposevec
, valuevec
, chain
));
16735 /* Convert the argument vectors into a TREE_LIST */
16739 /* Grab the Ith values. */
16741 purpose
= purposevec
? TREE_VEC_ELT (purposevec
, i
)
16744 = valuevec
? convert_from_reference (TREE_VEC_ELT (valuevec
, i
))
16747 /* Build the list (backwards). */
16748 chain
= tree_cons (purpose
, value
, chain
);
16754 purpose
= TREE_PURPOSE (t
);
16756 purpose
= RECUR (purpose
);
16757 value
= TREE_VALUE (t
);
16759 value
= RECUR (value
);
16760 chain
= TREE_CHAIN (t
);
16761 if (chain
&& chain
!= void_type_node
)
16762 chain
= RECUR (chain
);
16763 if (purpose
== TREE_PURPOSE (t
)
16764 && value
== TREE_VALUE (t
)
16765 && chain
== TREE_CHAIN (t
))
16767 RETURN (tree_cons (purpose
, value
, chain
));
16770 case COMPONENT_REF
:
16777 object
= tsubst_non_call_postfix_expression (TREE_OPERAND (t
, 0),
16778 args
, complain
, in_decl
);
16779 /* Remember that there was a reference to this entity. */
16780 if (DECL_P (object
)
16781 && !mark_used (object
, complain
) && !(complain
& tf_error
))
16782 RETURN (error_mark_node
);
16783 object_type
= TREE_TYPE (object
);
16785 member
= TREE_OPERAND (t
, 1);
16786 if (BASELINK_P (member
))
16787 member
= tsubst_baselink (member
,
16788 non_reference (TREE_TYPE (object
)),
16789 args
, complain
, in_decl
);
16791 member
= tsubst_copy (member
, args
, complain
, in_decl
);
16792 if (member
== error_mark_node
)
16793 RETURN (error_mark_node
);
16795 if (type_dependent_expression_p (object
))
16796 /* We can't do much here. */;
16797 else if (!CLASS_TYPE_P (object_type
))
16799 if (scalarish_type_p (object_type
))
16801 tree s
= NULL_TREE
;
16802 tree dtor
= member
;
16804 if (TREE_CODE (dtor
) == SCOPE_REF
)
16806 s
= TREE_OPERAND (dtor
, 0);
16807 dtor
= TREE_OPERAND (dtor
, 1);
16809 if (TREE_CODE (dtor
) == BIT_NOT_EXPR
)
16811 dtor
= TREE_OPERAND (dtor
, 0);
16813 RETURN (finish_pseudo_destructor_expr
16814 (object
, s
, dtor
, input_location
));
16818 else if (TREE_CODE (member
) == SCOPE_REF
16819 && TREE_CODE (TREE_OPERAND (member
, 1)) == TEMPLATE_ID_EXPR
)
16821 /* Lookup the template functions now that we know what the
16823 tree scope
= TREE_OPERAND (member
, 0);
16824 tree tmpl
= TREE_OPERAND (TREE_OPERAND (member
, 1), 0);
16825 tree args
= TREE_OPERAND (TREE_OPERAND (member
, 1), 1);
16826 member
= lookup_qualified_name (scope
, tmpl
,
16827 /*is_type_p=*/false,
16828 /*complain=*/false);
16829 if (BASELINK_P (member
))
16831 BASELINK_FUNCTIONS (member
)
16832 = build_nt (TEMPLATE_ID_EXPR
, BASELINK_FUNCTIONS (member
),
16834 member
= (adjust_result_of_qualified_name_lookup
16835 (member
, BINFO_TYPE (BASELINK_BINFO (member
)),
16840 qualified_name_lookup_error (scope
, tmpl
, member
,
16842 RETURN (error_mark_node
);
16845 else if (TREE_CODE (member
) == SCOPE_REF
16846 && !CLASS_TYPE_P (TREE_OPERAND (member
, 0))
16847 && TREE_CODE (TREE_OPERAND (member
, 0)) != NAMESPACE_DECL
)
16849 if (complain
& tf_error
)
16851 if (TYPE_P (TREE_OPERAND (member
, 0)))
16852 error ("%qT is not a class or namespace",
16853 TREE_OPERAND (member
, 0));
16855 error ("%qD is not a class or namespace",
16856 TREE_OPERAND (member
, 0));
16858 RETURN (error_mark_node
);
16860 else if (TREE_CODE (member
) == FIELD_DECL
)
16862 r
= finish_non_static_data_member (member
, object
, NULL_TREE
);
16863 if (TREE_CODE (r
) == COMPONENT_REF
)
16864 REF_PARENTHESIZED_P (r
) = REF_PARENTHESIZED_P (t
);
16868 r
= finish_class_member_access_expr (object
, member
,
16869 /*template_p=*/false,
16871 if (TREE_CODE (r
) == COMPONENT_REF
)
16872 REF_PARENTHESIZED_P (r
) = REF_PARENTHESIZED_P (t
);
16877 RETURN (build_throw
16878 (RECUR (TREE_OPERAND (t
, 0))));
16882 vec
<constructor_elt
, va_gc
> *n
;
16883 constructor_elt
*ce
;
16884 unsigned HOST_WIDE_INT idx
;
16885 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
16886 bool process_index_p
;
16888 bool need_copy_p
= false;
16891 if (type
== error_mark_node
)
16892 RETURN (error_mark_node
);
16894 /* digest_init will do the wrong thing if we let it. */
16895 if (type
&& TYPE_PTRMEMFUNC_P (type
))
16898 /* We do not want to process the index of aggregate
16899 initializers as they are identifier nodes which will be
16900 looked up by digest_init. */
16901 process_index_p
= !(type
&& MAYBE_CLASS_TYPE_P (type
));
16903 n
= vec_safe_copy (CONSTRUCTOR_ELTS (t
));
16904 newlen
= vec_safe_length (n
);
16905 FOR_EACH_VEC_SAFE_ELT (n
, idx
, ce
)
16907 if (ce
->index
&& process_index_p
16908 /* An identifier index is looked up in the type
16909 being initialized, not the current scope. */
16910 && TREE_CODE (ce
->index
) != IDENTIFIER_NODE
)
16911 ce
->index
= RECUR (ce
->index
);
16913 if (PACK_EXPANSION_P (ce
->value
))
16915 /* Substitute into the pack expansion. */
16916 ce
->value
= tsubst_pack_expansion (ce
->value
, args
, complain
,
16919 if (ce
->value
== error_mark_node
16920 || PACK_EXPANSION_P (ce
->value
))
16922 else if (TREE_VEC_LENGTH (ce
->value
) == 1)
16923 /* Just move the argument into place. */
16924 ce
->value
= TREE_VEC_ELT (ce
->value
, 0);
16927 /* Update the length of the final CONSTRUCTOR
16928 arguments vector, and note that we will need to
16930 newlen
= newlen
+ TREE_VEC_LENGTH (ce
->value
) - 1;
16931 need_copy_p
= true;
16935 ce
->value
= RECUR (ce
->value
);
16940 vec
<constructor_elt
, va_gc
> *old_n
= n
;
16942 vec_alloc (n
, newlen
);
16943 FOR_EACH_VEC_ELT (*old_n
, idx
, ce
)
16945 if (TREE_CODE (ce
->value
) == TREE_VEC
)
16947 int i
, len
= TREE_VEC_LENGTH (ce
->value
);
16948 for (i
= 0; i
< len
; ++i
)
16949 CONSTRUCTOR_APPEND_ELT (n
, 0,
16950 TREE_VEC_ELT (ce
->value
, i
));
16953 CONSTRUCTOR_APPEND_ELT (n
, 0, ce
->value
);
16957 r
= build_constructor (init_list_type_node
, n
);
16958 CONSTRUCTOR_IS_DIRECT_INIT (r
) = CONSTRUCTOR_IS_DIRECT_INIT (t
);
16960 if (TREE_HAS_CONSTRUCTOR (t
))
16961 RETURN (finish_compound_literal (type
, r
, complain
));
16963 TREE_TYPE (r
) = type
;
16969 tree operand_0
= TREE_OPERAND (t
, 0);
16970 if (TYPE_P (operand_0
))
16972 operand_0
= tsubst (operand_0
, args
, complain
, in_decl
);
16973 RETURN (get_typeid (operand_0
, complain
));
16977 operand_0
= RECUR (operand_0
);
16978 RETURN (build_typeid (operand_0
, complain
));
16985 else if (DECL_PACK_P (t
))
16987 /* We don't build decls for an instantiation of a
16988 variadic capture proxy, we instantiate the elements
16990 gcc_assert (DECL_HAS_VALUE_EXPR_P (t
));
16991 return RECUR (DECL_VALUE_EXPR (t
));
16997 tree r
= tsubst_copy (t
, args
, complain
, in_decl
);
16998 /* ??? We're doing a subset of finish_id_expression here. */
17000 && !processing_template_decl
17001 && !cp_unevaluated_operand
17002 && (TREE_STATIC (r
) || DECL_EXTERNAL (r
))
17003 && CP_DECL_THREAD_LOCAL_P (r
))
17005 if (tree wrap
= get_tls_wrapper_fn (r
))
17006 /* Replace an evaluated use of the thread_local variable with
17007 a call to its wrapper. */
17008 r
= build_cxx_call (wrap
, 0, NULL
, tf_warning_or_error
);
17010 else if (outer_automatic_var_p (r
))
17012 r
= process_outer_var_ref (r
, complain
);
17013 if (is_capture_proxy (r
))
17014 register_local_specialization (r
, t
);
17017 if (TREE_CODE (TREE_TYPE (t
)) != REFERENCE_TYPE
)
17018 /* If the original type was a reference, we'll be wrapped in
17019 the appropriate INDIRECT_REF. */
17020 r
= convert_from_reference (r
);
17026 tree op0
= RECUR (TREE_OPERAND (t
, 0));
17027 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
17028 RETURN (build_x_va_arg (EXPR_LOCATION (t
), op0
, type
));
17031 case OFFSETOF_EXPR
:
17032 RETURN (finish_offsetof (RECUR (TREE_OPERAND (t
, 0)),
17033 EXPR_LOCATION (t
)));
17037 tree type1
= tsubst (TRAIT_EXPR_TYPE1 (t
), args
,
17038 complain
, in_decl
);
17040 tree type2
= TRAIT_EXPR_TYPE2 (t
);
17041 if (type2
&& TREE_CODE (type2
) == TREE_LIST
)
17042 type2
= RECUR (type2
);
17044 type2
= tsubst (type2
, args
, complain
, in_decl
);
17046 RETURN (finish_trait_expr (TRAIT_EXPR_KIND (t
), type1
, type2
));
17051 tree old_stmt_expr
= cur_stmt_expr
;
17052 tree stmt_expr
= begin_stmt_expr ();
17054 cur_stmt_expr
= stmt_expr
;
17055 tsubst_expr (STMT_EXPR_STMT (t
), args
, complain
, in_decl
,
17056 integral_constant_expression_p
);
17057 stmt_expr
= finish_stmt_expr (stmt_expr
, false);
17058 cur_stmt_expr
= old_stmt_expr
;
17060 /* If the resulting list of expression statement is empty,
17061 fold it further into void_node. */
17062 if (empty_expr_stmt_p (stmt_expr
))
17063 stmt_expr
= void_node
;
17065 RETURN (stmt_expr
);
17070 tree r
= build_lambda_expr ();
17072 tree type
= tsubst (LAMBDA_EXPR_CLOSURE (t
), args
, complain
, NULL_TREE
);
17073 LAMBDA_EXPR_CLOSURE (r
) = type
;
17074 CLASSTYPE_LAMBDA_EXPR (type
) = r
;
17076 LAMBDA_EXPR_LOCATION (r
)
17077 = LAMBDA_EXPR_LOCATION (t
);
17078 LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (r
)
17079 = LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (t
);
17080 LAMBDA_EXPR_MUTABLE_P (r
) = LAMBDA_EXPR_MUTABLE_P (t
);
17081 LAMBDA_EXPR_DISCRIMINATOR (r
)
17082 = (LAMBDA_EXPR_DISCRIMINATOR (t
));
17083 tree scope
= LAMBDA_EXPR_EXTRA_SCOPE (t
);
17085 /* No substitution needed. */;
17086 else if (VAR_OR_FUNCTION_DECL_P (scope
))
17087 /* For a function or variable scope, we want to use tsubst so that we
17088 don't complain about referring to an auto before deduction. */
17089 scope
= tsubst (scope
, args
, complain
, in_decl
);
17090 else if (TREE_CODE (scope
) == PARM_DECL
)
17092 /* Look up the parameter we want directly, as tsubst_copy
17093 doesn't do what we need. */
17094 tree fn
= tsubst (DECL_CONTEXT (scope
), args
, complain
, in_decl
);
17095 tree parm
= FUNCTION_FIRST_USER_PARM (fn
);
17096 while (DECL_PARM_INDEX (parm
) != DECL_PARM_INDEX (scope
))
17097 parm
= DECL_CHAIN (parm
);
17099 /* FIXME Work around the parm not having DECL_CONTEXT set. */
17100 if (DECL_CONTEXT (scope
) == NULL_TREE
)
17101 DECL_CONTEXT (scope
) = fn
;
17103 else if (TREE_CODE (scope
) == FIELD_DECL
)
17104 /* For a field, use tsubst_copy so that we look up the existing field
17105 rather than build a new one. */
17106 scope
= RECUR (scope
);
17108 gcc_unreachable ();
17109 LAMBDA_EXPR_EXTRA_SCOPE (r
) = scope
;
17111 gcc_assert (LAMBDA_EXPR_THIS_CAPTURE (t
) == NULL_TREE
17112 && LAMBDA_EXPR_PENDING_PROXIES (t
) == NULL
);
17114 /* Do this again now that LAMBDA_EXPR_EXTRA_SCOPE is set. */
17115 determine_visibility (TYPE_NAME (type
));
17116 /* Now that we know visibility, instantiate the type so we have a
17117 declaration of the op() for later calls to lambda_function. */
17118 complete_type (type
);
17120 if (tree fn
= lambda_function (type
))
17121 LAMBDA_EXPR_RETURN_TYPE (r
) = TREE_TYPE (TREE_TYPE (fn
));
17123 LAMBDA_EXPR_THIS_CAPTURE (r
) = NULL_TREE
;
17125 insert_pending_capture_proxies ();
17127 RETURN (build_lambda_object (r
));
17131 /* We can get here for a constant initializer of non-dependent type.
17132 FIXME stop folding in cp_parser_initializer_clause. */
17134 tree r
= get_target_expr_sfinae (RECUR (TARGET_EXPR_INITIAL (t
)),
17139 case TRANSACTION_EXPR
:
17140 RETURN (tsubst_expr(t
, args
, complain
, in_decl
,
17141 integral_constant_expression_p
));
17144 RETURN (finish_parenthesized_expr (RECUR (TREE_OPERAND (t
, 0))));
17146 case VEC_PERM_EXPR
:
17148 tree op0
= RECUR (TREE_OPERAND (t
, 0));
17149 tree op1
= RECUR (TREE_OPERAND (t
, 1));
17150 tree op2
= RECUR (TREE_OPERAND (t
, 2));
17151 RETURN (build_x_vec_perm_expr (input_location
, op0
, op1
, op2
,
17155 case REQUIRES_EXPR
:
17156 RETURN (tsubst_requires_expr (t
, args
, complain
, in_decl
));
17159 /* Handle Objective-C++ constructs, if appropriate. */
17162 = objcp_tsubst_copy_and_build (t
, args
, complain
,
17163 in_decl
, /*function_p=*/false);
17167 RETURN (tsubst_copy (t
, args
, complain
, in_decl
));
17173 input_location
= loc
;
17177 /* Verify that the instantiated ARGS are valid. For type arguments,
17178 make sure that the type's linkage is ok. For non-type arguments,
17179 make sure they are constants if they are integral or enumerations.
17180 Emit an error under control of COMPLAIN, and return TRUE on error. */
17183 check_instantiated_arg (tree tmpl
, tree t
, tsubst_flags_t complain
)
17185 if (dependent_template_arg_p (t
))
17187 if (ARGUMENT_PACK_P (t
))
17189 tree vec
= ARGUMENT_PACK_ARGS (t
);
17190 int len
= TREE_VEC_LENGTH (vec
);
17191 bool result
= false;
17194 for (i
= 0; i
< len
; ++i
)
17195 if (check_instantiated_arg (tmpl
, TREE_VEC_ELT (vec
, i
), complain
))
17199 else if (TYPE_P (t
))
17201 /* [basic.link]: A name with no linkage (notably, the name
17202 of a class or enumeration declared in a local scope)
17203 shall not be used to declare an entity with linkage.
17204 This implies that names with no linkage cannot be used as
17207 DR 757 relaxes this restriction for C++0x. */
17208 tree nt
= (cxx_dialect
> cxx98
? NULL_TREE
17209 : no_linkage_check (t
, /*relaxed_p=*/false));
17213 /* DR 488 makes use of a type with no linkage cause
17214 type deduction to fail. */
17215 if (complain
& tf_error
)
17217 if (TYPE_ANONYMOUS_P (nt
))
17218 error ("%qT is/uses anonymous type", t
);
17220 error ("template argument for %qD uses local type %qT",
17225 /* In order to avoid all sorts of complications, we do not
17226 allow variably-modified types as template arguments. */
17227 else if (variably_modified_type_p (t
, NULL_TREE
))
17229 if (complain
& tf_error
)
17230 error ("%qT is a variably modified type", t
);
17234 /* Class template and alias template arguments should be OK. */
17235 else if (DECL_TYPE_TEMPLATE_P (t
))
17237 /* A non-type argument of integral or enumerated type must be a
17239 else if (TREE_TYPE (t
)
17240 && INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (t
))
17241 && !REFERENCE_REF_P (t
)
17242 && !TREE_CONSTANT (t
))
17244 if (complain
& tf_error
)
17245 error ("integral expression %qE is not constant", t
);
17252 check_instantiated_args (tree tmpl
, tree args
, tsubst_flags_t complain
)
17254 int ix
, len
= DECL_NTPARMS (tmpl
);
17255 bool result
= false;
17257 for (ix
= 0; ix
!= len
; ix
++)
17259 if (check_instantiated_arg (tmpl
, TREE_VEC_ELT (args
, ix
), complain
))
17262 if (result
&& (complain
& tf_error
))
17263 error (" trying to instantiate %qD", tmpl
);
17267 /* We're out of SFINAE context now, so generate diagnostics for the access
17268 errors we saw earlier when instantiating D from TMPL and ARGS. */
17271 recheck_decl_substitution (tree d
, tree tmpl
, tree args
)
17273 tree pattern
= DECL_TEMPLATE_RESULT (tmpl
);
17274 tree type
= TREE_TYPE (pattern
);
17275 location_t loc
= input_location
;
17277 push_access_scope (d
);
17278 push_deferring_access_checks (dk_no_deferred
);
17279 input_location
= DECL_SOURCE_LOCATION (pattern
);
17280 tsubst (type
, args
, tf_warning_or_error
, d
);
17281 input_location
= loc
;
17282 pop_deferring_access_checks ();
17283 pop_access_scope (d
);
17286 /* Instantiate the indicated variable, function, or alias template TMPL with
17287 the template arguments in TARG_PTR. */
17290 instantiate_template_1 (tree tmpl
, tree orig_args
, tsubst_flags_t complain
)
17292 tree targ_ptr
= orig_args
;
17296 bool access_ok
= true;
17298 if (tmpl
== error_mark_node
)
17299 return error_mark_node
;
17301 gcc_assert (TREE_CODE (tmpl
) == TEMPLATE_DECL
);
17303 /* If this function is a clone, handle it specially. */
17304 if (DECL_CLONED_FUNCTION_P (tmpl
))
17309 /* Use DECL_ABSTRACT_ORIGIN because only FUNCTION_DECLs have
17310 DECL_CLONED_FUNCTION. */
17311 spec
= instantiate_template (DECL_ABSTRACT_ORIGIN (tmpl
),
17312 targ_ptr
, complain
);
17313 if (spec
== error_mark_node
)
17314 return error_mark_node
;
17316 /* Look for the clone. */
17317 FOR_EACH_CLONE (clone
, spec
)
17318 if (DECL_NAME (clone
) == DECL_NAME (tmpl
))
17320 /* We should always have found the clone by now. */
17321 gcc_unreachable ();
17325 if (targ_ptr
== error_mark_node
)
17326 return error_mark_node
;
17328 /* Check to see if we already have this specialization. */
17329 gen_tmpl
= most_general_template (tmpl
);
17330 if (tmpl
!= gen_tmpl
)
17331 /* The TMPL is a partial instantiation. To get a full set of
17332 arguments we must add the arguments used to perform the
17333 partial instantiation. */
17334 targ_ptr
= add_outermost_template_args (DECL_TI_ARGS (tmpl
),
17337 /* It would be nice to avoid hashing here and then again in tsubst_decl,
17338 but it doesn't seem to be on the hot path. */
17339 spec
= retrieve_specialization (gen_tmpl
, targ_ptr
, 0);
17341 gcc_assert (tmpl
== gen_tmpl
17342 || ((fndecl
= retrieve_specialization (tmpl
, orig_args
, 0))
17344 || fndecl
== NULL_TREE
);
17346 if (spec
!= NULL_TREE
)
17348 if (FNDECL_HAS_ACCESS_ERRORS (spec
))
17350 if (complain
& tf_error
)
17351 recheck_decl_substitution (spec
, gen_tmpl
, targ_ptr
);
17352 return error_mark_node
;
17357 if (check_instantiated_args (gen_tmpl
, INNERMOST_TEMPLATE_ARGS (targ_ptr
),
17359 return error_mark_node
;
17361 /* We are building a FUNCTION_DECL, during which the access of its
17362 parameters and return types have to be checked. However this
17363 FUNCTION_DECL which is the desired context for access checking
17364 is not built yet. We solve this chicken-and-egg problem by
17365 deferring all checks until we have the FUNCTION_DECL. */
17366 push_deferring_access_checks (dk_deferred
);
17368 /* Instantiation of the function happens in the context of the function
17369 template, not the context of the overload resolution we're doing. */
17370 push_to_top_level ();
17371 /* If there are dependent arguments, e.g. because we're doing partial
17372 ordering, make sure processing_template_decl stays set. */
17373 if (uses_template_parms (targ_ptr
))
17374 ++processing_template_decl
;
17375 if (DECL_CLASS_SCOPE_P (gen_tmpl
))
17377 tree ctx
= tsubst_aggr_type (DECL_CONTEXT (gen_tmpl
), targ_ptr
,
17378 complain
, gen_tmpl
, true);
17379 push_nested_class (ctx
);
17382 tree pattern
= DECL_TEMPLATE_RESULT (gen_tmpl
);
17384 if (VAR_P (pattern
))
17386 /* We need to determine if we're using a partial or explicit
17387 specialization now, because the type of the variable could be
17389 tree tid
= lookup_template_variable (gen_tmpl
, targ_ptr
);
17390 tree elt
= most_specialized_partial_spec (tid
, complain
);
17391 if (elt
== error_mark_node
)
17392 pattern
= error_mark_node
;
17395 tmpl
= TREE_VALUE (elt
);
17396 pattern
= DECL_TEMPLATE_RESULT (tmpl
);
17397 targ_ptr
= TREE_PURPOSE (elt
);
17401 /* Substitute template parameters to obtain the specialization. */
17402 fndecl
= tsubst (pattern
, targ_ptr
, complain
, gen_tmpl
);
17403 if (DECL_CLASS_SCOPE_P (gen_tmpl
))
17404 pop_nested_class ();
17405 pop_from_top_level ();
17407 if (fndecl
== error_mark_node
)
17409 pop_deferring_access_checks ();
17410 return error_mark_node
;
17413 /* The DECL_TI_TEMPLATE should always be the immediate parent
17414 template, not the most general template. */
17415 DECL_TI_TEMPLATE (fndecl
) = tmpl
;
17416 DECL_TI_ARGS (fndecl
) = targ_ptr
;
17418 /* Now we know the specialization, compute access previously
17420 push_access_scope (fndecl
);
17421 if (!perform_deferred_access_checks (complain
))
17423 pop_access_scope (fndecl
);
17424 pop_deferring_access_checks ();
17426 /* If we've just instantiated the main entry point for a function,
17427 instantiate all the alternate entry points as well. We do this
17428 by cloning the instantiation of the main entry point, not by
17429 instantiating the template clones. */
17430 if (DECL_CHAIN (gen_tmpl
) && DECL_CLONED_FUNCTION_P (DECL_CHAIN (gen_tmpl
)))
17431 clone_function_decl (fndecl
, /*update_method_vec_p=*/0);
17435 if (!(complain
& tf_error
))
17437 /* Remember to reinstantiate when we're out of SFINAE so the user
17438 can see the errors. */
17439 FNDECL_HAS_ACCESS_ERRORS (fndecl
) = true;
17441 return error_mark_node
;
17446 /* Wrapper for instantiate_template_1. */
17449 instantiate_template (tree tmpl
, tree orig_args
, tsubst_flags_t complain
)
17452 timevar_push (TV_TEMPLATE_INST
);
17453 ret
= instantiate_template_1 (tmpl
, orig_args
, complain
);
17454 timevar_pop (TV_TEMPLATE_INST
);
17458 /* Instantiate the alias template TMPL with ARGS. Also push a template
17459 instantiation level, which instantiate_template doesn't do because
17460 functions and variables have sufficient context established by the
17464 instantiate_alias_template (tree tmpl
, tree args
, tsubst_flags_t complain
)
17466 struct pending_template
*old_last_pend
= last_pending_template
;
17467 struct tinst_level
*old_error_tinst
= last_error_tinst_level
;
17468 if (tmpl
== error_mark_node
|| args
== error_mark_node
)
17469 return error_mark_node
;
17470 tree tinst
= build_tree_list (tmpl
, args
);
17471 if (!push_tinst_level (tinst
))
17474 return error_mark_node
;
17478 coerce_innermost_template_parms (DECL_TEMPLATE_PARMS (tmpl
),
17479 args
, tmpl
, complain
,
17480 /*require_all_args=*/true,
17481 /*use_default_args=*/true);
17483 tree r
= instantiate_template (tmpl
, args
, complain
);
17484 pop_tinst_level ();
17485 /* We can't free this if a pending_template entry or last_error_tinst_level
17486 is pointing at it. */
17487 if (last_pending_template
== old_last_pend
17488 && last_error_tinst_level
== old_error_tinst
)
17494 /* PARM is a template parameter pack for FN. Returns true iff
17495 PARM is used in a deducible way in the argument list of FN. */
17498 pack_deducible_p (tree parm
, tree fn
)
17500 tree t
= FUNCTION_FIRST_USER_PARMTYPE (fn
);
17501 for (; t
; t
= TREE_CHAIN (t
))
17503 tree type
= TREE_VALUE (t
);
17505 if (!PACK_EXPANSION_P (type
))
17507 for (packs
= PACK_EXPANSION_PARAMETER_PACKS (type
);
17508 packs
; packs
= TREE_CHAIN (packs
))
17509 if (template_args_equal (TREE_VALUE (packs
), parm
))
17511 /* The template parameter pack is used in a function parameter
17512 pack. If this is the end of the parameter list, the
17513 template parameter pack is deducible. */
17514 if (TREE_CHAIN (t
) == void_list_node
)
17517 /* Otherwise, not. Well, it could be deduced from
17518 a non-pack parameter, but doing so would end up with
17519 a deduction mismatch, so don't bother. */
17523 /* The template parameter pack isn't used in any function parameter
17524 packs, but it might be used deeper, e.g. tuple<Args...>. */
17528 /* The FN is a TEMPLATE_DECL for a function. ARGS is an array with
17529 NARGS elements of the arguments that are being used when calling
17530 it. TARGS is a vector into which the deduced template arguments
17533 Returns either a FUNCTION_DECL for the matching specialization of FN or
17534 NULL_TREE if no suitable specialization can be found. If EXPLAIN_P is
17535 true, diagnostics will be printed to explain why it failed.
17537 If FN is a conversion operator, or we are trying to produce a specific
17538 specialization, RETURN_TYPE is the return type desired.
17540 The EXPLICIT_TARGS are explicit template arguments provided via a
17543 The parameter STRICT is one of:
17546 We are deducing arguments for a function call, as in
17547 [temp.deduct.call]. If RETURN_TYPE is non-null, we are
17548 deducing arguments for a call to the result of a conversion
17549 function template, as in [over.call.object].
17552 We are deducing arguments for a conversion function, as in
17553 [temp.deduct.conv].
17556 We are deducing arguments when doing an explicit instantiation
17557 as in [temp.explicit], when determining an explicit specialization
17558 as in [temp.expl.spec], or when taking the address of a function
17559 template, as in [temp.deduct.funcaddr]. */
17562 fn_type_unification (tree fn
,
17563 tree explicit_targs
,
17566 unsigned int nargs
,
17568 unification_kind_t strict
,
17575 tree decl
= NULL_TREE
;
17576 tsubst_flags_t complain
= (explain_p
? tf_warning_or_error
: tf_none
);
17578 static int deduction_depth
;
17579 struct pending_template
*old_last_pend
= last_pending_template
;
17580 struct tinst_level
*old_error_tinst
= last_error_tinst_level
;
17581 tree tparms
= DECL_INNERMOST_TEMPLATE_PARMS (fn
);
17583 tree r
= error_mark_node
;
17586 complain
|= tf_decltype
;
17588 /* In C++0x, it's possible to have a function template whose type depends
17589 on itself recursively. This is most obvious with decltype, but can also
17590 occur with enumeration scope (c++/48969). So we need to catch infinite
17591 recursion and reject the substitution at deduction time; this function
17592 will return error_mark_node for any repeated substitution.
17594 This also catches excessive recursion such as when f<N> depends on
17595 f<N-1> across all integers, and returns error_mark_node for all the
17596 substitutions back up to the initial one.
17598 This is, of course, not reentrant. */
17599 if (excessive_deduction_depth
)
17600 return error_mark_node
;
17601 tinst
= build_tree_list (fn
, NULL_TREE
);
17604 gcc_assert (TREE_CODE (fn
) == TEMPLATE_DECL
);
17606 fntype
= TREE_TYPE (fn
);
17607 if (explicit_targs
)
17611 The specified template arguments must match the template
17612 parameters in kind (i.e., type, nontype, template), and there
17613 must not be more arguments than there are parameters;
17614 otherwise type deduction fails.
17616 Nontype arguments must match the types of the corresponding
17617 nontype template parameters, or must be convertible to the
17618 types of the corresponding nontype parameters as specified in
17619 _temp.arg.nontype_, otherwise type deduction fails.
17621 All references in the function type of the function template
17622 to the corresponding template parameters are replaced by the
17623 specified template argument values. If a substitution in a
17624 template parameter or in the function type of the function
17625 template results in an invalid type, type deduction fails. */
17626 int i
, len
= TREE_VEC_LENGTH (tparms
);
17627 location_t loc
= input_location
;
17628 bool incomplete
= false;
17630 /* Adjust any explicit template arguments before entering the
17631 substitution context. */
17633 = (coerce_template_parms (tparms
, explicit_targs
, NULL_TREE
,
17635 /*require_all_args=*/false,
17636 /*use_default_args=*/false));
17637 if (explicit_targs
== error_mark_node
)
17640 /* Substitute the explicit args into the function type. This is
17641 necessary so that, for instance, explicitly declared function
17642 arguments can match null pointed constants. If we were given
17643 an incomplete set of explicit args, we must not do semantic
17644 processing during substitution as we could create partial
17646 for (i
= 0; i
< len
; i
++)
17648 tree parm
= TREE_VALUE (TREE_VEC_ELT (tparms
, i
));
17649 bool parameter_pack
= false;
17650 tree targ
= TREE_VEC_ELT (explicit_targs
, i
);
17652 /* Dig out the actual parm. */
17653 if (TREE_CODE (parm
) == TYPE_DECL
17654 || TREE_CODE (parm
) == TEMPLATE_DECL
)
17656 parm
= TREE_TYPE (parm
);
17657 parameter_pack
= TEMPLATE_TYPE_PARAMETER_PACK (parm
);
17659 else if (TREE_CODE (parm
) == PARM_DECL
)
17661 parm
= DECL_INITIAL (parm
);
17662 parameter_pack
= TEMPLATE_PARM_PARAMETER_PACK (parm
);
17665 if (!parameter_pack
&& targ
== NULL_TREE
)
17666 /* No explicit argument for this template parameter. */
17669 if (parameter_pack
&& pack_deducible_p (parm
, fn
))
17671 /* Mark the argument pack as "incomplete". We could
17672 still deduce more arguments during unification.
17673 We remove this mark in type_unification_real. */
17676 ARGUMENT_PACK_INCOMPLETE_P(targ
) = 1;
17677 ARGUMENT_PACK_EXPLICIT_ARGS (targ
)
17678 = ARGUMENT_PACK_ARGS (targ
);
17681 /* We have some incomplete argument packs. */
17686 TREE_VALUE (tinst
) = explicit_targs
;
17687 if (!push_tinst_level (tinst
))
17689 excessive_deduction_depth
= true;
17692 processing_template_decl
+= incomplete
;
17693 input_location
= DECL_SOURCE_LOCATION (fn
);
17694 /* Ignore any access checks; we'll see them again in
17695 instantiate_template and they might have the wrong
17696 access path at this point. */
17697 push_deferring_access_checks (dk_deferred
);
17698 fntype
= tsubst (TREE_TYPE (fn
), explicit_targs
,
17699 complain
| tf_partial
, NULL_TREE
);
17700 pop_deferring_access_checks ();
17701 input_location
= loc
;
17702 processing_template_decl
-= incomplete
;
17703 pop_tinst_level ();
17705 if (fntype
== error_mark_node
)
17708 /* Place the explicitly specified arguments in TARGS. */
17709 for (i
= NUM_TMPL_ARGS (explicit_targs
); i
--;)
17710 TREE_VEC_ELT (targs
, i
) = TREE_VEC_ELT (explicit_targs
, i
);
17713 /* Never do unification on the 'this' parameter. */
17714 parms
= skip_artificial_parms_for (fn
, TYPE_ARG_TYPES (fntype
));
17716 if (return_type
&& strict
== DEDUCE_CALL
)
17718 /* We're deducing for a call to the result of a template conversion
17719 function. The parms we really want are in return_type. */
17720 if (POINTER_TYPE_P (return_type
))
17721 return_type
= TREE_TYPE (return_type
);
17722 parms
= TYPE_ARG_TYPES (return_type
);
17724 else if (return_type
)
17728 parms
= tree_cons (NULL_TREE
, TREE_TYPE (fntype
), parms
);
17729 new_args
= XALLOCAVEC (tree
, nargs
+ 1);
17730 new_args
[0] = return_type
;
17731 memcpy (new_args
+ 1, args
, nargs
* sizeof (tree
));
17736 /* We allow incomplete unification without an error message here
17737 because the standard doesn't seem to explicitly prohibit it. Our
17738 callers must be ready to deal with unification failures in any
17741 TREE_VALUE (tinst
) = targs
;
17742 /* If we aren't explaining yet, push tinst context so we can see where
17743 any errors (e.g. from class instantiations triggered by instantiation
17744 of default template arguments) come from. If we are explaining, this
17745 context is redundant. */
17746 if (!explain_p
&& !push_tinst_level (tinst
))
17748 excessive_deduction_depth
= true;
17752 /* type_unification_real will pass back any access checks from default
17753 template argument substitution. */
17754 vec
<deferred_access_check
, va_gc
> *checks
;
17757 ok
= !type_unification_real (DECL_INNERMOST_TEMPLATE_PARMS (fn
),
17758 targs
, parms
, args
, nargs
, /*subr=*/0,
17759 strict
, flags
, &checks
, explain_p
);
17761 pop_tinst_level ();
17765 /* Now that we have bindings for all of the template arguments,
17766 ensure that the arguments deduced for the template template
17767 parameters have compatible template parameter lists. We cannot
17768 check this property before we have deduced all template
17769 arguments, because the template parameter types of a template
17770 template parameter might depend on prior template parameters
17771 deduced after the template template parameter. The following
17772 ill-formed example illustrates this issue:
17774 template<typename T, template<T> class C> void f(C<5>, T);
17776 template<int N> struct X {};
17779 f(X<5>(), 5l); // error: template argument deduction fails
17782 The template parameter list of 'C' depends on the template type
17783 parameter 'T', but 'C' is deduced to 'X' before 'T' is deduced to
17784 'long'. Thus, we can't check that 'C' cannot bind to 'X' at the
17785 time that we deduce 'C'. */
17786 if (!template_template_parm_bindings_ok_p
17787 (DECL_INNERMOST_TEMPLATE_PARMS (fn
), targs
))
17789 unify_inconsistent_template_template_parameters (explain_p
);
17793 /* All is well so far. Now, check:
17797 When all template arguments have been deduced, all uses of
17798 template parameters in nondeduced contexts are replaced with
17799 the corresponding deduced argument values. If the
17800 substitution results in an invalid type, as described above,
17801 type deduction fails. */
17802 TREE_VALUE (tinst
) = targs
;
17803 if (!push_tinst_level (tinst
))
17805 excessive_deduction_depth
= true;
17809 /* Also collect access checks from the instantiation. */
17810 reopen_deferring_access_checks (checks
);
17812 decl
= instantiate_template (fn
, targs
, complain
);
17814 checks
= get_deferred_access_checks ();
17815 pop_deferring_access_checks ();
17817 pop_tinst_level ();
17819 if (decl
== error_mark_node
)
17822 /* Now perform any access checks encountered during substitution. */
17823 push_access_scope (decl
);
17824 ok
= perform_access_checks (checks
, complain
);
17825 pop_access_scope (decl
);
17829 /* If we're looking for an exact match, check that what we got
17830 is indeed an exact match. It might not be if some template
17831 parameters are used in non-deduced contexts. But don't check
17832 for an exact match if we have dependent template arguments;
17833 in that case we're doing partial ordering, and we already know
17834 that we have two candidates that will provide the actual type. */
17835 if (strict
== DEDUCE_EXACT
&& !any_dependent_template_arguments_p (targs
))
17837 tree substed
= TREE_TYPE (decl
);
17841 = skip_artificial_parms_for (decl
, TYPE_ARG_TYPES (substed
));
17843 sarg
= tree_cons (NULL_TREE
, TREE_TYPE (substed
), sarg
);
17844 for (i
= 0; i
< nargs
&& sarg
; ++i
, sarg
= TREE_CHAIN (sarg
))
17845 if (!same_type_p (args
[i
], TREE_VALUE (sarg
)))
17847 unify_type_mismatch (explain_p
, args
[i
],
17848 TREE_VALUE (sarg
));
17857 if (excessive_deduction_depth
)
17859 if (deduction_depth
== 0)
17860 /* Reset once we're all the way out. */
17861 excessive_deduction_depth
= false;
17864 /* We can't free this if a pending_template entry or last_error_tinst_level
17865 is pointing at it. */
17866 if (last_pending_template
== old_last_pend
17867 && last_error_tinst_level
== old_error_tinst
)
17873 /* Adjust types before performing type deduction, as described in
17874 [temp.deduct.call] and [temp.deduct.conv]. The rules in these two
17875 sections are symmetric. PARM is the type of a function parameter
17876 or the return type of the conversion function. ARG is the type of
17877 the argument passed to the call, or the type of the value
17878 initialized with the result of the conversion function.
17879 ARG_EXPR is the original argument expression, which may be null. */
17882 maybe_adjust_types_for_deduction (unification_kind_t strict
,
17895 /* Swap PARM and ARG throughout the remainder of this
17896 function; the handling is precisely symmetric since PARM
17897 will initialize ARG rather than vice versa. */
17898 std::swap (parm
, arg
);
17902 /* Core issue #873: Do the DR606 thing (see below) for these cases,
17903 too, but here handle it by stripping the reference from PARM
17904 rather than by adding it to ARG. */
17905 if (TREE_CODE (*parm
) == REFERENCE_TYPE
17906 && TYPE_REF_IS_RVALUE (*parm
)
17907 && TREE_CODE (TREE_TYPE (*parm
)) == TEMPLATE_TYPE_PARM
17908 && cp_type_quals (TREE_TYPE (*parm
)) == TYPE_UNQUALIFIED
17909 && TREE_CODE (*arg
) == REFERENCE_TYPE
17910 && !TYPE_REF_IS_RVALUE (*arg
))
17911 *parm
= TREE_TYPE (*parm
);
17912 /* Nothing else to do in this case. */
17916 gcc_unreachable ();
17919 if (TREE_CODE (*parm
) != REFERENCE_TYPE
)
17921 /* [temp.deduct.call]
17923 If P is not a reference type:
17925 --If A is an array type, the pointer type produced by the
17926 array-to-pointer standard conversion (_conv.array_) is
17927 used in place of A for type deduction; otherwise,
17929 --If A is a function type, the pointer type produced by
17930 the function-to-pointer standard conversion
17931 (_conv.func_) is used in place of A for type deduction;
17934 --If A is a cv-qualified type, the top level
17935 cv-qualifiers of A's type are ignored for type
17937 if (TREE_CODE (*arg
) == ARRAY_TYPE
)
17938 *arg
= build_pointer_type (TREE_TYPE (*arg
));
17939 else if (TREE_CODE (*arg
) == FUNCTION_TYPE
)
17940 *arg
= build_pointer_type (*arg
);
17942 *arg
= TYPE_MAIN_VARIANT (*arg
);
17945 /* From C++0x [14.8.2.1/3 temp.deduct.call] (after DR606), "If P is
17946 of the form T&&, where T is a template parameter, and the argument
17947 is an lvalue, T is deduced as A& */
17948 if (TREE_CODE (*parm
) == REFERENCE_TYPE
17949 && TYPE_REF_IS_RVALUE (*parm
)
17950 && TREE_CODE (TREE_TYPE (*parm
)) == TEMPLATE_TYPE_PARM
17951 && cp_type_quals (TREE_TYPE (*parm
)) == TYPE_UNQUALIFIED
17952 && (arg_expr
? real_lvalue_p (arg_expr
)
17953 /* try_one_overload doesn't provide an arg_expr, but
17954 functions are always lvalues. */
17955 : TREE_CODE (*arg
) == FUNCTION_TYPE
))
17956 *arg
= build_reference_type (*arg
);
17958 /* [temp.deduct.call]
17960 If P is a cv-qualified type, the top level cv-qualifiers
17961 of P's type are ignored for type deduction. If P is a
17962 reference type, the type referred to by P is used for
17964 *parm
= TYPE_MAIN_VARIANT (*parm
);
17965 if (TREE_CODE (*parm
) == REFERENCE_TYPE
)
17967 *parm
= TREE_TYPE (*parm
);
17968 result
|= UNIFY_ALLOW_OUTER_MORE_CV_QUAL
;
17971 /* DR 322. For conversion deduction, remove a reference type on parm
17972 too (which has been swapped into ARG). */
17973 if (strict
== DEDUCE_CONV
&& TREE_CODE (*arg
) == REFERENCE_TYPE
)
17974 *arg
= TREE_TYPE (*arg
);
17979 /* Subroutine of unify_one_argument. PARM is a function parameter of a
17980 template which does contain any deducible template parameters; check if
17981 ARG is a suitable match for it. STRICT, FLAGS and EXPLAIN_P are as in
17982 unify_one_argument. */
17985 check_non_deducible_conversion (tree parm
, tree arg
, int strict
,
17986 int flags
, bool explain_p
)
17991 type
= TREE_TYPE (arg
);
17995 if (same_type_p (parm
, type
))
17996 return unify_success (explain_p
);
17998 if (strict
== DEDUCE_CONV
)
18000 if (can_convert_arg (type
, parm
, NULL_TREE
, flags
,
18001 explain_p
? tf_warning_or_error
: tf_none
))
18002 return unify_success (explain_p
);
18004 else if (strict
!= DEDUCE_EXACT
)
18006 if (can_convert_arg (parm
, type
,
18007 TYPE_P (arg
) ? NULL_TREE
: arg
,
18008 flags
, explain_p
? tf_warning_or_error
: tf_none
))
18009 return unify_success (explain_p
);
18012 if (strict
== DEDUCE_EXACT
)
18013 return unify_type_mismatch (explain_p
, parm
, arg
);
18015 return unify_arg_conversion (explain_p
, parm
, type
, arg
);
18018 static bool uses_deducible_template_parms (tree type
);
18020 /* Returns true iff the expression EXPR is one from which a template
18021 argument can be deduced. In other words, if it's an undecorated
18022 use of a template non-type parameter. */
18025 deducible_expression (tree expr
)
18027 return (TREE_CODE (expr
) == TEMPLATE_PARM_INDEX
);
18030 /* Returns true iff the array domain DOMAIN uses a template parameter in a
18031 deducible way; that is, if it has a max value of <PARM> - 1. */
18034 deducible_array_bound (tree domain
)
18036 if (domain
== NULL_TREE
)
18039 tree max
= TYPE_MAX_VALUE (domain
);
18040 if (TREE_CODE (max
) != MINUS_EXPR
)
18043 return deducible_expression (TREE_OPERAND (max
, 0));
18046 /* Returns true iff the template arguments ARGS use a template parameter
18047 in a deducible way. */
18050 deducible_template_args (tree args
)
18052 for (int i
= 0; i
< TREE_VEC_LENGTH (args
); ++i
)
18055 tree elt
= TREE_VEC_ELT (args
, i
);
18056 if (ARGUMENT_PACK_P (elt
))
18057 deducible
= deducible_template_args (ARGUMENT_PACK_ARGS (elt
));
18060 if (PACK_EXPANSION_P (elt
))
18061 elt
= PACK_EXPANSION_PATTERN (elt
);
18062 if (TREE_CODE (elt
) == TEMPLATE_TEMPLATE_PARM
)
18064 else if (TYPE_P (elt
))
18065 deducible
= uses_deducible_template_parms (elt
);
18067 deducible
= deducible_expression (elt
);
18075 /* Returns true iff TYPE contains any deducible references to template
18076 parameters, as per 14.8.2.5. */
18079 uses_deducible_template_parms (tree type
)
18081 if (PACK_EXPANSION_P (type
))
18082 type
= PACK_EXPANSION_PATTERN (type
);
18089 if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
18090 || TREE_CODE (type
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
18096 if (POINTER_TYPE_P (type
))
18097 return uses_deducible_template_parms (TREE_TYPE (type
));
18099 /* T[integer-constant ]
18101 if (TREE_CODE (type
) == ARRAY_TYPE
)
18102 return (uses_deducible_template_parms (TREE_TYPE (type
))
18103 || deducible_array_bound (TYPE_DOMAIN (type
)));
18115 if (TYPE_PTRMEM_P (type
))
18116 return (uses_deducible_template_parms (TYPE_PTRMEM_CLASS_TYPE (type
))
18117 || (uses_deducible_template_parms
18118 (TYPE_PTRMEM_POINTED_TO_TYPE (type
))));
18120 /* template-name <T> (where template-name refers to a class template)
18121 template-name <i> (where template-name refers to a class template) */
18122 if (CLASS_TYPE_P (type
)
18123 && CLASSTYPE_TEMPLATE_INFO (type
)
18124 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (type
)))
18125 return deducible_template_args (INNERMOST_TEMPLATE_ARGS
18126 (CLASSTYPE_TI_ARGS (type
)));
18131 if (TREE_CODE (type
) == FUNCTION_TYPE
18132 || TREE_CODE (type
) == METHOD_TYPE
)
18134 if (uses_deducible_template_parms (TREE_TYPE (type
)))
18136 tree parm
= TYPE_ARG_TYPES (type
);
18137 if (TREE_CODE (type
) == METHOD_TYPE
)
18138 parm
= TREE_CHAIN (parm
);
18139 for (; parm
; parm
= TREE_CHAIN (parm
))
18140 if (uses_deducible_template_parms (TREE_VALUE (parm
)))
18147 /* Subroutine of type_unification_real and unify_pack_expansion to
18148 handle unification of a single P/A pair. Parameters are as
18149 for those functions. */
18152 unify_one_argument (tree tparms
, tree targs
, tree parm
, tree arg
,
18153 int subr
, unification_kind_t strict
,
18156 tree arg_expr
= NULL_TREE
;
18159 if (arg
== error_mark_node
|| parm
== error_mark_node
)
18160 return unify_invalid (explain_p
);
18161 if (arg
== unknown_type_node
)
18162 /* We can't deduce anything from this, but we might get all the
18163 template args from other function args. */
18164 return unify_success (explain_p
);
18166 /* Implicit conversions (Clause 4) will be performed on a function
18167 argument to convert it to the type of the corresponding function
18168 parameter if the parameter type contains no template-parameters that
18169 participate in template argument deduction. */
18170 if (strict
!= DEDUCE_EXACT
18171 && TYPE_P (parm
) && !uses_deducible_template_parms (parm
))
18172 /* For function parameters with no deducible template parameters,
18173 just return. We'll check non-dependent conversions later. */
18174 return unify_success (explain_p
);
18179 arg_strict
= (UNIFY_ALLOW_OUTER_LEVEL
18180 | UNIFY_ALLOW_MORE_CV_QUAL
18181 | UNIFY_ALLOW_DERIVED
);
18185 arg_strict
= UNIFY_ALLOW_LESS_CV_QUAL
;
18189 arg_strict
= UNIFY_ALLOW_NONE
;
18193 gcc_unreachable ();
18196 /* We only do these transformations if this is the top-level
18197 parameter_type_list in a call or declaration matching; in other
18198 situations (nested function declarators, template argument lists) we
18199 won't be comparing a type to an expression, and we don't do any type
18205 gcc_assert (TREE_TYPE (arg
) != NULL_TREE
);
18206 if (type_unknown_p (arg
))
18208 /* [temp.deduct.type] A template-argument can be
18209 deduced from a pointer to function or pointer
18210 to member function argument if the set of
18211 overloaded functions does not contain function
18212 templates and at most one of a set of
18213 overloaded functions provides a unique
18216 if (resolve_overloaded_unification
18217 (tparms
, targs
, parm
, arg
, strict
,
18218 arg_strict
, explain_p
))
18219 return unify_success (explain_p
);
18220 return unify_overload_resolution_failure (explain_p
, arg
);
18224 arg
= unlowered_expr_type (arg
);
18225 if (arg
== error_mark_node
)
18226 return unify_invalid (explain_p
);
18230 maybe_adjust_types_for_deduction (strict
, &parm
, &arg
, arg_expr
);
18233 if ((TYPE_P (parm
) || TREE_CODE (parm
) == TEMPLATE_DECL
)
18234 != (TYPE_P (arg
) || TREE_CODE (arg
) == TEMPLATE_DECL
))
18235 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
18237 /* For deduction from an init-list we need the actual list. */
18238 if (arg_expr
&& BRACE_ENCLOSED_INITIALIZER_P (arg_expr
))
18240 return unify (tparms
, targs
, parm
, arg
, arg_strict
, explain_p
);
18243 /* Most parms like fn_type_unification.
18245 If SUBR is 1, we're being called recursively (to unify the
18246 arguments of a function or method parameter of a function
18249 CHECKS is a pointer to a vector of access checks encountered while
18250 substituting default template arguments. */
18253 type_unification_real (tree tparms
,
18257 unsigned int xnargs
,
18259 unification_kind_t strict
,
18261 vec
<deferred_access_check
, va_gc
> **checks
,
18266 int ntparms
= TREE_VEC_LENGTH (tparms
);
18267 int saw_undeduced
= 0;
18270 unsigned int nargs
;
18273 gcc_assert (TREE_CODE (tparms
) == TREE_VEC
);
18274 gcc_assert (xparms
== NULL_TREE
|| TREE_CODE (xparms
) == TREE_LIST
);
18275 gcc_assert (ntparms
> 0);
18277 /* Reset the number of non-defaulted template arguments contained
18279 NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
) = NULL_TREE
;
18287 while (parms
&& parms
!= void_list_node
18290 parm
= TREE_VALUE (parms
);
18292 if (TREE_CODE (parm
) == TYPE_PACK_EXPANSION
18293 && (!TREE_CHAIN (parms
) || TREE_CHAIN (parms
) == void_list_node
))
18294 /* For a function parameter pack that occurs at the end of the
18295 parameter-declaration-list, the type A of each remaining
18296 argument of the call is compared with the type P of the
18297 declarator-id of the function parameter pack. */
18300 parms
= TREE_CHAIN (parms
);
18302 if (TREE_CODE (parm
) == TYPE_PACK_EXPANSION
)
18303 /* For a function parameter pack that does not occur at the
18304 end of the parameter-declaration-list, the type of the
18305 parameter pack is a non-deduced context. */
18311 if (unify_one_argument (tparms
, targs
, parm
, arg
, subr
, strict
,
18317 && parms
!= void_list_node
18318 && TREE_CODE (TREE_VALUE (parms
)) == TYPE_PACK_EXPANSION
)
18320 /* Unify the remaining arguments with the pack expansion type. */
18322 tree parmvec
= make_tree_vec (1);
18324 /* Allocate a TREE_VEC and copy in all of the arguments */
18325 argvec
= make_tree_vec (nargs
- ia
);
18326 for (i
= 0; ia
< nargs
; ++ia
, ++i
)
18327 TREE_VEC_ELT (argvec
, i
) = args
[ia
];
18329 /* Copy the parameter into parmvec. */
18330 TREE_VEC_ELT (parmvec
, 0) = TREE_VALUE (parms
);
18331 if (unify_pack_expansion (tparms
, targs
, parmvec
, argvec
, strict
,
18332 /*subr=*/subr
, explain_p
))
18335 /* Advance to the end of the list of parameters. */
18336 parms
= TREE_CHAIN (parms
);
18339 /* Fail if we've reached the end of the parm list, and more args
18340 are present, and the parm list isn't variadic. */
18341 if (ia
< nargs
&& parms
== void_list_node
)
18342 return unify_too_many_arguments (explain_p
, nargs
, ia
);
18343 /* Fail if parms are left and they don't have default values and
18344 they aren't all deduced as empty packs (c++/57397). This is
18345 consistent with sufficient_parms_p. */
18346 if (parms
&& parms
!= void_list_node
18347 && TREE_PURPOSE (parms
) == NULL_TREE
)
18349 unsigned int count
= nargs
;
18354 type_pack_p
= TREE_CODE (TREE_VALUE (p
)) == TYPE_PACK_EXPANSION
;
18357 p
= TREE_CHAIN (p
);
18359 while (p
&& p
!= void_list_node
);
18360 if (count
!= nargs
)
18361 return unify_too_few_arguments (explain_p
, ia
, count
,
18367 tsubst_flags_t complain
= (explain_p
18368 ? tf_warning_or_error
18371 for (i
= 0; i
< ntparms
; i
++)
18373 tree targ
= TREE_VEC_ELT (targs
, i
);
18374 tree tparm
= TREE_VEC_ELT (tparms
, i
);
18376 /* Clear the "incomplete" flags on all argument packs now so that
18377 substituting them into later default arguments works. */
18378 if (targ
&& ARGUMENT_PACK_P (targ
))
18380 ARGUMENT_PACK_INCOMPLETE_P (targ
) = 0;
18381 ARGUMENT_PACK_EXPLICIT_ARGS (targ
) = NULL_TREE
;
18384 if (targ
|| tparm
== error_mark_node
)
18386 tparm
= TREE_VALUE (tparm
);
18388 /* If this is an undeduced nontype parameter that depends on
18389 a type parameter, try another pass; its type may have been
18390 deduced from a later argument than the one from which
18391 this parameter can be deduced. */
18392 if (TREE_CODE (tparm
) == PARM_DECL
18393 && uses_template_parms (TREE_TYPE (tparm
))
18394 && saw_undeduced
< 2)
18400 /* Core issue #226 (C++0x) [temp.deduct]:
18402 If a template argument has not been deduced, its
18403 default template argument, if any, is used.
18405 When we are in C++98 mode, TREE_PURPOSE will either
18406 be NULL_TREE or ERROR_MARK_NODE, so we do not need
18407 to explicitly check cxx_dialect here. */
18408 if (TREE_PURPOSE (TREE_VEC_ELT (tparms
, i
)))
18409 /* OK, there is a default argument. Wait until after the
18410 conversion check to do substitution. */
18413 /* If the type parameter is a parameter pack, then it will
18414 be deduced to an empty parameter pack. */
18415 if (template_parameter_pack_p (tparm
))
18419 if (TREE_CODE (tparm
) == TEMPLATE_PARM_INDEX
)
18421 arg
= make_node (NONTYPE_ARGUMENT_PACK
);
18422 TREE_TYPE (arg
) = TREE_TYPE (TEMPLATE_PARM_DECL (tparm
));
18423 TREE_CONSTANT (arg
) = 1;
18426 arg
= cxx_make_type (TYPE_ARGUMENT_PACK
);
18428 SET_ARGUMENT_PACK_ARGS (arg
, make_tree_vec (0));
18430 TREE_VEC_ELT (targs
, i
) = arg
;
18434 return unify_parameter_deduction_failure (explain_p
, tparm
);
18437 /* DR 1391: All parameters have args, now check non-dependent parms for
18439 if (saw_undeduced
< 2)
18440 for (ia
= 0, parms
= xparms
, args
= xargs
, nargs
= xnargs
;
18441 parms
&& parms
!= void_list_node
&& ia
< nargs
; )
18443 parm
= TREE_VALUE (parms
);
18445 if (TREE_CODE (parm
) == TYPE_PACK_EXPANSION
18446 && (!TREE_CHAIN (parms
)
18447 || TREE_CHAIN (parms
) == void_list_node
))
18448 /* For a function parameter pack that occurs at the end of the
18449 parameter-declaration-list, the type A of each remaining
18450 argument of the call is compared with the type P of the
18451 declarator-id of the function parameter pack. */
18454 parms
= TREE_CHAIN (parms
);
18456 if (TREE_CODE (parm
) == TYPE_PACK_EXPANSION
)
18457 /* For a function parameter pack that does not occur at the
18458 end of the parameter-declaration-list, the type of the
18459 parameter pack is a non-deduced context. */
18465 if (uses_template_parms (parm
))
18467 if (check_non_deducible_conversion (parm
, arg
, strict
, flags
,
18472 /* Now substitute into the default template arguments. */
18473 for (i
= 0; i
< ntparms
; i
++)
18475 tree targ
= TREE_VEC_ELT (targs
, i
);
18476 tree tparm
= TREE_VEC_ELT (tparms
, i
);
18478 if (targ
|| tparm
== error_mark_node
)
18480 tree parm
= TREE_VALUE (tparm
);
18482 if (TREE_CODE (parm
) == PARM_DECL
18483 && uses_template_parms (TREE_TYPE (parm
))
18484 && saw_undeduced
< 2)
18487 tree arg
= TREE_PURPOSE (tparm
);
18488 reopen_deferring_access_checks (*checks
);
18489 location_t save_loc
= input_location
;
18491 input_location
= DECL_SOURCE_LOCATION (parm
);
18492 arg
= tsubst_template_arg (arg
, targs
, complain
, NULL_TREE
);
18493 arg
= convert_template_argument (parm
, arg
, targs
, complain
,
18495 input_location
= save_loc
;
18496 *checks
= get_deferred_access_checks ();
18497 pop_deferring_access_checks ();
18498 if (arg
== error_mark_node
)
18502 TREE_VEC_ELT (targs
, i
) = arg
;
18503 /* The position of the first default template argument,
18504 is also the number of non-defaulted arguments in TARGS.
18506 if (!NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
))
18507 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
, i
);
18512 if (saw_undeduced
++ == 1)
18516 if (CHECKING_P
&& !NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
))
18517 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
, TREE_VEC_LENGTH (targs
));
18519 return unify_success (explain_p
);
18522 /* Subroutine of type_unification_real. Args are like the variables
18523 at the call site. ARG is an overloaded function (or template-id);
18524 we try deducing template args from each of the overloads, and if
18525 only one succeeds, we go with that. Modifies TARGS and returns
18526 true on success. */
18529 resolve_overloaded_unification (tree tparms
,
18533 unification_kind_t strict
,
18537 tree tempargs
= copy_node (targs
);
18539 tree goodfn
= NULL_TREE
;
18542 if (TREE_CODE (arg
) == ADDR_EXPR
)
18544 arg
= TREE_OPERAND (arg
, 0);
18550 if (TREE_CODE (arg
) == COMPONENT_REF
)
18551 /* Handle `&x' where `x' is some static or non-static member
18553 arg
= TREE_OPERAND (arg
, 1);
18555 if (TREE_CODE (arg
) == OFFSET_REF
)
18556 arg
= TREE_OPERAND (arg
, 1);
18558 /* Strip baselink information. */
18559 if (BASELINK_P (arg
))
18560 arg
= BASELINK_FUNCTIONS (arg
);
18562 if (TREE_CODE (arg
) == TEMPLATE_ID_EXPR
)
18564 /* If we got some explicit template args, we need to plug them into
18565 the affected templates before we try to unify, in case the
18566 explicit args will completely resolve the templates in question. */
18569 tree expl_subargs
= TREE_OPERAND (arg
, 1);
18570 arg
= TREE_OPERAND (arg
, 0);
18572 for (; arg
; arg
= OVL_NEXT (arg
))
18574 tree fn
= OVL_CURRENT (arg
);
18575 tree subargs
, elem
;
18577 if (TREE_CODE (fn
) != TEMPLATE_DECL
)
18580 subargs
= coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (fn
),
18581 expl_subargs
, NULL_TREE
, tf_none
,
18582 /*require_all_args=*/true,
18583 /*use_default_args=*/true);
18584 if (subargs
!= error_mark_node
18585 && !any_dependent_template_arguments_p (subargs
))
18587 elem
= TREE_TYPE (instantiate_template (fn
, subargs
, tf_none
));
18588 if (try_one_overload (tparms
, targs
, tempargs
, parm
,
18589 elem
, strict
, sub_strict
, addr_p
, explain_p
)
18590 && (!goodfn
|| !same_type_p (goodfn
, elem
)))
18599 /* If no templates (or more than one) are fully resolved by the
18600 explicit arguments, this template-id is a non-deduced context; it
18601 could still be OK if we deduce all template arguments for the
18602 enclosing call through other arguments. */
18606 else if (TREE_CODE (arg
) != OVERLOAD
18607 && TREE_CODE (arg
) != FUNCTION_DECL
)
18608 /* If ARG is, for example, "(0, &f)" then its type will be unknown
18609 -- but the deduction does not succeed because the expression is
18610 not just the function on its own. */
18613 for (; arg
; arg
= OVL_NEXT (arg
))
18614 if (try_one_overload (tparms
, targs
, tempargs
, parm
,
18615 TREE_TYPE (OVL_CURRENT (arg
)),
18616 strict
, sub_strict
, addr_p
, explain_p
)
18617 && (!goodfn
|| !decls_match (goodfn
, OVL_CURRENT (arg
))))
18619 goodfn
= OVL_CURRENT (arg
);
18623 /* [temp.deduct.type] A template-argument can be deduced from a pointer
18624 to function or pointer to member function argument if the set of
18625 overloaded functions does not contain function templates and at most
18626 one of a set of overloaded functions provides a unique match.
18628 So if we found multiple possibilities, we return success but don't
18629 deduce anything. */
18633 int i
= TREE_VEC_LENGTH (targs
);
18635 if (TREE_VEC_ELT (tempargs
, i
))
18637 tree old
= TREE_VEC_ELT (targs
, i
);
18638 tree new_
= TREE_VEC_ELT (tempargs
, i
);
18639 if (new_
&& old
&& ARGUMENT_PACK_P (old
)
18640 && ARGUMENT_PACK_EXPLICIT_ARGS (old
))
18641 /* Don't forget explicit template arguments in a pack. */
18642 ARGUMENT_PACK_EXPLICIT_ARGS (new_
)
18643 = ARGUMENT_PACK_EXPLICIT_ARGS (old
);
18644 TREE_VEC_ELT (targs
, i
) = new_
;
18653 /* Core DR 115: In contexts where deduction is done and fails, or in
18654 contexts where deduction is not done, if a template argument list is
18655 specified and it, along with any default template arguments, identifies
18656 a single function template specialization, then the template-id is an
18657 lvalue for the function template specialization. */
18660 resolve_nondeduced_context (tree orig_expr
, tsubst_flags_t complain
)
18662 tree expr
, offset
, baselink
;
18665 if (!type_unknown_p (orig_expr
))
18670 offset
= NULL_TREE
;
18671 baselink
= NULL_TREE
;
18673 if (TREE_CODE (expr
) == ADDR_EXPR
)
18675 expr
= TREE_OPERAND (expr
, 0);
18678 if (TREE_CODE (expr
) == OFFSET_REF
)
18681 expr
= TREE_OPERAND (expr
, 1);
18683 if (BASELINK_P (expr
))
18686 expr
= BASELINK_FUNCTIONS (expr
);
18689 if (TREE_CODE (expr
) == TEMPLATE_ID_EXPR
)
18692 tree goodfn
= NULL_TREE
;
18694 /* If we got some explicit template args, we need to plug them into
18695 the affected templates before we try to unify, in case the
18696 explicit args will completely resolve the templates in question. */
18698 tree expl_subargs
= TREE_OPERAND (expr
, 1);
18699 tree arg
= TREE_OPERAND (expr
, 0);
18700 tree badfn
= NULL_TREE
;
18701 tree badargs
= NULL_TREE
;
18703 for (; arg
; arg
= OVL_NEXT (arg
))
18705 tree fn
= OVL_CURRENT (arg
);
18706 tree subargs
, elem
;
18708 if (TREE_CODE (fn
) != TEMPLATE_DECL
)
18711 subargs
= coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (fn
),
18712 expl_subargs
, NULL_TREE
, tf_none
,
18713 /*require_all_args=*/true,
18714 /*use_default_args=*/true);
18715 if (subargs
!= error_mark_node
18716 && !any_dependent_template_arguments_p (subargs
))
18718 elem
= instantiate_template (fn
, subargs
, tf_none
);
18719 if (elem
== error_mark_node
)
18724 else if (elem
&& (!goodfn
|| !decls_match (goodfn
, elem
)))
18733 mark_used (goodfn
);
18736 expr
= build_baselink (BASELINK_BINFO (baselink
),
18737 BASELINK_ACCESS_BINFO (baselink
),
18738 expr
, BASELINK_OPTYPE (baselink
));
18742 = TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (offset
, 0)));
18743 expr
= build_offset_ref (base
, expr
, addr
, complain
);
18746 expr
= cp_build_addr_expr (expr
, complain
);
18749 else if (good
== 0 && badargs
&& (complain
& tf_error
))
18750 /* There were no good options and at least one bad one, so let the
18751 user know what the problem is. */
18752 instantiate_template (badfn
, badargs
, complain
);
18757 /* Subroutine of resolve_overloaded_unification; does deduction for a single
18758 overload. Fills TARGS with any deduced arguments, or error_mark_node if
18759 different overloads deduce different arguments for a given parm.
18760 ADDR_P is true if the expression for which deduction is being
18761 performed was of the form "& fn" rather than simply "fn".
18763 Returns 1 on success. */
18766 try_one_overload (tree tparms
,
18771 unification_kind_t strict
,
18780 if (arg
== error_mark_node
)
18783 /* [temp.deduct.type] A template-argument can be deduced from a pointer
18784 to function or pointer to member function argument if the set of
18785 overloaded functions does not contain function templates and at most
18786 one of a set of overloaded functions provides a unique match.
18788 So if this is a template, just return success. */
18790 if (uses_template_parms (arg
))
18793 if (TREE_CODE (arg
) == METHOD_TYPE
)
18794 arg
= build_ptrmemfunc_type (build_pointer_type (arg
));
18796 arg
= build_pointer_type (arg
);
18798 sub_strict
|= maybe_adjust_types_for_deduction (strict
, &parm
, &arg
, NULL
);
18800 /* We don't copy orig_targs for this because if we have already deduced
18801 some template args from previous args, unify would complain when we
18802 try to deduce a template parameter for the same argument, even though
18803 there isn't really a conflict. */
18804 nargs
= TREE_VEC_LENGTH (targs
);
18805 tempargs
= make_tree_vec (nargs
);
18807 if (unify (tparms
, tempargs
, parm
, arg
, sub_strict
, explain_p
))
18810 /* First make sure we didn't deduce anything that conflicts with
18811 explicitly specified args. */
18812 for (i
= nargs
; i
--; )
18814 tree elt
= TREE_VEC_ELT (tempargs
, i
);
18815 tree oldelt
= TREE_VEC_ELT (orig_targs
, i
);
18819 else if (uses_template_parms (elt
))
18820 /* Since we're unifying against ourselves, we will fill in
18821 template args used in the function parm list with our own
18822 template parms. Discard them. */
18823 TREE_VEC_ELT (tempargs
, i
) = NULL_TREE
;
18824 else if (oldelt
&& ARGUMENT_PACK_P (oldelt
))
18826 /* Check that the argument at each index of the deduced argument pack
18827 is equivalent to the corresponding explicitly specified argument.
18828 We may have deduced more arguments than were explicitly specified,
18830 gcc_assert (ARGUMENT_PACK_INCOMPLETE_P (oldelt
));
18831 gcc_assert (ARGUMENT_PACK_ARGS (oldelt
)
18832 == ARGUMENT_PACK_EXPLICIT_ARGS (oldelt
));
18834 tree explicit_pack
= ARGUMENT_PACK_ARGS (oldelt
);
18835 tree deduced_pack
= ARGUMENT_PACK_ARGS (elt
);
18837 if (TREE_VEC_LENGTH (deduced_pack
)
18838 < TREE_VEC_LENGTH (explicit_pack
))
18841 for (int j
= 0; j
< TREE_VEC_LENGTH (explicit_pack
); j
++)
18842 if (!template_args_equal (TREE_VEC_ELT (explicit_pack
, j
),
18843 TREE_VEC_ELT (deduced_pack
, j
)))
18846 else if (oldelt
&& !template_args_equal (oldelt
, elt
))
18850 for (i
= nargs
; i
--; )
18852 tree elt
= TREE_VEC_ELT (tempargs
, i
);
18855 TREE_VEC_ELT (targs
, i
) = elt
;
18861 /* PARM is a template class (perhaps with unbound template
18862 parameters). ARG is a fully instantiated type. If ARG can be
18863 bound to PARM, return ARG, otherwise return NULL_TREE. TPARMS and
18864 TARGS are as for unify. */
18867 try_class_unification (tree tparms
, tree targs
, tree parm
, tree arg
,
18870 tree copy_of_targs
;
18872 if (!CLASSTYPE_TEMPLATE_INFO (arg
)
18873 || (most_general_template (CLASSTYPE_TI_TEMPLATE (arg
))
18874 != most_general_template (CLASSTYPE_TI_TEMPLATE (parm
))))
18877 /* We need to make a new template argument vector for the call to
18878 unify. If we used TARGS, we'd clutter it up with the result of
18879 the attempted unification, even if this class didn't work out.
18880 We also don't want to commit ourselves to all the unifications
18881 we've already done, since unification is supposed to be done on
18882 an argument-by-argument basis. In other words, consider the
18883 following pathological case:
18885 template <int I, int J, int K>
18888 template <int I, int J>
18889 struct S<I, J, 2> : public S<I, I, I>, S<J, J, J> {};
18891 template <int I, int J, int K>
18892 void f(S<I, J, K>, S<I, I, I>);
18901 Now, by the time we consider the unification involving `s2', we
18902 already know that we must have `f<0, 0, 0>'. But, even though
18903 `S<0, 1, 2>' is derived from `S<0, 0, 0>', the code is invalid
18904 because there are two ways to unify base classes of S<0, 1, 2>
18905 with S<I, I, I>. If we kept the already deduced knowledge, we
18906 would reject the possibility I=1. */
18907 copy_of_targs
= make_tree_vec (TREE_VEC_LENGTH (targs
));
18909 /* If unification failed, we're done. */
18910 if (unify (tparms
, copy_of_targs
, CLASSTYPE_TI_ARGS (parm
),
18911 CLASSTYPE_TI_ARGS (arg
), UNIFY_ALLOW_NONE
, explain_p
))
18917 /* Given a template type PARM and a class type ARG, find the unique
18918 base type in ARG that is an instance of PARM. We do not examine
18919 ARG itself; only its base-classes. If there is not exactly one
18920 appropriate base class, return NULL_TREE. PARM may be the type of
18921 a partial specialization, as well as a plain template type. Used
18924 static enum template_base_result
18925 get_template_base (tree tparms
, tree targs
, tree parm
, tree arg
,
18926 bool explain_p
, tree
*result
)
18928 tree rval
= NULL_TREE
;
18931 gcc_assert (RECORD_OR_UNION_CODE_P (TREE_CODE (arg
)));
18933 binfo
= TYPE_BINFO (complete_type (arg
));
18936 /* The type could not be completed. */
18937 *result
= NULL_TREE
;
18938 return tbr_incomplete_type
;
18941 /* Walk in inheritance graph order. The search order is not
18942 important, and this avoids multiple walks of virtual bases. */
18943 for (binfo
= TREE_CHAIN (binfo
); binfo
; binfo
= TREE_CHAIN (binfo
))
18945 tree r
= try_class_unification (tparms
, targs
, parm
,
18946 BINFO_TYPE (binfo
), explain_p
);
18950 /* If there is more than one satisfactory baseclass, then:
18954 If they yield more than one possible deduced A, the type
18958 if (rval
&& !same_type_p (r
, rval
))
18960 *result
= NULL_TREE
;
18961 return tbr_ambiguous_baseclass
;
18969 return tbr_success
;
18972 /* Returns the level of DECL, which declares a template parameter. */
18975 template_decl_level (tree decl
)
18977 switch (TREE_CODE (decl
))
18980 case TEMPLATE_DECL
:
18981 return TEMPLATE_TYPE_LEVEL (TREE_TYPE (decl
));
18984 return TEMPLATE_PARM_LEVEL (DECL_INITIAL (decl
));
18987 gcc_unreachable ();
18992 /* Decide whether ARG can be unified with PARM, considering only the
18993 cv-qualifiers of each type, given STRICT as documented for unify.
18994 Returns nonzero iff the unification is OK on that basis. */
18997 check_cv_quals_for_unify (int strict
, tree arg
, tree parm
)
18999 int arg_quals
= cp_type_quals (arg
);
19000 int parm_quals
= cp_type_quals (parm
);
19002 if (TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
19003 && !(strict
& UNIFY_ALLOW_OUTER_MORE_CV_QUAL
))
19005 /* Although a CVR qualifier is ignored when being applied to a
19006 substituted template parameter ([8.3.2]/1 for example), that
19007 does not allow us to unify "const T" with "int&" because both
19008 types are not of the form "cv-list T" [14.8.2.5 temp.deduct.type].
19009 It is ok when we're allowing additional CV qualifiers
19010 at the outer level [14.8.2.1]/3,1st bullet. */
19011 if ((TREE_CODE (arg
) == REFERENCE_TYPE
19012 || TREE_CODE (arg
) == FUNCTION_TYPE
19013 || TREE_CODE (arg
) == METHOD_TYPE
)
19014 && (parm_quals
& (TYPE_QUAL_CONST
| TYPE_QUAL_VOLATILE
)))
19017 if ((!POINTER_TYPE_P (arg
) && TREE_CODE (arg
) != TEMPLATE_TYPE_PARM
)
19018 && (parm_quals
& TYPE_QUAL_RESTRICT
))
19022 if (!(strict
& (UNIFY_ALLOW_MORE_CV_QUAL
| UNIFY_ALLOW_OUTER_MORE_CV_QUAL
))
19023 && (arg_quals
& parm_quals
) != parm_quals
)
19026 if (!(strict
& (UNIFY_ALLOW_LESS_CV_QUAL
| UNIFY_ALLOW_OUTER_LESS_CV_QUAL
))
19027 && (parm_quals
& arg_quals
) != arg_quals
)
19033 /* Determines the LEVEL and INDEX for the template parameter PARM. */
19035 template_parm_level_and_index (tree parm
, int* level
, int* index
)
19037 if (TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
19038 || TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
19039 || TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
19041 *index
= TEMPLATE_TYPE_IDX (parm
);
19042 *level
= TEMPLATE_TYPE_LEVEL (parm
);
19046 *index
= TEMPLATE_PARM_IDX (parm
);
19047 *level
= TEMPLATE_PARM_LEVEL (parm
);
19051 #define RECUR_AND_CHECK_FAILURE(TP, TA, P, A, S, EP) \
19053 if (unify (TP, TA, P, A, S, EP)) \
19057 /* Unifies the remaining arguments in PACKED_ARGS with the pack
19058 expansion at the end of PACKED_PARMS. Returns 0 if the type
19059 deduction succeeds, 1 otherwise. STRICT is the same as in
19060 unify. CALL_ARGS_P is true iff PACKED_ARGS is actually a function
19061 call argument list. We'll need to adjust the arguments to make them
19062 types. SUBR tells us if this is from a recursive call to
19063 type_unification_real, or for comparing two template argument
19067 unify_pack_expansion (tree tparms
, tree targs
, tree packed_parms
,
19068 tree packed_args
, unification_kind_t strict
,
19069 bool subr
, bool explain_p
)
19072 = TREE_VEC_ELT (packed_parms
, TREE_VEC_LENGTH (packed_parms
) - 1);
19073 tree pattern
= PACK_EXPANSION_PATTERN (parm
);
19074 tree pack
, packs
= NULL_TREE
;
19075 int i
, start
= TREE_VEC_LENGTH (packed_parms
) - 1;
19077 packed_args
= expand_template_argument_pack (packed_args
);
19079 int len
= TREE_VEC_LENGTH (packed_args
);
19081 /* Determine the parameter packs we will be deducing from the
19082 pattern, and record their current deductions. */
19083 for (pack
= PACK_EXPANSION_PARAMETER_PACKS (parm
);
19084 pack
; pack
= TREE_CHAIN (pack
))
19086 tree parm_pack
= TREE_VALUE (pack
);
19089 /* Determine the index and level of this parameter pack. */
19090 template_parm_level_and_index (parm_pack
, &level
, &idx
);
19092 /* Keep track of the parameter packs and their corresponding
19094 packs
= tree_cons (parm_pack
, TMPL_ARG (targs
, level
, idx
), packs
);
19095 TREE_TYPE (packs
) = make_tree_vec (len
- start
);
19098 /* Loop through all of the arguments that have not yet been
19099 unified and unify each with the pattern. */
19100 for (i
= start
; i
< len
; i
++)
19103 bool any_explicit
= false;
19104 tree arg
= TREE_VEC_ELT (packed_args
, i
);
19106 /* For each parameter pack, set its TMPL_ARG to either NULL_TREE
19107 or the element of its argument pack at the current index if
19108 this argument was explicitly specified. */
19109 for (pack
= packs
; pack
; pack
= TREE_CHAIN (pack
))
19113 template_parm_level_and_index (TREE_PURPOSE (pack
), &level
, &idx
);
19116 if (TREE_VALUE (pack
)
19117 && (pargs
= ARGUMENT_PACK_EXPLICIT_ARGS (TREE_VALUE (pack
)))
19118 && (i
- start
< TREE_VEC_LENGTH (pargs
)))
19120 any_explicit
= true;
19121 arg
= TREE_VEC_ELT (pargs
, i
- start
);
19123 TMPL_ARG (targs
, level
, idx
) = arg
;
19126 /* If we had explicit template arguments, substitute them into the
19127 pattern before deduction. */
19130 /* Some arguments might still be unspecified or dependent. */
19132 ++processing_template_decl
;
19133 dependent
= any_dependent_template_arguments_p (targs
);
19135 --processing_template_decl
;
19136 parm
= tsubst (pattern
, targs
,
19137 explain_p
? tf_warning_or_error
: tf_none
,
19140 --processing_template_decl
;
19141 if (parm
== error_mark_node
)
19147 /* Unify the pattern with the current argument. */
19148 if (unify_one_argument (tparms
, targs
, parm
, arg
, subr
, strict
,
19152 /* For each parameter pack, collect the deduced value. */
19153 for (pack
= packs
; pack
; pack
= TREE_CHAIN (pack
))
19156 template_parm_level_and_index (TREE_PURPOSE (pack
), &level
, &idx
);
19158 TREE_VEC_ELT (TREE_TYPE (pack
), i
- start
) =
19159 TMPL_ARG (targs
, level
, idx
);
19163 /* Verify that the results of unification with the parameter packs
19164 produce results consistent with what we've seen before, and make
19165 the deduced argument packs available. */
19166 for (pack
= packs
; pack
; pack
= TREE_CHAIN (pack
))
19168 tree old_pack
= TREE_VALUE (pack
);
19169 tree new_args
= TREE_TYPE (pack
);
19170 int i
, len
= TREE_VEC_LENGTH (new_args
);
19172 bool nondeduced_p
= false;
19174 /* By default keep the original deduced argument pack.
19175 If necessary, more specific code is going to update the
19176 resulting deduced argument later down in this function. */
19177 template_parm_level_and_index (TREE_PURPOSE (pack
), &level
, &idx
);
19178 TMPL_ARG (targs
, level
, idx
) = old_pack
;
19180 /* If NEW_ARGS contains any NULL_TREE entries, we didn't
19181 actually deduce anything. */
19182 for (i
= 0; i
< len
&& !nondeduced_p
; ++i
)
19183 if (TREE_VEC_ELT (new_args
, i
) == NULL_TREE
)
19184 nondeduced_p
= true;
19188 if (old_pack
&& ARGUMENT_PACK_INCOMPLETE_P (old_pack
))
19190 /* If we had fewer function args than explicit template args,
19191 just use the explicits. */
19192 tree explicit_args
= ARGUMENT_PACK_EXPLICIT_ARGS (old_pack
);
19193 int explicit_len
= TREE_VEC_LENGTH (explicit_args
);
19194 if (len
< explicit_len
)
19195 new_args
= explicit_args
;
19201 /* Build the deduced *_ARGUMENT_PACK. */
19202 if (TREE_CODE (TREE_PURPOSE (pack
)) == TEMPLATE_PARM_INDEX
)
19204 result
= make_node (NONTYPE_ARGUMENT_PACK
);
19205 TREE_TYPE (result
) =
19206 TREE_TYPE (TEMPLATE_PARM_DECL (TREE_PURPOSE (pack
)));
19207 TREE_CONSTANT (result
) = 1;
19210 result
= cxx_make_type (TYPE_ARGUMENT_PACK
);
19212 SET_ARGUMENT_PACK_ARGS (result
, new_args
);
19214 /* Note the deduced argument packs for this parameter
19216 TMPL_ARG (targs
, level
, idx
) = result
;
19218 else if (ARGUMENT_PACK_INCOMPLETE_P (old_pack
)
19219 && (ARGUMENT_PACK_ARGS (old_pack
)
19220 == ARGUMENT_PACK_EXPLICIT_ARGS (old_pack
)))
19222 /* We only had the explicitly-provided arguments before, but
19223 now we have a complete set of arguments. */
19224 tree explicit_args
= ARGUMENT_PACK_EXPLICIT_ARGS (old_pack
);
19226 SET_ARGUMENT_PACK_ARGS (old_pack
, new_args
);
19227 ARGUMENT_PACK_INCOMPLETE_P (old_pack
) = 1;
19228 ARGUMENT_PACK_EXPLICIT_ARGS (old_pack
) = explicit_args
;
19232 tree bad_old_arg
= NULL_TREE
, bad_new_arg
= NULL_TREE
;
19233 tree old_args
= ARGUMENT_PACK_ARGS (old_pack
);
19235 if (!comp_template_args (old_args
, new_args
,
19236 &bad_old_arg
, &bad_new_arg
))
19237 /* Inconsistent unification of this parameter pack. */
19238 return unify_parameter_pack_inconsistent (explain_p
,
19244 return unify_success (explain_p
);
19247 /* Handle unification of the domain of an array. PARM_DOM and ARG_DOM are
19248 INTEGER_TYPEs representing the TYPE_DOMAIN of ARRAY_TYPEs. The other
19249 parameters and return value are as for unify. */
19252 unify_array_domain (tree tparms
, tree targs
,
19253 tree parm_dom
, tree arg_dom
,
19261 /* Our representation of array types uses "N - 1" as the
19262 TYPE_MAX_VALUE for an array with "N" elements, if "N" is
19263 not an integer constant. We cannot unify arbitrarily
19264 complex expressions, so we eliminate the MINUS_EXPRs
19266 parm_max
= TYPE_MAX_VALUE (parm_dom
);
19267 parm_cst
= TREE_CODE (parm_max
) == INTEGER_CST
;
19270 gcc_assert (TREE_CODE (parm_max
) == MINUS_EXPR
);
19271 parm_max
= TREE_OPERAND (parm_max
, 0);
19273 arg_max
= TYPE_MAX_VALUE (arg_dom
);
19274 arg_cst
= TREE_CODE (arg_max
) == INTEGER_CST
;
19277 /* The ARG_MAX may not be a simple MINUS_EXPR, if we are
19278 trying to unify the type of a variable with the type
19279 of a template parameter. For example:
19281 template <unsigned int N>
19282 void f (char (&) [N]);
19289 Here, the type of the ARG will be "int [g(i)]", and
19290 may be a SAVE_EXPR, etc. */
19291 if (TREE_CODE (arg_max
) != MINUS_EXPR
)
19292 return unify_vla_arg (explain_p
, arg_dom
);
19293 arg_max
= TREE_OPERAND (arg_max
, 0);
19296 /* If only one of the bounds used a MINUS_EXPR, compensate
19297 by adding one to the other bound. */
19298 if (parm_cst
&& !arg_cst
)
19299 parm_max
= fold_build2_loc (input_location
, PLUS_EXPR
,
19303 else if (arg_cst
&& !parm_cst
)
19304 arg_max
= fold_build2_loc (input_location
, PLUS_EXPR
,
19309 return unify (tparms
, targs
, parm_max
, arg_max
,
19310 UNIFY_ALLOW_INTEGER
, explain_p
);
19313 /* Deduce the value of template parameters. TPARMS is the (innermost)
19314 set of template parameters to a template. TARGS is the bindings
19315 for those template parameters, as determined thus far; TARGS may
19316 include template arguments for outer levels of template parameters
19317 as well. PARM is a parameter to a template function, or a
19318 subcomponent of that parameter; ARG is the corresponding argument.
19319 This function attempts to match PARM with ARG in a manner
19320 consistent with the existing assignments in TARGS. If more values
19321 are deduced, then TARGS is updated.
19323 Returns 0 if the type deduction succeeds, 1 otherwise. The
19324 parameter STRICT is a bitwise or of the following flags:
19327 Require an exact match between PARM and ARG.
19328 UNIFY_ALLOW_MORE_CV_QUAL:
19329 Allow the deduced ARG to be more cv-qualified (by qualification
19330 conversion) than ARG.
19331 UNIFY_ALLOW_LESS_CV_QUAL:
19332 Allow the deduced ARG to be less cv-qualified than ARG.
19333 UNIFY_ALLOW_DERIVED:
19334 Allow the deduced ARG to be a template base class of ARG,
19335 or a pointer to a template base class of the type pointed to by
19337 UNIFY_ALLOW_INTEGER:
19338 Allow any integral type to be deduced. See the TEMPLATE_PARM_INDEX
19339 case for more information.
19340 UNIFY_ALLOW_OUTER_LEVEL:
19341 This is the outermost level of a deduction. Used to determine validity
19342 of qualification conversions. A valid qualification conversion must
19343 have const qualified pointers leading up to the inner type which
19344 requires additional CV quals, except at the outer level, where const
19345 is not required [conv.qual]. It would be normal to set this flag in
19346 addition to setting UNIFY_ALLOW_MORE_CV_QUAL.
19347 UNIFY_ALLOW_OUTER_MORE_CV_QUAL:
19348 This is the outermost level of a deduction, and PARM can be more CV
19349 qualified at this point.
19350 UNIFY_ALLOW_OUTER_LESS_CV_QUAL:
19351 This is the outermost level of a deduction, and PARM can be less CV
19352 qualified at this point. */
19355 unify (tree tparms
, tree targs
, tree parm
, tree arg
, int strict
,
19361 int strict_in
= strict
;
19363 /* I don't think this will do the right thing with respect to types.
19364 But the only case I've seen it in so far has been array bounds, where
19365 signedness is the only information lost, and I think that will be
19367 while (TREE_CODE (parm
) == NOP_EXPR
)
19368 parm
= TREE_OPERAND (parm
, 0);
19370 if (arg
== error_mark_node
)
19371 return unify_invalid (explain_p
);
19372 if (arg
== unknown_type_node
19373 || arg
== init_list_type_node
)
19374 /* We can't deduce anything from this, but we might get all the
19375 template args from other function args. */
19376 return unify_success (explain_p
);
19378 /* If PARM uses template parameters, then we can't bail out here,
19379 even if ARG == PARM, since we won't record unifications for the
19380 template parameters. We might need them if we're trying to
19381 figure out which of two things is more specialized. */
19382 if (arg
== parm
&& !uses_template_parms (parm
))
19383 return unify_success (explain_p
);
19385 /* Handle init lists early, so the rest of the function can assume
19386 we're dealing with a type. */
19387 if (BRACE_ENCLOSED_INITIALIZER_P (arg
))
19391 tree orig_parm
= parm
;
19393 /* Replace T with std::initializer_list<T> for deduction. */
19394 if (TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
19395 && flag_deduce_init_list
)
19396 parm
= listify (parm
);
19398 if (!is_std_init_list (parm
)
19399 && TREE_CODE (parm
) != ARRAY_TYPE
)
19400 /* We can only deduce from an initializer list argument if the
19401 parameter is std::initializer_list or an array; otherwise this
19402 is a non-deduced context. */
19403 return unify_success (explain_p
);
19405 if (TREE_CODE (parm
) == ARRAY_TYPE
)
19406 elttype
= TREE_TYPE (parm
);
19409 elttype
= TREE_VEC_ELT (CLASSTYPE_TI_ARGS (parm
), 0);
19410 /* Deduction is defined in terms of a single type, so just punt
19411 on the (bizarre) std::initializer_list<T...>. */
19412 if (PACK_EXPANSION_P (elttype
))
19413 return unify_success (explain_p
);
19416 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (arg
), i
, elt
)
19418 int elt_strict
= strict
;
19420 if (elt
== error_mark_node
)
19421 return unify_invalid (explain_p
);
19423 if (!BRACE_ENCLOSED_INITIALIZER_P (elt
))
19425 tree type
= TREE_TYPE (elt
);
19426 if (type
== error_mark_node
)
19427 return unify_invalid (explain_p
);
19428 /* It should only be possible to get here for a call. */
19429 gcc_assert (elt_strict
& UNIFY_ALLOW_OUTER_LEVEL
);
19430 elt_strict
|= maybe_adjust_types_for_deduction
19431 (DEDUCE_CALL
, &elttype
, &type
, elt
);
19435 RECUR_AND_CHECK_FAILURE (tparms
, targs
, elttype
, elt
, elt_strict
,
19439 if (TREE_CODE (parm
) == ARRAY_TYPE
19440 && deducible_array_bound (TYPE_DOMAIN (parm
)))
19442 /* Also deduce from the length of the initializer list. */
19443 tree max
= size_int (CONSTRUCTOR_NELTS (arg
));
19444 tree idx
= compute_array_index_type (NULL_TREE
, max
, tf_none
);
19445 if (idx
== error_mark_node
)
19446 return unify_invalid (explain_p
);
19447 return unify_array_domain (tparms
, targs
, TYPE_DOMAIN (parm
),
19451 /* If the std::initializer_list<T> deduction worked, replace the
19452 deduced A with std::initializer_list<A>. */
19453 if (orig_parm
!= parm
)
19455 idx
= TEMPLATE_TYPE_IDX (orig_parm
);
19456 targ
= TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
);
19457 targ
= listify (targ
);
19458 TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
) = targ
;
19460 return unify_success (explain_p
);
19463 /* Immediately reject some pairs that won't unify because of
19464 cv-qualification mismatches. */
19465 if (TREE_CODE (arg
) == TREE_CODE (parm
)
19467 /* It is the elements of the array which hold the cv quals of an array
19468 type, and the elements might be template type parms. We'll check
19469 when we recurse. */
19470 && TREE_CODE (arg
) != ARRAY_TYPE
19471 /* We check the cv-qualifiers when unifying with template type
19472 parameters below. We want to allow ARG `const T' to unify with
19473 PARM `T' for example, when computing which of two templates
19474 is more specialized, for example. */
19475 && TREE_CODE (arg
) != TEMPLATE_TYPE_PARM
19476 && !check_cv_quals_for_unify (strict_in
, arg
, parm
))
19477 return unify_cv_qual_mismatch (explain_p
, parm
, arg
);
19479 if (!(strict
& UNIFY_ALLOW_OUTER_LEVEL
)
19480 && TYPE_P (parm
) && !CP_TYPE_CONST_P (parm
))
19481 strict
&= ~UNIFY_ALLOW_MORE_CV_QUAL
;
19482 strict
&= ~UNIFY_ALLOW_OUTER_LEVEL
;
19483 strict
&= ~UNIFY_ALLOW_DERIVED
;
19484 strict
&= ~UNIFY_ALLOW_OUTER_MORE_CV_QUAL
;
19485 strict
&= ~UNIFY_ALLOW_OUTER_LESS_CV_QUAL
;
19487 switch (TREE_CODE (parm
))
19489 case TYPENAME_TYPE
:
19491 case UNBOUND_CLASS_TEMPLATE
:
19492 /* In a type which contains a nested-name-specifier, template
19493 argument values cannot be deduced for template parameters used
19494 within the nested-name-specifier. */
19495 return unify_success (explain_p
);
19497 case TEMPLATE_TYPE_PARM
:
19498 case TEMPLATE_TEMPLATE_PARM
:
19499 case BOUND_TEMPLATE_TEMPLATE_PARM
:
19500 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, 0));
19501 if (error_operand_p (tparm
))
19502 return unify_invalid (explain_p
);
19504 if (TEMPLATE_TYPE_LEVEL (parm
)
19505 != template_decl_level (tparm
))
19506 /* The PARM is not one we're trying to unify. Just check
19507 to see if it matches ARG. */
19509 if (TREE_CODE (arg
) == TREE_CODE (parm
)
19510 && (is_auto (parm
) ? is_auto (arg
)
19511 : same_type_p (parm
, arg
)))
19512 return unify_success (explain_p
);
19514 return unify_type_mismatch (explain_p
, parm
, arg
);
19516 idx
= TEMPLATE_TYPE_IDX (parm
);
19517 targ
= TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
);
19518 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, idx
));
19519 if (error_operand_p (tparm
))
19520 return unify_invalid (explain_p
);
19522 /* Check for mixed types and values. */
19523 if ((TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
19524 && TREE_CODE (tparm
) != TYPE_DECL
)
19525 || (TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
19526 && TREE_CODE (tparm
) != TEMPLATE_DECL
))
19527 gcc_unreachable ();
19529 if (TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
19531 /* ARG must be constructed from a template class or a template
19532 template parameter. */
19533 if (TREE_CODE (arg
) != BOUND_TEMPLATE_TEMPLATE_PARM
19534 && !CLASSTYPE_SPECIALIZATION_OF_PRIMARY_TEMPLATE_P (arg
))
19535 return unify_template_deduction_failure (explain_p
, parm
, arg
);
19537 tree parmvec
= TYPE_TI_ARGS (parm
);
19538 /* An alias template name is never deduced. */
19539 if (TYPE_ALIAS_P (arg
))
19540 arg
= strip_typedefs (arg
);
19541 tree argvec
= INNERMOST_TEMPLATE_ARGS (TYPE_TI_ARGS (arg
));
19542 tree full_argvec
= add_to_template_args (targs
, argvec
);
19544 = DECL_INNERMOST_TEMPLATE_PARMS
19545 (TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL (parm
));
19547 int parm_variadic_p
= 0;
19549 /* The resolution to DR150 makes clear that default
19550 arguments for an N-argument may not be used to bind T
19551 to a template template parameter with fewer than N
19552 parameters. It is not safe to permit the binding of
19553 default arguments as an extension, as that may change
19554 the meaning of a conforming program. Consider:
19556 struct Dense { static const unsigned int dim = 1; };
19558 template <template <typename> class View,
19560 void operator+(float, View<Block> const&);
19562 template <typename Block,
19563 unsigned int Dim = Block::dim>
19564 struct Lvalue_proxy { operator float() const; };
19568 Lvalue_proxy<Dense> p;
19573 Here, if Lvalue_proxy is permitted to bind to View, then
19574 the global operator+ will be used; if they are not, the
19575 Lvalue_proxy will be converted to float. */
19576 if (coerce_template_parms (parm_parms
,
19578 TYPE_TI_TEMPLATE (parm
),
19580 ? tf_warning_or_error
19582 /*require_all_args=*/true,
19583 /*use_default_args=*/false)
19584 == error_mark_node
)
19587 /* Deduce arguments T, i from TT<T> or TT<i>.
19588 We check each element of PARMVEC and ARGVEC individually
19589 rather than the whole TREE_VEC since they can have
19590 different number of elements. */
19592 parmvec
= expand_template_argument_pack (parmvec
);
19593 argvec
= expand_template_argument_pack (argvec
);
19595 len
= TREE_VEC_LENGTH (parmvec
);
19597 /* Check if the parameters end in a pack, making them
19600 && PACK_EXPANSION_P (TREE_VEC_ELT (parmvec
, len
- 1)))
19601 parm_variadic_p
= 1;
19603 for (i
= 0; i
< len
- parm_variadic_p
; ++i
)
19604 /* If the template argument list of P contains a pack
19605 expansion that is not the last template argument, the
19606 entire template argument list is a non-deduced
19608 if (PACK_EXPANSION_P (TREE_VEC_ELT (parmvec
, i
)))
19609 return unify_success (explain_p
);
19611 if (TREE_VEC_LENGTH (argvec
) < len
- parm_variadic_p
)
19612 return unify_too_few_arguments (explain_p
,
19613 TREE_VEC_LENGTH (argvec
), len
);
19615 for (i
= 0; i
< len
- parm_variadic_p
; ++i
)
19617 RECUR_AND_CHECK_FAILURE (tparms
, targs
,
19618 TREE_VEC_ELT (parmvec
, i
),
19619 TREE_VEC_ELT (argvec
, i
),
19620 UNIFY_ALLOW_NONE
, explain_p
);
19623 if (parm_variadic_p
19624 && unify_pack_expansion (tparms
, targs
,
19627 /*subr=*/true, explain_p
))
19630 arg
= TYPE_TI_TEMPLATE (arg
);
19632 /* Fall through to deduce template name. */
19635 if (TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
19636 || TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
19638 /* Deduce template name TT from TT, TT<>, TT<T> and TT<i>. */
19640 /* Simple cases: Value already set, does match or doesn't. */
19641 if (targ
!= NULL_TREE
&& template_args_equal (targ
, arg
))
19642 return unify_success (explain_p
);
19644 return unify_inconsistency (explain_p
, parm
, targ
, arg
);
19648 /* If PARM is `const T' and ARG is only `int', we don't have
19649 a match unless we are allowing additional qualification.
19650 If ARG is `const int' and PARM is just `T' that's OK;
19651 that binds `const int' to `T'. */
19652 if (!check_cv_quals_for_unify (strict_in
| UNIFY_ALLOW_LESS_CV_QUAL
,
19654 return unify_cv_qual_mismatch (explain_p
, parm
, arg
);
19656 /* Consider the case where ARG is `const volatile int' and
19657 PARM is `const T'. Then, T should be `volatile int'. */
19658 arg
= cp_build_qualified_type_real
19659 (arg
, cp_type_quals (arg
) & ~cp_type_quals (parm
), tf_none
);
19660 if (arg
== error_mark_node
)
19661 return unify_invalid (explain_p
);
19663 /* Simple cases: Value already set, does match or doesn't. */
19664 if (targ
!= NULL_TREE
&& same_type_p (targ
, arg
))
19665 return unify_success (explain_p
);
19667 return unify_inconsistency (explain_p
, parm
, targ
, arg
);
19669 /* Make sure that ARG is not a variable-sized array. (Note
19670 that were talking about variable-sized arrays (like
19671 `int[n]'), rather than arrays of unknown size (like
19672 `int[]').) We'll get very confused by such a type since
19673 the bound of the array is not constant, and therefore
19674 not mangleable. Besides, such types are not allowed in
19675 ISO C++, so we can do as we please here. We do allow
19676 them for 'auto' deduction, since that isn't ABI-exposed. */
19677 if (!is_auto (parm
) && variably_modified_type_p (arg
, NULL_TREE
))
19678 return unify_vla_arg (explain_p
, arg
);
19680 /* Strip typedefs as in convert_template_argument. */
19681 arg
= canonicalize_type_argument (arg
, tf_none
);
19684 /* If ARG is a parameter pack or an expansion, we cannot unify
19685 against it unless PARM is also a parameter pack. */
19686 if ((template_parameter_pack_p (arg
) || PACK_EXPANSION_P (arg
))
19687 && !template_parameter_pack_p (parm
))
19688 return unify_parameter_pack_mismatch (explain_p
, parm
, arg
);
19690 /* If the argument deduction results is a METHOD_TYPE,
19691 then there is a problem.
19692 METHOD_TYPE doesn't map to any real C++ type the result of
19693 the deduction can not be of that type. */
19694 if (TREE_CODE (arg
) == METHOD_TYPE
)
19695 return unify_method_type_error (explain_p
, arg
);
19697 TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
) = arg
;
19698 return unify_success (explain_p
);
19700 case TEMPLATE_PARM_INDEX
:
19701 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, 0));
19702 if (error_operand_p (tparm
))
19703 return unify_invalid (explain_p
);
19705 if (TEMPLATE_PARM_LEVEL (parm
)
19706 != template_decl_level (tparm
))
19708 /* The PARM is not one we're trying to unify. Just check
19709 to see if it matches ARG. */
19710 int result
= !(TREE_CODE (arg
) == TREE_CODE (parm
)
19711 && cp_tree_equal (parm
, arg
));
19713 unify_expression_unequal (explain_p
, parm
, arg
);
19717 idx
= TEMPLATE_PARM_IDX (parm
);
19718 targ
= TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
);
19722 int x
= !cp_tree_equal (targ
, arg
);
19724 unify_inconsistency (explain_p
, parm
, targ
, arg
);
19728 /* [temp.deduct.type] If, in the declaration of a function template
19729 with a non-type template-parameter, the non-type
19730 template-parameter is used in an expression in the function
19731 parameter-list and, if the corresponding template-argument is
19732 deduced, the template-argument type shall match the type of the
19733 template-parameter exactly, except that a template-argument
19734 deduced from an array bound may be of any integral type.
19735 The non-type parameter might use already deduced type parameters. */
19736 tparm
= tsubst (TREE_TYPE (parm
), targs
, 0, NULL_TREE
);
19737 if (!TREE_TYPE (arg
))
19738 /* Template-parameter dependent expression. Just accept it for now.
19739 It will later be processed in convert_template_argument. */
19741 else if (same_type_p (TREE_TYPE (arg
), tparm
))
19743 else if ((strict
& UNIFY_ALLOW_INTEGER
)
19744 && CP_INTEGRAL_TYPE_P (tparm
))
19745 /* Convert the ARG to the type of PARM; the deduced non-type
19746 template argument must exactly match the types of the
19747 corresponding parameter. */
19748 arg
= fold (build_nop (tparm
, arg
));
19749 else if (uses_template_parms (tparm
))
19750 /* We haven't deduced the type of this parameter yet. Try again
19752 return unify_success (explain_p
);
19754 return unify_type_mismatch (explain_p
, tparm
, TREE_TYPE (arg
));
19756 /* If ARG is a parameter pack or an expansion, we cannot unify
19757 against it unless PARM is also a parameter pack. */
19758 if ((template_parameter_pack_p (arg
) || PACK_EXPANSION_P (arg
))
19759 && !TEMPLATE_PARM_PARAMETER_PACK (parm
))
19760 return unify_parameter_pack_mismatch (explain_p
, parm
, arg
);
19763 bool removed_attr
= false;
19764 arg
= strip_typedefs_expr (arg
, &removed_attr
);
19766 TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
) = arg
;
19767 return unify_success (explain_p
);
19771 /* A pointer-to-member constant can be unified only with
19772 another constant. */
19773 if (TREE_CODE (arg
) != PTRMEM_CST
)
19774 return unify_ptrmem_cst_mismatch (explain_p
, parm
, arg
);
19776 /* Just unify the class member. It would be useless (and possibly
19777 wrong, depending on the strict flags) to unify also
19778 PTRMEM_CST_CLASS, because we want to be sure that both parm and
19779 arg refer to the same variable, even if through different
19780 classes. For instance:
19782 struct A { int x; };
19785 Unification of &A::x and &B::x must succeed. */
19786 return unify (tparms
, targs
, PTRMEM_CST_MEMBER (parm
),
19787 PTRMEM_CST_MEMBER (arg
), strict
, explain_p
);
19792 if (!TYPE_PTR_P (arg
))
19793 return unify_type_mismatch (explain_p
, parm
, arg
);
19795 /* [temp.deduct.call]
19797 A can be another pointer or pointer to member type that can
19798 be converted to the deduced A via a qualification
19799 conversion (_conv.qual_).
19801 We pass down STRICT here rather than UNIFY_ALLOW_NONE.
19802 This will allow for additional cv-qualification of the
19803 pointed-to types if appropriate. */
19805 if (TREE_CODE (TREE_TYPE (arg
)) == RECORD_TYPE
)
19806 /* The derived-to-base conversion only persists through one
19807 level of pointers. */
19808 strict
|= (strict_in
& UNIFY_ALLOW_DERIVED
);
19810 return unify (tparms
, targs
, TREE_TYPE (parm
),
19811 TREE_TYPE (arg
), strict
, explain_p
);
19814 case REFERENCE_TYPE
:
19815 if (TREE_CODE (arg
) != REFERENCE_TYPE
)
19816 return unify_type_mismatch (explain_p
, parm
, arg
);
19817 return unify (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
19818 strict
& UNIFY_ALLOW_MORE_CV_QUAL
, explain_p
);
19821 if (TREE_CODE (arg
) != ARRAY_TYPE
)
19822 return unify_type_mismatch (explain_p
, parm
, arg
);
19823 if ((TYPE_DOMAIN (parm
) == NULL_TREE
)
19824 != (TYPE_DOMAIN (arg
) == NULL_TREE
))
19825 return unify_type_mismatch (explain_p
, parm
, arg
);
19826 RECUR_AND_CHECK_FAILURE (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
19827 strict
& UNIFY_ALLOW_MORE_CV_QUAL
, explain_p
);
19828 if (TYPE_DOMAIN (parm
) != NULL_TREE
)
19829 return unify_array_domain (tparms
, targs
, TYPE_DOMAIN (parm
),
19830 TYPE_DOMAIN (arg
), explain_p
);
19831 return unify_success (explain_p
);
19838 case ENUMERAL_TYPE
:
19841 if (TREE_CODE (arg
) != TREE_CODE (parm
))
19842 return unify_type_mismatch (explain_p
, parm
, arg
);
19844 /* We have already checked cv-qualification at the top of the
19846 if (!same_type_ignoring_top_level_qualifiers_p (arg
, parm
))
19847 return unify_type_mismatch (explain_p
, parm
, arg
);
19849 /* As far as unification is concerned, this wins. Later checks
19850 will invalidate it if necessary. */
19851 return unify_success (explain_p
);
19853 /* Types INTEGER_CST and MINUS_EXPR can come from array bounds. */
19854 /* Type INTEGER_CST can come from ordinary constant template args. */
19856 while (TREE_CODE (arg
) == NOP_EXPR
)
19857 arg
= TREE_OPERAND (arg
, 0);
19859 if (TREE_CODE (arg
) != INTEGER_CST
)
19860 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
19861 return (tree_int_cst_equal (parm
, arg
)
19862 ? unify_success (explain_p
)
19863 : unify_template_argument_mismatch (explain_p
, parm
, arg
));
19867 int i
, len
, argslen
;
19868 int parm_variadic_p
= 0;
19870 if (TREE_CODE (arg
) != TREE_VEC
)
19871 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
19873 len
= TREE_VEC_LENGTH (parm
);
19874 argslen
= TREE_VEC_LENGTH (arg
);
19876 /* Check for pack expansions in the parameters. */
19877 for (i
= 0; i
< len
; ++i
)
19879 if (PACK_EXPANSION_P (TREE_VEC_ELT (parm
, i
)))
19882 /* We can unify against something with a trailing
19884 parm_variadic_p
= 1;
19886 /* [temp.deduct.type]/9: If the template argument list of
19887 P contains a pack expansion that is not the last
19888 template argument, the entire template argument list
19889 is a non-deduced context. */
19890 return unify_success (explain_p
);
19894 /* If we don't have enough arguments to satisfy the parameters
19895 (not counting the pack expression at the end), or we have
19896 too many arguments for a parameter list that doesn't end in
19897 a pack expression, we can't unify. */
19898 if (parm_variadic_p
19899 ? argslen
< len
- parm_variadic_p
19901 return unify_arity (explain_p
, TREE_VEC_LENGTH (arg
), len
);
19903 /* Unify all of the parameters that precede the (optional)
19904 pack expression. */
19905 for (i
= 0; i
< len
- parm_variadic_p
; ++i
)
19907 RECUR_AND_CHECK_FAILURE (tparms
, targs
,
19908 TREE_VEC_ELT (parm
, i
),
19909 TREE_VEC_ELT (arg
, i
),
19910 UNIFY_ALLOW_NONE
, explain_p
);
19912 if (parm_variadic_p
)
19913 return unify_pack_expansion (tparms
, targs
, parm
, arg
,
19915 /*subr=*/true, explain_p
);
19916 return unify_success (explain_p
);
19921 if (TREE_CODE (arg
) != TREE_CODE (parm
))
19922 return unify_type_mismatch (explain_p
, parm
, arg
);
19924 if (TYPE_PTRMEMFUNC_P (parm
))
19926 if (!TYPE_PTRMEMFUNC_P (arg
))
19927 return unify_type_mismatch (explain_p
, parm
, arg
);
19929 return unify (tparms
, targs
,
19930 TYPE_PTRMEMFUNC_FN_TYPE (parm
),
19931 TYPE_PTRMEMFUNC_FN_TYPE (arg
),
19932 strict
, explain_p
);
19934 else if (TYPE_PTRMEMFUNC_P (arg
))
19935 return unify_type_mismatch (explain_p
, parm
, arg
);
19937 if (CLASSTYPE_TEMPLATE_INFO (parm
))
19939 tree t
= NULL_TREE
;
19941 if (strict_in
& UNIFY_ALLOW_DERIVED
)
19943 /* First, we try to unify the PARM and ARG directly. */
19944 t
= try_class_unification (tparms
, targs
,
19945 parm
, arg
, explain_p
);
19949 /* Fallback to the special case allowed in
19950 [temp.deduct.call]:
19952 If P is a class, and P has the form
19953 template-id, then A can be a derived class of
19954 the deduced A. Likewise, if P is a pointer to
19955 a class of the form template-id, A can be a
19956 pointer to a derived class pointed to by the
19958 enum template_base_result r
;
19959 r
= get_template_base (tparms
, targs
, parm
, arg
,
19964 /* Don't give the derived diagnostic if we're
19965 already dealing with the same template. */
19967 = (CLASSTYPE_TEMPLATE_INFO (arg
)
19968 && (CLASSTYPE_TI_TEMPLATE (parm
)
19969 == CLASSTYPE_TI_TEMPLATE (arg
)));
19970 return unify_no_common_base (explain_p
&& !same_template
,
19975 else if (CLASSTYPE_TEMPLATE_INFO (arg
)
19976 && (CLASSTYPE_TI_TEMPLATE (parm
)
19977 == CLASSTYPE_TI_TEMPLATE (arg
)))
19978 /* Perhaps PARM is something like S<U> and ARG is S<int>.
19979 Then, we should unify `int' and `U'. */
19982 /* There's no chance of unification succeeding. */
19983 return unify_type_mismatch (explain_p
, parm
, arg
);
19985 return unify (tparms
, targs
, CLASSTYPE_TI_ARGS (parm
),
19986 CLASSTYPE_TI_ARGS (t
), UNIFY_ALLOW_NONE
, explain_p
);
19988 else if (!same_type_ignoring_top_level_qualifiers_p (parm
, arg
))
19989 return unify_type_mismatch (explain_p
, parm
, arg
);
19990 return unify_success (explain_p
);
19993 case FUNCTION_TYPE
:
19995 unsigned int nargs
;
20000 if (TREE_CODE (arg
) != TREE_CODE (parm
))
20001 return unify_type_mismatch (explain_p
, parm
, arg
);
20003 /* CV qualifications for methods can never be deduced, they must
20004 match exactly. We need to check them explicitly here,
20005 because type_unification_real treats them as any other
20006 cv-qualified parameter. */
20007 if (TREE_CODE (parm
) == METHOD_TYPE
20008 && (!check_cv_quals_for_unify
20010 class_of_this_parm (arg
),
20011 class_of_this_parm (parm
))))
20012 return unify_cv_qual_mismatch (explain_p
, parm
, arg
);
20014 RECUR_AND_CHECK_FAILURE (tparms
, targs
, TREE_TYPE (parm
),
20015 TREE_TYPE (arg
), UNIFY_ALLOW_NONE
, explain_p
);
20017 nargs
= list_length (TYPE_ARG_TYPES (arg
));
20018 args
= XALLOCAVEC (tree
, nargs
);
20019 for (a
= TYPE_ARG_TYPES (arg
), i
= 0;
20020 a
!= NULL_TREE
&& a
!= void_list_node
;
20021 a
= TREE_CHAIN (a
), ++i
)
20022 args
[i
] = TREE_VALUE (a
);
20025 return type_unification_real (tparms
, targs
, TYPE_ARG_TYPES (parm
),
20026 args
, nargs
, 1, DEDUCE_EXACT
,
20027 LOOKUP_NORMAL
, NULL
, explain_p
);
20031 /* Unify a pointer to member with a pointer to member function, which
20032 deduces the type of the member as a function type. */
20033 if (TYPE_PTRMEMFUNC_P (arg
))
20035 /* Check top-level cv qualifiers */
20036 if (!check_cv_quals_for_unify (UNIFY_ALLOW_NONE
, arg
, parm
))
20037 return unify_cv_qual_mismatch (explain_p
, parm
, arg
);
20039 RECUR_AND_CHECK_FAILURE (tparms
, targs
, TYPE_OFFSET_BASETYPE (parm
),
20040 TYPE_PTRMEMFUNC_OBJECT_TYPE (arg
),
20041 UNIFY_ALLOW_NONE
, explain_p
);
20043 /* Determine the type of the function we are unifying against. */
20044 tree fntype
= static_fn_type (arg
);
20046 return unify (tparms
, targs
, TREE_TYPE (parm
), fntype
, strict
, explain_p
);
20049 if (TREE_CODE (arg
) != OFFSET_TYPE
)
20050 return unify_type_mismatch (explain_p
, parm
, arg
);
20051 RECUR_AND_CHECK_FAILURE (tparms
, targs
, TYPE_OFFSET_BASETYPE (parm
),
20052 TYPE_OFFSET_BASETYPE (arg
),
20053 UNIFY_ALLOW_NONE
, explain_p
);
20054 return unify (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
20055 strict
, explain_p
);
20058 if (DECL_TEMPLATE_PARM_P (parm
))
20059 return unify (tparms
, targs
, DECL_INITIAL (parm
), arg
, strict
, explain_p
);
20060 if (arg
!= scalar_constant_value (parm
))
20061 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
20062 return unify_success (explain_p
);
20065 case TEMPLATE_DECL
:
20066 /* Matched cases are handled by the ARG == PARM test above. */
20067 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
20070 /* We might get a variable as a non-type template argument in parm if the
20071 corresponding parameter is type-dependent. Make any necessary
20072 adjustments based on whether arg is a reference. */
20073 if (CONSTANT_CLASS_P (arg
))
20074 parm
= fold_non_dependent_expr (parm
);
20075 else if (REFERENCE_REF_P (arg
))
20077 tree sub
= TREE_OPERAND (arg
, 0);
20079 if (TREE_CODE (sub
) == ADDR_EXPR
)
20080 arg
= TREE_OPERAND (sub
, 0);
20082 /* Now use the normal expression code to check whether they match. */
20085 case TYPE_ARGUMENT_PACK
:
20086 case NONTYPE_ARGUMENT_PACK
:
20087 return unify (tparms
, targs
, ARGUMENT_PACK_ARGS (parm
),
20088 ARGUMENT_PACK_ARGS (arg
), strict
, explain_p
);
20091 case DECLTYPE_TYPE
:
20092 case UNDERLYING_TYPE
:
20093 /* Cannot deduce anything from TYPEOF_TYPE, DECLTYPE_TYPE,
20094 or UNDERLYING_TYPE nodes. */
20095 return unify_success (explain_p
);
20098 /* Unification fails if we hit an error node. */
20099 return unify_invalid (explain_p
);
20102 if (REFERENCE_REF_P (parm
))
20104 if (REFERENCE_REF_P (arg
))
20105 arg
= TREE_OPERAND (arg
, 0);
20106 return unify (tparms
, targs
, TREE_OPERAND (parm
, 0), arg
,
20107 strict
, explain_p
);
20112 /* An unresolved overload is a nondeduced context. */
20113 if (is_overloaded_fn (parm
) || type_unknown_p (parm
))
20114 return unify_success (explain_p
);
20115 gcc_assert (EXPR_P (parm
));
20117 /* We must be looking at an expression. This can happen with
20121 void foo(S<I>, S<I + 2>);
20123 This is a "nondeduced context":
20127 The nondeduced contexts are:
20129 --A type that is a template-id in which one or more of
20130 the template-arguments is an expression that references
20131 a template-parameter.
20133 In these cases, we assume deduction succeeded, but don't
20134 actually infer any unifications. */
20136 if (!uses_template_parms (parm
)
20137 && !template_args_equal (parm
, arg
))
20138 return unify_expression_unequal (explain_p
, parm
, arg
);
20140 return unify_success (explain_p
);
20143 #undef RECUR_AND_CHECK_FAILURE
20145 /* Note that DECL can be defined in this translation unit, if
20149 mark_definable (tree decl
)
20152 DECL_NOT_REALLY_EXTERN (decl
) = 1;
20153 FOR_EACH_CLONE (clone
, decl
)
20154 DECL_NOT_REALLY_EXTERN (clone
) = 1;
20157 /* Called if RESULT is explicitly instantiated, or is a member of an
20158 explicitly instantiated class. */
20161 mark_decl_instantiated (tree result
, int extern_p
)
20163 SET_DECL_EXPLICIT_INSTANTIATION (result
);
20165 /* If this entity has already been written out, it's too late to
20166 make any modifications. */
20167 if (TREE_ASM_WRITTEN (result
))
20170 /* For anonymous namespace we don't need to do anything. */
20171 if (decl_anon_ns_mem_p (result
))
20173 gcc_assert (!TREE_PUBLIC (result
));
20177 if (TREE_CODE (result
) != FUNCTION_DECL
)
20178 /* The TREE_PUBLIC flag for function declarations will have been
20179 set correctly by tsubst. */
20180 TREE_PUBLIC (result
) = 1;
20182 /* This might have been set by an earlier implicit instantiation. */
20183 DECL_COMDAT (result
) = 0;
20186 DECL_NOT_REALLY_EXTERN (result
) = 0;
20189 mark_definable (result
);
20190 mark_needed (result
);
20191 /* Always make artificials weak. */
20192 if (DECL_ARTIFICIAL (result
) && flag_weak
)
20193 comdat_linkage (result
);
20194 /* For WIN32 we also want to put explicit instantiations in
20195 linkonce sections. */
20196 else if (TREE_PUBLIC (result
))
20197 maybe_make_one_only (result
);
20200 /* If EXTERN_P, then this function will not be emitted -- unless
20201 followed by an explicit instantiation, at which point its linkage
20202 will be adjusted. If !EXTERN_P, then this function will be
20203 emitted here. In neither circumstance do we want
20204 import_export_decl to adjust the linkage. */
20205 DECL_INTERFACE_KNOWN (result
) = 1;
20208 /* Subroutine of more_specialized_fn: check whether TARGS is missing any
20209 important template arguments. If any are missing, we check whether
20210 they're important by using error_mark_node for substituting into any
20211 args that were used for partial ordering (the ones between ARGS and END)
20212 and seeing if it bubbles up. */
20215 check_undeduced_parms (tree targs
, tree args
, tree end
)
20217 bool found
= false;
20219 for (i
= TREE_VEC_LENGTH (targs
) - 1; i
>= 0; --i
)
20220 if (TREE_VEC_ELT (targs
, i
) == NULL_TREE
)
20223 TREE_VEC_ELT (targs
, i
) = error_mark_node
;
20227 tree substed
= tsubst_arg_types (args
, targs
, end
, tf_none
, NULL_TREE
);
20228 if (substed
== error_mark_node
)
20234 /* Given two function templates PAT1 and PAT2, return:
20236 1 if PAT1 is more specialized than PAT2 as described in [temp.func.order].
20237 -1 if PAT2 is more specialized than PAT1.
20238 0 if neither is more specialized.
20240 LEN indicates the number of parameters we should consider
20241 (defaulted parameters should not be considered).
20243 The 1998 std underspecified function template partial ordering, and
20244 DR214 addresses the issue. We take pairs of arguments, one from
20245 each of the templates, and deduce them against each other. One of
20246 the templates will be more specialized if all the *other*
20247 template's arguments deduce against its arguments and at least one
20248 of its arguments *does* *not* deduce against the other template's
20249 corresponding argument. Deduction is done as for class templates.
20250 The arguments used in deduction have reference and top level cv
20251 qualifiers removed. Iff both arguments were originally reference
20252 types *and* deduction succeeds in both directions, an lvalue reference
20253 wins against an rvalue reference and otherwise the template
20254 with the more cv-qualified argument wins for that pairing (if
20255 neither is more cv-qualified, they both are equal). Unlike regular
20256 deduction, after all the arguments have been deduced in this way,
20257 we do *not* verify the deduced template argument values can be
20258 substituted into non-deduced contexts.
20260 The logic can be a bit confusing here, because we look at deduce1 and
20261 targs1 to see if pat2 is at least as specialized, and vice versa; if we
20262 can find template arguments for pat1 to make arg1 look like arg2, that
20263 means that arg2 is at least as specialized as arg1. */
20266 more_specialized_fn (tree pat1
, tree pat2
, int len
)
20268 tree decl1
= DECL_TEMPLATE_RESULT (pat1
);
20269 tree decl2
= DECL_TEMPLATE_RESULT (pat2
);
20270 tree targs1
= make_tree_vec (DECL_NTPARMS (pat1
));
20271 tree targs2
= make_tree_vec (DECL_NTPARMS (pat2
));
20272 tree tparms1
= DECL_INNERMOST_TEMPLATE_PARMS (pat1
);
20273 tree tparms2
= DECL_INNERMOST_TEMPLATE_PARMS (pat2
);
20274 tree args1
= TYPE_ARG_TYPES (TREE_TYPE (decl1
));
20275 tree args2
= TYPE_ARG_TYPES (TREE_TYPE (decl2
));
20276 tree origs1
, origs2
;
20277 bool lose1
= false;
20278 bool lose2
= false;
20280 /* Remove the this parameter from non-static member functions. If
20281 one is a non-static member function and the other is not a static
20282 member function, remove the first parameter from that function
20283 also. This situation occurs for operator functions where we
20284 locate both a member function (with this pointer) and non-member
20285 operator (with explicit first operand). */
20286 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl1
))
20288 len
--; /* LEN is the number of significant arguments for DECL1 */
20289 args1
= TREE_CHAIN (args1
);
20290 if (!DECL_STATIC_FUNCTION_P (decl2
))
20291 args2
= TREE_CHAIN (args2
);
20293 else if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl2
))
20295 args2
= TREE_CHAIN (args2
);
20296 if (!DECL_STATIC_FUNCTION_P (decl1
))
20299 args1
= TREE_CHAIN (args1
);
20303 /* If only one is a conversion operator, they are unordered. */
20304 if (DECL_CONV_FN_P (decl1
) != DECL_CONV_FN_P (decl2
))
20307 /* Consider the return type for a conversion function */
20308 if (DECL_CONV_FN_P (decl1
))
20310 args1
= tree_cons (NULL_TREE
, TREE_TYPE (TREE_TYPE (decl1
)), args1
);
20311 args2
= tree_cons (NULL_TREE
, TREE_TYPE (TREE_TYPE (decl2
)), args2
);
20315 processing_template_decl
++;
20321 /* Stop when an ellipsis is seen. */
20322 && args1
!= NULL_TREE
&& args2
!= NULL_TREE
)
20324 tree arg1
= TREE_VALUE (args1
);
20325 tree arg2
= TREE_VALUE (args2
);
20326 int deduce1
, deduce2
;
20332 if (TREE_CODE (arg1
) == TYPE_PACK_EXPANSION
20333 && TREE_CODE (arg2
) == TYPE_PACK_EXPANSION
)
20335 /* When both arguments are pack expansions, we need only
20336 unify the patterns themselves. */
20337 arg1
= PACK_EXPANSION_PATTERN (arg1
);
20338 arg2
= PACK_EXPANSION_PATTERN (arg2
);
20340 /* This is the last comparison we need to do. */
20344 if (TREE_CODE (arg1
) == REFERENCE_TYPE
)
20346 ref1
= TYPE_REF_IS_RVALUE (arg1
) + 1;
20347 arg1
= TREE_TYPE (arg1
);
20348 quals1
= cp_type_quals (arg1
);
20351 if (TREE_CODE (arg2
) == REFERENCE_TYPE
)
20353 ref2
= TYPE_REF_IS_RVALUE (arg2
) + 1;
20354 arg2
= TREE_TYPE (arg2
);
20355 quals2
= cp_type_quals (arg2
);
20358 arg1
= TYPE_MAIN_VARIANT (arg1
);
20359 arg2
= TYPE_MAIN_VARIANT (arg2
);
20361 if (TREE_CODE (arg1
) == TYPE_PACK_EXPANSION
)
20363 int i
, len2
= remaining_arguments (args2
);
20364 tree parmvec
= make_tree_vec (1);
20365 tree argvec
= make_tree_vec (len2
);
20368 /* Setup the parameter vector, which contains only ARG1. */
20369 TREE_VEC_ELT (parmvec
, 0) = arg1
;
20371 /* Setup the argument vector, which contains the remaining
20373 for (i
= 0; i
< len2
; i
++, ta
= TREE_CHAIN (ta
))
20374 TREE_VEC_ELT (argvec
, i
) = TREE_VALUE (ta
);
20376 deduce1
= (unify_pack_expansion (tparms1
, targs1
, parmvec
,
20377 argvec
, DEDUCE_EXACT
,
20378 /*subr=*/true, /*explain_p=*/false)
20381 /* We cannot deduce in the other direction, because ARG1 is
20382 a pack expansion but ARG2 is not. */
20385 else if (TREE_CODE (arg2
) == TYPE_PACK_EXPANSION
)
20387 int i
, len1
= remaining_arguments (args1
);
20388 tree parmvec
= make_tree_vec (1);
20389 tree argvec
= make_tree_vec (len1
);
20392 /* Setup the parameter vector, which contains only ARG1. */
20393 TREE_VEC_ELT (parmvec
, 0) = arg2
;
20395 /* Setup the argument vector, which contains the remaining
20397 for (i
= 0; i
< len1
; i
++, ta
= TREE_CHAIN (ta
))
20398 TREE_VEC_ELT (argvec
, i
) = TREE_VALUE (ta
);
20400 deduce2
= (unify_pack_expansion (tparms2
, targs2
, parmvec
,
20401 argvec
, DEDUCE_EXACT
,
20402 /*subr=*/true, /*explain_p=*/false)
20405 /* We cannot deduce in the other direction, because ARG2 is
20406 a pack expansion but ARG1 is not.*/
20412 /* The normal case, where neither argument is a pack
20414 deduce1
= (unify (tparms1
, targs1
, arg1
, arg2
,
20415 UNIFY_ALLOW_NONE
, /*explain_p=*/false)
20417 deduce2
= (unify (tparms2
, targs2
, arg2
, arg1
,
20418 UNIFY_ALLOW_NONE
, /*explain_p=*/false)
20422 /* If we couldn't deduce arguments for tparms1 to make arg1 match
20423 arg2, then arg2 is not as specialized as arg1. */
20429 /* "If, for a given type, deduction succeeds in both directions
20430 (i.e., the types are identical after the transformations above)
20431 and both P and A were reference types (before being replaced with
20432 the type referred to above):
20433 - if the type from the argument template was an lvalue reference and
20434 the type from the parameter template was not, the argument type is
20435 considered to be more specialized than the other; otherwise,
20436 - if the type from the argument template is more cv-qualified
20437 than the type from the parameter template (as described above),
20438 the argument type is considered to be more specialized than the other;
20440 - neither type is more specialized than the other." */
20442 if (deduce1
&& deduce2
)
20444 if (ref1
&& ref2
&& ref1
!= ref2
)
20451 else if (quals1
!= quals2
&& quals1
>= 0 && quals2
>= 0)
20453 if ((quals1
& quals2
) == quals2
)
20455 if ((quals1
& quals2
) == quals1
)
20460 if (lose1
&& lose2
)
20461 /* We've failed to deduce something in either direction.
20462 These must be unordered. */
20465 if (TREE_CODE (arg1
) == TYPE_PACK_EXPANSION
20466 || TREE_CODE (arg2
) == TYPE_PACK_EXPANSION
)
20467 /* We have already processed all of the arguments in our
20468 handing of the pack expansion type. */
20471 args1
= TREE_CHAIN (args1
);
20472 args2
= TREE_CHAIN (args2
);
20475 /* "In most cases, all template parameters must have values in order for
20476 deduction to succeed, but for partial ordering purposes a template
20477 parameter may remain without a value provided it is not used in the
20478 types being used for partial ordering."
20480 Thus, if we are missing any of the targs1 we need to substitute into
20481 origs1, then pat2 is not as specialized as pat1. This can happen when
20482 there is a nondeduced context. */
20483 if (!lose2
&& check_undeduced_parms (targs1
, origs1
, args1
))
20485 if (!lose1
&& check_undeduced_parms (targs2
, origs2
, args2
))
20488 processing_template_decl
--;
20490 /* If both deductions succeed, the partial ordering selects the more
20491 constrained template. */
20492 if (!lose1
&& !lose2
)
20494 tree c1
= get_constraints (DECL_TEMPLATE_RESULT (pat1
));
20495 tree c2
= get_constraints (DECL_TEMPLATE_RESULT (pat2
));
20496 lose1
= !subsumes_constraints (c1
, c2
);
20497 lose2
= !subsumes_constraints (c2
, c1
);
20500 /* All things being equal, if the next argument is a pack expansion
20501 for one function but not for the other, prefer the
20502 non-variadic function. FIXME this is bogus; see c++/41958. */
20504 && args1
&& TREE_VALUE (args1
)
20505 && args2
&& TREE_VALUE (args2
))
20507 lose1
= TREE_CODE (TREE_VALUE (args1
)) == TYPE_PACK_EXPANSION
;
20508 lose2
= TREE_CODE (TREE_VALUE (args2
)) == TYPE_PACK_EXPANSION
;
20511 if (lose1
== lose2
)
20519 /* Determine which of two partial specializations of TMPL is more
20522 PAT1 is a TREE_LIST whose TREE_VALUE is the TEMPLATE_DECL corresponding
20523 to the first partial specialization. The TREE_PURPOSE is the
20524 innermost set of template parameters for the partial
20525 specialization. PAT2 is similar, but for the second template.
20527 Return 1 if the first partial specialization is more specialized;
20528 -1 if the second is more specialized; 0 if neither is more
20531 See [temp.class.order] for information about determining which of
20532 two templates is more specialized. */
20535 more_specialized_partial_spec (tree tmpl
, tree pat1
, tree pat2
)
20539 bool any_deductions
= false;
20541 tree tmpl1
= TREE_VALUE (pat1
);
20542 tree tmpl2
= TREE_VALUE (pat2
);
20543 tree parms1
= DECL_INNERMOST_TEMPLATE_PARMS (tmpl1
);
20544 tree parms2
= DECL_INNERMOST_TEMPLATE_PARMS (tmpl2
);
20545 tree specargs1
= TI_ARGS (get_template_info (DECL_TEMPLATE_RESULT (tmpl1
)));
20546 tree specargs2
= TI_ARGS (get_template_info (DECL_TEMPLATE_RESULT (tmpl2
)));
20548 /* Just like what happens for functions, if we are ordering between
20549 different template specializations, we may encounter dependent
20550 types in the arguments, and we need our dependency check functions
20551 to behave correctly. */
20552 ++processing_template_decl
;
20553 targs
= get_partial_spec_bindings (tmpl
, parms1
, specargs1
, specargs2
);
20557 any_deductions
= true;
20560 targs
= get_partial_spec_bindings (tmpl
, parms2
, specargs2
, specargs1
);
20564 any_deductions
= true;
20566 --processing_template_decl
;
20568 /* If both deductions succeed, the partial ordering selects the more
20569 constrained template. */
20570 if (!winner
&& any_deductions
)
20571 return more_constrained (tmpl1
, tmpl2
);
20573 /* In the case of a tie where at least one of the templates
20574 has a parameter pack at the end, the template with the most
20575 non-packed parameters wins. */
20578 && (template_args_variadic_p (TREE_PURPOSE (pat1
))
20579 || template_args_variadic_p (TREE_PURPOSE (pat2
))))
20581 tree args1
= INNERMOST_TEMPLATE_ARGS (TREE_PURPOSE (pat1
));
20582 tree args2
= INNERMOST_TEMPLATE_ARGS (TREE_PURPOSE (pat2
));
20583 int len1
= TREE_VEC_LENGTH (args1
);
20584 int len2
= TREE_VEC_LENGTH (args2
);
20586 /* We don't count the pack expansion at the end. */
20587 if (template_args_variadic_p (TREE_PURPOSE (pat1
)))
20589 if (template_args_variadic_p (TREE_PURPOSE (pat2
)))
20594 else if (len1
< len2
)
20601 /* Return the template arguments that will produce the function signature
20602 DECL from the function template FN, with the explicit template
20603 arguments EXPLICIT_ARGS. If CHECK_RETTYPE is true, the return type must
20604 also match. Return NULL_TREE if no satisfactory arguments could be
20608 get_bindings (tree fn
, tree decl
, tree explicit_args
, bool check_rettype
)
20610 int ntparms
= DECL_NTPARMS (fn
);
20611 tree targs
= make_tree_vec (ntparms
);
20612 tree decl_type
= TREE_TYPE (decl
);
20613 tree decl_arg_types
;
20615 unsigned int nargs
, ix
;
20618 gcc_assert (decl
!= DECL_TEMPLATE_RESULT (fn
));
20620 /* Never do unification on the 'this' parameter. */
20621 decl_arg_types
= skip_artificial_parms_for (decl
,
20622 TYPE_ARG_TYPES (decl_type
));
20624 nargs
= list_length (decl_arg_types
);
20625 args
= XALLOCAVEC (tree
, nargs
);
20626 for (arg
= decl_arg_types
, ix
= 0;
20627 arg
!= NULL_TREE
&& arg
!= void_list_node
;
20628 arg
= TREE_CHAIN (arg
), ++ix
)
20629 args
[ix
] = TREE_VALUE (arg
);
20631 if (fn_type_unification (fn
, explicit_args
, targs
,
20633 (check_rettype
|| DECL_CONV_FN_P (fn
)
20634 ? TREE_TYPE (decl_type
) : NULL_TREE
),
20635 DEDUCE_EXACT
, LOOKUP_NORMAL
, /*explain_p=*/false,
20637 == error_mark_node
)
20643 /* Return the innermost template arguments that, when applied to a partial
20644 specialization of TMPL whose innermost template parameters are
20645 TPARMS, and whose specialization arguments are SPEC_ARGS, yield the
20648 For example, suppose we have:
20650 template <class T, class U> struct S {};
20651 template <class T> struct S<T*, int> {};
20653 Then, suppose we want to get `S<double*, int>'. The TPARMS will be
20654 {T}, the SPEC_ARGS will be {T*, int} and the ARGS will be {double*,
20655 int}. The resulting vector will be {double}, indicating that `T'
20656 is bound to `double'. */
20659 get_partial_spec_bindings (tree tmpl
, tree tparms
, tree spec_args
, tree args
)
20661 int i
, ntparms
= TREE_VEC_LENGTH (tparms
);
20663 tree innermost_deduced_args
;
20665 innermost_deduced_args
= make_tree_vec (ntparms
);
20666 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (args
))
20668 deduced_args
= copy_node (args
);
20669 SET_TMPL_ARGS_LEVEL (deduced_args
,
20670 TMPL_ARGS_DEPTH (deduced_args
),
20671 innermost_deduced_args
);
20674 deduced_args
= innermost_deduced_args
;
20676 if (unify (tparms
, deduced_args
,
20677 INNERMOST_TEMPLATE_ARGS (spec_args
),
20678 INNERMOST_TEMPLATE_ARGS (args
),
20679 UNIFY_ALLOW_NONE
, /*explain_p=*/false))
20682 for (i
= 0; i
< ntparms
; ++i
)
20683 if (! TREE_VEC_ELT (innermost_deduced_args
, i
))
20686 /* Verify that nondeduced template arguments agree with the type
20687 obtained from argument deduction.
20691 struct A { typedef int X; };
20692 template <class T, class U> struct C {};
20693 template <class T> struct C<T, typename T::X> {};
20695 Then with the instantiation `C<A, int>', we can deduce that
20696 `T' is `A' but unify () does not check whether `typename T::X'
20698 spec_args
= tsubst (spec_args
, deduced_args
, tf_none
, NULL_TREE
);
20699 spec_args
= coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (tmpl
),
20701 tf_none
, false, false);
20702 if (spec_args
== error_mark_node
20703 /* We only need to check the innermost arguments; the other
20704 arguments will always agree. */
20705 || !comp_template_args (INNERMOST_TEMPLATE_ARGS (spec_args
),
20706 INNERMOST_TEMPLATE_ARGS (args
)))
20709 /* Now that we have bindings for all of the template arguments,
20710 ensure that the arguments deduced for the template template
20711 parameters have compatible template parameter lists. See the use
20712 of template_template_parm_bindings_ok_p in fn_type_unification
20713 for more information. */
20714 if (!template_template_parm_bindings_ok_p (tparms
, deduced_args
))
20717 return deduced_args
;
20720 // Compare two function templates T1 and T2 by deducing bindings
20721 // from one against the other. If both deductions succeed, compare
20722 // constraints to see which is more constrained.
20724 more_specialized_inst (tree t1
, tree t2
)
20729 if (get_bindings (t1
, DECL_TEMPLATE_RESULT (t2
), NULL_TREE
, true))
20735 if (get_bindings (t2
, DECL_TEMPLATE_RESULT (t1
), NULL_TREE
, true))
20741 // If both deductions succeed, then one may be more constrained.
20742 if (count
== 2 && fate
== 0)
20743 fate
= more_constrained (t1
, t2
);
20748 /* TEMPLATES is a TREE_LIST. Each TREE_VALUE is a TEMPLATE_DECL.
20749 Return the TREE_LIST node with the most specialized template, if
20750 any. If there is no most specialized template, the error_mark_node
20753 Note that this function does not look at, or modify, the
20754 TREE_PURPOSE or TREE_TYPE of any of the nodes. Since the node
20755 returned is one of the elements of INSTANTIATIONS, callers may
20756 store information in the TREE_PURPOSE or TREE_TYPE of the nodes,
20757 and retrieve it from the value returned. */
20760 most_specialized_instantiation (tree templates
)
20764 ++processing_template_decl
;
20767 for (fn
= TREE_CHAIN (templates
); fn
; fn
= TREE_CHAIN (fn
))
20769 int fate
= more_specialized_inst (TREE_VALUE (champ
), TREE_VALUE (fn
));
20774 /* Equally specialized, move to next function. If there
20775 is no next function, nothing's most specialized. */
20776 fn
= TREE_CHAIN (fn
);
20784 /* Now verify that champ is better than everything earlier in the
20785 instantiation list. */
20786 for (fn
= templates
; fn
!= champ
; fn
= TREE_CHAIN (fn
)) {
20787 if (more_specialized_inst (TREE_VALUE (champ
), TREE_VALUE (fn
)) != 1)
20794 processing_template_decl
--;
20797 return error_mark_node
;
20802 /* If DECL is a specialization of some template, return the most
20803 general such template. Otherwise, returns NULL_TREE.
20805 For example, given:
20807 template <class T> struct S { template <class U> void f(U); };
20809 if TMPL is `template <class U> void S<int>::f(U)' this will return
20810 the full template. This function will not trace past partial
20811 specializations, however. For example, given in addition:
20813 template <class T> struct S<T*> { template <class U> void f(U); };
20815 if TMPL is `template <class U> void S<int*>::f(U)' this will return
20816 `template <class T> template <class U> S<T*>::f(U)'. */
20819 most_general_template (tree decl
)
20821 if (TREE_CODE (decl
) != TEMPLATE_DECL
)
20823 if (tree tinfo
= get_template_info (decl
))
20824 decl
= TI_TEMPLATE (tinfo
);
20825 /* The TI_TEMPLATE can be an IDENTIFIER_NODE for a
20826 template friend, or a FIELD_DECL for a capture pack. */
20827 if (TREE_CODE (decl
) != TEMPLATE_DECL
)
20831 /* Look for more and more general templates. */
20832 while (DECL_LANG_SPECIFIC (decl
) && DECL_TEMPLATE_INFO (decl
))
20834 /* The DECL_TI_TEMPLATE can be an IDENTIFIER_NODE in some cases.
20835 (See cp-tree.h for details.) */
20836 if (TREE_CODE (DECL_TI_TEMPLATE (decl
)) != TEMPLATE_DECL
)
20839 if (CLASS_TYPE_P (TREE_TYPE (decl
))
20840 && !TYPE_DECL_ALIAS_P (TYPE_NAME (TREE_TYPE (decl
)))
20841 && CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_TYPE (decl
)))
20844 /* Stop if we run into an explicitly specialized class template. */
20845 if (!DECL_NAMESPACE_SCOPE_P (decl
)
20846 && DECL_CONTEXT (decl
)
20847 && CLASSTYPE_TEMPLATE_SPECIALIZATION (DECL_CONTEXT (decl
)))
20850 decl
= DECL_TI_TEMPLATE (decl
);
20856 /* True iff the TEMPLATE_DECL tmpl is a partial specialization. */
20859 partial_specialization_p (tree tmpl
)
20861 /* Any specialization has DECL_TEMPLATE_SPECIALIZATION. */
20862 if (!DECL_TEMPLATE_SPECIALIZATION (tmpl
))
20864 tree t
= DECL_TI_TEMPLATE (tmpl
);
20865 /* A specialization that fully specializes one of the containing classes is
20866 not a partial specialization. */
20867 return (list_length (DECL_TEMPLATE_PARMS (tmpl
))
20868 == list_length (DECL_TEMPLATE_PARMS (t
)));
20871 /* If TMPL is a partial specialization, return the arguments for its primary
20875 impartial_args (tree tmpl
, tree args
)
20877 if (!partial_specialization_p (tmpl
))
20880 /* If TMPL is a partial specialization, we need to substitute to get
20881 the args for the primary template. */
20882 return tsubst_template_args (DECL_TI_ARGS (tmpl
), args
,
20883 tf_warning_or_error
, tmpl
);
20886 /* Return the most specialized of the template partial specializations
20887 which can produce TARGET, a specialization of some class or variable
20888 template. The value returned is actually a TREE_LIST; the TREE_VALUE is
20889 a TEMPLATE_DECL node corresponding to the partial specialization, while
20890 the TREE_PURPOSE is the set of template arguments that must be
20891 substituted into the template pattern in order to generate TARGET.
20893 If the choice of partial specialization is ambiguous, a diagnostic
20894 is issued, and the error_mark_node is returned. If there are no
20895 partial specializations matching TARGET, then NULL_TREE is
20896 returned, indicating that the primary template should be used. */
20899 most_specialized_partial_spec (tree target
, tsubst_flags_t complain
)
20901 tree list
= NULL_TREE
;
20906 tree outer_args
= NULL_TREE
;
20909 if (TYPE_P (target
))
20911 tree tinfo
= CLASSTYPE_TEMPLATE_INFO (target
);
20912 tmpl
= TI_TEMPLATE (tinfo
);
20913 args
= TI_ARGS (tinfo
);
20915 else if (TREE_CODE (target
) == TEMPLATE_ID_EXPR
)
20917 tmpl
= TREE_OPERAND (target
, 0);
20918 args
= TREE_OPERAND (target
, 1);
20920 else if (VAR_P (target
))
20922 tree tinfo
= DECL_TEMPLATE_INFO (target
);
20923 tmpl
= TI_TEMPLATE (tinfo
);
20924 args
= TI_ARGS (tinfo
);
20927 gcc_unreachable ();
20929 tree main_tmpl
= most_general_template (tmpl
);
20931 /* For determining which partial specialization to use, only the
20932 innermost args are interesting. */
20933 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (args
))
20935 outer_args
= strip_innermost_template_args (args
, 1);
20936 args
= INNERMOST_TEMPLATE_ARGS (args
);
20939 for (t
= DECL_TEMPLATE_SPECIALIZATIONS (main_tmpl
); t
; t
= TREE_CHAIN (t
))
20941 tree partial_spec_args
;
20943 tree spec_tmpl
= TREE_VALUE (t
);
20945 partial_spec_args
= TREE_PURPOSE (t
);
20947 ++processing_template_decl
;
20951 /* Discard the outer levels of args, and then substitute in the
20952 template args from the enclosing class. */
20953 partial_spec_args
= INNERMOST_TEMPLATE_ARGS (partial_spec_args
);
20954 partial_spec_args
= tsubst_template_args
20955 (partial_spec_args
, outer_args
, tf_none
, NULL_TREE
);
20957 /* And the same for the partial specialization TEMPLATE_DECL. */
20958 spec_tmpl
= tsubst (spec_tmpl
, outer_args
, tf_none
, NULL_TREE
);
20961 partial_spec_args
=
20962 coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (tmpl
),
20965 /*require_all_args=*/true,
20966 /*use_default_args=*/true);
20968 --processing_template_decl
;
20970 if (partial_spec_args
== error_mark_node
)
20971 return error_mark_node
;
20972 if (spec_tmpl
== error_mark_node
)
20973 return error_mark_node
;
20975 tree parms
= DECL_INNERMOST_TEMPLATE_PARMS (spec_tmpl
);
20976 spec_args
= get_partial_spec_bindings (tmpl
, parms
,
20982 spec_args
= add_to_template_args (outer_args
, spec_args
);
20984 /* Keep the candidate only if the constraints are satisfied,
20985 or if we're not compiling with concepts. */
20987 || constraints_satisfied_p (spec_tmpl
, spec_args
))
20989 list
= tree_cons (spec_args
, TREE_VALUE (t
), list
);
20990 TREE_TYPE (list
) = TREE_TYPE (t
);
20998 ambiguous_p
= false;
21001 t
= TREE_CHAIN (t
);
21002 for (; t
; t
= TREE_CHAIN (t
))
21004 fate
= more_specialized_partial_spec (tmpl
, champ
, t
);
21011 t
= TREE_CHAIN (t
);
21014 ambiguous_p
= true;
21023 for (t
= list
; t
&& t
!= champ
; t
= TREE_CHAIN (t
))
21025 fate
= more_specialized_partial_spec (tmpl
, champ
, t
);
21028 ambiguous_p
= true;
21036 char *spaces
= NULL
;
21037 if (!(complain
& tf_error
))
21038 return error_mark_node
;
21039 if (TYPE_P (target
))
21040 error ("ambiguous template instantiation for %q#T", target
);
21042 error ("ambiguous template instantiation for %q#D", target
);
21043 str
= ngettext ("candidate is:", "candidates are:", list_length (list
));
21044 for (t
= list
; t
; t
= TREE_CHAIN (t
))
21046 tree subst
= build_tree_list (TREE_VALUE (t
), TREE_PURPOSE (t
));
21047 inform (DECL_SOURCE_LOCATION (TREE_VALUE (t
)),
21048 "%s %#S", spaces
? spaces
: str
, subst
);
21049 spaces
= spaces
? spaces
: get_spaces (str
);
21052 return error_mark_node
;
21058 /* Explicitly instantiate DECL. */
21061 do_decl_instantiation (tree decl
, tree storage
)
21063 tree result
= NULL_TREE
;
21066 if (!decl
|| decl
== error_mark_node
)
21067 /* An error occurred, for which grokdeclarator has already issued
21068 an appropriate message. */
21070 else if (! DECL_LANG_SPECIFIC (decl
))
21072 error ("explicit instantiation of non-template %q#D", decl
);
21076 bool var_templ
= (DECL_TEMPLATE_INFO (decl
)
21077 && variable_template_p (DECL_TI_TEMPLATE (decl
)));
21079 if (VAR_P (decl
) && !var_templ
)
21081 /* There is an asymmetry here in the way VAR_DECLs and
21082 FUNCTION_DECLs are handled by grokdeclarator. In the case of
21083 the latter, the DECL we get back will be marked as a
21084 template instantiation, and the appropriate
21085 DECL_TEMPLATE_INFO will be set up. This does not happen for
21086 VAR_DECLs so we do the lookup here. Probably, grokdeclarator
21087 should handle VAR_DECLs as it currently handles
21089 if (!DECL_CLASS_SCOPE_P (decl
))
21091 error ("%qD is not a static data member of a class template", decl
);
21094 result
= lookup_field (DECL_CONTEXT (decl
), DECL_NAME (decl
), 0, false);
21095 if (!result
|| !VAR_P (result
))
21097 error ("no matching template for %qD found", decl
);
21100 if (!same_type_p (TREE_TYPE (result
), TREE_TYPE (decl
)))
21102 error ("type %qT for explicit instantiation %qD does not match "
21103 "declared type %qT", TREE_TYPE (result
), decl
,
21108 else if (TREE_CODE (decl
) != FUNCTION_DECL
&& !var_templ
)
21110 error ("explicit instantiation of %q#D", decl
);
21116 /* Check for various error cases. Note that if the explicit
21117 instantiation is valid the RESULT will currently be marked as an
21118 *implicit* instantiation; DECL_EXPLICIT_INSTANTIATION is not set
21119 until we get here. */
21121 if (DECL_TEMPLATE_SPECIALIZATION (result
))
21123 /* DR 259 [temp.spec].
21125 Both an explicit instantiation and a declaration of an explicit
21126 specialization shall not appear in a program unless the explicit
21127 instantiation follows a declaration of the explicit specialization.
21129 For a given set of template parameters, if an explicit
21130 instantiation of a template appears after a declaration of an
21131 explicit specialization for that template, the explicit
21132 instantiation has no effect. */
21135 else if (DECL_EXPLICIT_INSTANTIATION (result
))
21139 No program shall explicitly instantiate any template more
21142 We check DECL_NOT_REALLY_EXTERN so as not to complain when
21143 the first instantiation was `extern' and the second is not,
21144 and EXTERN_P for the opposite case. */
21145 if (DECL_NOT_REALLY_EXTERN (result
) && !extern_p
)
21146 permerror (input_location
, "duplicate explicit instantiation of %q#D", result
);
21147 /* If an "extern" explicit instantiation follows an ordinary
21148 explicit instantiation, the template is instantiated. */
21152 else if (!DECL_IMPLICIT_INSTANTIATION (result
))
21154 error ("no matching template for %qD found", result
);
21157 else if (!DECL_TEMPLATE_INFO (result
))
21159 permerror (input_location
, "explicit instantiation of non-template %q#D", result
);
21163 if (storage
== NULL_TREE
)
21165 else if (storage
== ridpointers
[(int) RID_EXTERN
])
21167 if (!in_system_header_at (input_location
) && (cxx_dialect
== cxx98
))
21168 pedwarn (input_location
, OPT_Wpedantic
,
21169 "ISO C++ 1998 forbids the use of %<extern%> on explicit "
21174 error ("storage class %qD applied to template instantiation", storage
);
21176 check_explicit_instantiation_namespace (result
);
21177 mark_decl_instantiated (result
, extern_p
);
21179 instantiate_decl (result
, /*defer_ok=*/1,
21180 /*expl_inst_class_mem_p=*/false);
21184 mark_class_instantiated (tree t
, int extern_p
)
21186 SET_CLASSTYPE_EXPLICIT_INSTANTIATION (t
);
21187 SET_CLASSTYPE_INTERFACE_KNOWN (t
);
21188 CLASSTYPE_INTERFACE_ONLY (t
) = extern_p
;
21189 TYPE_DECL_SUPPRESS_DEBUG (TYPE_NAME (t
)) = extern_p
;
21192 CLASSTYPE_DEBUG_REQUESTED (t
) = 1;
21193 rest_of_type_compilation (t
, 1);
21197 /* Called from do_type_instantiation through binding_table_foreach to
21198 do recursive instantiation for the type bound in ENTRY. */
21200 bt_instantiate_type_proc (binding_entry entry
, void *data
)
21202 tree storage
= *(tree
*) data
;
21204 if (MAYBE_CLASS_TYPE_P (entry
->type
)
21205 && !uses_template_parms (CLASSTYPE_TI_ARGS (entry
->type
)))
21206 do_type_instantiation (TYPE_MAIN_DECL (entry
->type
), storage
, 0);
21209 /* Called from do_type_instantiation to instantiate a member
21210 (a member function or a static member variable) of an
21211 explicitly instantiated class template. */
21213 instantiate_class_member (tree decl
, int extern_p
)
21215 mark_decl_instantiated (decl
, extern_p
);
21217 instantiate_decl (decl
, /*defer_ok=*/1,
21218 /*expl_inst_class_mem_p=*/true);
21221 /* Perform an explicit instantiation of template class T. STORAGE, if
21222 non-null, is the RID for extern, inline or static. COMPLAIN is
21223 nonzero if this is called from the parser, zero if called recursively,
21224 since the standard is unclear (as detailed below). */
21227 do_type_instantiation (tree t
, tree storage
, tsubst_flags_t complain
)
21232 int previous_instantiation_extern_p
= 0;
21234 if (TREE_CODE (t
) == TYPE_DECL
)
21237 if (! CLASS_TYPE_P (t
) || ! CLASSTYPE_TEMPLATE_INFO (t
))
21240 (TYPE_TEMPLATE_INFO (t
)) ? TYPE_TI_TEMPLATE (t
) : NULL
;
21242 error ("explicit instantiation of non-class template %qD", tmpl
);
21244 error ("explicit instantiation of non-template type %qT", t
);
21250 if (!COMPLETE_TYPE_P (t
))
21252 if (complain
& tf_error
)
21253 error ("explicit instantiation of %q#T before definition of template",
21258 if (storage
!= NULL_TREE
)
21260 if (!in_system_header_at (input_location
))
21262 if (storage
== ridpointers
[(int) RID_EXTERN
])
21264 if (cxx_dialect
== cxx98
)
21265 pedwarn (input_location
, OPT_Wpedantic
,
21266 "ISO C++ 1998 forbids the use of %<extern%> on "
21267 "explicit instantiations");
21270 pedwarn (input_location
, OPT_Wpedantic
,
21271 "ISO C++ forbids the use of %qE"
21272 " on explicit instantiations", storage
);
21275 if (storage
== ridpointers
[(int) RID_INLINE
])
21277 else if (storage
== ridpointers
[(int) RID_EXTERN
])
21279 else if (storage
== ridpointers
[(int) RID_STATIC
])
21283 error ("storage class %qD applied to template instantiation",
21289 if (CLASSTYPE_TEMPLATE_SPECIALIZATION (t
))
21291 /* DR 259 [temp.spec].
21293 Both an explicit instantiation and a declaration of an explicit
21294 specialization shall not appear in a program unless the explicit
21295 instantiation follows a declaration of the explicit specialization.
21297 For a given set of template parameters, if an explicit
21298 instantiation of a template appears after a declaration of an
21299 explicit specialization for that template, the explicit
21300 instantiation has no effect. */
21303 else if (CLASSTYPE_EXPLICIT_INSTANTIATION (t
))
21307 No program shall explicitly instantiate any template more
21310 If PREVIOUS_INSTANTIATION_EXTERN_P, then the first explicit
21311 instantiation was `extern'. If EXTERN_P then the second is.
21312 These cases are OK. */
21313 previous_instantiation_extern_p
= CLASSTYPE_INTERFACE_ONLY (t
);
21315 if (!previous_instantiation_extern_p
&& !extern_p
21316 && (complain
& tf_error
))
21317 permerror (input_location
, "duplicate explicit instantiation of %q#T", t
);
21319 /* If we've already instantiated the template, just return now. */
21320 if (!CLASSTYPE_INTERFACE_ONLY (t
))
21324 check_explicit_instantiation_namespace (TYPE_NAME (t
));
21325 mark_class_instantiated (t
, extern_p
);
21333 /* In contrast to implicit instantiation, where only the
21334 declarations, and not the definitions, of members are
21335 instantiated, we have here:
21339 The explicit instantiation of a class template specialization
21340 implies the instantiation of all of its members not
21341 previously explicitly specialized in the translation unit
21342 containing the explicit instantiation.
21344 Of course, we can't instantiate member template classes, since
21345 we don't have any arguments for them. Note that the standard
21346 is unclear on whether the instantiation of the members are
21347 *explicit* instantiations or not. However, the most natural
21348 interpretation is that it should be an explicit instantiation. */
21351 for (tmp
= TYPE_METHODS (t
); tmp
; tmp
= DECL_CHAIN (tmp
))
21352 if (TREE_CODE (tmp
) == FUNCTION_DECL
21353 && DECL_TEMPLATE_INSTANTIATION (tmp
))
21354 instantiate_class_member (tmp
, extern_p
);
21356 for (tmp
= TYPE_FIELDS (t
); tmp
; tmp
= DECL_CHAIN (tmp
))
21357 if (VAR_P (tmp
) && DECL_TEMPLATE_INSTANTIATION (tmp
))
21358 instantiate_class_member (tmp
, extern_p
);
21360 if (CLASSTYPE_NESTED_UTDS (t
))
21361 binding_table_foreach (CLASSTYPE_NESTED_UTDS (t
),
21362 bt_instantiate_type_proc
, &storage
);
21366 /* Given a function DECL, which is a specialization of TMPL, modify
21367 DECL to be a re-instantiation of TMPL with the same template
21368 arguments. TMPL should be the template into which tsubst'ing
21369 should occur for DECL, not the most general template.
21371 One reason for doing this is a scenario like this:
21374 void f(const T&, int i);
21376 void g() { f(3, 7); }
21379 void f(const T& t, const int i) { }
21381 Note that when the template is first instantiated, with
21382 instantiate_template, the resulting DECL will have no name for the
21383 first parameter, and the wrong type for the second. So, when we go
21384 to instantiate the DECL, we regenerate it. */
21387 regenerate_decl_from_template (tree decl
, tree tmpl
)
21389 /* The arguments used to instantiate DECL, from the most general
21394 args
= DECL_TI_ARGS (decl
);
21395 code_pattern
= DECL_TEMPLATE_RESULT (tmpl
);
21397 /* Make sure that we can see identifiers, and compute access
21399 push_access_scope (decl
);
21401 if (TREE_CODE (decl
) == FUNCTION_DECL
)
21409 args_depth
= TMPL_ARGS_DEPTH (args
);
21410 parms_depth
= TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl
));
21411 if (args_depth
> parms_depth
)
21412 args
= get_innermost_template_args (args
, parms_depth
);
21414 specs
= tsubst_exception_specification (TREE_TYPE (code_pattern
),
21415 args
, tf_error
, NULL_TREE
,
21416 /*defer_ok*/false);
21417 if (specs
&& specs
!= error_mark_node
)
21418 TREE_TYPE (decl
) = build_exception_variant (TREE_TYPE (decl
),
21421 /* Merge parameter declarations. */
21422 decl_parm
= skip_artificial_parms_for (decl
,
21423 DECL_ARGUMENTS (decl
));
21425 = skip_artificial_parms_for (code_pattern
,
21426 DECL_ARGUMENTS (code_pattern
));
21427 while (decl_parm
&& !DECL_PACK_P (pattern_parm
))
21432 if (DECL_NAME (decl_parm
) != DECL_NAME (pattern_parm
))
21433 DECL_NAME (decl_parm
) = DECL_NAME (pattern_parm
);
21434 parm_type
= tsubst (TREE_TYPE (pattern_parm
), args
, tf_error
,
21436 parm_type
= type_decays_to (parm_type
);
21437 if (!same_type_p (TREE_TYPE (decl_parm
), parm_type
))
21438 TREE_TYPE (decl_parm
) = parm_type
;
21439 attributes
= DECL_ATTRIBUTES (pattern_parm
);
21440 if (DECL_ATTRIBUTES (decl_parm
) != attributes
)
21442 DECL_ATTRIBUTES (decl_parm
) = attributes
;
21443 cplus_decl_attributes (&decl_parm
, attributes
, /*flags=*/0);
21445 decl_parm
= DECL_CHAIN (decl_parm
);
21446 pattern_parm
= DECL_CHAIN (pattern_parm
);
21448 /* Merge any parameters that match with the function parameter
21450 if (pattern_parm
&& DECL_PACK_P (pattern_parm
))
21453 tree expanded_types
;
21454 /* Expand the TYPE_PACK_EXPANSION that provides the types for
21455 the parameters in this function parameter pack. */
21456 expanded_types
= tsubst_pack_expansion (TREE_TYPE (pattern_parm
),
21457 args
, tf_error
, NULL_TREE
);
21458 len
= TREE_VEC_LENGTH (expanded_types
);
21459 for (i
= 0; i
< len
; i
++)
21464 if (DECL_NAME (decl_parm
) != DECL_NAME (pattern_parm
))
21465 /* Rename the parameter to include the index. */
21466 DECL_NAME (decl_parm
) =
21467 make_ith_pack_parameter_name (DECL_NAME (pattern_parm
), i
);
21468 parm_type
= TREE_VEC_ELT (expanded_types
, i
);
21469 parm_type
= type_decays_to (parm_type
);
21470 if (!same_type_p (TREE_TYPE (decl_parm
), parm_type
))
21471 TREE_TYPE (decl_parm
) = parm_type
;
21472 attributes
= DECL_ATTRIBUTES (pattern_parm
);
21473 if (DECL_ATTRIBUTES (decl_parm
) != attributes
)
21475 DECL_ATTRIBUTES (decl_parm
) = attributes
;
21476 cplus_decl_attributes (&decl_parm
, attributes
, /*flags=*/0);
21478 decl_parm
= DECL_CHAIN (decl_parm
);
21481 /* Merge additional specifiers from the CODE_PATTERN. */
21482 if (DECL_DECLARED_INLINE_P (code_pattern
)
21483 && !DECL_DECLARED_INLINE_P (decl
))
21484 DECL_DECLARED_INLINE_P (decl
) = 1;
21486 else if (VAR_P (decl
))
21488 DECL_INITIAL (decl
) =
21489 tsubst_expr (DECL_INITIAL (code_pattern
), args
,
21490 tf_error
, DECL_TI_TEMPLATE (decl
),
21491 /*integral_constant_expression_p=*/false);
21492 if (VAR_HAD_UNKNOWN_BOUND (decl
))
21493 TREE_TYPE (decl
) = tsubst (TREE_TYPE (code_pattern
), args
,
21494 tf_error
, DECL_TI_TEMPLATE (decl
));
21497 gcc_unreachable ();
21499 pop_access_scope (decl
);
21502 /* Return the TEMPLATE_DECL into which DECL_TI_ARGS(DECL) should be
21503 substituted to get DECL. */
21506 template_for_substitution (tree decl
)
21508 tree tmpl
= DECL_TI_TEMPLATE (decl
);
21510 /* Set TMPL to the template whose DECL_TEMPLATE_RESULT is the pattern
21511 for the instantiation. This is not always the most general
21512 template. Consider, for example:
21515 struct S { template <class U> void f();
21516 template <> void f<int>(); };
21518 and an instantiation of S<double>::f<int>. We want TD to be the
21519 specialization S<T>::f<int>, not the more general S<T>::f<U>. */
21520 while (/* An instantiation cannot have a definition, so we need a
21521 more general template. */
21522 DECL_TEMPLATE_INSTANTIATION (tmpl
)
21523 /* We must also deal with friend templates. Given:
21525 template <class T> struct S {
21526 template <class U> friend void f() {};
21529 S<int>::f<U> say, is not an instantiation of S<T>::f<U>,
21530 so far as the language is concerned, but that's still
21531 where we get the pattern for the instantiation from. On
21532 other hand, if the definition comes outside the class, say:
21534 template <class T> struct S {
21535 template <class U> friend void f();
21537 template <class U> friend void f() {}
21539 we don't need to look any further. That's what the check for
21540 DECL_INITIAL is for. */
21541 || (TREE_CODE (decl
) == FUNCTION_DECL
21542 && DECL_FRIEND_PSEUDO_TEMPLATE_INSTANTIATION (tmpl
)
21543 && !DECL_INITIAL (DECL_TEMPLATE_RESULT (tmpl
))))
21545 /* The present template, TD, should not be a definition. If it
21546 were a definition, we should be using it! Note that we
21547 cannot restructure the loop to just keep going until we find
21548 a template with a definition, since that might go too far if
21549 a specialization was declared, but not defined. */
21551 /* Fetch the more general template. */
21552 tmpl
= DECL_TI_TEMPLATE (tmpl
);
21558 /* Returns true if we need to instantiate this template instance even if we
21559 know we aren't going to emit it. */
21562 always_instantiate_p (tree decl
)
21564 /* We always instantiate inline functions so that we can inline them. An
21565 explicit instantiation declaration prohibits implicit instantiation of
21566 non-inline functions. With high levels of optimization, we would
21567 normally inline non-inline functions -- but we're not allowed to do
21568 that for "extern template" functions. Therefore, we check
21569 DECL_DECLARED_INLINE_P, rather than possibly_inlined_p. */
21570 return ((TREE_CODE (decl
) == FUNCTION_DECL
21571 && (DECL_DECLARED_INLINE_P (decl
)
21572 || type_uses_auto (TREE_TYPE (TREE_TYPE (decl
)))))
21573 /* And we need to instantiate static data members so that
21574 their initializers are available in integral constant
21577 && decl_maybe_constant_var_p (decl
)));
21580 /* If FN has a noexcept-specifier that hasn't been instantiated yet,
21581 instantiate it now, modifying TREE_TYPE (fn). */
21584 maybe_instantiate_noexcept (tree fn
)
21586 tree fntype
, spec
, noex
, clone
;
21588 /* Don't instantiate a noexcept-specification from template context. */
21589 if (processing_template_decl
)
21592 if (DECL_CLONED_FUNCTION_P (fn
))
21593 fn
= DECL_CLONED_FUNCTION (fn
);
21594 fntype
= TREE_TYPE (fn
);
21595 spec
= TYPE_RAISES_EXCEPTIONS (fntype
);
21597 if (!spec
|| !TREE_PURPOSE (spec
))
21600 noex
= TREE_PURPOSE (spec
);
21602 if (TREE_CODE (noex
) == DEFERRED_NOEXCEPT
)
21604 if (DEFERRED_NOEXCEPT_PATTERN (noex
) == NULL_TREE
)
21605 spec
= get_defaulted_eh_spec (fn
);
21606 else if (push_tinst_level (fn
))
21608 push_access_scope (fn
);
21609 push_deferring_access_checks (dk_no_deferred
);
21610 input_location
= DECL_SOURCE_LOCATION (fn
);
21611 noex
= tsubst_copy_and_build (DEFERRED_NOEXCEPT_PATTERN (noex
),
21612 DEFERRED_NOEXCEPT_ARGS (noex
),
21613 tf_warning_or_error
, fn
,
21614 /*function_p=*/false,
21615 /*integral_constant_expression_p=*/true);
21616 pop_deferring_access_checks ();
21617 pop_access_scope (fn
);
21618 pop_tinst_level ();
21619 spec
= build_noexcept_spec (noex
, tf_warning_or_error
);
21620 if (spec
== error_mark_node
)
21621 spec
= noexcept_false_spec
;
21624 spec
= noexcept_false_spec
;
21626 TREE_TYPE (fn
) = build_exception_variant (fntype
, spec
);
21629 FOR_EACH_CLONE (clone
, fn
)
21631 if (TREE_TYPE (clone
) == fntype
)
21632 TREE_TYPE (clone
) = TREE_TYPE (fn
);
21634 TREE_TYPE (clone
) = build_exception_variant (TREE_TYPE (clone
), spec
);
21638 /* Produce the definition of D, a _DECL generated from a template. If
21639 DEFER_OK is nonzero, then we don't have to actually do the
21640 instantiation now; we just have to do it sometime. Normally it is
21641 an error if this is an explicit instantiation but D is undefined.
21642 EXPL_INST_CLASS_MEM_P is true iff D is a member of an
21643 explicitly instantiated class template. */
21646 instantiate_decl (tree d
, int defer_ok
,
21647 bool expl_inst_class_mem_p
)
21649 tree tmpl
= DECL_TI_TEMPLATE (d
);
21656 bool pattern_defined
;
21657 location_t saved_loc
= input_location
;
21658 int saved_unevaluated_operand
= cp_unevaluated_operand
;
21659 int saved_inhibit_evaluation_warnings
= c_inhibit_evaluation_warnings
;
21663 bool nested
= false;
21665 /* This function should only be used to instantiate templates for
21666 functions and static member variables. */
21667 gcc_assert (VAR_OR_FUNCTION_DECL_P (d
));
21669 /* A concept is never instantiated. */
21670 gcc_assert (!DECL_DECLARED_CONCEPT_P (d
));
21672 /* Variables are never deferred; if instantiation is required, they
21673 are instantiated right away. That allows for better code in the
21674 case that an expression refers to the value of the variable --
21675 if the variable has a constant value the referring expression can
21676 take advantage of that fact. */
21678 || DECL_DECLARED_CONSTEXPR_P (d
))
21681 /* Don't instantiate cloned functions. Instead, instantiate the
21682 functions they cloned. */
21683 if (TREE_CODE (d
) == FUNCTION_DECL
&& DECL_CLONED_FUNCTION_P (d
))
21684 d
= DECL_CLONED_FUNCTION (d
);
21686 if (DECL_TEMPLATE_INSTANTIATED (d
)
21687 || (TREE_CODE (d
) == FUNCTION_DECL
21688 && DECL_DEFAULTED_FN (d
) && DECL_INITIAL (d
))
21689 || DECL_TEMPLATE_SPECIALIZATION (d
))
21690 /* D has already been instantiated or explicitly specialized, so
21691 there's nothing for us to do here.
21693 It might seem reasonable to check whether or not D is an explicit
21694 instantiation, and, if so, stop here. But when an explicit
21695 instantiation is deferred until the end of the compilation,
21696 DECL_EXPLICIT_INSTANTIATION is set, even though we still need to do
21697 the instantiation. */
21700 /* Check to see whether we know that this template will be
21701 instantiated in some other file, as with "extern template"
21703 external_p
= (DECL_INTERFACE_KNOWN (d
) && DECL_REALLY_EXTERN (d
));
21705 /* In general, we do not instantiate such templates. */
21706 if (external_p
&& !always_instantiate_p (d
))
21709 gen_tmpl
= most_general_template (tmpl
);
21710 gen_args
= impartial_args (tmpl
, DECL_TI_ARGS (d
));
21712 if (tmpl
!= gen_tmpl
)
21713 /* We should already have the extra args. */
21714 gcc_assert (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (gen_tmpl
))
21715 == TMPL_ARGS_DEPTH (gen_args
));
21716 /* And what's in the hash table should match D. */
21717 gcc_assert ((spec
= retrieve_specialization (gen_tmpl
, gen_args
, 0)) == d
21718 || spec
== NULL_TREE
);
21720 /* This needs to happen before any tsubsting. */
21721 if (! push_tinst_level (d
))
21724 timevar_push (TV_TEMPLATE_INST
);
21726 /* Set TD to the template whose DECL_TEMPLATE_RESULT is the pattern
21727 for the instantiation. */
21728 td
= template_for_substitution (d
);
21729 code_pattern
= DECL_TEMPLATE_RESULT (td
);
21731 /* We should never be trying to instantiate a member of a class
21732 template or partial specialization. */
21733 gcc_assert (d
!= code_pattern
);
21735 if ((DECL_NAMESPACE_SCOPE_P (d
) && !DECL_INITIALIZED_IN_CLASS_P (d
))
21736 || DECL_TEMPLATE_SPECIALIZATION (td
))
21737 /* In the case of a friend template whose definition is provided
21738 outside the class, we may have too many arguments. Drop the
21739 ones we don't need. The same is true for specializations. */
21740 args
= get_innermost_template_args
21741 (gen_args
, TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (td
)));
21745 if (TREE_CODE (d
) == FUNCTION_DECL
)
21747 deleted_p
= DECL_DELETED_FN (code_pattern
);
21748 pattern_defined
= (DECL_SAVED_TREE (code_pattern
) != NULL_TREE
21749 || DECL_DEFAULTED_OUTSIDE_CLASS_P (code_pattern
)
21755 pattern_defined
= ! DECL_IN_AGGR_P (code_pattern
);
21758 /* We may be in the middle of deferred access check. Disable it now. */
21759 push_deferring_access_checks (dk_no_deferred
);
21761 /* Unless an explicit instantiation directive has already determined
21762 the linkage of D, remember that a definition is available for
21764 if (pattern_defined
21765 && !DECL_INTERFACE_KNOWN (d
)
21766 && !DECL_NOT_REALLY_EXTERN (d
))
21767 mark_definable (d
);
21769 DECL_SOURCE_LOCATION (td
) = DECL_SOURCE_LOCATION (code_pattern
);
21770 DECL_SOURCE_LOCATION (d
) = DECL_SOURCE_LOCATION (code_pattern
);
21771 input_location
= DECL_SOURCE_LOCATION (d
);
21773 /* If D is a member of an explicitly instantiated class template,
21774 and no definition is available, treat it like an implicit
21776 if (!pattern_defined
&& expl_inst_class_mem_p
21777 && DECL_EXPLICIT_INSTANTIATION (d
))
21779 /* Leave linkage flags alone on instantiations with anonymous
21781 if (TREE_PUBLIC (d
))
21783 DECL_NOT_REALLY_EXTERN (d
) = 0;
21784 DECL_INTERFACE_KNOWN (d
) = 0;
21786 SET_DECL_IMPLICIT_INSTANTIATION (d
);
21789 /* Defer all other templates, unless we have been explicitly
21790 forbidden from doing so. */
21791 if (/* If there is no definition, we cannot instantiate the
21794 /* If it's OK to postpone instantiation, do so. */
21796 /* If this is a static data member that will be defined
21797 elsewhere, we don't want to instantiate the entire data
21798 member, but we do want to instantiate the initializer so that
21799 we can substitute that elsewhere. */
21800 || (external_p
&& VAR_P (d
))
21801 /* Handle here a deleted function too, avoid generating
21802 its body (c++/61080). */
21805 /* The definition of the static data member is now required so
21806 we must substitute the initializer. */
21808 && !DECL_INITIAL (d
)
21809 && DECL_INITIAL (code_pattern
))
21813 bool const_init
= false;
21814 bool enter_context
= DECL_CLASS_SCOPE_P (d
);
21816 ns
= decl_namespace_context (d
);
21817 push_nested_namespace (ns
);
21819 push_nested_class (DECL_CONTEXT (d
));
21820 init
= tsubst_expr (DECL_INITIAL (code_pattern
),
21822 tf_warning_or_error
, NULL_TREE
,
21823 /*integral_constant_expression_p=*/false);
21824 /* If instantiating the initializer involved instantiating this
21825 again, don't call cp_finish_decl twice. */
21826 if (!DECL_INITIAL (d
))
21828 /* Make sure the initializer is still constant, in case of
21829 circular dependency (template/instantiate6.C). */
21831 = DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (code_pattern
);
21832 cp_finish_decl (d
, init
, /*init_const_expr_p=*/const_init
,
21833 /*asmspec_tree=*/NULL_TREE
,
21834 LOOKUP_ONLYCONVERTING
);
21837 pop_nested_class ();
21838 pop_nested_namespace (ns
);
21841 /* We restore the source position here because it's used by
21842 add_pending_template. */
21843 input_location
= saved_loc
;
21845 if (at_eof
&& !pattern_defined
21846 && DECL_EXPLICIT_INSTANTIATION (d
)
21847 && DECL_NOT_REALLY_EXTERN (d
))
21850 The definition of a non-exported function template, a
21851 non-exported member function template, or a non-exported
21852 member function or static data member of a class template
21853 shall be present in every translation unit in which it is
21854 explicitly instantiated. */
21855 permerror (input_location
, "explicit instantiation of %qD "
21856 "but no definition available", d
);
21858 /* If we're in unevaluated context, we just wanted to get the
21859 constant value; this isn't an odr use, so don't queue
21860 a full instantiation. */
21861 if (cp_unevaluated_operand
!= 0)
21863 /* ??? Historically, we have instantiated inline functions, even
21864 when marked as "extern template". */
21865 if (!(external_p
&& VAR_P (d
)))
21866 add_pending_template (d
);
21869 /* Tell the repository that D is available in this translation unit
21870 -- and see if it is supposed to be instantiated here. */
21871 if (TREE_PUBLIC (d
) && !DECL_REALLY_EXTERN (d
) && !repo_emit_p (d
))
21873 /* In a PCH file, despite the fact that the repository hasn't
21874 requested instantiation in the PCH it is still possible that
21875 an instantiation will be required in a file that includes the
21878 add_pending_template (d
);
21879 /* Instantiate inline functions so that the inliner can do its
21880 job, even though we'll not be emitting a copy of this
21882 if (!(TREE_CODE (d
) == FUNCTION_DECL
&& possibly_inlined_p (d
)))
21886 fn_context
= decl_function_context (d
);
21887 nested
= (current_function_decl
!= NULL_TREE
);
21888 vec
<tree
> omp_privatization_save
;
21890 save_omp_privatization_clauses (omp_privatization_save
);
21893 push_to_top_level ();
21897 push_function_context ();
21898 cp_unevaluated_operand
= 0;
21899 c_inhibit_evaluation_warnings
= 0;
21902 /* Mark D as instantiated so that recursive calls to
21903 instantiate_decl do not try to instantiate it again. */
21904 DECL_TEMPLATE_INSTANTIATED (d
) = 1;
21906 /* Regenerate the declaration in case the template has been modified
21907 by a subsequent redeclaration. */
21908 regenerate_decl_from_template (d
, td
);
21910 /* We already set the file and line above. Reset them now in case
21911 they changed as a result of calling regenerate_decl_from_template. */
21912 input_location
= DECL_SOURCE_LOCATION (d
);
21917 bool const_init
= false;
21919 /* Clear out DECL_RTL; whatever was there before may not be right
21920 since we've reset the type of the declaration. */
21921 SET_DECL_RTL (d
, NULL
);
21922 DECL_IN_AGGR_P (d
) = 0;
21924 /* The initializer is placed in DECL_INITIAL by
21925 regenerate_decl_from_template so we don't need to
21926 push/pop_access_scope again here. Pull it out so that
21927 cp_finish_decl can process it. */
21928 init
= DECL_INITIAL (d
);
21929 DECL_INITIAL (d
) = NULL_TREE
;
21930 DECL_INITIALIZED_P (d
) = 0;
21932 /* Clear DECL_EXTERNAL so that cp_finish_decl will process the
21933 initializer. That function will defer actual emission until
21934 we have a chance to determine linkage. */
21935 DECL_EXTERNAL (d
) = 0;
21937 /* Enter the scope of D so that access-checking works correctly. */
21938 bool enter_context
= DECL_CLASS_SCOPE_P (d
);
21940 push_nested_class (DECL_CONTEXT (d
));
21942 const_init
= DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (code_pattern
);
21943 cp_finish_decl (d
, init
, const_init
, NULL_TREE
, 0);
21946 pop_nested_class ();
21948 if (variable_template_p (gen_tmpl
))
21949 note_variable_template_instantiation (d
);
21951 else if (TREE_CODE (d
) == FUNCTION_DECL
&& DECL_DEFAULTED_FN (code_pattern
))
21952 synthesize_method (d
);
21953 else if (TREE_CODE (d
) == FUNCTION_DECL
)
21955 hash_map
<tree
, tree
> *saved_local_specializations
;
21959 tree block
= NULL_TREE
;
21961 /* Save away the current list, in case we are instantiating one
21962 template from within the body of another. */
21963 saved_local_specializations
= local_specializations
;
21965 /* Set up the list of local specializations. */
21966 local_specializations
= new hash_map
<tree
, tree
>;
21968 /* Set up context. */
21969 if (DECL_OMP_DECLARE_REDUCTION_P (code_pattern
)
21970 && TREE_CODE (DECL_CONTEXT (code_pattern
)) == FUNCTION_DECL
)
21971 block
= push_stmt_list ();
21973 start_preparsed_function (d
, NULL_TREE
, SF_PRE_PARSED
);
21975 /* Some typedefs referenced from within the template code need to be
21976 access checked at template instantiation time, i.e now. These
21977 types were added to the template at parsing time. Let's get those
21978 and perform the access checks then. */
21979 perform_typedefs_access_check (DECL_TEMPLATE_RESULT (gen_tmpl
),
21982 /* Create substitution entries for the parameters. */
21983 subst_decl
= DECL_TEMPLATE_RESULT (template_for_substitution (d
));
21984 tmpl_parm
= DECL_ARGUMENTS (subst_decl
);
21985 spec_parm
= DECL_ARGUMENTS (d
);
21986 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (d
))
21988 register_local_specialization (spec_parm
, tmpl_parm
);
21989 spec_parm
= skip_artificial_parms_for (d
, spec_parm
);
21990 tmpl_parm
= skip_artificial_parms_for (subst_decl
, tmpl_parm
);
21992 for (; tmpl_parm
; tmpl_parm
= DECL_CHAIN (tmpl_parm
))
21994 if (!DECL_PACK_P (tmpl_parm
))
21996 register_local_specialization (spec_parm
, tmpl_parm
);
21997 spec_parm
= DECL_CHAIN (spec_parm
);
22001 /* Register the (value) argument pack as a specialization of
22002 TMPL_PARM, then move on. */
22003 tree argpack
= extract_fnparm_pack (tmpl_parm
, &spec_parm
);
22004 register_local_specialization (argpack
, tmpl_parm
);
22007 gcc_assert (!spec_parm
);
22009 /* Substitute into the body of the function. */
22010 if (DECL_OMP_DECLARE_REDUCTION_P (code_pattern
))
22011 tsubst_omp_udr (DECL_SAVED_TREE (code_pattern
), args
,
22012 tf_warning_or_error
, tmpl
);
22015 tsubst_expr (DECL_SAVED_TREE (code_pattern
), args
,
22016 tf_warning_or_error
, tmpl
,
22017 /*integral_constant_expression_p=*/false);
22019 /* Set the current input_location to the end of the function
22020 so that finish_function knows where we are. */
22022 = DECL_STRUCT_FUNCTION (code_pattern
)->function_end_locus
;
22024 /* Remember if we saw an infinite loop in the template. */
22025 current_function_infinite_loop
22026 = DECL_STRUCT_FUNCTION (code_pattern
)->language
->infinite_loop
;
22029 /* We don't need the local specializations any more. */
22030 delete local_specializations
;
22031 local_specializations
= saved_local_specializations
;
22033 /* Finish the function. */
22034 if (DECL_OMP_DECLARE_REDUCTION_P (code_pattern
)
22035 && TREE_CODE (DECL_CONTEXT (code_pattern
)) == FUNCTION_DECL
)
22036 DECL_SAVED_TREE (d
) = pop_stmt_list (block
);
22039 d
= finish_function (0);
22040 expand_or_defer_fn (d
);
22043 if (DECL_OMP_DECLARE_REDUCTION_P (code_pattern
))
22044 cp_check_omp_declare_reduction (d
);
22047 /* We're not deferring instantiation any more. */
22048 TI_PENDING_TEMPLATE_FLAG (DECL_TEMPLATE_INFO (d
)) = 0;
22051 pop_from_top_level ();
22053 pop_function_context ();
22056 input_location
= saved_loc
;
22057 cp_unevaluated_operand
= saved_unevaluated_operand
;
22058 c_inhibit_evaluation_warnings
= saved_inhibit_evaluation_warnings
;
22059 pop_deferring_access_checks ();
22060 pop_tinst_level ();
22062 restore_omp_privatization_clauses (omp_privatization_save
);
22064 timevar_pop (TV_TEMPLATE_INST
);
22069 /* Run through the list of templates that we wish we could
22070 instantiate, and instantiate any we can. RETRIES is the
22071 number of times we retry pending template instantiation. */
22074 instantiate_pending_templates (int retries
)
22077 location_t saved_loc
= input_location
;
22079 /* Instantiating templates may trigger vtable generation. This in turn
22080 may require further template instantiations. We place a limit here
22081 to avoid infinite loop. */
22082 if (pending_templates
&& retries
>= max_tinst_depth
)
22084 tree decl
= pending_templates
->tinst
->decl
;
22086 fatal_error (input_location
,
22087 "template instantiation depth exceeds maximum of %d"
22088 " instantiating %q+D, possibly from virtual table generation"
22089 " (use -ftemplate-depth= to increase the maximum)",
22090 max_tinst_depth
, decl
);
22091 if (TREE_CODE (decl
) == FUNCTION_DECL
)
22092 /* Pretend that we defined it. */
22093 DECL_INITIAL (decl
) = error_mark_node
;
22099 struct pending_template
**t
= &pending_templates
;
22100 struct pending_template
*last
= NULL
;
22104 tree instantiation
= reopen_tinst_level ((*t
)->tinst
);
22105 bool complete
= false;
22107 if (TYPE_P (instantiation
))
22111 if (!COMPLETE_TYPE_P (instantiation
))
22113 instantiate_class_template (instantiation
);
22114 if (CLASSTYPE_TEMPLATE_INSTANTIATION (instantiation
))
22115 for (fn
= TYPE_METHODS (instantiation
);
22117 fn
= TREE_CHAIN (fn
))
22118 if (! DECL_ARTIFICIAL (fn
))
22119 instantiate_decl (fn
,
22121 /*expl_inst_class_mem_p=*/false);
22122 if (COMPLETE_TYPE_P (instantiation
))
22126 complete
= COMPLETE_TYPE_P (instantiation
);
22130 if (!DECL_TEMPLATE_SPECIALIZATION (instantiation
)
22131 && !DECL_TEMPLATE_INSTANTIATED (instantiation
))
22134 = instantiate_decl (instantiation
,
22136 /*expl_inst_class_mem_p=*/false);
22137 if (DECL_TEMPLATE_INSTANTIATED (instantiation
))
22141 complete
= (DECL_TEMPLATE_SPECIALIZATION (instantiation
)
22142 || DECL_TEMPLATE_INSTANTIATED (instantiation
));
22146 /* If INSTANTIATION has been instantiated, then we don't
22147 need to consider it again in the future. */
22155 current_tinst_level
= NULL
;
22157 last_pending_template
= last
;
22159 while (reconsider
);
22161 input_location
= saved_loc
;
22164 /* Substitute ARGVEC into T, which is a list of initializers for
22165 either base class or a non-static data member. The TREE_PURPOSEs
22166 are DECLs, and the TREE_VALUEs are the initializer values. Used by
22167 instantiate_decl. */
22170 tsubst_initializer_list (tree t
, tree argvec
)
22172 tree inits
= NULL_TREE
;
22174 for (; t
; t
= TREE_CHAIN (t
))
22178 tree expanded_bases
= NULL_TREE
;
22179 tree expanded_arguments
= NULL_TREE
;
22182 if (TREE_CODE (TREE_PURPOSE (t
)) == TYPE_PACK_EXPANSION
)
22187 /* Expand the base class expansion type into separate base
22189 expanded_bases
= tsubst_pack_expansion (TREE_PURPOSE (t
), argvec
,
22190 tf_warning_or_error
,
22192 if (expanded_bases
== error_mark_node
)
22195 /* We'll be building separate TREE_LISTs of arguments for
22197 len
= TREE_VEC_LENGTH (expanded_bases
);
22198 expanded_arguments
= make_tree_vec (len
);
22199 for (i
= 0; i
< len
; i
++)
22200 TREE_VEC_ELT (expanded_arguments
, i
) = NULL_TREE
;
22202 /* Build a dummy EXPR_PACK_EXPANSION that will be used to
22203 expand each argument in the TREE_VALUE of t. */
22204 expr
= make_node (EXPR_PACK_EXPANSION
);
22205 PACK_EXPANSION_LOCAL_P (expr
) = true;
22206 PACK_EXPANSION_PARAMETER_PACKS (expr
) =
22207 PACK_EXPANSION_PARAMETER_PACKS (TREE_PURPOSE (t
));
22209 if (TREE_VALUE (t
) == void_type_node
)
22210 /* VOID_TYPE_NODE is used to indicate
22211 value-initialization. */
22213 for (i
= 0; i
< len
; i
++)
22214 TREE_VEC_ELT (expanded_arguments
, i
) = void_type_node
;
22218 /* Substitute parameter packs into each argument in the
22220 in_base_initializer
= 1;
22221 for (arg
= TREE_VALUE (t
); arg
; arg
= TREE_CHAIN (arg
))
22223 tree expanded_exprs
;
22225 /* Expand the argument. */
22226 SET_PACK_EXPANSION_PATTERN (expr
, TREE_VALUE (arg
));
22228 = tsubst_pack_expansion (expr
, argvec
,
22229 tf_warning_or_error
,
22231 if (expanded_exprs
== error_mark_node
)
22234 /* Prepend each of the expanded expressions to the
22235 corresponding TREE_LIST in EXPANDED_ARGUMENTS. */
22236 for (i
= 0; i
< len
; i
++)
22238 TREE_VEC_ELT (expanded_arguments
, i
) =
22239 tree_cons (NULL_TREE
,
22240 TREE_VEC_ELT (expanded_exprs
, i
),
22241 TREE_VEC_ELT (expanded_arguments
, i
));
22244 in_base_initializer
= 0;
22246 /* Reverse all of the TREE_LISTs in EXPANDED_ARGUMENTS,
22247 since we built them backwards. */
22248 for (i
= 0; i
< len
; i
++)
22250 TREE_VEC_ELT (expanded_arguments
, i
) =
22251 nreverse (TREE_VEC_ELT (expanded_arguments
, i
));
22256 for (i
= 0; i
< len
; ++i
)
22258 if (expanded_bases
)
22260 decl
= TREE_VEC_ELT (expanded_bases
, i
);
22261 decl
= expand_member_init (decl
);
22262 init
= TREE_VEC_ELT (expanded_arguments
, i
);
22267 decl
= tsubst_copy (TREE_PURPOSE (t
), argvec
,
22268 tf_warning_or_error
, NULL_TREE
);
22270 decl
= expand_member_init (decl
);
22271 if (decl
&& !DECL_P (decl
))
22272 in_base_initializer
= 1;
22274 init
= TREE_VALUE (t
);
22276 if (init
!= void_type_node
)
22277 init
= tsubst_expr (init
, argvec
,
22278 tf_warning_or_error
, NULL_TREE
,
22279 /*integral_constant_expression_p=*/false);
22280 if (init
== NULL_TREE
&& tmp
!= NULL_TREE
)
22281 /* If we had an initializer but it instantiated to nothing,
22282 value-initialize the object. This will only occur when
22283 the initializer was a pack expansion where the parameter
22284 packs used in that expansion were of length zero. */
22285 init
= void_type_node
;
22286 in_base_initializer
= 0;
22291 init
= build_tree_list (decl
, init
);
22292 TREE_CHAIN (init
) = inits
;
22300 /* Set CURRENT_ACCESS_SPECIFIER based on the protection of DECL. */
22303 set_current_access_from_decl (tree decl
)
22305 if (TREE_PRIVATE (decl
))
22306 current_access_specifier
= access_private_node
;
22307 else if (TREE_PROTECTED (decl
))
22308 current_access_specifier
= access_protected_node
;
22310 current_access_specifier
= access_public_node
;
22313 /* Instantiate an enumerated type. TAG is the template type, NEWTAG
22314 is the instantiation (which should have been created with
22315 start_enum) and ARGS are the template arguments to use. */
22318 tsubst_enum (tree tag
, tree newtag
, tree args
)
22322 if (SCOPED_ENUM_P (newtag
))
22323 begin_scope (sk_scoped_enum
, newtag
);
22325 for (e
= TYPE_VALUES (tag
); e
; e
= TREE_CHAIN (e
))
22330 decl
= TREE_VALUE (e
);
22331 /* Note that in a template enum, the TREE_VALUE is the
22332 CONST_DECL, not the corresponding INTEGER_CST. */
22333 value
= tsubst_expr (DECL_INITIAL (decl
),
22334 args
, tf_warning_or_error
, NULL_TREE
,
22335 /*integral_constant_expression_p=*/true);
22337 /* Give this enumeration constant the correct access. */
22338 set_current_access_from_decl (decl
);
22340 /* Actually build the enumerator itself. Here we're assuming that
22341 enumerators can't have dependent attributes. */
22342 build_enumerator (DECL_NAME (decl
), value
, newtag
,
22343 DECL_ATTRIBUTES (decl
), DECL_SOURCE_LOCATION (decl
));
22346 if (SCOPED_ENUM_P (newtag
))
22349 finish_enum_value_list (newtag
);
22350 finish_enum (newtag
);
22352 DECL_SOURCE_LOCATION (TYPE_NAME (newtag
))
22353 = DECL_SOURCE_LOCATION (TYPE_NAME (tag
));
22356 /* DECL is a FUNCTION_DECL that is a template specialization. Return
22357 its type -- but without substituting the innermost set of template
22358 arguments. So, innermost set of template parameters will appear in
22362 get_mostly_instantiated_function_type (tree decl
)
22364 /* For a function, DECL_TI_TEMPLATE is partially instantiated. */
22365 return TREE_TYPE (DECL_TI_TEMPLATE (decl
));
22368 /* Return truthvalue if we're processing a template different from
22369 the last one involved in diagnostics. */
22371 problematic_instantiation_changed (void)
22373 return current_tinst_level
!= last_error_tinst_level
;
22376 /* Remember current template involved in diagnostics. */
22378 record_last_problematic_instantiation (void)
22380 last_error_tinst_level
= current_tinst_level
;
22383 struct tinst_level
*
22384 current_instantiation (void)
22386 return current_tinst_level
;
22389 /* Return TRUE if current_function_decl is being instantiated, false
22393 instantiating_current_function_p (void)
22395 return (current_instantiation ()
22396 && current_instantiation ()->decl
== current_function_decl
);
22399 /* [temp.param] Check that template non-type parm TYPE is of an allowable
22400 type. Return zero for ok, nonzero for disallowed. Issue error and
22401 warning messages under control of COMPLAIN. */
22404 invalid_nontype_parm_type_p (tree type
, tsubst_flags_t complain
)
22406 if (INTEGRAL_OR_ENUMERATION_TYPE_P (type
))
22408 else if (POINTER_TYPE_P (type
))
22410 else if (TYPE_PTRMEM_P (type
))
22412 else if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
)
22414 else if (TREE_CODE (type
) == TYPENAME_TYPE
)
22416 else if (TREE_CODE (type
) == DECLTYPE_TYPE
)
22418 else if (TREE_CODE (type
) == NULLPTR_TYPE
)
22420 /* A bound template template parm could later be instantiated to have a valid
22421 nontype parm type via an alias template. */
22422 else if (cxx_dialect
>= cxx11
22423 && TREE_CODE (type
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
22426 if (complain
& tf_error
)
22428 if (type
== error_mark_node
)
22429 inform (input_location
, "invalid template non-type parameter");
22431 error ("%q#T is not a valid type for a template non-type parameter",
22437 /* Returns TRUE if TYPE is dependent, in the sense of [temp.dep.type].
22438 Assumes that TYPE really is a type, and not the ERROR_MARK_NODE.*/
22441 dependent_type_p_r (tree type
)
22447 A type is dependent if it is:
22449 -- a template parameter. Template template parameters are types
22450 for us (since TYPE_P holds true for them) so we handle
22452 if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
22453 || TREE_CODE (type
) == TEMPLATE_TEMPLATE_PARM
)
22455 /* -- a qualified-id with a nested-name-specifier which contains a
22456 class-name that names a dependent type or whose unqualified-id
22457 names a dependent type. */
22458 if (TREE_CODE (type
) == TYPENAME_TYPE
)
22461 /* An alias template specialization can be dependent even if the
22462 resulting type is not. */
22463 if (dependent_alias_template_spec_p (type
))
22466 /* -- a cv-qualified type where the cv-unqualified type is
22468 No code is necessary for this bullet; the code below handles
22469 cv-qualified types, and we don't want to strip aliases with
22470 TYPE_MAIN_VARIANT because of DR 1558. */
22471 /* -- a compound type constructed from any dependent type. */
22472 if (TYPE_PTRMEM_P (type
))
22473 return (dependent_type_p (TYPE_PTRMEM_CLASS_TYPE (type
))
22474 || dependent_type_p (TYPE_PTRMEM_POINTED_TO_TYPE
22476 else if (TYPE_PTR_P (type
)
22477 || TREE_CODE (type
) == REFERENCE_TYPE
)
22478 return dependent_type_p (TREE_TYPE (type
));
22479 else if (TREE_CODE (type
) == FUNCTION_TYPE
22480 || TREE_CODE (type
) == METHOD_TYPE
)
22484 if (dependent_type_p (TREE_TYPE (type
)))
22486 for (arg_type
= TYPE_ARG_TYPES (type
);
22488 arg_type
= TREE_CHAIN (arg_type
))
22489 if (dependent_type_p (TREE_VALUE (arg_type
)))
22493 /* -- an array type constructed from any dependent type or whose
22494 size is specified by a constant expression that is
22497 We checked for type- and value-dependence of the bounds in
22498 compute_array_index_type, so TYPE_DEPENDENT_P is already set. */
22499 if (TREE_CODE (type
) == ARRAY_TYPE
)
22501 if (TYPE_DOMAIN (type
)
22502 && dependent_type_p (TYPE_DOMAIN (type
)))
22504 return dependent_type_p (TREE_TYPE (type
));
22507 /* -- a template-id in which either the template name is a template
22509 if (TREE_CODE (type
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
22511 /* ... or any of the template arguments is a dependent type or
22512 an expression that is type-dependent or value-dependent. */
22513 else if (CLASS_TYPE_P (type
) && CLASSTYPE_TEMPLATE_INFO (type
)
22514 && (any_dependent_template_arguments_p
22515 (INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (type
)))))
22518 /* All TYPEOF_TYPEs, DECLTYPE_TYPEs, and UNDERLYING_TYPEs are
22519 dependent; if the argument of the `typeof' expression is not
22520 type-dependent, then it should already been have resolved. */
22521 if (TREE_CODE (type
) == TYPEOF_TYPE
22522 || TREE_CODE (type
) == DECLTYPE_TYPE
22523 || TREE_CODE (type
) == UNDERLYING_TYPE
)
22526 /* A template argument pack is dependent if any of its packed
22528 if (TREE_CODE (type
) == TYPE_ARGUMENT_PACK
)
22530 tree args
= ARGUMENT_PACK_ARGS (type
);
22531 int i
, len
= TREE_VEC_LENGTH (args
);
22532 for (i
= 0; i
< len
; ++i
)
22533 if (dependent_template_arg_p (TREE_VEC_ELT (args
, i
)))
22537 /* All TYPE_PACK_EXPANSIONs are dependent, because parameter packs must
22538 be template parameters. */
22539 if (TREE_CODE (type
) == TYPE_PACK_EXPANSION
)
22542 /* The standard does not specifically mention types that are local
22543 to template functions or local classes, but they should be
22544 considered dependent too. For example:
22546 template <int I> void f() {
22551 The size of `E' cannot be known until the value of `I' has been
22552 determined. Therefore, `E' must be considered dependent. */
22553 scope
= TYPE_CONTEXT (type
);
22554 if (scope
&& TYPE_P (scope
))
22555 return dependent_type_p (scope
);
22556 /* Don't use type_dependent_expression_p here, as it can lead
22557 to infinite recursion trying to determine whether a lambda
22558 nested in a lambda is dependent (c++/47687). */
22559 else if (scope
&& TREE_CODE (scope
) == FUNCTION_DECL
22560 && DECL_LANG_SPECIFIC (scope
)
22561 && DECL_TEMPLATE_INFO (scope
)
22562 && (any_dependent_template_arguments_p
22563 (INNERMOST_TEMPLATE_ARGS (DECL_TI_ARGS (scope
)))))
22566 /* Other types are non-dependent. */
22570 /* Returns TRUE if TYPE is dependent, in the sense of
22571 [temp.dep.type]. Note that a NULL type is considered dependent. */
22574 dependent_type_p (tree type
)
22576 /* If there are no template parameters in scope, then there can't be
22577 any dependent types. */
22578 if (!processing_template_decl
)
22580 /* If we are not processing a template, then nobody should be
22581 providing us with a dependent type. */
22583 gcc_assert (TREE_CODE (type
) != TEMPLATE_TYPE_PARM
|| is_auto (type
));
22587 /* If the type is NULL, we have not computed a type for the entity
22588 in question; in that case, the type is dependent. */
22592 /* Erroneous types can be considered non-dependent. */
22593 if (type
== error_mark_node
)
22596 /* If we have not already computed the appropriate value for TYPE,
22598 if (!TYPE_DEPENDENT_P_VALID (type
))
22600 TYPE_DEPENDENT_P (type
) = dependent_type_p_r (type
);
22601 TYPE_DEPENDENT_P_VALID (type
) = 1;
22604 return TYPE_DEPENDENT_P (type
);
22607 /* Returns TRUE if SCOPE is a dependent scope, in which we can't do any
22608 lookup. In other words, a dependent type that is not the current
22612 dependent_scope_p (tree scope
)
22614 return (scope
&& TYPE_P (scope
) && dependent_type_p (scope
)
22615 && !currently_open_class (scope
));
22618 /* T is a SCOPE_REF; return whether we need to consider it
22619 instantiation-dependent so that we can check access at instantiation
22620 time even though we know which member it resolves to. */
22623 instantiation_dependent_scope_ref_p (tree t
)
22625 if (DECL_P (TREE_OPERAND (t
, 1))
22626 && CLASS_TYPE_P (TREE_OPERAND (t
, 0))
22627 && accessible_in_template_p (TREE_OPERAND (t
, 0),
22628 TREE_OPERAND (t
, 1)))
22634 /* Returns TRUE if the EXPRESSION is value-dependent, in the sense of
22635 [temp.dep.constexpr]. EXPRESSION is already known to be a constant
22638 /* Note that this predicate is not appropriate for general expressions;
22639 only constant expressions (that satisfy potential_constant_expression)
22640 can be tested for value dependence. */
22643 value_dependent_expression_p (tree expression
)
22645 if (!processing_template_decl
)
22648 /* A name declared with a dependent type. */
22649 if (DECL_P (expression
) && type_dependent_expression_p (expression
))
22652 switch (TREE_CODE (expression
))
22654 case IDENTIFIER_NODE
:
22655 /* A name that has not been looked up -- must be dependent. */
22658 case TEMPLATE_PARM_INDEX
:
22659 /* A non-type template parm. */
22663 /* A non-type template parm. */
22664 if (DECL_TEMPLATE_PARM_P (expression
))
22666 return value_dependent_expression_p (DECL_INITIAL (expression
));
22669 /* A constant with literal type and is initialized
22670 with an expression that is value-dependent.
22672 Note that a non-dependent parenthesized initializer will have
22673 already been replaced with its constant value, so if we see
22674 a TREE_LIST it must be dependent. */
22675 if (DECL_INITIAL (expression
)
22676 && decl_constant_var_p (expression
)
22677 && (TREE_CODE (DECL_INITIAL (expression
)) == TREE_LIST
22678 /* cp_finish_decl doesn't fold reference initializers. */
22679 || TREE_CODE (TREE_TYPE (expression
)) == REFERENCE_TYPE
22680 || value_dependent_expression_p (DECL_INITIAL (expression
))))
22684 case DYNAMIC_CAST_EXPR
:
22685 case STATIC_CAST_EXPR
:
22686 case CONST_CAST_EXPR
:
22687 case REINTERPRET_CAST_EXPR
:
22689 /* These expressions are value-dependent if the type to which
22690 the cast occurs is dependent or the expression being casted
22691 is value-dependent. */
22693 tree type
= TREE_TYPE (expression
);
22695 if (dependent_type_p (type
))
22698 /* A functional cast has a list of operands. */
22699 expression
= TREE_OPERAND (expression
, 0);
22702 /* If there are no operands, it must be an expression such
22703 as "int()". This should not happen for aggregate types
22704 because it would form non-constant expressions. */
22705 gcc_assert (cxx_dialect
>= cxx11
22706 || INTEGRAL_OR_ENUMERATION_TYPE_P (type
));
22711 if (TREE_CODE (expression
) == TREE_LIST
)
22712 return any_value_dependent_elements_p (expression
);
22714 return value_dependent_expression_p (expression
);
22718 if (SIZEOF_EXPR_TYPE_P (expression
))
22719 return dependent_type_p (TREE_TYPE (TREE_OPERAND (expression
, 0)));
22723 /* A `sizeof' expression is value-dependent if the operand is
22724 type-dependent or is a pack expansion. */
22725 expression
= TREE_OPERAND (expression
, 0);
22726 if (PACK_EXPANSION_P (expression
))
22728 else if (TYPE_P (expression
))
22729 return dependent_type_p (expression
);
22730 return instantiation_dependent_expression_p (expression
);
22732 case AT_ENCODE_EXPR
:
22733 /* An 'encode' expression is value-dependent if the operand is
22735 expression
= TREE_OPERAND (expression
, 0);
22736 return dependent_type_p (expression
);
22738 case NOEXCEPT_EXPR
:
22739 expression
= TREE_OPERAND (expression
, 0);
22740 return instantiation_dependent_expression_p (expression
);
22743 /* All instantiation-dependent expressions should also be considered
22744 value-dependent. */
22745 return instantiation_dependent_scope_ref_p (expression
);
22747 case COMPONENT_REF
:
22748 return (value_dependent_expression_p (TREE_OPERAND (expression
, 0))
22749 || value_dependent_expression_p (TREE_OPERAND (expression
, 1)));
22751 case NONTYPE_ARGUMENT_PACK
:
22752 /* A NONTYPE_ARGUMENT_PACK is value-dependent if any packed argument
22753 is value-dependent. */
22755 tree values
= ARGUMENT_PACK_ARGS (expression
);
22756 int i
, len
= TREE_VEC_LENGTH (values
);
22758 for (i
= 0; i
< len
; ++i
)
22759 if (value_dependent_expression_p (TREE_VEC_ELT (values
, i
)))
22767 tree type2
= TRAIT_EXPR_TYPE2 (expression
);
22768 return (dependent_type_p (TRAIT_EXPR_TYPE1 (expression
))
22769 || (type2
? dependent_type_p (type2
) : false));
22773 return ((value_dependent_expression_p (TREE_OPERAND (expression
, 0)))
22774 || (value_dependent_expression_p (TREE_OPERAND (expression
, 2))));
22777 return ((value_dependent_expression_p (TREE_OPERAND (expression
, 0)))
22778 || (value_dependent_expression_p (TREE_OPERAND (expression
, 1))));
22782 tree op
= TREE_OPERAND (expression
, 0);
22783 return (value_dependent_expression_p (op
)
22784 || has_value_dependent_address (op
));
22787 case REQUIRES_EXPR
:
22788 /* Treat all requires-expressions as value-dependent so
22789 we don't try to fold them. */
22793 return dependent_type_p (TREE_OPERAND (expression
, 0));
22797 tree fn
= get_callee_fndecl (expression
);
22799 if (!fn
&& value_dependent_expression_p (CALL_EXPR_FN (expression
)))
22801 nargs
= call_expr_nargs (expression
);
22802 for (i
= 0; i
< nargs
; ++i
)
22804 tree op
= CALL_EXPR_ARG (expression
, i
);
22805 /* In a call to a constexpr member function, look through the
22806 implicit ADDR_EXPR on the object argument so that it doesn't
22807 cause the call to be considered value-dependent. We also
22808 look through it in potential_constant_expression. */
22809 if (i
== 0 && fn
&& DECL_DECLARED_CONSTEXPR_P (fn
)
22810 && DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
)
22811 && TREE_CODE (op
) == ADDR_EXPR
)
22812 op
= TREE_OPERAND (op
, 0);
22813 if (value_dependent_expression_p (op
))
22819 case TEMPLATE_ID_EXPR
:
22820 /* If a TEMPLATE_ID_EXPR involves a dependent name, it will be
22822 return type_dependent_expression_p (expression
)
22823 || variable_concept_p (TREE_OPERAND (expression
, 0));
22829 if (dependent_type_p (TREE_TYPE (expression
)))
22831 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (expression
), ix
, val
)
22832 if (value_dependent_expression_p (val
))
22838 /* Treat a GNU statement expression as dependent to avoid crashing
22839 under instantiate_non_dependent_expr; it can't be constant. */
22843 /* A constant expression is value-dependent if any subexpression is
22844 value-dependent. */
22845 switch (TREE_CODE_CLASS (TREE_CODE (expression
)))
22847 case tcc_reference
:
22849 case tcc_comparison
:
22851 case tcc_expression
:
22854 int i
, len
= cp_tree_operand_length (expression
);
22856 for (i
= 0; i
< len
; i
++)
22858 tree t
= TREE_OPERAND (expression
, i
);
22860 /* In some cases, some of the operands may be missing.l
22861 (For example, in the case of PREDECREMENT_EXPR, the
22862 amount to increment by may be missing.) That doesn't
22863 make the expression dependent. */
22864 if (t
&& value_dependent_expression_p (t
))
22875 /* The expression is not value-dependent. */
22879 /* Returns TRUE if the EXPRESSION is type-dependent, in the sense of
22880 [temp.dep.expr]. Note that an expression with no type is
22881 considered dependent. Other parts of the compiler arrange for an
22882 expression with type-dependent subexpressions to have no type, so
22883 this function doesn't have to be fully recursive. */
22886 type_dependent_expression_p (tree expression
)
22888 if (!processing_template_decl
)
22891 if (expression
== NULL_TREE
|| expression
== error_mark_node
)
22894 /* An unresolved name is always dependent. */
22895 if (identifier_p (expression
)
22896 || TREE_CODE (expression
) == USING_DECL
22897 || TREE_CODE (expression
) == WILDCARD_DECL
)
22900 /* A fold expression is type-dependent. */
22901 if (TREE_CODE (expression
) == UNARY_LEFT_FOLD_EXPR
22902 || TREE_CODE (expression
) == UNARY_RIGHT_FOLD_EXPR
22903 || TREE_CODE (expression
) == BINARY_LEFT_FOLD_EXPR
22904 || TREE_CODE (expression
) == BINARY_RIGHT_FOLD_EXPR
)
22907 /* Some expression forms are never type-dependent. */
22908 if (TREE_CODE (expression
) == PSEUDO_DTOR_EXPR
22909 || TREE_CODE (expression
) == SIZEOF_EXPR
22910 || TREE_CODE (expression
) == ALIGNOF_EXPR
22911 || TREE_CODE (expression
) == AT_ENCODE_EXPR
22912 || TREE_CODE (expression
) == NOEXCEPT_EXPR
22913 || TREE_CODE (expression
) == TRAIT_EXPR
22914 || TREE_CODE (expression
) == TYPEID_EXPR
22915 || TREE_CODE (expression
) == DELETE_EXPR
22916 || TREE_CODE (expression
) == VEC_DELETE_EXPR
22917 || TREE_CODE (expression
) == THROW_EXPR
22918 || TREE_CODE (expression
) == REQUIRES_EXPR
)
22921 /* The types of these expressions depends only on the type to which
22922 the cast occurs. */
22923 if (TREE_CODE (expression
) == DYNAMIC_CAST_EXPR
22924 || TREE_CODE (expression
) == STATIC_CAST_EXPR
22925 || TREE_CODE (expression
) == CONST_CAST_EXPR
22926 || TREE_CODE (expression
) == REINTERPRET_CAST_EXPR
22927 || TREE_CODE (expression
) == IMPLICIT_CONV_EXPR
22928 || TREE_CODE (expression
) == CAST_EXPR
)
22929 return dependent_type_p (TREE_TYPE (expression
));
22931 /* The types of these expressions depends only on the type created
22932 by the expression. */
22933 if (TREE_CODE (expression
) == NEW_EXPR
22934 || TREE_CODE (expression
) == VEC_NEW_EXPR
)
22936 /* For NEW_EXPR tree nodes created inside a template, either
22937 the object type itself or a TREE_LIST may appear as the
22939 tree type
= TREE_OPERAND (expression
, 1);
22940 if (TREE_CODE (type
) == TREE_LIST
)
22941 /* This is an array type. We need to check array dimensions
22943 return dependent_type_p (TREE_VALUE (TREE_PURPOSE (type
)))
22944 || value_dependent_expression_p
22945 (TREE_OPERAND (TREE_VALUE (type
), 1));
22947 return dependent_type_p (type
);
22950 if (TREE_CODE (expression
) == SCOPE_REF
)
22952 tree scope
= TREE_OPERAND (expression
, 0);
22953 tree name
= TREE_OPERAND (expression
, 1);
22955 /* 14.6.2.2 [temp.dep.expr]: An id-expression is type-dependent if it
22956 contains an identifier associated by name lookup with one or more
22957 declarations declared with a dependent type, or...a
22958 nested-name-specifier or qualified-id that names a member of an
22959 unknown specialization. */
22960 return (type_dependent_expression_p (name
)
22961 || dependent_scope_p (scope
));
22964 /* A function template specialization is type-dependent if it has any
22965 dependent template arguments. */
22966 if (TREE_CODE (expression
) == FUNCTION_DECL
22967 && DECL_LANG_SPECIFIC (expression
)
22968 && DECL_TEMPLATE_INFO (expression
))
22969 return any_dependent_template_arguments_p (DECL_TI_ARGS (expression
));
22971 if (TREE_CODE (expression
) == TEMPLATE_DECL
22972 && !DECL_TEMPLATE_TEMPLATE_PARM_P (expression
))
22975 if (TREE_CODE (expression
) == STMT_EXPR
)
22976 expression
= stmt_expr_value_expr (expression
);
22978 if (BRACE_ENCLOSED_INITIALIZER_P (expression
))
22983 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (expression
), i
, elt
)
22985 if (type_dependent_expression_p (elt
))
22991 /* A static data member of the current instantiation with incomplete
22992 array type is type-dependent, as the definition and specializations
22993 can have different bounds. */
22994 if (VAR_P (expression
)
22995 && DECL_CLASS_SCOPE_P (expression
)
22996 && dependent_type_p (DECL_CONTEXT (expression
))
22997 && VAR_HAD_UNKNOWN_BOUND (expression
))
23000 /* An array of unknown bound depending on a variadic parameter, eg:
23002 template<typename... Args>
23003 void foo (Args... args)
23005 int arr[] = { args... };
23008 template<int... vals>
23011 int arr[] = { vals... };
23014 If the array has no length and has an initializer, it must be that
23015 we couldn't determine its length in cp_complete_array_type because
23016 it is dependent. */
23017 if (VAR_P (expression
)
23018 && TREE_CODE (TREE_TYPE (expression
)) == ARRAY_TYPE
23019 && !TYPE_DOMAIN (TREE_TYPE (expression
))
23020 && DECL_INITIAL (expression
))
23023 /* A variable template specialization is type-dependent if it has any
23024 dependent template arguments. */
23025 if (VAR_P (expression
)
23026 && DECL_LANG_SPECIFIC (expression
)
23027 && DECL_TEMPLATE_INFO (expression
)
23028 && variable_template_p (DECL_TI_TEMPLATE (expression
)))
23029 return any_dependent_template_arguments_p (DECL_TI_ARGS (expression
));
23031 /* Always dependent, on the number of arguments if nothing else. */
23032 if (TREE_CODE (expression
) == EXPR_PACK_EXPANSION
)
23035 if (TREE_TYPE (expression
) == unknown_type_node
)
23037 if (TREE_CODE (expression
) == ADDR_EXPR
)
23038 return type_dependent_expression_p (TREE_OPERAND (expression
, 0));
23039 if (TREE_CODE (expression
) == COMPONENT_REF
23040 || TREE_CODE (expression
) == OFFSET_REF
)
23042 if (type_dependent_expression_p (TREE_OPERAND (expression
, 0)))
23044 expression
= TREE_OPERAND (expression
, 1);
23045 if (identifier_p (expression
))
23048 /* SCOPE_REF with non-null TREE_TYPE is always non-dependent. */
23049 if (TREE_CODE (expression
) == SCOPE_REF
)
23052 if (BASELINK_P (expression
))
23054 if (BASELINK_OPTYPE (expression
)
23055 && dependent_type_p (BASELINK_OPTYPE (expression
)))
23057 expression
= BASELINK_FUNCTIONS (expression
);
23060 if (TREE_CODE (expression
) == TEMPLATE_ID_EXPR
)
23062 if (any_dependent_template_arguments_p
23063 (TREE_OPERAND (expression
, 1)))
23065 expression
= TREE_OPERAND (expression
, 0);
23066 if (identifier_p (expression
))
23070 gcc_assert (TREE_CODE (expression
) == OVERLOAD
23071 || TREE_CODE (expression
) == FUNCTION_DECL
);
23075 if (type_dependent_expression_p (OVL_CURRENT (expression
)))
23077 expression
= OVL_NEXT (expression
);
23082 gcc_assert (TREE_CODE (expression
) != TYPE_DECL
);
23084 return (dependent_type_p (TREE_TYPE (expression
)));
23087 /* walk_tree callback function for instantiation_dependent_expression_p,
23088 below. Returns non-zero if a dependent subexpression is found. */
23091 instantiation_dependent_r (tree
*tp
, int *walk_subtrees
,
23096 /* We don't have to worry about decltype currently because decltype
23097 of an instantiation-dependent expr is a dependent type. This
23098 might change depending on the resolution of DR 1172. */
23099 *walk_subtrees
= false;
23102 enum tree_code code
= TREE_CODE (*tp
);
23105 /* Don't treat an argument list as dependent just because it has no
23113 /* A constant with a dependent initializer is dependent. */
23114 if (value_dependent_expression_p (*tp
))
23118 case TEMPLATE_PARM_INDEX
:
23121 /* Handle expressions with type operands. */
23125 case AT_ENCODE_EXPR
:
23127 tree op
= TREE_OPERAND (*tp
, 0);
23128 if (code
== SIZEOF_EXPR
&& SIZEOF_EXPR_TYPE_P (*tp
))
23129 op
= TREE_TYPE (op
);
23132 if (dependent_type_p (op
))
23136 *walk_subtrees
= false;
23144 if (value_dependent_expression_p (*tp
))
23146 *walk_subtrees
= false;
23149 case COMPONENT_REF
:
23150 if (identifier_p (TREE_OPERAND (*tp
, 1)))
23151 /* In a template, finish_class_member_access_expr creates a
23152 COMPONENT_REF with an IDENTIFIER_NODE for op1 even if it isn't
23153 type-dependent, so that we can check access control at
23154 instantiation time (PR 42277). See also Core issue 1273. */
23159 if (instantiation_dependent_scope_ref_p (*tp
))
23164 /* Treat statement-expressions as dependent. */
23168 /* Treat requires-expressions as dependent. */
23169 case REQUIRES_EXPR
:
23173 /* Treat calls to function concepts as dependent. */
23174 if (function_concept_check_p (*tp
))
23178 case TEMPLATE_ID_EXPR
:
23179 /* And variable concepts. */
23180 if (variable_concept_p (TREE_OPERAND (*tp
, 0)))
23188 if (type_dependent_expression_p (*tp
))
23194 /* Returns TRUE if the EXPRESSION is instantiation-dependent, in the
23195 sense defined by the ABI:
23197 "An expression is instantiation-dependent if it is type-dependent
23198 or value-dependent, or it has a subexpression that is type-dependent
23199 or value-dependent." */
23202 instantiation_dependent_expression_p (tree expression
)
23206 if (!processing_template_decl
)
23209 if (expression
== error_mark_node
)
23212 result
= cp_walk_tree_without_duplicates (&expression
,
23213 instantiation_dependent_r
, NULL
);
23214 return result
!= NULL_TREE
;
23217 /* Like type_dependent_expression_p, but it also works while not processing
23218 a template definition, i.e. during substitution or mangling. */
23221 type_dependent_expression_p_push (tree expr
)
23224 ++processing_template_decl
;
23225 b
= type_dependent_expression_p (expr
);
23226 --processing_template_decl
;
23230 /* Returns TRUE if ARGS contains a type-dependent expression. */
23233 any_type_dependent_arguments_p (const vec
<tree
, va_gc
> *args
)
23238 FOR_EACH_VEC_SAFE_ELT (args
, i
, arg
)
23240 if (type_dependent_expression_p (arg
))
23246 /* Returns TRUE if LIST (a TREE_LIST whose TREE_VALUEs are
23247 expressions) contains any type-dependent expressions. */
23250 any_type_dependent_elements_p (const_tree list
)
23252 for (; list
; list
= TREE_CHAIN (list
))
23253 if (type_dependent_expression_p (TREE_VALUE (list
)))
23259 /* Returns TRUE if LIST (a TREE_LIST whose TREE_VALUEs are
23260 expressions) contains any value-dependent expressions. */
23263 any_value_dependent_elements_p (const_tree list
)
23265 for (; list
; list
= TREE_CHAIN (list
))
23266 if (value_dependent_expression_p (TREE_VALUE (list
)))
23272 /* Returns TRUE if the ARG (a template argument) is dependent. */
23275 dependent_template_arg_p (tree arg
)
23277 if (!processing_template_decl
)
23280 /* Assume a template argument that was wrongly written by the user
23281 is dependent. This is consistent with what
23282 any_dependent_template_arguments_p [that calls this function]
23284 if (!arg
|| arg
== error_mark_node
)
23287 if (TREE_CODE (arg
) == ARGUMENT_PACK_SELECT
)
23288 arg
= ARGUMENT_PACK_SELECT_ARG (arg
);
23290 if (TREE_CODE (arg
) == TEMPLATE_DECL
23291 || TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
)
23292 return dependent_template_p (arg
);
23293 else if (ARGUMENT_PACK_P (arg
))
23295 tree args
= ARGUMENT_PACK_ARGS (arg
);
23296 int i
, len
= TREE_VEC_LENGTH (args
);
23297 for (i
= 0; i
< len
; ++i
)
23299 if (dependent_template_arg_p (TREE_VEC_ELT (args
, i
)))
23305 else if (TYPE_P (arg
))
23306 return dependent_type_p (arg
);
23308 return (type_dependent_expression_p (arg
)
23309 || value_dependent_expression_p (arg
));
23312 /* Returns true if ARGS (a collection of template arguments) contains
23313 any types that require structural equality testing. */
23316 any_template_arguments_need_structural_equality_p (tree args
)
23323 if (args
== error_mark_node
)
23326 for (i
= 0; i
< TMPL_ARGS_DEPTH (args
); ++i
)
23328 tree level
= TMPL_ARGS_LEVEL (args
, i
+ 1);
23329 for (j
= 0; j
< TREE_VEC_LENGTH (level
); ++j
)
23331 tree arg
= TREE_VEC_ELT (level
, j
);
23332 tree packed_args
= NULL_TREE
;
23335 if (ARGUMENT_PACK_P (arg
))
23337 /* Look inside the argument pack. */
23338 packed_args
= ARGUMENT_PACK_ARGS (arg
);
23339 len
= TREE_VEC_LENGTH (packed_args
);
23342 for (k
= 0; k
< len
; ++k
)
23345 arg
= TREE_VEC_ELT (packed_args
, k
);
23347 if (error_operand_p (arg
))
23349 else if (TREE_CODE (arg
) == TEMPLATE_DECL
)
23351 else if (TYPE_P (arg
) && TYPE_STRUCTURAL_EQUALITY_P (arg
))
23353 else if (!TYPE_P (arg
) && TREE_TYPE (arg
)
23354 && TYPE_STRUCTURAL_EQUALITY_P (TREE_TYPE (arg
)))
23363 /* Returns true if ARGS (a collection of template arguments) contains
23364 any dependent arguments. */
23367 any_dependent_template_arguments_p (const_tree args
)
23374 if (args
== error_mark_node
)
23377 for (i
= 0; i
< TMPL_ARGS_DEPTH (args
); ++i
)
23379 const_tree level
= TMPL_ARGS_LEVEL (args
, i
+ 1);
23380 for (j
= 0; j
< TREE_VEC_LENGTH (level
); ++j
)
23381 if (dependent_template_arg_p (TREE_VEC_ELT (level
, j
)))
23388 /* Returns TRUE if the template TMPL is dependent. */
23391 dependent_template_p (tree tmpl
)
23393 if (TREE_CODE (tmpl
) == OVERLOAD
)
23397 if (dependent_template_p (OVL_CURRENT (tmpl
)))
23399 tmpl
= OVL_NEXT (tmpl
);
23404 /* Template template parameters are dependent. */
23405 if (DECL_TEMPLATE_TEMPLATE_PARM_P (tmpl
)
23406 || TREE_CODE (tmpl
) == TEMPLATE_TEMPLATE_PARM
)
23408 /* So are names that have not been looked up. */
23409 if (TREE_CODE (tmpl
) == SCOPE_REF
|| identifier_p (tmpl
))
23411 /* So are member templates of dependent classes. */
23412 if (TYPE_P (CP_DECL_CONTEXT (tmpl
)))
23413 return dependent_type_p (DECL_CONTEXT (tmpl
));
23417 /* Returns TRUE if the specialization TMPL<ARGS> is dependent. */
23420 dependent_template_id_p (tree tmpl
, tree args
)
23422 return (dependent_template_p (tmpl
)
23423 || any_dependent_template_arguments_p (args
));
23426 /* Returns TRUE if OMP_FOR with DECLV, INITV, CONDV and INCRV vectors
23430 dependent_omp_for_p (tree declv
, tree initv
, tree condv
, tree incrv
)
23434 if (!processing_template_decl
)
23437 for (i
= 0; i
< TREE_VEC_LENGTH (declv
); i
++)
23439 tree decl
= TREE_VEC_ELT (declv
, i
);
23440 tree init
= TREE_VEC_ELT (initv
, i
);
23441 tree cond
= TREE_VEC_ELT (condv
, i
);
23442 tree incr
= TREE_VEC_ELT (incrv
, i
);
23444 if (type_dependent_expression_p (decl
)
23445 || TREE_CODE (decl
) == SCOPE_REF
)
23448 if (init
&& type_dependent_expression_p (init
))
23451 if (type_dependent_expression_p (cond
))
23454 if (COMPARISON_CLASS_P (cond
)
23455 && (type_dependent_expression_p (TREE_OPERAND (cond
, 0))
23456 || type_dependent_expression_p (TREE_OPERAND (cond
, 1))))
23459 if (TREE_CODE (incr
) == MODOP_EXPR
)
23461 if (type_dependent_expression_p (TREE_OPERAND (incr
, 0))
23462 || type_dependent_expression_p (TREE_OPERAND (incr
, 2)))
23465 else if (type_dependent_expression_p (incr
))
23467 else if (TREE_CODE (incr
) == MODIFY_EXPR
)
23469 if (type_dependent_expression_p (TREE_OPERAND (incr
, 0)))
23471 else if (BINARY_CLASS_P (TREE_OPERAND (incr
, 1)))
23473 tree t
= TREE_OPERAND (incr
, 1);
23474 if (type_dependent_expression_p (TREE_OPERAND (t
, 0))
23475 || type_dependent_expression_p (TREE_OPERAND (t
, 1)))
23484 /* TYPE is a TYPENAME_TYPE. Returns the ordinary TYPE to which the
23485 TYPENAME_TYPE corresponds. Returns the original TYPENAME_TYPE if
23486 no such TYPE can be found. Note that this function peers inside
23487 uninstantiated templates and therefore should be used only in
23488 extremely limited situations. ONLY_CURRENT_P restricts this
23489 peering to the currently open classes hierarchy (which is required
23490 when comparing types). */
23493 resolve_typename_type (tree type
, bool only_current_p
)
23502 gcc_assert (TREE_CODE (type
) == TYPENAME_TYPE
);
23504 scope
= TYPE_CONTEXT (type
);
23505 /* Usually the non-qualified identifier of a TYPENAME_TYPE is
23506 TYPE_IDENTIFIER (type). But when 'type' is a typedef variant of
23507 a TYPENAME_TYPE node, then TYPE_NAME (type) is set to the TYPE_DECL representing
23508 the typedef. In that case TYPE_IDENTIFIER (type) is not the non-qualified
23509 identifier of the TYPENAME_TYPE anymore.
23510 So by getting the TYPE_IDENTIFIER of the _main declaration_ of the
23511 TYPENAME_TYPE instead, we avoid messing up with a possible
23512 typedef variant case. */
23513 name
= TYPE_IDENTIFIER (TYPE_MAIN_VARIANT (type
));
23515 /* If the SCOPE is itself a TYPENAME_TYPE, then we need to resolve
23516 it first before we can figure out what NAME refers to. */
23517 if (TREE_CODE (scope
) == TYPENAME_TYPE
)
23519 if (TYPENAME_IS_RESOLVING_P (scope
))
23520 /* Given a class template A with a dependent base with nested type C,
23521 typedef typename A::C::C C will land us here, as trying to resolve
23522 the initial A::C leads to the local C typedef, which leads back to
23523 A::C::C. So we break the recursion now. */
23526 scope
= resolve_typename_type (scope
, only_current_p
);
23528 /* If we don't know what SCOPE refers to, then we cannot resolve the
23530 if (TREE_CODE (scope
) == TYPENAME_TYPE
)
23532 /* If the SCOPE is a template type parameter, we have no way of
23533 resolving the name. */
23534 if (TREE_CODE (scope
) == TEMPLATE_TYPE_PARM
)
23536 /* If the SCOPE is not the current instantiation, there's no reason
23537 to look inside it. */
23538 if (only_current_p
&& !currently_open_class (scope
))
23540 /* If this is a typedef, we don't want to look inside (c++/11987). */
23541 if (typedef_variant_p (type
))
23543 /* If SCOPE isn't the template itself, it will not have a valid
23544 TYPE_FIELDS list. */
23545 if (CLASS_TYPE_P (scope
)
23546 && same_type_p (scope
, CLASSTYPE_PRIMARY_TEMPLATE_TYPE (scope
)))
23547 /* scope is either the template itself or a compatible instantiation
23548 like X<T>, so look up the name in the original template. */
23549 scope
= CLASSTYPE_PRIMARY_TEMPLATE_TYPE (scope
);
23551 /* scope is a partial instantiation, so we can't do the lookup or we
23552 will lose the template arguments. */
23554 /* Enter the SCOPE so that name lookup will be resolved as if we
23555 were in the class definition. In particular, SCOPE will no
23556 longer be considered a dependent type. */
23557 pushed_scope
= push_scope (scope
);
23558 /* Look up the declaration. */
23559 decl
= lookup_member (scope
, name
, /*protect=*/0, /*want_type=*/true,
23560 tf_warning_or_error
);
23562 result
= NULL_TREE
;
23564 /* For a TYPENAME_TYPE like "typename X::template Y<T>", we want to
23565 find a TEMPLATE_DECL. Otherwise, we want to find a TYPE_DECL. */
23568 else if (identifier_p (TYPENAME_TYPE_FULLNAME (type
))
23569 && TREE_CODE (decl
) == TYPE_DECL
)
23571 result
= TREE_TYPE (decl
);
23572 if (result
== error_mark_node
)
23573 result
= NULL_TREE
;
23575 else if (TREE_CODE (TYPENAME_TYPE_FULLNAME (type
)) == TEMPLATE_ID_EXPR
23576 && DECL_CLASS_TEMPLATE_P (decl
))
23580 /* Obtain the template and the arguments. */
23581 tmpl
= TREE_OPERAND (TYPENAME_TYPE_FULLNAME (type
), 0);
23582 args
= TREE_OPERAND (TYPENAME_TYPE_FULLNAME (type
), 1);
23583 /* Instantiate the template. */
23584 result
= lookup_template_class (tmpl
, args
, NULL_TREE
, NULL_TREE
,
23585 /*entering_scope=*/0,
23586 tf_error
| tf_user
);
23587 if (result
== error_mark_node
)
23588 result
= NULL_TREE
;
23591 /* Leave the SCOPE. */
23593 pop_scope (pushed_scope
);
23595 /* If we failed to resolve it, return the original typename. */
23599 /* If lookup found a typename type, resolve that too. */
23600 if (TREE_CODE (result
) == TYPENAME_TYPE
&& !TYPENAME_IS_RESOLVING_P (result
))
23602 /* Ill-formed programs can cause infinite recursion here, so we
23603 must catch that. */
23604 TYPENAME_IS_RESOLVING_P (type
) = 1;
23605 result
= resolve_typename_type (result
, only_current_p
);
23606 TYPENAME_IS_RESOLVING_P (type
) = 0;
23609 /* Qualify the resulting type. */
23610 quals
= cp_type_quals (type
);
23612 result
= cp_build_qualified_type (result
, cp_type_quals (result
) | quals
);
23617 /* EXPR is an expression which is not type-dependent. Return a proxy
23618 for EXPR that can be used to compute the types of larger
23619 expressions containing EXPR. */
23622 build_non_dependent_expr (tree expr
)
23626 /* When checking, try to get a constant value for all non-dependent
23627 expressions in order to expose bugs in *_dependent_expression_p
23629 if (flag_checking
&& cxx_dialect
>= cxx11
23630 /* Don't do this during nsdmi parsing as it can lead to
23631 unexpected recursive instantiations. */
23632 && !parsing_nsdmi ())
23633 fold_non_dependent_expr (expr
);
23635 /* Preserve OVERLOADs; the functions must be available to resolve
23638 if (TREE_CODE (inner_expr
) == STMT_EXPR
)
23639 inner_expr
= stmt_expr_value_expr (inner_expr
);
23640 if (TREE_CODE (inner_expr
) == ADDR_EXPR
)
23641 inner_expr
= TREE_OPERAND (inner_expr
, 0);
23642 if (TREE_CODE (inner_expr
) == COMPONENT_REF
)
23643 inner_expr
= TREE_OPERAND (inner_expr
, 1);
23644 if (is_overloaded_fn (inner_expr
)
23645 || TREE_CODE (inner_expr
) == OFFSET_REF
)
23647 /* There is no need to return a proxy for a variable. */
23650 /* Preserve string constants; conversions from string constants to
23651 "char *" are allowed, even though normally a "const char *"
23652 cannot be used to initialize a "char *". */
23653 if (TREE_CODE (expr
) == STRING_CST
)
23655 /* Preserve void and arithmetic constants, as an optimization -- there is no
23656 reason to create a new node. */
23657 if (TREE_CODE (expr
) == VOID_CST
23658 || TREE_CODE (expr
) == INTEGER_CST
23659 || TREE_CODE (expr
) == REAL_CST
)
23661 /* Preserve THROW_EXPRs -- all throw-expressions have type "void".
23662 There is at least one place where we want to know that a
23663 particular expression is a throw-expression: when checking a ?:
23664 expression, there are special rules if the second or third
23665 argument is a throw-expression. */
23666 if (TREE_CODE (expr
) == THROW_EXPR
)
23669 /* Don't wrap an initializer list, we need to be able to look inside. */
23670 if (BRACE_ENCLOSED_INITIALIZER_P (expr
))
23673 /* Don't wrap a dummy object, we need to be able to test for it. */
23674 if (is_dummy_object (expr
))
23677 if (TREE_CODE (expr
) == COND_EXPR
)
23678 return build3 (COND_EXPR
,
23680 TREE_OPERAND (expr
, 0),
23681 (TREE_OPERAND (expr
, 1)
23682 ? build_non_dependent_expr (TREE_OPERAND (expr
, 1))
23683 : build_non_dependent_expr (TREE_OPERAND (expr
, 0))),
23684 build_non_dependent_expr (TREE_OPERAND (expr
, 2)));
23685 if (TREE_CODE (expr
) == COMPOUND_EXPR
23686 && !COMPOUND_EXPR_OVERLOADED (expr
))
23687 return build2 (COMPOUND_EXPR
,
23689 TREE_OPERAND (expr
, 0),
23690 build_non_dependent_expr (TREE_OPERAND (expr
, 1)));
23692 /* If the type is unknown, it can't really be non-dependent */
23693 gcc_assert (TREE_TYPE (expr
) != unknown_type_node
);
23695 /* Otherwise, build a NON_DEPENDENT_EXPR. */
23696 return build1 (NON_DEPENDENT_EXPR
, TREE_TYPE (expr
), expr
);
23699 /* ARGS is a vector of expressions as arguments to a function call.
23700 Replace the arguments with equivalent non-dependent expressions.
23701 This modifies ARGS in place. */
23704 make_args_non_dependent (vec
<tree
, va_gc
> *args
)
23709 FOR_EACH_VEC_SAFE_ELT (args
, ix
, arg
)
23711 tree newarg
= build_non_dependent_expr (arg
);
23713 (*args
)[ix
] = newarg
;
23717 /* Returns a type which represents 'auto' or 'decltype(auto)'. We use a
23718 TEMPLATE_TYPE_PARM with a level one deeper than the actual template
23719 parms. If set_canonical is true, we set TYPE_CANONICAL on it. */
23722 make_auto_1 (tree name
, bool set_canonical
)
23724 tree au
= cxx_make_type (TEMPLATE_TYPE_PARM
);
23725 TYPE_NAME (au
) = build_decl (input_location
,
23726 TYPE_DECL
, name
, au
);
23727 TYPE_STUB_DECL (au
) = TYPE_NAME (au
);
23728 TEMPLATE_TYPE_PARM_INDEX (au
) = build_template_parm_index
23729 (0, processing_template_decl
+ 1, processing_template_decl
+ 1,
23730 TYPE_NAME (au
), NULL_TREE
);
23732 TYPE_CANONICAL (au
) = canonical_type_parameter (au
);
23733 DECL_ARTIFICIAL (TYPE_NAME (au
)) = 1;
23734 SET_DECL_TEMPLATE_PARM_P (TYPE_NAME (au
));
23740 make_decltype_auto (void)
23742 return make_auto_1 (get_identifier ("decltype(auto)"), true);
23748 return make_auto_1 (get_identifier ("auto"), true);
23751 /* Make a "constrained auto" type-specifier. This is an
23752 auto type with constraints that must be associated after
23753 deduction. The constraint is formed from the given
23754 CONC and its optional sequence of arguments, which are
23755 non-null if written as partial-concept-id. */
23758 make_constrained_auto (tree con
, tree args
)
23760 tree type
= make_auto_1 (get_identifier ("auto"), false);
23762 /* Build the constraint. */
23763 tree tmpl
= DECL_TI_TEMPLATE (con
);
23766 expr
= build_concept_check (tmpl
, type
, args
);
23768 expr
= build_concept_check (build_overload (tmpl
, NULL_TREE
), type
, args
);
23770 tree constr
= make_predicate_constraint (expr
);
23771 PLACEHOLDER_TYPE_CONSTRAINTS (type
) = constr
;
23773 /* Our canonical type depends on the constraint. */
23774 TYPE_CANONICAL (type
) = canonical_type_parameter (type
);
23776 /* Attach the constraint to the type declaration. */
23777 tree decl
= TYPE_NAME (type
);
23781 /* Given type ARG, return std::initializer_list<ARG>. */
23786 tree std_init_list
= namespace_binding
23787 (get_identifier ("initializer_list"), std_node
);
23789 if (!std_init_list
|| !DECL_CLASS_TEMPLATE_P (std_init_list
))
23791 error ("deducing from brace-enclosed initializer list requires "
23792 "#include <initializer_list>");
23793 return error_mark_node
;
23795 argvec
= make_tree_vec (1);
23796 TREE_VEC_ELT (argvec
, 0) = arg
;
23797 return lookup_template_class (std_init_list
, argvec
, NULL_TREE
,
23798 NULL_TREE
, 0, tf_warning_or_error
);
23801 /* Replace auto in TYPE with std::initializer_list<auto>. */
23804 listify_autos (tree type
, tree auto_node
)
23806 tree init_auto
= listify (auto_node
);
23807 tree argvec
= make_tree_vec (1);
23808 TREE_VEC_ELT (argvec
, 0) = init_auto
;
23809 if (processing_template_decl
)
23810 argvec
= add_to_template_args (current_template_args (), argvec
);
23811 return tsubst (type
, argvec
, tf_warning_or_error
, NULL_TREE
);
23814 /* Hash traits for hashing possibly constrained 'auto'
23815 TEMPLATE_TYPE_PARMs for use by do_auto_deduction. */
23817 struct auto_hash
: default_hash_traits
<tree
>
23819 static inline hashval_t
hash (tree
);
23820 static inline bool equal (tree
, tree
);
23823 /* Hash the 'auto' T. */
23826 auto_hash::hash (tree t
)
23828 if (tree c
= PLACEHOLDER_TYPE_CONSTRAINTS (t
))
23829 /* Matching constrained-type-specifiers denote the same template
23830 parameter, so hash the constraint. */
23831 return hash_placeholder_constraint (c
);
23833 /* But unconstrained autos are all separate, so just hash the pointer. */
23834 return iterative_hash_object (t
, 0);
23837 /* Compare two 'auto's. */
23840 auto_hash::equal (tree t1
, tree t2
)
23845 tree c1
= PLACEHOLDER_TYPE_CONSTRAINTS (t1
);
23846 tree c2
= PLACEHOLDER_TYPE_CONSTRAINTS (t2
);
23848 /* Two unconstrained autos are distinct. */
23852 return equivalent_placeholder_constraints (c1
, c2
);
23855 /* for_each_template_parm callback for extract_autos: if t is a (possibly
23856 constrained) auto, add it to the vector. */
23859 extract_autos_r (tree t
, void *data
)
23861 hash_table
<auto_hash
> &hash
= *(hash_table
<auto_hash
>*)data
;
23862 if (is_auto_or_concept (t
))
23864 /* All the autos were built with index 0; fix that up now. */
23865 tree
*p
= hash
.find_slot (t
, INSERT
);
23868 /* If this is a repeated constrained-type-specifier, use the index we
23870 idx
= TEMPLATE_PARM_IDX (TEMPLATE_TYPE_PARM_INDEX (*p
));
23873 /* Otherwise this is new, so use the current count. */
23875 idx
= hash
.elements () - 1;
23877 TEMPLATE_PARM_IDX (TEMPLATE_TYPE_PARM_INDEX (t
)) = idx
;
23880 /* Always keep walking. */
23884 /* Return a TREE_VEC of the 'auto's used in type under the Concepts TS, which
23885 says they can appear anywhere in the type. */
23888 extract_autos (tree type
)
23890 hash_set
<tree
> visited
;
23891 hash_table
<auto_hash
> hash (2);
23893 for_each_template_parm (type
, extract_autos_r
, &hash
, &visited
, true);
23895 tree tree_vec
= make_tree_vec (hash
.elements());
23896 for (hash_table
<auto_hash
>::iterator iter
= hash
.begin();
23897 iter
!= hash
.end(); ++iter
)
23900 unsigned i
= TEMPLATE_PARM_IDX (TEMPLATE_TYPE_PARM_INDEX (elt
));
23901 TREE_VEC_ELT (tree_vec
, i
)
23902 = build_tree_list (NULL_TREE
, TYPE_NAME (elt
));
23908 /* Replace occurrences of 'auto' in TYPE with the appropriate type deduced
23909 from INIT. AUTO_NODE is the TEMPLATE_TYPE_PARM used for 'auto' in TYPE. */
23912 do_auto_deduction (tree type
, tree init
, tree auto_node
)
23914 return do_auto_deduction (type
, init
, auto_node
,
23915 tf_warning_or_error
,
23919 /* Replace occurrences of 'auto' in TYPE with the appropriate type deduced
23920 from INIT. AUTO_NODE is the TEMPLATE_TYPE_PARM used for 'auto' in TYPE.
23921 The CONTEXT determines the context in which auto deduction is performed
23922 and is used to control error diagnostics. */
23925 do_auto_deduction (tree type
, tree init
, tree auto_node
,
23926 tsubst_flags_t complain
, auto_deduction_context context
)
23930 if (init
== error_mark_node
)
23931 return error_mark_node
;
23933 if (type_dependent_expression_p (init
))
23934 /* Defining a subset of type-dependent expressions that we can deduce
23935 from ahead of time isn't worth the trouble. */
23938 /* [dcl.spec.auto]: Obtain P from T by replacing the occurrences of auto
23939 with either a new invented type template parameter U or, if the
23940 initializer is a braced-init-list (8.5.4), with
23941 std::initializer_list<U>. */
23942 if (BRACE_ENCLOSED_INITIALIZER_P (init
))
23944 if (!DIRECT_LIST_INIT_P (init
))
23945 type
= listify_autos (type
, auto_node
);
23946 else if (CONSTRUCTOR_NELTS (init
) == 1)
23947 init
= CONSTRUCTOR_ELT (init
, 0)->value
;
23950 if (complain
& tf_warning_or_error
)
23952 if (permerror (input_location
, "direct-list-initialization of "
23953 "%<auto%> requires exactly one element"))
23954 inform (input_location
,
23955 "for deduction to %<std::initializer_list%>, use copy-"
23956 "list-initialization (i.e. add %<=%> before the %<{%>)");
23958 type
= listify_autos (type
, auto_node
);
23962 if (type
== error_mark_node
)
23963 return error_mark_node
;
23965 init
= resolve_nondeduced_context (init
, complain
);
23967 if (AUTO_IS_DECLTYPE (auto_node
))
23969 bool id
= (DECL_P (init
) || (TREE_CODE (init
) == COMPONENT_REF
23970 && !REF_PARENTHESIZED_P (init
)));
23971 targs
= make_tree_vec (1);
23972 TREE_VEC_ELT (targs
, 0)
23973 = finish_decltype_type (init
, id
, tf_warning_or_error
);
23974 if (type
!= auto_node
)
23976 if (complain
& tf_error
)
23977 error ("%qT as type rather than plain %<decltype(auto)%>", type
);
23978 return error_mark_node
;
23983 tree parms
= build_tree_list (NULL_TREE
, type
);
23987 tparms
= extract_autos (type
);
23990 tparms
= make_tree_vec (1);
23991 TREE_VEC_ELT (tparms
, 0)
23992 = build_tree_list (NULL_TREE
, TYPE_NAME (auto_node
));
23995 targs
= make_tree_vec (TREE_VEC_LENGTH (tparms
));
23996 int val
= type_unification_real (tparms
, targs
, parms
, &init
, 1, 0,
23997 DEDUCE_CALL
, LOOKUP_NORMAL
,
23998 NULL
, /*explain_p=*/false);
24001 if (processing_template_decl
)
24002 /* Try again at instantiation time. */
24004 if (type
&& type
!= error_mark_node
24005 && (complain
& tf_error
))
24006 /* If type is error_mark_node a diagnostic must have been
24007 emitted by now. Also, having a mention to '<type error>'
24008 in the diagnostic is not really useful to the user. */
24010 if (cfun
&& auto_node
== current_function_auto_return_pattern
24011 && LAMBDA_FUNCTION_P (current_function_decl
))
24012 error ("unable to deduce lambda return type from %qE", init
);
24014 error ("unable to deduce %qT from %qE", type
, init
);
24015 type_unification_real (tparms
, targs
, parms
, &init
, 1, 0,
24016 DEDUCE_CALL
, LOOKUP_NORMAL
,
24017 NULL
, /*explain_p=*/true);
24019 return error_mark_node
;
24023 /* Check any placeholder constraints against the deduced type. */
24024 if (flag_concepts
&& !processing_template_decl
)
24025 if (tree constr
= PLACEHOLDER_TYPE_CONSTRAINTS (auto_node
))
24027 /* Use the deduced type to check the associated constraints. */
24028 if (!constraints_satisfied_p (constr
, targs
))
24030 if (complain
& tf_warning_or_error
)
24034 case adc_unspecified
:
24035 error("placeholder constraints not satisfied");
24037 case adc_variable_type
:
24038 error ("deduced initializer does not satisfy "
24039 "placeholder constraints");
24041 case adc_return_type
:
24042 error ("deduced return type does not satisfy "
24043 "placeholder constraints");
24045 case adc_requirement
:
24046 error ("deduced expression type does not saatisy "
24047 "placeholder constraints");
24050 diagnose_constraints (input_location
, constr
, targs
);
24052 return error_mark_node
;
24056 if (processing_template_decl
)
24057 targs
= add_to_template_args (current_template_args (), targs
);
24058 return tsubst (type
, targs
, complain
, NULL_TREE
);
24061 /* Substitutes LATE_RETURN_TYPE for 'auto' in TYPE and returns the
24065 splice_late_return_type (tree type
, tree late_return_type
)
24067 if (is_auto (type
))
24069 if (late_return_type
)
24070 return late_return_type
;
24072 tree idx
= get_template_parm_index (type
);
24073 if (TEMPLATE_PARM_LEVEL (idx
) <= processing_template_decl
)
24074 /* In an abbreviated function template we didn't know we were dealing
24075 with a function template when we saw the auto return type, so update
24076 it to have the correct level. */
24077 return make_auto_1 (TYPE_IDENTIFIER (type
), true);
24082 /* Returns true iff TYPE is a TEMPLATE_TYPE_PARM representing 'auto' or
24083 'decltype(auto)'. */
24086 is_auto (const_tree type
)
24088 if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
24089 && (TYPE_IDENTIFIER (type
) == get_identifier ("auto")
24090 || TYPE_IDENTIFIER (type
) == get_identifier ("decltype(auto)")))
24096 /* for_each_template_parm callback for type_uses_auto. */
24099 is_auto_r (tree tp
, void */
*data*/
)
24101 return is_auto_or_concept (tp
);
24104 /* Returns the TEMPLATE_TYPE_PARM in TYPE representing `auto' iff TYPE contains
24105 a use of `auto'. Returns NULL_TREE otherwise. */
24108 type_uses_auto (tree type
)
24110 if (type
== NULL_TREE
)
24112 else if (flag_concepts
)
24114 /* The Concepts TS allows multiple autos in one type-specifier; just
24115 return the first one we find, do_auto_deduction will collect all of
24117 if (uses_template_parms (type
))
24118 return for_each_template_parm (type
, is_auto_r
, /*data*/NULL
,
24119 /*visited*/NULL
, /*nondeduced*/true);
24124 return find_type_usage (type
, is_auto
);
24127 /* Returns true iff TYPE is a TEMPLATE_TYPE_PARM representing 'auto',
24128 'decltype(auto)' or a concept. */
24131 is_auto_or_concept (const_tree type
)
24133 return is_auto (type
); // or concept
24136 /* Returns the TEMPLATE_TYPE_PARM in TYPE representing a generic type (`auto' or
24137 a concept identifier) iff TYPE contains a use of a generic type. Returns
24138 NULL_TREE otherwise. */
24141 type_uses_auto_or_concept (tree type
)
24143 return find_type_usage (type
, is_auto_or_concept
);
24147 /* For a given template T, return the vector of typedefs referenced
24148 in T for which access check is needed at T instantiation time.
24149 T is either a FUNCTION_DECL or a RECORD_TYPE.
24150 Those typedefs were added to T by the function
24151 append_type_to_template_for_access_check. */
24153 vec
<qualified_typedef_usage_t
, va_gc
> *
24154 get_types_needing_access_check (tree t
)
24157 vec
<qualified_typedef_usage_t
, va_gc
> *result
= NULL
;
24159 if (!t
|| t
== error_mark_node
)
24162 if (!(ti
= get_template_info (t
)))
24165 if (CLASS_TYPE_P (t
)
24166 || TREE_CODE (t
) == FUNCTION_DECL
)
24168 if (!TI_TEMPLATE (ti
))
24171 result
= TI_TYPEDEFS_NEEDING_ACCESS_CHECKING (ti
);
24177 /* Append the typedef TYPE_DECL used in template T to a list of typedefs
24178 tied to T. That list of typedefs will be access checked at
24179 T instantiation time.
24180 T is either a FUNCTION_DECL or a RECORD_TYPE.
24181 TYPE_DECL is a TYPE_DECL node representing a typedef.
24182 SCOPE is the scope through which TYPE_DECL is accessed.
24183 LOCATION is the location of the usage point of TYPE_DECL.
24185 This function is a subroutine of
24186 append_type_to_template_for_access_check. */
24189 append_type_to_template_for_access_check_1 (tree t
,
24192 location_t location
)
24194 qualified_typedef_usage_t typedef_usage
;
24197 if (!t
|| t
== error_mark_node
)
24200 gcc_assert ((TREE_CODE (t
) == FUNCTION_DECL
24201 || CLASS_TYPE_P (t
))
24203 && TREE_CODE (type_decl
) == TYPE_DECL
24206 if (!(ti
= get_template_info (t
)))
24209 gcc_assert (TI_TEMPLATE (ti
));
24211 typedef_usage
.typedef_decl
= type_decl
;
24212 typedef_usage
.context
= scope
;
24213 typedef_usage
.locus
= location
;
24215 vec_safe_push (TI_TYPEDEFS_NEEDING_ACCESS_CHECKING (ti
), typedef_usage
);
24218 /* Append TYPE_DECL to the template TEMPL.
24219 TEMPL is either a class type, a FUNCTION_DECL or a a TEMPLATE_DECL.
24220 At TEMPL instanciation time, TYPE_DECL will be checked to see
24221 if it can be accessed through SCOPE.
24222 LOCATION is the location of the usage point of TYPE_DECL.
24224 e.g. consider the following code snippet:
24231 template<class U> struct S
24233 C::myint mi; // <-- usage point of the typedef C::myint
24238 At S<char> instantiation time, we need to check the access of C::myint
24239 In other words, we need to check the access of the myint typedef through
24240 the C scope. For that purpose, this function will add the myint typedef
24241 and the scope C through which its being accessed to a list of typedefs
24242 tied to the template S. That list will be walked at template instantiation
24243 time and access check performed on each typedefs it contains.
24244 Note that this particular code snippet should yield an error because
24245 myint is private to C. */
24248 append_type_to_template_for_access_check (tree templ
,
24251 location_t location
)
24253 qualified_typedef_usage_t
*iter
;
24256 gcc_assert (type_decl
&& (TREE_CODE (type_decl
) == TYPE_DECL
));
24258 /* Make sure we don't append the type to the template twice. */
24259 FOR_EACH_VEC_SAFE_ELT (get_types_needing_access_check (templ
), i
, iter
)
24260 if (iter
->typedef_decl
== type_decl
&& scope
== iter
->context
)
24263 append_type_to_template_for_access_check_1 (templ
, type_decl
,
24267 /* Convert the generic type parameters in PARM that match the types given in the
24268 range [START_IDX, END_IDX) from the current_template_parms into generic type
24272 convert_generic_types_to_packs (tree parm
, int start_idx
, int end_idx
)
24274 tree current
= current_template_parms
;
24275 int depth
= TMPL_PARMS_DEPTH (current
);
24276 current
= INNERMOST_TEMPLATE_PARMS (current
);
24277 tree replacement
= make_tree_vec (TREE_VEC_LENGTH (current
));
24279 for (int i
= 0; i
< start_idx
; ++i
)
24280 TREE_VEC_ELT (replacement
, i
)
24281 = TREE_TYPE (TREE_VALUE (TREE_VEC_ELT (current
, i
)));
24283 for (int i
= start_idx
; i
< end_idx
; ++i
)
24285 /* Create a distinct parameter pack type from the current parm and add it
24286 to the replacement args to tsubst below into the generic function
24289 tree o
= TREE_TYPE (TREE_VALUE
24290 (TREE_VEC_ELT (current
, i
)));
24291 tree t
= copy_type (o
);
24292 TEMPLATE_TYPE_PARM_INDEX (t
)
24293 = reduce_template_parm_level (TEMPLATE_TYPE_PARM_INDEX (o
),
24295 TREE_TYPE (TEMPLATE_TYPE_DECL (t
)) = t
;
24296 TYPE_STUB_DECL (t
) = TYPE_NAME (t
) = TEMPLATE_TYPE_DECL (t
);
24297 TYPE_MAIN_VARIANT (t
) = t
;
24298 TEMPLATE_TYPE_PARAMETER_PACK (t
) = true;
24299 TYPE_CANONICAL (t
) = canonical_type_parameter (t
);
24300 TREE_VEC_ELT (replacement
, i
) = t
;
24301 TREE_VALUE (TREE_VEC_ELT (current
, i
)) = TREE_CHAIN (t
);
24304 for (int i
= end_idx
, e
= TREE_VEC_LENGTH (current
); i
< e
; ++i
)
24305 TREE_VEC_ELT (replacement
, i
)
24306 = TREE_TYPE (TREE_VALUE (TREE_VEC_ELT (current
, i
)));
24308 /* If there are more levels then build up the replacement with the outer
24311 replacement
= add_to_template_args (template_parms_to_args
24312 (TREE_CHAIN (current_template_parms
)),
24315 return tsubst (parm
, replacement
, tf_none
, NULL_TREE
);
24318 /* Entries in the decl_constraint hash table. */
24319 struct GTY((for_user
)) constr_entry
24325 /* Hashing function and equality for constraint entries. */
24326 struct constr_hasher
: ggc_ptr_hash
<constr_entry
>
24328 static hashval_t
hash (constr_entry
*e
)
24330 return (hashval_t
)DECL_UID (e
->decl
);
24333 static bool equal (constr_entry
*e1
, constr_entry
*e2
)
24335 return e1
->decl
== e2
->decl
;
24339 /* A mapping from declarations to constraint information. Note that
24340 both templates and their underlying declarations are mapped to the
24341 same constraint information.
24343 FIXME: This is defined in pt.c because garbage collection
24344 code is not being generated for constraint.cc. */
24346 static GTY (()) hash_table
<constr_hasher
> *decl_constraints
;
24348 /* Returns true iff cinfo contains a valid set of constraints.
24349 This is the case when the associated requirements have been
24350 successfully decomposed into lists of atomic constraints.
24351 That is, when the saved assumptions are not error_mark_node. */
24354 valid_constraints_p (tree cinfo
)
24356 gcc_assert (cinfo
);
24357 return CI_ASSUMPTIONS (cinfo
) != error_mark_node
;
24360 /* Returns the template constraints of declaration T. If T is not
24361 constrained, return NULL_TREE. Note that T must be non-null. */
24364 get_constraints (tree t
)
24366 gcc_assert (DECL_P (t
));
24367 if (TREE_CODE (t
) == TEMPLATE_DECL
)
24368 t
= DECL_TEMPLATE_RESULT (t
);
24369 constr_entry elt
= { t
, NULL_TREE
};
24370 constr_entry
* found
= decl_constraints
->find (&elt
);
24377 /* Associate the given constraint information CI with the declaration
24378 T. If T is a template, then the constraints are associated with
24379 its underlying declaration. Don't build associations if CI is
24383 set_constraints (tree t
, tree ci
)
24388 if (TREE_CODE (t
) == TEMPLATE_DECL
)
24389 t
= DECL_TEMPLATE_RESULT (t
);
24390 gcc_assert (!get_constraints (t
));
24391 constr_entry elt
= {t
, ci
};
24392 constr_entry
** slot
= decl_constraints
->find_slot (&elt
, INSERT
);
24393 constr_entry
* entry
= ggc_alloc
<constr_entry
> ();
24398 /* Remove the associated constraints of the declaration T. */
24401 remove_constraints (tree t
)
24403 gcc_assert (DECL_P (t
));
24404 if (TREE_CODE (t
) == TEMPLATE_DECL
)
24405 t
= DECL_TEMPLATE_RESULT (t
);
24407 constr_entry elt
= {t
, NULL_TREE
};
24408 constr_entry
** slot
= decl_constraints
->find_slot (&elt
, NO_INSERT
);
24410 decl_constraints
->clear_slot (slot
);
24413 /* Set up the hash table for constraint association. */
24416 init_constraint_processing (void)
24418 decl_constraints
= hash_table
<constr_hasher
>::create_ggc(37);
24421 /* Set up the hash tables for template instantiations. */
24424 init_template_processing (void)
24426 decl_specializations
= hash_table
<spec_hasher
>::create_ggc (37);
24427 type_specializations
= hash_table
<spec_hasher
>::create_ggc (37);
24430 /* Print stats about the template hash tables for -fstats. */
24433 print_template_statistics (void)
24435 fprintf (stderr
, "decl_specializations: size %ld, %ld elements, "
24436 "%f collisions\n", (long) decl_specializations
->size (),
24437 (long) decl_specializations
->elements (),
24438 decl_specializations
->collisions ());
24439 fprintf (stderr
, "type_specializations: size %ld, %ld elements, "
24440 "%f collisions\n", (long) type_specializations
->size (),
24441 (long) type_specializations
->elements (),
24442 type_specializations
->collisions ());
24445 #include "gt-cp-pt.h"