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 && potential_nondependent_constant_expression (expr
))
5660 processing_template_decl_sentinel s
;
5661 expr
= instantiate_non_dependent_expr_internal (expr
, complain
);
5667 instantiate_non_dependent_expr (tree expr
)
5669 return instantiate_non_dependent_expr_sfinae (expr
, tf_error
);
5672 /* Like instantiate_non_dependent_expr, but return NULL_TREE rather than
5673 an uninstantiated expression. */
5676 instantiate_non_dependent_or_null (tree expr
)
5678 if (expr
== NULL_TREE
)
5680 if (processing_template_decl
)
5682 if (!potential_nondependent_constant_expression (expr
))
5686 processing_template_decl_sentinel s
;
5687 expr
= instantiate_non_dependent_expr_internal (expr
, tf_error
);
5693 /* True iff T is a specialization of a variable template. */
5696 variable_template_specialization_p (tree t
)
5698 if (!VAR_P (t
) || !DECL_LANG_SPECIFIC (t
) || !DECL_TEMPLATE_INFO (t
))
5700 tree tmpl
= DECL_TI_TEMPLATE (t
);
5701 return variable_template_p (tmpl
);
5704 /* Return TRUE iff T is a type alias, a TEMPLATE_DECL for an alias
5705 template declaration, or a TYPE_DECL for an alias declaration. */
5708 alias_type_or_template_p (tree t
)
5712 return ((TREE_CODE (t
) == TYPE_DECL
&& TYPE_DECL_ALIAS_P (t
))
5715 && TYPE_DECL_ALIAS_P (TYPE_NAME (t
)))
5716 || DECL_ALIAS_TEMPLATE_P (t
));
5719 /* Return TRUE iff T is a specialization of an alias template. */
5722 alias_template_specialization_p (const_tree t
)
5724 /* It's an alias template specialization if it's an alias and its
5725 TYPE_NAME is a specialization of a primary template. */
5726 if (TYPE_ALIAS_P (t
))
5728 tree name
= TYPE_NAME (t
);
5729 if (DECL_LANG_SPECIFIC (name
))
5730 if (tree ti
= DECL_TEMPLATE_INFO (name
))
5732 tree tmpl
= TI_TEMPLATE (ti
);
5733 return PRIMARY_TEMPLATE_P (tmpl
);
5739 /* An alias template is complex from a SFINAE perspective if a template-id
5740 using that alias can be ill-formed when the expansion is not, as with
5741 the void_t template. We determine this by checking whether the
5742 expansion for the alias template uses all its template parameters. */
5744 struct uses_all_template_parms_data
5751 uses_all_template_parms_r (tree t
, void *data_
)
5753 struct uses_all_template_parms_data
&data
5754 = *(struct uses_all_template_parms_data
*)data_
;
5755 tree idx
= get_template_parm_index (t
);
5757 if (TEMPLATE_PARM_LEVEL (idx
) == data
.level
)
5758 data
.seen
[TEMPLATE_PARM_IDX (idx
)] = true;
5763 complex_alias_template_p (const_tree tmpl
)
5765 struct uses_all_template_parms_data data
;
5766 tree pat
= DECL_ORIGINAL_TYPE (DECL_TEMPLATE_RESULT (tmpl
));
5767 tree parms
= DECL_TEMPLATE_PARMS (tmpl
);
5768 data
.level
= TMPL_PARMS_DEPTH (parms
);
5769 int len
= TREE_VEC_LENGTH (INNERMOST_TEMPLATE_PARMS (parms
));
5770 data
.seen
= XALLOCAVEC (bool, len
);
5771 for (int i
= 0; i
< len
; ++i
)
5772 data
.seen
[i
] = false;
5774 for_each_template_parm (pat
, uses_all_template_parms_r
, &data
, NULL
, true);
5775 for (int i
= 0; i
< len
; ++i
)
5781 /* Return TRUE iff T is a specialization of a complex alias template with
5782 dependent template-arguments. */
5785 dependent_alias_template_spec_p (const_tree t
)
5787 return (alias_template_specialization_p (t
)
5788 && TEMPLATE_DECL_COMPLEX_ALIAS_P (DECL_TI_TEMPLATE (TYPE_NAME (t
)))
5789 && (any_dependent_template_arguments_p
5790 (INNERMOST_TEMPLATE_ARGS (TYPE_TI_ARGS (t
)))));
5793 /* Return the number of innermost template parameters in TMPL. */
5796 num_innermost_template_parms (tree tmpl
)
5798 tree parms
= INNERMOST_TEMPLATE_PARMS (DECL_TEMPLATE_PARMS (tmpl
));
5799 return TREE_VEC_LENGTH (parms
);
5802 /* Return either TMPL or another template that it is equivalent to under DR
5803 1286: An alias that just changes the name of a template is equivalent to
5804 the other template. */
5807 get_underlying_template (tree tmpl
)
5809 gcc_assert (TREE_CODE (tmpl
) == TEMPLATE_DECL
);
5810 while (DECL_ALIAS_TEMPLATE_P (tmpl
))
5812 tree result
= DECL_ORIGINAL_TYPE (DECL_TEMPLATE_RESULT (tmpl
));
5813 if (TYPE_TEMPLATE_INFO (result
))
5815 tree sub
= TYPE_TI_TEMPLATE (result
);
5816 if (PRIMARY_TEMPLATE_P (sub
)
5817 && (num_innermost_template_parms (tmpl
)
5818 == num_innermost_template_parms (sub
)))
5820 tree alias_args
= INNERMOST_TEMPLATE_ARGS
5821 (template_parms_to_args (DECL_TEMPLATE_PARMS (tmpl
)));
5822 if (!comp_template_args (TYPE_TI_ARGS (result
), alias_args
))
5824 /* The alias type is equivalent to the pattern of the
5825 underlying template, so strip the alias. */
5835 /* Subroutine of convert_nontype_argument. Converts EXPR to TYPE, which
5836 must be a function or a pointer-to-function type, as specified
5837 in [temp.arg.nontype]: disambiguate EXPR if it is an overload set,
5838 and check that the resulting function has external linkage. */
5841 convert_nontype_argument_function (tree type
, tree expr
,
5842 tsubst_flags_t complain
)
5846 linkage_kind linkage
;
5848 fn
= instantiate_type (type
, fns
, tf_none
);
5849 if (fn
== error_mark_node
)
5850 return error_mark_node
;
5853 if (TREE_CODE (fn_no_ptr
) == ADDR_EXPR
)
5854 fn_no_ptr
= TREE_OPERAND (fn_no_ptr
, 0);
5855 if (BASELINK_P (fn_no_ptr
))
5856 fn_no_ptr
= BASELINK_FUNCTIONS (fn_no_ptr
);
5858 /* [temp.arg.nontype]/1
5860 A template-argument for a non-type, non-template template-parameter
5863 -- the address of an object or function with external [C++11: or
5864 internal] linkage. */
5866 if (TREE_CODE (fn_no_ptr
) != FUNCTION_DECL
)
5868 if (complain
& tf_error
)
5870 error ("%qE is not a valid template argument for type %qT",
5872 if (TYPE_PTR_P (type
))
5873 error ("it must be the address of a function with "
5874 "external linkage");
5876 error ("it must be the name of a function with "
5877 "external linkage");
5882 linkage
= decl_linkage (fn_no_ptr
);
5883 if (cxx_dialect
>= cxx11
? linkage
== lk_none
: linkage
!= lk_external
)
5885 if (complain
& tf_error
)
5887 if (cxx_dialect
>= cxx11
)
5888 error ("%qE is not a valid template argument for type %qT "
5889 "because %qD has no linkage",
5890 expr
, type
, fn_no_ptr
);
5892 error ("%qE is not a valid template argument for type %qT "
5893 "because %qD does not have external linkage",
5894 expr
, type
, fn_no_ptr
);
5902 /* Subroutine of convert_nontype_argument.
5903 Check if EXPR of type TYPE is a valid pointer-to-member constant.
5904 Emit an error otherwise. */
5907 check_valid_ptrmem_cst_expr (tree type
, tree expr
,
5908 tsubst_flags_t complain
)
5911 if (expr
&& (null_ptr_cst_p (expr
) || TREE_CODE (expr
) == PTRMEM_CST
))
5913 if (cxx_dialect
>= cxx11
&& null_member_pointer_value_p (expr
))
5915 if (processing_template_decl
5916 && TREE_CODE (expr
) == ADDR_EXPR
5917 && TREE_CODE (TREE_OPERAND (expr
, 0)) == OFFSET_REF
)
5919 if (complain
& tf_error
)
5921 error ("%qE is not a valid template argument for type %qT",
5923 error ("it must be a pointer-to-member of the form %<&X::Y%>");
5928 /* Returns TRUE iff the address of OP is value-dependent.
5930 14.6.2.4 [temp.dep.temp]:
5931 A non-integral non-type template-argument is dependent if its type is
5932 dependent or it has either of the following forms
5935 and contains a nested-name-specifier which specifies a class-name that
5936 names a dependent type.
5938 We generalize this to just say that the address of a member of a
5939 dependent class is value-dependent; the above doesn't cover the
5940 address of a static data member named with an unqualified-id. */
5943 has_value_dependent_address (tree op
)
5945 /* We could use get_inner_reference here, but there's no need;
5946 this is only relevant for template non-type arguments, which
5947 can only be expressed as &id-expression. */
5950 tree ctx
= CP_DECL_CONTEXT (op
);
5951 if (TYPE_P (ctx
) && dependent_type_p (ctx
))
5958 /* The next set of functions are used for providing helpful explanatory
5959 diagnostics for failed overload resolution. Their messages should be
5960 indented by two spaces for consistency with the messages in
5964 unify_success (bool /*explain_p*/)
5970 unify_parameter_deduction_failure (bool explain_p
, tree parm
)
5973 inform (input_location
,
5974 " couldn't deduce template parameter %qD", parm
);
5979 unify_invalid (bool /*explain_p*/)
5985 unify_cv_qual_mismatch (bool explain_p
, tree parm
, tree arg
)
5988 inform (input_location
,
5989 " types %qT and %qT have incompatible cv-qualifiers",
5995 unify_type_mismatch (bool explain_p
, tree parm
, tree arg
)
5998 inform (input_location
, " mismatched types %qT and %qT", parm
, arg
);
6003 unify_parameter_pack_mismatch (bool explain_p
, tree parm
, tree arg
)
6006 inform (input_location
,
6007 " template parameter %qD is not a parameter pack, but "
6014 unify_ptrmem_cst_mismatch (bool explain_p
, tree parm
, tree arg
)
6017 inform (input_location
,
6018 " template argument %qE does not match "
6019 "pointer-to-member constant %qE",
6025 unify_expression_unequal (bool explain_p
, tree parm
, tree arg
)
6028 inform (input_location
, " %qE is not equivalent to %qE", parm
, arg
);
6033 unify_parameter_pack_inconsistent (bool explain_p
, tree old_arg
, tree new_arg
)
6036 inform (input_location
,
6037 " inconsistent parameter pack deduction with %qT and %qT",
6043 unify_inconsistency (bool explain_p
, tree parm
, tree first
, tree second
)
6048 inform (input_location
,
6049 " deduced conflicting types for parameter %qT (%qT and %qT)",
6050 parm
, first
, second
);
6052 inform (input_location
,
6053 " deduced conflicting values for non-type parameter "
6054 "%qE (%qE and %qE)", parm
, first
, second
);
6060 unify_vla_arg (bool explain_p
, tree arg
)
6063 inform (input_location
,
6064 " variable-sized array type %qT is not "
6065 "a valid template argument",
6071 unify_method_type_error (bool explain_p
, tree arg
)
6074 inform (input_location
,
6075 " member function type %qT is not a valid template argument",
6081 unify_arity (bool explain_p
, int have
, int wanted
, bool least_p
= false)
6086 inform_n (input_location
, wanted
,
6087 " candidate expects at least %d argument, %d provided",
6088 " candidate expects at least %d arguments, %d provided",
6091 inform_n (input_location
, wanted
,
6092 " candidate expects %d argument, %d provided",
6093 " candidate expects %d arguments, %d provided",
6100 unify_too_many_arguments (bool explain_p
, int have
, int wanted
)
6102 return unify_arity (explain_p
, have
, wanted
);
6106 unify_too_few_arguments (bool explain_p
, int have
, int wanted
,
6107 bool least_p
= false)
6109 return unify_arity (explain_p
, have
, wanted
, least_p
);
6113 unify_arg_conversion (bool explain_p
, tree to_type
,
6114 tree from_type
, tree arg
)
6117 inform (EXPR_LOC_OR_LOC (arg
, input_location
),
6118 " cannot convert %qE (type %qT) to type %qT",
6119 arg
, from_type
, to_type
);
6124 unify_no_common_base (bool explain_p
, enum template_base_result r
,
6125 tree parm
, tree arg
)
6130 case tbr_ambiguous_baseclass
:
6131 inform (input_location
, " %qT is an ambiguous base class of %qT",
6135 inform (input_location
, " %qT is not derived from %qT", arg
, parm
);
6142 unify_inconsistent_template_template_parameters (bool explain_p
)
6145 inform (input_location
,
6146 " template parameters of a template template argument are "
6147 "inconsistent with other deduced template arguments");
6152 unify_template_deduction_failure (bool explain_p
, tree parm
, tree arg
)
6155 inform (input_location
,
6156 " can't deduce a template for %qT from non-template type %qT",
6162 unify_template_argument_mismatch (bool explain_p
, tree parm
, tree arg
)
6165 inform (input_location
,
6166 " template argument %qE does not match %qD", arg
, parm
);
6171 unify_overload_resolution_failure (bool explain_p
, tree arg
)
6174 inform (input_location
,
6175 " could not resolve address from overloaded function %qE",
6180 /* Attempt to convert the non-type template parameter EXPR to the
6181 indicated TYPE. If the conversion is successful, return the
6182 converted value. If the conversion is unsuccessful, return
6183 NULL_TREE if we issued an error message, or error_mark_node if we
6184 did not. We issue error messages for out-and-out bad template
6185 parameters, but not simply because the conversion failed, since we
6186 might be just trying to do argument deduction. Both TYPE and EXPR
6187 must be non-dependent.
6189 The conversion follows the special rules described in
6190 [temp.arg.nontype], and it is much more strict than an implicit
6193 This function is called twice for each template argument (see
6194 lookup_template_class for a more accurate description of this
6195 problem). This means that we need to handle expressions which
6196 are not valid in a C++ source, but can be created from the
6197 first call (for instance, casts to perform conversions). These
6198 hacks can go away after we fix the double coercion problem. */
6201 convert_nontype_argument (tree type
, tree expr
, tsubst_flags_t complain
)
6205 /* Detect immediately string literals as invalid non-type argument.
6206 This special-case is not needed for correctness (we would easily
6207 catch this later), but only to provide better diagnostic for this
6208 common user mistake. As suggested by DR 100, we do not mention
6209 linkage issues in the diagnostic as this is not the point. */
6210 /* FIXME we're making this OK. */
6211 if (TREE_CODE (expr
) == STRING_CST
)
6213 if (complain
& tf_error
)
6214 error ("%qE is not a valid template argument for type %qT "
6215 "because string literals can never be used in this context",
6220 /* Add the ADDR_EXPR now for the benefit of
6221 value_dependent_expression_p. */
6222 if (TYPE_PTROBV_P (type
)
6223 && TREE_CODE (TREE_TYPE (expr
)) == ARRAY_TYPE
)
6225 expr
= decay_conversion (expr
, complain
);
6226 if (expr
== error_mark_node
)
6227 return error_mark_node
;
6230 /* If we are in a template, EXPR may be non-dependent, but still
6231 have a syntactic, rather than semantic, form. For example, EXPR
6232 might be a SCOPE_REF, rather than the VAR_DECL to which the
6233 SCOPE_REF refers. Preserving the qualifying scope is necessary
6234 so that access checking can be performed when the template is
6235 instantiated -- but here we need the resolved form so that we can
6236 convert the argument. */
6237 bool non_dep
= false;
6238 if (TYPE_REF_OBJ_P (type
)
6239 && has_value_dependent_address (expr
))
6240 /* If we want the address and it's value-dependent, don't fold. */;
6241 else if (processing_template_decl
6242 && potential_nondependent_constant_expression (expr
))
6244 if (error_operand_p (expr
))
6245 return error_mark_node
;
6246 expr_type
= TREE_TYPE (expr
);
6247 if (TREE_CODE (type
) == REFERENCE_TYPE
)
6248 expr
= mark_lvalue_use (expr
);
6250 expr
= mark_rvalue_use (expr
);
6252 /* If the argument is non-dependent, perform any conversions in
6253 non-dependent context as well. */
6254 processing_template_decl_sentinel
s (non_dep
);
6256 expr
= instantiate_non_dependent_expr_internal (expr
, complain
);
6258 /* 14.3.2/5: The null pointer{,-to-member} conversion is applied
6259 to a non-type argument of "nullptr". */
6260 if (expr
== nullptr_node
&& TYPE_PTR_OR_PTRMEM_P (type
))
6261 expr
= fold_simple (convert (type
, expr
));
6263 /* In C++11, integral or enumeration non-type template arguments can be
6264 arbitrary constant expressions. Pointer and pointer to
6265 member arguments can be general constant expressions that evaluate
6266 to a null value, but otherwise still need to be of a specific form. */
6267 if (cxx_dialect
>= cxx11
)
6269 if (TREE_CODE (expr
) == PTRMEM_CST
)
6270 /* A PTRMEM_CST is already constant, and a valid template
6271 argument for a parameter of pointer to member type, we just want
6272 to leave it in that form rather than lower it to a
6274 else if (INTEGRAL_OR_ENUMERATION_TYPE_P (type
))
6275 expr
= maybe_constant_value (expr
);
6276 else if (cxx_dialect
>= cxx1z
)
6278 if (TREE_CODE (type
) != REFERENCE_TYPE
)
6279 expr
= maybe_constant_value (expr
);
6280 else if (REFERENCE_REF_P (expr
))
6282 expr
= TREE_OPERAND (expr
, 0);
6283 expr
= maybe_constant_value (expr
);
6284 expr
= convert_from_reference (expr
);
6287 else if (TYPE_PTR_OR_PTRMEM_P (type
))
6289 tree folded
= maybe_constant_value (expr
);
6290 if (TYPE_PTR_P (type
) ? integer_zerop (folded
)
6291 : null_member_pointer_value_p (folded
))
6296 /* HACK: Due to double coercion, we can get a
6297 NOP_EXPR<REFERENCE_TYPE>(ADDR_EXPR<POINTER_TYPE> (arg)) here,
6298 which is the tree that we built on the first call (see
6299 below when coercing to reference to object or to reference to
6300 function). We just strip everything and get to the arg.
6301 See g++.old-deja/g++.oliva/template4.C and g++.dg/template/nontype9.C
6303 if (TYPE_REF_OBJ_P (type
) || TYPE_REFFN_P (type
))
6305 tree probe_type
, probe
= expr
;
6306 if (REFERENCE_REF_P (probe
))
6307 probe
= TREE_OPERAND (probe
, 0);
6308 probe_type
= TREE_TYPE (probe
);
6309 if (TREE_CODE (probe
) == NOP_EXPR
)
6311 /* ??? Maybe we could use convert_from_reference here, but we
6312 would need to relax its constraints because the NOP_EXPR
6313 could actually change the type to something more cv-qualified,
6314 and this is not folded by convert_from_reference. */
6315 tree addr
= TREE_OPERAND (probe
, 0);
6316 if (TREE_CODE (probe_type
) == REFERENCE_TYPE
6317 && TREE_CODE (addr
) == ADDR_EXPR
6318 && TYPE_PTR_P (TREE_TYPE (addr
))
6319 && (same_type_ignoring_top_level_qualifiers_p
6320 (TREE_TYPE (probe_type
),
6321 TREE_TYPE (TREE_TYPE (addr
)))))
6323 expr
= TREE_OPERAND (addr
, 0);
6324 expr_type
= TREE_TYPE (probe_type
);
6329 /* We could also generate a NOP_EXPR(ADDR_EXPR()) when the
6330 parameter is a pointer to object, through decay and
6331 qualification conversion. Let's strip everything. */
6332 else if (TREE_CODE (expr
) == NOP_EXPR
&& TYPE_PTROBV_P (type
))
6336 if (TREE_CODE (probe
) == ADDR_EXPR
6337 && TYPE_PTR_P (TREE_TYPE (probe
)))
6339 /* Skip the ADDR_EXPR only if it is part of the decay for
6340 an array. Otherwise, it is part of the original argument
6341 in the source code. */
6342 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (probe
, 0))) == ARRAY_TYPE
)
6343 probe
= TREE_OPERAND (probe
, 0);
6345 expr_type
= TREE_TYPE (expr
);
6349 /* [temp.arg.nontype]/5, bullet 1
6351 For a non-type template-parameter of integral or enumeration type,
6352 integral promotions (_conv.prom_) and integral conversions
6353 (_conv.integral_) are applied. */
6354 if (INTEGRAL_OR_ENUMERATION_TYPE_P (type
))
6356 tree t
= build_integral_nontype_arg_conv (type
, expr
, complain
);
6357 t
= maybe_constant_value (t
);
6358 if (t
!= error_mark_node
)
6361 if (!same_type_ignoring_top_level_qualifiers_p (type
, TREE_TYPE (expr
)))
6362 return error_mark_node
;
6364 /* Notice that there are constant expressions like '4 % 0' which
6365 do not fold into integer constants. */
6366 if (TREE_CODE (expr
) != INTEGER_CST
)
6368 if (complain
& tf_error
)
6370 int errs
= errorcount
, warns
= warningcount
+ werrorcount
;
6371 if (processing_template_decl
6372 && !require_potential_constant_expression (expr
))
6374 expr
= cxx_constant_value (expr
);
6375 if (errorcount
> errs
|| warningcount
+ werrorcount
> warns
)
6376 inform (EXPR_LOC_OR_LOC (expr
, input_location
),
6377 "in template argument for type %qT ", type
);
6378 if (expr
== error_mark_node
)
6380 /* else cxx_constant_value complained but gave us
6381 a real constant, so go ahead. */
6382 gcc_assert (TREE_CODE (expr
) == INTEGER_CST
);
6388 /* Avoid typedef problems. */
6389 if (TREE_TYPE (expr
) != type
)
6390 expr
= fold_convert (type
, expr
);
6392 /* [temp.arg.nontype]/5, bullet 2
6394 For a non-type template-parameter of type pointer to object,
6395 qualification conversions (_conv.qual_) and the array-to-pointer
6396 conversion (_conv.array_) are applied. */
6397 else if (TYPE_PTROBV_P (type
))
6399 /* [temp.arg.nontype]/1 (TC1 version, DR 49):
6401 A template-argument for a non-type, non-template template-parameter
6402 shall be one of: [...]
6404 -- the name of a non-type template-parameter;
6405 -- the address of an object or function with external linkage, [...]
6406 expressed as "& id-expression" where the & is optional if the name
6407 refers to a function or array, or if the corresponding
6408 template-parameter is a reference.
6410 Here, we do not care about functions, as they are invalid anyway
6411 for a parameter of type pointer-to-object. */
6413 if (DECL_P (expr
) && DECL_TEMPLATE_PARM_P (expr
))
6414 /* Non-type template parameters are OK. */
6416 else if (cxx_dialect
>= cxx11
&& integer_zerop (expr
))
6417 /* Null pointer values are OK in C++11. */;
6418 else if (TREE_CODE (expr
) != ADDR_EXPR
6419 && TREE_CODE (expr_type
) != ARRAY_TYPE
)
6423 if (complain
& tf_error
)
6424 error ("%qD is not a valid template argument "
6425 "because %qD is a variable, not the address of "
6426 "a variable", expr
, expr
);
6429 if (POINTER_TYPE_P (expr_type
))
6431 if (complain
& tf_error
)
6432 error ("%qE is not a valid template argument for %qT "
6433 "because it is not the address of a variable",
6437 /* Other values, like integer constants, might be valid
6438 non-type arguments of some other type. */
6439 return error_mark_node
;
6445 decl
= ((TREE_CODE (expr
) == ADDR_EXPR
)
6446 ? TREE_OPERAND (expr
, 0) : expr
);
6449 if (complain
& tf_error
)
6450 error ("%qE is not a valid template argument of type %qT "
6451 "because %qE is not a variable", expr
, type
, decl
);
6454 else if (cxx_dialect
< cxx11
&& !DECL_EXTERNAL_LINKAGE_P (decl
))
6456 if (complain
& tf_error
)
6457 error ("%qE is not a valid template argument of type %qT "
6458 "because %qD does not have external linkage",
6462 else if (cxx_dialect
>= cxx11
&& decl_linkage (decl
) == lk_none
)
6464 if (complain
& tf_error
)
6465 error ("%qE is not a valid template argument of type %qT "
6466 "because %qD has no linkage", expr
, type
, decl
);
6471 expr
= decay_conversion (expr
, complain
);
6472 if (expr
== error_mark_node
)
6473 return error_mark_node
;
6475 expr
= perform_qualification_conversions (type
, expr
);
6476 if (expr
== error_mark_node
)
6477 return error_mark_node
;
6479 /* [temp.arg.nontype]/5, bullet 3
6481 For a non-type template-parameter of type reference to object, no
6482 conversions apply. The type referred to by the reference may be more
6483 cv-qualified than the (otherwise identical) type of the
6484 template-argument. The template-parameter is bound directly to the
6485 template-argument, which must be an lvalue. */
6486 else if (TYPE_REF_OBJ_P (type
))
6488 if (!same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (type
),
6490 return error_mark_node
;
6492 if (!at_least_as_qualified_p (TREE_TYPE (type
), expr_type
))
6494 if (complain
& tf_error
)
6495 error ("%qE is not a valid template argument for type %qT "
6496 "because of conflicts in cv-qualification", expr
, type
);
6500 if (!real_lvalue_p (expr
))
6502 if (complain
& tf_error
)
6503 error ("%qE is not a valid template argument for type %qT "
6504 "because it is not an lvalue", expr
, type
);
6508 /* [temp.arg.nontype]/1
6510 A template-argument for a non-type, non-template template-parameter
6511 shall be one of: [...]
6513 -- the address of an object or function with external linkage. */
6514 if (INDIRECT_REF_P (expr
)
6515 && TYPE_REF_OBJ_P (TREE_TYPE (TREE_OPERAND (expr
, 0))))
6517 expr
= TREE_OPERAND (expr
, 0);
6520 if (complain
& tf_error
)
6521 error ("%q#D is not a valid template argument for type %qT "
6522 "because a reference variable does not have a constant "
6523 "address", expr
, type
);
6530 if (complain
& tf_error
)
6531 error ("%qE is not a valid template argument for type %qT "
6532 "because it is not an object with linkage",
6537 /* DR 1155 allows internal linkage in C++11 and up. */
6538 linkage_kind linkage
= decl_linkage (expr
);
6539 if (linkage
< (cxx_dialect
>= cxx11
? lk_internal
: lk_external
))
6541 if (complain
& tf_error
)
6542 error ("%qE is not a valid template argument for type %qT "
6543 "because object %qD does not have linkage",
6548 expr
= build_nop (type
, build_address (expr
));
6550 /* [temp.arg.nontype]/5, bullet 4
6552 For a non-type template-parameter of type pointer to function, only
6553 the function-to-pointer conversion (_conv.func_) is applied. If the
6554 template-argument represents a set of overloaded functions (or a
6555 pointer to such), the matching function is selected from the set
6557 else if (TYPE_PTRFN_P (type
))
6559 /* If the argument is a template-id, we might not have enough
6560 context information to decay the pointer. */
6561 if (!type_unknown_p (expr_type
))
6563 expr
= decay_conversion (expr
, complain
);
6564 if (expr
== error_mark_node
)
6565 return error_mark_node
;
6568 if (cxx_dialect
>= cxx11
&& integer_zerop (expr
))
6569 /* Null pointer values are OK in C++11. */
6570 return perform_qualification_conversions (type
, expr
);
6572 expr
= convert_nontype_argument_function (type
, expr
, complain
);
6573 if (!expr
|| expr
== error_mark_node
)
6576 /* [temp.arg.nontype]/5, bullet 5
6578 For a non-type template-parameter of type reference to function, no
6579 conversions apply. If the template-argument represents a set of
6580 overloaded functions, the matching function is selected from the set
6582 else if (TYPE_REFFN_P (type
))
6584 if (TREE_CODE (expr
) == ADDR_EXPR
)
6586 if (complain
& tf_error
)
6588 error ("%qE is not a valid template argument for type %qT "
6589 "because it is a pointer", expr
, type
);
6590 inform (input_location
, "try using %qE instead",
6591 TREE_OPERAND (expr
, 0));
6596 expr
= convert_nontype_argument_function (type
, expr
, complain
);
6597 if (!expr
|| expr
== error_mark_node
)
6600 expr
= build_nop (type
, build_address (expr
));
6602 /* [temp.arg.nontype]/5, bullet 6
6604 For a non-type template-parameter of type pointer to member function,
6605 no conversions apply. If the template-argument represents a set of
6606 overloaded member functions, the matching member function is selected
6607 from the set (_over.over_). */
6608 else if (TYPE_PTRMEMFUNC_P (type
))
6610 expr
= instantiate_type (type
, expr
, tf_none
);
6611 if (expr
== error_mark_node
)
6612 return error_mark_node
;
6614 /* [temp.arg.nontype] bullet 1 says the pointer to member
6615 expression must be a pointer-to-member constant. */
6616 if (!check_valid_ptrmem_cst_expr (type
, expr
, complain
))
6617 return error_mark_node
;
6619 /* There is no way to disable standard conversions in
6620 resolve_address_of_overloaded_function (called by
6621 instantiate_type). It is possible that the call succeeded by
6622 converting &B::I to &D::I (where B is a base of D), so we need
6623 to reject this conversion here.
6625 Actually, even if there was a way to disable standard conversions,
6626 it would still be better to reject them here so that we can
6627 provide a superior diagnostic. */
6628 if (!same_type_p (TREE_TYPE (expr
), type
))
6630 if (complain
& tf_error
)
6632 error ("%qE is not a valid template argument for type %qT "
6633 "because it is of type %qT", expr
, type
,
6635 /* If we are just one standard conversion off, explain. */
6636 if (can_convert_standard (type
, TREE_TYPE (expr
), complain
))
6637 inform (input_location
,
6638 "standard conversions are not allowed in this context");
6643 /* [temp.arg.nontype]/5, bullet 7
6645 For a non-type template-parameter of type pointer to data member,
6646 qualification conversions (_conv.qual_) are applied. */
6647 else if (TYPE_PTRDATAMEM_P (type
))
6649 /* [temp.arg.nontype] bullet 1 says the pointer to member
6650 expression must be a pointer-to-member constant. */
6651 if (!check_valid_ptrmem_cst_expr (type
, expr
, complain
))
6652 return error_mark_node
;
6654 expr
= perform_qualification_conversions (type
, expr
);
6655 if (expr
== error_mark_node
)
6658 else if (NULLPTR_TYPE_P (type
))
6660 if (expr
!= nullptr_node
)
6662 if (complain
& tf_error
)
6663 error ("%qE is not a valid template argument for type %qT "
6664 "because it is of type %qT", expr
, type
, TREE_TYPE (expr
));
6669 /* A template non-type parameter must be one of the above. */
6673 /* Sanity check: did we actually convert the argument to the
6675 gcc_assert (same_type_ignoring_top_level_qualifiers_p
6676 (type
, TREE_TYPE (expr
)));
6677 return convert_from_reference (expr
);
6680 /* Subroutine of coerce_template_template_parms, which returns 1 if
6681 PARM_PARM and ARG_PARM match using the rule for the template
6682 parameters of template template parameters. Both PARM and ARG are
6683 template parameters; the rest of the arguments are the same as for
6684 coerce_template_template_parms.
6687 coerce_template_template_parm (tree parm
,
6689 tsubst_flags_t complain
,
6693 if (arg
== NULL_TREE
|| error_operand_p (arg
)
6694 || parm
== NULL_TREE
|| error_operand_p (parm
))
6697 if (TREE_CODE (arg
) != TREE_CODE (parm
))
6700 switch (TREE_CODE (parm
))
6703 /* We encounter instantiations of templates like
6704 template <template <template <class> class> class TT>
6707 tree parmparm
= DECL_INNERMOST_TEMPLATE_PARMS (parm
);
6708 tree argparm
= DECL_INNERMOST_TEMPLATE_PARMS (arg
);
6710 if (!coerce_template_template_parms
6711 (parmparm
, argparm
, complain
, in_decl
, outer_args
))
6717 if (TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (arg
))
6718 && !TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (parm
)))
6719 /* Argument is a parameter pack but parameter is not. */
6724 /* The tsubst call is used to handle cases such as
6726 template <int> class C {};
6727 template <class T, template <T> class TT> class D {};
6730 i.e. the parameter list of TT depends on earlier parameters. */
6731 if (!uses_template_parms (TREE_TYPE (arg
)))
6733 tree t
= tsubst (TREE_TYPE (parm
), outer_args
, complain
, in_decl
);
6734 if (!uses_template_parms (t
)
6735 && !same_type_p (t
, TREE_TYPE (arg
)))
6739 if (TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (arg
))
6740 && !TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm
)))
6741 /* Argument is a parameter pack but parameter is not. */
6754 /* Return 1 if PARM_PARMS and ARG_PARMS matches using rule for
6755 template template parameters. Both PARM_PARMS and ARG_PARMS are
6756 vectors of TREE_LIST nodes containing TYPE_DECL, TEMPLATE_DECL
6759 Consider the example:
6760 template <class T> class A;
6761 template<template <class U> class TT> class B;
6763 For B<A>, PARM_PARMS are the parameters to TT, while ARG_PARMS are
6764 the parameters to A, and OUTER_ARGS contains A. */
6767 coerce_template_template_parms (tree parm_parms
,
6769 tsubst_flags_t complain
,
6773 int nparms
, nargs
, i
;
6777 gcc_assert (TREE_CODE (parm_parms
) == TREE_VEC
);
6778 gcc_assert (TREE_CODE (arg_parms
) == TREE_VEC
);
6780 nparms
= TREE_VEC_LENGTH (parm_parms
);
6781 nargs
= TREE_VEC_LENGTH (arg_parms
);
6783 /* Determine whether we have a parameter pack at the end of the
6784 template template parameter's template parameter list. */
6785 if (TREE_VEC_ELT (parm_parms
, nparms
- 1) != error_mark_node
)
6787 parm
= TREE_VALUE (TREE_VEC_ELT (parm_parms
, nparms
- 1));
6789 if (error_operand_p (parm
))
6792 switch (TREE_CODE (parm
))
6796 if (TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (parm
)))
6801 if (TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm
)))
6811 && !(variadic_p
&& nargs
>= nparms
- 1))
6814 /* Check all of the template parameters except the parameter pack at
6815 the end (if any). */
6816 for (i
= 0; i
< nparms
- variadic_p
; ++i
)
6818 if (TREE_VEC_ELT (parm_parms
, i
) == error_mark_node
6819 || TREE_VEC_ELT (arg_parms
, i
) == error_mark_node
)
6822 parm
= TREE_VALUE (TREE_VEC_ELT (parm_parms
, i
));
6823 arg
= TREE_VALUE (TREE_VEC_ELT (arg_parms
, i
));
6825 if (!coerce_template_template_parm (parm
, arg
, complain
, in_decl
,
6833 /* Check each of the template parameters in the template
6834 argument against the template parameter pack at the end of
6835 the template template parameter. */
6836 if (TREE_VEC_ELT (parm_parms
, i
) == error_mark_node
)
6839 parm
= TREE_VALUE (TREE_VEC_ELT (parm_parms
, i
));
6841 for (; i
< nargs
; ++i
)
6843 if (TREE_VEC_ELT (arg_parms
, i
) == error_mark_node
)
6846 arg
= TREE_VALUE (TREE_VEC_ELT (arg_parms
, i
));
6848 if (!coerce_template_template_parm (parm
, arg
, complain
, in_decl
,
6857 /* Verifies that the deduced template arguments (in TARGS) for the
6858 template template parameters (in TPARMS) represent valid bindings,
6859 by comparing the template parameter list of each template argument
6860 to the template parameter list of its corresponding template
6861 template parameter, in accordance with DR150. This
6862 routine can only be called after all template arguments have been
6863 deduced. It will return TRUE if all of the template template
6864 parameter bindings are okay, FALSE otherwise. */
6866 template_template_parm_bindings_ok_p (tree tparms
, tree targs
)
6868 int i
, ntparms
= TREE_VEC_LENGTH (tparms
);
6871 /* We're dealing with template parms in this process. */
6872 ++processing_template_decl
;
6874 targs
= INNERMOST_TEMPLATE_ARGS (targs
);
6876 for (i
= 0; i
< ntparms
; ++i
)
6878 tree tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, i
));
6879 tree targ
= TREE_VEC_ELT (targs
, i
);
6881 if (TREE_CODE (tparm
) == TEMPLATE_DECL
&& targ
)
6883 tree packed_args
= NULL_TREE
;
6886 if (ARGUMENT_PACK_P (targ
))
6888 /* Look inside the argument pack. */
6889 packed_args
= ARGUMENT_PACK_ARGS (targ
);
6890 len
= TREE_VEC_LENGTH (packed_args
);
6893 for (idx
= 0; idx
< len
; ++idx
)
6895 tree targ_parms
= NULL_TREE
;
6898 /* Extract the next argument from the argument
6900 targ
= TREE_VEC_ELT (packed_args
, idx
);
6902 if (PACK_EXPANSION_P (targ
))
6903 /* Look at the pattern of the pack expansion. */
6904 targ
= PACK_EXPANSION_PATTERN (targ
);
6906 /* Extract the template parameters from the template
6908 if (TREE_CODE (targ
) == TEMPLATE_DECL
)
6909 targ_parms
= DECL_INNERMOST_TEMPLATE_PARMS (targ
);
6910 else if (TREE_CODE (targ
) == TEMPLATE_TEMPLATE_PARM
)
6911 targ_parms
= DECL_INNERMOST_TEMPLATE_PARMS (TYPE_NAME (targ
));
6913 /* Verify that we can coerce the template template
6914 parameters from the template argument to the template
6915 parameter. This requires an exact match. */
6917 && !coerce_template_template_parms
6918 (DECL_INNERMOST_TEMPLATE_PARMS (tparm
),
6933 --processing_template_decl
;
6937 /* Since type attributes aren't mangled, we need to strip them from
6938 template type arguments. */
6941 canonicalize_type_argument (tree arg
, tsubst_flags_t complain
)
6943 if (!arg
|| arg
== error_mark_node
|| arg
== TYPE_CANONICAL (arg
))
6945 bool removed_attributes
= false;
6946 tree canon
= strip_typedefs (arg
, &removed_attributes
);
6947 if (removed_attributes
6948 && (complain
& tf_warning
))
6949 warning (OPT_Wignored_attributes
,
6950 "ignoring attributes on template argument %qT", arg
);
6954 // A template declaration can be substituted for a constrained
6955 // template template parameter only when the argument is more
6956 // constrained than the parameter.
6958 is_compatible_template_arg (tree parm
, tree arg
)
6960 tree parm_cons
= get_constraints (parm
);
6962 /* For now, allow constrained template template arguments
6963 and unconstrained template template parameters. */
6964 if (parm_cons
== NULL_TREE
)
6967 tree arg_cons
= get_constraints (arg
);
6969 // If the template parameter is constrained, we need to rewrite its
6970 // constraints in terms of the ARG's template parameters. This ensures
6971 // that all of the template parameter types will have the same depth.
6973 // Note that this is only valid when coerce_template_template_parm is
6974 // true for the innermost template parameters of PARM and ARG. In other
6975 // words, because coercion is successful, this conversion will be valid.
6978 tree args
= template_parms_to_args (DECL_TEMPLATE_PARMS (arg
));
6979 parm_cons
= tsubst_constraint_info (parm_cons
,
6980 INNERMOST_TEMPLATE_ARGS (args
),
6981 tf_none
, NULL_TREE
);
6982 if (parm_cons
== error_mark_node
)
6986 return subsumes (parm_cons
, arg_cons
);
6989 // Convert a placeholder argument into a binding to the original
6990 // parameter. The original parameter is saved as the TREE_TYPE of
6993 convert_wildcard_argument (tree parm
, tree arg
)
6995 TREE_TYPE (arg
) = parm
;
6999 /* Convert the indicated template ARG as necessary to match the
7000 indicated template PARM. Returns the converted ARG, or
7001 error_mark_node if the conversion was unsuccessful. Error and
7002 warning messages are issued under control of COMPLAIN. This
7003 conversion is for the Ith parameter in the parameter list. ARGS is
7004 the full set of template arguments deduced so far. */
7007 convert_template_argument (tree parm
,
7010 tsubst_flags_t complain
,
7016 int is_type
, requires_type
, is_tmpl_type
, requires_tmpl_type
;
7018 if (parm
== error_mark_node
)
7019 return error_mark_node
;
7021 /* Trivially convert placeholders. */
7022 if (TREE_CODE (arg
) == WILDCARD_DECL
)
7023 return convert_wildcard_argument (parm
, arg
);
7025 if (TREE_CODE (arg
) == TREE_LIST
7026 && TREE_CODE (TREE_VALUE (arg
)) == OFFSET_REF
)
7028 /* The template argument was the name of some
7029 member function. That's usually
7030 invalid, but static members are OK. In any
7031 case, grab the underlying fields/functions
7032 and issue an error later if required. */
7033 orig_arg
= TREE_VALUE (arg
);
7034 TREE_TYPE (arg
) = unknown_type_node
;
7039 requires_tmpl_type
= TREE_CODE (parm
) == TEMPLATE_DECL
;
7040 requires_type
= (TREE_CODE (parm
) == TYPE_DECL
7041 || requires_tmpl_type
);
7043 /* When determining whether an argument pack expansion is a template,
7044 look at the pattern. */
7045 if (TREE_CODE (arg
) == TYPE_PACK_EXPANSION
)
7046 arg
= PACK_EXPANSION_PATTERN (arg
);
7048 /* Deal with an injected-class-name used as a template template arg. */
7049 if (requires_tmpl_type
&& CLASS_TYPE_P (arg
))
7051 tree t
= maybe_get_template_decl_from_type_decl (TYPE_NAME (arg
));
7052 if (TREE_CODE (t
) == TEMPLATE_DECL
)
7054 if (cxx_dialect
>= cxx11
)
7055 /* OK under DR 1004. */;
7056 else if (complain
& tf_warning_or_error
)
7057 pedwarn (input_location
, OPT_Wpedantic
, "injected-class-name %qD"
7058 " used as template template argument", TYPE_NAME (arg
));
7059 else if (flag_pedantic_errors
)
7067 ((TREE_CODE (arg
) == TEMPLATE_DECL
7068 && TREE_CODE (DECL_TEMPLATE_RESULT (arg
)) == TYPE_DECL
)
7069 || (requires_tmpl_type
&& TREE_CODE (arg
) == TYPE_ARGUMENT_PACK
)
7070 || TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
7071 || TREE_CODE (arg
) == UNBOUND_CLASS_TEMPLATE
);
7074 && (TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
7075 || TREE_CODE (arg
) == UNBOUND_CLASS_TEMPLATE
))
7076 arg
= TYPE_STUB_DECL (arg
);
7078 is_type
= TYPE_P (arg
) || is_tmpl_type
;
7080 if (requires_type
&& ! is_type
&& TREE_CODE (arg
) == SCOPE_REF
7081 && TREE_CODE (TREE_OPERAND (arg
, 0)) == TEMPLATE_TYPE_PARM
)
7083 if (TREE_CODE (TREE_OPERAND (arg
, 1)) == BIT_NOT_EXPR
)
7085 if (complain
& tf_error
)
7086 error ("invalid use of destructor %qE as a type", orig_arg
);
7087 return error_mark_node
;
7090 permerror (input_location
,
7091 "to refer to a type member of a template parameter, "
7092 "use %<typename %E%>", orig_arg
);
7094 orig_arg
= make_typename_type (TREE_OPERAND (arg
, 0),
7095 TREE_OPERAND (arg
, 1),
7101 if (is_type
!= requires_type
)
7105 if (complain
& tf_error
)
7107 error ("type/value mismatch at argument %d in template "
7108 "parameter list for %qD",
7111 inform (input_location
,
7112 " expected a constant of type %qT, got %qT",
7114 (DECL_P (arg
) ? DECL_NAME (arg
) : orig_arg
));
7115 else if (requires_tmpl_type
)
7116 inform (input_location
,
7117 " expected a class template, got %qE", orig_arg
);
7119 inform (input_location
,
7120 " expected a type, got %qE", orig_arg
);
7123 return error_mark_node
;
7125 if (is_tmpl_type
^ requires_tmpl_type
)
7127 if (in_decl
&& (complain
& tf_error
))
7129 error ("type/value mismatch at argument %d in template "
7130 "parameter list for %qD",
7133 inform (input_location
,
7134 " expected a type, got %qT", DECL_NAME (arg
));
7136 inform (input_location
,
7137 " expected a class template, got %qT", orig_arg
);
7139 return error_mark_node
;
7144 if (requires_tmpl_type
)
7146 if (template_parameter_pack_p (parm
) && ARGUMENT_PACK_P (orig_arg
))
7148 else if (TREE_CODE (TREE_TYPE (arg
)) == UNBOUND_CLASS_TEMPLATE
)
7149 /* The number of argument required is not known yet.
7150 Just accept it for now. */
7151 val
= TREE_TYPE (arg
);
7154 tree parmparm
= DECL_INNERMOST_TEMPLATE_PARMS (parm
);
7157 /* Strip alias templates that are equivalent to another
7159 arg
= get_underlying_template (arg
);
7160 argparm
= DECL_INNERMOST_TEMPLATE_PARMS (arg
);
7162 if (coerce_template_template_parms (parmparm
, argparm
,
7168 /* TEMPLATE_TEMPLATE_PARM node is preferred over
7170 if (val
!= error_mark_node
)
7172 if (DECL_TEMPLATE_TEMPLATE_PARM_P (val
))
7173 val
= TREE_TYPE (val
);
7174 if (TREE_CODE (orig_arg
) == TYPE_PACK_EXPANSION
)
7175 val
= make_pack_expansion (val
);
7180 if (in_decl
&& (complain
& tf_error
))
7182 error ("type/value mismatch at argument %d in "
7183 "template parameter list for %qD",
7185 inform (input_location
,
7186 " expected a template of type %qD, got %qT",
7190 val
= error_mark_node
;
7193 // Check that the constraints are compatible before allowing the
7195 if (val
!= error_mark_node
)
7196 if (!is_compatible_template_arg (parm
, arg
))
7198 if (in_decl
&& (complain
& tf_error
))
7200 error ("constraint mismatch at argument %d in "
7201 "template parameter list for %qD",
7203 inform (input_location
, " expected %qD but got %qD",
7206 val
= error_mark_node
;
7212 /* We only form one instance of each template specialization.
7213 Therefore, if we use a non-canonical variant (i.e., a
7214 typedef), any future messages referring to the type will use
7215 the typedef, which is confusing if those future uses do not
7216 themselves also use the typedef. */
7218 val
= canonicalize_type_argument (val
, complain
);
7222 tree t
= tsubst (TREE_TYPE (parm
), args
, complain
, in_decl
);
7224 if (invalid_nontype_parm_type_p (t
, complain
))
7225 return error_mark_node
;
7227 if (template_parameter_pack_p (parm
) && ARGUMENT_PACK_P (orig_arg
))
7229 if (same_type_p (t
, TREE_TYPE (orig_arg
)))
7233 /* Not sure if this is reachable, but it doesn't hurt
7235 error ("type mismatch in nontype parameter pack");
7236 val
= error_mark_node
;
7239 else if (!dependent_template_arg_p (orig_arg
)
7240 && !uses_template_parms (t
))
7241 /* We used to call digest_init here. However, digest_init
7242 will report errors, which we don't want when complain
7243 is zero. More importantly, digest_init will try too
7244 hard to convert things: for example, `0' should not be
7245 converted to pointer type at this point according to
7246 the standard. Accepting this is not merely an
7247 extension, since deciding whether or not these
7248 conversions can occur is part of determining which
7249 function template to call, or whether a given explicit
7250 argument specification is valid. */
7251 val
= convert_nontype_argument (t
, orig_arg
, complain
);
7254 bool removed_attr
= false;
7255 val
= strip_typedefs_expr (orig_arg
, &removed_attr
);
7258 if (val
== NULL_TREE
)
7259 val
= error_mark_node
;
7260 else if (val
== error_mark_node
&& (complain
& tf_error
))
7261 error ("could not convert template argument %qE to %qT", orig_arg
, t
);
7263 if (INDIRECT_REF_P (val
))
7265 /* Reject template arguments that are references to built-in
7266 functions with no library fallbacks. */
7267 const_tree inner
= TREE_OPERAND (val
, 0);
7268 if (TREE_CODE (TREE_TYPE (inner
)) == REFERENCE_TYPE
7269 && TREE_CODE (TREE_TYPE (TREE_TYPE (inner
))) == FUNCTION_TYPE
7270 && TREE_CODE (TREE_TYPE (inner
)) == REFERENCE_TYPE
7271 && 0 < TREE_OPERAND_LENGTH (inner
)
7272 && reject_gcc_builtin (TREE_OPERAND (inner
, 0)))
7273 return error_mark_node
;
7276 if (TREE_CODE (val
) == SCOPE_REF
)
7278 /* Strip typedefs from the SCOPE_REF. */
7279 tree type
= canonicalize_type_argument (TREE_TYPE (val
), complain
);
7280 tree scope
= canonicalize_type_argument (TREE_OPERAND (val
, 0),
7282 val
= build_qualified_name (type
, scope
, TREE_OPERAND (val
, 1),
7283 QUALIFIED_NAME_IS_TEMPLATE (val
));
7290 /* Coerces the remaining template arguments in INNER_ARGS (from
7291 ARG_IDX to the end) into the parameter pack at PARM_IDX in PARMS.
7292 Returns the coerced argument pack. PARM_IDX is the position of this
7293 parameter in the template parameter list. ARGS is the original
7294 template argument list. */
7296 coerce_template_parameter_pack (tree parms
,
7304 tsubst_flags_t complain
)
7306 tree parm
= TREE_VEC_ELT (parms
, parm_idx
);
7307 int nargs
= inner_args
? NUM_TMPL_ARGS (inner_args
) : 0;
7310 tree packed_parms
= NULL_TREE
;
7312 if (arg_idx
> nargs
)
7315 if (tree packs
= fixed_parameter_pack_p (TREE_VALUE (parm
)))
7317 /* When the template parameter is a non-type template parameter pack
7318 or template template parameter pack whose type or template
7319 parameters use parameter packs, we know exactly how many arguments
7320 we are looking for. Build a vector of the instantiated decls for
7321 these template parameters in PACKED_PARMS. */
7322 /* We can't use make_pack_expansion here because it would interpret a
7323 _DECL as a use rather than a declaration. */
7324 tree decl
= TREE_VALUE (parm
);
7325 tree exp
= cxx_make_type (TYPE_PACK_EXPANSION
);
7326 SET_PACK_EXPANSION_PATTERN (exp
, decl
);
7327 PACK_EXPANSION_PARAMETER_PACKS (exp
) = packs
;
7328 SET_TYPE_STRUCTURAL_EQUALITY (exp
);
7330 TREE_VEC_LENGTH (args
)--;
7331 packed_parms
= tsubst_pack_expansion (exp
, args
, complain
, decl
);
7332 TREE_VEC_LENGTH (args
)++;
7334 if (packed_parms
== error_mark_node
)
7335 return error_mark_node
;
7337 /* If we're doing a partial instantiation of a member template,
7338 verify that all of the types used for the non-type
7339 template parameter pack are, in fact, valid for non-type
7340 template parameters. */
7342 && PACK_EXPANSION_P (TREE_VEC_ELT (inner_args
, arg_idx
)))
7344 int j
, len
= TREE_VEC_LENGTH (packed_parms
);
7345 for (j
= 0; j
< len
; ++j
)
7347 tree t
= TREE_TYPE (TREE_VEC_ELT (packed_parms
, j
));
7348 if (invalid_nontype_parm_type_p (t
, complain
))
7349 return error_mark_node
;
7351 /* We don't know how many args we have yet, just
7352 use the unconverted ones for now. */
7356 packed_args
= make_tree_vec (TREE_VEC_LENGTH (packed_parms
));
7358 /* Check if we have a placeholder pack, which indicates we're
7359 in the context of a introduction list. In that case we want
7360 to match this pack to the single placeholder. */
7361 else if (arg_idx
< nargs
7362 && TREE_CODE (TREE_VEC_ELT (inner_args
, arg_idx
)) == WILDCARD_DECL
7363 && WILDCARD_PACK_P (TREE_VEC_ELT (inner_args
, arg_idx
)))
7365 nargs
= arg_idx
+ 1;
7366 packed_args
= make_tree_vec (1);
7369 packed_args
= make_tree_vec (nargs
- arg_idx
);
7371 /* Convert the remaining arguments, which will be a part of the
7372 parameter pack "parm". */
7373 for (; arg_idx
< nargs
; ++arg_idx
)
7375 tree arg
= TREE_VEC_ELT (inner_args
, arg_idx
);
7376 tree actual_parm
= TREE_VALUE (parm
);
7377 int pack_idx
= arg_idx
- parm_idx
;
7381 /* Once we've packed as many args as we have types, stop. */
7382 if (pack_idx
>= TREE_VEC_LENGTH (packed_parms
))
7384 else if (PACK_EXPANSION_P (arg
))
7385 /* We don't know how many args we have yet, just
7386 use the unconverted ones for now. */
7389 actual_parm
= TREE_VEC_ELT (packed_parms
, pack_idx
);
7392 if (arg
== error_mark_node
)
7394 if (complain
& tf_error
)
7395 error ("template argument %d is invalid", arg_idx
+ 1);
7398 arg
= convert_template_argument (actual_parm
,
7399 arg
, new_args
, complain
, parm_idx
,
7401 if (arg
== error_mark_node
)
7403 TREE_VEC_ELT (packed_args
, pack_idx
) = arg
;
7406 if (arg_idx
- parm_idx
< TREE_VEC_LENGTH (packed_args
)
7407 && TREE_VEC_LENGTH (packed_args
) > 0)
7409 if (complain
& tf_error
)
7410 error ("wrong number of template arguments (%d, should be %d)",
7411 arg_idx
- parm_idx
, TREE_VEC_LENGTH (packed_args
));
7412 return error_mark_node
;
7415 if (TREE_CODE (TREE_VALUE (parm
)) == TYPE_DECL
7416 || TREE_CODE (TREE_VALUE (parm
)) == TEMPLATE_DECL
)
7417 argument_pack
= cxx_make_type (TYPE_ARGUMENT_PACK
);
7420 argument_pack
= make_node (NONTYPE_ARGUMENT_PACK
);
7421 TREE_TYPE (argument_pack
)
7422 = tsubst (TREE_TYPE (TREE_VALUE (parm
)), new_args
, complain
, in_decl
);
7423 TREE_CONSTANT (argument_pack
) = 1;
7426 SET_ARGUMENT_PACK_ARGS (argument_pack
, packed_args
);
7428 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (packed_args
,
7429 TREE_VEC_LENGTH (packed_args
));
7430 return argument_pack
;
7433 /* Returns the number of pack expansions in the template argument vector
7437 pack_expansion_args_count (tree args
)
7442 for (i
= 0; i
< TREE_VEC_LENGTH (args
); ++i
)
7444 tree elt
= TREE_VEC_ELT (args
, i
);
7445 if (elt
&& PACK_EXPANSION_P (elt
))
7451 /* Convert all template arguments to their appropriate types, and
7452 return a vector containing the innermost resulting template
7453 arguments. If any error occurs, return error_mark_node. Error and
7454 warning messages are issued under control of COMPLAIN.
7456 If REQUIRE_ALL_ARGS is false, argument deduction will be performed
7457 for arguments not specified in ARGS. Otherwise, if
7458 USE_DEFAULT_ARGS is true, default arguments will be used to fill in
7459 unspecified arguments. If REQUIRE_ALL_ARGS is true, but
7460 USE_DEFAULT_ARGS is false, then all arguments must be specified in
7464 coerce_template_parms (tree parms
,
7467 tsubst_flags_t complain
,
7468 bool require_all_args
,
7469 bool use_default_args
)
7471 int nparms
, nargs
, parm_idx
, arg_idx
, lost
= 0;
7472 tree orig_inner_args
;
7475 tree new_inner_args
;
7476 int saved_unevaluated_operand
;
7477 int saved_inhibit_evaluation_warnings
;
7479 /* When used as a boolean value, indicates whether this is a
7480 variadic template parameter list. Since it's an int, we can also
7481 subtract it from nparms to get the number of non-variadic
7484 int variadic_args_p
= 0;
7485 int post_variadic_parms
= 0;
7487 /* Likewise for parameters with default arguments. */
7490 if (args
== error_mark_node
)
7491 return error_mark_node
;
7493 nparms
= TREE_VEC_LENGTH (parms
);
7495 /* Determine if there are any parameter packs or default arguments. */
7496 for (parm_idx
= 0; parm_idx
< nparms
; ++parm_idx
)
7498 tree parm
= TREE_VEC_ELT (parms
, parm_idx
);
7500 ++post_variadic_parms
;
7501 if (template_parameter_pack_p (TREE_VALUE (parm
)))
7503 if (TREE_PURPOSE (parm
))
7507 inner_args
= orig_inner_args
= INNERMOST_TEMPLATE_ARGS (args
);
7508 /* If there are no parameters that follow a parameter pack, we need to
7509 expand any argument packs so that we can deduce a parameter pack from
7510 some non-packed args followed by an argument pack, as in variadic85.C.
7511 If there are such parameters, we need to leave argument packs intact
7512 so the arguments are assigned properly. This can happen when dealing
7513 with a nested class inside a partial specialization of a class
7514 template, as in variadic92.C, or when deducing a template parameter pack
7515 from a sub-declarator, as in variadic114.C. */
7516 if (!post_variadic_parms
)
7517 inner_args
= expand_template_argument_pack (inner_args
);
7519 /* Count any pack expansion args. */
7520 variadic_args_p
= pack_expansion_args_count (inner_args
);
7522 nargs
= inner_args
? NUM_TMPL_ARGS (inner_args
) : 0;
7523 if ((nargs
> nparms
&& !variadic_p
)
7524 || (nargs
< nparms
- variadic_p
7527 && (!use_default_args
7528 || (TREE_VEC_ELT (parms
, nargs
) != error_mark_node
7529 && !TREE_PURPOSE (TREE_VEC_ELT (parms
, nargs
))))))
7531 if (complain
& tf_error
)
7533 if (variadic_p
|| default_p
)
7535 nparms
-= variadic_p
+ default_p
;
7536 error ("wrong number of template arguments "
7537 "(%d, should be at least %d)", nargs
, nparms
);
7540 error ("wrong number of template arguments "
7541 "(%d, should be %d)", nargs
, nparms
);
7544 inform (DECL_SOURCE_LOCATION (in_decl
),
7545 "provided for %qD", in_decl
);
7548 return error_mark_node
;
7550 /* We can't pass a pack expansion to a non-pack parameter of an alias
7551 template (DR 1430). */
7553 && (DECL_ALIAS_TEMPLATE_P (in_decl
)
7554 || concept_template_p (in_decl
))
7556 && nargs
- variadic_args_p
< nparms
- variadic_p
)
7558 if (complain
& tf_error
)
7560 for (int i
= 0; i
< TREE_VEC_LENGTH (inner_args
); ++i
)
7562 tree arg
= TREE_VEC_ELT (inner_args
, i
);
7563 tree parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
7565 if (PACK_EXPANSION_P (arg
)
7566 && !template_parameter_pack_p (parm
))
7568 if (DECL_ALIAS_TEMPLATE_P (in_decl
))
7569 error_at (location_of (arg
),
7570 "pack expansion argument for non-pack parameter "
7571 "%qD of alias template %qD", parm
, in_decl
);
7573 error_at (location_of (arg
),
7574 "pack expansion argument for non-pack parameter "
7575 "%qD of concept %qD", parm
, in_decl
);
7576 inform (DECL_SOURCE_LOCATION (parm
), "declared here");
7583 return error_mark_node
;
7586 /* We need to evaluate the template arguments, even though this
7587 template-id may be nested within a "sizeof". */
7588 saved_unevaluated_operand
= cp_unevaluated_operand
;
7589 cp_unevaluated_operand
= 0;
7590 saved_inhibit_evaluation_warnings
= c_inhibit_evaluation_warnings
;
7591 c_inhibit_evaluation_warnings
= 0;
7592 new_inner_args
= make_tree_vec (nparms
);
7593 new_args
= add_outermost_template_args (args
, new_inner_args
);
7594 int pack_adjust
= 0;
7595 for (parm_idx
= 0, arg_idx
= 0; parm_idx
< nparms
; parm_idx
++, arg_idx
++)
7600 /* Get the Ith template parameter. */
7601 parm
= TREE_VEC_ELT (parms
, parm_idx
);
7603 if (parm
== error_mark_node
)
7605 TREE_VEC_ELT (new_inner_args
, arg_idx
) = error_mark_node
;
7609 /* Calculate the next argument. */
7610 if (arg_idx
< nargs
)
7611 arg
= TREE_VEC_ELT (inner_args
, arg_idx
);
7615 if (template_parameter_pack_p (TREE_VALUE (parm
))
7616 && !(arg
&& ARGUMENT_PACK_P (arg
)))
7618 /* Some arguments will be placed in the
7619 template parameter pack PARM. */
7620 arg
= coerce_template_parameter_pack (parms
, parm_idx
, args
,
7621 inner_args
, arg_idx
,
7625 if (arg
== NULL_TREE
)
7627 /* We don't know how many args we have yet, just use the
7628 unconverted (and still packed) ones for now. */
7629 new_inner_args
= orig_inner_args
;
7634 TREE_VEC_ELT (new_inner_args
, parm_idx
) = arg
;
7636 /* Store this argument. */
7637 if (arg
== error_mark_node
)
7640 /* We are done with all of the arguments. */
7645 pack_adjust
= TREE_VEC_LENGTH (ARGUMENT_PACK_ARGS (arg
)) - 1;
7646 arg_idx
+= pack_adjust
;
7653 if (PACK_EXPANSION_P (arg
))
7655 /* "If every valid specialization of a variadic template
7656 requires an empty template parameter pack, the template is
7657 ill-formed, no diagnostic required." So check that the
7658 pattern works with this parameter. */
7659 tree pattern
= PACK_EXPANSION_PATTERN (arg
);
7660 tree conv
= convert_template_argument (TREE_VALUE (parm
),
7664 if (conv
== error_mark_node
)
7666 inform (input_location
, "so any instantiation with a "
7667 "non-empty parameter pack would be ill-formed");
7670 else if (TYPE_P (conv
) && !TYPE_P (pattern
))
7671 /* Recover from missing typename. */
7672 TREE_VEC_ELT (inner_args
, arg_idx
)
7673 = make_pack_expansion (conv
);
7675 /* We don't know how many args we have yet, just
7676 use the unconverted ones for now. */
7677 new_inner_args
= inner_args
;
7682 else if (require_all_args
)
7684 /* There must be a default arg in this case. */
7685 arg
= tsubst_template_arg (TREE_PURPOSE (parm
), new_args
,
7687 /* The position of the first default template argument,
7688 is also the number of non-defaulted arguments in NEW_INNER_ARGS.
7690 if (!NON_DEFAULT_TEMPLATE_ARGS_COUNT (new_inner_args
))
7691 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (new_inner_args
,
7692 arg_idx
- pack_adjust
);
7697 if (arg
== error_mark_node
)
7699 if (complain
& tf_error
)
7700 error ("template argument %d is invalid", arg_idx
+ 1);
7703 /* This only occurs if there was an error in the template
7704 parameter list itself (which we would already have
7705 reported) that we are trying to recover from, e.g., a class
7706 template with a parameter list such as
7707 template<typename..., typename>. */
7710 arg
= convert_template_argument (TREE_VALUE (parm
),
7711 arg
, new_args
, complain
,
7714 if (arg
== error_mark_node
)
7716 TREE_VEC_ELT (new_inner_args
, arg_idx
- pack_adjust
) = arg
;
7718 cp_unevaluated_operand
= saved_unevaluated_operand
;
7719 c_inhibit_evaluation_warnings
= saved_inhibit_evaluation_warnings
;
7721 if (variadic_p
&& arg_idx
< nargs
)
7723 if (complain
& tf_error
)
7725 error ("wrong number of template arguments "
7726 "(%d, should be %d)", nargs
, arg_idx
);
7728 error ("provided for %q+D", in_decl
);
7730 return error_mark_node
;
7734 return error_mark_node
;
7736 if (CHECKING_P
&& !NON_DEFAULT_TEMPLATE_ARGS_COUNT (new_inner_args
))
7737 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (new_inner_args
,
7738 TREE_VEC_LENGTH (new_inner_args
));
7740 return new_inner_args
;
7743 /* Convert all template arguments to their appropriate types, and
7744 return a vector containing the innermost resulting template
7745 arguments. If any error occurs, return error_mark_node. Error and
7746 warning messages are not issued.
7748 Note that no function argument deduction is performed, and default
7749 arguments are used to fill in unspecified arguments. */
7751 coerce_template_parms (tree parms
, tree args
, tree in_decl
)
7753 return coerce_template_parms (parms
, args
, in_decl
, tf_none
, true, true);
7756 /* Convert all template arguments to their appropriate type, and
7757 instantiate default arguments as needed. This returns a vector
7758 containing the innermost resulting template arguments, or
7759 error_mark_node if unsuccessful. */
7761 coerce_template_parms (tree parms
, tree args
, tree in_decl
,
7762 tsubst_flags_t complain
)
7764 return coerce_template_parms (parms
, args
, in_decl
, complain
, true, true);
7767 /* Like coerce_template_parms. If PARMS represents all template
7768 parameters levels, this function returns a vector of vectors
7769 representing all the resulting argument levels. Note that in this
7770 case, only the innermost arguments are coerced because the
7771 outermost ones are supposed to have been coerced already.
7773 Otherwise, if PARMS represents only (the innermost) vector of
7774 parameters, this function returns a vector containing just the
7775 innermost resulting arguments. */
7778 coerce_innermost_template_parms (tree parms
,
7781 tsubst_flags_t complain
,
7782 bool require_all_args
,
7783 bool use_default_args
)
7785 int parms_depth
= TMPL_PARMS_DEPTH (parms
);
7786 int args_depth
= TMPL_ARGS_DEPTH (args
);
7789 if (parms_depth
> 1)
7791 coerced_args
= make_tree_vec (parms_depth
);
7795 for (level
= parms
, cur_depth
= parms_depth
;
7796 parms_depth
> 0 && level
!= NULL_TREE
;
7797 level
= TREE_CHAIN (level
), --cur_depth
)
7800 if (cur_depth
== args_depth
)
7801 l
= coerce_template_parms (TREE_VALUE (level
),
7802 args
, in_decl
, complain
,
7806 l
= TMPL_ARGS_LEVEL (args
, cur_depth
);
7808 if (l
== error_mark_node
)
7809 return error_mark_node
;
7811 SET_TMPL_ARGS_LEVEL (coerced_args
, cur_depth
, l
);
7815 coerced_args
= coerce_template_parms (INNERMOST_TEMPLATE_PARMS (parms
),
7816 args
, in_decl
, complain
,
7819 return coerced_args
;
7822 /* Returns 1 if template args OT and NT are equivalent. */
7825 template_args_equal (tree ot
, tree nt
)
7829 if (nt
== NULL_TREE
|| ot
== NULL_TREE
)
7832 if (TREE_CODE (nt
) == TREE_VEC
)
7833 /* For member templates */
7834 return TREE_CODE (ot
) == TREE_VEC
&& comp_template_args (ot
, nt
);
7835 else if (PACK_EXPANSION_P (ot
))
7836 return (PACK_EXPANSION_P (nt
)
7837 && template_args_equal (PACK_EXPANSION_PATTERN (ot
),
7838 PACK_EXPANSION_PATTERN (nt
))
7839 && template_args_equal (PACK_EXPANSION_EXTRA_ARGS (ot
),
7840 PACK_EXPANSION_EXTRA_ARGS (nt
)));
7841 else if (ARGUMENT_PACK_P (ot
))
7846 if (!ARGUMENT_PACK_P (nt
))
7849 opack
= ARGUMENT_PACK_ARGS (ot
);
7850 npack
= ARGUMENT_PACK_ARGS (nt
);
7851 len
= TREE_VEC_LENGTH (opack
);
7852 if (TREE_VEC_LENGTH (npack
) != len
)
7854 for (i
= 0; i
< len
; ++i
)
7855 if (!template_args_equal (TREE_VEC_ELT (opack
, i
),
7856 TREE_VEC_ELT (npack
, i
)))
7860 else if (ot
&& TREE_CODE (ot
) == ARGUMENT_PACK_SELECT
)
7862 /* We get here probably because we are in the middle of substituting
7863 into the pattern of a pack expansion. In that case the
7864 ARGUMENT_PACK_SELECT temporarily replaces the pack argument we are
7865 interested in. So we want to use the initial pack argument for
7867 ot
= ARGUMENT_PACK_SELECT_FROM_PACK (ot
);
7868 if (nt
&& TREE_CODE (nt
) == ARGUMENT_PACK_SELECT
)
7869 nt
= ARGUMENT_PACK_SELECT_FROM_PACK (nt
);
7870 return template_args_equal (ot
, nt
);
7872 else if (TYPE_P (nt
))
7876 /* Don't treat an alias template specialization with dependent
7877 arguments as equivalent to its underlying type when used as a
7878 template argument; we need them to be distinct so that we
7879 substitute into the specialization arguments at instantiation
7880 time. And aliases can't be equivalent without being ==, so
7881 we don't need to look any deeper. */
7882 if (TYPE_ALIAS_P (nt
) || TYPE_ALIAS_P (ot
))
7885 return same_type_p (ot
, nt
);
7887 else if (TREE_CODE (ot
) == TREE_VEC
|| TYPE_P (ot
))
7891 /* Try to treat a template non-type argument that has been converted
7892 to the parameter type as equivalent to one that hasn't yet. */
7893 for (enum tree_code code1
= TREE_CODE (ot
);
7894 CONVERT_EXPR_CODE_P (code1
)
7895 || code1
== NON_LVALUE_EXPR
;
7896 code1
= TREE_CODE (ot
))
7897 ot
= TREE_OPERAND (ot
, 0);
7898 for (enum tree_code code2
= TREE_CODE (nt
);
7899 CONVERT_EXPR_CODE_P (code2
)
7900 || code2
== NON_LVALUE_EXPR
;
7901 code2
= TREE_CODE (nt
))
7902 nt
= TREE_OPERAND (nt
, 0);
7904 return cp_tree_equal (ot
, nt
);
7908 /* Returns 1 iff the OLDARGS and NEWARGS are in fact identical sets of
7909 template arguments. Returns 0 otherwise, and updates OLDARG_PTR and
7910 NEWARG_PTR with the offending arguments if they are non-NULL. */
7913 comp_template_args (tree oldargs
, tree newargs
,
7914 tree
*oldarg_ptr
, tree
*newarg_ptr
)
7918 if (oldargs
== newargs
)
7921 if (!oldargs
|| !newargs
)
7924 if (TREE_VEC_LENGTH (oldargs
) != TREE_VEC_LENGTH (newargs
))
7927 for (i
= 0; i
< TREE_VEC_LENGTH (oldargs
); ++i
)
7929 tree nt
= TREE_VEC_ELT (newargs
, i
);
7930 tree ot
= TREE_VEC_ELT (oldargs
, i
);
7932 if (! template_args_equal (ot
, nt
))
7934 if (oldarg_ptr
!= NULL
)
7936 if (newarg_ptr
!= NULL
)
7945 add_pending_template (tree d
)
7947 tree ti
= (TYPE_P (d
)
7948 ? CLASSTYPE_TEMPLATE_INFO (d
)
7949 : DECL_TEMPLATE_INFO (d
));
7950 struct pending_template
*pt
;
7953 if (TI_PENDING_TEMPLATE_FLAG (ti
))
7956 /* We are called both from instantiate_decl, where we've already had a
7957 tinst_level pushed, and instantiate_template, where we haven't.
7959 level
= !current_tinst_level
|| current_tinst_level
->decl
!= d
;
7962 push_tinst_level (d
);
7964 pt
= ggc_alloc
<pending_template
> ();
7966 pt
->tinst
= current_tinst_level
;
7967 if (last_pending_template
)
7968 last_pending_template
->next
= pt
;
7970 pending_templates
= pt
;
7972 last_pending_template
= pt
;
7974 TI_PENDING_TEMPLATE_FLAG (ti
) = 1;
7981 /* Return a TEMPLATE_ID_EXPR corresponding to the indicated FNS and
7982 ARGLIST. Valid choices for FNS are given in the cp-tree.def
7983 documentation for TEMPLATE_ID_EXPR. */
7986 lookup_template_function (tree fns
, tree arglist
)
7990 if (fns
== error_mark_node
|| arglist
== error_mark_node
)
7991 return error_mark_node
;
7993 gcc_assert (!arglist
|| TREE_CODE (arglist
) == TREE_VEC
);
7995 if (!is_overloaded_fn (fns
) && !identifier_p (fns
))
7997 error ("%q#D is not a function template", fns
);
7998 return error_mark_node
;
8001 if (BASELINK_P (fns
))
8003 BASELINK_FUNCTIONS (fns
) = build2 (TEMPLATE_ID_EXPR
,
8005 BASELINK_FUNCTIONS (fns
),
8010 type
= TREE_TYPE (fns
);
8011 if (TREE_CODE (fns
) == OVERLOAD
|| !type
)
8012 type
= unknown_type_node
;
8014 return build2 (TEMPLATE_ID_EXPR
, type
, fns
, arglist
);
8017 /* Within the scope of a template class S<T>, the name S gets bound
8018 (in build_self_reference) to a TYPE_DECL for the class, not a
8019 TEMPLATE_DECL. If DECL is a TYPE_DECL for current_class_type,
8020 or one of its enclosing classes, and that type is a template,
8021 return the associated TEMPLATE_DECL. Otherwise, the original
8024 Also handle the case when DECL is a TREE_LIST of ambiguous
8025 injected-class-names from different bases. */
8028 maybe_get_template_decl_from_type_decl (tree decl
)
8030 if (decl
== NULL_TREE
)
8033 /* DR 176: A lookup that finds an injected-class-name (10.2
8034 [class.member.lookup]) can result in an ambiguity in certain cases
8035 (for example, if it is found in more than one base class). If all of
8036 the injected-class-names that are found refer to specializations of
8037 the same class template, and if the name is followed by a
8038 template-argument-list, the reference refers to the class template
8039 itself and not a specialization thereof, and is not ambiguous. */
8040 if (TREE_CODE (decl
) == TREE_LIST
)
8042 tree t
, tmpl
= NULL_TREE
;
8043 for (t
= decl
; t
; t
= TREE_CHAIN (t
))
8045 tree elt
= maybe_get_template_decl_from_type_decl (TREE_VALUE (t
));
8048 else if (tmpl
!= elt
)
8051 if (tmpl
&& t
== NULL_TREE
)
8057 return (decl
!= NULL_TREE
8058 && DECL_SELF_REFERENCE_P (decl
)
8059 && CLASSTYPE_TEMPLATE_INFO (TREE_TYPE (decl
)))
8060 ? CLASSTYPE_TI_TEMPLATE (TREE_TYPE (decl
)) : decl
;
8063 /* Given an IDENTIFIER_NODE (or type TEMPLATE_DECL) and a chain of
8064 parameters, find the desired type.
8066 D1 is the PTYPENAME terminal, and ARGLIST is the list of arguments.
8068 IN_DECL, if non-NULL, is the template declaration we are trying to
8071 If ENTERING_SCOPE is nonzero, we are about to enter the scope of
8072 the class we are looking up.
8074 Issue error and warning messages under control of COMPLAIN.
8076 If the template class is really a local class in a template
8077 function, then the FUNCTION_CONTEXT is the function in which it is
8080 ??? Note that this function is currently called *twice* for each
8081 template-id: the first time from the parser, while creating the
8082 incomplete type (finish_template_type), and the second type during the
8083 real instantiation (instantiate_template_class). This is surely something
8084 that we want to avoid. It also causes some problems with argument
8085 coercion (see convert_nontype_argument for more information on this). */
8088 lookup_template_class_1 (tree d1
, tree arglist
, tree in_decl
, tree context
,
8089 int entering_scope
, tsubst_flags_t complain
)
8091 tree templ
= NULL_TREE
, parmlist
;
8098 if (identifier_p (d1
))
8100 tree value
= innermost_non_namespace_value (d1
);
8101 if (value
&& DECL_TEMPLATE_TEMPLATE_PARM_P (value
))
8106 push_decl_namespace (context
);
8107 templ
= lookup_name (d1
);
8108 templ
= maybe_get_template_decl_from_type_decl (templ
);
8110 pop_decl_namespace ();
8113 context
= DECL_CONTEXT (templ
);
8115 else if (TREE_CODE (d1
) == TYPE_DECL
&& MAYBE_CLASS_TYPE_P (TREE_TYPE (d1
)))
8117 tree type
= TREE_TYPE (d1
);
8119 /* If we are declaring a constructor, say A<T>::A<T>, we will get
8120 an implicit typename for the second A. Deal with it. */
8121 if (TREE_CODE (type
) == TYPENAME_TYPE
&& TREE_TYPE (type
))
8122 type
= TREE_TYPE (type
);
8124 if (CLASSTYPE_TEMPLATE_INFO (type
))
8126 templ
= CLASSTYPE_TI_TEMPLATE (type
);
8127 d1
= DECL_NAME (templ
);
8130 else if (TREE_CODE (d1
) == ENUMERAL_TYPE
8131 || (TYPE_P (d1
) && MAYBE_CLASS_TYPE_P (d1
)))
8133 templ
= TYPE_TI_TEMPLATE (d1
);
8134 d1
= DECL_NAME (templ
);
8136 else if (DECL_TYPE_TEMPLATE_P (d1
))
8139 d1
= DECL_NAME (templ
);
8140 context
= DECL_CONTEXT (templ
);
8142 else if (DECL_TEMPLATE_TEMPLATE_PARM_P (d1
))
8145 d1
= DECL_NAME (templ
);
8148 /* Issue an error message if we didn't find a template. */
8151 if (complain
& tf_error
)
8152 error ("%qT is not a template", d1
);
8153 return error_mark_node
;
8156 if (TREE_CODE (templ
) != TEMPLATE_DECL
8157 /* Make sure it's a user visible template, if it was named by
8159 || ((complain
& tf_user
) && !DECL_TEMPLATE_PARM_P (templ
)
8160 && !PRIMARY_TEMPLATE_P (templ
)))
8162 if (complain
& tf_error
)
8164 error ("non-template type %qT used as a template", d1
);
8166 error ("for template declaration %q+D", in_decl
);
8168 return error_mark_node
;
8171 complain
&= ~tf_user
;
8173 /* An alias that just changes the name of a template is equivalent to the
8174 other template, so if any of the arguments are pack expansions, strip
8175 the alias to avoid problems with a pack expansion passed to a non-pack
8176 alias template parameter (DR 1430). */
8177 if (pack_expansion_args_count (INNERMOST_TEMPLATE_ARGS (arglist
)))
8178 templ
= get_underlying_template (templ
);
8180 if (DECL_TEMPLATE_TEMPLATE_PARM_P (templ
))
8182 /* Create a new TEMPLATE_DECL and TEMPLATE_TEMPLATE_PARM node to store
8183 template arguments */
8189 parmlist
= DECL_INNERMOST_TEMPLATE_PARMS (templ
);
8191 /* Consider an example where a template template parameter declared as
8193 template <class T, class U = std::allocator<T> > class TT
8195 The template parameter level of T and U are one level larger than
8196 of TT. To proper process the default argument of U, say when an
8197 instantiation `TT<int>' is seen, we need to build the full
8198 arguments containing {int} as the innermost level. Outer levels,
8199 available when not appearing as default template argument, can be
8200 obtained from the arguments of the enclosing template.
8202 Suppose that TT is later substituted with std::vector. The above
8203 instantiation is `TT<int, std::allocator<T> >' with TT at
8204 level 1, and T at level 2, while the template arguments at level 1
8205 becomes {std::vector} and the inner level 2 is {int}. */
8207 outer
= DECL_CONTEXT (templ
);
8209 outer
= TI_ARGS (get_template_info (DECL_TEMPLATE_RESULT (outer
)));
8210 else if (current_template_parms
)
8212 /* This is an argument of the current template, so we haven't set
8213 DECL_CONTEXT yet. */
8214 tree relevant_template_parms
;
8216 /* Parameter levels that are greater than the level of the given
8217 template template parm are irrelevant. */
8218 relevant_template_parms
= current_template_parms
;
8219 while (TMPL_PARMS_DEPTH (relevant_template_parms
)
8220 != TEMPLATE_TYPE_LEVEL (TREE_TYPE (templ
)))
8221 relevant_template_parms
= TREE_CHAIN (relevant_template_parms
);
8223 outer
= template_parms_to_args (relevant_template_parms
);
8227 arglist
= add_to_template_args (outer
, arglist
);
8229 arglist2
= coerce_template_parms (parmlist
, arglist
, templ
,
8231 /*require_all_args=*/true,
8232 /*use_default_args=*/true);
8233 if (arglist2
== error_mark_node
8234 || (!uses_template_parms (arglist2
)
8235 && check_instantiated_args (templ
, arglist2
, complain
)))
8236 return error_mark_node
;
8238 parm
= bind_template_template_parm (TREE_TYPE (templ
), arglist2
);
8243 tree template_type
= TREE_TYPE (templ
);
8246 tree found
= NULL_TREE
;
8249 int is_dependent_type
;
8250 int use_partial_inst_tmpl
= false;
8252 if (template_type
== error_mark_node
)
8253 /* An error occurred while building the template TEMPL, and a
8254 diagnostic has most certainly been emitted for that
8255 already. Let's propagate that error. */
8256 return error_mark_node
;
8258 gen_tmpl
= most_general_template (templ
);
8259 parmlist
= DECL_TEMPLATE_PARMS (gen_tmpl
);
8260 parm_depth
= TMPL_PARMS_DEPTH (parmlist
);
8261 arg_depth
= TMPL_ARGS_DEPTH (arglist
);
8263 if (arg_depth
== 1 && parm_depth
> 1)
8265 /* We've been given an incomplete set of template arguments.
8268 template <class T> struct S1 {
8269 template <class U> struct S2 {};
8270 template <class U> struct S2<U*> {};
8273 we will be called with an ARGLIST of `U*', but the
8274 TEMPLATE will be `template <class T> template
8275 <class U> struct S1<T>::S2'. We must fill in the missing
8278 = add_outermost_template_args (TYPE_TI_ARGS (TREE_TYPE (templ
)),
8280 arg_depth
= TMPL_ARGS_DEPTH (arglist
);
8283 /* Now we should have enough arguments. */
8284 gcc_assert (parm_depth
== arg_depth
);
8286 /* From here on, we're only interested in the most general
8289 /* Calculate the BOUND_ARGS. These will be the args that are
8290 actually tsubst'd into the definition to create the
8292 arglist
= coerce_innermost_template_parms (parmlist
, arglist
, gen_tmpl
,
8294 /*require_all_args=*/true,
8295 /*use_default_args=*/true);
8297 if (arglist
== error_mark_node
)
8298 /* We were unable to bind the arguments. */
8299 return error_mark_node
;
8301 /* In the scope of a template class, explicit references to the
8302 template class refer to the type of the template, not any
8303 instantiation of it. For example, in:
8305 template <class T> class C { void f(C<T>); }
8307 the `C<T>' is just the same as `C'. Outside of the
8308 class, however, such a reference is an instantiation. */
8310 || !PRIMARY_TEMPLATE_P (gen_tmpl
)
8311 || currently_open_class (template_type
))
8312 /* comp_template_args is expensive, check it last. */
8313 && comp_template_args (TYPE_TI_ARGS (template_type
),
8315 return template_type
;
8317 /* If we already have this specialization, return it. */
8318 elt
.tmpl
= gen_tmpl
;
8320 elt
.spec
= NULL_TREE
;
8321 hash
= spec_hasher::hash (&elt
);
8322 entry
= type_specializations
->find_with_hash (&elt
, hash
);
8327 /* If the the template's constraints are not satisfied,
8328 then we cannot form a valid type.
8330 Note that the check is deferred until after the hash
8331 lookup. This prevents redundant checks on previously
8332 instantiated specializations. */
8333 if (flag_concepts
&& !constraints_satisfied_p (gen_tmpl
, arglist
))
8335 if (complain
& tf_error
)
8337 error ("template constraint failure");
8338 diagnose_constraints (input_location
, gen_tmpl
, arglist
);
8340 return error_mark_node
;
8343 is_dependent_type
= uses_template_parms (arglist
);
8345 /* If the deduced arguments are invalid, then the binding
8347 if (!is_dependent_type
8348 && check_instantiated_args (gen_tmpl
,
8349 INNERMOST_TEMPLATE_ARGS (arglist
),
8351 return error_mark_node
;
8353 if (!is_dependent_type
8354 && !PRIMARY_TEMPLATE_P (gen_tmpl
)
8355 && !LAMBDA_TYPE_P (TREE_TYPE (gen_tmpl
))
8356 && TREE_CODE (CP_DECL_CONTEXT (gen_tmpl
)) == NAMESPACE_DECL
)
8358 found
= xref_tag_from_type (TREE_TYPE (gen_tmpl
),
8359 DECL_NAME (gen_tmpl
),
8360 /*tag_scope=*/ts_global
);
8364 context
= tsubst (DECL_CONTEXT (gen_tmpl
), arglist
,
8366 if (context
== error_mark_node
)
8367 return error_mark_node
;
8370 context
= global_namespace
;
8372 /* Create the type. */
8373 if (DECL_ALIAS_TEMPLATE_P (gen_tmpl
))
8375 /* The user referred to a specialization of an alias
8376 template represented by GEN_TMPL.
8378 [temp.alias]/2 says:
8380 When a template-id refers to the specialization of an
8381 alias template, it is equivalent to the associated
8382 type obtained by substitution of its
8383 template-arguments for the template-parameters in the
8384 type-id of the alias template. */
8386 t
= tsubst (TREE_TYPE (gen_tmpl
), arglist
, complain
, in_decl
);
8387 /* Note that the call above (by indirectly calling
8388 register_specialization in tsubst_decl) registers the
8389 TYPE_DECL representing the specialization of the alias
8390 template. So next time someone substitutes ARGLIST for
8391 the template parms into the alias template (GEN_TMPL),
8392 she'll get that TYPE_DECL back. */
8394 if (t
== error_mark_node
)
8397 else if (TREE_CODE (template_type
) == ENUMERAL_TYPE
)
8399 if (!is_dependent_type
)
8401 set_current_access_from_decl (TYPE_NAME (template_type
));
8402 t
= start_enum (TYPE_IDENTIFIER (template_type
), NULL_TREE
,
8403 tsubst (ENUM_UNDERLYING_TYPE (template_type
),
8404 arglist
, complain
, in_decl
),
8405 tsubst_attributes (TYPE_ATTRIBUTES (template_type
),
8406 arglist
, complain
, in_decl
),
8407 SCOPED_ENUM_P (template_type
), NULL
);
8409 if (t
== error_mark_node
)
8414 /* We don't want to call start_enum for this type, since
8415 the values for the enumeration constants may involve
8416 template parameters. And, no one should be interested
8417 in the enumeration constants for such a type. */
8418 t
= cxx_make_type (ENUMERAL_TYPE
);
8419 SET_SCOPED_ENUM_P (t
, SCOPED_ENUM_P (template_type
));
8421 SET_OPAQUE_ENUM_P (t
, OPAQUE_ENUM_P (template_type
));
8422 ENUM_FIXED_UNDERLYING_TYPE_P (t
)
8423 = ENUM_FIXED_UNDERLYING_TYPE_P (template_type
);
8425 else if (CLASS_TYPE_P (template_type
))
8427 t
= make_class_type (TREE_CODE (template_type
));
8428 CLASSTYPE_DECLARED_CLASS (t
)
8429 = CLASSTYPE_DECLARED_CLASS (template_type
);
8430 SET_CLASSTYPE_IMPLICIT_INSTANTIATION (t
);
8431 TYPE_FOR_JAVA (t
) = TYPE_FOR_JAVA (template_type
);
8433 /* A local class. Make sure the decl gets registered properly. */
8434 if (context
== current_function_decl
)
8435 pushtag (DECL_NAME (gen_tmpl
), t
, /*tag_scope=*/ts_current
);
8437 if (comp_template_args (CLASSTYPE_TI_ARGS (template_type
), arglist
))
8438 /* This instantiation is another name for the primary
8439 template type. Set the TYPE_CANONICAL field
8441 TYPE_CANONICAL (t
) = template_type
;
8442 else if (any_template_arguments_need_structural_equality_p (arglist
))
8443 /* Some of the template arguments require structural
8444 equality testing, so this template class requires
8445 structural equality testing. */
8446 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8451 /* If we called start_enum or pushtag above, this information
8452 will already be set up. */
8455 TYPE_CONTEXT (t
) = FROB_CONTEXT (context
);
8457 type_decl
= create_implicit_typedef (DECL_NAME (gen_tmpl
), t
);
8458 DECL_CONTEXT (type_decl
) = TYPE_CONTEXT (t
);
8459 DECL_SOURCE_LOCATION (type_decl
)
8460 = DECL_SOURCE_LOCATION (TYPE_STUB_DECL (template_type
));
8463 type_decl
= TYPE_NAME (t
);
8465 if (CLASS_TYPE_P (template_type
))
8467 TREE_PRIVATE (type_decl
)
8468 = TREE_PRIVATE (TYPE_MAIN_DECL (template_type
));
8469 TREE_PROTECTED (type_decl
)
8470 = TREE_PROTECTED (TYPE_MAIN_DECL (template_type
));
8471 if (CLASSTYPE_VISIBILITY_SPECIFIED (template_type
))
8473 DECL_VISIBILITY_SPECIFIED (type_decl
) = 1;
8474 DECL_VISIBILITY (type_decl
) = CLASSTYPE_VISIBILITY (template_type
);
8478 if (OVERLOAD_TYPE_P (t
)
8479 && !DECL_ALIAS_TEMPLATE_P (gen_tmpl
))
8481 static const char *tags
[] = {"abi_tag", "may_alias"};
8483 for (unsigned ix
= 0; ix
!= 2; ix
++)
8486 = lookup_attribute (tags
[ix
], TYPE_ATTRIBUTES (template_type
));
8490 = tree_cons (TREE_PURPOSE (attributes
),
8491 TREE_VALUE (attributes
),
8492 TYPE_ATTRIBUTES (t
));
8496 /* Let's consider the explicit specialization of a member
8497 of a class template specialization that is implicitly instantiated,
8502 template<class U> struct M {}; //#0
8507 struct S<int>::M<char> //#1
8511 [temp.expl.spec]/4 says this is valid.
8513 In this case, when we write:
8516 M is instantiated from the CLASSTYPE_TI_TEMPLATE of #1, not from
8519 When we encounter #1, we want to store the partial instantiation
8520 of M (template<class T> S<int>::M<T>) in its CLASSTYPE_TI_TEMPLATE.
8522 For all cases other than this "explicit specialization of member of a
8523 class template", we just want to store the most general template into
8524 the CLASSTYPE_TI_TEMPLATE of M.
8526 This case of "explicit specialization of member of a class template"
8528 1/ the enclosing class is an instantiation of, and therefore not
8529 the same as, the context of the most general template, and
8530 2/ we aren't looking at the partial instantiation itself, i.e.
8531 the innermost arguments are not the same as the innermost parms of
8532 the most general template.
8534 So it's only when 1/ and 2/ happens that we want to use the partial
8535 instantiation of the member template in lieu of its most general
8538 if (PRIMARY_TEMPLATE_P (gen_tmpl
)
8539 && TMPL_ARGS_HAVE_MULTIPLE_LEVELS (arglist
)
8540 /* the enclosing class must be an instantiation... */
8541 && CLASS_TYPE_P (context
)
8542 && !same_type_p (context
, DECL_CONTEXT (gen_tmpl
)))
8544 tree partial_inst_args
;
8545 TREE_VEC_LENGTH (arglist
)--;
8546 ++processing_template_decl
;
8548 tsubst (INNERMOST_TEMPLATE_ARGS
8549 (TYPE_TI_ARGS (TREE_TYPE (gen_tmpl
))),
8550 arglist
, complain
, NULL_TREE
);
8551 --processing_template_decl
;
8552 TREE_VEC_LENGTH (arglist
)++;
8553 if (partial_inst_args
== error_mark_node
)
8554 return error_mark_node
;
8555 use_partial_inst_tmpl
=
8556 /*...and we must not be looking at the partial instantiation
8558 !comp_template_args (INNERMOST_TEMPLATE_ARGS (arglist
),
8562 if (!use_partial_inst_tmpl
)
8563 /* This case is easy; there are no member templates involved. */
8567 /* This is a full instantiation of a member template. Find
8568 the partial instantiation of which this is an instance. */
8570 /* Temporarily reduce by one the number of levels in the ARGLIST
8571 so as to avoid comparing the last set of arguments. */
8572 TREE_VEC_LENGTH (arglist
)--;
8573 found
= tsubst (gen_tmpl
, arglist
, complain
, NULL_TREE
);
8574 TREE_VEC_LENGTH (arglist
)++;
8575 /* FOUND is either a proper class type, or an alias
8576 template specialization. In the later case, it's a
8577 TYPE_DECL, resulting from the substituting of arguments
8578 for parameters in the TYPE_DECL of the alias template
8579 done earlier. So be careful while getting the template
8581 found
= TREE_CODE (found
) == TYPE_DECL
8582 ? TYPE_TI_TEMPLATE (TREE_TYPE (found
))
8583 : CLASSTYPE_TI_TEMPLATE (found
);
8586 // Build template info for the new specialization.
8587 SET_TYPE_TEMPLATE_INFO (t
, build_template_info (found
, arglist
));
8590 slot
= type_specializations
->find_slot_with_hash (&elt
, hash
, INSERT
);
8591 entry
= ggc_alloc
<spec_entry
> ();
8595 /* Note this use of the partial instantiation so we can check it
8596 later in maybe_process_partial_specialization. */
8597 DECL_TEMPLATE_INSTANTIATIONS (found
)
8598 = tree_cons (arglist
, t
,
8599 DECL_TEMPLATE_INSTANTIATIONS (found
));
8601 if (TREE_CODE (template_type
) == ENUMERAL_TYPE
&& !is_dependent_type
8602 && !DECL_ALIAS_TEMPLATE_P (gen_tmpl
))
8603 /* Now that the type has been registered on the instantiations
8604 list, we set up the enumerators. Because the enumeration
8605 constants may involve the enumeration type itself, we make
8606 sure to register the type first, and then create the
8607 constants. That way, doing tsubst_expr for the enumeration
8608 constants won't result in recursive calls here; we'll find
8609 the instantiation and exit above. */
8610 tsubst_enum (template_type
, t
, arglist
);
8612 if (CLASS_TYPE_P (template_type
) && is_dependent_type
)
8613 /* If the type makes use of template parameters, the
8614 code that generates debugging information will crash. */
8615 DECL_IGNORED_P (TYPE_MAIN_DECL (t
)) = 1;
8617 /* Possibly limit visibility based on template args. */
8618 TREE_PUBLIC (type_decl
) = 1;
8619 determine_visibility (type_decl
);
8621 inherit_targ_abi_tags (t
);
8627 /* Wrapper for lookup_template_class_1. */
8630 lookup_template_class (tree d1
, tree arglist
, tree in_decl
, tree context
,
8631 int entering_scope
, tsubst_flags_t complain
)
8634 timevar_push (TV_TEMPLATE_INST
);
8635 ret
= lookup_template_class_1 (d1
, arglist
, in_decl
, context
,
8636 entering_scope
, complain
);
8637 timevar_pop (TV_TEMPLATE_INST
);
8641 /* Return a TEMPLATE_ID_EXPR for the given variable template and ARGLIST. */
8644 lookup_template_variable (tree templ
, tree arglist
)
8646 /* The type of the expression is NULL_TREE since the template-id could refer
8647 to an explicit or partial specialization. */
8648 tree type
= NULL_TREE
;
8649 if (flag_concepts
&& variable_concept_p (templ
))
8650 /* Except that concepts are always bool. */
8651 type
= boolean_type_node
;
8652 return build2 (TEMPLATE_ID_EXPR
, type
, templ
, arglist
);
8655 /* Instantiate a variable declaration from a TEMPLATE_ID_EXPR for use. */
8658 finish_template_variable (tree var
, tsubst_flags_t complain
)
8660 tree templ
= TREE_OPERAND (var
, 0);
8661 tree arglist
= TREE_OPERAND (var
, 1);
8663 /* We never want to return a VAR_DECL for a variable concept, since they
8664 aren't instantiated. In a template, leave the TEMPLATE_ID_EXPR alone. */
8665 bool concept_p
= flag_concepts
&& variable_concept_p (templ
);
8666 if (concept_p
&& processing_template_decl
)
8669 tree tmpl_args
= DECL_TI_ARGS (DECL_TEMPLATE_RESULT (templ
));
8670 arglist
= add_outermost_template_args (tmpl_args
, arglist
);
8672 tree parms
= DECL_TEMPLATE_PARMS (templ
);
8673 arglist
= coerce_innermost_template_parms (parms
, arglist
, templ
, complain
,
8675 /*use_default*/true);
8677 if (flag_concepts
&& !constraints_satisfied_p (templ
, arglist
))
8679 if (complain
& tf_error
)
8681 error ("constraints for %qD not satisfied", templ
);
8682 diagnose_constraints (location_of (var
), templ
, arglist
);
8684 return error_mark_node
;
8687 /* If a template-id refers to a specialization of a variable
8688 concept, then the expression is true if and only if the
8689 concept's constraints are satisfied by the given template
8692 NOTE: This is an extension of Concepts Lite TS that
8693 allows constraints to be used in expressions. */
8696 tree decl
= DECL_TEMPLATE_RESULT (templ
);
8697 return evaluate_variable_concept (decl
, arglist
);
8700 return instantiate_template (templ
, arglist
, complain
);
8703 /* Construct a TEMPLATE_ID_EXPR for the given variable template TEMPL having
8704 TARGS template args, and instantiate it if it's not dependent. */
8707 lookup_and_finish_template_variable (tree templ
, tree targs
,
8708 tsubst_flags_t complain
)
8710 templ
= lookup_template_variable (templ
, targs
);
8711 if (!any_dependent_template_arguments_p (targs
))
8713 templ
= finish_template_variable (templ
, complain
);
8717 return convert_from_reference (templ
);
8725 /* True when we should also visit template parameters that occur in
8726 non-deduced contexts. */
8727 bool include_nondeduced_p
;
8728 hash_set
<tree
> *visited
;
8731 /* Called from for_each_template_parm via walk_tree. */
8734 for_each_template_parm_r (tree
*tp
, int *walk_subtrees
, void *d
)
8737 struct pair_fn_data
*pfd
= (struct pair_fn_data
*) d
;
8738 tree_fn_t fn
= pfd
->fn
;
8739 void *data
= pfd
->data
;
8740 tree result
= NULL_TREE
;
8742 #define WALK_SUBTREE(NODE) \
8745 result = for_each_template_parm (NODE, fn, data, pfd->visited, \
8746 pfd->include_nondeduced_p); \
8747 if (result) goto out; \
8752 && (pfd
->include_nondeduced_p
|| TREE_CODE (t
) != TYPENAME_TYPE
))
8753 WALK_SUBTREE (TYPE_CONTEXT (t
));
8755 switch (TREE_CODE (t
))
8758 if (TYPE_PTRMEMFUNC_P (t
))
8764 if (!TYPE_TEMPLATE_INFO (t
))
8767 WALK_SUBTREE (TYPE_TI_ARGS (t
));
8771 WALK_SUBTREE (TYPE_MIN_VALUE (t
));
8772 WALK_SUBTREE (TYPE_MAX_VALUE (t
));
8776 /* Since we're not going to walk subtrees, we have to do this
8778 WALK_SUBTREE (TYPE_METHOD_BASETYPE (t
));
8782 /* Check the return type. */
8783 WALK_SUBTREE (TREE_TYPE (t
));
8785 /* Check the parameter types. Since default arguments are not
8786 instantiated until they are needed, the TYPE_ARG_TYPES may
8787 contain expressions that involve template parameters. But,
8788 no-one should be looking at them yet. And, once they're
8789 instantiated, they don't contain template parameters, so
8790 there's no point in looking at them then, either. */
8794 for (parm
= TYPE_ARG_TYPES (t
); parm
; parm
= TREE_CHAIN (parm
))
8795 WALK_SUBTREE (TREE_VALUE (parm
));
8797 /* Since we've already handled the TYPE_ARG_TYPES, we don't
8798 want walk_tree walking into them itself. */
8804 case UNDERLYING_TYPE
:
8805 if (pfd
->include_nondeduced_p
8806 && for_each_template_parm (TYPE_VALUES_RAW (t
), fn
, data
,
8808 pfd
->include_nondeduced_p
))
8809 return error_mark_node
;
8814 if (DECL_LANG_SPECIFIC (t
) && DECL_TEMPLATE_INFO (t
))
8815 WALK_SUBTREE (DECL_TI_ARGS (t
));
8820 if (TREE_CODE (t
) == CONST_DECL
&& DECL_TEMPLATE_PARM_P (t
))
8821 WALK_SUBTREE (DECL_INITIAL (t
));
8822 if (DECL_CONTEXT (t
)
8823 && pfd
->include_nondeduced_p
)
8824 WALK_SUBTREE (DECL_CONTEXT (t
));
8827 case BOUND_TEMPLATE_TEMPLATE_PARM
:
8828 /* Record template parameters such as `T' inside `TT<T>'. */
8829 WALK_SUBTREE (TYPE_TI_ARGS (t
));
8832 case TEMPLATE_TEMPLATE_PARM
:
8833 case TEMPLATE_TYPE_PARM
:
8834 case TEMPLATE_PARM_INDEX
:
8835 if (fn
&& (*fn
)(t
, data
))
8842 /* A template template parameter is encountered. */
8843 if (DECL_TEMPLATE_TEMPLATE_PARM_P (t
))
8844 WALK_SUBTREE (TREE_TYPE (t
));
8846 /* Already substituted template template parameter */
8851 /* A template-id in a TYPENAME_TYPE might be a deduced context after
8852 partial instantiation. */
8853 WALK_SUBTREE (TYPENAME_TYPE_FULLNAME (t
));
8857 if (TREE_TYPE (t
) && TYPE_PTRMEMFUNC_P (TREE_TYPE (t
))
8858 && pfd
->include_nondeduced_p
)
8859 WALK_SUBTREE (TYPE_PTRMEMFUNC_FN_TYPE (TREE_TYPE (t
)));
8864 /* If there's no type, then this thing must be some expression
8865 involving template parameters. */
8866 if (!fn
&& !TREE_TYPE (t
))
8867 return error_mark_node
;
8872 case IMPLICIT_CONV_EXPR
:
8873 case REINTERPRET_CAST_EXPR
:
8874 case CONST_CAST_EXPR
:
8875 case STATIC_CAST_EXPR
:
8876 case DYNAMIC_CAST_EXPR
:
8880 case PSEUDO_DTOR_EXPR
:
8882 return error_mark_node
;
8891 /* We didn't find any template parameters we liked. */
8896 /* For each TEMPLATE_TYPE_PARM, TEMPLATE_TEMPLATE_PARM,
8897 BOUND_TEMPLATE_TEMPLATE_PARM or TEMPLATE_PARM_INDEX in T,
8898 call FN with the parameter and the DATA.
8899 If FN returns nonzero, the iteration is terminated, and
8900 for_each_template_parm returns 1. Otherwise, the iteration
8901 continues. If FN never returns a nonzero value, the value
8902 returned by for_each_template_parm is 0. If FN is NULL, it is
8903 considered to be the function which always returns 1.
8905 If INCLUDE_NONDEDUCED_P, then this routine will also visit template
8906 parameters that occur in non-deduced contexts. When false, only
8907 visits those template parameters that can be deduced. */
8910 for_each_template_parm (tree t
, tree_fn_t fn
, void* data
,
8911 hash_set
<tree
> *visited
,
8912 bool include_nondeduced_p
)
8914 struct pair_fn_data pfd
;
8920 pfd
.include_nondeduced_p
= include_nondeduced_p
;
8922 /* Walk the tree. (Conceptually, we would like to walk without
8923 duplicates, but for_each_template_parm_r recursively calls
8924 for_each_template_parm, so we would need to reorganize a fair
8925 bit to use walk_tree_without_duplicates, so we keep our own
8928 pfd
.visited
= visited
;
8930 pfd
.visited
= new hash_set
<tree
>;
8931 result
= cp_walk_tree (&t
,
8932 for_each_template_parm_r
,
8946 /* Returns true if T depends on any template parameter. */
8949 uses_template_parms (tree t
)
8955 int saved_processing_template_decl
;
8957 saved_processing_template_decl
= processing_template_decl
;
8958 if (!saved_processing_template_decl
)
8959 processing_template_decl
= 1;
8961 dependent_p
= dependent_type_p (t
);
8962 else if (TREE_CODE (t
) == TREE_VEC
)
8963 dependent_p
= any_dependent_template_arguments_p (t
);
8964 else if (TREE_CODE (t
) == TREE_LIST
)
8965 dependent_p
= (uses_template_parms (TREE_VALUE (t
))
8966 || uses_template_parms (TREE_CHAIN (t
)));
8967 else if (TREE_CODE (t
) == TYPE_DECL
)
8968 dependent_p
= dependent_type_p (TREE_TYPE (t
));
8971 || TREE_CODE (t
) == TEMPLATE_PARM_INDEX
8972 || TREE_CODE (t
) == OVERLOAD
8975 || TREE_CODE (t
) == TRAIT_EXPR
8976 || TREE_CODE (t
) == CONSTRUCTOR
8977 || CONSTANT_CLASS_P (t
))
8978 dependent_p
= (type_dependent_expression_p (t
)
8979 || value_dependent_expression_p (t
));
8982 gcc_assert (t
== error_mark_node
);
8983 dependent_p
= false;
8986 processing_template_decl
= saved_processing_template_decl
;
8991 /* Returns true iff current_function_decl is an incompletely instantiated
8992 template. Useful instead of processing_template_decl because the latter
8993 is set to 0 during instantiate_non_dependent_expr. */
8996 in_template_function (void)
8998 tree fn
= current_function_decl
;
9000 ++processing_template_decl
;
9001 ret
= (fn
&& DECL_LANG_SPECIFIC (fn
)
9002 && DECL_TEMPLATE_INFO (fn
)
9003 && any_dependent_template_arguments_p (DECL_TI_ARGS (fn
)));
9004 --processing_template_decl
;
9008 /* Returns true if T depends on any template parameter with level LEVEL. */
9011 uses_template_parms_level (tree t
, int level
)
9013 return for_each_template_parm (t
, template_parm_this_level_p
, &level
, NULL
,
9014 /*include_nondeduced_p=*/true);
9017 /* Returns TRUE iff INST is an instantiation we don't need to do in an
9018 ill-formed translation unit, i.e. a variable or function that isn't
9019 usable in a constant expression. */
9022 neglectable_inst_p (tree d
)
9025 && !(TREE_CODE (d
) == FUNCTION_DECL
? DECL_DECLARED_CONSTEXPR_P (d
)
9026 : decl_maybe_constant_var_p (d
)));
9029 /* Returns TRUE iff we should refuse to instantiate DECL because it's
9030 neglectable and instantiated from within an erroneous instantiation. */
9033 limit_bad_template_recursion (tree decl
)
9035 struct tinst_level
*lev
= current_tinst_level
;
9036 int errs
= errorcount
+ sorrycount
;
9037 if (lev
== NULL
|| errs
== 0 || !neglectable_inst_p (decl
))
9040 for (; lev
; lev
= lev
->next
)
9041 if (neglectable_inst_p (lev
->decl
))
9044 return (lev
&& errs
> lev
->errors
);
9047 static int tinst_depth
;
9048 extern int max_tinst_depth
;
9051 static GTY(()) struct tinst_level
*last_error_tinst_level
;
9053 /* We're starting to instantiate D; record the template instantiation context
9054 for diagnostics and to restore it later. */
9057 push_tinst_level (tree d
)
9059 return push_tinst_level_loc (d
, input_location
);
9062 /* We're starting to instantiate D; record the template instantiation context
9063 at LOC for diagnostics and to restore it later. */
9066 push_tinst_level_loc (tree d
, location_t loc
)
9068 struct tinst_level
*new_level
;
9070 if (tinst_depth
>= max_tinst_depth
)
9072 fatal_error (input_location
,
9073 "template instantiation depth exceeds maximum of %d"
9074 " (use -ftemplate-depth= to increase the maximum)",
9079 /* If the current instantiation caused problems, don't let it instantiate
9080 anything else. Do allow deduction substitution and decls usable in
9081 constant expressions. */
9082 if (limit_bad_template_recursion (d
))
9085 new_level
= ggc_alloc
<tinst_level
> ();
9086 new_level
->decl
= d
;
9087 new_level
->locus
= loc
;
9088 new_level
->errors
= errorcount
+sorrycount
;
9089 new_level
->in_system_header_p
= in_system_header_at (input_location
);
9090 new_level
->next
= current_tinst_level
;
9091 current_tinst_level
= new_level
;
9094 if (GATHER_STATISTICS
&& (tinst_depth
> depth_reached
))
9095 depth_reached
= tinst_depth
;
9100 /* We're done instantiating this template; return to the instantiation
9104 pop_tinst_level (void)
9106 /* Restore the filename and line number stashed away when we started
9107 this instantiation. */
9108 input_location
= current_tinst_level
->locus
;
9109 current_tinst_level
= current_tinst_level
->next
;
9113 /* We're instantiating a deferred template; restore the template
9114 instantiation context in which the instantiation was requested, which
9115 is one step out from LEVEL. Return the corresponding DECL or TYPE. */
9118 reopen_tinst_level (struct tinst_level
*level
)
9120 struct tinst_level
*t
;
9123 for (t
= level
; t
; t
= t
->next
)
9126 current_tinst_level
= level
;
9128 if (current_tinst_level
)
9129 current_tinst_level
->errors
= errorcount
+sorrycount
;
9133 /* Returns the TINST_LEVEL which gives the original instantiation
9136 struct tinst_level
*
9137 outermost_tinst_level (void)
9139 struct tinst_level
*level
= current_tinst_level
;
9142 level
= level
->next
;
9146 /* DECL is a friend FUNCTION_DECL or TEMPLATE_DECL. ARGS is the
9147 vector of template arguments, as for tsubst.
9149 Returns an appropriate tsubst'd friend declaration. */
9152 tsubst_friend_function (tree decl
, tree args
)
9156 if (TREE_CODE (decl
) == FUNCTION_DECL
9157 && DECL_TEMPLATE_INSTANTIATION (decl
)
9158 && TREE_CODE (DECL_TI_TEMPLATE (decl
)) != TEMPLATE_DECL
)
9159 /* This was a friend declared with an explicit template
9160 argument list, e.g.:
9164 to indicate that f was a template instantiation, not a new
9165 function declaration. Now, we have to figure out what
9166 instantiation of what template. */
9168 tree template_id
, arglist
, fns
;
9171 tree ns
= decl_namespace_context (TYPE_MAIN_DECL (current_class_type
));
9173 /* Friend functions are looked up in the containing namespace scope.
9174 We must enter that scope, to avoid finding member functions of the
9175 current class with same name. */
9176 push_nested_namespace (ns
);
9177 fns
= tsubst_expr (DECL_TI_TEMPLATE (decl
), args
,
9178 tf_warning_or_error
, NULL_TREE
,
9179 /*integral_constant_expression_p=*/false);
9180 pop_nested_namespace (ns
);
9181 arglist
= tsubst (DECL_TI_ARGS (decl
), args
,
9182 tf_warning_or_error
, NULL_TREE
);
9183 template_id
= lookup_template_function (fns
, arglist
);
9185 new_friend
= tsubst (decl
, args
, tf_warning_or_error
, NULL_TREE
);
9186 tmpl
= determine_specialization (template_id
, new_friend
,
9188 /*need_member_template=*/0,
9189 TREE_VEC_LENGTH (args
),
9191 return instantiate_template (tmpl
, new_args
, tf_error
);
9194 new_friend
= tsubst (decl
, args
, tf_warning_or_error
, NULL_TREE
);
9196 /* The NEW_FRIEND will look like an instantiation, to the
9197 compiler, but is not an instantiation from the point of view of
9198 the language. For example, we might have had:
9200 template <class T> struct S {
9201 template <class U> friend void f(T, U);
9204 Then, in S<int>, template <class U> void f(int, U) is not an
9205 instantiation of anything. */
9206 if (new_friend
== error_mark_node
)
9207 return error_mark_node
;
9209 DECL_USE_TEMPLATE (new_friend
) = 0;
9210 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
9212 DECL_USE_TEMPLATE (DECL_TEMPLATE_RESULT (new_friend
)) = 0;
9213 DECL_SAVED_TREE (DECL_TEMPLATE_RESULT (new_friend
))
9214 = DECL_SAVED_TREE (DECL_TEMPLATE_RESULT (decl
));
9217 /* The mangled name for the NEW_FRIEND is incorrect. The function
9218 is not a template instantiation and should not be mangled like
9219 one. Therefore, we forget the mangling here; we'll recompute it
9220 later if we need it. */
9221 if (TREE_CODE (new_friend
) != TEMPLATE_DECL
)
9223 SET_DECL_RTL (new_friend
, NULL
);
9224 SET_DECL_ASSEMBLER_NAME (new_friend
, NULL_TREE
);
9227 if (DECL_NAMESPACE_SCOPE_P (new_friend
))
9230 tree new_friend_template_info
;
9231 tree new_friend_result_template_info
;
9233 int new_friend_is_defn
;
9235 /* We must save some information from NEW_FRIEND before calling
9236 duplicate decls since that function will free NEW_FRIEND if
9238 new_friend_template_info
= DECL_TEMPLATE_INFO (new_friend
);
9239 new_friend_is_defn
=
9240 (DECL_INITIAL (DECL_TEMPLATE_RESULT
9241 (template_for_substitution (new_friend
)))
9243 if (TREE_CODE (new_friend
) == TEMPLATE_DECL
)
9245 /* This declaration is a `primary' template. */
9246 DECL_PRIMARY_TEMPLATE (new_friend
) = new_friend
;
9248 new_friend_result_template_info
9249 = DECL_TEMPLATE_INFO (DECL_TEMPLATE_RESULT (new_friend
));
9252 new_friend_result_template_info
= NULL_TREE
;
9254 /* Make the init_value nonzero so pushdecl knows this is a defn. */
9255 if (new_friend_is_defn
)
9256 DECL_INITIAL (new_friend
) = error_mark_node
;
9258 /* Inside pushdecl_namespace_level, we will push into the
9259 current namespace. However, the friend function should go
9260 into the namespace of the template. */
9261 ns
= decl_namespace_context (new_friend
);
9262 push_nested_namespace (ns
);
9263 old_decl
= pushdecl_namespace_level (new_friend
, /*is_friend=*/true);
9264 pop_nested_namespace (ns
);
9266 if (old_decl
== error_mark_node
)
9267 return error_mark_node
;
9269 if (old_decl
!= new_friend
)
9271 /* This new friend declaration matched an existing
9272 declaration. For example, given:
9274 template <class T> void f(T);
9275 template <class U> class C {
9276 template <class T> friend void f(T) {}
9279 the friend declaration actually provides the definition
9280 of `f', once C has been instantiated for some type. So,
9281 old_decl will be the out-of-class template declaration,
9282 while new_friend is the in-class definition.
9284 But, if `f' was called before this point, the
9285 instantiation of `f' will have DECL_TI_ARGS corresponding
9286 to `T' but not to `U', references to which might appear
9287 in the definition of `f'. Previously, the most general
9288 template for an instantiation of `f' was the out-of-class
9289 version; now it is the in-class version. Therefore, we
9290 run through all specialization of `f', adding to their
9291 DECL_TI_ARGS appropriately. In particular, they need a
9292 new set of outer arguments, corresponding to the
9293 arguments for this class instantiation.
9295 The same situation can arise with something like this:
9298 template <class T> class C {
9302 when `C<int>' is instantiated. Now, `f(int)' is defined
9305 if (!new_friend_is_defn
)
9306 /* On the other hand, if the in-class declaration does
9307 *not* provide a definition, then we don't want to alter
9308 existing definitions. We can just leave everything
9313 tree new_template
= TI_TEMPLATE (new_friend_template_info
);
9314 tree new_args
= TI_ARGS (new_friend_template_info
);
9316 /* Overwrite whatever template info was there before, if
9317 any, with the new template information pertaining to
9319 DECL_TEMPLATE_INFO (old_decl
) = new_friend_template_info
;
9321 if (TREE_CODE (old_decl
) != TEMPLATE_DECL
)
9323 /* We should have called reregister_specialization in
9325 gcc_assert (retrieve_specialization (new_template
,
9329 /* Instantiate it if the global has already been used. */
9330 if (DECL_ODR_USED (old_decl
))
9331 instantiate_decl (old_decl
, /*defer_ok=*/true,
9332 /*expl_inst_class_mem_p=*/false);
9338 /* Indicate that the old function template is a partial
9340 DECL_TEMPLATE_INFO (DECL_TEMPLATE_RESULT (old_decl
))
9341 = new_friend_result_template_info
;
9343 gcc_assert (new_template
9344 == most_general_template (new_template
));
9345 gcc_assert (new_template
!= old_decl
);
9347 /* Reassign any specializations already in the hash table
9348 to the new more general template, and add the
9349 additional template args. */
9350 for (t
= DECL_TEMPLATE_INSTANTIATIONS (old_decl
);
9354 tree spec
= TREE_VALUE (t
);
9357 elt
.tmpl
= old_decl
;
9358 elt
.args
= DECL_TI_ARGS (spec
);
9359 elt
.spec
= NULL_TREE
;
9361 decl_specializations
->remove_elt (&elt
);
9364 = add_outermost_template_args (new_args
,
9365 DECL_TI_ARGS (spec
));
9367 register_specialization
9368 (spec
, new_template
, DECL_TI_ARGS (spec
), true, 0);
9371 DECL_TEMPLATE_INSTANTIATIONS (old_decl
) = NULL_TREE
;
9375 /* The information from NEW_FRIEND has been merged into OLD_DECL
9376 by duplicate_decls. */
9377 new_friend
= old_decl
;
9382 tree context
= DECL_CONTEXT (new_friend
);
9386 template <class T> class C {
9387 template <class U> friend void C1<U>::f (); // case 1
9388 friend void C2<T>::f (); // case 2
9390 we only need to make sure CONTEXT is a complete type for
9391 case 2. To distinguish between the two cases, we note that
9392 CONTEXT of case 1 remains dependent type after tsubst while
9393 this isn't true for case 2. */
9394 ++processing_template_decl
;
9395 dependent_p
= dependent_type_p (context
);
9396 --processing_template_decl
;
9399 && !complete_type_or_else (context
, NULL_TREE
))
9400 return error_mark_node
;
9402 if (COMPLETE_TYPE_P (context
))
9404 tree fn
= new_friend
;
9405 /* do_friend adds the TEMPLATE_DECL for any member friend
9406 template even if it isn't a member template, i.e.
9407 template <class T> friend A<T>::f();
9408 Look through it in that case. */
9409 if (TREE_CODE (fn
) == TEMPLATE_DECL
9410 && !PRIMARY_TEMPLATE_P (fn
))
9411 fn
= DECL_TEMPLATE_RESULT (fn
);
9412 /* Check to see that the declaration is really present, and,
9413 possibly obtain an improved declaration. */
9414 fn
= check_classfn (context
, fn
, NULL_TREE
);
9424 /* FRIEND_TMPL is a friend TEMPLATE_DECL. ARGS is the vector of
9425 template arguments, as for tsubst.
9427 Returns an appropriate tsubst'd friend type or error_mark_node on
9431 tsubst_friend_class (tree friend_tmpl
, tree args
)
9437 if (DECL_TEMPLATE_TEMPLATE_PARM_P (friend_tmpl
))
9439 tree t
= tsubst (TREE_TYPE (friend_tmpl
), args
, tf_none
, NULL_TREE
);
9440 return TREE_TYPE (t
);
9443 context
= CP_DECL_CONTEXT (friend_tmpl
);
9445 if (context
!= global_namespace
)
9447 if (TREE_CODE (context
) == NAMESPACE_DECL
)
9448 push_nested_namespace (context
);
9450 push_nested_class (tsubst (context
, args
, tf_none
, NULL_TREE
));
9453 /* Look for a class template declaration. We look for hidden names
9454 because two friend declarations of the same template are the
9455 same. For example, in:
9458 template <typename> friend class F;
9460 template <typename> struct B {
9461 template <typename> friend class F;
9464 both F templates are the same. */
9465 tmpl
= lookup_name_real (DECL_NAME (friend_tmpl
), 0, 0,
9466 /*block_p=*/true, 0, LOOKUP_HIDDEN
);
9468 /* But, if we don't find one, it might be because we're in a
9469 situation like this:
9477 Here, in the scope of (say) S<int>, `S' is bound to a TYPE_DECL
9478 for `S<int>', not the TEMPLATE_DECL. */
9479 if (!tmpl
|| !DECL_CLASS_TEMPLATE_P (tmpl
))
9481 tmpl
= lookup_name_prefer_type (DECL_NAME (friend_tmpl
), 1);
9482 tmpl
= maybe_get_template_decl_from_type_decl (tmpl
);
9485 if (tmpl
&& DECL_CLASS_TEMPLATE_P (tmpl
))
9487 /* The friend template has already been declared. Just
9488 check to see that the declarations match, and install any new
9489 default parameters. We must tsubst the default parameters,
9490 of course. We only need the innermost template parameters
9491 because that is all that redeclare_class_template will look
9493 if (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (friend_tmpl
))
9494 > TMPL_ARGS_DEPTH (args
))
9497 location_t saved_input_location
;
9498 parms
= tsubst_template_parms (DECL_TEMPLATE_PARMS (friend_tmpl
),
9499 args
, tf_warning_or_error
);
9501 saved_input_location
= input_location
;
9502 input_location
= DECL_SOURCE_LOCATION (friend_tmpl
);
9503 tree cons
= get_constraints (tmpl
);
9504 redeclare_class_template (TREE_TYPE (tmpl
), parms
, cons
);
9505 input_location
= saved_input_location
;
9509 friend_type
= TREE_TYPE (tmpl
);
9513 /* The friend template has not already been declared. In this
9514 case, the instantiation of the template class will cause the
9515 injection of this template into the global scope. */
9516 tmpl
= tsubst (friend_tmpl
, args
, tf_warning_or_error
, NULL_TREE
);
9517 if (tmpl
== error_mark_node
)
9518 return error_mark_node
;
9520 /* The new TMPL is not an instantiation of anything, so we
9521 forget its origins. We don't reset CLASSTYPE_TI_TEMPLATE for
9522 the new type because that is supposed to be the corresponding
9523 template decl, i.e., TMPL. */
9524 DECL_USE_TEMPLATE (tmpl
) = 0;
9525 DECL_TEMPLATE_INFO (tmpl
) = NULL_TREE
;
9526 CLASSTYPE_USE_TEMPLATE (TREE_TYPE (tmpl
)) = 0;
9527 CLASSTYPE_TI_ARGS (TREE_TYPE (tmpl
))
9528 = INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (TREE_TYPE (tmpl
)));
9530 /* Inject this template into the global scope. */
9531 friend_type
= TREE_TYPE (pushdecl_top_level_maybe_friend (tmpl
, true));
9534 if (context
!= global_namespace
)
9536 if (TREE_CODE (context
) == NAMESPACE_DECL
)
9537 pop_nested_namespace (context
);
9539 pop_nested_class ();
9545 /* Returns zero if TYPE cannot be completed later due to circularity.
9546 Otherwise returns one. */
9549 can_complete_type_without_circularity (tree type
)
9551 if (type
== NULL_TREE
|| type
== error_mark_node
)
9553 else if (COMPLETE_TYPE_P (type
))
9555 else if (TREE_CODE (type
) == ARRAY_TYPE
&& TYPE_DOMAIN (type
))
9556 return can_complete_type_without_circularity (TREE_TYPE (type
));
9557 else if (CLASS_TYPE_P (type
)
9558 && TYPE_BEING_DEFINED (TYPE_MAIN_VARIANT (type
)))
9564 static tree
tsubst_omp_clauses (tree
, bool, bool, tree
, tsubst_flags_t
, tree
);
9566 /* Instantiate a single dependent attribute T (a TREE_LIST), and return either
9567 T or a new TREE_LIST, possibly a chain in the case of a pack expansion. */
9570 tsubst_attribute (tree t
, tree
*decl_p
, tree args
,
9571 tsubst_flags_t complain
, tree in_decl
)
9573 gcc_assert (ATTR_IS_DEPENDENT (t
));
9575 tree val
= TREE_VALUE (t
);
9576 if (val
== NULL_TREE
)
9577 /* Nothing to do. */;
9578 else if ((flag_openmp
|| flag_openmp_simd
|| flag_cilkplus
)
9579 && is_attribute_p ("omp declare simd",
9580 get_attribute_name (t
)))
9582 tree clauses
= TREE_VALUE (val
);
9583 clauses
= tsubst_omp_clauses (clauses
, true, false, args
,
9585 c_omp_declare_simd_clauses_to_decls (*decl_p
, clauses
);
9586 clauses
= finish_omp_clauses (clauses
, false, true);
9587 tree parms
= DECL_ARGUMENTS (*decl_p
);
9589 = c_omp_declare_simd_clauses_to_numbers (parms
, clauses
);
9591 val
= build_tree_list (NULL_TREE
, clauses
);
9595 /* If the first attribute argument is an identifier, don't
9596 pass it through tsubst. Attributes like mode, format,
9597 cleanup and several target specific attributes expect it
9599 else if (attribute_takes_identifier_p (get_attribute_name (t
)))
9602 = tsubst_expr (TREE_CHAIN (val
), args
, complain
, in_decl
,
9603 /*integral_constant_expression_p=*/false);
9604 if (chain
!= TREE_CHAIN (val
))
9605 val
= tree_cons (NULL_TREE
, TREE_VALUE (val
), chain
);
9607 else if (PACK_EXPANSION_P (val
))
9609 /* An attribute pack expansion. */
9610 tree purp
= TREE_PURPOSE (t
);
9611 tree pack
= tsubst_pack_expansion (val
, args
, complain
, in_decl
);
9612 int len
= TREE_VEC_LENGTH (pack
);
9613 tree list
= NULL_TREE
;
9615 for (int i
= 0; i
< len
; ++i
)
9617 tree elt
= TREE_VEC_ELT (pack
, i
);
9618 *q
= build_tree_list (purp
, elt
);
9619 q
= &TREE_CHAIN (*q
);
9624 val
= tsubst_expr (val
, args
, complain
, in_decl
,
9625 /*integral_constant_expression_p=*/false);
9627 if (val
!= TREE_VALUE (t
))
9628 return build_tree_list (TREE_PURPOSE (t
), val
);
9632 /* Instantiate any dependent attributes in ATTRIBUTES, returning either it
9633 unchanged or a new TREE_LIST chain. */
9636 tsubst_attributes (tree attributes
, tree args
,
9637 tsubst_flags_t complain
, tree in_decl
)
9639 tree last_dep
= NULL_TREE
;
9641 for (tree t
= attributes
; t
; t
= TREE_CHAIN (t
))
9642 if (ATTR_IS_DEPENDENT (t
))
9645 attributes
= copy_list (attributes
);
9650 for (tree
*p
= &attributes
; *p
; p
= &TREE_CHAIN (*p
))
9653 if (ATTR_IS_DEPENDENT (t
))
9655 tree subst
= tsubst_attribute (t
, NULL
, args
, complain
, in_decl
);
9660 p
= &TREE_CHAIN (*p
);
9662 *p
= TREE_CHAIN (t
);
9669 /* Apply any attributes which had to be deferred until instantiation
9670 time. DECL_P, ATTRIBUTES and ATTR_FLAGS are as cplus_decl_attributes;
9671 ARGS, COMPLAIN, IN_DECL are as tsubst. */
9674 apply_late_template_attributes (tree
*decl_p
, tree attributes
, int attr_flags
,
9675 tree args
, tsubst_flags_t complain
, tree in_decl
)
9677 tree last_dep
= NULL_TREE
;
9681 for (t
= attributes
; t
; t
= TREE_CHAIN (t
))
9682 if (ATTR_IS_DEPENDENT (t
))
9685 attributes
= copy_list (attributes
);
9689 if (DECL_P (*decl_p
))
9691 if (TREE_TYPE (*decl_p
) == error_mark_node
)
9693 p
= &DECL_ATTRIBUTES (*decl_p
);
9696 p
= &TYPE_ATTRIBUTES (*decl_p
);
9700 tree late_attrs
= NULL_TREE
;
9701 tree
*q
= &late_attrs
;
9703 for (*p
= attributes
; *p
; )
9706 if (ATTR_IS_DEPENDENT (t
))
9708 *p
= TREE_CHAIN (t
);
9709 TREE_CHAIN (t
) = NULL_TREE
;
9710 *q
= tsubst_attribute (t
, decl_p
, args
, complain
, in_decl
);
9712 q
= &TREE_CHAIN (*q
);
9716 p
= &TREE_CHAIN (t
);
9719 cplus_decl_attributes (decl_p
, late_attrs
, attr_flags
);
9723 /* Perform (or defer) access check for typedefs that were referenced
9724 from within the template TMPL code.
9725 This is a subroutine of instantiate_decl and instantiate_class_template.
9726 TMPL is the template to consider and TARGS is the list of arguments of
9730 perform_typedefs_access_check (tree tmpl
, tree targs
)
9732 location_t saved_location
;
9734 qualified_typedef_usage_t
*iter
;
9737 || (!CLASS_TYPE_P (tmpl
)
9738 && TREE_CODE (tmpl
) != FUNCTION_DECL
))
9741 saved_location
= input_location
;
9742 FOR_EACH_VEC_SAFE_ELT (get_types_needing_access_check (tmpl
), i
, iter
)
9744 tree type_decl
= iter
->typedef_decl
;
9745 tree type_scope
= iter
->context
;
9747 if (!type_decl
|| !type_scope
|| !CLASS_TYPE_P (type_scope
))
9750 if (uses_template_parms (type_decl
))
9751 type_decl
= tsubst (type_decl
, targs
, tf_error
, NULL_TREE
);
9752 if (uses_template_parms (type_scope
))
9753 type_scope
= tsubst (type_scope
, targs
, tf_error
, NULL_TREE
);
9755 /* Make access check error messages point to the location
9756 of the use of the typedef. */
9757 input_location
= iter
->locus
;
9758 perform_or_defer_access_check (TYPE_BINFO (type_scope
),
9759 type_decl
, type_decl
,
9760 tf_warning_or_error
);
9762 input_location
= saved_location
;
9766 instantiate_class_template_1 (tree type
)
9768 tree templ
, args
, pattern
, t
, member
;
9772 unsigned int saved_maximum_field_alignment
;
9775 if (type
== error_mark_node
)
9776 return error_mark_node
;
9778 if (COMPLETE_OR_OPEN_TYPE_P (type
)
9779 || uses_template_parms (type
))
9782 /* Figure out which template is being instantiated. */
9783 templ
= most_general_template (CLASSTYPE_TI_TEMPLATE (type
));
9784 gcc_assert (TREE_CODE (templ
) == TEMPLATE_DECL
);
9786 /* Determine what specialization of the original template to
9788 t
= most_specialized_partial_spec (type
, tf_warning_or_error
);
9789 if (t
== error_mark_node
)
9791 TYPE_BEING_DEFINED (type
) = 1;
9792 return error_mark_node
;
9796 /* This TYPE is actually an instantiation of a partial
9797 specialization. We replace the innermost set of ARGS with
9798 the arguments appropriate for substitution. For example,
9801 template <class T> struct S {};
9802 template <class T> struct S<T*> {};
9804 and supposing that we are instantiating S<int*>, ARGS will
9805 presently be {int*} -- but we need {int}. */
9806 pattern
= TREE_TYPE (t
);
9807 args
= TREE_PURPOSE (t
);
9811 pattern
= TREE_TYPE (templ
);
9812 args
= CLASSTYPE_TI_ARGS (type
);
9815 /* If the template we're instantiating is incomplete, then clearly
9816 there's nothing we can do. */
9817 if (!COMPLETE_TYPE_P (pattern
))
9820 /* If we've recursively instantiated too many templates, stop. */
9821 if (! push_tinst_level (type
))
9824 /* Now we're really doing the instantiation. Mark the type as in
9825 the process of being defined. */
9826 TYPE_BEING_DEFINED (type
) = 1;
9828 /* We may be in the middle of deferred access check. Disable
9830 push_deferring_access_checks (dk_no_deferred
);
9832 int saved_unevaluated_operand
= cp_unevaluated_operand
;
9833 int saved_inhibit_evaluation_warnings
= c_inhibit_evaluation_warnings
;
9835 fn_context
= decl_function_context (TYPE_MAIN_DECL (type
));
9836 /* Also avoid push_to_top_level for a lambda in an NSDMI. */
9837 if (!fn_context
&& LAMBDA_TYPE_P (type
) && TYPE_CLASS_SCOPE_P (type
))
9838 fn_context
= error_mark_node
;
9840 push_to_top_level ();
9843 cp_unevaluated_operand
= 0;
9844 c_inhibit_evaluation_warnings
= 0;
9846 /* Use #pragma pack from the template context. */
9847 saved_maximum_field_alignment
= maximum_field_alignment
;
9848 maximum_field_alignment
= TYPE_PRECISION (pattern
);
9850 SET_CLASSTYPE_INTERFACE_UNKNOWN (type
);
9852 /* Set the input location to the most specialized template definition.
9853 This is needed if tsubsting causes an error. */
9854 typedecl
= TYPE_MAIN_DECL (pattern
);
9855 input_location
= DECL_SOURCE_LOCATION (TYPE_NAME (type
)) =
9856 DECL_SOURCE_LOCATION (typedecl
);
9858 TYPE_PACKED (type
) = TYPE_PACKED (pattern
);
9859 SET_TYPE_ALIGN (type
, TYPE_ALIGN (pattern
));
9860 TYPE_USER_ALIGN (type
) = TYPE_USER_ALIGN (pattern
);
9861 TYPE_FOR_JAVA (type
) = TYPE_FOR_JAVA (pattern
); /* For libjava's JArray<T> */
9862 if (ANON_AGGR_TYPE_P (pattern
))
9863 SET_ANON_AGGR_TYPE_P (type
);
9864 if (CLASSTYPE_VISIBILITY_SPECIFIED (pattern
))
9866 CLASSTYPE_VISIBILITY_SPECIFIED (type
) = 1;
9867 CLASSTYPE_VISIBILITY (type
) = CLASSTYPE_VISIBILITY (pattern
);
9868 /* Adjust visibility for template arguments. */
9869 determine_visibility (TYPE_MAIN_DECL (type
));
9871 if (CLASS_TYPE_P (type
))
9872 CLASSTYPE_FINAL (type
) = CLASSTYPE_FINAL (pattern
);
9874 pbinfo
= TYPE_BINFO (pattern
);
9876 /* We should never instantiate a nested class before its enclosing
9877 class; we need to look up the nested class by name before we can
9878 instantiate it, and that lookup should instantiate the enclosing
9880 gcc_assert (!DECL_CLASS_SCOPE_P (TYPE_MAIN_DECL (pattern
))
9881 || COMPLETE_OR_OPEN_TYPE_P (TYPE_CONTEXT (type
)));
9883 base_list
= NULL_TREE
;
9884 if (BINFO_N_BASE_BINFOS (pbinfo
))
9890 /* We must enter the scope containing the type, as that is where
9891 the accessibility of types named in dependent bases are
9893 pushed_scope
= push_scope (CP_TYPE_CONTEXT (type
));
9895 /* Substitute into each of the bases to determine the actual
9897 for (i
= 0; BINFO_BASE_ITERATE (pbinfo
, i
, pbase_binfo
); i
++)
9900 tree access
= BINFO_BASE_ACCESS (pbinfo
, i
);
9901 tree expanded_bases
= NULL_TREE
;
9904 if (PACK_EXPANSION_P (BINFO_TYPE (pbase_binfo
)))
9907 tsubst_pack_expansion (BINFO_TYPE (pbase_binfo
),
9908 args
, tf_error
, NULL_TREE
);
9909 if (expanded_bases
== error_mark_node
)
9912 len
= TREE_VEC_LENGTH (expanded_bases
);
9915 for (idx
= 0; idx
< len
; idx
++)
9918 /* Extract the already-expanded base class. */
9919 base
= TREE_VEC_ELT (expanded_bases
, idx
);
9921 /* Substitute to figure out the base class. */
9922 base
= tsubst (BINFO_TYPE (pbase_binfo
), args
, tf_error
,
9925 if (base
== error_mark_node
)
9928 base_list
= tree_cons (access
, base
, base_list
);
9929 if (BINFO_VIRTUAL_P (pbase_binfo
))
9930 TREE_TYPE (base_list
) = integer_type_node
;
9934 /* The list is now in reverse order; correct that. */
9935 base_list
= nreverse (base_list
);
9938 pop_scope (pushed_scope
);
9940 /* Now call xref_basetypes to set up all the base-class
9942 xref_basetypes (type
, base_list
);
9944 apply_late_template_attributes (&type
, TYPE_ATTRIBUTES (pattern
),
9945 (int) ATTR_FLAG_TYPE_IN_PLACE
,
9946 args
, tf_error
, NULL_TREE
);
9947 fixup_attribute_variants (type
);
9949 /* Now that our base classes are set up, enter the scope of the
9950 class, so that name lookups into base classes, etc. will work
9951 correctly. This is precisely analogous to what we do in
9952 begin_class_definition when defining an ordinary non-template
9953 class, except we also need to push the enclosing classes. */
9954 push_nested_class (type
);
9956 /* Now members are processed in the order of declaration. */
9957 for (member
= CLASSTYPE_DECL_LIST (pattern
);
9958 member
; member
= TREE_CHAIN (member
))
9960 tree t
= TREE_VALUE (member
);
9962 if (TREE_PURPOSE (member
))
9966 /* Build new CLASSTYPE_NESTED_UTDS. */
9969 bool class_template_p
;
9971 class_template_p
= (TREE_CODE (t
) != ENUMERAL_TYPE
9972 && TYPE_LANG_SPECIFIC (t
)
9973 && CLASSTYPE_IS_TEMPLATE (t
));
9974 /* If the member is a class template, then -- even after
9975 substitution -- there may be dependent types in the
9976 template argument list for the class. We increment
9977 PROCESSING_TEMPLATE_DECL so that dependent_type_p, as
9978 that function will assume that no types are dependent
9979 when outside of a template. */
9980 if (class_template_p
)
9981 ++processing_template_decl
;
9982 newtag
= tsubst (t
, args
, tf_error
, NULL_TREE
);
9983 if (class_template_p
)
9984 --processing_template_decl
;
9985 if (newtag
== error_mark_node
)
9988 if (TREE_CODE (newtag
) != ENUMERAL_TYPE
)
9990 tree name
= TYPE_IDENTIFIER (t
);
9992 if (class_template_p
)
9993 /* Unfortunately, lookup_template_class sets
9994 CLASSTYPE_IMPLICIT_INSTANTIATION for a partial
9995 instantiation (i.e., for the type of a member
9996 template class nested within a template class.)
9997 This behavior is required for
9998 maybe_process_partial_specialization to work
9999 correctly, but is not accurate in this case;
10000 the TAG is not an instantiation of anything.
10001 (The corresponding TEMPLATE_DECL is an
10002 instantiation, but the TYPE is not.) */
10003 CLASSTYPE_USE_TEMPLATE (newtag
) = 0;
10005 /* Now, we call pushtag to put this NEWTAG into the scope of
10006 TYPE. We first set up the IDENTIFIER_TYPE_VALUE to avoid
10007 pushtag calling push_template_decl. We don't have to do
10008 this for enums because it will already have been done in
10011 SET_IDENTIFIER_TYPE_VALUE (name
, newtag
);
10012 pushtag (name
, newtag
, /*tag_scope=*/ts_current
);
10015 else if (DECL_DECLARES_FUNCTION_P (t
))
10017 /* Build new TYPE_METHODS. */
10020 if (TREE_CODE (t
) == TEMPLATE_DECL
)
10021 ++processing_template_decl
;
10022 r
= tsubst (t
, args
, tf_error
, NULL_TREE
);
10023 if (TREE_CODE (t
) == TEMPLATE_DECL
)
10024 --processing_template_decl
;
10025 set_current_access_from_decl (r
);
10026 finish_member_declaration (r
);
10027 /* Instantiate members marked with attribute used. */
10028 if (r
!= error_mark_node
&& DECL_PRESERVE_P (r
))
10030 if (TREE_CODE (r
) == FUNCTION_DECL
10031 && DECL_OMP_DECLARE_REDUCTION_P (r
))
10032 cp_check_omp_declare_reduction (r
);
10034 else if (DECL_CLASS_TEMPLATE_P (t
)
10035 && LAMBDA_TYPE_P (TREE_TYPE (t
)))
10036 /* A closure type for a lambda in a default argument for a
10037 member template. Ignore it; it will be instantiated with
10038 the default argument. */;
10041 /* Build new TYPE_FIELDS. */
10042 if (TREE_CODE (t
) == STATIC_ASSERT
)
10046 ++c_inhibit_evaluation_warnings
;
10048 tsubst_expr (STATIC_ASSERT_CONDITION (t
), args
,
10049 tf_warning_or_error
, NULL_TREE
,
10050 /*integral_constant_expression_p=*/true);
10051 --c_inhibit_evaluation_warnings
;
10053 finish_static_assert (condition
,
10054 STATIC_ASSERT_MESSAGE (t
),
10055 STATIC_ASSERT_SOURCE_LOCATION (t
),
10056 /*member_p=*/true);
10058 else if (TREE_CODE (t
) != CONST_DECL
)
10061 tree vec
= NULL_TREE
;
10064 /* The file and line for this declaration, to
10065 assist in error message reporting. Since we
10066 called push_tinst_level above, we don't need to
10068 input_location
= DECL_SOURCE_LOCATION (t
);
10070 if (TREE_CODE (t
) == TEMPLATE_DECL
)
10071 ++processing_template_decl
;
10072 r
= tsubst (t
, args
, tf_warning_or_error
, NULL_TREE
);
10073 if (TREE_CODE (t
) == TEMPLATE_DECL
)
10074 --processing_template_decl
;
10076 if (TREE_CODE (r
) == TREE_VEC
)
10078 /* A capture pack became multiple fields. */
10080 len
= TREE_VEC_LENGTH (vec
);
10083 for (int i
= 0; i
< len
; ++i
)
10086 r
= TREE_VEC_ELT (vec
, i
);
10091 [t]he initialization (and any associated
10092 side-effects) of a static data member does
10093 not occur unless the static data member is
10094 itself used in a way that requires the
10095 definition of the static data member to
10098 Therefore, we do not substitute into the
10099 initialized for the static data member here. */
10100 finish_static_data_member_decl
10102 /*init=*/NULL_TREE
,
10103 /*init_const_expr_p=*/false,
10104 /*asmspec_tree=*/NULL_TREE
,
10106 /* Instantiate members marked with attribute used. */
10107 if (r
!= error_mark_node
&& DECL_PRESERVE_P (r
))
10110 else if (TREE_CODE (r
) == FIELD_DECL
)
10112 /* Determine whether R has a valid type and can be
10113 completed later. If R is invalid, then its type
10114 is replaced by error_mark_node. */
10115 tree rtype
= TREE_TYPE (r
);
10116 if (can_complete_type_without_circularity (rtype
))
10117 complete_type (rtype
);
10119 if (TREE_CODE (r
) == FIELD_DECL
10120 && TREE_CODE (rtype
) == ARRAY_TYPE
10121 && COMPLETE_TYPE_P (TREE_TYPE (rtype
))
10122 && !COMPLETE_TYPE_P (rtype
))
10124 /* Flexible array mmembers of elements
10125 of complete type have an incomplete type
10126 and that's okay. */
10128 else if (!COMPLETE_TYPE_P (rtype
))
10130 cxx_incomplete_type_error (r
, rtype
);
10131 TREE_TYPE (r
) = error_mark_node
;
10135 /* If it is a TYPE_DECL for a class-scoped ENUMERAL_TYPE,
10136 such a thing will already have been added to the field
10137 list by tsubst_enum in finish_member_declaration in the
10138 CLASSTYPE_NESTED_UTDS case above. */
10139 if (!(TREE_CODE (r
) == TYPE_DECL
10140 && TREE_CODE (TREE_TYPE (r
)) == ENUMERAL_TYPE
10141 && DECL_ARTIFICIAL (r
)))
10143 set_current_access_from_decl (r
);
10144 finish_member_declaration (r
);
10152 if (TYPE_P (t
) || DECL_CLASS_TEMPLATE_P (t
)
10153 || DECL_TEMPLATE_TEMPLATE_PARM_P (t
))
10155 /* Build new CLASSTYPE_FRIEND_CLASSES. */
10157 tree friend_type
= t
;
10158 bool adjust_processing_template_decl
= false;
10160 if (TREE_CODE (friend_type
) == TEMPLATE_DECL
)
10162 /* template <class T> friend class C; */
10163 friend_type
= tsubst_friend_class (friend_type
, args
);
10164 adjust_processing_template_decl
= true;
10166 else if (TREE_CODE (friend_type
) == UNBOUND_CLASS_TEMPLATE
)
10168 /* template <class T> friend class C::D; */
10169 friend_type
= tsubst (friend_type
, args
,
10170 tf_warning_or_error
, NULL_TREE
);
10171 if (TREE_CODE (friend_type
) == TEMPLATE_DECL
)
10172 friend_type
= TREE_TYPE (friend_type
);
10173 adjust_processing_template_decl
= true;
10175 else if (TREE_CODE (friend_type
) == TYPENAME_TYPE
10176 || TREE_CODE (friend_type
) == TEMPLATE_TYPE_PARM
)
10178 /* This could be either
10182 when dependent_type_p is false or
10184 template <class U> friend class T::C;
10187 /* Bump processing_template_decl in case this is something like
10188 template <class T> friend struct A<T>::B. */
10189 ++processing_template_decl
;
10190 friend_type
= tsubst (friend_type
, args
,
10191 tf_warning_or_error
, NULL_TREE
);
10192 if (dependent_type_p (friend_type
))
10193 adjust_processing_template_decl
= true;
10194 --processing_template_decl
;
10196 else if (!CLASSTYPE_USE_TEMPLATE (friend_type
)
10197 && hidden_name_p (TYPE_NAME (friend_type
)))
10201 where C hasn't been declared yet. Let's lookup name
10202 from namespace scope directly, bypassing any name that
10203 come from dependent base class. */
10204 tree ns
= decl_namespace_context (TYPE_MAIN_DECL (friend_type
));
10206 /* The call to xref_tag_from_type does injection for friend
10208 push_nested_namespace (ns
);
10210 xref_tag_from_type (friend_type
, NULL_TREE
,
10211 /*tag_scope=*/ts_current
);
10212 pop_nested_namespace (ns
);
10214 else if (uses_template_parms (friend_type
))
10215 /* friend class C<T>; */
10216 friend_type
= tsubst (friend_type
, args
,
10217 tf_warning_or_error
, NULL_TREE
);
10222 where C is already declared or
10224 friend class C<int>;
10226 We don't have to do anything in these cases. */
10228 if (adjust_processing_template_decl
)
10229 /* Trick make_friend_class into realizing that the friend
10230 we're adding is a template, not an ordinary class. It's
10231 important that we use make_friend_class since it will
10232 perform some error-checking and output cross-reference
10234 ++processing_template_decl
;
10236 if (friend_type
!= error_mark_node
)
10237 make_friend_class (type
, friend_type
, /*complain=*/false);
10239 if (adjust_processing_template_decl
)
10240 --processing_template_decl
;
10244 /* Build new DECL_FRIENDLIST. */
10247 /* The file and line for this declaration, to
10248 assist in error message reporting. Since we
10249 called push_tinst_level above, we don't need to
10251 input_location
= DECL_SOURCE_LOCATION (t
);
10253 if (TREE_CODE (t
) == TEMPLATE_DECL
)
10255 ++processing_template_decl
;
10256 push_deferring_access_checks (dk_no_check
);
10259 r
= tsubst_friend_function (t
, args
);
10260 add_friend (type
, r
, /*complain=*/false);
10261 if (TREE_CODE (t
) == TEMPLATE_DECL
)
10263 pop_deferring_access_checks ();
10264 --processing_template_decl
;
10272 /* Restore these before substituting into the lambda capture
10274 cp_unevaluated_operand
= saved_unevaluated_operand
;
10275 c_inhibit_evaluation_warnings
= saved_inhibit_evaluation_warnings
;
10278 if (tree expr
= CLASSTYPE_LAMBDA_EXPR (type
))
10280 tree decl
= lambda_function (type
);
10283 if (!DECL_TEMPLATE_INFO (decl
)
10284 || DECL_TEMPLATE_RESULT (DECL_TI_TEMPLATE (decl
)) != decl
)
10286 /* Set function_depth to avoid garbage collection. */
10288 instantiate_decl (decl
, false, false);
10292 /* We need to instantiate the capture list from the template
10293 after we've instantiated the closure members, but before we
10294 consider adding the conversion op. Also keep any captures
10295 that may have been added during instantiation of the op(). */
10296 tree tmpl_expr
= CLASSTYPE_LAMBDA_EXPR (pattern
);
10298 = tsubst_copy_and_build (LAMBDA_EXPR_CAPTURE_LIST (tmpl_expr
),
10299 args
, tf_warning_or_error
, NULL_TREE
,
10302 LAMBDA_EXPR_CAPTURE_LIST (expr
)
10303 = chainon (tmpl_cap
, nreverse (LAMBDA_EXPR_CAPTURE_LIST (expr
)));
10305 maybe_add_lambda_conv_op (type
);
10308 gcc_assert (errorcount
);
10311 /* Set the file and line number information to whatever is given for
10312 the class itself. This puts error messages involving generated
10313 implicit functions at a predictable point, and the same point
10314 that would be used for non-template classes. */
10315 input_location
= DECL_SOURCE_LOCATION (typedecl
);
10317 unreverse_member_declarations (type
);
10318 finish_struct_1 (type
);
10319 TYPE_BEING_DEFINED (type
) = 0;
10321 /* We don't instantiate default arguments for member functions. 14.7.1:
10323 The implicit instantiation of a class template specialization causes
10324 the implicit instantiation of the declarations, but not of the
10325 definitions or default arguments, of the class member functions,
10326 member classes, static data members and member templates.... */
10328 /* Some typedefs referenced from within the template code need to be access
10329 checked at template instantiation time, i.e now. These types were
10330 added to the template at parsing time. Let's get those and perform
10331 the access checks then. */
10332 perform_typedefs_access_check (pattern
, args
);
10333 perform_deferred_access_checks (tf_warning_or_error
);
10334 pop_nested_class ();
10335 maximum_field_alignment
= saved_maximum_field_alignment
;
10337 pop_from_top_level ();
10338 pop_deferring_access_checks ();
10339 pop_tinst_level ();
10341 /* The vtable for a template class can be emitted in any translation
10342 unit in which the class is instantiated. When there is no key
10343 method, however, finish_struct_1 will already have added TYPE to
10344 the keyed_classes list. */
10345 if (TYPE_CONTAINS_VPTR_P (type
) && CLASSTYPE_KEY_METHOD (type
))
10346 keyed_classes
= tree_cons (NULL_TREE
, type
, keyed_classes
);
10351 /* Wrapper for instantiate_class_template_1. */
10354 instantiate_class_template (tree type
)
10357 timevar_push (TV_TEMPLATE_INST
);
10358 ret
= instantiate_class_template_1 (type
);
10359 timevar_pop (TV_TEMPLATE_INST
);
10364 tsubst_template_arg (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
10370 else if (TYPE_P (t
))
10371 r
= tsubst (t
, args
, complain
, in_decl
);
10374 if (!(complain
& tf_warning
))
10375 ++c_inhibit_evaluation_warnings
;
10376 r
= tsubst_expr (t
, args
, complain
, in_decl
,
10377 /*integral_constant_expression_p=*/true);
10378 if (!(complain
& tf_warning
))
10379 --c_inhibit_evaluation_warnings
;
10384 /* Given a function parameter pack TMPL_PARM and some function parameters
10385 instantiated from it at *SPEC_P, return a NONTYPE_ARGUMENT_PACK of them
10386 and set *SPEC_P to point at the next point in the list. */
10389 extract_fnparm_pack (tree tmpl_parm
, tree
*spec_p
)
10391 /* Collect all of the extra "packed" parameters into an
10395 tree argpack
= make_node (NONTYPE_ARGUMENT_PACK
);
10396 tree argtypepack
= cxx_make_type (TYPE_ARGUMENT_PACK
);
10397 tree spec_parm
= *spec_p
;
10400 for (len
= 0; spec_parm
; ++len
, spec_parm
= TREE_CHAIN (spec_parm
))
10402 && !function_parameter_expanded_from_pack_p (spec_parm
, tmpl_parm
))
10405 /* Fill in PARMVEC and PARMTYPEVEC with all of the parameters. */
10406 parmvec
= make_tree_vec (len
);
10407 parmtypevec
= make_tree_vec (len
);
10408 spec_parm
= *spec_p
;
10409 for (i
= 0; i
< len
; i
++, spec_parm
= DECL_CHAIN (spec_parm
))
10411 TREE_VEC_ELT (parmvec
, i
) = spec_parm
;
10412 TREE_VEC_ELT (parmtypevec
, i
) = TREE_TYPE (spec_parm
);
10415 /* Build the argument packs. */
10416 SET_ARGUMENT_PACK_ARGS (argpack
, parmvec
);
10417 SET_ARGUMENT_PACK_ARGS (argtypepack
, parmtypevec
);
10418 TREE_TYPE (argpack
) = argtypepack
;
10419 *spec_p
= spec_parm
;
10424 /* Give a chain SPEC_PARM of PARM_DECLs, pack them into a
10425 NONTYPE_ARGUMENT_PACK. */
10428 make_fnparm_pack (tree spec_parm
)
10430 return extract_fnparm_pack (NULL_TREE
, &spec_parm
);
10433 /* Return 1 if the Ith element of the argument pack ARG_PACK is a
10434 pack expansion with no extra args, 2 if it has extra args, or 0
10435 if it is not a pack expansion. */
10438 argument_pack_element_is_expansion_p (tree arg_pack
, int i
)
10440 tree vec
= ARGUMENT_PACK_ARGS (arg_pack
);
10441 if (i
>= TREE_VEC_LENGTH (vec
))
10443 tree elt
= TREE_VEC_ELT (vec
, i
);
10445 /* A decl pack is itself an expansion. */
10446 elt
= TREE_TYPE (elt
);
10447 if (!PACK_EXPANSION_P (elt
))
10449 if (PACK_EXPANSION_EXTRA_ARGS (elt
))
10455 /* Creates and return an ARGUMENT_PACK_SELECT tree node. */
10458 make_argument_pack_select (tree arg_pack
, unsigned index
)
10460 tree aps
= make_node (ARGUMENT_PACK_SELECT
);
10462 ARGUMENT_PACK_SELECT_FROM_PACK (aps
) = arg_pack
;
10463 ARGUMENT_PACK_SELECT_INDEX (aps
) = index
;
10468 /* This is a subroutine of tsubst_pack_expansion.
10470 It returns TRUE if we need to use the PACK_EXPANSION_EXTRA_ARGS
10471 mechanism to store the (non complete list of) arguments of the
10472 substitution and return a non substituted pack expansion, in order
10473 to wait for when we have enough arguments to really perform the
10477 use_pack_expansion_extra_args_p (tree parm_packs
,
10479 bool has_empty_arg
)
10481 /* If one pack has an expansion and another pack has a normal
10482 argument or if one pack has an empty argument and an another
10483 one hasn't then tsubst_pack_expansion cannot perform the
10484 substitution and need to fall back on the
10485 PACK_EXPANSION_EXTRA mechanism. */
10486 if (parm_packs
== NULL_TREE
)
10488 else if (has_empty_arg
)
10491 bool has_expansion_arg
= false;
10492 for (int i
= 0 ; i
< arg_pack_len
; ++i
)
10494 bool has_non_expansion_arg
= false;
10495 for (tree parm_pack
= parm_packs
;
10497 parm_pack
= TREE_CHAIN (parm_pack
))
10499 tree arg
= TREE_VALUE (parm_pack
);
10501 int exp
= argument_pack_element_is_expansion_p (arg
, i
);
10503 /* We can't substitute a pack expansion with extra args into
10507 has_expansion_arg
= true;
10509 has_non_expansion_arg
= true;
10512 if (has_expansion_arg
&& has_non_expansion_arg
)
10518 /* [temp.variadic]/6 says that:
10520 The instantiation of a pack expansion [...]
10521 produces a list E1,E2, ..., En, where N is the number of elements
10522 in the pack expansion parameters.
10524 This subroutine of tsubst_pack_expansion produces one of these Ei.
10526 PATTERN is the pattern of the pack expansion. PARM_PACKS is a
10527 TREE_LIST in which each TREE_PURPOSE is a parameter pack of
10528 PATTERN, and each TREE_VALUE is its corresponding argument pack.
10529 INDEX is the index 'i' of the element Ei to produce. ARGS,
10530 COMPLAIN, and IN_DECL are the same parameters as for the
10531 tsubst_pack_expansion function.
10533 The function returns the resulting Ei upon successful completion,
10534 or error_mark_node.
10536 Note that this function possibly modifies the ARGS parameter, so
10537 it's the responsibility of the caller to restore it. */
10540 gen_elem_of_pack_expansion_instantiation (tree pattern
,
10543 tree args
/* This parm gets
10545 tsubst_flags_t complain
,
10549 bool ith_elem_is_expansion
= false;
10551 /* For each parameter pack, change the substitution of the parameter
10552 pack to the ith argument in its argument pack, then expand the
10554 for (tree pack
= parm_packs
; pack
; pack
= TREE_CHAIN (pack
))
10556 tree parm
= TREE_PURPOSE (pack
);
10557 tree arg_pack
= TREE_VALUE (pack
);
10558 tree aps
; /* instance of ARGUMENT_PACK_SELECT. */
10560 ith_elem_is_expansion
|=
10561 argument_pack_element_is_expansion_p (arg_pack
, index
);
10563 /* Select the Ith argument from the pack. */
10564 if (TREE_CODE (parm
) == PARM_DECL
10565 || TREE_CODE (parm
) == FIELD_DECL
)
10569 aps
= make_argument_pack_select (arg_pack
, index
);
10570 if (!mark_used (parm
, complain
) && !(complain
& tf_error
))
10571 return error_mark_node
;
10572 register_local_specialization (aps
, parm
);
10575 aps
= retrieve_local_specialization (parm
);
10580 template_parm_level_and_index (parm
, &level
, &idx
);
10584 aps
= make_argument_pack_select (arg_pack
, index
);
10585 /* Update the corresponding argument. */
10586 TMPL_ARG (args
, level
, idx
) = aps
;
10589 /* Re-use the ARGUMENT_PACK_SELECT. */
10590 aps
= TMPL_ARG (args
, level
, idx
);
10592 ARGUMENT_PACK_SELECT_INDEX (aps
) = index
;
10595 /* Substitute into the PATTERN with the (possibly altered)
10597 if (pattern
== in_decl
)
10598 /* Expanding a fixed parameter pack from
10599 coerce_template_parameter_pack. */
10600 t
= tsubst_decl (pattern
, args
, complain
);
10601 else if (pattern
== error_mark_node
)
10602 t
= error_mark_node
;
10603 else if (constraint_p (pattern
))
10605 if (processing_template_decl
)
10606 t
= tsubst_constraint (pattern
, args
, complain
, in_decl
);
10608 t
= (constraints_satisfied_p (pattern
, args
)
10609 ? boolean_true_node
: boolean_false_node
);
10611 else if (!TYPE_P (pattern
))
10612 t
= tsubst_expr (pattern
, args
, complain
, in_decl
,
10613 /*integral_constant_expression_p=*/false);
10615 t
= tsubst (pattern
, args
, complain
, in_decl
);
10617 /* If the Ith argument pack element is a pack expansion, then
10618 the Ith element resulting from the substituting is going to
10619 be a pack expansion as well. */
10620 if (ith_elem_is_expansion
)
10621 t
= make_pack_expansion (t
);
10626 /* When the unexpanded parameter pack in a fold expression expands to an empty
10627 sequence, the value of the expression is as follows; the program is
10628 ill-formed if the operator is not listed in this table.
10635 expand_empty_fold (tree t
, tsubst_flags_t complain
)
10637 tree_code code
= (tree_code
)TREE_INT_CST_LOW (TREE_OPERAND (t
, 0));
10638 if (!FOLD_EXPR_MODIFY_P (t
))
10641 case TRUTH_ANDIF_EXPR
:
10642 return boolean_true_node
;
10643 case TRUTH_ORIF_EXPR
:
10644 return boolean_false_node
;
10645 case COMPOUND_EXPR
:
10651 if (complain
& tf_error
)
10652 error_at (location_of (t
),
10653 "fold of empty expansion over %O", code
);
10654 return error_mark_node
;
10657 /* Given a fold-expression T and a current LEFT and RIGHT operand,
10658 form an expression that combines the two terms using the
10662 fold_expression (tree t
, tree left
, tree right
, tsubst_flags_t complain
)
10664 tree op
= FOLD_EXPR_OP (t
);
10665 tree_code code
= (tree_code
)TREE_INT_CST_LOW (op
);
10667 // Handle compound assignment operators.
10668 if (FOLD_EXPR_MODIFY_P (t
))
10669 return build_x_modify_expr (input_location
, left
, code
, right
, complain
);
10673 case COMPOUND_EXPR
:
10674 return build_x_compound_expr (input_location
, left
, right
, complain
);
10676 return build_m_component_ref (left
, right
, complain
);
10678 return build_x_binary_op (input_location
, code
,
10679 left
, TREE_CODE (left
),
10680 right
, TREE_CODE (right
),
10686 /* Substitute ARGS into the pack of a fold expression T. */
10689 tsubst_fold_expr_pack (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
10691 return tsubst_pack_expansion (FOLD_EXPR_PACK (t
), args
, complain
, in_decl
);
10694 /* Substitute ARGS into the pack of a fold expression T. */
10697 tsubst_fold_expr_init (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
10699 return tsubst_expr (FOLD_EXPR_INIT (t
), args
, complain
, in_decl
, false);
10702 /* Expand a PACK of arguments into a grouped as left fold.
10703 Given a pack containing elements A0, A1, ..., An and an
10704 operator @, this builds the expression:
10706 ((A0 @ A1) @ A2) ... @ An
10708 Note that PACK must not be empty.
10710 The operator is defined by the original fold expression T. */
10713 expand_left_fold (tree t
, tree pack
, tsubst_flags_t complain
)
10715 tree left
= TREE_VEC_ELT (pack
, 0);
10716 for (int i
= 1; i
< TREE_VEC_LENGTH (pack
); ++i
)
10718 tree right
= TREE_VEC_ELT (pack
, i
);
10719 left
= fold_expression (t
, left
, right
, complain
);
10724 /* Substitute into a unary left fold expression. */
10727 tsubst_unary_left_fold (tree t
, tree args
, tsubst_flags_t complain
,
10730 tree pack
= tsubst_fold_expr_pack (t
, args
, complain
, in_decl
);
10731 if (pack
== error_mark_node
)
10732 return error_mark_node
;
10733 if (TREE_VEC_LENGTH (pack
) == 0)
10734 return expand_empty_fold (t
, complain
);
10736 return expand_left_fold (t
, pack
, complain
);
10739 /* Substitute into a binary left fold expression.
10741 Do ths by building a single (non-empty) vector of argumnts and
10742 building the expression from those elements. */
10745 tsubst_binary_left_fold (tree t
, tree args
, tsubst_flags_t complain
,
10748 tree pack
= tsubst_fold_expr_pack (t
, args
, complain
, in_decl
);
10749 if (pack
== error_mark_node
)
10750 return error_mark_node
;
10751 tree init
= tsubst_fold_expr_init (t
, args
, complain
, in_decl
);
10752 if (init
== error_mark_node
)
10753 return error_mark_node
;
10755 tree vec
= make_tree_vec (TREE_VEC_LENGTH (pack
) + 1);
10756 TREE_VEC_ELT (vec
, 0) = init
;
10757 for (int i
= 0; i
< TREE_VEC_LENGTH (pack
); ++i
)
10758 TREE_VEC_ELT (vec
, i
+ 1) = TREE_VEC_ELT (pack
, i
);
10760 return expand_left_fold (t
, vec
, complain
);
10763 /* Expand a PACK of arguments into a grouped as right fold.
10764 Given a pack containing elementns A0, A1, ..., and an
10765 operator @, this builds the expression:
10767 A0@ ... (An-2 @ (An-1 @ An))
10769 Note that PACK must not be empty.
10771 The operator is defined by the original fold expression T. */
10774 expand_right_fold (tree t
, tree pack
, tsubst_flags_t complain
)
10776 // Build the expression.
10777 int n
= TREE_VEC_LENGTH (pack
);
10778 tree right
= TREE_VEC_ELT (pack
, n
- 1);
10779 for (--n
; n
!= 0; --n
)
10781 tree left
= TREE_VEC_ELT (pack
, n
- 1);
10782 right
= fold_expression (t
, left
, right
, complain
);
10787 /* Substitute into a unary right fold expression. */
10790 tsubst_unary_right_fold (tree t
, tree args
, tsubst_flags_t complain
,
10793 tree pack
= tsubst_fold_expr_pack (t
, args
, complain
, in_decl
);
10794 if (pack
== error_mark_node
)
10795 return error_mark_node
;
10796 if (TREE_VEC_LENGTH (pack
) == 0)
10797 return expand_empty_fold (t
, complain
);
10799 return expand_right_fold (t
, pack
, complain
);
10802 /* Substitute into a binary right fold expression.
10804 Do ths by building a single (non-empty) vector of arguments and
10805 building the expression from those elements. */
10808 tsubst_binary_right_fold (tree t
, tree args
, tsubst_flags_t complain
,
10811 tree pack
= tsubst_fold_expr_pack (t
, args
, complain
, in_decl
);
10812 if (pack
== error_mark_node
)
10813 return error_mark_node
;
10814 tree init
= tsubst_fold_expr_init (t
, args
, complain
, in_decl
);
10815 if (init
== error_mark_node
)
10816 return error_mark_node
;
10818 int n
= TREE_VEC_LENGTH (pack
);
10819 tree vec
= make_tree_vec (n
+ 1);
10820 for (int i
= 0; i
< n
; ++i
)
10821 TREE_VEC_ELT (vec
, i
) = TREE_VEC_ELT (pack
, i
);
10822 TREE_VEC_ELT (vec
, n
) = init
;
10824 return expand_right_fold (t
, vec
, complain
);
10828 /* Substitute ARGS into T, which is an pack expansion
10829 (i.e. TYPE_PACK_EXPANSION or EXPR_PACK_EXPANSION). Returns a
10830 TREE_VEC with the substituted arguments, a PACK_EXPANSION_* node
10831 (if only a partial substitution could be performed) or
10832 ERROR_MARK_NODE if there was an error. */
10834 tsubst_pack_expansion (tree t
, tree args
, tsubst_flags_t complain
,
10838 tree pack
, packs
= NULL_TREE
;
10839 bool unsubstituted_packs
= false;
10842 hash_map
<tree
, tree
> *saved_local_specializations
= NULL
;
10843 bool need_local_specializations
= false;
10846 gcc_assert (PACK_EXPANSION_P (t
));
10847 pattern
= PACK_EXPANSION_PATTERN (t
);
10849 /* Add in any args remembered from an earlier partial instantiation. */
10850 args
= add_to_template_args (PACK_EXPANSION_EXTRA_ARGS (t
), args
);
10852 levels
= TMPL_ARGS_DEPTH (args
);
10854 /* Determine the argument packs that will instantiate the parameter
10855 packs used in the expansion expression. While we're at it,
10856 compute the number of arguments to be expanded and make sure it
10858 for (pack
= PACK_EXPANSION_PARAMETER_PACKS (t
); pack
;
10859 pack
= TREE_CHAIN (pack
))
10861 tree parm_pack
= TREE_VALUE (pack
);
10862 tree arg_pack
= NULL_TREE
;
10863 tree orig_arg
= NULL_TREE
;
10866 if (TREE_CODE (parm_pack
) == BASES
)
10868 if (BASES_DIRECT (parm_pack
))
10869 return calculate_direct_bases (tsubst_expr (BASES_TYPE (parm_pack
),
10870 args
, complain
, in_decl
, false));
10872 return calculate_bases (tsubst_expr (BASES_TYPE (parm_pack
),
10873 args
, complain
, in_decl
, false));
10875 if (TREE_CODE (parm_pack
) == PARM_DECL
)
10877 /* We know we have correct local_specializations if this
10878 expansion is at function scope, or if we're dealing with a
10879 local parameter in a requires expression; for the latter,
10880 tsubst_requires_expr set it up appropriately. */
10881 if (PACK_EXPANSION_LOCAL_P (t
) || CONSTRAINT_VAR_P (parm_pack
))
10882 arg_pack
= retrieve_local_specialization (parm_pack
);
10884 /* We can't rely on local_specializations for a parameter
10885 name used later in a function declaration (such as in a
10886 late-specified return type). Even if it exists, it might
10887 have the wrong value for a recursive call. */
10888 need_local_specializations
= true;
10892 /* This parameter pack was used in an unevaluated context. Just
10893 make a dummy decl, since it's only used for its type. */
10894 arg_pack
= tsubst_decl (parm_pack
, args
, complain
);
10895 if (arg_pack
&& DECL_PACK_P (arg_pack
))
10896 /* Partial instantiation of the parm_pack, we can't build
10897 up an argument pack yet. */
10898 arg_pack
= NULL_TREE
;
10900 arg_pack
= make_fnparm_pack (arg_pack
);
10903 else if (TREE_CODE (parm_pack
) == FIELD_DECL
)
10904 arg_pack
= tsubst_copy (parm_pack
, args
, complain
, in_decl
);
10908 template_parm_level_and_index (parm_pack
, &level
, &idx
);
10910 if (level
<= levels
)
10911 arg_pack
= TMPL_ARG (args
, level
, idx
);
10914 orig_arg
= arg_pack
;
10915 if (arg_pack
&& TREE_CODE (arg_pack
) == ARGUMENT_PACK_SELECT
)
10916 arg_pack
= ARGUMENT_PACK_SELECT_FROM_PACK (arg_pack
);
10918 if (arg_pack
&& !ARGUMENT_PACK_P (arg_pack
))
10919 /* This can only happen if we forget to expand an argument
10920 pack somewhere else. Just return an error, silently. */
10922 result
= make_tree_vec (1);
10923 TREE_VEC_ELT (result
, 0) = error_mark_node
;
10930 TREE_VEC_LENGTH (ARGUMENT_PACK_ARGS (arg_pack
));
10932 /* Don't bother trying to do a partial substitution with
10933 incomplete packs; we'll try again after deduction. */
10934 if (ARGUMENT_PACK_INCOMPLETE_P (arg_pack
))
10939 else if (len
!= my_len
)
10941 if (!(complain
& tf_error
))
10942 /* Fail quietly. */;
10943 else if (TREE_CODE (t
) == TYPE_PACK_EXPANSION
)
10944 error ("mismatched argument pack lengths while expanding "
10948 error ("mismatched argument pack lengths while expanding "
10951 return error_mark_node
;
10954 /* Keep track of the parameter packs and their corresponding
10956 packs
= tree_cons (parm_pack
, arg_pack
, packs
);
10957 TREE_TYPE (packs
) = orig_arg
;
10961 /* We can't substitute for this parameter pack. We use a flag as
10962 well as the missing_level counter because function parameter
10963 packs don't have a level. */
10964 unsubstituted_packs
= true;
10968 /* If the expansion is just T..., return the matching argument pack, unless
10969 we need to call convert_from_reference on all the elements. This is an
10970 important optimization; see c++/68422. */
10971 if (!unsubstituted_packs
10972 && TREE_PURPOSE (packs
) == pattern
)
10974 tree args
= ARGUMENT_PACK_ARGS (TREE_VALUE (packs
));
10975 /* Types need no adjustment, nor does sizeof..., and if we still have
10976 some pack expansion args we won't do anything yet. */
10977 if (TREE_CODE (t
) == TYPE_PACK_EXPANSION
10978 || PACK_EXPANSION_SIZEOF_P (t
)
10979 || pack_expansion_args_count (args
))
10981 /* Also optimize expression pack expansions if we can tell that the
10982 elements won't have reference type. */
10983 tree type
= TREE_TYPE (pattern
);
10984 if (type
&& TREE_CODE (type
) != REFERENCE_TYPE
10985 && !PACK_EXPANSION_P (type
)
10986 && !WILDCARD_TYPE_P (type
))
10988 /* Otherwise use the normal path so we get convert_from_reference. */
10991 /* We cannot expand this expansion expression, because we don't have
10992 all of the argument packs we need. */
10993 if (use_pack_expansion_extra_args_p (packs
, len
, unsubstituted_packs
))
10995 /* We got some full packs, but we can't substitute them in until we
10996 have values for all the packs. So remember these until then. */
10998 t
= make_pack_expansion (pattern
);
10999 PACK_EXPANSION_EXTRA_ARGS (t
) = args
;
11002 else if (unsubstituted_packs
)
11004 /* There were no real arguments, we're just replacing a parameter
11005 pack with another version of itself. Substitute into the
11006 pattern and return a PACK_EXPANSION_*. The caller will need to
11008 if (TREE_CODE (t
) == EXPR_PACK_EXPANSION
)
11009 t
= tsubst_expr (pattern
, args
, complain
, in_decl
,
11010 /*integral_constant_expression_p=*/false);
11012 t
= tsubst (pattern
, args
, complain
, in_decl
);
11013 t
= make_pack_expansion (t
);
11017 gcc_assert (len
>= 0);
11019 if (need_local_specializations
)
11021 /* We're in a late-specified return type, so create our own local
11022 specializations map; the current map is either NULL or (in the
11023 case of recursive unification) might have bindings that we don't
11024 want to use or alter. */
11025 saved_local_specializations
= local_specializations
;
11026 local_specializations
= new hash_map
<tree
, tree
>;
11029 /* For each argument in each argument pack, substitute into the
11031 result
= make_tree_vec (len
);
11032 tree elem_args
= copy_template_args (args
);
11033 for (i
= 0; i
< len
; ++i
)
11035 t
= gen_elem_of_pack_expansion_instantiation (pattern
, packs
,
11037 elem_args
, complain
,
11039 TREE_VEC_ELT (result
, i
) = t
;
11040 if (t
== error_mark_node
)
11042 result
= error_mark_node
;
11047 /* Update ARGS to restore the substitution from parameter packs to
11048 their argument packs. */
11049 for (pack
= packs
; pack
; pack
= TREE_CHAIN (pack
))
11051 tree parm
= TREE_PURPOSE (pack
);
11053 if (TREE_CODE (parm
) == PARM_DECL
11054 || TREE_CODE (parm
) == FIELD_DECL
)
11055 register_local_specialization (TREE_TYPE (pack
), parm
);
11060 if (TREE_VALUE (pack
) == NULL_TREE
)
11063 template_parm_level_and_index (parm
, &level
, &idx
);
11065 /* Update the corresponding argument. */
11066 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (args
))
11067 TREE_VEC_ELT (TREE_VEC_ELT (args
, level
-1 ), idx
) =
11070 TREE_VEC_ELT (args
, idx
) = TREE_TYPE (pack
);
11074 if (need_local_specializations
)
11076 delete local_specializations
;
11077 local_specializations
= saved_local_specializations
;
11083 /* Given PARM_DECL PARM, find the corresponding PARM_DECL in the template
11084 TMPL. We do this using DECL_PARM_INDEX, which should work even with
11085 parameter packs; all parms generated from a function parameter pack will
11086 have the same DECL_PARM_INDEX. */
11089 get_pattern_parm (tree parm
, tree tmpl
)
11091 tree pattern
= DECL_TEMPLATE_RESULT (tmpl
);
11094 if (DECL_ARTIFICIAL (parm
))
11096 for (patparm
= DECL_ARGUMENTS (pattern
);
11097 patparm
; patparm
= DECL_CHAIN (patparm
))
11098 if (DECL_ARTIFICIAL (patparm
)
11099 && DECL_NAME (parm
) == DECL_NAME (patparm
))
11104 patparm
= FUNCTION_FIRST_USER_PARM (DECL_TEMPLATE_RESULT (tmpl
));
11105 patparm
= chain_index (DECL_PARM_INDEX (parm
)-1, patparm
);
11106 gcc_assert (DECL_PARM_INDEX (patparm
)
11107 == DECL_PARM_INDEX (parm
));
11113 /* Make an argument pack out of the TREE_VEC VEC. */
11116 make_argument_pack (tree vec
)
11119 tree elt
= TREE_VEC_ELT (vec
, 0);
11121 pack
= cxx_make_type (TYPE_ARGUMENT_PACK
);
11124 pack
= make_node (NONTYPE_ARGUMENT_PACK
);
11125 TREE_TYPE (pack
) = TREE_TYPE (elt
);
11126 TREE_CONSTANT (pack
) = 1;
11128 SET_ARGUMENT_PACK_ARGS (pack
, vec
);
11132 /* Return an exact copy of template args T that can be modified
11136 copy_template_args (tree t
)
11138 if (t
== error_mark_node
)
11141 int len
= TREE_VEC_LENGTH (t
);
11142 tree new_vec
= make_tree_vec (len
);
11144 for (int i
= 0; i
< len
; ++i
)
11146 tree elt
= TREE_VEC_ELT (t
, i
);
11147 if (elt
&& TREE_CODE (elt
) == TREE_VEC
)
11148 elt
= copy_template_args (elt
);
11149 TREE_VEC_ELT (new_vec
, i
) = elt
;
11152 NON_DEFAULT_TEMPLATE_ARGS_COUNT (new_vec
)
11153 = NON_DEFAULT_TEMPLATE_ARGS_COUNT (t
);
11158 /* Substitute ARGS into the vector or list of template arguments T. */
11161 tsubst_template_args (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
11164 int len
, need_new
= 0, i
, expanded_len_adjust
= 0, out
;
11167 if (t
== error_mark_node
)
11168 return error_mark_node
;
11170 len
= TREE_VEC_LENGTH (t
);
11171 elts
= XALLOCAVEC (tree
, len
);
11173 for (i
= 0; i
< len
; i
++)
11175 tree orig_arg
= TREE_VEC_ELT (t
, i
);
11178 if (TREE_CODE (orig_arg
) == TREE_VEC
)
11179 new_arg
= tsubst_template_args (orig_arg
, args
, complain
, in_decl
);
11180 else if (PACK_EXPANSION_P (orig_arg
))
11182 /* Substitute into an expansion expression. */
11183 new_arg
= tsubst_pack_expansion (orig_arg
, args
, complain
, in_decl
);
11185 if (TREE_CODE (new_arg
) == TREE_VEC
)
11186 /* Add to the expanded length adjustment the number of
11187 expanded arguments. We subtract one from this
11188 measurement, because the argument pack expression
11189 itself is already counted as 1 in
11190 LEN. EXPANDED_LEN_ADJUST can actually be negative, if
11191 the argument pack is empty. */
11192 expanded_len_adjust
+= TREE_VEC_LENGTH (new_arg
) - 1;
11194 else if (ARGUMENT_PACK_P (orig_arg
))
11196 /* Substitute into each of the arguments. */
11197 new_arg
= TYPE_P (orig_arg
)
11198 ? cxx_make_type (TREE_CODE (orig_arg
))
11199 : make_node (TREE_CODE (orig_arg
));
11201 SET_ARGUMENT_PACK_ARGS (
11203 tsubst_template_args (ARGUMENT_PACK_ARGS (orig_arg
),
11204 args
, complain
, in_decl
));
11206 if (ARGUMENT_PACK_ARGS (new_arg
) == error_mark_node
)
11207 new_arg
= error_mark_node
;
11209 if (TREE_CODE (new_arg
) == NONTYPE_ARGUMENT_PACK
) {
11210 TREE_TYPE (new_arg
) = tsubst (TREE_TYPE (orig_arg
), args
,
11211 complain
, in_decl
);
11212 TREE_CONSTANT (new_arg
) = TREE_CONSTANT (orig_arg
);
11214 if (TREE_TYPE (new_arg
) == error_mark_node
)
11215 new_arg
= error_mark_node
;
11219 new_arg
= tsubst_template_arg (orig_arg
, args
, complain
, in_decl
);
11221 if (new_arg
== error_mark_node
)
11222 return error_mark_node
;
11225 if (new_arg
!= orig_arg
)
11232 /* Make space for the expanded arguments coming from template
11234 t
= make_tree_vec (len
+ expanded_len_adjust
);
11235 /* ORIG_T can contain TREE_VECs. That happens if ORIG_T contains the
11236 arguments for a member template.
11237 In that case each TREE_VEC in ORIG_T represents a level of template
11238 arguments, and ORIG_T won't carry any non defaulted argument count.
11239 It will rather be the nested TREE_VECs that will carry one.
11240 In other words, ORIG_T carries a non defaulted argument count only
11241 if it doesn't contain any nested TREE_VEC. */
11242 if (NON_DEFAULT_TEMPLATE_ARGS_COUNT (orig_t
))
11244 int count
= GET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (orig_t
);
11245 count
+= expanded_len_adjust
;
11246 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (t
, count
);
11248 for (i
= 0, out
= 0; i
< len
; i
++)
11250 if ((PACK_EXPANSION_P (TREE_VEC_ELT (orig_t
, i
))
11251 || ARGUMENT_PACK_P (TREE_VEC_ELT (orig_t
, i
)))
11252 && TREE_CODE (elts
[i
]) == TREE_VEC
)
11256 /* Now expand the template argument pack "in place". */
11257 for (idx
= 0; idx
< TREE_VEC_LENGTH (elts
[i
]); idx
++, out
++)
11258 TREE_VEC_ELT (t
, out
) = TREE_VEC_ELT (elts
[i
], idx
);
11262 TREE_VEC_ELT (t
, out
) = elts
[i
];
11270 /* Return the result of substituting ARGS into the template parameters
11271 given by PARMS. If there are m levels of ARGS and m + n levels of
11272 PARMS, then the result will contain n levels of PARMS. For
11273 example, if PARMS is `template <class T> template <class U>
11274 template <T*, U, class V>' and ARGS is {{int}, {double}} then the
11275 result will be `template <int*, double, class V>'. */
11278 tsubst_template_parms (tree parms
, tree args
, tsubst_flags_t complain
)
11280 tree r
= NULL_TREE
;
11283 /* When substituting into a template, we must set
11284 PROCESSING_TEMPLATE_DECL as the template parameters may be
11285 dependent if they are based on one-another, and the dependency
11286 predicates are short-circuit outside of templates. */
11287 ++processing_template_decl
;
11289 for (new_parms
= &r
;
11290 parms
&& TMPL_PARMS_DEPTH (parms
) > TMPL_ARGS_DEPTH (args
);
11291 new_parms
= &(TREE_CHAIN (*new_parms
)),
11292 parms
= TREE_CHAIN (parms
))
11295 make_tree_vec (TREE_VEC_LENGTH (TREE_VALUE (parms
)));
11298 for (i
= 0; i
< TREE_VEC_LENGTH (new_vec
); ++i
)
11302 if (parms
== error_mark_node
)
11305 tuple
= TREE_VEC_ELT (TREE_VALUE (parms
), i
);
11307 if (tuple
== error_mark_node
)
11310 TREE_VEC_ELT (new_vec
, i
) =
11311 tsubst_template_parm (tuple
, args
, complain
);
11315 tree_cons (size_int (TMPL_PARMS_DEPTH (parms
)
11316 - TMPL_ARGS_DEPTH (args
)),
11317 new_vec
, NULL_TREE
);
11320 --processing_template_decl
;
11325 /* Return the result of substituting ARGS into one template parameter
11326 given by T. T Must be a TREE_LIST which TREE_VALUE is the template
11327 parameter and which TREE_PURPOSE is the default argument of the
11328 template parameter. */
11331 tsubst_template_parm (tree t
, tree args
, tsubst_flags_t complain
)
11333 tree default_value
, parm_decl
;
11335 if (args
== NULL_TREE
11337 || t
== error_mark_node
)
11340 gcc_assert (TREE_CODE (t
) == TREE_LIST
);
11342 default_value
= TREE_PURPOSE (t
);
11343 parm_decl
= TREE_VALUE (t
);
11345 parm_decl
= tsubst (parm_decl
, args
, complain
, NULL_TREE
);
11346 if (TREE_CODE (parm_decl
) == PARM_DECL
11347 && invalid_nontype_parm_type_p (TREE_TYPE (parm_decl
), complain
))
11348 parm_decl
= error_mark_node
;
11349 default_value
= tsubst_template_arg (default_value
, args
,
11350 complain
, NULL_TREE
);
11352 return build_tree_list (default_value
, parm_decl
);
11355 /* Substitute the ARGS into the indicated aggregate (or enumeration)
11356 type T. If T is not an aggregate or enumeration type, it is
11357 handled as if by tsubst. IN_DECL is as for tsubst. If
11358 ENTERING_SCOPE is nonzero, T is the context for a template which
11359 we are presently tsubst'ing. Return the substituted value. */
11362 tsubst_aggr_type (tree t
,
11364 tsubst_flags_t complain
,
11366 int entering_scope
)
11368 if (t
== NULL_TREE
)
11371 switch (TREE_CODE (t
))
11374 if (TYPE_PTRMEMFUNC_P (t
))
11375 return tsubst (TYPE_PTRMEMFUNC_FN_TYPE (t
), args
, complain
, in_decl
);
11377 /* Else fall through. */
11378 case ENUMERAL_TYPE
:
11380 if (TYPE_TEMPLATE_INFO (t
) && uses_template_parms (t
))
11385 int saved_unevaluated_operand
;
11386 int saved_inhibit_evaluation_warnings
;
11388 /* In "sizeof(X<I>)" we need to evaluate "I". */
11389 saved_unevaluated_operand
= cp_unevaluated_operand
;
11390 cp_unevaluated_operand
= 0;
11391 saved_inhibit_evaluation_warnings
= c_inhibit_evaluation_warnings
;
11392 c_inhibit_evaluation_warnings
= 0;
11394 /* First, determine the context for the type we are looking
11396 context
= TYPE_CONTEXT (t
);
11397 if (context
&& TYPE_P (context
))
11399 context
= tsubst_aggr_type (context
, args
, complain
,
11400 in_decl
, /*entering_scope=*/1);
11401 /* If context is a nested class inside a class template,
11402 it may still need to be instantiated (c++/33959). */
11403 context
= complete_type (context
);
11406 /* Then, figure out what arguments are appropriate for the
11407 type we are trying to find. For example, given:
11409 template <class T> struct S;
11410 template <class T, class U> void f(T, U) { S<U> su; }
11412 and supposing that we are instantiating f<int, double>,
11413 then our ARGS will be {int, double}, but, when looking up
11414 S we only want {double}. */
11415 argvec
= tsubst_template_args (TYPE_TI_ARGS (t
), args
,
11416 complain
, in_decl
);
11417 if (argvec
== error_mark_node
)
11418 r
= error_mark_node
;
11421 r
= lookup_template_class (t
, argvec
, in_decl
, context
,
11422 entering_scope
, complain
);
11423 r
= cp_build_qualified_type_real (r
, cp_type_quals (t
), complain
);
11426 cp_unevaluated_operand
= saved_unevaluated_operand
;
11427 c_inhibit_evaluation_warnings
= saved_inhibit_evaluation_warnings
;
11432 /* This is not a template type, so there's nothing to do. */
11436 return tsubst (t
, args
, complain
, in_decl
);
11440 /* Substitute into the default argument ARG (a default argument for
11441 FN), which has the indicated TYPE. */
11444 tsubst_default_argument (tree fn
, tree type
, tree arg
, tsubst_flags_t complain
)
11446 tree saved_class_ptr
= NULL_TREE
;
11447 tree saved_class_ref
= NULL_TREE
;
11448 int errs
= errorcount
+ sorrycount
;
11450 /* This can happen in invalid code. */
11451 if (TREE_CODE (arg
) == DEFAULT_ARG
)
11454 /* This default argument came from a template. Instantiate the
11455 default argument here, not in tsubst. In the case of
11464 we must be careful to do name lookup in the scope of S<T>,
11465 rather than in the current class. */
11466 push_access_scope (fn
);
11467 /* The "this" pointer is not valid in a default argument. */
11470 saved_class_ptr
= current_class_ptr
;
11471 cp_function_chain
->x_current_class_ptr
= NULL_TREE
;
11472 saved_class_ref
= current_class_ref
;
11473 cp_function_chain
->x_current_class_ref
= NULL_TREE
;
11476 push_deferring_access_checks(dk_no_deferred
);
11477 /* The default argument expression may cause implicitly defined
11478 member functions to be synthesized, which will result in garbage
11479 collection. We must treat this situation as if we were within
11480 the body of function so as to avoid collecting live data on the
11483 arg
= tsubst_expr (arg
, DECL_TI_ARGS (fn
),
11484 complain
, NULL_TREE
,
11485 /*integral_constant_expression_p=*/false);
11487 pop_deferring_access_checks();
11489 /* Restore the "this" pointer. */
11492 cp_function_chain
->x_current_class_ptr
= saved_class_ptr
;
11493 cp_function_chain
->x_current_class_ref
= saved_class_ref
;
11496 if (errorcount
+sorrycount
> errs
11497 && (complain
& tf_warning_or_error
))
11498 inform (input_location
,
11499 " when instantiating default argument for call to %D", fn
);
11501 /* Make sure the default argument is reasonable. */
11502 arg
= check_default_argument (type
, arg
, complain
);
11504 pop_access_scope (fn
);
11509 /* Substitute into all the default arguments for FN. */
11512 tsubst_default_arguments (tree fn
, tsubst_flags_t complain
)
11517 tmpl_args
= DECL_TI_ARGS (fn
);
11519 /* If this function is not yet instantiated, we certainly don't need
11520 its default arguments. */
11521 if (uses_template_parms (tmpl_args
))
11523 /* Don't do this again for clones. */
11524 if (DECL_CLONED_FUNCTION_P (fn
))
11527 for (arg
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
11529 arg
= TREE_CHAIN (arg
))
11530 if (TREE_PURPOSE (arg
))
11531 TREE_PURPOSE (arg
) = tsubst_default_argument (fn
,
11533 TREE_PURPOSE (arg
),
11537 /* Substitute the ARGS into the T, which is a _DECL. Return the
11538 result of the substitution. Issue error and warning messages under
11539 control of COMPLAIN. */
11542 tsubst_decl (tree t
, tree args
, tsubst_flags_t complain
)
11544 #define RETURN(EXP) do { r = (EXP); goto out; } while(0)
11545 location_t saved_loc
;
11546 tree r
= NULL_TREE
;
11548 hashval_t hash
= 0;
11550 /* Set the filename and linenumber to improve error-reporting. */
11551 saved_loc
= input_location
;
11552 input_location
= DECL_SOURCE_LOCATION (t
);
11554 switch (TREE_CODE (t
))
11556 case TEMPLATE_DECL
:
11558 /* We can get here when processing a member function template,
11559 member class template, or template template parameter. */
11560 tree decl
= DECL_TEMPLATE_RESULT (t
);
11565 if (DECL_TEMPLATE_TEMPLATE_PARM_P (t
))
11567 /* Template template parameter is treated here. */
11568 tree new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
11569 if (new_type
== error_mark_node
)
11570 r
= error_mark_node
;
11571 /* If we get a real template back, return it. This can happen in
11572 the context of most_specialized_partial_spec. */
11573 else if (TREE_CODE (new_type
) == TEMPLATE_DECL
)
11576 /* The new TEMPLATE_DECL was built in
11577 reduce_template_parm_level. */
11578 r
= TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL (new_type
);
11582 /* We might already have an instance of this template.
11583 The ARGS are for the surrounding class type, so the
11584 full args contain the tsubst'd args for the context,
11585 plus the innermost args from the template decl. */
11586 tmpl_args
= DECL_CLASS_TEMPLATE_P (t
)
11587 ? CLASSTYPE_TI_ARGS (TREE_TYPE (t
))
11588 : DECL_TI_ARGS (DECL_TEMPLATE_RESULT (t
));
11589 /* Because this is a template, the arguments will still be
11590 dependent, even after substitution. If
11591 PROCESSING_TEMPLATE_DECL is not set, the dependency
11592 predicates will short-circuit. */
11593 ++processing_template_decl
;
11594 full_args
= tsubst_template_args (tmpl_args
, args
,
11595 complain
, in_decl
);
11596 --processing_template_decl
;
11597 if (full_args
== error_mark_node
)
11598 RETURN (error_mark_node
);
11600 /* If this is a default template template argument,
11601 tsubst might not have changed anything. */
11602 if (full_args
== tmpl_args
)
11605 hash
= hash_tmpl_and_args (t
, full_args
);
11606 spec
= retrieve_specialization (t
, full_args
, hash
);
11607 if (spec
!= NULL_TREE
)
11613 /* Make a new template decl. It will be similar to the
11614 original, but will record the current template arguments.
11615 We also create a new function declaration, which is just
11616 like the old one, but points to this new template, rather
11617 than the old one. */
11619 gcc_assert (DECL_LANG_SPECIFIC (r
) != 0);
11620 DECL_CHAIN (r
) = NULL_TREE
;
11622 // Build new template info linking to the original template decl.
11623 DECL_TEMPLATE_INFO (r
) = build_template_info (t
, args
);
11625 if (TREE_CODE (decl
) == TYPE_DECL
11626 && !TYPE_DECL_ALIAS_P (decl
))
11629 ++processing_template_decl
;
11630 new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
11631 --processing_template_decl
;
11632 if (new_type
== error_mark_node
)
11633 RETURN (error_mark_node
);
11635 TREE_TYPE (r
) = new_type
;
11636 /* For a partial specialization, we need to keep pointing to
11637 the primary template. */
11638 if (!DECL_TEMPLATE_SPECIALIZATION (t
))
11639 CLASSTYPE_TI_TEMPLATE (new_type
) = r
;
11640 DECL_TEMPLATE_RESULT (r
) = TYPE_MAIN_DECL (new_type
);
11641 DECL_TI_ARGS (r
) = CLASSTYPE_TI_ARGS (new_type
);
11642 DECL_CONTEXT (r
) = TYPE_CONTEXT (new_type
);
11647 ++processing_template_decl
;
11648 new_decl
= tsubst (decl
, args
, complain
, in_decl
);
11649 --processing_template_decl
;
11650 if (new_decl
== error_mark_node
)
11651 RETURN (error_mark_node
);
11653 DECL_TEMPLATE_RESULT (r
) = new_decl
;
11654 DECL_TI_TEMPLATE (new_decl
) = r
;
11655 TREE_TYPE (r
) = TREE_TYPE (new_decl
);
11656 DECL_TI_ARGS (r
) = DECL_TI_ARGS (new_decl
);
11657 DECL_CONTEXT (r
) = DECL_CONTEXT (new_decl
);
11660 SET_DECL_IMPLICIT_INSTANTIATION (r
);
11661 DECL_TEMPLATE_INSTANTIATIONS (r
) = NULL_TREE
;
11662 DECL_TEMPLATE_SPECIALIZATIONS (r
) = NULL_TREE
;
11664 /* The template parameters for this new template are all the
11665 template parameters for the old template, except the
11666 outermost level of parameters. */
11667 DECL_TEMPLATE_PARMS (r
)
11668 = tsubst_template_parms (DECL_TEMPLATE_PARMS (t
), args
,
11671 if (PRIMARY_TEMPLATE_P (t
))
11672 DECL_PRIMARY_TEMPLATE (r
) = r
;
11674 if (TREE_CODE (decl
) != TYPE_DECL
&& !VAR_P (decl
))
11675 /* Record this non-type partial instantiation. */
11676 register_specialization (r
, t
,
11677 DECL_TI_ARGS (DECL_TEMPLATE_RESULT (r
)),
11682 case FUNCTION_DECL
:
11685 tree argvec
= NULL_TREE
;
11693 /* Nobody should be tsubst'ing into non-template functions. */
11694 gcc_assert (DECL_TEMPLATE_INFO (t
) != NULL_TREE
);
11696 if (TREE_CODE (DECL_TI_TEMPLATE (t
)) == TEMPLATE_DECL
)
11701 /* If T is not dependent, just return it. We have to
11702 increment PROCESSING_TEMPLATE_DECL because
11703 value_dependent_expression_p assumes that nothing is
11704 dependent when PROCESSING_TEMPLATE_DECL is zero. */
11705 ++processing_template_decl
;
11706 dependent_p
= value_dependent_expression_p (t
);
11707 --processing_template_decl
;
11711 /* Calculate the most general template of which R is a
11712 specialization, and the complete set of arguments used to
11714 gen_tmpl
= most_general_template (DECL_TI_TEMPLATE (t
));
11715 argvec
= tsubst_template_args (DECL_TI_ARGS
11716 (DECL_TEMPLATE_RESULT
11717 (DECL_TI_TEMPLATE (t
))),
11718 args
, complain
, in_decl
);
11719 if (argvec
== error_mark_node
)
11720 RETURN (error_mark_node
);
11722 /* Check to see if we already have this specialization. */
11723 hash
= hash_tmpl_and_args (gen_tmpl
, argvec
);
11724 spec
= retrieve_specialization (gen_tmpl
, argvec
, hash
);
11732 /* We can see more levels of arguments than parameters if
11733 there was a specialization of a member template, like
11736 template <class T> struct S { template <class U> void f(); }
11737 template <> template <class U> void S<int>::f(U);
11739 Here, we'll be substituting into the specialization,
11740 because that's where we can find the code we actually
11741 want to generate, but we'll have enough arguments for
11742 the most general template.
11744 We also deal with the peculiar case:
11746 template <class T> struct S {
11747 template <class U> friend void f();
11749 template <class U> void f() {}
11751 template void f<double>();
11753 Here, the ARGS for the instantiation of will be {int,
11754 double}. But, we only need as many ARGS as there are
11755 levels of template parameters in CODE_PATTERN. We are
11756 careful not to get fooled into reducing the ARGS in
11759 template <class T> struct S { template <class U> void f(U); }
11760 template <class T> template <> void S<T>::f(int) {}
11762 which we can spot because the pattern will be a
11763 specialization in this case. */
11764 args_depth
= TMPL_ARGS_DEPTH (args
);
11766 TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (DECL_TI_TEMPLATE (t
)));
11767 if (args_depth
> parms_depth
11768 && !DECL_TEMPLATE_SPECIALIZATION (t
))
11769 args
= get_innermost_template_args (args
, parms_depth
);
11773 /* This special case arises when we have something like this:
11775 template <class T> struct S {
11776 friend void f<int>(int, double);
11779 Here, the DECL_TI_TEMPLATE for the friend declaration
11780 will be an IDENTIFIER_NODE. We are being called from
11781 tsubst_friend_function, and we want only to create a
11782 new decl (R) with appropriate types so that we can call
11783 determine_specialization. */
11784 gen_tmpl
= NULL_TREE
;
11787 if (DECL_CLASS_SCOPE_P (t
))
11789 if (DECL_NAME (t
) == constructor_name (DECL_CONTEXT (t
)))
11793 ctx
= tsubst_aggr_type (DECL_CONTEXT (t
), args
,
11794 complain
, t
, /*entering_scope=*/1);
11799 ctx
= DECL_CONTEXT (t
);
11801 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
11802 if (type
== error_mark_node
)
11803 RETURN (error_mark_node
);
11805 /* If we hit excessive deduction depth, the type is bogus even if
11806 it isn't error_mark_node, so don't build a decl. */
11807 if (excessive_deduction_depth
)
11808 RETURN (error_mark_node
);
11810 /* We do NOT check for matching decls pushed separately at this
11811 point, as they may not represent instantiations of this
11812 template, and in any case are considered separate under the
11815 DECL_USE_TEMPLATE (r
) = 0;
11816 TREE_TYPE (r
) = type
;
11817 /* Clear out the mangled name and RTL for the instantiation. */
11818 SET_DECL_ASSEMBLER_NAME (r
, NULL_TREE
);
11819 SET_DECL_RTL (r
, NULL
);
11820 /* Leave DECL_INITIAL set on deleted instantiations. */
11821 if (!DECL_DELETED_FN (r
))
11822 DECL_INITIAL (r
) = NULL_TREE
;
11823 DECL_CONTEXT (r
) = ctx
;
11825 /* OpenMP UDRs have the only argument a reference to the declared
11826 type. We want to diagnose if the declared type is a reference,
11827 which is invalid, but as references to references are usually
11828 quietly merged, diagnose it here. */
11829 if (DECL_OMP_DECLARE_REDUCTION_P (t
))
11832 = TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (t
))));
11833 argtype
= tsubst (argtype
, args
, complain
, in_decl
);
11834 if (TREE_CODE (argtype
) == REFERENCE_TYPE
)
11835 error_at (DECL_SOURCE_LOCATION (t
),
11836 "reference type %qT in "
11837 "%<#pragma omp declare reduction%>", argtype
);
11838 if (strchr (IDENTIFIER_POINTER (DECL_NAME (t
)), '~') == NULL
)
11839 DECL_NAME (r
) = omp_reduction_id (ERROR_MARK
, DECL_NAME (t
),
11843 if (member
&& DECL_CONV_FN_P (r
))
11844 /* Type-conversion operator. Reconstruct the name, in
11845 case it's the name of one of the template's parameters. */
11846 DECL_NAME (r
) = mangle_conv_op_name_for_type (TREE_TYPE (type
));
11848 DECL_ARGUMENTS (r
) = tsubst (DECL_ARGUMENTS (t
), args
,
11850 DECL_RESULT (r
) = NULL_TREE
;
11852 TREE_STATIC (r
) = 0;
11853 TREE_PUBLIC (r
) = TREE_PUBLIC (t
);
11854 DECL_EXTERNAL (r
) = 1;
11855 /* If this is an instantiation of a function with internal
11856 linkage, we already know what object file linkage will be
11857 assigned to the instantiation. */
11858 DECL_INTERFACE_KNOWN (r
) = !TREE_PUBLIC (r
);
11859 DECL_DEFER_OUTPUT (r
) = 0;
11860 DECL_CHAIN (r
) = NULL_TREE
;
11861 DECL_PENDING_INLINE_INFO (r
) = 0;
11862 DECL_PENDING_INLINE_P (r
) = 0;
11863 DECL_SAVED_TREE (r
) = NULL_TREE
;
11864 DECL_STRUCT_FUNCTION (r
) = NULL
;
11866 /* We'll re-clone as appropriate in instantiate_template. */
11867 DECL_CLONED_FUNCTION (r
) = NULL_TREE
;
11869 /* If we aren't complaining now, return on error before we register
11870 the specialization so that we'll complain eventually. */
11871 if ((complain
& tf_error
) == 0
11872 && IDENTIFIER_OPNAME_P (DECL_NAME (r
))
11873 && !grok_op_properties (r
, /*complain=*/false))
11874 RETURN (error_mark_node
);
11876 /* When instantiating a constrained member, substitute
11877 into the constraints to create a new constraint. */
11878 if (tree ci
= get_constraints (t
))
11881 ci
= tsubst_constraint_info (ci
, argvec
, complain
, NULL_TREE
);
11882 set_constraints (r
, ci
);
11885 /* Set up the DECL_TEMPLATE_INFO for R. There's no need to do
11886 this in the special friend case mentioned above where
11887 GEN_TMPL is NULL. */
11890 DECL_TEMPLATE_INFO (r
)
11891 = build_template_info (gen_tmpl
, argvec
);
11892 SET_DECL_IMPLICIT_INSTANTIATION (r
);
11895 = register_specialization (r
, gen_tmpl
, argvec
, false, hash
);
11897 /* We instantiated this while substituting into
11898 the type earlier (template/friend54.C). */
11901 /* We're not supposed to instantiate default arguments
11902 until they are called, for a template. But, for a
11905 template <class T> void f ()
11906 { extern void g(int i = T()); }
11908 we should do the substitution when the template is
11909 instantiated. We handle the member function case in
11910 instantiate_class_template since the default arguments
11911 might refer to other members of the class. */
11913 && !PRIMARY_TEMPLATE_P (gen_tmpl
)
11914 && !uses_template_parms (argvec
))
11915 tsubst_default_arguments (r
, complain
);
11918 DECL_TEMPLATE_INFO (r
) = NULL_TREE
;
11920 /* Copy the list of befriending classes. */
11921 for (friends
= &DECL_BEFRIENDING_CLASSES (r
);
11923 friends
= &TREE_CHAIN (*friends
))
11925 *friends
= copy_node (*friends
);
11926 TREE_VALUE (*friends
) = tsubst (TREE_VALUE (*friends
),
11931 if (DECL_CONSTRUCTOR_P (r
) || DECL_DESTRUCTOR_P (r
))
11933 maybe_retrofit_in_chrg (r
);
11934 if (DECL_CONSTRUCTOR_P (r
))
11935 grok_ctor_properties (ctx
, r
);
11936 if (DECL_INHERITED_CTOR_BASE (r
))
11937 deduce_inheriting_ctor (r
);
11938 /* If this is an instantiation of a member template, clone it.
11939 If it isn't, that'll be handled by
11940 clone_constructors_and_destructors. */
11941 if (PRIMARY_TEMPLATE_P (gen_tmpl
))
11942 clone_function_decl (r
, /*update_method_vec_p=*/0);
11944 else if ((complain
& tf_error
) != 0
11945 && IDENTIFIER_OPNAME_P (DECL_NAME (r
))
11946 && !grok_op_properties (r
, /*complain=*/true))
11947 RETURN (error_mark_node
);
11949 if (DECL_FRIEND_P (t
) && DECL_FRIEND_CONTEXT (t
))
11950 SET_DECL_FRIEND_CONTEXT (r
,
11951 tsubst (DECL_FRIEND_CONTEXT (t
),
11952 args
, complain
, in_decl
));
11954 /* Possibly limit visibility based on template args. */
11955 DECL_VISIBILITY (r
) = VISIBILITY_DEFAULT
;
11956 if (DECL_VISIBILITY_SPECIFIED (t
))
11958 DECL_VISIBILITY_SPECIFIED (r
) = 0;
11959 DECL_ATTRIBUTES (r
)
11960 = remove_attribute ("visibility", DECL_ATTRIBUTES (r
));
11962 determine_visibility (r
);
11963 if (DECL_DEFAULTED_OUTSIDE_CLASS_P (r
)
11964 && !processing_template_decl
)
11965 defaulted_late_check (r
);
11967 apply_late_template_attributes (&r
, DECL_ATTRIBUTES (r
), 0,
11968 args
, complain
, in_decl
);
11974 tree type
= NULL_TREE
;
11976 tree expanded_types
= NULL_TREE
;
11977 tree prev_r
= NULL_TREE
;
11978 tree first_r
= NULL_TREE
;
11980 if (DECL_PACK_P (t
))
11982 /* If there is a local specialization that isn't a
11983 parameter pack, it means that we're doing a "simple"
11984 substitution from inside tsubst_pack_expansion. Just
11985 return the local specialization (which will be a single
11987 tree spec
= retrieve_local_specialization (t
);
11989 && TREE_CODE (spec
) == PARM_DECL
11990 && TREE_CODE (TREE_TYPE (spec
)) != TYPE_PACK_EXPANSION
)
11993 /* Expand the TYPE_PACK_EXPANSION that provides the types for
11994 the parameters in this function parameter pack. */
11995 expanded_types
= tsubst_pack_expansion (TREE_TYPE (t
), args
,
11996 complain
, in_decl
);
11997 if (TREE_CODE (expanded_types
) == TREE_VEC
)
11999 len
= TREE_VEC_LENGTH (expanded_types
);
12001 /* Zero-length parameter packs are boring. Just substitute
12004 RETURN (tsubst (TREE_CHAIN (t
), args
, complain
,
12009 /* All we did was update the type. Make a note of that. */
12010 type
= expanded_types
;
12011 expanded_types
= NULL_TREE
;
12015 /* Loop through all of the parameters we'll build. When T is
12016 a function parameter pack, LEN is the number of expanded
12017 types in EXPANDED_TYPES; otherwise, LEN is 1. */
12019 for (i
= 0; i
< len
; ++i
)
12023 if (DECL_TEMPLATE_PARM_P (t
))
12024 SET_DECL_TEMPLATE_PARM_P (r
);
12026 if (expanded_types
)
12027 /* We're on the Ith parameter of the function parameter
12030 /* Get the Ith type. */
12031 type
= TREE_VEC_ELT (expanded_types
, i
);
12033 /* Rename the parameter to include the index. */
12035 = make_ith_pack_parameter_name (DECL_NAME (r
), i
);
12038 /* We're dealing with a normal parameter. */
12039 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
12041 type
= type_decays_to (type
);
12042 TREE_TYPE (r
) = type
;
12043 cp_apply_type_quals_to_decl (cp_type_quals (type
), r
);
12045 if (DECL_INITIAL (r
))
12047 if (TREE_CODE (DECL_INITIAL (r
)) != TEMPLATE_PARM_INDEX
)
12048 DECL_INITIAL (r
) = TREE_TYPE (r
);
12050 DECL_INITIAL (r
) = tsubst (DECL_INITIAL (r
), args
,
12051 complain
, in_decl
);
12054 DECL_CONTEXT (r
) = NULL_TREE
;
12056 if (!DECL_TEMPLATE_PARM_P (r
))
12057 DECL_ARG_TYPE (r
) = type_passed_as (type
);
12059 apply_late_template_attributes (&r
, DECL_ATTRIBUTES (r
), 0,
12060 args
, complain
, in_decl
);
12062 /* Keep track of the first new parameter we
12063 generate. That's what will be returned to the
12068 /* Build a proper chain of parameters when substituting
12069 into a function parameter pack. */
12071 DECL_CHAIN (prev_r
) = r
;
12074 /* If cp_unevaluated_operand is set, we're just looking for a
12075 single dummy parameter, so don't keep going. */
12076 if (DECL_CHAIN (t
) && !cp_unevaluated_operand
)
12077 DECL_CHAIN (r
) = tsubst (DECL_CHAIN (t
), args
,
12078 complain
, DECL_CHAIN (t
));
12080 /* FIRST_R contains the start of the chain we've built. */
12087 tree type
= NULL_TREE
;
12088 tree vec
= NULL_TREE
;
12089 tree expanded_types
= NULL_TREE
;
12092 if (PACK_EXPANSION_P (TREE_TYPE (t
)))
12094 /* This field is a lambda capture pack. Return a TREE_VEC of
12095 the expanded fields to instantiate_class_template_1 and
12096 store them in the specializations hash table as a
12097 NONTYPE_ARGUMENT_PACK so that tsubst_copy can find them. */
12098 expanded_types
= tsubst_pack_expansion (TREE_TYPE (t
), args
,
12099 complain
, in_decl
);
12100 if (TREE_CODE (expanded_types
) == TREE_VEC
)
12102 len
= TREE_VEC_LENGTH (expanded_types
);
12103 vec
= make_tree_vec (len
);
12107 /* All we did was update the type. Make a note of that. */
12108 type
= expanded_types
;
12109 expanded_types
= NULL_TREE
;
12113 for (int i
= 0; i
< len
; ++i
)
12116 if (expanded_types
)
12118 type
= TREE_VEC_ELT (expanded_types
, i
);
12120 = make_ith_pack_parameter_name (DECL_NAME (r
), i
);
12123 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
12125 if (type
== error_mark_node
)
12126 RETURN (error_mark_node
);
12127 TREE_TYPE (r
) = type
;
12128 cp_apply_type_quals_to_decl (cp_type_quals (type
), r
);
12130 if (DECL_C_BIT_FIELD (r
))
12131 /* For bit-fields, DECL_INITIAL gives the number of bits. For
12132 non-bit-fields DECL_INITIAL is a non-static data member
12133 initializer, which gets deferred instantiation. */
12135 = tsubst_expr (DECL_INITIAL (t
), args
,
12137 /*integral_constant_expression_p=*/true);
12138 else if (DECL_INITIAL (t
))
12140 /* Set up DECL_TEMPLATE_INFO so that we can get at the
12141 NSDMI in perform_member_init. Still set DECL_INITIAL
12142 so that we know there is one. */
12143 DECL_INITIAL (r
) = void_node
;
12144 gcc_assert (DECL_LANG_SPECIFIC (r
) == NULL
);
12145 retrofit_lang_decl (r
);
12146 DECL_TEMPLATE_INFO (r
) = build_template_info (t
, args
);
12148 /* We don't have to set DECL_CONTEXT here; it is set by
12149 finish_member_declaration. */
12150 DECL_CHAIN (r
) = NULL_TREE
;
12152 apply_late_template_attributes (&r
, DECL_ATTRIBUTES (r
), 0,
12153 args
, complain
, in_decl
);
12156 TREE_VEC_ELT (vec
, i
) = r
;
12162 tree pack
= make_node (NONTYPE_ARGUMENT_PACK
);
12163 tree tpack
= cxx_make_type (TYPE_ARGUMENT_PACK
);
12164 SET_ARGUMENT_PACK_ARGS (pack
, vec
);
12165 SET_ARGUMENT_PACK_ARGS (tpack
, expanded_types
);
12166 TREE_TYPE (pack
) = tpack
;
12167 register_specialization (pack
, t
, args
, false, 0);
12173 /* We reach here only for member using decls. We also need to check
12174 uses_template_parms because DECL_DEPENDENT_P is not set for a
12175 using-declaration that designates a member of the current
12176 instantiation (c++/53549). */
12177 if (DECL_DEPENDENT_P (t
)
12178 || uses_template_parms (USING_DECL_SCOPE (t
)))
12180 tree inst_scope
= tsubst_copy (USING_DECL_SCOPE (t
), args
,
12181 complain
, in_decl
);
12182 tree name
= tsubst_copy (DECL_NAME (t
), args
, complain
, in_decl
);
12183 r
= do_class_using_decl (inst_scope
, name
);
12185 r
= error_mark_node
;
12188 TREE_PROTECTED (r
) = TREE_PROTECTED (t
);
12189 TREE_PRIVATE (r
) = TREE_PRIVATE (t
);
12195 DECL_CHAIN (r
) = NULL_TREE
;
12202 tree argvec
= NULL_TREE
;
12203 tree gen_tmpl
= NULL_TREE
;
12205 tree tmpl
= NULL_TREE
;
12207 tree type
= NULL_TREE
;
12210 if (TREE_TYPE (t
) == error_mark_node
)
12211 RETURN (error_mark_node
);
12213 if (TREE_CODE (t
) == TYPE_DECL
12214 && t
== TYPE_MAIN_DECL (TREE_TYPE (t
)))
12216 /* If this is the canonical decl, we don't have to
12217 mess with instantiations, and often we can't (for
12218 typename, template type parms and such). Note that
12219 TYPE_NAME is not correct for the above test if
12220 we've copied the type for a typedef. */
12221 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
12222 if (type
== error_mark_node
)
12223 RETURN (error_mark_node
);
12224 r
= TYPE_NAME (type
);
12228 /* Check to see if we already have the specialization we
12231 if (DECL_CLASS_SCOPE_P (t
) || DECL_NAMESPACE_SCOPE_P (t
))
12233 /* T is a static data member or namespace-scope entity.
12234 We have to substitute into namespace-scope variables
12235 (not just variable templates) because of cases like:
12237 template <class T> void f() { extern T t; }
12239 where the entity referenced is not known until
12240 instantiation time. */
12242 ctx
= DECL_CONTEXT (t
);
12243 if (DECL_CLASS_SCOPE_P (t
))
12245 ctx
= tsubst_aggr_type (ctx
, args
,
12247 in_decl
, /*entering_scope=*/1);
12248 /* If CTX is unchanged, then T is in fact the
12249 specialization we want. That situation occurs when
12250 referencing a static data member within in its own
12251 class. We can use pointer equality, rather than
12252 same_type_p, because DECL_CONTEXT is always
12254 if (ctx
== DECL_CONTEXT (t
)
12255 /* ... unless T is a member template; in which
12256 case our caller can be willing to create a
12257 specialization of that template represented
12259 && !(DECL_TI_TEMPLATE (t
)
12260 && DECL_MEMBER_TEMPLATE_P (DECL_TI_TEMPLATE (t
))))
12266 tmpl
= DECL_TI_TEMPLATE (t
);
12267 gen_tmpl
= most_general_template (tmpl
);
12268 argvec
= tsubst (DECL_TI_ARGS (t
), args
, complain
, in_decl
);
12269 if (argvec
!= error_mark_node
)
12270 argvec
= (coerce_innermost_template_parms
12271 (DECL_TEMPLATE_PARMS (gen_tmpl
),
12272 argvec
, t
, complain
,
12273 /*all*/true, /*defarg*/true));
12274 if (argvec
== error_mark_node
)
12275 RETURN (error_mark_node
);
12276 hash
= hash_tmpl_and_args (gen_tmpl
, argvec
);
12277 spec
= retrieve_specialization (gen_tmpl
, argvec
, hash
);
12282 /* A local variable. */
12284 /* Subsequent calls to pushdecl will fill this in. */
12286 spec
= retrieve_local_specialization (t
);
12288 /* If we already have the specialization we need, there is
12289 nothing more to do. */
12296 /* Create a new node for the specialization we need. */
12298 if (type
== NULL_TREE
)
12300 if (is_typedef_decl (t
))
12301 type
= DECL_ORIGINAL_TYPE (t
);
12303 type
= TREE_TYPE (t
);
12305 && VAR_HAD_UNKNOWN_BOUND (t
)
12306 && type
!= error_mark_node
)
12307 type
= strip_array_domain (type
);
12308 type
= tsubst (type
, args
, complain
, in_decl
);
12312 /* Even if the original location is out of scope, the
12313 newly substituted one is not. */
12314 DECL_DEAD_FOR_LOCAL (r
) = 0;
12315 DECL_INITIALIZED_P (r
) = 0;
12316 DECL_TEMPLATE_INSTANTIATED (r
) = 0;
12317 if (type
== error_mark_node
)
12318 RETURN (error_mark_node
);
12319 if (TREE_CODE (type
) == FUNCTION_TYPE
)
12321 /* It may seem that this case cannot occur, since:
12326 declares a function, not a variable. However:
12329 template <typename T> void g() { T t; }
12330 template void g<f>();
12332 is an attempt to declare a variable with function
12334 error ("variable %qD has function type",
12335 /* R is not yet sufficiently initialized, so we
12336 just use its name. */
12338 RETURN (error_mark_node
);
12340 type
= complete_type (type
);
12341 /* Wait until cp_finish_decl to set this again, to handle
12342 circular dependency (template/instantiate6.C). */
12343 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (r
) = 0;
12344 type
= check_var_type (DECL_NAME (r
), type
);
12346 if (DECL_HAS_VALUE_EXPR_P (t
))
12348 tree ve
= DECL_VALUE_EXPR (t
);
12349 ve
= tsubst_expr (ve
, args
, complain
, in_decl
,
12350 /*constant_expression_p=*/false);
12351 if (REFERENCE_REF_P (ve
))
12353 gcc_assert (TREE_CODE (type
) == REFERENCE_TYPE
);
12354 ve
= TREE_OPERAND (ve
, 0);
12356 SET_DECL_VALUE_EXPR (r
, ve
);
12358 if (CP_DECL_THREAD_LOCAL_P (r
)
12359 && !processing_template_decl
)
12360 set_decl_tls_model (r
, decl_default_tls_model (r
));
12362 else if (DECL_SELF_REFERENCE_P (t
))
12363 SET_DECL_SELF_REFERENCE_P (r
);
12364 TREE_TYPE (r
) = type
;
12365 cp_apply_type_quals_to_decl (cp_type_quals (type
), r
);
12366 DECL_CONTEXT (r
) = ctx
;
12367 /* Clear out the mangled name and RTL for the instantiation. */
12368 SET_DECL_ASSEMBLER_NAME (r
, NULL_TREE
);
12369 if (CODE_CONTAINS_STRUCT (TREE_CODE (t
), TS_DECL_WRTL
))
12370 SET_DECL_RTL (r
, NULL
);
12371 /* The initializer must not be expanded until it is required;
12372 see [temp.inst]. */
12373 DECL_INITIAL (r
) = NULL_TREE
;
12375 DECL_MODE (r
) = VOIDmode
;
12376 if (CODE_CONTAINS_STRUCT (TREE_CODE (t
), TS_DECL_WRTL
))
12377 SET_DECL_RTL (r
, NULL
);
12378 DECL_SIZE (r
) = DECL_SIZE_UNIT (r
) = 0;
12381 /* Possibly limit visibility based on template args. */
12382 DECL_VISIBILITY (r
) = VISIBILITY_DEFAULT
;
12383 if (DECL_VISIBILITY_SPECIFIED (t
))
12385 DECL_VISIBILITY_SPECIFIED (r
) = 0;
12386 DECL_ATTRIBUTES (r
)
12387 = remove_attribute ("visibility", DECL_ATTRIBUTES (r
));
12389 determine_visibility (r
);
12394 /* A static data member declaration is always marked
12395 external when it is declared in-class, even if an
12396 initializer is present. We mimic the non-template
12397 processing here. */
12398 DECL_EXTERNAL (r
) = 1;
12399 if (DECL_NAMESPACE_SCOPE_P (t
))
12400 DECL_NOT_REALLY_EXTERN (r
) = 1;
12402 DECL_TEMPLATE_INFO (r
) = build_template_info (tmpl
, argvec
);
12403 SET_DECL_IMPLICIT_INSTANTIATION (r
);
12404 register_specialization (r
, gen_tmpl
, argvec
, false, hash
);
12408 if (DECL_LANG_SPECIFIC (r
))
12409 DECL_TEMPLATE_INFO (r
) = NULL_TREE
;
12410 if (!cp_unevaluated_operand
)
12411 register_local_specialization (r
, t
);
12414 DECL_CHAIN (r
) = NULL_TREE
;
12416 apply_late_template_attributes (&r
, DECL_ATTRIBUTES (r
),
12418 args
, complain
, in_decl
);
12420 /* Preserve a typedef that names a type. */
12421 if (is_typedef_decl (r
))
12423 DECL_ORIGINAL_TYPE (r
) = NULL_TREE
;
12424 set_underlying_type (r
);
12425 if (TYPE_DECL_ALIAS_P (r
) && type
!= error_mark_node
)
12426 /* An alias template specialization can be dependent
12427 even if its underlying type is not. */
12428 TYPE_DEPENDENT_P_VALID (TREE_TYPE (r
)) = false;
12431 layout_decl (r
, 0);
12436 gcc_unreachable ();
12441 /* Restore the file and line information. */
12442 input_location
= saved_loc
;
12447 /* Substitute into the ARG_TYPES of a function type.
12448 If END is a TREE_CHAIN, leave it and any following types
12452 tsubst_arg_types (tree arg_types
,
12455 tsubst_flags_t complain
,
12458 tree remaining_arg_types
;
12459 tree type
= NULL_TREE
;
12461 tree expanded_args
= NULL_TREE
;
12464 if (!arg_types
|| arg_types
== void_list_node
|| arg_types
== end
)
12467 remaining_arg_types
= tsubst_arg_types (TREE_CHAIN (arg_types
),
12468 args
, end
, complain
, in_decl
);
12469 if (remaining_arg_types
== error_mark_node
)
12470 return error_mark_node
;
12472 if (PACK_EXPANSION_P (TREE_VALUE (arg_types
)))
12474 /* For a pack expansion, perform substitution on the
12475 entire expression. Later on, we'll handle the arguments
12477 expanded_args
= tsubst_pack_expansion (TREE_VALUE (arg_types
),
12478 args
, complain
, in_decl
);
12480 if (TREE_CODE (expanded_args
) == TREE_VEC
)
12481 /* So that we'll spin through the parameters, one by one. */
12482 i
= TREE_VEC_LENGTH (expanded_args
);
12485 /* We only partially substituted into the parameter
12486 pack. Our type is TYPE_PACK_EXPANSION. */
12487 type
= expanded_args
;
12488 expanded_args
= NULL_TREE
;
12496 type
= TREE_VEC_ELT (expanded_args
, i
);
12498 type
= tsubst (TREE_VALUE (arg_types
), args
, complain
, in_decl
);
12500 if (type
== error_mark_node
)
12501 return error_mark_node
;
12502 if (VOID_TYPE_P (type
))
12504 if (complain
& tf_error
)
12506 error ("invalid parameter type %qT", type
);
12508 error ("in declaration %q+D", in_decl
);
12510 return error_mark_node
;
12513 if (abstract_virtuals_error_sfinae (ACU_PARM
, type
, complain
))
12514 return error_mark_node
;
12516 /* Do array-to-pointer, function-to-pointer conversion, and ignore
12517 top-level qualifiers as required. */
12518 type
= cv_unqualified (type_decays_to (type
));
12520 /* We do not substitute into default arguments here. The standard
12521 mandates that they be instantiated only when needed, which is
12522 done in build_over_call. */
12523 default_arg
= TREE_PURPOSE (arg_types
);
12525 if (default_arg
&& TREE_CODE (default_arg
) == DEFAULT_ARG
)
12527 /* We've instantiated a template before its default arguments
12528 have been parsed. This can happen for a nested template
12529 class, and is not an error unless we require the default
12530 argument in a call of this function. */
12531 remaining_arg_types
=
12532 tree_cons (default_arg
, type
, remaining_arg_types
);
12533 vec_safe_push (DEFARG_INSTANTIATIONS(default_arg
), remaining_arg_types
);
12536 remaining_arg_types
=
12537 hash_tree_cons (default_arg
, type
, remaining_arg_types
);
12540 return remaining_arg_types
;
12543 /* Substitute into a FUNCTION_TYPE or METHOD_TYPE. This routine does
12544 *not* handle the exception-specification for FNTYPE, because the
12545 initial substitution of explicitly provided template parameters
12546 during argument deduction forbids substitution into the
12547 exception-specification:
12551 All references in the function type of the function template to the
12552 corresponding template parameters are replaced by the specified tem-
12553 plate argument values. If a substitution in a template parameter or
12554 in the function type of the function template results in an invalid
12555 type, type deduction fails. [Note: The equivalent substitution in
12556 exception specifications is done only when the function is instanti-
12557 ated, at which point a program is ill-formed if the substitution
12558 results in an invalid type.] */
12561 tsubst_function_type (tree t
,
12563 tsubst_flags_t complain
,
12567 tree arg_types
= NULL_TREE
;
12570 /* The TYPE_CONTEXT is not used for function/method types. */
12571 gcc_assert (TYPE_CONTEXT (t
) == NULL_TREE
);
12573 /* DR 1227: Mixing immediate and non-immediate contexts in deduction
12575 bool late_return_type_p
= TYPE_HAS_LATE_RETURN_TYPE (t
);
12577 if (late_return_type_p
)
12579 /* Substitute the argument types. */
12580 arg_types
= tsubst_arg_types (TYPE_ARG_TYPES (t
), args
, NULL_TREE
,
12581 complain
, in_decl
);
12582 if (arg_types
== error_mark_node
)
12583 return error_mark_node
;
12585 tree save_ccp
= current_class_ptr
;
12586 tree save_ccr
= current_class_ref
;
12587 tree this_type
= (TREE_CODE (t
) == METHOD_TYPE
12588 ? TREE_TYPE (TREE_VALUE (arg_types
)) : NULL_TREE
);
12589 bool do_inject
= this_type
&& CLASS_TYPE_P (this_type
);
12592 /* DR 1207: 'this' is in scope in the trailing return type. */
12593 inject_this_parameter (this_type
, cp_type_quals (this_type
));
12596 /* Substitute the return type. */
12597 return_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
12601 current_class_ptr
= save_ccp
;
12602 current_class_ref
= save_ccr
;
12606 /* Substitute the return type. */
12607 return_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
12609 if (return_type
== error_mark_node
)
12610 return error_mark_node
;
12611 /* DR 486 clarifies that creation of a function type with an
12612 invalid return type is a deduction failure. */
12613 if (TREE_CODE (return_type
) == ARRAY_TYPE
12614 || TREE_CODE (return_type
) == FUNCTION_TYPE
)
12616 if (complain
& tf_error
)
12618 if (TREE_CODE (return_type
) == ARRAY_TYPE
)
12619 error ("function returning an array");
12621 error ("function returning a function");
12623 return error_mark_node
;
12626 if (abstract_virtuals_error_sfinae (ACU_RETURN
, return_type
, complain
))
12627 return error_mark_node
;
12629 if (!late_return_type_p
)
12631 /* Substitute the argument types. */
12632 arg_types
= tsubst_arg_types (TYPE_ARG_TYPES (t
), args
, NULL_TREE
,
12633 complain
, in_decl
);
12634 if (arg_types
== error_mark_node
)
12635 return error_mark_node
;
12638 /* Construct a new type node and return it. */
12639 if (TREE_CODE (t
) == FUNCTION_TYPE
)
12641 fntype
= build_function_type (return_type
, arg_types
);
12642 fntype
= apply_memfn_quals (fntype
,
12643 type_memfn_quals (t
),
12644 type_memfn_rqual (t
));
12648 tree r
= TREE_TYPE (TREE_VALUE (arg_types
));
12649 /* Don't pick up extra function qualifiers from the basetype. */
12650 r
= cp_build_qualified_type_real (r
, type_memfn_quals (t
), complain
);
12651 if (! MAYBE_CLASS_TYPE_P (r
))
12655 Type deduction may fail for any of the following
12658 -- Attempting to create "pointer to member of T" when T
12659 is not a class type. */
12660 if (complain
& tf_error
)
12661 error ("creating pointer to member function of non-class type %qT",
12663 return error_mark_node
;
12666 fntype
= build_method_type_directly (r
, return_type
,
12667 TREE_CHAIN (arg_types
));
12668 fntype
= build_ref_qualified_type (fntype
, type_memfn_rqual (t
));
12670 fntype
= cp_build_type_attribute_variant (fntype
, TYPE_ATTRIBUTES (t
));
12672 if (late_return_type_p
)
12673 TYPE_HAS_LATE_RETURN_TYPE (fntype
) = 1;
12678 /* FNTYPE is a FUNCTION_TYPE or METHOD_TYPE. Substitute the template
12679 ARGS into that specification, and return the substituted
12680 specification. If there is no specification, return NULL_TREE. */
12683 tsubst_exception_specification (tree fntype
,
12685 tsubst_flags_t complain
,
12692 specs
= TYPE_RAISES_EXCEPTIONS (fntype
);
12693 new_specs
= NULL_TREE
;
12694 if (specs
&& TREE_PURPOSE (specs
))
12696 /* A noexcept-specifier. */
12697 tree expr
= TREE_PURPOSE (specs
);
12698 if (TREE_CODE (expr
) == INTEGER_CST
)
12702 /* Defer instantiation of noexcept-specifiers to avoid
12703 excessive instantiations (c++/49107). */
12704 new_specs
= make_node (DEFERRED_NOEXCEPT
);
12705 if (DEFERRED_NOEXCEPT_SPEC_P (specs
))
12707 /* We already partially instantiated this member template,
12708 so combine the new args with the old. */
12709 DEFERRED_NOEXCEPT_PATTERN (new_specs
)
12710 = DEFERRED_NOEXCEPT_PATTERN (expr
);
12711 DEFERRED_NOEXCEPT_ARGS (new_specs
)
12712 = add_to_template_args (DEFERRED_NOEXCEPT_ARGS (expr
), args
);
12716 DEFERRED_NOEXCEPT_PATTERN (new_specs
) = expr
;
12717 DEFERRED_NOEXCEPT_ARGS (new_specs
) = args
;
12721 new_specs
= tsubst_copy_and_build
12722 (expr
, args
, complain
, in_decl
, /*function_p=*/false,
12723 /*integral_constant_expression_p=*/true);
12724 new_specs
= build_noexcept_spec (new_specs
, complain
);
12728 if (! TREE_VALUE (specs
))
12735 tree expanded_specs
= NULL_TREE
;
12737 if (PACK_EXPANSION_P (TREE_VALUE (specs
)))
12739 /* Expand the pack expansion type. */
12740 expanded_specs
= tsubst_pack_expansion (TREE_VALUE (specs
),
12744 if (expanded_specs
== error_mark_node
)
12745 return error_mark_node
;
12746 else if (TREE_CODE (expanded_specs
) == TREE_VEC
)
12747 len
= TREE_VEC_LENGTH (expanded_specs
);
12750 /* We're substituting into a member template, so
12751 we got a TYPE_PACK_EXPANSION back. Add that
12752 expansion and move on. */
12753 gcc_assert (TREE_CODE (expanded_specs
)
12754 == TYPE_PACK_EXPANSION
);
12755 new_specs
= add_exception_specifier (new_specs
,
12758 specs
= TREE_CHAIN (specs
);
12763 for (i
= 0; i
< len
; ++i
)
12765 if (expanded_specs
)
12766 spec
= TREE_VEC_ELT (expanded_specs
, i
);
12768 spec
= tsubst (TREE_VALUE (specs
), args
, complain
, in_decl
);
12769 if (spec
== error_mark_node
)
12771 new_specs
= add_exception_specifier (new_specs
, spec
,
12775 specs
= TREE_CHAIN (specs
);
12781 /* Take the tree structure T and replace template parameters used
12782 therein with the argument vector ARGS. IN_DECL is an associated
12783 decl for diagnostics. If an error occurs, returns ERROR_MARK_NODE.
12784 Issue error and warning messages under control of COMPLAIN. Note
12785 that we must be relatively non-tolerant of extensions here, in
12786 order to preserve conformance; if we allow substitutions that
12787 should not be allowed, we may allow argument deductions that should
12788 not succeed, and therefore report ambiguous overload situations
12789 where there are none. In theory, we could allow the substitution,
12790 but indicate that it should have failed, and allow our caller to
12791 make sure that the right thing happens, but we don't try to do this
12794 This function is used for dealing with types, decls and the like;
12795 for expressions, use tsubst_expr or tsubst_copy. */
12798 tsubst (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
12800 enum tree_code code
;
12801 tree type
, r
= NULL_TREE
;
12803 if (t
== NULL_TREE
|| t
== error_mark_node
12804 || t
== integer_type_node
12805 || t
== void_type_node
12806 || t
== char_type_node
12807 || t
== unknown_type_node
12808 || TREE_CODE (t
) == NAMESPACE_DECL
12809 || TREE_CODE (t
) == TRANSLATION_UNIT_DECL
)
12813 return tsubst_decl (t
, args
, complain
);
12815 if (args
== NULL_TREE
)
12818 code
= TREE_CODE (t
);
12820 if (code
== IDENTIFIER_NODE
)
12821 type
= IDENTIFIER_TYPE_VALUE (t
);
12823 type
= TREE_TYPE (t
);
12825 gcc_assert (type
!= unknown_type_node
);
12827 /* Reuse typedefs. We need to do this to handle dependent attributes,
12828 such as attribute aligned. */
12830 && typedef_variant_p (t
))
12832 tree decl
= TYPE_NAME (t
);
12834 if (alias_template_specialization_p (t
))
12836 /* DECL represents an alias template and we want to
12838 tree tmpl
= most_general_template (DECL_TI_TEMPLATE (decl
));
12839 tree gen_args
= tsubst (DECL_TI_ARGS (decl
), args
, complain
, in_decl
);
12840 r
= instantiate_alias_template (tmpl
, gen_args
, complain
);
12842 else if (DECL_CLASS_SCOPE_P (decl
)
12843 && CLASSTYPE_TEMPLATE_INFO (DECL_CONTEXT (decl
))
12844 && uses_template_parms (DECL_CONTEXT (decl
)))
12846 tree tmpl
= most_general_template (DECL_TI_TEMPLATE (decl
));
12847 tree gen_args
= tsubst (DECL_TI_ARGS (decl
), args
, complain
, in_decl
);
12848 r
= retrieve_specialization (tmpl
, gen_args
, 0);
12850 else if (DECL_FUNCTION_SCOPE_P (decl
)
12851 && DECL_TEMPLATE_INFO (DECL_CONTEXT (decl
))
12852 && uses_template_parms (DECL_TI_ARGS (DECL_CONTEXT (decl
))))
12853 r
= retrieve_local_specialization (decl
);
12855 /* The typedef is from a non-template context. */
12861 r
= cp_build_qualified_type_real
12862 (r
, cp_type_quals (t
) | cp_type_quals (r
),
12863 complain
| tf_ignore_bad_quals
);
12868 /* We don't have an instantiation yet, so drop the typedef. */
12869 int quals
= cp_type_quals (t
);
12870 t
= DECL_ORIGINAL_TYPE (decl
);
12871 t
= cp_build_qualified_type_real (t
, quals
,
12872 complain
| tf_ignore_bad_quals
);
12877 && code
!= TYPENAME_TYPE
12878 && code
!= TEMPLATE_TYPE_PARM
12879 && code
!= IDENTIFIER_NODE
12880 && code
!= FUNCTION_TYPE
12881 && code
!= METHOD_TYPE
)
12882 type
= tsubst (type
, args
, complain
, in_decl
);
12883 if (type
== error_mark_node
)
12884 return error_mark_node
;
12890 case ENUMERAL_TYPE
:
12891 return tsubst_aggr_type (t
, args
, complain
, in_decl
,
12892 /*entering_scope=*/0);
12895 case IDENTIFIER_NODE
:
12906 if (t
== integer_type_node
)
12909 if (TREE_CODE (TYPE_MIN_VALUE (t
)) == INTEGER_CST
12910 && TREE_CODE (TYPE_MAX_VALUE (t
)) == INTEGER_CST
)
12914 tree max
, omax
= TREE_OPERAND (TYPE_MAX_VALUE (t
), 0);
12916 max
= tsubst_expr (omax
, args
, complain
, in_decl
,
12917 /*integral_constant_expression_p=*/false);
12919 /* Fix up type of the magic NOP_EXPR with TREE_SIDE_EFFECTS if
12921 if (TREE_CODE (max
) == NOP_EXPR
12922 && TREE_SIDE_EFFECTS (omax
)
12923 && !TREE_TYPE (max
))
12924 TREE_TYPE (max
) = TREE_TYPE (TREE_OPERAND (max
, 0));
12926 /* If we're in a partial instantiation, preserve the magic NOP_EXPR
12927 with TREE_SIDE_EFFECTS that indicates this is not an integral
12928 constant expression. */
12929 if (processing_template_decl
12930 && TREE_SIDE_EFFECTS (omax
) && TREE_CODE (omax
) == NOP_EXPR
)
12932 gcc_assert (TREE_CODE (max
) == NOP_EXPR
);
12933 TREE_SIDE_EFFECTS (max
) = 1;
12936 return compute_array_index_type (NULL_TREE
, max
, complain
);
12939 case TEMPLATE_TYPE_PARM
:
12940 case TEMPLATE_TEMPLATE_PARM
:
12941 case BOUND_TEMPLATE_TEMPLATE_PARM
:
12942 case TEMPLATE_PARM_INDEX
:
12947 tree arg
= NULL_TREE
;
12949 /* Early in template argument deduction substitution, we don't
12950 want to reduce the level of 'auto', or it will be confused
12951 with a normal template parm in subsequent deduction. */
12952 if (is_auto (t
) && (complain
& tf_partial
))
12957 gcc_assert (TREE_VEC_LENGTH (args
) > 0);
12958 template_parm_level_and_index (t
, &level
, &idx
);
12960 levels
= TMPL_ARGS_DEPTH (args
);
12961 if (level
<= levels
12962 && TREE_VEC_LENGTH (TMPL_ARGS_LEVEL (args
, level
)) > 0)
12964 arg
= TMPL_ARG (args
, level
, idx
);
12966 if (arg
&& TREE_CODE (arg
) == ARGUMENT_PACK_SELECT
)
12968 /* See through ARGUMENT_PACK_SELECT arguments. */
12969 arg
= ARGUMENT_PACK_SELECT_ARG (arg
);
12970 /* If the selected argument is an expansion E, that most
12971 likely means we were called from
12972 gen_elem_of_pack_expansion_instantiation during the
12973 substituting of pack an argument pack (which Ith
12974 element is a pack expansion, where I is
12975 ARGUMENT_PACK_SELECT_INDEX) into a pack expansion.
12976 In this case, the Ith element resulting from this
12977 substituting is going to be a pack expansion, which
12978 pattern is the pattern of E. Let's return the
12980 gen_elem_of_pack_expansion_instantiation will
12981 build the resulting pack expansion from it. */
12982 if (PACK_EXPANSION_P (arg
))
12984 /* Make sure we aren't throwing away arg info. */
12985 gcc_assert (!PACK_EXPANSION_EXTRA_ARGS (arg
));
12986 arg
= PACK_EXPANSION_PATTERN (arg
);
12991 if (arg
== error_mark_node
)
12992 return error_mark_node
;
12993 else if (arg
!= NULL_TREE
)
12995 if (ARGUMENT_PACK_P (arg
))
12996 /* If ARG is an argument pack, we don't actually want to
12997 perform a substitution here, because substitutions
12998 for argument packs are only done
12999 element-by-element. We can get to this point when
13000 substituting the type of a non-type template
13001 parameter pack, when that type actually contains
13002 template parameter packs from an outer template, e.g.,
13004 template<typename... Types> struct A {
13005 template<Types... Values> struct B { };
13009 if (code
== TEMPLATE_TYPE_PARM
)
13012 gcc_assert (TYPE_P (arg
));
13014 quals
= cp_type_quals (arg
) | cp_type_quals (t
);
13016 return cp_build_qualified_type_real
13017 (arg
, quals
, complain
| tf_ignore_bad_quals
);
13019 else if (code
== BOUND_TEMPLATE_TEMPLATE_PARM
)
13021 /* We are processing a type constructed from a
13022 template template parameter. */
13023 tree argvec
= tsubst (TYPE_TI_ARGS (t
),
13024 args
, complain
, in_decl
);
13025 if (argvec
== error_mark_node
)
13026 return error_mark_node
;
13028 gcc_assert (TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
13029 || TREE_CODE (arg
) == TEMPLATE_DECL
13030 || TREE_CODE (arg
) == UNBOUND_CLASS_TEMPLATE
);
13032 if (TREE_CODE (arg
) == UNBOUND_CLASS_TEMPLATE
)
13033 /* Consider this code:
13035 template <template <class> class Template>
13037 template <class Arg> using Bind = Template<Arg>;
13040 template <template <class> class Template, class Arg>
13041 using Instantiate = Template<Arg>; //#0
13043 template <template <class> class Template,
13046 Instantiate<Internal<Template>::template Bind,
13049 When #1 is parsed, the
13050 BOUND_TEMPLATE_TEMPLATE_PARM representing the
13051 parameter `Template' in #0 matches the
13052 UNBOUND_CLASS_TEMPLATE representing the argument
13053 `Internal<Template>::template Bind'; We then want
13054 to assemble the type `Bind<Argument>' that can't
13055 be fully created right now, because
13056 `Internal<Template>' not being complete, the Bind
13057 template cannot be looked up in that context. So
13058 we need to "store" `Bind<Argument>' for later
13059 when the context of Bind becomes complete. Let's
13060 store that in a TYPENAME_TYPE. */
13061 return make_typename_type (TYPE_CONTEXT (arg
),
13062 build_nt (TEMPLATE_ID_EXPR
,
13063 TYPE_IDENTIFIER (arg
),
13068 /* We can get a TEMPLATE_TEMPLATE_PARM here when we
13069 are resolving nested-types in the signature of a
13070 member function templates. Otherwise ARG is a
13071 TEMPLATE_DECL and is the real template to be
13073 if (TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
)
13074 arg
= TYPE_NAME (arg
);
13076 r
= lookup_template_class (arg
,
13078 DECL_CONTEXT (arg
),
13079 /*entering_scope=*/0,
13081 return cp_build_qualified_type_real
13082 (r
, cp_type_quals (t
) | cp_type_quals (r
), complain
);
13085 /* TEMPLATE_TEMPLATE_PARM or TEMPLATE_PARM_INDEX. */
13086 return convert_from_reference (unshare_expr (arg
));
13090 /* This can happen during the attempted tsubst'ing in
13091 unify. This means that we don't yet have any information
13092 about the template parameter in question. */
13095 /* If we get here, we must have been looking at a parm for a
13096 more deeply nested template. Make a new version of this
13097 template parameter, but with a lower level. */
13100 case TEMPLATE_TYPE_PARM
:
13101 case TEMPLATE_TEMPLATE_PARM
:
13102 case BOUND_TEMPLATE_TEMPLATE_PARM
:
13103 if (cp_type_quals (t
))
13105 r
= tsubst (TYPE_MAIN_VARIANT (t
), args
, complain
, in_decl
);
13106 r
= cp_build_qualified_type_real
13107 (r
, cp_type_quals (t
),
13108 complain
| (code
== TEMPLATE_TYPE_PARM
13109 ? tf_ignore_bad_quals
: 0));
13111 else if (TREE_CODE (t
) == TEMPLATE_TYPE_PARM
13112 && PLACEHOLDER_TYPE_CONSTRAINTS (t
)
13113 && (r
= (TEMPLATE_PARM_DESCENDANTS
13114 (TEMPLATE_TYPE_PARM_INDEX (t
))))
13115 && (r
= TREE_TYPE (r
))
13116 && !PLACEHOLDER_TYPE_CONSTRAINTS (r
))
13117 /* Break infinite recursion when substituting the constraints
13118 of a constrained placeholder. */;
13122 TEMPLATE_TYPE_PARM_INDEX (r
)
13123 = reduce_template_parm_level (TEMPLATE_TYPE_PARM_INDEX (t
),
13124 r
, levels
, args
, complain
);
13125 TYPE_STUB_DECL (r
) = TYPE_NAME (r
) = TEMPLATE_TYPE_DECL (r
);
13126 TYPE_MAIN_VARIANT (r
) = r
;
13127 TYPE_POINTER_TO (r
) = NULL_TREE
;
13128 TYPE_REFERENCE_TO (r
) = NULL_TREE
;
13130 /* Propagate constraints on placeholders. */
13131 if (TREE_CODE (t
) == TEMPLATE_TYPE_PARM
)
13132 if (tree constr
= PLACEHOLDER_TYPE_CONSTRAINTS (t
))
13133 PLACEHOLDER_TYPE_CONSTRAINTS (r
)
13134 = tsubst_constraint (constr
, args
, complain
, in_decl
);
13136 if (TREE_CODE (r
) == TEMPLATE_TEMPLATE_PARM
)
13137 /* We have reduced the level of the template
13138 template parameter, but not the levels of its
13139 template parameters, so canonical_type_parameter
13140 will not be able to find the canonical template
13141 template parameter for this level. Thus, we
13142 require structural equality checking to compare
13143 TEMPLATE_TEMPLATE_PARMs. */
13144 SET_TYPE_STRUCTURAL_EQUALITY (r
);
13145 else if (TYPE_STRUCTURAL_EQUALITY_P (t
))
13146 SET_TYPE_STRUCTURAL_EQUALITY (r
);
13148 TYPE_CANONICAL (r
) = canonical_type_parameter (r
);
13150 if (code
== BOUND_TEMPLATE_TEMPLATE_PARM
)
13152 tree argvec
= tsubst (TYPE_TI_ARGS (t
), args
,
13153 complain
, in_decl
);
13154 if (argvec
== error_mark_node
)
13155 return error_mark_node
;
13157 TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (r
)
13158 = build_template_info (TYPE_TI_TEMPLATE (t
), argvec
);
13163 case TEMPLATE_PARM_INDEX
:
13164 r
= reduce_template_parm_level (t
, type
, levels
, args
, complain
);
13168 gcc_unreachable ();
13176 tree purpose
, value
, chain
;
13178 if (t
== void_list_node
)
13181 purpose
= TREE_PURPOSE (t
);
13184 purpose
= tsubst (purpose
, args
, complain
, in_decl
);
13185 if (purpose
== error_mark_node
)
13186 return error_mark_node
;
13188 value
= TREE_VALUE (t
);
13191 value
= tsubst (value
, args
, complain
, in_decl
);
13192 if (value
== error_mark_node
)
13193 return error_mark_node
;
13195 chain
= TREE_CHAIN (t
);
13196 if (chain
&& chain
!= void_type_node
)
13198 chain
= tsubst (chain
, args
, complain
, in_decl
);
13199 if (chain
== error_mark_node
)
13200 return error_mark_node
;
13202 if (purpose
== TREE_PURPOSE (t
)
13203 && value
== TREE_VALUE (t
)
13204 && chain
== TREE_CHAIN (t
))
13206 return hash_tree_cons (purpose
, value
, chain
);
13210 /* We should never be tsubsting a binfo. */
13211 gcc_unreachable ();
13214 /* A vector of template arguments. */
13215 gcc_assert (!type
);
13216 return tsubst_template_args (t
, args
, complain
, in_decl
);
13219 case REFERENCE_TYPE
:
13221 if (type
== TREE_TYPE (t
) && TREE_CODE (type
) != METHOD_TYPE
)
13226 Type deduction may fail for any of the following
13229 -- Attempting to create a pointer to reference type.
13230 -- Attempting to create a reference to a reference type or
13231 a reference to void.
13233 Core issue 106 says that creating a reference to a reference
13234 during instantiation is no longer a cause for failure. We
13235 only enforce this check in strict C++98 mode. */
13236 if ((TREE_CODE (type
) == REFERENCE_TYPE
13237 && (((cxx_dialect
== cxx98
) && flag_iso
) || code
!= REFERENCE_TYPE
))
13238 || (code
== REFERENCE_TYPE
&& VOID_TYPE_P (type
)))
13240 static location_t last_loc
;
13242 /* We keep track of the last time we issued this error
13243 message to avoid spewing a ton of messages during a
13244 single bad template instantiation. */
13245 if (complain
& tf_error
13246 && last_loc
!= input_location
)
13248 if (VOID_TYPE_P (type
))
13249 error ("forming reference to void");
13250 else if (code
== POINTER_TYPE
)
13251 error ("forming pointer to reference type %qT", type
);
13253 error ("forming reference to reference type %qT", type
);
13254 last_loc
= input_location
;
13257 return error_mark_node
;
13259 else if (TREE_CODE (type
) == FUNCTION_TYPE
13260 && (type_memfn_quals (type
) != TYPE_UNQUALIFIED
13261 || type_memfn_rqual (type
) != REF_QUAL_NONE
))
13263 if (complain
& tf_error
)
13265 if (code
== POINTER_TYPE
)
13266 error ("forming pointer to qualified function type %qT",
13269 error ("forming reference to qualified function type %qT",
13272 return error_mark_node
;
13274 else if (code
== POINTER_TYPE
)
13276 r
= build_pointer_type (type
);
13277 if (TREE_CODE (type
) == METHOD_TYPE
)
13278 r
= build_ptrmemfunc_type (r
);
13280 else if (TREE_CODE (type
) == REFERENCE_TYPE
)
13281 /* In C++0x, during template argument substitution, when there is an
13282 attempt to create a reference to a reference type, reference
13283 collapsing is applied as described in [14.3.1/4 temp.arg.type]:
13285 "If a template-argument for a template-parameter T names a type
13286 that is a reference to a type A, an attempt to create the type
13287 'lvalue reference to cv T' creates the type 'lvalue reference to
13288 A,' while an attempt to create the type type rvalue reference to
13289 cv T' creates the type T"
13291 r
= cp_build_reference_type
13293 TYPE_REF_IS_RVALUE (t
) && TYPE_REF_IS_RVALUE (type
));
13295 r
= cp_build_reference_type (type
, TYPE_REF_IS_RVALUE (t
));
13296 r
= cp_build_qualified_type_real (r
, cp_type_quals (t
), complain
);
13298 if (r
!= error_mark_node
)
13299 /* Will this ever be needed for TYPE_..._TO values? */
13306 r
= tsubst (TYPE_OFFSET_BASETYPE (t
), args
, complain
, in_decl
);
13307 if (r
== error_mark_node
|| !MAYBE_CLASS_TYPE_P (r
))
13311 Type deduction may fail for any of the following
13314 -- Attempting to create "pointer to member of T" when T
13315 is not a class type. */
13316 if (complain
& tf_error
)
13317 error ("creating pointer to member of non-class type %qT", r
);
13318 return error_mark_node
;
13320 if (TREE_CODE (type
) == REFERENCE_TYPE
)
13322 if (complain
& tf_error
)
13323 error ("creating pointer to member reference type %qT", type
);
13324 return error_mark_node
;
13326 if (VOID_TYPE_P (type
))
13328 if (complain
& tf_error
)
13329 error ("creating pointer to member of type void");
13330 return error_mark_node
;
13332 gcc_assert (TREE_CODE (type
) != METHOD_TYPE
);
13333 if (TREE_CODE (type
) == FUNCTION_TYPE
)
13335 /* The type of the implicit object parameter gets its
13336 cv-qualifiers from the FUNCTION_TYPE. */
13339 = build_memfn_type (type
, r
, type_memfn_quals (type
),
13340 type_memfn_rqual (type
));
13341 memptr
= build_ptrmemfunc_type (build_pointer_type (method_type
));
13342 return cp_build_qualified_type_real (memptr
, cp_type_quals (t
),
13346 return cp_build_qualified_type_real (build_ptrmem_type (r
, type
),
13350 case FUNCTION_TYPE
:
13355 fntype
= tsubst_function_type (t
, args
, complain
, in_decl
);
13356 if (fntype
== error_mark_node
)
13357 return error_mark_node
;
13359 /* Substitute the exception specification. */
13360 specs
= tsubst_exception_specification (t
, args
, complain
,
13361 in_decl
, /*defer_ok*/true);
13362 if (specs
== error_mark_node
)
13363 return error_mark_node
;
13365 fntype
= build_exception_variant (fntype
, specs
);
13370 tree domain
= tsubst (TYPE_DOMAIN (t
), args
, complain
, in_decl
);
13371 if (domain
== error_mark_node
)
13372 return error_mark_node
;
13374 /* As an optimization, we avoid regenerating the array type if
13375 it will obviously be the same as T. */
13376 if (type
== TREE_TYPE (t
) && domain
== TYPE_DOMAIN (t
))
13379 /* These checks should match the ones in create_array_type_for_decl.
13383 The deduction may fail for any of the following reasons:
13385 -- Attempting to create an array with an element type that
13386 is void, a function type, or a reference type, or [DR337]
13387 an abstract class type. */
13388 if (VOID_TYPE_P (type
)
13389 || TREE_CODE (type
) == FUNCTION_TYPE
13390 || (TREE_CODE (type
) == ARRAY_TYPE
13391 && TYPE_DOMAIN (type
) == NULL_TREE
)
13392 || TREE_CODE (type
) == REFERENCE_TYPE
)
13394 if (complain
& tf_error
)
13395 error ("creating array of %qT", type
);
13396 return error_mark_node
;
13399 if (abstract_virtuals_error_sfinae (ACU_ARRAY
, type
, complain
))
13400 return error_mark_node
;
13402 r
= build_cplus_array_type (type
, domain
);
13404 if (TYPE_USER_ALIGN (t
))
13406 SET_TYPE_ALIGN (r
, TYPE_ALIGN (t
));
13407 TYPE_USER_ALIGN (r
) = 1;
13413 case TYPENAME_TYPE
:
13415 tree ctx
= tsubst_aggr_type (TYPE_CONTEXT (t
), args
, complain
,
13416 in_decl
, /*entering_scope=*/1);
13417 tree f
= tsubst_copy (TYPENAME_TYPE_FULLNAME (t
), args
,
13418 complain
, in_decl
);
13420 if (ctx
== error_mark_node
|| f
== error_mark_node
)
13421 return error_mark_node
;
13423 if (!MAYBE_CLASS_TYPE_P (ctx
))
13425 if (complain
& tf_error
)
13426 error ("%qT is not a class, struct, or union type", ctx
);
13427 return error_mark_node
;
13429 else if (!uses_template_parms (ctx
) && !TYPE_BEING_DEFINED (ctx
))
13431 /* Normally, make_typename_type does not require that the CTX
13432 have complete type in order to allow things like:
13434 template <class T> struct S { typename S<T>::X Y; };
13436 But, such constructs have already been resolved by this
13437 point, so here CTX really should have complete type, unless
13438 it's a partial instantiation. */
13439 ctx
= complete_type (ctx
);
13440 if (!COMPLETE_TYPE_P (ctx
))
13442 if (complain
& tf_error
)
13443 cxx_incomplete_type_error (NULL_TREE
, ctx
);
13444 return error_mark_node
;
13448 f
= make_typename_type (ctx
, f
, typename_type
,
13449 complain
| tf_keep_type_decl
);
13450 if (f
== error_mark_node
)
13452 if (TREE_CODE (f
) == TYPE_DECL
)
13454 complain
|= tf_ignore_bad_quals
;
13458 if (TREE_CODE (f
) != TYPENAME_TYPE
)
13460 if (TYPENAME_IS_ENUM_P (t
) && TREE_CODE (f
) != ENUMERAL_TYPE
)
13462 if (complain
& tf_error
)
13463 error ("%qT resolves to %qT, which is not an enumeration type",
13466 return error_mark_node
;
13468 else if (TYPENAME_IS_CLASS_P (t
) && !CLASS_TYPE_P (f
))
13470 if (complain
& tf_error
)
13471 error ("%qT resolves to %qT, which is is not a class type",
13474 return error_mark_node
;
13478 return cp_build_qualified_type_real
13479 (f
, cp_type_quals (f
) | cp_type_quals (t
), complain
);
13482 case UNBOUND_CLASS_TEMPLATE
:
13484 tree ctx
= tsubst_aggr_type (TYPE_CONTEXT (t
), args
, complain
,
13485 in_decl
, /*entering_scope=*/1);
13486 tree name
= TYPE_IDENTIFIER (t
);
13487 tree parm_list
= DECL_TEMPLATE_PARMS (TYPE_NAME (t
));
13489 if (ctx
== error_mark_node
|| name
== error_mark_node
)
13490 return error_mark_node
;
13493 parm_list
= tsubst_template_parms (parm_list
, args
, complain
);
13494 return make_unbound_class_template (ctx
, name
, parm_list
, complain
);
13501 ++cp_unevaluated_operand
;
13502 ++c_inhibit_evaluation_warnings
;
13504 type
= tsubst_expr (TYPEOF_TYPE_EXPR (t
), args
,
13506 /*integral_constant_expression_p=*/false);
13508 --cp_unevaluated_operand
;
13509 --c_inhibit_evaluation_warnings
;
13511 type
= finish_typeof (type
);
13512 return cp_build_qualified_type_real (type
,
13514 | cp_type_quals (type
),
13518 case DECLTYPE_TYPE
:
13522 ++cp_unevaluated_operand
;
13523 ++c_inhibit_evaluation_warnings
;
13525 type
= tsubst_copy_and_build (DECLTYPE_TYPE_EXPR (t
), args
,
13526 complain
|tf_decltype
, in_decl
,
13527 /*function_p*/false,
13528 /*integral_constant_expression*/false);
13530 --cp_unevaluated_operand
;
13531 --c_inhibit_evaluation_warnings
;
13533 if (DECLTYPE_FOR_LAMBDA_CAPTURE (t
))
13534 type
= lambda_capture_field_type (type
,
13535 DECLTYPE_FOR_INIT_CAPTURE (t
));
13536 else if (DECLTYPE_FOR_LAMBDA_PROXY (t
))
13537 type
= lambda_proxy_type (type
);
13540 bool id
= DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (t
);
13541 if (id
&& TREE_CODE (DECLTYPE_TYPE_EXPR (t
)) == BIT_NOT_EXPR
13543 /* In a template ~id could be either a complement expression
13544 or an unqualified-id naming a destructor; if instantiating
13545 it produces an expression, it's not an id-expression or
13548 type
= finish_decltype_type (type
, id
, complain
);
13550 return cp_build_qualified_type_real (type
,
13552 | cp_type_quals (type
),
13553 complain
| tf_ignore_bad_quals
);
13556 case UNDERLYING_TYPE
:
13558 tree type
= tsubst (UNDERLYING_TYPE_TYPE (t
), args
,
13559 complain
, in_decl
);
13560 return finish_underlying_type (type
);
13563 case TYPE_ARGUMENT_PACK
:
13564 case NONTYPE_ARGUMENT_PACK
:
13566 tree r
= TYPE_P (t
) ? cxx_make_type (code
) : make_node (code
);
13568 tsubst_template_args (ARGUMENT_PACK_ARGS (t
),
13572 SET_ARGUMENT_PACK_ARGS (r
, packed_out
);
13574 /* For template nontype argument packs, also substitute into
13576 if (code
== NONTYPE_ARGUMENT_PACK
)
13577 TREE_TYPE (r
) = tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
13596 /* We should use one of the expression tsubsts for these codes. */
13597 gcc_unreachable ();
13600 sorry ("use of %qs in template", get_tree_code_name (code
));
13601 return error_mark_node
;
13605 /* Like tsubst_expr for a BASELINK. OBJECT_TYPE, if non-NULL, is the
13606 type of the expression on the left-hand side of the "." or "->"
13610 tsubst_baselink (tree baselink
, tree object_type
,
13611 tree args
, tsubst_flags_t complain
, tree in_decl
)
13614 tree qualifying_scope
;
13617 tree template_args
= 0;
13618 bool template_id_p
= false;
13619 bool qualified
= BASELINK_QUALIFIED_P (baselink
);
13621 /* A baselink indicates a function from a base class. Both the
13622 BASELINK_ACCESS_BINFO and the base class referenced may
13623 indicate bases of the template class, rather than the
13624 instantiated class. In addition, lookups that were not
13625 ambiguous before may be ambiguous now. Therefore, we perform
13626 the lookup again. */
13627 qualifying_scope
= BINFO_TYPE (BASELINK_ACCESS_BINFO (baselink
));
13628 qualifying_scope
= tsubst (qualifying_scope
, args
,
13629 complain
, in_decl
);
13630 fns
= BASELINK_FUNCTIONS (baselink
);
13631 optype
= tsubst (BASELINK_OPTYPE (baselink
), args
, complain
, in_decl
);
13632 if (TREE_CODE (fns
) == TEMPLATE_ID_EXPR
)
13634 template_id_p
= true;
13635 template_args
= TREE_OPERAND (fns
, 1);
13636 fns
= TREE_OPERAND (fns
, 0);
13638 template_args
= tsubst_template_args (template_args
, args
,
13639 complain
, in_decl
);
13641 name
= DECL_NAME (get_first_fn (fns
));
13642 if (IDENTIFIER_TYPENAME_P (name
))
13643 name
= mangle_conv_op_name_for_type (optype
);
13644 baselink
= lookup_fnfields (qualifying_scope
, name
, /*protect=*/1);
13647 if (constructor_name_p (name
, qualifying_scope
))
13649 if (complain
& tf_error
)
13650 error ("cannot call constructor %<%T::%D%> directly",
13651 qualifying_scope
, name
);
13653 return error_mark_node
;
13656 /* If lookup found a single function, mark it as used at this
13657 point. (If it lookup found multiple functions the one selected
13658 later by overload resolution will be marked as used at that
13660 if (BASELINK_P (baselink
))
13661 fns
= BASELINK_FUNCTIONS (baselink
);
13662 if (!template_id_p
&& !really_overloaded_fn (fns
)
13663 && !mark_used (OVL_CURRENT (fns
), complain
) && !(complain
& tf_error
))
13664 return error_mark_node
;
13666 /* Add back the template arguments, if present. */
13667 if (BASELINK_P (baselink
) && template_id_p
)
13668 BASELINK_FUNCTIONS (baselink
)
13669 = build2 (TEMPLATE_ID_EXPR
,
13671 BASELINK_FUNCTIONS (baselink
),
13673 /* Update the conversion operator type. */
13674 BASELINK_OPTYPE (baselink
) = optype
;
13677 object_type
= current_class_type
;
13680 baselink
= adjust_result_of_qualified_name_lookup (baselink
,
13686 /* Like tsubst_expr for a SCOPE_REF, given by QUALIFIED_ID. DONE is
13687 true if the qualified-id will be a postfix-expression in-and-of
13688 itself; false if more of the postfix-expression follows the
13689 QUALIFIED_ID. ADDRESS_P is true if the qualified-id is the operand
13693 tsubst_qualified_id (tree qualified_id
, tree args
,
13694 tsubst_flags_t complain
, tree in_decl
,
13695 bool done
, bool address_p
)
13701 tree template_args
;
13702 location_t loc
= UNKNOWN_LOCATION
;
13704 gcc_assert (TREE_CODE (qualified_id
) == SCOPE_REF
);
13706 /* Figure out what name to look up. */
13707 name
= TREE_OPERAND (qualified_id
, 1);
13708 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
13710 is_template
= true;
13711 loc
= EXPR_LOCATION (name
);
13712 template_args
= TREE_OPERAND (name
, 1);
13714 template_args
= tsubst_template_args (template_args
, args
,
13715 complain
, in_decl
);
13716 name
= TREE_OPERAND (name
, 0);
13720 is_template
= false;
13721 template_args
= NULL_TREE
;
13724 /* Substitute into the qualifying scope. When there are no ARGS, we
13725 are just trying to simplify a non-dependent expression. In that
13726 case the qualifying scope may be dependent, and, in any case,
13727 substituting will not help. */
13728 scope
= TREE_OPERAND (qualified_id
, 0);
13731 scope
= tsubst (scope
, args
, complain
, in_decl
);
13732 expr
= tsubst_copy (name
, args
, complain
, in_decl
);
13737 if (dependent_scope_p (scope
))
13740 expr
= build_min_nt_loc (loc
, TEMPLATE_ID_EXPR
, expr
, template_args
);
13741 return build_qualified_name (NULL_TREE
, scope
, expr
,
13742 QUALIFIED_NAME_IS_TEMPLATE (qualified_id
));
13745 if (!BASELINK_P (name
) && !DECL_P (expr
))
13747 if (TREE_CODE (expr
) == BIT_NOT_EXPR
)
13749 /* A BIT_NOT_EXPR is used to represent a destructor. */
13750 if (!check_dtor_name (scope
, TREE_OPERAND (expr
, 0)))
13752 error ("qualifying type %qT does not match destructor name ~%qT",
13753 scope
, TREE_OPERAND (expr
, 0));
13754 expr
= error_mark_node
;
13757 expr
= lookup_qualified_name (scope
, complete_dtor_identifier
,
13758 /*is_type_p=*/0, false);
13761 expr
= lookup_qualified_name (scope
, expr
, /*is_type_p=*/0, false);
13762 if (TREE_CODE (TREE_CODE (expr
) == TEMPLATE_DECL
13763 ? DECL_TEMPLATE_RESULT (expr
) : expr
) == TYPE_DECL
)
13765 if (complain
& tf_error
)
13767 error ("dependent-name %qE is parsed as a non-type, but "
13768 "instantiation yields a type", qualified_id
);
13769 inform (input_location
, "say %<typename %E%> if a type is meant", qualified_id
);
13771 return error_mark_node
;
13777 check_accessibility_of_qualified_id (expr
, /*object_type=*/NULL_TREE
,
13779 /* Remember that there was a reference to this entity. */
13780 if (!mark_used (expr
, complain
) && !(complain
& tf_error
))
13781 return error_mark_node
;
13784 if (expr
== error_mark_node
|| TREE_CODE (expr
) == TREE_LIST
)
13786 if (complain
& tf_error
)
13787 qualified_name_lookup_error (scope
,
13788 TREE_OPERAND (qualified_id
, 1),
13789 expr
, input_location
);
13790 return error_mark_node
;
13795 if (variable_template_p (expr
))
13796 expr
= lookup_and_finish_template_variable (expr
, template_args
,
13799 expr
= lookup_template_function (expr
, template_args
);
13802 if (expr
== error_mark_node
&& complain
& tf_error
)
13803 qualified_name_lookup_error (scope
, TREE_OPERAND (qualified_id
, 1),
13804 expr
, input_location
);
13805 else if (TYPE_P (scope
))
13807 expr
= (adjust_result_of_qualified_name_lookup
13808 (expr
, scope
, current_nonlambda_class_type ()));
13809 expr
= (finish_qualified_id_expr
13810 (scope
, expr
, done
, address_p
&& PTRMEM_OK_P (qualified_id
),
13811 QUALIFIED_NAME_IS_TEMPLATE (qualified_id
),
13812 /*template_arg_p=*/false, complain
));
13815 /* Expressions do not generally have reference type. */
13816 if (TREE_CODE (expr
) != SCOPE_REF
13817 /* However, if we're about to form a pointer-to-member, we just
13818 want the referenced member referenced. */
13819 && TREE_CODE (expr
) != OFFSET_REF
)
13820 expr
= convert_from_reference (expr
);
13825 /* tsubst the initializer for a VAR_DECL. INIT is the unsubstituted
13826 initializer, DECL is the substituted VAR_DECL. Other arguments are as
13830 tsubst_init (tree init
, tree decl
, tree args
,
13831 tsubst_flags_t complain
, tree in_decl
)
13836 init
= tsubst_expr (init
, args
, complain
, in_decl
, false);
13840 /* If we had an initializer but it
13841 instantiated to nothing,
13842 value-initialize the object. This will
13843 only occur when the initializer was a
13844 pack expansion where the parameter packs
13845 used in that expansion were of length
13847 init
= build_value_init (TREE_TYPE (decl
),
13849 if (TREE_CODE (init
) == AGGR_INIT_EXPR
)
13850 init
= get_target_expr_sfinae (init
, complain
);
13856 /* Like tsubst, but deals with expressions. This function just replaces
13857 template parms; to finish processing the resultant expression, use
13858 tsubst_copy_and_build or tsubst_expr. */
13861 tsubst_copy (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
13863 enum tree_code code
;
13866 if (t
== NULL_TREE
|| t
== error_mark_node
|| args
== NULL_TREE
)
13869 code
= TREE_CODE (t
);
13874 r
= retrieve_local_specialization (t
);
13876 if (r
== NULL_TREE
)
13878 /* We get here for a use of 'this' in an NSDMI as part of a
13879 constructor call or as part of an aggregate initialization. */
13880 if (DECL_NAME (t
) == this_identifier
13881 && ((current_function_decl
13882 && DECL_CONSTRUCTOR_P (current_function_decl
))
13883 || (current_class_ref
13884 && TREE_CODE (current_class_ref
) == PLACEHOLDER_EXPR
)))
13885 return current_class_ptr
;
13887 /* This can happen for a parameter name used later in a function
13888 declaration (such as in a late-specified return type). Just
13889 make a dummy decl, since it's only used for its type. */
13890 gcc_assert (cp_unevaluated_operand
!= 0);
13891 r
= tsubst_decl (t
, args
, complain
);
13892 /* Give it the template pattern as its context; its true context
13893 hasn't been instantiated yet and this is good enough for
13895 DECL_CONTEXT (r
) = DECL_CONTEXT (t
);
13898 if (TREE_CODE (r
) == ARGUMENT_PACK_SELECT
)
13899 r
= ARGUMENT_PACK_SELECT_ARG (r
);
13900 if (!mark_used (r
, complain
) && !(complain
& tf_error
))
13901 return error_mark_node
;
13909 if (DECL_TEMPLATE_PARM_P (t
))
13910 return tsubst_copy (DECL_INITIAL (t
), args
, complain
, in_decl
);
13911 /* There is no need to substitute into namespace-scope
13913 if (DECL_NAMESPACE_SCOPE_P (t
))
13915 /* If ARGS is NULL, then T is known to be non-dependent. */
13916 if (args
== NULL_TREE
)
13917 return scalar_constant_value (t
);
13919 /* Unfortunately, we cannot just call lookup_name here.
13922 template <int I> int f() {
13924 struct S { void g() { E e = a; } };
13927 When we instantiate f<7>::S::g(), say, lookup_name is not
13928 clever enough to find f<7>::a. */
13930 = tsubst_aggr_type (DECL_CONTEXT (t
), args
, complain
, in_decl
,
13931 /*entering_scope=*/0);
13933 for (v
= TYPE_VALUES (enum_type
);
13935 v
= TREE_CHAIN (v
))
13936 if (TREE_PURPOSE (v
) == DECL_NAME (t
))
13937 return TREE_VALUE (v
);
13939 /* We didn't find the name. That should never happen; if
13940 name-lookup found it during preliminary parsing, we
13941 should find it again here during instantiation. */
13942 gcc_unreachable ();
13947 if (PACK_EXPANSION_P (TREE_TYPE (t
)))
13949 /* Check for a local specialization set up by
13950 tsubst_pack_expansion. */
13951 if (tree r
= retrieve_local_specialization (t
))
13953 if (TREE_CODE (r
) == ARGUMENT_PACK_SELECT
)
13954 r
= ARGUMENT_PACK_SELECT_ARG (r
);
13958 /* When retrieving a capture pack from a generic lambda, remove the
13959 lambda call op's own template argument list from ARGS. Only the
13960 template arguments active for the closure type should be used to
13961 retrieve the pack specialization. */
13962 if (LAMBDA_FUNCTION_P (current_function_decl
)
13963 && (template_class_depth (DECL_CONTEXT (t
))
13964 != TMPL_ARGS_DEPTH (args
)))
13965 args
= strip_innermost_template_args (args
, 1);
13967 /* Otherwise return the full NONTYPE_ARGUMENT_PACK that
13968 tsubst_decl put in the hash table. */
13969 return retrieve_specialization (t
, args
, 0);
13972 if (DECL_CONTEXT (t
))
13976 ctx
= tsubst_aggr_type (DECL_CONTEXT (t
), args
, complain
, in_decl
,
13977 /*entering_scope=*/1);
13978 if (ctx
!= DECL_CONTEXT (t
))
13980 tree r
= lookup_field (ctx
, DECL_NAME (t
), 0, false);
13983 if (complain
& tf_error
)
13984 error ("using invalid field %qD", t
);
13985 return error_mark_node
;
13994 case FUNCTION_DECL
:
13995 if (DECL_LANG_SPECIFIC (t
) && DECL_TEMPLATE_INFO (t
))
13996 r
= tsubst (t
, args
, complain
, in_decl
);
13997 else if (local_variable_p (t
))
13999 r
= retrieve_local_specialization (t
);
14000 if (r
== NULL_TREE
)
14002 /* First try name lookup to find the instantiation. */
14003 r
= lookup_name (DECL_NAME (t
));
14006 /* Make sure that the one we found is the one we want. */
14007 tree ctx
= DECL_CONTEXT (t
);
14008 if (DECL_LANG_SPECIFIC (ctx
) && DECL_TEMPLATE_INFO (ctx
))
14009 ctx
= tsubst (ctx
, args
, complain
, in_decl
);
14010 if (ctx
!= DECL_CONTEXT (r
))
14018 /* This can happen for a variable used in a
14019 late-specified return type of a local lambda, or for a
14020 local static or constant. Building a new VAR_DECL
14021 should be OK in all those cases. */
14022 r
= tsubst_decl (t
, args
, complain
);
14023 if (decl_maybe_constant_var_p (r
))
14025 /* We can't call cp_finish_decl, so handle the
14026 initializer by hand. */
14027 tree init
= tsubst_init (DECL_INITIAL (t
), r
, args
,
14028 complain
, in_decl
);
14029 if (!processing_template_decl
)
14030 init
= maybe_constant_init (init
);
14031 if (processing_template_decl
14032 ? potential_constant_expression (init
)
14033 : reduced_constant_expression_p (init
))
14034 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (r
)
14035 = TREE_CONSTANT (r
) = true;
14036 DECL_INITIAL (r
) = init
;
14038 gcc_assert (cp_unevaluated_operand
|| TREE_STATIC (r
)
14039 || decl_constant_var_p (r
)
14040 || errorcount
|| sorrycount
);
14041 if (!processing_template_decl
)
14043 if (TREE_STATIC (r
))
14044 rest_of_decl_compilation (r
, toplevel_bindings_p (),
14047 r
= process_outer_var_ref (r
, complain
);
14050 /* Remember this for subsequent uses. */
14051 if (local_specializations
)
14052 register_local_specialization (r
, t
);
14057 if (!mark_used (r
, complain
) && !(complain
& tf_error
))
14058 return error_mark_node
;
14061 case NAMESPACE_DECL
:
14065 /* An OVERLOAD will always be a non-dependent overload set; an
14066 overload set from function scope will just be represented with an
14067 IDENTIFIER_NODE, and from class scope with a BASELINK. */
14068 gcc_assert (!uses_template_parms (t
));
14072 return tsubst_baselink (t
, current_nonlambda_class_type (),
14073 args
, complain
, in_decl
);
14075 case TEMPLATE_DECL
:
14076 if (DECL_TEMPLATE_TEMPLATE_PARM_P (t
))
14077 return tsubst (TREE_TYPE (DECL_TEMPLATE_RESULT (t
)),
14078 args
, complain
, in_decl
);
14079 else if (DECL_FUNCTION_TEMPLATE_P (t
) && DECL_MEMBER_TEMPLATE_P (t
))
14080 return tsubst (t
, args
, complain
, in_decl
);
14081 else if (DECL_CLASS_SCOPE_P (t
)
14082 && uses_template_parms (DECL_CONTEXT (t
)))
14084 /* Template template argument like the following example need
14087 template <template <class> class TT> struct C {};
14088 template <class T> struct D {
14089 template <class U> struct E {};
14094 We are processing the template argument `E' in #1 for
14095 the template instantiation #2. Originally, `E' is a
14096 TEMPLATE_DECL with `D<T>' as its DECL_CONTEXT. Now we
14097 have to substitute this with one having context `D<int>'. */
14099 tree context
= tsubst (DECL_CONTEXT (t
), args
, complain
, in_decl
);
14100 return lookup_field (context
, DECL_NAME(t
), 0, false);
14103 /* Ordinary template template argument. */
14107 case REINTERPRET_CAST_EXPR
:
14108 case CONST_CAST_EXPR
:
14109 case STATIC_CAST_EXPR
:
14110 case DYNAMIC_CAST_EXPR
:
14111 case IMPLICIT_CONV_EXPR
:
14115 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
14116 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
14117 return build1 (code
, type
, op0
);
14121 if (PACK_EXPANSION_P (TREE_OPERAND (t
, 0))
14122 || ARGUMENT_PACK_P (TREE_OPERAND (t
, 0)))
14124 tree expanded
, op
= TREE_OPERAND (t
, 0);
14127 if (SIZEOF_EXPR_TYPE_P (t
))
14128 op
= TREE_TYPE (op
);
14130 ++cp_unevaluated_operand
;
14131 ++c_inhibit_evaluation_warnings
;
14132 /* We only want to compute the number of arguments. */
14133 if (PACK_EXPANSION_P (op
))
14134 expanded
= tsubst_pack_expansion (op
, args
, complain
, in_decl
);
14136 expanded
= tsubst_template_args (ARGUMENT_PACK_ARGS (op
),
14137 args
, complain
, in_decl
);
14138 --cp_unevaluated_operand
;
14139 --c_inhibit_evaluation_warnings
;
14141 if (TREE_CODE (expanded
) == TREE_VEC
)
14143 len
= TREE_VEC_LENGTH (expanded
);
14144 /* Set TREE_USED for the benefit of -Wunused. */
14145 for (int i
= 0; i
< len
; i
++)
14146 TREE_USED (TREE_VEC_ELT (expanded
, i
)) = true;
14149 if (expanded
== error_mark_node
)
14150 return error_mark_node
;
14151 else if (PACK_EXPANSION_P (expanded
)
14152 || (TREE_CODE (expanded
) == TREE_VEC
14153 && pack_expansion_args_count (expanded
)))
14156 if (PACK_EXPANSION_P (expanded
))
14158 else if (TREE_VEC_LENGTH (expanded
) == 1)
14159 expanded
= TREE_VEC_ELT (expanded
, 0);
14161 expanded
= make_argument_pack (expanded
);
14163 if (TYPE_P (expanded
))
14164 return cxx_sizeof_or_alignof_type (expanded
, SIZEOF_EXPR
,
14165 complain
& tf_error
);
14167 return cxx_sizeof_or_alignof_expr (expanded
, SIZEOF_EXPR
,
14168 complain
& tf_error
);
14171 return build_int_cst (size_type_node
, len
);
14173 if (SIZEOF_EXPR_TYPE_P (t
))
14175 r
= tsubst (TREE_TYPE (TREE_OPERAND (t
, 0)),
14176 args
, complain
, in_decl
);
14177 r
= build1 (NOP_EXPR
, r
, error_mark_node
);
14178 r
= build1 (SIZEOF_EXPR
,
14179 tsubst (TREE_TYPE (t
), args
, complain
, in_decl
), r
);
14180 SIZEOF_EXPR_TYPE_P (r
) = 1;
14187 case TRUTH_NOT_EXPR
:
14190 case UNARY_PLUS_EXPR
: /* Unary + */
14192 case AT_ENCODE_EXPR
:
14196 case REALPART_EXPR
:
14197 case IMAGPART_EXPR
:
14200 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
14201 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
14202 return build1 (code
, type
, op0
);
14205 case COMPONENT_REF
:
14210 object
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
14211 name
= TREE_OPERAND (t
, 1);
14212 if (TREE_CODE (name
) == BIT_NOT_EXPR
)
14214 name
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
14215 complain
, in_decl
);
14216 name
= build1 (BIT_NOT_EXPR
, NULL_TREE
, name
);
14218 else if (TREE_CODE (name
) == SCOPE_REF
14219 && TREE_CODE (TREE_OPERAND (name
, 1)) == BIT_NOT_EXPR
)
14221 tree base
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
14222 complain
, in_decl
);
14223 name
= TREE_OPERAND (name
, 1);
14224 name
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
14225 complain
, in_decl
);
14226 name
= build1 (BIT_NOT_EXPR
, NULL_TREE
, name
);
14227 name
= build_qualified_name (/*type=*/NULL_TREE
,
14229 /*template_p=*/false);
14231 else if (BASELINK_P (name
))
14232 name
= tsubst_baselink (name
,
14233 non_reference (TREE_TYPE (object
)),
14237 name
= tsubst_copy (name
, args
, complain
, in_decl
);
14238 return build_nt (COMPONENT_REF
, object
, name
, NULL_TREE
);
14244 case TRUNC_DIV_EXPR
:
14245 case CEIL_DIV_EXPR
:
14246 case FLOOR_DIV_EXPR
:
14247 case ROUND_DIV_EXPR
:
14248 case EXACT_DIV_EXPR
:
14252 case TRUNC_MOD_EXPR
:
14253 case FLOOR_MOD_EXPR
:
14254 case TRUTH_ANDIF_EXPR
:
14255 case TRUTH_ORIF_EXPR
:
14256 case TRUTH_AND_EXPR
:
14257 case TRUTH_OR_EXPR
:
14270 case COMPOUND_EXPR
:
14273 case PREDECREMENT_EXPR
:
14274 case PREINCREMENT_EXPR
:
14275 case POSTDECREMENT_EXPR
:
14276 case POSTINCREMENT_EXPR
:
14278 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
14279 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
14280 return build_nt (code
, op0
, op1
);
14285 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
14286 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
14287 return build_qualified_name (/*type=*/NULL_TREE
, op0
, op1
,
14288 QUALIFIED_NAME_IS_TEMPLATE (t
));
14293 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
14294 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
14295 return build_nt (ARRAY_REF
, op0
, op1
, NULL_TREE
, NULL_TREE
);
14300 int n
= VL_EXP_OPERAND_LENGTH (t
);
14301 tree result
= build_vl_exp (CALL_EXPR
, n
);
14303 for (i
= 0; i
< n
; i
++)
14304 TREE_OPERAND (t
, i
) = tsubst_copy (TREE_OPERAND (t
, i
), args
,
14305 complain
, in_decl
);
14311 case PSEUDO_DTOR_EXPR
:
14312 case VEC_PERM_EXPR
:
14314 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
14315 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
14316 tree op2
= tsubst_copy (TREE_OPERAND (t
, 2), args
, complain
, in_decl
);
14317 r
= build_nt (code
, op0
, op1
, op2
);
14318 TREE_NO_WARNING (r
) = TREE_NO_WARNING (t
);
14324 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
14325 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
14326 tree op2
= tsubst_copy (TREE_OPERAND (t
, 2), args
, complain
, in_decl
);
14327 r
= build_nt (code
, op0
, op1
, op2
);
14328 NEW_EXPR_USE_GLOBAL (r
) = NEW_EXPR_USE_GLOBAL (t
);
14334 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
14335 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
14336 r
= build_nt (code
, op0
, op1
);
14337 DELETE_EXPR_USE_GLOBAL (r
) = DELETE_EXPR_USE_GLOBAL (t
);
14338 DELETE_EXPR_USE_VEC (r
) = DELETE_EXPR_USE_VEC (t
);
14342 case TEMPLATE_ID_EXPR
:
14344 /* Substituted template arguments */
14345 tree fn
= TREE_OPERAND (t
, 0);
14346 tree targs
= TREE_OPERAND (t
, 1);
14348 fn
= tsubst_copy (fn
, args
, complain
, in_decl
);
14350 targs
= tsubst_template_args (targs
, args
, complain
, in_decl
);
14352 return lookup_template_function (fn
, targs
);
14357 tree purpose
, value
, chain
;
14359 if (t
== void_list_node
)
14362 purpose
= TREE_PURPOSE (t
);
14364 purpose
= tsubst_copy (purpose
, args
, complain
, in_decl
);
14365 value
= TREE_VALUE (t
);
14367 value
= tsubst_copy (value
, args
, complain
, in_decl
);
14368 chain
= TREE_CHAIN (t
);
14369 if (chain
&& chain
!= void_type_node
)
14370 chain
= tsubst_copy (chain
, args
, complain
, in_decl
);
14371 if (purpose
== TREE_PURPOSE (t
)
14372 && value
== TREE_VALUE (t
)
14373 && chain
== TREE_CHAIN (t
))
14375 return tree_cons (purpose
, value
, chain
);
14380 case ENUMERAL_TYPE
:
14382 case TEMPLATE_TYPE_PARM
:
14383 case TEMPLATE_TEMPLATE_PARM
:
14384 case BOUND_TEMPLATE_TEMPLATE_PARM
:
14385 case TEMPLATE_PARM_INDEX
:
14387 case REFERENCE_TYPE
:
14389 case FUNCTION_TYPE
:
14392 case TYPENAME_TYPE
:
14393 case UNBOUND_CLASS_TEMPLATE
:
14395 case DECLTYPE_TYPE
:
14397 return tsubst (t
, args
, complain
, in_decl
);
14401 /* Fall through. */
14402 case IDENTIFIER_NODE
:
14403 if (IDENTIFIER_TYPENAME_P (t
))
14405 tree new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
14406 return mangle_conv_op_name_for_type (new_type
);
14412 /* This is handled by tsubst_copy_and_build. */
14413 gcc_unreachable ();
14417 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
14418 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
14419 return build_x_va_arg (EXPR_LOCATION (t
), op0
, type
);
14422 case CLEANUP_POINT_EXPR
:
14423 /* We shouldn't have built any of these during initial template
14424 generation. Instead, they should be built during instantiation
14425 in response to the saved STMT_IS_FULL_EXPR_P setting. */
14426 gcc_unreachable ();
14430 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
14431 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
14432 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
14433 r
= build2 (code
, type
, op0
, op1
);
14434 PTRMEM_OK_P (r
) = PTRMEM_OK_P (t
);
14435 if (!mark_used (TREE_OPERAND (r
, 1), complain
)
14436 && !(complain
& tf_error
))
14437 return error_mark_node
;
14441 case EXPR_PACK_EXPANSION
:
14442 error ("invalid use of pack expansion expression");
14443 return error_mark_node
;
14445 case NONTYPE_ARGUMENT_PACK
:
14446 error ("use %<...%> to expand argument pack");
14447 return error_mark_node
;
14450 gcc_checking_assert (t
== void_node
&& VOID_TYPE_P (TREE_TYPE (t
)));
14458 /* Instantiate any typedefs in the type. */
14459 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
14460 r
= fold_convert (type
, t
);
14461 gcc_assert (TREE_CODE (r
) == code
);
14466 /* These can sometimes show up in a partial instantiation, but never
14467 involve template parms. */
14468 gcc_assert (!uses_template_parms (t
));
14471 case UNARY_LEFT_FOLD_EXPR
:
14472 return tsubst_unary_left_fold (t
, args
, complain
, in_decl
);
14473 case UNARY_RIGHT_FOLD_EXPR
:
14474 return tsubst_unary_right_fold (t
, args
, complain
, in_decl
);
14475 case BINARY_LEFT_FOLD_EXPR
:
14476 return tsubst_binary_left_fold (t
, args
, complain
, in_decl
);
14477 case BINARY_RIGHT_FOLD_EXPR
:
14478 return tsubst_binary_right_fold (t
, args
, complain
, in_decl
);
14481 /* We shouldn't get here, but keep going if !flag_checking. */
14483 gcc_unreachable ();
14488 /* Helper function for tsubst_omp_clauses, used for instantiation of
14489 OMP_CLAUSE_DECL of clauses. */
14492 tsubst_omp_clause_decl (tree decl
, tree args
, tsubst_flags_t complain
,
14495 if (decl
== NULL_TREE
)
14498 /* Handle an OpenMP array section represented as a TREE_LIST (or
14499 OMP_CLAUSE_DEPEND_KIND). An OMP_CLAUSE_DEPEND (with a depend
14500 kind of OMP_CLAUSE_DEPEND_SINK) can also be represented as a
14501 TREE_LIST. We can handle it exactly the same as an array section
14502 (purpose, value, and a chain), even though the nomenclature
14503 (low_bound, length, etc) is different. */
14504 if (TREE_CODE (decl
) == TREE_LIST
)
14507 = tsubst_expr (TREE_PURPOSE (decl
), args
, complain
, in_decl
,
14508 /*integral_constant_expression_p=*/false);
14509 tree length
= tsubst_expr (TREE_VALUE (decl
), args
, complain
, in_decl
,
14510 /*integral_constant_expression_p=*/false);
14511 tree chain
= tsubst_omp_clause_decl (TREE_CHAIN (decl
), args
, complain
,
14513 if (TREE_PURPOSE (decl
) == low_bound
14514 && TREE_VALUE (decl
) == length
14515 && TREE_CHAIN (decl
) == chain
)
14517 tree ret
= tree_cons (low_bound
, length
, chain
);
14518 OMP_CLAUSE_DEPEND_SINK_NEGATIVE (ret
)
14519 = OMP_CLAUSE_DEPEND_SINK_NEGATIVE (decl
);
14522 tree ret
= tsubst_expr (decl
, args
, complain
, in_decl
,
14523 /*integral_constant_expression_p=*/false);
14524 /* Undo convert_from_reference tsubst_expr could have called. */
14526 && REFERENCE_REF_P (ret
)
14527 && !REFERENCE_REF_P (decl
))
14528 ret
= TREE_OPERAND (ret
, 0);
14532 /* Like tsubst_copy, but specifically for OpenMP clauses. */
14535 tsubst_omp_clauses (tree clauses
, bool declare_simd
, bool allow_fields
,
14536 tree args
, tsubst_flags_t complain
, tree in_decl
)
14538 tree new_clauses
= NULL_TREE
, nc
, oc
;
14539 tree linear_no_step
= NULL_TREE
;
14541 for (oc
= clauses
; oc
; oc
= OMP_CLAUSE_CHAIN (oc
))
14543 nc
= copy_node (oc
);
14544 OMP_CLAUSE_CHAIN (nc
) = new_clauses
;
14547 switch (OMP_CLAUSE_CODE (nc
))
14549 case OMP_CLAUSE_LASTPRIVATE
:
14550 if (OMP_CLAUSE_LASTPRIVATE_STMT (oc
))
14552 OMP_CLAUSE_LASTPRIVATE_STMT (nc
) = push_stmt_list ();
14553 tsubst_expr (OMP_CLAUSE_LASTPRIVATE_STMT (oc
), args
, complain
,
14554 in_decl
, /*integral_constant_expression_p=*/false);
14555 OMP_CLAUSE_LASTPRIVATE_STMT (nc
)
14556 = pop_stmt_list (OMP_CLAUSE_LASTPRIVATE_STMT (nc
));
14559 case OMP_CLAUSE_PRIVATE
:
14560 case OMP_CLAUSE_SHARED
:
14561 case OMP_CLAUSE_FIRSTPRIVATE
:
14562 case OMP_CLAUSE_COPYIN
:
14563 case OMP_CLAUSE_COPYPRIVATE
:
14564 case OMP_CLAUSE_UNIFORM
:
14565 case OMP_CLAUSE_DEPEND
:
14566 case OMP_CLAUSE_FROM
:
14567 case OMP_CLAUSE_TO
:
14568 case OMP_CLAUSE_MAP
:
14569 case OMP_CLAUSE_USE_DEVICE_PTR
:
14570 case OMP_CLAUSE_IS_DEVICE_PTR
:
14571 OMP_CLAUSE_DECL (nc
)
14572 = tsubst_omp_clause_decl (OMP_CLAUSE_DECL (oc
), args
, complain
,
14575 case OMP_CLAUSE_IF
:
14576 case OMP_CLAUSE_NUM_THREADS
:
14577 case OMP_CLAUSE_SCHEDULE
:
14578 case OMP_CLAUSE_COLLAPSE
:
14579 case OMP_CLAUSE_FINAL
:
14580 case OMP_CLAUSE_DEVICE
:
14581 case OMP_CLAUSE_DIST_SCHEDULE
:
14582 case OMP_CLAUSE_NUM_TEAMS
:
14583 case OMP_CLAUSE_THREAD_LIMIT
:
14584 case OMP_CLAUSE_SAFELEN
:
14585 case OMP_CLAUSE_SIMDLEN
:
14586 case OMP_CLAUSE_NUM_TASKS
:
14587 case OMP_CLAUSE_GRAINSIZE
:
14588 case OMP_CLAUSE_PRIORITY
:
14589 case OMP_CLAUSE_ORDERED
:
14590 case OMP_CLAUSE_HINT
:
14591 case OMP_CLAUSE_NUM_GANGS
:
14592 case OMP_CLAUSE_NUM_WORKERS
:
14593 case OMP_CLAUSE_VECTOR_LENGTH
:
14594 case OMP_CLAUSE_WORKER
:
14595 case OMP_CLAUSE_VECTOR
:
14596 case OMP_CLAUSE_ASYNC
:
14597 case OMP_CLAUSE_WAIT
:
14598 OMP_CLAUSE_OPERAND (nc
, 0)
14599 = tsubst_expr (OMP_CLAUSE_OPERAND (oc
, 0), args
, complain
,
14600 in_decl
, /*integral_constant_expression_p=*/false);
14602 case OMP_CLAUSE_REDUCTION
:
14603 if (OMP_CLAUSE_REDUCTION_PLACEHOLDER (oc
))
14605 tree placeholder
= OMP_CLAUSE_REDUCTION_PLACEHOLDER (oc
);
14606 if (TREE_CODE (placeholder
) == SCOPE_REF
)
14608 tree scope
= tsubst (TREE_OPERAND (placeholder
, 0), args
,
14609 complain
, in_decl
);
14610 OMP_CLAUSE_REDUCTION_PLACEHOLDER (nc
)
14611 = build_qualified_name (NULL_TREE
, scope
,
14612 TREE_OPERAND (placeholder
, 1),
14616 gcc_assert (identifier_p (placeholder
));
14618 OMP_CLAUSE_DECL (nc
)
14619 = tsubst_omp_clause_decl (OMP_CLAUSE_DECL (oc
), args
, complain
,
14622 case OMP_CLAUSE_GANG
:
14623 case OMP_CLAUSE_ALIGNED
:
14624 OMP_CLAUSE_DECL (nc
)
14625 = tsubst_omp_clause_decl (OMP_CLAUSE_DECL (oc
), args
, complain
,
14627 OMP_CLAUSE_OPERAND (nc
, 1)
14628 = tsubst_expr (OMP_CLAUSE_OPERAND (oc
, 1), args
, complain
,
14629 in_decl
, /*integral_constant_expression_p=*/false);
14631 case OMP_CLAUSE_LINEAR
:
14632 OMP_CLAUSE_DECL (nc
)
14633 = tsubst_omp_clause_decl (OMP_CLAUSE_DECL (oc
), args
, complain
,
14635 if (OMP_CLAUSE_LINEAR_STEP (oc
) == NULL_TREE
)
14637 gcc_assert (!linear_no_step
);
14638 linear_no_step
= nc
;
14640 else if (OMP_CLAUSE_LINEAR_VARIABLE_STRIDE (oc
))
14641 OMP_CLAUSE_LINEAR_STEP (nc
)
14642 = tsubst_omp_clause_decl (OMP_CLAUSE_LINEAR_STEP (oc
), args
,
14643 complain
, in_decl
);
14645 OMP_CLAUSE_LINEAR_STEP (nc
)
14646 = tsubst_expr (OMP_CLAUSE_LINEAR_STEP (oc
), args
, complain
,
14648 /*integral_constant_expression_p=*/false);
14650 case OMP_CLAUSE_NOWAIT
:
14651 case OMP_CLAUSE_DEFAULT
:
14652 case OMP_CLAUSE_UNTIED
:
14653 case OMP_CLAUSE_MERGEABLE
:
14654 case OMP_CLAUSE_INBRANCH
:
14655 case OMP_CLAUSE_NOTINBRANCH
:
14656 case OMP_CLAUSE_PROC_BIND
:
14657 case OMP_CLAUSE_FOR
:
14658 case OMP_CLAUSE_PARALLEL
:
14659 case OMP_CLAUSE_SECTIONS
:
14660 case OMP_CLAUSE_TASKGROUP
:
14661 case OMP_CLAUSE_NOGROUP
:
14662 case OMP_CLAUSE_THREADS
:
14663 case OMP_CLAUSE_SIMD
:
14664 case OMP_CLAUSE_DEFAULTMAP
:
14665 case OMP_CLAUSE_INDEPENDENT
:
14666 case OMP_CLAUSE_AUTO
:
14667 case OMP_CLAUSE_SEQ
:
14669 case OMP_CLAUSE_TILE
:
14672 for (lnc
= OMP_CLAUSE_TILE_LIST (nc
),
14673 loc
= OMP_CLAUSE_TILE_LIST (oc
);
14675 loc
= TREE_CHAIN (loc
), lnc
= TREE_CHAIN (lnc
))
14677 TREE_VALUE (lnc
) = tsubst_expr (TREE_VALUE (loc
), args
,
14678 complain
, in_decl
, false);
14683 gcc_unreachable ();
14686 switch (OMP_CLAUSE_CODE (nc
))
14688 case OMP_CLAUSE_SHARED
:
14689 case OMP_CLAUSE_PRIVATE
:
14690 case OMP_CLAUSE_FIRSTPRIVATE
:
14691 case OMP_CLAUSE_LASTPRIVATE
:
14692 case OMP_CLAUSE_COPYPRIVATE
:
14693 case OMP_CLAUSE_LINEAR
:
14694 case OMP_CLAUSE_REDUCTION
:
14695 case OMP_CLAUSE_USE_DEVICE_PTR
:
14696 case OMP_CLAUSE_IS_DEVICE_PTR
:
14697 /* tsubst_expr on SCOPE_REF results in returning
14698 finish_non_static_data_member result. Undo that here. */
14699 if (TREE_CODE (OMP_CLAUSE_DECL (oc
)) == SCOPE_REF
14700 && (TREE_CODE (TREE_OPERAND (OMP_CLAUSE_DECL (oc
), 1))
14701 == IDENTIFIER_NODE
))
14703 tree t
= OMP_CLAUSE_DECL (nc
);
14706 switch (TREE_CODE (v
))
14708 case COMPONENT_REF
:
14712 case POINTER_PLUS_EXPR
:
14713 v
= TREE_OPERAND (v
, 0);
14716 if (DECL_CONTEXT (v
) == current_function_decl
14717 && DECL_ARTIFICIAL (v
)
14718 && DECL_NAME (v
) == this_identifier
)
14719 OMP_CLAUSE_DECL (nc
) = TREE_OPERAND (t
, 1);
14726 else if (VAR_P (OMP_CLAUSE_DECL (oc
))
14727 && DECL_HAS_VALUE_EXPR_P (OMP_CLAUSE_DECL (oc
))
14728 && DECL_ARTIFICIAL (OMP_CLAUSE_DECL (oc
))
14729 && DECL_LANG_SPECIFIC (OMP_CLAUSE_DECL (oc
))
14730 && DECL_OMP_PRIVATIZED_MEMBER (OMP_CLAUSE_DECL (oc
)))
14732 tree decl
= OMP_CLAUSE_DECL (nc
);
14735 if (!DECL_LANG_SPECIFIC (decl
))
14736 retrofit_lang_decl (decl
);
14737 DECL_OMP_PRIVATIZED_MEMBER (decl
) = 1;
14746 new_clauses
= nreverse (new_clauses
);
14749 new_clauses
= finish_omp_clauses (new_clauses
, allow_fields
);
14750 if (linear_no_step
)
14751 for (nc
= new_clauses
; nc
; nc
= OMP_CLAUSE_CHAIN (nc
))
14752 if (nc
== linear_no_step
)
14754 OMP_CLAUSE_LINEAR_STEP (nc
) = NULL_TREE
;
14758 return new_clauses
;
14761 /* Like tsubst_copy_and_build, but unshare TREE_LIST nodes. */
14764 tsubst_copy_asm_operands (tree t
, tree args
, tsubst_flags_t complain
,
14767 #define RECUR(t) tsubst_copy_asm_operands (t, args, complain, in_decl)
14769 tree purpose
, value
, chain
;
14774 if (TREE_CODE (t
) != TREE_LIST
)
14775 return tsubst_copy_and_build (t
, args
, complain
, in_decl
,
14776 /*function_p=*/false,
14777 /*integral_constant_expression_p=*/false);
14779 if (t
== void_list_node
)
14782 purpose
= TREE_PURPOSE (t
);
14784 purpose
= RECUR (purpose
);
14785 value
= TREE_VALUE (t
);
14788 if (TREE_CODE (value
) != LABEL_DECL
)
14789 value
= RECUR (value
);
14792 value
= lookup_label (DECL_NAME (value
));
14793 gcc_assert (TREE_CODE (value
) == LABEL_DECL
);
14794 TREE_USED (value
) = 1;
14797 chain
= TREE_CHAIN (t
);
14798 if (chain
&& chain
!= void_type_node
)
14799 chain
= RECUR (chain
);
14800 return tree_cons (purpose
, value
, chain
);
14804 /* Used to temporarily communicate the list of #pragma omp parallel
14805 clauses to #pragma omp for instantiation if they are combined
14808 static tree
*omp_parallel_combined_clauses
;
14810 /* Substitute one OMP_FOR iterator. */
14813 tsubst_omp_for_iterator (tree t
, int i
, tree declv
, tree orig_declv
,
14814 tree initv
, tree condv
, tree incrv
, tree
*clauses
,
14815 tree args
, tsubst_flags_t complain
, tree in_decl
,
14816 bool integral_constant_expression_p
)
14818 #define RECUR(NODE) \
14819 tsubst_expr ((NODE), args, complain, in_decl, \
14820 integral_constant_expression_p)
14821 tree decl
, init
, cond
, incr
;
14823 init
= TREE_VEC_ELT (OMP_FOR_INIT (t
), i
);
14824 gcc_assert (TREE_CODE (init
) == MODIFY_EXPR
);
14826 if (orig_declv
&& OMP_FOR_ORIG_DECLS (t
))
14828 tree o
= TREE_VEC_ELT (OMP_FOR_ORIG_DECLS (t
), i
);
14829 TREE_VEC_ELT (orig_declv
, i
) = RECUR (o
);
14832 decl
= TREE_OPERAND (init
, 0);
14833 init
= TREE_OPERAND (init
, 1);
14834 tree decl_expr
= NULL_TREE
;
14835 if (init
&& TREE_CODE (init
) == DECL_EXPR
)
14837 /* We need to jump through some hoops to handle declarations in the
14838 for-init-statement, since we might need to handle auto deduction,
14839 but we need to keep control of initialization. */
14841 init
= DECL_INITIAL (DECL_EXPR_DECL (init
));
14842 decl
= tsubst_decl (decl
, args
, complain
);
14846 if (TREE_CODE (decl
) == SCOPE_REF
)
14848 decl
= RECUR (decl
);
14849 if (TREE_CODE (decl
) == COMPONENT_REF
)
14853 switch (TREE_CODE (v
))
14855 case COMPONENT_REF
:
14859 case POINTER_PLUS_EXPR
:
14860 v
= TREE_OPERAND (v
, 0);
14863 if (DECL_CONTEXT (v
) == current_function_decl
14864 && DECL_ARTIFICIAL (v
)
14865 && DECL_NAME (v
) == this_identifier
)
14867 decl
= TREE_OPERAND (decl
, 1);
14868 decl
= omp_privatize_field (decl
, false);
14878 decl
= RECUR (decl
);
14880 init
= RECUR (init
);
14882 tree auto_node
= type_uses_auto (TREE_TYPE (decl
));
14883 if (auto_node
&& init
)
14885 = do_auto_deduction (TREE_TYPE (decl
), init
, auto_node
);
14887 gcc_assert (!type_dependent_expression_p (decl
));
14889 if (!CLASS_TYPE_P (TREE_TYPE (decl
)))
14893 /* Declare the variable, but don't let that initialize it. */
14894 tree init_sav
= DECL_INITIAL (DECL_EXPR_DECL (decl_expr
));
14895 DECL_INITIAL (DECL_EXPR_DECL (decl_expr
)) = NULL_TREE
;
14897 DECL_INITIAL (DECL_EXPR_DECL (decl_expr
)) = init_sav
;
14900 cond
= RECUR (TREE_VEC_ELT (OMP_FOR_COND (t
), i
));
14901 incr
= TREE_VEC_ELT (OMP_FOR_INCR (t
), i
);
14902 if (TREE_CODE (incr
) == MODIFY_EXPR
)
14904 tree lhs
= RECUR (TREE_OPERAND (incr
, 0));
14905 tree rhs
= RECUR (TREE_OPERAND (incr
, 1));
14906 incr
= build_x_modify_expr (EXPR_LOCATION (incr
), lhs
,
14907 NOP_EXPR
, rhs
, complain
);
14910 incr
= RECUR (incr
);
14911 TREE_VEC_ELT (declv
, i
) = decl
;
14912 TREE_VEC_ELT (initv
, i
) = init
;
14913 TREE_VEC_ELT (condv
, i
) = cond
;
14914 TREE_VEC_ELT (incrv
, i
) = incr
;
14920 /* Declare and initialize the variable. */
14928 for (j
= (omp_parallel_combined_clauses
== NULL
? 1 : 0); j
< 2; j
++)
14930 for (pc
= j
? clauses
: omp_parallel_combined_clauses
; *pc
; )
14932 if (OMP_CLAUSE_CODE (*pc
) == OMP_CLAUSE_PRIVATE
14933 && OMP_CLAUSE_DECL (*pc
) == decl
)
14935 else if (OMP_CLAUSE_CODE (*pc
) == OMP_CLAUSE_LASTPRIVATE
14936 && OMP_CLAUSE_DECL (*pc
) == decl
)
14940 /* Move lastprivate (decl) clause to OMP_FOR_CLAUSES. */
14942 *pc
= OMP_CLAUSE_CHAIN (c
);
14943 OMP_CLAUSE_CHAIN (c
) = *clauses
;
14946 else if (OMP_CLAUSE_CODE (*pc
) == OMP_CLAUSE_FIRSTPRIVATE
14947 && OMP_CLAUSE_DECL (*pc
) == decl
)
14949 error ("iteration variable %qD should not be firstprivate",
14951 *pc
= OMP_CLAUSE_CHAIN (*pc
);
14953 else if (OMP_CLAUSE_CODE (*pc
) == OMP_CLAUSE_REDUCTION
14954 && OMP_CLAUSE_DECL (*pc
) == decl
)
14956 error ("iteration variable %qD should not be reduction",
14958 *pc
= OMP_CLAUSE_CHAIN (*pc
);
14961 pc
= &OMP_CLAUSE_CHAIN (*pc
);
14966 if (*pc
== NULL_TREE
)
14968 tree c
= build_omp_clause (input_location
, OMP_CLAUSE_PRIVATE
);
14969 OMP_CLAUSE_DECL (c
) = decl
;
14970 c
= finish_omp_clauses (c
, true);
14973 OMP_CLAUSE_CHAIN (c
) = *clauses
;
14978 cond
= TREE_VEC_ELT (OMP_FOR_COND (t
), i
);
14979 if (COMPARISON_CLASS_P (cond
))
14981 tree op0
= RECUR (TREE_OPERAND (cond
, 0));
14982 tree op1
= RECUR (TREE_OPERAND (cond
, 1));
14983 cond
= build2 (TREE_CODE (cond
), boolean_type_node
, op0
, op1
);
14986 cond
= RECUR (cond
);
14987 incr
= TREE_VEC_ELT (OMP_FOR_INCR (t
), i
);
14988 switch (TREE_CODE (incr
))
14990 case PREINCREMENT_EXPR
:
14991 case PREDECREMENT_EXPR
:
14992 case POSTINCREMENT_EXPR
:
14993 case POSTDECREMENT_EXPR
:
14994 incr
= build2 (TREE_CODE (incr
), TREE_TYPE (decl
),
14995 RECUR (TREE_OPERAND (incr
, 0)), NULL_TREE
);
14998 if (TREE_CODE (TREE_OPERAND (incr
, 1)) == PLUS_EXPR
14999 || TREE_CODE (TREE_OPERAND (incr
, 1)) == MINUS_EXPR
)
15001 tree rhs
= TREE_OPERAND (incr
, 1);
15002 tree lhs
= RECUR (TREE_OPERAND (incr
, 0));
15003 tree rhs0
= RECUR (TREE_OPERAND (rhs
, 0));
15004 tree rhs1
= RECUR (TREE_OPERAND (rhs
, 1));
15005 incr
= build2 (MODIFY_EXPR
, TREE_TYPE (decl
), lhs
,
15006 build2 (TREE_CODE (rhs
), TREE_TYPE (decl
),
15010 incr
= RECUR (incr
);
15013 if (TREE_CODE (TREE_OPERAND (incr
, 1)) == PLUS_EXPR
15014 || TREE_CODE (TREE_OPERAND (incr
, 1)) == MINUS_EXPR
)
15016 tree lhs
= RECUR (TREE_OPERAND (incr
, 0));
15017 incr
= build2 (MODIFY_EXPR
, TREE_TYPE (decl
), lhs
,
15018 build2 (TREE_CODE (TREE_OPERAND (incr
, 1)),
15019 TREE_TYPE (decl
), lhs
,
15020 RECUR (TREE_OPERAND (incr
, 2))));
15022 else if (TREE_CODE (TREE_OPERAND (incr
, 1)) == NOP_EXPR
15023 && (TREE_CODE (TREE_OPERAND (incr
, 2)) == PLUS_EXPR
15024 || (TREE_CODE (TREE_OPERAND (incr
, 2)) == MINUS_EXPR
)))
15026 tree rhs
= TREE_OPERAND (incr
, 2);
15027 tree lhs
= RECUR (TREE_OPERAND (incr
, 0));
15028 tree rhs0
= RECUR (TREE_OPERAND (rhs
, 0));
15029 tree rhs1
= RECUR (TREE_OPERAND (rhs
, 1));
15030 incr
= build2 (MODIFY_EXPR
, TREE_TYPE (decl
), lhs
,
15031 build2 (TREE_CODE (rhs
), TREE_TYPE (decl
),
15035 incr
= RECUR (incr
);
15038 incr
= RECUR (incr
);
15042 TREE_VEC_ELT (declv
, i
) = decl
;
15043 TREE_VEC_ELT (initv
, i
) = init
;
15044 TREE_VEC_ELT (condv
, i
) = cond
;
15045 TREE_VEC_ELT (incrv
, i
) = incr
;
15049 /* Helper function of tsubst_expr, find OMP_TEAMS inside
15050 of OMP_TARGET's body. */
15053 tsubst_find_omp_teams (tree
*tp
, int *walk_subtrees
, void *)
15055 *walk_subtrees
= 0;
15056 switch (TREE_CODE (*tp
))
15061 case STATEMENT_LIST
:
15062 *walk_subtrees
= 1;
15070 /* Like tsubst_copy for expressions, etc. but also does semantic
15074 tsubst_expr (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
,
15075 bool integral_constant_expression_p
)
15077 #define RETURN(EXP) do { r = (EXP); goto out; } while(0)
15078 #define RECUR(NODE) \
15079 tsubst_expr ((NODE), args, complain, in_decl, \
15080 integral_constant_expression_p)
15086 if (t
== NULL_TREE
|| t
== error_mark_node
)
15089 loc
= input_location
;
15090 if (EXPR_HAS_LOCATION (t
))
15091 input_location
= EXPR_LOCATION (t
);
15092 if (STATEMENT_CODE_P (TREE_CODE (t
)))
15093 current_stmt_tree ()->stmts_are_full_exprs_p
= STMT_IS_FULL_EXPR_P (t
);
15095 switch (TREE_CODE (t
))
15097 case STATEMENT_LIST
:
15099 tree_stmt_iterator i
;
15100 for (i
= tsi_start (t
); !tsi_end_p (i
); tsi_next (&i
))
15101 RECUR (tsi_stmt (i
));
15105 case CTOR_INITIALIZER
:
15106 finish_mem_initializers (tsubst_initializer_list
15107 (TREE_OPERAND (t
, 0), args
));
15111 finish_return_stmt (RECUR (TREE_OPERAND (t
, 0)));
15115 tmp
= RECUR (EXPR_STMT_EXPR (t
));
15116 if (EXPR_STMT_STMT_EXPR_RESULT (t
))
15117 finish_stmt_expr_expr (tmp
, cur_stmt_expr
);
15119 finish_expr_stmt (tmp
);
15123 do_using_directive (USING_STMT_NAMESPACE (t
));
15128 tree decl
, pattern_decl
;
15131 pattern_decl
= decl
= DECL_EXPR_DECL (t
);
15132 if (TREE_CODE (decl
) == LABEL_DECL
)
15133 finish_label_decl (DECL_NAME (decl
));
15134 else if (TREE_CODE (decl
) == USING_DECL
)
15136 tree scope
= USING_DECL_SCOPE (decl
);
15137 tree name
= DECL_NAME (decl
);
15140 scope
= tsubst (scope
, args
, complain
, in_decl
);
15141 decl
= lookup_qualified_name (scope
, name
,
15142 /*is_type_p=*/false,
15143 /*complain=*/false);
15144 if (decl
== error_mark_node
|| TREE_CODE (decl
) == TREE_LIST
)
15145 qualified_name_lookup_error (scope
, name
, decl
, input_location
);
15147 do_local_using_decl (decl
, scope
, name
);
15149 else if (DECL_PACK_P (decl
))
15151 /* Don't build up decls for a variadic capture proxy, we'll
15152 instantiate the elements directly as needed. */
15157 init
= DECL_INITIAL (decl
);
15158 decl
= tsubst (decl
, args
, complain
, in_decl
);
15159 if (decl
!= error_mark_node
)
15161 /* By marking the declaration as instantiated, we avoid
15162 trying to instantiate it. Since instantiate_decl can't
15163 handle local variables, and since we've already done
15164 all that needs to be done, that's the right thing to
15167 DECL_TEMPLATE_INSTANTIATED (decl
) = 1;
15169 && ANON_AGGR_TYPE_P (TREE_TYPE (decl
)))
15170 /* Anonymous aggregates are a special case. */
15171 finish_anon_union (decl
);
15172 else if (is_capture_proxy (DECL_EXPR_DECL (t
)))
15174 DECL_CONTEXT (decl
) = current_function_decl
;
15175 if (DECL_NAME (decl
) == this_identifier
)
15177 tree lam
= DECL_CONTEXT (current_function_decl
);
15178 lam
= CLASSTYPE_LAMBDA_EXPR (lam
);
15179 LAMBDA_EXPR_THIS_CAPTURE (lam
) = decl
;
15181 insert_capture_proxy (decl
);
15183 else if (DECL_IMPLICIT_TYPEDEF_P (t
))
15184 /* We already did a pushtag. */;
15185 else if (TREE_CODE (decl
) == FUNCTION_DECL
15186 && DECL_OMP_DECLARE_REDUCTION_P (decl
)
15187 && DECL_FUNCTION_SCOPE_P (pattern_decl
))
15189 DECL_CONTEXT (decl
) = NULL_TREE
;
15191 DECL_CONTEXT (decl
) = current_function_decl
;
15192 cp_check_omp_declare_reduction (decl
);
15196 int const_init
= false;
15197 maybe_push_decl (decl
);
15199 && DECL_PRETTY_FUNCTION_P (decl
))
15201 /* For __PRETTY_FUNCTION__ we have to adjust the
15203 const char *const name
15204 = cxx_printable_name (current_function_decl
, 2);
15205 init
= cp_fname_init (name
, &TREE_TYPE (decl
));
15208 init
= tsubst_init (init
, decl
, args
, complain
, in_decl
);
15211 const_init
= (DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P
15213 cp_finish_decl (decl
, init
, const_init
, NULL_TREE
, 0);
15222 stmt
= begin_for_stmt (NULL_TREE
, NULL_TREE
);
15223 RECUR (FOR_INIT_STMT (t
));
15224 finish_for_init_stmt (stmt
);
15225 tmp
= RECUR (FOR_COND (t
));
15226 finish_for_cond (tmp
, stmt
, false);
15227 tmp
= RECUR (FOR_EXPR (t
));
15228 finish_for_expr (tmp
, stmt
);
15229 RECUR (FOR_BODY (t
));
15230 finish_for_stmt (stmt
);
15233 case RANGE_FOR_STMT
:
15236 stmt
= begin_for_stmt (NULL_TREE
, NULL_TREE
);
15237 decl
= RANGE_FOR_DECL (t
);
15238 decl
= tsubst (decl
, args
, complain
, in_decl
);
15239 maybe_push_decl (decl
);
15240 expr
= RECUR (RANGE_FOR_EXPR (t
));
15241 stmt
= cp_convert_range_for (stmt
, decl
, expr
, RANGE_FOR_IVDEP (t
));
15242 RECUR (RANGE_FOR_BODY (t
));
15243 finish_for_stmt (stmt
);
15248 stmt
= begin_while_stmt ();
15249 tmp
= RECUR (WHILE_COND (t
));
15250 finish_while_stmt_cond (tmp
, stmt
, false);
15251 RECUR (WHILE_BODY (t
));
15252 finish_while_stmt (stmt
);
15256 stmt
= begin_do_stmt ();
15257 RECUR (DO_BODY (t
));
15258 finish_do_body (stmt
);
15259 tmp
= RECUR (DO_COND (t
));
15260 finish_do_stmt (tmp
, stmt
, false);
15264 stmt
= begin_if_stmt ();
15265 tmp
= RECUR (IF_COND (t
));
15266 finish_if_stmt_cond (tmp
, stmt
);
15267 RECUR (THEN_CLAUSE (t
));
15268 finish_then_clause (stmt
);
15270 if (ELSE_CLAUSE (t
))
15272 begin_else_clause (stmt
);
15273 RECUR (ELSE_CLAUSE (t
));
15274 finish_else_clause (stmt
);
15277 finish_if_stmt (stmt
);
15281 if (BIND_EXPR_BODY_BLOCK (t
))
15282 stmt
= begin_function_body ();
15284 stmt
= begin_compound_stmt (BIND_EXPR_TRY_BLOCK (t
)
15285 ? BCS_TRY_BLOCK
: 0);
15287 RECUR (BIND_EXPR_BODY (t
));
15289 if (BIND_EXPR_BODY_BLOCK (t
))
15290 finish_function_body (stmt
);
15292 finish_compound_stmt (stmt
);
15296 finish_break_stmt ();
15299 case CONTINUE_STMT
:
15300 finish_continue_stmt ();
15304 stmt
= begin_switch_stmt ();
15305 tmp
= RECUR (SWITCH_STMT_COND (t
));
15306 finish_switch_cond (tmp
, stmt
);
15307 RECUR (SWITCH_STMT_BODY (t
));
15308 finish_switch_stmt (stmt
);
15311 case CASE_LABEL_EXPR
:
15313 tree low
= RECUR (CASE_LOW (t
));
15314 tree high
= RECUR (CASE_HIGH (t
));
15315 finish_case_label (EXPR_LOCATION (t
), low
, high
);
15321 tree decl
= LABEL_EXPR_LABEL (t
);
15324 label
= finish_label_stmt (DECL_NAME (decl
));
15325 if (DECL_ATTRIBUTES (decl
) != NULL_TREE
)
15326 cplus_decl_attributes (&label
, DECL_ATTRIBUTES (decl
), 0);
15331 tmp
= GOTO_DESTINATION (t
);
15332 if (TREE_CODE (tmp
) != LABEL_DECL
)
15333 /* Computed goto's must be tsubst'd into. On the other hand,
15334 non-computed gotos must not be; the identifier in question
15335 will have no binding. */
15338 tmp
= DECL_NAME (tmp
);
15339 finish_goto_stmt (tmp
);
15344 tree string
= RECUR (ASM_STRING (t
));
15345 tree outputs
= tsubst_copy_asm_operands (ASM_OUTPUTS (t
), args
,
15346 complain
, in_decl
);
15347 tree inputs
= tsubst_copy_asm_operands (ASM_INPUTS (t
), args
,
15348 complain
, in_decl
);
15349 tree clobbers
= tsubst_copy_asm_operands (ASM_CLOBBERS (t
), args
,
15350 complain
, in_decl
);
15351 tree labels
= tsubst_copy_asm_operands (ASM_LABELS (t
), args
,
15352 complain
, in_decl
);
15353 tmp
= finish_asm_stmt (ASM_VOLATILE_P (t
), string
, outputs
, inputs
,
15355 tree asm_expr
= tmp
;
15356 if (TREE_CODE (asm_expr
) == CLEANUP_POINT_EXPR
)
15357 asm_expr
= TREE_OPERAND (asm_expr
, 0);
15358 ASM_INPUT_P (asm_expr
) = ASM_INPUT_P (t
);
15365 stmt
= begin_try_block ();
15366 RECUR (TRY_STMTS (t
));
15367 finish_cleanup_try_block (stmt
);
15368 finish_cleanup (RECUR (TRY_HANDLERS (t
)), stmt
);
15372 tree compound_stmt
= NULL_TREE
;
15374 if (FN_TRY_BLOCK_P (t
))
15375 stmt
= begin_function_try_block (&compound_stmt
);
15377 stmt
= begin_try_block ();
15379 RECUR (TRY_STMTS (t
));
15381 if (FN_TRY_BLOCK_P (t
))
15382 finish_function_try_block (stmt
);
15384 finish_try_block (stmt
);
15386 RECUR (TRY_HANDLERS (t
));
15387 if (FN_TRY_BLOCK_P (t
))
15388 finish_function_handler_sequence (stmt
, compound_stmt
);
15390 finish_handler_sequence (stmt
);
15396 tree decl
= HANDLER_PARMS (t
);
15400 decl
= tsubst (decl
, args
, complain
, in_decl
);
15401 /* Prevent instantiate_decl from trying to instantiate
15402 this variable. We've already done all that needs to be
15404 if (decl
!= error_mark_node
)
15405 DECL_TEMPLATE_INSTANTIATED (decl
) = 1;
15407 stmt
= begin_handler ();
15408 finish_handler_parms (decl
, stmt
);
15409 RECUR (HANDLER_BODY (t
));
15410 finish_handler (stmt
);
15415 tmp
= tsubst (TREE_TYPE (t
), args
, complain
, NULL_TREE
);
15416 if (CLASS_TYPE_P (tmp
))
15418 /* Local classes are not independent templates; they are
15419 instantiated along with their containing function. And this
15420 way we don't have to deal with pushing out of one local class
15421 to instantiate a member of another local class. */
15423 /* Closures are handled by the LAMBDA_EXPR. */
15424 gcc_assert (!LAMBDA_TYPE_P (TREE_TYPE (t
)));
15425 complete_type (tmp
);
15426 for (fn
= TYPE_METHODS (tmp
); fn
; fn
= DECL_CHAIN (fn
))
15427 if (!DECL_ARTIFICIAL (fn
))
15428 instantiate_decl (fn
, /*defer_ok*/0, /*expl_inst_class*/false);
15432 case STATIC_ASSERT
:
15436 ++c_inhibit_evaluation_warnings
;
15438 tsubst_expr (STATIC_ASSERT_CONDITION (t
),
15441 /*integral_constant_expression_p=*/true);
15442 --c_inhibit_evaluation_warnings
;
15444 finish_static_assert (condition
,
15445 STATIC_ASSERT_MESSAGE (t
),
15446 STATIC_ASSERT_SOURCE_LOCATION (t
),
15447 /*member_p=*/false);
15452 case OACC_PARALLEL
:
15453 tmp
= tsubst_omp_clauses (OMP_CLAUSES (t
), false, false, args
, complain
,
15455 stmt
= begin_omp_parallel ();
15456 RECUR (OMP_BODY (t
));
15457 finish_omp_construct (TREE_CODE (t
), stmt
, tmp
);
15461 r
= push_omp_privatization_clauses (OMP_PARALLEL_COMBINED (t
));
15462 tmp
= tsubst_omp_clauses (OMP_PARALLEL_CLAUSES (t
), false, true,
15463 args
, complain
, in_decl
);
15464 if (OMP_PARALLEL_COMBINED (t
))
15465 omp_parallel_combined_clauses
= &tmp
;
15466 stmt
= begin_omp_parallel ();
15467 RECUR (OMP_PARALLEL_BODY (t
));
15468 gcc_assert (omp_parallel_combined_clauses
== NULL
);
15469 OMP_PARALLEL_COMBINED (finish_omp_parallel (tmp
, stmt
))
15470 = OMP_PARALLEL_COMBINED (t
);
15471 pop_omp_privatization_clauses (r
);
15475 r
= push_omp_privatization_clauses (false);
15476 tmp
= tsubst_omp_clauses (OMP_TASK_CLAUSES (t
), false, true,
15477 args
, complain
, in_decl
);
15478 stmt
= begin_omp_task ();
15479 RECUR (OMP_TASK_BODY (t
));
15480 finish_omp_task (tmp
, stmt
);
15481 pop_omp_privatization_clauses (r
);
15488 case OMP_DISTRIBUTE
:
15492 tree clauses
, body
, pre_body
;
15493 tree declv
= NULL_TREE
, initv
= NULL_TREE
, condv
= NULL_TREE
;
15494 tree orig_declv
= NULL_TREE
;
15495 tree incrv
= NULL_TREE
;
15498 r
= push_omp_privatization_clauses (OMP_FOR_INIT (t
) == NULL_TREE
);
15499 clauses
= tsubst_omp_clauses (OMP_FOR_CLAUSES (t
), false,
15500 TREE_CODE (t
) != OACC_LOOP
,
15501 args
, complain
, in_decl
);
15502 if (OMP_FOR_INIT (t
) != NULL_TREE
)
15504 declv
= make_tree_vec (TREE_VEC_LENGTH (OMP_FOR_INIT (t
)));
15505 if (OMP_FOR_ORIG_DECLS (t
))
15506 orig_declv
= make_tree_vec (TREE_VEC_LENGTH (OMP_FOR_INIT (t
)));
15507 initv
= make_tree_vec (TREE_VEC_LENGTH (OMP_FOR_INIT (t
)));
15508 condv
= make_tree_vec (TREE_VEC_LENGTH (OMP_FOR_INIT (t
)));
15509 incrv
= make_tree_vec (TREE_VEC_LENGTH (OMP_FOR_INIT (t
)));
15512 stmt
= begin_omp_structured_block ();
15514 pre_body
= push_stmt_list ();
15515 RECUR (OMP_FOR_PRE_BODY (t
));
15516 pre_body
= pop_stmt_list (pre_body
);
15518 if (OMP_FOR_INIT (t
) != NULL_TREE
)
15519 for (i
= 0; i
< TREE_VEC_LENGTH (OMP_FOR_INIT (t
)); i
++)
15520 tsubst_omp_for_iterator (t
, i
, declv
, orig_declv
, initv
, condv
,
15521 incrv
, &clauses
, args
, complain
, in_decl
,
15522 integral_constant_expression_p
);
15523 omp_parallel_combined_clauses
= NULL
;
15525 body
= push_stmt_list ();
15526 RECUR (OMP_FOR_BODY (t
));
15527 body
= pop_stmt_list (body
);
15529 if (OMP_FOR_INIT (t
) != NULL_TREE
)
15530 t
= finish_omp_for (EXPR_LOCATION (t
), TREE_CODE (t
), declv
,
15531 orig_declv
, initv
, condv
, incrv
, body
, pre_body
,
15535 t
= make_node (TREE_CODE (t
));
15536 TREE_TYPE (t
) = void_type_node
;
15537 OMP_FOR_BODY (t
) = body
;
15538 OMP_FOR_PRE_BODY (t
) = pre_body
;
15539 OMP_FOR_CLAUSES (t
) = clauses
;
15540 SET_EXPR_LOCATION (t
, EXPR_LOCATION (t
));
15544 add_stmt (finish_omp_structured_block (stmt
));
15545 pop_omp_privatization_clauses (r
);
15550 omp_parallel_combined_clauses
= NULL
;
15555 r
= push_omp_privatization_clauses (TREE_CODE (t
) == OMP_TEAMS
15556 && OMP_TEAMS_COMBINED (t
));
15557 tmp
= tsubst_omp_clauses (OMP_CLAUSES (t
), false, true,
15558 args
, complain
, in_decl
);
15559 stmt
= push_stmt_list ();
15560 RECUR (OMP_BODY (t
));
15561 stmt
= pop_stmt_list (stmt
);
15564 OMP_BODY (t
) = stmt
;
15565 OMP_CLAUSES (t
) = tmp
;
15567 pop_omp_privatization_clauses (r
);
15571 case OMP_TARGET_DATA
:
15573 tmp
= tsubst_omp_clauses (OMP_CLAUSES (t
), false,
15574 TREE_CODE (t
) != OACC_DATA
,
15575 args
, complain
, in_decl
);
15576 keep_next_level (true);
15577 stmt
= begin_omp_structured_block ();
15579 RECUR (OMP_BODY (t
));
15580 stmt
= finish_omp_structured_block (stmt
);
15583 OMP_BODY (t
) = stmt
;
15584 OMP_CLAUSES (t
) = tmp
;
15585 if (TREE_CODE (t
) == OMP_TARGET
&& OMP_TARGET_COMBINED (t
))
15587 tree teams
= cp_walk_tree (&stmt
, tsubst_find_omp_teams
, NULL
, NULL
);
15590 /* For combined target teams, ensure the num_teams and
15591 thread_limit clause expressions are evaluated on the host,
15592 before entering the target construct. */
15594 for (c
= OMP_TEAMS_CLAUSES (teams
);
15595 c
; c
= OMP_CLAUSE_CHAIN (c
))
15596 if ((OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_NUM_TEAMS
15597 || OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_THREAD_LIMIT
)
15598 && TREE_CODE (OMP_CLAUSE_OPERAND (c
, 0)) != INTEGER_CST
)
15600 tree expr
= OMP_CLAUSE_OPERAND (c
, 0);
15601 expr
= force_target_expr (TREE_TYPE (expr
), expr
, tf_none
);
15602 if (expr
== error_mark_node
)
15604 tmp
= TARGET_EXPR_SLOT (expr
);
15606 OMP_CLAUSE_OPERAND (c
, 0) = expr
;
15607 tree tc
= build_omp_clause (OMP_CLAUSE_LOCATION (c
),
15608 OMP_CLAUSE_FIRSTPRIVATE
);
15609 OMP_CLAUSE_DECL (tc
) = tmp
;
15610 OMP_CLAUSE_CHAIN (tc
) = OMP_TARGET_CLAUSES (t
);
15611 OMP_TARGET_CLAUSES (t
) = tc
;
15620 tmp
= tsubst_omp_clauses (OACC_DECLARE_CLAUSES (t
), false, false,
15621 args
, complain
, in_decl
);
15622 OACC_DECLARE_CLAUSES (t
) = tmp
;
15626 case OMP_TARGET_UPDATE
:
15627 case OMP_TARGET_ENTER_DATA
:
15628 case OMP_TARGET_EXIT_DATA
:
15629 tmp
= tsubst_omp_clauses (OMP_STANDALONE_CLAUSES (t
), false, true,
15630 args
, complain
, in_decl
);
15632 OMP_STANDALONE_CLAUSES (t
) = tmp
;
15636 case OACC_ENTER_DATA
:
15637 case OACC_EXIT_DATA
:
15639 tmp
= tsubst_omp_clauses (OMP_STANDALONE_CLAUSES (t
), false, false,
15640 args
, complain
, in_decl
);
15642 OMP_STANDALONE_CLAUSES (t
) = tmp
;
15647 tmp
= tsubst_omp_clauses (OMP_ORDERED_CLAUSES (t
), false, true,
15648 args
, complain
, in_decl
);
15649 stmt
= push_stmt_list ();
15650 RECUR (OMP_BODY (t
));
15651 stmt
= pop_stmt_list (stmt
);
15654 OMP_BODY (t
) = stmt
;
15655 OMP_ORDERED_CLAUSES (t
) = tmp
;
15661 case OMP_TASKGROUP
:
15662 stmt
= push_stmt_list ();
15663 RECUR (OMP_BODY (t
));
15664 stmt
= pop_stmt_list (stmt
);
15667 OMP_BODY (t
) = stmt
;
15672 gcc_assert (OMP_ATOMIC_DEPENDENT_P (t
));
15673 if (TREE_CODE (TREE_OPERAND (t
, 1)) != MODIFY_EXPR
)
15675 tree op1
= TREE_OPERAND (t
, 1);
15676 tree rhs1
= NULL_TREE
;
15678 if (TREE_CODE (op1
) == COMPOUND_EXPR
)
15680 rhs1
= RECUR (TREE_OPERAND (op1
, 0));
15681 op1
= TREE_OPERAND (op1
, 1);
15683 lhs
= RECUR (TREE_OPERAND (op1
, 0));
15684 rhs
= RECUR (TREE_OPERAND (op1
, 1));
15685 finish_omp_atomic (OMP_ATOMIC
, TREE_CODE (op1
), lhs
, rhs
,
15686 NULL_TREE
, NULL_TREE
, rhs1
,
15687 OMP_ATOMIC_SEQ_CST (t
));
15691 tree op1
= TREE_OPERAND (t
, 1);
15692 tree v
= NULL_TREE
, lhs
, rhs
= NULL_TREE
, lhs1
= NULL_TREE
;
15693 tree rhs1
= NULL_TREE
;
15694 enum tree_code code
= TREE_CODE (TREE_OPERAND (op1
, 1));
15695 enum tree_code opcode
= NOP_EXPR
;
15696 if (code
== OMP_ATOMIC_READ
)
15698 v
= RECUR (TREE_OPERAND (op1
, 0));
15699 lhs
= RECUR (TREE_OPERAND (TREE_OPERAND (op1
, 1), 0));
15701 else if (code
== OMP_ATOMIC_CAPTURE_OLD
15702 || code
== OMP_ATOMIC_CAPTURE_NEW
)
15704 tree op11
= TREE_OPERAND (TREE_OPERAND (op1
, 1), 1);
15705 v
= RECUR (TREE_OPERAND (op1
, 0));
15706 lhs1
= RECUR (TREE_OPERAND (TREE_OPERAND (op1
, 1), 0));
15707 if (TREE_CODE (op11
) == COMPOUND_EXPR
)
15709 rhs1
= RECUR (TREE_OPERAND (op11
, 0));
15710 op11
= TREE_OPERAND (op11
, 1);
15712 lhs
= RECUR (TREE_OPERAND (op11
, 0));
15713 rhs
= RECUR (TREE_OPERAND (op11
, 1));
15714 opcode
= TREE_CODE (op11
);
15715 if (opcode
== MODIFY_EXPR
)
15721 lhs
= RECUR (TREE_OPERAND (op1
, 0));
15722 rhs
= RECUR (TREE_OPERAND (op1
, 1));
15724 finish_omp_atomic (code
, opcode
, lhs
, rhs
, v
, lhs1
, rhs1
,
15725 OMP_ATOMIC_SEQ_CST (t
));
15729 case TRANSACTION_EXPR
:
15732 flags
|= (TRANSACTION_EXPR_OUTER (t
) ? TM_STMT_ATTR_OUTER
: 0);
15733 flags
|= (TRANSACTION_EXPR_RELAXED (t
) ? TM_STMT_ATTR_RELAXED
: 0);
15735 if (TRANSACTION_EXPR_IS_STMT (t
))
15737 tree body
= TRANSACTION_EXPR_BODY (t
);
15738 tree noex
= NULL_TREE
;
15739 if (TREE_CODE (body
) == MUST_NOT_THROW_EXPR
)
15741 noex
= MUST_NOT_THROW_COND (body
);
15742 if (noex
== NULL_TREE
)
15743 noex
= boolean_true_node
;
15744 body
= TREE_OPERAND (body
, 0);
15746 stmt
= begin_transaction_stmt (input_location
, NULL
, flags
);
15748 finish_transaction_stmt (stmt
, NULL
, flags
, RECUR (noex
));
15752 stmt
= build_transaction_expr (EXPR_LOCATION (t
),
15753 RECUR (TRANSACTION_EXPR_BODY (t
)),
15760 case MUST_NOT_THROW_EXPR
:
15762 tree op0
= RECUR (TREE_OPERAND (t
, 0));
15763 tree cond
= RECUR (MUST_NOT_THROW_COND (t
));
15764 RETURN (build_must_not_throw_expr (op0
, cond
));
15767 case EXPR_PACK_EXPANSION
:
15768 error ("invalid use of pack expansion expression");
15769 RETURN (error_mark_node
);
15771 case NONTYPE_ARGUMENT_PACK
:
15772 error ("use %<...%> to expand argument pack");
15773 RETURN (error_mark_node
);
15775 case CILK_SPAWN_STMT
:
15776 cfun
->calls_cilk_spawn
= 1;
15777 RETURN (build_cilk_spawn (EXPR_LOCATION (t
), RECUR (CILK_SPAWN_FN (t
))));
15779 case CILK_SYNC_STMT
:
15780 RETURN (build_cilk_sync ());
15782 case COMPOUND_EXPR
:
15783 tmp
= RECUR (TREE_OPERAND (t
, 0));
15784 if (tmp
== NULL_TREE
)
15785 /* If the first operand was a statement, we're done with it. */
15786 RETURN (RECUR (TREE_OPERAND (t
, 1)));
15787 RETURN (build_x_compound_expr (EXPR_LOCATION (t
), tmp
,
15788 RECUR (TREE_OPERAND (t
, 1)),
15791 case ANNOTATE_EXPR
:
15792 tmp
= RECUR (TREE_OPERAND (t
, 0));
15793 RETURN (build2_loc (EXPR_LOCATION (t
), ANNOTATE_EXPR
,
15794 TREE_TYPE (tmp
), tmp
, RECUR (TREE_OPERAND (t
, 1))));
15797 gcc_assert (!STATEMENT_CODE_P (TREE_CODE (t
)));
15799 RETURN (tsubst_copy_and_build (t
, args
, complain
, in_decl
,
15800 /*function_p=*/false,
15801 integral_constant_expression_p
));
15804 RETURN (NULL_TREE
);
15806 input_location
= loc
;
15812 /* Instantiate the special body of the artificial DECL_OMP_DECLARE_REDUCTION
15813 function. For description of the body see comment above
15814 cp_parser_omp_declare_reduction_exprs. */
15817 tsubst_omp_udr (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
15819 if (t
== NULL_TREE
|| t
== error_mark_node
)
15822 gcc_assert (TREE_CODE (t
) == STATEMENT_LIST
);
15824 tree_stmt_iterator tsi
;
15827 memset (stmts
, 0, sizeof stmts
);
15828 for (i
= 0, tsi
= tsi_start (t
);
15829 i
< 7 && !tsi_end_p (tsi
);
15830 i
++, tsi_next (&tsi
))
15831 stmts
[i
] = tsi_stmt (tsi
);
15832 gcc_assert (tsi_end_p (tsi
));
15836 gcc_assert (TREE_CODE (stmts
[0]) == DECL_EXPR
15837 && TREE_CODE (stmts
[1]) == DECL_EXPR
);
15838 tree omp_out
= tsubst (DECL_EXPR_DECL (stmts
[0]),
15839 args
, complain
, in_decl
);
15840 tree omp_in
= tsubst (DECL_EXPR_DECL (stmts
[1]),
15841 args
, complain
, in_decl
);
15842 DECL_CONTEXT (omp_out
) = current_function_decl
;
15843 DECL_CONTEXT (omp_in
) = current_function_decl
;
15844 keep_next_level (true);
15845 tree block
= begin_omp_structured_block ();
15846 tsubst_expr (stmts
[2], args
, complain
, in_decl
, false);
15847 block
= finish_omp_structured_block (block
);
15848 block
= maybe_cleanup_point_expr_void (block
);
15849 add_decl_expr (omp_out
);
15850 if (TREE_NO_WARNING (DECL_EXPR_DECL (stmts
[0])))
15851 TREE_NO_WARNING (omp_out
) = 1;
15852 add_decl_expr (omp_in
);
15853 finish_expr_stmt (block
);
15857 gcc_assert (TREE_CODE (stmts
[3]) == DECL_EXPR
15858 && TREE_CODE (stmts
[4]) == DECL_EXPR
);
15859 tree omp_priv
= tsubst (DECL_EXPR_DECL (stmts
[3]),
15860 args
, complain
, in_decl
);
15861 tree omp_orig
= tsubst (DECL_EXPR_DECL (stmts
[4]),
15862 args
, complain
, in_decl
);
15863 DECL_CONTEXT (omp_priv
) = current_function_decl
;
15864 DECL_CONTEXT (omp_orig
) = current_function_decl
;
15865 keep_next_level (true);
15866 tree block
= begin_omp_structured_block ();
15867 tsubst_expr (stmts
[5], args
, complain
, in_decl
, false);
15868 block
= finish_omp_structured_block (block
);
15869 block
= maybe_cleanup_point_expr_void (block
);
15870 cp_walk_tree (&block
, cp_remove_omp_priv_cleanup_stmt
, omp_priv
, NULL
);
15871 add_decl_expr (omp_priv
);
15872 add_decl_expr (omp_orig
);
15873 finish_expr_stmt (block
);
15875 add_decl_expr (omp_orig
);
15879 /* T is a postfix-expression that is not being used in a function
15880 call. Return the substituted version of T. */
15883 tsubst_non_call_postfix_expression (tree t
, tree args
,
15884 tsubst_flags_t complain
,
15887 if (TREE_CODE (t
) == SCOPE_REF
)
15888 t
= tsubst_qualified_id (t
, args
, complain
, in_decl
,
15889 /*done=*/false, /*address_p=*/false);
15891 t
= tsubst_copy_and_build (t
, args
, complain
, in_decl
,
15892 /*function_p=*/false,
15893 /*integral_constant_expression_p=*/false);
15898 /* Like tsubst but deals with expressions and performs semantic
15899 analysis. FUNCTION_P is true if T is the "F" in "F (ARGS)". */
15902 tsubst_copy_and_build (tree t
,
15904 tsubst_flags_t complain
,
15907 bool integral_constant_expression_p
)
15909 #define RETURN(EXP) do { retval = (EXP); goto out; } while(0)
15910 #define RECUR(NODE) \
15911 tsubst_copy_and_build (NODE, args, complain, in_decl, \
15912 /*function_p=*/false, \
15913 integral_constant_expression_p)
15918 if (t
== NULL_TREE
|| t
== error_mark_node
)
15921 loc
= input_location
;
15922 if (EXPR_HAS_LOCATION (t
))
15923 input_location
= EXPR_LOCATION (t
);
15925 /* N3276 decltype magic only applies to calls at the top level or on the
15926 right side of a comma. */
15927 tsubst_flags_t decltype_flag
= (complain
& tf_decltype
);
15928 complain
&= ~tf_decltype
;
15930 switch (TREE_CODE (t
))
15934 /* Fall through. */
15935 case IDENTIFIER_NODE
:
15939 bool non_integral_constant_expression_p
;
15940 const char *error_msg
;
15942 if (IDENTIFIER_TYPENAME_P (t
))
15944 tree new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
15945 t
= mangle_conv_op_name_for_type (new_type
);
15948 /* Look up the name. */
15949 decl
= lookup_name (t
);
15951 /* By convention, expressions use ERROR_MARK_NODE to indicate
15952 failure, not NULL_TREE. */
15953 if (decl
== NULL_TREE
)
15954 decl
= error_mark_node
;
15956 decl
= finish_id_expression (t
, decl
, NULL_TREE
,
15958 integral_constant_expression_p
,
15959 /*allow_non_integral_constant_expression_p=*/(cxx_dialect
>= cxx11
),
15960 &non_integral_constant_expression_p
,
15961 /*template_p=*/false,
15963 /*address_p=*/false,
15964 /*template_arg_p=*/false,
15969 if (!function_p
&& identifier_p (decl
))
15971 if (complain
& tf_error
)
15972 unqualified_name_lookup_error (decl
);
15973 decl
= error_mark_node
;
15978 case TEMPLATE_ID_EXPR
:
15981 tree templ
= RECUR (TREE_OPERAND (t
, 0));
15982 tree targs
= TREE_OPERAND (t
, 1);
15985 targs
= tsubst_template_args (targs
, args
, complain
, in_decl
);
15986 if (targs
== error_mark_node
)
15987 return error_mark_node
;
15989 if (variable_template_p (templ
))
15990 RETURN (lookup_and_finish_template_variable (templ
, targs
, complain
));
15992 if (TREE_CODE (templ
) == COMPONENT_REF
)
15994 object
= TREE_OPERAND (templ
, 0);
15995 templ
= TREE_OPERAND (templ
, 1);
15998 object
= NULL_TREE
;
15999 templ
= lookup_template_function (templ
, targs
);
16002 RETURN (build3 (COMPONENT_REF
, TREE_TYPE (templ
),
16003 object
, templ
, NULL_TREE
));
16005 RETURN (baselink_for_fns (templ
));
16010 tree r
= RECUR (TREE_OPERAND (t
, 0));
16012 if (REFERENCE_REF_P (t
))
16014 /* A type conversion to reference type will be enclosed in
16015 such an indirect ref, but the substitution of the cast
16016 will have also added such an indirect ref. */
16017 if (TREE_CODE (TREE_TYPE (r
)) == REFERENCE_TYPE
)
16018 r
= convert_from_reference (r
);
16021 r
= build_x_indirect_ref (input_location
, r
, RO_UNARY_STAR
,
16022 complain
|decltype_flag
);
16024 if (TREE_CODE (r
) == INDIRECT_REF
)
16025 REF_PARENTHESIZED_P (r
) = REF_PARENTHESIZED_P (t
);
16032 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
16033 tree op0
= RECUR (TREE_OPERAND (t
, 0));
16034 RETURN (build_nop (type
, op0
));
16037 case IMPLICIT_CONV_EXPR
:
16039 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
16040 tree expr
= RECUR (TREE_OPERAND (t
, 0));
16041 int flags
= LOOKUP_IMPLICIT
;
16042 if (IMPLICIT_CONV_EXPR_DIRECT_INIT (t
))
16043 flags
= LOOKUP_NORMAL
;
16044 RETURN (perform_implicit_conversion_flags (type
, expr
, complain
,
16050 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
16051 tree op0
= RECUR (TREE_OPERAND (t
, 0));
16052 RETURN (build1 (CONVERT_EXPR
, type
, op0
));
16056 case REINTERPRET_CAST_EXPR
:
16057 case CONST_CAST_EXPR
:
16058 case DYNAMIC_CAST_EXPR
:
16059 case STATIC_CAST_EXPR
:
16062 tree op
, r
= NULL_TREE
;
16064 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
16065 if (integral_constant_expression_p
16066 && !cast_valid_in_integral_constant_expression_p (type
))
16068 if (complain
& tf_error
)
16069 error ("a cast to a type other than an integral or "
16070 "enumeration type cannot appear in a constant-expression");
16071 RETURN (error_mark_node
);
16074 op
= RECUR (TREE_OPERAND (t
, 0));
16076 warning_sentinel
s(warn_useless_cast
);
16077 switch (TREE_CODE (t
))
16080 r
= build_functional_cast (type
, op
, complain
);
16082 case REINTERPRET_CAST_EXPR
:
16083 r
= build_reinterpret_cast (type
, op
, complain
);
16085 case CONST_CAST_EXPR
:
16086 r
= build_const_cast (type
, op
, complain
);
16088 case DYNAMIC_CAST_EXPR
:
16089 r
= build_dynamic_cast (type
, op
, complain
);
16091 case STATIC_CAST_EXPR
:
16092 r
= build_static_cast (type
, op
, complain
);
16095 gcc_unreachable ();
16101 case POSTDECREMENT_EXPR
:
16102 case POSTINCREMENT_EXPR
:
16103 op1
= tsubst_non_call_postfix_expression (TREE_OPERAND (t
, 0),
16104 args
, complain
, in_decl
);
16105 RETURN (build_x_unary_op (input_location
, TREE_CODE (t
), op1
,
16106 complain
|decltype_flag
));
16108 case PREDECREMENT_EXPR
:
16109 case PREINCREMENT_EXPR
:
16113 case TRUTH_NOT_EXPR
:
16114 case UNARY_PLUS_EXPR
: /* Unary + */
16115 case REALPART_EXPR
:
16116 case IMAGPART_EXPR
:
16117 RETURN (build_x_unary_op (input_location
, TREE_CODE (t
),
16118 RECUR (TREE_OPERAND (t
, 0)),
16119 complain
|decltype_flag
));
16121 case FIX_TRUNC_EXPR
:
16122 RETURN (cp_build_unary_op (FIX_TRUNC_EXPR
, RECUR (TREE_OPERAND (t
, 0)),
16126 op1
= TREE_OPERAND (t
, 0);
16127 if (TREE_CODE (op1
) == LABEL_DECL
)
16128 RETURN (finish_label_address_expr (DECL_NAME (op1
),
16129 EXPR_LOCATION (op1
)));
16130 if (TREE_CODE (op1
) == SCOPE_REF
)
16131 op1
= tsubst_qualified_id (op1
, args
, complain
, in_decl
,
16132 /*done=*/true, /*address_p=*/true);
16134 op1
= tsubst_non_call_postfix_expression (op1
, args
, complain
,
16136 RETURN (build_x_unary_op (input_location
, ADDR_EXPR
, op1
,
16137 complain
|decltype_flag
));
16142 case TRUNC_DIV_EXPR
:
16143 case CEIL_DIV_EXPR
:
16144 case FLOOR_DIV_EXPR
:
16145 case ROUND_DIV_EXPR
:
16146 case EXACT_DIV_EXPR
:
16150 case TRUNC_MOD_EXPR
:
16151 case FLOOR_MOD_EXPR
:
16152 case TRUTH_ANDIF_EXPR
:
16153 case TRUTH_ORIF_EXPR
:
16154 case TRUTH_AND_EXPR
:
16155 case TRUTH_OR_EXPR
:
16171 warning_sentinel
s1(warn_type_limits
);
16172 warning_sentinel
s2(warn_div_by_zero
);
16173 warning_sentinel
s3(warn_logical_op
);
16174 warning_sentinel
s4(warn_tautological_compare
);
16175 tree op0
= RECUR (TREE_OPERAND (t
, 0));
16176 tree op1
= RECUR (TREE_OPERAND (t
, 1));
16177 tree r
= build_x_binary_op
16178 (input_location
, TREE_CODE (t
),
16180 (TREE_NO_WARNING (TREE_OPERAND (t
, 0))
16182 : TREE_CODE (TREE_OPERAND (t
, 0))),
16184 (TREE_NO_WARNING (TREE_OPERAND (t
, 1))
16186 : TREE_CODE (TREE_OPERAND (t
, 1))),
16188 complain
|decltype_flag
);
16189 if (EXPR_P (r
) && TREE_NO_WARNING (t
))
16190 TREE_NO_WARNING (r
) = TREE_NO_WARNING (t
);
16195 case POINTER_PLUS_EXPR
:
16197 tree op0
= RECUR (TREE_OPERAND (t
, 0));
16198 tree op1
= RECUR (TREE_OPERAND (t
, 1));
16199 return fold_build_pointer_plus (op0
, op1
);
16203 RETURN (tsubst_qualified_id (t
, args
, complain
, in_decl
, /*done=*/true,
16204 /*address_p=*/false));
16206 op1
= tsubst_non_call_postfix_expression (TREE_OPERAND (t
, 0),
16207 args
, complain
, in_decl
);
16208 RETURN (build_x_array_ref (EXPR_LOCATION (t
), op1
,
16209 RECUR (TREE_OPERAND (t
, 1)),
16210 complain
|decltype_flag
));
16212 case ARRAY_NOTATION_REF
:
16214 tree start_index
, length
, stride
;
16215 op1
= tsubst_non_call_postfix_expression (ARRAY_NOTATION_ARRAY (t
),
16216 args
, complain
, in_decl
);
16217 start_index
= RECUR (ARRAY_NOTATION_START (t
));
16218 length
= RECUR (ARRAY_NOTATION_LENGTH (t
));
16219 stride
= RECUR (ARRAY_NOTATION_STRIDE (t
));
16220 RETURN (build_array_notation_ref (EXPR_LOCATION (t
), op1
, start_index
,
16221 length
, stride
, TREE_TYPE (op1
)));
16224 if (PACK_EXPANSION_P (TREE_OPERAND (t
, 0))
16225 || ARGUMENT_PACK_P (TREE_OPERAND (t
, 0)))
16226 RETURN (tsubst_copy (t
, args
, complain
, in_decl
));
16233 op1
= TREE_OPERAND (t
, 0);
16234 if (TREE_CODE (t
) == SIZEOF_EXPR
&& SIZEOF_EXPR_TYPE_P (t
))
16235 op1
= TREE_TYPE (op1
);
16238 /* When there are no ARGS, we are trying to evaluate a
16239 non-dependent expression from the parser. Trying to do
16240 the substitutions may not work. */
16242 op1
= TREE_TYPE (op1
);
16246 ++cp_unevaluated_operand
;
16247 ++c_inhibit_evaluation_warnings
;
16249 op1
= tsubst (op1
, args
, complain
, in_decl
);
16251 op1
= tsubst_copy_and_build (op1
, args
, complain
, in_decl
,
16252 /*function_p=*/false,
16253 /*integral_constant_expression_p=*/
16255 --cp_unevaluated_operand
;
16256 --c_inhibit_evaluation_warnings
;
16259 r
= cxx_sizeof_or_alignof_type (op1
, TREE_CODE (t
),
16260 complain
& tf_error
);
16262 r
= cxx_sizeof_or_alignof_expr (op1
, TREE_CODE (t
),
16263 complain
& tf_error
);
16264 if (TREE_CODE (t
) == SIZEOF_EXPR
&& r
!= error_mark_node
)
16266 if (TREE_CODE (r
) != SIZEOF_EXPR
|| TYPE_P (op1
))
16268 if (!processing_template_decl
&& TYPE_P (op1
))
16270 r
= build_min (SIZEOF_EXPR
, size_type_node
,
16271 build1 (NOP_EXPR
, op1
, error_mark_node
));
16272 SIZEOF_EXPR_TYPE_P (r
) = 1;
16275 r
= build_min (SIZEOF_EXPR
, size_type_node
, op1
);
16276 TREE_SIDE_EFFECTS (r
) = 0;
16277 TREE_READONLY (r
) = 1;
16279 SET_EXPR_LOCATION (r
, EXPR_LOCATION (t
));
16284 case AT_ENCODE_EXPR
:
16286 op1
= TREE_OPERAND (t
, 0);
16287 ++cp_unevaluated_operand
;
16288 ++c_inhibit_evaluation_warnings
;
16289 op1
= tsubst_copy_and_build (op1
, args
, complain
, in_decl
,
16290 /*function_p=*/false,
16291 /*integral_constant_expression_p=*/false);
16292 --cp_unevaluated_operand
;
16293 --c_inhibit_evaluation_warnings
;
16294 RETURN (objc_build_encode_expr (op1
));
16297 case NOEXCEPT_EXPR
:
16298 op1
= TREE_OPERAND (t
, 0);
16299 ++cp_unevaluated_operand
;
16300 ++c_inhibit_evaluation_warnings
;
16301 ++cp_noexcept_operand
;
16302 op1
= tsubst_copy_and_build (op1
, args
, complain
, in_decl
,
16303 /*function_p=*/false,
16304 /*integral_constant_expression_p=*/false);
16305 --cp_unevaluated_operand
;
16306 --c_inhibit_evaluation_warnings
;
16307 --cp_noexcept_operand
;
16308 RETURN (finish_noexcept_expr (op1
, complain
));
16312 warning_sentinel
s(warn_div_by_zero
);
16313 tree lhs
= RECUR (TREE_OPERAND (t
, 0));
16314 tree rhs
= RECUR (TREE_OPERAND (t
, 2));
16315 tree r
= build_x_modify_expr
16316 (EXPR_LOCATION (t
), lhs
, TREE_CODE (TREE_OPERAND (t
, 1)), rhs
,
16317 complain
|decltype_flag
);
16318 /* TREE_NO_WARNING must be set if either the expression was
16319 parenthesized or it uses an operator such as >>= rather
16320 than plain assignment. In the former case, it was already
16321 set and must be copied. In the latter case,
16322 build_x_modify_expr sets it and it must not be reset
16324 if (TREE_NO_WARNING (t
))
16325 TREE_NO_WARNING (r
) = TREE_NO_WARNING (t
);
16331 op1
= tsubst_non_call_postfix_expression (TREE_OPERAND (t
, 0),
16332 args
, complain
, in_decl
);
16333 /* Remember that there was a reference to this entity. */
16335 && !mark_used (op1
, complain
) && !(complain
& tf_error
))
16336 RETURN (error_mark_node
);
16337 RETURN (build_x_arrow (input_location
, op1
, complain
));
16341 tree placement
= RECUR (TREE_OPERAND (t
, 0));
16342 tree init
= RECUR (TREE_OPERAND (t
, 3));
16343 vec
<tree
, va_gc
> *placement_vec
;
16344 vec
<tree
, va_gc
> *init_vec
;
16347 if (placement
== NULL_TREE
)
16348 placement_vec
= NULL
;
16351 placement_vec
= make_tree_vector ();
16352 for (; placement
!= NULL_TREE
; placement
= TREE_CHAIN (placement
))
16353 vec_safe_push (placement_vec
, TREE_VALUE (placement
));
16356 /* If there was an initializer in the original tree, but it
16357 instantiated to an empty list, then we should pass a
16358 non-NULL empty vector to tell build_new that it was an
16359 empty initializer() rather than no initializer. This can
16360 only happen when the initializer is a pack expansion whose
16361 parameter packs are of length zero. */
16362 if (init
== NULL_TREE
&& TREE_OPERAND (t
, 3) == NULL_TREE
)
16366 init_vec
= make_tree_vector ();
16367 if (init
== void_node
)
16368 gcc_assert (init_vec
!= NULL
);
16371 for (; init
!= NULL_TREE
; init
= TREE_CHAIN (init
))
16372 vec_safe_push (init_vec
, TREE_VALUE (init
));
16376 tree op1
= tsubst (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
16377 tree op2
= RECUR (TREE_OPERAND (t
, 2));
16378 ret
= build_new (&placement_vec
, op1
, op2
, &init_vec
,
16379 NEW_EXPR_USE_GLOBAL (t
),
16382 if (placement_vec
!= NULL
)
16383 release_tree_vector (placement_vec
);
16384 if (init_vec
!= NULL
)
16385 release_tree_vector (init_vec
);
16392 tree op0
= RECUR (TREE_OPERAND (t
, 0));
16393 tree op1
= RECUR (TREE_OPERAND (t
, 1));
16394 RETURN (delete_sanity (op0
, op1
,
16395 DELETE_EXPR_USE_VEC (t
),
16396 DELETE_EXPR_USE_GLOBAL (t
),
16400 case COMPOUND_EXPR
:
16402 tree op0
= tsubst_copy_and_build (TREE_OPERAND (t
, 0), args
,
16403 complain
& ~tf_decltype
, in_decl
,
16404 /*function_p=*/false,
16405 integral_constant_expression_p
);
16406 RETURN (build_x_compound_expr (EXPR_LOCATION (t
),
16408 RECUR (TREE_OPERAND (t
, 1)),
16409 complain
|decltype_flag
));
16415 vec
<tree
, va_gc
> *call_args
;
16416 unsigned int nargs
, i
;
16421 function
= CALL_EXPR_FN (t
);
16422 /* When we parsed the expression, we determined whether or
16423 not Koenig lookup should be performed. */
16424 koenig_p
= KOENIG_LOOKUP_P (t
);
16425 if (TREE_CODE (function
) == SCOPE_REF
)
16427 qualified_p
= true;
16428 function
= tsubst_qualified_id (function
, args
, complain
, in_decl
,
16430 /*address_p=*/false);
16432 else if (koenig_p
&& identifier_p (function
))
16434 /* Do nothing; calling tsubst_copy_and_build on an identifier
16435 would incorrectly perform unqualified lookup again.
16437 Note that we can also have an IDENTIFIER_NODE if the earlier
16438 unqualified lookup found a member function; in that case
16439 koenig_p will be false and we do want to do the lookup
16440 again to find the instantiated member function.
16442 FIXME but doing that causes c++/15272, so we need to stop
16443 using IDENTIFIER_NODE in that situation. */
16444 qualified_p
= false;
16448 if (TREE_CODE (function
) == COMPONENT_REF
)
16450 tree op
= TREE_OPERAND (function
, 1);
16452 qualified_p
= (TREE_CODE (op
) == SCOPE_REF
16453 || (BASELINK_P (op
)
16454 && BASELINK_QUALIFIED_P (op
)));
16457 qualified_p
= false;
16459 if (TREE_CODE (function
) == ADDR_EXPR
16460 && TREE_CODE (TREE_OPERAND (function
, 0)) == FUNCTION_DECL
)
16461 /* Avoid error about taking the address of a constructor. */
16462 function
= TREE_OPERAND (function
, 0);
16464 function
= tsubst_copy_and_build (function
, args
, complain
,
16467 integral_constant_expression_p
);
16469 if (BASELINK_P (function
))
16470 qualified_p
= true;
16473 nargs
= call_expr_nargs (t
);
16474 call_args
= make_tree_vector ();
16475 for (i
= 0; i
< nargs
; ++i
)
16477 tree arg
= CALL_EXPR_ARG (t
, i
);
16479 if (!PACK_EXPANSION_P (arg
))
16480 vec_safe_push (call_args
, RECUR (CALL_EXPR_ARG (t
, i
)));
16483 /* Expand the pack expansion and push each entry onto
16485 arg
= tsubst_pack_expansion (arg
, args
, complain
, in_decl
);
16486 if (TREE_CODE (arg
) == TREE_VEC
)
16488 unsigned int len
, j
;
16490 len
= TREE_VEC_LENGTH (arg
);
16491 for (j
= 0; j
< len
; ++j
)
16493 tree value
= TREE_VEC_ELT (arg
, j
);
16494 if (value
!= NULL_TREE
)
16495 value
= convert_from_reference (value
);
16496 vec_safe_push (call_args
, value
);
16501 /* A partial substitution. Add one entry. */
16502 vec_safe_push (call_args
, arg
);
16507 /* We do not perform argument-dependent lookup if normal
16508 lookup finds a non-function, in accordance with the
16509 expected resolution of DR 218. */
16511 && ((is_overloaded_fn (function
)
16512 /* If lookup found a member function, the Koenig lookup is
16513 not appropriate, even if an unqualified-name was used
16514 to denote the function. */
16515 && !DECL_FUNCTION_MEMBER_P (get_first_fn (function
)))
16516 || identifier_p (function
))
16517 /* Only do this when substitution turns a dependent call
16518 into a non-dependent call. */
16519 && type_dependent_expression_p_push (t
)
16520 && !any_type_dependent_arguments_p (call_args
))
16521 function
= perform_koenig_lookup (function
, call_args
, tf_none
);
16523 if (identifier_p (function
)
16524 && !any_type_dependent_arguments_p (call_args
))
16526 if (koenig_p
&& (complain
& tf_warning_or_error
))
16528 /* For backwards compatibility and good diagnostics, try
16529 the unqualified lookup again if we aren't in SFINAE
16531 tree unq
= (tsubst_copy_and_build
16532 (function
, args
, complain
, in_decl
, true,
16533 integral_constant_expression_p
));
16534 if (unq
== error_mark_node
)
16535 RETURN (error_mark_node
);
16537 if (unq
!= function
)
16540 if (INDIRECT_REF_P (fn
))
16541 fn
= TREE_OPERAND (fn
, 0);
16542 if (TREE_CODE (fn
) == COMPONENT_REF
)
16543 fn
= TREE_OPERAND (fn
, 1);
16544 if (is_overloaded_fn (fn
))
16545 fn
= get_first_fn (fn
);
16546 if (permerror (EXPR_LOC_OR_LOC (t
, input_location
),
16547 "%qD was not declared in this scope, "
16548 "and no declarations were found by "
16549 "argument-dependent lookup at the point "
16550 "of instantiation", function
))
16553 /* Can't say anything more. */;
16554 else if (DECL_CLASS_SCOPE_P (fn
))
16556 location_t loc
= EXPR_LOC_OR_LOC (t
,
16559 "declarations in dependent base %qT are "
16560 "not found by unqualified lookup",
16561 DECL_CLASS_CONTEXT (fn
));
16562 if (current_class_ptr
)
16564 "use %<this->%D%> instead", function
);
16567 "use %<%T::%D%> instead",
16568 current_class_name
, function
);
16571 inform (DECL_SOURCE_LOCATION (fn
),
16572 "%qD declared here, later in the "
16573 "translation unit", fn
);
16578 if (identifier_p (function
))
16580 if (complain
& tf_error
)
16581 unqualified_name_lookup_error (function
);
16582 release_tree_vector (call_args
);
16583 RETURN (error_mark_node
);
16587 /* Remember that there was a reference to this entity. */
16588 if (DECL_P (function
)
16589 && !mark_used (function
, complain
) && !(complain
& tf_error
))
16590 RETURN (error_mark_node
);
16592 /* Put back tf_decltype for the actual call. */
16593 complain
|= decltype_flag
;
16595 if (TREE_CODE (function
) == OFFSET_REF
)
16596 ret
= build_offset_ref_call_from_tree (function
, &call_args
,
16598 else if (TREE_CODE (function
) == COMPONENT_REF
)
16600 tree instance
= TREE_OPERAND (function
, 0);
16601 tree fn
= TREE_OPERAND (function
, 1);
16603 if (processing_template_decl
16604 && (type_dependent_expression_p (instance
)
16605 || (!BASELINK_P (fn
)
16606 && TREE_CODE (fn
) != FIELD_DECL
)
16607 || type_dependent_expression_p (fn
)
16608 || any_type_dependent_arguments_p (call_args
)))
16609 ret
= build_nt_call_vec (function
, call_args
);
16610 else if (!BASELINK_P (fn
))
16611 ret
= finish_call_expr (function
, &call_args
,
16612 /*disallow_virtual=*/false,
16613 /*koenig_p=*/false,
16616 ret
= (build_new_method_call
16618 &call_args
, NULL_TREE
,
16619 qualified_p
? LOOKUP_NONVIRTUAL
: LOOKUP_NORMAL
,
16624 ret
= finish_call_expr (function
, &call_args
,
16625 /*disallow_virtual=*/qualified_p
,
16629 release_tree_vector (call_args
);
16636 tree cond
= RECUR (TREE_OPERAND (t
, 0));
16637 tree folded_cond
= fold_non_dependent_expr (cond
);
16640 if (TREE_CODE (folded_cond
) == INTEGER_CST
)
16642 if (integer_zerop (folded_cond
))
16644 ++c_inhibit_evaluation_warnings
;
16645 exp1
= RECUR (TREE_OPERAND (t
, 1));
16646 --c_inhibit_evaluation_warnings
;
16647 exp2
= RECUR (TREE_OPERAND (t
, 2));
16651 exp1
= RECUR (TREE_OPERAND (t
, 1));
16652 ++c_inhibit_evaluation_warnings
;
16653 exp2
= RECUR (TREE_OPERAND (t
, 2));
16654 --c_inhibit_evaluation_warnings
;
16656 cond
= folded_cond
;
16660 exp1
= RECUR (TREE_OPERAND (t
, 1));
16661 exp2
= RECUR (TREE_OPERAND (t
, 2));
16664 RETURN (build_x_conditional_expr (EXPR_LOCATION (t
),
16665 cond
, exp1
, exp2
, complain
));
16668 case PSEUDO_DTOR_EXPR
:
16670 tree op0
= RECUR (TREE_OPERAND (t
, 0));
16671 tree op1
= RECUR (TREE_OPERAND (t
, 1));
16672 tree op2
= tsubst (TREE_OPERAND (t
, 2), args
, complain
, in_decl
);
16673 RETURN (finish_pseudo_destructor_expr (op0
, op1
, op2
,
16679 tree purpose
, value
, chain
;
16681 if (t
== void_list_node
)
16684 if ((TREE_PURPOSE (t
) && PACK_EXPANSION_P (TREE_PURPOSE (t
)))
16685 || (TREE_VALUE (t
) && PACK_EXPANSION_P (TREE_VALUE (t
))))
16687 /* We have pack expansions, so expand those and
16688 create a new list out of it. */
16689 tree purposevec
= NULL_TREE
;
16690 tree valuevec
= NULL_TREE
;
16694 /* Expand the argument expressions. */
16695 if (TREE_PURPOSE (t
))
16696 purposevec
= tsubst_pack_expansion (TREE_PURPOSE (t
), args
,
16697 complain
, in_decl
);
16698 if (TREE_VALUE (t
))
16699 valuevec
= tsubst_pack_expansion (TREE_VALUE (t
), args
,
16700 complain
, in_decl
);
16702 /* Build the rest of the list. */
16703 chain
= TREE_CHAIN (t
);
16704 if (chain
&& chain
!= void_type_node
)
16705 chain
= RECUR (chain
);
16707 /* Determine the number of arguments. */
16708 if (purposevec
&& TREE_CODE (purposevec
) == TREE_VEC
)
16710 len
= TREE_VEC_LENGTH (purposevec
);
16711 gcc_assert (!valuevec
|| len
== TREE_VEC_LENGTH (valuevec
));
16713 else if (TREE_CODE (valuevec
) == TREE_VEC
)
16714 len
= TREE_VEC_LENGTH (valuevec
);
16717 /* Since we only performed a partial substitution into
16718 the argument pack, we only RETURN (a single list
16720 if (purposevec
== TREE_PURPOSE (t
)
16721 && valuevec
== TREE_VALUE (t
)
16722 && chain
== TREE_CHAIN (t
))
16725 RETURN (tree_cons (purposevec
, valuevec
, chain
));
16728 /* Convert the argument vectors into a TREE_LIST */
16732 /* Grab the Ith values. */
16734 purpose
= purposevec
? TREE_VEC_ELT (purposevec
, i
)
16737 = valuevec
? convert_from_reference (TREE_VEC_ELT (valuevec
, i
))
16740 /* Build the list (backwards). */
16741 chain
= tree_cons (purpose
, value
, chain
);
16747 purpose
= TREE_PURPOSE (t
);
16749 purpose
= RECUR (purpose
);
16750 value
= TREE_VALUE (t
);
16752 value
= RECUR (value
);
16753 chain
= TREE_CHAIN (t
);
16754 if (chain
&& chain
!= void_type_node
)
16755 chain
= RECUR (chain
);
16756 if (purpose
== TREE_PURPOSE (t
)
16757 && value
== TREE_VALUE (t
)
16758 && chain
== TREE_CHAIN (t
))
16760 RETURN (tree_cons (purpose
, value
, chain
));
16763 case COMPONENT_REF
:
16770 object
= tsubst_non_call_postfix_expression (TREE_OPERAND (t
, 0),
16771 args
, complain
, in_decl
);
16772 /* Remember that there was a reference to this entity. */
16773 if (DECL_P (object
)
16774 && !mark_used (object
, complain
) && !(complain
& tf_error
))
16775 RETURN (error_mark_node
);
16776 object_type
= TREE_TYPE (object
);
16778 member
= TREE_OPERAND (t
, 1);
16779 if (BASELINK_P (member
))
16780 member
= tsubst_baselink (member
,
16781 non_reference (TREE_TYPE (object
)),
16782 args
, complain
, in_decl
);
16784 member
= tsubst_copy (member
, args
, complain
, in_decl
);
16785 if (member
== error_mark_node
)
16786 RETURN (error_mark_node
);
16788 if (type_dependent_expression_p (object
))
16789 /* We can't do much here. */;
16790 else if (!CLASS_TYPE_P (object_type
))
16792 if (scalarish_type_p (object_type
))
16794 tree s
= NULL_TREE
;
16795 tree dtor
= member
;
16797 if (TREE_CODE (dtor
) == SCOPE_REF
)
16799 s
= TREE_OPERAND (dtor
, 0);
16800 dtor
= TREE_OPERAND (dtor
, 1);
16802 if (TREE_CODE (dtor
) == BIT_NOT_EXPR
)
16804 dtor
= TREE_OPERAND (dtor
, 0);
16806 RETURN (finish_pseudo_destructor_expr
16807 (object
, s
, dtor
, input_location
));
16811 else if (TREE_CODE (member
) == SCOPE_REF
16812 && TREE_CODE (TREE_OPERAND (member
, 1)) == TEMPLATE_ID_EXPR
)
16814 /* Lookup the template functions now that we know what the
16816 tree scope
= TREE_OPERAND (member
, 0);
16817 tree tmpl
= TREE_OPERAND (TREE_OPERAND (member
, 1), 0);
16818 tree args
= TREE_OPERAND (TREE_OPERAND (member
, 1), 1);
16819 member
= lookup_qualified_name (scope
, tmpl
,
16820 /*is_type_p=*/false,
16821 /*complain=*/false);
16822 if (BASELINK_P (member
))
16824 BASELINK_FUNCTIONS (member
)
16825 = build_nt (TEMPLATE_ID_EXPR
, BASELINK_FUNCTIONS (member
),
16827 member
= (adjust_result_of_qualified_name_lookup
16828 (member
, BINFO_TYPE (BASELINK_BINFO (member
)),
16833 qualified_name_lookup_error (scope
, tmpl
, member
,
16835 RETURN (error_mark_node
);
16838 else if (TREE_CODE (member
) == SCOPE_REF
16839 && !CLASS_TYPE_P (TREE_OPERAND (member
, 0))
16840 && TREE_CODE (TREE_OPERAND (member
, 0)) != NAMESPACE_DECL
)
16842 if (complain
& tf_error
)
16844 if (TYPE_P (TREE_OPERAND (member
, 0)))
16845 error ("%qT is not a class or namespace",
16846 TREE_OPERAND (member
, 0));
16848 error ("%qD is not a class or namespace",
16849 TREE_OPERAND (member
, 0));
16851 RETURN (error_mark_node
);
16853 else if (TREE_CODE (member
) == FIELD_DECL
)
16855 r
= finish_non_static_data_member (member
, object
, NULL_TREE
);
16856 if (TREE_CODE (r
) == COMPONENT_REF
)
16857 REF_PARENTHESIZED_P (r
) = REF_PARENTHESIZED_P (t
);
16861 r
= finish_class_member_access_expr (object
, member
,
16862 /*template_p=*/false,
16864 if (TREE_CODE (r
) == COMPONENT_REF
)
16865 REF_PARENTHESIZED_P (r
) = REF_PARENTHESIZED_P (t
);
16870 RETURN (build_throw
16871 (RECUR (TREE_OPERAND (t
, 0))));
16875 vec
<constructor_elt
, va_gc
> *n
;
16876 constructor_elt
*ce
;
16877 unsigned HOST_WIDE_INT idx
;
16878 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
16879 bool process_index_p
;
16881 bool need_copy_p
= false;
16884 if (type
== error_mark_node
)
16885 RETURN (error_mark_node
);
16887 /* digest_init will do the wrong thing if we let it. */
16888 if (type
&& TYPE_PTRMEMFUNC_P (type
))
16891 /* We do not want to process the index of aggregate
16892 initializers as they are identifier nodes which will be
16893 looked up by digest_init. */
16894 process_index_p
= !(type
&& MAYBE_CLASS_TYPE_P (type
));
16896 n
= vec_safe_copy (CONSTRUCTOR_ELTS (t
));
16897 newlen
= vec_safe_length (n
);
16898 FOR_EACH_VEC_SAFE_ELT (n
, idx
, ce
)
16900 if (ce
->index
&& process_index_p
16901 /* An identifier index is looked up in the type
16902 being initialized, not the current scope. */
16903 && TREE_CODE (ce
->index
) != IDENTIFIER_NODE
)
16904 ce
->index
= RECUR (ce
->index
);
16906 if (PACK_EXPANSION_P (ce
->value
))
16908 /* Substitute into the pack expansion. */
16909 ce
->value
= tsubst_pack_expansion (ce
->value
, args
, complain
,
16912 if (ce
->value
== error_mark_node
16913 || PACK_EXPANSION_P (ce
->value
))
16915 else if (TREE_VEC_LENGTH (ce
->value
) == 1)
16916 /* Just move the argument into place. */
16917 ce
->value
= TREE_VEC_ELT (ce
->value
, 0);
16920 /* Update the length of the final CONSTRUCTOR
16921 arguments vector, and note that we will need to
16923 newlen
= newlen
+ TREE_VEC_LENGTH (ce
->value
) - 1;
16924 need_copy_p
= true;
16928 ce
->value
= RECUR (ce
->value
);
16933 vec
<constructor_elt
, va_gc
> *old_n
= n
;
16935 vec_alloc (n
, newlen
);
16936 FOR_EACH_VEC_ELT (*old_n
, idx
, ce
)
16938 if (TREE_CODE (ce
->value
) == TREE_VEC
)
16940 int i
, len
= TREE_VEC_LENGTH (ce
->value
);
16941 for (i
= 0; i
< len
; ++i
)
16942 CONSTRUCTOR_APPEND_ELT (n
, 0,
16943 TREE_VEC_ELT (ce
->value
, i
));
16946 CONSTRUCTOR_APPEND_ELT (n
, 0, ce
->value
);
16950 r
= build_constructor (init_list_type_node
, n
);
16951 CONSTRUCTOR_IS_DIRECT_INIT (r
) = CONSTRUCTOR_IS_DIRECT_INIT (t
);
16953 if (TREE_HAS_CONSTRUCTOR (t
))
16954 RETURN (finish_compound_literal (type
, r
, complain
));
16956 TREE_TYPE (r
) = type
;
16962 tree operand_0
= TREE_OPERAND (t
, 0);
16963 if (TYPE_P (operand_0
))
16965 operand_0
= tsubst (operand_0
, args
, complain
, in_decl
);
16966 RETURN (get_typeid (operand_0
, complain
));
16970 operand_0
= RECUR (operand_0
);
16971 RETURN (build_typeid (operand_0
, complain
));
16978 else if (DECL_PACK_P (t
))
16980 /* We don't build decls for an instantiation of a
16981 variadic capture proxy, we instantiate the elements
16983 gcc_assert (DECL_HAS_VALUE_EXPR_P (t
));
16984 return RECUR (DECL_VALUE_EXPR (t
));
16990 tree r
= tsubst_copy (t
, args
, complain
, in_decl
);
16991 /* ??? We're doing a subset of finish_id_expression here. */
16993 && !processing_template_decl
16994 && !cp_unevaluated_operand
16995 && (TREE_STATIC (r
) || DECL_EXTERNAL (r
))
16996 && CP_DECL_THREAD_LOCAL_P (r
))
16998 if (tree wrap
= get_tls_wrapper_fn (r
))
16999 /* Replace an evaluated use of the thread_local variable with
17000 a call to its wrapper. */
17001 r
= build_cxx_call (wrap
, 0, NULL
, tf_warning_or_error
);
17003 else if (outer_automatic_var_p (r
))
17005 r
= process_outer_var_ref (r
, complain
);
17006 if (is_capture_proxy (r
))
17007 register_local_specialization (r
, t
);
17010 if (TREE_CODE (TREE_TYPE (t
)) != REFERENCE_TYPE
)
17011 /* If the original type was a reference, we'll be wrapped in
17012 the appropriate INDIRECT_REF. */
17013 r
= convert_from_reference (r
);
17019 tree op0
= RECUR (TREE_OPERAND (t
, 0));
17020 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
17021 RETURN (build_x_va_arg (EXPR_LOCATION (t
), op0
, type
));
17024 case OFFSETOF_EXPR
:
17025 RETURN (finish_offsetof (RECUR (TREE_OPERAND (t
, 0)),
17026 EXPR_LOCATION (t
)));
17030 tree type1
= tsubst (TRAIT_EXPR_TYPE1 (t
), args
,
17031 complain
, in_decl
);
17033 tree type2
= TRAIT_EXPR_TYPE2 (t
);
17034 if (type2
&& TREE_CODE (type2
) == TREE_LIST
)
17035 type2
= RECUR (type2
);
17037 type2
= tsubst (type2
, args
, complain
, in_decl
);
17039 RETURN (finish_trait_expr (TRAIT_EXPR_KIND (t
), type1
, type2
));
17044 tree old_stmt_expr
= cur_stmt_expr
;
17045 tree stmt_expr
= begin_stmt_expr ();
17047 cur_stmt_expr
= stmt_expr
;
17048 tsubst_expr (STMT_EXPR_STMT (t
), args
, complain
, in_decl
,
17049 integral_constant_expression_p
);
17050 stmt_expr
= finish_stmt_expr (stmt_expr
, false);
17051 cur_stmt_expr
= old_stmt_expr
;
17053 /* If the resulting list of expression statement is empty,
17054 fold it further into void_node. */
17055 if (empty_expr_stmt_p (stmt_expr
))
17056 stmt_expr
= void_node
;
17058 RETURN (stmt_expr
);
17063 tree r
= build_lambda_expr ();
17065 tree type
= tsubst (LAMBDA_EXPR_CLOSURE (t
), args
, complain
, NULL_TREE
);
17066 LAMBDA_EXPR_CLOSURE (r
) = type
;
17067 CLASSTYPE_LAMBDA_EXPR (type
) = r
;
17069 LAMBDA_EXPR_LOCATION (r
)
17070 = LAMBDA_EXPR_LOCATION (t
);
17071 LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (r
)
17072 = LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (t
);
17073 LAMBDA_EXPR_MUTABLE_P (r
) = LAMBDA_EXPR_MUTABLE_P (t
);
17074 LAMBDA_EXPR_DISCRIMINATOR (r
)
17075 = (LAMBDA_EXPR_DISCRIMINATOR (t
));
17076 tree scope
= LAMBDA_EXPR_EXTRA_SCOPE (t
);
17078 /* No substitution needed. */;
17079 else if (VAR_OR_FUNCTION_DECL_P (scope
))
17080 /* For a function or variable scope, we want to use tsubst so that we
17081 don't complain about referring to an auto before deduction. */
17082 scope
= tsubst (scope
, args
, complain
, in_decl
);
17083 else if (TREE_CODE (scope
) == PARM_DECL
)
17085 /* Look up the parameter we want directly, as tsubst_copy
17086 doesn't do what we need. */
17087 tree fn
= tsubst (DECL_CONTEXT (scope
), args
, complain
, in_decl
);
17088 tree parm
= FUNCTION_FIRST_USER_PARM (fn
);
17089 while (DECL_PARM_INDEX (parm
) != DECL_PARM_INDEX (scope
))
17090 parm
= DECL_CHAIN (parm
);
17092 /* FIXME Work around the parm not having DECL_CONTEXT set. */
17093 if (DECL_CONTEXT (scope
) == NULL_TREE
)
17094 DECL_CONTEXT (scope
) = fn
;
17096 else if (TREE_CODE (scope
) == FIELD_DECL
)
17097 /* For a field, use tsubst_copy so that we look up the existing field
17098 rather than build a new one. */
17099 scope
= RECUR (scope
);
17101 gcc_unreachable ();
17102 LAMBDA_EXPR_EXTRA_SCOPE (r
) = scope
;
17104 gcc_assert (LAMBDA_EXPR_THIS_CAPTURE (t
) == NULL_TREE
17105 && LAMBDA_EXPR_PENDING_PROXIES (t
) == NULL
);
17107 /* Do this again now that LAMBDA_EXPR_EXTRA_SCOPE is set. */
17108 determine_visibility (TYPE_NAME (type
));
17109 /* Now that we know visibility, instantiate the type so we have a
17110 declaration of the op() for later calls to lambda_function. */
17111 complete_type (type
);
17113 if (tree fn
= lambda_function (type
))
17114 LAMBDA_EXPR_RETURN_TYPE (r
) = TREE_TYPE (TREE_TYPE (fn
));
17116 LAMBDA_EXPR_THIS_CAPTURE (r
) = NULL_TREE
;
17118 insert_pending_capture_proxies ();
17120 RETURN (build_lambda_object (r
));
17124 /* We can get here for a constant initializer of non-dependent type.
17125 FIXME stop folding in cp_parser_initializer_clause. */
17127 tree r
= get_target_expr_sfinae (RECUR (TARGET_EXPR_INITIAL (t
)),
17132 case TRANSACTION_EXPR
:
17133 RETURN (tsubst_expr(t
, args
, complain
, in_decl
,
17134 integral_constant_expression_p
));
17137 RETURN (finish_parenthesized_expr (RECUR (TREE_OPERAND (t
, 0))));
17139 case VEC_PERM_EXPR
:
17141 tree op0
= RECUR (TREE_OPERAND (t
, 0));
17142 tree op1
= RECUR (TREE_OPERAND (t
, 1));
17143 tree op2
= RECUR (TREE_OPERAND (t
, 2));
17144 RETURN (build_x_vec_perm_expr (input_location
, op0
, op1
, op2
,
17148 case REQUIRES_EXPR
:
17149 RETURN (tsubst_requires_expr (t
, args
, complain
, in_decl
));
17152 /* Handle Objective-C++ constructs, if appropriate. */
17155 = objcp_tsubst_copy_and_build (t
, args
, complain
,
17156 in_decl
, /*function_p=*/false);
17160 RETURN (tsubst_copy (t
, args
, complain
, in_decl
));
17166 input_location
= loc
;
17170 /* Verify that the instantiated ARGS are valid. For type arguments,
17171 make sure that the type's linkage is ok. For non-type arguments,
17172 make sure they are constants if they are integral or enumerations.
17173 Emit an error under control of COMPLAIN, and return TRUE on error. */
17176 check_instantiated_arg (tree tmpl
, tree t
, tsubst_flags_t complain
)
17178 if (dependent_template_arg_p (t
))
17180 if (ARGUMENT_PACK_P (t
))
17182 tree vec
= ARGUMENT_PACK_ARGS (t
);
17183 int len
= TREE_VEC_LENGTH (vec
);
17184 bool result
= false;
17187 for (i
= 0; i
< len
; ++i
)
17188 if (check_instantiated_arg (tmpl
, TREE_VEC_ELT (vec
, i
), complain
))
17192 else if (TYPE_P (t
))
17194 /* [basic.link]: A name with no linkage (notably, the name
17195 of a class or enumeration declared in a local scope)
17196 shall not be used to declare an entity with linkage.
17197 This implies that names with no linkage cannot be used as
17200 DR 757 relaxes this restriction for C++0x. */
17201 tree nt
= (cxx_dialect
> cxx98
? NULL_TREE
17202 : no_linkage_check (t
, /*relaxed_p=*/false));
17206 /* DR 488 makes use of a type with no linkage cause
17207 type deduction to fail. */
17208 if (complain
& tf_error
)
17210 if (TYPE_ANONYMOUS_P (nt
))
17211 error ("%qT is/uses anonymous type", t
);
17213 error ("template argument for %qD uses local type %qT",
17218 /* In order to avoid all sorts of complications, we do not
17219 allow variably-modified types as template arguments. */
17220 else if (variably_modified_type_p (t
, NULL_TREE
))
17222 if (complain
& tf_error
)
17223 error ("%qT is a variably modified type", t
);
17227 /* Class template and alias template arguments should be OK. */
17228 else if (DECL_TYPE_TEMPLATE_P (t
))
17230 /* A non-type argument of integral or enumerated type must be a
17232 else if (TREE_TYPE (t
)
17233 && INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (t
))
17234 && !REFERENCE_REF_P (t
)
17235 && !TREE_CONSTANT (t
))
17237 if (complain
& tf_error
)
17238 error ("integral expression %qE is not constant", t
);
17245 check_instantiated_args (tree tmpl
, tree args
, tsubst_flags_t complain
)
17247 int ix
, len
= DECL_NTPARMS (tmpl
);
17248 bool result
= false;
17250 for (ix
= 0; ix
!= len
; ix
++)
17252 if (check_instantiated_arg (tmpl
, TREE_VEC_ELT (args
, ix
), complain
))
17255 if (result
&& (complain
& tf_error
))
17256 error (" trying to instantiate %qD", tmpl
);
17260 /* We're out of SFINAE context now, so generate diagnostics for the access
17261 errors we saw earlier when instantiating D from TMPL and ARGS. */
17264 recheck_decl_substitution (tree d
, tree tmpl
, tree args
)
17266 tree pattern
= DECL_TEMPLATE_RESULT (tmpl
);
17267 tree type
= TREE_TYPE (pattern
);
17268 location_t loc
= input_location
;
17270 push_access_scope (d
);
17271 push_deferring_access_checks (dk_no_deferred
);
17272 input_location
= DECL_SOURCE_LOCATION (pattern
);
17273 tsubst (type
, args
, tf_warning_or_error
, d
);
17274 input_location
= loc
;
17275 pop_deferring_access_checks ();
17276 pop_access_scope (d
);
17279 /* Instantiate the indicated variable, function, or alias template TMPL with
17280 the template arguments in TARG_PTR. */
17283 instantiate_template_1 (tree tmpl
, tree orig_args
, tsubst_flags_t complain
)
17285 tree targ_ptr
= orig_args
;
17289 bool access_ok
= true;
17291 if (tmpl
== error_mark_node
)
17292 return error_mark_node
;
17294 gcc_assert (TREE_CODE (tmpl
) == TEMPLATE_DECL
);
17296 /* If this function is a clone, handle it specially. */
17297 if (DECL_CLONED_FUNCTION_P (tmpl
))
17302 /* Use DECL_ABSTRACT_ORIGIN because only FUNCTION_DECLs have
17303 DECL_CLONED_FUNCTION. */
17304 spec
= instantiate_template (DECL_ABSTRACT_ORIGIN (tmpl
),
17305 targ_ptr
, complain
);
17306 if (spec
== error_mark_node
)
17307 return error_mark_node
;
17309 /* Look for the clone. */
17310 FOR_EACH_CLONE (clone
, spec
)
17311 if (DECL_NAME (clone
) == DECL_NAME (tmpl
))
17313 /* We should always have found the clone by now. */
17314 gcc_unreachable ();
17318 if (targ_ptr
== error_mark_node
)
17319 return error_mark_node
;
17321 /* Check to see if we already have this specialization. */
17322 gen_tmpl
= most_general_template (tmpl
);
17323 if (tmpl
!= gen_tmpl
)
17324 /* The TMPL is a partial instantiation. To get a full set of
17325 arguments we must add the arguments used to perform the
17326 partial instantiation. */
17327 targ_ptr
= add_outermost_template_args (DECL_TI_ARGS (tmpl
),
17330 /* It would be nice to avoid hashing here and then again in tsubst_decl,
17331 but it doesn't seem to be on the hot path. */
17332 spec
= retrieve_specialization (gen_tmpl
, targ_ptr
, 0);
17334 gcc_assert (tmpl
== gen_tmpl
17335 || ((fndecl
= retrieve_specialization (tmpl
, orig_args
, 0))
17337 || fndecl
== NULL_TREE
);
17339 if (spec
!= NULL_TREE
)
17341 if (FNDECL_HAS_ACCESS_ERRORS (spec
))
17343 if (complain
& tf_error
)
17344 recheck_decl_substitution (spec
, gen_tmpl
, targ_ptr
);
17345 return error_mark_node
;
17350 if (check_instantiated_args (gen_tmpl
, INNERMOST_TEMPLATE_ARGS (targ_ptr
),
17352 return error_mark_node
;
17354 /* We are building a FUNCTION_DECL, during which the access of its
17355 parameters and return types have to be checked. However this
17356 FUNCTION_DECL which is the desired context for access checking
17357 is not built yet. We solve this chicken-and-egg problem by
17358 deferring all checks until we have the FUNCTION_DECL. */
17359 push_deferring_access_checks (dk_deferred
);
17361 /* Instantiation of the function happens in the context of the function
17362 template, not the context of the overload resolution we're doing. */
17363 push_to_top_level ();
17364 /* If there are dependent arguments, e.g. because we're doing partial
17365 ordering, make sure processing_template_decl stays set. */
17366 if (uses_template_parms (targ_ptr
))
17367 ++processing_template_decl
;
17368 if (DECL_CLASS_SCOPE_P (gen_tmpl
))
17370 tree ctx
= tsubst_aggr_type (DECL_CONTEXT (gen_tmpl
), targ_ptr
,
17371 complain
, gen_tmpl
, true);
17372 push_nested_class (ctx
);
17375 tree pattern
= DECL_TEMPLATE_RESULT (gen_tmpl
);
17377 if (VAR_P (pattern
))
17379 /* We need to determine if we're using a partial or explicit
17380 specialization now, because the type of the variable could be
17382 tree tid
= lookup_template_variable (gen_tmpl
, targ_ptr
);
17383 tree elt
= most_specialized_partial_spec (tid
, complain
);
17384 if (elt
== error_mark_node
)
17385 pattern
= error_mark_node
;
17388 tmpl
= TREE_VALUE (elt
);
17389 pattern
= DECL_TEMPLATE_RESULT (tmpl
);
17390 targ_ptr
= TREE_PURPOSE (elt
);
17394 /* Substitute template parameters to obtain the specialization. */
17395 fndecl
= tsubst (pattern
, targ_ptr
, complain
, gen_tmpl
);
17396 if (DECL_CLASS_SCOPE_P (gen_tmpl
))
17397 pop_nested_class ();
17398 pop_from_top_level ();
17400 if (fndecl
== error_mark_node
)
17402 pop_deferring_access_checks ();
17403 return error_mark_node
;
17406 /* The DECL_TI_TEMPLATE should always be the immediate parent
17407 template, not the most general template. */
17408 DECL_TI_TEMPLATE (fndecl
) = tmpl
;
17409 DECL_TI_ARGS (fndecl
) = targ_ptr
;
17411 /* Now we know the specialization, compute access previously
17413 push_access_scope (fndecl
);
17414 if (!perform_deferred_access_checks (complain
))
17416 pop_access_scope (fndecl
);
17417 pop_deferring_access_checks ();
17419 /* If we've just instantiated the main entry point for a function,
17420 instantiate all the alternate entry points as well. We do this
17421 by cloning the instantiation of the main entry point, not by
17422 instantiating the template clones. */
17423 if (DECL_CHAIN (gen_tmpl
) && DECL_CLONED_FUNCTION_P (DECL_CHAIN (gen_tmpl
)))
17424 clone_function_decl (fndecl
, /*update_method_vec_p=*/0);
17428 if (!(complain
& tf_error
))
17430 /* Remember to reinstantiate when we're out of SFINAE so the user
17431 can see the errors. */
17432 FNDECL_HAS_ACCESS_ERRORS (fndecl
) = true;
17434 return error_mark_node
;
17439 /* Wrapper for instantiate_template_1. */
17442 instantiate_template (tree tmpl
, tree orig_args
, tsubst_flags_t complain
)
17445 timevar_push (TV_TEMPLATE_INST
);
17446 ret
= instantiate_template_1 (tmpl
, orig_args
, complain
);
17447 timevar_pop (TV_TEMPLATE_INST
);
17451 /* Instantiate the alias template TMPL with ARGS. Also push a template
17452 instantiation level, which instantiate_template doesn't do because
17453 functions and variables have sufficient context established by the
17457 instantiate_alias_template (tree tmpl
, tree args
, tsubst_flags_t complain
)
17459 struct pending_template
*old_last_pend
= last_pending_template
;
17460 struct tinst_level
*old_error_tinst
= last_error_tinst_level
;
17461 if (tmpl
== error_mark_node
|| args
== error_mark_node
)
17462 return error_mark_node
;
17463 tree tinst
= build_tree_list (tmpl
, args
);
17464 if (!push_tinst_level (tinst
))
17467 return error_mark_node
;
17471 coerce_innermost_template_parms (DECL_TEMPLATE_PARMS (tmpl
),
17472 args
, tmpl
, complain
,
17473 /*require_all_args=*/true,
17474 /*use_default_args=*/true);
17476 tree r
= instantiate_template (tmpl
, args
, complain
);
17477 pop_tinst_level ();
17478 /* We can't free this if a pending_template entry or last_error_tinst_level
17479 is pointing at it. */
17480 if (last_pending_template
== old_last_pend
17481 && last_error_tinst_level
== old_error_tinst
)
17487 /* PARM is a template parameter pack for FN. Returns true iff
17488 PARM is used in a deducible way in the argument list of FN. */
17491 pack_deducible_p (tree parm
, tree fn
)
17493 tree t
= FUNCTION_FIRST_USER_PARMTYPE (fn
);
17494 for (; t
; t
= TREE_CHAIN (t
))
17496 tree type
= TREE_VALUE (t
);
17498 if (!PACK_EXPANSION_P (type
))
17500 for (packs
= PACK_EXPANSION_PARAMETER_PACKS (type
);
17501 packs
; packs
= TREE_CHAIN (packs
))
17502 if (template_args_equal (TREE_VALUE (packs
), parm
))
17504 /* The template parameter pack is used in a function parameter
17505 pack. If this is the end of the parameter list, the
17506 template parameter pack is deducible. */
17507 if (TREE_CHAIN (t
) == void_list_node
)
17510 /* Otherwise, not. Well, it could be deduced from
17511 a non-pack parameter, but doing so would end up with
17512 a deduction mismatch, so don't bother. */
17516 /* The template parameter pack isn't used in any function parameter
17517 packs, but it might be used deeper, e.g. tuple<Args...>. */
17521 /* The FN is a TEMPLATE_DECL for a function. ARGS is an array with
17522 NARGS elements of the arguments that are being used when calling
17523 it. TARGS is a vector into which the deduced template arguments
17526 Returns either a FUNCTION_DECL for the matching specialization of FN or
17527 NULL_TREE if no suitable specialization can be found. If EXPLAIN_P is
17528 true, diagnostics will be printed to explain why it failed.
17530 If FN is a conversion operator, or we are trying to produce a specific
17531 specialization, RETURN_TYPE is the return type desired.
17533 The EXPLICIT_TARGS are explicit template arguments provided via a
17536 The parameter STRICT is one of:
17539 We are deducing arguments for a function call, as in
17540 [temp.deduct.call]. If RETURN_TYPE is non-null, we are
17541 deducing arguments for a call to the result of a conversion
17542 function template, as in [over.call.object].
17545 We are deducing arguments for a conversion function, as in
17546 [temp.deduct.conv].
17549 We are deducing arguments when doing an explicit instantiation
17550 as in [temp.explicit], when determining an explicit specialization
17551 as in [temp.expl.spec], or when taking the address of a function
17552 template, as in [temp.deduct.funcaddr]. */
17555 fn_type_unification (tree fn
,
17556 tree explicit_targs
,
17559 unsigned int nargs
,
17561 unification_kind_t strict
,
17568 tree decl
= NULL_TREE
;
17569 tsubst_flags_t complain
= (explain_p
? tf_warning_or_error
: tf_none
);
17571 static int deduction_depth
;
17572 struct pending_template
*old_last_pend
= last_pending_template
;
17573 struct tinst_level
*old_error_tinst
= last_error_tinst_level
;
17574 tree tparms
= DECL_INNERMOST_TEMPLATE_PARMS (fn
);
17576 tree r
= error_mark_node
;
17579 complain
|= tf_decltype
;
17581 /* In C++0x, it's possible to have a function template whose type depends
17582 on itself recursively. This is most obvious with decltype, but can also
17583 occur with enumeration scope (c++/48969). So we need to catch infinite
17584 recursion and reject the substitution at deduction time; this function
17585 will return error_mark_node for any repeated substitution.
17587 This also catches excessive recursion such as when f<N> depends on
17588 f<N-1> across all integers, and returns error_mark_node for all the
17589 substitutions back up to the initial one.
17591 This is, of course, not reentrant. */
17592 if (excessive_deduction_depth
)
17593 return error_mark_node
;
17594 tinst
= build_tree_list (fn
, NULL_TREE
);
17597 gcc_assert (TREE_CODE (fn
) == TEMPLATE_DECL
);
17599 fntype
= TREE_TYPE (fn
);
17600 if (explicit_targs
)
17604 The specified template arguments must match the template
17605 parameters in kind (i.e., type, nontype, template), and there
17606 must not be more arguments than there are parameters;
17607 otherwise type deduction fails.
17609 Nontype arguments must match the types of the corresponding
17610 nontype template parameters, or must be convertible to the
17611 types of the corresponding nontype parameters as specified in
17612 _temp.arg.nontype_, otherwise type deduction fails.
17614 All references in the function type of the function template
17615 to the corresponding template parameters are replaced by the
17616 specified template argument values. If a substitution in a
17617 template parameter or in the function type of the function
17618 template results in an invalid type, type deduction fails. */
17619 int i
, len
= TREE_VEC_LENGTH (tparms
);
17620 location_t loc
= input_location
;
17621 bool incomplete
= false;
17623 /* Adjust any explicit template arguments before entering the
17624 substitution context. */
17626 = (coerce_template_parms (tparms
, explicit_targs
, NULL_TREE
,
17628 /*require_all_args=*/false,
17629 /*use_default_args=*/false));
17630 if (explicit_targs
== error_mark_node
)
17633 /* Substitute the explicit args into the function type. This is
17634 necessary so that, for instance, explicitly declared function
17635 arguments can match null pointed constants. If we were given
17636 an incomplete set of explicit args, we must not do semantic
17637 processing during substitution as we could create partial
17639 for (i
= 0; i
< len
; i
++)
17641 tree parm
= TREE_VALUE (TREE_VEC_ELT (tparms
, i
));
17642 bool parameter_pack
= false;
17643 tree targ
= TREE_VEC_ELT (explicit_targs
, i
);
17645 /* Dig out the actual parm. */
17646 if (TREE_CODE (parm
) == TYPE_DECL
17647 || TREE_CODE (parm
) == TEMPLATE_DECL
)
17649 parm
= TREE_TYPE (parm
);
17650 parameter_pack
= TEMPLATE_TYPE_PARAMETER_PACK (parm
);
17652 else if (TREE_CODE (parm
) == PARM_DECL
)
17654 parm
= DECL_INITIAL (parm
);
17655 parameter_pack
= TEMPLATE_PARM_PARAMETER_PACK (parm
);
17658 if (!parameter_pack
&& targ
== NULL_TREE
)
17659 /* No explicit argument for this template parameter. */
17662 if (parameter_pack
&& pack_deducible_p (parm
, fn
))
17664 /* Mark the argument pack as "incomplete". We could
17665 still deduce more arguments during unification.
17666 We remove this mark in type_unification_real. */
17669 ARGUMENT_PACK_INCOMPLETE_P(targ
) = 1;
17670 ARGUMENT_PACK_EXPLICIT_ARGS (targ
)
17671 = ARGUMENT_PACK_ARGS (targ
);
17674 /* We have some incomplete argument packs. */
17679 TREE_VALUE (tinst
) = explicit_targs
;
17680 if (!push_tinst_level (tinst
))
17682 excessive_deduction_depth
= true;
17685 processing_template_decl
+= incomplete
;
17686 input_location
= DECL_SOURCE_LOCATION (fn
);
17687 /* Ignore any access checks; we'll see them again in
17688 instantiate_template and they might have the wrong
17689 access path at this point. */
17690 push_deferring_access_checks (dk_deferred
);
17691 fntype
= tsubst (TREE_TYPE (fn
), explicit_targs
,
17692 complain
| tf_partial
, NULL_TREE
);
17693 pop_deferring_access_checks ();
17694 input_location
= loc
;
17695 processing_template_decl
-= incomplete
;
17696 pop_tinst_level ();
17698 if (fntype
== error_mark_node
)
17701 /* Place the explicitly specified arguments in TARGS. */
17702 for (i
= NUM_TMPL_ARGS (explicit_targs
); i
--;)
17703 TREE_VEC_ELT (targs
, i
) = TREE_VEC_ELT (explicit_targs
, i
);
17706 /* Never do unification on the 'this' parameter. */
17707 parms
= skip_artificial_parms_for (fn
, TYPE_ARG_TYPES (fntype
));
17709 if (return_type
&& strict
== DEDUCE_CALL
)
17711 /* We're deducing for a call to the result of a template conversion
17712 function. The parms we really want are in return_type. */
17713 if (POINTER_TYPE_P (return_type
))
17714 return_type
= TREE_TYPE (return_type
);
17715 parms
= TYPE_ARG_TYPES (return_type
);
17717 else if (return_type
)
17721 parms
= tree_cons (NULL_TREE
, TREE_TYPE (fntype
), parms
);
17722 new_args
= XALLOCAVEC (tree
, nargs
+ 1);
17723 new_args
[0] = return_type
;
17724 memcpy (new_args
+ 1, args
, nargs
* sizeof (tree
));
17729 /* We allow incomplete unification without an error message here
17730 because the standard doesn't seem to explicitly prohibit it. Our
17731 callers must be ready to deal with unification failures in any
17734 TREE_VALUE (tinst
) = targs
;
17735 /* If we aren't explaining yet, push tinst context so we can see where
17736 any errors (e.g. from class instantiations triggered by instantiation
17737 of default template arguments) come from. If we are explaining, this
17738 context is redundant. */
17739 if (!explain_p
&& !push_tinst_level (tinst
))
17741 excessive_deduction_depth
= true;
17745 /* type_unification_real will pass back any access checks from default
17746 template argument substitution. */
17747 vec
<deferred_access_check
, va_gc
> *checks
;
17750 ok
= !type_unification_real (DECL_INNERMOST_TEMPLATE_PARMS (fn
),
17751 targs
, parms
, args
, nargs
, /*subr=*/0,
17752 strict
, flags
, &checks
, explain_p
);
17754 pop_tinst_level ();
17758 /* Now that we have bindings for all of the template arguments,
17759 ensure that the arguments deduced for the template template
17760 parameters have compatible template parameter lists. We cannot
17761 check this property before we have deduced all template
17762 arguments, because the template parameter types of a template
17763 template parameter might depend on prior template parameters
17764 deduced after the template template parameter. The following
17765 ill-formed example illustrates this issue:
17767 template<typename T, template<T> class C> void f(C<5>, T);
17769 template<int N> struct X {};
17772 f(X<5>(), 5l); // error: template argument deduction fails
17775 The template parameter list of 'C' depends on the template type
17776 parameter 'T', but 'C' is deduced to 'X' before 'T' is deduced to
17777 'long'. Thus, we can't check that 'C' cannot bind to 'X' at the
17778 time that we deduce 'C'. */
17779 if (!template_template_parm_bindings_ok_p
17780 (DECL_INNERMOST_TEMPLATE_PARMS (fn
), targs
))
17782 unify_inconsistent_template_template_parameters (explain_p
);
17786 /* All is well so far. Now, check:
17790 When all template arguments have been deduced, all uses of
17791 template parameters in nondeduced contexts are replaced with
17792 the corresponding deduced argument values. If the
17793 substitution results in an invalid type, as described above,
17794 type deduction fails. */
17795 TREE_VALUE (tinst
) = targs
;
17796 if (!push_tinst_level (tinst
))
17798 excessive_deduction_depth
= true;
17802 /* Also collect access checks from the instantiation. */
17803 reopen_deferring_access_checks (checks
);
17805 decl
= instantiate_template (fn
, targs
, complain
);
17807 checks
= get_deferred_access_checks ();
17808 pop_deferring_access_checks ();
17810 pop_tinst_level ();
17812 if (decl
== error_mark_node
)
17815 /* Now perform any access checks encountered during substitution. */
17816 push_access_scope (decl
);
17817 ok
= perform_access_checks (checks
, complain
);
17818 pop_access_scope (decl
);
17822 /* If we're looking for an exact match, check that what we got
17823 is indeed an exact match. It might not be if some template
17824 parameters are used in non-deduced contexts. But don't check
17825 for an exact match if we have dependent template arguments;
17826 in that case we're doing partial ordering, and we already know
17827 that we have two candidates that will provide the actual type. */
17828 if (strict
== DEDUCE_EXACT
&& !any_dependent_template_arguments_p (targs
))
17830 tree substed
= TREE_TYPE (decl
);
17834 = skip_artificial_parms_for (decl
, TYPE_ARG_TYPES (substed
));
17836 sarg
= tree_cons (NULL_TREE
, TREE_TYPE (substed
), sarg
);
17837 for (i
= 0; i
< nargs
&& sarg
; ++i
, sarg
= TREE_CHAIN (sarg
))
17838 if (!same_type_p (args
[i
], TREE_VALUE (sarg
)))
17840 unify_type_mismatch (explain_p
, args
[i
],
17841 TREE_VALUE (sarg
));
17850 if (excessive_deduction_depth
)
17852 if (deduction_depth
== 0)
17853 /* Reset once we're all the way out. */
17854 excessive_deduction_depth
= false;
17857 /* We can't free this if a pending_template entry or last_error_tinst_level
17858 is pointing at it. */
17859 if (last_pending_template
== old_last_pend
17860 && last_error_tinst_level
== old_error_tinst
)
17866 /* Adjust types before performing type deduction, as described in
17867 [temp.deduct.call] and [temp.deduct.conv]. The rules in these two
17868 sections are symmetric. PARM is the type of a function parameter
17869 or the return type of the conversion function. ARG is the type of
17870 the argument passed to the call, or the type of the value
17871 initialized with the result of the conversion function.
17872 ARG_EXPR is the original argument expression, which may be null. */
17875 maybe_adjust_types_for_deduction (unification_kind_t strict
,
17888 /* Swap PARM and ARG throughout the remainder of this
17889 function; the handling is precisely symmetric since PARM
17890 will initialize ARG rather than vice versa. */
17891 std::swap (parm
, arg
);
17895 /* Core issue #873: Do the DR606 thing (see below) for these cases,
17896 too, but here handle it by stripping the reference from PARM
17897 rather than by adding it to ARG. */
17898 if (TREE_CODE (*parm
) == REFERENCE_TYPE
17899 && TYPE_REF_IS_RVALUE (*parm
)
17900 && TREE_CODE (TREE_TYPE (*parm
)) == TEMPLATE_TYPE_PARM
17901 && cp_type_quals (TREE_TYPE (*parm
)) == TYPE_UNQUALIFIED
17902 && TREE_CODE (*arg
) == REFERENCE_TYPE
17903 && !TYPE_REF_IS_RVALUE (*arg
))
17904 *parm
= TREE_TYPE (*parm
);
17905 /* Nothing else to do in this case. */
17909 gcc_unreachable ();
17912 if (TREE_CODE (*parm
) != REFERENCE_TYPE
)
17914 /* [temp.deduct.call]
17916 If P is not a reference type:
17918 --If A is an array type, the pointer type produced by the
17919 array-to-pointer standard conversion (_conv.array_) is
17920 used in place of A for type deduction; otherwise,
17922 --If A is a function type, the pointer type produced by
17923 the function-to-pointer standard conversion
17924 (_conv.func_) is used in place of A for type deduction;
17927 --If A is a cv-qualified type, the top level
17928 cv-qualifiers of A's type are ignored for type
17930 if (TREE_CODE (*arg
) == ARRAY_TYPE
)
17931 *arg
= build_pointer_type (TREE_TYPE (*arg
));
17932 else if (TREE_CODE (*arg
) == FUNCTION_TYPE
)
17933 *arg
= build_pointer_type (*arg
);
17935 *arg
= TYPE_MAIN_VARIANT (*arg
);
17938 /* From C++0x [14.8.2.1/3 temp.deduct.call] (after DR606), "If P is
17939 of the form T&&, where T is a template parameter, and the argument
17940 is an lvalue, T is deduced as A& */
17941 if (TREE_CODE (*parm
) == REFERENCE_TYPE
17942 && TYPE_REF_IS_RVALUE (*parm
)
17943 && TREE_CODE (TREE_TYPE (*parm
)) == TEMPLATE_TYPE_PARM
17944 && cp_type_quals (TREE_TYPE (*parm
)) == TYPE_UNQUALIFIED
17945 && (arg_expr
? real_lvalue_p (arg_expr
)
17946 /* try_one_overload doesn't provide an arg_expr, but
17947 functions are always lvalues. */
17948 : TREE_CODE (*arg
) == FUNCTION_TYPE
))
17949 *arg
= build_reference_type (*arg
);
17951 /* [temp.deduct.call]
17953 If P is a cv-qualified type, the top level cv-qualifiers
17954 of P's type are ignored for type deduction. If P is a
17955 reference type, the type referred to by P is used for
17957 *parm
= TYPE_MAIN_VARIANT (*parm
);
17958 if (TREE_CODE (*parm
) == REFERENCE_TYPE
)
17960 *parm
= TREE_TYPE (*parm
);
17961 result
|= UNIFY_ALLOW_OUTER_MORE_CV_QUAL
;
17964 /* DR 322. For conversion deduction, remove a reference type on parm
17965 too (which has been swapped into ARG). */
17966 if (strict
== DEDUCE_CONV
&& TREE_CODE (*arg
) == REFERENCE_TYPE
)
17967 *arg
= TREE_TYPE (*arg
);
17972 /* Subroutine of unify_one_argument. PARM is a function parameter of a
17973 template which does contain any deducible template parameters; check if
17974 ARG is a suitable match for it. STRICT, FLAGS and EXPLAIN_P are as in
17975 unify_one_argument. */
17978 check_non_deducible_conversion (tree parm
, tree arg
, int strict
,
17979 int flags
, bool explain_p
)
17984 type
= TREE_TYPE (arg
);
17988 if (same_type_p (parm
, type
))
17989 return unify_success (explain_p
);
17991 if (strict
== DEDUCE_CONV
)
17993 if (can_convert_arg (type
, parm
, NULL_TREE
, flags
,
17994 explain_p
? tf_warning_or_error
: tf_none
))
17995 return unify_success (explain_p
);
17997 else if (strict
!= DEDUCE_EXACT
)
17999 if (can_convert_arg (parm
, type
,
18000 TYPE_P (arg
) ? NULL_TREE
: arg
,
18001 flags
, explain_p
? tf_warning_or_error
: tf_none
))
18002 return unify_success (explain_p
);
18005 if (strict
== DEDUCE_EXACT
)
18006 return unify_type_mismatch (explain_p
, parm
, arg
);
18008 return unify_arg_conversion (explain_p
, parm
, type
, arg
);
18011 static bool uses_deducible_template_parms (tree type
);
18013 /* Returns true iff the expression EXPR is one from which a template
18014 argument can be deduced. In other words, if it's an undecorated
18015 use of a template non-type parameter. */
18018 deducible_expression (tree expr
)
18020 return (TREE_CODE (expr
) == TEMPLATE_PARM_INDEX
);
18023 /* Returns true iff the array domain DOMAIN uses a template parameter in a
18024 deducible way; that is, if it has a max value of <PARM> - 1. */
18027 deducible_array_bound (tree domain
)
18029 if (domain
== NULL_TREE
)
18032 tree max
= TYPE_MAX_VALUE (domain
);
18033 if (TREE_CODE (max
) != MINUS_EXPR
)
18036 return deducible_expression (TREE_OPERAND (max
, 0));
18039 /* Returns true iff the template arguments ARGS use a template parameter
18040 in a deducible way. */
18043 deducible_template_args (tree args
)
18045 for (int i
= 0; i
< TREE_VEC_LENGTH (args
); ++i
)
18048 tree elt
= TREE_VEC_ELT (args
, i
);
18049 if (ARGUMENT_PACK_P (elt
))
18050 deducible
= deducible_template_args (ARGUMENT_PACK_ARGS (elt
));
18053 if (PACK_EXPANSION_P (elt
))
18054 elt
= PACK_EXPANSION_PATTERN (elt
);
18055 if (TREE_CODE (elt
) == TEMPLATE_TEMPLATE_PARM
)
18057 else if (TYPE_P (elt
))
18058 deducible
= uses_deducible_template_parms (elt
);
18060 deducible
= deducible_expression (elt
);
18068 /* Returns true iff TYPE contains any deducible references to template
18069 parameters, as per 14.8.2.5. */
18072 uses_deducible_template_parms (tree type
)
18074 if (PACK_EXPANSION_P (type
))
18075 type
= PACK_EXPANSION_PATTERN (type
);
18082 if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
18083 || TREE_CODE (type
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
18089 if (POINTER_TYPE_P (type
))
18090 return uses_deducible_template_parms (TREE_TYPE (type
));
18092 /* T[integer-constant ]
18094 if (TREE_CODE (type
) == ARRAY_TYPE
)
18095 return (uses_deducible_template_parms (TREE_TYPE (type
))
18096 || deducible_array_bound (TYPE_DOMAIN (type
)));
18108 if (TYPE_PTRMEM_P (type
))
18109 return (uses_deducible_template_parms (TYPE_PTRMEM_CLASS_TYPE (type
))
18110 || (uses_deducible_template_parms
18111 (TYPE_PTRMEM_POINTED_TO_TYPE (type
))));
18113 /* template-name <T> (where template-name refers to a class template)
18114 template-name <i> (where template-name refers to a class template) */
18115 if (CLASS_TYPE_P (type
)
18116 && CLASSTYPE_TEMPLATE_INFO (type
)
18117 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (type
)))
18118 return deducible_template_args (INNERMOST_TEMPLATE_ARGS
18119 (CLASSTYPE_TI_ARGS (type
)));
18124 if (TREE_CODE (type
) == FUNCTION_TYPE
18125 || TREE_CODE (type
) == METHOD_TYPE
)
18127 if (uses_deducible_template_parms (TREE_TYPE (type
)))
18129 tree parm
= TYPE_ARG_TYPES (type
);
18130 if (TREE_CODE (type
) == METHOD_TYPE
)
18131 parm
= TREE_CHAIN (parm
);
18132 for (; parm
; parm
= TREE_CHAIN (parm
))
18133 if (uses_deducible_template_parms (TREE_VALUE (parm
)))
18140 /* Subroutine of type_unification_real and unify_pack_expansion to
18141 handle unification of a single P/A pair. Parameters are as
18142 for those functions. */
18145 unify_one_argument (tree tparms
, tree targs
, tree parm
, tree arg
,
18146 int subr
, unification_kind_t strict
,
18149 tree arg_expr
= NULL_TREE
;
18152 if (arg
== error_mark_node
|| parm
== error_mark_node
)
18153 return unify_invalid (explain_p
);
18154 if (arg
== unknown_type_node
)
18155 /* We can't deduce anything from this, but we might get all the
18156 template args from other function args. */
18157 return unify_success (explain_p
);
18159 /* Implicit conversions (Clause 4) will be performed on a function
18160 argument to convert it to the type of the corresponding function
18161 parameter if the parameter type contains no template-parameters that
18162 participate in template argument deduction. */
18163 if (strict
!= DEDUCE_EXACT
18164 && TYPE_P (parm
) && !uses_deducible_template_parms (parm
))
18165 /* For function parameters with no deducible template parameters,
18166 just return. We'll check non-dependent conversions later. */
18167 return unify_success (explain_p
);
18172 arg_strict
= (UNIFY_ALLOW_OUTER_LEVEL
18173 | UNIFY_ALLOW_MORE_CV_QUAL
18174 | UNIFY_ALLOW_DERIVED
);
18178 arg_strict
= UNIFY_ALLOW_LESS_CV_QUAL
;
18182 arg_strict
= UNIFY_ALLOW_NONE
;
18186 gcc_unreachable ();
18189 /* We only do these transformations if this is the top-level
18190 parameter_type_list in a call or declaration matching; in other
18191 situations (nested function declarators, template argument lists) we
18192 won't be comparing a type to an expression, and we don't do any type
18198 gcc_assert (TREE_TYPE (arg
) != NULL_TREE
);
18199 if (type_unknown_p (arg
))
18201 /* [temp.deduct.type] A template-argument can be
18202 deduced from a pointer to function or pointer
18203 to member function argument if the set of
18204 overloaded functions does not contain function
18205 templates and at most one of a set of
18206 overloaded functions provides a unique
18209 if (resolve_overloaded_unification
18210 (tparms
, targs
, parm
, arg
, strict
,
18211 arg_strict
, explain_p
))
18212 return unify_success (explain_p
);
18213 return unify_overload_resolution_failure (explain_p
, arg
);
18217 arg
= unlowered_expr_type (arg
);
18218 if (arg
== error_mark_node
)
18219 return unify_invalid (explain_p
);
18223 maybe_adjust_types_for_deduction (strict
, &parm
, &arg
, arg_expr
);
18226 if ((TYPE_P (parm
) || TREE_CODE (parm
) == TEMPLATE_DECL
)
18227 != (TYPE_P (arg
) || TREE_CODE (arg
) == TEMPLATE_DECL
))
18228 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
18230 /* For deduction from an init-list we need the actual list. */
18231 if (arg_expr
&& BRACE_ENCLOSED_INITIALIZER_P (arg_expr
))
18233 return unify (tparms
, targs
, parm
, arg
, arg_strict
, explain_p
);
18236 /* Most parms like fn_type_unification.
18238 If SUBR is 1, we're being called recursively (to unify the
18239 arguments of a function or method parameter of a function
18242 CHECKS is a pointer to a vector of access checks encountered while
18243 substituting default template arguments. */
18246 type_unification_real (tree tparms
,
18250 unsigned int xnargs
,
18252 unification_kind_t strict
,
18254 vec
<deferred_access_check
, va_gc
> **checks
,
18259 int ntparms
= TREE_VEC_LENGTH (tparms
);
18260 int saw_undeduced
= 0;
18263 unsigned int nargs
;
18266 gcc_assert (TREE_CODE (tparms
) == TREE_VEC
);
18267 gcc_assert (xparms
== NULL_TREE
|| TREE_CODE (xparms
) == TREE_LIST
);
18268 gcc_assert (ntparms
> 0);
18270 /* Reset the number of non-defaulted template arguments contained
18272 NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
) = NULL_TREE
;
18280 while (parms
&& parms
!= void_list_node
18283 parm
= TREE_VALUE (parms
);
18285 if (TREE_CODE (parm
) == TYPE_PACK_EXPANSION
18286 && (!TREE_CHAIN (parms
) || TREE_CHAIN (parms
) == void_list_node
))
18287 /* For a function parameter pack that occurs at the end of the
18288 parameter-declaration-list, the type A of each remaining
18289 argument of the call is compared with the type P of the
18290 declarator-id of the function parameter pack. */
18293 parms
= TREE_CHAIN (parms
);
18295 if (TREE_CODE (parm
) == TYPE_PACK_EXPANSION
)
18296 /* For a function parameter pack that does not occur at the
18297 end of the parameter-declaration-list, the type of the
18298 parameter pack is a non-deduced context. */
18304 if (unify_one_argument (tparms
, targs
, parm
, arg
, subr
, strict
,
18310 && parms
!= void_list_node
18311 && TREE_CODE (TREE_VALUE (parms
)) == TYPE_PACK_EXPANSION
)
18313 /* Unify the remaining arguments with the pack expansion type. */
18315 tree parmvec
= make_tree_vec (1);
18317 /* Allocate a TREE_VEC and copy in all of the arguments */
18318 argvec
= make_tree_vec (nargs
- ia
);
18319 for (i
= 0; ia
< nargs
; ++ia
, ++i
)
18320 TREE_VEC_ELT (argvec
, i
) = args
[ia
];
18322 /* Copy the parameter into parmvec. */
18323 TREE_VEC_ELT (parmvec
, 0) = TREE_VALUE (parms
);
18324 if (unify_pack_expansion (tparms
, targs
, parmvec
, argvec
, strict
,
18325 /*subr=*/subr
, explain_p
))
18328 /* Advance to the end of the list of parameters. */
18329 parms
= TREE_CHAIN (parms
);
18332 /* Fail if we've reached the end of the parm list, and more args
18333 are present, and the parm list isn't variadic. */
18334 if (ia
< nargs
&& parms
== void_list_node
)
18335 return unify_too_many_arguments (explain_p
, nargs
, ia
);
18336 /* Fail if parms are left and they don't have default values and
18337 they aren't all deduced as empty packs (c++/57397). This is
18338 consistent with sufficient_parms_p. */
18339 if (parms
&& parms
!= void_list_node
18340 && TREE_PURPOSE (parms
) == NULL_TREE
)
18342 unsigned int count
= nargs
;
18347 type_pack_p
= TREE_CODE (TREE_VALUE (p
)) == TYPE_PACK_EXPANSION
;
18350 p
= TREE_CHAIN (p
);
18352 while (p
&& p
!= void_list_node
);
18353 if (count
!= nargs
)
18354 return unify_too_few_arguments (explain_p
, ia
, count
,
18360 tsubst_flags_t complain
= (explain_p
18361 ? tf_warning_or_error
18364 for (i
= 0; i
< ntparms
; i
++)
18366 tree targ
= TREE_VEC_ELT (targs
, i
);
18367 tree tparm
= TREE_VEC_ELT (tparms
, i
);
18369 /* Clear the "incomplete" flags on all argument packs now so that
18370 substituting them into later default arguments works. */
18371 if (targ
&& ARGUMENT_PACK_P (targ
))
18373 ARGUMENT_PACK_INCOMPLETE_P (targ
) = 0;
18374 ARGUMENT_PACK_EXPLICIT_ARGS (targ
) = NULL_TREE
;
18377 if (targ
|| tparm
== error_mark_node
)
18379 tparm
= TREE_VALUE (tparm
);
18381 /* If this is an undeduced nontype parameter that depends on
18382 a type parameter, try another pass; its type may have been
18383 deduced from a later argument than the one from which
18384 this parameter can be deduced. */
18385 if (TREE_CODE (tparm
) == PARM_DECL
18386 && uses_template_parms (TREE_TYPE (tparm
))
18387 && saw_undeduced
< 2)
18393 /* Core issue #226 (C++0x) [temp.deduct]:
18395 If a template argument has not been deduced, its
18396 default template argument, if any, is used.
18398 When we are in C++98 mode, TREE_PURPOSE will either
18399 be NULL_TREE or ERROR_MARK_NODE, so we do not need
18400 to explicitly check cxx_dialect here. */
18401 if (TREE_PURPOSE (TREE_VEC_ELT (tparms
, i
)))
18402 /* OK, there is a default argument. Wait until after the
18403 conversion check to do substitution. */
18406 /* If the type parameter is a parameter pack, then it will
18407 be deduced to an empty parameter pack. */
18408 if (template_parameter_pack_p (tparm
))
18412 if (TREE_CODE (tparm
) == TEMPLATE_PARM_INDEX
)
18414 arg
= make_node (NONTYPE_ARGUMENT_PACK
);
18415 TREE_TYPE (arg
) = TREE_TYPE (TEMPLATE_PARM_DECL (tparm
));
18416 TREE_CONSTANT (arg
) = 1;
18419 arg
= cxx_make_type (TYPE_ARGUMENT_PACK
);
18421 SET_ARGUMENT_PACK_ARGS (arg
, make_tree_vec (0));
18423 TREE_VEC_ELT (targs
, i
) = arg
;
18427 return unify_parameter_deduction_failure (explain_p
, tparm
);
18430 /* DR 1391: All parameters have args, now check non-dependent parms for
18432 if (saw_undeduced
< 2)
18433 for (ia
= 0, parms
= xparms
, args
= xargs
, nargs
= xnargs
;
18434 parms
&& parms
!= void_list_node
&& ia
< nargs
; )
18436 parm
= TREE_VALUE (parms
);
18438 if (TREE_CODE (parm
) == TYPE_PACK_EXPANSION
18439 && (!TREE_CHAIN (parms
)
18440 || TREE_CHAIN (parms
) == void_list_node
))
18441 /* For a function parameter pack that occurs at the end of the
18442 parameter-declaration-list, the type A of each remaining
18443 argument of the call is compared with the type P of the
18444 declarator-id of the function parameter pack. */
18447 parms
= TREE_CHAIN (parms
);
18449 if (TREE_CODE (parm
) == TYPE_PACK_EXPANSION
)
18450 /* For a function parameter pack that does not occur at the
18451 end of the parameter-declaration-list, the type of the
18452 parameter pack is a non-deduced context. */
18458 if (uses_template_parms (parm
))
18460 if (check_non_deducible_conversion (parm
, arg
, strict
, flags
,
18465 /* Now substitute into the default template arguments. */
18466 for (i
= 0; i
< ntparms
; i
++)
18468 tree targ
= TREE_VEC_ELT (targs
, i
);
18469 tree tparm
= TREE_VEC_ELT (tparms
, i
);
18471 if (targ
|| tparm
== error_mark_node
)
18473 tree parm
= TREE_VALUE (tparm
);
18475 if (TREE_CODE (parm
) == PARM_DECL
18476 && uses_template_parms (TREE_TYPE (parm
))
18477 && saw_undeduced
< 2)
18480 tree arg
= TREE_PURPOSE (tparm
);
18481 reopen_deferring_access_checks (*checks
);
18482 location_t save_loc
= input_location
;
18484 input_location
= DECL_SOURCE_LOCATION (parm
);
18485 arg
= tsubst_template_arg (arg
, targs
, complain
, NULL_TREE
);
18486 arg
= convert_template_argument (parm
, arg
, targs
, complain
,
18488 input_location
= save_loc
;
18489 *checks
= get_deferred_access_checks ();
18490 pop_deferring_access_checks ();
18491 if (arg
== error_mark_node
)
18495 TREE_VEC_ELT (targs
, i
) = arg
;
18496 /* The position of the first default template argument,
18497 is also the number of non-defaulted arguments in TARGS.
18499 if (!NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
))
18500 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
, i
);
18505 if (saw_undeduced
++ == 1)
18509 if (CHECKING_P
&& !NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
))
18510 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
, TREE_VEC_LENGTH (targs
));
18512 return unify_success (explain_p
);
18515 /* Subroutine of type_unification_real. Args are like the variables
18516 at the call site. ARG is an overloaded function (or template-id);
18517 we try deducing template args from each of the overloads, and if
18518 only one succeeds, we go with that. Modifies TARGS and returns
18519 true on success. */
18522 resolve_overloaded_unification (tree tparms
,
18526 unification_kind_t strict
,
18530 tree tempargs
= copy_node (targs
);
18532 tree goodfn
= NULL_TREE
;
18535 if (TREE_CODE (arg
) == ADDR_EXPR
)
18537 arg
= TREE_OPERAND (arg
, 0);
18543 if (TREE_CODE (arg
) == COMPONENT_REF
)
18544 /* Handle `&x' where `x' is some static or non-static member
18546 arg
= TREE_OPERAND (arg
, 1);
18548 if (TREE_CODE (arg
) == OFFSET_REF
)
18549 arg
= TREE_OPERAND (arg
, 1);
18551 /* Strip baselink information. */
18552 if (BASELINK_P (arg
))
18553 arg
= BASELINK_FUNCTIONS (arg
);
18555 if (TREE_CODE (arg
) == TEMPLATE_ID_EXPR
)
18557 /* If we got some explicit template args, we need to plug them into
18558 the affected templates before we try to unify, in case the
18559 explicit args will completely resolve the templates in question. */
18562 tree expl_subargs
= TREE_OPERAND (arg
, 1);
18563 arg
= TREE_OPERAND (arg
, 0);
18565 for (; arg
; arg
= OVL_NEXT (arg
))
18567 tree fn
= OVL_CURRENT (arg
);
18568 tree subargs
, elem
;
18570 if (TREE_CODE (fn
) != TEMPLATE_DECL
)
18573 subargs
= coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (fn
),
18574 expl_subargs
, NULL_TREE
, tf_none
,
18575 /*require_all_args=*/true,
18576 /*use_default_args=*/true);
18577 if (subargs
!= error_mark_node
18578 && !any_dependent_template_arguments_p (subargs
))
18580 elem
= TREE_TYPE (instantiate_template (fn
, subargs
, tf_none
));
18581 if (try_one_overload (tparms
, targs
, tempargs
, parm
,
18582 elem
, strict
, sub_strict
, addr_p
, explain_p
)
18583 && (!goodfn
|| !same_type_p (goodfn
, elem
)))
18592 /* If no templates (or more than one) are fully resolved by the
18593 explicit arguments, this template-id is a non-deduced context; it
18594 could still be OK if we deduce all template arguments for the
18595 enclosing call through other arguments. */
18599 else if (TREE_CODE (arg
) != OVERLOAD
18600 && TREE_CODE (arg
) != FUNCTION_DECL
)
18601 /* If ARG is, for example, "(0, &f)" then its type will be unknown
18602 -- but the deduction does not succeed because the expression is
18603 not just the function on its own. */
18606 for (; arg
; arg
= OVL_NEXT (arg
))
18607 if (try_one_overload (tparms
, targs
, tempargs
, parm
,
18608 TREE_TYPE (OVL_CURRENT (arg
)),
18609 strict
, sub_strict
, addr_p
, explain_p
)
18610 && (!goodfn
|| !decls_match (goodfn
, OVL_CURRENT (arg
))))
18612 goodfn
= OVL_CURRENT (arg
);
18616 /* [temp.deduct.type] A template-argument can be deduced from a pointer
18617 to function or pointer to member function argument if the set of
18618 overloaded functions does not contain function templates and at most
18619 one of a set of overloaded functions provides a unique match.
18621 So if we found multiple possibilities, we return success but don't
18622 deduce anything. */
18626 int i
= TREE_VEC_LENGTH (targs
);
18628 if (TREE_VEC_ELT (tempargs
, i
))
18630 tree old
= TREE_VEC_ELT (targs
, i
);
18631 tree new_
= TREE_VEC_ELT (tempargs
, i
);
18632 if (new_
&& old
&& ARGUMENT_PACK_P (old
)
18633 && ARGUMENT_PACK_EXPLICIT_ARGS (old
))
18634 /* Don't forget explicit template arguments in a pack. */
18635 ARGUMENT_PACK_EXPLICIT_ARGS (new_
)
18636 = ARGUMENT_PACK_EXPLICIT_ARGS (old
);
18637 TREE_VEC_ELT (targs
, i
) = new_
;
18646 /* Core DR 115: In contexts where deduction is done and fails, or in
18647 contexts where deduction is not done, if a template argument list is
18648 specified and it, along with any default template arguments, identifies
18649 a single function template specialization, then the template-id is an
18650 lvalue for the function template specialization. */
18653 resolve_nondeduced_context (tree orig_expr
, tsubst_flags_t complain
)
18655 tree expr
, offset
, baselink
;
18658 if (!type_unknown_p (orig_expr
))
18663 offset
= NULL_TREE
;
18664 baselink
= NULL_TREE
;
18666 if (TREE_CODE (expr
) == ADDR_EXPR
)
18668 expr
= TREE_OPERAND (expr
, 0);
18671 if (TREE_CODE (expr
) == OFFSET_REF
)
18674 expr
= TREE_OPERAND (expr
, 1);
18676 if (BASELINK_P (expr
))
18679 expr
= BASELINK_FUNCTIONS (expr
);
18682 if (TREE_CODE (expr
) == TEMPLATE_ID_EXPR
)
18685 tree goodfn
= NULL_TREE
;
18687 /* If we got some explicit template args, we need to plug them into
18688 the affected templates before we try to unify, in case the
18689 explicit args will completely resolve the templates in question. */
18691 tree expl_subargs
= TREE_OPERAND (expr
, 1);
18692 tree arg
= TREE_OPERAND (expr
, 0);
18693 tree badfn
= NULL_TREE
;
18694 tree badargs
= NULL_TREE
;
18696 for (; arg
; arg
= OVL_NEXT (arg
))
18698 tree fn
= OVL_CURRENT (arg
);
18699 tree subargs
, elem
;
18701 if (TREE_CODE (fn
) != TEMPLATE_DECL
)
18704 subargs
= coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (fn
),
18705 expl_subargs
, NULL_TREE
, tf_none
,
18706 /*require_all_args=*/true,
18707 /*use_default_args=*/true);
18708 if (subargs
!= error_mark_node
18709 && !any_dependent_template_arguments_p (subargs
))
18711 elem
= instantiate_template (fn
, subargs
, tf_none
);
18712 if (elem
== error_mark_node
)
18717 else if (elem
&& (!goodfn
|| !decls_match (goodfn
, elem
)))
18726 mark_used (goodfn
);
18729 expr
= build_baselink (BASELINK_BINFO (baselink
),
18730 BASELINK_ACCESS_BINFO (baselink
),
18731 expr
, BASELINK_OPTYPE (baselink
));
18735 = TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (offset
, 0)));
18736 expr
= build_offset_ref (base
, expr
, addr
, complain
);
18739 expr
= cp_build_addr_expr (expr
, complain
);
18742 else if (good
== 0 && badargs
&& (complain
& tf_error
))
18743 /* There were no good options and at least one bad one, so let the
18744 user know what the problem is. */
18745 instantiate_template (badfn
, badargs
, complain
);
18750 /* Subroutine of resolve_overloaded_unification; does deduction for a single
18751 overload. Fills TARGS with any deduced arguments, or error_mark_node if
18752 different overloads deduce different arguments for a given parm.
18753 ADDR_P is true if the expression for which deduction is being
18754 performed was of the form "& fn" rather than simply "fn".
18756 Returns 1 on success. */
18759 try_one_overload (tree tparms
,
18764 unification_kind_t strict
,
18773 if (arg
== error_mark_node
)
18776 /* [temp.deduct.type] A template-argument can be deduced from a pointer
18777 to function or pointer to member function argument if the set of
18778 overloaded functions does not contain function templates and at most
18779 one of a set of overloaded functions provides a unique match.
18781 So if this is a template, just return success. */
18783 if (uses_template_parms (arg
))
18786 if (TREE_CODE (arg
) == METHOD_TYPE
)
18787 arg
= build_ptrmemfunc_type (build_pointer_type (arg
));
18789 arg
= build_pointer_type (arg
);
18791 sub_strict
|= maybe_adjust_types_for_deduction (strict
, &parm
, &arg
, NULL
);
18793 /* We don't copy orig_targs for this because if we have already deduced
18794 some template args from previous args, unify would complain when we
18795 try to deduce a template parameter for the same argument, even though
18796 there isn't really a conflict. */
18797 nargs
= TREE_VEC_LENGTH (targs
);
18798 tempargs
= make_tree_vec (nargs
);
18800 if (unify (tparms
, tempargs
, parm
, arg
, sub_strict
, explain_p
))
18803 /* First make sure we didn't deduce anything that conflicts with
18804 explicitly specified args. */
18805 for (i
= nargs
; i
--; )
18807 tree elt
= TREE_VEC_ELT (tempargs
, i
);
18808 tree oldelt
= TREE_VEC_ELT (orig_targs
, i
);
18812 else if (uses_template_parms (elt
))
18813 /* Since we're unifying against ourselves, we will fill in
18814 template args used in the function parm list with our own
18815 template parms. Discard them. */
18816 TREE_VEC_ELT (tempargs
, i
) = NULL_TREE
;
18817 else if (oldelt
&& ARGUMENT_PACK_P (oldelt
))
18819 /* Check that the argument at each index of the deduced argument pack
18820 is equivalent to the corresponding explicitly specified argument.
18821 We may have deduced more arguments than were explicitly specified,
18823 gcc_assert (ARGUMENT_PACK_INCOMPLETE_P (oldelt
));
18824 gcc_assert (ARGUMENT_PACK_ARGS (oldelt
)
18825 == ARGUMENT_PACK_EXPLICIT_ARGS (oldelt
));
18827 tree explicit_pack
= ARGUMENT_PACK_ARGS (oldelt
);
18828 tree deduced_pack
= ARGUMENT_PACK_ARGS (elt
);
18830 if (TREE_VEC_LENGTH (deduced_pack
)
18831 < TREE_VEC_LENGTH (explicit_pack
))
18834 for (int j
= 0; j
< TREE_VEC_LENGTH (explicit_pack
); j
++)
18835 if (!template_args_equal (TREE_VEC_ELT (explicit_pack
, j
),
18836 TREE_VEC_ELT (deduced_pack
, j
)))
18839 else if (oldelt
&& !template_args_equal (oldelt
, elt
))
18843 for (i
= nargs
; i
--; )
18845 tree elt
= TREE_VEC_ELT (tempargs
, i
);
18848 TREE_VEC_ELT (targs
, i
) = elt
;
18854 /* PARM is a template class (perhaps with unbound template
18855 parameters). ARG is a fully instantiated type. If ARG can be
18856 bound to PARM, return ARG, otherwise return NULL_TREE. TPARMS and
18857 TARGS are as for unify. */
18860 try_class_unification (tree tparms
, tree targs
, tree parm
, tree arg
,
18863 tree copy_of_targs
;
18865 if (!CLASSTYPE_TEMPLATE_INFO (arg
)
18866 || (most_general_template (CLASSTYPE_TI_TEMPLATE (arg
))
18867 != most_general_template (CLASSTYPE_TI_TEMPLATE (parm
))))
18870 /* We need to make a new template argument vector for the call to
18871 unify. If we used TARGS, we'd clutter it up with the result of
18872 the attempted unification, even if this class didn't work out.
18873 We also don't want to commit ourselves to all the unifications
18874 we've already done, since unification is supposed to be done on
18875 an argument-by-argument basis. In other words, consider the
18876 following pathological case:
18878 template <int I, int J, int K>
18881 template <int I, int J>
18882 struct S<I, J, 2> : public S<I, I, I>, S<J, J, J> {};
18884 template <int I, int J, int K>
18885 void f(S<I, J, K>, S<I, I, I>);
18894 Now, by the time we consider the unification involving `s2', we
18895 already know that we must have `f<0, 0, 0>'. But, even though
18896 `S<0, 1, 2>' is derived from `S<0, 0, 0>', the code is invalid
18897 because there are two ways to unify base classes of S<0, 1, 2>
18898 with S<I, I, I>. If we kept the already deduced knowledge, we
18899 would reject the possibility I=1. */
18900 copy_of_targs
= make_tree_vec (TREE_VEC_LENGTH (targs
));
18902 /* If unification failed, we're done. */
18903 if (unify (tparms
, copy_of_targs
, CLASSTYPE_TI_ARGS (parm
),
18904 CLASSTYPE_TI_ARGS (arg
), UNIFY_ALLOW_NONE
, explain_p
))
18910 /* Given a template type PARM and a class type ARG, find the unique
18911 base type in ARG that is an instance of PARM. We do not examine
18912 ARG itself; only its base-classes. If there is not exactly one
18913 appropriate base class, return NULL_TREE. PARM may be the type of
18914 a partial specialization, as well as a plain template type. Used
18917 static enum template_base_result
18918 get_template_base (tree tparms
, tree targs
, tree parm
, tree arg
,
18919 bool explain_p
, tree
*result
)
18921 tree rval
= NULL_TREE
;
18924 gcc_assert (RECORD_OR_UNION_CODE_P (TREE_CODE (arg
)));
18926 binfo
= TYPE_BINFO (complete_type (arg
));
18929 /* The type could not be completed. */
18930 *result
= NULL_TREE
;
18931 return tbr_incomplete_type
;
18934 /* Walk in inheritance graph order. The search order is not
18935 important, and this avoids multiple walks of virtual bases. */
18936 for (binfo
= TREE_CHAIN (binfo
); binfo
; binfo
= TREE_CHAIN (binfo
))
18938 tree r
= try_class_unification (tparms
, targs
, parm
,
18939 BINFO_TYPE (binfo
), explain_p
);
18943 /* If there is more than one satisfactory baseclass, then:
18947 If they yield more than one possible deduced A, the type
18951 if (rval
&& !same_type_p (r
, rval
))
18953 *result
= NULL_TREE
;
18954 return tbr_ambiguous_baseclass
;
18962 return tbr_success
;
18965 /* Returns the level of DECL, which declares a template parameter. */
18968 template_decl_level (tree decl
)
18970 switch (TREE_CODE (decl
))
18973 case TEMPLATE_DECL
:
18974 return TEMPLATE_TYPE_LEVEL (TREE_TYPE (decl
));
18977 return TEMPLATE_PARM_LEVEL (DECL_INITIAL (decl
));
18980 gcc_unreachable ();
18985 /* Decide whether ARG can be unified with PARM, considering only the
18986 cv-qualifiers of each type, given STRICT as documented for unify.
18987 Returns nonzero iff the unification is OK on that basis. */
18990 check_cv_quals_for_unify (int strict
, tree arg
, tree parm
)
18992 int arg_quals
= cp_type_quals (arg
);
18993 int parm_quals
= cp_type_quals (parm
);
18995 if (TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
18996 && !(strict
& UNIFY_ALLOW_OUTER_MORE_CV_QUAL
))
18998 /* Although a CVR qualifier is ignored when being applied to a
18999 substituted template parameter ([8.3.2]/1 for example), that
19000 does not allow us to unify "const T" with "int&" because both
19001 types are not of the form "cv-list T" [14.8.2.5 temp.deduct.type].
19002 It is ok when we're allowing additional CV qualifiers
19003 at the outer level [14.8.2.1]/3,1st bullet. */
19004 if ((TREE_CODE (arg
) == REFERENCE_TYPE
19005 || TREE_CODE (arg
) == FUNCTION_TYPE
19006 || TREE_CODE (arg
) == METHOD_TYPE
)
19007 && (parm_quals
& (TYPE_QUAL_CONST
| TYPE_QUAL_VOLATILE
)))
19010 if ((!POINTER_TYPE_P (arg
) && TREE_CODE (arg
) != TEMPLATE_TYPE_PARM
)
19011 && (parm_quals
& TYPE_QUAL_RESTRICT
))
19015 if (!(strict
& (UNIFY_ALLOW_MORE_CV_QUAL
| UNIFY_ALLOW_OUTER_MORE_CV_QUAL
))
19016 && (arg_quals
& parm_quals
) != parm_quals
)
19019 if (!(strict
& (UNIFY_ALLOW_LESS_CV_QUAL
| UNIFY_ALLOW_OUTER_LESS_CV_QUAL
))
19020 && (parm_quals
& arg_quals
) != arg_quals
)
19026 /* Determines the LEVEL and INDEX for the template parameter PARM. */
19028 template_parm_level_and_index (tree parm
, int* level
, int* index
)
19030 if (TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
19031 || TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
19032 || TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
19034 *index
= TEMPLATE_TYPE_IDX (parm
);
19035 *level
= TEMPLATE_TYPE_LEVEL (parm
);
19039 *index
= TEMPLATE_PARM_IDX (parm
);
19040 *level
= TEMPLATE_PARM_LEVEL (parm
);
19044 #define RECUR_AND_CHECK_FAILURE(TP, TA, P, A, S, EP) \
19046 if (unify (TP, TA, P, A, S, EP)) \
19050 /* Unifies the remaining arguments in PACKED_ARGS with the pack
19051 expansion at the end of PACKED_PARMS. Returns 0 if the type
19052 deduction succeeds, 1 otherwise. STRICT is the same as in
19053 unify. CALL_ARGS_P is true iff PACKED_ARGS is actually a function
19054 call argument list. We'll need to adjust the arguments to make them
19055 types. SUBR tells us if this is from a recursive call to
19056 type_unification_real, or for comparing two template argument
19060 unify_pack_expansion (tree tparms
, tree targs
, tree packed_parms
,
19061 tree packed_args
, unification_kind_t strict
,
19062 bool subr
, bool explain_p
)
19065 = TREE_VEC_ELT (packed_parms
, TREE_VEC_LENGTH (packed_parms
) - 1);
19066 tree pattern
= PACK_EXPANSION_PATTERN (parm
);
19067 tree pack
, packs
= NULL_TREE
;
19068 int i
, start
= TREE_VEC_LENGTH (packed_parms
) - 1;
19070 packed_args
= expand_template_argument_pack (packed_args
);
19072 int len
= TREE_VEC_LENGTH (packed_args
);
19074 /* Determine the parameter packs we will be deducing from the
19075 pattern, and record their current deductions. */
19076 for (pack
= PACK_EXPANSION_PARAMETER_PACKS (parm
);
19077 pack
; pack
= TREE_CHAIN (pack
))
19079 tree parm_pack
= TREE_VALUE (pack
);
19082 /* Determine the index and level of this parameter pack. */
19083 template_parm_level_and_index (parm_pack
, &level
, &idx
);
19085 /* Keep track of the parameter packs and their corresponding
19087 packs
= tree_cons (parm_pack
, TMPL_ARG (targs
, level
, idx
), packs
);
19088 TREE_TYPE (packs
) = make_tree_vec (len
- start
);
19091 /* Loop through all of the arguments that have not yet been
19092 unified and unify each with the pattern. */
19093 for (i
= start
; i
< len
; i
++)
19096 bool any_explicit
= false;
19097 tree arg
= TREE_VEC_ELT (packed_args
, i
);
19099 /* For each parameter pack, set its TMPL_ARG to either NULL_TREE
19100 or the element of its argument pack at the current index if
19101 this argument was explicitly specified. */
19102 for (pack
= packs
; pack
; pack
= TREE_CHAIN (pack
))
19106 template_parm_level_and_index (TREE_PURPOSE (pack
), &level
, &idx
);
19109 if (TREE_VALUE (pack
)
19110 && (pargs
= ARGUMENT_PACK_EXPLICIT_ARGS (TREE_VALUE (pack
)))
19111 && (i
- start
< TREE_VEC_LENGTH (pargs
)))
19113 any_explicit
= true;
19114 arg
= TREE_VEC_ELT (pargs
, i
- start
);
19116 TMPL_ARG (targs
, level
, idx
) = arg
;
19119 /* If we had explicit template arguments, substitute them into the
19120 pattern before deduction. */
19123 /* Some arguments might still be unspecified or dependent. */
19125 ++processing_template_decl
;
19126 dependent
= any_dependent_template_arguments_p (targs
);
19128 --processing_template_decl
;
19129 parm
= tsubst (pattern
, targs
,
19130 explain_p
? tf_warning_or_error
: tf_none
,
19133 --processing_template_decl
;
19134 if (parm
== error_mark_node
)
19140 /* Unify the pattern with the current argument. */
19141 if (unify_one_argument (tparms
, targs
, parm
, arg
, subr
, strict
,
19145 /* For each parameter pack, collect the deduced value. */
19146 for (pack
= packs
; pack
; pack
= TREE_CHAIN (pack
))
19149 template_parm_level_and_index (TREE_PURPOSE (pack
), &level
, &idx
);
19151 TREE_VEC_ELT (TREE_TYPE (pack
), i
- start
) =
19152 TMPL_ARG (targs
, level
, idx
);
19156 /* Verify that the results of unification with the parameter packs
19157 produce results consistent with what we've seen before, and make
19158 the deduced argument packs available. */
19159 for (pack
= packs
; pack
; pack
= TREE_CHAIN (pack
))
19161 tree old_pack
= TREE_VALUE (pack
);
19162 tree new_args
= TREE_TYPE (pack
);
19163 int i
, len
= TREE_VEC_LENGTH (new_args
);
19165 bool nondeduced_p
= false;
19167 /* By default keep the original deduced argument pack.
19168 If necessary, more specific code is going to update the
19169 resulting deduced argument later down in this function. */
19170 template_parm_level_and_index (TREE_PURPOSE (pack
), &level
, &idx
);
19171 TMPL_ARG (targs
, level
, idx
) = old_pack
;
19173 /* If NEW_ARGS contains any NULL_TREE entries, we didn't
19174 actually deduce anything. */
19175 for (i
= 0; i
< len
&& !nondeduced_p
; ++i
)
19176 if (TREE_VEC_ELT (new_args
, i
) == NULL_TREE
)
19177 nondeduced_p
= true;
19181 if (old_pack
&& ARGUMENT_PACK_INCOMPLETE_P (old_pack
))
19183 /* If we had fewer function args than explicit template args,
19184 just use the explicits. */
19185 tree explicit_args
= ARGUMENT_PACK_EXPLICIT_ARGS (old_pack
);
19186 int explicit_len
= TREE_VEC_LENGTH (explicit_args
);
19187 if (len
< explicit_len
)
19188 new_args
= explicit_args
;
19194 /* Build the deduced *_ARGUMENT_PACK. */
19195 if (TREE_CODE (TREE_PURPOSE (pack
)) == TEMPLATE_PARM_INDEX
)
19197 result
= make_node (NONTYPE_ARGUMENT_PACK
);
19198 TREE_TYPE (result
) =
19199 TREE_TYPE (TEMPLATE_PARM_DECL (TREE_PURPOSE (pack
)));
19200 TREE_CONSTANT (result
) = 1;
19203 result
= cxx_make_type (TYPE_ARGUMENT_PACK
);
19205 SET_ARGUMENT_PACK_ARGS (result
, new_args
);
19207 /* Note the deduced argument packs for this parameter
19209 TMPL_ARG (targs
, level
, idx
) = result
;
19211 else if (ARGUMENT_PACK_INCOMPLETE_P (old_pack
)
19212 && (ARGUMENT_PACK_ARGS (old_pack
)
19213 == ARGUMENT_PACK_EXPLICIT_ARGS (old_pack
)))
19215 /* We only had the explicitly-provided arguments before, but
19216 now we have a complete set of arguments. */
19217 tree explicit_args
= ARGUMENT_PACK_EXPLICIT_ARGS (old_pack
);
19219 SET_ARGUMENT_PACK_ARGS (old_pack
, new_args
);
19220 ARGUMENT_PACK_INCOMPLETE_P (old_pack
) = 1;
19221 ARGUMENT_PACK_EXPLICIT_ARGS (old_pack
) = explicit_args
;
19225 tree bad_old_arg
= NULL_TREE
, bad_new_arg
= NULL_TREE
;
19226 tree old_args
= ARGUMENT_PACK_ARGS (old_pack
);
19228 if (!comp_template_args (old_args
, new_args
,
19229 &bad_old_arg
, &bad_new_arg
))
19230 /* Inconsistent unification of this parameter pack. */
19231 return unify_parameter_pack_inconsistent (explain_p
,
19237 return unify_success (explain_p
);
19240 /* Handle unification of the domain of an array. PARM_DOM and ARG_DOM are
19241 INTEGER_TYPEs representing the TYPE_DOMAIN of ARRAY_TYPEs. The other
19242 parameters and return value are as for unify. */
19245 unify_array_domain (tree tparms
, tree targs
,
19246 tree parm_dom
, tree arg_dom
,
19254 /* Our representation of array types uses "N - 1" as the
19255 TYPE_MAX_VALUE for an array with "N" elements, if "N" is
19256 not an integer constant. We cannot unify arbitrarily
19257 complex expressions, so we eliminate the MINUS_EXPRs
19259 parm_max
= TYPE_MAX_VALUE (parm_dom
);
19260 parm_cst
= TREE_CODE (parm_max
) == INTEGER_CST
;
19263 gcc_assert (TREE_CODE (parm_max
) == MINUS_EXPR
);
19264 parm_max
= TREE_OPERAND (parm_max
, 0);
19266 arg_max
= TYPE_MAX_VALUE (arg_dom
);
19267 arg_cst
= TREE_CODE (arg_max
) == INTEGER_CST
;
19270 /* The ARG_MAX may not be a simple MINUS_EXPR, if we are
19271 trying to unify the type of a variable with the type
19272 of a template parameter. For example:
19274 template <unsigned int N>
19275 void f (char (&) [N]);
19282 Here, the type of the ARG will be "int [g(i)]", and
19283 may be a SAVE_EXPR, etc. */
19284 if (TREE_CODE (arg_max
) != MINUS_EXPR
)
19285 return unify_vla_arg (explain_p
, arg_dom
);
19286 arg_max
= TREE_OPERAND (arg_max
, 0);
19289 /* If only one of the bounds used a MINUS_EXPR, compensate
19290 by adding one to the other bound. */
19291 if (parm_cst
&& !arg_cst
)
19292 parm_max
= fold_build2_loc (input_location
, PLUS_EXPR
,
19296 else if (arg_cst
&& !parm_cst
)
19297 arg_max
= fold_build2_loc (input_location
, PLUS_EXPR
,
19302 return unify (tparms
, targs
, parm_max
, arg_max
,
19303 UNIFY_ALLOW_INTEGER
, explain_p
);
19306 /* Deduce the value of template parameters. TPARMS is the (innermost)
19307 set of template parameters to a template. TARGS is the bindings
19308 for those template parameters, as determined thus far; TARGS may
19309 include template arguments for outer levels of template parameters
19310 as well. PARM is a parameter to a template function, or a
19311 subcomponent of that parameter; ARG is the corresponding argument.
19312 This function attempts to match PARM with ARG in a manner
19313 consistent with the existing assignments in TARGS. If more values
19314 are deduced, then TARGS is updated.
19316 Returns 0 if the type deduction succeeds, 1 otherwise. The
19317 parameter STRICT is a bitwise or of the following flags:
19320 Require an exact match between PARM and ARG.
19321 UNIFY_ALLOW_MORE_CV_QUAL:
19322 Allow the deduced ARG to be more cv-qualified (by qualification
19323 conversion) than ARG.
19324 UNIFY_ALLOW_LESS_CV_QUAL:
19325 Allow the deduced ARG to be less cv-qualified than ARG.
19326 UNIFY_ALLOW_DERIVED:
19327 Allow the deduced ARG to be a template base class of ARG,
19328 or a pointer to a template base class of the type pointed to by
19330 UNIFY_ALLOW_INTEGER:
19331 Allow any integral type to be deduced. See the TEMPLATE_PARM_INDEX
19332 case for more information.
19333 UNIFY_ALLOW_OUTER_LEVEL:
19334 This is the outermost level of a deduction. Used to determine validity
19335 of qualification conversions. A valid qualification conversion must
19336 have const qualified pointers leading up to the inner type which
19337 requires additional CV quals, except at the outer level, where const
19338 is not required [conv.qual]. It would be normal to set this flag in
19339 addition to setting UNIFY_ALLOW_MORE_CV_QUAL.
19340 UNIFY_ALLOW_OUTER_MORE_CV_QUAL:
19341 This is the outermost level of a deduction, and PARM can be more CV
19342 qualified at this point.
19343 UNIFY_ALLOW_OUTER_LESS_CV_QUAL:
19344 This is the outermost level of a deduction, and PARM can be less CV
19345 qualified at this point. */
19348 unify (tree tparms
, tree targs
, tree parm
, tree arg
, int strict
,
19354 int strict_in
= strict
;
19356 /* I don't think this will do the right thing with respect to types.
19357 But the only case I've seen it in so far has been array bounds, where
19358 signedness is the only information lost, and I think that will be
19360 while (TREE_CODE (parm
) == NOP_EXPR
)
19361 parm
= TREE_OPERAND (parm
, 0);
19363 if (arg
== error_mark_node
)
19364 return unify_invalid (explain_p
);
19365 if (arg
== unknown_type_node
19366 || arg
== init_list_type_node
)
19367 /* We can't deduce anything from this, but we might get all the
19368 template args from other function args. */
19369 return unify_success (explain_p
);
19371 /* If PARM uses template parameters, then we can't bail out here,
19372 even if ARG == PARM, since we won't record unifications for the
19373 template parameters. We might need them if we're trying to
19374 figure out which of two things is more specialized. */
19375 if (arg
== parm
&& !uses_template_parms (parm
))
19376 return unify_success (explain_p
);
19378 /* Handle init lists early, so the rest of the function can assume
19379 we're dealing with a type. */
19380 if (BRACE_ENCLOSED_INITIALIZER_P (arg
))
19384 tree orig_parm
= parm
;
19386 /* Replace T with std::initializer_list<T> for deduction. */
19387 if (TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
19388 && flag_deduce_init_list
)
19389 parm
= listify (parm
);
19391 if (!is_std_init_list (parm
)
19392 && TREE_CODE (parm
) != ARRAY_TYPE
)
19393 /* We can only deduce from an initializer list argument if the
19394 parameter is std::initializer_list or an array; otherwise this
19395 is a non-deduced context. */
19396 return unify_success (explain_p
);
19398 if (TREE_CODE (parm
) == ARRAY_TYPE
)
19399 elttype
= TREE_TYPE (parm
);
19402 elttype
= TREE_VEC_ELT (CLASSTYPE_TI_ARGS (parm
), 0);
19403 /* Deduction is defined in terms of a single type, so just punt
19404 on the (bizarre) std::initializer_list<T...>. */
19405 if (PACK_EXPANSION_P (elttype
))
19406 return unify_success (explain_p
);
19409 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (arg
), i
, elt
)
19411 int elt_strict
= strict
;
19413 if (elt
== error_mark_node
)
19414 return unify_invalid (explain_p
);
19416 if (!BRACE_ENCLOSED_INITIALIZER_P (elt
))
19418 tree type
= TREE_TYPE (elt
);
19419 if (type
== error_mark_node
)
19420 return unify_invalid (explain_p
);
19421 /* It should only be possible to get here for a call. */
19422 gcc_assert (elt_strict
& UNIFY_ALLOW_OUTER_LEVEL
);
19423 elt_strict
|= maybe_adjust_types_for_deduction
19424 (DEDUCE_CALL
, &elttype
, &type
, elt
);
19428 RECUR_AND_CHECK_FAILURE (tparms
, targs
, elttype
, elt
, elt_strict
,
19432 if (TREE_CODE (parm
) == ARRAY_TYPE
19433 && deducible_array_bound (TYPE_DOMAIN (parm
)))
19435 /* Also deduce from the length of the initializer list. */
19436 tree max
= size_int (CONSTRUCTOR_NELTS (arg
));
19437 tree idx
= compute_array_index_type (NULL_TREE
, max
, tf_none
);
19438 if (idx
== error_mark_node
)
19439 return unify_invalid (explain_p
);
19440 return unify_array_domain (tparms
, targs
, TYPE_DOMAIN (parm
),
19444 /* If the std::initializer_list<T> deduction worked, replace the
19445 deduced A with std::initializer_list<A>. */
19446 if (orig_parm
!= parm
)
19448 idx
= TEMPLATE_TYPE_IDX (orig_parm
);
19449 targ
= TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
);
19450 targ
= listify (targ
);
19451 TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
) = targ
;
19453 return unify_success (explain_p
);
19456 /* Immediately reject some pairs that won't unify because of
19457 cv-qualification mismatches. */
19458 if (TREE_CODE (arg
) == TREE_CODE (parm
)
19460 /* It is the elements of the array which hold the cv quals of an array
19461 type, and the elements might be template type parms. We'll check
19462 when we recurse. */
19463 && TREE_CODE (arg
) != ARRAY_TYPE
19464 /* We check the cv-qualifiers when unifying with template type
19465 parameters below. We want to allow ARG `const T' to unify with
19466 PARM `T' for example, when computing which of two templates
19467 is more specialized, for example. */
19468 && TREE_CODE (arg
) != TEMPLATE_TYPE_PARM
19469 && !check_cv_quals_for_unify (strict_in
, arg
, parm
))
19470 return unify_cv_qual_mismatch (explain_p
, parm
, arg
);
19472 if (!(strict
& UNIFY_ALLOW_OUTER_LEVEL
)
19473 && TYPE_P (parm
) && !CP_TYPE_CONST_P (parm
))
19474 strict
&= ~UNIFY_ALLOW_MORE_CV_QUAL
;
19475 strict
&= ~UNIFY_ALLOW_OUTER_LEVEL
;
19476 strict
&= ~UNIFY_ALLOW_DERIVED
;
19477 strict
&= ~UNIFY_ALLOW_OUTER_MORE_CV_QUAL
;
19478 strict
&= ~UNIFY_ALLOW_OUTER_LESS_CV_QUAL
;
19480 switch (TREE_CODE (parm
))
19482 case TYPENAME_TYPE
:
19484 case UNBOUND_CLASS_TEMPLATE
:
19485 /* In a type which contains a nested-name-specifier, template
19486 argument values cannot be deduced for template parameters used
19487 within the nested-name-specifier. */
19488 return unify_success (explain_p
);
19490 case TEMPLATE_TYPE_PARM
:
19491 case TEMPLATE_TEMPLATE_PARM
:
19492 case BOUND_TEMPLATE_TEMPLATE_PARM
:
19493 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, 0));
19494 if (error_operand_p (tparm
))
19495 return unify_invalid (explain_p
);
19497 if (TEMPLATE_TYPE_LEVEL (parm
)
19498 != template_decl_level (tparm
))
19499 /* The PARM is not one we're trying to unify. Just check
19500 to see if it matches ARG. */
19502 if (TREE_CODE (arg
) == TREE_CODE (parm
)
19503 && (is_auto (parm
) ? is_auto (arg
)
19504 : same_type_p (parm
, arg
)))
19505 return unify_success (explain_p
);
19507 return unify_type_mismatch (explain_p
, parm
, arg
);
19509 idx
= TEMPLATE_TYPE_IDX (parm
);
19510 targ
= TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
);
19511 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, idx
));
19512 if (error_operand_p (tparm
))
19513 return unify_invalid (explain_p
);
19515 /* Check for mixed types and values. */
19516 if ((TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
19517 && TREE_CODE (tparm
) != TYPE_DECL
)
19518 || (TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
19519 && TREE_CODE (tparm
) != TEMPLATE_DECL
))
19520 gcc_unreachable ();
19522 if (TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
19524 /* ARG must be constructed from a template class or a template
19525 template parameter. */
19526 if (TREE_CODE (arg
) != BOUND_TEMPLATE_TEMPLATE_PARM
19527 && !CLASSTYPE_SPECIALIZATION_OF_PRIMARY_TEMPLATE_P (arg
))
19528 return unify_template_deduction_failure (explain_p
, parm
, arg
);
19530 tree parmvec
= TYPE_TI_ARGS (parm
);
19531 /* An alias template name is never deduced. */
19532 if (TYPE_ALIAS_P (arg
))
19533 arg
= strip_typedefs (arg
);
19534 tree argvec
= INNERMOST_TEMPLATE_ARGS (TYPE_TI_ARGS (arg
));
19535 tree full_argvec
= add_to_template_args (targs
, argvec
);
19537 = DECL_INNERMOST_TEMPLATE_PARMS
19538 (TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL (parm
));
19540 int parm_variadic_p
= 0;
19542 /* The resolution to DR150 makes clear that default
19543 arguments for an N-argument may not be used to bind T
19544 to a template template parameter with fewer than N
19545 parameters. It is not safe to permit the binding of
19546 default arguments as an extension, as that may change
19547 the meaning of a conforming program. Consider:
19549 struct Dense { static const unsigned int dim = 1; };
19551 template <template <typename> class View,
19553 void operator+(float, View<Block> const&);
19555 template <typename Block,
19556 unsigned int Dim = Block::dim>
19557 struct Lvalue_proxy { operator float() const; };
19561 Lvalue_proxy<Dense> p;
19566 Here, if Lvalue_proxy is permitted to bind to View, then
19567 the global operator+ will be used; if they are not, the
19568 Lvalue_proxy will be converted to float. */
19569 if (coerce_template_parms (parm_parms
,
19571 TYPE_TI_TEMPLATE (parm
),
19573 ? tf_warning_or_error
19575 /*require_all_args=*/true,
19576 /*use_default_args=*/false)
19577 == error_mark_node
)
19580 /* Deduce arguments T, i from TT<T> or TT<i>.
19581 We check each element of PARMVEC and ARGVEC individually
19582 rather than the whole TREE_VEC since they can have
19583 different number of elements. */
19585 parmvec
= expand_template_argument_pack (parmvec
);
19586 argvec
= expand_template_argument_pack (argvec
);
19588 len
= TREE_VEC_LENGTH (parmvec
);
19590 /* Check if the parameters end in a pack, making them
19593 && PACK_EXPANSION_P (TREE_VEC_ELT (parmvec
, len
- 1)))
19594 parm_variadic_p
= 1;
19596 for (i
= 0; i
< len
- parm_variadic_p
; ++i
)
19597 /* If the template argument list of P contains a pack
19598 expansion that is not the last template argument, the
19599 entire template argument list is a non-deduced
19601 if (PACK_EXPANSION_P (TREE_VEC_ELT (parmvec
, i
)))
19602 return unify_success (explain_p
);
19604 if (TREE_VEC_LENGTH (argvec
) < len
- parm_variadic_p
)
19605 return unify_too_few_arguments (explain_p
,
19606 TREE_VEC_LENGTH (argvec
), len
);
19608 for (i
= 0; i
< len
- parm_variadic_p
; ++i
)
19610 RECUR_AND_CHECK_FAILURE (tparms
, targs
,
19611 TREE_VEC_ELT (parmvec
, i
),
19612 TREE_VEC_ELT (argvec
, i
),
19613 UNIFY_ALLOW_NONE
, explain_p
);
19616 if (parm_variadic_p
19617 && unify_pack_expansion (tparms
, targs
,
19620 /*subr=*/true, explain_p
))
19623 arg
= TYPE_TI_TEMPLATE (arg
);
19625 /* Fall through to deduce template name. */
19628 if (TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
19629 || TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
19631 /* Deduce template name TT from TT, TT<>, TT<T> and TT<i>. */
19633 /* Simple cases: Value already set, does match or doesn't. */
19634 if (targ
!= NULL_TREE
&& template_args_equal (targ
, arg
))
19635 return unify_success (explain_p
);
19637 return unify_inconsistency (explain_p
, parm
, targ
, arg
);
19641 /* If PARM is `const T' and ARG is only `int', we don't have
19642 a match unless we are allowing additional qualification.
19643 If ARG is `const int' and PARM is just `T' that's OK;
19644 that binds `const int' to `T'. */
19645 if (!check_cv_quals_for_unify (strict_in
| UNIFY_ALLOW_LESS_CV_QUAL
,
19647 return unify_cv_qual_mismatch (explain_p
, parm
, arg
);
19649 /* Consider the case where ARG is `const volatile int' and
19650 PARM is `const T'. Then, T should be `volatile int'. */
19651 arg
= cp_build_qualified_type_real
19652 (arg
, cp_type_quals (arg
) & ~cp_type_quals (parm
), tf_none
);
19653 if (arg
== error_mark_node
)
19654 return unify_invalid (explain_p
);
19656 /* Simple cases: Value already set, does match or doesn't. */
19657 if (targ
!= NULL_TREE
&& same_type_p (targ
, arg
))
19658 return unify_success (explain_p
);
19660 return unify_inconsistency (explain_p
, parm
, targ
, arg
);
19662 /* Make sure that ARG is not a variable-sized array. (Note
19663 that were talking about variable-sized arrays (like
19664 `int[n]'), rather than arrays of unknown size (like
19665 `int[]').) We'll get very confused by such a type since
19666 the bound of the array is not constant, and therefore
19667 not mangleable. Besides, such types are not allowed in
19668 ISO C++, so we can do as we please here. We do allow
19669 them for 'auto' deduction, since that isn't ABI-exposed. */
19670 if (!is_auto (parm
) && variably_modified_type_p (arg
, NULL_TREE
))
19671 return unify_vla_arg (explain_p
, arg
);
19673 /* Strip typedefs as in convert_template_argument. */
19674 arg
= canonicalize_type_argument (arg
, tf_none
);
19677 /* If ARG is a parameter pack or an expansion, we cannot unify
19678 against it unless PARM is also a parameter pack. */
19679 if ((template_parameter_pack_p (arg
) || PACK_EXPANSION_P (arg
))
19680 && !template_parameter_pack_p (parm
))
19681 return unify_parameter_pack_mismatch (explain_p
, parm
, arg
);
19683 /* If the argument deduction results is a METHOD_TYPE,
19684 then there is a problem.
19685 METHOD_TYPE doesn't map to any real C++ type the result of
19686 the deduction can not be of that type. */
19687 if (TREE_CODE (arg
) == METHOD_TYPE
)
19688 return unify_method_type_error (explain_p
, arg
);
19690 TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
) = arg
;
19691 return unify_success (explain_p
);
19693 case TEMPLATE_PARM_INDEX
:
19694 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, 0));
19695 if (error_operand_p (tparm
))
19696 return unify_invalid (explain_p
);
19698 if (TEMPLATE_PARM_LEVEL (parm
)
19699 != template_decl_level (tparm
))
19701 /* The PARM is not one we're trying to unify. Just check
19702 to see if it matches ARG. */
19703 int result
= !(TREE_CODE (arg
) == TREE_CODE (parm
)
19704 && cp_tree_equal (parm
, arg
));
19706 unify_expression_unequal (explain_p
, parm
, arg
);
19710 idx
= TEMPLATE_PARM_IDX (parm
);
19711 targ
= TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
);
19715 int x
= !cp_tree_equal (targ
, arg
);
19717 unify_inconsistency (explain_p
, parm
, targ
, arg
);
19721 /* [temp.deduct.type] If, in the declaration of a function template
19722 with a non-type template-parameter, the non-type
19723 template-parameter is used in an expression in the function
19724 parameter-list and, if the corresponding template-argument is
19725 deduced, the template-argument type shall match the type of the
19726 template-parameter exactly, except that a template-argument
19727 deduced from an array bound may be of any integral type.
19728 The non-type parameter might use already deduced type parameters. */
19729 tparm
= tsubst (TREE_TYPE (parm
), targs
, 0, NULL_TREE
);
19730 if (!TREE_TYPE (arg
))
19731 /* Template-parameter dependent expression. Just accept it for now.
19732 It will later be processed in convert_template_argument. */
19734 else if (same_type_p (TREE_TYPE (arg
), tparm
))
19736 else if ((strict
& UNIFY_ALLOW_INTEGER
)
19737 && CP_INTEGRAL_TYPE_P (tparm
))
19738 /* Convert the ARG to the type of PARM; the deduced non-type
19739 template argument must exactly match the types of the
19740 corresponding parameter. */
19741 arg
= fold (build_nop (tparm
, arg
));
19742 else if (uses_template_parms (tparm
))
19743 /* We haven't deduced the type of this parameter yet. Try again
19745 return unify_success (explain_p
);
19747 return unify_type_mismatch (explain_p
, tparm
, TREE_TYPE (arg
));
19749 /* If ARG is a parameter pack or an expansion, we cannot unify
19750 against it unless PARM is also a parameter pack. */
19751 if ((template_parameter_pack_p (arg
) || PACK_EXPANSION_P (arg
))
19752 && !TEMPLATE_PARM_PARAMETER_PACK (parm
))
19753 return unify_parameter_pack_mismatch (explain_p
, parm
, arg
);
19756 bool removed_attr
= false;
19757 arg
= strip_typedefs_expr (arg
, &removed_attr
);
19759 TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
) = arg
;
19760 return unify_success (explain_p
);
19764 /* A pointer-to-member constant can be unified only with
19765 another constant. */
19766 if (TREE_CODE (arg
) != PTRMEM_CST
)
19767 return unify_ptrmem_cst_mismatch (explain_p
, parm
, arg
);
19769 /* Just unify the class member. It would be useless (and possibly
19770 wrong, depending on the strict flags) to unify also
19771 PTRMEM_CST_CLASS, because we want to be sure that both parm and
19772 arg refer to the same variable, even if through different
19773 classes. For instance:
19775 struct A { int x; };
19778 Unification of &A::x and &B::x must succeed. */
19779 return unify (tparms
, targs
, PTRMEM_CST_MEMBER (parm
),
19780 PTRMEM_CST_MEMBER (arg
), strict
, explain_p
);
19785 if (!TYPE_PTR_P (arg
))
19786 return unify_type_mismatch (explain_p
, parm
, arg
);
19788 /* [temp.deduct.call]
19790 A can be another pointer or pointer to member type that can
19791 be converted to the deduced A via a qualification
19792 conversion (_conv.qual_).
19794 We pass down STRICT here rather than UNIFY_ALLOW_NONE.
19795 This will allow for additional cv-qualification of the
19796 pointed-to types if appropriate. */
19798 if (TREE_CODE (TREE_TYPE (arg
)) == RECORD_TYPE
)
19799 /* The derived-to-base conversion only persists through one
19800 level of pointers. */
19801 strict
|= (strict_in
& UNIFY_ALLOW_DERIVED
);
19803 return unify (tparms
, targs
, TREE_TYPE (parm
),
19804 TREE_TYPE (arg
), strict
, explain_p
);
19807 case REFERENCE_TYPE
:
19808 if (TREE_CODE (arg
) != REFERENCE_TYPE
)
19809 return unify_type_mismatch (explain_p
, parm
, arg
);
19810 return unify (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
19811 strict
& UNIFY_ALLOW_MORE_CV_QUAL
, explain_p
);
19814 if (TREE_CODE (arg
) != ARRAY_TYPE
)
19815 return unify_type_mismatch (explain_p
, parm
, arg
);
19816 if ((TYPE_DOMAIN (parm
) == NULL_TREE
)
19817 != (TYPE_DOMAIN (arg
) == NULL_TREE
))
19818 return unify_type_mismatch (explain_p
, parm
, arg
);
19819 RECUR_AND_CHECK_FAILURE (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
19820 strict
& UNIFY_ALLOW_MORE_CV_QUAL
, explain_p
);
19821 if (TYPE_DOMAIN (parm
) != NULL_TREE
)
19822 return unify_array_domain (tparms
, targs
, TYPE_DOMAIN (parm
),
19823 TYPE_DOMAIN (arg
), explain_p
);
19824 return unify_success (explain_p
);
19831 case ENUMERAL_TYPE
:
19834 if (TREE_CODE (arg
) != TREE_CODE (parm
))
19835 return unify_type_mismatch (explain_p
, parm
, arg
);
19837 /* We have already checked cv-qualification at the top of the
19839 if (!same_type_ignoring_top_level_qualifiers_p (arg
, parm
))
19840 return unify_type_mismatch (explain_p
, parm
, arg
);
19842 /* As far as unification is concerned, this wins. Later checks
19843 will invalidate it if necessary. */
19844 return unify_success (explain_p
);
19846 /* Types INTEGER_CST and MINUS_EXPR can come from array bounds. */
19847 /* Type INTEGER_CST can come from ordinary constant template args. */
19849 while (TREE_CODE (arg
) == NOP_EXPR
)
19850 arg
= TREE_OPERAND (arg
, 0);
19852 if (TREE_CODE (arg
) != INTEGER_CST
)
19853 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
19854 return (tree_int_cst_equal (parm
, arg
)
19855 ? unify_success (explain_p
)
19856 : unify_template_argument_mismatch (explain_p
, parm
, arg
));
19860 int i
, len
, argslen
;
19861 int parm_variadic_p
= 0;
19863 if (TREE_CODE (arg
) != TREE_VEC
)
19864 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
19866 len
= TREE_VEC_LENGTH (parm
);
19867 argslen
= TREE_VEC_LENGTH (arg
);
19869 /* Check for pack expansions in the parameters. */
19870 for (i
= 0; i
< len
; ++i
)
19872 if (PACK_EXPANSION_P (TREE_VEC_ELT (parm
, i
)))
19875 /* We can unify against something with a trailing
19877 parm_variadic_p
= 1;
19879 /* [temp.deduct.type]/9: If the template argument list of
19880 P contains a pack expansion that is not the last
19881 template argument, the entire template argument list
19882 is a non-deduced context. */
19883 return unify_success (explain_p
);
19887 /* If we don't have enough arguments to satisfy the parameters
19888 (not counting the pack expression at the end), or we have
19889 too many arguments for a parameter list that doesn't end in
19890 a pack expression, we can't unify. */
19891 if (parm_variadic_p
19892 ? argslen
< len
- parm_variadic_p
19894 return unify_arity (explain_p
, TREE_VEC_LENGTH (arg
), len
);
19896 /* Unify all of the parameters that precede the (optional)
19897 pack expression. */
19898 for (i
= 0; i
< len
- parm_variadic_p
; ++i
)
19900 RECUR_AND_CHECK_FAILURE (tparms
, targs
,
19901 TREE_VEC_ELT (parm
, i
),
19902 TREE_VEC_ELT (arg
, i
),
19903 UNIFY_ALLOW_NONE
, explain_p
);
19905 if (parm_variadic_p
)
19906 return unify_pack_expansion (tparms
, targs
, parm
, arg
,
19908 /*subr=*/true, explain_p
);
19909 return unify_success (explain_p
);
19914 if (TREE_CODE (arg
) != TREE_CODE (parm
))
19915 return unify_type_mismatch (explain_p
, parm
, arg
);
19917 if (TYPE_PTRMEMFUNC_P (parm
))
19919 if (!TYPE_PTRMEMFUNC_P (arg
))
19920 return unify_type_mismatch (explain_p
, parm
, arg
);
19922 return unify (tparms
, targs
,
19923 TYPE_PTRMEMFUNC_FN_TYPE (parm
),
19924 TYPE_PTRMEMFUNC_FN_TYPE (arg
),
19925 strict
, explain_p
);
19927 else if (TYPE_PTRMEMFUNC_P (arg
))
19928 return unify_type_mismatch (explain_p
, parm
, arg
);
19930 if (CLASSTYPE_TEMPLATE_INFO (parm
))
19932 tree t
= NULL_TREE
;
19934 if (strict_in
& UNIFY_ALLOW_DERIVED
)
19936 /* First, we try to unify the PARM and ARG directly. */
19937 t
= try_class_unification (tparms
, targs
,
19938 parm
, arg
, explain_p
);
19942 /* Fallback to the special case allowed in
19943 [temp.deduct.call]:
19945 If P is a class, and P has the form
19946 template-id, then A can be a derived class of
19947 the deduced A. Likewise, if P is a pointer to
19948 a class of the form template-id, A can be a
19949 pointer to a derived class pointed to by the
19951 enum template_base_result r
;
19952 r
= get_template_base (tparms
, targs
, parm
, arg
,
19957 /* Don't give the derived diagnostic if we're
19958 already dealing with the same template. */
19960 = (CLASSTYPE_TEMPLATE_INFO (arg
)
19961 && (CLASSTYPE_TI_TEMPLATE (parm
)
19962 == CLASSTYPE_TI_TEMPLATE (arg
)));
19963 return unify_no_common_base (explain_p
&& !same_template
,
19968 else if (CLASSTYPE_TEMPLATE_INFO (arg
)
19969 && (CLASSTYPE_TI_TEMPLATE (parm
)
19970 == CLASSTYPE_TI_TEMPLATE (arg
)))
19971 /* Perhaps PARM is something like S<U> and ARG is S<int>.
19972 Then, we should unify `int' and `U'. */
19975 /* There's no chance of unification succeeding. */
19976 return unify_type_mismatch (explain_p
, parm
, arg
);
19978 return unify (tparms
, targs
, CLASSTYPE_TI_ARGS (parm
),
19979 CLASSTYPE_TI_ARGS (t
), UNIFY_ALLOW_NONE
, explain_p
);
19981 else if (!same_type_ignoring_top_level_qualifiers_p (parm
, arg
))
19982 return unify_type_mismatch (explain_p
, parm
, arg
);
19983 return unify_success (explain_p
);
19986 case FUNCTION_TYPE
:
19988 unsigned int nargs
;
19993 if (TREE_CODE (arg
) != TREE_CODE (parm
))
19994 return unify_type_mismatch (explain_p
, parm
, arg
);
19996 /* CV qualifications for methods can never be deduced, they must
19997 match exactly. We need to check them explicitly here,
19998 because type_unification_real treats them as any other
19999 cv-qualified parameter. */
20000 if (TREE_CODE (parm
) == METHOD_TYPE
20001 && (!check_cv_quals_for_unify
20003 class_of_this_parm (arg
),
20004 class_of_this_parm (parm
))))
20005 return unify_cv_qual_mismatch (explain_p
, parm
, arg
);
20007 RECUR_AND_CHECK_FAILURE (tparms
, targs
, TREE_TYPE (parm
),
20008 TREE_TYPE (arg
), UNIFY_ALLOW_NONE
, explain_p
);
20010 nargs
= list_length (TYPE_ARG_TYPES (arg
));
20011 args
= XALLOCAVEC (tree
, nargs
);
20012 for (a
= TYPE_ARG_TYPES (arg
), i
= 0;
20013 a
!= NULL_TREE
&& a
!= void_list_node
;
20014 a
= TREE_CHAIN (a
), ++i
)
20015 args
[i
] = TREE_VALUE (a
);
20018 return type_unification_real (tparms
, targs
, TYPE_ARG_TYPES (parm
),
20019 args
, nargs
, 1, DEDUCE_EXACT
,
20020 LOOKUP_NORMAL
, NULL
, explain_p
);
20024 /* Unify a pointer to member with a pointer to member function, which
20025 deduces the type of the member as a function type. */
20026 if (TYPE_PTRMEMFUNC_P (arg
))
20028 /* Check top-level cv qualifiers */
20029 if (!check_cv_quals_for_unify (UNIFY_ALLOW_NONE
, arg
, parm
))
20030 return unify_cv_qual_mismatch (explain_p
, parm
, arg
);
20032 RECUR_AND_CHECK_FAILURE (tparms
, targs
, TYPE_OFFSET_BASETYPE (parm
),
20033 TYPE_PTRMEMFUNC_OBJECT_TYPE (arg
),
20034 UNIFY_ALLOW_NONE
, explain_p
);
20036 /* Determine the type of the function we are unifying against. */
20037 tree fntype
= static_fn_type (arg
);
20039 return unify (tparms
, targs
, TREE_TYPE (parm
), fntype
, strict
, explain_p
);
20042 if (TREE_CODE (arg
) != OFFSET_TYPE
)
20043 return unify_type_mismatch (explain_p
, parm
, arg
);
20044 RECUR_AND_CHECK_FAILURE (tparms
, targs
, TYPE_OFFSET_BASETYPE (parm
),
20045 TYPE_OFFSET_BASETYPE (arg
),
20046 UNIFY_ALLOW_NONE
, explain_p
);
20047 return unify (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
20048 strict
, explain_p
);
20051 if (DECL_TEMPLATE_PARM_P (parm
))
20052 return unify (tparms
, targs
, DECL_INITIAL (parm
), arg
, strict
, explain_p
);
20053 if (arg
!= scalar_constant_value (parm
))
20054 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
20055 return unify_success (explain_p
);
20058 case TEMPLATE_DECL
:
20059 /* Matched cases are handled by the ARG == PARM test above. */
20060 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
20063 /* We might get a variable as a non-type template argument in parm if the
20064 corresponding parameter is type-dependent. Make any necessary
20065 adjustments based on whether arg is a reference. */
20066 if (CONSTANT_CLASS_P (arg
))
20067 parm
= fold_non_dependent_expr (parm
);
20068 else if (REFERENCE_REF_P (arg
))
20070 tree sub
= TREE_OPERAND (arg
, 0);
20072 if (TREE_CODE (sub
) == ADDR_EXPR
)
20073 arg
= TREE_OPERAND (sub
, 0);
20075 /* Now use the normal expression code to check whether they match. */
20078 case TYPE_ARGUMENT_PACK
:
20079 case NONTYPE_ARGUMENT_PACK
:
20080 return unify (tparms
, targs
, ARGUMENT_PACK_ARGS (parm
),
20081 ARGUMENT_PACK_ARGS (arg
), strict
, explain_p
);
20084 case DECLTYPE_TYPE
:
20085 case UNDERLYING_TYPE
:
20086 /* Cannot deduce anything from TYPEOF_TYPE, DECLTYPE_TYPE,
20087 or UNDERLYING_TYPE nodes. */
20088 return unify_success (explain_p
);
20091 /* Unification fails if we hit an error node. */
20092 return unify_invalid (explain_p
);
20095 if (REFERENCE_REF_P (parm
))
20097 if (REFERENCE_REF_P (arg
))
20098 arg
= TREE_OPERAND (arg
, 0);
20099 return unify (tparms
, targs
, TREE_OPERAND (parm
, 0), arg
,
20100 strict
, explain_p
);
20105 /* An unresolved overload is a nondeduced context. */
20106 if (is_overloaded_fn (parm
) || type_unknown_p (parm
))
20107 return unify_success (explain_p
);
20108 gcc_assert (EXPR_P (parm
));
20110 /* We must be looking at an expression. This can happen with
20114 void foo(S<I>, S<I + 2>);
20116 This is a "nondeduced context":
20120 The nondeduced contexts are:
20122 --A type that is a template-id in which one or more of
20123 the template-arguments is an expression that references
20124 a template-parameter.
20126 In these cases, we assume deduction succeeded, but don't
20127 actually infer any unifications. */
20129 if (!uses_template_parms (parm
)
20130 && !template_args_equal (parm
, arg
))
20131 return unify_expression_unequal (explain_p
, parm
, arg
);
20133 return unify_success (explain_p
);
20136 #undef RECUR_AND_CHECK_FAILURE
20138 /* Note that DECL can be defined in this translation unit, if
20142 mark_definable (tree decl
)
20145 DECL_NOT_REALLY_EXTERN (decl
) = 1;
20146 FOR_EACH_CLONE (clone
, decl
)
20147 DECL_NOT_REALLY_EXTERN (clone
) = 1;
20150 /* Called if RESULT is explicitly instantiated, or is a member of an
20151 explicitly instantiated class. */
20154 mark_decl_instantiated (tree result
, int extern_p
)
20156 SET_DECL_EXPLICIT_INSTANTIATION (result
);
20158 /* If this entity has already been written out, it's too late to
20159 make any modifications. */
20160 if (TREE_ASM_WRITTEN (result
))
20163 /* For anonymous namespace we don't need to do anything. */
20164 if (decl_anon_ns_mem_p (result
))
20166 gcc_assert (!TREE_PUBLIC (result
));
20170 if (TREE_CODE (result
) != FUNCTION_DECL
)
20171 /* The TREE_PUBLIC flag for function declarations will have been
20172 set correctly by tsubst. */
20173 TREE_PUBLIC (result
) = 1;
20175 /* This might have been set by an earlier implicit instantiation. */
20176 DECL_COMDAT (result
) = 0;
20179 DECL_NOT_REALLY_EXTERN (result
) = 0;
20182 mark_definable (result
);
20183 mark_needed (result
);
20184 /* Always make artificials weak. */
20185 if (DECL_ARTIFICIAL (result
) && flag_weak
)
20186 comdat_linkage (result
);
20187 /* For WIN32 we also want to put explicit instantiations in
20188 linkonce sections. */
20189 else if (TREE_PUBLIC (result
))
20190 maybe_make_one_only (result
);
20193 /* If EXTERN_P, then this function will not be emitted -- unless
20194 followed by an explicit instantiation, at which point its linkage
20195 will be adjusted. If !EXTERN_P, then this function will be
20196 emitted here. In neither circumstance do we want
20197 import_export_decl to adjust the linkage. */
20198 DECL_INTERFACE_KNOWN (result
) = 1;
20201 /* Subroutine of more_specialized_fn: check whether TARGS is missing any
20202 important template arguments. If any are missing, we check whether
20203 they're important by using error_mark_node for substituting into any
20204 args that were used for partial ordering (the ones between ARGS and END)
20205 and seeing if it bubbles up. */
20208 check_undeduced_parms (tree targs
, tree args
, tree end
)
20210 bool found
= false;
20212 for (i
= TREE_VEC_LENGTH (targs
) - 1; i
>= 0; --i
)
20213 if (TREE_VEC_ELT (targs
, i
) == NULL_TREE
)
20216 TREE_VEC_ELT (targs
, i
) = error_mark_node
;
20220 tree substed
= tsubst_arg_types (args
, targs
, end
, tf_none
, NULL_TREE
);
20221 if (substed
== error_mark_node
)
20227 /* Given two function templates PAT1 and PAT2, return:
20229 1 if PAT1 is more specialized than PAT2 as described in [temp.func.order].
20230 -1 if PAT2 is more specialized than PAT1.
20231 0 if neither is more specialized.
20233 LEN indicates the number of parameters we should consider
20234 (defaulted parameters should not be considered).
20236 The 1998 std underspecified function template partial ordering, and
20237 DR214 addresses the issue. We take pairs of arguments, one from
20238 each of the templates, and deduce them against each other. One of
20239 the templates will be more specialized if all the *other*
20240 template's arguments deduce against its arguments and at least one
20241 of its arguments *does* *not* deduce against the other template's
20242 corresponding argument. Deduction is done as for class templates.
20243 The arguments used in deduction have reference and top level cv
20244 qualifiers removed. Iff both arguments were originally reference
20245 types *and* deduction succeeds in both directions, an lvalue reference
20246 wins against an rvalue reference and otherwise the template
20247 with the more cv-qualified argument wins for that pairing (if
20248 neither is more cv-qualified, they both are equal). Unlike regular
20249 deduction, after all the arguments have been deduced in this way,
20250 we do *not* verify the deduced template argument values can be
20251 substituted into non-deduced contexts.
20253 The logic can be a bit confusing here, because we look at deduce1 and
20254 targs1 to see if pat2 is at least as specialized, and vice versa; if we
20255 can find template arguments for pat1 to make arg1 look like arg2, that
20256 means that arg2 is at least as specialized as arg1. */
20259 more_specialized_fn (tree pat1
, tree pat2
, int len
)
20261 tree decl1
= DECL_TEMPLATE_RESULT (pat1
);
20262 tree decl2
= DECL_TEMPLATE_RESULT (pat2
);
20263 tree targs1
= make_tree_vec (DECL_NTPARMS (pat1
));
20264 tree targs2
= make_tree_vec (DECL_NTPARMS (pat2
));
20265 tree tparms1
= DECL_INNERMOST_TEMPLATE_PARMS (pat1
);
20266 tree tparms2
= DECL_INNERMOST_TEMPLATE_PARMS (pat2
);
20267 tree args1
= TYPE_ARG_TYPES (TREE_TYPE (decl1
));
20268 tree args2
= TYPE_ARG_TYPES (TREE_TYPE (decl2
));
20269 tree origs1
, origs2
;
20270 bool lose1
= false;
20271 bool lose2
= false;
20273 /* Remove the this parameter from non-static member functions. If
20274 one is a non-static member function and the other is not a static
20275 member function, remove the first parameter from that function
20276 also. This situation occurs for operator functions where we
20277 locate both a member function (with this pointer) and non-member
20278 operator (with explicit first operand). */
20279 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl1
))
20281 len
--; /* LEN is the number of significant arguments for DECL1 */
20282 args1
= TREE_CHAIN (args1
);
20283 if (!DECL_STATIC_FUNCTION_P (decl2
))
20284 args2
= TREE_CHAIN (args2
);
20286 else if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl2
))
20288 args2
= TREE_CHAIN (args2
);
20289 if (!DECL_STATIC_FUNCTION_P (decl1
))
20292 args1
= TREE_CHAIN (args1
);
20296 /* If only one is a conversion operator, they are unordered. */
20297 if (DECL_CONV_FN_P (decl1
) != DECL_CONV_FN_P (decl2
))
20300 /* Consider the return type for a conversion function */
20301 if (DECL_CONV_FN_P (decl1
))
20303 args1
= tree_cons (NULL_TREE
, TREE_TYPE (TREE_TYPE (decl1
)), args1
);
20304 args2
= tree_cons (NULL_TREE
, TREE_TYPE (TREE_TYPE (decl2
)), args2
);
20308 processing_template_decl
++;
20314 /* Stop when an ellipsis is seen. */
20315 && args1
!= NULL_TREE
&& args2
!= NULL_TREE
)
20317 tree arg1
= TREE_VALUE (args1
);
20318 tree arg2
= TREE_VALUE (args2
);
20319 int deduce1
, deduce2
;
20325 if (TREE_CODE (arg1
) == TYPE_PACK_EXPANSION
20326 && TREE_CODE (arg2
) == TYPE_PACK_EXPANSION
)
20328 /* When both arguments are pack expansions, we need only
20329 unify the patterns themselves. */
20330 arg1
= PACK_EXPANSION_PATTERN (arg1
);
20331 arg2
= PACK_EXPANSION_PATTERN (arg2
);
20333 /* This is the last comparison we need to do. */
20337 if (TREE_CODE (arg1
) == REFERENCE_TYPE
)
20339 ref1
= TYPE_REF_IS_RVALUE (arg1
) + 1;
20340 arg1
= TREE_TYPE (arg1
);
20341 quals1
= cp_type_quals (arg1
);
20344 if (TREE_CODE (arg2
) == REFERENCE_TYPE
)
20346 ref2
= TYPE_REF_IS_RVALUE (arg2
) + 1;
20347 arg2
= TREE_TYPE (arg2
);
20348 quals2
= cp_type_quals (arg2
);
20351 arg1
= TYPE_MAIN_VARIANT (arg1
);
20352 arg2
= TYPE_MAIN_VARIANT (arg2
);
20354 if (TREE_CODE (arg1
) == TYPE_PACK_EXPANSION
)
20356 int i
, len2
= remaining_arguments (args2
);
20357 tree parmvec
= make_tree_vec (1);
20358 tree argvec
= make_tree_vec (len2
);
20361 /* Setup the parameter vector, which contains only ARG1. */
20362 TREE_VEC_ELT (parmvec
, 0) = arg1
;
20364 /* Setup the argument vector, which contains the remaining
20366 for (i
= 0; i
< len2
; i
++, ta
= TREE_CHAIN (ta
))
20367 TREE_VEC_ELT (argvec
, i
) = TREE_VALUE (ta
);
20369 deduce1
= (unify_pack_expansion (tparms1
, targs1
, parmvec
,
20370 argvec
, DEDUCE_EXACT
,
20371 /*subr=*/true, /*explain_p=*/false)
20374 /* We cannot deduce in the other direction, because ARG1 is
20375 a pack expansion but ARG2 is not. */
20378 else if (TREE_CODE (arg2
) == TYPE_PACK_EXPANSION
)
20380 int i
, len1
= remaining_arguments (args1
);
20381 tree parmvec
= make_tree_vec (1);
20382 tree argvec
= make_tree_vec (len1
);
20385 /* Setup the parameter vector, which contains only ARG1. */
20386 TREE_VEC_ELT (parmvec
, 0) = arg2
;
20388 /* Setup the argument vector, which contains the remaining
20390 for (i
= 0; i
< len1
; i
++, ta
= TREE_CHAIN (ta
))
20391 TREE_VEC_ELT (argvec
, i
) = TREE_VALUE (ta
);
20393 deduce2
= (unify_pack_expansion (tparms2
, targs2
, parmvec
,
20394 argvec
, DEDUCE_EXACT
,
20395 /*subr=*/true, /*explain_p=*/false)
20398 /* We cannot deduce in the other direction, because ARG2 is
20399 a pack expansion but ARG1 is not.*/
20405 /* The normal case, where neither argument is a pack
20407 deduce1
= (unify (tparms1
, targs1
, arg1
, arg2
,
20408 UNIFY_ALLOW_NONE
, /*explain_p=*/false)
20410 deduce2
= (unify (tparms2
, targs2
, arg2
, arg1
,
20411 UNIFY_ALLOW_NONE
, /*explain_p=*/false)
20415 /* If we couldn't deduce arguments for tparms1 to make arg1 match
20416 arg2, then arg2 is not as specialized as arg1. */
20422 /* "If, for a given type, deduction succeeds in both directions
20423 (i.e., the types are identical after the transformations above)
20424 and both P and A were reference types (before being replaced with
20425 the type referred to above):
20426 - if the type from the argument template was an lvalue reference and
20427 the type from the parameter template was not, the argument type is
20428 considered to be more specialized than the other; otherwise,
20429 - if the type from the argument template is more cv-qualified
20430 than the type from the parameter template (as described above),
20431 the argument type is considered to be more specialized than the other;
20433 - neither type is more specialized than the other." */
20435 if (deduce1
&& deduce2
)
20437 if (ref1
&& ref2
&& ref1
!= ref2
)
20444 else if (quals1
!= quals2
&& quals1
>= 0 && quals2
>= 0)
20446 if ((quals1
& quals2
) == quals2
)
20448 if ((quals1
& quals2
) == quals1
)
20453 if (lose1
&& lose2
)
20454 /* We've failed to deduce something in either direction.
20455 These must be unordered. */
20458 if (TREE_CODE (arg1
) == TYPE_PACK_EXPANSION
20459 || TREE_CODE (arg2
) == TYPE_PACK_EXPANSION
)
20460 /* We have already processed all of the arguments in our
20461 handing of the pack expansion type. */
20464 args1
= TREE_CHAIN (args1
);
20465 args2
= TREE_CHAIN (args2
);
20468 /* "In most cases, all template parameters must have values in order for
20469 deduction to succeed, but for partial ordering purposes a template
20470 parameter may remain without a value provided it is not used in the
20471 types being used for partial ordering."
20473 Thus, if we are missing any of the targs1 we need to substitute into
20474 origs1, then pat2 is not as specialized as pat1. This can happen when
20475 there is a nondeduced context. */
20476 if (!lose2
&& check_undeduced_parms (targs1
, origs1
, args1
))
20478 if (!lose1
&& check_undeduced_parms (targs2
, origs2
, args2
))
20481 processing_template_decl
--;
20483 /* If both deductions succeed, the partial ordering selects the more
20484 constrained template. */
20485 if (!lose1
&& !lose2
)
20487 tree c1
= get_constraints (DECL_TEMPLATE_RESULT (pat1
));
20488 tree c2
= get_constraints (DECL_TEMPLATE_RESULT (pat2
));
20489 lose1
= !subsumes_constraints (c1
, c2
);
20490 lose2
= !subsumes_constraints (c2
, c1
);
20493 /* All things being equal, if the next argument is a pack expansion
20494 for one function but not for the other, prefer the
20495 non-variadic function. FIXME this is bogus; see c++/41958. */
20497 && args1
&& TREE_VALUE (args1
)
20498 && args2
&& TREE_VALUE (args2
))
20500 lose1
= TREE_CODE (TREE_VALUE (args1
)) == TYPE_PACK_EXPANSION
;
20501 lose2
= TREE_CODE (TREE_VALUE (args2
)) == TYPE_PACK_EXPANSION
;
20504 if (lose1
== lose2
)
20512 /* Determine which of two partial specializations of TMPL is more
20515 PAT1 is a TREE_LIST whose TREE_VALUE is the TEMPLATE_DECL corresponding
20516 to the first partial specialization. The TREE_PURPOSE is the
20517 innermost set of template parameters for the partial
20518 specialization. PAT2 is similar, but for the second template.
20520 Return 1 if the first partial specialization is more specialized;
20521 -1 if the second is more specialized; 0 if neither is more
20524 See [temp.class.order] for information about determining which of
20525 two templates is more specialized. */
20528 more_specialized_partial_spec (tree tmpl
, tree pat1
, tree pat2
)
20532 bool any_deductions
= false;
20534 tree tmpl1
= TREE_VALUE (pat1
);
20535 tree tmpl2
= TREE_VALUE (pat2
);
20536 tree parms1
= DECL_INNERMOST_TEMPLATE_PARMS (tmpl1
);
20537 tree parms2
= DECL_INNERMOST_TEMPLATE_PARMS (tmpl2
);
20538 tree specargs1
= TI_ARGS (get_template_info (DECL_TEMPLATE_RESULT (tmpl1
)));
20539 tree specargs2
= TI_ARGS (get_template_info (DECL_TEMPLATE_RESULT (tmpl2
)));
20541 /* Just like what happens for functions, if we are ordering between
20542 different template specializations, we may encounter dependent
20543 types in the arguments, and we need our dependency check functions
20544 to behave correctly. */
20545 ++processing_template_decl
;
20546 targs
= get_partial_spec_bindings (tmpl
, parms1
, specargs1
, specargs2
);
20550 any_deductions
= true;
20553 targs
= get_partial_spec_bindings (tmpl
, parms2
, specargs2
, specargs1
);
20557 any_deductions
= true;
20559 --processing_template_decl
;
20561 /* If both deductions succeed, the partial ordering selects the more
20562 constrained template. */
20563 if (!winner
&& any_deductions
)
20564 return more_constrained (tmpl1
, tmpl2
);
20566 /* In the case of a tie where at least one of the templates
20567 has a parameter pack at the end, the template with the most
20568 non-packed parameters wins. */
20571 && (template_args_variadic_p (TREE_PURPOSE (pat1
))
20572 || template_args_variadic_p (TREE_PURPOSE (pat2
))))
20574 tree args1
= INNERMOST_TEMPLATE_ARGS (TREE_PURPOSE (pat1
));
20575 tree args2
= INNERMOST_TEMPLATE_ARGS (TREE_PURPOSE (pat2
));
20576 int len1
= TREE_VEC_LENGTH (args1
);
20577 int len2
= TREE_VEC_LENGTH (args2
);
20579 /* We don't count the pack expansion at the end. */
20580 if (template_args_variadic_p (TREE_PURPOSE (pat1
)))
20582 if (template_args_variadic_p (TREE_PURPOSE (pat2
)))
20587 else if (len1
< len2
)
20594 /* Return the template arguments that will produce the function signature
20595 DECL from the function template FN, with the explicit template
20596 arguments EXPLICIT_ARGS. If CHECK_RETTYPE is true, the return type must
20597 also match. Return NULL_TREE if no satisfactory arguments could be
20601 get_bindings (tree fn
, tree decl
, tree explicit_args
, bool check_rettype
)
20603 int ntparms
= DECL_NTPARMS (fn
);
20604 tree targs
= make_tree_vec (ntparms
);
20605 tree decl_type
= TREE_TYPE (decl
);
20606 tree decl_arg_types
;
20608 unsigned int nargs
, ix
;
20611 gcc_assert (decl
!= DECL_TEMPLATE_RESULT (fn
));
20613 /* Never do unification on the 'this' parameter. */
20614 decl_arg_types
= skip_artificial_parms_for (decl
,
20615 TYPE_ARG_TYPES (decl_type
));
20617 nargs
= list_length (decl_arg_types
);
20618 args
= XALLOCAVEC (tree
, nargs
);
20619 for (arg
= decl_arg_types
, ix
= 0;
20620 arg
!= NULL_TREE
&& arg
!= void_list_node
;
20621 arg
= TREE_CHAIN (arg
), ++ix
)
20622 args
[ix
] = TREE_VALUE (arg
);
20624 if (fn_type_unification (fn
, explicit_args
, targs
,
20626 (check_rettype
|| DECL_CONV_FN_P (fn
)
20627 ? TREE_TYPE (decl_type
) : NULL_TREE
),
20628 DEDUCE_EXACT
, LOOKUP_NORMAL
, /*explain_p=*/false,
20630 == error_mark_node
)
20636 /* Return the innermost template arguments that, when applied to a partial
20637 specialization of TMPL whose innermost template parameters are
20638 TPARMS, and whose specialization arguments are SPEC_ARGS, yield the
20641 For example, suppose we have:
20643 template <class T, class U> struct S {};
20644 template <class T> struct S<T*, int> {};
20646 Then, suppose we want to get `S<double*, int>'. The TPARMS will be
20647 {T}, the SPEC_ARGS will be {T*, int} and the ARGS will be {double*,
20648 int}. The resulting vector will be {double}, indicating that `T'
20649 is bound to `double'. */
20652 get_partial_spec_bindings (tree tmpl
, tree tparms
, tree spec_args
, tree args
)
20654 int i
, ntparms
= TREE_VEC_LENGTH (tparms
);
20656 tree innermost_deduced_args
;
20658 innermost_deduced_args
= make_tree_vec (ntparms
);
20659 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (args
))
20661 deduced_args
= copy_node (args
);
20662 SET_TMPL_ARGS_LEVEL (deduced_args
,
20663 TMPL_ARGS_DEPTH (deduced_args
),
20664 innermost_deduced_args
);
20667 deduced_args
= innermost_deduced_args
;
20669 if (unify (tparms
, deduced_args
,
20670 INNERMOST_TEMPLATE_ARGS (spec_args
),
20671 INNERMOST_TEMPLATE_ARGS (args
),
20672 UNIFY_ALLOW_NONE
, /*explain_p=*/false))
20675 for (i
= 0; i
< ntparms
; ++i
)
20676 if (! TREE_VEC_ELT (innermost_deduced_args
, i
))
20679 /* Verify that nondeduced template arguments agree with the type
20680 obtained from argument deduction.
20684 struct A { typedef int X; };
20685 template <class T, class U> struct C {};
20686 template <class T> struct C<T, typename T::X> {};
20688 Then with the instantiation `C<A, int>', we can deduce that
20689 `T' is `A' but unify () does not check whether `typename T::X'
20691 spec_args
= tsubst (spec_args
, deduced_args
, tf_none
, NULL_TREE
);
20692 spec_args
= coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (tmpl
),
20694 tf_none
, false, false);
20695 if (spec_args
== error_mark_node
20696 /* We only need to check the innermost arguments; the other
20697 arguments will always agree. */
20698 || !comp_template_args (INNERMOST_TEMPLATE_ARGS (spec_args
),
20699 INNERMOST_TEMPLATE_ARGS (args
)))
20702 /* Now that we have bindings for all of the template arguments,
20703 ensure that the arguments deduced for the template template
20704 parameters have compatible template parameter lists. See the use
20705 of template_template_parm_bindings_ok_p in fn_type_unification
20706 for more information. */
20707 if (!template_template_parm_bindings_ok_p (tparms
, deduced_args
))
20710 return deduced_args
;
20713 // Compare two function templates T1 and T2 by deducing bindings
20714 // from one against the other. If both deductions succeed, compare
20715 // constraints to see which is more constrained.
20717 more_specialized_inst (tree t1
, tree t2
)
20722 if (get_bindings (t1
, DECL_TEMPLATE_RESULT (t2
), NULL_TREE
, true))
20728 if (get_bindings (t2
, DECL_TEMPLATE_RESULT (t1
), NULL_TREE
, true))
20734 // If both deductions succeed, then one may be more constrained.
20735 if (count
== 2 && fate
== 0)
20736 fate
= more_constrained (t1
, t2
);
20741 /* TEMPLATES is a TREE_LIST. Each TREE_VALUE is a TEMPLATE_DECL.
20742 Return the TREE_LIST node with the most specialized template, if
20743 any. If there is no most specialized template, the error_mark_node
20746 Note that this function does not look at, or modify, the
20747 TREE_PURPOSE or TREE_TYPE of any of the nodes. Since the node
20748 returned is one of the elements of INSTANTIATIONS, callers may
20749 store information in the TREE_PURPOSE or TREE_TYPE of the nodes,
20750 and retrieve it from the value returned. */
20753 most_specialized_instantiation (tree templates
)
20757 ++processing_template_decl
;
20760 for (fn
= TREE_CHAIN (templates
); fn
; fn
= TREE_CHAIN (fn
))
20762 int fate
= more_specialized_inst (TREE_VALUE (champ
), TREE_VALUE (fn
));
20767 /* Equally specialized, move to next function. If there
20768 is no next function, nothing's most specialized. */
20769 fn
= TREE_CHAIN (fn
);
20777 /* Now verify that champ is better than everything earlier in the
20778 instantiation list. */
20779 for (fn
= templates
; fn
!= champ
; fn
= TREE_CHAIN (fn
)) {
20780 if (more_specialized_inst (TREE_VALUE (champ
), TREE_VALUE (fn
)) != 1)
20787 processing_template_decl
--;
20790 return error_mark_node
;
20795 /* If DECL is a specialization of some template, return the most
20796 general such template. Otherwise, returns NULL_TREE.
20798 For example, given:
20800 template <class T> struct S { template <class U> void f(U); };
20802 if TMPL is `template <class U> void S<int>::f(U)' this will return
20803 the full template. This function will not trace past partial
20804 specializations, however. For example, given in addition:
20806 template <class T> struct S<T*> { template <class U> void f(U); };
20808 if TMPL is `template <class U> void S<int*>::f(U)' this will return
20809 `template <class T> template <class U> S<T*>::f(U)'. */
20812 most_general_template (tree decl
)
20814 if (TREE_CODE (decl
) != TEMPLATE_DECL
)
20816 if (tree tinfo
= get_template_info (decl
))
20817 decl
= TI_TEMPLATE (tinfo
);
20818 /* The TI_TEMPLATE can be an IDENTIFIER_NODE for a
20819 template friend, or a FIELD_DECL for a capture pack. */
20820 if (TREE_CODE (decl
) != TEMPLATE_DECL
)
20824 /* Look for more and more general templates. */
20825 while (DECL_LANG_SPECIFIC (decl
) && DECL_TEMPLATE_INFO (decl
))
20827 /* The DECL_TI_TEMPLATE can be an IDENTIFIER_NODE in some cases.
20828 (See cp-tree.h for details.) */
20829 if (TREE_CODE (DECL_TI_TEMPLATE (decl
)) != TEMPLATE_DECL
)
20832 if (CLASS_TYPE_P (TREE_TYPE (decl
))
20833 && !TYPE_DECL_ALIAS_P (TYPE_NAME (TREE_TYPE (decl
)))
20834 && CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_TYPE (decl
)))
20837 /* Stop if we run into an explicitly specialized class template. */
20838 if (!DECL_NAMESPACE_SCOPE_P (decl
)
20839 && DECL_CONTEXT (decl
)
20840 && CLASSTYPE_TEMPLATE_SPECIALIZATION (DECL_CONTEXT (decl
)))
20843 decl
= DECL_TI_TEMPLATE (decl
);
20849 /* True iff the TEMPLATE_DECL tmpl is a partial specialization. */
20852 partial_specialization_p (tree tmpl
)
20854 /* Any specialization has DECL_TEMPLATE_SPECIALIZATION. */
20855 if (!DECL_TEMPLATE_SPECIALIZATION (tmpl
))
20857 tree t
= DECL_TI_TEMPLATE (tmpl
);
20858 /* A specialization that fully specializes one of the containing classes is
20859 not a partial specialization. */
20860 return (list_length (DECL_TEMPLATE_PARMS (tmpl
))
20861 == list_length (DECL_TEMPLATE_PARMS (t
)));
20864 /* If TMPL is a partial specialization, return the arguments for its primary
20868 impartial_args (tree tmpl
, tree args
)
20870 if (!partial_specialization_p (tmpl
))
20873 /* If TMPL is a partial specialization, we need to substitute to get
20874 the args for the primary template. */
20875 return tsubst_template_args (DECL_TI_ARGS (tmpl
), args
,
20876 tf_warning_or_error
, tmpl
);
20879 /* Return the most specialized of the template partial specializations
20880 which can produce TARGET, a specialization of some class or variable
20881 template. The value returned is actually a TREE_LIST; the TREE_VALUE is
20882 a TEMPLATE_DECL node corresponding to the partial specialization, while
20883 the TREE_PURPOSE is the set of template arguments that must be
20884 substituted into the template pattern in order to generate TARGET.
20886 If the choice of partial specialization is ambiguous, a diagnostic
20887 is issued, and the error_mark_node is returned. If there are no
20888 partial specializations matching TARGET, then NULL_TREE is
20889 returned, indicating that the primary template should be used. */
20892 most_specialized_partial_spec (tree target
, tsubst_flags_t complain
)
20894 tree list
= NULL_TREE
;
20899 tree outer_args
= NULL_TREE
;
20902 if (TYPE_P (target
))
20904 tree tinfo
= CLASSTYPE_TEMPLATE_INFO (target
);
20905 tmpl
= TI_TEMPLATE (tinfo
);
20906 args
= TI_ARGS (tinfo
);
20908 else if (TREE_CODE (target
) == TEMPLATE_ID_EXPR
)
20910 tmpl
= TREE_OPERAND (target
, 0);
20911 args
= TREE_OPERAND (target
, 1);
20913 else if (VAR_P (target
))
20915 tree tinfo
= DECL_TEMPLATE_INFO (target
);
20916 tmpl
= TI_TEMPLATE (tinfo
);
20917 args
= TI_ARGS (tinfo
);
20920 gcc_unreachable ();
20922 tree main_tmpl
= most_general_template (tmpl
);
20924 /* For determining which partial specialization to use, only the
20925 innermost args are interesting. */
20926 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (args
))
20928 outer_args
= strip_innermost_template_args (args
, 1);
20929 args
= INNERMOST_TEMPLATE_ARGS (args
);
20932 for (t
= DECL_TEMPLATE_SPECIALIZATIONS (main_tmpl
); t
; t
= TREE_CHAIN (t
))
20934 tree partial_spec_args
;
20936 tree spec_tmpl
= TREE_VALUE (t
);
20938 partial_spec_args
= TREE_PURPOSE (t
);
20940 ++processing_template_decl
;
20944 /* Discard the outer levels of args, and then substitute in the
20945 template args from the enclosing class. */
20946 partial_spec_args
= INNERMOST_TEMPLATE_ARGS (partial_spec_args
);
20947 partial_spec_args
= tsubst_template_args
20948 (partial_spec_args
, outer_args
, tf_none
, NULL_TREE
);
20950 /* And the same for the partial specialization TEMPLATE_DECL. */
20951 spec_tmpl
= tsubst (spec_tmpl
, outer_args
, tf_none
, NULL_TREE
);
20954 partial_spec_args
=
20955 coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (tmpl
),
20958 /*require_all_args=*/true,
20959 /*use_default_args=*/true);
20961 --processing_template_decl
;
20963 if (partial_spec_args
== error_mark_node
)
20964 return error_mark_node
;
20965 if (spec_tmpl
== error_mark_node
)
20966 return error_mark_node
;
20968 tree parms
= DECL_INNERMOST_TEMPLATE_PARMS (spec_tmpl
);
20969 spec_args
= get_partial_spec_bindings (tmpl
, parms
,
20975 spec_args
= add_to_template_args (outer_args
, spec_args
);
20977 /* Keep the candidate only if the constraints are satisfied,
20978 or if we're not compiling with concepts. */
20980 || constraints_satisfied_p (spec_tmpl
, spec_args
))
20982 list
= tree_cons (spec_args
, TREE_VALUE (t
), list
);
20983 TREE_TYPE (list
) = TREE_TYPE (t
);
20991 ambiguous_p
= false;
20994 t
= TREE_CHAIN (t
);
20995 for (; t
; t
= TREE_CHAIN (t
))
20997 fate
= more_specialized_partial_spec (tmpl
, champ
, t
);
21004 t
= TREE_CHAIN (t
);
21007 ambiguous_p
= true;
21016 for (t
= list
; t
&& t
!= champ
; t
= TREE_CHAIN (t
))
21018 fate
= more_specialized_partial_spec (tmpl
, champ
, t
);
21021 ambiguous_p
= true;
21029 char *spaces
= NULL
;
21030 if (!(complain
& tf_error
))
21031 return error_mark_node
;
21032 if (TYPE_P (target
))
21033 error ("ambiguous template instantiation for %q#T", target
);
21035 error ("ambiguous template instantiation for %q#D", target
);
21036 str
= ngettext ("candidate is:", "candidates are:", list_length (list
));
21037 for (t
= list
; t
; t
= TREE_CHAIN (t
))
21039 tree subst
= build_tree_list (TREE_VALUE (t
), TREE_PURPOSE (t
));
21040 inform (DECL_SOURCE_LOCATION (TREE_VALUE (t
)),
21041 "%s %#S", spaces
? spaces
: str
, subst
);
21042 spaces
= spaces
? spaces
: get_spaces (str
);
21045 return error_mark_node
;
21051 /* Explicitly instantiate DECL. */
21054 do_decl_instantiation (tree decl
, tree storage
)
21056 tree result
= NULL_TREE
;
21059 if (!decl
|| decl
== error_mark_node
)
21060 /* An error occurred, for which grokdeclarator has already issued
21061 an appropriate message. */
21063 else if (! DECL_LANG_SPECIFIC (decl
))
21065 error ("explicit instantiation of non-template %q#D", decl
);
21069 bool var_templ
= (DECL_TEMPLATE_INFO (decl
)
21070 && variable_template_p (DECL_TI_TEMPLATE (decl
)));
21072 if (VAR_P (decl
) && !var_templ
)
21074 /* There is an asymmetry here in the way VAR_DECLs and
21075 FUNCTION_DECLs are handled by grokdeclarator. In the case of
21076 the latter, the DECL we get back will be marked as a
21077 template instantiation, and the appropriate
21078 DECL_TEMPLATE_INFO will be set up. This does not happen for
21079 VAR_DECLs so we do the lookup here. Probably, grokdeclarator
21080 should handle VAR_DECLs as it currently handles
21082 if (!DECL_CLASS_SCOPE_P (decl
))
21084 error ("%qD is not a static data member of a class template", decl
);
21087 result
= lookup_field (DECL_CONTEXT (decl
), DECL_NAME (decl
), 0, false);
21088 if (!result
|| !VAR_P (result
))
21090 error ("no matching template for %qD found", decl
);
21093 if (!same_type_p (TREE_TYPE (result
), TREE_TYPE (decl
)))
21095 error ("type %qT for explicit instantiation %qD does not match "
21096 "declared type %qT", TREE_TYPE (result
), decl
,
21101 else if (TREE_CODE (decl
) != FUNCTION_DECL
&& !var_templ
)
21103 error ("explicit instantiation of %q#D", decl
);
21109 /* Check for various error cases. Note that if the explicit
21110 instantiation is valid the RESULT will currently be marked as an
21111 *implicit* instantiation; DECL_EXPLICIT_INSTANTIATION is not set
21112 until we get here. */
21114 if (DECL_TEMPLATE_SPECIALIZATION (result
))
21116 /* DR 259 [temp.spec].
21118 Both an explicit instantiation and a declaration of an explicit
21119 specialization shall not appear in a program unless the explicit
21120 instantiation follows a declaration of the explicit specialization.
21122 For a given set of template parameters, if an explicit
21123 instantiation of a template appears after a declaration of an
21124 explicit specialization for that template, the explicit
21125 instantiation has no effect. */
21128 else if (DECL_EXPLICIT_INSTANTIATION (result
))
21132 No program shall explicitly instantiate any template more
21135 We check DECL_NOT_REALLY_EXTERN so as not to complain when
21136 the first instantiation was `extern' and the second is not,
21137 and EXTERN_P for the opposite case. */
21138 if (DECL_NOT_REALLY_EXTERN (result
) && !extern_p
)
21139 permerror (input_location
, "duplicate explicit instantiation of %q#D", result
);
21140 /* If an "extern" explicit instantiation follows an ordinary
21141 explicit instantiation, the template is instantiated. */
21145 else if (!DECL_IMPLICIT_INSTANTIATION (result
))
21147 error ("no matching template for %qD found", result
);
21150 else if (!DECL_TEMPLATE_INFO (result
))
21152 permerror (input_location
, "explicit instantiation of non-template %q#D", result
);
21156 if (storage
== NULL_TREE
)
21158 else if (storage
== ridpointers
[(int) RID_EXTERN
])
21160 if (!in_system_header_at (input_location
) && (cxx_dialect
== cxx98
))
21161 pedwarn (input_location
, OPT_Wpedantic
,
21162 "ISO C++ 1998 forbids the use of %<extern%> on explicit "
21167 error ("storage class %qD applied to template instantiation", storage
);
21169 check_explicit_instantiation_namespace (result
);
21170 mark_decl_instantiated (result
, extern_p
);
21172 instantiate_decl (result
, /*defer_ok=*/1,
21173 /*expl_inst_class_mem_p=*/false);
21177 mark_class_instantiated (tree t
, int extern_p
)
21179 SET_CLASSTYPE_EXPLICIT_INSTANTIATION (t
);
21180 SET_CLASSTYPE_INTERFACE_KNOWN (t
);
21181 CLASSTYPE_INTERFACE_ONLY (t
) = extern_p
;
21182 TYPE_DECL_SUPPRESS_DEBUG (TYPE_NAME (t
)) = extern_p
;
21185 CLASSTYPE_DEBUG_REQUESTED (t
) = 1;
21186 rest_of_type_compilation (t
, 1);
21190 /* Called from do_type_instantiation through binding_table_foreach to
21191 do recursive instantiation for the type bound in ENTRY. */
21193 bt_instantiate_type_proc (binding_entry entry
, void *data
)
21195 tree storage
= *(tree
*) data
;
21197 if (MAYBE_CLASS_TYPE_P (entry
->type
)
21198 && !uses_template_parms (CLASSTYPE_TI_ARGS (entry
->type
)))
21199 do_type_instantiation (TYPE_MAIN_DECL (entry
->type
), storage
, 0);
21202 /* Called from do_type_instantiation to instantiate a member
21203 (a member function or a static member variable) of an
21204 explicitly instantiated class template. */
21206 instantiate_class_member (tree decl
, int extern_p
)
21208 mark_decl_instantiated (decl
, extern_p
);
21210 instantiate_decl (decl
, /*defer_ok=*/1,
21211 /*expl_inst_class_mem_p=*/true);
21214 /* Perform an explicit instantiation of template class T. STORAGE, if
21215 non-null, is the RID for extern, inline or static. COMPLAIN is
21216 nonzero if this is called from the parser, zero if called recursively,
21217 since the standard is unclear (as detailed below). */
21220 do_type_instantiation (tree t
, tree storage
, tsubst_flags_t complain
)
21225 int previous_instantiation_extern_p
= 0;
21227 if (TREE_CODE (t
) == TYPE_DECL
)
21230 if (! CLASS_TYPE_P (t
) || ! CLASSTYPE_TEMPLATE_INFO (t
))
21233 (TYPE_TEMPLATE_INFO (t
)) ? TYPE_TI_TEMPLATE (t
) : NULL
;
21235 error ("explicit instantiation of non-class template %qD", tmpl
);
21237 error ("explicit instantiation of non-template type %qT", t
);
21243 if (!COMPLETE_TYPE_P (t
))
21245 if (complain
& tf_error
)
21246 error ("explicit instantiation of %q#T before definition of template",
21251 if (storage
!= NULL_TREE
)
21253 if (!in_system_header_at (input_location
))
21255 if (storage
== ridpointers
[(int) RID_EXTERN
])
21257 if (cxx_dialect
== cxx98
)
21258 pedwarn (input_location
, OPT_Wpedantic
,
21259 "ISO C++ 1998 forbids the use of %<extern%> on "
21260 "explicit instantiations");
21263 pedwarn (input_location
, OPT_Wpedantic
,
21264 "ISO C++ forbids the use of %qE"
21265 " on explicit instantiations", storage
);
21268 if (storage
== ridpointers
[(int) RID_INLINE
])
21270 else if (storage
== ridpointers
[(int) RID_EXTERN
])
21272 else if (storage
== ridpointers
[(int) RID_STATIC
])
21276 error ("storage class %qD applied to template instantiation",
21282 if (CLASSTYPE_TEMPLATE_SPECIALIZATION (t
))
21284 /* DR 259 [temp.spec].
21286 Both an explicit instantiation and a declaration of an explicit
21287 specialization shall not appear in a program unless the explicit
21288 instantiation follows a declaration of the explicit specialization.
21290 For a given set of template parameters, if an explicit
21291 instantiation of a template appears after a declaration of an
21292 explicit specialization for that template, the explicit
21293 instantiation has no effect. */
21296 else if (CLASSTYPE_EXPLICIT_INSTANTIATION (t
))
21300 No program shall explicitly instantiate any template more
21303 If PREVIOUS_INSTANTIATION_EXTERN_P, then the first explicit
21304 instantiation was `extern'. If EXTERN_P then the second is.
21305 These cases are OK. */
21306 previous_instantiation_extern_p
= CLASSTYPE_INTERFACE_ONLY (t
);
21308 if (!previous_instantiation_extern_p
&& !extern_p
21309 && (complain
& tf_error
))
21310 permerror (input_location
, "duplicate explicit instantiation of %q#T", t
);
21312 /* If we've already instantiated the template, just return now. */
21313 if (!CLASSTYPE_INTERFACE_ONLY (t
))
21317 check_explicit_instantiation_namespace (TYPE_NAME (t
));
21318 mark_class_instantiated (t
, extern_p
);
21326 /* In contrast to implicit instantiation, where only the
21327 declarations, and not the definitions, of members are
21328 instantiated, we have here:
21332 The explicit instantiation of a class template specialization
21333 implies the instantiation of all of its members not
21334 previously explicitly specialized in the translation unit
21335 containing the explicit instantiation.
21337 Of course, we can't instantiate member template classes, since
21338 we don't have any arguments for them. Note that the standard
21339 is unclear on whether the instantiation of the members are
21340 *explicit* instantiations or not. However, the most natural
21341 interpretation is that it should be an explicit instantiation. */
21344 for (tmp
= TYPE_METHODS (t
); tmp
; tmp
= DECL_CHAIN (tmp
))
21345 if (TREE_CODE (tmp
) == FUNCTION_DECL
21346 && DECL_TEMPLATE_INSTANTIATION (tmp
))
21347 instantiate_class_member (tmp
, extern_p
);
21349 for (tmp
= TYPE_FIELDS (t
); tmp
; tmp
= DECL_CHAIN (tmp
))
21350 if (VAR_P (tmp
) && DECL_TEMPLATE_INSTANTIATION (tmp
))
21351 instantiate_class_member (tmp
, extern_p
);
21353 if (CLASSTYPE_NESTED_UTDS (t
))
21354 binding_table_foreach (CLASSTYPE_NESTED_UTDS (t
),
21355 bt_instantiate_type_proc
, &storage
);
21359 /* Given a function DECL, which is a specialization of TMPL, modify
21360 DECL to be a re-instantiation of TMPL with the same template
21361 arguments. TMPL should be the template into which tsubst'ing
21362 should occur for DECL, not the most general template.
21364 One reason for doing this is a scenario like this:
21367 void f(const T&, int i);
21369 void g() { f(3, 7); }
21372 void f(const T& t, const int i) { }
21374 Note that when the template is first instantiated, with
21375 instantiate_template, the resulting DECL will have no name for the
21376 first parameter, and the wrong type for the second. So, when we go
21377 to instantiate the DECL, we regenerate it. */
21380 regenerate_decl_from_template (tree decl
, tree tmpl
)
21382 /* The arguments used to instantiate DECL, from the most general
21387 args
= DECL_TI_ARGS (decl
);
21388 code_pattern
= DECL_TEMPLATE_RESULT (tmpl
);
21390 /* Make sure that we can see identifiers, and compute access
21392 push_access_scope (decl
);
21394 if (TREE_CODE (decl
) == FUNCTION_DECL
)
21402 args_depth
= TMPL_ARGS_DEPTH (args
);
21403 parms_depth
= TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl
));
21404 if (args_depth
> parms_depth
)
21405 args
= get_innermost_template_args (args
, parms_depth
);
21407 specs
= tsubst_exception_specification (TREE_TYPE (code_pattern
),
21408 args
, tf_error
, NULL_TREE
,
21409 /*defer_ok*/false);
21410 if (specs
&& specs
!= error_mark_node
)
21411 TREE_TYPE (decl
) = build_exception_variant (TREE_TYPE (decl
),
21414 /* Merge parameter declarations. */
21415 decl_parm
= skip_artificial_parms_for (decl
,
21416 DECL_ARGUMENTS (decl
));
21418 = skip_artificial_parms_for (code_pattern
,
21419 DECL_ARGUMENTS (code_pattern
));
21420 while (decl_parm
&& !DECL_PACK_P (pattern_parm
))
21425 if (DECL_NAME (decl_parm
) != DECL_NAME (pattern_parm
))
21426 DECL_NAME (decl_parm
) = DECL_NAME (pattern_parm
);
21427 parm_type
= tsubst (TREE_TYPE (pattern_parm
), args
, tf_error
,
21429 parm_type
= type_decays_to (parm_type
);
21430 if (!same_type_p (TREE_TYPE (decl_parm
), parm_type
))
21431 TREE_TYPE (decl_parm
) = parm_type
;
21432 attributes
= DECL_ATTRIBUTES (pattern_parm
);
21433 if (DECL_ATTRIBUTES (decl_parm
) != attributes
)
21435 DECL_ATTRIBUTES (decl_parm
) = attributes
;
21436 cplus_decl_attributes (&decl_parm
, attributes
, /*flags=*/0);
21438 decl_parm
= DECL_CHAIN (decl_parm
);
21439 pattern_parm
= DECL_CHAIN (pattern_parm
);
21441 /* Merge any parameters that match with the function parameter
21443 if (pattern_parm
&& DECL_PACK_P (pattern_parm
))
21446 tree expanded_types
;
21447 /* Expand the TYPE_PACK_EXPANSION that provides the types for
21448 the parameters in this function parameter pack. */
21449 expanded_types
= tsubst_pack_expansion (TREE_TYPE (pattern_parm
),
21450 args
, tf_error
, NULL_TREE
);
21451 len
= TREE_VEC_LENGTH (expanded_types
);
21452 for (i
= 0; i
< len
; i
++)
21457 if (DECL_NAME (decl_parm
) != DECL_NAME (pattern_parm
))
21458 /* Rename the parameter to include the index. */
21459 DECL_NAME (decl_parm
) =
21460 make_ith_pack_parameter_name (DECL_NAME (pattern_parm
), i
);
21461 parm_type
= TREE_VEC_ELT (expanded_types
, i
);
21462 parm_type
= type_decays_to (parm_type
);
21463 if (!same_type_p (TREE_TYPE (decl_parm
), parm_type
))
21464 TREE_TYPE (decl_parm
) = parm_type
;
21465 attributes
= DECL_ATTRIBUTES (pattern_parm
);
21466 if (DECL_ATTRIBUTES (decl_parm
) != attributes
)
21468 DECL_ATTRIBUTES (decl_parm
) = attributes
;
21469 cplus_decl_attributes (&decl_parm
, attributes
, /*flags=*/0);
21471 decl_parm
= DECL_CHAIN (decl_parm
);
21474 /* Merge additional specifiers from the CODE_PATTERN. */
21475 if (DECL_DECLARED_INLINE_P (code_pattern
)
21476 && !DECL_DECLARED_INLINE_P (decl
))
21477 DECL_DECLARED_INLINE_P (decl
) = 1;
21479 else if (VAR_P (decl
))
21481 DECL_INITIAL (decl
) =
21482 tsubst_expr (DECL_INITIAL (code_pattern
), args
,
21483 tf_error
, DECL_TI_TEMPLATE (decl
),
21484 /*integral_constant_expression_p=*/false);
21485 if (VAR_HAD_UNKNOWN_BOUND (decl
))
21486 TREE_TYPE (decl
) = tsubst (TREE_TYPE (code_pattern
), args
,
21487 tf_error
, DECL_TI_TEMPLATE (decl
));
21490 gcc_unreachable ();
21492 pop_access_scope (decl
);
21495 /* Return the TEMPLATE_DECL into which DECL_TI_ARGS(DECL) should be
21496 substituted to get DECL. */
21499 template_for_substitution (tree decl
)
21501 tree tmpl
= DECL_TI_TEMPLATE (decl
);
21503 /* Set TMPL to the template whose DECL_TEMPLATE_RESULT is the pattern
21504 for the instantiation. This is not always the most general
21505 template. Consider, for example:
21508 struct S { template <class U> void f();
21509 template <> void f<int>(); };
21511 and an instantiation of S<double>::f<int>. We want TD to be the
21512 specialization S<T>::f<int>, not the more general S<T>::f<U>. */
21513 while (/* An instantiation cannot have a definition, so we need a
21514 more general template. */
21515 DECL_TEMPLATE_INSTANTIATION (tmpl
)
21516 /* We must also deal with friend templates. Given:
21518 template <class T> struct S {
21519 template <class U> friend void f() {};
21522 S<int>::f<U> say, is not an instantiation of S<T>::f<U>,
21523 so far as the language is concerned, but that's still
21524 where we get the pattern for the instantiation from. On
21525 other hand, if the definition comes outside the class, say:
21527 template <class T> struct S {
21528 template <class U> friend void f();
21530 template <class U> friend void f() {}
21532 we don't need to look any further. That's what the check for
21533 DECL_INITIAL is for. */
21534 || (TREE_CODE (decl
) == FUNCTION_DECL
21535 && DECL_FRIEND_PSEUDO_TEMPLATE_INSTANTIATION (tmpl
)
21536 && !DECL_INITIAL (DECL_TEMPLATE_RESULT (tmpl
))))
21538 /* The present template, TD, should not be a definition. If it
21539 were a definition, we should be using it! Note that we
21540 cannot restructure the loop to just keep going until we find
21541 a template with a definition, since that might go too far if
21542 a specialization was declared, but not defined. */
21544 /* Fetch the more general template. */
21545 tmpl
= DECL_TI_TEMPLATE (tmpl
);
21551 /* Returns true if we need to instantiate this template instance even if we
21552 know we aren't going to emit it. */
21555 always_instantiate_p (tree decl
)
21557 /* We always instantiate inline functions so that we can inline them. An
21558 explicit instantiation declaration prohibits implicit instantiation of
21559 non-inline functions. With high levels of optimization, we would
21560 normally inline non-inline functions -- but we're not allowed to do
21561 that for "extern template" functions. Therefore, we check
21562 DECL_DECLARED_INLINE_P, rather than possibly_inlined_p. */
21563 return ((TREE_CODE (decl
) == FUNCTION_DECL
21564 && (DECL_DECLARED_INLINE_P (decl
)
21565 || type_uses_auto (TREE_TYPE (TREE_TYPE (decl
)))))
21566 /* And we need to instantiate static data members so that
21567 their initializers are available in integral constant
21570 && decl_maybe_constant_var_p (decl
)));
21573 /* If FN has a noexcept-specifier that hasn't been instantiated yet,
21574 instantiate it now, modifying TREE_TYPE (fn). */
21577 maybe_instantiate_noexcept (tree fn
)
21579 tree fntype
, spec
, noex
, clone
;
21581 /* Don't instantiate a noexcept-specification from template context. */
21582 if (processing_template_decl
)
21585 if (DECL_CLONED_FUNCTION_P (fn
))
21586 fn
= DECL_CLONED_FUNCTION (fn
);
21587 fntype
= TREE_TYPE (fn
);
21588 spec
= TYPE_RAISES_EXCEPTIONS (fntype
);
21590 if (!spec
|| !TREE_PURPOSE (spec
))
21593 noex
= TREE_PURPOSE (spec
);
21595 if (TREE_CODE (noex
) == DEFERRED_NOEXCEPT
)
21597 if (DEFERRED_NOEXCEPT_PATTERN (noex
) == NULL_TREE
)
21598 spec
= get_defaulted_eh_spec (fn
);
21599 else if (push_tinst_level (fn
))
21601 push_access_scope (fn
);
21602 push_deferring_access_checks (dk_no_deferred
);
21603 input_location
= DECL_SOURCE_LOCATION (fn
);
21604 noex
= tsubst_copy_and_build (DEFERRED_NOEXCEPT_PATTERN (noex
),
21605 DEFERRED_NOEXCEPT_ARGS (noex
),
21606 tf_warning_or_error
, fn
,
21607 /*function_p=*/false,
21608 /*integral_constant_expression_p=*/true);
21609 pop_deferring_access_checks ();
21610 pop_access_scope (fn
);
21611 pop_tinst_level ();
21612 spec
= build_noexcept_spec (noex
, tf_warning_or_error
);
21613 if (spec
== error_mark_node
)
21614 spec
= noexcept_false_spec
;
21617 spec
= noexcept_false_spec
;
21619 TREE_TYPE (fn
) = build_exception_variant (fntype
, spec
);
21622 FOR_EACH_CLONE (clone
, fn
)
21624 if (TREE_TYPE (clone
) == fntype
)
21625 TREE_TYPE (clone
) = TREE_TYPE (fn
);
21627 TREE_TYPE (clone
) = build_exception_variant (TREE_TYPE (clone
), spec
);
21631 /* Produce the definition of D, a _DECL generated from a template. If
21632 DEFER_OK is nonzero, then we don't have to actually do the
21633 instantiation now; we just have to do it sometime. Normally it is
21634 an error if this is an explicit instantiation but D is undefined.
21635 EXPL_INST_CLASS_MEM_P is true iff D is a member of an
21636 explicitly instantiated class template. */
21639 instantiate_decl (tree d
, int defer_ok
,
21640 bool expl_inst_class_mem_p
)
21642 tree tmpl
= DECL_TI_TEMPLATE (d
);
21649 bool pattern_defined
;
21650 location_t saved_loc
= input_location
;
21651 int saved_unevaluated_operand
= cp_unevaluated_operand
;
21652 int saved_inhibit_evaluation_warnings
= c_inhibit_evaluation_warnings
;
21656 bool nested
= false;
21658 /* This function should only be used to instantiate templates for
21659 functions and static member variables. */
21660 gcc_assert (VAR_OR_FUNCTION_DECL_P (d
));
21662 /* A concept is never instantiated. */
21663 gcc_assert (!DECL_DECLARED_CONCEPT_P (d
));
21665 /* Variables are never deferred; if instantiation is required, they
21666 are instantiated right away. That allows for better code in the
21667 case that an expression refers to the value of the variable --
21668 if the variable has a constant value the referring expression can
21669 take advantage of that fact. */
21671 || DECL_DECLARED_CONSTEXPR_P (d
))
21674 /* Don't instantiate cloned functions. Instead, instantiate the
21675 functions they cloned. */
21676 if (TREE_CODE (d
) == FUNCTION_DECL
&& DECL_CLONED_FUNCTION_P (d
))
21677 d
= DECL_CLONED_FUNCTION (d
);
21679 if (DECL_TEMPLATE_INSTANTIATED (d
)
21680 || (TREE_CODE (d
) == FUNCTION_DECL
21681 && DECL_DEFAULTED_FN (d
) && DECL_INITIAL (d
))
21682 || DECL_TEMPLATE_SPECIALIZATION (d
))
21683 /* D has already been instantiated or explicitly specialized, so
21684 there's nothing for us to do here.
21686 It might seem reasonable to check whether or not D is an explicit
21687 instantiation, and, if so, stop here. But when an explicit
21688 instantiation is deferred until the end of the compilation,
21689 DECL_EXPLICIT_INSTANTIATION is set, even though we still need to do
21690 the instantiation. */
21693 /* Check to see whether we know that this template will be
21694 instantiated in some other file, as with "extern template"
21696 external_p
= (DECL_INTERFACE_KNOWN (d
) && DECL_REALLY_EXTERN (d
));
21698 /* In general, we do not instantiate such templates. */
21699 if (external_p
&& !always_instantiate_p (d
))
21702 gen_tmpl
= most_general_template (tmpl
);
21703 gen_args
= impartial_args (tmpl
, DECL_TI_ARGS (d
));
21705 if (tmpl
!= gen_tmpl
)
21706 /* We should already have the extra args. */
21707 gcc_assert (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (gen_tmpl
))
21708 == TMPL_ARGS_DEPTH (gen_args
));
21709 /* And what's in the hash table should match D. */
21710 gcc_assert ((spec
= retrieve_specialization (gen_tmpl
, gen_args
, 0)) == d
21711 || spec
== NULL_TREE
);
21713 /* This needs to happen before any tsubsting. */
21714 if (! push_tinst_level (d
))
21717 timevar_push (TV_TEMPLATE_INST
);
21719 /* Set TD to the template whose DECL_TEMPLATE_RESULT is the pattern
21720 for the instantiation. */
21721 td
= template_for_substitution (d
);
21722 code_pattern
= DECL_TEMPLATE_RESULT (td
);
21724 /* We should never be trying to instantiate a member of a class
21725 template or partial specialization. */
21726 gcc_assert (d
!= code_pattern
);
21728 if ((DECL_NAMESPACE_SCOPE_P (d
) && !DECL_INITIALIZED_IN_CLASS_P (d
))
21729 || DECL_TEMPLATE_SPECIALIZATION (td
))
21730 /* In the case of a friend template whose definition is provided
21731 outside the class, we may have too many arguments. Drop the
21732 ones we don't need. The same is true for specializations. */
21733 args
= get_innermost_template_args
21734 (gen_args
, TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (td
)));
21738 if (TREE_CODE (d
) == FUNCTION_DECL
)
21740 deleted_p
= DECL_DELETED_FN (code_pattern
);
21741 pattern_defined
= ((DECL_SAVED_TREE (code_pattern
) != NULL_TREE
21742 && DECL_INITIAL (code_pattern
) != error_mark_node
)
21743 || DECL_DEFAULTED_OUTSIDE_CLASS_P (code_pattern
)
21749 pattern_defined
= ! DECL_IN_AGGR_P (code_pattern
);
21752 /* We may be in the middle of deferred access check. Disable it now. */
21753 push_deferring_access_checks (dk_no_deferred
);
21755 /* Unless an explicit instantiation directive has already determined
21756 the linkage of D, remember that a definition is available for
21758 if (pattern_defined
21759 && !DECL_INTERFACE_KNOWN (d
)
21760 && !DECL_NOT_REALLY_EXTERN (d
))
21761 mark_definable (d
);
21763 DECL_SOURCE_LOCATION (td
) = DECL_SOURCE_LOCATION (code_pattern
);
21764 DECL_SOURCE_LOCATION (d
) = DECL_SOURCE_LOCATION (code_pattern
);
21765 input_location
= DECL_SOURCE_LOCATION (d
);
21767 /* If D is a member of an explicitly instantiated class template,
21768 and no definition is available, treat it like an implicit
21770 if (!pattern_defined
&& expl_inst_class_mem_p
21771 && DECL_EXPLICIT_INSTANTIATION (d
))
21773 /* Leave linkage flags alone on instantiations with anonymous
21775 if (TREE_PUBLIC (d
))
21777 DECL_NOT_REALLY_EXTERN (d
) = 0;
21778 DECL_INTERFACE_KNOWN (d
) = 0;
21780 SET_DECL_IMPLICIT_INSTANTIATION (d
);
21783 /* Defer all other templates, unless we have been explicitly
21784 forbidden from doing so. */
21785 if (/* If there is no definition, we cannot instantiate the
21788 /* If it's OK to postpone instantiation, do so. */
21790 /* If this is a static data member that will be defined
21791 elsewhere, we don't want to instantiate the entire data
21792 member, but we do want to instantiate the initializer so that
21793 we can substitute that elsewhere. */
21794 || (external_p
&& VAR_P (d
))
21795 /* Handle here a deleted function too, avoid generating
21796 its body (c++/61080). */
21799 /* The definition of the static data member is now required so
21800 we must substitute the initializer. */
21802 && !DECL_INITIAL (d
)
21803 && DECL_INITIAL (code_pattern
))
21807 bool const_init
= false;
21808 bool enter_context
= DECL_CLASS_SCOPE_P (d
);
21810 ns
= decl_namespace_context (d
);
21811 push_nested_namespace (ns
);
21813 push_nested_class (DECL_CONTEXT (d
));
21814 init
= tsubst_expr (DECL_INITIAL (code_pattern
),
21816 tf_warning_or_error
, NULL_TREE
,
21817 /*integral_constant_expression_p=*/false);
21818 /* If instantiating the initializer involved instantiating this
21819 again, don't call cp_finish_decl twice. */
21820 if (!DECL_INITIAL (d
))
21822 /* Make sure the initializer is still constant, in case of
21823 circular dependency (template/instantiate6.C). */
21825 = DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (code_pattern
);
21826 cp_finish_decl (d
, init
, /*init_const_expr_p=*/const_init
,
21827 /*asmspec_tree=*/NULL_TREE
,
21828 LOOKUP_ONLYCONVERTING
);
21831 pop_nested_class ();
21832 pop_nested_namespace (ns
);
21835 /* We restore the source position here because it's used by
21836 add_pending_template. */
21837 input_location
= saved_loc
;
21839 if (at_eof
&& !pattern_defined
21840 && DECL_EXPLICIT_INSTANTIATION (d
)
21841 && DECL_NOT_REALLY_EXTERN (d
))
21844 The definition of a non-exported function template, a
21845 non-exported member function template, or a non-exported
21846 member function or static data member of a class template
21847 shall be present in every translation unit in which it is
21848 explicitly instantiated. */
21849 permerror (input_location
, "explicit instantiation of %qD "
21850 "but no definition available", d
);
21852 /* If we're in unevaluated context, we just wanted to get the
21853 constant value; this isn't an odr use, so don't queue
21854 a full instantiation. */
21855 if (cp_unevaluated_operand
!= 0)
21857 /* ??? Historically, we have instantiated inline functions, even
21858 when marked as "extern template". */
21859 if (!(external_p
&& VAR_P (d
)))
21860 add_pending_template (d
);
21863 /* Tell the repository that D is available in this translation unit
21864 -- and see if it is supposed to be instantiated here. */
21865 if (TREE_PUBLIC (d
) && !DECL_REALLY_EXTERN (d
) && !repo_emit_p (d
))
21867 /* In a PCH file, despite the fact that the repository hasn't
21868 requested instantiation in the PCH it is still possible that
21869 an instantiation will be required in a file that includes the
21872 add_pending_template (d
);
21873 /* Instantiate inline functions so that the inliner can do its
21874 job, even though we'll not be emitting a copy of this
21876 if (!(TREE_CODE (d
) == FUNCTION_DECL
&& possibly_inlined_p (d
)))
21880 fn_context
= decl_function_context (d
);
21881 nested
= (current_function_decl
!= NULL_TREE
);
21882 vec
<tree
> omp_privatization_save
;
21884 save_omp_privatization_clauses (omp_privatization_save
);
21887 push_to_top_level ();
21891 push_function_context ();
21892 cp_unevaluated_operand
= 0;
21893 c_inhibit_evaluation_warnings
= 0;
21896 /* Mark D as instantiated so that recursive calls to
21897 instantiate_decl do not try to instantiate it again. */
21898 DECL_TEMPLATE_INSTANTIATED (d
) = 1;
21900 /* Regenerate the declaration in case the template has been modified
21901 by a subsequent redeclaration. */
21902 regenerate_decl_from_template (d
, td
);
21904 /* We already set the file and line above. Reset them now in case
21905 they changed as a result of calling regenerate_decl_from_template. */
21906 input_location
= DECL_SOURCE_LOCATION (d
);
21911 bool const_init
= false;
21913 /* Clear out DECL_RTL; whatever was there before may not be right
21914 since we've reset the type of the declaration. */
21915 SET_DECL_RTL (d
, NULL
);
21916 DECL_IN_AGGR_P (d
) = 0;
21918 /* The initializer is placed in DECL_INITIAL by
21919 regenerate_decl_from_template so we don't need to
21920 push/pop_access_scope again here. Pull it out so that
21921 cp_finish_decl can process it. */
21922 init
= DECL_INITIAL (d
);
21923 DECL_INITIAL (d
) = NULL_TREE
;
21924 DECL_INITIALIZED_P (d
) = 0;
21926 /* Clear DECL_EXTERNAL so that cp_finish_decl will process the
21927 initializer. That function will defer actual emission until
21928 we have a chance to determine linkage. */
21929 DECL_EXTERNAL (d
) = 0;
21931 /* Enter the scope of D so that access-checking works correctly. */
21932 bool enter_context
= DECL_CLASS_SCOPE_P (d
);
21934 push_nested_class (DECL_CONTEXT (d
));
21936 const_init
= DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (code_pattern
);
21937 cp_finish_decl (d
, init
, const_init
, NULL_TREE
, 0);
21940 pop_nested_class ();
21942 if (variable_template_p (gen_tmpl
))
21943 note_variable_template_instantiation (d
);
21945 else if (TREE_CODE (d
) == FUNCTION_DECL
&& DECL_DEFAULTED_FN (code_pattern
))
21946 synthesize_method (d
);
21947 else if (TREE_CODE (d
) == FUNCTION_DECL
)
21949 hash_map
<tree
, tree
> *saved_local_specializations
;
21953 tree block
= NULL_TREE
;
21955 /* Save away the current list, in case we are instantiating one
21956 template from within the body of another. */
21957 saved_local_specializations
= local_specializations
;
21959 /* Set up the list of local specializations. */
21960 local_specializations
= new hash_map
<tree
, tree
>;
21962 /* Set up context. */
21963 if (DECL_OMP_DECLARE_REDUCTION_P (code_pattern
)
21964 && TREE_CODE (DECL_CONTEXT (code_pattern
)) == FUNCTION_DECL
)
21965 block
= push_stmt_list ();
21967 start_preparsed_function (d
, NULL_TREE
, SF_PRE_PARSED
);
21969 /* Some typedefs referenced from within the template code need to be
21970 access checked at template instantiation time, i.e now. These
21971 types were added to the template at parsing time. Let's get those
21972 and perform the access checks then. */
21973 perform_typedefs_access_check (DECL_TEMPLATE_RESULT (gen_tmpl
),
21976 /* Create substitution entries for the parameters. */
21977 subst_decl
= DECL_TEMPLATE_RESULT (template_for_substitution (d
));
21978 tmpl_parm
= DECL_ARGUMENTS (subst_decl
);
21979 spec_parm
= DECL_ARGUMENTS (d
);
21980 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (d
))
21982 register_local_specialization (spec_parm
, tmpl_parm
);
21983 spec_parm
= skip_artificial_parms_for (d
, spec_parm
);
21984 tmpl_parm
= skip_artificial_parms_for (subst_decl
, tmpl_parm
);
21986 for (; tmpl_parm
; tmpl_parm
= DECL_CHAIN (tmpl_parm
))
21988 if (!DECL_PACK_P (tmpl_parm
))
21990 register_local_specialization (spec_parm
, tmpl_parm
);
21991 spec_parm
= DECL_CHAIN (spec_parm
);
21995 /* Register the (value) argument pack as a specialization of
21996 TMPL_PARM, then move on. */
21997 tree argpack
= extract_fnparm_pack (tmpl_parm
, &spec_parm
);
21998 register_local_specialization (argpack
, tmpl_parm
);
22001 gcc_assert (!spec_parm
);
22003 /* Substitute into the body of the function. */
22004 if (DECL_OMP_DECLARE_REDUCTION_P (code_pattern
))
22005 tsubst_omp_udr (DECL_SAVED_TREE (code_pattern
), args
,
22006 tf_warning_or_error
, tmpl
);
22009 tsubst_expr (DECL_SAVED_TREE (code_pattern
), args
,
22010 tf_warning_or_error
, tmpl
,
22011 /*integral_constant_expression_p=*/false);
22013 /* Set the current input_location to the end of the function
22014 so that finish_function knows where we are. */
22016 = DECL_STRUCT_FUNCTION (code_pattern
)->function_end_locus
;
22018 /* Remember if we saw an infinite loop in the template. */
22019 current_function_infinite_loop
22020 = DECL_STRUCT_FUNCTION (code_pattern
)->language
->infinite_loop
;
22023 /* We don't need the local specializations any more. */
22024 delete local_specializations
;
22025 local_specializations
= saved_local_specializations
;
22027 /* Finish the function. */
22028 if (DECL_OMP_DECLARE_REDUCTION_P (code_pattern
)
22029 && TREE_CODE (DECL_CONTEXT (code_pattern
)) == FUNCTION_DECL
)
22030 DECL_SAVED_TREE (d
) = pop_stmt_list (block
);
22033 d
= finish_function (0);
22034 expand_or_defer_fn (d
);
22037 if (DECL_OMP_DECLARE_REDUCTION_P (code_pattern
))
22038 cp_check_omp_declare_reduction (d
);
22041 /* We're not deferring instantiation any more. */
22042 TI_PENDING_TEMPLATE_FLAG (DECL_TEMPLATE_INFO (d
)) = 0;
22045 pop_from_top_level ();
22047 pop_function_context ();
22050 input_location
= saved_loc
;
22051 cp_unevaluated_operand
= saved_unevaluated_operand
;
22052 c_inhibit_evaluation_warnings
= saved_inhibit_evaluation_warnings
;
22053 pop_deferring_access_checks ();
22054 pop_tinst_level ();
22056 restore_omp_privatization_clauses (omp_privatization_save
);
22058 timevar_pop (TV_TEMPLATE_INST
);
22063 /* Run through the list of templates that we wish we could
22064 instantiate, and instantiate any we can. RETRIES is the
22065 number of times we retry pending template instantiation. */
22068 instantiate_pending_templates (int retries
)
22071 location_t saved_loc
= input_location
;
22073 /* Instantiating templates may trigger vtable generation. This in turn
22074 may require further template instantiations. We place a limit here
22075 to avoid infinite loop. */
22076 if (pending_templates
&& retries
>= max_tinst_depth
)
22078 tree decl
= pending_templates
->tinst
->decl
;
22080 fatal_error (input_location
,
22081 "template instantiation depth exceeds maximum of %d"
22082 " instantiating %q+D, possibly from virtual table generation"
22083 " (use -ftemplate-depth= to increase the maximum)",
22084 max_tinst_depth
, decl
);
22085 if (TREE_CODE (decl
) == FUNCTION_DECL
)
22086 /* Pretend that we defined it. */
22087 DECL_INITIAL (decl
) = error_mark_node
;
22093 struct pending_template
**t
= &pending_templates
;
22094 struct pending_template
*last
= NULL
;
22098 tree instantiation
= reopen_tinst_level ((*t
)->tinst
);
22099 bool complete
= false;
22101 if (TYPE_P (instantiation
))
22105 if (!COMPLETE_TYPE_P (instantiation
))
22107 instantiate_class_template (instantiation
);
22108 if (CLASSTYPE_TEMPLATE_INSTANTIATION (instantiation
))
22109 for (fn
= TYPE_METHODS (instantiation
);
22111 fn
= TREE_CHAIN (fn
))
22112 if (! DECL_ARTIFICIAL (fn
))
22113 instantiate_decl (fn
,
22115 /*expl_inst_class_mem_p=*/false);
22116 if (COMPLETE_TYPE_P (instantiation
))
22120 complete
= COMPLETE_TYPE_P (instantiation
);
22124 if (!DECL_TEMPLATE_SPECIALIZATION (instantiation
)
22125 && !DECL_TEMPLATE_INSTANTIATED (instantiation
))
22128 = instantiate_decl (instantiation
,
22130 /*expl_inst_class_mem_p=*/false);
22131 if (DECL_TEMPLATE_INSTANTIATED (instantiation
))
22135 complete
= (DECL_TEMPLATE_SPECIALIZATION (instantiation
)
22136 || DECL_TEMPLATE_INSTANTIATED (instantiation
));
22140 /* If INSTANTIATION has been instantiated, then we don't
22141 need to consider it again in the future. */
22149 current_tinst_level
= NULL
;
22151 last_pending_template
= last
;
22153 while (reconsider
);
22155 input_location
= saved_loc
;
22158 /* Substitute ARGVEC into T, which is a list of initializers for
22159 either base class or a non-static data member. The TREE_PURPOSEs
22160 are DECLs, and the TREE_VALUEs are the initializer values. Used by
22161 instantiate_decl. */
22164 tsubst_initializer_list (tree t
, tree argvec
)
22166 tree inits
= NULL_TREE
;
22168 for (; t
; t
= TREE_CHAIN (t
))
22172 tree expanded_bases
= NULL_TREE
;
22173 tree expanded_arguments
= NULL_TREE
;
22176 if (TREE_CODE (TREE_PURPOSE (t
)) == TYPE_PACK_EXPANSION
)
22181 /* Expand the base class expansion type into separate base
22183 expanded_bases
= tsubst_pack_expansion (TREE_PURPOSE (t
), argvec
,
22184 tf_warning_or_error
,
22186 if (expanded_bases
== error_mark_node
)
22189 /* We'll be building separate TREE_LISTs of arguments for
22191 len
= TREE_VEC_LENGTH (expanded_bases
);
22192 expanded_arguments
= make_tree_vec (len
);
22193 for (i
= 0; i
< len
; i
++)
22194 TREE_VEC_ELT (expanded_arguments
, i
) = NULL_TREE
;
22196 /* Build a dummy EXPR_PACK_EXPANSION that will be used to
22197 expand each argument in the TREE_VALUE of t. */
22198 expr
= make_node (EXPR_PACK_EXPANSION
);
22199 PACK_EXPANSION_LOCAL_P (expr
) = true;
22200 PACK_EXPANSION_PARAMETER_PACKS (expr
) =
22201 PACK_EXPANSION_PARAMETER_PACKS (TREE_PURPOSE (t
));
22203 if (TREE_VALUE (t
) == void_type_node
)
22204 /* VOID_TYPE_NODE is used to indicate
22205 value-initialization. */
22207 for (i
= 0; i
< len
; i
++)
22208 TREE_VEC_ELT (expanded_arguments
, i
) = void_type_node
;
22212 /* Substitute parameter packs into each argument in the
22214 in_base_initializer
= 1;
22215 for (arg
= TREE_VALUE (t
); arg
; arg
= TREE_CHAIN (arg
))
22217 tree expanded_exprs
;
22219 /* Expand the argument. */
22220 SET_PACK_EXPANSION_PATTERN (expr
, TREE_VALUE (arg
));
22222 = tsubst_pack_expansion (expr
, argvec
,
22223 tf_warning_or_error
,
22225 if (expanded_exprs
== error_mark_node
)
22228 /* Prepend each of the expanded expressions to the
22229 corresponding TREE_LIST in EXPANDED_ARGUMENTS. */
22230 for (i
= 0; i
< len
; i
++)
22232 TREE_VEC_ELT (expanded_arguments
, i
) =
22233 tree_cons (NULL_TREE
,
22234 TREE_VEC_ELT (expanded_exprs
, i
),
22235 TREE_VEC_ELT (expanded_arguments
, i
));
22238 in_base_initializer
= 0;
22240 /* Reverse all of the TREE_LISTs in EXPANDED_ARGUMENTS,
22241 since we built them backwards. */
22242 for (i
= 0; i
< len
; i
++)
22244 TREE_VEC_ELT (expanded_arguments
, i
) =
22245 nreverse (TREE_VEC_ELT (expanded_arguments
, i
));
22250 for (i
= 0; i
< len
; ++i
)
22252 if (expanded_bases
)
22254 decl
= TREE_VEC_ELT (expanded_bases
, i
);
22255 decl
= expand_member_init (decl
);
22256 init
= TREE_VEC_ELT (expanded_arguments
, i
);
22261 decl
= tsubst_copy (TREE_PURPOSE (t
), argvec
,
22262 tf_warning_or_error
, NULL_TREE
);
22264 decl
= expand_member_init (decl
);
22265 if (decl
&& !DECL_P (decl
))
22266 in_base_initializer
= 1;
22268 init
= TREE_VALUE (t
);
22270 if (init
!= void_type_node
)
22271 init
= tsubst_expr (init
, argvec
,
22272 tf_warning_or_error
, NULL_TREE
,
22273 /*integral_constant_expression_p=*/false);
22274 if (init
== NULL_TREE
&& tmp
!= NULL_TREE
)
22275 /* If we had an initializer but it instantiated to nothing,
22276 value-initialize the object. This will only occur when
22277 the initializer was a pack expansion where the parameter
22278 packs used in that expansion were of length zero. */
22279 init
= void_type_node
;
22280 in_base_initializer
= 0;
22285 init
= build_tree_list (decl
, init
);
22286 TREE_CHAIN (init
) = inits
;
22294 /* Set CURRENT_ACCESS_SPECIFIER based on the protection of DECL. */
22297 set_current_access_from_decl (tree decl
)
22299 if (TREE_PRIVATE (decl
))
22300 current_access_specifier
= access_private_node
;
22301 else if (TREE_PROTECTED (decl
))
22302 current_access_specifier
= access_protected_node
;
22304 current_access_specifier
= access_public_node
;
22307 /* Instantiate an enumerated type. TAG is the template type, NEWTAG
22308 is the instantiation (which should have been created with
22309 start_enum) and ARGS are the template arguments to use. */
22312 tsubst_enum (tree tag
, tree newtag
, tree args
)
22316 if (SCOPED_ENUM_P (newtag
))
22317 begin_scope (sk_scoped_enum
, newtag
);
22319 for (e
= TYPE_VALUES (tag
); e
; e
= TREE_CHAIN (e
))
22324 decl
= TREE_VALUE (e
);
22325 /* Note that in a template enum, the TREE_VALUE is the
22326 CONST_DECL, not the corresponding INTEGER_CST. */
22327 value
= tsubst_expr (DECL_INITIAL (decl
),
22328 args
, tf_warning_or_error
, NULL_TREE
,
22329 /*integral_constant_expression_p=*/true);
22331 /* Give this enumeration constant the correct access. */
22332 set_current_access_from_decl (decl
);
22334 /* Actually build the enumerator itself. Here we're assuming that
22335 enumerators can't have dependent attributes. */
22336 build_enumerator (DECL_NAME (decl
), value
, newtag
,
22337 DECL_ATTRIBUTES (decl
), DECL_SOURCE_LOCATION (decl
));
22340 if (SCOPED_ENUM_P (newtag
))
22343 finish_enum_value_list (newtag
);
22344 finish_enum (newtag
);
22346 DECL_SOURCE_LOCATION (TYPE_NAME (newtag
))
22347 = DECL_SOURCE_LOCATION (TYPE_NAME (tag
));
22350 /* DECL is a FUNCTION_DECL that is a template specialization. Return
22351 its type -- but without substituting the innermost set of template
22352 arguments. So, innermost set of template parameters will appear in
22356 get_mostly_instantiated_function_type (tree decl
)
22358 /* For a function, DECL_TI_TEMPLATE is partially instantiated. */
22359 return TREE_TYPE (DECL_TI_TEMPLATE (decl
));
22362 /* Return truthvalue if we're processing a template different from
22363 the last one involved in diagnostics. */
22365 problematic_instantiation_changed (void)
22367 return current_tinst_level
!= last_error_tinst_level
;
22370 /* Remember current template involved in diagnostics. */
22372 record_last_problematic_instantiation (void)
22374 last_error_tinst_level
= current_tinst_level
;
22377 struct tinst_level
*
22378 current_instantiation (void)
22380 return current_tinst_level
;
22383 /* Return TRUE if current_function_decl is being instantiated, false
22387 instantiating_current_function_p (void)
22389 return (current_instantiation ()
22390 && current_instantiation ()->decl
== current_function_decl
);
22393 /* [temp.param] Check that template non-type parm TYPE is of an allowable
22394 type. Return zero for ok, nonzero for disallowed. Issue error and
22395 warning messages under control of COMPLAIN. */
22398 invalid_nontype_parm_type_p (tree type
, tsubst_flags_t complain
)
22400 if (INTEGRAL_OR_ENUMERATION_TYPE_P (type
))
22402 else if (POINTER_TYPE_P (type
))
22404 else if (TYPE_PTRMEM_P (type
))
22406 else if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
)
22408 else if (TREE_CODE (type
) == TYPENAME_TYPE
)
22410 else if (TREE_CODE (type
) == DECLTYPE_TYPE
)
22412 else if (TREE_CODE (type
) == NULLPTR_TYPE
)
22414 /* A bound template template parm could later be instantiated to have a valid
22415 nontype parm type via an alias template. */
22416 else if (cxx_dialect
>= cxx11
22417 && TREE_CODE (type
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
22420 if (complain
& tf_error
)
22422 if (type
== error_mark_node
)
22423 inform (input_location
, "invalid template non-type parameter");
22425 error ("%q#T is not a valid type for a template non-type parameter",
22431 /* Returns TRUE if TYPE is dependent, in the sense of [temp.dep.type].
22432 Assumes that TYPE really is a type, and not the ERROR_MARK_NODE.*/
22435 dependent_type_p_r (tree type
)
22441 A type is dependent if it is:
22443 -- a template parameter. Template template parameters are types
22444 for us (since TYPE_P holds true for them) so we handle
22446 if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
22447 || TREE_CODE (type
) == TEMPLATE_TEMPLATE_PARM
)
22449 /* -- a qualified-id with a nested-name-specifier which contains a
22450 class-name that names a dependent type or whose unqualified-id
22451 names a dependent type. */
22452 if (TREE_CODE (type
) == TYPENAME_TYPE
)
22455 /* An alias template specialization can be dependent even if the
22456 resulting type is not. */
22457 if (dependent_alias_template_spec_p (type
))
22460 /* -- a cv-qualified type where the cv-unqualified type is
22462 No code is necessary for this bullet; the code below handles
22463 cv-qualified types, and we don't want to strip aliases with
22464 TYPE_MAIN_VARIANT because of DR 1558. */
22465 /* -- a compound type constructed from any dependent type. */
22466 if (TYPE_PTRMEM_P (type
))
22467 return (dependent_type_p (TYPE_PTRMEM_CLASS_TYPE (type
))
22468 || dependent_type_p (TYPE_PTRMEM_POINTED_TO_TYPE
22470 else if (TYPE_PTR_P (type
)
22471 || TREE_CODE (type
) == REFERENCE_TYPE
)
22472 return dependent_type_p (TREE_TYPE (type
));
22473 else if (TREE_CODE (type
) == FUNCTION_TYPE
22474 || TREE_CODE (type
) == METHOD_TYPE
)
22478 if (dependent_type_p (TREE_TYPE (type
)))
22480 for (arg_type
= TYPE_ARG_TYPES (type
);
22482 arg_type
= TREE_CHAIN (arg_type
))
22483 if (dependent_type_p (TREE_VALUE (arg_type
)))
22487 /* -- an array type constructed from any dependent type or whose
22488 size is specified by a constant expression that is
22491 We checked for type- and value-dependence of the bounds in
22492 compute_array_index_type, so TYPE_DEPENDENT_P is already set. */
22493 if (TREE_CODE (type
) == ARRAY_TYPE
)
22495 if (TYPE_DOMAIN (type
)
22496 && dependent_type_p (TYPE_DOMAIN (type
)))
22498 return dependent_type_p (TREE_TYPE (type
));
22501 /* -- a template-id in which either the template name is a template
22503 if (TREE_CODE (type
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
22505 /* ... or any of the template arguments is a dependent type or
22506 an expression that is type-dependent or value-dependent. */
22507 else if (CLASS_TYPE_P (type
) && CLASSTYPE_TEMPLATE_INFO (type
)
22508 && (any_dependent_template_arguments_p
22509 (INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (type
)))))
22512 /* All TYPEOF_TYPEs, DECLTYPE_TYPEs, and UNDERLYING_TYPEs are
22513 dependent; if the argument of the `typeof' expression is not
22514 type-dependent, then it should already been have resolved. */
22515 if (TREE_CODE (type
) == TYPEOF_TYPE
22516 || TREE_CODE (type
) == DECLTYPE_TYPE
22517 || TREE_CODE (type
) == UNDERLYING_TYPE
)
22520 /* A template argument pack is dependent if any of its packed
22522 if (TREE_CODE (type
) == TYPE_ARGUMENT_PACK
)
22524 tree args
= ARGUMENT_PACK_ARGS (type
);
22525 int i
, len
= TREE_VEC_LENGTH (args
);
22526 for (i
= 0; i
< len
; ++i
)
22527 if (dependent_template_arg_p (TREE_VEC_ELT (args
, i
)))
22531 /* All TYPE_PACK_EXPANSIONs are dependent, because parameter packs must
22532 be template parameters. */
22533 if (TREE_CODE (type
) == TYPE_PACK_EXPANSION
)
22536 /* The standard does not specifically mention types that are local
22537 to template functions or local classes, but they should be
22538 considered dependent too. For example:
22540 template <int I> void f() {
22545 The size of `E' cannot be known until the value of `I' has been
22546 determined. Therefore, `E' must be considered dependent. */
22547 scope
= TYPE_CONTEXT (type
);
22548 if (scope
&& TYPE_P (scope
))
22549 return dependent_type_p (scope
);
22550 /* Don't use type_dependent_expression_p here, as it can lead
22551 to infinite recursion trying to determine whether a lambda
22552 nested in a lambda is dependent (c++/47687). */
22553 else if (scope
&& TREE_CODE (scope
) == FUNCTION_DECL
22554 && DECL_LANG_SPECIFIC (scope
)
22555 && DECL_TEMPLATE_INFO (scope
)
22556 && (any_dependent_template_arguments_p
22557 (INNERMOST_TEMPLATE_ARGS (DECL_TI_ARGS (scope
)))))
22560 /* Other types are non-dependent. */
22564 /* Returns TRUE if TYPE is dependent, in the sense of
22565 [temp.dep.type]. Note that a NULL type is considered dependent. */
22568 dependent_type_p (tree type
)
22570 /* If there are no template parameters in scope, then there can't be
22571 any dependent types. */
22572 if (!processing_template_decl
)
22574 /* If we are not processing a template, then nobody should be
22575 providing us with a dependent type. */
22577 gcc_assert (TREE_CODE (type
) != TEMPLATE_TYPE_PARM
|| is_auto (type
));
22581 /* If the type is NULL, we have not computed a type for the entity
22582 in question; in that case, the type is dependent. */
22586 /* Erroneous types can be considered non-dependent. */
22587 if (type
== error_mark_node
)
22590 /* If we have not already computed the appropriate value for TYPE,
22592 if (!TYPE_DEPENDENT_P_VALID (type
))
22594 TYPE_DEPENDENT_P (type
) = dependent_type_p_r (type
);
22595 TYPE_DEPENDENT_P_VALID (type
) = 1;
22598 return TYPE_DEPENDENT_P (type
);
22601 /* Returns TRUE if SCOPE is a dependent scope, in which we can't do any
22602 lookup. In other words, a dependent type that is not the current
22606 dependent_scope_p (tree scope
)
22608 return (scope
&& TYPE_P (scope
) && dependent_type_p (scope
)
22609 && !currently_open_class (scope
));
22612 /* T is a SCOPE_REF; return whether we need to consider it
22613 instantiation-dependent so that we can check access at instantiation
22614 time even though we know which member it resolves to. */
22617 instantiation_dependent_scope_ref_p (tree t
)
22619 if (DECL_P (TREE_OPERAND (t
, 1))
22620 && CLASS_TYPE_P (TREE_OPERAND (t
, 0))
22621 && accessible_in_template_p (TREE_OPERAND (t
, 0),
22622 TREE_OPERAND (t
, 1)))
22628 /* Returns TRUE if the EXPRESSION is value-dependent, in the sense of
22629 [temp.dep.constexpr]. EXPRESSION is already known to be a constant
22632 /* Note that this predicate is not appropriate for general expressions;
22633 only constant expressions (that satisfy potential_constant_expression)
22634 can be tested for value dependence. */
22637 value_dependent_expression_p (tree expression
)
22639 if (!processing_template_decl
)
22642 /* A name declared with a dependent type. */
22643 if (DECL_P (expression
) && type_dependent_expression_p (expression
))
22646 switch (TREE_CODE (expression
))
22648 case IDENTIFIER_NODE
:
22649 /* A name that has not been looked up -- must be dependent. */
22652 case TEMPLATE_PARM_INDEX
:
22653 /* A non-type template parm. */
22657 /* A non-type template parm. */
22658 if (DECL_TEMPLATE_PARM_P (expression
))
22660 return value_dependent_expression_p (DECL_INITIAL (expression
));
22663 /* A constant with literal type and is initialized
22664 with an expression that is value-dependent.
22666 Note that a non-dependent parenthesized initializer will have
22667 already been replaced with its constant value, so if we see
22668 a TREE_LIST it must be dependent. */
22669 if (DECL_INITIAL (expression
)
22670 && decl_constant_var_p (expression
)
22671 && (TREE_CODE (DECL_INITIAL (expression
)) == TREE_LIST
22672 /* cp_finish_decl doesn't fold reference initializers. */
22673 || TREE_CODE (TREE_TYPE (expression
)) == REFERENCE_TYPE
22674 || type_dependent_expression_p (DECL_INITIAL (expression
))
22675 || value_dependent_expression_p (DECL_INITIAL (expression
))))
22679 case DYNAMIC_CAST_EXPR
:
22680 case STATIC_CAST_EXPR
:
22681 case CONST_CAST_EXPR
:
22682 case REINTERPRET_CAST_EXPR
:
22684 /* These expressions are value-dependent if the type to which
22685 the cast occurs is dependent or the expression being casted
22686 is value-dependent. */
22688 tree type
= TREE_TYPE (expression
);
22690 if (dependent_type_p (type
))
22693 /* A functional cast has a list of operands. */
22694 expression
= TREE_OPERAND (expression
, 0);
22697 /* If there are no operands, it must be an expression such
22698 as "int()". This should not happen for aggregate types
22699 because it would form non-constant expressions. */
22700 gcc_assert (cxx_dialect
>= cxx11
22701 || INTEGRAL_OR_ENUMERATION_TYPE_P (type
));
22706 if (TREE_CODE (expression
) == TREE_LIST
)
22707 return any_value_dependent_elements_p (expression
);
22709 return value_dependent_expression_p (expression
);
22713 if (SIZEOF_EXPR_TYPE_P (expression
))
22714 return dependent_type_p (TREE_TYPE (TREE_OPERAND (expression
, 0)));
22718 /* A `sizeof' expression is value-dependent if the operand is
22719 type-dependent or is a pack expansion. */
22720 expression
= TREE_OPERAND (expression
, 0);
22721 if (PACK_EXPANSION_P (expression
))
22723 else if (TYPE_P (expression
))
22724 return dependent_type_p (expression
);
22725 return instantiation_dependent_uneval_expression_p (expression
);
22727 case AT_ENCODE_EXPR
:
22728 /* An 'encode' expression is value-dependent if the operand is
22730 expression
= TREE_OPERAND (expression
, 0);
22731 return dependent_type_p (expression
);
22733 case NOEXCEPT_EXPR
:
22734 expression
= TREE_OPERAND (expression
, 0);
22735 return instantiation_dependent_uneval_expression_p (expression
);
22738 /* All instantiation-dependent expressions should also be considered
22739 value-dependent. */
22740 return instantiation_dependent_scope_ref_p (expression
);
22742 case COMPONENT_REF
:
22743 return (value_dependent_expression_p (TREE_OPERAND (expression
, 0))
22744 || value_dependent_expression_p (TREE_OPERAND (expression
, 1)));
22746 case NONTYPE_ARGUMENT_PACK
:
22747 /* A NONTYPE_ARGUMENT_PACK is value-dependent if any packed argument
22748 is value-dependent. */
22750 tree values
= ARGUMENT_PACK_ARGS (expression
);
22751 int i
, len
= TREE_VEC_LENGTH (values
);
22753 for (i
= 0; i
< len
; ++i
)
22754 if (value_dependent_expression_p (TREE_VEC_ELT (values
, i
)))
22762 tree type2
= TRAIT_EXPR_TYPE2 (expression
);
22763 return (dependent_type_p (TRAIT_EXPR_TYPE1 (expression
))
22764 || (type2
? dependent_type_p (type2
) : false));
22768 return ((value_dependent_expression_p (TREE_OPERAND (expression
, 0)))
22769 || (value_dependent_expression_p (TREE_OPERAND (expression
, 2))));
22772 return ((value_dependent_expression_p (TREE_OPERAND (expression
, 0)))
22773 || (value_dependent_expression_p (TREE_OPERAND (expression
, 1))));
22777 tree op
= TREE_OPERAND (expression
, 0);
22778 return (value_dependent_expression_p (op
)
22779 || has_value_dependent_address (op
));
22782 case REQUIRES_EXPR
:
22783 /* Treat all requires-expressions as value-dependent so
22784 we don't try to fold them. */
22788 return dependent_type_p (TREE_OPERAND (expression
, 0));
22792 tree fn
= get_callee_fndecl (expression
);
22794 if (!fn
&& value_dependent_expression_p (CALL_EXPR_FN (expression
)))
22796 nargs
= call_expr_nargs (expression
);
22797 for (i
= 0; i
< nargs
; ++i
)
22799 tree op
= CALL_EXPR_ARG (expression
, i
);
22800 /* In a call to a constexpr member function, look through the
22801 implicit ADDR_EXPR on the object argument so that it doesn't
22802 cause the call to be considered value-dependent. We also
22803 look through it in potential_constant_expression. */
22804 if (i
== 0 && fn
&& DECL_DECLARED_CONSTEXPR_P (fn
)
22805 && DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
)
22806 && TREE_CODE (op
) == ADDR_EXPR
)
22807 op
= TREE_OPERAND (op
, 0);
22808 if (value_dependent_expression_p (op
))
22814 case TEMPLATE_ID_EXPR
:
22815 /* If a TEMPLATE_ID_EXPR involves a dependent name, it will be
22817 return type_dependent_expression_p (expression
)
22818 || variable_concept_p (TREE_OPERAND (expression
, 0));
22824 if (dependent_type_p (TREE_TYPE (expression
)))
22826 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (expression
), ix
, val
)
22827 if (value_dependent_expression_p (val
))
22833 /* Treat a GNU statement expression as dependent to avoid crashing
22834 under instantiate_non_dependent_expr; it can't be constant. */
22838 /* A constant expression is value-dependent if any subexpression is
22839 value-dependent. */
22840 switch (TREE_CODE_CLASS (TREE_CODE (expression
)))
22842 case tcc_reference
:
22844 case tcc_comparison
:
22846 case tcc_expression
:
22849 int i
, len
= cp_tree_operand_length (expression
);
22851 for (i
= 0; i
< len
; i
++)
22853 tree t
= TREE_OPERAND (expression
, i
);
22855 /* In some cases, some of the operands may be missing.l
22856 (For example, in the case of PREDECREMENT_EXPR, the
22857 amount to increment by may be missing.) That doesn't
22858 make the expression dependent. */
22859 if (t
&& value_dependent_expression_p (t
))
22870 /* The expression is not value-dependent. */
22874 /* Returns TRUE if the EXPRESSION is type-dependent, in the sense of
22875 [temp.dep.expr]. Note that an expression with no type is
22876 considered dependent. Other parts of the compiler arrange for an
22877 expression with type-dependent subexpressions to have no type, so
22878 this function doesn't have to be fully recursive. */
22881 type_dependent_expression_p (tree expression
)
22883 if (!processing_template_decl
)
22886 if (expression
== NULL_TREE
|| expression
== error_mark_node
)
22889 /* An unresolved name is always dependent. */
22890 if (identifier_p (expression
)
22891 || TREE_CODE (expression
) == USING_DECL
22892 || TREE_CODE (expression
) == WILDCARD_DECL
)
22895 /* A fold expression is type-dependent. */
22896 if (TREE_CODE (expression
) == UNARY_LEFT_FOLD_EXPR
22897 || TREE_CODE (expression
) == UNARY_RIGHT_FOLD_EXPR
22898 || TREE_CODE (expression
) == BINARY_LEFT_FOLD_EXPR
22899 || TREE_CODE (expression
) == BINARY_RIGHT_FOLD_EXPR
)
22902 /* Some expression forms are never type-dependent. */
22903 if (TREE_CODE (expression
) == PSEUDO_DTOR_EXPR
22904 || TREE_CODE (expression
) == SIZEOF_EXPR
22905 || TREE_CODE (expression
) == ALIGNOF_EXPR
22906 || TREE_CODE (expression
) == AT_ENCODE_EXPR
22907 || TREE_CODE (expression
) == NOEXCEPT_EXPR
22908 || TREE_CODE (expression
) == TRAIT_EXPR
22909 || TREE_CODE (expression
) == TYPEID_EXPR
22910 || TREE_CODE (expression
) == DELETE_EXPR
22911 || TREE_CODE (expression
) == VEC_DELETE_EXPR
22912 || TREE_CODE (expression
) == THROW_EXPR
22913 || TREE_CODE (expression
) == REQUIRES_EXPR
)
22916 /* The types of these expressions depends only on the type to which
22917 the cast occurs. */
22918 if (TREE_CODE (expression
) == DYNAMIC_CAST_EXPR
22919 || TREE_CODE (expression
) == STATIC_CAST_EXPR
22920 || TREE_CODE (expression
) == CONST_CAST_EXPR
22921 || TREE_CODE (expression
) == REINTERPRET_CAST_EXPR
22922 || TREE_CODE (expression
) == IMPLICIT_CONV_EXPR
22923 || TREE_CODE (expression
) == CAST_EXPR
)
22924 return dependent_type_p (TREE_TYPE (expression
));
22926 /* The types of these expressions depends only on the type created
22927 by the expression. */
22928 if (TREE_CODE (expression
) == NEW_EXPR
22929 || TREE_CODE (expression
) == VEC_NEW_EXPR
)
22931 /* For NEW_EXPR tree nodes created inside a template, either
22932 the object type itself or a TREE_LIST may appear as the
22934 tree type
= TREE_OPERAND (expression
, 1);
22935 if (TREE_CODE (type
) == TREE_LIST
)
22936 /* This is an array type. We need to check array dimensions
22938 return dependent_type_p (TREE_VALUE (TREE_PURPOSE (type
)))
22939 || value_dependent_expression_p
22940 (TREE_OPERAND (TREE_VALUE (type
), 1));
22942 return dependent_type_p (type
);
22945 if (TREE_CODE (expression
) == SCOPE_REF
)
22947 tree scope
= TREE_OPERAND (expression
, 0);
22948 tree name
= TREE_OPERAND (expression
, 1);
22950 /* 14.6.2.2 [temp.dep.expr]: An id-expression is type-dependent if it
22951 contains an identifier associated by name lookup with one or more
22952 declarations declared with a dependent type, or...a
22953 nested-name-specifier or qualified-id that names a member of an
22954 unknown specialization. */
22955 return (type_dependent_expression_p (name
)
22956 || dependent_scope_p (scope
));
22959 /* A function template specialization is type-dependent if it has any
22960 dependent template arguments. */
22961 if (TREE_CODE (expression
) == FUNCTION_DECL
22962 && DECL_LANG_SPECIFIC (expression
)
22963 && DECL_TEMPLATE_INFO (expression
))
22964 return any_dependent_template_arguments_p (DECL_TI_ARGS (expression
));
22966 if (TREE_CODE (expression
) == TEMPLATE_DECL
22967 && !DECL_TEMPLATE_TEMPLATE_PARM_P (expression
))
22970 if (TREE_CODE (expression
) == STMT_EXPR
)
22971 expression
= stmt_expr_value_expr (expression
);
22973 if (BRACE_ENCLOSED_INITIALIZER_P (expression
))
22978 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (expression
), i
, elt
)
22980 if (type_dependent_expression_p (elt
))
22986 /* A static data member of the current instantiation with incomplete
22987 array type is type-dependent, as the definition and specializations
22988 can have different bounds. */
22989 if (VAR_P (expression
)
22990 && DECL_CLASS_SCOPE_P (expression
)
22991 && dependent_type_p (DECL_CONTEXT (expression
))
22992 && VAR_HAD_UNKNOWN_BOUND (expression
))
22995 /* An array of unknown bound depending on a variadic parameter, eg:
22997 template<typename... Args>
22998 void foo (Args... args)
23000 int arr[] = { args... };
23003 template<int... vals>
23006 int arr[] = { vals... };
23009 If the array has no length and has an initializer, it must be that
23010 we couldn't determine its length in cp_complete_array_type because
23011 it is dependent. */
23012 if (VAR_P (expression
)
23013 && TREE_CODE (TREE_TYPE (expression
)) == ARRAY_TYPE
23014 && !TYPE_DOMAIN (TREE_TYPE (expression
))
23015 && DECL_INITIAL (expression
))
23018 /* A variable template specialization is type-dependent if it has any
23019 dependent template arguments. */
23020 if (VAR_P (expression
)
23021 && DECL_LANG_SPECIFIC (expression
)
23022 && DECL_TEMPLATE_INFO (expression
)
23023 && variable_template_p (DECL_TI_TEMPLATE (expression
)))
23024 return any_dependent_template_arguments_p (DECL_TI_ARGS (expression
));
23026 /* Always dependent, on the number of arguments if nothing else. */
23027 if (TREE_CODE (expression
) == EXPR_PACK_EXPANSION
)
23030 if (TREE_TYPE (expression
) == unknown_type_node
)
23032 if (TREE_CODE (expression
) == ADDR_EXPR
)
23033 return type_dependent_expression_p (TREE_OPERAND (expression
, 0));
23034 if (TREE_CODE (expression
) == COMPONENT_REF
23035 || TREE_CODE (expression
) == OFFSET_REF
)
23037 if (type_dependent_expression_p (TREE_OPERAND (expression
, 0)))
23039 expression
= TREE_OPERAND (expression
, 1);
23040 if (identifier_p (expression
))
23043 /* SCOPE_REF with non-null TREE_TYPE is always non-dependent. */
23044 if (TREE_CODE (expression
) == SCOPE_REF
)
23047 if (BASELINK_P (expression
))
23049 if (BASELINK_OPTYPE (expression
)
23050 && dependent_type_p (BASELINK_OPTYPE (expression
)))
23052 expression
= BASELINK_FUNCTIONS (expression
);
23055 if (TREE_CODE (expression
) == TEMPLATE_ID_EXPR
)
23057 if (any_dependent_template_arguments_p
23058 (TREE_OPERAND (expression
, 1)))
23060 expression
= TREE_OPERAND (expression
, 0);
23061 if (identifier_p (expression
))
23065 gcc_assert (TREE_CODE (expression
) == OVERLOAD
23066 || TREE_CODE (expression
) == FUNCTION_DECL
);
23070 if (type_dependent_expression_p (OVL_CURRENT (expression
)))
23072 expression
= OVL_NEXT (expression
);
23077 gcc_assert (TREE_CODE (expression
) != TYPE_DECL
);
23079 return (dependent_type_p (TREE_TYPE (expression
)));
23082 /* walk_tree callback function for instantiation_dependent_expression_p,
23083 below. Returns non-zero if a dependent subexpression is found. */
23086 instantiation_dependent_r (tree
*tp
, int *walk_subtrees
,
23091 /* We don't have to worry about decltype currently because decltype
23092 of an instantiation-dependent expr is a dependent type. This
23093 might change depending on the resolution of DR 1172. */
23094 *walk_subtrees
= false;
23097 enum tree_code code
= TREE_CODE (*tp
);
23100 /* Don't treat an argument list as dependent just because it has no
23106 case TEMPLATE_PARM_INDEX
:
23109 /* Handle expressions with type operands. */
23113 case AT_ENCODE_EXPR
:
23115 tree op
= TREE_OPERAND (*tp
, 0);
23116 if (code
== SIZEOF_EXPR
&& SIZEOF_EXPR_TYPE_P (*tp
))
23117 op
= TREE_TYPE (op
);
23120 if (dependent_type_p (op
))
23124 *walk_subtrees
= false;
23131 case COMPONENT_REF
:
23132 if (identifier_p (TREE_OPERAND (*tp
, 1)))
23133 /* In a template, finish_class_member_access_expr creates a
23134 COMPONENT_REF with an IDENTIFIER_NODE for op1 even if it isn't
23135 type-dependent, so that we can check access control at
23136 instantiation time (PR 42277). See also Core issue 1273. */
23141 if (instantiation_dependent_scope_ref_p (*tp
))
23146 /* Treat statement-expressions as dependent. */
23150 /* Treat requires-expressions as dependent. */
23151 case REQUIRES_EXPR
:
23155 /* Treat calls to function concepts as dependent. */
23156 if (function_concept_check_p (*tp
))
23160 case TEMPLATE_ID_EXPR
:
23161 /* And variable concepts. */
23162 if (variable_concept_p (TREE_OPERAND (*tp
, 0)))
23170 if (type_dependent_expression_p (*tp
))
23176 /* Returns TRUE if the EXPRESSION is instantiation-dependent, in the
23177 sense defined by the ABI:
23179 "An expression is instantiation-dependent if it is type-dependent
23180 or value-dependent, or it has a subexpression that is type-dependent
23181 or value-dependent."
23183 Except don't actually check value-dependence for unevaluated expressions,
23184 because in sizeof(i) we don't care about the value of i. Checking
23185 type-dependence will in turn check value-dependence of array bounds/template
23186 arguments as needed. */
23189 instantiation_dependent_uneval_expression_p (tree expression
)
23193 if (!processing_template_decl
)
23196 if (expression
== error_mark_node
)
23199 result
= cp_walk_tree_without_duplicates (&expression
,
23200 instantiation_dependent_r
, NULL
);
23201 return result
!= NULL_TREE
;
23204 /* As above, but also check value-dependence of the expression as a whole. */
23207 instantiation_dependent_expression_p (tree expression
)
23209 return (instantiation_dependent_uneval_expression_p (expression
)
23210 || value_dependent_expression_p (expression
));
23213 /* Like type_dependent_expression_p, but it also works while not processing
23214 a template definition, i.e. during substitution or mangling. */
23217 type_dependent_expression_p_push (tree expr
)
23220 ++processing_template_decl
;
23221 b
= type_dependent_expression_p (expr
);
23222 --processing_template_decl
;
23226 /* Returns TRUE if ARGS contains a type-dependent expression. */
23229 any_type_dependent_arguments_p (const vec
<tree
, va_gc
> *args
)
23234 FOR_EACH_VEC_SAFE_ELT (args
, i
, arg
)
23236 if (type_dependent_expression_p (arg
))
23242 /* Returns TRUE if LIST (a TREE_LIST whose TREE_VALUEs are
23243 expressions) contains any type-dependent expressions. */
23246 any_type_dependent_elements_p (const_tree list
)
23248 for (; list
; list
= TREE_CHAIN (list
))
23249 if (type_dependent_expression_p (TREE_VALUE (list
)))
23255 /* Returns TRUE if LIST (a TREE_LIST whose TREE_VALUEs are
23256 expressions) contains any value-dependent expressions. */
23259 any_value_dependent_elements_p (const_tree list
)
23261 for (; list
; list
= TREE_CHAIN (list
))
23262 if (value_dependent_expression_p (TREE_VALUE (list
)))
23268 /* Returns TRUE if the ARG (a template argument) is dependent. */
23271 dependent_template_arg_p (tree arg
)
23273 if (!processing_template_decl
)
23276 /* Assume a template argument that was wrongly written by the user
23277 is dependent. This is consistent with what
23278 any_dependent_template_arguments_p [that calls this function]
23280 if (!arg
|| arg
== error_mark_node
)
23283 if (TREE_CODE (arg
) == ARGUMENT_PACK_SELECT
)
23284 arg
= ARGUMENT_PACK_SELECT_ARG (arg
);
23286 if (TREE_CODE (arg
) == TEMPLATE_DECL
23287 || TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
)
23288 return dependent_template_p (arg
);
23289 else if (ARGUMENT_PACK_P (arg
))
23291 tree args
= ARGUMENT_PACK_ARGS (arg
);
23292 int i
, len
= TREE_VEC_LENGTH (args
);
23293 for (i
= 0; i
< len
; ++i
)
23295 if (dependent_template_arg_p (TREE_VEC_ELT (args
, i
)))
23301 else if (TYPE_P (arg
))
23302 return dependent_type_p (arg
);
23304 return (type_dependent_expression_p (arg
)
23305 || value_dependent_expression_p (arg
));
23308 /* Returns true if ARGS (a collection of template arguments) contains
23309 any types that require structural equality testing. */
23312 any_template_arguments_need_structural_equality_p (tree args
)
23319 if (args
== error_mark_node
)
23322 for (i
= 0; i
< TMPL_ARGS_DEPTH (args
); ++i
)
23324 tree level
= TMPL_ARGS_LEVEL (args
, i
+ 1);
23325 for (j
= 0; j
< TREE_VEC_LENGTH (level
); ++j
)
23327 tree arg
= TREE_VEC_ELT (level
, j
);
23328 tree packed_args
= NULL_TREE
;
23331 if (ARGUMENT_PACK_P (arg
))
23333 /* Look inside the argument pack. */
23334 packed_args
= ARGUMENT_PACK_ARGS (arg
);
23335 len
= TREE_VEC_LENGTH (packed_args
);
23338 for (k
= 0; k
< len
; ++k
)
23341 arg
= TREE_VEC_ELT (packed_args
, k
);
23343 if (error_operand_p (arg
))
23345 else if (TREE_CODE (arg
) == TEMPLATE_DECL
)
23347 else if (TYPE_P (arg
) && TYPE_STRUCTURAL_EQUALITY_P (arg
))
23349 else if (!TYPE_P (arg
) && TREE_TYPE (arg
)
23350 && TYPE_STRUCTURAL_EQUALITY_P (TREE_TYPE (arg
)))
23359 /* Returns true if ARGS (a collection of template arguments) contains
23360 any dependent arguments. */
23363 any_dependent_template_arguments_p (const_tree args
)
23370 if (args
== error_mark_node
)
23373 for (i
= 0; i
< TMPL_ARGS_DEPTH (args
); ++i
)
23375 const_tree level
= TMPL_ARGS_LEVEL (args
, i
+ 1);
23376 for (j
= 0; j
< TREE_VEC_LENGTH (level
); ++j
)
23377 if (dependent_template_arg_p (TREE_VEC_ELT (level
, j
)))
23384 /* Returns TRUE if the template TMPL is dependent. */
23387 dependent_template_p (tree tmpl
)
23389 if (TREE_CODE (tmpl
) == OVERLOAD
)
23393 if (dependent_template_p (OVL_CURRENT (tmpl
)))
23395 tmpl
= OVL_NEXT (tmpl
);
23400 /* Template template parameters are dependent. */
23401 if (DECL_TEMPLATE_TEMPLATE_PARM_P (tmpl
)
23402 || TREE_CODE (tmpl
) == TEMPLATE_TEMPLATE_PARM
)
23404 /* So are names that have not been looked up. */
23405 if (TREE_CODE (tmpl
) == SCOPE_REF
|| identifier_p (tmpl
))
23407 /* So are member templates of dependent classes. */
23408 if (TYPE_P (CP_DECL_CONTEXT (tmpl
)))
23409 return dependent_type_p (DECL_CONTEXT (tmpl
));
23413 /* Returns TRUE if the specialization TMPL<ARGS> is dependent. */
23416 dependent_template_id_p (tree tmpl
, tree args
)
23418 return (dependent_template_p (tmpl
)
23419 || any_dependent_template_arguments_p (args
));
23422 /* Returns TRUE if OMP_FOR with DECLV, INITV, CONDV and INCRV vectors
23426 dependent_omp_for_p (tree declv
, tree initv
, tree condv
, tree incrv
)
23430 if (!processing_template_decl
)
23433 for (i
= 0; i
< TREE_VEC_LENGTH (declv
); i
++)
23435 tree decl
= TREE_VEC_ELT (declv
, i
);
23436 tree init
= TREE_VEC_ELT (initv
, i
);
23437 tree cond
= TREE_VEC_ELT (condv
, i
);
23438 tree incr
= TREE_VEC_ELT (incrv
, i
);
23440 if (type_dependent_expression_p (decl
)
23441 || TREE_CODE (decl
) == SCOPE_REF
)
23444 if (init
&& type_dependent_expression_p (init
))
23447 if (type_dependent_expression_p (cond
))
23450 if (COMPARISON_CLASS_P (cond
)
23451 && (type_dependent_expression_p (TREE_OPERAND (cond
, 0))
23452 || type_dependent_expression_p (TREE_OPERAND (cond
, 1))))
23455 if (TREE_CODE (incr
) == MODOP_EXPR
)
23457 if (type_dependent_expression_p (TREE_OPERAND (incr
, 0))
23458 || type_dependent_expression_p (TREE_OPERAND (incr
, 2)))
23461 else if (type_dependent_expression_p (incr
))
23463 else if (TREE_CODE (incr
) == MODIFY_EXPR
)
23465 if (type_dependent_expression_p (TREE_OPERAND (incr
, 0)))
23467 else if (BINARY_CLASS_P (TREE_OPERAND (incr
, 1)))
23469 tree t
= TREE_OPERAND (incr
, 1);
23470 if (type_dependent_expression_p (TREE_OPERAND (t
, 0))
23471 || type_dependent_expression_p (TREE_OPERAND (t
, 1)))
23480 /* TYPE is a TYPENAME_TYPE. Returns the ordinary TYPE to which the
23481 TYPENAME_TYPE corresponds. Returns the original TYPENAME_TYPE if
23482 no such TYPE can be found. Note that this function peers inside
23483 uninstantiated templates and therefore should be used only in
23484 extremely limited situations. ONLY_CURRENT_P restricts this
23485 peering to the currently open classes hierarchy (which is required
23486 when comparing types). */
23489 resolve_typename_type (tree type
, bool only_current_p
)
23498 gcc_assert (TREE_CODE (type
) == TYPENAME_TYPE
);
23500 scope
= TYPE_CONTEXT (type
);
23501 /* Usually the non-qualified identifier of a TYPENAME_TYPE is
23502 TYPE_IDENTIFIER (type). But when 'type' is a typedef variant of
23503 a TYPENAME_TYPE node, then TYPE_NAME (type) is set to the TYPE_DECL representing
23504 the typedef. In that case TYPE_IDENTIFIER (type) is not the non-qualified
23505 identifier of the TYPENAME_TYPE anymore.
23506 So by getting the TYPE_IDENTIFIER of the _main declaration_ of the
23507 TYPENAME_TYPE instead, we avoid messing up with a possible
23508 typedef variant case. */
23509 name
= TYPE_IDENTIFIER (TYPE_MAIN_VARIANT (type
));
23511 /* If the SCOPE is itself a TYPENAME_TYPE, then we need to resolve
23512 it first before we can figure out what NAME refers to. */
23513 if (TREE_CODE (scope
) == TYPENAME_TYPE
)
23515 if (TYPENAME_IS_RESOLVING_P (scope
))
23516 /* Given a class template A with a dependent base with nested type C,
23517 typedef typename A::C::C C will land us here, as trying to resolve
23518 the initial A::C leads to the local C typedef, which leads back to
23519 A::C::C. So we break the recursion now. */
23522 scope
= resolve_typename_type (scope
, only_current_p
);
23524 /* If we don't know what SCOPE refers to, then we cannot resolve the
23526 if (TREE_CODE (scope
) == TYPENAME_TYPE
)
23528 /* If the SCOPE is a template type parameter, we have no way of
23529 resolving the name. */
23530 if (TREE_CODE (scope
) == TEMPLATE_TYPE_PARM
)
23532 /* If the SCOPE is not the current instantiation, there's no reason
23533 to look inside it. */
23534 if (only_current_p
&& !currently_open_class (scope
))
23536 /* If this is a typedef, we don't want to look inside (c++/11987). */
23537 if (typedef_variant_p (type
))
23539 /* If SCOPE isn't the template itself, it will not have a valid
23540 TYPE_FIELDS list. */
23541 if (CLASS_TYPE_P (scope
)
23542 && same_type_p (scope
, CLASSTYPE_PRIMARY_TEMPLATE_TYPE (scope
)))
23543 /* scope is either the template itself or a compatible instantiation
23544 like X<T>, so look up the name in the original template. */
23545 scope
= CLASSTYPE_PRIMARY_TEMPLATE_TYPE (scope
);
23547 /* scope is a partial instantiation, so we can't do the lookup or we
23548 will lose the template arguments. */
23550 /* Enter the SCOPE so that name lookup will be resolved as if we
23551 were in the class definition. In particular, SCOPE will no
23552 longer be considered a dependent type. */
23553 pushed_scope
= push_scope (scope
);
23554 /* Look up the declaration. */
23555 decl
= lookup_member (scope
, name
, /*protect=*/0, /*want_type=*/true,
23556 tf_warning_or_error
);
23558 result
= NULL_TREE
;
23560 /* For a TYPENAME_TYPE like "typename X::template Y<T>", we want to
23561 find a TEMPLATE_DECL. Otherwise, we want to find a TYPE_DECL. */
23564 else if (identifier_p (TYPENAME_TYPE_FULLNAME (type
))
23565 && TREE_CODE (decl
) == TYPE_DECL
)
23567 result
= TREE_TYPE (decl
);
23568 if (result
== error_mark_node
)
23569 result
= NULL_TREE
;
23571 else if (TREE_CODE (TYPENAME_TYPE_FULLNAME (type
)) == TEMPLATE_ID_EXPR
23572 && DECL_CLASS_TEMPLATE_P (decl
))
23576 /* Obtain the template and the arguments. */
23577 tmpl
= TREE_OPERAND (TYPENAME_TYPE_FULLNAME (type
), 0);
23578 args
= TREE_OPERAND (TYPENAME_TYPE_FULLNAME (type
), 1);
23579 /* Instantiate the template. */
23580 result
= lookup_template_class (tmpl
, args
, NULL_TREE
, NULL_TREE
,
23581 /*entering_scope=*/0,
23582 tf_error
| tf_user
);
23583 if (result
== error_mark_node
)
23584 result
= NULL_TREE
;
23587 /* Leave the SCOPE. */
23589 pop_scope (pushed_scope
);
23591 /* If we failed to resolve it, return the original typename. */
23595 /* If lookup found a typename type, resolve that too. */
23596 if (TREE_CODE (result
) == TYPENAME_TYPE
&& !TYPENAME_IS_RESOLVING_P (result
))
23598 /* Ill-formed programs can cause infinite recursion here, so we
23599 must catch that. */
23600 TYPENAME_IS_RESOLVING_P (result
) = 1;
23601 result
= resolve_typename_type (result
, only_current_p
);
23602 TYPENAME_IS_RESOLVING_P (result
) = 0;
23605 /* Qualify the resulting type. */
23606 quals
= cp_type_quals (type
);
23608 result
= cp_build_qualified_type (result
, cp_type_quals (result
) | quals
);
23613 /* EXPR is an expression which is not type-dependent. Return a proxy
23614 for EXPR that can be used to compute the types of larger
23615 expressions containing EXPR. */
23618 build_non_dependent_expr (tree expr
)
23622 /* When checking, try to get a constant value for all non-dependent
23623 expressions in order to expose bugs in *_dependent_expression_p
23625 if (flag_checking
&& cxx_dialect
>= cxx11
23626 /* Don't do this during nsdmi parsing as it can lead to
23627 unexpected recursive instantiations. */
23628 && !parsing_nsdmi ())
23629 fold_non_dependent_expr (expr
);
23631 /* Preserve OVERLOADs; the functions must be available to resolve
23634 if (TREE_CODE (inner_expr
) == STMT_EXPR
)
23635 inner_expr
= stmt_expr_value_expr (inner_expr
);
23636 if (TREE_CODE (inner_expr
) == ADDR_EXPR
)
23637 inner_expr
= TREE_OPERAND (inner_expr
, 0);
23638 if (TREE_CODE (inner_expr
) == COMPONENT_REF
)
23639 inner_expr
= TREE_OPERAND (inner_expr
, 1);
23640 if (is_overloaded_fn (inner_expr
)
23641 || TREE_CODE (inner_expr
) == OFFSET_REF
)
23643 /* There is no need to return a proxy for a variable. */
23646 /* Preserve string constants; conversions from string constants to
23647 "char *" are allowed, even though normally a "const char *"
23648 cannot be used to initialize a "char *". */
23649 if (TREE_CODE (expr
) == STRING_CST
)
23651 /* Preserve void and arithmetic constants, as an optimization -- there is no
23652 reason to create a new node. */
23653 if (TREE_CODE (expr
) == VOID_CST
23654 || TREE_CODE (expr
) == INTEGER_CST
23655 || TREE_CODE (expr
) == REAL_CST
)
23657 /* Preserve THROW_EXPRs -- all throw-expressions have type "void".
23658 There is at least one place where we want to know that a
23659 particular expression is a throw-expression: when checking a ?:
23660 expression, there are special rules if the second or third
23661 argument is a throw-expression. */
23662 if (TREE_CODE (expr
) == THROW_EXPR
)
23665 /* Don't wrap an initializer list, we need to be able to look inside. */
23666 if (BRACE_ENCLOSED_INITIALIZER_P (expr
))
23669 /* Don't wrap a dummy object, we need to be able to test for it. */
23670 if (is_dummy_object (expr
))
23673 if (TREE_CODE (expr
) == COND_EXPR
)
23674 return build3 (COND_EXPR
,
23676 TREE_OPERAND (expr
, 0),
23677 (TREE_OPERAND (expr
, 1)
23678 ? build_non_dependent_expr (TREE_OPERAND (expr
, 1))
23679 : build_non_dependent_expr (TREE_OPERAND (expr
, 0))),
23680 build_non_dependent_expr (TREE_OPERAND (expr
, 2)));
23681 if (TREE_CODE (expr
) == COMPOUND_EXPR
23682 && !COMPOUND_EXPR_OVERLOADED (expr
))
23683 return build2 (COMPOUND_EXPR
,
23685 TREE_OPERAND (expr
, 0),
23686 build_non_dependent_expr (TREE_OPERAND (expr
, 1)));
23688 /* If the type is unknown, it can't really be non-dependent */
23689 gcc_assert (TREE_TYPE (expr
) != unknown_type_node
);
23691 /* Otherwise, build a NON_DEPENDENT_EXPR. */
23692 return build1 (NON_DEPENDENT_EXPR
, TREE_TYPE (expr
), expr
);
23695 /* ARGS is a vector of expressions as arguments to a function call.
23696 Replace the arguments with equivalent non-dependent expressions.
23697 This modifies ARGS in place. */
23700 make_args_non_dependent (vec
<tree
, va_gc
> *args
)
23705 FOR_EACH_VEC_SAFE_ELT (args
, ix
, arg
)
23707 tree newarg
= build_non_dependent_expr (arg
);
23709 (*args
)[ix
] = newarg
;
23713 /* Returns a type which represents 'auto' or 'decltype(auto)'. We use a
23714 TEMPLATE_TYPE_PARM with a level one deeper than the actual template
23715 parms. If set_canonical is true, we set TYPE_CANONICAL on it. */
23718 make_auto_1 (tree name
, bool set_canonical
)
23720 tree au
= cxx_make_type (TEMPLATE_TYPE_PARM
);
23721 TYPE_NAME (au
) = build_decl (input_location
,
23722 TYPE_DECL
, name
, au
);
23723 TYPE_STUB_DECL (au
) = TYPE_NAME (au
);
23724 TEMPLATE_TYPE_PARM_INDEX (au
) = build_template_parm_index
23725 (0, processing_template_decl
+ 1, processing_template_decl
+ 1,
23726 TYPE_NAME (au
), NULL_TREE
);
23728 TYPE_CANONICAL (au
) = canonical_type_parameter (au
);
23729 DECL_ARTIFICIAL (TYPE_NAME (au
)) = 1;
23730 SET_DECL_TEMPLATE_PARM_P (TYPE_NAME (au
));
23736 make_decltype_auto (void)
23738 return make_auto_1 (get_identifier ("decltype(auto)"), true);
23744 return make_auto_1 (get_identifier ("auto"), true);
23747 /* Make a "constrained auto" type-specifier. This is an
23748 auto type with constraints that must be associated after
23749 deduction. The constraint is formed from the given
23750 CONC and its optional sequence of arguments, which are
23751 non-null if written as partial-concept-id. */
23754 make_constrained_auto (tree con
, tree args
)
23756 tree type
= make_auto_1 (get_identifier ("auto"), false);
23758 /* Build the constraint. */
23759 tree tmpl
= DECL_TI_TEMPLATE (con
);
23762 expr
= build_concept_check (tmpl
, type
, args
);
23764 expr
= build_concept_check (build_overload (tmpl
, NULL_TREE
), type
, args
);
23766 tree constr
= make_predicate_constraint (expr
);
23767 PLACEHOLDER_TYPE_CONSTRAINTS (type
) = constr
;
23769 /* Our canonical type depends on the constraint. */
23770 TYPE_CANONICAL (type
) = canonical_type_parameter (type
);
23772 /* Attach the constraint to the type declaration. */
23773 tree decl
= TYPE_NAME (type
);
23777 /* Given type ARG, return std::initializer_list<ARG>. */
23782 tree std_init_list
= namespace_binding
23783 (get_identifier ("initializer_list"), std_node
);
23785 if (!std_init_list
|| !DECL_CLASS_TEMPLATE_P (std_init_list
))
23787 error ("deducing from brace-enclosed initializer list requires "
23788 "#include <initializer_list>");
23789 return error_mark_node
;
23791 argvec
= make_tree_vec (1);
23792 TREE_VEC_ELT (argvec
, 0) = arg
;
23793 return lookup_template_class (std_init_list
, argvec
, NULL_TREE
,
23794 NULL_TREE
, 0, tf_warning_or_error
);
23797 /* Replace auto in TYPE with std::initializer_list<auto>. */
23800 listify_autos (tree type
, tree auto_node
)
23802 tree init_auto
= listify (auto_node
);
23803 tree argvec
= make_tree_vec (1);
23804 TREE_VEC_ELT (argvec
, 0) = init_auto
;
23805 if (processing_template_decl
)
23806 argvec
= add_to_template_args (current_template_args (), argvec
);
23807 return tsubst (type
, argvec
, tf_warning_or_error
, NULL_TREE
);
23810 /* Hash traits for hashing possibly constrained 'auto'
23811 TEMPLATE_TYPE_PARMs for use by do_auto_deduction. */
23813 struct auto_hash
: default_hash_traits
<tree
>
23815 static inline hashval_t
hash (tree
);
23816 static inline bool equal (tree
, tree
);
23819 /* Hash the 'auto' T. */
23822 auto_hash::hash (tree t
)
23824 if (tree c
= PLACEHOLDER_TYPE_CONSTRAINTS (t
))
23825 /* Matching constrained-type-specifiers denote the same template
23826 parameter, so hash the constraint. */
23827 return hash_placeholder_constraint (c
);
23829 /* But unconstrained autos are all separate, so just hash the pointer. */
23830 return iterative_hash_object (t
, 0);
23833 /* Compare two 'auto's. */
23836 auto_hash::equal (tree t1
, tree t2
)
23841 tree c1
= PLACEHOLDER_TYPE_CONSTRAINTS (t1
);
23842 tree c2
= PLACEHOLDER_TYPE_CONSTRAINTS (t2
);
23844 /* Two unconstrained autos are distinct. */
23848 return equivalent_placeholder_constraints (c1
, c2
);
23851 /* for_each_template_parm callback for extract_autos: if t is a (possibly
23852 constrained) auto, add it to the vector. */
23855 extract_autos_r (tree t
, void *data
)
23857 hash_table
<auto_hash
> &hash
= *(hash_table
<auto_hash
>*)data
;
23858 if (is_auto_or_concept (t
))
23860 /* All the autos were built with index 0; fix that up now. */
23861 tree
*p
= hash
.find_slot (t
, INSERT
);
23864 /* If this is a repeated constrained-type-specifier, use the index we
23866 idx
= TEMPLATE_PARM_IDX (TEMPLATE_TYPE_PARM_INDEX (*p
));
23869 /* Otherwise this is new, so use the current count. */
23871 idx
= hash
.elements () - 1;
23873 TEMPLATE_PARM_IDX (TEMPLATE_TYPE_PARM_INDEX (t
)) = idx
;
23876 /* Always keep walking. */
23880 /* Return a TREE_VEC of the 'auto's used in type under the Concepts TS, which
23881 says they can appear anywhere in the type. */
23884 extract_autos (tree type
)
23886 hash_set
<tree
> visited
;
23887 hash_table
<auto_hash
> hash (2);
23889 for_each_template_parm (type
, extract_autos_r
, &hash
, &visited
, true);
23891 tree tree_vec
= make_tree_vec (hash
.elements());
23892 for (hash_table
<auto_hash
>::iterator iter
= hash
.begin();
23893 iter
!= hash
.end(); ++iter
)
23896 unsigned i
= TEMPLATE_PARM_IDX (TEMPLATE_TYPE_PARM_INDEX (elt
));
23897 TREE_VEC_ELT (tree_vec
, i
)
23898 = build_tree_list (NULL_TREE
, TYPE_NAME (elt
));
23904 /* Replace occurrences of 'auto' in TYPE with the appropriate type deduced
23905 from INIT. AUTO_NODE is the TEMPLATE_TYPE_PARM used for 'auto' in TYPE. */
23908 do_auto_deduction (tree type
, tree init
, tree auto_node
)
23910 return do_auto_deduction (type
, init
, auto_node
,
23911 tf_warning_or_error
,
23915 /* Replace occurrences of 'auto' in TYPE with the appropriate type deduced
23916 from INIT. AUTO_NODE is the TEMPLATE_TYPE_PARM used for 'auto' in TYPE.
23917 The CONTEXT determines the context in which auto deduction is performed
23918 and is used to control error diagnostics. */
23921 do_auto_deduction (tree type
, tree init
, tree auto_node
,
23922 tsubst_flags_t complain
, auto_deduction_context context
)
23926 if (init
== error_mark_node
)
23927 return error_mark_node
;
23929 if (type_dependent_expression_p (init
))
23930 /* Defining a subset of type-dependent expressions that we can deduce
23931 from ahead of time isn't worth the trouble. */
23934 /* [dcl.spec.auto]: Obtain P from T by replacing the occurrences of auto
23935 with either a new invented type template parameter U or, if the
23936 initializer is a braced-init-list (8.5.4), with
23937 std::initializer_list<U>. */
23938 if (BRACE_ENCLOSED_INITIALIZER_P (init
))
23940 if (!DIRECT_LIST_INIT_P (init
))
23941 type
= listify_autos (type
, auto_node
);
23942 else if (CONSTRUCTOR_NELTS (init
) == 1)
23943 init
= CONSTRUCTOR_ELT (init
, 0)->value
;
23946 if (complain
& tf_warning_or_error
)
23948 if (permerror (input_location
, "direct-list-initialization of "
23949 "%<auto%> requires exactly one element"))
23950 inform (input_location
,
23951 "for deduction to %<std::initializer_list%>, use copy-"
23952 "list-initialization (i.e. add %<=%> before the %<{%>)");
23954 type
= listify_autos (type
, auto_node
);
23958 if (type
== error_mark_node
)
23959 return error_mark_node
;
23961 init
= resolve_nondeduced_context (init
, complain
);
23963 if (AUTO_IS_DECLTYPE (auto_node
))
23965 bool id
= (DECL_P (init
) || (TREE_CODE (init
) == COMPONENT_REF
23966 && !REF_PARENTHESIZED_P (init
)));
23967 targs
= make_tree_vec (1);
23968 TREE_VEC_ELT (targs
, 0)
23969 = finish_decltype_type (init
, id
, tf_warning_or_error
);
23970 if (type
!= auto_node
)
23972 if (complain
& tf_error
)
23973 error ("%qT as type rather than plain %<decltype(auto)%>", type
);
23974 return error_mark_node
;
23979 tree parms
= build_tree_list (NULL_TREE
, type
);
23983 tparms
= extract_autos (type
);
23986 tparms
= make_tree_vec (1);
23987 TREE_VEC_ELT (tparms
, 0)
23988 = build_tree_list (NULL_TREE
, TYPE_NAME (auto_node
));
23991 targs
= make_tree_vec (TREE_VEC_LENGTH (tparms
));
23992 int val
= type_unification_real (tparms
, targs
, parms
, &init
, 1, 0,
23993 DEDUCE_CALL
, LOOKUP_NORMAL
,
23994 NULL
, /*explain_p=*/false);
23997 if (processing_template_decl
)
23998 /* Try again at instantiation time. */
24000 if (type
&& type
!= error_mark_node
24001 && (complain
& tf_error
))
24002 /* If type is error_mark_node a diagnostic must have been
24003 emitted by now. Also, having a mention to '<type error>'
24004 in the diagnostic is not really useful to the user. */
24006 if (cfun
&& auto_node
== current_function_auto_return_pattern
24007 && LAMBDA_FUNCTION_P (current_function_decl
))
24008 error ("unable to deduce lambda return type from %qE", init
);
24010 error ("unable to deduce %qT from %qE", type
, init
);
24011 type_unification_real (tparms
, targs
, parms
, &init
, 1, 0,
24012 DEDUCE_CALL
, LOOKUP_NORMAL
,
24013 NULL
, /*explain_p=*/true);
24015 return error_mark_node
;
24019 /* Check any placeholder constraints against the deduced type. */
24020 if (flag_concepts
&& !processing_template_decl
)
24021 if (tree constr
= PLACEHOLDER_TYPE_CONSTRAINTS (auto_node
))
24023 /* Use the deduced type to check the associated constraints. */
24024 if (!constraints_satisfied_p (constr
, targs
))
24026 if (complain
& tf_warning_or_error
)
24030 case adc_unspecified
:
24031 error("placeholder constraints not satisfied");
24033 case adc_variable_type
:
24034 error ("deduced initializer does not satisfy "
24035 "placeholder constraints");
24037 case adc_return_type
:
24038 error ("deduced return type does not satisfy "
24039 "placeholder constraints");
24041 case adc_requirement
:
24042 error ("deduced expression type does not saatisy "
24043 "placeholder constraints");
24046 diagnose_constraints (input_location
, constr
, targs
);
24048 return error_mark_node
;
24052 if (processing_template_decl
)
24053 targs
= add_to_template_args (current_template_args (), targs
);
24054 return tsubst (type
, targs
, complain
, NULL_TREE
);
24057 /* Substitutes LATE_RETURN_TYPE for 'auto' in TYPE and returns the
24061 splice_late_return_type (tree type
, tree late_return_type
)
24063 if (is_auto (type
))
24065 if (late_return_type
)
24066 return late_return_type
;
24068 tree idx
= get_template_parm_index (type
);
24069 if (TEMPLATE_PARM_LEVEL (idx
) <= processing_template_decl
)
24070 /* In an abbreviated function template we didn't know we were dealing
24071 with a function template when we saw the auto return type, so update
24072 it to have the correct level. */
24073 return make_auto_1 (TYPE_IDENTIFIER (type
), true);
24078 /* Returns true iff TYPE is a TEMPLATE_TYPE_PARM representing 'auto' or
24079 'decltype(auto)'. */
24082 is_auto (const_tree type
)
24084 if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
24085 && (TYPE_IDENTIFIER (type
) == get_identifier ("auto")
24086 || TYPE_IDENTIFIER (type
) == get_identifier ("decltype(auto)")))
24092 /* for_each_template_parm callback for type_uses_auto. */
24095 is_auto_r (tree tp
, void */
*data*/
)
24097 return is_auto_or_concept (tp
);
24100 /* Returns the TEMPLATE_TYPE_PARM in TYPE representing `auto' iff TYPE contains
24101 a use of `auto'. Returns NULL_TREE otherwise. */
24104 type_uses_auto (tree type
)
24106 if (type
== NULL_TREE
)
24108 else if (flag_concepts
)
24110 /* The Concepts TS allows multiple autos in one type-specifier; just
24111 return the first one we find, do_auto_deduction will collect all of
24113 if (uses_template_parms (type
))
24114 return for_each_template_parm (type
, is_auto_r
, /*data*/NULL
,
24115 /*visited*/NULL
, /*nondeduced*/true);
24120 return find_type_usage (type
, is_auto
);
24123 /* Returns true iff TYPE is a TEMPLATE_TYPE_PARM representing 'auto',
24124 'decltype(auto)' or a concept. */
24127 is_auto_or_concept (const_tree type
)
24129 return is_auto (type
); // or concept
24132 /* Returns the TEMPLATE_TYPE_PARM in TYPE representing a generic type (`auto' or
24133 a concept identifier) iff TYPE contains a use of a generic type. Returns
24134 NULL_TREE otherwise. */
24137 type_uses_auto_or_concept (tree type
)
24139 return find_type_usage (type
, is_auto_or_concept
);
24143 /* For a given template T, return the vector of typedefs referenced
24144 in T for which access check is needed at T instantiation time.
24145 T is either a FUNCTION_DECL or a RECORD_TYPE.
24146 Those typedefs were added to T by the function
24147 append_type_to_template_for_access_check. */
24149 vec
<qualified_typedef_usage_t
, va_gc
> *
24150 get_types_needing_access_check (tree t
)
24153 vec
<qualified_typedef_usage_t
, va_gc
> *result
= NULL
;
24155 if (!t
|| t
== error_mark_node
)
24158 if (!(ti
= get_template_info (t
)))
24161 if (CLASS_TYPE_P (t
)
24162 || TREE_CODE (t
) == FUNCTION_DECL
)
24164 if (!TI_TEMPLATE (ti
))
24167 result
= TI_TYPEDEFS_NEEDING_ACCESS_CHECKING (ti
);
24173 /* Append the typedef TYPE_DECL used in template T to a list of typedefs
24174 tied to T. That list of typedefs will be access checked at
24175 T instantiation time.
24176 T is either a FUNCTION_DECL or a RECORD_TYPE.
24177 TYPE_DECL is a TYPE_DECL node representing a typedef.
24178 SCOPE is the scope through which TYPE_DECL is accessed.
24179 LOCATION is the location of the usage point of TYPE_DECL.
24181 This function is a subroutine of
24182 append_type_to_template_for_access_check. */
24185 append_type_to_template_for_access_check_1 (tree t
,
24188 location_t location
)
24190 qualified_typedef_usage_t typedef_usage
;
24193 if (!t
|| t
== error_mark_node
)
24196 gcc_assert ((TREE_CODE (t
) == FUNCTION_DECL
24197 || CLASS_TYPE_P (t
))
24199 && TREE_CODE (type_decl
) == TYPE_DECL
24202 if (!(ti
= get_template_info (t
)))
24205 gcc_assert (TI_TEMPLATE (ti
));
24207 typedef_usage
.typedef_decl
= type_decl
;
24208 typedef_usage
.context
= scope
;
24209 typedef_usage
.locus
= location
;
24211 vec_safe_push (TI_TYPEDEFS_NEEDING_ACCESS_CHECKING (ti
), typedef_usage
);
24214 /* Append TYPE_DECL to the template TEMPL.
24215 TEMPL is either a class type, a FUNCTION_DECL or a a TEMPLATE_DECL.
24216 At TEMPL instanciation time, TYPE_DECL will be checked to see
24217 if it can be accessed through SCOPE.
24218 LOCATION is the location of the usage point of TYPE_DECL.
24220 e.g. consider the following code snippet:
24227 template<class U> struct S
24229 C::myint mi; // <-- usage point of the typedef C::myint
24234 At S<char> instantiation time, we need to check the access of C::myint
24235 In other words, we need to check the access of the myint typedef through
24236 the C scope. For that purpose, this function will add the myint typedef
24237 and the scope C through which its being accessed to a list of typedefs
24238 tied to the template S. That list will be walked at template instantiation
24239 time and access check performed on each typedefs it contains.
24240 Note that this particular code snippet should yield an error because
24241 myint is private to C. */
24244 append_type_to_template_for_access_check (tree templ
,
24247 location_t location
)
24249 qualified_typedef_usage_t
*iter
;
24252 gcc_assert (type_decl
&& (TREE_CODE (type_decl
) == TYPE_DECL
));
24254 /* Make sure we don't append the type to the template twice. */
24255 FOR_EACH_VEC_SAFE_ELT (get_types_needing_access_check (templ
), i
, iter
)
24256 if (iter
->typedef_decl
== type_decl
&& scope
== iter
->context
)
24259 append_type_to_template_for_access_check_1 (templ
, type_decl
,
24263 /* Convert the generic type parameters in PARM that match the types given in the
24264 range [START_IDX, END_IDX) from the current_template_parms into generic type
24268 convert_generic_types_to_packs (tree parm
, int start_idx
, int end_idx
)
24270 tree current
= current_template_parms
;
24271 int depth
= TMPL_PARMS_DEPTH (current
);
24272 current
= INNERMOST_TEMPLATE_PARMS (current
);
24273 tree replacement
= make_tree_vec (TREE_VEC_LENGTH (current
));
24275 for (int i
= 0; i
< start_idx
; ++i
)
24276 TREE_VEC_ELT (replacement
, i
)
24277 = TREE_TYPE (TREE_VALUE (TREE_VEC_ELT (current
, i
)));
24279 for (int i
= start_idx
; i
< end_idx
; ++i
)
24281 /* Create a distinct parameter pack type from the current parm and add it
24282 to the replacement args to tsubst below into the generic function
24285 tree o
= TREE_TYPE (TREE_VALUE
24286 (TREE_VEC_ELT (current
, i
)));
24287 tree t
= copy_type (o
);
24288 TEMPLATE_TYPE_PARM_INDEX (t
)
24289 = reduce_template_parm_level (TEMPLATE_TYPE_PARM_INDEX (o
),
24291 TREE_TYPE (TEMPLATE_TYPE_DECL (t
)) = t
;
24292 TYPE_STUB_DECL (t
) = TYPE_NAME (t
) = TEMPLATE_TYPE_DECL (t
);
24293 TYPE_MAIN_VARIANT (t
) = t
;
24294 TEMPLATE_TYPE_PARAMETER_PACK (t
) = true;
24295 TYPE_CANONICAL (t
) = canonical_type_parameter (t
);
24296 TREE_VEC_ELT (replacement
, i
) = t
;
24297 TREE_VALUE (TREE_VEC_ELT (current
, i
)) = TREE_CHAIN (t
);
24300 for (int i
= end_idx
, e
= TREE_VEC_LENGTH (current
); i
< e
; ++i
)
24301 TREE_VEC_ELT (replacement
, i
)
24302 = TREE_TYPE (TREE_VALUE (TREE_VEC_ELT (current
, i
)));
24304 /* If there are more levels then build up the replacement with the outer
24307 replacement
= add_to_template_args (template_parms_to_args
24308 (TREE_CHAIN (current_template_parms
)),
24311 return tsubst (parm
, replacement
, tf_none
, NULL_TREE
);
24314 /* Entries in the decl_constraint hash table. */
24315 struct GTY((for_user
)) constr_entry
24321 /* Hashing function and equality for constraint entries. */
24322 struct constr_hasher
: ggc_ptr_hash
<constr_entry
>
24324 static hashval_t
hash (constr_entry
*e
)
24326 return (hashval_t
)DECL_UID (e
->decl
);
24329 static bool equal (constr_entry
*e1
, constr_entry
*e2
)
24331 return e1
->decl
== e2
->decl
;
24335 /* A mapping from declarations to constraint information. Note that
24336 both templates and their underlying declarations are mapped to the
24337 same constraint information.
24339 FIXME: This is defined in pt.c because garbage collection
24340 code is not being generated for constraint.cc. */
24342 static GTY (()) hash_table
<constr_hasher
> *decl_constraints
;
24344 /* Returns true iff cinfo contains a valid set of constraints.
24345 This is the case when the associated requirements have been
24346 successfully decomposed into lists of atomic constraints.
24347 That is, when the saved assumptions are not error_mark_node. */
24350 valid_constraints_p (tree cinfo
)
24352 gcc_assert (cinfo
);
24353 return CI_ASSUMPTIONS (cinfo
) != error_mark_node
;
24356 /* Returns the template constraints of declaration T. If T is not
24357 constrained, return NULL_TREE. Note that T must be non-null. */
24360 get_constraints (tree t
)
24362 gcc_assert (DECL_P (t
));
24363 if (TREE_CODE (t
) == TEMPLATE_DECL
)
24364 t
= DECL_TEMPLATE_RESULT (t
);
24365 constr_entry elt
= { t
, NULL_TREE
};
24366 constr_entry
* found
= decl_constraints
->find (&elt
);
24373 /* Associate the given constraint information CI with the declaration
24374 T. If T is a template, then the constraints are associated with
24375 its underlying declaration. Don't build associations if CI is
24379 set_constraints (tree t
, tree ci
)
24384 if (TREE_CODE (t
) == TEMPLATE_DECL
)
24385 t
= DECL_TEMPLATE_RESULT (t
);
24386 gcc_assert (!get_constraints (t
));
24387 constr_entry elt
= {t
, ci
};
24388 constr_entry
** slot
= decl_constraints
->find_slot (&elt
, INSERT
);
24389 constr_entry
* entry
= ggc_alloc
<constr_entry
> ();
24394 /* Remove the associated constraints of the declaration T. */
24397 remove_constraints (tree t
)
24399 gcc_assert (DECL_P (t
));
24400 if (TREE_CODE (t
) == TEMPLATE_DECL
)
24401 t
= DECL_TEMPLATE_RESULT (t
);
24403 constr_entry elt
= {t
, NULL_TREE
};
24404 constr_entry
** slot
= decl_constraints
->find_slot (&elt
, NO_INSERT
);
24406 decl_constraints
->clear_slot (slot
);
24409 /* Set up the hash table for constraint association. */
24412 init_constraint_processing (void)
24414 decl_constraints
= hash_table
<constr_hasher
>::create_ggc(37);
24417 /* Set up the hash tables for template instantiations. */
24420 init_template_processing (void)
24422 decl_specializations
= hash_table
<spec_hasher
>::create_ggc (37);
24423 type_specializations
= hash_table
<spec_hasher
>::create_ggc (37);
24426 /* Print stats about the template hash tables for -fstats. */
24429 print_template_statistics (void)
24431 fprintf (stderr
, "decl_specializations: size %ld, %ld elements, "
24432 "%f collisions\n", (long) decl_specializations
->size (),
24433 (long) decl_specializations
->elements (),
24434 decl_specializations
->collisions ());
24435 fprintf (stderr
, "type_specializations: size %ld, %ld elements, "
24436 "%f collisions\n", (long) type_specializations
->size (),
24437 (long) type_specializations
->elements (),
24438 type_specializations
->collisions ());
24441 #include "gt-cp-pt.h"