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 (cxx_dialect
>= cxx1z
)
6238 if (TREE_CODE (type
) != REFERENCE_TYPE
)
6239 expr
= maybe_constant_value (expr
);
6240 else if (REFERENCE_REF_P (expr
))
6242 expr
= TREE_OPERAND (expr
, 0);
6243 expr
= maybe_constant_value (expr
);
6244 expr
= convert_from_reference (expr
);
6247 else if (TYPE_PTR_OR_PTRMEM_P (type
))
6249 tree folded
= maybe_constant_value (expr
);
6250 if (TYPE_PTR_P (type
) ? integer_zerop (folded
)
6251 : null_member_pointer_value_p (folded
))
6256 /* HACK: Due to double coercion, we can get a
6257 NOP_EXPR<REFERENCE_TYPE>(ADDR_EXPR<POINTER_TYPE> (arg)) here,
6258 which is the tree that we built on the first call (see
6259 below when coercing to reference to object or to reference to
6260 function). We just strip everything and get to the arg.
6261 See g++.old-deja/g++.oliva/template4.C and g++.dg/template/nontype9.C
6263 if (TYPE_REF_OBJ_P (type
) || TYPE_REFFN_P (type
))
6265 tree probe_type
, probe
= expr
;
6266 if (REFERENCE_REF_P (probe
))
6267 probe
= TREE_OPERAND (probe
, 0);
6268 probe_type
= TREE_TYPE (probe
);
6269 if (TREE_CODE (probe
) == NOP_EXPR
)
6271 /* ??? Maybe we could use convert_from_reference here, but we
6272 would need to relax its constraints because the NOP_EXPR
6273 could actually change the type to something more cv-qualified,
6274 and this is not folded by convert_from_reference. */
6275 tree addr
= TREE_OPERAND (probe
, 0);
6276 if (TREE_CODE (probe_type
) == REFERENCE_TYPE
6277 && TREE_CODE (addr
) == ADDR_EXPR
6278 && TYPE_PTR_P (TREE_TYPE (addr
))
6279 && (same_type_ignoring_top_level_qualifiers_p
6280 (TREE_TYPE (probe_type
),
6281 TREE_TYPE (TREE_TYPE (addr
)))))
6283 expr
= TREE_OPERAND (addr
, 0);
6284 expr_type
= TREE_TYPE (probe_type
);
6289 /* We could also generate a NOP_EXPR(ADDR_EXPR()) when the
6290 parameter is a pointer to object, through decay and
6291 qualification conversion. Let's strip everything. */
6292 else if (TREE_CODE (expr
) == NOP_EXPR
&& TYPE_PTROBV_P (type
))
6296 if (TREE_CODE (probe
) == ADDR_EXPR
6297 && TYPE_PTR_P (TREE_TYPE (probe
)))
6299 /* Skip the ADDR_EXPR only if it is part of the decay for
6300 an array. Otherwise, it is part of the original argument
6301 in the source code. */
6302 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (probe
, 0))) == ARRAY_TYPE
)
6303 probe
= TREE_OPERAND (probe
, 0);
6305 expr_type
= TREE_TYPE (expr
);
6309 /* [temp.arg.nontype]/5, bullet 1
6311 For a non-type template-parameter of integral or enumeration type,
6312 integral promotions (_conv.prom_) and integral conversions
6313 (_conv.integral_) are applied. */
6314 if (INTEGRAL_OR_ENUMERATION_TYPE_P (type
))
6316 tree t
= build_integral_nontype_arg_conv (type
, expr
, complain
);
6317 t
= maybe_constant_value (t
);
6318 if (t
!= error_mark_node
)
6321 if (!same_type_ignoring_top_level_qualifiers_p (type
, TREE_TYPE (expr
)))
6322 return error_mark_node
;
6324 /* Notice that there are constant expressions like '4 % 0' which
6325 do not fold into integer constants. */
6326 if (TREE_CODE (expr
) != INTEGER_CST
)
6328 if (complain
& tf_error
)
6330 int errs
= errorcount
, warns
= warningcount
+ werrorcount
;
6331 if (processing_template_decl
6332 && !require_potential_constant_expression (expr
))
6334 expr
= cxx_constant_value (expr
);
6335 if (errorcount
> errs
|| warningcount
+ werrorcount
> warns
)
6336 inform (EXPR_LOC_OR_LOC (expr
, input_location
),
6337 "in template argument for type %qT ", type
);
6338 if (expr
== error_mark_node
)
6340 /* else cxx_constant_value complained but gave us
6341 a real constant, so go ahead. */
6342 gcc_assert (TREE_CODE (expr
) == INTEGER_CST
);
6348 /* Avoid typedef problems. */
6349 if (TREE_TYPE (expr
) != type
)
6350 expr
= fold_convert (type
, expr
);
6352 /* [temp.arg.nontype]/5, bullet 2
6354 For a non-type template-parameter of type pointer to object,
6355 qualification conversions (_conv.qual_) and the array-to-pointer
6356 conversion (_conv.array_) are applied. */
6357 else if (TYPE_PTROBV_P (type
))
6359 /* [temp.arg.nontype]/1 (TC1 version, DR 49):
6361 A template-argument for a non-type, non-template template-parameter
6362 shall be one of: [...]
6364 -- the name of a non-type template-parameter;
6365 -- the address of an object or function with external linkage, [...]
6366 expressed as "& id-expression" where the & is optional if the name
6367 refers to a function or array, or if the corresponding
6368 template-parameter is a reference.
6370 Here, we do not care about functions, as they are invalid anyway
6371 for a parameter of type pointer-to-object. */
6373 if (DECL_P (expr
) && DECL_TEMPLATE_PARM_P (expr
))
6374 /* Non-type template parameters are OK. */
6376 else if (cxx_dialect
>= cxx11
&& integer_zerop (expr
))
6377 /* Null pointer values are OK in C++11. */;
6378 else if (TREE_CODE (expr
) != ADDR_EXPR
6379 && TREE_CODE (expr_type
) != ARRAY_TYPE
)
6383 if (complain
& tf_error
)
6384 error ("%qD is not a valid template argument "
6385 "because %qD is a variable, not the address of "
6386 "a variable", expr
, expr
);
6389 if (POINTER_TYPE_P (expr_type
))
6391 if (complain
& tf_error
)
6392 error ("%qE is not a valid template argument for %qT "
6393 "because it is not the address of a variable",
6397 /* Other values, like integer constants, might be valid
6398 non-type arguments of some other type. */
6399 return error_mark_node
;
6405 decl
= ((TREE_CODE (expr
) == ADDR_EXPR
)
6406 ? TREE_OPERAND (expr
, 0) : expr
);
6409 if (complain
& tf_error
)
6410 error ("%qE is not a valid template argument of type %qT "
6411 "because %qE is not a variable", expr
, type
, decl
);
6414 else if (cxx_dialect
< cxx11
&& !DECL_EXTERNAL_LINKAGE_P (decl
))
6416 if (complain
& tf_error
)
6417 error ("%qE is not a valid template argument of type %qT "
6418 "because %qD does not have external linkage",
6422 else if (cxx_dialect
>= cxx11
&& decl_linkage (decl
) == lk_none
)
6424 if (complain
& tf_error
)
6425 error ("%qE is not a valid template argument of type %qT "
6426 "because %qD has no linkage", expr
, type
, decl
);
6431 expr
= decay_conversion (expr
, complain
);
6432 if (expr
== error_mark_node
)
6433 return error_mark_node
;
6435 expr
= perform_qualification_conversions (type
, expr
);
6436 if (expr
== error_mark_node
)
6437 return error_mark_node
;
6439 /* [temp.arg.nontype]/5, bullet 3
6441 For a non-type template-parameter of type reference to object, no
6442 conversions apply. The type referred to by the reference may be more
6443 cv-qualified than the (otherwise identical) type of the
6444 template-argument. The template-parameter is bound directly to the
6445 template-argument, which must be an lvalue. */
6446 else if (TYPE_REF_OBJ_P (type
))
6448 if (!same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (type
),
6450 return error_mark_node
;
6452 if (!at_least_as_qualified_p (TREE_TYPE (type
), expr_type
))
6454 if (complain
& tf_error
)
6455 error ("%qE is not a valid template argument for type %qT "
6456 "because of conflicts in cv-qualification", expr
, type
);
6460 if (!real_lvalue_p (expr
))
6462 if (complain
& tf_error
)
6463 error ("%qE is not a valid template argument for type %qT "
6464 "because it is not an lvalue", expr
, type
);
6468 /* [temp.arg.nontype]/1
6470 A template-argument for a non-type, non-template template-parameter
6471 shall be one of: [...]
6473 -- the address of an object or function with external linkage. */
6474 if (INDIRECT_REF_P (expr
)
6475 && TYPE_REF_OBJ_P (TREE_TYPE (TREE_OPERAND (expr
, 0))))
6477 expr
= TREE_OPERAND (expr
, 0);
6480 if (complain
& tf_error
)
6481 error ("%q#D is not a valid template argument for type %qT "
6482 "because a reference variable does not have a constant "
6483 "address", expr
, type
);
6490 if (complain
& tf_error
)
6491 error ("%qE is not a valid template argument for type %qT "
6492 "because it is not an object with linkage",
6497 /* DR 1155 allows internal linkage in C++11 and up. */
6498 linkage_kind linkage
= decl_linkage (expr
);
6499 if (linkage
< (cxx_dialect
>= cxx11
? lk_internal
: lk_external
))
6501 if (complain
& tf_error
)
6502 error ("%qE is not a valid template argument for type %qT "
6503 "because object %qD does not have linkage",
6508 expr
= build_nop (type
, build_address (expr
));
6510 /* [temp.arg.nontype]/5, bullet 4
6512 For a non-type template-parameter of type pointer to function, only
6513 the function-to-pointer conversion (_conv.func_) is applied. If the
6514 template-argument represents a set of overloaded functions (or a
6515 pointer to such), the matching function is selected from the set
6517 else if (TYPE_PTRFN_P (type
))
6519 /* If the argument is a template-id, we might not have enough
6520 context information to decay the pointer. */
6521 if (!type_unknown_p (expr_type
))
6523 expr
= decay_conversion (expr
, complain
);
6524 if (expr
== error_mark_node
)
6525 return error_mark_node
;
6528 if (cxx_dialect
>= cxx11
&& integer_zerop (expr
))
6529 /* Null pointer values are OK in C++11. */
6530 return perform_qualification_conversions (type
, expr
);
6532 expr
= convert_nontype_argument_function (type
, expr
, complain
);
6533 if (!expr
|| expr
== error_mark_node
)
6536 /* [temp.arg.nontype]/5, bullet 5
6538 For a non-type template-parameter of type reference to function, no
6539 conversions apply. If the template-argument represents a set of
6540 overloaded functions, the matching function is selected from the set
6542 else if (TYPE_REFFN_P (type
))
6544 if (TREE_CODE (expr
) == ADDR_EXPR
)
6546 if (complain
& tf_error
)
6548 error ("%qE is not a valid template argument for type %qT "
6549 "because it is a pointer", expr
, type
);
6550 inform (input_location
, "try using %qE instead",
6551 TREE_OPERAND (expr
, 0));
6556 expr
= convert_nontype_argument_function (type
, expr
, complain
);
6557 if (!expr
|| expr
== error_mark_node
)
6560 expr
= build_nop (type
, build_address (expr
));
6562 /* [temp.arg.nontype]/5, bullet 6
6564 For a non-type template-parameter of type pointer to member function,
6565 no conversions apply. If the template-argument represents a set of
6566 overloaded member functions, the matching member function is selected
6567 from the set (_over.over_). */
6568 else if (TYPE_PTRMEMFUNC_P (type
))
6570 expr
= instantiate_type (type
, expr
, tf_none
);
6571 if (expr
== error_mark_node
)
6572 return error_mark_node
;
6574 /* [temp.arg.nontype] bullet 1 says the pointer to member
6575 expression must be a pointer-to-member constant. */
6576 if (!check_valid_ptrmem_cst_expr (type
, expr
, complain
))
6577 return error_mark_node
;
6579 /* There is no way to disable standard conversions in
6580 resolve_address_of_overloaded_function (called by
6581 instantiate_type). It is possible that the call succeeded by
6582 converting &B::I to &D::I (where B is a base of D), so we need
6583 to reject this conversion here.
6585 Actually, even if there was a way to disable standard conversions,
6586 it would still be better to reject them here so that we can
6587 provide a superior diagnostic. */
6588 if (!same_type_p (TREE_TYPE (expr
), type
))
6590 if (complain
& tf_error
)
6592 error ("%qE is not a valid template argument for type %qT "
6593 "because it is of type %qT", expr
, type
,
6595 /* If we are just one standard conversion off, explain. */
6596 if (can_convert_standard (type
, TREE_TYPE (expr
), complain
))
6597 inform (input_location
,
6598 "standard conversions are not allowed in this context");
6603 /* [temp.arg.nontype]/5, bullet 7
6605 For a non-type template-parameter of type pointer to data member,
6606 qualification conversions (_conv.qual_) are applied. */
6607 else if (TYPE_PTRDATAMEM_P (type
))
6609 /* [temp.arg.nontype] bullet 1 says the pointer to member
6610 expression must be a pointer-to-member constant. */
6611 if (!check_valid_ptrmem_cst_expr (type
, expr
, complain
))
6612 return error_mark_node
;
6614 expr
= perform_qualification_conversions (type
, expr
);
6615 if (expr
== error_mark_node
)
6618 else if (NULLPTR_TYPE_P (type
))
6620 if (expr
!= nullptr_node
)
6622 if (complain
& tf_error
)
6623 error ("%qE is not a valid template argument for type %qT "
6624 "because it is of type %qT", expr
, type
, TREE_TYPE (expr
));
6629 /* A template non-type parameter must be one of the above. */
6633 /* Sanity check: did we actually convert the argument to the
6635 gcc_assert (same_type_ignoring_top_level_qualifiers_p
6636 (type
, TREE_TYPE (expr
)));
6637 return convert_from_reference (expr
);
6640 /* Subroutine of coerce_template_template_parms, which returns 1 if
6641 PARM_PARM and ARG_PARM match using the rule for the template
6642 parameters of template template parameters. Both PARM and ARG are
6643 template parameters; the rest of the arguments are the same as for
6644 coerce_template_template_parms.
6647 coerce_template_template_parm (tree parm
,
6649 tsubst_flags_t complain
,
6653 if (arg
== NULL_TREE
|| error_operand_p (arg
)
6654 || parm
== NULL_TREE
|| error_operand_p (parm
))
6657 if (TREE_CODE (arg
) != TREE_CODE (parm
))
6660 switch (TREE_CODE (parm
))
6663 /* We encounter instantiations of templates like
6664 template <template <template <class> class> class TT>
6667 tree parmparm
= DECL_INNERMOST_TEMPLATE_PARMS (parm
);
6668 tree argparm
= DECL_INNERMOST_TEMPLATE_PARMS (arg
);
6670 if (!coerce_template_template_parms
6671 (parmparm
, argparm
, complain
, in_decl
, outer_args
))
6677 if (TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (arg
))
6678 && !TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (parm
)))
6679 /* Argument is a parameter pack but parameter is not. */
6684 /* The tsubst call is used to handle cases such as
6686 template <int> class C {};
6687 template <class T, template <T> class TT> class D {};
6690 i.e. the parameter list of TT depends on earlier parameters. */
6691 if (!uses_template_parms (TREE_TYPE (arg
)))
6693 tree t
= tsubst (TREE_TYPE (parm
), outer_args
, complain
, in_decl
);
6694 if (!uses_template_parms (t
)
6695 && !same_type_p (t
, TREE_TYPE (arg
)))
6699 if (TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (arg
))
6700 && !TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm
)))
6701 /* Argument is a parameter pack but parameter is not. */
6714 /* Return 1 if PARM_PARMS and ARG_PARMS matches using rule for
6715 template template parameters. Both PARM_PARMS and ARG_PARMS are
6716 vectors of TREE_LIST nodes containing TYPE_DECL, TEMPLATE_DECL
6719 Consider the example:
6720 template <class T> class A;
6721 template<template <class U> class TT> class B;
6723 For B<A>, PARM_PARMS are the parameters to TT, while ARG_PARMS are
6724 the parameters to A, and OUTER_ARGS contains A. */
6727 coerce_template_template_parms (tree parm_parms
,
6729 tsubst_flags_t complain
,
6733 int nparms
, nargs
, i
;
6737 gcc_assert (TREE_CODE (parm_parms
) == TREE_VEC
);
6738 gcc_assert (TREE_CODE (arg_parms
) == TREE_VEC
);
6740 nparms
= TREE_VEC_LENGTH (parm_parms
);
6741 nargs
= TREE_VEC_LENGTH (arg_parms
);
6743 /* Determine whether we have a parameter pack at the end of the
6744 template template parameter's template parameter list. */
6745 if (TREE_VEC_ELT (parm_parms
, nparms
- 1) != error_mark_node
)
6747 parm
= TREE_VALUE (TREE_VEC_ELT (parm_parms
, nparms
- 1));
6749 if (error_operand_p (parm
))
6752 switch (TREE_CODE (parm
))
6756 if (TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (parm
)))
6761 if (TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm
)))
6771 && !(variadic_p
&& nargs
>= nparms
- 1))
6774 /* Check all of the template parameters except the parameter pack at
6775 the end (if any). */
6776 for (i
= 0; i
< nparms
- variadic_p
; ++i
)
6778 if (TREE_VEC_ELT (parm_parms
, i
) == error_mark_node
6779 || TREE_VEC_ELT (arg_parms
, i
) == error_mark_node
)
6782 parm
= TREE_VALUE (TREE_VEC_ELT (parm_parms
, i
));
6783 arg
= TREE_VALUE (TREE_VEC_ELT (arg_parms
, i
));
6785 if (!coerce_template_template_parm (parm
, arg
, complain
, in_decl
,
6793 /* Check each of the template parameters in the template
6794 argument against the template parameter pack at the end of
6795 the template template parameter. */
6796 if (TREE_VEC_ELT (parm_parms
, i
) == error_mark_node
)
6799 parm
= TREE_VALUE (TREE_VEC_ELT (parm_parms
, i
));
6801 for (; i
< nargs
; ++i
)
6803 if (TREE_VEC_ELT (arg_parms
, i
) == error_mark_node
)
6806 arg
= TREE_VALUE (TREE_VEC_ELT (arg_parms
, i
));
6808 if (!coerce_template_template_parm (parm
, arg
, complain
, in_decl
,
6817 /* Verifies that the deduced template arguments (in TARGS) for the
6818 template template parameters (in TPARMS) represent valid bindings,
6819 by comparing the template parameter list of each template argument
6820 to the template parameter list of its corresponding template
6821 template parameter, in accordance with DR150. This
6822 routine can only be called after all template arguments have been
6823 deduced. It will return TRUE if all of the template template
6824 parameter bindings are okay, FALSE otherwise. */
6826 template_template_parm_bindings_ok_p (tree tparms
, tree targs
)
6828 int i
, ntparms
= TREE_VEC_LENGTH (tparms
);
6831 /* We're dealing with template parms in this process. */
6832 ++processing_template_decl
;
6834 targs
= INNERMOST_TEMPLATE_ARGS (targs
);
6836 for (i
= 0; i
< ntparms
; ++i
)
6838 tree tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, i
));
6839 tree targ
= TREE_VEC_ELT (targs
, i
);
6841 if (TREE_CODE (tparm
) == TEMPLATE_DECL
&& targ
)
6843 tree packed_args
= NULL_TREE
;
6846 if (ARGUMENT_PACK_P (targ
))
6848 /* Look inside the argument pack. */
6849 packed_args
= ARGUMENT_PACK_ARGS (targ
);
6850 len
= TREE_VEC_LENGTH (packed_args
);
6853 for (idx
= 0; idx
< len
; ++idx
)
6855 tree targ_parms
= NULL_TREE
;
6858 /* Extract the next argument from the argument
6860 targ
= TREE_VEC_ELT (packed_args
, idx
);
6862 if (PACK_EXPANSION_P (targ
))
6863 /* Look at the pattern of the pack expansion. */
6864 targ
= PACK_EXPANSION_PATTERN (targ
);
6866 /* Extract the template parameters from the template
6868 if (TREE_CODE (targ
) == TEMPLATE_DECL
)
6869 targ_parms
= DECL_INNERMOST_TEMPLATE_PARMS (targ
);
6870 else if (TREE_CODE (targ
) == TEMPLATE_TEMPLATE_PARM
)
6871 targ_parms
= DECL_INNERMOST_TEMPLATE_PARMS (TYPE_NAME (targ
));
6873 /* Verify that we can coerce the template template
6874 parameters from the template argument to the template
6875 parameter. This requires an exact match. */
6877 && !coerce_template_template_parms
6878 (DECL_INNERMOST_TEMPLATE_PARMS (tparm
),
6893 --processing_template_decl
;
6897 /* Since type attributes aren't mangled, we need to strip them from
6898 template type arguments. */
6901 canonicalize_type_argument (tree arg
, tsubst_flags_t complain
)
6903 if (!arg
|| arg
== error_mark_node
|| arg
== TYPE_CANONICAL (arg
))
6905 bool removed_attributes
= false;
6906 tree canon
= strip_typedefs (arg
, &removed_attributes
);
6907 if (removed_attributes
6908 && (complain
& tf_warning
))
6909 warning (0, "ignoring attributes on template argument %qT", arg
);
6913 // A template declaration can be substituted for a constrained
6914 // template template parameter only when the argument is more
6915 // constrained than the parameter.
6917 is_compatible_template_arg (tree parm
, tree arg
)
6919 tree parm_cons
= get_constraints (parm
);
6921 /* For now, allow constrained template template arguments
6922 and unconstrained template template parameters. */
6923 if (parm_cons
== NULL_TREE
)
6926 tree arg_cons
= get_constraints (arg
);
6928 // If the template parameter is constrained, we need to rewrite its
6929 // constraints in terms of the ARG's template parameters. This ensures
6930 // that all of the template parameter types will have the same depth.
6932 // Note that this is only valid when coerce_template_template_parm is
6933 // true for the innermost template parameters of PARM and ARG. In other
6934 // words, because coercion is successful, this conversion will be valid.
6937 tree args
= template_parms_to_args (DECL_TEMPLATE_PARMS (arg
));
6938 parm_cons
= tsubst_constraint_info (parm_cons
,
6939 INNERMOST_TEMPLATE_ARGS (args
),
6940 tf_none
, NULL_TREE
);
6941 if (parm_cons
== error_mark_node
)
6945 return subsumes (parm_cons
, arg_cons
);
6948 // Convert a placeholder argument into a binding to the original
6949 // parameter. The original parameter is saved as the TREE_TYPE of
6952 convert_wildcard_argument (tree parm
, tree arg
)
6954 TREE_TYPE (arg
) = parm
;
6958 /* Convert the indicated template ARG as necessary to match the
6959 indicated template PARM. Returns the converted ARG, or
6960 error_mark_node if the conversion was unsuccessful. Error and
6961 warning messages are issued under control of COMPLAIN. This
6962 conversion is for the Ith parameter in the parameter list. ARGS is
6963 the full set of template arguments deduced so far. */
6966 convert_template_argument (tree parm
,
6969 tsubst_flags_t complain
,
6975 int is_type
, requires_type
, is_tmpl_type
, requires_tmpl_type
;
6977 if (parm
== error_mark_node
)
6978 return error_mark_node
;
6980 /* Trivially convert placeholders. */
6981 if (TREE_CODE (arg
) == WILDCARD_DECL
)
6982 return convert_wildcard_argument (parm
, arg
);
6984 if (TREE_CODE (arg
) == TREE_LIST
6985 && TREE_CODE (TREE_VALUE (arg
)) == OFFSET_REF
)
6987 /* The template argument was the name of some
6988 member function. That's usually
6989 invalid, but static members are OK. In any
6990 case, grab the underlying fields/functions
6991 and issue an error later if required. */
6992 orig_arg
= TREE_VALUE (arg
);
6993 TREE_TYPE (arg
) = unknown_type_node
;
6998 requires_tmpl_type
= TREE_CODE (parm
) == TEMPLATE_DECL
;
6999 requires_type
= (TREE_CODE (parm
) == TYPE_DECL
7000 || requires_tmpl_type
);
7002 /* When determining whether an argument pack expansion is a template,
7003 look at the pattern. */
7004 if (TREE_CODE (arg
) == TYPE_PACK_EXPANSION
)
7005 arg
= PACK_EXPANSION_PATTERN (arg
);
7007 /* Deal with an injected-class-name used as a template template arg. */
7008 if (requires_tmpl_type
&& CLASS_TYPE_P (arg
))
7010 tree t
= maybe_get_template_decl_from_type_decl (TYPE_NAME (arg
));
7011 if (TREE_CODE (t
) == TEMPLATE_DECL
)
7013 if (cxx_dialect
>= cxx11
)
7014 /* OK under DR 1004. */;
7015 else if (complain
& tf_warning_or_error
)
7016 pedwarn (input_location
, OPT_Wpedantic
, "injected-class-name %qD"
7017 " used as template template argument", TYPE_NAME (arg
));
7018 else if (flag_pedantic_errors
)
7026 ((TREE_CODE (arg
) == TEMPLATE_DECL
7027 && TREE_CODE (DECL_TEMPLATE_RESULT (arg
)) == TYPE_DECL
)
7028 || (requires_tmpl_type
&& TREE_CODE (arg
) == TYPE_ARGUMENT_PACK
)
7029 || TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
7030 || TREE_CODE (arg
) == UNBOUND_CLASS_TEMPLATE
);
7033 && (TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
7034 || TREE_CODE (arg
) == UNBOUND_CLASS_TEMPLATE
))
7035 arg
= TYPE_STUB_DECL (arg
);
7037 is_type
= TYPE_P (arg
) || is_tmpl_type
;
7039 if (requires_type
&& ! is_type
&& TREE_CODE (arg
) == SCOPE_REF
7040 && TREE_CODE (TREE_OPERAND (arg
, 0)) == TEMPLATE_TYPE_PARM
)
7042 if (TREE_CODE (TREE_OPERAND (arg
, 1)) == BIT_NOT_EXPR
)
7044 if (complain
& tf_error
)
7045 error ("invalid use of destructor %qE as a type", orig_arg
);
7046 return error_mark_node
;
7049 permerror (input_location
,
7050 "to refer to a type member of a template parameter, "
7051 "use %<typename %E%>", orig_arg
);
7053 orig_arg
= make_typename_type (TREE_OPERAND (arg
, 0),
7054 TREE_OPERAND (arg
, 1),
7060 if (is_type
!= requires_type
)
7064 if (complain
& tf_error
)
7066 error ("type/value mismatch at argument %d in template "
7067 "parameter list for %qD",
7070 inform (input_location
,
7071 " expected a constant of type %qT, got %qT",
7073 (DECL_P (arg
) ? DECL_NAME (arg
) : orig_arg
));
7074 else if (requires_tmpl_type
)
7075 inform (input_location
,
7076 " expected a class template, got %qE", orig_arg
);
7078 inform (input_location
,
7079 " expected a type, got %qE", orig_arg
);
7082 return error_mark_node
;
7084 if (is_tmpl_type
^ requires_tmpl_type
)
7086 if (in_decl
&& (complain
& tf_error
))
7088 error ("type/value mismatch at argument %d in template "
7089 "parameter list for %qD",
7092 inform (input_location
,
7093 " expected a type, got %qT", DECL_NAME (arg
));
7095 inform (input_location
,
7096 " expected a class template, got %qT", orig_arg
);
7098 return error_mark_node
;
7103 if (requires_tmpl_type
)
7105 if (template_parameter_pack_p (parm
) && ARGUMENT_PACK_P (orig_arg
))
7107 else if (TREE_CODE (TREE_TYPE (arg
)) == UNBOUND_CLASS_TEMPLATE
)
7108 /* The number of argument required is not known yet.
7109 Just accept it for now. */
7110 val
= TREE_TYPE (arg
);
7113 tree parmparm
= DECL_INNERMOST_TEMPLATE_PARMS (parm
);
7116 /* Strip alias templates that are equivalent to another
7118 arg
= get_underlying_template (arg
);
7119 argparm
= DECL_INNERMOST_TEMPLATE_PARMS (arg
);
7121 if (coerce_template_template_parms (parmparm
, argparm
,
7127 /* TEMPLATE_TEMPLATE_PARM node is preferred over
7129 if (val
!= error_mark_node
)
7131 if (DECL_TEMPLATE_TEMPLATE_PARM_P (val
))
7132 val
= TREE_TYPE (val
);
7133 if (TREE_CODE (orig_arg
) == TYPE_PACK_EXPANSION
)
7134 val
= make_pack_expansion (val
);
7139 if (in_decl
&& (complain
& tf_error
))
7141 error ("type/value mismatch at argument %d in "
7142 "template parameter list for %qD",
7144 inform (input_location
,
7145 " expected a template of type %qD, got %qT",
7149 val
= error_mark_node
;
7152 // Check that the constraints are compatible before allowing the
7154 if (val
!= error_mark_node
)
7155 if (!is_compatible_template_arg (parm
, arg
))
7157 if (in_decl
&& (complain
& tf_error
))
7159 error ("constraint mismatch at argument %d in "
7160 "template parameter list for %qD",
7162 inform (input_location
, " expected %qD but got %qD",
7165 val
= error_mark_node
;
7171 /* We only form one instance of each template specialization.
7172 Therefore, if we use a non-canonical variant (i.e., a
7173 typedef), any future messages referring to the type will use
7174 the typedef, which is confusing if those future uses do not
7175 themselves also use the typedef. */
7177 val
= canonicalize_type_argument (val
, complain
);
7181 tree t
= tsubst (TREE_TYPE (parm
), args
, complain
, in_decl
);
7183 if (invalid_nontype_parm_type_p (t
, complain
))
7184 return error_mark_node
;
7186 if (template_parameter_pack_p (parm
) && ARGUMENT_PACK_P (orig_arg
))
7188 if (same_type_p (t
, TREE_TYPE (orig_arg
)))
7192 /* Not sure if this is reachable, but it doesn't hurt
7194 error ("type mismatch in nontype parameter pack");
7195 val
= error_mark_node
;
7198 else if (!dependent_template_arg_p (orig_arg
)
7199 && !uses_template_parms (t
))
7200 /* We used to call digest_init here. However, digest_init
7201 will report errors, which we don't want when complain
7202 is zero. More importantly, digest_init will try too
7203 hard to convert things: for example, `0' should not be
7204 converted to pointer type at this point according to
7205 the standard. Accepting this is not merely an
7206 extension, since deciding whether or not these
7207 conversions can occur is part of determining which
7208 function template to call, or whether a given explicit
7209 argument specification is valid. */
7210 val
= convert_nontype_argument (t
, orig_arg
, complain
);
7213 bool removed_attr
= false;
7214 val
= strip_typedefs_expr (orig_arg
, &removed_attr
);
7217 if (val
== NULL_TREE
)
7218 val
= error_mark_node
;
7219 else if (val
== error_mark_node
&& (complain
& tf_error
))
7220 error ("could not convert template argument %qE to %qT", orig_arg
, t
);
7222 if (INDIRECT_REF_P (val
))
7224 /* Reject template arguments that are references to built-in
7225 functions with no library fallbacks. */
7226 const_tree inner
= TREE_OPERAND (val
, 0);
7227 if (TREE_CODE (TREE_TYPE (inner
)) == REFERENCE_TYPE
7228 && TREE_CODE (TREE_TYPE (TREE_TYPE (inner
))) == FUNCTION_TYPE
7229 && TREE_CODE (TREE_TYPE (inner
)) == REFERENCE_TYPE
7230 && reject_gcc_builtin (TREE_OPERAND (inner
, 0)))
7231 return error_mark_node
;
7234 if (TREE_CODE (val
) == SCOPE_REF
)
7236 /* Strip typedefs from the SCOPE_REF. */
7237 tree type
= canonicalize_type_argument (TREE_TYPE (val
), complain
);
7238 tree scope
= canonicalize_type_argument (TREE_OPERAND (val
, 0),
7240 val
= build_qualified_name (type
, scope
, TREE_OPERAND (val
, 1),
7241 QUALIFIED_NAME_IS_TEMPLATE (val
));
7248 /* Coerces the remaining template arguments in INNER_ARGS (from
7249 ARG_IDX to the end) into the parameter pack at PARM_IDX in PARMS.
7250 Returns the coerced argument pack. PARM_IDX is the position of this
7251 parameter in the template parameter list. ARGS is the original
7252 template argument list. */
7254 coerce_template_parameter_pack (tree parms
,
7262 tsubst_flags_t complain
)
7264 tree parm
= TREE_VEC_ELT (parms
, parm_idx
);
7265 int nargs
= inner_args
? NUM_TMPL_ARGS (inner_args
) : 0;
7268 tree packed_parms
= NULL_TREE
;
7270 if (arg_idx
> nargs
)
7273 if (tree packs
= fixed_parameter_pack_p (TREE_VALUE (parm
)))
7275 /* When the template parameter is a non-type template parameter pack
7276 or template template parameter pack whose type or template
7277 parameters use parameter packs, we know exactly how many arguments
7278 we are looking for. Build a vector of the instantiated decls for
7279 these template parameters in PACKED_PARMS. */
7280 /* We can't use make_pack_expansion here because it would interpret a
7281 _DECL as a use rather than a declaration. */
7282 tree decl
= TREE_VALUE (parm
);
7283 tree exp
= cxx_make_type (TYPE_PACK_EXPANSION
);
7284 SET_PACK_EXPANSION_PATTERN (exp
, decl
);
7285 PACK_EXPANSION_PARAMETER_PACKS (exp
) = packs
;
7286 SET_TYPE_STRUCTURAL_EQUALITY (exp
);
7288 TREE_VEC_LENGTH (args
)--;
7289 packed_parms
= tsubst_pack_expansion (exp
, args
, complain
, decl
);
7290 TREE_VEC_LENGTH (args
)++;
7292 if (packed_parms
== error_mark_node
)
7293 return error_mark_node
;
7295 /* If we're doing a partial instantiation of a member template,
7296 verify that all of the types used for the non-type
7297 template parameter pack are, in fact, valid for non-type
7298 template parameters. */
7300 && PACK_EXPANSION_P (TREE_VEC_ELT (inner_args
, arg_idx
)))
7302 int j
, len
= TREE_VEC_LENGTH (packed_parms
);
7303 for (j
= 0; j
< len
; ++j
)
7305 tree t
= TREE_TYPE (TREE_VEC_ELT (packed_parms
, j
));
7306 if (invalid_nontype_parm_type_p (t
, complain
))
7307 return error_mark_node
;
7309 /* We don't know how many args we have yet, just
7310 use the unconverted ones for now. */
7314 packed_args
= make_tree_vec (TREE_VEC_LENGTH (packed_parms
));
7316 /* Check if we have a placeholder pack, which indicates we're
7317 in the context of a introduction list. In that case we want
7318 to match this pack to the single placeholder. */
7319 else if (arg_idx
< nargs
7320 && TREE_CODE (TREE_VEC_ELT (inner_args
, arg_idx
)) == WILDCARD_DECL
7321 && WILDCARD_PACK_P (TREE_VEC_ELT (inner_args
, arg_idx
)))
7323 nargs
= arg_idx
+ 1;
7324 packed_args
= make_tree_vec (1);
7327 packed_args
= make_tree_vec (nargs
- arg_idx
);
7329 /* Convert the remaining arguments, which will be a part of the
7330 parameter pack "parm". */
7331 for (; arg_idx
< nargs
; ++arg_idx
)
7333 tree arg
= TREE_VEC_ELT (inner_args
, arg_idx
);
7334 tree actual_parm
= TREE_VALUE (parm
);
7335 int pack_idx
= arg_idx
- parm_idx
;
7339 /* Once we've packed as many args as we have types, stop. */
7340 if (pack_idx
>= TREE_VEC_LENGTH (packed_parms
))
7342 else if (PACK_EXPANSION_P (arg
))
7343 /* We don't know how many args we have yet, just
7344 use the unconverted ones for now. */
7347 actual_parm
= TREE_VEC_ELT (packed_parms
, pack_idx
);
7350 if (arg
== error_mark_node
)
7352 if (complain
& tf_error
)
7353 error ("template argument %d is invalid", arg_idx
+ 1);
7356 arg
= convert_template_argument (actual_parm
,
7357 arg
, new_args
, complain
, parm_idx
,
7359 if (arg
== error_mark_node
)
7361 TREE_VEC_ELT (packed_args
, pack_idx
) = arg
;
7364 if (arg_idx
- parm_idx
< TREE_VEC_LENGTH (packed_args
)
7365 && TREE_VEC_LENGTH (packed_args
) > 0)
7367 if (complain
& tf_error
)
7368 error ("wrong number of template arguments (%d, should be %d)",
7369 arg_idx
- parm_idx
, TREE_VEC_LENGTH (packed_args
));
7370 return error_mark_node
;
7373 if (TREE_CODE (TREE_VALUE (parm
)) == TYPE_DECL
7374 || TREE_CODE (TREE_VALUE (parm
)) == TEMPLATE_DECL
)
7375 argument_pack
= cxx_make_type (TYPE_ARGUMENT_PACK
);
7378 argument_pack
= make_node (NONTYPE_ARGUMENT_PACK
);
7379 TREE_TYPE (argument_pack
)
7380 = tsubst (TREE_TYPE (TREE_VALUE (parm
)), new_args
, complain
, in_decl
);
7381 TREE_CONSTANT (argument_pack
) = 1;
7384 SET_ARGUMENT_PACK_ARGS (argument_pack
, packed_args
);
7385 #ifdef ENABLE_CHECKING
7386 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (packed_args
,
7387 TREE_VEC_LENGTH (packed_args
));
7389 return argument_pack
;
7392 /* Returns the number of pack expansions in the template argument vector
7396 pack_expansion_args_count (tree args
)
7401 for (i
= 0; i
< TREE_VEC_LENGTH (args
); ++i
)
7403 tree elt
= TREE_VEC_ELT (args
, i
);
7404 if (elt
&& PACK_EXPANSION_P (elt
))
7410 /* Convert all template arguments to their appropriate types, and
7411 return a vector containing the innermost resulting template
7412 arguments. If any error occurs, return error_mark_node. Error and
7413 warning messages are issued under control of COMPLAIN.
7415 If REQUIRE_ALL_ARGS is false, argument deduction will be performed
7416 for arguments not specified in ARGS. Otherwise, if
7417 USE_DEFAULT_ARGS is true, default arguments will be used to fill in
7418 unspecified arguments. If REQUIRE_ALL_ARGS is true, but
7419 USE_DEFAULT_ARGS is false, then all arguments must be specified in
7423 coerce_template_parms (tree parms
,
7426 tsubst_flags_t complain
,
7427 bool require_all_args
,
7428 bool use_default_args
)
7430 int nparms
, nargs
, parm_idx
, arg_idx
, lost
= 0;
7431 tree orig_inner_args
;
7434 tree new_inner_args
;
7435 int saved_unevaluated_operand
;
7436 int saved_inhibit_evaluation_warnings
;
7438 /* When used as a boolean value, indicates whether this is a
7439 variadic template parameter list. Since it's an int, we can also
7440 subtract it from nparms to get the number of non-variadic
7443 int variadic_args_p
= 0;
7444 int post_variadic_parms
= 0;
7446 /* Likewise for parameters with default arguments. */
7449 if (args
== error_mark_node
)
7450 return error_mark_node
;
7452 nparms
= TREE_VEC_LENGTH (parms
);
7454 /* Determine if there are any parameter packs or default arguments. */
7455 for (parm_idx
= 0; parm_idx
< nparms
; ++parm_idx
)
7457 tree parm
= TREE_VEC_ELT (parms
, parm_idx
);
7459 ++post_variadic_parms
;
7460 if (template_parameter_pack_p (TREE_VALUE (parm
)))
7462 if (TREE_PURPOSE (parm
))
7466 inner_args
= orig_inner_args
= INNERMOST_TEMPLATE_ARGS (args
);
7467 /* If there are no parameters that follow a parameter pack, we need to
7468 expand any argument packs so that we can deduce a parameter pack from
7469 some non-packed args followed by an argument pack, as in variadic85.C.
7470 If there are such parameters, we need to leave argument packs intact
7471 so the arguments are assigned properly. This can happen when dealing
7472 with a nested class inside a partial specialization of a class
7473 template, as in variadic92.C, or when deducing a template parameter pack
7474 from a sub-declarator, as in variadic114.C. */
7475 if (!post_variadic_parms
)
7476 inner_args
= expand_template_argument_pack (inner_args
);
7478 /* Count any pack expansion args. */
7479 variadic_args_p
= pack_expansion_args_count (inner_args
);
7481 nargs
= inner_args
? NUM_TMPL_ARGS (inner_args
) : 0;
7482 if ((nargs
> nparms
&& !variadic_p
)
7483 || (nargs
< nparms
- variadic_p
7486 && (!use_default_args
7487 || (TREE_VEC_ELT (parms
, nargs
) != error_mark_node
7488 && !TREE_PURPOSE (TREE_VEC_ELT (parms
, nargs
))))))
7490 if (complain
& tf_error
)
7492 if (variadic_p
|| default_p
)
7494 nparms
-= variadic_p
+ default_p
;
7495 error ("wrong number of template arguments "
7496 "(%d, should be at least %d)", nargs
, nparms
);
7499 error ("wrong number of template arguments "
7500 "(%d, should be %d)", nargs
, nparms
);
7503 inform (DECL_SOURCE_LOCATION (in_decl
),
7504 "provided for %qD", in_decl
);
7507 return error_mark_node
;
7509 /* We can't pass a pack expansion to a non-pack parameter of an alias
7510 template (DR 1430). */
7512 && (DECL_ALIAS_TEMPLATE_P (in_decl
)
7513 || concept_template_p (in_decl
))
7515 && nargs
- variadic_args_p
< nparms
- variadic_p
)
7517 if (complain
& tf_error
)
7519 for (int i
= 0; i
< TREE_VEC_LENGTH (inner_args
); ++i
)
7521 tree arg
= TREE_VEC_ELT (inner_args
, i
);
7522 tree parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
7524 if (PACK_EXPANSION_P (arg
)
7525 && !template_parameter_pack_p (parm
))
7527 if (DECL_ALIAS_TEMPLATE_P (in_decl
))
7528 error_at (location_of (arg
),
7529 "pack expansion argument for non-pack parameter "
7530 "%qD of alias template %qD", parm
, in_decl
);
7532 error_at (location_of (arg
),
7533 "pack expansion argument for non-pack parameter "
7534 "%qD of concept %qD", parm
, in_decl
);
7535 inform (DECL_SOURCE_LOCATION (parm
), "declared here");
7542 return error_mark_node
;
7545 /* We need to evaluate the template arguments, even though this
7546 template-id may be nested within a "sizeof". */
7547 saved_unevaluated_operand
= cp_unevaluated_operand
;
7548 cp_unevaluated_operand
= 0;
7549 saved_inhibit_evaluation_warnings
= c_inhibit_evaluation_warnings
;
7550 c_inhibit_evaluation_warnings
= 0;
7551 new_inner_args
= make_tree_vec (nparms
);
7552 new_args
= add_outermost_template_args (args
, new_inner_args
);
7553 int pack_adjust
= 0;
7554 for (parm_idx
= 0, arg_idx
= 0; parm_idx
< nparms
; parm_idx
++, arg_idx
++)
7559 /* Get the Ith template parameter. */
7560 parm
= TREE_VEC_ELT (parms
, parm_idx
);
7562 if (parm
== error_mark_node
)
7564 TREE_VEC_ELT (new_inner_args
, arg_idx
) = error_mark_node
;
7568 /* Calculate the next argument. */
7569 if (arg_idx
< nargs
)
7570 arg
= TREE_VEC_ELT (inner_args
, arg_idx
);
7574 if (template_parameter_pack_p (TREE_VALUE (parm
))
7575 && !(arg
&& ARGUMENT_PACK_P (arg
)))
7577 /* Some arguments will be placed in the
7578 template parameter pack PARM. */
7579 arg
= coerce_template_parameter_pack (parms
, parm_idx
, args
,
7580 inner_args
, arg_idx
,
7584 if (arg
== NULL_TREE
)
7586 /* We don't know how many args we have yet, just use the
7587 unconverted (and still packed) ones for now. */
7588 new_inner_args
= orig_inner_args
;
7593 TREE_VEC_ELT (new_inner_args
, parm_idx
) = arg
;
7595 /* Store this argument. */
7596 if (arg
== error_mark_node
)
7599 /* We are done with all of the arguments. */
7604 pack_adjust
= TREE_VEC_LENGTH (ARGUMENT_PACK_ARGS (arg
)) - 1;
7605 arg_idx
+= pack_adjust
;
7612 if (PACK_EXPANSION_P (arg
))
7614 /* "If every valid specialization of a variadic template
7615 requires an empty template parameter pack, the template is
7616 ill-formed, no diagnostic required." So check that the
7617 pattern works with this parameter. */
7618 tree pattern
= PACK_EXPANSION_PATTERN (arg
);
7619 tree conv
= convert_template_argument (TREE_VALUE (parm
),
7623 if (conv
== error_mark_node
)
7625 inform (input_location
, "so any instantiation with a "
7626 "non-empty parameter pack would be ill-formed");
7629 else if (TYPE_P (conv
) && !TYPE_P (pattern
))
7630 /* Recover from missing typename. */
7631 TREE_VEC_ELT (inner_args
, arg_idx
)
7632 = make_pack_expansion (conv
);
7634 /* We don't know how many args we have yet, just
7635 use the unconverted ones for now. */
7636 new_inner_args
= inner_args
;
7641 else if (require_all_args
)
7643 /* There must be a default arg in this case. */
7644 arg
= tsubst_template_arg (TREE_PURPOSE (parm
), new_args
,
7646 /* The position of the first default template argument,
7647 is also the number of non-defaulted arguments in NEW_INNER_ARGS.
7649 if (!NON_DEFAULT_TEMPLATE_ARGS_COUNT (new_inner_args
))
7650 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (new_inner_args
,
7651 arg_idx
- pack_adjust
);
7656 if (arg
== error_mark_node
)
7658 if (complain
& tf_error
)
7659 error ("template argument %d is invalid", arg_idx
+ 1);
7662 /* This only occurs if there was an error in the template
7663 parameter list itself (which we would already have
7664 reported) that we are trying to recover from, e.g., a class
7665 template with a parameter list such as
7666 template<typename..., typename>. */
7669 arg
= convert_template_argument (TREE_VALUE (parm
),
7670 arg
, new_args
, complain
,
7673 if (arg
== error_mark_node
)
7675 TREE_VEC_ELT (new_inner_args
, arg_idx
- pack_adjust
) = arg
;
7677 cp_unevaluated_operand
= saved_unevaluated_operand
;
7678 c_inhibit_evaluation_warnings
= saved_inhibit_evaluation_warnings
;
7680 if (variadic_p
&& arg_idx
< nargs
)
7682 if (complain
& tf_error
)
7684 error ("wrong number of template arguments "
7685 "(%d, should be %d)", nargs
, arg_idx
);
7687 error ("provided for %q+D", in_decl
);
7689 return error_mark_node
;
7693 return error_mark_node
;
7695 #ifdef ENABLE_CHECKING
7696 if (!NON_DEFAULT_TEMPLATE_ARGS_COUNT (new_inner_args
))
7697 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (new_inner_args
,
7698 TREE_VEC_LENGTH (new_inner_args
));
7701 return new_inner_args
;
7704 /* Convert all template arguments to their appropriate types, and
7705 return a vector containing the innermost resulting template
7706 arguments. If any error occurs, return error_mark_node. Error and
7707 warning messages are not issued.
7709 Note that no function argument deduction is performed, and default
7710 arguments are used to fill in unspecified arguments. */
7712 coerce_template_parms (tree parms
, tree args
, tree in_decl
)
7714 return coerce_template_parms (parms
, args
, in_decl
, tf_none
, true, true);
7717 /* Convert all template arguments to their appropriate type, and
7718 instantiate default arguments as needed. This returns a vector
7719 containing the innermost resulting template arguments, or
7720 error_mark_node if unsuccessful. */
7722 coerce_template_parms (tree parms
, tree args
, tree in_decl
,
7723 tsubst_flags_t complain
)
7725 return coerce_template_parms (parms
, args
, in_decl
, complain
, true, true);
7728 /* Like coerce_template_parms. If PARMS represents all template
7729 parameters levels, this function returns a vector of vectors
7730 representing all the resulting argument levels. Note that in this
7731 case, only the innermost arguments are coerced because the
7732 outermost ones are supposed to have been coerced already.
7734 Otherwise, if PARMS represents only (the innermost) vector of
7735 parameters, this function returns a vector containing just the
7736 innermost resulting arguments. */
7739 coerce_innermost_template_parms (tree parms
,
7742 tsubst_flags_t complain
,
7743 bool require_all_args
,
7744 bool use_default_args
)
7746 int parms_depth
= TMPL_PARMS_DEPTH (parms
);
7747 int args_depth
= TMPL_ARGS_DEPTH (args
);
7750 if (parms_depth
> 1)
7752 coerced_args
= make_tree_vec (parms_depth
);
7756 for (level
= parms
, cur_depth
= parms_depth
;
7757 parms_depth
> 0 && level
!= NULL_TREE
;
7758 level
= TREE_CHAIN (level
), --cur_depth
)
7761 if (cur_depth
== args_depth
)
7762 l
= coerce_template_parms (TREE_VALUE (level
),
7763 args
, in_decl
, complain
,
7767 l
= TMPL_ARGS_LEVEL (args
, cur_depth
);
7769 if (l
== error_mark_node
)
7770 return error_mark_node
;
7772 SET_TMPL_ARGS_LEVEL (coerced_args
, cur_depth
, l
);
7776 coerced_args
= coerce_template_parms (INNERMOST_TEMPLATE_PARMS (parms
),
7777 args
, in_decl
, complain
,
7780 return coerced_args
;
7783 /* Returns 1 if template args OT and NT are equivalent. */
7786 template_args_equal (tree ot
, tree nt
)
7790 if (nt
== NULL_TREE
|| ot
== NULL_TREE
)
7793 if (TREE_CODE (nt
) == TREE_VEC
)
7794 /* For member templates */
7795 return TREE_CODE (ot
) == TREE_VEC
&& comp_template_args (ot
, nt
);
7796 else if (PACK_EXPANSION_P (ot
))
7797 return (PACK_EXPANSION_P (nt
)
7798 && template_args_equal (PACK_EXPANSION_PATTERN (ot
),
7799 PACK_EXPANSION_PATTERN (nt
))
7800 && template_args_equal (PACK_EXPANSION_EXTRA_ARGS (ot
),
7801 PACK_EXPANSION_EXTRA_ARGS (nt
)));
7802 else if (ARGUMENT_PACK_P (ot
))
7807 if (!ARGUMENT_PACK_P (nt
))
7810 opack
= ARGUMENT_PACK_ARGS (ot
);
7811 npack
= ARGUMENT_PACK_ARGS (nt
);
7812 len
= TREE_VEC_LENGTH (opack
);
7813 if (TREE_VEC_LENGTH (npack
) != len
)
7815 for (i
= 0; i
< len
; ++i
)
7816 if (!template_args_equal (TREE_VEC_ELT (opack
, i
),
7817 TREE_VEC_ELT (npack
, i
)))
7821 else if (ot
&& TREE_CODE (ot
) == ARGUMENT_PACK_SELECT
)
7823 /* We get here probably because we are in the middle of substituting
7824 into the pattern of a pack expansion. In that case the
7825 ARGUMENT_PACK_SELECT temporarily replaces the pack argument we are
7826 interested in. So we want to use the initial pack argument for
7828 ot
= ARGUMENT_PACK_SELECT_FROM_PACK (ot
);
7829 if (nt
&& TREE_CODE (nt
) == ARGUMENT_PACK_SELECT
)
7830 nt
= ARGUMENT_PACK_SELECT_FROM_PACK (nt
);
7831 return template_args_equal (ot
, nt
);
7833 else if (TYPE_P (nt
))
7837 /* Don't treat an alias template specialization with dependent
7838 arguments as equivalent to its underlying type when used as a
7839 template argument; we need them to be distinct so that we
7840 substitute into the specialization arguments at instantiation
7841 time. And aliases can't be equivalent without being ==, so
7842 we don't need to look any deeper. */
7843 if (TYPE_ALIAS_P (nt
) || TYPE_ALIAS_P (ot
))
7846 return same_type_p (ot
, nt
);
7848 else if (TREE_CODE (ot
) == TREE_VEC
|| TYPE_P (ot
))
7852 /* Try to treat a template non-type argument that has been converted
7853 to the parameter type as equivalent to one that hasn't yet. */
7854 for (enum tree_code code1
= TREE_CODE (ot
);
7855 CONVERT_EXPR_CODE_P (code1
)
7856 || code1
== NON_LVALUE_EXPR
;
7857 code1
= TREE_CODE (ot
))
7858 ot
= TREE_OPERAND (ot
, 0);
7859 for (enum tree_code code2
= TREE_CODE (nt
);
7860 CONVERT_EXPR_CODE_P (code2
)
7861 || code2
== NON_LVALUE_EXPR
;
7862 code2
= TREE_CODE (nt
))
7863 nt
= TREE_OPERAND (nt
, 0);
7865 return cp_tree_equal (ot
, nt
);
7869 /* Returns 1 iff the OLDARGS and NEWARGS are in fact identical sets of
7870 template arguments. Returns 0 otherwise, and updates OLDARG_PTR and
7871 NEWARG_PTR with the offending arguments if they are non-NULL. */
7874 comp_template_args_with_info (tree oldargs
, tree newargs
,
7875 tree
*oldarg_ptr
, tree
*newarg_ptr
)
7879 if (oldargs
== newargs
)
7882 if (!oldargs
|| !newargs
)
7885 if (TREE_VEC_LENGTH (oldargs
) != TREE_VEC_LENGTH (newargs
))
7888 for (i
= 0; i
< TREE_VEC_LENGTH (oldargs
); ++i
)
7890 tree nt
= TREE_VEC_ELT (newargs
, i
);
7891 tree ot
= TREE_VEC_ELT (oldargs
, i
);
7893 if (! template_args_equal (ot
, nt
))
7895 if (oldarg_ptr
!= NULL
)
7897 if (newarg_ptr
!= NULL
)
7905 /* Returns 1 iff the OLDARGS and NEWARGS are in fact identical sets
7906 of template arguments. Returns 0 otherwise. */
7909 comp_template_args (tree oldargs
, tree newargs
)
7911 return comp_template_args_with_info (oldargs
, newargs
, NULL
, NULL
);
7915 add_pending_template (tree d
)
7917 tree ti
= (TYPE_P (d
)
7918 ? CLASSTYPE_TEMPLATE_INFO (d
)
7919 : DECL_TEMPLATE_INFO (d
));
7920 struct pending_template
*pt
;
7923 if (TI_PENDING_TEMPLATE_FLAG (ti
))
7926 /* We are called both from instantiate_decl, where we've already had a
7927 tinst_level pushed, and instantiate_template, where we haven't.
7929 level
= !current_tinst_level
|| current_tinst_level
->decl
!= d
;
7932 push_tinst_level (d
);
7934 pt
= ggc_alloc
<pending_template
> ();
7936 pt
->tinst
= current_tinst_level
;
7937 if (last_pending_template
)
7938 last_pending_template
->next
= pt
;
7940 pending_templates
= pt
;
7942 last_pending_template
= pt
;
7944 TI_PENDING_TEMPLATE_FLAG (ti
) = 1;
7951 /* Return a TEMPLATE_ID_EXPR corresponding to the indicated FNS and
7952 ARGLIST. Valid choices for FNS are given in the cp-tree.def
7953 documentation for TEMPLATE_ID_EXPR. */
7956 lookup_template_function (tree fns
, tree arglist
)
7960 if (fns
== error_mark_node
|| arglist
== error_mark_node
)
7961 return error_mark_node
;
7963 gcc_assert (!arglist
|| TREE_CODE (arglist
) == TREE_VEC
);
7965 if (!is_overloaded_fn (fns
) && !identifier_p (fns
))
7967 error ("%q#D is not a function template", fns
);
7968 return error_mark_node
;
7971 if (BASELINK_P (fns
))
7973 BASELINK_FUNCTIONS (fns
) = build2 (TEMPLATE_ID_EXPR
,
7975 BASELINK_FUNCTIONS (fns
),
7980 type
= TREE_TYPE (fns
);
7981 if (TREE_CODE (fns
) == OVERLOAD
|| !type
)
7982 type
= unknown_type_node
;
7984 return build2 (TEMPLATE_ID_EXPR
, type
, fns
, arglist
);
7987 /* Within the scope of a template class S<T>, the name S gets bound
7988 (in build_self_reference) to a TYPE_DECL for the class, not a
7989 TEMPLATE_DECL. If DECL is a TYPE_DECL for current_class_type,
7990 or one of its enclosing classes, and that type is a template,
7991 return the associated TEMPLATE_DECL. Otherwise, the original
7994 Also handle the case when DECL is a TREE_LIST of ambiguous
7995 injected-class-names from different bases. */
7998 maybe_get_template_decl_from_type_decl (tree decl
)
8000 if (decl
== NULL_TREE
)
8003 /* DR 176: A lookup that finds an injected-class-name (10.2
8004 [class.member.lookup]) can result in an ambiguity in certain cases
8005 (for example, if it is found in more than one base class). If all of
8006 the injected-class-names that are found refer to specializations of
8007 the same class template, and if the name is followed by a
8008 template-argument-list, the reference refers to the class template
8009 itself and not a specialization thereof, and is not ambiguous. */
8010 if (TREE_CODE (decl
) == TREE_LIST
)
8012 tree t
, tmpl
= NULL_TREE
;
8013 for (t
= decl
; t
; t
= TREE_CHAIN (t
))
8015 tree elt
= maybe_get_template_decl_from_type_decl (TREE_VALUE (t
));
8018 else if (tmpl
!= elt
)
8021 if (tmpl
&& t
== NULL_TREE
)
8027 return (decl
!= NULL_TREE
8028 && DECL_SELF_REFERENCE_P (decl
)
8029 && CLASSTYPE_TEMPLATE_INFO (TREE_TYPE (decl
)))
8030 ? CLASSTYPE_TI_TEMPLATE (TREE_TYPE (decl
)) : decl
;
8033 /* Given an IDENTIFIER_NODE (or type TEMPLATE_DECL) and a chain of
8034 parameters, find the desired type.
8036 D1 is the PTYPENAME terminal, and ARGLIST is the list of arguments.
8038 IN_DECL, if non-NULL, is the template declaration we are trying to
8041 If ENTERING_SCOPE is nonzero, we are about to enter the scope of
8042 the class we are looking up.
8044 Issue error and warning messages under control of COMPLAIN.
8046 If the template class is really a local class in a template
8047 function, then the FUNCTION_CONTEXT is the function in which it is
8050 ??? Note that this function is currently called *twice* for each
8051 template-id: the first time from the parser, while creating the
8052 incomplete type (finish_template_type), and the second type during the
8053 real instantiation (instantiate_template_class). This is surely something
8054 that we want to avoid. It also causes some problems with argument
8055 coercion (see convert_nontype_argument for more information on this). */
8058 lookup_template_class_1 (tree d1
, tree arglist
, tree in_decl
, tree context
,
8059 int entering_scope
, tsubst_flags_t complain
)
8061 tree templ
= NULL_TREE
, parmlist
;
8068 if (identifier_p (d1
))
8070 tree value
= innermost_non_namespace_value (d1
);
8071 if (value
&& DECL_TEMPLATE_TEMPLATE_PARM_P (value
))
8076 push_decl_namespace (context
);
8077 templ
= lookup_name (d1
);
8078 templ
= maybe_get_template_decl_from_type_decl (templ
);
8080 pop_decl_namespace ();
8083 context
= DECL_CONTEXT (templ
);
8085 else if (TREE_CODE (d1
) == TYPE_DECL
&& MAYBE_CLASS_TYPE_P (TREE_TYPE (d1
)))
8087 tree type
= TREE_TYPE (d1
);
8089 /* If we are declaring a constructor, say A<T>::A<T>, we will get
8090 an implicit typename for the second A. Deal with it. */
8091 if (TREE_CODE (type
) == TYPENAME_TYPE
&& TREE_TYPE (type
))
8092 type
= TREE_TYPE (type
);
8094 if (CLASSTYPE_TEMPLATE_INFO (type
))
8096 templ
= CLASSTYPE_TI_TEMPLATE (type
);
8097 d1
= DECL_NAME (templ
);
8100 else if (TREE_CODE (d1
) == ENUMERAL_TYPE
8101 || (TYPE_P (d1
) && MAYBE_CLASS_TYPE_P (d1
)))
8103 templ
= TYPE_TI_TEMPLATE (d1
);
8104 d1
= DECL_NAME (templ
);
8106 else if (DECL_TYPE_TEMPLATE_P (d1
))
8109 d1
= DECL_NAME (templ
);
8110 context
= DECL_CONTEXT (templ
);
8112 else if (DECL_TEMPLATE_TEMPLATE_PARM_P (d1
))
8115 d1
= DECL_NAME (templ
);
8118 /* Issue an error message if we didn't find a template. */
8121 if (complain
& tf_error
)
8122 error ("%qT is not a template", d1
);
8123 return error_mark_node
;
8126 if (TREE_CODE (templ
) != TEMPLATE_DECL
8127 /* Make sure it's a user visible template, if it was named by
8129 || ((complain
& tf_user
) && !DECL_TEMPLATE_PARM_P (templ
)
8130 && !PRIMARY_TEMPLATE_P (templ
)))
8132 if (complain
& tf_error
)
8134 error ("non-template type %qT used as a template", d1
);
8136 error ("for template declaration %q+D", in_decl
);
8138 return error_mark_node
;
8141 complain
&= ~tf_user
;
8143 /* An alias that just changes the name of a template is equivalent to the
8144 other template, so if any of the arguments are pack expansions, strip
8145 the alias to avoid problems with a pack expansion passed to a non-pack
8146 alias template parameter (DR 1430). */
8147 if (pack_expansion_args_count (INNERMOST_TEMPLATE_ARGS (arglist
)))
8148 templ
= get_underlying_template (templ
);
8150 if (DECL_TEMPLATE_TEMPLATE_PARM_P (templ
))
8152 /* Create a new TEMPLATE_DECL and TEMPLATE_TEMPLATE_PARM node to store
8153 template arguments */
8159 parmlist
= DECL_INNERMOST_TEMPLATE_PARMS (templ
);
8161 /* Consider an example where a template template parameter declared as
8163 template <class T, class U = std::allocator<T> > class TT
8165 The template parameter level of T and U are one level larger than
8166 of TT. To proper process the default argument of U, say when an
8167 instantiation `TT<int>' is seen, we need to build the full
8168 arguments containing {int} as the innermost level. Outer levels,
8169 available when not appearing as default template argument, can be
8170 obtained from the arguments of the enclosing template.
8172 Suppose that TT is later substituted with std::vector. The above
8173 instantiation is `TT<int, std::allocator<T> >' with TT at
8174 level 1, and T at level 2, while the template arguments at level 1
8175 becomes {std::vector} and the inner level 2 is {int}. */
8177 outer
= DECL_CONTEXT (templ
);
8179 outer
= TI_ARGS (get_template_info (DECL_TEMPLATE_RESULT (outer
)));
8180 else if (current_template_parms
)
8182 /* This is an argument of the current template, so we haven't set
8183 DECL_CONTEXT yet. */
8184 tree relevant_template_parms
;
8186 /* Parameter levels that are greater than the level of the given
8187 template template parm are irrelevant. */
8188 relevant_template_parms
= current_template_parms
;
8189 while (TMPL_PARMS_DEPTH (relevant_template_parms
)
8190 != TEMPLATE_TYPE_LEVEL (TREE_TYPE (templ
)))
8191 relevant_template_parms
= TREE_CHAIN (relevant_template_parms
);
8193 outer
= template_parms_to_args (relevant_template_parms
);
8197 arglist
= add_to_template_args (outer
, arglist
);
8199 arglist2
= coerce_template_parms (parmlist
, arglist
, templ
,
8201 /*require_all_args=*/true,
8202 /*use_default_args=*/true);
8203 if (arglist2
== error_mark_node
8204 || (!uses_template_parms (arglist2
)
8205 && check_instantiated_args (templ
, arglist2
, complain
)))
8206 return error_mark_node
;
8208 parm
= bind_template_template_parm (TREE_TYPE (templ
), arglist2
);
8213 tree template_type
= TREE_TYPE (templ
);
8216 tree found
= NULL_TREE
;
8219 int is_dependent_type
;
8220 int use_partial_inst_tmpl
= false;
8222 if (template_type
== error_mark_node
)
8223 /* An error occurred while building the template TEMPL, and a
8224 diagnostic has most certainly been emitted for that
8225 already. Let's propagate that error. */
8226 return error_mark_node
;
8228 gen_tmpl
= most_general_template (templ
);
8229 parmlist
= DECL_TEMPLATE_PARMS (gen_tmpl
);
8230 parm_depth
= TMPL_PARMS_DEPTH (parmlist
);
8231 arg_depth
= TMPL_ARGS_DEPTH (arglist
);
8233 if (arg_depth
== 1 && parm_depth
> 1)
8235 /* We've been given an incomplete set of template arguments.
8238 template <class T> struct S1 {
8239 template <class U> struct S2 {};
8240 template <class U> struct S2<U*> {};
8243 we will be called with an ARGLIST of `U*', but the
8244 TEMPLATE will be `template <class T> template
8245 <class U> struct S1<T>::S2'. We must fill in the missing
8248 = add_outermost_template_args (TYPE_TI_ARGS (TREE_TYPE (templ
)),
8250 arg_depth
= TMPL_ARGS_DEPTH (arglist
);
8253 /* Now we should have enough arguments. */
8254 gcc_assert (parm_depth
== arg_depth
);
8256 /* From here on, we're only interested in the most general
8259 /* Calculate the BOUND_ARGS. These will be the args that are
8260 actually tsubst'd into the definition to create the
8262 arglist
= coerce_innermost_template_parms (parmlist
, arglist
, gen_tmpl
,
8264 /*require_all_args=*/true,
8265 /*use_default_args=*/true);
8267 if (arglist
== error_mark_node
)
8268 /* We were unable to bind the arguments. */
8269 return error_mark_node
;
8271 /* In the scope of a template class, explicit references to the
8272 template class refer to the type of the template, not any
8273 instantiation of it. For example, in:
8275 template <class T> class C { void f(C<T>); }
8277 the `C<T>' is just the same as `C'. Outside of the
8278 class, however, such a reference is an instantiation. */
8280 || !PRIMARY_TEMPLATE_P (gen_tmpl
)
8281 || currently_open_class (template_type
))
8282 /* comp_template_args is expensive, check it last. */
8283 && comp_template_args (TYPE_TI_ARGS (template_type
),
8285 return template_type
;
8287 /* If we already have this specialization, return it. */
8288 elt
.tmpl
= gen_tmpl
;
8290 elt
.spec
= NULL_TREE
;
8291 hash
= spec_hasher::hash (&elt
);
8292 entry
= type_specializations
->find_with_hash (&elt
, hash
);
8297 /* If the the template's constraints are not satisfied,
8298 then we cannot form a valid type.
8300 Note that the check is deferred until after the hash
8301 lookup. This prevents redundant checks on previously
8302 instantiated specializations. */
8303 if (flag_concepts
&& !constraints_satisfied_p (gen_tmpl
, arglist
))
8305 if (complain
& tf_error
)
8307 error ("template constraint failure");
8308 diagnose_constraints (input_location
, gen_tmpl
, arglist
);
8310 return error_mark_node
;
8313 is_dependent_type
= uses_template_parms (arglist
);
8315 /* If the deduced arguments are invalid, then the binding
8317 if (!is_dependent_type
8318 && check_instantiated_args (gen_tmpl
,
8319 INNERMOST_TEMPLATE_ARGS (arglist
),
8321 return error_mark_node
;
8323 if (!is_dependent_type
8324 && !PRIMARY_TEMPLATE_P (gen_tmpl
)
8325 && !LAMBDA_TYPE_P (TREE_TYPE (gen_tmpl
))
8326 && TREE_CODE (CP_DECL_CONTEXT (gen_tmpl
)) == NAMESPACE_DECL
)
8328 found
= xref_tag_from_type (TREE_TYPE (gen_tmpl
),
8329 DECL_NAME (gen_tmpl
),
8330 /*tag_scope=*/ts_global
);
8334 context
= tsubst (DECL_CONTEXT (gen_tmpl
), arglist
,
8336 if (context
== error_mark_node
)
8337 return error_mark_node
;
8340 context
= global_namespace
;
8342 /* Create the type. */
8343 if (DECL_ALIAS_TEMPLATE_P (gen_tmpl
))
8345 /* The user referred to a specialization of an alias
8346 template represented by GEN_TMPL.
8348 [temp.alias]/2 says:
8350 When a template-id refers to the specialization of an
8351 alias template, it is equivalent to the associated
8352 type obtained by substitution of its
8353 template-arguments for the template-parameters in the
8354 type-id of the alias template. */
8356 t
= tsubst (TREE_TYPE (gen_tmpl
), arglist
, complain
, in_decl
);
8357 /* Note that the call above (by indirectly calling
8358 register_specialization in tsubst_decl) registers the
8359 TYPE_DECL representing the specialization of the alias
8360 template. So next time someone substitutes ARGLIST for
8361 the template parms into the alias template (GEN_TMPL),
8362 she'll get that TYPE_DECL back. */
8364 if (t
== error_mark_node
)
8367 else if (TREE_CODE (template_type
) == ENUMERAL_TYPE
)
8369 if (!is_dependent_type
)
8371 set_current_access_from_decl (TYPE_NAME (template_type
));
8372 t
= start_enum (TYPE_IDENTIFIER (template_type
), NULL_TREE
,
8373 tsubst (ENUM_UNDERLYING_TYPE (template_type
),
8374 arglist
, complain
, in_decl
),
8375 SCOPED_ENUM_P (template_type
), NULL
);
8377 if (t
== error_mark_node
)
8382 /* We don't want to call start_enum for this type, since
8383 the values for the enumeration constants may involve
8384 template parameters. And, no one should be interested
8385 in the enumeration constants for such a type. */
8386 t
= cxx_make_type (ENUMERAL_TYPE
);
8387 SET_SCOPED_ENUM_P (t
, SCOPED_ENUM_P (template_type
));
8389 SET_OPAQUE_ENUM_P (t
, OPAQUE_ENUM_P (template_type
));
8390 ENUM_FIXED_UNDERLYING_TYPE_P (t
)
8391 = ENUM_FIXED_UNDERLYING_TYPE_P (template_type
);
8393 else if (CLASS_TYPE_P (template_type
))
8395 t
= make_class_type (TREE_CODE (template_type
));
8396 CLASSTYPE_DECLARED_CLASS (t
)
8397 = CLASSTYPE_DECLARED_CLASS (template_type
);
8398 SET_CLASSTYPE_IMPLICIT_INSTANTIATION (t
);
8399 TYPE_FOR_JAVA (t
) = TYPE_FOR_JAVA (template_type
);
8401 /* A local class. Make sure the decl gets registered properly. */
8402 if (context
== current_function_decl
)
8403 pushtag (DECL_NAME (gen_tmpl
), t
, /*tag_scope=*/ts_current
);
8405 if (comp_template_args (CLASSTYPE_TI_ARGS (template_type
), arglist
))
8406 /* This instantiation is another name for the primary
8407 template type. Set the TYPE_CANONICAL field
8409 TYPE_CANONICAL (t
) = template_type
;
8410 else if (any_template_arguments_need_structural_equality_p (arglist
))
8411 /* Some of the template arguments require structural
8412 equality testing, so this template class requires
8413 structural equality testing. */
8414 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8419 /* If we called start_enum or pushtag above, this information
8420 will already be set up. */
8423 TYPE_CONTEXT (t
) = FROB_CONTEXT (context
);
8425 type_decl
= create_implicit_typedef (DECL_NAME (gen_tmpl
), t
);
8426 DECL_CONTEXT (type_decl
) = TYPE_CONTEXT (t
);
8427 DECL_SOURCE_LOCATION (type_decl
)
8428 = DECL_SOURCE_LOCATION (TYPE_STUB_DECL (template_type
));
8431 type_decl
= TYPE_NAME (t
);
8433 if (CLASS_TYPE_P (template_type
))
8435 TREE_PRIVATE (type_decl
)
8436 = TREE_PRIVATE (TYPE_MAIN_DECL (template_type
));
8437 TREE_PROTECTED (type_decl
)
8438 = TREE_PROTECTED (TYPE_MAIN_DECL (template_type
));
8439 if (CLASSTYPE_VISIBILITY_SPECIFIED (template_type
))
8441 DECL_VISIBILITY_SPECIFIED (type_decl
) = 1;
8442 DECL_VISIBILITY (type_decl
) = CLASSTYPE_VISIBILITY (template_type
);
8446 if (OVERLOAD_TYPE_P (t
)
8447 && !DECL_ALIAS_TEMPLATE_P (gen_tmpl
))
8449 static const char *tags
[] = {"abi_tag", "may_alias"};
8451 for (unsigned ix
= 0; ix
!= 2; ix
++)
8454 = lookup_attribute (tags
[ix
], TYPE_ATTRIBUTES (template_type
));
8458 else if (!TREE_CHAIN (attributes
) && !TYPE_ATTRIBUTES (t
))
8459 TYPE_ATTRIBUTES (t
) = attributes
;
8462 = tree_cons (TREE_PURPOSE (attributes
),
8463 TREE_VALUE (attributes
),
8464 TYPE_ATTRIBUTES (t
));
8468 /* Let's consider the explicit specialization of a member
8469 of a class template specialization that is implicitly instantiated,
8474 template<class U> struct M {}; //#0
8479 struct S<int>::M<char> //#1
8483 [temp.expl.spec]/4 says this is valid.
8485 In this case, when we write:
8488 M is instantiated from the CLASSTYPE_TI_TEMPLATE of #1, not from
8491 When we encounter #1, we want to store the partial instantiation
8492 of M (template<class T> S<int>::M<T>) in its CLASSTYPE_TI_TEMPLATE.
8494 For all cases other than this "explicit specialization of member of a
8495 class template", we just want to store the most general template into
8496 the CLASSTYPE_TI_TEMPLATE of M.
8498 This case of "explicit specialization of member of a class template"
8500 1/ the enclosing class is an instantiation of, and therefore not
8501 the same as, the context of the most general template, and
8502 2/ we aren't looking at the partial instantiation itself, i.e.
8503 the innermost arguments are not the same as the innermost parms of
8504 the most general template.
8506 So it's only when 1/ and 2/ happens that we want to use the partial
8507 instantiation of the member template in lieu of its most general
8510 if (PRIMARY_TEMPLATE_P (gen_tmpl
)
8511 && TMPL_ARGS_HAVE_MULTIPLE_LEVELS (arglist
)
8512 /* the enclosing class must be an instantiation... */
8513 && CLASS_TYPE_P (context
)
8514 && !same_type_p (context
, DECL_CONTEXT (gen_tmpl
)))
8516 tree partial_inst_args
;
8517 TREE_VEC_LENGTH (arglist
)--;
8518 ++processing_template_decl
;
8520 tsubst (INNERMOST_TEMPLATE_ARGS
8521 (TYPE_TI_ARGS (TREE_TYPE (gen_tmpl
))),
8522 arglist
, complain
, NULL_TREE
);
8523 --processing_template_decl
;
8524 TREE_VEC_LENGTH (arglist
)++;
8525 use_partial_inst_tmpl
=
8526 /*...and we must not be looking at the partial instantiation
8528 !comp_template_args (INNERMOST_TEMPLATE_ARGS (arglist
),
8532 if (!use_partial_inst_tmpl
)
8533 /* This case is easy; there are no member templates involved. */
8537 /* This is a full instantiation of a member template. Find
8538 the partial instantiation of which this is an instance. */
8540 /* Temporarily reduce by one the number of levels in the ARGLIST
8541 so as to avoid comparing the last set of arguments. */
8542 TREE_VEC_LENGTH (arglist
)--;
8543 found
= tsubst (gen_tmpl
, arglist
, complain
, NULL_TREE
);
8544 TREE_VEC_LENGTH (arglist
)++;
8545 /* FOUND is either a proper class type, or an alias
8546 template specialization. In the later case, it's a
8547 TYPE_DECL, resulting from the substituting of arguments
8548 for parameters in the TYPE_DECL of the alias template
8549 done earlier. So be careful while getting the template
8551 found
= TREE_CODE (found
) == TYPE_DECL
8552 ? TYPE_TI_TEMPLATE (TREE_TYPE (found
))
8553 : CLASSTYPE_TI_TEMPLATE (found
);
8556 // Build template info for the new specialization.
8557 SET_TYPE_TEMPLATE_INFO (t
, build_template_info (found
, arglist
));
8560 slot
= type_specializations
->find_slot_with_hash (&elt
, hash
, INSERT
);
8561 entry
= ggc_alloc
<spec_entry
> ();
8565 /* Note this use of the partial instantiation so we can check it
8566 later in maybe_process_partial_specialization. */
8567 DECL_TEMPLATE_INSTANTIATIONS (found
)
8568 = tree_cons (arglist
, t
,
8569 DECL_TEMPLATE_INSTANTIATIONS (found
));
8571 if (TREE_CODE (template_type
) == ENUMERAL_TYPE
&& !is_dependent_type
8572 && !DECL_ALIAS_TEMPLATE_P (gen_tmpl
))
8573 /* Now that the type has been registered on the instantiations
8574 list, we set up the enumerators. Because the enumeration
8575 constants may involve the enumeration type itself, we make
8576 sure to register the type first, and then create the
8577 constants. That way, doing tsubst_expr for the enumeration
8578 constants won't result in recursive calls here; we'll find
8579 the instantiation and exit above. */
8580 tsubst_enum (template_type
, t
, arglist
);
8582 if (CLASS_TYPE_P (template_type
) && is_dependent_type
)
8583 /* If the type makes use of template parameters, the
8584 code that generates debugging information will crash. */
8585 DECL_IGNORED_P (TYPE_MAIN_DECL (t
)) = 1;
8587 /* Possibly limit visibility based on template args. */
8588 TREE_PUBLIC (type_decl
) = 1;
8589 determine_visibility (type_decl
);
8591 inherit_targ_abi_tags (t
);
8597 /* Wrapper for lookup_template_class_1. */
8600 lookup_template_class (tree d1
, tree arglist
, tree in_decl
, tree context
,
8601 int entering_scope
, tsubst_flags_t complain
)
8604 timevar_push (TV_TEMPLATE_INST
);
8605 ret
= lookup_template_class_1 (d1
, arglist
, in_decl
, context
,
8606 entering_scope
, complain
);
8607 timevar_pop (TV_TEMPLATE_INST
);
8611 /* Return a TEMPLATE_ID_EXPR for the given variable template and ARGLIST. */
8614 lookup_template_variable (tree templ
, tree arglist
)
8616 /* The type of the expression is NULL_TREE since the template-id could refer
8617 to an explicit or partial specialization. */
8618 tree type
= NULL_TREE
;
8619 if (flag_concepts
&& variable_concept_p (templ
))
8620 /* Except that concepts are always bool. */
8621 type
= boolean_type_node
;
8622 return build2 (TEMPLATE_ID_EXPR
, type
, templ
, arglist
);
8625 /* Instantiate a variable declaration from a TEMPLATE_ID_EXPR for use. */
8628 finish_template_variable (tree var
, tsubst_flags_t complain
)
8630 tree templ
= TREE_OPERAND (var
, 0);
8631 tree arglist
= TREE_OPERAND (var
, 1);
8633 /* We never want to return a VAR_DECL for a variable concept, since they
8634 aren't instantiated. In a template, leave the TEMPLATE_ID_EXPR alone. */
8635 bool concept_p
= flag_concepts
&& variable_concept_p (templ
);
8636 if (concept_p
&& processing_template_decl
)
8639 tree tmpl_args
= DECL_TI_ARGS (DECL_TEMPLATE_RESULT (templ
));
8640 arglist
= add_outermost_template_args (tmpl_args
, arglist
);
8642 tree parms
= DECL_TEMPLATE_PARMS (templ
);
8643 arglist
= coerce_innermost_template_parms (parms
, arglist
, templ
, complain
,
8645 /*use_default*/true);
8647 if (flag_concepts
&& !constraints_satisfied_p (templ
, arglist
))
8649 if (complain
& tf_error
)
8651 error ("constraints for %qD not satisfied", templ
);
8652 diagnose_constraints (location_of (var
), templ
, arglist
);
8654 return error_mark_node
;
8657 /* If a template-id refers to a specialization of a variable
8658 concept, then the expression is true if and only if the
8659 concept's constraints are satisfied by the given template
8662 NOTE: This is an extension of Concepts Lite TS that
8663 allows constraints to be used in expressions. */
8666 tree decl
= DECL_TEMPLATE_RESULT (templ
);
8667 return evaluate_variable_concept (decl
, arglist
);
8670 return instantiate_template (templ
, arglist
, complain
);
8677 /* True when we should also visit template parameters that occur in
8678 non-deduced contexts. */
8679 bool include_nondeduced_p
;
8680 hash_set
<tree
> *visited
;
8683 /* Called from for_each_template_parm via walk_tree. */
8686 for_each_template_parm_r (tree
*tp
, int *walk_subtrees
, void *d
)
8689 struct pair_fn_data
*pfd
= (struct pair_fn_data
*) d
;
8690 tree_fn_t fn
= pfd
->fn
;
8691 void *data
= pfd
->data
;
8694 && (pfd
->include_nondeduced_p
|| TREE_CODE (t
) != TYPENAME_TYPE
)
8695 && for_each_template_parm (TYPE_CONTEXT (t
), fn
, data
, pfd
->visited
,
8696 pfd
->include_nondeduced_p
))
8697 return error_mark_node
;
8699 switch (TREE_CODE (t
))
8702 if (TYPE_PTRMEMFUNC_P (t
))
8708 if (!TYPE_TEMPLATE_INFO (t
))
8710 else if (for_each_template_parm (TYPE_TI_ARGS (t
),
8711 fn
, data
, pfd
->visited
,
8712 pfd
->include_nondeduced_p
))
8713 return error_mark_node
;
8717 if (for_each_template_parm (TYPE_MIN_VALUE (t
),
8718 fn
, data
, pfd
->visited
,
8719 pfd
->include_nondeduced_p
)
8720 || for_each_template_parm (TYPE_MAX_VALUE (t
),
8721 fn
, data
, pfd
->visited
,
8722 pfd
->include_nondeduced_p
))
8723 return error_mark_node
;
8727 /* Since we're not going to walk subtrees, we have to do this
8729 if (for_each_template_parm (TYPE_METHOD_BASETYPE (t
), fn
, data
,
8730 pfd
->visited
, pfd
->include_nondeduced_p
))
8731 return error_mark_node
;
8735 /* Check the return type. */
8736 if (for_each_template_parm (TREE_TYPE (t
), fn
, data
, pfd
->visited
,
8737 pfd
->include_nondeduced_p
))
8738 return error_mark_node
;
8740 /* Check the parameter types. Since default arguments are not
8741 instantiated until they are needed, the TYPE_ARG_TYPES may
8742 contain expressions that involve template parameters. But,
8743 no-one should be looking at them yet. And, once they're
8744 instantiated, they don't contain template parameters, so
8745 there's no point in looking at them then, either. */
8749 for (parm
= TYPE_ARG_TYPES (t
); parm
; parm
= TREE_CHAIN (parm
))
8750 if (for_each_template_parm (TREE_VALUE (parm
), fn
, data
,
8751 pfd
->visited
, pfd
->include_nondeduced_p
))
8752 return error_mark_node
;
8754 /* Since we've already handled the TYPE_ARG_TYPES, we don't
8755 want walk_tree walking into them itself. */
8761 case UNDERLYING_TYPE
:
8762 if (pfd
->include_nondeduced_p
8763 && for_each_template_parm (TYPE_VALUES_RAW (t
), fn
, data
,
8765 pfd
->include_nondeduced_p
))
8766 return error_mark_node
;
8771 if (DECL_LANG_SPECIFIC (t
) && DECL_TEMPLATE_INFO (t
)
8772 && for_each_template_parm (DECL_TI_ARGS (t
), fn
, data
,
8773 pfd
->visited
, pfd
->include_nondeduced_p
))
8774 return error_mark_node
;
8779 if (TREE_CODE (t
) == CONST_DECL
&& DECL_TEMPLATE_PARM_P (t
)
8780 && for_each_template_parm (DECL_INITIAL (t
), fn
, data
,
8781 pfd
->visited
, pfd
->include_nondeduced_p
))
8782 return error_mark_node
;
8783 if (DECL_CONTEXT (t
)
8784 && pfd
->include_nondeduced_p
8785 && for_each_template_parm (DECL_CONTEXT (t
), fn
, data
,
8786 pfd
->visited
, pfd
->include_nondeduced_p
))
8787 return error_mark_node
;
8790 case BOUND_TEMPLATE_TEMPLATE_PARM
:
8791 /* Record template parameters such as `T' inside `TT<T>'. */
8792 if (for_each_template_parm (TYPE_TI_ARGS (t
), fn
, data
, pfd
->visited
,
8793 pfd
->include_nondeduced_p
))
8794 return error_mark_node
;
8797 case TEMPLATE_TEMPLATE_PARM
:
8798 case TEMPLATE_TYPE_PARM
:
8799 case TEMPLATE_PARM_INDEX
:
8800 if (fn
&& (*fn
)(t
, data
))
8801 return error_mark_node
;
8803 return error_mark_node
;
8807 /* A template template parameter is encountered. */
8808 if (DECL_TEMPLATE_TEMPLATE_PARM_P (t
)
8809 && for_each_template_parm (TREE_TYPE (t
), fn
, data
, pfd
->visited
,
8810 pfd
->include_nondeduced_p
))
8811 return error_mark_node
;
8813 /* Already substituted template template parameter */
8819 || for_each_template_parm (TYPENAME_TYPE_FULLNAME (t
), fn
,
8821 pfd
->include_nondeduced_p
))
8822 return error_mark_node
;
8826 if (TREE_TYPE (t
) && TYPE_PTRMEMFUNC_P (TREE_TYPE (t
))
8827 && pfd
->include_nondeduced_p
8828 && for_each_template_parm (TYPE_PTRMEMFUNC_FN_TYPE
8829 (TREE_TYPE (t
)), fn
, data
,
8830 pfd
->visited
, pfd
->include_nondeduced_p
))
8831 return error_mark_node
;
8836 /* If there's no type, then this thing must be some expression
8837 involving template parameters. */
8838 if (!fn
&& !TREE_TYPE (t
))
8839 return error_mark_node
;
8844 case IMPLICIT_CONV_EXPR
:
8845 case REINTERPRET_CAST_EXPR
:
8846 case CONST_CAST_EXPR
:
8847 case STATIC_CAST_EXPR
:
8848 case DYNAMIC_CAST_EXPR
:
8852 case PSEUDO_DTOR_EXPR
:
8854 return error_mark_node
;
8861 /* We didn't find any template parameters we liked. */
8865 /* For each TEMPLATE_TYPE_PARM, TEMPLATE_TEMPLATE_PARM,
8866 BOUND_TEMPLATE_TEMPLATE_PARM or TEMPLATE_PARM_INDEX in T,
8867 call FN with the parameter and the DATA.
8868 If FN returns nonzero, the iteration is terminated, and
8869 for_each_template_parm returns 1. Otherwise, the iteration
8870 continues. If FN never returns a nonzero value, the value
8871 returned by for_each_template_parm is 0. If FN is NULL, it is
8872 considered to be the function which always returns 1.
8874 If INCLUDE_NONDEDUCED_P, then this routine will also visit template
8875 parameters that occur in non-deduced contexts. When false, only
8876 visits those template parameters that can be deduced. */
8879 for_each_template_parm (tree t
, tree_fn_t fn
, void* data
,
8880 hash_set
<tree
> *visited
,
8881 bool include_nondeduced_p
)
8883 struct pair_fn_data pfd
;
8889 pfd
.include_nondeduced_p
= include_nondeduced_p
;
8891 /* Walk the tree. (Conceptually, we would like to walk without
8892 duplicates, but for_each_template_parm_r recursively calls
8893 for_each_template_parm, so we would need to reorganize a fair
8894 bit to use walk_tree_without_duplicates, so we keep our own
8897 pfd
.visited
= visited
;
8899 pfd
.visited
= new hash_set
<tree
>;
8900 result
= cp_walk_tree (&t
,
8901 for_each_template_parm_r
,
8903 pfd
.visited
) != NULL_TREE
;
8915 /* Returns true if T depends on any template parameter. */
8918 uses_template_parms (tree t
)
8924 int saved_processing_template_decl
;
8926 saved_processing_template_decl
= processing_template_decl
;
8927 if (!saved_processing_template_decl
)
8928 processing_template_decl
= 1;
8930 dependent_p
= dependent_type_p (t
);
8931 else if (TREE_CODE (t
) == TREE_VEC
)
8932 dependent_p
= any_dependent_template_arguments_p (t
);
8933 else if (TREE_CODE (t
) == TREE_LIST
)
8934 dependent_p
= (uses_template_parms (TREE_VALUE (t
))
8935 || uses_template_parms (TREE_CHAIN (t
)));
8936 else if (TREE_CODE (t
) == TYPE_DECL
)
8937 dependent_p
= dependent_type_p (TREE_TYPE (t
));
8940 || TREE_CODE (t
) == TEMPLATE_PARM_INDEX
8941 || TREE_CODE (t
) == OVERLOAD
8944 || TREE_CODE (t
) == TRAIT_EXPR
8945 || TREE_CODE (t
) == CONSTRUCTOR
8946 || CONSTANT_CLASS_P (t
))
8947 dependent_p
= (type_dependent_expression_p (t
)
8948 || value_dependent_expression_p (t
));
8951 gcc_assert (t
== error_mark_node
);
8952 dependent_p
= false;
8955 processing_template_decl
= saved_processing_template_decl
;
8960 /* Returns true iff current_function_decl is an incompletely instantiated
8961 template. Useful instead of processing_template_decl because the latter
8962 is set to 0 during instantiate_non_dependent_expr. */
8965 in_template_function (void)
8967 tree fn
= current_function_decl
;
8969 ++processing_template_decl
;
8970 ret
= (fn
&& DECL_LANG_SPECIFIC (fn
)
8971 && DECL_TEMPLATE_INFO (fn
)
8972 && any_dependent_template_arguments_p (DECL_TI_ARGS (fn
)));
8973 --processing_template_decl
;
8977 /* Returns true if T depends on any template parameter with level LEVEL. */
8980 uses_template_parms_level (tree t
, int level
)
8982 return for_each_template_parm (t
, template_parm_this_level_p
, &level
, NULL
,
8983 /*include_nondeduced_p=*/true);
8986 /* Returns TRUE iff INST is an instantiation we don't need to do in an
8987 ill-formed translation unit, i.e. a variable or function that isn't
8988 usable in a constant expression. */
8991 neglectable_inst_p (tree d
)
8994 && !(TREE_CODE (d
) == FUNCTION_DECL
? DECL_DECLARED_CONSTEXPR_P (d
)
8995 : decl_maybe_constant_var_p (d
)));
8998 /* Returns TRUE iff we should refuse to instantiate DECL because it's
8999 neglectable and instantiated from within an erroneous instantiation. */
9002 limit_bad_template_recursion (tree decl
)
9004 struct tinst_level
*lev
= current_tinst_level
;
9005 int errs
= errorcount
+ sorrycount
;
9006 if (lev
== NULL
|| errs
== 0 || !neglectable_inst_p (decl
))
9009 for (; lev
; lev
= lev
->next
)
9010 if (neglectable_inst_p (lev
->decl
))
9013 return (lev
&& errs
> lev
->errors
);
9016 static int tinst_depth
;
9017 extern int max_tinst_depth
;
9020 static GTY(()) struct tinst_level
*last_error_tinst_level
;
9022 /* We're starting to instantiate D; record the template instantiation context
9023 for diagnostics and to restore it later. */
9026 push_tinst_level (tree d
)
9028 return push_tinst_level_loc (d
, input_location
);
9031 /* We're starting to instantiate D; record the template instantiation context
9032 at LOC for diagnostics and to restore it later. */
9035 push_tinst_level_loc (tree d
, location_t loc
)
9037 struct tinst_level
*new_level
;
9039 if (tinst_depth
>= max_tinst_depth
)
9041 fatal_error (input_location
,
9042 "template instantiation depth exceeds maximum of %d"
9043 " (use -ftemplate-depth= to increase the maximum)",
9048 /* If the current instantiation caused problems, don't let it instantiate
9049 anything else. Do allow deduction substitution and decls usable in
9050 constant expressions. */
9051 if (limit_bad_template_recursion (d
))
9054 new_level
= ggc_alloc
<tinst_level
> ();
9055 new_level
->decl
= d
;
9056 new_level
->locus
= loc
;
9057 new_level
->errors
= errorcount
+sorrycount
;
9058 new_level
->in_system_header_p
= in_system_header_at (input_location
);
9059 new_level
->next
= current_tinst_level
;
9060 current_tinst_level
= new_level
;
9063 if (GATHER_STATISTICS
&& (tinst_depth
> depth_reached
))
9064 depth_reached
= tinst_depth
;
9069 /* We're done instantiating this template; return to the instantiation
9073 pop_tinst_level (void)
9075 /* Restore the filename and line number stashed away when we started
9076 this instantiation. */
9077 input_location
= current_tinst_level
->locus
;
9078 current_tinst_level
= current_tinst_level
->next
;
9082 /* We're instantiating a deferred template; restore the template
9083 instantiation context in which the instantiation was requested, which
9084 is one step out from LEVEL. Return the corresponding DECL or TYPE. */
9087 reopen_tinst_level (struct tinst_level
*level
)
9089 struct tinst_level
*t
;
9092 for (t
= level
; t
; t
= t
->next
)
9095 current_tinst_level
= level
;
9097 if (current_tinst_level
)
9098 current_tinst_level
->errors
= errorcount
+sorrycount
;
9102 /* Returns the TINST_LEVEL which gives the original instantiation
9105 struct tinst_level
*
9106 outermost_tinst_level (void)
9108 struct tinst_level
*level
= current_tinst_level
;
9111 level
= level
->next
;
9115 /* DECL is a friend FUNCTION_DECL or TEMPLATE_DECL. ARGS is the
9116 vector of template arguments, as for tsubst.
9118 Returns an appropriate tsubst'd friend declaration. */
9121 tsubst_friend_function (tree decl
, tree args
)
9125 if (TREE_CODE (decl
) == FUNCTION_DECL
9126 && DECL_TEMPLATE_INSTANTIATION (decl
)
9127 && TREE_CODE (DECL_TI_TEMPLATE (decl
)) != TEMPLATE_DECL
)
9128 /* This was a friend declared with an explicit template
9129 argument list, e.g.:
9133 to indicate that f was a template instantiation, not a new
9134 function declaration. Now, we have to figure out what
9135 instantiation of what template. */
9137 tree template_id
, arglist
, fns
;
9140 tree ns
= decl_namespace_context (TYPE_MAIN_DECL (current_class_type
));
9142 /* Friend functions are looked up in the containing namespace scope.
9143 We must enter that scope, to avoid finding member functions of the
9144 current class with same name. */
9145 push_nested_namespace (ns
);
9146 fns
= tsubst_expr (DECL_TI_TEMPLATE (decl
), args
,
9147 tf_warning_or_error
, NULL_TREE
,
9148 /*integral_constant_expression_p=*/false);
9149 pop_nested_namespace (ns
);
9150 arglist
= tsubst (DECL_TI_ARGS (decl
), args
,
9151 tf_warning_or_error
, NULL_TREE
);
9152 template_id
= lookup_template_function (fns
, arglist
);
9154 new_friend
= tsubst (decl
, args
, tf_warning_or_error
, NULL_TREE
);
9155 tmpl
= determine_specialization (template_id
, new_friend
,
9157 /*need_member_template=*/0,
9158 TREE_VEC_LENGTH (args
),
9160 return instantiate_template (tmpl
, new_args
, tf_error
);
9163 new_friend
= tsubst (decl
, args
, tf_warning_or_error
, NULL_TREE
);
9165 /* The NEW_FRIEND will look like an instantiation, to the
9166 compiler, but is not an instantiation from the point of view of
9167 the language. For example, we might have had:
9169 template <class T> struct S {
9170 template <class U> friend void f(T, U);
9173 Then, in S<int>, template <class U> void f(int, U) is not an
9174 instantiation of anything. */
9175 if (new_friend
== error_mark_node
)
9176 return error_mark_node
;
9178 DECL_USE_TEMPLATE (new_friend
) = 0;
9179 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
9181 DECL_USE_TEMPLATE (DECL_TEMPLATE_RESULT (new_friend
)) = 0;
9182 DECL_SAVED_TREE (DECL_TEMPLATE_RESULT (new_friend
))
9183 = DECL_SAVED_TREE (DECL_TEMPLATE_RESULT (decl
));
9186 /* The mangled name for the NEW_FRIEND is incorrect. The function
9187 is not a template instantiation and should not be mangled like
9188 one. Therefore, we forget the mangling here; we'll recompute it
9189 later if we need it. */
9190 if (TREE_CODE (new_friend
) != TEMPLATE_DECL
)
9192 SET_DECL_RTL (new_friend
, NULL
);
9193 SET_DECL_ASSEMBLER_NAME (new_friend
, NULL_TREE
);
9196 if (DECL_NAMESPACE_SCOPE_P (new_friend
))
9199 tree new_friend_template_info
;
9200 tree new_friend_result_template_info
;
9202 int new_friend_is_defn
;
9204 /* We must save some information from NEW_FRIEND before calling
9205 duplicate decls since that function will free NEW_FRIEND if
9207 new_friend_template_info
= DECL_TEMPLATE_INFO (new_friend
);
9208 new_friend_is_defn
=
9209 (DECL_INITIAL (DECL_TEMPLATE_RESULT
9210 (template_for_substitution (new_friend
)))
9212 if (TREE_CODE (new_friend
) == TEMPLATE_DECL
)
9214 /* This declaration is a `primary' template. */
9215 DECL_PRIMARY_TEMPLATE (new_friend
) = new_friend
;
9217 new_friend_result_template_info
9218 = DECL_TEMPLATE_INFO (DECL_TEMPLATE_RESULT (new_friend
));
9221 new_friend_result_template_info
= NULL_TREE
;
9223 /* Make the init_value nonzero so pushdecl knows this is a defn. */
9224 if (new_friend_is_defn
)
9225 DECL_INITIAL (new_friend
) = error_mark_node
;
9227 /* Inside pushdecl_namespace_level, we will push into the
9228 current namespace. However, the friend function should go
9229 into the namespace of the template. */
9230 ns
= decl_namespace_context (new_friend
);
9231 push_nested_namespace (ns
);
9232 old_decl
= pushdecl_namespace_level (new_friend
, /*is_friend=*/true);
9233 pop_nested_namespace (ns
);
9235 if (old_decl
== error_mark_node
)
9236 return error_mark_node
;
9238 if (old_decl
!= new_friend
)
9240 /* This new friend declaration matched an existing
9241 declaration. For example, given:
9243 template <class T> void f(T);
9244 template <class U> class C {
9245 template <class T> friend void f(T) {}
9248 the friend declaration actually provides the definition
9249 of `f', once C has been instantiated for some type. So,
9250 old_decl will be the out-of-class template declaration,
9251 while new_friend is the in-class definition.
9253 But, if `f' was called before this point, the
9254 instantiation of `f' will have DECL_TI_ARGS corresponding
9255 to `T' but not to `U', references to which might appear
9256 in the definition of `f'. Previously, the most general
9257 template for an instantiation of `f' was the out-of-class
9258 version; now it is the in-class version. Therefore, we
9259 run through all specialization of `f', adding to their
9260 DECL_TI_ARGS appropriately. In particular, they need a
9261 new set of outer arguments, corresponding to the
9262 arguments for this class instantiation.
9264 The same situation can arise with something like this:
9267 template <class T> class C {
9271 when `C<int>' is instantiated. Now, `f(int)' is defined
9274 if (!new_friend_is_defn
)
9275 /* On the other hand, if the in-class declaration does
9276 *not* provide a definition, then we don't want to alter
9277 existing definitions. We can just leave everything
9282 tree new_template
= TI_TEMPLATE (new_friend_template_info
);
9283 tree new_args
= TI_ARGS (new_friend_template_info
);
9285 /* Overwrite whatever template info was there before, if
9286 any, with the new template information pertaining to
9288 DECL_TEMPLATE_INFO (old_decl
) = new_friend_template_info
;
9290 if (TREE_CODE (old_decl
) != TEMPLATE_DECL
)
9292 /* We should have called reregister_specialization in
9294 gcc_assert (retrieve_specialization (new_template
,
9298 /* Instantiate it if the global has already been used. */
9299 if (DECL_ODR_USED (old_decl
))
9300 instantiate_decl (old_decl
, /*defer_ok=*/true,
9301 /*expl_inst_class_mem_p=*/false);
9307 /* Indicate that the old function template is a partial
9309 DECL_TEMPLATE_INFO (DECL_TEMPLATE_RESULT (old_decl
))
9310 = new_friend_result_template_info
;
9312 gcc_assert (new_template
9313 == most_general_template (new_template
));
9314 gcc_assert (new_template
!= old_decl
);
9316 /* Reassign any specializations already in the hash table
9317 to the new more general template, and add the
9318 additional template args. */
9319 for (t
= DECL_TEMPLATE_INSTANTIATIONS (old_decl
);
9323 tree spec
= TREE_VALUE (t
);
9326 elt
.tmpl
= old_decl
;
9327 elt
.args
= DECL_TI_ARGS (spec
);
9328 elt
.spec
= NULL_TREE
;
9330 decl_specializations
->remove_elt (&elt
);
9333 = add_outermost_template_args (new_args
,
9334 DECL_TI_ARGS (spec
));
9336 register_specialization
9337 (spec
, new_template
, DECL_TI_ARGS (spec
), true, 0);
9340 DECL_TEMPLATE_INSTANTIATIONS (old_decl
) = NULL_TREE
;
9344 /* The information from NEW_FRIEND has been merged into OLD_DECL
9345 by duplicate_decls. */
9346 new_friend
= old_decl
;
9351 tree context
= DECL_CONTEXT (new_friend
);
9355 template <class T> class C {
9356 template <class U> friend void C1<U>::f (); // case 1
9357 friend void C2<T>::f (); // case 2
9359 we only need to make sure CONTEXT is a complete type for
9360 case 2. To distinguish between the two cases, we note that
9361 CONTEXT of case 1 remains dependent type after tsubst while
9362 this isn't true for case 2. */
9363 ++processing_template_decl
;
9364 dependent_p
= dependent_type_p (context
);
9365 --processing_template_decl
;
9368 && !complete_type_or_else (context
, NULL_TREE
))
9369 return error_mark_node
;
9371 if (COMPLETE_TYPE_P (context
))
9373 tree fn
= new_friend
;
9374 /* do_friend adds the TEMPLATE_DECL for any member friend
9375 template even if it isn't a member template, i.e.
9376 template <class T> friend A<T>::f();
9377 Look through it in that case. */
9378 if (TREE_CODE (fn
) == TEMPLATE_DECL
9379 && !PRIMARY_TEMPLATE_P (fn
))
9380 fn
= DECL_TEMPLATE_RESULT (fn
);
9381 /* Check to see that the declaration is really present, and,
9382 possibly obtain an improved declaration. */
9383 fn
= check_classfn (context
, fn
, NULL_TREE
);
9393 /* FRIEND_TMPL is a friend TEMPLATE_DECL. ARGS is the vector of
9394 template arguments, as for tsubst.
9396 Returns an appropriate tsubst'd friend type or error_mark_node on
9400 tsubst_friend_class (tree friend_tmpl
, tree args
)
9406 if (DECL_TEMPLATE_TEMPLATE_PARM_P (friend_tmpl
))
9408 tree t
= tsubst (TREE_TYPE (friend_tmpl
), args
, tf_none
, NULL_TREE
);
9409 return TREE_TYPE (t
);
9412 context
= CP_DECL_CONTEXT (friend_tmpl
);
9414 if (context
!= global_namespace
)
9416 if (TREE_CODE (context
) == NAMESPACE_DECL
)
9417 push_nested_namespace (context
);
9419 push_nested_class (tsubst (context
, args
, tf_none
, NULL_TREE
));
9422 /* Look for a class template declaration. We look for hidden names
9423 because two friend declarations of the same template are the
9424 same. For example, in:
9427 template <typename> friend class F;
9429 template <typename> struct B {
9430 template <typename> friend class F;
9433 both F templates are the same. */
9434 tmpl
= lookup_name_real (DECL_NAME (friend_tmpl
), 0, 0,
9435 /*block_p=*/true, 0, LOOKUP_HIDDEN
);
9437 /* But, if we don't find one, it might be because we're in a
9438 situation like this:
9446 Here, in the scope of (say) S<int>, `S' is bound to a TYPE_DECL
9447 for `S<int>', not the TEMPLATE_DECL. */
9448 if (!tmpl
|| !DECL_CLASS_TEMPLATE_P (tmpl
))
9450 tmpl
= lookup_name_prefer_type (DECL_NAME (friend_tmpl
), 1);
9451 tmpl
= maybe_get_template_decl_from_type_decl (tmpl
);
9454 if (tmpl
&& DECL_CLASS_TEMPLATE_P (tmpl
))
9456 /* The friend template has already been declared. Just
9457 check to see that the declarations match, and install any new
9458 default parameters. We must tsubst the default parameters,
9459 of course. We only need the innermost template parameters
9460 because that is all that redeclare_class_template will look
9462 if (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (friend_tmpl
))
9463 > TMPL_ARGS_DEPTH (args
))
9466 location_t saved_input_location
;
9467 parms
= tsubst_template_parms (DECL_TEMPLATE_PARMS (friend_tmpl
),
9468 args
, tf_warning_or_error
);
9470 saved_input_location
= input_location
;
9471 input_location
= DECL_SOURCE_LOCATION (friend_tmpl
);
9472 tree cons
= get_constraints (tmpl
);
9473 redeclare_class_template (TREE_TYPE (tmpl
), parms
, cons
);
9474 input_location
= saved_input_location
;
9478 friend_type
= TREE_TYPE (tmpl
);
9482 /* The friend template has not already been declared. In this
9483 case, the instantiation of the template class will cause the
9484 injection of this template into the global scope. */
9485 tmpl
= tsubst (friend_tmpl
, args
, tf_warning_or_error
, NULL_TREE
);
9486 if (tmpl
== error_mark_node
)
9487 return error_mark_node
;
9489 /* The new TMPL is not an instantiation of anything, so we
9490 forget its origins. We don't reset CLASSTYPE_TI_TEMPLATE for
9491 the new type because that is supposed to be the corresponding
9492 template decl, i.e., TMPL. */
9493 DECL_USE_TEMPLATE (tmpl
) = 0;
9494 DECL_TEMPLATE_INFO (tmpl
) = NULL_TREE
;
9495 CLASSTYPE_USE_TEMPLATE (TREE_TYPE (tmpl
)) = 0;
9496 CLASSTYPE_TI_ARGS (TREE_TYPE (tmpl
))
9497 = INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (TREE_TYPE (tmpl
)));
9499 /* Inject this template into the global scope. */
9500 friend_type
= TREE_TYPE (pushdecl_top_level_maybe_friend (tmpl
, true));
9503 if (context
!= global_namespace
)
9505 if (TREE_CODE (context
) == NAMESPACE_DECL
)
9506 pop_nested_namespace (context
);
9508 pop_nested_class ();
9514 /* Returns zero if TYPE cannot be completed later due to circularity.
9515 Otherwise returns one. */
9518 can_complete_type_without_circularity (tree type
)
9520 if (type
== NULL_TREE
|| type
== error_mark_node
)
9522 else if (COMPLETE_TYPE_P (type
))
9524 else if (TREE_CODE (type
) == ARRAY_TYPE
&& TYPE_DOMAIN (type
))
9525 return can_complete_type_without_circularity (TREE_TYPE (type
));
9526 else if (CLASS_TYPE_P (type
)
9527 && TYPE_BEING_DEFINED (TYPE_MAIN_VARIANT (type
)))
9533 static tree
tsubst_omp_clauses (tree
, bool, bool, tree
, tsubst_flags_t
, tree
);
9535 /* Apply any attributes which had to be deferred until instantiation
9536 time. DECL_P, ATTRIBUTES and ATTR_FLAGS are as cplus_decl_attributes;
9537 ARGS, COMPLAIN, IN_DECL are as tsubst. */
9540 apply_late_template_attributes (tree
*decl_p
, tree attributes
, int attr_flags
,
9541 tree args
, tsubst_flags_t complain
, tree in_decl
)
9543 tree last_dep
= NULL_TREE
;
9547 for (t
= attributes
; t
; t
= TREE_CHAIN (t
))
9548 if (ATTR_IS_DEPENDENT (t
))
9551 attributes
= copy_list (attributes
);
9555 if (DECL_P (*decl_p
))
9557 if (TREE_TYPE (*decl_p
) == error_mark_node
)
9559 p
= &DECL_ATTRIBUTES (*decl_p
);
9562 p
= &TYPE_ATTRIBUTES (*decl_p
);
9566 tree late_attrs
= NULL_TREE
;
9567 tree
*q
= &late_attrs
;
9569 for (*p
= attributes
; *p
; )
9572 if (ATTR_IS_DEPENDENT (t
))
9574 *p
= TREE_CHAIN (t
);
9575 TREE_CHAIN (t
) = NULL_TREE
;
9576 if ((flag_openmp
|| flag_openmp_simd
|| flag_cilkplus
)
9577 && is_attribute_p ("omp declare simd",
9578 get_attribute_name (t
))
9581 tree clauses
= TREE_VALUE (TREE_VALUE (t
));
9582 clauses
= tsubst_omp_clauses (clauses
, true, false, args
,
9584 c_omp_declare_simd_clauses_to_decls (*decl_p
, clauses
);
9585 clauses
= finish_omp_clauses (clauses
, false, true);
9586 tree parms
= DECL_ARGUMENTS (*decl_p
);
9588 = c_omp_declare_simd_clauses_to_numbers (parms
, clauses
);
9590 TREE_VALUE (TREE_VALUE (t
)) = clauses
;
9592 TREE_VALUE (t
) = NULL_TREE
;
9594 /* If the first attribute argument is an identifier, don't
9595 pass it through tsubst. Attributes like mode, format,
9596 cleanup and several target specific attributes expect it
9598 else if (attribute_takes_identifier_p (get_attribute_name (t
))
9602 = tsubst_expr (TREE_CHAIN (TREE_VALUE (t
)), args
, complain
,
9604 /*integral_constant_expression_p=*/false);
9605 if (chain
!= TREE_CHAIN (TREE_VALUE (t
)))
9607 = tree_cons (NULL_TREE
, TREE_VALUE (TREE_VALUE (t
)),
9610 else if (TREE_VALUE (t
) && PACK_EXPANSION_P (TREE_VALUE (t
)))
9612 /* An attribute pack expansion. */
9613 tree purp
= TREE_PURPOSE (t
);
9614 tree pack
= (tsubst_pack_expansion
9615 (TREE_VALUE (t
), args
, complain
, in_decl
));
9616 int len
= TREE_VEC_LENGTH (pack
);
9617 for (int i
= 0; i
< len
; ++i
)
9619 tree elt
= TREE_VEC_ELT (pack
, i
);
9620 *q
= build_tree_list (purp
, elt
);
9621 q
= &TREE_CHAIN (*q
);
9627 = tsubst_expr (TREE_VALUE (t
), args
, complain
, in_decl
,
9628 /*integral_constant_expression_p=*/false);
9630 q
= &TREE_CHAIN (t
);
9633 p
= &TREE_CHAIN (t
);
9636 cplus_decl_attributes (decl_p
, late_attrs
, attr_flags
);
9640 /* Perform (or defer) access check for typedefs that were referenced
9641 from within the template TMPL code.
9642 This is a subroutine of instantiate_decl and instantiate_class_template.
9643 TMPL is the template to consider and TARGS is the list of arguments of
9647 perform_typedefs_access_check (tree tmpl
, tree targs
)
9649 location_t saved_location
;
9651 qualified_typedef_usage_t
*iter
;
9654 || (!CLASS_TYPE_P (tmpl
)
9655 && TREE_CODE (tmpl
) != FUNCTION_DECL
))
9658 saved_location
= input_location
;
9659 FOR_EACH_VEC_SAFE_ELT (get_types_needing_access_check (tmpl
), i
, iter
)
9661 tree type_decl
= iter
->typedef_decl
;
9662 tree type_scope
= iter
->context
;
9664 if (!type_decl
|| !type_scope
|| !CLASS_TYPE_P (type_scope
))
9667 if (uses_template_parms (type_decl
))
9668 type_decl
= tsubst (type_decl
, targs
, tf_error
, NULL_TREE
);
9669 if (uses_template_parms (type_scope
))
9670 type_scope
= tsubst (type_scope
, targs
, tf_error
, NULL_TREE
);
9672 /* Make access check error messages point to the location
9673 of the use of the typedef. */
9674 input_location
= iter
->locus
;
9675 perform_or_defer_access_check (TYPE_BINFO (type_scope
),
9676 type_decl
, type_decl
,
9677 tf_warning_or_error
);
9679 input_location
= saved_location
;
9683 instantiate_class_template_1 (tree type
)
9685 tree templ
, args
, pattern
, t
, member
;
9689 unsigned int saved_maximum_field_alignment
;
9692 if (type
== error_mark_node
)
9693 return error_mark_node
;
9695 if (COMPLETE_OR_OPEN_TYPE_P (type
)
9696 || uses_template_parms (type
))
9699 /* Figure out which template is being instantiated. */
9700 templ
= most_general_template (CLASSTYPE_TI_TEMPLATE (type
));
9701 gcc_assert (TREE_CODE (templ
) == TEMPLATE_DECL
);
9703 /* Determine what specialization of the original template to
9705 t
= most_specialized_partial_spec (type
, tf_warning_or_error
);
9706 if (t
== error_mark_node
)
9708 TYPE_BEING_DEFINED (type
) = 1;
9709 return error_mark_node
;
9713 /* This TYPE is actually an instantiation of a partial
9714 specialization. We replace the innermost set of ARGS with
9715 the arguments appropriate for substitution. For example,
9718 template <class T> struct S {};
9719 template <class T> struct S<T*> {};
9721 and supposing that we are instantiating S<int*>, ARGS will
9722 presently be {int*} -- but we need {int}. */
9723 pattern
= TREE_TYPE (t
);
9724 args
= TREE_PURPOSE (t
);
9728 pattern
= TREE_TYPE (templ
);
9729 args
= CLASSTYPE_TI_ARGS (type
);
9732 /* If the template we're instantiating is incomplete, then clearly
9733 there's nothing we can do. */
9734 if (!COMPLETE_TYPE_P (pattern
))
9737 /* If we've recursively instantiated too many templates, stop. */
9738 if (! push_tinst_level (type
))
9741 /* Now we're really doing the instantiation. Mark the type as in
9742 the process of being defined. */
9743 TYPE_BEING_DEFINED (type
) = 1;
9745 /* We may be in the middle of deferred access check. Disable
9747 push_deferring_access_checks (dk_no_deferred
);
9749 int saved_unevaluated_operand
= cp_unevaluated_operand
;
9750 int saved_inhibit_evaluation_warnings
= c_inhibit_evaluation_warnings
;
9752 fn_context
= decl_function_context (TYPE_MAIN_DECL (type
));
9753 /* Also avoid push_to_top_level for a lambda in an NSDMI. */
9754 if (!fn_context
&& LAMBDA_TYPE_P (type
) && TYPE_CLASS_SCOPE_P (type
))
9755 fn_context
= error_mark_node
;
9757 push_to_top_level ();
9760 cp_unevaluated_operand
= 0;
9761 c_inhibit_evaluation_warnings
= 0;
9763 /* Use #pragma pack from the template context. */
9764 saved_maximum_field_alignment
= maximum_field_alignment
;
9765 maximum_field_alignment
= TYPE_PRECISION (pattern
);
9767 SET_CLASSTYPE_INTERFACE_UNKNOWN (type
);
9769 /* Set the input location to the most specialized template definition.
9770 This is needed if tsubsting causes an error. */
9771 typedecl
= TYPE_MAIN_DECL (pattern
);
9772 input_location
= DECL_SOURCE_LOCATION (TYPE_NAME (type
)) =
9773 DECL_SOURCE_LOCATION (typedecl
);
9775 TYPE_PACKED (type
) = TYPE_PACKED (pattern
);
9776 TYPE_ALIGN (type
) = TYPE_ALIGN (pattern
);
9777 TYPE_USER_ALIGN (type
) = TYPE_USER_ALIGN (pattern
);
9778 TYPE_FOR_JAVA (type
) = TYPE_FOR_JAVA (pattern
); /* For libjava's JArray<T> */
9779 if (ANON_AGGR_TYPE_P (pattern
))
9780 SET_ANON_AGGR_TYPE_P (type
);
9781 if (CLASSTYPE_VISIBILITY_SPECIFIED (pattern
))
9783 CLASSTYPE_VISIBILITY_SPECIFIED (type
) = 1;
9784 CLASSTYPE_VISIBILITY (type
) = CLASSTYPE_VISIBILITY (pattern
);
9785 /* Adjust visibility for template arguments. */
9786 determine_visibility (TYPE_MAIN_DECL (type
));
9788 if (CLASS_TYPE_P (type
))
9789 CLASSTYPE_FINAL (type
) = CLASSTYPE_FINAL (pattern
);
9791 pbinfo
= TYPE_BINFO (pattern
);
9793 /* We should never instantiate a nested class before its enclosing
9794 class; we need to look up the nested class by name before we can
9795 instantiate it, and that lookup should instantiate the enclosing
9797 gcc_assert (!DECL_CLASS_SCOPE_P (TYPE_MAIN_DECL (pattern
))
9798 || COMPLETE_OR_OPEN_TYPE_P (TYPE_CONTEXT (type
)));
9800 base_list
= NULL_TREE
;
9801 if (BINFO_N_BASE_BINFOS (pbinfo
))
9807 /* We must enter the scope containing the type, as that is where
9808 the accessibility of types named in dependent bases are
9810 pushed_scope
= push_scope (CP_TYPE_CONTEXT (type
));
9812 /* Substitute into each of the bases to determine the actual
9814 for (i
= 0; BINFO_BASE_ITERATE (pbinfo
, i
, pbase_binfo
); i
++)
9817 tree access
= BINFO_BASE_ACCESS (pbinfo
, i
);
9818 tree expanded_bases
= NULL_TREE
;
9821 if (PACK_EXPANSION_P (BINFO_TYPE (pbase_binfo
)))
9824 tsubst_pack_expansion (BINFO_TYPE (pbase_binfo
),
9825 args
, tf_error
, NULL_TREE
);
9826 if (expanded_bases
== error_mark_node
)
9829 len
= TREE_VEC_LENGTH (expanded_bases
);
9832 for (idx
= 0; idx
< len
; idx
++)
9835 /* Extract the already-expanded base class. */
9836 base
= TREE_VEC_ELT (expanded_bases
, idx
);
9838 /* Substitute to figure out the base class. */
9839 base
= tsubst (BINFO_TYPE (pbase_binfo
), args
, tf_error
,
9842 if (base
== error_mark_node
)
9845 base_list
= tree_cons (access
, base
, base_list
);
9846 if (BINFO_VIRTUAL_P (pbase_binfo
))
9847 TREE_TYPE (base_list
) = integer_type_node
;
9851 /* The list is now in reverse order; correct that. */
9852 base_list
= nreverse (base_list
);
9855 pop_scope (pushed_scope
);
9857 /* Now call xref_basetypes to set up all the base-class
9859 xref_basetypes (type
, base_list
);
9861 apply_late_template_attributes (&type
, TYPE_ATTRIBUTES (pattern
),
9862 (int) ATTR_FLAG_TYPE_IN_PLACE
,
9863 args
, tf_error
, NULL_TREE
);
9864 fixup_attribute_variants (type
);
9866 /* Now that our base classes are set up, enter the scope of the
9867 class, so that name lookups into base classes, etc. will work
9868 correctly. This is precisely analogous to what we do in
9869 begin_class_definition when defining an ordinary non-template
9870 class, except we also need to push the enclosing classes. */
9871 push_nested_class (type
);
9873 /* Now members are processed in the order of declaration. */
9874 for (member
= CLASSTYPE_DECL_LIST (pattern
);
9875 member
; member
= TREE_CHAIN (member
))
9877 tree t
= TREE_VALUE (member
);
9879 if (TREE_PURPOSE (member
))
9883 /* Build new CLASSTYPE_NESTED_UTDS. */
9886 bool class_template_p
;
9888 class_template_p
= (TREE_CODE (t
) != ENUMERAL_TYPE
9889 && TYPE_LANG_SPECIFIC (t
)
9890 && CLASSTYPE_IS_TEMPLATE (t
));
9891 /* If the member is a class template, then -- even after
9892 substitution -- there may be dependent types in the
9893 template argument list for the class. We increment
9894 PROCESSING_TEMPLATE_DECL so that dependent_type_p, as
9895 that function will assume that no types are dependent
9896 when outside of a template. */
9897 if (class_template_p
)
9898 ++processing_template_decl
;
9899 newtag
= tsubst (t
, args
, tf_error
, NULL_TREE
);
9900 if (class_template_p
)
9901 --processing_template_decl
;
9902 if (newtag
== error_mark_node
)
9905 if (TREE_CODE (newtag
) != ENUMERAL_TYPE
)
9907 tree name
= TYPE_IDENTIFIER (t
);
9909 if (class_template_p
)
9910 /* Unfortunately, lookup_template_class sets
9911 CLASSTYPE_IMPLICIT_INSTANTIATION for a partial
9912 instantiation (i.e., for the type of a member
9913 template class nested within a template class.)
9914 This behavior is required for
9915 maybe_process_partial_specialization to work
9916 correctly, but is not accurate in this case;
9917 the TAG is not an instantiation of anything.
9918 (The corresponding TEMPLATE_DECL is an
9919 instantiation, but the TYPE is not.) */
9920 CLASSTYPE_USE_TEMPLATE (newtag
) = 0;
9922 /* Now, we call pushtag to put this NEWTAG into the scope of
9923 TYPE. We first set up the IDENTIFIER_TYPE_VALUE to avoid
9924 pushtag calling push_template_decl. We don't have to do
9925 this for enums because it will already have been done in
9928 SET_IDENTIFIER_TYPE_VALUE (name
, newtag
);
9929 pushtag (name
, newtag
, /*tag_scope=*/ts_current
);
9932 else if (DECL_DECLARES_FUNCTION_P (t
))
9934 /* Build new TYPE_METHODS. */
9937 if (TREE_CODE (t
) == TEMPLATE_DECL
)
9938 ++processing_template_decl
;
9939 r
= tsubst (t
, args
, tf_error
, NULL_TREE
);
9940 if (TREE_CODE (t
) == TEMPLATE_DECL
)
9941 --processing_template_decl
;
9942 set_current_access_from_decl (r
);
9943 finish_member_declaration (r
);
9944 /* Instantiate members marked with attribute used. */
9945 if (r
!= error_mark_node
&& DECL_PRESERVE_P (r
))
9947 if (TREE_CODE (r
) == FUNCTION_DECL
9948 && DECL_OMP_DECLARE_REDUCTION_P (r
))
9949 cp_check_omp_declare_reduction (r
);
9951 else if (DECL_CLASS_TEMPLATE_P (t
)
9952 && LAMBDA_TYPE_P (TREE_TYPE (t
)))
9953 /* A closure type for a lambda in a default argument for a
9954 member template. Ignore it; it will be instantiated with
9955 the default argument. */;
9958 /* Build new TYPE_FIELDS. */
9959 if (TREE_CODE (t
) == STATIC_ASSERT
)
9963 ++c_inhibit_evaluation_warnings
;
9965 tsubst_expr (STATIC_ASSERT_CONDITION (t
), args
,
9966 tf_warning_or_error
, NULL_TREE
,
9967 /*integral_constant_expression_p=*/true);
9968 --c_inhibit_evaluation_warnings
;
9970 finish_static_assert (condition
,
9971 STATIC_ASSERT_MESSAGE (t
),
9972 STATIC_ASSERT_SOURCE_LOCATION (t
),
9975 else if (TREE_CODE (t
) != CONST_DECL
)
9978 tree vec
= NULL_TREE
;
9981 /* The file and line for this declaration, to
9982 assist in error message reporting. Since we
9983 called push_tinst_level above, we don't need to
9985 input_location
= DECL_SOURCE_LOCATION (t
);
9987 if (TREE_CODE (t
) == TEMPLATE_DECL
)
9988 ++processing_template_decl
;
9989 r
= tsubst (t
, args
, tf_warning_or_error
, NULL_TREE
);
9990 if (TREE_CODE (t
) == TEMPLATE_DECL
)
9991 --processing_template_decl
;
9993 if (TREE_CODE (r
) == TREE_VEC
)
9995 /* A capture pack became multiple fields. */
9997 len
= TREE_VEC_LENGTH (vec
);
10000 for (int i
= 0; i
< len
; ++i
)
10003 r
= TREE_VEC_ELT (vec
, i
);
10008 [t]he initialization (and any associated
10009 side-effects) of a static data member does
10010 not occur unless the static data member is
10011 itself used in a way that requires the
10012 definition of the static data member to
10015 Therefore, we do not substitute into the
10016 initialized for the static data member here. */
10017 finish_static_data_member_decl
10019 /*init=*/NULL_TREE
,
10020 /*init_const_expr_p=*/false,
10021 /*asmspec_tree=*/NULL_TREE
,
10023 /* Instantiate members marked with attribute used. */
10024 if (r
!= error_mark_node
&& DECL_PRESERVE_P (r
))
10027 else if (TREE_CODE (r
) == FIELD_DECL
)
10029 /* Determine whether R has a valid type and can be
10030 completed later. If R is invalid, then its type
10031 is replaced by error_mark_node. */
10032 tree rtype
= TREE_TYPE (r
);
10033 if (can_complete_type_without_circularity (rtype
))
10034 complete_type (rtype
);
10036 if (!COMPLETE_TYPE_P (rtype
))
10038 cxx_incomplete_type_error (r
, rtype
);
10039 TREE_TYPE (r
) = error_mark_node
;
10043 /* If it is a TYPE_DECL for a class-scoped ENUMERAL_TYPE,
10044 such a thing will already have been added to the field
10045 list by tsubst_enum in finish_member_declaration in the
10046 CLASSTYPE_NESTED_UTDS case above. */
10047 if (!(TREE_CODE (r
) == TYPE_DECL
10048 && TREE_CODE (TREE_TYPE (r
)) == ENUMERAL_TYPE
10049 && DECL_ARTIFICIAL (r
)))
10051 set_current_access_from_decl (r
);
10052 finish_member_declaration (r
);
10060 if (TYPE_P (t
) || DECL_CLASS_TEMPLATE_P (t
)
10061 || DECL_TEMPLATE_TEMPLATE_PARM_P (t
))
10063 /* Build new CLASSTYPE_FRIEND_CLASSES. */
10065 tree friend_type
= t
;
10066 bool adjust_processing_template_decl
= false;
10068 if (TREE_CODE (friend_type
) == TEMPLATE_DECL
)
10070 /* template <class T> friend class C; */
10071 friend_type
= tsubst_friend_class (friend_type
, args
);
10072 adjust_processing_template_decl
= true;
10074 else if (TREE_CODE (friend_type
) == UNBOUND_CLASS_TEMPLATE
)
10076 /* template <class T> friend class C::D; */
10077 friend_type
= tsubst (friend_type
, args
,
10078 tf_warning_or_error
, NULL_TREE
);
10079 if (TREE_CODE (friend_type
) == TEMPLATE_DECL
)
10080 friend_type
= TREE_TYPE (friend_type
);
10081 adjust_processing_template_decl
= true;
10083 else if (TREE_CODE (friend_type
) == TYPENAME_TYPE
10084 || TREE_CODE (friend_type
) == TEMPLATE_TYPE_PARM
)
10086 /* This could be either
10090 when dependent_type_p is false or
10092 template <class U> friend class T::C;
10095 friend_type
= tsubst (friend_type
, args
,
10096 tf_warning_or_error
, NULL_TREE
);
10097 /* Bump processing_template_decl for correct
10098 dependent_type_p calculation. */
10099 ++processing_template_decl
;
10100 if (dependent_type_p (friend_type
))
10101 adjust_processing_template_decl
= true;
10102 --processing_template_decl
;
10104 else if (!CLASSTYPE_USE_TEMPLATE (friend_type
)
10105 && hidden_name_p (TYPE_NAME (friend_type
)))
10109 where C hasn't been declared yet. Let's lookup name
10110 from namespace scope directly, bypassing any name that
10111 come from dependent base class. */
10112 tree ns
= decl_namespace_context (TYPE_MAIN_DECL (friend_type
));
10114 /* The call to xref_tag_from_type does injection for friend
10116 push_nested_namespace (ns
);
10118 xref_tag_from_type (friend_type
, NULL_TREE
,
10119 /*tag_scope=*/ts_current
);
10120 pop_nested_namespace (ns
);
10122 else if (uses_template_parms (friend_type
))
10123 /* friend class C<T>; */
10124 friend_type
= tsubst (friend_type
, args
,
10125 tf_warning_or_error
, NULL_TREE
);
10130 where C is already declared or
10132 friend class C<int>;
10134 We don't have to do anything in these cases. */
10136 if (adjust_processing_template_decl
)
10137 /* Trick make_friend_class into realizing that the friend
10138 we're adding is a template, not an ordinary class. It's
10139 important that we use make_friend_class since it will
10140 perform some error-checking and output cross-reference
10142 ++processing_template_decl
;
10144 if (friend_type
!= error_mark_node
)
10145 make_friend_class (type
, friend_type
, /*complain=*/false);
10147 if (adjust_processing_template_decl
)
10148 --processing_template_decl
;
10152 /* Build new DECL_FRIENDLIST. */
10155 /* The file and line for this declaration, to
10156 assist in error message reporting. Since we
10157 called push_tinst_level above, we don't need to
10159 input_location
= DECL_SOURCE_LOCATION (t
);
10161 if (TREE_CODE (t
) == TEMPLATE_DECL
)
10163 ++processing_template_decl
;
10164 push_deferring_access_checks (dk_no_check
);
10167 r
= tsubst_friend_function (t
, args
);
10168 add_friend (type
, r
, /*complain=*/false);
10169 if (TREE_CODE (t
) == TEMPLATE_DECL
)
10171 pop_deferring_access_checks ();
10172 --processing_template_decl
;
10180 /* Restore these before substituting into the lambda capture
10182 cp_unevaluated_operand
= saved_unevaluated_operand
;
10183 c_inhibit_evaluation_warnings
= saved_inhibit_evaluation_warnings
;
10186 if (tree expr
= CLASSTYPE_LAMBDA_EXPR (type
))
10188 tree decl
= lambda_function (type
);
10191 if (!DECL_TEMPLATE_INFO (decl
)
10192 || DECL_TEMPLATE_RESULT (DECL_TI_TEMPLATE (decl
)) != decl
)
10193 instantiate_decl (decl
, false, false);
10195 /* We need to instantiate the capture list from the template
10196 after we've instantiated the closure members, but before we
10197 consider adding the conversion op. Also keep any captures
10198 that may have been added during instantiation of the op(). */
10199 tree tmpl_expr
= CLASSTYPE_LAMBDA_EXPR (pattern
);
10201 = tsubst_copy_and_build (LAMBDA_EXPR_CAPTURE_LIST (tmpl_expr
),
10202 args
, tf_warning_or_error
, NULL_TREE
,
10205 LAMBDA_EXPR_CAPTURE_LIST (expr
)
10206 = chainon (tmpl_cap
, nreverse (LAMBDA_EXPR_CAPTURE_LIST (expr
)));
10208 maybe_add_lambda_conv_op (type
);
10211 gcc_assert (errorcount
);
10214 /* Set the file and line number information to whatever is given for
10215 the class itself. This puts error messages involving generated
10216 implicit functions at a predictable point, and the same point
10217 that would be used for non-template classes. */
10218 input_location
= DECL_SOURCE_LOCATION (typedecl
);
10220 unreverse_member_declarations (type
);
10221 finish_struct_1 (type
);
10222 TYPE_BEING_DEFINED (type
) = 0;
10224 /* We don't instantiate default arguments for member functions. 14.7.1:
10226 The implicit instantiation of a class template specialization causes
10227 the implicit instantiation of the declarations, but not of the
10228 definitions or default arguments, of the class member functions,
10229 member classes, static data members and member templates.... */
10231 /* Some typedefs referenced from within the template code need to be access
10232 checked at template instantiation time, i.e now. These types were
10233 added to the template at parsing time. Let's get those and perform
10234 the access checks then. */
10235 perform_typedefs_access_check (pattern
, args
);
10236 perform_deferred_access_checks (tf_warning_or_error
);
10237 pop_nested_class ();
10238 maximum_field_alignment
= saved_maximum_field_alignment
;
10240 pop_from_top_level ();
10241 pop_deferring_access_checks ();
10242 pop_tinst_level ();
10244 /* The vtable for a template class can be emitted in any translation
10245 unit in which the class is instantiated. When there is no key
10246 method, however, finish_struct_1 will already have added TYPE to
10247 the keyed_classes list. */
10248 if (TYPE_CONTAINS_VPTR_P (type
) && CLASSTYPE_KEY_METHOD (type
))
10249 keyed_classes
= tree_cons (NULL_TREE
, type
, keyed_classes
);
10254 /* Wrapper for instantiate_class_template_1. */
10257 instantiate_class_template (tree type
)
10260 timevar_push (TV_TEMPLATE_INST
);
10261 ret
= instantiate_class_template_1 (type
);
10262 timevar_pop (TV_TEMPLATE_INST
);
10267 tsubst_template_arg (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
10273 else if (TYPE_P (t
))
10274 r
= tsubst (t
, args
, complain
, in_decl
);
10277 if (!(complain
& tf_warning
))
10278 ++c_inhibit_evaluation_warnings
;
10279 r
= tsubst_expr (t
, args
, complain
, in_decl
,
10280 /*integral_constant_expression_p=*/true);
10281 if (!(complain
& tf_warning
))
10282 --c_inhibit_evaluation_warnings
;
10287 /* Given a function parameter pack TMPL_PARM and some function parameters
10288 instantiated from it at *SPEC_P, return a NONTYPE_ARGUMENT_PACK of them
10289 and set *SPEC_P to point at the next point in the list. */
10292 extract_fnparm_pack (tree tmpl_parm
, tree
*spec_p
)
10294 /* Collect all of the extra "packed" parameters into an
10298 tree argpack
= make_node (NONTYPE_ARGUMENT_PACK
);
10299 tree argtypepack
= cxx_make_type (TYPE_ARGUMENT_PACK
);
10300 tree spec_parm
= *spec_p
;
10303 for (len
= 0; spec_parm
; ++len
, spec_parm
= TREE_CHAIN (spec_parm
))
10305 && !function_parameter_expanded_from_pack_p (spec_parm
, tmpl_parm
))
10308 /* Fill in PARMVEC and PARMTYPEVEC with all of the parameters. */
10309 parmvec
= make_tree_vec (len
);
10310 parmtypevec
= make_tree_vec (len
);
10311 spec_parm
= *spec_p
;
10312 for (i
= 0; i
< len
; i
++, spec_parm
= DECL_CHAIN (spec_parm
))
10314 TREE_VEC_ELT (parmvec
, i
) = spec_parm
;
10315 TREE_VEC_ELT (parmtypevec
, i
) = TREE_TYPE (spec_parm
);
10318 /* Build the argument packs. */
10319 SET_ARGUMENT_PACK_ARGS (argpack
, parmvec
);
10320 SET_ARGUMENT_PACK_ARGS (argtypepack
, parmtypevec
);
10321 TREE_TYPE (argpack
) = argtypepack
;
10322 *spec_p
= spec_parm
;
10327 /* Give a chain SPEC_PARM of PARM_DECLs, pack them into a
10328 NONTYPE_ARGUMENT_PACK. */
10331 make_fnparm_pack (tree spec_parm
)
10333 return extract_fnparm_pack (NULL_TREE
, &spec_parm
);
10336 /* Return 1 if the Ith element of the argument pack ARG_PACK is a
10337 pack expansion with no extra args, 2 if it has extra args, or 0
10338 if it is not a pack expansion. */
10341 argument_pack_element_is_expansion_p (tree arg_pack
, int i
)
10343 tree vec
= ARGUMENT_PACK_ARGS (arg_pack
);
10344 if (i
>= TREE_VEC_LENGTH (vec
))
10346 tree elt
= TREE_VEC_ELT (vec
, i
);
10348 /* A decl pack is itself an expansion. */
10349 elt
= TREE_TYPE (elt
);
10350 if (!PACK_EXPANSION_P (elt
))
10352 if (PACK_EXPANSION_EXTRA_ARGS (elt
))
10358 /* Creates and return an ARGUMENT_PACK_SELECT tree node. */
10361 make_argument_pack_select (tree arg_pack
, unsigned index
)
10363 tree aps
= make_node (ARGUMENT_PACK_SELECT
);
10365 ARGUMENT_PACK_SELECT_FROM_PACK (aps
) = arg_pack
;
10366 ARGUMENT_PACK_SELECT_INDEX (aps
) = index
;
10371 /* This is a subroutine of tsubst_pack_expansion.
10373 It returns TRUE if we need to use the PACK_EXPANSION_EXTRA_ARGS
10374 mechanism to store the (non complete list of) arguments of the
10375 substitution and return a non substituted pack expansion, in order
10376 to wait for when we have enough arguments to really perform the
10380 use_pack_expansion_extra_args_p (tree parm_packs
,
10382 bool has_empty_arg
)
10384 /* If one pack has an expansion and another pack has a normal
10385 argument or if one pack has an empty argument and an another
10386 one hasn't then tsubst_pack_expansion cannot perform the
10387 substitution and need to fall back on the
10388 PACK_EXPANSION_EXTRA mechanism. */
10389 if (parm_packs
== NULL_TREE
)
10391 else if (has_empty_arg
)
10394 bool has_expansion_arg
= false;
10395 for (int i
= 0 ; i
< arg_pack_len
; ++i
)
10397 bool has_non_expansion_arg
= false;
10398 for (tree parm_pack
= parm_packs
;
10400 parm_pack
= TREE_CHAIN (parm_pack
))
10402 tree arg
= TREE_VALUE (parm_pack
);
10404 int exp
= argument_pack_element_is_expansion_p (arg
, i
);
10406 /* We can't substitute a pack expansion with extra args into
10410 has_expansion_arg
= true;
10412 has_non_expansion_arg
= true;
10415 if (has_expansion_arg
&& has_non_expansion_arg
)
10421 /* [temp.variadic]/6 says that:
10423 The instantiation of a pack expansion [...]
10424 produces a list E1,E2, ..., En, where N is the number of elements
10425 in the pack expansion parameters.
10427 This subroutine of tsubst_pack_expansion produces one of these Ei.
10429 PATTERN is the pattern of the pack expansion. PARM_PACKS is a
10430 TREE_LIST in which each TREE_PURPOSE is a parameter pack of
10431 PATTERN, and each TREE_VALUE is its corresponding argument pack.
10432 INDEX is the index 'i' of the element Ei to produce. ARGS,
10433 COMPLAIN, and IN_DECL are the same parameters as for the
10434 tsubst_pack_expansion function.
10436 The function returns the resulting Ei upon successful completion,
10437 or error_mark_node.
10439 Note that this function possibly modifies the ARGS parameter, so
10440 it's the responsibility of the caller to restore it. */
10443 gen_elem_of_pack_expansion_instantiation (tree pattern
,
10446 tree args
/* This parm gets
10448 tsubst_flags_t complain
,
10452 bool ith_elem_is_expansion
= false;
10454 /* For each parameter pack, change the substitution of the parameter
10455 pack to the ith argument in its argument pack, then expand the
10457 for (tree pack
= parm_packs
; pack
; pack
= TREE_CHAIN (pack
))
10459 tree parm
= TREE_PURPOSE (pack
);
10460 tree arg_pack
= TREE_VALUE (pack
);
10461 tree aps
; /* instance of ARGUMENT_PACK_SELECT. */
10463 ith_elem_is_expansion
|=
10464 argument_pack_element_is_expansion_p (arg_pack
, index
);
10466 /* Select the Ith argument from the pack. */
10467 if (TREE_CODE (parm
) == PARM_DECL
10468 || TREE_CODE (parm
) == FIELD_DECL
)
10472 aps
= make_argument_pack_select (arg_pack
, index
);
10473 if (!mark_used (parm
, complain
) && !(complain
& tf_error
))
10474 return error_mark_node
;
10475 register_local_specialization (aps
, parm
);
10478 aps
= retrieve_local_specialization (parm
);
10483 template_parm_level_and_index (parm
, &level
, &idx
);
10487 aps
= make_argument_pack_select (arg_pack
, index
);
10488 /* Update the corresponding argument. */
10489 TMPL_ARG (args
, level
, idx
) = aps
;
10492 /* Re-use the ARGUMENT_PACK_SELECT. */
10493 aps
= TMPL_ARG (args
, level
, idx
);
10495 ARGUMENT_PACK_SELECT_INDEX (aps
) = index
;
10498 /* Substitute into the PATTERN with the (possibly altered)
10500 if (pattern
== in_decl
)
10501 /* Expanding a fixed parameter pack from
10502 coerce_template_parameter_pack. */
10503 t
= tsubst_decl (pattern
, args
, complain
);
10504 else if (pattern
== error_mark_node
)
10505 t
= error_mark_node
;
10506 else if (constraint_p (pattern
))
10508 if (processing_template_decl
)
10509 t
= tsubst_constraint (pattern
, args
, complain
, in_decl
);
10511 t
= (constraints_satisfied_p (pattern
, args
)
10512 ? boolean_true_node
: boolean_false_node
);
10514 else if (!TYPE_P (pattern
))
10515 t
= tsubst_expr (pattern
, args
, complain
, in_decl
,
10516 /*integral_constant_expression_p=*/false);
10518 t
= tsubst (pattern
, args
, complain
, in_decl
);
10520 /* If the Ith argument pack element is a pack expansion, then
10521 the Ith element resulting from the substituting is going to
10522 be a pack expansion as well. */
10523 if (ith_elem_is_expansion
)
10524 t
= make_pack_expansion (t
);
10529 /* When the unexpanded parameter pack in a fold expression expands to an empty
10530 sequence, the value of the expression is as follows; the program is
10531 ill-formed if the operator is not listed in this table.
10542 expand_empty_fold (tree t
, tsubst_flags_t complain
)
10544 tree_code code
= (tree_code
)TREE_INT_CST_LOW (TREE_OPERAND (t
, 0));
10545 if (!FOLD_EXPR_MODIFY_P (t
))
10549 return integer_one_node
;
10551 return integer_zero_node
;
10553 return integer_minus_one_node
;
10555 return integer_zero_node
;
10556 case TRUTH_ANDIF_EXPR
:
10557 return boolean_true_node
;
10558 case TRUTH_ORIF_EXPR
:
10559 return boolean_false_node
;
10560 case COMPOUND_EXPR
:
10566 if (complain
& tf_error
)
10567 error_at (location_of (t
),
10568 "fold of empty expansion over %O", code
);
10569 return error_mark_node
;
10572 /* Given a fold-expression T and a current LEFT and RIGHT operand,
10573 form an expression that combines the two terms using the
10577 fold_expression (tree t
, tree left
, tree right
, tsubst_flags_t complain
)
10579 tree op
= FOLD_EXPR_OP (t
);
10580 tree_code code
= (tree_code
)TREE_INT_CST_LOW (op
);
10582 // Handle compound assignment operators.
10583 if (FOLD_EXPR_MODIFY_P (t
))
10584 return build_x_modify_expr (input_location
, left
, code
, right
, complain
);
10588 case COMPOUND_EXPR
:
10589 return build_x_compound_expr (input_location
, left
, right
, complain
);
10591 return build_m_component_ref (left
, right
, complain
);
10593 return build_x_binary_op (input_location
, code
,
10594 left
, TREE_CODE (left
),
10595 right
, TREE_CODE (right
),
10601 /* Substitute ARGS into the pack of a fold expression T. */
10604 tsubst_fold_expr_pack (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
10606 return tsubst_pack_expansion (FOLD_EXPR_PACK (t
), args
, complain
, in_decl
);
10609 /* Substitute ARGS into the pack of a fold expression T. */
10612 tsubst_fold_expr_init (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
10614 return tsubst_expr (FOLD_EXPR_INIT (t
), args
, complain
, in_decl
, false);
10617 /* Expand a PACK of arguments into a grouped as left fold.
10618 Given a pack containing elements A0, A1, ..., An and an
10619 operator @, this builds the expression:
10621 ((A0 @ A1) @ A2) ... @ An
10623 Note that PACK must not be empty.
10625 The operator is defined by the original fold expression T. */
10628 expand_left_fold (tree t
, tree pack
, tsubst_flags_t complain
)
10630 tree left
= TREE_VEC_ELT (pack
, 0);
10631 for (int i
= 1; i
< TREE_VEC_LENGTH (pack
); ++i
)
10633 tree right
= TREE_VEC_ELT (pack
, i
);
10634 left
= fold_expression (t
, left
, right
, complain
);
10639 /* Substitute into a unary left fold expression. */
10642 tsubst_unary_left_fold (tree t
, tree args
, tsubst_flags_t complain
,
10645 tree pack
= tsubst_fold_expr_pack (t
, args
, complain
, in_decl
);
10646 if (pack
== error_mark_node
)
10647 return error_mark_node
;
10648 if (TREE_VEC_LENGTH (pack
) == 0)
10649 return expand_empty_fold (t
, complain
);
10651 return expand_left_fold (t
, pack
, complain
);
10654 /* Substitute into a binary left fold expression.
10656 Do ths by building a single (non-empty) vector of argumnts and
10657 building the expression from those elements. */
10660 tsubst_binary_left_fold (tree t
, tree args
, tsubst_flags_t complain
,
10663 tree pack
= tsubst_fold_expr_pack (t
, args
, complain
, in_decl
);
10664 if (pack
== error_mark_node
)
10665 return error_mark_node
;
10666 tree init
= tsubst_fold_expr_init (t
, args
, complain
, in_decl
);
10667 if (init
== error_mark_node
)
10668 return error_mark_node
;
10670 tree vec
= make_tree_vec (TREE_VEC_LENGTH (pack
) + 1);
10671 TREE_VEC_ELT (vec
, 0) = init
;
10672 for (int i
= 0; i
< TREE_VEC_LENGTH (pack
); ++i
)
10673 TREE_VEC_ELT (vec
, i
+ 1) = TREE_VEC_ELT (pack
, i
);
10675 return expand_left_fold (t
, vec
, complain
);
10678 /* Expand a PACK of arguments into a grouped as right fold.
10679 Given a pack containing elementns A0, A1, ..., and an
10680 operator @, this builds the expression:
10682 A0@ ... (An-2 @ (An-1 @ An))
10684 Note that PACK must not be empty.
10686 The operator is defined by the original fold expression T. */
10689 expand_right_fold (tree t
, tree pack
, tsubst_flags_t complain
)
10691 // Build the expression.
10692 int n
= TREE_VEC_LENGTH (pack
);
10693 tree right
= TREE_VEC_ELT (pack
, n
- 1);
10694 for (--n
; n
!= 0; --n
)
10696 tree left
= TREE_VEC_ELT (pack
, n
- 1);
10697 right
= fold_expression (t
, left
, right
, complain
);
10702 /* Substitute into a unary right fold expression. */
10705 tsubst_unary_right_fold (tree t
, tree args
, tsubst_flags_t complain
,
10708 tree pack
= tsubst_fold_expr_pack (t
, args
, complain
, in_decl
);
10709 if (pack
== error_mark_node
)
10710 return error_mark_node
;
10711 if (TREE_VEC_LENGTH (pack
) == 0)
10712 return expand_empty_fold (t
, complain
);
10714 return expand_right_fold (t
, pack
, complain
);
10717 /* Substitute into a binary right fold expression.
10719 Do ths by building a single (non-empty) vector of arguments and
10720 building the expression from those elements. */
10723 tsubst_binary_right_fold (tree t
, tree args
, tsubst_flags_t complain
,
10726 tree pack
= tsubst_fold_expr_pack (t
, args
, complain
, in_decl
);
10727 if (pack
== error_mark_node
)
10728 return error_mark_node
;
10729 tree init
= tsubst_fold_expr_init (t
, args
, complain
, in_decl
);
10730 if (init
== error_mark_node
)
10731 return error_mark_node
;
10733 int n
= TREE_VEC_LENGTH (pack
);
10734 tree vec
= make_tree_vec (n
+ 1);
10735 for (int i
= 0; i
< n
; ++i
)
10736 TREE_VEC_ELT (vec
, i
) = TREE_VEC_ELT (pack
, i
);
10737 TREE_VEC_ELT (vec
, n
) = init
;
10739 return expand_right_fold (t
, vec
, complain
);
10743 /* Substitute ARGS into T, which is an pack expansion
10744 (i.e. TYPE_PACK_EXPANSION or EXPR_PACK_EXPANSION). Returns a
10745 TREE_VEC with the substituted arguments, a PACK_EXPANSION_* node
10746 (if only a partial substitution could be performed) or
10747 ERROR_MARK_NODE if there was an error. */
10749 tsubst_pack_expansion (tree t
, tree args
, tsubst_flags_t complain
,
10753 tree pack
, packs
= NULL_TREE
;
10754 bool unsubstituted_packs
= false;
10757 hash_map
<tree
, tree
> *saved_local_specializations
= NULL
;
10758 bool need_local_specializations
= false;
10761 gcc_assert (PACK_EXPANSION_P (t
));
10762 pattern
= PACK_EXPANSION_PATTERN (t
);
10764 /* Add in any args remembered from an earlier partial instantiation. */
10765 args
= add_to_template_args (PACK_EXPANSION_EXTRA_ARGS (t
), args
);
10767 levels
= TMPL_ARGS_DEPTH (args
);
10769 /* Determine the argument packs that will instantiate the parameter
10770 packs used in the expansion expression. While we're at it,
10771 compute the number of arguments to be expanded and make sure it
10773 for (pack
= PACK_EXPANSION_PARAMETER_PACKS (t
); pack
;
10774 pack
= TREE_CHAIN (pack
))
10776 tree parm_pack
= TREE_VALUE (pack
);
10777 tree arg_pack
= NULL_TREE
;
10778 tree orig_arg
= NULL_TREE
;
10781 if (TREE_CODE (parm_pack
) == BASES
)
10783 if (BASES_DIRECT (parm_pack
))
10784 return calculate_direct_bases (tsubst_expr (BASES_TYPE (parm_pack
),
10785 args
, complain
, in_decl
, false));
10787 return calculate_bases (tsubst_expr (BASES_TYPE (parm_pack
),
10788 args
, complain
, in_decl
, false));
10790 if (TREE_CODE (parm_pack
) == PARM_DECL
)
10792 /* We know we have correct local_specializations if this
10793 expansion is at function scope, or if we're dealing with a
10794 local parameter in a requires expression; for the latter,
10795 tsubst_requires_expr set it up appropriately. */
10796 if (PACK_EXPANSION_LOCAL_P (t
) || CONSTRAINT_VAR_P (parm_pack
))
10797 arg_pack
= retrieve_local_specialization (parm_pack
);
10800 /* We can't rely on local_specializations for a parameter
10801 name used later in a function declaration (such as in a
10802 late-specified return type). Even if it exists, it might
10803 have the wrong value for a recursive call. Just make a
10804 dummy decl, since it's only used for its type. */
10805 arg_pack
= tsubst_decl (parm_pack
, args
, complain
);
10806 if (arg_pack
&& DECL_PACK_P (arg_pack
))
10807 /* Partial instantiation of the parm_pack, we can't build
10808 up an argument pack yet. */
10809 arg_pack
= NULL_TREE
;
10811 arg_pack
= make_fnparm_pack (arg_pack
);
10812 need_local_specializations
= true;
10815 else if (TREE_CODE (parm_pack
) == FIELD_DECL
)
10816 arg_pack
= tsubst_copy (parm_pack
, args
, complain
, in_decl
);
10820 template_parm_level_and_index (parm_pack
, &level
, &idx
);
10822 if (level
<= levels
)
10823 arg_pack
= TMPL_ARG (args
, level
, idx
);
10826 orig_arg
= arg_pack
;
10827 if (arg_pack
&& TREE_CODE (arg_pack
) == ARGUMENT_PACK_SELECT
)
10828 arg_pack
= ARGUMENT_PACK_SELECT_FROM_PACK (arg_pack
);
10830 if (arg_pack
&& !ARGUMENT_PACK_P (arg_pack
))
10831 /* This can only happen if we forget to expand an argument
10832 pack somewhere else. Just return an error, silently. */
10834 result
= make_tree_vec (1);
10835 TREE_VEC_ELT (result
, 0) = error_mark_node
;
10842 TREE_VEC_LENGTH (ARGUMENT_PACK_ARGS (arg_pack
));
10844 /* Don't bother trying to do a partial substitution with
10845 incomplete packs; we'll try again after deduction. */
10846 if (ARGUMENT_PACK_INCOMPLETE_P (arg_pack
))
10851 else if (len
!= my_len
)
10853 if (!(complain
& tf_error
))
10854 /* Fail quietly. */;
10855 else if (TREE_CODE (t
) == TYPE_PACK_EXPANSION
)
10856 error ("mismatched argument pack lengths while expanding "
10860 error ("mismatched argument pack lengths while expanding "
10863 return error_mark_node
;
10866 /* Keep track of the parameter packs and their corresponding
10868 packs
= tree_cons (parm_pack
, arg_pack
, packs
);
10869 TREE_TYPE (packs
) = orig_arg
;
10873 /* We can't substitute for this parameter pack. We use a flag as
10874 well as the missing_level counter because function parameter
10875 packs don't have a level. */
10876 unsubstituted_packs
= true;
10880 /* If the expansion is just T..., return the matching argument pack. */
10881 if (!unsubstituted_packs
10882 && TREE_PURPOSE (packs
) == pattern
)
10884 tree args
= ARGUMENT_PACK_ARGS (TREE_VALUE (packs
));
10885 if (TREE_CODE (t
) == TYPE_PACK_EXPANSION
10886 || pack_expansion_args_count (args
))
10888 /* Otherwise use the normal path so we get convert_from_reference. */
10891 /* We cannot expand this expansion expression, because we don't have
10892 all of the argument packs we need. */
10893 if (use_pack_expansion_extra_args_p (packs
, len
, unsubstituted_packs
))
10895 /* We got some full packs, but we can't substitute them in until we
10896 have values for all the packs. So remember these until then. */
10898 t
= make_pack_expansion (pattern
);
10899 PACK_EXPANSION_EXTRA_ARGS (t
) = args
;
10902 else if (unsubstituted_packs
)
10904 /* There were no real arguments, we're just replacing a parameter
10905 pack with another version of itself. Substitute into the
10906 pattern and return a PACK_EXPANSION_*. The caller will need to
10908 if (TREE_CODE (t
) == EXPR_PACK_EXPANSION
)
10909 t
= tsubst_expr (pattern
, args
, complain
, in_decl
,
10910 /*integral_constant_expression_p=*/false);
10912 t
= tsubst (pattern
, args
, complain
, in_decl
);
10913 t
= make_pack_expansion (t
);
10917 gcc_assert (len
>= 0);
10919 if (need_local_specializations
)
10921 /* We're in a late-specified return type, so create our own local
10922 specializations map; the current map is either NULL or (in the
10923 case of recursive unification) might have bindings that we don't
10924 want to use or alter. */
10925 saved_local_specializations
= local_specializations
;
10926 local_specializations
= new hash_map
<tree
, tree
>;
10929 /* For each argument in each argument pack, substitute into the
10931 result
= make_tree_vec (len
);
10932 for (i
= 0; i
< len
; ++i
)
10934 t
= gen_elem_of_pack_expansion_instantiation (pattern
, packs
,
10938 TREE_VEC_ELT (result
, i
) = t
;
10939 if (t
== error_mark_node
)
10941 result
= error_mark_node
;
10946 /* Update ARGS to restore the substitution from parameter packs to
10947 their argument packs. */
10948 for (pack
= packs
; pack
; pack
= TREE_CHAIN (pack
))
10950 tree parm
= TREE_PURPOSE (pack
);
10952 if (TREE_CODE (parm
) == PARM_DECL
10953 || TREE_CODE (parm
) == FIELD_DECL
)
10954 register_local_specialization (TREE_TYPE (pack
), parm
);
10959 if (TREE_VALUE (pack
) == NULL_TREE
)
10962 template_parm_level_and_index (parm
, &level
, &idx
);
10964 /* Update the corresponding argument. */
10965 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (args
))
10966 TREE_VEC_ELT (TREE_VEC_ELT (args
, level
-1 ), idx
) =
10969 TREE_VEC_ELT (args
, idx
) = TREE_TYPE (pack
);
10973 if (need_local_specializations
)
10975 delete local_specializations
;
10976 local_specializations
= saved_local_specializations
;
10982 /* Given PARM_DECL PARM, find the corresponding PARM_DECL in the template
10983 TMPL. We do this using DECL_PARM_INDEX, which should work even with
10984 parameter packs; all parms generated from a function parameter pack will
10985 have the same DECL_PARM_INDEX. */
10988 get_pattern_parm (tree parm
, tree tmpl
)
10990 tree pattern
= DECL_TEMPLATE_RESULT (tmpl
);
10993 if (DECL_ARTIFICIAL (parm
))
10995 for (patparm
= DECL_ARGUMENTS (pattern
);
10996 patparm
; patparm
= DECL_CHAIN (patparm
))
10997 if (DECL_ARTIFICIAL (patparm
)
10998 && DECL_NAME (parm
) == DECL_NAME (patparm
))
11003 patparm
= FUNCTION_FIRST_USER_PARM (DECL_TEMPLATE_RESULT (tmpl
));
11004 patparm
= chain_index (DECL_PARM_INDEX (parm
)-1, patparm
);
11005 gcc_assert (DECL_PARM_INDEX (patparm
)
11006 == DECL_PARM_INDEX (parm
));
11012 /* Substitute ARGS into the vector or list of template arguments T. */
11015 tsubst_template_args (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
11018 int len
, need_new
= 0, i
, expanded_len_adjust
= 0, out
;
11021 if (t
== error_mark_node
)
11022 return error_mark_node
;
11024 len
= TREE_VEC_LENGTH (t
);
11025 elts
= XALLOCAVEC (tree
, len
);
11027 for (i
= 0; i
< len
; i
++)
11029 tree orig_arg
= TREE_VEC_ELT (t
, i
);
11032 if (TREE_CODE (orig_arg
) == TREE_VEC
)
11033 new_arg
= tsubst_template_args (orig_arg
, args
, complain
, in_decl
);
11034 else if (PACK_EXPANSION_P (orig_arg
))
11036 /* Substitute into an expansion expression. */
11037 new_arg
= tsubst_pack_expansion (orig_arg
, args
, complain
, in_decl
);
11039 if (TREE_CODE (new_arg
) == TREE_VEC
)
11040 /* Add to the expanded length adjustment the number of
11041 expanded arguments. We subtract one from this
11042 measurement, because the argument pack expression
11043 itself is already counted as 1 in
11044 LEN. EXPANDED_LEN_ADJUST can actually be negative, if
11045 the argument pack is empty. */
11046 expanded_len_adjust
+= TREE_VEC_LENGTH (new_arg
) - 1;
11048 else if (ARGUMENT_PACK_P (orig_arg
))
11050 /* Substitute into each of the arguments. */
11051 new_arg
= TYPE_P (orig_arg
)
11052 ? cxx_make_type (TREE_CODE (orig_arg
))
11053 : make_node (TREE_CODE (orig_arg
));
11055 SET_ARGUMENT_PACK_ARGS (
11057 tsubst_template_args (ARGUMENT_PACK_ARGS (orig_arg
),
11058 args
, complain
, in_decl
));
11060 if (ARGUMENT_PACK_ARGS (new_arg
) == error_mark_node
)
11061 new_arg
= error_mark_node
;
11063 if (TREE_CODE (new_arg
) == NONTYPE_ARGUMENT_PACK
) {
11064 TREE_TYPE (new_arg
) = tsubst (TREE_TYPE (orig_arg
), args
,
11065 complain
, in_decl
);
11066 TREE_CONSTANT (new_arg
) = TREE_CONSTANT (orig_arg
);
11068 if (TREE_TYPE (new_arg
) == error_mark_node
)
11069 new_arg
= error_mark_node
;
11073 new_arg
= tsubst_template_arg (orig_arg
, args
, complain
, in_decl
);
11075 if (new_arg
== error_mark_node
)
11076 return error_mark_node
;
11079 if (new_arg
!= orig_arg
)
11086 /* Make space for the expanded arguments coming from template
11088 t
= make_tree_vec (len
+ expanded_len_adjust
);
11089 /* ORIG_T can contain TREE_VECs. That happens if ORIG_T contains the
11090 arguments for a member template.
11091 In that case each TREE_VEC in ORIG_T represents a level of template
11092 arguments, and ORIG_T won't carry any non defaulted argument count.
11093 It will rather be the nested TREE_VECs that will carry one.
11094 In other words, ORIG_T carries a non defaulted argument count only
11095 if it doesn't contain any nested TREE_VEC. */
11096 if (NON_DEFAULT_TEMPLATE_ARGS_COUNT (orig_t
))
11098 int count
= GET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (orig_t
);
11099 count
+= expanded_len_adjust
;
11100 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (t
, count
);
11102 for (i
= 0, out
= 0; i
< len
; i
++)
11104 if ((PACK_EXPANSION_P (TREE_VEC_ELT (orig_t
, i
))
11105 || ARGUMENT_PACK_P (TREE_VEC_ELT (orig_t
, i
)))
11106 && TREE_CODE (elts
[i
]) == TREE_VEC
)
11110 /* Now expand the template argument pack "in place". */
11111 for (idx
= 0; idx
< TREE_VEC_LENGTH (elts
[i
]); idx
++, out
++)
11112 TREE_VEC_ELT (t
, out
) = TREE_VEC_ELT (elts
[i
], idx
);
11116 TREE_VEC_ELT (t
, out
) = elts
[i
];
11124 /* Return the result of substituting ARGS into the template parameters
11125 given by PARMS. If there are m levels of ARGS and m + n levels of
11126 PARMS, then the result will contain n levels of PARMS. For
11127 example, if PARMS is `template <class T> template <class U>
11128 template <T*, U, class V>' and ARGS is {{int}, {double}} then the
11129 result will be `template <int*, double, class V>'. */
11132 tsubst_template_parms (tree parms
, tree args
, tsubst_flags_t complain
)
11134 tree r
= NULL_TREE
;
11137 /* When substituting into a template, we must set
11138 PROCESSING_TEMPLATE_DECL as the template parameters may be
11139 dependent if they are based on one-another, and the dependency
11140 predicates are short-circuit outside of templates. */
11141 ++processing_template_decl
;
11143 for (new_parms
= &r
;
11144 parms
&& TMPL_PARMS_DEPTH (parms
) > TMPL_ARGS_DEPTH (args
);
11145 new_parms
= &(TREE_CHAIN (*new_parms
)),
11146 parms
= TREE_CHAIN (parms
))
11149 make_tree_vec (TREE_VEC_LENGTH (TREE_VALUE (parms
)));
11152 for (i
= 0; i
< TREE_VEC_LENGTH (new_vec
); ++i
)
11156 if (parms
== error_mark_node
)
11159 tuple
= TREE_VEC_ELT (TREE_VALUE (parms
), i
);
11161 if (tuple
== error_mark_node
)
11164 TREE_VEC_ELT (new_vec
, i
) =
11165 tsubst_template_parm (tuple
, args
, complain
);
11169 tree_cons (size_int (TMPL_PARMS_DEPTH (parms
)
11170 - TMPL_ARGS_DEPTH (args
)),
11171 new_vec
, NULL_TREE
);
11174 --processing_template_decl
;
11179 /* Return the result of substituting ARGS into one template parameter
11180 given by T. T Must be a TREE_LIST which TREE_VALUE is the template
11181 parameter and which TREE_PURPOSE is the default argument of the
11182 template parameter. */
11185 tsubst_template_parm (tree t
, tree args
, tsubst_flags_t complain
)
11187 tree default_value
, parm_decl
;
11189 if (args
== NULL_TREE
11191 || t
== error_mark_node
)
11194 gcc_assert (TREE_CODE (t
) == TREE_LIST
);
11196 default_value
= TREE_PURPOSE (t
);
11197 parm_decl
= TREE_VALUE (t
);
11199 parm_decl
= tsubst (parm_decl
, args
, complain
, NULL_TREE
);
11200 if (TREE_CODE (parm_decl
) == PARM_DECL
11201 && invalid_nontype_parm_type_p (TREE_TYPE (parm_decl
), complain
))
11202 parm_decl
= error_mark_node
;
11203 default_value
= tsubst_template_arg (default_value
, args
,
11204 complain
, NULL_TREE
);
11206 return build_tree_list (default_value
, parm_decl
);
11209 /* Substitute the ARGS into the indicated aggregate (or enumeration)
11210 type T. If T is not an aggregate or enumeration type, it is
11211 handled as if by tsubst. IN_DECL is as for tsubst. If
11212 ENTERING_SCOPE is nonzero, T is the context for a template which
11213 we are presently tsubst'ing. Return the substituted value. */
11216 tsubst_aggr_type (tree t
,
11218 tsubst_flags_t complain
,
11220 int entering_scope
)
11222 if (t
== NULL_TREE
)
11225 switch (TREE_CODE (t
))
11228 if (TYPE_PTRMEMFUNC_P (t
))
11229 return tsubst (TYPE_PTRMEMFUNC_FN_TYPE (t
), args
, complain
, in_decl
);
11231 /* Else fall through. */
11232 case ENUMERAL_TYPE
:
11234 if (TYPE_TEMPLATE_INFO (t
) && uses_template_parms (t
))
11239 int saved_unevaluated_operand
;
11240 int saved_inhibit_evaluation_warnings
;
11242 /* In "sizeof(X<I>)" we need to evaluate "I". */
11243 saved_unevaluated_operand
= cp_unevaluated_operand
;
11244 cp_unevaluated_operand
= 0;
11245 saved_inhibit_evaluation_warnings
= c_inhibit_evaluation_warnings
;
11246 c_inhibit_evaluation_warnings
= 0;
11248 /* First, determine the context for the type we are looking
11250 context
= TYPE_CONTEXT (t
);
11251 if (context
&& TYPE_P (context
))
11253 context
= tsubst_aggr_type (context
, args
, complain
,
11254 in_decl
, /*entering_scope=*/1);
11255 /* If context is a nested class inside a class template,
11256 it may still need to be instantiated (c++/33959). */
11257 context
= complete_type (context
);
11260 /* Then, figure out what arguments are appropriate for the
11261 type we are trying to find. For example, given:
11263 template <class T> struct S;
11264 template <class T, class U> void f(T, U) { S<U> su; }
11266 and supposing that we are instantiating f<int, double>,
11267 then our ARGS will be {int, double}, but, when looking up
11268 S we only want {double}. */
11269 argvec
= tsubst_template_args (TYPE_TI_ARGS (t
), args
,
11270 complain
, in_decl
);
11271 if (argvec
== error_mark_node
)
11272 r
= error_mark_node
;
11275 r
= lookup_template_class (t
, argvec
, in_decl
, context
,
11276 entering_scope
, complain
);
11277 r
= cp_build_qualified_type_real (r
, cp_type_quals (t
), complain
);
11280 cp_unevaluated_operand
= saved_unevaluated_operand
;
11281 c_inhibit_evaluation_warnings
= saved_inhibit_evaluation_warnings
;
11286 /* This is not a template type, so there's nothing to do. */
11290 return tsubst (t
, args
, complain
, in_decl
);
11294 /* Substitute into the default argument ARG (a default argument for
11295 FN), which has the indicated TYPE. */
11298 tsubst_default_argument (tree fn
, tree type
, tree arg
, tsubst_flags_t complain
)
11300 tree saved_class_ptr
= NULL_TREE
;
11301 tree saved_class_ref
= NULL_TREE
;
11302 int errs
= errorcount
+ sorrycount
;
11304 /* This can happen in invalid code. */
11305 if (TREE_CODE (arg
) == DEFAULT_ARG
)
11308 /* This default argument came from a template. Instantiate the
11309 default argument here, not in tsubst. In the case of
11318 we must be careful to do name lookup in the scope of S<T>,
11319 rather than in the current class. */
11320 push_access_scope (fn
);
11321 /* The "this" pointer is not valid in a default argument. */
11324 saved_class_ptr
= current_class_ptr
;
11325 cp_function_chain
->x_current_class_ptr
= NULL_TREE
;
11326 saved_class_ref
= current_class_ref
;
11327 cp_function_chain
->x_current_class_ref
= NULL_TREE
;
11330 push_deferring_access_checks(dk_no_deferred
);
11331 /* The default argument expression may cause implicitly defined
11332 member functions to be synthesized, which will result in garbage
11333 collection. We must treat this situation as if we were within
11334 the body of function so as to avoid collecting live data on the
11337 arg
= tsubst_expr (arg
, DECL_TI_ARGS (fn
),
11338 complain
, NULL_TREE
,
11339 /*integral_constant_expression_p=*/false);
11341 pop_deferring_access_checks();
11343 /* Restore the "this" pointer. */
11346 cp_function_chain
->x_current_class_ptr
= saved_class_ptr
;
11347 cp_function_chain
->x_current_class_ref
= saved_class_ref
;
11350 if (errorcount
+sorrycount
> errs
11351 && (complain
& tf_warning_or_error
))
11352 inform (input_location
,
11353 " when instantiating default argument for call to %D", fn
);
11355 /* Make sure the default argument is reasonable. */
11356 arg
= check_default_argument (type
, arg
, complain
);
11358 pop_access_scope (fn
);
11363 /* Substitute into all the default arguments for FN. */
11366 tsubst_default_arguments (tree fn
, tsubst_flags_t complain
)
11371 tmpl_args
= DECL_TI_ARGS (fn
);
11373 /* If this function is not yet instantiated, we certainly don't need
11374 its default arguments. */
11375 if (uses_template_parms (tmpl_args
))
11377 /* Don't do this again for clones. */
11378 if (DECL_CLONED_FUNCTION_P (fn
))
11381 for (arg
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
11383 arg
= TREE_CHAIN (arg
))
11384 if (TREE_PURPOSE (arg
))
11385 TREE_PURPOSE (arg
) = tsubst_default_argument (fn
,
11387 TREE_PURPOSE (arg
),
11391 /* Substitute the ARGS into the T, which is a _DECL. Return the
11392 result of the substitution. Issue error and warning messages under
11393 control of COMPLAIN. */
11396 tsubst_decl (tree t
, tree args
, tsubst_flags_t complain
)
11398 #define RETURN(EXP) do { r = (EXP); goto out; } while(0)
11399 location_t saved_loc
;
11400 tree r
= NULL_TREE
;
11402 hashval_t hash
= 0;
11404 /* Set the filename and linenumber to improve error-reporting. */
11405 saved_loc
= input_location
;
11406 input_location
= DECL_SOURCE_LOCATION (t
);
11408 switch (TREE_CODE (t
))
11410 case TEMPLATE_DECL
:
11412 /* We can get here when processing a member function template,
11413 member class template, or template template parameter. */
11414 tree decl
= DECL_TEMPLATE_RESULT (t
);
11419 if (DECL_TEMPLATE_TEMPLATE_PARM_P (t
))
11421 /* Template template parameter is treated here. */
11422 tree new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
11423 if (new_type
== error_mark_node
)
11424 r
= error_mark_node
;
11425 /* If we get a real template back, return it. This can happen in
11426 the context of most_specialized_partial_spec. */
11427 else if (TREE_CODE (new_type
) == TEMPLATE_DECL
)
11430 /* The new TEMPLATE_DECL was built in
11431 reduce_template_parm_level. */
11432 r
= TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL (new_type
);
11436 /* We might already have an instance of this template.
11437 The ARGS are for the surrounding class type, so the
11438 full args contain the tsubst'd args for the context,
11439 plus the innermost args from the template decl. */
11440 tmpl_args
= DECL_CLASS_TEMPLATE_P (t
)
11441 ? CLASSTYPE_TI_ARGS (TREE_TYPE (t
))
11442 : DECL_TI_ARGS (DECL_TEMPLATE_RESULT (t
));
11443 /* Because this is a template, the arguments will still be
11444 dependent, even after substitution. If
11445 PROCESSING_TEMPLATE_DECL is not set, the dependency
11446 predicates will short-circuit. */
11447 ++processing_template_decl
;
11448 full_args
= tsubst_template_args (tmpl_args
, args
,
11449 complain
, in_decl
);
11450 --processing_template_decl
;
11451 if (full_args
== error_mark_node
)
11452 RETURN (error_mark_node
);
11454 /* If this is a default template template argument,
11455 tsubst might not have changed anything. */
11456 if (full_args
== tmpl_args
)
11459 hash
= hash_tmpl_and_args (t
, full_args
);
11460 spec
= retrieve_specialization (t
, full_args
, hash
);
11461 if (spec
!= NULL_TREE
)
11467 /* Make a new template decl. It will be similar to the
11468 original, but will record the current template arguments.
11469 We also create a new function declaration, which is just
11470 like the old one, but points to this new template, rather
11471 than the old one. */
11473 gcc_assert (DECL_LANG_SPECIFIC (r
) != 0);
11474 DECL_CHAIN (r
) = NULL_TREE
;
11476 // Build new template info linking to the original template decl.
11477 DECL_TEMPLATE_INFO (r
) = build_template_info (t
, args
);
11479 if (TREE_CODE (decl
) == TYPE_DECL
11480 && !TYPE_DECL_ALIAS_P (decl
))
11483 ++processing_template_decl
;
11484 new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
11485 --processing_template_decl
;
11486 if (new_type
== error_mark_node
)
11487 RETURN (error_mark_node
);
11489 TREE_TYPE (r
) = new_type
;
11490 /* For a partial specialization, we need to keep pointing to
11491 the primary template. */
11492 if (!DECL_TEMPLATE_SPECIALIZATION (t
))
11493 CLASSTYPE_TI_TEMPLATE (new_type
) = r
;
11494 DECL_TEMPLATE_RESULT (r
) = TYPE_MAIN_DECL (new_type
);
11495 DECL_TI_ARGS (r
) = CLASSTYPE_TI_ARGS (new_type
);
11496 DECL_CONTEXT (r
) = TYPE_CONTEXT (new_type
);
11501 ++processing_template_decl
;
11502 new_decl
= tsubst (decl
, args
, complain
, in_decl
);
11503 --processing_template_decl
;
11504 if (new_decl
== error_mark_node
)
11505 RETURN (error_mark_node
);
11507 DECL_TEMPLATE_RESULT (r
) = new_decl
;
11508 DECL_TI_TEMPLATE (new_decl
) = r
;
11509 TREE_TYPE (r
) = TREE_TYPE (new_decl
);
11510 DECL_TI_ARGS (r
) = DECL_TI_ARGS (new_decl
);
11511 DECL_CONTEXT (r
) = DECL_CONTEXT (new_decl
);
11514 SET_DECL_IMPLICIT_INSTANTIATION (r
);
11515 DECL_TEMPLATE_INSTANTIATIONS (r
) = NULL_TREE
;
11516 DECL_TEMPLATE_SPECIALIZATIONS (r
) = NULL_TREE
;
11518 /* The template parameters for this new template are all the
11519 template parameters for the old template, except the
11520 outermost level of parameters. */
11521 DECL_TEMPLATE_PARMS (r
)
11522 = tsubst_template_parms (DECL_TEMPLATE_PARMS (t
), args
,
11525 if (PRIMARY_TEMPLATE_P (t
))
11526 DECL_PRIMARY_TEMPLATE (r
) = r
;
11528 if (TREE_CODE (decl
) != TYPE_DECL
&& !VAR_P (decl
))
11529 /* Record this non-type partial instantiation. */
11530 register_specialization (r
, t
,
11531 DECL_TI_ARGS (DECL_TEMPLATE_RESULT (r
)),
11536 case FUNCTION_DECL
:
11539 tree argvec
= NULL_TREE
;
11547 /* Nobody should be tsubst'ing into non-template functions. */
11548 gcc_assert (DECL_TEMPLATE_INFO (t
) != NULL_TREE
);
11550 if (TREE_CODE (DECL_TI_TEMPLATE (t
)) == TEMPLATE_DECL
)
11555 /* If T is not dependent, just return it. We have to
11556 increment PROCESSING_TEMPLATE_DECL because
11557 value_dependent_expression_p assumes that nothing is
11558 dependent when PROCESSING_TEMPLATE_DECL is zero. */
11559 ++processing_template_decl
;
11560 dependent_p
= value_dependent_expression_p (t
);
11561 --processing_template_decl
;
11565 /* Calculate the most general template of which R is a
11566 specialization, and the complete set of arguments used to
11568 gen_tmpl
= most_general_template (DECL_TI_TEMPLATE (t
));
11569 argvec
= tsubst_template_args (DECL_TI_ARGS
11570 (DECL_TEMPLATE_RESULT
11571 (DECL_TI_TEMPLATE (t
))),
11572 args
, complain
, in_decl
);
11573 if (argvec
== error_mark_node
)
11574 RETURN (error_mark_node
);
11576 /* Check to see if we already have this specialization. */
11577 hash
= hash_tmpl_and_args (gen_tmpl
, argvec
);
11578 spec
= retrieve_specialization (gen_tmpl
, argvec
, hash
);
11586 /* We can see more levels of arguments than parameters if
11587 there was a specialization of a member template, like
11590 template <class T> struct S { template <class U> void f(); }
11591 template <> template <class U> void S<int>::f(U);
11593 Here, we'll be substituting into the specialization,
11594 because that's where we can find the code we actually
11595 want to generate, but we'll have enough arguments for
11596 the most general template.
11598 We also deal with the peculiar case:
11600 template <class T> struct S {
11601 template <class U> friend void f();
11603 template <class U> void f() {}
11605 template void f<double>();
11607 Here, the ARGS for the instantiation of will be {int,
11608 double}. But, we only need as many ARGS as there are
11609 levels of template parameters in CODE_PATTERN. We are
11610 careful not to get fooled into reducing the ARGS in
11613 template <class T> struct S { template <class U> void f(U); }
11614 template <class T> template <> void S<T>::f(int) {}
11616 which we can spot because the pattern will be a
11617 specialization in this case. */
11618 args_depth
= TMPL_ARGS_DEPTH (args
);
11620 TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (DECL_TI_TEMPLATE (t
)));
11621 if (args_depth
> parms_depth
11622 && !DECL_TEMPLATE_SPECIALIZATION (t
))
11623 args
= get_innermost_template_args (args
, parms_depth
);
11627 /* This special case arises when we have something like this:
11629 template <class T> struct S {
11630 friend void f<int>(int, double);
11633 Here, the DECL_TI_TEMPLATE for the friend declaration
11634 will be an IDENTIFIER_NODE. We are being called from
11635 tsubst_friend_function, and we want only to create a
11636 new decl (R) with appropriate types so that we can call
11637 determine_specialization. */
11638 gen_tmpl
= NULL_TREE
;
11641 if (DECL_CLASS_SCOPE_P (t
))
11643 if (DECL_NAME (t
) == constructor_name (DECL_CONTEXT (t
)))
11647 ctx
= tsubst_aggr_type (DECL_CONTEXT (t
), args
,
11648 complain
, t
, /*entering_scope=*/1);
11653 ctx
= DECL_CONTEXT (t
);
11655 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
11656 if (type
== error_mark_node
)
11657 RETURN (error_mark_node
);
11659 /* If we hit excessive deduction depth, the type is bogus even if
11660 it isn't error_mark_node, so don't build a decl. */
11661 if (excessive_deduction_depth
)
11662 RETURN (error_mark_node
);
11664 /* We do NOT check for matching decls pushed separately at this
11665 point, as they may not represent instantiations of this
11666 template, and in any case are considered separate under the
11669 DECL_USE_TEMPLATE (r
) = 0;
11670 TREE_TYPE (r
) = type
;
11671 /* Clear out the mangled name and RTL for the instantiation. */
11672 SET_DECL_ASSEMBLER_NAME (r
, NULL_TREE
);
11673 SET_DECL_RTL (r
, NULL
);
11674 /* Leave DECL_INITIAL set on deleted instantiations. */
11675 if (!DECL_DELETED_FN (r
))
11676 DECL_INITIAL (r
) = NULL_TREE
;
11677 DECL_CONTEXT (r
) = ctx
;
11679 /* OpenMP UDRs have the only argument a reference to the declared
11680 type. We want to diagnose if the declared type is a reference,
11681 which is invalid, but as references to references are usually
11682 quietly merged, diagnose it here. */
11683 if (DECL_OMP_DECLARE_REDUCTION_P (t
))
11686 = TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (t
))));
11687 argtype
= tsubst (argtype
, args
, complain
, in_decl
);
11688 if (TREE_CODE (argtype
) == REFERENCE_TYPE
)
11689 error_at (DECL_SOURCE_LOCATION (t
),
11690 "reference type %qT in "
11691 "%<#pragma omp declare reduction%>", argtype
);
11692 if (strchr (IDENTIFIER_POINTER (DECL_NAME (t
)), '~') == NULL
)
11693 DECL_NAME (r
) = omp_reduction_id (ERROR_MARK
, DECL_NAME (t
),
11697 if (member
&& DECL_CONV_FN_P (r
))
11698 /* Type-conversion operator. Reconstruct the name, in
11699 case it's the name of one of the template's parameters. */
11700 DECL_NAME (r
) = mangle_conv_op_name_for_type (TREE_TYPE (type
));
11702 DECL_ARGUMENTS (r
) = tsubst (DECL_ARGUMENTS (t
), args
,
11704 DECL_RESULT (r
) = NULL_TREE
;
11706 TREE_STATIC (r
) = 0;
11707 TREE_PUBLIC (r
) = TREE_PUBLIC (t
);
11708 DECL_EXTERNAL (r
) = 1;
11709 /* If this is an instantiation of a function with internal
11710 linkage, we already know what object file linkage will be
11711 assigned to the instantiation. */
11712 DECL_INTERFACE_KNOWN (r
) = !TREE_PUBLIC (r
);
11713 DECL_DEFER_OUTPUT (r
) = 0;
11714 DECL_CHAIN (r
) = NULL_TREE
;
11715 DECL_PENDING_INLINE_INFO (r
) = 0;
11716 DECL_PENDING_INLINE_P (r
) = 0;
11717 DECL_SAVED_TREE (r
) = NULL_TREE
;
11718 DECL_STRUCT_FUNCTION (r
) = NULL
;
11720 /* We'll re-clone as appropriate in instantiate_template. */
11721 DECL_CLONED_FUNCTION (r
) = NULL_TREE
;
11723 /* If we aren't complaining now, return on error before we register
11724 the specialization so that we'll complain eventually. */
11725 if ((complain
& tf_error
) == 0
11726 && IDENTIFIER_OPNAME_P (DECL_NAME (r
))
11727 && !grok_op_properties (r
, /*complain=*/false))
11728 RETURN (error_mark_node
);
11730 /* When instantiating a constrained member, substitute
11731 into the constraints to create a new constraint. */
11732 if (tree ci
= get_constraints (t
))
11735 ci
= tsubst_constraint_info (ci
, argvec
, complain
, NULL_TREE
);
11736 set_constraints (r
, ci
);
11739 /* Set up the DECL_TEMPLATE_INFO for R. There's no need to do
11740 this in the special friend case mentioned above where
11741 GEN_TMPL is NULL. */
11744 DECL_TEMPLATE_INFO (r
)
11745 = build_template_info (gen_tmpl
, argvec
);
11746 SET_DECL_IMPLICIT_INSTANTIATION (r
);
11749 = register_specialization (r
, gen_tmpl
, argvec
, false, hash
);
11751 /* We instantiated this while substituting into
11752 the type earlier (template/friend54.C). */
11755 /* We're not supposed to instantiate default arguments
11756 until they are called, for a template. But, for a
11759 template <class T> void f ()
11760 { extern void g(int i = T()); }
11762 we should do the substitution when the template is
11763 instantiated. We handle the member function case in
11764 instantiate_class_template since the default arguments
11765 might refer to other members of the class. */
11767 && !PRIMARY_TEMPLATE_P (gen_tmpl
)
11768 && !uses_template_parms (argvec
))
11769 tsubst_default_arguments (r
, complain
);
11772 DECL_TEMPLATE_INFO (r
) = NULL_TREE
;
11774 /* Copy the list of befriending classes. */
11775 for (friends
= &DECL_BEFRIENDING_CLASSES (r
);
11777 friends
= &TREE_CHAIN (*friends
))
11779 *friends
= copy_node (*friends
);
11780 TREE_VALUE (*friends
) = tsubst (TREE_VALUE (*friends
),
11785 if (DECL_CONSTRUCTOR_P (r
) || DECL_DESTRUCTOR_P (r
))
11787 maybe_retrofit_in_chrg (r
);
11788 if (DECL_CONSTRUCTOR_P (r
))
11789 grok_ctor_properties (ctx
, r
);
11790 if (DECL_INHERITED_CTOR_BASE (r
))
11791 deduce_inheriting_ctor (r
);
11792 /* If this is an instantiation of a member template, clone it.
11793 If it isn't, that'll be handled by
11794 clone_constructors_and_destructors. */
11795 if (PRIMARY_TEMPLATE_P (gen_tmpl
))
11796 clone_function_decl (r
, /*update_method_vec_p=*/0);
11798 else if ((complain
& tf_error
) != 0
11799 && IDENTIFIER_OPNAME_P (DECL_NAME (r
))
11800 && !grok_op_properties (r
, /*complain=*/true))
11801 RETURN (error_mark_node
);
11803 if (DECL_FRIEND_P (t
) && DECL_FRIEND_CONTEXT (t
))
11804 SET_DECL_FRIEND_CONTEXT (r
,
11805 tsubst (DECL_FRIEND_CONTEXT (t
),
11806 args
, complain
, in_decl
));
11808 /* Possibly limit visibility based on template args. */
11809 DECL_VISIBILITY (r
) = VISIBILITY_DEFAULT
;
11810 if (DECL_VISIBILITY_SPECIFIED (t
))
11812 DECL_VISIBILITY_SPECIFIED (r
) = 0;
11813 DECL_ATTRIBUTES (r
)
11814 = remove_attribute ("visibility", DECL_ATTRIBUTES (r
));
11816 determine_visibility (r
);
11817 if (DECL_DEFAULTED_OUTSIDE_CLASS_P (r
)
11818 && !processing_template_decl
)
11819 defaulted_late_check (r
);
11821 apply_late_template_attributes (&r
, DECL_ATTRIBUTES (r
), 0,
11822 args
, complain
, in_decl
);
11828 tree type
= NULL_TREE
;
11830 tree expanded_types
= NULL_TREE
;
11831 tree prev_r
= NULL_TREE
;
11832 tree first_r
= NULL_TREE
;
11834 if (DECL_PACK_P (t
))
11836 /* If there is a local specialization that isn't a
11837 parameter pack, it means that we're doing a "simple"
11838 substitution from inside tsubst_pack_expansion. Just
11839 return the local specialization (which will be a single
11841 tree spec
= retrieve_local_specialization (t
);
11843 && TREE_CODE (spec
) == PARM_DECL
11844 && TREE_CODE (TREE_TYPE (spec
)) != TYPE_PACK_EXPANSION
)
11847 /* Expand the TYPE_PACK_EXPANSION that provides the types for
11848 the parameters in this function parameter pack. */
11849 expanded_types
= tsubst_pack_expansion (TREE_TYPE (t
), args
,
11850 complain
, in_decl
);
11851 if (TREE_CODE (expanded_types
) == TREE_VEC
)
11853 len
= TREE_VEC_LENGTH (expanded_types
);
11855 /* Zero-length parameter packs are boring. Just substitute
11858 RETURN (tsubst (TREE_CHAIN (t
), args
, complain
,
11863 /* All we did was update the type. Make a note of that. */
11864 type
= expanded_types
;
11865 expanded_types
= NULL_TREE
;
11869 /* Loop through all of the parameters we'll build. When T is
11870 a function parameter pack, LEN is the number of expanded
11871 types in EXPANDED_TYPES; otherwise, LEN is 1. */
11873 for (i
= 0; i
< len
; ++i
)
11877 if (DECL_TEMPLATE_PARM_P (t
))
11878 SET_DECL_TEMPLATE_PARM_P (r
);
11880 if (expanded_types
)
11881 /* We're on the Ith parameter of the function parameter
11884 /* Get the Ith type. */
11885 type
= TREE_VEC_ELT (expanded_types
, i
);
11887 /* Rename the parameter to include the index. */
11889 = make_ith_pack_parameter_name (DECL_NAME (r
), i
);
11892 /* We're dealing with a normal parameter. */
11893 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
11895 type
= type_decays_to (type
);
11896 TREE_TYPE (r
) = type
;
11897 cp_apply_type_quals_to_decl (cp_type_quals (type
), r
);
11899 if (DECL_INITIAL (r
))
11901 if (TREE_CODE (DECL_INITIAL (r
)) != TEMPLATE_PARM_INDEX
)
11902 DECL_INITIAL (r
) = TREE_TYPE (r
);
11904 DECL_INITIAL (r
) = tsubst (DECL_INITIAL (r
), args
,
11905 complain
, in_decl
);
11908 DECL_CONTEXT (r
) = NULL_TREE
;
11910 if (!DECL_TEMPLATE_PARM_P (r
))
11911 DECL_ARG_TYPE (r
) = type_passed_as (type
);
11913 apply_late_template_attributes (&r
, DECL_ATTRIBUTES (r
), 0,
11914 args
, complain
, in_decl
);
11916 /* Keep track of the first new parameter we
11917 generate. That's what will be returned to the
11922 /* Build a proper chain of parameters when substituting
11923 into a function parameter pack. */
11925 DECL_CHAIN (prev_r
) = r
;
11928 /* If cp_unevaluated_operand is set, we're just looking for a
11929 single dummy parameter, so don't keep going. */
11930 if (DECL_CHAIN (t
) && !cp_unevaluated_operand
)
11931 DECL_CHAIN (r
) = tsubst (DECL_CHAIN (t
), args
,
11932 complain
, DECL_CHAIN (t
));
11934 /* FIRST_R contains the start of the chain we've built. */
11941 tree type
= NULL_TREE
;
11942 tree vec
= NULL_TREE
;
11943 tree expanded_types
= NULL_TREE
;
11946 if (PACK_EXPANSION_P (TREE_TYPE (t
)))
11948 /* This field is a lambda capture pack. Return a TREE_VEC of
11949 the expanded fields to instantiate_class_template_1 and
11950 store them in the specializations hash table as a
11951 NONTYPE_ARGUMENT_PACK so that tsubst_copy can find them. */
11952 expanded_types
= tsubst_pack_expansion (TREE_TYPE (t
), args
,
11953 complain
, in_decl
);
11954 if (TREE_CODE (expanded_types
) == TREE_VEC
)
11956 len
= TREE_VEC_LENGTH (expanded_types
);
11957 vec
= make_tree_vec (len
);
11961 /* All we did was update the type. Make a note of that. */
11962 type
= expanded_types
;
11963 expanded_types
= NULL_TREE
;
11967 for (int i
= 0; i
< len
; ++i
)
11970 if (expanded_types
)
11972 type
= TREE_VEC_ELT (expanded_types
, i
);
11974 = make_ith_pack_parameter_name (DECL_NAME (r
), i
);
11977 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
11979 if (type
== error_mark_node
)
11980 RETURN (error_mark_node
);
11981 TREE_TYPE (r
) = type
;
11982 cp_apply_type_quals_to_decl (cp_type_quals (type
), r
);
11984 if (DECL_C_BIT_FIELD (r
))
11985 /* For bit-fields, DECL_INITIAL gives the number of bits. For
11986 non-bit-fields DECL_INITIAL is a non-static data member
11987 initializer, which gets deferred instantiation. */
11989 = tsubst_expr (DECL_INITIAL (t
), args
,
11991 /*integral_constant_expression_p=*/true);
11992 else if (DECL_INITIAL (t
))
11994 /* Set up DECL_TEMPLATE_INFO so that we can get at the
11995 NSDMI in perform_member_init. Still set DECL_INITIAL
11996 so that we know there is one. */
11997 DECL_INITIAL (r
) = void_node
;
11998 gcc_assert (DECL_LANG_SPECIFIC (r
) == NULL
);
11999 retrofit_lang_decl (r
);
12000 DECL_TEMPLATE_INFO (r
) = build_template_info (t
, args
);
12002 /* We don't have to set DECL_CONTEXT here; it is set by
12003 finish_member_declaration. */
12004 DECL_CHAIN (r
) = NULL_TREE
;
12006 apply_late_template_attributes (&r
, DECL_ATTRIBUTES (r
), 0,
12007 args
, complain
, in_decl
);
12010 TREE_VEC_ELT (vec
, i
) = r
;
12016 tree pack
= make_node (NONTYPE_ARGUMENT_PACK
);
12017 tree tpack
= cxx_make_type (TYPE_ARGUMENT_PACK
);
12018 SET_ARGUMENT_PACK_ARGS (pack
, vec
);
12019 SET_ARGUMENT_PACK_ARGS (tpack
, expanded_types
);
12020 TREE_TYPE (pack
) = tpack
;
12021 register_specialization (pack
, t
, args
, false, 0);
12027 /* We reach here only for member using decls. We also need to check
12028 uses_template_parms because DECL_DEPENDENT_P is not set for a
12029 using-declaration that designates a member of the current
12030 instantiation (c++/53549). */
12031 if (DECL_DEPENDENT_P (t
)
12032 || uses_template_parms (USING_DECL_SCOPE (t
)))
12034 tree inst_scope
= tsubst_copy (USING_DECL_SCOPE (t
), args
,
12035 complain
, in_decl
);
12036 tree name
= tsubst_copy (DECL_NAME (t
), args
, complain
, in_decl
);
12037 r
= do_class_using_decl (inst_scope
, name
);
12039 r
= error_mark_node
;
12042 TREE_PROTECTED (r
) = TREE_PROTECTED (t
);
12043 TREE_PRIVATE (r
) = TREE_PRIVATE (t
);
12049 DECL_CHAIN (r
) = NULL_TREE
;
12056 tree argvec
= NULL_TREE
;
12057 tree gen_tmpl
= NULL_TREE
;
12059 tree tmpl
= NULL_TREE
;
12061 tree type
= NULL_TREE
;
12064 if (TREE_TYPE (t
) == error_mark_node
)
12065 RETURN (error_mark_node
);
12067 if (TREE_CODE (t
) == TYPE_DECL
12068 && t
== TYPE_MAIN_DECL (TREE_TYPE (t
)))
12070 /* If this is the canonical decl, we don't have to
12071 mess with instantiations, and often we can't (for
12072 typename, template type parms and such). Note that
12073 TYPE_NAME is not correct for the above test if
12074 we've copied the type for a typedef. */
12075 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
12076 if (type
== error_mark_node
)
12077 RETURN (error_mark_node
);
12078 r
= TYPE_NAME (type
);
12082 /* Check to see if we already have the specialization we
12085 if (DECL_CLASS_SCOPE_P (t
) || DECL_NAMESPACE_SCOPE_P (t
))
12087 /* T is a static data member or namespace-scope entity.
12088 We have to substitute into namespace-scope variables
12089 (not just variable templates) because of cases like:
12091 template <class T> void f() { extern T t; }
12093 where the entity referenced is not known until
12094 instantiation time. */
12096 ctx
= DECL_CONTEXT (t
);
12097 if (DECL_CLASS_SCOPE_P (t
))
12099 ctx
= tsubst_aggr_type (ctx
, args
,
12101 in_decl
, /*entering_scope=*/1);
12102 /* If CTX is unchanged, then T is in fact the
12103 specialization we want. That situation occurs when
12104 referencing a static data member within in its own
12105 class. We can use pointer equality, rather than
12106 same_type_p, because DECL_CONTEXT is always
12108 if (ctx
== DECL_CONTEXT (t
)
12109 /* ... unless T is a member template; in which
12110 case our caller can be willing to create a
12111 specialization of that template represented
12113 && !(DECL_TI_TEMPLATE (t
)
12114 && DECL_MEMBER_TEMPLATE_P (DECL_TI_TEMPLATE (t
))))
12120 tmpl
= DECL_TI_TEMPLATE (t
);
12121 gen_tmpl
= most_general_template (tmpl
);
12122 argvec
= tsubst (DECL_TI_ARGS (t
), args
, complain
, in_decl
);
12123 if (argvec
!= error_mark_node
)
12124 argvec
= (coerce_innermost_template_parms
12125 (DECL_TEMPLATE_PARMS (gen_tmpl
),
12126 argvec
, t
, complain
,
12127 /*all*/true, /*defarg*/true));
12128 if (argvec
== error_mark_node
)
12129 RETURN (error_mark_node
);
12130 hash
= hash_tmpl_and_args (gen_tmpl
, argvec
);
12131 spec
= retrieve_specialization (gen_tmpl
, argvec
, hash
);
12136 /* A local variable. */
12138 /* Subsequent calls to pushdecl will fill this in. */
12140 spec
= retrieve_local_specialization (t
);
12142 /* If we already have the specialization we need, there is
12143 nothing more to do. */
12150 /* Create a new node for the specialization we need. */
12152 if (type
== NULL_TREE
)
12154 if (is_typedef_decl (t
))
12155 type
= DECL_ORIGINAL_TYPE (t
);
12157 type
= TREE_TYPE (t
);
12159 && VAR_HAD_UNKNOWN_BOUND (t
)
12160 && type
!= error_mark_node
)
12161 type
= strip_array_domain (type
);
12162 type
= tsubst (type
, args
, complain
, in_decl
);
12166 /* Even if the original location is out of scope, the
12167 newly substituted one is not. */
12168 DECL_DEAD_FOR_LOCAL (r
) = 0;
12169 DECL_INITIALIZED_P (r
) = 0;
12170 DECL_TEMPLATE_INSTANTIATED (r
) = 0;
12171 if (type
== error_mark_node
)
12172 RETURN (error_mark_node
);
12173 if (TREE_CODE (type
) == FUNCTION_TYPE
)
12175 /* It may seem that this case cannot occur, since:
12180 declares a function, not a variable. However:
12183 template <typename T> void g() { T t; }
12184 template void g<f>();
12186 is an attempt to declare a variable with function
12188 error ("variable %qD has function type",
12189 /* R is not yet sufficiently initialized, so we
12190 just use its name. */
12192 RETURN (error_mark_node
);
12194 type
= complete_type (type
);
12195 /* Wait until cp_finish_decl to set this again, to handle
12196 circular dependency (template/instantiate6.C). */
12197 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (r
) = 0;
12198 type
= check_var_type (DECL_NAME (r
), type
);
12200 if (DECL_HAS_VALUE_EXPR_P (t
))
12202 tree ve
= DECL_VALUE_EXPR (t
);
12203 ve
= tsubst_expr (ve
, args
, complain
, in_decl
,
12204 /*constant_expression_p=*/false);
12205 if (REFERENCE_REF_P (ve
))
12207 gcc_assert (TREE_CODE (type
) == REFERENCE_TYPE
);
12208 ve
= TREE_OPERAND (ve
, 0);
12210 SET_DECL_VALUE_EXPR (r
, ve
);
12212 if (CP_DECL_THREAD_LOCAL_P (r
)
12213 && !processing_template_decl
)
12214 set_decl_tls_model (r
, decl_default_tls_model (r
));
12216 else if (DECL_SELF_REFERENCE_P (t
))
12217 SET_DECL_SELF_REFERENCE_P (r
);
12218 TREE_TYPE (r
) = type
;
12219 cp_apply_type_quals_to_decl (cp_type_quals (type
), r
);
12220 DECL_CONTEXT (r
) = ctx
;
12221 /* Clear out the mangled name and RTL for the instantiation. */
12222 SET_DECL_ASSEMBLER_NAME (r
, NULL_TREE
);
12223 if (CODE_CONTAINS_STRUCT (TREE_CODE (t
), TS_DECL_WRTL
))
12224 SET_DECL_RTL (r
, NULL
);
12225 /* The initializer must not be expanded until it is required;
12226 see [temp.inst]. */
12227 DECL_INITIAL (r
) = NULL_TREE
;
12228 if (CODE_CONTAINS_STRUCT (TREE_CODE (t
), TS_DECL_WRTL
))
12229 SET_DECL_RTL (r
, NULL
);
12230 DECL_SIZE (r
) = DECL_SIZE_UNIT (r
) = 0;
12233 /* Possibly limit visibility based on template args. */
12234 DECL_VISIBILITY (r
) = VISIBILITY_DEFAULT
;
12235 if (DECL_VISIBILITY_SPECIFIED (t
))
12237 DECL_VISIBILITY_SPECIFIED (r
) = 0;
12238 DECL_ATTRIBUTES (r
)
12239 = remove_attribute ("visibility", DECL_ATTRIBUTES (r
));
12241 determine_visibility (r
);
12246 /* A static data member declaration is always marked
12247 external when it is declared in-class, even if an
12248 initializer is present. We mimic the non-template
12249 processing here. */
12250 DECL_EXTERNAL (r
) = 1;
12251 if (DECL_NAMESPACE_SCOPE_P (t
))
12252 DECL_NOT_REALLY_EXTERN (r
) = 1;
12254 DECL_TEMPLATE_INFO (r
) = build_template_info (tmpl
, argvec
);
12255 SET_DECL_IMPLICIT_INSTANTIATION (r
);
12256 register_specialization (r
, gen_tmpl
, argvec
, false, hash
);
12258 else if (!cp_unevaluated_operand
)
12259 register_local_specialization (r
, t
);
12261 DECL_CHAIN (r
) = NULL_TREE
;
12263 apply_late_template_attributes (&r
, DECL_ATTRIBUTES (r
),
12265 args
, complain
, in_decl
);
12267 /* Preserve a typedef that names a type. */
12268 if (is_typedef_decl (r
))
12270 DECL_ORIGINAL_TYPE (r
) = NULL_TREE
;
12271 set_underlying_type (r
);
12272 if (TYPE_DECL_ALIAS_P (r
) && type
!= error_mark_node
)
12273 /* An alias template specialization can be dependent
12274 even if its underlying type is not. */
12275 TYPE_DEPENDENT_P_VALID (TREE_TYPE (r
)) = false;
12278 layout_decl (r
, 0);
12283 gcc_unreachable ();
12288 /* Restore the file and line information. */
12289 input_location
= saved_loc
;
12294 /* Substitute into the ARG_TYPES of a function type.
12295 If END is a TREE_CHAIN, leave it and any following types
12299 tsubst_arg_types (tree arg_types
,
12302 tsubst_flags_t complain
,
12305 tree remaining_arg_types
;
12306 tree type
= NULL_TREE
;
12308 tree expanded_args
= NULL_TREE
;
12311 if (!arg_types
|| arg_types
== void_list_node
|| arg_types
== end
)
12314 remaining_arg_types
= tsubst_arg_types (TREE_CHAIN (arg_types
),
12315 args
, end
, complain
, in_decl
);
12316 if (remaining_arg_types
== error_mark_node
)
12317 return error_mark_node
;
12319 if (PACK_EXPANSION_P (TREE_VALUE (arg_types
)))
12321 /* For a pack expansion, perform substitution on the
12322 entire expression. Later on, we'll handle the arguments
12324 expanded_args
= tsubst_pack_expansion (TREE_VALUE (arg_types
),
12325 args
, complain
, in_decl
);
12327 if (TREE_CODE (expanded_args
) == TREE_VEC
)
12328 /* So that we'll spin through the parameters, one by one. */
12329 i
= TREE_VEC_LENGTH (expanded_args
);
12332 /* We only partially substituted into the parameter
12333 pack. Our type is TYPE_PACK_EXPANSION. */
12334 type
= expanded_args
;
12335 expanded_args
= NULL_TREE
;
12343 type
= TREE_VEC_ELT (expanded_args
, i
);
12345 type
= tsubst (TREE_VALUE (arg_types
), args
, complain
, in_decl
);
12347 if (type
== error_mark_node
)
12348 return error_mark_node
;
12349 if (VOID_TYPE_P (type
))
12351 if (complain
& tf_error
)
12353 error ("invalid parameter type %qT", type
);
12355 error ("in declaration %q+D", in_decl
);
12357 return error_mark_node
;
12360 if (abstract_virtuals_error_sfinae (ACU_PARM
, type
, complain
))
12361 return error_mark_node
;
12363 /* Do array-to-pointer, function-to-pointer conversion, and ignore
12364 top-level qualifiers as required. */
12365 type
= cv_unqualified (type_decays_to (type
));
12367 /* We do not substitute into default arguments here. The standard
12368 mandates that they be instantiated only when needed, which is
12369 done in build_over_call. */
12370 default_arg
= TREE_PURPOSE (arg_types
);
12372 if (default_arg
&& TREE_CODE (default_arg
) == DEFAULT_ARG
)
12374 /* We've instantiated a template before its default arguments
12375 have been parsed. This can happen for a nested template
12376 class, and is not an error unless we require the default
12377 argument in a call of this function. */
12378 remaining_arg_types
=
12379 tree_cons (default_arg
, type
, remaining_arg_types
);
12380 vec_safe_push (DEFARG_INSTANTIATIONS(default_arg
), remaining_arg_types
);
12383 remaining_arg_types
=
12384 hash_tree_cons (default_arg
, type
, remaining_arg_types
);
12387 return remaining_arg_types
;
12390 /* Substitute into a FUNCTION_TYPE or METHOD_TYPE. This routine does
12391 *not* handle the exception-specification for FNTYPE, because the
12392 initial substitution of explicitly provided template parameters
12393 during argument deduction forbids substitution into the
12394 exception-specification:
12398 All references in the function type of the function template to the
12399 corresponding template parameters are replaced by the specified tem-
12400 plate argument values. If a substitution in a template parameter or
12401 in the function type of the function template results in an invalid
12402 type, type deduction fails. [Note: The equivalent substitution in
12403 exception specifications is done only when the function is instanti-
12404 ated, at which point a program is ill-formed if the substitution
12405 results in an invalid type.] */
12408 tsubst_function_type (tree t
,
12410 tsubst_flags_t complain
,
12414 tree arg_types
= NULL_TREE
;
12417 /* The TYPE_CONTEXT is not used for function/method types. */
12418 gcc_assert (TYPE_CONTEXT (t
) == NULL_TREE
);
12420 /* DR 1227: Mixing immediate and non-immediate contexts in deduction
12422 bool late_return_type_p
= TYPE_HAS_LATE_RETURN_TYPE (t
);
12424 if (late_return_type_p
)
12426 /* Substitute the argument types. */
12427 arg_types
= tsubst_arg_types (TYPE_ARG_TYPES (t
), args
, NULL_TREE
,
12428 complain
, in_decl
);
12429 if (arg_types
== error_mark_node
)
12430 return error_mark_node
;
12432 tree save_ccp
= current_class_ptr
;
12433 tree save_ccr
= current_class_ref
;
12434 tree this_type
= (TREE_CODE (t
) == METHOD_TYPE
12435 ? TREE_TYPE (TREE_VALUE (arg_types
)) : NULL_TREE
);
12436 bool do_inject
= this_type
&& CLASS_TYPE_P (this_type
);
12439 /* DR 1207: 'this' is in scope in the trailing return type. */
12440 inject_this_parameter (this_type
, cp_type_quals (this_type
));
12443 /* Substitute the return type. */
12444 return_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
12448 current_class_ptr
= save_ccp
;
12449 current_class_ref
= save_ccr
;
12453 /* Substitute the return type. */
12454 return_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
12456 if (return_type
== error_mark_node
)
12457 return error_mark_node
;
12458 /* DR 486 clarifies that creation of a function type with an
12459 invalid return type is a deduction failure. */
12460 if (TREE_CODE (return_type
) == ARRAY_TYPE
12461 || TREE_CODE (return_type
) == FUNCTION_TYPE
)
12463 if (complain
& tf_error
)
12465 if (TREE_CODE (return_type
) == ARRAY_TYPE
)
12466 error ("function returning an array");
12468 error ("function returning a function");
12470 return error_mark_node
;
12473 if (abstract_virtuals_error_sfinae (ACU_RETURN
, return_type
, complain
))
12474 return error_mark_node
;
12476 if (!late_return_type_p
)
12478 /* Substitute the argument types. */
12479 arg_types
= tsubst_arg_types (TYPE_ARG_TYPES (t
), args
, NULL_TREE
,
12480 complain
, in_decl
);
12481 if (arg_types
== error_mark_node
)
12482 return error_mark_node
;
12485 /* Construct a new type node and return it. */
12486 if (TREE_CODE (t
) == FUNCTION_TYPE
)
12488 fntype
= build_function_type (return_type
, arg_types
);
12489 fntype
= apply_memfn_quals (fntype
,
12490 type_memfn_quals (t
),
12491 type_memfn_rqual (t
));
12495 tree r
= TREE_TYPE (TREE_VALUE (arg_types
));
12496 /* Don't pick up extra function qualifiers from the basetype. */
12497 r
= cp_build_qualified_type_real (r
, type_memfn_quals (t
), complain
);
12498 if (! MAYBE_CLASS_TYPE_P (r
))
12502 Type deduction may fail for any of the following
12505 -- Attempting to create "pointer to member of T" when T
12506 is not a class type. */
12507 if (complain
& tf_error
)
12508 error ("creating pointer to member function of non-class type %qT",
12510 return error_mark_node
;
12513 fntype
= build_method_type_directly (r
, return_type
,
12514 TREE_CHAIN (arg_types
));
12515 fntype
= build_ref_qualified_type (fntype
, type_memfn_rqual (t
));
12517 fntype
= cp_build_type_attribute_variant (fntype
, TYPE_ATTRIBUTES (t
));
12519 if (late_return_type_p
)
12520 TYPE_HAS_LATE_RETURN_TYPE (fntype
) = 1;
12525 /* FNTYPE is a FUNCTION_TYPE or METHOD_TYPE. Substitute the template
12526 ARGS into that specification, and return the substituted
12527 specification. If there is no specification, return NULL_TREE. */
12530 tsubst_exception_specification (tree fntype
,
12532 tsubst_flags_t complain
,
12539 specs
= TYPE_RAISES_EXCEPTIONS (fntype
);
12540 new_specs
= NULL_TREE
;
12541 if (specs
&& TREE_PURPOSE (specs
))
12543 /* A noexcept-specifier. */
12544 tree expr
= TREE_PURPOSE (specs
);
12545 if (TREE_CODE (expr
) == INTEGER_CST
)
12549 /* Defer instantiation of noexcept-specifiers to avoid
12550 excessive instantiations (c++/49107). */
12551 new_specs
= make_node (DEFERRED_NOEXCEPT
);
12552 if (DEFERRED_NOEXCEPT_SPEC_P (specs
))
12554 /* We already partially instantiated this member template,
12555 so combine the new args with the old. */
12556 DEFERRED_NOEXCEPT_PATTERN (new_specs
)
12557 = DEFERRED_NOEXCEPT_PATTERN (expr
);
12558 DEFERRED_NOEXCEPT_ARGS (new_specs
)
12559 = add_to_template_args (DEFERRED_NOEXCEPT_ARGS (expr
), args
);
12563 DEFERRED_NOEXCEPT_PATTERN (new_specs
) = expr
;
12564 DEFERRED_NOEXCEPT_ARGS (new_specs
) = args
;
12568 new_specs
= tsubst_copy_and_build
12569 (expr
, args
, complain
, in_decl
, /*function_p=*/false,
12570 /*integral_constant_expression_p=*/true);
12571 new_specs
= build_noexcept_spec (new_specs
, complain
);
12575 if (! TREE_VALUE (specs
))
12582 tree expanded_specs
= NULL_TREE
;
12584 if (PACK_EXPANSION_P (TREE_VALUE (specs
)))
12586 /* Expand the pack expansion type. */
12587 expanded_specs
= tsubst_pack_expansion (TREE_VALUE (specs
),
12591 if (expanded_specs
== error_mark_node
)
12592 return error_mark_node
;
12593 else if (TREE_CODE (expanded_specs
) == TREE_VEC
)
12594 len
= TREE_VEC_LENGTH (expanded_specs
);
12597 /* We're substituting into a member template, so
12598 we got a TYPE_PACK_EXPANSION back. Add that
12599 expansion and move on. */
12600 gcc_assert (TREE_CODE (expanded_specs
)
12601 == TYPE_PACK_EXPANSION
);
12602 new_specs
= add_exception_specifier (new_specs
,
12605 specs
= TREE_CHAIN (specs
);
12610 for (i
= 0; i
< len
; ++i
)
12612 if (expanded_specs
)
12613 spec
= TREE_VEC_ELT (expanded_specs
, i
);
12615 spec
= tsubst (TREE_VALUE (specs
), args
, complain
, in_decl
);
12616 if (spec
== error_mark_node
)
12618 new_specs
= add_exception_specifier (new_specs
, spec
,
12622 specs
= TREE_CHAIN (specs
);
12628 /* Take the tree structure T and replace template parameters used
12629 therein with the argument vector ARGS. IN_DECL is an associated
12630 decl for diagnostics. If an error occurs, returns ERROR_MARK_NODE.
12631 Issue error and warning messages under control of COMPLAIN. Note
12632 that we must be relatively non-tolerant of extensions here, in
12633 order to preserve conformance; if we allow substitutions that
12634 should not be allowed, we may allow argument deductions that should
12635 not succeed, and therefore report ambiguous overload situations
12636 where there are none. In theory, we could allow the substitution,
12637 but indicate that it should have failed, and allow our caller to
12638 make sure that the right thing happens, but we don't try to do this
12641 This function is used for dealing with types, decls and the like;
12642 for expressions, use tsubst_expr or tsubst_copy. */
12645 tsubst (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
12647 enum tree_code code
;
12648 tree type
, r
= NULL_TREE
;
12650 if (t
== NULL_TREE
|| t
== error_mark_node
12651 || t
== integer_type_node
12652 || t
== void_type_node
12653 || t
== char_type_node
12654 || t
== unknown_type_node
12655 || TREE_CODE (t
) == NAMESPACE_DECL
12656 || TREE_CODE (t
) == TRANSLATION_UNIT_DECL
)
12660 return tsubst_decl (t
, args
, complain
);
12662 if (args
== NULL_TREE
)
12665 code
= TREE_CODE (t
);
12667 if (code
== IDENTIFIER_NODE
)
12668 type
= IDENTIFIER_TYPE_VALUE (t
);
12670 type
= TREE_TYPE (t
);
12672 gcc_assert (type
!= unknown_type_node
);
12674 /* Reuse typedefs. We need to do this to handle dependent attributes,
12675 such as attribute aligned. */
12677 && typedef_variant_p (t
))
12679 tree decl
= TYPE_NAME (t
);
12681 if (alias_template_specialization_p (t
))
12683 /* DECL represents an alias template and we want to
12685 tree tmpl
= most_general_template (DECL_TI_TEMPLATE (decl
));
12686 tree gen_args
= tsubst (DECL_TI_ARGS (decl
), args
, complain
, in_decl
);
12687 r
= instantiate_alias_template (tmpl
, gen_args
, complain
);
12689 else if (DECL_CLASS_SCOPE_P (decl
)
12690 && CLASSTYPE_TEMPLATE_INFO (DECL_CONTEXT (decl
))
12691 && uses_template_parms (DECL_CONTEXT (decl
)))
12693 tree tmpl
= most_general_template (DECL_TI_TEMPLATE (decl
));
12694 tree gen_args
= tsubst (DECL_TI_ARGS (decl
), args
, complain
, in_decl
);
12695 r
= retrieve_specialization (tmpl
, gen_args
, 0);
12697 else if (DECL_FUNCTION_SCOPE_P (decl
)
12698 && DECL_TEMPLATE_INFO (DECL_CONTEXT (decl
))
12699 && uses_template_parms (DECL_TI_ARGS (DECL_CONTEXT (decl
))))
12700 r
= retrieve_local_specialization (decl
);
12702 /* The typedef is from a non-template context. */
12708 r
= cp_build_qualified_type_real
12709 (r
, cp_type_quals (t
) | cp_type_quals (r
),
12710 complain
| tf_ignore_bad_quals
);
12715 /* We don't have an instantiation yet, so drop the typedef. */
12716 int quals
= cp_type_quals (t
);
12717 t
= DECL_ORIGINAL_TYPE (decl
);
12718 t
= cp_build_qualified_type_real (t
, quals
,
12719 complain
| tf_ignore_bad_quals
);
12724 && code
!= TYPENAME_TYPE
12725 && code
!= TEMPLATE_TYPE_PARM
12726 && code
!= IDENTIFIER_NODE
12727 && code
!= FUNCTION_TYPE
12728 && code
!= METHOD_TYPE
)
12729 type
= tsubst (type
, args
, complain
, in_decl
);
12730 if (type
== error_mark_node
)
12731 return error_mark_node
;
12737 case ENUMERAL_TYPE
:
12738 return tsubst_aggr_type (t
, args
, complain
, in_decl
,
12739 /*entering_scope=*/0);
12742 case IDENTIFIER_NODE
:
12753 if (t
== integer_type_node
)
12756 if (TREE_CODE (TYPE_MIN_VALUE (t
)) == INTEGER_CST
12757 && TREE_CODE (TYPE_MAX_VALUE (t
)) == INTEGER_CST
)
12761 tree max
, omax
= TREE_OPERAND (TYPE_MAX_VALUE (t
), 0);
12763 max
= tsubst_expr (omax
, args
, complain
, in_decl
,
12764 /*integral_constant_expression_p=*/false);
12766 /* Fix up type of the magic NOP_EXPR with TREE_SIDE_EFFECTS if
12768 if (TREE_CODE (max
) == NOP_EXPR
12769 && TREE_SIDE_EFFECTS (omax
)
12770 && !TREE_TYPE (max
))
12771 TREE_TYPE (max
) = TREE_TYPE (TREE_OPERAND (max
, 0));
12773 /* If we're in a partial instantiation, preserve the magic NOP_EXPR
12774 with TREE_SIDE_EFFECTS that indicates this is not an integral
12775 constant expression. */
12776 if (processing_template_decl
12777 && TREE_SIDE_EFFECTS (omax
) && TREE_CODE (omax
) == NOP_EXPR
)
12779 gcc_assert (TREE_CODE (max
) == NOP_EXPR
);
12780 TREE_SIDE_EFFECTS (max
) = 1;
12783 return compute_array_index_type (NULL_TREE
, max
, complain
);
12786 case TEMPLATE_TYPE_PARM
:
12787 case TEMPLATE_TEMPLATE_PARM
:
12788 case BOUND_TEMPLATE_TEMPLATE_PARM
:
12789 case TEMPLATE_PARM_INDEX
:
12794 tree arg
= NULL_TREE
;
12796 /* Early in template argument deduction substitution, we don't
12797 want to reduce the level of 'auto', or it will be confused
12798 with a normal template parm in subsequent deduction. */
12799 if (is_auto (t
) && (complain
& tf_partial
))
12804 gcc_assert (TREE_VEC_LENGTH (args
) > 0);
12805 template_parm_level_and_index (t
, &level
, &idx
);
12807 levels
= TMPL_ARGS_DEPTH (args
);
12808 if (level
<= levels
12809 && TREE_VEC_LENGTH (TMPL_ARGS_LEVEL (args
, level
)) > 0)
12811 arg
= TMPL_ARG (args
, level
, idx
);
12813 if (arg
&& TREE_CODE (arg
) == ARGUMENT_PACK_SELECT
)
12815 /* See through ARGUMENT_PACK_SELECT arguments. */
12816 arg
= ARGUMENT_PACK_SELECT_ARG (arg
);
12817 /* If the selected argument is an expansion E, that most
12818 likely means we were called from
12819 gen_elem_of_pack_expansion_instantiation during the
12820 substituting of pack an argument pack (which Ith
12821 element is a pack expansion, where I is
12822 ARGUMENT_PACK_SELECT_INDEX) into a pack expansion.
12823 In this case, the Ith element resulting from this
12824 substituting is going to be a pack expansion, which
12825 pattern is the pattern of E. Let's return the
12827 gen_elem_of_pack_expansion_instantiation will
12828 build the resulting pack expansion from it. */
12829 if (PACK_EXPANSION_P (arg
))
12831 /* Make sure we aren't throwing away arg info. */
12832 gcc_assert (!PACK_EXPANSION_EXTRA_ARGS (arg
));
12833 arg
= PACK_EXPANSION_PATTERN (arg
);
12838 if (arg
== error_mark_node
)
12839 return error_mark_node
;
12840 else if (arg
!= NULL_TREE
)
12842 if (ARGUMENT_PACK_P (arg
))
12843 /* If ARG is an argument pack, we don't actually want to
12844 perform a substitution here, because substitutions
12845 for argument packs are only done
12846 element-by-element. We can get to this point when
12847 substituting the type of a non-type template
12848 parameter pack, when that type actually contains
12849 template parameter packs from an outer template, e.g.,
12851 template<typename... Types> struct A {
12852 template<Types... Values> struct B { };
12856 if (code
== TEMPLATE_TYPE_PARM
)
12859 gcc_assert (TYPE_P (arg
));
12861 quals
= cp_type_quals (arg
) | cp_type_quals (t
);
12863 return cp_build_qualified_type_real
12864 (arg
, quals
, complain
| tf_ignore_bad_quals
);
12866 else if (code
== BOUND_TEMPLATE_TEMPLATE_PARM
)
12868 /* We are processing a type constructed from a
12869 template template parameter. */
12870 tree argvec
= tsubst (TYPE_TI_ARGS (t
),
12871 args
, complain
, in_decl
);
12872 if (argvec
== error_mark_node
)
12873 return error_mark_node
;
12875 gcc_assert (TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
12876 || TREE_CODE (arg
) == TEMPLATE_DECL
12877 || TREE_CODE (arg
) == UNBOUND_CLASS_TEMPLATE
);
12879 if (TREE_CODE (arg
) == UNBOUND_CLASS_TEMPLATE
)
12880 /* Consider this code:
12882 template <template <class> class Template>
12884 template <class Arg> using Bind = Template<Arg>;
12887 template <template <class> class Template, class Arg>
12888 using Instantiate = Template<Arg>; //#0
12890 template <template <class> class Template,
12893 Instantiate<Internal<Template>::template Bind,
12896 When #1 is parsed, the
12897 BOUND_TEMPLATE_TEMPLATE_PARM representing the
12898 parameter `Template' in #0 matches the
12899 UNBOUND_CLASS_TEMPLATE representing the argument
12900 `Internal<Template>::template Bind'; We then want
12901 to assemble the type `Bind<Argument>' that can't
12902 be fully created right now, because
12903 `Internal<Template>' not being complete, the Bind
12904 template cannot be looked up in that context. So
12905 we need to "store" `Bind<Argument>' for later
12906 when the context of Bind becomes complete. Let's
12907 store that in a TYPENAME_TYPE. */
12908 return make_typename_type (TYPE_CONTEXT (arg
),
12909 build_nt (TEMPLATE_ID_EXPR
,
12910 TYPE_IDENTIFIER (arg
),
12915 /* We can get a TEMPLATE_TEMPLATE_PARM here when we
12916 are resolving nested-types in the signature of a
12917 member function templates. Otherwise ARG is a
12918 TEMPLATE_DECL and is the real template to be
12920 if (TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
)
12921 arg
= TYPE_NAME (arg
);
12923 r
= lookup_template_class (arg
,
12925 DECL_CONTEXT (arg
),
12926 /*entering_scope=*/0,
12928 return cp_build_qualified_type_real
12929 (r
, cp_type_quals (t
) | cp_type_quals (r
), complain
);
12932 /* TEMPLATE_TEMPLATE_PARM or TEMPLATE_PARM_INDEX. */
12933 return convert_from_reference (unshare_expr (arg
));
12937 /* This can happen during the attempted tsubst'ing in
12938 unify. This means that we don't yet have any information
12939 about the template parameter in question. */
12942 /* If we get here, we must have been looking at a parm for a
12943 more deeply nested template. Make a new version of this
12944 template parameter, but with a lower level. */
12947 case TEMPLATE_TYPE_PARM
:
12948 case TEMPLATE_TEMPLATE_PARM
:
12949 case BOUND_TEMPLATE_TEMPLATE_PARM
:
12950 if (cp_type_quals (t
))
12952 r
= tsubst (TYPE_MAIN_VARIANT (t
), args
, complain
, in_decl
);
12953 r
= cp_build_qualified_type_real
12954 (r
, cp_type_quals (t
),
12955 complain
| (code
== TEMPLATE_TYPE_PARM
12956 ? tf_ignore_bad_quals
: 0));
12958 else if (TREE_CODE (t
) == TEMPLATE_TYPE_PARM
12959 && PLACEHOLDER_TYPE_CONSTRAINTS (t
)
12960 && (r
= (TEMPLATE_PARM_DESCENDANTS
12961 (TEMPLATE_TYPE_PARM_INDEX (t
))))
12962 && (r
= TREE_TYPE (r
))
12963 && !PLACEHOLDER_TYPE_CONSTRAINTS (r
))
12964 /* Break infinite recursion when substituting the constraints
12965 of a constrained placeholder. */;
12969 TEMPLATE_TYPE_PARM_INDEX (r
)
12970 = reduce_template_parm_level (TEMPLATE_TYPE_PARM_INDEX (t
),
12971 r
, levels
, args
, complain
);
12972 TYPE_STUB_DECL (r
) = TYPE_NAME (r
) = TEMPLATE_TYPE_DECL (r
);
12973 TYPE_MAIN_VARIANT (r
) = r
;
12974 TYPE_POINTER_TO (r
) = NULL_TREE
;
12975 TYPE_REFERENCE_TO (r
) = NULL_TREE
;
12977 if (TREE_CODE (r
) == TEMPLATE_TEMPLATE_PARM
)
12978 /* We have reduced the level of the template
12979 template parameter, but not the levels of its
12980 template parameters, so canonical_type_parameter
12981 will not be able to find the canonical template
12982 template parameter for this level. Thus, we
12983 require structural equality checking to compare
12984 TEMPLATE_TEMPLATE_PARMs. */
12985 SET_TYPE_STRUCTURAL_EQUALITY (r
);
12986 else if (TYPE_STRUCTURAL_EQUALITY_P (t
))
12987 SET_TYPE_STRUCTURAL_EQUALITY (r
);
12989 TYPE_CANONICAL (r
) = canonical_type_parameter (r
);
12991 /* Propagate constraints on placeholders. */
12992 if (TREE_CODE (t
) == TEMPLATE_TYPE_PARM
)
12993 if (tree constr
= PLACEHOLDER_TYPE_CONSTRAINTS (t
))
12994 PLACEHOLDER_TYPE_CONSTRAINTS (r
)
12995 = tsubst_constraint (constr
, args
, complain
, in_decl
);
12997 if (code
== BOUND_TEMPLATE_TEMPLATE_PARM
)
12999 tree argvec
= tsubst (TYPE_TI_ARGS (t
), args
,
13000 complain
, in_decl
);
13001 if (argvec
== error_mark_node
)
13002 return error_mark_node
;
13004 TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (r
)
13005 = build_template_info (TYPE_TI_TEMPLATE (t
), argvec
);
13010 case TEMPLATE_PARM_INDEX
:
13011 r
= reduce_template_parm_level (t
, type
, levels
, args
, complain
);
13015 gcc_unreachable ();
13023 tree purpose
, value
, chain
;
13025 if (t
== void_list_node
)
13028 purpose
= TREE_PURPOSE (t
);
13031 purpose
= tsubst (purpose
, args
, complain
, in_decl
);
13032 if (purpose
== error_mark_node
)
13033 return error_mark_node
;
13035 value
= TREE_VALUE (t
);
13038 value
= tsubst (value
, args
, complain
, in_decl
);
13039 if (value
== error_mark_node
)
13040 return error_mark_node
;
13042 chain
= TREE_CHAIN (t
);
13043 if (chain
&& chain
!= void_type_node
)
13045 chain
= tsubst (chain
, args
, complain
, in_decl
);
13046 if (chain
== error_mark_node
)
13047 return error_mark_node
;
13049 if (purpose
== TREE_PURPOSE (t
)
13050 && value
== TREE_VALUE (t
)
13051 && chain
== TREE_CHAIN (t
))
13053 return hash_tree_cons (purpose
, value
, chain
);
13057 /* We should never be tsubsting a binfo. */
13058 gcc_unreachable ();
13061 /* A vector of template arguments. */
13062 gcc_assert (!type
);
13063 return tsubst_template_args (t
, args
, complain
, in_decl
);
13066 case REFERENCE_TYPE
:
13068 if (type
== TREE_TYPE (t
) && TREE_CODE (type
) != METHOD_TYPE
)
13073 Type deduction may fail for any of the following
13076 -- Attempting to create a pointer to reference type.
13077 -- Attempting to create a reference to a reference type or
13078 a reference to void.
13080 Core issue 106 says that creating a reference to a reference
13081 during instantiation is no longer a cause for failure. We
13082 only enforce this check in strict C++98 mode. */
13083 if ((TREE_CODE (type
) == REFERENCE_TYPE
13084 && (((cxx_dialect
== cxx98
) && flag_iso
) || code
!= REFERENCE_TYPE
))
13085 || (code
== REFERENCE_TYPE
&& VOID_TYPE_P (type
)))
13087 static location_t last_loc
;
13089 /* We keep track of the last time we issued this error
13090 message to avoid spewing a ton of messages during a
13091 single bad template instantiation. */
13092 if (complain
& tf_error
13093 && last_loc
!= input_location
)
13095 if (VOID_TYPE_P (type
))
13096 error ("forming reference to void");
13097 else if (code
== POINTER_TYPE
)
13098 error ("forming pointer to reference type %qT", type
);
13100 error ("forming reference to reference type %qT", type
);
13101 last_loc
= input_location
;
13104 return error_mark_node
;
13106 else if (TREE_CODE (type
) == FUNCTION_TYPE
13107 && (type_memfn_quals (type
) != TYPE_UNQUALIFIED
13108 || type_memfn_rqual (type
) != REF_QUAL_NONE
))
13110 if (complain
& tf_error
)
13112 if (code
== POINTER_TYPE
)
13113 error ("forming pointer to qualified function type %qT",
13116 error ("forming reference to qualified function type %qT",
13119 return error_mark_node
;
13121 else if (code
== POINTER_TYPE
)
13123 r
= build_pointer_type (type
);
13124 if (TREE_CODE (type
) == METHOD_TYPE
)
13125 r
= build_ptrmemfunc_type (r
);
13127 else if (TREE_CODE (type
) == REFERENCE_TYPE
)
13128 /* In C++0x, during template argument substitution, when there is an
13129 attempt to create a reference to a reference type, reference
13130 collapsing is applied as described in [14.3.1/4 temp.arg.type]:
13132 "If a template-argument for a template-parameter T names a type
13133 that is a reference to a type A, an attempt to create the type
13134 'lvalue reference to cv T' creates the type 'lvalue reference to
13135 A,' while an attempt to create the type type rvalue reference to
13136 cv T' creates the type T"
13138 r
= cp_build_reference_type
13140 TYPE_REF_IS_RVALUE (t
) && TYPE_REF_IS_RVALUE (type
));
13142 r
= cp_build_reference_type (type
, TYPE_REF_IS_RVALUE (t
));
13143 r
= cp_build_qualified_type_real (r
, cp_type_quals (t
), complain
);
13145 if (r
!= error_mark_node
)
13146 /* Will this ever be needed for TYPE_..._TO values? */
13153 r
= tsubst (TYPE_OFFSET_BASETYPE (t
), args
, complain
, in_decl
);
13154 if (r
== error_mark_node
|| !MAYBE_CLASS_TYPE_P (r
))
13158 Type deduction may fail for any of the following
13161 -- Attempting to create "pointer to member of T" when T
13162 is not a class type. */
13163 if (complain
& tf_error
)
13164 error ("creating pointer to member of non-class type %qT", r
);
13165 return error_mark_node
;
13167 if (TREE_CODE (type
) == REFERENCE_TYPE
)
13169 if (complain
& tf_error
)
13170 error ("creating pointer to member reference type %qT", type
);
13171 return error_mark_node
;
13173 if (VOID_TYPE_P (type
))
13175 if (complain
& tf_error
)
13176 error ("creating pointer to member of type void");
13177 return error_mark_node
;
13179 gcc_assert (TREE_CODE (type
) != METHOD_TYPE
);
13180 if (TREE_CODE (type
) == FUNCTION_TYPE
)
13182 /* The type of the implicit object parameter gets its
13183 cv-qualifiers from the FUNCTION_TYPE. */
13186 = build_memfn_type (type
, r
, type_memfn_quals (type
),
13187 type_memfn_rqual (type
));
13188 memptr
= build_ptrmemfunc_type (build_pointer_type (method_type
));
13189 return cp_build_qualified_type_real (memptr
, cp_type_quals (t
),
13193 return cp_build_qualified_type_real (build_ptrmem_type (r
, type
),
13197 case FUNCTION_TYPE
:
13202 fntype
= tsubst_function_type (t
, args
, complain
, in_decl
);
13203 if (fntype
== error_mark_node
)
13204 return error_mark_node
;
13206 /* Substitute the exception specification. */
13207 specs
= tsubst_exception_specification (t
, args
, complain
,
13208 in_decl
, /*defer_ok*/true);
13209 if (specs
== error_mark_node
)
13210 return error_mark_node
;
13212 fntype
= build_exception_variant (fntype
, specs
);
13217 tree domain
= tsubst (TYPE_DOMAIN (t
), args
, complain
, in_decl
);
13218 if (domain
== error_mark_node
)
13219 return error_mark_node
;
13221 /* As an optimization, we avoid regenerating the array type if
13222 it will obviously be the same as T. */
13223 if (type
== TREE_TYPE (t
) && domain
== TYPE_DOMAIN (t
))
13226 /* These checks should match the ones in create_array_type_for_decl.
13230 The deduction may fail for any of the following reasons:
13232 -- Attempting to create an array with an element type that
13233 is void, a function type, or a reference type, or [DR337]
13234 an abstract class type. */
13235 if (VOID_TYPE_P (type
)
13236 || TREE_CODE (type
) == FUNCTION_TYPE
13237 || (TREE_CODE (type
) == ARRAY_TYPE
13238 && TYPE_DOMAIN (type
) == NULL_TREE
)
13239 || TREE_CODE (type
) == REFERENCE_TYPE
)
13241 if (complain
& tf_error
)
13242 error ("creating array of %qT", type
);
13243 return error_mark_node
;
13246 if (abstract_virtuals_error_sfinae (ACU_ARRAY
, type
, complain
))
13247 return error_mark_node
;
13249 r
= build_cplus_array_type (type
, domain
);
13251 if (TYPE_USER_ALIGN (t
))
13253 TYPE_ALIGN (r
) = TYPE_ALIGN (t
);
13254 TYPE_USER_ALIGN (r
) = 1;
13260 case TYPENAME_TYPE
:
13262 tree ctx
= tsubst_aggr_type (TYPE_CONTEXT (t
), args
, complain
,
13263 in_decl
, /*entering_scope=*/1);
13264 tree f
= tsubst_copy (TYPENAME_TYPE_FULLNAME (t
), args
,
13265 complain
, in_decl
);
13267 if (ctx
== error_mark_node
|| f
== error_mark_node
)
13268 return error_mark_node
;
13270 if (!MAYBE_CLASS_TYPE_P (ctx
))
13272 if (complain
& tf_error
)
13273 error ("%qT is not a class, struct, or union type", ctx
);
13274 return error_mark_node
;
13276 else if (!uses_template_parms (ctx
) && !TYPE_BEING_DEFINED (ctx
))
13278 /* Normally, make_typename_type does not require that the CTX
13279 have complete type in order to allow things like:
13281 template <class T> struct S { typename S<T>::X Y; };
13283 But, such constructs have already been resolved by this
13284 point, so here CTX really should have complete type, unless
13285 it's a partial instantiation. */
13286 ctx
= complete_type (ctx
);
13287 if (!COMPLETE_TYPE_P (ctx
))
13289 if (complain
& tf_error
)
13290 cxx_incomplete_type_error (NULL_TREE
, ctx
);
13291 return error_mark_node
;
13295 f
= make_typename_type (ctx
, f
, typename_type
,
13296 complain
| tf_keep_type_decl
);
13297 if (f
== error_mark_node
)
13299 if (TREE_CODE (f
) == TYPE_DECL
)
13301 complain
|= tf_ignore_bad_quals
;
13305 if (TREE_CODE (f
) != TYPENAME_TYPE
)
13307 if (TYPENAME_IS_ENUM_P (t
) && TREE_CODE (f
) != ENUMERAL_TYPE
)
13309 if (complain
& tf_error
)
13310 error ("%qT resolves to %qT, which is not an enumeration type",
13313 return error_mark_node
;
13315 else if (TYPENAME_IS_CLASS_P (t
) && !CLASS_TYPE_P (f
))
13317 if (complain
& tf_error
)
13318 error ("%qT resolves to %qT, which is is not a class type",
13321 return error_mark_node
;
13325 return cp_build_qualified_type_real
13326 (f
, cp_type_quals (f
) | cp_type_quals (t
), complain
);
13329 case UNBOUND_CLASS_TEMPLATE
:
13331 tree ctx
= tsubst_aggr_type (TYPE_CONTEXT (t
), args
, complain
,
13332 in_decl
, /*entering_scope=*/1);
13333 tree name
= TYPE_IDENTIFIER (t
);
13334 tree parm_list
= DECL_TEMPLATE_PARMS (TYPE_NAME (t
));
13336 if (ctx
== error_mark_node
|| name
== error_mark_node
)
13337 return error_mark_node
;
13340 parm_list
= tsubst_template_parms (parm_list
, args
, complain
);
13341 return make_unbound_class_template (ctx
, name
, parm_list
, complain
);
13348 ++cp_unevaluated_operand
;
13349 ++c_inhibit_evaluation_warnings
;
13351 type
= tsubst_expr (TYPEOF_TYPE_EXPR (t
), args
,
13353 /*integral_constant_expression_p=*/false);
13355 --cp_unevaluated_operand
;
13356 --c_inhibit_evaluation_warnings
;
13358 type
= finish_typeof (type
);
13359 return cp_build_qualified_type_real (type
,
13361 | cp_type_quals (type
),
13365 case DECLTYPE_TYPE
:
13369 ++cp_unevaluated_operand
;
13370 ++c_inhibit_evaluation_warnings
;
13372 type
= tsubst_copy_and_build (DECLTYPE_TYPE_EXPR (t
), args
,
13373 complain
|tf_decltype
, in_decl
,
13374 /*function_p*/false,
13375 /*integral_constant_expression*/false);
13377 --cp_unevaluated_operand
;
13378 --c_inhibit_evaluation_warnings
;
13380 if (DECLTYPE_FOR_LAMBDA_CAPTURE (t
))
13381 type
= lambda_capture_field_type (type
,
13382 DECLTYPE_FOR_INIT_CAPTURE (t
));
13383 else if (DECLTYPE_FOR_LAMBDA_PROXY (t
))
13384 type
= lambda_proxy_type (type
);
13387 bool id
= DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (t
);
13388 if (id
&& TREE_CODE (DECLTYPE_TYPE_EXPR (t
)) == BIT_NOT_EXPR
13390 /* In a template ~id could be either a complement expression
13391 or an unqualified-id naming a destructor; if instantiating
13392 it produces an expression, it's not an id-expression or
13395 type
= finish_decltype_type (type
, id
, complain
);
13397 return cp_build_qualified_type_real (type
,
13399 | cp_type_quals (type
),
13400 complain
| tf_ignore_bad_quals
);
13403 case UNDERLYING_TYPE
:
13405 tree type
= tsubst (UNDERLYING_TYPE_TYPE (t
), args
,
13406 complain
, in_decl
);
13407 return finish_underlying_type (type
);
13410 case TYPE_ARGUMENT_PACK
:
13411 case NONTYPE_ARGUMENT_PACK
:
13413 tree r
= TYPE_P (t
) ? cxx_make_type (code
) : make_node (code
);
13415 tsubst_template_args (ARGUMENT_PACK_ARGS (t
),
13419 SET_ARGUMENT_PACK_ARGS (r
, packed_out
);
13421 /* For template nontype argument packs, also substitute into
13423 if (code
== NONTYPE_ARGUMENT_PACK
)
13424 TREE_TYPE (r
) = tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
13443 /* We should use one of the expression tsubsts for these codes. */
13444 gcc_unreachable ();
13447 sorry ("use of %qs in template", get_tree_code_name (code
));
13448 return error_mark_node
;
13452 /* Like tsubst_expr for a BASELINK. OBJECT_TYPE, if non-NULL, is the
13453 type of the expression on the left-hand side of the "." or "->"
13457 tsubst_baselink (tree baselink
, tree object_type
,
13458 tree args
, tsubst_flags_t complain
, tree in_decl
)
13461 tree qualifying_scope
;
13464 tree template_args
= 0;
13465 bool template_id_p
= false;
13466 bool qualified
= BASELINK_QUALIFIED_P (baselink
);
13468 /* A baselink indicates a function from a base class. Both the
13469 BASELINK_ACCESS_BINFO and the base class referenced may
13470 indicate bases of the template class, rather than the
13471 instantiated class. In addition, lookups that were not
13472 ambiguous before may be ambiguous now. Therefore, we perform
13473 the lookup again. */
13474 qualifying_scope
= BINFO_TYPE (BASELINK_ACCESS_BINFO (baselink
));
13475 qualifying_scope
= tsubst (qualifying_scope
, args
,
13476 complain
, in_decl
);
13477 fns
= BASELINK_FUNCTIONS (baselink
);
13478 optype
= tsubst (BASELINK_OPTYPE (baselink
), args
, complain
, in_decl
);
13479 if (TREE_CODE (fns
) == TEMPLATE_ID_EXPR
)
13481 template_id_p
= true;
13482 template_args
= TREE_OPERAND (fns
, 1);
13483 fns
= TREE_OPERAND (fns
, 0);
13485 template_args
= tsubst_template_args (template_args
, args
,
13486 complain
, in_decl
);
13488 name
= DECL_NAME (get_first_fn (fns
));
13489 if (IDENTIFIER_TYPENAME_P (name
))
13490 name
= mangle_conv_op_name_for_type (optype
);
13491 baselink
= lookup_fnfields (qualifying_scope
, name
, /*protect=*/1);
13493 return error_mark_node
;
13495 /* If lookup found a single function, mark it as used at this
13496 point. (If it lookup found multiple functions the one selected
13497 later by overload resolution will be marked as used at that
13499 if (BASELINK_P (baselink
))
13500 fns
= BASELINK_FUNCTIONS (baselink
);
13501 if (!template_id_p
&& !really_overloaded_fn (fns
)
13502 && !mark_used (OVL_CURRENT (fns
), complain
) && !(complain
& tf_error
))
13503 return error_mark_node
;
13505 /* Add back the template arguments, if present. */
13506 if (BASELINK_P (baselink
) && template_id_p
)
13507 BASELINK_FUNCTIONS (baselink
)
13508 = build_nt (TEMPLATE_ID_EXPR
,
13509 BASELINK_FUNCTIONS (baselink
),
13511 /* Update the conversion operator type. */
13512 BASELINK_OPTYPE (baselink
) = optype
;
13515 object_type
= current_class_type
;
13518 baselink
= adjust_result_of_qualified_name_lookup (baselink
,
13524 /* Like tsubst_expr for a SCOPE_REF, given by QUALIFIED_ID. DONE is
13525 true if the qualified-id will be a postfix-expression in-and-of
13526 itself; false if more of the postfix-expression follows the
13527 QUALIFIED_ID. ADDRESS_P is true if the qualified-id is the operand
13531 tsubst_qualified_id (tree qualified_id
, tree args
,
13532 tsubst_flags_t complain
, tree in_decl
,
13533 bool done
, bool address_p
)
13539 tree template_args
;
13540 location_t loc
= UNKNOWN_LOCATION
;
13542 gcc_assert (TREE_CODE (qualified_id
) == SCOPE_REF
);
13544 /* Figure out what name to look up. */
13545 name
= TREE_OPERAND (qualified_id
, 1);
13546 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
13548 is_template
= true;
13549 loc
= EXPR_LOCATION (name
);
13550 template_args
= TREE_OPERAND (name
, 1);
13552 template_args
= tsubst_template_args (template_args
, args
,
13553 complain
, in_decl
);
13554 name
= TREE_OPERAND (name
, 0);
13558 is_template
= false;
13559 template_args
= NULL_TREE
;
13562 /* Substitute into the qualifying scope. When there are no ARGS, we
13563 are just trying to simplify a non-dependent expression. In that
13564 case the qualifying scope may be dependent, and, in any case,
13565 substituting will not help. */
13566 scope
= TREE_OPERAND (qualified_id
, 0);
13569 scope
= tsubst (scope
, args
, complain
, in_decl
);
13570 expr
= tsubst_copy (name
, args
, complain
, in_decl
);
13575 if (dependent_scope_p (scope
))
13578 expr
= build_min_nt_loc (loc
, TEMPLATE_ID_EXPR
, expr
, template_args
);
13579 return build_qualified_name (NULL_TREE
, scope
, expr
,
13580 QUALIFIED_NAME_IS_TEMPLATE (qualified_id
));
13583 if (!BASELINK_P (name
) && !DECL_P (expr
))
13585 if (TREE_CODE (expr
) == BIT_NOT_EXPR
)
13587 /* A BIT_NOT_EXPR is used to represent a destructor. */
13588 if (!check_dtor_name (scope
, TREE_OPERAND (expr
, 0)))
13590 error ("qualifying type %qT does not match destructor name ~%qT",
13591 scope
, TREE_OPERAND (expr
, 0));
13592 expr
= error_mark_node
;
13595 expr
= lookup_qualified_name (scope
, complete_dtor_identifier
,
13596 /*is_type_p=*/0, false);
13599 expr
= lookup_qualified_name (scope
, expr
, /*is_type_p=*/0, false);
13600 if (TREE_CODE (TREE_CODE (expr
) == TEMPLATE_DECL
13601 ? DECL_TEMPLATE_RESULT (expr
) : expr
) == TYPE_DECL
)
13603 if (complain
& tf_error
)
13605 error ("dependent-name %qE is parsed as a non-type, but "
13606 "instantiation yields a type", qualified_id
);
13607 inform (input_location
, "say %<typename %E%> if a type is meant", qualified_id
);
13609 return error_mark_node
;
13615 check_accessibility_of_qualified_id (expr
, /*object_type=*/NULL_TREE
,
13617 /* Remember that there was a reference to this entity. */
13618 if (!mark_used (expr
, complain
) && !(complain
& tf_error
))
13619 return error_mark_node
;
13622 if (expr
== error_mark_node
|| TREE_CODE (expr
) == TREE_LIST
)
13624 if (complain
& tf_error
)
13625 qualified_name_lookup_error (scope
,
13626 TREE_OPERAND (qualified_id
, 1),
13627 expr
, input_location
);
13628 return error_mark_node
;
13632 expr
= lookup_template_function (expr
, template_args
);
13634 if (expr
== error_mark_node
&& complain
& tf_error
)
13635 qualified_name_lookup_error (scope
, TREE_OPERAND (qualified_id
, 1),
13636 expr
, input_location
);
13637 else if (TYPE_P (scope
))
13639 expr
= (adjust_result_of_qualified_name_lookup
13640 (expr
, scope
, current_nonlambda_class_type ()));
13641 expr
= (finish_qualified_id_expr
13642 (scope
, expr
, done
, address_p
&& PTRMEM_OK_P (qualified_id
),
13643 QUALIFIED_NAME_IS_TEMPLATE (qualified_id
),
13644 /*template_arg_p=*/false, complain
));
13647 /* Expressions do not generally have reference type. */
13648 if (TREE_CODE (expr
) != SCOPE_REF
13649 /* However, if we're about to form a pointer-to-member, we just
13650 want the referenced member referenced. */
13651 && TREE_CODE (expr
) != OFFSET_REF
)
13652 expr
= convert_from_reference (expr
);
13657 /* tsubst the initializer for a VAR_DECL. INIT is the unsubstituted
13658 initializer, DECL is the substituted VAR_DECL. Other arguments are as
13662 tsubst_init (tree init
, tree decl
, tree args
,
13663 tsubst_flags_t complain
, tree in_decl
)
13668 init
= tsubst_expr (init
, args
, complain
, in_decl
, false);
13672 /* If we had an initializer but it
13673 instantiated to nothing,
13674 value-initialize the object. This will
13675 only occur when the initializer was a
13676 pack expansion where the parameter packs
13677 used in that expansion were of length
13679 init
= build_value_init (TREE_TYPE (decl
),
13681 if (TREE_CODE (init
) == AGGR_INIT_EXPR
)
13682 init
= get_target_expr_sfinae (init
, complain
);
13688 /* Like tsubst, but deals with expressions. This function just replaces
13689 template parms; to finish processing the resultant expression, use
13690 tsubst_copy_and_build or tsubst_expr. */
13693 tsubst_copy (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
13695 enum tree_code code
;
13698 if (t
== NULL_TREE
|| t
== error_mark_node
|| args
== NULL_TREE
)
13701 code
= TREE_CODE (t
);
13706 r
= retrieve_local_specialization (t
);
13708 if (r
== NULL_TREE
)
13710 /* We get here for a use of 'this' in an NSDMI. */
13711 if (DECL_NAME (t
) == this_identifier
13712 && current_function_decl
13713 && DECL_CONSTRUCTOR_P (current_function_decl
))
13714 return current_class_ptr
;
13716 /* This can happen for a parameter name used later in a function
13717 declaration (such as in a late-specified return type). Just
13718 make a dummy decl, since it's only used for its type. */
13719 gcc_assert (cp_unevaluated_operand
!= 0);
13720 r
= tsubst_decl (t
, args
, complain
);
13721 /* Give it the template pattern as its context; its true context
13722 hasn't been instantiated yet and this is good enough for
13724 DECL_CONTEXT (r
) = DECL_CONTEXT (t
);
13727 if (TREE_CODE (r
) == ARGUMENT_PACK_SELECT
)
13728 r
= ARGUMENT_PACK_SELECT_ARG (r
);
13729 if (!mark_used (r
, complain
) && !(complain
& tf_error
))
13730 return error_mark_node
;
13738 if (DECL_TEMPLATE_PARM_P (t
))
13739 return tsubst_copy (DECL_INITIAL (t
), args
, complain
, in_decl
);
13740 /* There is no need to substitute into namespace-scope
13742 if (DECL_NAMESPACE_SCOPE_P (t
))
13744 /* If ARGS is NULL, then T is known to be non-dependent. */
13745 if (args
== NULL_TREE
)
13746 return scalar_constant_value (t
);
13748 /* Unfortunately, we cannot just call lookup_name here.
13751 template <int I> int f() {
13753 struct S { void g() { E e = a; } };
13756 When we instantiate f<7>::S::g(), say, lookup_name is not
13757 clever enough to find f<7>::a. */
13759 = tsubst_aggr_type (DECL_CONTEXT (t
), args
, complain
, in_decl
,
13760 /*entering_scope=*/0);
13762 for (v
= TYPE_VALUES (enum_type
);
13764 v
= TREE_CHAIN (v
))
13765 if (TREE_PURPOSE (v
) == DECL_NAME (t
))
13766 return TREE_VALUE (v
);
13768 /* We didn't find the name. That should never happen; if
13769 name-lookup found it during preliminary parsing, we
13770 should find it again here during instantiation. */
13771 gcc_unreachable ();
13776 if (PACK_EXPANSION_P (TREE_TYPE (t
)))
13778 /* Check for a local specialization set up by
13779 tsubst_pack_expansion. */
13780 if (tree r
= retrieve_local_specialization (t
))
13782 if (TREE_CODE (r
) == ARGUMENT_PACK_SELECT
)
13783 r
= ARGUMENT_PACK_SELECT_ARG (r
);
13787 /* When retrieving a capture pack from a generic lambda, remove the
13788 lambda call op's own template argument list from ARGS. Only the
13789 template arguments active for the closure type should be used to
13790 retrieve the pack specialization. */
13791 if (LAMBDA_FUNCTION_P (current_function_decl
)
13792 && (template_class_depth (DECL_CONTEXT (t
))
13793 != TMPL_ARGS_DEPTH (args
)))
13794 args
= strip_innermost_template_args (args
, 1);
13796 /* Otherwise return the full NONTYPE_ARGUMENT_PACK that
13797 tsubst_decl put in the hash table. */
13798 return retrieve_specialization (t
, args
, 0);
13801 if (DECL_CONTEXT (t
))
13805 ctx
= tsubst_aggr_type (DECL_CONTEXT (t
), args
, complain
, in_decl
,
13806 /*entering_scope=*/1);
13807 if (ctx
!= DECL_CONTEXT (t
))
13809 tree r
= lookup_field (ctx
, DECL_NAME (t
), 0, false);
13812 if (complain
& tf_error
)
13813 error ("using invalid field %qD", t
);
13814 return error_mark_node
;
13823 case FUNCTION_DECL
:
13824 if (DECL_LANG_SPECIFIC (t
) && DECL_TEMPLATE_INFO (t
))
13825 r
= tsubst (t
, args
, complain
, in_decl
);
13826 else if (local_variable_p (t
))
13828 r
= retrieve_local_specialization (t
);
13829 if (r
== NULL_TREE
)
13831 /* First try name lookup to find the instantiation. */
13832 r
= lookup_name (DECL_NAME (t
));
13835 /* Make sure that the one we found is the one we want. */
13836 tree ctx
= DECL_CONTEXT (t
);
13837 if (DECL_LANG_SPECIFIC (ctx
) && DECL_TEMPLATE_INFO (ctx
))
13838 ctx
= tsubst (ctx
, args
, complain
, in_decl
);
13839 if (ctx
!= DECL_CONTEXT (r
))
13847 /* This can happen for a variable used in a
13848 late-specified return type of a local lambda, or for a
13849 local static or constant. Building a new VAR_DECL
13850 should be OK in all those cases. */
13851 r
= tsubst_decl (t
, args
, complain
);
13852 if (decl_maybe_constant_var_p (r
))
13854 /* We can't call cp_finish_decl, so handle the
13855 initializer by hand. */
13856 tree init
= tsubst_init (DECL_INITIAL (t
), r
, args
,
13857 complain
, in_decl
);
13858 if (!processing_template_decl
)
13859 init
= maybe_constant_init (init
);
13860 if (processing_template_decl
13861 ? potential_constant_expression (init
)
13862 : reduced_constant_expression_p (init
))
13863 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (r
)
13864 = TREE_CONSTANT (r
) = true;
13865 DECL_INITIAL (r
) = init
;
13867 gcc_assert (cp_unevaluated_operand
|| TREE_STATIC (r
)
13868 || decl_constant_var_p (r
)
13869 || errorcount
|| sorrycount
);
13870 if (!processing_template_decl
)
13872 if (TREE_STATIC (r
))
13873 rest_of_decl_compilation (r
, toplevel_bindings_p (),
13876 r
= process_outer_var_ref (r
, complain
);
13879 /* Remember this for subsequent uses. */
13880 if (local_specializations
)
13881 register_local_specialization (r
, t
);
13886 if (!mark_used (r
, complain
) && !(complain
& tf_error
))
13887 return error_mark_node
;
13890 case NAMESPACE_DECL
:
13894 /* An OVERLOAD will always be a non-dependent overload set; an
13895 overload set from function scope will just be represented with an
13896 IDENTIFIER_NODE, and from class scope with a BASELINK. */
13897 gcc_assert (!uses_template_parms (t
));
13901 return tsubst_baselink (t
, current_nonlambda_class_type (),
13902 args
, complain
, in_decl
);
13904 case TEMPLATE_DECL
:
13905 if (DECL_TEMPLATE_TEMPLATE_PARM_P (t
))
13906 return tsubst (TREE_TYPE (DECL_TEMPLATE_RESULT (t
)),
13907 args
, complain
, in_decl
);
13908 else if (DECL_FUNCTION_TEMPLATE_P (t
) && DECL_MEMBER_TEMPLATE_P (t
))
13909 return tsubst (t
, args
, complain
, in_decl
);
13910 else if (DECL_CLASS_SCOPE_P (t
)
13911 && uses_template_parms (DECL_CONTEXT (t
)))
13913 /* Template template argument like the following example need
13916 template <template <class> class TT> struct C {};
13917 template <class T> struct D {
13918 template <class U> struct E {};
13923 We are processing the template argument `E' in #1 for
13924 the template instantiation #2. Originally, `E' is a
13925 TEMPLATE_DECL with `D<T>' as its DECL_CONTEXT. Now we
13926 have to substitute this with one having context `D<int>'. */
13928 tree context
= tsubst (DECL_CONTEXT (t
), args
, complain
, in_decl
);
13929 return lookup_field (context
, DECL_NAME(t
), 0, false);
13932 /* Ordinary template template argument. */
13936 case REINTERPRET_CAST_EXPR
:
13937 case CONST_CAST_EXPR
:
13938 case STATIC_CAST_EXPR
:
13939 case DYNAMIC_CAST_EXPR
:
13940 case IMPLICIT_CONV_EXPR
:
13944 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
13945 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
13946 return build1 (code
, type
, op0
);
13950 if (PACK_EXPANSION_P (TREE_OPERAND (t
, 0)))
13953 tree expanded
, op
= TREE_OPERAND (t
, 0);
13956 if (SIZEOF_EXPR_TYPE_P (t
))
13957 op
= TREE_TYPE (op
);
13959 ++cp_unevaluated_operand
;
13960 ++c_inhibit_evaluation_warnings
;
13961 /* We only want to compute the number of arguments. */
13962 expanded
= tsubst_pack_expansion (op
, args
, complain
, in_decl
);
13963 --cp_unevaluated_operand
;
13964 --c_inhibit_evaluation_warnings
;
13966 if (TREE_CODE (expanded
) == TREE_VEC
)
13967 len
= TREE_VEC_LENGTH (expanded
);
13969 if (expanded
== error_mark_node
)
13970 return error_mark_node
;
13971 else if (PACK_EXPANSION_P (expanded
)
13972 || (TREE_CODE (expanded
) == TREE_VEC
13974 && PACK_EXPANSION_P (TREE_VEC_ELT (expanded
, len
-1))))
13976 if (TREE_CODE (expanded
) == TREE_VEC
)
13977 expanded
= TREE_VEC_ELT (expanded
, len
- 1);
13979 if (TYPE_P (expanded
))
13980 return cxx_sizeof_or_alignof_type (expanded
, SIZEOF_EXPR
,
13981 complain
& tf_error
);
13983 return cxx_sizeof_or_alignof_expr (expanded
, SIZEOF_EXPR
,
13984 complain
& tf_error
);
13987 return build_int_cst (size_type_node
, len
);
13989 if (SIZEOF_EXPR_TYPE_P (t
))
13991 r
= tsubst (TREE_TYPE (TREE_OPERAND (t
, 0)),
13992 args
, complain
, in_decl
);
13993 r
= build1 (NOP_EXPR
, r
, error_mark_node
);
13994 r
= build1 (SIZEOF_EXPR
,
13995 tsubst (TREE_TYPE (t
), args
, complain
, in_decl
), r
);
13996 SIZEOF_EXPR_TYPE_P (r
) = 1;
14003 case TRUTH_NOT_EXPR
:
14006 case UNARY_PLUS_EXPR
: /* Unary + */
14008 case AT_ENCODE_EXPR
:
14012 case REALPART_EXPR
:
14013 case IMAGPART_EXPR
:
14016 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
14017 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
14018 return build1 (code
, type
, op0
);
14021 case COMPONENT_REF
:
14026 object
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
14027 name
= TREE_OPERAND (t
, 1);
14028 if (TREE_CODE (name
) == BIT_NOT_EXPR
)
14030 name
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
14031 complain
, in_decl
);
14032 name
= build1 (BIT_NOT_EXPR
, NULL_TREE
, name
);
14034 else if (TREE_CODE (name
) == SCOPE_REF
14035 && TREE_CODE (TREE_OPERAND (name
, 1)) == BIT_NOT_EXPR
)
14037 tree base
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
14038 complain
, in_decl
);
14039 name
= TREE_OPERAND (name
, 1);
14040 name
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
14041 complain
, in_decl
);
14042 name
= build1 (BIT_NOT_EXPR
, NULL_TREE
, name
);
14043 name
= build_qualified_name (/*type=*/NULL_TREE
,
14045 /*template_p=*/false);
14047 else if (BASELINK_P (name
))
14048 name
= tsubst_baselink (name
,
14049 non_reference (TREE_TYPE (object
)),
14053 name
= tsubst_copy (name
, args
, complain
, in_decl
);
14054 return build_nt (COMPONENT_REF
, object
, name
, NULL_TREE
);
14060 case TRUNC_DIV_EXPR
:
14061 case CEIL_DIV_EXPR
:
14062 case FLOOR_DIV_EXPR
:
14063 case ROUND_DIV_EXPR
:
14064 case EXACT_DIV_EXPR
:
14068 case TRUNC_MOD_EXPR
:
14069 case FLOOR_MOD_EXPR
:
14070 case TRUTH_ANDIF_EXPR
:
14071 case TRUTH_ORIF_EXPR
:
14072 case TRUTH_AND_EXPR
:
14073 case TRUTH_OR_EXPR
:
14086 case COMPOUND_EXPR
:
14089 case PREDECREMENT_EXPR
:
14090 case PREINCREMENT_EXPR
:
14091 case POSTDECREMENT_EXPR
:
14092 case POSTINCREMENT_EXPR
:
14094 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
14095 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
14096 return build_nt (code
, op0
, op1
);
14101 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
14102 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
14103 return build_qualified_name (/*type=*/NULL_TREE
, op0
, op1
,
14104 QUALIFIED_NAME_IS_TEMPLATE (t
));
14109 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
14110 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
14111 return build_nt (ARRAY_REF
, op0
, op1
, NULL_TREE
, NULL_TREE
);
14116 int n
= VL_EXP_OPERAND_LENGTH (t
);
14117 tree result
= build_vl_exp (CALL_EXPR
, n
);
14119 for (i
= 0; i
< n
; i
++)
14120 TREE_OPERAND (t
, i
) = tsubst_copy (TREE_OPERAND (t
, i
), args
,
14121 complain
, in_decl
);
14127 case PSEUDO_DTOR_EXPR
:
14128 case VEC_PERM_EXPR
:
14130 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
14131 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
14132 tree op2
= tsubst_copy (TREE_OPERAND (t
, 2), args
, complain
, in_decl
);
14133 r
= build_nt (code
, op0
, op1
, op2
);
14134 TREE_NO_WARNING (r
) = TREE_NO_WARNING (t
);
14140 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
14141 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
14142 tree op2
= tsubst_copy (TREE_OPERAND (t
, 2), args
, complain
, in_decl
);
14143 r
= build_nt (code
, op0
, op1
, op2
);
14144 NEW_EXPR_USE_GLOBAL (r
) = NEW_EXPR_USE_GLOBAL (t
);
14150 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
14151 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
14152 r
= build_nt (code
, op0
, op1
);
14153 DELETE_EXPR_USE_GLOBAL (r
) = DELETE_EXPR_USE_GLOBAL (t
);
14154 DELETE_EXPR_USE_VEC (r
) = DELETE_EXPR_USE_VEC (t
);
14158 case TEMPLATE_ID_EXPR
:
14160 /* Substituted template arguments */
14161 tree fn
= TREE_OPERAND (t
, 0);
14162 tree targs
= TREE_OPERAND (t
, 1);
14164 fn
= tsubst_copy (fn
, args
, complain
, in_decl
);
14166 targs
= tsubst_template_args (targs
, args
, complain
, in_decl
);
14168 return lookup_template_function (fn
, targs
);
14173 tree purpose
, value
, chain
;
14175 if (t
== void_list_node
)
14178 purpose
= TREE_PURPOSE (t
);
14180 purpose
= tsubst_copy (purpose
, args
, complain
, in_decl
);
14181 value
= TREE_VALUE (t
);
14183 value
= tsubst_copy (value
, args
, complain
, in_decl
);
14184 chain
= TREE_CHAIN (t
);
14185 if (chain
&& chain
!= void_type_node
)
14186 chain
= tsubst_copy (chain
, args
, complain
, in_decl
);
14187 if (purpose
== TREE_PURPOSE (t
)
14188 && value
== TREE_VALUE (t
)
14189 && chain
== TREE_CHAIN (t
))
14191 return tree_cons (purpose
, value
, chain
);
14196 case ENUMERAL_TYPE
:
14198 case TEMPLATE_TYPE_PARM
:
14199 case TEMPLATE_TEMPLATE_PARM
:
14200 case BOUND_TEMPLATE_TEMPLATE_PARM
:
14201 case TEMPLATE_PARM_INDEX
:
14203 case REFERENCE_TYPE
:
14205 case FUNCTION_TYPE
:
14208 case TYPENAME_TYPE
:
14209 case UNBOUND_CLASS_TEMPLATE
:
14211 case DECLTYPE_TYPE
:
14213 return tsubst (t
, args
, complain
, in_decl
);
14217 /* Fall through. */
14218 case IDENTIFIER_NODE
:
14219 if (IDENTIFIER_TYPENAME_P (t
))
14221 tree new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
14222 return mangle_conv_op_name_for_type (new_type
);
14228 /* This is handled by tsubst_copy_and_build. */
14229 gcc_unreachable ();
14233 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
14234 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
14235 return build_x_va_arg (EXPR_LOCATION (t
), op0
, type
);
14238 case CLEANUP_POINT_EXPR
:
14239 /* We shouldn't have built any of these during initial template
14240 generation. Instead, they should be built during instantiation
14241 in response to the saved STMT_IS_FULL_EXPR_P setting. */
14242 gcc_unreachable ();
14246 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
14247 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
14248 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
14249 r
= build2 (code
, type
, op0
, op1
);
14250 PTRMEM_OK_P (r
) = PTRMEM_OK_P (t
);
14251 if (!mark_used (TREE_OPERAND (r
, 1), complain
)
14252 && !(complain
& tf_error
))
14253 return error_mark_node
;
14257 case EXPR_PACK_EXPANSION
:
14258 error ("invalid use of pack expansion expression");
14259 return error_mark_node
;
14261 case NONTYPE_ARGUMENT_PACK
:
14262 error ("use %<...%> to expand argument pack");
14263 return error_mark_node
;
14266 gcc_checking_assert (t
== void_node
&& VOID_TYPE_P (TREE_TYPE (t
)));
14274 /* Instantiate any typedefs in the type. */
14275 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
14276 r
= fold_convert (type
, t
);
14277 gcc_assert (TREE_CODE (r
) == code
);
14282 /* These can sometimes show up in a partial instantiation, but never
14283 involve template parms. */
14284 gcc_assert (!uses_template_parms (t
));
14287 case UNARY_LEFT_FOLD_EXPR
:
14288 return tsubst_unary_left_fold (t
, args
, complain
, in_decl
);
14289 case UNARY_RIGHT_FOLD_EXPR
:
14290 return tsubst_unary_right_fold (t
, args
, complain
, in_decl
);
14291 case BINARY_LEFT_FOLD_EXPR
:
14292 return tsubst_binary_left_fold (t
, args
, complain
, in_decl
);
14293 case BINARY_RIGHT_FOLD_EXPR
:
14294 return tsubst_binary_right_fold (t
, args
, complain
, in_decl
);
14297 /* We shouldn't get here, but keep going if !ENABLE_CHECKING. */
14298 gcc_checking_assert (false);
14303 /* Helper function for tsubst_omp_clauses, used for instantiation of
14304 OMP_CLAUSE_DECL of clauses. */
14307 tsubst_omp_clause_decl (tree decl
, tree args
, tsubst_flags_t complain
,
14310 if (decl
== NULL_TREE
)
14313 /* Handle an OpenMP array section represented as a TREE_LIST (or
14314 OMP_CLAUSE_DEPEND_KIND). An OMP_CLAUSE_DEPEND (with a depend
14315 kind of OMP_CLAUSE_DEPEND_SINK) can also be represented as a
14316 TREE_LIST. We can handle it exactly the same as an array section
14317 (purpose, value, and a chain), even though the nomenclature
14318 (low_bound, length, etc) is different. */
14319 if (TREE_CODE (decl
) == TREE_LIST
)
14322 = tsubst_expr (TREE_PURPOSE (decl
), args
, complain
, in_decl
,
14323 /*integral_constant_expression_p=*/false);
14324 tree length
= tsubst_expr (TREE_VALUE (decl
), args
, complain
, in_decl
,
14325 /*integral_constant_expression_p=*/false);
14326 tree chain
= tsubst_omp_clause_decl (TREE_CHAIN (decl
), args
, complain
,
14328 if (TREE_PURPOSE (decl
) == low_bound
14329 && TREE_VALUE (decl
) == length
14330 && TREE_CHAIN (decl
) == chain
)
14332 tree ret
= tree_cons (low_bound
, length
, chain
);
14333 OMP_CLAUSE_DEPEND_SINK_NEGATIVE (ret
)
14334 = OMP_CLAUSE_DEPEND_SINK_NEGATIVE (decl
);
14337 tree ret
= tsubst_expr (decl
, args
, complain
, in_decl
,
14338 /*integral_constant_expression_p=*/false);
14339 /* Undo convert_from_reference tsubst_expr could have called. */
14341 && REFERENCE_REF_P (ret
)
14342 && !REFERENCE_REF_P (decl
))
14343 ret
= TREE_OPERAND (ret
, 0);
14347 /* Like tsubst_copy, but specifically for OpenMP clauses. */
14350 tsubst_omp_clauses (tree clauses
, bool declare_simd
, bool allow_fields
,
14351 tree args
, tsubst_flags_t complain
, tree in_decl
)
14353 tree new_clauses
= NULL_TREE
, nc
, oc
;
14354 tree linear_no_step
= NULL_TREE
;
14356 for (oc
= clauses
; oc
; oc
= OMP_CLAUSE_CHAIN (oc
))
14358 nc
= copy_node (oc
);
14359 OMP_CLAUSE_CHAIN (nc
) = new_clauses
;
14362 switch (OMP_CLAUSE_CODE (nc
))
14364 case OMP_CLAUSE_LASTPRIVATE
:
14365 if (OMP_CLAUSE_LASTPRIVATE_STMT (oc
))
14367 OMP_CLAUSE_LASTPRIVATE_STMT (nc
) = push_stmt_list ();
14368 tsubst_expr (OMP_CLAUSE_LASTPRIVATE_STMT (oc
), args
, complain
,
14369 in_decl
, /*integral_constant_expression_p=*/false);
14370 OMP_CLAUSE_LASTPRIVATE_STMT (nc
)
14371 = pop_stmt_list (OMP_CLAUSE_LASTPRIVATE_STMT (nc
));
14374 case OMP_CLAUSE_PRIVATE
:
14375 case OMP_CLAUSE_SHARED
:
14376 case OMP_CLAUSE_FIRSTPRIVATE
:
14377 case OMP_CLAUSE_COPYIN
:
14378 case OMP_CLAUSE_COPYPRIVATE
:
14379 case OMP_CLAUSE_UNIFORM
:
14380 case OMP_CLAUSE_DEPEND
:
14381 case OMP_CLAUSE_FROM
:
14382 case OMP_CLAUSE_TO
:
14383 case OMP_CLAUSE_MAP
:
14384 case OMP_CLAUSE_USE_DEVICE_PTR
:
14385 case OMP_CLAUSE_IS_DEVICE_PTR
:
14386 OMP_CLAUSE_DECL (nc
)
14387 = tsubst_omp_clause_decl (OMP_CLAUSE_DECL (oc
), args
, complain
,
14390 case OMP_CLAUSE_IF
:
14391 case OMP_CLAUSE_NUM_THREADS
:
14392 case OMP_CLAUSE_SCHEDULE
:
14393 case OMP_CLAUSE_COLLAPSE
:
14394 case OMP_CLAUSE_FINAL
:
14395 case OMP_CLAUSE_DEVICE
:
14396 case OMP_CLAUSE_DIST_SCHEDULE
:
14397 case OMP_CLAUSE_NUM_TEAMS
:
14398 case OMP_CLAUSE_THREAD_LIMIT
:
14399 case OMP_CLAUSE_SAFELEN
:
14400 case OMP_CLAUSE_SIMDLEN
:
14401 case OMP_CLAUSE_NUM_TASKS
:
14402 case OMP_CLAUSE_GRAINSIZE
:
14403 case OMP_CLAUSE_PRIORITY
:
14404 case OMP_CLAUSE_ORDERED
:
14405 case OMP_CLAUSE_HINT
:
14406 OMP_CLAUSE_OPERAND (nc
, 0)
14407 = tsubst_expr (OMP_CLAUSE_OPERAND (oc
, 0), args
, complain
,
14408 in_decl
, /*integral_constant_expression_p=*/false);
14410 case OMP_CLAUSE_REDUCTION
:
14411 if (OMP_CLAUSE_REDUCTION_PLACEHOLDER (oc
))
14413 tree placeholder
= OMP_CLAUSE_REDUCTION_PLACEHOLDER (oc
);
14414 if (TREE_CODE (placeholder
) == SCOPE_REF
)
14416 tree scope
= tsubst (TREE_OPERAND (placeholder
, 0), args
,
14417 complain
, in_decl
);
14418 OMP_CLAUSE_REDUCTION_PLACEHOLDER (nc
)
14419 = build_qualified_name (NULL_TREE
, scope
,
14420 TREE_OPERAND (placeholder
, 1),
14424 gcc_assert (identifier_p (placeholder
));
14426 OMP_CLAUSE_DECL (nc
)
14427 = tsubst_omp_clause_decl (OMP_CLAUSE_DECL (oc
), args
, complain
,
14430 case OMP_CLAUSE_LINEAR
:
14431 case OMP_CLAUSE_ALIGNED
:
14432 OMP_CLAUSE_DECL (nc
)
14433 = tsubst_omp_clause_decl (OMP_CLAUSE_DECL (oc
), args
, complain
,
14435 OMP_CLAUSE_OPERAND (nc
, 1)
14436 = tsubst_expr (OMP_CLAUSE_OPERAND (oc
, 1), args
, complain
,
14437 in_decl
, /*integral_constant_expression_p=*/false);
14438 if (OMP_CLAUSE_CODE (oc
) == OMP_CLAUSE_LINEAR
14439 && OMP_CLAUSE_LINEAR_STEP (oc
) == NULL_TREE
)
14441 gcc_assert (!linear_no_step
);
14442 linear_no_step
= nc
;
14445 case OMP_CLAUSE_NOWAIT
:
14446 case OMP_CLAUSE_DEFAULT
:
14447 case OMP_CLAUSE_UNTIED
:
14448 case OMP_CLAUSE_MERGEABLE
:
14449 case OMP_CLAUSE_INBRANCH
:
14450 case OMP_CLAUSE_NOTINBRANCH
:
14451 case OMP_CLAUSE_PROC_BIND
:
14452 case OMP_CLAUSE_FOR
:
14453 case OMP_CLAUSE_PARALLEL
:
14454 case OMP_CLAUSE_SECTIONS
:
14455 case OMP_CLAUSE_TASKGROUP
:
14456 case OMP_CLAUSE_NOGROUP
:
14457 case OMP_CLAUSE_THREADS
:
14458 case OMP_CLAUSE_SIMD
:
14459 case OMP_CLAUSE_DEFAULTMAP
:
14462 gcc_unreachable ();
14465 switch (OMP_CLAUSE_CODE (nc
))
14467 case OMP_CLAUSE_PRIVATE
:
14468 case OMP_CLAUSE_FIRSTPRIVATE
:
14469 case OMP_CLAUSE_LASTPRIVATE
:
14470 case OMP_CLAUSE_COPYPRIVATE
:
14471 case OMP_CLAUSE_LINEAR
:
14472 case OMP_CLAUSE_REDUCTION
:
14473 case OMP_CLAUSE_USE_DEVICE_PTR
:
14474 case OMP_CLAUSE_IS_DEVICE_PTR
:
14475 /* tsubst_expr on SCOPE_REF results in returning
14476 finish_non_static_data_member result. Undo that here. */
14477 if (TREE_CODE (OMP_CLAUSE_DECL (oc
)) == SCOPE_REF
14478 && (TREE_CODE (TREE_OPERAND (OMP_CLAUSE_DECL (oc
), 1))
14479 == IDENTIFIER_NODE
))
14481 tree t
= OMP_CLAUSE_DECL (nc
);
14484 switch (TREE_CODE (v
))
14486 case COMPONENT_REF
:
14490 case POINTER_PLUS_EXPR
:
14491 v
= TREE_OPERAND (v
, 0);
14494 if (DECL_CONTEXT (v
) == current_function_decl
14495 && DECL_ARTIFICIAL (v
)
14496 && DECL_NAME (v
) == this_identifier
)
14497 OMP_CLAUSE_DECL (nc
) = TREE_OPERAND (t
, 1);
14504 else if (VAR_P (OMP_CLAUSE_DECL (oc
))
14505 && DECL_HAS_VALUE_EXPR_P (OMP_CLAUSE_DECL (oc
))
14506 && DECL_ARTIFICIAL (OMP_CLAUSE_DECL (oc
))
14507 && DECL_LANG_SPECIFIC (OMP_CLAUSE_DECL (oc
))
14508 && DECL_OMP_PRIVATIZED_MEMBER (OMP_CLAUSE_DECL (oc
)))
14510 tree decl
= OMP_CLAUSE_DECL (nc
);
14513 if (!DECL_LANG_SPECIFIC (decl
))
14514 retrofit_lang_decl (decl
);
14515 DECL_OMP_PRIVATIZED_MEMBER (decl
) = 1;
14524 new_clauses
= nreverse (new_clauses
);
14527 new_clauses
= finish_omp_clauses (new_clauses
, allow_fields
);
14528 if (linear_no_step
)
14529 for (nc
= new_clauses
; nc
; nc
= OMP_CLAUSE_CHAIN (nc
))
14530 if (nc
== linear_no_step
)
14532 OMP_CLAUSE_LINEAR_STEP (nc
) = NULL_TREE
;
14536 return new_clauses
;
14539 /* Like tsubst_copy_and_build, but unshare TREE_LIST nodes. */
14542 tsubst_copy_asm_operands (tree t
, tree args
, tsubst_flags_t complain
,
14545 #define RECUR(t) tsubst_copy_asm_operands (t, args, complain, in_decl)
14547 tree purpose
, value
, chain
;
14552 if (TREE_CODE (t
) != TREE_LIST
)
14553 return tsubst_copy_and_build (t
, args
, complain
, in_decl
,
14554 /*function_p=*/false,
14555 /*integral_constant_expression_p=*/false);
14557 if (t
== void_list_node
)
14560 purpose
= TREE_PURPOSE (t
);
14562 purpose
= RECUR (purpose
);
14563 value
= TREE_VALUE (t
);
14566 if (TREE_CODE (value
) != LABEL_DECL
)
14567 value
= RECUR (value
);
14570 value
= lookup_label (DECL_NAME (value
));
14571 gcc_assert (TREE_CODE (value
) == LABEL_DECL
);
14572 TREE_USED (value
) = 1;
14575 chain
= TREE_CHAIN (t
);
14576 if (chain
&& chain
!= void_type_node
)
14577 chain
= RECUR (chain
);
14578 return tree_cons (purpose
, value
, chain
);
14582 /* Used to temporarily communicate the list of #pragma omp parallel
14583 clauses to #pragma omp for instantiation if they are combined
14586 static tree
*omp_parallel_combined_clauses
;
14588 /* Substitute one OMP_FOR iterator. */
14591 tsubst_omp_for_iterator (tree t
, int i
, tree declv
, tree orig_declv
,
14592 tree initv
, tree condv
, tree incrv
, tree
*clauses
,
14593 tree args
, tsubst_flags_t complain
, tree in_decl
,
14594 bool integral_constant_expression_p
)
14596 #define RECUR(NODE) \
14597 tsubst_expr ((NODE), args, complain, in_decl, \
14598 integral_constant_expression_p)
14599 tree decl
, init
, cond
, incr
;
14601 init
= TREE_VEC_ELT (OMP_FOR_INIT (t
), i
);
14602 gcc_assert (TREE_CODE (init
) == MODIFY_EXPR
);
14604 if (orig_declv
&& OMP_FOR_ORIG_DECLS (t
))
14606 tree o
= TREE_VEC_ELT (OMP_FOR_ORIG_DECLS (t
), i
);
14607 TREE_VEC_ELT (orig_declv
, i
) = RECUR (o
);
14610 decl
= TREE_OPERAND (init
, 0);
14611 init
= TREE_OPERAND (init
, 1);
14612 tree decl_expr
= NULL_TREE
;
14613 if (init
&& TREE_CODE (init
) == DECL_EXPR
)
14615 /* We need to jump through some hoops to handle declarations in the
14616 for-init-statement, since we might need to handle auto deduction,
14617 but we need to keep control of initialization. */
14619 init
= DECL_INITIAL (DECL_EXPR_DECL (init
));
14620 decl
= tsubst_decl (decl
, args
, complain
);
14624 if (TREE_CODE (decl
) == SCOPE_REF
)
14626 decl
= RECUR (decl
);
14627 if (TREE_CODE (decl
) == COMPONENT_REF
)
14631 switch (TREE_CODE (v
))
14633 case COMPONENT_REF
:
14637 case POINTER_PLUS_EXPR
:
14638 v
= TREE_OPERAND (v
, 0);
14641 if (DECL_CONTEXT (v
) == current_function_decl
14642 && DECL_ARTIFICIAL (v
)
14643 && DECL_NAME (v
) == this_identifier
)
14645 decl
= TREE_OPERAND (decl
, 1);
14646 decl
= omp_privatize_field (decl
);
14656 decl
= RECUR (decl
);
14658 init
= RECUR (init
);
14660 tree auto_node
= type_uses_auto (TREE_TYPE (decl
));
14661 if (auto_node
&& init
)
14663 = do_auto_deduction (TREE_TYPE (decl
), init
, auto_node
);
14665 gcc_assert (!type_dependent_expression_p (decl
));
14667 if (!CLASS_TYPE_P (TREE_TYPE (decl
)))
14671 /* Declare the variable, but don't let that initialize it. */
14672 tree init_sav
= DECL_INITIAL (DECL_EXPR_DECL (decl_expr
));
14673 DECL_INITIAL (DECL_EXPR_DECL (decl_expr
)) = NULL_TREE
;
14675 DECL_INITIAL (DECL_EXPR_DECL (decl_expr
)) = init_sav
;
14678 cond
= RECUR (TREE_VEC_ELT (OMP_FOR_COND (t
), i
));
14679 incr
= TREE_VEC_ELT (OMP_FOR_INCR (t
), i
);
14680 if (TREE_CODE (incr
) == MODIFY_EXPR
)
14682 tree lhs
= RECUR (TREE_OPERAND (incr
, 0));
14683 tree rhs
= RECUR (TREE_OPERAND (incr
, 1));
14684 incr
= build_x_modify_expr (EXPR_LOCATION (incr
), lhs
,
14685 NOP_EXPR
, rhs
, complain
);
14688 incr
= RECUR (incr
);
14689 TREE_VEC_ELT (declv
, i
) = decl
;
14690 TREE_VEC_ELT (initv
, i
) = init
;
14691 TREE_VEC_ELT (condv
, i
) = cond
;
14692 TREE_VEC_ELT (incrv
, i
) = incr
;
14698 /* Declare and initialize the variable. */
14706 for (j
= (omp_parallel_combined_clauses
== NULL
? 1 : 0); j
< 2; j
++)
14708 for (pc
= j
? clauses
: omp_parallel_combined_clauses
; *pc
; )
14710 if (OMP_CLAUSE_CODE (*pc
) == OMP_CLAUSE_PRIVATE
14711 && OMP_CLAUSE_DECL (*pc
) == decl
)
14713 else if (OMP_CLAUSE_CODE (*pc
) == OMP_CLAUSE_LASTPRIVATE
14714 && OMP_CLAUSE_DECL (*pc
) == decl
)
14718 /* Move lastprivate (decl) clause to OMP_FOR_CLAUSES. */
14720 *pc
= OMP_CLAUSE_CHAIN (c
);
14721 OMP_CLAUSE_CHAIN (c
) = *clauses
;
14724 else if (OMP_CLAUSE_CODE (*pc
) == OMP_CLAUSE_FIRSTPRIVATE
14725 && OMP_CLAUSE_DECL (*pc
) == decl
)
14727 error ("iteration variable %qD should not be firstprivate",
14729 *pc
= OMP_CLAUSE_CHAIN (*pc
);
14731 else if (OMP_CLAUSE_CODE (*pc
) == OMP_CLAUSE_REDUCTION
14732 && OMP_CLAUSE_DECL (*pc
) == decl
)
14734 error ("iteration variable %qD should not be reduction",
14736 *pc
= OMP_CLAUSE_CHAIN (*pc
);
14739 pc
= &OMP_CLAUSE_CHAIN (*pc
);
14744 if (*pc
== NULL_TREE
)
14746 tree c
= build_omp_clause (input_location
, OMP_CLAUSE_PRIVATE
);
14747 OMP_CLAUSE_DECL (c
) = decl
;
14748 c
= finish_omp_clauses (c
, true);
14751 OMP_CLAUSE_CHAIN (c
) = *clauses
;
14756 cond
= TREE_VEC_ELT (OMP_FOR_COND (t
), i
);
14757 if (COMPARISON_CLASS_P (cond
))
14759 tree op0
= RECUR (TREE_OPERAND (cond
, 0));
14760 tree op1
= RECUR (TREE_OPERAND (cond
, 1));
14761 cond
= build2 (TREE_CODE (cond
), boolean_type_node
, op0
, op1
);
14764 cond
= RECUR (cond
);
14765 incr
= TREE_VEC_ELT (OMP_FOR_INCR (t
), i
);
14766 switch (TREE_CODE (incr
))
14768 case PREINCREMENT_EXPR
:
14769 case PREDECREMENT_EXPR
:
14770 case POSTINCREMENT_EXPR
:
14771 case POSTDECREMENT_EXPR
:
14772 incr
= build2 (TREE_CODE (incr
), TREE_TYPE (decl
),
14773 RECUR (TREE_OPERAND (incr
, 0)), NULL_TREE
);
14776 if (TREE_CODE (TREE_OPERAND (incr
, 1)) == PLUS_EXPR
14777 || TREE_CODE (TREE_OPERAND (incr
, 1)) == MINUS_EXPR
)
14779 tree rhs
= TREE_OPERAND (incr
, 1);
14780 tree lhs
= RECUR (TREE_OPERAND (incr
, 0));
14781 tree rhs0
= RECUR (TREE_OPERAND (rhs
, 0));
14782 tree rhs1
= RECUR (TREE_OPERAND (rhs
, 1));
14783 incr
= build2 (MODIFY_EXPR
, TREE_TYPE (decl
), lhs
,
14784 build2 (TREE_CODE (rhs
), TREE_TYPE (decl
),
14788 incr
= RECUR (incr
);
14791 if (TREE_CODE (TREE_OPERAND (incr
, 1)) == PLUS_EXPR
14792 || TREE_CODE (TREE_OPERAND (incr
, 1)) == MINUS_EXPR
)
14794 tree lhs
= RECUR (TREE_OPERAND (incr
, 0));
14795 incr
= build2 (MODIFY_EXPR
, TREE_TYPE (decl
), lhs
,
14796 build2 (TREE_CODE (TREE_OPERAND (incr
, 1)),
14797 TREE_TYPE (decl
), lhs
,
14798 RECUR (TREE_OPERAND (incr
, 2))));
14800 else if (TREE_CODE (TREE_OPERAND (incr
, 1)) == NOP_EXPR
14801 && (TREE_CODE (TREE_OPERAND (incr
, 2)) == PLUS_EXPR
14802 || (TREE_CODE (TREE_OPERAND (incr
, 2)) == MINUS_EXPR
)))
14804 tree rhs
= TREE_OPERAND (incr
, 2);
14805 tree lhs
= RECUR (TREE_OPERAND (incr
, 0));
14806 tree rhs0
= RECUR (TREE_OPERAND (rhs
, 0));
14807 tree rhs1
= RECUR (TREE_OPERAND (rhs
, 1));
14808 incr
= build2 (MODIFY_EXPR
, TREE_TYPE (decl
), lhs
,
14809 build2 (TREE_CODE (rhs
), TREE_TYPE (decl
),
14813 incr
= RECUR (incr
);
14816 incr
= RECUR (incr
);
14820 TREE_VEC_ELT (declv
, i
) = decl
;
14821 TREE_VEC_ELT (initv
, i
) = init
;
14822 TREE_VEC_ELT (condv
, i
) = cond
;
14823 TREE_VEC_ELT (incrv
, i
) = incr
;
14827 /* Like tsubst_copy for expressions, etc. but also does semantic
14831 tsubst_expr (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
,
14832 bool integral_constant_expression_p
)
14834 #define RETURN(EXP) do { r = (EXP); goto out; } while(0)
14835 #define RECUR(NODE) \
14836 tsubst_expr ((NODE), args, complain, in_decl, \
14837 integral_constant_expression_p)
14843 if (t
== NULL_TREE
|| t
== error_mark_node
)
14846 loc
= input_location
;
14847 if (EXPR_HAS_LOCATION (t
))
14848 input_location
= EXPR_LOCATION (t
);
14849 if (STATEMENT_CODE_P (TREE_CODE (t
)))
14850 current_stmt_tree ()->stmts_are_full_exprs_p
= STMT_IS_FULL_EXPR_P (t
);
14852 switch (TREE_CODE (t
))
14854 case STATEMENT_LIST
:
14856 tree_stmt_iterator i
;
14857 for (i
= tsi_start (t
); !tsi_end_p (i
); tsi_next (&i
))
14858 RECUR (tsi_stmt (i
));
14862 case CTOR_INITIALIZER
:
14863 finish_mem_initializers (tsubst_initializer_list
14864 (TREE_OPERAND (t
, 0), args
));
14868 finish_return_stmt (RECUR (TREE_OPERAND (t
, 0)));
14872 tmp
= RECUR (EXPR_STMT_EXPR (t
));
14873 if (EXPR_STMT_STMT_EXPR_RESULT (t
))
14874 finish_stmt_expr_expr (tmp
, cur_stmt_expr
);
14876 finish_expr_stmt (tmp
);
14880 do_using_directive (USING_STMT_NAMESPACE (t
));
14885 tree decl
, pattern_decl
;
14888 pattern_decl
= decl
= DECL_EXPR_DECL (t
);
14889 if (TREE_CODE (decl
) == LABEL_DECL
)
14890 finish_label_decl (DECL_NAME (decl
));
14891 else if (TREE_CODE (decl
) == USING_DECL
)
14893 tree scope
= USING_DECL_SCOPE (decl
);
14894 tree name
= DECL_NAME (decl
);
14897 scope
= tsubst (scope
, args
, complain
, in_decl
);
14898 decl
= lookup_qualified_name (scope
, name
,
14899 /*is_type_p=*/false,
14900 /*complain=*/false);
14901 if (decl
== error_mark_node
|| TREE_CODE (decl
) == TREE_LIST
)
14902 qualified_name_lookup_error (scope
, name
, decl
, input_location
);
14904 do_local_using_decl (decl
, scope
, name
);
14906 else if (DECL_PACK_P (decl
))
14908 /* Don't build up decls for a variadic capture proxy, we'll
14909 instantiate the elements directly as needed. */
14914 init
= DECL_INITIAL (decl
);
14915 decl
= tsubst (decl
, args
, complain
, in_decl
);
14916 if (decl
!= error_mark_node
)
14918 /* By marking the declaration as instantiated, we avoid
14919 trying to instantiate it. Since instantiate_decl can't
14920 handle local variables, and since we've already done
14921 all that needs to be done, that's the right thing to
14924 DECL_TEMPLATE_INSTANTIATED (decl
) = 1;
14926 && ANON_AGGR_TYPE_P (TREE_TYPE (decl
)))
14927 /* Anonymous aggregates are a special case. */
14928 finish_anon_union (decl
);
14929 else if (is_capture_proxy (DECL_EXPR_DECL (t
)))
14931 DECL_CONTEXT (decl
) = current_function_decl
;
14932 if (DECL_NAME (decl
) == this_identifier
)
14934 tree lam
= DECL_CONTEXT (current_function_decl
);
14935 lam
= CLASSTYPE_LAMBDA_EXPR (lam
);
14936 LAMBDA_EXPR_THIS_CAPTURE (lam
) = decl
;
14938 insert_capture_proxy (decl
);
14940 else if (DECL_IMPLICIT_TYPEDEF_P (t
))
14941 /* We already did a pushtag. */;
14942 else if (TREE_CODE (decl
) == FUNCTION_DECL
14943 && DECL_OMP_DECLARE_REDUCTION_P (decl
)
14944 && DECL_FUNCTION_SCOPE_P (pattern_decl
))
14946 DECL_CONTEXT (decl
) = NULL_TREE
;
14948 DECL_CONTEXT (decl
) = current_function_decl
;
14949 cp_check_omp_declare_reduction (decl
);
14953 int const_init
= false;
14954 maybe_push_decl (decl
);
14956 && DECL_PRETTY_FUNCTION_P (decl
))
14958 /* For __PRETTY_FUNCTION__ we have to adjust the
14960 const char *const name
14961 = cxx_printable_name (current_function_decl
, 2);
14962 init
= cp_fname_init (name
, &TREE_TYPE (decl
));
14965 init
= tsubst_init (init
, decl
, args
, complain
, in_decl
);
14968 const_init
= (DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P
14970 cp_finish_decl (decl
, init
, const_init
, NULL_TREE
, 0);
14979 stmt
= begin_for_stmt (NULL_TREE
, NULL_TREE
);
14980 RECUR (FOR_INIT_STMT (t
));
14981 finish_for_init_stmt (stmt
);
14982 tmp
= RECUR (FOR_COND (t
));
14983 finish_for_cond (tmp
, stmt
, false);
14984 tmp
= RECUR (FOR_EXPR (t
));
14985 finish_for_expr (tmp
, stmt
);
14986 RECUR (FOR_BODY (t
));
14987 finish_for_stmt (stmt
);
14990 case RANGE_FOR_STMT
:
14993 stmt
= begin_for_stmt (NULL_TREE
, NULL_TREE
);
14994 decl
= RANGE_FOR_DECL (t
);
14995 decl
= tsubst (decl
, args
, complain
, in_decl
);
14996 maybe_push_decl (decl
);
14997 expr
= RECUR (RANGE_FOR_EXPR (t
));
14998 stmt
= cp_convert_range_for (stmt
, decl
, expr
, RANGE_FOR_IVDEP (t
));
14999 RECUR (RANGE_FOR_BODY (t
));
15000 finish_for_stmt (stmt
);
15005 stmt
= begin_while_stmt ();
15006 tmp
= RECUR (WHILE_COND (t
));
15007 finish_while_stmt_cond (tmp
, stmt
, false);
15008 RECUR (WHILE_BODY (t
));
15009 finish_while_stmt (stmt
);
15013 stmt
= begin_do_stmt ();
15014 RECUR (DO_BODY (t
));
15015 finish_do_body (stmt
);
15016 tmp
= RECUR (DO_COND (t
));
15017 finish_do_stmt (tmp
, stmt
, false);
15021 stmt
= begin_if_stmt ();
15022 tmp
= RECUR (IF_COND (t
));
15023 finish_if_stmt_cond (tmp
, stmt
);
15024 RECUR (THEN_CLAUSE (t
));
15025 finish_then_clause (stmt
);
15027 if (ELSE_CLAUSE (t
))
15029 begin_else_clause (stmt
);
15030 RECUR (ELSE_CLAUSE (t
));
15031 finish_else_clause (stmt
);
15034 finish_if_stmt (stmt
);
15038 if (BIND_EXPR_BODY_BLOCK (t
))
15039 stmt
= begin_function_body ();
15041 stmt
= begin_compound_stmt (BIND_EXPR_TRY_BLOCK (t
)
15042 ? BCS_TRY_BLOCK
: 0);
15044 RECUR (BIND_EXPR_BODY (t
));
15046 if (BIND_EXPR_BODY_BLOCK (t
))
15047 finish_function_body (stmt
);
15049 finish_compound_stmt (stmt
);
15053 finish_break_stmt ();
15056 case CONTINUE_STMT
:
15057 finish_continue_stmt ();
15061 stmt
= begin_switch_stmt ();
15062 tmp
= RECUR (SWITCH_STMT_COND (t
));
15063 finish_switch_cond (tmp
, stmt
);
15064 RECUR (SWITCH_STMT_BODY (t
));
15065 finish_switch_stmt (stmt
);
15068 case CASE_LABEL_EXPR
:
15070 tree low
= RECUR (CASE_LOW (t
));
15071 tree high
= RECUR (CASE_HIGH (t
));
15072 finish_case_label (EXPR_LOCATION (t
), low
, high
);
15078 tree decl
= LABEL_EXPR_LABEL (t
);
15081 label
= finish_label_stmt (DECL_NAME (decl
));
15082 if (DECL_ATTRIBUTES (decl
) != NULL_TREE
)
15083 cplus_decl_attributes (&label
, DECL_ATTRIBUTES (decl
), 0);
15088 tmp
= GOTO_DESTINATION (t
);
15089 if (TREE_CODE (tmp
) != LABEL_DECL
)
15090 /* Computed goto's must be tsubst'd into. On the other hand,
15091 non-computed gotos must not be; the identifier in question
15092 will have no binding. */
15095 tmp
= DECL_NAME (tmp
);
15096 finish_goto_stmt (tmp
);
15101 tree string
= RECUR (ASM_STRING (t
));
15102 tree outputs
= tsubst_copy_asm_operands (ASM_OUTPUTS (t
), args
,
15103 complain
, in_decl
);
15104 tree inputs
= tsubst_copy_asm_operands (ASM_INPUTS (t
), args
,
15105 complain
, in_decl
);
15106 tree clobbers
= tsubst_copy_asm_operands (ASM_CLOBBERS (t
), args
,
15107 complain
, in_decl
);
15108 tree labels
= tsubst_copy_asm_operands (ASM_LABELS (t
), args
,
15109 complain
, in_decl
);
15110 tmp
= finish_asm_stmt (ASM_VOLATILE_P (t
), string
, outputs
, inputs
,
15112 tree asm_expr
= tmp
;
15113 if (TREE_CODE (asm_expr
) == CLEANUP_POINT_EXPR
)
15114 asm_expr
= TREE_OPERAND (asm_expr
, 0);
15115 ASM_INPUT_P (asm_expr
) = ASM_INPUT_P (t
);
15122 stmt
= begin_try_block ();
15123 RECUR (TRY_STMTS (t
));
15124 finish_cleanup_try_block (stmt
);
15125 finish_cleanup (RECUR (TRY_HANDLERS (t
)), stmt
);
15129 tree compound_stmt
= NULL_TREE
;
15131 if (FN_TRY_BLOCK_P (t
))
15132 stmt
= begin_function_try_block (&compound_stmt
);
15134 stmt
= begin_try_block ();
15136 RECUR (TRY_STMTS (t
));
15138 if (FN_TRY_BLOCK_P (t
))
15139 finish_function_try_block (stmt
);
15141 finish_try_block (stmt
);
15143 RECUR (TRY_HANDLERS (t
));
15144 if (FN_TRY_BLOCK_P (t
))
15145 finish_function_handler_sequence (stmt
, compound_stmt
);
15147 finish_handler_sequence (stmt
);
15153 tree decl
= HANDLER_PARMS (t
);
15157 decl
= tsubst (decl
, args
, complain
, in_decl
);
15158 /* Prevent instantiate_decl from trying to instantiate
15159 this variable. We've already done all that needs to be
15161 if (decl
!= error_mark_node
)
15162 DECL_TEMPLATE_INSTANTIATED (decl
) = 1;
15164 stmt
= begin_handler ();
15165 finish_handler_parms (decl
, stmt
);
15166 RECUR (HANDLER_BODY (t
));
15167 finish_handler (stmt
);
15172 tmp
= tsubst (TREE_TYPE (t
), args
, complain
, NULL_TREE
);
15173 if (CLASS_TYPE_P (tmp
))
15175 /* Local classes are not independent templates; they are
15176 instantiated along with their containing function. And this
15177 way we don't have to deal with pushing out of one local class
15178 to instantiate a member of another local class. */
15180 /* Closures are handled by the LAMBDA_EXPR. */
15181 gcc_assert (!LAMBDA_TYPE_P (TREE_TYPE (t
)));
15182 complete_type (tmp
);
15183 for (fn
= TYPE_METHODS (tmp
); fn
; fn
= DECL_CHAIN (fn
))
15184 if (!DECL_ARTIFICIAL (fn
))
15185 instantiate_decl (fn
, /*defer_ok*/0, /*expl_inst_class*/false);
15189 case STATIC_ASSERT
:
15193 ++c_inhibit_evaluation_warnings
;
15195 tsubst_expr (STATIC_ASSERT_CONDITION (t
),
15198 /*integral_constant_expression_p=*/true);
15199 --c_inhibit_evaluation_warnings
;
15201 finish_static_assert (condition
,
15202 STATIC_ASSERT_MESSAGE (t
),
15203 STATIC_ASSERT_SOURCE_LOCATION (t
),
15204 /*member_p=*/false);
15209 r
= push_omp_privatization_clauses (OMP_PARALLEL_COMBINED (t
));
15210 tmp
= tsubst_omp_clauses (OMP_PARALLEL_CLAUSES (t
), false, true,
15211 args
, complain
, in_decl
);
15212 if (OMP_PARALLEL_COMBINED (t
))
15213 omp_parallel_combined_clauses
= &tmp
;
15214 stmt
= begin_omp_parallel ();
15215 RECUR (OMP_PARALLEL_BODY (t
));
15216 gcc_assert (omp_parallel_combined_clauses
== NULL
);
15217 OMP_PARALLEL_COMBINED (finish_omp_parallel (tmp
, stmt
))
15218 = OMP_PARALLEL_COMBINED (t
);
15219 pop_omp_privatization_clauses (r
);
15223 r
= push_omp_privatization_clauses (false);
15224 tmp
= tsubst_omp_clauses (OMP_TASK_CLAUSES (t
), false, true,
15225 args
, complain
, in_decl
);
15226 stmt
= begin_omp_task ();
15227 RECUR (OMP_TASK_BODY (t
));
15228 finish_omp_task (tmp
, stmt
);
15229 pop_omp_privatization_clauses (r
);
15236 case OMP_DISTRIBUTE
:
15239 tree clauses
, body
, pre_body
;
15240 tree declv
= NULL_TREE
, initv
= NULL_TREE
, condv
= NULL_TREE
;
15241 tree orig_declv
= NULL_TREE
;
15242 tree incrv
= NULL_TREE
;
15245 r
= push_omp_privatization_clauses (OMP_FOR_INIT (t
) == NULL_TREE
);
15246 clauses
= tsubst_omp_clauses (OMP_FOR_CLAUSES (t
), false, true,
15247 args
, complain
, in_decl
);
15248 if (OMP_FOR_INIT (t
) != NULL_TREE
)
15250 declv
= make_tree_vec (TREE_VEC_LENGTH (OMP_FOR_INIT (t
)));
15251 if (TREE_CODE (t
) == OMP_FOR
&& OMP_FOR_ORIG_DECLS (t
))
15252 orig_declv
= make_tree_vec (TREE_VEC_LENGTH (OMP_FOR_INIT (t
)));
15253 initv
= make_tree_vec (TREE_VEC_LENGTH (OMP_FOR_INIT (t
)));
15254 condv
= make_tree_vec (TREE_VEC_LENGTH (OMP_FOR_INIT (t
)));
15255 incrv
= make_tree_vec (TREE_VEC_LENGTH (OMP_FOR_INIT (t
)));
15258 stmt
= begin_omp_structured_block ();
15260 pre_body
= push_stmt_list ();
15261 RECUR (OMP_FOR_PRE_BODY (t
));
15262 pre_body
= pop_stmt_list (pre_body
);
15264 if (OMP_FOR_INIT (t
) != NULL_TREE
)
15265 for (i
= 0; i
< TREE_VEC_LENGTH (OMP_FOR_INIT (t
)); i
++)
15266 tsubst_omp_for_iterator (t
, i
, declv
, orig_declv
, initv
, condv
,
15267 incrv
, &clauses
, args
, complain
, in_decl
,
15268 integral_constant_expression_p
);
15269 omp_parallel_combined_clauses
= NULL
;
15271 body
= push_stmt_list ();
15272 RECUR (OMP_FOR_BODY (t
));
15273 body
= pop_stmt_list (body
);
15275 if (OMP_FOR_INIT (t
) != NULL_TREE
)
15276 t
= finish_omp_for (EXPR_LOCATION (t
), TREE_CODE (t
), declv
,
15277 orig_declv
, initv
, condv
, incrv
, body
, pre_body
,
15281 t
= make_node (TREE_CODE (t
));
15282 TREE_TYPE (t
) = void_type_node
;
15283 OMP_FOR_BODY (t
) = body
;
15284 OMP_FOR_PRE_BODY (t
) = pre_body
;
15285 OMP_FOR_CLAUSES (t
) = clauses
;
15286 SET_EXPR_LOCATION (t
, EXPR_LOCATION (t
));
15290 add_stmt (finish_omp_structured_block (stmt
));
15291 pop_omp_privatization_clauses (r
);
15296 omp_parallel_combined_clauses
= NULL
;
15301 r
= push_omp_privatization_clauses (TREE_CODE (t
) == OMP_TEAMS
15302 && OMP_TEAMS_COMBINED (t
));
15303 tmp
= tsubst_omp_clauses (OMP_CLAUSES (t
), false, true,
15304 args
, complain
, in_decl
);
15305 stmt
= push_stmt_list ();
15306 RECUR (OMP_BODY (t
));
15307 stmt
= pop_stmt_list (stmt
);
15310 OMP_BODY (t
) = stmt
;
15311 OMP_CLAUSES (t
) = tmp
;
15313 pop_omp_privatization_clauses (r
);
15316 case OMP_TARGET_DATA
:
15318 tmp
= tsubst_omp_clauses (OMP_CLAUSES (t
), false, true,
15319 args
, complain
, in_decl
);
15320 keep_next_level (true);
15321 stmt
= begin_omp_structured_block ();
15323 RECUR (OMP_BODY (t
));
15324 stmt
= finish_omp_structured_block (stmt
);
15327 OMP_BODY (t
) = stmt
;
15328 OMP_CLAUSES (t
) = tmp
;
15332 case OMP_TARGET_UPDATE
:
15333 case OMP_TARGET_ENTER_DATA
:
15334 case OMP_TARGET_EXIT_DATA
:
15335 tmp
= tsubst_omp_clauses (OMP_STANDALONE_CLAUSES (t
), false, true,
15336 args
, complain
, in_decl
);
15338 OMP_STANDALONE_CLAUSES (t
) = tmp
;
15343 tmp
= tsubst_omp_clauses (OMP_ORDERED_CLAUSES (t
), false, true,
15344 args
, complain
, in_decl
);
15345 stmt
= push_stmt_list ();
15346 RECUR (OMP_BODY (t
));
15347 stmt
= pop_stmt_list (stmt
);
15350 OMP_BODY (t
) = stmt
;
15351 OMP_ORDERED_CLAUSES (t
) = tmp
;
15357 case OMP_TASKGROUP
:
15358 stmt
= push_stmt_list ();
15359 RECUR (OMP_BODY (t
));
15360 stmt
= pop_stmt_list (stmt
);
15363 OMP_BODY (t
) = stmt
;
15368 gcc_assert (OMP_ATOMIC_DEPENDENT_P (t
));
15369 if (TREE_CODE (TREE_OPERAND (t
, 1)) != MODIFY_EXPR
)
15371 tree op1
= TREE_OPERAND (t
, 1);
15372 tree rhs1
= NULL_TREE
;
15374 if (TREE_CODE (op1
) == COMPOUND_EXPR
)
15376 rhs1
= RECUR (TREE_OPERAND (op1
, 0));
15377 op1
= TREE_OPERAND (op1
, 1);
15379 lhs
= RECUR (TREE_OPERAND (op1
, 0));
15380 rhs
= RECUR (TREE_OPERAND (op1
, 1));
15381 finish_omp_atomic (OMP_ATOMIC
, TREE_CODE (op1
), lhs
, rhs
,
15382 NULL_TREE
, NULL_TREE
, rhs1
,
15383 OMP_ATOMIC_SEQ_CST (t
));
15387 tree op1
= TREE_OPERAND (t
, 1);
15388 tree v
= NULL_TREE
, lhs
, rhs
= NULL_TREE
, lhs1
= NULL_TREE
;
15389 tree rhs1
= NULL_TREE
;
15390 enum tree_code code
= TREE_CODE (TREE_OPERAND (op1
, 1));
15391 enum tree_code opcode
= NOP_EXPR
;
15392 if (code
== OMP_ATOMIC_READ
)
15394 v
= RECUR (TREE_OPERAND (op1
, 0));
15395 lhs
= RECUR (TREE_OPERAND (TREE_OPERAND (op1
, 1), 0));
15397 else if (code
== OMP_ATOMIC_CAPTURE_OLD
15398 || code
== OMP_ATOMIC_CAPTURE_NEW
)
15400 tree op11
= TREE_OPERAND (TREE_OPERAND (op1
, 1), 1);
15401 v
= RECUR (TREE_OPERAND (op1
, 0));
15402 lhs1
= RECUR (TREE_OPERAND (TREE_OPERAND (op1
, 1), 0));
15403 if (TREE_CODE (op11
) == COMPOUND_EXPR
)
15405 rhs1
= RECUR (TREE_OPERAND (op11
, 0));
15406 op11
= TREE_OPERAND (op11
, 1);
15408 lhs
= RECUR (TREE_OPERAND (op11
, 0));
15409 rhs
= RECUR (TREE_OPERAND (op11
, 1));
15410 opcode
= TREE_CODE (op11
);
15411 if (opcode
== MODIFY_EXPR
)
15417 lhs
= RECUR (TREE_OPERAND (op1
, 0));
15418 rhs
= RECUR (TREE_OPERAND (op1
, 1));
15420 finish_omp_atomic (code
, opcode
, lhs
, rhs
, v
, lhs1
, rhs1
,
15421 OMP_ATOMIC_SEQ_CST (t
));
15425 case TRANSACTION_EXPR
:
15428 flags
|= (TRANSACTION_EXPR_OUTER (t
) ? TM_STMT_ATTR_OUTER
: 0);
15429 flags
|= (TRANSACTION_EXPR_RELAXED (t
) ? TM_STMT_ATTR_RELAXED
: 0);
15431 if (TRANSACTION_EXPR_IS_STMT (t
))
15433 tree body
= TRANSACTION_EXPR_BODY (t
);
15434 tree noex
= NULL_TREE
;
15435 if (TREE_CODE (body
) == MUST_NOT_THROW_EXPR
)
15437 noex
= MUST_NOT_THROW_COND (body
);
15438 if (noex
== NULL_TREE
)
15439 noex
= boolean_true_node
;
15440 body
= TREE_OPERAND (body
, 0);
15442 stmt
= begin_transaction_stmt (input_location
, NULL
, flags
);
15444 finish_transaction_stmt (stmt
, NULL
, flags
, RECUR (noex
));
15448 stmt
= build_transaction_expr (EXPR_LOCATION (t
),
15449 RECUR (TRANSACTION_EXPR_BODY (t
)),
15456 case MUST_NOT_THROW_EXPR
:
15458 tree op0
= RECUR (TREE_OPERAND (t
, 0));
15459 tree cond
= RECUR (MUST_NOT_THROW_COND (t
));
15460 RETURN (build_must_not_throw_expr (op0
, cond
));
15463 case EXPR_PACK_EXPANSION
:
15464 error ("invalid use of pack expansion expression");
15465 RETURN (error_mark_node
);
15467 case NONTYPE_ARGUMENT_PACK
:
15468 error ("use %<...%> to expand argument pack");
15469 RETURN (error_mark_node
);
15471 case CILK_SPAWN_STMT
:
15472 cfun
->calls_cilk_spawn
= 1;
15473 RETURN (build_cilk_spawn (EXPR_LOCATION (t
), RECUR (CILK_SPAWN_FN (t
))));
15475 case CILK_SYNC_STMT
:
15476 RETURN (build_cilk_sync ());
15478 case COMPOUND_EXPR
:
15479 tmp
= RECUR (TREE_OPERAND (t
, 0));
15480 if (tmp
== NULL_TREE
)
15481 /* If the first operand was a statement, we're done with it. */
15482 RETURN (RECUR (TREE_OPERAND (t
, 1)));
15483 RETURN (build_x_compound_expr (EXPR_LOCATION (t
), tmp
,
15484 RECUR (TREE_OPERAND (t
, 1)),
15487 case ANNOTATE_EXPR
:
15488 tmp
= RECUR (TREE_OPERAND (t
, 0));
15489 RETURN (build2_loc (EXPR_LOCATION (t
), ANNOTATE_EXPR
,
15490 TREE_TYPE (tmp
), tmp
, RECUR (TREE_OPERAND (t
, 1))));
15493 gcc_assert (!STATEMENT_CODE_P (TREE_CODE (t
)));
15495 RETURN (tsubst_copy_and_build (t
, args
, complain
, in_decl
,
15496 /*function_p=*/false,
15497 integral_constant_expression_p
));
15500 RETURN (NULL_TREE
);
15502 input_location
= loc
;
15508 /* Instantiate the special body of the artificial DECL_OMP_DECLARE_REDUCTION
15509 function. For description of the body see comment above
15510 cp_parser_omp_declare_reduction_exprs. */
15513 tsubst_omp_udr (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
15515 if (t
== NULL_TREE
|| t
== error_mark_node
)
15518 gcc_assert (TREE_CODE (t
) == STATEMENT_LIST
);
15520 tree_stmt_iterator tsi
;
15523 memset (stmts
, 0, sizeof stmts
);
15524 for (i
= 0, tsi
= tsi_start (t
);
15525 i
< 7 && !tsi_end_p (tsi
);
15526 i
++, tsi_next (&tsi
))
15527 stmts
[i
] = tsi_stmt (tsi
);
15528 gcc_assert (tsi_end_p (tsi
));
15532 gcc_assert (TREE_CODE (stmts
[0]) == DECL_EXPR
15533 && TREE_CODE (stmts
[1]) == DECL_EXPR
);
15534 tree omp_out
= tsubst (DECL_EXPR_DECL (stmts
[0]),
15535 args
, complain
, in_decl
);
15536 tree omp_in
= tsubst (DECL_EXPR_DECL (stmts
[1]),
15537 args
, complain
, in_decl
);
15538 DECL_CONTEXT (omp_out
) = current_function_decl
;
15539 DECL_CONTEXT (omp_in
) = current_function_decl
;
15540 keep_next_level (true);
15541 tree block
= begin_omp_structured_block ();
15542 tsubst_expr (stmts
[2], args
, complain
, in_decl
, false);
15543 block
= finish_omp_structured_block (block
);
15544 block
= maybe_cleanup_point_expr_void (block
);
15545 add_decl_expr (omp_out
);
15546 if (TREE_NO_WARNING (DECL_EXPR_DECL (stmts
[0])))
15547 TREE_NO_WARNING (omp_out
) = 1;
15548 add_decl_expr (omp_in
);
15549 finish_expr_stmt (block
);
15553 gcc_assert (TREE_CODE (stmts
[3]) == DECL_EXPR
15554 && TREE_CODE (stmts
[4]) == DECL_EXPR
);
15555 tree omp_priv
= tsubst (DECL_EXPR_DECL (stmts
[3]),
15556 args
, complain
, in_decl
);
15557 tree omp_orig
= tsubst (DECL_EXPR_DECL (stmts
[4]),
15558 args
, complain
, in_decl
);
15559 DECL_CONTEXT (omp_priv
) = current_function_decl
;
15560 DECL_CONTEXT (omp_orig
) = current_function_decl
;
15561 keep_next_level (true);
15562 tree block
= begin_omp_structured_block ();
15563 tsubst_expr (stmts
[5], args
, complain
, in_decl
, false);
15564 block
= finish_omp_structured_block (block
);
15565 block
= maybe_cleanup_point_expr_void (block
);
15566 cp_walk_tree (&block
, cp_remove_omp_priv_cleanup_stmt
, omp_priv
, NULL
);
15567 add_decl_expr (omp_priv
);
15568 add_decl_expr (omp_orig
);
15569 finish_expr_stmt (block
);
15571 add_decl_expr (omp_orig
);
15575 /* T is a postfix-expression that is not being used in a function
15576 call. Return the substituted version of T. */
15579 tsubst_non_call_postfix_expression (tree t
, tree args
,
15580 tsubst_flags_t complain
,
15583 if (TREE_CODE (t
) == SCOPE_REF
)
15584 t
= tsubst_qualified_id (t
, args
, complain
, in_decl
,
15585 /*done=*/false, /*address_p=*/false);
15587 t
= tsubst_copy_and_build (t
, args
, complain
, in_decl
,
15588 /*function_p=*/false,
15589 /*integral_constant_expression_p=*/false);
15594 /* Like tsubst but deals with expressions and performs semantic
15595 analysis. FUNCTION_P is true if T is the "F" in "F (ARGS)". */
15598 tsubst_copy_and_build (tree t
,
15600 tsubst_flags_t complain
,
15603 bool integral_constant_expression_p
)
15605 #define RETURN(EXP) do { retval = (EXP); goto out; } while(0)
15606 #define RECUR(NODE) \
15607 tsubst_copy_and_build (NODE, args, complain, in_decl, \
15608 /*function_p=*/false, \
15609 integral_constant_expression_p)
15614 if (t
== NULL_TREE
|| t
== error_mark_node
)
15617 loc
= input_location
;
15618 if (EXPR_HAS_LOCATION (t
))
15619 input_location
= EXPR_LOCATION (t
);
15621 /* N3276 decltype magic only applies to calls at the top level or on the
15622 right side of a comma. */
15623 tsubst_flags_t decltype_flag
= (complain
& tf_decltype
);
15624 complain
&= ~tf_decltype
;
15626 switch (TREE_CODE (t
))
15630 /* Fall through. */
15631 case IDENTIFIER_NODE
:
15635 bool non_integral_constant_expression_p
;
15636 const char *error_msg
;
15638 if (IDENTIFIER_TYPENAME_P (t
))
15640 tree new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
15641 t
= mangle_conv_op_name_for_type (new_type
);
15644 /* Look up the name. */
15645 decl
= lookup_name (t
);
15647 /* By convention, expressions use ERROR_MARK_NODE to indicate
15648 failure, not NULL_TREE. */
15649 if (decl
== NULL_TREE
)
15650 decl
= error_mark_node
;
15652 decl
= finish_id_expression (t
, decl
, NULL_TREE
,
15654 integral_constant_expression_p
,
15655 /*allow_non_integral_constant_expression_p=*/(cxx_dialect
>= cxx11
),
15656 &non_integral_constant_expression_p
,
15657 /*template_p=*/false,
15659 /*address_p=*/false,
15660 /*template_arg_p=*/false,
15665 if (!function_p
&& identifier_p (decl
))
15667 if (complain
& tf_error
)
15668 unqualified_name_lookup_error (decl
);
15669 decl
= error_mark_node
;
15674 case TEMPLATE_ID_EXPR
:
15677 tree templ
= RECUR (TREE_OPERAND (t
, 0));
15678 tree targs
= TREE_OPERAND (t
, 1);
15681 targs
= tsubst_template_args (targs
, args
, complain
, in_decl
);
15682 if (targs
== error_mark_node
)
15683 return error_mark_node
;
15685 if (variable_template_p (templ
))
15687 templ
= lookup_template_variable (templ
, targs
);
15688 if (!any_dependent_template_arguments_p (targs
))
15690 templ
= finish_template_variable (templ
, complain
);
15693 RETURN (convert_from_reference (templ
));
15696 if (TREE_CODE (templ
) == COMPONENT_REF
)
15698 object
= TREE_OPERAND (templ
, 0);
15699 templ
= TREE_OPERAND (templ
, 1);
15702 object
= NULL_TREE
;
15703 templ
= lookup_template_function (templ
, targs
);
15706 RETURN (build3 (COMPONENT_REF
, TREE_TYPE (templ
),
15707 object
, templ
, NULL_TREE
));
15709 RETURN (baselink_for_fns (templ
));
15714 tree r
= RECUR (TREE_OPERAND (t
, 0));
15716 if (REFERENCE_REF_P (t
))
15718 /* A type conversion to reference type will be enclosed in
15719 such an indirect ref, but the substitution of the cast
15720 will have also added such an indirect ref. */
15721 if (TREE_CODE (TREE_TYPE (r
)) == REFERENCE_TYPE
)
15722 r
= convert_from_reference (r
);
15725 r
= build_x_indirect_ref (input_location
, r
, RO_UNARY_STAR
,
15726 complain
|decltype_flag
);
15732 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
15733 tree op0
= RECUR (TREE_OPERAND (t
, 0));
15734 RETURN (build_nop (type
, op0
));
15737 case IMPLICIT_CONV_EXPR
:
15739 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
15740 tree expr
= RECUR (TREE_OPERAND (t
, 0));
15741 int flags
= LOOKUP_IMPLICIT
;
15742 if (IMPLICIT_CONV_EXPR_DIRECT_INIT (t
))
15743 flags
= LOOKUP_NORMAL
;
15744 RETURN (perform_implicit_conversion_flags (type
, expr
, complain
,
15750 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
15751 tree op0
= RECUR (TREE_OPERAND (t
, 0));
15752 RETURN (build1 (CONVERT_EXPR
, type
, op0
));
15756 case REINTERPRET_CAST_EXPR
:
15757 case CONST_CAST_EXPR
:
15758 case DYNAMIC_CAST_EXPR
:
15759 case STATIC_CAST_EXPR
:
15762 tree op
, r
= NULL_TREE
;
15764 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
15765 if (integral_constant_expression_p
15766 && !cast_valid_in_integral_constant_expression_p (type
))
15768 if (complain
& tf_error
)
15769 error ("a cast to a type other than an integral or "
15770 "enumeration type cannot appear in a constant-expression");
15771 RETURN (error_mark_node
);
15774 op
= RECUR (TREE_OPERAND (t
, 0));
15776 warning_sentinel
s(warn_useless_cast
);
15777 switch (TREE_CODE (t
))
15780 r
= build_functional_cast (type
, op
, complain
);
15782 case REINTERPRET_CAST_EXPR
:
15783 r
= build_reinterpret_cast (type
, op
, complain
);
15785 case CONST_CAST_EXPR
:
15786 r
= build_const_cast (type
, op
, complain
);
15788 case DYNAMIC_CAST_EXPR
:
15789 r
= build_dynamic_cast (type
, op
, complain
);
15791 case STATIC_CAST_EXPR
:
15792 r
= build_static_cast (type
, op
, complain
);
15795 gcc_unreachable ();
15801 case POSTDECREMENT_EXPR
:
15802 case POSTINCREMENT_EXPR
:
15803 op1
= tsubst_non_call_postfix_expression (TREE_OPERAND (t
, 0),
15804 args
, complain
, in_decl
);
15805 RETURN (build_x_unary_op (input_location
, TREE_CODE (t
), op1
,
15806 complain
|decltype_flag
));
15808 case PREDECREMENT_EXPR
:
15809 case PREINCREMENT_EXPR
:
15813 case TRUTH_NOT_EXPR
:
15814 case UNARY_PLUS_EXPR
: /* Unary + */
15815 case REALPART_EXPR
:
15816 case IMAGPART_EXPR
:
15817 RETURN (build_x_unary_op (input_location
, TREE_CODE (t
),
15818 RECUR (TREE_OPERAND (t
, 0)),
15819 complain
|decltype_flag
));
15821 case FIX_TRUNC_EXPR
:
15822 RETURN (cp_build_unary_op (FIX_TRUNC_EXPR
, RECUR (TREE_OPERAND (t
, 0)),
15826 op1
= TREE_OPERAND (t
, 0);
15827 if (TREE_CODE (op1
) == LABEL_DECL
)
15828 RETURN (finish_label_address_expr (DECL_NAME (op1
),
15829 EXPR_LOCATION (op1
)));
15830 if (TREE_CODE (op1
) == SCOPE_REF
)
15831 op1
= tsubst_qualified_id (op1
, args
, complain
, in_decl
,
15832 /*done=*/true, /*address_p=*/true);
15834 op1
= tsubst_non_call_postfix_expression (op1
, args
, complain
,
15836 RETURN (build_x_unary_op (input_location
, ADDR_EXPR
, op1
,
15837 complain
|decltype_flag
));
15842 case TRUNC_DIV_EXPR
:
15843 case CEIL_DIV_EXPR
:
15844 case FLOOR_DIV_EXPR
:
15845 case ROUND_DIV_EXPR
:
15846 case EXACT_DIV_EXPR
:
15850 case TRUNC_MOD_EXPR
:
15851 case FLOOR_MOD_EXPR
:
15852 case TRUTH_ANDIF_EXPR
:
15853 case TRUTH_ORIF_EXPR
:
15854 case TRUTH_AND_EXPR
:
15855 case TRUTH_OR_EXPR
:
15871 warning_sentinel
s1(warn_type_limits
);
15872 warning_sentinel
s2(warn_div_by_zero
);
15873 warning_sentinel
s3(warn_logical_op
);
15874 warning_sentinel
s4(warn_tautological_compare
);
15875 tree op0
= RECUR (TREE_OPERAND (t
, 0));
15876 tree op1
= RECUR (TREE_OPERAND (t
, 1));
15877 tree r
= build_x_binary_op
15878 (input_location
, TREE_CODE (t
),
15880 (TREE_NO_WARNING (TREE_OPERAND (t
, 0))
15882 : TREE_CODE (TREE_OPERAND (t
, 0))),
15884 (TREE_NO_WARNING (TREE_OPERAND (t
, 1))
15886 : TREE_CODE (TREE_OPERAND (t
, 1))),
15888 complain
|decltype_flag
);
15889 if (EXPR_P (r
) && TREE_NO_WARNING (t
))
15890 TREE_NO_WARNING (r
) = TREE_NO_WARNING (t
);
15895 case POINTER_PLUS_EXPR
:
15897 tree op0
= RECUR (TREE_OPERAND (t
, 0));
15898 tree op1
= RECUR (TREE_OPERAND (t
, 1));
15899 return fold_build_pointer_plus (op0
, op1
);
15903 RETURN (tsubst_qualified_id (t
, args
, complain
, in_decl
, /*done=*/true,
15904 /*address_p=*/false));
15906 op1
= tsubst_non_call_postfix_expression (TREE_OPERAND (t
, 0),
15907 args
, complain
, in_decl
);
15908 RETURN (build_x_array_ref (EXPR_LOCATION (t
), op1
,
15909 RECUR (TREE_OPERAND (t
, 1)),
15910 complain
|decltype_flag
));
15912 case ARRAY_NOTATION_REF
:
15914 tree start_index
, length
, stride
;
15915 op1
= tsubst_non_call_postfix_expression (ARRAY_NOTATION_ARRAY (t
),
15916 args
, complain
, in_decl
);
15917 start_index
= RECUR (ARRAY_NOTATION_START (t
));
15918 length
= RECUR (ARRAY_NOTATION_LENGTH (t
));
15919 stride
= RECUR (ARRAY_NOTATION_STRIDE (t
));
15920 RETURN (build_array_notation_ref (EXPR_LOCATION (t
), op1
, start_index
,
15921 length
, stride
, TREE_TYPE (op1
)));
15924 if (PACK_EXPANSION_P (TREE_OPERAND (t
, 0)))
15925 RETURN (tsubst_copy (t
, args
, complain
, in_decl
));
15932 op1
= TREE_OPERAND (t
, 0);
15933 if (TREE_CODE (t
) == SIZEOF_EXPR
&& SIZEOF_EXPR_TYPE_P (t
))
15934 op1
= TREE_TYPE (op1
);
15937 /* When there are no ARGS, we are trying to evaluate a
15938 non-dependent expression from the parser. Trying to do
15939 the substitutions may not work. */
15941 op1
= TREE_TYPE (op1
);
15945 ++cp_unevaluated_operand
;
15946 ++c_inhibit_evaluation_warnings
;
15948 op1
= tsubst (op1
, args
, complain
, in_decl
);
15950 op1
= tsubst_copy_and_build (op1
, args
, complain
, in_decl
,
15951 /*function_p=*/false,
15952 /*integral_constant_expression_p=*/
15954 --cp_unevaluated_operand
;
15955 --c_inhibit_evaluation_warnings
;
15958 r
= cxx_sizeof_or_alignof_type (op1
, TREE_CODE (t
),
15959 complain
& tf_error
);
15961 r
= cxx_sizeof_or_alignof_expr (op1
, TREE_CODE (t
),
15962 complain
& tf_error
);
15963 if (TREE_CODE (t
) == SIZEOF_EXPR
&& r
!= error_mark_node
)
15965 if (TREE_CODE (r
) != SIZEOF_EXPR
|| TYPE_P (op1
))
15967 if (!processing_template_decl
&& TYPE_P (op1
))
15969 r
= build_min (SIZEOF_EXPR
, size_type_node
,
15970 build1 (NOP_EXPR
, op1
, error_mark_node
));
15971 SIZEOF_EXPR_TYPE_P (r
) = 1;
15974 r
= build_min (SIZEOF_EXPR
, size_type_node
, op1
);
15975 TREE_SIDE_EFFECTS (r
) = 0;
15976 TREE_READONLY (r
) = 1;
15978 SET_EXPR_LOCATION (r
, EXPR_LOCATION (t
));
15983 case AT_ENCODE_EXPR
:
15985 op1
= TREE_OPERAND (t
, 0);
15986 ++cp_unevaluated_operand
;
15987 ++c_inhibit_evaluation_warnings
;
15988 op1
= tsubst_copy_and_build (op1
, args
, complain
, in_decl
,
15989 /*function_p=*/false,
15990 /*integral_constant_expression_p=*/false);
15991 --cp_unevaluated_operand
;
15992 --c_inhibit_evaluation_warnings
;
15993 RETURN (objc_build_encode_expr (op1
));
15996 case NOEXCEPT_EXPR
:
15997 op1
= TREE_OPERAND (t
, 0);
15998 ++cp_unevaluated_operand
;
15999 ++c_inhibit_evaluation_warnings
;
16000 ++cp_noexcept_operand
;
16001 op1
= tsubst_copy_and_build (op1
, args
, complain
, in_decl
,
16002 /*function_p=*/false,
16003 /*integral_constant_expression_p=*/false);
16004 --cp_unevaluated_operand
;
16005 --c_inhibit_evaluation_warnings
;
16006 --cp_noexcept_operand
;
16007 RETURN (finish_noexcept_expr (op1
, complain
));
16011 warning_sentinel
s(warn_div_by_zero
);
16012 tree lhs
= RECUR (TREE_OPERAND (t
, 0));
16013 tree rhs
= RECUR (TREE_OPERAND (t
, 2));
16014 tree r
= build_x_modify_expr
16015 (EXPR_LOCATION (t
), lhs
, TREE_CODE (TREE_OPERAND (t
, 1)), rhs
,
16016 complain
|decltype_flag
);
16017 /* TREE_NO_WARNING must be set if either the expression was
16018 parenthesized or it uses an operator such as >>= rather
16019 than plain assignment. In the former case, it was already
16020 set and must be copied. In the latter case,
16021 build_x_modify_expr sets it and it must not be reset
16023 if (TREE_NO_WARNING (t
))
16024 TREE_NO_WARNING (r
) = TREE_NO_WARNING (t
);
16030 op1
= tsubst_non_call_postfix_expression (TREE_OPERAND (t
, 0),
16031 args
, complain
, in_decl
);
16032 /* Remember that there was a reference to this entity. */
16034 && !mark_used (op1
, complain
) && !(complain
& tf_error
))
16035 RETURN (error_mark_node
);
16036 RETURN (build_x_arrow (input_location
, op1
, complain
));
16040 tree placement
= RECUR (TREE_OPERAND (t
, 0));
16041 tree init
= RECUR (TREE_OPERAND (t
, 3));
16042 vec
<tree
, va_gc
> *placement_vec
;
16043 vec
<tree
, va_gc
> *init_vec
;
16046 if (placement
== NULL_TREE
)
16047 placement_vec
= NULL
;
16050 placement_vec
= make_tree_vector ();
16051 for (; placement
!= NULL_TREE
; placement
= TREE_CHAIN (placement
))
16052 vec_safe_push (placement_vec
, TREE_VALUE (placement
));
16055 /* If there was an initializer in the original tree, but it
16056 instantiated to an empty list, then we should pass a
16057 non-NULL empty vector to tell build_new that it was an
16058 empty initializer() rather than no initializer. This can
16059 only happen when the initializer is a pack expansion whose
16060 parameter packs are of length zero. */
16061 if (init
== NULL_TREE
&& TREE_OPERAND (t
, 3) == NULL_TREE
)
16065 init_vec
= make_tree_vector ();
16066 if (init
== void_node
)
16067 gcc_assert (init_vec
!= NULL
);
16070 for (; init
!= NULL_TREE
; init
= TREE_CHAIN (init
))
16071 vec_safe_push (init_vec
, TREE_VALUE (init
));
16075 tree op1
= tsubst (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
16076 tree op2
= RECUR (TREE_OPERAND (t
, 2));
16077 ret
= build_new (&placement_vec
, op1
, op2
, &init_vec
,
16078 NEW_EXPR_USE_GLOBAL (t
),
16081 if (placement_vec
!= NULL
)
16082 release_tree_vector (placement_vec
);
16083 if (init_vec
!= NULL
)
16084 release_tree_vector (init_vec
);
16091 tree op0
= RECUR (TREE_OPERAND (t
, 0));
16092 tree op1
= RECUR (TREE_OPERAND (t
, 1));
16093 RETURN (delete_sanity (op0
, op1
,
16094 DELETE_EXPR_USE_VEC (t
),
16095 DELETE_EXPR_USE_GLOBAL (t
),
16099 case COMPOUND_EXPR
:
16101 tree op0
= tsubst_copy_and_build (TREE_OPERAND (t
, 0), args
,
16102 complain
& ~tf_decltype
, in_decl
,
16103 /*function_p=*/false,
16104 integral_constant_expression_p
);
16105 RETURN (build_x_compound_expr (EXPR_LOCATION (t
),
16107 RECUR (TREE_OPERAND (t
, 1)),
16108 complain
|decltype_flag
));
16114 vec
<tree
, va_gc
> *call_args
;
16115 unsigned int nargs
, i
;
16120 function
= CALL_EXPR_FN (t
);
16121 /* When we parsed the expression, we determined whether or
16122 not Koenig lookup should be performed. */
16123 koenig_p
= KOENIG_LOOKUP_P (t
);
16124 if (TREE_CODE (function
) == SCOPE_REF
)
16126 qualified_p
= true;
16127 function
= tsubst_qualified_id (function
, args
, complain
, in_decl
,
16129 /*address_p=*/false);
16131 else if (koenig_p
&& identifier_p (function
))
16133 /* Do nothing; calling tsubst_copy_and_build on an identifier
16134 would incorrectly perform unqualified lookup again.
16136 Note that we can also have an IDENTIFIER_NODE if the earlier
16137 unqualified lookup found a member function; in that case
16138 koenig_p will be false and we do want to do the lookup
16139 again to find the instantiated member function.
16141 FIXME but doing that causes c++/15272, so we need to stop
16142 using IDENTIFIER_NODE in that situation. */
16143 qualified_p
= false;
16147 if (TREE_CODE (function
) == COMPONENT_REF
)
16149 tree op
= TREE_OPERAND (function
, 1);
16151 qualified_p
= (TREE_CODE (op
) == SCOPE_REF
16152 || (BASELINK_P (op
)
16153 && BASELINK_QUALIFIED_P (op
)));
16156 qualified_p
= false;
16158 if (TREE_CODE (function
) == ADDR_EXPR
16159 && TREE_CODE (TREE_OPERAND (function
, 0)) == FUNCTION_DECL
)
16160 /* Avoid error about taking the address of a constructor. */
16161 function
= TREE_OPERAND (function
, 0);
16163 function
= tsubst_copy_and_build (function
, args
, complain
,
16166 integral_constant_expression_p
);
16168 if (BASELINK_P (function
))
16169 qualified_p
= true;
16172 nargs
= call_expr_nargs (t
);
16173 call_args
= make_tree_vector ();
16174 for (i
= 0; i
< nargs
; ++i
)
16176 tree arg
= CALL_EXPR_ARG (t
, i
);
16178 if (!PACK_EXPANSION_P (arg
))
16179 vec_safe_push (call_args
, RECUR (CALL_EXPR_ARG (t
, i
)));
16182 /* Expand the pack expansion and push each entry onto
16184 arg
= tsubst_pack_expansion (arg
, args
, complain
, in_decl
);
16185 if (TREE_CODE (arg
) == TREE_VEC
)
16187 unsigned int len
, j
;
16189 len
= TREE_VEC_LENGTH (arg
);
16190 for (j
= 0; j
< len
; ++j
)
16192 tree value
= TREE_VEC_ELT (arg
, j
);
16193 if (value
!= NULL_TREE
)
16194 value
= convert_from_reference (value
);
16195 vec_safe_push (call_args
, value
);
16200 /* A partial substitution. Add one entry. */
16201 vec_safe_push (call_args
, arg
);
16206 /* We do not perform argument-dependent lookup if normal
16207 lookup finds a non-function, in accordance with the
16208 expected resolution of DR 218. */
16210 && ((is_overloaded_fn (function
)
16211 /* If lookup found a member function, the Koenig lookup is
16212 not appropriate, even if an unqualified-name was used
16213 to denote the function. */
16214 && !DECL_FUNCTION_MEMBER_P (get_first_fn (function
)))
16215 || identifier_p (function
))
16216 /* Only do this when substitution turns a dependent call
16217 into a non-dependent call. */
16218 && type_dependent_expression_p_push (t
)
16219 && !any_type_dependent_arguments_p (call_args
))
16220 function
= perform_koenig_lookup (function
, call_args
, tf_none
);
16222 if (identifier_p (function
)
16223 && !any_type_dependent_arguments_p (call_args
))
16225 if (koenig_p
&& (complain
& tf_warning_or_error
))
16227 /* For backwards compatibility and good diagnostics, try
16228 the unqualified lookup again if we aren't in SFINAE
16230 tree unq
= (tsubst_copy_and_build
16231 (function
, args
, complain
, in_decl
, true,
16232 integral_constant_expression_p
));
16233 if (unq
== error_mark_node
)
16234 RETURN (error_mark_node
);
16236 if (unq
!= function
)
16239 if (INDIRECT_REF_P (fn
))
16240 fn
= TREE_OPERAND (fn
, 0);
16241 if (TREE_CODE (fn
) == COMPONENT_REF
)
16242 fn
= TREE_OPERAND (fn
, 1);
16243 if (is_overloaded_fn (fn
))
16244 fn
= get_first_fn (fn
);
16245 if (permerror (EXPR_LOC_OR_LOC (t
, input_location
),
16246 "%qD was not declared in this scope, "
16247 "and no declarations were found by "
16248 "argument-dependent lookup at the point "
16249 "of instantiation", function
))
16252 /* Can't say anything more. */;
16253 else if (DECL_CLASS_SCOPE_P (fn
))
16255 location_t loc
= EXPR_LOC_OR_LOC (t
,
16258 "declarations in dependent base %qT are "
16259 "not found by unqualified lookup",
16260 DECL_CLASS_CONTEXT (fn
));
16261 if (current_class_ptr
)
16263 "use %<this->%D%> instead", function
);
16266 "use %<%T::%D%> instead",
16267 current_class_name
, function
);
16270 inform (DECL_SOURCE_LOCATION (fn
),
16271 "%qD declared here, later in the "
16272 "translation unit", fn
);
16277 if (identifier_p (function
))
16279 if (complain
& tf_error
)
16280 unqualified_name_lookup_error (function
);
16281 release_tree_vector (call_args
);
16282 RETURN (error_mark_node
);
16286 /* Remember that there was a reference to this entity. */
16287 if (DECL_P (function
)
16288 && !mark_used (function
, complain
) && !(complain
& tf_error
))
16289 RETURN (error_mark_node
);
16291 /* Put back tf_decltype for the actual call. */
16292 complain
|= decltype_flag
;
16294 if (TREE_CODE (function
) == OFFSET_REF
)
16295 ret
= build_offset_ref_call_from_tree (function
, &call_args
,
16297 else if (TREE_CODE (function
) == COMPONENT_REF
)
16299 tree instance
= TREE_OPERAND (function
, 0);
16300 tree fn
= TREE_OPERAND (function
, 1);
16302 if (processing_template_decl
16303 && (type_dependent_expression_p (instance
)
16304 || (!BASELINK_P (fn
)
16305 && TREE_CODE (fn
) != FIELD_DECL
)
16306 || type_dependent_expression_p (fn
)
16307 || any_type_dependent_arguments_p (call_args
)))
16308 ret
= build_nt_call_vec (function
, call_args
);
16309 else if (!BASELINK_P (fn
))
16310 ret
= finish_call_expr (function
, &call_args
,
16311 /*disallow_virtual=*/false,
16312 /*koenig_p=*/false,
16315 ret
= (build_new_method_call
16317 &call_args
, NULL_TREE
,
16318 qualified_p
? LOOKUP_NONVIRTUAL
: LOOKUP_NORMAL
,
16323 ret
= finish_call_expr (function
, &call_args
,
16324 /*disallow_virtual=*/qualified_p
,
16328 release_tree_vector (call_args
);
16335 tree cond
= RECUR (TREE_OPERAND (t
, 0));
16336 tree folded_cond
= fold_non_dependent_expr (cond
);
16339 if (TREE_CODE (folded_cond
) == INTEGER_CST
)
16341 if (integer_zerop (folded_cond
))
16343 ++c_inhibit_evaluation_warnings
;
16344 exp1
= RECUR (TREE_OPERAND (t
, 1));
16345 --c_inhibit_evaluation_warnings
;
16346 exp2
= RECUR (TREE_OPERAND (t
, 2));
16350 exp1
= RECUR (TREE_OPERAND (t
, 1));
16351 ++c_inhibit_evaluation_warnings
;
16352 exp2
= RECUR (TREE_OPERAND (t
, 2));
16353 --c_inhibit_evaluation_warnings
;
16355 cond
= folded_cond
;
16359 exp1
= RECUR (TREE_OPERAND (t
, 1));
16360 exp2
= RECUR (TREE_OPERAND (t
, 2));
16363 RETURN (build_x_conditional_expr (EXPR_LOCATION (t
),
16364 cond
, exp1
, exp2
, complain
));
16367 case PSEUDO_DTOR_EXPR
:
16369 tree op0
= RECUR (TREE_OPERAND (t
, 0));
16370 tree op1
= RECUR (TREE_OPERAND (t
, 1));
16371 tree op2
= tsubst (TREE_OPERAND (t
, 2), args
, complain
, in_decl
);
16372 RETURN (finish_pseudo_destructor_expr (op0
, op1
, op2
,
16378 tree purpose
, value
, chain
;
16380 if (t
== void_list_node
)
16383 if ((TREE_PURPOSE (t
) && PACK_EXPANSION_P (TREE_PURPOSE (t
)))
16384 || (TREE_VALUE (t
) && PACK_EXPANSION_P (TREE_VALUE (t
))))
16386 /* We have pack expansions, so expand those and
16387 create a new list out of it. */
16388 tree purposevec
= NULL_TREE
;
16389 tree valuevec
= NULL_TREE
;
16393 /* Expand the argument expressions. */
16394 if (TREE_PURPOSE (t
))
16395 purposevec
= tsubst_pack_expansion (TREE_PURPOSE (t
), args
,
16396 complain
, in_decl
);
16397 if (TREE_VALUE (t
))
16398 valuevec
= tsubst_pack_expansion (TREE_VALUE (t
), args
,
16399 complain
, in_decl
);
16401 /* Build the rest of the list. */
16402 chain
= TREE_CHAIN (t
);
16403 if (chain
&& chain
!= void_type_node
)
16404 chain
= RECUR (chain
);
16406 /* Determine the number of arguments. */
16407 if (purposevec
&& TREE_CODE (purposevec
) == TREE_VEC
)
16409 len
= TREE_VEC_LENGTH (purposevec
);
16410 gcc_assert (!valuevec
|| len
== TREE_VEC_LENGTH (valuevec
));
16412 else if (TREE_CODE (valuevec
) == TREE_VEC
)
16413 len
= TREE_VEC_LENGTH (valuevec
);
16416 /* Since we only performed a partial substitution into
16417 the argument pack, we only RETURN (a single list
16419 if (purposevec
== TREE_PURPOSE (t
)
16420 && valuevec
== TREE_VALUE (t
)
16421 && chain
== TREE_CHAIN (t
))
16424 RETURN (tree_cons (purposevec
, valuevec
, chain
));
16427 /* Convert the argument vectors into a TREE_LIST */
16431 /* Grab the Ith values. */
16433 purpose
= purposevec
? TREE_VEC_ELT (purposevec
, i
)
16436 = valuevec
? convert_from_reference (TREE_VEC_ELT (valuevec
, i
))
16439 /* Build the list (backwards). */
16440 chain
= tree_cons (purpose
, value
, chain
);
16446 purpose
= TREE_PURPOSE (t
);
16448 purpose
= RECUR (purpose
);
16449 value
= TREE_VALUE (t
);
16451 value
= RECUR (value
);
16452 chain
= TREE_CHAIN (t
);
16453 if (chain
&& chain
!= void_type_node
)
16454 chain
= RECUR (chain
);
16455 if (purpose
== TREE_PURPOSE (t
)
16456 && value
== TREE_VALUE (t
)
16457 && chain
== TREE_CHAIN (t
))
16459 RETURN (tree_cons (purpose
, value
, chain
));
16462 case COMPONENT_REF
:
16469 object
= tsubst_non_call_postfix_expression (TREE_OPERAND (t
, 0),
16470 args
, complain
, in_decl
);
16471 /* Remember that there was a reference to this entity. */
16472 if (DECL_P (object
)
16473 && !mark_used (object
, complain
) && !(complain
& tf_error
))
16474 RETURN (error_mark_node
);
16475 object_type
= TREE_TYPE (object
);
16477 member
= TREE_OPERAND (t
, 1);
16478 if (BASELINK_P (member
))
16479 member
= tsubst_baselink (member
,
16480 non_reference (TREE_TYPE (object
)),
16481 args
, complain
, in_decl
);
16483 member
= tsubst_copy (member
, args
, complain
, in_decl
);
16484 if (member
== error_mark_node
)
16485 RETURN (error_mark_node
);
16487 if (type_dependent_expression_p (object
))
16488 /* We can't do much here. */;
16489 else if (!CLASS_TYPE_P (object_type
))
16491 if (scalarish_type_p (object_type
))
16493 tree s
= NULL_TREE
;
16494 tree dtor
= member
;
16496 if (TREE_CODE (dtor
) == SCOPE_REF
)
16498 s
= TREE_OPERAND (dtor
, 0);
16499 dtor
= TREE_OPERAND (dtor
, 1);
16501 if (TREE_CODE (dtor
) == BIT_NOT_EXPR
)
16503 dtor
= TREE_OPERAND (dtor
, 0);
16505 RETURN (finish_pseudo_destructor_expr
16506 (object
, s
, dtor
, input_location
));
16510 else if (TREE_CODE (member
) == SCOPE_REF
16511 && TREE_CODE (TREE_OPERAND (member
, 1)) == TEMPLATE_ID_EXPR
)
16513 /* Lookup the template functions now that we know what the
16515 tree scope
= TREE_OPERAND (member
, 0);
16516 tree tmpl
= TREE_OPERAND (TREE_OPERAND (member
, 1), 0);
16517 tree args
= TREE_OPERAND (TREE_OPERAND (member
, 1), 1);
16518 member
= lookup_qualified_name (scope
, tmpl
,
16519 /*is_type_p=*/false,
16520 /*complain=*/false);
16521 if (BASELINK_P (member
))
16523 BASELINK_FUNCTIONS (member
)
16524 = build_nt (TEMPLATE_ID_EXPR
, BASELINK_FUNCTIONS (member
),
16526 member
= (adjust_result_of_qualified_name_lookup
16527 (member
, BINFO_TYPE (BASELINK_BINFO (member
)),
16532 qualified_name_lookup_error (scope
, tmpl
, member
,
16534 RETURN (error_mark_node
);
16537 else if (TREE_CODE (member
) == SCOPE_REF
16538 && !CLASS_TYPE_P (TREE_OPERAND (member
, 0))
16539 && TREE_CODE (TREE_OPERAND (member
, 0)) != NAMESPACE_DECL
)
16541 if (complain
& tf_error
)
16543 if (TYPE_P (TREE_OPERAND (member
, 0)))
16544 error ("%qT is not a class or namespace",
16545 TREE_OPERAND (member
, 0));
16547 error ("%qD is not a class or namespace",
16548 TREE_OPERAND (member
, 0));
16550 RETURN (error_mark_node
);
16552 else if (TREE_CODE (member
) == FIELD_DECL
)
16554 r
= finish_non_static_data_member (member
, object
, NULL_TREE
);
16555 if (TREE_CODE (r
) == COMPONENT_REF
)
16556 REF_PARENTHESIZED_P (r
) = REF_PARENTHESIZED_P (t
);
16560 r
= finish_class_member_access_expr (object
, member
,
16561 /*template_p=*/false,
16563 if (TREE_CODE (r
) == COMPONENT_REF
)
16564 REF_PARENTHESIZED_P (r
) = REF_PARENTHESIZED_P (t
);
16569 RETURN (build_throw
16570 (RECUR (TREE_OPERAND (t
, 0))));
16574 vec
<constructor_elt
, va_gc
> *n
;
16575 constructor_elt
*ce
;
16576 unsigned HOST_WIDE_INT idx
;
16577 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
16578 bool process_index_p
;
16580 bool need_copy_p
= false;
16583 if (type
== error_mark_node
)
16584 RETURN (error_mark_node
);
16586 /* digest_init will do the wrong thing if we let it. */
16587 if (type
&& TYPE_PTRMEMFUNC_P (type
))
16590 /* We do not want to process the index of aggregate
16591 initializers as they are identifier nodes which will be
16592 looked up by digest_init. */
16593 process_index_p
= !(type
&& MAYBE_CLASS_TYPE_P (type
));
16595 n
= vec_safe_copy (CONSTRUCTOR_ELTS (t
));
16596 newlen
= vec_safe_length (n
);
16597 FOR_EACH_VEC_SAFE_ELT (n
, idx
, ce
)
16599 if (ce
->index
&& process_index_p
16600 /* An identifier index is looked up in the type
16601 being initialized, not the current scope. */
16602 && TREE_CODE (ce
->index
) != IDENTIFIER_NODE
)
16603 ce
->index
= RECUR (ce
->index
);
16605 if (PACK_EXPANSION_P (ce
->value
))
16607 /* Substitute into the pack expansion. */
16608 ce
->value
= tsubst_pack_expansion (ce
->value
, args
, complain
,
16611 if (ce
->value
== error_mark_node
16612 || PACK_EXPANSION_P (ce
->value
))
16614 else if (TREE_VEC_LENGTH (ce
->value
) == 1)
16615 /* Just move the argument into place. */
16616 ce
->value
= TREE_VEC_ELT (ce
->value
, 0);
16619 /* Update the length of the final CONSTRUCTOR
16620 arguments vector, and note that we will need to
16622 newlen
= newlen
+ TREE_VEC_LENGTH (ce
->value
) - 1;
16623 need_copy_p
= true;
16627 ce
->value
= RECUR (ce
->value
);
16632 vec
<constructor_elt
, va_gc
> *old_n
= n
;
16634 vec_alloc (n
, newlen
);
16635 FOR_EACH_VEC_ELT (*old_n
, idx
, ce
)
16637 if (TREE_CODE (ce
->value
) == TREE_VEC
)
16639 int i
, len
= TREE_VEC_LENGTH (ce
->value
);
16640 for (i
= 0; i
< len
; ++i
)
16641 CONSTRUCTOR_APPEND_ELT (n
, 0,
16642 TREE_VEC_ELT (ce
->value
, i
));
16645 CONSTRUCTOR_APPEND_ELT (n
, 0, ce
->value
);
16649 r
= build_constructor (init_list_type_node
, n
);
16650 CONSTRUCTOR_IS_DIRECT_INIT (r
) = CONSTRUCTOR_IS_DIRECT_INIT (t
);
16652 if (TREE_HAS_CONSTRUCTOR (t
))
16653 RETURN (finish_compound_literal (type
, r
, complain
));
16655 TREE_TYPE (r
) = type
;
16661 tree operand_0
= TREE_OPERAND (t
, 0);
16662 if (TYPE_P (operand_0
))
16664 operand_0
= tsubst (operand_0
, args
, complain
, in_decl
);
16665 RETURN (get_typeid (operand_0
, complain
));
16669 operand_0
= RECUR (operand_0
);
16670 RETURN (build_typeid (operand_0
, complain
));
16677 else if (DECL_PACK_P (t
))
16679 /* We don't build decls for an instantiation of a
16680 variadic capture proxy, we instantiate the elements
16682 gcc_assert (DECL_HAS_VALUE_EXPR_P (t
));
16683 return RECUR (DECL_VALUE_EXPR (t
));
16689 tree r
= tsubst_copy (t
, args
, complain
, in_decl
);
16690 /* ??? We're doing a subset of finish_id_expression here. */
16692 && !processing_template_decl
16693 && !cp_unevaluated_operand
16694 && (TREE_STATIC (r
) || DECL_EXTERNAL (r
))
16695 && CP_DECL_THREAD_LOCAL_P (r
))
16697 if (tree wrap
= get_tls_wrapper_fn (r
))
16698 /* Replace an evaluated use of the thread_local variable with
16699 a call to its wrapper. */
16700 r
= build_cxx_call (wrap
, 0, NULL
, tf_warning_or_error
);
16702 else if (outer_automatic_var_p (r
))
16704 r
= process_outer_var_ref (r
, complain
);
16705 if (is_capture_proxy (r
))
16706 register_local_specialization (r
, t
);
16709 if (TREE_CODE (TREE_TYPE (t
)) != REFERENCE_TYPE
)
16710 /* If the original type was a reference, we'll be wrapped in
16711 the appropriate INDIRECT_REF. */
16712 r
= convert_from_reference (r
);
16718 tree op0
= RECUR (TREE_OPERAND (t
, 0));
16719 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
16720 RETURN (build_x_va_arg (EXPR_LOCATION (t
), op0
, type
));
16723 case OFFSETOF_EXPR
:
16724 RETURN (finish_offsetof (RECUR (TREE_OPERAND (t
, 0)),
16725 EXPR_LOCATION (t
)));
16729 tree type1
= tsubst (TRAIT_EXPR_TYPE1 (t
), args
,
16730 complain
, in_decl
);
16732 tree type2
= TRAIT_EXPR_TYPE2 (t
);
16733 if (type2
&& TREE_CODE (type2
) == TREE_LIST
)
16734 type2
= RECUR (type2
);
16736 type2
= tsubst (type2
, args
, complain
, in_decl
);
16738 RETURN (finish_trait_expr (TRAIT_EXPR_KIND (t
), type1
, type2
));
16743 tree old_stmt_expr
= cur_stmt_expr
;
16744 tree stmt_expr
= begin_stmt_expr ();
16746 cur_stmt_expr
= stmt_expr
;
16747 tsubst_expr (STMT_EXPR_STMT (t
), args
, complain
, in_decl
,
16748 integral_constant_expression_p
);
16749 stmt_expr
= finish_stmt_expr (stmt_expr
, false);
16750 cur_stmt_expr
= old_stmt_expr
;
16752 /* If the resulting list of expression statement is empty,
16753 fold it further into void_node. */
16754 if (empty_expr_stmt_p (stmt_expr
))
16755 stmt_expr
= void_node
;
16757 RETURN (stmt_expr
);
16762 tree r
= build_lambda_expr ();
16764 tree type
= tsubst (LAMBDA_EXPR_CLOSURE (t
), args
, complain
, NULL_TREE
);
16765 LAMBDA_EXPR_CLOSURE (r
) = type
;
16766 CLASSTYPE_LAMBDA_EXPR (type
) = r
;
16768 LAMBDA_EXPR_LOCATION (r
)
16769 = LAMBDA_EXPR_LOCATION (t
);
16770 LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (r
)
16771 = LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (t
);
16772 LAMBDA_EXPR_MUTABLE_P (r
) = LAMBDA_EXPR_MUTABLE_P (t
);
16773 LAMBDA_EXPR_DISCRIMINATOR (r
)
16774 = (LAMBDA_EXPR_DISCRIMINATOR (t
));
16775 tree scope
= LAMBDA_EXPR_EXTRA_SCOPE (t
);
16777 /* No substitution needed. */;
16778 else if (VAR_OR_FUNCTION_DECL_P (scope
))
16779 /* For a function or variable scope, we want to use tsubst so that we
16780 don't complain about referring to an auto before deduction. */
16781 scope
= tsubst (scope
, args
, complain
, in_decl
);
16782 else if (TREE_CODE (scope
) == PARM_DECL
)
16784 /* Look up the parameter we want directly, as tsubst_copy
16785 doesn't do what we need. */
16786 tree fn
= tsubst (DECL_CONTEXT (scope
), args
, complain
, in_decl
);
16787 tree parm
= FUNCTION_FIRST_USER_PARM (fn
);
16788 while (DECL_PARM_INDEX (parm
) != DECL_PARM_INDEX (scope
))
16789 parm
= DECL_CHAIN (parm
);
16791 /* FIXME Work around the parm not having DECL_CONTEXT set. */
16792 if (DECL_CONTEXT (scope
) == NULL_TREE
)
16793 DECL_CONTEXT (scope
) = fn
;
16795 else if (TREE_CODE (scope
) == FIELD_DECL
)
16796 /* For a field, use tsubst_copy so that we look up the existing field
16797 rather than build a new one. */
16798 scope
= RECUR (scope
);
16800 gcc_unreachable ();
16801 LAMBDA_EXPR_EXTRA_SCOPE (r
) = scope
;
16802 LAMBDA_EXPR_RETURN_TYPE (r
)
16803 = tsubst (LAMBDA_EXPR_RETURN_TYPE (t
), args
, complain
, in_decl
);
16805 gcc_assert (LAMBDA_EXPR_THIS_CAPTURE (t
) == NULL_TREE
16806 && LAMBDA_EXPR_PENDING_PROXIES (t
) == NULL
);
16808 /* Do this again now that LAMBDA_EXPR_EXTRA_SCOPE is set. */
16809 determine_visibility (TYPE_NAME (type
));
16810 /* Now that we know visibility, instantiate the type so we have a
16811 declaration of the op() for later calls to lambda_function. */
16812 complete_type (type
);
16814 LAMBDA_EXPR_THIS_CAPTURE (r
) = NULL_TREE
;
16816 insert_pending_capture_proxies ();
16818 RETURN (build_lambda_object (r
));
16822 /* We can get here for a constant initializer of non-dependent type.
16823 FIXME stop folding in cp_parser_initializer_clause. */
16825 tree r
= get_target_expr_sfinae (RECUR (TARGET_EXPR_INITIAL (t
)),
16830 case TRANSACTION_EXPR
:
16831 RETURN (tsubst_expr(t
, args
, complain
, in_decl
,
16832 integral_constant_expression_p
));
16835 RETURN (finish_parenthesized_expr (RECUR (TREE_OPERAND (t
, 0))));
16837 case VEC_PERM_EXPR
:
16839 tree op0
= RECUR (TREE_OPERAND (t
, 0));
16840 tree op1
= RECUR (TREE_OPERAND (t
, 1));
16841 tree op2
= RECUR (TREE_OPERAND (t
, 2));
16842 RETURN (build_x_vec_perm_expr (input_location
, op0
, op1
, op2
,
16846 case REQUIRES_EXPR
:
16847 RETURN (tsubst_requires_expr (t
, args
, complain
, in_decl
));
16850 /* Handle Objective-C++ constructs, if appropriate. */
16853 = objcp_tsubst_copy_and_build (t
, args
, complain
,
16854 in_decl
, /*function_p=*/false);
16858 RETURN (tsubst_copy (t
, args
, complain
, in_decl
));
16864 input_location
= loc
;
16868 /* Verify that the instantiated ARGS are valid. For type arguments,
16869 make sure that the type's linkage is ok. For non-type arguments,
16870 make sure they are constants if they are integral or enumerations.
16871 Emit an error under control of COMPLAIN, and return TRUE on error. */
16874 check_instantiated_arg (tree tmpl
, tree t
, tsubst_flags_t complain
)
16876 if (dependent_template_arg_p (t
))
16878 if (ARGUMENT_PACK_P (t
))
16880 tree vec
= ARGUMENT_PACK_ARGS (t
);
16881 int len
= TREE_VEC_LENGTH (vec
);
16882 bool result
= false;
16885 for (i
= 0; i
< len
; ++i
)
16886 if (check_instantiated_arg (tmpl
, TREE_VEC_ELT (vec
, i
), complain
))
16890 else if (TYPE_P (t
))
16892 /* [basic.link]: A name with no linkage (notably, the name
16893 of a class or enumeration declared in a local scope)
16894 shall not be used to declare an entity with linkage.
16895 This implies that names with no linkage cannot be used as
16898 DR 757 relaxes this restriction for C++0x. */
16899 tree nt
= (cxx_dialect
> cxx98
? NULL_TREE
16900 : no_linkage_check (t
, /*relaxed_p=*/false));
16904 /* DR 488 makes use of a type with no linkage cause
16905 type deduction to fail. */
16906 if (complain
& tf_error
)
16908 if (TYPE_ANONYMOUS_P (nt
))
16909 error ("%qT is/uses anonymous type", t
);
16911 error ("template argument for %qD uses local type %qT",
16916 /* In order to avoid all sorts of complications, we do not
16917 allow variably-modified types as template arguments. */
16918 else if (variably_modified_type_p (t
, NULL_TREE
))
16920 if (complain
& tf_error
)
16921 error ("%qT is a variably modified type", t
);
16925 /* Class template and alias template arguments should be OK. */
16926 else if (DECL_TYPE_TEMPLATE_P (t
))
16928 /* A non-type argument of integral or enumerated type must be a
16930 else if (TREE_TYPE (t
)
16931 && INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (t
))
16932 && !REFERENCE_REF_P (t
)
16933 && !TREE_CONSTANT (t
))
16935 if (complain
& tf_error
)
16936 error ("integral expression %qE is not constant", t
);
16943 check_instantiated_args (tree tmpl
, tree args
, tsubst_flags_t complain
)
16945 int ix
, len
= DECL_NTPARMS (tmpl
);
16946 bool result
= false;
16948 for (ix
= 0; ix
!= len
; ix
++)
16950 if (check_instantiated_arg (tmpl
, TREE_VEC_ELT (args
, ix
), complain
))
16953 if (result
&& (complain
& tf_error
))
16954 error (" trying to instantiate %qD", tmpl
);
16958 /* We're out of SFINAE context now, so generate diagnostics for the access
16959 errors we saw earlier when instantiating D from TMPL and ARGS. */
16962 recheck_decl_substitution (tree d
, tree tmpl
, tree args
)
16964 tree pattern
= DECL_TEMPLATE_RESULT (tmpl
);
16965 tree type
= TREE_TYPE (pattern
);
16966 location_t loc
= input_location
;
16968 push_access_scope (d
);
16969 push_deferring_access_checks (dk_no_deferred
);
16970 input_location
= DECL_SOURCE_LOCATION (pattern
);
16971 tsubst (type
, args
, tf_warning_or_error
, d
);
16972 input_location
= loc
;
16973 pop_deferring_access_checks ();
16974 pop_access_scope (d
);
16977 /* Instantiate the indicated variable, function, or alias template TMPL with
16978 the template arguments in TARG_PTR. */
16981 instantiate_template_1 (tree tmpl
, tree orig_args
, tsubst_flags_t complain
)
16983 tree targ_ptr
= orig_args
;
16987 bool access_ok
= true;
16989 if (tmpl
== error_mark_node
)
16990 return error_mark_node
;
16992 gcc_assert (TREE_CODE (tmpl
) == TEMPLATE_DECL
);
16994 /* If this function is a clone, handle it specially. */
16995 if (DECL_CLONED_FUNCTION_P (tmpl
))
17000 /* Use DECL_ABSTRACT_ORIGIN because only FUNCTION_DECLs have
17001 DECL_CLONED_FUNCTION. */
17002 spec
= instantiate_template (DECL_ABSTRACT_ORIGIN (tmpl
),
17003 targ_ptr
, complain
);
17004 if (spec
== error_mark_node
)
17005 return error_mark_node
;
17007 /* Look for the clone. */
17008 FOR_EACH_CLONE (clone
, spec
)
17009 if (DECL_NAME (clone
) == DECL_NAME (tmpl
))
17011 /* We should always have found the clone by now. */
17012 gcc_unreachable ();
17016 if (targ_ptr
== error_mark_node
)
17017 return error_mark_node
;
17019 /* Check to see if we already have this specialization. */
17020 gen_tmpl
= most_general_template (tmpl
);
17021 if (tmpl
!= gen_tmpl
)
17022 /* The TMPL is a partial instantiation. To get a full set of
17023 arguments we must add the arguments used to perform the
17024 partial instantiation. */
17025 targ_ptr
= add_outermost_template_args (DECL_TI_ARGS (tmpl
),
17028 /* It would be nice to avoid hashing here and then again in tsubst_decl,
17029 but it doesn't seem to be on the hot path. */
17030 spec
= retrieve_specialization (gen_tmpl
, targ_ptr
, 0);
17032 gcc_assert (tmpl
== gen_tmpl
17033 || ((fndecl
= retrieve_specialization (tmpl
, orig_args
, 0))
17035 || fndecl
== NULL_TREE
);
17037 if (spec
!= NULL_TREE
)
17039 if (FNDECL_HAS_ACCESS_ERRORS (spec
))
17041 if (complain
& tf_error
)
17042 recheck_decl_substitution (spec
, gen_tmpl
, targ_ptr
);
17043 return error_mark_node
;
17048 if (check_instantiated_args (gen_tmpl
, INNERMOST_TEMPLATE_ARGS (targ_ptr
),
17050 return error_mark_node
;
17052 /* We are building a FUNCTION_DECL, during which the access of its
17053 parameters and return types have to be checked. However this
17054 FUNCTION_DECL which is the desired context for access checking
17055 is not built yet. We solve this chicken-and-egg problem by
17056 deferring all checks until we have the FUNCTION_DECL. */
17057 push_deferring_access_checks (dk_deferred
);
17059 /* Instantiation of the function happens in the context of the function
17060 template, not the context of the overload resolution we're doing. */
17061 push_to_top_level ();
17062 /* If there are dependent arguments, e.g. because we're doing partial
17063 ordering, make sure processing_template_decl stays set. */
17064 if (uses_template_parms (targ_ptr
))
17065 ++processing_template_decl
;
17066 if (DECL_CLASS_SCOPE_P (gen_tmpl
))
17068 tree ctx
= tsubst_aggr_type (DECL_CONTEXT (gen_tmpl
), targ_ptr
,
17069 complain
, gen_tmpl
, true);
17070 push_nested_class (ctx
);
17073 tree pattern
= DECL_TEMPLATE_RESULT (gen_tmpl
);
17075 if (VAR_P (pattern
))
17077 /* We need to determine if we're using a partial or explicit
17078 specialization now, because the type of the variable could be
17080 tree tid
= lookup_template_variable (gen_tmpl
, targ_ptr
);
17081 tree elt
= most_specialized_partial_spec (tid
, complain
);
17082 if (elt
== error_mark_node
)
17083 pattern
= error_mark_node
;
17086 tmpl
= TREE_VALUE (elt
);
17087 pattern
= DECL_TEMPLATE_RESULT (tmpl
);
17088 targ_ptr
= TREE_PURPOSE (elt
);
17092 /* Substitute template parameters to obtain the specialization. */
17093 fndecl
= tsubst (pattern
, targ_ptr
, complain
, gen_tmpl
);
17094 if (DECL_CLASS_SCOPE_P (gen_tmpl
))
17095 pop_nested_class ();
17096 pop_from_top_level ();
17098 if (fndecl
== error_mark_node
)
17100 pop_deferring_access_checks ();
17101 return error_mark_node
;
17104 /* The DECL_TI_TEMPLATE should always be the immediate parent
17105 template, not the most general template. */
17106 DECL_TI_TEMPLATE (fndecl
) = tmpl
;
17107 DECL_TI_ARGS (fndecl
) = targ_ptr
;
17109 /* Now we know the specialization, compute access previously
17111 push_access_scope (fndecl
);
17112 if (!perform_deferred_access_checks (complain
))
17114 pop_access_scope (fndecl
);
17115 pop_deferring_access_checks ();
17117 /* If we've just instantiated the main entry point for a function,
17118 instantiate all the alternate entry points as well. We do this
17119 by cloning the instantiation of the main entry point, not by
17120 instantiating the template clones. */
17121 if (DECL_CHAIN (gen_tmpl
) && DECL_CLONED_FUNCTION_P (DECL_CHAIN (gen_tmpl
)))
17122 clone_function_decl (fndecl
, /*update_method_vec_p=*/0);
17126 if (!(complain
& tf_error
))
17128 /* Remember to reinstantiate when we're out of SFINAE so the user
17129 can see the errors. */
17130 FNDECL_HAS_ACCESS_ERRORS (fndecl
) = true;
17132 return error_mark_node
;
17137 /* Wrapper for instantiate_template_1. */
17140 instantiate_template (tree tmpl
, tree orig_args
, tsubst_flags_t complain
)
17143 timevar_push (TV_TEMPLATE_INST
);
17144 ret
= instantiate_template_1 (tmpl
, orig_args
, complain
);
17145 timevar_pop (TV_TEMPLATE_INST
);
17149 /* Instantiate the alias template TMPL with ARGS. Also push a template
17150 instantiation level, which instantiate_template doesn't do because
17151 functions and variables have sufficient context established by the
17155 instantiate_alias_template (tree tmpl
, tree args
, tsubst_flags_t complain
)
17157 struct pending_template
*old_last_pend
= last_pending_template
;
17158 struct tinst_level
*old_error_tinst
= last_error_tinst_level
;
17159 if (tmpl
== error_mark_node
|| args
== error_mark_node
)
17160 return error_mark_node
;
17161 tree tinst
= build_tree_list (tmpl
, args
);
17162 if (!push_tinst_level (tinst
))
17165 return error_mark_node
;
17169 coerce_innermost_template_parms (DECL_TEMPLATE_PARMS (tmpl
),
17170 args
, tmpl
, complain
,
17171 /*require_all_args=*/true,
17172 /*use_default_args=*/true);
17174 tree r
= instantiate_template (tmpl
, args
, complain
);
17175 pop_tinst_level ();
17176 /* We can't free this if a pending_template entry or last_error_tinst_level
17177 is pointing at it. */
17178 if (last_pending_template
== old_last_pend
17179 && last_error_tinst_level
== old_error_tinst
)
17185 /* PARM is a template parameter pack for FN. Returns true iff
17186 PARM is used in a deducible way in the argument list of FN. */
17189 pack_deducible_p (tree parm
, tree fn
)
17191 tree t
= FUNCTION_FIRST_USER_PARMTYPE (fn
);
17192 for (; t
; t
= TREE_CHAIN (t
))
17194 tree type
= TREE_VALUE (t
);
17196 if (!PACK_EXPANSION_P (type
))
17198 for (packs
= PACK_EXPANSION_PARAMETER_PACKS (type
);
17199 packs
; packs
= TREE_CHAIN (packs
))
17200 if (template_args_equal (TREE_VALUE (packs
), parm
))
17202 /* The template parameter pack is used in a function parameter
17203 pack. If this is the end of the parameter list, the
17204 template parameter pack is deducible. */
17205 if (TREE_CHAIN (t
) == void_list_node
)
17208 /* Otherwise, not. Well, it could be deduced from
17209 a non-pack parameter, but doing so would end up with
17210 a deduction mismatch, so don't bother. */
17214 /* The template parameter pack isn't used in any function parameter
17215 packs, but it might be used deeper, e.g. tuple<Args...>. */
17219 /* The FN is a TEMPLATE_DECL for a function. ARGS is an array with
17220 NARGS elements of the arguments that are being used when calling
17221 it. TARGS is a vector into which the deduced template arguments
17224 Returns either a FUNCTION_DECL for the matching specialization of FN or
17225 NULL_TREE if no suitable specialization can be found. If EXPLAIN_P is
17226 true, diagnostics will be printed to explain why it failed.
17228 If FN is a conversion operator, or we are trying to produce a specific
17229 specialization, RETURN_TYPE is the return type desired.
17231 The EXPLICIT_TARGS are explicit template arguments provided via a
17234 The parameter STRICT is one of:
17237 We are deducing arguments for a function call, as in
17238 [temp.deduct.call].
17241 We are deducing arguments for a conversion function, as in
17242 [temp.deduct.conv].
17245 We are deducing arguments when doing an explicit instantiation
17246 as in [temp.explicit], when determining an explicit specialization
17247 as in [temp.expl.spec], or when taking the address of a function
17248 template, as in [temp.deduct.funcaddr]. */
17251 fn_type_unification (tree fn
,
17252 tree explicit_targs
,
17255 unsigned int nargs
,
17257 unification_kind_t strict
,
17264 tree decl
= NULL_TREE
;
17265 tsubst_flags_t complain
= (explain_p
? tf_warning_or_error
: tf_none
);
17267 static int deduction_depth
;
17268 struct pending_template
*old_last_pend
= last_pending_template
;
17269 struct tinst_level
*old_error_tinst
= last_error_tinst_level
;
17270 tree tparms
= DECL_INNERMOST_TEMPLATE_PARMS (fn
);
17272 tree r
= error_mark_node
;
17275 complain
|= tf_decltype
;
17277 /* In C++0x, it's possible to have a function template whose type depends
17278 on itself recursively. This is most obvious with decltype, but can also
17279 occur with enumeration scope (c++/48969). So we need to catch infinite
17280 recursion and reject the substitution at deduction time; this function
17281 will return error_mark_node for any repeated substitution.
17283 This also catches excessive recursion such as when f<N> depends on
17284 f<N-1> across all integers, and returns error_mark_node for all the
17285 substitutions back up to the initial one.
17287 This is, of course, not reentrant. */
17288 if (excessive_deduction_depth
)
17289 return error_mark_node
;
17290 tinst
= build_tree_list (fn
, NULL_TREE
);
17293 gcc_assert (TREE_CODE (fn
) == TEMPLATE_DECL
);
17295 fntype
= TREE_TYPE (fn
);
17296 if (explicit_targs
)
17300 The specified template arguments must match the template
17301 parameters in kind (i.e., type, nontype, template), and there
17302 must not be more arguments than there are parameters;
17303 otherwise type deduction fails.
17305 Nontype arguments must match the types of the corresponding
17306 nontype template parameters, or must be convertible to the
17307 types of the corresponding nontype parameters as specified in
17308 _temp.arg.nontype_, otherwise type deduction fails.
17310 All references in the function type of the function template
17311 to the corresponding template parameters are replaced by the
17312 specified template argument values. If a substitution in a
17313 template parameter or in the function type of the function
17314 template results in an invalid type, type deduction fails. */
17315 int i
, len
= TREE_VEC_LENGTH (tparms
);
17316 location_t loc
= input_location
;
17317 bool incomplete
= false;
17319 /* Adjust any explicit template arguments before entering the
17320 substitution context. */
17322 = (coerce_template_parms (tparms
, explicit_targs
, NULL_TREE
,
17324 /*require_all_args=*/false,
17325 /*use_default_args=*/false));
17326 if (explicit_targs
== error_mark_node
)
17329 /* Substitute the explicit args into the function type. This is
17330 necessary so that, for instance, explicitly declared function
17331 arguments can match null pointed constants. If we were given
17332 an incomplete set of explicit args, we must not do semantic
17333 processing during substitution as we could create partial
17335 for (i
= 0; i
< len
; i
++)
17337 tree parm
= TREE_VALUE (TREE_VEC_ELT (tparms
, i
));
17338 bool parameter_pack
= false;
17339 tree targ
= TREE_VEC_ELT (explicit_targs
, i
);
17341 /* Dig out the actual parm. */
17342 if (TREE_CODE (parm
) == TYPE_DECL
17343 || TREE_CODE (parm
) == TEMPLATE_DECL
)
17345 parm
= TREE_TYPE (parm
);
17346 parameter_pack
= TEMPLATE_TYPE_PARAMETER_PACK (parm
);
17348 else if (TREE_CODE (parm
) == PARM_DECL
)
17350 parm
= DECL_INITIAL (parm
);
17351 parameter_pack
= TEMPLATE_PARM_PARAMETER_PACK (parm
);
17354 if (!parameter_pack
&& targ
== NULL_TREE
)
17355 /* No explicit argument for this template parameter. */
17358 if (parameter_pack
&& pack_deducible_p (parm
, fn
))
17360 /* Mark the argument pack as "incomplete". We could
17361 still deduce more arguments during unification.
17362 We remove this mark in type_unification_real. */
17365 ARGUMENT_PACK_INCOMPLETE_P(targ
) = 1;
17366 ARGUMENT_PACK_EXPLICIT_ARGS (targ
)
17367 = ARGUMENT_PACK_ARGS (targ
);
17370 /* We have some incomplete argument packs. */
17375 TREE_VALUE (tinst
) = explicit_targs
;
17376 if (!push_tinst_level (tinst
))
17378 excessive_deduction_depth
= true;
17381 processing_template_decl
+= incomplete
;
17382 input_location
= DECL_SOURCE_LOCATION (fn
);
17383 /* Ignore any access checks; we'll see them again in
17384 instantiate_template and they might have the wrong
17385 access path at this point. */
17386 push_deferring_access_checks (dk_deferred
);
17387 fntype
= tsubst (TREE_TYPE (fn
), explicit_targs
,
17388 complain
| tf_partial
, NULL_TREE
);
17389 pop_deferring_access_checks ();
17390 input_location
= loc
;
17391 processing_template_decl
-= incomplete
;
17392 pop_tinst_level ();
17394 if (fntype
== error_mark_node
)
17397 /* Place the explicitly specified arguments in TARGS. */
17398 for (i
= NUM_TMPL_ARGS (explicit_targs
); i
--;)
17399 TREE_VEC_ELT (targs
, i
) = TREE_VEC_ELT (explicit_targs
, i
);
17402 /* Never do unification on the 'this' parameter. */
17403 parms
= skip_artificial_parms_for (fn
, TYPE_ARG_TYPES (fntype
));
17409 parms
= tree_cons (NULL_TREE
, TREE_TYPE (fntype
), parms
);
17410 new_args
= XALLOCAVEC (tree
, nargs
+ 1);
17411 new_args
[0] = return_type
;
17412 memcpy (new_args
+ 1, args
, nargs
* sizeof (tree
));
17417 /* We allow incomplete unification without an error message here
17418 because the standard doesn't seem to explicitly prohibit it. Our
17419 callers must be ready to deal with unification failures in any
17422 TREE_VALUE (tinst
) = targs
;
17423 /* If we aren't explaining yet, push tinst context so we can see where
17424 any errors (e.g. from class instantiations triggered by instantiation
17425 of default template arguments) come from. If we are explaining, this
17426 context is redundant. */
17427 if (!explain_p
&& !push_tinst_level (tinst
))
17429 excessive_deduction_depth
= true;
17433 /* type_unification_real will pass back any access checks from default
17434 template argument substitution. */
17435 vec
<deferred_access_check
, va_gc
> *checks
;
17438 ok
= !type_unification_real (DECL_INNERMOST_TEMPLATE_PARMS (fn
),
17439 targs
, parms
, args
, nargs
, /*subr=*/0,
17440 strict
, flags
, &checks
, explain_p
);
17442 pop_tinst_level ();
17446 /* Now that we have bindings for all of the template arguments,
17447 ensure that the arguments deduced for the template template
17448 parameters have compatible template parameter lists. We cannot
17449 check this property before we have deduced all template
17450 arguments, because the template parameter types of a template
17451 template parameter might depend on prior template parameters
17452 deduced after the template template parameter. The following
17453 ill-formed example illustrates this issue:
17455 template<typename T, template<T> class C> void f(C<5>, T);
17457 template<int N> struct X {};
17460 f(X<5>(), 5l); // error: template argument deduction fails
17463 The template parameter list of 'C' depends on the template type
17464 parameter 'T', but 'C' is deduced to 'X' before 'T' is deduced to
17465 'long'. Thus, we can't check that 'C' cannot bind to 'X' at the
17466 time that we deduce 'C'. */
17467 if (!template_template_parm_bindings_ok_p
17468 (DECL_INNERMOST_TEMPLATE_PARMS (fn
), targs
))
17470 unify_inconsistent_template_template_parameters (explain_p
);
17474 /* All is well so far. Now, check:
17478 When all template arguments have been deduced, all uses of
17479 template parameters in nondeduced contexts are replaced with
17480 the corresponding deduced argument values. If the
17481 substitution results in an invalid type, as described above,
17482 type deduction fails. */
17483 TREE_VALUE (tinst
) = targs
;
17484 if (!push_tinst_level (tinst
))
17486 excessive_deduction_depth
= true;
17490 /* Also collect access checks from the instantiation. */
17491 reopen_deferring_access_checks (checks
);
17493 decl
= instantiate_template (fn
, targs
, complain
);
17495 checks
= get_deferred_access_checks ();
17496 pop_deferring_access_checks ();
17498 pop_tinst_level ();
17500 if (decl
== error_mark_node
)
17503 /* Now perform any access checks encountered during substitution. */
17504 push_access_scope (decl
);
17505 ok
= perform_access_checks (checks
, complain
);
17506 pop_access_scope (decl
);
17510 /* If we're looking for an exact match, check that what we got
17511 is indeed an exact match. It might not be if some template
17512 parameters are used in non-deduced contexts. But don't check
17513 for an exact match if we have dependent template arguments;
17514 in that case we're doing partial ordering, and we already know
17515 that we have two candidates that will provide the actual type. */
17516 if (strict
== DEDUCE_EXACT
&& !any_dependent_template_arguments_p (targs
))
17518 tree substed
= TREE_TYPE (decl
);
17522 = skip_artificial_parms_for (decl
, TYPE_ARG_TYPES (substed
));
17524 sarg
= tree_cons (NULL_TREE
, TREE_TYPE (substed
), sarg
);
17525 for (i
= 0; i
< nargs
&& sarg
; ++i
, sarg
= TREE_CHAIN (sarg
))
17526 if (!same_type_p (args
[i
], TREE_VALUE (sarg
)))
17528 unify_type_mismatch (explain_p
, args
[i
],
17529 TREE_VALUE (sarg
));
17538 if (excessive_deduction_depth
)
17540 if (deduction_depth
== 0)
17541 /* Reset once we're all the way out. */
17542 excessive_deduction_depth
= false;
17545 /* We can't free this if a pending_template entry or last_error_tinst_level
17546 is pointing at it. */
17547 if (last_pending_template
== old_last_pend
17548 && last_error_tinst_level
== old_error_tinst
)
17554 /* Adjust types before performing type deduction, as described in
17555 [temp.deduct.call] and [temp.deduct.conv]. The rules in these two
17556 sections are symmetric. PARM is the type of a function parameter
17557 or the return type of the conversion function. ARG is the type of
17558 the argument passed to the call, or the type of the value
17559 initialized with the result of the conversion function.
17560 ARG_EXPR is the original argument expression, which may be null. */
17563 maybe_adjust_types_for_deduction (unification_kind_t strict
,
17576 /* Swap PARM and ARG throughout the remainder of this
17577 function; the handling is precisely symmetric since PARM
17578 will initialize ARG rather than vice versa. */
17579 std::swap (parm
, arg
);
17583 /* Core issue #873: Do the DR606 thing (see below) for these cases,
17584 too, but here handle it by stripping the reference from PARM
17585 rather than by adding it to ARG. */
17586 if (TREE_CODE (*parm
) == REFERENCE_TYPE
17587 && TYPE_REF_IS_RVALUE (*parm
)
17588 && TREE_CODE (TREE_TYPE (*parm
)) == TEMPLATE_TYPE_PARM
17589 && cp_type_quals (TREE_TYPE (*parm
)) == TYPE_UNQUALIFIED
17590 && TREE_CODE (*arg
) == REFERENCE_TYPE
17591 && !TYPE_REF_IS_RVALUE (*arg
))
17592 *parm
= TREE_TYPE (*parm
);
17593 /* Nothing else to do in this case. */
17597 gcc_unreachable ();
17600 if (TREE_CODE (*parm
) != REFERENCE_TYPE
)
17602 /* [temp.deduct.call]
17604 If P is not a reference type:
17606 --If A is an array type, the pointer type produced by the
17607 array-to-pointer standard conversion (_conv.array_) is
17608 used in place of A for type deduction; otherwise,
17610 --If A is a function type, the pointer type produced by
17611 the function-to-pointer standard conversion
17612 (_conv.func_) is used in place of A for type deduction;
17615 --If A is a cv-qualified type, the top level
17616 cv-qualifiers of A's type are ignored for type
17618 if (TREE_CODE (*arg
) == ARRAY_TYPE
)
17619 *arg
= build_pointer_type (TREE_TYPE (*arg
));
17620 else if (TREE_CODE (*arg
) == FUNCTION_TYPE
)
17621 *arg
= build_pointer_type (*arg
);
17623 *arg
= TYPE_MAIN_VARIANT (*arg
);
17626 /* From C++0x [14.8.2.1/3 temp.deduct.call] (after DR606), "If P is
17627 of the form T&&, where T is a template parameter, and the argument
17628 is an lvalue, T is deduced as A& */
17629 if (TREE_CODE (*parm
) == REFERENCE_TYPE
17630 && TYPE_REF_IS_RVALUE (*parm
)
17631 && TREE_CODE (TREE_TYPE (*parm
)) == TEMPLATE_TYPE_PARM
17632 && cp_type_quals (TREE_TYPE (*parm
)) == TYPE_UNQUALIFIED
17633 && (arg_expr
? real_lvalue_p (arg_expr
)
17634 /* try_one_overload doesn't provide an arg_expr, but
17635 functions are always lvalues. */
17636 : TREE_CODE (*arg
) == FUNCTION_TYPE
))
17637 *arg
= build_reference_type (*arg
);
17639 /* [temp.deduct.call]
17641 If P is a cv-qualified type, the top level cv-qualifiers
17642 of P's type are ignored for type deduction. If P is a
17643 reference type, the type referred to by P is used for
17645 *parm
= TYPE_MAIN_VARIANT (*parm
);
17646 if (TREE_CODE (*parm
) == REFERENCE_TYPE
)
17648 *parm
= TREE_TYPE (*parm
);
17649 result
|= UNIFY_ALLOW_OUTER_MORE_CV_QUAL
;
17652 /* DR 322. For conversion deduction, remove a reference type on parm
17653 too (which has been swapped into ARG). */
17654 if (strict
== DEDUCE_CONV
&& TREE_CODE (*arg
) == REFERENCE_TYPE
)
17655 *arg
= TREE_TYPE (*arg
);
17660 /* Subroutine of unify_one_argument. PARM is a function parameter of a
17661 template which does contain any deducible template parameters; check if
17662 ARG is a suitable match for it. STRICT, FLAGS and EXPLAIN_P are as in
17663 unify_one_argument. */
17666 check_non_deducible_conversion (tree parm
, tree arg
, int strict
,
17667 int flags
, bool explain_p
)
17672 type
= TREE_TYPE (arg
);
17676 if (same_type_p (parm
, type
))
17677 return unify_success (explain_p
);
17679 if (strict
== DEDUCE_CONV
)
17681 if (can_convert_arg (type
, parm
, NULL_TREE
, flags
,
17682 explain_p
? tf_warning_or_error
: tf_none
))
17683 return unify_success (explain_p
);
17685 else if (strict
!= DEDUCE_EXACT
)
17687 if (can_convert_arg (parm
, type
,
17688 TYPE_P (arg
) ? NULL_TREE
: arg
,
17689 flags
, explain_p
? tf_warning_or_error
: tf_none
))
17690 return unify_success (explain_p
);
17693 if (strict
== DEDUCE_EXACT
)
17694 return unify_type_mismatch (explain_p
, parm
, arg
);
17696 return unify_arg_conversion (explain_p
, parm
, type
, arg
);
17699 static bool uses_deducible_template_parms (tree type
);
17701 /* Returns true iff the expression EXPR is one from which a template
17702 argument can be deduced. In other words, if it's an undecorated
17703 use of a template non-type parameter. */
17706 deducible_expression (tree expr
)
17708 return (TREE_CODE (expr
) == TEMPLATE_PARM_INDEX
);
17711 /* Returns true iff the array domain DOMAIN uses a template parameter in a
17712 deducible way; that is, if it has a max value of <PARM> - 1. */
17715 deducible_array_bound (tree domain
)
17717 if (domain
== NULL_TREE
)
17720 tree max
= TYPE_MAX_VALUE (domain
);
17721 if (TREE_CODE (max
) != MINUS_EXPR
)
17724 return deducible_expression (TREE_OPERAND (max
, 0));
17727 /* Returns true iff the template arguments ARGS use a template parameter
17728 in a deducible way. */
17731 deducible_template_args (tree args
)
17733 for (int i
= 0; i
< TREE_VEC_LENGTH (args
); ++i
)
17736 tree elt
= TREE_VEC_ELT (args
, i
);
17737 if (ARGUMENT_PACK_P (elt
))
17738 deducible
= deducible_template_args (ARGUMENT_PACK_ARGS (elt
));
17741 if (PACK_EXPANSION_P (elt
))
17742 elt
= PACK_EXPANSION_PATTERN (elt
);
17743 if (TREE_CODE (elt
) == TEMPLATE_TEMPLATE_PARM
)
17745 else if (TYPE_P (elt
))
17746 deducible
= uses_deducible_template_parms (elt
);
17748 deducible
= deducible_expression (elt
);
17756 /* Returns true iff TYPE contains any deducible references to template
17757 parameters, as per 14.8.2.5. */
17760 uses_deducible_template_parms (tree type
)
17762 if (PACK_EXPANSION_P (type
))
17763 type
= PACK_EXPANSION_PATTERN (type
);
17770 if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
17771 || TREE_CODE (type
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
17777 if (POINTER_TYPE_P (type
))
17778 return uses_deducible_template_parms (TREE_TYPE (type
));
17780 /* T[integer-constant ]
17782 if (TREE_CODE (type
) == ARRAY_TYPE
)
17783 return (uses_deducible_template_parms (TREE_TYPE (type
))
17784 || deducible_array_bound (TYPE_DOMAIN (type
)));
17796 if (TYPE_PTRMEM_P (type
))
17797 return (uses_deducible_template_parms (TYPE_PTRMEM_CLASS_TYPE (type
))
17798 || (uses_deducible_template_parms
17799 (TYPE_PTRMEM_POINTED_TO_TYPE (type
))));
17801 /* template-name <T> (where template-name refers to a class template)
17802 template-name <i> (where template-name refers to a class template) */
17803 if (CLASS_TYPE_P (type
)
17804 && CLASSTYPE_TEMPLATE_INFO (type
)
17805 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (type
)))
17806 return deducible_template_args (INNERMOST_TEMPLATE_ARGS
17807 (CLASSTYPE_TI_ARGS (type
)));
17812 if (TREE_CODE (type
) == FUNCTION_TYPE
17813 || TREE_CODE (type
) == METHOD_TYPE
)
17815 if (uses_deducible_template_parms (TREE_TYPE (type
)))
17817 tree parm
= TYPE_ARG_TYPES (type
);
17818 if (TREE_CODE (type
) == METHOD_TYPE
)
17819 parm
= TREE_CHAIN (parm
);
17820 for (; parm
; parm
= TREE_CHAIN (parm
))
17821 if (uses_deducible_template_parms (TREE_VALUE (parm
)))
17828 /* Subroutine of type_unification_real and unify_pack_expansion to
17829 handle unification of a single P/A pair. Parameters are as
17830 for those functions. */
17833 unify_one_argument (tree tparms
, tree targs
, tree parm
, tree arg
,
17834 int subr
, unification_kind_t strict
,
17837 tree arg_expr
= NULL_TREE
;
17840 if (arg
== error_mark_node
|| parm
== error_mark_node
)
17841 return unify_invalid (explain_p
);
17842 if (arg
== unknown_type_node
)
17843 /* We can't deduce anything from this, but we might get all the
17844 template args from other function args. */
17845 return unify_success (explain_p
);
17847 /* Implicit conversions (Clause 4) will be performed on a function
17848 argument to convert it to the type of the corresponding function
17849 parameter if the parameter type contains no template-parameters that
17850 participate in template argument deduction. */
17851 if (strict
!= DEDUCE_EXACT
17852 && TYPE_P (parm
) && !uses_deducible_template_parms (parm
))
17853 /* For function parameters with no deducible template parameters,
17854 just return. We'll check non-dependent conversions later. */
17855 return unify_success (explain_p
);
17860 arg_strict
= (UNIFY_ALLOW_OUTER_LEVEL
17861 | UNIFY_ALLOW_MORE_CV_QUAL
17862 | UNIFY_ALLOW_DERIVED
);
17866 arg_strict
= UNIFY_ALLOW_LESS_CV_QUAL
;
17870 arg_strict
= UNIFY_ALLOW_NONE
;
17874 gcc_unreachable ();
17877 /* We only do these transformations if this is the top-level
17878 parameter_type_list in a call or declaration matching; in other
17879 situations (nested function declarators, template argument lists) we
17880 won't be comparing a type to an expression, and we don't do any type
17886 gcc_assert (TREE_TYPE (arg
) != NULL_TREE
);
17887 if (type_unknown_p (arg
))
17889 /* [temp.deduct.type] A template-argument can be
17890 deduced from a pointer to function or pointer
17891 to member function argument if the set of
17892 overloaded functions does not contain function
17893 templates and at most one of a set of
17894 overloaded functions provides a unique
17897 if (resolve_overloaded_unification
17898 (tparms
, targs
, parm
, arg
, strict
,
17899 arg_strict
, explain_p
))
17900 return unify_success (explain_p
);
17901 return unify_overload_resolution_failure (explain_p
, arg
);
17905 arg
= unlowered_expr_type (arg
);
17906 if (arg
== error_mark_node
)
17907 return unify_invalid (explain_p
);
17911 maybe_adjust_types_for_deduction (strict
, &parm
, &arg
, arg_expr
);
17914 if ((TYPE_P (parm
) || TREE_CODE (parm
) == TEMPLATE_DECL
)
17915 != (TYPE_P (arg
) || TREE_CODE (arg
) == TEMPLATE_DECL
))
17916 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
17918 /* For deduction from an init-list we need the actual list. */
17919 if (arg_expr
&& BRACE_ENCLOSED_INITIALIZER_P (arg_expr
))
17921 return unify (tparms
, targs
, parm
, arg
, arg_strict
, explain_p
);
17924 /* Most parms like fn_type_unification.
17926 If SUBR is 1, we're being called recursively (to unify the
17927 arguments of a function or method parameter of a function
17930 CHECKS is a pointer to a vector of access checks encountered while
17931 substituting default template arguments. */
17934 type_unification_real (tree tparms
,
17938 unsigned int xnargs
,
17940 unification_kind_t strict
,
17942 vec
<deferred_access_check
, va_gc
> **checks
,
17947 int ntparms
= TREE_VEC_LENGTH (tparms
);
17948 int saw_undeduced
= 0;
17951 unsigned int nargs
;
17954 gcc_assert (TREE_CODE (tparms
) == TREE_VEC
);
17955 gcc_assert (xparms
== NULL_TREE
|| TREE_CODE (xparms
) == TREE_LIST
);
17956 gcc_assert (ntparms
> 0);
17958 /* Reset the number of non-defaulted template arguments contained
17960 NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
) = NULL_TREE
;
17968 while (parms
&& parms
!= void_list_node
17971 parm
= TREE_VALUE (parms
);
17973 if (TREE_CODE (parm
) == TYPE_PACK_EXPANSION
17974 && (!TREE_CHAIN (parms
) || TREE_CHAIN (parms
) == void_list_node
))
17975 /* For a function parameter pack that occurs at the end of the
17976 parameter-declaration-list, the type A of each remaining
17977 argument of the call is compared with the type P of the
17978 declarator-id of the function parameter pack. */
17981 parms
= TREE_CHAIN (parms
);
17983 if (TREE_CODE (parm
) == TYPE_PACK_EXPANSION
)
17984 /* For a function parameter pack that does not occur at the
17985 end of the parameter-declaration-list, the type of the
17986 parameter pack is a non-deduced context. */
17992 if (unify_one_argument (tparms
, targs
, parm
, arg
, subr
, strict
,
17998 && parms
!= void_list_node
17999 && TREE_CODE (TREE_VALUE (parms
)) == TYPE_PACK_EXPANSION
)
18001 /* Unify the remaining arguments with the pack expansion type. */
18003 tree parmvec
= make_tree_vec (1);
18005 /* Allocate a TREE_VEC and copy in all of the arguments */
18006 argvec
= make_tree_vec (nargs
- ia
);
18007 for (i
= 0; ia
< nargs
; ++ia
, ++i
)
18008 TREE_VEC_ELT (argvec
, i
) = args
[ia
];
18010 /* Copy the parameter into parmvec. */
18011 TREE_VEC_ELT (parmvec
, 0) = TREE_VALUE (parms
);
18012 if (unify_pack_expansion (tparms
, targs
, parmvec
, argvec
, strict
,
18013 /*subr=*/subr
, explain_p
))
18016 /* Advance to the end of the list of parameters. */
18017 parms
= TREE_CHAIN (parms
);
18020 /* Fail if we've reached the end of the parm list, and more args
18021 are present, and the parm list isn't variadic. */
18022 if (ia
< nargs
&& parms
== void_list_node
)
18023 return unify_too_many_arguments (explain_p
, nargs
, ia
);
18024 /* Fail if parms are left and they don't have default values and
18025 they aren't all deduced as empty packs (c++/57397). This is
18026 consistent with sufficient_parms_p. */
18027 if (parms
&& parms
!= void_list_node
18028 && TREE_PURPOSE (parms
) == NULL_TREE
)
18030 unsigned int count
= nargs
;
18035 type_pack_p
= TREE_CODE (TREE_VALUE (p
)) == TYPE_PACK_EXPANSION
;
18038 p
= TREE_CHAIN (p
);
18040 while (p
&& p
!= void_list_node
);
18041 if (count
!= nargs
)
18042 return unify_too_few_arguments (explain_p
, ia
, count
,
18048 tsubst_flags_t complain
= (explain_p
18049 ? tf_warning_or_error
18052 for (i
= 0; i
< ntparms
; i
++)
18054 tree targ
= TREE_VEC_ELT (targs
, i
);
18055 tree tparm
= TREE_VEC_ELT (tparms
, i
);
18057 /* Clear the "incomplete" flags on all argument packs now so that
18058 substituting them into later default arguments works. */
18059 if (targ
&& ARGUMENT_PACK_P (targ
))
18061 ARGUMENT_PACK_INCOMPLETE_P (targ
) = 0;
18062 ARGUMENT_PACK_EXPLICIT_ARGS (targ
) = NULL_TREE
;
18065 if (targ
|| tparm
== error_mark_node
)
18067 tparm
= TREE_VALUE (tparm
);
18069 /* If this is an undeduced nontype parameter that depends on
18070 a type parameter, try another pass; its type may have been
18071 deduced from a later argument than the one from which
18072 this parameter can be deduced. */
18073 if (TREE_CODE (tparm
) == PARM_DECL
18074 && uses_template_parms (TREE_TYPE (tparm
))
18075 && saw_undeduced
< 2)
18081 /* Core issue #226 (C++0x) [temp.deduct]:
18083 If a template argument has not been deduced, its
18084 default template argument, if any, is used.
18086 When we are in C++98 mode, TREE_PURPOSE will either
18087 be NULL_TREE or ERROR_MARK_NODE, so we do not need
18088 to explicitly check cxx_dialect here. */
18089 if (TREE_PURPOSE (TREE_VEC_ELT (tparms
, i
)))
18090 /* OK, there is a default argument. Wait until after the
18091 conversion check to do substitution. */
18094 /* If the type parameter is a parameter pack, then it will
18095 be deduced to an empty parameter pack. */
18096 if (template_parameter_pack_p (tparm
))
18100 if (TREE_CODE (tparm
) == TEMPLATE_PARM_INDEX
)
18102 arg
= make_node (NONTYPE_ARGUMENT_PACK
);
18103 TREE_TYPE (arg
) = TREE_TYPE (TEMPLATE_PARM_DECL (tparm
));
18104 TREE_CONSTANT (arg
) = 1;
18107 arg
= cxx_make_type (TYPE_ARGUMENT_PACK
);
18109 SET_ARGUMENT_PACK_ARGS (arg
, make_tree_vec (0));
18111 TREE_VEC_ELT (targs
, i
) = arg
;
18115 return unify_parameter_deduction_failure (explain_p
, tparm
);
18118 /* DR 1391: All parameters have args, now check non-dependent parms for
18120 if (saw_undeduced
< 2)
18121 for (ia
= 0, parms
= xparms
, args
= xargs
, nargs
= xnargs
;
18122 parms
&& parms
!= void_list_node
&& ia
< nargs
; )
18124 parm
= TREE_VALUE (parms
);
18126 if (TREE_CODE (parm
) == TYPE_PACK_EXPANSION
18127 && (!TREE_CHAIN (parms
)
18128 || TREE_CHAIN (parms
) == void_list_node
))
18129 /* For a function parameter pack that occurs at the end of the
18130 parameter-declaration-list, the type A of each remaining
18131 argument of the call is compared with the type P of the
18132 declarator-id of the function parameter pack. */
18135 parms
= TREE_CHAIN (parms
);
18137 if (TREE_CODE (parm
) == TYPE_PACK_EXPANSION
)
18138 /* For a function parameter pack that does not occur at the
18139 end of the parameter-declaration-list, the type of the
18140 parameter pack is a non-deduced context. */
18146 if (uses_template_parms (parm
))
18148 if (check_non_deducible_conversion (parm
, arg
, strict
, flags
,
18153 /* Now substitute into the default template arguments. */
18154 for (i
= 0; i
< ntparms
; i
++)
18156 tree targ
= TREE_VEC_ELT (targs
, i
);
18157 tree tparm
= TREE_VEC_ELT (tparms
, i
);
18159 if (targ
|| tparm
== error_mark_node
)
18161 tree parm
= TREE_VALUE (tparm
);
18163 if (TREE_CODE (parm
) == PARM_DECL
18164 && uses_template_parms (TREE_TYPE (parm
))
18165 && saw_undeduced
< 2)
18168 tree arg
= TREE_PURPOSE (tparm
);
18169 reopen_deferring_access_checks (*checks
);
18170 location_t save_loc
= input_location
;
18172 input_location
= DECL_SOURCE_LOCATION (parm
);
18173 arg
= tsubst_template_arg (arg
, targs
, complain
, NULL_TREE
);
18174 arg
= convert_template_argument (parm
, arg
, targs
, complain
,
18176 input_location
= save_loc
;
18177 *checks
= get_deferred_access_checks ();
18178 pop_deferring_access_checks ();
18179 if (arg
== error_mark_node
)
18183 TREE_VEC_ELT (targs
, i
) = arg
;
18184 /* The position of the first default template argument,
18185 is also the number of non-defaulted arguments in TARGS.
18187 if (!NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
))
18188 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
, i
);
18193 if (saw_undeduced
++ == 1)
18196 #ifdef ENABLE_CHECKING
18197 if (!NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
))
18198 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
, TREE_VEC_LENGTH (targs
));
18201 return unify_success (explain_p
);
18204 /* Subroutine of type_unification_real. Args are like the variables
18205 at the call site. ARG is an overloaded function (or template-id);
18206 we try deducing template args from each of the overloads, and if
18207 only one succeeds, we go with that. Modifies TARGS and returns
18208 true on success. */
18211 resolve_overloaded_unification (tree tparms
,
18215 unification_kind_t strict
,
18219 tree tempargs
= copy_node (targs
);
18221 tree goodfn
= NULL_TREE
;
18224 if (TREE_CODE (arg
) == ADDR_EXPR
)
18226 arg
= TREE_OPERAND (arg
, 0);
18232 if (TREE_CODE (arg
) == COMPONENT_REF
)
18233 /* Handle `&x' where `x' is some static or non-static member
18235 arg
= TREE_OPERAND (arg
, 1);
18237 if (TREE_CODE (arg
) == OFFSET_REF
)
18238 arg
= TREE_OPERAND (arg
, 1);
18240 /* Strip baselink information. */
18241 if (BASELINK_P (arg
))
18242 arg
= BASELINK_FUNCTIONS (arg
);
18244 if (TREE_CODE (arg
) == TEMPLATE_ID_EXPR
)
18246 /* If we got some explicit template args, we need to plug them into
18247 the affected templates before we try to unify, in case the
18248 explicit args will completely resolve the templates in question. */
18251 tree expl_subargs
= TREE_OPERAND (arg
, 1);
18252 arg
= TREE_OPERAND (arg
, 0);
18254 for (; arg
; arg
= OVL_NEXT (arg
))
18256 tree fn
= OVL_CURRENT (arg
);
18257 tree subargs
, elem
;
18259 if (TREE_CODE (fn
) != TEMPLATE_DECL
)
18262 subargs
= coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (fn
),
18263 expl_subargs
, NULL_TREE
, tf_none
,
18264 /*require_all_args=*/true,
18265 /*use_default_args=*/true);
18266 if (subargs
!= error_mark_node
18267 && !any_dependent_template_arguments_p (subargs
))
18269 elem
= TREE_TYPE (instantiate_template (fn
, subargs
, tf_none
));
18270 if (try_one_overload (tparms
, targs
, tempargs
, parm
,
18271 elem
, strict
, sub_strict
, addr_p
, explain_p
)
18272 && (!goodfn
|| !same_type_p (goodfn
, elem
)))
18281 /* If no templates (or more than one) are fully resolved by the
18282 explicit arguments, this template-id is a non-deduced context; it
18283 could still be OK if we deduce all template arguments for the
18284 enclosing call through other arguments. */
18288 else if (TREE_CODE (arg
) != OVERLOAD
18289 && TREE_CODE (arg
) != FUNCTION_DECL
)
18290 /* If ARG is, for example, "(0, &f)" then its type will be unknown
18291 -- but the deduction does not succeed because the expression is
18292 not just the function on its own. */
18295 for (; arg
; arg
= OVL_NEXT (arg
))
18296 if (try_one_overload (tparms
, targs
, tempargs
, parm
,
18297 TREE_TYPE (OVL_CURRENT (arg
)),
18298 strict
, sub_strict
, addr_p
, explain_p
)
18299 && (!goodfn
|| !decls_match (goodfn
, OVL_CURRENT (arg
))))
18301 goodfn
= OVL_CURRENT (arg
);
18305 /* [temp.deduct.type] A template-argument can be deduced from a pointer
18306 to function or pointer to member function argument if the set of
18307 overloaded functions does not contain function templates and at most
18308 one of a set of overloaded functions provides a unique match.
18310 So if we found multiple possibilities, we return success but don't
18311 deduce anything. */
18315 int i
= TREE_VEC_LENGTH (targs
);
18317 if (TREE_VEC_ELT (tempargs
, i
))
18319 tree old
= TREE_VEC_ELT (targs
, i
);
18320 tree new_
= TREE_VEC_ELT (tempargs
, i
);
18321 if (new_
&& old
&& ARGUMENT_PACK_P (old
)
18322 && ARGUMENT_PACK_EXPLICIT_ARGS (old
))
18323 /* Don't forget explicit template arguments in a pack. */
18324 ARGUMENT_PACK_EXPLICIT_ARGS (new_
)
18325 = ARGUMENT_PACK_EXPLICIT_ARGS (old
);
18326 TREE_VEC_ELT (targs
, i
) = new_
;
18335 /* Core DR 115: In contexts where deduction is done and fails, or in
18336 contexts where deduction is not done, if a template argument list is
18337 specified and it, along with any default template arguments, identifies
18338 a single function template specialization, then the template-id is an
18339 lvalue for the function template specialization. */
18342 resolve_nondeduced_context (tree orig_expr
)
18344 tree expr
, offset
, baselink
;
18347 if (!type_unknown_p (orig_expr
))
18352 offset
= NULL_TREE
;
18353 baselink
= NULL_TREE
;
18355 if (TREE_CODE (expr
) == ADDR_EXPR
)
18357 expr
= TREE_OPERAND (expr
, 0);
18360 if (TREE_CODE (expr
) == OFFSET_REF
)
18363 expr
= TREE_OPERAND (expr
, 1);
18365 if (BASELINK_P (expr
))
18368 expr
= BASELINK_FUNCTIONS (expr
);
18371 if (TREE_CODE (expr
) == TEMPLATE_ID_EXPR
)
18374 tree goodfn
= NULL_TREE
;
18376 /* If we got some explicit template args, we need to plug them into
18377 the affected templates before we try to unify, in case the
18378 explicit args will completely resolve the templates in question. */
18380 tree expl_subargs
= TREE_OPERAND (expr
, 1);
18381 tree arg
= TREE_OPERAND (expr
, 0);
18382 tree badfn
= NULL_TREE
;
18383 tree badargs
= NULL_TREE
;
18385 for (; arg
; arg
= OVL_NEXT (arg
))
18387 tree fn
= OVL_CURRENT (arg
);
18388 tree subargs
, elem
;
18390 if (TREE_CODE (fn
) != TEMPLATE_DECL
)
18393 subargs
= coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (fn
),
18394 expl_subargs
, NULL_TREE
, tf_none
,
18395 /*require_all_args=*/true,
18396 /*use_default_args=*/true);
18397 if (subargs
!= error_mark_node
18398 && !any_dependent_template_arguments_p (subargs
))
18400 elem
= instantiate_template (fn
, subargs
, tf_none
);
18401 if (elem
== error_mark_node
)
18406 else if (elem
&& (!goodfn
|| !decls_match (goodfn
, elem
)))
18415 mark_used (goodfn
);
18418 expr
= build_baselink (BASELINK_BINFO (baselink
),
18419 BASELINK_ACCESS_BINFO (baselink
),
18420 expr
, BASELINK_OPTYPE (baselink
));
18424 = TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (offset
, 0)));
18425 expr
= build_offset_ref (base
, expr
, addr
, tf_warning_or_error
);
18428 expr
= cp_build_addr_expr (expr
, tf_warning_or_error
);
18431 else if (good
== 0 && badargs
)
18432 /* There were no good options and at least one bad one, so let the
18433 user know what the problem is. */
18434 instantiate_template (badfn
, badargs
, tf_warning_or_error
);
18439 /* Subroutine of resolve_overloaded_unification; does deduction for a single
18440 overload. Fills TARGS with any deduced arguments, or error_mark_node if
18441 different overloads deduce different arguments for a given parm.
18442 ADDR_P is true if the expression for which deduction is being
18443 performed was of the form "& fn" rather than simply "fn".
18445 Returns 1 on success. */
18448 try_one_overload (tree tparms
,
18453 unification_kind_t strict
,
18462 if (arg
== error_mark_node
)
18465 /* [temp.deduct.type] A template-argument can be deduced from a pointer
18466 to function or pointer to member function argument if the set of
18467 overloaded functions does not contain function templates and at most
18468 one of a set of overloaded functions provides a unique match.
18470 So if this is a template, just return success. */
18472 if (uses_template_parms (arg
))
18475 if (TREE_CODE (arg
) == METHOD_TYPE
)
18476 arg
= build_ptrmemfunc_type (build_pointer_type (arg
));
18478 arg
= build_pointer_type (arg
);
18480 sub_strict
|= maybe_adjust_types_for_deduction (strict
, &parm
, &arg
, NULL
);
18482 /* We don't copy orig_targs for this because if we have already deduced
18483 some template args from previous args, unify would complain when we
18484 try to deduce a template parameter for the same argument, even though
18485 there isn't really a conflict. */
18486 nargs
= TREE_VEC_LENGTH (targs
);
18487 tempargs
= make_tree_vec (nargs
);
18489 if (unify (tparms
, tempargs
, parm
, arg
, sub_strict
, explain_p
))
18492 /* First make sure we didn't deduce anything that conflicts with
18493 explicitly specified args. */
18494 for (i
= nargs
; i
--; )
18496 tree elt
= TREE_VEC_ELT (tempargs
, i
);
18497 tree oldelt
= TREE_VEC_ELT (orig_targs
, i
);
18501 else if (uses_template_parms (elt
))
18502 /* Since we're unifying against ourselves, we will fill in
18503 template args used in the function parm list with our own
18504 template parms. Discard them. */
18505 TREE_VEC_ELT (tempargs
, i
) = NULL_TREE
;
18506 else if (oldelt
&& !template_args_equal (oldelt
, elt
))
18510 for (i
= nargs
; i
--; )
18512 tree elt
= TREE_VEC_ELT (tempargs
, i
);
18515 TREE_VEC_ELT (targs
, i
) = elt
;
18521 /* PARM is a template class (perhaps with unbound template
18522 parameters). ARG is a fully instantiated type. If ARG can be
18523 bound to PARM, return ARG, otherwise return NULL_TREE. TPARMS and
18524 TARGS are as for unify. */
18527 try_class_unification (tree tparms
, tree targs
, tree parm
, tree arg
,
18530 tree copy_of_targs
;
18532 if (!CLASSTYPE_TEMPLATE_INFO (arg
)
18533 || (most_general_template (CLASSTYPE_TI_TEMPLATE (arg
))
18534 != most_general_template (CLASSTYPE_TI_TEMPLATE (parm
))))
18537 /* We need to make a new template argument vector for the call to
18538 unify. If we used TARGS, we'd clutter it up with the result of
18539 the attempted unification, even if this class didn't work out.
18540 We also don't want to commit ourselves to all the unifications
18541 we've already done, since unification is supposed to be done on
18542 an argument-by-argument basis. In other words, consider the
18543 following pathological case:
18545 template <int I, int J, int K>
18548 template <int I, int J>
18549 struct S<I, J, 2> : public S<I, I, I>, S<J, J, J> {};
18551 template <int I, int J, int K>
18552 void f(S<I, J, K>, S<I, I, I>);
18561 Now, by the time we consider the unification involving `s2', we
18562 already know that we must have `f<0, 0, 0>'. But, even though
18563 `S<0, 1, 2>' is derived from `S<0, 0, 0>', the code is invalid
18564 because there are two ways to unify base classes of S<0, 1, 2>
18565 with S<I, I, I>. If we kept the already deduced knowledge, we
18566 would reject the possibility I=1. */
18567 copy_of_targs
= make_tree_vec (TREE_VEC_LENGTH (targs
));
18569 /* If unification failed, we're done. */
18570 if (unify (tparms
, copy_of_targs
, CLASSTYPE_TI_ARGS (parm
),
18571 CLASSTYPE_TI_ARGS (arg
), UNIFY_ALLOW_NONE
, explain_p
))
18577 /* Given a template type PARM and a class type ARG, find the unique
18578 base type in ARG that is an instance of PARM. We do not examine
18579 ARG itself; only its base-classes. If there is not exactly one
18580 appropriate base class, return NULL_TREE. PARM may be the type of
18581 a partial specialization, as well as a plain template type. Used
18584 static enum template_base_result
18585 get_template_base (tree tparms
, tree targs
, tree parm
, tree arg
,
18586 bool explain_p
, tree
*result
)
18588 tree rval
= NULL_TREE
;
18591 gcc_assert (RECORD_OR_UNION_CODE_P (TREE_CODE (arg
)));
18593 binfo
= TYPE_BINFO (complete_type (arg
));
18596 /* The type could not be completed. */
18597 *result
= NULL_TREE
;
18598 return tbr_incomplete_type
;
18601 /* Walk in inheritance graph order. The search order is not
18602 important, and this avoids multiple walks of virtual bases. */
18603 for (binfo
= TREE_CHAIN (binfo
); binfo
; binfo
= TREE_CHAIN (binfo
))
18605 tree r
= try_class_unification (tparms
, targs
, parm
,
18606 BINFO_TYPE (binfo
), explain_p
);
18610 /* If there is more than one satisfactory baseclass, then:
18614 If they yield more than one possible deduced A, the type
18618 if (rval
&& !same_type_p (r
, rval
))
18620 *result
= NULL_TREE
;
18621 return tbr_ambiguous_baseclass
;
18629 return tbr_success
;
18632 /* Returns the level of DECL, which declares a template parameter. */
18635 template_decl_level (tree decl
)
18637 switch (TREE_CODE (decl
))
18640 case TEMPLATE_DECL
:
18641 return TEMPLATE_TYPE_LEVEL (TREE_TYPE (decl
));
18644 return TEMPLATE_PARM_LEVEL (DECL_INITIAL (decl
));
18647 gcc_unreachable ();
18652 /* Decide whether ARG can be unified with PARM, considering only the
18653 cv-qualifiers of each type, given STRICT as documented for unify.
18654 Returns nonzero iff the unification is OK on that basis. */
18657 check_cv_quals_for_unify (int strict
, tree arg
, tree parm
)
18659 int arg_quals
= cp_type_quals (arg
);
18660 int parm_quals
= cp_type_quals (parm
);
18662 if (TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
18663 && !(strict
& UNIFY_ALLOW_OUTER_MORE_CV_QUAL
))
18665 /* Although a CVR qualifier is ignored when being applied to a
18666 substituted template parameter ([8.3.2]/1 for example), that
18667 does not allow us to unify "const T" with "int&" because both
18668 types are not of the form "cv-list T" [14.8.2.5 temp.deduct.type].
18669 It is ok when we're allowing additional CV qualifiers
18670 at the outer level [14.8.2.1]/3,1st bullet. */
18671 if ((TREE_CODE (arg
) == REFERENCE_TYPE
18672 || TREE_CODE (arg
) == FUNCTION_TYPE
18673 || TREE_CODE (arg
) == METHOD_TYPE
)
18674 && (parm_quals
& (TYPE_QUAL_CONST
| TYPE_QUAL_VOLATILE
)))
18677 if ((!POINTER_TYPE_P (arg
) && TREE_CODE (arg
) != TEMPLATE_TYPE_PARM
)
18678 && (parm_quals
& TYPE_QUAL_RESTRICT
))
18682 if (!(strict
& (UNIFY_ALLOW_MORE_CV_QUAL
| UNIFY_ALLOW_OUTER_MORE_CV_QUAL
))
18683 && (arg_quals
& parm_quals
) != parm_quals
)
18686 if (!(strict
& (UNIFY_ALLOW_LESS_CV_QUAL
| UNIFY_ALLOW_OUTER_LESS_CV_QUAL
))
18687 && (parm_quals
& arg_quals
) != arg_quals
)
18693 /* Determines the LEVEL and INDEX for the template parameter PARM. */
18695 template_parm_level_and_index (tree parm
, int* level
, int* index
)
18697 if (TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
18698 || TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
18699 || TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
18701 *index
= TEMPLATE_TYPE_IDX (parm
);
18702 *level
= TEMPLATE_TYPE_LEVEL (parm
);
18706 *index
= TEMPLATE_PARM_IDX (parm
);
18707 *level
= TEMPLATE_PARM_LEVEL (parm
);
18711 #define RECUR_AND_CHECK_FAILURE(TP, TA, P, A, S, EP) \
18713 if (unify (TP, TA, P, A, S, EP)) \
18717 /* Unifies the remaining arguments in PACKED_ARGS with the pack
18718 expansion at the end of PACKED_PARMS. Returns 0 if the type
18719 deduction succeeds, 1 otherwise. STRICT is the same as in
18720 unify. CALL_ARGS_P is true iff PACKED_ARGS is actually a function
18721 call argument list. We'll need to adjust the arguments to make them
18722 types. SUBR tells us if this is from a recursive call to
18723 type_unification_real, or for comparing two template argument
18727 unify_pack_expansion (tree tparms
, tree targs
, tree packed_parms
,
18728 tree packed_args
, unification_kind_t strict
,
18729 bool subr
, bool explain_p
)
18732 = TREE_VEC_ELT (packed_parms
, TREE_VEC_LENGTH (packed_parms
) - 1);
18733 tree pattern
= PACK_EXPANSION_PATTERN (parm
);
18734 tree pack
, packs
= NULL_TREE
;
18735 int i
, start
= TREE_VEC_LENGTH (packed_parms
) - 1;
18737 packed_args
= expand_template_argument_pack (packed_args
);
18739 int len
= TREE_VEC_LENGTH (packed_args
);
18741 /* Determine the parameter packs we will be deducing from the
18742 pattern, and record their current deductions. */
18743 for (pack
= PACK_EXPANSION_PARAMETER_PACKS (parm
);
18744 pack
; pack
= TREE_CHAIN (pack
))
18746 tree parm_pack
= TREE_VALUE (pack
);
18749 /* Determine the index and level of this parameter pack. */
18750 template_parm_level_and_index (parm_pack
, &level
, &idx
);
18752 /* Keep track of the parameter packs and their corresponding
18754 packs
= tree_cons (parm_pack
, TMPL_ARG (targs
, level
, idx
), packs
);
18755 TREE_TYPE (packs
) = make_tree_vec (len
- start
);
18758 /* Loop through all of the arguments that have not yet been
18759 unified and unify each with the pattern. */
18760 for (i
= start
; i
< len
; i
++)
18763 bool any_explicit
= false;
18764 tree arg
= TREE_VEC_ELT (packed_args
, i
);
18766 /* For each parameter pack, set its TMPL_ARG to either NULL_TREE
18767 or the element of its argument pack at the current index if
18768 this argument was explicitly specified. */
18769 for (pack
= packs
; pack
; pack
= TREE_CHAIN (pack
))
18773 template_parm_level_and_index (TREE_PURPOSE (pack
), &level
, &idx
);
18776 if (TREE_VALUE (pack
)
18777 && (pargs
= ARGUMENT_PACK_EXPLICIT_ARGS (TREE_VALUE (pack
)))
18778 && (i
- start
< TREE_VEC_LENGTH (pargs
)))
18780 any_explicit
= true;
18781 arg
= TREE_VEC_ELT (pargs
, i
- start
);
18783 TMPL_ARG (targs
, level
, idx
) = arg
;
18786 /* If we had explicit template arguments, substitute them into the
18787 pattern before deduction. */
18790 /* Some arguments might still be unspecified or dependent. */
18792 ++processing_template_decl
;
18793 dependent
= any_dependent_template_arguments_p (targs
);
18795 --processing_template_decl
;
18796 parm
= tsubst (pattern
, targs
,
18797 explain_p
? tf_warning_or_error
: tf_none
,
18800 --processing_template_decl
;
18801 if (parm
== error_mark_node
)
18807 /* Unify the pattern with the current argument. */
18808 if (unify_one_argument (tparms
, targs
, parm
, arg
, subr
, strict
,
18812 /* For each parameter pack, collect the deduced value. */
18813 for (pack
= packs
; pack
; pack
= TREE_CHAIN (pack
))
18816 template_parm_level_and_index (TREE_PURPOSE (pack
), &level
, &idx
);
18818 TREE_VEC_ELT (TREE_TYPE (pack
), i
- start
) =
18819 TMPL_ARG (targs
, level
, idx
);
18823 /* Verify that the results of unification with the parameter packs
18824 produce results consistent with what we've seen before, and make
18825 the deduced argument packs available. */
18826 for (pack
= packs
; pack
; pack
= TREE_CHAIN (pack
))
18828 tree old_pack
= TREE_VALUE (pack
);
18829 tree new_args
= TREE_TYPE (pack
);
18830 int i
, len
= TREE_VEC_LENGTH (new_args
);
18832 bool nondeduced_p
= false;
18834 /* By default keep the original deduced argument pack.
18835 If necessary, more specific code is going to update the
18836 resulting deduced argument later down in this function. */
18837 template_parm_level_and_index (TREE_PURPOSE (pack
), &level
, &idx
);
18838 TMPL_ARG (targs
, level
, idx
) = old_pack
;
18840 /* If NEW_ARGS contains any NULL_TREE entries, we didn't
18841 actually deduce anything. */
18842 for (i
= 0; i
< len
&& !nondeduced_p
; ++i
)
18843 if (TREE_VEC_ELT (new_args
, i
) == NULL_TREE
)
18844 nondeduced_p
= true;
18848 if (old_pack
&& ARGUMENT_PACK_INCOMPLETE_P (old_pack
))
18850 /* If we had fewer function args than explicit template args,
18851 just use the explicits. */
18852 tree explicit_args
= ARGUMENT_PACK_EXPLICIT_ARGS (old_pack
);
18853 int explicit_len
= TREE_VEC_LENGTH (explicit_args
);
18854 if (len
< explicit_len
)
18855 new_args
= explicit_args
;
18861 /* Build the deduced *_ARGUMENT_PACK. */
18862 if (TREE_CODE (TREE_PURPOSE (pack
)) == TEMPLATE_PARM_INDEX
)
18864 result
= make_node (NONTYPE_ARGUMENT_PACK
);
18865 TREE_TYPE (result
) =
18866 TREE_TYPE (TEMPLATE_PARM_DECL (TREE_PURPOSE (pack
)));
18867 TREE_CONSTANT (result
) = 1;
18870 result
= cxx_make_type (TYPE_ARGUMENT_PACK
);
18872 SET_ARGUMENT_PACK_ARGS (result
, new_args
);
18874 /* Note the deduced argument packs for this parameter
18876 TMPL_ARG (targs
, level
, idx
) = result
;
18878 else if (ARGUMENT_PACK_INCOMPLETE_P (old_pack
)
18879 && (ARGUMENT_PACK_ARGS (old_pack
)
18880 == ARGUMENT_PACK_EXPLICIT_ARGS (old_pack
)))
18882 /* We only had the explicitly-provided arguments before, but
18883 now we have a complete set of arguments. */
18884 tree explicit_args
= ARGUMENT_PACK_EXPLICIT_ARGS (old_pack
);
18886 SET_ARGUMENT_PACK_ARGS (old_pack
, new_args
);
18887 ARGUMENT_PACK_INCOMPLETE_P (old_pack
) = 1;
18888 ARGUMENT_PACK_EXPLICIT_ARGS (old_pack
) = explicit_args
;
18892 tree bad_old_arg
= NULL_TREE
, bad_new_arg
= NULL_TREE
;
18893 tree old_args
= ARGUMENT_PACK_ARGS (old_pack
);
18895 if (!comp_template_args_with_info (old_args
, new_args
,
18896 &bad_old_arg
, &bad_new_arg
))
18897 /* Inconsistent unification of this parameter pack. */
18898 return unify_parameter_pack_inconsistent (explain_p
,
18904 return unify_success (explain_p
);
18907 /* Handle unification of the domain of an array. PARM_DOM and ARG_DOM are
18908 INTEGER_TYPEs representing the TYPE_DOMAIN of ARRAY_TYPEs. The other
18909 parameters and return value are as for unify. */
18912 unify_array_domain (tree tparms
, tree targs
,
18913 tree parm_dom
, tree arg_dom
,
18921 /* Our representation of array types uses "N - 1" as the
18922 TYPE_MAX_VALUE for an array with "N" elements, if "N" is
18923 not an integer constant. We cannot unify arbitrarily
18924 complex expressions, so we eliminate the MINUS_EXPRs
18926 parm_max
= TYPE_MAX_VALUE (parm_dom
);
18927 parm_cst
= TREE_CODE (parm_max
) == INTEGER_CST
;
18930 gcc_assert (TREE_CODE (parm_max
) == MINUS_EXPR
);
18931 parm_max
= TREE_OPERAND (parm_max
, 0);
18933 arg_max
= TYPE_MAX_VALUE (arg_dom
);
18934 arg_cst
= TREE_CODE (arg_max
) == INTEGER_CST
;
18937 /* The ARG_MAX may not be a simple MINUS_EXPR, if we are
18938 trying to unify the type of a variable with the type
18939 of a template parameter. For example:
18941 template <unsigned int N>
18942 void f (char (&) [N]);
18949 Here, the type of the ARG will be "int [g(i)]", and
18950 may be a SAVE_EXPR, etc. */
18951 if (TREE_CODE (arg_max
) != MINUS_EXPR
)
18952 return unify_vla_arg (explain_p
, arg_dom
);
18953 arg_max
= TREE_OPERAND (arg_max
, 0);
18956 /* If only one of the bounds used a MINUS_EXPR, compensate
18957 by adding one to the other bound. */
18958 if (parm_cst
&& !arg_cst
)
18959 parm_max
= fold_build2_loc (input_location
, PLUS_EXPR
,
18963 else if (arg_cst
&& !parm_cst
)
18964 arg_max
= fold_build2_loc (input_location
, PLUS_EXPR
,
18969 return unify (tparms
, targs
, parm_max
, arg_max
,
18970 UNIFY_ALLOW_INTEGER
, explain_p
);
18973 /* Deduce the value of template parameters. TPARMS is the (innermost)
18974 set of template parameters to a template. TARGS is the bindings
18975 for those template parameters, as determined thus far; TARGS may
18976 include template arguments for outer levels of template parameters
18977 as well. PARM is a parameter to a template function, or a
18978 subcomponent of that parameter; ARG is the corresponding argument.
18979 This function attempts to match PARM with ARG in a manner
18980 consistent with the existing assignments in TARGS. If more values
18981 are deduced, then TARGS is updated.
18983 Returns 0 if the type deduction succeeds, 1 otherwise. The
18984 parameter STRICT is a bitwise or of the following flags:
18987 Require an exact match between PARM and ARG.
18988 UNIFY_ALLOW_MORE_CV_QUAL:
18989 Allow the deduced ARG to be more cv-qualified (by qualification
18990 conversion) than ARG.
18991 UNIFY_ALLOW_LESS_CV_QUAL:
18992 Allow the deduced ARG to be less cv-qualified than ARG.
18993 UNIFY_ALLOW_DERIVED:
18994 Allow the deduced ARG to be a template base class of ARG,
18995 or a pointer to a template base class of the type pointed to by
18997 UNIFY_ALLOW_INTEGER:
18998 Allow any integral type to be deduced. See the TEMPLATE_PARM_INDEX
18999 case for more information.
19000 UNIFY_ALLOW_OUTER_LEVEL:
19001 This is the outermost level of a deduction. Used to determine validity
19002 of qualification conversions. A valid qualification conversion must
19003 have const qualified pointers leading up to the inner type which
19004 requires additional CV quals, except at the outer level, where const
19005 is not required [conv.qual]. It would be normal to set this flag in
19006 addition to setting UNIFY_ALLOW_MORE_CV_QUAL.
19007 UNIFY_ALLOW_OUTER_MORE_CV_QUAL:
19008 This is the outermost level of a deduction, and PARM can be more CV
19009 qualified at this point.
19010 UNIFY_ALLOW_OUTER_LESS_CV_QUAL:
19011 This is the outermost level of a deduction, and PARM can be less CV
19012 qualified at this point. */
19015 unify (tree tparms
, tree targs
, tree parm
, tree arg
, int strict
,
19021 int strict_in
= strict
;
19023 /* I don't think this will do the right thing with respect to types.
19024 But the only case I've seen it in so far has been array bounds, where
19025 signedness is the only information lost, and I think that will be
19027 while (TREE_CODE (parm
) == NOP_EXPR
)
19028 parm
= TREE_OPERAND (parm
, 0);
19030 if (arg
== error_mark_node
)
19031 return unify_invalid (explain_p
);
19032 if (arg
== unknown_type_node
19033 || arg
== init_list_type_node
)
19034 /* We can't deduce anything from this, but we might get all the
19035 template args from other function args. */
19036 return unify_success (explain_p
);
19038 /* If PARM uses template parameters, then we can't bail out here,
19039 even if ARG == PARM, since we won't record unifications for the
19040 template parameters. We might need them if we're trying to
19041 figure out which of two things is more specialized. */
19042 if (arg
== parm
&& !uses_template_parms (parm
))
19043 return unify_success (explain_p
);
19045 /* Handle init lists early, so the rest of the function can assume
19046 we're dealing with a type. */
19047 if (BRACE_ENCLOSED_INITIALIZER_P (arg
))
19051 tree orig_parm
= parm
;
19053 /* Replace T with std::initializer_list<T> for deduction. */
19054 if (TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
19055 && flag_deduce_init_list
)
19056 parm
= listify (parm
);
19058 if (!is_std_init_list (parm
)
19059 && TREE_CODE (parm
) != ARRAY_TYPE
)
19060 /* We can only deduce from an initializer list argument if the
19061 parameter is std::initializer_list or an array; otherwise this
19062 is a non-deduced context. */
19063 return unify_success (explain_p
);
19065 if (TREE_CODE (parm
) == ARRAY_TYPE
)
19066 elttype
= TREE_TYPE (parm
);
19069 elttype
= TREE_VEC_ELT (CLASSTYPE_TI_ARGS (parm
), 0);
19070 /* Deduction is defined in terms of a single type, so just punt
19071 on the (bizarre) std::initializer_list<T...>. */
19072 if (PACK_EXPANSION_P (elttype
))
19073 return unify_success (explain_p
);
19076 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (arg
), i
, elt
)
19078 int elt_strict
= strict
;
19080 if (elt
== error_mark_node
)
19081 return unify_invalid (explain_p
);
19083 if (!BRACE_ENCLOSED_INITIALIZER_P (elt
))
19085 tree type
= TREE_TYPE (elt
);
19086 if (type
== error_mark_node
)
19087 return unify_invalid (explain_p
);
19088 /* It should only be possible to get here for a call. */
19089 gcc_assert (elt_strict
& UNIFY_ALLOW_OUTER_LEVEL
);
19090 elt_strict
|= maybe_adjust_types_for_deduction
19091 (DEDUCE_CALL
, &elttype
, &type
, elt
);
19095 RECUR_AND_CHECK_FAILURE (tparms
, targs
, elttype
, elt
, elt_strict
,
19099 if (TREE_CODE (parm
) == ARRAY_TYPE
19100 && deducible_array_bound (TYPE_DOMAIN (parm
)))
19102 /* Also deduce from the length of the initializer list. */
19103 tree max
= size_int (CONSTRUCTOR_NELTS (arg
));
19104 tree idx
= compute_array_index_type (NULL_TREE
, max
, tf_none
);
19105 if (idx
== error_mark_node
)
19106 return unify_invalid (explain_p
);
19107 return unify_array_domain (tparms
, targs
, TYPE_DOMAIN (parm
),
19111 /* If the std::initializer_list<T> deduction worked, replace the
19112 deduced A with std::initializer_list<A>. */
19113 if (orig_parm
!= parm
)
19115 idx
= TEMPLATE_TYPE_IDX (orig_parm
);
19116 targ
= TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
);
19117 targ
= listify (targ
);
19118 TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
) = targ
;
19120 return unify_success (explain_p
);
19123 /* Immediately reject some pairs that won't unify because of
19124 cv-qualification mismatches. */
19125 if (TREE_CODE (arg
) == TREE_CODE (parm
)
19127 /* It is the elements of the array which hold the cv quals of an array
19128 type, and the elements might be template type parms. We'll check
19129 when we recurse. */
19130 && TREE_CODE (arg
) != ARRAY_TYPE
19131 /* We check the cv-qualifiers when unifying with template type
19132 parameters below. We want to allow ARG `const T' to unify with
19133 PARM `T' for example, when computing which of two templates
19134 is more specialized, for example. */
19135 && TREE_CODE (arg
) != TEMPLATE_TYPE_PARM
19136 && !check_cv_quals_for_unify (strict_in
, arg
, parm
))
19137 return unify_cv_qual_mismatch (explain_p
, parm
, arg
);
19139 if (!(strict
& UNIFY_ALLOW_OUTER_LEVEL
)
19140 && TYPE_P (parm
) && !CP_TYPE_CONST_P (parm
))
19141 strict
&= ~UNIFY_ALLOW_MORE_CV_QUAL
;
19142 strict
&= ~UNIFY_ALLOW_OUTER_LEVEL
;
19143 strict
&= ~UNIFY_ALLOW_DERIVED
;
19144 strict
&= ~UNIFY_ALLOW_OUTER_MORE_CV_QUAL
;
19145 strict
&= ~UNIFY_ALLOW_OUTER_LESS_CV_QUAL
;
19147 switch (TREE_CODE (parm
))
19149 case TYPENAME_TYPE
:
19151 case UNBOUND_CLASS_TEMPLATE
:
19152 /* In a type which contains a nested-name-specifier, template
19153 argument values cannot be deduced for template parameters used
19154 within the nested-name-specifier. */
19155 return unify_success (explain_p
);
19157 case TEMPLATE_TYPE_PARM
:
19158 case TEMPLATE_TEMPLATE_PARM
:
19159 case BOUND_TEMPLATE_TEMPLATE_PARM
:
19160 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, 0));
19161 if (error_operand_p (tparm
))
19162 return unify_invalid (explain_p
);
19164 if (TEMPLATE_TYPE_LEVEL (parm
)
19165 != template_decl_level (tparm
))
19166 /* The PARM is not one we're trying to unify. Just check
19167 to see if it matches ARG. */
19169 if (TREE_CODE (arg
) == TREE_CODE (parm
)
19170 && (is_auto (parm
) ? is_auto (arg
)
19171 : same_type_p (parm
, arg
)))
19172 return unify_success (explain_p
);
19174 return unify_type_mismatch (explain_p
, parm
, arg
);
19176 idx
= TEMPLATE_TYPE_IDX (parm
);
19177 targ
= TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
);
19178 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, idx
));
19179 if (error_operand_p (tparm
))
19180 return unify_invalid (explain_p
);
19182 /* Check for mixed types and values. */
19183 if ((TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
19184 && TREE_CODE (tparm
) != TYPE_DECL
)
19185 || (TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
19186 && TREE_CODE (tparm
) != TEMPLATE_DECL
))
19187 gcc_unreachable ();
19189 if (TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
19191 /* ARG must be constructed from a template class or a template
19192 template parameter. */
19193 if (TREE_CODE (arg
) != BOUND_TEMPLATE_TEMPLATE_PARM
19194 && !CLASSTYPE_SPECIALIZATION_OF_PRIMARY_TEMPLATE_P (arg
))
19195 return unify_template_deduction_failure (explain_p
, parm
, arg
);
19197 tree parmvec
= TYPE_TI_ARGS (parm
);
19198 /* An alias template name is never deduced. */
19199 if (TYPE_ALIAS_P (arg
))
19200 arg
= strip_typedefs (arg
);
19201 tree argvec
= INNERMOST_TEMPLATE_ARGS (TYPE_TI_ARGS (arg
));
19202 tree full_argvec
= add_to_template_args (targs
, argvec
);
19204 = DECL_INNERMOST_TEMPLATE_PARMS
19205 (TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL (parm
));
19207 int parm_variadic_p
= 0;
19209 /* The resolution to DR150 makes clear that default
19210 arguments for an N-argument may not be used to bind T
19211 to a template template parameter with fewer than N
19212 parameters. It is not safe to permit the binding of
19213 default arguments as an extension, as that may change
19214 the meaning of a conforming program. Consider:
19216 struct Dense { static const unsigned int dim = 1; };
19218 template <template <typename> class View,
19220 void operator+(float, View<Block> const&);
19222 template <typename Block,
19223 unsigned int Dim = Block::dim>
19224 struct Lvalue_proxy { operator float() const; };
19228 Lvalue_proxy<Dense> p;
19233 Here, if Lvalue_proxy is permitted to bind to View, then
19234 the global operator+ will be used; if they are not, the
19235 Lvalue_proxy will be converted to float. */
19236 if (coerce_template_parms (parm_parms
,
19238 TYPE_TI_TEMPLATE (parm
),
19240 ? tf_warning_or_error
19242 /*require_all_args=*/true,
19243 /*use_default_args=*/false)
19244 == error_mark_node
)
19247 /* Deduce arguments T, i from TT<T> or TT<i>.
19248 We check each element of PARMVEC and ARGVEC individually
19249 rather than the whole TREE_VEC since they can have
19250 different number of elements. */
19252 parmvec
= expand_template_argument_pack (parmvec
);
19253 argvec
= expand_template_argument_pack (argvec
);
19255 len
= TREE_VEC_LENGTH (parmvec
);
19257 /* Check if the parameters end in a pack, making them
19260 && PACK_EXPANSION_P (TREE_VEC_ELT (parmvec
, len
- 1)))
19261 parm_variadic_p
= 1;
19263 for (i
= 0; i
< len
- parm_variadic_p
; ++i
)
19264 /* If the template argument list of P contains a pack
19265 expansion that is not the last template argument, the
19266 entire template argument list is a non-deduced
19268 if (PACK_EXPANSION_P (TREE_VEC_ELT (parmvec
, i
)))
19269 return unify_success (explain_p
);
19271 if (TREE_VEC_LENGTH (argvec
) < len
- parm_variadic_p
)
19272 return unify_too_few_arguments (explain_p
,
19273 TREE_VEC_LENGTH (argvec
), len
);
19275 for (i
= 0; i
< len
- parm_variadic_p
; ++i
)
19277 RECUR_AND_CHECK_FAILURE (tparms
, targs
,
19278 TREE_VEC_ELT (parmvec
, i
),
19279 TREE_VEC_ELT (argvec
, i
),
19280 UNIFY_ALLOW_NONE
, explain_p
);
19283 if (parm_variadic_p
19284 && unify_pack_expansion (tparms
, targs
,
19287 /*subr=*/true, explain_p
))
19290 arg
= TYPE_TI_TEMPLATE (arg
);
19292 /* Fall through to deduce template name. */
19295 if (TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
19296 || TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
19298 /* Deduce template name TT from TT, TT<>, TT<T> and TT<i>. */
19300 /* Simple cases: Value already set, does match or doesn't. */
19301 if (targ
!= NULL_TREE
&& template_args_equal (targ
, arg
))
19302 return unify_success (explain_p
);
19304 return unify_inconsistency (explain_p
, parm
, targ
, arg
);
19308 /* If PARM is `const T' and ARG is only `int', we don't have
19309 a match unless we are allowing additional qualification.
19310 If ARG is `const int' and PARM is just `T' that's OK;
19311 that binds `const int' to `T'. */
19312 if (!check_cv_quals_for_unify (strict_in
| UNIFY_ALLOW_LESS_CV_QUAL
,
19314 return unify_cv_qual_mismatch (explain_p
, parm
, arg
);
19316 /* Consider the case where ARG is `const volatile int' and
19317 PARM is `const T'. Then, T should be `volatile int'. */
19318 arg
= cp_build_qualified_type_real
19319 (arg
, cp_type_quals (arg
) & ~cp_type_quals (parm
), tf_none
);
19320 if (arg
== error_mark_node
)
19321 return unify_invalid (explain_p
);
19323 /* Simple cases: Value already set, does match or doesn't. */
19324 if (targ
!= NULL_TREE
&& same_type_p (targ
, arg
))
19325 return unify_success (explain_p
);
19327 return unify_inconsistency (explain_p
, parm
, targ
, arg
);
19329 /* Make sure that ARG is not a variable-sized array. (Note
19330 that were talking about variable-sized arrays (like
19331 `int[n]'), rather than arrays of unknown size (like
19332 `int[]').) We'll get very confused by such a type since
19333 the bound of the array is not constant, and therefore
19334 not mangleable. Besides, such types are not allowed in
19335 ISO C++, so we can do as we please here. We do allow
19336 them for 'auto' deduction, since that isn't ABI-exposed. */
19337 if (!is_auto (parm
) && variably_modified_type_p (arg
, NULL_TREE
))
19338 return unify_vla_arg (explain_p
, arg
);
19340 /* Strip typedefs as in convert_template_argument. */
19341 arg
= canonicalize_type_argument (arg
, tf_none
);
19344 /* If ARG is a parameter pack or an expansion, we cannot unify
19345 against it unless PARM is also a parameter pack. */
19346 if ((template_parameter_pack_p (arg
) || PACK_EXPANSION_P (arg
))
19347 && !template_parameter_pack_p (parm
))
19348 return unify_parameter_pack_mismatch (explain_p
, parm
, arg
);
19350 /* If the argument deduction results is a METHOD_TYPE,
19351 then there is a problem.
19352 METHOD_TYPE doesn't map to any real C++ type the result of
19353 the deduction can not be of that type. */
19354 if (TREE_CODE (arg
) == METHOD_TYPE
)
19355 return unify_method_type_error (explain_p
, arg
);
19357 TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
) = arg
;
19358 return unify_success (explain_p
);
19360 case TEMPLATE_PARM_INDEX
:
19361 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, 0));
19362 if (error_operand_p (tparm
))
19363 return unify_invalid (explain_p
);
19365 if (TEMPLATE_PARM_LEVEL (parm
)
19366 != template_decl_level (tparm
))
19368 /* The PARM is not one we're trying to unify. Just check
19369 to see if it matches ARG. */
19370 int result
= !(TREE_CODE (arg
) == TREE_CODE (parm
)
19371 && cp_tree_equal (parm
, arg
));
19373 unify_expression_unequal (explain_p
, parm
, arg
);
19377 idx
= TEMPLATE_PARM_IDX (parm
);
19378 targ
= TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
);
19382 int x
= !cp_tree_equal (targ
, arg
);
19384 unify_inconsistency (explain_p
, parm
, targ
, arg
);
19388 /* [temp.deduct.type] If, in the declaration of a function template
19389 with a non-type template-parameter, the non-type
19390 template-parameter is used in an expression in the function
19391 parameter-list and, if the corresponding template-argument is
19392 deduced, the template-argument type shall match the type of the
19393 template-parameter exactly, except that a template-argument
19394 deduced from an array bound may be of any integral type.
19395 The non-type parameter might use already deduced type parameters. */
19396 tparm
= tsubst (TREE_TYPE (parm
), targs
, 0, NULL_TREE
);
19397 if (!TREE_TYPE (arg
))
19398 /* Template-parameter dependent expression. Just accept it for now.
19399 It will later be processed in convert_template_argument. */
19401 else if (same_type_p (TREE_TYPE (arg
), tparm
))
19403 else if ((strict
& UNIFY_ALLOW_INTEGER
)
19404 && CP_INTEGRAL_TYPE_P (tparm
))
19405 /* Convert the ARG to the type of PARM; the deduced non-type
19406 template argument must exactly match the types of the
19407 corresponding parameter. */
19408 arg
= fold (build_nop (tparm
, arg
));
19409 else if (uses_template_parms (tparm
))
19410 /* We haven't deduced the type of this parameter yet. Try again
19412 return unify_success (explain_p
);
19414 return unify_type_mismatch (explain_p
, tparm
, TREE_TYPE (arg
));
19416 /* If ARG is a parameter pack or an expansion, we cannot unify
19417 against it unless PARM is also a parameter pack. */
19418 if ((template_parameter_pack_p (arg
) || PACK_EXPANSION_P (arg
))
19419 && !TEMPLATE_PARM_PARAMETER_PACK (parm
))
19420 return unify_parameter_pack_mismatch (explain_p
, parm
, arg
);
19423 bool removed_attr
= false;
19424 arg
= strip_typedefs_expr (arg
, &removed_attr
);
19426 TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
) = arg
;
19427 return unify_success (explain_p
);
19431 /* A pointer-to-member constant can be unified only with
19432 another constant. */
19433 if (TREE_CODE (arg
) != PTRMEM_CST
)
19434 return unify_ptrmem_cst_mismatch (explain_p
, parm
, arg
);
19436 /* Just unify the class member. It would be useless (and possibly
19437 wrong, depending on the strict flags) to unify also
19438 PTRMEM_CST_CLASS, because we want to be sure that both parm and
19439 arg refer to the same variable, even if through different
19440 classes. For instance:
19442 struct A { int x; };
19445 Unification of &A::x and &B::x must succeed. */
19446 return unify (tparms
, targs
, PTRMEM_CST_MEMBER (parm
),
19447 PTRMEM_CST_MEMBER (arg
), strict
, explain_p
);
19452 if (!TYPE_PTR_P (arg
))
19453 return unify_type_mismatch (explain_p
, parm
, arg
);
19455 /* [temp.deduct.call]
19457 A can be another pointer or pointer to member type that can
19458 be converted to the deduced A via a qualification
19459 conversion (_conv.qual_).
19461 We pass down STRICT here rather than UNIFY_ALLOW_NONE.
19462 This will allow for additional cv-qualification of the
19463 pointed-to types if appropriate. */
19465 if (TREE_CODE (TREE_TYPE (arg
)) == RECORD_TYPE
)
19466 /* The derived-to-base conversion only persists through one
19467 level of pointers. */
19468 strict
|= (strict_in
& UNIFY_ALLOW_DERIVED
);
19470 return unify (tparms
, targs
, TREE_TYPE (parm
),
19471 TREE_TYPE (arg
), strict
, explain_p
);
19474 case REFERENCE_TYPE
:
19475 if (TREE_CODE (arg
) != REFERENCE_TYPE
)
19476 return unify_type_mismatch (explain_p
, parm
, arg
);
19477 return unify (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
19478 strict
& UNIFY_ALLOW_MORE_CV_QUAL
, explain_p
);
19481 if (TREE_CODE (arg
) != ARRAY_TYPE
)
19482 return unify_type_mismatch (explain_p
, parm
, arg
);
19483 if ((TYPE_DOMAIN (parm
) == NULL_TREE
)
19484 != (TYPE_DOMAIN (arg
) == NULL_TREE
))
19485 return unify_type_mismatch (explain_p
, parm
, arg
);
19486 RECUR_AND_CHECK_FAILURE (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
19487 strict
& UNIFY_ALLOW_MORE_CV_QUAL
, explain_p
);
19488 if (TYPE_DOMAIN (parm
) != NULL_TREE
)
19489 return unify_array_domain (tparms
, targs
, TYPE_DOMAIN (parm
),
19490 TYPE_DOMAIN (arg
), explain_p
);
19491 return unify_success (explain_p
);
19498 case ENUMERAL_TYPE
:
19501 if (TREE_CODE (arg
) != TREE_CODE (parm
))
19502 return unify_type_mismatch (explain_p
, parm
, arg
);
19504 /* We have already checked cv-qualification at the top of the
19506 if (!same_type_ignoring_top_level_qualifiers_p (arg
, parm
))
19507 return unify_type_mismatch (explain_p
, parm
, arg
);
19509 /* As far as unification is concerned, this wins. Later checks
19510 will invalidate it if necessary. */
19511 return unify_success (explain_p
);
19513 /* Types INTEGER_CST and MINUS_EXPR can come from array bounds. */
19514 /* Type INTEGER_CST can come from ordinary constant template args. */
19516 while (TREE_CODE (arg
) == NOP_EXPR
)
19517 arg
= TREE_OPERAND (arg
, 0);
19519 if (TREE_CODE (arg
) != INTEGER_CST
)
19520 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
19521 return (tree_int_cst_equal (parm
, arg
)
19522 ? unify_success (explain_p
)
19523 : unify_template_argument_mismatch (explain_p
, parm
, arg
));
19527 int i
, len
, argslen
;
19528 int parm_variadic_p
= 0;
19530 if (TREE_CODE (arg
) != TREE_VEC
)
19531 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
19533 len
= TREE_VEC_LENGTH (parm
);
19534 argslen
= TREE_VEC_LENGTH (arg
);
19536 /* Check for pack expansions in the parameters. */
19537 for (i
= 0; i
< len
; ++i
)
19539 if (PACK_EXPANSION_P (TREE_VEC_ELT (parm
, i
)))
19542 /* We can unify against something with a trailing
19544 parm_variadic_p
= 1;
19546 /* [temp.deduct.type]/9: If the template argument list of
19547 P contains a pack expansion that is not the last
19548 template argument, the entire template argument list
19549 is a non-deduced context. */
19550 return unify_success (explain_p
);
19554 /* If we don't have enough arguments to satisfy the parameters
19555 (not counting the pack expression at the end), or we have
19556 too many arguments for a parameter list that doesn't end in
19557 a pack expression, we can't unify. */
19558 if (parm_variadic_p
19559 ? argslen
< len
- parm_variadic_p
19561 return unify_arity (explain_p
, TREE_VEC_LENGTH (arg
), len
);
19563 /* Unify all of the parameters that precede the (optional)
19564 pack expression. */
19565 for (i
= 0; i
< len
- parm_variadic_p
; ++i
)
19567 RECUR_AND_CHECK_FAILURE (tparms
, targs
,
19568 TREE_VEC_ELT (parm
, i
),
19569 TREE_VEC_ELT (arg
, i
),
19570 UNIFY_ALLOW_NONE
, explain_p
);
19572 if (parm_variadic_p
)
19573 return unify_pack_expansion (tparms
, targs
, parm
, arg
,
19575 /*subr=*/true, explain_p
);
19576 return unify_success (explain_p
);
19581 if (TREE_CODE (arg
) != TREE_CODE (parm
))
19582 return unify_type_mismatch (explain_p
, parm
, arg
);
19584 if (TYPE_PTRMEMFUNC_P (parm
))
19586 if (!TYPE_PTRMEMFUNC_P (arg
))
19587 return unify_type_mismatch (explain_p
, parm
, arg
);
19589 return unify (tparms
, targs
,
19590 TYPE_PTRMEMFUNC_FN_TYPE (parm
),
19591 TYPE_PTRMEMFUNC_FN_TYPE (arg
),
19592 strict
, explain_p
);
19594 else if (TYPE_PTRMEMFUNC_P (arg
))
19595 return unify_type_mismatch (explain_p
, parm
, arg
);
19597 if (CLASSTYPE_TEMPLATE_INFO (parm
))
19599 tree t
= NULL_TREE
;
19601 if (strict_in
& UNIFY_ALLOW_DERIVED
)
19603 /* First, we try to unify the PARM and ARG directly. */
19604 t
= try_class_unification (tparms
, targs
,
19605 parm
, arg
, explain_p
);
19609 /* Fallback to the special case allowed in
19610 [temp.deduct.call]:
19612 If P is a class, and P has the form
19613 template-id, then A can be a derived class of
19614 the deduced A. Likewise, if P is a pointer to
19615 a class of the form template-id, A can be a
19616 pointer to a derived class pointed to by the
19618 enum template_base_result r
;
19619 r
= get_template_base (tparms
, targs
, parm
, arg
,
19623 return unify_no_common_base (explain_p
, r
, parm
, arg
);
19626 else if (CLASSTYPE_TEMPLATE_INFO (arg
)
19627 && (CLASSTYPE_TI_TEMPLATE (parm
)
19628 == CLASSTYPE_TI_TEMPLATE (arg
)))
19629 /* Perhaps PARM is something like S<U> and ARG is S<int>.
19630 Then, we should unify `int' and `U'. */
19633 /* There's no chance of unification succeeding. */
19634 return unify_type_mismatch (explain_p
, parm
, arg
);
19636 return unify (tparms
, targs
, CLASSTYPE_TI_ARGS (parm
),
19637 CLASSTYPE_TI_ARGS (t
), UNIFY_ALLOW_NONE
, explain_p
);
19639 else if (!same_type_ignoring_top_level_qualifiers_p (parm
, arg
))
19640 return unify_type_mismatch (explain_p
, parm
, arg
);
19641 return unify_success (explain_p
);
19644 case FUNCTION_TYPE
:
19646 unsigned int nargs
;
19651 if (TREE_CODE (arg
) != TREE_CODE (parm
))
19652 return unify_type_mismatch (explain_p
, parm
, arg
);
19654 /* CV qualifications for methods can never be deduced, they must
19655 match exactly. We need to check them explicitly here,
19656 because type_unification_real treats them as any other
19657 cv-qualified parameter. */
19658 if (TREE_CODE (parm
) == METHOD_TYPE
19659 && (!check_cv_quals_for_unify
19661 class_of_this_parm (arg
),
19662 class_of_this_parm (parm
))))
19663 return unify_cv_qual_mismatch (explain_p
, parm
, arg
);
19665 RECUR_AND_CHECK_FAILURE (tparms
, targs
, TREE_TYPE (parm
),
19666 TREE_TYPE (arg
), UNIFY_ALLOW_NONE
, explain_p
);
19668 nargs
= list_length (TYPE_ARG_TYPES (arg
));
19669 args
= XALLOCAVEC (tree
, nargs
);
19670 for (a
= TYPE_ARG_TYPES (arg
), i
= 0;
19671 a
!= NULL_TREE
&& a
!= void_list_node
;
19672 a
= TREE_CHAIN (a
), ++i
)
19673 args
[i
] = TREE_VALUE (a
);
19676 return type_unification_real (tparms
, targs
, TYPE_ARG_TYPES (parm
),
19677 args
, nargs
, 1, DEDUCE_EXACT
,
19678 LOOKUP_NORMAL
, NULL
, explain_p
);
19682 /* Unify a pointer to member with a pointer to member function, which
19683 deduces the type of the member as a function type. */
19684 if (TYPE_PTRMEMFUNC_P (arg
))
19686 /* Check top-level cv qualifiers */
19687 if (!check_cv_quals_for_unify (UNIFY_ALLOW_NONE
, arg
, parm
))
19688 return unify_cv_qual_mismatch (explain_p
, parm
, arg
);
19690 RECUR_AND_CHECK_FAILURE (tparms
, targs
, TYPE_OFFSET_BASETYPE (parm
),
19691 TYPE_PTRMEMFUNC_OBJECT_TYPE (arg
),
19692 UNIFY_ALLOW_NONE
, explain_p
);
19694 /* Determine the type of the function we are unifying against. */
19695 tree fntype
= static_fn_type (arg
);
19697 return unify (tparms
, targs
, TREE_TYPE (parm
), fntype
, strict
, explain_p
);
19700 if (TREE_CODE (arg
) != OFFSET_TYPE
)
19701 return unify_type_mismatch (explain_p
, parm
, arg
);
19702 RECUR_AND_CHECK_FAILURE (tparms
, targs
, TYPE_OFFSET_BASETYPE (parm
),
19703 TYPE_OFFSET_BASETYPE (arg
),
19704 UNIFY_ALLOW_NONE
, explain_p
);
19705 return unify (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
19706 strict
, explain_p
);
19709 if (DECL_TEMPLATE_PARM_P (parm
))
19710 return unify (tparms
, targs
, DECL_INITIAL (parm
), arg
, strict
, explain_p
);
19711 if (arg
!= scalar_constant_value (parm
))
19712 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
19713 return unify_success (explain_p
);
19716 case TEMPLATE_DECL
:
19717 /* Matched cases are handled by the ARG == PARM test above. */
19718 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
19721 /* A non-type template parameter that is a variable should be a
19722 an integral constant, in which case, it whould have been
19723 folded into its (constant) value. So we should not be getting
19724 a variable here. */
19725 gcc_unreachable ();
19727 case TYPE_ARGUMENT_PACK
:
19728 case NONTYPE_ARGUMENT_PACK
:
19729 return unify (tparms
, targs
, ARGUMENT_PACK_ARGS (parm
),
19730 ARGUMENT_PACK_ARGS (arg
), strict
, explain_p
);
19733 case DECLTYPE_TYPE
:
19734 case UNDERLYING_TYPE
:
19735 /* Cannot deduce anything from TYPEOF_TYPE, DECLTYPE_TYPE,
19736 or UNDERLYING_TYPE nodes. */
19737 return unify_success (explain_p
);
19740 /* Unification fails if we hit an error node. */
19741 return unify_invalid (explain_p
);
19744 if (REFERENCE_REF_P (parm
))
19746 if (REFERENCE_REF_P (arg
))
19747 arg
= TREE_OPERAND (arg
, 0);
19748 return unify (tparms
, targs
, TREE_OPERAND (parm
, 0), arg
,
19749 strict
, explain_p
);
19754 /* An unresolved overload is a nondeduced context. */
19755 if (is_overloaded_fn (parm
) || type_unknown_p (parm
))
19756 return unify_success (explain_p
);
19757 gcc_assert (EXPR_P (parm
));
19759 /* We must be looking at an expression. This can happen with
19763 void foo(S<I>, S<I + 2>);
19765 This is a "nondeduced context":
19769 The nondeduced contexts are:
19771 --A type that is a template-id in which one or more of
19772 the template-arguments is an expression that references
19773 a template-parameter.
19775 In these cases, we assume deduction succeeded, but don't
19776 actually infer any unifications. */
19778 if (!uses_template_parms (parm
)
19779 && !template_args_equal (parm
, arg
))
19780 return unify_expression_unequal (explain_p
, parm
, arg
);
19782 return unify_success (explain_p
);
19785 #undef RECUR_AND_CHECK_FAILURE
19787 /* Note that DECL can be defined in this translation unit, if
19791 mark_definable (tree decl
)
19794 DECL_NOT_REALLY_EXTERN (decl
) = 1;
19795 FOR_EACH_CLONE (clone
, decl
)
19796 DECL_NOT_REALLY_EXTERN (clone
) = 1;
19799 /* Called if RESULT is explicitly instantiated, or is a member of an
19800 explicitly instantiated class. */
19803 mark_decl_instantiated (tree result
, int extern_p
)
19805 SET_DECL_EXPLICIT_INSTANTIATION (result
);
19807 /* If this entity has already been written out, it's too late to
19808 make any modifications. */
19809 if (TREE_ASM_WRITTEN (result
))
19812 /* For anonymous namespace we don't need to do anything. */
19813 if (decl_anon_ns_mem_p (result
))
19815 gcc_assert (!TREE_PUBLIC (result
));
19819 if (TREE_CODE (result
) != FUNCTION_DECL
)
19820 /* The TREE_PUBLIC flag for function declarations will have been
19821 set correctly by tsubst. */
19822 TREE_PUBLIC (result
) = 1;
19824 /* This might have been set by an earlier implicit instantiation. */
19825 DECL_COMDAT (result
) = 0;
19828 DECL_NOT_REALLY_EXTERN (result
) = 0;
19831 mark_definable (result
);
19832 mark_needed (result
);
19833 /* Always make artificials weak. */
19834 if (DECL_ARTIFICIAL (result
) && flag_weak
)
19835 comdat_linkage (result
);
19836 /* For WIN32 we also want to put explicit instantiations in
19837 linkonce sections. */
19838 else if (TREE_PUBLIC (result
))
19839 maybe_make_one_only (result
);
19842 /* If EXTERN_P, then this function will not be emitted -- unless
19843 followed by an explicit instantiation, at which point its linkage
19844 will be adjusted. If !EXTERN_P, then this function will be
19845 emitted here. In neither circumstance do we want
19846 import_export_decl to adjust the linkage. */
19847 DECL_INTERFACE_KNOWN (result
) = 1;
19850 /* Subroutine of more_specialized_fn: check whether TARGS is missing any
19851 important template arguments. If any are missing, we check whether
19852 they're important by using error_mark_node for substituting into any
19853 args that were used for partial ordering (the ones between ARGS and END)
19854 and seeing if it bubbles up. */
19857 check_undeduced_parms (tree targs
, tree args
, tree end
)
19859 bool found
= false;
19861 for (i
= TREE_VEC_LENGTH (targs
) - 1; i
>= 0; --i
)
19862 if (TREE_VEC_ELT (targs
, i
) == NULL_TREE
)
19865 TREE_VEC_ELT (targs
, i
) = error_mark_node
;
19869 tree substed
= tsubst_arg_types (args
, targs
, end
, tf_none
, NULL_TREE
);
19870 if (substed
== error_mark_node
)
19876 /* Given two function templates PAT1 and PAT2, return:
19878 1 if PAT1 is more specialized than PAT2 as described in [temp.func.order].
19879 -1 if PAT2 is more specialized than PAT1.
19880 0 if neither is more specialized.
19882 LEN indicates the number of parameters we should consider
19883 (defaulted parameters should not be considered).
19885 The 1998 std underspecified function template partial ordering, and
19886 DR214 addresses the issue. We take pairs of arguments, one from
19887 each of the templates, and deduce them against each other. One of
19888 the templates will be more specialized if all the *other*
19889 template's arguments deduce against its arguments and at least one
19890 of its arguments *does* *not* deduce against the other template's
19891 corresponding argument. Deduction is done as for class templates.
19892 The arguments used in deduction have reference and top level cv
19893 qualifiers removed. Iff both arguments were originally reference
19894 types *and* deduction succeeds in both directions, an lvalue reference
19895 wins against an rvalue reference and otherwise the template
19896 with the more cv-qualified argument wins for that pairing (if
19897 neither is more cv-qualified, they both are equal). Unlike regular
19898 deduction, after all the arguments have been deduced in this way,
19899 we do *not* verify the deduced template argument values can be
19900 substituted into non-deduced contexts.
19902 The logic can be a bit confusing here, because we look at deduce1 and
19903 targs1 to see if pat2 is at least as specialized, and vice versa; if we
19904 can find template arguments for pat1 to make arg1 look like arg2, that
19905 means that arg2 is at least as specialized as arg1. */
19908 more_specialized_fn (tree pat1
, tree pat2
, int len
)
19910 tree decl1
= DECL_TEMPLATE_RESULT (pat1
);
19911 tree decl2
= DECL_TEMPLATE_RESULT (pat2
);
19912 tree targs1
= make_tree_vec (DECL_NTPARMS (pat1
));
19913 tree targs2
= make_tree_vec (DECL_NTPARMS (pat2
));
19914 tree tparms1
= DECL_INNERMOST_TEMPLATE_PARMS (pat1
);
19915 tree tparms2
= DECL_INNERMOST_TEMPLATE_PARMS (pat2
);
19916 tree args1
= TYPE_ARG_TYPES (TREE_TYPE (decl1
));
19917 tree args2
= TYPE_ARG_TYPES (TREE_TYPE (decl2
));
19918 tree origs1
, origs2
;
19919 bool lose1
= false;
19920 bool lose2
= false;
19922 /* Remove the this parameter from non-static member functions. If
19923 one is a non-static member function and the other is not a static
19924 member function, remove the first parameter from that function
19925 also. This situation occurs for operator functions where we
19926 locate both a member function (with this pointer) and non-member
19927 operator (with explicit first operand). */
19928 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl1
))
19930 len
--; /* LEN is the number of significant arguments for DECL1 */
19931 args1
= TREE_CHAIN (args1
);
19932 if (!DECL_STATIC_FUNCTION_P (decl2
))
19933 args2
= TREE_CHAIN (args2
);
19935 else if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl2
))
19937 args2
= TREE_CHAIN (args2
);
19938 if (!DECL_STATIC_FUNCTION_P (decl1
))
19941 args1
= TREE_CHAIN (args1
);
19945 /* If only one is a conversion operator, they are unordered. */
19946 if (DECL_CONV_FN_P (decl1
) != DECL_CONV_FN_P (decl2
))
19949 /* Consider the return type for a conversion function */
19950 if (DECL_CONV_FN_P (decl1
))
19952 args1
= tree_cons (NULL_TREE
, TREE_TYPE (TREE_TYPE (decl1
)), args1
);
19953 args2
= tree_cons (NULL_TREE
, TREE_TYPE (TREE_TYPE (decl2
)), args2
);
19957 processing_template_decl
++;
19963 /* Stop when an ellipsis is seen. */
19964 && args1
!= NULL_TREE
&& args2
!= NULL_TREE
)
19966 tree arg1
= TREE_VALUE (args1
);
19967 tree arg2
= TREE_VALUE (args2
);
19968 int deduce1
, deduce2
;
19974 if (TREE_CODE (arg1
) == TYPE_PACK_EXPANSION
19975 && TREE_CODE (arg2
) == TYPE_PACK_EXPANSION
)
19977 /* When both arguments are pack expansions, we need only
19978 unify the patterns themselves. */
19979 arg1
= PACK_EXPANSION_PATTERN (arg1
);
19980 arg2
= PACK_EXPANSION_PATTERN (arg2
);
19982 /* This is the last comparison we need to do. */
19986 if (TREE_CODE (arg1
) == REFERENCE_TYPE
)
19988 ref1
= TYPE_REF_IS_RVALUE (arg1
) + 1;
19989 arg1
= TREE_TYPE (arg1
);
19990 quals1
= cp_type_quals (arg1
);
19993 if (TREE_CODE (arg2
) == REFERENCE_TYPE
)
19995 ref2
= TYPE_REF_IS_RVALUE (arg2
) + 1;
19996 arg2
= TREE_TYPE (arg2
);
19997 quals2
= cp_type_quals (arg2
);
20000 arg1
= TYPE_MAIN_VARIANT (arg1
);
20001 arg2
= TYPE_MAIN_VARIANT (arg2
);
20003 if (TREE_CODE (arg1
) == TYPE_PACK_EXPANSION
)
20005 int i
, len2
= list_length (args2
);
20006 tree parmvec
= make_tree_vec (1);
20007 tree argvec
= make_tree_vec (len2
);
20010 /* Setup the parameter vector, which contains only ARG1. */
20011 TREE_VEC_ELT (parmvec
, 0) = arg1
;
20013 /* Setup the argument vector, which contains the remaining
20015 for (i
= 0; i
< len2
; i
++, ta
= TREE_CHAIN (ta
))
20016 TREE_VEC_ELT (argvec
, i
) = TREE_VALUE (ta
);
20018 deduce1
= (unify_pack_expansion (tparms1
, targs1
, parmvec
,
20019 argvec
, DEDUCE_EXACT
,
20020 /*subr=*/true, /*explain_p=*/false)
20023 /* We cannot deduce in the other direction, because ARG1 is
20024 a pack expansion but ARG2 is not. */
20027 else if (TREE_CODE (arg2
) == TYPE_PACK_EXPANSION
)
20029 int i
, len1
= list_length (args1
);
20030 tree parmvec
= make_tree_vec (1);
20031 tree argvec
= make_tree_vec (len1
);
20034 /* Setup the parameter vector, which contains only ARG1. */
20035 TREE_VEC_ELT (parmvec
, 0) = arg2
;
20037 /* Setup the argument vector, which contains the remaining
20039 for (i
= 0; i
< len1
; i
++, ta
= TREE_CHAIN (ta
))
20040 TREE_VEC_ELT (argvec
, i
) = TREE_VALUE (ta
);
20042 deduce2
= (unify_pack_expansion (tparms2
, targs2
, parmvec
,
20043 argvec
, DEDUCE_EXACT
,
20044 /*subr=*/true, /*explain_p=*/false)
20047 /* We cannot deduce in the other direction, because ARG2 is
20048 a pack expansion but ARG1 is not.*/
20054 /* The normal case, where neither argument is a pack
20056 deduce1
= (unify (tparms1
, targs1
, arg1
, arg2
,
20057 UNIFY_ALLOW_NONE
, /*explain_p=*/false)
20059 deduce2
= (unify (tparms2
, targs2
, arg2
, arg1
,
20060 UNIFY_ALLOW_NONE
, /*explain_p=*/false)
20064 /* If we couldn't deduce arguments for tparms1 to make arg1 match
20065 arg2, then arg2 is not as specialized as arg1. */
20071 /* "If, for a given type, deduction succeeds in both directions
20072 (i.e., the types are identical after the transformations above)
20073 and both P and A were reference types (before being replaced with
20074 the type referred to above):
20075 - if the type from the argument template was an lvalue reference and
20076 the type from the parameter template was not, the argument type is
20077 considered to be more specialized than the other; otherwise,
20078 - if the type from the argument template is more cv-qualified
20079 than the type from the parameter template (as described above),
20080 the argument type is considered to be more specialized than the other;
20082 - neither type is more specialized than the other." */
20084 if (deduce1
&& deduce2
)
20086 if (ref1
&& ref2
&& ref1
!= ref2
)
20093 else if (quals1
!= quals2
&& quals1
>= 0 && quals2
>= 0)
20095 if ((quals1
& quals2
) == quals2
)
20097 if ((quals1
& quals2
) == quals1
)
20102 if (lose1
&& lose2
)
20103 /* We've failed to deduce something in either direction.
20104 These must be unordered. */
20107 if (TREE_CODE (arg1
) == TYPE_PACK_EXPANSION
20108 || TREE_CODE (arg2
) == TYPE_PACK_EXPANSION
)
20109 /* We have already processed all of the arguments in our
20110 handing of the pack expansion type. */
20113 args1
= TREE_CHAIN (args1
);
20114 args2
= TREE_CHAIN (args2
);
20117 /* "In most cases, all template parameters must have values in order for
20118 deduction to succeed, but for partial ordering purposes a template
20119 parameter may remain without a value provided it is not used in the
20120 types being used for partial ordering."
20122 Thus, if we are missing any of the targs1 we need to substitute into
20123 origs1, then pat2 is not as specialized as pat1. This can happen when
20124 there is a nondeduced context. */
20125 if (!lose2
&& check_undeduced_parms (targs1
, origs1
, args1
))
20127 if (!lose1
&& check_undeduced_parms (targs2
, origs2
, args2
))
20130 processing_template_decl
--;
20132 /* If both deductions succeed, the partial ordering selects the more
20133 constrained template. */
20134 if (!lose1
&& !lose2
)
20136 tree c1
= get_constraints (DECL_TEMPLATE_RESULT (pat1
));
20137 tree c2
= get_constraints (DECL_TEMPLATE_RESULT (pat2
));
20138 lose1
= !subsumes_constraints (c1
, c2
);
20139 lose2
= !subsumes_constraints (c2
, c1
);
20142 /* All things being equal, if the next argument is a pack expansion
20143 for one function but not for the other, prefer the
20144 non-variadic function. FIXME this is bogus; see c++/41958. */
20146 && args1
&& TREE_VALUE (args1
)
20147 && args2
&& TREE_VALUE (args2
))
20149 lose1
= TREE_CODE (TREE_VALUE (args1
)) == TYPE_PACK_EXPANSION
;
20150 lose2
= TREE_CODE (TREE_VALUE (args2
)) == TYPE_PACK_EXPANSION
;
20153 if (lose1
== lose2
)
20161 /* Determine which of two partial specializations of TMPL is more
20164 PAT1 is a TREE_LIST whose TREE_VALUE is the TEMPLATE_DECL corresponding
20165 to the first partial specialization. The TREE_PURPOSE is the
20166 innermost set of template parameters for the partial
20167 specialization. PAT2 is similar, but for the second template.
20169 Return 1 if the first partial specialization is more specialized;
20170 -1 if the second is more specialized; 0 if neither is more
20173 See [temp.class.order] for information about determining which of
20174 two templates is more specialized. */
20177 more_specialized_partial_spec (tree tmpl
, tree pat1
, tree pat2
)
20181 bool any_deductions
= false;
20183 tree tmpl1
= TREE_VALUE (pat1
);
20184 tree tmpl2
= TREE_VALUE (pat2
);
20185 tree parms1
= DECL_INNERMOST_TEMPLATE_PARMS (tmpl1
);
20186 tree parms2
= DECL_INNERMOST_TEMPLATE_PARMS (tmpl2
);
20187 tree specargs1
= TI_ARGS (get_template_info (DECL_TEMPLATE_RESULT (tmpl1
)));
20188 tree specargs2
= TI_ARGS (get_template_info (DECL_TEMPLATE_RESULT (tmpl2
)));
20190 /* Just like what happens for functions, if we are ordering between
20191 different template specializations, we may encounter dependent
20192 types in the arguments, and we need our dependency check functions
20193 to behave correctly. */
20194 ++processing_template_decl
;
20195 targs
= get_partial_spec_bindings (tmpl
, parms1
, specargs1
, specargs2
);
20199 any_deductions
= true;
20202 targs
= get_partial_spec_bindings (tmpl
, parms2
, specargs2
, specargs1
);
20206 any_deductions
= true;
20208 --processing_template_decl
;
20210 /* If both deductions succeed, the partial ordering selects the more
20211 constrained template. */
20212 if (!winner
&& any_deductions
)
20213 return more_constrained (tmpl1
, tmpl2
);
20215 /* In the case of a tie where at least one of the templates
20216 has a parameter pack at the end, the template with the most
20217 non-packed parameters wins. */
20220 && (template_args_variadic_p (TREE_PURPOSE (pat1
))
20221 || template_args_variadic_p (TREE_PURPOSE (pat2
))))
20223 tree args1
= INNERMOST_TEMPLATE_ARGS (TREE_PURPOSE (pat1
));
20224 tree args2
= INNERMOST_TEMPLATE_ARGS (TREE_PURPOSE (pat2
));
20225 int len1
= TREE_VEC_LENGTH (args1
);
20226 int len2
= TREE_VEC_LENGTH (args2
);
20228 /* We don't count the pack expansion at the end. */
20229 if (template_args_variadic_p (TREE_PURPOSE (pat1
)))
20231 if (template_args_variadic_p (TREE_PURPOSE (pat2
)))
20236 else if (len1
< len2
)
20243 /* Return the template arguments that will produce the function signature
20244 DECL from the function template FN, with the explicit template
20245 arguments EXPLICIT_ARGS. If CHECK_RETTYPE is true, the return type must
20246 also match. Return NULL_TREE if no satisfactory arguments could be
20250 get_bindings (tree fn
, tree decl
, tree explicit_args
, bool check_rettype
)
20252 int ntparms
= DECL_NTPARMS (fn
);
20253 tree targs
= make_tree_vec (ntparms
);
20254 tree decl_type
= TREE_TYPE (decl
);
20255 tree decl_arg_types
;
20257 unsigned int nargs
, ix
;
20260 gcc_assert (decl
!= DECL_TEMPLATE_RESULT (fn
));
20262 /* Never do unification on the 'this' parameter. */
20263 decl_arg_types
= skip_artificial_parms_for (decl
,
20264 TYPE_ARG_TYPES (decl_type
));
20266 nargs
= list_length (decl_arg_types
);
20267 args
= XALLOCAVEC (tree
, nargs
);
20268 for (arg
= decl_arg_types
, ix
= 0;
20269 arg
!= NULL_TREE
&& arg
!= void_list_node
;
20270 arg
= TREE_CHAIN (arg
), ++ix
)
20271 args
[ix
] = TREE_VALUE (arg
);
20273 if (fn_type_unification (fn
, explicit_args
, targs
,
20275 (check_rettype
|| DECL_CONV_FN_P (fn
)
20276 ? TREE_TYPE (decl_type
) : NULL_TREE
),
20277 DEDUCE_EXACT
, LOOKUP_NORMAL
, /*explain_p=*/false,
20279 == error_mark_node
)
20285 /* Return the innermost template arguments that, when applied to a partial
20286 specialization of TMPL whose innermost template parameters are
20287 TPARMS, and whose specialization arguments are SPEC_ARGS, yield the
20290 For example, suppose we have:
20292 template <class T, class U> struct S {};
20293 template <class T> struct S<T*, int> {};
20295 Then, suppose we want to get `S<double*, int>'. The TPARMS will be
20296 {T}, the SPEC_ARGS will be {T*, int} and the ARGS will be {double*,
20297 int}. The resulting vector will be {double}, indicating that `T'
20298 is bound to `double'. */
20301 get_partial_spec_bindings (tree tmpl
, tree tparms
, tree spec_args
, tree args
)
20303 int i
, ntparms
= TREE_VEC_LENGTH (tparms
);
20305 tree innermost_deduced_args
;
20307 innermost_deduced_args
= make_tree_vec (ntparms
);
20308 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (args
))
20310 deduced_args
= copy_node (args
);
20311 SET_TMPL_ARGS_LEVEL (deduced_args
,
20312 TMPL_ARGS_DEPTH (deduced_args
),
20313 innermost_deduced_args
);
20316 deduced_args
= innermost_deduced_args
;
20318 if (unify (tparms
, deduced_args
,
20319 INNERMOST_TEMPLATE_ARGS (spec_args
),
20320 INNERMOST_TEMPLATE_ARGS (args
),
20321 UNIFY_ALLOW_NONE
, /*explain_p=*/false))
20324 for (i
= 0; i
< ntparms
; ++i
)
20325 if (! TREE_VEC_ELT (innermost_deduced_args
, i
))
20328 /* Verify that nondeduced template arguments agree with the type
20329 obtained from argument deduction.
20333 struct A { typedef int X; };
20334 template <class T, class U> struct C {};
20335 template <class T> struct C<T, typename T::X> {};
20337 Then with the instantiation `C<A, int>', we can deduce that
20338 `T' is `A' but unify () does not check whether `typename T::X'
20340 spec_args
= tsubst (spec_args
, deduced_args
, tf_none
, NULL_TREE
);
20341 spec_args
= coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (tmpl
),
20343 tf_none
, false, false);
20344 if (spec_args
== error_mark_node
20345 /* We only need to check the innermost arguments; the other
20346 arguments will always agree. */
20347 || !comp_template_args (INNERMOST_TEMPLATE_ARGS (spec_args
),
20348 INNERMOST_TEMPLATE_ARGS (args
)))
20351 /* Now that we have bindings for all of the template arguments,
20352 ensure that the arguments deduced for the template template
20353 parameters have compatible template parameter lists. See the use
20354 of template_template_parm_bindings_ok_p in fn_type_unification
20355 for more information. */
20356 if (!template_template_parm_bindings_ok_p (tparms
, deduced_args
))
20359 return deduced_args
;
20362 // Compare two function templates T1 and T2 by deducing bindings
20363 // from one against the other. If both deductions succeed, compare
20364 // constraints to see which is more constrained.
20366 more_specialized_inst (tree t1
, tree t2
)
20371 if (get_bindings (t1
, DECL_TEMPLATE_RESULT (t2
), NULL_TREE
, true))
20377 if (get_bindings (t2
, DECL_TEMPLATE_RESULT (t1
), NULL_TREE
, true))
20383 // If both deductions succeed, then one may be more constrained.
20384 if (count
== 2 && fate
== 0)
20385 fate
= more_constrained (t1
, t2
);
20390 /* TEMPLATES is a TREE_LIST. Each TREE_VALUE is a TEMPLATE_DECL.
20391 Return the TREE_LIST node with the most specialized template, if
20392 any. If there is no most specialized template, the error_mark_node
20395 Note that this function does not look at, or modify, the
20396 TREE_PURPOSE or TREE_TYPE of any of the nodes. Since the node
20397 returned is one of the elements of INSTANTIATIONS, callers may
20398 store information in the TREE_PURPOSE or TREE_TYPE of the nodes,
20399 and retrieve it from the value returned. */
20402 most_specialized_instantiation (tree templates
)
20406 ++processing_template_decl
;
20409 for (fn
= TREE_CHAIN (templates
); fn
; fn
= TREE_CHAIN (fn
))
20411 int fate
= more_specialized_inst (TREE_VALUE (champ
), TREE_VALUE (fn
));
20416 /* Equally specialized, move to next function. If there
20417 is no next function, nothing's most specialized. */
20418 fn
= TREE_CHAIN (fn
);
20426 /* Now verify that champ is better than everything earlier in the
20427 instantiation list. */
20428 for (fn
= templates
; fn
!= champ
; fn
= TREE_CHAIN (fn
)) {
20429 if (more_specialized_inst (TREE_VALUE (champ
), TREE_VALUE (fn
)) != 1)
20436 processing_template_decl
--;
20439 return error_mark_node
;
20444 /* If DECL is a specialization of some template, return the most
20445 general such template. Otherwise, returns NULL_TREE.
20447 For example, given:
20449 template <class T> struct S { template <class U> void f(U); };
20451 if TMPL is `template <class U> void S<int>::f(U)' this will return
20452 the full template. This function will not trace past partial
20453 specializations, however. For example, given in addition:
20455 template <class T> struct S<T*> { template <class U> void f(U); };
20457 if TMPL is `template <class U> void S<int*>::f(U)' this will return
20458 `template <class T> template <class U> S<T*>::f(U)'. */
20461 most_general_template (tree decl
)
20463 if (TREE_CODE (decl
) != TEMPLATE_DECL
)
20465 if (tree tinfo
= get_template_info (decl
))
20466 decl
= TI_TEMPLATE (tinfo
);
20467 /* The TI_TEMPLATE can be an IDENTIFIER_NODE for a
20468 template friend, or a FIELD_DECL for a capture pack. */
20469 if (TREE_CODE (decl
) != TEMPLATE_DECL
)
20473 /* Look for more and more general templates. */
20474 while (DECL_LANG_SPECIFIC (decl
) && DECL_TEMPLATE_INFO (decl
))
20476 /* The DECL_TI_TEMPLATE can be an IDENTIFIER_NODE in some cases.
20477 (See cp-tree.h for details.) */
20478 if (TREE_CODE (DECL_TI_TEMPLATE (decl
)) != TEMPLATE_DECL
)
20481 if (CLASS_TYPE_P (TREE_TYPE (decl
))
20482 && !TYPE_DECL_ALIAS_P (TYPE_NAME (TREE_TYPE (decl
)))
20483 && CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_TYPE (decl
)))
20486 /* Stop if we run into an explicitly specialized class template. */
20487 if (!DECL_NAMESPACE_SCOPE_P (decl
)
20488 && DECL_CONTEXT (decl
)
20489 && CLASSTYPE_TEMPLATE_SPECIALIZATION (DECL_CONTEXT (decl
)))
20492 decl
= DECL_TI_TEMPLATE (decl
);
20498 /* Return the most specialized of the template partial specializations
20499 which can produce TARGET, a specialization of some class or variable
20500 template. The value returned is actually a TREE_LIST; the TREE_VALUE is
20501 a TEMPLATE_DECL node corresponding to the partial specialization, while
20502 the TREE_PURPOSE is the set of template arguments that must be
20503 substituted into the template pattern in order to generate TARGET.
20505 If the choice of partial specialization is ambiguous, a diagnostic
20506 is issued, and the error_mark_node is returned. If there are no
20507 partial specializations matching TARGET, then NULL_TREE is
20508 returned, indicating that the primary template should be used. */
20511 most_specialized_partial_spec (tree target
, tsubst_flags_t complain
)
20513 tree list
= NULL_TREE
;
20518 tree outer_args
= NULL_TREE
;
20521 if (TYPE_P (target
))
20523 tree tinfo
= CLASSTYPE_TEMPLATE_INFO (target
);
20524 tmpl
= TI_TEMPLATE (tinfo
);
20525 args
= TI_ARGS (tinfo
);
20527 else if (TREE_CODE (target
) == TEMPLATE_ID_EXPR
)
20529 tmpl
= TREE_OPERAND (target
, 0);
20530 args
= TREE_OPERAND (target
, 1);
20532 else if (VAR_P (target
))
20534 tree tinfo
= DECL_TEMPLATE_INFO (target
);
20535 tmpl
= TI_TEMPLATE (tinfo
);
20536 args
= TI_ARGS (tinfo
);
20539 gcc_unreachable ();
20541 tree main_tmpl
= most_general_template (tmpl
);
20543 /* For determining which partial specialization to use, only the
20544 innermost args are interesting. */
20545 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (args
))
20547 outer_args
= strip_innermost_template_args (args
, 1);
20548 args
= INNERMOST_TEMPLATE_ARGS (args
);
20551 for (t
= DECL_TEMPLATE_SPECIALIZATIONS (main_tmpl
); t
; t
= TREE_CHAIN (t
))
20553 tree partial_spec_args
;
20555 tree spec_tmpl
= TREE_VALUE (t
);
20557 partial_spec_args
= TREE_PURPOSE (t
);
20559 ++processing_template_decl
;
20563 /* Discard the outer levels of args, and then substitute in the
20564 template args from the enclosing class. */
20565 partial_spec_args
= INNERMOST_TEMPLATE_ARGS (partial_spec_args
);
20566 partial_spec_args
= tsubst_template_args
20567 (partial_spec_args
, outer_args
, tf_none
, NULL_TREE
);
20569 /* And the same for the partial specialization TEMPLATE_DECL. */
20570 spec_tmpl
= tsubst (spec_tmpl
, outer_args
, tf_none
, NULL_TREE
);
20573 partial_spec_args
=
20574 coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (tmpl
),
20577 /*require_all_args=*/true,
20578 /*use_default_args=*/true);
20580 --processing_template_decl
;
20582 if (partial_spec_args
== error_mark_node
)
20583 return error_mark_node
;
20584 if (spec_tmpl
== error_mark_node
)
20585 return error_mark_node
;
20587 tree parms
= DECL_INNERMOST_TEMPLATE_PARMS (spec_tmpl
);
20588 spec_args
= get_partial_spec_bindings (tmpl
, parms
,
20594 spec_args
= add_to_template_args (outer_args
, spec_args
);
20596 /* Keep the candidate only if the constraints are satisfied,
20597 or if we're not compiling with concepts. */
20599 || constraints_satisfied_p (spec_tmpl
, spec_args
))
20601 list
= tree_cons (spec_args
, TREE_VALUE (t
), list
);
20602 TREE_TYPE (list
) = TREE_TYPE (t
);
20610 ambiguous_p
= false;
20613 t
= TREE_CHAIN (t
);
20614 for (; t
; t
= TREE_CHAIN (t
))
20616 fate
= more_specialized_partial_spec (tmpl
, champ
, t
);
20623 t
= TREE_CHAIN (t
);
20626 ambiguous_p
= true;
20635 for (t
= list
; t
&& t
!= champ
; t
= TREE_CHAIN (t
))
20637 fate
= more_specialized_partial_spec (tmpl
, champ
, t
);
20640 ambiguous_p
= true;
20648 char *spaces
= NULL
;
20649 if (!(complain
& tf_error
))
20650 return error_mark_node
;
20651 if (TYPE_P (target
))
20652 error ("ambiguous template instantiation for %q#T", target
);
20654 error ("ambiguous template instantiation for %q#D", target
);
20655 str
= ngettext ("candidate is:", "candidates are:", list_length (list
));
20656 for (t
= list
; t
; t
= TREE_CHAIN (t
))
20658 tree subst
= build_tree_list (TREE_VALUE (t
), TREE_PURPOSE (t
));
20659 inform (DECL_SOURCE_LOCATION (TREE_VALUE (t
)),
20660 "%s %#S", spaces
? spaces
: str
, subst
);
20661 spaces
= spaces
? spaces
: get_spaces (str
);
20664 return error_mark_node
;
20670 /* Explicitly instantiate DECL. */
20673 do_decl_instantiation (tree decl
, tree storage
)
20675 tree result
= NULL_TREE
;
20678 if (!decl
|| decl
== error_mark_node
)
20679 /* An error occurred, for which grokdeclarator has already issued
20680 an appropriate message. */
20682 else if (! DECL_LANG_SPECIFIC (decl
))
20684 error ("explicit instantiation of non-template %q#D", decl
);
20688 bool var_templ
= (DECL_TEMPLATE_INFO (decl
)
20689 && variable_template_p (DECL_TI_TEMPLATE (decl
)));
20691 if (VAR_P (decl
) && !var_templ
)
20693 /* There is an asymmetry here in the way VAR_DECLs and
20694 FUNCTION_DECLs are handled by grokdeclarator. In the case of
20695 the latter, the DECL we get back will be marked as a
20696 template instantiation, and the appropriate
20697 DECL_TEMPLATE_INFO will be set up. This does not happen for
20698 VAR_DECLs so we do the lookup here. Probably, grokdeclarator
20699 should handle VAR_DECLs as it currently handles
20701 if (!DECL_CLASS_SCOPE_P (decl
))
20703 error ("%qD is not a static data member of a class template", decl
);
20706 result
= lookup_field (DECL_CONTEXT (decl
), DECL_NAME (decl
), 0, false);
20707 if (!result
|| !VAR_P (result
))
20709 error ("no matching template for %qD found", decl
);
20712 if (!same_type_p (TREE_TYPE (result
), TREE_TYPE (decl
)))
20714 error ("type %qT for explicit instantiation %qD does not match "
20715 "declared type %qT", TREE_TYPE (result
), decl
,
20720 else if (TREE_CODE (decl
) != FUNCTION_DECL
&& !var_templ
)
20722 error ("explicit instantiation of %q#D", decl
);
20728 /* Check for various error cases. Note that if the explicit
20729 instantiation is valid the RESULT will currently be marked as an
20730 *implicit* instantiation; DECL_EXPLICIT_INSTANTIATION is not set
20731 until we get here. */
20733 if (DECL_TEMPLATE_SPECIALIZATION (result
))
20735 /* DR 259 [temp.spec].
20737 Both an explicit instantiation and a declaration of an explicit
20738 specialization shall not appear in a program unless the explicit
20739 instantiation follows a declaration of the explicit specialization.
20741 For a given set of template parameters, if an explicit
20742 instantiation of a template appears after a declaration of an
20743 explicit specialization for that template, the explicit
20744 instantiation has no effect. */
20747 else if (DECL_EXPLICIT_INSTANTIATION (result
))
20751 No program shall explicitly instantiate any template more
20754 We check DECL_NOT_REALLY_EXTERN so as not to complain when
20755 the first instantiation was `extern' and the second is not,
20756 and EXTERN_P for the opposite case. */
20757 if (DECL_NOT_REALLY_EXTERN (result
) && !extern_p
)
20758 permerror (input_location
, "duplicate explicit instantiation of %q#D", result
);
20759 /* If an "extern" explicit instantiation follows an ordinary
20760 explicit instantiation, the template is instantiated. */
20764 else if (!DECL_IMPLICIT_INSTANTIATION (result
))
20766 error ("no matching template for %qD found", result
);
20769 else if (!DECL_TEMPLATE_INFO (result
))
20771 permerror (input_location
, "explicit instantiation of non-template %q#D", result
);
20775 if (storage
== NULL_TREE
)
20777 else if (storage
== ridpointers
[(int) RID_EXTERN
])
20779 if (!in_system_header_at (input_location
) && (cxx_dialect
== cxx98
))
20780 pedwarn (input_location
, OPT_Wpedantic
,
20781 "ISO C++ 1998 forbids the use of %<extern%> on explicit "
20786 error ("storage class %qD applied to template instantiation", storage
);
20788 check_explicit_instantiation_namespace (result
);
20789 mark_decl_instantiated (result
, extern_p
);
20791 instantiate_decl (result
, /*defer_ok=*/1,
20792 /*expl_inst_class_mem_p=*/false);
20796 mark_class_instantiated (tree t
, int extern_p
)
20798 SET_CLASSTYPE_EXPLICIT_INSTANTIATION (t
);
20799 SET_CLASSTYPE_INTERFACE_KNOWN (t
);
20800 CLASSTYPE_INTERFACE_ONLY (t
) = extern_p
;
20801 TYPE_DECL_SUPPRESS_DEBUG (TYPE_NAME (t
)) = extern_p
;
20804 CLASSTYPE_DEBUG_REQUESTED (t
) = 1;
20805 rest_of_type_compilation (t
, 1);
20809 /* Called from do_type_instantiation through binding_table_foreach to
20810 do recursive instantiation for the type bound in ENTRY. */
20812 bt_instantiate_type_proc (binding_entry entry
, void *data
)
20814 tree storage
= *(tree
*) data
;
20816 if (MAYBE_CLASS_TYPE_P (entry
->type
)
20817 && !uses_template_parms (CLASSTYPE_TI_ARGS (entry
->type
)))
20818 do_type_instantiation (TYPE_MAIN_DECL (entry
->type
), storage
, 0);
20821 /* Called from do_type_instantiation to instantiate a member
20822 (a member function or a static member variable) of an
20823 explicitly instantiated class template. */
20825 instantiate_class_member (tree decl
, int extern_p
)
20827 mark_decl_instantiated (decl
, extern_p
);
20829 instantiate_decl (decl
, /*defer_ok=*/1,
20830 /*expl_inst_class_mem_p=*/true);
20833 /* Perform an explicit instantiation of template class T. STORAGE, if
20834 non-null, is the RID for extern, inline or static. COMPLAIN is
20835 nonzero if this is called from the parser, zero if called recursively,
20836 since the standard is unclear (as detailed below). */
20839 do_type_instantiation (tree t
, tree storage
, tsubst_flags_t complain
)
20844 int previous_instantiation_extern_p
= 0;
20846 if (TREE_CODE (t
) == TYPE_DECL
)
20849 if (! CLASS_TYPE_P (t
) || ! CLASSTYPE_TEMPLATE_INFO (t
))
20852 (TYPE_TEMPLATE_INFO (t
)) ? TYPE_TI_TEMPLATE (t
) : NULL
;
20854 error ("explicit instantiation of non-class template %qD", tmpl
);
20856 error ("explicit instantiation of non-template type %qT", t
);
20862 if (!COMPLETE_TYPE_P (t
))
20864 if (complain
& tf_error
)
20865 error ("explicit instantiation of %q#T before definition of template",
20870 if (storage
!= NULL_TREE
)
20872 if (!in_system_header_at (input_location
))
20874 if (storage
== ridpointers
[(int) RID_EXTERN
])
20876 if (cxx_dialect
== cxx98
)
20877 pedwarn (input_location
, OPT_Wpedantic
,
20878 "ISO C++ 1998 forbids the use of %<extern%> on "
20879 "explicit instantiations");
20882 pedwarn (input_location
, OPT_Wpedantic
,
20883 "ISO C++ forbids the use of %qE"
20884 " on explicit instantiations", storage
);
20887 if (storage
== ridpointers
[(int) RID_INLINE
])
20889 else if (storage
== ridpointers
[(int) RID_EXTERN
])
20891 else if (storage
== ridpointers
[(int) RID_STATIC
])
20895 error ("storage class %qD applied to template instantiation",
20901 if (CLASSTYPE_TEMPLATE_SPECIALIZATION (t
))
20903 /* DR 259 [temp.spec].
20905 Both an explicit instantiation and a declaration of an explicit
20906 specialization shall not appear in a program unless the explicit
20907 instantiation follows a declaration of the explicit specialization.
20909 For a given set of template parameters, if an explicit
20910 instantiation of a template appears after a declaration of an
20911 explicit specialization for that template, the explicit
20912 instantiation has no effect. */
20915 else if (CLASSTYPE_EXPLICIT_INSTANTIATION (t
))
20919 No program shall explicitly instantiate any template more
20922 If PREVIOUS_INSTANTIATION_EXTERN_P, then the first explicit
20923 instantiation was `extern'. If EXTERN_P then the second is.
20924 These cases are OK. */
20925 previous_instantiation_extern_p
= CLASSTYPE_INTERFACE_ONLY (t
);
20927 if (!previous_instantiation_extern_p
&& !extern_p
20928 && (complain
& tf_error
))
20929 permerror (input_location
, "duplicate explicit instantiation of %q#T", t
);
20931 /* If we've already instantiated the template, just return now. */
20932 if (!CLASSTYPE_INTERFACE_ONLY (t
))
20936 check_explicit_instantiation_namespace (TYPE_NAME (t
));
20937 mark_class_instantiated (t
, extern_p
);
20945 /* In contrast to implicit instantiation, where only the
20946 declarations, and not the definitions, of members are
20947 instantiated, we have here:
20951 The explicit instantiation of a class template specialization
20952 implies the instantiation of all of its members not
20953 previously explicitly specialized in the translation unit
20954 containing the explicit instantiation.
20956 Of course, we can't instantiate member template classes, since
20957 we don't have any arguments for them. Note that the standard
20958 is unclear on whether the instantiation of the members are
20959 *explicit* instantiations or not. However, the most natural
20960 interpretation is that it should be an explicit instantiation. */
20963 for (tmp
= TYPE_METHODS (t
); tmp
; tmp
= DECL_CHAIN (tmp
))
20964 if (TREE_CODE (tmp
) == FUNCTION_DECL
20965 && DECL_TEMPLATE_INSTANTIATION (tmp
))
20966 instantiate_class_member (tmp
, extern_p
);
20968 for (tmp
= TYPE_FIELDS (t
); tmp
; tmp
= DECL_CHAIN (tmp
))
20969 if (VAR_P (tmp
) && DECL_TEMPLATE_INSTANTIATION (tmp
))
20970 instantiate_class_member (tmp
, extern_p
);
20972 if (CLASSTYPE_NESTED_UTDS (t
))
20973 binding_table_foreach (CLASSTYPE_NESTED_UTDS (t
),
20974 bt_instantiate_type_proc
, &storage
);
20978 /* Given a function DECL, which is a specialization of TMPL, modify
20979 DECL to be a re-instantiation of TMPL with the same template
20980 arguments. TMPL should be the template into which tsubst'ing
20981 should occur for DECL, not the most general template.
20983 One reason for doing this is a scenario like this:
20986 void f(const T&, int i);
20988 void g() { f(3, 7); }
20991 void f(const T& t, const int i) { }
20993 Note that when the template is first instantiated, with
20994 instantiate_template, the resulting DECL will have no name for the
20995 first parameter, and the wrong type for the second. So, when we go
20996 to instantiate the DECL, we regenerate it. */
20999 regenerate_decl_from_template (tree decl
, tree tmpl
)
21001 /* The arguments used to instantiate DECL, from the most general
21006 args
= DECL_TI_ARGS (decl
);
21007 code_pattern
= DECL_TEMPLATE_RESULT (tmpl
);
21009 /* Make sure that we can see identifiers, and compute access
21011 push_access_scope (decl
);
21013 if (TREE_CODE (decl
) == FUNCTION_DECL
)
21021 args_depth
= TMPL_ARGS_DEPTH (args
);
21022 parms_depth
= TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl
));
21023 if (args_depth
> parms_depth
)
21024 args
= get_innermost_template_args (args
, parms_depth
);
21026 specs
= tsubst_exception_specification (TREE_TYPE (code_pattern
),
21027 args
, tf_error
, NULL_TREE
,
21028 /*defer_ok*/false);
21029 if (specs
&& specs
!= error_mark_node
)
21030 TREE_TYPE (decl
) = build_exception_variant (TREE_TYPE (decl
),
21033 /* Merge parameter declarations. */
21034 decl_parm
= skip_artificial_parms_for (decl
,
21035 DECL_ARGUMENTS (decl
));
21037 = skip_artificial_parms_for (code_pattern
,
21038 DECL_ARGUMENTS (code_pattern
));
21039 while (decl_parm
&& !DECL_PACK_P (pattern_parm
))
21044 if (DECL_NAME (decl_parm
) != DECL_NAME (pattern_parm
))
21045 DECL_NAME (decl_parm
) = DECL_NAME (pattern_parm
);
21046 parm_type
= tsubst (TREE_TYPE (pattern_parm
), args
, tf_error
,
21048 parm_type
= type_decays_to (parm_type
);
21049 if (!same_type_p (TREE_TYPE (decl_parm
), parm_type
))
21050 TREE_TYPE (decl_parm
) = parm_type
;
21051 attributes
= DECL_ATTRIBUTES (pattern_parm
);
21052 if (DECL_ATTRIBUTES (decl_parm
) != attributes
)
21054 DECL_ATTRIBUTES (decl_parm
) = attributes
;
21055 cplus_decl_attributes (&decl_parm
, attributes
, /*flags=*/0);
21057 decl_parm
= DECL_CHAIN (decl_parm
);
21058 pattern_parm
= DECL_CHAIN (pattern_parm
);
21060 /* Merge any parameters that match with the function parameter
21062 if (pattern_parm
&& DECL_PACK_P (pattern_parm
))
21065 tree expanded_types
;
21066 /* Expand the TYPE_PACK_EXPANSION that provides the types for
21067 the parameters in this function parameter pack. */
21068 expanded_types
= tsubst_pack_expansion (TREE_TYPE (pattern_parm
),
21069 args
, tf_error
, NULL_TREE
);
21070 len
= TREE_VEC_LENGTH (expanded_types
);
21071 for (i
= 0; i
< len
; i
++)
21076 if (DECL_NAME (decl_parm
) != DECL_NAME (pattern_parm
))
21077 /* Rename the parameter to include the index. */
21078 DECL_NAME (decl_parm
) =
21079 make_ith_pack_parameter_name (DECL_NAME (pattern_parm
), i
);
21080 parm_type
= TREE_VEC_ELT (expanded_types
, i
);
21081 parm_type
= type_decays_to (parm_type
);
21082 if (!same_type_p (TREE_TYPE (decl_parm
), parm_type
))
21083 TREE_TYPE (decl_parm
) = parm_type
;
21084 attributes
= DECL_ATTRIBUTES (pattern_parm
);
21085 if (DECL_ATTRIBUTES (decl_parm
) != attributes
)
21087 DECL_ATTRIBUTES (decl_parm
) = attributes
;
21088 cplus_decl_attributes (&decl_parm
, attributes
, /*flags=*/0);
21090 decl_parm
= DECL_CHAIN (decl_parm
);
21093 /* Merge additional specifiers from the CODE_PATTERN. */
21094 if (DECL_DECLARED_INLINE_P (code_pattern
)
21095 && !DECL_DECLARED_INLINE_P (decl
))
21096 DECL_DECLARED_INLINE_P (decl
) = 1;
21098 else if (VAR_P (decl
))
21100 DECL_INITIAL (decl
) =
21101 tsubst_expr (DECL_INITIAL (code_pattern
), args
,
21102 tf_error
, DECL_TI_TEMPLATE (decl
),
21103 /*integral_constant_expression_p=*/false);
21104 if (VAR_HAD_UNKNOWN_BOUND (decl
))
21105 TREE_TYPE (decl
) = tsubst (TREE_TYPE (code_pattern
), args
,
21106 tf_error
, DECL_TI_TEMPLATE (decl
));
21109 gcc_unreachable ();
21111 pop_access_scope (decl
);
21114 /* Return the TEMPLATE_DECL into which DECL_TI_ARGS(DECL) should be
21115 substituted to get DECL. */
21118 template_for_substitution (tree decl
)
21120 tree tmpl
= DECL_TI_TEMPLATE (decl
);
21122 /* Set TMPL to the template whose DECL_TEMPLATE_RESULT is the pattern
21123 for the instantiation. This is not always the most general
21124 template. Consider, for example:
21127 struct S { template <class U> void f();
21128 template <> void f<int>(); };
21130 and an instantiation of S<double>::f<int>. We want TD to be the
21131 specialization S<T>::f<int>, not the more general S<T>::f<U>. */
21132 while (/* An instantiation cannot have a definition, so we need a
21133 more general template. */
21134 DECL_TEMPLATE_INSTANTIATION (tmpl
)
21135 /* We must also deal with friend templates. Given:
21137 template <class T> struct S {
21138 template <class U> friend void f() {};
21141 S<int>::f<U> say, is not an instantiation of S<T>::f<U>,
21142 so far as the language is concerned, but that's still
21143 where we get the pattern for the instantiation from. On
21144 other hand, if the definition comes outside the class, say:
21146 template <class T> struct S {
21147 template <class U> friend void f();
21149 template <class U> friend void f() {}
21151 we don't need to look any further. That's what the check for
21152 DECL_INITIAL is for. */
21153 || (TREE_CODE (decl
) == FUNCTION_DECL
21154 && DECL_FRIEND_PSEUDO_TEMPLATE_INSTANTIATION (tmpl
)
21155 && !DECL_INITIAL (DECL_TEMPLATE_RESULT (tmpl
))))
21157 /* The present template, TD, should not be a definition. If it
21158 were a definition, we should be using it! Note that we
21159 cannot restructure the loop to just keep going until we find
21160 a template with a definition, since that might go too far if
21161 a specialization was declared, but not defined. */
21163 /* Fetch the more general template. */
21164 tmpl
= DECL_TI_TEMPLATE (tmpl
);
21170 /* Returns true if we need to instantiate this template instance even if we
21171 know we aren't going to emit it. */
21174 always_instantiate_p (tree decl
)
21176 /* We always instantiate inline functions so that we can inline them. An
21177 explicit instantiation declaration prohibits implicit instantiation of
21178 non-inline functions. With high levels of optimization, we would
21179 normally inline non-inline functions -- but we're not allowed to do
21180 that for "extern template" functions. Therefore, we check
21181 DECL_DECLARED_INLINE_P, rather than possibly_inlined_p. */
21182 return ((TREE_CODE (decl
) == FUNCTION_DECL
21183 && (DECL_DECLARED_INLINE_P (decl
)
21184 || type_uses_auto (TREE_TYPE (TREE_TYPE (decl
)))))
21185 /* And we need to instantiate static data members so that
21186 their initializers are available in integral constant
21189 && decl_maybe_constant_var_p (decl
)));
21192 /* If FN has a noexcept-specifier that hasn't been instantiated yet,
21193 instantiate it now, modifying TREE_TYPE (fn). */
21196 maybe_instantiate_noexcept (tree fn
)
21198 tree fntype
, spec
, noex
, clone
;
21200 /* Don't instantiate a noexcept-specification from template context. */
21201 if (processing_template_decl
)
21204 if (DECL_CLONED_FUNCTION_P (fn
))
21205 fn
= DECL_CLONED_FUNCTION (fn
);
21206 fntype
= TREE_TYPE (fn
);
21207 spec
= TYPE_RAISES_EXCEPTIONS (fntype
);
21209 if (!spec
|| !TREE_PURPOSE (spec
))
21212 noex
= TREE_PURPOSE (spec
);
21214 if (TREE_CODE (noex
) == DEFERRED_NOEXCEPT
)
21216 if (DEFERRED_NOEXCEPT_PATTERN (noex
) == NULL_TREE
)
21217 spec
= get_defaulted_eh_spec (fn
);
21218 else if (push_tinst_level (fn
))
21220 push_access_scope (fn
);
21221 push_deferring_access_checks (dk_no_deferred
);
21222 input_location
= DECL_SOURCE_LOCATION (fn
);
21223 noex
= tsubst_copy_and_build (DEFERRED_NOEXCEPT_PATTERN (noex
),
21224 DEFERRED_NOEXCEPT_ARGS (noex
),
21225 tf_warning_or_error
, fn
,
21226 /*function_p=*/false,
21227 /*integral_constant_expression_p=*/true);
21228 pop_deferring_access_checks ();
21229 pop_access_scope (fn
);
21230 pop_tinst_level ();
21231 spec
= build_noexcept_spec (noex
, tf_warning_or_error
);
21232 if (spec
== error_mark_node
)
21233 spec
= noexcept_false_spec
;
21236 spec
= noexcept_false_spec
;
21238 TREE_TYPE (fn
) = build_exception_variant (fntype
, spec
);
21241 FOR_EACH_CLONE (clone
, fn
)
21243 if (TREE_TYPE (clone
) == fntype
)
21244 TREE_TYPE (clone
) = TREE_TYPE (fn
);
21246 TREE_TYPE (clone
) = build_exception_variant (TREE_TYPE (clone
), spec
);
21250 /* Produce the definition of D, a _DECL generated from a template. If
21251 DEFER_OK is nonzero, then we don't have to actually do the
21252 instantiation now; we just have to do it sometime. Normally it is
21253 an error if this is an explicit instantiation but D is undefined.
21254 EXPL_INST_CLASS_MEM_P is true iff D is a member of an
21255 explicitly instantiated class template. */
21258 instantiate_decl (tree d
, int defer_ok
,
21259 bool expl_inst_class_mem_p
)
21261 tree tmpl
= DECL_TI_TEMPLATE (d
);
21268 bool pattern_defined
;
21269 location_t saved_loc
= input_location
;
21270 int saved_unevaluated_operand
= cp_unevaluated_operand
;
21271 int saved_inhibit_evaluation_warnings
= c_inhibit_evaluation_warnings
;
21275 bool nested
= false;
21277 /* This function should only be used to instantiate templates for
21278 functions and static member variables. */
21279 gcc_assert (VAR_OR_FUNCTION_DECL_P (d
));
21281 /* A concept is never instantiated. */
21282 gcc_assert (!DECL_DECLARED_CONCEPT_P (d
));
21284 /* Variables are never deferred; if instantiation is required, they
21285 are instantiated right away. That allows for better code in the
21286 case that an expression refers to the value of the variable --
21287 if the variable has a constant value the referring expression can
21288 take advantage of that fact. */
21290 || DECL_DECLARED_CONSTEXPR_P (d
))
21293 /* Don't instantiate cloned functions. Instead, instantiate the
21294 functions they cloned. */
21295 if (TREE_CODE (d
) == FUNCTION_DECL
&& DECL_CLONED_FUNCTION_P (d
))
21296 d
= DECL_CLONED_FUNCTION (d
);
21298 if (DECL_TEMPLATE_INSTANTIATED (d
)
21299 || (TREE_CODE (d
) == FUNCTION_DECL
21300 && DECL_DEFAULTED_FN (d
) && DECL_INITIAL (d
))
21301 || DECL_TEMPLATE_SPECIALIZATION (d
))
21302 /* D has already been instantiated or explicitly specialized, so
21303 there's nothing for us to do here.
21305 It might seem reasonable to check whether or not D is an explicit
21306 instantiation, and, if so, stop here. But when an explicit
21307 instantiation is deferred until the end of the compilation,
21308 DECL_EXPLICIT_INSTANTIATION is set, even though we still need to do
21309 the instantiation. */
21312 /* Check to see whether we know that this template will be
21313 instantiated in some other file, as with "extern template"
21315 external_p
= (DECL_INTERFACE_KNOWN (d
) && DECL_REALLY_EXTERN (d
));
21317 /* In general, we do not instantiate such templates. */
21318 if (external_p
&& !always_instantiate_p (d
))
21321 gen_tmpl
= most_general_template (tmpl
);
21322 gen_args
= DECL_TI_ARGS (d
);
21324 if (tmpl
!= gen_tmpl
)
21325 /* We should already have the extra args. */
21326 gcc_assert (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (gen_tmpl
))
21327 == TMPL_ARGS_DEPTH (gen_args
));
21328 /* And what's in the hash table should match D. */
21329 gcc_assert ((spec
= retrieve_specialization (gen_tmpl
, gen_args
, 0)) == d
21330 || spec
== NULL_TREE
);
21332 /* This needs to happen before any tsubsting. */
21333 if (! push_tinst_level (d
))
21336 timevar_push (TV_TEMPLATE_INST
);
21338 /* Set TD to the template whose DECL_TEMPLATE_RESULT is the pattern
21339 for the instantiation. */
21340 td
= template_for_substitution (d
);
21341 code_pattern
= DECL_TEMPLATE_RESULT (td
);
21343 /* We should never be trying to instantiate a member of a class
21344 template or partial specialization. */
21345 gcc_assert (d
!= code_pattern
);
21347 if ((DECL_NAMESPACE_SCOPE_P (d
) && !DECL_INITIALIZED_IN_CLASS_P (d
))
21348 || DECL_TEMPLATE_SPECIALIZATION (td
))
21349 /* In the case of a friend template whose definition is provided
21350 outside the class, we may have too many arguments. Drop the
21351 ones we don't need. The same is true for specializations. */
21352 args
= get_innermost_template_args
21353 (gen_args
, TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (td
)));
21357 if (TREE_CODE (d
) == FUNCTION_DECL
)
21359 deleted_p
= DECL_DELETED_FN (code_pattern
);
21360 pattern_defined
= (DECL_SAVED_TREE (code_pattern
) != NULL_TREE
21361 || DECL_DEFAULTED_OUTSIDE_CLASS_P (code_pattern
)
21367 pattern_defined
= ! DECL_IN_AGGR_P (code_pattern
);
21370 /* We may be in the middle of deferred access check. Disable it now. */
21371 push_deferring_access_checks (dk_no_deferred
);
21373 /* Unless an explicit instantiation directive has already determined
21374 the linkage of D, remember that a definition is available for
21376 if (pattern_defined
21377 && !DECL_INTERFACE_KNOWN (d
)
21378 && !DECL_NOT_REALLY_EXTERN (d
))
21379 mark_definable (d
);
21381 DECL_SOURCE_LOCATION (td
) = DECL_SOURCE_LOCATION (code_pattern
);
21382 DECL_SOURCE_LOCATION (d
) = DECL_SOURCE_LOCATION (code_pattern
);
21383 input_location
= DECL_SOURCE_LOCATION (d
);
21385 /* If D is a member of an explicitly instantiated class template,
21386 and no definition is available, treat it like an implicit
21388 if (!pattern_defined
&& expl_inst_class_mem_p
21389 && DECL_EXPLICIT_INSTANTIATION (d
))
21391 /* Leave linkage flags alone on instantiations with anonymous
21393 if (TREE_PUBLIC (d
))
21395 DECL_NOT_REALLY_EXTERN (d
) = 0;
21396 DECL_INTERFACE_KNOWN (d
) = 0;
21398 SET_DECL_IMPLICIT_INSTANTIATION (d
);
21401 /* Defer all other templates, unless we have been explicitly
21402 forbidden from doing so. */
21403 if (/* If there is no definition, we cannot instantiate the
21406 /* If it's OK to postpone instantiation, do so. */
21408 /* If this is a static data member that will be defined
21409 elsewhere, we don't want to instantiate the entire data
21410 member, but we do want to instantiate the initializer so that
21411 we can substitute that elsewhere. */
21412 || (external_p
&& VAR_P (d
))
21413 /* Handle here a deleted function too, avoid generating
21414 its body (c++/61080). */
21417 /* The definition of the static data member is now required so
21418 we must substitute the initializer. */
21420 && !DECL_INITIAL (d
)
21421 && DECL_INITIAL (code_pattern
))
21425 bool const_init
= false;
21426 bool enter_context
= DECL_CLASS_SCOPE_P (d
);
21428 ns
= decl_namespace_context (d
);
21429 push_nested_namespace (ns
);
21431 push_nested_class (DECL_CONTEXT (d
));
21432 init
= tsubst_expr (DECL_INITIAL (code_pattern
),
21434 tf_warning_or_error
, NULL_TREE
,
21435 /*integral_constant_expression_p=*/false);
21436 /* If instantiating the initializer involved instantiating this
21437 again, don't call cp_finish_decl twice. */
21438 if (!DECL_INITIAL (d
))
21440 /* Make sure the initializer is still constant, in case of
21441 circular dependency (template/instantiate6.C). */
21443 = DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (code_pattern
);
21444 cp_finish_decl (d
, init
, /*init_const_expr_p=*/const_init
,
21445 /*asmspec_tree=*/NULL_TREE
,
21446 LOOKUP_ONLYCONVERTING
);
21449 pop_nested_class ();
21450 pop_nested_namespace (ns
);
21453 /* We restore the source position here because it's used by
21454 add_pending_template. */
21455 input_location
= saved_loc
;
21457 if (at_eof
&& !pattern_defined
21458 && DECL_EXPLICIT_INSTANTIATION (d
)
21459 && DECL_NOT_REALLY_EXTERN (d
))
21462 The definition of a non-exported function template, a
21463 non-exported member function template, or a non-exported
21464 member function or static data member of a class template
21465 shall be present in every translation unit in which it is
21466 explicitly instantiated. */
21467 permerror (input_location
, "explicit instantiation of %qD "
21468 "but no definition available", d
);
21470 /* If we're in unevaluated context, we just wanted to get the
21471 constant value; this isn't an odr use, so don't queue
21472 a full instantiation. */
21473 if (cp_unevaluated_operand
!= 0)
21475 /* ??? Historically, we have instantiated inline functions, even
21476 when marked as "extern template". */
21477 if (!(external_p
&& VAR_P (d
)))
21478 add_pending_template (d
);
21481 /* Tell the repository that D is available in this translation unit
21482 -- and see if it is supposed to be instantiated here. */
21483 if (TREE_PUBLIC (d
) && !DECL_REALLY_EXTERN (d
) && !repo_emit_p (d
))
21485 /* In a PCH file, despite the fact that the repository hasn't
21486 requested instantiation in the PCH it is still possible that
21487 an instantiation will be required in a file that includes the
21490 add_pending_template (d
);
21491 /* Instantiate inline functions so that the inliner can do its
21492 job, even though we'll not be emitting a copy of this
21494 if (!(TREE_CODE (d
) == FUNCTION_DECL
&& possibly_inlined_p (d
)))
21498 fn_context
= decl_function_context (d
);
21499 nested
= (current_function_decl
!= NULL_TREE
);
21500 vec
<tree
> omp_privatization_save
;
21502 save_omp_privatization_clauses (omp_privatization_save
);
21505 push_to_top_level ();
21509 push_function_context ();
21510 cp_unevaluated_operand
= 0;
21511 c_inhibit_evaluation_warnings
= 0;
21514 /* Mark D as instantiated so that recursive calls to
21515 instantiate_decl do not try to instantiate it again. */
21516 DECL_TEMPLATE_INSTANTIATED (d
) = 1;
21518 /* Regenerate the declaration in case the template has been modified
21519 by a subsequent redeclaration. */
21520 regenerate_decl_from_template (d
, td
);
21522 /* We already set the file and line above. Reset them now in case
21523 they changed as a result of calling regenerate_decl_from_template. */
21524 input_location
= DECL_SOURCE_LOCATION (d
);
21529 bool const_init
= false;
21531 /* Clear out DECL_RTL; whatever was there before may not be right
21532 since we've reset the type of the declaration. */
21533 SET_DECL_RTL (d
, NULL
);
21534 DECL_IN_AGGR_P (d
) = 0;
21536 /* The initializer is placed in DECL_INITIAL by
21537 regenerate_decl_from_template so we don't need to
21538 push/pop_access_scope again here. Pull it out so that
21539 cp_finish_decl can process it. */
21540 init
= DECL_INITIAL (d
);
21541 DECL_INITIAL (d
) = NULL_TREE
;
21542 DECL_INITIALIZED_P (d
) = 0;
21544 /* Clear DECL_EXTERNAL so that cp_finish_decl will process the
21545 initializer. That function will defer actual emission until
21546 we have a chance to determine linkage. */
21547 DECL_EXTERNAL (d
) = 0;
21549 /* Enter the scope of D so that access-checking works correctly. */
21550 bool enter_context
= DECL_CLASS_SCOPE_P (d
);
21552 push_nested_class (DECL_CONTEXT (d
));
21554 const_init
= DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (code_pattern
);
21555 cp_finish_decl (d
, init
, const_init
, NULL_TREE
, 0);
21558 pop_nested_class ();
21560 if (variable_template_p (td
))
21561 note_variable_template_instantiation (d
);
21563 else if (TREE_CODE (d
) == FUNCTION_DECL
&& DECL_DEFAULTED_FN (code_pattern
))
21564 synthesize_method (d
);
21565 else if (TREE_CODE (d
) == FUNCTION_DECL
)
21567 hash_map
<tree
, tree
> *saved_local_specializations
;
21571 tree block
= NULL_TREE
;
21573 /* Save away the current list, in case we are instantiating one
21574 template from within the body of another. */
21575 saved_local_specializations
= local_specializations
;
21577 /* Set up the list of local specializations. */
21578 local_specializations
= new hash_map
<tree
, tree
>;
21580 /* Set up context. */
21581 if (DECL_OMP_DECLARE_REDUCTION_P (code_pattern
)
21582 && TREE_CODE (DECL_CONTEXT (code_pattern
)) == FUNCTION_DECL
)
21583 block
= push_stmt_list ();
21585 start_preparsed_function (d
, NULL_TREE
, SF_PRE_PARSED
);
21587 /* Some typedefs referenced from within the template code need to be
21588 access checked at template instantiation time, i.e now. These
21589 types were added to the template at parsing time. Let's get those
21590 and perform the access checks then. */
21591 perform_typedefs_access_check (DECL_TEMPLATE_RESULT (gen_tmpl
),
21594 /* Create substitution entries for the parameters. */
21595 subst_decl
= DECL_TEMPLATE_RESULT (template_for_substitution (d
));
21596 tmpl_parm
= DECL_ARGUMENTS (subst_decl
);
21597 spec_parm
= DECL_ARGUMENTS (d
);
21598 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (d
))
21600 register_local_specialization (spec_parm
, tmpl_parm
);
21601 spec_parm
= skip_artificial_parms_for (d
, spec_parm
);
21602 tmpl_parm
= skip_artificial_parms_for (subst_decl
, tmpl_parm
);
21604 for (; tmpl_parm
; tmpl_parm
= DECL_CHAIN (tmpl_parm
))
21606 if (!DECL_PACK_P (tmpl_parm
))
21608 register_local_specialization (spec_parm
, tmpl_parm
);
21609 spec_parm
= DECL_CHAIN (spec_parm
);
21613 /* Register the (value) argument pack as a specialization of
21614 TMPL_PARM, then move on. */
21615 tree argpack
= extract_fnparm_pack (tmpl_parm
, &spec_parm
);
21616 register_local_specialization (argpack
, tmpl_parm
);
21619 gcc_assert (!spec_parm
);
21621 /* Substitute into the body of the function. */
21622 if (DECL_OMP_DECLARE_REDUCTION_P (code_pattern
))
21623 tsubst_omp_udr (DECL_SAVED_TREE (code_pattern
), args
,
21624 tf_warning_or_error
, tmpl
);
21627 tsubst_expr (DECL_SAVED_TREE (code_pattern
), args
,
21628 tf_warning_or_error
, tmpl
,
21629 /*integral_constant_expression_p=*/false);
21631 /* Set the current input_location to the end of the function
21632 so that finish_function knows where we are. */
21634 = DECL_STRUCT_FUNCTION (code_pattern
)->function_end_locus
;
21636 /* Remember if we saw an infinite loop in the template. */
21637 current_function_infinite_loop
21638 = DECL_STRUCT_FUNCTION (code_pattern
)->language
->infinite_loop
;
21641 /* We don't need the local specializations any more. */
21642 delete local_specializations
;
21643 local_specializations
= saved_local_specializations
;
21645 /* Finish the function. */
21646 if (DECL_OMP_DECLARE_REDUCTION_P (code_pattern
)
21647 && TREE_CODE (DECL_CONTEXT (code_pattern
)) == FUNCTION_DECL
)
21648 DECL_SAVED_TREE (d
) = pop_stmt_list (block
);
21651 d
= finish_function (0);
21652 expand_or_defer_fn (d
);
21655 if (DECL_OMP_DECLARE_REDUCTION_P (code_pattern
))
21656 cp_check_omp_declare_reduction (d
);
21659 /* We're not deferring instantiation any more. */
21660 TI_PENDING_TEMPLATE_FLAG (DECL_TEMPLATE_INFO (d
)) = 0;
21663 pop_from_top_level ();
21665 pop_function_context ();
21668 input_location
= saved_loc
;
21669 cp_unevaluated_operand
= saved_unevaluated_operand
;
21670 c_inhibit_evaluation_warnings
= saved_inhibit_evaluation_warnings
;
21671 pop_deferring_access_checks ();
21672 pop_tinst_level ();
21674 restore_omp_privatization_clauses (omp_privatization_save
);
21676 timevar_pop (TV_TEMPLATE_INST
);
21681 /* Run through the list of templates that we wish we could
21682 instantiate, and instantiate any we can. RETRIES is the
21683 number of times we retry pending template instantiation. */
21686 instantiate_pending_templates (int retries
)
21689 location_t saved_loc
= input_location
;
21691 /* Instantiating templates may trigger vtable generation. This in turn
21692 may require further template instantiations. We place a limit here
21693 to avoid infinite loop. */
21694 if (pending_templates
&& retries
>= max_tinst_depth
)
21696 tree decl
= pending_templates
->tinst
->decl
;
21698 fatal_error (input_location
,
21699 "template instantiation depth exceeds maximum of %d"
21700 " instantiating %q+D, possibly from virtual table generation"
21701 " (use -ftemplate-depth= to increase the maximum)",
21702 max_tinst_depth
, decl
);
21703 if (TREE_CODE (decl
) == FUNCTION_DECL
)
21704 /* Pretend that we defined it. */
21705 DECL_INITIAL (decl
) = error_mark_node
;
21711 struct pending_template
**t
= &pending_templates
;
21712 struct pending_template
*last
= NULL
;
21716 tree instantiation
= reopen_tinst_level ((*t
)->tinst
);
21717 bool complete
= false;
21719 if (TYPE_P (instantiation
))
21723 if (!COMPLETE_TYPE_P (instantiation
))
21725 instantiate_class_template (instantiation
);
21726 if (CLASSTYPE_TEMPLATE_INSTANTIATION (instantiation
))
21727 for (fn
= TYPE_METHODS (instantiation
);
21729 fn
= TREE_CHAIN (fn
))
21730 if (! DECL_ARTIFICIAL (fn
))
21731 instantiate_decl (fn
,
21733 /*expl_inst_class_mem_p=*/false);
21734 if (COMPLETE_TYPE_P (instantiation
))
21738 complete
= COMPLETE_TYPE_P (instantiation
);
21742 if (!DECL_TEMPLATE_SPECIALIZATION (instantiation
)
21743 && !DECL_TEMPLATE_INSTANTIATED (instantiation
))
21746 = instantiate_decl (instantiation
,
21748 /*expl_inst_class_mem_p=*/false);
21749 if (DECL_TEMPLATE_INSTANTIATED (instantiation
))
21753 complete
= (DECL_TEMPLATE_SPECIALIZATION (instantiation
)
21754 || DECL_TEMPLATE_INSTANTIATED (instantiation
));
21758 /* If INSTANTIATION has been instantiated, then we don't
21759 need to consider it again in the future. */
21767 current_tinst_level
= NULL
;
21769 last_pending_template
= last
;
21771 while (reconsider
);
21773 input_location
= saved_loc
;
21776 /* Substitute ARGVEC into T, which is a list of initializers for
21777 either base class or a non-static data member. The TREE_PURPOSEs
21778 are DECLs, and the TREE_VALUEs are the initializer values. Used by
21779 instantiate_decl. */
21782 tsubst_initializer_list (tree t
, tree argvec
)
21784 tree inits
= NULL_TREE
;
21786 for (; t
; t
= TREE_CHAIN (t
))
21790 tree expanded_bases
= NULL_TREE
;
21791 tree expanded_arguments
= NULL_TREE
;
21794 if (TREE_CODE (TREE_PURPOSE (t
)) == TYPE_PACK_EXPANSION
)
21799 /* Expand the base class expansion type into separate base
21801 expanded_bases
= tsubst_pack_expansion (TREE_PURPOSE (t
), argvec
,
21802 tf_warning_or_error
,
21804 if (expanded_bases
== error_mark_node
)
21807 /* We'll be building separate TREE_LISTs of arguments for
21809 len
= TREE_VEC_LENGTH (expanded_bases
);
21810 expanded_arguments
= make_tree_vec (len
);
21811 for (i
= 0; i
< len
; i
++)
21812 TREE_VEC_ELT (expanded_arguments
, i
) = NULL_TREE
;
21814 /* Build a dummy EXPR_PACK_EXPANSION that will be used to
21815 expand each argument in the TREE_VALUE of t. */
21816 expr
= make_node (EXPR_PACK_EXPANSION
);
21817 PACK_EXPANSION_LOCAL_P (expr
) = true;
21818 PACK_EXPANSION_PARAMETER_PACKS (expr
) =
21819 PACK_EXPANSION_PARAMETER_PACKS (TREE_PURPOSE (t
));
21821 if (TREE_VALUE (t
) == void_type_node
)
21822 /* VOID_TYPE_NODE is used to indicate
21823 value-initialization. */
21825 for (i
= 0; i
< len
; i
++)
21826 TREE_VEC_ELT (expanded_arguments
, i
) = void_type_node
;
21830 /* Substitute parameter packs into each argument in the
21832 in_base_initializer
= 1;
21833 for (arg
= TREE_VALUE (t
); arg
; arg
= TREE_CHAIN (arg
))
21835 tree expanded_exprs
;
21837 /* Expand the argument. */
21838 SET_PACK_EXPANSION_PATTERN (expr
, TREE_VALUE (arg
));
21840 = tsubst_pack_expansion (expr
, argvec
,
21841 tf_warning_or_error
,
21843 if (expanded_exprs
== error_mark_node
)
21846 /* Prepend each of the expanded expressions to the
21847 corresponding TREE_LIST in EXPANDED_ARGUMENTS. */
21848 for (i
= 0; i
< len
; i
++)
21850 TREE_VEC_ELT (expanded_arguments
, i
) =
21851 tree_cons (NULL_TREE
,
21852 TREE_VEC_ELT (expanded_exprs
, i
),
21853 TREE_VEC_ELT (expanded_arguments
, i
));
21856 in_base_initializer
= 0;
21858 /* Reverse all of the TREE_LISTs in EXPANDED_ARGUMENTS,
21859 since we built them backwards. */
21860 for (i
= 0; i
< len
; i
++)
21862 TREE_VEC_ELT (expanded_arguments
, i
) =
21863 nreverse (TREE_VEC_ELT (expanded_arguments
, i
));
21868 for (i
= 0; i
< len
; ++i
)
21870 if (expanded_bases
)
21872 decl
= TREE_VEC_ELT (expanded_bases
, i
);
21873 decl
= expand_member_init (decl
);
21874 init
= TREE_VEC_ELT (expanded_arguments
, i
);
21879 decl
= tsubst_copy (TREE_PURPOSE (t
), argvec
,
21880 tf_warning_or_error
, NULL_TREE
);
21882 decl
= expand_member_init (decl
);
21883 if (decl
&& !DECL_P (decl
))
21884 in_base_initializer
= 1;
21886 init
= TREE_VALUE (t
);
21888 if (init
!= void_type_node
)
21889 init
= tsubst_expr (init
, argvec
,
21890 tf_warning_or_error
, NULL_TREE
,
21891 /*integral_constant_expression_p=*/false);
21892 if (init
== NULL_TREE
&& tmp
!= NULL_TREE
)
21893 /* If we had an initializer but it instantiated to nothing,
21894 value-initialize the object. This will only occur when
21895 the initializer was a pack expansion where the parameter
21896 packs used in that expansion were of length zero. */
21897 init
= void_type_node
;
21898 in_base_initializer
= 0;
21903 init
= build_tree_list (decl
, init
);
21904 TREE_CHAIN (init
) = inits
;
21912 /* Set CURRENT_ACCESS_SPECIFIER based on the protection of DECL. */
21915 set_current_access_from_decl (tree decl
)
21917 if (TREE_PRIVATE (decl
))
21918 current_access_specifier
= access_private_node
;
21919 else if (TREE_PROTECTED (decl
))
21920 current_access_specifier
= access_protected_node
;
21922 current_access_specifier
= access_public_node
;
21925 /* Instantiate an enumerated type. TAG is the template type, NEWTAG
21926 is the instantiation (which should have been created with
21927 start_enum) and ARGS are the template arguments to use. */
21930 tsubst_enum (tree tag
, tree newtag
, tree args
)
21934 if (SCOPED_ENUM_P (newtag
))
21935 begin_scope (sk_scoped_enum
, newtag
);
21937 for (e
= TYPE_VALUES (tag
); e
; e
= TREE_CHAIN (e
))
21942 decl
= TREE_VALUE (e
);
21943 /* Note that in a template enum, the TREE_VALUE is the
21944 CONST_DECL, not the corresponding INTEGER_CST. */
21945 value
= tsubst_expr (DECL_INITIAL (decl
),
21946 args
, tf_warning_or_error
, NULL_TREE
,
21947 /*integral_constant_expression_p=*/true);
21949 /* Give this enumeration constant the correct access. */
21950 set_current_access_from_decl (decl
);
21952 /* Actually build the enumerator itself. Here we're assuming that
21953 enumerators can't have dependent attributes. */
21954 build_enumerator (DECL_NAME (decl
), value
, newtag
,
21955 DECL_ATTRIBUTES (decl
), DECL_SOURCE_LOCATION (decl
));
21958 if (SCOPED_ENUM_P (newtag
))
21961 finish_enum_value_list (newtag
);
21962 finish_enum (newtag
);
21964 DECL_SOURCE_LOCATION (TYPE_NAME (newtag
))
21965 = DECL_SOURCE_LOCATION (TYPE_NAME (tag
));
21968 /* DECL is a FUNCTION_DECL that is a template specialization. Return
21969 its type -- but without substituting the innermost set of template
21970 arguments. So, innermost set of template parameters will appear in
21974 get_mostly_instantiated_function_type (tree decl
)
21976 /* For a function, DECL_TI_TEMPLATE is partially instantiated. */
21977 return TREE_TYPE (DECL_TI_TEMPLATE (decl
));
21980 /* Return truthvalue if we're processing a template different from
21981 the last one involved in diagnostics. */
21983 problematic_instantiation_changed (void)
21985 return current_tinst_level
!= last_error_tinst_level
;
21988 /* Remember current template involved in diagnostics. */
21990 record_last_problematic_instantiation (void)
21992 last_error_tinst_level
= current_tinst_level
;
21995 struct tinst_level
*
21996 current_instantiation (void)
21998 return current_tinst_level
;
22001 /* Return TRUE if current_function_decl is being instantiated, false
22005 instantiating_current_function_p (void)
22007 return (current_instantiation ()
22008 && current_instantiation ()->decl
== current_function_decl
);
22011 /* [temp.param] Check that template non-type parm TYPE is of an allowable
22012 type. Return zero for ok, nonzero for disallowed. Issue error and
22013 warning messages under control of COMPLAIN. */
22016 invalid_nontype_parm_type_p (tree type
, tsubst_flags_t complain
)
22018 if (INTEGRAL_OR_ENUMERATION_TYPE_P (type
))
22020 else if (POINTER_TYPE_P (type
))
22022 else if (TYPE_PTRMEM_P (type
))
22024 else if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
)
22026 else if (TREE_CODE (type
) == TYPENAME_TYPE
)
22028 else if (TREE_CODE (type
) == DECLTYPE_TYPE
)
22030 else if (TREE_CODE (type
) == NULLPTR_TYPE
)
22032 /* A bound template template parm could later be instantiated to have a valid
22033 nontype parm type via an alias template. */
22034 else if (cxx_dialect
>= cxx11
22035 && TREE_CODE (type
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
22038 if (complain
& tf_error
)
22040 if (type
== error_mark_node
)
22041 inform (input_location
, "invalid template non-type parameter");
22043 error ("%q#T is not a valid type for a template non-type parameter",
22049 /* Returns TRUE if TYPE is dependent, in the sense of [temp.dep.type].
22050 Assumes that TYPE really is a type, and not the ERROR_MARK_NODE.*/
22053 dependent_type_p_r (tree type
)
22059 A type is dependent if it is:
22061 -- a template parameter. Template template parameters are types
22062 for us (since TYPE_P holds true for them) so we handle
22064 if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
22065 || TREE_CODE (type
) == TEMPLATE_TEMPLATE_PARM
)
22067 /* -- a qualified-id with a nested-name-specifier which contains a
22068 class-name that names a dependent type or whose unqualified-id
22069 names a dependent type. */
22070 if (TREE_CODE (type
) == TYPENAME_TYPE
)
22073 /* An alias template specialization can be dependent even if the
22074 resulting type is not. */
22075 if (dependent_alias_template_spec_p (type
))
22078 /* -- a cv-qualified type where the cv-unqualified type is
22080 No code is necessary for this bullet; the code below handles
22081 cv-qualified types, and we don't want to strip aliases with
22082 TYPE_MAIN_VARIANT because of DR 1558. */
22083 /* -- a compound type constructed from any dependent type. */
22084 if (TYPE_PTRMEM_P (type
))
22085 return (dependent_type_p (TYPE_PTRMEM_CLASS_TYPE (type
))
22086 || dependent_type_p (TYPE_PTRMEM_POINTED_TO_TYPE
22088 else if (TYPE_PTR_P (type
)
22089 || TREE_CODE (type
) == REFERENCE_TYPE
)
22090 return dependent_type_p (TREE_TYPE (type
));
22091 else if (TREE_CODE (type
) == FUNCTION_TYPE
22092 || TREE_CODE (type
) == METHOD_TYPE
)
22096 if (dependent_type_p (TREE_TYPE (type
)))
22098 for (arg_type
= TYPE_ARG_TYPES (type
);
22100 arg_type
= TREE_CHAIN (arg_type
))
22101 if (dependent_type_p (TREE_VALUE (arg_type
)))
22105 /* -- an array type constructed from any dependent type or whose
22106 size is specified by a constant expression that is
22109 We checked for type- and value-dependence of the bounds in
22110 compute_array_index_type, so TYPE_DEPENDENT_P is already set. */
22111 if (TREE_CODE (type
) == ARRAY_TYPE
)
22113 if (TYPE_DOMAIN (type
)
22114 && dependent_type_p (TYPE_DOMAIN (type
)))
22116 return dependent_type_p (TREE_TYPE (type
));
22119 /* -- a template-id in which either the template name is a template
22121 if (TREE_CODE (type
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
22123 /* ... or any of the template arguments is a dependent type or
22124 an expression that is type-dependent or value-dependent. */
22125 else if (CLASS_TYPE_P (type
) && CLASSTYPE_TEMPLATE_INFO (type
)
22126 && (any_dependent_template_arguments_p
22127 (INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (type
)))))
22130 /* All TYPEOF_TYPEs, DECLTYPE_TYPEs, and UNDERLYING_TYPEs are
22131 dependent; if the argument of the `typeof' expression is not
22132 type-dependent, then it should already been have resolved. */
22133 if (TREE_CODE (type
) == TYPEOF_TYPE
22134 || TREE_CODE (type
) == DECLTYPE_TYPE
22135 || TREE_CODE (type
) == UNDERLYING_TYPE
)
22138 /* A template argument pack is dependent if any of its packed
22140 if (TREE_CODE (type
) == TYPE_ARGUMENT_PACK
)
22142 tree args
= ARGUMENT_PACK_ARGS (type
);
22143 int i
, len
= TREE_VEC_LENGTH (args
);
22144 for (i
= 0; i
< len
; ++i
)
22145 if (dependent_template_arg_p (TREE_VEC_ELT (args
, i
)))
22149 /* All TYPE_PACK_EXPANSIONs are dependent, because parameter packs must
22150 be template parameters. */
22151 if (TREE_CODE (type
) == TYPE_PACK_EXPANSION
)
22154 /* The standard does not specifically mention types that are local
22155 to template functions or local classes, but they should be
22156 considered dependent too. For example:
22158 template <int I> void f() {
22163 The size of `E' cannot be known until the value of `I' has been
22164 determined. Therefore, `E' must be considered dependent. */
22165 scope
= TYPE_CONTEXT (type
);
22166 if (scope
&& TYPE_P (scope
))
22167 return dependent_type_p (scope
);
22168 /* Don't use type_dependent_expression_p here, as it can lead
22169 to infinite recursion trying to determine whether a lambda
22170 nested in a lambda is dependent (c++/47687). */
22171 else if (scope
&& TREE_CODE (scope
) == FUNCTION_DECL
22172 && DECL_LANG_SPECIFIC (scope
)
22173 && DECL_TEMPLATE_INFO (scope
)
22174 && (any_dependent_template_arguments_p
22175 (INNERMOST_TEMPLATE_ARGS (DECL_TI_ARGS (scope
)))))
22178 /* Other types are non-dependent. */
22182 /* Returns TRUE if TYPE is dependent, in the sense of
22183 [temp.dep.type]. Note that a NULL type is considered dependent. */
22186 dependent_type_p (tree type
)
22188 /* If there are no template parameters in scope, then there can't be
22189 any dependent types. */
22190 if (!processing_template_decl
)
22192 /* If we are not processing a template, then nobody should be
22193 providing us with a dependent type. */
22195 gcc_assert (TREE_CODE (type
) != TEMPLATE_TYPE_PARM
|| is_auto (type
));
22199 /* If the type is NULL, we have not computed a type for the entity
22200 in question; in that case, the type is dependent. */
22204 /* Erroneous types can be considered non-dependent. */
22205 if (type
== error_mark_node
)
22208 /* If we have not already computed the appropriate value for TYPE,
22210 if (!TYPE_DEPENDENT_P_VALID (type
))
22212 TYPE_DEPENDENT_P (type
) = dependent_type_p_r (type
);
22213 TYPE_DEPENDENT_P_VALID (type
) = 1;
22216 return TYPE_DEPENDENT_P (type
);
22219 /* Returns TRUE if SCOPE is a dependent scope, in which we can't do any
22220 lookup. In other words, a dependent type that is not the current
22224 dependent_scope_p (tree scope
)
22226 return (scope
&& TYPE_P (scope
) && dependent_type_p (scope
)
22227 && !currently_open_class (scope
));
22230 /* T is a SCOPE_REF; return whether we need to consider it
22231 instantiation-dependent so that we can check access at instantiation
22232 time even though we know which member it resolves to. */
22235 instantiation_dependent_scope_ref_p (tree t
)
22237 if (DECL_P (TREE_OPERAND (t
, 1))
22238 && CLASS_TYPE_P (TREE_OPERAND (t
, 0))
22239 && accessible_in_template_p (TREE_OPERAND (t
, 0),
22240 TREE_OPERAND (t
, 1)))
22246 /* Returns TRUE if the EXPRESSION is value-dependent, in the sense of
22247 [temp.dep.constexpr]. EXPRESSION is already known to be a constant
22250 /* Note that this predicate is not appropriate for general expressions;
22251 only constant expressions (that satisfy potential_constant_expression)
22252 can be tested for value dependence. */
22255 value_dependent_expression_p (tree expression
)
22257 if (!processing_template_decl
)
22260 /* A name declared with a dependent type. */
22261 if (DECL_P (expression
) && type_dependent_expression_p (expression
))
22264 switch (TREE_CODE (expression
))
22266 case IDENTIFIER_NODE
:
22267 /* A name that has not been looked up -- must be dependent. */
22270 case TEMPLATE_PARM_INDEX
:
22271 /* A non-type template parm. */
22275 /* A non-type template parm. */
22276 if (DECL_TEMPLATE_PARM_P (expression
))
22278 return value_dependent_expression_p (DECL_INITIAL (expression
));
22281 /* A constant with literal type and is initialized
22282 with an expression that is value-dependent.
22284 Note that a non-dependent parenthesized initializer will have
22285 already been replaced with its constant value, so if we see
22286 a TREE_LIST it must be dependent. */
22287 if (DECL_INITIAL (expression
)
22288 && decl_constant_var_p (expression
)
22289 && (TREE_CODE (DECL_INITIAL (expression
)) == TREE_LIST
22290 /* cp_finish_decl doesn't fold reference initializers. */
22291 || TREE_CODE (TREE_TYPE (expression
)) == REFERENCE_TYPE
22292 || value_dependent_expression_p (DECL_INITIAL (expression
))))
22296 case DYNAMIC_CAST_EXPR
:
22297 case STATIC_CAST_EXPR
:
22298 case CONST_CAST_EXPR
:
22299 case REINTERPRET_CAST_EXPR
:
22301 /* These expressions are value-dependent if the type to which
22302 the cast occurs is dependent or the expression being casted
22303 is value-dependent. */
22305 tree type
= TREE_TYPE (expression
);
22307 if (dependent_type_p (type
))
22310 /* A functional cast has a list of operands. */
22311 expression
= TREE_OPERAND (expression
, 0);
22314 /* If there are no operands, it must be an expression such
22315 as "int()". This should not happen for aggregate types
22316 because it would form non-constant expressions. */
22317 gcc_assert (cxx_dialect
>= cxx11
22318 || INTEGRAL_OR_ENUMERATION_TYPE_P (type
));
22323 if (TREE_CODE (expression
) == TREE_LIST
)
22324 return any_value_dependent_elements_p (expression
);
22326 return value_dependent_expression_p (expression
);
22330 if (SIZEOF_EXPR_TYPE_P (expression
))
22331 return dependent_type_p (TREE_TYPE (TREE_OPERAND (expression
, 0)));
22335 /* A `sizeof' expression is value-dependent if the operand is
22336 type-dependent or is a pack expansion. */
22337 expression
= TREE_OPERAND (expression
, 0);
22338 if (PACK_EXPANSION_P (expression
))
22340 else if (TYPE_P (expression
))
22341 return dependent_type_p (expression
);
22342 return instantiation_dependent_expression_p (expression
);
22344 case AT_ENCODE_EXPR
:
22345 /* An 'encode' expression is value-dependent if the operand is
22347 expression
= TREE_OPERAND (expression
, 0);
22348 return dependent_type_p (expression
);
22350 case NOEXCEPT_EXPR
:
22351 expression
= TREE_OPERAND (expression
, 0);
22352 return instantiation_dependent_expression_p (expression
);
22355 /* All instantiation-dependent expressions should also be considered
22356 value-dependent. */
22357 return instantiation_dependent_scope_ref_p (expression
);
22359 case COMPONENT_REF
:
22360 return (value_dependent_expression_p (TREE_OPERAND (expression
, 0))
22361 || value_dependent_expression_p (TREE_OPERAND (expression
, 1)));
22363 case NONTYPE_ARGUMENT_PACK
:
22364 /* A NONTYPE_ARGUMENT_PACK is value-dependent if any packed argument
22365 is value-dependent. */
22367 tree values
= ARGUMENT_PACK_ARGS (expression
);
22368 int i
, len
= TREE_VEC_LENGTH (values
);
22370 for (i
= 0; i
< len
; ++i
)
22371 if (value_dependent_expression_p (TREE_VEC_ELT (values
, i
)))
22379 tree type2
= TRAIT_EXPR_TYPE2 (expression
);
22380 return (dependent_type_p (TRAIT_EXPR_TYPE1 (expression
))
22381 || (type2
? dependent_type_p (type2
) : false));
22385 return ((value_dependent_expression_p (TREE_OPERAND (expression
, 0)))
22386 || (value_dependent_expression_p (TREE_OPERAND (expression
, 2))));
22389 return ((value_dependent_expression_p (TREE_OPERAND (expression
, 0)))
22390 || (value_dependent_expression_p (TREE_OPERAND (expression
, 1))));
22394 tree op
= TREE_OPERAND (expression
, 0);
22395 return (value_dependent_expression_p (op
)
22396 || has_value_dependent_address (op
));
22399 case REQUIRES_EXPR
:
22400 /* Treat all requires-expressions as value-dependent so
22401 we don't try to fold them. */
22405 return dependent_type_p (TREE_OPERAND (expression
, 0));
22409 tree fn
= get_callee_fndecl (expression
);
22411 if (!fn
&& value_dependent_expression_p (CALL_EXPR_FN (expression
)))
22413 nargs
= call_expr_nargs (expression
);
22414 for (i
= 0; i
< nargs
; ++i
)
22416 tree op
= CALL_EXPR_ARG (expression
, i
);
22417 /* In a call to a constexpr member function, look through the
22418 implicit ADDR_EXPR on the object argument so that it doesn't
22419 cause the call to be considered value-dependent. We also
22420 look through it in potential_constant_expression. */
22421 if (i
== 0 && fn
&& DECL_DECLARED_CONSTEXPR_P (fn
)
22422 && DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
)
22423 && TREE_CODE (op
) == ADDR_EXPR
)
22424 op
= TREE_OPERAND (op
, 0);
22425 if (value_dependent_expression_p (op
))
22431 case TEMPLATE_ID_EXPR
:
22432 /* If a TEMPLATE_ID_EXPR involves a dependent name, it will be
22434 return type_dependent_expression_p (expression
)
22435 || variable_concept_p (TREE_OPERAND (expression
, 0));
22441 if (dependent_type_p (TREE_TYPE (expression
)))
22443 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (expression
), ix
, val
)
22444 if (value_dependent_expression_p (val
))
22450 /* Treat a GNU statement expression as dependent to avoid crashing
22451 under instantiate_non_dependent_expr; it can't be constant. */
22455 /* A constant expression is value-dependent if any subexpression is
22456 value-dependent. */
22457 switch (TREE_CODE_CLASS (TREE_CODE (expression
)))
22459 case tcc_reference
:
22461 case tcc_comparison
:
22463 case tcc_expression
:
22466 int i
, len
= cp_tree_operand_length (expression
);
22468 for (i
= 0; i
< len
; i
++)
22470 tree t
= TREE_OPERAND (expression
, i
);
22472 /* In some cases, some of the operands may be missing.l
22473 (For example, in the case of PREDECREMENT_EXPR, the
22474 amount to increment by may be missing.) That doesn't
22475 make the expression dependent. */
22476 if (t
&& value_dependent_expression_p (t
))
22487 /* The expression is not value-dependent. */
22491 /* Returns TRUE if the EXPRESSION is type-dependent, in the sense of
22492 [temp.dep.expr]. Note that an expression with no type is
22493 considered dependent. Other parts of the compiler arrange for an
22494 expression with type-dependent subexpressions to have no type, so
22495 this function doesn't have to be fully recursive. */
22498 type_dependent_expression_p (tree expression
)
22500 if (!processing_template_decl
)
22503 if (expression
== NULL_TREE
|| expression
== error_mark_node
)
22506 /* An unresolved name is always dependent. */
22507 if (identifier_p (expression
)
22508 || TREE_CODE (expression
) == USING_DECL
22509 || TREE_CODE (expression
) == WILDCARD_DECL
)
22512 /* A fold expression is type-dependent. */
22513 if (TREE_CODE (expression
) == UNARY_LEFT_FOLD_EXPR
22514 || TREE_CODE (expression
) == UNARY_RIGHT_FOLD_EXPR
22515 || TREE_CODE (expression
) == BINARY_LEFT_FOLD_EXPR
22516 || TREE_CODE (expression
) == BINARY_RIGHT_FOLD_EXPR
)
22519 /* Some expression forms are never type-dependent. */
22520 if (TREE_CODE (expression
) == PSEUDO_DTOR_EXPR
22521 || TREE_CODE (expression
) == SIZEOF_EXPR
22522 || TREE_CODE (expression
) == ALIGNOF_EXPR
22523 || TREE_CODE (expression
) == AT_ENCODE_EXPR
22524 || TREE_CODE (expression
) == NOEXCEPT_EXPR
22525 || TREE_CODE (expression
) == TRAIT_EXPR
22526 || TREE_CODE (expression
) == TYPEID_EXPR
22527 || TREE_CODE (expression
) == DELETE_EXPR
22528 || TREE_CODE (expression
) == VEC_DELETE_EXPR
22529 || TREE_CODE (expression
) == THROW_EXPR
22530 || TREE_CODE (expression
) == REQUIRES_EXPR
)
22533 /* The types of these expressions depends only on the type to which
22534 the cast occurs. */
22535 if (TREE_CODE (expression
) == DYNAMIC_CAST_EXPR
22536 || TREE_CODE (expression
) == STATIC_CAST_EXPR
22537 || TREE_CODE (expression
) == CONST_CAST_EXPR
22538 || TREE_CODE (expression
) == REINTERPRET_CAST_EXPR
22539 || TREE_CODE (expression
) == IMPLICIT_CONV_EXPR
22540 || TREE_CODE (expression
) == CAST_EXPR
)
22541 return dependent_type_p (TREE_TYPE (expression
));
22543 /* The types of these expressions depends only on the type created
22544 by the expression. */
22545 if (TREE_CODE (expression
) == NEW_EXPR
22546 || TREE_CODE (expression
) == VEC_NEW_EXPR
)
22548 /* For NEW_EXPR tree nodes created inside a template, either
22549 the object type itself or a TREE_LIST may appear as the
22551 tree type
= TREE_OPERAND (expression
, 1);
22552 if (TREE_CODE (type
) == TREE_LIST
)
22553 /* This is an array type. We need to check array dimensions
22555 return dependent_type_p (TREE_VALUE (TREE_PURPOSE (type
)))
22556 || value_dependent_expression_p
22557 (TREE_OPERAND (TREE_VALUE (type
), 1));
22559 return dependent_type_p (type
);
22562 if (TREE_CODE (expression
) == SCOPE_REF
)
22564 tree scope
= TREE_OPERAND (expression
, 0);
22565 tree name
= TREE_OPERAND (expression
, 1);
22567 /* 14.6.2.2 [temp.dep.expr]: An id-expression is type-dependent if it
22568 contains an identifier associated by name lookup with one or more
22569 declarations declared with a dependent type, or...a
22570 nested-name-specifier or qualified-id that names a member of an
22571 unknown specialization. */
22572 return (type_dependent_expression_p (name
)
22573 || dependent_scope_p (scope
));
22576 if (TREE_CODE (expression
) == FUNCTION_DECL
22577 && DECL_LANG_SPECIFIC (expression
)
22578 && DECL_TEMPLATE_INFO (expression
)
22579 && (any_dependent_template_arguments_p
22580 (INNERMOST_TEMPLATE_ARGS (DECL_TI_ARGS (expression
)))))
22583 if (TREE_CODE (expression
) == TEMPLATE_DECL
22584 && !DECL_TEMPLATE_TEMPLATE_PARM_P (expression
))
22587 if (TREE_CODE (expression
) == STMT_EXPR
)
22588 expression
= stmt_expr_value_expr (expression
);
22590 if (BRACE_ENCLOSED_INITIALIZER_P (expression
))
22595 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (expression
), i
, elt
)
22597 if (type_dependent_expression_p (elt
))
22603 /* A static data member of the current instantiation with incomplete
22604 array type is type-dependent, as the definition and specializations
22605 can have different bounds. */
22606 if (VAR_P (expression
)
22607 && DECL_CLASS_SCOPE_P (expression
)
22608 && dependent_type_p (DECL_CONTEXT (expression
))
22609 && VAR_HAD_UNKNOWN_BOUND (expression
))
22612 /* An array of unknown bound depending on a variadic parameter, eg:
22614 template<typename... Args>
22615 void foo (Args... args)
22617 int arr[] = { args... };
22620 template<int... vals>
22623 int arr[] = { vals... };
22626 If the array has no length and has an initializer, it must be that
22627 we couldn't determine its length in cp_complete_array_type because
22628 it is dependent. */
22629 if (VAR_P (expression
)
22630 && TREE_CODE (TREE_TYPE (expression
)) == ARRAY_TYPE
22631 && !TYPE_DOMAIN (TREE_TYPE (expression
))
22632 && DECL_INITIAL (expression
))
22635 /* A variable template specialization is type-dependent if it has any
22636 dependent template arguments. */
22637 if (VAR_P (expression
)
22638 && DECL_LANG_SPECIFIC (expression
)
22639 && DECL_TEMPLATE_INFO (expression
)
22640 && variable_template_p (DECL_TI_TEMPLATE (expression
)))
22641 return any_dependent_template_arguments_p (DECL_TI_ARGS (expression
));
22643 /* Always dependent, on the number of arguments if nothing else. */
22644 if (TREE_CODE (expression
) == EXPR_PACK_EXPANSION
)
22647 if (TREE_TYPE (expression
) == unknown_type_node
)
22649 if (TREE_CODE (expression
) == ADDR_EXPR
)
22650 return type_dependent_expression_p (TREE_OPERAND (expression
, 0));
22651 if (TREE_CODE (expression
) == COMPONENT_REF
22652 || TREE_CODE (expression
) == OFFSET_REF
)
22654 if (type_dependent_expression_p (TREE_OPERAND (expression
, 0)))
22656 expression
= TREE_OPERAND (expression
, 1);
22657 if (identifier_p (expression
))
22660 /* SCOPE_REF with non-null TREE_TYPE is always non-dependent. */
22661 if (TREE_CODE (expression
) == SCOPE_REF
)
22664 if (BASELINK_P (expression
))
22666 if (BASELINK_OPTYPE (expression
)
22667 && dependent_type_p (BASELINK_OPTYPE (expression
)))
22669 expression
= BASELINK_FUNCTIONS (expression
);
22672 if (TREE_CODE (expression
) == TEMPLATE_ID_EXPR
)
22674 if (any_dependent_template_arguments_p
22675 (TREE_OPERAND (expression
, 1)))
22677 expression
= TREE_OPERAND (expression
, 0);
22678 if (identifier_p (expression
))
22682 gcc_assert (TREE_CODE (expression
) == OVERLOAD
22683 || TREE_CODE (expression
) == FUNCTION_DECL
);
22687 if (type_dependent_expression_p (OVL_CURRENT (expression
)))
22689 expression
= OVL_NEXT (expression
);
22694 gcc_assert (TREE_CODE (expression
) != TYPE_DECL
);
22696 return (dependent_type_p (TREE_TYPE (expression
)));
22699 /* walk_tree callback function for instantiation_dependent_expression_p,
22700 below. Returns non-zero if a dependent subexpression is found. */
22703 instantiation_dependent_r (tree
*tp
, int *walk_subtrees
,
22708 /* We don't have to worry about decltype currently because decltype
22709 of an instantiation-dependent expr is a dependent type. This
22710 might change depending on the resolution of DR 1172. */
22711 *walk_subtrees
= false;
22714 enum tree_code code
= TREE_CODE (*tp
);
22717 /* Don't treat an argument list as dependent just because it has no
22725 /* A constant with a dependent initializer is dependent. */
22726 if (value_dependent_expression_p (*tp
))
22730 case TEMPLATE_PARM_INDEX
:
22733 /* Handle expressions with type operands. */
22737 case AT_ENCODE_EXPR
:
22739 tree op
= TREE_OPERAND (*tp
, 0);
22740 if (code
== SIZEOF_EXPR
&& SIZEOF_EXPR_TYPE_P (*tp
))
22741 op
= TREE_TYPE (op
);
22744 if (dependent_type_p (op
))
22748 *walk_subtrees
= false;
22756 if (value_dependent_expression_p (*tp
))
22758 *walk_subtrees
= false;
22761 case COMPONENT_REF
:
22762 if (identifier_p (TREE_OPERAND (*tp
, 1)))
22763 /* In a template, finish_class_member_access_expr creates a
22764 COMPONENT_REF with an IDENTIFIER_NODE for op1 even if it isn't
22765 type-dependent, so that we can check access control at
22766 instantiation time (PR 42277). See also Core issue 1273. */
22771 if (instantiation_dependent_scope_ref_p (*tp
))
22776 /* Treat statement-expressions as dependent. */
22780 /* Treat requires-expressions as dependent. */
22781 case REQUIRES_EXPR
:
22785 /* Treat calls to function concepts as dependent. */
22786 if (function_concept_check_p (*tp
))
22790 case TEMPLATE_ID_EXPR
:
22791 /* And variable concepts. */
22792 if (variable_concept_p (TREE_OPERAND (*tp
, 0)))
22800 if (type_dependent_expression_p (*tp
))
22806 /* Returns TRUE if the EXPRESSION is instantiation-dependent, in the
22807 sense defined by the ABI:
22809 "An expression is instantiation-dependent if it is type-dependent
22810 or value-dependent, or it has a subexpression that is type-dependent
22811 or value-dependent." */
22814 instantiation_dependent_expression_p (tree expression
)
22818 if (!processing_template_decl
)
22821 if (expression
== error_mark_node
)
22824 result
= cp_walk_tree_without_duplicates (&expression
,
22825 instantiation_dependent_r
, NULL
);
22826 return result
!= NULL_TREE
;
22829 /* Like type_dependent_expression_p, but it also works while not processing
22830 a template definition, i.e. during substitution or mangling. */
22833 type_dependent_expression_p_push (tree expr
)
22836 ++processing_template_decl
;
22837 b
= type_dependent_expression_p (expr
);
22838 --processing_template_decl
;
22842 /* Returns TRUE if ARGS contains a type-dependent expression. */
22845 any_type_dependent_arguments_p (const vec
<tree
, va_gc
> *args
)
22850 FOR_EACH_VEC_SAFE_ELT (args
, i
, arg
)
22852 if (type_dependent_expression_p (arg
))
22858 /* Returns TRUE if LIST (a TREE_LIST whose TREE_VALUEs are
22859 expressions) contains any type-dependent expressions. */
22862 any_type_dependent_elements_p (const_tree list
)
22864 for (; list
; list
= TREE_CHAIN (list
))
22865 if (type_dependent_expression_p (TREE_VALUE (list
)))
22871 /* Returns TRUE if LIST (a TREE_LIST whose TREE_VALUEs are
22872 expressions) contains any value-dependent expressions. */
22875 any_value_dependent_elements_p (const_tree list
)
22877 for (; list
; list
= TREE_CHAIN (list
))
22878 if (value_dependent_expression_p (TREE_VALUE (list
)))
22884 /* Returns TRUE if the ARG (a template argument) is dependent. */
22887 dependent_template_arg_p (tree arg
)
22889 if (!processing_template_decl
)
22892 /* Assume a template argument that was wrongly written by the user
22893 is dependent. This is consistent with what
22894 any_dependent_template_arguments_p [that calls this function]
22896 if (!arg
|| arg
== error_mark_node
)
22899 if (TREE_CODE (arg
) == ARGUMENT_PACK_SELECT
)
22900 arg
= ARGUMENT_PACK_SELECT_ARG (arg
);
22902 if (TREE_CODE (arg
) == TEMPLATE_DECL
22903 || TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
)
22904 return dependent_template_p (arg
);
22905 else if (ARGUMENT_PACK_P (arg
))
22907 tree args
= ARGUMENT_PACK_ARGS (arg
);
22908 int i
, len
= TREE_VEC_LENGTH (args
);
22909 for (i
= 0; i
< len
; ++i
)
22911 if (dependent_template_arg_p (TREE_VEC_ELT (args
, i
)))
22917 else if (TYPE_P (arg
))
22918 return dependent_type_p (arg
);
22920 return (type_dependent_expression_p (arg
)
22921 || value_dependent_expression_p (arg
));
22924 /* Returns true if ARGS (a collection of template arguments) contains
22925 any types that require structural equality testing. */
22928 any_template_arguments_need_structural_equality_p (tree args
)
22935 if (args
== error_mark_node
)
22938 for (i
= 0; i
< TMPL_ARGS_DEPTH (args
); ++i
)
22940 tree level
= TMPL_ARGS_LEVEL (args
, i
+ 1);
22941 for (j
= 0; j
< TREE_VEC_LENGTH (level
); ++j
)
22943 tree arg
= TREE_VEC_ELT (level
, j
);
22944 tree packed_args
= NULL_TREE
;
22947 if (ARGUMENT_PACK_P (arg
))
22949 /* Look inside the argument pack. */
22950 packed_args
= ARGUMENT_PACK_ARGS (arg
);
22951 len
= TREE_VEC_LENGTH (packed_args
);
22954 for (k
= 0; k
< len
; ++k
)
22957 arg
= TREE_VEC_ELT (packed_args
, k
);
22959 if (error_operand_p (arg
))
22961 else if (TREE_CODE (arg
) == TEMPLATE_DECL
)
22963 else if (TYPE_P (arg
) && TYPE_STRUCTURAL_EQUALITY_P (arg
))
22965 else if (!TYPE_P (arg
) && TREE_TYPE (arg
)
22966 && TYPE_STRUCTURAL_EQUALITY_P (TREE_TYPE (arg
)))
22975 /* Returns true if ARGS (a collection of template arguments) contains
22976 any dependent arguments. */
22979 any_dependent_template_arguments_p (const_tree args
)
22986 if (args
== error_mark_node
)
22989 for (i
= 0; i
< TMPL_ARGS_DEPTH (args
); ++i
)
22991 const_tree level
= TMPL_ARGS_LEVEL (args
, i
+ 1);
22992 for (j
= 0; j
< TREE_VEC_LENGTH (level
); ++j
)
22993 if (dependent_template_arg_p (TREE_VEC_ELT (level
, j
)))
23000 /* Returns TRUE if the template TMPL is dependent. */
23003 dependent_template_p (tree tmpl
)
23005 if (TREE_CODE (tmpl
) == OVERLOAD
)
23009 if (dependent_template_p (OVL_CURRENT (tmpl
)))
23011 tmpl
= OVL_NEXT (tmpl
);
23016 /* Template template parameters are dependent. */
23017 if (DECL_TEMPLATE_TEMPLATE_PARM_P (tmpl
)
23018 || TREE_CODE (tmpl
) == TEMPLATE_TEMPLATE_PARM
)
23020 /* So are names that have not been looked up. */
23021 if (TREE_CODE (tmpl
) == SCOPE_REF
|| identifier_p (tmpl
))
23023 /* So are member templates of dependent classes. */
23024 if (TYPE_P (CP_DECL_CONTEXT (tmpl
)))
23025 return dependent_type_p (DECL_CONTEXT (tmpl
));
23029 /* Returns TRUE if the specialization TMPL<ARGS> is dependent. */
23032 dependent_template_id_p (tree tmpl
, tree args
)
23034 return (dependent_template_p (tmpl
)
23035 || any_dependent_template_arguments_p (args
));
23038 /* Returns TRUE if OMP_FOR with DECLV, INITV, CONDV and INCRV vectors
23042 dependent_omp_for_p (tree declv
, tree initv
, tree condv
, tree incrv
)
23046 if (!processing_template_decl
)
23049 for (i
= 0; i
< TREE_VEC_LENGTH (declv
); i
++)
23051 tree decl
= TREE_VEC_ELT (declv
, i
);
23052 tree init
= TREE_VEC_ELT (initv
, i
);
23053 tree cond
= TREE_VEC_ELT (condv
, i
);
23054 tree incr
= TREE_VEC_ELT (incrv
, i
);
23056 if (type_dependent_expression_p (decl
)
23057 || TREE_CODE (decl
) == SCOPE_REF
)
23060 if (init
&& type_dependent_expression_p (init
))
23063 if (type_dependent_expression_p (cond
))
23066 if (COMPARISON_CLASS_P (cond
)
23067 && (type_dependent_expression_p (TREE_OPERAND (cond
, 0))
23068 || type_dependent_expression_p (TREE_OPERAND (cond
, 1))))
23071 if (TREE_CODE (incr
) == MODOP_EXPR
)
23073 if (type_dependent_expression_p (TREE_OPERAND (incr
, 0))
23074 || type_dependent_expression_p (TREE_OPERAND (incr
, 2)))
23077 else if (type_dependent_expression_p (incr
))
23079 else if (TREE_CODE (incr
) == MODIFY_EXPR
)
23081 if (type_dependent_expression_p (TREE_OPERAND (incr
, 0)))
23083 else if (BINARY_CLASS_P (TREE_OPERAND (incr
, 1)))
23085 tree t
= TREE_OPERAND (incr
, 1);
23086 if (type_dependent_expression_p (TREE_OPERAND (t
, 0))
23087 || type_dependent_expression_p (TREE_OPERAND (t
, 1)))
23096 /* TYPE is a TYPENAME_TYPE. Returns the ordinary TYPE to which the
23097 TYPENAME_TYPE corresponds. Returns the original TYPENAME_TYPE if
23098 no such TYPE can be found. Note that this function peers inside
23099 uninstantiated templates and therefore should be used only in
23100 extremely limited situations. ONLY_CURRENT_P restricts this
23101 peering to the currently open classes hierarchy (which is required
23102 when comparing types). */
23105 resolve_typename_type (tree type
, bool only_current_p
)
23114 gcc_assert (TREE_CODE (type
) == TYPENAME_TYPE
);
23116 scope
= TYPE_CONTEXT (type
);
23117 /* Usually the non-qualified identifier of a TYPENAME_TYPE is
23118 TYPE_IDENTIFIER (type). But when 'type' is a typedef variant of
23119 a TYPENAME_TYPE node, then TYPE_NAME (type) is set to the TYPE_DECL representing
23120 the typedef. In that case TYPE_IDENTIFIER (type) is not the non-qualified
23121 identifier of the TYPENAME_TYPE anymore.
23122 So by getting the TYPE_IDENTIFIER of the _main declaration_ of the
23123 TYPENAME_TYPE instead, we avoid messing up with a possible
23124 typedef variant case. */
23125 name
= TYPE_IDENTIFIER (TYPE_MAIN_VARIANT (type
));
23127 /* If the SCOPE is itself a TYPENAME_TYPE, then we need to resolve
23128 it first before we can figure out what NAME refers to. */
23129 if (TREE_CODE (scope
) == TYPENAME_TYPE
)
23131 if (TYPENAME_IS_RESOLVING_P (scope
))
23132 /* Given a class template A with a dependent base with nested type C,
23133 typedef typename A::C::C C will land us here, as trying to resolve
23134 the initial A::C leads to the local C typedef, which leads back to
23135 A::C::C. So we break the recursion now. */
23138 scope
= resolve_typename_type (scope
, only_current_p
);
23140 /* If we don't know what SCOPE refers to, then we cannot resolve the
23142 if (TREE_CODE (scope
) == TYPENAME_TYPE
)
23144 /* If the SCOPE is a template type parameter, we have no way of
23145 resolving the name. */
23146 if (TREE_CODE (scope
) == TEMPLATE_TYPE_PARM
)
23148 /* If the SCOPE is not the current instantiation, there's no reason
23149 to look inside it. */
23150 if (only_current_p
&& !currently_open_class (scope
))
23152 /* If this is a typedef, we don't want to look inside (c++/11987). */
23153 if (typedef_variant_p (type
))
23155 /* If SCOPE isn't the template itself, it will not have a valid
23156 TYPE_FIELDS list. */
23157 if (CLASS_TYPE_P (scope
)
23158 && same_type_p (scope
, CLASSTYPE_PRIMARY_TEMPLATE_TYPE (scope
)))
23159 /* scope is either the template itself or a compatible instantiation
23160 like X<T>, so look up the name in the original template. */
23161 scope
= CLASSTYPE_PRIMARY_TEMPLATE_TYPE (scope
);
23163 /* scope is a partial instantiation, so we can't do the lookup or we
23164 will lose the template arguments. */
23166 /* Enter the SCOPE so that name lookup will be resolved as if we
23167 were in the class definition. In particular, SCOPE will no
23168 longer be considered a dependent type. */
23169 pushed_scope
= push_scope (scope
);
23170 /* Look up the declaration. */
23171 decl
= lookup_member (scope
, name
, /*protect=*/0, /*want_type=*/true,
23172 tf_warning_or_error
);
23174 result
= NULL_TREE
;
23176 /* For a TYPENAME_TYPE like "typename X::template Y<T>", we want to
23177 find a TEMPLATE_DECL. Otherwise, we want to find a TYPE_DECL. */
23180 else if (identifier_p (TYPENAME_TYPE_FULLNAME (type
))
23181 && TREE_CODE (decl
) == TYPE_DECL
)
23183 result
= TREE_TYPE (decl
);
23184 if (result
== error_mark_node
)
23185 result
= NULL_TREE
;
23187 else if (TREE_CODE (TYPENAME_TYPE_FULLNAME (type
)) == TEMPLATE_ID_EXPR
23188 && DECL_CLASS_TEMPLATE_P (decl
))
23192 /* Obtain the template and the arguments. */
23193 tmpl
= TREE_OPERAND (TYPENAME_TYPE_FULLNAME (type
), 0);
23194 args
= TREE_OPERAND (TYPENAME_TYPE_FULLNAME (type
), 1);
23195 /* Instantiate the template. */
23196 result
= lookup_template_class (tmpl
, args
, NULL_TREE
, NULL_TREE
,
23197 /*entering_scope=*/0,
23198 tf_error
| tf_user
);
23199 if (result
== error_mark_node
)
23200 result
= NULL_TREE
;
23203 /* Leave the SCOPE. */
23205 pop_scope (pushed_scope
);
23207 /* If we failed to resolve it, return the original typename. */
23211 /* If lookup found a typename type, resolve that too. */
23212 if (TREE_CODE (result
) == TYPENAME_TYPE
&& !TYPENAME_IS_RESOLVING_P (result
))
23214 /* Ill-formed programs can cause infinite recursion here, so we
23215 must catch that. */
23216 TYPENAME_IS_RESOLVING_P (type
) = 1;
23217 result
= resolve_typename_type (result
, only_current_p
);
23218 TYPENAME_IS_RESOLVING_P (type
) = 0;
23221 /* Qualify the resulting type. */
23222 quals
= cp_type_quals (type
);
23224 result
= cp_build_qualified_type (result
, cp_type_quals (result
) | quals
);
23229 /* EXPR is an expression which is not type-dependent. Return a proxy
23230 for EXPR that can be used to compute the types of larger
23231 expressions containing EXPR. */
23234 build_non_dependent_expr (tree expr
)
23238 #ifdef ENABLE_CHECKING
23239 /* Try to get a constant value for all non-dependent expressions in
23240 order to expose bugs in *_dependent_expression_p and constexpr. */
23241 if (cxx_dialect
>= cxx11
)
23242 fold_non_dependent_expr (expr
);
23245 /* Preserve OVERLOADs; the functions must be available to resolve
23248 if (TREE_CODE (inner_expr
) == STMT_EXPR
)
23249 inner_expr
= stmt_expr_value_expr (inner_expr
);
23250 if (TREE_CODE (inner_expr
) == ADDR_EXPR
)
23251 inner_expr
= TREE_OPERAND (inner_expr
, 0);
23252 if (TREE_CODE (inner_expr
) == COMPONENT_REF
)
23253 inner_expr
= TREE_OPERAND (inner_expr
, 1);
23254 if (is_overloaded_fn (inner_expr
)
23255 || TREE_CODE (inner_expr
) == OFFSET_REF
)
23257 /* There is no need to return a proxy for a variable. */
23260 /* Preserve string constants; conversions from string constants to
23261 "char *" are allowed, even though normally a "const char *"
23262 cannot be used to initialize a "char *". */
23263 if (TREE_CODE (expr
) == STRING_CST
)
23265 /* Preserve void and arithmetic constants, as an optimization -- there is no
23266 reason to create a new node. */
23267 if (TREE_CODE (expr
) == VOID_CST
23268 || TREE_CODE (expr
) == INTEGER_CST
23269 || TREE_CODE (expr
) == REAL_CST
)
23271 /* Preserve THROW_EXPRs -- all throw-expressions have type "void".
23272 There is at least one place where we want to know that a
23273 particular expression is a throw-expression: when checking a ?:
23274 expression, there are special rules if the second or third
23275 argument is a throw-expression. */
23276 if (TREE_CODE (expr
) == THROW_EXPR
)
23279 /* Don't wrap an initializer list, we need to be able to look inside. */
23280 if (BRACE_ENCLOSED_INITIALIZER_P (expr
))
23283 /* Don't wrap a dummy object, we need to be able to test for it. */
23284 if (is_dummy_object (expr
))
23287 if (TREE_CODE (expr
) == COND_EXPR
)
23288 return build3 (COND_EXPR
,
23290 TREE_OPERAND (expr
, 0),
23291 (TREE_OPERAND (expr
, 1)
23292 ? build_non_dependent_expr (TREE_OPERAND (expr
, 1))
23293 : build_non_dependent_expr (TREE_OPERAND (expr
, 0))),
23294 build_non_dependent_expr (TREE_OPERAND (expr
, 2)));
23295 if (TREE_CODE (expr
) == COMPOUND_EXPR
23296 && !COMPOUND_EXPR_OVERLOADED (expr
))
23297 return build2 (COMPOUND_EXPR
,
23299 TREE_OPERAND (expr
, 0),
23300 build_non_dependent_expr (TREE_OPERAND (expr
, 1)));
23302 /* If the type is unknown, it can't really be non-dependent */
23303 gcc_assert (TREE_TYPE (expr
) != unknown_type_node
);
23305 /* Otherwise, build a NON_DEPENDENT_EXPR. */
23306 return build1 (NON_DEPENDENT_EXPR
, TREE_TYPE (expr
), expr
);
23309 /* ARGS is a vector of expressions as arguments to a function call.
23310 Replace the arguments with equivalent non-dependent expressions.
23311 This modifies ARGS in place. */
23314 make_args_non_dependent (vec
<tree
, va_gc
> *args
)
23319 FOR_EACH_VEC_SAFE_ELT (args
, ix
, arg
)
23321 tree newarg
= build_non_dependent_expr (arg
);
23323 (*args
)[ix
] = newarg
;
23327 /* Returns a type which represents 'auto' or 'decltype(auto)'. We use a
23328 TEMPLATE_TYPE_PARM with a level one deeper than the actual template
23332 make_auto_1 (tree name
)
23334 tree au
= cxx_make_type (TEMPLATE_TYPE_PARM
);
23335 TYPE_NAME (au
) = build_decl (input_location
,
23336 TYPE_DECL
, name
, au
);
23337 TYPE_STUB_DECL (au
) = TYPE_NAME (au
);
23338 TEMPLATE_TYPE_PARM_INDEX (au
) = build_template_parm_index
23339 (0, processing_template_decl
+ 1, processing_template_decl
+ 1,
23340 TYPE_NAME (au
), NULL_TREE
);
23341 TYPE_CANONICAL (au
) = canonical_type_parameter (au
);
23342 DECL_ARTIFICIAL (TYPE_NAME (au
)) = 1;
23343 SET_DECL_TEMPLATE_PARM_P (TYPE_NAME (au
));
23349 make_decltype_auto (void)
23351 return make_auto_1 (get_identifier ("decltype(auto)"));
23357 return make_auto_1 (get_identifier ("auto"));
23360 /* Given type ARG, return std::initializer_list<ARG>. */
23365 tree std_init_list
= namespace_binding
23366 (get_identifier ("initializer_list"), std_node
);
23368 if (!std_init_list
|| !DECL_CLASS_TEMPLATE_P (std_init_list
))
23370 error ("deducing from brace-enclosed initializer list requires "
23371 "#include <initializer_list>");
23372 return error_mark_node
;
23374 argvec
= make_tree_vec (1);
23375 TREE_VEC_ELT (argvec
, 0) = arg
;
23376 return lookup_template_class (std_init_list
, argvec
, NULL_TREE
,
23377 NULL_TREE
, 0, tf_warning_or_error
);
23380 /* Replace auto in TYPE with std::initializer_list<auto>. */
23383 listify_autos (tree type
, tree auto_node
)
23385 tree init_auto
= listify (auto_node
);
23386 tree argvec
= make_tree_vec (1);
23387 TREE_VEC_ELT (argvec
, 0) = init_auto
;
23388 if (processing_template_decl
)
23389 argvec
= add_to_template_args (current_template_args (), argvec
);
23390 return tsubst (type
, argvec
, tf_warning_or_error
, NULL_TREE
);
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. */
23397 do_auto_deduction (tree type
, tree init
, tree auto_node
)
23399 return do_auto_deduction (type
, init
, auto_node
,
23400 tf_warning_or_error
,
23404 /* Replace occurrences of 'auto' in TYPE with the appropriate type deduced
23405 from INIT. AUTO_NODE is the TEMPLATE_TYPE_PARM used for 'auto' in TYPE.
23406 The CONTEXT determines the context in which auto deduction is performed
23407 and is used to control error diagnostics. */
23410 do_auto_deduction (tree type
, tree init
, tree auto_node
,
23411 tsubst_flags_t complain
, auto_deduction_context context
)
23415 if (init
== error_mark_node
)
23416 return error_mark_node
;
23418 if (type_dependent_expression_p (init
))
23419 /* Defining a subset of type-dependent expressions that we can deduce
23420 from ahead of time isn't worth the trouble. */
23423 /* [dcl.spec.auto]: Obtain P from T by replacing the occurrences of auto
23424 with either a new invented type template parameter U or, if the
23425 initializer is a braced-init-list (8.5.4), with
23426 std::initializer_list<U>. */
23427 if (BRACE_ENCLOSED_INITIALIZER_P (init
))
23429 if (!DIRECT_LIST_INIT_P (init
))
23430 type
= listify_autos (type
, auto_node
);
23431 else if (CONSTRUCTOR_NELTS (init
) == 1)
23432 init
= CONSTRUCTOR_ELT (init
, 0)->value
;
23435 if (complain
& tf_warning_or_error
)
23437 if (permerror (input_location
, "direct-list-initialization of "
23438 "%<auto%> requires exactly one element"))
23439 inform (input_location
,
23440 "for deduction to %<std::initializer_list%>, use copy-"
23441 "list-initialization (i.e. add %<=%> before the %<{%>)");
23443 type
= listify_autos (type
, auto_node
);
23447 init
= resolve_nondeduced_context (init
);
23449 targs
= make_tree_vec (1);
23450 if (AUTO_IS_DECLTYPE (auto_node
))
23452 bool id
= (DECL_P (init
) || (TREE_CODE (init
) == COMPONENT_REF
23453 && !REF_PARENTHESIZED_P (init
)));
23454 TREE_VEC_ELT (targs
, 0)
23455 = finish_decltype_type (init
, id
, tf_warning_or_error
);
23456 if (type
!= auto_node
)
23458 if (complain
& tf_error
)
23459 error ("%qT as type rather than plain %<decltype(auto)%>", type
);
23460 return error_mark_node
;
23465 tree parms
= build_tree_list (NULL_TREE
, type
);
23466 tree tparms
= make_tree_vec (1);
23469 TREE_VEC_ELT (tparms
, 0)
23470 = build_tree_list (NULL_TREE
, TYPE_NAME (auto_node
));
23471 val
= type_unification_real (tparms
, targs
, parms
, &init
, 1, 0,
23472 DEDUCE_CALL
, LOOKUP_NORMAL
,
23473 NULL
, /*explain_p=*/false);
23476 if (processing_template_decl
)
23477 /* Try again at instantiation time. */
23479 if (type
&& type
!= error_mark_node
23480 && (complain
& tf_error
))
23481 /* If type is error_mark_node a diagnostic must have been
23482 emitted by now. Also, having a mention to '<type error>'
23483 in the diagnostic is not really useful to the user. */
23485 if (cfun
&& auto_node
== current_function_auto_return_pattern
23486 && LAMBDA_FUNCTION_P (current_function_decl
))
23487 error ("unable to deduce lambda return type from %qE", init
);
23489 error ("unable to deduce %qT from %qE", type
, init
);
23491 return error_mark_node
;
23495 /* If the list of declarators contains more than one declarator, the type
23496 of each declared variable is determined as described above. If the
23497 type deduced for the template parameter U is not the same in each
23498 deduction, the program is ill-formed. */
23499 if (TREE_TYPE (auto_node
)
23500 && !same_type_p (TREE_TYPE (auto_node
), TREE_VEC_ELT (targs
, 0)))
23502 if (cfun
&& auto_node
== current_function_auto_return_pattern
23503 && LAMBDA_FUNCTION_P (current_function_decl
))
23504 error ("inconsistent types %qT and %qT deduced for "
23505 "lambda return type", TREE_TYPE (auto_node
),
23506 TREE_VEC_ELT (targs
, 0));
23508 error ("inconsistent deduction for %qT: %qT and then %qT",
23509 auto_node
, TREE_TYPE (auto_node
), TREE_VEC_ELT (targs
, 0));
23510 return error_mark_node
;
23512 if (context
!= adc_requirement
)
23513 TREE_TYPE (auto_node
) = TREE_VEC_ELT (targs
, 0);
23515 /* Check any placeholder constraints against the deduced type. */
23516 if (flag_concepts
&& !processing_template_decl
)
23517 if (tree constr
= PLACEHOLDER_TYPE_CONSTRAINTS (auto_node
))
23519 /* Use the deduced type to check the associated constraints. */
23520 if (!constraints_satisfied_p (constr
, targs
))
23522 if (complain
& tf_warning_or_error
)
23526 case adc_unspecified
:
23527 error("placeholder constraints not satisfied");
23529 case adc_variable_type
:
23530 error ("deduced initializer does not satisfy "
23531 "placeholder constraints");
23533 case adc_return_type
:
23534 error ("deduced return type does not satisfy "
23535 "placeholder constraints");
23537 case adc_requirement
:
23538 error ("deduced expression type does not saatisy "
23539 "placeholder constraints");
23542 diagnose_constraints (input_location
, constr
, targs
);
23544 return error_mark_node
;
23548 if (processing_template_decl
)
23549 targs
= add_to_template_args (current_template_args (), targs
);
23550 return tsubst (type
, targs
, complain
, NULL_TREE
);
23553 /* Substitutes LATE_RETURN_TYPE for 'auto' in TYPE and returns the
23557 splice_late_return_type (tree type
, tree late_return_type
)
23559 if (is_auto (type
))
23561 if (late_return_type
)
23562 return late_return_type
;
23564 tree idx
= get_template_parm_index (type
);
23565 if (TEMPLATE_PARM_LEVEL (idx
) <= processing_template_decl
)
23566 /* In an abbreviated function template we didn't know we were dealing
23567 with a function template when we saw the auto return type, so update
23568 it to have the correct level. */
23569 return make_auto_1 (TYPE_IDENTIFIER (type
));
23574 /* Returns true iff TYPE is a TEMPLATE_TYPE_PARM representing 'auto' or
23575 'decltype(auto)'. */
23578 is_auto (const_tree type
)
23580 if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
23581 && (TYPE_IDENTIFIER (type
) == get_identifier ("auto")
23582 || TYPE_IDENTIFIER (type
) == get_identifier ("decltype(auto)")))
23588 /* Returns the TEMPLATE_TYPE_PARM in TYPE representing `auto' iff TYPE contains
23589 a use of `auto'. Returns NULL_TREE otherwise. */
23592 type_uses_auto (tree type
)
23594 return find_type_usage (type
, is_auto
);
23597 /* Returns true iff TYPE is a TEMPLATE_TYPE_PARM representing 'auto',
23598 'decltype(auto)' or a concept. */
23601 is_auto_or_concept (const_tree type
)
23603 return is_auto (type
); // or concept
23606 /* Returns the TEMPLATE_TYPE_PARM in TYPE representing a generic type (`auto' or
23607 a concept identifier) iff TYPE contains a use of a generic type. Returns
23608 NULL_TREE otherwise. */
23611 type_uses_auto_or_concept (tree type
)
23613 return find_type_usage (type
, is_auto_or_concept
);
23617 /* For a given template T, return the vector of typedefs referenced
23618 in T for which access check is needed at T instantiation time.
23619 T is either a FUNCTION_DECL or a RECORD_TYPE.
23620 Those typedefs were added to T by the function
23621 append_type_to_template_for_access_check. */
23623 vec
<qualified_typedef_usage_t
, va_gc
> *
23624 get_types_needing_access_check (tree t
)
23627 vec
<qualified_typedef_usage_t
, va_gc
> *result
= NULL
;
23629 if (!t
|| t
== error_mark_node
)
23632 if (!(ti
= get_template_info (t
)))
23635 if (CLASS_TYPE_P (t
)
23636 || TREE_CODE (t
) == FUNCTION_DECL
)
23638 if (!TI_TEMPLATE (ti
))
23641 result
= TI_TYPEDEFS_NEEDING_ACCESS_CHECKING (ti
);
23647 /* Append the typedef TYPE_DECL used in template T to a list of typedefs
23648 tied to T. That list of typedefs will be access checked at
23649 T instantiation time.
23650 T is either a FUNCTION_DECL or a RECORD_TYPE.
23651 TYPE_DECL is a TYPE_DECL node representing a typedef.
23652 SCOPE is the scope through which TYPE_DECL is accessed.
23653 LOCATION is the location of the usage point of TYPE_DECL.
23655 This function is a subroutine of
23656 append_type_to_template_for_access_check. */
23659 append_type_to_template_for_access_check_1 (tree t
,
23662 location_t location
)
23664 qualified_typedef_usage_t typedef_usage
;
23667 if (!t
|| t
== error_mark_node
)
23670 gcc_assert ((TREE_CODE (t
) == FUNCTION_DECL
23671 || CLASS_TYPE_P (t
))
23673 && TREE_CODE (type_decl
) == TYPE_DECL
23676 if (!(ti
= get_template_info (t
)))
23679 gcc_assert (TI_TEMPLATE (ti
));
23681 typedef_usage
.typedef_decl
= type_decl
;
23682 typedef_usage
.context
= scope
;
23683 typedef_usage
.locus
= location
;
23685 vec_safe_push (TI_TYPEDEFS_NEEDING_ACCESS_CHECKING (ti
), typedef_usage
);
23688 /* Append TYPE_DECL to the template TEMPL.
23689 TEMPL is either a class type, a FUNCTION_DECL or a a TEMPLATE_DECL.
23690 At TEMPL instanciation time, TYPE_DECL will be checked to see
23691 if it can be accessed through SCOPE.
23692 LOCATION is the location of the usage point of TYPE_DECL.
23694 e.g. consider the following code snippet:
23701 template<class U> struct S
23703 C::myint mi; // <-- usage point of the typedef C::myint
23708 At S<char> instantiation time, we need to check the access of C::myint
23709 In other words, we need to check the access of the myint typedef through
23710 the C scope. For that purpose, this function will add the myint typedef
23711 and the scope C through which its being accessed to a list of typedefs
23712 tied to the template S. That list will be walked at template instantiation
23713 time and access check performed on each typedefs it contains.
23714 Note that this particular code snippet should yield an error because
23715 myint is private to C. */
23718 append_type_to_template_for_access_check (tree templ
,
23721 location_t location
)
23723 qualified_typedef_usage_t
*iter
;
23726 gcc_assert (type_decl
&& (TREE_CODE (type_decl
) == TYPE_DECL
));
23728 /* Make sure we don't append the type to the template twice. */
23729 FOR_EACH_VEC_SAFE_ELT (get_types_needing_access_check (templ
), i
, iter
)
23730 if (iter
->typedef_decl
== type_decl
&& scope
== iter
->context
)
23733 append_type_to_template_for_access_check_1 (templ
, type_decl
,
23737 /* Convert the generic type parameters in PARM that match the types given in the
23738 range [START_IDX, END_IDX) from the current_template_parms into generic type
23742 convert_generic_types_to_packs (tree parm
, int start_idx
, int end_idx
)
23744 tree current
= current_template_parms
;
23745 int depth
= TMPL_PARMS_DEPTH (current
);
23746 current
= INNERMOST_TEMPLATE_PARMS (current
);
23747 tree replacement
= make_tree_vec (TREE_VEC_LENGTH (current
));
23749 for (int i
= 0; i
< start_idx
; ++i
)
23750 TREE_VEC_ELT (replacement
, i
)
23751 = TREE_TYPE (TREE_VALUE (TREE_VEC_ELT (current
, i
)));
23753 for (int i
= start_idx
; i
< end_idx
; ++i
)
23755 /* Create a distinct parameter pack type from the current parm and add it
23756 to the replacement args to tsubst below into the generic function
23759 tree o
= TREE_TYPE (TREE_VALUE
23760 (TREE_VEC_ELT (current
, i
)));
23761 tree t
= copy_type (o
);
23762 TEMPLATE_TYPE_PARM_INDEX (t
)
23763 = reduce_template_parm_level (TEMPLATE_TYPE_PARM_INDEX (o
),
23765 TREE_TYPE (TEMPLATE_TYPE_DECL (t
)) = t
;
23766 TYPE_STUB_DECL (t
) = TYPE_NAME (t
) = TEMPLATE_TYPE_DECL (t
);
23767 TYPE_MAIN_VARIANT (t
) = t
;
23768 TEMPLATE_TYPE_PARAMETER_PACK (t
) = true;
23769 TYPE_CANONICAL (t
) = canonical_type_parameter (t
);
23770 TREE_VEC_ELT (replacement
, i
) = t
;
23771 TREE_VALUE (TREE_VEC_ELT (current
, i
)) = TREE_CHAIN (t
);
23774 for (int i
= end_idx
, e
= TREE_VEC_LENGTH (current
); i
< e
; ++i
)
23775 TREE_VEC_ELT (replacement
, i
)
23776 = TREE_TYPE (TREE_VALUE (TREE_VEC_ELT (current
, i
)));
23778 /* If there are more levels then build up the replacement with the outer
23781 replacement
= add_to_template_args (template_parms_to_args
23782 (TREE_CHAIN (current_template_parms
)),
23785 return tsubst (parm
, replacement
, tf_none
, NULL_TREE
);
23788 /* Entries in the decl_constraint hash table. */
23789 struct GTY((for_user
)) constr_entry
23795 /* Hashing function and equality for constraint entries. */
23796 struct constr_hasher
: ggc_ptr_hash
<constr_entry
>
23798 static hashval_t
hash (constr_entry
*e
)
23800 return (hashval_t
)DECL_UID (e
->decl
);
23803 static bool equal (constr_entry
*e1
, constr_entry
*e2
)
23805 return e1
->decl
== e2
->decl
;
23809 /* A mapping from declarations to constraint information. Note that
23810 both templates and their underlying declarations are mapped to the
23811 same constraint information.
23813 FIXME: This is defined in pt.c because garbage collection
23814 code is not being generated for constraint.cc. */
23816 static GTY (()) hash_table
<constr_hasher
> *decl_constraints
;
23818 /* Returns true iff cinfo contains a valid set of constraints.
23819 This is the case when the associated requirements have been
23820 successfully decomposed into lists of atomic constraints.
23821 That is, when the saved assumptions are not error_mark_node. */
23824 valid_constraints_p (tree cinfo
)
23826 gcc_assert (cinfo
);
23827 return CI_ASSUMPTIONS (cinfo
) != error_mark_node
;
23830 /* Returns the template constraints of declaration T. If T is not
23831 constrained, return NULL_TREE. Note that T must be non-null. */
23834 get_constraints (tree t
)
23836 gcc_assert (DECL_P (t
));
23837 if (TREE_CODE (t
) == TEMPLATE_DECL
)
23838 t
= DECL_TEMPLATE_RESULT (t
);
23839 constr_entry elt
= { t
, NULL_TREE
};
23840 constr_entry
* found
= decl_constraints
->find (&elt
);
23847 /* Associate the given constraint information CI with the declaration
23848 T. If T is a template, then the constraints are associated with
23849 its underlying declaration. Don't build associations if CI is
23853 set_constraints (tree t
, tree ci
)
23858 if (TREE_CODE (t
) == TEMPLATE_DECL
)
23859 t
= DECL_TEMPLATE_RESULT (t
);
23860 gcc_assert (!get_constraints (t
));
23861 constr_entry elt
= {t
, ci
};
23862 constr_entry
** slot
= decl_constraints
->find_slot (&elt
, INSERT
);
23863 constr_entry
* entry
= ggc_alloc
<constr_entry
> ();
23868 /* Remove the associated constraints of the declaration T. */
23871 remove_constraints (tree t
)
23873 gcc_assert (DECL_P (t
));
23874 if (TREE_CODE (t
) == TEMPLATE_DECL
)
23875 t
= DECL_TEMPLATE_RESULT (t
);
23877 constr_entry elt
= {t
, NULL_TREE
};
23878 constr_entry
** slot
= decl_constraints
->find_slot (&elt
, NO_INSERT
);
23880 decl_constraints
->clear_slot (slot
);
23883 /* Set up the hash table for constraint association. */
23886 init_constraint_processing (void)
23888 decl_constraints
= hash_table
<constr_hasher
>::create_ggc(37);
23891 /* Set up the hash tables for template instantiations. */
23894 init_template_processing (void)
23896 decl_specializations
= hash_table
<spec_hasher
>::create_ggc (37);
23897 type_specializations
= hash_table
<spec_hasher
>::create_ggc (37);
23900 /* Print stats about the template hash tables for -fstats. */
23903 print_template_statistics (void)
23905 fprintf (stderr
, "decl_specializations: size %ld, %ld elements, "
23906 "%f collisions\n", (long) decl_specializations
->size (),
23907 (long) decl_specializations
->elements (),
23908 decl_specializations
->collisions ());
23909 fprintf (stderr
, "type_specializations: size %ld, %ld elements, "
23910 "%f collisions\n", (long) type_specializations
->size (),
23911 (long) type_specializations
->elements (),
23912 type_specializations
->collisions ());
23915 #include "gt-cp-pt.h"