1 /* Handle parameterized types (templates) for GNU -*- C++ -*-.
2 Copyright (C) 1992-2015 Free Software Foundation, Inc.
3 Written by Ken Raeburn (raeburn@cygnus.com) while at Watchmaker Computing.
4 Rewritten by Jason Merrill (jason@cygnus.com).
6 This file is part of GCC.
8 GCC is free software; you can redistribute it and/or modify
9 it under the terms of the GNU General Public License as published by
10 the Free Software Foundation; either version 3, or (at your option)
13 GCC is distributed in the hope that it will be useful,
14 but WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 GNU General Public License for more details.
18 You should have received a copy of the GNU General Public License
19 along with GCC; see the file COPYING3. If not see
20 <http://www.gnu.org/licenses/>. */
22 /* Known bugs or deficiencies include:
24 all methods must be provided in header files; can't use a source
25 file that contains only the method templates and "just win". */
29 #include "coretypes.h"
33 #include "stringpool.h"
36 #include "stor-layout.h"
40 #include "c-family/c-common.h"
41 #include "c-family/c-objc.h"
42 #include "cp-objcp-common.h"
43 #include "tree-inline.h"
47 #include "tree-iterator.h"
48 #include "type-utils.h"
51 /* The type of functions taking a tree, and some additional data, and
53 typedef int (*tree_fn_t
) (tree
, void*);
55 /* The PENDING_TEMPLATES is a TREE_LIST of templates whose
56 instantiations have been deferred, either because their definitions
57 were not yet available, or because we were putting off doing the work. */
58 struct GTY ((chain_next ("%h.next"))) pending_template
{
59 struct pending_template
*next
;
60 struct tinst_level
*tinst
;
63 static GTY(()) struct pending_template
*pending_templates
;
64 static GTY(()) struct pending_template
*last_pending_template
;
66 int processing_template_parmlist
;
67 static int template_header_count
;
69 static GTY(()) tree saved_trees
;
70 static vec
<int> inline_parm_levels
;
72 static GTY(()) struct tinst_level
*current_tinst_level
;
74 static GTY(()) tree saved_access_scope
;
76 /* Live only within one (recursive) call to tsubst_expr. We use
77 this to pass the statement expression node from the STMT_EXPR
78 to the EXPR_STMT that is its result. */
79 static tree cur_stmt_expr
;
81 // -------------------------------------------------------------------------- //
82 // Local Specialization Stack
84 // Implementation of the RAII helper for creating new local
86 local_specialization_stack::local_specialization_stack ()
87 : saved (local_specializations
)
89 local_specializations
= new hash_map
<tree
, tree
>;
92 local_specialization_stack::~local_specialization_stack ()
94 delete local_specializations
;
95 local_specializations
= saved
;
98 /* True if we've recursed into fn_type_unification too many times. */
99 static bool excessive_deduction_depth
;
101 struct GTY((for_user
)) spec_entry
108 struct spec_hasher
: ggc_ptr_hash
<spec_entry
>
110 static hashval_t
hash (spec_entry
*);
111 static bool equal (spec_entry
*, spec_entry
*);
114 static GTY (()) hash_table
<spec_hasher
> *decl_specializations
;
116 static GTY (()) hash_table
<spec_hasher
> *type_specializations
;
118 /* Contains canonical template parameter types. The vector is indexed by
119 the TEMPLATE_TYPE_IDX of the template parameter. Each element is a
120 TREE_LIST, whose TREE_VALUEs contain the canonical template
121 parameters of various types and levels. */
122 static GTY(()) vec
<tree
, va_gc
> *canonical_template_parms
;
124 #define UNIFY_ALLOW_NONE 0
125 #define UNIFY_ALLOW_MORE_CV_QUAL 1
126 #define UNIFY_ALLOW_LESS_CV_QUAL 2
127 #define UNIFY_ALLOW_DERIVED 4
128 #define UNIFY_ALLOW_INTEGER 8
129 #define UNIFY_ALLOW_OUTER_LEVEL 16
130 #define UNIFY_ALLOW_OUTER_MORE_CV_QUAL 32
131 #define UNIFY_ALLOW_OUTER_LESS_CV_QUAL 64
133 enum template_base_result
{
135 tbr_ambiguous_baseclass
,
139 static void push_access_scope (tree
);
140 static void pop_access_scope (tree
);
141 static bool resolve_overloaded_unification (tree
, tree
, tree
, tree
,
142 unification_kind_t
, int,
144 static int try_one_overload (tree
, tree
, tree
, tree
, tree
,
145 unification_kind_t
, int, bool, bool);
146 static int unify (tree
, tree
, tree
, tree
, int, bool);
147 static void add_pending_template (tree
);
148 static tree
reopen_tinst_level (struct tinst_level
*);
149 static tree
tsubst_initializer_list (tree
, tree
);
150 static tree
get_partial_spec_bindings (tree
, tree
, tree
, tree
);
151 static tree
coerce_template_parms (tree
, tree
, tree
, tsubst_flags_t
,
153 static tree
coerce_innermost_template_parms (tree
, tree
, tree
, tsubst_flags_t
,
155 static void tsubst_enum (tree
, tree
, tree
);
156 static tree
add_to_template_args (tree
, tree
);
157 static tree
add_outermost_template_args (tree
, tree
);
158 static bool check_instantiated_args (tree
, tree
, tsubst_flags_t
);
159 static int maybe_adjust_types_for_deduction (unification_kind_t
, tree
*, tree
*,
161 static int type_unification_real (tree
, tree
, tree
, const tree
*,
162 unsigned int, int, unification_kind_t
, int,
163 vec
<deferred_access_check
, va_gc
> **,
165 static void note_template_header (int);
166 static tree
convert_nontype_argument_function (tree
, tree
, tsubst_flags_t
);
167 static tree
convert_nontype_argument (tree
, tree
, tsubst_flags_t
);
168 static tree
convert_template_argument (tree
, tree
, tree
,
169 tsubst_flags_t
, int, tree
);
170 static int for_each_template_parm (tree
, tree_fn_t
, void*,
171 hash_set
<tree
> *, bool);
172 static tree
expand_template_argument_pack (tree
);
173 static tree
build_template_parm_index (int, int, int, tree
, tree
);
174 static bool inline_needs_template_parms (tree
, bool);
175 static void push_inline_template_parms_recursive (tree
, int);
176 static tree
reduce_template_parm_level (tree
, tree
, int, tree
, tsubst_flags_t
);
177 static int mark_template_parm (tree
, void *);
178 static int template_parm_this_level_p (tree
, void *);
179 static tree
tsubst_friend_function (tree
, tree
);
180 static tree
tsubst_friend_class (tree
, tree
);
181 static int can_complete_type_without_circularity (tree
);
182 static tree
get_bindings (tree
, tree
, tree
, bool);
183 static int template_decl_level (tree
);
184 static int check_cv_quals_for_unify (int, tree
, tree
);
185 static void template_parm_level_and_index (tree
, int*, int*);
186 static int unify_pack_expansion (tree
, tree
, tree
,
187 tree
, unification_kind_t
, bool, bool);
188 static tree
tsubst_template_arg (tree
, tree
, tsubst_flags_t
, tree
);
189 static tree
tsubst_template_args (tree
, tree
, tsubst_flags_t
, tree
);
190 static tree
tsubst_template_parms (tree
, tree
, tsubst_flags_t
);
191 static void regenerate_decl_from_template (tree
, tree
);
192 static tree
most_specialized_partial_spec (tree
, tsubst_flags_t
);
193 static tree
tsubst_aggr_type (tree
, tree
, tsubst_flags_t
, tree
, int);
194 static tree
tsubst_arg_types (tree
, tree
, tree
, tsubst_flags_t
, tree
);
195 static tree
tsubst_function_type (tree
, tree
, tsubst_flags_t
, tree
);
196 static bool check_specialization_scope (void);
197 static tree
process_partial_specialization (tree
);
198 static void set_current_access_from_decl (tree
);
199 static enum template_base_result
get_template_base (tree
, tree
, tree
, tree
,
201 static tree
try_class_unification (tree
, tree
, tree
, tree
, bool);
202 static int coerce_template_template_parms (tree
, tree
, tsubst_flags_t
,
204 static bool template_template_parm_bindings_ok_p (tree
, tree
);
205 static int template_args_equal (tree
, tree
);
206 static void tsubst_default_arguments (tree
, tsubst_flags_t
);
207 static tree
for_each_template_parm_r (tree
*, int *, void *);
208 static tree
copy_default_args_to_explicit_spec_1 (tree
, tree
);
209 static void copy_default_args_to_explicit_spec (tree
);
210 static int invalid_nontype_parm_type_p (tree
, tsubst_flags_t
);
211 static bool dependent_template_arg_p (tree
);
212 static bool any_template_arguments_need_structural_equality_p (tree
);
213 static bool dependent_type_p_r (tree
);
214 static tree
tsubst_copy (tree
, tree
, tsubst_flags_t
, tree
);
215 static tree
tsubst_decl (tree
, tree
, tsubst_flags_t
);
216 static void perform_typedefs_access_check (tree tmpl
, tree targs
);
217 static void append_type_to_template_for_access_check_1 (tree
, tree
, tree
,
219 static tree
listify (tree
);
220 static tree
listify_autos (tree
, tree
);
221 static tree
tsubst_template_parm (tree
, tree
, tsubst_flags_t
);
222 static tree
instantiate_alias_template (tree
, tree
, tsubst_flags_t
);
223 static bool complex_alias_template_p (const_tree tmpl
);
225 /* Make the current scope suitable for access checking when we are
226 processing T. T can be FUNCTION_DECL for instantiated function
227 template, VAR_DECL for static member variable, or TYPE_DECL for
228 alias template (needed by instantiate_decl). */
231 push_access_scope (tree t
)
233 gcc_assert (VAR_OR_FUNCTION_DECL_P (t
)
234 || TREE_CODE (t
) == TYPE_DECL
);
236 if (DECL_FRIEND_CONTEXT (t
))
237 push_nested_class (DECL_FRIEND_CONTEXT (t
));
238 else if (DECL_CLASS_SCOPE_P (t
))
239 push_nested_class (DECL_CONTEXT (t
));
241 push_to_top_level ();
243 if (TREE_CODE (t
) == FUNCTION_DECL
)
245 saved_access_scope
= tree_cons
246 (NULL_TREE
, current_function_decl
, saved_access_scope
);
247 current_function_decl
= t
;
251 /* Restore the scope set up by push_access_scope. T is the node we
255 pop_access_scope (tree t
)
257 if (TREE_CODE (t
) == FUNCTION_DECL
)
259 current_function_decl
= TREE_VALUE (saved_access_scope
);
260 saved_access_scope
= TREE_CHAIN (saved_access_scope
);
263 if (DECL_FRIEND_CONTEXT (t
) || DECL_CLASS_SCOPE_P (t
))
266 pop_from_top_level ();
269 /* Do any processing required when DECL (a member template
270 declaration) is finished. Returns the TEMPLATE_DECL corresponding
271 to DECL, unless it is a specialization, in which case the DECL
272 itself is returned. */
275 finish_member_template_decl (tree decl
)
277 if (decl
== error_mark_node
)
278 return error_mark_node
;
280 gcc_assert (DECL_P (decl
));
282 if (TREE_CODE (decl
) == TYPE_DECL
)
286 type
= TREE_TYPE (decl
);
287 if (type
== error_mark_node
)
288 return error_mark_node
;
289 if (MAYBE_CLASS_TYPE_P (type
)
290 && CLASSTYPE_TEMPLATE_INFO (type
)
291 && !CLASSTYPE_TEMPLATE_SPECIALIZATION (type
))
293 tree tmpl
= CLASSTYPE_TI_TEMPLATE (type
);
294 check_member_template (tmpl
);
299 else if (TREE_CODE (decl
) == FIELD_DECL
)
300 error ("data member %qD cannot be a member template", decl
);
301 else if (DECL_TEMPLATE_INFO (decl
))
303 if (!DECL_TEMPLATE_SPECIALIZATION (decl
))
305 check_member_template (DECL_TI_TEMPLATE (decl
));
306 return DECL_TI_TEMPLATE (decl
);
312 error ("invalid member template declaration %qD", decl
);
314 return error_mark_node
;
317 /* Create a template info node. */
320 build_template_info (tree template_decl
, tree template_args
)
322 tree result
= make_node (TEMPLATE_INFO
);
323 TI_TEMPLATE (result
) = template_decl
;
324 TI_ARGS (result
) = template_args
;
328 /* Return the template info node corresponding to T, whatever T is. */
331 get_template_info (const_tree t
)
333 tree tinfo
= NULL_TREE
;
335 if (!t
|| t
== error_mark_node
)
338 if (TREE_CODE (t
) == NAMESPACE_DECL
)
341 if (DECL_P (t
) && DECL_LANG_SPECIFIC (t
))
342 tinfo
= DECL_TEMPLATE_INFO (t
);
344 if (!tinfo
&& DECL_IMPLICIT_TYPEDEF_P (t
))
347 if (OVERLOAD_TYPE_P (t
))
348 tinfo
= TYPE_TEMPLATE_INFO (t
);
349 else if (TREE_CODE (t
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
350 tinfo
= TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (t
);
355 /* Returns the template nesting level of the indicated class TYPE.
365 A<T>::B<U> has depth two, while A<T> has depth one.
366 Both A<T>::B<int> and A<int>::B<U> have depth one, if
367 they are instantiations, not specializations.
369 This function is guaranteed to return 0 if passed NULL_TREE so
370 that, for example, `template_class_depth (current_class_type)' is
374 template_class_depth (tree type
)
379 type
&& TREE_CODE (type
) != NAMESPACE_DECL
;
380 type
= (TREE_CODE (type
) == FUNCTION_DECL
)
381 ? CP_DECL_CONTEXT (type
) : CP_TYPE_CONTEXT (type
))
383 tree tinfo
= get_template_info (type
);
385 if (tinfo
&& PRIMARY_TEMPLATE_P (TI_TEMPLATE (tinfo
))
386 && uses_template_parms (INNERMOST_TEMPLATE_ARGS (TI_ARGS (tinfo
))))
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
))
446 /* Make a CONST_DECL as is done in process_template_parm.
447 It is ugly that we recreate this here; the original
448 version built in process_template_parm is no longer
450 tree decl
= build_decl (DECL_SOURCE_LOCATION (parm
),
451 CONST_DECL
, DECL_NAME (parm
),
453 DECL_ARTIFICIAL (decl
) = 1;
454 TREE_CONSTANT (decl
) = 1;
455 TREE_READONLY (decl
) = 1;
456 DECL_INITIAL (decl
) = DECL_INITIAL (parm
);
457 SET_DECL_TEMPLATE_PARM_P (decl
);
468 /* Restore the template parameter context for a member template, a
469 friend template defined in a class definition, or a non-template
470 member of template class. */
473 maybe_begin_member_template_processing (tree decl
)
477 bool nsdmi
= TREE_CODE (decl
) == FIELD_DECL
;
481 tree ctx
= DECL_CONTEXT (decl
);
482 decl
= (CLASSTYPE_TEMPLATE_INFO (ctx
)
483 /* Disregard full specializations (c++/60999). */
484 && uses_template_parms (ctx
)
485 ? CLASSTYPE_TI_TEMPLATE (ctx
) : NULL_TREE
);
488 if (inline_needs_template_parms (decl
, nsdmi
))
490 parms
= DECL_TEMPLATE_PARMS (most_general_template (decl
));
491 levels
= TMPL_PARMS_DEPTH (parms
) - processing_template_decl
;
493 if (DECL_TEMPLATE_SPECIALIZATION (decl
))
496 parms
= TREE_CHAIN (parms
);
499 push_inline_template_parms_recursive (parms
, levels
);
502 /* Remember how many levels of template parameters we pushed so that
503 we can pop them later. */
504 inline_parm_levels
.safe_push (levels
);
507 /* Undo the effects of maybe_begin_member_template_processing. */
510 maybe_end_member_template_processing (void)
515 if (inline_parm_levels
.length () == 0)
518 last
= inline_parm_levels
.pop ();
519 for (i
= 0; i
< last
; ++i
)
521 --processing_template_decl
;
522 current_template_parms
= TREE_CHAIN (current_template_parms
);
527 /* Return a new template argument vector which contains all of ARGS,
528 but has as its innermost set of arguments the EXTRA_ARGS. */
531 add_to_template_args (tree args
, tree extra_args
)
538 if (args
== NULL_TREE
|| extra_args
== error_mark_node
)
541 extra_depth
= TMPL_ARGS_DEPTH (extra_args
);
542 new_args
= make_tree_vec (TMPL_ARGS_DEPTH (args
) + extra_depth
);
544 for (i
= 1; i
<= TMPL_ARGS_DEPTH (args
); ++i
)
545 SET_TMPL_ARGS_LEVEL (new_args
, i
, TMPL_ARGS_LEVEL (args
, i
));
547 for (j
= 1; j
<= extra_depth
; ++j
, ++i
)
548 SET_TMPL_ARGS_LEVEL (new_args
, i
, TMPL_ARGS_LEVEL (extra_args
, j
));
553 /* Like add_to_template_args, but only the outermost ARGS are added to
554 the EXTRA_ARGS. In particular, all but TMPL_ARGS_DEPTH
555 (EXTRA_ARGS) levels are added. This function is used to combine
556 the template arguments from a partial instantiation with the
557 template arguments used to attain the full instantiation from the
558 partial instantiation. */
561 add_outermost_template_args (tree args
, tree extra_args
)
565 /* If there are more levels of EXTRA_ARGS than there are ARGS,
566 something very fishy is going on. */
567 gcc_assert (TMPL_ARGS_DEPTH (args
) >= TMPL_ARGS_DEPTH (extra_args
));
569 /* If *all* the new arguments will be the EXTRA_ARGS, just return
571 if (TMPL_ARGS_DEPTH (args
) == TMPL_ARGS_DEPTH (extra_args
))
574 /* For the moment, we make ARGS look like it contains fewer levels. */
575 TREE_VEC_LENGTH (args
) -= TMPL_ARGS_DEPTH (extra_args
);
577 new_args
= add_to_template_args (args
, extra_args
);
579 /* Now, we restore ARGS to its full dimensions. */
580 TREE_VEC_LENGTH (args
) += TMPL_ARGS_DEPTH (extra_args
);
585 /* Return the N levels of innermost template arguments from the ARGS. */
588 get_innermost_template_args (tree args
, int n
)
596 /* If N is 1, just return the innermost set of template arguments. */
598 return TMPL_ARGS_LEVEL (args
, TMPL_ARGS_DEPTH (args
));
600 /* If we're not removing anything, just return the arguments we were
602 extra_levels
= TMPL_ARGS_DEPTH (args
) - n
;
603 gcc_assert (extra_levels
>= 0);
604 if (extra_levels
== 0)
607 /* Make a new set of arguments, not containing the outer arguments. */
608 new_args
= make_tree_vec (n
);
609 for (i
= 1; i
<= n
; ++i
)
610 SET_TMPL_ARGS_LEVEL (new_args
, i
,
611 TMPL_ARGS_LEVEL (args
, i
+ extra_levels
));
616 /* The inverse of get_innermost_template_args: Return all but the innermost
617 EXTRA_LEVELS levels of template arguments from the ARGS. */
620 strip_innermost_template_args (tree args
, int extra_levels
)
623 int n
= TMPL_ARGS_DEPTH (args
) - extra_levels
;
628 /* If N is 1, just return the outermost set of template arguments. */
630 return TMPL_ARGS_LEVEL (args
, 1);
632 /* If we're not removing anything, just return the arguments we were
634 gcc_assert (extra_levels
>= 0);
635 if (extra_levels
== 0)
638 /* Make a new set of arguments, not containing the inner arguments. */
639 new_args
= make_tree_vec (n
);
640 for (i
= 1; i
<= n
; ++i
)
641 SET_TMPL_ARGS_LEVEL (new_args
, i
,
642 TMPL_ARGS_LEVEL (args
, i
));
647 /* We've got a template header coming up; push to a new level for storing
651 begin_template_parm_list (void)
653 /* We use a non-tag-transparent scope here, which causes pushtag to
654 put tags in this scope, rather than in the enclosing class or
655 namespace scope. This is the right thing, since we want
656 TEMPLATE_DECLS, and not TYPE_DECLS for template classes. For a
657 global template class, push_template_decl handles putting the
658 TEMPLATE_DECL into top-level scope. For a nested template class,
661 template <class T> struct S1 {
662 template <class T> struct S2 {};
665 pushtag contains special code to call pushdecl_with_scope on the
666 TEMPLATE_DECL for S2. */
667 begin_scope (sk_template_parms
, NULL
);
668 ++processing_template_decl
;
669 ++processing_template_parmlist
;
670 note_template_header (0);
672 /* Add a dummy parameter level while we process the parameter list. */
673 current_template_parms
674 = tree_cons (size_int (processing_template_decl
),
676 current_template_parms
);
679 /* This routine is called when a specialization is declared. If it is
680 invalid to declare a specialization here, an error is reported and
681 false is returned, otherwise this routine will return true. */
684 check_specialization_scope (void)
686 tree scope
= current_scope ();
690 An explicit specialization shall be declared in the namespace of
691 which the template is a member, or, for member templates, in the
692 namespace of which the enclosing class or enclosing class
693 template is a member. An explicit specialization of a member
694 function, member class or static data member of a class template
695 shall be declared in the namespace of which the class template
697 if (scope
&& TREE_CODE (scope
) != NAMESPACE_DECL
)
699 error ("explicit specialization in non-namespace scope %qD", scope
);
705 In an explicit specialization declaration for a member of a class
706 template or a member template that appears in namespace scope,
707 the member template and some of its enclosing class templates may
708 remain unspecialized, except that the declaration shall not
709 explicitly specialize a class member template if its enclosing
710 class templates are not explicitly specialized as well. */
711 if (current_template_parms
)
713 error ("enclosing class templates are not explicitly specialized");
720 /* We've just seen template <>. */
723 begin_specialization (void)
725 begin_scope (sk_template_spec
, NULL
);
726 note_template_header (1);
727 return check_specialization_scope ();
730 /* Called at then end of processing a declaration preceded by
734 end_specialization (void)
737 reset_specialization ();
740 /* Any template <>'s that we have seen thus far are not referring to a
741 function specialization. */
744 reset_specialization (void)
746 processing_specialization
= 0;
747 template_header_count
= 0;
750 /* We've just seen a template header. If SPECIALIZATION is nonzero,
751 it was of the form template <>. */
754 note_template_header (int specialization
)
756 processing_specialization
= specialization
;
757 template_header_count
++;
760 /* We're beginning an explicit instantiation. */
763 begin_explicit_instantiation (void)
765 gcc_assert (!processing_explicit_instantiation
);
766 processing_explicit_instantiation
= true;
771 end_explicit_instantiation (void)
773 gcc_assert (processing_explicit_instantiation
);
774 processing_explicit_instantiation
= false;
777 /* An explicit specialization or partial specialization of TMPL is being
778 declared. Check that the namespace in which the specialization is
779 occurring is permissible. Returns false iff it is invalid to
780 specialize TMPL in the current namespace. */
783 check_specialization_namespace (tree tmpl
)
785 tree tpl_ns
= decl_namespace_context (tmpl
);
789 An explicit specialization shall be declared in the namespace of
790 which the template is a member, or, for member templates, in the
791 namespace of which the enclosing class or enclosing class
792 template is a member. An explicit specialization of a member
793 function, member class or static data member of a class template
794 shall be declared in the namespace of which the class template is
796 if (current_scope() != DECL_CONTEXT (tmpl
)
797 && !at_namespace_scope_p ())
799 error ("specialization of %qD must appear at namespace scope", tmpl
);
802 if (is_associated_namespace (current_namespace
, tpl_ns
))
803 /* Same or super-using namespace. */
807 permerror (input_location
,
808 "specialization of %qD in different namespace", tmpl
);
809 permerror (DECL_SOURCE_LOCATION (tmpl
),
810 " from definition of %q#D", tmpl
);
815 /* SPEC is an explicit instantiation. Check that it is valid to
816 perform this explicit instantiation in the current namespace. */
819 check_explicit_instantiation_namespace (tree spec
)
823 /* DR 275: An explicit instantiation shall appear in an enclosing
824 namespace of its template. */
825 ns
= decl_namespace_context (spec
);
826 if (!is_ancestor (current_namespace
, ns
))
827 permerror (input_location
, "explicit instantiation of %qD in namespace %qD "
828 "(which does not enclose namespace %qD)",
829 spec
, current_namespace
, ns
);
832 // Returns the type of a template specialization only if that
833 // specialization needs to be defined. Otherwise (e.g., if the type has
834 // already been defined), the function returns NULL_TREE.
836 maybe_new_partial_specialization (tree type
)
838 // An implicit instantiation of an incomplete type implies
839 // the definition of a new class template.
841 // template<typename T>
844 // template<typename T>
847 // Here, S<T*> is an implicit instantiation of S whose type
849 if (CLASSTYPE_IMPLICIT_INSTANTIATION (type
) && !COMPLETE_TYPE_P (type
))
852 // It can also be the case that TYPE is a completed specialization.
853 // Continuing the previous example, suppose we also declare:
855 // template<typename T>
856 // requires Integral<T>
859 // Here, S<T*> refers to the specialization S<T*> defined
860 // above. However, we need to differentiate definitions because
861 // we intend to define a new partial specialization. In this case,
862 // we rely on the fact that the constraints are different for
863 // this declaration than that above.
865 // Note that we also get here for injected class names and
866 // late-parsed template definitions. We must ensure that we
867 // do not create new type declarations for those cases.
868 if (flag_concepts
&& CLASSTYPE_TEMPLATE_SPECIALIZATION (type
))
870 tree tmpl
= CLASSTYPE_TI_TEMPLATE (type
);
871 tree args
= CLASSTYPE_TI_ARGS (type
);
873 // If there are no template parameters, this cannot be a new
874 // partial template specializtion?
875 if (!current_template_parms
)
878 // If the constraints are not the same as those of the primary
879 // then, we can probably create a new specialization.
880 tree type_constr
= current_template_constraints ();
882 if (type
== TREE_TYPE (tmpl
))
883 if (tree main_constr
= get_constraints (tmpl
))
884 if (equivalent_constraints (type_constr
, main_constr
))
887 // Also, if there's a pre-existing specialization with matching
888 // constraints, then this also isn't new.
889 tree specs
= DECL_TEMPLATE_SPECIALIZATIONS (tmpl
);
892 tree spec_tmpl
= TREE_VALUE (specs
);
893 tree spec_args
= TREE_PURPOSE (specs
);
894 tree spec_constr
= get_constraints (spec_tmpl
);
895 if (comp_template_args (args
, spec_args
)
896 && equivalent_constraints (type_constr
, spec_constr
))
898 specs
= TREE_CHAIN (specs
);
901 // Create a new type node (and corresponding type decl)
902 // for the newly declared specialization.
903 tree t
= make_class_type (TREE_CODE (type
));
904 CLASSTYPE_DECLARED_CLASS (t
) = CLASSTYPE_DECLARED_CLASS (type
);
905 TYPE_FOR_JAVA (t
) = TYPE_FOR_JAVA (type
);
906 SET_TYPE_TEMPLATE_INFO (t
, build_template_info (tmpl
, args
));
908 /* We only need a separate type node for storing the definition of this
909 partial specialization; uses of S<T*> are unconstrained, so all are
910 equivalent. So keep TYPE_CANONICAL the same. */
911 TYPE_CANONICAL (t
) = TYPE_CANONICAL (type
);
913 // Build the corresponding type decl.
914 tree d
= create_implicit_typedef (DECL_NAME (tmpl
), t
);
915 DECL_CONTEXT (d
) = TYPE_CONTEXT (t
);
916 DECL_SOURCE_LOCATION (d
) = input_location
;
924 /* The TYPE is being declared. If it is a template type, that means it
925 is a partial specialization. Do appropriate error-checking. */
928 maybe_process_partial_specialization (tree type
)
932 if (type
== error_mark_node
)
933 return error_mark_node
;
935 /* A lambda that appears in specialization context is not itself a
937 if (CLASS_TYPE_P (type
) && CLASSTYPE_LAMBDA_EXPR (type
))
940 if (TREE_CODE (type
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
942 error ("name of class shadows template template parameter %qD",
944 return error_mark_node
;
947 context
= TYPE_CONTEXT (type
);
949 if (TYPE_ALIAS_P (type
))
951 if (TYPE_TEMPLATE_INFO (type
)
952 && DECL_ALIAS_TEMPLATE_P (TYPE_TI_TEMPLATE (type
)))
953 error ("specialization of alias template %qD",
954 TYPE_TI_TEMPLATE (type
));
956 error ("explicit specialization of non-template %qT", type
);
957 return error_mark_node
;
959 else if (CLASS_TYPE_P (type
) && CLASSTYPE_USE_TEMPLATE (type
))
961 /* This is for ordinary explicit specialization and partial
962 specialization of a template class such as:
964 template <> class C<int>;
968 template <class T> class C<T*>;
970 Make sure that `C<int>' and `C<T*>' are implicit instantiations. */
972 if (tree t
= maybe_new_partial_specialization (type
))
974 if (!check_specialization_namespace (CLASSTYPE_TI_TEMPLATE (t
))
975 && !at_namespace_scope_p ())
976 return error_mark_node
;
977 SET_CLASSTYPE_TEMPLATE_SPECIALIZATION (t
);
978 DECL_SOURCE_LOCATION (TYPE_MAIN_DECL (t
)) = input_location
;
979 if (processing_template_decl
)
981 tree decl
= push_template_decl (TYPE_MAIN_DECL (t
));
982 if (decl
== error_mark_node
)
983 return error_mark_node
;
984 return TREE_TYPE (decl
);
987 else if (CLASSTYPE_TEMPLATE_INSTANTIATION (type
))
988 error ("specialization of %qT after instantiation", type
);
989 else if (errorcount
&& !processing_specialization
990 && CLASSTYPE_TEMPLATE_SPECIALIZATION (type
)
991 && !uses_template_parms (CLASSTYPE_TI_ARGS (type
)))
992 /* Trying to define a specialization either without a template<> header
993 or in an inappropriate place. We've already given an error, so just
994 bail now so we don't actually define the specialization. */
995 return error_mark_node
;
997 else if (CLASS_TYPE_P (type
)
998 && !CLASSTYPE_USE_TEMPLATE (type
)
999 && CLASSTYPE_TEMPLATE_INFO (type
)
1000 && context
&& CLASS_TYPE_P (context
)
1001 && CLASSTYPE_TEMPLATE_INFO (context
))
1003 /* This is for an explicit specialization of member class
1004 template according to [temp.expl.spec/18]:
1006 template <> template <class U> class C<int>::D;
1008 The context `C<int>' must be an implicit instantiation.
1009 Otherwise this is just a member class template declared
1012 template <> class C<int> { template <class U> class D; };
1013 template <> template <class U> class C<int>::D;
1015 In the first case, `C<int>::D' is a specialization of `C<T>::D'
1016 while in the second case, `C<int>::D' is a primary template
1017 and `C<T>::D' may not exist. */
1019 if (CLASSTYPE_IMPLICIT_INSTANTIATION (context
)
1020 && !COMPLETE_TYPE_P (type
))
1023 tree tmpl
= CLASSTYPE_TI_TEMPLATE (type
);
1025 if (current_namespace
1026 != decl_namespace_context (tmpl
))
1028 permerror (input_location
,
1029 "specializing %q#T in different namespace", type
);
1030 permerror (DECL_SOURCE_LOCATION (tmpl
),
1031 " from definition of %q#D", tmpl
);
1034 /* Check for invalid specialization after instantiation:
1036 template <> template <> class C<int>::D<int>;
1037 template <> template <class U> class C<int>::D; */
1039 for (t
= DECL_TEMPLATE_INSTANTIATIONS (tmpl
);
1040 t
; t
= TREE_CHAIN (t
))
1042 tree inst
= TREE_VALUE (t
);
1043 if (CLASSTYPE_TEMPLATE_SPECIALIZATION (inst
)
1044 || !COMPLETE_OR_OPEN_TYPE_P (inst
))
1046 /* We already have a full specialization of this partial
1047 instantiation, or a full specialization has been
1048 looked up but not instantiated. Reassign it to the
1049 new member specialization template. */
1053 elt
.tmpl
= most_general_template (tmpl
);
1054 elt
.args
= CLASSTYPE_TI_ARGS (inst
);
1057 type_specializations
->remove_elt (&elt
);
1060 elt
.args
= INNERMOST_TEMPLATE_ARGS (elt
.args
);
1063 = type_specializations
->find_slot (&elt
, INSERT
);
1064 entry
= ggc_alloc
<spec_entry
> ();
1069 /* But if we've had an implicit instantiation, that's a
1070 problem ([temp.expl.spec]/6). */
1071 error ("specialization %qT after instantiation %qT",
1075 /* Mark TYPE as a specialization. And as a result, we only
1076 have one level of template argument for the innermost
1078 SET_CLASSTYPE_TEMPLATE_SPECIALIZATION (type
);
1079 DECL_SOURCE_LOCATION (TYPE_MAIN_DECL (type
)) = input_location
;
1080 CLASSTYPE_TI_ARGS (type
)
1081 = INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (type
));
1084 else if (processing_specialization
)
1086 /* Someday C++0x may allow for enum template specialization. */
1087 if (cxx_dialect
> cxx98
&& TREE_CODE (type
) == ENUMERAL_TYPE
1088 && CLASS_TYPE_P (context
) && CLASSTYPE_USE_TEMPLATE (context
))
1089 pedwarn (input_location
, OPT_Wpedantic
, "template specialization "
1090 "of %qD not allowed by ISO C++", type
);
1093 error ("explicit specialization of non-template %qT", type
);
1094 return error_mark_node
;
1101 /* Returns nonzero if we can optimize the retrieval of specializations
1102 for TMPL, a TEMPLATE_DECL. In particular, for such a template, we
1103 do not use DECL_TEMPLATE_SPECIALIZATIONS at all. */
1106 optimize_specialization_lookup_p (tree tmpl
)
1108 return (DECL_FUNCTION_TEMPLATE_P (tmpl
)
1109 && DECL_CLASS_SCOPE_P (tmpl
)
1110 /* DECL_CLASS_SCOPE_P holds of T::f even if T is a template
1112 && CLASS_TYPE_P (DECL_CONTEXT (tmpl
))
1113 /* The optimized lookup depends on the fact that the
1114 template arguments for the member function template apply
1115 purely to the containing class, which is not true if the
1116 containing class is an explicit or partial
1118 && !CLASSTYPE_TEMPLATE_SPECIALIZATION (DECL_CONTEXT (tmpl
))
1119 && !DECL_MEMBER_TEMPLATE_P (tmpl
)
1120 && !DECL_CONV_FN_P (tmpl
)
1121 /* It is possible to have a template that is not a member
1122 template and is not a member of a template class:
1124 template <typename T>
1125 struct S { friend A::f(); };
1127 Here, the friend function is a template, but the context does
1128 not have template information. The optimized lookup relies
1129 on having ARGS be the template arguments for both the class
1130 and the function template. */
1131 && !DECL_FRIEND_P (DECL_TEMPLATE_RESULT (tmpl
)));
1134 /* Make sure ARGS doesn't use any inappropriate typedefs; we should have
1135 gone through coerce_template_parms by now. */
1138 check_unstripped_args (tree args ATTRIBUTE_UNUSED
)
1140 #ifdef ENABLE_CHECKING
1141 ++processing_template_decl
;
1142 if (!any_dependent_template_arguments_p (args
))
1144 tree inner
= INNERMOST_TEMPLATE_ARGS (args
);
1145 for (int i
= 0; i
< TREE_VEC_LENGTH (inner
); ++i
)
1147 tree arg
= TREE_VEC_ELT (inner
, i
);
1148 if (TREE_CODE (arg
) == TEMPLATE_DECL
)
1150 else if (TYPE_P (arg
))
1151 gcc_assert (strip_typedefs (arg
, NULL
) == arg
);
1152 else if (strip_typedefs (TREE_TYPE (arg
), NULL
) != TREE_TYPE (arg
))
1153 /* Allow typedefs on the type of a non-type argument, since a
1154 parameter can have them. */;
1156 gcc_assert (strip_typedefs_expr (arg
, NULL
) == arg
);
1159 --processing_template_decl
;
1163 /* Retrieve the specialization (in the sense of [temp.spec] - a
1164 specialization is either an instantiation or an explicit
1165 specialization) of TMPL for the given template ARGS. If there is
1166 no such specialization, return NULL_TREE. The ARGS are a vector of
1167 arguments, or a vector of vectors of arguments, in the case of
1168 templates with more than one level of parameters.
1170 If TMPL is a type template and CLASS_SPECIALIZATIONS_P is true,
1171 then we search for a partial specialization matching ARGS. This
1172 parameter is ignored if TMPL is not a class template.
1174 We can also look up a FIELD_DECL, if it is a lambda capture pack; the
1175 result is a NONTYPE_ARGUMENT_PACK. */
1178 retrieve_specialization (tree tmpl
, tree args
, hashval_t hash
)
1180 if (tmpl
== NULL_TREE
)
1183 if (args
== error_mark_node
)
1186 gcc_assert (TREE_CODE (tmpl
) == TEMPLATE_DECL
1187 || TREE_CODE (tmpl
) == FIELD_DECL
);
1189 /* There should be as many levels of arguments as there are
1190 levels of parameters. */
1191 gcc_assert (TMPL_ARGS_DEPTH (args
)
1192 == (TREE_CODE (tmpl
) == TEMPLATE_DECL
1193 ? TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl
))
1194 : template_class_depth (DECL_CONTEXT (tmpl
))));
1196 check_unstripped_args (args
);
1198 if (optimize_specialization_lookup_p (tmpl
))
1200 tree class_template
;
1201 tree class_specialization
;
1202 vec
<tree
, va_gc
> *methods
;
1206 /* The template arguments actually apply to the containing
1207 class. Find the class specialization with those
1209 class_template
= CLASSTYPE_TI_TEMPLATE (DECL_CONTEXT (tmpl
));
1210 class_specialization
1211 = retrieve_specialization (class_template
, args
, 0);
1212 if (!class_specialization
)
1214 /* Now, find the appropriate entry in the CLASSTYPE_METHOD_VEC
1215 for the specialization. */
1216 idx
= class_method_index_for_fn (class_specialization
, tmpl
);
1219 /* Iterate through the methods with the indicated name, looking
1220 for the one that has an instance of TMPL. */
1221 methods
= CLASSTYPE_METHOD_VEC (class_specialization
);
1222 for (fns
= (*methods
)[idx
]; fns
; fns
= OVL_NEXT (fns
))
1224 tree fn
= OVL_CURRENT (fns
);
1225 if (DECL_TEMPLATE_INFO (fn
) && DECL_TI_TEMPLATE (fn
) == tmpl
1226 /* using-declarations can add base methods to the method vec,
1227 and we don't want those here. */
1228 && DECL_CONTEXT (fn
) == class_specialization
)
1237 hash_table
<spec_hasher
> *specializations
;
1241 elt
.spec
= NULL_TREE
;
1243 if (DECL_CLASS_TEMPLATE_P (tmpl
))
1244 specializations
= type_specializations
;
1246 specializations
= decl_specializations
;
1249 hash
= spec_hasher::hash (&elt
);
1250 found
= specializations
->find_with_hash (&elt
, hash
);
1258 /* Like retrieve_specialization, but for local declarations. */
1261 retrieve_local_specialization (tree tmpl
)
1263 if (local_specializations
== NULL
)
1266 tree
*slot
= local_specializations
->get (tmpl
);
1267 return slot
? *slot
: NULL_TREE
;
1270 /* Returns nonzero iff DECL is a specialization of TMPL. */
1273 is_specialization_of (tree decl
, tree tmpl
)
1277 if (TREE_CODE (decl
) == FUNCTION_DECL
)
1281 t
= DECL_TEMPLATE_INFO (t
) ? DECL_TI_TEMPLATE (t
) : NULL_TREE
)
1287 gcc_assert (TREE_CODE (decl
) == TYPE_DECL
);
1289 for (t
= TREE_TYPE (decl
);
1291 t
= CLASSTYPE_USE_TEMPLATE (t
)
1292 ? TREE_TYPE (CLASSTYPE_TI_TEMPLATE (t
)) : NULL_TREE
)
1293 if (same_type_ignoring_top_level_qualifiers_p (t
, TREE_TYPE (tmpl
)))
1300 /* Returns nonzero iff DECL is a specialization of friend declaration
1301 FRIEND_DECL according to [temp.friend]. */
1304 is_specialization_of_friend (tree decl
, tree friend_decl
)
1306 bool need_template
= true;
1309 gcc_assert (TREE_CODE (decl
) == FUNCTION_DECL
1310 || TREE_CODE (decl
) == TYPE_DECL
);
1312 /* For [temp.friend/6] when FRIEND_DECL is an ordinary member function
1313 of a template class, we want to check if DECL is a specialization
1315 if (TREE_CODE (friend_decl
) == FUNCTION_DECL
1316 && DECL_TEMPLATE_INFO (friend_decl
)
1317 && !DECL_USE_TEMPLATE (friend_decl
))
1319 /* We want a TEMPLATE_DECL for `is_specialization_of'. */
1320 friend_decl
= DECL_TI_TEMPLATE (friend_decl
);
1321 need_template
= false;
1323 else if (TREE_CODE (friend_decl
) == TEMPLATE_DECL
1324 && !PRIMARY_TEMPLATE_P (friend_decl
))
1325 need_template
= false;
1327 /* There is nothing to do if this is not a template friend. */
1328 if (TREE_CODE (friend_decl
) != TEMPLATE_DECL
)
1331 if (is_specialization_of (decl
, friend_decl
))
1335 A member of a class template may be declared to be a friend of a
1336 non-template class. In this case, the corresponding member of
1337 every specialization of the class template is a friend of the
1338 class granting friendship.
1340 For example, given a template friend declaration
1342 template <class T> friend void A<T>::f();
1344 the member function below is considered a friend
1346 template <> struct A<int> {
1350 For this type of template friend, TEMPLATE_DEPTH below will be
1351 nonzero. To determine if DECL is a friend of FRIEND, we first
1352 check if the enclosing class is a specialization of another. */
1354 template_depth
= template_class_depth (CP_DECL_CONTEXT (friend_decl
));
1356 && DECL_CLASS_SCOPE_P (decl
)
1357 && is_specialization_of (TYPE_NAME (DECL_CONTEXT (decl
)),
1358 CLASSTYPE_TI_TEMPLATE (DECL_CONTEXT (friend_decl
))))
1360 /* Next, we check the members themselves. In order to handle
1361 a few tricky cases, such as when FRIEND_DECL's are
1363 template <class T> friend void A<T>::g(T t);
1364 template <class T> template <T t> friend void A<T>::h();
1368 void A<int>::g(int);
1369 template <int> void A<int>::h();
1371 we need to figure out ARGS, the template arguments from
1372 the context of DECL. This is required for template substitution
1373 of `T' in the function parameter of `g' and template parameter
1374 of `h' in the above examples. Here ARGS corresponds to `int'. */
1376 tree context
= DECL_CONTEXT (decl
);
1377 tree args
= NULL_TREE
;
1378 int current_depth
= 0;
1380 while (current_depth
< template_depth
)
1382 if (CLASSTYPE_TEMPLATE_INFO (context
))
1384 if (current_depth
== 0)
1385 args
= TYPE_TI_ARGS (context
);
1387 args
= add_to_template_args (TYPE_TI_ARGS (context
), args
);
1390 context
= TYPE_CONTEXT (context
);
1393 if (TREE_CODE (decl
) == FUNCTION_DECL
)
1398 tree friend_args_type
;
1399 tree decl_args_type
;
1401 /* Make sure that both DECL and FRIEND_DECL are templates or
1403 is_template
= DECL_TEMPLATE_INFO (decl
)
1404 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (decl
));
1405 if (need_template
^ is_template
)
1407 else if (is_template
)
1409 /* If both are templates, check template parameter list. */
1411 = tsubst_template_parms (DECL_TEMPLATE_PARMS (friend_decl
),
1413 if (!comp_template_parms
1414 (DECL_TEMPLATE_PARMS (DECL_TI_TEMPLATE (decl
)),
1418 decl_type
= TREE_TYPE (DECL_TI_TEMPLATE (decl
));
1421 decl_type
= TREE_TYPE (decl
);
1423 friend_type
= tsubst_function_type (TREE_TYPE (friend_decl
), args
,
1424 tf_none
, NULL_TREE
);
1425 if (friend_type
== error_mark_node
)
1428 /* Check if return types match. */
1429 if (!same_type_p (TREE_TYPE (decl_type
), TREE_TYPE (friend_type
)))
1432 /* Check if function parameter types match, ignoring the
1433 `this' parameter. */
1434 friend_args_type
= TYPE_ARG_TYPES (friend_type
);
1435 decl_args_type
= TYPE_ARG_TYPES (decl_type
);
1436 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (friend_decl
))
1437 friend_args_type
= TREE_CHAIN (friend_args_type
);
1438 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
1439 decl_args_type
= TREE_CHAIN (decl_args_type
);
1441 return compparms (decl_args_type
, friend_args_type
);
1445 /* DECL is a TYPE_DECL */
1447 tree decl_type
= TREE_TYPE (decl
);
1449 /* Make sure that both DECL and FRIEND_DECL are templates or
1452 = CLASSTYPE_TEMPLATE_INFO (decl_type
)
1453 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (decl_type
));
1455 if (need_template
^ is_template
)
1457 else if (is_template
)
1460 /* If both are templates, check the name of the two
1461 TEMPLATE_DECL's first because is_friend didn't. */
1462 if (DECL_NAME (CLASSTYPE_TI_TEMPLATE (decl_type
))
1463 != DECL_NAME (friend_decl
))
1466 /* Now check template parameter list. */
1468 = tsubst_template_parms (DECL_TEMPLATE_PARMS (friend_decl
),
1470 return comp_template_parms
1471 (DECL_TEMPLATE_PARMS (CLASSTYPE_TI_TEMPLATE (decl_type
)),
1475 return (DECL_NAME (decl
)
1476 == DECL_NAME (friend_decl
));
1482 /* Register the specialization SPEC as a specialization of TMPL with
1483 the indicated ARGS. IS_FRIEND indicates whether the specialization
1484 is actually just a friend declaration. Returns SPEC, or an
1485 equivalent prior declaration, if available.
1487 We also store instantiations of field packs in the hash table, even
1488 though they are not themselves templates, to make lookup easier. */
1491 register_specialization (tree spec
, tree tmpl
, tree args
, bool is_friend
,
1495 spec_entry
**slot
= NULL
;
1498 gcc_assert ((TREE_CODE (tmpl
) == TEMPLATE_DECL
&& DECL_P (spec
))
1499 || (TREE_CODE (tmpl
) == FIELD_DECL
1500 && TREE_CODE (spec
) == NONTYPE_ARGUMENT_PACK
));
1502 if (TREE_CODE (spec
) == FUNCTION_DECL
1503 && uses_template_parms (DECL_TI_ARGS (spec
)))
1504 /* This is the FUNCTION_DECL for a partial instantiation. Don't
1505 register it; we want the corresponding TEMPLATE_DECL instead.
1506 We use `uses_template_parms (DECL_TI_ARGS (spec))' rather than
1507 the more obvious `uses_template_parms (spec)' to avoid problems
1508 with default function arguments. In particular, given
1509 something like this:
1511 template <class T> void f(T t1, T t = T())
1513 the default argument expression is not substituted for in an
1514 instantiation unless and until it is actually needed. */
1517 if (optimize_specialization_lookup_p (tmpl
))
1518 /* We don't put these specializations in the hash table, but we might
1519 want to give an error about a mismatch. */
1520 fn
= retrieve_specialization (tmpl
, args
, 0);
1528 hash
= spec_hasher::hash (&elt
);
1531 decl_specializations
->find_slot_with_hash (&elt
, hash
, INSERT
);
1533 fn
= ((spec_entry
*) *slot
)->spec
;
1538 /* We can sometimes try to re-register a specialization that we've
1539 already got. In particular, regenerate_decl_from_template calls
1540 duplicate_decls which will update the specialization list. But,
1541 we'll still get called again here anyhow. It's more convenient
1542 to simply allow this than to try to prevent it. */
1545 else if (fn
&& DECL_TEMPLATE_SPECIALIZATION (spec
))
1547 if (DECL_TEMPLATE_INSTANTIATION (fn
))
1549 if (DECL_ODR_USED (fn
)
1550 || DECL_EXPLICIT_INSTANTIATION (fn
))
1552 error ("specialization of %qD after instantiation",
1554 return error_mark_node
;
1559 /* This situation should occur only if the first
1560 specialization is an implicit instantiation, the
1561 second is an explicit specialization, and the
1562 implicit instantiation has not yet been used. That
1563 situation can occur if we have implicitly
1564 instantiated a member function and then specialized
1567 We can also wind up here if a friend declaration that
1568 looked like an instantiation turns out to be a
1571 template <class T> void foo(T);
1572 class S { friend void foo<>(int) };
1573 template <> void foo(int);
1575 We transform the existing DECL in place so that any
1576 pointers to it become pointers to the updated
1579 If there was a definition for the template, but not
1580 for the specialization, we want this to look as if
1581 there were no definition, and vice versa. */
1582 DECL_INITIAL (fn
) = NULL_TREE
;
1583 duplicate_decls (spec
, fn
, is_friend
);
1584 /* The call to duplicate_decls will have applied
1587 An explicit specialization of a function template
1588 is inline only if it is explicitly declared to be,
1589 and independently of whether its function template
1592 to the primary function; now copy the inline bits to
1593 the various clones. */
1594 FOR_EACH_CLONE (clone
, fn
)
1596 DECL_DECLARED_INLINE_P (clone
)
1597 = DECL_DECLARED_INLINE_P (fn
);
1598 DECL_SOURCE_LOCATION (clone
)
1599 = DECL_SOURCE_LOCATION (fn
);
1600 DECL_DELETED_FN (clone
)
1601 = DECL_DELETED_FN (fn
);
1603 check_specialization_namespace (tmpl
);
1608 else if (DECL_TEMPLATE_SPECIALIZATION (fn
))
1610 if (!duplicate_decls (spec
, fn
, is_friend
) && DECL_INITIAL (spec
))
1611 /* Dup decl failed, but this is a new definition. Set the
1612 line number so any errors match this new
1614 DECL_SOURCE_LOCATION (fn
) = DECL_SOURCE_LOCATION (spec
);
1620 return duplicate_decls (spec
, fn
, is_friend
);
1622 /* A specialization must be declared in the same namespace as the
1623 template it is specializing. */
1624 if (DECL_P (spec
) && DECL_TEMPLATE_SPECIALIZATION (spec
)
1625 && !check_specialization_namespace (tmpl
))
1626 DECL_CONTEXT (spec
) = DECL_CONTEXT (tmpl
);
1628 if (slot
!= NULL
/* !optimize_specialization_lookup_p (tmpl) */)
1630 spec_entry
*entry
= ggc_alloc
<spec_entry
> ();
1631 gcc_assert (tmpl
&& args
&& spec
);
1634 if ((TREE_CODE (spec
) == FUNCTION_DECL
&& DECL_NAMESPACE_SCOPE_P (spec
)
1635 && PRIMARY_TEMPLATE_P (tmpl
)
1636 && DECL_SAVED_TREE (DECL_TEMPLATE_RESULT (tmpl
)) == NULL_TREE
)
1637 || variable_template_p (tmpl
))
1638 /* If TMPL is a forward declaration of a template function, keep a list
1639 of all specializations in case we need to reassign them to a friend
1640 template later in tsubst_friend_function.
1642 Also keep a list of all variable template instantiations so that
1643 process_partial_specialization can check whether a later partial
1644 specialization would have used it. */
1645 DECL_TEMPLATE_INSTANTIATIONS (tmpl
)
1646 = tree_cons (args
, spec
, DECL_TEMPLATE_INSTANTIATIONS (tmpl
));
1652 /* Returns true iff two spec_entry nodes are equivalent. */
1654 int comparing_specializations
;
1657 spec_hasher::equal (spec_entry
*e1
, spec_entry
*e2
)
1661 ++comparing_specializations
;
1662 equal
= (e1
->tmpl
== e2
->tmpl
1663 && comp_template_args (e1
->args
, e2
->args
));
1664 if (equal
&& flag_concepts
1665 /* tmpl could be a FIELD_DECL for a capture pack. */
1666 && TREE_CODE (e1
->tmpl
) == TEMPLATE_DECL
1667 && VAR_P (DECL_TEMPLATE_RESULT (e1
->tmpl
))
1668 && uses_template_parms (e1
->args
))
1670 /* Partial specializations of a variable template can be distinguished by
1672 tree c1
= e1
->spec
? get_constraints (e1
->spec
) : NULL_TREE
;
1673 tree c2
= e2
->spec
? get_constraints (e2
->spec
) : NULL_TREE
;
1674 equal
= equivalent_constraints (c1
, c2
);
1676 --comparing_specializations
;
1681 /* Returns a hash for a template TMPL and template arguments ARGS. */
1684 hash_tmpl_and_args (tree tmpl
, tree args
)
1686 hashval_t val
= DECL_UID (tmpl
);
1687 return iterative_hash_template_arg (args
, val
);
1690 /* Returns a hash for a spec_entry node based on the TMPL and ARGS members,
1694 spec_hasher::hash (spec_entry
*e
)
1696 return hash_tmpl_and_args (e
->tmpl
, e
->args
);
1699 /* Recursively calculate a hash value for a template argument ARG, for use
1700 in the hash tables of template specializations. */
1703 iterative_hash_template_arg (tree arg
, hashval_t val
)
1705 unsigned HOST_WIDE_INT i
;
1706 enum tree_code code
;
1709 if (arg
== NULL_TREE
)
1710 return iterative_hash_object (arg
, val
);
1715 if (TREE_CODE (arg
) == ARGUMENT_PACK_SELECT
)
1716 /* We can get one of these when re-hashing a previous entry in the middle
1717 of substituting into a pack expansion. Just look through it. */
1718 arg
= ARGUMENT_PACK_SELECT_FROM_PACK (arg
);
1720 code
= TREE_CODE (arg
);
1721 tclass
= TREE_CODE_CLASS (code
);
1723 val
= iterative_hash_object (code
, val
);
1730 case IDENTIFIER_NODE
:
1731 return iterative_hash_object (IDENTIFIER_HASH_VALUE (arg
), val
);
1735 int i
, len
= TREE_VEC_LENGTH (arg
);
1736 for (i
= 0; i
< len
; ++i
)
1737 val
= iterative_hash_template_arg (TREE_VEC_ELT (arg
, i
), val
);
1741 case TYPE_PACK_EXPANSION
:
1742 case EXPR_PACK_EXPANSION
:
1743 val
= iterative_hash_template_arg (PACK_EXPANSION_PATTERN (arg
), val
);
1744 return iterative_hash_template_arg (PACK_EXPANSION_EXTRA_ARGS (arg
), val
);
1746 case TYPE_ARGUMENT_PACK
:
1747 case NONTYPE_ARGUMENT_PACK
:
1748 return iterative_hash_template_arg (ARGUMENT_PACK_ARGS (arg
), val
);
1751 for (; arg
; arg
= TREE_CHAIN (arg
))
1752 val
= iterative_hash_template_arg (TREE_VALUE (arg
), val
);
1756 for (; arg
; arg
= OVL_NEXT (arg
))
1757 val
= iterative_hash_template_arg (OVL_CURRENT (arg
), val
);
1763 iterative_hash_template_arg (TREE_TYPE (arg
), val
);
1764 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (arg
), i
, field
, value
)
1766 val
= iterative_hash_template_arg (field
, val
);
1767 val
= iterative_hash_template_arg (value
, val
);
1773 if (!DECL_ARTIFICIAL (arg
))
1775 val
= iterative_hash_object (DECL_PARM_INDEX (arg
), val
);
1776 val
= iterative_hash_object (DECL_PARM_LEVEL (arg
), val
);
1778 return iterative_hash_template_arg (TREE_TYPE (arg
), val
);
1781 return iterative_hash_template_arg (TARGET_EXPR_INITIAL (arg
), val
);
1784 val
= iterative_hash_template_arg (PTRMEM_CST_CLASS (arg
), val
);
1785 return iterative_hash_template_arg (PTRMEM_CST_MEMBER (arg
), val
);
1787 case TEMPLATE_PARM_INDEX
:
1788 val
= iterative_hash_template_arg
1789 (TREE_TYPE (TEMPLATE_PARM_DECL (arg
)), val
);
1790 val
= iterative_hash_object (TEMPLATE_PARM_LEVEL (arg
), val
);
1791 return iterative_hash_object (TEMPLATE_PARM_IDX (arg
), val
);
1794 val
= iterative_hash_object (TRAIT_EXPR_KIND (arg
), val
);
1795 val
= iterative_hash_template_arg (TRAIT_EXPR_TYPE1 (arg
), val
);
1796 return iterative_hash_template_arg (TRAIT_EXPR_TYPE2 (arg
), val
);
1799 val
= iterative_hash_template_arg (BINFO_TYPE (BASELINK_BINFO (arg
)),
1801 return iterative_hash_template_arg (DECL_NAME (get_first_fn (arg
)),
1805 val
= iterative_hash_template_arg (TREE_OPERAND (arg
, 0), val
);
1806 code
= TREE_CODE (TREE_OPERAND (arg
, 1));
1807 val
= iterative_hash_object (code
, val
);
1808 return iterative_hash_template_arg (TREE_OPERAND (arg
, 2), val
);
1811 /* A lambda can't appear in a template arg, but don't crash on
1813 gcc_assert (seen_error ());
1817 case IMPLICIT_CONV_EXPR
:
1818 case STATIC_CAST_EXPR
:
1819 case REINTERPRET_CAST_EXPR
:
1820 case CONST_CAST_EXPR
:
1821 case DYNAMIC_CAST_EXPR
:
1823 val
= iterative_hash_template_arg (TREE_TYPE (arg
), val
);
1824 /* Now hash operands as usual. */
1834 if (alias_template_specialization_p (arg
))
1836 // We want an alias specialization that survived strip_typedefs
1837 // to hash differently from its TYPE_CANONICAL, to avoid hash
1838 // collisions that compare as different in template_args_equal.
1839 // These could be dependent specializations that strip_typedefs
1840 // left alone, or untouched specializations because
1841 // coerce_template_parms returns the unconverted template
1842 // arguments if it sees incomplete argument packs.
1843 tree ti
= TYPE_TEMPLATE_INFO (arg
);
1844 return hash_tmpl_and_args (TI_TEMPLATE (ti
), TI_ARGS (ti
));
1846 if (TYPE_CANONICAL (arg
))
1847 return iterative_hash_object (TYPE_HASH (TYPE_CANONICAL (arg
)),
1849 else if (TREE_CODE (arg
) == DECLTYPE_TYPE
)
1850 return iterative_hash_template_arg (DECLTYPE_TYPE_EXPR (arg
), val
);
1851 /* Otherwise just compare the types during lookup. */
1854 case tcc_declaration
:
1856 return iterative_hash_expr (arg
, val
);
1859 gcc_assert (IS_EXPR_CODE_CLASS (tclass
));
1861 unsigned n
= cp_tree_operand_length (arg
);
1862 for (i
= 0; i
< n
; ++i
)
1863 val
= iterative_hash_template_arg (TREE_OPERAND (arg
, i
), val
);
1871 /* Unregister the specialization SPEC as a specialization of TMPL.
1872 Replace it with NEW_SPEC, if NEW_SPEC is non-NULL. Returns true
1873 if the SPEC was listed as a specialization of TMPL.
1875 Note that SPEC has been ggc_freed, so we can't look inside it. */
1878 reregister_specialization (tree spec
, tree tinfo
, tree new_spec
)
1883 elt
.tmpl
= most_general_template (TI_TEMPLATE (tinfo
));
1884 elt
.args
= TI_ARGS (tinfo
);
1885 elt
.spec
= NULL_TREE
;
1887 entry
= decl_specializations
->find (&elt
);
1890 gcc_assert (entry
->spec
== spec
|| entry
->spec
== new_spec
);
1891 gcc_assert (new_spec
!= NULL_TREE
);
1892 entry
->spec
= new_spec
;
1899 /* Like register_specialization, but for local declarations. We are
1900 registering SPEC, an instantiation of TMPL. */
1903 register_local_specialization (tree spec
, tree tmpl
)
1905 local_specializations
->put (tmpl
, spec
);
1908 /* TYPE is a class type. Returns true if TYPE is an explicitly
1909 specialized class. */
1912 explicit_class_specialization_p (tree type
)
1914 if (!CLASSTYPE_TEMPLATE_SPECIALIZATION (type
))
1916 return !uses_template_parms (CLASSTYPE_TI_ARGS (type
));
1919 /* Print the list of functions at FNS, going through all the overloads
1920 for each element of the list. Alternatively, FNS can not be a
1921 TREE_LIST, in which case it will be printed together with all the
1924 MORE and *STR should respectively be FALSE and NULL when the function
1925 is called from the outside. They are used internally on recursive
1926 calls. print_candidates manages the two parameters and leaves NULL
1927 in *STR when it ends. */
1930 print_candidates_1 (tree fns
, bool more
, const char **str
)
1933 char *spaces
= NULL
;
1935 for (fn
= fns
; fn
; fn
= OVL_NEXT (fn
))
1936 if (TREE_CODE (fn
) == TREE_LIST
)
1938 for (fn2
= fn
; fn2
!= NULL_TREE
; fn2
= TREE_CHAIN (fn2
))
1939 print_candidates_1 (TREE_VALUE (fn2
),
1940 TREE_CHAIN (fn2
) || more
, str
);
1944 tree cand
= OVL_CURRENT (fn
);
1947 /* Pick the prefix string. */
1948 if (!more
&& !OVL_NEXT (fns
))
1950 inform (DECL_SOURCE_LOCATION (cand
),
1951 "candidate is: %#D", cand
);
1955 *str
= _("candidates are:");
1956 spaces
= get_spaces (*str
);
1958 inform (DECL_SOURCE_LOCATION (cand
), "%s %#D", *str
, cand
);
1959 *str
= spaces
? spaces
: *str
;
1969 /* Print the list of candidate FNS in an error message. FNS can also
1970 be a TREE_LIST of non-functions in the case of an ambiguous lookup. */
1973 print_candidates (tree fns
)
1975 const char *str
= NULL
;
1976 print_candidates_1 (fns
, false, &str
);
1977 gcc_assert (str
== NULL
);
1980 /* Get a (possibly) constrained template declaration for the
1981 purpose of ordering candidates. */
1983 get_template_for_ordering (tree list
)
1985 gcc_assert (TREE_CODE (list
) == TREE_LIST
);
1986 tree f
= TREE_VALUE (list
);
1987 if (tree ti
= DECL_TEMPLATE_INFO (f
))
1988 return TI_TEMPLATE (ti
);
1992 /* Among candidates having the same signature, return the
1993 most constrained or NULL_TREE if there is no best candidate.
1994 If the signatures of candidates vary (e.g., template
1995 specialization vs. member function), then there can be no
1998 Note that we don't compare constraints on the functions
1999 themselves, but rather those of their templates. */
2001 most_constrained_function (tree candidates
)
2003 // Try to find the best candidate in a first pass.
2004 tree champ
= candidates
;
2005 for (tree c
= TREE_CHAIN (champ
); c
; c
= TREE_CHAIN (c
))
2007 int winner
= more_constrained (get_template_for_ordering (champ
),
2008 get_template_for_ordering (c
));
2010 champ
= c
; // The candidate is more constrained
2011 else if (winner
== 0)
2012 return NULL_TREE
; // Neither is more constrained
2015 // Verify that the champ is better than previous candidates.
2016 for (tree c
= candidates
; c
!= champ
; c
= TREE_CHAIN (c
)) {
2017 if (!more_constrained (get_template_for_ordering (champ
),
2018 get_template_for_ordering (c
)))
2026 /* Returns the template (one of the functions given by TEMPLATE_ID)
2027 which can be specialized to match the indicated DECL with the
2028 explicit template args given in TEMPLATE_ID. The DECL may be
2029 NULL_TREE if none is available. In that case, the functions in
2030 TEMPLATE_ID are non-members.
2032 If NEED_MEMBER_TEMPLATE is nonzero the function is known to be a
2033 specialization of a member template.
2035 The TEMPLATE_COUNT is the number of references to qualifying
2036 template classes that appeared in the name of the function. See
2037 check_explicit_specialization for a more accurate description.
2039 TSK indicates what kind of template declaration (if any) is being
2040 declared. TSK_TEMPLATE indicates that the declaration given by
2041 DECL, though a FUNCTION_DECL, has template parameters, and is
2042 therefore a template function.
2044 The template args (those explicitly specified and those deduced)
2045 are output in a newly created vector *TARGS_OUT.
2047 If it is impossible to determine the result, an error message is
2048 issued. The error_mark_node is returned to indicate failure. */
2051 determine_specialization (tree template_id
,
2054 int need_member_template
,
2060 tree explicit_targs
;
2061 tree candidates
= NULL_TREE
;
2063 /* A TREE_LIST of templates of which DECL may be a specialization.
2064 The TREE_VALUE of each node is a TEMPLATE_DECL. The
2065 corresponding TREE_PURPOSE is the set of template arguments that,
2066 when used to instantiate the template, would produce a function
2067 with the signature of DECL. */
2068 tree templates
= NULL_TREE
;
2070 cp_binding_level
*b
;
2072 *targs_out
= NULL_TREE
;
2074 if (template_id
== error_mark_node
|| decl
== error_mark_node
)
2075 return error_mark_node
;
2077 /* We shouldn't be specializing a member template of an
2078 unspecialized class template; we already gave an error in
2079 check_specialization_scope, now avoid crashing. */
2080 if (template_count
&& DECL_CLASS_SCOPE_P (decl
)
2081 && template_class_depth (DECL_CONTEXT (decl
)) > 0)
2083 gcc_assert (errorcount
);
2084 return error_mark_node
;
2087 fns
= TREE_OPERAND (template_id
, 0);
2088 explicit_targs
= TREE_OPERAND (template_id
, 1);
2090 if (fns
== error_mark_node
)
2091 return error_mark_node
;
2093 /* Check for baselinks. */
2094 if (BASELINK_P (fns
))
2095 fns
= BASELINK_FUNCTIONS (fns
);
2097 if (TREE_CODE (decl
) == FUNCTION_DECL
&& !is_overloaded_fn (fns
))
2099 error ("%qD is not a function template", fns
);
2100 return error_mark_node
;
2102 else if (VAR_P (decl
) && !variable_template_p (fns
))
2104 error ("%qD is not a variable template", fns
);
2105 return error_mark_node
;
2108 /* Count the number of template headers specified for this
2111 for (b
= current_binding_level
;
2112 b
->kind
== sk_template_parms
;
2116 tree orig_fns
= fns
;
2118 if (variable_template_p (fns
))
2120 tree parms
= INNERMOST_TEMPLATE_PARMS (DECL_TEMPLATE_PARMS (fns
));
2121 targs
= coerce_template_parms (parms
, explicit_targs
, fns
,
2122 tf_warning_or_error
,
2123 /*req_all*/true, /*use_defarg*/true);
2124 if (targs
!= error_mark_node
)
2125 templates
= tree_cons (targs
, fns
, templates
);
2127 else for (; fns
; fns
= OVL_NEXT (fns
))
2129 tree fn
= OVL_CURRENT (fns
);
2131 if (TREE_CODE (fn
) == TEMPLATE_DECL
)
2133 tree decl_arg_types
;
2137 /* In case of explicit specialization, we need to check if
2138 the number of template headers appearing in the specialization
2139 is correct. This is usually done in check_explicit_specialization,
2140 but the check done there cannot be exhaustive when specializing
2141 member functions. Consider the following code:
2143 template <> void A<int>::f(int);
2144 template <> template <> void A<int>::f(int);
2146 Assuming that A<int> is not itself an explicit specialization
2147 already, the first line specializes "f" which is a non-template
2148 member function, whilst the second line specializes "f" which
2149 is a template member function. So both lines are syntactically
2150 correct, and check_explicit_specialization does not reject
2153 Here, we can do better, as we are matching the specialization
2154 against the declarations. We count the number of template
2155 headers, and we check if they match TEMPLATE_COUNT + 1
2156 (TEMPLATE_COUNT is the number of qualifying template classes,
2157 plus there must be another header for the member template
2160 Notice that if header_count is zero, this is not a
2161 specialization but rather a template instantiation, so there
2162 is no check we can perform here. */
2163 if (header_count
&& header_count
!= template_count
+ 1)
2166 /* Check that the number of template arguments at the
2167 innermost level for DECL is the same as for FN. */
2168 if (current_binding_level
->kind
== sk_template_parms
2169 && !current_binding_level
->explicit_spec_p
2170 && (TREE_VEC_LENGTH (DECL_INNERMOST_TEMPLATE_PARMS (fn
))
2171 != TREE_VEC_LENGTH (INNERMOST_TEMPLATE_PARMS
2172 (current_template_parms
))))
2175 /* DECL might be a specialization of FN. */
2176 decl_arg_types
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
2177 fn_arg_types
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
2179 /* For a non-static member function, we need to make sure
2180 that the const qualification is the same. Since
2181 get_bindings does not try to merge the "this" parameter,
2182 we must do the comparison explicitly. */
2183 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
)
2184 && !same_type_p (TREE_VALUE (fn_arg_types
),
2185 TREE_VALUE (decl_arg_types
)))
2188 /* Skip the "this" parameter and, for constructors of
2189 classes with virtual bases, the VTT parameter. A
2190 full specialization of a constructor will have a VTT
2191 parameter, but a template never will. */
2193 = skip_artificial_parms_for (decl
, decl_arg_types
);
2195 = skip_artificial_parms_for (fn
, fn_arg_types
);
2197 /* Function templates cannot be specializations; there are
2198 no partial specializations of functions. Therefore, if
2199 the type of DECL does not match FN, there is no
2202 Note that it should never be the case that we have both
2203 candidates added here, and for regular member functions
2205 if (tsk
== tsk_template
)
2207 if (compparms (fn_arg_types
, decl_arg_types
))
2208 candidates
= tree_cons (NULL_TREE
, fn
, candidates
);
2212 /* See whether this function might be a specialization of this
2213 template. Suppress access control because we might be trying
2214 to make this specialization a friend, and we have already done
2215 access control for the declaration of the specialization. */
2216 push_deferring_access_checks (dk_no_check
);
2217 targs
= get_bindings (fn
, decl
, explicit_targs
, /*check_ret=*/true);
2218 pop_deferring_access_checks ();
2221 /* We cannot deduce template arguments that when used to
2222 specialize TMPL will produce DECL. */
2225 /* Remove, from the set of candidates, all those functions
2226 whose constraints are not satisfied. */
2227 if (flag_concepts
&& !constraints_satisfied_p (fn
, targs
))
2230 // Then, try to form the new function type.
2231 insttype
= tsubst (TREE_TYPE (fn
), targs
, tf_none
, NULL_TREE
);
2232 if (insttype
== error_mark_node
)
2235 = skip_artificial_parms_for (fn
, TYPE_ARG_TYPES (insttype
));
2236 if (!compparms (fn_arg_types
, decl_arg_types
))
2239 /* Save this template, and the arguments deduced. */
2240 templates
= tree_cons (targs
, fn
, templates
);
2242 else if (need_member_template
)
2243 /* FN is an ordinary member function, and we need a
2244 specialization of a member template. */
2246 else if (TREE_CODE (fn
) != FUNCTION_DECL
)
2247 /* We can get IDENTIFIER_NODEs here in certain erroneous
2250 else if (!DECL_FUNCTION_MEMBER_P (fn
))
2251 /* This is just an ordinary non-member function. Nothing can
2252 be a specialization of that. */
2254 else if (DECL_ARTIFICIAL (fn
))
2255 /* Cannot specialize functions that are created implicitly. */
2259 tree decl_arg_types
;
2261 /* This is an ordinary member function. However, since
2262 we're here, we can assume its enclosing class is a
2263 template class. For example,
2265 template <typename T> struct S { void f(); };
2266 template <> void S<int>::f() {}
2268 Here, S<int>::f is a non-template, but S<int> is a
2269 template class. If FN has the same type as DECL, we
2270 might be in business. */
2272 if (!DECL_TEMPLATE_INFO (fn
))
2273 /* Its enclosing class is an explicit specialization
2274 of a template class. This is not a candidate. */
2277 if (!same_type_p (TREE_TYPE (TREE_TYPE (decl
)),
2278 TREE_TYPE (TREE_TYPE (fn
))))
2279 /* The return types differ. */
2282 /* Adjust the type of DECL in case FN is a static member. */
2283 decl_arg_types
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
2284 if (DECL_STATIC_FUNCTION_P (fn
)
2285 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
2286 decl_arg_types
= TREE_CHAIN (decl_arg_types
);
2288 if (!compparms (TYPE_ARG_TYPES (TREE_TYPE (fn
)),
2292 // If the deduced arguments do not satisfy the constraints,
2293 // this is not a candidate.
2294 if (flag_concepts
&& !constraints_satisfied_p (fn
))
2297 // Add the candidate.
2298 candidates
= tree_cons (NULL_TREE
, fn
, candidates
);
2302 if (templates
&& TREE_CHAIN (templates
))
2308 It is possible for a specialization with a given function
2309 signature to be instantiated from more than one function
2310 template. In such cases, explicit specification of the
2311 template arguments must be used to uniquely identify the
2312 function template specialization being specialized.
2314 Note that here, there's no suggestion that we're supposed to
2315 determine which of the candidate templates is most
2316 specialized. However, we, also have:
2320 Partial ordering of overloaded function template
2321 declarations is used in the following contexts to select
2322 the function template to which a function template
2323 specialization refers:
2325 -- when an explicit specialization refers to a function
2328 So, we do use the partial ordering rules, at least for now.
2329 This extension can only serve to make invalid programs valid,
2330 so it's safe. And, there is strong anecdotal evidence that
2331 the committee intended the partial ordering rules to apply;
2332 the EDG front end has that behavior, and John Spicer claims
2333 that the committee simply forgot to delete the wording in
2334 [temp.expl.spec]. */
2335 tree tmpl
= most_specialized_instantiation (templates
);
2336 if (tmpl
!= error_mark_node
)
2339 TREE_CHAIN (templates
) = NULL_TREE
;
2343 // Concepts allows multiple declarations of member functions
2344 // with the same signature. Like above, we need to rely on
2345 // on the partial ordering of those candidates to determine which
2347 if (flag_concepts
&& candidates
&& TREE_CHAIN (candidates
))
2349 if (tree cand
= most_constrained_function (candidates
))
2352 TREE_CHAIN (cand
) = NULL_TREE
;
2356 if (templates
== NULL_TREE
&& candidates
== NULL_TREE
)
2358 error ("template-id %qD for %q+D does not match any template "
2359 "declaration", template_id
, decl
);
2360 if (header_count
&& header_count
!= template_count
+ 1)
2361 inform (input_location
, "saw %d %<template<>%>, need %d for "
2362 "specializing a member function template",
2363 header_count
, template_count
+ 1);
2365 print_candidates (orig_fns
);
2366 return error_mark_node
;
2368 else if ((templates
&& TREE_CHAIN (templates
))
2369 || (candidates
&& TREE_CHAIN (candidates
))
2370 || (templates
&& candidates
))
2372 error ("ambiguous template specialization %qD for %q+D",
2374 candidates
= chainon (candidates
, templates
);
2375 print_candidates (candidates
);
2376 return error_mark_node
;
2379 /* We have one, and exactly one, match. */
2382 tree fn
= TREE_VALUE (candidates
);
2383 *targs_out
= copy_node (DECL_TI_ARGS (fn
));
2385 // Propagate the candidate's constraints to the declaration.
2386 set_constraints (decl
, get_constraints (fn
));
2388 /* DECL is a re-declaration or partial instantiation of a template
2390 if (TREE_CODE (fn
) == TEMPLATE_DECL
)
2392 /* It was a specialization of an ordinary member function in a
2394 return DECL_TI_TEMPLATE (fn
);
2397 /* It was a specialization of a template. */
2398 targs
= DECL_TI_ARGS (DECL_TEMPLATE_RESULT (TREE_VALUE (templates
)));
2399 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (targs
))
2401 *targs_out
= copy_node (targs
);
2402 SET_TMPL_ARGS_LEVEL (*targs_out
,
2403 TMPL_ARGS_DEPTH (*targs_out
),
2404 TREE_PURPOSE (templates
));
2407 *targs_out
= TREE_PURPOSE (templates
);
2408 return TREE_VALUE (templates
);
2411 /* Returns a chain of parameter types, exactly like the SPEC_TYPES,
2412 but with the default argument values filled in from those in the
2416 copy_default_args_to_explicit_spec_1 (tree spec_types
,
2419 tree new_spec_types
;
2424 if (spec_types
== void_list_node
)
2425 return void_list_node
;
2427 /* Substitute into the rest of the list. */
2429 copy_default_args_to_explicit_spec_1 (TREE_CHAIN (spec_types
),
2430 TREE_CHAIN (tmpl_types
));
2432 /* Add the default argument for this parameter. */
2433 return hash_tree_cons (TREE_PURPOSE (tmpl_types
),
2434 TREE_VALUE (spec_types
),
2438 /* DECL is an explicit specialization. Replicate default arguments
2439 from the template it specializes. (That way, code like:
2441 template <class T> void f(T = 3);
2442 template <> void f(double);
2445 works, as required.) An alternative approach would be to look up
2446 the correct default arguments at the call-site, but this approach
2447 is consistent with how implicit instantiations are handled. */
2450 copy_default_args_to_explicit_spec (tree decl
)
2455 tree new_spec_types
;
2459 tree object_type
= NULL_TREE
;
2460 tree in_charge
= NULL_TREE
;
2461 tree vtt
= NULL_TREE
;
2463 /* See if there's anything we need to do. */
2464 tmpl
= DECL_TI_TEMPLATE (decl
);
2465 tmpl_types
= TYPE_ARG_TYPES (TREE_TYPE (DECL_TEMPLATE_RESULT (tmpl
)));
2466 for (t
= tmpl_types
; t
; t
= TREE_CHAIN (t
))
2467 if (TREE_PURPOSE (t
))
2472 old_type
= TREE_TYPE (decl
);
2473 spec_types
= TYPE_ARG_TYPES (old_type
);
2475 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
2477 /* Remove the this pointer, but remember the object's type for
2479 object_type
= TREE_TYPE (TREE_VALUE (spec_types
));
2480 spec_types
= TREE_CHAIN (spec_types
);
2481 tmpl_types
= TREE_CHAIN (tmpl_types
);
2483 if (DECL_HAS_IN_CHARGE_PARM_P (decl
))
2485 /* DECL may contain more parameters than TMPL due to the extra
2486 in-charge parameter in constructors and destructors. */
2487 in_charge
= spec_types
;
2488 spec_types
= TREE_CHAIN (spec_types
);
2490 if (DECL_HAS_VTT_PARM_P (decl
))
2493 spec_types
= TREE_CHAIN (spec_types
);
2497 /* Compute the merged default arguments. */
2499 copy_default_args_to_explicit_spec_1 (spec_types
, tmpl_types
);
2501 /* Compute the new FUNCTION_TYPE. */
2505 new_spec_types
= hash_tree_cons (TREE_PURPOSE (vtt
),
2510 /* Put the in-charge parameter back. */
2511 new_spec_types
= hash_tree_cons (TREE_PURPOSE (in_charge
),
2512 TREE_VALUE (in_charge
),
2515 new_type
= build_method_type_directly (object_type
,
2516 TREE_TYPE (old_type
),
2520 new_type
= build_function_type (TREE_TYPE (old_type
),
2522 new_type
= cp_build_type_attribute_variant (new_type
,
2523 TYPE_ATTRIBUTES (old_type
));
2524 new_type
= build_exception_variant (new_type
,
2525 TYPE_RAISES_EXCEPTIONS (old_type
));
2527 if (TYPE_HAS_LATE_RETURN_TYPE (old_type
))
2528 TYPE_HAS_LATE_RETURN_TYPE (new_type
) = 1;
2530 TREE_TYPE (decl
) = new_type
;
2533 /* Return the number of template headers we expect to see for a definition
2534 or specialization of CTYPE or one of its non-template members. */
2537 num_template_headers_for_class (tree ctype
)
2539 int num_templates
= 0;
2541 while (ctype
&& CLASS_TYPE_P (ctype
))
2543 /* You're supposed to have one `template <...>' for every
2544 template class, but you don't need one for a full
2545 specialization. For example:
2547 template <class T> struct S{};
2548 template <> struct S<int> { void f(); };
2549 void S<int>::f () {}
2551 is correct; there shouldn't be a `template <>' for the
2552 definition of `S<int>::f'. */
2553 if (!CLASSTYPE_TEMPLATE_INFO (ctype
))
2554 /* If CTYPE does not have template information of any
2555 kind, then it is not a template, nor is it nested
2556 within a template. */
2558 if (explicit_class_specialization_p (ctype
))
2560 if (PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (ctype
)))
2563 ctype
= TYPE_CONTEXT (ctype
);
2566 return num_templates
;
2569 /* Do a simple sanity check on the template headers that precede the
2570 variable declaration DECL. */
2573 check_template_variable (tree decl
)
2575 tree ctx
= CP_DECL_CONTEXT (decl
);
2576 int wanted
= num_template_headers_for_class (ctx
);
2577 if (DECL_LANG_SPECIFIC (decl
) && DECL_TEMPLATE_INFO (decl
)
2578 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (decl
)))
2580 if (cxx_dialect
< cxx14
)
2581 pedwarn (DECL_SOURCE_LOCATION (decl
), 0,
2582 "variable templates only available with "
2583 "-std=c++14 or -std=gnu++14");
2585 // Namespace-scope variable templates should have a template header.
2588 if (template_header_count
> wanted
)
2590 bool warned
= pedwarn (DECL_SOURCE_LOCATION (decl
), 0,
2591 "too many template headers for %D (should be %d)",
2593 if (warned
&& CLASS_TYPE_P (ctx
)
2594 && CLASSTYPE_TEMPLATE_SPECIALIZATION (ctx
))
2595 inform (DECL_SOURCE_LOCATION (decl
),
2596 "members of an explicitly specialized class are defined "
2597 "without a template header");
2601 /* Check to see if the function just declared, as indicated in
2602 DECLARATOR, and in DECL, is a specialization of a function
2603 template. We may also discover that the declaration is an explicit
2604 instantiation at this point.
2606 Returns DECL, or an equivalent declaration that should be used
2607 instead if all goes well. Issues an error message if something is
2608 amiss. Returns error_mark_node if the error is not easily
2611 FLAGS is a bitmask consisting of the following flags:
2613 2: The function has a definition.
2614 4: The function is a friend.
2616 The TEMPLATE_COUNT is the number of references to qualifying
2617 template classes that appeared in the name of the function. For
2620 template <class T> struct S { void f(); };
2623 the TEMPLATE_COUNT would be 1. However, explicitly specialized
2624 classes are not counted in the TEMPLATE_COUNT, so that in
2626 template <class T> struct S {};
2627 template <> struct S<int> { void f(); }
2628 template <> void S<int>::f();
2630 the TEMPLATE_COUNT would be 0. (Note that this declaration is
2631 invalid; there should be no template <>.)
2633 If the function is a specialization, it is marked as such via
2634 DECL_TEMPLATE_SPECIALIZATION. Furthermore, its DECL_TEMPLATE_INFO
2635 is set up correctly, and it is added to the list of specializations
2636 for that template. */
2639 check_explicit_specialization (tree declarator
,
2644 int have_def
= flags
& 2;
2645 int is_friend
= flags
& 4;
2646 bool is_concept
= flags
& 8;
2647 int specialization
= 0;
2648 int explicit_instantiation
= 0;
2649 int member_specialization
= 0;
2650 tree ctype
= DECL_CLASS_CONTEXT (decl
);
2651 tree dname
= DECL_NAME (decl
);
2656 if (!processing_specialization
)
2659 tsk
= tsk_excessive_parms
;
2662 tsk
= current_tmpl_spec_kind (template_count
);
2667 if (processing_specialization
&& !VAR_P (decl
))
2670 SET_DECL_TEMPLATE_SPECIALIZATION (decl
);
2672 else if (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
)
2675 /* This could be something like:
2677 template <class T> void f(T);
2678 class S { friend void f<>(int); } */
2682 /* This case handles bogus declarations like template <>
2683 template <class T> void f<int>(); */
2685 error ("template-id %qD in declaration of primary template",
2692 case tsk_invalid_member_spec
:
2693 /* The error has already been reported in
2694 check_specialization_scope. */
2695 return error_mark_node
;
2697 case tsk_invalid_expl_inst
:
2698 error ("template parameter list used in explicit instantiation");
2704 error ("definition provided for explicit instantiation");
2706 explicit_instantiation
= 1;
2709 case tsk_excessive_parms
:
2710 case tsk_insufficient_parms
:
2711 if (tsk
== tsk_excessive_parms
)
2712 error ("too many template parameter lists in declaration of %qD",
2714 else if (template_header_count
)
2715 error("too few template parameter lists in declaration of %qD", decl
);
2717 error("explicit specialization of %qD must be introduced by "
2718 "%<template <>%>", decl
);
2723 error ("explicit specialization declared %<concept%>");
2725 if (VAR_P (decl
) && TREE_CODE (declarator
) != TEMPLATE_ID_EXPR
)
2726 /* In cases like template<> constexpr bool v = true;
2727 We'll give an error in check_template_variable. */
2730 SET_DECL_TEMPLATE_SPECIALIZATION (decl
);
2732 member_specialization
= 1;
2738 if (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
)
2740 /* This case handles bogus declarations like template <>
2741 template <class T> void f<int>(); */
2743 if (!uses_template_parms (declarator
))
2744 error ("template-id %qD in declaration of primary template",
2746 else if (variable_template_p (TREE_OPERAND (declarator
, 0)))
2748 /* Partial specialization of variable template. */
2749 SET_DECL_TEMPLATE_SPECIALIZATION (decl
);
2753 else if (cxx_dialect
< cxx14
)
2754 error ("non-type partial specialization %qD "
2755 "is not allowed", declarator
);
2757 error ("non-class, non-variable partial specialization %qD "
2758 "is not allowed", declarator
);
2763 if (ctype
&& CLASSTYPE_TEMPLATE_INSTANTIATION (ctype
))
2764 /* This is a specialization of a member template, without
2765 specialization the containing class. Something like:
2767 template <class T> struct S {
2768 template <class U> void f (U);
2770 template <> template <class U> void S<int>::f(U) {}
2772 That's a specialization -- but of the entire template. */
2780 if ((specialization
|| member_specialization
)
2781 /* This doesn't apply to variable templates. */
2782 && (TREE_CODE (TREE_TYPE (decl
)) == FUNCTION_TYPE
2783 || TREE_CODE (TREE_TYPE (decl
)) == METHOD_TYPE
))
2785 tree t
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
2786 for (; t
; t
= TREE_CHAIN (t
))
2787 if (TREE_PURPOSE (t
))
2789 permerror (input_location
,
2790 "default argument specified in explicit specialization");
2795 if (specialization
|| member_specialization
|| explicit_instantiation
)
2797 tree tmpl
= NULL_TREE
;
2798 tree targs
= NULL_TREE
;
2799 bool was_template_id
= (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
);
2801 /* Make sure that the declarator is a TEMPLATE_ID_EXPR. */
2802 if (!was_template_id
)
2806 gcc_assert (identifier_p (declarator
));
2811 /* If there is no class context, the explicit instantiation
2812 must be at namespace scope. */
2813 gcc_assert (DECL_NAMESPACE_SCOPE_P (decl
));
2815 /* Find the namespace binding, using the declaration
2817 fns
= lookup_qualified_name (CP_DECL_CONTEXT (decl
), dname
,
2819 if (fns
== error_mark_node
|| !is_overloaded_fn (fns
))
2821 error ("%qD is not a template function", dname
);
2822 fns
= error_mark_node
;
2826 tree fn
= OVL_CURRENT (fns
);
2827 if (!is_associated_namespace (CP_DECL_CONTEXT (decl
),
2828 CP_DECL_CONTEXT (fn
)))
2829 error ("%qD is not declared in %qD",
2830 decl
, current_namespace
);
2834 declarator
= lookup_template_function (fns
, NULL_TREE
);
2837 if (declarator
== error_mark_node
)
2838 return error_mark_node
;
2840 if (ctype
!= NULL_TREE
&& TYPE_BEING_DEFINED (ctype
))
2842 if (!explicit_instantiation
)
2843 /* A specialization in class scope. This is invalid,
2844 but the error will already have been flagged by
2845 check_specialization_scope. */
2846 return error_mark_node
;
2849 /* It's not valid to write an explicit instantiation in
2852 class C { template void f(); }
2854 This case is caught by the parser. However, on
2857 template class C { void f(); };
2859 (which is invalid) we can get here. The error will be
2866 else if (ctype
!= NULL_TREE
2867 && (identifier_p (TREE_OPERAND (declarator
, 0))))
2869 // We'll match variable templates in start_decl.
2873 /* Find the list of functions in ctype that have the same
2874 name as the declared function. */
2875 tree name
= TREE_OPERAND (declarator
, 0);
2876 tree fns
= NULL_TREE
;
2879 if (constructor_name_p (name
, ctype
))
2881 int is_constructor
= DECL_CONSTRUCTOR_P (decl
);
2883 if (is_constructor
? !TYPE_HAS_USER_CONSTRUCTOR (ctype
)
2884 : !CLASSTYPE_DESTRUCTORS (ctype
))
2886 /* From [temp.expl.spec]:
2888 If such an explicit specialization for the member
2889 of a class template names an implicitly-declared
2890 special member function (clause _special_), the
2891 program is ill-formed.
2893 Similar language is found in [temp.explicit]. */
2894 error ("specialization of implicitly-declared special member function");
2895 return error_mark_node
;
2898 name
= is_constructor
? ctor_identifier
: dtor_identifier
;
2901 if (!DECL_CONV_FN_P (decl
))
2903 idx
= lookup_fnfields_1 (ctype
, name
);
2905 fns
= (*CLASSTYPE_METHOD_VEC (ctype
))[idx
];
2909 vec
<tree
, va_gc
> *methods
;
2912 /* For a type-conversion operator, we cannot do a
2913 name-based lookup. We might be looking for `operator
2914 int' which will be a specialization of `operator T'.
2915 So, we find *all* the conversion operators, and then
2916 select from them. */
2919 methods
= CLASSTYPE_METHOD_VEC (ctype
);
2921 for (idx
= CLASSTYPE_FIRST_CONVERSION_SLOT
;
2922 methods
->iterate (idx
, &ovl
);
2925 if (!DECL_CONV_FN_P (OVL_CURRENT (ovl
)))
2926 /* There are no more conversion functions. */
2929 /* Glue all these conversion functions together
2930 with those we already have. */
2931 for (; ovl
; ovl
= OVL_NEXT (ovl
))
2932 fns
= ovl_cons (OVL_CURRENT (ovl
), fns
);
2936 if (fns
== NULL_TREE
)
2938 error ("no member function %qD declared in %qT", name
, ctype
);
2939 return error_mark_node
;
2942 TREE_OPERAND (declarator
, 0) = fns
;
2945 /* Figure out what exactly is being specialized at this point.
2946 Note that for an explicit instantiation, even one for a
2947 member function, we cannot tell apriori whether the
2948 instantiation is for a member template, or just a member
2949 function of a template class. Even if a member template is
2950 being instantiated, the member template arguments may be
2951 elided if they can be deduced from the rest of the
2953 tmpl
= determine_specialization (declarator
, decl
,
2955 member_specialization
,
2959 if (!tmpl
|| tmpl
== error_mark_node
)
2960 /* We couldn't figure out what this declaration was
2962 return error_mark_node
;
2965 tree gen_tmpl
= most_general_template (tmpl
);
2967 if (explicit_instantiation
)
2969 /* We don't set DECL_EXPLICIT_INSTANTIATION here; that
2970 is done by do_decl_instantiation later. */
2972 int arg_depth
= TMPL_ARGS_DEPTH (targs
);
2973 int parm_depth
= TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl
));
2975 if (arg_depth
> parm_depth
)
2977 /* If TMPL is not the most general template (for
2978 example, if TMPL is a friend template that is
2979 injected into namespace scope), then there will
2980 be too many levels of TARGS. Remove some of them
2985 new_targs
= make_tree_vec (parm_depth
);
2986 for (i
= arg_depth
- parm_depth
; i
< arg_depth
; ++i
)
2987 TREE_VEC_ELT (new_targs
, i
- (arg_depth
- parm_depth
))
2988 = TREE_VEC_ELT (targs
, i
);
2992 return instantiate_template (tmpl
, targs
, tf_error
);
2995 /* If we thought that the DECL was a member function, but it
2996 turns out to be specializing a static member function,
2997 make DECL a static member function as well. */
2998 if (DECL_FUNCTION_TEMPLATE_P (tmpl
)
2999 && DECL_STATIC_FUNCTION_P (tmpl
)
3000 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
3001 revert_static_member_fn (decl
);
3003 /* If this is a specialization of a member template of a
3004 template class, we want to return the TEMPLATE_DECL, not
3005 the specialization of it. */
3006 if (tsk
== tsk_template
&& !was_template_id
)
3008 tree result
= DECL_TEMPLATE_RESULT (tmpl
);
3009 SET_DECL_TEMPLATE_SPECIALIZATION (tmpl
);
3010 DECL_INITIAL (result
) = NULL_TREE
;
3014 DECL_SOURCE_LOCATION (tmpl
) = DECL_SOURCE_LOCATION (decl
);
3015 DECL_SOURCE_LOCATION (result
)
3016 = DECL_SOURCE_LOCATION (decl
);
3017 /* We want to use the argument list specified in the
3018 definition, not in the original declaration. */
3019 DECL_ARGUMENTS (result
) = DECL_ARGUMENTS (decl
);
3020 for (parm
= DECL_ARGUMENTS (result
); parm
;
3021 parm
= DECL_CHAIN (parm
))
3022 DECL_CONTEXT (parm
) = result
;
3024 return register_specialization (tmpl
, gen_tmpl
, targs
,
3028 /* Set up the DECL_TEMPLATE_INFO for DECL. */
3029 DECL_TEMPLATE_INFO (decl
) = build_template_info (tmpl
, targs
);
3031 if (was_template_id
)
3032 TINFO_USED_TEMPLATE_ID (DECL_TEMPLATE_INFO (decl
)) = true;
3034 /* Inherit default function arguments from the template
3035 DECL is specializing. */
3036 if (DECL_FUNCTION_TEMPLATE_P (tmpl
))
3037 copy_default_args_to_explicit_spec (decl
);
3039 /* This specialization has the same protection as the
3040 template it specializes. */
3041 TREE_PRIVATE (decl
) = TREE_PRIVATE (gen_tmpl
);
3042 TREE_PROTECTED (decl
) = TREE_PROTECTED (gen_tmpl
);
3044 /* 7.1.1-1 [dcl.stc]
3046 A storage-class-specifier shall not be specified in an
3047 explicit specialization...
3049 The parser rejects these, so unless action is taken here,
3050 explicit function specializations will always appear with
3053 The action recommended by the C++ CWG in response to C++
3054 defect report 605 is to make the storage class and linkage
3055 of the explicit specialization match the templated function:
3057 http://www.open-std.org/jtc1/sc22/wg21/docs/cwg_active.html#605
3059 if (tsk
== tsk_expl_spec
&& DECL_FUNCTION_TEMPLATE_P (gen_tmpl
))
3061 tree tmpl_func
= DECL_TEMPLATE_RESULT (gen_tmpl
);
3062 gcc_assert (TREE_CODE (tmpl_func
) == FUNCTION_DECL
);
3064 /* A concept cannot be specialized. */
3065 if (DECL_DECLARED_CONCEPT_P (tmpl_func
))
3067 error ("explicit specialization of function concept %qD",
3069 return error_mark_node
;
3072 /* This specialization has the same linkage and visibility as
3073 the function template it specializes. */
3074 TREE_PUBLIC (decl
) = TREE_PUBLIC (tmpl_func
);
3075 if (! TREE_PUBLIC (decl
))
3077 DECL_INTERFACE_KNOWN (decl
) = 1;
3078 DECL_NOT_REALLY_EXTERN (decl
) = 1;
3080 DECL_THIS_STATIC (decl
) = DECL_THIS_STATIC (tmpl_func
);
3081 if (DECL_VISIBILITY_SPECIFIED (tmpl_func
))
3083 DECL_VISIBILITY_SPECIFIED (decl
) = 1;
3084 DECL_VISIBILITY (decl
) = DECL_VISIBILITY (tmpl_func
);
3088 /* If DECL is a friend declaration, declared using an
3089 unqualified name, the namespace associated with DECL may
3090 have been set incorrectly. For example, in:
3092 template <typename T> void f(T);
3094 struct S { friend void f<int>(int); }
3097 we will have set the DECL_CONTEXT for the friend
3098 declaration to N, rather than to the global namespace. */
3099 if (DECL_NAMESPACE_SCOPE_P (decl
))
3100 DECL_CONTEXT (decl
) = DECL_CONTEXT (tmpl
);
3102 if (is_friend
&& !have_def
)
3103 /* This is not really a declaration of a specialization.
3104 It's just the name of an instantiation. But, it's not
3105 a request for an instantiation, either. */
3106 SET_DECL_IMPLICIT_INSTANTIATION (decl
);
3107 else if (TREE_CODE (decl
) == FUNCTION_DECL
)
3108 /* A specialization is not necessarily COMDAT. */
3109 DECL_COMDAT (decl
) = (TREE_PUBLIC (decl
)
3110 && DECL_DECLARED_INLINE_P (decl
));
3111 else if (VAR_P (decl
))
3112 DECL_COMDAT (decl
) = false;
3114 /* If this is a full specialization, register it so that we can find
3115 it again. Partial specializations will be registered in
3116 process_partial_specialization. */
3117 if (!processing_template_decl
)
3118 decl
= register_specialization (decl
, gen_tmpl
, targs
,
3121 /* A 'structor should already have clones. */
3122 gcc_assert (decl
== error_mark_node
3123 || variable_template_p (tmpl
)
3124 || !(DECL_CONSTRUCTOR_P (decl
)
3125 || DECL_DESTRUCTOR_P (decl
))
3126 || DECL_CLONED_FUNCTION_P (DECL_CHAIN (decl
)));
3133 /* Returns 1 iff PARMS1 and PARMS2 are identical sets of template
3134 parameters. These are represented in the same format used for
3135 DECL_TEMPLATE_PARMS. */
3138 comp_template_parms (const_tree parms1
, const_tree parms2
)
3143 if (parms1
== parms2
)
3146 for (p1
= parms1
, p2
= parms2
;
3147 p1
!= NULL_TREE
&& p2
!= NULL_TREE
;
3148 p1
= TREE_CHAIN (p1
), p2
= TREE_CHAIN (p2
))
3150 tree t1
= TREE_VALUE (p1
);
3151 tree t2
= TREE_VALUE (p2
);
3154 gcc_assert (TREE_CODE (t1
) == TREE_VEC
);
3155 gcc_assert (TREE_CODE (t2
) == TREE_VEC
);
3157 if (TREE_VEC_LENGTH (t1
) != TREE_VEC_LENGTH (t2
))
3160 for (i
= 0; i
< TREE_VEC_LENGTH (t2
); ++i
)
3162 tree parm1
= TREE_VALUE (TREE_VEC_ELT (t1
, i
));
3163 tree parm2
= TREE_VALUE (TREE_VEC_ELT (t2
, i
));
3165 /* If either of the template parameters are invalid, assume
3166 they match for the sake of error recovery. */
3167 if (error_operand_p (parm1
) || error_operand_p (parm2
))
3170 if (TREE_CODE (parm1
) != TREE_CODE (parm2
))
3173 if (TREE_CODE (parm1
) == TEMPLATE_TYPE_PARM
3174 && (TEMPLATE_TYPE_PARAMETER_PACK (parm1
)
3175 == TEMPLATE_TYPE_PARAMETER_PACK (parm2
)))
3177 else if (!same_type_p (TREE_TYPE (parm1
), TREE_TYPE (parm2
)))
3182 if ((p1
!= NULL_TREE
) != (p2
!= NULL_TREE
))
3183 /* One set of parameters has more parameters lists than the
3190 /* Determine whether PARM is a parameter pack. */
3193 template_parameter_pack_p (const_tree parm
)
3195 /* Determine if we have a non-type template parameter pack. */
3196 if (TREE_CODE (parm
) == PARM_DECL
)
3197 return (DECL_TEMPLATE_PARM_P (parm
)
3198 && TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm
)));
3199 if (TREE_CODE (parm
) == TEMPLATE_PARM_INDEX
)
3200 return TEMPLATE_PARM_PARAMETER_PACK (parm
);
3202 /* If this is a list of template parameters, we could get a
3203 TYPE_DECL or a TEMPLATE_DECL. */
3204 if (TREE_CODE (parm
) == TYPE_DECL
|| TREE_CODE (parm
) == TEMPLATE_DECL
)
3205 parm
= TREE_TYPE (parm
);
3207 /* Otherwise it must be a type template parameter. */
3208 return ((TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
3209 || TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
)
3210 && TEMPLATE_TYPE_PARAMETER_PACK (parm
));
3213 /* Determine if T is a function parameter pack. */
3216 function_parameter_pack_p (const_tree t
)
3218 if (t
&& TREE_CODE (t
) == PARM_DECL
)
3219 return DECL_PACK_P (t
);
3223 /* Return the function template declaration of PRIMARY_FUNC_TMPL_INST.
3224 PRIMARY_FUNC_TMPL_INST is a primary function template instantiation. */
3227 get_function_template_decl (const_tree primary_func_tmpl_inst
)
3229 if (! primary_func_tmpl_inst
3230 || TREE_CODE (primary_func_tmpl_inst
) != FUNCTION_DECL
3231 || ! primary_template_instantiation_p (primary_func_tmpl_inst
))
3234 return DECL_TEMPLATE_RESULT (DECL_TI_TEMPLATE (primary_func_tmpl_inst
));
3237 /* Return true iff the function parameter PARAM_DECL was expanded
3238 from the function parameter pack PACK. */
3241 function_parameter_expanded_from_pack_p (tree param_decl
, tree pack
)
3243 if (DECL_ARTIFICIAL (param_decl
)
3244 || !function_parameter_pack_p (pack
))
3247 /* The parameter pack and its pack arguments have the same
3249 return DECL_PARM_INDEX (pack
) == DECL_PARM_INDEX (param_decl
);
3252 /* Determine whether ARGS describes a variadic template args list,
3253 i.e., one that is terminated by a template argument pack. */
3256 template_args_variadic_p (tree args
)
3261 if (args
== NULL_TREE
)
3264 args
= INNERMOST_TEMPLATE_ARGS (args
);
3265 nargs
= TREE_VEC_LENGTH (args
);
3270 last_parm
= TREE_VEC_ELT (args
, nargs
- 1);
3272 return ARGUMENT_PACK_P (last_parm
);
3275 /* Generate a new name for the parameter pack name NAME (an
3276 IDENTIFIER_NODE) that incorporates its */
3279 make_ith_pack_parameter_name (tree name
, int i
)
3281 /* Munge the name to include the parameter index. */
3282 #define NUMBUF_LEN 128
3283 char numbuf
[NUMBUF_LEN
];
3287 if (name
== NULL_TREE
)
3289 snprintf (numbuf
, NUMBUF_LEN
, "%i", i
);
3290 newname_len
= IDENTIFIER_LENGTH (name
)
3291 + strlen (numbuf
) + 2;
3292 newname
= (char*)alloca (newname_len
);
3293 snprintf (newname
, newname_len
,
3294 "%s#%i", IDENTIFIER_POINTER (name
), i
);
3295 return get_identifier (newname
);
3298 /* Return true if T is a primary function, class or alias template
3302 primary_template_instantiation_p (const_tree t
)
3307 if (TREE_CODE (t
) == FUNCTION_DECL
)
3308 return DECL_LANG_SPECIFIC (t
)
3309 && DECL_TEMPLATE_INSTANTIATION (t
)
3310 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (t
));
3311 else if (CLASS_TYPE_P (t
) && !TYPE_DECL_ALIAS_P (TYPE_NAME (t
)))
3312 return CLASSTYPE_TEMPLATE_INSTANTIATION (t
)
3313 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (t
));
3314 else if (alias_template_specialization_p (t
))
3319 /* Return true if PARM is a template template parameter. */
3322 template_template_parameter_p (const_tree parm
)
3324 return DECL_TEMPLATE_TEMPLATE_PARM_P (parm
);
3327 /* Return true iff PARM is a DECL representing a type template
3331 template_type_parameter_p (const_tree parm
)
3334 && (TREE_CODE (parm
) == TYPE_DECL
3335 || TREE_CODE (parm
) == TEMPLATE_DECL
)
3336 && DECL_TEMPLATE_PARM_P (parm
));
3339 /* Return the template parameters of T if T is a
3340 primary template instantiation, NULL otherwise. */
3343 get_primary_template_innermost_parameters (const_tree t
)
3345 tree parms
= NULL
, template_info
= NULL
;
3347 if ((template_info
= get_template_info (t
))
3348 && primary_template_instantiation_p (t
))
3349 parms
= INNERMOST_TEMPLATE_PARMS
3350 (DECL_TEMPLATE_PARMS (TI_TEMPLATE (template_info
)));
3355 /* Return the template parameters of the LEVELth level from the full list
3356 of template parameters PARMS. */
3359 get_template_parms_at_level (tree parms
, int level
)
3363 || TREE_CODE (parms
) != TREE_LIST
3364 || level
> TMPL_PARMS_DEPTH (parms
))
3367 for (p
= parms
; p
; p
= TREE_CHAIN (p
))
3368 if (TMPL_PARMS_DEPTH (p
) == level
)
3374 /* Returns the template arguments of T if T is a template instantiation,
3378 get_template_innermost_arguments (const_tree t
)
3380 tree args
= NULL
, template_info
= NULL
;
3382 if ((template_info
= get_template_info (t
))
3383 && TI_ARGS (template_info
))
3384 args
= INNERMOST_TEMPLATE_ARGS (TI_ARGS (template_info
));
3389 /* Return the argument pack elements of T if T is a template argument pack,
3393 get_template_argument_pack_elems (const_tree t
)
3395 if (TREE_CODE (t
) != TYPE_ARGUMENT_PACK
3396 && TREE_CODE (t
) != NONTYPE_ARGUMENT_PACK
)
3399 return ARGUMENT_PACK_ARGS (t
);
3402 /* Structure used to track the progress of find_parameter_packs_r. */
3403 struct find_parameter_pack_data
3405 /* TREE_LIST that will contain all of the parameter packs found by
3407 tree
* parameter_packs
;
3409 /* Set of AST nodes that have been visited by the traversal. */
3410 hash_set
<tree
> *visited
;
3413 /* Identifies all of the argument packs that occur in a template
3414 argument and appends them to the TREE_LIST inside DATA, which is a
3415 find_parameter_pack_data structure. This is a subroutine of
3416 make_pack_expansion and uses_parameter_packs. */
3418 find_parameter_packs_r (tree
*tp
, int *walk_subtrees
, void* data
)
3421 struct find_parameter_pack_data
* ppd
=
3422 (struct find_parameter_pack_data
*)data
;
3423 bool parameter_pack_p
= false;
3425 /* Handle type aliases/typedefs. */
3426 if (TYPE_ALIAS_P (t
))
3428 if (TYPE_TEMPLATE_INFO (t
))
3429 cp_walk_tree (&TYPE_TI_ARGS (t
),
3430 &find_parameter_packs_r
,
3436 /* Identify whether this is a parameter pack or not. */
3437 switch (TREE_CODE (t
))
3439 case TEMPLATE_PARM_INDEX
:
3440 if (TEMPLATE_PARM_PARAMETER_PACK (t
))
3441 parameter_pack_p
= true;
3444 case TEMPLATE_TYPE_PARM
:
3445 t
= TYPE_MAIN_VARIANT (t
);
3446 case TEMPLATE_TEMPLATE_PARM
:
3447 if (TEMPLATE_TYPE_PARAMETER_PACK (t
))
3448 parameter_pack_p
= true;
3453 if (DECL_PACK_P (t
))
3455 /* We don't want to walk into the type of a PARM_DECL,
3456 because we don't want to see the type parameter pack. */
3458 parameter_pack_p
= true;
3462 /* Look through a lambda capture proxy to the field pack. */
3464 if (DECL_HAS_VALUE_EXPR_P (t
))
3466 tree v
= DECL_VALUE_EXPR (t
);
3468 &find_parameter_packs_r
,
3472 else if (variable_template_specialization_p (t
))
3474 cp_walk_tree (&DECL_TI_ARGS (t
),
3475 find_parameter_packs_r
,
3482 parameter_pack_p
= true;
3485 /* Not a parameter pack. */
3489 if (parameter_pack_p
)
3491 /* Add this parameter pack to the list. */
3492 *ppd
->parameter_packs
= tree_cons (NULL_TREE
, t
, *ppd
->parameter_packs
);
3496 cp_walk_tree (&TYPE_CONTEXT (t
),
3497 &find_parameter_packs_r
, ppd
, ppd
->visited
);
3499 /* This switch statement will return immediately if we don't find a
3501 switch (TREE_CODE (t
))
3503 case TEMPLATE_PARM_INDEX
:
3506 case BOUND_TEMPLATE_TEMPLATE_PARM
:
3507 /* Check the template itself. */
3508 cp_walk_tree (&TREE_TYPE (TYPE_TI_TEMPLATE (t
)),
3509 &find_parameter_packs_r
, ppd
, ppd
->visited
);
3510 /* Check the template arguments. */
3511 cp_walk_tree (&TYPE_TI_ARGS (t
), &find_parameter_packs_r
, ppd
,
3516 case TEMPLATE_TYPE_PARM
:
3517 case TEMPLATE_TEMPLATE_PARM
:
3524 if (TYPE_PTRMEMFUNC_P (t
))
3530 if (TYPE_TEMPLATE_INFO (t
))
3531 cp_walk_tree (&TYPE_TI_ARGS (t
),
3532 &find_parameter_packs_r
, ppd
, ppd
->visited
);
3539 cp_walk_tree (&TREE_TYPE (t
),
3540 &find_parameter_packs_r
, ppd
, ppd
->visited
);
3544 cp_walk_tree (&TYPENAME_TYPE_FULLNAME (t
), &find_parameter_packs_r
,
3549 case TYPE_PACK_EXPANSION
:
3550 case EXPR_PACK_EXPANSION
:
3555 cp_walk_tree (&TYPE_MAX_VALUE (t
), &find_parameter_packs_r
,
3560 case IDENTIFIER_NODE
:
3561 cp_walk_tree (&TREE_TYPE (t
), &find_parameter_packs_r
, ppd
,
3573 /* Determines if the expression or type T uses any parameter packs. */
3575 uses_parameter_packs (tree t
)
3577 tree parameter_packs
= NULL_TREE
;
3578 struct find_parameter_pack_data ppd
;
3579 ppd
.parameter_packs
= ¶meter_packs
;
3580 ppd
.visited
= new hash_set
<tree
>;
3581 cp_walk_tree (&t
, &find_parameter_packs_r
, &ppd
, ppd
.visited
);
3583 return parameter_packs
!= NULL_TREE
;
3586 /* Turn ARG, which may be an expression, type, or a TREE_LIST
3587 representation a base-class initializer into a parameter pack
3588 expansion. If all goes well, the resulting node will be an
3589 EXPR_PACK_EXPANSION, TYPE_PACK_EXPANSION, or TREE_LIST,
3592 make_pack_expansion (tree arg
)
3595 tree parameter_packs
= NULL_TREE
;
3596 bool for_types
= false;
3597 struct find_parameter_pack_data ppd
;
3599 if (!arg
|| arg
== error_mark_node
)
3602 if (TREE_CODE (arg
) == TREE_LIST
&& TREE_PURPOSE (arg
))
3604 /* A TREE_LIST with a non-null TREE_PURPOSE is for a base
3605 class initializer. In this case, the TREE_PURPOSE will be a
3606 _TYPE node (representing the base class expansion we're
3607 initializing) and the TREE_VALUE will be a TREE_LIST
3608 containing the initialization arguments.
3610 The resulting expansion looks somewhat different from most
3611 expansions. Rather than returning just one _EXPANSION, we
3612 return a TREE_LIST whose TREE_PURPOSE is a
3613 TYPE_PACK_EXPANSION containing the bases that will be
3614 initialized. The TREE_VALUE will be identical to the
3615 original TREE_VALUE, which is a list of arguments that will
3616 be passed to each base. We do not introduce any new pack
3617 expansion nodes into the TREE_VALUE (although it is possible
3618 that some already exist), because the TREE_PURPOSE and
3619 TREE_VALUE all need to be expanded together with the same
3620 _EXPANSION node. Note that the TYPE_PACK_EXPANSION in the
3621 resulting TREE_PURPOSE will mention the parameter packs in
3622 both the bases and the arguments to the bases. */
3625 tree parameter_packs
= NULL_TREE
;
3627 /* Determine which parameter packs will be used by the base
3629 ppd
.visited
= new hash_set
<tree
>;
3630 ppd
.parameter_packs
= ¶meter_packs
;
3631 cp_walk_tree (&TREE_PURPOSE (arg
), &find_parameter_packs_r
,
3634 if (parameter_packs
== NULL_TREE
)
3636 error ("base initializer expansion %<%T%> contains no parameter packs", arg
);
3638 return error_mark_node
;
3641 if (TREE_VALUE (arg
) != void_type_node
)
3643 /* Collect the sets of parameter packs used in each of the
3644 initialization arguments. */
3645 for (value
= TREE_VALUE (arg
); value
; value
= TREE_CHAIN (value
))
3647 /* Determine which parameter packs will be expanded in this
3649 cp_walk_tree (&TREE_VALUE (value
), &find_parameter_packs_r
,
3656 /* Create the pack expansion type for the base type. */
3657 purpose
= cxx_make_type (TYPE_PACK_EXPANSION
);
3658 SET_PACK_EXPANSION_PATTERN (purpose
, TREE_PURPOSE (arg
));
3659 PACK_EXPANSION_PARAMETER_PACKS (purpose
) = parameter_packs
;
3661 /* Just use structural equality for these TYPE_PACK_EXPANSIONS;
3662 they will rarely be compared to anything. */
3663 SET_TYPE_STRUCTURAL_EQUALITY (purpose
);
3665 return tree_cons (purpose
, TREE_VALUE (arg
), NULL_TREE
);
3668 if (TYPE_P (arg
) || TREE_CODE (arg
) == TEMPLATE_DECL
)
3671 /* Build the PACK_EXPANSION_* node. */
3673 ? cxx_make_type (TYPE_PACK_EXPANSION
)
3674 : make_node (EXPR_PACK_EXPANSION
);
3675 SET_PACK_EXPANSION_PATTERN (result
, arg
);
3676 if (TREE_CODE (result
) == EXPR_PACK_EXPANSION
)
3678 /* Propagate type and const-expression information. */
3679 TREE_TYPE (result
) = TREE_TYPE (arg
);
3680 TREE_CONSTANT (result
) = TREE_CONSTANT (arg
);
3683 /* Just use structural equality for these TYPE_PACK_EXPANSIONS;
3684 they will rarely be compared to anything. */
3685 SET_TYPE_STRUCTURAL_EQUALITY (result
);
3687 /* Determine which parameter packs will be expanded. */
3688 ppd
.parameter_packs
= ¶meter_packs
;
3689 ppd
.visited
= new hash_set
<tree
>;
3690 cp_walk_tree (&arg
, &find_parameter_packs_r
, &ppd
, ppd
.visited
);
3693 /* Make sure we found some parameter packs. */
3694 if (parameter_packs
== NULL_TREE
)
3697 error ("expansion pattern %<%T%> contains no argument packs", arg
);
3699 error ("expansion pattern %<%E%> contains no argument packs", arg
);
3700 return error_mark_node
;
3702 PACK_EXPANSION_PARAMETER_PACKS (result
) = parameter_packs
;
3704 PACK_EXPANSION_LOCAL_P (result
) = at_function_scope_p ();
3709 /* Checks T for any "bare" parameter packs, which have not yet been
3710 expanded, and issues an error if any are found. This operation can
3711 only be done on full expressions or types (e.g., an expression
3712 statement, "if" condition, etc.), because we could have expressions like:
3714 foo(f(g(h(args)))...)
3716 where "args" is a parameter pack. check_for_bare_parameter_packs
3717 should not be called for the subexpressions args, h(args),
3718 g(h(args)), or f(g(h(args))), because we would produce erroneous
3721 Returns TRUE and emits an error if there were bare parameter packs,
3722 returns FALSE otherwise. */
3724 check_for_bare_parameter_packs (tree t
)
3726 tree parameter_packs
= NULL_TREE
;
3727 struct find_parameter_pack_data ppd
;
3729 if (!processing_template_decl
|| !t
|| t
== error_mark_node
)
3732 if (TREE_CODE (t
) == TYPE_DECL
)
3735 ppd
.parameter_packs
= ¶meter_packs
;
3736 ppd
.visited
= new hash_set
<tree
>;
3737 cp_walk_tree (&t
, &find_parameter_packs_r
, &ppd
, ppd
.visited
);
3740 if (parameter_packs
)
3742 error ("parameter packs not expanded with %<...%>:");
3743 while (parameter_packs
)
3745 tree pack
= TREE_VALUE (parameter_packs
);
3746 tree name
= NULL_TREE
;
3748 if (TREE_CODE (pack
) == TEMPLATE_TYPE_PARM
3749 || TREE_CODE (pack
) == TEMPLATE_TEMPLATE_PARM
)
3750 name
= TYPE_NAME (pack
);
3751 else if (TREE_CODE (pack
) == TEMPLATE_PARM_INDEX
)
3752 name
= DECL_NAME (TEMPLATE_PARM_DECL (pack
));
3754 name
= DECL_NAME (pack
);
3757 inform (input_location
, " %qD", name
);
3759 inform (input_location
, " <anonymous>");
3761 parameter_packs
= TREE_CHAIN (parameter_packs
);
3770 /* Expand any parameter packs that occur in the template arguments in
3773 expand_template_argument_pack (tree args
)
3775 tree result_args
= NULL_TREE
;
3776 int in_arg
, out_arg
= 0, nargs
= args
? TREE_VEC_LENGTH (args
) : 0;
3777 int num_result_args
= -1;
3778 int non_default_args_count
= -1;
3780 /* First, determine if we need to expand anything, and the number of
3781 slots we'll need. */
3782 for (in_arg
= 0; in_arg
< nargs
; ++in_arg
)
3784 tree arg
= TREE_VEC_ELT (args
, in_arg
);
3785 if (arg
== NULL_TREE
)
3787 if (ARGUMENT_PACK_P (arg
))
3789 int num_packed
= TREE_VEC_LENGTH (ARGUMENT_PACK_ARGS (arg
));
3790 if (num_result_args
< 0)
3791 num_result_args
= in_arg
+ num_packed
;
3793 num_result_args
+= num_packed
;
3797 if (num_result_args
>= 0)
3802 /* If no expansion is necessary, we're done. */
3803 if (num_result_args
< 0)
3806 /* Expand arguments. */
3807 result_args
= make_tree_vec (num_result_args
);
3808 if (NON_DEFAULT_TEMPLATE_ARGS_COUNT (args
))
3809 non_default_args_count
=
3810 GET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (args
);
3811 for (in_arg
= 0; in_arg
< nargs
; ++in_arg
)
3813 tree arg
= TREE_VEC_ELT (args
, in_arg
);
3814 if (ARGUMENT_PACK_P (arg
))
3816 tree packed
= ARGUMENT_PACK_ARGS (arg
);
3817 int i
, num_packed
= TREE_VEC_LENGTH (packed
);
3818 for (i
= 0; i
< num_packed
; ++i
, ++out_arg
)
3819 TREE_VEC_ELT (result_args
, out_arg
) = TREE_VEC_ELT(packed
, i
);
3820 if (non_default_args_count
> 0)
3821 non_default_args_count
+= num_packed
- 1;
3825 TREE_VEC_ELT (result_args
, out_arg
) = arg
;
3829 if (non_default_args_count
>= 0)
3830 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (result_args
, non_default_args_count
);
3834 /* Checks if DECL shadows a template parameter.
3836 [temp.local]: A template-parameter shall not be redeclared within its
3837 scope (including nested scopes).
3839 Emits an error and returns TRUE if the DECL shadows a parameter,
3840 returns FALSE otherwise. */
3843 check_template_shadow (tree decl
)
3847 /* If we're not in a template, we can't possibly shadow a template
3849 if (!current_template_parms
)
3852 /* Figure out what we're shadowing. */
3853 if (TREE_CODE (decl
) == OVERLOAD
)
3854 decl
= OVL_CURRENT (decl
);
3855 olddecl
= innermost_non_namespace_value (DECL_NAME (decl
));
3857 /* If there's no previous binding for this name, we're not shadowing
3858 anything, let alone a template parameter. */
3862 /* If we're not shadowing a template parameter, we're done. Note
3863 that OLDDECL might be an OVERLOAD (or perhaps even an
3864 ERROR_MARK), so we can't just blithely assume it to be a _DECL
3866 if (!DECL_P (olddecl
) || !DECL_TEMPLATE_PARM_P (olddecl
))
3869 /* We check for decl != olddecl to avoid bogus errors for using a
3870 name inside a class. We check TPFI to avoid duplicate errors for
3871 inline member templates. */
3873 || (DECL_TEMPLATE_PARM_P (decl
)
3874 && TEMPLATE_PARMS_FOR_INLINE (current_template_parms
)))
3877 /* Don't complain about the injected class name, as we've already
3878 complained about the class itself. */
3879 if (DECL_SELF_REFERENCE_P (decl
))
3882 if (DECL_TEMPLATE_PARM_P (decl
))
3883 error ("declaration of template parameter %q+D shadows "
3884 "template parameter", decl
);
3886 error ("declaration of %q+#D shadows template parameter", decl
);
3887 inform (DECL_SOURCE_LOCATION (olddecl
),
3888 "template parameter %qD declared here", olddecl
);
3892 /* Return a new TEMPLATE_PARM_INDEX with the indicated INDEX, LEVEL,
3893 ORIG_LEVEL, DECL, and TYPE. */
3896 build_template_parm_index (int index
,
3902 tree t
= make_node (TEMPLATE_PARM_INDEX
);
3903 TEMPLATE_PARM_IDX (t
) = index
;
3904 TEMPLATE_PARM_LEVEL (t
) = level
;
3905 TEMPLATE_PARM_ORIG_LEVEL (t
) = orig_level
;
3906 TEMPLATE_PARM_DECL (t
) = decl
;
3907 TREE_TYPE (t
) = type
;
3908 TREE_CONSTANT (t
) = TREE_CONSTANT (decl
);
3909 TREE_READONLY (t
) = TREE_READONLY (decl
);
3914 /* Find the canonical type parameter for the given template type
3915 parameter. Returns the canonical type parameter, which may be TYPE
3916 if no such parameter existed. */
3919 canonical_type_parameter (tree type
)
3922 int idx
= TEMPLATE_TYPE_IDX (type
);
3923 if (!canonical_template_parms
)
3924 vec_alloc (canonical_template_parms
, idx
+1);
3926 while (canonical_template_parms
->length () <= (unsigned)idx
)
3927 vec_safe_push (canonical_template_parms
, NULL_TREE
);
3929 list
= (*canonical_template_parms
)[idx
];
3930 while (list
&& !comptypes (type
, TREE_VALUE (list
), COMPARE_STRUCTURAL
))
3931 list
= TREE_CHAIN (list
);
3934 return TREE_VALUE (list
);
3937 (*canonical_template_parms
)[idx
]
3938 = tree_cons (NULL_TREE
, type
,
3939 (*canonical_template_parms
)[idx
]);
3944 /* Return a TEMPLATE_PARM_INDEX, similar to INDEX, but whose
3945 TEMPLATE_PARM_LEVEL has been decreased by LEVELS. If such a
3946 TEMPLATE_PARM_INDEX already exists, it is returned; otherwise, a
3947 new one is created. */
3950 reduce_template_parm_level (tree index
, tree type
, int levels
, tree args
,
3951 tsubst_flags_t complain
)
3953 if (TEMPLATE_PARM_DESCENDANTS (index
) == NULL_TREE
3954 || (TEMPLATE_PARM_LEVEL (TEMPLATE_PARM_DESCENDANTS (index
))
3955 != TEMPLATE_PARM_LEVEL (index
) - levels
)
3956 || !same_type_p (type
, TREE_TYPE (TEMPLATE_PARM_DESCENDANTS (index
))))
3958 tree orig_decl
= TEMPLATE_PARM_DECL (index
);
3961 decl
= build_decl (DECL_SOURCE_LOCATION (orig_decl
),
3962 TREE_CODE (orig_decl
), DECL_NAME (orig_decl
), type
);
3963 TREE_CONSTANT (decl
) = TREE_CONSTANT (orig_decl
);
3964 TREE_READONLY (decl
) = TREE_READONLY (orig_decl
);
3965 DECL_ARTIFICIAL (decl
) = 1;
3966 SET_DECL_TEMPLATE_PARM_P (decl
);
3968 t
= build_template_parm_index (TEMPLATE_PARM_IDX (index
),
3969 TEMPLATE_PARM_LEVEL (index
) - levels
,
3970 TEMPLATE_PARM_ORIG_LEVEL (index
),
3972 TEMPLATE_PARM_DESCENDANTS (index
) = t
;
3973 TEMPLATE_PARM_PARAMETER_PACK (t
)
3974 = TEMPLATE_PARM_PARAMETER_PACK (index
);
3976 /* Template template parameters need this. */
3977 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
3979 DECL_TEMPLATE_RESULT (decl
)
3980 = build_decl (DECL_SOURCE_LOCATION (decl
),
3981 TYPE_DECL
, DECL_NAME (decl
), type
);
3982 DECL_ARTIFICIAL (DECL_TEMPLATE_RESULT (decl
)) = true;
3983 DECL_TEMPLATE_PARMS (decl
) = tsubst_template_parms
3984 (DECL_TEMPLATE_PARMS (orig_decl
), args
, complain
);
3988 return TEMPLATE_PARM_DESCENDANTS (index
);
3991 /* Process information from new template parameter PARM and append it
3992 to the LIST being built. This new parameter is a non-type
3993 parameter iff IS_NON_TYPE is true. This new parameter is a
3994 parameter pack iff IS_PARAMETER_PACK is true. The location of PARM
3998 process_template_parm (tree list
, location_t parm_loc
, tree parm
,
3999 bool is_non_type
, bool is_parameter_pack
)
4004 gcc_assert (TREE_CODE (parm
) == TREE_LIST
);
4005 tree defval
= TREE_PURPOSE (parm
);
4006 tree constr
= TREE_TYPE (parm
);
4010 tree p
= tree_last (list
);
4012 if (p
&& TREE_VALUE (p
) != error_mark_node
)
4015 if (TREE_CODE (p
) == TYPE_DECL
|| TREE_CODE (p
) == TEMPLATE_DECL
)
4016 idx
= TEMPLATE_TYPE_IDX (TREE_TYPE (p
));
4018 idx
= TEMPLATE_PARM_IDX (DECL_INITIAL (p
));
4026 parm
= TREE_VALUE (parm
);
4028 SET_DECL_TEMPLATE_PARM_P (parm
);
4030 if (TREE_TYPE (parm
) != error_mark_node
)
4034 The top-level cv-qualifiers on the template-parameter are
4035 ignored when determining its type. */
4036 TREE_TYPE (parm
) = TYPE_MAIN_VARIANT (TREE_TYPE (parm
));
4037 if (invalid_nontype_parm_type_p (TREE_TYPE (parm
), 1))
4038 TREE_TYPE (parm
) = error_mark_node
;
4039 else if (uses_parameter_packs (TREE_TYPE (parm
))
4040 && !is_parameter_pack
4041 /* If we're in a nested template parameter list, the template
4042 template parameter could be a parameter pack. */
4043 && processing_template_parmlist
== 1)
4045 /* This template parameter is not a parameter pack, but it
4046 should be. Complain about "bare" parameter packs. */
4047 check_for_bare_parameter_packs (TREE_TYPE (parm
));
4049 /* Recover by calling this a parameter pack. */
4050 is_parameter_pack
= true;
4054 /* A template parameter is not modifiable. */
4055 TREE_CONSTANT (parm
) = 1;
4056 TREE_READONLY (parm
) = 1;
4057 decl
= build_decl (parm_loc
,
4058 CONST_DECL
, DECL_NAME (parm
), TREE_TYPE (parm
));
4059 TREE_CONSTANT (decl
) = 1;
4060 TREE_READONLY (decl
) = 1;
4061 DECL_INITIAL (parm
) = DECL_INITIAL (decl
)
4062 = build_template_parm_index (idx
, processing_template_decl
,
4063 processing_template_decl
,
4064 decl
, TREE_TYPE (parm
));
4066 TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm
))
4067 = is_parameter_pack
;
4072 parm
= TREE_VALUE (TREE_VALUE (parm
));
4074 if (parm
&& TREE_CODE (parm
) == TEMPLATE_DECL
)
4076 t
= cxx_make_type (TEMPLATE_TEMPLATE_PARM
);
4077 /* This is for distinguishing between real templates and template
4078 template parameters */
4079 TREE_TYPE (parm
) = t
;
4080 TREE_TYPE (DECL_TEMPLATE_RESULT (parm
)) = t
;
4085 t
= cxx_make_type (TEMPLATE_TYPE_PARM
);
4086 /* parm is either IDENTIFIER_NODE or NULL_TREE. */
4087 decl
= build_decl (parm_loc
,
4088 TYPE_DECL
, parm
, t
);
4091 TYPE_NAME (t
) = decl
;
4092 TYPE_STUB_DECL (t
) = decl
;
4094 TEMPLATE_TYPE_PARM_INDEX (t
)
4095 = build_template_parm_index (idx
, processing_template_decl
,
4096 processing_template_decl
,
4097 decl
, TREE_TYPE (parm
));
4098 TEMPLATE_TYPE_PARAMETER_PACK (t
) = is_parameter_pack
;
4099 TYPE_CANONICAL (t
) = canonical_type_parameter (t
);
4101 DECL_ARTIFICIAL (decl
) = 1;
4102 SET_DECL_TEMPLATE_PARM_P (decl
);
4104 /* Build requirements for the type/template parameter.
4105 This must be done after SET_DECL_TEMPLATE_PARM_P or
4106 process_template_parm could fail. */
4107 tree reqs
= finish_shorthand_constraint (parm
, constr
);
4111 /* Build the parameter node linking the parameter declaration,
4112 its default argument (if any), and its constraints (if any). */
4113 parm
= build_tree_list (defval
, parm
);
4114 TEMPLATE_PARM_CONSTRAINTS (parm
) = reqs
;
4116 return chainon (list
, parm
);
4119 /* The end of a template parameter list has been reached. Process the
4120 tree list into a parameter vector, converting each parameter into a more
4121 useful form. Type parameters are saved as IDENTIFIER_NODEs, and others
4125 end_template_parm_list (tree parms
)
4129 tree saved_parmlist
= make_tree_vec (list_length (parms
));
4131 /* Pop the dummy parameter level and add the real one. */
4132 current_template_parms
= TREE_CHAIN (current_template_parms
);
4134 current_template_parms
4135 = tree_cons (size_int (processing_template_decl
),
4136 saved_parmlist
, current_template_parms
);
4138 for (parm
= parms
, nparms
= 0; parm
; parm
= next
, nparms
++)
4140 next
= TREE_CHAIN (parm
);
4141 TREE_VEC_ELT (saved_parmlist
, nparms
) = parm
;
4142 TREE_CHAIN (parm
) = NULL_TREE
;
4145 --processing_template_parmlist
;
4147 return saved_parmlist
;
4150 // Explicitly indicate the end of the template parameter list. We assume
4151 // that the current template parameters have been constructed and/or
4152 // managed explicitly, as when creating new template template parameters
4153 // from a shorthand constraint.
4155 end_template_parm_list ()
4157 --processing_template_parmlist
;
4160 /* end_template_decl is called after a template declaration is seen. */
4163 end_template_decl (void)
4165 reset_specialization ();
4167 if (! processing_template_decl
)
4170 /* This matches the pushlevel in begin_template_parm_list. */
4173 --processing_template_decl
;
4174 current_template_parms
= TREE_CHAIN (current_template_parms
);
4177 /* Takes a TREE_LIST representing a template parameter and convert it
4178 into an argument suitable to be passed to the type substitution
4179 functions. Note that If the TREE_LIST contains an error_mark
4180 node, the returned argument is error_mark_node. */
4183 template_parm_to_arg (tree t
)
4187 || TREE_CODE (t
) != TREE_LIST
)
4190 if (error_operand_p (TREE_VALUE (t
)))
4191 return error_mark_node
;
4195 if (TREE_CODE (t
) == TYPE_DECL
4196 || TREE_CODE (t
) == TEMPLATE_DECL
)
4200 if (TEMPLATE_TYPE_PARAMETER_PACK (t
))
4202 /* Turn this argument into a TYPE_ARGUMENT_PACK
4203 with a single element, which expands T. */
4204 tree vec
= make_tree_vec (1);
4205 #ifdef ENABLE_CHECKING
4206 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT
4207 (vec
, TREE_VEC_LENGTH (vec
));
4209 TREE_VEC_ELT (vec
, 0) = make_pack_expansion (t
);
4211 t
= cxx_make_type (TYPE_ARGUMENT_PACK
);
4212 SET_ARGUMENT_PACK_ARGS (t
, vec
);
4217 t
= DECL_INITIAL (t
);
4219 if (TEMPLATE_PARM_PARAMETER_PACK (t
))
4221 /* Turn this argument into a NONTYPE_ARGUMENT_PACK
4222 with a single element, which expands T. */
4223 tree vec
= make_tree_vec (1);
4224 tree type
= TREE_TYPE (TEMPLATE_PARM_DECL (t
));
4225 #ifdef ENABLE_CHECKING
4226 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT
4227 (vec
, TREE_VEC_LENGTH (vec
));
4229 t
= convert_from_reference (t
);
4230 TREE_VEC_ELT (vec
, 0) = make_pack_expansion (t
);
4232 t
= make_node (NONTYPE_ARGUMENT_PACK
);
4233 SET_ARGUMENT_PACK_ARGS (t
, vec
);
4234 TREE_TYPE (t
) = type
;
4237 t
= convert_from_reference (t
);
4242 /* Given a set of template parameters, return them as a set of template
4243 arguments. The template parameters are represented as a TREE_VEC, in
4244 the form documented in cp-tree.h for template arguments. */
4247 template_parms_to_args (tree parms
)
4250 tree args
= NULL_TREE
;
4251 int length
= TMPL_PARMS_DEPTH (parms
);
4254 /* If there is only one level of template parameters, we do not
4255 create a TREE_VEC of TREE_VECs. Instead, we return a single
4256 TREE_VEC containing the arguments. */
4258 args
= make_tree_vec (length
);
4260 for (header
= parms
; header
; header
= TREE_CHAIN (header
))
4262 tree a
= copy_node (TREE_VALUE (header
));
4265 TREE_TYPE (a
) = NULL_TREE
;
4266 for (i
= TREE_VEC_LENGTH (a
) - 1; i
>= 0; --i
)
4267 TREE_VEC_ELT (a
, i
) = template_parm_to_arg (TREE_VEC_ELT (a
, i
));
4269 #ifdef ENABLE_CHECKING
4270 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (a
, TREE_VEC_LENGTH (a
));
4274 TREE_VEC_ELT (args
, --l
) = a
;
4282 /* Within the declaration of a template, return the currently active
4283 template parameters as an argument TREE_VEC. */
4286 current_template_args (void)
4288 return template_parms_to_args (current_template_parms
);
4291 /* Update the declared TYPE by doing any lookups which were thought to be
4292 dependent, but are not now that we know the SCOPE of the declarator. */
4295 maybe_update_decl_type (tree orig_type
, tree scope
)
4297 tree type
= orig_type
;
4299 if (type
== NULL_TREE
)
4302 if (TREE_CODE (orig_type
) == TYPE_DECL
)
4303 type
= TREE_TYPE (type
);
4305 if (scope
&& TYPE_P (scope
) && dependent_type_p (scope
)
4306 && dependent_type_p (type
)
4307 /* Don't bother building up the args in this case. */
4308 && TREE_CODE (type
) != TEMPLATE_TYPE_PARM
)
4310 /* tsubst in the args corresponding to the template parameters,
4311 including auto if present. Most things will be unchanged, but
4312 make_typename_type and tsubst_qualified_id will resolve
4313 TYPENAME_TYPEs and SCOPE_REFs that were previously dependent. */
4314 tree args
= current_template_args ();
4315 tree auto_node
= type_uses_auto (type
);
4319 tree auto_vec
= make_tree_vec (1);
4320 TREE_VEC_ELT (auto_vec
, 0) = auto_node
;
4321 args
= add_to_template_args (args
, auto_vec
);
4323 pushed
= push_scope (scope
);
4324 type
= tsubst (type
, args
, tf_warning_or_error
, NULL_TREE
);
4329 if (type
== error_mark_node
)
4332 if (TREE_CODE (orig_type
) == TYPE_DECL
)
4334 if (same_type_p (type
, TREE_TYPE (orig_type
)))
4337 type
= TYPE_NAME (type
);
4342 /* Return a TEMPLATE_DECL corresponding to DECL, using the indicated
4343 template PARMS and constraints, CONSTR. If MEMBER_TEMPLATE_P is true,
4344 the new template is a member template. */
4347 build_template_decl (tree decl
, tree parms
, bool member_template_p
)
4349 tree tmpl
= build_lang_decl (TEMPLATE_DECL
, DECL_NAME (decl
), NULL_TREE
);
4350 DECL_TEMPLATE_PARMS (tmpl
) = parms
;
4351 DECL_CONTEXT (tmpl
) = DECL_CONTEXT (decl
);
4352 DECL_SOURCE_LOCATION (tmpl
) = DECL_SOURCE_LOCATION (decl
);
4353 DECL_MEMBER_TEMPLATE_P (tmpl
) = member_template_p
;
4358 struct template_parm_data
4360 /* The level of the template parameters we are currently
4364 /* The index of the specialization argument we are currently
4368 /* An array whose size is the number of template parameters. The
4369 elements are nonzero if the parameter has been used in any one
4370 of the arguments processed so far. */
4373 /* An array whose size is the number of template arguments. The
4374 elements are nonzero if the argument makes use of template
4375 parameters of this level. */
4376 int* arg_uses_template_parms
;
4379 /* Subroutine of push_template_decl used to see if each template
4380 parameter in a partial specialization is used in the explicit
4381 argument list. If T is of the LEVEL given in DATA (which is
4382 treated as a template_parm_data*), then DATA->PARMS is marked
4386 mark_template_parm (tree t
, void* data
)
4390 struct template_parm_data
* tpd
= (struct template_parm_data
*) data
;
4392 template_parm_level_and_index (t
, &level
, &idx
);
4394 if (level
== tpd
->level
)
4396 tpd
->parms
[idx
] = 1;
4397 tpd
->arg_uses_template_parms
[tpd
->current_arg
] = 1;
4400 /* Return zero so that for_each_template_parm will continue the
4401 traversal of the tree; we want to mark *every* template parm. */
4405 /* Process the partial specialization DECL. */
4408 process_partial_specialization (tree decl
)
4410 tree type
= TREE_TYPE (decl
);
4411 tree tinfo
= get_template_info (decl
);
4412 tree maintmpl
= TI_TEMPLATE (tinfo
);
4413 tree specargs
= TI_ARGS (tinfo
);
4414 tree inner_args
= INNERMOST_TEMPLATE_ARGS (specargs
);
4415 tree main_inner_parms
= DECL_INNERMOST_TEMPLATE_PARMS (maintmpl
);
4418 int nargs
= TREE_VEC_LENGTH (inner_args
);
4421 bool did_error_intro
= false;
4422 struct template_parm_data tpd
;
4423 struct template_parm_data tpd2
;
4425 gcc_assert (current_template_parms
);
4427 /* A concept cannot be specialized. */
4428 if (flag_concepts
&& variable_concept_p (maintmpl
))
4430 error ("specialization of variable concept %q#D", maintmpl
);
4431 return error_mark_node
;
4434 inner_parms
= INNERMOST_TEMPLATE_PARMS (current_template_parms
);
4435 ntparms
= TREE_VEC_LENGTH (inner_parms
);
4437 /* We check that each of the template parameters given in the
4438 partial specialization is used in the argument list to the
4439 specialization. For example:
4441 template <class T> struct S;
4442 template <class T> struct S<T*>;
4444 The second declaration is OK because `T*' uses the template
4445 parameter T, whereas
4447 template <class T> struct S<int>;
4449 is no good. Even trickier is:
4460 The S2<T> declaration is actually invalid; it is a
4461 full-specialization. Of course,
4464 struct S2<T (*)(U)>;
4466 or some such would have been OK. */
4467 tpd
.level
= TMPL_PARMS_DEPTH (current_template_parms
);
4468 tpd
.parms
= XALLOCAVEC (int, ntparms
);
4469 memset (tpd
.parms
, 0, sizeof (int) * ntparms
);
4471 tpd
.arg_uses_template_parms
= XALLOCAVEC (int, nargs
);
4472 memset (tpd
.arg_uses_template_parms
, 0, sizeof (int) * nargs
);
4473 for (i
= 0; i
< nargs
; ++i
)
4475 tpd
.current_arg
= i
;
4476 for_each_template_parm (TREE_VEC_ELT (inner_args
, i
),
4477 &mark_template_parm
,
4480 /*include_nondeduced_p=*/false);
4482 for (i
= 0; i
< ntparms
; ++i
)
4483 if (tpd
.parms
[i
] == 0)
4485 /* One of the template parms was not used in a deduced context in the
4487 if (!did_error_intro
)
4489 error ("template parameters not deducible in "
4490 "partial specialization:");
4491 did_error_intro
= true;
4494 inform (input_location
, " %qD",
4495 TREE_VALUE (TREE_VEC_ELT (inner_parms
, i
)));
4498 if (did_error_intro
)
4499 return error_mark_node
;
4501 /* [temp.class.spec]
4503 The argument list of the specialization shall not be identical to
4504 the implicit argument list of the primary template. */
4506 = TI_ARGS (get_template_info (DECL_TEMPLATE_RESULT (maintmpl
)));
4507 if (comp_template_args (inner_args
, INNERMOST_TEMPLATE_ARGS (main_args
))
4509 || !subsumes_constraints (current_template_constraints (),
4510 get_constraints (maintmpl
))))
4513 error ("partial specialization %q+D does not specialize "
4514 "any template arguments", decl
);
4516 error ("partial specialization %q+D does not specialize any "
4517 "template arguments and is not more constrained than", decl
);
4518 inform (DECL_SOURCE_LOCATION (maintmpl
), "primary template here");
4521 /* A partial specialization that replaces multiple parameters of the
4522 primary template with a pack expansion is less specialized for those
4524 if (nargs
< DECL_NTPARMS (maintmpl
))
4526 error ("partial specialization is not more specialized than the "
4527 "primary template because it replaces multiple parameters "
4528 "with a pack expansion");
4529 inform (DECL_SOURCE_LOCATION (maintmpl
), "primary template here");
4533 /* [temp.class.spec]
4535 A partially specialized non-type argument expression shall not
4536 involve template parameters of the partial specialization except
4537 when the argument expression is a simple identifier.
4539 The type of a template parameter corresponding to a specialized
4540 non-type argument shall not be dependent on a parameter of the
4543 Also, we verify that pack expansions only occur at the
4544 end of the argument list. */
4545 gcc_assert (nargs
== DECL_NTPARMS (maintmpl
));
4547 for (i
= 0; i
< nargs
; ++i
)
4549 tree parm
= TREE_VALUE (TREE_VEC_ELT (main_inner_parms
, i
));
4550 tree arg
= TREE_VEC_ELT (inner_args
, i
);
4551 tree packed_args
= NULL_TREE
;
4554 if (ARGUMENT_PACK_P (arg
))
4556 /* Extract the arguments from the argument pack. We'll be
4557 iterating over these in the following loop. */
4558 packed_args
= ARGUMENT_PACK_ARGS (arg
);
4559 len
= TREE_VEC_LENGTH (packed_args
);
4562 for (j
= 0; j
< len
; j
++)
4565 /* Get the Jth argument in the parameter pack. */
4566 arg
= TREE_VEC_ELT (packed_args
, j
);
4568 if (PACK_EXPANSION_P (arg
))
4570 /* Pack expansions must come at the end of the
4572 if ((packed_args
&& j
< len
- 1)
4573 || (!packed_args
&& i
< nargs
- 1))
4575 if (TREE_CODE (arg
) == EXPR_PACK_EXPANSION
)
4576 error ("parameter pack argument %qE must be at the "
4577 "end of the template argument list", arg
);
4579 error ("parameter pack argument %qT must be at the "
4580 "end of the template argument list", arg
);
4584 if (TREE_CODE (arg
) == EXPR_PACK_EXPANSION
)
4585 /* We only care about the pattern. */
4586 arg
= PACK_EXPANSION_PATTERN (arg
);
4588 if (/* These first two lines are the `non-type' bit. */
4590 && TREE_CODE (arg
) != TEMPLATE_DECL
4591 /* This next two lines are the `argument expression is not just a
4592 simple identifier' condition and also the `specialized
4593 non-type argument' bit. */
4594 && TREE_CODE (arg
) != TEMPLATE_PARM_INDEX
4595 && !(REFERENCE_REF_P (arg
)
4596 && TREE_CODE (TREE_OPERAND (arg
, 0)) == TEMPLATE_PARM_INDEX
))
4598 if ((!packed_args
&& tpd
.arg_uses_template_parms
[i
])
4599 || (packed_args
&& uses_template_parms (arg
)))
4600 error ("template argument %qE involves template parameter(s)",
4604 /* Look at the corresponding template parameter,
4605 marking which template parameters its type depends
4607 tree type
= TREE_TYPE (parm
);
4611 /* We haven't yet initialized TPD2. Do so now. */
4612 tpd2
.arg_uses_template_parms
= XALLOCAVEC (int, nargs
);
4613 /* The number of parameters here is the number in the
4614 main template, which, as checked in the assertion
4616 tpd2
.parms
= XALLOCAVEC (int, nargs
);
4618 TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (maintmpl
));
4621 /* Mark the template parameters. But this time, we're
4622 looking for the template parameters of the main
4623 template, not in the specialization. */
4624 tpd2
.current_arg
= i
;
4625 tpd2
.arg_uses_template_parms
[i
] = 0;
4626 memset (tpd2
.parms
, 0, sizeof (int) * nargs
);
4627 for_each_template_parm (type
,
4628 &mark_template_parm
,
4631 /*include_nondeduced_p=*/false);
4633 if (tpd2
.arg_uses_template_parms
[i
])
4635 /* The type depended on some template parameters.
4636 If they are fully specialized in the
4637 specialization, that's OK. */
4640 for (j
= 0; j
< nargs
; ++j
)
4641 if (tpd2
.parms
[j
] != 0
4642 && tpd
.arg_uses_template_parms
[j
])
4645 error_n (input_location
, count
,
4646 "type %qT of template argument %qE depends "
4647 "on a template parameter",
4648 "type %qT of template argument %qE depends "
4649 "on template parameters",
4658 /* We should only get here once. */
4659 if (TREE_CODE (decl
) == TYPE_DECL
)
4660 gcc_assert (!COMPLETE_TYPE_P (type
));
4662 // Build the template decl.
4663 tree tmpl
= build_template_decl (decl
, current_template_parms
,
4664 DECL_MEMBER_TEMPLATE_P (maintmpl
));
4665 TREE_TYPE (tmpl
) = type
;
4666 DECL_TEMPLATE_RESULT (tmpl
) = decl
;
4667 SET_DECL_TEMPLATE_SPECIALIZATION (tmpl
);
4668 DECL_TEMPLATE_INFO (tmpl
) = build_template_info (maintmpl
, specargs
);
4669 DECL_PRIMARY_TEMPLATE (tmpl
) = maintmpl
;
4672 /* We didn't register this in check_explicit_specialization so we could
4673 wait until the constraints were set. */
4674 decl
= register_specialization (decl
, maintmpl
, specargs
, false, 0);
4676 associate_classtype_constraints (type
);
4678 DECL_TEMPLATE_SPECIALIZATIONS (maintmpl
)
4679 = tree_cons (specargs
, tmpl
,
4680 DECL_TEMPLATE_SPECIALIZATIONS (maintmpl
));
4681 TREE_TYPE (DECL_TEMPLATE_SPECIALIZATIONS (maintmpl
)) = type
;
4683 for (inst
= DECL_TEMPLATE_INSTANTIATIONS (maintmpl
); inst
;
4684 inst
= TREE_CHAIN (inst
))
4686 tree instance
= TREE_VALUE (inst
);
4687 if (TYPE_P (instance
)
4688 ? (COMPLETE_TYPE_P (instance
)
4689 && CLASSTYPE_IMPLICIT_INSTANTIATION (instance
))
4690 : DECL_TEMPLATE_INSTANTIATION (instance
))
4692 tree spec
= most_specialized_partial_spec (instance
, tf_none
);
4693 if (spec
&& TREE_VALUE (spec
) == tmpl
)
4695 tree inst_decl
= (DECL_P (instance
)
4696 ? instance
: TYPE_NAME (instance
));
4697 permerror (input_location
,
4698 "partial specialization of %qD after instantiation "
4699 "of %qD", decl
, inst_decl
);
4707 /* PARM is a template parameter of some form; return the corresponding
4708 TEMPLATE_PARM_INDEX. */
4711 get_template_parm_index (tree parm
)
4713 if (TREE_CODE (parm
) == PARM_DECL
4714 || TREE_CODE (parm
) == CONST_DECL
)
4715 parm
= DECL_INITIAL (parm
);
4716 else if (TREE_CODE (parm
) == TYPE_DECL
4717 || TREE_CODE (parm
) == TEMPLATE_DECL
)
4718 parm
= TREE_TYPE (parm
);
4719 if (TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
4720 || TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
4721 || TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
)
4722 parm
= TEMPLATE_TYPE_PARM_INDEX (parm
);
4723 gcc_assert (TREE_CODE (parm
) == TEMPLATE_PARM_INDEX
);
4727 /* Subroutine of fixed_parameter_pack_p below. Look for any template
4728 parameter packs used by the template parameter PARM. */
4731 fixed_parameter_pack_p_1 (tree parm
, struct find_parameter_pack_data
*ppd
)
4733 /* A type parm can't refer to another parm. */
4734 if (TREE_CODE (parm
) == TYPE_DECL
)
4736 else if (TREE_CODE (parm
) == PARM_DECL
)
4738 cp_walk_tree (&TREE_TYPE (parm
), &find_parameter_packs_r
,
4743 gcc_assert (TREE_CODE (parm
) == TEMPLATE_DECL
);
4745 tree vec
= INNERMOST_TEMPLATE_PARMS (DECL_TEMPLATE_PARMS (parm
));
4746 for (int i
= 0; i
< TREE_VEC_LENGTH (vec
); ++i
)
4747 fixed_parameter_pack_p_1 (TREE_VALUE (TREE_VEC_ELT (vec
, i
)), ppd
);
4750 /* PARM is a template parameter pack. Return any parameter packs used in
4751 its type or the type of any of its template parameters. If there are
4752 any such packs, it will be instantiated into a fixed template parameter
4753 list by partial instantiation rather than be fully deduced. */
4756 fixed_parameter_pack_p (tree parm
)
4758 /* This can only be true in a member template. */
4759 if (TEMPLATE_PARM_ORIG_LEVEL (get_template_parm_index (parm
)) < 2)
4761 /* This can only be true for a parameter pack. */
4762 if (!template_parameter_pack_p (parm
))
4764 /* A type parm can't refer to another parm. */
4765 if (TREE_CODE (parm
) == TYPE_DECL
)
4768 tree parameter_packs
= NULL_TREE
;
4769 struct find_parameter_pack_data ppd
;
4770 ppd
.parameter_packs
= ¶meter_packs
;
4771 ppd
.visited
= new hash_set
<tree
>;
4773 fixed_parameter_pack_p_1 (parm
, &ppd
);
4776 return parameter_packs
;
4779 /* Check that a template declaration's use of default arguments and
4780 parameter packs is not invalid. Here, PARMS are the template
4781 parameters. IS_PRIMARY is true if DECL is the thing declared by
4782 a primary template. IS_PARTIAL is true if DECL is a partial
4785 IS_FRIEND_DECL is nonzero if DECL is a friend function template
4786 declaration (but not a definition); 1 indicates a declaration, 2
4787 indicates a redeclaration. When IS_FRIEND_DECL=2, no errors are
4788 emitted for extraneous default arguments.
4790 Returns TRUE if there were no errors found, FALSE otherwise. */
4793 check_default_tmpl_args (tree decl
, tree parms
, bool is_primary
,
4794 bool is_partial
, int is_friend_decl
)
4797 int last_level_to_check
;
4799 bool no_errors
= true;
4803 A default template-argument shall not be specified in a
4804 function template declaration or a function template definition, nor
4805 in the template-parameter-list of the definition of a member of a
4808 if (TREE_CODE (CP_DECL_CONTEXT (decl
)) == FUNCTION_DECL
4809 || (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_LOCAL_FUNCTION_P (decl
)))
4810 /* You can't have a function template declaration in a local
4811 scope, nor you can you define a member of a class template in a
4815 if ((TREE_CODE (decl
) == TYPE_DECL
4817 && LAMBDA_TYPE_P (TREE_TYPE (decl
)))
4818 || (TREE_CODE (decl
) == FUNCTION_DECL
4819 && LAMBDA_FUNCTION_P (decl
)))
4820 /* A lambda doesn't have an explicit declaration; don't complain
4821 about the parms of the enclosing class. */
4824 if (current_class_type
4825 && !TYPE_BEING_DEFINED (current_class_type
)
4826 && DECL_LANG_SPECIFIC (decl
)
4827 && DECL_DECLARES_FUNCTION_P (decl
)
4828 /* If this is either a friend defined in the scope of the class
4829 or a member function. */
4830 && (DECL_FUNCTION_MEMBER_P (decl
)
4831 ? same_type_p (DECL_CONTEXT (decl
), current_class_type
)
4832 : DECL_FRIEND_CONTEXT (decl
)
4833 ? same_type_p (DECL_FRIEND_CONTEXT (decl
), current_class_type
)
4835 /* And, if it was a member function, it really was defined in
4836 the scope of the class. */
4837 && (!DECL_FUNCTION_MEMBER_P (decl
)
4838 || DECL_INITIALIZED_IN_CLASS_P (decl
)))
4839 /* We already checked these parameters when the template was
4840 declared, so there's no need to do it again now. This function
4841 was defined in class scope, but we're processing its body now
4842 that the class is complete. */
4845 /* Core issue 226 (C++0x only): the following only applies to class
4848 && ((cxx_dialect
== cxx98
) || TREE_CODE (decl
) != FUNCTION_DECL
))
4852 If a template-parameter has a default template-argument, all
4853 subsequent template-parameters shall have a default
4854 template-argument supplied. */
4855 for (parm_level
= parms
; parm_level
; parm_level
= TREE_CHAIN (parm_level
))
4857 tree inner_parms
= TREE_VALUE (parm_level
);
4858 int ntparms
= TREE_VEC_LENGTH (inner_parms
);
4859 int seen_def_arg_p
= 0;
4862 for (i
= 0; i
< ntparms
; ++i
)
4864 tree parm
= TREE_VEC_ELT (inner_parms
, i
);
4866 if (parm
== error_mark_node
)
4869 if (TREE_PURPOSE (parm
))
4871 else if (seen_def_arg_p
4872 && !template_parameter_pack_p (TREE_VALUE (parm
)))
4874 error ("no default argument for %qD", TREE_VALUE (parm
));
4875 /* For better subsequent error-recovery, we indicate that
4876 there should have been a default argument. */
4877 TREE_PURPOSE (parm
) = error_mark_node
;
4880 else if (!is_partial
4882 /* Don't complain about an enclosing partial
4884 && parm_level
== parms
4885 && TREE_CODE (decl
) == TYPE_DECL
4887 && template_parameter_pack_p (TREE_VALUE (parm
))
4888 /* A fixed parameter pack will be partially
4889 instantiated into a fixed length list. */
4890 && !fixed_parameter_pack_p (TREE_VALUE (parm
)))
4892 /* A primary class template can only have one
4893 parameter pack, at the end of the template
4896 error ("parameter pack %q+D must be at the end of the"
4897 " template parameter list", TREE_VALUE (parm
));
4899 TREE_VALUE (TREE_VEC_ELT (inner_parms
, i
))
4907 if (((cxx_dialect
== cxx98
) && TREE_CODE (decl
) != TYPE_DECL
)
4911 /* For an ordinary class template, default template arguments are
4912 allowed at the innermost level, e.g.:
4913 template <class T = int>
4915 but, in a partial specialization, they're not allowed even
4916 there, as we have in [temp.class.spec]:
4918 The template parameter list of a specialization shall not
4919 contain default template argument values.
4921 So, for a partial specialization, or for a function template
4922 (in C++98/C++03), we look at all of them. */
4925 /* But, for a primary class template that is not a partial
4926 specialization we look at all template parameters except the
4928 parms
= TREE_CHAIN (parms
);
4930 /* Figure out what error message to issue. */
4931 if (is_friend_decl
== 2)
4932 msg
= G_("default template arguments may not be used in function template "
4933 "friend re-declaration");
4934 else if (is_friend_decl
)
4935 msg
= G_("default template arguments may not be used in function template "
4936 "friend declarations");
4937 else if (TREE_CODE (decl
) == FUNCTION_DECL
&& (cxx_dialect
== cxx98
))
4938 msg
= G_("default template arguments may not be used in function templates "
4939 "without -std=c++11 or -std=gnu++11");
4940 else if (is_partial
)
4941 msg
= G_("default template arguments may not be used in "
4942 "partial specializations");
4943 else if (current_class_type
&& CLASSTYPE_IS_TEMPLATE (current_class_type
))
4944 msg
= G_("default argument for template parameter for class enclosing %qD");
4946 /* Per [temp.param]/9, "A default template-argument shall not be
4947 specified in the template-parameter-lists of the definition of
4948 a member of a class template that appears outside of the member's
4949 class.", thus if we aren't handling a member of a class template
4950 there is no need to examine the parameters. */
4953 if (current_class_type
&& TYPE_BEING_DEFINED (current_class_type
))
4954 /* If we're inside a class definition, there's no need to
4955 examine the parameters to the class itself. On the one
4956 hand, they will be checked when the class is defined, and,
4957 on the other, default arguments are valid in things like:
4958 template <class T = double>
4959 struct S { template <class U> void f(U); };
4960 Here the default argument for `S' has no bearing on the
4961 declaration of `f'. */
4962 last_level_to_check
= template_class_depth (current_class_type
) + 1;
4964 /* Check everything. */
4965 last_level_to_check
= 0;
4967 for (parm_level
= parms
;
4968 parm_level
&& TMPL_PARMS_DEPTH (parm_level
) >= last_level_to_check
;
4969 parm_level
= TREE_CHAIN (parm_level
))
4971 tree inner_parms
= TREE_VALUE (parm_level
);
4975 ntparms
= TREE_VEC_LENGTH (inner_parms
);
4976 for (i
= 0; i
< ntparms
; ++i
)
4978 if (TREE_VEC_ELT (inner_parms
, i
) == error_mark_node
)
4981 if (TREE_PURPOSE (TREE_VEC_ELT (inner_parms
, i
)))
4986 if (is_friend_decl
== 2)
4993 /* Clear out the default argument so that we are not
4995 TREE_PURPOSE (TREE_VEC_ELT (inner_parms
, i
)) = NULL_TREE
;
4999 /* At this point, if we're still interested in issuing messages,
5000 they must apply to classes surrounding the object declared. */
5002 msg
= G_("default argument for template parameter for class "
5009 /* Worker for push_template_decl_real, called via
5010 for_each_template_parm. DATA is really an int, indicating the
5011 level of the parameters we are interested in. If T is a template
5012 parameter of that level, return nonzero. */
5015 template_parm_this_level_p (tree t
, void* data
)
5017 int this_level
= *(int *)data
;
5020 if (TREE_CODE (t
) == TEMPLATE_PARM_INDEX
)
5021 level
= TEMPLATE_PARM_LEVEL (t
);
5023 level
= TEMPLATE_TYPE_LEVEL (t
);
5024 return level
== this_level
;
5027 /* Creates a TEMPLATE_DECL for the indicated DECL using the template
5028 parameters given by current_template_args, or reuses a
5029 previously existing one, if appropriate. Returns the DECL, or an
5030 equivalent one, if it is replaced via a call to duplicate_decls.
5032 If IS_FRIEND is true, DECL is a friend declaration. */
5035 push_template_decl_real (tree decl
, bool is_friend
)
5043 int new_template_p
= 0;
5044 /* True if the template is a member template, in the sense of
5046 bool member_template_p
= false;
5048 if (decl
== error_mark_node
|| !current_template_parms
)
5049 return error_mark_node
;
5051 /* See if this is a partial specialization. */
5052 is_partial
= ((DECL_IMPLICIT_TYPEDEF_P (decl
)
5053 && TREE_CODE (TREE_TYPE (decl
)) != ENUMERAL_TYPE
5054 && CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_TYPE (decl
)))
5056 && DECL_LANG_SPECIFIC (decl
)
5057 && DECL_TEMPLATE_SPECIALIZATION (decl
)
5058 && TINFO_USED_TEMPLATE_ID (DECL_TEMPLATE_INFO (decl
))));
5060 if (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_FRIEND_P (decl
))
5064 /* For a friend, we want the context of the friend function, not
5065 the type of which it is a friend. */
5066 ctx
= CP_DECL_CONTEXT (decl
);
5067 else if (CP_DECL_CONTEXT (decl
)
5068 && TREE_CODE (CP_DECL_CONTEXT (decl
)) != NAMESPACE_DECL
)
5069 /* In the case of a virtual function, we want the class in which
5071 ctx
= CP_DECL_CONTEXT (decl
);
5073 /* Otherwise, if we're currently defining some class, the DECL
5074 is assumed to be a member of the class. */
5075 ctx
= current_scope ();
5077 if (ctx
&& TREE_CODE (ctx
) == NAMESPACE_DECL
)
5080 if (!DECL_CONTEXT (decl
))
5081 DECL_CONTEXT (decl
) = FROB_CONTEXT (current_namespace
);
5083 /* See if this is a primary template. */
5084 if (is_friend
&& ctx
5085 && uses_template_parms_level (ctx
, processing_template_decl
))
5086 /* A friend template that specifies a class context, i.e.
5087 template <typename T> friend void A<T>::f();
5090 else if (TREE_CODE (decl
) == TYPE_DECL
5091 && LAMBDA_TYPE_P (TREE_TYPE (decl
)))
5094 is_primary
= template_parm_scope_p ();
5098 warning (OPT_Wtemplates
, "template %qD declared", decl
);
5100 if (DECL_CLASS_SCOPE_P (decl
))
5101 member_template_p
= true;
5102 if (TREE_CODE (decl
) == TYPE_DECL
5103 && anon_aggrname_p (DECL_NAME (decl
)))
5105 error ("template class without a name");
5106 return error_mark_node
;
5108 else if (TREE_CODE (decl
) == FUNCTION_DECL
)
5110 if (member_template_p
)
5112 if (DECL_OVERRIDE_P (decl
) || DECL_FINAL_P (decl
))
5113 error ("member template %qD may not have virt-specifiers", decl
);
5115 if (DECL_DESTRUCTOR_P (decl
))
5119 A destructor shall not be a member template. */
5120 error ("destructor %qD declared as member template", decl
);
5121 return error_mark_node
;
5123 if (NEW_DELETE_OPNAME_P (DECL_NAME (decl
))
5124 && (!prototype_p (TREE_TYPE (decl
))
5125 || TYPE_ARG_TYPES (TREE_TYPE (decl
)) == void_list_node
5126 || !TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (decl
)))
5127 || (TREE_CHAIN (TYPE_ARG_TYPES ((TREE_TYPE (decl
))))
5128 == void_list_node
)))
5130 /* [basic.stc.dynamic.allocation]
5132 An allocation function can be a function
5133 template. ... Template allocation functions shall
5134 have two or more parameters. */
5135 error ("invalid template declaration of %qD", decl
);
5136 return error_mark_node
;
5139 else if (DECL_IMPLICIT_TYPEDEF_P (decl
)
5140 && CLASS_TYPE_P (TREE_TYPE (decl
)))
5142 else if (TREE_CODE (decl
) == TYPE_DECL
5143 && TYPE_DECL_ALIAS_P (decl
))
5144 /* alias-declaration */
5145 gcc_assert (!DECL_ARTIFICIAL (decl
));
5146 else if (VAR_P (decl
))
5147 /* C++14 variable template. */;
5150 error ("template declaration of %q#D", decl
);
5151 return error_mark_node
;
5155 /* Check to see that the rules regarding the use of default
5156 arguments are not being violated. */
5157 check_default_tmpl_args (decl
, current_template_parms
,
5158 is_primary
, is_partial
, /*is_friend_decl=*/0);
5160 /* Ensure that there are no parameter packs in the type of this
5161 declaration that have not been expanded. */
5162 if (TREE_CODE (decl
) == FUNCTION_DECL
)
5164 /* Check each of the arguments individually to see if there are
5165 any bare parameter packs. */
5166 tree type
= TREE_TYPE (decl
);
5167 tree arg
= DECL_ARGUMENTS (decl
);
5168 tree argtype
= TYPE_ARG_TYPES (type
);
5170 while (arg
&& argtype
)
5172 if (!DECL_PACK_P (arg
)
5173 && check_for_bare_parameter_packs (TREE_TYPE (arg
)))
5175 /* This is a PARM_DECL that contains unexpanded parameter
5176 packs. We have already complained about this in the
5177 check_for_bare_parameter_packs call, so just replace
5178 these types with ERROR_MARK_NODE. */
5179 TREE_TYPE (arg
) = error_mark_node
;
5180 TREE_VALUE (argtype
) = error_mark_node
;
5183 arg
= DECL_CHAIN (arg
);
5184 argtype
= TREE_CHAIN (argtype
);
5187 /* Check for bare parameter packs in the return type and the
5188 exception specifiers. */
5189 if (check_for_bare_parameter_packs (TREE_TYPE (type
)))
5190 /* Errors were already issued, set return type to int
5191 as the frontend doesn't expect error_mark_node as
5193 TREE_TYPE (type
) = integer_type_node
;
5194 if (check_for_bare_parameter_packs (TYPE_RAISES_EXCEPTIONS (type
)))
5195 TYPE_RAISES_EXCEPTIONS (type
) = NULL_TREE
;
5197 else if (check_for_bare_parameter_packs ((TREE_CODE (decl
) == TYPE_DECL
5198 && TYPE_DECL_ALIAS_P (decl
))
5199 ? DECL_ORIGINAL_TYPE (decl
)
5200 : TREE_TYPE (decl
)))
5202 TREE_TYPE (decl
) = error_mark_node
;
5203 return error_mark_node
;
5207 return process_partial_specialization (decl
);
5209 args
= current_template_args ();
5212 || TREE_CODE (ctx
) == FUNCTION_DECL
5213 || (CLASS_TYPE_P (ctx
) && TYPE_BEING_DEFINED (ctx
))
5214 || (TREE_CODE (decl
) == TYPE_DECL
5215 && LAMBDA_TYPE_P (TREE_TYPE (decl
)))
5216 || (is_friend
&& !DECL_TEMPLATE_INFO (decl
)))
5218 if (DECL_LANG_SPECIFIC (decl
)
5219 && DECL_TEMPLATE_INFO (decl
)
5220 && DECL_TI_TEMPLATE (decl
))
5221 tmpl
= DECL_TI_TEMPLATE (decl
);
5222 /* If DECL is a TYPE_DECL for a class-template, then there won't
5223 be DECL_LANG_SPECIFIC. The information equivalent to
5224 DECL_TEMPLATE_INFO is found in TYPE_TEMPLATE_INFO instead. */
5225 else if (DECL_IMPLICIT_TYPEDEF_P (decl
)
5226 && TYPE_TEMPLATE_INFO (TREE_TYPE (decl
))
5227 && TYPE_TI_TEMPLATE (TREE_TYPE (decl
)))
5229 /* Since a template declaration already existed for this
5230 class-type, we must be redeclaring it here. Make sure
5231 that the redeclaration is valid. */
5232 redeclare_class_template (TREE_TYPE (decl
),
5233 current_template_parms
,
5234 current_template_constraints ());
5235 /* We don't need to create a new TEMPLATE_DECL; just use the
5236 one we already had. */
5237 tmpl
= TYPE_TI_TEMPLATE (TREE_TYPE (decl
));
5241 tmpl
= build_template_decl (decl
, current_template_parms
,
5245 if (DECL_LANG_SPECIFIC (decl
)
5246 && DECL_TEMPLATE_SPECIALIZATION (decl
))
5248 /* A specialization of a member template of a template
5250 SET_DECL_TEMPLATE_SPECIALIZATION (tmpl
);
5251 DECL_TEMPLATE_INFO (tmpl
) = DECL_TEMPLATE_INFO (decl
);
5252 DECL_TEMPLATE_INFO (decl
) = NULL_TREE
;
5258 tree a
, t
, current
, parms
;
5260 tree tinfo
= get_template_info (decl
);
5264 error ("template definition of non-template %q#D", decl
);
5265 return error_mark_node
;
5268 tmpl
= TI_TEMPLATE (tinfo
);
5270 if (DECL_FUNCTION_TEMPLATE_P (tmpl
)
5271 && DECL_TEMPLATE_INFO (decl
) && DECL_TI_ARGS (decl
)
5272 && DECL_TEMPLATE_SPECIALIZATION (decl
)
5273 && DECL_MEMBER_TEMPLATE_P (tmpl
))
5277 /* The declaration is a specialization of a member
5278 template, declared outside the class. Therefore, the
5279 innermost template arguments will be NULL, so we
5280 replace them with the arguments determined by the
5281 earlier call to check_explicit_specialization. */
5282 args
= DECL_TI_ARGS (decl
);
5285 = build_template_decl (decl
, current_template_parms
,
5287 DECL_TEMPLATE_RESULT (new_tmpl
) = decl
;
5288 TREE_TYPE (new_tmpl
) = TREE_TYPE (decl
);
5289 DECL_TI_TEMPLATE (decl
) = new_tmpl
;
5290 SET_DECL_TEMPLATE_SPECIALIZATION (new_tmpl
);
5291 DECL_TEMPLATE_INFO (new_tmpl
)
5292 = build_template_info (tmpl
, args
);
5294 register_specialization (new_tmpl
,
5295 most_general_template (tmpl
),
5301 /* Make sure the template headers we got make sense. */
5303 parms
= DECL_TEMPLATE_PARMS (tmpl
);
5304 i
= TMPL_PARMS_DEPTH (parms
);
5305 if (TMPL_ARGS_DEPTH (args
) != i
)
5307 error ("expected %d levels of template parms for %q#D, got %d",
5308 i
, decl
, TMPL_ARGS_DEPTH (args
));
5309 DECL_INTERFACE_KNOWN (decl
) = 1;
5310 return error_mark_node
;
5313 for (current
= decl
; i
> 0; --i
, parms
= TREE_CHAIN (parms
))
5315 a
= TMPL_ARGS_LEVEL (args
, i
);
5316 t
= INNERMOST_TEMPLATE_PARMS (parms
);
5318 if (TREE_VEC_LENGTH (t
) != TREE_VEC_LENGTH (a
))
5320 if (current
== decl
)
5321 error ("got %d template parameters for %q#D",
5322 TREE_VEC_LENGTH (a
), decl
);
5324 error ("got %d template parameters for %q#T",
5325 TREE_VEC_LENGTH (a
), current
);
5326 error (" but %d required", TREE_VEC_LENGTH (t
));
5327 /* Avoid crash in import_export_decl. */
5328 DECL_INTERFACE_KNOWN (decl
) = 1;
5329 return error_mark_node
;
5332 if (current
== decl
)
5334 else if (current
== NULL_TREE
)
5335 /* Can happen in erroneous input. */
5338 current
= get_containing_scope (current
);
5341 /* Check that the parms are used in the appropriate qualifying scopes
5342 in the declarator. */
5343 if (!comp_template_args
5345 TI_ARGS (get_template_info (DECL_TEMPLATE_RESULT (tmpl
)))))
5348 template arguments to %qD do not match original template %qD",
5349 decl
, DECL_TEMPLATE_RESULT (tmpl
));
5350 if (!uses_template_parms (TI_ARGS (tinfo
)))
5351 inform (input_location
, "use template<> for an explicit specialization");
5352 /* Avoid crash in import_export_decl. */
5353 DECL_INTERFACE_KNOWN (decl
) = 1;
5354 return error_mark_node
;
5358 DECL_TEMPLATE_RESULT (tmpl
) = decl
;
5359 TREE_TYPE (tmpl
) = TREE_TYPE (decl
);
5361 /* Push template declarations for global functions and types. Note
5362 that we do not try to push a global template friend declared in a
5363 template class; such a thing may well depend on the template
5364 parameters of the class. */
5365 if (new_template_p
&& !ctx
5366 && !(is_friend
&& template_class_depth (current_class_type
) > 0))
5368 tmpl
= pushdecl_namespace_level (tmpl
, is_friend
);
5369 if (tmpl
== error_mark_node
)
5370 return error_mark_node
;
5372 /* Hide template friend classes that haven't been declared yet. */
5373 if (is_friend
&& TREE_CODE (decl
) == TYPE_DECL
)
5375 DECL_ANTICIPATED (tmpl
) = 1;
5376 DECL_FRIEND_P (tmpl
) = 1;
5382 tree parms
= DECL_TEMPLATE_PARMS (tmpl
);
5385 DECL_PRIMARY_TEMPLATE (tmpl
) = tmpl
;
5386 if (DECL_CONV_FN_P (tmpl
))
5388 int depth
= TMPL_PARMS_DEPTH (parms
);
5390 /* It is a conversion operator. See if the type converted to
5391 depends on innermost template operands. */
5393 if (uses_template_parms_level (TREE_TYPE (TREE_TYPE (tmpl
)),
5395 DECL_TEMPLATE_CONV_FN_P (tmpl
) = 1;
5398 /* Give template template parms a DECL_CONTEXT of the template
5399 for which they are a parameter. */
5400 parms
= INNERMOST_TEMPLATE_PARMS (parms
);
5401 for (i
= TREE_VEC_LENGTH (parms
) - 1; i
>= 0; --i
)
5403 tree parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
5404 if (TREE_CODE (parm
) == TEMPLATE_DECL
)
5405 DECL_CONTEXT (parm
) = tmpl
;
5408 if (TREE_CODE (decl
) == TYPE_DECL
5409 && TYPE_DECL_ALIAS_P (decl
)
5410 && complex_alias_template_p (tmpl
))
5411 TEMPLATE_DECL_COMPLEX_ALIAS_P (tmpl
) = true;
5414 /* The DECL_TI_ARGS of DECL contains full set of arguments referring
5415 back to its most general template. If TMPL is a specialization,
5416 ARGS may only have the innermost set of arguments. Add the missing
5417 argument levels if necessary. */
5418 if (DECL_TEMPLATE_INFO (tmpl
))
5419 args
= add_outermost_template_args (DECL_TI_ARGS (tmpl
), args
);
5421 info
= build_template_info (tmpl
, args
);
5423 if (DECL_IMPLICIT_TYPEDEF_P (decl
))
5424 SET_TYPE_TEMPLATE_INFO (TREE_TYPE (tmpl
), info
);
5427 if (is_primary
&& !DECL_LANG_SPECIFIC (decl
))
5428 retrofit_lang_decl (decl
);
5429 if (DECL_LANG_SPECIFIC (decl
))
5430 DECL_TEMPLATE_INFO (decl
) = info
;
5433 if (flag_implicit_templates
5435 && TREE_PUBLIC (decl
)
5436 && VAR_OR_FUNCTION_DECL_P (decl
))
5437 /* Set DECL_COMDAT on template instantiations; if we force
5438 them to be emitted by explicit instantiation or -frepo,
5439 mark_needed will tell cgraph to do the right thing. */
5440 DECL_COMDAT (decl
) = true;
5442 return DECL_TEMPLATE_RESULT (tmpl
);
5446 push_template_decl (tree decl
)
5448 return push_template_decl_real (decl
, false);
5451 /* FN is an inheriting constructor that inherits from the constructor
5452 template INHERITED; turn FN into a constructor template with a matching
5456 add_inherited_template_parms (tree fn
, tree inherited
)
5459 = INNERMOST_TEMPLATE_PARMS (DECL_TEMPLATE_PARMS (inherited
));
5460 inner_parms
= copy_node (inner_parms
);
5462 = tree_cons (size_int (processing_template_decl
+ 1),
5463 inner_parms
, current_template_parms
);
5464 tree tmpl
= build_template_decl (fn
, parms
, /*member*/true);
5465 tree args
= template_parms_to_args (parms
);
5466 DECL_TEMPLATE_INFO (fn
) = build_template_info (tmpl
, args
);
5467 TREE_TYPE (tmpl
) = TREE_TYPE (fn
);
5468 DECL_TEMPLATE_RESULT (tmpl
) = fn
;
5469 DECL_ARTIFICIAL (tmpl
) = true;
5470 DECL_PRIMARY_TEMPLATE (tmpl
) = tmpl
;
5474 /* Called when a class template TYPE is redeclared with the indicated
5475 template PARMS, e.g.:
5477 template <class T> struct S;
5478 template <class T> struct S {}; */
5481 redeclare_class_template (tree type
, tree parms
, tree cons
)
5487 if (!TYPE_TEMPLATE_INFO (type
))
5489 error ("%qT is not a template type", type
);
5493 tmpl
= TYPE_TI_TEMPLATE (type
);
5494 if (!PRIMARY_TEMPLATE_P (tmpl
))
5495 /* The type is nested in some template class. Nothing to worry
5496 about here; there are no new template parameters for the nested
5502 error ("template specifiers not specified in declaration of %qD",
5507 parms
= INNERMOST_TEMPLATE_PARMS (parms
);
5508 tmpl_parms
= DECL_INNERMOST_TEMPLATE_PARMS (tmpl
);
5510 if (TREE_VEC_LENGTH (parms
) != TREE_VEC_LENGTH (tmpl_parms
))
5512 error_n (input_location
, TREE_VEC_LENGTH (parms
),
5513 "redeclared with %d template parameter",
5514 "redeclared with %d template parameters",
5515 TREE_VEC_LENGTH (parms
));
5516 inform_n (DECL_SOURCE_LOCATION (tmpl
), TREE_VEC_LENGTH (tmpl_parms
),
5517 "previous declaration %qD used %d template parameter",
5518 "previous declaration %qD used %d template parameters",
5519 tmpl
, TREE_VEC_LENGTH (tmpl_parms
));
5523 for (i
= 0; i
< TREE_VEC_LENGTH (tmpl_parms
); ++i
)
5530 if (TREE_VEC_ELT (tmpl_parms
, i
) == error_mark_node
5531 || TREE_VEC_ELT (parms
, i
) == error_mark_node
)
5534 tmpl_parm
= TREE_VALUE (TREE_VEC_ELT (tmpl_parms
, i
));
5535 if (error_operand_p (tmpl_parm
))
5538 parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
5539 tmpl_default
= TREE_PURPOSE (TREE_VEC_ELT (tmpl_parms
, i
));
5540 parm_default
= TREE_PURPOSE (TREE_VEC_ELT (parms
, i
));
5542 /* TMPL_PARM and PARM can be either TYPE_DECL, PARM_DECL, or
5544 if (TREE_CODE (tmpl_parm
) != TREE_CODE (parm
)
5545 || (TREE_CODE (tmpl_parm
) != TYPE_DECL
5546 && !same_type_p (TREE_TYPE (tmpl_parm
), TREE_TYPE (parm
)))
5547 || (TREE_CODE (tmpl_parm
) != PARM_DECL
5548 && (TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (tmpl_parm
))
5549 != TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (parm
))))
5550 || (TREE_CODE (tmpl_parm
) == PARM_DECL
5551 && (TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (tmpl_parm
))
5552 != TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm
)))))
5554 error ("template parameter %q+#D", tmpl_parm
);
5555 error ("redeclared here as %q#D", parm
);
5559 if (tmpl_default
!= NULL_TREE
&& parm_default
!= NULL_TREE
)
5561 /* We have in [temp.param]:
5563 A template-parameter may not be given default arguments
5564 by two different declarations in the same scope. */
5565 error_at (input_location
, "redefinition of default argument for %q#D", parm
);
5566 inform (DECL_SOURCE_LOCATION (tmpl_parm
),
5567 "original definition appeared here");
5571 if (parm_default
!= NULL_TREE
)
5572 /* Update the previous template parameters (which are the ones
5573 that will really count) with the new default value. */
5574 TREE_PURPOSE (TREE_VEC_ELT (tmpl_parms
, i
)) = parm_default
;
5575 else if (tmpl_default
!= NULL_TREE
)
5576 /* Update the new parameters, too; they'll be used as the
5577 parameters for any members. */
5578 TREE_PURPOSE (TREE_VEC_ELT (parms
, i
)) = tmpl_default
;
5580 /* Give each template template parm in this redeclaration a
5581 DECL_CONTEXT of the template for which they are a parameter. */
5582 if (TREE_CODE (parm
) == TEMPLATE_DECL
)
5584 gcc_assert (DECL_CONTEXT (parm
) == NULL_TREE
);
5585 DECL_CONTEXT (parm
) = tmpl
;
5589 // Cannot redeclare a class template with a different set of constraints.
5590 if (!equivalent_constraints (get_constraints (tmpl
), cons
))
5592 error_at (input_location
, "redeclaration %q#D with different "
5593 "constraints", tmpl
);
5594 inform (DECL_SOURCE_LOCATION (tmpl
),
5595 "original declaration appeared here");
5601 /* The actual substitution part of instantiate_non_dependent_expr_sfinae,
5602 to be used when the caller has already checked
5603 (processing_template_decl
5604 && !instantiation_dependent_expression_p (expr)
5605 && potential_constant_expression (expr))
5606 and cleared processing_template_decl. */
5609 instantiate_non_dependent_expr_internal (tree expr
, tsubst_flags_t complain
)
5611 return tsubst_copy_and_build (expr
,
5614 /*in_decl=*/NULL_TREE
,
5615 /*function_p=*/false,
5616 /*integral_constant_expression_p=*/true);
5619 /* Simplify EXPR if it is a non-dependent expression. Returns the
5620 (possibly simplified) expression. */
5623 instantiate_non_dependent_expr_sfinae (tree expr
, tsubst_flags_t complain
)
5625 if (expr
== NULL_TREE
)
5628 /* If we're in a template, but EXPR isn't value dependent, simplify
5629 it. We're supposed to treat:
5631 template <typename T> void f(T[1 + 1]);
5632 template <typename T> void f(T[2]);
5634 as two declarations of the same function, for example. */
5635 if (processing_template_decl
5636 && !instantiation_dependent_expression_p (expr
)
5637 && potential_constant_expression (expr
))
5639 processing_template_decl_sentinel s
;
5640 expr
= instantiate_non_dependent_expr_internal (expr
, complain
);
5646 instantiate_non_dependent_expr (tree expr
)
5648 return instantiate_non_dependent_expr_sfinae (expr
, tf_error
);
5651 /* True iff T is a specialization of a variable template. */
5654 variable_template_specialization_p (tree t
)
5656 if (!VAR_P (t
) || !DECL_LANG_SPECIFIC (t
) || !DECL_TEMPLATE_INFO (t
))
5658 tree tmpl
= DECL_TI_TEMPLATE (t
);
5659 return variable_template_p (tmpl
);
5662 /* Return TRUE iff T is a type alias, a TEMPLATE_DECL for an alias
5663 template declaration, or a TYPE_DECL for an alias declaration. */
5666 alias_type_or_template_p (tree t
)
5670 return ((TREE_CODE (t
) == TYPE_DECL
&& TYPE_DECL_ALIAS_P (t
))
5673 && TYPE_DECL_ALIAS_P (TYPE_NAME (t
)))
5674 || DECL_ALIAS_TEMPLATE_P (t
));
5677 /* Return TRUE iff T is a specialization of an alias template. */
5680 alias_template_specialization_p (const_tree t
)
5682 /* It's an alias template specialization if it's an alias and its
5683 TYPE_NAME is a specialization of a primary template. */
5684 if (TYPE_ALIAS_P (t
))
5686 tree name
= TYPE_NAME (t
);
5687 if (DECL_LANG_SPECIFIC (name
))
5688 if (tree ti
= DECL_TEMPLATE_INFO (name
))
5690 tree tmpl
= TI_TEMPLATE (ti
);
5691 return PRIMARY_TEMPLATE_P (tmpl
);
5697 /* An alias template is complex from a SFINAE perspective if a template-id
5698 using that alias can be ill-formed when the expansion is not, as with
5699 the void_t template. We determine this by checking whether the
5700 expansion for the alias template uses all its template parameters. */
5702 struct uses_all_template_parms_data
5709 uses_all_template_parms_r (tree t
, void *data_
)
5711 struct uses_all_template_parms_data
&data
5712 = *(struct uses_all_template_parms_data
*)data_
;
5713 tree idx
= get_template_parm_index (t
);
5715 if (TEMPLATE_PARM_LEVEL (idx
) == data
.level
)
5716 data
.seen
[TEMPLATE_PARM_IDX (idx
)] = true;
5721 complex_alias_template_p (const_tree tmpl
)
5723 struct uses_all_template_parms_data data
;
5724 tree pat
= DECL_ORIGINAL_TYPE (DECL_TEMPLATE_RESULT (tmpl
));
5725 tree parms
= DECL_TEMPLATE_PARMS (tmpl
);
5726 data
.level
= TMPL_PARMS_DEPTH (parms
);
5727 int len
= TREE_VEC_LENGTH (INNERMOST_TEMPLATE_PARMS (parms
));
5728 data
.seen
= XALLOCAVEC (bool, len
);
5729 for (int i
= 0; i
< len
; ++i
)
5730 data
.seen
[i
] = false;
5732 for_each_template_parm (pat
, uses_all_template_parms_r
, &data
, NULL
, true);
5733 for (int i
= 0; i
< len
; ++i
)
5739 /* Return TRUE iff T is a specialization of a complex alias template with
5740 dependent template-arguments. */
5743 dependent_alias_template_spec_p (const_tree t
)
5745 return (alias_template_specialization_p (t
)
5746 && TEMPLATE_DECL_COMPLEX_ALIAS_P (DECL_TI_TEMPLATE (TYPE_NAME (t
)))
5747 && (any_dependent_template_arguments_p
5748 (INNERMOST_TEMPLATE_ARGS (TYPE_TI_ARGS (t
)))));
5751 /* Return the number of innermost template parameters in TMPL. */
5754 num_innermost_template_parms (tree tmpl
)
5756 tree parms
= INNERMOST_TEMPLATE_PARMS (DECL_TEMPLATE_PARMS (tmpl
));
5757 return TREE_VEC_LENGTH (parms
);
5760 /* Return either TMPL or another template that it is equivalent to under DR
5761 1286: An alias that just changes the name of a template is equivalent to
5762 the other template. */
5765 get_underlying_template (tree tmpl
)
5767 gcc_assert (TREE_CODE (tmpl
) == TEMPLATE_DECL
);
5768 while (DECL_ALIAS_TEMPLATE_P (tmpl
))
5770 tree result
= DECL_ORIGINAL_TYPE (DECL_TEMPLATE_RESULT (tmpl
));
5771 if (TYPE_TEMPLATE_INFO (result
))
5773 tree sub
= TYPE_TI_TEMPLATE (result
);
5774 if (PRIMARY_TEMPLATE_P (sub
)
5775 && (num_innermost_template_parms (tmpl
)
5776 == num_innermost_template_parms (sub
)))
5778 tree alias_args
= INNERMOST_TEMPLATE_ARGS
5779 (template_parms_to_args (DECL_TEMPLATE_PARMS (tmpl
)));
5780 if (!comp_template_args (TYPE_TI_ARGS (result
), alias_args
))
5782 /* The alias type is equivalent to the pattern of the
5783 underlying template, so strip the alias. */
5793 /* Subroutine of convert_nontype_argument. Converts EXPR to TYPE, which
5794 must be a function or a pointer-to-function type, as specified
5795 in [temp.arg.nontype]: disambiguate EXPR if it is an overload set,
5796 and check that the resulting function has external linkage. */
5799 convert_nontype_argument_function (tree type
, tree expr
,
5800 tsubst_flags_t complain
)
5804 linkage_kind linkage
;
5806 fn
= instantiate_type (type
, fns
, tf_none
);
5807 if (fn
== error_mark_node
)
5808 return error_mark_node
;
5811 if (TREE_CODE (fn_no_ptr
) == ADDR_EXPR
)
5812 fn_no_ptr
= TREE_OPERAND (fn_no_ptr
, 0);
5813 if (BASELINK_P (fn_no_ptr
))
5814 fn_no_ptr
= BASELINK_FUNCTIONS (fn_no_ptr
);
5816 /* [temp.arg.nontype]/1
5818 A template-argument for a non-type, non-template template-parameter
5821 -- the address of an object or function with external [C++11: or
5822 internal] linkage. */
5824 if (TREE_CODE (fn_no_ptr
) != FUNCTION_DECL
)
5826 if (complain
& tf_error
)
5828 error ("%qE is not a valid template argument for type %qT",
5830 if (TYPE_PTR_P (type
))
5831 error ("it must be the address of a function with "
5832 "external linkage");
5834 error ("it must be the name of a function with "
5835 "external linkage");
5840 linkage
= decl_linkage (fn_no_ptr
);
5841 if (cxx_dialect
>= cxx11
? linkage
== lk_none
: linkage
!= lk_external
)
5843 if (complain
& tf_error
)
5845 if (cxx_dialect
>= cxx11
)
5846 error ("%qE is not a valid template argument for type %qT "
5847 "because %qD has no linkage",
5848 expr
, type
, fn_no_ptr
);
5850 error ("%qE is not a valid template argument for type %qT "
5851 "because %qD does not have external linkage",
5852 expr
, type
, fn_no_ptr
);
5860 /* Subroutine of convert_nontype_argument.
5861 Check if EXPR of type TYPE is a valid pointer-to-member constant.
5862 Emit an error otherwise. */
5865 check_valid_ptrmem_cst_expr (tree type
, tree expr
,
5866 tsubst_flags_t complain
)
5869 if (expr
&& (null_ptr_cst_p (expr
) || TREE_CODE (expr
) == PTRMEM_CST
))
5871 if (cxx_dialect
>= cxx11
&& null_member_pointer_value_p (expr
))
5873 if (processing_template_decl
5874 && TREE_CODE (expr
) == ADDR_EXPR
5875 && TREE_CODE (TREE_OPERAND (expr
, 0)) == OFFSET_REF
)
5877 if (complain
& tf_error
)
5879 error ("%qE is not a valid template argument for type %qT",
5881 error ("it must be a pointer-to-member of the form %<&X::Y%>");
5886 /* Returns TRUE iff the address of OP is value-dependent.
5888 14.6.2.4 [temp.dep.temp]:
5889 A non-integral non-type template-argument is dependent if its type is
5890 dependent or it has either of the following forms
5893 and contains a nested-name-specifier which specifies a class-name that
5894 names a dependent type.
5896 We generalize this to just say that the address of a member of a
5897 dependent class is value-dependent; the above doesn't cover the
5898 address of a static data member named with an unqualified-id. */
5901 has_value_dependent_address (tree op
)
5903 /* We could use get_inner_reference here, but there's no need;
5904 this is only relevant for template non-type arguments, which
5905 can only be expressed as &id-expression. */
5908 tree ctx
= CP_DECL_CONTEXT (op
);
5909 if (TYPE_P (ctx
) && dependent_type_p (ctx
))
5916 /* The next set of functions are used for providing helpful explanatory
5917 diagnostics for failed overload resolution. Their messages should be
5918 indented by two spaces for consistency with the messages in
5922 unify_success (bool /*explain_p*/)
5928 unify_parameter_deduction_failure (bool explain_p
, tree parm
)
5931 inform (input_location
,
5932 " couldn't deduce template parameter %qD", parm
);
5937 unify_invalid (bool /*explain_p*/)
5943 unify_cv_qual_mismatch (bool explain_p
, tree parm
, tree arg
)
5946 inform (input_location
,
5947 " types %qT and %qT have incompatible cv-qualifiers",
5953 unify_type_mismatch (bool explain_p
, tree parm
, tree arg
)
5956 inform (input_location
, " mismatched types %qT and %qT", parm
, arg
);
5961 unify_parameter_pack_mismatch (bool explain_p
, tree parm
, tree arg
)
5964 inform (input_location
,
5965 " template parameter %qD is not a parameter pack, but "
5972 unify_ptrmem_cst_mismatch (bool explain_p
, tree parm
, tree arg
)
5975 inform (input_location
,
5976 " template argument %qE does not match "
5977 "pointer-to-member constant %qE",
5983 unify_expression_unequal (bool explain_p
, tree parm
, tree arg
)
5986 inform (input_location
, " %qE is not equivalent to %qE", parm
, arg
);
5991 unify_parameter_pack_inconsistent (bool explain_p
, tree old_arg
, tree new_arg
)
5994 inform (input_location
,
5995 " inconsistent parameter pack deduction with %qT and %qT",
6001 unify_inconsistency (bool explain_p
, tree parm
, tree first
, tree second
)
6006 inform (input_location
,
6007 " deduced conflicting types for parameter %qT (%qT and %qT)",
6008 parm
, first
, second
);
6010 inform (input_location
,
6011 " deduced conflicting values for non-type parameter "
6012 "%qE (%qE and %qE)", parm
, first
, second
);
6018 unify_vla_arg (bool explain_p
, tree arg
)
6021 inform (input_location
,
6022 " variable-sized array type %qT is not "
6023 "a valid template argument",
6029 unify_method_type_error (bool explain_p
, tree arg
)
6032 inform (input_location
,
6033 " member function type %qT is not a valid template argument",
6039 unify_arity (bool explain_p
, int have
, int wanted
, bool least_p
= false)
6044 inform_n (input_location
, wanted
,
6045 " candidate expects at least %d argument, %d provided",
6046 " candidate expects at least %d arguments, %d provided",
6049 inform_n (input_location
, wanted
,
6050 " candidate expects %d argument, %d provided",
6051 " candidate expects %d arguments, %d provided",
6058 unify_too_many_arguments (bool explain_p
, int have
, int wanted
)
6060 return unify_arity (explain_p
, have
, wanted
);
6064 unify_too_few_arguments (bool explain_p
, int have
, int wanted
,
6065 bool least_p
= false)
6067 return unify_arity (explain_p
, have
, wanted
, least_p
);
6071 unify_arg_conversion (bool explain_p
, tree to_type
,
6072 tree from_type
, tree arg
)
6075 inform (EXPR_LOC_OR_LOC (arg
, input_location
),
6076 " cannot convert %qE (type %qT) to type %qT",
6077 arg
, from_type
, to_type
);
6082 unify_no_common_base (bool explain_p
, enum template_base_result r
,
6083 tree parm
, tree arg
)
6088 case tbr_ambiguous_baseclass
:
6089 inform (input_location
, " %qT is an ambiguous base class of %qT",
6093 inform (input_location
, " %qT is not derived from %qT", arg
, parm
);
6100 unify_inconsistent_template_template_parameters (bool explain_p
)
6103 inform (input_location
,
6104 " template parameters of a template template argument are "
6105 "inconsistent with other deduced template arguments");
6110 unify_template_deduction_failure (bool explain_p
, tree parm
, tree arg
)
6113 inform (input_location
,
6114 " can't deduce a template for %qT from non-template type %qT",
6120 unify_template_argument_mismatch (bool explain_p
, tree parm
, tree arg
)
6123 inform (input_location
,
6124 " template argument %qE does not match %qD", arg
, parm
);
6129 unify_overload_resolution_failure (bool explain_p
, tree arg
)
6132 inform (input_location
,
6133 " could not resolve address from overloaded function %qE",
6138 /* Attempt to convert the non-type template parameter EXPR to the
6139 indicated TYPE. If the conversion is successful, return the
6140 converted value. If the conversion is unsuccessful, return
6141 NULL_TREE if we issued an error message, or error_mark_node if we
6142 did not. We issue error messages for out-and-out bad template
6143 parameters, but not simply because the conversion failed, since we
6144 might be just trying to do argument deduction. Both TYPE and EXPR
6145 must be non-dependent.
6147 The conversion follows the special rules described in
6148 [temp.arg.nontype], and it is much more strict than an implicit
6151 This function is called twice for each template argument (see
6152 lookup_template_class for a more accurate description of this
6153 problem). This means that we need to handle expressions which
6154 are not valid in a C++ source, but can be created from the
6155 first call (for instance, casts to perform conversions). These
6156 hacks can go away after we fix the double coercion problem. */
6159 convert_nontype_argument (tree type
, tree expr
, tsubst_flags_t complain
)
6163 /* Detect immediately string literals as invalid non-type argument.
6164 This special-case is not needed for correctness (we would easily
6165 catch this later), but only to provide better diagnostic for this
6166 common user mistake. As suggested by DR 100, we do not mention
6167 linkage issues in the diagnostic as this is not the point. */
6168 /* FIXME we're making this OK. */
6169 if (TREE_CODE (expr
) == STRING_CST
)
6171 if (complain
& tf_error
)
6172 error ("%qE is not a valid template argument for type %qT "
6173 "because string literals can never be used in this context",
6178 /* Add the ADDR_EXPR now for the benefit of
6179 value_dependent_expression_p. */
6180 if (TYPE_PTROBV_P (type
)
6181 && TREE_CODE (TREE_TYPE (expr
)) == ARRAY_TYPE
)
6183 expr
= decay_conversion (expr
, complain
);
6184 if (expr
== error_mark_node
)
6185 return error_mark_node
;
6188 /* If we are in a template, EXPR may be non-dependent, but still
6189 have a syntactic, rather than semantic, form. For example, EXPR
6190 might be a SCOPE_REF, rather than the VAR_DECL to which the
6191 SCOPE_REF refers. Preserving the qualifying scope is necessary
6192 so that access checking can be performed when the template is
6193 instantiated -- but here we need the resolved form so that we can
6194 convert the argument. */
6195 bool non_dep
= false;
6196 if (TYPE_REF_OBJ_P (type
)
6197 && has_value_dependent_address (expr
))
6198 /* If we want the address and it's value-dependent, don't fold. */;
6199 else if (!type_unknown_p (expr
)
6200 && processing_template_decl
6201 && !instantiation_dependent_expression_p (expr
)
6202 && potential_constant_expression (expr
))
6204 if (error_operand_p (expr
))
6205 return error_mark_node
;
6206 expr_type
= TREE_TYPE (expr
);
6207 if (TREE_CODE (type
) == REFERENCE_TYPE
)
6208 expr
= mark_lvalue_use (expr
);
6210 expr
= mark_rvalue_use (expr
);
6212 /* If the argument is non-dependent, perform any conversions in
6213 non-dependent context as well. */
6214 processing_template_decl_sentinel
s (non_dep
);
6216 expr
= instantiate_non_dependent_expr_internal (expr
, complain
);
6218 /* 14.3.2/5: The null pointer{,-to-member} conversion is applied
6219 to a non-type argument of "nullptr". */
6220 if (expr
== nullptr_node
&& TYPE_PTR_OR_PTRMEM_P (type
))
6221 expr
= convert (type
, expr
);
6223 /* In C++11, integral or enumeration non-type template arguments can be
6224 arbitrary constant expressions. Pointer and pointer to
6225 member arguments can be general constant expressions that evaluate
6226 to a null value, but otherwise still need to be of a specific form. */
6227 if (cxx_dialect
>= cxx11
)
6229 if (TREE_CODE (expr
) == PTRMEM_CST
)
6230 /* A PTRMEM_CST is already constant, and a valid template
6231 argument for a parameter of pointer to member type, we just want
6232 to leave it in that form rather than lower it to a
6234 else if (INTEGRAL_OR_ENUMERATION_TYPE_P (type
))
6235 expr
= maybe_constant_value (expr
);
6236 else if (TYPE_PTR_OR_PTRMEM_P (type
))
6238 tree folded
= maybe_constant_value (expr
);
6239 if (TYPE_PTR_P (type
) ? integer_zerop (folded
)
6240 : null_member_pointer_value_p (folded
))
6245 /* HACK: Due to double coercion, we can get a
6246 NOP_EXPR<REFERENCE_TYPE>(ADDR_EXPR<POINTER_TYPE> (arg)) here,
6247 which is the tree that we built on the first call (see
6248 below when coercing to reference to object or to reference to
6249 function). We just strip everything and get to the arg.
6250 See g++.old-deja/g++.oliva/template4.C and g++.dg/template/nontype9.C
6252 if (TYPE_REF_OBJ_P (type
) || TYPE_REFFN_P (type
))
6254 tree probe_type
, probe
= expr
;
6255 if (REFERENCE_REF_P (probe
))
6256 probe
= TREE_OPERAND (probe
, 0);
6257 probe_type
= TREE_TYPE (probe
);
6258 if (TREE_CODE (probe
) == NOP_EXPR
)
6260 /* ??? Maybe we could use convert_from_reference here, but we
6261 would need to relax its constraints because the NOP_EXPR
6262 could actually change the type to something more cv-qualified,
6263 and this is not folded by convert_from_reference. */
6264 tree addr
= TREE_OPERAND (probe
, 0);
6265 if (TREE_CODE (probe_type
) == REFERENCE_TYPE
6266 && TREE_CODE (addr
) == ADDR_EXPR
6267 && TYPE_PTR_P (TREE_TYPE (addr
))
6268 && (same_type_ignoring_top_level_qualifiers_p
6269 (TREE_TYPE (probe_type
),
6270 TREE_TYPE (TREE_TYPE (addr
)))))
6272 expr
= TREE_OPERAND (addr
, 0);
6273 expr_type
= TREE_TYPE (probe_type
);
6278 /* We could also generate a NOP_EXPR(ADDR_EXPR()) when the
6279 parameter is a pointer to object, through decay and
6280 qualification conversion. Let's strip everything. */
6281 else if (TREE_CODE (expr
) == NOP_EXPR
&& TYPE_PTROBV_P (type
))
6285 if (TREE_CODE (probe
) == ADDR_EXPR
6286 && TYPE_PTR_P (TREE_TYPE (probe
)))
6288 /* Skip the ADDR_EXPR only if it is part of the decay for
6289 an array. Otherwise, it is part of the original argument
6290 in the source code. */
6291 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (probe
, 0))) == ARRAY_TYPE
)
6292 probe
= TREE_OPERAND (probe
, 0);
6294 expr_type
= TREE_TYPE (expr
);
6298 /* [temp.arg.nontype]/5, bullet 1
6300 For a non-type template-parameter of integral or enumeration type,
6301 integral promotions (_conv.prom_) and integral conversions
6302 (_conv.integral_) are applied. */
6303 if (INTEGRAL_OR_ENUMERATION_TYPE_P (type
))
6305 tree t
= build_integral_nontype_arg_conv (type
, expr
, complain
);
6306 t
= maybe_constant_value (t
);
6307 if (t
!= error_mark_node
)
6310 if (!same_type_ignoring_top_level_qualifiers_p (type
, TREE_TYPE (expr
)))
6311 return error_mark_node
;
6313 /* Notice that there are constant expressions like '4 % 0' which
6314 do not fold into integer constants. */
6315 if (TREE_CODE (expr
) != INTEGER_CST
)
6317 if (complain
& tf_error
)
6319 int errs
= errorcount
, warns
= warningcount
+ werrorcount
;
6320 if (processing_template_decl
6321 && !require_potential_constant_expression (expr
))
6323 expr
= cxx_constant_value (expr
);
6324 if (errorcount
> errs
|| warningcount
+ werrorcount
> warns
)
6325 inform (EXPR_LOC_OR_LOC (expr
, input_location
),
6326 "in template argument for type %qT ", type
);
6327 if (expr
== error_mark_node
)
6329 /* else cxx_constant_value complained but gave us
6330 a real constant, so go ahead. */
6331 gcc_assert (TREE_CODE (expr
) == INTEGER_CST
);
6337 /* Avoid typedef problems. */
6338 if (TREE_TYPE (expr
) != type
)
6339 expr
= fold_convert (type
, expr
);
6341 /* [temp.arg.nontype]/5, bullet 2
6343 For a non-type template-parameter of type pointer to object,
6344 qualification conversions (_conv.qual_) and the array-to-pointer
6345 conversion (_conv.array_) are applied. */
6346 else if (TYPE_PTROBV_P (type
))
6348 /* [temp.arg.nontype]/1 (TC1 version, DR 49):
6350 A template-argument for a non-type, non-template template-parameter
6351 shall be one of: [...]
6353 -- the name of a non-type template-parameter;
6354 -- the address of an object or function with external linkage, [...]
6355 expressed as "& id-expression" where the & is optional if the name
6356 refers to a function or array, or if the corresponding
6357 template-parameter is a reference.
6359 Here, we do not care about functions, as they are invalid anyway
6360 for a parameter of type pointer-to-object. */
6362 if (DECL_P (expr
) && DECL_TEMPLATE_PARM_P (expr
))
6363 /* Non-type template parameters are OK. */
6365 else if (cxx_dialect
>= cxx11
&& integer_zerop (expr
))
6366 /* Null pointer values are OK in C++11. */;
6367 else if (TREE_CODE (expr
) != ADDR_EXPR
6368 && TREE_CODE (expr_type
) != ARRAY_TYPE
)
6372 if (complain
& tf_error
)
6373 error ("%qD is not a valid template argument "
6374 "because %qD is a variable, not the address of "
6375 "a variable", expr
, expr
);
6378 if (POINTER_TYPE_P (expr_type
))
6380 if (complain
& tf_error
)
6381 error ("%qE is not a valid template argument for %qT "
6382 "because it is not the address of a variable",
6386 /* Other values, like integer constants, might be valid
6387 non-type arguments of some other type. */
6388 return error_mark_node
;
6394 decl
= ((TREE_CODE (expr
) == ADDR_EXPR
)
6395 ? TREE_OPERAND (expr
, 0) : expr
);
6398 if (complain
& tf_error
)
6399 error ("%qE is not a valid template argument of type %qT "
6400 "because %qE is not a variable", expr
, type
, decl
);
6403 else if (cxx_dialect
< cxx11
&& !DECL_EXTERNAL_LINKAGE_P (decl
))
6405 if (complain
& tf_error
)
6406 error ("%qE is not a valid template argument of type %qT "
6407 "because %qD does not have external linkage",
6411 else if (cxx_dialect
>= cxx11
&& decl_linkage (decl
) == lk_none
)
6413 if (complain
& tf_error
)
6414 error ("%qE is not a valid template argument of type %qT "
6415 "because %qD has no linkage", expr
, type
, decl
);
6420 expr
= decay_conversion (expr
, complain
);
6421 if (expr
== error_mark_node
)
6422 return error_mark_node
;
6424 expr
= perform_qualification_conversions (type
, expr
);
6425 if (expr
== error_mark_node
)
6426 return error_mark_node
;
6428 /* [temp.arg.nontype]/5, bullet 3
6430 For a non-type template-parameter of type reference to object, no
6431 conversions apply. The type referred to by the reference may be more
6432 cv-qualified than the (otherwise identical) type of the
6433 template-argument. The template-parameter is bound directly to the
6434 template-argument, which must be an lvalue. */
6435 else if (TYPE_REF_OBJ_P (type
))
6437 if (!same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (type
),
6439 return error_mark_node
;
6441 if (!at_least_as_qualified_p (TREE_TYPE (type
), expr_type
))
6443 if (complain
& tf_error
)
6444 error ("%qE is not a valid template argument for type %qT "
6445 "because of conflicts in cv-qualification", expr
, type
);
6449 if (!real_lvalue_p (expr
))
6451 if (complain
& tf_error
)
6452 error ("%qE is not a valid template argument for type %qT "
6453 "because it is not an lvalue", expr
, type
);
6457 /* [temp.arg.nontype]/1
6459 A template-argument for a non-type, non-template template-parameter
6460 shall be one of: [...]
6462 -- the address of an object or function with external linkage. */
6463 if (INDIRECT_REF_P (expr
)
6464 && TYPE_REF_OBJ_P (TREE_TYPE (TREE_OPERAND (expr
, 0))))
6466 expr
= TREE_OPERAND (expr
, 0);
6469 if (complain
& tf_error
)
6470 error ("%q#D is not a valid template argument for type %qT "
6471 "because a reference variable does not have a constant "
6472 "address", expr
, type
);
6479 if (complain
& tf_error
)
6480 error ("%qE is not a valid template argument for type %qT "
6481 "because it is not an object with linkage",
6486 /* DR 1155 allows internal linkage in C++11 and up. */
6487 linkage_kind linkage
= decl_linkage (expr
);
6488 if (linkage
< (cxx_dialect
>= cxx11
? lk_internal
: lk_external
))
6490 if (complain
& tf_error
)
6491 error ("%qE is not a valid template argument for type %qT "
6492 "because object %qD does not have linkage",
6497 expr
= build_nop (type
, build_address (expr
));
6499 /* [temp.arg.nontype]/5, bullet 4
6501 For a non-type template-parameter of type pointer to function, only
6502 the function-to-pointer conversion (_conv.func_) is applied. If the
6503 template-argument represents a set of overloaded functions (or a
6504 pointer to such), the matching function is selected from the set
6506 else if (TYPE_PTRFN_P (type
))
6508 /* If the argument is a template-id, we might not have enough
6509 context information to decay the pointer. */
6510 if (!type_unknown_p (expr_type
))
6512 expr
= decay_conversion (expr
, complain
);
6513 if (expr
== error_mark_node
)
6514 return error_mark_node
;
6517 if (cxx_dialect
>= cxx11
&& integer_zerop (expr
))
6518 /* Null pointer values are OK in C++11. */
6519 return perform_qualification_conversions (type
, expr
);
6521 expr
= convert_nontype_argument_function (type
, expr
, complain
);
6522 if (!expr
|| expr
== error_mark_node
)
6525 /* [temp.arg.nontype]/5, bullet 5
6527 For a non-type template-parameter of type reference to function, no
6528 conversions apply. If the template-argument represents a set of
6529 overloaded functions, the matching function is selected from the set
6531 else if (TYPE_REFFN_P (type
))
6533 if (TREE_CODE (expr
) == ADDR_EXPR
)
6535 if (complain
& tf_error
)
6537 error ("%qE is not a valid template argument for type %qT "
6538 "because it is a pointer", expr
, type
);
6539 inform (input_location
, "try using %qE instead",
6540 TREE_OPERAND (expr
, 0));
6545 expr
= convert_nontype_argument_function (type
, expr
, complain
);
6546 if (!expr
|| expr
== error_mark_node
)
6549 expr
= build_nop (type
, build_address (expr
));
6551 /* [temp.arg.nontype]/5, bullet 6
6553 For a non-type template-parameter of type pointer to member function,
6554 no conversions apply. If the template-argument represents a set of
6555 overloaded member functions, the matching member function is selected
6556 from the set (_over.over_). */
6557 else if (TYPE_PTRMEMFUNC_P (type
))
6559 expr
= instantiate_type (type
, expr
, tf_none
);
6560 if (expr
== error_mark_node
)
6561 return error_mark_node
;
6563 /* [temp.arg.nontype] bullet 1 says the pointer to member
6564 expression must be a pointer-to-member constant. */
6565 if (!check_valid_ptrmem_cst_expr (type
, expr
, complain
))
6566 return error_mark_node
;
6568 /* There is no way to disable standard conversions in
6569 resolve_address_of_overloaded_function (called by
6570 instantiate_type). It is possible that the call succeeded by
6571 converting &B::I to &D::I (where B is a base of D), so we need
6572 to reject this conversion here.
6574 Actually, even if there was a way to disable standard conversions,
6575 it would still be better to reject them here so that we can
6576 provide a superior diagnostic. */
6577 if (!same_type_p (TREE_TYPE (expr
), type
))
6579 if (complain
& tf_error
)
6581 error ("%qE is not a valid template argument for type %qT "
6582 "because it is of type %qT", expr
, type
,
6584 /* If we are just one standard conversion off, explain. */
6585 if (can_convert_standard (type
, TREE_TYPE (expr
), complain
))
6586 inform (input_location
,
6587 "standard conversions are not allowed in this context");
6592 /* [temp.arg.nontype]/5, bullet 7
6594 For a non-type template-parameter of type pointer to data member,
6595 qualification conversions (_conv.qual_) are applied. */
6596 else if (TYPE_PTRDATAMEM_P (type
))
6598 /* [temp.arg.nontype] bullet 1 says the pointer to member
6599 expression must be a pointer-to-member constant. */
6600 if (!check_valid_ptrmem_cst_expr (type
, expr
, complain
))
6601 return error_mark_node
;
6603 expr
= perform_qualification_conversions (type
, expr
);
6604 if (expr
== error_mark_node
)
6607 else if (NULLPTR_TYPE_P (type
))
6609 if (expr
!= nullptr_node
)
6611 if (complain
& tf_error
)
6612 error ("%qE is not a valid template argument for type %qT "
6613 "because it is of type %qT", expr
, type
, TREE_TYPE (expr
));
6618 /* A template non-type parameter must be one of the above. */
6622 /* Sanity check: did we actually convert the argument to the
6624 gcc_assert (same_type_ignoring_top_level_qualifiers_p
6625 (type
, TREE_TYPE (expr
)));
6626 return convert_from_reference (expr
);
6629 /* Subroutine of coerce_template_template_parms, which returns 1 if
6630 PARM_PARM and ARG_PARM match using the rule for the template
6631 parameters of template template parameters. Both PARM and ARG are
6632 template parameters; the rest of the arguments are the same as for
6633 coerce_template_template_parms.
6636 coerce_template_template_parm (tree parm
,
6638 tsubst_flags_t complain
,
6642 if (arg
== NULL_TREE
|| error_operand_p (arg
)
6643 || parm
== NULL_TREE
|| error_operand_p (parm
))
6646 if (TREE_CODE (arg
) != TREE_CODE (parm
))
6649 switch (TREE_CODE (parm
))
6652 /* We encounter instantiations of templates like
6653 template <template <template <class> class> class TT>
6656 tree parmparm
= DECL_INNERMOST_TEMPLATE_PARMS (parm
);
6657 tree argparm
= DECL_INNERMOST_TEMPLATE_PARMS (arg
);
6659 if (!coerce_template_template_parms
6660 (parmparm
, argparm
, complain
, in_decl
, outer_args
))
6666 if (TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (arg
))
6667 && !TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (parm
)))
6668 /* Argument is a parameter pack but parameter is not. */
6673 /* The tsubst call is used to handle cases such as
6675 template <int> class C {};
6676 template <class T, template <T> class TT> class D {};
6679 i.e. the parameter list of TT depends on earlier parameters. */
6680 if (!uses_template_parms (TREE_TYPE (arg
)))
6682 tree t
= tsubst (TREE_TYPE (parm
), outer_args
, complain
, in_decl
);
6683 if (!uses_template_parms (t
)
6684 && !same_type_p (t
, TREE_TYPE (arg
)))
6688 if (TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (arg
))
6689 && !TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm
)))
6690 /* Argument is a parameter pack but parameter is not. */
6703 /* Return 1 if PARM_PARMS and ARG_PARMS matches using rule for
6704 template template parameters. Both PARM_PARMS and ARG_PARMS are
6705 vectors of TREE_LIST nodes containing TYPE_DECL, TEMPLATE_DECL
6708 Consider the example:
6709 template <class T> class A;
6710 template<template <class U> class TT> class B;
6712 For B<A>, PARM_PARMS are the parameters to TT, while ARG_PARMS are
6713 the parameters to A, and OUTER_ARGS contains A. */
6716 coerce_template_template_parms (tree parm_parms
,
6718 tsubst_flags_t complain
,
6722 int nparms
, nargs
, i
;
6726 gcc_assert (TREE_CODE (parm_parms
) == TREE_VEC
);
6727 gcc_assert (TREE_CODE (arg_parms
) == TREE_VEC
);
6729 nparms
= TREE_VEC_LENGTH (parm_parms
);
6730 nargs
= TREE_VEC_LENGTH (arg_parms
);
6732 /* Determine whether we have a parameter pack at the end of the
6733 template template parameter's template parameter list. */
6734 if (TREE_VEC_ELT (parm_parms
, nparms
- 1) != error_mark_node
)
6736 parm
= TREE_VALUE (TREE_VEC_ELT (parm_parms
, nparms
- 1));
6738 if (error_operand_p (parm
))
6741 switch (TREE_CODE (parm
))
6745 if (TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (parm
)))
6750 if (TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm
)))
6760 && !(variadic_p
&& nargs
>= nparms
- 1))
6763 /* Check all of the template parameters except the parameter pack at
6764 the end (if any). */
6765 for (i
= 0; i
< nparms
- variadic_p
; ++i
)
6767 if (TREE_VEC_ELT (parm_parms
, i
) == error_mark_node
6768 || TREE_VEC_ELT (arg_parms
, i
) == error_mark_node
)
6771 parm
= TREE_VALUE (TREE_VEC_ELT (parm_parms
, i
));
6772 arg
= TREE_VALUE (TREE_VEC_ELT (arg_parms
, i
));
6774 if (!coerce_template_template_parm (parm
, arg
, complain
, in_decl
,
6782 /* Check each of the template parameters in the template
6783 argument against the template parameter pack at the end of
6784 the template template parameter. */
6785 if (TREE_VEC_ELT (parm_parms
, i
) == error_mark_node
)
6788 parm
= TREE_VALUE (TREE_VEC_ELT (parm_parms
, i
));
6790 for (; i
< nargs
; ++i
)
6792 if (TREE_VEC_ELT (arg_parms
, i
) == error_mark_node
)
6795 arg
= TREE_VALUE (TREE_VEC_ELT (arg_parms
, i
));
6797 if (!coerce_template_template_parm (parm
, arg
, complain
, in_decl
,
6806 /* Verifies that the deduced template arguments (in TARGS) for the
6807 template template parameters (in TPARMS) represent valid bindings,
6808 by comparing the template parameter list of each template argument
6809 to the template parameter list of its corresponding template
6810 template parameter, in accordance with DR150. This
6811 routine can only be called after all template arguments have been
6812 deduced. It will return TRUE if all of the template template
6813 parameter bindings are okay, FALSE otherwise. */
6815 template_template_parm_bindings_ok_p (tree tparms
, tree targs
)
6817 int i
, ntparms
= TREE_VEC_LENGTH (tparms
);
6820 /* We're dealing with template parms in this process. */
6821 ++processing_template_decl
;
6823 targs
= INNERMOST_TEMPLATE_ARGS (targs
);
6825 for (i
= 0; i
< ntparms
; ++i
)
6827 tree tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, i
));
6828 tree targ
= TREE_VEC_ELT (targs
, i
);
6830 if (TREE_CODE (tparm
) == TEMPLATE_DECL
&& targ
)
6832 tree packed_args
= NULL_TREE
;
6835 if (ARGUMENT_PACK_P (targ
))
6837 /* Look inside the argument pack. */
6838 packed_args
= ARGUMENT_PACK_ARGS (targ
);
6839 len
= TREE_VEC_LENGTH (packed_args
);
6842 for (idx
= 0; idx
< len
; ++idx
)
6844 tree targ_parms
= NULL_TREE
;
6847 /* Extract the next argument from the argument
6849 targ
= TREE_VEC_ELT (packed_args
, idx
);
6851 if (PACK_EXPANSION_P (targ
))
6852 /* Look at the pattern of the pack expansion. */
6853 targ
= PACK_EXPANSION_PATTERN (targ
);
6855 /* Extract the template parameters from the template
6857 if (TREE_CODE (targ
) == TEMPLATE_DECL
)
6858 targ_parms
= DECL_INNERMOST_TEMPLATE_PARMS (targ
);
6859 else if (TREE_CODE (targ
) == TEMPLATE_TEMPLATE_PARM
)
6860 targ_parms
= DECL_INNERMOST_TEMPLATE_PARMS (TYPE_NAME (targ
));
6862 /* Verify that we can coerce the template template
6863 parameters from the template argument to the template
6864 parameter. This requires an exact match. */
6866 && !coerce_template_template_parms
6867 (DECL_INNERMOST_TEMPLATE_PARMS (tparm
),
6882 --processing_template_decl
;
6886 /* Since type attributes aren't mangled, we need to strip them from
6887 template type arguments. */
6890 canonicalize_type_argument (tree arg
, tsubst_flags_t complain
)
6892 if (!arg
|| arg
== error_mark_node
|| arg
== TYPE_CANONICAL (arg
))
6894 bool removed_attributes
= false;
6895 tree canon
= strip_typedefs (arg
, &removed_attributes
);
6896 if (removed_attributes
6897 && (complain
& tf_warning
))
6898 warning (0, "ignoring attributes on template argument %qT", arg
);
6902 // A template declaration can be substituted for a constrained
6903 // template template parameter only when the argument is more
6904 // constrained than the parameter.
6906 is_compatible_template_arg (tree parm
, tree arg
)
6908 tree parm_cons
= get_constraints (parm
);
6910 /* For now, allow constrained template template arguments
6911 and unconstrained template template parameters. */
6912 if (parm_cons
== NULL_TREE
)
6915 tree arg_cons
= get_constraints (arg
);
6917 // If the template parameter is constrained, we need to rewrite its
6918 // constraints in terms of the ARG's template parameters. This ensures
6919 // that all of the template parameter types will have the same depth.
6921 // Note that this is only valid when coerce_template_template_parm is
6922 // true for the innermost template parameters of PARM and ARG. In other
6923 // words, because coercion is successful, this conversion will be valid.
6926 tree args
= template_parms_to_args (DECL_TEMPLATE_PARMS (arg
));
6927 parm_cons
= tsubst_constraint_info (parm_cons
,
6928 INNERMOST_TEMPLATE_ARGS (args
),
6929 tf_none
, NULL_TREE
);
6930 if (parm_cons
== error_mark_node
)
6934 return subsumes (parm_cons
, arg_cons
);
6937 // Convert a placeholder argument into a binding to the original
6938 // parameter. The original parameter is saved as the TREE_TYPE of
6941 convert_wildcard_argument (tree parm
, tree arg
)
6943 TREE_TYPE (arg
) = parm
;
6947 /* Convert the indicated template ARG as necessary to match the
6948 indicated template PARM. Returns the converted ARG, or
6949 error_mark_node if the conversion was unsuccessful. Error and
6950 warning messages are issued under control of COMPLAIN. This
6951 conversion is for the Ith parameter in the parameter list. ARGS is
6952 the full set of template arguments deduced so far. */
6955 convert_template_argument (tree parm
,
6958 tsubst_flags_t complain
,
6964 int is_type
, requires_type
, is_tmpl_type
, requires_tmpl_type
;
6966 if (parm
== error_mark_node
)
6967 return error_mark_node
;
6969 /* Trivially convert placeholders. */
6970 if (TREE_CODE (arg
) == WILDCARD_DECL
)
6971 return convert_wildcard_argument (parm
, arg
);
6973 if (TREE_CODE (arg
) == TREE_LIST
6974 && TREE_CODE (TREE_VALUE (arg
)) == OFFSET_REF
)
6976 /* The template argument was the name of some
6977 member function. That's usually
6978 invalid, but static members are OK. In any
6979 case, grab the underlying fields/functions
6980 and issue an error later if required. */
6981 orig_arg
= TREE_VALUE (arg
);
6982 TREE_TYPE (arg
) = unknown_type_node
;
6987 requires_tmpl_type
= TREE_CODE (parm
) == TEMPLATE_DECL
;
6988 requires_type
= (TREE_CODE (parm
) == TYPE_DECL
6989 || requires_tmpl_type
);
6991 /* When determining whether an argument pack expansion is a template,
6992 look at the pattern. */
6993 if (TREE_CODE (arg
) == TYPE_PACK_EXPANSION
)
6994 arg
= PACK_EXPANSION_PATTERN (arg
);
6996 /* Deal with an injected-class-name used as a template template arg. */
6997 if (requires_tmpl_type
&& CLASS_TYPE_P (arg
))
6999 tree t
= maybe_get_template_decl_from_type_decl (TYPE_NAME (arg
));
7000 if (TREE_CODE (t
) == TEMPLATE_DECL
)
7002 if (cxx_dialect
>= cxx11
)
7003 /* OK under DR 1004. */;
7004 else if (complain
& tf_warning_or_error
)
7005 pedwarn (input_location
, OPT_Wpedantic
, "injected-class-name %qD"
7006 " used as template template argument", TYPE_NAME (arg
));
7007 else if (flag_pedantic_errors
)
7015 ((TREE_CODE (arg
) == TEMPLATE_DECL
7016 && TREE_CODE (DECL_TEMPLATE_RESULT (arg
)) == TYPE_DECL
)
7017 || (requires_tmpl_type
&& TREE_CODE (arg
) == TYPE_ARGUMENT_PACK
)
7018 || TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
7019 || TREE_CODE (arg
) == UNBOUND_CLASS_TEMPLATE
);
7022 && (TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
7023 || TREE_CODE (arg
) == UNBOUND_CLASS_TEMPLATE
))
7024 arg
= TYPE_STUB_DECL (arg
);
7026 is_type
= TYPE_P (arg
) || is_tmpl_type
;
7028 if (requires_type
&& ! is_type
&& TREE_CODE (arg
) == SCOPE_REF
7029 && TREE_CODE (TREE_OPERAND (arg
, 0)) == TEMPLATE_TYPE_PARM
)
7031 if (TREE_CODE (TREE_OPERAND (arg
, 1)) == BIT_NOT_EXPR
)
7033 if (complain
& tf_error
)
7034 error ("invalid use of destructor %qE as a type", orig_arg
);
7035 return error_mark_node
;
7038 permerror (input_location
,
7039 "to refer to a type member of a template parameter, "
7040 "use %<typename %E%>", orig_arg
);
7042 orig_arg
= make_typename_type (TREE_OPERAND (arg
, 0),
7043 TREE_OPERAND (arg
, 1),
7049 if (is_type
!= requires_type
)
7053 if (complain
& tf_error
)
7055 error ("type/value mismatch at argument %d in template "
7056 "parameter list for %qD",
7059 inform (input_location
,
7060 " expected a constant of type %qT, got %qT",
7062 (DECL_P (arg
) ? DECL_NAME (arg
) : orig_arg
));
7063 else if (requires_tmpl_type
)
7064 inform (input_location
,
7065 " expected a class template, got %qE", orig_arg
);
7067 inform (input_location
,
7068 " expected a type, got %qE", orig_arg
);
7071 return error_mark_node
;
7073 if (is_tmpl_type
^ requires_tmpl_type
)
7075 if (in_decl
&& (complain
& tf_error
))
7077 error ("type/value mismatch at argument %d in template "
7078 "parameter list for %qD",
7081 inform (input_location
,
7082 " expected a type, got %qT", DECL_NAME (arg
));
7084 inform (input_location
,
7085 " expected a class template, got %qT", orig_arg
);
7087 return error_mark_node
;
7092 if (requires_tmpl_type
)
7094 if (template_parameter_pack_p (parm
) && ARGUMENT_PACK_P (orig_arg
))
7096 else if (TREE_CODE (TREE_TYPE (arg
)) == UNBOUND_CLASS_TEMPLATE
)
7097 /* The number of argument required is not known yet.
7098 Just accept it for now. */
7099 val
= TREE_TYPE (arg
);
7102 tree parmparm
= DECL_INNERMOST_TEMPLATE_PARMS (parm
);
7105 /* Strip alias templates that are equivalent to another
7107 arg
= get_underlying_template (arg
);
7108 argparm
= DECL_INNERMOST_TEMPLATE_PARMS (arg
);
7110 if (coerce_template_template_parms (parmparm
, argparm
,
7116 /* TEMPLATE_TEMPLATE_PARM node is preferred over
7118 if (val
!= error_mark_node
)
7120 if (DECL_TEMPLATE_TEMPLATE_PARM_P (val
))
7121 val
= TREE_TYPE (val
);
7122 if (TREE_CODE (orig_arg
) == TYPE_PACK_EXPANSION
)
7123 val
= make_pack_expansion (val
);
7128 if (in_decl
&& (complain
& tf_error
))
7130 error ("type/value mismatch at argument %d in "
7131 "template parameter list for %qD",
7133 inform (input_location
,
7134 " expected a template of type %qD, got %qT",
7138 val
= error_mark_node
;
7141 // Check that the constraints are compatible before allowing the
7143 if (val
!= error_mark_node
)
7144 if (!is_compatible_template_arg (parm
, arg
))
7146 if (in_decl
&& (complain
& tf_error
))
7148 error ("constraint mismatch at argument %d in "
7149 "template parameter list for %qD",
7151 inform (input_location
, " expected %qD but got %qD",
7154 val
= error_mark_node
;
7160 /* We only form one instance of each template specialization.
7161 Therefore, if we use a non-canonical variant (i.e., a
7162 typedef), any future messages referring to the type will use
7163 the typedef, which is confusing if those future uses do not
7164 themselves also use the typedef. */
7166 val
= canonicalize_type_argument (val
, complain
);
7170 tree t
= tsubst (TREE_TYPE (parm
), args
, complain
, in_decl
);
7172 if (invalid_nontype_parm_type_p (t
, complain
))
7173 return error_mark_node
;
7175 if (template_parameter_pack_p (parm
) && ARGUMENT_PACK_P (orig_arg
))
7177 if (same_type_p (t
, TREE_TYPE (orig_arg
)))
7181 /* Not sure if this is reachable, but it doesn't hurt
7183 error ("type mismatch in nontype parameter pack");
7184 val
= error_mark_node
;
7187 else if (!dependent_template_arg_p (orig_arg
)
7188 && !uses_template_parms (t
))
7189 /* We used to call digest_init here. However, digest_init
7190 will report errors, which we don't want when complain
7191 is zero. More importantly, digest_init will try too
7192 hard to convert things: for example, `0' should not be
7193 converted to pointer type at this point according to
7194 the standard. Accepting this is not merely an
7195 extension, since deciding whether or not these
7196 conversions can occur is part of determining which
7197 function template to call, or whether a given explicit
7198 argument specification is valid. */
7199 val
= convert_nontype_argument (t
, orig_arg
, complain
);
7202 bool removed_attr
= false;
7203 val
= strip_typedefs_expr (orig_arg
, &removed_attr
);
7206 if (val
== NULL_TREE
)
7207 val
= error_mark_node
;
7208 else if (val
== error_mark_node
&& (complain
& tf_error
))
7209 error ("could not convert template argument %qE to %qT", orig_arg
, t
);
7211 if (INDIRECT_REF_P (val
))
7213 /* Reject template arguments that are references to built-in
7214 functions with no library fallbacks. */
7215 const_tree inner
= TREE_OPERAND (val
, 0);
7216 if (TREE_CODE (TREE_TYPE (inner
)) == REFERENCE_TYPE
7217 && TREE_CODE (TREE_TYPE (TREE_TYPE (inner
))) == FUNCTION_TYPE
7218 && TREE_CODE (TREE_TYPE (inner
)) == REFERENCE_TYPE
7219 && reject_gcc_builtin (TREE_OPERAND (inner
, 0)))
7220 return error_mark_node
;
7223 if (TREE_CODE (val
) == SCOPE_REF
)
7225 /* Strip typedefs from the SCOPE_REF. */
7226 tree type
= canonicalize_type_argument (TREE_TYPE (val
), complain
);
7227 tree scope
= canonicalize_type_argument (TREE_OPERAND (val
, 0),
7229 val
= build_qualified_name (type
, scope
, TREE_OPERAND (val
, 1),
7230 QUALIFIED_NAME_IS_TEMPLATE (val
));
7237 /* Coerces the remaining template arguments in INNER_ARGS (from
7238 ARG_IDX to the end) into the parameter pack at PARM_IDX in PARMS.
7239 Returns the coerced argument pack. PARM_IDX is the position of this
7240 parameter in the template parameter list. ARGS is the original
7241 template argument list. */
7243 coerce_template_parameter_pack (tree parms
,
7251 tsubst_flags_t complain
)
7253 tree parm
= TREE_VEC_ELT (parms
, parm_idx
);
7254 int nargs
= inner_args
? NUM_TMPL_ARGS (inner_args
) : 0;
7257 tree packed_parms
= NULL_TREE
;
7259 if (arg_idx
> nargs
)
7262 if (tree packs
= fixed_parameter_pack_p (TREE_VALUE (parm
)))
7264 /* When the template parameter is a non-type template parameter pack
7265 or template template parameter pack whose type or template
7266 parameters use parameter packs, we know exactly how many arguments
7267 we are looking for. Build a vector of the instantiated decls for
7268 these template parameters in PACKED_PARMS. */
7269 /* We can't use make_pack_expansion here because it would interpret a
7270 _DECL as a use rather than a declaration. */
7271 tree decl
= TREE_VALUE (parm
);
7272 tree exp
= cxx_make_type (TYPE_PACK_EXPANSION
);
7273 SET_PACK_EXPANSION_PATTERN (exp
, decl
);
7274 PACK_EXPANSION_PARAMETER_PACKS (exp
) = packs
;
7275 SET_TYPE_STRUCTURAL_EQUALITY (exp
);
7277 TREE_VEC_LENGTH (args
)--;
7278 packed_parms
= tsubst_pack_expansion (exp
, args
, complain
, decl
);
7279 TREE_VEC_LENGTH (args
)++;
7281 if (packed_parms
== error_mark_node
)
7282 return error_mark_node
;
7284 /* If we're doing a partial instantiation of a member template,
7285 verify that all of the types used for the non-type
7286 template parameter pack are, in fact, valid for non-type
7287 template parameters. */
7289 && PACK_EXPANSION_P (TREE_VEC_ELT (inner_args
, arg_idx
)))
7291 int j
, len
= TREE_VEC_LENGTH (packed_parms
);
7292 for (j
= 0; j
< len
; ++j
)
7294 tree t
= TREE_TYPE (TREE_VEC_ELT (packed_parms
, j
));
7295 if (invalid_nontype_parm_type_p (t
, complain
))
7296 return error_mark_node
;
7298 /* We don't know how many args we have yet, just
7299 use the unconverted ones for now. */
7303 packed_args
= make_tree_vec (TREE_VEC_LENGTH (packed_parms
));
7305 /* Check if we have a placeholder pack, which indicates we're
7306 in the context of a introduction list. In that case we want
7307 to match this pack to the single placeholder. */
7308 else if (arg_idx
< nargs
7309 && TREE_CODE (TREE_VEC_ELT (inner_args
, arg_idx
)) == WILDCARD_DECL
7310 && WILDCARD_PACK_P (TREE_VEC_ELT (inner_args
, arg_idx
)))
7312 nargs
= arg_idx
+ 1;
7313 packed_args
= make_tree_vec (1);
7316 packed_args
= make_tree_vec (nargs
- arg_idx
);
7318 /* Convert the remaining arguments, which will be a part of the
7319 parameter pack "parm". */
7320 for (; arg_idx
< nargs
; ++arg_idx
)
7322 tree arg
= TREE_VEC_ELT (inner_args
, arg_idx
);
7323 tree actual_parm
= TREE_VALUE (parm
);
7324 int pack_idx
= arg_idx
- parm_idx
;
7328 /* Once we've packed as many args as we have types, stop. */
7329 if (pack_idx
>= TREE_VEC_LENGTH (packed_parms
))
7331 else if (PACK_EXPANSION_P (arg
))
7332 /* We don't know how many args we have yet, just
7333 use the unconverted ones for now. */
7336 actual_parm
= TREE_VEC_ELT (packed_parms
, pack_idx
);
7339 if (arg
== error_mark_node
)
7341 if (complain
& tf_error
)
7342 error ("template argument %d is invalid", arg_idx
+ 1);
7345 arg
= convert_template_argument (actual_parm
,
7346 arg
, new_args
, complain
, parm_idx
,
7348 if (arg
== error_mark_node
)
7350 TREE_VEC_ELT (packed_args
, pack_idx
) = arg
;
7353 if (arg_idx
- parm_idx
< TREE_VEC_LENGTH (packed_args
)
7354 && TREE_VEC_LENGTH (packed_args
) > 0)
7356 if (complain
& tf_error
)
7357 error ("wrong number of template arguments (%d, should be %d)",
7358 arg_idx
- parm_idx
, TREE_VEC_LENGTH (packed_args
));
7359 return error_mark_node
;
7362 if (TREE_CODE (TREE_VALUE (parm
)) == TYPE_DECL
7363 || TREE_CODE (TREE_VALUE (parm
)) == TEMPLATE_DECL
)
7364 argument_pack
= cxx_make_type (TYPE_ARGUMENT_PACK
);
7367 argument_pack
= make_node (NONTYPE_ARGUMENT_PACK
);
7368 TREE_TYPE (argument_pack
)
7369 = tsubst (TREE_TYPE (TREE_VALUE (parm
)), new_args
, complain
, in_decl
);
7370 TREE_CONSTANT (argument_pack
) = 1;
7373 SET_ARGUMENT_PACK_ARGS (argument_pack
, packed_args
);
7374 #ifdef ENABLE_CHECKING
7375 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (packed_args
,
7376 TREE_VEC_LENGTH (packed_args
));
7378 return argument_pack
;
7381 /* Returns the number of pack expansions in the template argument vector
7385 pack_expansion_args_count (tree args
)
7390 for (i
= 0; i
< TREE_VEC_LENGTH (args
); ++i
)
7392 tree elt
= TREE_VEC_ELT (args
, i
);
7393 if (elt
&& PACK_EXPANSION_P (elt
))
7399 /* Convert all template arguments to their appropriate types, and
7400 return a vector containing the innermost resulting template
7401 arguments. If any error occurs, return error_mark_node. Error and
7402 warning messages are issued under control of COMPLAIN.
7404 If REQUIRE_ALL_ARGS is false, argument deduction will be performed
7405 for arguments not specified in ARGS. Otherwise, if
7406 USE_DEFAULT_ARGS is true, default arguments will be used to fill in
7407 unspecified arguments. If REQUIRE_ALL_ARGS is true, but
7408 USE_DEFAULT_ARGS is false, then all arguments must be specified in
7412 coerce_template_parms (tree parms
,
7415 tsubst_flags_t complain
,
7416 bool require_all_args
,
7417 bool use_default_args
)
7419 int nparms
, nargs
, parm_idx
, arg_idx
, lost
= 0;
7420 tree orig_inner_args
;
7423 tree new_inner_args
;
7424 int saved_unevaluated_operand
;
7425 int saved_inhibit_evaluation_warnings
;
7427 /* When used as a boolean value, indicates whether this is a
7428 variadic template parameter list. Since it's an int, we can also
7429 subtract it from nparms to get the number of non-variadic
7432 int variadic_args_p
= 0;
7433 int post_variadic_parms
= 0;
7435 /* Likewise for parameters with default arguments. */
7438 if (args
== error_mark_node
)
7439 return error_mark_node
;
7441 nparms
= TREE_VEC_LENGTH (parms
);
7443 /* Determine if there are any parameter packs or default arguments. */
7444 for (parm_idx
= 0; parm_idx
< nparms
; ++parm_idx
)
7446 tree parm
= TREE_VEC_ELT (parms
, parm_idx
);
7448 ++post_variadic_parms
;
7449 if (template_parameter_pack_p (TREE_VALUE (parm
)))
7451 if (TREE_PURPOSE (parm
))
7455 inner_args
= orig_inner_args
= INNERMOST_TEMPLATE_ARGS (args
);
7456 /* If there are no parameters that follow a parameter pack, we need to
7457 expand any argument packs so that we can deduce a parameter pack from
7458 some non-packed args followed by an argument pack, as in variadic85.C.
7459 If there are such parameters, we need to leave argument packs intact
7460 so the arguments are assigned properly. This can happen when dealing
7461 with a nested class inside a partial specialization of a class
7462 template, as in variadic92.C, or when deducing a template parameter pack
7463 from a sub-declarator, as in variadic114.C. */
7464 if (!post_variadic_parms
)
7465 inner_args
= expand_template_argument_pack (inner_args
);
7467 /* Count any pack expansion args. */
7468 variadic_args_p
= pack_expansion_args_count (inner_args
);
7470 nargs
= inner_args
? NUM_TMPL_ARGS (inner_args
) : 0;
7471 if ((nargs
> nparms
&& !variadic_p
)
7472 || (nargs
< nparms
- variadic_p
7475 && (!use_default_args
7476 || (TREE_VEC_ELT (parms
, nargs
) != error_mark_node
7477 && !TREE_PURPOSE (TREE_VEC_ELT (parms
, nargs
))))))
7479 if (complain
& tf_error
)
7481 if (variadic_p
|| default_p
)
7483 nparms
-= variadic_p
+ default_p
;
7484 error ("wrong number of template arguments "
7485 "(%d, should be at least %d)", nargs
, nparms
);
7488 error ("wrong number of template arguments "
7489 "(%d, should be %d)", nargs
, nparms
);
7492 inform (DECL_SOURCE_LOCATION (in_decl
),
7493 "provided for %qD", in_decl
);
7496 return error_mark_node
;
7498 /* We can't pass a pack expansion to a non-pack parameter of an alias
7499 template (DR 1430). */
7501 && (DECL_ALIAS_TEMPLATE_P (in_decl
)
7502 || concept_template_p (in_decl
))
7504 && nargs
- variadic_args_p
< nparms
- variadic_p
)
7506 if (complain
& tf_error
)
7508 for (int i
= 0; i
< TREE_VEC_LENGTH (inner_args
); ++i
)
7510 tree arg
= TREE_VEC_ELT (inner_args
, i
);
7511 tree parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
7513 if (PACK_EXPANSION_P (arg
)
7514 && !template_parameter_pack_p (parm
))
7516 if (DECL_ALIAS_TEMPLATE_P (in_decl
))
7517 error_at (location_of (arg
),
7518 "pack expansion argument for non-pack parameter "
7519 "%qD of alias template %qD", parm
, in_decl
);
7521 error_at (location_of (arg
),
7522 "pack expansion argument for non-pack parameter "
7523 "%qD of concept %qD", parm
, in_decl
);
7524 inform (DECL_SOURCE_LOCATION (parm
), "declared here");
7531 return error_mark_node
;
7534 /* We need to evaluate the template arguments, even though this
7535 template-id may be nested within a "sizeof". */
7536 saved_unevaluated_operand
= cp_unevaluated_operand
;
7537 cp_unevaluated_operand
= 0;
7538 saved_inhibit_evaluation_warnings
= c_inhibit_evaluation_warnings
;
7539 c_inhibit_evaluation_warnings
= 0;
7540 new_inner_args
= make_tree_vec (nparms
);
7541 new_args
= add_outermost_template_args (args
, new_inner_args
);
7542 int pack_adjust
= 0;
7543 for (parm_idx
= 0, arg_idx
= 0; parm_idx
< nparms
; parm_idx
++, arg_idx
++)
7548 /* Get the Ith template parameter. */
7549 parm
= TREE_VEC_ELT (parms
, parm_idx
);
7551 if (parm
== error_mark_node
)
7553 TREE_VEC_ELT (new_inner_args
, arg_idx
) = error_mark_node
;
7557 /* Calculate the next argument. */
7558 if (arg_idx
< nargs
)
7559 arg
= TREE_VEC_ELT (inner_args
, arg_idx
);
7563 if (template_parameter_pack_p (TREE_VALUE (parm
))
7564 && !(arg
&& ARGUMENT_PACK_P (arg
)))
7566 /* Some arguments will be placed in the
7567 template parameter pack PARM. */
7568 arg
= coerce_template_parameter_pack (parms
, parm_idx
, args
,
7569 inner_args
, arg_idx
,
7573 if (arg
== NULL_TREE
)
7575 /* We don't know how many args we have yet, just use the
7576 unconverted (and still packed) ones for now. */
7577 new_inner_args
= orig_inner_args
;
7582 TREE_VEC_ELT (new_inner_args
, parm_idx
) = arg
;
7584 /* Store this argument. */
7585 if (arg
== error_mark_node
)
7588 /* We are done with all of the arguments. */
7593 pack_adjust
= TREE_VEC_LENGTH (ARGUMENT_PACK_ARGS (arg
)) - 1;
7594 arg_idx
+= pack_adjust
;
7601 if (PACK_EXPANSION_P (arg
))
7603 /* "If every valid specialization of a variadic template
7604 requires an empty template parameter pack, the template is
7605 ill-formed, no diagnostic required." So check that the
7606 pattern works with this parameter. */
7607 tree pattern
= PACK_EXPANSION_PATTERN (arg
);
7608 tree conv
= convert_template_argument (TREE_VALUE (parm
),
7612 if (conv
== error_mark_node
)
7614 inform (input_location
, "so any instantiation with a "
7615 "non-empty parameter pack would be ill-formed");
7618 else if (TYPE_P (conv
) && !TYPE_P (pattern
))
7619 /* Recover from missing typename. */
7620 TREE_VEC_ELT (inner_args
, arg_idx
)
7621 = make_pack_expansion (conv
);
7623 /* We don't know how many args we have yet, just
7624 use the unconverted ones for now. */
7625 new_inner_args
= inner_args
;
7630 else if (require_all_args
)
7632 /* There must be a default arg in this case. */
7633 arg
= tsubst_template_arg (TREE_PURPOSE (parm
), new_args
,
7635 /* The position of the first default template argument,
7636 is also the number of non-defaulted arguments in NEW_INNER_ARGS.
7638 if (!NON_DEFAULT_TEMPLATE_ARGS_COUNT (new_inner_args
))
7639 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (new_inner_args
,
7640 arg_idx
- pack_adjust
);
7645 if (arg
== error_mark_node
)
7647 if (complain
& tf_error
)
7648 error ("template argument %d is invalid", arg_idx
+ 1);
7651 /* This only occurs if there was an error in the template
7652 parameter list itself (which we would already have
7653 reported) that we are trying to recover from, e.g., a class
7654 template with a parameter list such as
7655 template<typename..., typename>. */
7658 arg
= convert_template_argument (TREE_VALUE (parm
),
7659 arg
, new_args
, complain
,
7662 if (arg
== error_mark_node
)
7664 TREE_VEC_ELT (new_inner_args
, arg_idx
- pack_adjust
) = arg
;
7666 cp_unevaluated_operand
= saved_unevaluated_operand
;
7667 c_inhibit_evaluation_warnings
= saved_inhibit_evaluation_warnings
;
7669 if (variadic_p
&& arg_idx
< nargs
)
7671 if (complain
& tf_error
)
7673 error ("wrong number of template arguments "
7674 "(%d, should be %d)", nargs
, arg_idx
);
7676 error ("provided for %q+D", in_decl
);
7678 return error_mark_node
;
7682 return error_mark_node
;
7684 #ifdef ENABLE_CHECKING
7685 if (!NON_DEFAULT_TEMPLATE_ARGS_COUNT (new_inner_args
))
7686 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (new_inner_args
,
7687 TREE_VEC_LENGTH (new_inner_args
));
7690 return new_inner_args
;
7693 /* Convert all template arguments to their appropriate types, and
7694 return a vector containing the innermost resulting template
7695 arguments. If any error occurs, return error_mark_node. Error and
7696 warning messages are not issued.
7698 Note that no function argument deduction is performed, and default
7699 arguments are used to fill in unspecified arguments. */
7701 coerce_template_parms (tree parms
, tree args
, tree in_decl
)
7703 return coerce_template_parms (parms
, args
, in_decl
, tf_none
, true, true);
7706 /* Convert all template arguments to their appropriate type, and
7707 instantiate default arguments as needed. This returns a vector
7708 containing the innermost resulting template arguments, or
7709 error_mark_node if unsuccessful. */
7711 coerce_template_parms (tree parms
, tree args
, tree in_decl
,
7712 tsubst_flags_t complain
)
7714 return coerce_template_parms (parms
, args
, in_decl
, complain
, true, true);
7717 /* Like coerce_template_parms. If PARMS represents all template
7718 parameters levels, this function returns a vector of vectors
7719 representing all the resulting argument levels. Note that in this
7720 case, only the innermost arguments are coerced because the
7721 outermost ones are supposed to have been coerced already.
7723 Otherwise, if PARMS represents only (the innermost) vector of
7724 parameters, this function returns a vector containing just the
7725 innermost resulting arguments. */
7728 coerce_innermost_template_parms (tree parms
,
7731 tsubst_flags_t complain
,
7732 bool require_all_args
,
7733 bool use_default_args
)
7735 int parms_depth
= TMPL_PARMS_DEPTH (parms
);
7736 int args_depth
= TMPL_ARGS_DEPTH (args
);
7739 if (parms_depth
> 1)
7741 coerced_args
= make_tree_vec (parms_depth
);
7745 for (level
= parms
, cur_depth
= parms_depth
;
7746 parms_depth
> 0 && level
!= NULL_TREE
;
7747 level
= TREE_CHAIN (level
), --cur_depth
)
7750 if (cur_depth
== args_depth
)
7751 l
= coerce_template_parms (TREE_VALUE (level
),
7752 args
, in_decl
, complain
,
7756 l
= TMPL_ARGS_LEVEL (args
, cur_depth
);
7758 if (l
== error_mark_node
)
7759 return error_mark_node
;
7761 SET_TMPL_ARGS_LEVEL (coerced_args
, cur_depth
, l
);
7765 coerced_args
= coerce_template_parms (INNERMOST_TEMPLATE_PARMS (parms
),
7766 args
, in_decl
, complain
,
7769 return coerced_args
;
7772 /* Returns 1 if template args OT and NT are equivalent. */
7775 template_args_equal (tree ot
, tree nt
)
7779 if (nt
== NULL_TREE
|| ot
== NULL_TREE
)
7782 if (TREE_CODE (nt
) == TREE_VEC
)
7783 /* For member templates */
7784 return TREE_CODE (ot
) == TREE_VEC
&& comp_template_args (ot
, nt
);
7785 else if (PACK_EXPANSION_P (ot
))
7786 return (PACK_EXPANSION_P (nt
)
7787 && template_args_equal (PACK_EXPANSION_PATTERN (ot
),
7788 PACK_EXPANSION_PATTERN (nt
))
7789 && template_args_equal (PACK_EXPANSION_EXTRA_ARGS (ot
),
7790 PACK_EXPANSION_EXTRA_ARGS (nt
)));
7791 else if (ARGUMENT_PACK_P (ot
))
7796 if (!ARGUMENT_PACK_P (nt
))
7799 opack
= ARGUMENT_PACK_ARGS (ot
);
7800 npack
= ARGUMENT_PACK_ARGS (nt
);
7801 len
= TREE_VEC_LENGTH (opack
);
7802 if (TREE_VEC_LENGTH (npack
) != len
)
7804 for (i
= 0; i
< len
; ++i
)
7805 if (!template_args_equal (TREE_VEC_ELT (opack
, i
),
7806 TREE_VEC_ELT (npack
, i
)))
7810 else if (ot
&& TREE_CODE (ot
) == ARGUMENT_PACK_SELECT
)
7812 /* We get here probably because we are in the middle of substituting
7813 into the pattern of a pack expansion. In that case the
7814 ARGUMENT_PACK_SELECT temporarily replaces the pack argument we are
7815 interested in. So we want to use the initial pack argument for
7817 ot
= ARGUMENT_PACK_SELECT_FROM_PACK (ot
);
7818 if (nt
&& TREE_CODE (nt
) == ARGUMENT_PACK_SELECT
)
7819 nt
= ARGUMENT_PACK_SELECT_FROM_PACK (nt
);
7820 return template_args_equal (ot
, nt
);
7822 else if (TYPE_P (nt
))
7826 /* Don't treat an alias template specialization with dependent
7827 arguments as equivalent to its underlying type when used as a
7828 template argument; we need them to be distinct so that we
7829 substitute into the specialization arguments at instantiation
7830 time. And aliases can't be equivalent without being ==, so
7831 we don't need to look any deeper. */
7832 if (TYPE_ALIAS_P (nt
) || TYPE_ALIAS_P (ot
))
7835 return same_type_p (ot
, nt
);
7837 else if (TREE_CODE (ot
) == TREE_VEC
|| TYPE_P (ot
))
7841 /* Try to treat a template non-type argument that has been converted
7842 to the parameter type as equivalent to one that hasn't yet. */
7843 for (enum tree_code code1
= TREE_CODE (ot
);
7844 CONVERT_EXPR_CODE_P (code1
)
7845 || code1
== NON_LVALUE_EXPR
;
7846 code1
= TREE_CODE (ot
))
7847 ot
= TREE_OPERAND (ot
, 0);
7848 for (enum tree_code code2
= TREE_CODE (nt
);
7849 CONVERT_EXPR_CODE_P (code2
)
7850 || code2
== NON_LVALUE_EXPR
;
7851 code2
= TREE_CODE (nt
))
7852 nt
= TREE_OPERAND (nt
, 0);
7854 return cp_tree_equal (ot
, nt
);
7858 /* Returns 1 iff the OLDARGS and NEWARGS are in fact identical sets of
7859 template arguments. Returns 0 otherwise, and updates OLDARG_PTR and
7860 NEWARG_PTR with the offending arguments if they are non-NULL. */
7863 comp_template_args_with_info (tree oldargs
, tree newargs
,
7864 tree
*oldarg_ptr
, tree
*newarg_ptr
)
7868 if (oldargs
== newargs
)
7871 if (!oldargs
|| !newargs
)
7874 if (TREE_VEC_LENGTH (oldargs
) != TREE_VEC_LENGTH (newargs
))
7877 for (i
= 0; i
< TREE_VEC_LENGTH (oldargs
); ++i
)
7879 tree nt
= TREE_VEC_ELT (newargs
, i
);
7880 tree ot
= TREE_VEC_ELT (oldargs
, i
);
7882 if (! template_args_equal (ot
, nt
))
7884 if (oldarg_ptr
!= NULL
)
7886 if (newarg_ptr
!= NULL
)
7894 /* Returns 1 iff the OLDARGS and NEWARGS are in fact identical sets
7895 of template arguments. Returns 0 otherwise. */
7898 comp_template_args (tree oldargs
, tree newargs
)
7900 return comp_template_args_with_info (oldargs
, newargs
, NULL
, NULL
);
7904 add_pending_template (tree d
)
7906 tree ti
= (TYPE_P (d
)
7907 ? CLASSTYPE_TEMPLATE_INFO (d
)
7908 : DECL_TEMPLATE_INFO (d
));
7909 struct pending_template
*pt
;
7912 if (TI_PENDING_TEMPLATE_FLAG (ti
))
7915 /* We are called both from instantiate_decl, where we've already had a
7916 tinst_level pushed, and instantiate_template, where we haven't.
7918 level
= !current_tinst_level
|| current_tinst_level
->decl
!= d
;
7921 push_tinst_level (d
);
7923 pt
= ggc_alloc
<pending_template
> ();
7925 pt
->tinst
= current_tinst_level
;
7926 if (last_pending_template
)
7927 last_pending_template
->next
= pt
;
7929 pending_templates
= pt
;
7931 last_pending_template
= pt
;
7933 TI_PENDING_TEMPLATE_FLAG (ti
) = 1;
7940 /* Return a TEMPLATE_ID_EXPR corresponding to the indicated FNS and
7941 ARGLIST. Valid choices for FNS are given in the cp-tree.def
7942 documentation for TEMPLATE_ID_EXPR. */
7945 lookup_template_function (tree fns
, tree arglist
)
7949 if (fns
== error_mark_node
|| arglist
== error_mark_node
)
7950 return error_mark_node
;
7952 gcc_assert (!arglist
|| TREE_CODE (arglist
) == TREE_VEC
);
7954 if (!is_overloaded_fn (fns
) && !identifier_p (fns
))
7956 error ("%q#D is not a function template", fns
);
7957 return error_mark_node
;
7960 if (BASELINK_P (fns
))
7962 BASELINK_FUNCTIONS (fns
) = build2 (TEMPLATE_ID_EXPR
,
7964 BASELINK_FUNCTIONS (fns
),
7969 type
= TREE_TYPE (fns
);
7970 if (TREE_CODE (fns
) == OVERLOAD
|| !type
)
7971 type
= unknown_type_node
;
7973 return build2 (TEMPLATE_ID_EXPR
, type
, fns
, arglist
);
7976 /* Within the scope of a template class S<T>, the name S gets bound
7977 (in build_self_reference) to a TYPE_DECL for the class, not a
7978 TEMPLATE_DECL. If DECL is a TYPE_DECL for current_class_type,
7979 or one of its enclosing classes, and that type is a template,
7980 return the associated TEMPLATE_DECL. Otherwise, the original
7983 Also handle the case when DECL is a TREE_LIST of ambiguous
7984 injected-class-names from different bases. */
7987 maybe_get_template_decl_from_type_decl (tree decl
)
7989 if (decl
== NULL_TREE
)
7992 /* DR 176: A lookup that finds an injected-class-name (10.2
7993 [class.member.lookup]) can result in an ambiguity in certain cases
7994 (for example, if it is found in more than one base class). If all of
7995 the injected-class-names that are found refer to specializations of
7996 the same class template, and if the name is followed by a
7997 template-argument-list, the reference refers to the class template
7998 itself and not a specialization thereof, and is not ambiguous. */
7999 if (TREE_CODE (decl
) == TREE_LIST
)
8001 tree t
, tmpl
= NULL_TREE
;
8002 for (t
= decl
; t
; t
= TREE_CHAIN (t
))
8004 tree elt
= maybe_get_template_decl_from_type_decl (TREE_VALUE (t
));
8007 else if (tmpl
!= elt
)
8010 if (tmpl
&& t
== NULL_TREE
)
8016 return (decl
!= NULL_TREE
8017 && DECL_SELF_REFERENCE_P (decl
)
8018 && CLASSTYPE_TEMPLATE_INFO (TREE_TYPE (decl
)))
8019 ? CLASSTYPE_TI_TEMPLATE (TREE_TYPE (decl
)) : decl
;
8022 /* Given an IDENTIFIER_NODE (or type TEMPLATE_DECL) and a chain of
8023 parameters, find the desired type.
8025 D1 is the PTYPENAME terminal, and ARGLIST is the list of arguments.
8027 IN_DECL, if non-NULL, is the template declaration we are trying to
8030 If ENTERING_SCOPE is nonzero, we are about to enter the scope of
8031 the class we are looking up.
8033 Issue error and warning messages under control of COMPLAIN.
8035 If the template class is really a local class in a template
8036 function, then the FUNCTION_CONTEXT is the function in which it is
8039 ??? Note that this function is currently called *twice* for each
8040 template-id: the first time from the parser, while creating the
8041 incomplete type (finish_template_type), and the second type during the
8042 real instantiation (instantiate_template_class). This is surely something
8043 that we want to avoid. It also causes some problems with argument
8044 coercion (see convert_nontype_argument for more information on this). */
8047 lookup_template_class_1 (tree d1
, tree arglist
, tree in_decl
, tree context
,
8048 int entering_scope
, tsubst_flags_t complain
)
8050 tree templ
= NULL_TREE
, parmlist
;
8057 if (identifier_p (d1
))
8059 tree value
= innermost_non_namespace_value (d1
);
8060 if (value
&& DECL_TEMPLATE_TEMPLATE_PARM_P (value
))
8065 push_decl_namespace (context
);
8066 templ
= lookup_name (d1
);
8067 templ
= maybe_get_template_decl_from_type_decl (templ
);
8069 pop_decl_namespace ();
8072 context
= DECL_CONTEXT (templ
);
8074 else if (TREE_CODE (d1
) == TYPE_DECL
&& MAYBE_CLASS_TYPE_P (TREE_TYPE (d1
)))
8076 tree type
= TREE_TYPE (d1
);
8078 /* If we are declaring a constructor, say A<T>::A<T>, we will get
8079 an implicit typename for the second A. Deal with it. */
8080 if (TREE_CODE (type
) == TYPENAME_TYPE
&& TREE_TYPE (type
))
8081 type
= TREE_TYPE (type
);
8083 if (CLASSTYPE_TEMPLATE_INFO (type
))
8085 templ
= CLASSTYPE_TI_TEMPLATE (type
);
8086 d1
= DECL_NAME (templ
);
8089 else if (TREE_CODE (d1
) == ENUMERAL_TYPE
8090 || (TYPE_P (d1
) && MAYBE_CLASS_TYPE_P (d1
)))
8092 templ
= TYPE_TI_TEMPLATE (d1
);
8093 d1
= DECL_NAME (templ
);
8095 else if (DECL_TYPE_TEMPLATE_P (d1
))
8098 d1
= DECL_NAME (templ
);
8099 context
= DECL_CONTEXT (templ
);
8101 else if (DECL_TEMPLATE_TEMPLATE_PARM_P (d1
))
8104 d1
= DECL_NAME (templ
);
8107 /* Issue an error message if we didn't find a template. */
8110 if (complain
& tf_error
)
8111 error ("%qT is not a template", d1
);
8112 return error_mark_node
;
8115 if (TREE_CODE (templ
) != TEMPLATE_DECL
8116 /* Make sure it's a user visible template, if it was named by
8118 || ((complain
& tf_user
) && !DECL_TEMPLATE_PARM_P (templ
)
8119 && !PRIMARY_TEMPLATE_P (templ
)))
8121 if (complain
& tf_error
)
8123 error ("non-template type %qT used as a template", d1
);
8125 error ("for template declaration %q+D", in_decl
);
8127 return error_mark_node
;
8130 complain
&= ~tf_user
;
8132 /* An alias that just changes the name of a template is equivalent to the
8133 other template, so if any of the arguments are pack expansions, strip
8134 the alias to avoid problems with a pack expansion passed to a non-pack
8135 alias template parameter (DR 1430). */
8136 if (pack_expansion_args_count (INNERMOST_TEMPLATE_ARGS (arglist
)))
8137 templ
= get_underlying_template (templ
);
8139 if (DECL_TEMPLATE_TEMPLATE_PARM_P (templ
))
8141 /* Create a new TEMPLATE_DECL and TEMPLATE_TEMPLATE_PARM node to store
8142 template arguments */
8148 parmlist
= DECL_INNERMOST_TEMPLATE_PARMS (templ
);
8150 /* Consider an example where a template template parameter declared as
8152 template <class T, class U = std::allocator<T> > class TT
8154 The template parameter level of T and U are one level larger than
8155 of TT. To proper process the default argument of U, say when an
8156 instantiation `TT<int>' is seen, we need to build the full
8157 arguments containing {int} as the innermost level. Outer levels,
8158 available when not appearing as default template argument, can be
8159 obtained from the arguments of the enclosing template.
8161 Suppose that TT is later substituted with std::vector. The above
8162 instantiation is `TT<int, std::allocator<T> >' with TT at
8163 level 1, and T at level 2, while the template arguments at level 1
8164 becomes {std::vector} and the inner level 2 is {int}. */
8166 outer
= DECL_CONTEXT (templ
);
8168 outer
= TI_ARGS (get_template_info (DECL_TEMPLATE_RESULT (outer
)));
8169 else if (current_template_parms
)
8171 /* This is an argument of the current template, so we haven't set
8172 DECL_CONTEXT yet. */
8173 tree relevant_template_parms
;
8175 /* Parameter levels that are greater than the level of the given
8176 template template parm are irrelevant. */
8177 relevant_template_parms
= current_template_parms
;
8178 while (TMPL_PARMS_DEPTH (relevant_template_parms
)
8179 != TEMPLATE_TYPE_LEVEL (TREE_TYPE (templ
)))
8180 relevant_template_parms
= TREE_CHAIN (relevant_template_parms
);
8182 outer
= template_parms_to_args (relevant_template_parms
);
8186 arglist
= add_to_template_args (outer
, arglist
);
8188 arglist2
= coerce_template_parms (parmlist
, arglist
, templ
,
8190 /*require_all_args=*/true,
8191 /*use_default_args=*/true);
8192 if (arglist2
== error_mark_node
8193 || (!uses_template_parms (arglist2
)
8194 && check_instantiated_args (templ
, arglist2
, complain
)))
8195 return error_mark_node
;
8197 parm
= bind_template_template_parm (TREE_TYPE (templ
), arglist2
);
8202 tree template_type
= TREE_TYPE (templ
);
8205 tree found
= NULL_TREE
;
8208 int is_dependent_type
;
8209 int use_partial_inst_tmpl
= false;
8211 if (template_type
== error_mark_node
)
8212 /* An error occurred while building the template TEMPL, and a
8213 diagnostic has most certainly been emitted for that
8214 already. Let's propagate that error. */
8215 return error_mark_node
;
8217 gen_tmpl
= most_general_template (templ
);
8218 parmlist
= DECL_TEMPLATE_PARMS (gen_tmpl
);
8219 parm_depth
= TMPL_PARMS_DEPTH (parmlist
);
8220 arg_depth
= TMPL_ARGS_DEPTH (arglist
);
8222 if (arg_depth
== 1 && parm_depth
> 1)
8224 /* We've been given an incomplete set of template arguments.
8227 template <class T> struct S1 {
8228 template <class U> struct S2 {};
8229 template <class U> struct S2<U*> {};
8232 we will be called with an ARGLIST of `U*', but the
8233 TEMPLATE will be `template <class T> template
8234 <class U> struct S1<T>::S2'. We must fill in the missing
8237 = add_outermost_template_args (TYPE_TI_ARGS (TREE_TYPE (templ
)),
8239 arg_depth
= TMPL_ARGS_DEPTH (arglist
);
8242 /* Now we should have enough arguments. */
8243 gcc_assert (parm_depth
== arg_depth
);
8245 /* From here on, we're only interested in the most general
8248 /* Calculate the BOUND_ARGS. These will be the args that are
8249 actually tsubst'd into the definition to create the
8251 arglist
= coerce_innermost_template_parms (parmlist
, arglist
, gen_tmpl
,
8253 /*require_all_args=*/true,
8254 /*use_default_args=*/true);
8256 if (arglist
== error_mark_node
)
8257 /* We were unable to bind the arguments. */
8258 return error_mark_node
;
8260 /* In the scope of a template class, explicit references to the
8261 template class refer to the type of the template, not any
8262 instantiation of it. For example, in:
8264 template <class T> class C { void f(C<T>); }
8266 the `C<T>' is just the same as `C'. Outside of the
8267 class, however, such a reference is an instantiation. */
8269 || !PRIMARY_TEMPLATE_P (gen_tmpl
)
8270 || currently_open_class (template_type
))
8271 /* comp_template_args is expensive, check it last. */
8272 && comp_template_args (TYPE_TI_ARGS (template_type
),
8274 return template_type
;
8276 /* If we already have this specialization, return it. */
8277 elt
.tmpl
= gen_tmpl
;
8279 elt
.spec
= NULL_TREE
;
8280 hash
= spec_hasher::hash (&elt
);
8281 entry
= type_specializations
->find_with_hash (&elt
, hash
);
8286 /* If the the template's constraints are not satisfied,
8287 then we cannot form a valid type.
8289 Note that the check is deferred until after the hash
8290 lookup. This prevents redundant checks on previously
8291 instantiated specializations. */
8292 if (flag_concepts
&& !constraints_satisfied_p (gen_tmpl
, arglist
))
8294 if (complain
& tf_error
)
8296 error ("template constraint failure");
8297 diagnose_constraints (input_location
, gen_tmpl
, arglist
);
8299 return error_mark_node
;
8302 is_dependent_type
= uses_template_parms (arglist
);
8304 /* If the deduced arguments are invalid, then the binding
8306 if (!is_dependent_type
8307 && check_instantiated_args (gen_tmpl
,
8308 INNERMOST_TEMPLATE_ARGS (arglist
),
8310 return error_mark_node
;
8312 if (!is_dependent_type
8313 && !PRIMARY_TEMPLATE_P (gen_tmpl
)
8314 && !LAMBDA_TYPE_P (TREE_TYPE (gen_tmpl
))
8315 && TREE_CODE (CP_DECL_CONTEXT (gen_tmpl
)) == NAMESPACE_DECL
)
8317 found
= xref_tag_from_type (TREE_TYPE (gen_tmpl
),
8318 DECL_NAME (gen_tmpl
),
8319 /*tag_scope=*/ts_global
);
8323 context
= tsubst (DECL_CONTEXT (gen_tmpl
), arglist
,
8325 if (context
== error_mark_node
)
8326 return error_mark_node
;
8329 context
= global_namespace
;
8331 /* Create the type. */
8332 if (DECL_ALIAS_TEMPLATE_P (gen_tmpl
))
8334 /* The user referred to a specialization of an alias
8335 template represented by GEN_TMPL.
8337 [temp.alias]/2 says:
8339 When a template-id refers to the specialization of an
8340 alias template, it is equivalent to the associated
8341 type obtained by substitution of its
8342 template-arguments for the template-parameters in the
8343 type-id of the alias template. */
8345 t
= tsubst (TREE_TYPE (gen_tmpl
), arglist
, complain
, in_decl
);
8346 /* Note that the call above (by indirectly calling
8347 register_specialization in tsubst_decl) registers the
8348 TYPE_DECL representing the specialization of the alias
8349 template. So next time someone substitutes ARGLIST for
8350 the template parms into the alias template (GEN_TMPL),
8351 she'll get that TYPE_DECL back. */
8353 if (t
== error_mark_node
)
8356 else if (TREE_CODE (template_type
) == ENUMERAL_TYPE
)
8358 if (!is_dependent_type
)
8360 set_current_access_from_decl (TYPE_NAME (template_type
));
8361 t
= start_enum (TYPE_IDENTIFIER (template_type
), NULL_TREE
,
8362 tsubst (ENUM_UNDERLYING_TYPE (template_type
),
8363 arglist
, complain
, in_decl
),
8364 SCOPED_ENUM_P (template_type
), NULL
);
8366 if (t
== error_mark_node
)
8371 /* We don't want to call start_enum for this type, since
8372 the values for the enumeration constants may involve
8373 template parameters. And, no one should be interested
8374 in the enumeration constants for such a type. */
8375 t
= cxx_make_type (ENUMERAL_TYPE
);
8376 SET_SCOPED_ENUM_P (t
, SCOPED_ENUM_P (template_type
));
8378 SET_OPAQUE_ENUM_P (t
, OPAQUE_ENUM_P (template_type
));
8379 ENUM_FIXED_UNDERLYING_TYPE_P (t
)
8380 = ENUM_FIXED_UNDERLYING_TYPE_P (template_type
);
8382 else if (CLASS_TYPE_P (template_type
))
8384 t
= make_class_type (TREE_CODE (template_type
));
8385 CLASSTYPE_DECLARED_CLASS (t
)
8386 = CLASSTYPE_DECLARED_CLASS (template_type
);
8387 SET_CLASSTYPE_IMPLICIT_INSTANTIATION (t
);
8388 TYPE_FOR_JAVA (t
) = TYPE_FOR_JAVA (template_type
);
8390 /* A local class. Make sure the decl gets registered properly. */
8391 if (context
== current_function_decl
)
8392 pushtag (DECL_NAME (gen_tmpl
), t
, /*tag_scope=*/ts_current
);
8394 if (comp_template_args (CLASSTYPE_TI_ARGS (template_type
), arglist
))
8395 /* This instantiation is another name for the primary
8396 template type. Set the TYPE_CANONICAL field
8398 TYPE_CANONICAL (t
) = template_type
;
8399 else if (any_template_arguments_need_structural_equality_p (arglist
))
8400 /* Some of the template arguments require structural
8401 equality testing, so this template class requires
8402 structural equality testing. */
8403 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8408 /* If we called start_enum or pushtag above, this information
8409 will already be set up. */
8412 TYPE_CONTEXT (t
) = FROB_CONTEXT (context
);
8414 type_decl
= create_implicit_typedef (DECL_NAME (gen_tmpl
), t
);
8415 DECL_CONTEXT (type_decl
) = TYPE_CONTEXT (t
);
8416 DECL_SOURCE_LOCATION (type_decl
)
8417 = DECL_SOURCE_LOCATION (TYPE_STUB_DECL (template_type
));
8420 type_decl
= TYPE_NAME (t
);
8422 if (CLASS_TYPE_P (template_type
))
8424 TREE_PRIVATE (type_decl
)
8425 = TREE_PRIVATE (TYPE_MAIN_DECL (template_type
));
8426 TREE_PROTECTED (type_decl
)
8427 = TREE_PROTECTED (TYPE_MAIN_DECL (template_type
));
8428 if (CLASSTYPE_VISIBILITY_SPECIFIED (template_type
))
8430 DECL_VISIBILITY_SPECIFIED (type_decl
) = 1;
8431 DECL_VISIBILITY (type_decl
) = CLASSTYPE_VISIBILITY (template_type
);
8435 if (OVERLOAD_TYPE_P (t
)
8436 && !DECL_ALIAS_TEMPLATE_P (gen_tmpl
))
8438 static const char *tags
[] = {"abi_tag", "may_alias"};
8440 for (unsigned ix
= 0; ix
!= 2; ix
++)
8443 = lookup_attribute (tags
[ix
], TYPE_ATTRIBUTES (template_type
));
8447 else if (!TREE_CHAIN (attributes
) && !TYPE_ATTRIBUTES (t
))
8448 TYPE_ATTRIBUTES (t
) = attributes
;
8451 = tree_cons (TREE_PURPOSE (attributes
),
8452 TREE_VALUE (attributes
),
8453 TYPE_ATTRIBUTES (t
));
8457 /* Let's consider the explicit specialization of a member
8458 of a class template specialization that is implicitly instantiated,
8463 template<class U> struct M {}; //#0
8468 struct S<int>::M<char> //#1
8472 [temp.expl.spec]/4 says this is valid.
8474 In this case, when we write:
8477 M is instantiated from the CLASSTYPE_TI_TEMPLATE of #1, not from
8480 When we encounter #1, we want to store the partial instantiation
8481 of M (template<class T> S<int>::M<T>) in its CLASSTYPE_TI_TEMPLATE.
8483 For all cases other than this "explicit specialization of member of a
8484 class template", we just want to store the most general template into
8485 the CLASSTYPE_TI_TEMPLATE of M.
8487 This case of "explicit specialization of member of a class template"
8489 1/ the enclosing class is an instantiation of, and therefore not
8490 the same as, the context of the most general template, and
8491 2/ we aren't looking at the partial instantiation itself, i.e.
8492 the innermost arguments are not the same as the innermost parms of
8493 the most general template.
8495 So it's only when 1/ and 2/ happens that we want to use the partial
8496 instantiation of the member template in lieu of its most general
8499 if (PRIMARY_TEMPLATE_P (gen_tmpl
)
8500 && TMPL_ARGS_HAVE_MULTIPLE_LEVELS (arglist
)
8501 /* the enclosing class must be an instantiation... */
8502 && CLASS_TYPE_P (context
)
8503 && !same_type_p (context
, DECL_CONTEXT (gen_tmpl
)))
8505 tree partial_inst_args
;
8506 TREE_VEC_LENGTH (arglist
)--;
8507 ++processing_template_decl
;
8509 tsubst (INNERMOST_TEMPLATE_ARGS
8510 (TYPE_TI_ARGS (TREE_TYPE (gen_tmpl
))),
8511 arglist
, complain
, NULL_TREE
);
8512 --processing_template_decl
;
8513 TREE_VEC_LENGTH (arglist
)++;
8514 use_partial_inst_tmpl
=
8515 /*...and we must not be looking at the partial instantiation
8517 !comp_template_args (INNERMOST_TEMPLATE_ARGS (arglist
),
8521 if (!use_partial_inst_tmpl
)
8522 /* This case is easy; there are no member templates involved. */
8526 /* This is a full instantiation of a member template. Find
8527 the partial instantiation of which this is an instance. */
8529 /* Temporarily reduce by one the number of levels in the ARGLIST
8530 so as to avoid comparing the last set of arguments. */
8531 TREE_VEC_LENGTH (arglist
)--;
8532 found
= tsubst (gen_tmpl
, arglist
, complain
, NULL_TREE
);
8533 TREE_VEC_LENGTH (arglist
)++;
8534 /* FOUND is either a proper class type, or an alias
8535 template specialization. In the later case, it's a
8536 TYPE_DECL, resulting from the substituting of arguments
8537 for parameters in the TYPE_DECL of the alias template
8538 done earlier. So be careful while getting the template
8540 found
= TREE_CODE (found
) == TYPE_DECL
8541 ? TYPE_TI_TEMPLATE (TREE_TYPE (found
))
8542 : CLASSTYPE_TI_TEMPLATE (found
);
8545 // Build template info for the new specialization.
8546 SET_TYPE_TEMPLATE_INFO (t
, build_template_info (found
, arglist
));
8549 slot
= type_specializations
->find_slot_with_hash (&elt
, hash
, INSERT
);
8550 entry
= ggc_alloc
<spec_entry
> ();
8554 /* Note this use of the partial instantiation so we can check it
8555 later in maybe_process_partial_specialization. */
8556 DECL_TEMPLATE_INSTANTIATIONS (found
)
8557 = tree_cons (arglist
, t
,
8558 DECL_TEMPLATE_INSTANTIATIONS (found
));
8560 if (TREE_CODE (template_type
) == ENUMERAL_TYPE
&& !is_dependent_type
8561 && !DECL_ALIAS_TEMPLATE_P (gen_tmpl
))
8562 /* Now that the type has been registered on the instantiations
8563 list, we set up the enumerators. Because the enumeration
8564 constants may involve the enumeration type itself, we make
8565 sure to register the type first, and then create the
8566 constants. That way, doing tsubst_expr for the enumeration
8567 constants won't result in recursive calls here; we'll find
8568 the instantiation and exit above. */
8569 tsubst_enum (template_type
, t
, arglist
);
8571 if (CLASS_TYPE_P (template_type
) && is_dependent_type
)
8572 /* If the type makes use of template parameters, the
8573 code that generates debugging information will crash. */
8574 DECL_IGNORED_P (TYPE_MAIN_DECL (t
)) = 1;
8576 /* Possibly limit visibility based on template args. */
8577 TREE_PUBLIC (type_decl
) = 1;
8578 determine_visibility (type_decl
);
8580 inherit_targ_abi_tags (t
);
8586 /* Wrapper for lookup_template_class_1. */
8589 lookup_template_class (tree d1
, tree arglist
, tree in_decl
, tree context
,
8590 int entering_scope
, tsubst_flags_t complain
)
8593 timevar_push (TV_TEMPLATE_INST
);
8594 ret
= lookup_template_class_1 (d1
, arglist
, in_decl
, context
,
8595 entering_scope
, complain
);
8596 timevar_pop (TV_TEMPLATE_INST
);
8600 /* Return a TEMPLATE_ID_EXPR for the given variable template and ARGLIST. */
8603 lookup_template_variable (tree templ
, tree arglist
)
8605 /* The type of the expression is NULL_TREE since the template-id could refer
8606 to an explicit or partial specialization. */
8607 tree type
= NULL_TREE
;
8608 if (flag_concepts
&& variable_concept_p (templ
))
8609 /* Except that concepts are always bool. */
8610 type
= boolean_type_node
;
8611 return build2 (TEMPLATE_ID_EXPR
, type
, templ
, arglist
);
8614 /* Instantiate a variable declaration from a TEMPLATE_ID_EXPR for use. */
8617 finish_template_variable (tree var
, tsubst_flags_t complain
)
8619 tree templ
= TREE_OPERAND (var
, 0);
8620 tree arglist
= TREE_OPERAND (var
, 1);
8622 /* We never want to return a VAR_DECL for a variable concept, since they
8623 aren't instantiated. In a template, leave the TEMPLATE_ID_EXPR alone. */
8624 bool concept_p
= flag_concepts
&& variable_concept_p (templ
);
8625 if (concept_p
&& processing_template_decl
)
8628 tree tmpl_args
= DECL_TI_ARGS (DECL_TEMPLATE_RESULT (templ
));
8629 arglist
= add_outermost_template_args (tmpl_args
, arglist
);
8631 tree parms
= DECL_TEMPLATE_PARMS (templ
);
8632 arglist
= coerce_innermost_template_parms (parms
, arglist
, templ
, complain
,
8634 /*use_default*/true);
8636 if (flag_concepts
&& !constraints_satisfied_p (templ
, arglist
))
8638 if (complain
& tf_error
)
8640 error ("constraints for %qD not satisfied", templ
);
8641 diagnose_constraints (location_of (var
), templ
, arglist
);
8643 return error_mark_node
;
8646 /* If a template-id refers to a specialization of a variable
8647 concept, then the expression is true if and only if the
8648 concept's constraints are satisfied by the given template
8651 NOTE: This is an extension of Concepts Lite TS that
8652 allows constraints to be used in expressions. */
8655 tree decl
= DECL_TEMPLATE_RESULT (templ
);
8656 return evaluate_variable_concept (decl
, arglist
);
8659 return instantiate_template (templ
, arglist
, complain
);
8666 /* True when we should also visit template parameters that occur in
8667 non-deduced contexts. */
8668 bool include_nondeduced_p
;
8669 hash_set
<tree
> *visited
;
8672 /* Called from for_each_template_parm via walk_tree. */
8675 for_each_template_parm_r (tree
*tp
, int *walk_subtrees
, void *d
)
8678 struct pair_fn_data
*pfd
= (struct pair_fn_data
*) d
;
8679 tree_fn_t fn
= pfd
->fn
;
8680 void *data
= pfd
->data
;
8683 && (pfd
->include_nondeduced_p
|| TREE_CODE (t
) != TYPENAME_TYPE
)
8684 && for_each_template_parm (TYPE_CONTEXT (t
), fn
, data
, pfd
->visited
,
8685 pfd
->include_nondeduced_p
))
8686 return error_mark_node
;
8688 switch (TREE_CODE (t
))
8691 if (TYPE_PTRMEMFUNC_P (t
))
8697 if (!TYPE_TEMPLATE_INFO (t
))
8699 else if (for_each_template_parm (TYPE_TI_ARGS (t
),
8700 fn
, data
, pfd
->visited
,
8701 pfd
->include_nondeduced_p
))
8702 return error_mark_node
;
8706 if (for_each_template_parm (TYPE_MIN_VALUE (t
),
8707 fn
, data
, pfd
->visited
,
8708 pfd
->include_nondeduced_p
)
8709 || for_each_template_parm (TYPE_MAX_VALUE (t
),
8710 fn
, data
, pfd
->visited
,
8711 pfd
->include_nondeduced_p
))
8712 return error_mark_node
;
8716 /* Since we're not going to walk subtrees, we have to do this
8718 if (for_each_template_parm (TYPE_METHOD_BASETYPE (t
), fn
, data
,
8719 pfd
->visited
, pfd
->include_nondeduced_p
))
8720 return error_mark_node
;
8724 /* Check the return type. */
8725 if (for_each_template_parm (TREE_TYPE (t
), fn
, data
, pfd
->visited
,
8726 pfd
->include_nondeduced_p
))
8727 return error_mark_node
;
8729 /* Check the parameter types. Since default arguments are not
8730 instantiated until they are needed, the TYPE_ARG_TYPES may
8731 contain expressions that involve template parameters. But,
8732 no-one should be looking at them yet. And, once they're
8733 instantiated, they don't contain template parameters, so
8734 there's no point in looking at them then, either. */
8738 for (parm
= TYPE_ARG_TYPES (t
); parm
; parm
= TREE_CHAIN (parm
))
8739 if (for_each_template_parm (TREE_VALUE (parm
), fn
, data
,
8740 pfd
->visited
, pfd
->include_nondeduced_p
))
8741 return error_mark_node
;
8743 /* Since we've already handled the TYPE_ARG_TYPES, we don't
8744 want walk_tree walking into them itself. */
8750 case UNDERLYING_TYPE
:
8751 if (pfd
->include_nondeduced_p
8752 && for_each_template_parm (TYPE_VALUES_RAW (t
), fn
, data
,
8754 pfd
->include_nondeduced_p
))
8755 return error_mark_node
;
8760 if (DECL_LANG_SPECIFIC (t
) && DECL_TEMPLATE_INFO (t
)
8761 && for_each_template_parm (DECL_TI_ARGS (t
), fn
, data
,
8762 pfd
->visited
, pfd
->include_nondeduced_p
))
8763 return error_mark_node
;
8768 if (TREE_CODE (t
) == CONST_DECL
&& DECL_TEMPLATE_PARM_P (t
)
8769 && for_each_template_parm (DECL_INITIAL (t
), fn
, data
,
8770 pfd
->visited
, pfd
->include_nondeduced_p
))
8771 return error_mark_node
;
8772 if (DECL_CONTEXT (t
)
8773 && pfd
->include_nondeduced_p
8774 && for_each_template_parm (DECL_CONTEXT (t
), fn
, data
,
8775 pfd
->visited
, pfd
->include_nondeduced_p
))
8776 return error_mark_node
;
8779 case BOUND_TEMPLATE_TEMPLATE_PARM
:
8780 /* Record template parameters such as `T' inside `TT<T>'. */
8781 if (for_each_template_parm (TYPE_TI_ARGS (t
), fn
, data
, pfd
->visited
,
8782 pfd
->include_nondeduced_p
))
8783 return error_mark_node
;
8786 case TEMPLATE_TEMPLATE_PARM
:
8787 case TEMPLATE_TYPE_PARM
:
8788 case TEMPLATE_PARM_INDEX
:
8789 if (fn
&& (*fn
)(t
, data
))
8790 return error_mark_node
;
8792 return error_mark_node
;
8796 /* A template template parameter is encountered. */
8797 if (DECL_TEMPLATE_TEMPLATE_PARM_P (t
)
8798 && for_each_template_parm (TREE_TYPE (t
), fn
, data
, pfd
->visited
,
8799 pfd
->include_nondeduced_p
))
8800 return error_mark_node
;
8802 /* Already substituted template template parameter */
8808 || for_each_template_parm (TYPENAME_TYPE_FULLNAME (t
), fn
,
8810 pfd
->include_nondeduced_p
))
8811 return error_mark_node
;
8815 if (TREE_TYPE (t
) && TYPE_PTRMEMFUNC_P (TREE_TYPE (t
))
8816 && pfd
->include_nondeduced_p
8817 && for_each_template_parm (TYPE_PTRMEMFUNC_FN_TYPE
8818 (TREE_TYPE (t
)), fn
, data
,
8819 pfd
->visited
, pfd
->include_nondeduced_p
))
8820 return error_mark_node
;
8825 /* If there's no type, then this thing must be some expression
8826 involving template parameters. */
8827 if (!fn
&& !TREE_TYPE (t
))
8828 return error_mark_node
;
8833 case IMPLICIT_CONV_EXPR
:
8834 case REINTERPRET_CAST_EXPR
:
8835 case CONST_CAST_EXPR
:
8836 case STATIC_CAST_EXPR
:
8837 case DYNAMIC_CAST_EXPR
:
8841 case PSEUDO_DTOR_EXPR
:
8843 return error_mark_node
;
8850 /* We didn't find any template parameters we liked. */
8854 /* For each TEMPLATE_TYPE_PARM, TEMPLATE_TEMPLATE_PARM,
8855 BOUND_TEMPLATE_TEMPLATE_PARM or TEMPLATE_PARM_INDEX in T,
8856 call FN with the parameter and the DATA.
8857 If FN returns nonzero, the iteration is terminated, and
8858 for_each_template_parm returns 1. Otherwise, the iteration
8859 continues. If FN never returns a nonzero value, the value
8860 returned by for_each_template_parm is 0. If FN is NULL, it is
8861 considered to be the function which always returns 1.
8863 If INCLUDE_NONDEDUCED_P, then this routine will also visit template
8864 parameters that occur in non-deduced contexts. When false, only
8865 visits those template parameters that can be deduced. */
8868 for_each_template_parm (tree t
, tree_fn_t fn
, void* data
,
8869 hash_set
<tree
> *visited
,
8870 bool include_nondeduced_p
)
8872 struct pair_fn_data pfd
;
8878 pfd
.include_nondeduced_p
= include_nondeduced_p
;
8880 /* Walk the tree. (Conceptually, we would like to walk without
8881 duplicates, but for_each_template_parm_r recursively calls
8882 for_each_template_parm, so we would need to reorganize a fair
8883 bit to use walk_tree_without_duplicates, so we keep our own
8886 pfd
.visited
= visited
;
8888 pfd
.visited
= new hash_set
<tree
>;
8889 result
= cp_walk_tree (&t
,
8890 for_each_template_parm_r
,
8892 pfd
.visited
) != NULL_TREE
;
8904 /* Returns true if T depends on any template parameter. */
8907 uses_template_parms (tree t
)
8913 int saved_processing_template_decl
;
8915 saved_processing_template_decl
= processing_template_decl
;
8916 if (!saved_processing_template_decl
)
8917 processing_template_decl
= 1;
8919 dependent_p
= dependent_type_p (t
);
8920 else if (TREE_CODE (t
) == TREE_VEC
)
8921 dependent_p
= any_dependent_template_arguments_p (t
);
8922 else if (TREE_CODE (t
) == TREE_LIST
)
8923 dependent_p
= (uses_template_parms (TREE_VALUE (t
))
8924 || uses_template_parms (TREE_CHAIN (t
)));
8925 else if (TREE_CODE (t
) == TYPE_DECL
)
8926 dependent_p
= dependent_type_p (TREE_TYPE (t
));
8929 || TREE_CODE (t
) == TEMPLATE_PARM_INDEX
8930 || TREE_CODE (t
) == OVERLOAD
8933 || TREE_CODE (t
) == TRAIT_EXPR
8934 || TREE_CODE (t
) == CONSTRUCTOR
8935 || CONSTANT_CLASS_P (t
))
8936 dependent_p
= (type_dependent_expression_p (t
)
8937 || value_dependent_expression_p (t
));
8940 gcc_assert (t
== error_mark_node
);
8941 dependent_p
= false;
8944 processing_template_decl
= saved_processing_template_decl
;
8949 /* Returns true iff current_function_decl is an incompletely instantiated
8950 template. Useful instead of processing_template_decl because the latter
8951 is set to 0 during instantiate_non_dependent_expr. */
8954 in_template_function (void)
8956 tree fn
= current_function_decl
;
8958 ++processing_template_decl
;
8959 ret
= (fn
&& DECL_LANG_SPECIFIC (fn
)
8960 && DECL_TEMPLATE_INFO (fn
)
8961 && any_dependent_template_arguments_p (DECL_TI_ARGS (fn
)));
8962 --processing_template_decl
;
8966 /* Returns true if T depends on any template parameter with level LEVEL. */
8969 uses_template_parms_level (tree t
, int level
)
8971 return for_each_template_parm (t
, template_parm_this_level_p
, &level
, NULL
,
8972 /*include_nondeduced_p=*/true);
8975 /* Returns TRUE iff INST is an instantiation we don't need to do in an
8976 ill-formed translation unit, i.e. a variable or function that isn't
8977 usable in a constant expression. */
8980 neglectable_inst_p (tree d
)
8983 && !(TREE_CODE (d
) == FUNCTION_DECL
? DECL_DECLARED_CONSTEXPR_P (d
)
8984 : decl_maybe_constant_var_p (d
)));
8987 /* Returns TRUE iff we should refuse to instantiate DECL because it's
8988 neglectable and instantiated from within an erroneous instantiation. */
8991 limit_bad_template_recursion (tree decl
)
8993 struct tinst_level
*lev
= current_tinst_level
;
8994 int errs
= errorcount
+ sorrycount
;
8995 if (lev
== NULL
|| errs
== 0 || !neglectable_inst_p (decl
))
8998 for (; lev
; lev
= lev
->next
)
8999 if (neglectable_inst_p (lev
->decl
))
9002 return (lev
&& errs
> lev
->errors
);
9005 static int tinst_depth
;
9006 extern int max_tinst_depth
;
9009 static GTY(()) struct tinst_level
*last_error_tinst_level
;
9011 /* We're starting to instantiate D; record the template instantiation context
9012 for diagnostics and to restore it later. */
9015 push_tinst_level (tree d
)
9017 return push_tinst_level_loc (d
, input_location
);
9020 /* We're starting to instantiate D; record the template instantiation context
9021 at LOC for diagnostics and to restore it later. */
9024 push_tinst_level_loc (tree d
, location_t loc
)
9026 struct tinst_level
*new_level
;
9028 if (tinst_depth
>= max_tinst_depth
)
9030 fatal_error (input_location
,
9031 "template instantiation depth exceeds maximum of %d"
9032 " (use -ftemplate-depth= to increase the maximum)",
9037 /* If the current instantiation caused problems, don't let it instantiate
9038 anything else. Do allow deduction substitution and decls usable in
9039 constant expressions. */
9040 if (limit_bad_template_recursion (d
))
9043 new_level
= ggc_alloc
<tinst_level
> ();
9044 new_level
->decl
= d
;
9045 new_level
->locus
= loc
;
9046 new_level
->errors
= errorcount
+sorrycount
;
9047 new_level
->in_system_header_p
= in_system_header_at (input_location
);
9048 new_level
->next
= current_tinst_level
;
9049 current_tinst_level
= new_level
;
9052 if (GATHER_STATISTICS
&& (tinst_depth
> depth_reached
))
9053 depth_reached
= tinst_depth
;
9058 /* We're done instantiating this template; return to the instantiation
9062 pop_tinst_level (void)
9064 /* Restore the filename and line number stashed away when we started
9065 this instantiation. */
9066 input_location
= current_tinst_level
->locus
;
9067 current_tinst_level
= current_tinst_level
->next
;
9071 /* We're instantiating a deferred template; restore the template
9072 instantiation context in which the instantiation was requested, which
9073 is one step out from LEVEL. Return the corresponding DECL or TYPE. */
9076 reopen_tinst_level (struct tinst_level
*level
)
9078 struct tinst_level
*t
;
9081 for (t
= level
; t
; t
= t
->next
)
9084 current_tinst_level
= level
;
9086 if (current_tinst_level
)
9087 current_tinst_level
->errors
= errorcount
+sorrycount
;
9091 /* Returns the TINST_LEVEL which gives the original instantiation
9094 struct tinst_level
*
9095 outermost_tinst_level (void)
9097 struct tinst_level
*level
= current_tinst_level
;
9100 level
= level
->next
;
9104 /* DECL is a friend FUNCTION_DECL or TEMPLATE_DECL. ARGS is the
9105 vector of template arguments, as for tsubst.
9107 Returns an appropriate tsubst'd friend declaration. */
9110 tsubst_friend_function (tree decl
, tree args
)
9114 if (TREE_CODE (decl
) == FUNCTION_DECL
9115 && DECL_TEMPLATE_INSTANTIATION (decl
)
9116 && TREE_CODE (DECL_TI_TEMPLATE (decl
)) != TEMPLATE_DECL
)
9117 /* This was a friend declared with an explicit template
9118 argument list, e.g.:
9122 to indicate that f was a template instantiation, not a new
9123 function declaration. Now, we have to figure out what
9124 instantiation of what template. */
9126 tree template_id
, arglist
, fns
;
9129 tree ns
= decl_namespace_context (TYPE_MAIN_DECL (current_class_type
));
9131 /* Friend functions are looked up in the containing namespace scope.
9132 We must enter that scope, to avoid finding member functions of the
9133 current class with same name. */
9134 push_nested_namespace (ns
);
9135 fns
= tsubst_expr (DECL_TI_TEMPLATE (decl
), args
,
9136 tf_warning_or_error
, NULL_TREE
,
9137 /*integral_constant_expression_p=*/false);
9138 pop_nested_namespace (ns
);
9139 arglist
= tsubst (DECL_TI_ARGS (decl
), args
,
9140 tf_warning_or_error
, NULL_TREE
);
9141 template_id
= lookup_template_function (fns
, arglist
);
9143 new_friend
= tsubst (decl
, args
, tf_warning_or_error
, NULL_TREE
);
9144 tmpl
= determine_specialization (template_id
, new_friend
,
9146 /*need_member_template=*/0,
9147 TREE_VEC_LENGTH (args
),
9149 return instantiate_template (tmpl
, new_args
, tf_error
);
9152 new_friend
= tsubst (decl
, args
, tf_warning_or_error
, NULL_TREE
);
9154 /* The NEW_FRIEND will look like an instantiation, to the
9155 compiler, but is not an instantiation from the point of view of
9156 the language. For example, we might have had:
9158 template <class T> struct S {
9159 template <class U> friend void f(T, U);
9162 Then, in S<int>, template <class U> void f(int, U) is not an
9163 instantiation of anything. */
9164 if (new_friend
== error_mark_node
)
9165 return error_mark_node
;
9167 DECL_USE_TEMPLATE (new_friend
) = 0;
9168 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
9170 DECL_USE_TEMPLATE (DECL_TEMPLATE_RESULT (new_friend
)) = 0;
9171 DECL_SAVED_TREE (DECL_TEMPLATE_RESULT (new_friend
))
9172 = DECL_SAVED_TREE (DECL_TEMPLATE_RESULT (decl
));
9175 /* The mangled name for the NEW_FRIEND is incorrect. The function
9176 is not a template instantiation and should not be mangled like
9177 one. Therefore, we forget the mangling here; we'll recompute it
9178 later if we need it. */
9179 if (TREE_CODE (new_friend
) != TEMPLATE_DECL
)
9181 SET_DECL_RTL (new_friend
, NULL
);
9182 SET_DECL_ASSEMBLER_NAME (new_friend
, NULL_TREE
);
9185 if (DECL_NAMESPACE_SCOPE_P (new_friend
))
9188 tree new_friend_template_info
;
9189 tree new_friend_result_template_info
;
9191 int new_friend_is_defn
;
9193 /* We must save some information from NEW_FRIEND before calling
9194 duplicate decls since that function will free NEW_FRIEND if
9196 new_friend_template_info
= DECL_TEMPLATE_INFO (new_friend
);
9197 new_friend_is_defn
=
9198 (DECL_INITIAL (DECL_TEMPLATE_RESULT
9199 (template_for_substitution (new_friend
)))
9201 if (TREE_CODE (new_friend
) == TEMPLATE_DECL
)
9203 /* This declaration is a `primary' template. */
9204 DECL_PRIMARY_TEMPLATE (new_friend
) = new_friend
;
9206 new_friend_result_template_info
9207 = DECL_TEMPLATE_INFO (DECL_TEMPLATE_RESULT (new_friend
));
9210 new_friend_result_template_info
= NULL_TREE
;
9212 /* Make the init_value nonzero so pushdecl knows this is a defn. */
9213 if (new_friend_is_defn
)
9214 DECL_INITIAL (new_friend
) = error_mark_node
;
9216 /* Inside pushdecl_namespace_level, we will push into the
9217 current namespace. However, the friend function should go
9218 into the namespace of the template. */
9219 ns
= decl_namespace_context (new_friend
);
9220 push_nested_namespace (ns
);
9221 old_decl
= pushdecl_namespace_level (new_friend
, /*is_friend=*/true);
9222 pop_nested_namespace (ns
);
9224 if (old_decl
== error_mark_node
)
9225 return error_mark_node
;
9227 if (old_decl
!= new_friend
)
9229 /* This new friend declaration matched an existing
9230 declaration. For example, given:
9232 template <class T> void f(T);
9233 template <class U> class C {
9234 template <class T> friend void f(T) {}
9237 the friend declaration actually provides the definition
9238 of `f', once C has been instantiated for some type. So,
9239 old_decl will be the out-of-class template declaration,
9240 while new_friend is the in-class definition.
9242 But, if `f' was called before this point, the
9243 instantiation of `f' will have DECL_TI_ARGS corresponding
9244 to `T' but not to `U', references to which might appear
9245 in the definition of `f'. Previously, the most general
9246 template for an instantiation of `f' was the out-of-class
9247 version; now it is the in-class version. Therefore, we
9248 run through all specialization of `f', adding to their
9249 DECL_TI_ARGS appropriately. In particular, they need a
9250 new set of outer arguments, corresponding to the
9251 arguments for this class instantiation.
9253 The same situation can arise with something like this:
9256 template <class T> class C {
9260 when `C<int>' is instantiated. Now, `f(int)' is defined
9263 if (!new_friend_is_defn
)
9264 /* On the other hand, if the in-class declaration does
9265 *not* provide a definition, then we don't want to alter
9266 existing definitions. We can just leave everything
9271 tree new_template
= TI_TEMPLATE (new_friend_template_info
);
9272 tree new_args
= TI_ARGS (new_friend_template_info
);
9274 /* Overwrite whatever template info was there before, if
9275 any, with the new template information pertaining to
9277 DECL_TEMPLATE_INFO (old_decl
) = new_friend_template_info
;
9279 if (TREE_CODE (old_decl
) != TEMPLATE_DECL
)
9281 /* We should have called reregister_specialization in
9283 gcc_assert (retrieve_specialization (new_template
,
9287 /* Instantiate it if the global has already been used. */
9288 if (DECL_ODR_USED (old_decl
))
9289 instantiate_decl (old_decl
, /*defer_ok=*/true,
9290 /*expl_inst_class_mem_p=*/false);
9296 /* Indicate that the old function template is a partial
9298 DECL_TEMPLATE_INFO (DECL_TEMPLATE_RESULT (old_decl
))
9299 = new_friend_result_template_info
;
9301 gcc_assert (new_template
9302 == most_general_template (new_template
));
9303 gcc_assert (new_template
!= old_decl
);
9305 /* Reassign any specializations already in the hash table
9306 to the new more general template, and add the
9307 additional template args. */
9308 for (t
= DECL_TEMPLATE_INSTANTIATIONS (old_decl
);
9312 tree spec
= TREE_VALUE (t
);
9315 elt
.tmpl
= old_decl
;
9316 elt
.args
= DECL_TI_ARGS (spec
);
9317 elt
.spec
= NULL_TREE
;
9319 decl_specializations
->remove_elt (&elt
);
9322 = add_outermost_template_args (new_args
,
9323 DECL_TI_ARGS (spec
));
9325 register_specialization
9326 (spec
, new_template
, DECL_TI_ARGS (spec
), true, 0);
9329 DECL_TEMPLATE_INSTANTIATIONS (old_decl
) = NULL_TREE
;
9333 /* The information from NEW_FRIEND has been merged into OLD_DECL
9334 by duplicate_decls. */
9335 new_friend
= old_decl
;
9340 tree context
= DECL_CONTEXT (new_friend
);
9344 template <class T> class C {
9345 template <class U> friend void C1<U>::f (); // case 1
9346 friend void C2<T>::f (); // case 2
9348 we only need to make sure CONTEXT is a complete type for
9349 case 2. To distinguish between the two cases, we note that
9350 CONTEXT of case 1 remains dependent type after tsubst while
9351 this isn't true for case 2. */
9352 ++processing_template_decl
;
9353 dependent_p
= dependent_type_p (context
);
9354 --processing_template_decl
;
9357 && !complete_type_or_else (context
, NULL_TREE
))
9358 return error_mark_node
;
9360 if (COMPLETE_TYPE_P (context
))
9362 tree fn
= new_friend
;
9363 /* do_friend adds the TEMPLATE_DECL for any member friend
9364 template even if it isn't a member template, i.e.
9365 template <class T> friend A<T>::f();
9366 Look through it in that case. */
9367 if (TREE_CODE (fn
) == TEMPLATE_DECL
9368 && !PRIMARY_TEMPLATE_P (fn
))
9369 fn
= DECL_TEMPLATE_RESULT (fn
);
9370 /* Check to see that the declaration is really present, and,
9371 possibly obtain an improved declaration. */
9372 fn
= check_classfn (context
, fn
, NULL_TREE
);
9382 /* FRIEND_TMPL is a friend TEMPLATE_DECL. ARGS is the vector of
9383 template arguments, as for tsubst.
9385 Returns an appropriate tsubst'd friend type or error_mark_node on
9389 tsubst_friend_class (tree friend_tmpl
, tree args
)
9395 if (DECL_TEMPLATE_TEMPLATE_PARM_P (friend_tmpl
))
9397 tree t
= tsubst (TREE_TYPE (friend_tmpl
), args
, tf_none
, NULL_TREE
);
9398 return TREE_TYPE (t
);
9401 context
= CP_DECL_CONTEXT (friend_tmpl
);
9403 if (context
!= global_namespace
)
9405 if (TREE_CODE (context
) == NAMESPACE_DECL
)
9406 push_nested_namespace (context
);
9408 push_nested_class (tsubst (context
, args
, tf_none
, NULL_TREE
));
9411 /* Look for a class template declaration. We look for hidden names
9412 because two friend declarations of the same template are the
9413 same. For example, in:
9416 template <typename> friend class F;
9418 template <typename> struct B {
9419 template <typename> friend class F;
9422 both F templates are the same. */
9423 tmpl
= lookup_name_real (DECL_NAME (friend_tmpl
), 0, 0,
9424 /*block_p=*/true, 0, LOOKUP_HIDDEN
);
9426 /* But, if we don't find one, it might be because we're in a
9427 situation like this:
9435 Here, in the scope of (say) S<int>, `S' is bound to a TYPE_DECL
9436 for `S<int>', not the TEMPLATE_DECL. */
9437 if (!tmpl
|| !DECL_CLASS_TEMPLATE_P (tmpl
))
9439 tmpl
= lookup_name_prefer_type (DECL_NAME (friend_tmpl
), 1);
9440 tmpl
= maybe_get_template_decl_from_type_decl (tmpl
);
9443 if (tmpl
&& DECL_CLASS_TEMPLATE_P (tmpl
))
9445 /* The friend template has already been declared. Just
9446 check to see that the declarations match, and install any new
9447 default parameters. We must tsubst the default parameters,
9448 of course. We only need the innermost template parameters
9449 because that is all that redeclare_class_template will look
9451 if (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (friend_tmpl
))
9452 > TMPL_ARGS_DEPTH (args
))
9455 location_t saved_input_location
;
9456 parms
= tsubst_template_parms (DECL_TEMPLATE_PARMS (friend_tmpl
),
9457 args
, tf_warning_or_error
);
9459 saved_input_location
= input_location
;
9460 input_location
= DECL_SOURCE_LOCATION (friend_tmpl
);
9461 tree cons
= get_constraints (tmpl
);
9462 redeclare_class_template (TREE_TYPE (tmpl
), parms
, cons
);
9463 input_location
= saved_input_location
;
9467 friend_type
= TREE_TYPE (tmpl
);
9471 /* The friend template has not already been declared. In this
9472 case, the instantiation of the template class will cause the
9473 injection of this template into the global scope. */
9474 tmpl
= tsubst (friend_tmpl
, args
, tf_warning_or_error
, NULL_TREE
);
9475 if (tmpl
== error_mark_node
)
9476 return error_mark_node
;
9478 /* The new TMPL is not an instantiation of anything, so we
9479 forget its origins. We don't reset CLASSTYPE_TI_TEMPLATE for
9480 the new type because that is supposed to be the corresponding
9481 template decl, i.e., TMPL. */
9482 DECL_USE_TEMPLATE (tmpl
) = 0;
9483 DECL_TEMPLATE_INFO (tmpl
) = NULL_TREE
;
9484 CLASSTYPE_USE_TEMPLATE (TREE_TYPE (tmpl
)) = 0;
9485 CLASSTYPE_TI_ARGS (TREE_TYPE (tmpl
))
9486 = INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (TREE_TYPE (tmpl
)));
9488 /* Inject this template into the global scope. */
9489 friend_type
= TREE_TYPE (pushdecl_top_level_maybe_friend (tmpl
, true));
9492 if (context
!= global_namespace
)
9494 if (TREE_CODE (context
) == NAMESPACE_DECL
)
9495 pop_nested_namespace (context
);
9497 pop_nested_class ();
9503 /* Returns zero if TYPE cannot be completed later due to circularity.
9504 Otherwise returns one. */
9507 can_complete_type_without_circularity (tree type
)
9509 if (type
== NULL_TREE
|| type
== error_mark_node
)
9511 else if (COMPLETE_TYPE_P (type
))
9513 else if (TREE_CODE (type
) == ARRAY_TYPE
&& TYPE_DOMAIN (type
))
9514 return can_complete_type_without_circularity (TREE_TYPE (type
));
9515 else if (CLASS_TYPE_P (type
)
9516 && TYPE_BEING_DEFINED (TYPE_MAIN_VARIANT (type
)))
9522 static tree
tsubst_omp_clauses (tree
, bool, tree
, tsubst_flags_t
, tree
);
9524 /* Apply any attributes which had to be deferred until instantiation
9525 time. DECL_P, ATTRIBUTES and ATTR_FLAGS are as cplus_decl_attributes;
9526 ARGS, COMPLAIN, IN_DECL are as tsubst. */
9529 apply_late_template_attributes (tree
*decl_p
, tree attributes
, int attr_flags
,
9530 tree args
, tsubst_flags_t complain
, tree in_decl
)
9532 tree last_dep
= NULL_TREE
;
9536 for (t
= attributes
; t
; t
= TREE_CHAIN (t
))
9537 if (ATTR_IS_DEPENDENT (t
))
9540 attributes
= copy_list (attributes
);
9544 if (DECL_P (*decl_p
))
9546 if (TREE_TYPE (*decl_p
) == error_mark_node
)
9548 p
= &DECL_ATTRIBUTES (*decl_p
);
9551 p
= &TYPE_ATTRIBUTES (*decl_p
);
9555 tree late_attrs
= NULL_TREE
;
9556 tree
*q
= &late_attrs
;
9558 for (*p
= attributes
; *p
; )
9561 if (ATTR_IS_DEPENDENT (t
))
9563 *p
= TREE_CHAIN (t
);
9564 TREE_CHAIN (t
) = NULL_TREE
;
9565 if ((flag_openmp
|| flag_openmp_simd
|| flag_cilkplus
)
9566 && is_attribute_p ("omp declare simd",
9567 get_attribute_name (t
))
9570 tree clauses
= TREE_VALUE (TREE_VALUE (t
));
9571 clauses
= tsubst_omp_clauses (clauses
, true, args
,
9573 c_omp_declare_simd_clauses_to_decls (*decl_p
, clauses
);
9574 clauses
= finish_omp_clauses (clauses
);
9575 tree parms
= DECL_ARGUMENTS (*decl_p
);
9577 = c_omp_declare_simd_clauses_to_numbers (parms
, clauses
);
9579 TREE_VALUE (TREE_VALUE (t
)) = clauses
;
9581 TREE_VALUE (t
) = NULL_TREE
;
9583 /* If the first attribute argument is an identifier, don't
9584 pass it through tsubst. Attributes like mode, format,
9585 cleanup and several target specific attributes expect it
9587 else if (attribute_takes_identifier_p (get_attribute_name (t
))
9591 = tsubst_expr (TREE_CHAIN (TREE_VALUE (t
)), args
, complain
,
9593 /*integral_constant_expression_p=*/false);
9594 if (chain
!= TREE_CHAIN (TREE_VALUE (t
)))
9596 = tree_cons (NULL_TREE
, TREE_VALUE (TREE_VALUE (t
)),
9599 else if (TREE_VALUE (t
) && PACK_EXPANSION_P (TREE_VALUE (t
)))
9601 /* An attribute pack expansion. */
9602 tree purp
= TREE_PURPOSE (t
);
9603 tree pack
= (tsubst_pack_expansion
9604 (TREE_VALUE (t
), args
, complain
, in_decl
));
9605 int len
= TREE_VEC_LENGTH (pack
);
9606 for (int i
= 0; i
< len
; ++i
)
9608 tree elt
= TREE_VEC_ELT (pack
, i
);
9609 *q
= build_tree_list (purp
, elt
);
9610 q
= &TREE_CHAIN (*q
);
9616 = tsubst_expr (TREE_VALUE (t
), args
, complain
, in_decl
,
9617 /*integral_constant_expression_p=*/false);
9619 q
= &TREE_CHAIN (t
);
9622 p
= &TREE_CHAIN (t
);
9625 cplus_decl_attributes (decl_p
, late_attrs
, attr_flags
);
9629 /* Perform (or defer) access check for typedefs that were referenced
9630 from within the template TMPL code.
9631 This is a subroutine of instantiate_decl and instantiate_class_template.
9632 TMPL is the template to consider and TARGS is the list of arguments of
9636 perform_typedefs_access_check (tree tmpl
, tree targs
)
9638 location_t saved_location
;
9640 qualified_typedef_usage_t
*iter
;
9643 || (!CLASS_TYPE_P (tmpl
)
9644 && TREE_CODE (tmpl
) != FUNCTION_DECL
))
9647 saved_location
= input_location
;
9648 FOR_EACH_VEC_SAFE_ELT (get_types_needing_access_check (tmpl
), i
, iter
)
9650 tree type_decl
= iter
->typedef_decl
;
9651 tree type_scope
= iter
->context
;
9653 if (!type_decl
|| !type_scope
|| !CLASS_TYPE_P (type_scope
))
9656 if (uses_template_parms (type_decl
))
9657 type_decl
= tsubst (type_decl
, targs
, tf_error
, NULL_TREE
);
9658 if (uses_template_parms (type_scope
))
9659 type_scope
= tsubst (type_scope
, targs
, tf_error
, NULL_TREE
);
9661 /* Make access check error messages point to the location
9662 of the use of the typedef. */
9663 input_location
= iter
->locus
;
9664 perform_or_defer_access_check (TYPE_BINFO (type_scope
),
9665 type_decl
, type_decl
,
9666 tf_warning_or_error
);
9668 input_location
= saved_location
;
9672 instantiate_class_template_1 (tree type
)
9674 tree templ
, args
, pattern
, t
, member
;
9678 unsigned int saved_maximum_field_alignment
;
9681 if (type
== error_mark_node
)
9682 return error_mark_node
;
9684 if (COMPLETE_OR_OPEN_TYPE_P (type
)
9685 || uses_template_parms (type
))
9688 /* Figure out which template is being instantiated. */
9689 templ
= most_general_template (CLASSTYPE_TI_TEMPLATE (type
));
9690 gcc_assert (TREE_CODE (templ
) == TEMPLATE_DECL
);
9692 /* Determine what specialization of the original template to
9694 t
= most_specialized_partial_spec (type
, tf_warning_or_error
);
9695 if (t
== error_mark_node
)
9697 TYPE_BEING_DEFINED (type
) = 1;
9698 return error_mark_node
;
9702 /* This TYPE is actually an instantiation of a partial
9703 specialization. We replace the innermost set of ARGS with
9704 the arguments appropriate for substitution. For example,
9707 template <class T> struct S {};
9708 template <class T> struct S<T*> {};
9710 and supposing that we are instantiating S<int*>, ARGS will
9711 presently be {int*} -- but we need {int}. */
9712 pattern
= TREE_TYPE (t
);
9713 args
= TREE_PURPOSE (t
);
9717 pattern
= TREE_TYPE (templ
);
9718 args
= CLASSTYPE_TI_ARGS (type
);
9721 /* If the template we're instantiating is incomplete, then clearly
9722 there's nothing we can do. */
9723 if (!COMPLETE_TYPE_P (pattern
))
9726 /* If we've recursively instantiated too many templates, stop. */
9727 if (! push_tinst_level (type
))
9730 /* Now we're really doing the instantiation. Mark the type as in
9731 the process of being defined. */
9732 TYPE_BEING_DEFINED (type
) = 1;
9734 /* We may be in the middle of deferred access check. Disable
9736 push_deferring_access_checks (dk_no_deferred
);
9738 int saved_unevaluated_operand
= cp_unevaluated_operand
;
9739 int saved_inhibit_evaluation_warnings
= c_inhibit_evaluation_warnings
;
9741 fn_context
= decl_function_context (TYPE_MAIN_DECL (type
));
9742 /* Also avoid push_to_top_level for a lambda in an NSDMI. */
9743 if (!fn_context
&& LAMBDA_TYPE_P (type
) && TYPE_CLASS_SCOPE_P (type
))
9744 fn_context
= error_mark_node
;
9746 push_to_top_level ();
9749 cp_unevaluated_operand
= 0;
9750 c_inhibit_evaluation_warnings
= 0;
9752 /* Use #pragma pack from the template context. */
9753 saved_maximum_field_alignment
= maximum_field_alignment
;
9754 maximum_field_alignment
= TYPE_PRECISION (pattern
);
9756 SET_CLASSTYPE_INTERFACE_UNKNOWN (type
);
9758 /* Set the input location to the most specialized template definition.
9759 This is needed if tsubsting causes an error. */
9760 typedecl
= TYPE_MAIN_DECL (pattern
);
9761 input_location
= DECL_SOURCE_LOCATION (TYPE_NAME (type
)) =
9762 DECL_SOURCE_LOCATION (typedecl
);
9764 TYPE_PACKED (type
) = TYPE_PACKED (pattern
);
9765 TYPE_ALIGN (type
) = TYPE_ALIGN (pattern
);
9766 TYPE_USER_ALIGN (type
) = TYPE_USER_ALIGN (pattern
);
9767 TYPE_FOR_JAVA (type
) = TYPE_FOR_JAVA (pattern
); /* For libjava's JArray<T> */
9768 if (ANON_AGGR_TYPE_P (pattern
))
9769 SET_ANON_AGGR_TYPE_P (type
);
9770 if (CLASSTYPE_VISIBILITY_SPECIFIED (pattern
))
9772 CLASSTYPE_VISIBILITY_SPECIFIED (type
) = 1;
9773 CLASSTYPE_VISIBILITY (type
) = CLASSTYPE_VISIBILITY (pattern
);
9774 /* Adjust visibility for template arguments. */
9775 determine_visibility (TYPE_MAIN_DECL (type
));
9777 if (CLASS_TYPE_P (type
))
9778 CLASSTYPE_FINAL (type
) = CLASSTYPE_FINAL (pattern
);
9780 pbinfo
= TYPE_BINFO (pattern
);
9782 /* We should never instantiate a nested class before its enclosing
9783 class; we need to look up the nested class by name before we can
9784 instantiate it, and that lookup should instantiate the enclosing
9786 gcc_assert (!DECL_CLASS_SCOPE_P (TYPE_MAIN_DECL (pattern
))
9787 || COMPLETE_OR_OPEN_TYPE_P (TYPE_CONTEXT (type
)));
9789 base_list
= NULL_TREE
;
9790 if (BINFO_N_BASE_BINFOS (pbinfo
))
9796 /* We must enter the scope containing the type, as that is where
9797 the accessibility of types named in dependent bases are
9799 pushed_scope
= push_scope (CP_TYPE_CONTEXT (type
));
9801 /* Substitute into each of the bases to determine the actual
9803 for (i
= 0; BINFO_BASE_ITERATE (pbinfo
, i
, pbase_binfo
); i
++)
9806 tree access
= BINFO_BASE_ACCESS (pbinfo
, i
);
9807 tree expanded_bases
= NULL_TREE
;
9810 if (PACK_EXPANSION_P (BINFO_TYPE (pbase_binfo
)))
9813 tsubst_pack_expansion (BINFO_TYPE (pbase_binfo
),
9814 args
, tf_error
, NULL_TREE
);
9815 if (expanded_bases
== error_mark_node
)
9818 len
= TREE_VEC_LENGTH (expanded_bases
);
9821 for (idx
= 0; idx
< len
; idx
++)
9824 /* Extract the already-expanded base class. */
9825 base
= TREE_VEC_ELT (expanded_bases
, idx
);
9827 /* Substitute to figure out the base class. */
9828 base
= tsubst (BINFO_TYPE (pbase_binfo
), args
, tf_error
,
9831 if (base
== error_mark_node
)
9834 base_list
= tree_cons (access
, base
, base_list
);
9835 if (BINFO_VIRTUAL_P (pbase_binfo
))
9836 TREE_TYPE (base_list
) = integer_type_node
;
9840 /* The list is now in reverse order; correct that. */
9841 base_list
= nreverse (base_list
);
9844 pop_scope (pushed_scope
);
9846 /* Now call xref_basetypes to set up all the base-class
9848 xref_basetypes (type
, base_list
);
9850 apply_late_template_attributes (&type
, TYPE_ATTRIBUTES (pattern
),
9851 (int) ATTR_FLAG_TYPE_IN_PLACE
,
9852 args
, tf_error
, NULL_TREE
);
9853 fixup_attribute_variants (type
);
9855 /* Now that our base classes are set up, enter the scope of the
9856 class, so that name lookups into base classes, etc. will work
9857 correctly. This is precisely analogous to what we do in
9858 begin_class_definition when defining an ordinary non-template
9859 class, except we also need to push the enclosing classes. */
9860 push_nested_class (type
);
9862 /* Now members are processed in the order of declaration. */
9863 for (member
= CLASSTYPE_DECL_LIST (pattern
);
9864 member
; member
= TREE_CHAIN (member
))
9866 tree t
= TREE_VALUE (member
);
9868 if (TREE_PURPOSE (member
))
9872 /* Build new CLASSTYPE_NESTED_UTDS. */
9875 bool class_template_p
;
9877 class_template_p
= (TREE_CODE (t
) != ENUMERAL_TYPE
9878 && TYPE_LANG_SPECIFIC (t
)
9879 && CLASSTYPE_IS_TEMPLATE (t
));
9880 /* If the member is a class template, then -- even after
9881 substitution -- there may be dependent types in the
9882 template argument list for the class. We increment
9883 PROCESSING_TEMPLATE_DECL so that dependent_type_p, as
9884 that function will assume that no types are dependent
9885 when outside of a template. */
9886 if (class_template_p
)
9887 ++processing_template_decl
;
9888 newtag
= tsubst (t
, args
, tf_error
, NULL_TREE
);
9889 if (class_template_p
)
9890 --processing_template_decl
;
9891 if (newtag
== error_mark_node
)
9894 if (TREE_CODE (newtag
) != ENUMERAL_TYPE
)
9896 tree name
= TYPE_IDENTIFIER (t
);
9898 if (class_template_p
)
9899 /* Unfortunately, lookup_template_class sets
9900 CLASSTYPE_IMPLICIT_INSTANTIATION for a partial
9901 instantiation (i.e., for the type of a member
9902 template class nested within a template class.)
9903 This behavior is required for
9904 maybe_process_partial_specialization to work
9905 correctly, but is not accurate in this case;
9906 the TAG is not an instantiation of anything.
9907 (The corresponding TEMPLATE_DECL is an
9908 instantiation, but the TYPE is not.) */
9909 CLASSTYPE_USE_TEMPLATE (newtag
) = 0;
9911 /* Now, we call pushtag to put this NEWTAG into the scope of
9912 TYPE. We first set up the IDENTIFIER_TYPE_VALUE to avoid
9913 pushtag calling push_template_decl. We don't have to do
9914 this for enums because it will already have been done in
9917 SET_IDENTIFIER_TYPE_VALUE (name
, newtag
);
9918 pushtag (name
, newtag
, /*tag_scope=*/ts_current
);
9921 else if (DECL_DECLARES_FUNCTION_P (t
))
9923 /* Build new TYPE_METHODS. */
9926 if (TREE_CODE (t
) == TEMPLATE_DECL
)
9927 ++processing_template_decl
;
9928 r
= tsubst (t
, args
, tf_error
, NULL_TREE
);
9929 if (TREE_CODE (t
) == TEMPLATE_DECL
)
9930 --processing_template_decl
;
9931 set_current_access_from_decl (r
);
9932 finish_member_declaration (r
);
9933 /* Instantiate members marked with attribute used. */
9934 if (r
!= error_mark_node
&& DECL_PRESERVE_P (r
))
9936 if (TREE_CODE (r
) == FUNCTION_DECL
9937 && DECL_OMP_DECLARE_REDUCTION_P (r
))
9938 cp_check_omp_declare_reduction (r
);
9940 else if (DECL_CLASS_TEMPLATE_P (t
)
9941 && LAMBDA_TYPE_P (TREE_TYPE (t
)))
9942 /* A closure type for a lambda in a default argument for a
9943 member template. Ignore it; it will be instantiated with
9944 the default argument. */;
9947 /* Build new TYPE_FIELDS. */
9948 if (TREE_CODE (t
) == STATIC_ASSERT
)
9952 ++c_inhibit_evaluation_warnings
;
9954 tsubst_expr (STATIC_ASSERT_CONDITION (t
), args
,
9955 tf_warning_or_error
, NULL_TREE
,
9956 /*integral_constant_expression_p=*/true);
9957 --c_inhibit_evaluation_warnings
;
9959 finish_static_assert (condition
,
9960 STATIC_ASSERT_MESSAGE (t
),
9961 STATIC_ASSERT_SOURCE_LOCATION (t
),
9964 else if (TREE_CODE (t
) != CONST_DECL
)
9967 tree vec
= NULL_TREE
;
9970 /* The file and line for this declaration, to
9971 assist in error message reporting. Since we
9972 called push_tinst_level above, we don't need to
9974 input_location
= DECL_SOURCE_LOCATION (t
);
9976 if (TREE_CODE (t
) == TEMPLATE_DECL
)
9977 ++processing_template_decl
;
9978 r
= tsubst (t
, args
, tf_warning_or_error
, NULL_TREE
);
9979 if (TREE_CODE (t
) == TEMPLATE_DECL
)
9980 --processing_template_decl
;
9982 if (TREE_CODE (r
) == TREE_VEC
)
9984 /* A capture pack became multiple fields. */
9986 len
= TREE_VEC_LENGTH (vec
);
9989 for (int i
= 0; i
< len
; ++i
)
9992 r
= TREE_VEC_ELT (vec
, i
);
9997 [t]he initialization (and any associated
9998 side-effects) of a static data member does
9999 not occur unless the static data member is
10000 itself used in a way that requires the
10001 definition of the static data member to
10004 Therefore, we do not substitute into the
10005 initialized for the static data member here. */
10006 finish_static_data_member_decl
10008 /*init=*/NULL_TREE
,
10009 /*init_const_expr_p=*/false,
10010 /*asmspec_tree=*/NULL_TREE
,
10012 /* Instantiate members marked with attribute used. */
10013 if (r
!= error_mark_node
&& DECL_PRESERVE_P (r
))
10016 else if (TREE_CODE (r
) == FIELD_DECL
)
10018 /* Determine whether R has a valid type and can be
10019 completed later. If R is invalid, then its type
10020 is replaced by error_mark_node. */
10021 tree rtype
= TREE_TYPE (r
);
10022 if (can_complete_type_without_circularity (rtype
))
10023 complete_type (rtype
);
10025 if (!COMPLETE_TYPE_P (rtype
))
10027 cxx_incomplete_type_error (r
, rtype
);
10028 TREE_TYPE (r
) = error_mark_node
;
10032 /* If it is a TYPE_DECL for a class-scoped ENUMERAL_TYPE,
10033 such a thing will already have been added to the field
10034 list by tsubst_enum in finish_member_declaration in the
10035 CLASSTYPE_NESTED_UTDS case above. */
10036 if (!(TREE_CODE (r
) == TYPE_DECL
10037 && TREE_CODE (TREE_TYPE (r
)) == ENUMERAL_TYPE
10038 && DECL_ARTIFICIAL (r
)))
10040 set_current_access_from_decl (r
);
10041 finish_member_declaration (r
);
10049 if (TYPE_P (t
) || DECL_CLASS_TEMPLATE_P (t
)
10050 || DECL_TEMPLATE_TEMPLATE_PARM_P (t
))
10052 /* Build new CLASSTYPE_FRIEND_CLASSES. */
10054 tree friend_type
= t
;
10055 bool adjust_processing_template_decl
= false;
10057 if (TREE_CODE (friend_type
) == TEMPLATE_DECL
)
10059 /* template <class T> friend class C; */
10060 friend_type
= tsubst_friend_class (friend_type
, args
);
10061 adjust_processing_template_decl
= true;
10063 else if (TREE_CODE (friend_type
) == UNBOUND_CLASS_TEMPLATE
)
10065 /* template <class T> friend class C::D; */
10066 friend_type
= tsubst (friend_type
, args
,
10067 tf_warning_or_error
, NULL_TREE
);
10068 if (TREE_CODE (friend_type
) == TEMPLATE_DECL
)
10069 friend_type
= TREE_TYPE (friend_type
);
10070 adjust_processing_template_decl
= true;
10072 else if (TREE_CODE (friend_type
) == TYPENAME_TYPE
10073 || TREE_CODE (friend_type
) == TEMPLATE_TYPE_PARM
)
10075 /* This could be either
10079 when dependent_type_p is false or
10081 template <class U> friend class T::C;
10084 friend_type
= tsubst (friend_type
, args
,
10085 tf_warning_or_error
, NULL_TREE
);
10086 /* Bump processing_template_decl for correct
10087 dependent_type_p calculation. */
10088 ++processing_template_decl
;
10089 if (dependent_type_p (friend_type
))
10090 adjust_processing_template_decl
= true;
10091 --processing_template_decl
;
10093 else if (!CLASSTYPE_USE_TEMPLATE (friend_type
)
10094 && hidden_name_p (TYPE_NAME (friend_type
)))
10098 where C hasn't been declared yet. Let's lookup name
10099 from namespace scope directly, bypassing any name that
10100 come from dependent base class. */
10101 tree ns
= decl_namespace_context (TYPE_MAIN_DECL (friend_type
));
10103 /* The call to xref_tag_from_type does injection for friend
10105 push_nested_namespace (ns
);
10107 xref_tag_from_type (friend_type
, NULL_TREE
,
10108 /*tag_scope=*/ts_current
);
10109 pop_nested_namespace (ns
);
10111 else if (uses_template_parms (friend_type
))
10112 /* friend class C<T>; */
10113 friend_type
= tsubst (friend_type
, args
,
10114 tf_warning_or_error
, NULL_TREE
);
10119 where C is already declared or
10121 friend class C<int>;
10123 We don't have to do anything in these cases. */
10125 if (adjust_processing_template_decl
)
10126 /* Trick make_friend_class into realizing that the friend
10127 we're adding is a template, not an ordinary class. It's
10128 important that we use make_friend_class since it will
10129 perform some error-checking and output cross-reference
10131 ++processing_template_decl
;
10133 if (friend_type
!= error_mark_node
)
10134 make_friend_class (type
, friend_type
, /*complain=*/false);
10136 if (adjust_processing_template_decl
)
10137 --processing_template_decl
;
10141 /* Build new DECL_FRIENDLIST. */
10144 /* The file and line for this declaration, to
10145 assist in error message reporting. Since we
10146 called push_tinst_level above, we don't need to
10148 input_location
= DECL_SOURCE_LOCATION (t
);
10150 if (TREE_CODE (t
) == TEMPLATE_DECL
)
10152 ++processing_template_decl
;
10153 push_deferring_access_checks (dk_no_check
);
10156 r
= tsubst_friend_function (t
, args
);
10157 add_friend (type
, r
, /*complain=*/false);
10158 if (TREE_CODE (t
) == TEMPLATE_DECL
)
10160 pop_deferring_access_checks ();
10161 --processing_template_decl
;
10169 /* Restore these before substituting into the lambda capture
10171 cp_unevaluated_operand
= saved_unevaluated_operand
;
10172 c_inhibit_evaluation_warnings
= saved_inhibit_evaluation_warnings
;
10175 if (tree expr
= CLASSTYPE_LAMBDA_EXPR (type
))
10177 tree decl
= lambda_function (type
);
10180 if (!DECL_TEMPLATE_INFO (decl
)
10181 || DECL_TEMPLATE_RESULT (DECL_TI_TEMPLATE (decl
)) != decl
)
10182 instantiate_decl (decl
, false, false);
10184 /* We need to instantiate the capture list from the template
10185 after we've instantiated the closure members, but before we
10186 consider adding the conversion op. Also keep any captures
10187 that may have been added during instantiation of the op(). */
10188 tree tmpl_expr
= CLASSTYPE_LAMBDA_EXPR (pattern
);
10190 = tsubst_copy_and_build (LAMBDA_EXPR_CAPTURE_LIST (tmpl_expr
),
10191 args
, tf_warning_or_error
, NULL_TREE
,
10194 LAMBDA_EXPR_CAPTURE_LIST (expr
)
10195 = chainon (tmpl_cap
, nreverse (LAMBDA_EXPR_CAPTURE_LIST (expr
)));
10197 maybe_add_lambda_conv_op (type
);
10200 gcc_assert (errorcount
);
10203 /* Set the file and line number information to whatever is given for
10204 the class itself. This puts error messages involving generated
10205 implicit functions at a predictable point, and the same point
10206 that would be used for non-template classes. */
10207 input_location
= DECL_SOURCE_LOCATION (typedecl
);
10209 unreverse_member_declarations (type
);
10210 finish_struct_1 (type
);
10211 TYPE_BEING_DEFINED (type
) = 0;
10213 /* We don't instantiate default arguments for member functions. 14.7.1:
10215 The implicit instantiation of a class template specialization causes
10216 the implicit instantiation of the declarations, but not of the
10217 definitions or default arguments, of the class member functions,
10218 member classes, static data members and member templates.... */
10220 /* Some typedefs referenced from within the template code need to be access
10221 checked at template instantiation time, i.e now. These types were
10222 added to the template at parsing time. Let's get those and perform
10223 the access checks then. */
10224 perform_typedefs_access_check (pattern
, args
);
10225 perform_deferred_access_checks (tf_warning_or_error
);
10226 pop_nested_class ();
10227 maximum_field_alignment
= saved_maximum_field_alignment
;
10229 pop_from_top_level ();
10230 pop_deferring_access_checks ();
10231 pop_tinst_level ();
10233 /* The vtable for a template class can be emitted in any translation
10234 unit in which the class is instantiated. When there is no key
10235 method, however, finish_struct_1 will already have added TYPE to
10236 the keyed_classes list. */
10237 if (TYPE_CONTAINS_VPTR_P (type
) && CLASSTYPE_KEY_METHOD (type
))
10238 keyed_classes
= tree_cons (NULL_TREE
, type
, keyed_classes
);
10243 /* Wrapper for instantiate_class_template_1. */
10246 instantiate_class_template (tree type
)
10249 timevar_push (TV_TEMPLATE_INST
);
10250 ret
= instantiate_class_template_1 (type
);
10251 timevar_pop (TV_TEMPLATE_INST
);
10256 tsubst_template_arg (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
10262 else if (TYPE_P (t
))
10263 r
= tsubst (t
, args
, complain
, in_decl
);
10266 if (!(complain
& tf_warning
))
10267 ++c_inhibit_evaluation_warnings
;
10268 r
= tsubst_expr (t
, args
, complain
, in_decl
,
10269 /*integral_constant_expression_p=*/true);
10270 if (!(complain
& tf_warning
))
10271 --c_inhibit_evaluation_warnings
;
10276 /* Given a function parameter pack TMPL_PARM and some function parameters
10277 instantiated from it at *SPEC_P, return a NONTYPE_ARGUMENT_PACK of them
10278 and set *SPEC_P to point at the next point in the list. */
10281 extract_fnparm_pack (tree tmpl_parm
, tree
*spec_p
)
10283 /* Collect all of the extra "packed" parameters into an
10287 tree argpack
= make_node (NONTYPE_ARGUMENT_PACK
);
10288 tree argtypepack
= cxx_make_type (TYPE_ARGUMENT_PACK
);
10289 tree spec_parm
= *spec_p
;
10292 for (len
= 0; spec_parm
; ++len
, spec_parm
= TREE_CHAIN (spec_parm
))
10294 && !function_parameter_expanded_from_pack_p (spec_parm
, tmpl_parm
))
10297 /* Fill in PARMVEC and PARMTYPEVEC with all of the parameters. */
10298 parmvec
= make_tree_vec (len
);
10299 parmtypevec
= make_tree_vec (len
);
10300 spec_parm
= *spec_p
;
10301 for (i
= 0; i
< len
; i
++, spec_parm
= DECL_CHAIN (spec_parm
))
10303 TREE_VEC_ELT (parmvec
, i
) = spec_parm
;
10304 TREE_VEC_ELT (parmtypevec
, i
) = TREE_TYPE (spec_parm
);
10307 /* Build the argument packs. */
10308 SET_ARGUMENT_PACK_ARGS (argpack
, parmvec
);
10309 SET_ARGUMENT_PACK_ARGS (argtypepack
, parmtypevec
);
10310 TREE_TYPE (argpack
) = argtypepack
;
10311 *spec_p
= spec_parm
;
10316 /* Give a chain SPEC_PARM of PARM_DECLs, pack them into a
10317 NONTYPE_ARGUMENT_PACK. */
10320 make_fnparm_pack (tree spec_parm
)
10322 return extract_fnparm_pack (NULL_TREE
, &spec_parm
);
10325 /* Return 1 if the Ith element of the argument pack ARG_PACK is a
10326 pack expansion with no extra args, 2 if it has extra args, or 0
10327 if it is not a pack expansion. */
10330 argument_pack_element_is_expansion_p (tree arg_pack
, int i
)
10332 tree vec
= ARGUMENT_PACK_ARGS (arg_pack
);
10333 if (i
>= TREE_VEC_LENGTH (vec
))
10335 tree elt
= TREE_VEC_ELT (vec
, i
);
10337 /* A decl pack is itself an expansion. */
10338 elt
= TREE_TYPE (elt
);
10339 if (!PACK_EXPANSION_P (elt
))
10341 if (PACK_EXPANSION_EXTRA_ARGS (elt
))
10347 /* Creates and return an ARGUMENT_PACK_SELECT tree node. */
10350 make_argument_pack_select (tree arg_pack
, unsigned index
)
10352 tree aps
= make_node (ARGUMENT_PACK_SELECT
);
10354 ARGUMENT_PACK_SELECT_FROM_PACK (aps
) = arg_pack
;
10355 ARGUMENT_PACK_SELECT_INDEX (aps
) = index
;
10360 /* This is a subroutine of tsubst_pack_expansion.
10362 It returns TRUE if we need to use the PACK_EXPANSION_EXTRA_ARGS
10363 mechanism to store the (non complete list of) arguments of the
10364 substitution and return a non substituted pack expansion, in order
10365 to wait for when we have enough arguments to really perform the
10369 use_pack_expansion_extra_args_p (tree parm_packs
,
10371 bool has_empty_arg
)
10373 /* If one pack has an expansion and another pack has a normal
10374 argument or if one pack has an empty argument and an another
10375 one hasn't then tsubst_pack_expansion cannot perform the
10376 substitution and need to fall back on the
10377 PACK_EXPANSION_EXTRA mechanism. */
10378 if (parm_packs
== NULL_TREE
)
10380 else if (has_empty_arg
)
10383 bool has_expansion_arg
= false;
10384 for (int i
= 0 ; i
< arg_pack_len
; ++i
)
10386 bool has_non_expansion_arg
= false;
10387 for (tree parm_pack
= parm_packs
;
10389 parm_pack
= TREE_CHAIN (parm_pack
))
10391 tree arg
= TREE_VALUE (parm_pack
);
10393 int exp
= argument_pack_element_is_expansion_p (arg
, i
);
10395 /* We can't substitute a pack expansion with extra args into
10399 has_expansion_arg
= true;
10401 has_non_expansion_arg
= true;
10404 if (has_expansion_arg
&& has_non_expansion_arg
)
10410 /* [temp.variadic]/6 says that:
10412 The instantiation of a pack expansion [...]
10413 produces a list E1,E2, ..., En, where N is the number of elements
10414 in the pack expansion parameters.
10416 This subroutine of tsubst_pack_expansion produces one of these Ei.
10418 PATTERN is the pattern of the pack expansion. PARM_PACKS is a
10419 TREE_LIST in which each TREE_PURPOSE is a parameter pack of
10420 PATTERN, and each TREE_VALUE is its corresponding argument pack.
10421 INDEX is the index 'i' of the element Ei to produce. ARGS,
10422 COMPLAIN, and IN_DECL are the same parameters as for the
10423 tsubst_pack_expansion function.
10425 The function returns the resulting Ei upon successful completion,
10426 or error_mark_node.
10428 Note that this function possibly modifies the ARGS parameter, so
10429 it's the responsibility of the caller to restore it. */
10432 gen_elem_of_pack_expansion_instantiation (tree pattern
,
10435 tree args
/* This parm gets
10437 tsubst_flags_t complain
,
10441 bool ith_elem_is_expansion
= false;
10443 /* For each parameter pack, change the substitution of the parameter
10444 pack to the ith argument in its argument pack, then expand the
10446 for (tree pack
= parm_packs
; pack
; pack
= TREE_CHAIN (pack
))
10448 tree parm
= TREE_PURPOSE (pack
);
10449 tree arg_pack
= TREE_VALUE (pack
);
10450 tree aps
; /* instance of ARGUMENT_PACK_SELECT. */
10452 ith_elem_is_expansion
|=
10453 argument_pack_element_is_expansion_p (arg_pack
, index
);
10455 /* Select the Ith argument from the pack. */
10456 if (TREE_CODE (parm
) == PARM_DECL
10457 || TREE_CODE (parm
) == FIELD_DECL
)
10461 aps
= make_argument_pack_select (arg_pack
, index
);
10462 if (!mark_used (parm
, complain
) && !(complain
& tf_error
))
10463 return error_mark_node
;
10464 register_local_specialization (aps
, parm
);
10467 aps
= retrieve_local_specialization (parm
);
10472 template_parm_level_and_index (parm
, &level
, &idx
);
10476 aps
= make_argument_pack_select (arg_pack
, index
);
10477 /* Update the corresponding argument. */
10478 TMPL_ARG (args
, level
, idx
) = aps
;
10481 /* Re-use the ARGUMENT_PACK_SELECT. */
10482 aps
= TMPL_ARG (args
, level
, idx
);
10484 ARGUMENT_PACK_SELECT_INDEX (aps
) = index
;
10487 /* Substitute into the PATTERN with the (possibly altered)
10489 if (pattern
== in_decl
)
10490 /* Expanding a fixed parameter pack from
10491 coerce_template_parameter_pack. */
10492 t
= tsubst_decl (pattern
, args
, complain
);
10493 else if (pattern
== error_mark_node
)
10494 t
= error_mark_node
;
10495 else if (constraint_p (pattern
))
10497 if (processing_template_decl
)
10498 t
= tsubst_constraint (pattern
, args
, complain
, in_decl
);
10500 t
= (constraints_satisfied_p (pattern
, args
)
10501 ? boolean_true_node
: boolean_false_node
);
10503 else if (!TYPE_P (pattern
))
10504 t
= tsubst_expr (pattern
, args
, complain
, in_decl
,
10505 /*integral_constant_expression_p=*/false);
10507 t
= tsubst (pattern
, args
, complain
, in_decl
);
10509 /* If the Ith argument pack element is a pack expansion, then
10510 the Ith element resulting from the substituting is going to
10511 be a pack expansion as well. */
10512 if (ith_elem_is_expansion
)
10513 t
= make_pack_expansion (t
);
10518 /* When the unexpanded parameter pack in a fold expression expands to an empty
10519 sequence, the value of the expression is as follows; the program is
10520 ill-formed if the operator is not listed in this table.
10531 expand_empty_fold (tree t
, tsubst_flags_t complain
)
10533 tree_code code
= (tree_code
)TREE_INT_CST_LOW (TREE_OPERAND (t
, 0));
10534 if (!FOLD_EXPR_MODIFY_P (t
))
10538 return integer_one_node
;
10540 return integer_zero_node
;
10542 return integer_minus_one_node
;
10544 return integer_zero_node
;
10545 case TRUTH_ANDIF_EXPR
:
10546 return boolean_true_node
;
10547 case TRUTH_ORIF_EXPR
:
10548 return boolean_false_node
;
10549 case COMPOUND_EXPR
:
10555 if (complain
& tf_error
)
10556 error_at (location_of (t
),
10557 "fold of empty expansion over %O", code
);
10558 return error_mark_node
;
10561 /* Given a fold-expression T and a current LEFT and RIGHT operand,
10562 form an expression that combines the two terms using the
10566 fold_expression (tree t
, tree left
, tree right
, tsubst_flags_t complain
)
10568 tree op
= FOLD_EXPR_OP (t
);
10569 tree_code code
= (tree_code
)TREE_INT_CST_LOW (op
);
10571 // Handle compound assignment operators.
10572 if (FOLD_EXPR_MODIFY_P (t
))
10573 return build_x_modify_expr (input_location
, left
, code
, right
, complain
);
10577 case COMPOUND_EXPR
:
10578 return build_x_compound_expr (input_location
, left
, right
, complain
);
10580 return build_m_component_ref (left
, right
, complain
);
10582 return build_x_binary_op (input_location
, code
,
10583 left
, TREE_CODE (left
),
10584 right
, TREE_CODE (right
),
10590 /* Substitute ARGS into the pack of a fold expression T. */
10593 tsubst_fold_expr_pack (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
10595 return tsubst_pack_expansion (FOLD_EXPR_PACK (t
), args
, complain
, in_decl
);
10598 /* Substitute ARGS into the pack of a fold expression T. */
10601 tsubst_fold_expr_init (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
10603 return tsubst_expr (FOLD_EXPR_INIT (t
), args
, complain
, in_decl
, false);
10606 /* Expand a PACK of arguments into a grouped as left fold.
10607 Given a pack containing elements A0, A1, ..., An and an
10608 operator @, this builds the expression:
10610 ((A0 @ A1) @ A2) ... @ An
10612 Note that PACK must not be empty.
10614 The operator is defined by the original fold expression T. */
10617 expand_left_fold (tree t
, tree pack
, tsubst_flags_t complain
)
10619 tree left
= TREE_VEC_ELT (pack
, 0);
10620 for (int i
= 1; i
< TREE_VEC_LENGTH (pack
); ++i
)
10622 tree right
= TREE_VEC_ELT (pack
, i
);
10623 left
= fold_expression (t
, left
, right
, complain
);
10628 /* Substitute into a unary left fold expression. */
10631 tsubst_unary_left_fold (tree t
, tree args
, tsubst_flags_t complain
,
10634 tree pack
= tsubst_fold_expr_pack (t
, args
, complain
, in_decl
);
10635 if (TREE_VEC_LENGTH (pack
) == 0)
10636 return expand_empty_fold (t
, complain
);
10638 return expand_left_fold (t
, pack
, complain
);
10641 /* Substitute into a binary left fold expression.
10643 Do ths by building a single (non-empty) vector of argumnts and
10644 building the expression from those elements. */
10647 tsubst_binary_left_fold (tree t
, tree args
, tsubst_flags_t complain
,
10650 tree pack
= tsubst_fold_expr_pack (t
, args
, complain
, in_decl
);
10651 tree init
= tsubst_fold_expr_init (t
, args
, complain
, in_decl
);
10653 tree vec
= make_tree_vec (TREE_VEC_LENGTH (pack
) + 1);
10654 TREE_VEC_ELT (vec
, 0) = init
;
10655 for (int i
= 0; i
< TREE_VEC_LENGTH (pack
); ++i
)
10656 TREE_VEC_ELT (vec
, i
+ 1) = TREE_VEC_ELT (pack
, i
);
10658 return expand_left_fold (t
, vec
, complain
);
10661 /* Expand a PACK of arguments into a grouped as right fold.
10662 Given a pack containing elementns A0, A1, ..., and an
10663 operator @, this builds the expression:
10665 A0@ ... (An-2 @ (An-1 @ An))
10667 Note that PACK must not be empty.
10669 The operator is defined by the original fold expression T. */
10672 expand_right_fold (tree t
, tree pack
, tsubst_flags_t complain
)
10674 // Build the expression.
10675 int n
= TREE_VEC_LENGTH (pack
);
10676 tree right
= TREE_VEC_ELT (pack
, n
- 1);
10677 for (--n
; n
!= 0; --n
)
10679 tree left
= TREE_VEC_ELT (pack
, n
- 1);
10680 right
= fold_expression (t
, left
, right
, complain
);
10685 /* Substitute into a unary right fold expression. */
10688 tsubst_unary_right_fold (tree t
, tree args
, tsubst_flags_t complain
,
10691 tree pack
= tsubst_fold_expr_pack (t
, args
, complain
, in_decl
);
10692 if (TREE_VEC_LENGTH (pack
) == 0)
10693 return expand_empty_fold (t
, complain
);
10695 return expand_right_fold (t
, pack
, complain
);
10698 /* Substitute into a binary right fold expression.
10700 Do ths by building a single (non-empty) vector of arguments and
10701 building the expression from those elements. */
10704 tsubst_binary_right_fold (tree t
, tree args
, tsubst_flags_t complain
,
10707 tree pack
= tsubst_fold_expr_pack (t
, args
, complain
, in_decl
);
10708 tree init
= tsubst_fold_expr_init (t
, args
, complain
, in_decl
);
10710 int n
= TREE_VEC_LENGTH (pack
);
10711 tree vec
= make_tree_vec (n
+ 1);
10712 for (int i
= 0; i
< n
; ++i
)
10713 TREE_VEC_ELT (vec
, i
) = TREE_VEC_ELT (pack
, i
);
10714 TREE_VEC_ELT (vec
, n
) = init
;
10716 return expand_right_fold (t
, vec
, complain
);
10720 /* Substitute ARGS into T, which is an pack expansion
10721 (i.e. TYPE_PACK_EXPANSION or EXPR_PACK_EXPANSION). Returns a
10722 TREE_VEC with the substituted arguments, a PACK_EXPANSION_* node
10723 (if only a partial substitution could be performed) or
10724 ERROR_MARK_NODE if there was an error. */
10726 tsubst_pack_expansion (tree t
, tree args
, tsubst_flags_t complain
,
10730 tree pack
, packs
= NULL_TREE
;
10731 bool unsubstituted_packs
= false;
10734 hash_map
<tree
, tree
> *saved_local_specializations
= NULL
;
10735 bool need_local_specializations
= false;
10738 gcc_assert (PACK_EXPANSION_P (t
));
10739 pattern
= PACK_EXPANSION_PATTERN (t
);
10741 /* Add in any args remembered from an earlier partial instantiation. */
10742 args
= add_to_template_args (PACK_EXPANSION_EXTRA_ARGS (t
), args
);
10744 levels
= TMPL_ARGS_DEPTH (args
);
10746 /* Determine the argument packs that will instantiate the parameter
10747 packs used in the expansion expression. While we're at it,
10748 compute the number of arguments to be expanded and make sure it
10750 for (pack
= PACK_EXPANSION_PARAMETER_PACKS (t
); pack
;
10751 pack
= TREE_CHAIN (pack
))
10753 tree parm_pack
= TREE_VALUE (pack
);
10754 tree arg_pack
= NULL_TREE
;
10755 tree orig_arg
= NULL_TREE
;
10758 if (TREE_CODE (parm_pack
) == BASES
)
10760 if (BASES_DIRECT (parm_pack
))
10761 return calculate_direct_bases (tsubst_expr (BASES_TYPE (parm_pack
),
10762 args
, complain
, in_decl
, false));
10764 return calculate_bases (tsubst_expr (BASES_TYPE (parm_pack
),
10765 args
, complain
, in_decl
, false));
10767 if (TREE_CODE (parm_pack
) == PARM_DECL
)
10769 /* We know we have correct local_specializations if this
10770 expansion is at function scope, or if we're dealing with a
10771 local parameter in a requires expression; for the latter,
10772 tsubst_requires_expr set it up appropriately. */
10773 if (PACK_EXPANSION_LOCAL_P (t
) || CONSTRAINT_VAR_P (parm_pack
))
10774 arg_pack
= retrieve_local_specialization (parm_pack
);
10777 /* We can't rely on local_specializations for a parameter
10778 name used later in a function declaration (such as in a
10779 late-specified return type). Even if it exists, it might
10780 have the wrong value for a recursive call. Just make a
10781 dummy decl, since it's only used for its type. */
10782 arg_pack
= tsubst_decl (parm_pack
, args
, complain
);
10783 if (arg_pack
&& DECL_PACK_P (arg_pack
))
10784 /* Partial instantiation of the parm_pack, we can't build
10785 up an argument pack yet. */
10786 arg_pack
= NULL_TREE
;
10788 arg_pack
= make_fnparm_pack (arg_pack
);
10789 need_local_specializations
= true;
10792 else if (TREE_CODE (parm_pack
) == FIELD_DECL
)
10793 arg_pack
= tsubst_copy (parm_pack
, args
, complain
, in_decl
);
10797 template_parm_level_and_index (parm_pack
, &level
, &idx
);
10799 if (level
<= levels
)
10800 arg_pack
= TMPL_ARG (args
, level
, idx
);
10803 orig_arg
= arg_pack
;
10804 if (arg_pack
&& TREE_CODE (arg_pack
) == ARGUMENT_PACK_SELECT
)
10805 arg_pack
= ARGUMENT_PACK_SELECT_FROM_PACK (arg_pack
);
10807 if (arg_pack
&& !ARGUMENT_PACK_P (arg_pack
))
10808 /* This can only happen if we forget to expand an argument
10809 pack somewhere else. Just return an error, silently. */
10811 result
= make_tree_vec (1);
10812 TREE_VEC_ELT (result
, 0) = error_mark_node
;
10819 TREE_VEC_LENGTH (ARGUMENT_PACK_ARGS (arg_pack
));
10821 /* Don't bother trying to do a partial substitution with
10822 incomplete packs; we'll try again after deduction. */
10823 if (ARGUMENT_PACK_INCOMPLETE_P (arg_pack
))
10828 else if (len
!= my_len
)
10830 if (!(complain
& tf_error
))
10831 /* Fail quietly. */;
10832 else if (TREE_CODE (t
) == TYPE_PACK_EXPANSION
)
10833 error ("mismatched argument pack lengths while expanding "
10837 error ("mismatched argument pack lengths while expanding "
10840 return error_mark_node
;
10843 /* Keep track of the parameter packs and their corresponding
10845 packs
= tree_cons (parm_pack
, arg_pack
, packs
);
10846 TREE_TYPE (packs
) = orig_arg
;
10850 /* We can't substitute for this parameter pack. We use a flag as
10851 well as the missing_level counter because function parameter
10852 packs don't have a level. */
10853 unsubstituted_packs
= true;
10857 /* If the expansion is just T..., return the matching argument pack. */
10858 if (!unsubstituted_packs
10859 && TREE_PURPOSE (packs
) == pattern
)
10861 tree args
= ARGUMENT_PACK_ARGS (TREE_VALUE (packs
));
10862 if (TREE_CODE (t
) == TYPE_PACK_EXPANSION
10863 || pack_expansion_args_count (args
))
10865 /* Otherwise use the normal path so we get convert_from_reference. */
10868 /* We cannot expand this expansion expression, because we don't have
10869 all of the argument packs we need. */
10870 if (use_pack_expansion_extra_args_p (packs
, len
, unsubstituted_packs
))
10872 /* We got some full packs, but we can't substitute them in until we
10873 have values for all the packs. So remember these until then. */
10875 t
= make_pack_expansion (pattern
);
10876 PACK_EXPANSION_EXTRA_ARGS (t
) = args
;
10879 else if (unsubstituted_packs
)
10881 /* There were no real arguments, we're just replacing a parameter
10882 pack with another version of itself. Substitute into the
10883 pattern and return a PACK_EXPANSION_*. The caller will need to
10885 if (TREE_CODE (t
) == EXPR_PACK_EXPANSION
)
10886 t
= tsubst_expr (pattern
, args
, complain
, in_decl
,
10887 /*integral_constant_expression_p=*/false);
10889 t
= tsubst (pattern
, args
, complain
, in_decl
);
10890 t
= make_pack_expansion (t
);
10894 gcc_assert (len
>= 0);
10896 if (need_local_specializations
)
10898 /* We're in a late-specified return type, so create our own local
10899 specializations map; the current map is either NULL or (in the
10900 case of recursive unification) might have bindings that we don't
10901 want to use or alter. */
10902 saved_local_specializations
= local_specializations
;
10903 local_specializations
= new hash_map
<tree
, tree
>;
10906 /* For each argument in each argument pack, substitute into the
10908 result
= make_tree_vec (len
);
10909 for (i
= 0; i
< len
; ++i
)
10911 t
= gen_elem_of_pack_expansion_instantiation (pattern
, packs
,
10915 TREE_VEC_ELT (result
, i
) = t
;
10916 if (t
== error_mark_node
)
10918 result
= error_mark_node
;
10923 /* Update ARGS to restore the substitution from parameter packs to
10924 their argument packs. */
10925 for (pack
= packs
; pack
; pack
= TREE_CHAIN (pack
))
10927 tree parm
= TREE_PURPOSE (pack
);
10929 if (TREE_CODE (parm
) == PARM_DECL
10930 || TREE_CODE (parm
) == FIELD_DECL
)
10931 register_local_specialization (TREE_TYPE (pack
), parm
);
10936 if (TREE_VALUE (pack
) == NULL_TREE
)
10939 template_parm_level_and_index (parm
, &level
, &idx
);
10941 /* Update the corresponding argument. */
10942 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (args
))
10943 TREE_VEC_ELT (TREE_VEC_ELT (args
, level
-1 ), idx
) =
10946 TREE_VEC_ELT (args
, idx
) = TREE_TYPE (pack
);
10950 if (need_local_specializations
)
10952 delete local_specializations
;
10953 local_specializations
= saved_local_specializations
;
10959 /* Given PARM_DECL PARM, find the corresponding PARM_DECL in the template
10960 TMPL. We do this using DECL_PARM_INDEX, which should work even with
10961 parameter packs; all parms generated from a function parameter pack will
10962 have the same DECL_PARM_INDEX. */
10965 get_pattern_parm (tree parm
, tree tmpl
)
10967 tree pattern
= DECL_TEMPLATE_RESULT (tmpl
);
10970 if (DECL_ARTIFICIAL (parm
))
10972 for (patparm
= DECL_ARGUMENTS (pattern
);
10973 patparm
; patparm
= DECL_CHAIN (patparm
))
10974 if (DECL_ARTIFICIAL (patparm
)
10975 && DECL_NAME (parm
) == DECL_NAME (patparm
))
10980 patparm
= FUNCTION_FIRST_USER_PARM (DECL_TEMPLATE_RESULT (tmpl
));
10981 patparm
= chain_index (DECL_PARM_INDEX (parm
)-1, patparm
);
10982 gcc_assert (DECL_PARM_INDEX (patparm
)
10983 == DECL_PARM_INDEX (parm
));
10989 /* Substitute ARGS into the vector or list of template arguments T. */
10992 tsubst_template_args (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
10995 int len
, need_new
= 0, i
, expanded_len_adjust
= 0, out
;
10998 if (t
== error_mark_node
)
10999 return error_mark_node
;
11001 len
= TREE_VEC_LENGTH (t
);
11002 elts
= XALLOCAVEC (tree
, len
);
11004 for (i
= 0; i
< len
; i
++)
11006 tree orig_arg
= TREE_VEC_ELT (t
, i
);
11009 if (TREE_CODE (orig_arg
) == TREE_VEC
)
11010 new_arg
= tsubst_template_args (orig_arg
, args
, complain
, in_decl
);
11011 else if (PACK_EXPANSION_P (orig_arg
))
11013 /* Substitute into an expansion expression. */
11014 new_arg
= tsubst_pack_expansion (orig_arg
, args
, complain
, in_decl
);
11016 if (TREE_CODE (new_arg
) == TREE_VEC
)
11017 /* Add to the expanded length adjustment the number of
11018 expanded arguments. We subtract one from this
11019 measurement, because the argument pack expression
11020 itself is already counted as 1 in
11021 LEN. EXPANDED_LEN_ADJUST can actually be negative, if
11022 the argument pack is empty. */
11023 expanded_len_adjust
+= TREE_VEC_LENGTH (new_arg
) - 1;
11025 else if (ARGUMENT_PACK_P (orig_arg
))
11027 /* Substitute into each of the arguments. */
11028 new_arg
= TYPE_P (orig_arg
)
11029 ? cxx_make_type (TREE_CODE (orig_arg
))
11030 : make_node (TREE_CODE (orig_arg
));
11032 SET_ARGUMENT_PACK_ARGS (
11034 tsubst_template_args (ARGUMENT_PACK_ARGS (orig_arg
),
11035 args
, complain
, in_decl
));
11037 if (ARGUMENT_PACK_ARGS (new_arg
) == error_mark_node
)
11038 new_arg
= error_mark_node
;
11040 if (TREE_CODE (new_arg
) == NONTYPE_ARGUMENT_PACK
) {
11041 TREE_TYPE (new_arg
) = tsubst (TREE_TYPE (orig_arg
), args
,
11042 complain
, in_decl
);
11043 TREE_CONSTANT (new_arg
) = TREE_CONSTANT (orig_arg
);
11045 if (TREE_TYPE (new_arg
) == error_mark_node
)
11046 new_arg
= error_mark_node
;
11050 new_arg
= tsubst_template_arg (orig_arg
, args
, complain
, in_decl
);
11052 if (new_arg
== error_mark_node
)
11053 return error_mark_node
;
11056 if (new_arg
!= orig_arg
)
11063 /* Make space for the expanded arguments coming from template
11065 t
= make_tree_vec (len
+ expanded_len_adjust
);
11066 /* ORIG_T can contain TREE_VECs. That happens if ORIG_T contains the
11067 arguments for a member template.
11068 In that case each TREE_VEC in ORIG_T represents a level of template
11069 arguments, and ORIG_T won't carry any non defaulted argument count.
11070 It will rather be the nested TREE_VECs that will carry one.
11071 In other words, ORIG_T carries a non defaulted argument count only
11072 if it doesn't contain any nested TREE_VEC. */
11073 if (NON_DEFAULT_TEMPLATE_ARGS_COUNT (orig_t
))
11075 int count
= GET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (orig_t
);
11076 count
+= expanded_len_adjust
;
11077 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (t
, count
);
11079 for (i
= 0, out
= 0; i
< len
; i
++)
11081 if ((PACK_EXPANSION_P (TREE_VEC_ELT (orig_t
, i
))
11082 || ARGUMENT_PACK_P (TREE_VEC_ELT (orig_t
, i
)))
11083 && TREE_CODE (elts
[i
]) == TREE_VEC
)
11087 /* Now expand the template argument pack "in place". */
11088 for (idx
= 0; idx
< TREE_VEC_LENGTH (elts
[i
]); idx
++, out
++)
11089 TREE_VEC_ELT (t
, out
) = TREE_VEC_ELT (elts
[i
], idx
);
11093 TREE_VEC_ELT (t
, out
) = elts
[i
];
11101 /* Return the result of substituting ARGS into the template parameters
11102 given by PARMS. If there are m levels of ARGS and m + n levels of
11103 PARMS, then the result will contain n levels of PARMS. For
11104 example, if PARMS is `template <class T> template <class U>
11105 template <T*, U, class V>' and ARGS is {{int}, {double}} then the
11106 result will be `template <int*, double, class V>'. */
11109 tsubst_template_parms (tree parms
, tree args
, tsubst_flags_t complain
)
11111 tree r
= NULL_TREE
;
11114 /* When substituting into a template, we must set
11115 PROCESSING_TEMPLATE_DECL as the template parameters may be
11116 dependent if they are based on one-another, and the dependency
11117 predicates are short-circuit outside of templates. */
11118 ++processing_template_decl
;
11120 for (new_parms
= &r
;
11121 parms
&& TMPL_PARMS_DEPTH (parms
) > TMPL_ARGS_DEPTH (args
);
11122 new_parms
= &(TREE_CHAIN (*new_parms
)),
11123 parms
= TREE_CHAIN (parms
))
11126 make_tree_vec (TREE_VEC_LENGTH (TREE_VALUE (parms
)));
11129 for (i
= 0; i
< TREE_VEC_LENGTH (new_vec
); ++i
)
11133 if (parms
== error_mark_node
)
11136 tuple
= TREE_VEC_ELT (TREE_VALUE (parms
), i
);
11138 if (tuple
== error_mark_node
)
11141 TREE_VEC_ELT (new_vec
, i
) =
11142 tsubst_template_parm (tuple
, args
, complain
);
11146 tree_cons (size_int (TMPL_PARMS_DEPTH (parms
)
11147 - TMPL_ARGS_DEPTH (args
)),
11148 new_vec
, NULL_TREE
);
11151 --processing_template_decl
;
11156 /* Return the result of substituting ARGS into one template parameter
11157 given by T. T Must be a TREE_LIST which TREE_VALUE is the template
11158 parameter and which TREE_PURPOSE is the default argument of the
11159 template parameter. */
11162 tsubst_template_parm (tree t
, tree args
, tsubst_flags_t complain
)
11164 tree default_value
, parm_decl
;
11166 if (args
== NULL_TREE
11168 || t
== error_mark_node
)
11171 gcc_assert (TREE_CODE (t
) == TREE_LIST
);
11173 default_value
= TREE_PURPOSE (t
);
11174 parm_decl
= TREE_VALUE (t
);
11176 parm_decl
= tsubst (parm_decl
, args
, complain
, NULL_TREE
);
11177 if (TREE_CODE (parm_decl
) == PARM_DECL
11178 && invalid_nontype_parm_type_p (TREE_TYPE (parm_decl
), complain
))
11179 parm_decl
= error_mark_node
;
11180 default_value
= tsubst_template_arg (default_value
, args
,
11181 complain
, NULL_TREE
);
11183 return build_tree_list (default_value
, parm_decl
);
11186 /* Substitute the ARGS into the indicated aggregate (or enumeration)
11187 type T. If T is not an aggregate or enumeration type, it is
11188 handled as if by tsubst. IN_DECL is as for tsubst. If
11189 ENTERING_SCOPE is nonzero, T is the context for a template which
11190 we are presently tsubst'ing. Return the substituted value. */
11193 tsubst_aggr_type (tree t
,
11195 tsubst_flags_t complain
,
11197 int entering_scope
)
11199 if (t
== NULL_TREE
)
11202 switch (TREE_CODE (t
))
11205 if (TYPE_PTRMEMFUNC_P (t
))
11206 return tsubst (TYPE_PTRMEMFUNC_FN_TYPE (t
), args
, complain
, in_decl
);
11208 /* Else fall through. */
11209 case ENUMERAL_TYPE
:
11211 if (TYPE_TEMPLATE_INFO (t
) && uses_template_parms (t
))
11216 int saved_unevaluated_operand
;
11217 int saved_inhibit_evaluation_warnings
;
11219 /* In "sizeof(X<I>)" we need to evaluate "I". */
11220 saved_unevaluated_operand
= cp_unevaluated_operand
;
11221 cp_unevaluated_operand
= 0;
11222 saved_inhibit_evaluation_warnings
= c_inhibit_evaluation_warnings
;
11223 c_inhibit_evaluation_warnings
= 0;
11225 /* First, determine the context for the type we are looking
11227 context
= TYPE_CONTEXT (t
);
11228 if (context
&& TYPE_P (context
))
11230 context
= tsubst_aggr_type (context
, args
, complain
,
11231 in_decl
, /*entering_scope=*/1);
11232 /* If context is a nested class inside a class template,
11233 it may still need to be instantiated (c++/33959). */
11234 context
= complete_type (context
);
11237 /* Then, figure out what arguments are appropriate for the
11238 type we are trying to find. For example, given:
11240 template <class T> struct S;
11241 template <class T, class U> void f(T, U) { S<U> su; }
11243 and supposing that we are instantiating f<int, double>,
11244 then our ARGS will be {int, double}, but, when looking up
11245 S we only want {double}. */
11246 argvec
= tsubst_template_args (TYPE_TI_ARGS (t
), args
,
11247 complain
, in_decl
);
11248 if (argvec
== error_mark_node
)
11249 r
= error_mark_node
;
11252 r
= lookup_template_class (t
, argvec
, in_decl
, context
,
11253 entering_scope
, complain
);
11254 r
= cp_build_qualified_type_real (r
, cp_type_quals (t
), complain
);
11257 cp_unevaluated_operand
= saved_unevaluated_operand
;
11258 c_inhibit_evaluation_warnings
= saved_inhibit_evaluation_warnings
;
11263 /* This is not a template type, so there's nothing to do. */
11267 return tsubst (t
, args
, complain
, in_decl
);
11271 /* Substitute into the default argument ARG (a default argument for
11272 FN), which has the indicated TYPE. */
11275 tsubst_default_argument (tree fn
, tree type
, tree arg
, tsubst_flags_t complain
)
11277 tree saved_class_ptr
= NULL_TREE
;
11278 tree saved_class_ref
= NULL_TREE
;
11279 int errs
= errorcount
+ sorrycount
;
11281 /* This can happen in invalid code. */
11282 if (TREE_CODE (arg
) == DEFAULT_ARG
)
11285 /* This default argument came from a template. Instantiate the
11286 default argument here, not in tsubst. In the case of
11295 we must be careful to do name lookup in the scope of S<T>,
11296 rather than in the current class. */
11297 push_access_scope (fn
);
11298 /* The "this" pointer is not valid in a default argument. */
11301 saved_class_ptr
= current_class_ptr
;
11302 cp_function_chain
->x_current_class_ptr
= NULL_TREE
;
11303 saved_class_ref
= current_class_ref
;
11304 cp_function_chain
->x_current_class_ref
= NULL_TREE
;
11307 push_deferring_access_checks(dk_no_deferred
);
11308 /* The default argument expression may cause implicitly defined
11309 member functions to be synthesized, which will result in garbage
11310 collection. We must treat this situation as if we were within
11311 the body of function so as to avoid collecting live data on the
11314 arg
= tsubst_expr (arg
, DECL_TI_ARGS (fn
),
11315 complain
, NULL_TREE
,
11316 /*integral_constant_expression_p=*/false);
11318 pop_deferring_access_checks();
11320 /* Restore the "this" pointer. */
11323 cp_function_chain
->x_current_class_ptr
= saved_class_ptr
;
11324 cp_function_chain
->x_current_class_ref
= saved_class_ref
;
11327 if (errorcount
+sorrycount
> errs
11328 && (complain
& tf_warning_or_error
))
11329 inform (input_location
,
11330 " when instantiating default argument for call to %D", fn
);
11332 /* Make sure the default argument is reasonable. */
11333 arg
= check_default_argument (type
, arg
, complain
);
11335 pop_access_scope (fn
);
11340 /* Substitute into all the default arguments for FN. */
11343 tsubst_default_arguments (tree fn
, tsubst_flags_t complain
)
11348 tmpl_args
= DECL_TI_ARGS (fn
);
11350 /* If this function is not yet instantiated, we certainly don't need
11351 its default arguments. */
11352 if (uses_template_parms (tmpl_args
))
11354 /* Don't do this again for clones. */
11355 if (DECL_CLONED_FUNCTION_P (fn
))
11358 for (arg
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
11360 arg
= TREE_CHAIN (arg
))
11361 if (TREE_PURPOSE (arg
))
11362 TREE_PURPOSE (arg
) = tsubst_default_argument (fn
,
11364 TREE_PURPOSE (arg
),
11368 /* Substitute the ARGS into the T, which is a _DECL. Return the
11369 result of the substitution. Issue error and warning messages under
11370 control of COMPLAIN. */
11373 tsubst_decl (tree t
, tree args
, tsubst_flags_t complain
)
11375 #define RETURN(EXP) do { r = (EXP); goto out; } while(0)
11376 location_t saved_loc
;
11377 tree r
= NULL_TREE
;
11379 hashval_t hash
= 0;
11381 /* Set the filename and linenumber to improve error-reporting. */
11382 saved_loc
= input_location
;
11383 input_location
= DECL_SOURCE_LOCATION (t
);
11385 switch (TREE_CODE (t
))
11387 case TEMPLATE_DECL
:
11389 /* We can get here when processing a member function template,
11390 member class template, or template template parameter. */
11391 tree decl
= DECL_TEMPLATE_RESULT (t
);
11396 if (DECL_TEMPLATE_TEMPLATE_PARM_P (t
))
11398 /* Template template parameter is treated here. */
11399 tree new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
11400 if (new_type
== error_mark_node
)
11401 r
= error_mark_node
;
11402 /* If we get a real template back, return it. This can happen in
11403 the context of most_specialized_partial_spec. */
11404 else if (TREE_CODE (new_type
) == TEMPLATE_DECL
)
11407 /* The new TEMPLATE_DECL was built in
11408 reduce_template_parm_level. */
11409 r
= TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL (new_type
);
11413 /* We might already have an instance of this template.
11414 The ARGS are for the surrounding class type, so the
11415 full args contain the tsubst'd args for the context,
11416 plus the innermost args from the template decl. */
11417 tmpl_args
= DECL_CLASS_TEMPLATE_P (t
)
11418 ? CLASSTYPE_TI_ARGS (TREE_TYPE (t
))
11419 : DECL_TI_ARGS (DECL_TEMPLATE_RESULT (t
));
11420 /* Because this is a template, the arguments will still be
11421 dependent, even after substitution. If
11422 PROCESSING_TEMPLATE_DECL is not set, the dependency
11423 predicates will short-circuit. */
11424 ++processing_template_decl
;
11425 full_args
= tsubst_template_args (tmpl_args
, args
,
11426 complain
, in_decl
);
11427 --processing_template_decl
;
11428 if (full_args
== error_mark_node
)
11429 RETURN (error_mark_node
);
11431 /* If this is a default template template argument,
11432 tsubst might not have changed anything. */
11433 if (full_args
== tmpl_args
)
11436 hash
= hash_tmpl_and_args (t
, full_args
);
11437 spec
= retrieve_specialization (t
, full_args
, hash
);
11438 if (spec
!= NULL_TREE
)
11444 /* Make a new template decl. It will be similar to the
11445 original, but will record the current template arguments.
11446 We also create a new function declaration, which is just
11447 like the old one, but points to this new template, rather
11448 than the old one. */
11450 gcc_assert (DECL_LANG_SPECIFIC (r
) != 0);
11451 DECL_CHAIN (r
) = NULL_TREE
;
11453 // Build new template info linking to the original template decl.
11454 DECL_TEMPLATE_INFO (r
) = build_template_info (t
, args
);
11456 if (TREE_CODE (decl
) == TYPE_DECL
11457 && !TYPE_DECL_ALIAS_P (decl
))
11460 ++processing_template_decl
;
11461 new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
11462 --processing_template_decl
;
11463 if (new_type
== error_mark_node
)
11464 RETURN (error_mark_node
);
11466 TREE_TYPE (r
) = new_type
;
11467 /* For a partial specialization, we need to keep pointing to
11468 the primary template. */
11469 if (!DECL_TEMPLATE_SPECIALIZATION (t
))
11470 CLASSTYPE_TI_TEMPLATE (new_type
) = r
;
11471 DECL_TEMPLATE_RESULT (r
) = TYPE_MAIN_DECL (new_type
);
11472 DECL_TI_ARGS (r
) = CLASSTYPE_TI_ARGS (new_type
);
11473 DECL_CONTEXT (r
) = TYPE_CONTEXT (new_type
);
11478 ++processing_template_decl
;
11479 new_decl
= tsubst (decl
, args
, complain
, in_decl
);
11480 --processing_template_decl
;
11481 if (new_decl
== error_mark_node
)
11482 RETURN (error_mark_node
);
11484 DECL_TEMPLATE_RESULT (r
) = new_decl
;
11485 DECL_TI_TEMPLATE (new_decl
) = r
;
11486 TREE_TYPE (r
) = TREE_TYPE (new_decl
);
11487 DECL_TI_ARGS (r
) = DECL_TI_ARGS (new_decl
);
11488 DECL_CONTEXT (r
) = DECL_CONTEXT (new_decl
);
11491 SET_DECL_IMPLICIT_INSTANTIATION (r
);
11492 DECL_TEMPLATE_INSTANTIATIONS (r
) = NULL_TREE
;
11493 DECL_TEMPLATE_SPECIALIZATIONS (r
) = NULL_TREE
;
11495 /* The template parameters for this new template are all the
11496 template parameters for the old template, except the
11497 outermost level of parameters. */
11498 DECL_TEMPLATE_PARMS (r
)
11499 = tsubst_template_parms (DECL_TEMPLATE_PARMS (t
), args
,
11502 if (PRIMARY_TEMPLATE_P (t
))
11503 DECL_PRIMARY_TEMPLATE (r
) = r
;
11505 if (TREE_CODE (decl
) != TYPE_DECL
&& !VAR_P (decl
))
11506 /* Record this non-type partial instantiation. */
11507 register_specialization (r
, t
,
11508 DECL_TI_ARGS (DECL_TEMPLATE_RESULT (r
)),
11513 case FUNCTION_DECL
:
11516 tree argvec
= NULL_TREE
;
11524 /* Nobody should be tsubst'ing into non-template functions. */
11525 gcc_assert (DECL_TEMPLATE_INFO (t
) != NULL_TREE
);
11527 if (TREE_CODE (DECL_TI_TEMPLATE (t
)) == TEMPLATE_DECL
)
11532 /* If T is not dependent, just return it. We have to
11533 increment PROCESSING_TEMPLATE_DECL because
11534 value_dependent_expression_p assumes that nothing is
11535 dependent when PROCESSING_TEMPLATE_DECL is zero. */
11536 ++processing_template_decl
;
11537 dependent_p
= value_dependent_expression_p (t
);
11538 --processing_template_decl
;
11542 /* Calculate the most general template of which R is a
11543 specialization, and the complete set of arguments used to
11545 gen_tmpl
= most_general_template (DECL_TI_TEMPLATE (t
));
11546 argvec
= tsubst_template_args (DECL_TI_ARGS
11547 (DECL_TEMPLATE_RESULT
11548 (DECL_TI_TEMPLATE (t
))),
11549 args
, complain
, in_decl
);
11550 if (argvec
== error_mark_node
)
11551 RETURN (error_mark_node
);
11553 /* Check to see if we already have this specialization. */
11554 hash
= hash_tmpl_and_args (gen_tmpl
, argvec
);
11555 spec
= retrieve_specialization (gen_tmpl
, argvec
, hash
);
11563 /* We can see more levels of arguments than parameters if
11564 there was a specialization of a member template, like
11567 template <class T> struct S { template <class U> void f(); }
11568 template <> template <class U> void S<int>::f(U);
11570 Here, we'll be substituting into the specialization,
11571 because that's where we can find the code we actually
11572 want to generate, but we'll have enough arguments for
11573 the most general template.
11575 We also deal with the peculiar case:
11577 template <class T> struct S {
11578 template <class U> friend void f();
11580 template <class U> void f() {}
11582 template void f<double>();
11584 Here, the ARGS for the instantiation of will be {int,
11585 double}. But, we only need as many ARGS as there are
11586 levels of template parameters in CODE_PATTERN. We are
11587 careful not to get fooled into reducing the ARGS in
11590 template <class T> struct S { template <class U> void f(U); }
11591 template <class T> template <> void S<T>::f(int) {}
11593 which we can spot because the pattern will be a
11594 specialization in this case. */
11595 args_depth
= TMPL_ARGS_DEPTH (args
);
11597 TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (DECL_TI_TEMPLATE (t
)));
11598 if (args_depth
> parms_depth
11599 && !DECL_TEMPLATE_SPECIALIZATION (t
))
11600 args
= get_innermost_template_args (args
, parms_depth
);
11604 /* This special case arises when we have something like this:
11606 template <class T> struct S {
11607 friend void f<int>(int, double);
11610 Here, the DECL_TI_TEMPLATE for the friend declaration
11611 will be an IDENTIFIER_NODE. We are being called from
11612 tsubst_friend_function, and we want only to create a
11613 new decl (R) with appropriate types so that we can call
11614 determine_specialization. */
11615 gen_tmpl
= NULL_TREE
;
11618 if (DECL_CLASS_SCOPE_P (t
))
11620 if (DECL_NAME (t
) == constructor_name (DECL_CONTEXT (t
)))
11624 ctx
= tsubst_aggr_type (DECL_CONTEXT (t
), args
,
11625 complain
, t
, /*entering_scope=*/1);
11630 ctx
= DECL_CONTEXT (t
);
11632 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
11633 if (type
== error_mark_node
)
11634 RETURN (error_mark_node
);
11636 /* If we hit excessive deduction depth, the type is bogus even if
11637 it isn't error_mark_node, so don't build a decl. */
11638 if (excessive_deduction_depth
)
11639 RETURN (error_mark_node
);
11641 /* We do NOT check for matching decls pushed separately at this
11642 point, as they may not represent instantiations of this
11643 template, and in any case are considered separate under the
11646 DECL_USE_TEMPLATE (r
) = 0;
11647 TREE_TYPE (r
) = type
;
11648 /* Clear out the mangled name and RTL for the instantiation. */
11649 SET_DECL_ASSEMBLER_NAME (r
, NULL_TREE
);
11650 SET_DECL_RTL (r
, NULL
);
11651 /* Leave DECL_INITIAL set on deleted instantiations. */
11652 if (!DECL_DELETED_FN (r
))
11653 DECL_INITIAL (r
) = NULL_TREE
;
11654 DECL_CONTEXT (r
) = ctx
;
11656 /* OpenMP UDRs have the only argument a reference to the declared
11657 type. We want to diagnose if the declared type is a reference,
11658 which is invalid, but as references to references are usually
11659 quietly merged, diagnose it here. */
11660 if (DECL_OMP_DECLARE_REDUCTION_P (t
))
11663 = TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (t
))));
11664 argtype
= tsubst (argtype
, args
, complain
, in_decl
);
11665 if (TREE_CODE (argtype
) == REFERENCE_TYPE
)
11666 error_at (DECL_SOURCE_LOCATION (t
),
11667 "reference type %qT in "
11668 "%<#pragma omp declare reduction%>", argtype
);
11669 if (strchr (IDENTIFIER_POINTER (DECL_NAME (t
)), '~') == NULL
)
11670 DECL_NAME (r
) = omp_reduction_id (ERROR_MARK
, DECL_NAME (t
),
11674 if (member
&& DECL_CONV_FN_P (r
))
11675 /* Type-conversion operator. Reconstruct the name, in
11676 case it's the name of one of the template's parameters. */
11677 DECL_NAME (r
) = mangle_conv_op_name_for_type (TREE_TYPE (type
));
11679 DECL_ARGUMENTS (r
) = tsubst (DECL_ARGUMENTS (t
), args
,
11681 DECL_RESULT (r
) = NULL_TREE
;
11683 TREE_STATIC (r
) = 0;
11684 TREE_PUBLIC (r
) = TREE_PUBLIC (t
);
11685 DECL_EXTERNAL (r
) = 1;
11686 /* If this is an instantiation of a function with internal
11687 linkage, we already know what object file linkage will be
11688 assigned to the instantiation. */
11689 DECL_INTERFACE_KNOWN (r
) = !TREE_PUBLIC (r
);
11690 DECL_DEFER_OUTPUT (r
) = 0;
11691 DECL_CHAIN (r
) = NULL_TREE
;
11692 DECL_PENDING_INLINE_INFO (r
) = 0;
11693 DECL_PENDING_INLINE_P (r
) = 0;
11694 DECL_SAVED_TREE (r
) = NULL_TREE
;
11695 DECL_STRUCT_FUNCTION (r
) = NULL
;
11697 /* We'll re-clone as appropriate in instantiate_template. */
11698 DECL_CLONED_FUNCTION (r
) = NULL_TREE
;
11700 /* If we aren't complaining now, return on error before we register
11701 the specialization so that we'll complain eventually. */
11702 if ((complain
& tf_error
) == 0
11703 && IDENTIFIER_OPNAME_P (DECL_NAME (r
))
11704 && !grok_op_properties (r
, /*complain=*/false))
11705 RETURN (error_mark_node
);
11707 /* When instantiating a constrained member, substitute
11708 into the constraints to create a new constraint. */
11709 if (tree ci
= get_constraints (t
))
11712 ci
= tsubst_constraint_info (ci
, argvec
, complain
, NULL_TREE
);
11713 set_constraints (r
, ci
);
11716 /* Set up the DECL_TEMPLATE_INFO for R. There's no need to do
11717 this in the special friend case mentioned above where
11718 GEN_TMPL is NULL. */
11721 DECL_TEMPLATE_INFO (r
)
11722 = build_template_info (gen_tmpl
, argvec
);
11723 SET_DECL_IMPLICIT_INSTANTIATION (r
);
11726 = register_specialization (r
, gen_tmpl
, argvec
, false, hash
);
11728 /* We instantiated this while substituting into
11729 the type earlier (template/friend54.C). */
11732 /* We're not supposed to instantiate default arguments
11733 until they are called, for a template. But, for a
11736 template <class T> void f ()
11737 { extern void g(int i = T()); }
11739 we should do the substitution when the template is
11740 instantiated. We handle the member function case in
11741 instantiate_class_template since the default arguments
11742 might refer to other members of the class. */
11744 && !PRIMARY_TEMPLATE_P (gen_tmpl
)
11745 && !uses_template_parms (argvec
))
11746 tsubst_default_arguments (r
, complain
);
11749 DECL_TEMPLATE_INFO (r
) = NULL_TREE
;
11751 /* Copy the list of befriending classes. */
11752 for (friends
= &DECL_BEFRIENDING_CLASSES (r
);
11754 friends
= &TREE_CHAIN (*friends
))
11756 *friends
= copy_node (*friends
);
11757 TREE_VALUE (*friends
) = tsubst (TREE_VALUE (*friends
),
11762 if (DECL_CONSTRUCTOR_P (r
) || DECL_DESTRUCTOR_P (r
))
11764 maybe_retrofit_in_chrg (r
);
11765 if (DECL_CONSTRUCTOR_P (r
))
11766 grok_ctor_properties (ctx
, r
);
11767 if (DECL_INHERITED_CTOR_BASE (r
))
11768 deduce_inheriting_ctor (r
);
11769 /* If this is an instantiation of a member template, clone it.
11770 If it isn't, that'll be handled by
11771 clone_constructors_and_destructors. */
11772 if (PRIMARY_TEMPLATE_P (gen_tmpl
))
11773 clone_function_decl (r
, /*update_method_vec_p=*/0);
11775 else if ((complain
& tf_error
) != 0
11776 && IDENTIFIER_OPNAME_P (DECL_NAME (r
))
11777 && !grok_op_properties (r
, /*complain=*/true))
11778 RETURN (error_mark_node
);
11780 if (DECL_FRIEND_P (t
) && DECL_FRIEND_CONTEXT (t
))
11781 SET_DECL_FRIEND_CONTEXT (r
,
11782 tsubst (DECL_FRIEND_CONTEXT (t
),
11783 args
, complain
, in_decl
));
11785 /* Possibly limit visibility based on template args. */
11786 DECL_VISIBILITY (r
) = VISIBILITY_DEFAULT
;
11787 if (DECL_VISIBILITY_SPECIFIED (t
))
11789 DECL_VISIBILITY_SPECIFIED (r
) = 0;
11790 DECL_ATTRIBUTES (r
)
11791 = remove_attribute ("visibility", DECL_ATTRIBUTES (r
));
11793 determine_visibility (r
);
11794 if (DECL_DEFAULTED_OUTSIDE_CLASS_P (r
)
11795 && !processing_template_decl
)
11796 defaulted_late_check (r
);
11798 apply_late_template_attributes (&r
, DECL_ATTRIBUTES (r
), 0,
11799 args
, complain
, in_decl
);
11805 tree type
= NULL_TREE
;
11807 tree expanded_types
= NULL_TREE
;
11808 tree prev_r
= NULL_TREE
;
11809 tree first_r
= NULL_TREE
;
11811 if (DECL_PACK_P (t
))
11813 /* If there is a local specialization that isn't a
11814 parameter pack, it means that we're doing a "simple"
11815 substitution from inside tsubst_pack_expansion. Just
11816 return the local specialization (which will be a single
11818 tree spec
= retrieve_local_specialization (t
);
11820 && TREE_CODE (spec
) == PARM_DECL
11821 && TREE_CODE (TREE_TYPE (spec
)) != TYPE_PACK_EXPANSION
)
11824 /* Expand the TYPE_PACK_EXPANSION that provides the types for
11825 the parameters in this function parameter pack. */
11826 expanded_types
= tsubst_pack_expansion (TREE_TYPE (t
), args
,
11827 complain
, in_decl
);
11828 if (TREE_CODE (expanded_types
) == TREE_VEC
)
11830 len
= TREE_VEC_LENGTH (expanded_types
);
11832 /* Zero-length parameter packs are boring. Just substitute
11835 RETURN (tsubst (TREE_CHAIN (t
), args
, complain
,
11840 /* All we did was update the type. Make a note of that. */
11841 type
= expanded_types
;
11842 expanded_types
= NULL_TREE
;
11846 /* Loop through all of the parameters we'll build. When T is
11847 a function parameter pack, LEN is the number of expanded
11848 types in EXPANDED_TYPES; otherwise, LEN is 1. */
11850 for (i
= 0; i
< len
; ++i
)
11854 if (DECL_TEMPLATE_PARM_P (t
))
11855 SET_DECL_TEMPLATE_PARM_P (r
);
11857 if (expanded_types
)
11858 /* We're on the Ith parameter of the function parameter
11861 /* Get the Ith type. */
11862 type
= TREE_VEC_ELT (expanded_types
, i
);
11864 /* Rename the parameter to include the index. */
11866 = make_ith_pack_parameter_name (DECL_NAME (r
), i
);
11869 /* We're dealing with a normal parameter. */
11870 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
11872 type
= type_decays_to (type
);
11873 TREE_TYPE (r
) = type
;
11874 cp_apply_type_quals_to_decl (cp_type_quals (type
), r
);
11876 if (DECL_INITIAL (r
))
11878 if (TREE_CODE (DECL_INITIAL (r
)) != TEMPLATE_PARM_INDEX
)
11879 DECL_INITIAL (r
) = TREE_TYPE (r
);
11881 DECL_INITIAL (r
) = tsubst (DECL_INITIAL (r
), args
,
11882 complain
, in_decl
);
11885 DECL_CONTEXT (r
) = NULL_TREE
;
11887 if (!DECL_TEMPLATE_PARM_P (r
))
11888 DECL_ARG_TYPE (r
) = type_passed_as (type
);
11890 apply_late_template_attributes (&r
, DECL_ATTRIBUTES (r
), 0,
11891 args
, complain
, in_decl
);
11893 /* Keep track of the first new parameter we
11894 generate. That's what will be returned to the
11899 /* Build a proper chain of parameters when substituting
11900 into a function parameter pack. */
11902 DECL_CHAIN (prev_r
) = r
;
11905 /* If cp_unevaluated_operand is set, we're just looking for a
11906 single dummy parameter, so don't keep going. */
11907 if (DECL_CHAIN (t
) && !cp_unevaluated_operand
)
11908 DECL_CHAIN (r
) = tsubst (DECL_CHAIN (t
), args
,
11909 complain
, DECL_CHAIN (t
));
11911 /* FIRST_R contains the start of the chain we've built. */
11918 tree type
= NULL_TREE
;
11919 tree vec
= NULL_TREE
;
11920 tree expanded_types
= NULL_TREE
;
11923 if (PACK_EXPANSION_P (TREE_TYPE (t
)))
11925 /* This field is a lambda capture pack. Return a TREE_VEC of
11926 the expanded fields to instantiate_class_template_1 and
11927 store them in the specializations hash table as a
11928 NONTYPE_ARGUMENT_PACK so that tsubst_copy can find them. */
11929 expanded_types
= tsubst_pack_expansion (TREE_TYPE (t
), args
,
11930 complain
, in_decl
);
11931 if (TREE_CODE (expanded_types
) == TREE_VEC
)
11933 len
= TREE_VEC_LENGTH (expanded_types
);
11934 vec
= make_tree_vec (len
);
11938 /* All we did was update the type. Make a note of that. */
11939 type
= expanded_types
;
11940 expanded_types
= NULL_TREE
;
11944 for (int i
= 0; i
< len
; ++i
)
11947 if (expanded_types
)
11949 type
= TREE_VEC_ELT (expanded_types
, i
);
11951 = make_ith_pack_parameter_name (DECL_NAME (r
), i
);
11954 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
11956 if (type
== error_mark_node
)
11957 RETURN (error_mark_node
);
11958 TREE_TYPE (r
) = type
;
11959 cp_apply_type_quals_to_decl (cp_type_quals (type
), r
);
11961 if (DECL_C_BIT_FIELD (r
))
11962 /* For bit-fields, DECL_INITIAL gives the number of bits. For
11963 non-bit-fields DECL_INITIAL is a non-static data member
11964 initializer, which gets deferred instantiation. */
11966 = tsubst_expr (DECL_INITIAL (t
), args
,
11968 /*integral_constant_expression_p=*/true);
11969 else if (DECL_INITIAL (t
))
11971 /* Set up DECL_TEMPLATE_INFO so that we can get at the
11972 NSDMI in perform_member_init. Still set DECL_INITIAL
11973 so that we know there is one. */
11974 DECL_INITIAL (r
) = void_node
;
11975 gcc_assert (DECL_LANG_SPECIFIC (r
) == NULL
);
11976 retrofit_lang_decl (r
);
11977 DECL_TEMPLATE_INFO (r
) = build_template_info (t
, args
);
11979 /* We don't have to set DECL_CONTEXT here; it is set by
11980 finish_member_declaration. */
11981 DECL_CHAIN (r
) = NULL_TREE
;
11983 apply_late_template_attributes (&r
, DECL_ATTRIBUTES (r
), 0,
11984 args
, complain
, in_decl
);
11987 TREE_VEC_ELT (vec
, i
) = r
;
11993 tree pack
= make_node (NONTYPE_ARGUMENT_PACK
);
11994 tree tpack
= cxx_make_type (TYPE_ARGUMENT_PACK
);
11995 SET_ARGUMENT_PACK_ARGS (pack
, vec
);
11996 SET_ARGUMENT_PACK_ARGS (tpack
, expanded_types
);
11997 TREE_TYPE (pack
) = tpack
;
11998 register_specialization (pack
, t
, args
, false, 0);
12004 /* We reach here only for member using decls. We also need to check
12005 uses_template_parms because DECL_DEPENDENT_P is not set for a
12006 using-declaration that designates a member of the current
12007 instantiation (c++/53549). */
12008 if (DECL_DEPENDENT_P (t
)
12009 || uses_template_parms (USING_DECL_SCOPE (t
)))
12011 tree inst_scope
= tsubst_copy (USING_DECL_SCOPE (t
), args
,
12012 complain
, in_decl
);
12013 tree name
= tsubst_copy (DECL_NAME (t
), args
, complain
, in_decl
);
12014 r
= do_class_using_decl (inst_scope
, name
);
12016 r
= error_mark_node
;
12019 TREE_PROTECTED (r
) = TREE_PROTECTED (t
);
12020 TREE_PRIVATE (r
) = TREE_PRIVATE (t
);
12026 DECL_CHAIN (r
) = NULL_TREE
;
12033 tree argvec
= NULL_TREE
;
12034 tree gen_tmpl
= NULL_TREE
;
12036 tree tmpl
= NULL_TREE
;
12038 tree type
= NULL_TREE
;
12041 if (TREE_TYPE (t
) == error_mark_node
)
12042 RETURN (error_mark_node
);
12044 if (TREE_CODE (t
) == TYPE_DECL
12045 && t
== TYPE_MAIN_DECL (TREE_TYPE (t
)))
12047 /* If this is the canonical decl, we don't have to
12048 mess with instantiations, and often we can't (for
12049 typename, template type parms and such). Note that
12050 TYPE_NAME is not correct for the above test if
12051 we've copied the type for a typedef. */
12052 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
12053 if (type
== error_mark_node
)
12054 RETURN (error_mark_node
);
12055 r
= TYPE_NAME (type
);
12059 /* Check to see if we already have the specialization we
12062 if (DECL_CLASS_SCOPE_P (t
) || DECL_NAMESPACE_SCOPE_P (t
))
12064 /* T is a static data member or namespace-scope entity.
12065 We have to substitute into namespace-scope variables
12066 (not just variable templates) because of cases like:
12068 template <class T> void f() { extern T t; }
12070 where the entity referenced is not known until
12071 instantiation time. */
12073 ctx
= DECL_CONTEXT (t
);
12074 if (DECL_CLASS_SCOPE_P (t
))
12076 ctx
= tsubst_aggr_type (ctx
, args
,
12078 in_decl
, /*entering_scope=*/1);
12079 /* If CTX is unchanged, then T is in fact the
12080 specialization we want. That situation occurs when
12081 referencing a static data member within in its own
12082 class. We can use pointer equality, rather than
12083 same_type_p, because DECL_CONTEXT is always
12085 if (ctx
== DECL_CONTEXT (t
)
12086 /* ... unless T is a member template; in which
12087 case our caller can be willing to create a
12088 specialization of that template represented
12090 && !(DECL_TI_TEMPLATE (t
)
12091 && DECL_MEMBER_TEMPLATE_P (DECL_TI_TEMPLATE (t
))))
12097 tmpl
= DECL_TI_TEMPLATE (t
);
12098 gen_tmpl
= most_general_template (tmpl
);
12099 argvec
= tsubst (DECL_TI_ARGS (t
), args
, complain
, in_decl
);
12100 if (argvec
!= error_mark_node
)
12101 argvec
= (coerce_innermost_template_parms
12102 (DECL_TEMPLATE_PARMS (gen_tmpl
),
12103 argvec
, t
, complain
,
12104 /*all*/true, /*defarg*/true));
12105 if (argvec
== error_mark_node
)
12106 RETURN (error_mark_node
);
12107 hash
= hash_tmpl_and_args (gen_tmpl
, argvec
);
12108 spec
= retrieve_specialization (gen_tmpl
, argvec
, hash
);
12113 /* A local variable. */
12115 /* Subsequent calls to pushdecl will fill this in. */
12117 spec
= retrieve_local_specialization (t
);
12119 /* If we already have the specialization we need, there is
12120 nothing more to do. */
12127 /* Create a new node for the specialization we need. */
12129 if (type
== NULL_TREE
)
12131 if (is_typedef_decl (t
))
12132 type
= DECL_ORIGINAL_TYPE (t
);
12134 type
= TREE_TYPE (t
);
12136 && VAR_HAD_UNKNOWN_BOUND (t
)
12137 && type
!= error_mark_node
)
12138 type
= strip_array_domain (type
);
12139 type
= tsubst (type
, args
, complain
, in_decl
);
12143 /* Even if the original location is out of scope, the
12144 newly substituted one is not. */
12145 DECL_DEAD_FOR_LOCAL (r
) = 0;
12146 DECL_INITIALIZED_P (r
) = 0;
12147 DECL_TEMPLATE_INSTANTIATED (r
) = 0;
12148 if (type
== error_mark_node
)
12149 RETURN (error_mark_node
);
12150 if (TREE_CODE (type
) == FUNCTION_TYPE
)
12152 /* It may seem that this case cannot occur, since:
12157 declares a function, not a variable. However:
12160 template <typename T> void g() { T t; }
12161 template void g<f>();
12163 is an attempt to declare a variable with function
12165 error ("variable %qD has function type",
12166 /* R is not yet sufficiently initialized, so we
12167 just use its name. */
12169 RETURN (error_mark_node
);
12171 type
= complete_type (type
);
12172 /* Wait until cp_finish_decl to set this again, to handle
12173 circular dependency (template/instantiate6.C). */
12174 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (r
) = 0;
12175 type
= check_var_type (DECL_NAME (r
), type
);
12177 if (DECL_HAS_VALUE_EXPR_P (t
))
12179 tree ve
= DECL_VALUE_EXPR (t
);
12180 ve
= tsubst_expr (ve
, args
, complain
, in_decl
,
12181 /*constant_expression_p=*/false);
12182 if (REFERENCE_REF_P (ve
))
12184 gcc_assert (TREE_CODE (type
) == REFERENCE_TYPE
);
12185 ve
= TREE_OPERAND (ve
, 0);
12187 SET_DECL_VALUE_EXPR (r
, ve
);
12189 if (CP_DECL_THREAD_LOCAL_P (r
)
12190 && !processing_template_decl
)
12191 set_decl_tls_model (r
, decl_default_tls_model (r
));
12193 else if (DECL_SELF_REFERENCE_P (t
))
12194 SET_DECL_SELF_REFERENCE_P (r
);
12195 TREE_TYPE (r
) = type
;
12196 cp_apply_type_quals_to_decl (cp_type_quals (type
), r
);
12197 DECL_CONTEXT (r
) = ctx
;
12198 /* Clear out the mangled name and RTL for the instantiation. */
12199 SET_DECL_ASSEMBLER_NAME (r
, NULL_TREE
);
12200 if (CODE_CONTAINS_STRUCT (TREE_CODE (t
), TS_DECL_WRTL
))
12201 SET_DECL_RTL (r
, NULL
);
12202 /* The initializer must not be expanded until it is required;
12203 see [temp.inst]. */
12204 DECL_INITIAL (r
) = NULL_TREE
;
12205 if (CODE_CONTAINS_STRUCT (TREE_CODE (t
), TS_DECL_WRTL
))
12206 SET_DECL_RTL (r
, NULL
);
12207 DECL_SIZE (r
) = DECL_SIZE_UNIT (r
) = 0;
12210 /* Possibly limit visibility based on template args. */
12211 DECL_VISIBILITY (r
) = VISIBILITY_DEFAULT
;
12212 if (DECL_VISIBILITY_SPECIFIED (t
))
12214 DECL_VISIBILITY_SPECIFIED (r
) = 0;
12215 DECL_ATTRIBUTES (r
)
12216 = remove_attribute ("visibility", DECL_ATTRIBUTES (r
));
12218 determine_visibility (r
);
12223 /* A static data member declaration is always marked
12224 external when it is declared in-class, even if an
12225 initializer is present. We mimic the non-template
12226 processing here. */
12227 DECL_EXTERNAL (r
) = 1;
12228 if (DECL_NAMESPACE_SCOPE_P (t
))
12229 DECL_NOT_REALLY_EXTERN (r
) = 1;
12231 DECL_TEMPLATE_INFO (r
) = build_template_info (tmpl
, argvec
);
12232 SET_DECL_IMPLICIT_INSTANTIATION (r
);
12233 register_specialization (r
, gen_tmpl
, argvec
, false, hash
);
12235 else if (!cp_unevaluated_operand
)
12236 register_local_specialization (r
, t
);
12238 DECL_CHAIN (r
) = NULL_TREE
;
12240 apply_late_template_attributes (&r
, DECL_ATTRIBUTES (r
),
12242 args
, complain
, in_decl
);
12244 /* Preserve a typedef that names a type. */
12245 if (is_typedef_decl (r
))
12247 DECL_ORIGINAL_TYPE (r
) = NULL_TREE
;
12248 set_underlying_type (r
);
12249 if (TYPE_DECL_ALIAS_P (r
) && type
!= error_mark_node
)
12250 /* An alias template specialization can be dependent
12251 even if its underlying type is not. */
12252 TYPE_DEPENDENT_P_VALID (TREE_TYPE (r
)) = false;
12255 layout_decl (r
, 0);
12260 gcc_unreachable ();
12265 /* Restore the file and line information. */
12266 input_location
= saved_loc
;
12271 /* Substitute into the ARG_TYPES of a function type.
12272 If END is a TREE_CHAIN, leave it and any following types
12276 tsubst_arg_types (tree arg_types
,
12279 tsubst_flags_t complain
,
12282 tree remaining_arg_types
;
12283 tree type
= NULL_TREE
;
12285 tree expanded_args
= NULL_TREE
;
12288 if (!arg_types
|| arg_types
== void_list_node
|| arg_types
== end
)
12291 remaining_arg_types
= tsubst_arg_types (TREE_CHAIN (arg_types
),
12292 args
, end
, complain
, in_decl
);
12293 if (remaining_arg_types
== error_mark_node
)
12294 return error_mark_node
;
12296 if (PACK_EXPANSION_P (TREE_VALUE (arg_types
)))
12298 /* For a pack expansion, perform substitution on the
12299 entire expression. Later on, we'll handle the arguments
12301 expanded_args
= tsubst_pack_expansion (TREE_VALUE (arg_types
),
12302 args
, complain
, in_decl
);
12304 if (TREE_CODE (expanded_args
) == TREE_VEC
)
12305 /* So that we'll spin through the parameters, one by one. */
12306 i
= TREE_VEC_LENGTH (expanded_args
);
12309 /* We only partially substituted into the parameter
12310 pack. Our type is TYPE_PACK_EXPANSION. */
12311 type
= expanded_args
;
12312 expanded_args
= NULL_TREE
;
12320 type
= TREE_VEC_ELT (expanded_args
, i
);
12322 type
= tsubst (TREE_VALUE (arg_types
), args
, complain
, in_decl
);
12324 if (type
== error_mark_node
)
12325 return error_mark_node
;
12326 if (VOID_TYPE_P (type
))
12328 if (complain
& tf_error
)
12330 error ("invalid parameter type %qT", type
);
12332 error ("in declaration %q+D", in_decl
);
12334 return error_mark_node
;
12337 if (abstract_virtuals_error_sfinae (ACU_PARM
, type
, complain
))
12338 return error_mark_node
;
12340 /* Do array-to-pointer, function-to-pointer conversion, and ignore
12341 top-level qualifiers as required. */
12342 type
= cv_unqualified (type_decays_to (type
));
12344 /* We do not substitute into default arguments here. The standard
12345 mandates that they be instantiated only when needed, which is
12346 done in build_over_call. */
12347 default_arg
= TREE_PURPOSE (arg_types
);
12349 if (default_arg
&& TREE_CODE (default_arg
) == DEFAULT_ARG
)
12351 /* We've instantiated a template before its default arguments
12352 have been parsed. This can happen for a nested template
12353 class, and is not an error unless we require the default
12354 argument in a call of this function. */
12355 remaining_arg_types
=
12356 tree_cons (default_arg
, type
, remaining_arg_types
);
12357 vec_safe_push (DEFARG_INSTANTIATIONS(default_arg
), remaining_arg_types
);
12360 remaining_arg_types
=
12361 hash_tree_cons (default_arg
, type
, remaining_arg_types
);
12364 return remaining_arg_types
;
12367 /* Substitute into a FUNCTION_TYPE or METHOD_TYPE. This routine does
12368 *not* handle the exception-specification for FNTYPE, because the
12369 initial substitution of explicitly provided template parameters
12370 during argument deduction forbids substitution into the
12371 exception-specification:
12375 All references in the function type of the function template to the
12376 corresponding template parameters are replaced by the specified tem-
12377 plate argument values. If a substitution in a template parameter or
12378 in the function type of the function template results in an invalid
12379 type, type deduction fails. [Note: The equivalent substitution in
12380 exception specifications is done only when the function is instanti-
12381 ated, at which point a program is ill-formed if the substitution
12382 results in an invalid type.] */
12385 tsubst_function_type (tree t
,
12387 tsubst_flags_t complain
,
12391 tree arg_types
= NULL_TREE
;
12394 /* The TYPE_CONTEXT is not used for function/method types. */
12395 gcc_assert (TYPE_CONTEXT (t
) == NULL_TREE
);
12397 /* DR 1227: Mixing immediate and non-immediate contexts in deduction
12399 bool late_return_type_p
= TYPE_HAS_LATE_RETURN_TYPE (t
);
12401 if (late_return_type_p
)
12403 /* Substitute the argument types. */
12404 arg_types
= tsubst_arg_types (TYPE_ARG_TYPES (t
), args
, NULL_TREE
,
12405 complain
, in_decl
);
12406 if (arg_types
== error_mark_node
)
12407 return error_mark_node
;
12409 tree save_ccp
= current_class_ptr
;
12410 tree save_ccr
= current_class_ref
;
12411 tree this_type
= (TREE_CODE (t
) == METHOD_TYPE
12412 ? TREE_TYPE (TREE_VALUE (arg_types
)) : NULL_TREE
);
12413 bool do_inject
= this_type
&& CLASS_TYPE_P (this_type
);
12416 /* DR 1207: 'this' is in scope in the trailing return type. */
12417 inject_this_parameter (this_type
, cp_type_quals (this_type
));
12420 /* Substitute the return type. */
12421 return_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
12425 current_class_ptr
= save_ccp
;
12426 current_class_ref
= save_ccr
;
12430 /* Substitute the return type. */
12431 return_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
12433 if (return_type
== error_mark_node
)
12434 return error_mark_node
;
12435 /* DR 486 clarifies that creation of a function type with an
12436 invalid return type is a deduction failure. */
12437 if (TREE_CODE (return_type
) == ARRAY_TYPE
12438 || TREE_CODE (return_type
) == FUNCTION_TYPE
)
12440 if (complain
& tf_error
)
12442 if (TREE_CODE (return_type
) == ARRAY_TYPE
)
12443 error ("function returning an array");
12445 error ("function returning a function");
12447 return error_mark_node
;
12450 if (abstract_virtuals_error_sfinae (ACU_RETURN
, return_type
, complain
))
12451 return error_mark_node
;
12453 if (!late_return_type_p
)
12455 /* Substitute the argument types. */
12456 arg_types
= tsubst_arg_types (TYPE_ARG_TYPES (t
), args
, NULL_TREE
,
12457 complain
, in_decl
);
12458 if (arg_types
== error_mark_node
)
12459 return error_mark_node
;
12462 /* Construct a new type node and return it. */
12463 if (TREE_CODE (t
) == FUNCTION_TYPE
)
12465 fntype
= build_function_type (return_type
, arg_types
);
12466 fntype
= apply_memfn_quals (fntype
,
12467 type_memfn_quals (t
),
12468 type_memfn_rqual (t
));
12472 tree r
= TREE_TYPE (TREE_VALUE (arg_types
));
12473 /* Don't pick up extra function qualifiers from the basetype. */
12474 r
= cp_build_qualified_type_real (r
, type_memfn_quals (t
), complain
);
12475 if (! MAYBE_CLASS_TYPE_P (r
))
12479 Type deduction may fail for any of the following
12482 -- Attempting to create "pointer to member of T" when T
12483 is not a class type. */
12484 if (complain
& tf_error
)
12485 error ("creating pointer to member function of non-class type %qT",
12487 return error_mark_node
;
12490 fntype
= build_method_type_directly (r
, return_type
,
12491 TREE_CHAIN (arg_types
));
12492 fntype
= build_ref_qualified_type (fntype
, type_memfn_rqual (t
));
12494 fntype
= cp_build_type_attribute_variant (fntype
, TYPE_ATTRIBUTES (t
));
12496 if (late_return_type_p
)
12497 TYPE_HAS_LATE_RETURN_TYPE (fntype
) = 1;
12502 /* FNTYPE is a FUNCTION_TYPE or METHOD_TYPE. Substitute the template
12503 ARGS into that specification, and return the substituted
12504 specification. If there is no specification, return NULL_TREE. */
12507 tsubst_exception_specification (tree fntype
,
12509 tsubst_flags_t complain
,
12516 specs
= TYPE_RAISES_EXCEPTIONS (fntype
);
12517 new_specs
= NULL_TREE
;
12518 if (specs
&& TREE_PURPOSE (specs
))
12520 /* A noexcept-specifier. */
12521 tree expr
= TREE_PURPOSE (specs
);
12522 if (TREE_CODE (expr
) == INTEGER_CST
)
12526 /* Defer instantiation of noexcept-specifiers to avoid
12527 excessive instantiations (c++/49107). */
12528 new_specs
= make_node (DEFERRED_NOEXCEPT
);
12529 if (DEFERRED_NOEXCEPT_SPEC_P (specs
))
12531 /* We already partially instantiated this member template,
12532 so combine the new args with the old. */
12533 DEFERRED_NOEXCEPT_PATTERN (new_specs
)
12534 = DEFERRED_NOEXCEPT_PATTERN (expr
);
12535 DEFERRED_NOEXCEPT_ARGS (new_specs
)
12536 = add_to_template_args (DEFERRED_NOEXCEPT_ARGS (expr
), args
);
12540 DEFERRED_NOEXCEPT_PATTERN (new_specs
) = expr
;
12541 DEFERRED_NOEXCEPT_ARGS (new_specs
) = args
;
12545 new_specs
= tsubst_copy_and_build
12546 (expr
, args
, complain
, in_decl
, /*function_p=*/false,
12547 /*integral_constant_expression_p=*/true);
12548 new_specs
= build_noexcept_spec (new_specs
, complain
);
12552 if (! TREE_VALUE (specs
))
12559 tree expanded_specs
= NULL_TREE
;
12561 if (PACK_EXPANSION_P (TREE_VALUE (specs
)))
12563 /* Expand the pack expansion type. */
12564 expanded_specs
= tsubst_pack_expansion (TREE_VALUE (specs
),
12568 if (expanded_specs
== error_mark_node
)
12569 return error_mark_node
;
12570 else if (TREE_CODE (expanded_specs
) == TREE_VEC
)
12571 len
= TREE_VEC_LENGTH (expanded_specs
);
12574 /* We're substituting into a member template, so
12575 we got a TYPE_PACK_EXPANSION back. Add that
12576 expansion and move on. */
12577 gcc_assert (TREE_CODE (expanded_specs
)
12578 == TYPE_PACK_EXPANSION
);
12579 new_specs
= add_exception_specifier (new_specs
,
12582 specs
= TREE_CHAIN (specs
);
12587 for (i
= 0; i
< len
; ++i
)
12589 if (expanded_specs
)
12590 spec
= TREE_VEC_ELT (expanded_specs
, i
);
12592 spec
= tsubst (TREE_VALUE (specs
), args
, complain
, in_decl
);
12593 if (spec
== error_mark_node
)
12595 new_specs
= add_exception_specifier (new_specs
, spec
,
12599 specs
= TREE_CHAIN (specs
);
12605 /* Take the tree structure T and replace template parameters used
12606 therein with the argument vector ARGS. IN_DECL is an associated
12607 decl for diagnostics. If an error occurs, returns ERROR_MARK_NODE.
12608 Issue error and warning messages under control of COMPLAIN. Note
12609 that we must be relatively non-tolerant of extensions here, in
12610 order to preserve conformance; if we allow substitutions that
12611 should not be allowed, we may allow argument deductions that should
12612 not succeed, and therefore report ambiguous overload situations
12613 where there are none. In theory, we could allow the substitution,
12614 but indicate that it should have failed, and allow our caller to
12615 make sure that the right thing happens, but we don't try to do this
12618 This function is used for dealing with types, decls and the like;
12619 for expressions, use tsubst_expr or tsubst_copy. */
12622 tsubst (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
12624 enum tree_code code
;
12625 tree type
, r
= NULL_TREE
;
12627 if (t
== NULL_TREE
|| t
== error_mark_node
12628 || t
== integer_type_node
12629 || t
== void_type_node
12630 || t
== char_type_node
12631 || t
== unknown_type_node
12632 || TREE_CODE (t
) == NAMESPACE_DECL
12633 || TREE_CODE (t
) == TRANSLATION_UNIT_DECL
)
12637 return tsubst_decl (t
, args
, complain
);
12639 if (args
== NULL_TREE
)
12642 code
= TREE_CODE (t
);
12644 if (code
== IDENTIFIER_NODE
)
12645 type
= IDENTIFIER_TYPE_VALUE (t
);
12647 type
= TREE_TYPE (t
);
12649 gcc_assert (type
!= unknown_type_node
);
12651 /* Reuse typedefs. We need to do this to handle dependent attributes,
12652 such as attribute aligned. */
12654 && typedef_variant_p (t
))
12656 tree decl
= TYPE_NAME (t
);
12658 if (alias_template_specialization_p (t
))
12660 /* DECL represents an alias template and we want to
12662 tree tmpl
= most_general_template (DECL_TI_TEMPLATE (decl
));
12663 tree gen_args
= tsubst (DECL_TI_ARGS (decl
), args
, complain
, in_decl
);
12664 r
= instantiate_alias_template (tmpl
, gen_args
, complain
);
12666 else if (DECL_CLASS_SCOPE_P (decl
)
12667 && CLASSTYPE_TEMPLATE_INFO (DECL_CONTEXT (decl
))
12668 && uses_template_parms (DECL_CONTEXT (decl
)))
12670 tree tmpl
= most_general_template (DECL_TI_TEMPLATE (decl
));
12671 tree gen_args
= tsubst (DECL_TI_ARGS (decl
), args
, complain
, in_decl
);
12672 r
= retrieve_specialization (tmpl
, gen_args
, 0);
12674 else if (DECL_FUNCTION_SCOPE_P (decl
)
12675 && DECL_TEMPLATE_INFO (DECL_CONTEXT (decl
))
12676 && uses_template_parms (DECL_TI_ARGS (DECL_CONTEXT (decl
))))
12677 r
= retrieve_local_specialization (decl
);
12679 /* The typedef is from a non-template context. */
12685 r
= cp_build_qualified_type_real
12686 (r
, cp_type_quals (t
) | cp_type_quals (r
),
12687 complain
| tf_ignore_bad_quals
);
12692 /* We don't have an instantiation yet, so drop the typedef. */
12693 int quals
= cp_type_quals (t
);
12694 t
= DECL_ORIGINAL_TYPE (decl
);
12695 t
= cp_build_qualified_type_real (t
, quals
,
12696 complain
| tf_ignore_bad_quals
);
12701 && code
!= TYPENAME_TYPE
12702 && code
!= TEMPLATE_TYPE_PARM
12703 && code
!= IDENTIFIER_NODE
12704 && code
!= FUNCTION_TYPE
12705 && code
!= METHOD_TYPE
)
12706 type
= tsubst (type
, args
, complain
, in_decl
);
12707 if (type
== error_mark_node
)
12708 return error_mark_node
;
12714 case ENUMERAL_TYPE
:
12715 return tsubst_aggr_type (t
, args
, complain
, in_decl
,
12716 /*entering_scope=*/0);
12719 case IDENTIFIER_NODE
:
12730 if (t
== integer_type_node
)
12733 if (TREE_CODE (TYPE_MIN_VALUE (t
)) == INTEGER_CST
12734 && TREE_CODE (TYPE_MAX_VALUE (t
)) == INTEGER_CST
)
12738 tree max
, omax
= TREE_OPERAND (TYPE_MAX_VALUE (t
), 0);
12740 max
= tsubst_expr (omax
, args
, complain
, in_decl
,
12741 /*integral_constant_expression_p=*/false);
12743 /* Fix up type of the magic NOP_EXPR with TREE_SIDE_EFFECTS if
12745 if (TREE_CODE (max
) == NOP_EXPR
12746 && TREE_SIDE_EFFECTS (omax
)
12747 && !TREE_TYPE (max
))
12748 TREE_TYPE (max
) = TREE_TYPE (TREE_OPERAND (max
, 0));
12750 /* If we're in a partial instantiation, preserve the magic NOP_EXPR
12751 with TREE_SIDE_EFFECTS that indicates this is not an integral
12752 constant expression. */
12753 if (processing_template_decl
12754 && TREE_SIDE_EFFECTS (omax
) && TREE_CODE (omax
) == NOP_EXPR
)
12756 gcc_assert (TREE_CODE (max
) == NOP_EXPR
);
12757 TREE_SIDE_EFFECTS (max
) = 1;
12760 return compute_array_index_type (NULL_TREE
, max
, complain
);
12763 case TEMPLATE_TYPE_PARM
:
12764 case TEMPLATE_TEMPLATE_PARM
:
12765 case BOUND_TEMPLATE_TEMPLATE_PARM
:
12766 case TEMPLATE_PARM_INDEX
:
12771 tree arg
= NULL_TREE
;
12773 /* Early in template argument deduction substitution, we don't
12774 want to reduce the level of 'auto', or it will be confused
12775 with a normal template parm in subsequent deduction. */
12776 if (is_auto (t
) && (complain
& tf_partial
))
12781 gcc_assert (TREE_VEC_LENGTH (args
) > 0);
12782 template_parm_level_and_index (t
, &level
, &idx
);
12784 levels
= TMPL_ARGS_DEPTH (args
);
12785 if (level
<= levels
12786 && TREE_VEC_LENGTH (TMPL_ARGS_LEVEL (args
, level
)) > 0)
12788 arg
= TMPL_ARG (args
, level
, idx
);
12790 if (arg
&& TREE_CODE (arg
) == ARGUMENT_PACK_SELECT
)
12792 /* See through ARGUMENT_PACK_SELECT arguments. */
12793 arg
= ARGUMENT_PACK_SELECT_ARG (arg
);
12794 /* If the selected argument is an expansion E, that most
12795 likely means we were called from
12796 gen_elem_of_pack_expansion_instantiation during the
12797 substituting of pack an argument pack (which Ith
12798 element is a pack expansion, where I is
12799 ARGUMENT_PACK_SELECT_INDEX) into a pack expansion.
12800 In this case, the Ith element resulting from this
12801 substituting is going to be a pack expansion, which
12802 pattern is the pattern of E. Let's return the
12804 gen_elem_of_pack_expansion_instantiation will
12805 build the resulting pack expansion from it. */
12806 if (PACK_EXPANSION_P (arg
))
12808 /* Make sure we aren't throwing away arg info. */
12809 gcc_assert (!PACK_EXPANSION_EXTRA_ARGS (arg
));
12810 arg
= PACK_EXPANSION_PATTERN (arg
);
12815 if (arg
== error_mark_node
)
12816 return error_mark_node
;
12817 else if (arg
!= NULL_TREE
)
12819 if (ARGUMENT_PACK_P (arg
))
12820 /* If ARG is an argument pack, we don't actually want to
12821 perform a substitution here, because substitutions
12822 for argument packs are only done
12823 element-by-element. We can get to this point when
12824 substituting the type of a non-type template
12825 parameter pack, when that type actually contains
12826 template parameter packs from an outer template, e.g.,
12828 template<typename... Types> struct A {
12829 template<Types... Values> struct B { };
12833 if (code
== TEMPLATE_TYPE_PARM
)
12836 gcc_assert (TYPE_P (arg
));
12838 quals
= cp_type_quals (arg
) | cp_type_quals (t
);
12840 return cp_build_qualified_type_real
12841 (arg
, quals
, complain
| tf_ignore_bad_quals
);
12843 else if (code
== BOUND_TEMPLATE_TEMPLATE_PARM
)
12845 /* We are processing a type constructed from a
12846 template template parameter. */
12847 tree argvec
= tsubst (TYPE_TI_ARGS (t
),
12848 args
, complain
, in_decl
);
12849 if (argvec
== error_mark_node
)
12850 return error_mark_node
;
12852 gcc_assert (TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
12853 || TREE_CODE (arg
) == TEMPLATE_DECL
12854 || TREE_CODE (arg
) == UNBOUND_CLASS_TEMPLATE
);
12856 if (TREE_CODE (arg
) == UNBOUND_CLASS_TEMPLATE
)
12857 /* Consider this code:
12859 template <template <class> class Template>
12861 template <class Arg> using Bind = Template<Arg>;
12864 template <template <class> class Template, class Arg>
12865 using Instantiate = Template<Arg>; //#0
12867 template <template <class> class Template,
12870 Instantiate<Internal<Template>::template Bind,
12873 When #1 is parsed, the
12874 BOUND_TEMPLATE_TEMPLATE_PARM representing the
12875 parameter `Template' in #0 matches the
12876 UNBOUND_CLASS_TEMPLATE representing the argument
12877 `Internal<Template>::template Bind'; We then want
12878 to assemble the type `Bind<Argument>' that can't
12879 be fully created right now, because
12880 `Internal<Template>' not being complete, the Bind
12881 template cannot be looked up in that context. So
12882 we need to "store" `Bind<Argument>' for later
12883 when the context of Bind becomes complete. Let's
12884 store that in a TYPENAME_TYPE. */
12885 return make_typename_type (TYPE_CONTEXT (arg
),
12886 build_nt (TEMPLATE_ID_EXPR
,
12887 TYPE_IDENTIFIER (arg
),
12892 /* We can get a TEMPLATE_TEMPLATE_PARM here when we
12893 are resolving nested-types in the signature of a
12894 member function templates. Otherwise ARG is a
12895 TEMPLATE_DECL and is the real template to be
12897 if (TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
)
12898 arg
= TYPE_NAME (arg
);
12900 r
= lookup_template_class (arg
,
12902 DECL_CONTEXT (arg
),
12903 /*entering_scope=*/0,
12905 return cp_build_qualified_type_real
12906 (r
, cp_type_quals (t
) | cp_type_quals (r
), complain
);
12909 /* TEMPLATE_TEMPLATE_PARM or TEMPLATE_PARM_INDEX. */
12910 return convert_from_reference (unshare_expr (arg
));
12914 /* This can happen during the attempted tsubst'ing in
12915 unify. This means that we don't yet have any information
12916 about the template parameter in question. */
12919 /* If we get here, we must have been looking at a parm for a
12920 more deeply nested template. Make a new version of this
12921 template parameter, but with a lower level. */
12924 case TEMPLATE_TYPE_PARM
:
12925 case TEMPLATE_TEMPLATE_PARM
:
12926 case BOUND_TEMPLATE_TEMPLATE_PARM
:
12927 if (cp_type_quals (t
))
12929 r
= tsubst (TYPE_MAIN_VARIANT (t
), args
, complain
, in_decl
);
12930 r
= cp_build_qualified_type_real
12931 (r
, cp_type_quals (t
),
12932 complain
| (code
== TEMPLATE_TYPE_PARM
12933 ? tf_ignore_bad_quals
: 0));
12935 else if (TREE_CODE (t
) == TEMPLATE_TYPE_PARM
12936 && PLACEHOLDER_TYPE_CONSTRAINTS (t
)
12937 && (r
= (TEMPLATE_PARM_DESCENDANTS
12938 (TEMPLATE_TYPE_PARM_INDEX (t
))))
12939 && (r
= TREE_TYPE (r
))
12940 && !PLACEHOLDER_TYPE_CONSTRAINTS (r
))
12941 /* Break infinite recursion when substituting the constraints
12942 of a constrained placeholder. */;
12946 TEMPLATE_TYPE_PARM_INDEX (r
)
12947 = reduce_template_parm_level (TEMPLATE_TYPE_PARM_INDEX (t
),
12948 r
, levels
, args
, complain
);
12949 TYPE_STUB_DECL (r
) = TYPE_NAME (r
) = TEMPLATE_TYPE_DECL (r
);
12950 TYPE_MAIN_VARIANT (r
) = r
;
12951 TYPE_POINTER_TO (r
) = NULL_TREE
;
12952 TYPE_REFERENCE_TO (r
) = NULL_TREE
;
12954 if (TREE_CODE (r
) == TEMPLATE_TEMPLATE_PARM
)
12955 /* We have reduced the level of the template
12956 template parameter, but not the levels of its
12957 template parameters, so canonical_type_parameter
12958 will not be able to find the canonical template
12959 template parameter for this level. Thus, we
12960 require structural equality checking to compare
12961 TEMPLATE_TEMPLATE_PARMs. */
12962 SET_TYPE_STRUCTURAL_EQUALITY (r
);
12963 else if (TYPE_STRUCTURAL_EQUALITY_P (t
))
12964 SET_TYPE_STRUCTURAL_EQUALITY (r
);
12966 TYPE_CANONICAL (r
) = canonical_type_parameter (r
);
12968 /* Propagate constraints on placeholders. */
12969 if (TREE_CODE (t
) == TEMPLATE_TYPE_PARM
)
12970 if (tree constr
= PLACEHOLDER_TYPE_CONSTRAINTS (t
))
12971 PLACEHOLDER_TYPE_CONSTRAINTS (r
)
12972 = tsubst_constraint (constr
, args
, complain
, in_decl
);
12974 if (code
== BOUND_TEMPLATE_TEMPLATE_PARM
)
12976 tree argvec
= tsubst (TYPE_TI_ARGS (t
), args
,
12977 complain
, in_decl
);
12978 if (argvec
== error_mark_node
)
12979 return error_mark_node
;
12981 TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (r
)
12982 = build_template_info (TYPE_TI_TEMPLATE (t
), argvec
);
12987 case TEMPLATE_PARM_INDEX
:
12988 r
= reduce_template_parm_level (t
, type
, levels
, args
, complain
);
12992 gcc_unreachable ();
13000 tree purpose
, value
, chain
;
13002 if (t
== void_list_node
)
13005 purpose
= TREE_PURPOSE (t
);
13008 purpose
= tsubst (purpose
, args
, complain
, in_decl
);
13009 if (purpose
== error_mark_node
)
13010 return error_mark_node
;
13012 value
= TREE_VALUE (t
);
13015 value
= tsubst (value
, args
, complain
, in_decl
);
13016 if (value
== error_mark_node
)
13017 return error_mark_node
;
13019 chain
= TREE_CHAIN (t
);
13020 if (chain
&& chain
!= void_type_node
)
13022 chain
= tsubst (chain
, args
, complain
, in_decl
);
13023 if (chain
== error_mark_node
)
13024 return error_mark_node
;
13026 if (purpose
== TREE_PURPOSE (t
)
13027 && value
== TREE_VALUE (t
)
13028 && chain
== TREE_CHAIN (t
))
13030 return hash_tree_cons (purpose
, value
, chain
);
13034 /* We should never be tsubsting a binfo. */
13035 gcc_unreachable ();
13038 /* A vector of template arguments. */
13039 gcc_assert (!type
);
13040 return tsubst_template_args (t
, args
, complain
, in_decl
);
13043 case REFERENCE_TYPE
:
13045 if (type
== TREE_TYPE (t
) && TREE_CODE (type
) != METHOD_TYPE
)
13050 Type deduction may fail for any of the following
13053 -- Attempting to create a pointer to reference type.
13054 -- Attempting to create a reference to a reference type or
13055 a reference to void.
13057 Core issue 106 says that creating a reference to a reference
13058 during instantiation is no longer a cause for failure. We
13059 only enforce this check in strict C++98 mode. */
13060 if ((TREE_CODE (type
) == REFERENCE_TYPE
13061 && (((cxx_dialect
== cxx98
) && flag_iso
) || code
!= REFERENCE_TYPE
))
13062 || (code
== REFERENCE_TYPE
&& VOID_TYPE_P (type
)))
13064 static location_t last_loc
;
13066 /* We keep track of the last time we issued this error
13067 message to avoid spewing a ton of messages during a
13068 single bad template instantiation. */
13069 if (complain
& tf_error
13070 && last_loc
!= input_location
)
13072 if (VOID_TYPE_P (type
))
13073 error ("forming reference to void");
13074 else if (code
== POINTER_TYPE
)
13075 error ("forming pointer to reference type %qT", type
);
13077 error ("forming reference to reference type %qT", type
);
13078 last_loc
= input_location
;
13081 return error_mark_node
;
13083 else if (TREE_CODE (type
) == FUNCTION_TYPE
13084 && (type_memfn_quals (type
) != TYPE_UNQUALIFIED
13085 || type_memfn_rqual (type
) != REF_QUAL_NONE
))
13087 if (complain
& tf_error
)
13089 if (code
== POINTER_TYPE
)
13090 error ("forming pointer to qualified function type %qT",
13093 error ("forming reference to qualified function type %qT",
13096 return error_mark_node
;
13098 else if (code
== POINTER_TYPE
)
13100 r
= build_pointer_type (type
);
13101 if (TREE_CODE (type
) == METHOD_TYPE
)
13102 r
= build_ptrmemfunc_type (r
);
13104 else if (TREE_CODE (type
) == REFERENCE_TYPE
)
13105 /* In C++0x, during template argument substitution, when there is an
13106 attempt to create a reference to a reference type, reference
13107 collapsing is applied as described in [14.3.1/4 temp.arg.type]:
13109 "If a template-argument for a template-parameter T names a type
13110 that is a reference to a type A, an attempt to create the type
13111 'lvalue reference to cv T' creates the type 'lvalue reference to
13112 A,' while an attempt to create the type type rvalue reference to
13113 cv T' creates the type T"
13115 r
= cp_build_reference_type
13117 TYPE_REF_IS_RVALUE (t
) && TYPE_REF_IS_RVALUE (type
));
13119 r
= cp_build_reference_type (type
, TYPE_REF_IS_RVALUE (t
));
13120 r
= cp_build_qualified_type_real (r
, cp_type_quals (t
), complain
);
13122 if (r
!= error_mark_node
)
13123 /* Will this ever be needed for TYPE_..._TO values? */
13130 r
= tsubst (TYPE_OFFSET_BASETYPE (t
), args
, complain
, in_decl
);
13131 if (r
== error_mark_node
|| !MAYBE_CLASS_TYPE_P (r
))
13135 Type deduction may fail for any of the following
13138 -- Attempting to create "pointer to member of T" when T
13139 is not a class type. */
13140 if (complain
& tf_error
)
13141 error ("creating pointer to member of non-class type %qT", r
);
13142 return error_mark_node
;
13144 if (TREE_CODE (type
) == REFERENCE_TYPE
)
13146 if (complain
& tf_error
)
13147 error ("creating pointer to member reference type %qT", type
);
13148 return error_mark_node
;
13150 if (VOID_TYPE_P (type
))
13152 if (complain
& tf_error
)
13153 error ("creating pointer to member of type void");
13154 return error_mark_node
;
13156 gcc_assert (TREE_CODE (type
) != METHOD_TYPE
);
13157 if (TREE_CODE (type
) == FUNCTION_TYPE
)
13159 /* The type of the implicit object parameter gets its
13160 cv-qualifiers from the FUNCTION_TYPE. */
13163 = build_memfn_type (type
, r
, type_memfn_quals (type
),
13164 type_memfn_rqual (type
));
13165 memptr
= build_ptrmemfunc_type (build_pointer_type (method_type
));
13166 return cp_build_qualified_type_real (memptr
, cp_type_quals (t
),
13170 return cp_build_qualified_type_real (build_ptrmem_type (r
, type
),
13174 case FUNCTION_TYPE
:
13179 fntype
= tsubst_function_type (t
, args
, complain
, in_decl
);
13180 if (fntype
== error_mark_node
)
13181 return error_mark_node
;
13183 /* Substitute the exception specification. */
13184 specs
= tsubst_exception_specification (t
, args
, complain
,
13185 in_decl
, /*defer_ok*/true);
13186 if (specs
== error_mark_node
)
13187 return error_mark_node
;
13189 fntype
= build_exception_variant (fntype
, specs
);
13194 tree domain
= tsubst (TYPE_DOMAIN (t
), args
, complain
, in_decl
);
13195 if (domain
== error_mark_node
)
13196 return error_mark_node
;
13198 /* As an optimization, we avoid regenerating the array type if
13199 it will obviously be the same as T. */
13200 if (type
== TREE_TYPE (t
) && domain
== TYPE_DOMAIN (t
))
13203 /* These checks should match the ones in create_array_type_for_decl.
13207 The deduction may fail for any of the following reasons:
13209 -- Attempting to create an array with an element type that
13210 is void, a function type, or a reference type, or [DR337]
13211 an abstract class type. */
13212 if (VOID_TYPE_P (type
)
13213 || TREE_CODE (type
) == FUNCTION_TYPE
13214 || (TREE_CODE (type
) == ARRAY_TYPE
13215 && TYPE_DOMAIN (type
) == NULL_TREE
)
13216 || TREE_CODE (type
) == REFERENCE_TYPE
)
13218 if (complain
& tf_error
)
13219 error ("creating array of %qT", type
);
13220 return error_mark_node
;
13223 if (abstract_virtuals_error_sfinae (ACU_ARRAY
, type
, complain
))
13224 return error_mark_node
;
13226 r
= build_cplus_array_type (type
, domain
);
13228 if (TYPE_USER_ALIGN (t
))
13230 TYPE_ALIGN (r
) = TYPE_ALIGN (t
);
13231 TYPE_USER_ALIGN (r
) = 1;
13237 case TYPENAME_TYPE
:
13239 tree ctx
= tsubst_aggr_type (TYPE_CONTEXT (t
), args
, complain
,
13240 in_decl
, /*entering_scope=*/1);
13241 tree f
= tsubst_copy (TYPENAME_TYPE_FULLNAME (t
), args
,
13242 complain
, in_decl
);
13244 if (ctx
== error_mark_node
|| f
== error_mark_node
)
13245 return error_mark_node
;
13247 if (!MAYBE_CLASS_TYPE_P (ctx
))
13249 if (complain
& tf_error
)
13250 error ("%qT is not a class, struct, or union type", ctx
);
13251 return error_mark_node
;
13253 else if (!uses_template_parms (ctx
) && !TYPE_BEING_DEFINED (ctx
))
13255 /* Normally, make_typename_type does not require that the CTX
13256 have complete type in order to allow things like:
13258 template <class T> struct S { typename S<T>::X Y; };
13260 But, such constructs have already been resolved by this
13261 point, so here CTX really should have complete type, unless
13262 it's a partial instantiation. */
13263 ctx
= complete_type (ctx
);
13264 if (!COMPLETE_TYPE_P (ctx
))
13266 if (complain
& tf_error
)
13267 cxx_incomplete_type_error (NULL_TREE
, ctx
);
13268 return error_mark_node
;
13272 f
= make_typename_type (ctx
, f
, typename_type
,
13273 complain
| tf_keep_type_decl
);
13274 if (f
== error_mark_node
)
13276 if (TREE_CODE (f
) == TYPE_DECL
)
13278 complain
|= tf_ignore_bad_quals
;
13282 if (TREE_CODE (f
) != TYPENAME_TYPE
)
13284 if (TYPENAME_IS_ENUM_P (t
) && TREE_CODE (f
) != ENUMERAL_TYPE
)
13286 if (complain
& tf_error
)
13287 error ("%qT resolves to %qT, which is not an enumeration type",
13290 return error_mark_node
;
13292 else if (TYPENAME_IS_CLASS_P (t
) && !CLASS_TYPE_P (f
))
13294 if (complain
& tf_error
)
13295 error ("%qT resolves to %qT, which is is not a class type",
13298 return error_mark_node
;
13302 return cp_build_qualified_type_real
13303 (f
, cp_type_quals (f
) | cp_type_quals (t
), complain
);
13306 case UNBOUND_CLASS_TEMPLATE
:
13308 tree ctx
= tsubst_aggr_type (TYPE_CONTEXT (t
), args
, complain
,
13309 in_decl
, /*entering_scope=*/1);
13310 tree name
= TYPE_IDENTIFIER (t
);
13311 tree parm_list
= DECL_TEMPLATE_PARMS (TYPE_NAME (t
));
13313 if (ctx
== error_mark_node
|| name
== error_mark_node
)
13314 return error_mark_node
;
13317 parm_list
= tsubst_template_parms (parm_list
, args
, complain
);
13318 return make_unbound_class_template (ctx
, name
, parm_list
, complain
);
13325 ++cp_unevaluated_operand
;
13326 ++c_inhibit_evaluation_warnings
;
13328 type
= tsubst_expr (TYPEOF_TYPE_EXPR (t
), args
,
13330 /*integral_constant_expression_p=*/false);
13332 --cp_unevaluated_operand
;
13333 --c_inhibit_evaluation_warnings
;
13335 type
= finish_typeof (type
);
13336 return cp_build_qualified_type_real (type
,
13338 | cp_type_quals (type
),
13342 case DECLTYPE_TYPE
:
13346 ++cp_unevaluated_operand
;
13347 ++c_inhibit_evaluation_warnings
;
13349 type
= tsubst_copy_and_build (DECLTYPE_TYPE_EXPR (t
), args
,
13350 complain
|tf_decltype
, in_decl
,
13351 /*function_p*/false,
13352 /*integral_constant_expression*/false);
13354 --cp_unevaluated_operand
;
13355 --c_inhibit_evaluation_warnings
;
13357 if (DECLTYPE_FOR_LAMBDA_CAPTURE (t
))
13358 type
= lambda_capture_field_type (type
,
13359 DECLTYPE_FOR_INIT_CAPTURE (t
));
13360 else if (DECLTYPE_FOR_LAMBDA_PROXY (t
))
13361 type
= lambda_proxy_type (type
);
13364 bool id
= DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (t
);
13365 if (id
&& TREE_CODE (DECLTYPE_TYPE_EXPR (t
)) == BIT_NOT_EXPR
13367 /* In a template ~id could be either a complement expression
13368 or an unqualified-id naming a destructor; if instantiating
13369 it produces an expression, it's not an id-expression or
13372 type
= finish_decltype_type (type
, id
, complain
);
13374 return cp_build_qualified_type_real (type
,
13376 | cp_type_quals (type
),
13377 complain
| tf_ignore_bad_quals
);
13380 case UNDERLYING_TYPE
:
13382 tree type
= tsubst (UNDERLYING_TYPE_TYPE (t
), args
,
13383 complain
, in_decl
);
13384 return finish_underlying_type (type
);
13387 case TYPE_ARGUMENT_PACK
:
13388 case NONTYPE_ARGUMENT_PACK
:
13390 tree r
= TYPE_P (t
) ? cxx_make_type (code
) : make_node (code
);
13392 tsubst_template_args (ARGUMENT_PACK_ARGS (t
),
13396 SET_ARGUMENT_PACK_ARGS (r
, packed_out
);
13398 /* For template nontype argument packs, also substitute into
13400 if (code
== NONTYPE_ARGUMENT_PACK
)
13401 TREE_TYPE (r
) = tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
13420 /* We should use one of the expression tsubsts for these codes. */
13421 gcc_unreachable ();
13424 sorry ("use of %qs in template", get_tree_code_name (code
));
13425 return error_mark_node
;
13429 /* Like tsubst_expr for a BASELINK. OBJECT_TYPE, if non-NULL, is the
13430 type of the expression on the left-hand side of the "." or "->"
13434 tsubst_baselink (tree baselink
, tree object_type
,
13435 tree args
, tsubst_flags_t complain
, tree in_decl
)
13438 tree qualifying_scope
;
13441 tree template_args
= 0;
13442 bool template_id_p
= false;
13443 bool qualified
= BASELINK_QUALIFIED_P (baselink
);
13445 /* A baselink indicates a function from a base class. Both the
13446 BASELINK_ACCESS_BINFO and the base class referenced may
13447 indicate bases of the template class, rather than the
13448 instantiated class. In addition, lookups that were not
13449 ambiguous before may be ambiguous now. Therefore, we perform
13450 the lookup again. */
13451 qualifying_scope
= BINFO_TYPE (BASELINK_ACCESS_BINFO (baselink
));
13452 qualifying_scope
= tsubst (qualifying_scope
, args
,
13453 complain
, in_decl
);
13454 fns
= BASELINK_FUNCTIONS (baselink
);
13455 optype
= tsubst (BASELINK_OPTYPE (baselink
), args
, complain
, in_decl
);
13456 if (TREE_CODE (fns
) == TEMPLATE_ID_EXPR
)
13458 template_id_p
= true;
13459 template_args
= TREE_OPERAND (fns
, 1);
13460 fns
= TREE_OPERAND (fns
, 0);
13462 template_args
= tsubst_template_args (template_args
, args
,
13463 complain
, in_decl
);
13465 name
= DECL_NAME (get_first_fn (fns
));
13466 if (IDENTIFIER_TYPENAME_P (name
))
13467 name
= mangle_conv_op_name_for_type (optype
);
13468 baselink
= lookup_fnfields (qualifying_scope
, name
, /*protect=*/1);
13470 return error_mark_node
;
13472 /* If lookup found a single function, mark it as used at this
13473 point. (If it lookup found multiple functions the one selected
13474 later by overload resolution will be marked as used at that
13476 if (BASELINK_P (baselink
))
13477 fns
= BASELINK_FUNCTIONS (baselink
);
13478 if (!template_id_p
&& !really_overloaded_fn (fns
)
13479 && !mark_used (OVL_CURRENT (fns
), complain
) && !(complain
& tf_error
))
13480 return error_mark_node
;
13482 /* Add back the template arguments, if present. */
13483 if (BASELINK_P (baselink
) && template_id_p
)
13484 BASELINK_FUNCTIONS (baselink
)
13485 = build_nt (TEMPLATE_ID_EXPR
,
13486 BASELINK_FUNCTIONS (baselink
),
13488 /* Update the conversion operator type. */
13489 BASELINK_OPTYPE (baselink
) = optype
;
13492 object_type
= current_class_type
;
13495 baselink
= adjust_result_of_qualified_name_lookup (baselink
,
13501 /* Like tsubst_expr for a SCOPE_REF, given by QUALIFIED_ID. DONE is
13502 true if the qualified-id will be a postfix-expression in-and-of
13503 itself; false if more of the postfix-expression follows the
13504 QUALIFIED_ID. ADDRESS_P is true if the qualified-id is the operand
13508 tsubst_qualified_id (tree qualified_id
, tree args
,
13509 tsubst_flags_t complain
, tree in_decl
,
13510 bool done
, bool address_p
)
13516 tree template_args
;
13517 location_t loc
= UNKNOWN_LOCATION
;
13519 gcc_assert (TREE_CODE (qualified_id
) == SCOPE_REF
);
13521 /* Figure out what name to look up. */
13522 name
= TREE_OPERAND (qualified_id
, 1);
13523 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
13525 is_template
= true;
13526 loc
= EXPR_LOCATION (name
);
13527 template_args
= TREE_OPERAND (name
, 1);
13529 template_args
= tsubst_template_args (template_args
, args
,
13530 complain
, in_decl
);
13531 name
= TREE_OPERAND (name
, 0);
13535 is_template
= false;
13536 template_args
= NULL_TREE
;
13539 /* Substitute into the qualifying scope. When there are no ARGS, we
13540 are just trying to simplify a non-dependent expression. In that
13541 case the qualifying scope may be dependent, and, in any case,
13542 substituting will not help. */
13543 scope
= TREE_OPERAND (qualified_id
, 0);
13546 scope
= tsubst (scope
, args
, complain
, in_decl
);
13547 expr
= tsubst_copy (name
, args
, complain
, in_decl
);
13552 if (dependent_scope_p (scope
))
13555 expr
= build_min_nt_loc (loc
, TEMPLATE_ID_EXPR
, expr
, template_args
);
13556 return build_qualified_name (NULL_TREE
, scope
, expr
,
13557 QUALIFIED_NAME_IS_TEMPLATE (qualified_id
));
13560 if (!BASELINK_P (name
) && !DECL_P (expr
))
13562 if (TREE_CODE (expr
) == BIT_NOT_EXPR
)
13564 /* A BIT_NOT_EXPR is used to represent a destructor. */
13565 if (!check_dtor_name (scope
, TREE_OPERAND (expr
, 0)))
13567 error ("qualifying type %qT does not match destructor name ~%qT",
13568 scope
, TREE_OPERAND (expr
, 0));
13569 expr
= error_mark_node
;
13572 expr
= lookup_qualified_name (scope
, complete_dtor_identifier
,
13573 /*is_type_p=*/0, false);
13576 expr
= lookup_qualified_name (scope
, expr
, /*is_type_p=*/0, false);
13577 if (TREE_CODE (TREE_CODE (expr
) == TEMPLATE_DECL
13578 ? DECL_TEMPLATE_RESULT (expr
) : expr
) == TYPE_DECL
)
13580 if (complain
& tf_error
)
13582 error ("dependent-name %qE is parsed as a non-type, but "
13583 "instantiation yields a type", qualified_id
);
13584 inform (input_location
, "say %<typename %E%> if a type is meant", qualified_id
);
13586 return error_mark_node
;
13592 check_accessibility_of_qualified_id (expr
, /*object_type=*/NULL_TREE
,
13594 /* Remember that there was a reference to this entity. */
13595 if (!mark_used (expr
, complain
) && !(complain
& tf_error
))
13596 return error_mark_node
;
13599 if (expr
== error_mark_node
|| TREE_CODE (expr
) == TREE_LIST
)
13601 if (complain
& tf_error
)
13602 qualified_name_lookup_error (scope
,
13603 TREE_OPERAND (qualified_id
, 1),
13604 expr
, input_location
);
13605 return error_mark_node
;
13609 expr
= lookup_template_function (expr
, template_args
);
13611 if (expr
== error_mark_node
&& complain
& tf_error
)
13612 qualified_name_lookup_error (scope
, TREE_OPERAND (qualified_id
, 1),
13613 expr
, input_location
);
13614 else if (TYPE_P (scope
))
13616 expr
= (adjust_result_of_qualified_name_lookup
13617 (expr
, scope
, current_nonlambda_class_type ()));
13618 expr
= (finish_qualified_id_expr
13619 (scope
, expr
, done
, address_p
&& PTRMEM_OK_P (qualified_id
),
13620 QUALIFIED_NAME_IS_TEMPLATE (qualified_id
),
13621 /*template_arg_p=*/false, complain
));
13624 /* Expressions do not generally have reference type. */
13625 if (TREE_CODE (expr
) != SCOPE_REF
13626 /* However, if we're about to form a pointer-to-member, we just
13627 want the referenced member referenced. */
13628 && TREE_CODE (expr
) != OFFSET_REF
)
13629 expr
= convert_from_reference (expr
);
13634 /* tsubst the initializer for a VAR_DECL. INIT is the unsubstituted
13635 initializer, DECL is the substituted VAR_DECL. Other arguments are as
13639 tsubst_init (tree init
, tree decl
, tree args
,
13640 tsubst_flags_t complain
, tree in_decl
)
13645 init
= tsubst_expr (init
, args
, complain
, in_decl
, false);
13649 /* If we had an initializer but it
13650 instantiated to nothing,
13651 value-initialize the object. This will
13652 only occur when the initializer was a
13653 pack expansion where the parameter packs
13654 used in that expansion were of length
13656 init
= build_value_init (TREE_TYPE (decl
),
13658 if (TREE_CODE (init
) == AGGR_INIT_EXPR
)
13659 init
= get_target_expr_sfinae (init
, complain
);
13665 /* Like tsubst, but deals with expressions. This function just replaces
13666 template parms; to finish processing the resultant expression, use
13667 tsubst_copy_and_build or tsubst_expr. */
13670 tsubst_copy (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
13672 enum tree_code code
;
13675 if (t
== NULL_TREE
|| t
== error_mark_node
|| args
== NULL_TREE
)
13678 code
= TREE_CODE (t
);
13683 r
= retrieve_local_specialization (t
);
13685 if (r
== NULL_TREE
)
13687 /* We get here for a use of 'this' in an NSDMI. */
13688 if (DECL_NAME (t
) == this_identifier
13689 && current_function_decl
13690 && DECL_CONSTRUCTOR_P (current_function_decl
))
13691 return current_class_ptr
;
13693 /* This can happen for a parameter name used later in a function
13694 declaration (such as in a late-specified return type). Just
13695 make a dummy decl, since it's only used for its type. */
13696 gcc_assert (cp_unevaluated_operand
!= 0);
13697 r
= tsubst_decl (t
, args
, complain
);
13698 /* Give it the template pattern as its context; its true context
13699 hasn't been instantiated yet and this is good enough for
13701 DECL_CONTEXT (r
) = DECL_CONTEXT (t
);
13704 if (TREE_CODE (r
) == ARGUMENT_PACK_SELECT
)
13705 r
= ARGUMENT_PACK_SELECT_ARG (r
);
13706 if (!mark_used (r
, complain
) && !(complain
& tf_error
))
13707 return error_mark_node
;
13715 if (DECL_TEMPLATE_PARM_P (t
))
13716 return tsubst_copy (DECL_INITIAL (t
), args
, complain
, in_decl
);
13717 /* There is no need to substitute into namespace-scope
13719 if (DECL_NAMESPACE_SCOPE_P (t
))
13721 /* If ARGS is NULL, then T is known to be non-dependent. */
13722 if (args
== NULL_TREE
)
13723 return scalar_constant_value (t
);
13725 /* Unfortunately, we cannot just call lookup_name here.
13728 template <int I> int f() {
13730 struct S { void g() { E e = a; } };
13733 When we instantiate f<7>::S::g(), say, lookup_name is not
13734 clever enough to find f<7>::a. */
13736 = tsubst_aggr_type (DECL_CONTEXT (t
), args
, complain
, in_decl
,
13737 /*entering_scope=*/0);
13739 for (v
= TYPE_VALUES (enum_type
);
13741 v
= TREE_CHAIN (v
))
13742 if (TREE_PURPOSE (v
) == DECL_NAME (t
))
13743 return TREE_VALUE (v
);
13745 /* We didn't find the name. That should never happen; if
13746 name-lookup found it during preliminary parsing, we
13747 should find it again here during instantiation. */
13748 gcc_unreachable ();
13753 if (PACK_EXPANSION_P (TREE_TYPE (t
)))
13755 /* Check for a local specialization set up by
13756 tsubst_pack_expansion. */
13757 if (tree r
= retrieve_local_specialization (t
))
13759 if (TREE_CODE (r
) == ARGUMENT_PACK_SELECT
)
13760 r
= ARGUMENT_PACK_SELECT_ARG (r
);
13764 /* When retrieving a capture pack from a generic lambda, remove the
13765 lambda call op's own template argument list from ARGS. Only the
13766 template arguments active for the closure type should be used to
13767 retrieve the pack specialization. */
13768 if (LAMBDA_FUNCTION_P (current_function_decl
)
13769 && (template_class_depth (DECL_CONTEXT (t
))
13770 != TMPL_ARGS_DEPTH (args
)))
13771 args
= strip_innermost_template_args (args
, 1);
13773 /* Otherwise return the full NONTYPE_ARGUMENT_PACK that
13774 tsubst_decl put in the hash table. */
13775 return retrieve_specialization (t
, args
, 0);
13778 if (DECL_CONTEXT (t
))
13782 ctx
= tsubst_aggr_type (DECL_CONTEXT (t
), args
, complain
, in_decl
,
13783 /*entering_scope=*/1);
13784 if (ctx
!= DECL_CONTEXT (t
))
13786 tree r
= lookup_field (ctx
, DECL_NAME (t
), 0, false);
13789 if (complain
& tf_error
)
13790 error ("using invalid field %qD", t
);
13791 return error_mark_node
;
13800 case FUNCTION_DECL
:
13801 if (DECL_LANG_SPECIFIC (t
) && DECL_TEMPLATE_INFO (t
))
13802 r
= tsubst (t
, args
, complain
, in_decl
);
13803 else if (local_variable_p (t
))
13805 r
= retrieve_local_specialization (t
);
13806 if (r
== NULL_TREE
)
13808 /* First try name lookup to find the instantiation. */
13809 r
= lookup_name (DECL_NAME (t
));
13812 /* Make sure that the one we found is the one we want. */
13813 tree ctx
= DECL_CONTEXT (t
);
13814 if (DECL_LANG_SPECIFIC (ctx
) && DECL_TEMPLATE_INFO (ctx
))
13815 ctx
= tsubst (ctx
, args
, complain
, in_decl
);
13816 if (ctx
!= DECL_CONTEXT (r
))
13824 /* This can happen for a variable used in a
13825 late-specified return type of a local lambda, or for a
13826 local static or constant. Building a new VAR_DECL
13827 should be OK in all those cases. */
13828 r
= tsubst_decl (t
, args
, complain
);
13829 if (decl_maybe_constant_var_p (r
))
13831 /* We can't call cp_finish_decl, so handle the
13832 initializer by hand. */
13833 tree init
= tsubst_init (DECL_INITIAL (t
), r
, args
,
13834 complain
, in_decl
);
13835 if (!processing_template_decl
)
13836 init
= maybe_constant_init (init
);
13837 if (processing_template_decl
13838 ? potential_constant_expression (init
)
13839 : reduced_constant_expression_p (init
))
13840 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (r
)
13841 = TREE_CONSTANT (r
) = true;
13842 DECL_INITIAL (r
) = init
;
13844 gcc_assert (cp_unevaluated_operand
|| TREE_STATIC (r
)
13845 || decl_constant_var_p (r
)
13846 || errorcount
|| sorrycount
);
13847 if (!processing_template_decl
)
13849 if (TREE_STATIC (r
))
13850 rest_of_decl_compilation (r
, toplevel_bindings_p (),
13853 r
= process_outer_var_ref (r
, complain
);
13856 /* Remember this for subsequent uses. */
13857 if (local_specializations
)
13858 register_local_specialization (r
, t
);
13863 if (!mark_used (r
, complain
) && !(complain
& tf_error
))
13864 return error_mark_node
;
13867 case NAMESPACE_DECL
:
13871 /* An OVERLOAD will always be a non-dependent overload set; an
13872 overload set from function scope will just be represented with an
13873 IDENTIFIER_NODE, and from class scope with a BASELINK. */
13874 gcc_assert (!uses_template_parms (t
));
13878 return tsubst_baselink (t
, current_nonlambda_class_type (),
13879 args
, complain
, in_decl
);
13881 case TEMPLATE_DECL
:
13882 if (DECL_TEMPLATE_TEMPLATE_PARM_P (t
))
13883 return tsubst (TREE_TYPE (DECL_TEMPLATE_RESULT (t
)),
13884 args
, complain
, in_decl
);
13885 else if (DECL_FUNCTION_TEMPLATE_P (t
) && DECL_MEMBER_TEMPLATE_P (t
))
13886 return tsubst (t
, args
, complain
, in_decl
);
13887 else if (DECL_CLASS_SCOPE_P (t
)
13888 && uses_template_parms (DECL_CONTEXT (t
)))
13890 /* Template template argument like the following example need
13893 template <template <class> class TT> struct C {};
13894 template <class T> struct D {
13895 template <class U> struct E {};
13900 We are processing the template argument `E' in #1 for
13901 the template instantiation #2. Originally, `E' is a
13902 TEMPLATE_DECL with `D<T>' as its DECL_CONTEXT. Now we
13903 have to substitute this with one having context `D<int>'. */
13905 tree context
= tsubst (DECL_CONTEXT (t
), args
, complain
, in_decl
);
13906 return lookup_field (context
, DECL_NAME(t
), 0, false);
13909 /* Ordinary template template argument. */
13913 case REINTERPRET_CAST_EXPR
:
13914 case CONST_CAST_EXPR
:
13915 case STATIC_CAST_EXPR
:
13916 case DYNAMIC_CAST_EXPR
:
13917 case IMPLICIT_CONV_EXPR
:
13921 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
13922 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
13923 return build1 (code
, type
, op0
);
13927 if (PACK_EXPANSION_P (TREE_OPERAND (t
, 0)))
13930 tree expanded
, op
= TREE_OPERAND (t
, 0);
13933 if (SIZEOF_EXPR_TYPE_P (t
))
13934 op
= TREE_TYPE (op
);
13936 ++cp_unevaluated_operand
;
13937 ++c_inhibit_evaluation_warnings
;
13938 /* We only want to compute the number of arguments. */
13939 expanded
= tsubst_pack_expansion (op
, args
, complain
, in_decl
);
13940 --cp_unevaluated_operand
;
13941 --c_inhibit_evaluation_warnings
;
13943 if (TREE_CODE (expanded
) == TREE_VEC
)
13944 len
= TREE_VEC_LENGTH (expanded
);
13946 if (expanded
== error_mark_node
)
13947 return error_mark_node
;
13948 else if (PACK_EXPANSION_P (expanded
)
13949 || (TREE_CODE (expanded
) == TREE_VEC
13951 && PACK_EXPANSION_P (TREE_VEC_ELT (expanded
, len
-1))))
13953 if (TREE_CODE (expanded
) == TREE_VEC
)
13954 expanded
= TREE_VEC_ELT (expanded
, len
- 1);
13956 if (TYPE_P (expanded
))
13957 return cxx_sizeof_or_alignof_type (expanded
, SIZEOF_EXPR
,
13958 complain
& tf_error
);
13960 return cxx_sizeof_or_alignof_expr (expanded
, SIZEOF_EXPR
,
13961 complain
& tf_error
);
13964 return build_int_cst (size_type_node
, len
);
13966 if (SIZEOF_EXPR_TYPE_P (t
))
13968 r
= tsubst (TREE_TYPE (TREE_OPERAND (t
, 0)),
13969 args
, complain
, in_decl
);
13970 r
= build1 (NOP_EXPR
, r
, error_mark_node
);
13971 r
= build1 (SIZEOF_EXPR
,
13972 tsubst (TREE_TYPE (t
), args
, complain
, in_decl
), r
);
13973 SIZEOF_EXPR_TYPE_P (r
) = 1;
13980 case TRUTH_NOT_EXPR
:
13983 case UNARY_PLUS_EXPR
: /* Unary + */
13985 case AT_ENCODE_EXPR
:
13989 case REALPART_EXPR
:
13990 case IMAGPART_EXPR
:
13993 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
13994 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
13995 return build1 (code
, type
, op0
);
13998 case COMPONENT_REF
:
14003 object
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
14004 name
= TREE_OPERAND (t
, 1);
14005 if (TREE_CODE (name
) == BIT_NOT_EXPR
)
14007 name
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
14008 complain
, in_decl
);
14009 name
= build1 (BIT_NOT_EXPR
, NULL_TREE
, name
);
14011 else if (TREE_CODE (name
) == SCOPE_REF
14012 && TREE_CODE (TREE_OPERAND (name
, 1)) == BIT_NOT_EXPR
)
14014 tree base
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
14015 complain
, in_decl
);
14016 name
= TREE_OPERAND (name
, 1);
14017 name
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
14018 complain
, in_decl
);
14019 name
= build1 (BIT_NOT_EXPR
, NULL_TREE
, name
);
14020 name
= build_qualified_name (/*type=*/NULL_TREE
,
14022 /*template_p=*/false);
14024 else if (BASELINK_P (name
))
14025 name
= tsubst_baselink (name
,
14026 non_reference (TREE_TYPE (object
)),
14030 name
= tsubst_copy (name
, args
, complain
, in_decl
);
14031 return build_nt (COMPONENT_REF
, object
, name
, NULL_TREE
);
14037 case TRUNC_DIV_EXPR
:
14038 case CEIL_DIV_EXPR
:
14039 case FLOOR_DIV_EXPR
:
14040 case ROUND_DIV_EXPR
:
14041 case EXACT_DIV_EXPR
:
14045 case TRUNC_MOD_EXPR
:
14046 case FLOOR_MOD_EXPR
:
14047 case TRUTH_ANDIF_EXPR
:
14048 case TRUTH_ORIF_EXPR
:
14049 case TRUTH_AND_EXPR
:
14050 case TRUTH_OR_EXPR
:
14063 case COMPOUND_EXPR
:
14066 case PREDECREMENT_EXPR
:
14067 case PREINCREMENT_EXPR
:
14068 case POSTDECREMENT_EXPR
:
14069 case POSTINCREMENT_EXPR
:
14071 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
14072 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
14073 return build_nt (code
, op0
, op1
);
14078 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
14079 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
14080 return build_qualified_name (/*type=*/NULL_TREE
, op0
, op1
,
14081 QUALIFIED_NAME_IS_TEMPLATE (t
));
14086 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
14087 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
14088 return build_nt (ARRAY_REF
, op0
, op1
, NULL_TREE
, NULL_TREE
);
14093 int n
= VL_EXP_OPERAND_LENGTH (t
);
14094 tree result
= build_vl_exp (CALL_EXPR
, n
);
14096 for (i
= 0; i
< n
; i
++)
14097 TREE_OPERAND (t
, i
) = tsubst_copy (TREE_OPERAND (t
, i
), args
,
14098 complain
, in_decl
);
14104 case PSEUDO_DTOR_EXPR
:
14105 case VEC_PERM_EXPR
:
14107 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
14108 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
14109 tree op2
= tsubst_copy (TREE_OPERAND (t
, 2), args
, complain
, in_decl
);
14110 r
= build_nt (code
, op0
, op1
, op2
);
14111 TREE_NO_WARNING (r
) = TREE_NO_WARNING (t
);
14117 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
14118 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
14119 tree op2
= tsubst_copy (TREE_OPERAND (t
, 2), args
, complain
, in_decl
);
14120 r
= build_nt (code
, op0
, op1
, op2
);
14121 NEW_EXPR_USE_GLOBAL (r
) = NEW_EXPR_USE_GLOBAL (t
);
14127 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
14128 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
14129 r
= build_nt (code
, op0
, op1
);
14130 DELETE_EXPR_USE_GLOBAL (r
) = DELETE_EXPR_USE_GLOBAL (t
);
14131 DELETE_EXPR_USE_VEC (r
) = DELETE_EXPR_USE_VEC (t
);
14135 case TEMPLATE_ID_EXPR
:
14137 /* Substituted template arguments */
14138 tree fn
= TREE_OPERAND (t
, 0);
14139 tree targs
= TREE_OPERAND (t
, 1);
14141 fn
= tsubst_copy (fn
, args
, complain
, in_decl
);
14143 targs
= tsubst_template_args (targs
, args
, complain
, in_decl
);
14145 return lookup_template_function (fn
, targs
);
14150 tree purpose
, value
, chain
;
14152 if (t
== void_list_node
)
14155 purpose
= TREE_PURPOSE (t
);
14157 purpose
= tsubst_copy (purpose
, args
, complain
, in_decl
);
14158 value
= TREE_VALUE (t
);
14160 value
= tsubst_copy (value
, args
, complain
, in_decl
);
14161 chain
= TREE_CHAIN (t
);
14162 if (chain
&& chain
!= void_type_node
)
14163 chain
= tsubst_copy (chain
, args
, complain
, in_decl
);
14164 if (purpose
== TREE_PURPOSE (t
)
14165 && value
== TREE_VALUE (t
)
14166 && chain
== TREE_CHAIN (t
))
14168 return tree_cons (purpose
, value
, chain
);
14173 case ENUMERAL_TYPE
:
14175 case TEMPLATE_TYPE_PARM
:
14176 case TEMPLATE_TEMPLATE_PARM
:
14177 case BOUND_TEMPLATE_TEMPLATE_PARM
:
14178 case TEMPLATE_PARM_INDEX
:
14180 case REFERENCE_TYPE
:
14182 case FUNCTION_TYPE
:
14185 case TYPENAME_TYPE
:
14186 case UNBOUND_CLASS_TEMPLATE
:
14188 case DECLTYPE_TYPE
:
14190 return tsubst (t
, args
, complain
, in_decl
);
14194 /* Fall through. */
14195 case IDENTIFIER_NODE
:
14196 if (IDENTIFIER_TYPENAME_P (t
))
14198 tree new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
14199 return mangle_conv_op_name_for_type (new_type
);
14205 /* This is handled by tsubst_copy_and_build. */
14206 gcc_unreachable ();
14210 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
14211 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
14212 return build_x_va_arg (EXPR_LOCATION (t
), op0
, type
);
14215 case CLEANUP_POINT_EXPR
:
14216 /* We shouldn't have built any of these during initial template
14217 generation. Instead, they should be built during instantiation
14218 in response to the saved STMT_IS_FULL_EXPR_P setting. */
14219 gcc_unreachable ();
14223 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
14224 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
14225 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
14226 r
= build2 (code
, type
, op0
, op1
);
14227 PTRMEM_OK_P (r
) = PTRMEM_OK_P (t
);
14228 if (!mark_used (TREE_OPERAND (r
, 1), complain
)
14229 && !(complain
& tf_error
))
14230 return error_mark_node
;
14234 case EXPR_PACK_EXPANSION
:
14235 error ("invalid use of pack expansion expression");
14236 return error_mark_node
;
14238 case NONTYPE_ARGUMENT_PACK
:
14239 error ("use %<...%> to expand argument pack");
14240 return error_mark_node
;
14243 gcc_checking_assert (t
== void_node
&& VOID_TYPE_P (TREE_TYPE (t
)));
14251 /* Instantiate any typedefs in the type. */
14252 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
14253 r
= fold_convert (type
, t
);
14254 gcc_assert (TREE_CODE (r
) == code
);
14259 /* These can sometimes show up in a partial instantiation, but never
14260 involve template parms. */
14261 gcc_assert (!uses_template_parms (t
));
14264 case UNARY_LEFT_FOLD_EXPR
:
14265 return tsubst_unary_left_fold (t
, args
, complain
, in_decl
);
14266 case UNARY_RIGHT_FOLD_EXPR
:
14267 return tsubst_unary_right_fold (t
, args
, complain
, in_decl
);
14268 case BINARY_LEFT_FOLD_EXPR
:
14269 return tsubst_binary_left_fold (t
, args
, complain
, in_decl
);
14270 case BINARY_RIGHT_FOLD_EXPR
:
14271 return tsubst_binary_right_fold (t
, args
, complain
, in_decl
);
14274 /* We shouldn't get here, but keep going if !ENABLE_CHECKING. */
14275 gcc_checking_assert (false);
14280 /* Helper function for tsubst_omp_clauses, used for instantiation of
14281 OMP_CLAUSE_DECL of clauses that handles also OpenMP array sections
14282 represented with TREE_LIST. */
14285 tsubst_omp_clause_decl (tree decl
, tree args
, tsubst_flags_t complain
,
14288 if (TREE_CODE (decl
) == TREE_LIST
)
14291 = tsubst_expr (TREE_PURPOSE (decl
), args
, complain
, in_decl
,
14292 /*integral_constant_expression_p=*/false);
14293 tree length
= tsubst_expr (TREE_VALUE (decl
), args
, complain
, in_decl
,
14294 /*integral_constant_expression_p=*/false);
14295 tree chain
= tsubst_omp_clause_decl (TREE_CHAIN (decl
), args
, complain
,
14297 if (TREE_PURPOSE (decl
) == low_bound
14298 && TREE_VALUE (decl
) == length
14299 && TREE_CHAIN (decl
) == chain
)
14301 return tree_cons (low_bound
, length
, chain
);
14303 return tsubst_copy (decl
, args
, complain
, in_decl
);
14306 /* Like tsubst_copy, but specifically for OpenMP clauses. */
14309 tsubst_omp_clauses (tree clauses
, bool declare_simd
,
14310 tree args
, tsubst_flags_t complain
, tree in_decl
)
14312 tree new_clauses
= NULL
, nc
, oc
;
14314 for (oc
= clauses
; oc
; oc
= OMP_CLAUSE_CHAIN (oc
))
14316 nc
= copy_node (oc
);
14317 OMP_CLAUSE_CHAIN (nc
) = new_clauses
;
14320 switch (OMP_CLAUSE_CODE (nc
))
14322 case OMP_CLAUSE_LASTPRIVATE
:
14323 if (OMP_CLAUSE_LASTPRIVATE_STMT (oc
))
14325 OMP_CLAUSE_LASTPRIVATE_STMT (nc
) = push_stmt_list ();
14326 tsubst_expr (OMP_CLAUSE_LASTPRIVATE_STMT (oc
), args
, complain
,
14327 in_decl
, /*integral_constant_expression_p=*/false);
14328 OMP_CLAUSE_LASTPRIVATE_STMT (nc
)
14329 = pop_stmt_list (OMP_CLAUSE_LASTPRIVATE_STMT (nc
));
14332 case OMP_CLAUSE_PRIVATE
:
14333 case OMP_CLAUSE_SHARED
:
14334 case OMP_CLAUSE_FIRSTPRIVATE
:
14335 case OMP_CLAUSE_COPYIN
:
14336 case OMP_CLAUSE_COPYPRIVATE
:
14337 case OMP_CLAUSE_UNIFORM
:
14338 OMP_CLAUSE_DECL (nc
) = tsubst_copy (OMP_CLAUSE_DECL (oc
), args
,
14339 complain
, in_decl
);
14341 case OMP_CLAUSE_DEPEND
:
14342 case OMP_CLAUSE_FROM
:
14343 case OMP_CLAUSE_TO
:
14344 case OMP_CLAUSE_MAP
:
14345 OMP_CLAUSE_DECL (nc
)
14346 = tsubst_omp_clause_decl (OMP_CLAUSE_DECL (oc
), args
, complain
,
14349 case OMP_CLAUSE_IF
:
14350 case OMP_CLAUSE_NUM_THREADS
:
14351 case OMP_CLAUSE_SCHEDULE
:
14352 case OMP_CLAUSE_COLLAPSE
:
14353 case OMP_CLAUSE_FINAL
:
14354 case OMP_CLAUSE_DEVICE
:
14355 case OMP_CLAUSE_DIST_SCHEDULE
:
14356 case OMP_CLAUSE_NUM_TEAMS
:
14357 case OMP_CLAUSE_THREAD_LIMIT
:
14358 case OMP_CLAUSE_SAFELEN
:
14359 case OMP_CLAUSE_SIMDLEN
:
14360 OMP_CLAUSE_OPERAND (nc
, 0)
14361 = tsubst_expr (OMP_CLAUSE_OPERAND (oc
, 0), args
, complain
,
14362 in_decl
, /*integral_constant_expression_p=*/false);
14364 case OMP_CLAUSE_REDUCTION
:
14365 if (OMP_CLAUSE_REDUCTION_PLACEHOLDER (oc
))
14367 tree placeholder
= OMP_CLAUSE_REDUCTION_PLACEHOLDER (oc
);
14368 if (TREE_CODE (placeholder
) == SCOPE_REF
)
14370 tree scope
= tsubst (TREE_OPERAND (placeholder
, 0), args
,
14371 complain
, in_decl
);
14372 OMP_CLAUSE_REDUCTION_PLACEHOLDER (nc
)
14373 = build_qualified_name (NULL_TREE
, scope
,
14374 TREE_OPERAND (placeholder
, 1),
14378 gcc_assert (identifier_p (placeholder
));
14380 OMP_CLAUSE_DECL (nc
) = tsubst_copy (OMP_CLAUSE_DECL (oc
), args
,
14381 complain
, in_decl
);
14383 case OMP_CLAUSE_LINEAR
:
14384 case OMP_CLAUSE_ALIGNED
:
14385 OMP_CLAUSE_DECL (nc
) = tsubst_copy (OMP_CLAUSE_DECL (oc
), args
,
14386 complain
, in_decl
);
14387 OMP_CLAUSE_OPERAND (nc
, 1)
14388 = tsubst_expr (OMP_CLAUSE_OPERAND (oc
, 1), args
, complain
,
14389 in_decl
, /*integral_constant_expression_p=*/false);
14391 case OMP_CLAUSE_NOWAIT
:
14392 case OMP_CLAUSE_ORDERED
:
14393 case OMP_CLAUSE_DEFAULT
:
14394 case OMP_CLAUSE_UNTIED
:
14395 case OMP_CLAUSE_MERGEABLE
:
14396 case OMP_CLAUSE_INBRANCH
:
14397 case OMP_CLAUSE_NOTINBRANCH
:
14398 case OMP_CLAUSE_PROC_BIND
:
14399 case OMP_CLAUSE_FOR
:
14400 case OMP_CLAUSE_PARALLEL
:
14401 case OMP_CLAUSE_SECTIONS
:
14402 case OMP_CLAUSE_TASKGROUP
:
14405 gcc_unreachable ();
14409 new_clauses
= nreverse (new_clauses
);
14411 new_clauses
= finish_omp_clauses (new_clauses
);
14412 return new_clauses
;
14415 /* Like tsubst_copy_and_build, but unshare TREE_LIST nodes. */
14418 tsubst_copy_asm_operands (tree t
, tree args
, tsubst_flags_t complain
,
14421 #define RECUR(t) tsubst_copy_asm_operands (t, args, complain, in_decl)
14423 tree purpose
, value
, chain
;
14428 if (TREE_CODE (t
) != TREE_LIST
)
14429 return tsubst_copy_and_build (t
, args
, complain
, in_decl
,
14430 /*function_p=*/false,
14431 /*integral_constant_expression_p=*/false);
14433 if (t
== void_list_node
)
14436 purpose
= TREE_PURPOSE (t
);
14438 purpose
= RECUR (purpose
);
14439 value
= TREE_VALUE (t
);
14442 if (TREE_CODE (value
) != LABEL_DECL
)
14443 value
= RECUR (value
);
14446 value
= lookup_label (DECL_NAME (value
));
14447 gcc_assert (TREE_CODE (value
) == LABEL_DECL
);
14448 TREE_USED (value
) = 1;
14451 chain
= TREE_CHAIN (t
);
14452 if (chain
&& chain
!= void_type_node
)
14453 chain
= RECUR (chain
);
14454 return tree_cons (purpose
, value
, chain
);
14458 /* Substitute one OMP_FOR iterator. */
14461 tsubst_omp_for_iterator (tree t
, int i
, tree declv
, tree initv
,
14462 tree condv
, tree incrv
, tree
*clauses
,
14463 tree args
, tsubst_flags_t complain
, tree in_decl
,
14464 bool integral_constant_expression_p
)
14466 #define RECUR(NODE) \
14467 tsubst_expr ((NODE), args, complain, in_decl, \
14468 integral_constant_expression_p)
14469 tree decl
, init
, cond
, incr
;
14471 init
= TREE_VEC_ELT (OMP_FOR_INIT (t
), i
);
14472 gcc_assert (TREE_CODE (init
) == MODIFY_EXPR
);
14473 decl
= TREE_OPERAND (init
, 0);
14474 init
= TREE_OPERAND (init
, 1);
14475 tree decl_expr
= NULL_TREE
;
14476 if (init
&& TREE_CODE (init
) == DECL_EXPR
)
14478 /* We need to jump through some hoops to handle declarations in the
14479 for-init-statement, since we might need to handle auto deduction,
14480 but we need to keep control of initialization. */
14482 init
= DECL_INITIAL (DECL_EXPR_DECL (init
));
14483 decl
= tsubst_decl (decl
, args
, complain
);
14486 decl
= RECUR (decl
);
14487 init
= RECUR (init
);
14489 tree auto_node
= type_uses_auto (TREE_TYPE (decl
));
14490 if (auto_node
&& init
)
14492 = do_auto_deduction (TREE_TYPE (decl
), init
, auto_node
);
14494 gcc_assert (!type_dependent_expression_p (decl
));
14496 if (!CLASS_TYPE_P (TREE_TYPE (decl
)))
14500 /* Declare the variable, but don't let that initialize it. */
14501 tree init_sav
= DECL_INITIAL (DECL_EXPR_DECL (decl_expr
));
14502 DECL_INITIAL (DECL_EXPR_DECL (decl_expr
)) = NULL_TREE
;
14504 DECL_INITIAL (DECL_EXPR_DECL (decl_expr
)) = init_sav
;
14507 cond
= RECUR (TREE_VEC_ELT (OMP_FOR_COND (t
), i
));
14508 incr
= TREE_VEC_ELT (OMP_FOR_INCR (t
), i
);
14509 if (TREE_CODE (incr
) == MODIFY_EXPR
)
14511 tree lhs
= RECUR (TREE_OPERAND (incr
, 0));
14512 tree rhs
= RECUR (TREE_OPERAND (incr
, 1));
14513 incr
= build_x_modify_expr (EXPR_LOCATION (incr
), lhs
,
14514 NOP_EXPR
, rhs
, complain
);
14517 incr
= RECUR (incr
);
14518 TREE_VEC_ELT (declv
, i
) = decl
;
14519 TREE_VEC_ELT (initv
, i
) = init
;
14520 TREE_VEC_ELT (condv
, i
) = cond
;
14521 TREE_VEC_ELT (incrv
, i
) = incr
;
14527 /* Declare and initialize the variable. */
14534 for (c
= *clauses
; c
; c
= OMP_CLAUSE_CHAIN (c
))
14536 if ((OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_PRIVATE
14537 || OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_LASTPRIVATE
)
14538 && OMP_CLAUSE_DECL (c
) == decl
)
14540 else if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_FIRSTPRIVATE
14541 && OMP_CLAUSE_DECL (c
) == decl
)
14542 error ("iteration variable %qD should not be firstprivate", decl
);
14543 else if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_REDUCTION
14544 && OMP_CLAUSE_DECL (c
) == decl
)
14545 error ("iteration variable %qD should not be reduction", decl
);
14549 c
= build_omp_clause (input_location
, OMP_CLAUSE_PRIVATE
);
14550 OMP_CLAUSE_DECL (c
) = decl
;
14551 c
= finish_omp_clauses (c
);
14554 OMP_CLAUSE_CHAIN (c
) = *clauses
;
14559 cond
= TREE_VEC_ELT (OMP_FOR_COND (t
), i
);
14560 if (COMPARISON_CLASS_P (cond
))
14562 tree op0
= RECUR (TREE_OPERAND (cond
, 0));
14563 tree op1
= RECUR (TREE_OPERAND (cond
, 1));
14564 cond
= build2 (TREE_CODE (cond
), boolean_type_node
, op0
, op1
);
14567 cond
= RECUR (cond
);
14568 incr
= TREE_VEC_ELT (OMP_FOR_INCR (t
), i
);
14569 switch (TREE_CODE (incr
))
14571 case PREINCREMENT_EXPR
:
14572 case PREDECREMENT_EXPR
:
14573 case POSTINCREMENT_EXPR
:
14574 case POSTDECREMENT_EXPR
:
14575 incr
= build2 (TREE_CODE (incr
), TREE_TYPE (decl
),
14576 RECUR (TREE_OPERAND (incr
, 0)), NULL_TREE
);
14579 if (TREE_CODE (TREE_OPERAND (incr
, 1)) == PLUS_EXPR
14580 || TREE_CODE (TREE_OPERAND (incr
, 1)) == MINUS_EXPR
)
14582 tree rhs
= TREE_OPERAND (incr
, 1);
14583 tree lhs
= RECUR (TREE_OPERAND (incr
, 0));
14584 tree rhs0
= RECUR (TREE_OPERAND (rhs
, 0));
14585 tree rhs1
= RECUR (TREE_OPERAND (rhs
, 1));
14586 incr
= build2 (MODIFY_EXPR
, TREE_TYPE (decl
), lhs
,
14587 build2 (TREE_CODE (rhs
), TREE_TYPE (decl
),
14591 incr
= RECUR (incr
);
14594 if (TREE_CODE (TREE_OPERAND (incr
, 1)) == PLUS_EXPR
14595 || TREE_CODE (TREE_OPERAND (incr
, 1)) == MINUS_EXPR
)
14597 tree lhs
= RECUR (TREE_OPERAND (incr
, 0));
14598 incr
= build2 (MODIFY_EXPR
, TREE_TYPE (decl
), lhs
,
14599 build2 (TREE_CODE (TREE_OPERAND (incr
, 1)),
14600 TREE_TYPE (decl
), lhs
,
14601 RECUR (TREE_OPERAND (incr
, 2))));
14603 else if (TREE_CODE (TREE_OPERAND (incr
, 1)) == NOP_EXPR
14604 && (TREE_CODE (TREE_OPERAND (incr
, 2)) == PLUS_EXPR
14605 || (TREE_CODE (TREE_OPERAND (incr
, 2)) == MINUS_EXPR
)))
14607 tree rhs
= TREE_OPERAND (incr
, 2);
14608 tree lhs
= RECUR (TREE_OPERAND (incr
, 0));
14609 tree rhs0
= RECUR (TREE_OPERAND (rhs
, 0));
14610 tree rhs1
= RECUR (TREE_OPERAND (rhs
, 1));
14611 incr
= build2 (MODIFY_EXPR
, TREE_TYPE (decl
), lhs
,
14612 build2 (TREE_CODE (rhs
), TREE_TYPE (decl
),
14616 incr
= RECUR (incr
);
14619 incr
= RECUR (incr
);
14623 TREE_VEC_ELT (declv
, i
) = decl
;
14624 TREE_VEC_ELT (initv
, i
) = init
;
14625 TREE_VEC_ELT (condv
, i
) = cond
;
14626 TREE_VEC_ELT (incrv
, i
) = incr
;
14630 /* Like tsubst_copy for expressions, etc. but also does semantic
14634 tsubst_expr (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
,
14635 bool integral_constant_expression_p
)
14637 #define RETURN(EXP) do { r = (EXP); goto out; } while(0)
14638 #define RECUR(NODE) \
14639 tsubst_expr ((NODE), args, complain, in_decl, \
14640 integral_constant_expression_p)
14646 if (t
== NULL_TREE
|| t
== error_mark_node
)
14649 loc
= input_location
;
14650 if (EXPR_HAS_LOCATION (t
))
14651 input_location
= EXPR_LOCATION (t
);
14652 if (STATEMENT_CODE_P (TREE_CODE (t
)))
14653 current_stmt_tree ()->stmts_are_full_exprs_p
= STMT_IS_FULL_EXPR_P (t
);
14655 switch (TREE_CODE (t
))
14657 case STATEMENT_LIST
:
14659 tree_stmt_iterator i
;
14660 for (i
= tsi_start (t
); !tsi_end_p (i
); tsi_next (&i
))
14661 RECUR (tsi_stmt (i
));
14665 case CTOR_INITIALIZER
:
14666 finish_mem_initializers (tsubst_initializer_list
14667 (TREE_OPERAND (t
, 0), args
));
14671 finish_return_stmt (RECUR (TREE_OPERAND (t
, 0)));
14675 tmp
= RECUR (EXPR_STMT_EXPR (t
));
14676 if (EXPR_STMT_STMT_EXPR_RESULT (t
))
14677 finish_stmt_expr_expr (tmp
, cur_stmt_expr
);
14679 finish_expr_stmt (tmp
);
14683 do_using_directive (USING_STMT_NAMESPACE (t
));
14688 tree decl
, pattern_decl
;
14691 pattern_decl
= decl
= DECL_EXPR_DECL (t
);
14692 if (TREE_CODE (decl
) == LABEL_DECL
)
14693 finish_label_decl (DECL_NAME (decl
));
14694 else if (TREE_CODE (decl
) == USING_DECL
)
14696 tree scope
= USING_DECL_SCOPE (decl
);
14697 tree name
= DECL_NAME (decl
);
14700 scope
= tsubst (scope
, args
, complain
, in_decl
);
14701 decl
= lookup_qualified_name (scope
, name
,
14702 /*is_type_p=*/false,
14703 /*complain=*/false);
14704 if (decl
== error_mark_node
|| TREE_CODE (decl
) == TREE_LIST
)
14705 qualified_name_lookup_error (scope
, name
, decl
, input_location
);
14707 do_local_using_decl (decl
, scope
, name
);
14709 else if (DECL_PACK_P (decl
))
14711 /* Don't build up decls for a variadic capture proxy, we'll
14712 instantiate the elements directly as needed. */
14717 init
= DECL_INITIAL (decl
);
14718 decl
= tsubst (decl
, args
, complain
, in_decl
);
14719 if (decl
!= error_mark_node
)
14721 /* By marking the declaration as instantiated, we avoid
14722 trying to instantiate it. Since instantiate_decl can't
14723 handle local variables, and since we've already done
14724 all that needs to be done, that's the right thing to
14727 DECL_TEMPLATE_INSTANTIATED (decl
) = 1;
14729 && ANON_AGGR_TYPE_P (TREE_TYPE (decl
)))
14730 /* Anonymous aggregates are a special case. */
14731 finish_anon_union (decl
);
14732 else if (is_capture_proxy (DECL_EXPR_DECL (t
)))
14734 DECL_CONTEXT (decl
) = current_function_decl
;
14735 if (DECL_NAME (decl
) == this_identifier
)
14737 tree lam
= DECL_CONTEXT (current_function_decl
);
14738 lam
= CLASSTYPE_LAMBDA_EXPR (lam
);
14739 LAMBDA_EXPR_THIS_CAPTURE (lam
) = decl
;
14741 insert_capture_proxy (decl
);
14743 else if (DECL_IMPLICIT_TYPEDEF_P (t
))
14744 /* We already did a pushtag. */;
14745 else if (TREE_CODE (decl
) == FUNCTION_DECL
14746 && DECL_OMP_DECLARE_REDUCTION_P (decl
)
14747 && DECL_FUNCTION_SCOPE_P (pattern_decl
))
14749 DECL_CONTEXT (decl
) = NULL_TREE
;
14751 DECL_CONTEXT (decl
) = current_function_decl
;
14752 cp_check_omp_declare_reduction (decl
);
14756 int const_init
= false;
14757 maybe_push_decl (decl
);
14759 && DECL_PRETTY_FUNCTION_P (decl
))
14761 /* For __PRETTY_FUNCTION__ we have to adjust the
14763 const char *const name
14764 = cxx_printable_name (current_function_decl
, 2);
14765 init
= cp_fname_init (name
, &TREE_TYPE (decl
));
14768 init
= tsubst_init (init
, decl
, args
, complain
, in_decl
);
14771 const_init
= (DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P
14773 cp_finish_decl (decl
, init
, const_init
, NULL_TREE
, 0);
14782 stmt
= begin_for_stmt (NULL_TREE
, NULL_TREE
);
14783 RECUR (FOR_INIT_STMT (t
));
14784 finish_for_init_stmt (stmt
);
14785 tmp
= RECUR (FOR_COND (t
));
14786 finish_for_cond (tmp
, stmt
, false);
14787 tmp
= RECUR (FOR_EXPR (t
));
14788 finish_for_expr (tmp
, stmt
);
14789 RECUR (FOR_BODY (t
));
14790 finish_for_stmt (stmt
);
14793 case RANGE_FOR_STMT
:
14796 stmt
= begin_for_stmt (NULL_TREE
, NULL_TREE
);
14797 decl
= RANGE_FOR_DECL (t
);
14798 decl
= tsubst (decl
, args
, complain
, in_decl
);
14799 maybe_push_decl (decl
);
14800 expr
= RECUR (RANGE_FOR_EXPR (t
));
14801 stmt
= cp_convert_range_for (stmt
, decl
, expr
, RANGE_FOR_IVDEP (t
));
14802 RECUR (RANGE_FOR_BODY (t
));
14803 finish_for_stmt (stmt
);
14808 stmt
= begin_while_stmt ();
14809 tmp
= RECUR (WHILE_COND (t
));
14810 finish_while_stmt_cond (tmp
, stmt
, false);
14811 RECUR (WHILE_BODY (t
));
14812 finish_while_stmt (stmt
);
14816 stmt
= begin_do_stmt ();
14817 RECUR (DO_BODY (t
));
14818 finish_do_body (stmt
);
14819 tmp
= RECUR (DO_COND (t
));
14820 finish_do_stmt (tmp
, stmt
, false);
14824 stmt
= begin_if_stmt ();
14825 tmp
= RECUR (IF_COND (t
));
14826 finish_if_stmt_cond (tmp
, stmt
);
14827 RECUR (THEN_CLAUSE (t
));
14828 finish_then_clause (stmt
);
14830 if (ELSE_CLAUSE (t
))
14832 begin_else_clause (stmt
);
14833 RECUR (ELSE_CLAUSE (t
));
14834 finish_else_clause (stmt
);
14837 finish_if_stmt (stmt
);
14841 if (BIND_EXPR_BODY_BLOCK (t
))
14842 stmt
= begin_function_body ();
14844 stmt
= begin_compound_stmt (BIND_EXPR_TRY_BLOCK (t
)
14845 ? BCS_TRY_BLOCK
: 0);
14847 RECUR (BIND_EXPR_BODY (t
));
14849 if (BIND_EXPR_BODY_BLOCK (t
))
14850 finish_function_body (stmt
);
14852 finish_compound_stmt (stmt
);
14856 finish_break_stmt ();
14859 case CONTINUE_STMT
:
14860 finish_continue_stmt ();
14864 stmt
= begin_switch_stmt ();
14865 tmp
= RECUR (SWITCH_STMT_COND (t
));
14866 finish_switch_cond (tmp
, stmt
);
14867 RECUR (SWITCH_STMT_BODY (t
));
14868 finish_switch_stmt (stmt
);
14871 case CASE_LABEL_EXPR
:
14873 tree low
= RECUR (CASE_LOW (t
));
14874 tree high
= RECUR (CASE_HIGH (t
));
14875 finish_case_label (EXPR_LOCATION (t
), low
, high
);
14881 tree decl
= LABEL_EXPR_LABEL (t
);
14884 label
= finish_label_stmt (DECL_NAME (decl
));
14885 if (DECL_ATTRIBUTES (decl
) != NULL_TREE
)
14886 cplus_decl_attributes (&label
, DECL_ATTRIBUTES (decl
), 0);
14891 tmp
= GOTO_DESTINATION (t
);
14892 if (TREE_CODE (tmp
) != LABEL_DECL
)
14893 /* Computed goto's must be tsubst'd into. On the other hand,
14894 non-computed gotos must not be; the identifier in question
14895 will have no binding. */
14898 tmp
= DECL_NAME (tmp
);
14899 finish_goto_stmt (tmp
);
14904 tree string
= RECUR (ASM_STRING (t
));
14905 tree outputs
= tsubst_copy_asm_operands (ASM_OUTPUTS (t
), args
,
14906 complain
, in_decl
);
14907 tree inputs
= tsubst_copy_asm_operands (ASM_INPUTS (t
), args
,
14908 complain
, in_decl
);
14909 tree clobbers
= tsubst_copy_asm_operands (ASM_CLOBBERS (t
), args
,
14910 complain
, in_decl
);
14911 tree labels
= tsubst_copy_asm_operands (ASM_LABELS (t
), args
,
14912 complain
, in_decl
);
14913 tmp
= finish_asm_stmt (ASM_VOLATILE_P (t
), string
, outputs
, inputs
,
14915 tree asm_expr
= tmp
;
14916 if (TREE_CODE (asm_expr
) == CLEANUP_POINT_EXPR
)
14917 asm_expr
= TREE_OPERAND (asm_expr
, 0);
14918 ASM_INPUT_P (asm_expr
) = ASM_INPUT_P (t
);
14925 stmt
= begin_try_block ();
14926 RECUR (TRY_STMTS (t
));
14927 finish_cleanup_try_block (stmt
);
14928 finish_cleanup (RECUR (TRY_HANDLERS (t
)), stmt
);
14932 tree compound_stmt
= NULL_TREE
;
14934 if (FN_TRY_BLOCK_P (t
))
14935 stmt
= begin_function_try_block (&compound_stmt
);
14937 stmt
= begin_try_block ();
14939 RECUR (TRY_STMTS (t
));
14941 if (FN_TRY_BLOCK_P (t
))
14942 finish_function_try_block (stmt
);
14944 finish_try_block (stmt
);
14946 RECUR (TRY_HANDLERS (t
));
14947 if (FN_TRY_BLOCK_P (t
))
14948 finish_function_handler_sequence (stmt
, compound_stmt
);
14950 finish_handler_sequence (stmt
);
14956 tree decl
= HANDLER_PARMS (t
);
14960 decl
= tsubst (decl
, args
, complain
, in_decl
);
14961 /* Prevent instantiate_decl from trying to instantiate
14962 this variable. We've already done all that needs to be
14964 if (decl
!= error_mark_node
)
14965 DECL_TEMPLATE_INSTANTIATED (decl
) = 1;
14967 stmt
= begin_handler ();
14968 finish_handler_parms (decl
, stmt
);
14969 RECUR (HANDLER_BODY (t
));
14970 finish_handler (stmt
);
14975 tmp
= tsubst (TREE_TYPE (t
), args
, complain
, NULL_TREE
);
14976 if (CLASS_TYPE_P (tmp
))
14978 /* Local classes are not independent templates; they are
14979 instantiated along with their containing function. And this
14980 way we don't have to deal with pushing out of one local class
14981 to instantiate a member of another local class. */
14983 /* Closures are handled by the LAMBDA_EXPR. */
14984 gcc_assert (!LAMBDA_TYPE_P (TREE_TYPE (t
)));
14985 complete_type (tmp
);
14986 for (fn
= TYPE_METHODS (tmp
); fn
; fn
= DECL_CHAIN (fn
))
14987 if (!DECL_ARTIFICIAL (fn
))
14988 instantiate_decl (fn
, /*defer_ok*/0, /*expl_inst_class*/false);
14992 case STATIC_ASSERT
:
14996 ++c_inhibit_evaluation_warnings
;
14998 tsubst_expr (STATIC_ASSERT_CONDITION (t
),
15001 /*integral_constant_expression_p=*/true);
15002 --c_inhibit_evaluation_warnings
;
15004 finish_static_assert (condition
,
15005 STATIC_ASSERT_MESSAGE (t
),
15006 STATIC_ASSERT_SOURCE_LOCATION (t
),
15007 /*member_p=*/false);
15012 tmp
= tsubst_omp_clauses (OMP_PARALLEL_CLAUSES (t
), false,
15013 args
, complain
, in_decl
);
15014 stmt
= begin_omp_parallel ();
15015 RECUR (OMP_PARALLEL_BODY (t
));
15016 OMP_PARALLEL_COMBINED (finish_omp_parallel (tmp
, stmt
))
15017 = OMP_PARALLEL_COMBINED (t
);
15021 tmp
= tsubst_omp_clauses (OMP_TASK_CLAUSES (t
), false,
15022 args
, complain
, in_decl
);
15023 stmt
= begin_omp_task ();
15024 RECUR (OMP_TASK_BODY (t
));
15025 finish_omp_task (tmp
, stmt
);
15032 case OMP_DISTRIBUTE
:
15034 tree clauses
, body
, pre_body
;
15035 tree declv
= NULL_TREE
, initv
= NULL_TREE
, condv
= NULL_TREE
;
15036 tree incrv
= NULL_TREE
;
15039 clauses
= tsubst_omp_clauses (OMP_FOR_CLAUSES (t
), false,
15040 args
, complain
, in_decl
);
15041 if (OMP_FOR_INIT (t
) != NULL_TREE
)
15043 declv
= make_tree_vec (TREE_VEC_LENGTH (OMP_FOR_INIT (t
)));
15044 initv
= make_tree_vec (TREE_VEC_LENGTH (OMP_FOR_INIT (t
)));
15045 condv
= make_tree_vec (TREE_VEC_LENGTH (OMP_FOR_INIT (t
)));
15046 incrv
= make_tree_vec (TREE_VEC_LENGTH (OMP_FOR_INIT (t
)));
15049 stmt
= begin_omp_structured_block ();
15051 pre_body
= push_stmt_list ();
15052 RECUR (OMP_FOR_PRE_BODY (t
));
15053 pre_body
= pop_stmt_list (pre_body
);
15055 if (OMP_FOR_INIT (t
) != NULL_TREE
)
15056 for (i
= 0; i
< TREE_VEC_LENGTH (OMP_FOR_INIT (t
)); i
++)
15057 tsubst_omp_for_iterator (t
, i
, declv
, initv
, condv
, incrv
,
15058 &clauses
, args
, complain
, in_decl
,
15059 integral_constant_expression_p
);
15061 body
= push_stmt_list ();
15062 RECUR (OMP_FOR_BODY (t
));
15063 body
= pop_stmt_list (body
);
15065 if (OMP_FOR_INIT (t
) != NULL_TREE
)
15066 t
= finish_omp_for (EXPR_LOCATION (t
), TREE_CODE (t
), declv
, initv
,
15067 condv
, incrv
, body
, pre_body
, clauses
);
15070 t
= make_node (TREE_CODE (t
));
15071 TREE_TYPE (t
) = void_type_node
;
15072 OMP_FOR_BODY (t
) = body
;
15073 OMP_FOR_PRE_BODY (t
) = pre_body
;
15074 OMP_FOR_CLAUSES (t
) = clauses
;
15075 SET_EXPR_LOCATION (t
, EXPR_LOCATION (t
));
15079 add_stmt (finish_omp_structured_block (stmt
));
15086 tmp
= tsubst_omp_clauses (OMP_CLAUSES (t
), false,
15087 args
, complain
, in_decl
);
15088 stmt
= push_stmt_list ();
15089 RECUR (OMP_BODY (t
));
15090 stmt
= pop_stmt_list (stmt
);
15093 OMP_BODY (t
) = stmt
;
15094 OMP_CLAUSES (t
) = tmp
;
15098 case OMP_TARGET_DATA
:
15100 tmp
= tsubst_omp_clauses (OMP_CLAUSES (t
), false,
15101 args
, complain
, in_decl
);
15102 keep_next_level (true);
15103 stmt
= begin_omp_structured_block ();
15105 RECUR (OMP_BODY (t
));
15106 stmt
= finish_omp_structured_block (stmt
);
15109 OMP_BODY (t
) = stmt
;
15110 OMP_CLAUSES (t
) = tmp
;
15114 case OMP_TARGET_UPDATE
:
15115 tmp
= tsubst_omp_clauses (OMP_TARGET_UPDATE_CLAUSES (t
), false,
15116 args
, complain
, in_decl
);
15118 OMP_TARGET_UPDATE_CLAUSES (t
) = tmp
;
15125 case OMP_TASKGROUP
:
15127 stmt
= push_stmt_list ();
15128 RECUR (OMP_BODY (t
));
15129 stmt
= pop_stmt_list (stmt
);
15132 OMP_BODY (t
) = stmt
;
15137 gcc_assert (OMP_ATOMIC_DEPENDENT_P (t
));
15138 if (TREE_CODE (TREE_OPERAND (t
, 1)) != MODIFY_EXPR
)
15140 tree op1
= TREE_OPERAND (t
, 1);
15141 tree rhs1
= NULL_TREE
;
15143 if (TREE_CODE (op1
) == COMPOUND_EXPR
)
15145 rhs1
= RECUR (TREE_OPERAND (op1
, 0));
15146 op1
= TREE_OPERAND (op1
, 1);
15148 lhs
= RECUR (TREE_OPERAND (op1
, 0));
15149 rhs
= RECUR (TREE_OPERAND (op1
, 1));
15150 finish_omp_atomic (OMP_ATOMIC
, TREE_CODE (op1
), lhs
, rhs
,
15151 NULL_TREE
, NULL_TREE
, rhs1
,
15152 OMP_ATOMIC_SEQ_CST (t
));
15156 tree op1
= TREE_OPERAND (t
, 1);
15157 tree v
= NULL_TREE
, lhs
, rhs
= NULL_TREE
, lhs1
= NULL_TREE
;
15158 tree rhs1
= NULL_TREE
;
15159 enum tree_code code
= TREE_CODE (TREE_OPERAND (op1
, 1));
15160 enum tree_code opcode
= NOP_EXPR
;
15161 if (code
== OMP_ATOMIC_READ
)
15163 v
= RECUR (TREE_OPERAND (op1
, 0));
15164 lhs
= RECUR (TREE_OPERAND (TREE_OPERAND (op1
, 1), 0));
15166 else if (code
== OMP_ATOMIC_CAPTURE_OLD
15167 || code
== OMP_ATOMIC_CAPTURE_NEW
)
15169 tree op11
= TREE_OPERAND (TREE_OPERAND (op1
, 1), 1);
15170 v
= RECUR (TREE_OPERAND (op1
, 0));
15171 lhs1
= RECUR (TREE_OPERAND (TREE_OPERAND (op1
, 1), 0));
15172 if (TREE_CODE (op11
) == COMPOUND_EXPR
)
15174 rhs1
= RECUR (TREE_OPERAND (op11
, 0));
15175 op11
= TREE_OPERAND (op11
, 1);
15177 lhs
= RECUR (TREE_OPERAND (op11
, 0));
15178 rhs
= RECUR (TREE_OPERAND (op11
, 1));
15179 opcode
= TREE_CODE (op11
);
15180 if (opcode
== MODIFY_EXPR
)
15186 lhs
= RECUR (TREE_OPERAND (op1
, 0));
15187 rhs
= RECUR (TREE_OPERAND (op1
, 1));
15189 finish_omp_atomic (code
, opcode
, lhs
, rhs
, v
, lhs1
, rhs1
,
15190 OMP_ATOMIC_SEQ_CST (t
));
15194 case TRANSACTION_EXPR
:
15197 flags
|= (TRANSACTION_EXPR_OUTER (t
) ? TM_STMT_ATTR_OUTER
: 0);
15198 flags
|= (TRANSACTION_EXPR_RELAXED (t
) ? TM_STMT_ATTR_RELAXED
: 0);
15200 if (TRANSACTION_EXPR_IS_STMT (t
))
15202 tree body
= TRANSACTION_EXPR_BODY (t
);
15203 tree noex
= NULL_TREE
;
15204 if (TREE_CODE (body
) == MUST_NOT_THROW_EXPR
)
15206 noex
= MUST_NOT_THROW_COND (body
);
15207 if (noex
== NULL_TREE
)
15208 noex
= boolean_true_node
;
15209 body
= TREE_OPERAND (body
, 0);
15211 stmt
= begin_transaction_stmt (input_location
, NULL
, flags
);
15213 finish_transaction_stmt (stmt
, NULL
, flags
, RECUR (noex
));
15217 stmt
= build_transaction_expr (EXPR_LOCATION (t
),
15218 RECUR (TRANSACTION_EXPR_BODY (t
)),
15225 case MUST_NOT_THROW_EXPR
:
15227 tree op0
= RECUR (TREE_OPERAND (t
, 0));
15228 tree cond
= RECUR (MUST_NOT_THROW_COND (t
));
15229 RETURN (build_must_not_throw_expr (op0
, cond
));
15232 case EXPR_PACK_EXPANSION
:
15233 error ("invalid use of pack expansion expression");
15234 RETURN (error_mark_node
);
15236 case NONTYPE_ARGUMENT_PACK
:
15237 error ("use %<...%> to expand argument pack");
15238 RETURN (error_mark_node
);
15240 case CILK_SPAWN_STMT
:
15241 cfun
->calls_cilk_spawn
= 1;
15242 RETURN (build_cilk_spawn (EXPR_LOCATION (t
), RECUR (CILK_SPAWN_FN (t
))));
15244 case CILK_SYNC_STMT
:
15245 RETURN (build_cilk_sync ());
15247 case COMPOUND_EXPR
:
15248 tmp
= RECUR (TREE_OPERAND (t
, 0));
15249 if (tmp
== NULL_TREE
)
15250 /* If the first operand was a statement, we're done with it. */
15251 RETURN (RECUR (TREE_OPERAND (t
, 1)));
15252 RETURN (build_x_compound_expr (EXPR_LOCATION (t
), tmp
,
15253 RECUR (TREE_OPERAND (t
, 1)),
15256 case ANNOTATE_EXPR
:
15257 tmp
= RECUR (TREE_OPERAND (t
, 0));
15258 RETURN (build2_loc (EXPR_LOCATION (t
), ANNOTATE_EXPR
,
15259 TREE_TYPE (tmp
), tmp
, RECUR (TREE_OPERAND (t
, 1))));
15262 gcc_assert (!STATEMENT_CODE_P (TREE_CODE (t
)));
15264 RETURN (tsubst_copy_and_build (t
, args
, complain
, in_decl
,
15265 /*function_p=*/false,
15266 integral_constant_expression_p
));
15269 RETURN (NULL_TREE
);
15271 input_location
= loc
;
15277 /* Instantiate the special body of the artificial DECL_OMP_DECLARE_REDUCTION
15278 function. For description of the body see comment above
15279 cp_parser_omp_declare_reduction_exprs. */
15282 tsubst_omp_udr (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
15284 if (t
== NULL_TREE
|| t
== error_mark_node
)
15287 gcc_assert (TREE_CODE (t
) == STATEMENT_LIST
);
15289 tree_stmt_iterator tsi
;
15292 memset (stmts
, 0, sizeof stmts
);
15293 for (i
= 0, tsi
= tsi_start (t
);
15294 i
< 7 && !tsi_end_p (tsi
);
15295 i
++, tsi_next (&tsi
))
15296 stmts
[i
] = tsi_stmt (tsi
);
15297 gcc_assert (tsi_end_p (tsi
));
15301 gcc_assert (TREE_CODE (stmts
[0]) == DECL_EXPR
15302 && TREE_CODE (stmts
[1]) == DECL_EXPR
);
15303 tree omp_out
= tsubst (DECL_EXPR_DECL (stmts
[0]),
15304 args
, complain
, in_decl
);
15305 tree omp_in
= tsubst (DECL_EXPR_DECL (stmts
[1]),
15306 args
, complain
, in_decl
);
15307 DECL_CONTEXT (omp_out
) = current_function_decl
;
15308 DECL_CONTEXT (omp_in
) = current_function_decl
;
15309 keep_next_level (true);
15310 tree block
= begin_omp_structured_block ();
15311 tsubst_expr (stmts
[2], args
, complain
, in_decl
, false);
15312 block
= finish_omp_structured_block (block
);
15313 block
= maybe_cleanup_point_expr_void (block
);
15314 add_decl_expr (omp_out
);
15315 if (TREE_NO_WARNING (DECL_EXPR_DECL (stmts
[0])))
15316 TREE_NO_WARNING (omp_out
) = 1;
15317 add_decl_expr (omp_in
);
15318 finish_expr_stmt (block
);
15322 gcc_assert (TREE_CODE (stmts
[3]) == DECL_EXPR
15323 && TREE_CODE (stmts
[4]) == DECL_EXPR
);
15324 tree omp_priv
= tsubst (DECL_EXPR_DECL (stmts
[3]),
15325 args
, complain
, in_decl
);
15326 tree omp_orig
= tsubst (DECL_EXPR_DECL (stmts
[4]),
15327 args
, complain
, in_decl
);
15328 DECL_CONTEXT (omp_priv
) = current_function_decl
;
15329 DECL_CONTEXT (omp_orig
) = current_function_decl
;
15330 keep_next_level (true);
15331 tree block
= begin_omp_structured_block ();
15332 tsubst_expr (stmts
[5], args
, complain
, in_decl
, false);
15333 block
= finish_omp_structured_block (block
);
15334 block
= maybe_cleanup_point_expr_void (block
);
15335 cp_walk_tree (&block
, cp_remove_omp_priv_cleanup_stmt
, omp_priv
, NULL
);
15336 add_decl_expr (omp_priv
);
15337 add_decl_expr (omp_orig
);
15338 finish_expr_stmt (block
);
15340 add_decl_expr (omp_orig
);
15344 /* T is a postfix-expression that is not being used in a function
15345 call. Return the substituted version of T. */
15348 tsubst_non_call_postfix_expression (tree t
, tree args
,
15349 tsubst_flags_t complain
,
15352 if (TREE_CODE (t
) == SCOPE_REF
)
15353 t
= tsubst_qualified_id (t
, args
, complain
, in_decl
,
15354 /*done=*/false, /*address_p=*/false);
15356 t
= tsubst_copy_and_build (t
, args
, complain
, in_decl
,
15357 /*function_p=*/false,
15358 /*integral_constant_expression_p=*/false);
15363 /* Like tsubst but deals with expressions and performs semantic
15364 analysis. FUNCTION_P is true if T is the "F" in "F (ARGS)". */
15367 tsubst_copy_and_build (tree t
,
15369 tsubst_flags_t complain
,
15372 bool integral_constant_expression_p
)
15374 #define RETURN(EXP) do { retval = (EXP); goto out; } while(0)
15375 #define RECUR(NODE) \
15376 tsubst_copy_and_build (NODE, args, complain, in_decl, \
15377 /*function_p=*/false, \
15378 integral_constant_expression_p)
15383 if (t
== NULL_TREE
|| t
== error_mark_node
)
15386 loc
= input_location
;
15387 if (EXPR_HAS_LOCATION (t
))
15388 input_location
= EXPR_LOCATION (t
);
15390 /* N3276 decltype magic only applies to calls at the top level or on the
15391 right side of a comma. */
15392 tsubst_flags_t decltype_flag
= (complain
& tf_decltype
);
15393 complain
&= ~tf_decltype
;
15395 switch (TREE_CODE (t
))
15399 /* Fall through. */
15400 case IDENTIFIER_NODE
:
15404 bool non_integral_constant_expression_p
;
15405 const char *error_msg
;
15407 if (IDENTIFIER_TYPENAME_P (t
))
15409 tree new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
15410 t
= mangle_conv_op_name_for_type (new_type
);
15413 /* Look up the name. */
15414 decl
= lookup_name (t
);
15416 /* By convention, expressions use ERROR_MARK_NODE to indicate
15417 failure, not NULL_TREE. */
15418 if (decl
== NULL_TREE
)
15419 decl
= error_mark_node
;
15421 decl
= finish_id_expression (t
, decl
, NULL_TREE
,
15423 integral_constant_expression_p
,
15424 /*allow_non_integral_constant_expression_p=*/(cxx_dialect
>= cxx11
),
15425 &non_integral_constant_expression_p
,
15426 /*template_p=*/false,
15428 /*address_p=*/false,
15429 /*template_arg_p=*/false,
15434 if (!function_p
&& identifier_p (decl
))
15436 if (complain
& tf_error
)
15437 unqualified_name_lookup_error (decl
);
15438 decl
= error_mark_node
;
15443 case TEMPLATE_ID_EXPR
:
15446 tree templ
= RECUR (TREE_OPERAND (t
, 0));
15447 tree targs
= TREE_OPERAND (t
, 1);
15450 targs
= tsubst_template_args (targs
, args
, complain
, in_decl
);
15451 if (targs
== error_mark_node
)
15452 return error_mark_node
;
15454 if (variable_template_p (templ
))
15456 templ
= lookup_template_variable (templ
, targs
);
15457 if (!any_dependent_template_arguments_p (targs
))
15459 templ
= finish_template_variable (templ
, complain
);
15462 RETURN (convert_from_reference (templ
));
15465 if (TREE_CODE (templ
) == COMPONENT_REF
)
15467 object
= TREE_OPERAND (templ
, 0);
15468 templ
= TREE_OPERAND (templ
, 1);
15471 object
= NULL_TREE
;
15472 templ
= lookup_template_function (templ
, targs
);
15475 RETURN (build3 (COMPONENT_REF
, TREE_TYPE (templ
),
15476 object
, templ
, NULL_TREE
));
15478 RETURN (baselink_for_fns (templ
));
15483 tree r
= RECUR (TREE_OPERAND (t
, 0));
15485 if (REFERENCE_REF_P (t
))
15487 /* A type conversion to reference type will be enclosed in
15488 such an indirect ref, but the substitution of the cast
15489 will have also added such an indirect ref. */
15490 if (TREE_CODE (TREE_TYPE (r
)) == REFERENCE_TYPE
)
15491 r
= convert_from_reference (r
);
15494 r
= build_x_indirect_ref (input_location
, r
, RO_UNARY_STAR
,
15495 complain
|decltype_flag
);
15501 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
15502 tree op0
= RECUR (TREE_OPERAND (t
, 0));
15503 RETURN (build_nop (type
, op0
));
15506 case IMPLICIT_CONV_EXPR
:
15508 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
15509 tree expr
= RECUR (TREE_OPERAND (t
, 0));
15510 int flags
= LOOKUP_IMPLICIT
;
15511 if (IMPLICIT_CONV_EXPR_DIRECT_INIT (t
))
15512 flags
= LOOKUP_NORMAL
;
15513 RETURN (perform_implicit_conversion_flags (type
, expr
, complain
,
15519 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
15520 tree op0
= RECUR (TREE_OPERAND (t
, 0));
15521 RETURN (build1 (CONVERT_EXPR
, type
, op0
));
15525 case REINTERPRET_CAST_EXPR
:
15526 case CONST_CAST_EXPR
:
15527 case DYNAMIC_CAST_EXPR
:
15528 case STATIC_CAST_EXPR
:
15531 tree op
, r
= NULL_TREE
;
15533 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
15534 if (integral_constant_expression_p
15535 && !cast_valid_in_integral_constant_expression_p (type
))
15537 if (complain
& tf_error
)
15538 error ("a cast to a type other than an integral or "
15539 "enumeration type cannot appear in a constant-expression");
15540 RETURN (error_mark_node
);
15543 op
= RECUR (TREE_OPERAND (t
, 0));
15545 warning_sentinel
s(warn_useless_cast
);
15546 switch (TREE_CODE (t
))
15549 r
= build_functional_cast (type
, op
, complain
);
15551 case REINTERPRET_CAST_EXPR
:
15552 r
= build_reinterpret_cast (type
, op
, complain
);
15554 case CONST_CAST_EXPR
:
15555 r
= build_const_cast (type
, op
, complain
);
15557 case DYNAMIC_CAST_EXPR
:
15558 r
= build_dynamic_cast (type
, op
, complain
);
15560 case STATIC_CAST_EXPR
:
15561 r
= build_static_cast (type
, op
, complain
);
15564 gcc_unreachable ();
15570 case POSTDECREMENT_EXPR
:
15571 case POSTINCREMENT_EXPR
:
15572 op1
= tsubst_non_call_postfix_expression (TREE_OPERAND (t
, 0),
15573 args
, complain
, in_decl
);
15574 RETURN (build_x_unary_op (input_location
, TREE_CODE (t
), op1
,
15575 complain
|decltype_flag
));
15577 case PREDECREMENT_EXPR
:
15578 case PREINCREMENT_EXPR
:
15582 case TRUTH_NOT_EXPR
:
15583 case UNARY_PLUS_EXPR
: /* Unary + */
15584 case REALPART_EXPR
:
15585 case IMAGPART_EXPR
:
15586 RETURN (build_x_unary_op (input_location
, TREE_CODE (t
),
15587 RECUR (TREE_OPERAND (t
, 0)),
15588 complain
|decltype_flag
));
15590 case FIX_TRUNC_EXPR
:
15591 RETURN (cp_build_unary_op (FIX_TRUNC_EXPR
, RECUR (TREE_OPERAND (t
, 0)),
15595 op1
= TREE_OPERAND (t
, 0);
15596 if (TREE_CODE (op1
) == LABEL_DECL
)
15597 RETURN (finish_label_address_expr (DECL_NAME (op1
),
15598 EXPR_LOCATION (op1
)));
15599 if (TREE_CODE (op1
) == SCOPE_REF
)
15600 op1
= tsubst_qualified_id (op1
, args
, complain
, in_decl
,
15601 /*done=*/true, /*address_p=*/true);
15603 op1
= tsubst_non_call_postfix_expression (op1
, args
, complain
,
15605 RETURN (build_x_unary_op (input_location
, ADDR_EXPR
, op1
,
15606 complain
|decltype_flag
));
15611 case TRUNC_DIV_EXPR
:
15612 case CEIL_DIV_EXPR
:
15613 case FLOOR_DIV_EXPR
:
15614 case ROUND_DIV_EXPR
:
15615 case EXACT_DIV_EXPR
:
15619 case TRUNC_MOD_EXPR
:
15620 case FLOOR_MOD_EXPR
:
15621 case TRUTH_ANDIF_EXPR
:
15622 case TRUTH_ORIF_EXPR
:
15623 case TRUTH_AND_EXPR
:
15624 case TRUTH_OR_EXPR
:
15640 warning_sentinel
s1(warn_type_limits
);
15641 warning_sentinel
s2(warn_div_by_zero
);
15642 warning_sentinel
s3(warn_logical_op
);
15643 warning_sentinel
s4(warn_tautological_compare
);
15644 tree op0
= RECUR (TREE_OPERAND (t
, 0));
15645 tree op1
= RECUR (TREE_OPERAND (t
, 1));
15646 tree r
= build_x_binary_op
15647 (input_location
, TREE_CODE (t
),
15649 (TREE_NO_WARNING (TREE_OPERAND (t
, 0))
15651 : TREE_CODE (TREE_OPERAND (t
, 0))),
15653 (TREE_NO_WARNING (TREE_OPERAND (t
, 1))
15655 : TREE_CODE (TREE_OPERAND (t
, 1))),
15657 complain
|decltype_flag
);
15658 if (EXPR_P (r
) && TREE_NO_WARNING (t
))
15659 TREE_NO_WARNING (r
) = TREE_NO_WARNING (t
);
15664 case POINTER_PLUS_EXPR
:
15666 tree op0
= RECUR (TREE_OPERAND (t
, 0));
15667 tree op1
= RECUR (TREE_OPERAND (t
, 1));
15668 return fold_build_pointer_plus (op0
, op1
);
15672 RETURN (tsubst_qualified_id (t
, args
, complain
, in_decl
, /*done=*/true,
15673 /*address_p=*/false));
15675 op1
= tsubst_non_call_postfix_expression (TREE_OPERAND (t
, 0),
15676 args
, complain
, in_decl
);
15677 RETURN (build_x_array_ref (EXPR_LOCATION (t
), op1
,
15678 RECUR (TREE_OPERAND (t
, 1)),
15679 complain
|decltype_flag
));
15681 case ARRAY_NOTATION_REF
:
15683 tree start_index
, length
, stride
;
15684 op1
= tsubst_non_call_postfix_expression (ARRAY_NOTATION_ARRAY (t
),
15685 args
, complain
, in_decl
);
15686 start_index
= RECUR (ARRAY_NOTATION_START (t
));
15687 length
= RECUR (ARRAY_NOTATION_LENGTH (t
));
15688 stride
= RECUR (ARRAY_NOTATION_STRIDE (t
));
15689 RETURN (build_array_notation_ref (EXPR_LOCATION (t
), op1
, start_index
,
15690 length
, stride
, TREE_TYPE (op1
)));
15693 if (PACK_EXPANSION_P (TREE_OPERAND (t
, 0)))
15694 RETURN (tsubst_copy (t
, args
, complain
, in_decl
));
15701 op1
= TREE_OPERAND (t
, 0);
15702 if (TREE_CODE (t
) == SIZEOF_EXPR
&& SIZEOF_EXPR_TYPE_P (t
))
15703 op1
= TREE_TYPE (op1
);
15706 /* When there are no ARGS, we are trying to evaluate a
15707 non-dependent expression from the parser. Trying to do
15708 the substitutions may not work. */
15710 op1
= TREE_TYPE (op1
);
15714 ++cp_unevaluated_operand
;
15715 ++c_inhibit_evaluation_warnings
;
15717 op1
= tsubst (op1
, args
, complain
, in_decl
);
15719 op1
= tsubst_copy_and_build (op1
, args
, complain
, in_decl
,
15720 /*function_p=*/false,
15721 /*integral_constant_expression_p=*/
15723 --cp_unevaluated_operand
;
15724 --c_inhibit_evaluation_warnings
;
15727 r
= cxx_sizeof_or_alignof_type (op1
, TREE_CODE (t
),
15728 complain
& tf_error
);
15730 r
= cxx_sizeof_or_alignof_expr (op1
, TREE_CODE (t
),
15731 complain
& tf_error
);
15732 if (TREE_CODE (t
) == SIZEOF_EXPR
&& r
!= error_mark_node
)
15734 if (TREE_CODE (r
) != SIZEOF_EXPR
|| TYPE_P (op1
))
15736 if (!processing_template_decl
&& TYPE_P (op1
))
15738 r
= build_min (SIZEOF_EXPR
, size_type_node
,
15739 build1 (NOP_EXPR
, op1
, error_mark_node
));
15740 SIZEOF_EXPR_TYPE_P (r
) = 1;
15743 r
= build_min (SIZEOF_EXPR
, size_type_node
, op1
);
15744 TREE_SIDE_EFFECTS (r
) = 0;
15745 TREE_READONLY (r
) = 1;
15747 SET_EXPR_LOCATION (r
, EXPR_LOCATION (t
));
15752 case AT_ENCODE_EXPR
:
15754 op1
= TREE_OPERAND (t
, 0);
15755 ++cp_unevaluated_operand
;
15756 ++c_inhibit_evaluation_warnings
;
15757 op1
= tsubst_copy_and_build (op1
, args
, complain
, in_decl
,
15758 /*function_p=*/false,
15759 /*integral_constant_expression_p=*/false);
15760 --cp_unevaluated_operand
;
15761 --c_inhibit_evaluation_warnings
;
15762 RETURN (objc_build_encode_expr (op1
));
15765 case NOEXCEPT_EXPR
:
15766 op1
= TREE_OPERAND (t
, 0);
15767 ++cp_unevaluated_operand
;
15768 ++c_inhibit_evaluation_warnings
;
15769 ++cp_noexcept_operand
;
15770 op1
= tsubst_copy_and_build (op1
, args
, complain
, in_decl
,
15771 /*function_p=*/false,
15772 /*integral_constant_expression_p=*/false);
15773 --cp_unevaluated_operand
;
15774 --c_inhibit_evaluation_warnings
;
15775 --cp_noexcept_operand
;
15776 RETURN (finish_noexcept_expr (op1
, complain
));
15780 warning_sentinel
s(warn_div_by_zero
);
15781 tree lhs
= RECUR (TREE_OPERAND (t
, 0));
15782 tree rhs
= RECUR (TREE_OPERAND (t
, 2));
15783 tree r
= build_x_modify_expr
15784 (EXPR_LOCATION (t
), lhs
, TREE_CODE (TREE_OPERAND (t
, 1)), rhs
,
15785 complain
|decltype_flag
);
15786 /* TREE_NO_WARNING must be set if either the expression was
15787 parenthesized or it uses an operator such as >>= rather
15788 than plain assignment. In the former case, it was already
15789 set and must be copied. In the latter case,
15790 build_x_modify_expr sets it and it must not be reset
15792 if (TREE_NO_WARNING (t
))
15793 TREE_NO_WARNING (r
) = TREE_NO_WARNING (t
);
15799 op1
= tsubst_non_call_postfix_expression (TREE_OPERAND (t
, 0),
15800 args
, complain
, in_decl
);
15801 /* Remember that there was a reference to this entity. */
15803 && !mark_used (op1
, complain
) && !(complain
& tf_error
))
15804 RETURN (error_mark_node
);
15805 RETURN (build_x_arrow (input_location
, op1
, complain
));
15809 tree placement
= RECUR (TREE_OPERAND (t
, 0));
15810 tree init
= RECUR (TREE_OPERAND (t
, 3));
15811 vec
<tree
, va_gc
> *placement_vec
;
15812 vec
<tree
, va_gc
> *init_vec
;
15815 if (placement
== NULL_TREE
)
15816 placement_vec
= NULL
;
15819 placement_vec
= make_tree_vector ();
15820 for (; placement
!= NULL_TREE
; placement
= TREE_CHAIN (placement
))
15821 vec_safe_push (placement_vec
, TREE_VALUE (placement
));
15824 /* If there was an initializer in the original tree, but it
15825 instantiated to an empty list, then we should pass a
15826 non-NULL empty vector to tell build_new that it was an
15827 empty initializer() rather than no initializer. This can
15828 only happen when the initializer is a pack expansion whose
15829 parameter packs are of length zero. */
15830 if (init
== NULL_TREE
&& TREE_OPERAND (t
, 3) == NULL_TREE
)
15834 init_vec
= make_tree_vector ();
15835 if (init
== void_node
)
15836 gcc_assert (init_vec
!= NULL
);
15839 for (; init
!= NULL_TREE
; init
= TREE_CHAIN (init
))
15840 vec_safe_push (init_vec
, TREE_VALUE (init
));
15844 tree op1
= tsubst (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
15845 tree op2
= RECUR (TREE_OPERAND (t
, 2));
15846 ret
= build_new (&placement_vec
, op1
, op2
, &init_vec
,
15847 NEW_EXPR_USE_GLOBAL (t
),
15850 if (placement_vec
!= NULL
)
15851 release_tree_vector (placement_vec
);
15852 if (init_vec
!= NULL
)
15853 release_tree_vector (init_vec
);
15860 tree op0
= RECUR (TREE_OPERAND (t
, 0));
15861 tree op1
= RECUR (TREE_OPERAND (t
, 1));
15862 RETURN (delete_sanity (op0
, op1
,
15863 DELETE_EXPR_USE_VEC (t
),
15864 DELETE_EXPR_USE_GLOBAL (t
),
15868 case COMPOUND_EXPR
:
15870 tree op0
= tsubst_copy_and_build (TREE_OPERAND (t
, 0), args
,
15871 complain
& ~tf_decltype
, in_decl
,
15872 /*function_p=*/false,
15873 integral_constant_expression_p
);
15874 RETURN (build_x_compound_expr (EXPR_LOCATION (t
),
15876 RECUR (TREE_OPERAND (t
, 1)),
15877 complain
|decltype_flag
));
15883 vec
<tree
, va_gc
> *call_args
;
15884 unsigned int nargs
, i
;
15889 function
= CALL_EXPR_FN (t
);
15890 /* When we parsed the expression, we determined whether or
15891 not Koenig lookup should be performed. */
15892 koenig_p
= KOENIG_LOOKUP_P (t
);
15893 if (TREE_CODE (function
) == SCOPE_REF
)
15895 qualified_p
= true;
15896 function
= tsubst_qualified_id (function
, args
, complain
, in_decl
,
15898 /*address_p=*/false);
15900 else if (koenig_p
&& identifier_p (function
))
15902 /* Do nothing; calling tsubst_copy_and_build on an identifier
15903 would incorrectly perform unqualified lookup again.
15905 Note that we can also have an IDENTIFIER_NODE if the earlier
15906 unqualified lookup found a member function; in that case
15907 koenig_p will be false and we do want to do the lookup
15908 again to find the instantiated member function.
15910 FIXME but doing that causes c++/15272, so we need to stop
15911 using IDENTIFIER_NODE in that situation. */
15912 qualified_p
= false;
15916 if (TREE_CODE (function
) == COMPONENT_REF
)
15918 tree op
= TREE_OPERAND (function
, 1);
15920 qualified_p
= (TREE_CODE (op
) == SCOPE_REF
15921 || (BASELINK_P (op
)
15922 && BASELINK_QUALIFIED_P (op
)));
15925 qualified_p
= false;
15927 if (TREE_CODE (function
) == ADDR_EXPR
15928 && TREE_CODE (TREE_OPERAND (function
, 0)) == FUNCTION_DECL
)
15929 /* Avoid error about taking the address of a constructor. */
15930 function
= TREE_OPERAND (function
, 0);
15932 function
= tsubst_copy_and_build (function
, args
, complain
,
15935 integral_constant_expression_p
);
15937 if (BASELINK_P (function
))
15938 qualified_p
= true;
15941 nargs
= call_expr_nargs (t
);
15942 call_args
= make_tree_vector ();
15943 for (i
= 0; i
< nargs
; ++i
)
15945 tree arg
= CALL_EXPR_ARG (t
, i
);
15947 if (!PACK_EXPANSION_P (arg
))
15948 vec_safe_push (call_args
, RECUR (CALL_EXPR_ARG (t
, i
)));
15951 /* Expand the pack expansion and push each entry onto
15953 arg
= tsubst_pack_expansion (arg
, args
, complain
, in_decl
);
15954 if (TREE_CODE (arg
) == TREE_VEC
)
15956 unsigned int len
, j
;
15958 len
= TREE_VEC_LENGTH (arg
);
15959 for (j
= 0; j
< len
; ++j
)
15961 tree value
= TREE_VEC_ELT (arg
, j
);
15962 if (value
!= NULL_TREE
)
15963 value
= convert_from_reference (value
);
15964 vec_safe_push (call_args
, value
);
15969 /* A partial substitution. Add one entry. */
15970 vec_safe_push (call_args
, arg
);
15975 /* We do not perform argument-dependent lookup if normal
15976 lookup finds a non-function, in accordance with the
15977 expected resolution of DR 218. */
15979 && ((is_overloaded_fn (function
)
15980 /* If lookup found a member function, the Koenig lookup is
15981 not appropriate, even if an unqualified-name was used
15982 to denote the function. */
15983 && !DECL_FUNCTION_MEMBER_P (get_first_fn (function
)))
15984 || identifier_p (function
))
15985 /* Only do this when substitution turns a dependent call
15986 into a non-dependent call. */
15987 && type_dependent_expression_p_push (t
)
15988 && !any_type_dependent_arguments_p (call_args
))
15989 function
= perform_koenig_lookup (function
, call_args
, tf_none
);
15991 if (identifier_p (function
)
15992 && !any_type_dependent_arguments_p (call_args
))
15994 if (koenig_p
&& (complain
& tf_warning_or_error
))
15996 /* For backwards compatibility and good diagnostics, try
15997 the unqualified lookup again if we aren't in SFINAE
15999 tree unq
= (tsubst_copy_and_build
16000 (function
, args
, complain
, in_decl
, true,
16001 integral_constant_expression_p
));
16002 if (unq
== error_mark_node
)
16003 RETURN (error_mark_node
);
16005 if (unq
!= function
)
16008 if (INDIRECT_REF_P (fn
))
16009 fn
= TREE_OPERAND (fn
, 0);
16010 if (TREE_CODE (fn
) == COMPONENT_REF
)
16011 fn
= TREE_OPERAND (fn
, 1);
16012 if (is_overloaded_fn (fn
))
16013 fn
= get_first_fn (fn
);
16014 if (permerror (EXPR_LOC_OR_LOC (t
, input_location
),
16015 "%qD was not declared in this scope, "
16016 "and no declarations were found by "
16017 "argument-dependent lookup at the point "
16018 "of instantiation", function
))
16021 /* Can't say anything more. */;
16022 else if (DECL_CLASS_SCOPE_P (fn
))
16024 location_t loc
= EXPR_LOC_OR_LOC (t
,
16027 "declarations in dependent base %qT are "
16028 "not found by unqualified lookup",
16029 DECL_CLASS_CONTEXT (fn
));
16030 if (current_class_ptr
)
16032 "use %<this->%D%> instead", function
);
16035 "use %<%T::%D%> instead",
16036 current_class_name
, function
);
16039 inform (DECL_SOURCE_LOCATION (fn
),
16040 "%qD declared here, later in the "
16041 "translation unit", fn
);
16046 if (identifier_p (function
))
16048 if (complain
& tf_error
)
16049 unqualified_name_lookup_error (function
);
16050 release_tree_vector (call_args
);
16051 RETURN (error_mark_node
);
16055 /* Remember that there was a reference to this entity. */
16056 if (DECL_P (function
)
16057 && !mark_used (function
, complain
) && !(complain
& tf_error
))
16058 RETURN (error_mark_node
);
16060 /* Put back tf_decltype for the actual call. */
16061 complain
|= decltype_flag
;
16063 if (TREE_CODE (function
) == OFFSET_REF
)
16064 ret
= build_offset_ref_call_from_tree (function
, &call_args
,
16066 else if (TREE_CODE (function
) == COMPONENT_REF
)
16068 tree instance
= TREE_OPERAND (function
, 0);
16069 tree fn
= TREE_OPERAND (function
, 1);
16071 if (processing_template_decl
16072 && (type_dependent_expression_p (instance
)
16073 || (!BASELINK_P (fn
)
16074 && TREE_CODE (fn
) != FIELD_DECL
)
16075 || type_dependent_expression_p (fn
)
16076 || any_type_dependent_arguments_p (call_args
)))
16077 ret
= build_nt_call_vec (function
, call_args
);
16078 else if (!BASELINK_P (fn
))
16079 ret
= finish_call_expr (function
, &call_args
,
16080 /*disallow_virtual=*/false,
16081 /*koenig_p=*/false,
16084 ret
= (build_new_method_call
16086 &call_args
, NULL_TREE
,
16087 qualified_p
? LOOKUP_NONVIRTUAL
: LOOKUP_NORMAL
,
16092 ret
= finish_call_expr (function
, &call_args
,
16093 /*disallow_virtual=*/qualified_p
,
16097 release_tree_vector (call_args
);
16104 tree cond
= RECUR (TREE_OPERAND (t
, 0));
16105 tree folded_cond
= fold_non_dependent_expr (cond
);
16108 if (TREE_CODE (folded_cond
) == INTEGER_CST
)
16110 if (integer_zerop (folded_cond
))
16112 ++c_inhibit_evaluation_warnings
;
16113 exp1
= RECUR (TREE_OPERAND (t
, 1));
16114 --c_inhibit_evaluation_warnings
;
16115 exp2
= RECUR (TREE_OPERAND (t
, 2));
16119 exp1
= RECUR (TREE_OPERAND (t
, 1));
16120 ++c_inhibit_evaluation_warnings
;
16121 exp2
= RECUR (TREE_OPERAND (t
, 2));
16122 --c_inhibit_evaluation_warnings
;
16124 cond
= folded_cond
;
16128 exp1
= RECUR (TREE_OPERAND (t
, 1));
16129 exp2
= RECUR (TREE_OPERAND (t
, 2));
16132 RETURN (build_x_conditional_expr (EXPR_LOCATION (t
),
16133 cond
, exp1
, exp2
, complain
));
16136 case PSEUDO_DTOR_EXPR
:
16138 tree op0
= RECUR (TREE_OPERAND (t
, 0));
16139 tree op1
= RECUR (TREE_OPERAND (t
, 1));
16140 tree op2
= tsubst (TREE_OPERAND (t
, 2), args
, complain
, in_decl
);
16141 RETURN (finish_pseudo_destructor_expr (op0
, op1
, op2
,
16147 tree purpose
, value
, chain
;
16149 if (t
== void_list_node
)
16152 if ((TREE_PURPOSE (t
) && PACK_EXPANSION_P (TREE_PURPOSE (t
)))
16153 || (TREE_VALUE (t
) && PACK_EXPANSION_P (TREE_VALUE (t
))))
16155 /* We have pack expansions, so expand those and
16156 create a new list out of it. */
16157 tree purposevec
= NULL_TREE
;
16158 tree valuevec
= NULL_TREE
;
16162 /* Expand the argument expressions. */
16163 if (TREE_PURPOSE (t
))
16164 purposevec
= tsubst_pack_expansion (TREE_PURPOSE (t
), args
,
16165 complain
, in_decl
);
16166 if (TREE_VALUE (t
))
16167 valuevec
= tsubst_pack_expansion (TREE_VALUE (t
), args
,
16168 complain
, in_decl
);
16170 /* Build the rest of the list. */
16171 chain
= TREE_CHAIN (t
);
16172 if (chain
&& chain
!= void_type_node
)
16173 chain
= RECUR (chain
);
16175 /* Determine the number of arguments. */
16176 if (purposevec
&& TREE_CODE (purposevec
) == TREE_VEC
)
16178 len
= TREE_VEC_LENGTH (purposevec
);
16179 gcc_assert (!valuevec
|| len
== TREE_VEC_LENGTH (valuevec
));
16181 else if (TREE_CODE (valuevec
) == TREE_VEC
)
16182 len
= TREE_VEC_LENGTH (valuevec
);
16185 /* Since we only performed a partial substitution into
16186 the argument pack, we only RETURN (a single list
16188 if (purposevec
== TREE_PURPOSE (t
)
16189 && valuevec
== TREE_VALUE (t
)
16190 && chain
== TREE_CHAIN (t
))
16193 RETURN (tree_cons (purposevec
, valuevec
, chain
));
16196 /* Convert the argument vectors into a TREE_LIST */
16200 /* Grab the Ith values. */
16202 purpose
= purposevec
? TREE_VEC_ELT (purposevec
, i
)
16205 = valuevec
? convert_from_reference (TREE_VEC_ELT (valuevec
, i
))
16208 /* Build the list (backwards). */
16209 chain
= tree_cons (purpose
, value
, chain
);
16215 purpose
= TREE_PURPOSE (t
);
16217 purpose
= RECUR (purpose
);
16218 value
= TREE_VALUE (t
);
16220 value
= RECUR (value
);
16221 chain
= TREE_CHAIN (t
);
16222 if (chain
&& chain
!= void_type_node
)
16223 chain
= RECUR (chain
);
16224 if (purpose
== TREE_PURPOSE (t
)
16225 && value
== TREE_VALUE (t
)
16226 && chain
== TREE_CHAIN (t
))
16228 RETURN (tree_cons (purpose
, value
, chain
));
16231 case COMPONENT_REF
:
16238 object
= tsubst_non_call_postfix_expression (TREE_OPERAND (t
, 0),
16239 args
, complain
, in_decl
);
16240 /* Remember that there was a reference to this entity. */
16241 if (DECL_P (object
)
16242 && !mark_used (object
, complain
) && !(complain
& tf_error
))
16243 RETURN (error_mark_node
);
16244 object_type
= TREE_TYPE (object
);
16246 member
= TREE_OPERAND (t
, 1);
16247 if (BASELINK_P (member
))
16248 member
= tsubst_baselink (member
,
16249 non_reference (TREE_TYPE (object
)),
16250 args
, complain
, in_decl
);
16252 member
= tsubst_copy (member
, args
, complain
, in_decl
);
16253 if (member
== error_mark_node
)
16254 RETURN (error_mark_node
);
16256 if (type_dependent_expression_p (object
))
16257 /* We can't do much here. */;
16258 else if (!CLASS_TYPE_P (object_type
))
16260 if (scalarish_type_p (object_type
))
16262 tree s
= NULL_TREE
;
16263 tree dtor
= member
;
16265 if (TREE_CODE (dtor
) == SCOPE_REF
)
16267 s
= TREE_OPERAND (dtor
, 0);
16268 dtor
= TREE_OPERAND (dtor
, 1);
16270 if (TREE_CODE (dtor
) == BIT_NOT_EXPR
)
16272 dtor
= TREE_OPERAND (dtor
, 0);
16274 RETURN (finish_pseudo_destructor_expr
16275 (object
, s
, dtor
, input_location
));
16279 else if (TREE_CODE (member
) == SCOPE_REF
16280 && TREE_CODE (TREE_OPERAND (member
, 1)) == TEMPLATE_ID_EXPR
)
16282 /* Lookup the template functions now that we know what the
16284 tree scope
= TREE_OPERAND (member
, 0);
16285 tree tmpl
= TREE_OPERAND (TREE_OPERAND (member
, 1), 0);
16286 tree args
= TREE_OPERAND (TREE_OPERAND (member
, 1), 1);
16287 member
= lookup_qualified_name (scope
, tmpl
,
16288 /*is_type_p=*/false,
16289 /*complain=*/false);
16290 if (BASELINK_P (member
))
16292 BASELINK_FUNCTIONS (member
)
16293 = build_nt (TEMPLATE_ID_EXPR
, BASELINK_FUNCTIONS (member
),
16295 member
= (adjust_result_of_qualified_name_lookup
16296 (member
, BINFO_TYPE (BASELINK_BINFO (member
)),
16301 qualified_name_lookup_error (scope
, tmpl
, member
,
16303 RETURN (error_mark_node
);
16306 else if (TREE_CODE (member
) == SCOPE_REF
16307 && !CLASS_TYPE_P (TREE_OPERAND (member
, 0))
16308 && TREE_CODE (TREE_OPERAND (member
, 0)) != NAMESPACE_DECL
)
16310 if (complain
& tf_error
)
16312 if (TYPE_P (TREE_OPERAND (member
, 0)))
16313 error ("%qT is not a class or namespace",
16314 TREE_OPERAND (member
, 0));
16316 error ("%qD is not a class or namespace",
16317 TREE_OPERAND (member
, 0));
16319 RETURN (error_mark_node
);
16321 else if (TREE_CODE (member
) == FIELD_DECL
)
16323 r
= finish_non_static_data_member (member
, object
, NULL_TREE
);
16324 if (TREE_CODE (r
) == COMPONENT_REF
)
16325 REF_PARENTHESIZED_P (r
) = REF_PARENTHESIZED_P (t
);
16329 r
= finish_class_member_access_expr (object
, member
,
16330 /*template_p=*/false,
16332 if (TREE_CODE (r
) == COMPONENT_REF
)
16333 REF_PARENTHESIZED_P (r
) = REF_PARENTHESIZED_P (t
);
16338 RETURN (build_throw
16339 (RECUR (TREE_OPERAND (t
, 0))));
16343 vec
<constructor_elt
, va_gc
> *n
;
16344 constructor_elt
*ce
;
16345 unsigned HOST_WIDE_INT idx
;
16346 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
16347 bool process_index_p
;
16349 bool need_copy_p
= false;
16352 if (type
== error_mark_node
)
16353 RETURN (error_mark_node
);
16355 /* digest_init will do the wrong thing if we let it. */
16356 if (type
&& TYPE_PTRMEMFUNC_P (type
))
16359 /* We do not want to process the index of aggregate
16360 initializers as they are identifier nodes which will be
16361 looked up by digest_init. */
16362 process_index_p
= !(type
&& MAYBE_CLASS_TYPE_P (type
));
16364 n
= vec_safe_copy (CONSTRUCTOR_ELTS (t
));
16365 newlen
= vec_safe_length (n
);
16366 FOR_EACH_VEC_SAFE_ELT (n
, idx
, ce
)
16368 if (ce
->index
&& process_index_p
16369 /* An identifier index is looked up in the type
16370 being initialized, not the current scope. */
16371 && TREE_CODE (ce
->index
) != IDENTIFIER_NODE
)
16372 ce
->index
= RECUR (ce
->index
);
16374 if (PACK_EXPANSION_P (ce
->value
))
16376 /* Substitute into the pack expansion. */
16377 ce
->value
= tsubst_pack_expansion (ce
->value
, args
, complain
,
16380 if (ce
->value
== error_mark_node
16381 || PACK_EXPANSION_P (ce
->value
))
16383 else if (TREE_VEC_LENGTH (ce
->value
) == 1)
16384 /* Just move the argument into place. */
16385 ce
->value
= TREE_VEC_ELT (ce
->value
, 0);
16388 /* Update the length of the final CONSTRUCTOR
16389 arguments vector, and note that we will need to
16391 newlen
= newlen
+ TREE_VEC_LENGTH (ce
->value
) - 1;
16392 need_copy_p
= true;
16396 ce
->value
= RECUR (ce
->value
);
16401 vec
<constructor_elt
, va_gc
> *old_n
= n
;
16403 vec_alloc (n
, newlen
);
16404 FOR_EACH_VEC_ELT (*old_n
, idx
, ce
)
16406 if (TREE_CODE (ce
->value
) == TREE_VEC
)
16408 int i
, len
= TREE_VEC_LENGTH (ce
->value
);
16409 for (i
= 0; i
< len
; ++i
)
16410 CONSTRUCTOR_APPEND_ELT (n
, 0,
16411 TREE_VEC_ELT (ce
->value
, i
));
16414 CONSTRUCTOR_APPEND_ELT (n
, 0, ce
->value
);
16418 r
= build_constructor (init_list_type_node
, n
);
16419 CONSTRUCTOR_IS_DIRECT_INIT (r
) = CONSTRUCTOR_IS_DIRECT_INIT (t
);
16421 if (TREE_HAS_CONSTRUCTOR (t
))
16422 RETURN (finish_compound_literal (type
, r
, complain
));
16424 TREE_TYPE (r
) = type
;
16430 tree operand_0
= TREE_OPERAND (t
, 0);
16431 if (TYPE_P (operand_0
))
16433 operand_0
= tsubst (operand_0
, args
, complain
, in_decl
);
16434 RETURN (get_typeid (operand_0
, complain
));
16438 operand_0
= RECUR (operand_0
);
16439 RETURN (build_typeid (operand_0
, complain
));
16446 else if (DECL_PACK_P (t
))
16448 /* We don't build decls for an instantiation of a
16449 variadic capture proxy, we instantiate the elements
16451 gcc_assert (DECL_HAS_VALUE_EXPR_P (t
));
16452 return RECUR (DECL_VALUE_EXPR (t
));
16458 tree r
= tsubst_copy (t
, args
, complain
, in_decl
);
16459 /* ??? We're doing a subset of finish_id_expression here. */
16461 && !processing_template_decl
16462 && !cp_unevaluated_operand
16463 && (TREE_STATIC (r
) || DECL_EXTERNAL (r
))
16464 && CP_DECL_THREAD_LOCAL_P (r
))
16466 if (tree wrap
= get_tls_wrapper_fn (r
))
16467 /* Replace an evaluated use of the thread_local variable with
16468 a call to its wrapper. */
16469 r
= build_cxx_call (wrap
, 0, NULL
, tf_warning_or_error
);
16471 else if (outer_automatic_var_p (r
))
16473 r
= process_outer_var_ref (r
, complain
);
16474 if (is_capture_proxy (r
))
16475 register_local_specialization (r
, t
);
16478 if (TREE_CODE (TREE_TYPE (t
)) != REFERENCE_TYPE
)
16479 /* If the original type was a reference, we'll be wrapped in
16480 the appropriate INDIRECT_REF. */
16481 r
= convert_from_reference (r
);
16487 tree op0
= RECUR (TREE_OPERAND (t
, 0));
16488 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
16489 RETURN (build_x_va_arg (EXPR_LOCATION (t
), op0
, type
));
16492 case OFFSETOF_EXPR
:
16493 RETURN (finish_offsetof (RECUR (TREE_OPERAND (t
, 0)),
16494 EXPR_LOCATION (t
)));
16498 tree type1
= tsubst (TRAIT_EXPR_TYPE1 (t
), args
,
16499 complain
, in_decl
);
16501 tree type2
= TRAIT_EXPR_TYPE2 (t
);
16502 if (type2
&& TREE_CODE (type2
) == TREE_LIST
)
16503 type2
= RECUR (type2
);
16505 type2
= tsubst (type2
, args
, complain
, in_decl
);
16507 RETURN (finish_trait_expr (TRAIT_EXPR_KIND (t
), type1
, type2
));
16512 tree old_stmt_expr
= cur_stmt_expr
;
16513 tree stmt_expr
= begin_stmt_expr ();
16515 cur_stmt_expr
= stmt_expr
;
16516 tsubst_expr (STMT_EXPR_STMT (t
), args
, complain
, in_decl
,
16517 integral_constant_expression_p
);
16518 stmt_expr
= finish_stmt_expr (stmt_expr
, false);
16519 cur_stmt_expr
= old_stmt_expr
;
16521 /* If the resulting list of expression statement is empty,
16522 fold it further into void_node. */
16523 if (empty_expr_stmt_p (stmt_expr
))
16524 stmt_expr
= void_node
;
16526 RETURN (stmt_expr
);
16531 tree r
= build_lambda_expr ();
16533 tree type
= tsubst (LAMBDA_EXPR_CLOSURE (t
), args
, complain
, NULL_TREE
);
16534 LAMBDA_EXPR_CLOSURE (r
) = type
;
16535 CLASSTYPE_LAMBDA_EXPR (type
) = r
;
16537 LAMBDA_EXPR_LOCATION (r
)
16538 = LAMBDA_EXPR_LOCATION (t
);
16539 LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (r
)
16540 = LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (t
);
16541 LAMBDA_EXPR_MUTABLE_P (r
) = LAMBDA_EXPR_MUTABLE_P (t
);
16542 LAMBDA_EXPR_DISCRIMINATOR (r
)
16543 = (LAMBDA_EXPR_DISCRIMINATOR (t
));
16544 tree scope
= LAMBDA_EXPR_EXTRA_SCOPE (t
);
16546 /* No substitution needed. */;
16547 else if (VAR_OR_FUNCTION_DECL_P (scope
))
16548 /* For a function or variable scope, we want to use tsubst so that we
16549 don't complain about referring to an auto before deduction. */
16550 scope
= tsubst (scope
, args
, complain
, in_decl
);
16551 else if (TREE_CODE (scope
) == PARM_DECL
)
16553 /* Look up the parameter we want directly, as tsubst_copy
16554 doesn't do what we need. */
16555 tree fn
= tsubst (DECL_CONTEXT (scope
), args
, complain
, in_decl
);
16556 tree parm
= FUNCTION_FIRST_USER_PARM (fn
);
16557 while (DECL_PARM_INDEX (parm
) != DECL_PARM_INDEX (scope
))
16558 parm
= DECL_CHAIN (parm
);
16560 /* FIXME Work around the parm not having DECL_CONTEXT set. */
16561 if (DECL_CONTEXT (scope
) == NULL_TREE
)
16562 DECL_CONTEXT (scope
) = fn
;
16564 else if (TREE_CODE (scope
) == FIELD_DECL
)
16565 /* For a field, use tsubst_copy so that we look up the existing field
16566 rather than build a new one. */
16567 scope
= RECUR (scope
);
16569 gcc_unreachable ();
16570 LAMBDA_EXPR_EXTRA_SCOPE (r
) = scope
;
16571 LAMBDA_EXPR_RETURN_TYPE (r
)
16572 = tsubst (LAMBDA_EXPR_RETURN_TYPE (t
), args
, complain
, in_decl
);
16574 gcc_assert (LAMBDA_EXPR_THIS_CAPTURE (t
) == NULL_TREE
16575 && LAMBDA_EXPR_PENDING_PROXIES (t
) == NULL
);
16577 /* Do this again now that LAMBDA_EXPR_EXTRA_SCOPE is set. */
16578 determine_visibility (TYPE_NAME (type
));
16579 /* Now that we know visibility, instantiate the type so we have a
16580 declaration of the op() for later calls to lambda_function. */
16581 complete_type (type
);
16583 LAMBDA_EXPR_THIS_CAPTURE (r
) = NULL_TREE
;
16585 insert_pending_capture_proxies ();
16587 RETURN (build_lambda_object (r
));
16591 /* We can get here for a constant initializer of non-dependent type.
16592 FIXME stop folding in cp_parser_initializer_clause. */
16594 tree r
= get_target_expr_sfinae (RECUR (TARGET_EXPR_INITIAL (t
)),
16599 case TRANSACTION_EXPR
:
16600 RETURN (tsubst_expr(t
, args
, complain
, in_decl
,
16601 integral_constant_expression_p
));
16604 RETURN (finish_parenthesized_expr (RECUR (TREE_OPERAND (t
, 0))));
16606 case VEC_PERM_EXPR
:
16608 tree op0
= RECUR (TREE_OPERAND (t
, 0));
16609 tree op1
= RECUR (TREE_OPERAND (t
, 1));
16610 tree op2
= RECUR (TREE_OPERAND (t
, 2));
16611 RETURN (build_x_vec_perm_expr (input_location
, op0
, op1
, op2
,
16615 case REQUIRES_EXPR
:
16616 RETURN (tsubst_requires_expr (t
, args
, complain
, in_decl
));
16619 /* Handle Objective-C++ constructs, if appropriate. */
16622 = objcp_tsubst_copy_and_build (t
, args
, complain
,
16623 in_decl
, /*function_p=*/false);
16627 RETURN (tsubst_copy (t
, args
, complain
, in_decl
));
16633 input_location
= loc
;
16637 /* Verify that the instantiated ARGS are valid. For type arguments,
16638 make sure that the type's linkage is ok. For non-type arguments,
16639 make sure they are constants if they are integral or enumerations.
16640 Emit an error under control of COMPLAIN, and return TRUE on error. */
16643 check_instantiated_arg (tree tmpl
, tree t
, tsubst_flags_t complain
)
16645 if (dependent_template_arg_p (t
))
16647 if (ARGUMENT_PACK_P (t
))
16649 tree vec
= ARGUMENT_PACK_ARGS (t
);
16650 int len
= TREE_VEC_LENGTH (vec
);
16651 bool result
= false;
16654 for (i
= 0; i
< len
; ++i
)
16655 if (check_instantiated_arg (tmpl
, TREE_VEC_ELT (vec
, i
), complain
))
16659 else if (TYPE_P (t
))
16661 /* [basic.link]: A name with no linkage (notably, the name
16662 of a class or enumeration declared in a local scope)
16663 shall not be used to declare an entity with linkage.
16664 This implies that names with no linkage cannot be used as
16667 DR 757 relaxes this restriction for C++0x. */
16668 tree nt
= (cxx_dialect
> cxx98
? NULL_TREE
16669 : no_linkage_check (t
, /*relaxed_p=*/false));
16673 /* DR 488 makes use of a type with no linkage cause
16674 type deduction to fail. */
16675 if (complain
& tf_error
)
16677 if (TYPE_ANONYMOUS_P (nt
))
16678 error ("%qT is/uses anonymous type", t
);
16680 error ("template argument for %qD uses local type %qT",
16685 /* In order to avoid all sorts of complications, we do not
16686 allow variably-modified types as template arguments. */
16687 else if (variably_modified_type_p (t
, NULL_TREE
))
16689 if (complain
& tf_error
)
16690 error ("%qT is a variably modified type", t
);
16694 /* Class template and alias template arguments should be OK. */
16695 else if (DECL_TYPE_TEMPLATE_P (t
))
16697 /* A non-type argument of integral or enumerated type must be a
16699 else if (TREE_TYPE (t
)
16700 && INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (t
))
16701 && !REFERENCE_REF_P (t
)
16702 && !TREE_CONSTANT (t
))
16704 if (complain
& tf_error
)
16705 error ("integral expression %qE is not constant", t
);
16712 check_instantiated_args (tree tmpl
, tree args
, tsubst_flags_t complain
)
16714 int ix
, len
= DECL_NTPARMS (tmpl
);
16715 bool result
= false;
16717 for (ix
= 0; ix
!= len
; ix
++)
16719 if (check_instantiated_arg (tmpl
, TREE_VEC_ELT (args
, ix
), complain
))
16722 if (result
&& (complain
& tf_error
))
16723 error (" trying to instantiate %qD", tmpl
);
16727 /* We're out of SFINAE context now, so generate diagnostics for the access
16728 errors we saw earlier when instantiating D from TMPL and ARGS. */
16731 recheck_decl_substitution (tree d
, tree tmpl
, tree args
)
16733 tree pattern
= DECL_TEMPLATE_RESULT (tmpl
);
16734 tree type
= TREE_TYPE (pattern
);
16735 location_t loc
= input_location
;
16737 push_access_scope (d
);
16738 push_deferring_access_checks (dk_no_deferred
);
16739 input_location
= DECL_SOURCE_LOCATION (pattern
);
16740 tsubst (type
, args
, tf_warning_or_error
, d
);
16741 input_location
= loc
;
16742 pop_deferring_access_checks ();
16743 pop_access_scope (d
);
16746 /* Instantiate the indicated variable, function, or alias template TMPL with
16747 the template arguments in TARG_PTR. */
16750 instantiate_template_1 (tree tmpl
, tree orig_args
, tsubst_flags_t complain
)
16752 tree targ_ptr
= orig_args
;
16756 bool access_ok
= true;
16758 if (tmpl
== error_mark_node
)
16759 return error_mark_node
;
16761 gcc_assert (TREE_CODE (tmpl
) == TEMPLATE_DECL
);
16763 /* If this function is a clone, handle it specially. */
16764 if (DECL_CLONED_FUNCTION_P (tmpl
))
16769 /* Use DECL_ABSTRACT_ORIGIN because only FUNCTION_DECLs have
16770 DECL_CLONED_FUNCTION. */
16771 spec
= instantiate_template (DECL_ABSTRACT_ORIGIN (tmpl
),
16772 targ_ptr
, complain
);
16773 if (spec
== error_mark_node
)
16774 return error_mark_node
;
16776 /* Look for the clone. */
16777 FOR_EACH_CLONE (clone
, spec
)
16778 if (DECL_NAME (clone
) == DECL_NAME (tmpl
))
16780 /* We should always have found the clone by now. */
16781 gcc_unreachable ();
16785 if (targ_ptr
== error_mark_node
)
16786 return error_mark_node
;
16788 /* Check to see if we already have this specialization. */
16789 gen_tmpl
= most_general_template (tmpl
);
16790 if (tmpl
!= gen_tmpl
)
16791 /* The TMPL is a partial instantiation. To get a full set of
16792 arguments we must add the arguments used to perform the
16793 partial instantiation. */
16794 targ_ptr
= add_outermost_template_args (DECL_TI_ARGS (tmpl
),
16797 /* It would be nice to avoid hashing here and then again in tsubst_decl,
16798 but it doesn't seem to be on the hot path. */
16799 spec
= retrieve_specialization (gen_tmpl
, targ_ptr
, 0);
16801 gcc_assert (tmpl
== gen_tmpl
16802 || ((fndecl
= retrieve_specialization (tmpl
, orig_args
, 0))
16804 || fndecl
== NULL_TREE
);
16806 if (spec
!= NULL_TREE
)
16808 if (FNDECL_HAS_ACCESS_ERRORS (spec
))
16810 if (complain
& tf_error
)
16811 recheck_decl_substitution (spec
, gen_tmpl
, targ_ptr
);
16812 return error_mark_node
;
16817 if (check_instantiated_args (gen_tmpl
, INNERMOST_TEMPLATE_ARGS (targ_ptr
),
16819 return error_mark_node
;
16821 /* We are building a FUNCTION_DECL, during which the access of its
16822 parameters and return types have to be checked. However this
16823 FUNCTION_DECL which is the desired context for access checking
16824 is not built yet. We solve this chicken-and-egg problem by
16825 deferring all checks until we have the FUNCTION_DECL. */
16826 push_deferring_access_checks (dk_deferred
);
16828 /* Instantiation of the function happens in the context of the function
16829 template, not the context of the overload resolution we're doing. */
16830 push_to_top_level ();
16831 /* If there are dependent arguments, e.g. because we're doing partial
16832 ordering, make sure processing_template_decl stays set. */
16833 if (uses_template_parms (targ_ptr
))
16834 ++processing_template_decl
;
16835 if (DECL_CLASS_SCOPE_P (gen_tmpl
))
16837 tree ctx
= tsubst_aggr_type (DECL_CONTEXT (gen_tmpl
), targ_ptr
,
16838 complain
, gen_tmpl
, true);
16839 push_nested_class (ctx
);
16842 tree pattern
= DECL_TEMPLATE_RESULT (gen_tmpl
);
16844 if (VAR_P (pattern
))
16846 /* We need to determine if we're using a partial or explicit
16847 specialization now, because the type of the variable could be
16849 tree tid
= lookup_template_variable (gen_tmpl
, targ_ptr
);
16850 tree elt
= most_specialized_partial_spec (tid
, complain
);
16851 if (elt
== error_mark_node
)
16852 pattern
= error_mark_node
;
16855 tmpl
= TREE_VALUE (elt
);
16856 pattern
= DECL_TEMPLATE_RESULT (tmpl
);
16857 targ_ptr
= TREE_PURPOSE (elt
);
16861 /* Substitute template parameters to obtain the specialization. */
16862 fndecl
= tsubst (pattern
, targ_ptr
, complain
, gen_tmpl
);
16863 if (DECL_CLASS_SCOPE_P (gen_tmpl
))
16864 pop_nested_class ();
16865 pop_from_top_level ();
16867 if (fndecl
== error_mark_node
)
16869 pop_deferring_access_checks ();
16870 return error_mark_node
;
16873 /* The DECL_TI_TEMPLATE should always be the immediate parent
16874 template, not the most general template. */
16875 DECL_TI_TEMPLATE (fndecl
) = tmpl
;
16876 DECL_TI_ARGS (fndecl
) = targ_ptr
;
16878 /* Now we know the specialization, compute access previously
16880 push_access_scope (fndecl
);
16881 if (!perform_deferred_access_checks (complain
))
16883 pop_access_scope (fndecl
);
16884 pop_deferring_access_checks ();
16886 /* If we've just instantiated the main entry point for a function,
16887 instantiate all the alternate entry points as well. We do this
16888 by cloning the instantiation of the main entry point, not by
16889 instantiating the template clones. */
16890 if (DECL_CHAIN (gen_tmpl
) && DECL_CLONED_FUNCTION_P (DECL_CHAIN (gen_tmpl
)))
16891 clone_function_decl (fndecl
, /*update_method_vec_p=*/0);
16895 if (!(complain
& tf_error
))
16897 /* Remember to reinstantiate when we're out of SFINAE so the user
16898 can see the errors. */
16899 FNDECL_HAS_ACCESS_ERRORS (fndecl
) = true;
16901 return error_mark_node
;
16906 /* Wrapper for instantiate_template_1. */
16909 instantiate_template (tree tmpl
, tree orig_args
, tsubst_flags_t complain
)
16912 timevar_push (TV_TEMPLATE_INST
);
16913 ret
= instantiate_template_1 (tmpl
, orig_args
, complain
);
16914 timevar_pop (TV_TEMPLATE_INST
);
16918 /* Instantiate the alias template TMPL with ARGS. Also push a template
16919 instantiation level, which instantiate_template doesn't do because
16920 functions and variables have sufficient context established by the
16924 instantiate_alias_template (tree tmpl
, tree args
, tsubst_flags_t complain
)
16926 struct pending_template
*old_last_pend
= last_pending_template
;
16927 struct tinst_level
*old_error_tinst
= last_error_tinst_level
;
16928 if (tmpl
== error_mark_node
|| args
== error_mark_node
)
16929 return error_mark_node
;
16930 tree tinst
= build_tree_list (tmpl
, args
);
16931 if (!push_tinst_level (tinst
))
16934 return error_mark_node
;
16938 coerce_innermost_template_parms (DECL_TEMPLATE_PARMS (tmpl
),
16939 args
, tmpl
, complain
,
16940 /*require_all_args=*/true,
16941 /*use_default_args=*/true);
16943 tree r
= instantiate_template (tmpl
, args
, complain
);
16944 pop_tinst_level ();
16945 /* We can't free this if a pending_template entry or last_error_tinst_level
16946 is pointing at it. */
16947 if (last_pending_template
== old_last_pend
16948 && last_error_tinst_level
== old_error_tinst
)
16954 /* PARM is a template parameter pack for FN. Returns true iff
16955 PARM is used in a deducible way in the argument list of FN. */
16958 pack_deducible_p (tree parm
, tree fn
)
16960 tree t
= FUNCTION_FIRST_USER_PARMTYPE (fn
);
16961 for (; t
; t
= TREE_CHAIN (t
))
16963 tree type
= TREE_VALUE (t
);
16965 if (!PACK_EXPANSION_P (type
))
16967 for (packs
= PACK_EXPANSION_PARAMETER_PACKS (type
);
16968 packs
; packs
= TREE_CHAIN (packs
))
16969 if (template_args_equal (TREE_VALUE (packs
), parm
))
16971 /* The template parameter pack is used in a function parameter
16972 pack. If this is the end of the parameter list, the
16973 template parameter pack is deducible. */
16974 if (TREE_CHAIN (t
) == void_list_node
)
16977 /* Otherwise, not. Well, it could be deduced from
16978 a non-pack parameter, but doing so would end up with
16979 a deduction mismatch, so don't bother. */
16983 /* The template parameter pack isn't used in any function parameter
16984 packs, but it might be used deeper, e.g. tuple<Args...>. */
16988 /* The FN is a TEMPLATE_DECL for a function. ARGS is an array with
16989 NARGS elements of the arguments that are being used when calling
16990 it. TARGS is a vector into which the deduced template arguments
16993 Returns either a FUNCTION_DECL for the matching specialization of FN or
16994 NULL_TREE if no suitable specialization can be found. If EXPLAIN_P is
16995 true, diagnostics will be printed to explain why it failed.
16997 If FN is a conversion operator, or we are trying to produce a specific
16998 specialization, RETURN_TYPE is the return type desired.
17000 The EXPLICIT_TARGS are explicit template arguments provided via a
17003 The parameter STRICT is one of:
17006 We are deducing arguments for a function call, as in
17007 [temp.deduct.call].
17010 We are deducing arguments for a conversion function, as in
17011 [temp.deduct.conv].
17014 We are deducing arguments when doing an explicit instantiation
17015 as in [temp.explicit], when determining an explicit specialization
17016 as in [temp.expl.spec], or when taking the address of a function
17017 template, as in [temp.deduct.funcaddr]. */
17020 fn_type_unification (tree fn
,
17021 tree explicit_targs
,
17024 unsigned int nargs
,
17026 unification_kind_t strict
,
17033 tree decl
= NULL_TREE
;
17034 tsubst_flags_t complain
= (explain_p
? tf_warning_or_error
: tf_none
);
17036 static int deduction_depth
;
17037 struct pending_template
*old_last_pend
= last_pending_template
;
17038 struct tinst_level
*old_error_tinst
= last_error_tinst_level
;
17039 tree tparms
= DECL_INNERMOST_TEMPLATE_PARMS (fn
);
17041 tree r
= error_mark_node
;
17044 complain
|= tf_decltype
;
17046 /* In C++0x, it's possible to have a function template whose type depends
17047 on itself recursively. This is most obvious with decltype, but can also
17048 occur with enumeration scope (c++/48969). So we need to catch infinite
17049 recursion and reject the substitution at deduction time; this function
17050 will return error_mark_node for any repeated substitution.
17052 This also catches excessive recursion such as when f<N> depends on
17053 f<N-1> across all integers, and returns error_mark_node for all the
17054 substitutions back up to the initial one.
17056 This is, of course, not reentrant. */
17057 if (excessive_deduction_depth
)
17058 return error_mark_node
;
17059 tinst
= build_tree_list (fn
, NULL_TREE
);
17062 gcc_assert (TREE_CODE (fn
) == TEMPLATE_DECL
);
17064 fntype
= TREE_TYPE (fn
);
17065 if (explicit_targs
)
17069 The specified template arguments must match the template
17070 parameters in kind (i.e., type, nontype, template), and there
17071 must not be more arguments than there are parameters;
17072 otherwise type deduction fails.
17074 Nontype arguments must match the types of the corresponding
17075 nontype template parameters, or must be convertible to the
17076 types of the corresponding nontype parameters as specified in
17077 _temp.arg.nontype_, otherwise type deduction fails.
17079 All references in the function type of the function template
17080 to the corresponding template parameters are replaced by the
17081 specified template argument values. If a substitution in a
17082 template parameter or in the function type of the function
17083 template results in an invalid type, type deduction fails. */
17084 int i
, len
= TREE_VEC_LENGTH (tparms
);
17085 location_t loc
= input_location
;
17086 bool incomplete
= false;
17088 /* Adjust any explicit template arguments before entering the
17089 substitution context. */
17091 = (coerce_template_parms (tparms
, explicit_targs
, NULL_TREE
,
17093 /*require_all_args=*/false,
17094 /*use_default_args=*/false));
17095 if (explicit_targs
== error_mark_node
)
17098 /* Substitute the explicit args into the function type. This is
17099 necessary so that, for instance, explicitly declared function
17100 arguments can match null pointed constants. If we were given
17101 an incomplete set of explicit args, we must not do semantic
17102 processing during substitution as we could create partial
17104 for (i
= 0; i
< len
; i
++)
17106 tree parm
= TREE_VALUE (TREE_VEC_ELT (tparms
, i
));
17107 bool parameter_pack
= false;
17108 tree targ
= TREE_VEC_ELT (explicit_targs
, i
);
17110 /* Dig out the actual parm. */
17111 if (TREE_CODE (parm
) == TYPE_DECL
17112 || TREE_CODE (parm
) == TEMPLATE_DECL
)
17114 parm
= TREE_TYPE (parm
);
17115 parameter_pack
= TEMPLATE_TYPE_PARAMETER_PACK (parm
);
17117 else if (TREE_CODE (parm
) == PARM_DECL
)
17119 parm
= DECL_INITIAL (parm
);
17120 parameter_pack
= TEMPLATE_PARM_PARAMETER_PACK (parm
);
17123 if (!parameter_pack
&& targ
== NULL_TREE
)
17124 /* No explicit argument for this template parameter. */
17127 if (parameter_pack
&& pack_deducible_p (parm
, fn
))
17129 /* Mark the argument pack as "incomplete". We could
17130 still deduce more arguments during unification.
17131 We remove this mark in type_unification_real. */
17134 ARGUMENT_PACK_INCOMPLETE_P(targ
) = 1;
17135 ARGUMENT_PACK_EXPLICIT_ARGS (targ
)
17136 = ARGUMENT_PACK_ARGS (targ
);
17139 /* We have some incomplete argument packs. */
17144 TREE_VALUE (tinst
) = explicit_targs
;
17145 if (!push_tinst_level (tinst
))
17147 excessive_deduction_depth
= true;
17150 processing_template_decl
+= incomplete
;
17151 input_location
= DECL_SOURCE_LOCATION (fn
);
17152 /* Ignore any access checks; we'll see them again in
17153 instantiate_template and they might have the wrong
17154 access path at this point. */
17155 push_deferring_access_checks (dk_deferred
);
17156 fntype
= tsubst (TREE_TYPE (fn
), explicit_targs
,
17157 complain
| tf_partial
, NULL_TREE
);
17158 pop_deferring_access_checks ();
17159 input_location
= loc
;
17160 processing_template_decl
-= incomplete
;
17161 pop_tinst_level ();
17163 if (fntype
== error_mark_node
)
17166 /* Place the explicitly specified arguments in TARGS. */
17167 for (i
= NUM_TMPL_ARGS (explicit_targs
); i
--;)
17168 TREE_VEC_ELT (targs
, i
) = TREE_VEC_ELT (explicit_targs
, i
);
17171 /* Never do unification on the 'this' parameter. */
17172 parms
= skip_artificial_parms_for (fn
, TYPE_ARG_TYPES (fntype
));
17178 parms
= tree_cons (NULL_TREE
, TREE_TYPE (fntype
), parms
);
17179 new_args
= XALLOCAVEC (tree
, nargs
+ 1);
17180 new_args
[0] = return_type
;
17181 memcpy (new_args
+ 1, args
, nargs
* sizeof (tree
));
17186 /* We allow incomplete unification without an error message here
17187 because the standard doesn't seem to explicitly prohibit it. Our
17188 callers must be ready to deal with unification failures in any
17191 TREE_VALUE (tinst
) = targs
;
17192 /* If we aren't explaining yet, push tinst context so we can see where
17193 any errors (e.g. from class instantiations triggered by instantiation
17194 of default template arguments) come from. If we are explaining, this
17195 context is redundant. */
17196 if (!explain_p
&& !push_tinst_level (tinst
))
17198 excessive_deduction_depth
= true;
17202 /* type_unification_real will pass back any access checks from default
17203 template argument substitution. */
17204 vec
<deferred_access_check
, va_gc
> *checks
;
17207 ok
= !type_unification_real (DECL_INNERMOST_TEMPLATE_PARMS (fn
),
17208 targs
, parms
, args
, nargs
, /*subr=*/0,
17209 strict
, flags
, &checks
, explain_p
);
17211 pop_tinst_level ();
17215 /* Now that we have bindings for all of the template arguments,
17216 ensure that the arguments deduced for the template template
17217 parameters have compatible template parameter lists. We cannot
17218 check this property before we have deduced all template
17219 arguments, because the template parameter types of a template
17220 template parameter might depend on prior template parameters
17221 deduced after the template template parameter. The following
17222 ill-formed example illustrates this issue:
17224 template<typename T, template<T> class C> void f(C<5>, T);
17226 template<int N> struct X {};
17229 f(X<5>(), 5l); // error: template argument deduction fails
17232 The template parameter list of 'C' depends on the template type
17233 parameter 'T', but 'C' is deduced to 'X' before 'T' is deduced to
17234 'long'. Thus, we can't check that 'C' cannot bind to 'X' at the
17235 time that we deduce 'C'. */
17236 if (!template_template_parm_bindings_ok_p
17237 (DECL_INNERMOST_TEMPLATE_PARMS (fn
), targs
))
17239 unify_inconsistent_template_template_parameters (explain_p
);
17243 /* All is well so far. Now, check:
17247 When all template arguments have been deduced, all uses of
17248 template parameters in nondeduced contexts are replaced with
17249 the corresponding deduced argument values. If the
17250 substitution results in an invalid type, as described above,
17251 type deduction fails. */
17252 TREE_VALUE (tinst
) = targs
;
17253 if (!push_tinst_level (tinst
))
17255 excessive_deduction_depth
= true;
17259 /* Also collect access checks from the instantiation. */
17260 reopen_deferring_access_checks (checks
);
17262 decl
= instantiate_template (fn
, targs
, complain
);
17264 checks
= get_deferred_access_checks ();
17265 pop_deferring_access_checks ();
17267 pop_tinst_level ();
17269 if (decl
== error_mark_node
)
17272 /* Now perform any access checks encountered during substitution. */
17273 push_access_scope (decl
);
17274 ok
= perform_access_checks (checks
, complain
);
17275 pop_access_scope (decl
);
17279 /* If we're looking for an exact match, check that what we got
17280 is indeed an exact match. It might not be if some template
17281 parameters are used in non-deduced contexts. But don't check
17282 for an exact match if we have dependent template arguments;
17283 in that case we're doing partial ordering, and we already know
17284 that we have two candidates that will provide the actual type. */
17285 if (strict
== DEDUCE_EXACT
&& !any_dependent_template_arguments_p (targs
))
17287 tree substed
= TREE_TYPE (decl
);
17291 = skip_artificial_parms_for (decl
, TYPE_ARG_TYPES (substed
));
17293 sarg
= tree_cons (NULL_TREE
, TREE_TYPE (substed
), sarg
);
17294 for (i
= 0; i
< nargs
&& sarg
; ++i
, sarg
= TREE_CHAIN (sarg
))
17295 if (!same_type_p (args
[i
], TREE_VALUE (sarg
)))
17297 unify_type_mismatch (explain_p
, args
[i
],
17298 TREE_VALUE (sarg
));
17307 if (excessive_deduction_depth
)
17309 if (deduction_depth
== 0)
17310 /* Reset once we're all the way out. */
17311 excessive_deduction_depth
= false;
17314 /* We can't free this if a pending_template entry or last_error_tinst_level
17315 is pointing at it. */
17316 if (last_pending_template
== old_last_pend
17317 && last_error_tinst_level
== old_error_tinst
)
17323 /* Adjust types before performing type deduction, as described in
17324 [temp.deduct.call] and [temp.deduct.conv]. The rules in these two
17325 sections are symmetric. PARM is the type of a function parameter
17326 or the return type of the conversion function. ARG is the type of
17327 the argument passed to the call, or the type of the value
17328 initialized with the result of the conversion function.
17329 ARG_EXPR is the original argument expression, which may be null. */
17332 maybe_adjust_types_for_deduction (unification_kind_t strict
,
17345 /* Swap PARM and ARG throughout the remainder of this
17346 function; the handling is precisely symmetric since PARM
17347 will initialize ARG rather than vice versa. */
17348 std::swap (parm
, arg
);
17352 /* Core issue #873: Do the DR606 thing (see below) for these cases,
17353 too, but here handle it by stripping the reference from PARM
17354 rather than by adding it to ARG. */
17355 if (TREE_CODE (*parm
) == REFERENCE_TYPE
17356 && TYPE_REF_IS_RVALUE (*parm
)
17357 && TREE_CODE (TREE_TYPE (*parm
)) == TEMPLATE_TYPE_PARM
17358 && cp_type_quals (TREE_TYPE (*parm
)) == TYPE_UNQUALIFIED
17359 && TREE_CODE (*arg
) == REFERENCE_TYPE
17360 && !TYPE_REF_IS_RVALUE (*arg
))
17361 *parm
= TREE_TYPE (*parm
);
17362 /* Nothing else to do in this case. */
17366 gcc_unreachable ();
17369 if (TREE_CODE (*parm
) != REFERENCE_TYPE
)
17371 /* [temp.deduct.call]
17373 If P is not a reference type:
17375 --If A is an array type, the pointer type produced by the
17376 array-to-pointer standard conversion (_conv.array_) is
17377 used in place of A for type deduction; otherwise,
17379 --If A is a function type, the pointer type produced by
17380 the function-to-pointer standard conversion
17381 (_conv.func_) is used in place of A for type deduction;
17384 --If A is a cv-qualified type, the top level
17385 cv-qualifiers of A's type are ignored for type
17387 if (TREE_CODE (*arg
) == ARRAY_TYPE
)
17388 *arg
= build_pointer_type (TREE_TYPE (*arg
));
17389 else if (TREE_CODE (*arg
) == FUNCTION_TYPE
)
17390 *arg
= build_pointer_type (*arg
);
17392 *arg
= TYPE_MAIN_VARIANT (*arg
);
17395 /* From C++0x [14.8.2.1/3 temp.deduct.call] (after DR606), "If P is
17396 of the form T&&, where T is a template parameter, and the argument
17397 is an lvalue, T is deduced as A& */
17398 if (TREE_CODE (*parm
) == REFERENCE_TYPE
17399 && TYPE_REF_IS_RVALUE (*parm
)
17400 && TREE_CODE (TREE_TYPE (*parm
)) == TEMPLATE_TYPE_PARM
17401 && cp_type_quals (TREE_TYPE (*parm
)) == TYPE_UNQUALIFIED
17402 && (arg_expr
? real_lvalue_p (arg_expr
)
17403 /* try_one_overload doesn't provide an arg_expr, but
17404 functions are always lvalues. */
17405 : TREE_CODE (*arg
) == FUNCTION_TYPE
))
17406 *arg
= build_reference_type (*arg
);
17408 /* [temp.deduct.call]
17410 If P is a cv-qualified type, the top level cv-qualifiers
17411 of P's type are ignored for type deduction. If P is a
17412 reference type, the type referred to by P is used for
17414 *parm
= TYPE_MAIN_VARIANT (*parm
);
17415 if (TREE_CODE (*parm
) == REFERENCE_TYPE
)
17417 *parm
= TREE_TYPE (*parm
);
17418 result
|= UNIFY_ALLOW_OUTER_MORE_CV_QUAL
;
17421 /* DR 322. For conversion deduction, remove a reference type on parm
17422 too (which has been swapped into ARG). */
17423 if (strict
== DEDUCE_CONV
&& TREE_CODE (*arg
) == REFERENCE_TYPE
)
17424 *arg
= TREE_TYPE (*arg
);
17429 /* Subroutine of unify_one_argument. PARM is a function parameter of a
17430 template which does contain any deducible template parameters; check if
17431 ARG is a suitable match for it. STRICT, FLAGS and EXPLAIN_P are as in
17432 unify_one_argument. */
17435 check_non_deducible_conversion (tree parm
, tree arg
, int strict
,
17436 int flags
, bool explain_p
)
17441 type
= TREE_TYPE (arg
);
17445 if (same_type_p (parm
, type
))
17446 return unify_success (explain_p
);
17448 if (strict
== DEDUCE_CONV
)
17450 if (can_convert_arg (type
, parm
, NULL_TREE
, flags
,
17451 explain_p
? tf_warning_or_error
: tf_none
))
17452 return unify_success (explain_p
);
17454 else if (strict
!= DEDUCE_EXACT
)
17456 if (can_convert_arg (parm
, type
,
17457 TYPE_P (arg
) ? NULL_TREE
: arg
,
17458 flags
, explain_p
? tf_warning_or_error
: tf_none
))
17459 return unify_success (explain_p
);
17462 if (strict
== DEDUCE_EXACT
)
17463 return unify_type_mismatch (explain_p
, parm
, arg
);
17465 return unify_arg_conversion (explain_p
, parm
, type
, arg
);
17468 static bool uses_deducible_template_parms (tree type
);
17470 /* Returns true iff the expression EXPR is one from which a template
17471 argument can be deduced. In other words, if it's an undecorated
17472 use of a template non-type parameter. */
17475 deducible_expression (tree expr
)
17477 return (TREE_CODE (expr
) == TEMPLATE_PARM_INDEX
);
17480 /* Returns true iff the array domain DOMAIN uses a template parameter in a
17481 deducible way; that is, if it has a max value of <PARM> - 1. */
17484 deducible_array_bound (tree domain
)
17486 if (domain
== NULL_TREE
)
17489 tree max
= TYPE_MAX_VALUE (domain
);
17490 if (TREE_CODE (max
) != MINUS_EXPR
)
17493 return deducible_expression (TREE_OPERAND (max
, 0));
17496 /* Returns true iff the template arguments ARGS use a template parameter
17497 in a deducible way. */
17500 deducible_template_args (tree args
)
17502 for (int i
= 0; i
< TREE_VEC_LENGTH (args
); ++i
)
17505 tree elt
= TREE_VEC_ELT (args
, i
);
17506 if (ARGUMENT_PACK_P (elt
))
17507 deducible
= deducible_template_args (ARGUMENT_PACK_ARGS (elt
));
17510 if (PACK_EXPANSION_P (elt
))
17511 elt
= PACK_EXPANSION_PATTERN (elt
);
17512 if (TREE_CODE (elt
) == TEMPLATE_TEMPLATE_PARM
)
17514 else if (TYPE_P (elt
))
17515 deducible
= uses_deducible_template_parms (elt
);
17517 deducible
= deducible_expression (elt
);
17525 /* Returns true iff TYPE contains any deducible references to template
17526 parameters, as per 14.8.2.5. */
17529 uses_deducible_template_parms (tree type
)
17531 if (PACK_EXPANSION_P (type
))
17532 type
= PACK_EXPANSION_PATTERN (type
);
17539 if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
17540 || TREE_CODE (type
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
17546 if (POINTER_TYPE_P (type
))
17547 return uses_deducible_template_parms (TREE_TYPE (type
));
17549 /* T[integer-constant ]
17551 if (TREE_CODE (type
) == ARRAY_TYPE
)
17552 return (uses_deducible_template_parms (TREE_TYPE (type
))
17553 || deducible_array_bound (TYPE_DOMAIN (type
)));
17565 if (TYPE_PTRMEM_P (type
))
17566 return (uses_deducible_template_parms (TYPE_PTRMEM_CLASS_TYPE (type
))
17567 || (uses_deducible_template_parms
17568 (TYPE_PTRMEM_POINTED_TO_TYPE (type
))));
17570 /* template-name <T> (where template-name refers to a class template)
17571 template-name <i> (where template-name refers to a class template) */
17572 if (CLASS_TYPE_P (type
)
17573 && CLASSTYPE_TEMPLATE_INFO (type
)
17574 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (type
)))
17575 return deducible_template_args (INNERMOST_TEMPLATE_ARGS
17576 (CLASSTYPE_TI_ARGS (type
)));
17581 if (TREE_CODE (type
) == FUNCTION_TYPE
17582 || TREE_CODE (type
) == METHOD_TYPE
)
17584 if (uses_deducible_template_parms (TREE_TYPE (type
)))
17586 tree parm
= TYPE_ARG_TYPES (type
);
17587 if (TREE_CODE (type
) == METHOD_TYPE
)
17588 parm
= TREE_CHAIN (parm
);
17589 for (; parm
; parm
= TREE_CHAIN (parm
))
17590 if (uses_deducible_template_parms (TREE_VALUE (parm
)))
17597 /* Subroutine of type_unification_real and unify_pack_expansion to
17598 handle unification of a single P/A pair. Parameters are as
17599 for those functions. */
17602 unify_one_argument (tree tparms
, tree targs
, tree parm
, tree arg
,
17603 int subr
, unification_kind_t strict
,
17606 tree arg_expr
= NULL_TREE
;
17609 if (arg
== error_mark_node
|| parm
== error_mark_node
)
17610 return unify_invalid (explain_p
);
17611 if (arg
== unknown_type_node
)
17612 /* We can't deduce anything from this, but we might get all the
17613 template args from other function args. */
17614 return unify_success (explain_p
);
17616 /* Implicit conversions (Clause 4) will be performed on a function
17617 argument to convert it to the type of the corresponding function
17618 parameter if the parameter type contains no template-parameters that
17619 participate in template argument deduction. */
17620 if (strict
!= DEDUCE_EXACT
17621 && TYPE_P (parm
) && !uses_deducible_template_parms (parm
))
17622 /* For function parameters with no deducible template parameters,
17623 just return. We'll check non-dependent conversions later. */
17624 return unify_success (explain_p
);
17629 arg_strict
= (UNIFY_ALLOW_OUTER_LEVEL
17630 | UNIFY_ALLOW_MORE_CV_QUAL
17631 | UNIFY_ALLOW_DERIVED
);
17635 arg_strict
= UNIFY_ALLOW_LESS_CV_QUAL
;
17639 arg_strict
= UNIFY_ALLOW_NONE
;
17643 gcc_unreachable ();
17646 /* We only do these transformations if this is the top-level
17647 parameter_type_list in a call or declaration matching; in other
17648 situations (nested function declarators, template argument lists) we
17649 won't be comparing a type to an expression, and we don't do any type
17655 gcc_assert (TREE_TYPE (arg
) != NULL_TREE
);
17656 if (type_unknown_p (arg
))
17658 /* [temp.deduct.type] A template-argument can be
17659 deduced from a pointer to function or pointer
17660 to member function argument if the set of
17661 overloaded functions does not contain function
17662 templates and at most one of a set of
17663 overloaded functions provides a unique
17666 if (resolve_overloaded_unification
17667 (tparms
, targs
, parm
, arg
, strict
,
17668 arg_strict
, explain_p
))
17669 return unify_success (explain_p
);
17670 return unify_overload_resolution_failure (explain_p
, arg
);
17674 arg
= unlowered_expr_type (arg
);
17675 if (arg
== error_mark_node
)
17676 return unify_invalid (explain_p
);
17680 maybe_adjust_types_for_deduction (strict
, &parm
, &arg
, arg_expr
);
17683 if ((TYPE_P (parm
) || TREE_CODE (parm
) == TEMPLATE_DECL
)
17684 != (TYPE_P (arg
) || TREE_CODE (arg
) == TEMPLATE_DECL
))
17685 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
17687 /* For deduction from an init-list we need the actual list. */
17688 if (arg_expr
&& BRACE_ENCLOSED_INITIALIZER_P (arg_expr
))
17690 return unify (tparms
, targs
, parm
, arg
, arg_strict
, explain_p
);
17693 /* Most parms like fn_type_unification.
17695 If SUBR is 1, we're being called recursively (to unify the
17696 arguments of a function or method parameter of a function
17699 CHECKS is a pointer to a vector of access checks encountered while
17700 substituting default template arguments. */
17703 type_unification_real (tree tparms
,
17707 unsigned int xnargs
,
17709 unification_kind_t strict
,
17711 vec
<deferred_access_check
, va_gc
> **checks
,
17716 int ntparms
= TREE_VEC_LENGTH (tparms
);
17717 int saw_undeduced
= 0;
17720 unsigned int nargs
;
17723 gcc_assert (TREE_CODE (tparms
) == TREE_VEC
);
17724 gcc_assert (xparms
== NULL_TREE
|| TREE_CODE (xparms
) == TREE_LIST
);
17725 gcc_assert (ntparms
> 0);
17727 /* Reset the number of non-defaulted template arguments contained
17729 NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
) = NULL_TREE
;
17737 while (parms
&& parms
!= void_list_node
17740 parm
= TREE_VALUE (parms
);
17742 if (TREE_CODE (parm
) == TYPE_PACK_EXPANSION
17743 && (!TREE_CHAIN (parms
) || TREE_CHAIN (parms
) == void_list_node
))
17744 /* For a function parameter pack that occurs at the end of the
17745 parameter-declaration-list, the type A of each remaining
17746 argument of the call is compared with the type P of the
17747 declarator-id of the function parameter pack. */
17750 parms
= TREE_CHAIN (parms
);
17752 if (TREE_CODE (parm
) == TYPE_PACK_EXPANSION
)
17753 /* For a function parameter pack that does not occur at the
17754 end of the parameter-declaration-list, the type of the
17755 parameter pack is a non-deduced context. */
17761 if (unify_one_argument (tparms
, targs
, parm
, arg
, subr
, strict
,
17767 && parms
!= void_list_node
17768 && TREE_CODE (TREE_VALUE (parms
)) == TYPE_PACK_EXPANSION
)
17770 /* Unify the remaining arguments with the pack expansion type. */
17772 tree parmvec
= make_tree_vec (1);
17774 /* Allocate a TREE_VEC and copy in all of the arguments */
17775 argvec
= make_tree_vec (nargs
- ia
);
17776 for (i
= 0; ia
< nargs
; ++ia
, ++i
)
17777 TREE_VEC_ELT (argvec
, i
) = args
[ia
];
17779 /* Copy the parameter into parmvec. */
17780 TREE_VEC_ELT (parmvec
, 0) = TREE_VALUE (parms
);
17781 if (unify_pack_expansion (tparms
, targs
, parmvec
, argvec
, strict
,
17782 /*subr=*/subr
, explain_p
))
17785 /* Advance to the end of the list of parameters. */
17786 parms
= TREE_CHAIN (parms
);
17789 /* Fail if we've reached the end of the parm list, and more args
17790 are present, and the parm list isn't variadic. */
17791 if (ia
< nargs
&& parms
== void_list_node
)
17792 return unify_too_many_arguments (explain_p
, nargs
, ia
);
17793 /* Fail if parms are left and they don't have default values and
17794 they aren't all deduced as empty packs (c++/57397). This is
17795 consistent with sufficient_parms_p. */
17796 if (parms
&& parms
!= void_list_node
17797 && TREE_PURPOSE (parms
) == NULL_TREE
)
17799 unsigned int count
= nargs
;
17804 type_pack_p
= TREE_CODE (TREE_VALUE (p
)) == TYPE_PACK_EXPANSION
;
17807 p
= TREE_CHAIN (p
);
17809 while (p
&& p
!= void_list_node
);
17810 if (count
!= nargs
)
17811 return unify_too_few_arguments (explain_p
, ia
, count
,
17817 tsubst_flags_t complain
= (explain_p
17818 ? tf_warning_or_error
17821 for (i
= 0; i
< ntparms
; i
++)
17823 tree targ
= TREE_VEC_ELT (targs
, i
);
17824 tree tparm
= TREE_VEC_ELT (tparms
, i
);
17826 /* Clear the "incomplete" flags on all argument packs now so that
17827 substituting them into later default arguments works. */
17828 if (targ
&& ARGUMENT_PACK_P (targ
))
17830 ARGUMENT_PACK_INCOMPLETE_P (targ
) = 0;
17831 ARGUMENT_PACK_EXPLICIT_ARGS (targ
) = NULL_TREE
;
17834 if (targ
|| tparm
== error_mark_node
)
17836 tparm
= TREE_VALUE (tparm
);
17838 /* If this is an undeduced nontype parameter that depends on
17839 a type parameter, try another pass; its type may have been
17840 deduced from a later argument than the one from which
17841 this parameter can be deduced. */
17842 if (TREE_CODE (tparm
) == PARM_DECL
17843 && uses_template_parms (TREE_TYPE (tparm
))
17844 && saw_undeduced
< 2)
17850 /* Core issue #226 (C++0x) [temp.deduct]:
17852 If a template argument has not been deduced, its
17853 default template argument, if any, is used.
17855 When we are in C++98 mode, TREE_PURPOSE will either
17856 be NULL_TREE or ERROR_MARK_NODE, so we do not need
17857 to explicitly check cxx_dialect here. */
17858 if (TREE_PURPOSE (TREE_VEC_ELT (tparms
, i
)))
17859 /* OK, there is a default argument. Wait until after the
17860 conversion check to do substitution. */
17863 /* If the type parameter is a parameter pack, then it will
17864 be deduced to an empty parameter pack. */
17865 if (template_parameter_pack_p (tparm
))
17869 if (TREE_CODE (tparm
) == TEMPLATE_PARM_INDEX
)
17871 arg
= make_node (NONTYPE_ARGUMENT_PACK
);
17872 TREE_TYPE (arg
) = TREE_TYPE (TEMPLATE_PARM_DECL (tparm
));
17873 TREE_CONSTANT (arg
) = 1;
17876 arg
= cxx_make_type (TYPE_ARGUMENT_PACK
);
17878 SET_ARGUMENT_PACK_ARGS (arg
, make_tree_vec (0));
17880 TREE_VEC_ELT (targs
, i
) = arg
;
17884 return unify_parameter_deduction_failure (explain_p
, tparm
);
17887 /* DR 1391: All parameters have args, now check non-dependent parms for
17889 if (saw_undeduced
< 2)
17890 for (ia
= 0, parms
= xparms
, args
= xargs
, nargs
= xnargs
;
17891 parms
&& parms
!= void_list_node
&& ia
< nargs
; )
17893 parm
= TREE_VALUE (parms
);
17895 if (TREE_CODE (parm
) == TYPE_PACK_EXPANSION
17896 && (!TREE_CHAIN (parms
)
17897 || TREE_CHAIN (parms
) == void_list_node
))
17898 /* For a function parameter pack that occurs at the end of the
17899 parameter-declaration-list, the type A of each remaining
17900 argument of the call is compared with the type P of the
17901 declarator-id of the function parameter pack. */
17904 parms
= TREE_CHAIN (parms
);
17906 if (TREE_CODE (parm
) == TYPE_PACK_EXPANSION
)
17907 /* For a function parameter pack that does not occur at the
17908 end of the parameter-declaration-list, the type of the
17909 parameter pack is a non-deduced context. */
17915 if (uses_template_parms (parm
))
17917 if (check_non_deducible_conversion (parm
, arg
, strict
, flags
,
17922 /* Now substitute into the default template arguments. */
17923 for (i
= 0; i
< ntparms
; i
++)
17925 tree targ
= TREE_VEC_ELT (targs
, i
);
17926 tree tparm
= TREE_VEC_ELT (tparms
, i
);
17928 if (targ
|| tparm
== error_mark_node
)
17930 tree parm
= TREE_VALUE (tparm
);
17932 if (TREE_CODE (parm
) == PARM_DECL
17933 && uses_template_parms (TREE_TYPE (parm
))
17934 && saw_undeduced
< 2)
17937 tree arg
= TREE_PURPOSE (tparm
);
17938 reopen_deferring_access_checks (*checks
);
17939 location_t save_loc
= input_location
;
17941 input_location
= DECL_SOURCE_LOCATION (parm
);
17942 arg
= tsubst_template_arg (arg
, targs
, complain
, NULL_TREE
);
17943 arg
= convert_template_argument (parm
, arg
, targs
, complain
,
17945 input_location
= save_loc
;
17946 *checks
= get_deferred_access_checks ();
17947 pop_deferring_access_checks ();
17948 if (arg
== error_mark_node
)
17952 TREE_VEC_ELT (targs
, i
) = arg
;
17953 /* The position of the first default template argument,
17954 is also the number of non-defaulted arguments in TARGS.
17956 if (!NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
))
17957 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
, i
);
17962 if (saw_undeduced
++ == 1)
17965 #ifdef ENABLE_CHECKING
17966 if (!NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
))
17967 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
, TREE_VEC_LENGTH (targs
));
17970 return unify_success (explain_p
);
17973 /* Subroutine of type_unification_real. Args are like the variables
17974 at the call site. ARG is an overloaded function (or template-id);
17975 we try deducing template args from each of the overloads, and if
17976 only one succeeds, we go with that. Modifies TARGS and returns
17977 true on success. */
17980 resolve_overloaded_unification (tree tparms
,
17984 unification_kind_t strict
,
17988 tree tempargs
= copy_node (targs
);
17990 tree goodfn
= NULL_TREE
;
17993 if (TREE_CODE (arg
) == ADDR_EXPR
)
17995 arg
= TREE_OPERAND (arg
, 0);
18001 if (TREE_CODE (arg
) == COMPONENT_REF
)
18002 /* Handle `&x' where `x' is some static or non-static member
18004 arg
= TREE_OPERAND (arg
, 1);
18006 if (TREE_CODE (arg
) == OFFSET_REF
)
18007 arg
= TREE_OPERAND (arg
, 1);
18009 /* Strip baselink information. */
18010 if (BASELINK_P (arg
))
18011 arg
= BASELINK_FUNCTIONS (arg
);
18013 if (TREE_CODE (arg
) == TEMPLATE_ID_EXPR
)
18015 /* If we got some explicit template args, we need to plug them into
18016 the affected templates before we try to unify, in case the
18017 explicit args will completely resolve the templates in question. */
18020 tree expl_subargs
= TREE_OPERAND (arg
, 1);
18021 arg
= TREE_OPERAND (arg
, 0);
18023 for (; arg
; arg
= OVL_NEXT (arg
))
18025 tree fn
= OVL_CURRENT (arg
);
18026 tree subargs
, elem
;
18028 if (TREE_CODE (fn
) != TEMPLATE_DECL
)
18031 subargs
= coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (fn
),
18032 expl_subargs
, NULL_TREE
, tf_none
,
18033 /*require_all_args=*/true,
18034 /*use_default_args=*/true);
18035 if (subargs
!= error_mark_node
18036 && !any_dependent_template_arguments_p (subargs
))
18038 elem
= TREE_TYPE (instantiate_template (fn
, subargs
, tf_none
));
18039 if (try_one_overload (tparms
, targs
, tempargs
, parm
,
18040 elem
, strict
, sub_strict
, addr_p
, explain_p
)
18041 && (!goodfn
|| !same_type_p (goodfn
, elem
)))
18050 /* If no templates (or more than one) are fully resolved by the
18051 explicit arguments, this template-id is a non-deduced context; it
18052 could still be OK if we deduce all template arguments for the
18053 enclosing call through other arguments. */
18057 else if (TREE_CODE (arg
) != OVERLOAD
18058 && TREE_CODE (arg
) != FUNCTION_DECL
)
18059 /* If ARG is, for example, "(0, &f)" then its type will be unknown
18060 -- but the deduction does not succeed because the expression is
18061 not just the function on its own. */
18064 for (; arg
; arg
= OVL_NEXT (arg
))
18065 if (try_one_overload (tparms
, targs
, tempargs
, parm
,
18066 TREE_TYPE (OVL_CURRENT (arg
)),
18067 strict
, sub_strict
, addr_p
, explain_p
)
18068 && (!goodfn
|| !decls_match (goodfn
, OVL_CURRENT (arg
))))
18070 goodfn
= OVL_CURRENT (arg
);
18074 /* [temp.deduct.type] A template-argument can be deduced from a pointer
18075 to function or pointer to member function argument if the set of
18076 overloaded functions does not contain function templates and at most
18077 one of a set of overloaded functions provides a unique match.
18079 So if we found multiple possibilities, we return success but don't
18080 deduce anything. */
18084 int i
= TREE_VEC_LENGTH (targs
);
18086 if (TREE_VEC_ELT (tempargs
, i
))
18088 tree old
= TREE_VEC_ELT (targs
, i
);
18089 tree new_
= TREE_VEC_ELT (tempargs
, i
);
18090 if (new_
&& old
&& ARGUMENT_PACK_P (old
)
18091 && ARGUMENT_PACK_EXPLICIT_ARGS (old
))
18092 /* Don't forget explicit template arguments in a pack. */
18093 ARGUMENT_PACK_EXPLICIT_ARGS (new_
)
18094 = ARGUMENT_PACK_EXPLICIT_ARGS (old
);
18095 TREE_VEC_ELT (targs
, i
) = new_
;
18104 /* Core DR 115: In contexts where deduction is done and fails, or in
18105 contexts where deduction is not done, if a template argument list is
18106 specified and it, along with any default template arguments, identifies
18107 a single function template specialization, then the template-id is an
18108 lvalue for the function template specialization. */
18111 resolve_nondeduced_context (tree orig_expr
)
18113 tree expr
, offset
, baselink
;
18116 if (!type_unknown_p (orig_expr
))
18121 offset
= NULL_TREE
;
18122 baselink
= NULL_TREE
;
18124 if (TREE_CODE (expr
) == ADDR_EXPR
)
18126 expr
= TREE_OPERAND (expr
, 0);
18129 if (TREE_CODE (expr
) == OFFSET_REF
)
18132 expr
= TREE_OPERAND (expr
, 1);
18134 if (BASELINK_P (expr
))
18137 expr
= BASELINK_FUNCTIONS (expr
);
18140 if (TREE_CODE (expr
) == TEMPLATE_ID_EXPR
)
18143 tree goodfn
= NULL_TREE
;
18145 /* If we got some explicit template args, we need to plug them into
18146 the affected templates before we try to unify, in case the
18147 explicit args will completely resolve the templates in question. */
18149 tree expl_subargs
= TREE_OPERAND (expr
, 1);
18150 tree arg
= TREE_OPERAND (expr
, 0);
18151 tree badfn
= NULL_TREE
;
18152 tree badargs
= NULL_TREE
;
18154 for (; arg
; arg
= OVL_NEXT (arg
))
18156 tree fn
= OVL_CURRENT (arg
);
18157 tree subargs
, elem
;
18159 if (TREE_CODE (fn
) != TEMPLATE_DECL
)
18162 subargs
= coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (fn
),
18163 expl_subargs
, NULL_TREE
, tf_none
,
18164 /*require_all_args=*/true,
18165 /*use_default_args=*/true);
18166 if (subargs
!= error_mark_node
18167 && !any_dependent_template_arguments_p (subargs
))
18169 elem
= instantiate_template (fn
, subargs
, tf_none
);
18170 if (elem
== error_mark_node
)
18175 else if (elem
&& (!goodfn
|| !decls_match (goodfn
, elem
)))
18184 mark_used (goodfn
);
18187 expr
= build_baselink (BASELINK_BINFO (baselink
),
18188 BASELINK_ACCESS_BINFO (baselink
),
18189 expr
, BASELINK_OPTYPE (baselink
));
18193 = TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (offset
, 0)));
18194 expr
= build_offset_ref (base
, expr
, addr
, tf_warning_or_error
);
18197 expr
= cp_build_addr_expr (expr
, tf_warning_or_error
);
18200 else if (good
== 0 && badargs
)
18201 /* There were no good options and at least one bad one, so let the
18202 user know what the problem is. */
18203 instantiate_template (badfn
, badargs
, tf_warning_or_error
);
18208 /* Subroutine of resolve_overloaded_unification; does deduction for a single
18209 overload. Fills TARGS with any deduced arguments, or error_mark_node if
18210 different overloads deduce different arguments for a given parm.
18211 ADDR_P is true if the expression for which deduction is being
18212 performed was of the form "& fn" rather than simply "fn".
18214 Returns 1 on success. */
18217 try_one_overload (tree tparms
,
18222 unification_kind_t strict
,
18231 if (arg
== error_mark_node
)
18234 /* [temp.deduct.type] A template-argument can be deduced from a pointer
18235 to function or pointer to member function argument if the set of
18236 overloaded functions does not contain function templates and at most
18237 one of a set of overloaded functions provides a unique match.
18239 So if this is a template, just return success. */
18241 if (uses_template_parms (arg
))
18244 if (TREE_CODE (arg
) == METHOD_TYPE
)
18245 arg
= build_ptrmemfunc_type (build_pointer_type (arg
));
18247 arg
= build_pointer_type (arg
);
18249 sub_strict
|= maybe_adjust_types_for_deduction (strict
, &parm
, &arg
, NULL
);
18251 /* We don't copy orig_targs for this because if we have already deduced
18252 some template args from previous args, unify would complain when we
18253 try to deduce a template parameter for the same argument, even though
18254 there isn't really a conflict. */
18255 nargs
= TREE_VEC_LENGTH (targs
);
18256 tempargs
= make_tree_vec (nargs
);
18258 if (unify (tparms
, tempargs
, parm
, arg
, sub_strict
, explain_p
))
18261 /* First make sure we didn't deduce anything that conflicts with
18262 explicitly specified args. */
18263 for (i
= nargs
; i
--; )
18265 tree elt
= TREE_VEC_ELT (tempargs
, i
);
18266 tree oldelt
= TREE_VEC_ELT (orig_targs
, i
);
18270 else if (uses_template_parms (elt
))
18271 /* Since we're unifying against ourselves, we will fill in
18272 template args used in the function parm list with our own
18273 template parms. Discard them. */
18274 TREE_VEC_ELT (tempargs
, i
) = NULL_TREE
;
18275 else if (oldelt
&& !template_args_equal (oldelt
, elt
))
18279 for (i
= nargs
; i
--; )
18281 tree elt
= TREE_VEC_ELT (tempargs
, i
);
18284 TREE_VEC_ELT (targs
, i
) = elt
;
18290 /* PARM is a template class (perhaps with unbound template
18291 parameters). ARG is a fully instantiated type. If ARG can be
18292 bound to PARM, return ARG, otherwise return NULL_TREE. TPARMS and
18293 TARGS are as for unify. */
18296 try_class_unification (tree tparms
, tree targs
, tree parm
, tree arg
,
18299 tree copy_of_targs
;
18301 if (!CLASSTYPE_TEMPLATE_INFO (arg
)
18302 || (most_general_template (CLASSTYPE_TI_TEMPLATE (arg
))
18303 != most_general_template (CLASSTYPE_TI_TEMPLATE (parm
))))
18306 /* We need to make a new template argument vector for the call to
18307 unify. If we used TARGS, we'd clutter it up with the result of
18308 the attempted unification, even if this class didn't work out.
18309 We also don't want to commit ourselves to all the unifications
18310 we've already done, since unification is supposed to be done on
18311 an argument-by-argument basis. In other words, consider the
18312 following pathological case:
18314 template <int I, int J, int K>
18317 template <int I, int J>
18318 struct S<I, J, 2> : public S<I, I, I>, S<J, J, J> {};
18320 template <int I, int J, int K>
18321 void f(S<I, J, K>, S<I, I, I>);
18330 Now, by the time we consider the unification involving `s2', we
18331 already know that we must have `f<0, 0, 0>'. But, even though
18332 `S<0, 1, 2>' is derived from `S<0, 0, 0>', the code is invalid
18333 because there are two ways to unify base classes of S<0, 1, 2>
18334 with S<I, I, I>. If we kept the already deduced knowledge, we
18335 would reject the possibility I=1. */
18336 copy_of_targs
= make_tree_vec (TREE_VEC_LENGTH (targs
));
18338 /* If unification failed, we're done. */
18339 if (unify (tparms
, copy_of_targs
, CLASSTYPE_TI_ARGS (parm
),
18340 CLASSTYPE_TI_ARGS (arg
), UNIFY_ALLOW_NONE
, explain_p
))
18346 /* Given a template type PARM and a class type ARG, find the unique
18347 base type in ARG that is an instance of PARM. We do not examine
18348 ARG itself; only its base-classes. If there is not exactly one
18349 appropriate base class, return NULL_TREE. PARM may be the type of
18350 a partial specialization, as well as a plain template type. Used
18353 static enum template_base_result
18354 get_template_base (tree tparms
, tree targs
, tree parm
, tree arg
,
18355 bool explain_p
, tree
*result
)
18357 tree rval
= NULL_TREE
;
18360 gcc_assert (RECORD_OR_UNION_CODE_P (TREE_CODE (arg
)));
18362 binfo
= TYPE_BINFO (complete_type (arg
));
18365 /* The type could not be completed. */
18366 *result
= NULL_TREE
;
18367 return tbr_incomplete_type
;
18370 /* Walk in inheritance graph order. The search order is not
18371 important, and this avoids multiple walks of virtual bases. */
18372 for (binfo
= TREE_CHAIN (binfo
); binfo
; binfo
= TREE_CHAIN (binfo
))
18374 tree r
= try_class_unification (tparms
, targs
, parm
,
18375 BINFO_TYPE (binfo
), explain_p
);
18379 /* If there is more than one satisfactory baseclass, then:
18383 If they yield more than one possible deduced A, the type
18387 if (rval
&& !same_type_p (r
, rval
))
18389 *result
= NULL_TREE
;
18390 return tbr_ambiguous_baseclass
;
18398 return tbr_success
;
18401 /* Returns the level of DECL, which declares a template parameter. */
18404 template_decl_level (tree decl
)
18406 switch (TREE_CODE (decl
))
18409 case TEMPLATE_DECL
:
18410 return TEMPLATE_TYPE_LEVEL (TREE_TYPE (decl
));
18413 return TEMPLATE_PARM_LEVEL (DECL_INITIAL (decl
));
18416 gcc_unreachable ();
18421 /* Decide whether ARG can be unified with PARM, considering only the
18422 cv-qualifiers of each type, given STRICT as documented for unify.
18423 Returns nonzero iff the unification is OK on that basis. */
18426 check_cv_quals_for_unify (int strict
, tree arg
, tree parm
)
18428 int arg_quals
= cp_type_quals (arg
);
18429 int parm_quals
= cp_type_quals (parm
);
18431 if (TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
18432 && !(strict
& UNIFY_ALLOW_OUTER_MORE_CV_QUAL
))
18434 /* Although a CVR qualifier is ignored when being applied to a
18435 substituted template parameter ([8.3.2]/1 for example), that
18436 does not allow us to unify "const T" with "int&" because both
18437 types are not of the form "cv-list T" [14.8.2.5 temp.deduct.type].
18438 It is ok when we're allowing additional CV qualifiers
18439 at the outer level [14.8.2.1]/3,1st bullet. */
18440 if ((TREE_CODE (arg
) == REFERENCE_TYPE
18441 || TREE_CODE (arg
) == FUNCTION_TYPE
18442 || TREE_CODE (arg
) == METHOD_TYPE
)
18443 && (parm_quals
& (TYPE_QUAL_CONST
| TYPE_QUAL_VOLATILE
)))
18446 if ((!POINTER_TYPE_P (arg
) && TREE_CODE (arg
) != TEMPLATE_TYPE_PARM
)
18447 && (parm_quals
& TYPE_QUAL_RESTRICT
))
18451 if (!(strict
& (UNIFY_ALLOW_MORE_CV_QUAL
| UNIFY_ALLOW_OUTER_MORE_CV_QUAL
))
18452 && (arg_quals
& parm_quals
) != parm_quals
)
18455 if (!(strict
& (UNIFY_ALLOW_LESS_CV_QUAL
| UNIFY_ALLOW_OUTER_LESS_CV_QUAL
))
18456 && (parm_quals
& arg_quals
) != arg_quals
)
18462 /* Determines the LEVEL and INDEX for the template parameter PARM. */
18464 template_parm_level_and_index (tree parm
, int* level
, int* index
)
18466 if (TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
18467 || TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
18468 || TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
18470 *index
= TEMPLATE_TYPE_IDX (parm
);
18471 *level
= TEMPLATE_TYPE_LEVEL (parm
);
18475 *index
= TEMPLATE_PARM_IDX (parm
);
18476 *level
= TEMPLATE_PARM_LEVEL (parm
);
18480 #define RECUR_AND_CHECK_FAILURE(TP, TA, P, A, S, EP) \
18482 if (unify (TP, TA, P, A, S, EP)) \
18486 /* Unifies the remaining arguments in PACKED_ARGS with the pack
18487 expansion at the end of PACKED_PARMS. Returns 0 if the type
18488 deduction succeeds, 1 otherwise. STRICT is the same as in
18489 unify. CALL_ARGS_P is true iff PACKED_ARGS is actually a function
18490 call argument list. We'll need to adjust the arguments to make them
18491 types. SUBR tells us if this is from a recursive call to
18492 type_unification_real, or for comparing two template argument
18496 unify_pack_expansion (tree tparms
, tree targs
, tree packed_parms
,
18497 tree packed_args
, unification_kind_t strict
,
18498 bool subr
, bool explain_p
)
18501 = TREE_VEC_ELT (packed_parms
, TREE_VEC_LENGTH (packed_parms
) - 1);
18502 tree pattern
= PACK_EXPANSION_PATTERN (parm
);
18503 tree pack
, packs
= NULL_TREE
;
18504 int i
, start
= TREE_VEC_LENGTH (packed_parms
) - 1;
18506 packed_args
= expand_template_argument_pack (packed_args
);
18508 int len
= TREE_VEC_LENGTH (packed_args
);
18510 /* Determine the parameter packs we will be deducing from the
18511 pattern, and record their current deductions. */
18512 for (pack
= PACK_EXPANSION_PARAMETER_PACKS (parm
);
18513 pack
; pack
= TREE_CHAIN (pack
))
18515 tree parm_pack
= TREE_VALUE (pack
);
18518 /* Determine the index and level of this parameter pack. */
18519 template_parm_level_and_index (parm_pack
, &level
, &idx
);
18521 /* Keep track of the parameter packs and their corresponding
18523 packs
= tree_cons (parm_pack
, TMPL_ARG (targs
, level
, idx
), packs
);
18524 TREE_TYPE (packs
) = make_tree_vec (len
- start
);
18527 /* Loop through all of the arguments that have not yet been
18528 unified and unify each with the pattern. */
18529 for (i
= start
; i
< len
; i
++)
18532 bool any_explicit
= false;
18533 tree arg
= TREE_VEC_ELT (packed_args
, i
);
18535 /* For each parameter pack, set its TMPL_ARG to either NULL_TREE
18536 or the element of its argument pack at the current index if
18537 this argument was explicitly specified. */
18538 for (pack
= packs
; pack
; pack
= TREE_CHAIN (pack
))
18542 template_parm_level_and_index (TREE_PURPOSE (pack
), &level
, &idx
);
18545 if (TREE_VALUE (pack
)
18546 && (pargs
= ARGUMENT_PACK_EXPLICIT_ARGS (TREE_VALUE (pack
)))
18547 && (i
- start
< TREE_VEC_LENGTH (pargs
)))
18549 any_explicit
= true;
18550 arg
= TREE_VEC_ELT (pargs
, i
- start
);
18552 TMPL_ARG (targs
, level
, idx
) = arg
;
18555 /* If we had explicit template arguments, substitute them into the
18556 pattern before deduction. */
18559 /* Some arguments might still be unspecified or dependent. */
18561 ++processing_template_decl
;
18562 dependent
= any_dependent_template_arguments_p (targs
);
18564 --processing_template_decl
;
18565 parm
= tsubst (pattern
, targs
,
18566 explain_p
? tf_warning_or_error
: tf_none
,
18569 --processing_template_decl
;
18570 if (parm
== error_mark_node
)
18576 /* Unify the pattern with the current argument. */
18577 if (unify_one_argument (tparms
, targs
, parm
, arg
, subr
, strict
,
18581 /* For each parameter pack, collect the deduced value. */
18582 for (pack
= packs
; pack
; pack
= TREE_CHAIN (pack
))
18585 template_parm_level_and_index (TREE_PURPOSE (pack
), &level
, &idx
);
18587 TREE_VEC_ELT (TREE_TYPE (pack
), i
- start
) =
18588 TMPL_ARG (targs
, level
, idx
);
18592 /* Verify that the results of unification with the parameter packs
18593 produce results consistent with what we've seen before, and make
18594 the deduced argument packs available. */
18595 for (pack
= packs
; pack
; pack
= TREE_CHAIN (pack
))
18597 tree old_pack
= TREE_VALUE (pack
);
18598 tree new_args
= TREE_TYPE (pack
);
18599 int i
, len
= TREE_VEC_LENGTH (new_args
);
18601 bool nondeduced_p
= false;
18603 /* By default keep the original deduced argument pack.
18604 If necessary, more specific code is going to update the
18605 resulting deduced argument later down in this function. */
18606 template_parm_level_and_index (TREE_PURPOSE (pack
), &level
, &idx
);
18607 TMPL_ARG (targs
, level
, idx
) = old_pack
;
18609 /* If NEW_ARGS contains any NULL_TREE entries, we didn't
18610 actually deduce anything. */
18611 for (i
= 0; i
< len
&& !nondeduced_p
; ++i
)
18612 if (TREE_VEC_ELT (new_args
, i
) == NULL_TREE
)
18613 nondeduced_p
= true;
18617 if (old_pack
&& ARGUMENT_PACK_INCOMPLETE_P (old_pack
))
18619 /* If we had fewer function args than explicit template args,
18620 just use the explicits. */
18621 tree explicit_args
= ARGUMENT_PACK_EXPLICIT_ARGS (old_pack
);
18622 int explicit_len
= TREE_VEC_LENGTH (explicit_args
);
18623 if (len
< explicit_len
)
18624 new_args
= explicit_args
;
18630 /* Build the deduced *_ARGUMENT_PACK. */
18631 if (TREE_CODE (TREE_PURPOSE (pack
)) == TEMPLATE_PARM_INDEX
)
18633 result
= make_node (NONTYPE_ARGUMENT_PACK
);
18634 TREE_TYPE (result
) =
18635 TREE_TYPE (TEMPLATE_PARM_DECL (TREE_PURPOSE (pack
)));
18636 TREE_CONSTANT (result
) = 1;
18639 result
= cxx_make_type (TYPE_ARGUMENT_PACK
);
18641 SET_ARGUMENT_PACK_ARGS (result
, new_args
);
18643 /* Note the deduced argument packs for this parameter
18645 TMPL_ARG (targs
, level
, idx
) = result
;
18647 else if (ARGUMENT_PACK_INCOMPLETE_P (old_pack
)
18648 && (ARGUMENT_PACK_ARGS (old_pack
)
18649 == ARGUMENT_PACK_EXPLICIT_ARGS (old_pack
)))
18651 /* We only had the explicitly-provided arguments before, but
18652 now we have a complete set of arguments. */
18653 tree explicit_args
= ARGUMENT_PACK_EXPLICIT_ARGS (old_pack
);
18655 SET_ARGUMENT_PACK_ARGS (old_pack
, new_args
);
18656 ARGUMENT_PACK_INCOMPLETE_P (old_pack
) = 1;
18657 ARGUMENT_PACK_EXPLICIT_ARGS (old_pack
) = explicit_args
;
18661 tree bad_old_arg
= NULL_TREE
, bad_new_arg
= NULL_TREE
;
18662 tree old_args
= ARGUMENT_PACK_ARGS (old_pack
);
18664 if (!comp_template_args_with_info (old_args
, new_args
,
18665 &bad_old_arg
, &bad_new_arg
))
18666 /* Inconsistent unification of this parameter pack. */
18667 return unify_parameter_pack_inconsistent (explain_p
,
18673 return unify_success (explain_p
);
18676 /* Handle unification of the domain of an array. PARM_DOM and ARG_DOM are
18677 INTEGER_TYPEs representing the TYPE_DOMAIN of ARRAY_TYPEs. The other
18678 parameters and return value are as for unify. */
18681 unify_array_domain (tree tparms
, tree targs
,
18682 tree parm_dom
, tree arg_dom
,
18690 /* Our representation of array types uses "N - 1" as the
18691 TYPE_MAX_VALUE for an array with "N" elements, if "N" is
18692 not an integer constant. We cannot unify arbitrarily
18693 complex expressions, so we eliminate the MINUS_EXPRs
18695 parm_max
= TYPE_MAX_VALUE (parm_dom
);
18696 parm_cst
= TREE_CODE (parm_max
) == INTEGER_CST
;
18699 gcc_assert (TREE_CODE (parm_max
) == MINUS_EXPR
);
18700 parm_max
= TREE_OPERAND (parm_max
, 0);
18702 arg_max
= TYPE_MAX_VALUE (arg_dom
);
18703 arg_cst
= TREE_CODE (arg_max
) == INTEGER_CST
;
18706 /* The ARG_MAX may not be a simple MINUS_EXPR, if we are
18707 trying to unify the type of a variable with the type
18708 of a template parameter. For example:
18710 template <unsigned int N>
18711 void f (char (&) [N]);
18718 Here, the type of the ARG will be "int [g(i)]", and
18719 may be a SAVE_EXPR, etc. */
18720 if (TREE_CODE (arg_max
) != MINUS_EXPR
)
18721 return unify_vla_arg (explain_p
, arg_dom
);
18722 arg_max
= TREE_OPERAND (arg_max
, 0);
18725 /* If only one of the bounds used a MINUS_EXPR, compensate
18726 by adding one to the other bound. */
18727 if (parm_cst
&& !arg_cst
)
18728 parm_max
= fold_build2_loc (input_location
, PLUS_EXPR
,
18732 else if (arg_cst
&& !parm_cst
)
18733 arg_max
= fold_build2_loc (input_location
, PLUS_EXPR
,
18738 return unify (tparms
, targs
, parm_max
, arg_max
,
18739 UNIFY_ALLOW_INTEGER
, explain_p
);
18742 /* Deduce the value of template parameters. TPARMS is the (innermost)
18743 set of template parameters to a template. TARGS is the bindings
18744 for those template parameters, as determined thus far; TARGS may
18745 include template arguments for outer levels of template parameters
18746 as well. PARM is a parameter to a template function, or a
18747 subcomponent of that parameter; ARG is the corresponding argument.
18748 This function attempts to match PARM with ARG in a manner
18749 consistent with the existing assignments in TARGS. If more values
18750 are deduced, then TARGS is updated.
18752 Returns 0 if the type deduction succeeds, 1 otherwise. The
18753 parameter STRICT is a bitwise or of the following flags:
18756 Require an exact match between PARM and ARG.
18757 UNIFY_ALLOW_MORE_CV_QUAL:
18758 Allow the deduced ARG to be more cv-qualified (by qualification
18759 conversion) than ARG.
18760 UNIFY_ALLOW_LESS_CV_QUAL:
18761 Allow the deduced ARG to be less cv-qualified than ARG.
18762 UNIFY_ALLOW_DERIVED:
18763 Allow the deduced ARG to be a template base class of ARG,
18764 or a pointer to a template base class of the type pointed to by
18766 UNIFY_ALLOW_INTEGER:
18767 Allow any integral type to be deduced. See the TEMPLATE_PARM_INDEX
18768 case for more information.
18769 UNIFY_ALLOW_OUTER_LEVEL:
18770 This is the outermost level of a deduction. Used to determine validity
18771 of qualification conversions. A valid qualification conversion must
18772 have const qualified pointers leading up to the inner type which
18773 requires additional CV quals, except at the outer level, where const
18774 is not required [conv.qual]. It would be normal to set this flag in
18775 addition to setting UNIFY_ALLOW_MORE_CV_QUAL.
18776 UNIFY_ALLOW_OUTER_MORE_CV_QUAL:
18777 This is the outermost level of a deduction, and PARM can be more CV
18778 qualified at this point.
18779 UNIFY_ALLOW_OUTER_LESS_CV_QUAL:
18780 This is the outermost level of a deduction, and PARM can be less CV
18781 qualified at this point. */
18784 unify (tree tparms
, tree targs
, tree parm
, tree arg
, int strict
,
18790 int strict_in
= strict
;
18792 /* I don't think this will do the right thing with respect to types.
18793 But the only case I've seen it in so far has been array bounds, where
18794 signedness is the only information lost, and I think that will be
18796 while (TREE_CODE (parm
) == NOP_EXPR
)
18797 parm
= TREE_OPERAND (parm
, 0);
18799 if (arg
== error_mark_node
)
18800 return unify_invalid (explain_p
);
18801 if (arg
== unknown_type_node
18802 || arg
== init_list_type_node
)
18803 /* We can't deduce anything from this, but we might get all the
18804 template args from other function args. */
18805 return unify_success (explain_p
);
18807 /* If PARM uses template parameters, then we can't bail out here,
18808 even if ARG == PARM, since we won't record unifications for the
18809 template parameters. We might need them if we're trying to
18810 figure out which of two things is more specialized. */
18811 if (arg
== parm
&& !uses_template_parms (parm
))
18812 return unify_success (explain_p
);
18814 /* Handle init lists early, so the rest of the function can assume
18815 we're dealing with a type. */
18816 if (BRACE_ENCLOSED_INITIALIZER_P (arg
))
18820 tree orig_parm
= parm
;
18822 /* Replace T with std::initializer_list<T> for deduction. */
18823 if (TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
18824 && flag_deduce_init_list
)
18825 parm
= listify (parm
);
18827 if (!is_std_init_list (parm
)
18828 && TREE_CODE (parm
) != ARRAY_TYPE
)
18829 /* We can only deduce from an initializer list argument if the
18830 parameter is std::initializer_list or an array; otherwise this
18831 is a non-deduced context. */
18832 return unify_success (explain_p
);
18834 if (TREE_CODE (parm
) == ARRAY_TYPE
)
18835 elttype
= TREE_TYPE (parm
);
18838 elttype
= TREE_VEC_ELT (CLASSTYPE_TI_ARGS (parm
), 0);
18839 /* Deduction is defined in terms of a single type, so just punt
18840 on the (bizarre) std::initializer_list<T...>. */
18841 if (PACK_EXPANSION_P (elttype
))
18842 return unify_success (explain_p
);
18845 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (arg
), i
, elt
)
18847 int elt_strict
= strict
;
18849 if (elt
== error_mark_node
)
18850 return unify_invalid (explain_p
);
18852 if (!BRACE_ENCLOSED_INITIALIZER_P (elt
))
18854 tree type
= TREE_TYPE (elt
);
18855 if (type
== error_mark_node
)
18856 return unify_invalid (explain_p
);
18857 /* It should only be possible to get here for a call. */
18858 gcc_assert (elt_strict
& UNIFY_ALLOW_OUTER_LEVEL
);
18859 elt_strict
|= maybe_adjust_types_for_deduction
18860 (DEDUCE_CALL
, &elttype
, &type
, elt
);
18864 RECUR_AND_CHECK_FAILURE (tparms
, targs
, elttype
, elt
, elt_strict
,
18868 if (TREE_CODE (parm
) == ARRAY_TYPE
18869 && deducible_array_bound (TYPE_DOMAIN (parm
)))
18871 /* Also deduce from the length of the initializer list. */
18872 tree max
= size_int (CONSTRUCTOR_NELTS (arg
));
18873 tree idx
= compute_array_index_type (NULL_TREE
, max
, tf_none
);
18874 if (idx
== error_mark_node
)
18875 return unify_invalid (explain_p
);
18876 return unify_array_domain (tparms
, targs
, TYPE_DOMAIN (parm
),
18880 /* If the std::initializer_list<T> deduction worked, replace the
18881 deduced A with std::initializer_list<A>. */
18882 if (orig_parm
!= parm
)
18884 idx
= TEMPLATE_TYPE_IDX (orig_parm
);
18885 targ
= TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
);
18886 targ
= listify (targ
);
18887 TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
) = targ
;
18889 return unify_success (explain_p
);
18892 /* Immediately reject some pairs that won't unify because of
18893 cv-qualification mismatches. */
18894 if (TREE_CODE (arg
) == TREE_CODE (parm
)
18896 /* It is the elements of the array which hold the cv quals of an array
18897 type, and the elements might be template type parms. We'll check
18898 when we recurse. */
18899 && TREE_CODE (arg
) != ARRAY_TYPE
18900 /* We check the cv-qualifiers when unifying with template type
18901 parameters below. We want to allow ARG `const T' to unify with
18902 PARM `T' for example, when computing which of two templates
18903 is more specialized, for example. */
18904 && TREE_CODE (arg
) != TEMPLATE_TYPE_PARM
18905 && !check_cv_quals_for_unify (strict_in
, arg
, parm
))
18906 return unify_cv_qual_mismatch (explain_p
, parm
, arg
);
18908 if (!(strict
& UNIFY_ALLOW_OUTER_LEVEL
)
18909 && TYPE_P (parm
) && !CP_TYPE_CONST_P (parm
))
18910 strict
&= ~UNIFY_ALLOW_MORE_CV_QUAL
;
18911 strict
&= ~UNIFY_ALLOW_OUTER_LEVEL
;
18912 strict
&= ~UNIFY_ALLOW_DERIVED
;
18913 strict
&= ~UNIFY_ALLOW_OUTER_MORE_CV_QUAL
;
18914 strict
&= ~UNIFY_ALLOW_OUTER_LESS_CV_QUAL
;
18916 switch (TREE_CODE (parm
))
18918 case TYPENAME_TYPE
:
18920 case UNBOUND_CLASS_TEMPLATE
:
18921 /* In a type which contains a nested-name-specifier, template
18922 argument values cannot be deduced for template parameters used
18923 within the nested-name-specifier. */
18924 return unify_success (explain_p
);
18926 case TEMPLATE_TYPE_PARM
:
18927 case TEMPLATE_TEMPLATE_PARM
:
18928 case BOUND_TEMPLATE_TEMPLATE_PARM
:
18929 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, 0));
18930 if (error_operand_p (tparm
))
18931 return unify_invalid (explain_p
);
18933 if (TEMPLATE_TYPE_LEVEL (parm
)
18934 != template_decl_level (tparm
))
18935 /* The PARM is not one we're trying to unify. Just check
18936 to see if it matches ARG. */
18938 if (TREE_CODE (arg
) == TREE_CODE (parm
)
18939 && (is_auto (parm
) ? is_auto (arg
)
18940 : same_type_p (parm
, arg
)))
18941 return unify_success (explain_p
);
18943 return unify_type_mismatch (explain_p
, parm
, arg
);
18945 idx
= TEMPLATE_TYPE_IDX (parm
);
18946 targ
= TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
);
18947 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, idx
));
18948 if (error_operand_p (tparm
))
18949 return unify_invalid (explain_p
);
18951 /* Check for mixed types and values. */
18952 if ((TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
18953 && TREE_CODE (tparm
) != TYPE_DECL
)
18954 || (TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
18955 && TREE_CODE (tparm
) != TEMPLATE_DECL
))
18956 gcc_unreachable ();
18958 if (TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
18960 /* ARG must be constructed from a template class or a template
18961 template parameter. */
18962 if (TREE_CODE (arg
) != BOUND_TEMPLATE_TEMPLATE_PARM
18963 && !CLASSTYPE_SPECIALIZATION_OF_PRIMARY_TEMPLATE_P (arg
))
18964 return unify_template_deduction_failure (explain_p
, parm
, arg
);
18966 tree parmvec
= TYPE_TI_ARGS (parm
);
18967 /* An alias template name is never deduced. */
18968 if (TYPE_ALIAS_P (arg
))
18969 arg
= strip_typedefs (arg
);
18970 tree argvec
= INNERMOST_TEMPLATE_ARGS (TYPE_TI_ARGS (arg
));
18971 tree full_argvec
= add_to_template_args (targs
, argvec
);
18973 = DECL_INNERMOST_TEMPLATE_PARMS
18974 (TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL (parm
));
18976 int parm_variadic_p
= 0;
18978 /* The resolution to DR150 makes clear that default
18979 arguments for an N-argument may not be used to bind T
18980 to a template template parameter with fewer than N
18981 parameters. It is not safe to permit the binding of
18982 default arguments as an extension, as that may change
18983 the meaning of a conforming program. Consider:
18985 struct Dense { static const unsigned int dim = 1; };
18987 template <template <typename> class View,
18989 void operator+(float, View<Block> const&);
18991 template <typename Block,
18992 unsigned int Dim = Block::dim>
18993 struct Lvalue_proxy { operator float() const; };
18997 Lvalue_proxy<Dense> p;
19002 Here, if Lvalue_proxy is permitted to bind to View, then
19003 the global operator+ will be used; if they are not, the
19004 Lvalue_proxy will be converted to float. */
19005 if (coerce_template_parms (parm_parms
,
19007 TYPE_TI_TEMPLATE (parm
),
19009 ? tf_warning_or_error
19011 /*require_all_args=*/true,
19012 /*use_default_args=*/false)
19013 == error_mark_node
)
19016 /* Deduce arguments T, i from TT<T> or TT<i>.
19017 We check each element of PARMVEC and ARGVEC individually
19018 rather than the whole TREE_VEC since they can have
19019 different number of elements. */
19021 parmvec
= expand_template_argument_pack (parmvec
);
19022 argvec
= expand_template_argument_pack (argvec
);
19024 len
= TREE_VEC_LENGTH (parmvec
);
19026 /* Check if the parameters end in a pack, making them
19029 && PACK_EXPANSION_P (TREE_VEC_ELT (parmvec
, len
- 1)))
19030 parm_variadic_p
= 1;
19032 for (i
= 0; i
< len
- parm_variadic_p
; ++i
)
19033 /* If the template argument list of P contains a pack
19034 expansion that is not the last template argument, the
19035 entire template argument list is a non-deduced
19037 if (PACK_EXPANSION_P (TREE_VEC_ELT (parmvec
, i
)))
19038 return unify_success (explain_p
);
19040 if (TREE_VEC_LENGTH (argvec
) < len
- parm_variadic_p
)
19041 return unify_too_few_arguments (explain_p
,
19042 TREE_VEC_LENGTH (argvec
), len
);
19044 for (i
= 0; i
< len
- parm_variadic_p
; ++i
)
19046 RECUR_AND_CHECK_FAILURE (tparms
, targs
,
19047 TREE_VEC_ELT (parmvec
, i
),
19048 TREE_VEC_ELT (argvec
, i
),
19049 UNIFY_ALLOW_NONE
, explain_p
);
19052 if (parm_variadic_p
19053 && unify_pack_expansion (tparms
, targs
,
19056 /*subr=*/true, explain_p
))
19059 arg
= TYPE_TI_TEMPLATE (arg
);
19061 /* Fall through to deduce template name. */
19064 if (TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
19065 || TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
19067 /* Deduce template name TT from TT, TT<>, TT<T> and TT<i>. */
19069 /* Simple cases: Value already set, does match or doesn't. */
19070 if (targ
!= NULL_TREE
&& template_args_equal (targ
, arg
))
19071 return unify_success (explain_p
);
19073 return unify_inconsistency (explain_p
, parm
, targ
, arg
);
19077 /* If PARM is `const T' and ARG is only `int', we don't have
19078 a match unless we are allowing additional qualification.
19079 If ARG is `const int' and PARM is just `T' that's OK;
19080 that binds `const int' to `T'. */
19081 if (!check_cv_quals_for_unify (strict_in
| UNIFY_ALLOW_LESS_CV_QUAL
,
19083 return unify_cv_qual_mismatch (explain_p
, parm
, arg
);
19085 /* Consider the case where ARG is `const volatile int' and
19086 PARM is `const T'. Then, T should be `volatile int'. */
19087 arg
= cp_build_qualified_type_real
19088 (arg
, cp_type_quals (arg
) & ~cp_type_quals (parm
), tf_none
);
19089 if (arg
== error_mark_node
)
19090 return unify_invalid (explain_p
);
19092 /* Simple cases: Value already set, does match or doesn't. */
19093 if (targ
!= NULL_TREE
&& same_type_p (targ
, arg
))
19094 return unify_success (explain_p
);
19096 return unify_inconsistency (explain_p
, parm
, targ
, arg
);
19098 /* Make sure that ARG is not a variable-sized array. (Note
19099 that were talking about variable-sized arrays (like
19100 `int[n]'), rather than arrays of unknown size (like
19101 `int[]').) We'll get very confused by such a type since
19102 the bound of the array is not constant, and therefore
19103 not mangleable. Besides, such types are not allowed in
19104 ISO C++, so we can do as we please here. We do allow
19105 them for 'auto' deduction, since that isn't ABI-exposed. */
19106 if (!is_auto (parm
) && variably_modified_type_p (arg
, NULL_TREE
))
19107 return unify_vla_arg (explain_p
, arg
);
19109 /* Strip typedefs as in convert_template_argument. */
19110 arg
= canonicalize_type_argument (arg
, tf_none
);
19113 /* If ARG is a parameter pack or an expansion, we cannot unify
19114 against it unless PARM is also a parameter pack. */
19115 if ((template_parameter_pack_p (arg
) || PACK_EXPANSION_P (arg
))
19116 && !template_parameter_pack_p (parm
))
19117 return unify_parameter_pack_mismatch (explain_p
, parm
, arg
);
19119 /* If the argument deduction results is a METHOD_TYPE,
19120 then there is a problem.
19121 METHOD_TYPE doesn't map to any real C++ type the result of
19122 the deduction can not be of that type. */
19123 if (TREE_CODE (arg
) == METHOD_TYPE
)
19124 return unify_method_type_error (explain_p
, arg
);
19126 TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
) = arg
;
19127 return unify_success (explain_p
);
19129 case TEMPLATE_PARM_INDEX
:
19130 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, 0));
19131 if (error_operand_p (tparm
))
19132 return unify_invalid (explain_p
);
19134 if (TEMPLATE_PARM_LEVEL (parm
)
19135 != template_decl_level (tparm
))
19137 /* The PARM is not one we're trying to unify. Just check
19138 to see if it matches ARG. */
19139 int result
= !(TREE_CODE (arg
) == TREE_CODE (parm
)
19140 && cp_tree_equal (parm
, arg
));
19142 unify_expression_unequal (explain_p
, parm
, arg
);
19146 idx
= TEMPLATE_PARM_IDX (parm
);
19147 targ
= TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
);
19151 int x
= !cp_tree_equal (targ
, arg
);
19153 unify_inconsistency (explain_p
, parm
, targ
, arg
);
19157 /* [temp.deduct.type] If, in the declaration of a function template
19158 with a non-type template-parameter, the non-type
19159 template-parameter is used in an expression in the function
19160 parameter-list and, if the corresponding template-argument is
19161 deduced, the template-argument type shall match the type of the
19162 template-parameter exactly, except that a template-argument
19163 deduced from an array bound may be of any integral type.
19164 The non-type parameter might use already deduced type parameters. */
19165 tparm
= tsubst (TREE_TYPE (parm
), targs
, 0, NULL_TREE
);
19166 if (!TREE_TYPE (arg
))
19167 /* Template-parameter dependent expression. Just accept it for now.
19168 It will later be processed in convert_template_argument. */
19170 else if (same_type_p (TREE_TYPE (arg
), tparm
))
19172 else if ((strict
& UNIFY_ALLOW_INTEGER
)
19173 && CP_INTEGRAL_TYPE_P (tparm
))
19174 /* Convert the ARG to the type of PARM; the deduced non-type
19175 template argument must exactly match the types of the
19176 corresponding parameter. */
19177 arg
= fold (build_nop (tparm
, arg
));
19178 else if (uses_template_parms (tparm
))
19179 /* We haven't deduced the type of this parameter yet. Try again
19181 return unify_success (explain_p
);
19183 return unify_type_mismatch (explain_p
, tparm
, TREE_TYPE (arg
));
19185 /* If ARG is a parameter pack or an expansion, we cannot unify
19186 against it unless PARM is also a parameter pack. */
19187 if ((template_parameter_pack_p (arg
) || PACK_EXPANSION_P (arg
))
19188 && !TEMPLATE_PARM_PARAMETER_PACK (parm
))
19189 return unify_parameter_pack_mismatch (explain_p
, parm
, arg
);
19192 bool removed_attr
= false;
19193 arg
= strip_typedefs_expr (arg
, &removed_attr
);
19195 TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
) = arg
;
19196 return unify_success (explain_p
);
19200 /* A pointer-to-member constant can be unified only with
19201 another constant. */
19202 if (TREE_CODE (arg
) != PTRMEM_CST
)
19203 return unify_ptrmem_cst_mismatch (explain_p
, parm
, arg
);
19205 /* Just unify the class member. It would be useless (and possibly
19206 wrong, depending on the strict flags) to unify also
19207 PTRMEM_CST_CLASS, because we want to be sure that both parm and
19208 arg refer to the same variable, even if through different
19209 classes. For instance:
19211 struct A { int x; };
19214 Unification of &A::x and &B::x must succeed. */
19215 return unify (tparms
, targs
, PTRMEM_CST_MEMBER (parm
),
19216 PTRMEM_CST_MEMBER (arg
), strict
, explain_p
);
19221 if (!TYPE_PTR_P (arg
))
19222 return unify_type_mismatch (explain_p
, parm
, arg
);
19224 /* [temp.deduct.call]
19226 A can be another pointer or pointer to member type that can
19227 be converted to the deduced A via a qualification
19228 conversion (_conv.qual_).
19230 We pass down STRICT here rather than UNIFY_ALLOW_NONE.
19231 This will allow for additional cv-qualification of the
19232 pointed-to types if appropriate. */
19234 if (TREE_CODE (TREE_TYPE (arg
)) == RECORD_TYPE
)
19235 /* The derived-to-base conversion only persists through one
19236 level of pointers. */
19237 strict
|= (strict_in
& UNIFY_ALLOW_DERIVED
);
19239 return unify (tparms
, targs
, TREE_TYPE (parm
),
19240 TREE_TYPE (arg
), strict
, explain_p
);
19243 case REFERENCE_TYPE
:
19244 if (TREE_CODE (arg
) != REFERENCE_TYPE
)
19245 return unify_type_mismatch (explain_p
, parm
, arg
);
19246 return unify (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
19247 strict
& UNIFY_ALLOW_MORE_CV_QUAL
, explain_p
);
19250 if (TREE_CODE (arg
) != ARRAY_TYPE
)
19251 return unify_type_mismatch (explain_p
, parm
, arg
);
19252 if ((TYPE_DOMAIN (parm
) == NULL_TREE
)
19253 != (TYPE_DOMAIN (arg
) == NULL_TREE
))
19254 return unify_type_mismatch (explain_p
, parm
, arg
);
19255 RECUR_AND_CHECK_FAILURE (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
19256 strict
& UNIFY_ALLOW_MORE_CV_QUAL
, explain_p
);
19257 if (TYPE_DOMAIN (parm
) != NULL_TREE
)
19258 return unify_array_domain (tparms
, targs
, TYPE_DOMAIN (parm
),
19259 TYPE_DOMAIN (arg
), explain_p
);
19260 return unify_success (explain_p
);
19267 case ENUMERAL_TYPE
:
19270 if (TREE_CODE (arg
) != TREE_CODE (parm
))
19271 return unify_type_mismatch (explain_p
, parm
, arg
);
19273 /* We have already checked cv-qualification at the top of the
19275 if (!same_type_ignoring_top_level_qualifiers_p (arg
, parm
))
19276 return unify_type_mismatch (explain_p
, parm
, arg
);
19278 /* As far as unification is concerned, this wins. Later checks
19279 will invalidate it if necessary. */
19280 return unify_success (explain_p
);
19282 /* Types INTEGER_CST and MINUS_EXPR can come from array bounds. */
19283 /* Type INTEGER_CST can come from ordinary constant template args. */
19285 while (TREE_CODE (arg
) == NOP_EXPR
)
19286 arg
= TREE_OPERAND (arg
, 0);
19288 if (TREE_CODE (arg
) != INTEGER_CST
)
19289 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
19290 return (tree_int_cst_equal (parm
, arg
)
19291 ? unify_success (explain_p
)
19292 : unify_template_argument_mismatch (explain_p
, parm
, arg
));
19296 int i
, len
, argslen
;
19297 int parm_variadic_p
= 0;
19299 if (TREE_CODE (arg
) != TREE_VEC
)
19300 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
19302 len
= TREE_VEC_LENGTH (parm
);
19303 argslen
= TREE_VEC_LENGTH (arg
);
19305 /* Check for pack expansions in the parameters. */
19306 for (i
= 0; i
< len
; ++i
)
19308 if (PACK_EXPANSION_P (TREE_VEC_ELT (parm
, i
)))
19311 /* We can unify against something with a trailing
19313 parm_variadic_p
= 1;
19315 /* [temp.deduct.type]/9: If the template argument list of
19316 P contains a pack expansion that is not the last
19317 template argument, the entire template argument list
19318 is a non-deduced context. */
19319 return unify_success (explain_p
);
19323 /* If we don't have enough arguments to satisfy the parameters
19324 (not counting the pack expression at the end), or we have
19325 too many arguments for a parameter list that doesn't end in
19326 a pack expression, we can't unify. */
19327 if (parm_variadic_p
19328 ? argslen
< len
- parm_variadic_p
19330 return unify_arity (explain_p
, TREE_VEC_LENGTH (arg
), len
);
19332 /* Unify all of the parameters that precede the (optional)
19333 pack expression. */
19334 for (i
= 0; i
< len
- parm_variadic_p
; ++i
)
19336 RECUR_AND_CHECK_FAILURE (tparms
, targs
,
19337 TREE_VEC_ELT (parm
, i
),
19338 TREE_VEC_ELT (arg
, i
),
19339 UNIFY_ALLOW_NONE
, explain_p
);
19341 if (parm_variadic_p
)
19342 return unify_pack_expansion (tparms
, targs
, parm
, arg
,
19344 /*subr=*/true, explain_p
);
19345 return unify_success (explain_p
);
19350 if (TREE_CODE (arg
) != TREE_CODE (parm
))
19351 return unify_type_mismatch (explain_p
, parm
, arg
);
19353 if (TYPE_PTRMEMFUNC_P (parm
))
19355 if (!TYPE_PTRMEMFUNC_P (arg
))
19356 return unify_type_mismatch (explain_p
, parm
, arg
);
19358 return unify (tparms
, targs
,
19359 TYPE_PTRMEMFUNC_FN_TYPE (parm
),
19360 TYPE_PTRMEMFUNC_FN_TYPE (arg
),
19361 strict
, explain_p
);
19363 else if (TYPE_PTRMEMFUNC_P (arg
))
19364 return unify_type_mismatch (explain_p
, parm
, arg
);
19366 if (CLASSTYPE_TEMPLATE_INFO (parm
))
19368 tree t
= NULL_TREE
;
19370 if (strict_in
& UNIFY_ALLOW_DERIVED
)
19372 /* First, we try to unify the PARM and ARG directly. */
19373 t
= try_class_unification (tparms
, targs
,
19374 parm
, arg
, explain_p
);
19378 /* Fallback to the special case allowed in
19379 [temp.deduct.call]:
19381 If P is a class, and P has the form
19382 template-id, then A can be a derived class of
19383 the deduced A. Likewise, if P is a pointer to
19384 a class of the form template-id, A can be a
19385 pointer to a derived class pointed to by the
19387 enum template_base_result r
;
19388 r
= get_template_base (tparms
, targs
, parm
, arg
,
19392 return unify_no_common_base (explain_p
, r
, parm
, arg
);
19395 else if (CLASSTYPE_TEMPLATE_INFO (arg
)
19396 && (CLASSTYPE_TI_TEMPLATE (parm
)
19397 == CLASSTYPE_TI_TEMPLATE (arg
)))
19398 /* Perhaps PARM is something like S<U> and ARG is S<int>.
19399 Then, we should unify `int' and `U'. */
19402 /* There's no chance of unification succeeding. */
19403 return unify_type_mismatch (explain_p
, parm
, arg
);
19405 return unify (tparms
, targs
, CLASSTYPE_TI_ARGS (parm
),
19406 CLASSTYPE_TI_ARGS (t
), UNIFY_ALLOW_NONE
, explain_p
);
19408 else if (!same_type_ignoring_top_level_qualifiers_p (parm
, arg
))
19409 return unify_type_mismatch (explain_p
, parm
, arg
);
19410 return unify_success (explain_p
);
19413 case FUNCTION_TYPE
:
19415 unsigned int nargs
;
19420 if (TREE_CODE (arg
) != TREE_CODE (parm
))
19421 return unify_type_mismatch (explain_p
, parm
, arg
);
19423 /* CV qualifications for methods can never be deduced, they must
19424 match exactly. We need to check them explicitly here,
19425 because type_unification_real treats them as any other
19426 cv-qualified parameter. */
19427 if (TREE_CODE (parm
) == METHOD_TYPE
19428 && (!check_cv_quals_for_unify
19430 class_of_this_parm (arg
),
19431 class_of_this_parm (parm
))))
19432 return unify_cv_qual_mismatch (explain_p
, parm
, arg
);
19434 RECUR_AND_CHECK_FAILURE (tparms
, targs
, TREE_TYPE (parm
),
19435 TREE_TYPE (arg
), UNIFY_ALLOW_NONE
, explain_p
);
19437 nargs
= list_length (TYPE_ARG_TYPES (arg
));
19438 args
= XALLOCAVEC (tree
, nargs
);
19439 for (a
= TYPE_ARG_TYPES (arg
), i
= 0;
19440 a
!= NULL_TREE
&& a
!= void_list_node
;
19441 a
= TREE_CHAIN (a
), ++i
)
19442 args
[i
] = TREE_VALUE (a
);
19445 return type_unification_real (tparms
, targs
, TYPE_ARG_TYPES (parm
),
19446 args
, nargs
, 1, DEDUCE_EXACT
,
19447 LOOKUP_NORMAL
, NULL
, explain_p
);
19451 /* Unify a pointer to member with a pointer to member function, which
19452 deduces the type of the member as a function type. */
19453 if (TYPE_PTRMEMFUNC_P (arg
))
19455 /* Check top-level cv qualifiers */
19456 if (!check_cv_quals_for_unify (UNIFY_ALLOW_NONE
, arg
, parm
))
19457 return unify_cv_qual_mismatch (explain_p
, parm
, arg
);
19459 RECUR_AND_CHECK_FAILURE (tparms
, targs
, TYPE_OFFSET_BASETYPE (parm
),
19460 TYPE_PTRMEMFUNC_OBJECT_TYPE (arg
),
19461 UNIFY_ALLOW_NONE
, explain_p
);
19463 /* Determine the type of the function we are unifying against. */
19464 tree fntype
= static_fn_type (arg
);
19466 return unify (tparms
, targs
, TREE_TYPE (parm
), fntype
, strict
, explain_p
);
19469 if (TREE_CODE (arg
) != OFFSET_TYPE
)
19470 return unify_type_mismatch (explain_p
, parm
, arg
);
19471 RECUR_AND_CHECK_FAILURE (tparms
, targs
, TYPE_OFFSET_BASETYPE (parm
),
19472 TYPE_OFFSET_BASETYPE (arg
),
19473 UNIFY_ALLOW_NONE
, explain_p
);
19474 return unify (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
19475 strict
, explain_p
);
19478 if (DECL_TEMPLATE_PARM_P (parm
))
19479 return unify (tparms
, targs
, DECL_INITIAL (parm
), arg
, strict
, explain_p
);
19480 if (arg
!= scalar_constant_value (parm
))
19481 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
19482 return unify_success (explain_p
);
19485 case TEMPLATE_DECL
:
19486 /* Matched cases are handled by the ARG == PARM test above. */
19487 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
19490 /* A non-type template parameter that is a variable should be a
19491 an integral constant, in which case, it whould have been
19492 folded into its (constant) value. So we should not be getting
19493 a variable here. */
19494 gcc_unreachable ();
19496 case TYPE_ARGUMENT_PACK
:
19497 case NONTYPE_ARGUMENT_PACK
:
19498 return unify (tparms
, targs
, ARGUMENT_PACK_ARGS (parm
),
19499 ARGUMENT_PACK_ARGS (arg
), strict
, explain_p
);
19502 case DECLTYPE_TYPE
:
19503 case UNDERLYING_TYPE
:
19504 /* Cannot deduce anything from TYPEOF_TYPE, DECLTYPE_TYPE,
19505 or UNDERLYING_TYPE nodes. */
19506 return unify_success (explain_p
);
19509 /* Unification fails if we hit an error node. */
19510 return unify_invalid (explain_p
);
19513 if (REFERENCE_REF_P (parm
))
19515 if (REFERENCE_REF_P (arg
))
19516 arg
= TREE_OPERAND (arg
, 0);
19517 return unify (tparms
, targs
, TREE_OPERAND (parm
, 0), arg
,
19518 strict
, explain_p
);
19523 /* An unresolved overload is a nondeduced context. */
19524 if (is_overloaded_fn (parm
) || type_unknown_p (parm
))
19525 return unify_success (explain_p
);
19526 gcc_assert (EXPR_P (parm
));
19528 /* We must be looking at an expression. This can happen with
19532 void foo(S<I>, S<I + 2>);
19534 This is a "nondeduced context":
19538 The nondeduced contexts are:
19540 --A type that is a template-id in which one or more of
19541 the template-arguments is an expression that references
19542 a template-parameter.
19544 In these cases, we assume deduction succeeded, but don't
19545 actually infer any unifications. */
19547 if (!uses_template_parms (parm
)
19548 && !template_args_equal (parm
, arg
))
19549 return unify_expression_unequal (explain_p
, parm
, arg
);
19551 return unify_success (explain_p
);
19554 #undef RECUR_AND_CHECK_FAILURE
19556 /* Note that DECL can be defined in this translation unit, if
19560 mark_definable (tree decl
)
19563 DECL_NOT_REALLY_EXTERN (decl
) = 1;
19564 FOR_EACH_CLONE (clone
, decl
)
19565 DECL_NOT_REALLY_EXTERN (clone
) = 1;
19568 /* Called if RESULT is explicitly instantiated, or is a member of an
19569 explicitly instantiated class. */
19572 mark_decl_instantiated (tree result
, int extern_p
)
19574 SET_DECL_EXPLICIT_INSTANTIATION (result
);
19576 /* If this entity has already been written out, it's too late to
19577 make any modifications. */
19578 if (TREE_ASM_WRITTEN (result
))
19581 /* For anonymous namespace we don't need to do anything. */
19582 if (decl_anon_ns_mem_p (result
))
19584 gcc_assert (!TREE_PUBLIC (result
));
19588 if (TREE_CODE (result
) != FUNCTION_DECL
)
19589 /* The TREE_PUBLIC flag for function declarations will have been
19590 set correctly by tsubst. */
19591 TREE_PUBLIC (result
) = 1;
19593 /* This might have been set by an earlier implicit instantiation. */
19594 DECL_COMDAT (result
) = 0;
19597 DECL_NOT_REALLY_EXTERN (result
) = 0;
19600 mark_definable (result
);
19601 mark_needed (result
);
19602 /* Always make artificials weak. */
19603 if (DECL_ARTIFICIAL (result
) && flag_weak
)
19604 comdat_linkage (result
);
19605 /* For WIN32 we also want to put explicit instantiations in
19606 linkonce sections. */
19607 else if (TREE_PUBLIC (result
))
19608 maybe_make_one_only (result
);
19611 /* If EXTERN_P, then this function will not be emitted -- unless
19612 followed by an explicit instantiation, at which point its linkage
19613 will be adjusted. If !EXTERN_P, then this function will be
19614 emitted here. In neither circumstance do we want
19615 import_export_decl to adjust the linkage. */
19616 DECL_INTERFACE_KNOWN (result
) = 1;
19619 /* Subroutine of more_specialized_fn: check whether TARGS is missing any
19620 important template arguments. If any are missing, we check whether
19621 they're important by using error_mark_node for substituting into any
19622 args that were used for partial ordering (the ones between ARGS and END)
19623 and seeing if it bubbles up. */
19626 check_undeduced_parms (tree targs
, tree args
, tree end
)
19628 bool found
= false;
19630 for (i
= TREE_VEC_LENGTH (targs
) - 1; i
>= 0; --i
)
19631 if (TREE_VEC_ELT (targs
, i
) == NULL_TREE
)
19634 TREE_VEC_ELT (targs
, i
) = error_mark_node
;
19638 tree substed
= tsubst_arg_types (args
, targs
, end
, tf_none
, NULL_TREE
);
19639 if (substed
== error_mark_node
)
19645 /* Given two function templates PAT1 and PAT2, return:
19647 1 if PAT1 is more specialized than PAT2 as described in [temp.func.order].
19648 -1 if PAT2 is more specialized than PAT1.
19649 0 if neither is more specialized.
19651 LEN indicates the number of parameters we should consider
19652 (defaulted parameters should not be considered).
19654 The 1998 std underspecified function template partial ordering, and
19655 DR214 addresses the issue. We take pairs of arguments, one from
19656 each of the templates, and deduce them against each other. One of
19657 the templates will be more specialized if all the *other*
19658 template's arguments deduce against its arguments and at least one
19659 of its arguments *does* *not* deduce against the other template's
19660 corresponding argument. Deduction is done as for class templates.
19661 The arguments used in deduction have reference and top level cv
19662 qualifiers removed. Iff both arguments were originally reference
19663 types *and* deduction succeeds in both directions, an lvalue reference
19664 wins against an rvalue reference and otherwise the template
19665 with the more cv-qualified argument wins for that pairing (if
19666 neither is more cv-qualified, they both are equal). Unlike regular
19667 deduction, after all the arguments have been deduced in this way,
19668 we do *not* verify the deduced template argument values can be
19669 substituted into non-deduced contexts.
19671 The logic can be a bit confusing here, because we look at deduce1 and
19672 targs1 to see if pat2 is at least as specialized, and vice versa; if we
19673 can find template arguments for pat1 to make arg1 look like arg2, that
19674 means that arg2 is at least as specialized as arg1. */
19677 more_specialized_fn (tree pat1
, tree pat2
, int len
)
19679 tree decl1
= DECL_TEMPLATE_RESULT (pat1
);
19680 tree decl2
= DECL_TEMPLATE_RESULT (pat2
);
19681 tree targs1
= make_tree_vec (DECL_NTPARMS (pat1
));
19682 tree targs2
= make_tree_vec (DECL_NTPARMS (pat2
));
19683 tree tparms1
= DECL_INNERMOST_TEMPLATE_PARMS (pat1
);
19684 tree tparms2
= DECL_INNERMOST_TEMPLATE_PARMS (pat2
);
19685 tree args1
= TYPE_ARG_TYPES (TREE_TYPE (decl1
));
19686 tree args2
= TYPE_ARG_TYPES (TREE_TYPE (decl2
));
19687 tree origs1
, origs2
;
19688 bool lose1
= false;
19689 bool lose2
= false;
19691 /* Remove the this parameter from non-static member functions. If
19692 one is a non-static member function and the other is not a static
19693 member function, remove the first parameter from that function
19694 also. This situation occurs for operator functions where we
19695 locate both a member function (with this pointer) and non-member
19696 operator (with explicit first operand). */
19697 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl1
))
19699 len
--; /* LEN is the number of significant arguments for DECL1 */
19700 args1
= TREE_CHAIN (args1
);
19701 if (!DECL_STATIC_FUNCTION_P (decl2
))
19702 args2
= TREE_CHAIN (args2
);
19704 else if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl2
))
19706 args2
= TREE_CHAIN (args2
);
19707 if (!DECL_STATIC_FUNCTION_P (decl1
))
19710 args1
= TREE_CHAIN (args1
);
19714 /* If only one is a conversion operator, they are unordered. */
19715 if (DECL_CONV_FN_P (decl1
) != DECL_CONV_FN_P (decl2
))
19718 /* Consider the return type for a conversion function */
19719 if (DECL_CONV_FN_P (decl1
))
19721 args1
= tree_cons (NULL_TREE
, TREE_TYPE (TREE_TYPE (decl1
)), args1
);
19722 args2
= tree_cons (NULL_TREE
, TREE_TYPE (TREE_TYPE (decl2
)), args2
);
19726 processing_template_decl
++;
19732 /* Stop when an ellipsis is seen. */
19733 && args1
!= NULL_TREE
&& args2
!= NULL_TREE
)
19735 tree arg1
= TREE_VALUE (args1
);
19736 tree arg2
= TREE_VALUE (args2
);
19737 int deduce1
, deduce2
;
19743 if (TREE_CODE (arg1
) == TYPE_PACK_EXPANSION
19744 && TREE_CODE (arg2
) == TYPE_PACK_EXPANSION
)
19746 /* When both arguments are pack expansions, we need only
19747 unify the patterns themselves. */
19748 arg1
= PACK_EXPANSION_PATTERN (arg1
);
19749 arg2
= PACK_EXPANSION_PATTERN (arg2
);
19751 /* This is the last comparison we need to do. */
19755 if (TREE_CODE (arg1
) == REFERENCE_TYPE
)
19757 ref1
= TYPE_REF_IS_RVALUE (arg1
) + 1;
19758 arg1
= TREE_TYPE (arg1
);
19759 quals1
= cp_type_quals (arg1
);
19762 if (TREE_CODE (arg2
) == REFERENCE_TYPE
)
19764 ref2
= TYPE_REF_IS_RVALUE (arg2
) + 1;
19765 arg2
= TREE_TYPE (arg2
);
19766 quals2
= cp_type_quals (arg2
);
19769 arg1
= TYPE_MAIN_VARIANT (arg1
);
19770 arg2
= TYPE_MAIN_VARIANT (arg2
);
19772 if (TREE_CODE (arg1
) == TYPE_PACK_EXPANSION
)
19774 int i
, len2
= list_length (args2
);
19775 tree parmvec
= make_tree_vec (1);
19776 tree argvec
= make_tree_vec (len2
);
19779 /* Setup the parameter vector, which contains only ARG1. */
19780 TREE_VEC_ELT (parmvec
, 0) = arg1
;
19782 /* Setup the argument vector, which contains the remaining
19784 for (i
= 0; i
< len2
; i
++, ta
= TREE_CHAIN (ta
))
19785 TREE_VEC_ELT (argvec
, i
) = TREE_VALUE (ta
);
19787 deduce1
= (unify_pack_expansion (tparms1
, targs1
, parmvec
,
19788 argvec
, DEDUCE_EXACT
,
19789 /*subr=*/true, /*explain_p=*/false)
19792 /* We cannot deduce in the other direction, because ARG1 is
19793 a pack expansion but ARG2 is not. */
19796 else if (TREE_CODE (arg2
) == TYPE_PACK_EXPANSION
)
19798 int i
, len1
= list_length (args1
);
19799 tree parmvec
= make_tree_vec (1);
19800 tree argvec
= make_tree_vec (len1
);
19803 /* Setup the parameter vector, which contains only ARG1. */
19804 TREE_VEC_ELT (parmvec
, 0) = arg2
;
19806 /* Setup the argument vector, which contains the remaining
19808 for (i
= 0; i
< len1
; i
++, ta
= TREE_CHAIN (ta
))
19809 TREE_VEC_ELT (argvec
, i
) = TREE_VALUE (ta
);
19811 deduce2
= (unify_pack_expansion (tparms2
, targs2
, parmvec
,
19812 argvec
, DEDUCE_EXACT
,
19813 /*subr=*/true, /*explain_p=*/false)
19816 /* We cannot deduce in the other direction, because ARG2 is
19817 a pack expansion but ARG1 is not.*/
19823 /* The normal case, where neither argument is a pack
19825 deduce1
= (unify (tparms1
, targs1
, arg1
, arg2
,
19826 UNIFY_ALLOW_NONE
, /*explain_p=*/false)
19828 deduce2
= (unify (tparms2
, targs2
, arg2
, arg1
,
19829 UNIFY_ALLOW_NONE
, /*explain_p=*/false)
19833 /* If we couldn't deduce arguments for tparms1 to make arg1 match
19834 arg2, then arg2 is not as specialized as arg1. */
19840 /* "If, for a given type, deduction succeeds in both directions
19841 (i.e., the types are identical after the transformations above)
19842 and both P and A were reference types (before being replaced with
19843 the type referred to above):
19844 - if the type from the argument template was an lvalue reference and
19845 the type from the parameter template was not, the argument type is
19846 considered to be more specialized than the other; otherwise,
19847 - if the type from the argument template is more cv-qualified
19848 than the type from the parameter template (as described above),
19849 the argument type is considered to be more specialized than the other;
19851 - neither type is more specialized than the other." */
19853 if (deduce1
&& deduce2
)
19855 if (ref1
&& ref2
&& ref1
!= ref2
)
19862 else if (quals1
!= quals2
&& quals1
>= 0 && quals2
>= 0)
19864 if ((quals1
& quals2
) == quals2
)
19866 if ((quals1
& quals2
) == quals1
)
19871 if (lose1
&& lose2
)
19872 /* We've failed to deduce something in either direction.
19873 These must be unordered. */
19876 if (TREE_CODE (arg1
) == TYPE_PACK_EXPANSION
19877 || TREE_CODE (arg2
) == TYPE_PACK_EXPANSION
)
19878 /* We have already processed all of the arguments in our
19879 handing of the pack expansion type. */
19882 args1
= TREE_CHAIN (args1
);
19883 args2
= TREE_CHAIN (args2
);
19886 /* "In most cases, all template parameters must have values in order for
19887 deduction to succeed, but for partial ordering purposes a template
19888 parameter may remain without a value provided it is not used in the
19889 types being used for partial ordering."
19891 Thus, if we are missing any of the targs1 we need to substitute into
19892 origs1, then pat2 is not as specialized as pat1. This can happen when
19893 there is a nondeduced context. */
19894 if (!lose2
&& check_undeduced_parms (targs1
, origs1
, args1
))
19896 if (!lose1
&& check_undeduced_parms (targs2
, origs2
, args2
))
19899 processing_template_decl
--;
19901 /* If both deductions succeed, the partial ordering selects the more
19902 constrained template. */
19903 if (!lose1
&& !lose2
)
19905 tree c1
= get_constraints (DECL_TEMPLATE_RESULT (pat1
));
19906 tree c2
= get_constraints (DECL_TEMPLATE_RESULT (pat2
));
19907 lose1
= !subsumes_constraints (c1
, c2
);
19908 lose2
= !subsumes_constraints (c2
, c1
);
19911 /* All things being equal, if the next argument is a pack expansion
19912 for one function but not for the other, prefer the
19913 non-variadic function. FIXME this is bogus; see c++/41958. */
19915 && args1
&& TREE_VALUE (args1
)
19916 && args2
&& TREE_VALUE (args2
))
19918 lose1
= TREE_CODE (TREE_VALUE (args1
)) == TYPE_PACK_EXPANSION
;
19919 lose2
= TREE_CODE (TREE_VALUE (args2
)) == TYPE_PACK_EXPANSION
;
19922 if (lose1
== lose2
)
19930 /* Determine which of two partial specializations of TMPL is more
19933 PAT1 is a TREE_LIST whose TREE_VALUE is the TEMPLATE_DECL corresponding
19934 to the first partial specialization. The TREE_PURPOSE is the
19935 innermost set of template parameters for the partial
19936 specialization. PAT2 is similar, but for the second template.
19938 Return 1 if the first partial specialization is more specialized;
19939 -1 if the second is more specialized; 0 if neither is more
19942 See [temp.class.order] for information about determining which of
19943 two templates is more specialized. */
19946 more_specialized_partial_spec (tree tmpl
, tree pat1
, tree pat2
)
19950 bool any_deductions
= false;
19952 tree tmpl1
= TREE_VALUE (pat1
);
19953 tree tmpl2
= TREE_VALUE (pat2
);
19954 tree parms1
= DECL_INNERMOST_TEMPLATE_PARMS (tmpl1
);
19955 tree parms2
= DECL_INNERMOST_TEMPLATE_PARMS (tmpl2
);
19956 tree specargs1
= TI_ARGS (get_template_info (DECL_TEMPLATE_RESULT (tmpl1
)));
19957 tree specargs2
= TI_ARGS (get_template_info (DECL_TEMPLATE_RESULT (tmpl2
)));
19959 /* Just like what happens for functions, if we are ordering between
19960 different template specializations, we may encounter dependent
19961 types in the arguments, and we need our dependency check functions
19962 to behave correctly. */
19963 ++processing_template_decl
;
19964 targs
= get_partial_spec_bindings (tmpl
, parms1
, specargs1
, specargs2
);
19968 any_deductions
= true;
19971 targs
= get_partial_spec_bindings (tmpl
, parms2
, specargs2
, specargs1
);
19975 any_deductions
= true;
19977 --processing_template_decl
;
19979 /* If both deductions succeed, the partial ordering selects the more
19980 constrained template. */
19981 if (!winner
&& any_deductions
)
19982 return more_constrained (tmpl1
, tmpl2
);
19984 /* In the case of a tie where at least one of the templates
19985 has a parameter pack at the end, the template with the most
19986 non-packed parameters wins. */
19989 && (template_args_variadic_p (TREE_PURPOSE (pat1
))
19990 || template_args_variadic_p (TREE_PURPOSE (pat2
))))
19992 tree args1
= INNERMOST_TEMPLATE_ARGS (TREE_PURPOSE (pat1
));
19993 tree args2
= INNERMOST_TEMPLATE_ARGS (TREE_PURPOSE (pat2
));
19994 int len1
= TREE_VEC_LENGTH (args1
);
19995 int len2
= TREE_VEC_LENGTH (args2
);
19997 /* We don't count the pack expansion at the end. */
19998 if (template_args_variadic_p (TREE_PURPOSE (pat1
)))
20000 if (template_args_variadic_p (TREE_PURPOSE (pat2
)))
20005 else if (len1
< len2
)
20012 /* Return the template arguments that will produce the function signature
20013 DECL from the function template FN, with the explicit template
20014 arguments EXPLICIT_ARGS. If CHECK_RETTYPE is true, the return type must
20015 also match. Return NULL_TREE if no satisfactory arguments could be
20019 get_bindings (tree fn
, tree decl
, tree explicit_args
, bool check_rettype
)
20021 int ntparms
= DECL_NTPARMS (fn
);
20022 tree targs
= make_tree_vec (ntparms
);
20023 tree decl_type
= TREE_TYPE (decl
);
20024 tree decl_arg_types
;
20026 unsigned int nargs
, ix
;
20029 gcc_assert (decl
!= DECL_TEMPLATE_RESULT (fn
));
20031 /* Never do unification on the 'this' parameter. */
20032 decl_arg_types
= skip_artificial_parms_for (decl
,
20033 TYPE_ARG_TYPES (decl_type
));
20035 nargs
= list_length (decl_arg_types
);
20036 args
= XALLOCAVEC (tree
, nargs
);
20037 for (arg
= decl_arg_types
, ix
= 0;
20038 arg
!= NULL_TREE
&& arg
!= void_list_node
;
20039 arg
= TREE_CHAIN (arg
), ++ix
)
20040 args
[ix
] = TREE_VALUE (arg
);
20042 if (fn_type_unification (fn
, explicit_args
, targs
,
20044 (check_rettype
|| DECL_CONV_FN_P (fn
)
20045 ? TREE_TYPE (decl_type
) : NULL_TREE
),
20046 DEDUCE_EXACT
, LOOKUP_NORMAL
, /*explain_p=*/false,
20048 == error_mark_node
)
20054 /* Return the innermost template arguments that, when applied to a partial
20055 specialization of TMPL whose innermost template parameters are
20056 TPARMS, and whose specialization arguments are SPEC_ARGS, yield the
20059 For example, suppose we have:
20061 template <class T, class U> struct S {};
20062 template <class T> struct S<T*, int> {};
20064 Then, suppose we want to get `S<double*, int>'. The TPARMS will be
20065 {T}, the SPEC_ARGS will be {T*, int} and the ARGS will be {double*,
20066 int}. The resulting vector will be {double}, indicating that `T'
20067 is bound to `double'. */
20070 get_partial_spec_bindings (tree tmpl
, tree tparms
, tree spec_args
, tree args
)
20072 int i
, ntparms
= TREE_VEC_LENGTH (tparms
);
20074 tree innermost_deduced_args
;
20076 innermost_deduced_args
= make_tree_vec (ntparms
);
20077 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (args
))
20079 deduced_args
= copy_node (args
);
20080 SET_TMPL_ARGS_LEVEL (deduced_args
,
20081 TMPL_ARGS_DEPTH (deduced_args
),
20082 innermost_deduced_args
);
20085 deduced_args
= innermost_deduced_args
;
20087 if (unify (tparms
, deduced_args
,
20088 INNERMOST_TEMPLATE_ARGS (spec_args
),
20089 INNERMOST_TEMPLATE_ARGS (args
),
20090 UNIFY_ALLOW_NONE
, /*explain_p=*/false))
20093 for (i
= 0; i
< ntparms
; ++i
)
20094 if (! TREE_VEC_ELT (innermost_deduced_args
, i
))
20097 /* Verify that nondeduced template arguments agree with the type
20098 obtained from argument deduction.
20102 struct A { typedef int X; };
20103 template <class T, class U> struct C {};
20104 template <class T> struct C<T, typename T::X> {};
20106 Then with the instantiation `C<A, int>', we can deduce that
20107 `T' is `A' but unify () does not check whether `typename T::X'
20109 spec_args
= tsubst (spec_args
, deduced_args
, tf_none
, NULL_TREE
);
20110 spec_args
= coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (tmpl
),
20112 tf_none
, false, false);
20113 if (spec_args
== error_mark_node
20114 /* We only need to check the innermost arguments; the other
20115 arguments will always agree. */
20116 || !comp_template_args (INNERMOST_TEMPLATE_ARGS (spec_args
),
20117 INNERMOST_TEMPLATE_ARGS (args
)))
20120 /* Now that we have bindings for all of the template arguments,
20121 ensure that the arguments deduced for the template template
20122 parameters have compatible template parameter lists. See the use
20123 of template_template_parm_bindings_ok_p in fn_type_unification
20124 for more information. */
20125 if (!template_template_parm_bindings_ok_p (tparms
, deduced_args
))
20128 return deduced_args
;
20131 // Compare two function templates T1 and T2 by deducing bindings
20132 // from one against the other. If both deductions succeed, compare
20133 // constraints to see which is more constrained.
20135 more_specialized_inst (tree t1
, tree t2
)
20140 if (get_bindings (t1
, DECL_TEMPLATE_RESULT (t2
), NULL_TREE
, true))
20146 if (get_bindings (t2
, DECL_TEMPLATE_RESULT (t1
), NULL_TREE
, true))
20152 // If both deductions succeed, then one may be more constrained.
20153 if (count
== 2 && fate
== 0)
20154 fate
= more_constrained (t1
, t2
);
20159 /* TEMPLATES is a TREE_LIST. Each TREE_VALUE is a TEMPLATE_DECL.
20160 Return the TREE_LIST node with the most specialized template, if
20161 any. If there is no most specialized template, the error_mark_node
20164 Note that this function does not look at, or modify, the
20165 TREE_PURPOSE or TREE_TYPE of any of the nodes. Since the node
20166 returned is one of the elements of INSTANTIATIONS, callers may
20167 store information in the TREE_PURPOSE or TREE_TYPE of the nodes,
20168 and retrieve it from the value returned. */
20171 most_specialized_instantiation (tree templates
)
20175 ++processing_template_decl
;
20178 for (fn
= TREE_CHAIN (templates
); fn
; fn
= TREE_CHAIN (fn
))
20180 int fate
= more_specialized_inst (TREE_VALUE (champ
), TREE_VALUE (fn
));
20185 /* Equally specialized, move to next function. If there
20186 is no next function, nothing's most specialized. */
20187 fn
= TREE_CHAIN (fn
);
20195 /* Now verify that champ is better than everything earlier in the
20196 instantiation list. */
20197 for (fn
= templates
; fn
!= champ
; fn
= TREE_CHAIN (fn
)) {
20198 if (more_specialized_inst (TREE_VALUE (champ
), TREE_VALUE (fn
)) != 1)
20205 processing_template_decl
--;
20208 return error_mark_node
;
20213 /* If DECL is a specialization of some template, return the most
20214 general such template. Otherwise, returns NULL_TREE.
20216 For example, given:
20218 template <class T> struct S { template <class U> void f(U); };
20220 if TMPL is `template <class U> void S<int>::f(U)' this will return
20221 the full template. This function will not trace past partial
20222 specializations, however. For example, given in addition:
20224 template <class T> struct S<T*> { template <class U> void f(U); };
20226 if TMPL is `template <class U> void S<int*>::f(U)' this will return
20227 `template <class T> template <class U> S<T*>::f(U)'. */
20230 most_general_template (tree decl
)
20232 if (TREE_CODE (decl
) != TEMPLATE_DECL
)
20234 if (tree tinfo
= get_template_info (decl
))
20235 decl
= TI_TEMPLATE (tinfo
);
20236 /* The TI_TEMPLATE can be an IDENTIFIER_NODE for a
20237 template friend, or a FIELD_DECL for a capture pack. */
20238 if (TREE_CODE (decl
) != TEMPLATE_DECL
)
20242 /* Look for more and more general templates. */
20243 while (DECL_LANG_SPECIFIC (decl
) && DECL_TEMPLATE_INFO (decl
))
20245 /* The DECL_TI_TEMPLATE can be an IDENTIFIER_NODE in some cases.
20246 (See cp-tree.h for details.) */
20247 if (TREE_CODE (DECL_TI_TEMPLATE (decl
)) != TEMPLATE_DECL
)
20250 if (CLASS_TYPE_P (TREE_TYPE (decl
))
20251 && !TYPE_DECL_ALIAS_P (TYPE_NAME (TREE_TYPE (decl
)))
20252 && CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_TYPE (decl
)))
20255 /* Stop if we run into an explicitly specialized class template. */
20256 if (!DECL_NAMESPACE_SCOPE_P (decl
)
20257 && DECL_CONTEXT (decl
)
20258 && CLASSTYPE_TEMPLATE_SPECIALIZATION (DECL_CONTEXT (decl
)))
20261 decl
= DECL_TI_TEMPLATE (decl
);
20267 /* Return the most specialized of the template partial specializations
20268 which can produce TARGET, a specialization of some class or variable
20269 template. The value returned is actually a TREE_LIST; the TREE_VALUE is
20270 a TEMPLATE_DECL node corresponding to the partial specialization, while
20271 the TREE_PURPOSE is the set of template arguments that must be
20272 substituted into the template pattern in order to generate TARGET.
20274 If the choice of partial specialization is ambiguous, a diagnostic
20275 is issued, and the error_mark_node is returned. If there are no
20276 partial specializations matching TARGET, then NULL_TREE is
20277 returned, indicating that the primary template should be used. */
20280 most_specialized_partial_spec (tree target
, tsubst_flags_t complain
)
20282 tree list
= NULL_TREE
;
20287 tree outer_args
= NULL_TREE
;
20290 if (TYPE_P (target
))
20292 tree tinfo
= CLASSTYPE_TEMPLATE_INFO (target
);
20293 tmpl
= TI_TEMPLATE (tinfo
);
20294 args
= TI_ARGS (tinfo
);
20296 else if (TREE_CODE (target
) == TEMPLATE_ID_EXPR
)
20298 tmpl
= TREE_OPERAND (target
, 0);
20299 args
= TREE_OPERAND (target
, 1);
20301 else if (VAR_P (target
))
20303 tree tinfo
= DECL_TEMPLATE_INFO (target
);
20304 tmpl
= TI_TEMPLATE (tinfo
);
20305 args
= TI_ARGS (tinfo
);
20308 gcc_unreachable ();
20310 tree main_tmpl
= most_general_template (tmpl
);
20312 /* For determining which partial specialization to use, only the
20313 innermost args are interesting. */
20314 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (args
))
20316 outer_args
= strip_innermost_template_args (args
, 1);
20317 args
= INNERMOST_TEMPLATE_ARGS (args
);
20320 for (t
= DECL_TEMPLATE_SPECIALIZATIONS (main_tmpl
); t
; t
= TREE_CHAIN (t
))
20322 tree partial_spec_args
;
20324 tree spec_tmpl
= TREE_VALUE (t
);
20326 partial_spec_args
= TREE_PURPOSE (t
);
20328 ++processing_template_decl
;
20332 /* Discard the outer levels of args, and then substitute in the
20333 template args from the enclosing class. */
20334 partial_spec_args
= INNERMOST_TEMPLATE_ARGS (partial_spec_args
);
20335 partial_spec_args
= tsubst_template_args
20336 (partial_spec_args
, outer_args
, tf_none
, NULL_TREE
);
20338 /* And the same for the partial specialization TEMPLATE_DECL. */
20339 spec_tmpl
= tsubst (spec_tmpl
, outer_args
, tf_none
, NULL_TREE
);
20342 partial_spec_args
=
20343 coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (tmpl
),
20346 /*require_all_args=*/true,
20347 /*use_default_args=*/true);
20349 --processing_template_decl
;
20351 if (partial_spec_args
== error_mark_node
)
20352 return error_mark_node
;
20353 if (spec_tmpl
== error_mark_node
)
20354 return error_mark_node
;
20356 tree parms
= DECL_INNERMOST_TEMPLATE_PARMS (spec_tmpl
);
20357 spec_args
= get_partial_spec_bindings (tmpl
, parms
,
20363 spec_args
= add_to_template_args (outer_args
, spec_args
);
20365 /* Keep the candidate only if the constraints are satisfied,
20366 or if we're not compiling with concepts. */
20368 || constraints_satisfied_p (spec_tmpl
, spec_args
))
20370 list
= tree_cons (spec_args
, TREE_VALUE (t
), list
);
20371 TREE_TYPE (list
) = TREE_TYPE (t
);
20379 ambiguous_p
= false;
20382 t
= TREE_CHAIN (t
);
20383 for (; t
; t
= TREE_CHAIN (t
))
20385 fate
= more_specialized_partial_spec (tmpl
, champ
, t
);
20392 t
= TREE_CHAIN (t
);
20395 ambiguous_p
= true;
20404 for (t
= list
; t
&& t
!= champ
; t
= TREE_CHAIN (t
))
20406 fate
= more_specialized_partial_spec (tmpl
, champ
, t
);
20409 ambiguous_p
= true;
20417 char *spaces
= NULL
;
20418 if (!(complain
& tf_error
))
20419 return error_mark_node
;
20420 if (TYPE_P (target
))
20421 error ("ambiguous template instantiation for %q#T", target
);
20423 error ("ambiguous template instantiation for %q#D", target
);
20424 str
= ngettext ("candidate is:", "candidates are:", list_length (list
));
20425 for (t
= list
; t
; t
= TREE_CHAIN (t
))
20427 tree subst
= build_tree_list (TREE_VALUE (t
), TREE_PURPOSE (t
));
20428 inform (DECL_SOURCE_LOCATION (TREE_VALUE (t
)),
20429 "%s %#S", spaces
? spaces
: str
, subst
);
20430 spaces
= spaces
? spaces
: get_spaces (str
);
20433 return error_mark_node
;
20439 /* Explicitly instantiate DECL. */
20442 do_decl_instantiation (tree decl
, tree storage
)
20444 tree result
= NULL_TREE
;
20447 if (!decl
|| decl
== error_mark_node
)
20448 /* An error occurred, for which grokdeclarator has already issued
20449 an appropriate message. */
20451 else if (! DECL_LANG_SPECIFIC (decl
))
20453 error ("explicit instantiation of non-template %q#D", decl
);
20457 bool var_templ
= (DECL_TEMPLATE_INFO (decl
)
20458 && variable_template_p (DECL_TI_TEMPLATE (decl
)));
20460 if (VAR_P (decl
) && !var_templ
)
20462 /* There is an asymmetry here in the way VAR_DECLs and
20463 FUNCTION_DECLs are handled by grokdeclarator. In the case of
20464 the latter, the DECL we get back will be marked as a
20465 template instantiation, and the appropriate
20466 DECL_TEMPLATE_INFO will be set up. This does not happen for
20467 VAR_DECLs so we do the lookup here. Probably, grokdeclarator
20468 should handle VAR_DECLs as it currently handles
20470 if (!DECL_CLASS_SCOPE_P (decl
))
20472 error ("%qD is not a static data member of a class template", decl
);
20475 result
= lookup_field (DECL_CONTEXT (decl
), DECL_NAME (decl
), 0, false);
20476 if (!result
|| !VAR_P (result
))
20478 error ("no matching template for %qD found", decl
);
20481 if (!same_type_p (TREE_TYPE (result
), TREE_TYPE (decl
)))
20483 error ("type %qT for explicit instantiation %qD does not match "
20484 "declared type %qT", TREE_TYPE (result
), decl
,
20489 else if (TREE_CODE (decl
) != FUNCTION_DECL
&& !var_templ
)
20491 error ("explicit instantiation of %q#D", decl
);
20497 /* Check for various error cases. Note that if the explicit
20498 instantiation is valid the RESULT will currently be marked as an
20499 *implicit* instantiation; DECL_EXPLICIT_INSTANTIATION is not set
20500 until we get here. */
20502 if (DECL_TEMPLATE_SPECIALIZATION (result
))
20504 /* DR 259 [temp.spec].
20506 Both an explicit instantiation and a declaration of an explicit
20507 specialization shall not appear in a program unless the explicit
20508 instantiation follows a declaration of the explicit specialization.
20510 For a given set of template parameters, if an explicit
20511 instantiation of a template appears after a declaration of an
20512 explicit specialization for that template, the explicit
20513 instantiation has no effect. */
20516 else if (DECL_EXPLICIT_INSTANTIATION (result
))
20520 No program shall explicitly instantiate any template more
20523 We check DECL_NOT_REALLY_EXTERN so as not to complain when
20524 the first instantiation was `extern' and the second is not,
20525 and EXTERN_P for the opposite case. */
20526 if (DECL_NOT_REALLY_EXTERN (result
) && !extern_p
)
20527 permerror (input_location
, "duplicate explicit instantiation of %q#D", result
);
20528 /* If an "extern" explicit instantiation follows an ordinary
20529 explicit instantiation, the template is instantiated. */
20533 else if (!DECL_IMPLICIT_INSTANTIATION (result
))
20535 error ("no matching template for %qD found", result
);
20538 else if (!DECL_TEMPLATE_INFO (result
))
20540 permerror (input_location
, "explicit instantiation of non-template %q#D", result
);
20544 if (storage
== NULL_TREE
)
20546 else if (storage
== ridpointers
[(int) RID_EXTERN
])
20548 if (!in_system_header_at (input_location
) && (cxx_dialect
== cxx98
))
20549 pedwarn (input_location
, OPT_Wpedantic
,
20550 "ISO C++ 1998 forbids the use of %<extern%> on explicit "
20555 error ("storage class %qD applied to template instantiation", storage
);
20557 check_explicit_instantiation_namespace (result
);
20558 mark_decl_instantiated (result
, extern_p
);
20560 instantiate_decl (result
, /*defer_ok=*/1,
20561 /*expl_inst_class_mem_p=*/false);
20565 mark_class_instantiated (tree t
, int extern_p
)
20567 SET_CLASSTYPE_EXPLICIT_INSTANTIATION (t
);
20568 SET_CLASSTYPE_INTERFACE_KNOWN (t
);
20569 CLASSTYPE_INTERFACE_ONLY (t
) = extern_p
;
20570 TYPE_DECL_SUPPRESS_DEBUG (TYPE_NAME (t
)) = extern_p
;
20573 CLASSTYPE_DEBUG_REQUESTED (t
) = 1;
20574 rest_of_type_compilation (t
, 1);
20578 /* Called from do_type_instantiation through binding_table_foreach to
20579 do recursive instantiation for the type bound in ENTRY. */
20581 bt_instantiate_type_proc (binding_entry entry
, void *data
)
20583 tree storage
= *(tree
*) data
;
20585 if (MAYBE_CLASS_TYPE_P (entry
->type
)
20586 && !uses_template_parms (CLASSTYPE_TI_ARGS (entry
->type
)))
20587 do_type_instantiation (TYPE_MAIN_DECL (entry
->type
), storage
, 0);
20590 /* Called from do_type_instantiation to instantiate a member
20591 (a member function or a static member variable) of an
20592 explicitly instantiated class template. */
20594 instantiate_class_member (tree decl
, int extern_p
)
20596 mark_decl_instantiated (decl
, extern_p
);
20598 instantiate_decl (decl
, /*defer_ok=*/1,
20599 /*expl_inst_class_mem_p=*/true);
20602 /* Perform an explicit instantiation of template class T. STORAGE, if
20603 non-null, is the RID for extern, inline or static. COMPLAIN is
20604 nonzero if this is called from the parser, zero if called recursively,
20605 since the standard is unclear (as detailed below). */
20608 do_type_instantiation (tree t
, tree storage
, tsubst_flags_t complain
)
20613 int previous_instantiation_extern_p
= 0;
20615 if (TREE_CODE (t
) == TYPE_DECL
)
20618 if (! CLASS_TYPE_P (t
) || ! CLASSTYPE_TEMPLATE_INFO (t
))
20621 (TYPE_TEMPLATE_INFO (t
)) ? TYPE_TI_TEMPLATE (t
) : NULL
;
20623 error ("explicit instantiation of non-class template %qD", tmpl
);
20625 error ("explicit instantiation of non-template type %qT", t
);
20631 if (!COMPLETE_TYPE_P (t
))
20633 if (complain
& tf_error
)
20634 error ("explicit instantiation of %q#T before definition of template",
20639 if (storage
!= NULL_TREE
)
20641 if (!in_system_header_at (input_location
))
20643 if (storage
== ridpointers
[(int) RID_EXTERN
])
20645 if (cxx_dialect
== cxx98
)
20646 pedwarn (input_location
, OPT_Wpedantic
,
20647 "ISO C++ 1998 forbids the use of %<extern%> on "
20648 "explicit instantiations");
20651 pedwarn (input_location
, OPT_Wpedantic
,
20652 "ISO C++ forbids the use of %qE"
20653 " on explicit instantiations", storage
);
20656 if (storage
== ridpointers
[(int) RID_INLINE
])
20658 else if (storage
== ridpointers
[(int) RID_EXTERN
])
20660 else if (storage
== ridpointers
[(int) RID_STATIC
])
20664 error ("storage class %qD applied to template instantiation",
20670 if (CLASSTYPE_TEMPLATE_SPECIALIZATION (t
))
20672 /* DR 259 [temp.spec].
20674 Both an explicit instantiation and a declaration of an explicit
20675 specialization shall not appear in a program unless the explicit
20676 instantiation follows a declaration of the explicit specialization.
20678 For a given set of template parameters, if an explicit
20679 instantiation of a template appears after a declaration of an
20680 explicit specialization for that template, the explicit
20681 instantiation has no effect. */
20684 else if (CLASSTYPE_EXPLICIT_INSTANTIATION (t
))
20688 No program shall explicitly instantiate any template more
20691 If PREVIOUS_INSTANTIATION_EXTERN_P, then the first explicit
20692 instantiation was `extern'. If EXTERN_P then the second is.
20693 These cases are OK. */
20694 previous_instantiation_extern_p
= CLASSTYPE_INTERFACE_ONLY (t
);
20696 if (!previous_instantiation_extern_p
&& !extern_p
20697 && (complain
& tf_error
))
20698 permerror (input_location
, "duplicate explicit instantiation of %q#T", t
);
20700 /* If we've already instantiated the template, just return now. */
20701 if (!CLASSTYPE_INTERFACE_ONLY (t
))
20705 check_explicit_instantiation_namespace (TYPE_NAME (t
));
20706 mark_class_instantiated (t
, extern_p
);
20714 /* In contrast to implicit instantiation, where only the
20715 declarations, and not the definitions, of members are
20716 instantiated, we have here:
20720 The explicit instantiation of a class template specialization
20721 implies the instantiation of all of its members not
20722 previously explicitly specialized in the translation unit
20723 containing the explicit instantiation.
20725 Of course, we can't instantiate member template classes, since
20726 we don't have any arguments for them. Note that the standard
20727 is unclear on whether the instantiation of the members are
20728 *explicit* instantiations or not. However, the most natural
20729 interpretation is that it should be an explicit instantiation. */
20732 for (tmp
= TYPE_METHODS (t
); tmp
; tmp
= DECL_CHAIN (tmp
))
20733 if (TREE_CODE (tmp
) == FUNCTION_DECL
20734 && DECL_TEMPLATE_INSTANTIATION (tmp
))
20735 instantiate_class_member (tmp
, extern_p
);
20737 for (tmp
= TYPE_FIELDS (t
); tmp
; tmp
= DECL_CHAIN (tmp
))
20738 if (VAR_P (tmp
) && DECL_TEMPLATE_INSTANTIATION (tmp
))
20739 instantiate_class_member (tmp
, extern_p
);
20741 if (CLASSTYPE_NESTED_UTDS (t
))
20742 binding_table_foreach (CLASSTYPE_NESTED_UTDS (t
),
20743 bt_instantiate_type_proc
, &storage
);
20747 /* Given a function DECL, which is a specialization of TMPL, modify
20748 DECL to be a re-instantiation of TMPL with the same template
20749 arguments. TMPL should be the template into which tsubst'ing
20750 should occur for DECL, not the most general template.
20752 One reason for doing this is a scenario like this:
20755 void f(const T&, int i);
20757 void g() { f(3, 7); }
20760 void f(const T& t, const int i) { }
20762 Note that when the template is first instantiated, with
20763 instantiate_template, the resulting DECL will have no name for the
20764 first parameter, and the wrong type for the second. So, when we go
20765 to instantiate the DECL, we regenerate it. */
20768 regenerate_decl_from_template (tree decl
, tree tmpl
)
20770 /* The arguments used to instantiate DECL, from the most general
20775 args
= DECL_TI_ARGS (decl
);
20776 code_pattern
= DECL_TEMPLATE_RESULT (tmpl
);
20778 /* Make sure that we can see identifiers, and compute access
20780 push_access_scope (decl
);
20782 if (TREE_CODE (decl
) == FUNCTION_DECL
)
20790 args_depth
= TMPL_ARGS_DEPTH (args
);
20791 parms_depth
= TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl
));
20792 if (args_depth
> parms_depth
)
20793 args
= get_innermost_template_args (args
, parms_depth
);
20795 specs
= tsubst_exception_specification (TREE_TYPE (code_pattern
),
20796 args
, tf_error
, NULL_TREE
,
20797 /*defer_ok*/false);
20798 if (specs
&& specs
!= error_mark_node
)
20799 TREE_TYPE (decl
) = build_exception_variant (TREE_TYPE (decl
),
20802 /* Merge parameter declarations. */
20803 decl_parm
= skip_artificial_parms_for (decl
,
20804 DECL_ARGUMENTS (decl
));
20806 = skip_artificial_parms_for (code_pattern
,
20807 DECL_ARGUMENTS (code_pattern
));
20808 while (decl_parm
&& !DECL_PACK_P (pattern_parm
))
20813 if (DECL_NAME (decl_parm
) != DECL_NAME (pattern_parm
))
20814 DECL_NAME (decl_parm
) = DECL_NAME (pattern_parm
);
20815 parm_type
= tsubst (TREE_TYPE (pattern_parm
), args
, tf_error
,
20817 parm_type
= type_decays_to (parm_type
);
20818 if (!same_type_p (TREE_TYPE (decl_parm
), parm_type
))
20819 TREE_TYPE (decl_parm
) = parm_type
;
20820 attributes
= DECL_ATTRIBUTES (pattern_parm
);
20821 if (DECL_ATTRIBUTES (decl_parm
) != attributes
)
20823 DECL_ATTRIBUTES (decl_parm
) = attributes
;
20824 cplus_decl_attributes (&decl_parm
, attributes
, /*flags=*/0);
20826 decl_parm
= DECL_CHAIN (decl_parm
);
20827 pattern_parm
= DECL_CHAIN (pattern_parm
);
20829 /* Merge any parameters that match with the function parameter
20831 if (pattern_parm
&& DECL_PACK_P (pattern_parm
))
20834 tree expanded_types
;
20835 /* Expand the TYPE_PACK_EXPANSION that provides the types for
20836 the parameters in this function parameter pack. */
20837 expanded_types
= tsubst_pack_expansion (TREE_TYPE (pattern_parm
),
20838 args
, tf_error
, NULL_TREE
);
20839 len
= TREE_VEC_LENGTH (expanded_types
);
20840 for (i
= 0; i
< len
; i
++)
20845 if (DECL_NAME (decl_parm
) != DECL_NAME (pattern_parm
))
20846 /* Rename the parameter to include the index. */
20847 DECL_NAME (decl_parm
) =
20848 make_ith_pack_parameter_name (DECL_NAME (pattern_parm
), i
);
20849 parm_type
= TREE_VEC_ELT (expanded_types
, i
);
20850 parm_type
= type_decays_to (parm_type
);
20851 if (!same_type_p (TREE_TYPE (decl_parm
), parm_type
))
20852 TREE_TYPE (decl_parm
) = parm_type
;
20853 attributes
= DECL_ATTRIBUTES (pattern_parm
);
20854 if (DECL_ATTRIBUTES (decl_parm
) != attributes
)
20856 DECL_ATTRIBUTES (decl_parm
) = attributes
;
20857 cplus_decl_attributes (&decl_parm
, attributes
, /*flags=*/0);
20859 decl_parm
= DECL_CHAIN (decl_parm
);
20862 /* Merge additional specifiers from the CODE_PATTERN. */
20863 if (DECL_DECLARED_INLINE_P (code_pattern
)
20864 && !DECL_DECLARED_INLINE_P (decl
))
20865 DECL_DECLARED_INLINE_P (decl
) = 1;
20867 else if (VAR_P (decl
))
20869 DECL_INITIAL (decl
) =
20870 tsubst_expr (DECL_INITIAL (code_pattern
), args
,
20871 tf_error
, DECL_TI_TEMPLATE (decl
),
20872 /*integral_constant_expression_p=*/false);
20873 if (VAR_HAD_UNKNOWN_BOUND (decl
))
20874 TREE_TYPE (decl
) = tsubst (TREE_TYPE (code_pattern
), args
,
20875 tf_error
, DECL_TI_TEMPLATE (decl
));
20878 gcc_unreachable ();
20880 pop_access_scope (decl
);
20883 /* Return the TEMPLATE_DECL into which DECL_TI_ARGS(DECL) should be
20884 substituted to get DECL. */
20887 template_for_substitution (tree decl
)
20889 tree tmpl
= DECL_TI_TEMPLATE (decl
);
20891 /* Set TMPL to the template whose DECL_TEMPLATE_RESULT is the pattern
20892 for the instantiation. This is not always the most general
20893 template. Consider, for example:
20896 struct S { template <class U> void f();
20897 template <> void f<int>(); };
20899 and an instantiation of S<double>::f<int>. We want TD to be the
20900 specialization S<T>::f<int>, not the more general S<T>::f<U>. */
20901 while (/* An instantiation cannot have a definition, so we need a
20902 more general template. */
20903 DECL_TEMPLATE_INSTANTIATION (tmpl
)
20904 /* We must also deal with friend templates. Given:
20906 template <class T> struct S {
20907 template <class U> friend void f() {};
20910 S<int>::f<U> say, is not an instantiation of S<T>::f<U>,
20911 so far as the language is concerned, but that's still
20912 where we get the pattern for the instantiation from. On
20913 other hand, if the definition comes outside the class, say:
20915 template <class T> struct S {
20916 template <class U> friend void f();
20918 template <class U> friend void f() {}
20920 we don't need to look any further. That's what the check for
20921 DECL_INITIAL is for. */
20922 || (TREE_CODE (decl
) == FUNCTION_DECL
20923 && DECL_FRIEND_PSEUDO_TEMPLATE_INSTANTIATION (tmpl
)
20924 && !DECL_INITIAL (DECL_TEMPLATE_RESULT (tmpl
))))
20926 /* The present template, TD, should not be a definition. If it
20927 were a definition, we should be using it! Note that we
20928 cannot restructure the loop to just keep going until we find
20929 a template with a definition, since that might go too far if
20930 a specialization was declared, but not defined. */
20932 /* Fetch the more general template. */
20933 tmpl
= DECL_TI_TEMPLATE (tmpl
);
20939 /* Returns true if we need to instantiate this template instance even if we
20940 know we aren't going to emit it. */
20943 always_instantiate_p (tree decl
)
20945 /* We always instantiate inline functions so that we can inline them. An
20946 explicit instantiation declaration prohibits implicit instantiation of
20947 non-inline functions. With high levels of optimization, we would
20948 normally inline non-inline functions -- but we're not allowed to do
20949 that for "extern template" functions. Therefore, we check
20950 DECL_DECLARED_INLINE_P, rather than possibly_inlined_p. */
20951 return ((TREE_CODE (decl
) == FUNCTION_DECL
20952 && (DECL_DECLARED_INLINE_P (decl
)
20953 || type_uses_auto (TREE_TYPE (TREE_TYPE (decl
)))))
20954 /* And we need to instantiate static data members so that
20955 their initializers are available in integral constant
20958 && decl_maybe_constant_var_p (decl
)));
20961 /* If FN has a noexcept-specifier that hasn't been instantiated yet,
20962 instantiate it now, modifying TREE_TYPE (fn). */
20965 maybe_instantiate_noexcept (tree fn
)
20967 tree fntype
, spec
, noex
, clone
;
20969 /* Don't instantiate a noexcept-specification from template context. */
20970 if (processing_template_decl
)
20973 if (DECL_CLONED_FUNCTION_P (fn
))
20974 fn
= DECL_CLONED_FUNCTION (fn
);
20975 fntype
= TREE_TYPE (fn
);
20976 spec
= TYPE_RAISES_EXCEPTIONS (fntype
);
20978 if (!spec
|| !TREE_PURPOSE (spec
))
20981 noex
= TREE_PURPOSE (spec
);
20983 if (TREE_CODE (noex
) == DEFERRED_NOEXCEPT
)
20985 if (DEFERRED_NOEXCEPT_PATTERN (noex
) == NULL_TREE
)
20986 spec
= get_defaulted_eh_spec (fn
);
20987 else if (push_tinst_level (fn
))
20989 push_access_scope (fn
);
20990 push_deferring_access_checks (dk_no_deferred
);
20991 input_location
= DECL_SOURCE_LOCATION (fn
);
20992 noex
= tsubst_copy_and_build (DEFERRED_NOEXCEPT_PATTERN (noex
),
20993 DEFERRED_NOEXCEPT_ARGS (noex
),
20994 tf_warning_or_error
, fn
,
20995 /*function_p=*/false,
20996 /*integral_constant_expression_p=*/true);
20997 pop_deferring_access_checks ();
20998 pop_access_scope (fn
);
20999 pop_tinst_level ();
21000 spec
= build_noexcept_spec (noex
, tf_warning_or_error
);
21001 if (spec
== error_mark_node
)
21002 spec
= noexcept_false_spec
;
21005 spec
= noexcept_false_spec
;
21007 TREE_TYPE (fn
) = build_exception_variant (fntype
, spec
);
21010 FOR_EACH_CLONE (clone
, fn
)
21012 if (TREE_TYPE (clone
) == fntype
)
21013 TREE_TYPE (clone
) = TREE_TYPE (fn
);
21015 TREE_TYPE (clone
) = build_exception_variant (TREE_TYPE (clone
), spec
);
21019 /* Produce the definition of D, a _DECL generated from a template. If
21020 DEFER_OK is nonzero, then we don't have to actually do the
21021 instantiation now; we just have to do it sometime. Normally it is
21022 an error if this is an explicit instantiation but D is undefined.
21023 EXPL_INST_CLASS_MEM_P is true iff D is a member of an
21024 explicitly instantiated class template. */
21027 instantiate_decl (tree d
, int defer_ok
,
21028 bool expl_inst_class_mem_p
)
21030 tree tmpl
= DECL_TI_TEMPLATE (d
);
21037 bool pattern_defined
;
21038 location_t saved_loc
= input_location
;
21039 int saved_unevaluated_operand
= cp_unevaluated_operand
;
21040 int saved_inhibit_evaluation_warnings
= c_inhibit_evaluation_warnings
;
21046 /* This function should only be used to instantiate templates for
21047 functions and static member variables. */
21048 gcc_assert (VAR_OR_FUNCTION_DECL_P (d
));
21050 /* A concept is never instantiated. */
21051 gcc_assert (!DECL_DECLARED_CONCEPT_P (d
));
21053 /* Variables are never deferred; if instantiation is required, they
21054 are instantiated right away. That allows for better code in the
21055 case that an expression refers to the value of the variable --
21056 if the variable has a constant value the referring expression can
21057 take advantage of that fact. */
21059 || DECL_DECLARED_CONSTEXPR_P (d
))
21062 /* Don't instantiate cloned functions. Instead, instantiate the
21063 functions they cloned. */
21064 if (TREE_CODE (d
) == FUNCTION_DECL
&& DECL_CLONED_FUNCTION_P (d
))
21065 d
= DECL_CLONED_FUNCTION (d
);
21067 if (DECL_TEMPLATE_INSTANTIATED (d
)
21068 || (TREE_CODE (d
) == FUNCTION_DECL
21069 && DECL_DEFAULTED_FN (d
) && DECL_INITIAL (d
))
21070 || DECL_TEMPLATE_SPECIALIZATION (d
))
21071 /* D has already been instantiated or explicitly specialized, so
21072 there's nothing for us to do here.
21074 It might seem reasonable to check whether or not D is an explicit
21075 instantiation, and, if so, stop here. But when an explicit
21076 instantiation is deferred until the end of the compilation,
21077 DECL_EXPLICIT_INSTANTIATION is set, even though we still need to do
21078 the instantiation. */
21081 /* Check to see whether we know that this template will be
21082 instantiated in some other file, as with "extern template"
21084 external_p
= (DECL_INTERFACE_KNOWN (d
) && DECL_REALLY_EXTERN (d
));
21086 /* In general, we do not instantiate such templates. */
21087 if (external_p
&& !always_instantiate_p (d
))
21090 gen_tmpl
= most_general_template (tmpl
);
21091 gen_args
= DECL_TI_ARGS (d
);
21093 if (tmpl
!= gen_tmpl
)
21094 /* We should already have the extra args. */
21095 gcc_assert (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (gen_tmpl
))
21096 == TMPL_ARGS_DEPTH (gen_args
));
21097 /* And what's in the hash table should match D. */
21098 gcc_assert ((spec
= retrieve_specialization (gen_tmpl
, gen_args
, 0)) == d
21099 || spec
== NULL_TREE
);
21101 /* This needs to happen before any tsubsting. */
21102 if (! push_tinst_level (d
))
21105 timevar_push (TV_TEMPLATE_INST
);
21107 /* Set TD to the template whose DECL_TEMPLATE_RESULT is the pattern
21108 for the instantiation. */
21109 td
= template_for_substitution (d
);
21110 code_pattern
= DECL_TEMPLATE_RESULT (td
);
21112 /* We should never be trying to instantiate a member of a class
21113 template or partial specialization. */
21114 gcc_assert (d
!= code_pattern
);
21116 if ((DECL_NAMESPACE_SCOPE_P (d
) && !DECL_INITIALIZED_IN_CLASS_P (d
))
21117 || DECL_TEMPLATE_SPECIALIZATION (td
))
21118 /* In the case of a friend template whose definition is provided
21119 outside the class, we may have too many arguments. Drop the
21120 ones we don't need. The same is true for specializations. */
21121 args
= get_innermost_template_args
21122 (gen_args
, TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (td
)));
21126 if (TREE_CODE (d
) == FUNCTION_DECL
)
21128 deleted_p
= DECL_DELETED_FN (code_pattern
);
21129 pattern_defined
= (DECL_SAVED_TREE (code_pattern
) != NULL_TREE
21130 || DECL_DEFAULTED_OUTSIDE_CLASS_P (code_pattern
)
21136 pattern_defined
= ! DECL_IN_AGGR_P (code_pattern
);
21139 /* We may be in the middle of deferred access check. Disable it now. */
21140 push_deferring_access_checks (dk_no_deferred
);
21142 /* Unless an explicit instantiation directive has already determined
21143 the linkage of D, remember that a definition is available for
21145 if (pattern_defined
21146 && !DECL_INTERFACE_KNOWN (d
)
21147 && !DECL_NOT_REALLY_EXTERN (d
))
21148 mark_definable (d
);
21150 DECL_SOURCE_LOCATION (td
) = DECL_SOURCE_LOCATION (code_pattern
);
21151 DECL_SOURCE_LOCATION (d
) = DECL_SOURCE_LOCATION (code_pattern
);
21152 input_location
= DECL_SOURCE_LOCATION (d
);
21154 /* If D is a member of an explicitly instantiated class template,
21155 and no definition is available, treat it like an implicit
21157 if (!pattern_defined
&& expl_inst_class_mem_p
21158 && DECL_EXPLICIT_INSTANTIATION (d
))
21160 /* Leave linkage flags alone on instantiations with anonymous
21162 if (TREE_PUBLIC (d
))
21164 DECL_NOT_REALLY_EXTERN (d
) = 0;
21165 DECL_INTERFACE_KNOWN (d
) = 0;
21167 SET_DECL_IMPLICIT_INSTANTIATION (d
);
21170 /* Defer all other templates, unless we have been explicitly
21171 forbidden from doing so. */
21172 if (/* If there is no definition, we cannot instantiate the
21175 /* If it's OK to postpone instantiation, do so. */
21177 /* If this is a static data member that will be defined
21178 elsewhere, we don't want to instantiate the entire data
21179 member, but we do want to instantiate the initializer so that
21180 we can substitute that elsewhere. */
21181 || (external_p
&& VAR_P (d
))
21182 /* Handle here a deleted function too, avoid generating
21183 its body (c++/61080). */
21186 /* The definition of the static data member is now required so
21187 we must substitute the initializer. */
21189 && !DECL_INITIAL (d
)
21190 && DECL_INITIAL (code_pattern
))
21194 bool const_init
= false;
21195 bool enter_context
= DECL_CLASS_SCOPE_P (d
);
21197 ns
= decl_namespace_context (d
);
21198 push_nested_namespace (ns
);
21200 push_nested_class (DECL_CONTEXT (d
));
21201 init
= tsubst_expr (DECL_INITIAL (code_pattern
),
21203 tf_warning_or_error
, NULL_TREE
,
21204 /*integral_constant_expression_p=*/false);
21205 /* If instantiating the initializer involved instantiating this
21206 again, don't call cp_finish_decl twice. */
21207 if (!DECL_INITIAL (d
))
21209 /* Make sure the initializer is still constant, in case of
21210 circular dependency (template/instantiate6.C). */
21212 = DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (code_pattern
);
21213 cp_finish_decl (d
, init
, /*init_const_expr_p=*/const_init
,
21214 /*asmspec_tree=*/NULL_TREE
,
21215 LOOKUP_ONLYCONVERTING
);
21218 pop_nested_class ();
21219 pop_nested_namespace (ns
);
21222 /* We restore the source position here because it's used by
21223 add_pending_template. */
21224 input_location
= saved_loc
;
21226 if (at_eof
&& !pattern_defined
21227 && DECL_EXPLICIT_INSTANTIATION (d
)
21228 && DECL_NOT_REALLY_EXTERN (d
))
21231 The definition of a non-exported function template, a
21232 non-exported member function template, or a non-exported
21233 member function or static data member of a class template
21234 shall be present in every translation unit in which it is
21235 explicitly instantiated. */
21236 permerror (input_location
, "explicit instantiation of %qD "
21237 "but no definition available", d
);
21239 /* If we're in unevaluated context, we just wanted to get the
21240 constant value; this isn't an odr use, so don't queue
21241 a full instantiation. */
21242 if (cp_unevaluated_operand
!= 0)
21244 /* ??? Historically, we have instantiated inline functions, even
21245 when marked as "extern template". */
21246 if (!(external_p
&& VAR_P (d
)))
21247 add_pending_template (d
);
21250 /* Tell the repository that D is available in this translation unit
21251 -- and see if it is supposed to be instantiated here. */
21252 if (TREE_PUBLIC (d
) && !DECL_REALLY_EXTERN (d
) && !repo_emit_p (d
))
21254 /* In a PCH file, despite the fact that the repository hasn't
21255 requested instantiation in the PCH it is still possible that
21256 an instantiation will be required in a file that includes the
21259 add_pending_template (d
);
21260 /* Instantiate inline functions so that the inliner can do its
21261 job, even though we'll not be emitting a copy of this
21263 if (!(TREE_CODE (d
) == FUNCTION_DECL
&& possibly_inlined_p (d
)))
21267 fn_context
= decl_function_context (d
);
21268 nested
= (current_function_decl
!= NULL_TREE
);
21270 push_to_top_level ();
21274 push_function_context ();
21275 cp_unevaluated_operand
= 0;
21276 c_inhibit_evaluation_warnings
= 0;
21279 /* Mark D as instantiated so that recursive calls to
21280 instantiate_decl do not try to instantiate it again. */
21281 DECL_TEMPLATE_INSTANTIATED (d
) = 1;
21283 /* Regenerate the declaration in case the template has been modified
21284 by a subsequent redeclaration. */
21285 regenerate_decl_from_template (d
, td
);
21287 /* We already set the file and line above. Reset them now in case
21288 they changed as a result of calling regenerate_decl_from_template. */
21289 input_location
= DECL_SOURCE_LOCATION (d
);
21294 bool const_init
= false;
21296 /* Clear out DECL_RTL; whatever was there before may not be right
21297 since we've reset the type of the declaration. */
21298 SET_DECL_RTL (d
, NULL
);
21299 DECL_IN_AGGR_P (d
) = 0;
21301 /* The initializer is placed in DECL_INITIAL by
21302 regenerate_decl_from_template so we don't need to
21303 push/pop_access_scope again here. Pull it out so that
21304 cp_finish_decl can process it. */
21305 init
= DECL_INITIAL (d
);
21306 DECL_INITIAL (d
) = NULL_TREE
;
21307 DECL_INITIALIZED_P (d
) = 0;
21309 /* Clear DECL_EXTERNAL so that cp_finish_decl will process the
21310 initializer. That function will defer actual emission until
21311 we have a chance to determine linkage. */
21312 DECL_EXTERNAL (d
) = 0;
21314 /* Enter the scope of D so that access-checking works correctly. */
21315 bool enter_context
= DECL_CLASS_SCOPE_P (d
);
21317 push_nested_class (DECL_CONTEXT (d
));
21319 const_init
= DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (code_pattern
);
21320 cp_finish_decl (d
, init
, const_init
, NULL_TREE
, 0);
21323 pop_nested_class ();
21325 if (variable_template_p (td
))
21326 note_variable_template_instantiation (d
);
21328 else if (TREE_CODE (d
) == FUNCTION_DECL
&& DECL_DEFAULTED_FN (code_pattern
))
21329 synthesize_method (d
);
21330 else if (TREE_CODE (d
) == FUNCTION_DECL
)
21332 hash_map
<tree
, tree
> *saved_local_specializations
;
21336 tree block
= NULL_TREE
;
21338 /* Save away the current list, in case we are instantiating one
21339 template from within the body of another. */
21340 saved_local_specializations
= local_specializations
;
21342 /* Set up the list of local specializations. */
21343 local_specializations
= new hash_map
<tree
, tree
>;
21345 /* Set up context. */
21346 if (DECL_OMP_DECLARE_REDUCTION_P (code_pattern
)
21347 && TREE_CODE (DECL_CONTEXT (code_pattern
)) == FUNCTION_DECL
)
21348 block
= push_stmt_list ();
21350 start_preparsed_function (d
, NULL_TREE
, SF_PRE_PARSED
);
21352 /* Some typedefs referenced from within the template code need to be
21353 access checked at template instantiation time, i.e now. These
21354 types were added to the template at parsing time. Let's get those
21355 and perform the access checks then. */
21356 perform_typedefs_access_check (DECL_TEMPLATE_RESULT (gen_tmpl
),
21359 /* Create substitution entries for the parameters. */
21360 subst_decl
= DECL_TEMPLATE_RESULT (template_for_substitution (d
));
21361 tmpl_parm
= DECL_ARGUMENTS (subst_decl
);
21362 spec_parm
= DECL_ARGUMENTS (d
);
21363 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (d
))
21365 register_local_specialization (spec_parm
, tmpl_parm
);
21366 spec_parm
= skip_artificial_parms_for (d
, spec_parm
);
21367 tmpl_parm
= skip_artificial_parms_for (subst_decl
, tmpl_parm
);
21369 for (; tmpl_parm
; tmpl_parm
= DECL_CHAIN (tmpl_parm
))
21371 if (!DECL_PACK_P (tmpl_parm
))
21373 register_local_specialization (spec_parm
, tmpl_parm
);
21374 spec_parm
= DECL_CHAIN (spec_parm
);
21378 /* Register the (value) argument pack as a specialization of
21379 TMPL_PARM, then move on. */
21380 tree argpack
= extract_fnparm_pack (tmpl_parm
, &spec_parm
);
21381 register_local_specialization (argpack
, tmpl_parm
);
21384 gcc_assert (!spec_parm
);
21386 /* Substitute into the body of the function. */
21387 if (DECL_OMP_DECLARE_REDUCTION_P (code_pattern
))
21388 tsubst_omp_udr (DECL_SAVED_TREE (code_pattern
), args
,
21389 tf_warning_or_error
, tmpl
);
21392 tsubst_expr (DECL_SAVED_TREE (code_pattern
), args
,
21393 tf_warning_or_error
, tmpl
,
21394 /*integral_constant_expression_p=*/false);
21396 /* Set the current input_location to the end of the function
21397 so that finish_function knows where we are. */
21399 = DECL_STRUCT_FUNCTION (code_pattern
)->function_end_locus
;
21401 /* Remember if we saw an infinite loop in the template. */
21402 current_function_infinite_loop
21403 = DECL_STRUCT_FUNCTION (code_pattern
)->language
->infinite_loop
;
21406 /* We don't need the local specializations any more. */
21407 delete local_specializations
;
21408 local_specializations
= saved_local_specializations
;
21410 /* Finish the function. */
21411 if (DECL_OMP_DECLARE_REDUCTION_P (code_pattern
)
21412 && TREE_CODE (DECL_CONTEXT (code_pattern
)) == FUNCTION_DECL
)
21413 DECL_SAVED_TREE (d
) = pop_stmt_list (block
);
21416 d
= finish_function (0);
21417 expand_or_defer_fn (d
);
21420 if (DECL_OMP_DECLARE_REDUCTION_P (code_pattern
))
21421 cp_check_omp_declare_reduction (d
);
21424 /* We're not deferring instantiation any more. */
21425 TI_PENDING_TEMPLATE_FLAG (DECL_TEMPLATE_INFO (d
)) = 0;
21428 pop_from_top_level ();
21430 pop_function_context ();
21433 input_location
= saved_loc
;
21434 cp_unevaluated_operand
= saved_unevaluated_operand
;
21435 c_inhibit_evaluation_warnings
= saved_inhibit_evaluation_warnings
;
21436 pop_deferring_access_checks ();
21437 pop_tinst_level ();
21439 timevar_pop (TV_TEMPLATE_INST
);
21444 /* Run through the list of templates that we wish we could
21445 instantiate, and instantiate any we can. RETRIES is the
21446 number of times we retry pending template instantiation. */
21449 instantiate_pending_templates (int retries
)
21452 location_t saved_loc
= input_location
;
21454 /* Instantiating templates may trigger vtable generation. This in turn
21455 may require further template instantiations. We place a limit here
21456 to avoid infinite loop. */
21457 if (pending_templates
&& retries
>= max_tinst_depth
)
21459 tree decl
= pending_templates
->tinst
->decl
;
21461 fatal_error (input_location
,
21462 "template instantiation depth exceeds maximum of %d"
21463 " instantiating %q+D, possibly from virtual table generation"
21464 " (use -ftemplate-depth= to increase the maximum)",
21465 max_tinst_depth
, decl
);
21466 if (TREE_CODE (decl
) == FUNCTION_DECL
)
21467 /* Pretend that we defined it. */
21468 DECL_INITIAL (decl
) = error_mark_node
;
21474 struct pending_template
**t
= &pending_templates
;
21475 struct pending_template
*last
= NULL
;
21479 tree instantiation
= reopen_tinst_level ((*t
)->tinst
);
21480 bool complete
= false;
21482 if (TYPE_P (instantiation
))
21486 if (!COMPLETE_TYPE_P (instantiation
))
21488 instantiate_class_template (instantiation
);
21489 if (CLASSTYPE_TEMPLATE_INSTANTIATION (instantiation
))
21490 for (fn
= TYPE_METHODS (instantiation
);
21492 fn
= TREE_CHAIN (fn
))
21493 if (! DECL_ARTIFICIAL (fn
))
21494 instantiate_decl (fn
,
21496 /*expl_inst_class_mem_p=*/false);
21497 if (COMPLETE_TYPE_P (instantiation
))
21501 complete
= COMPLETE_TYPE_P (instantiation
);
21505 if (!DECL_TEMPLATE_SPECIALIZATION (instantiation
)
21506 && !DECL_TEMPLATE_INSTANTIATED (instantiation
))
21509 = instantiate_decl (instantiation
,
21511 /*expl_inst_class_mem_p=*/false);
21512 if (DECL_TEMPLATE_INSTANTIATED (instantiation
))
21516 complete
= (DECL_TEMPLATE_SPECIALIZATION (instantiation
)
21517 || DECL_TEMPLATE_INSTANTIATED (instantiation
));
21521 /* If INSTANTIATION has been instantiated, then we don't
21522 need to consider it again in the future. */
21530 current_tinst_level
= NULL
;
21532 last_pending_template
= last
;
21534 while (reconsider
);
21536 input_location
= saved_loc
;
21539 /* Substitute ARGVEC into T, which is a list of initializers for
21540 either base class or a non-static data member. The TREE_PURPOSEs
21541 are DECLs, and the TREE_VALUEs are the initializer values. Used by
21542 instantiate_decl. */
21545 tsubst_initializer_list (tree t
, tree argvec
)
21547 tree inits
= NULL_TREE
;
21549 for (; t
; t
= TREE_CHAIN (t
))
21553 tree expanded_bases
= NULL_TREE
;
21554 tree expanded_arguments
= NULL_TREE
;
21557 if (TREE_CODE (TREE_PURPOSE (t
)) == TYPE_PACK_EXPANSION
)
21562 /* Expand the base class expansion type into separate base
21564 expanded_bases
= tsubst_pack_expansion (TREE_PURPOSE (t
), argvec
,
21565 tf_warning_or_error
,
21567 if (expanded_bases
== error_mark_node
)
21570 /* We'll be building separate TREE_LISTs of arguments for
21572 len
= TREE_VEC_LENGTH (expanded_bases
);
21573 expanded_arguments
= make_tree_vec (len
);
21574 for (i
= 0; i
< len
; i
++)
21575 TREE_VEC_ELT (expanded_arguments
, i
) = NULL_TREE
;
21577 /* Build a dummy EXPR_PACK_EXPANSION that will be used to
21578 expand each argument in the TREE_VALUE of t. */
21579 expr
= make_node (EXPR_PACK_EXPANSION
);
21580 PACK_EXPANSION_LOCAL_P (expr
) = true;
21581 PACK_EXPANSION_PARAMETER_PACKS (expr
) =
21582 PACK_EXPANSION_PARAMETER_PACKS (TREE_PURPOSE (t
));
21584 if (TREE_VALUE (t
) == void_type_node
)
21585 /* VOID_TYPE_NODE is used to indicate
21586 value-initialization. */
21588 for (i
= 0; i
< len
; i
++)
21589 TREE_VEC_ELT (expanded_arguments
, i
) = void_type_node
;
21593 /* Substitute parameter packs into each argument in the
21595 in_base_initializer
= 1;
21596 for (arg
= TREE_VALUE (t
); arg
; arg
= TREE_CHAIN (arg
))
21598 tree expanded_exprs
;
21600 /* Expand the argument. */
21601 SET_PACK_EXPANSION_PATTERN (expr
, TREE_VALUE (arg
));
21603 = tsubst_pack_expansion (expr
, argvec
,
21604 tf_warning_or_error
,
21606 if (expanded_exprs
== error_mark_node
)
21609 /* Prepend each of the expanded expressions to the
21610 corresponding TREE_LIST in EXPANDED_ARGUMENTS. */
21611 for (i
= 0; i
< len
; i
++)
21613 TREE_VEC_ELT (expanded_arguments
, i
) =
21614 tree_cons (NULL_TREE
,
21615 TREE_VEC_ELT (expanded_exprs
, i
),
21616 TREE_VEC_ELT (expanded_arguments
, i
));
21619 in_base_initializer
= 0;
21621 /* Reverse all of the TREE_LISTs in EXPANDED_ARGUMENTS,
21622 since we built them backwards. */
21623 for (i
= 0; i
< len
; i
++)
21625 TREE_VEC_ELT (expanded_arguments
, i
) =
21626 nreverse (TREE_VEC_ELT (expanded_arguments
, i
));
21631 for (i
= 0; i
< len
; ++i
)
21633 if (expanded_bases
)
21635 decl
= TREE_VEC_ELT (expanded_bases
, i
);
21636 decl
= expand_member_init (decl
);
21637 init
= TREE_VEC_ELT (expanded_arguments
, i
);
21642 decl
= tsubst_copy (TREE_PURPOSE (t
), argvec
,
21643 tf_warning_or_error
, NULL_TREE
);
21645 decl
= expand_member_init (decl
);
21646 if (decl
&& !DECL_P (decl
))
21647 in_base_initializer
= 1;
21649 init
= TREE_VALUE (t
);
21651 if (init
!= void_type_node
)
21652 init
= tsubst_expr (init
, argvec
,
21653 tf_warning_or_error
, NULL_TREE
,
21654 /*integral_constant_expression_p=*/false);
21655 if (init
== NULL_TREE
&& tmp
!= NULL_TREE
)
21656 /* If we had an initializer but it instantiated to nothing,
21657 value-initialize the object. This will only occur when
21658 the initializer was a pack expansion where the parameter
21659 packs used in that expansion were of length zero. */
21660 init
= void_type_node
;
21661 in_base_initializer
= 0;
21666 init
= build_tree_list (decl
, init
);
21667 TREE_CHAIN (init
) = inits
;
21675 /* Set CURRENT_ACCESS_SPECIFIER based on the protection of DECL. */
21678 set_current_access_from_decl (tree decl
)
21680 if (TREE_PRIVATE (decl
))
21681 current_access_specifier
= access_private_node
;
21682 else if (TREE_PROTECTED (decl
))
21683 current_access_specifier
= access_protected_node
;
21685 current_access_specifier
= access_public_node
;
21688 /* Instantiate an enumerated type. TAG is the template type, NEWTAG
21689 is the instantiation (which should have been created with
21690 start_enum) and ARGS are the template arguments to use. */
21693 tsubst_enum (tree tag
, tree newtag
, tree args
)
21697 if (SCOPED_ENUM_P (newtag
))
21698 begin_scope (sk_scoped_enum
, newtag
);
21700 for (e
= TYPE_VALUES (tag
); e
; e
= TREE_CHAIN (e
))
21705 decl
= TREE_VALUE (e
);
21706 /* Note that in a template enum, the TREE_VALUE is the
21707 CONST_DECL, not the corresponding INTEGER_CST. */
21708 value
= tsubst_expr (DECL_INITIAL (decl
),
21709 args
, tf_warning_or_error
, NULL_TREE
,
21710 /*integral_constant_expression_p=*/true);
21712 /* Give this enumeration constant the correct access. */
21713 set_current_access_from_decl (decl
);
21715 /* Actually build the enumerator itself. Here we're assuming that
21716 enumerators can't have dependent attributes. */
21717 build_enumerator (DECL_NAME (decl
), value
, newtag
,
21718 DECL_ATTRIBUTES (decl
), DECL_SOURCE_LOCATION (decl
));
21721 if (SCOPED_ENUM_P (newtag
))
21724 finish_enum_value_list (newtag
);
21725 finish_enum (newtag
);
21727 DECL_SOURCE_LOCATION (TYPE_NAME (newtag
))
21728 = DECL_SOURCE_LOCATION (TYPE_NAME (tag
));
21731 /* DECL is a FUNCTION_DECL that is a template specialization. Return
21732 its type -- but without substituting the innermost set of template
21733 arguments. So, innermost set of template parameters will appear in
21737 get_mostly_instantiated_function_type (tree decl
)
21739 /* For a function, DECL_TI_TEMPLATE is partially instantiated. */
21740 return TREE_TYPE (DECL_TI_TEMPLATE (decl
));
21743 /* Return truthvalue if we're processing a template different from
21744 the last one involved in diagnostics. */
21746 problematic_instantiation_changed (void)
21748 return current_tinst_level
!= last_error_tinst_level
;
21751 /* Remember current template involved in diagnostics. */
21753 record_last_problematic_instantiation (void)
21755 last_error_tinst_level
= current_tinst_level
;
21758 struct tinst_level
*
21759 current_instantiation (void)
21761 return current_tinst_level
;
21764 /* Return TRUE if current_function_decl is being instantiated, false
21768 instantiating_current_function_p (void)
21770 return (current_instantiation ()
21771 && current_instantiation ()->decl
== current_function_decl
);
21774 /* [temp.param] Check that template non-type parm TYPE is of an allowable
21775 type. Return zero for ok, nonzero for disallowed. Issue error and
21776 warning messages under control of COMPLAIN. */
21779 invalid_nontype_parm_type_p (tree type
, tsubst_flags_t complain
)
21781 if (INTEGRAL_OR_ENUMERATION_TYPE_P (type
))
21783 else if (POINTER_TYPE_P (type
))
21785 else if (TYPE_PTRMEM_P (type
))
21787 else if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
)
21789 else if (TREE_CODE (type
) == TYPENAME_TYPE
)
21791 else if (TREE_CODE (type
) == DECLTYPE_TYPE
)
21793 else if (TREE_CODE (type
) == NULLPTR_TYPE
)
21795 /* A bound template template parm could later be instantiated to have a valid
21796 nontype parm type via an alias template. */
21797 else if (cxx_dialect
>= cxx11
21798 && TREE_CODE (type
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
21801 if (complain
& tf_error
)
21803 if (type
== error_mark_node
)
21804 inform (input_location
, "invalid template non-type parameter");
21806 error ("%q#T is not a valid type for a template non-type parameter",
21812 /* Returns TRUE if TYPE is dependent, in the sense of [temp.dep.type].
21813 Assumes that TYPE really is a type, and not the ERROR_MARK_NODE.*/
21816 dependent_type_p_r (tree type
)
21822 A type is dependent if it is:
21824 -- a template parameter. Template template parameters are types
21825 for us (since TYPE_P holds true for them) so we handle
21827 if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
21828 || TREE_CODE (type
) == TEMPLATE_TEMPLATE_PARM
)
21830 /* -- a qualified-id with a nested-name-specifier which contains a
21831 class-name that names a dependent type or whose unqualified-id
21832 names a dependent type. */
21833 if (TREE_CODE (type
) == TYPENAME_TYPE
)
21836 /* An alias template specialization can be dependent even if the
21837 resulting type is not. */
21838 if (dependent_alias_template_spec_p (type
))
21841 /* -- a cv-qualified type where the cv-unqualified type is
21843 No code is necessary for this bullet; the code below handles
21844 cv-qualified types, and we don't want to strip aliases with
21845 TYPE_MAIN_VARIANT because of DR 1558. */
21846 /* -- a compound type constructed from any dependent type. */
21847 if (TYPE_PTRMEM_P (type
))
21848 return (dependent_type_p (TYPE_PTRMEM_CLASS_TYPE (type
))
21849 || dependent_type_p (TYPE_PTRMEM_POINTED_TO_TYPE
21851 else if (TYPE_PTR_P (type
)
21852 || TREE_CODE (type
) == REFERENCE_TYPE
)
21853 return dependent_type_p (TREE_TYPE (type
));
21854 else if (TREE_CODE (type
) == FUNCTION_TYPE
21855 || TREE_CODE (type
) == METHOD_TYPE
)
21859 if (dependent_type_p (TREE_TYPE (type
)))
21861 for (arg_type
= TYPE_ARG_TYPES (type
);
21863 arg_type
= TREE_CHAIN (arg_type
))
21864 if (dependent_type_p (TREE_VALUE (arg_type
)))
21868 /* -- an array type constructed from any dependent type or whose
21869 size is specified by a constant expression that is
21872 We checked for type- and value-dependence of the bounds in
21873 compute_array_index_type, so TYPE_DEPENDENT_P is already set. */
21874 if (TREE_CODE (type
) == ARRAY_TYPE
)
21876 if (TYPE_DOMAIN (type
)
21877 && dependent_type_p (TYPE_DOMAIN (type
)))
21879 return dependent_type_p (TREE_TYPE (type
));
21882 /* -- a template-id in which either the template name is a template
21884 if (TREE_CODE (type
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
21886 /* ... or any of the template arguments is a dependent type or
21887 an expression that is type-dependent or value-dependent. */
21888 else if (CLASS_TYPE_P (type
) && CLASSTYPE_TEMPLATE_INFO (type
)
21889 && (any_dependent_template_arguments_p
21890 (INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (type
)))))
21893 /* All TYPEOF_TYPEs, DECLTYPE_TYPEs, and UNDERLYING_TYPEs are
21894 dependent; if the argument of the `typeof' expression is not
21895 type-dependent, then it should already been have resolved. */
21896 if (TREE_CODE (type
) == TYPEOF_TYPE
21897 || TREE_CODE (type
) == DECLTYPE_TYPE
21898 || TREE_CODE (type
) == UNDERLYING_TYPE
)
21901 /* A template argument pack is dependent if any of its packed
21903 if (TREE_CODE (type
) == TYPE_ARGUMENT_PACK
)
21905 tree args
= ARGUMENT_PACK_ARGS (type
);
21906 int i
, len
= TREE_VEC_LENGTH (args
);
21907 for (i
= 0; i
< len
; ++i
)
21908 if (dependent_template_arg_p (TREE_VEC_ELT (args
, i
)))
21912 /* All TYPE_PACK_EXPANSIONs are dependent, because parameter packs must
21913 be template parameters. */
21914 if (TREE_CODE (type
) == TYPE_PACK_EXPANSION
)
21917 /* The standard does not specifically mention types that are local
21918 to template functions or local classes, but they should be
21919 considered dependent too. For example:
21921 template <int I> void f() {
21926 The size of `E' cannot be known until the value of `I' has been
21927 determined. Therefore, `E' must be considered dependent. */
21928 scope
= TYPE_CONTEXT (type
);
21929 if (scope
&& TYPE_P (scope
))
21930 return dependent_type_p (scope
);
21931 /* Don't use type_dependent_expression_p here, as it can lead
21932 to infinite recursion trying to determine whether a lambda
21933 nested in a lambda is dependent (c++/47687). */
21934 else if (scope
&& TREE_CODE (scope
) == FUNCTION_DECL
21935 && DECL_LANG_SPECIFIC (scope
)
21936 && DECL_TEMPLATE_INFO (scope
)
21937 && (any_dependent_template_arguments_p
21938 (INNERMOST_TEMPLATE_ARGS (DECL_TI_ARGS (scope
)))))
21941 /* Other types are non-dependent. */
21945 /* Returns TRUE if TYPE is dependent, in the sense of
21946 [temp.dep.type]. Note that a NULL type is considered dependent. */
21949 dependent_type_p (tree type
)
21951 /* If there are no template parameters in scope, then there can't be
21952 any dependent types. */
21953 if (!processing_template_decl
)
21955 /* If we are not processing a template, then nobody should be
21956 providing us with a dependent type. */
21958 gcc_assert (TREE_CODE (type
) != TEMPLATE_TYPE_PARM
|| is_auto (type
));
21962 /* If the type is NULL, we have not computed a type for the entity
21963 in question; in that case, the type is dependent. */
21967 /* Erroneous types can be considered non-dependent. */
21968 if (type
== error_mark_node
)
21971 /* If we have not already computed the appropriate value for TYPE,
21973 if (!TYPE_DEPENDENT_P_VALID (type
))
21975 TYPE_DEPENDENT_P (type
) = dependent_type_p_r (type
);
21976 TYPE_DEPENDENT_P_VALID (type
) = 1;
21979 return TYPE_DEPENDENT_P (type
);
21982 /* Returns TRUE if SCOPE is a dependent scope, in which we can't do any
21983 lookup. In other words, a dependent type that is not the current
21987 dependent_scope_p (tree scope
)
21989 return (scope
&& TYPE_P (scope
) && dependent_type_p (scope
)
21990 && !currently_open_class (scope
));
21993 /* T is a SCOPE_REF; return whether we need to consider it
21994 instantiation-dependent so that we can check access at instantiation
21995 time even though we know which member it resolves to. */
21998 instantiation_dependent_scope_ref_p (tree t
)
22000 if (DECL_P (TREE_OPERAND (t
, 1))
22001 && CLASS_TYPE_P (TREE_OPERAND (t
, 0))
22002 && accessible_in_template_p (TREE_OPERAND (t
, 0),
22003 TREE_OPERAND (t
, 1)))
22009 /* Returns TRUE if the EXPRESSION is value-dependent, in the sense of
22010 [temp.dep.constexpr]. EXPRESSION is already known to be a constant
22013 /* Note that this predicate is not appropriate for general expressions;
22014 only constant expressions (that satisfy potential_constant_expression)
22015 can be tested for value dependence. */
22018 value_dependent_expression_p (tree expression
)
22020 if (!processing_template_decl
)
22023 /* A name declared with a dependent type. */
22024 if (DECL_P (expression
) && type_dependent_expression_p (expression
))
22027 switch (TREE_CODE (expression
))
22029 case IDENTIFIER_NODE
:
22030 /* A name that has not been looked up -- must be dependent. */
22033 case TEMPLATE_PARM_INDEX
:
22034 /* A non-type template parm. */
22038 /* A non-type template parm. */
22039 if (DECL_TEMPLATE_PARM_P (expression
))
22041 return value_dependent_expression_p (DECL_INITIAL (expression
));
22044 /* A constant with literal type and is initialized
22045 with an expression that is value-dependent.
22047 Note that a non-dependent parenthesized initializer will have
22048 already been replaced with its constant value, so if we see
22049 a TREE_LIST it must be dependent. */
22050 if (DECL_INITIAL (expression
)
22051 && decl_constant_var_p (expression
)
22052 && (TREE_CODE (DECL_INITIAL (expression
)) == TREE_LIST
22053 /* cp_finish_decl doesn't fold reference initializers. */
22054 || TREE_CODE (TREE_TYPE (expression
)) == REFERENCE_TYPE
22055 || value_dependent_expression_p (DECL_INITIAL (expression
))))
22059 case DYNAMIC_CAST_EXPR
:
22060 case STATIC_CAST_EXPR
:
22061 case CONST_CAST_EXPR
:
22062 case REINTERPRET_CAST_EXPR
:
22064 /* These expressions are value-dependent if the type to which
22065 the cast occurs is dependent or the expression being casted
22066 is value-dependent. */
22068 tree type
= TREE_TYPE (expression
);
22070 if (dependent_type_p (type
))
22073 /* A functional cast has a list of operands. */
22074 expression
= TREE_OPERAND (expression
, 0);
22077 /* If there are no operands, it must be an expression such
22078 as "int()". This should not happen for aggregate types
22079 because it would form non-constant expressions. */
22080 gcc_assert (cxx_dialect
>= cxx11
22081 || INTEGRAL_OR_ENUMERATION_TYPE_P (type
));
22086 if (TREE_CODE (expression
) == TREE_LIST
)
22087 return any_value_dependent_elements_p (expression
);
22089 return value_dependent_expression_p (expression
);
22093 if (SIZEOF_EXPR_TYPE_P (expression
))
22094 return dependent_type_p (TREE_TYPE (TREE_OPERAND (expression
, 0)));
22098 /* A `sizeof' expression is value-dependent if the operand is
22099 type-dependent or is a pack expansion. */
22100 expression
= TREE_OPERAND (expression
, 0);
22101 if (PACK_EXPANSION_P (expression
))
22103 else if (TYPE_P (expression
))
22104 return dependent_type_p (expression
);
22105 return instantiation_dependent_expression_p (expression
);
22107 case AT_ENCODE_EXPR
:
22108 /* An 'encode' expression is value-dependent if the operand is
22110 expression
= TREE_OPERAND (expression
, 0);
22111 return dependent_type_p (expression
);
22113 case NOEXCEPT_EXPR
:
22114 expression
= TREE_OPERAND (expression
, 0);
22115 return instantiation_dependent_expression_p (expression
);
22118 /* All instantiation-dependent expressions should also be considered
22119 value-dependent. */
22120 return instantiation_dependent_scope_ref_p (expression
);
22122 case COMPONENT_REF
:
22123 return (value_dependent_expression_p (TREE_OPERAND (expression
, 0))
22124 || value_dependent_expression_p (TREE_OPERAND (expression
, 1)));
22126 case NONTYPE_ARGUMENT_PACK
:
22127 /* A NONTYPE_ARGUMENT_PACK is value-dependent if any packed argument
22128 is value-dependent. */
22130 tree values
= ARGUMENT_PACK_ARGS (expression
);
22131 int i
, len
= TREE_VEC_LENGTH (values
);
22133 for (i
= 0; i
< len
; ++i
)
22134 if (value_dependent_expression_p (TREE_VEC_ELT (values
, i
)))
22142 tree type2
= TRAIT_EXPR_TYPE2 (expression
);
22143 return (dependent_type_p (TRAIT_EXPR_TYPE1 (expression
))
22144 || (type2
? dependent_type_p (type2
) : false));
22148 return ((value_dependent_expression_p (TREE_OPERAND (expression
, 0)))
22149 || (value_dependent_expression_p (TREE_OPERAND (expression
, 2))));
22152 return ((value_dependent_expression_p (TREE_OPERAND (expression
, 0)))
22153 || (value_dependent_expression_p (TREE_OPERAND (expression
, 1))));
22157 tree op
= TREE_OPERAND (expression
, 0);
22158 return (value_dependent_expression_p (op
)
22159 || has_value_dependent_address (op
));
22162 case REQUIRES_EXPR
:
22163 /* Treat all requires-expressions as value-dependent so
22164 we don't try to fold them. */
22168 return dependent_type_p (TREE_OPERAND (expression
, 0));
22172 tree fn
= get_callee_fndecl (expression
);
22174 if (!fn
&& value_dependent_expression_p (CALL_EXPR_FN (expression
)))
22176 nargs
= call_expr_nargs (expression
);
22177 for (i
= 0; i
< nargs
; ++i
)
22179 tree op
= CALL_EXPR_ARG (expression
, i
);
22180 /* In a call to a constexpr member function, look through the
22181 implicit ADDR_EXPR on the object argument so that it doesn't
22182 cause the call to be considered value-dependent. We also
22183 look through it in potential_constant_expression. */
22184 if (i
== 0 && fn
&& DECL_DECLARED_CONSTEXPR_P (fn
)
22185 && DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
)
22186 && TREE_CODE (op
) == ADDR_EXPR
)
22187 op
= TREE_OPERAND (op
, 0);
22188 if (value_dependent_expression_p (op
))
22194 case TEMPLATE_ID_EXPR
:
22195 /* If a TEMPLATE_ID_EXPR involves a dependent name, it will be
22197 return type_dependent_expression_p (expression
)
22198 || variable_concept_p (TREE_OPERAND (expression
, 0));
22204 if (dependent_type_p (TREE_TYPE (expression
)))
22206 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (expression
), ix
, val
)
22207 if (value_dependent_expression_p (val
))
22213 /* Treat a GNU statement expression as dependent to avoid crashing
22214 under instantiate_non_dependent_expr; it can't be constant. */
22218 /* A constant expression is value-dependent if any subexpression is
22219 value-dependent. */
22220 switch (TREE_CODE_CLASS (TREE_CODE (expression
)))
22222 case tcc_reference
:
22224 case tcc_comparison
:
22226 case tcc_expression
:
22229 int i
, len
= cp_tree_operand_length (expression
);
22231 for (i
= 0; i
< len
; i
++)
22233 tree t
= TREE_OPERAND (expression
, i
);
22235 /* In some cases, some of the operands may be missing.l
22236 (For example, in the case of PREDECREMENT_EXPR, the
22237 amount to increment by may be missing.) That doesn't
22238 make the expression dependent. */
22239 if (t
&& value_dependent_expression_p (t
))
22250 /* The expression is not value-dependent. */
22254 /* Returns TRUE if the EXPRESSION is type-dependent, in the sense of
22255 [temp.dep.expr]. Note that an expression with no type is
22256 considered dependent. Other parts of the compiler arrange for an
22257 expression with type-dependent subexpressions to have no type, so
22258 this function doesn't have to be fully recursive. */
22261 type_dependent_expression_p (tree expression
)
22263 if (!processing_template_decl
)
22266 if (expression
== NULL_TREE
|| expression
== error_mark_node
)
22269 /* An unresolved name is always dependent. */
22270 if (identifier_p (expression
)
22271 || TREE_CODE (expression
) == USING_DECL
22272 || TREE_CODE (expression
) == WILDCARD_DECL
)
22275 /* A fold expression is type-dependent. */
22276 if (TREE_CODE (expression
) == UNARY_LEFT_FOLD_EXPR
22277 || TREE_CODE (expression
) == UNARY_RIGHT_FOLD_EXPR
22278 || TREE_CODE (expression
) == BINARY_LEFT_FOLD_EXPR
22279 || TREE_CODE (expression
) == BINARY_RIGHT_FOLD_EXPR
)
22282 /* Some expression forms are never type-dependent. */
22283 if (TREE_CODE (expression
) == PSEUDO_DTOR_EXPR
22284 || TREE_CODE (expression
) == SIZEOF_EXPR
22285 || TREE_CODE (expression
) == ALIGNOF_EXPR
22286 || TREE_CODE (expression
) == AT_ENCODE_EXPR
22287 || TREE_CODE (expression
) == NOEXCEPT_EXPR
22288 || TREE_CODE (expression
) == TRAIT_EXPR
22289 || TREE_CODE (expression
) == TYPEID_EXPR
22290 || TREE_CODE (expression
) == DELETE_EXPR
22291 || TREE_CODE (expression
) == VEC_DELETE_EXPR
22292 || TREE_CODE (expression
) == THROW_EXPR
22293 || TREE_CODE (expression
) == REQUIRES_EXPR
)
22296 /* The types of these expressions depends only on the type to which
22297 the cast occurs. */
22298 if (TREE_CODE (expression
) == DYNAMIC_CAST_EXPR
22299 || TREE_CODE (expression
) == STATIC_CAST_EXPR
22300 || TREE_CODE (expression
) == CONST_CAST_EXPR
22301 || TREE_CODE (expression
) == REINTERPRET_CAST_EXPR
22302 || TREE_CODE (expression
) == IMPLICIT_CONV_EXPR
22303 || TREE_CODE (expression
) == CAST_EXPR
)
22304 return dependent_type_p (TREE_TYPE (expression
));
22306 /* The types of these expressions depends only on the type created
22307 by the expression. */
22308 if (TREE_CODE (expression
) == NEW_EXPR
22309 || TREE_CODE (expression
) == VEC_NEW_EXPR
)
22311 /* For NEW_EXPR tree nodes created inside a template, either
22312 the object type itself or a TREE_LIST may appear as the
22314 tree type
= TREE_OPERAND (expression
, 1);
22315 if (TREE_CODE (type
) == TREE_LIST
)
22316 /* This is an array type. We need to check array dimensions
22318 return dependent_type_p (TREE_VALUE (TREE_PURPOSE (type
)))
22319 || value_dependent_expression_p
22320 (TREE_OPERAND (TREE_VALUE (type
), 1));
22322 return dependent_type_p (type
);
22325 if (TREE_CODE (expression
) == SCOPE_REF
)
22327 tree scope
= TREE_OPERAND (expression
, 0);
22328 tree name
= TREE_OPERAND (expression
, 1);
22330 /* 14.6.2.2 [temp.dep.expr]: An id-expression is type-dependent if it
22331 contains an identifier associated by name lookup with one or more
22332 declarations declared with a dependent type, or...a
22333 nested-name-specifier or qualified-id that names a member of an
22334 unknown specialization. */
22335 return (type_dependent_expression_p (name
)
22336 || dependent_scope_p (scope
));
22339 if (TREE_CODE (expression
) == FUNCTION_DECL
22340 && DECL_LANG_SPECIFIC (expression
)
22341 && DECL_TEMPLATE_INFO (expression
)
22342 && (any_dependent_template_arguments_p
22343 (INNERMOST_TEMPLATE_ARGS (DECL_TI_ARGS (expression
)))))
22346 if (TREE_CODE (expression
) == TEMPLATE_DECL
22347 && !DECL_TEMPLATE_TEMPLATE_PARM_P (expression
))
22350 if (TREE_CODE (expression
) == STMT_EXPR
)
22351 expression
= stmt_expr_value_expr (expression
);
22353 if (BRACE_ENCLOSED_INITIALIZER_P (expression
))
22358 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (expression
), i
, elt
)
22360 if (type_dependent_expression_p (elt
))
22366 /* A static data member of the current instantiation with incomplete
22367 array type is type-dependent, as the definition and specializations
22368 can have different bounds. */
22369 if (VAR_P (expression
)
22370 && DECL_CLASS_SCOPE_P (expression
)
22371 && dependent_type_p (DECL_CONTEXT (expression
))
22372 && VAR_HAD_UNKNOWN_BOUND (expression
))
22375 /* An array of unknown bound depending on a variadic parameter, eg:
22377 template<typename... Args>
22378 void foo (Args... args)
22380 int arr[] = { args... };
22383 template<int... vals>
22386 int arr[] = { vals... };
22389 If the array has no length and has an initializer, it must be that
22390 we couldn't determine its length in cp_complete_array_type because
22391 it is dependent. */
22392 if (VAR_P (expression
)
22393 && TREE_CODE (TREE_TYPE (expression
)) == ARRAY_TYPE
22394 && !TYPE_DOMAIN (TREE_TYPE (expression
))
22395 && DECL_INITIAL (expression
))
22398 /* A variable template specialization is type-dependent if it has any
22399 dependent template arguments. */
22400 if (VAR_P (expression
)
22401 && DECL_LANG_SPECIFIC (expression
)
22402 && DECL_TEMPLATE_INFO (expression
)
22403 && variable_template_p (DECL_TI_TEMPLATE (expression
)))
22404 return any_dependent_template_arguments_p (DECL_TI_ARGS (expression
));
22406 /* Always dependent, on the number of arguments if nothing else. */
22407 if (TREE_CODE (expression
) == EXPR_PACK_EXPANSION
)
22410 if (TREE_TYPE (expression
) == unknown_type_node
)
22412 if (TREE_CODE (expression
) == ADDR_EXPR
)
22413 return type_dependent_expression_p (TREE_OPERAND (expression
, 0));
22414 if (TREE_CODE (expression
) == COMPONENT_REF
22415 || TREE_CODE (expression
) == OFFSET_REF
)
22417 if (type_dependent_expression_p (TREE_OPERAND (expression
, 0)))
22419 expression
= TREE_OPERAND (expression
, 1);
22420 if (identifier_p (expression
))
22423 /* SCOPE_REF with non-null TREE_TYPE is always non-dependent. */
22424 if (TREE_CODE (expression
) == SCOPE_REF
)
22427 if (BASELINK_P (expression
))
22429 if (BASELINK_OPTYPE (expression
)
22430 && dependent_type_p (BASELINK_OPTYPE (expression
)))
22432 expression
= BASELINK_FUNCTIONS (expression
);
22435 if (TREE_CODE (expression
) == TEMPLATE_ID_EXPR
)
22437 if (any_dependent_template_arguments_p
22438 (TREE_OPERAND (expression
, 1)))
22440 expression
= TREE_OPERAND (expression
, 0);
22441 if (identifier_p (expression
))
22445 gcc_assert (TREE_CODE (expression
) == OVERLOAD
22446 || TREE_CODE (expression
) == FUNCTION_DECL
);
22450 if (type_dependent_expression_p (OVL_CURRENT (expression
)))
22452 expression
= OVL_NEXT (expression
);
22457 gcc_assert (TREE_CODE (expression
) != TYPE_DECL
);
22459 return (dependent_type_p (TREE_TYPE (expression
)));
22462 /* walk_tree callback function for instantiation_dependent_expression_p,
22463 below. Returns non-zero if a dependent subexpression is found. */
22466 instantiation_dependent_r (tree
*tp
, int *walk_subtrees
,
22471 /* We don't have to worry about decltype currently because decltype
22472 of an instantiation-dependent expr is a dependent type. This
22473 might change depending on the resolution of DR 1172. */
22474 *walk_subtrees
= false;
22477 enum tree_code code
= TREE_CODE (*tp
);
22480 /* Don't treat an argument list as dependent just because it has no
22488 /* A constant with a dependent initializer is dependent. */
22489 if (value_dependent_expression_p (*tp
))
22493 case TEMPLATE_PARM_INDEX
:
22496 /* Handle expressions with type operands. */
22500 case AT_ENCODE_EXPR
:
22502 tree op
= TREE_OPERAND (*tp
, 0);
22503 if (code
== SIZEOF_EXPR
&& SIZEOF_EXPR_TYPE_P (*tp
))
22504 op
= TREE_TYPE (op
);
22507 if (dependent_type_p (op
))
22511 *walk_subtrees
= false;
22519 if (value_dependent_expression_p (*tp
))
22521 *walk_subtrees
= false;
22524 case COMPONENT_REF
:
22525 if (identifier_p (TREE_OPERAND (*tp
, 1)))
22526 /* In a template, finish_class_member_access_expr creates a
22527 COMPONENT_REF with an IDENTIFIER_NODE for op1 even if it isn't
22528 type-dependent, so that we can check access control at
22529 instantiation time (PR 42277). See also Core issue 1273. */
22534 if (instantiation_dependent_scope_ref_p (*tp
))
22539 /* Treat statement-expressions as dependent. */
22543 /* Treat requires-expressions as dependent. */
22544 case REQUIRES_EXPR
:
22548 /* Treat calls to function concepts as dependent. */
22549 if (function_concept_check_p (*tp
))
22553 case TEMPLATE_ID_EXPR
:
22554 /* And variable concepts. */
22555 if (variable_concept_p (TREE_OPERAND (*tp
, 0)))
22563 if (type_dependent_expression_p (*tp
))
22569 /* Returns TRUE if the EXPRESSION is instantiation-dependent, in the
22570 sense defined by the ABI:
22572 "An expression is instantiation-dependent if it is type-dependent
22573 or value-dependent, or it has a subexpression that is type-dependent
22574 or value-dependent." */
22577 instantiation_dependent_expression_p (tree expression
)
22581 if (!processing_template_decl
)
22584 if (expression
== error_mark_node
)
22587 result
= cp_walk_tree_without_duplicates (&expression
,
22588 instantiation_dependent_r
, NULL
);
22589 return result
!= NULL_TREE
;
22592 /* Like type_dependent_expression_p, but it also works while not processing
22593 a template definition, i.e. during substitution or mangling. */
22596 type_dependent_expression_p_push (tree expr
)
22599 ++processing_template_decl
;
22600 b
= type_dependent_expression_p (expr
);
22601 --processing_template_decl
;
22605 /* Returns TRUE if ARGS contains a type-dependent expression. */
22608 any_type_dependent_arguments_p (const vec
<tree
, va_gc
> *args
)
22613 FOR_EACH_VEC_SAFE_ELT (args
, i
, arg
)
22615 if (type_dependent_expression_p (arg
))
22621 /* Returns TRUE if LIST (a TREE_LIST whose TREE_VALUEs are
22622 expressions) contains any type-dependent expressions. */
22625 any_type_dependent_elements_p (const_tree list
)
22627 for (; list
; list
= TREE_CHAIN (list
))
22628 if (type_dependent_expression_p (TREE_VALUE (list
)))
22634 /* Returns TRUE if LIST (a TREE_LIST whose TREE_VALUEs are
22635 expressions) contains any value-dependent expressions. */
22638 any_value_dependent_elements_p (const_tree list
)
22640 for (; list
; list
= TREE_CHAIN (list
))
22641 if (value_dependent_expression_p (TREE_VALUE (list
)))
22647 /* Returns TRUE if the ARG (a template argument) is dependent. */
22650 dependent_template_arg_p (tree arg
)
22652 if (!processing_template_decl
)
22655 /* Assume a template argument that was wrongly written by the user
22656 is dependent. This is consistent with what
22657 any_dependent_template_arguments_p [that calls this function]
22659 if (!arg
|| arg
== error_mark_node
)
22662 if (TREE_CODE (arg
) == ARGUMENT_PACK_SELECT
)
22663 arg
= ARGUMENT_PACK_SELECT_ARG (arg
);
22665 if (TREE_CODE (arg
) == TEMPLATE_DECL
22666 || TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
)
22667 return dependent_template_p (arg
);
22668 else if (ARGUMENT_PACK_P (arg
))
22670 tree args
= ARGUMENT_PACK_ARGS (arg
);
22671 int i
, len
= TREE_VEC_LENGTH (args
);
22672 for (i
= 0; i
< len
; ++i
)
22674 if (dependent_template_arg_p (TREE_VEC_ELT (args
, i
)))
22680 else if (TYPE_P (arg
))
22681 return dependent_type_p (arg
);
22683 return (type_dependent_expression_p (arg
)
22684 || value_dependent_expression_p (arg
));
22687 /* Returns true if ARGS (a collection of template arguments) contains
22688 any types that require structural equality testing. */
22691 any_template_arguments_need_structural_equality_p (tree args
)
22698 if (args
== error_mark_node
)
22701 for (i
= 0; i
< TMPL_ARGS_DEPTH (args
); ++i
)
22703 tree level
= TMPL_ARGS_LEVEL (args
, i
+ 1);
22704 for (j
= 0; j
< TREE_VEC_LENGTH (level
); ++j
)
22706 tree arg
= TREE_VEC_ELT (level
, j
);
22707 tree packed_args
= NULL_TREE
;
22710 if (ARGUMENT_PACK_P (arg
))
22712 /* Look inside the argument pack. */
22713 packed_args
= ARGUMENT_PACK_ARGS (arg
);
22714 len
= TREE_VEC_LENGTH (packed_args
);
22717 for (k
= 0; k
< len
; ++k
)
22720 arg
= TREE_VEC_ELT (packed_args
, k
);
22722 if (error_operand_p (arg
))
22724 else if (TREE_CODE (arg
) == TEMPLATE_DECL
)
22726 else if (TYPE_P (arg
) && TYPE_STRUCTURAL_EQUALITY_P (arg
))
22728 else if (!TYPE_P (arg
) && TREE_TYPE (arg
)
22729 && TYPE_STRUCTURAL_EQUALITY_P (TREE_TYPE (arg
)))
22738 /* Returns true if ARGS (a collection of template arguments) contains
22739 any dependent arguments. */
22742 any_dependent_template_arguments_p (const_tree args
)
22749 if (args
== error_mark_node
)
22752 for (i
= 0; i
< TMPL_ARGS_DEPTH (args
); ++i
)
22754 const_tree level
= TMPL_ARGS_LEVEL (args
, i
+ 1);
22755 for (j
= 0; j
< TREE_VEC_LENGTH (level
); ++j
)
22756 if (dependent_template_arg_p (TREE_VEC_ELT (level
, j
)))
22763 /* Returns TRUE if the template TMPL is dependent. */
22766 dependent_template_p (tree tmpl
)
22768 if (TREE_CODE (tmpl
) == OVERLOAD
)
22772 if (dependent_template_p (OVL_CURRENT (tmpl
)))
22774 tmpl
= OVL_NEXT (tmpl
);
22779 /* Template template parameters are dependent. */
22780 if (DECL_TEMPLATE_TEMPLATE_PARM_P (tmpl
)
22781 || TREE_CODE (tmpl
) == TEMPLATE_TEMPLATE_PARM
)
22783 /* So are names that have not been looked up. */
22784 if (TREE_CODE (tmpl
) == SCOPE_REF
|| identifier_p (tmpl
))
22786 /* So are member templates of dependent classes. */
22787 if (TYPE_P (CP_DECL_CONTEXT (tmpl
)))
22788 return dependent_type_p (DECL_CONTEXT (tmpl
));
22792 /* Returns TRUE if the specialization TMPL<ARGS> is dependent. */
22795 dependent_template_id_p (tree tmpl
, tree args
)
22797 return (dependent_template_p (tmpl
)
22798 || any_dependent_template_arguments_p (args
));
22801 /* Returns TRUE if OMP_FOR with DECLV, INITV, CONDV and INCRV vectors
22805 dependent_omp_for_p (tree declv
, tree initv
, tree condv
, tree incrv
)
22809 if (!processing_template_decl
)
22812 for (i
= 0; i
< TREE_VEC_LENGTH (declv
); i
++)
22814 tree decl
= TREE_VEC_ELT (declv
, i
);
22815 tree init
= TREE_VEC_ELT (initv
, i
);
22816 tree cond
= TREE_VEC_ELT (condv
, i
);
22817 tree incr
= TREE_VEC_ELT (incrv
, i
);
22819 if (type_dependent_expression_p (decl
))
22822 if (init
&& type_dependent_expression_p (init
))
22825 if (type_dependent_expression_p (cond
))
22828 if (COMPARISON_CLASS_P (cond
)
22829 && (type_dependent_expression_p (TREE_OPERAND (cond
, 0))
22830 || type_dependent_expression_p (TREE_OPERAND (cond
, 1))))
22833 if (TREE_CODE (incr
) == MODOP_EXPR
)
22835 if (type_dependent_expression_p (TREE_OPERAND (incr
, 0))
22836 || type_dependent_expression_p (TREE_OPERAND (incr
, 2)))
22839 else if (type_dependent_expression_p (incr
))
22841 else if (TREE_CODE (incr
) == MODIFY_EXPR
)
22843 if (type_dependent_expression_p (TREE_OPERAND (incr
, 0)))
22845 else if (BINARY_CLASS_P (TREE_OPERAND (incr
, 1)))
22847 tree t
= TREE_OPERAND (incr
, 1);
22848 if (type_dependent_expression_p (TREE_OPERAND (t
, 0))
22849 || type_dependent_expression_p (TREE_OPERAND (t
, 1)))
22858 /* TYPE is a TYPENAME_TYPE. Returns the ordinary TYPE to which the
22859 TYPENAME_TYPE corresponds. Returns the original TYPENAME_TYPE if
22860 no such TYPE can be found. Note that this function peers inside
22861 uninstantiated templates and therefore should be used only in
22862 extremely limited situations. ONLY_CURRENT_P restricts this
22863 peering to the currently open classes hierarchy (which is required
22864 when comparing types). */
22867 resolve_typename_type (tree type
, bool only_current_p
)
22876 gcc_assert (TREE_CODE (type
) == TYPENAME_TYPE
);
22878 scope
= TYPE_CONTEXT (type
);
22879 /* Usually the non-qualified identifier of a TYPENAME_TYPE is
22880 TYPE_IDENTIFIER (type). But when 'type' is a typedef variant of
22881 a TYPENAME_TYPE node, then TYPE_NAME (type) is set to the TYPE_DECL representing
22882 the typedef. In that case TYPE_IDENTIFIER (type) is not the non-qualified
22883 identifier of the TYPENAME_TYPE anymore.
22884 So by getting the TYPE_IDENTIFIER of the _main declaration_ of the
22885 TYPENAME_TYPE instead, we avoid messing up with a possible
22886 typedef variant case. */
22887 name
= TYPE_IDENTIFIER (TYPE_MAIN_VARIANT (type
));
22889 /* If the SCOPE is itself a TYPENAME_TYPE, then we need to resolve
22890 it first before we can figure out what NAME refers to. */
22891 if (TREE_CODE (scope
) == TYPENAME_TYPE
)
22893 if (TYPENAME_IS_RESOLVING_P (scope
))
22894 /* Given a class template A with a dependent base with nested type C,
22895 typedef typename A::C::C C will land us here, as trying to resolve
22896 the initial A::C leads to the local C typedef, which leads back to
22897 A::C::C. So we break the recursion now. */
22900 scope
= resolve_typename_type (scope
, only_current_p
);
22902 /* If we don't know what SCOPE refers to, then we cannot resolve the
22904 if (TREE_CODE (scope
) == TYPENAME_TYPE
)
22906 /* If the SCOPE is a template type parameter, we have no way of
22907 resolving the name. */
22908 if (TREE_CODE (scope
) == TEMPLATE_TYPE_PARM
)
22910 /* If the SCOPE is not the current instantiation, there's no reason
22911 to look inside it. */
22912 if (only_current_p
&& !currently_open_class (scope
))
22914 /* If this is a typedef, we don't want to look inside (c++/11987). */
22915 if (typedef_variant_p (type
))
22917 /* If SCOPE isn't the template itself, it will not have a valid
22918 TYPE_FIELDS list. */
22919 if (CLASS_TYPE_P (scope
)
22920 && same_type_p (scope
, CLASSTYPE_PRIMARY_TEMPLATE_TYPE (scope
)))
22921 /* scope is either the template itself or a compatible instantiation
22922 like X<T>, so look up the name in the original template. */
22923 scope
= CLASSTYPE_PRIMARY_TEMPLATE_TYPE (scope
);
22925 /* scope is a partial instantiation, so we can't do the lookup or we
22926 will lose the template arguments. */
22928 /* Enter the SCOPE so that name lookup will be resolved as if we
22929 were in the class definition. In particular, SCOPE will no
22930 longer be considered a dependent type. */
22931 pushed_scope
= push_scope (scope
);
22932 /* Look up the declaration. */
22933 decl
= lookup_member (scope
, name
, /*protect=*/0, /*want_type=*/true,
22934 tf_warning_or_error
);
22936 result
= NULL_TREE
;
22938 /* For a TYPENAME_TYPE like "typename X::template Y<T>", we want to
22939 find a TEMPLATE_DECL. Otherwise, we want to find a TYPE_DECL. */
22942 else if (identifier_p (TYPENAME_TYPE_FULLNAME (type
))
22943 && TREE_CODE (decl
) == TYPE_DECL
)
22945 result
= TREE_TYPE (decl
);
22946 if (result
== error_mark_node
)
22947 result
= NULL_TREE
;
22949 else if (TREE_CODE (TYPENAME_TYPE_FULLNAME (type
)) == TEMPLATE_ID_EXPR
22950 && DECL_CLASS_TEMPLATE_P (decl
))
22954 /* Obtain the template and the arguments. */
22955 tmpl
= TREE_OPERAND (TYPENAME_TYPE_FULLNAME (type
), 0);
22956 args
= TREE_OPERAND (TYPENAME_TYPE_FULLNAME (type
), 1);
22957 /* Instantiate the template. */
22958 result
= lookup_template_class (tmpl
, args
, NULL_TREE
, NULL_TREE
,
22959 /*entering_scope=*/0,
22960 tf_error
| tf_user
);
22961 if (result
== error_mark_node
)
22962 result
= NULL_TREE
;
22965 /* Leave the SCOPE. */
22967 pop_scope (pushed_scope
);
22969 /* If we failed to resolve it, return the original typename. */
22973 /* If lookup found a typename type, resolve that too. */
22974 if (TREE_CODE (result
) == TYPENAME_TYPE
&& !TYPENAME_IS_RESOLVING_P (result
))
22976 /* Ill-formed programs can cause infinite recursion here, so we
22977 must catch that. */
22978 TYPENAME_IS_RESOLVING_P (type
) = 1;
22979 result
= resolve_typename_type (result
, only_current_p
);
22980 TYPENAME_IS_RESOLVING_P (type
) = 0;
22983 /* Qualify the resulting type. */
22984 quals
= cp_type_quals (type
);
22986 result
= cp_build_qualified_type (result
, cp_type_quals (result
) | quals
);
22991 /* EXPR is an expression which is not type-dependent. Return a proxy
22992 for EXPR that can be used to compute the types of larger
22993 expressions containing EXPR. */
22996 build_non_dependent_expr (tree expr
)
23000 #ifdef ENABLE_CHECKING
23001 /* Try to get a constant value for all non-dependent expressions in
23002 order to expose bugs in *_dependent_expression_p and constexpr. */
23003 if (cxx_dialect
>= cxx11
)
23004 fold_non_dependent_expr (expr
);
23007 /* Preserve OVERLOADs; the functions must be available to resolve
23010 if (TREE_CODE (inner_expr
) == STMT_EXPR
)
23011 inner_expr
= stmt_expr_value_expr (inner_expr
);
23012 if (TREE_CODE (inner_expr
) == ADDR_EXPR
)
23013 inner_expr
= TREE_OPERAND (inner_expr
, 0);
23014 if (TREE_CODE (inner_expr
) == COMPONENT_REF
)
23015 inner_expr
= TREE_OPERAND (inner_expr
, 1);
23016 if (is_overloaded_fn (inner_expr
)
23017 || TREE_CODE (inner_expr
) == OFFSET_REF
)
23019 /* There is no need to return a proxy for a variable. */
23022 /* Preserve string constants; conversions from string constants to
23023 "char *" are allowed, even though normally a "const char *"
23024 cannot be used to initialize a "char *". */
23025 if (TREE_CODE (expr
) == STRING_CST
)
23027 /* Preserve void and arithmetic constants, as an optimization -- there is no
23028 reason to create a new node. */
23029 if (TREE_CODE (expr
) == VOID_CST
23030 || TREE_CODE (expr
) == INTEGER_CST
23031 || TREE_CODE (expr
) == REAL_CST
)
23033 /* Preserve THROW_EXPRs -- all throw-expressions have type "void".
23034 There is at least one place where we want to know that a
23035 particular expression is a throw-expression: when checking a ?:
23036 expression, there are special rules if the second or third
23037 argument is a throw-expression. */
23038 if (TREE_CODE (expr
) == THROW_EXPR
)
23041 /* Don't wrap an initializer list, we need to be able to look inside. */
23042 if (BRACE_ENCLOSED_INITIALIZER_P (expr
))
23045 /* Don't wrap a dummy object, we need to be able to test for it. */
23046 if (is_dummy_object (expr
))
23049 if (TREE_CODE (expr
) == COND_EXPR
)
23050 return build3 (COND_EXPR
,
23052 TREE_OPERAND (expr
, 0),
23053 (TREE_OPERAND (expr
, 1)
23054 ? build_non_dependent_expr (TREE_OPERAND (expr
, 1))
23055 : build_non_dependent_expr (TREE_OPERAND (expr
, 0))),
23056 build_non_dependent_expr (TREE_OPERAND (expr
, 2)));
23057 if (TREE_CODE (expr
) == COMPOUND_EXPR
23058 && !COMPOUND_EXPR_OVERLOADED (expr
))
23059 return build2 (COMPOUND_EXPR
,
23061 TREE_OPERAND (expr
, 0),
23062 build_non_dependent_expr (TREE_OPERAND (expr
, 1)));
23064 /* If the type is unknown, it can't really be non-dependent */
23065 gcc_assert (TREE_TYPE (expr
) != unknown_type_node
);
23067 /* Otherwise, build a NON_DEPENDENT_EXPR. */
23068 return build1 (NON_DEPENDENT_EXPR
, TREE_TYPE (expr
), expr
);
23071 /* ARGS is a vector of expressions as arguments to a function call.
23072 Replace the arguments with equivalent non-dependent expressions.
23073 This modifies ARGS in place. */
23076 make_args_non_dependent (vec
<tree
, va_gc
> *args
)
23081 FOR_EACH_VEC_SAFE_ELT (args
, ix
, arg
)
23083 tree newarg
= build_non_dependent_expr (arg
);
23085 (*args
)[ix
] = newarg
;
23089 /* Returns a type which represents 'auto' or 'decltype(auto)'. We use a
23090 TEMPLATE_TYPE_PARM with a level one deeper than the actual template
23094 make_auto_1 (tree name
)
23096 tree au
= cxx_make_type (TEMPLATE_TYPE_PARM
);
23097 TYPE_NAME (au
) = build_decl (input_location
,
23098 TYPE_DECL
, name
, au
);
23099 TYPE_STUB_DECL (au
) = TYPE_NAME (au
);
23100 TEMPLATE_TYPE_PARM_INDEX (au
) = build_template_parm_index
23101 (0, processing_template_decl
+ 1, processing_template_decl
+ 1,
23102 TYPE_NAME (au
), NULL_TREE
);
23103 TYPE_CANONICAL (au
) = canonical_type_parameter (au
);
23104 DECL_ARTIFICIAL (TYPE_NAME (au
)) = 1;
23105 SET_DECL_TEMPLATE_PARM_P (TYPE_NAME (au
));
23111 make_decltype_auto (void)
23113 return make_auto_1 (get_identifier ("decltype(auto)"));
23119 return make_auto_1 (get_identifier ("auto"));
23122 /* Given type ARG, return std::initializer_list<ARG>. */
23127 tree std_init_list
= namespace_binding
23128 (get_identifier ("initializer_list"), std_node
);
23130 if (!std_init_list
|| !DECL_CLASS_TEMPLATE_P (std_init_list
))
23132 error ("deducing from brace-enclosed initializer list requires "
23133 "#include <initializer_list>");
23134 return error_mark_node
;
23136 argvec
= make_tree_vec (1);
23137 TREE_VEC_ELT (argvec
, 0) = arg
;
23138 return lookup_template_class (std_init_list
, argvec
, NULL_TREE
,
23139 NULL_TREE
, 0, tf_warning_or_error
);
23142 /* Replace auto in TYPE with std::initializer_list<auto>. */
23145 listify_autos (tree type
, tree auto_node
)
23147 tree init_auto
= listify (auto_node
);
23148 tree argvec
= make_tree_vec (1);
23149 TREE_VEC_ELT (argvec
, 0) = init_auto
;
23150 if (processing_template_decl
)
23151 argvec
= add_to_template_args (current_template_args (), argvec
);
23152 return tsubst (type
, argvec
, tf_warning_or_error
, NULL_TREE
);
23155 /* Replace occurrences of 'auto' in TYPE with the appropriate type deduced
23156 from INIT. AUTO_NODE is the TEMPLATE_TYPE_PARM used for 'auto' in TYPE. */
23159 do_auto_deduction (tree type
, tree init
, tree auto_node
)
23161 return do_auto_deduction (type
, init
, auto_node
,
23162 tf_warning_or_error
,
23166 /* Replace occurrences of 'auto' in TYPE with the appropriate type deduced
23167 from INIT. AUTO_NODE is the TEMPLATE_TYPE_PARM used for 'auto' in TYPE.
23168 The CONTEXT determines the context in which auto deduction is performed
23169 and is used to control error diagnostics. */
23172 do_auto_deduction (tree type
, tree init
, tree auto_node
,
23173 tsubst_flags_t complain
, auto_deduction_context context
)
23177 if (init
== error_mark_node
)
23178 return error_mark_node
;
23180 if (type_dependent_expression_p (init
))
23181 /* Defining a subset of type-dependent expressions that we can deduce
23182 from ahead of time isn't worth the trouble. */
23185 /* [dcl.spec.auto]: Obtain P from T by replacing the occurrences of auto
23186 with either a new invented type template parameter U or, if the
23187 initializer is a braced-init-list (8.5.4), with
23188 std::initializer_list<U>. */
23189 if (BRACE_ENCLOSED_INITIALIZER_P (init
))
23191 if (!DIRECT_LIST_INIT_P (init
))
23192 type
= listify_autos (type
, auto_node
);
23193 else if (CONSTRUCTOR_NELTS (init
) == 1)
23194 init
= CONSTRUCTOR_ELT (init
, 0)->value
;
23197 if (complain
& tf_warning_or_error
)
23199 if (permerror (input_location
, "direct-list-initialization of "
23200 "%<auto%> requires exactly one element"))
23201 inform (input_location
,
23202 "for deduction to %<std::initializer_list%>, use copy-"
23203 "list-initialization (i.e. add %<=%> before the %<{%>)");
23205 type
= listify_autos (type
, auto_node
);
23209 init
= resolve_nondeduced_context (init
);
23211 targs
= make_tree_vec (1);
23212 if (AUTO_IS_DECLTYPE (auto_node
))
23214 bool id
= (DECL_P (init
) || (TREE_CODE (init
) == COMPONENT_REF
23215 && !REF_PARENTHESIZED_P (init
)));
23216 TREE_VEC_ELT (targs
, 0)
23217 = finish_decltype_type (init
, id
, tf_warning_or_error
);
23218 if (type
!= auto_node
)
23220 if (complain
& tf_error
)
23221 error ("%qT as type rather than plain %<decltype(auto)%>", type
);
23222 return error_mark_node
;
23227 tree parms
= build_tree_list (NULL_TREE
, type
);
23228 tree tparms
= make_tree_vec (1);
23231 TREE_VEC_ELT (tparms
, 0)
23232 = build_tree_list (NULL_TREE
, TYPE_NAME (auto_node
));
23233 val
= type_unification_real (tparms
, targs
, parms
, &init
, 1, 0,
23234 DEDUCE_CALL
, LOOKUP_NORMAL
,
23235 NULL
, /*explain_p=*/false);
23238 if (processing_template_decl
)
23239 /* Try again at instantiation time. */
23241 if (type
&& type
!= error_mark_node
23242 && (complain
& tf_error
))
23243 /* If type is error_mark_node a diagnostic must have been
23244 emitted by now. Also, having a mention to '<type error>'
23245 in the diagnostic is not really useful to the user. */
23247 if (cfun
&& auto_node
== current_function_auto_return_pattern
23248 && LAMBDA_FUNCTION_P (current_function_decl
))
23249 error ("unable to deduce lambda return type from %qE", init
);
23251 error ("unable to deduce %qT from %qE", type
, init
);
23253 return error_mark_node
;
23257 /* If the list of declarators contains more than one declarator, the type
23258 of each declared variable is determined as described above. If the
23259 type deduced for the template parameter U is not the same in each
23260 deduction, the program is ill-formed. */
23261 if (TREE_TYPE (auto_node
)
23262 && !same_type_p (TREE_TYPE (auto_node
), TREE_VEC_ELT (targs
, 0)))
23264 if (cfun
&& auto_node
== current_function_auto_return_pattern
23265 && LAMBDA_FUNCTION_P (current_function_decl
))
23266 error ("inconsistent types %qT and %qT deduced for "
23267 "lambda return type", TREE_TYPE (auto_node
),
23268 TREE_VEC_ELT (targs
, 0));
23270 error ("inconsistent deduction for %qT: %qT and then %qT",
23271 auto_node
, TREE_TYPE (auto_node
), TREE_VEC_ELT (targs
, 0));
23272 return error_mark_node
;
23274 if (context
!= adc_requirement
)
23275 TREE_TYPE (auto_node
) = TREE_VEC_ELT (targs
, 0);
23277 /* Check any placeholder constraints against the deduced type. */
23278 if (flag_concepts
&& !processing_template_decl
)
23279 if (tree constr
= PLACEHOLDER_TYPE_CONSTRAINTS (auto_node
))
23281 /* Use the deduced type to check the associated constraints. */
23282 if (!constraints_satisfied_p (constr
, targs
))
23284 if (complain
& tf_warning_or_error
)
23288 case adc_unspecified
:
23289 error("placeholder constraints not satisfied");
23291 case adc_variable_type
:
23292 error ("deduced initializer does not satisfy "
23293 "placeholder constraints");
23295 case adc_return_type
:
23296 error ("deduced return type does not satisfy "
23297 "placeholder constraints");
23299 case adc_requirement
:
23300 error ("deduced expression type does not saatisy "
23301 "placeholder constraints");
23304 diagnose_constraints (input_location
, constr
, targs
);
23306 return error_mark_node
;
23310 if (processing_template_decl
)
23311 targs
= add_to_template_args (current_template_args (), targs
);
23312 return tsubst (type
, targs
, complain
, NULL_TREE
);
23315 /* Substitutes LATE_RETURN_TYPE for 'auto' in TYPE and returns the
23319 splice_late_return_type (tree type
, tree late_return_type
)
23321 if (is_auto (type
))
23323 if (late_return_type
)
23324 return late_return_type
;
23326 tree idx
= get_template_parm_index (type
);
23327 if (TEMPLATE_PARM_LEVEL (idx
) <= processing_template_decl
)
23328 /* In an abbreviated function template we didn't know we were dealing
23329 with a function template when we saw the auto return type, so update
23330 it to have the correct level. */
23331 return make_auto_1 (TYPE_IDENTIFIER (type
));
23336 /* Returns true iff TYPE is a TEMPLATE_TYPE_PARM representing 'auto' or
23337 'decltype(auto)'. */
23340 is_auto (const_tree type
)
23342 if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
23343 && (TYPE_IDENTIFIER (type
) == get_identifier ("auto")
23344 || TYPE_IDENTIFIER (type
) == get_identifier ("decltype(auto)")))
23350 /* Returns the TEMPLATE_TYPE_PARM in TYPE representing `auto' iff TYPE contains
23351 a use of `auto'. Returns NULL_TREE otherwise. */
23354 type_uses_auto (tree type
)
23356 return find_type_usage (type
, is_auto
);
23359 /* Returns true iff TYPE is a TEMPLATE_TYPE_PARM representing 'auto',
23360 'decltype(auto)' or a concept. */
23363 is_auto_or_concept (const_tree type
)
23365 return is_auto (type
); // or concept
23368 /* Returns the TEMPLATE_TYPE_PARM in TYPE representing a generic type (`auto' or
23369 a concept identifier) iff TYPE contains a use of a generic type. Returns
23370 NULL_TREE otherwise. */
23373 type_uses_auto_or_concept (tree type
)
23375 return find_type_usage (type
, is_auto_or_concept
);
23379 /* For a given template T, return the vector of typedefs referenced
23380 in T for which access check is needed at T instantiation time.
23381 T is either a FUNCTION_DECL or a RECORD_TYPE.
23382 Those typedefs were added to T by the function
23383 append_type_to_template_for_access_check. */
23385 vec
<qualified_typedef_usage_t
, va_gc
> *
23386 get_types_needing_access_check (tree t
)
23389 vec
<qualified_typedef_usage_t
, va_gc
> *result
= NULL
;
23391 if (!t
|| t
== error_mark_node
)
23394 if (!(ti
= get_template_info (t
)))
23397 if (CLASS_TYPE_P (t
)
23398 || TREE_CODE (t
) == FUNCTION_DECL
)
23400 if (!TI_TEMPLATE (ti
))
23403 result
= TI_TYPEDEFS_NEEDING_ACCESS_CHECKING (ti
);
23409 /* Append the typedef TYPE_DECL used in template T to a list of typedefs
23410 tied to T. That list of typedefs will be access checked at
23411 T instantiation time.
23412 T is either a FUNCTION_DECL or a RECORD_TYPE.
23413 TYPE_DECL is a TYPE_DECL node representing a typedef.
23414 SCOPE is the scope through which TYPE_DECL is accessed.
23415 LOCATION is the location of the usage point of TYPE_DECL.
23417 This function is a subroutine of
23418 append_type_to_template_for_access_check. */
23421 append_type_to_template_for_access_check_1 (tree t
,
23424 location_t location
)
23426 qualified_typedef_usage_t typedef_usage
;
23429 if (!t
|| t
== error_mark_node
)
23432 gcc_assert ((TREE_CODE (t
) == FUNCTION_DECL
23433 || CLASS_TYPE_P (t
))
23435 && TREE_CODE (type_decl
) == TYPE_DECL
23438 if (!(ti
= get_template_info (t
)))
23441 gcc_assert (TI_TEMPLATE (ti
));
23443 typedef_usage
.typedef_decl
= type_decl
;
23444 typedef_usage
.context
= scope
;
23445 typedef_usage
.locus
= location
;
23447 vec_safe_push (TI_TYPEDEFS_NEEDING_ACCESS_CHECKING (ti
), typedef_usage
);
23450 /* Append TYPE_DECL to the template TEMPL.
23451 TEMPL is either a class type, a FUNCTION_DECL or a a TEMPLATE_DECL.
23452 At TEMPL instanciation time, TYPE_DECL will be checked to see
23453 if it can be accessed through SCOPE.
23454 LOCATION is the location of the usage point of TYPE_DECL.
23456 e.g. consider the following code snippet:
23463 template<class U> struct S
23465 C::myint mi; // <-- usage point of the typedef C::myint
23470 At S<char> instantiation time, we need to check the access of C::myint
23471 In other words, we need to check the access of the myint typedef through
23472 the C scope. For that purpose, this function will add the myint typedef
23473 and the scope C through which its being accessed to a list of typedefs
23474 tied to the template S. That list will be walked at template instantiation
23475 time and access check performed on each typedefs it contains.
23476 Note that this particular code snippet should yield an error because
23477 myint is private to C. */
23480 append_type_to_template_for_access_check (tree templ
,
23483 location_t location
)
23485 qualified_typedef_usage_t
*iter
;
23488 gcc_assert (type_decl
&& (TREE_CODE (type_decl
) == TYPE_DECL
));
23490 /* Make sure we don't append the type to the template twice. */
23491 FOR_EACH_VEC_SAFE_ELT (get_types_needing_access_check (templ
), i
, iter
)
23492 if (iter
->typedef_decl
== type_decl
&& scope
== iter
->context
)
23495 append_type_to_template_for_access_check_1 (templ
, type_decl
,
23499 /* Convert the generic type parameters in PARM that match the types given in the
23500 range [START_IDX, END_IDX) from the current_template_parms into generic type
23504 convert_generic_types_to_packs (tree parm
, int start_idx
, int end_idx
)
23506 tree current
= current_template_parms
;
23507 int depth
= TMPL_PARMS_DEPTH (current
);
23508 current
= INNERMOST_TEMPLATE_PARMS (current
);
23509 tree replacement
= make_tree_vec (TREE_VEC_LENGTH (current
));
23511 for (int i
= 0; i
< start_idx
; ++i
)
23512 TREE_VEC_ELT (replacement
, i
)
23513 = TREE_TYPE (TREE_VALUE (TREE_VEC_ELT (current
, i
)));
23515 for (int i
= start_idx
; i
< end_idx
; ++i
)
23517 /* Create a distinct parameter pack type from the current parm and add it
23518 to the replacement args to tsubst below into the generic function
23521 tree o
= TREE_TYPE (TREE_VALUE
23522 (TREE_VEC_ELT (current
, i
)));
23523 tree t
= copy_type (o
);
23524 TEMPLATE_TYPE_PARM_INDEX (t
)
23525 = reduce_template_parm_level (TEMPLATE_TYPE_PARM_INDEX (o
),
23527 TREE_TYPE (TEMPLATE_TYPE_DECL (t
)) = t
;
23528 TYPE_STUB_DECL (t
) = TYPE_NAME (t
) = TEMPLATE_TYPE_DECL (t
);
23529 TYPE_MAIN_VARIANT (t
) = t
;
23530 TEMPLATE_TYPE_PARAMETER_PACK (t
) = true;
23531 TYPE_CANONICAL (t
) = canonical_type_parameter (t
);
23532 TREE_VEC_ELT (replacement
, i
) = t
;
23533 TREE_VALUE (TREE_VEC_ELT (current
, i
)) = TREE_CHAIN (t
);
23536 for (int i
= end_idx
, e
= TREE_VEC_LENGTH (current
); i
< e
; ++i
)
23537 TREE_VEC_ELT (replacement
, i
)
23538 = TREE_TYPE (TREE_VALUE (TREE_VEC_ELT (current
, i
)));
23540 /* If there are more levels then build up the replacement with the outer
23543 replacement
= add_to_template_args (template_parms_to_args
23544 (TREE_CHAIN (current_template_parms
)),
23547 return tsubst (parm
, replacement
, tf_none
, NULL_TREE
);
23550 /* Entries in the decl_constraint hash table. */
23551 struct GTY((for_user
)) constr_entry
23557 /* Hashing function and equality for constraint entries. */
23558 struct constr_hasher
: ggc_ptr_hash
<constr_entry
>
23560 static hashval_t
hash (constr_entry
*e
)
23562 return (hashval_t
)DECL_UID (e
->decl
);
23565 static bool equal (constr_entry
*e1
, constr_entry
*e2
)
23567 return e1
->decl
== e2
->decl
;
23571 /* A mapping from declarations to constraint information. Note that
23572 both templates and their underlying declarations are mapped to the
23573 same constraint information.
23575 FIXME: This is defined in pt.c because garbage collection
23576 code is not being generated for constraint.cc. */
23578 static GTY (()) hash_table
<constr_hasher
> *decl_constraints
;
23580 /* Returns true iff cinfo contains a valid set of constraints.
23581 This is the case when the associated requirements have been
23582 successfully decomposed into lists of atomic constraints.
23583 That is, when the saved assumptions are not error_mark_node. */
23586 valid_constraints_p (tree cinfo
)
23588 gcc_assert (cinfo
);
23589 return CI_ASSUMPTIONS (cinfo
) != error_mark_node
;
23592 /* Returns the template constraints of declaration T. If T is not
23593 constrained, return NULL_TREE. Note that T must be non-null. */
23596 get_constraints (tree t
)
23598 gcc_assert (DECL_P (t
));
23599 if (TREE_CODE (t
) == TEMPLATE_DECL
)
23600 t
= DECL_TEMPLATE_RESULT (t
);
23601 constr_entry elt
= { t
, NULL_TREE
};
23602 constr_entry
* found
= decl_constraints
->find (&elt
);
23609 /* Associate the given constraint information CI with the declaration
23610 T. If T is a template, then the constraints are associated with
23611 its underlying declaration. Don't build associations if CI is
23615 set_constraints (tree t
, tree ci
)
23620 if (TREE_CODE (t
) == TEMPLATE_DECL
)
23621 t
= DECL_TEMPLATE_RESULT (t
);
23622 gcc_assert (!get_constraints (t
));
23623 constr_entry elt
= {t
, ci
};
23624 constr_entry
** slot
= decl_constraints
->find_slot (&elt
, INSERT
);
23625 constr_entry
* entry
= ggc_alloc
<constr_entry
> ();
23630 /* Remove the associated constraints of the declaration T. */
23633 remove_constraints (tree t
)
23635 gcc_assert (DECL_P (t
));
23636 if (TREE_CODE (t
) == TEMPLATE_DECL
)
23637 t
= DECL_TEMPLATE_RESULT (t
);
23639 constr_entry elt
= {t
, NULL_TREE
};
23640 constr_entry
** slot
= decl_constraints
->find_slot (&elt
, NO_INSERT
);
23642 decl_constraints
->clear_slot (slot
);
23645 /* Set up the hash table for constraint association. */
23648 init_constraint_processing (void)
23650 decl_constraints
= hash_table
<constr_hasher
>::create_ggc(37);
23653 /* Set up the hash tables for template instantiations. */
23656 init_template_processing (void)
23658 decl_specializations
= hash_table
<spec_hasher
>::create_ggc (37);
23659 type_specializations
= hash_table
<spec_hasher
>::create_ggc (37);
23662 /* Print stats about the template hash tables for -fstats. */
23665 print_template_statistics (void)
23667 fprintf (stderr
, "decl_specializations: size %ld, %ld elements, "
23668 "%f collisions\n", (long) decl_specializations
->size (),
23669 (long) decl_specializations
->elements (),
23670 decl_specializations
->collisions ());
23671 fprintf (stderr
, "type_specializations: size %ld, %ld elements, "
23672 "%f collisions\n", (long) type_specializations
->size (),
23673 (long) type_specializations
->elements (),
23674 type_specializations
->collisions ());
23677 #include "gt-cp-pt.h"