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, bool, tree
, tsubst_flags_t
, tree
);
9524 /* Apply any attributes which had to be deferred until instantiation
9525 time. DECL_P, ATTRIBUTES and ATTR_FLAGS are as cplus_decl_attributes;
9526 ARGS, COMPLAIN, IN_DECL are as tsubst. */
9529 apply_late_template_attributes (tree
*decl_p
, tree attributes
, int attr_flags
,
9530 tree args
, tsubst_flags_t complain
, tree in_decl
)
9532 tree last_dep
= NULL_TREE
;
9536 for (t
= attributes
; t
; t
= TREE_CHAIN (t
))
9537 if (ATTR_IS_DEPENDENT (t
))
9540 attributes
= copy_list (attributes
);
9544 if (DECL_P (*decl_p
))
9546 if (TREE_TYPE (*decl_p
) == error_mark_node
)
9548 p
= &DECL_ATTRIBUTES (*decl_p
);
9551 p
= &TYPE_ATTRIBUTES (*decl_p
);
9555 tree late_attrs
= NULL_TREE
;
9556 tree
*q
= &late_attrs
;
9558 for (*p
= attributes
; *p
; )
9561 if (ATTR_IS_DEPENDENT (t
))
9563 *p
= TREE_CHAIN (t
);
9564 TREE_CHAIN (t
) = NULL_TREE
;
9565 if ((flag_openmp
|| flag_openmp_simd
|| flag_cilkplus
)
9566 && is_attribute_p ("omp declare simd",
9567 get_attribute_name (t
))
9570 tree clauses
= TREE_VALUE (TREE_VALUE (t
));
9571 clauses
= tsubst_omp_clauses (clauses
, true, false, args
,
9573 c_omp_declare_simd_clauses_to_decls (*decl_p
, clauses
);
9574 clauses
= finish_omp_clauses (clauses
, false, true);
9575 tree parms
= DECL_ARGUMENTS (*decl_p
);
9577 = c_omp_declare_simd_clauses_to_numbers (parms
, clauses
);
9579 TREE_VALUE (TREE_VALUE (t
)) = clauses
;
9581 TREE_VALUE (t
) = NULL_TREE
;
9583 /* If the first attribute argument is an identifier, don't
9584 pass it through tsubst. Attributes like mode, format,
9585 cleanup and several target specific attributes expect it
9587 else if (attribute_takes_identifier_p (get_attribute_name (t
))
9591 = tsubst_expr (TREE_CHAIN (TREE_VALUE (t
)), args
, complain
,
9593 /*integral_constant_expression_p=*/false);
9594 if (chain
!= TREE_CHAIN (TREE_VALUE (t
)))
9596 = tree_cons (NULL_TREE
, TREE_VALUE (TREE_VALUE (t
)),
9599 else if (TREE_VALUE (t
) && PACK_EXPANSION_P (TREE_VALUE (t
)))
9601 /* An attribute pack expansion. */
9602 tree purp
= TREE_PURPOSE (t
);
9603 tree pack
= (tsubst_pack_expansion
9604 (TREE_VALUE (t
), args
, complain
, in_decl
));
9605 int len
= TREE_VEC_LENGTH (pack
);
9606 for (int i
= 0; i
< len
; ++i
)
9608 tree elt
= TREE_VEC_ELT (pack
, i
);
9609 *q
= build_tree_list (purp
, elt
);
9610 q
= &TREE_CHAIN (*q
);
9616 = tsubst_expr (TREE_VALUE (t
), args
, complain
, in_decl
,
9617 /*integral_constant_expression_p=*/false);
9619 q
= &TREE_CHAIN (t
);
9622 p
= &TREE_CHAIN (t
);
9625 cplus_decl_attributes (decl_p
, late_attrs
, attr_flags
);
9629 /* Perform (or defer) access check for typedefs that were referenced
9630 from within the template TMPL code.
9631 This is a subroutine of instantiate_decl and instantiate_class_template.
9632 TMPL is the template to consider and TARGS is the list of arguments of
9636 perform_typedefs_access_check (tree tmpl
, tree targs
)
9638 location_t saved_location
;
9640 qualified_typedef_usage_t
*iter
;
9643 || (!CLASS_TYPE_P (tmpl
)
9644 && TREE_CODE (tmpl
) != FUNCTION_DECL
))
9647 saved_location
= input_location
;
9648 FOR_EACH_VEC_SAFE_ELT (get_types_needing_access_check (tmpl
), i
, iter
)
9650 tree type_decl
= iter
->typedef_decl
;
9651 tree type_scope
= iter
->context
;
9653 if (!type_decl
|| !type_scope
|| !CLASS_TYPE_P (type_scope
))
9656 if (uses_template_parms (type_decl
))
9657 type_decl
= tsubst (type_decl
, targs
, tf_error
, NULL_TREE
);
9658 if (uses_template_parms (type_scope
))
9659 type_scope
= tsubst (type_scope
, targs
, tf_error
, NULL_TREE
);
9661 /* Make access check error messages point to the location
9662 of the use of the typedef. */
9663 input_location
= iter
->locus
;
9664 perform_or_defer_access_check (TYPE_BINFO (type_scope
),
9665 type_decl
, type_decl
,
9666 tf_warning_or_error
);
9668 input_location
= saved_location
;
9672 instantiate_class_template_1 (tree type
)
9674 tree templ
, args
, pattern
, t
, member
;
9678 unsigned int saved_maximum_field_alignment
;
9681 if (type
== error_mark_node
)
9682 return error_mark_node
;
9684 if (COMPLETE_OR_OPEN_TYPE_P (type
)
9685 || uses_template_parms (type
))
9688 /* Figure out which template is being instantiated. */
9689 templ
= most_general_template (CLASSTYPE_TI_TEMPLATE (type
));
9690 gcc_assert (TREE_CODE (templ
) == TEMPLATE_DECL
);
9692 /* Determine what specialization of the original template to
9694 t
= most_specialized_partial_spec (type
, tf_warning_or_error
);
9695 if (t
== error_mark_node
)
9697 TYPE_BEING_DEFINED (type
) = 1;
9698 return error_mark_node
;
9702 /* This TYPE is actually an instantiation of a partial
9703 specialization. We replace the innermost set of ARGS with
9704 the arguments appropriate for substitution. For example,
9707 template <class T> struct S {};
9708 template <class T> struct S<T*> {};
9710 and supposing that we are instantiating S<int*>, ARGS will
9711 presently be {int*} -- but we need {int}. */
9712 pattern
= TREE_TYPE (t
);
9713 args
= TREE_PURPOSE (t
);
9717 pattern
= TREE_TYPE (templ
);
9718 args
= CLASSTYPE_TI_ARGS (type
);
9721 /* If the template we're instantiating is incomplete, then clearly
9722 there's nothing we can do. */
9723 if (!COMPLETE_TYPE_P (pattern
))
9726 /* If we've recursively instantiated too many templates, stop. */
9727 if (! push_tinst_level (type
))
9730 /* Now we're really doing the instantiation. Mark the type as in
9731 the process of being defined. */
9732 TYPE_BEING_DEFINED (type
) = 1;
9734 /* We may be in the middle of deferred access check. Disable
9736 push_deferring_access_checks (dk_no_deferred
);
9738 int saved_unevaluated_operand
= cp_unevaluated_operand
;
9739 int saved_inhibit_evaluation_warnings
= c_inhibit_evaluation_warnings
;
9741 fn_context
= decl_function_context (TYPE_MAIN_DECL (type
));
9742 /* Also avoid push_to_top_level for a lambda in an NSDMI. */
9743 if (!fn_context
&& LAMBDA_TYPE_P (type
) && TYPE_CLASS_SCOPE_P (type
))
9744 fn_context
= error_mark_node
;
9746 push_to_top_level ();
9749 cp_unevaluated_operand
= 0;
9750 c_inhibit_evaluation_warnings
= 0;
9752 /* Use #pragma pack from the template context. */
9753 saved_maximum_field_alignment
= maximum_field_alignment
;
9754 maximum_field_alignment
= TYPE_PRECISION (pattern
);
9756 SET_CLASSTYPE_INTERFACE_UNKNOWN (type
);
9758 /* Set the input location to the most specialized template definition.
9759 This is needed if tsubsting causes an error. */
9760 typedecl
= TYPE_MAIN_DECL (pattern
);
9761 input_location
= DECL_SOURCE_LOCATION (TYPE_NAME (type
)) =
9762 DECL_SOURCE_LOCATION (typedecl
);
9764 TYPE_PACKED (type
) = TYPE_PACKED (pattern
);
9765 TYPE_ALIGN (type
) = TYPE_ALIGN (pattern
);
9766 TYPE_USER_ALIGN (type
) = TYPE_USER_ALIGN (pattern
);
9767 TYPE_FOR_JAVA (type
) = TYPE_FOR_JAVA (pattern
); /* For libjava's JArray<T> */
9768 if (ANON_AGGR_TYPE_P (pattern
))
9769 SET_ANON_AGGR_TYPE_P (type
);
9770 if (CLASSTYPE_VISIBILITY_SPECIFIED (pattern
))
9772 CLASSTYPE_VISIBILITY_SPECIFIED (type
) = 1;
9773 CLASSTYPE_VISIBILITY (type
) = CLASSTYPE_VISIBILITY (pattern
);
9774 /* Adjust visibility for template arguments. */
9775 determine_visibility (TYPE_MAIN_DECL (type
));
9777 if (CLASS_TYPE_P (type
))
9778 CLASSTYPE_FINAL (type
) = CLASSTYPE_FINAL (pattern
);
9780 pbinfo
= TYPE_BINFO (pattern
);
9782 /* We should never instantiate a nested class before its enclosing
9783 class; we need to look up the nested class by name before we can
9784 instantiate it, and that lookup should instantiate the enclosing
9786 gcc_assert (!DECL_CLASS_SCOPE_P (TYPE_MAIN_DECL (pattern
))
9787 || COMPLETE_OR_OPEN_TYPE_P (TYPE_CONTEXT (type
)));
9789 base_list
= NULL_TREE
;
9790 if (BINFO_N_BASE_BINFOS (pbinfo
))
9796 /* We must enter the scope containing the type, as that is where
9797 the accessibility of types named in dependent bases are
9799 pushed_scope
= push_scope (CP_TYPE_CONTEXT (type
));
9801 /* Substitute into each of the bases to determine the actual
9803 for (i
= 0; BINFO_BASE_ITERATE (pbinfo
, i
, pbase_binfo
); i
++)
9806 tree access
= BINFO_BASE_ACCESS (pbinfo
, i
);
9807 tree expanded_bases
= NULL_TREE
;
9810 if (PACK_EXPANSION_P (BINFO_TYPE (pbase_binfo
)))
9813 tsubst_pack_expansion (BINFO_TYPE (pbase_binfo
),
9814 args
, tf_error
, NULL_TREE
);
9815 if (expanded_bases
== error_mark_node
)
9818 len
= TREE_VEC_LENGTH (expanded_bases
);
9821 for (idx
= 0; idx
< len
; idx
++)
9824 /* Extract the already-expanded base class. */
9825 base
= TREE_VEC_ELT (expanded_bases
, idx
);
9827 /* Substitute to figure out the base class. */
9828 base
= tsubst (BINFO_TYPE (pbase_binfo
), args
, tf_error
,
9831 if (base
== error_mark_node
)
9834 base_list
= tree_cons (access
, base
, base_list
);
9835 if (BINFO_VIRTUAL_P (pbase_binfo
))
9836 TREE_TYPE (base_list
) = integer_type_node
;
9840 /* The list is now in reverse order; correct that. */
9841 base_list
= nreverse (base_list
);
9844 pop_scope (pushed_scope
);
9846 /* Now call xref_basetypes to set up all the base-class
9848 xref_basetypes (type
, base_list
);
9850 apply_late_template_attributes (&type
, TYPE_ATTRIBUTES (pattern
),
9851 (int) ATTR_FLAG_TYPE_IN_PLACE
,
9852 args
, tf_error
, NULL_TREE
);
9853 fixup_attribute_variants (type
);
9855 /* Now that our base classes are set up, enter the scope of the
9856 class, so that name lookups into base classes, etc. will work
9857 correctly. This is precisely analogous to what we do in
9858 begin_class_definition when defining an ordinary non-template
9859 class, except we also need to push the enclosing classes. */
9860 push_nested_class (type
);
9862 /* Now members are processed in the order of declaration. */
9863 for (member
= CLASSTYPE_DECL_LIST (pattern
);
9864 member
; member
= TREE_CHAIN (member
))
9866 tree t
= TREE_VALUE (member
);
9868 if (TREE_PURPOSE (member
))
9872 /* Build new CLASSTYPE_NESTED_UTDS. */
9875 bool class_template_p
;
9877 class_template_p
= (TREE_CODE (t
) != ENUMERAL_TYPE
9878 && TYPE_LANG_SPECIFIC (t
)
9879 && CLASSTYPE_IS_TEMPLATE (t
));
9880 /* If the member is a class template, then -- even after
9881 substitution -- there may be dependent types in the
9882 template argument list for the class. We increment
9883 PROCESSING_TEMPLATE_DECL so that dependent_type_p, as
9884 that function will assume that no types are dependent
9885 when outside of a template. */
9886 if (class_template_p
)
9887 ++processing_template_decl
;
9888 newtag
= tsubst (t
, args
, tf_error
, NULL_TREE
);
9889 if (class_template_p
)
9890 --processing_template_decl
;
9891 if (newtag
== error_mark_node
)
9894 if (TREE_CODE (newtag
) != ENUMERAL_TYPE
)
9896 tree name
= TYPE_IDENTIFIER (t
);
9898 if (class_template_p
)
9899 /* Unfortunately, lookup_template_class sets
9900 CLASSTYPE_IMPLICIT_INSTANTIATION for a partial
9901 instantiation (i.e., for the type of a member
9902 template class nested within a template class.)
9903 This behavior is required for
9904 maybe_process_partial_specialization to work
9905 correctly, but is not accurate in this case;
9906 the TAG is not an instantiation of anything.
9907 (The corresponding TEMPLATE_DECL is an
9908 instantiation, but the TYPE is not.) */
9909 CLASSTYPE_USE_TEMPLATE (newtag
) = 0;
9911 /* Now, we call pushtag to put this NEWTAG into the scope of
9912 TYPE. We first set up the IDENTIFIER_TYPE_VALUE to avoid
9913 pushtag calling push_template_decl. We don't have to do
9914 this for enums because it will already have been done in
9917 SET_IDENTIFIER_TYPE_VALUE (name
, newtag
);
9918 pushtag (name
, newtag
, /*tag_scope=*/ts_current
);
9921 else if (DECL_DECLARES_FUNCTION_P (t
))
9923 /* Build new TYPE_METHODS. */
9926 if (TREE_CODE (t
) == TEMPLATE_DECL
)
9927 ++processing_template_decl
;
9928 r
= tsubst (t
, args
, tf_error
, NULL_TREE
);
9929 if (TREE_CODE (t
) == TEMPLATE_DECL
)
9930 --processing_template_decl
;
9931 set_current_access_from_decl (r
);
9932 finish_member_declaration (r
);
9933 /* Instantiate members marked with attribute used. */
9934 if (r
!= error_mark_node
&& DECL_PRESERVE_P (r
))
9936 if (TREE_CODE (r
) == FUNCTION_DECL
9937 && DECL_OMP_DECLARE_REDUCTION_P (r
))
9938 cp_check_omp_declare_reduction (r
);
9940 else if (DECL_CLASS_TEMPLATE_P (t
)
9941 && LAMBDA_TYPE_P (TREE_TYPE (t
)))
9942 /* A closure type for a lambda in a default argument for a
9943 member template. Ignore it; it will be instantiated with
9944 the default argument. */;
9947 /* Build new TYPE_FIELDS. */
9948 if (TREE_CODE (t
) == STATIC_ASSERT
)
9952 ++c_inhibit_evaluation_warnings
;
9954 tsubst_expr (STATIC_ASSERT_CONDITION (t
), args
,
9955 tf_warning_or_error
, NULL_TREE
,
9956 /*integral_constant_expression_p=*/true);
9957 --c_inhibit_evaluation_warnings
;
9959 finish_static_assert (condition
,
9960 STATIC_ASSERT_MESSAGE (t
),
9961 STATIC_ASSERT_SOURCE_LOCATION (t
),
9964 else if (TREE_CODE (t
) != CONST_DECL
)
9967 tree vec
= NULL_TREE
;
9970 /* The file and line for this declaration, to
9971 assist in error message reporting. Since we
9972 called push_tinst_level above, we don't need to
9974 input_location
= DECL_SOURCE_LOCATION (t
);
9976 if (TREE_CODE (t
) == TEMPLATE_DECL
)
9977 ++processing_template_decl
;
9978 r
= tsubst (t
, args
, tf_warning_or_error
, NULL_TREE
);
9979 if (TREE_CODE (t
) == TEMPLATE_DECL
)
9980 --processing_template_decl
;
9982 if (TREE_CODE (r
) == TREE_VEC
)
9984 /* A capture pack became multiple fields. */
9986 len
= TREE_VEC_LENGTH (vec
);
9989 for (int i
= 0; i
< len
; ++i
)
9992 r
= TREE_VEC_ELT (vec
, i
);
9997 [t]he initialization (and any associated
9998 side-effects) of a static data member does
9999 not occur unless the static data member is
10000 itself used in a way that requires the
10001 definition of the static data member to
10004 Therefore, we do not substitute into the
10005 initialized for the static data member here. */
10006 finish_static_data_member_decl
10008 /*init=*/NULL_TREE
,
10009 /*init_const_expr_p=*/false,
10010 /*asmspec_tree=*/NULL_TREE
,
10012 /* Instantiate members marked with attribute used. */
10013 if (r
!= error_mark_node
&& DECL_PRESERVE_P (r
))
10016 else if (TREE_CODE (r
) == FIELD_DECL
)
10018 /* Determine whether R has a valid type and can be
10019 completed later. If R is invalid, then its type
10020 is replaced by error_mark_node. */
10021 tree rtype
= TREE_TYPE (r
);
10022 if (can_complete_type_without_circularity (rtype
))
10023 complete_type (rtype
);
10025 if (!COMPLETE_TYPE_P (rtype
))
10027 cxx_incomplete_type_error (r
, rtype
);
10028 TREE_TYPE (r
) = error_mark_node
;
10032 /* If it is a TYPE_DECL for a class-scoped ENUMERAL_TYPE,
10033 such a thing will already have been added to the field
10034 list by tsubst_enum in finish_member_declaration in the
10035 CLASSTYPE_NESTED_UTDS case above. */
10036 if (!(TREE_CODE (r
) == TYPE_DECL
10037 && TREE_CODE (TREE_TYPE (r
)) == ENUMERAL_TYPE
10038 && DECL_ARTIFICIAL (r
)))
10040 set_current_access_from_decl (r
);
10041 finish_member_declaration (r
);
10049 if (TYPE_P (t
) || DECL_CLASS_TEMPLATE_P (t
)
10050 || DECL_TEMPLATE_TEMPLATE_PARM_P (t
))
10052 /* Build new CLASSTYPE_FRIEND_CLASSES. */
10054 tree friend_type
= t
;
10055 bool adjust_processing_template_decl
= false;
10057 if (TREE_CODE (friend_type
) == TEMPLATE_DECL
)
10059 /* template <class T> friend class C; */
10060 friend_type
= tsubst_friend_class (friend_type
, args
);
10061 adjust_processing_template_decl
= true;
10063 else if (TREE_CODE (friend_type
) == UNBOUND_CLASS_TEMPLATE
)
10065 /* template <class T> friend class C::D; */
10066 friend_type
= tsubst (friend_type
, args
,
10067 tf_warning_or_error
, NULL_TREE
);
10068 if (TREE_CODE (friend_type
) == TEMPLATE_DECL
)
10069 friend_type
= TREE_TYPE (friend_type
);
10070 adjust_processing_template_decl
= true;
10072 else if (TREE_CODE (friend_type
) == TYPENAME_TYPE
10073 || TREE_CODE (friend_type
) == TEMPLATE_TYPE_PARM
)
10075 /* This could be either
10079 when dependent_type_p is false or
10081 template <class U> friend class T::C;
10084 friend_type
= tsubst (friend_type
, args
,
10085 tf_warning_or_error
, NULL_TREE
);
10086 /* Bump processing_template_decl for correct
10087 dependent_type_p calculation. */
10088 ++processing_template_decl
;
10089 if (dependent_type_p (friend_type
))
10090 adjust_processing_template_decl
= true;
10091 --processing_template_decl
;
10093 else if (!CLASSTYPE_USE_TEMPLATE (friend_type
)
10094 && hidden_name_p (TYPE_NAME (friend_type
)))
10098 where C hasn't been declared yet. Let's lookup name
10099 from namespace scope directly, bypassing any name that
10100 come from dependent base class. */
10101 tree ns
= decl_namespace_context (TYPE_MAIN_DECL (friend_type
));
10103 /* The call to xref_tag_from_type does injection for friend
10105 push_nested_namespace (ns
);
10107 xref_tag_from_type (friend_type
, NULL_TREE
,
10108 /*tag_scope=*/ts_current
);
10109 pop_nested_namespace (ns
);
10111 else if (uses_template_parms (friend_type
))
10112 /* friend class C<T>; */
10113 friend_type
= tsubst (friend_type
, args
,
10114 tf_warning_or_error
, NULL_TREE
);
10119 where C is already declared or
10121 friend class C<int>;
10123 We don't have to do anything in these cases. */
10125 if (adjust_processing_template_decl
)
10126 /* Trick make_friend_class into realizing that the friend
10127 we're adding is a template, not an ordinary class. It's
10128 important that we use make_friend_class since it will
10129 perform some error-checking and output cross-reference
10131 ++processing_template_decl
;
10133 if (friend_type
!= error_mark_node
)
10134 make_friend_class (type
, friend_type
, /*complain=*/false);
10136 if (adjust_processing_template_decl
)
10137 --processing_template_decl
;
10141 /* Build new DECL_FRIENDLIST. */
10144 /* The file and line for this declaration, to
10145 assist in error message reporting. Since we
10146 called push_tinst_level above, we don't need to
10148 input_location
= DECL_SOURCE_LOCATION (t
);
10150 if (TREE_CODE (t
) == TEMPLATE_DECL
)
10152 ++processing_template_decl
;
10153 push_deferring_access_checks (dk_no_check
);
10156 r
= tsubst_friend_function (t
, args
);
10157 add_friend (type
, r
, /*complain=*/false);
10158 if (TREE_CODE (t
) == TEMPLATE_DECL
)
10160 pop_deferring_access_checks ();
10161 --processing_template_decl
;
10169 /* Restore these before substituting into the lambda capture
10171 cp_unevaluated_operand
= saved_unevaluated_operand
;
10172 c_inhibit_evaluation_warnings
= saved_inhibit_evaluation_warnings
;
10175 if (tree expr
= CLASSTYPE_LAMBDA_EXPR (type
))
10177 tree decl
= lambda_function (type
);
10180 if (!DECL_TEMPLATE_INFO (decl
)
10181 || DECL_TEMPLATE_RESULT (DECL_TI_TEMPLATE (decl
)) != decl
)
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 (pack
== error_mark_node
)
10636 return error_mark_node
;
10637 if (TREE_VEC_LENGTH (pack
) == 0)
10638 return expand_empty_fold (t
, complain
);
10640 return expand_left_fold (t
, pack
, complain
);
10643 /* Substitute into a binary left fold expression.
10645 Do ths by building a single (non-empty) vector of argumnts and
10646 building the expression from those elements. */
10649 tsubst_binary_left_fold (tree t
, tree args
, tsubst_flags_t complain
,
10652 tree pack
= tsubst_fold_expr_pack (t
, args
, complain
, in_decl
);
10653 if (pack
== error_mark_node
)
10654 return error_mark_node
;
10655 tree init
= tsubst_fold_expr_init (t
, args
, complain
, in_decl
);
10656 if (init
== error_mark_node
)
10657 return error_mark_node
;
10659 tree vec
= make_tree_vec (TREE_VEC_LENGTH (pack
) + 1);
10660 TREE_VEC_ELT (vec
, 0) = init
;
10661 for (int i
= 0; i
< TREE_VEC_LENGTH (pack
); ++i
)
10662 TREE_VEC_ELT (vec
, i
+ 1) = TREE_VEC_ELT (pack
, i
);
10664 return expand_left_fold (t
, vec
, complain
);
10667 /* Expand a PACK of arguments into a grouped as right fold.
10668 Given a pack containing elementns A0, A1, ..., and an
10669 operator @, this builds the expression:
10671 A0@ ... (An-2 @ (An-1 @ An))
10673 Note that PACK must not be empty.
10675 The operator is defined by the original fold expression T. */
10678 expand_right_fold (tree t
, tree pack
, tsubst_flags_t complain
)
10680 // Build the expression.
10681 int n
= TREE_VEC_LENGTH (pack
);
10682 tree right
= TREE_VEC_ELT (pack
, n
- 1);
10683 for (--n
; n
!= 0; --n
)
10685 tree left
= TREE_VEC_ELT (pack
, n
- 1);
10686 right
= fold_expression (t
, left
, right
, complain
);
10691 /* Substitute into a unary right fold expression. */
10694 tsubst_unary_right_fold (tree t
, tree args
, tsubst_flags_t complain
,
10697 tree pack
= tsubst_fold_expr_pack (t
, args
, complain
, in_decl
);
10698 if (pack
== error_mark_node
)
10699 return error_mark_node
;
10700 if (TREE_VEC_LENGTH (pack
) == 0)
10701 return expand_empty_fold (t
, complain
);
10703 return expand_right_fold (t
, pack
, complain
);
10706 /* Substitute into a binary right fold expression.
10708 Do ths by building a single (non-empty) vector of arguments and
10709 building the expression from those elements. */
10712 tsubst_binary_right_fold (tree t
, tree args
, tsubst_flags_t complain
,
10715 tree pack
= tsubst_fold_expr_pack (t
, args
, complain
, in_decl
);
10716 if (pack
== error_mark_node
)
10717 return error_mark_node
;
10718 tree init
= tsubst_fold_expr_init (t
, args
, complain
, in_decl
);
10719 if (init
== error_mark_node
)
10720 return error_mark_node
;
10722 int n
= TREE_VEC_LENGTH (pack
);
10723 tree vec
= make_tree_vec (n
+ 1);
10724 for (int i
= 0; i
< n
; ++i
)
10725 TREE_VEC_ELT (vec
, i
) = TREE_VEC_ELT (pack
, i
);
10726 TREE_VEC_ELT (vec
, n
) = init
;
10728 return expand_right_fold (t
, vec
, complain
);
10732 /* Substitute ARGS into T, which is an pack expansion
10733 (i.e. TYPE_PACK_EXPANSION or EXPR_PACK_EXPANSION). Returns a
10734 TREE_VEC with the substituted arguments, a PACK_EXPANSION_* node
10735 (if only a partial substitution could be performed) or
10736 ERROR_MARK_NODE if there was an error. */
10738 tsubst_pack_expansion (tree t
, tree args
, tsubst_flags_t complain
,
10742 tree pack
, packs
= NULL_TREE
;
10743 bool unsubstituted_packs
= false;
10746 hash_map
<tree
, tree
> *saved_local_specializations
= NULL
;
10747 bool need_local_specializations
= false;
10750 gcc_assert (PACK_EXPANSION_P (t
));
10751 pattern
= PACK_EXPANSION_PATTERN (t
);
10753 /* Add in any args remembered from an earlier partial instantiation. */
10754 args
= add_to_template_args (PACK_EXPANSION_EXTRA_ARGS (t
), args
);
10756 levels
= TMPL_ARGS_DEPTH (args
);
10758 /* Determine the argument packs that will instantiate the parameter
10759 packs used in the expansion expression. While we're at it,
10760 compute the number of arguments to be expanded and make sure it
10762 for (pack
= PACK_EXPANSION_PARAMETER_PACKS (t
); pack
;
10763 pack
= TREE_CHAIN (pack
))
10765 tree parm_pack
= TREE_VALUE (pack
);
10766 tree arg_pack
= NULL_TREE
;
10767 tree orig_arg
= NULL_TREE
;
10770 if (TREE_CODE (parm_pack
) == BASES
)
10772 if (BASES_DIRECT (parm_pack
))
10773 return calculate_direct_bases (tsubst_expr (BASES_TYPE (parm_pack
),
10774 args
, complain
, in_decl
, false));
10776 return calculate_bases (tsubst_expr (BASES_TYPE (parm_pack
),
10777 args
, complain
, in_decl
, false));
10779 if (TREE_CODE (parm_pack
) == PARM_DECL
)
10781 /* We know we have correct local_specializations if this
10782 expansion is at function scope, or if we're dealing with a
10783 local parameter in a requires expression; for the latter,
10784 tsubst_requires_expr set it up appropriately. */
10785 if (PACK_EXPANSION_LOCAL_P (t
) || CONSTRAINT_VAR_P (parm_pack
))
10786 arg_pack
= retrieve_local_specialization (parm_pack
);
10789 /* We can't rely on local_specializations for a parameter
10790 name used later in a function declaration (such as in a
10791 late-specified return type). Even if it exists, it might
10792 have the wrong value for a recursive call. Just make a
10793 dummy decl, since it's only used for its type. */
10794 arg_pack
= tsubst_decl (parm_pack
, args
, complain
);
10795 if (arg_pack
&& DECL_PACK_P (arg_pack
))
10796 /* Partial instantiation of the parm_pack, we can't build
10797 up an argument pack yet. */
10798 arg_pack
= NULL_TREE
;
10800 arg_pack
= make_fnparm_pack (arg_pack
);
10801 need_local_specializations
= true;
10804 else if (TREE_CODE (parm_pack
) == FIELD_DECL
)
10805 arg_pack
= tsubst_copy (parm_pack
, args
, complain
, in_decl
);
10809 template_parm_level_and_index (parm_pack
, &level
, &idx
);
10811 if (level
<= levels
)
10812 arg_pack
= TMPL_ARG (args
, level
, idx
);
10815 orig_arg
= arg_pack
;
10816 if (arg_pack
&& TREE_CODE (arg_pack
) == ARGUMENT_PACK_SELECT
)
10817 arg_pack
= ARGUMENT_PACK_SELECT_FROM_PACK (arg_pack
);
10819 if (arg_pack
&& !ARGUMENT_PACK_P (arg_pack
))
10820 /* This can only happen if we forget to expand an argument
10821 pack somewhere else. Just return an error, silently. */
10823 result
= make_tree_vec (1);
10824 TREE_VEC_ELT (result
, 0) = error_mark_node
;
10831 TREE_VEC_LENGTH (ARGUMENT_PACK_ARGS (arg_pack
));
10833 /* Don't bother trying to do a partial substitution with
10834 incomplete packs; we'll try again after deduction. */
10835 if (ARGUMENT_PACK_INCOMPLETE_P (arg_pack
))
10840 else if (len
!= my_len
)
10842 if (!(complain
& tf_error
))
10843 /* Fail quietly. */;
10844 else if (TREE_CODE (t
) == TYPE_PACK_EXPANSION
)
10845 error ("mismatched argument pack lengths while expanding "
10849 error ("mismatched argument pack lengths while expanding "
10852 return error_mark_node
;
10855 /* Keep track of the parameter packs and their corresponding
10857 packs
= tree_cons (parm_pack
, arg_pack
, packs
);
10858 TREE_TYPE (packs
) = orig_arg
;
10862 /* We can't substitute for this parameter pack. We use a flag as
10863 well as the missing_level counter because function parameter
10864 packs don't have a level. */
10865 unsubstituted_packs
= true;
10869 /* If the expansion is just T..., return the matching argument pack. */
10870 if (!unsubstituted_packs
10871 && TREE_PURPOSE (packs
) == pattern
)
10873 tree args
= ARGUMENT_PACK_ARGS (TREE_VALUE (packs
));
10874 if (TREE_CODE (t
) == TYPE_PACK_EXPANSION
10875 || pack_expansion_args_count (args
))
10877 /* Otherwise use the normal path so we get convert_from_reference. */
10880 /* We cannot expand this expansion expression, because we don't have
10881 all of the argument packs we need. */
10882 if (use_pack_expansion_extra_args_p (packs
, len
, unsubstituted_packs
))
10884 /* We got some full packs, but we can't substitute them in until we
10885 have values for all the packs. So remember these until then. */
10887 t
= make_pack_expansion (pattern
);
10888 PACK_EXPANSION_EXTRA_ARGS (t
) = args
;
10891 else if (unsubstituted_packs
)
10893 /* There were no real arguments, we're just replacing a parameter
10894 pack with another version of itself. Substitute into the
10895 pattern and return a PACK_EXPANSION_*. The caller will need to
10897 if (TREE_CODE (t
) == EXPR_PACK_EXPANSION
)
10898 t
= tsubst_expr (pattern
, args
, complain
, in_decl
,
10899 /*integral_constant_expression_p=*/false);
10901 t
= tsubst (pattern
, args
, complain
, in_decl
);
10902 t
= make_pack_expansion (t
);
10906 gcc_assert (len
>= 0);
10908 if (need_local_specializations
)
10910 /* We're in a late-specified return type, so create our own local
10911 specializations map; the current map is either NULL or (in the
10912 case of recursive unification) might have bindings that we don't
10913 want to use or alter. */
10914 saved_local_specializations
= local_specializations
;
10915 local_specializations
= new hash_map
<tree
, tree
>;
10918 /* For each argument in each argument pack, substitute into the
10920 result
= make_tree_vec (len
);
10921 for (i
= 0; i
< len
; ++i
)
10923 t
= gen_elem_of_pack_expansion_instantiation (pattern
, packs
,
10927 TREE_VEC_ELT (result
, i
) = t
;
10928 if (t
== error_mark_node
)
10930 result
= error_mark_node
;
10935 /* Update ARGS to restore the substitution from parameter packs to
10936 their argument packs. */
10937 for (pack
= packs
; pack
; pack
= TREE_CHAIN (pack
))
10939 tree parm
= TREE_PURPOSE (pack
);
10941 if (TREE_CODE (parm
) == PARM_DECL
10942 || TREE_CODE (parm
) == FIELD_DECL
)
10943 register_local_specialization (TREE_TYPE (pack
), parm
);
10948 if (TREE_VALUE (pack
) == NULL_TREE
)
10951 template_parm_level_and_index (parm
, &level
, &idx
);
10953 /* Update the corresponding argument. */
10954 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (args
))
10955 TREE_VEC_ELT (TREE_VEC_ELT (args
, level
-1 ), idx
) =
10958 TREE_VEC_ELT (args
, idx
) = TREE_TYPE (pack
);
10962 if (need_local_specializations
)
10964 delete local_specializations
;
10965 local_specializations
= saved_local_specializations
;
10971 /* Given PARM_DECL PARM, find the corresponding PARM_DECL in the template
10972 TMPL. We do this using DECL_PARM_INDEX, which should work even with
10973 parameter packs; all parms generated from a function parameter pack will
10974 have the same DECL_PARM_INDEX. */
10977 get_pattern_parm (tree parm
, tree tmpl
)
10979 tree pattern
= DECL_TEMPLATE_RESULT (tmpl
);
10982 if (DECL_ARTIFICIAL (parm
))
10984 for (patparm
= DECL_ARGUMENTS (pattern
);
10985 patparm
; patparm
= DECL_CHAIN (patparm
))
10986 if (DECL_ARTIFICIAL (patparm
)
10987 && DECL_NAME (parm
) == DECL_NAME (patparm
))
10992 patparm
= FUNCTION_FIRST_USER_PARM (DECL_TEMPLATE_RESULT (tmpl
));
10993 patparm
= chain_index (DECL_PARM_INDEX (parm
)-1, patparm
);
10994 gcc_assert (DECL_PARM_INDEX (patparm
)
10995 == DECL_PARM_INDEX (parm
));
11001 /* Substitute ARGS into the vector or list of template arguments T. */
11004 tsubst_template_args (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
11007 int len
, need_new
= 0, i
, expanded_len_adjust
= 0, out
;
11010 if (t
== error_mark_node
)
11011 return error_mark_node
;
11013 len
= TREE_VEC_LENGTH (t
);
11014 elts
= XALLOCAVEC (tree
, len
);
11016 for (i
= 0; i
< len
; i
++)
11018 tree orig_arg
= TREE_VEC_ELT (t
, i
);
11021 if (TREE_CODE (orig_arg
) == TREE_VEC
)
11022 new_arg
= tsubst_template_args (orig_arg
, args
, complain
, in_decl
);
11023 else if (PACK_EXPANSION_P (orig_arg
))
11025 /* Substitute into an expansion expression. */
11026 new_arg
= tsubst_pack_expansion (orig_arg
, args
, complain
, in_decl
);
11028 if (TREE_CODE (new_arg
) == TREE_VEC
)
11029 /* Add to the expanded length adjustment the number of
11030 expanded arguments. We subtract one from this
11031 measurement, because the argument pack expression
11032 itself is already counted as 1 in
11033 LEN. EXPANDED_LEN_ADJUST can actually be negative, if
11034 the argument pack is empty. */
11035 expanded_len_adjust
+= TREE_VEC_LENGTH (new_arg
) - 1;
11037 else if (ARGUMENT_PACK_P (orig_arg
))
11039 /* Substitute into each of the arguments. */
11040 new_arg
= TYPE_P (orig_arg
)
11041 ? cxx_make_type (TREE_CODE (orig_arg
))
11042 : make_node (TREE_CODE (orig_arg
));
11044 SET_ARGUMENT_PACK_ARGS (
11046 tsubst_template_args (ARGUMENT_PACK_ARGS (orig_arg
),
11047 args
, complain
, in_decl
));
11049 if (ARGUMENT_PACK_ARGS (new_arg
) == error_mark_node
)
11050 new_arg
= error_mark_node
;
11052 if (TREE_CODE (new_arg
) == NONTYPE_ARGUMENT_PACK
) {
11053 TREE_TYPE (new_arg
) = tsubst (TREE_TYPE (orig_arg
), args
,
11054 complain
, in_decl
);
11055 TREE_CONSTANT (new_arg
) = TREE_CONSTANT (orig_arg
);
11057 if (TREE_TYPE (new_arg
) == error_mark_node
)
11058 new_arg
= error_mark_node
;
11062 new_arg
= tsubst_template_arg (orig_arg
, args
, complain
, in_decl
);
11064 if (new_arg
== error_mark_node
)
11065 return error_mark_node
;
11068 if (new_arg
!= orig_arg
)
11075 /* Make space for the expanded arguments coming from template
11077 t
= make_tree_vec (len
+ expanded_len_adjust
);
11078 /* ORIG_T can contain TREE_VECs. That happens if ORIG_T contains the
11079 arguments for a member template.
11080 In that case each TREE_VEC in ORIG_T represents a level of template
11081 arguments, and ORIG_T won't carry any non defaulted argument count.
11082 It will rather be the nested TREE_VECs that will carry one.
11083 In other words, ORIG_T carries a non defaulted argument count only
11084 if it doesn't contain any nested TREE_VEC. */
11085 if (NON_DEFAULT_TEMPLATE_ARGS_COUNT (orig_t
))
11087 int count
= GET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (orig_t
);
11088 count
+= expanded_len_adjust
;
11089 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (t
, count
);
11091 for (i
= 0, out
= 0; i
< len
; i
++)
11093 if ((PACK_EXPANSION_P (TREE_VEC_ELT (orig_t
, i
))
11094 || ARGUMENT_PACK_P (TREE_VEC_ELT (orig_t
, i
)))
11095 && TREE_CODE (elts
[i
]) == TREE_VEC
)
11099 /* Now expand the template argument pack "in place". */
11100 for (idx
= 0; idx
< TREE_VEC_LENGTH (elts
[i
]); idx
++, out
++)
11101 TREE_VEC_ELT (t
, out
) = TREE_VEC_ELT (elts
[i
], idx
);
11105 TREE_VEC_ELT (t
, out
) = elts
[i
];
11113 /* Return the result of substituting ARGS into the template parameters
11114 given by PARMS. If there are m levels of ARGS and m + n levels of
11115 PARMS, then the result will contain n levels of PARMS. For
11116 example, if PARMS is `template <class T> template <class U>
11117 template <T*, U, class V>' and ARGS is {{int}, {double}} then the
11118 result will be `template <int*, double, class V>'. */
11121 tsubst_template_parms (tree parms
, tree args
, tsubst_flags_t complain
)
11123 tree r
= NULL_TREE
;
11126 /* When substituting into a template, we must set
11127 PROCESSING_TEMPLATE_DECL as the template parameters may be
11128 dependent if they are based on one-another, and the dependency
11129 predicates are short-circuit outside of templates. */
11130 ++processing_template_decl
;
11132 for (new_parms
= &r
;
11133 parms
&& TMPL_PARMS_DEPTH (parms
) > TMPL_ARGS_DEPTH (args
);
11134 new_parms
= &(TREE_CHAIN (*new_parms
)),
11135 parms
= TREE_CHAIN (parms
))
11138 make_tree_vec (TREE_VEC_LENGTH (TREE_VALUE (parms
)));
11141 for (i
= 0; i
< TREE_VEC_LENGTH (new_vec
); ++i
)
11145 if (parms
== error_mark_node
)
11148 tuple
= TREE_VEC_ELT (TREE_VALUE (parms
), i
);
11150 if (tuple
== error_mark_node
)
11153 TREE_VEC_ELT (new_vec
, i
) =
11154 tsubst_template_parm (tuple
, args
, complain
);
11158 tree_cons (size_int (TMPL_PARMS_DEPTH (parms
)
11159 - TMPL_ARGS_DEPTH (args
)),
11160 new_vec
, NULL_TREE
);
11163 --processing_template_decl
;
11168 /* Return the result of substituting ARGS into one template parameter
11169 given by T. T Must be a TREE_LIST which TREE_VALUE is the template
11170 parameter and which TREE_PURPOSE is the default argument of the
11171 template parameter. */
11174 tsubst_template_parm (tree t
, tree args
, tsubst_flags_t complain
)
11176 tree default_value
, parm_decl
;
11178 if (args
== NULL_TREE
11180 || t
== error_mark_node
)
11183 gcc_assert (TREE_CODE (t
) == TREE_LIST
);
11185 default_value
= TREE_PURPOSE (t
);
11186 parm_decl
= TREE_VALUE (t
);
11188 parm_decl
= tsubst (parm_decl
, args
, complain
, NULL_TREE
);
11189 if (TREE_CODE (parm_decl
) == PARM_DECL
11190 && invalid_nontype_parm_type_p (TREE_TYPE (parm_decl
), complain
))
11191 parm_decl
= error_mark_node
;
11192 default_value
= tsubst_template_arg (default_value
, args
,
11193 complain
, NULL_TREE
);
11195 return build_tree_list (default_value
, parm_decl
);
11198 /* Substitute the ARGS into the indicated aggregate (or enumeration)
11199 type T. If T is not an aggregate or enumeration type, it is
11200 handled as if by tsubst. IN_DECL is as for tsubst. If
11201 ENTERING_SCOPE is nonzero, T is the context for a template which
11202 we are presently tsubst'ing. Return the substituted value. */
11205 tsubst_aggr_type (tree t
,
11207 tsubst_flags_t complain
,
11209 int entering_scope
)
11211 if (t
== NULL_TREE
)
11214 switch (TREE_CODE (t
))
11217 if (TYPE_PTRMEMFUNC_P (t
))
11218 return tsubst (TYPE_PTRMEMFUNC_FN_TYPE (t
), args
, complain
, in_decl
);
11220 /* Else fall through. */
11221 case ENUMERAL_TYPE
:
11223 if (TYPE_TEMPLATE_INFO (t
) && uses_template_parms (t
))
11228 int saved_unevaluated_operand
;
11229 int saved_inhibit_evaluation_warnings
;
11231 /* In "sizeof(X<I>)" we need to evaluate "I". */
11232 saved_unevaluated_operand
= cp_unevaluated_operand
;
11233 cp_unevaluated_operand
= 0;
11234 saved_inhibit_evaluation_warnings
= c_inhibit_evaluation_warnings
;
11235 c_inhibit_evaluation_warnings
= 0;
11237 /* First, determine the context for the type we are looking
11239 context
= TYPE_CONTEXT (t
);
11240 if (context
&& TYPE_P (context
))
11242 context
= tsubst_aggr_type (context
, args
, complain
,
11243 in_decl
, /*entering_scope=*/1);
11244 /* If context is a nested class inside a class template,
11245 it may still need to be instantiated (c++/33959). */
11246 context
= complete_type (context
);
11249 /* Then, figure out what arguments are appropriate for the
11250 type we are trying to find. For example, given:
11252 template <class T> struct S;
11253 template <class T, class U> void f(T, U) { S<U> su; }
11255 and supposing that we are instantiating f<int, double>,
11256 then our ARGS will be {int, double}, but, when looking up
11257 S we only want {double}. */
11258 argvec
= tsubst_template_args (TYPE_TI_ARGS (t
), args
,
11259 complain
, in_decl
);
11260 if (argvec
== error_mark_node
)
11261 r
= error_mark_node
;
11264 r
= lookup_template_class (t
, argvec
, in_decl
, context
,
11265 entering_scope
, complain
);
11266 r
= cp_build_qualified_type_real (r
, cp_type_quals (t
), complain
);
11269 cp_unevaluated_operand
= saved_unevaluated_operand
;
11270 c_inhibit_evaluation_warnings
= saved_inhibit_evaluation_warnings
;
11275 /* This is not a template type, so there's nothing to do. */
11279 return tsubst (t
, args
, complain
, in_decl
);
11283 /* Substitute into the default argument ARG (a default argument for
11284 FN), which has the indicated TYPE. */
11287 tsubst_default_argument (tree fn
, tree type
, tree arg
, tsubst_flags_t complain
)
11289 tree saved_class_ptr
= NULL_TREE
;
11290 tree saved_class_ref
= NULL_TREE
;
11291 int errs
= errorcount
+ sorrycount
;
11293 /* This can happen in invalid code. */
11294 if (TREE_CODE (arg
) == DEFAULT_ARG
)
11297 /* This default argument came from a template. Instantiate the
11298 default argument here, not in tsubst. In the case of
11307 we must be careful to do name lookup in the scope of S<T>,
11308 rather than in the current class. */
11309 push_access_scope (fn
);
11310 /* The "this" pointer is not valid in a default argument. */
11313 saved_class_ptr
= current_class_ptr
;
11314 cp_function_chain
->x_current_class_ptr
= NULL_TREE
;
11315 saved_class_ref
= current_class_ref
;
11316 cp_function_chain
->x_current_class_ref
= NULL_TREE
;
11319 push_deferring_access_checks(dk_no_deferred
);
11320 /* The default argument expression may cause implicitly defined
11321 member functions to be synthesized, which will result in garbage
11322 collection. We must treat this situation as if we were within
11323 the body of function so as to avoid collecting live data on the
11326 arg
= tsubst_expr (arg
, DECL_TI_ARGS (fn
),
11327 complain
, NULL_TREE
,
11328 /*integral_constant_expression_p=*/false);
11330 pop_deferring_access_checks();
11332 /* Restore the "this" pointer. */
11335 cp_function_chain
->x_current_class_ptr
= saved_class_ptr
;
11336 cp_function_chain
->x_current_class_ref
= saved_class_ref
;
11339 if (errorcount
+sorrycount
> errs
11340 && (complain
& tf_warning_or_error
))
11341 inform (input_location
,
11342 " when instantiating default argument for call to %D", fn
);
11344 /* Make sure the default argument is reasonable. */
11345 arg
= check_default_argument (type
, arg
, complain
);
11347 pop_access_scope (fn
);
11352 /* Substitute into all the default arguments for FN. */
11355 tsubst_default_arguments (tree fn
, tsubst_flags_t complain
)
11360 tmpl_args
= DECL_TI_ARGS (fn
);
11362 /* If this function is not yet instantiated, we certainly don't need
11363 its default arguments. */
11364 if (uses_template_parms (tmpl_args
))
11366 /* Don't do this again for clones. */
11367 if (DECL_CLONED_FUNCTION_P (fn
))
11370 for (arg
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
11372 arg
= TREE_CHAIN (arg
))
11373 if (TREE_PURPOSE (arg
))
11374 TREE_PURPOSE (arg
) = tsubst_default_argument (fn
,
11376 TREE_PURPOSE (arg
),
11380 /* Substitute the ARGS into the T, which is a _DECL. Return the
11381 result of the substitution. Issue error and warning messages under
11382 control of COMPLAIN. */
11385 tsubst_decl (tree t
, tree args
, tsubst_flags_t complain
)
11387 #define RETURN(EXP) do { r = (EXP); goto out; } while(0)
11388 location_t saved_loc
;
11389 tree r
= NULL_TREE
;
11391 hashval_t hash
= 0;
11393 /* Set the filename and linenumber to improve error-reporting. */
11394 saved_loc
= input_location
;
11395 input_location
= DECL_SOURCE_LOCATION (t
);
11397 switch (TREE_CODE (t
))
11399 case TEMPLATE_DECL
:
11401 /* We can get here when processing a member function template,
11402 member class template, or template template parameter. */
11403 tree decl
= DECL_TEMPLATE_RESULT (t
);
11408 if (DECL_TEMPLATE_TEMPLATE_PARM_P (t
))
11410 /* Template template parameter is treated here. */
11411 tree new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
11412 if (new_type
== error_mark_node
)
11413 r
= error_mark_node
;
11414 /* If we get a real template back, return it. This can happen in
11415 the context of most_specialized_partial_spec. */
11416 else if (TREE_CODE (new_type
) == TEMPLATE_DECL
)
11419 /* The new TEMPLATE_DECL was built in
11420 reduce_template_parm_level. */
11421 r
= TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL (new_type
);
11425 /* We might already have an instance of this template.
11426 The ARGS are for the surrounding class type, so the
11427 full args contain the tsubst'd args for the context,
11428 plus the innermost args from the template decl. */
11429 tmpl_args
= DECL_CLASS_TEMPLATE_P (t
)
11430 ? CLASSTYPE_TI_ARGS (TREE_TYPE (t
))
11431 : DECL_TI_ARGS (DECL_TEMPLATE_RESULT (t
));
11432 /* Because this is a template, the arguments will still be
11433 dependent, even after substitution. If
11434 PROCESSING_TEMPLATE_DECL is not set, the dependency
11435 predicates will short-circuit. */
11436 ++processing_template_decl
;
11437 full_args
= tsubst_template_args (tmpl_args
, args
,
11438 complain
, in_decl
);
11439 --processing_template_decl
;
11440 if (full_args
== error_mark_node
)
11441 RETURN (error_mark_node
);
11443 /* If this is a default template template argument,
11444 tsubst might not have changed anything. */
11445 if (full_args
== tmpl_args
)
11448 hash
= hash_tmpl_and_args (t
, full_args
);
11449 spec
= retrieve_specialization (t
, full_args
, hash
);
11450 if (spec
!= NULL_TREE
)
11456 /* Make a new template decl. It will be similar to the
11457 original, but will record the current template arguments.
11458 We also create a new function declaration, which is just
11459 like the old one, but points to this new template, rather
11460 than the old one. */
11462 gcc_assert (DECL_LANG_SPECIFIC (r
) != 0);
11463 DECL_CHAIN (r
) = NULL_TREE
;
11465 // Build new template info linking to the original template decl.
11466 DECL_TEMPLATE_INFO (r
) = build_template_info (t
, args
);
11468 if (TREE_CODE (decl
) == TYPE_DECL
11469 && !TYPE_DECL_ALIAS_P (decl
))
11472 ++processing_template_decl
;
11473 new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
11474 --processing_template_decl
;
11475 if (new_type
== error_mark_node
)
11476 RETURN (error_mark_node
);
11478 TREE_TYPE (r
) = new_type
;
11479 /* For a partial specialization, we need to keep pointing to
11480 the primary template. */
11481 if (!DECL_TEMPLATE_SPECIALIZATION (t
))
11482 CLASSTYPE_TI_TEMPLATE (new_type
) = r
;
11483 DECL_TEMPLATE_RESULT (r
) = TYPE_MAIN_DECL (new_type
);
11484 DECL_TI_ARGS (r
) = CLASSTYPE_TI_ARGS (new_type
);
11485 DECL_CONTEXT (r
) = TYPE_CONTEXT (new_type
);
11490 ++processing_template_decl
;
11491 new_decl
= tsubst (decl
, args
, complain
, in_decl
);
11492 --processing_template_decl
;
11493 if (new_decl
== error_mark_node
)
11494 RETURN (error_mark_node
);
11496 DECL_TEMPLATE_RESULT (r
) = new_decl
;
11497 DECL_TI_TEMPLATE (new_decl
) = r
;
11498 TREE_TYPE (r
) = TREE_TYPE (new_decl
);
11499 DECL_TI_ARGS (r
) = DECL_TI_ARGS (new_decl
);
11500 DECL_CONTEXT (r
) = DECL_CONTEXT (new_decl
);
11503 SET_DECL_IMPLICIT_INSTANTIATION (r
);
11504 DECL_TEMPLATE_INSTANTIATIONS (r
) = NULL_TREE
;
11505 DECL_TEMPLATE_SPECIALIZATIONS (r
) = NULL_TREE
;
11507 /* The template parameters for this new template are all the
11508 template parameters for the old template, except the
11509 outermost level of parameters. */
11510 DECL_TEMPLATE_PARMS (r
)
11511 = tsubst_template_parms (DECL_TEMPLATE_PARMS (t
), args
,
11514 if (PRIMARY_TEMPLATE_P (t
))
11515 DECL_PRIMARY_TEMPLATE (r
) = r
;
11517 if (TREE_CODE (decl
) != TYPE_DECL
&& !VAR_P (decl
))
11518 /* Record this non-type partial instantiation. */
11519 register_specialization (r
, t
,
11520 DECL_TI_ARGS (DECL_TEMPLATE_RESULT (r
)),
11525 case FUNCTION_DECL
:
11528 tree argvec
= NULL_TREE
;
11536 /* Nobody should be tsubst'ing into non-template functions. */
11537 gcc_assert (DECL_TEMPLATE_INFO (t
) != NULL_TREE
);
11539 if (TREE_CODE (DECL_TI_TEMPLATE (t
)) == TEMPLATE_DECL
)
11544 /* If T is not dependent, just return it. We have to
11545 increment PROCESSING_TEMPLATE_DECL because
11546 value_dependent_expression_p assumes that nothing is
11547 dependent when PROCESSING_TEMPLATE_DECL is zero. */
11548 ++processing_template_decl
;
11549 dependent_p
= value_dependent_expression_p (t
);
11550 --processing_template_decl
;
11554 /* Calculate the most general template of which R is a
11555 specialization, and the complete set of arguments used to
11557 gen_tmpl
= most_general_template (DECL_TI_TEMPLATE (t
));
11558 argvec
= tsubst_template_args (DECL_TI_ARGS
11559 (DECL_TEMPLATE_RESULT
11560 (DECL_TI_TEMPLATE (t
))),
11561 args
, complain
, in_decl
);
11562 if (argvec
== error_mark_node
)
11563 RETURN (error_mark_node
);
11565 /* Check to see if we already have this specialization. */
11566 hash
= hash_tmpl_and_args (gen_tmpl
, argvec
);
11567 spec
= retrieve_specialization (gen_tmpl
, argvec
, hash
);
11575 /* We can see more levels of arguments than parameters if
11576 there was a specialization of a member template, like
11579 template <class T> struct S { template <class U> void f(); }
11580 template <> template <class U> void S<int>::f(U);
11582 Here, we'll be substituting into the specialization,
11583 because that's where we can find the code we actually
11584 want to generate, but we'll have enough arguments for
11585 the most general template.
11587 We also deal with the peculiar case:
11589 template <class T> struct S {
11590 template <class U> friend void f();
11592 template <class U> void f() {}
11594 template void f<double>();
11596 Here, the ARGS for the instantiation of will be {int,
11597 double}. But, we only need as many ARGS as there are
11598 levels of template parameters in CODE_PATTERN. We are
11599 careful not to get fooled into reducing the ARGS in
11602 template <class T> struct S { template <class U> void f(U); }
11603 template <class T> template <> void S<T>::f(int) {}
11605 which we can spot because the pattern will be a
11606 specialization in this case. */
11607 args_depth
= TMPL_ARGS_DEPTH (args
);
11609 TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (DECL_TI_TEMPLATE (t
)));
11610 if (args_depth
> parms_depth
11611 && !DECL_TEMPLATE_SPECIALIZATION (t
))
11612 args
= get_innermost_template_args (args
, parms_depth
);
11616 /* This special case arises when we have something like this:
11618 template <class T> struct S {
11619 friend void f<int>(int, double);
11622 Here, the DECL_TI_TEMPLATE for the friend declaration
11623 will be an IDENTIFIER_NODE. We are being called from
11624 tsubst_friend_function, and we want only to create a
11625 new decl (R) with appropriate types so that we can call
11626 determine_specialization. */
11627 gen_tmpl
= NULL_TREE
;
11630 if (DECL_CLASS_SCOPE_P (t
))
11632 if (DECL_NAME (t
) == constructor_name (DECL_CONTEXT (t
)))
11636 ctx
= tsubst_aggr_type (DECL_CONTEXT (t
), args
,
11637 complain
, t
, /*entering_scope=*/1);
11642 ctx
= DECL_CONTEXT (t
);
11644 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
11645 if (type
== error_mark_node
)
11646 RETURN (error_mark_node
);
11648 /* If we hit excessive deduction depth, the type is bogus even if
11649 it isn't error_mark_node, so don't build a decl. */
11650 if (excessive_deduction_depth
)
11651 RETURN (error_mark_node
);
11653 /* We do NOT check for matching decls pushed separately at this
11654 point, as they may not represent instantiations of this
11655 template, and in any case are considered separate under the
11658 DECL_USE_TEMPLATE (r
) = 0;
11659 TREE_TYPE (r
) = type
;
11660 /* Clear out the mangled name and RTL for the instantiation. */
11661 SET_DECL_ASSEMBLER_NAME (r
, NULL_TREE
);
11662 SET_DECL_RTL (r
, NULL
);
11663 /* Leave DECL_INITIAL set on deleted instantiations. */
11664 if (!DECL_DELETED_FN (r
))
11665 DECL_INITIAL (r
) = NULL_TREE
;
11666 DECL_CONTEXT (r
) = ctx
;
11668 /* OpenMP UDRs have the only argument a reference to the declared
11669 type. We want to diagnose if the declared type is a reference,
11670 which is invalid, but as references to references are usually
11671 quietly merged, diagnose it here. */
11672 if (DECL_OMP_DECLARE_REDUCTION_P (t
))
11675 = TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (t
))));
11676 argtype
= tsubst (argtype
, args
, complain
, in_decl
);
11677 if (TREE_CODE (argtype
) == REFERENCE_TYPE
)
11678 error_at (DECL_SOURCE_LOCATION (t
),
11679 "reference type %qT in "
11680 "%<#pragma omp declare reduction%>", argtype
);
11681 if (strchr (IDENTIFIER_POINTER (DECL_NAME (t
)), '~') == NULL
)
11682 DECL_NAME (r
) = omp_reduction_id (ERROR_MARK
, DECL_NAME (t
),
11686 if (member
&& DECL_CONV_FN_P (r
))
11687 /* Type-conversion operator. Reconstruct the name, in
11688 case it's the name of one of the template's parameters. */
11689 DECL_NAME (r
) = mangle_conv_op_name_for_type (TREE_TYPE (type
));
11691 DECL_ARGUMENTS (r
) = tsubst (DECL_ARGUMENTS (t
), args
,
11693 DECL_RESULT (r
) = NULL_TREE
;
11695 TREE_STATIC (r
) = 0;
11696 TREE_PUBLIC (r
) = TREE_PUBLIC (t
);
11697 DECL_EXTERNAL (r
) = 1;
11698 /* If this is an instantiation of a function with internal
11699 linkage, we already know what object file linkage will be
11700 assigned to the instantiation. */
11701 DECL_INTERFACE_KNOWN (r
) = !TREE_PUBLIC (r
);
11702 DECL_DEFER_OUTPUT (r
) = 0;
11703 DECL_CHAIN (r
) = NULL_TREE
;
11704 DECL_PENDING_INLINE_INFO (r
) = 0;
11705 DECL_PENDING_INLINE_P (r
) = 0;
11706 DECL_SAVED_TREE (r
) = NULL_TREE
;
11707 DECL_STRUCT_FUNCTION (r
) = NULL
;
11709 /* We'll re-clone as appropriate in instantiate_template. */
11710 DECL_CLONED_FUNCTION (r
) = NULL_TREE
;
11712 /* If we aren't complaining now, return on error before we register
11713 the specialization so that we'll complain eventually. */
11714 if ((complain
& tf_error
) == 0
11715 && IDENTIFIER_OPNAME_P (DECL_NAME (r
))
11716 && !grok_op_properties (r
, /*complain=*/false))
11717 RETURN (error_mark_node
);
11719 /* When instantiating a constrained member, substitute
11720 into the constraints to create a new constraint. */
11721 if (tree ci
= get_constraints (t
))
11724 ci
= tsubst_constraint_info (ci
, argvec
, complain
, NULL_TREE
);
11725 set_constraints (r
, ci
);
11728 /* Set up the DECL_TEMPLATE_INFO for R. There's no need to do
11729 this in the special friend case mentioned above where
11730 GEN_TMPL is NULL. */
11733 DECL_TEMPLATE_INFO (r
)
11734 = build_template_info (gen_tmpl
, argvec
);
11735 SET_DECL_IMPLICIT_INSTANTIATION (r
);
11738 = register_specialization (r
, gen_tmpl
, argvec
, false, hash
);
11740 /* We instantiated this while substituting into
11741 the type earlier (template/friend54.C). */
11744 /* We're not supposed to instantiate default arguments
11745 until they are called, for a template. But, for a
11748 template <class T> void f ()
11749 { extern void g(int i = T()); }
11751 we should do the substitution when the template is
11752 instantiated. We handle the member function case in
11753 instantiate_class_template since the default arguments
11754 might refer to other members of the class. */
11756 && !PRIMARY_TEMPLATE_P (gen_tmpl
)
11757 && !uses_template_parms (argvec
))
11758 tsubst_default_arguments (r
, complain
);
11761 DECL_TEMPLATE_INFO (r
) = NULL_TREE
;
11763 /* Copy the list of befriending classes. */
11764 for (friends
= &DECL_BEFRIENDING_CLASSES (r
);
11766 friends
= &TREE_CHAIN (*friends
))
11768 *friends
= copy_node (*friends
);
11769 TREE_VALUE (*friends
) = tsubst (TREE_VALUE (*friends
),
11774 if (DECL_CONSTRUCTOR_P (r
) || DECL_DESTRUCTOR_P (r
))
11776 maybe_retrofit_in_chrg (r
);
11777 if (DECL_CONSTRUCTOR_P (r
))
11778 grok_ctor_properties (ctx
, r
);
11779 if (DECL_INHERITED_CTOR_BASE (r
))
11780 deduce_inheriting_ctor (r
);
11781 /* If this is an instantiation of a member template, clone it.
11782 If it isn't, that'll be handled by
11783 clone_constructors_and_destructors. */
11784 if (PRIMARY_TEMPLATE_P (gen_tmpl
))
11785 clone_function_decl (r
, /*update_method_vec_p=*/0);
11787 else if ((complain
& tf_error
) != 0
11788 && IDENTIFIER_OPNAME_P (DECL_NAME (r
))
11789 && !grok_op_properties (r
, /*complain=*/true))
11790 RETURN (error_mark_node
);
11792 if (DECL_FRIEND_P (t
) && DECL_FRIEND_CONTEXT (t
))
11793 SET_DECL_FRIEND_CONTEXT (r
,
11794 tsubst (DECL_FRIEND_CONTEXT (t
),
11795 args
, complain
, in_decl
));
11797 /* Possibly limit visibility based on template args. */
11798 DECL_VISIBILITY (r
) = VISIBILITY_DEFAULT
;
11799 if (DECL_VISIBILITY_SPECIFIED (t
))
11801 DECL_VISIBILITY_SPECIFIED (r
) = 0;
11802 DECL_ATTRIBUTES (r
)
11803 = remove_attribute ("visibility", DECL_ATTRIBUTES (r
));
11805 determine_visibility (r
);
11806 if (DECL_DEFAULTED_OUTSIDE_CLASS_P (r
)
11807 && !processing_template_decl
)
11808 defaulted_late_check (r
);
11810 apply_late_template_attributes (&r
, DECL_ATTRIBUTES (r
), 0,
11811 args
, complain
, in_decl
);
11817 tree type
= NULL_TREE
;
11819 tree expanded_types
= NULL_TREE
;
11820 tree prev_r
= NULL_TREE
;
11821 tree first_r
= NULL_TREE
;
11823 if (DECL_PACK_P (t
))
11825 /* If there is a local specialization that isn't a
11826 parameter pack, it means that we're doing a "simple"
11827 substitution from inside tsubst_pack_expansion. Just
11828 return the local specialization (which will be a single
11830 tree spec
= retrieve_local_specialization (t
);
11832 && TREE_CODE (spec
) == PARM_DECL
11833 && TREE_CODE (TREE_TYPE (spec
)) != TYPE_PACK_EXPANSION
)
11836 /* Expand the TYPE_PACK_EXPANSION that provides the types for
11837 the parameters in this function parameter pack. */
11838 expanded_types
= tsubst_pack_expansion (TREE_TYPE (t
), args
,
11839 complain
, in_decl
);
11840 if (TREE_CODE (expanded_types
) == TREE_VEC
)
11842 len
= TREE_VEC_LENGTH (expanded_types
);
11844 /* Zero-length parameter packs are boring. Just substitute
11847 RETURN (tsubst (TREE_CHAIN (t
), args
, complain
,
11852 /* All we did was update the type. Make a note of that. */
11853 type
= expanded_types
;
11854 expanded_types
= NULL_TREE
;
11858 /* Loop through all of the parameters we'll build. When T is
11859 a function parameter pack, LEN is the number of expanded
11860 types in EXPANDED_TYPES; otherwise, LEN is 1. */
11862 for (i
= 0; i
< len
; ++i
)
11866 if (DECL_TEMPLATE_PARM_P (t
))
11867 SET_DECL_TEMPLATE_PARM_P (r
);
11869 if (expanded_types
)
11870 /* We're on the Ith parameter of the function parameter
11873 /* Get the Ith type. */
11874 type
= TREE_VEC_ELT (expanded_types
, i
);
11876 /* Rename the parameter to include the index. */
11878 = make_ith_pack_parameter_name (DECL_NAME (r
), i
);
11881 /* We're dealing with a normal parameter. */
11882 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
11884 type
= type_decays_to (type
);
11885 TREE_TYPE (r
) = type
;
11886 cp_apply_type_quals_to_decl (cp_type_quals (type
), r
);
11888 if (DECL_INITIAL (r
))
11890 if (TREE_CODE (DECL_INITIAL (r
)) != TEMPLATE_PARM_INDEX
)
11891 DECL_INITIAL (r
) = TREE_TYPE (r
);
11893 DECL_INITIAL (r
) = tsubst (DECL_INITIAL (r
), args
,
11894 complain
, in_decl
);
11897 DECL_CONTEXT (r
) = NULL_TREE
;
11899 if (!DECL_TEMPLATE_PARM_P (r
))
11900 DECL_ARG_TYPE (r
) = type_passed_as (type
);
11902 apply_late_template_attributes (&r
, DECL_ATTRIBUTES (r
), 0,
11903 args
, complain
, in_decl
);
11905 /* Keep track of the first new parameter we
11906 generate. That's what will be returned to the
11911 /* Build a proper chain of parameters when substituting
11912 into a function parameter pack. */
11914 DECL_CHAIN (prev_r
) = r
;
11917 /* If cp_unevaluated_operand is set, we're just looking for a
11918 single dummy parameter, so don't keep going. */
11919 if (DECL_CHAIN (t
) && !cp_unevaluated_operand
)
11920 DECL_CHAIN (r
) = tsubst (DECL_CHAIN (t
), args
,
11921 complain
, DECL_CHAIN (t
));
11923 /* FIRST_R contains the start of the chain we've built. */
11930 tree type
= NULL_TREE
;
11931 tree vec
= NULL_TREE
;
11932 tree expanded_types
= NULL_TREE
;
11935 if (PACK_EXPANSION_P (TREE_TYPE (t
)))
11937 /* This field is a lambda capture pack. Return a TREE_VEC of
11938 the expanded fields to instantiate_class_template_1 and
11939 store them in the specializations hash table as a
11940 NONTYPE_ARGUMENT_PACK so that tsubst_copy can find them. */
11941 expanded_types
= tsubst_pack_expansion (TREE_TYPE (t
), args
,
11942 complain
, in_decl
);
11943 if (TREE_CODE (expanded_types
) == TREE_VEC
)
11945 len
= TREE_VEC_LENGTH (expanded_types
);
11946 vec
= make_tree_vec (len
);
11950 /* All we did was update the type. Make a note of that. */
11951 type
= expanded_types
;
11952 expanded_types
= NULL_TREE
;
11956 for (int i
= 0; i
< len
; ++i
)
11959 if (expanded_types
)
11961 type
= TREE_VEC_ELT (expanded_types
, i
);
11963 = make_ith_pack_parameter_name (DECL_NAME (r
), i
);
11966 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
11968 if (type
== error_mark_node
)
11969 RETURN (error_mark_node
);
11970 TREE_TYPE (r
) = type
;
11971 cp_apply_type_quals_to_decl (cp_type_quals (type
), r
);
11973 if (DECL_C_BIT_FIELD (r
))
11974 /* For bit-fields, DECL_INITIAL gives the number of bits. For
11975 non-bit-fields DECL_INITIAL is a non-static data member
11976 initializer, which gets deferred instantiation. */
11978 = tsubst_expr (DECL_INITIAL (t
), args
,
11980 /*integral_constant_expression_p=*/true);
11981 else if (DECL_INITIAL (t
))
11983 /* Set up DECL_TEMPLATE_INFO so that we can get at the
11984 NSDMI in perform_member_init. Still set DECL_INITIAL
11985 so that we know there is one. */
11986 DECL_INITIAL (r
) = void_node
;
11987 gcc_assert (DECL_LANG_SPECIFIC (r
) == NULL
);
11988 retrofit_lang_decl (r
);
11989 DECL_TEMPLATE_INFO (r
) = build_template_info (t
, args
);
11991 /* We don't have to set DECL_CONTEXT here; it is set by
11992 finish_member_declaration. */
11993 DECL_CHAIN (r
) = NULL_TREE
;
11995 apply_late_template_attributes (&r
, DECL_ATTRIBUTES (r
), 0,
11996 args
, complain
, in_decl
);
11999 TREE_VEC_ELT (vec
, i
) = r
;
12005 tree pack
= make_node (NONTYPE_ARGUMENT_PACK
);
12006 tree tpack
= cxx_make_type (TYPE_ARGUMENT_PACK
);
12007 SET_ARGUMENT_PACK_ARGS (pack
, vec
);
12008 SET_ARGUMENT_PACK_ARGS (tpack
, expanded_types
);
12009 TREE_TYPE (pack
) = tpack
;
12010 register_specialization (pack
, t
, args
, false, 0);
12016 /* We reach here only for member using decls. We also need to check
12017 uses_template_parms because DECL_DEPENDENT_P is not set for a
12018 using-declaration that designates a member of the current
12019 instantiation (c++/53549). */
12020 if (DECL_DEPENDENT_P (t
)
12021 || uses_template_parms (USING_DECL_SCOPE (t
)))
12023 tree inst_scope
= tsubst_copy (USING_DECL_SCOPE (t
), args
,
12024 complain
, in_decl
);
12025 tree name
= tsubst_copy (DECL_NAME (t
), args
, complain
, in_decl
);
12026 r
= do_class_using_decl (inst_scope
, name
);
12028 r
= error_mark_node
;
12031 TREE_PROTECTED (r
) = TREE_PROTECTED (t
);
12032 TREE_PRIVATE (r
) = TREE_PRIVATE (t
);
12038 DECL_CHAIN (r
) = NULL_TREE
;
12045 tree argvec
= NULL_TREE
;
12046 tree gen_tmpl
= NULL_TREE
;
12048 tree tmpl
= NULL_TREE
;
12050 tree type
= NULL_TREE
;
12053 if (TREE_TYPE (t
) == error_mark_node
)
12054 RETURN (error_mark_node
);
12056 if (TREE_CODE (t
) == TYPE_DECL
12057 && t
== TYPE_MAIN_DECL (TREE_TYPE (t
)))
12059 /* If this is the canonical decl, we don't have to
12060 mess with instantiations, and often we can't (for
12061 typename, template type parms and such). Note that
12062 TYPE_NAME is not correct for the above test if
12063 we've copied the type for a typedef. */
12064 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
12065 if (type
== error_mark_node
)
12066 RETURN (error_mark_node
);
12067 r
= TYPE_NAME (type
);
12071 /* Check to see if we already have the specialization we
12074 if (DECL_CLASS_SCOPE_P (t
) || DECL_NAMESPACE_SCOPE_P (t
))
12076 /* T is a static data member or namespace-scope entity.
12077 We have to substitute into namespace-scope variables
12078 (not just variable templates) because of cases like:
12080 template <class T> void f() { extern T t; }
12082 where the entity referenced is not known until
12083 instantiation time. */
12085 ctx
= DECL_CONTEXT (t
);
12086 if (DECL_CLASS_SCOPE_P (t
))
12088 ctx
= tsubst_aggr_type (ctx
, args
,
12090 in_decl
, /*entering_scope=*/1);
12091 /* If CTX is unchanged, then T is in fact the
12092 specialization we want. That situation occurs when
12093 referencing a static data member within in its own
12094 class. We can use pointer equality, rather than
12095 same_type_p, because DECL_CONTEXT is always
12097 if (ctx
== DECL_CONTEXT (t
)
12098 /* ... unless T is a member template; in which
12099 case our caller can be willing to create a
12100 specialization of that template represented
12102 && !(DECL_TI_TEMPLATE (t
)
12103 && DECL_MEMBER_TEMPLATE_P (DECL_TI_TEMPLATE (t
))))
12109 tmpl
= DECL_TI_TEMPLATE (t
);
12110 gen_tmpl
= most_general_template (tmpl
);
12111 argvec
= tsubst (DECL_TI_ARGS (t
), args
, complain
, in_decl
);
12112 if (argvec
!= error_mark_node
)
12113 argvec
= (coerce_innermost_template_parms
12114 (DECL_TEMPLATE_PARMS (gen_tmpl
),
12115 argvec
, t
, complain
,
12116 /*all*/true, /*defarg*/true));
12117 if (argvec
== error_mark_node
)
12118 RETURN (error_mark_node
);
12119 hash
= hash_tmpl_and_args (gen_tmpl
, argvec
);
12120 spec
= retrieve_specialization (gen_tmpl
, argvec
, hash
);
12125 /* A local variable. */
12127 /* Subsequent calls to pushdecl will fill this in. */
12129 spec
= retrieve_local_specialization (t
);
12131 /* If we already have the specialization we need, there is
12132 nothing more to do. */
12139 /* Create a new node for the specialization we need. */
12141 if (type
== NULL_TREE
)
12143 if (is_typedef_decl (t
))
12144 type
= DECL_ORIGINAL_TYPE (t
);
12146 type
= TREE_TYPE (t
);
12148 && VAR_HAD_UNKNOWN_BOUND (t
)
12149 && type
!= error_mark_node
)
12150 type
= strip_array_domain (type
);
12151 type
= tsubst (type
, args
, complain
, in_decl
);
12155 /* Even if the original location is out of scope, the
12156 newly substituted one is not. */
12157 DECL_DEAD_FOR_LOCAL (r
) = 0;
12158 DECL_INITIALIZED_P (r
) = 0;
12159 DECL_TEMPLATE_INSTANTIATED (r
) = 0;
12160 if (type
== error_mark_node
)
12161 RETURN (error_mark_node
);
12162 if (TREE_CODE (type
) == FUNCTION_TYPE
)
12164 /* It may seem that this case cannot occur, since:
12169 declares a function, not a variable. However:
12172 template <typename T> void g() { T t; }
12173 template void g<f>();
12175 is an attempt to declare a variable with function
12177 error ("variable %qD has function type",
12178 /* R is not yet sufficiently initialized, so we
12179 just use its name. */
12181 RETURN (error_mark_node
);
12183 type
= complete_type (type
);
12184 /* Wait until cp_finish_decl to set this again, to handle
12185 circular dependency (template/instantiate6.C). */
12186 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (r
) = 0;
12187 type
= check_var_type (DECL_NAME (r
), type
);
12189 if (DECL_HAS_VALUE_EXPR_P (t
))
12191 tree ve
= DECL_VALUE_EXPR (t
);
12192 ve
= tsubst_expr (ve
, args
, complain
, in_decl
,
12193 /*constant_expression_p=*/false);
12194 if (REFERENCE_REF_P (ve
))
12196 gcc_assert (TREE_CODE (type
) == REFERENCE_TYPE
);
12197 ve
= TREE_OPERAND (ve
, 0);
12199 SET_DECL_VALUE_EXPR (r
, ve
);
12201 if (CP_DECL_THREAD_LOCAL_P (r
)
12202 && !processing_template_decl
)
12203 set_decl_tls_model (r
, decl_default_tls_model (r
));
12205 else if (DECL_SELF_REFERENCE_P (t
))
12206 SET_DECL_SELF_REFERENCE_P (r
);
12207 TREE_TYPE (r
) = type
;
12208 cp_apply_type_quals_to_decl (cp_type_quals (type
), r
);
12209 DECL_CONTEXT (r
) = ctx
;
12210 /* Clear out the mangled name and RTL for the instantiation. */
12211 SET_DECL_ASSEMBLER_NAME (r
, NULL_TREE
);
12212 if (CODE_CONTAINS_STRUCT (TREE_CODE (t
), TS_DECL_WRTL
))
12213 SET_DECL_RTL (r
, NULL
);
12214 /* The initializer must not be expanded until it is required;
12215 see [temp.inst]. */
12216 DECL_INITIAL (r
) = NULL_TREE
;
12217 if (CODE_CONTAINS_STRUCT (TREE_CODE (t
), TS_DECL_WRTL
))
12218 SET_DECL_RTL (r
, NULL
);
12219 DECL_SIZE (r
) = DECL_SIZE_UNIT (r
) = 0;
12222 /* Possibly limit visibility based on template args. */
12223 DECL_VISIBILITY (r
) = VISIBILITY_DEFAULT
;
12224 if (DECL_VISIBILITY_SPECIFIED (t
))
12226 DECL_VISIBILITY_SPECIFIED (r
) = 0;
12227 DECL_ATTRIBUTES (r
)
12228 = remove_attribute ("visibility", DECL_ATTRIBUTES (r
));
12230 determine_visibility (r
);
12235 /* A static data member declaration is always marked
12236 external when it is declared in-class, even if an
12237 initializer is present. We mimic the non-template
12238 processing here. */
12239 DECL_EXTERNAL (r
) = 1;
12240 if (DECL_NAMESPACE_SCOPE_P (t
))
12241 DECL_NOT_REALLY_EXTERN (r
) = 1;
12243 DECL_TEMPLATE_INFO (r
) = build_template_info (tmpl
, argvec
);
12244 SET_DECL_IMPLICIT_INSTANTIATION (r
);
12245 register_specialization (r
, gen_tmpl
, argvec
, false, hash
);
12247 else if (!cp_unevaluated_operand
)
12248 register_local_specialization (r
, t
);
12250 DECL_CHAIN (r
) = NULL_TREE
;
12252 apply_late_template_attributes (&r
, DECL_ATTRIBUTES (r
),
12254 args
, complain
, in_decl
);
12256 /* Preserve a typedef that names a type. */
12257 if (is_typedef_decl (r
))
12259 DECL_ORIGINAL_TYPE (r
) = NULL_TREE
;
12260 set_underlying_type (r
);
12261 if (TYPE_DECL_ALIAS_P (r
) && type
!= error_mark_node
)
12262 /* An alias template specialization can be dependent
12263 even if its underlying type is not. */
12264 TYPE_DEPENDENT_P_VALID (TREE_TYPE (r
)) = false;
12267 layout_decl (r
, 0);
12272 gcc_unreachable ();
12277 /* Restore the file and line information. */
12278 input_location
= saved_loc
;
12283 /* Substitute into the ARG_TYPES of a function type.
12284 If END is a TREE_CHAIN, leave it and any following types
12288 tsubst_arg_types (tree arg_types
,
12291 tsubst_flags_t complain
,
12294 tree remaining_arg_types
;
12295 tree type
= NULL_TREE
;
12297 tree expanded_args
= NULL_TREE
;
12300 if (!arg_types
|| arg_types
== void_list_node
|| arg_types
== end
)
12303 remaining_arg_types
= tsubst_arg_types (TREE_CHAIN (arg_types
),
12304 args
, end
, complain
, in_decl
);
12305 if (remaining_arg_types
== error_mark_node
)
12306 return error_mark_node
;
12308 if (PACK_EXPANSION_P (TREE_VALUE (arg_types
)))
12310 /* For a pack expansion, perform substitution on the
12311 entire expression. Later on, we'll handle the arguments
12313 expanded_args
= tsubst_pack_expansion (TREE_VALUE (arg_types
),
12314 args
, complain
, in_decl
);
12316 if (TREE_CODE (expanded_args
) == TREE_VEC
)
12317 /* So that we'll spin through the parameters, one by one. */
12318 i
= TREE_VEC_LENGTH (expanded_args
);
12321 /* We only partially substituted into the parameter
12322 pack. Our type is TYPE_PACK_EXPANSION. */
12323 type
= expanded_args
;
12324 expanded_args
= NULL_TREE
;
12332 type
= TREE_VEC_ELT (expanded_args
, i
);
12334 type
= tsubst (TREE_VALUE (arg_types
), args
, complain
, in_decl
);
12336 if (type
== error_mark_node
)
12337 return error_mark_node
;
12338 if (VOID_TYPE_P (type
))
12340 if (complain
& tf_error
)
12342 error ("invalid parameter type %qT", type
);
12344 error ("in declaration %q+D", in_decl
);
12346 return error_mark_node
;
12349 if (abstract_virtuals_error_sfinae (ACU_PARM
, type
, complain
))
12350 return error_mark_node
;
12352 /* Do array-to-pointer, function-to-pointer conversion, and ignore
12353 top-level qualifiers as required. */
12354 type
= cv_unqualified (type_decays_to (type
));
12356 /* We do not substitute into default arguments here. The standard
12357 mandates that they be instantiated only when needed, which is
12358 done in build_over_call. */
12359 default_arg
= TREE_PURPOSE (arg_types
);
12361 if (default_arg
&& TREE_CODE (default_arg
) == DEFAULT_ARG
)
12363 /* We've instantiated a template before its default arguments
12364 have been parsed. This can happen for a nested template
12365 class, and is not an error unless we require the default
12366 argument in a call of this function. */
12367 remaining_arg_types
=
12368 tree_cons (default_arg
, type
, remaining_arg_types
);
12369 vec_safe_push (DEFARG_INSTANTIATIONS(default_arg
), remaining_arg_types
);
12372 remaining_arg_types
=
12373 hash_tree_cons (default_arg
, type
, remaining_arg_types
);
12376 return remaining_arg_types
;
12379 /* Substitute into a FUNCTION_TYPE or METHOD_TYPE. This routine does
12380 *not* handle the exception-specification for FNTYPE, because the
12381 initial substitution of explicitly provided template parameters
12382 during argument deduction forbids substitution into the
12383 exception-specification:
12387 All references in the function type of the function template to the
12388 corresponding template parameters are replaced by the specified tem-
12389 plate argument values. If a substitution in a template parameter or
12390 in the function type of the function template results in an invalid
12391 type, type deduction fails. [Note: The equivalent substitution in
12392 exception specifications is done only when the function is instanti-
12393 ated, at which point a program is ill-formed if the substitution
12394 results in an invalid type.] */
12397 tsubst_function_type (tree t
,
12399 tsubst_flags_t complain
,
12403 tree arg_types
= NULL_TREE
;
12406 /* The TYPE_CONTEXT is not used for function/method types. */
12407 gcc_assert (TYPE_CONTEXT (t
) == NULL_TREE
);
12409 /* DR 1227: Mixing immediate and non-immediate contexts in deduction
12411 bool late_return_type_p
= TYPE_HAS_LATE_RETURN_TYPE (t
);
12413 if (late_return_type_p
)
12415 /* Substitute the argument types. */
12416 arg_types
= tsubst_arg_types (TYPE_ARG_TYPES (t
), args
, NULL_TREE
,
12417 complain
, in_decl
);
12418 if (arg_types
== error_mark_node
)
12419 return error_mark_node
;
12421 tree save_ccp
= current_class_ptr
;
12422 tree save_ccr
= current_class_ref
;
12423 tree this_type
= (TREE_CODE (t
) == METHOD_TYPE
12424 ? TREE_TYPE (TREE_VALUE (arg_types
)) : NULL_TREE
);
12425 bool do_inject
= this_type
&& CLASS_TYPE_P (this_type
);
12428 /* DR 1207: 'this' is in scope in the trailing return type. */
12429 inject_this_parameter (this_type
, cp_type_quals (this_type
));
12432 /* Substitute the return type. */
12433 return_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
12437 current_class_ptr
= save_ccp
;
12438 current_class_ref
= save_ccr
;
12442 /* Substitute the return type. */
12443 return_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
12445 if (return_type
== error_mark_node
)
12446 return error_mark_node
;
12447 /* DR 486 clarifies that creation of a function type with an
12448 invalid return type is a deduction failure. */
12449 if (TREE_CODE (return_type
) == ARRAY_TYPE
12450 || TREE_CODE (return_type
) == FUNCTION_TYPE
)
12452 if (complain
& tf_error
)
12454 if (TREE_CODE (return_type
) == ARRAY_TYPE
)
12455 error ("function returning an array");
12457 error ("function returning a function");
12459 return error_mark_node
;
12462 if (abstract_virtuals_error_sfinae (ACU_RETURN
, return_type
, complain
))
12463 return error_mark_node
;
12465 if (!late_return_type_p
)
12467 /* Substitute the argument types. */
12468 arg_types
= tsubst_arg_types (TYPE_ARG_TYPES (t
), args
, NULL_TREE
,
12469 complain
, in_decl
);
12470 if (arg_types
== error_mark_node
)
12471 return error_mark_node
;
12474 /* Construct a new type node and return it. */
12475 if (TREE_CODE (t
) == FUNCTION_TYPE
)
12477 fntype
= build_function_type (return_type
, arg_types
);
12478 fntype
= apply_memfn_quals (fntype
,
12479 type_memfn_quals (t
),
12480 type_memfn_rqual (t
));
12484 tree r
= TREE_TYPE (TREE_VALUE (arg_types
));
12485 /* Don't pick up extra function qualifiers from the basetype. */
12486 r
= cp_build_qualified_type_real (r
, type_memfn_quals (t
), complain
);
12487 if (! MAYBE_CLASS_TYPE_P (r
))
12491 Type deduction may fail for any of the following
12494 -- Attempting to create "pointer to member of T" when T
12495 is not a class type. */
12496 if (complain
& tf_error
)
12497 error ("creating pointer to member function of non-class type %qT",
12499 return error_mark_node
;
12502 fntype
= build_method_type_directly (r
, return_type
,
12503 TREE_CHAIN (arg_types
));
12504 fntype
= build_ref_qualified_type (fntype
, type_memfn_rqual (t
));
12506 fntype
= cp_build_type_attribute_variant (fntype
, TYPE_ATTRIBUTES (t
));
12508 if (late_return_type_p
)
12509 TYPE_HAS_LATE_RETURN_TYPE (fntype
) = 1;
12514 /* FNTYPE is a FUNCTION_TYPE or METHOD_TYPE. Substitute the template
12515 ARGS into that specification, and return the substituted
12516 specification. If there is no specification, return NULL_TREE. */
12519 tsubst_exception_specification (tree fntype
,
12521 tsubst_flags_t complain
,
12528 specs
= TYPE_RAISES_EXCEPTIONS (fntype
);
12529 new_specs
= NULL_TREE
;
12530 if (specs
&& TREE_PURPOSE (specs
))
12532 /* A noexcept-specifier. */
12533 tree expr
= TREE_PURPOSE (specs
);
12534 if (TREE_CODE (expr
) == INTEGER_CST
)
12538 /* Defer instantiation of noexcept-specifiers to avoid
12539 excessive instantiations (c++/49107). */
12540 new_specs
= make_node (DEFERRED_NOEXCEPT
);
12541 if (DEFERRED_NOEXCEPT_SPEC_P (specs
))
12543 /* We already partially instantiated this member template,
12544 so combine the new args with the old. */
12545 DEFERRED_NOEXCEPT_PATTERN (new_specs
)
12546 = DEFERRED_NOEXCEPT_PATTERN (expr
);
12547 DEFERRED_NOEXCEPT_ARGS (new_specs
)
12548 = add_to_template_args (DEFERRED_NOEXCEPT_ARGS (expr
), args
);
12552 DEFERRED_NOEXCEPT_PATTERN (new_specs
) = expr
;
12553 DEFERRED_NOEXCEPT_ARGS (new_specs
) = args
;
12557 new_specs
= tsubst_copy_and_build
12558 (expr
, args
, complain
, in_decl
, /*function_p=*/false,
12559 /*integral_constant_expression_p=*/true);
12560 new_specs
= build_noexcept_spec (new_specs
, complain
);
12564 if (! TREE_VALUE (specs
))
12571 tree expanded_specs
= NULL_TREE
;
12573 if (PACK_EXPANSION_P (TREE_VALUE (specs
)))
12575 /* Expand the pack expansion type. */
12576 expanded_specs
= tsubst_pack_expansion (TREE_VALUE (specs
),
12580 if (expanded_specs
== error_mark_node
)
12581 return error_mark_node
;
12582 else if (TREE_CODE (expanded_specs
) == TREE_VEC
)
12583 len
= TREE_VEC_LENGTH (expanded_specs
);
12586 /* We're substituting into a member template, so
12587 we got a TYPE_PACK_EXPANSION back. Add that
12588 expansion and move on. */
12589 gcc_assert (TREE_CODE (expanded_specs
)
12590 == TYPE_PACK_EXPANSION
);
12591 new_specs
= add_exception_specifier (new_specs
,
12594 specs
= TREE_CHAIN (specs
);
12599 for (i
= 0; i
< len
; ++i
)
12601 if (expanded_specs
)
12602 spec
= TREE_VEC_ELT (expanded_specs
, i
);
12604 spec
= tsubst (TREE_VALUE (specs
), args
, complain
, in_decl
);
12605 if (spec
== error_mark_node
)
12607 new_specs
= add_exception_specifier (new_specs
, spec
,
12611 specs
= TREE_CHAIN (specs
);
12617 /* Take the tree structure T and replace template parameters used
12618 therein with the argument vector ARGS. IN_DECL is an associated
12619 decl for diagnostics. If an error occurs, returns ERROR_MARK_NODE.
12620 Issue error and warning messages under control of COMPLAIN. Note
12621 that we must be relatively non-tolerant of extensions here, in
12622 order to preserve conformance; if we allow substitutions that
12623 should not be allowed, we may allow argument deductions that should
12624 not succeed, and therefore report ambiguous overload situations
12625 where there are none. In theory, we could allow the substitution,
12626 but indicate that it should have failed, and allow our caller to
12627 make sure that the right thing happens, but we don't try to do this
12630 This function is used for dealing with types, decls and the like;
12631 for expressions, use tsubst_expr or tsubst_copy. */
12634 tsubst (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
12636 enum tree_code code
;
12637 tree type
, r
= NULL_TREE
;
12639 if (t
== NULL_TREE
|| t
== error_mark_node
12640 || t
== integer_type_node
12641 || t
== void_type_node
12642 || t
== char_type_node
12643 || t
== unknown_type_node
12644 || TREE_CODE (t
) == NAMESPACE_DECL
12645 || TREE_CODE (t
) == TRANSLATION_UNIT_DECL
)
12649 return tsubst_decl (t
, args
, complain
);
12651 if (args
== NULL_TREE
)
12654 code
= TREE_CODE (t
);
12656 if (code
== IDENTIFIER_NODE
)
12657 type
= IDENTIFIER_TYPE_VALUE (t
);
12659 type
= TREE_TYPE (t
);
12661 gcc_assert (type
!= unknown_type_node
);
12663 /* Reuse typedefs. We need to do this to handle dependent attributes,
12664 such as attribute aligned. */
12666 && typedef_variant_p (t
))
12668 tree decl
= TYPE_NAME (t
);
12670 if (alias_template_specialization_p (t
))
12672 /* DECL represents an alias template and we want to
12674 tree tmpl
= most_general_template (DECL_TI_TEMPLATE (decl
));
12675 tree gen_args
= tsubst (DECL_TI_ARGS (decl
), args
, complain
, in_decl
);
12676 r
= instantiate_alias_template (tmpl
, gen_args
, complain
);
12678 else if (DECL_CLASS_SCOPE_P (decl
)
12679 && CLASSTYPE_TEMPLATE_INFO (DECL_CONTEXT (decl
))
12680 && uses_template_parms (DECL_CONTEXT (decl
)))
12682 tree tmpl
= most_general_template (DECL_TI_TEMPLATE (decl
));
12683 tree gen_args
= tsubst (DECL_TI_ARGS (decl
), args
, complain
, in_decl
);
12684 r
= retrieve_specialization (tmpl
, gen_args
, 0);
12686 else if (DECL_FUNCTION_SCOPE_P (decl
)
12687 && DECL_TEMPLATE_INFO (DECL_CONTEXT (decl
))
12688 && uses_template_parms (DECL_TI_ARGS (DECL_CONTEXT (decl
))))
12689 r
= retrieve_local_specialization (decl
);
12691 /* The typedef is from a non-template context. */
12697 r
= cp_build_qualified_type_real
12698 (r
, cp_type_quals (t
) | cp_type_quals (r
),
12699 complain
| tf_ignore_bad_quals
);
12704 /* We don't have an instantiation yet, so drop the typedef. */
12705 int quals
= cp_type_quals (t
);
12706 t
= DECL_ORIGINAL_TYPE (decl
);
12707 t
= cp_build_qualified_type_real (t
, quals
,
12708 complain
| tf_ignore_bad_quals
);
12713 && code
!= TYPENAME_TYPE
12714 && code
!= TEMPLATE_TYPE_PARM
12715 && code
!= IDENTIFIER_NODE
12716 && code
!= FUNCTION_TYPE
12717 && code
!= METHOD_TYPE
)
12718 type
= tsubst (type
, args
, complain
, in_decl
);
12719 if (type
== error_mark_node
)
12720 return error_mark_node
;
12726 case ENUMERAL_TYPE
:
12727 return tsubst_aggr_type (t
, args
, complain
, in_decl
,
12728 /*entering_scope=*/0);
12731 case IDENTIFIER_NODE
:
12742 if (t
== integer_type_node
)
12745 if (TREE_CODE (TYPE_MIN_VALUE (t
)) == INTEGER_CST
12746 && TREE_CODE (TYPE_MAX_VALUE (t
)) == INTEGER_CST
)
12750 tree max
, omax
= TREE_OPERAND (TYPE_MAX_VALUE (t
), 0);
12752 max
= tsubst_expr (omax
, args
, complain
, in_decl
,
12753 /*integral_constant_expression_p=*/false);
12755 /* Fix up type of the magic NOP_EXPR with TREE_SIDE_EFFECTS if
12757 if (TREE_CODE (max
) == NOP_EXPR
12758 && TREE_SIDE_EFFECTS (omax
)
12759 && !TREE_TYPE (max
))
12760 TREE_TYPE (max
) = TREE_TYPE (TREE_OPERAND (max
, 0));
12762 /* If we're in a partial instantiation, preserve the magic NOP_EXPR
12763 with TREE_SIDE_EFFECTS that indicates this is not an integral
12764 constant expression. */
12765 if (processing_template_decl
12766 && TREE_SIDE_EFFECTS (omax
) && TREE_CODE (omax
) == NOP_EXPR
)
12768 gcc_assert (TREE_CODE (max
) == NOP_EXPR
);
12769 TREE_SIDE_EFFECTS (max
) = 1;
12772 return compute_array_index_type (NULL_TREE
, max
, complain
);
12775 case TEMPLATE_TYPE_PARM
:
12776 case TEMPLATE_TEMPLATE_PARM
:
12777 case BOUND_TEMPLATE_TEMPLATE_PARM
:
12778 case TEMPLATE_PARM_INDEX
:
12783 tree arg
= NULL_TREE
;
12785 /* Early in template argument deduction substitution, we don't
12786 want to reduce the level of 'auto', or it will be confused
12787 with a normal template parm in subsequent deduction. */
12788 if (is_auto (t
) && (complain
& tf_partial
))
12793 gcc_assert (TREE_VEC_LENGTH (args
) > 0);
12794 template_parm_level_and_index (t
, &level
, &idx
);
12796 levels
= TMPL_ARGS_DEPTH (args
);
12797 if (level
<= levels
12798 && TREE_VEC_LENGTH (TMPL_ARGS_LEVEL (args
, level
)) > 0)
12800 arg
= TMPL_ARG (args
, level
, idx
);
12802 if (arg
&& TREE_CODE (arg
) == ARGUMENT_PACK_SELECT
)
12804 /* See through ARGUMENT_PACK_SELECT arguments. */
12805 arg
= ARGUMENT_PACK_SELECT_ARG (arg
);
12806 /* If the selected argument is an expansion E, that most
12807 likely means we were called from
12808 gen_elem_of_pack_expansion_instantiation during the
12809 substituting of pack an argument pack (which Ith
12810 element is a pack expansion, where I is
12811 ARGUMENT_PACK_SELECT_INDEX) into a pack expansion.
12812 In this case, the Ith element resulting from this
12813 substituting is going to be a pack expansion, which
12814 pattern is the pattern of E. Let's return the
12816 gen_elem_of_pack_expansion_instantiation will
12817 build the resulting pack expansion from it. */
12818 if (PACK_EXPANSION_P (arg
))
12820 /* Make sure we aren't throwing away arg info. */
12821 gcc_assert (!PACK_EXPANSION_EXTRA_ARGS (arg
));
12822 arg
= PACK_EXPANSION_PATTERN (arg
);
12827 if (arg
== error_mark_node
)
12828 return error_mark_node
;
12829 else if (arg
!= NULL_TREE
)
12831 if (ARGUMENT_PACK_P (arg
))
12832 /* If ARG is an argument pack, we don't actually want to
12833 perform a substitution here, because substitutions
12834 for argument packs are only done
12835 element-by-element. We can get to this point when
12836 substituting the type of a non-type template
12837 parameter pack, when that type actually contains
12838 template parameter packs from an outer template, e.g.,
12840 template<typename... Types> struct A {
12841 template<Types... Values> struct B { };
12845 if (code
== TEMPLATE_TYPE_PARM
)
12848 gcc_assert (TYPE_P (arg
));
12850 quals
= cp_type_quals (arg
) | cp_type_quals (t
);
12852 return cp_build_qualified_type_real
12853 (arg
, quals
, complain
| tf_ignore_bad_quals
);
12855 else if (code
== BOUND_TEMPLATE_TEMPLATE_PARM
)
12857 /* We are processing a type constructed from a
12858 template template parameter. */
12859 tree argvec
= tsubst (TYPE_TI_ARGS (t
),
12860 args
, complain
, in_decl
);
12861 if (argvec
== error_mark_node
)
12862 return error_mark_node
;
12864 gcc_assert (TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
12865 || TREE_CODE (arg
) == TEMPLATE_DECL
12866 || TREE_CODE (arg
) == UNBOUND_CLASS_TEMPLATE
);
12868 if (TREE_CODE (arg
) == UNBOUND_CLASS_TEMPLATE
)
12869 /* Consider this code:
12871 template <template <class> class Template>
12873 template <class Arg> using Bind = Template<Arg>;
12876 template <template <class> class Template, class Arg>
12877 using Instantiate = Template<Arg>; //#0
12879 template <template <class> class Template,
12882 Instantiate<Internal<Template>::template Bind,
12885 When #1 is parsed, the
12886 BOUND_TEMPLATE_TEMPLATE_PARM representing the
12887 parameter `Template' in #0 matches the
12888 UNBOUND_CLASS_TEMPLATE representing the argument
12889 `Internal<Template>::template Bind'; We then want
12890 to assemble the type `Bind<Argument>' that can't
12891 be fully created right now, because
12892 `Internal<Template>' not being complete, the Bind
12893 template cannot be looked up in that context. So
12894 we need to "store" `Bind<Argument>' for later
12895 when the context of Bind becomes complete. Let's
12896 store that in a TYPENAME_TYPE. */
12897 return make_typename_type (TYPE_CONTEXT (arg
),
12898 build_nt (TEMPLATE_ID_EXPR
,
12899 TYPE_IDENTIFIER (arg
),
12904 /* We can get a TEMPLATE_TEMPLATE_PARM here when we
12905 are resolving nested-types in the signature of a
12906 member function templates. Otherwise ARG is a
12907 TEMPLATE_DECL and is the real template to be
12909 if (TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
)
12910 arg
= TYPE_NAME (arg
);
12912 r
= lookup_template_class (arg
,
12914 DECL_CONTEXT (arg
),
12915 /*entering_scope=*/0,
12917 return cp_build_qualified_type_real
12918 (r
, cp_type_quals (t
) | cp_type_quals (r
), complain
);
12921 /* TEMPLATE_TEMPLATE_PARM or TEMPLATE_PARM_INDEX. */
12922 return convert_from_reference (unshare_expr (arg
));
12926 /* This can happen during the attempted tsubst'ing in
12927 unify. This means that we don't yet have any information
12928 about the template parameter in question. */
12931 /* If we get here, we must have been looking at a parm for a
12932 more deeply nested template. Make a new version of this
12933 template parameter, but with a lower level. */
12936 case TEMPLATE_TYPE_PARM
:
12937 case TEMPLATE_TEMPLATE_PARM
:
12938 case BOUND_TEMPLATE_TEMPLATE_PARM
:
12939 if (cp_type_quals (t
))
12941 r
= tsubst (TYPE_MAIN_VARIANT (t
), args
, complain
, in_decl
);
12942 r
= cp_build_qualified_type_real
12943 (r
, cp_type_quals (t
),
12944 complain
| (code
== TEMPLATE_TYPE_PARM
12945 ? tf_ignore_bad_quals
: 0));
12947 else if (TREE_CODE (t
) == TEMPLATE_TYPE_PARM
12948 && PLACEHOLDER_TYPE_CONSTRAINTS (t
)
12949 && (r
= (TEMPLATE_PARM_DESCENDANTS
12950 (TEMPLATE_TYPE_PARM_INDEX (t
))))
12951 && (r
= TREE_TYPE (r
))
12952 && !PLACEHOLDER_TYPE_CONSTRAINTS (r
))
12953 /* Break infinite recursion when substituting the constraints
12954 of a constrained placeholder. */;
12958 TEMPLATE_TYPE_PARM_INDEX (r
)
12959 = reduce_template_parm_level (TEMPLATE_TYPE_PARM_INDEX (t
),
12960 r
, levels
, args
, complain
);
12961 TYPE_STUB_DECL (r
) = TYPE_NAME (r
) = TEMPLATE_TYPE_DECL (r
);
12962 TYPE_MAIN_VARIANT (r
) = r
;
12963 TYPE_POINTER_TO (r
) = NULL_TREE
;
12964 TYPE_REFERENCE_TO (r
) = NULL_TREE
;
12966 if (TREE_CODE (r
) == TEMPLATE_TEMPLATE_PARM
)
12967 /* We have reduced the level of the template
12968 template parameter, but not the levels of its
12969 template parameters, so canonical_type_parameter
12970 will not be able to find the canonical template
12971 template parameter for this level. Thus, we
12972 require structural equality checking to compare
12973 TEMPLATE_TEMPLATE_PARMs. */
12974 SET_TYPE_STRUCTURAL_EQUALITY (r
);
12975 else if (TYPE_STRUCTURAL_EQUALITY_P (t
))
12976 SET_TYPE_STRUCTURAL_EQUALITY (r
);
12978 TYPE_CANONICAL (r
) = canonical_type_parameter (r
);
12980 /* Propagate constraints on placeholders. */
12981 if (TREE_CODE (t
) == TEMPLATE_TYPE_PARM
)
12982 if (tree constr
= PLACEHOLDER_TYPE_CONSTRAINTS (t
))
12983 PLACEHOLDER_TYPE_CONSTRAINTS (r
)
12984 = tsubst_constraint (constr
, args
, complain
, in_decl
);
12986 if (code
== BOUND_TEMPLATE_TEMPLATE_PARM
)
12988 tree argvec
= tsubst (TYPE_TI_ARGS (t
), args
,
12989 complain
, in_decl
);
12990 if (argvec
== error_mark_node
)
12991 return error_mark_node
;
12993 TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (r
)
12994 = build_template_info (TYPE_TI_TEMPLATE (t
), argvec
);
12999 case TEMPLATE_PARM_INDEX
:
13000 r
= reduce_template_parm_level (t
, type
, levels
, args
, complain
);
13004 gcc_unreachable ();
13012 tree purpose
, value
, chain
;
13014 if (t
== void_list_node
)
13017 purpose
= TREE_PURPOSE (t
);
13020 purpose
= tsubst (purpose
, args
, complain
, in_decl
);
13021 if (purpose
== error_mark_node
)
13022 return error_mark_node
;
13024 value
= TREE_VALUE (t
);
13027 value
= tsubst (value
, args
, complain
, in_decl
);
13028 if (value
== error_mark_node
)
13029 return error_mark_node
;
13031 chain
= TREE_CHAIN (t
);
13032 if (chain
&& chain
!= void_type_node
)
13034 chain
= tsubst (chain
, args
, complain
, in_decl
);
13035 if (chain
== error_mark_node
)
13036 return error_mark_node
;
13038 if (purpose
== TREE_PURPOSE (t
)
13039 && value
== TREE_VALUE (t
)
13040 && chain
== TREE_CHAIN (t
))
13042 return hash_tree_cons (purpose
, value
, chain
);
13046 /* We should never be tsubsting a binfo. */
13047 gcc_unreachable ();
13050 /* A vector of template arguments. */
13051 gcc_assert (!type
);
13052 return tsubst_template_args (t
, args
, complain
, in_decl
);
13055 case REFERENCE_TYPE
:
13057 if (type
== TREE_TYPE (t
) && TREE_CODE (type
) != METHOD_TYPE
)
13062 Type deduction may fail for any of the following
13065 -- Attempting to create a pointer to reference type.
13066 -- Attempting to create a reference to a reference type or
13067 a reference to void.
13069 Core issue 106 says that creating a reference to a reference
13070 during instantiation is no longer a cause for failure. We
13071 only enforce this check in strict C++98 mode. */
13072 if ((TREE_CODE (type
) == REFERENCE_TYPE
13073 && (((cxx_dialect
== cxx98
) && flag_iso
) || code
!= REFERENCE_TYPE
))
13074 || (code
== REFERENCE_TYPE
&& VOID_TYPE_P (type
)))
13076 static location_t last_loc
;
13078 /* We keep track of the last time we issued this error
13079 message to avoid spewing a ton of messages during a
13080 single bad template instantiation. */
13081 if (complain
& tf_error
13082 && last_loc
!= input_location
)
13084 if (VOID_TYPE_P (type
))
13085 error ("forming reference to void");
13086 else if (code
== POINTER_TYPE
)
13087 error ("forming pointer to reference type %qT", type
);
13089 error ("forming reference to reference type %qT", type
);
13090 last_loc
= input_location
;
13093 return error_mark_node
;
13095 else if (TREE_CODE (type
) == FUNCTION_TYPE
13096 && (type_memfn_quals (type
) != TYPE_UNQUALIFIED
13097 || type_memfn_rqual (type
) != REF_QUAL_NONE
))
13099 if (complain
& tf_error
)
13101 if (code
== POINTER_TYPE
)
13102 error ("forming pointer to qualified function type %qT",
13105 error ("forming reference to qualified function type %qT",
13108 return error_mark_node
;
13110 else if (code
== POINTER_TYPE
)
13112 r
= build_pointer_type (type
);
13113 if (TREE_CODE (type
) == METHOD_TYPE
)
13114 r
= build_ptrmemfunc_type (r
);
13116 else if (TREE_CODE (type
) == REFERENCE_TYPE
)
13117 /* In C++0x, during template argument substitution, when there is an
13118 attempt to create a reference to a reference type, reference
13119 collapsing is applied as described in [14.3.1/4 temp.arg.type]:
13121 "If a template-argument for a template-parameter T names a type
13122 that is a reference to a type A, an attempt to create the type
13123 'lvalue reference to cv T' creates the type 'lvalue reference to
13124 A,' while an attempt to create the type type rvalue reference to
13125 cv T' creates the type T"
13127 r
= cp_build_reference_type
13129 TYPE_REF_IS_RVALUE (t
) && TYPE_REF_IS_RVALUE (type
));
13131 r
= cp_build_reference_type (type
, TYPE_REF_IS_RVALUE (t
));
13132 r
= cp_build_qualified_type_real (r
, cp_type_quals (t
), complain
);
13134 if (r
!= error_mark_node
)
13135 /* Will this ever be needed for TYPE_..._TO values? */
13142 r
= tsubst (TYPE_OFFSET_BASETYPE (t
), args
, complain
, in_decl
);
13143 if (r
== error_mark_node
|| !MAYBE_CLASS_TYPE_P (r
))
13147 Type deduction may fail for any of the following
13150 -- Attempting to create "pointer to member of T" when T
13151 is not a class type. */
13152 if (complain
& tf_error
)
13153 error ("creating pointer to member of non-class type %qT", r
);
13154 return error_mark_node
;
13156 if (TREE_CODE (type
) == REFERENCE_TYPE
)
13158 if (complain
& tf_error
)
13159 error ("creating pointer to member reference type %qT", type
);
13160 return error_mark_node
;
13162 if (VOID_TYPE_P (type
))
13164 if (complain
& tf_error
)
13165 error ("creating pointer to member of type void");
13166 return error_mark_node
;
13168 gcc_assert (TREE_CODE (type
) != METHOD_TYPE
);
13169 if (TREE_CODE (type
) == FUNCTION_TYPE
)
13171 /* The type of the implicit object parameter gets its
13172 cv-qualifiers from the FUNCTION_TYPE. */
13175 = build_memfn_type (type
, r
, type_memfn_quals (type
),
13176 type_memfn_rqual (type
));
13177 memptr
= build_ptrmemfunc_type (build_pointer_type (method_type
));
13178 return cp_build_qualified_type_real (memptr
, cp_type_quals (t
),
13182 return cp_build_qualified_type_real (build_ptrmem_type (r
, type
),
13186 case FUNCTION_TYPE
:
13191 fntype
= tsubst_function_type (t
, args
, complain
, in_decl
);
13192 if (fntype
== error_mark_node
)
13193 return error_mark_node
;
13195 /* Substitute the exception specification. */
13196 specs
= tsubst_exception_specification (t
, args
, complain
,
13197 in_decl
, /*defer_ok*/true);
13198 if (specs
== error_mark_node
)
13199 return error_mark_node
;
13201 fntype
= build_exception_variant (fntype
, specs
);
13206 tree domain
= tsubst (TYPE_DOMAIN (t
), args
, complain
, in_decl
);
13207 if (domain
== error_mark_node
)
13208 return error_mark_node
;
13210 /* As an optimization, we avoid regenerating the array type if
13211 it will obviously be the same as T. */
13212 if (type
== TREE_TYPE (t
) && domain
== TYPE_DOMAIN (t
))
13215 /* These checks should match the ones in create_array_type_for_decl.
13219 The deduction may fail for any of the following reasons:
13221 -- Attempting to create an array with an element type that
13222 is void, a function type, or a reference type, or [DR337]
13223 an abstract class type. */
13224 if (VOID_TYPE_P (type
)
13225 || TREE_CODE (type
) == FUNCTION_TYPE
13226 || (TREE_CODE (type
) == ARRAY_TYPE
13227 && TYPE_DOMAIN (type
) == NULL_TREE
)
13228 || TREE_CODE (type
) == REFERENCE_TYPE
)
13230 if (complain
& tf_error
)
13231 error ("creating array of %qT", type
);
13232 return error_mark_node
;
13235 if (abstract_virtuals_error_sfinae (ACU_ARRAY
, type
, complain
))
13236 return error_mark_node
;
13238 r
= build_cplus_array_type (type
, domain
);
13240 if (TYPE_USER_ALIGN (t
))
13242 TYPE_ALIGN (r
) = TYPE_ALIGN (t
);
13243 TYPE_USER_ALIGN (r
) = 1;
13249 case TYPENAME_TYPE
:
13251 tree ctx
= tsubst_aggr_type (TYPE_CONTEXT (t
), args
, complain
,
13252 in_decl
, /*entering_scope=*/1);
13253 tree f
= tsubst_copy (TYPENAME_TYPE_FULLNAME (t
), args
,
13254 complain
, in_decl
);
13256 if (ctx
== error_mark_node
|| f
== error_mark_node
)
13257 return error_mark_node
;
13259 if (!MAYBE_CLASS_TYPE_P (ctx
))
13261 if (complain
& tf_error
)
13262 error ("%qT is not a class, struct, or union type", ctx
);
13263 return error_mark_node
;
13265 else if (!uses_template_parms (ctx
) && !TYPE_BEING_DEFINED (ctx
))
13267 /* Normally, make_typename_type does not require that the CTX
13268 have complete type in order to allow things like:
13270 template <class T> struct S { typename S<T>::X Y; };
13272 But, such constructs have already been resolved by this
13273 point, so here CTX really should have complete type, unless
13274 it's a partial instantiation. */
13275 ctx
= complete_type (ctx
);
13276 if (!COMPLETE_TYPE_P (ctx
))
13278 if (complain
& tf_error
)
13279 cxx_incomplete_type_error (NULL_TREE
, ctx
);
13280 return error_mark_node
;
13284 f
= make_typename_type (ctx
, f
, typename_type
,
13285 complain
| tf_keep_type_decl
);
13286 if (f
== error_mark_node
)
13288 if (TREE_CODE (f
) == TYPE_DECL
)
13290 complain
|= tf_ignore_bad_quals
;
13294 if (TREE_CODE (f
) != TYPENAME_TYPE
)
13296 if (TYPENAME_IS_ENUM_P (t
) && TREE_CODE (f
) != ENUMERAL_TYPE
)
13298 if (complain
& tf_error
)
13299 error ("%qT resolves to %qT, which is not an enumeration type",
13302 return error_mark_node
;
13304 else if (TYPENAME_IS_CLASS_P (t
) && !CLASS_TYPE_P (f
))
13306 if (complain
& tf_error
)
13307 error ("%qT resolves to %qT, which is is not a class type",
13310 return error_mark_node
;
13314 return cp_build_qualified_type_real
13315 (f
, cp_type_quals (f
) | cp_type_quals (t
), complain
);
13318 case UNBOUND_CLASS_TEMPLATE
:
13320 tree ctx
= tsubst_aggr_type (TYPE_CONTEXT (t
), args
, complain
,
13321 in_decl
, /*entering_scope=*/1);
13322 tree name
= TYPE_IDENTIFIER (t
);
13323 tree parm_list
= DECL_TEMPLATE_PARMS (TYPE_NAME (t
));
13325 if (ctx
== error_mark_node
|| name
== error_mark_node
)
13326 return error_mark_node
;
13329 parm_list
= tsubst_template_parms (parm_list
, args
, complain
);
13330 return make_unbound_class_template (ctx
, name
, parm_list
, complain
);
13337 ++cp_unevaluated_operand
;
13338 ++c_inhibit_evaluation_warnings
;
13340 type
= tsubst_expr (TYPEOF_TYPE_EXPR (t
), args
,
13342 /*integral_constant_expression_p=*/false);
13344 --cp_unevaluated_operand
;
13345 --c_inhibit_evaluation_warnings
;
13347 type
= finish_typeof (type
);
13348 return cp_build_qualified_type_real (type
,
13350 | cp_type_quals (type
),
13354 case DECLTYPE_TYPE
:
13358 ++cp_unevaluated_operand
;
13359 ++c_inhibit_evaluation_warnings
;
13361 type
= tsubst_copy_and_build (DECLTYPE_TYPE_EXPR (t
), args
,
13362 complain
|tf_decltype
, in_decl
,
13363 /*function_p*/false,
13364 /*integral_constant_expression*/false);
13366 --cp_unevaluated_operand
;
13367 --c_inhibit_evaluation_warnings
;
13369 if (DECLTYPE_FOR_LAMBDA_CAPTURE (t
))
13370 type
= lambda_capture_field_type (type
,
13371 DECLTYPE_FOR_INIT_CAPTURE (t
));
13372 else if (DECLTYPE_FOR_LAMBDA_PROXY (t
))
13373 type
= lambda_proxy_type (type
);
13376 bool id
= DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (t
);
13377 if (id
&& TREE_CODE (DECLTYPE_TYPE_EXPR (t
)) == BIT_NOT_EXPR
13379 /* In a template ~id could be either a complement expression
13380 or an unqualified-id naming a destructor; if instantiating
13381 it produces an expression, it's not an id-expression or
13384 type
= finish_decltype_type (type
, id
, complain
);
13386 return cp_build_qualified_type_real (type
,
13388 | cp_type_quals (type
),
13389 complain
| tf_ignore_bad_quals
);
13392 case UNDERLYING_TYPE
:
13394 tree type
= tsubst (UNDERLYING_TYPE_TYPE (t
), args
,
13395 complain
, in_decl
);
13396 return finish_underlying_type (type
);
13399 case TYPE_ARGUMENT_PACK
:
13400 case NONTYPE_ARGUMENT_PACK
:
13402 tree r
= TYPE_P (t
) ? cxx_make_type (code
) : make_node (code
);
13404 tsubst_template_args (ARGUMENT_PACK_ARGS (t
),
13408 SET_ARGUMENT_PACK_ARGS (r
, packed_out
);
13410 /* For template nontype argument packs, also substitute into
13412 if (code
== NONTYPE_ARGUMENT_PACK
)
13413 TREE_TYPE (r
) = tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
13432 /* We should use one of the expression tsubsts for these codes. */
13433 gcc_unreachable ();
13436 sorry ("use of %qs in template", get_tree_code_name (code
));
13437 return error_mark_node
;
13441 /* Like tsubst_expr for a BASELINK. OBJECT_TYPE, if non-NULL, is the
13442 type of the expression on the left-hand side of the "." or "->"
13446 tsubst_baselink (tree baselink
, tree object_type
,
13447 tree args
, tsubst_flags_t complain
, tree in_decl
)
13450 tree qualifying_scope
;
13453 tree template_args
= 0;
13454 bool template_id_p
= false;
13455 bool qualified
= BASELINK_QUALIFIED_P (baselink
);
13457 /* A baselink indicates a function from a base class. Both the
13458 BASELINK_ACCESS_BINFO and the base class referenced may
13459 indicate bases of the template class, rather than the
13460 instantiated class. In addition, lookups that were not
13461 ambiguous before may be ambiguous now. Therefore, we perform
13462 the lookup again. */
13463 qualifying_scope
= BINFO_TYPE (BASELINK_ACCESS_BINFO (baselink
));
13464 qualifying_scope
= tsubst (qualifying_scope
, args
,
13465 complain
, in_decl
);
13466 fns
= BASELINK_FUNCTIONS (baselink
);
13467 optype
= tsubst (BASELINK_OPTYPE (baselink
), args
, complain
, in_decl
);
13468 if (TREE_CODE (fns
) == TEMPLATE_ID_EXPR
)
13470 template_id_p
= true;
13471 template_args
= TREE_OPERAND (fns
, 1);
13472 fns
= TREE_OPERAND (fns
, 0);
13474 template_args
= tsubst_template_args (template_args
, args
,
13475 complain
, in_decl
);
13477 name
= DECL_NAME (get_first_fn (fns
));
13478 if (IDENTIFIER_TYPENAME_P (name
))
13479 name
= mangle_conv_op_name_for_type (optype
);
13480 baselink
= lookup_fnfields (qualifying_scope
, name
, /*protect=*/1);
13482 return error_mark_node
;
13484 /* If lookup found a single function, mark it as used at this
13485 point. (If it lookup found multiple functions the one selected
13486 later by overload resolution will be marked as used at that
13488 if (BASELINK_P (baselink
))
13489 fns
= BASELINK_FUNCTIONS (baselink
);
13490 if (!template_id_p
&& !really_overloaded_fn (fns
)
13491 && !mark_used (OVL_CURRENT (fns
), complain
) && !(complain
& tf_error
))
13492 return error_mark_node
;
13494 /* Add back the template arguments, if present. */
13495 if (BASELINK_P (baselink
) && template_id_p
)
13496 BASELINK_FUNCTIONS (baselink
)
13497 = build_nt (TEMPLATE_ID_EXPR
,
13498 BASELINK_FUNCTIONS (baselink
),
13500 /* Update the conversion operator type. */
13501 BASELINK_OPTYPE (baselink
) = optype
;
13504 object_type
= current_class_type
;
13507 baselink
= adjust_result_of_qualified_name_lookup (baselink
,
13513 /* Like tsubst_expr for a SCOPE_REF, given by QUALIFIED_ID. DONE is
13514 true if the qualified-id will be a postfix-expression in-and-of
13515 itself; false if more of the postfix-expression follows the
13516 QUALIFIED_ID. ADDRESS_P is true if the qualified-id is the operand
13520 tsubst_qualified_id (tree qualified_id
, tree args
,
13521 tsubst_flags_t complain
, tree in_decl
,
13522 bool done
, bool address_p
)
13528 tree template_args
;
13529 location_t loc
= UNKNOWN_LOCATION
;
13531 gcc_assert (TREE_CODE (qualified_id
) == SCOPE_REF
);
13533 /* Figure out what name to look up. */
13534 name
= TREE_OPERAND (qualified_id
, 1);
13535 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
13537 is_template
= true;
13538 loc
= EXPR_LOCATION (name
);
13539 template_args
= TREE_OPERAND (name
, 1);
13541 template_args
= tsubst_template_args (template_args
, args
,
13542 complain
, in_decl
);
13543 name
= TREE_OPERAND (name
, 0);
13547 is_template
= false;
13548 template_args
= NULL_TREE
;
13551 /* Substitute into the qualifying scope. When there are no ARGS, we
13552 are just trying to simplify a non-dependent expression. In that
13553 case the qualifying scope may be dependent, and, in any case,
13554 substituting will not help. */
13555 scope
= TREE_OPERAND (qualified_id
, 0);
13558 scope
= tsubst (scope
, args
, complain
, in_decl
);
13559 expr
= tsubst_copy (name
, args
, complain
, in_decl
);
13564 if (dependent_scope_p (scope
))
13567 expr
= build_min_nt_loc (loc
, TEMPLATE_ID_EXPR
, expr
, template_args
);
13568 return build_qualified_name (NULL_TREE
, scope
, expr
,
13569 QUALIFIED_NAME_IS_TEMPLATE (qualified_id
));
13572 if (!BASELINK_P (name
) && !DECL_P (expr
))
13574 if (TREE_CODE (expr
) == BIT_NOT_EXPR
)
13576 /* A BIT_NOT_EXPR is used to represent a destructor. */
13577 if (!check_dtor_name (scope
, TREE_OPERAND (expr
, 0)))
13579 error ("qualifying type %qT does not match destructor name ~%qT",
13580 scope
, TREE_OPERAND (expr
, 0));
13581 expr
= error_mark_node
;
13584 expr
= lookup_qualified_name (scope
, complete_dtor_identifier
,
13585 /*is_type_p=*/0, false);
13588 expr
= lookup_qualified_name (scope
, expr
, /*is_type_p=*/0, false);
13589 if (TREE_CODE (TREE_CODE (expr
) == TEMPLATE_DECL
13590 ? DECL_TEMPLATE_RESULT (expr
) : expr
) == TYPE_DECL
)
13592 if (complain
& tf_error
)
13594 error ("dependent-name %qE is parsed as a non-type, but "
13595 "instantiation yields a type", qualified_id
);
13596 inform (input_location
, "say %<typename %E%> if a type is meant", qualified_id
);
13598 return error_mark_node
;
13604 check_accessibility_of_qualified_id (expr
, /*object_type=*/NULL_TREE
,
13606 /* Remember that there was a reference to this entity. */
13607 if (!mark_used (expr
, complain
) && !(complain
& tf_error
))
13608 return error_mark_node
;
13611 if (expr
== error_mark_node
|| TREE_CODE (expr
) == TREE_LIST
)
13613 if (complain
& tf_error
)
13614 qualified_name_lookup_error (scope
,
13615 TREE_OPERAND (qualified_id
, 1),
13616 expr
, input_location
);
13617 return error_mark_node
;
13621 expr
= lookup_template_function (expr
, template_args
);
13623 if (expr
== error_mark_node
&& complain
& tf_error
)
13624 qualified_name_lookup_error (scope
, TREE_OPERAND (qualified_id
, 1),
13625 expr
, input_location
);
13626 else if (TYPE_P (scope
))
13628 expr
= (adjust_result_of_qualified_name_lookup
13629 (expr
, scope
, current_nonlambda_class_type ()));
13630 expr
= (finish_qualified_id_expr
13631 (scope
, expr
, done
, address_p
&& PTRMEM_OK_P (qualified_id
),
13632 QUALIFIED_NAME_IS_TEMPLATE (qualified_id
),
13633 /*template_arg_p=*/false, complain
));
13636 /* Expressions do not generally have reference type. */
13637 if (TREE_CODE (expr
) != SCOPE_REF
13638 /* However, if we're about to form a pointer-to-member, we just
13639 want the referenced member referenced. */
13640 && TREE_CODE (expr
) != OFFSET_REF
)
13641 expr
= convert_from_reference (expr
);
13646 /* tsubst the initializer for a VAR_DECL. INIT is the unsubstituted
13647 initializer, DECL is the substituted VAR_DECL. Other arguments are as
13651 tsubst_init (tree init
, tree decl
, tree args
,
13652 tsubst_flags_t complain
, tree in_decl
)
13657 init
= tsubst_expr (init
, args
, complain
, in_decl
, false);
13661 /* If we had an initializer but it
13662 instantiated to nothing,
13663 value-initialize the object. This will
13664 only occur when the initializer was a
13665 pack expansion where the parameter packs
13666 used in that expansion were of length
13668 init
= build_value_init (TREE_TYPE (decl
),
13670 if (TREE_CODE (init
) == AGGR_INIT_EXPR
)
13671 init
= get_target_expr_sfinae (init
, complain
);
13677 /* Like tsubst, but deals with expressions. This function just replaces
13678 template parms; to finish processing the resultant expression, use
13679 tsubst_copy_and_build or tsubst_expr. */
13682 tsubst_copy (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
13684 enum tree_code code
;
13687 if (t
== NULL_TREE
|| t
== error_mark_node
|| args
== NULL_TREE
)
13690 code
= TREE_CODE (t
);
13695 r
= retrieve_local_specialization (t
);
13697 if (r
== NULL_TREE
)
13699 /* We get here for a use of 'this' in an NSDMI. */
13700 if (DECL_NAME (t
) == this_identifier
13701 && current_function_decl
13702 && DECL_CONSTRUCTOR_P (current_function_decl
))
13703 return current_class_ptr
;
13705 /* This can happen for a parameter name used later in a function
13706 declaration (such as in a late-specified return type). Just
13707 make a dummy decl, since it's only used for its type. */
13708 gcc_assert (cp_unevaluated_operand
!= 0);
13709 r
= tsubst_decl (t
, args
, complain
);
13710 /* Give it the template pattern as its context; its true context
13711 hasn't been instantiated yet and this is good enough for
13713 DECL_CONTEXT (r
) = DECL_CONTEXT (t
);
13716 if (TREE_CODE (r
) == ARGUMENT_PACK_SELECT
)
13717 r
= ARGUMENT_PACK_SELECT_ARG (r
);
13718 if (!mark_used (r
, complain
) && !(complain
& tf_error
))
13719 return error_mark_node
;
13727 if (DECL_TEMPLATE_PARM_P (t
))
13728 return tsubst_copy (DECL_INITIAL (t
), args
, complain
, in_decl
);
13729 /* There is no need to substitute into namespace-scope
13731 if (DECL_NAMESPACE_SCOPE_P (t
))
13733 /* If ARGS is NULL, then T is known to be non-dependent. */
13734 if (args
== NULL_TREE
)
13735 return scalar_constant_value (t
);
13737 /* Unfortunately, we cannot just call lookup_name here.
13740 template <int I> int f() {
13742 struct S { void g() { E e = a; } };
13745 When we instantiate f<7>::S::g(), say, lookup_name is not
13746 clever enough to find f<7>::a. */
13748 = tsubst_aggr_type (DECL_CONTEXT (t
), args
, complain
, in_decl
,
13749 /*entering_scope=*/0);
13751 for (v
= TYPE_VALUES (enum_type
);
13753 v
= TREE_CHAIN (v
))
13754 if (TREE_PURPOSE (v
) == DECL_NAME (t
))
13755 return TREE_VALUE (v
);
13757 /* We didn't find the name. That should never happen; if
13758 name-lookup found it during preliminary parsing, we
13759 should find it again here during instantiation. */
13760 gcc_unreachable ();
13765 if (PACK_EXPANSION_P (TREE_TYPE (t
)))
13767 /* Check for a local specialization set up by
13768 tsubst_pack_expansion. */
13769 if (tree r
= retrieve_local_specialization (t
))
13771 if (TREE_CODE (r
) == ARGUMENT_PACK_SELECT
)
13772 r
= ARGUMENT_PACK_SELECT_ARG (r
);
13776 /* When retrieving a capture pack from a generic lambda, remove the
13777 lambda call op's own template argument list from ARGS. Only the
13778 template arguments active for the closure type should be used to
13779 retrieve the pack specialization. */
13780 if (LAMBDA_FUNCTION_P (current_function_decl
)
13781 && (template_class_depth (DECL_CONTEXT (t
))
13782 != TMPL_ARGS_DEPTH (args
)))
13783 args
= strip_innermost_template_args (args
, 1);
13785 /* Otherwise return the full NONTYPE_ARGUMENT_PACK that
13786 tsubst_decl put in the hash table. */
13787 return retrieve_specialization (t
, args
, 0);
13790 if (DECL_CONTEXT (t
))
13794 ctx
= tsubst_aggr_type (DECL_CONTEXT (t
), args
, complain
, in_decl
,
13795 /*entering_scope=*/1);
13796 if (ctx
!= DECL_CONTEXT (t
))
13798 tree r
= lookup_field (ctx
, DECL_NAME (t
), 0, false);
13801 if (complain
& tf_error
)
13802 error ("using invalid field %qD", t
);
13803 return error_mark_node
;
13812 case FUNCTION_DECL
:
13813 if (DECL_LANG_SPECIFIC (t
) && DECL_TEMPLATE_INFO (t
))
13814 r
= tsubst (t
, args
, complain
, in_decl
);
13815 else if (local_variable_p (t
))
13817 r
= retrieve_local_specialization (t
);
13818 if (r
== NULL_TREE
)
13820 /* First try name lookup to find the instantiation. */
13821 r
= lookup_name (DECL_NAME (t
));
13824 /* Make sure that the one we found is the one we want. */
13825 tree ctx
= DECL_CONTEXT (t
);
13826 if (DECL_LANG_SPECIFIC (ctx
) && DECL_TEMPLATE_INFO (ctx
))
13827 ctx
= tsubst (ctx
, args
, complain
, in_decl
);
13828 if (ctx
!= DECL_CONTEXT (r
))
13836 /* This can happen for a variable used in a
13837 late-specified return type of a local lambda, or for a
13838 local static or constant. Building a new VAR_DECL
13839 should be OK in all those cases. */
13840 r
= tsubst_decl (t
, args
, complain
);
13841 if (decl_maybe_constant_var_p (r
))
13843 /* We can't call cp_finish_decl, so handle the
13844 initializer by hand. */
13845 tree init
= tsubst_init (DECL_INITIAL (t
), r
, args
,
13846 complain
, in_decl
);
13847 if (!processing_template_decl
)
13848 init
= maybe_constant_init (init
);
13849 if (processing_template_decl
13850 ? potential_constant_expression (init
)
13851 : reduced_constant_expression_p (init
))
13852 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (r
)
13853 = TREE_CONSTANT (r
) = true;
13854 DECL_INITIAL (r
) = init
;
13856 gcc_assert (cp_unevaluated_operand
|| TREE_STATIC (r
)
13857 || decl_constant_var_p (r
)
13858 || errorcount
|| sorrycount
);
13859 if (!processing_template_decl
)
13861 if (TREE_STATIC (r
))
13862 rest_of_decl_compilation (r
, toplevel_bindings_p (),
13865 r
= process_outer_var_ref (r
, complain
);
13868 /* Remember this for subsequent uses. */
13869 if (local_specializations
)
13870 register_local_specialization (r
, t
);
13875 if (!mark_used (r
, complain
) && !(complain
& tf_error
))
13876 return error_mark_node
;
13879 case NAMESPACE_DECL
:
13883 /* An OVERLOAD will always be a non-dependent overload set; an
13884 overload set from function scope will just be represented with an
13885 IDENTIFIER_NODE, and from class scope with a BASELINK. */
13886 gcc_assert (!uses_template_parms (t
));
13890 return tsubst_baselink (t
, current_nonlambda_class_type (),
13891 args
, complain
, in_decl
);
13893 case TEMPLATE_DECL
:
13894 if (DECL_TEMPLATE_TEMPLATE_PARM_P (t
))
13895 return tsubst (TREE_TYPE (DECL_TEMPLATE_RESULT (t
)),
13896 args
, complain
, in_decl
);
13897 else if (DECL_FUNCTION_TEMPLATE_P (t
) && DECL_MEMBER_TEMPLATE_P (t
))
13898 return tsubst (t
, args
, complain
, in_decl
);
13899 else if (DECL_CLASS_SCOPE_P (t
)
13900 && uses_template_parms (DECL_CONTEXT (t
)))
13902 /* Template template argument like the following example need
13905 template <template <class> class TT> struct C {};
13906 template <class T> struct D {
13907 template <class U> struct E {};
13912 We are processing the template argument `E' in #1 for
13913 the template instantiation #2. Originally, `E' is a
13914 TEMPLATE_DECL with `D<T>' as its DECL_CONTEXT. Now we
13915 have to substitute this with one having context `D<int>'. */
13917 tree context
= tsubst (DECL_CONTEXT (t
), args
, complain
, in_decl
);
13918 return lookup_field (context
, DECL_NAME(t
), 0, false);
13921 /* Ordinary template template argument. */
13925 case REINTERPRET_CAST_EXPR
:
13926 case CONST_CAST_EXPR
:
13927 case STATIC_CAST_EXPR
:
13928 case DYNAMIC_CAST_EXPR
:
13929 case IMPLICIT_CONV_EXPR
:
13933 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
13934 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
13935 return build1 (code
, type
, op0
);
13939 if (PACK_EXPANSION_P (TREE_OPERAND (t
, 0)))
13942 tree expanded
, op
= TREE_OPERAND (t
, 0);
13945 if (SIZEOF_EXPR_TYPE_P (t
))
13946 op
= TREE_TYPE (op
);
13948 ++cp_unevaluated_operand
;
13949 ++c_inhibit_evaluation_warnings
;
13950 /* We only want to compute the number of arguments. */
13951 expanded
= tsubst_pack_expansion (op
, args
, complain
, in_decl
);
13952 --cp_unevaluated_operand
;
13953 --c_inhibit_evaluation_warnings
;
13955 if (TREE_CODE (expanded
) == TREE_VEC
)
13956 len
= TREE_VEC_LENGTH (expanded
);
13958 if (expanded
== error_mark_node
)
13959 return error_mark_node
;
13960 else if (PACK_EXPANSION_P (expanded
)
13961 || (TREE_CODE (expanded
) == TREE_VEC
13963 && PACK_EXPANSION_P (TREE_VEC_ELT (expanded
, len
-1))))
13965 if (TREE_CODE (expanded
) == TREE_VEC
)
13966 expanded
= TREE_VEC_ELT (expanded
, len
- 1);
13968 if (TYPE_P (expanded
))
13969 return cxx_sizeof_or_alignof_type (expanded
, SIZEOF_EXPR
,
13970 complain
& tf_error
);
13972 return cxx_sizeof_or_alignof_expr (expanded
, SIZEOF_EXPR
,
13973 complain
& tf_error
);
13976 return build_int_cst (size_type_node
, len
);
13978 if (SIZEOF_EXPR_TYPE_P (t
))
13980 r
= tsubst (TREE_TYPE (TREE_OPERAND (t
, 0)),
13981 args
, complain
, in_decl
);
13982 r
= build1 (NOP_EXPR
, r
, error_mark_node
);
13983 r
= build1 (SIZEOF_EXPR
,
13984 tsubst (TREE_TYPE (t
), args
, complain
, in_decl
), r
);
13985 SIZEOF_EXPR_TYPE_P (r
) = 1;
13992 case TRUTH_NOT_EXPR
:
13995 case UNARY_PLUS_EXPR
: /* Unary + */
13997 case AT_ENCODE_EXPR
:
14001 case REALPART_EXPR
:
14002 case IMAGPART_EXPR
:
14005 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
14006 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
14007 return build1 (code
, type
, op0
);
14010 case COMPONENT_REF
:
14015 object
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
14016 name
= TREE_OPERAND (t
, 1);
14017 if (TREE_CODE (name
) == BIT_NOT_EXPR
)
14019 name
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
14020 complain
, in_decl
);
14021 name
= build1 (BIT_NOT_EXPR
, NULL_TREE
, name
);
14023 else if (TREE_CODE (name
) == SCOPE_REF
14024 && TREE_CODE (TREE_OPERAND (name
, 1)) == BIT_NOT_EXPR
)
14026 tree base
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
14027 complain
, in_decl
);
14028 name
= TREE_OPERAND (name
, 1);
14029 name
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
14030 complain
, in_decl
);
14031 name
= build1 (BIT_NOT_EXPR
, NULL_TREE
, name
);
14032 name
= build_qualified_name (/*type=*/NULL_TREE
,
14034 /*template_p=*/false);
14036 else if (BASELINK_P (name
))
14037 name
= tsubst_baselink (name
,
14038 non_reference (TREE_TYPE (object
)),
14042 name
= tsubst_copy (name
, args
, complain
, in_decl
);
14043 return build_nt (COMPONENT_REF
, object
, name
, NULL_TREE
);
14049 case TRUNC_DIV_EXPR
:
14050 case CEIL_DIV_EXPR
:
14051 case FLOOR_DIV_EXPR
:
14052 case ROUND_DIV_EXPR
:
14053 case EXACT_DIV_EXPR
:
14057 case TRUNC_MOD_EXPR
:
14058 case FLOOR_MOD_EXPR
:
14059 case TRUTH_ANDIF_EXPR
:
14060 case TRUTH_ORIF_EXPR
:
14061 case TRUTH_AND_EXPR
:
14062 case TRUTH_OR_EXPR
:
14075 case COMPOUND_EXPR
:
14078 case PREDECREMENT_EXPR
:
14079 case PREINCREMENT_EXPR
:
14080 case POSTDECREMENT_EXPR
:
14081 case POSTINCREMENT_EXPR
:
14083 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
14084 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
14085 return build_nt (code
, op0
, op1
);
14090 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
14091 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
14092 return build_qualified_name (/*type=*/NULL_TREE
, op0
, op1
,
14093 QUALIFIED_NAME_IS_TEMPLATE (t
));
14098 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
14099 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
14100 return build_nt (ARRAY_REF
, op0
, op1
, NULL_TREE
, NULL_TREE
);
14105 int n
= VL_EXP_OPERAND_LENGTH (t
);
14106 tree result
= build_vl_exp (CALL_EXPR
, n
);
14108 for (i
= 0; i
< n
; i
++)
14109 TREE_OPERAND (t
, i
) = tsubst_copy (TREE_OPERAND (t
, i
), args
,
14110 complain
, in_decl
);
14116 case PSEUDO_DTOR_EXPR
:
14117 case VEC_PERM_EXPR
:
14119 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
14120 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
14121 tree op2
= tsubst_copy (TREE_OPERAND (t
, 2), args
, complain
, in_decl
);
14122 r
= build_nt (code
, op0
, op1
, op2
);
14123 TREE_NO_WARNING (r
) = TREE_NO_WARNING (t
);
14129 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
14130 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
14131 tree op2
= tsubst_copy (TREE_OPERAND (t
, 2), args
, complain
, in_decl
);
14132 r
= build_nt (code
, op0
, op1
, op2
);
14133 NEW_EXPR_USE_GLOBAL (r
) = NEW_EXPR_USE_GLOBAL (t
);
14139 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
14140 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
14141 r
= build_nt (code
, op0
, op1
);
14142 DELETE_EXPR_USE_GLOBAL (r
) = DELETE_EXPR_USE_GLOBAL (t
);
14143 DELETE_EXPR_USE_VEC (r
) = DELETE_EXPR_USE_VEC (t
);
14147 case TEMPLATE_ID_EXPR
:
14149 /* Substituted template arguments */
14150 tree fn
= TREE_OPERAND (t
, 0);
14151 tree targs
= TREE_OPERAND (t
, 1);
14153 fn
= tsubst_copy (fn
, args
, complain
, in_decl
);
14155 targs
= tsubst_template_args (targs
, args
, complain
, in_decl
);
14157 return lookup_template_function (fn
, targs
);
14162 tree purpose
, value
, chain
;
14164 if (t
== void_list_node
)
14167 purpose
= TREE_PURPOSE (t
);
14169 purpose
= tsubst_copy (purpose
, args
, complain
, in_decl
);
14170 value
= TREE_VALUE (t
);
14172 value
= tsubst_copy (value
, args
, complain
, in_decl
);
14173 chain
= TREE_CHAIN (t
);
14174 if (chain
&& chain
!= void_type_node
)
14175 chain
= tsubst_copy (chain
, args
, complain
, in_decl
);
14176 if (purpose
== TREE_PURPOSE (t
)
14177 && value
== TREE_VALUE (t
)
14178 && chain
== TREE_CHAIN (t
))
14180 return tree_cons (purpose
, value
, chain
);
14185 case ENUMERAL_TYPE
:
14187 case TEMPLATE_TYPE_PARM
:
14188 case TEMPLATE_TEMPLATE_PARM
:
14189 case BOUND_TEMPLATE_TEMPLATE_PARM
:
14190 case TEMPLATE_PARM_INDEX
:
14192 case REFERENCE_TYPE
:
14194 case FUNCTION_TYPE
:
14197 case TYPENAME_TYPE
:
14198 case UNBOUND_CLASS_TEMPLATE
:
14200 case DECLTYPE_TYPE
:
14202 return tsubst (t
, args
, complain
, in_decl
);
14206 /* Fall through. */
14207 case IDENTIFIER_NODE
:
14208 if (IDENTIFIER_TYPENAME_P (t
))
14210 tree new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
14211 return mangle_conv_op_name_for_type (new_type
);
14217 /* This is handled by tsubst_copy_and_build. */
14218 gcc_unreachable ();
14222 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
14223 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
14224 return build_x_va_arg (EXPR_LOCATION (t
), op0
, type
);
14227 case CLEANUP_POINT_EXPR
:
14228 /* We shouldn't have built any of these during initial template
14229 generation. Instead, they should be built during instantiation
14230 in response to the saved STMT_IS_FULL_EXPR_P setting. */
14231 gcc_unreachable ();
14235 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
14236 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
14237 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
14238 r
= build2 (code
, type
, op0
, op1
);
14239 PTRMEM_OK_P (r
) = PTRMEM_OK_P (t
);
14240 if (!mark_used (TREE_OPERAND (r
, 1), complain
)
14241 && !(complain
& tf_error
))
14242 return error_mark_node
;
14246 case EXPR_PACK_EXPANSION
:
14247 error ("invalid use of pack expansion expression");
14248 return error_mark_node
;
14250 case NONTYPE_ARGUMENT_PACK
:
14251 error ("use %<...%> to expand argument pack");
14252 return error_mark_node
;
14255 gcc_checking_assert (t
== void_node
&& VOID_TYPE_P (TREE_TYPE (t
)));
14263 /* Instantiate any typedefs in the type. */
14264 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
14265 r
= fold_convert (type
, t
);
14266 gcc_assert (TREE_CODE (r
) == code
);
14271 /* These can sometimes show up in a partial instantiation, but never
14272 involve template parms. */
14273 gcc_assert (!uses_template_parms (t
));
14276 case UNARY_LEFT_FOLD_EXPR
:
14277 return tsubst_unary_left_fold (t
, args
, complain
, in_decl
);
14278 case UNARY_RIGHT_FOLD_EXPR
:
14279 return tsubst_unary_right_fold (t
, args
, complain
, in_decl
);
14280 case BINARY_LEFT_FOLD_EXPR
:
14281 return tsubst_binary_left_fold (t
, args
, complain
, in_decl
);
14282 case BINARY_RIGHT_FOLD_EXPR
:
14283 return tsubst_binary_right_fold (t
, args
, complain
, in_decl
);
14286 /* We shouldn't get here, but keep going if !ENABLE_CHECKING. */
14287 gcc_checking_assert (false);
14292 /* Helper function for tsubst_omp_clauses, used for instantiation of
14293 OMP_CLAUSE_DECL of clauses. */
14296 tsubst_omp_clause_decl (tree decl
, tree args
, tsubst_flags_t complain
,
14299 if (decl
== NULL_TREE
)
14302 /* Handle an OpenMP array section represented as a TREE_LIST (or
14303 OMP_CLAUSE_DEPEND_KIND). An OMP_CLAUSE_DEPEND (with a depend
14304 kind of OMP_CLAUSE_DEPEND_SINK) can also be represented as a
14305 TREE_LIST. We can handle it exactly the same as an array section
14306 (purpose, value, and a chain), even though the nomenclature
14307 (low_bound, length, etc) is different. */
14308 if (TREE_CODE (decl
) == TREE_LIST
)
14311 = tsubst_expr (TREE_PURPOSE (decl
), args
, complain
, in_decl
,
14312 /*integral_constant_expression_p=*/false);
14313 tree length
= tsubst_expr (TREE_VALUE (decl
), args
, complain
, in_decl
,
14314 /*integral_constant_expression_p=*/false);
14315 tree chain
= tsubst_omp_clause_decl (TREE_CHAIN (decl
), args
, complain
,
14317 if (TREE_PURPOSE (decl
) == low_bound
14318 && TREE_VALUE (decl
) == length
14319 && TREE_CHAIN (decl
) == chain
)
14321 tree ret
= tree_cons (low_bound
, length
, chain
);
14322 OMP_CLAUSE_DEPEND_SINK_NEGATIVE (ret
)
14323 = OMP_CLAUSE_DEPEND_SINK_NEGATIVE (decl
);
14326 tree ret
= tsubst_expr (decl
, args
, complain
, in_decl
,
14327 /*integral_constant_expression_p=*/false);
14328 /* Undo convert_from_reference tsubst_expr could have called. */
14330 && REFERENCE_REF_P (ret
)
14331 && !REFERENCE_REF_P (decl
))
14332 ret
= TREE_OPERAND (ret
, 0);
14336 /* Like tsubst_copy, but specifically for OpenMP clauses. */
14339 tsubst_omp_clauses (tree clauses
, bool declare_simd
, bool allow_fields
,
14340 tree args
, tsubst_flags_t complain
, tree in_decl
)
14342 tree new_clauses
= NULL_TREE
, nc
, oc
;
14343 tree linear_no_step
= NULL_TREE
;
14345 for (oc
= clauses
; oc
; oc
= OMP_CLAUSE_CHAIN (oc
))
14347 nc
= copy_node (oc
);
14348 OMP_CLAUSE_CHAIN (nc
) = new_clauses
;
14351 switch (OMP_CLAUSE_CODE (nc
))
14353 case OMP_CLAUSE_LASTPRIVATE
:
14354 if (OMP_CLAUSE_LASTPRIVATE_STMT (oc
))
14356 OMP_CLAUSE_LASTPRIVATE_STMT (nc
) = push_stmt_list ();
14357 tsubst_expr (OMP_CLAUSE_LASTPRIVATE_STMT (oc
), args
, complain
,
14358 in_decl
, /*integral_constant_expression_p=*/false);
14359 OMP_CLAUSE_LASTPRIVATE_STMT (nc
)
14360 = pop_stmt_list (OMP_CLAUSE_LASTPRIVATE_STMT (nc
));
14363 case OMP_CLAUSE_PRIVATE
:
14364 case OMP_CLAUSE_SHARED
:
14365 case OMP_CLAUSE_FIRSTPRIVATE
:
14366 case OMP_CLAUSE_COPYIN
:
14367 case OMP_CLAUSE_COPYPRIVATE
:
14368 case OMP_CLAUSE_UNIFORM
:
14369 case OMP_CLAUSE_DEPEND
:
14370 case OMP_CLAUSE_FROM
:
14371 case OMP_CLAUSE_TO
:
14372 case OMP_CLAUSE_MAP
:
14373 case OMP_CLAUSE_USE_DEVICE_PTR
:
14374 case OMP_CLAUSE_IS_DEVICE_PTR
:
14375 OMP_CLAUSE_DECL (nc
)
14376 = tsubst_omp_clause_decl (OMP_CLAUSE_DECL (oc
), args
, complain
,
14379 case OMP_CLAUSE_IF
:
14380 case OMP_CLAUSE_NUM_THREADS
:
14381 case OMP_CLAUSE_SCHEDULE
:
14382 case OMP_CLAUSE_COLLAPSE
:
14383 case OMP_CLAUSE_FINAL
:
14384 case OMP_CLAUSE_DEVICE
:
14385 case OMP_CLAUSE_DIST_SCHEDULE
:
14386 case OMP_CLAUSE_NUM_TEAMS
:
14387 case OMP_CLAUSE_THREAD_LIMIT
:
14388 case OMP_CLAUSE_SAFELEN
:
14389 case OMP_CLAUSE_SIMDLEN
:
14390 case OMP_CLAUSE_NUM_TASKS
:
14391 case OMP_CLAUSE_GRAINSIZE
:
14392 case OMP_CLAUSE_PRIORITY
:
14393 case OMP_CLAUSE_ORDERED
:
14394 case OMP_CLAUSE_HINT
:
14395 OMP_CLAUSE_OPERAND (nc
, 0)
14396 = tsubst_expr (OMP_CLAUSE_OPERAND (oc
, 0), args
, complain
,
14397 in_decl
, /*integral_constant_expression_p=*/false);
14399 case OMP_CLAUSE_REDUCTION
:
14400 if (OMP_CLAUSE_REDUCTION_PLACEHOLDER (oc
))
14402 tree placeholder
= OMP_CLAUSE_REDUCTION_PLACEHOLDER (oc
);
14403 if (TREE_CODE (placeholder
) == SCOPE_REF
)
14405 tree scope
= tsubst (TREE_OPERAND (placeholder
, 0), args
,
14406 complain
, in_decl
);
14407 OMP_CLAUSE_REDUCTION_PLACEHOLDER (nc
)
14408 = build_qualified_name (NULL_TREE
, scope
,
14409 TREE_OPERAND (placeholder
, 1),
14413 gcc_assert (identifier_p (placeholder
));
14415 OMP_CLAUSE_DECL (nc
)
14416 = tsubst_omp_clause_decl (OMP_CLAUSE_DECL (oc
), args
, complain
,
14419 case OMP_CLAUSE_LINEAR
:
14420 case OMP_CLAUSE_ALIGNED
:
14421 OMP_CLAUSE_DECL (nc
)
14422 = tsubst_omp_clause_decl (OMP_CLAUSE_DECL (oc
), args
, complain
,
14424 OMP_CLAUSE_OPERAND (nc
, 1)
14425 = tsubst_expr (OMP_CLAUSE_OPERAND (oc
, 1), args
, complain
,
14426 in_decl
, /*integral_constant_expression_p=*/false);
14427 if (OMP_CLAUSE_CODE (oc
) == OMP_CLAUSE_LINEAR
14428 && OMP_CLAUSE_LINEAR_STEP (oc
) == NULL_TREE
)
14430 gcc_assert (!linear_no_step
);
14431 linear_no_step
= nc
;
14434 case OMP_CLAUSE_NOWAIT
:
14435 case OMP_CLAUSE_DEFAULT
:
14436 case OMP_CLAUSE_UNTIED
:
14437 case OMP_CLAUSE_MERGEABLE
:
14438 case OMP_CLAUSE_INBRANCH
:
14439 case OMP_CLAUSE_NOTINBRANCH
:
14440 case OMP_CLAUSE_PROC_BIND
:
14441 case OMP_CLAUSE_FOR
:
14442 case OMP_CLAUSE_PARALLEL
:
14443 case OMP_CLAUSE_SECTIONS
:
14444 case OMP_CLAUSE_TASKGROUP
:
14445 case OMP_CLAUSE_NOGROUP
:
14446 case OMP_CLAUSE_THREADS
:
14447 case OMP_CLAUSE_SIMD
:
14448 case OMP_CLAUSE_DEFAULTMAP
:
14451 gcc_unreachable ();
14454 switch (OMP_CLAUSE_CODE (nc
))
14456 case OMP_CLAUSE_PRIVATE
:
14457 case OMP_CLAUSE_FIRSTPRIVATE
:
14458 case OMP_CLAUSE_LASTPRIVATE
:
14459 case OMP_CLAUSE_COPYPRIVATE
:
14460 case OMP_CLAUSE_LINEAR
:
14461 case OMP_CLAUSE_REDUCTION
:
14462 case OMP_CLAUSE_USE_DEVICE_PTR
:
14463 case OMP_CLAUSE_IS_DEVICE_PTR
:
14464 /* tsubst_expr on SCOPE_REF results in returning
14465 finish_non_static_data_member result. Undo that here. */
14466 if (TREE_CODE (OMP_CLAUSE_DECL (oc
)) == SCOPE_REF
14467 && (TREE_CODE (TREE_OPERAND (OMP_CLAUSE_DECL (oc
), 1))
14468 == IDENTIFIER_NODE
))
14470 tree t
= OMP_CLAUSE_DECL (nc
);
14473 switch (TREE_CODE (v
))
14475 case COMPONENT_REF
:
14479 case POINTER_PLUS_EXPR
:
14480 v
= TREE_OPERAND (v
, 0);
14483 if (DECL_CONTEXT (v
) == current_function_decl
14484 && DECL_ARTIFICIAL (v
)
14485 && DECL_NAME (v
) == this_identifier
)
14486 OMP_CLAUSE_DECL (nc
) = TREE_OPERAND (t
, 1);
14493 else if (VAR_P (OMP_CLAUSE_DECL (oc
))
14494 && DECL_HAS_VALUE_EXPR_P (OMP_CLAUSE_DECL (oc
))
14495 && DECL_ARTIFICIAL (OMP_CLAUSE_DECL (oc
))
14496 && DECL_LANG_SPECIFIC (OMP_CLAUSE_DECL (oc
))
14497 && DECL_OMP_PRIVATIZED_MEMBER (OMP_CLAUSE_DECL (oc
)))
14499 tree decl
= OMP_CLAUSE_DECL (nc
);
14502 if (!DECL_LANG_SPECIFIC (decl
))
14503 retrofit_lang_decl (decl
);
14504 DECL_OMP_PRIVATIZED_MEMBER (decl
) = 1;
14513 new_clauses
= nreverse (new_clauses
);
14516 new_clauses
= finish_omp_clauses (new_clauses
, allow_fields
);
14517 if (linear_no_step
)
14518 for (nc
= new_clauses
; nc
; nc
= OMP_CLAUSE_CHAIN (nc
))
14519 if (nc
== linear_no_step
)
14521 OMP_CLAUSE_LINEAR_STEP (nc
) = NULL_TREE
;
14525 return new_clauses
;
14528 /* Like tsubst_copy_and_build, but unshare TREE_LIST nodes. */
14531 tsubst_copy_asm_operands (tree t
, tree args
, tsubst_flags_t complain
,
14534 #define RECUR(t) tsubst_copy_asm_operands (t, args, complain, in_decl)
14536 tree purpose
, value
, chain
;
14541 if (TREE_CODE (t
) != TREE_LIST
)
14542 return tsubst_copy_and_build (t
, args
, complain
, in_decl
,
14543 /*function_p=*/false,
14544 /*integral_constant_expression_p=*/false);
14546 if (t
== void_list_node
)
14549 purpose
= TREE_PURPOSE (t
);
14551 purpose
= RECUR (purpose
);
14552 value
= TREE_VALUE (t
);
14555 if (TREE_CODE (value
) != LABEL_DECL
)
14556 value
= RECUR (value
);
14559 value
= lookup_label (DECL_NAME (value
));
14560 gcc_assert (TREE_CODE (value
) == LABEL_DECL
);
14561 TREE_USED (value
) = 1;
14564 chain
= TREE_CHAIN (t
);
14565 if (chain
&& chain
!= void_type_node
)
14566 chain
= RECUR (chain
);
14567 return tree_cons (purpose
, value
, chain
);
14571 /* Used to temporarily communicate the list of #pragma omp parallel
14572 clauses to #pragma omp for instantiation if they are combined
14575 static tree
*omp_parallel_combined_clauses
;
14577 /* Substitute one OMP_FOR iterator. */
14580 tsubst_omp_for_iterator (tree t
, int i
, tree declv
, tree orig_declv
,
14581 tree initv
, tree condv
, tree incrv
, tree
*clauses
,
14582 tree args
, tsubst_flags_t complain
, tree in_decl
,
14583 bool integral_constant_expression_p
)
14585 #define RECUR(NODE) \
14586 tsubst_expr ((NODE), args, complain, in_decl, \
14587 integral_constant_expression_p)
14588 tree decl
, init
, cond
, incr
;
14590 init
= TREE_VEC_ELT (OMP_FOR_INIT (t
), i
);
14591 gcc_assert (TREE_CODE (init
) == MODIFY_EXPR
);
14593 if (orig_declv
&& OMP_FOR_ORIG_DECLS (t
))
14595 tree o
= TREE_VEC_ELT (OMP_FOR_ORIG_DECLS (t
), i
);
14596 TREE_VEC_ELT (orig_declv
, i
) = RECUR (o
);
14599 decl
= TREE_OPERAND (init
, 0);
14600 init
= TREE_OPERAND (init
, 1);
14601 tree decl_expr
= NULL_TREE
;
14602 if (init
&& TREE_CODE (init
) == DECL_EXPR
)
14604 /* We need to jump through some hoops to handle declarations in the
14605 for-init-statement, since we might need to handle auto deduction,
14606 but we need to keep control of initialization. */
14608 init
= DECL_INITIAL (DECL_EXPR_DECL (init
));
14609 decl
= tsubst_decl (decl
, args
, complain
);
14613 if (TREE_CODE (decl
) == SCOPE_REF
)
14615 decl
= RECUR (decl
);
14616 if (TREE_CODE (decl
) == COMPONENT_REF
)
14620 switch (TREE_CODE (v
))
14622 case COMPONENT_REF
:
14626 case POINTER_PLUS_EXPR
:
14627 v
= TREE_OPERAND (v
, 0);
14630 if (DECL_CONTEXT (v
) == current_function_decl
14631 && DECL_ARTIFICIAL (v
)
14632 && DECL_NAME (v
) == this_identifier
)
14634 decl
= TREE_OPERAND (decl
, 1);
14635 decl
= omp_privatize_field (decl
);
14645 decl
= RECUR (decl
);
14647 init
= RECUR (init
);
14649 tree auto_node
= type_uses_auto (TREE_TYPE (decl
));
14650 if (auto_node
&& init
)
14652 = do_auto_deduction (TREE_TYPE (decl
), init
, auto_node
);
14654 gcc_assert (!type_dependent_expression_p (decl
));
14656 if (!CLASS_TYPE_P (TREE_TYPE (decl
)))
14660 /* Declare the variable, but don't let that initialize it. */
14661 tree init_sav
= DECL_INITIAL (DECL_EXPR_DECL (decl_expr
));
14662 DECL_INITIAL (DECL_EXPR_DECL (decl_expr
)) = NULL_TREE
;
14664 DECL_INITIAL (DECL_EXPR_DECL (decl_expr
)) = init_sav
;
14667 cond
= RECUR (TREE_VEC_ELT (OMP_FOR_COND (t
), i
));
14668 incr
= TREE_VEC_ELT (OMP_FOR_INCR (t
), i
);
14669 if (TREE_CODE (incr
) == MODIFY_EXPR
)
14671 tree lhs
= RECUR (TREE_OPERAND (incr
, 0));
14672 tree rhs
= RECUR (TREE_OPERAND (incr
, 1));
14673 incr
= build_x_modify_expr (EXPR_LOCATION (incr
), lhs
,
14674 NOP_EXPR
, rhs
, complain
);
14677 incr
= RECUR (incr
);
14678 TREE_VEC_ELT (declv
, i
) = decl
;
14679 TREE_VEC_ELT (initv
, i
) = init
;
14680 TREE_VEC_ELT (condv
, i
) = cond
;
14681 TREE_VEC_ELT (incrv
, i
) = incr
;
14687 /* Declare and initialize the variable. */
14695 for (j
= (omp_parallel_combined_clauses
== NULL
? 1 : 0); j
< 2; j
++)
14697 for (pc
= j
? clauses
: omp_parallel_combined_clauses
; *pc
; )
14699 if (OMP_CLAUSE_CODE (*pc
) == OMP_CLAUSE_PRIVATE
14700 && OMP_CLAUSE_DECL (*pc
) == decl
)
14702 else if (OMP_CLAUSE_CODE (*pc
) == OMP_CLAUSE_LASTPRIVATE
14703 && OMP_CLAUSE_DECL (*pc
) == decl
)
14707 /* Move lastprivate (decl) clause to OMP_FOR_CLAUSES. */
14709 *pc
= OMP_CLAUSE_CHAIN (c
);
14710 OMP_CLAUSE_CHAIN (c
) = *clauses
;
14713 else if (OMP_CLAUSE_CODE (*pc
) == OMP_CLAUSE_FIRSTPRIVATE
14714 && OMP_CLAUSE_DECL (*pc
) == decl
)
14716 error ("iteration variable %qD should not be firstprivate",
14718 *pc
= OMP_CLAUSE_CHAIN (*pc
);
14720 else if (OMP_CLAUSE_CODE (*pc
) == OMP_CLAUSE_REDUCTION
14721 && OMP_CLAUSE_DECL (*pc
) == decl
)
14723 error ("iteration variable %qD should not be reduction",
14725 *pc
= OMP_CLAUSE_CHAIN (*pc
);
14728 pc
= &OMP_CLAUSE_CHAIN (*pc
);
14733 if (*pc
== NULL_TREE
)
14735 tree c
= build_omp_clause (input_location
, OMP_CLAUSE_PRIVATE
);
14736 OMP_CLAUSE_DECL (c
) = decl
;
14737 c
= finish_omp_clauses (c
, true);
14740 OMP_CLAUSE_CHAIN (c
) = *clauses
;
14745 cond
= TREE_VEC_ELT (OMP_FOR_COND (t
), i
);
14746 if (COMPARISON_CLASS_P (cond
))
14748 tree op0
= RECUR (TREE_OPERAND (cond
, 0));
14749 tree op1
= RECUR (TREE_OPERAND (cond
, 1));
14750 cond
= build2 (TREE_CODE (cond
), boolean_type_node
, op0
, op1
);
14753 cond
= RECUR (cond
);
14754 incr
= TREE_VEC_ELT (OMP_FOR_INCR (t
), i
);
14755 switch (TREE_CODE (incr
))
14757 case PREINCREMENT_EXPR
:
14758 case PREDECREMENT_EXPR
:
14759 case POSTINCREMENT_EXPR
:
14760 case POSTDECREMENT_EXPR
:
14761 incr
= build2 (TREE_CODE (incr
), TREE_TYPE (decl
),
14762 RECUR (TREE_OPERAND (incr
, 0)), NULL_TREE
);
14765 if (TREE_CODE (TREE_OPERAND (incr
, 1)) == PLUS_EXPR
14766 || TREE_CODE (TREE_OPERAND (incr
, 1)) == MINUS_EXPR
)
14768 tree rhs
= TREE_OPERAND (incr
, 1);
14769 tree lhs
= RECUR (TREE_OPERAND (incr
, 0));
14770 tree rhs0
= RECUR (TREE_OPERAND (rhs
, 0));
14771 tree rhs1
= RECUR (TREE_OPERAND (rhs
, 1));
14772 incr
= build2 (MODIFY_EXPR
, TREE_TYPE (decl
), lhs
,
14773 build2 (TREE_CODE (rhs
), TREE_TYPE (decl
),
14777 incr
= RECUR (incr
);
14780 if (TREE_CODE (TREE_OPERAND (incr
, 1)) == PLUS_EXPR
14781 || TREE_CODE (TREE_OPERAND (incr
, 1)) == MINUS_EXPR
)
14783 tree lhs
= RECUR (TREE_OPERAND (incr
, 0));
14784 incr
= build2 (MODIFY_EXPR
, TREE_TYPE (decl
), lhs
,
14785 build2 (TREE_CODE (TREE_OPERAND (incr
, 1)),
14786 TREE_TYPE (decl
), lhs
,
14787 RECUR (TREE_OPERAND (incr
, 2))));
14789 else if (TREE_CODE (TREE_OPERAND (incr
, 1)) == NOP_EXPR
14790 && (TREE_CODE (TREE_OPERAND (incr
, 2)) == PLUS_EXPR
14791 || (TREE_CODE (TREE_OPERAND (incr
, 2)) == MINUS_EXPR
)))
14793 tree rhs
= TREE_OPERAND (incr
, 2);
14794 tree lhs
= RECUR (TREE_OPERAND (incr
, 0));
14795 tree rhs0
= RECUR (TREE_OPERAND (rhs
, 0));
14796 tree rhs1
= RECUR (TREE_OPERAND (rhs
, 1));
14797 incr
= build2 (MODIFY_EXPR
, TREE_TYPE (decl
), lhs
,
14798 build2 (TREE_CODE (rhs
), TREE_TYPE (decl
),
14802 incr
= RECUR (incr
);
14805 incr
= RECUR (incr
);
14809 TREE_VEC_ELT (declv
, i
) = decl
;
14810 TREE_VEC_ELT (initv
, i
) = init
;
14811 TREE_VEC_ELT (condv
, i
) = cond
;
14812 TREE_VEC_ELT (incrv
, i
) = incr
;
14816 /* Like tsubst_copy for expressions, etc. but also does semantic
14820 tsubst_expr (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
,
14821 bool integral_constant_expression_p
)
14823 #define RETURN(EXP) do { r = (EXP); goto out; } while(0)
14824 #define RECUR(NODE) \
14825 tsubst_expr ((NODE), args, complain, in_decl, \
14826 integral_constant_expression_p)
14832 if (t
== NULL_TREE
|| t
== error_mark_node
)
14835 loc
= input_location
;
14836 if (EXPR_HAS_LOCATION (t
))
14837 input_location
= EXPR_LOCATION (t
);
14838 if (STATEMENT_CODE_P (TREE_CODE (t
)))
14839 current_stmt_tree ()->stmts_are_full_exprs_p
= STMT_IS_FULL_EXPR_P (t
);
14841 switch (TREE_CODE (t
))
14843 case STATEMENT_LIST
:
14845 tree_stmt_iterator i
;
14846 for (i
= tsi_start (t
); !tsi_end_p (i
); tsi_next (&i
))
14847 RECUR (tsi_stmt (i
));
14851 case CTOR_INITIALIZER
:
14852 finish_mem_initializers (tsubst_initializer_list
14853 (TREE_OPERAND (t
, 0), args
));
14857 finish_return_stmt (RECUR (TREE_OPERAND (t
, 0)));
14861 tmp
= RECUR (EXPR_STMT_EXPR (t
));
14862 if (EXPR_STMT_STMT_EXPR_RESULT (t
))
14863 finish_stmt_expr_expr (tmp
, cur_stmt_expr
);
14865 finish_expr_stmt (tmp
);
14869 do_using_directive (USING_STMT_NAMESPACE (t
));
14874 tree decl
, pattern_decl
;
14877 pattern_decl
= decl
= DECL_EXPR_DECL (t
);
14878 if (TREE_CODE (decl
) == LABEL_DECL
)
14879 finish_label_decl (DECL_NAME (decl
));
14880 else if (TREE_CODE (decl
) == USING_DECL
)
14882 tree scope
= USING_DECL_SCOPE (decl
);
14883 tree name
= DECL_NAME (decl
);
14886 scope
= tsubst (scope
, args
, complain
, in_decl
);
14887 decl
= lookup_qualified_name (scope
, name
,
14888 /*is_type_p=*/false,
14889 /*complain=*/false);
14890 if (decl
== error_mark_node
|| TREE_CODE (decl
) == TREE_LIST
)
14891 qualified_name_lookup_error (scope
, name
, decl
, input_location
);
14893 do_local_using_decl (decl
, scope
, name
);
14895 else if (DECL_PACK_P (decl
))
14897 /* Don't build up decls for a variadic capture proxy, we'll
14898 instantiate the elements directly as needed. */
14903 init
= DECL_INITIAL (decl
);
14904 decl
= tsubst (decl
, args
, complain
, in_decl
);
14905 if (decl
!= error_mark_node
)
14907 /* By marking the declaration as instantiated, we avoid
14908 trying to instantiate it. Since instantiate_decl can't
14909 handle local variables, and since we've already done
14910 all that needs to be done, that's the right thing to
14913 DECL_TEMPLATE_INSTANTIATED (decl
) = 1;
14915 && ANON_AGGR_TYPE_P (TREE_TYPE (decl
)))
14916 /* Anonymous aggregates are a special case. */
14917 finish_anon_union (decl
);
14918 else if (is_capture_proxy (DECL_EXPR_DECL (t
)))
14920 DECL_CONTEXT (decl
) = current_function_decl
;
14921 if (DECL_NAME (decl
) == this_identifier
)
14923 tree lam
= DECL_CONTEXT (current_function_decl
);
14924 lam
= CLASSTYPE_LAMBDA_EXPR (lam
);
14925 LAMBDA_EXPR_THIS_CAPTURE (lam
) = decl
;
14927 insert_capture_proxy (decl
);
14929 else if (DECL_IMPLICIT_TYPEDEF_P (t
))
14930 /* We already did a pushtag. */;
14931 else if (TREE_CODE (decl
) == FUNCTION_DECL
14932 && DECL_OMP_DECLARE_REDUCTION_P (decl
)
14933 && DECL_FUNCTION_SCOPE_P (pattern_decl
))
14935 DECL_CONTEXT (decl
) = NULL_TREE
;
14937 DECL_CONTEXT (decl
) = current_function_decl
;
14938 cp_check_omp_declare_reduction (decl
);
14942 int const_init
= false;
14943 maybe_push_decl (decl
);
14945 && DECL_PRETTY_FUNCTION_P (decl
))
14947 /* For __PRETTY_FUNCTION__ we have to adjust the
14949 const char *const name
14950 = cxx_printable_name (current_function_decl
, 2);
14951 init
= cp_fname_init (name
, &TREE_TYPE (decl
));
14954 init
= tsubst_init (init
, decl
, args
, complain
, in_decl
);
14957 const_init
= (DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P
14959 cp_finish_decl (decl
, init
, const_init
, NULL_TREE
, 0);
14968 stmt
= begin_for_stmt (NULL_TREE
, NULL_TREE
);
14969 RECUR (FOR_INIT_STMT (t
));
14970 finish_for_init_stmt (stmt
);
14971 tmp
= RECUR (FOR_COND (t
));
14972 finish_for_cond (tmp
, stmt
, false);
14973 tmp
= RECUR (FOR_EXPR (t
));
14974 finish_for_expr (tmp
, stmt
);
14975 RECUR (FOR_BODY (t
));
14976 finish_for_stmt (stmt
);
14979 case RANGE_FOR_STMT
:
14982 stmt
= begin_for_stmt (NULL_TREE
, NULL_TREE
);
14983 decl
= RANGE_FOR_DECL (t
);
14984 decl
= tsubst (decl
, args
, complain
, in_decl
);
14985 maybe_push_decl (decl
);
14986 expr
= RECUR (RANGE_FOR_EXPR (t
));
14987 stmt
= cp_convert_range_for (stmt
, decl
, expr
, RANGE_FOR_IVDEP (t
));
14988 RECUR (RANGE_FOR_BODY (t
));
14989 finish_for_stmt (stmt
);
14994 stmt
= begin_while_stmt ();
14995 tmp
= RECUR (WHILE_COND (t
));
14996 finish_while_stmt_cond (tmp
, stmt
, false);
14997 RECUR (WHILE_BODY (t
));
14998 finish_while_stmt (stmt
);
15002 stmt
= begin_do_stmt ();
15003 RECUR (DO_BODY (t
));
15004 finish_do_body (stmt
);
15005 tmp
= RECUR (DO_COND (t
));
15006 finish_do_stmt (tmp
, stmt
, false);
15010 stmt
= begin_if_stmt ();
15011 tmp
= RECUR (IF_COND (t
));
15012 finish_if_stmt_cond (tmp
, stmt
);
15013 RECUR (THEN_CLAUSE (t
));
15014 finish_then_clause (stmt
);
15016 if (ELSE_CLAUSE (t
))
15018 begin_else_clause (stmt
);
15019 RECUR (ELSE_CLAUSE (t
));
15020 finish_else_clause (stmt
);
15023 finish_if_stmt (stmt
);
15027 if (BIND_EXPR_BODY_BLOCK (t
))
15028 stmt
= begin_function_body ();
15030 stmt
= begin_compound_stmt (BIND_EXPR_TRY_BLOCK (t
)
15031 ? BCS_TRY_BLOCK
: 0);
15033 RECUR (BIND_EXPR_BODY (t
));
15035 if (BIND_EXPR_BODY_BLOCK (t
))
15036 finish_function_body (stmt
);
15038 finish_compound_stmt (stmt
);
15042 finish_break_stmt ();
15045 case CONTINUE_STMT
:
15046 finish_continue_stmt ();
15050 stmt
= begin_switch_stmt ();
15051 tmp
= RECUR (SWITCH_STMT_COND (t
));
15052 finish_switch_cond (tmp
, stmt
);
15053 RECUR (SWITCH_STMT_BODY (t
));
15054 finish_switch_stmt (stmt
);
15057 case CASE_LABEL_EXPR
:
15059 tree low
= RECUR (CASE_LOW (t
));
15060 tree high
= RECUR (CASE_HIGH (t
));
15061 finish_case_label (EXPR_LOCATION (t
), low
, high
);
15067 tree decl
= LABEL_EXPR_LABEL (t
);
15070 label
= finish_label_stmt (DECL_NAME (decl
));
15071 if (DECL_ATTRIBUTES (decl
) != NULL_TREE
)
15072 cplus_decl_attributes (&label
, DECL_ATTRIBUTES (decl
), 0);
15077 tmp
= GOTO_DESTINATION (t
);
15078 if (TREE_CODE (tmp
) != LABEL_DECL
)
15079 /* Computed goto's must be tsubst'd into. On the other hand,
15080 non-computed gotos must not be; the identifier in question
15081 will have no binding. */
15084 tmp
= DECL_NAME (tmp
);
15085 finish_goto_stmt (tmp
);
15090 tree string
= RECUR (ASM_STRING (t
));
15091 tree outputs
= tsubst_copy_asm_operands (ASM_OUTPUTS (t
), args
,
15092 complain
, in_decl
);
15093 tree inputs
= tsubst_copy_asm_operands (ASM_INPUTS (t
), args
,
15094 complain
, in_decl
);
15095 tree clobbers
= tsubst_copy_asm_operands (ASM_CLOBBERS (t
), args
,
15096 complain
, in_decl
);
15097 tree labels
= tsubst_copy_asm_operands (ASM_LABELS (t
), args
,
15098 complain
, in_decl
);
15099 tmp
= finish_asm_stmt (ASM_VOLATILE_P (t
), string
, outputs
, inputs
,
15101 tree asm_expr
= tmp
;
15102 if (TREE_CODE (asm_expr
) == CLEANUP_POINT_EXPR
)
15103 asm_expr
= TREE_OPERAND (asm_expr
, 0);
15104 ASM_INPUT_P (asm_expr
) = ASM_INPUT_P (t
);
15111 stmt
= begin_try_block ();
15112 RECUR (TRY_STMTS (t
));
15113 finish_cleanup_try_block (stmt
);
15114 finish_cleanup (RECUR (TRY_HANDLERS (t
)), stmt
);
15118 tree compound_stmt
= NULL_TREE
;
15120 if (FN_TRY_BLOCK_P (t
))
15121 stmt
= begin_function_try_block (&compound_stmt
);
15123 stmt
= begin_try_block ();
15125 RECUR (TRY_STMTS (t
));
15127 if (FN_TRY_BLOCK_P (t
))
15128 finish_function_try_block (stmt
);
15130 finish_try_block (stmt
);
15132 RECUR (TRY_HANDLERS (t
));
15133 if (FN_TRY_BLOCK_P (t
))
15134 finish_function_handler_sequence (stmt
, compound_stmt
);
15136 finish_handler_sequence (stmt
);
15142 tree decl
= HANDLER_PARMS (t
);
15146 decl
= tsubst (decl
, args
, complain
, in_decl
);
15147 /* Prevent instantiate_decl from trying to instantiate
15148 this variable. We've already done all that needs to be
15150 if (decl
!= error_mark_node
)
15151 DECL_TEMPLATE_INSTANTIATED (decl
) = 1;
15153 stmt
= begin_handler ();
15154 finish_handler_parms (decl
, stmt
);
15155 RECUR (HANDLER_BODY (t
));
15156 finish_handler (stmt
);
15161 tmp
= tsubst (TREE_TYPE (t
), args
, complain
, NULL_TREE
);
15162 if (CLASS_TYPE_P (tmp
))
15164 /* Local classes are not independent templates; they are
15165 instantiated along with their containing function. And this
15166 way we don't have to deal with pushing out of one local class
15167 to instantiate a member of another local class. */
15169 /* Closures are handled by the LAMBDA_EXPR. */
15170 gcc_assert (!LAMBDA_TYPE_P (TREE_TYPE (t
)));
15171 complete_type (tmp
);
15172 for (fn
= TYPE_METHODS (tmp
); fn
; fn
= DECL_CHAIN (fn
))
15173 if (!DECL_ARTIFICIAL (fn
))
15174 instantiate_decl (fn
, /*defer_ok*/0, /*expl_inst_class*/false);
15178 case STATIC_ASSERT
:
15182 ++c_inhibit_evaluation_warnings
;
15184 tsubst_expr (STATIC_ASSERT_CONDITION (t
),
15187 /*integral_constant_expression_p=*/true);
15188 --c_inhibit_evaluation_warnings
;
15190 finish_static_assert (condition
,
15191 STATIC_ASSERT_MESSAGE (t
),
15192 STATIC_ASSERT_SOURCE_LOCATION (t
),
15193 /*member_p=*/false);
15198 r
= push_omp_privatization_clauses (OMP_PARALLEL_COMBINED (t
));
15199 tmp
= tsubst_omp_clauses (OMP_PARALLEL_CLAUSES (t
), false, true,
15200 args
, complain
, in_decl
);
15201 if (OMP_PARALLEL_COMBINED (t
))
15202 omp_parallel_combined_clauses
= &tmp
;
15203 stmt
= begin_omp_parallel ();
15204 RECUR (OMP_PARALLEL_BODY (t
));
15205 gcc_assert (omp_parallel_combined_clauses
== NULL
);
15206 OMP_PARALLEL_COMBINED (finish_omp_parallel (tmp
, stmt
))
15207 = OMP_PARALLEL_COMBINED (t
);
15208 pop_omp_privatization_clauses (r
);
15212 r
= push_omp_privatization_clauses (false);
15213 tmp
= tsubst_omp_clauses (OMP_TASK_CLAUSES (t
), false, true,
15214 args
, complain
, in_decl
);
15215 stmt
= begin_omp_task ();
15216 RECUR (OMP_TASK_BODY (t
));
15217 finish_omp_task (tmp
, stmt
);
15218 pop_omp_privatization_clauses (r
);
15225 case OMP_DISTRIBUTE
:
15228 tree clauses
, body
, pre_body
;
15229 tree declv
= NULL_TREE
, initv
= NULL_TREE
, condv
= NULL_TREE
;
15230 tree orig_declv
= NULL_TREE
;
15231 tree incrv
= NULL_TREE
;
15234 r
= push_omp_privatization_clauses (OMP_FOR_INIT (t
) == NULL_TREE
);
15235 clauses
= tsubst_omp_clauses (OMP_FOR_CLAUSES (t
), false, true,
15236 args
, complain
, in_decl
);
15237 if (OMP_FOR_INIT (t
) != NULL_TREE
)
15239 declv
= make_tree_vec (TREE_VEC_LENGTH (OMP_FOR_INIT (t
)));
15240 if (TREE_CODE (t
) == OMP_FOR
&& OMP_FOR_ORIG_DECLS (t
))
15241 orig_declv
= make_tree_vec (TREE_VEC_LENGTH (OMP_FOR_INIT (t
)));
15242 initv
= make_tree_vec (TREE_VEC_LENGTH (OMP_FOR_INIT (t
)));
15243 condv
= make_tree_vec (TREE_VEC_LENGTH (OMP_FOR_INIT (t
)));
15244 incrv
= make_tree_vec (TREE_VEC_LENGTH (OMP_FOR_INIT (t
)));
15247 stmt
= begin_omp_structured_block ();
15249 pre_body
= push_stmt_list ();
15250 RECUR (OMP_FOR_PRE_BODY (t
));
15251 pre_body
= pop_stmt_list (pre_body
);
15253 if (OMP_FOR_INIT (t
) != NULL_TREE
)
15254 for (i
= 0; i
< TREE_VEC_LENGTH (OMP_FOR_INIT (t
)); i
++)
15255 tsubst_omp_for_iterator (t
, i
, declv
, orig_declv
, initv
, condv
,
15256 incrv
, &clauses
, args
, complain
, in_decl
,
15257 integral_constant_expression_p
);
15258 omp_parallel_combined_clauses
= NULL
;
15260 body
= push_stmt_list ();
15261 RECUR (OMP_FOR_BODY (t
));
15262 body
= pop_stmt_list (body
);
15264 if (OMP_FOR_INIT (t
) != NULL_TREE
)
15265 t
= finish_omp_for (EXPR_LOCATION (t
), TREE_CODE (t
), declv
,
15266 orig_declv
, initv
, condv
, incrv
, body
, pre_body
,
15270 t
= make_node (TREE_CODE (t
));
15271 TREE_TYPE (t
) = void_type_node
;
15272 OMP_FOR_BODY (t
) = body
;
15273 OMP_FOR_PRE_BODY (t
) = pre_body
;
15274 OMP_FOR_CLAUSES (t
) = clauses
;
15275 SET_EXPR_LOCATION (t
, EXPR_LOCATION (t
));
15279 add_stmt (finish_omp_structured_block (stmt
));
15280 pop_omp_privatization_clauses (r
);
15285 omp_parallel_combined_clauses
= NULL
;
15290 r
= push_omp_privatization_clauses (TREE_CODE (t
) == OMP_TEAMS
15291 && OMP_TEAMS_COMBINED (t
));
15292 tmp
= tsubst_omp_clauses (OMP_CLAUSES (t
), false, true,
15293 args
, complain
, in_decl
);
15294 stmt
= push_stmt_list ();
15295 RECUR (OMP_BODY (t
));
15296 stmt
= pop_stmt_list (stmt
);
15299 OMP_BODY (t
) = stmt
;
15300 OMP_CLAUSES (t
) = tmp
;
15302 pop_omp_privatization_clauses (r
);
15305 case OMP_TARGET_DATA
:
15307 tmp
= tsubst_omp_clauses (OMP_CLAUSES (t
), false, true,
15308 args
, complain
, in_decl
);
15309 keep_next_level (true);
15310 stmt
= begin_omp_structured_block ();
15312 RECUR (OMP_BODY (t
));
15313 stmt
= finish_omp_structured_block (stmt
);
15316 OMP_BODY (t
) = stmt
;
15317 OMP_CLAUSES (t
) = tmp
;
15321 case OMP_TARGET_UPDATE
:
15322 case OMP_TARGET_ENTER_DATA
:
15323 case OMP_TARGET_EXIT_DATA
:
15324 tmp
= tsubst_omp_clauses (OMP_STANDALONE_CLAUSES (t
), false, true,
15325 args
, complain
, in_decl
);
15327 OMP_STANDALONE_CLAUSES (t
) = tmp
;
15332 tmp
= tsubst_omp_clauses (OMP_ORDERED_CLAUSES (t
), false, true,
15333 args
, complain
, in_decl
);
15334 stmt
= push_stmt_list ();
15335 RECUR (OMP_BODY (t
));
15336 stmt
= pop_stmt_list (stmt
);
15339 OMP_BODY (t
) = stmt
;
15340 OMP_ORDERED_CLAUSES (t
) = tmp
;
15346 case OMP_TASKGROUP
:
15347 stmt
= push_stmt_list ();
15348 RECUR (OMP_BODY (t
));
15349 stmt
= pop_stmt_list (stmt
);
15352 OMP_BODY (t
) = stmt
;
15357 gcc_assert (OMP_ATOMIC_DEPENDENT_P (t
));
15358 if (TREE_CODE (TREE_OPERAND (t
, 1)) != MODIFY_EXPR
)
15360 tree op1
= TREE_OPERAND (t
, 1);
15361 tree rhs1
= NULL_TREE
;
15363 if (TREE_CODE (op1
) == COMPOUND_EXPR
)
15365 rhs1
= RECUR (TREE_OPERAND (op1
, 0));
15366 op1
= TREE_OPERAND (op1
, 1);
15368 lhs
= RECUR (TREE_OPERAND (op1
, 0));
15369 rhs
= RECUR (TREE_OPERAND (op1
, 1));
15370 finish_omp_atomic (OMP_ATOMIC
, TREE_CODE (op1
), lhs
, rhs
,
15371 NULL_TREE
, NULL_TREE
, rhs1
,
15372 OMP_ATOMIC_SEQ_CST (t
));
15376 tree op1
= TREE_OPERAND (t
, 1);
15377 tree v
= NULL_TREE
, lhs
, rhs
= NULL_TREE
, lhs1
= NULL_TREE
;
15378 tree rhs1
= NULL_TREE
;
15379 enum tree_code code
= TREE_CODE (TREE_OPERAND (op1
, 1));
15380 enum tree_code opcode
= NOP_EXPR
;
15381 if (code
== OMP_ATOMIC_READ
)
15383 v
= RECUR (TREE_OPERAND (op1
, 0));
15384 lhs
= RECUR (TREE_OPERAND (TREE_OPERAND (op1
, 1), 0));
15386 else if (code
== OMP_ATOMIC_CAPTURE_OLD
15387 || code
== OMP_ATOMIC_CAPTURE_NEW
)
15389 tree op11
= TREE_OPERAND (TREE_OPERAND (op1
, 1), 1);
15390 v
= RECUR (TREE_OPERAND (op1
, 0));
15391 lhs1
= RECUR (TREE_OPERAND (TREE_OPERAND (op1
, 1), 0));
15392 if (TREE_CODE (op11
) == COMPOUND_EXPR
)
15394 rhs1
= RECUR (TREE_OPERAND (op11
, 0));
15395 op11
= TREE_OPERAND (op11
, 1);
15397 lhs
= RECUR (TREE_OPERAND (op11
, 0));
15398 rhs
= RECUR (TREE_OPERAND (op11
, 1));
15399 opcode
= TREE_CODE (op11
);
15400 if (opcode
== MODIFY_EXPR
)
15406 lhs
= RECUR (TREE_OPERAND (op1
, 0));
15407 rhs
= RECUR (TREE_OPERAND (op1
, 1));
15409 finish_omp_atomic (code
, opcode
, lhs
, rhs
, v
, lhs1
, rhs1
,
15410 OMP_ATOMIC_SEQ_CST (t
));
15414 case TRANSACTION_EXPR
:
15417 flags
|= (TRANSACTION_EXPR_OUTER (t
) ? TM_STMT_ATTR_OUTER
: 0);
15418 flags
|= (TRANSACTION_EXPR_RELAXED (t
) ? TM_STMT_ATTR_RELAXED
: 0);
15420 if (TRANSACTION_EXPR_IS_STMT (t
))
15422 tree body
= TRANSACTION_EXPR_BODY (t
);
15423 tree noex
= NULL_TREE
;
15424 if (TREE_CODE (body
) == MUST_NOT_THROW_EXPR
)
15426 noex
= MUST_NOT_THROW_COND (body
);
15427 if (noex
== NULL_TREE
)
15428 noex
= boolean_true_node
;
15429 body
= TREE_OPERAND (body
, 0);
15431 stmt
= begin_transaction_stmt (input_location
, NULL
, flags
);
15433 finish_transaction_stmt (stmt
, NULL
, flags
, RECUR (noex
));
15437 stmt
= build_transaction_expr (EXPR_LOCATION (t
),
15438 RECUR (TRANSACTION_EXPR_BODY (t
)),
15445 case MUST_NOT_THROW_EXPR
:
15447 tree op0
= RECUR (TREE_OPERAND (t
, 0));
15448 tree cond
= RECUR (MUST_NOT_THROW_COND (t
));
15449 RETURN (build_must_not_throw_expr (op0
, cond
));
15452 case EXPR_PACK_EXPANSION
:
15453 error ("invalid use of pack expansion expression");
15454 RETURN (error_mark_node
);
15456 case NONTYPE_ARGUMENT_PACK
:
15457 error ("use %<...%> to expand argument pack");
15458 RETURN (error_mark_node
);
15460 case CILK_SPAWN_STMT
:
15461 cfun
->calls_cilk_spawn
= 1;
15462 RETURN (build_cilk_spawn (EXPR_LOCATION (t
), RECUR (CILK_SPAWN_FN (t
))));
15464 case CILK_SYNC_STMT
:
15465 RETURN (build_cilk_sync ());
15467 case COMPOUND_EXPR
:
15468 tmp
= RECUR (TREE_OPERAND (t
, 0));
15469 if (tmp
== NULL_TREE
)
15470 /* If the first operand was a statement, we're done with it. */
15471 RETURN (RECUR (TREE_OPERAND (t
, 1)));
15472 RETURN (build_x_compound_expr (EXPR_LOCATION (t
), tmp
,
15473 RECUR (TREE_OPERAND (t
, 1)),
15476 case ANNOTATE_EXPR
:
15477 tmp
= RECUR (TREE_OPERAND (t
, 0));
15478 RETURN (build2_loc (EXPR_LOCATION (t
), ANNOTATE_EXPR
,
15479 TREE_TYPE (tmp
), tmp
, RECUR (TREE_OPERAND (t
, 1))));
15482 gcc_assert (!STATEMENT_CODE_P (TREE_CODE (t
)));
15484 RETURN (tsubst_copy_and_build (t
, args
, complain
, in_decl
,
15485 /*function_p=*/false,
15486 integral_constant_expression_p
));
15489 RETURN (NULL_TREE
);
15491 input_location
= loc
;
15497 /* Instantiate the special body of the artificial DECL_OMP_DECLARE_REDUCTION
15498 function. For description of the body see comment above
15499 cp_parser_omp_declare_reduction_exprs. */
15502 tsubst_omp_udr (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
15504 if (t
== NULL_TREE
|| t
== error_mark_node
)
15507 gcc_assert (TREE_CODE (t
) == STATEMENT_LIST
);
15509 tree_stmt_iterator tsi
;
15512 memset (stmts
, 0, sizeof stmts
);
15513 for (i
= 0, tsi
= tsi_start (t
);
15514 i
< 7 && !tsi_end_p (tsi
);
15515 i
++, tsi_next (&tsi
))
15516 stmts
[i
] = tsi_stmt (tsi
);
15517 gcc_assert (tsi_end_p (tsi
));
15521 gcc_assert (TREE_CODE (stmts
[0]) == DECL_EXPR
15522 && TREE_CODE (stmts
[1]) == DECL_EXPR
);
15523 tree omp_out
= tsubst (DECL_EXPR_DECL (stmts
[0]),
15524 args
, complain
, in_decl
);
15525 tree omp_in
= tsubst (DECL_EXPR_DECL (stmts
[1]),
15526 args
, complain
, in_decl
);
15527 DECL_CONTEXT (omp_out
) = current_function_decl
;
15528 DECL_CONTEXT (omp_in
) = current_function_decl
;
15529 keep_next_level (true);
15530 tree block
= begin_omp_structured_block ();
15531 tsubst_expr (stmts
[2], args
, complain
, in_decl
, false);
15532 block
= finish_omp_structured_block (block
);
15533 block
= maybe_cleanup_point_expr_void (block
);
15534 add_decl_expr (omp_out
);
15535 if (TREE_NO_WARNING (DECL_EXPR_DECL (stmts
[0])))
15536 TREE_NO_WARNING (omp_out
) = 1;
15537 add_decl_expr (omp_in
);
15538 finish_expr_stmt (block
);
15542 gcc_assert (TREE_CODE (stmts
[3]) == DECL_EXPR
15543 && TREE_CODE (stmts
[4]) == DECL_EXPR
);
15544 tree omp_priv
= tsubst (DECL_EXPR_DECL (stmts
[3]),
15545 args
, complain
, in_decl
);
15546 tree omp_orig
= tsubst (DECL_EXPR_DECL (stmts
[4]),
15547 args
, complain
, in_decl
);
15548 DECL_CONTEXT (omp_priv
) = current_function_decl
;
15549 DECL_CONTEXT (omp_orig
) = current_function_decl
;
15550 keep_next_level (true);
15551 tree block
= begin_omp_structured_block ();
15552 tsubst_expr (stmts
[5], args
, complain
, in_decl
, false);
15553 block
= finish_omp_structured_block (block
);
15554 block
= maybe_cleanup_point_expr_void (block
);
15555 cp_walk_tree (&block
, cp_remove_omp_priv_cleanup_stmt
, omp_priv
, NULL
);
15556 add_decl_expr (omp_priv
);
15557 add_decl_expr (omp_orig
);
15558 finish_expr_stmt (block
);
15560 add_decl_expr (omp_orig
);
15564 /* T is a postfix-expression that is not being used in a function
15565 call. Return the substituted version of T. */
15568 tsubst_non_call_postfix_expression (tree t
, tree args
,
15569 tsubst_flags_t complain
,
15572 if (TREE_CODE (t
) == SCOPE_REF
)
15573 t
= tsubst_qualified_id (t
, args
, complain
, in_decl
,
15574 /*done=*/false, /*address_p=*/false);
15576 t
= tsubst_copy_and_build (t
, args
, complain
, in_decl
,
15577 /*function_p=*/false,
15578 /*integral_constant_expression_p=*/false);
15583 /* Like tsubst but deals with expressions and performs semantic
15584 analysis. FUNCTION_P is true if T is the "F" in "F (ARGS)". */
15587 tsubst_copy_and_build (tree t
,
15589 tsubst_flags_t complain
,
15592 bool integral_constant_expression_p
)
15594 #define RETURN(EXP) do { retval = (EXP); goto out; } while(0)
15595 #define RECUR(NODE) \
15596 tsubst_copy_and_build (NODE, args, complain, in_decl, \
15597 /*function_p=*/false, \
15598 integral_constant_expression_p)
15603 if (t
== NULL_TREE
|| t
== error_mark_node
)
15606 loc
= input_location
;
15607 if (EXPR_HAS_LOCATION (t
))
15608 input_location
= EXPR_LOCATION (t
);
15610 /* N3276 decltype magic only applies to calls at the top level or on the
15611 right side of a comma. */
15612 tsubst_flags_t decltype_flag
= (complain
& tf_decltype
);
15613 complain
&= ~tf_decltype
;
15615 switch (TREE_CODE (t
))
15619 /* Fall through. */
15620 case IDENTIFIER_NODE
:
15624 bool non_integral_constant_expression_p
;
15625 const char *error_msg
;
15627 if (IDENTIFIER_TYPENAME_P (t
))
15629 tree new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
15630 t
= mangle_conv_op_name_for_type (new_type
);
15633 /* Look up the name. */
15634 decl
= lookup_name (t
);
15636 /* By convention, expressions use ERROR_MARK_NODE to indicate
15637 failure, not NULL_TREE. */
15638 if (decl
== NULL_TREE
)
15639 decl
= error_mark_node
;
15641 decl
= finish_id_expression (t
, decl
, NULL_TREE
,
15643 integral_constant_expression_p
,
15644 /*allow_non_integral_constant_expression_p=*/(cxx_dialect
>= cxx11
),
15645 &non_integral_constant_expression_p
,
15646 /*template_p=*/false,
15648 /*address_p=*/false,
15649 /*template_arg_p=*/false,
15654 if (!function_p
&& identifier_p (decl
))
15656 if (complain
& tf_error
)
15657 unqualified_name_lookup_error (decl
);
15658 decl
= error_mark_node
;
15663 case TEMPLATE_ID_EXPR
:
15666 tree templ
= RECUR (TREE_OPERAND (t
, 0));
15667 tree targs
= TREE_OPERAND (t
, 1);
15670 targs
= tsubst_template_args (targs
, args
, complain
, in_decl
);
15671 if (targs
== error_mark_node
)
15672 return error_mark_node
;
15674 if (variable_template_p (templ
))
15676 templ
= lookup_template_variable (templ
, targs
);
15677 if (!any_dependent_template_arguments_p (targs
))
15679 templ
= finish_template_variable (templ
, complain
);
15682 RETURN (convert_from_reference (templ
));
15685 if (TREE_CODE (templ
) == COMPONENT_REF
)
15687 object
= TREE_OPERAND (templ
, 0);
15688 templ
= TREE_OPERAND (templ
, 1);
15691 object
= NULL_TREE
;
15692 templ
= lookup_template_function (templ
, targs
);
15695 RETURN (build3 (COMPONENT_REF
, TREE_TYPE (templ
),
15696 object
, templ
, NULL_TREE
));
15698 RETURN (baselink_for_fns (templ
));
15703 tree r
= RECUR (TREE_OPERAND (t
, 0));
15705 if (REFERENCE_REF_P (t
))
15707 /* A type conversion to reference type will be enclosed in
15708 such an indirect ref, but the substitution of the cast
15709 will have also added such an indirect ref. */
15710 if (TREE_CODE (TREE_TYPE (r
)) == REFERENCE_TYPE
)
15711 r
= convert_from_reference (r
);
15714 r
= build_x_indirect_ref (input_location
, r
, RO_UNARY_STAR
,
15715 complain
|decltype_flag
);
15721 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
15722 tree op0
= RECUR (TREE_OPERAND (t
, 0));
15723 RETURN (build_nop (type
, op0
));
15726 case IMPLICIT_CONV_EXPR
:
15728 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
15729 tree expr
= RECUR (TREE_OPERAND (t
, 0));
15730 int flags
= LOOKUP_IMPLICIT
;
15731 if (IMPLICIT_CONV_EXPR_DIRECT_INIT (t
))
15732 flags
= LOOKUP_NORMAL
;
15733 RETURN (perform_implicit_conversion_flags (type
, expr
, complain
,
15739 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
15740 tree op0
= RECUR (TREE_OPERAND (t
, 0));
15741 RETURN (build1 (CONVERT_EXPR
, type
, op0
));
15745 case REINTERPRET_CAST_EXPR
:
15746 case CONST_CAST_EXPR
:
15747 case DYNAMIC_CAST_EXPR
:
15748 case STATIC_CAST_EXPR
:
15751 tree op
, r
= NULL_TREE
;
15753 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
15754 if (integral_constant_expression_p
15755 && !cast_valid_in_integral_constant_expression_p (type
))
15757 if (complain
& tf_error
)
15758 error ("a cast to a type other than an integral or "
15759 "enumeration type cannot appear in a constant-expression");
15760 RETURN (error_mark_node
);
15763 op
= RECUR (TREE_OPERAND (t
, 0));
15765 warning_sentinel
s(warn_useless_cast
);
15766 switch (TREE_CODE (t
))
15769 r
= build_functional_cast (type
, op
, complain
);
15771 case REINTERPRET_CAST_EXPR
:
15772 r
= build_reinterpret_cast (type
, op
, complain
);
15774 case CONST_CAST_EXPR
:
15775 r
= build_const_cast (type
, op
, complain
);
15777 case DYNAMIC_CAST_EXPR
:
15778 r
= build_dynamic_cast (type
, op
, complain
);
15780 case STATIC_CAST_EXPR
:
15781 r
= build_static_cast (type
, op
, complain
);
15784 gcc_unreachable ();
15790 case POSTDECREMENT_EXPR
:
15791 case POSTINCREMENT_EXPR
:
15792 op1
= tsubst_non_call_postfix_expression (TREE_OPERAND (t
, 0),
15793 args
, complain
, in_decl
);
15794 RETURN (build_x_unary_op (input_location
, TREE_CODE (t
), op1
,
15795 complain
|decltype_flag
));
15797 case PREDECREMENT_EXPR
:
15798 case PREINCREMENT_EXPR
:
15802 case TRUTH_NOT_EXPR
:
15803 case UNARY_PLUS_EXPR
: /* Unary + */
15804 case REALPART_EXPR
:
15805 case IMAGPART_EXPR
:
15806 RETURN (build_x_unary_op (input_location
, TREE_CODE (t
),
15807 RECUR (TREE_OPERAND (t
, 0)),
15808 complain
|decltype_flag
));
15810 case FIX_TRUNC_EXPR
:
15811 RETURN (cp_build_unary_op (FIX_TRUNC_EXPR
, RECUR (TREE_OPERAND (t
, 0)),
15815 op1
= TREE_OPERAND (t
, 0);
15816 if (TREE_CODE (op1
) == LABEL_DECL
)
15817 RETURN (finish_label_address_expr (DECL_NAME (op1
),
15818 EXPR_LOCATION (op1
)));
15819 if (TREE_CODE (op1
) == SCOPE_REF
)
15820 op1
= tsubst_qualified_id (op1
, args
, complain
, in_decl
,
15821 /*done=*/true, /*address_p=*/true);
15823 op1
= tsubst_non_call_postfix_expression (op1
, args
, complain
,
15825 RETURN (build_x_unary_op (input_location
, ADDR_EXPR
, op1
,
15826 complain
|decltype_flag
));
15831 case TRUNC_DIV_EXPR
:
15832 case CEIL_DIV_EXPR
:
15833 case FLOOR_DIV_EXPR
:
15834 case ROUND_DIV_EXPR
:
15835 case EXACT_DIV_EXPR
:
15839 case TRUNC_MOD_EXPR
:
15840 case FLOOR_MOD_EXPR
:
15841 case TRUTH_ANDIF_EXPR
:
15842 case TRUTH_ORIF_EXPR
:
15843 case TRUTH_AND_EXPR
:
15844 case TRUTH_OR_EXPR
:
15860 warning_sentinel
s1(warn_type_limits
);
15861 warning_sentinel
s2(warn_div_by_zero
);
15862 warning_sentinel
s3(warn_logical_op
);
15863 warning_sentinel
s4(warn_tautological_compare
);
15864 tree op0
= RECUR (TREE_OPERAND (t
, 0));
15865 tree op1
= RECUR (TREE_OPERAND (t
, 1));
15866 tree r
= build_x_binary_op
15867 (input_location
, TREE_CODE (t
),
15869 (TREE_NO_WARNING (TREE_OPERAND (t
, 0))
15871 : TREE_CODE (TREE_OPERAND (t
, 0))),
15873 (TREE_NO_WARNING (TREE_OPERAND (t
, 1))
15875 : TREE_CODE (TREE_OPERAND (t
, 1))),
15877 complain
|decltype_flag
);
15878 if (EXPR_P (r
) && TREE_NO_WARNING (t
))
15879 TREE_NO_WARNING (r
) = TREE_NO_WARNING (t
);
15884 case POINTER_PLUS_EXPR
:
15886 tree op0
= RECUR (TREE_OPERAND (t
, 0));
15887 tree op1
= RECUR (TREE_OPERAND (t
, 1));
15888 return fold_build_pointer_plus (op0
, op1
);
15892 RETURN (tsubst_qualified_id (t
, args
, complain
, in_decl
, /*done=*/true,
15893 /*address_p=*/false));
15895 op1
= tsubst_non_call_postfix_expression (TREE_OPERAND (t
, 0),
15896 args
, complain
, in_decl
);
15897 RETURN (build_x_array_ref (EXPR_LOCATION (t
), op1
,
15898 RECUR (TREE_OPERAND (t
, 1)),
15899 complain
|decltype_flag
));
15901 case ARRAY_NOTATION_REF
:
15903 tree start_index
, length
, stride
;
15904 op1
= tsubst_non_call_postfix_expression (ARRAY_NOTATION_ARRAY (t
),
15905 args
, complain
, in_decl
);
15906 start_index
= RECUR (ARRAY_NOTATION_START (t
));
15907 length
= RECUR (ARRAY_NOTATION_LENGTH (t
));
15908 stride
= RECUR (ARRAY_NOTATION_STRIDE (t
));
15909 RETURN (build_array_notation_ref (EXPR_LOCATION (t
), op1
, start_index
,
15910 length
, stride
, TREE_TYPE (op1
)));
15913 if (PACK_EXPANSION_P (TREE_OPERAND (t
, 0)))
15914 RETURN (tsubst_copy (t
, args
, complain
, in_decl
));
15921 op1
= TREE_OPERAND (t
, 0);
15922 if (TREE_CODE (t
) == SIZEOF_EXPR
&& SIZEOF_EXPR_TYPE_P (t
))
15923 op1
= TREE_TYPE (op1
);
15926 /* When there are no ARGS, we are trying to evaluate a
15927 non-dependent expression from the parser. Trying to do
15928 the substitutions may not work. */
15930 op1
= TREE_TYPE (op1
);
15934 ++cp_unevaluated_operand
;
15935 ++c_inhibit_evaluation_warnings
;
15937 op1
= tsubst (op1
, args
, complain
, in_decl
);
15939 op1
= tsubst_copy_and_build (op1
, args
, complain
, in_decl
,
15940 /*function_p=*/false,
15941 /*integral_constant_expression_p=*/
15943 --cp_unevaluated_operand
;
15944 --c_inhibit_evaluation_warnings
;
15947 r
= cxx_sizeof_or_alignof_type (op1
, TREE_CODE (t
),
15948 complain
& tf_error
);
15950 r
= cxx_sizeof_or_alignof_expr (op1
, TREE_CODE (t
),
15951 complain
& tf_error
);
15952 if (TREE_CODE (t
) == SIZEOF_EXPR
&& r
!= error_mark_node
)
15954 if (TREE_CODE (r
) != SIZEOF_EXPR
|| TYPE_P (op1
))
15956 if (!processing_template_decl
&& TYPE_P (op1
))
15958 r
= build_min (SIZEOF_EXPR
, size_type_node
,
15959 build1 (NOP_EXPR
, op1
, error_mark_node
));
15960 SIZEOF_EXPR_TYPE_P (r
) = 1;
15963 r
= build_min (SIZEOF_EXPR
, size_type_node
, op1
);
15964 TREE_SIDE_EFFECTS (r
) = 0;
15965 TREE_READONLY (r
) = 1;
15967 SET_EXPR_LOCATION (r
, EXPR_LOCATION (t
));
15972 case AT_ENCODE_EXPR
:
15974 op1
= TREE_OPERAND (t
, 0);
15975 ++cp_unevaluated_operand
;
15976 ++c_inhibit_evaluation_warnings
;
15977 op1
= tsubst_copy_and_build (op1
, args
, complain
, in_decl
,
15978 /*function_p=*/false,
15979 /*integral_constant_expression_p=*/false);
15980 --cp_unevaluated_operand
;
15981 --c_inhibit_evaluation_warnings
;
15982 RETURN (objc_build_encode_expr (op1
));
15985 case NOEXCEPT_EXPR
:
15986 op1
= TREE_OPERAND (t
, 0);
15987 ++cp_unevaluated_operand
;
15988 ++c_inhibit_evaluation_warnings
;
15989 ++cp_noexcept_operand
;
15990 op1
= tsubst_copy_and_build (op1
, args
, complain
, in_decl
,
15991 /*function_p=*/false,
15992 /*integral_constant_expression_p=*/false);
15993 --cp_unevaluated_operand
;
15994 --c_inhibit_evaluation_warnings
;
15995 --cp_noexcept_operand
;
15996 RETURN (finish_noexcept_expr (op1
, complain
));
16000 warning_sentinel
s(warn_div_by_zero
);
16001 tree lhs
= RECUR (TREE_OPERAND (t
, 0));
16002 tree rhs
= RECUR (TREE_OPERAND (t
, 2));
16003 tree r
= build_x_modify_expr
16004 (EXPR_LOCATION (t
), lhs
, TREE_CODE (TREE_OPERAND (t
, 1)), rhs
,
16005 complain
|decltype_flag
);
16006 /* TREE_NO_WARNING must be set if either the expression was
16007 parenthesized or it uses an operator such as >>= rather
16008 than plain assignment. In the former case, it was already
16009 set and must be copied. In the latter case,
16010 build_x_modify_expr sets it and it must not be reset
16012 if (TREE_NO_WARNING (t
))
16013 TREE_NO_WARNING (r
) = TREE_NO_WARNING (t
);
16019 op1
= tsubst_non_call_postfix_expression (TREE_OPERAND (t
, 0),
16020 args
, complain
, in_decl
);
16021 /* Remember that there was a reference to this entity. */
16023 && !mark_used (op1
, complain
) && !(complain
& tf_error
))
16024 RETURN (error_mark_node
);
16025 RETURN (build_x_arrow (input_location
, op1
, complain
));
16029 tree placement
= RECUR (TREE_OPERAND (t
, 0));
16030 tree init
= RECUR (TREE_OPERAND (t
, 3));
16031 vec
<tree
, va_gc
> *placement_vec
;
16032 vec
<tree
, va_gc
> *init_vec
;
16035 if (placement
== NULL_TREE
)
16036 placement_vec
= NULL
;
16039 placement_vec
= make_tree_vector ();
16040 for (; placement
!= NULL_TREE
; placement
= TREE_CHAIN (placement
))
16041 vec_safe_push (placement_vec
, TREE_VALUE (placement
));
16044 /* If there was an initializer in the original tree, but it
16045 instantiated to an empty list, then we should pass a
16046 non-NULL empty vector to tell build_new that it was an
16047 empty initializer() rather than no initializer. This can
16048 only happen when the initializer is a pack expansion whose
16049 parameter packs are of length zero. */
16050 if (init
== NULL_TREE
&& TREE_OPERAND (t
, 3) == NULL_TREE
)
16054 init_vec
= make_tree_vector ();
16055 if (init
== void_node
)
16056 gcc_assert (init_vec
!= NULL
);
16059 for (; init
!= NULL_TREE
; init
= TREE_CHAIN (init
))
16060 vec_safe_push (init_vec
, TREE_VALUE (init
));
16064 tree op1
= tsubst (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
16065 tree op2
= RECUR (TREE_OPERAND (t
, 2));
16066 ret
= build_new (&placement_vec
, op1
, op2
, &init_vec
,
16067 NEW_EXPR_USE_GLOBAL (t
),
16070 if (placement_vec
!= NULL
)
16071 release_tree_vector (placement_vec
);
16072 if (init_vec
!= NULL
)
16073 release_tree_vector (init_vec
);
16080 tree op0
= RECUR (TREE_OPERAND (t
, 0));
16081 tree op1
= RECUR (TREE_OPERAND (t
, 1));
16082 RETURN (delete_sanity (op0
, op1
,
16083 DELETE_EXPR_USE_VEC (t
),
16084 DELETE_EXPR_USE_GLOBAL (t
),
16088 case COMPOUND_EXPR
:
16090 tree op0
= tsubst_copy_and_build (TREE_OPERAND (t
, 0), args
,
16091 complain
& ~tf_decltype
, in_decl
,
16092 /*function_p=*/false,
16093 integral_constant_expression_p
);
16094 RETURN (build_x_compound_expr (EXPR_LOCATION (t
),
16096 RECUR (TREE_OPERAND (t
, 1)),
16097 complain
|decltype_flag
));
16103 vec
<tree
, va_gc
> *call_args
;
16104 unsigned int nargs
, i
;
16109 function
= CALL_EXPR_FN (t
);
16110 /* When we parsed the expression, we determined whether or
16111 not Koenig lookup should be performed. */
16112 koenig_p
= KOENIG_LOOKUP_P (t
);
16113 if (TREE_CODE (function
) == SCOPE_REF
)
16115 qualified_p
= true;
16116 function
= tsubst_qualified_id (function
, args
, complain
, in_decl
,
16118 /*address_p=*/false);
16120 else if (koenig_p
&& identifier_p (function
))
16122 /* Do nothing; calling tsubst_copy_and_build on an identifier
16123 would incorrectly perform unqualified lookup again.
16125 Note that we can also have an IDENTIFIER_NODE if the earlier
16126 unqualified lookup found a member function; in that case
16127 koenig_p will be false and we do want to do the lookup
16128 again to find the instantiated member function.
16130 FIXME but doing that causes c++/15272, so we need to stop
16131 using IDENTIFIER_NODE in that situation. */
16132 qualified_p
= false;
16136 if (TREE_CODE (function
) == COMPONENT_REF
)
16138 tree op
= TREE_OPERAND (function
, 1);
16140 qualified_p
= (TREE_CODE (op
) == SCOPE_REF
16141 || (BASELINK_P (op
)
16142 && BASELINK_QUALIFIED_P (op
)));
16145 qualified_p
= false;
16147 if (TREE_CODE (function
) == ADDR_EXPR
16148 && TREE_CODE (TREE_OPERAND (function
, 0)) == FUNCTION_DECL
)
16149 /* Avoid error about taking the address of a constructor. */
16150 function
= TREE_OPERAND (function
, 0);
16152 function
= tsubst_copy_and_build (function
, args
, complain
,
16155 integral_constant_expression_p
);
16157 if (BASELINK_P (function
))
16158 qualified_p
= true;
16161 nargs
= call_expr_nargs (t
);
16162 call_args
= make_tree_vector ();
16163 for (i
= 0; i
< nargs
; ++i
)
16165 tree arg
= CALL_EXPR_ARG (t
, i
);
16167 if (!PACK_EXPANSION_P (arg
))
16168 vec_safe_push (call_args
, RECUR (CALL_EXPR_ARG (t
, i
)));
16171 /* Expand the pack expansion and push each entry onto
16173 arg
= tsubst_pack_expansion (arg
, args
, complain
, in_decl
);
16174 if (TREE_CODE (arg
) == TREE_VEC
)
16176 unsigned int len
, j
;
16178 len
= TREE_VEC_LENGTH (arg
);
16179 for (j
= 0; j
< len
; ++j
)
16181 tree value
= TREE_VEC_ELT (arg
, j
);
16182 if (value
!= NULL_TREE
)
16183 value
= convert_from_reference (value
);
16184 vec_safe_push (call_args
, value
);
16189 /* A partial substitution. Add one entry. */
16190 vec_safe_push (call_args
, arg
);
16195 /* We do not perform argument-dependent lookup if normal
16196 lookup finds a non-function, in accordance with the
16197 expected resolution of DR 218. */
16199 && ((is_overloaded_fn (function
)
16200 /* If lookup found a member function, the Koenig lookup is
16201 not appropriate, even if an unqualified-name was used
16202 to denote the function. */
16203 && !DECL_FUNCTION_MEMBER_P (get_first_fn (function
)))
16204 || identifier_p (function
))
16205 /* Only do this when substitution turns a dependent call
16206 into a non-dependent call. */
16207 && type_dependent_expression_p_push (t
)
16208 && !any_type_dependent_arguments_p (call_args
))
16209 function
= perform_koenig_lookup (function
, call_args
, tf_none
);
16211 if (identifier_p (function
)
16212 && !any_type_dependent_arguments_p (call_args
))
16214 if (koenig_p
&& (complain
& tf_warning_or_error
))
16216 /* For backwards compatibility and good diagnostics, try
16217 the unqualified lookup again if we aren't in SFINAE
16219 tree unq
= (tsubst_copy_and_build
16220 (function
, args
, complain
, in_decl
, true,
16221 integral_constant_expression_p
));
16222 if (unq
== error_mark_node
)
16223 RETURN (error_mark_node
);
16225 if (unq
!= function
)
16228 if (INDIRECT_REF_P (fn
))
16229 fn
= TREE_OPERAND (fn
, 0);
16230 if (TREE_CODE (fn
) == COMPONENT_REF
)
16231 fn
= TREE_OPERAND (fn
, 1);
16232 if (is_overloaded_fn (fn
))
16233 fn
= get_first_fn (fn
);
16234 if (permerror (EXPR_LOC_OR_LOC (t
, input_location
),
16235 "%qD was not declared in this scope, "
16236 "and no declarations were found by "
16237 "argument-dependent lookup at the point "
16238 "of instantiation", function
))
16241 /* Can't say anything more. */;
16242 else if (DECL_CLASS_SCOPE_P (fn
))
16244 location_t loc
= EXPR_LOC_OR_LOC (t
,
16247 "declarations in dependent base %qT are "
16248 "not found by unqualified lookup",
16249 DECL_CLASS_CONTEXT (fn
));
16250 if (current_class_ptr
)
16252 "use %<this->%D%> instead", function
);
16255 "use %<%T::%D%> instead",
16256 current_class_name
, function
);
16259 inform (DECL_SOURCE_LOCATION (fn
),
16260 "%qD declared here, later in the "
16261 "translation unit", fn
);
16266 if (identifier_p (function
))
16268 if (complain
& tf_error
)
16269 unqualified_name_lookup_error (function
);
16270 release_tree_vector (call_args
);
16271 RETURN (error_mark_node
);
16275 /* Remember that there was a reference to this entity. */
16276 if (DECL_P (function
)
16277 && !mark_used (function
, complain
) && !(complain
& tf_error
))
16278 RETURN (error_mark_node
);
16280 /* Put back tf_decltype for the actual call. */
16281 complain
|= decltype_flag
;
16283 if (TREE_CODE (function
) == OFFSET_REF
)
16284 ret
= build_offset_ref_call_from_tree (function
, &call_args
,
16286 else if (TREE_CODE (function
) == COMPONENT_REF
)
16288 tree instance
= TREE_OPERAND (function
, 0);
16289 tree fn
= TREE_OPERAND (function
, 1);
16291 if (processing_template_decl
16292 && (type_dependent_expression_p (instance
)
16293 || (!BASELINK_P (fn
)
16294 && TREE_CODE (fn
) != FIELD_DECL
)
16295 || type_dependent_expression_p (fn
)
16296 || any_type_dependent_arguments_p (call_args
)))
16297 ret
= build_nt_call_vec (function
, call_args
);
16298 else if (!BASELINK_P (fn
))
16299 ret
= finish_call_expr (function
, &call_args
,
16300 /*disallow_virtual=*/false,
16301 /*koenig_p=*/false,
16304 ret
= (build_new_method_call
16306 &call_args
, NULL_TREE
,
16307 qualified_p
? LOOKUP_NONVIRTUAL
: LOOKUP_NORMAL
,
16312 ret
= finish_call_expr (function
, &call_args
,
16313 /*disallow_virtual=*/qualified_p
,
16317 release_tree_vector (call_args
);
16324 tree cond
= RECUR (TREE_OPERAND (t
, 0));
16325 tree folded_cond
= fold_non_dependent_expr (cond
);
16328 if (TREE_CODE (folded_cond
) == INTEGER_CST
)
16330 if (integer_zerop (folded_cond
))
16332 ++c_inhibit_evaluation_warnings
;
16333 exp1
= RECUR (TREE_OPERAND (t
, 1));
16334 --c_inhibit_evaluation_warnings
;
16335 exp2
= RECUR (TREE_OPERAND (t
, 2));
16339 exp1
= RECUR (TREE_OPERAND (t
, 1));
16340 ++c_inhibit_evaluation_warnings
;
16341 exp2
= RECUR (TREE_OPERAND (t
, 2));
16342 --c_inhibit_evaluation_warnings
;
16344 cond
= folded_cond
;
16348 exp1
= RECUR (TREE_OPERAND (t
, 1));
16349 exp2
= RECUR (TREE_OPERAND (t
, 2));
16352 RETURN (build_x_conditional_expr (EXPR_LOCATION (t
),
16353 cond
, exp1
, exp2
, complain
));
16356 case PSEUDO_DTOR_EXPR
:
16358 tree op0
= RECUR (TREE_OPERAND (t
, 0));
16359 tree op1
= RECUR (TREE_OPERAND (t
, 1));
16360 tree op2
= tsubst (TREE_OPERAND (t
, 2), args
, complain
, in_decl
);
16361 RETURN (finish_pseudo_destructor_expr (op0
, op1
, op2
,
16367 tree purpose
, value
, chain
;
16369 if (t
== void_list_node
)
16372 if ((TREE_PURPOSE (t
) && PACK_EXPANSION_P (TREE_PURPOSE (t
)))
16373 || (TREE_VALUE (t
) && PACK_EXPANSION_P (TREE_VALUE (t
))))
16375 /* We have pack expansions, so expand those and
16376 create a new list out of it. */
16377 tree purposevec
= NULL_TREE
;
16378 tree valuevec
= NULL_TREE
;
16382 /* Expand the argument expressions. */
16383 if (TREE_PURPOSE (t
))
16384 purposevec
= tsubst_pack_expansion (TREE_PURPOSE (t
), args
,
16385 complain
, in_decl
);
16386 if (TREE_VALUE (t
))
16387 valuevec
= tsubst_pack_expansion (TREE_VALUE (t
), args
,
16388 complain
, in_decl
);
16390 /* Build the rest of the list. */
16391 chain
= TREE_CHAIN (t
);
16392 if (chain
&& chain
!= void_type_node
)
16393 chain
= RECUR (chain
);
16395 /* Determine the number of arguments. */
16396 if (purposevec
&& TREE_CODE (purposevec
) == TREE_VEC
)
16398 len
= TREE_VEC_LENGTH (purposevec
);
16399 gcc_assert (!valuevec
|| len
== TREE_VEC_LENGTH (valuevec
));
16401 else if (TREE_CODE (valuevec
) == TREE_VEC
)
16402 len
= TREE_VEC_LENGTH (valuevec
);
16405 /* Since we only performed a partial substitution into
16406 the argument pack, we only RETURN (a single list
16408 if (purposevec
== TREE_PURPOSE (t
)
16409 && valuevec
== TREE_VALUE (t
)
16410 && chain
== TREE_CHAIN (t
))
16413 RETURN (tree_cons (purposevec
, valuevec
, chain
));
16416 /* Convert the argument vectors into a TREE_LIST */
16420 /* Grab the Ith values. */
16422 purpose
= purposevec
? TREE_VEC_ELT (purposevec
, i
)
16425 = valuevec
? convert_from_reference (TREE_VEC_ELT (valuevec
, i
))
16428 /* Build the list (backwards). */
16429 chain
= tree_cons (purpose
, value
, chain
);
16435 purpose
= TREE_PURPOSE (t
);
16437 purpose
= RECUR (purpose
);
16438 value
= TREE_VALUE (t
);
16440 value
= RECUR (value
);
16441 chain
= TREE_CHAIN (t
);
16442 if (chain
&& chain
!= void_type_node
)
16443 chain
= RECUR (chain
);
16444 if (purpose
== TREE_PURPOSE (t
)
16445 && value
== TREE_VALUE (t
)
16446 && chain
== TREE_CHAIN (t
))
16448 RETURN (tree_cons (purpose
, value
, chain
));
16451 case COMPONENT_REF
:
16458 object
= tsubst_non_call_postfix_expression (TREE_OPERAND (t
, 0),
16459 args
, complain
, in_decl
);
16460 /* Remember that there was a reference to this entity. */
16461 if (DECL_P (object
)
16462 && !mark_used (object
, complain
) && !(complain
& tf_error
))
16463 RETURN (error_mark_node
);
16464 object_type
= TREE_TYPE (object
);
16466 member
= TREE_OPERAND (t
, 1);
16467 if (BASELINK_P (member
))
16468 member
= tsubst_baselink (member
,
16469 non_reference (TREE_TYPE (object
)),
16470 args
, complain
, in_decl
);
16472 member
= tsubst_copy (member
, args
, complain
, in_decl
);
16473 if (member
== error_mark_node
)
16474 RETURN (error_mark_node
);
16476 if (type_dependent_expression_p (object
))
16477 /* We can't do much here. */;
16478 else if (!CLASS_TYPE_P (object_type
))
16480 if (scalarish_type_p (object_type
))
16482 tree s
= NULL_TREE
;
16483 tree dtor
= member
;
16485 if (TREE_CODE (dtor
) == SCOPE_REF
)
16487 s
= TREE_OPERAND (dtor
, 0);
16488 dtor
= TREE_OPERAND (dtor
, 1);
16490 if (TREE_CODE (dtor
) == BIT_NOT_EXPR
)
16492 dtor
= TREE_OPERAND (dtor
, 0);
16494 RETURN (finish_pseudo_destructor_expr
16495 (object
, s
, dtor
, input_location
));
16499 else if (TREE_CODE (member
) == SCOPE_REF
16500 && TREE_CODE (TREE_OPERAND (member
, 1)) == TEMPLATE_ID_EXPR
)
16502 /* Lookup the template functions now that we know what the
16504 tree scope
= TREE_OPERAND (member
, 0);
16505 tree tmpl
= TREE_OPERAND (TREE_OPERAND (member
, 1), 0);
16506 tree args
= TREE_OPERAND (TREE_OPERAND (member
, 1), 1);
16507 member
= lookup_qualified_name (scope
, tmpl
,
16508 /*is_type_p=*/false,
16509 /*complain=*/false);
16510 if (BASELINK_P (member
))
16512 BASELINK_FUNCTIONS (member
)
16513 = build_nt (TEMPLATE_ID_EXPR
, BASELINK_FUNCTIONS (member
),
16515 member
= (adjust_result_of_qualified_name_lookup
16516 (member
, BINFO_TYPE (BASELINK_BINFO (member
)),
16521 qualified_name_lookup_error (scope
, tmpl
, member
,
16523 RETURN (error_mark_node
);
16526 else if (TREE_CODE (member
) == SCOPE_REF
16527 && !CLASS_TYPE_P (TREE_OPERAND (member
, 0))
16528 && TREE_CODE (TREE_OPERAND (member
, 0)) != NAMESPACE_DECL
)
16530 if (complain
& tf_error
)
16532 if (TYPE_P (TREE_OPERAND (member
, 0)))
16533 error ("%qT is not a class or namespace",
16534 TREE_OPERAND (member
, 0));
16536 error ("%qD is not a class or namespace",
16537 TREE_OPERAND (member
, 0));
16539 RETURN (error_mark_node
);
16541 else if (TREE_CODE (member
) == FIELD_DECL
)
16543 r
= finish_non_static_data_member (member
, object
, NULL_TREE
);
16544 if (TREE_CODE (r
) == COMPONENT_REF
)
16545 REF_PARENTHESIZED_P (r
) = REF_PARENTHESIZED_P (t
);
16549 r
= finish_class_member_access_expr (object
, member
,
16550 /*template_p=*/false,
16552 if (TREE_CODE (r
) == COMPONENT_REF
)
16553 REF_PARENTHESIZED_P (r
) = REF_PARENTHESIZED_P (t
);
16558 RETURN (build_throw
16559 (RECUR (TREE_OPERAND (t
, 0))));
16563 vec
<constructor_elt
, va_gc
> *n
;
16564 constructor_elt
*ce
;
16565 unsigned HOST_WIDE_INT idx
;
16566 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
16567 bool process_index_p
;
16569 bool need_copy_p
= false;
16572 if (type
== error_mark_node
)
16573 RETURN (error_mark_node
);
16575 /* digest_init will do the wrong thing if we let it. */
16576 if (type
&& TYPE_PTRMEMFUNC_P (type
))
16579 /* We do not want to process the index of aggregate
16580 initializers as they are identifier nodes which will be
16581 looked up by digest_init. */
16582 process_index_p
= !(type
&& MAYBE_CLASS_TYPE_P (type
));
16584 n
= vec_safe_copy (CONSTRUCTOR_ELTS (t
));
16585 newlen
= vec_safe_length (n
);
16586 FOR_EACH_VEC_SAFE_ELT (n
, idx
, ce
)
16588 if (ce
->index
&& process_index_p
16589 /* An identifier index is looked up in the type
16590 being initialized, not the current scope. */
16591 && TREE_CODE (ce
->index
) != IDENTIFIER_NODE
)
16592 ce
->index
= RECUR (ce
->index
);
16594 if (PACK_EXPANSION_P (ce
->value
))
16596 /* Substitute into the pack expansion. */
16597 ce
->value
= tsubst_pack_expansion (ce
->value
, args
, complain
,
16600 if (ce
->value
== error_mark_node
16601 || PACK_EXPANSION_P (ce
->value
))
16603 else if (TREE_VEC_LENGTH (ce
->value
) == 1)
16604 /* Just move the argument into place. */
16605 ce
->value
= TREE_VEC_ELT (ce
->value
, 0);
16608 /* Update the length of the final CONSTRUCTOR
16609 arguments vector, and note that we will need to
16611 newlen
= newlen
+ TREE_VEC_LENGTH (ce
->value
) - 1;
16612 need_copy_p
= true;
16616 ce
->value
= RECUR (ce
->value
);
16621 vec
<constructor_elt
, va_gc
> *old_n
= n
;
16623 vec_alloc (n
, newlen
);
16624 FOR_EACH_VEC_ELT (*old_n
, idx
, ce
)
16626 if (TREE_CODE (ce
->value
) == TREE_VEC
)
16628 int i
, len
= TREE_VEC_LENGTH (ce
->value
);
16629 for (i
= 0; i
< len
; ++i
)
16630 CONSTRUCTOR_APPEND_ELT (n
, 0,
16631 TREE_VEC_ELT (ce
->value
, i
));
16634 CONSTRUCTOR_APPEND_ELT (n
, 0, ce
->value
);
16638 r
= build_constructor (init_list_type_node
, n
);
16639 CONSTRUCTOR_IS_DIRECT_INIT (r
) = CONSTRUCTOR_IS_DIRECT_INIT (t
);
16641 if (TREE_HAS_CONSTRUCTOR (t
))
16642 RETURN (finish_compound_literal (type
, r
, complain
));
16644 TREE_TYPE (r
) = type
;
16650 tree operand_0
= TREE_OPERAND (t
, 0);
16651 if (TYPE_P (operand_0
))
16653 operand_0
= tsubst (operand_0
, args
, complain
, in_decl
);
16654 RETURN (get_typeid (operand_0
, complain
));
16658 operand_0
= RECUR (operand_0
);
16659 RETURN (build_typeid (operand_0
, complain
));
16666 else if (DECL_PACK_P (t
))
16668 /* We don't build decls for an instantiation of a
16669 variadic capture proxy, we instantiate the elements
16671 gcc_assert (DECL_HAS_VALUE_EXPR_P (t
));
16672 return RECUR (DECL_VALUE_EXPR (t
));
16678 tree r
= tsubst_copy (t
, args
, complain
, in_decl
);
16679 /* ??? We're doing a subset of finish_id_expression here. */
16681 && !processing_template_decl
16682 && !cp_unevaluated_operand
16683 && (TREE_STATIC (r
) || DECL_EXTERNAL (r
))
16684 && CP_DECL_THREAD_LOCAL_P (r
))
16686 if (tree wrap
= get_tls_wrapper_fn (r
))
16687 /* Replace an evaluated use of the thread_local variable with
16688 a call to its wrapper. */
16689 r
= build_cxx_call (wrap
, 0, NULL
, tf_warning_or_error
);
16691 else if (outer_automatic_var_p (r
))
16693 r
= process_outer_var_ref (r
, complain
);
16694 if (is_capture_proxy (r
))
16695 register_local_specialization (r
, t
);
16698 if (TREE_CODE (TREE_TYPE (t
)) != REFERENCE_TYPE
)
16699 /* If the original type was a reference, we'll be wrapped in
16700 the appropriate INDIRECT_REF. */
16701 r
= convert_from_reference (r
);
16707 tree op0
= RECUR (TREE_OPERAND (t
, 0));
16708 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
16709 RETURN (build_x_va_arg (EXPR_LOCATION (t
), op0
, type
));
16712 case OFFSETOF_EXPR
:
16713 RETURN (finish_offsetof (RECUR (TREE_OPERAND (t
, 0)),
16714 EXPR_LOCATION (t
)));
16718 tree type1
= tsubst (TRAIT_EXPR_TYPE1 (t
), args
,
16719 complain
, in_decl
);
16721 tree type2
= TRAIT_EXPR_TYPE2 (t
);
16722 if (type2
&& TREE_CODE (type2
) == TREE_LIST
)
16723 type2
= RECUR (type2
);
16725 type2
= tsubst (type2
, args
, complain
, in_decl
);
16727 RETURN (finish_trait_expr (TRAIT_EXPR_KIND (t
), type1
, type2
));
16732 tree old_stmt_expr
= cur_stmt_expr
;
16733 tree stmt_expr
= begin_stmt_expr ();
16735 cur_stmt_expr
= stmt_expr
;
16736 tsubst_expr (STMT_EXPR_STMT (t
), args
, complain
, in_decl
,
16737 integral_constant_expression_p
);
16738 stmt_expr
= finish_stmt_expr (stmt_expr
, false);
16739 cur_stmt_expr
= old_stmt_expr
;
16741 /* If the resulting list of expression statement is empty,
16742 fold it further into void_node. */
16743 if (empty_expr_stmt_p (stmt_expr
))
16744 stmt_expr
= void_node
;
16746 RETURN (stmt_expr
);
16751 tree r
= build_lambda_expr ();
16753 tree type
= tsubst (LAMBDA_EXPR_CLOSURE (t
), args
, complain
, NULL_TREE
);
16754 LAMBDA_EXPR_CLOSURE (r
) = type
;
16755 CLASSTYPE_LAMBDA_EXPR (type
) = r
;
16757 LAMBDA_EXPR_LOCATION (r
)
16758 = LAMBDA_EXPR_LOCATION (t
);
16759 LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (r
)
16760 = LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (t
);
16761 LAMBDA_EXPR_MUTABLE_P (r
) = LAMBDA_EXPR_MUTABLE_P (t
);
16762 LAMBDA_EXPR_DISCRIMINATOR (r
)
16763 = (LAMBDA_EXPR_DISCRIMINATOR (t
));
16764 tree scope
= LAMBDA_EXPR_EXTRA_SCOPE (t
);
16766 /* No substitution needed. */;
16767 else if (VAR_OR_FUNCTION_DECL_P (scope
))
16768 /* For a function or variable scope, we want to use tsubst so that we
16769 don't complain about referring to an auto before deduction. */
16770 scope
= tsubst (scope
, args
, complain
, in_decl
);
16771 else if (TREE_CODE (scope
) == PARM_DECL
)
16773 /* Look up the parameter we want directly, as tsubst_copy
16774 doesn't do what we need. */
16775 tree fn
= tsubst (DECL_CONTEXT (scope
), args
, complain
, in_decl
);
16776 tree parm
= FUNCTION_FIRST_USER_PARM (fn
);
16777 while (DECL_PARM_INDEX (parm
) != DECL_PARM_INDEX (scope
))
16778 parm
= DECL_CHAIN (parm
);
16780 /* FIXME Work around the parm not having DECL_CONTEXT set. */
16781 if (DECL_CONTEXT (scope
) == NULL_TREE
)
16782 DECL_CONTEXT (scope
) = fn
;
16784 else if (TREE_CODE (scope
) == FIELD_DECL
)
16785 /* For a field, use tsubst_copy so that we look up the existing field
16786 rather than build a new one. */
16787 scope
= RECUR (scope
);
16789 gcc_unreachable ();
16790 LAMBDA_EXPR_EXTRA_SCOPE (r
) = scope
;
16791 LAMBDA_EXPR_RETURN_TYPE (r
)
16792 = tsubst (LAMBDA_EXPR_RETURN_TYPE (t
), args
, complain
, in_decl
);
16794 gcc_assert (LAMBDA_EXPR_THIS_CAPTURE (t
) == NULL_TREE
16795 && LAMBDA_EXPR_PENDING_PROXIES (t
) == NULL
);
16797 /* Do this again now that LAMBDA_EXPR_EXTRA_SCOPE is set. */
16798 determine_visibility (TYPE_NAME (type
));
16799 /* Now that we know visibility, instantiate the type so we have a
16800 declaration of the op() for later calls to lambda_function. */
16801 complete_type (type
);
16803 LAMBDA_EXPR_THIS_CAPTURE (r
) = NULL_TREE
;
16805 insert_pending_capture_proxies ();
16807 RETURN (build_lambda_object (r
));
16811 /* We can get here for a constant initializer of non-dependent type.
16812 FIXME stop folding in cp_parser_initializer_clause. */
16814 tree r
= get_target_expr_sfinae (RECUR (TARGET_EXPR_INITIAL (t
)),
16819 case TRANSACTION_EXPR
:
16820 RETURN (tsubst_expr(t
, args
, complain
, in_decl
,
16821 integral_constant_expression_p
));
16824 RETURN (finish_parenthesized_expr (RECUR (TREE_OPERAND (t
, 0))));
16826 case VEC_PERM_EXPR
:
16828 tree op0
= RECUR (TREE_OPERAND (t
, 0));
16829 tree op1
= RECUR (TREE_OPERAND (t
, 1));
16830 tree op2
= RECUR (TREE_OPERAND (t
, 2));
16831 RETURN (build_x_vec_perm_expr (input_location
, op0
, op1
, op2
,
16835 case REQUIRES_EXPR
:
16836 RETURN (tsubst_requires_expr (t
, args
, complain
, in_decl
));
16839 /* Handle Objective-C++ constructs, if appropriate. */
16842 = objcp_tsubst_copy_and_build (t
, args
, complain
,
16843 in_decl
, /*function_p=*/false);
16847 RETURN (tsubst_copy (t
, args
, complain
, in_decl
));
16853 input_location
= loc
;
16857 /* Verify that the instantiated ARGS are valid. For type arguments,
16858 make sure that the type's linkage is ok. For non-type arguments,
16859 make sure they are constants if they are integral or enumerations.
16860 Emit an error under control of COMPLAIN, and return TRUE on error. */
16863 check_instantiated_arg (tree tmpl
, tree t
, tsubst_flags_t complain
)
16865 if (dependent_template_arg_p (t
))
16867 if (ARGUMENT_PACK_P (t
))
16869 tree vec
= ARGUMENT_PACK_ARGS (t
);
16870 int len
= TREE_VEC_LENGTH (vec
);
16871 bool result
= false;
16874 for (i
= 0; i
< len
; ++i
)
16875 if (check_instantiated_arg (tmpl
, TREE_VEC_ELT (vec
, i
), complain
))
16879 else if (TYPE_P (t
))
16881 /* [basic.link]: A name with no linkage (notably, the name
16882 of a class or enumeration declared in a local scope)
16883 shall not be used to declare an entity with linkage.
16884 This implies that names with no linkage cannot be used as
16887 DR 757 relaxes this restriction for C++0x. */
16888 tree nt
= (cxx_dialect
> cxx98
? NULL_TREE
16889 : no_linkage_check (t
, /*relaxed_p=*/false));
16893 /* DR 488 makes use of a type with no linkage cause
16894 type deduction to fail. */
16895 if (complain
& tf_error
)
16897 if (TYPE_ANONYMOUS_P (nt
))
16898 error ("%qT is/uses anonymous type", t
);
16900 error ("template argument for %qD uses local type %qT",
16905 /* In order to avoid all sorts of complications, we do not
16906 allow variably-modified types as template arguments. */
16907 else if (variably_modified_type_p (t
, NULL_TREE
))
16909 if (complain
& tf_error
)
16910 error ("%qT is a variably modified type", t
);
16914 /* Class template and alias template arguments should be OK. */
16915 else if (DECL_TYPE_TEMPLATE_P (t
))
16917 /* A non-type argument of integral or enumerated type must be a
16919 else if (TREE_TYPE (t
)
16920 && INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (t
))
16921 && !REFERENCE_REF_P (t
)
16922 && !TREE_CONSTANT (t
))
16924 if (complain
& tf_error
)
16925 error ("integral expression %qE is not constant", t
);
16932 check_instantiated_args (tree tmpl
, tree args
, tsubst_flags_t complain
)
16934 int ix
, len
= DECL_NTPARMS (tmpl
);
16935 bool result
= false;
16937 for (ix
= 0; ix
!= len
; ix
++)
16939 if (check_instantiated_arg (tmpl
, TREE_VEC_ELT (args
, ix
), complain
))
16942 if (result
&& (complain
& tf_error
))
16943 error (" trying to instantiate %qD", tmpl
);
16947 /* We're out of SFINAE context now, so generate diagnostics for the access
16948 errors we saw earlier when instantiating D from TMPL and ARGS. */
16951 recheck_decl_substitution (tree d
, tree tmpl
, tree args
)
16953 tree pattern
= DECL_TEMPLATE_RESULT (tmpl
);
16954 tree type
= TREE_TYPE (pattern
);
16955 location_t loc
= input_location
;
16957 push_access_scope (d
);
16958 push_deferring_access_checks (dk_no_deferred
);
16959 input_location
= DECL_SOURCE_LOCATION (pattern
);
16960 tsubst (type
, args
, tf_warning_or_error
, d
);
16961 input_location
= loc
;
16962 pop_deferring_access_checks ();
16963 pop_access_scope (d
);
16966 /* Instantiate the indicated variable, function, or alias template TMPL with
16967 the template arguments in TARG_PTR. */
16970 instantiate_template_1 (tree tmpl
, tree orig_args
, tsubst_flags_t complain
)
16972 tree targ_ptr
= orig_args
;
16976 bool access_ok
= true;
16978 if (tmpl
== error_mark_node
)
16979 return error_mark_node
;
16981 gcc_assert (TREE_CODE (tmpl
) == TEMPLATE_DECL
);
16983 /* If this function is a clone, handle it specially. */
16984 if (DECL_CLONED_FUNCTION_P (tmpl
))
16989 /* Use DECL_ABSTRACT_ORIGIN because only FUNCTION_DECLs have
16990 DECL_CLONED_FUNCTION. */
16991 spec
= instantiate_template (DECL_ABSTRACT_ORIGIN (tmpl
),
16992 targ_ptr
, complain
);
16993 if (spec
== error_mark_node
)
16994 return error_mark_node
;
16996 /* Look for the clone. */
16997 FOR_EACH_CLONE (clone
, spec
)
16998 if (DECL_NAME (clone
) == DECL_NAME (tmpl
))
17000 /* We should always have found the clone by now. */
17001 gcc_unreachable ();
17005 if (targ_ptr
== error_mark_node
)
17006 return error_mark_node
;
17008 /* Check to see if we already have this specialization. */
17009 gen_tmpl
= most_general_template (tmpl
);
17010 if (tmpl
!= gen_tmpl
)
17011 /* The TMPL is a partial instantiation. To get a full set of
17012 arguments we must add the arguments used to perform the
17013 partial instantiation. */
17014 targ_ptr
= add_outermost_template_args (DECL_TI_ARGS (tmpl
),
17017 /* It would be nice to avoid hashing here and then again in tsubst_decl,
17018 but it doesn't seem to be on the hot path. */
17019 spec
= retrieve_specialization (gen_tmpl
, targ_ptr
, 0);
17021 gcc_assert (tmpl
== gen_tmpl
17022 || ((fndecl
= retrieve_specialization (tmpl
, orig_args
, 0))
17024 || fndecl
== NULL_TREE
);
17026 if (spec
!= NULL_TREE
)
17028 if (FNDECL_HAS_ACCESS_ERRORS (spec
))
17030 if (complain
& tf_error
)
17031 recheck_decl_substitution (spec
, gen_tmpl
, targ_ptr
);
17032 return error_mark_node
;
17037 if (check_instantiated_args (gen_tmpl
, INNERMOST_TEMPLATE_ARGS (targ_ptr
),
17039 return error_mark_node
;
17041 /* We are building a FUNCTION_DECL, during which the access of its
17042 parameters and return types have to be checked. However this
17043 FUNCTION_DECL which is the desired context for access checking
17044 is not built yet. We solve this chicken-and-egg problem by
17045 deferring all checks until we have the FUNCTION_DECL. */
17046 push_deferring_access_checks (dk_deferred
);
17048 /* Instantiation of the function happens in the context of the function
17049 template, not the context of the overload resolution we're doing. */
17050 push_to_top_level ();
17051 /* If there are dependent arguments, e.g. because we're doing partial
17052 ordering, make sure processing_template_decl stays set. */
17053 if (uses_template_parms (targ_ptr
))
17054 ++processing_template_decl
;
17055 if (DECL_CLASS_SCOPE_P (gen_tmpl
))
17057 tree ctx
= tsubst_aggr_type (DECL_CONTEXT (gen_tmpl
), targ_ptr
,
17058 complain
, gen_tmpl
, true);
17059 push_nested_class (ctx
);
17062 tree pattern
= DECL_TEMPLATE_RESULT (gen_tmpl
);
17064 if (VAR_P (pattern
))
17066 /* We need to determine if we're using a partial or explicit
17067 specialization now, because the type of the variable could be
17069 tree tid
= lookup_template_variable (gen_tmpl
, targ_ptr
);
17070 tree elt
= most_specialized_partial_spec (tid
, complain
);
17071 if (elt
== error_mark_node
)
17072 pattern
= error_mark_node
;
17075 tmpl
= TREE_VALUE (elt
);
17076 pattern
= DECL_TEMPLATE_RESULT (tmpl
);
17077 targ_ptr
= TREE_PURPOSE (elt
);
17081 /* Substitute template parameters to obtain the specialization. */
17082 fndecl
= tsubst (pattern
, targ_ptr
, complain
, gen_tmpl
);
17083 if (DECL_CLASS_SCOPE_P (gen_tmpl
))
17084 pop_nested_class ();
17085 pop_from_top_level ();
17087 if (fndecl
== error_mark_node
)
17089 pop_deferring_access_checks ();
17090 return error_mark_node
;
17093 /* The DECL_TI_TEMPLATE should always be the immediate parent
17094 template, not the most general template. */
17095 DECL_TI_TEMPLATE (fndecl
) = tmpl
;
17096 DECL_TI_ARGS (fndecl
) = targ_ptr
;
17098 /* Now we know the specialization, compute access previously
17100 push_access_scope (fndecl
);
17101 if (!perform_deferred_access_checks (complain
))
17103 pop_access_scope (fndecl
);
17104 pop_deferring_access_checks ();
17106 /* If we've just instantiated the main entry point for a function,
17107 instantiate all the alternate entry points as well. We do this
17108 by cloning the instantiation of the main entry point, not by
17109 instantiating the template clones. */
17110 if (DECL_CHAIN (gen_tmpl
) && DECL_CLONED_FUNCTION_P (DECL_CHAIN (gen_tmpl
)))
17111 clone_function_decl (fndecl
, /*update_method_vec_p=*/0);
17115 if (!(complain
& tf_error
))
17117 /* Remember to reinstantiate when we're out of SFINAE so the user
17118 can see the errors. */
17119 FNDECL_HAS_ACCESS_ERRORS (fndecl
) = true;
17121 return error_mark_node
;
17126 /* Wrapper for instantiate_template_1. */
17129 instantiate_template (tree tmpl
, tree orig_args
, tsubst_flags_t complain
)
17132 timevar_push (TV_TEMPLATE_INST
);
17133 ret
= instantiate_template_1 (tmpl
, orig_args
, complain
);
17134 timevar_pop (TV_TEMPLATE_INST
);
17138 /* Instantiate the alias template TMPL with ARGS. Also push a template
17139 instantiation level, which instantiate_template doesn't do because
17140 functions and variables have sufficient context established by the
17144 instantiate_alias_template (tree tmpl
, tree args
, tsubst_flags_t complain
)
17146 struct pending_template
*old_last_pend
= last_pending_template
;
17147 struct tinst_level
*old_error_tinst
= last_error_tinst_level
;
17148 if (tmpl
== error_mark_node
|| args
== error_mark_node
)
17149 return error_mark_node
;
17150 tree tinst
= build_tree_list (tmpl
, args
);
17151 if (!push_tinst_level (tinst
))
17154 return error_mark_node
;
17158 coerce_innermost_template_parms (DECL_TEMPLATE_PARMS (tmpl
),
17159 args
, tmpl
, complain
,
17160 /*require_all_args=*/true,
17161 /*use_default_args=*/true);
17163 tree r
= instantiate_template (tmpl
, args
, complain
);
17164 pop_tinst_level ();
17165 /* We can't free this if a pending_template entry or last_error_tinst_level
17166 is pointing at it. */
17167 if (last_pending_template
== old_last_pend
17168 && last_error_tinst_level
== old_error_tinst
)
17174 /* PARM is a template parameter pack for FN. Returns true iff
17175 PARM is used in a deducible way in the argument list of FN. */
17178 pack_deducible_p (tree parm
, tree fn
)
17180 tree t
= FUNCTION_FIRST_USER_PARMTYPE (fn
);
17181 for (; t
; t
= TREE_CHAIN (t
))
17183 tree type
= TREE_VALUE (t
);
17185 if (!PACK_EXPANSION_P (type
))
17187 for (packs
= PACK_EXPANSION_PARAMETER_PACKS (type
);
17188 packs
; packs
= TREE_CHAIN (packs
))
17189 if (template_args_equal (TREE_VALUE (packs
), parm
))
17191 /* The template parameter pack is used in a function parameter
17192 pack. If this is the end of the parameter list, the
17193 template parameter pack is deducible. */
17194 if (TREE_CHAIN (t
) == void_list_node
)
17197 /* Otherwise, not. Well, it could be deduced from
17198 a non-pack parameter, but doing so would end up with
17199 a deduction mismatch, so don't bother. */
17203 /* The template parameter pack isn't used in any function parameter
17204 packs, but it might be used deeper, e.g. tuple<Args...>. */
17208 /* The FN is a TEMPLATE_DECL for a function. ARGS is an array with
17209 NARGS elements of the arguments that are being used when calling
17210 it. TARGS is a vector into which the deduced template arguments
17213 Returns either a FUNCTION_DECL for the matching specialization of FN or
17214 NULL_TREE if no suitable specialization can be found. If EXPLAIN_P is
17215 true, diagnostics will be printed to explain why it failed.
17217 If FN is a conversion operator, or we are trying to produce a specific
17218 specialization, RETURN_TYPE is the return type desired.
17220 The EXPLICIT_TARGS are explicit template arguments provided via a
17223 The parameter STRICT is one of:
17226 We are deducing arguments for a function call, as in
17227 [temp.deduct.call].
17230 We are deducing arguments for a conversion function, as in
17231 [temp.deduct.conv].
17234 We are deducing arguments when doing an explicit instantiation
17235 as in [temp.explicit], when determining an explicit specialization
17236 as in [temp.expl.spec], or when taking the address of a function
17237 template, as in [temp.deduct.funcaddr]. */
17240 fn_type_unification (tree fn
,
17241 tree explicit_targs
,
17244 unsigned int nargs
,
17246 unification_kind_t strict
,
17253 tree decl
= NULL_TREE
;
17254 tsubst_flags_t complain
= (explain_p
? tf_warning_or_error
: tf_none
);
17256 static int deduction_depth
;
17257 struct pending_template
*old_last_pend
= last_pending_template
;
17258 struct tinst_level
*old_error_tinst
= last_error_tinst_level
;
17259 tree tparms
= DECL_INNERMOST_TEMPLATE_PARMS (fn
);
17261 tree r
= error_mark_node
;
17264 complain
|= tf_decltype
;
17266 /* In C++0x, it's possible to have a function template whose type depends
17267 on itself recursively. This is most obvious with decltype, but can also
17268 occur with enumeration scope (c++/48969). So we need to catch infinite
17269 recursion and reject the substitution at deduction time; this function
17270 will return error_mark_node for any repeated substitution.
17272 This also catches excessive recursion such as when f<N> depends on
17273 f<N-1> across all integers, and returns error_mark_node for all the
17274 substitutions back up to the initial one.
17276 This is, of course, not reentrant. */
17277 if (excessive_deduction_depth
)
17278 return error_mark_node
;
17279 tinst
= build_tree_list (fn
, NULL_TREE
);
17282 gcc_assert (TREE_CODE (fn
) == TEMPLATE_DECL
);
17284 fntype
= TREE_TYPE (fn
);
17285 if (explicit_targs
)
17289 The specified template arguments must match the template
17290 parameters in kind (i.e., type, nontype, template), and there
17291 must not be more arguments than there are parameters;
17292 otherwise type deduction fails.
17294 Nontype arguments must match the types of the corresponding
17295 nontype template parameters, or must be convertible to the
17296 types of the corresponding nontype parameters as specified in
17297 _temp.arg.nontype_, otherwise type deduction fails.
17299 All references in the function type of the function template
17300 to the corresponding template parameters are replaced by the
17301 specified template argument values. If a substitution in a
17302 template parameter or in the function type of the function
17303 template results in an invalid type, type deduction fails. */
17304 int i
, len
= TREE_VEC_LENGTH (tparms
);
17305 location_t loc
= input_location
;
17306 bool incomplete
= false;
17308 /* Adjust any explicit template arguments before entering the
17309 substitution context. */
17311 = (coerce_template_parms (tparms
, explicit_targs
, NULL_TREE
,
17313 /*require_all_args=*/false,
17314 /*use_default_args=*/false));
17315 if (explicit_targs
== error_mark_node
)
17318 /* Substitute the explicit args into the function type. This is
17319 necessary so that, for instance, explicitly declared function
17320 arguments can match null pointed constants. If we were given
17321 an incomplete set of explicit args, we must not do semantic
17322 processing during substitution as we could create partial
17324 for (i
= 0; i
< len
; i
++)
17326 tree parm
= TREE_VALUE (TREE_VEC_ELT (tparms
, i
));
17327 bool parameter_pack
= false;
17328 tree targ
= TREE_VEC_ELT (explicit_targs
, i
);
17330 /* Dig out the actual parm. */
17331 if (TREE_CODE (parm
) == TYPE_DECL
17332 || TREE_CODE (parm
) == TEMPLATE_DECL
)
17334 parm
= TREE_TYPE (parm
);
17335 parameter_pack
= TEMPLATE_TYPE_PARAMETER_PACK (parm
);
17337 else if (TREE_CODE (parm
) == PARM_DECL
)
17339 parm
= DECL_INITIAL (parm
);
17340 parameter_pack
= TEMPLATE_PARM_PARAMETER_PACK (parm
);
17343 if (!parameter_pack
&& targ
== NULL_TREE
)
17344 /* No explicit argument for this template parameter. */
17347 if (parameter_pack
&& pack_deducible_p (parm
, fn
))
17349 /* Mark the argument pack as "incomplete". We could
17350 still deduce more arguments during unification.
17351 We remove this mark in type_unification_real. */
17354 ARGUMENT_PACK_INCOMPLETE_P(targ
) = 1;
17355 ARGUMENT_PACK_EXPLICIT_ARGS (targ
)
17356 = ARGUMENT_PACK_ARGS (targ
);
17359 /* We have some incomplete argument packs. */
17364 TREE_VALUE (tinst
) = explicit_targs
;
17365 if (!push_tinst_level (tinst
))
17367 excessive_deduction_depth
= true;
17370 processing_template_decl
+= incomplete
;
17371 input_location
= DECL_SOURCE_LOCATION (fn
);
17372 /* Ignore any access checks; we'll see them again in
17373 instantiate_template and they might have the wrong
17374 access path at this point. */
17375 push_deferring_access_checks (dk_deferred
);
17376 fntype
= tsubst (TREE_TYPE (fn
), explicit_targs
,
17377 complain
| tf_partial
, NULL_TREE
);
17378 pop_deferring_access_checks ();
17379 input_location
= loc
;
17380 processing_template_decl
-= incomplete
;
17381 pop_tinst_level ();
17383 if (fntype
== error_mark_node
)
17386 /* Place the explicitly specified arguments in TARGS. */
17387 for (i
= NUM_TMPL_ARGS (explicit_targs
); i
--;)
17388 TREE_VEC_ELT (targs
, i
) = TREE_VEC_ELT (explicit_targs
, i
);
17391 /* Never do unification on the 'this' parameter. */
17392 parms
= skip_artificial_parms_for (fn
, TYPE_ARG_TYPES (fntype
));
17398 parms
= tree_cons (NULL_TREE
, TREE_TYPE (fntype
), parms
);
17399 new_args
= XALLOCAVEC (tree
, nargs
+ 1);
17400 new_args
[0] = return_type
;
17401 memcpy (new_args
+ 1, args
, nargs
* sizeof (tree
));
17406 /* We allow incomplete unification without an error message here
17407 because the standard doesn't seem to explicitly prohibit it. Our
17408 callers must be ready to deal with unification failures in any
17411 TREE_VALUE (tinst
) = targs
;
17412 /* If we aren't explaining yet, push tinst context so we can see where
17413 any errors (e.g. from class instantiations triggered by instantiation
17414 of default template arguments) come from. If we are explaining, this
17415 context is redundant. */
17416 if (!explain_p
&& !push_tinst_level (tinst
))
17418 excessive_deduction_depth
= true;
17422 /* type_unification_real will pass back any access checks from default
17423 template argument substitution. */
17424 vec
<deferred_access_check
, va_gc
> *checks
;
17427 ok
= !type_unification_real (DECL_INNERMOST_TEMPLATE_PARMS (fn
),
17428 targs
, parms
, args
, nargs
, /*subr=*/0,
17429 strict
, flags
, &checks
, explain_p
);
17431 pop_tinst_level ();
17435 /* Now that we have bindings for all of the template arguments,
17436 ensure that the arguments deduced for the template template
17437 parameters have compatible template parameter lists. We cannot
17438 check this property before we have deduced all template
17439 arguments, because the template parameter types of a template
17440 template parameter might depend on prior template parameters
17441 deduced after the template template parameter. The following
17442 ill-formed example illustrates this issue:
17444 template<typename T, template<T> class C> void f(C<5>, T);
17446 template<int N> struct X {};
17449 f(X<5>(), 5l); // error: template argument deduction fails
17452 The template parameter list of 'C' depends on the template type
17453 parameter 'T', but 'C' is deduced to 'X' before 'T' is deduced to
17454 'long'. Thus, we can't check that 'C' cannot bind to 'X' at the
17455 time that we deduce 'C'. */
17456 if (!template_template_parm_bindings_ok_p
17457 (DECL_INNERMOST_TEMPLATE_PARMS (fn
), targs
))
17459 unify_inconsistent_template_template_parameters (explain_p
);
17463 /* All is well so far. Now, check:
17467 When all template arguments have been deduced, all uses of
17468 template parameters in nondeduced contexts are replaced with
17469 the corresponding deduced argument values. If the
17470 substitution results in an invalid type, as described above,
17471 type deduction fails. */
17472 TREE_VALUE (tinst
) = targs
;
17473 if (!push_tinst_level (tinst
))
17475 excessive_deduction_depth
= true;
17479 /* Also collect access checks from the instantiation. */
17480 reopen_deferring_access_checks (checks
);
17482 decl
= instantiate_template (fn
, targs
, complain
);
17484 checks
= get_deferred_access_checks ();
17485 pop_deferring_access_checks ();
17487 pop_tinst_level ();
17489 if (decl
== error_mark_node
)
17492 /* Now perform any access checks encountered during substitution. */
17493 push_access_scope (decl
);
17494 ok
= perform_access_checks (checks
, complain
);
17495 pop_access_scope (decl
);
17499 /* If we're looking for an exact match, check that what we got
17500 is indeed an exact match. It might not be if some template
17501 parameters are used in non-deduced contexts. But don't check
17502 for an exact match if we have dependent template arguments;
17503 in that case we're doing partial ordering, and we already know
17504 that we have two candidates that will provide the actual type. */
17505 if (strict
== DEDUCE_EXACT
&& !any_dependent_template_arguments_p (targs
))
17507 tree substed
= TREE_TYPE (decl
);
17511 = skip_artificial_parms_for (decl
, TYPE_ARG_TYPES (substed
));
17513 sarg
= tree_cons (NULL_TREE
, TREE_TYPE (substed
), sarg
);
17514 for (i
= 0; i
< nargs
&& sarg
; ++i
, sarg
= TREE_CHAIN (sarg
))
17515 if (!same_type_p (args
[i
], TREE_VALUE (sarg
)))
17517 unify_type_mismatch (explain_p
, args
[i
],
17518 TREE_VALUE (sarg
));
17527 if (excessive_deduction_depth
)
17529 if (deduction_depth
== 0)
17530 /* Reset once we're all the way out. */
17531 excessive_deduction_depth
= false;
17534 /* We can't free this if a pending_template entry or last_error_tinst_level
17535 is pointing at it. */
17536 if (last_pending_template
== old_last_pend
17537 && last_error_tinst_level
== old_error_tinst
)
17543 /* Adjust types before performing type deduction, as described in
17544 [temp.deduct.call] and [temp.deduct.conv]. The rules in these two
17545 sections are symmetric. PARM is the type of a function parameter
17546 or the return type of the conversion function. ARG is the type of
17547 the argument passed to the call, or the type of the value
17548 initialized with the result of the conversion function.
17549 ARG_EXPR is the original argument expression, which may be null. */
17552 maybe_adjust_types_for_deduction (unification_kind_t strict
,
17565 /* Swap PARM and ARG throughout the remainder of this
17566 function; the handling is precisely symmetric since PARM
17567 will initialize ARG rather than vice versa. */
17568 std::swap (parm
, arg
);
17572 /* Core issue #873: Do the DR606 thing (see below) for these cases,
17573 too, but here handle it by stripping the reference from PARM
17574 rather than by adding it to ARG. */
17575 if (TREE_CODE (*parm
) == REFERENCE_TYPE
17576 && TYPE_REF_IS_RVALUE (*parm
)
17577 && TREE_CODE (TREE_TYPE (*parm
)) == TEMPLATE_TYPE_PARM
17578 && cp_type_quals (TREE_TYPE (*parm
)) == TYPE_UNQUALIFIED
17579 && TREE_CODE (*arg
) == REFERENCE_TYPE
17580 && !TYPE_REF_IS_RVALUE (*arg
))
17581 *parm
= TREE_TYPE (*parm
);
17582 /* Nothing else to do in this case. */
17586 gcc_unreachable ();
17589 if (TREE_CODE (*parm
) != REFERENCE_TYPE
)
17591 /* [temp.deduct.call]
17593 If P is not a reference type:
17595 --If A is an array type, the pointer type produced by the
17596 array-to-pointer standard conversion (_conv.array_) is
17597 used in place of A for type deduction; otherwise,
17599 --If A is a function type, the pointer type produced by
17600 the function-to-pointer standard conversion
17601 (_conv.func_) is used in place of A for type deduction;
17604 --If A is a cv-qualified type, the top level
17605 cv-qualifiers of A's type are ignored for type
17607 if (TREE_CODE (*arg
) == ARRAY_TYPE
)
17608 *arg
= build_pointer_type (TREE_TYPE (*arg
));
17609 else if (TREE_CODE (*arg
) == FUNCTION_TYPE
)
17610 *arg
= build_pointer_type (*arg
);
17612 *arg
= TYPE_MAIN_VARIANT (*arg
);
17615 /* From C++0x [14.8.2.1/3 temp.deduct.call] (after DR606), "If P is
17616 of the form T&&, where T is a template parameter, and the argument
17617 is an lvalue, T is deduced as A& */
17618 if (TREE_CODE (*parm
) == REFERENCE_TYPE
17619 && TYPE_REF_IS_RVALUE (*parm
)
17620 && TREE_CODE (TREE_TYPE (*parm
)) == TEMPLATE_TYPE_PARM
17621 && cp_type_quals (TREE_TYPE (*parm
)) == TYPE_UNQUALIFIED
17622 && (arg_expr
? real_lvalue_p (arg_expr
)
17623 /* try_one_overload doesn't provide an arg_expr, but
17624 functions are always lvalues. */
17625 : TREE_CODE (*arg
) == FUNCTION_TYPE
))
17626 *arg
= build_reference_type (*arg
);
17628 /* [temp.deduct.call]
17630 If P is a cv-qualified type, the top level cv-qualifiers
17631 of P's type are ignored for type deduction. If P is a
17632 reference type, the type referred to by P is used for
17634 *parm
= TYPE_MAIN_VARIANT (*parm
);
17635 if (TREE_CODE (*parm
) == REFERENCE_TYPE
)
17637 *parm
= TREE_TYPE (*parm
);
17638 result
|= UNIFY_ALLOW_OUTER_MORE_CV_QUAL
;
17641 /* DR 322. For conversion deduction, remove a reference type on parm
17642 too (which has been swapped into ARG). */
17643 if (strict
== DEDUCE_CONV
&& TREE_CODE (*arg
) == REFERENCE_TYPE
)
17644 *arg
= TREE_TYPE (*arg
);
17649 /* Subroutine of unify_one_argument. PARM is a function parameter of a
17650 template which does contain any deducible template parameters; check if
17651 ARG is a suitable match for it. STRICT, FLAGS and EXPLAIN_P are as in
17652 unify_one_argument. */
17655 check_non_deducible_conversion (tree parm
, tree arg
, int strict
,
17656 int flags
, bool explain_p
)
17661 type
= TREE_TYPE (arg
);
17665 if (same_type_p (parm
, type
))
17666 return unify_success (explain_p
);
17668 if (strict
== DEDUCE_CONV
)
17670 if (can_convert_arg (type
, parm
, NULL_TREE
, flags
,
17671 explain_p
? tf_warning_or_error
: tf_none
))
17672 return unify_success (explain_p
);
17674 else if (strict
!= DEDUCE_EXACT
)
17676 if (can_convert_arg (parm
, type
,
17677 TYPE_P (arg
) ? NULL_TREE
: arg
,
17678 flags
, explain_p
? tf_warning_or_error
: tf_none
))
17679 return unify_success (explain_p
);
17682 if (strict
== DEDUCE_EXACT
)
17683 return unify_type_mismatch (explain_p
, parm
, arg
);
17685 return unify_arg_conversion (explain_p
, parm
, type
, arg
);
17688 static bool uses_deducible_template_parms (tree type
);
17690 /* Returns true iff the expression EXPR is one from which a template
17691 argument can be deduced. In other words, if it's an undecorated
17692 use of a template non-type parameter. */
17695 deducible_expression (tree expr
)
17697 return (TREE_CODE (expr
) == TEMPLATE_PARM_INDEX
);
17700 /* Returns true iff the array domain DOMAIN uses a template parameter in a
17701 deducible way; that is, if it has a max value of <PARM> - 1. */
17704 deducible_array_bound (tree domain
)
17706 if (domain
== NULL_TREE
)
17709 tree max
= TYPE_MAX_VALUE (domain
);
17710 if (TREE_CODE (max
) != MINUS_EXPR
)
17713 return deducible_expression (TREE_OPERAND (max
, 0));
17716 /* Returns true iff the template arguments ARGS use a template parameter
17717 in a deducible way. */
17720 deducible_template_args (tree args
)
17722 for (int i
= 0; i
< TREE_VEC_LENGTH (args
); ++i
)
17725 tree elt
= TREE_VEC_ELT (args
, i
);
17726 if (ARGUMENT_PACK_P (elt
))
17727 deducible
= deducible_template_args (ARGUMENT_PACK_ARGS (elt
));
17730 if (PACK_EXPANSION_P (elt
))
17731 elt
= PACK_EXPANSION_PATTERN (elt
);
17732 if (TREE_CODE (elt
) == TEMPLATE_TEMPLATE_PARM
)
17734 else if (TYPE_P (elt
))
17735 deducible
= uses_deducible_template_parms (elt
);
17737 deducible
= deducible_expression (elt
);
17745 /* Returns true iff TYPE contains any deducible references to template
17746 parameters, as per 14.8.2.5. */
17749 uses_deducible_template_parms (tree type
)
17751 if (PACK_EXPANSION_P (type
))
17752 type
= PACK_EXPANSION_PATTERN (type
);
17759 if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
17760 || TREE_CODE (type
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
17766 if (POINTER_TYPE_P (type
))
17767 return uses_deducible_template_parms (TREE_TYPE (type
));
17769 /* T[integer-constant ]
17771 if (TREE_CODE (type
) == ARRAY_TYPE
)
17772 return (uses_deducible_template_parms (TREE_TYPE (type
))
17773 || deducible_array_bound (TYPE_DOMAIN (type
)));
17785 if (TYPE_PTRMEM_P (type
))
17786 return (uses_deducible_template_parms (TYPE_PTRMEM_CLASS_TYPE (type
))
17787 || (uses_deducible_template_parms
17788 (TYPE_PTRMEM_POINTED_TO_TYPE (type
))));
17790 /* template-name <T> (where template-name refers to a class template)
17791 template-name <i> (where template-name refers to a class template) */
17792 if (CLASS_TYPE_P (type
)
17793 && CLASSTYPE_TEMPLATE_INFO (type
)
17794 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (type
)))
17795 return deducible_template_args (INNERMOST_TEMPLATE_ARGS
17796 (CLASSTYPE_TI_ARGS (type
)));
17801 if (TREE_CODE (type
) == FUNCTION_TYPE
17802 || TREE_CODE (type
) == METHOD_TYPE
)
17804 if (uses_deducible_template_parms (TREE_TYPE (type
)))
17806 tree parm
= TYPE_ARG_TYPES (type
);
17807 if (TREE_CODE (type
) == METHOD_TYPE
)
17808 parm
= TREE_CHAIN (parm
);
17809 for (; parm
; parm
= TREE_CHAIN (parm
))
17810 if (uses_deducible_template_parms (TREE_VALUE (parm
)))
17817 /* Subroutine of type_unification_real and unify_pack_expansion to
17818 handle unification of a single P/A pair. Parameters are as
17819 for those functions. */
17822 unify_one_argument (tree tparms
, tree targs
, tree parm
, tree arg
,
17823 int subr
, unification_kind_t strict
,
17826 tree arg_expr
= NULL_TREE
;
17829 if (arg
== error_mark_node
|| parm
== error_mark_node
)
17830 return unify_invalid (explain_p
);
17831 if (arg
== unknown_type_node
)
17832 /* We can't deduce anything from this, but we might get all the
17833 template args from other function args. */
17834 return unify_success (explain_p
);
17836 /* Implicit conversions (Clause 4) will be performed on a function
17837 argument to convert it to the type of the corresponding function
17838 parameter if the parameter type contains no template-parameters that
17839 participate in template argument deduction. */
17840 if (strict
!= DEDUCE_EXACT
17841 && TYPE_P (parm
) && !uses_deducible_template_parms (parm
))
17842 /* For function parameters with no deducible template parameters,
17843 just return. We'll check non-dependent conversions later. */
17844 return unify_success (explain_p
);
17849 arg_strict
= (UNIFY_ALLOW_OUTER_LEVEL
17850 | UNIFY_ALLOW_MORE_CV_QUAL
17851 | UNIFY_ALLOW_DERIVED
);
17855 arg_strict
= UNIFY_ALLOW_LESS_CV_QUAL
;
17859 arg_strict
= UNIFY_ALLOW_NONE
;
17863 gcc_unreachable ();
17866 /* We only do these transformations if this is the top-level
17867 parameter_type_list in a call or declaration matching; in other
17868 situations (nested function declarators, template argument lists) we
17869 won't be comparing a type to an expression, and we don't do any type
17875 gcc_assert (TREE_TYPE (arg
) != NULL_TREE
);
17876 if (type_unknown_p (arg
))
17878 /* [temp.deduct.type] A template-argument can be
17879 deduced from a pointer to function or pointer
17880 to member function argument if the set of
17881 overloaded functions does not contain function
17882 templates and at most one of a set of
17883 overloaded functions provides a unique
17886 if (resolve_overloaded_unification
17887 (tparms
, targs
, parm
, arg
, strict
,
17888 arg_strict
, explain_p
))
17889 return unify_success (explain_p
);
17890 return unify_overload_resolution_failure (explain_p
, arg
);
17894 arg
= unlowered_expr_type (arg
);
17895 if (arg
== error_mark_node
)
17896 return unify_invalid (explain_p
);
17900 maybe_adjust_types_for_deduction (strict
, &parm
, &arg
, arg_expr
);
17903 if ((TYPE_P (parm
) || TREE_CODE (parm
) == TEMPLATE_DECL
)
17904 != (TYPE_P (arg
) || TREE_CODE (arg
) == TEMPLATE_DECL
))
17905 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
17907 /* For deduction from an init-list we need the actual list. */
17908 if (arg_expr
&& BRACE_ENCLOSED_INITIALIZER_P (arg_expr
))
17910 return unify (tparms
, targs
, parm
, arg
, arg_strict
, explain_p
);
17913 /* Most parms like fn_type_unification.
17915 If SUBR is 1, we're being called recursively (to unify the
17916 arguments of a function or method parameter of a function
17919 CHECKS is a pointer to a vector of access checks encountered while
17920 substituting default template arguments. */
17923 type_unification_real (tree tparms
,
17927 unsigned int xnargs
,
17929 unification_kind_t strict
,
17931 vec
<deferred_access_check
, va_gc
> **checks
,
17936 int ntparms
= TREE_VEC_LENGTH (tparms
);
17937 int saw_undeduced
= 0;
17940 unsigned int nargs
;
17943 gcc_assert (TREE_CODE (tparms
) == TREE_VEC
);
17944 gcc_assert (xparms
== NULL_TREE
|| TREE_CODE (xparms
) == TREE_LIST
);
17945 gcc_assert (ntparms
> 0);
17947 /* Reset the number of non-defaulted template arguments contained
17949 NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
) = NULL_TREE
;
17957 while (parms
&& parms
!= void_list_node
17960 parm
= TREE_VALUE (parms
);
17962 if (TREE_CODE (parm
) == TYPE_PACK_EXPANSION
17963 && (!TREE_CHAIN (parms
) || TREE_CHAIN (parms
) == void_list_node
))
17964 /* For a function parameter pack that occurs at the end of the
17965 parameter-declaration-list, the type A of each remaining
17966 argument of the call is compared with the type P of the
17967 declarator-id of the function parameter pack. */
17970 parms
= TREE_CHAIN (parms
);
17972 if (TREE_CODE (parm
) == TYPE_PACK_EXPANSION
)
17973 /* For a function parameter pack that does not occur at the
17974 end of the parameter-declaration-list, the type of the
17975 parameter pack is a non-deduced context. */
17981 if (unify_one_argument (tparms
, targs
, parm
, arg
, subr
, strict
,
17987 && parms
!= void_list_node
17988 && TREE_CODE (TREE_VALUE (parms
)) == TYPE_PACK_EXPANSION
)
17990 /* Unify the remaining arguments with the pack expansion type. */
17992 tree parmvec
= make_tree_vec (1);
17994 /* Allocate a TREE_VEC and copy in all of the arguments */
17995 argvec
= make_tree_vec (nargs
- ia
);
17996 for (i
= 0; ia
< nargs
; ++ia
, ++i
)
17997 TREE_VEC_ELT (argvec
, i
) = args
[ia
];
17999 /* Copy the parameter into parmvec. */
18000 TREE_VEC_ELT (parmvec
, 0) = TREE_VALUE (parms
);
18001 if (unify_pack_expansion (tparms
, targs
, parmvec
, argvec
, strict
,
18002 /*subr=*/subr
, explain_p
))
18005 /* Advance to the end of the list of parameters. */
18006 parms
= TREE_CHAIN (parms
);
18009 /* Fail if we've reached the end of the parm list, and more args
18010 are present, and the parm list isn't variadic. */
18011 if (ia
< nargs
&& parms
== void_list_node
)
18012 return unify_too_many_arguments (explain_p
, nargs
, ia
);
18013 /* Fail if parms are left and they don't have default values and
18014 they aren't all deduced as empty packs (c++/57397). This is
18015 consistent with sufficient_parms_p. */
18016 if (parms
&& parms
!= void_list_node
18017 && TREE_PURPOSE (parms
) == NULL_TREE
)
18019 unsigned int count
= nargs
;
18024 type_pack_p
= TREE_CODE (TREE_VALUE (p
)) == TYPE_PACK_EXPANSION
;
18027 p
= TREE_CHAIN (p
);
18029 while (p
&& p
!= void_list_node
);
18030 if (count
!= nargs
)
18031 return unify_too_few_arguments (explain_p
, ia
, count
,
18037 tsubst_flags_t complain
= (explain_p
18038 ? tf_warning_or_error
18041 for (i
= 0; i
< ntparms
; i
++)
18043 tree targ
= TREE_VEC_ELT (targs
, i
);
18044 tree tparm
= TREE_VEC_ELT (tparms
, i
);
18046 /* Clear the "incomplete" flags on all argument packs now so that
18047 substituting them into later default arguments works. */
18048 if (targ
&& ARGUMENT_PACK_P (targ
))
18050 ARGUMENT_PACK_INCOMPLETE_P (targ
) = 0;
18051 ARGUMENT_PACK_EXPLICIT_ARGS (targ
) = NULL_TREE
;
18054 if (targ
|| tparm
== error_mark_node
)
18056 tparm
= TREE_VALUE (tparm
);
18058 /* If this is an undeduced nontype parameter that depends on
18059 a type parameter, try another pass; its type may have been
18060 deduced from a later argument than the one from which
18061 this parameter can be deduced. */
18062 if (TREE_CODE (tparm
) == PARM_DECL
18063 && uses_template_parms (TREE_TYPE (tparm
))
18064 && saw_undeduced
< 2)
18070 /* Core issue #226 (C++0x) [temp.deduct]:
18072 If a template argument has not been deduced, its
18073 default template argument, if any, is used.
18075 When we are in C++98 mode, TREE_PURPOSE will either
18076 be NULL_TREE or ERROR_MARK_NODE, so we do not need
18077 to explicitly check cxx_dialect here. */
18078 if (TREE_PURPOSE (TREE_VEC_ELT (tparms
, i
)))
18079 /* OK, there is a default argument. Wait until after the
18080 conversion check to do substitution. */
18083 /* If the type parameter is a parameter pack, then it will
18084 be deduced to an empty parameter pack. */
18085 if (template_parameter_pack_p (tparm
))
18089 if (TREE_CODE (tparm
) == TEMPLATE_PARM_INDEX
)
18091 arg
= make_node (NONTYPE_ARGUMENT_PACK
);
18092 TREE_TYPE (arg
) = TREE_TYPE (TEMPLATE_PARM_DECL (tparm
));
18093 TREE_CONSTANT (arg
) = 1;
18096 arg
= cxx_make_type (TYPE_ARGUMENT_PACK
);
18098 SET_ARGUMENT_PACK_ARGS (arg
, make_tree_vec (0));
18100 TREE_VEC_ELT (targs
, i
) = arg
;
18104 return unify_parameter_deduction_failure (explain_p
, tparm
);
18107 /* DR 1391: All parameters have args, now check non-dependent parms for
18109 if (saw_undeduced
< 2)
18110 for (ia
= 0, parms
= xparms
, args
= xargs
, nargs
= xnargs
;
18111 parms
&& parms
!= void_list_node
&& ia
< nargs
; )
18113 parm
= TREE_VALUE (parms
);
18115 if (TREE_CODE (parm
) == TYPE_PACK_EXPANSION
18116 && (!TREE_CHAIN (parms
)
18117 || TREE_CHAIN (parms
) == void_list_node
))
18118 /* For a function parameter pack that occurs at the end of the
18119 parameter-declaration-list, the type A of each remaining
18120 argument of the call is compared with the type P of the
18121 declarator-id of the function parameter pack. */
18124 parms
= TREE_CHAIN (parms
);
18126 if (TREE_CODE (parm
) == TYPE_PACK_EXPANSION
)
18127 /* For a function parameter pack that does not occur at the
18128 end of the parameter-declaration-list, the type of the
18129 parameter pack is a non-deduced context. */
18135 if (uses_template_parms (parm
))
18137 if (check_non_deducible_conversion (parm
, arg
, strict
, flags
,
18142 /* Now substitute into the default template arguments. */
18143 for (i
= 0; i
< ntparms
; i
++)
18145 tree targ
= TREE_VEC_ELT (targs
, i
);
18146 tree tparm
= TREE_VEC_ELT (tparms
, i
);
18148 if (targ
|| tparm
== error_mark_node
)
18150 tree parm
= TREE_VALUE (tparm
);
18152 if (TREE_CODE (parm
) == PARM_DECL
18153 && uses_template_parms (TREE_TYPE (parm
))
18154 && saw_undeduced
< 2)
18157 tree arg
= TREE_PURPOSE (tparm
);
18158 reopen_deferring_access_checks (*checks
);
18159 location_t save_loc
= input_location
;
18161 input_location
= DECL_SOURCE_LOCATION (parm
);
18162 arg
= tsubst_template_arg (arg
, targs
, complain
, NULL_TREE
);
18163 arg
= convert_template_argument (parm
, arg
, targs
, complain
,
18165 input_location
= save_loc
;
18166 *checks
= get_deferred_access_checks ();
18167 pop_deferring_access_checks ();
18168 if (arg
== error_mark_node
)
18172 TREE_VEC_ELT (targs
, i
) = arg
;
18173 /* The position of the first default template argument,
18174 is also the number of non-defaulted arguments in TARGS.
18176 if (!NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
))
18177 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
, i
);
18182 if (saw_undeduced
++ == 1)
18185 #ifdef ENABLE_CHECKING
18186 if (!NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
))
18187 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
, TREE_VEC_LENGTH (targs
));
18190 return unify_success (explain_p
);
18193 /* Subroutine of type_unification_real. Args are like the variables
18194 at the call site. ARG is an overloaded function (or template-id);
18195 we try deducing template args from each of the overloads, and if
18196 only one succeeds, we go with that. Modifies TARGS and returns
18197 true on success. */
18200 resolve_overloaded_unification (tree tparms
,
18204 unification_kind_t strict
,
18208 tree tempargs
= copy_node (targs
);
18210 tree goodfn
= NULL_TREE
;
18213 if (TREE_CODE (arg
) == ADDR_EXPR
)
18215 arg
= TREE_OPERAND (arg
, 0);
18221 if (TREE_CODE (arg
) == COMPONENT_REF
)
18222 /* Handle `&x' where `x' is some static or non-static member
18224 arg
= TREE_OPERAND (arg
, 1);
18226 if (TREE_CODE (arg
) == OFFSET_REF
)
18227 arg
= TREE_OPERAND (arg
, 1);
18229 /* Strip baselink information. */
18230 if (BASELINK_P (arg
))
18231 arg
= BASELINK_FUNCTIONS (arg
);
18233 if (TREE_CODE (arg
) == TEMPLATE_ID_EXPR
)
18235 /* If we got some explicit template args, we need to plug them into
18236 the affected templates before we try to unify, in case the
18237 explicit args will completely resolve the templates in question. */
18240 tree expl_subargs
= TREE_OPERAND (arg
, 1);
18241 arg
= TREE_OPERAND (arg
, 0);
18243 for (; arg
; arg
= OVL_NEXT (arg
))
18245 tree fn
= OVL_CURRENT (arg
);
18246 tree subargs
, elem
;
18248 if (TREE_CODE (fn
) != TEMPLATE_DECL
)
18251 subargs
= coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (fn
),
18252 expl_subargs
, NULL_TREE
, tf_none
,
18253 /*require_all_args=*/true,
18254 /*use_default_args=*/true);
18255 if (subargs
!= error_mark_node
18256 && !any_dependent_template_arguments_p (subargs
))
18258 elem
= TREE_TYPE (instantiate_template (fn
, subargs
, tf_none
));
18259 if (try_one_overload (tparms
, targs
, tempargs
, parm
,
18260 elem
, strict
, sub_strict
, addr_p
, explain_p
)
18261 && (!goodfn
|| !same_type_p (goodfn
, elem
)))
18270 /* If no templates (or more than one) are fully resolved by the
18271 explicit arguments, this template-id is a non-deduced context; it
18272 could still be OK if we deduce all template arguments for the
18273 enclosing call through other arguments. */
18277 else if (TREE_CODE (arg
) != OVERLOAD
18278 && TREE_CODE (arg
) != FUNCTION_DECL
)
18279 /* If ARG is, for example, "(0, &f)" then its type will be unknown
18280 -- but the deduction does not succeed because the expression is
18281 not just the function on its own. */
18284 for (; arg
; arg
= OVL_NEXT (arg
))
18285 if (try_one_overload (tparms
, targs
, tempargs
, parm
,
18286 TREE_TYPE (OVL_CURRENT (arg
)),
18287 strict
, sub_strict
, addr_p
, explain_p
)
18288 && (!goodfn
|| !decls_match (goodfn
, OVL_CURRENT (arg
))))
18290 goodfn
= OVL_CURRENT (arg
);
18294 /* [temp.deduct.type] A template-argument can be deduced from a pointer
18295 to function or pointer to member function argument if the set of
18296 overloaded functions does not contain function templates and at most
18297 one of a set of overloaded functions provides a unique match.
18299 So if we found multiple possibilities, we return success but don't
18300 deduce anything. */
18304 int i
= TREE_VEC_LENGTH (targs
);
18306 if (TREE_VEC_ELT (tempargs
, i
))
18308 tree old
= TREE_VEC_ELT (targs
, i
);
18309 tree new_
= TREE_VEC_ELT (tempargs
, i
);
18310 if (new_
&& old
&& ARGUMENT_PACK_P (old
)
18311 && ARGUMENT_PACK_EXPLICIT_ARGS (old
))
18312 /* Don't forget explicit template arguments in a pack. */
18313 ARGUMENT_PACK_EXPLICIT_ARGS (new_
)
18314 = ARGUMENT_PACK_EXPLICIT_ARGS (old
);
18315 TREE_VEC_ELT (targs
, i
) = new_
;
18324 /* Core DR 115: In contexts where deduction is done and fails, or in
18325 contexts where deduction is not done, if a template argument list is
18326 specified and it, along with any default template arguments, identifies
18327 a single function template specialization, then the template-id is an
18328 lvalue for the function template specialization. */
18331 resolve_nondeduced_context (tree orig_expr
)
18333 tree expr
, offset
, baselink
;
18336 if (!type_unknown_p (orig_expr
))
18341 offset
= NULL_TREE
;
18342 baselink
= NULL_TREE
;
18344 if (TREE_CODE (expr
) == ADDR_EXPR
)
18346 expr
= TREE_OPERAND (expr
, 0);
18349 if (TREE_CODE (expr
) == OFFSET_REF
)
18352 expr
= TREE_OPERAND (expr
, 1);
18354 if (BASELINK_P (expr
))
18357 expr
= BASELINK_FUNCTIONS (expr
);
18360 if (TREE_CODE (expr
) == TEMPLATE_ID_EXPR
)
18363 tree goodfn
= NULL_TREE
;
18365 /* If we got some explicit template args, we need to plug them into
18366 the affected templates before we try to unify, in case the
18367 explicit args will completely resolve the templates in question. */
18369 tree expl_subargs
= TREE_OPERAND (expr
, 1);
18370 tree arg
= TREE_OPERAND (expr
, 0);
18371 tree badfn
= NULL_TREE
;
18372 tree badargs
= NULL_TREE
;
18374 for (; arg
; arg
= OVL_NEXT (arg
))
18376 tree fn
= OVL_CURRENT (arg
);
18377 tree subargs
, elem
;
18379 if (TREE_CODE (fn
) != TEMPLATE_DECL
)
18382 subargs
= coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (fn
),
18383 expl_subargs
, NULL_TREE
, tf_none
,
18384 /*require_all_args=*/true,
18385 /*use_default_args=*/true);
18386 if (subargs
!= error_mark_node
18387 && !any_dependent_template_arguments_p (subargs
))
18389 elem
= instantiate_template (fn
, subargs
, tf_none
);
18390 if (elem
== error_mark_node
)
18395 else if (elem
&& (!goodfn
|| !decls_match (goodfn
, elem
)))
18404 mark_used (goodfn
);
18407 expr
= build_baselink (BASELINK_BINFO (baselink
),
18408 BASELINK_ACCESS_BINFO (baselink
),
18409 expr
, BASELINK_OPTYPE (baselink
));
18413 = TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (offset
, 0)));
18414 expr
= build_offset_ref (base
, expr
, addr
, tf_warning_or_error
);
18417 expr
= cp_build_addr_expr (expr
, tf_warning_or_error
);
18420 else if (good
== 0 && badargs
)
18421 /* There were no good options and at least one bad one, so let the
18422 user know what the problem is. */
18423 instantiate_template (badfn
, badargs
, tf_warning_or_error
);
18428 /* Subroutine of resolve_overloaded_unification; does deduction for a single
18429 overload. Fills TARGS with any deduced arguments, or error_mark_node if
18430 different overloads deduce different arguments for a given parm.
18431 ADDR_P is true if the expression for which deduction is being
18432 performed was of the form "& fn" rather than simply "fn".
18434 Returns 1 on success. */
18437 try_one_overload (tree tparms
,
18442 unification_kind_t strict
,
18451 if (arg
== error_mark_node
)
18454 /* [temp.deduct.type] A template-argument can be deduced from a pointer
18455 to function or pointer to member function argument if the set of
18456 overloaded functions does not contain function templates and at most
18457 one of a set of overloaded functions provides a unique match.
18459 So if this is a template, just return success. */
18461 if (uses_template_parms (arg
))
18464 if (TREE_CODE (arg
) == METHOD_TYPE
)
18465 arg
= build_ptrmemfunc_type (build_pointer_type (arg
));
18467 arg
= build_pointer_type (arg
);
18469 sub_strict
|= maybe_adjust_types_for_deduction (strict
, &parm
, &arg
, NULL
);
18471 /* We don't copy orig_targs for this because if we have already deduced
18472 some template args from previous args, unify would complain when we
18473 try to deduce a template parameter for the same argument, even though
18474 there isn't really a conflict. */
18475 nargs
= TREE_VEC_LENGTH (targs
);
18476 tempargs
= make_tree_vec (nargs
);
18478 if (unify (tparms
, tempargs
, parm
, arg
, sub_strict
, explain_p
))
18481 /* First make sure we didn't deduce anything that conflicts with
18482 explicitly specified args. */
18483 for (i
= nargs
; i
--; )
18485 tree elt
= TREE_VEC_ELT (tempargs
, i
);
18486 tree oldelt
= TREE_VEC_ELT (orig_targs
, i
);
18490 else if (uses_template_parms (elt
))
18491 /* Since we're unifying against ourselves, we will fill in
18492 template args used in the function parm list with our own
18493 template parms. Discard them. */
18494 TREE_VEC_ELT (tempargs
, i
) = NULL_TREE
;
18495 else if (oldelt
&& !template_args_equal (oldelt
, elt
))
18499 for (i
= nargs
; i
--; )
18501 tree elt
= TREE_VEC_ELT (tempargs
, i
);
18504 TREE_VEC_ELT (targs
, i
) = elt
;
18510 /* PARM is a template class (perhaps with unbound template
18511 parameters). ARG is a fully instantiated type. If ARG can be
18512 bound to PARM, return ARG, otherwise return NULL_TREE. TPARMS and
18513 TARGS are as for unify. */
18516 try_class_unification (tree tparms
, tree targs
, tree parm
, tree arg
,
18519 tree copy_of_targs
;
18521 if (!CLASSTYPE_TEMPLATE_INFO (arg
)
18522 || (most_general_template (CLASSTYPE_TI_TEMPLATE (arg
))
18523 != most_general_template (CLASSTYPE_TI_TEMPLATE (parm
))))
18526 /* We need to make a new template argument vector for the call to
18527 unify. If we used TARGS, we'd clutter it up with the result of
18528 the attempted unification, even if this class didn't work out.
18529 We also don't want to commit ourselves to all the unifications
18530 we've already done, since unification is supposed to be done on
18531 an argument-by-argument basis. In other words, consider the
18532 following pathological case:
18534 template <int I, int J, int K>
18537 template <int I, int J>
18538 struct S<I, J, 2> : public S<I, I, I>, S<J, J, J> {};
18540 template <int I, int J, int K>
18541 void f(S<I, J, K>, S<I, I, I>);
18550 Now, by the time we consider the unification involving `s2', we
18551 already know that we must have `f<0, 0, 0>'. But, even though
18552 `S<0, 1, 2>' is derived from `S<0, 0, 0>', the code is invalid
18553 because there are two ways to unify base classes of S<0, 1, 2>
18554 with S<I, I, I>. If we kept the already deduced knowledge, we
18555 would reject the possibility I=1. */
18556 copy_of_targs
= make_tree_vec (TREE_VEC_LENGTH (targs
));
18558 /* If unification failed, we're done. */
18559 if (unify (tparms
, copy_of_targs
, CLASSTYPE_TI_ARGS (parm
),
18560 CLASSTYPE_TI_ARGS (arg
), UNIFY_ALLOW_NONE
, explain_p
))
18566 /* Given a template type PARM and a class type ARG, find the unique
18567 base type in ARG that is an instance of PARM. We do not examine
18568 ARG itself; only its base-classes. If there is not exactly one
18569 appropriate base class, return NULL_TREE. PARM may be the type of
18570 a partial specialization, as well as a plain template type. Used
18573 static enum template_base_result
18574 get_template_base (tree tparms
, tree targs
, tree parm
, tree arg
,
18575 bool explain_p
, tree
*result
)
18577 tree rval
= NULL_TREE
;
18580 gcc_assert (RECORD_OR_UNION_CODE_P (TREE_CODE (arg
)));
18582 binfo
= TYPE_BINFO (complete_type (arg
));
18585 /* The type could not be completed. */
18586 *result
= NULL_TREE
;
18587 return tbr_incomplete_type
;
18590 /* Walk in inheritance graph order. The search order is not
18591 important, and this avoids multiple walks of virtual bases. */
18592 for (binfo
= TREE_CHAIN (binfo
); binfo
; binfo
= TREE_CHAIN (binfo
))
18594 tree r
= try_class_unification (tparms
, targs
, parm
,
18595 BINFO_TYPE (binfo
), explain_p
);
18599 /* If there is more than one satisfactory baseclass, then:
18603 If they yield more than one possible deduced A, the type
18607 if (rval
&& !same_type_p (r
, rval
))
18609 *result
= NULL_TREE
;
18610 return tbr_ambiguous_baseclass
;
18618 return tbr_success
;
18621 /* Returns the level of DECL, which declares a template parameter. */
18624 template_decl_level (tree decl
)
18626 switch (TREE_CODE (decl
))
18629 case TEMPLATE_DECL
:
18630 return TEMPLATE_TYPE_LEVEL (TREE_TYPE (decl
));
18633 return TEMPLATE_PARM_LEVEL (DECL_INITIAL (decl
));
18636 gcc_unreachable ();
18641 /* Decide whether ARG can be unified with PARM, considering only the
18642 cv-qualifiers of each type, given STRICT as documented for unify.
18643 Returns nonzero iff the unification is OK on that basis. */
18646 check_cv_quals_for_unify (int strict
, tree arg
, tree parm
)
18648 int arg_quals
= cp_type_quals (arg
);
18649 int parm_quals
= cp_type_quals (parm
);
18651 if (TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
18652 && !(strict
& UNIFY_ALLOW_OUTER_MORE_CV_QUAL
))
18654 /* Although a CVR qualifier is ignored when being applied to a
18655 substituted template parameter ([8.3.2]/1 for example), that
18656 does not allow us to unify "const T" with "int&" because both
18657 types are not of the form "cv-list T" [14.8.2.5 temp.deduct.type].
18658 It is ok when we're allowing additional CV qualifiers
18659 at the outer level [14.8.2.1]/3,1st bullet. */
18660 if ((TREE_CODE (arg
) == REFERENCE_TYPE
18661 || TREE_CODE (arg
) == FUNCTION_TYPE
18662 || TREE_CODE (arg
) == METHOD_TYPE
)
18663 && (parm_quals
& (TYPE_QUAL_CONST
| TYPE_QUAL_VOLATILE
)))
18666 if ((!POINTER_TYPE_P (arg
) && TREE_CODE (arg
) != TEMPLATE_TYPE_PARM
)
18667 && (parm_quals
& TYPE_QUAL_RESTRICT
))
18671 if (!(strict
& (UNIFY_ALLOW_MORE_CV_QUAL
| UNIFY_ALLOW_OUTER_MORE_CV_QUAL
))
18672 && (arg_quals
& parm_quals
) != parm_quals
)
18675 if (!(strict
& (UNIFY_ALLOW_LESS_CV_QUAL
| UNIFY_ALLOW_OUTER_LESS_CV_QUAL
))
18676 && (parm_quals
& arg_quals
) != arg_quals
)
18682 /* Determines the LEVEL and INDEX for the template parameter PARM. */
18684 template_parm_level_and_index (tree parm
, int* level
, int* index
)
18686 if (TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
18687 || TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
18688 || TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
18690 *index
= TEMPLATE_TYPE_IDX (parm
);
18691 *level
= TEMPLATE_TYPE_LEVEL (parm
);
18695 *index
= TEMPLATE_PARM_IDX (parm
);
18696 *level
= TEMPLATE_PARM_LEVEL (parm
);
18700 #define RECUR_AND_CHECK_FAILURE(TP, TA, P, A, S, EP) \
18702 if (unify (TP, TA, P, A, S, EP)) \
18706 /* Unifies the remaining arguments in PACKED_ARGS with the pack
18707 expansion at the end of PACKED_PARMS. Returns 0 if the type
18708 deduction succeeds, 1 otherwise. STRICT is the same as in
18709 unify. CALL_ARGS_P is true iff PACKED_ARGS is actually a function
18710 call argument list. We'll need to adjust the arguments to make them
18711 types. SUBR tells us if this is from a recursive call to
18712 type_unification_real, or for comparing two template argument
18716 unify_pack_expansion (tree tparms
, tree targs
, tree packed_parms
,
18717 tree packed_args
, unification_kind_t strict
,
18718 bool subr
, bool explain_p
)
18721 = TREE_VEC_ELT (packed_parms
, TREE_VEC_LENGTH (packed_parms
) - 1);
18722 tree pattern
= PACK_EXPANSION_PATTERN (parm
);
18723 tree pack
, packs
= NULL_TREE
;
18724 int i
, start
= TREE_VEC_LENGTH (packed_parms
) - 1;
18726 packed_args
= expand_template_argument_pack (packed_args
);
18728 int len
= TREE_VEC_LENGTH (packed_args
);
18730 /* Determine the parameter packs we will be deducing from the
18731 pattern, and record their current deductions. */
18732 for (pack
= PACK_EXPANSION_PARAMETER_PACKS (parm
);
18733 pack
; pack
= TREE_CHAIN (pack
))
18735 tree parm_pack
= TREE_VALUE (pack
);
18738 /* Determine the index and level of this parameter pack. */
18739 template_parm_level_and_index (parm_pack
, &level
, &idx
);
18741 /* Keep track of the parameter packs and their corresponding
18743 packs
= tree_cons (parm_pack
, TMPL_ARG (targs
, level
, idx
), packs
);
18744 TREE_TYPE (packs
) = make_tree_vec (len
- start
);
18747 /* Loop through all of the arguments that have not yet been
18748 unified and unify each with the pattern. */
18749 for (i
= start
; i
< len
; i
++)
18752 bool any_explicit
= false;
18753 tree arg
= TREE_VEC_ELT (packed_args
, i
);
18755 /* For each parameter pack, set its TMPL_ARG to either NULL_TREE
18756 or the element of its argument pack at the current index if
18757 this argument was explicitly specified. */
18758 for (pack
= packs
; pack
; pack
= TREE_CHAIN (pack
))
18762 template_parm_level_and_index (TREE_PURPOSE (pack
), &level
, &idx
);
18765 if (TREE_VALUE (pack
)
18766 && (pargs
= ARGUMENT_PACK_EXPLICIT_ARGS (TREE_VALUE (pack
)))
18767 && (i
- start
< TREE_VEC_LENGTH (pargs
)))
18769 any_explicit
= true;
18770 arg
= TREE_VEC_ELT (pargs
, i
- start
);
18772 TMPL_ARG (targs
, level
, idx
) = arg
;
18775 /* If we had explicit template arguments, substitute them into the
18776 pattern before deduction. */
18779 /* Some arguments might still be unspecified or dependent. */
18781 ++processing_template_decl
;
18782 dependent
= any_dependent_template_arguments_p (targs
);
18784 --processing_template_decl
;
18785 parm
= tsubst (pattern
, targs
,
18786 explain_p
? tf_warning_or_error
: tf_none
,
18789 --processing_template_decl
;
18790 if (parm
== error_mark_node
)
18796 /* Unify the pattern with the current argument. */
18797 if (unify_one_argument (tparms
, targs
, parm
, arg
, subr
, strict
,
18801 /* For each parameter pack, collect the deduced value. */
18802 for (pack
= packs
; pack
; pack
= TREE_CHAIN (pack
))
18805 template_parm_level_and_index (TREE_PURPOSE (pack
), &level
, &idx
);
18807 TREE_VEC_ELT (TREE_TYPE (pack
), i
- start
) =
18808 TMPL_ARG (targs
, level
, idx
);
18812 /* Verify that the results of unification with the parameter packs
18813 produce results consistent with what we've seen before, and make
18814 the deduced argument packs available. */
18815 for (pack
= packs
; pack
; pack
= TREE_CHAIN (pack
))
18817 tree old_pack
= TREE_VALUE (pack
);
18818 tree new_args
= TREE_TYPE (pack
);
18819 int i
, len
= TREE_VEC_LENGTH (new_args
);
18821 bool nondeduced_p
= false;
18823 /* By default keep the original deduced argument pack.
18824 If necessary, more specific code is going to update the
18825 resulting deduced argument later down in this function. */
18826 template_parm_level_and_index (TREE_PURPOSE (pack
), &level
, &idx
);
18827 TMPL_ARG (targs
, level
, idx
) = old_pack
;
18829 /* If NEW_ARGS contains any NULL_TREE entries, we didn't
18830 actually deduce anything. */
18831 for (i
= 0; i
< len
&& !nondeduced_p
; ++i
)
18832 if (TREE_VEC_ELT (new_args
, i
) == NULL_TREE
)
18833 nondeduced_p
= true;
18837 if (old_pack
&& ARGUMENT_PACK_INCOMPLETE_P (old_pack
))
18839 /* If we had fewer function args than explicit template args,
18840 just use the explicits. */
18841 tree explicit_args
= ARGUMENT_PACK_EXPLICIT_ARGS (old_pack
);
18842 int explicit_len
= TREE_VEC_LENGTH (explicit_args
);
18843 if (len
< explicit_len
)
18844 new_args
= explicit_args
;
18850 /* Build the deduced *_ARGUMENT_PACK. */
18851 if (TREE_CODE (TREE_PURPOSE (pack
)) == TEMPLATE_PARM_INDEX
)
18853 result
= make_node (NONTYPE_ARGUMENT_PACK
);
18854 TREE_TYPE (result
) =
18855 TREE_TYPE (TEMPLATE_PARM_DECL (TREE_PURPOSE (pack
)));
18856 TREE_CONSTANT (result
) = 1;
18859 result
= cxx_make_type (TYPE_ARGUMENT_PACK
);
18861 SET_ARGUMENT_PACK_ARGS (result
, new_args
);
18863 /* Note the deduced argument packs for this parameter
18865 TMPL_ARG (targs
, level
, idx
) = result
;
18867 else if (ARGUMENT_PACK_INCOMPLETE_P (old_pack
)
18868 && (ARGUMENT_PACK_ARGS (old_pack
)
18869 == ARGUMENT_PACK_EXPLICIT_ARGS (old_pack
)))
18871 /* We only had the explicitly-provided arguments before, but
18872 now we have a complete set of arguments. */
18873 tree explicit_args
= ARGUMENT_PACK_EXPLICIT_ARGS (old_pack
);
18875 SET_ARGUMENT_PACK_ARGS (old_pack
, new_args
);
18876 ARGUMENT_PACK_INCOMPLETE_P (old_pack
) = 1;
18877 ARGUMENT_PACK_EXPLICIT_ARGS (old_pack
) = explicit_args
;
18881 tree bad_old_arg
= NULL_TREE
, bad_new_arg
= NULL_TREE
;
18882 tree old_args
= ARGUMENT_PACK_ARGS (old_pack
);
18884 if (!comp_template_args_with_info (old_args
, new_args
,
18885 &bad_old_arg
, &bad_new_arg
))
18886 /* Inconsistent unification of this parameter pack. */
18887 return unify_parameter_pack_inconsistent (explain_p
,
18893 return unify_success (explain_p
);
18896 /* Handle unification of the domain of an array. PARM_DOM and ARG_DOM are
18897 INTEGER_TYPEs representing the TYPE_DOMAIN of ARRAY_TYPEs. The other
18898 parameters and return value are as for unify. */
18901 unify_array_domain (tree tparms
, tree targs
,
18902 tree parm_dom
, tree arg_dom
,
18910 /* Our representation of array types uses "N - 1" as the
18911 TYPE_MAX_VALUE for an array with "N" elements, if "N" is
18912 not an integer constant. We cannot unify arbitrarily
18913 complex expressions, so we eliminate the MINUS_EXPRs
18915 parm_max
= TYPE_MAX_VALUE (parm_dom
);
18916 parm_cst
= TREE_CODE (parm_max
) == INTEGER_CST
;
18919 gcc_assert (TREE_CODE (parm_max
) == MINUS_EXPR
);
18920 parm_max
= TREE_OPERAND (parm_max
, 0);
18922 arg_max
= TYPE_MAX_VALUE (arg_dom
);
18923 arg_cst
= TREE_CODE (arg_max
) == INTEGER_CST
;
18926 /* The ARG_MAX may not be a simple MINUS_EXPR, if we are
18927 trying to unify the type of a variable with the type
18928 of a template parameter. For example:
18930 template <unsigned int N>
18931 void f (char (&) [N]);
18938 Here, the type of the ARG will be "int [g(i)]", and
18939 may be a SAVE_EXPR, etc. */
18940 if (TREE_CODE (arg_max
) != MINUS_EXPR
)
18941 return unify_vla_arg (explain_p
, arg_dom
);
18942 arg_max
= TREE_OPERAND (arg_max
, 0);
18945 /* If only one of the bounds used a MINUS_EXPR, compensate
18946 by adding one to the other bound. */
18947 if (parm_cst
&& !arg_cst
)
18948 parm_max
= fold_build2_loc (input_location
, PLUS_EXPR
,
18952 else if (arg_cst
&& !parm_cst
)
18953 arg_max
= fold_build2_loc (input_location
, PLUS_EXPR
,
18958 return unify (tparms
, targs
, parm_max
, arg_max
,
18959 UNIFY_ALLOW_INTEGER
, explain_p
);
18962 /* Deduce the value of template parameters. TPARMS is the (innermost)
18963 set of template parameters to a template. TARGS is the bindings
18964 for those template parameters, as determined thus far; TARGS may
18965 include template arguments for outer levels of template parameters
18966 as well. PARM is a parameter to a template function, or a
18967 subcomponent of that parameter; ARG is the corresponding argument.
18968 This function attempts to match PARM with ARG in a manner
18969 consistent with the existing assignments in TARGS. If more values
18970 are deduced, then TARGS is updated.
18972 Returns 0 if the type deduction succeeds, 1 otherwise. The
18973 parameter STRICT is a bitwise or of the following flags:
18976 Require an exact match between PARM and ARG.
18977 UNIFY_ALLOW_MORE_CV_QUAL:
18978 Allow the deduced ARG to be more cv-qualified (by qualification
18979 conversion) than ARG.
18980 UNIFY_ALLOW_LESS_CV_QUAL:
18981 Allow the deduced ARG to be less cv-qualified than ARG.
18982 UNIFY_ALLOW_DERIVED:
18983 Allow the deduced ARG to be a template base class of ARG,
18984 or a pointer to a template base class of the type pointed to by
18986 UNIFY_ALLOW_INTEGER:
18987 Allow any integral type to be deduced. See the TEMPLATE_PARM_INDEX
18988 case for more information.
18989 UNIFY_ALLOW_OUTER_LEVEL:
18990 This is the outermost level of a deduction. Used to determine validity
18991 of qualification conversions. A valid qualification conversion must
18992 have const qualified pointers leading up to the inner type which
18993 requires additional CV quals, except at the outer level, where const
18994 is not required [conv.qual]. It would be normal to set this flag in
18995 addition to setting UNIFY_ALLOW_MORE_CV_QUAL.
18996 UNIFY_ALLOW_OUTER_MORE_CV_QUAL:
18997 This is the outermost level of a deduction, and PARM can be more CV
18998 qualified at this point.
18999 UNIFY_ALLOW_OUTER_LESS_CV_QUAL:
19000 This is the outermost level of a deduction, and PARM can be less CV
19001 qualified at this point. */
19004 unify (tree tparms
, tree targs
, tree parm
, tree arg
, int strict
,
19010 int strict_in
= strict
;
19012 /* I don't think this will do the right thing with respect to types.
19013 But the only case I've seen it in so far has been array bounds, where
19014 signedness is the only information lost, and I think that will be
19016 while (TREE_CODE (parm
) == NOP_EXPR
)
19017 parm
= TREE_OPERAND (parm
, 0);
19019 if (arg
== error_mark_node
)
19020 return unify_invalid (explain_p
);
19021 if (arg
== unknown_type_node
19022 || arg
== init_list_type_node
)
19023 /* We can't deduce anything from this, but we might get all the
19024 template args from other function args. */
19025 return unify_success (explain_p
);
19027 /* If PARM uses template parameters, then we can't bail out here,
19028 even if ARG == PARM, since we won't record unifications for the
19029 template parameters. We might need them if we're trying to
19030 figure out which of two things is more specialized. */
19031 if (arg
== parm
&& !uses_template_parms (parm
))
19032 return unify_success (explain_p
);
19034 /* Handle init lists early, so the rest of the function can assume
19035 we're dealing with a type. */
19036 if (BRACE_ENCLOSED_INITIALIZER_P (arg
))
19040 tree orig_parm
= parm
;
19042 /* Replace T with std::initializer_list<T> for deduction. */
19043 if (TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
19044 && flag_deduce_init_list
)
19045 parm
= listify (parm
);
19047 if (!is_std_init_list (parm
)
19048 && TREE_CODE (parm
) != ARRAY_TYPE
)
19049 /* We can only deduce from an initializer list argument if the
19050 parameter is std::initializer_list or an array; otherwise this
19051 is a non-deduced context. */
19052 return unify_success (explain_p
);
19054 if (TREE_CODE (parm
) == ARRAY_TYPE
)
19055 elttype
= TREE_TYPE (parm
);
19058 elttype
= TREE_VEC_ELT (CLASSTYPE_TI_ARGS (parm
), 0);
19059 /* Deduction is defined in terms of a single type, so just punt
19060 on the (bizarre) std::initializer_list<T...>. */
19061 if (PACK_EXPANSION_P (elttype
))
19062 return unify_success (explain_p
);
19065 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (arg
), i
, elt
)
19067 int elt_strict
= strict
;
19069 if (elt
== error_mark_node
)
19070 return unify_invalid (explain_p
);
19072 if (!BRACE_ENCLOSED_INITIALIZER_P (elt
))
19074 tree type
= TREE_TYPE (elt
);
19075 if (type
== error_mark_node
)
19076 return unify_invalid (explain_p
);
19077 /* It should only be possible to get here for a call. */
19078 gcc_assert (elt_strict
& UNIFY_ALLOW_OUTER_LEVEL
);
19079 elt_strict
|= maybe_adjust_types_for_deduction
19080 (DEDUCE_CALL
, &elttype
, &type
, elt
);
19084 RECUR_AND_CHECK_FAILURE (tparms
, targs
, elttype
, elt
, elt_strict
,
19088 if (TREE_CODE (parm
) == ARRAY_TYPE
19089 && deducible_array_bound (TYPE_DOMAIN (parm
)))
19091 /* Also deduce from the length of the initializer list. */
19092 tree max
= size_int (CONSTRUCTOR_NELTS (arg
));
19093 tree idx
= compute_array_index_type (NULL_TREE
, max
, tf_none
);
19094 if (idx
== error_mark_node
)
19095 return unify_invalid (explain_p
);
19096 return unify_array_domain (tparms
, targs
, TYPE_DOMAIN (parm
),
19100 /* If the std::initializer_list<T> deduction worked, replace the
19101 deduced A with std::initializer_list<A>. */
19102 if (orig_parm
!= parm
)
19104 idx
= TEMPLATE_TYPE_IDX (orig_parm
);
19105 targ
= TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
);
19106 targ
= listify (targ
);
19107 TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
) = targ
;
19109 return unify_success (explain_p
);
19112 /* Immediately reject some pairs that won't unify because of
19113 cv-qualification mismatches. */
19114 if (TREE_CODE (arg
) == TREE_CODE (parm
)
19116 /* It is the elements of the array which hold the cv quals of an array
19117 type, and the elements might be template type parms. We'll check
19118 when we recurse. */
19119 && TREE_CODE (arg
) != ARRAY_TYPE
19120 /* We check the cv-qualifiers when unifying with template type
19121 parameters below. We want to allow ARG `const T' to unify with
19122 PARM `T' for example, when computing which of two templates
19123 is more specialized, for example. */
19124 && TREE_CODE (arg
) != TEMPLATE_TYPE_PARM
19125 && !check_cv_quals_for_unify (strict_in
, arg
, parm
))
19126 return unify_cv_qual_mismatch (explain_p
, parm
, arg
);
19128 if (!(strict
& UNIFY_ALLOW_OUTER_LEVEL
)
19129 && TYPE_P (parm
) && !CP_TYPE_CONST_P (parm
))
19130 strict
&= ~UNIFY_ALLOW_MORE_CV_QUAL
;
19131 strict
&= ~UNIFY_ALLOW_OUTER_LEVEL
;
19132 strict
&= ~UNIFY_ALLOW_DERIVED
;
19133 strict
&= ~UNIFY_ALLOW_OUTER_MORE_CV_QUAL
;
19134 strict
&= ~UNIFY_ALLOW_OUTER_LESS_CV_QUAL
;
19136 switch (TREE_CODE (parm
))
19138 case TYPENAME_TYPE
:
19140 case UNBOUND_CLASS_TEMPLATE
:
19141 /* In a type which contains a nested-name-specifier, template
19142 argument values cannot be deduced for template parameters used
19143 within the nested-name-specifier. */
19144 return unify_success (explain_p
);
19146 case TEMPLATE_TYPE_PARM
:
19147 case TEMPLATE_TEMPLATE_PARM
:
19148 case BOUND_TEMPLATE_TEMPLATE_PARM
:
19149 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, 0));
19150 if (error_operand_p (tparm
))
19151 return unify_invalid (explain_p
);
19153 if (TEMPLATE_TYPE_LEVEL (parm
)
19154 != template_decl_level (tparm
))
19155 /* The PARM is not one we're trying to unify. Just check
19156 to see if it matches ARG. */
19158 if (TREE_CODE (arg
) == TREE_CODE (parm
)
19159 && (is_auto (parm
) ? is_auto (arg
)
19160 : same_type_p (parm
, arg
)))
19161 return unify_success (explain_p
);
19163 return unify_type_mismatch (explain_p
, parm
, arg
);
19165 idx
= TEMPLATE_TYPE_IDX (parm
);
19166 targ
= TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
);
19167 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, idx
));
19168 if (error_operand_p (tparm
))
19169 return unify_invalid (explain_p
);
19171 /* Check for mixed types and values. */
19172 if ((TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
19173 && TREE_CODE (tparm
) != TYPE_DECL
)
19174 || (TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
19175 && TREE_CODE (tparm
) != TEMPLATE_DECL
))
19176 gcc_unreachable ();
19178 if (TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
19180 /* ARG must be constructed from a template class or a template
19181 template parameter. */
19182 if (TREE_CODE (arg
) != BOUND_TEMPLATE_TEMPLATE_PARM
19183 && !CLASSTYPE_SPECIALIZATION_OF_PRIMARY_TEMPLATE_P (arg
))
19184 return unify_template_deduction_failure (explain_p
, parm
, arg
);
19186 tree parmvec
= TYPE_TI_ARGS (parm
);
19187 /* An alias template name is never deduced. */
19188 if (TYPE_ALIAS_P (arg
))
19189 arg
= strip_typedefs (arg
);
19190 tree argvec
= INNERMOST_TEMPLATE_ARGS (TYPE_TI_ARGS (arg
));
19191 tree full_argvec
= add_to_template_args (targs
, argvec
);
19193 = DECL_INNERMOST_TEMPLATE_PARMS
19194 (TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL (parm
));
19196 int parm_variadic_p
= 0;
19198 /* The resolution to DR150 makes clear that default
19199 arguments for an N-argument may not be used to bind T
19200 to a template template parameter with fewer than N
19201 parameters. It is not safe to permit the binding of
19202 default arguments as an extension, as that may change
19203 the meaning of a conforming program. Consider:
19205 struct Dense { static const unsigned int dim = 1; };
19207 template <template <typename> class View,
19209 void operator+(float, View<Block> const&);
19211 template <typename Block,
19212 unsigned int Dim = Block::dim>
19213 struct Lvalue_proxy { operator float() const; };
19217 Lvalue_proxy<Dense> p;
19222 Here, if Lvalue_proxy is permitted to bind to View, then
19223 the global operator+ will be used; if they are not, the
19224 Lvalue_proxy will be converted to float. */
19225 if (coerce_template_parms (parm_parms
,
19227 TYPE_TI_TEMPLATE (parm
),
19229 ? tf_warning_or_error
19231 /*require_all_args=*/true,
19232 /*use_default_args=*/false)
19233 == error_mark_node
)
19236 /* Deduce arguments T, i from TT<T> or TT<i>.
19237 We check each element of PARMVEC and ARGVEC individually
19238 rather than the whole TREE_VEC since they can have
19239 different number of elements. */
19241 parmvec
= expand_template_argument_pack (parmvec
);
19242 argvec
= expand_template_argument_pack (argvec
);
19244 len
= TREE_VEC_LENGTH (parmvec
);
19246 /* Check if the parameters end in a pack, making them
19249 && PACK_EXPANSION_P (TREE_VEC_ELT (parmvec
, len
- 1)))
19250 parm_variadic_p
= 1;
19252 for (i
= 0; i
< len
- parm_variadic_p
; ++i
)
19253 /* If the template argument list of P contains a pack
19254 expansion that is not the last template argument, the
19255 entire template argument list is a non-deduced
19257 if (PACK_EXPANSION_P (TREE_VEC_ELT (parmvec
, i
)))
19258 return unify_success (explain_p
);
19260 if (TREE_VEC_LENGTH (argvec
) < len
- parm_variadic_p
)
19261 return unify_too_few_arguments (explain_p
,
19262 TREE_VEC_LENGTH (argvec
), len
);
19264 for (i
= 0; i
< len
- parm_variadic_p
; ++i
)
19266 RECUR_AND_CHECK_FAILURE (tparms
, targs
,
19267 TREE_VEC_ELT (parmvec
, i
),
19268 TREE_VEC_ELT (argvec
, i
),
19269 UNIFY_ALLOW_NONE
, explain_p
);
19272 if (parm_variadic_p
19273 && unify_pack_expansion (tparms
, targs
,
19276 /*subr=*/true, explain_p
))
19279 arg
= TYPE_TI_TEMPLATE (arg
);
19281 /* Fall through to deduce template name. */
19284 if (TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
19285 || TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
19287 /* Deduce template name TT from TT, TT<>, TT<T> and TT<i>. */
19289 /* Simple cases: Value already set, does match or doesn't. */
19290 if (targ
!= NULL_TREE
&& template_args_equal (targ
, arg
))
19291 return unify_success (explain_p
);
19293 return unify_inconsistency (explain_p
, parm
, targ
, arg
);
19297 /* If PARM is `const T' and ARG is only `int', we don't have
19298 a match unless we are allowing additional qualification.
19299 If ARG is `const int' and PARM is just `T' that's OK;
19300 that binds `const int' to `T'. */
19301 if (!check_cv_quals_for_unify (strict_in
| UNIFY_ALLOW_LESS_CV_QUAL
,
19303 return unify_cv_qual_mismatch (explain_p
, parm
, arg
);
19305 /* Consider the case where ARG is `const volatile int' and
19306 PARM is `const T'. Then, T should be `volatile int'. */
19307 arg
= cp_build_qualified_type_real
19308 (arg
, cp_type_quals (arg
) & ~cp_type_quals (parm
), tf_none
);
19309 if (arg
== error_mark_node
)
19310 return unify_invalid (explain_p
);
19312 /* Simple cases: Value already set, does match or doesn't. */
19313 if (targ
!= NULL_TREE
&& same_type_p (targ
, arg
))
19314 return unify_success (explain_p
);
19316 return unify_inconsistency (explain_p
, parm
, targ
, arg
);
19318 /* Make sure that ARG is not a variable-sized array. (Note
19319 that were talking about variable-sized arrays (like
19320 `int[n]'), rather than arrays of unknown size (like
19321 `int[]').) We'll get very confused by such a type since
19322 the bound of the array is not constant, and therefore
19323 not mangleable. Besides, such types are not allowed in
19324 ISO C++, so we can do as we please here. We do allow
19325 them for 'auto' deduction, since that isn't ABI-exposed. */
19326 if (!is_auto (parm
) && variably_modified_type_p (arg
, NULL_TREE
))
19327 return unify_vla_arg (explain_p
, arg
);
19329 /* Strip typedefs as in convert_template_argument. */
19330 arg
= canonicalize_type_argument (arg
, tf_none
);
19333 /* If ARG is a parameter pack or an expansion, we cannot unify
19334 against it unless PARM is also a parameter pack. */
19335 if ((template_parameter_pack_p (arg
) || PACK_EXPANSION_P (arg
))
19336 && !template_parameter_pack_p (parm
))
19337 return unify_parameter_pack_mismatch (explain_p
, parm
, arg
);
19339 /* If the argument deduction results is a METHOD_TYPE,
19340 then there is a problem.
19341 METHOD_TYPE doesn't map to any real C++ type the result of
19342 the deduction can not be of that type. */
19343 if (TREE_CODE (arg
) == METHOD_TYPE
)
19344 return unify_method_type_error (explain_p
, arg
);
19346 TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
) = arg
;
19347 return unify_success (explain_p
);
19349 case TEMPLATE_PARM_INDEX
:
19350 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, 0));
19351 if (error_operand_p (tparm
))
19352 return unify_invalid (explain_p
);
19354 if (TEMPLATE_PARM_LEVEL (parm
)
19355 != template_decl_level (tparm
))
19357 /* The PARM is not one we're trying to unify. Just check
19358 to see if it matches ARG. */
19359 int result
= !(TREE_CODE (arg
) == TREE_CODE (parm
)
19360 && cp_tree_equal (parm
, arg
));
19362 unify_expression_unequal (explain_p
, parm
, arg
);
19366 idx
= TEMPLATE_PARM_IDX (parm
);
19367 targ
= TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
);
19371 int x
= !cp_tree_equal (targ
, arg
);
19373 unify_inconsistency (explain_p
, parm
, targ
, arg
);
19377 /* [temp.deduct.type] If, in the declaration of a function template
19378 with a non-type template-parameter, the non-type
19379 template-parameter is used in an expression in the function
19380 parameter-list and, if the corresponding template-argument is
19381 deduced, the template-argument type shall match the type of the
19382 template-parameter exactly, except that a template-argument
19383 deduced from an array bound may be of any integral type.
19384 The non-type parameter might use already deduced type parameters. */
19385 tparm
= tsubst (TREE_TYPE (parm
), targs
, 0, NULL_TREE
);
19386 if (!TREE_TYPE (arg
))
19387 /* Template-parameter dependent expression. Just accept it for now.
19388 It will later be processed in convert_template_argument. */
19390 else if (same_type_p (TREE_TYPE (arg
), tparm
))
19392 else if ((strict
& UNIFY_ALLOW_INTEGER
)
19393 && CP_INTEGRAL_TYPE_P (tparm
))
19394 /* Convert the ARG to the type of PARM; the deduced non-type
19395 template argument must exactly match the types of the
19396 corresponding parameter. */
19397 arg
= fold (build_nop (tparm
, arg
));
19398 else if (uses_template_parms (tparm
))
19399 /* We haven't deduced the type of this parameter yet. Try again
19401 return unify_success (explain_p
);
19403 return unify_type_mismatch (explain_p
, tparm
, TREE_TYPE (arg
));
19405 /* If ARG is a parameter pack or an expansion, we cannot unify
19406 against it unless PARM is also a parameter pack. */
19407 if ((template_parameter_pack_p (arg
) || PACK_EXPANSION_P (arg
))
19408 && !TEMPLATE_PARM_PARAMETER_PACK (parm
))
19409 return unify_parameter_pack_mismatch (explain_p
, parm
, arg
);
19412 bool removed_attr
= false;
19413 arg
= strip_typedefs_expr (arg
, &removed_attr
);
19415 TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
) = arg
;
19416 return unify_success (explain_p
);
19420 /* A pointer-to-member constant can be unified only with
19421 another constant. */
19422 if (TREE_CODE (arg
) != PTRMEM_CST
)
19423 return unify_ptrmem_cst_mismatch (explain_p
, parm
, arg
);
19425 /* Just unify the class member. It would be useless (and possibly
19426 wrong, depending on the strict flags) to unify also
19427 PTRMEM_CST_CLASS, because we want to be sure that both parm and
19428 arg refer to the same variable, even if through different
19429 classes. For instance:
19431 struct A { int x; };
19434 Unification of &A::x and &B::x must succeed. */
19435 return unify (tparms
, targs
, PTRMEM_CST_MEMBER (parm
),
19436 PTRMEM_CST_MEMBER (arg
), strict
, explain_p
);
19441 if (!TYPE_PTR_P (arg
))
19442 return unify_type_mismatch (explain_p
, parm
, arg
);
19444 /* [temp.deduct.call]
19446 A can be another pointer or pointer to member type that can
19447 be converted to the deduced A via a qualification
19448 conversion (_conv.qual_).
19450 We pass down STRICT here rather than UNIFY_ALLOW_NONE.
19451 This will allow for additional cv-qualification of the
19452 pointed-to types if appropriate. */
19454 if (TREE_CODE (TREE_TYPE (arg
)) == RECORD_TYPE
)
19455 /* The derived-to-base conversion only persists through one
19456 level of pointers. */
19457 strict
|= (strict_in
& UNIFY_ALLOW_DERIVED
);
19459 return unify (tparms
, targs
, TREE_TYPE (parm
),
19460 TREE_TYPE (arg
), strict
, explain_p
);
19463 case REFERENCE_TYPE
:
19464 if (TREE_CODE (arg
) != REFERENCE_TYPE
)
19465 return unify_type_mismatch (explain_p
, parm
, arg
);
19466 return unify (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
19467 strict
& UNIFY_ALLOW_MORE_CV_QUAL
, explain_p
);
19470 if (TREE_CODE (arg
) != ARRAY_TYPE
)
19471 return unify_type_mismatch (explain_p
, parm
, arg
);
19472 if ((TYPE_DOMAIN (parm
) == NULL_TREE
)
19473 != (TYPE_DOMAIN (arg
) == NULL_TREE
))
19474 return unify_type_mismatch (explain_p
, parm
, arg
);
19475 RECUR_AND_CHECK_FAILURE (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
19476 strict
& UNIFY_ALLOW_MORE_CV_QUAL
, explain_p
);
19477 if (TYPE_DOMAIN (parm
) != NULL_TREE
)
19478 return unify_array_domain (tparms
, targs
, TYPE_DOMAIN (parm
),
19479 TYPE_DOMAIN (arg
), explain_p
);
19480 return unify_success (explain_p
);
19487 case ENUMERAL_TYPE
:
19490 if (TREE_CODE (arg
) != TREE_CODE (parm
))
19491 return unify_type_mismatch (explain_p
, parm
, arg
);
19493 /* We have already checked cv-qualification at the top of the
19495 if (!same_type_ignoring_top_level_qualifiers_p (arg
, parm
))
19496 return unify_type_mismatch (explain_p
, parm
, arg
);
19498 /* As far as unification is concerned, this wins. Later checks
19499 will invalidate it if necessary. */
19500 return unify_success (explain_p
);
19502 /* Types INTEGER_CST and MINUS_EXPR can come from array bounds. */
19503 /* Type INTEGER_CST can come from ordinary constant template args. */
19505 while (TREE_CODE (arg
) == NOP_EXPR
)
19506 arg
= TREE_OPERAND (arg
, 0);
19508 if (TREE_CODE (arg
) != INTEGER_CST
)
19509 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
19510 return (tree_int_cst_equal (parm
, arg
)
19511 ? unify_success (explain_p
)
19512 : unify_template_argument_mismatch (explain_p
, parm
, arg
));
19516 int i
, len
, argslen
;
19517 int parm_variadic_p
= 0;
19519 if (TREE_CODE (arg
) != TREE_VEC
)
19520 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
19522 len
= TREE_VEC_LENGTH (parm
);
19523 argslen
= TREE_VEC_LENGTH (arg
);
19525 /* Check for pack expansions in the parameters. */
19526 for (i
= 0; i
< len
; ++i
)
19528 if (PACK_EXPANSION_P (TREE_VEC_ELT (parm
, i
)))
19531 /* We can unify against something with a trailing
19533 parm_variadic_p
= 1;
19535 /* [temp.deduct.type]/9: If the template argument list of
19536 P contains a pack expansion that is not the last
19537 template argument, the entire template argument list
19538 is a non-deduced context. */
19539 return unify_success (explain_p
);
19543 /* If we don't have enough arguments to satisfy the parameters
19544 (not counting the pack expression at the end), or we have
19545 too many arguments for a parameter list that doesn't end in
19546 a pack expression, we can't unify. */
19547 if (parm_variadic_p
19548 ? argslen
< len
- parm_variadic_p
19550 return unify_arity (explain_p
, TREE_VEC_LENGTH (arg
), len
);
19552 /* Unify all of the parameters that precede the (optional)
19553 pack expression. */
19554 for (i
= 0; i
< len
- parm_variadic_p
; ++i
)
19556 RECUR_AND_CHECK_FAILURE (tparms
, targs
,
19557 TREE_VEC_ELT (parm
, i
),
19558 TREE_VEC_ELT (arg
, i
),
19559 UNIFY_ALLOW_NONE
, explain_p
);
19561 if (parm_variadic_p
)
19562 return unify_pack_expansion (tparms
, targs
, parm
, arg
,
19564 /*subr=*/true, explain_p
);
19565 return unify_success (explain_p
);
19570 if (TREE_CODE (arg
) != TREE_CODE (parm
))
19571 return unify_type_mismatch (explain_p
, parm
, arg
);
19573 if (TYPE_PTRMEMFUNC_P (parm
))
19575 if (!TYPE_PTRMEMFUNC_P (arg
))
19576 return unify_type_mismatch (explain_p
, parm
, arg
);
19578 return unify (tparms
, targs
,
19579 TYPE_PTRMEMFUNC_FN_TYPE (parm
),
19580 TYPE_PTRMEMFUNC_FN_TYPE (arg
),
19581 strict
, explain_p
);
19583 else if (TYPE_PTRMEMFUNC_P (arg
))
19584 return unify_type_mismatch (explain_p
, parm
, arg
);
19586 if (CLASSTYPE_TEMPLATE_INFO (parm
))
19588 tree t
= NULL_TREE
;
19590 if (strict_in
& UNIFY_ALLOW_DERIVED
)
19592 /* First, we try to unify the PARM and ARG directly. */
19593 t
= try_class_unification (tparms
, targs
,
19594 parm
, arg
, explain_p
);
19598 /* Fallback to the special case allowed in
19599 [temp.deduct.call]:
19601 If P is a class, and P has the form
19602 template-id, then A can be a derived class of
19603 the deduced A. Likewise, if P is a pointer to
19604 a class of the form template-id, A can be a
19605 pointer to a derived class pointed to by the
19607 enum template_base_result r
;
19608 r
= get_template_base (tparms
, targs
, parm
, arg
,
19612 return unify_no_common_base (explain_p
, r
, parm
, arg
);
19615 else if (CLASSTYPE_TEMPLATE_INFO (arg
)
19616 && (CLASSTYPE_TI_TEMPLATE (parm
)
19617 == CLASSTYPE_TI_TEMPLATE (arg
)))
19618 /* Perhaps PARM is something like S<U> and ARG is S<int>.
19619 Then, we should unify `int' and `U'. */
19622 /* There's no chance of unification succeeding. */
19623 return unify_type_mismatch (explain_p
, parm
, arg
);
19625 return unify (tparms
, targs
, CLASSTYPE_TI_ARGS (parm
),
19626 CLASSTYPE_TI_ARGS (t
), UNIFY_ALLOW_NONE
, explain_p
);
19628 else if (!same_type_ignoring_top_level_qualifiers_p (parm
, arg
))
19629 return unify_type_mismatch (explain_p
, parm
, arg
);
19630 return unify_success (explain_p
);
19633 case FUNCTION_TYPE
:
19635 unsigned int nargs
;
19640 if (TREE_CODE (arg
) != TREE_CODE (parm
))
19641 return unify_type_mismatch (explain_p
, parm
, arg
);
19643 /* CV qualifications for methods can never be deduced, they must
19644 match exactly. We need to check them explicitly here,
19645 because type_unification_real treats them as any other
19646 cv-qualified parameter. */
19647 if (TREE_CODE (parm
) == METHOD_TYPE
19648 && (!check_cv_quals_for_unify
19650 class_of_this_parm (arg
),
19651 class_of_this_parm (parm
))))
19652 return unify_cv_qual_mismatch (explain_p
, parm
, arg
);
19654 RECUR_AND_CHECK_FAILURE (tparms
, targs
, TREE_TYPE (parm
),
19655 TREE_TYPE (arg
), UNIFY_ALLOW_NONE
, explain_p
);
19657 nargs
= list_length (TYPE_ARG_TYPES (arg
));
19658 args
= XALLOCAVEC (tree
, nargs
);
19659 for (a
= TYPE_ARG_TYPES (arg
), i
= 0;
19660 a
!= NULL_TREE
&& a
!= void_list_node
;
19661 a
= TREE_CHAIN (a
), ++i
)
19662 args
[i
] = TREE_VALUE (a
);
19665 return type_unification_real (tparms
, targs
, TYPE_ARG_TYPES (parm
),
19666 args
, nargs
, 1, DEDUCE_EXACT
,
19667 LOOKUP_NORMAL
, NULL
, explain_p
);
19671 /* Unify a pointer to member with a pointer to member function, which
19672 deduces the type of the member as a function type. */
19673 if (TYPE_PTRMEMFUNC_P (arg
))
19675 /* Check top-level cv qualifiers */
19676 if (!check_cv_quals_for_unify (UNIFY_ALLOW_NONE
, arg
, parm
))
19677 return unify_cv_qual_mismatch (explain_p
, parm
, arg
);
19679 RECUR_AND_CHECK_FAILURE (tparms
, targs
, TYPE_OFFSET_BASETYPE (parm
),
19680 TYPE_PTRMEMFUNC_OBJECT_TYPE (arg
),
19681 UNIFY_ALLOW_NONE
, explain_p
);
19683 /* Determine the type of the function we are unifying against. */
19684 tree fntype
= static_fn_type (arg
);
19686 return unify (tparms
, targs
, TREE_TYPE (parm
), fntype
, strict
, explain_p
);
19689 if (TREE_CODE (arg
) != OFFSET_TYPE
)
19690 return unify_type_mismatch (explain_p
, parm
, arg
);
19691 RECUR_AND_CHECK_FAILURE (tparms
, targs
, TYPE_OFFSET_BASETYPE (parm
),
19692 TYPE_OFFSET_BASETYPE (arg
),
19693 UNIFY_ALLOW_NONE
, explain_p
);
19694 return unify (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
19695 strict
, explain_p
);
19698 if (DECL_TEMPLATE_PARM_P (parm
))
19699 return unify (tparms
, targs
, DECL_INITIAL (parm
), arg
, strict
, explain_p
);
19700 if (arg
!= scalar_constant_value (parm
))
19701 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
19702 return unify_success (explain_p
);
19705 case TEMPLATE_DECL
:
19706 /* Matched cases are handled by the ARG == PARM test above. */
19707 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
19710 /* A non-type template parameter that is a variable should be a
19711 an integral constant, in which case, it whould have been
19712 folded into its (constant) value. So we should not be getting
19713 a variable here. */
19714 gcc_unreachable ();
19716 case TYPE_ARGUMENT_PACK
:
19717 case NONTYPE_ARGUMENT_PACK
:
19718 return unify (tparms
, targs
, ARGUMENT_PACK_ARGS (parm
),
19719 ARGUMENT_PACK_ARGS (arg
), strict
, explain_p
);
19722 case DECLTYPE_TYPE
:
19723 case UNDERLYING_TYPE
:
19724 /* Cannot deduce anything from TYPEOF_TYPE, DECLTYPE_TYPE,
19725 or UNDERLYING_TYPE nodes. */
19726 return unify_success (explain_p
);
19729 /* Unification fails if we hit an error node. */
19730 return unify_invalid (explain_p
);
19733 if (REFERENCE_REF_P (parm
))
19735 if (REFERENCE_REF_P (arg
))
19736 arg
= TREE_OPERAND (arg
, 0);
19737 return unify (tparms
, targs
, TREE_OPERAND (parm
, 0), arg
,
19738 strict
, explain_p
);
19743 /* An unresolved overload is a nondeduced context. */
19744 if (is_overloaded_fn (parm
) || type_unknown_p (parm
))
19745 return unify_success (explain_p
);
19746 gcc_assert (EXPR_P (parm
));
19748 /* We must be looking at an expression. This can happen with
19752 void foo(S<I>, S<I + 2>);
19754 This is a "nondeduced context":
19758 The nondeduced contexts are:
19760 --A type that is a template-id in which one or more of
19761 the template-arguments is an expression that references
19762 a template-parameter.
19764 In these cases, we assume deduction succeeded, but don't
19765 actually infer any unifications. */
19767 if (!uses_template_parms (parm
)
19768 && !template_args_equal (parm
, arg
))
19769 return unify_expression_unequal (explain_p
, parm
, arg
);
19771 return unify_success (explain_p
);
19774 #undef RECUR_AND_CHECK_FAILURE
19776 /* Note that DECL can be defined in this translation unit, if
19780 mark_definable (tree decl
)
19783 DECL_NOT_REALLY_EXTERN (decl
) = 1;
19784 FOR_EACH_CLONE (clone
, decl
)
19785 DECL_NOT_REALLY_EXTERN (clone
) = 1;
19788 /* Called if RESULT is explicitly instantiated, or is a member of an
19789 explicitly instantiated class. */
19792 mark_decl_instantiated (tree result
, int extern_p
)
19794 SET_DECL_EXPLICIT_INSTANTIATION (result
);
19796 /* If this entity has already been written out, it's too late to
19797 make any modifications. */
19798 if (TREE_ASM_WRITTEN (result
))
19801 /* For anonymous namespace we don't need to do anything. */
19802 if (decl_anon_ns_mem_p (result
))
19804 gcc_assert (!TREE_PUBLIC (result
));
19808 if (TREE_CODE (result
) != FUNCTION_DECL
)
19809 /* The TREE_PUBLIC flag for function declarations will have been
19810 set correctly by tsubst. */
19811 TREE_PUBLIC (result
) = 1;
19813 /* This might have been set by an earlier implicit instantiation. */
19814 DECL_COMDAT (result
) = 0;
19817 DECL_NOT_REALLY_EXTERN (result
) = 0;
19820 mark_definable (result
);
19821 mark_needed (result
);
19822 /* Always make artificials weak. */
19823 if (DECL_ARTIFICIAL (result
) && flag_weak
)
19824 comdat_linkage (result
);
19825 /* For WIN32 we also want to put explicit instantiations in
19826 linkonce sections. */
19827 else if (TREE_PUBLIC (result
))
19828 maybe_make_one_only (result
);
19831 /* If EXTERN_P, then this function will not be emitted -- unless
19832 followed by an explicit instantiation, at which point its linkage
19833 will be adjusted. If !EXTERN_P, then this function will be
19834 emitted here. In neither circumstance do we want
19835 import_export_decl to adjust the linkage. */
19836 DECL_INTERFACE_KNOWN (result
) = 1;
19839 /* Subroutine of more_specialized_fn: check whether TARGS is missing any
19840 important template arguments. If any are missing, we check whether
19841 they're important by using error_mark_node for substituting into any
19842 args that were used for partial ordering (the ones between ARGS and END)
19843 and seeing if it bubbles up. */
19846 check_undeduced_parms (tree targs
, tree args
, tree end
)
19848 bool found
= false;
19850 for (i
= TREE_VEC_LENGTH (targs
) - 1; i
>= 0; --i
)
19851 if (TREE_VEC_ELT (targs
, i
) == NULL_TREE
)
19854 TREE_VEC_ELT (targs
, i
) = error_mark_node
;
19858 tree substed
= tsubst_arg_types (args
, targs
, end
, tf_none
, NULL_TREE
);
19859 if (substed
== error_mark_node
)
19865 /* Given two function templates PAT1 and PAT2, return:
19867 1 if PAT1 is more specialized than PAT2 as described in [temp.func.order].
19868 -1 if PAT2 is more specialized than PAT1.
19869 0 if neither is more specialized.
19871 LEN indicates the number of parameters we should consider
19872 (defaulted parameters should not be considered).
19874 The 1998 std underspecified function template partial ordering, and
19875 DR214 addresses the issue. We take pairs of arguments, one from
19876 each of the templates, and deduce them against each other. One of
19877 the templates will be more specialized if all the *other*
19878 template's arguments deduce against its arguments and at least one
19879 of its arguments *does* *not* deduce against the other template's
19880 corresponding argument. Deduction is done as for class templates.
19881 The arguments used in deduction have reference and top level cv
19882 qualifiers removed. Iff both arguments were originally reference
19883 types *and* deduction succeeds in both directions, an lvalue reference
19884 wins against an rvalue reference and otherwise the template
19885 with the more cv-qualified argument wins for that pairing (if
19886 neither is more cv-qualified, they both are equal). Unlike regular
19887 deduction, after all the arguments have been deduced in this way,
19888 we do *not* verify the deduced template argument values can be
19889 substituted into non-deduced contexts.
19891 The logic can be a bit confusing here, because we look at deduce1 and
19892 targs1 to see if pat2 is at least as specialized, and vice versa; if we
19893 can find template arguments for pat1 to make arg1 look like arg2, that
19894 means that arg2 is at least as specialized as arg1. */
19897 more_specialized_fn (tree pat1
, tree pat2
, int len
)
19899 tree decl1
= DECL_TEMPLATE_RESULT (pat1
);
19900 tree decl2
= DECL_TEMPLATE_RESULT (pat2
);
19901 tree targs1
= make_tree_vec (DECL_NTPARMS (pat1
));
19902 tree targs2
= make_tree_vec (DECL_NTPARMS (pat2
));
19903 tree tparms1
= DECL_INNERMOST_TEMPLATE_PARMS (pat1
);
19904 tree tparms2
= DECL_INNERMOST_TEMPLATE_PARMS (pat2
);
19905 tree args1
= TYPE_ARG_TYPES (TREE_TYPE (decl1
));
19906 tree args2
= TYPE_ARG_TYPES (TREE_TYPE (decl2
));
19907 tree origs1
, origs2
;
19908 bool lose1
= false;
19909 bool lose2
= false;
19911 /* Remove the this parameter from non-static member functions. If
19912 one is a non-static member function and the other is not a static
19913 member function, remove the first parameter from that function
19914 also. This situation occurs for operator functions where we
19915 locate both a member function (with this pointer) and non-member
19916 operator (with explicit first operand). */
19917 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl1
))
19919 len
--; /* LEN is the number of significant arguments for DECL1 */
19920 args1
= TREE_CHAIN (args1
);
19921 if (!DECL_STATIC_FUNCTION_P (decl2
))
19922 args2
= TREE_CHAIN (args2
);
19924 else if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl2
))
19926 args2
= TREE_CHAIN (args2
);
19927 if (!DECL_STATIC_FUNCTION_P (decl1
))
19930 args1
= TREE_CHAIN (args1
);
19934 /* If only one is a conversion operator, they are unordered. */
19935 if (DECL_CONV_FN_P (decl1
) != DECL_CONV_FN_P (decl2
))
19938 /* Consider the return type for a conversion function */
19939 if (DECL_CONV_FN_P (decl1
))
19941 args1
= tree_cons (NULL_TREE
, TREE_TYPE (TREE_TYPE (decl1
)), args1
);
19942 args2
= tree_cons (NULL_TREE
, TREE_TYPE (TREE_TYPE (decl2
)), args2
);
19946 processing_template_decl
++;
19952 /* Stop when an ellipsis is seen. */
19953 && args1
!= NULL_TREE
&& args2
!= NULL_TREE
)
19955 tree arg1
= TREE_VALUE (args1
);
19956 tree arg2
= TREE_VALUE (args2
);
19957 int deduce1
, deduce2
;
19963 if (TREE_CODE (arg1
) == TYPE_PACK_EXPANSION
19964 && TREE_CODE (arg2
) == TYPE_PACK_EXPANSION
)
19966 /* When both arguments are pack expansions, we need only
19967 unify the patterns themselves. */
19968 arg1
= PACK_EXPANSION_PATTERN (arg1
);
19969 arg2
= PACK_EXPANSION_PATTERN (arg2
);
19971 /* This is the last comparison we need to do. */
19975 if (TREE_CODE (arg1
) == REFERENCE_TYPE
)
19977 ref1
= TYPE_REF_IS_RVALUE (arg1
) + 1;
19978 arg1
= TREE_TYPE (arg1
);
19979 quals1
= cp_type_quals (arg1
);
19982 if (TREE_CODE (arg2
) == REFERENCE_TYPE
)
19984 ref2
= TYPE_REF_IS_RVALUE (arg2
) + 1;
19985 arg2
= TREE_TYPE (arg2
);
19986 quals2
= cp_type_quals (arg2
);
19989 arg1
= TYPE_MAIN_VARIANT (arg1
);
19990 arg2
= TYPE_MAIN_VARIANT (arg2
);
19992 if (TREE_CODE (arg1
) == TYPE_PACK_EXPANSION
)
19994 int i
, len2
= list_length (args2
);
19995 tree parmvec
= make_tree_vec (1);
19996 tree argvec
= make_tree_vec (len2
);
19999 /* Setup the parameter vector, which contains only ARG1. */
20000 TREE_VEC_ELT (parmvec
, 0) = arg1
;
20002 /* Setup the argument vector, which contains the remaining
20004 for (i
= 0; i
< len2
; i
++, ta
= TREE_CHAIN (ta
))
20005 TREE_VEC_ELT (argvec
, i
) = TREE_VALUE (ta
);
20007 deduce1
= (unify_pack_expansion (tparms1
, targs1
, parmvec
,
20008 argvec
, DEDUCE_EXACT
,
20009 /*subr=*/true, /*explain_p=*/false)
20012 /* We cannot deduce in the other direction, because ARG1 is
20013 a pack expansion but ARG2 is not. */
20016 else if (TREE_CODE (arg2
) == TYPE_PACK_EXPANSION
)
20018 int i
, len1
= list_length (args1
);
20019 tree parmvec
= make_tree_vec (1);
20020 tree argvec
= make_tree_vec (len1
);
20023 /* Setup the parameter vector, which contains only ARG1. */
20024 TREE_VEC_ELT (parmvec
, 0) = arg2
;
20026 /* Setup the argument vector, which contains the remaining
20028 for (i
= 0; i
< len1
; i
++, ta
= TREE_CHAIN (ta
))
20029 TREE_VEC_ELT (argvec
, i
) = TREE_VALUE (ta
);
20031 deduce2
= (unify_pack_expansion (tparms2
, targs2
, parmvec
,
20032 argvec
, DEDUCE_EXACT
,
20033 /*subr=*/true, /*explain_p=*/false)
20036 /* We cannot deduce in the other direction, because ARG2 is
20037 a pack expansion but ARG1 is not.*/
20043 /* The normal case, where neither argument is a pack
20045 deduce1
= (unify (tparms1
, targs1
, arg1
, arg2
,
20046 UNIFY_ALLOW_NONE
, /*explain_p=*/false)
20048 deduce2
= (unify (tparms2
, targs2
, arg2
, arg1
,
20049 UNIFY_ALLOW_NONE
, /*explain_p=*/false)
20053 /* If we couldn't deduce arguments for tparms1 to make arg1 match
20054 arg2, then arg2 is not as specialized as arg1. */
20060 /* "If, for a given type, deduction succeeds in both directions
20061 (i.e., the types are identical after the transformations above)
20062 and both P and A were reference types (before being replaced with
20063 the type referred to above):
20064 - if the type from the argument template was an lvalue reference and
20065 the type from the parameter template was not, the argument type is
20066 considered to be more specialized than the other; otherwise,
20067 - if the type from the argument template is more cv-qualified
20068 than the type from the parameter template (as described above),
20069 the argument type is considered to be more specialized than the other;
20071 - neither type is more specialized than the other." */
20073 if (deduce1
&& deduce2
)
20075 if (ref1
&& ref2
&& ref1
!= ref2
)
20082 else if (quals1
!= quals2
&& quals1
>= 0 && quals2
>= 0)
20084 if ((quals1
& quals2
) == quals2
)
20086 if ((quals1
& quals2
) == quals1
)
20091 if (lose1
&& lose2
)
20092 /* We've failed to deduce something in either direction.
20093 These must be unordered. */
20096 if (TREE_CODE (arg1
) == TYPE_PACK_EXPANSION
20097 || TREE_CODE (arg2
) == TYPE_PACK_EXPANSION
)
20098 /* We have already processed all of the arguments in our
20099 handing of the pack expansion type. */
20102 args1
= TREE_CHAIN (args1
);
20103 args2
= TREE_CHAIN (args2
);
20106 /* "In most cases, all template parameters must have values in order for
20107 deduction to succeed, but for partial ordering purposes a template
20108 parameter may remain without a value provided it is not used in the
20109 types being used for partial ordering."
20111 Thus, if we are missing any of the targs1 we need to substitute into
20112 origs1, then pat2 is not as specialized as pat1. This can happen when
20113 there is a nondeduced context. */
20114 if (!lose2
&& check_undeduced_parms (targs1
, origs1
, args1
))
20116 if (!lose1
&& check_undeduced_parms (targs2
, origs2
, args2
))
20119 processing_template_decl
--;
20121 /* If both deductions succeed, the partial ordering selects the more
20122 constrained template. */
20123 if (!lose1
&& !lose2
)
20125 tree c1
= get_constraints (DECL_TEMPLATE_RESULT (pat1
));
20126 tree c2
= get_constraints (DECL_TEMPLATE_RESULT (pat2
));
20127 lose1
= !subsumes_constraints (c1
, c2
);
20128 lose2
= !subsumes_constraints (c2
, c1
);
20131 /* All things being equal, if the next argument is a pack expansion
20132 for one function but not for the other, prefer the
20133 non-variadic function. FIXME this is bogus; see c++/41958. */
20135 && args1
&& TREE_VALUE (args1
)
20136 && args2
&& TREE_VALUE (args2
))
20138 lose1
= TREE_CODE (TREE_VALUE (args1
)) == TYPE_PACK_EXPANSION
;
20139 lose2
= TREE_CODE (TREE_VALUE (args2
)) == TYPE_PACK_EXPANSION
;
20142 if (lose1
== lose2
)
20150 /* Determine which of two partial specializations of TMPL is more
20153 PAT1 is a TREE_LIST whose TREE_VALUE is the TEMPLATE_DECL corresponding
20154 to the first partial specialization. The TREE_PURPOSE is the
20155 innermost set of template parameters for the partial
20156 specialization. PAT2 is similar, but for the second template.
20158 Return 1 if the first partial specialization is more specialized;
20159 -1 if the second is more specialized; 0 if neither is more
20162 See [temp.class.order] for information about determining which of
20163 two templates is more specialized. */
20166 more_specialized_partial_spec (tree tmpl
, tree pat1
, tree pat2
)
20170 bool any_deductions
= false;
20172 tree tmpl1
= TREE_VALUE (pat1
);
20173 tree tmpl2
= TREE_VALUE (pat2
);
20174 tree parms1
= DECL_INNERMOST_TEMPLATE_PARMS (tmpl1
);
20175 tree parms2
= DECL_INNERMOST_TEMPLATE_PARMS (tmpl2
);
20176 tree specargs1
= TI_ARGS (get_template_info (DECL_TEMPLATE_RESULT (tmpl1
)));
20177 tree specargs2
= TI_ARGS (get_template_info (DECL_TEMPLATE_RESULT (tmpl2
)));
20179 /* Just like what happens for functions, if we are ordering between
20180 different template specializations, we may encounter dependent
20181 types in the arguments, and we need our dependency check functions
20182 to behave correctly. */
20183 ++processing_template_decl
;
20184 targs
= get_partial_spec_bindings (tmpl
, parms1
, specargs1
, specargs2
);
20188 any_deductions
= true;
20191 targs
= get_partial_spec_bindings (tmpl
, parms2
, specargs2
, specargs1
);
20195 any_deductions
= true;
20197 --processing_template_decl
;
20199 /* If both deductions succeed, the partial ordering selects the more
20200 constrained template. */
20201 if (!winner
&& any_deductions
)
20202 return more_constrained (tmpl1
, tmpl2
);
20204 /* In the case of a tie where at least one of the templates
20205 has a parameter pack at the end, the template with the most
20206 non-packed parameters wins. */
20209 && (template_args_variadic_p (TREE_PURPOSE (pat1
))
20210 || template_args_variadic_p (TREE_PURPOSE (pat2
))))
20212 tree args1
= INNERMOST_TEMPLATE_ARGS (TREE_PURPOSE (pat1
));
20213 tree args2
= INNERMOST_TEMPLATE_ARGS (TREE_PURPOSE (pat2
));
20214 int len1
= TREE_VEC_LENGTH (args1
);
20215 int len2
= TREE_VEC_LENGTH (args2
);
20217 /* We don't count the pack expansion at the end. */
20218 if (template_args_variadic_p (TREE_PURPOSE (pat1
)))
20220 if (template_args_variadic_p (TREE_PURPOSE (pat2
)))
20225 else if (len1
< len2
)
20232 /* Return the template arguments that will produce the function signature
20233 DECL from the function template FN, with the explicit template
20234 arguments EXPLICIT_ARGS. If CHECK_RETTYPE is true, the return type must
20235 also match. Return NULL_TREE if no satisfactory arguments could be
20239 get_bindings (tree fn
, tree decl
, tree explicit_args
, bool check_rettype
)
20241 int ntparms
= DECL_NTPARMS (fn
);
20242 tree targs
= make_tree_vec (ntparms
);
20243 tree decl_type
= TREE_TYPE (decl
);
20244 tree decl_arg_types
;
20246 unsigned int nargs
, ix
;
20249 gcc_assert (decl
!= DECL_TEMPLATE_RESULT (fn
));
20251 /* Never do unification on the 'this' parameter. */
20252 decl_arg_types
= skip_artificial_parms_for (decl
,
20253 TYPE_ARG_TYPES (decl_type
));
20255 nargs
= list_length (decl_arg_types
);
20256 args
= XALLOCAVEC (tree
, nargs
);
20257 for (arg
= decl_arg_types
, ix
= 0;
20258 arg
!= NULL_TREE
&& arg
!= void_list_node
;
20259 arg
= TREE_CHAIN (arg
), ++ix
)
20260 args
[ix
] = TREE_VALUE (arg
);
20262 if (fn_type_unification (fn
, explicit_args
, targs
,
20264 (check_rettype
|| DECL_CONV_FN_P (fn
)
20265 ? TREE_TYPE (decl_type
) : NULL_TREE
),
20266 DEDUCE_EXACT
, LOOKUP_NORMAL
, /*explain_p=*/false,
20268 == error_mark_node
)
20274 /* Return the innermost template arguments that, when applied to a partial
20275 specialization of TMPL whose innermost template parameters are
20276 TPARMS, and whose specialization arguments are SPEC_ARGS, yield the
20279 For example, suppose we have:
20281 template <class T, class U> struct S {};
20282 template <class T> struct S<T*, int> {};
20284 Then, suppose we want to get `S<double*, int>'. The TPARMS will be
20285 {T}, the SPEC_ARGS will be {T*, int} and the ARGS will be {double*,
20286 int}. The resulting vector will be {double}, indicating that `T'
20287 is bound to `double'. */
20290 get_partial_spec_bindings (tree tmpl
, tree tparms
, tree spec_args
, tree args
)
20292 int i
, ntparms
= TREE_VEC_LENGTH (tparms
);
20294 tree innermost_deduced_args
;
20296 innermost_deduced_args
= make_tree_vec (ntparms
);
20297 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (args
))
20299 deduced_args
= copy_node (args
);
20300 SET_TMPL_ARGS_LEVEL (deduced_args
,
20301 TMPL_ARGS_DEPTH (deduced_args
),
20302 innermost_deduced_args
);
20305 deduced_args
= innermost_deduced_args
;
20307 if (unify (tparms
, deduced_args
,
20308 INNERMOST_TEMPLATE_ARGS (spec_args
),
20309 INNERMOST_TEMPLATE_ARGS (args
),
20310 UNIFY_ALLOW_NONE
, /*explain_p=*/false))
20313 for (i
= 0; i
< ntparms
; ++i
)
20314 if (! TREE_VEC_ELT (innermost_deduced_args
, i
))
20317 /* Verify that nondeduced template arguments agree with the type
20318 obtained from argument deduction.
20322 struct A { typedef int X; };
20323 template <class T, class U> struct C {};
20324 template <class T> struct C<T, typename T::X> {};
20326 Then with the instantiation `C<A, int>', we can deduce that
20327 `T' is `A' but unify () does not check whether `typename T::X'
20329 spec_args
= tsubst (spec_args
, deduced_args
, tf_none
, NULL_TREE
);
20330 spec_args
= coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (tmpl
),
20332 tf_none
, false, false);
20333 if (spec_args
== error_mark_node
20334 /* We only need to check the innermost arguments; the other
20335 arguments will always agree. */
20336 || !comp_template_args (INNERMOST_TEMPLATE_ARGS (spec_args
),
20337 INNERMOST_TEMPLATE_ARGS (args
)))
20340 /* Now that we have bindings for all of the template arguments,
20341 ensure that the arguments deduced for the template template
20342 parameters have compatible template parameter lists. See the use
20343 of template_template_parm_bindings_ok_p in fn_type_unification
20344 for more information. */
20345 if (!template_template_parm_bindings_ok_p (tparms
, deduced_args
))
20348 return deduced_args
;
20351 // Compare two function templates T1 and T2 by deducing bindings
20352 // from one against the other. If both deductions succeed, compare
20353 // constraints to see which is more constrained.
20355 more_specialized_inst (tree t1
, tree t2
)
20360 if (get_bindings (t1
, DECL_TEMPLATE_RESULT (t2
), NULL_TREE
, true))
20366 if (get_bindings (t2
, DECL_TEMPLATE_RESULT (t1
), NULL_TREE
, true))
20372 // If both deductions succeed, then one may be more constrained.
20373 if (count
== 2 && fate
== 0)
20374 fate
= more_constrained (t1
, t2
);
20379 /* TEMPLATES is a TREE_LIST. Each TREE_VALUE is a TEMPLATE_DECL.
20380 Return the TREE_LIST node with the most specialized template, if
20381 any. If there is no most specialized template, the error_mark_node
20384 Note that this function does not look at, or modify, the
20385 TREE_PURPOSE or TREE_TYPE of any of the nodes. Since the node
20386 returned is one of the elements of INSTANTIATIONS, callers may
20387 store information in the TREE_PURPOSE or TREE_TYPE of the nodes,
20388 and retrieve it from the value returned. */
20391 most_specialized_instantiation (tree templates
)
20395 ++processing_template_decl
;
20398 for (fn
= TREE_CHAIN (templates
); fn
; fn
= TREE_CHAIN (fn
))
20400 int fate
= more_specialized_inst (TREE_VALUE (champ
), TREE_VALUE (fn
));
20405 /* Equally specialized, move to next function. If there
20406 is no next function, nothing's most specialized. */
20407 fn
= TREE_CHAIN (fn
);
20415 /* Now verify that champ is better than everything earlier in the
20416 instantiation list. */
20417 for (fn
= templates
; fn
!= champ
; fn
= TREE_CHAIN (fn
)) {
20418 if (more_specialized_inst (TREE_VALUE (champ
), TREE_VALUE (fn
)) != 1)
20425 processing_template_decl
--;
20428 return error_mark_node
;
20433 /* If DECL is a specialization of some template, return the most
20434 general such template. Otherwise, returns NULL_TREE.
20436 For example, given:
20438 template <class T> struct S { template <class U> void f(U); };
20440 if TMPL is `template <class U> void S<int>::f(U)' this will return
20441 the full template. This function will not trace past partial
20442 specializations, however. For example, given in addition:
20444 template <class T> struct S<T*> { template <class U> void f(U); };
20446 if TMPL is `template <class U> void S<int*>::f(U)' this will return
20447 `template <class T> template <class U> S<T*>::f(U)'. */
20450 most_general_template (tree decl
)
20452 if (TREE_CODE (decl
) != TEMPLATE_DECL
)
20454 if (tree tinfo
= get_template_info (decl
))
20455 decl
= TI_TEMPLATE (tinfo
);
20456 /* The TI_TEMPLATE can be an IDENTIFIER_NODE for a
20457 template friend, or a FIELD_DECL for a capture pack. */
20458 if (TREE_CODE (decl
) != TEMPLATE_DECL
)
20462 /* Look for more and more general templates. */
20463 while (DECL_LANG_SPECIFIC (decl
) && DECL_TEMPLATE_INFO (decl
))
20465 /* The DECL_TI_TEMPLATE can be an IDENTIFIER_NODE in some cases.
20466 (See cp-tree.h for details.) */
20467 if (TREE_CODE (DECL_TI_TEMPLATE (decl
)) != TEMPLATE_DECL
)
20470 if (CLASS_TYPE_P (TREE_TYPE (decl
))
20471 && !TYPE_DECL_ALIAS_P (TYPE_NAME (TREE_TYPE (decl
)))
20472 && CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_TYPE (decl
)))
20475 /* Stop if we run into an explicitly specialized class template. */
20476 if (!DECL_NAMESPACE_SCOPE_P (decl
)
20477 && DECL_CONTEXT (decl
)
20478 && CLASSTYPE_TEMPLATE_SPECIALIZATION (DECL_CONTEXT (decl
)))
20481 decl
= DECL_TI_TEMPLATE (decl
);
20487 /* Return the most specialized of the template partial specializations
20488 which can produce TARGET, a specialization of some class or variable
20489 template. The value returned is actually a TREE_LIST; the TREE_VALUE is
20490 a TEMPLATE_DECL node corresponding to the partial specialization, while
20491 the TREE_PURPOSE is the set of template arguments that must be
20492 substituted into the template pattern in order to generate TARGET.
20494 If the choice of partial specialization is ambiguous, a diagnostic
20495 is issued, and the error_mark_node is returned. If there are no
20496 partial specializations matching TARGET, then NULL_TREE is
20497 returned, indicating that the primary template should be used. */
20500 most_specialized_partial_spec (tree target
, tsubst_flags_t complain
)
20502 tree list
= NULL_TREE
;
20507 tree outer_args
= NULL_TREE
;
20510 if (TYPE_P (target
))
20512 tree tinfo
= CLASSTYPE_TEMPLATE_INFO (target
);
20513 tmpl
= TI_TEMPLATE (tinfo
);
20514 args
= TI_ARGS (tinfo
);
20516 else if (TREE_CODE (target
) == TEMPLATE_ID_EXPR
)
20518 tmpl
= TREE_OPERAND (target
, 0);
20519 args
= TREE_OPERAND (target
, 1);
20521 else if (VAR_P (target
))
20523 tree tinfo
= DECL_TEMPLATE_INFO (target
);
20524 tmpl
= TI_TEMPLATE (tinfo
);
20525 args
= TI_ARGS (tinfo
);
20528 gcc_unreachable ();
20530 tree main_tmpl
= most_general_template (tmpl
);
20532 /* For determining which partial specialization to use, only the
20533 innermost args are interesting. */
20534 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (args
))
20536 outer_args
= strip_innermost_template_args (args
, 1);
20537 args
= INNERMOST_TEMPLATE_ARGS (args
);
20540 for (t
= DECL_TEMPLATE_SPECIALIZATIONS (main_tmpl
); t
; t
= TREE_CHAIN (t
))
20542 tree partial_spec_args
;
20544 tree spec_tmpl
= TREE_VALUE (t
);
20546 partial_spec_args
= TREE_PURPOSE (t
);
20548 ++processing_template_decl
;
20552 /* Discard the outer levels of args, and then substitute in the
20553 template args from the enclosing class. */
20554 partial_spec_args
= INNERMOST_TEMPLATE_ARGS (partial_spec_args
);
20555 partial_spec_args
= tsubst_template_args
20556 (partial_spec_args
, outer_args
, tf_none
, NULL_TREE
);
20558 /* And the same for the partial specialization TEMPLATE_DECL. */
20559 spec_tmpl
= tsubst (spec_tmpl
, outer_args
, tf_none
, NULL_TREE
);
20562 partial_spec_args
=
20563 coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (tmpl
),
20566 /*require_all_args=*/true,
20567 /*use_default_args=*/true);
20569 --processing_template_decl
;
20571 if (partial_spec_args
== error_mark_node
)
20572 return error_mark_node
;
20573 if (spec_tmpl
== error_mark_node
)
20574 return error_mark_node
;
20576 tree parms
= DECL_INNERMOST_TEMPLATE_PARMS (spec_tmpl
);
20577 spec_args
= get_partial_spec_bindings (tmpl
, parms
,
20583 spec_args
= add_to_template_args (outer_args
, spec_args
);
20585 /* Keep the candidate only if the constraints are satisfied,
20586 or if we're not compiling with concepts. */
20588 || constraints_satisfied_p (spec_tmpl
, spec_args
))
20590 list
= tree_cons (spec_args
, TREE_VALUE (t
), list
);
20591 TREE_TYPE (list
) = TREE_TYPE (t
);
20599 ambiguous_p
= false;
20602 t
= TREE_CHAIN (t
);
20603 for (; t
; t
= TREE_CHAIN (t
))
20605 fate
= more_specialized_partial_spec (tmpl
, champ
, t
);
20612 t
= TREE_CHAIN (t
);
20615 ambiguous_p
= true;
20624 for (t
= list
; t
&& t
!= champ
; t
= TREE_CHAIN (t
))
20626 fate
= more_specialized_partial_spec (tmpl
, champ
, t
);
20629 ambiguous_p
= true;
20637 char *spaces
= NULL
;
20638 if (!(complain
& tf_error
))
20639 return error_mark_node
;
20640 if (TYPE_P (target
))
20641 error ("ambiguous template instantiation for %q#T", target
);
20643 error ("ambiguous template instantiation for %q#D", target
);
20644 str
= ngettext ("candidate is:", "candidates are:", list_length (list
));
20645 for (t
= list
; t
; t
= TREE_CHAIN (t
))
20647 tree subst
= build_tree_list (TREE_VALUE (t
), TREE_PURPOSE (t
));
20648 inform (DECL_SOURCE_LOCATION (TREE_VALUE (t
)),
20649 "%s %#S", spaces
? spaces
: str
, subst
);
20650 spaces
= spaces
? spaces
: get_spaces (str
);
20653 return error_mark_node
;
20659 /* Explicitly instantiate DECL. */
20662 do_decl_instantiation (tree decl
, tree storage
)
20664 tree result
= NULL_TREE
;
20667 if (!decl
|| decl
== error_mark_node
)
20668 /* An error occurred, for which grokdeclarator has already issued
20669 an appropriate message. */
20671 else if (! DECL_LANG_SPECIFIC (decl
))
20673 error ("explicit instantiation of non-template %q#D", decl
);
20677 bool var_templ
= (DECL_TEMPLATE_INFO (decl
)
20678 && variable_template_p (DECL_TI_TEMPLATE (decl
)));
20680 if (VAR_P (decl
) && !var_templ
)
20682 /* There is an asymmetry here in the way VAR_DECLs and
20683 FUNCTION_DECLs are handled by grokdeclarator. In the case of
20684 the latter, the DECL we get back will be marked as a
20685 template instantiation, and the appropriate
20686 DECL_TEMPLATE_INFO will be set up. This does not happen for
20687 VAR_DECLs so we do the lookup here. Probably, grokdeclarator
20688 should handle VAR_DECLs as it currently handles
20690 if (!DECL_CLASS_SCOPE_P (decl
))
20692 error ("%qD is not a static data member of a class template", decl
);
20695 result
= lookup_field (DECL_CONTEXT (decl
), DECL_NAME (decl
), 0, false);
20696 if (!result
|| !VAR_P (result
))
20698 error ("no matching template for %qD found", decl
);
20701 if (!same_type_p (TREE_TYPE (result
), TREE_TYPE (decl
)))
20703 error ("type %qT for explicit instantiation %qD does not match "
20704 "declared type %qT", TREE_TYPE (result
), decl
,
20709 else if (TREE_CODE (decl
) != FUNCTION_DECL
&& !var_templ
)
20711 error ("explicit instantiation of %q#D", decl
);
20717 /* Check for various error cases. Note that if the explicit
20718 instantiation is valid the RESULT will currently be marked as an
20719 *implicit* instantiation; DECL_EXPLICIT_INSTANTIATION is not set
20720 until we get here. */
20722 if (DECL_TEMPLATE_SPECIALIZATION (result
))
20724 /* DR 259 [temp.spec].
20726 Both an explicit instantiation and a declaration of an explicit
20727 specialization shall not appear in a program unless the explicit
20728 instantiation follows a declaration of the explicit specialization.
20730 For a given set of template parameters, if an explicit
20731 instantiation of a template appears after a declaration of an
20732 explicit specialization for that template, the explicit
20733 instantiation has no effect. */
20736 else if (DECL_EXPLICIT_INSTANTIATION (result
))
20740 No program shall explicitly instantiate any template more
20743 We check DECL_NOT_REALLY_EXTERN so as not to complain when
20744 the first instantiation was `extern' and the second is not,
20745 and EXTERN_P for the opposite case. */
20746 if (DECL_NOT_REALLY_EXTERN (result
) && !extern_p
)
20747 permerror (input_location
, "duplicate explicit instantiation of %q#D", result
);
20748 /* If an "extern" explicit instantiation follows an ordinary
20749 explicit instantiation, the template is instantiated. */
20753 else if (!DECL_IMPLICIT_INSTANTIATION (result
))
20755 error ("no matching template for %qD found", result
);
20758 else if (!DECL_TEMPLATE_INFO (result
))
20760 permerror (input_location
, "explicit instantiation of non-template %q#D", result
);
20764 if (storage
== NULL_TREE
)
20766 else if (storage
== ridpointers
[(int) RID_EXTERN
])
20768 if (!in_system_header_at (input_location
) && (cxx_dialect
== cxx98
))
20769 pedwarn (input_location
, OPT_Wpedantic
,
20770 "ISO C++ 1998 forbids the use of %<extern%> on explicit "
20775 error ("storage class %qD applied to template instantiation", storage
);
20777 check_explicit_instantiation_namespace (result
);
20778 mark_decl_instantiated (result
, extern_p
);
20780 instantiate_decl (result
, /*defer_ok=*/1,
20781 /*expl_inst_class_mem_p=*/false);
20785 mark_class_instantiated (tree t
, int extern_p
)
20787 SET_CLASSTYPE_EXPLICIT_INSTANTIATION (t
);
20788 SET_CLASSTYPE_INTERFACE_KNOWN (t
);
20789 CLASSTYPE_INTERFACE_ONLY (t
) = extern_p
;
20790 TYPE_DECL_SUPPRESS_DEBUG (TYPE_NAME (t
)) = extern_p
;
20793 CLASSTYPE_DEBUG_REQUESTED (t
) = 1;
20794 rest_of_type_compilation (t
, 1);
20798 /* Called from do_type_instantiation through binding_table_foreach to
20799 do recursive instantiation for the type bound in ENTRY. */
20801 bt_instantiate_type_proc (binding_entry entry
, void *data
)
20803 tree storage
= *(tree
*) data
;
20805 if (MAYBE_CLASS_TYPE_P (entry
->type
)
20806 && !uses_template_parms (CLASSTYPE_TI_ARGS (entry
->type
)))
20807 do_type_instantiation (TYPE_MAIN_DECL (entry
->type
), storage
, 0);
20810 /* Called from do_type_instantiation to instantiate a member
20811 (a member function or a static member variable) of an
20812 explicitly instantiated class template. */
20814 instantiate_class_member (tree decl
, int extern_p
)
20816 mark_decl_instantiated (decl
, extern_p
);
20818 instantiate_decl (decl
, /*defer_ok=*/1,
20819 /*expl_inst_class_mem_p=*/true);
20822 /* Perform an explicit instantiation of template class T. STORAGE, if
20823 non-null, is the RID for extern, inline or static. COMPLAIN is
20824 nonzero if this is called from the parser, zero if called recursively,
20825 since the standard is unclear (as detailed below). */
20828 do_type_instantiation (tree t
, tree storage
, tsubst_flags_t complain
)
20833 int previous_instantiation_extern_p
= 0;
20835 if (TREE_CODE (t
) == TYPE_DECL
)
20838 if (! CLASS_TYPE_P (t
) || ! CLASSTYPE_TEMPLATE_INFO (t
))
20841 (TYPE_TEMPLATE_INFO (t
)) ? TYPE_TI_TEMPLATE (t
) : NULL
;
20843 error ("explicit instantiation of non-class template %qD", tmpl
);
20845 error ("explicit instantiation of non-template type %qT", t
);
20851 if (!COMPLETE_TYPE_P (t
))
20853 if (complain
& tf_error
)
20854 error ("explicit instantiation of %q#T before definition of template",
20859 if (storage
!= NULL_TREE
)
20861 if (!in_system_header_at (input_location
))
20863 if (storage
== ridpointers
[(int) RID_EXTERN
])
20865 if (cxx_dialect
== cxx98
)
20866 pedwarn (input_location
, OPT_Wpedantic
,
20867 "ISO C++ 1998 forbids the use of %<extern%> on "
20868 "explicit instantiations");
20871 pedwarn (input_location
, OPT_Wpedantic
,
20872 "ISO C++ forbids the use of %qE"
20873 " on explicit instantiations", storage
);
20876 if (storage
== ridpointers
[(int) RID_INLINE
])
20878 else if (storage
== ridpointers
[(int) RID_EXTERN
])
20880 else if (storage
== ridpointers
[(int) RID_STATIC
])
20884 error ("storage class %qD applied to template instantiation",
20890 if (CLASSTYPE_TEMPLATE_SPECIALIZATION (t
))
20892 /* DR 259 [temp.spec].
20894 Both an explicit instantiation and a declaration of an explicit
20895 specialization shall not appear in a program unless the explicit
20896 instantiation follows a declaration of the explicit specialization.
20898 For a given set of template parameters, if an explicit
20899 instantiation of a template appears after a declaration of an
20900 explicit specialization for that template, the explicit
20901 instantiation has no effect. */
20904 else if (CLASSTYPE_EXPLICIT_INSTANTIATION (t
))
20908 No program shall explicitly instantiate any template more
20911 If PREVIOUS_INSTANTIATION_EXTERN_P, then the first explicit
20912 instantiation was `extern'. If EXTERN_P then the second is.
20913 These cases are OK. */
20914 previous_instantiation_extern_p
= CLASSTYPE_INTERFACE_ONLY (t
);
20916 if (!previous_instantiation_extern_p
&& !extern_p
20917 && (complain
& tf_error
))
20918 permerror (input_location
, "duplicate explicit instantiation of %q#T", t
);
20920 /* If we've already instantiated the template, just return now. */
20921 if (!CLASSTYPE_INTERFACE_ONLY (t
))
20925 check_explicit_instantiation_namespace (TYPE_NAME (t
));
20926 mark_class_instantiated (t
, extern_p
);
20934 /* In contrast to implicit instantiation, where only the
20935 declarations, and not the definitions, of members are
20936 instantiated, we have here:
20940 The explicit instantiation of a class template specialization
20941 implies the instantiation of all of its members not
20942 previously explicitly specialized in the translation unit
20943 containing the explicit instantiation.
20945 Of course, we can't instantiate member template classes, since
20946 we don't have any arguments for them. Note that the standard
20947 is unclear on whether the instantiation of the members are
20948 *explicit* instantiations or not. However, the most natural
20949 interpretation is that it should be an explicit instantiation. */
20952 for (tmp
= TYPE_METHODS (t
); tmp
; tmp
= DECL_CHAIN (tmp
))
20953 if (TREE_CODE (tmp
) == FUNCTION_DECL
20954 && DECL_TEMPLATE_INSTANTIATION (tmp
))
20955 instantiate_class_member (tmp
, extern_p
);
20957 for (tmp
= TYPE_FIELDS (t
); tmp
; tmp
= DECL_CHAIN (tmp
))
20958 if (VAR_P (tmp
) && DECL_TEMPLATE_INSTANTIATION (tmp
))
20959 instantiate_class_member (tmp
, extern_p
);
20961 if (CLASSTYPE_NESTED_UTDS (t
))
20962 binding_table_foreach (CLASSTYPE_NESTED_UTDS (t
),
20963 bt_instantiate_type_proc
, &storage
);
20967 /* Given a function DECL, which is a specialization of TMPL, modify
20968 DECL to be a re-instantiation of TMPL with the same template
20969 arguments. TMPL should be the template into which tsubst'ing
20970 should occur for DECL, not the most general template.
20972 One reason for doing this is a scenario like this:
20975 void f(const T&, int i);
20977 void g() { f(3, 7); }
20980 void f(const T& t, const int i) { }
20982 Note that when the template is first instantiated, with
20983 instantiate_template, the resulting DECL will have no name for the
20984 first parameter, and the wrong type for the second. So, when we go
20985 to instantiate the DECL, we regenerate it. */
20988 regenerate_decl_from_template (tree decl
, tree tmpl
)
20990 /* The arguments used to instantiate DECL, from the most general
20995 args
= DECL_TI_ARGS (decl
);
20996 code_pattern
= DECL_TEMPLATE_RESULT (tmpl
);
20998 /* Make sure that we can see identifiers, and compute access
21000 push_access_scope (decl
);
21002 if (TREE_CODE (decl
) == FUNCTION_DECL
)
21010 args_depth
= TMPL_ARGS_DEPTH (args
);
21011 parms_depth
= TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl
));
21012 if (args_depth
> parms_depth
)
21013 args
= get_innermost_template_args (args
, parms_depth
);
21015 specs
= tsubst_exception_specification (TREE_TYPE (code_pattern
),
21016 args
, tf_error
, NULL_TREE
,
21017 /*defer_ok*/false);
21018 if (specs
&& specs
!= error_mark_node
)
21019 TREE_TYPE (decl
) = build_exception_variant (TREE_TYPE (decl
),
21022 /* Merge parameter declarations. */
21023 decl_parm
= skip_artificial_parms_for (decl
,
21024 DECL_ARGUMENTS (decl
));
21026 = skip_artificial_parms_for (code_pattern
,
21027 DECL_ARGUMENTS (code_pattern
));
21028 while (decl_parm
&& !DECL_PACK_P (pattern_parm
))
21033 if (DECL_NAME (decl_parm
) != DECL_NAME (pattern_parm
))
21034 DECL_NAME (decl_parm
) = DECL_NAME (pattern_parm
);
21035 parm_type
= tsubst (TREE_TYPE (pattern_parm
), args
, tf_error
,
21037 parm_type
= type_decays_to (parm_type
);
21038 if (!same_type_p (TREE_TYPE (decl_parm
), parm_type
))
21039 TREE_TYPE (decl_parm
) = parm_type
;
21040 attributes
= DECL_ATTRIBUTES (pattern_parm
);
21041 if (DECL_ATTRIBUTES (decl_parm
) != attributes
)
21043 DECL_ATTRIBUTES (decl_parm
) = attributes
;
21044 cplus_decl_attributes (&decl_parm
, attributes
, /*flags=*/0);
21046 decl_parm
= DECL_CHAIN (decl_parm
);
21047 pattern_parm
= DECL_CHAIN (pattern_parm
);
21049 /* Merge any parameters that match with the function parameter
21051 if (pattern_parm
&& DECL_PACK_P (pattern_parm
))
21054 tree expanded_types
;
21055 /* Expand the TYPE_PACK_EXPANSION that provides the types for
21056 the parameters in this function parameter pack. */
21057 expanded_types
= tsubst_pack_expansion (TREE_TYPE (pattern_parm
),
21058 args
, tf_error
, NULL_TREE
);
21059 len
= TREE_VEC_LENGTH (expanded_types
);
21060 for (i
= 0; i
< len
; i
++)
21065 if (DECL_NAME (decl_parm
) != DECL_NAME (pattern_parm
))
21066 /* Rename the parameter to include the index. */
21067 DECL_NAME (decl_parm
) =
21068 make_ith_pack_parameter_name (DECL_NAME (pattern_parm
), i
);
21069 parm_type
= TREE_VEC_ELT (expanded_types
, i
);
21070 parm_type
= type_decays_to (parm_type
);
21071 if (!same_type_p (TREE_TYPE (decl_parm
), parm_type
))
21072 TREE_TYPE (decl_parm
) = parm_type
;
21073 attributes
= DECL_ATTRIBUTES (pattern_parm
);
21074 if (DECL_ATTRIBUTES (decl_parm
) != attributes
)
21076 DECL_ATTRIBUTES (decl_parm
) = attributes
;
21077 cplus_decl_attributes (&decl_parm
, attributes
, /*flags=*/0);
21079 decl_parm
= DECL_CHAIN (decl_parm
);
21082 /* Merge additional specifiers from the CODE_PATTERN. */
21083 if (DECL_DECLARED_INLINE_P (code_pattern
)
21084 && !DECL_DECLARED_INLINE_P (decl
))
21085 DECL_DECLARED_INLINE_P (decl
) = 1;
21087 else if (VAR_P (decl
))
21089 DECL_INITIAL (decl
) =
21090 tsubst_expr (DECL_INITIAL (code_pattern
), args
,
21091 tf_error
, DECL_TI_TEMPLATE (decl
),
21092 /*integral_constant_expression_p=*/false);
21093 if (VAR_HAD_UNKNOWN_BOUND (decl
))
21094 TREE_TYPE (decl
) = tsubst (TREE_TYPE (code_pattern
), args
,
21095 tf_error
, DECL_TI_TEMPLATE (decl
));
21098 gcc_unreachable ();
21100 pop_access_scope (decl
);
21103 /* Return the TEMPLATE_DECL into which DECL_TI_ARGS(DECL) should be
21104 substituted to get DECL. */
21107 template_for_substitution (tree decl
)
21109 tree tmpl
= DECL_TI_TEMPLATE (decl
);
21111 /* Set TMPL to the template whose DECL_TEMPLATE_RESULT is the pattern
21112 for the instantiation. This is not always the most general
21113 template. Consider, for example:
21116 struct S { template <class U> void f();
21117 template <> void f<int>(); };
21119 and an instantiation of S<double>::f<int>. We want TD to be the
21120 specialization S<T>::f<int>, not the more general S<T>::f<U>. */
21121 while (/* An instantiation cannot have a definition, so we need a
21122 more general template. */
21123 DECL_TEMPLATE_INSTANTIATION (tmpl
)
21124 /* We must also deal with friend templates. Given:
21126 template <class T> struct S {
21127 template <class U> friend void f() {};
21130 S<int>::f<U> say, is not an instantiation of S<T>::f<U>,
21131 so far as the language is concerned, but that's still
21132 where we get the pattern for the instantiation from. On
21133 other hand, if the definition comes outside the class, say:
21135 template <class T> struct S {
21136 template <class U> friend void f();
21138 template <class U> friend void f() {}
21140 we don't need to look any further. That's what the check for
21141 DECL_INITIAL is for. */
21142 || (TREE_CODE (decl
) == FUNCTION_DECL
21143 && DECL_FRIEND_PSEUDO_TEMPLATE_INSTANTIATION (tmpl
)
21144 && !DECL_INITIAL (DECL_TEMPLATE_RESULT (tmpl
))))
21146 /* The present template, TD, should not be a definition. If it
21147 were a definition, we should be using it! Note that we
21148 cannot restructure the loop to just keep going until we find
21149 a template with a definition, since that might go too far if
21150 a specialization was declared, but not defined. */
21152 /* Fetch the more general template. */
21153 tmpl
= DECL_TI_TEMPLATE (tmpl
);
21159 /* Returns true if we need to instantiate this template instance even if we
21160 know we aren't going to emit it. */
21163 always_instantiate_p (tree decl
)
21165 /* We always instantiate inline functions so that we can inline them. An
21166 explicit instantiation declaration prohibits implicit instantiation of
21167 non-inline functions. With high levels of optimization, we would
21168 normally inline non-inline functions -- but we're not allowed to do
21169 that for "extern template" functions. Therefore, we check
21170 DECL_DECLARED_INLINE_P, rather than possibly_inlined_p. */
21171 return ((TREE_CODE (decl
) == FUNCTION_DECL
21172 && (DECL_DECLARED_INLINE_P (decl
)
21173 || type_uses_auto (TREE_TYPE (TREE_TYPE (decl
)))))
21174 /* And we need to instantiate static data members so that
21175 their initializers are available in integral constant
21178 && decl_maybe_constant_var_p (decl
)));
21181 /* If FN has a noexcept-specifier that hasn't been instantiated yet,
21182 instantiate it now, modifying TREE_TYPE (fn). */
21185 maybe_instantiate_noexcept (tree fn
)
21187 tree fntype
, spec
, noex
, clone
;
21189 /* Don't instantiate a noexcept-specification from template context. */
21190 if (processing_template_decl
)
21193 if (DECL_CLONED_FUNCTION_P (fn
))
21194 fn
= DECL_CLONED_FUNCTION (fn
);
21195 fntype
= TREE_TYPE (fn
);
21196 spec
= TYPE_RAISES_EXCEPTIONS (fntype
);
21198 if (!spec
|| !TREE_PURPOSE (spec
))
21201 noex
= TREE_PURPOSE (spec
);
21203 if (TREE_CODE (noex
) == DEFERRED_NOEXCEPT
)
21205 if (DEFERRED_NOEXCEPT_PATTERN (noex
) == NULL_TREE
)
21206 spec
= get_defaulted_eh_spec (fn
);
21207 else if (push_tinst_level (fn
))
21209 push_access_scope (fn
);
21210 push_deferring_access_checks (dk_no_deferred
);
21211 input_location
= DECL_SOURCE_LOCATION (fn
);
21212 noex
= tsubst_copy_and_build (DEFERRED_NOEXCEPT_PATTERN (noex
),
21213 DEFERRED_NOEXCEPT_ARGS (noex
),
21214 tf_warning_or_error
, fn
,
21215 /*function_p=*/false,
21216 /*integral_constant_expression_p=*/true);
21217 pop_deferring_access_checks ();
21218 pop_access_scope (fn
);
21219 pop_tinst_level ();
21220 spec
= build_noexcept_spec (noex
, tf_warning_or_error
);
21221 if (spec
== error_mark_node
)
21222 spec
= noexcept_false_spec
;
21225 spec
= noexcept_false_spec
;
21227 TREE_TYPE (fn
) = build_exception_variant (fntype
, spec
);
21230 FOR_EACH_CLONE (clone
, fn
)
21232 if (TREE_TYPE (clone
) == fntype
)
21233 TREE_TYPE (clone
) = TREE_TYPE (fn
);
21235 TREE_TYPE (clone
) = build_exception_variant (TREE_TYPE (clone
), spec
);
21239 /* Produce the definition of D, a _DECL generated from a template. If
21240 DEFER_OK is nonzero, then we don't have to actually do the
21241 instantiation now; we just have to do it sometime. Normally it is
21242 an error if this is an explicit instantiation but D is undefined.
21243 EXPL_INST_CLASS_MEM_P is true iff D is a member of an
21244 explicitly instantiated class template. */
21247 instantiate_decl (tree d
, int defer_ok
,
21248 bool expl_inst_class_mem_p
)
21250 tree tmpl
= DECL_TI_TEMPLATE (d
);
21257 bool pattern_defined
;
21258 location_t saved_loc
= input_location
;
21259 int saved_unevaluated_operand
= cp_unevaluated_operand
;
21260 int saved_inhibit_evaluation_warnings
= c_inhibit_evaluation_warnings
;
21264 bool nested
= false;
21266 /* This function should only be used to instantiate templates for
21267 functions and static member variables. */
21268 gcc_assert (VAR_OR_FUNCTION_DECL_P (d
));
21270 /* A concept is never instantiated. */
21271 gcc_assert (!DECL_DECLARED_CONCEPT_P (d
));
21273 /* Variables are never deferred; if instantiation is required, they
21274 are instantiated right away. That allows for better code in the
21275 case that an expression refers to the value of the variable --
21276 if the variable has a constant value the referring expression can
21277 take advantage of that fact. */
21279 || DECL_DECLARED_CONSTEXPR_P (d
))
21282 /* Don't instantiate cloned functions. Instead, instantiate the
21283 functions they cloned. */
21284 if (TREE_CODE (d
) == FUNCTION_DECL
&& DECL_CLONED_FUNCTION_P (d
))
21285 d
= DECL_CLONED_FUNCTION (d
);
21287 if (DECL_TEMPLATE_INSTANTIATED (d
)
21288 || (TREE_CODE (d
) == FUNCTION_DECL
21289 && DECL_DEFAULTED_FN (d
) && DECL_INITIAL (d
))
21290 || DECL_TEMPLATE_SPECIALIZATION (d
))
21291 /* D has already been instantiated or explicitly specialized, so
21292 there's nothing for us to do here.
21294 It might seem reasonable to check whether or not D is an explicit
21295 instantiation, and, if so, stop here. But when an explicit
21296 instantiation is deferred until the end of the compilation,
21297 DECL_EXPLICIT_INSTANTIATION is set, even though we still need to do
21298 the instantiation. */
21301 /* Check to see whether we know that this template will be
21302 instantiated in some other file, as with "extern template"
21304 external_p
= (DECL_INTERFACE_KNOWN (d
) && DECL_REALLY_EXTERN (d
));
21306 /* In general, we do not instantiate such templates. */
21307 if (external_p
&& !always_instantiate_p (d
))
21310 gen_tmpl
= most_general_template (tmpl
);
21311 gen_args
= DECL_TI_ARGS (d
);
21313 if (tmpl
!= gen_tmpl
)
21314 /* We should already have the extra args. */
21315 gcc_assert (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (gen_tmpl
))
21316 == TMPL_ARGS_DEPTH (gen_args
));
21317 /* And what's in the hash table should match D. */
21318 gcc_assert ((spec
= retrieve_specialization (gen_tmpl
, gen_args
, 0)) == d
21319 || spec
== NULL_TREE
);
21321 /* This needs to happen before any tsubsting. */
21322 if (! push_tinst_level (d
))
21325 timevar_push (TV_TEMPLATE_INST
);
21327 /* Set TD to the template whose DECL_TEMPLATE_RESULT is the pattern
21328 for the instantiation. */
21329 td
= template_for_substitution (d
);
21330 code_pattern
= DECL_TEMPLATE_RESULT (td
);
21332 /* We should never be trying to instantiate a member of a class
21333 template or partial specialization. */
21334 gcc_assert (d
!= code_pattern
);
21336 if ((DECL_NAMESPACE_SCOPE_P (d
) && !DECL_INITIALIZED_IN_CLASS_P (d
))
21337 || DECL_TEMPLATE_SPECIALIZATION (td
))
21338 /* In the case of a friend template whose definition is provided
21339 outside the class, we may have too many arguments. Drop the
21340 ones we don't need. The same is true for specializations. */
21341 args
= get_innermost_template_args
21342 (gen_args
, TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (td
)));
21346 if (TREE_CODE (d
) == FUNCTION_DECL
)
21348 deleted_p
= DECL_DELETED_FN (code_pattern
);
21349 pattern_defined
= (DECL_SAVED_TREE (code_pattern
) != NULL_TREE
21350 || DECL_DEFAULTED_OUTSIDE_CLASS_P (code_pattern
)
21356 pattern_defined
= ! DECL_IN_AGGR_P (code_pattern
);
21359 /* We may be in the middle of deferred access check. Disable it now. */
21360 push_deferring_access_checks (dk_no_deferred
);
21362 /* Unless an explicit instantiation directive has already determined
21363 the linkage of D, remember that a definition is available for
21365 if (pattern_defined
21366 && !DECL_INTERFACE_KNOWN (d
)
21367 && !DECL_NOT_REALLY_EXTERN (d
))
21368 mark_definable (d
);
21370 DECL_SOURCE_LOCATION (td
) = DECL_SOURCE_LOCATION (code_pattern
);
21371 DECL_SOURCE_LOCATION (d
) = DECL_SOURCE_LOCATION (code_pattern
);
21372 input_location
= DECL_SOURCE_LOCATION (d
);
21374 /* If D is a member of an explicitly instantiated class template,
21375 and no definition is available, treat it like an implicit
21377 if (!pattern_defined
&& expl_inst_class_mem_p
21378 && DECL_EXPLICIT_INSTANTIATION (d
))
21380 /* Leave linkage flags alone on instantiations with anonymous
21382 if (TREE_PUBLIC (d
))
21384 DECL_NOT_REALLY_EXTERN (d
) = 0;
21385 DECL_INTERFACE_KNOWN (d
) = 0;
21387 SET_DECL_IMPLICIT_INSTANTIATION (d
);
21390 /* Defer all other templates, unless we have been explicitly
21391 forbidden from doing so. */
21392 if (/* If there is no definition, we cannot instantiate the
21395 /* If it's OK to postpone instantiation, do so. */
21397 /* If this is a static data member that will be defined
21398 elsewhere, we don't want to instantiate the entire data
21399 member, but we do want to instantiate the initializer so that
21400 we can substitute that elsewhere. */
21401 || (external_p
&& VAR_P (d
))
21402 /* Handle here a deleted function too, avoid generating
21403 its body (c++/61080). */
21406 /* The definition of the static data member is now required so
21407 we must substitute the initializer. */
21409 && !DECL_INITIAL (d
)
21410 && DECL_INITIAL (code_pattern
))
21414 bool const_init
= false;
21415 bool enter_context
= DECL_CLASS_SCOPE_P (d
);
21417 ns
= decl_namespace_context (d
);
21418 push_nested_namespace (ns
);
21420 push_nested_class (DECL_CONTEXT (d
));
21421 init
= tsubst_expr (DECL_INITIAL (code_pattern
),
21423 tf_warning_or_error
, NULL_TREE
,
21424 /*integral_constant_expression_p=*/false);
21425 /* If instantiating the initializer involved instantiating this
21426 again, don't call cp_finish_decl twice. */
21427 if (!DECL_INITIAL (d
))
21429 /* Make sure the initializer is still constant, in case of
21430 circular dependency (template/instantiate6.C). */
21432 = DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (code_pattern
);
21433 cp_finish_decl (d
, init
, /*init_const_expr_p=*/const_init
,
21434 /*asmspec_tree=*/NULL_TREE
,
21435 LOOKUP_ONLYCONVERTING
);
21438 pop_nested_class ();
21439 pop_nested_namespace (ns
);
21442 /* We restore the source position here because it's used by
21443 add_pending_template. */
21444 input_location
= saved_loc
;
21446 if (at_eof
&& !pattern_defined
21447 && DECL_EXPLICIT_INSTANTIATION (d
)
21448 && DECL_NOT_REALLY_EXTERN (d
))
21451 The definition of a non-exported function template, a
21452 non-exported member function template, or a non-exported
21453 member function or static data member of a class template
21454 shall be present in every translation unit in which it is
21455 explicitly instantiated. */
21456 permerror (input_location
, "explicit instantiation of %qD "
21457 "but no definition available", d
);
21459 /* If we're in unevaluated context, we just wanted to get the
21460 constant value; this isn't an odr use, so don't queue
21461 a full instantiation. */
21462 if (cp_unevaluated_operand
!= 0)
21464 /* ??? Historically, we have instantiated inline functions, even
21465 when marked as "extern template". */
21466 if (!(external_p
&& VAR_P (d
)))
21467 add_pending_template (d
);
21470 /* Tell the repository that D is available in this translation unit
21471 -- and see if it is supposed to be instantiated here. */
21472 if (TREE_PUBLIC (d
) && !DECL_REALLY_EXTERN (d
) && !repo_emit_p (d
))
21474 /* In a PCH file, despite the fact that the repository hasn't
21475 requested instantiation in the PCH it is still possible that
21476 an instantiation will be required in a file that includes the
21479 add_pending_template (d
);
21480 /* Instantiate inline functions so that the inliner can do its
21481 job, even though we'll not be emitting a copy of this
21483 if (!(TREE_CODE (d
) == FUNCTION_DECL
&& possibly_inlined_p (d
)))
21487 fn_context
= decl_function_context (d
);
21488 nested
= (current_function_decl
!= NULL_TREE
);
21489 vec
<tree
> omp_privatization_save
;
21491 save_omp_privatization_clauses (omp_privatization_save
);
21494 push_to_top_level ();
21498 push_function_context ();
21499 cp_unevaluated_operand
= 0;
21500 c_inhibit_evaluation_warnings
= 0;
21503 /* Mark D as instantiated so that recursive calls to
21504 instantiate_decl do not try to instantiate it again. */
21505 DECL_TEMPLATE_INSTANTIATED (d
) = 1;
21507 /* Regenerate the declaration in case the template has been modified
21508 by a subsequent redeclaration. */
21509 regenerate_decl_from_template (d
, td
);
21511 /* We already set the file and line above. Reset them now in case
21512 they changed as a result of calling regenerate_decl_from_template. */
21513 input_location
= DECL_SOURCE_LOCATION (d
);
21518 bool const_init
= false;
21520 /* Clear out DECL_RTL; whatever was there before may not be right
21521 since we've reset the type of the declaration. */
21522 SET_DECL_RTL (d
, NULL
);
21523 DECL_IN_AGGR_P (d
) = 0;
21525 /* The initializer is placed in DECL_INITIAL by
21526 regenerate_decl_from_template so we don't need to
21527 push/pop_access_scope again here. Pull it out so that
21528 cp_finish_decl can process it. */
21529 init
= DECL_INITIAL (d
);
21530 DECL_INITIAL (d
) = NULL_TREE
;
21531 DECL_INITIALIZED_P (d
) = 0;
21533 /* Clear DECL_EXTERNAL so that cp_finish_decl will process the
21534 initializer. That function will defer actual emission until
21535 we have a chance to determine linkage. */
21536 DECL_EXTERNAL (d
) = 0;
21538 /* Enter the scope of D so that access-checking works correctly. */
21539 bool enter_context
= DECL_CLASS_SCOPE_P (d
);
21541 push_nested_class (DECL_CONTEXT (d
));
21543 const_init
= DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (code_pattern
);
21544 cp_finish_decl (d
, init
, const_init
, NULL_TREE
, 0);
21547 pop_nested_class ();
21549 if (variable_template_p (td
))
21550 note_variable_template_instantiation (d
);
21552 else if (TREE_CODE (d
) == FUNCTION_DECL
&& DECL_DEFAULTED_FN (code_pattern
))
21553 synthesize_method (d
);
21554 else if (TREE_CODE (d
) == FUNCTION_DECL
)
21556 hash_map
<tree
, tree
> *saved_local_specializations
;
21560 tree block
= NULL_TREE
;
21562 /* Save away the current list, in case we are instantiating one
21563 template from within the body of another. */
21564 saved_local_specializations
= local_specializations
;
21566 /* Set up the list of local specializations. */
21567 local_specializations
= new hash_map
<tree
, tree
>;
21569 /* Set up context. */
21570 if (DECL_OMP_DECLARE_REDUCTION_P (code_pattern
)
21571 && TREE_CODE (DECL_CONTEXT (code_pattern
)) == FUNCTION_DECL
)
21572 block
= push_stmt_list ();
21574 start_preparsed_function (d
, NULL_TREE
, SF_PRE_PARSED
);
21576 /* Some typedefs referenced from within the template code need to be
21577 access checked at template instantiation time, i.e now. These
21578 types were added to the template at parsing time. Let's get those
21579 and perform the access checks then. */
21580 perform_typedefs_access_check (DECL_TEMPLATE_RESULT (gen_tmpl
),
21583 /* Create substitution entries for the parameters. */
21584 subst_decl
= DECL_TEMPLATE_RESULT (template_for_substitution (d
));
21585 tmpl_parm
= DECL_ARGUMENTS (subst_decl
);
21586 spec_parm
= DECL_ARGUMENTS (d
);
21587 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (d
))
21589 register_local_specialization (spec_parm
, tmpl_parm
);
21590 spec_parm
= skip_artificial_parms_for (d
, spec_parm
);
21591 tmpl_parm
= skip_artificial_parms_for (subst_decl
, tmpl_parm
);
21593 for (; tmpl_parm
; tmpl_parm
= DECL_CHAIN (tmpl_parm
))
21595 if (!DECL_PACK_P (tmpl_parm
))
21597 register_local_specialization (spec_parm
, tmpl_parm
);
21598 spec_parm
= DECL_CHAIN (spec_parm
);
21602 /* Register the (value) argument pack as a specialization of
21603 TMPL_PARM, then move on. */
21604 tree argpack
= extract_fnparm_pack (tmpl_parm
, &spec_parm
);
21605 register_local_specialization (argpack
, tmpl_parm
);
21608 gcc_assert (!spec_parm
);
21610 /* Substitute into the body of the function. */
21611 if (DECL_OMP_DECLARE_REDUCTION_P (code_pattern
))
21612 tsubst_omp_udr (DECL_SAVED_TREE (code_pattern
), args
,
21613 tf_warning_or_error
, tmpl
);
21616 tsubst_expr (DECL_SAVED_TREE (code_pattern
), args
,
21617 tf_warning_or_error
, tmpl
,
21618 /*integral_constant_expression_p=*/false);
21620 /* Set the current input_location to the end of the function
21621 so that finish_function knows where we are. */
21623 = DECL_STRUCT_FUNCTION (code_pattern
)->function_end_locus
;
21625 /* Remember if we saw an infinite loop in the template. */
21626 current_function_infinite_loop
21627 = DECL_STRUCT_FUNCTION (code_pattern
)->language
->infinite_loop
;
21630 /* We don't need the local specializations any more. */
21631 delete local_specializations
;
21632 local_specializations
= saved_local_specializations
;
21634 /* Finish the function. */
21635 if (DECL_OMP_DECLARE_REDUCTION_P (code_pattern
)
21636 && TREE_CODE (DECL_CONTEXT (code_pattern
)) == FUNCTION_DECL
)
21637 DECL_SAVED_TREE (d
) = pop_stmt_list (block
);
21640 d
= finish_function (0);
21641 expand_or_defer_fn (d
);
21644 if (DECL_OMP_DECLARE_REDUCTION_P (code_pattern
))
21645 cp_check_omp_declare_reduction (d
);
21648 /* We're not deferring instantiation any more. */
21649 TI_PENDING_TEMPLATE_FLAG (DECL_TEMPLATE_INFO (d
)) = 0;
21652 pop_from_top_level ();
21654 pop_function_context ();
21657 input_location
= saved_loc
;
21658 cp_unevaluated_operand
= saved_unevaluated_operand
;
21659 c_inhibit_evaluation_warnings
= saved_inhibit_evaluation_warnings
;
21660 pop_deferring_access_checks ();
21661 pop_tinst_level ();
21663 restore_omp_privatization_clauses (omp_privatization_save
);
21665 timevar_pop (TV_TEMPLATE_INST
);
21670 /* Run through the list of templates that we wish we could
21671 instantiate, and instantiate any we can. RETRIES is the
21672 number of times we retry pending template instantiation. */
21675 instantiate_pending_templates (int retries
)
21678 location_t saved_loc
= input_location
;
21680 /* Instantiating templates may trigger vtable generation. This in turn
21681 may require further template instantiations. We place a limit here
21682 to avoid infinite loop. */
21683 if (pending_templates
&& retries
>= max_tinst_depth
)
21685 tree decl
= pending_templates
->tinst
->decl
;
21687 fatal_error (input_location
,
21688 "template instantiation depth exceeds maximum of %d"
21689 " instantiating %q+D, possibly from virtual table generation"
21690 " (use -ftemplate-depth= to increase the maximum)",
21691 max_tinst_depth
, decl
);
21692 if (TREE_CODE (decl
) == FUNCTION_DECL
)
21693 /* Pretend that we defined it. */
21694 DECL_INITIAL (decl
) = error_mark_node
;
21700 struct pending_template
**t
= &pending_templates
;
21701 struct pending_template
*last
= NULL
;
21705 tree instantiation
= reopen_tinst_level ((*t
)->tinst
);
21706 bool complete
= false;
21708 if (TYPE_P (instantiation
))
21712 if (!COMPLETE_TYPE_P (instantiation
))
21714 instantiate_class_template (instantiation
);
21715 if (CLASSTYPE_TEMPLATE_INSTANTIATION (instantiation
))
21716 for (fn
= TYPE_METHODS (instantiation
);
21718 fn
= TREE_CHAIN (fn
))
21719 if (! DECL_ARTIFICIAL (fn
))
21720 instantiate_decl (fn
,
21722 /*expl_inst_class_mem_p=*/false);
21723 if (COMPLETE_TYPE_P (instantiation
))
21727 complete
= COMPLETE_TYPE_P (instantiation
);
21731 if (!DECL_TEMPLATE_SPECIALIZATION (instantiation
)
21732 && !DECL_TEMPLATE_INSTANTIATED (instantiation
))
21735 = instantiate_decl (instantiation
,
21737 /*expl_inst_class_mem_p=*/false);
21738 if (DECL_TEMPLATE_INSTANTIATED (instantiation
))
21742 complete
= (DECL_TEMPLATE_SPECIALIZATION (instantiation
)
21743 || DECL_TEMPLATE_INSTANTIATED (instantiation
));
21747 /* If INSTANTIATION has been instantiated, then we don't
21748 need to consider it again in the future. */
21756 current_tinst_level
= NULL
;
21758 last_pending_template
= last
;
21760 while (reconsider
);
21762 input_location
= saved_loc
;
21765 /* Substitute ARGVEC into T, which is a list of initializers for
21766 either base class or a non-static data member. The TREE_PURPOSEs
21767 are DECLs, and the TREE_VALUEs are the initializer values. Used by
21768 instantiate_decl. */
21771 tsubst_initializer_list (tree t
, tree argvec
)
21773 tree inits
= NULL_TREE
;
21775 for (; t
; t
= TREE_CHAIN (t
))
21779 tree expanded_bases
= NULL_TREE
;
21780 tree expanded_arguments
= NULL_TREE
;
21783 if (TREE_CODE (TREE_PURPOSE (t
)) == TYPE_PACK_EXPANSION
)
21788 /* Expand the base class expansion type into separate base
21790 expanded_bases
= tsubst_pack_expansion (TREE_PURPOSE (t
), argvec
,
21791 tf_warning_or_error
,
21793 if (expanded_bases
== error_mark_node
)
21796 /* We'll be building separate TREE_LISTs of arguments for
21798 len
= TREE_VEC_LENGTH (expanded_bases
);
21799 expanded_arguments
= make_tree_vec (len
);
21800 for (i
= 0; i
< len
; i
++)
21801 TREE_VEC_ELT (expanded_arguments
, i
) = NULL_TREE
;
21803 /* Build a dummy EXPR_PACK_EXPANSION that will be used to
21804 expand each argument in the TREE_VALUE of t. */
21805 expr
= make_node (EXPR_PACK_EXPANSION
);
21806 PACK_EXPANSION_LOCAL_P (expr
) = true;
21807 PACK_EXPANSION_PARAMETER_PACKS (expr
) =
21808 PACK_EXPANSION_PARAMETER_PACKS (TREE_PURPOSE (t
));
21810 if (TREE_VALUE (t
) == void_type_node
)
21811 /* VOID_TYPE_NODE is used to indicate
21812 value-initialization. */
21814 for (i
= 0; i
< len
; i
++)
21815 TREE_VEC_ELT (expanded_arguments
, i
) = void_type_node
;
21819 /* Substitute parameter packs into each argument in the
21821 in_base_initializer
= 1;
21822 for (arg
= TREE_VALUE (t
); arg
; arg
= TREE_CHAIN (arg
))
21824 tree expanded_exprs
;
21826 /* Expand the argument. */
21827 SET_PACK_EXPANSION_PATTERN (expr
, TREE_VALUE (arg
));
21829 = tsubst_pack_expansion (expr
, argvec
,
21830 tf_warning_or_error
,
21832 if (expanded_exprs
== error_mark_node
)
21835 /* Prepend each of the expanded expressions to the
21836 corresponding TREE_LIST in EXPANDED_ARGUMENTS. */
21837 for (i
= 0; i
< len
; i
++)
21839 TREE_VEC_ELT (expanded_arguments
, i
) =
21840 tree_cons (NULL_TREE
,
21841 TREE_VEC_ELT (expanded_exprs
, i
),
21842 TREE_VEC_ELT (expanded_arguments
, i
));
21845 in_base_initializer
= 0;
21847 /* Reverse all of the TREE_LISTs in EXPANDED_ARGUMENTS,
21848 since we built them backwards. */
21849 for (i
= 0; i
< len
; i
++)
21851 TREE_VEC_ELT (expanded_arguments
, i
) =
21852 nreverse (TREE_VEC_ELT (expanded_arguments
, i
));
21857 for (i
= 0; i
< len
; ++i
)
21859 if (expanded_bases
)
21861 decl
= TREE_VEC_ELT (expanded_bases
, i
);
21862 decl
= expand_member_init (decl
);
21863 init
= TREE_VEC_ELT (expanded_arguments
, i
);
21868 decl
= tsubst_copy (TREE_PURPOSE (t
), argvec
,
21869 tf_warning_or_error
, NULL_TREE
);
21871 decl
= expand_member_init (decl
);
21872 if (decl
&& !DECL_P (decl
))
21873 in_base_initializer
= 1;
21875 init
= TREE_VALUE (t
);
21877 if (init
!= void_type_node
)
21878 init
= tsubst_expr (init
, argvec
,
21879 tf_warning_or_error
, NULL_TREE
,
21880 /*integral_constant_expression_p=*/false);
21881 if (init
== NULL_TREE
&& tmp
!= NULL_TREE
)
21882 /* If we had an initializer but it instantiated to nothing,
21883 value-initialize the object. This will only occur when
21884 the initializer was a pack expansion where the parameter
21885 packs used in that expansion were of length zero. */
21886 init
= void_type_node
;
21887 in_base_initializer
= 0;
21892 init
= build_tree_list (decl
, init
);
21893 TREE_CHAIN (init
) = inits
;
21901 /* Set CURRENT_ACCESS_SPECIFIER based on the protection of DECL. */
21904 set_current_access_from_decl (tree decl
)
21906 if (TREE_PRIVATE (decl
))
21907 current_access_specifier
= access_private_node
;
21908 else if (TREE_PROTECTED (decl
))
21909 current_access_specifier
= access_protected_node
;
21911 current_access_specifier
= access_public_node
;
21914 /* Instantiate an enumerated type. TAG is the template type, NEWTAG
21915 is the instantiation (which should have been created with
21916 start_enum) and ARGS are the template arguments to use. */
21919 tsubst_enum (tree tag
, tree newtag
, tree args
)
21923 if (SCOPED_ENUM_P (newtag
))
21924 begin_scope (sk_scoped_enum
, newtag
);
21926 for (e
= TYPE_VALUES (tag
); e
; e
= TREE_CHAIN (e
))
21931 decl
= TREE_VALUE (e
);
21932 /* Note that in a template enum, the TREE_VALUE is the
21933 CONST_DECL, not the corresponding INTEGER_CST. */
21934 value
= tsubst_expr (DECL_INITIAL (decl
),
21935 args
, tf_warning_or_error
, NULL_TREE
,
21936 /*integral_constant_expression_p=*/true);
21938 /* Give this enumeration constant the correct access. */
21939 set_current_access_from_decl (decl
);
21941 /* Actually build the enumerator itself. Here we're assuming that
21942 enumerators can't have dependent attributes. */
21943 build_enumerator (DECL_NAME (decl
), value
, newtag
,
21944 DECL_ATTRIBUTES (decl
), DECL_SOURCE_LOCATION (decl
));
21947 if (SCOPED_ENUM_P (newtag
))
21950 finish_enum_value_list (newtag
);
21951 finish_enum (newtag
);
21953 DECL_SOURCE_LOCATION (TYPE_NAME (newtag
))
21954 = DECL_SOURCE_LOCATION (TYPE_NAME (tag
));
21957 /* DECL is a FUNCTION_DECL that is a template specialization. Return
21958 its type -- but without substituting the innermost set of template
21959 arguments. So, innermost set of template parameters will appear in
21963 get_mostly_instantiated_function_type (tree decl
)
21965 /* For a function, DECL_TI_TEMPLATE is partially instantiated. */
21966 return TREE_TYPE (DECL_TI_TEMPLATE (decl
));
21969 /* Return truthvalue if we're processing a template different from
21970 the last one involved in diagnostics. */
21972 problematic_instantiation_changed (void)
21974 return current_tinst_level
!= last_error_tinst_level
;
21977 /* Remember current template involved in diagnostics. */
21979 record_last_problematic_instantiation (void)
21981 last_error_tinst_level
= current_tinst_level
;
21984 struct tinst_level
*
21985 current_instantiation (void)
21987 return current_tinst_level
;
21990 /* Return TRUE if current_function_decl is being instantiated, false
21994 instantiating_current_function_p (void)
21996 return (current_instantiation ()
21997 && current_instantiation ()->decl
== current_function_decl
);
22000 /* [temp.param] Check that template non-type parm TYPE is of an allowable
22001 type. Return zero for ok, nonzero for disallowed. Issue error and
22002 warning messages under control of COMPLAIN. */
22005 invalid_nontype_parm_type_p (tree type
, tsubst_flags_t complain
)
22007 if (INTEGRAL_OR_ENUMERATION_TYPE_P (type
))
22009 else if (POINTER_TYPE_P (type
))
22011 else if (TYPE_PTRMEM_P (type
))
22013 else if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
)
22015 else if (TREE_CODE (type
) == TYPENAME_TYPE
)
22017 else if (TREE_CODE (type
) == DECLTYPE_TYPE
)
22019 else if (TREE_CODE (type
) == NULLPTR_TYPE
)
22021 /* A bound template template parm could later be instantiated to have a valid
22022 nontype parm type via an alias template. */
22023 else if (cxx_dialect
>= cxx11
22024 && TREE_CODE (type
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
22027 if (complain
& tf_error
)
22029 if (type
== error_mark_node
)
22030 inform (input_location
, "invalid template non-type parameter");
22032 error ("%q#T is not a valid type for a template non-type parameter",
22038 /* Returns TRUE if TYPE is dependent, in the sense of [temp.dep.type].
22039 Assumes that TYPE really is a type, and not the ERROR_MARK_NODE.*/
22042 dependent_type_p_r (tree type
)
22048 A type is dependent if it is:
22050 -- a template parameter. Template template parameters are types
22051 for us (since TYPE_P holds true for them) so we handle
22053 if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
22054 || TREE_CODE (type
) == TEMPLATE_TEMPLATE_PARM
)
22056 /* -- a qualified-id with a nested-name-specifier which contains a
22057 class-name that names a dependent type or whose unqualified-id
22058 names a dependent type. */
22059 if (TREE_CODE (type
) == TYPENAME_TYPE
)
22062 /* An alias template specialization can be dependent even if the
22063 resulting type is not. */
22064 if (dependent_alias_template_spec_p (type
))
22067 /* -- a cv-qualified type where the cv-unqualified type is
22069 No code is necessary for this bullet; the code below handles
22070 cv-qualified types, and we don't want to strip aliases with
22071 TYPE_MAIN_VARIANT because of DR 1558. */
22072 /* -- a compound type constructed from any dependent type. */
22073 if (TYPE_PTRMEM_P (type
))
22074 return (dependent_type_p (TYPE_PTRMEM_CLASS_TYPE (type
))
22075 || dependent_type_p (TYPE_PTRMEM_POINTED_TO_TYPE
22077 else if (TYPE_PTR_P (type
)
22078 || TREE_CODE (type
) == REFERENCE_TYPE
)
22079 return dependent_type_p (TREE_TYPE (type
));
22080 else if (TREE_CODE (type
) == FUNCTION_TYPE
22081 || TREE_CODE (type
) == METHOD_TYPE
)
22085 if (dependent_type_p (TREE_TYPE (type
)))
22087 for (arg_type
= TYPE_ARG_TYPES (type
);
22089 arg_type
= TREE_CHAIN (arg_type
))
22090 if (dependent_type_p (TREE_VALUE (arg_type
)))
22094 /* -- an array type constructed from any dependent type or whose
22095 size is specified by a constant expression that is
22098 We checked for type- and value-dependence of the bounds in
22099 compute_array_index_type, so TYPE_DEPENDENT_P is already set. */
22100 if (TREE_CODE (type
) == ARRAY_TYPE
)
22102 if (TYPE_DOMAIN (type
)
22103 && dependent_type_p (TYPE_DOMAIN (type
)))
22105 return dependent_type_p (TREE_TYPE (type
));
22108 /* -- a template-id in which either the template name is a template
22110 if (TREE_CODE (type
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
22112 /* ... or any of the template arguments is a dependent type or
22113 an expression that is type-dependent or value-dependent. */
22114 else if (CLASS_TYPE_P (type
) && CLASSTYPE_TEMPLATE_INFO (type
)
22115 && (any_dependent_template_arguments_p
22116 (INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (type
)))))
22119 /* All TYPEOF_TYPEs, DECLTYPE_TYPEs, and UNDERLYING_TYPEs are
22120 dependent; if the argument of the `typeof' expression is not
22121 type-dependent, then it should already been have resolved. */
22122 if (TREE_CODE (type
) == TYPEOF_TYPE
22123 || TREE_CODE (type
) == DECLTYPE_TYPE
22124 || TREE_CODE (type
) == UNDERLYING_TYPE
)
22127 /* A template argument pack is dependent if any of its packed
22129 if (TREE_CODE (type
) == TYPE_ARGUMENT_PACK
)
22131 tree args
= ARGUMENT_PACK_ARGS (type
);
22132 int i
, len
= TREE_VEC_LENGTH (args
);
22133 for (i
= 0; i
< len
; ++i
)
22134 if (dependent_template_arg_p (TREE_VEC_ELT (args
, i
)))
22138 /* All TYPE_PACK_EXPANSIONs are dependent, because parameter packs must
22139 be template parameters. */
22140 if (TREE_CODE (type
) == TYPE_PACK_EXPANSION
)
22143 /* The standard does not specifically mention types that are local
22144 to template functions or local classes, but they should be
22145 considered dependent too. For example:
22147 template <int I> void f() {
22152 The size of `E' cannot be known until the value of `I' has been
22153 determined. Therefore, `E' must be considered dependent. */
22154 scope
= TYPE_CONTEXT (type
);
22155 if (scope
&& TYPE_P (scope
))
22156 return dependent_type_p (scope
);
22157 /* Don't use type_dependent_expression_p here, as it can lead
22158 to infinite recursion trying to determine whether a lambda
22159 nested in a lambda is dependent (c++/47687). */
22160 else if (scope
&& TREE_CODE (scope
) == FUNCTION_DECL
22161 && DECL_LANG_SPECIFIC (scope
)
22162 && DECL_TEMPLATE_INFO (scope
)
22163 && (any_dependent_template_arguments_p
22164 (INNERMOST_TEMPLATE_ARGS (DECL_TI_ARGS (scope
)))))
22167 /* Other types are non-dependent. */
22171 /* Returns TRUE if TYPE is dependent, in the sense of
22172 [temp.dep.type]. Note that a NULL type is considered dependent. */
22175 dependent_type_p (tree type
)
22177 /* If there are no template parameters in scope, then there can't be
22178 any dependent types. */
22179 if (!processing_template_decl
)
22181 /* If we are not processing a template, then nobody should be
22182 providing us with a dependent type. */
22184 gcc_assert (TREE_CODE (type
) != TEMPLATE_TYPE_PARM
|| is_auto (type
));
22188 /* If the type is NULL, we have not computed a type for the entity
22189 in question; in that case, the type is dependent. */
22193 /* Erroneous types can be considered non-dependent. */
22194 if (type
== error_mark_node
)
22197 /* If we have not already computed the appropriate value for TYPE,
22199 if (!TYPE_DEPENDENT_P_VALID (type
))
22201 TYPE_DEPENDENT_P (type
) = dependent_type_p_r (type
);
22202 TYPE_DEPENDENT_P_VALID (type
) = 1;
22205 return TYPE_DEPENDENT_P (type
);
22208 /* Returns TRUE if SCOPE is a dependent scope, in which we can't do any
22209 lookup. In other words, a dependent type that is not the current
22213 dependent_scope_p (tree scope
)
22215 return (scope
&& TYPE_P (scope
) && dependent_type_p (scope
)
22216 && !currently_open_class (scope
));
22219 /* T is a SCOPE_REF; return whether we need to consider it
22220 instantiation-dependent so that we can check access at instantiation
22221 time even though we know which member it resolves to. */
22224 instantiation_dependent_scope_ref_p (tree t
)
22226 if (DECL_P (TREE_OPERAND (t
, 1))
22227 && CLASS_TYPE_P (TREE_OPERAND (t
, 0))
22228 && accessible_in_template_p (TREE_OPERAND (t
, 0),
22229 TREE_OPERAND (t
, 1)))
22235 /* Returns TRUE if the EXPRESSION is value-dependent, in the sense of
22236 [temp.dep.constexpr]. EXPRESSION is already known to be a constant
22239 /* Note that this predicate is not appropriate for general expressions;
22240 only constant expressions (that satisfy potential_constant_expression)
22241 can be tested for value dependence. */
22244 value_dependent_expression_p (tree expression
)
22246 if (!processing_template_decl
)
22249 /* A name declared with a dependent type. */
22250 if (DECL_P (expression
) && type_dependent_expression_p (expression
))
22253 switch (TREE_CODE (expression
))
22255 case IDENTIFIER_NODE
:
22256 /* A name that has not been looked up -- must be dependent. */
22259 case TEMPLATE_PARM_INDEX
:
22260 /* A non-type template parm. */
22264 /* A non-type template parm. */
22265 if (DECL_TEMPLATE_PARM_P (expression
))
22267 return value_dependent_expression_p (DECL_INITIAL (expression
));
22270 /* A constant with literal type and is initialized
22271 with an expression that is value-dependent.
22273 Note that a non-dependent parenthesized initializer will have
22274 already been replaced with its constant value, so if we see
22275 a TREE_LIST it must be dependent. */
22276 if (DECL_INITIAL (expression
)
22277 && decl_constant_var_p (expression
)
22278 && (TREE_CODE (DECL_INITIAL (expression
)) == TREE_LIST
22279 /* cp_finish_decl doesn't fold reference initializers. */
22280 || TREE_CODE (TREE_TYPE (expression
)) == REFERENCE_TYPE
22281 || value_dependent_expression_p (DECL_INITIAL (expression
))))
22285 case DYNAMIC_CAST_EXPR
:
22286 case STATIC_CAST_EXPR
:
22287 case CONST_CAST_EXPR
:
22288 case REINTERPRET_CAST_EXPR
:
22290 /* These expressions are value-dependent if the type to which
22291 the cast occurs is dependent or the expression being casted
22292 is value-dependent. */
22294 tree type
= TREE_TYPE (expression
);
22296 if (dependent_type_p (type
))
22299 /* A functional cast has a list of operands. */
22300 expression
= TREE_OPERAND (expression
, 0);
22303 /* If there are no operands, it must be an expression such
22304 as "int()". This should not happen for aggregate types
22305 because it would form non-constant expressions. */
22306 gcc_assert (cxx_dialect
>= cxx11
22307 || INTEGRAL_OR_ENUMERATION_TYPE_P (type
));
22312 if (TREE_CODE (expression
) == TREE_LIST
)
22313 return any_value_dependent_elements_p (expression
);
22315 return value_dependent_expression_p (expression
);
22319 if (SIZEOF_EXPR_TYPE_P (expression
))
22320 return dependent_type_p (TREE_TYPE (TREE_OPERAND (expression
, 0)));
22324 /* A `sizeof' expression is value-dependent if the operand is
22325 type-dependent or is a pack expansion. */
22326 expression
= TREE_OPERAND (expression
, 0);
22327 if (PACK_EXPANSION_P (expression
))
22329 else if (TYPE_P (expression
))
22330 return dependent_type_p (expression
);
22331 return instantiation_dependent_expression_p (expression
);
22333 case AT_ENCODE_EXPR
:
22334 /* An 'encode' expression is value-dependent if the operand is
22336 expression
= TREE_OPERAND (expression
, 0);
22337 return dependent_type_p (expression
);
22339 case NOEXCEPT_EXPR
:
22340 expression
= TREE_OPERAND (expression
, 0);
22341 return instantiation_dependent_expression_p (expression
);
22344 /* All instantiation-dependent expressions should also be considered
22345 value-dependent. */
22346 return instantiation_dependent_scope_ref_p (expression
);
22348 case COMPONENT_REF
:
22349 return (value_dependent_expression_p (TREE_OPERAND (expression
, 0))
22350 || value_dependent_expression_p (TREE_OPERAND (expression
, 1)));
22352 case NONTYPE_ARGUMENT_PACK
:
22353 /* A NONTYPE_ARGUMENT_PACK is value-dependent if any packed argument
22354 is value-dependent. */
22356 tree values
= ARGUMENT_PACK_ARGS (expression
);
22357 int i
, len
= TREE_VEC_LENGTH (values
);
22359 for (i
= 0; i
< len
; ++i
)
22360 if (value_dependent_expression_p (TREE_VEC_ELT (values
, i
)))
22368 tree type2
= TRAIT_EXPR_TYPE2 (expression
);
22369 return (dependent_type_p (TRAIT_EXPR_TYPE1 (expression
))
22370 || (type2
? dependent_type_p (type2
) : false));
22374 return ((value_dependent_expression_p (TREE_OPERAND (expression
, 0)))
22375 || (value_dependent_expression_p (TREE_OPERAND (expression
, 2))));
22378 return ((value_dependent_expression_p (TREE_OPERAND (expression
, 0)))
22379 || (value_dependent_expression_p (TREE_OPERAND (expression
, 1))));
22383 tree op
= TREE_OPERAND (expression
, 0);
22384 return (value_dependent_expression_p (op
)
22385 || has_value_dependent_address (op
));
22388 case REQUIRES_EXPR
:
22389 /* Treat all requires-expressions as value-dependent so
22390 we don't try to fold them. */
22394 return dependent_type_p (TREE_OPERAND (expression
, 0));
22398 tree fn
= get_callee_fndecl (expression
);
22400 if (!fn
&& value_dependent_expression_p (CALL_EXPR_FN (expression
)))
22402 nargs
= call_expr_nargs (expression
);
22403 for (i
= 0; i
< nargs
; ++i
)
22405 tree op
= CALL_EXPR_ARG (expression
, i
);
22406 /* In a call to a constexpr member function, look through the
22407 implicit ADDR_EXPR on the object argument so that it doesn't
22408 cause the call to be considered value-dependent. We also
22409 look through it in potential_constant_expression. */
22410 if (i
== 0 && fn
&& DECL_DECLARED_CONSTEXPR_P (fn
)
22411 && DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
)
22412 && TREE_CODE (op
) == ADDR_EXPR
)
22413 op
= TREE_OPERAND (op
, 0);
22414 if (value_dependent_expression_p (op
))
22420 case TEMPLATE_ID_EXPR
:
22421 /* If a TEMPLATE_ID_EXPR involves a dependent name, it will be
22423 return type_dependent_expression_p (expression
)
22424 || variable_concept_p (TREE_OPERAND (expression
, 0));
22430 if (dependent_type_p (TREE_TYPE (expression
)))
22432 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (expression
), ix
, val
)
22433 if (value_dependent_expression_p (val
))
22439 /* Treat a GNU statement expression as dependent to avoid crashing
22440 under instantiate_non_dependent_expr; it can't be constant. */
22444 /* A constant expression is value-dependent if any subexpression is
22445 value-dependent. */
22446 switch (TREE_CODE_CLASS (TREE_CODE (expression
)))
22448 case tcc_reference
:
22450 case tcc_comparison
:
22452 case tcc_expression
:
22455 int i
, len
= cp_tree_operand_length (expression
);
22457 for (i
= 0; i
< len
; i
++)
22459 tree t
= TREE_OPERAND (expression
, i
);
22461 /* In some cases, some of the operands may be missing.l
22462 (For example, in the case of PREDECREMENT_EXPR, the
22463 amount to increment by may be missing.) That doesn't
22464 make the expression dependent. */
22465 if (t
&& value_dependent_expression_p (t
))
22476 /* The expression is not value-dependent. */
22480 /* Returns TRUE if the EXPRESSION is type-dependent, in the sense of
22481 [temp.dep.expr]. Note that an expression with no type is
22482 considered dependent. Other parts of the compiler arrange for an
22483 expression with type-dependent subexpressions to have no type, so
22484 this function doesn't have to be fully recursive. */
22487 type_dependent_expression_p (tree expression
)
22489 if (!processing_template_decl
)
22492 if (expression
== NULL_TREE
|| expression
== error_mark_node
)
22495 /* An unresolved name is always dependent. */
22496 if (identifier_p (expression
)
22497 || TREE_CODE (expression
) == USING_DECL
22498 || TREE_CODE (expression
) == WILDCARD_DECL
)
22501 /* A fold expression is type-dependent. */
22502 if (TREE_CODE (expression
) == UNARY_LEFT_FOLD_EXPR
22503 || TREE_CODE (expression
) == UNARY_RIGHT_FOLD_EXPR
22504 || TREE_CODE (expression
) == BINARY_LEFT_FOLD_EXPR
22505 || TREE_CODE (expression
) == BINARY_RIGHT_FOLD_EXPR
)
22508 /* Some expression forms are never type-dependent. */
22509 if (TREE_CODE (expression
) == PSEUDO_DTOR_EXPR
22510 || TREE_CODE (expression
) == SIZEOF_EXPR
22511 || TREE_CODE (expression
) == ALIGNOF_EXPR
22512 || TREE_CODE (expression
) == AT_ENCODE_EXPR
22513 || TREE_CODE (expression
) == NOEXCEPT_EXPR
22514 || TREE_CODE (expression
) == TRAIT_EXPR
22515 || TREE_CODE (expression
) == TYPEID_EXPR
22516 || TREE_CODE (expression
) == DELETE_EXPR
22517 || TREE_CODE (expression
) == VEC_DELETE_EXPR
22518 || TREE_CODE (expression
) == THROW_EXPR
22519 || TREE_CODE (expression
) == REQUIRES_EXPR
)
22522 /* The types of these expressions depends only on the type to which
22523 the cast occurs. */
22524 if (TREE_CODE (expression
) == DYNAMIC_CAST_EXPR
22525 || TREE_CODE (expression
) == STATIC_CAST_EXPR
22526 || TREE_CODE (expression
) == CONST_CAST_EXPR
22527 || TREE_CODE (expression
) == REINTERPRET_CAST_EXPR
22528 || TREE_CODE (expression
) == IMPLICIT_CONV_EXPR
22529 || TREE_CODE (expression
) == CAST_EXPR
)
22530 return dependent_type_p (TREE_TYPE (expression
));
22532 /* The types of these expressions depends only on the type created
22533 by the expression. */
22534 if (TREE_CODE (expression
) == NEW_EXPR
22535 || TREE_CODE (expression
) == VEC_NEW_EXPR
)
22537 /* For NEW_EXPR tree nodes created inside a template, either
22538 the object type itself or a TREE_LIST may appear as the
22540 tree type
= TREE_OPERAND (expression
, 1);
22541 if (TREE_CODE (type
) == TREE_LIST
)
22542 /* This is an array type. We need to check array dimensions
22544 return dependent_type_p (TREE_VALUE (TREE_PURPOSE (type
)))
22545 || value_dependent_expression_p
22546 (TREE_OPERAND (TREE_VALUE (type
), 1));
22548 return dependent_type_p (type
);
22551 if (TREE_CODE (expression
) == SCOPE_REF
)
22553 tree scope
= TREE_OPERAND (expression
, 0);
22554 tree name
= TREE_OPERAND (expression
, 1);
22556 /* 14.6.2.2 [temp.dep.expr]: An id-expression is type-dependent if it
22557 contains an identifier associated by name lookup with one or more
22558 declarations declared with a dependent type, or...a
22559 nested-name-specifier or qualified-id that names a member of an
22560 unknown specialization. */
22561 return (type_dependent_expression_p (name
)
22562 || dependent_scope_p (scope
));
22565 if (TREE_CODE (expression
) == FUNCTION_DECL
22566 && DECL_LANG_SPECIFIC (expression
)
22567 && DECL_TEMPLATE_INFO (expression
)
22568 && (any_dependent_template_arguments_p
22569 (INNERMOST_TEMPLATE_ARGS (DECL_TI_ARGS (expression
)))))
22572 if (TREE_CODE (expression
) == TEMPLATE_DECL
22573 && !DECL_TEMPLATE_TEMPLATE_PARM_P (expression
))
22576 if (TREE_CODE (expression
) == STMT_EXPR
)
22577 expression
= stmt_expr_value_expr (expression
);
22579 if (BRACE_ENCLOSED_INITIALIZER_P (expression
))
22584 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (expression
), i
, elt
)
22586 if (type_dependent_expression_p (elt
))
22592 /* A static data member of the current instantiation with incomplete
22593 array type is type-dependent, as the definition and specializations
22594 can have different bounds. */
22595 if (VAR_P (expression
)
22596 && DECL_CLASS_SCOPE_P (expression
)
22597 && dependent_type_p (DECL_CONTEXT (expression
))
22598 && VAR_HAD_UNKNOWN_BOUND (expression
))
22601 /* An array of unknown bound depending on a variadic parameter, eg:
22603 template<typename... Args>
22604 void foo (Args... args)
22606 int arr[] = { args... };
22609 template<int... vals>
22612 int arr[] = { vals... };
22615 If the array has no length and has an initializer, it must be that
22616 we couldn't determine its length in cp_complete_array_type because
22617 it is dependent. */
22618 if (VAR_P (expression
)
22619 && TREE_CODE (TREE_TYPE (expression
)) == ARRAY_TYPE
22620 && !TYPE_DOMAIN (TREE_TYPE (expression
))
22621 && DECL_INITIAL (expression
))
22624 /* A variable template specialization is type-dependent if it has any
22625 dependent template arguments. */
22626 if (VAR_P (expression
)
22627 && DECL_LANG_SPECIFIC (expression
)
22628 && DECL_TEMPLATE_INFO (expression
)
22629 && variable_template_p (DECL_TI_TEMPLATE (expression
)))
22630 return any_dependent_template_arguments_p (DECL_TI_ARGS (expression
));
22632 /* Always dependent, on the number of arguments if nothing else. */
22633 if (TREE_CODE (expression
) == EXPR_PACK_EXPANSION
)
22636 if (TREE_TYPE (expression
) == unknown_type_node
)
22638 if (TREE_CODE (expression
) == ADDR_EXPR
)
22639 return type_dependent_expression_p (TREE_OPERAND (expression
, 0));
22640 if (TREE_CODE (expression
) == COMPONENT_REF
22641 || TREE_CODE (expression
) == OFFSET_REF
)
22643 if (type_dependent_expression_p (TREE_OPERAND (expression
, 0)))
22645 expression
= TREE_OPERAND (expression
, 1);
22646 if (identifier_p (expression
))
22649 /* SCOPE_REF with non-null TREE_TYPE is always non-dependent. */
22650 if (TREE_CODE (expression
) == SCOPE_REF
)
22653 if (BASELINK_P (expression
))
22655 if (BASELINK_OPTYPE (expression
)
22656 && dependent_type_p (BASELINK_OPTYPE (expression
)))
22658 expression
= BASELINK_FUNCTIONS (expression
);
22661 if (TREE_CODE (expression
) == TEMPLATE_ID_EXPR
)
22663 if (any_dependent_template_arguments_p
22664 (TREE_OPERAND (expression
, 1)))
22666 expression
= TREE_OPERAND (expression
, 0);
22667 if (identifier_p (expression
))
22671 gcc_assert (TREE_CODE (expression
) == OVERLOAD
22672 || TREE_CODE (expression
) == FUNCTION_DECL
);
22676 if (type_dependent_expression_p (OVL_CURRENT (expression
)))
22678 expression
= OVL_NEXT (expression
);
22683 gcc_assert (TREE_CODE (expression
) != TYPE_DECL
);
22685 return (dependent_type_p (TREE_TYPE (expression
)));
22688 /* walk_tree callback function for instantiation_dependent_expression_p,
22689 below. Returns non-zero if a dependent subexpression is found. */
22692 instantiation_dependent_r (tree
*tp
, int *walk_subtrees
,
22697 /* We don't have to worry about decltype currently because decltype
22698 of an instantiation-dependent expr is a dependent type. This
22699 might change depending on the resolution of DR 1172. */
22700 *walk_subtrees
= false;
22703 enum tree_code code
= TREE_CODE (*tp
);
22706 /* Don't treat an argument list as dependent just because it has no
22714 /* A constant with a dependent initializer is dependent. */
22715 if (value_dependent_expression_p (*tp
))
22719 case TEMPLATE_PARM_INDEX
:
22722 /* Handle expressions with type operands. */
22726 case AT_ENCODE_EXPR
:
22728 tree op
= TREE_OPERAND (*tp
, 0);
22729 if (code
== SIZEOF_EXPR
&& SIZEOF_EXPR_TYPE_P (*tp
))
22730 op
= TREE_TYPE (op
);
22733 if (dependent_type_p (op
))
22737 *walk_subtrees
= false;
22745 if (value_dependent_expression_p (*tp
))
22747 *walk_subtrees
= false;
22750 case COMPONENT_REF
:
22751 if (identifier_p (TREE_OPERAND (*tp
, 1)))
22752 /* In a template, finish_class_member_access_expr creates a
22753 COMPONENT_REF with an IDENTIFIER_NODE for op1 even if it isn't
22754 type-dependent, so that we can check access control at
22755 instantiation time (PR 42277). See also Core issue 1273. */
22760 if (instantiation_dependent_scope_ref_p (*tp
))
22765 /* Treat statement-expressions as dependent. */
22769 /* Treat requires-expressions as dependent. */
22770 case REQUIRES_EXPR
:
22774 /* Treat calls to function concepts as dependent. */
22775 if (function_concept_check_p (*tp
))
22779 case TEMPLATE_ID_EXPR
:
22780 /* And variable concepts. */
22781 if (variable_concept_p (TREE_OPERAND (*tp
, 0)))
22789 if (type_dependent_expression_p (*tp
))
22795 /* Returns TRUE if the EXPRESSION is instantiation-dependent, in the
22796 sense defined by the ABI:
22798 "An expression is instantiation-dependent if it is type-dependent
22799 or value-dependent, or it has a subexpression that is type-dependent
22800 or value-dependent." */
22803 instantiation_dependent_expression_p (tree expression
)
22807 if (!processing_template_decl
)
22810 if (expression
== error_mark_node
)
22813 result
= cp_walk_tree_without_duplicates (&expression
,
22814 instantiation_dependent_r
, NULL
);
22815 return result
!= NULL_TREE
;
22818 /* Like type_dependent_expression_p, but it also works while not processing
22819 a template definition, i.e. during substitution or mangling. */
22822 type_dependent_expression_p_push (tree expr
)
22825 ++processing_template_decl
;
22826 b
= type_dependent_expression_p (expr
);
22827 --processing_template_decl
;
22831 /* Returns TRUE if ARGS contains a type-dependent expression. */
22834 any_type_dependent_arguments_p (const vec
<tree
, va_gc
> *args
)
22839 FOR_EACH_VEC_SAFE_ELT (args
, i
, arg
)
22841 if (type_dependent_expression_p (arg
))
22847 /* Returns TRUE if LIST (a TREE_LIST whose TREE_VALUEs are
22848 expressions) contains any type-dependent expressions. */
22851 any_type_dependent_elements_p (const_tree list
)
22853 for (; list
; list
= TREE_CHAIN (list
))
22854 if (type_dependent_expression_p (TREE_VALUE (list
)))
22860 /* Returns TRUE if LIST (a TREE_LIST whose TREE_VALUEs are
22861 expressions) contains any value-dependent expressions. */
22864 any_value_dependent_elements_p (const_tree list
)
22866 for (; list
; list
= TREE_CHAIN (list
))
22867 if (value_dependent_expression_p (TREE_VALUE (list
)))
22873 /* Returns TRUE if the ARG (a template argument) is dependent. */
22876 dependent_template_arg_p (tree arg
)
22878 if (!processing_template_decl
)
22881 /* Assume a template argument that was wrongly written by the user
22882 is dependent. This is consistent with what
22883 any_dependent_template_arguments_p [that calls this function]
22885 if (!arg
|| arg
== error_mark_node
)
22888 if (TREE_CODE (arg
) == ARGUMENT_PACK_SELECT
)
22889 arg
= ARGUMENT_PACK_SELECT_ARG (arg
);
22891 if (TREE_CODE (arg
) == TEMPLATE_DECL
22892 || TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
)
22893 return dependent_template_p (arg
);
22894 else if (ARGUMENT_PACK_P (arg
))
22896 tree args
= ARGUMENT_PACK_ARGS (arg
);
22897 int i
, len
= TREE_VEC_LENGTH (args
);
22898 for (i
= 0; i
< len
; ++i
)
22900 if (dependent_template_arg_p (TREE_VEC_ELT (args
, i
)))
22906 else if (TYPE_P (arg
))
22907 return dependent_type_p (arg
);
22909 return (type_dependent_expression_p (arg
)
22910 || value_dependent_expression_p (arg
));
22913 /* Returns true if ARGS (a collection of template arguments) contains
22914 any types that require structural equality testing. */
22917 any_template_arguments_need_structural_equality_p (tree args
)
22924 if (args
== error_mark_node
)
22927 for (i
= 0; i
< TMPL_ARGS_DEPTH (args
); ++i
)
22929 tree level
= TMPL_ARGS_LEVEL (args
, i
+ 1);
22930 for (j
= 0; j
< TREE_VEC_LENGTH (level
); ++j
)
22932 tree arg
= TREE_VEC_ELT (level
, j
);
22933 tree packed_args
= NULL_TREE
;
22936 if (ARGUMENT_PACK_P (arg
))
22938 /* Look inside the argument pack. */
22939 packed_args
= ARGUMENT_PACK_ARGS (arg
);
22940 len
= TREE_VEC_LENGTH (packed_args
);
22943 for (k
= 0; k
< len
; ++k
)
22946 arg
= TREE_VEC_ELT (packed_args
, k
);
22948 if (error_operand_p (arg
))
22950 else if (TREE_CODE (arg
) == TEMPLATE_DECL
)
22952 else if (TYPE_P (arg
) && TYPE_STRUCTURAL_EQUALITY_P (arg
))
22954 else if (!TYPE_P (arg
) && TREE_TYPE (arg
)
22955 && TYPE_STRUCTURAL_EQUALITY_P (TREE_TYPE (arg
)))
22964 /* Returns true if ARGS (a collection of template arguments) contains
22965 any dependent arguments. */
22968 any_dependent_template_arguments_p (const_tree args
)
22975 if (args
== error_mark_node
)
22978 for (i
= 0; i
< TMPL_ARGS_DEPTH (args
); ++i
)
22980 const_tree level
= TMPL_ARGS_LEVEL (args
, i
+ 1);
22981 for (j
= 0; j
< TREE_VEC_LENGTH (level
); ++j
)
22982 if (dependent_template_arg_p (TREE_VEC_ELT (level
, j
)))
22989 /* Returns TRUE if the template TMPL is dependent. */
22992 dependent_template_p (tree tmpl
)
22994 if (TREE_CODE (tmpl
) == OVERLOAD
)
22998 if (dependent_template_p (OVL_CURRENT (tmpl
)))
23000 tmpl
= OVL_NEXT (tmpl
);
23005 /* Template template parameters are dependent. */
23006 if (DECL_TEMPLATE_TEMPLATE_PARM_P (tmpl
)
23007 || TREE_CODE (tmpl
) == TEMPLATE_TEMPLATE_PARM
)
23009 /* So are names that have not been looked up. */
23010 if (TREE_CODE (tmpl
) == SCOPE_REF
|| identifier_p (tmpl
))
23012 /* So are member templates of dependent classes. */
23013 if (TYPE_P (CP_DECL_CONTEXT (tmpl
)))
23014 return dependent_type_p (DECL_CONTEXT (tmpl
));
23018 /* Returns TRUE if the specialization TMPL<ARGS> is dependent. */
23021 dependent_template_id_p (tree tmpl
, tree args
)
23023 return (dependent_template_p (tmpl
)
23024 || any_dependent_template_arguments_p (args
));
23027 /* Returns TRUE if OMP_FOR with DECLV, INITV, CONDV and INCRV vectors
23031 dependent_omp_for_p (tree declv
, tree initv
, tree condv
, tree incrv
)
23035 if (!processing_template_decl
)
23038 for (i
= 0; i
< TREE_VEC_LENGTH (declv
); i
++)
23040 tree decl
= TREE_VEC_ELT (declv
, i
);
23041 tree init
= TREE_VEC_ELT (initv
, i
);
23042 tree cond
= TREE_VEC_ELT (condv
, i
);
23043 tree incr
= TREE_VEC_ELT (incrv
, i
);
23045 if (type_dependent_expression_p (decl
)
23046 || TREE_CODE (decl
) == SCOPE_REF
)
23049 if (init
&& type_dependent_expression_p (init
))
23052 if (type_dependent_expression_p (cond
))
23055 if (COMPARISON_CLASS_P (cond
)
23056 && (type_dependent_expression_p (TREE_OPERAND (cond
, 0))
23057 || type_dependent_expression_p (TREE_OPERAND (cond
, 1))))
23060 if (TREE_CODE (incr
) == MODOP_EXPR
)
23062 if (type_dependent_expression_p (TREE_OPERAND (incr
, 0))
23063 || type_dependent_expression_p (TREE_OPERAND (incr
, 2)))
23066 else if (type_dependent_expression_p (incr
))
23068 else if (TREE_CODE (incr
) == MODIFY_EXPR
)
23070 if (type_dependent_expression_p (TREE_OPERAND (incr
, 0)))
23072 else if (BINARY_CLASS_P (TREE_OPERAND (incr
, 1)))
23074 tree t
= TREE_OPERAND (incr
, 1);
23075 if (type_dependent_expression_p (TREE_OPERAND (t
, 0))
23076 || type_dependent_expression_p (TREE_OPERAND (t
, 1)))
23085 /* TYPE is a TYPENAME_TYPE. Returns the ordinary TYPE to which the
23086 TYPENAME_TYPE corresponds. Returns the original TYPENAME_TYPE if
23087 no such TYPE can be found. Note that this function peers inside
23088 uninstantiated templates and therefore should be used only in
23089 extremely limited situations. ONLY_CURRENT_P restricts this
23090 peering to the currently open classes hierarchy (which is required
23091 when comparing types). */
23094 resolve_typename_type (tree type
, bool only_current_p
)
23103 gcc_assert (TREE_CODE (type
) == TYPENAME_TYPE
);
23105 scope
= TYPE_CONTEXT (type
);
23106 /* Usually the non-qualified identifier of a TYPENAME_TYPE is
23107 TYPE_IDENTIFIER (type). But when 'type' is a typedef variant of
23108 a TYPENAME_TYPE node, then TYPE_NAME (type) is set to the TYPE_DECL representing
23109 the typedef. In that case TYPE_IDENTIFIER (type) is not the non-qualified
23110 identifier of the TYPENAME_TYPE anymore.
23111 So by getting the TYPE_IDENTIFIER of the _main declaration_ of the
23112 TYPENAME_TYPE instead, we avoid messing up with a possible
23113 typedef variant case. */
23114 name
= TYPE_IDENTIFIER (TYPE_MAIN_VARIANT (type
));
23116 /* If the SCOPE is itself a TYPENAME_TYPE, then we need to resolve
23117 it first before we can figure out what NAME refers to. */
23118 if (TREE_CODE (scope
) == TYPENAME_TYPE
)
23120 if (TYPENAME_IS_RESOLVING_P (scope
))
23121 /* Given a class template A with a dependent base with nested type C,
23122 typedef typename A::C::C C will land us here, as trying to resolve
23123 the initial A::C leads to the local C typedef, which leads back to
23124 A::C::C. So we break the recursion now. */
23127 scope
= resolve_typename_type (scope
, only_current_p
);
23129 /* If we don't know what SCOPE refers to, then we cannot resolve the
23131 if (TREE_CODE (scope
) == TYPENAME_TYPE
)
23133 /* If the SCOPE is a template type parameter, we have no way of
23134 resolving the name. */
23135 if (TREE_CODE (scope
) == TEMPLATE_TYPE_PARM
)
23137 /* If the SCOPE is not the current instantiation, there's no reason
23138 to look inside it. */
23139 if (only_current_p
&& !currently_open_class (scope
))
23141 /* If this is a typedef, we don't want to look inside (c++/11987). */
23142 if (typedef_variant_p (type
))
23144 /* If SCOPE isn't the template itself, it will not have a valid
23145 TYPE_FIELDS list. */
23146 if (CLASS_TYPE_P (scope
)
23147 && same_type_p (scope
, CLASSTYPE_PRIMARY_TEMPLATE_TYPE (scope
)))
23148 /* scope is either the template itself or a compatible instantiation
23149 like X<T>, so look up the name in the original template. */
23150 scope
= CLASSTYPE_PRIMARY_TEMPLATE_TYPE (scope
);
23152 /* scope is a partial instantiation, so we can't do the lookup or we
23153 will lose the template arguments. */
23155 /* Enter the SCOPE so that name lookup will be resolved as if we
23156 were in the class definition. In particular, SCOPE will no
23157 longer be considered a dependent type. */
23158 pushed_scope
= push_scope (scope
);
23159 /* Look up the declaration. */
23160 decl
= lookup_member (scope
, name
, /*protect=*/0, /*want_type=*/true,
23161 tf_warning_or_error
);
23163 result
= NULL_TREE
;
23165 /* For a TYPENAME_TYPE like "typename X::template Y<T>", we want to
23166 find a TEMPLATE_DECL. Otherwise, we want to find a TYPE_DECL. */
23169 else if (identifier_p (TYPENAME_TYPE_FULLNAME (type
))
23170 && TREE_CODE (decl
) == TYPE_DECL
)
23172 result
= TREE_TYPE (decl
);
23173 if (result
== error_mark_node
)
23174 result
= NULL_TREE
;
23176 else if (TREE_CODE (TYPENAME_TYPE_FULLNAME (type
)) == TEMPLATE_ID_EXPR
23177 && DECL_CLASS_TEMPLATE_P (decl
))
23181 /* Obtain the template and the arguments. */
23182 tmpl
= TREE_OPERAND (TYPENAME_TYPE_FULLNAME (type
), 0);
23183 args
= TREE_OPERAND (TYPENAME_TYPE_FULLNAME (type
), 1);
23184 /* Instantiate the template. */
23185 result
= lookup_template_class (tmpl
, args
, NULL_TREE
, NULL_TREE
,
23186 /*entering_scope=*/0,
23187 tf_error
| tf_user
);
23188 if (result
== error_mark_node
)
23189 result
= NULL_TREE
;
23192 /* Leave the SCOPE. */
23194 pop_scope (pushed_scope
);
23196 /* If we failed to resolve it, return the original typename. */
23200 /* If lookup found a typename type, resolve that too. */
23201 if (TREE_CODE (result
) == TYPENAME_TYPE
&& !TYPENAME_IS_RESOLVING_P (result
))
23203 /* Ill-formed programs can cause infinite recursion here, so we
23204 must catch that. */
23205 TYPENAME_IS_RESOLVING_P (type
) = 1;
23206 result
= resolve_typename_type (result
, only_current_p
);
23207 TYPENAME_IS_RESOLVING_P (type
) = 0;
23210 /* Qualify the resulting type. */
23211 quals
= cp_type_quals (type
);
23213 result
= cp_build_qualified_type (result
, cp_type_quals (result
) | quals
);
23218 /* EXPR is an expression which is not type-dependent. Return a proxy
23219 for EXPR that can be used to compute the types of larger
23220 expressions containing EXPR. */
23223 build_non_dependent_expr (tree expr
)
23227 #ifdef ENABLE_CHECKING
23228 /* Try to get a constant value for all non-dependent expressions in
23229 order to expose bugs in *_dependent_expression_p and constexpr. */
23230 if (cxx_dialect
>= cxx11
)
23231 fold_non_dependent_expr (expr
);
23234 /* Preserve OVERLOADs; the functions must be available to resolve
23237 if (TREE_CODE (inner_expr
) == STMT_EXPR
)
23238 inner_expr
= stmt_expr_value_expr (inner_expr
);
23239 if (TREE_CODE (inner_expr
) == ADDR_EXPR
)
23240 inner_expr
= TREE_OPERAND (inner_expr
, 0);
23241 if (TREE_CODE (inner_expr
) == COMPONENT_REF
)
23242 inner_expr
= TREE_OPERAND (inner_expr
, 1);
23243 if (is_overloaded_fn (inner_expr
)
23244 || TREE_CODE (inner_expr
) == OFFSET_REF
)
23246 /* There is no need to return a proxy for a variable. */
23249 /* Preserve string constants; conversions from string constants to
23250 "char *" are allowed, even though normally a "const char *"
23251 cannot be used to initialize a "char *". */
23252 if (TREE_CODE (expr
) == STRING_CST
)
23254 /* Preserve void and arithmetic constants, as an optimization -- there is no
23255 reason to create a new node. */
23256 if (TREE_CODE (expr
) == VOID_CST
23257 || TREE_CODE (expr
) == INTEGER_CST
23258 || TREE_CODE (expr
) == REAL_CST
)
23260 /* Preserve THROW_EXPRs -- all throw-expressions have type "void".
23261 There is at least one place where we want to know that a
23262 particular expression is a throw-expression: when checking a ?:
23263 expression, there are special rules if the second or third
23264 argument is a throw-expression. */
23265 if (TREE_CODE (expr
) == THROW_EXPR
)
23268 /* Don't wrap an initializer list, we need to be able to look inside. */
23269 if (BRACE_ENCLOSED_INITIALIZER_P (expr
))
23272 /* Don't wrap a dummy object, we need to be able to test for it. */
23273 if (is_dummy_object (expr
))
23276 if (TREE_CODE (expr
) == COND_EXPR
)
23277 return build3 (COND_EXPR
,
23279 TREE_OPERAND (expr
, 0),
23280 (TREE_OPERAND (expr
, 1)
23281 ? build_non_dependent_expr (TREE_OPERAND (expr
, 1))
23282 : build_non_dependent_expr (TREE_OPERAND (expr
, 0))),
23283 build_non_dependent_expr (TREE_OPERAND (expr
, 2)));
23284 if (TREE_CODE (expr
) == COMPOUND_EXPR
23285 && !COMPOUND_EXPR_OVERLOADED (expr
))
23286 return build2 (COMPOUND_EXPR
,
23288 TREE_OPERAND (expr
, 0),
23289 build_non_dependent_expr (TREE_OPERAND (expr
, 1)));
23291 /* If the type is unknown, it can't really be non-dependent */
23292 gcc_assert (TREE_TYPE (expr
) != unknown_type_node
);
23294 /* Otherwise, build a NON_DEPENDENT_EXPR. */
23295 return build1 (NON_DEPENDENT_EXPR
, TREE_TYPE (expr
), expr
);
23298 /* ARGS is a vector of expressions as arguments to a function call.
23299 Replace the arguments with equivalent non-dependent expressions.
23300 This modifies ARGS in place. */
23303 make_args_non_dependent (vec
<tree
, va_gc
> *args
)
23308 FOR_EACH_VEC_SAFE_ELT (args
, ix
, arg
)
23310 tree newarg
= build_non_dependent_expr (arg
);
23312 (*args
)[ix
] = newarg
;
23316 /* Returns a type which represents 'auto' or 'decltype(auto)'. We use a
23317 TEMPLATE_TYPE_PARM with a level one deeper than the actual template
23321 make_auto_1 (tree name
)
23323 tree au
= cxx_make_type (TEMPLATE_TYPE_PARM
);
23324 TYPE_NAME (au
) = build_decl (input_location
,
23325 TYPE_DECL
, name
, au
);
23326 TYPE_STUB_DECL (au
) = TYPE_NAME (au
);
23327 TEMPLATE_TYPE_PARM_INDEX (au
) = build_template_parm_index
23328 (0, processing_template_decl
+ 1, processing_template_decl
+ 1,
23329 TYPE_NAME (au
), NULL_TREE
);
23330 TYPE_CANONICAL (au
) = canonical_type_parameter (au
);
23331 DECL_ARTIFICIAL (TYPE_NAME (au
)) = 1;
23332 SET_DECL_TEMPLATE_PARM_P (TYPE_NAME (au
));
23338 make_decltype_auto (void)
23340 return make_auto_1 (get_identifier ("decltype(auto)"));
23346 return make_auto_1 (get_identifier ("auto"));
23349 /* Given type ARG, return std::initializer_list<ARG>. */
23354 tree std_init_list
= namespace_binding
23355 (get_identifier ("initializer_list"), std_node
);
23357 if (!std_init_list
|| !DECL_CLASS_TEMPLATE_P (std_init_list
))
23359 error ("deducing from brace-enclosed initializer list requires "
23360 "#include <initializer_list>");
23361 return error_mark_node
;
23363 argvec
= make_tree_vec (1);
23364 TREE_VEC_ELT (argvec
, 0) = arg
;
23365 return lookup_template_class (std_init_list
, argvec
, NULL_TREE
,
23366 NULL_TREE
, 0, tf_warning_or_error
);
23369 /* Replace auto in TYPE with std::initializer_list<auto>. */
23372 listify_autos (tree type
, tree auto_node
)
23374 tree init_auto
= listify (auto_node
);
23375 tree argvec
= make_tree_vec (1);
23376 TREE_VEC_ELT (argvec
, 0) = init_auto
;
23377 if (processing_template_decl
)
23378 argvec
= add_to_template_args (current_template_args (), argvec
);
23379 return tsubst (type
, argvec
, tf_warning_or_error
, NULL_TREE
);
23382 /* Replace occurrences of 'auto' in TYPE with the appropriate type deduced
23383 from INIT. AUTO_NODE is the TEMPLATE_TYPE_PARM used for 'auto' in TYPE. */
23386 do_auto_deduction (tree type
, tree init
, tree auto_node
)
23388 return do_auto_deduction (type
, init
, auto_node
,
23389 tf_warning_or_error
,
23393 /* Replace occurrences of 'auto' in TYPE with the appropriate type deduced
23394 from INIT. AUTO_NODE is the TEMPLATE_TYPE_PARM used for 'auto' in TYPE.
23395 The CONTEXT determines the context in which auto deduction is performed
23396 and is used to control error diagnostics. */
23399 do_auto_deduction (tree type
, tree init
, tree auto_node
,
23400 tsubst_flags_t complain
, auto_deduction_context context
)
23404 if (init
== error_mark_node
)
23405 return error_mark_node
;
23407 if (type_dependent_expression_p (init
))
23408 /* Defining a subset of type-dependent expressions that we can deduce
23409 from ahead of time isn't worth the trouble. */
23412 /* [dcl.spec.auto]: Obtain P from T by replacing the occurrences of auto
23413 with either a new invented type template parameter U or, if the
23414 initializer is a braced-init-list (8.5.4), with
23415 std::initializer_list<U>. */
23416 if (BRACE_ENCLOSED_INITIALIZER_P (init
))
23418 if (!DIRECT_LIST_INIT_P (init
))
23419 type
= listify_autos (type
, auto_node
);
23420 else if (CONSTRUCTOR_NELTS (init
) == 1)
23421 init
= CONSTRUCTOR_ELT (init
, 0)->value
;
23424 if (complain
& tf_warning_or_error
)
23426 if (permerror (input_location
, "direct-list-initialization of "
23427 "%<auto%> requires exactly one element"))
23428 inform (input_location
,
23429 "for deduction to %<std::initializer_list%>, use copy-"
23430 "list-initialization (i.e. add %<=%> before the %<{%>)");
23432 type
= listify_autos (type
, auto_node
);
23436 init
= resolve_nondeduced_context (init
);
23438 targs
= make_tree_vec (1);
23439 if (AUTO_IS_DECLTYPE (auto_node
))
23441 bool id
= (DECL_P (init
) || (TREE_CODE (init
) == COMPONENT_REF
23442 && !REF_PARENTHESIZED_P (init
)));
23443 TREE_VEC_ELT (targs
, 0)
23444 = finish_decltype_type (init
, id
, tf_warning_or_error
);
23445 if (type
!= auto_node
)
23447 if (complain
& tf_error
)
23448 error ("%qT as type rather than plain %<decltype(auto)%>", type
);
23449 return error_mark_node
;
23454 tree parms
= build_tree_list (NULL_TREE
, type
);
23455 tree tparms
= make_tree_vec (1);
23458 TREE_VEC_ELT (tparms
, 0)
23459 = build_tree_list (NULL_TREE
, TYPE_NAME (auto_node
));
23460 val
= type_unification_real (tparms
, targs
, parms
, &init
, 1, 0,
23461 DEDUCE_CALL
, LOOKUP_NORMAL
,
23462 NULL
, /*explain_p=*/false);
23465 if (processing_template_decl
)
23466 /* Try again at instantiation time. */
23468 if (type
&& type
!= error_mark_node
23469 && (complain
& tf_error
))
23470 /* If type is error_mark_node a diagnostic must have been
23471 emitted by now. Also, having a mention to '<type error>'
23472 in the diagnostic is not really useful to the user. */
23474 if (cfun
&& auto_node
== current_function_auto_return_pattern
23475 && LAMBDA_FUNCTION_P (current_function_decl
))
23476 error ("unable to deduce lambda return type from %qE", init
);
23478 error ("unable to deduce %qT from %qE", type
, init
);
23480 return error_mark_node
;
23484 /* If the list of declarators contains more than one declarator, the type
23485 of each declared variable is determined as described above. If the
23486 type deduced for the template parameter U is not the same in each
23487 deduction, the program is ill-formed. */
23488 if (TREE_TYPE (auto_node
)
23489 && !same_type_p (TREE_TYPE (auto_node
), TREE_VEC_ELT (targs
, 0)))
23491 if (cfun
&& auto_node
== current_function_auto_return_pattern
23492 && LAMBDA_FUNCTION_P (current_function_decl
))
23493 error ("inconsistent types %qT and %qT deduced for "
23494 "lambda return type", TREE_TYPE (auto_node
),
23495 TREE_VEC_ELT (targs
, 0));
23497 error ("inconsistent deduction for %qT: %qT and then %qT",
23498 auto_node
, TREE_TYPE (auto_node
), TREE_VEC_ELT (targs
, 0));
23499 return error_mark_node
;
23501 if (context
!= adc_requirement
)
23502 TREE_TYPE (auto_node
) = TREE_VEC_ELT (targs
, 0);
23504 /* Check any placeholder constraints against the deduced type. */
23505 if (flag_concepts
&& !processing_template_decl
)
23506 if (tree constr
= PLACEHOLDER_TYPE_CONSTRAINTS (auto_node
))
23508 /* Use the deduced type to check the associated constraints. */
23509 if (!constraints_satisfied_p (constr
, targs
))
23511 if (complain
& tf_warning_or_error
)
23515 case adc_unspecified
:
23516 error("placeholder constraints not satisfied");
23518 case adc_variable_type
:
23519 error ("deduced initializer does not satisfy "
23520 "placeholder constraints");
23522 case adc_return_type
:
23523 error ("deduced return type does not satisfy "
23524 "placeholder constraints");
23526 case adc_requirement
:
23527 error ("deduced expression type does not saatisy "
23528 "placeholder constraints");
23531 diagnose_constraints (input_location
, constr
, targs
);
23533 return error_mark_node
;
23537 if (processing_template_decl
)
23538 targs
= add_to_template_args (current_template_args (), targs
);
23539 return tsubst (type
, targs
, complain
, NULL_TREE
);
23542 /* Substitutes LATE_RETURN_TYPE for 'auto' in TYPE and returns the
23546 splice_late_return_type (tree type
, tree late_return_type
)
23548 if (is_auto (type
))
23550 if (late_return_type
)
23551 return late_return_type
;
23553 tree idx
= get_template_parm_index (type
);
23554 if (TEMPLATE_PARM_LEVEL (idx
) <= processing_template_decl
)
23555 /* In an abbreviated function template we didn't know we were dealing
23556 with a function template when we saw the auto return type, so update
23557 it to have the correct level. */
23558 return make_auto_1 (TYPE_IDENTIFIER (type
));
23563 /* Returns true iff TYPE is a TEMPLATE_TYPE_PARM representing 'auto' or
23564 'decltype(auto)'. */
23567 is_auto (const_tree type
)
23569 if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
23570 && (TYPE_IDENTIFIER (type
) == get_identifier ("auto")
23571 || TYPE_IDENTIFIER (type
) == get_identifier ("decltype(auto)")))
23577 /* Returns the TEMPLATE_TYPE_PARM in TYPE representing `auto' iff TYPE contains
23578 a use of `auto'. Returns NULL_TREE otherwise. */
23581 type_uses_auto (tree type
)
23583 return find_type_usage (type
, is_auto
);
23586 /* Returns true iff TYPE is a TEMPLATE_TYPE_PARM representing 'auto',
23587 'decltype(auto)' or a concept. */
23590 is_auto_or_concept (const_tree type
)
23592 return is_auto (type
); // or concept
23595 /* Returns the TEMPLATE_TYPE_PARM in TYPE representing a generic type (`auto' or
23596 a concept identifier) iff TYPE contains a use of a generic type. Returns
23597 NULL_TREE otherwise. */
23600 type_uses_auto_or_concept (tree type
)
23602 return find_type_usage (type
, is_auto_or_concept
);
23606 /* For a given template T, return the vector of typedefs referenced
23607 in T for which access check is needed at T instantiation time.
23608 T is either a FUNCTION_DECL or a RECORD_TYPE.
23609 Those typedefs were added to T by the function
23610 append_type_to_template_for_access_check. */
23612 vec
<qualified_typedef_usage_t
, va_gc
> *
23613 get_types_needing_access_check (tree t
)
23616 vec
<qualified_typedef_usage_t
, va_gc
> *result
= NULL
;
23618 if (!t
|| t
== error_mark_node
)
23621 if (!(ti
= get_template_info (t
)))
23624 if (CLASS_TYPE_P (t
)
23625 || TREE_CODE (t
) == FUNCTION_DECL
)
23627 if (!TI_TEMPLATE (ti
))
23630 result
= TI_TYPEDEFS_NEEDING_ACCESS_CHECKING (ti
);
23636 /* Append the typedef TYPE_DECL used in template T to a list of typedefs
23637 tied to T. That list of typedefs will be access checked at
23638 T instantiation time.
23639 T is either a FUNCTION_DECL or a RECORD_TYPE.
23640 TYPE_DECL is a TYPE_DECL node representing a typedef.
23641 SCOPE is the scope through which TYPE_DECL is accessed.
23642 LOCATION is the location of the usage point of TYPE_DECL.
23644 This function is a subroutine of
23645 append_type_to_template_for_access_check. */
23648 append_type_to_template_for_access_check_1 (tree t
,
23651 location_t location
)
23653 qualified_typedef_usage_t typedef_usage
;
23656 if (!t
|| t
== error_mark_node
)
23659 gcc_assert ((TREE_CODE (t
) == FUNCTION_DECL
23660 || CLASS_TYPE_P (t
))
23662 && TREE_CODE (type_decl
) == TYPE_DECL
23665 if (!(ti
= get_template_info (t
)))
23668 gcc_assert (TI_TEMPLATE (ti
));
23670 typedef_usage
.typedef_decl
= type_decl
;
23671 typedef_usage
.context
= scope
;
23672 typedef_usage
.locus
= location
;
23674 vec_safe_push (TI_TYPEDEFS_NEEDING_ACCESS_CHECKING (ti
), typedef_usage
);
23677 /* Append TYPE_DECL to the template TEMPL.
23678 TEMPL is either a class type, a FUNCTION_DECL or a a TEMPLATE_DECL.
23679 At TEMPL instanciation time, TYPE_DECL will be checked to see
23680 if it can be accessed through SCOPE.
23681 LOCATION is the location of the usage point of TYPE_DECL.
23683 e.g. consider the following code snippet:
23690 template<class U> struct S
23692 C::myint mi; // <-- usage point of the typedef C::myint
23697 At S<char> instantiation time, we need to check the access of C::myint
23698 In other words, we need to check the access of the myint typedef through
23699 the C scope. For that purpose, this function will add the myint typedef
23700 and the scope C through which its being accessed to a list of typedefs
23701 tied to the template S. That list will be walked at template instantiation
23702 time and access check performed on each typedefs it contains.
23703 Note that this particular code snippet should yield an error because
23704 myint is private to C. */
23707 append_type_to_template_for_access_check (tree templ
,
23710 location_t location
)
23712 qualified_typedef_usage_t
*iter
;
23715 gcc_assert (type_decl
&& (TREE_CODE (type_decl
) == TYPE_DECL
));
23717 /* Make sure we don't append the type to the template twice. */
23718 FOR_EACH_VEC_SAFE_ELT (get_types_needing_access_check (templ
), i
, iter
)
23719 if (iter
->typedef_decl
== type_decl
&& scope
== iter
->context
)
23722 append_type_to_template_for_access_check_1 (templ
, type_decl
,
23726 /* Convert the generic type parameters in PARM that match the types given in the
23727 range [START_IDX, END_IDX) from the current_template_parms into generic type
23731 convert_generic_types_to_packs (tree parm
, int start_idx
, int end_idx
)
23733 tree current
= current_template_parms
;
23734 int depth
= TMPL_PARMS_DEPTH (current
);
23735 current
= INNERMOST_TEMPLATE_PARMS (current
);
23736 tree replacement
= make_tree_vec (TREE_VEC_LENGTH (current
));
23738 for (int i
= 0; i
< start_idx
; ++i
)
23739 TREE_VEC_ELT (replacement
, i
)
23740 = TREE_TYPE (TREE_VALUE (TREE_VEC_ELT (current
, i
)));
23742 for (int i
= start_idx
; i
< end_idx
; ++i
)
23744 /* Create a distinct parameter pack type from the current parm and add it
23745 to the replacement args to tsubst below into the generic function
23748 tree o
= TREE_TYPE (TREE_VALUE
23749 (TREE_VEC_ELT (current
, i
)));
23750 tree t
= copy_type (o
);
23751 TEMPLATE_TYPE_PARM_INDEX (t
)
23752 = reduce_template_parm_level (TEMPLATE_TYPE_PARM_INDEX (o
),
23754 TREE_TYPE (TEMPLATE_TYPE_DECL (t
)) = t
;
23755 TYPE_STUB_DECL (t
) = TYPE_NAME (t
) = TEMPLATE_TYPE_DECL (t
);
23756 TYPE_MAIN_VARIANT (t
) = t
;
23757 TEMPLATE_TYPE_PARAMETER_PACK (t
) = true;
23758 TYPE_CANONICAL (t
) = canonical_type_parameter (t
);
23759 TREE_VEC_ELT (replacement
, i
) = t
;
23760 TREE_VALUE (TREE_VEC_ELT (current
, i
)) = TREE_CHAIN (t
);
23763 for (int i
= end_idx
, e
= TREE_VEC_LENGTH (current
); i
< e
; ++i
)
23764 TREE_VEC_ELT (replacement
, i
)
23765 = TREE_TYPE (TREE_VALUE (TREE_VEC_ELT (current
, i
)));
23767 /* If there are more levels then build up the replacement with the outer
23770 replacement
= add_to_template_args (template_parms_to_args
23771 (TREE_CHAIN (current_template_parms
)),
23774 return tsubst (parm
, replacement
, tf_none
, NULL_TREE
);
23777 /* Entries in the decl_constraint hash table. */
23778 struct GTY((for_user
)) constr_entry
23784 /* Hashing function and equality for constraint entries. */
23785 struct constr_hasher
: ggc_ptr_hash
<constr_entry
>
23787 static hashval_t
hash (constr_entry
*e
)
23789 return (hashval_t
)DECL_UID (e
->decl
);
23792 static bool equal (constr_entry
*e1
, constr_entry
*e2
)
23794 return e1
->decl
== e2
->decl
;
23798 /* A mapping from declarations to constraint information. Note that
23799 both templates and their underlying declarations are mapped to the
23800 same constraint information.
23802 FIXME: This is defined in pt.c because garbage collection
23803 code is not being generated for constraint.cc. */
23805 static GTY (()) hash_table
<constr_hasher
> *decl_constraints
;
23807 /* Returns true iff cinfo contains a valid set of constraints.
23808 This is the case when the associated requirements have been
23809 successfully decomposed into lists of atomic constraints.
23810 That is, when the saved assumptions are not error_mark_node. */
23813 valid_constraints_p (tree cinfo
)
23815 gcc_assert (cinfo
);
23816 return CI_ASSUMPTIONS (cinfo
) != error_mark_node
;
23819 /* Returns the template constraints of declaration T. If T is not
23820 constrained, return NULL_TREE. Note that T must be non-null. */
23823 get_constraints (tree t
)
23825 gcc_assert (DECL_P (t
));
23826 if (TREE_CODE (t
) == TEMPLATE_DECL
)
23827 t
= DECL_TEMPLATE_RESULT (t
);
23828 constr_entry elt
= { t
, NULL_TREE
};
23829 constr_entry
* found
= decl_constraints
->find (&elt
);
23836 /* Associate the given constraint information CI with the declaration
23837 T. If T is a template, then the constraints are associated with
23838 its underlying declaration. Don't build associations if CI is
23842 set_constraints (tree t
, tree ci
)
23847 if (TREE_CODE (t
) == TEMPLATE_DECL
)
23848 t
= DECL_TEMPLATE_RESULT (t
);
23849 gcc_assert (!get_constraints (t
));
23850 constr_entry elt
= {t
, ci
};
23851 constr_entry
** slot
= decl_constraints
->find_slot (&elt
, INSERT
);
23852 constr_entry
* entry
= ggc_alloc
<constr_entry
> ();
23857 /* Remove the associated constraints of the declaration T. */
23860 remove_constraints (tree t
)
23862 gcc_assert (DECL_P (t
));
23863 if (TREE_CODE (t
) == TEMPLATE_DECL
)
23864 t
= DECL_TEMPLATE_RESULT (t
);
23866 constr_entry elt
= {t
, NULL_TREE
};
23867 constr_entry
** slot
= decl_constraints
->find_slot (&elt
, NO_INSERT
);
23869 decl_constraints
->clear_slot (slot
);
23872 /* Set up the hash table for constraint association. */
23875 init_constraint_processing (void)
23877 decl_constraints
= hash_table
<constr_hasher
>::create_ggc(37);
23880 /* Set up the hash tables for template instantiations. */
23883 init_template_processing (void)
23885 decl_specializations
= hash_table
<spec_hasher
>::create_ggc (37);
23886 type_specializations
= hash_table
<spec_hasher
>::create_ggc (37);
23889 /* Print stats about the template hash tables for -fstats. */
23892 print_template_statistics (void)
23894 fprintf (stderr
, "decl_specializations: size %ld, %ld elements, "
23895 "%f collisions\n", (long) decl_specializations
->size (),
23896 (long) decl_specializations
->elements (),
23897 decl_specializations
->collisions ());
23898 fprintf (stderr
, "type_specializations: size %ld, %ld elements, "
23899 "%f collisions\n", (long) type_specializations
->size (),
23900 (long) type_specializations
->elements (),
23901 type_specializations
->collisions ());
23904 #include "gt-cp-pt.h"