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 tree inst_decl
= (DECL_P (instance
)
4694 ? instance
: TYPE_NAME (instance
));
4697 else if (spec
== error_mark_node
)
4698 permerror (input_location
,
4699 "declaration of %qD ambiguates earlier template "
4700 "instantiation for %qD", decl
, inst_decl
);
4701 else if (TREE_VALUE (spec
) == tmpl
)
4702 permerror (input_location
,
4703 "partial specialization of %qD after instantiation "
4704 "of %qD", decl
, inst_decl
);
4711 /* PARM is a template parameter of some form; return the corresponding
4712 TEMPLATE_PARM_INDEX. */
4715 get_template_parm_index (tree parm
)
4717 if (TREE_CODE (parm
) == PARM_DECL
4718 || TREE_CODE (parm
) == CONST_DECL
)
4719 parm
= DECL_INITIAL (parm
);
4720 else if (TREE_CODE (parm
) == TYPE_DECL
4721 || TREE_CODE (parm
) == TEMPLATE_DECL
)
4722 parm
= TREE_TYPE (parm
);
4723 if (TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
4724 || TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
4725 || TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
)
4726 parm
= TEMPLATE_TYPE_PARM_INDEX (parm
);
4727 gcc_assert (TREE_CODE (parm
) == TEMPLATE_PARM_INDEX
);
4731 /* Subroutine of fixed_parameter_pack_p below. Look for any template
4732 parameter packs used by the template parameter PARM. */
4735 fixed_parameter_pack_p_1 (tree parm
, struct find_parameter_pack_data
*ppd
)
4737 /* A type parm can't refer to another parm. */
4738 if (TREE_CODE (parm
) == TYPE_DECL
)
4740 else if (TREE_CODE (parm
) == PARM_DECL
)
4742 cp_walk_tree (&TREE_TYPE (parm
), &find_parameter_packs_r
,
4747 gcc_assert (TREE_CODE (parm
) == TEMPLATE_DECL
);
4749 tree vec
= INNERMOST_TEMPLATE_PARMS (DECL_TEMPLATE_PARMS (parm
));
4750 for (int i
= 0; i
< TREE_VEC_LENGTH (vec
); ++i
)
4751 fixed_parameter_pack_p_1 (TREE_VALUE (TREE_VEC_ELT (vec
, i
)), ppd
);
4754 /* PARM is a template parameter pack. Return any parameter packs used in
4755 its type or the type of any of its template parameters. If there are
4756 any such packs, it will be instantiated into a fixed template parameter
4757 list by partial instantiation rather than be fully deduced. */
4760 fixed_parameter_pack_p (tree parm
)
4762 /* This can only be true in a member template. */
4763 if (TEMPLATE_PARM_ORIG_LEVEL (get_template_parm_index (parm
)) < 2)
4765 /* This can only be true for a parameter pack. */
4766 if (!template_parameter_pack_p (parm
))
4768 /* A type parm can't refer to another parm. */
4769 if (TREE_CODE (parm
) == TYPE_DECL
)
4772 tree parameter_packs
= NULL_TREE
;
4773 struct find_parameter_pack_data ppd
;
4774 ppd
.parameter_packs
= ¶meter_packs
;
4775 ppd
.visited
= new hash_set
<tree
>;
4777 fixed_parameter_pack_p_1 (parm
, &ppd
);
4780 return parameter_packs
;
4783 /* Check that a template declaration's use of default arguments and
4784 parameter packs is not invalid. Here, PARMS are the template
4785 parameters. IS_PRIMARY is true if DECL is the thing declared by
4786 a primary template. IS_PARTIAL is true if DECL is a partial
4789 IS_FRIEND_DECL is nonzero if DECL is a friend function template
4790 declaration (but not a definition); 1 indicates a declaration, 2
4791 indicates a redeclaration. When IS_FRIEND_DECL=2, no errors are
4792 emitted for extraneous default arguments.
4794 Returns TRUE if there were no errors found, FALSE otherwise. */
4797 check_default_tmpl_args (tree decl
, tree parms
, bool is_primary
,
4798 bool is_partial
, int is_friend_decl
)
4801 int last_level_to_check
;
4803 bool no_errors
= true;
4807 A default template-argument shall not be specified in a
4808 function template declaration or a function template definition, nor
4809 in the template-parameter-list of the definition of a member of a
4812 if (TREE_CODE (CP_DECL_CONTEXT (decl
)) == FUNCTION_DECL
4813 || (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_LOCAL_FUNCTION_P (decl
)))
4814 /* You can't have a function template declaration in a local
4815 scope, nor you can you define a member of a class template in a
4819 if ((TREE_CODE (decl
) == TYPE_DECL
4821 && LAMBDA_TYPE_P (TREE_TYPE (decl
)))
4822 || (TREE_CODE (decl
) == FUNCTION_DECL
4823 && LAMBDA_FUNCTION_P (decl
)))
4824 /* A lambda doesn't have an explicit declaration; don't complain
4825 about the parms of the enclosing class. */
4828 if (current_class_type
4829 && !TYPE_BEING_DEFINED (current_class_type
)
4830 && DECL_LANG_SPECIFIC (decl
)
4831 && DECL_DECLARES_FUNCTION_P (decl
)
4832 /* If this is either a friend defined in the scope of the class
4833 or a member function. */
4834 && (DECL_FUNCTION_MEMBER_P (decl
)
4835 ? same_type_p (DECL_CONTEXT (decl
), current_class_type
)
4836 : DECL_FRIEND_CONTEXT (decl
)
4837 ? same_type_p (DECL_FRIEND_CONTEXT (decl
), current_class_type
)
4839 /* And, if it was a member function, it really was defined in
4840 the scope of the class. */
4841 && (!DECL_FUNCTION_MEMBER_P (decl
)
4842 || DECL_INITIALIZED_IN_CLASS_P (decl
)))
4843 /* We already checked these parameters when the template was
4844 declared, so there's no need to do it again now. This function
4845 was defined in class scope, but we're processing its body now
4846 that the class is complete. */
4849 /* Core issue 226 (C++0x only): the following only applies to class
4852 && ((cxx_dialect
== cxx98
) || TREE_CODE (decl
) != FUNCTION_DECL
))
4856 If a template-parameter has a default template-argument, all
4857 subsequent template-parameters shall have a default
4858 template-argument supplied. */
4859 for (parm_level
= parms
; parm_level
; parm_level
= TREE_CHAIN (parm_level
))
4861 tree inner_parms
= TREE_VALUE (parm_level
);
4862 int ntparms
= TREE_VEC_LENGTH (inner_parms
);
4863 int seen_def_arg_p
= 0;
4866 for (i
= 0; i
< ntparms
; ++i
)
4868 tree parm
= TREE_VEC_ELT (inner_parms
, i
);
4870 if (parm
== error_mark_node
)
4873 if (TREE_PURPOSE (parm
))
4875 else if (seen_def_arg_p
4876 && !template_parameter_pack_p (TREE_VALUE (parm
)))
4878 error ("no default argument for %qD", TREE_VALUE (parm
));
4879 /* For better subsequent error-recovery, we indicate that
4880 there should have been a default argument. */
4881 TREE_PURPOSE (parm
) = error_mark_node
;
4884 else if (!is_partial
4886 /* Don't complain about an enclosing partial
4888 && parm_level
== parms
4889 && TREE_CODE (decl
) == TYPE_DECL
4891 && template_parameter_pack_p (TREE_VALUE (parm
))
4892 /* A fixed parameter pack will be partially
4893 instantiated into a fixed length list. */
4894 && !fixed_parameter_pack_p (TREE_VALUE (parm
)))
4896 /* A primary class template can only have one
4897 parameter pack, at the end of the template
4900 error ("parameter pack %q+D must be at the end of the"
4901 " template parameter list", TREE_VALUE (parm
));
4903 TREE_VALUE (TREE_VEC_ELT (inner_parms
, i
))
4911 if (((cxx_dialect
== cxx98
) && TREE_CODE (decl
) != TYPE_DECL
)
4915 /* For an ordinary class template, default template arguments are
4916 allowed at the innermost level, e.g.:
4917 template <class T = int>
4919 but, in a partial specialization, they're not allowed even
4920 there, as we have in [temp.class.spec]:
4922 The template parameter list of a specialization shall not
4923 contain default template argument values.
4925 So, for a partial specialization, or for a function template
4926 (in C++98/C++03), we look at all of them. */
4929 /* But, for a primary class template that is not a partial
4930 specialization we look at all template parameters except the
4932 parms
= TREE_CHAIN (parms
);
4934 /* Figure out what error message to issue. */
4935 if (is_friend_decl
== 2)
4936 msg
= G_("default template arguments may not be used in function template "
4937 "friend re-declaration");
4938 else if (is_friend_decl
)
4939 msg
= G_("default template arguments may not be used in function template "
4940 "friend declarations");
4941 else if (TREE_CODE (decl
) == FUNCTION_DECL
&& (cxx_dialect
== cxx98
))
4942 msg
= G_("default template arguments may not be used in function templates "
4943 "without -std=c++11 or -std=gnu++11");
4944 else if (is_partial
)
4945 msg
= G_("default template arguments may not be used in "
4946 "partial specializations");
4947 else if (current_class_type
&& CLASSTYPE_IS_TEMPLATE (current_class_type
))
4948 msg
= G_("default argument for template parameter for class enclosing %qD");
4950 /* Per [temp.param]/9, "A default template-argument shall not be
4951 specified in the template-parameter-lists of the definition of
4952 a member of a class template that appears outside of the member's
4953 class.", thus if we aren't handling a member of a class template
4954 there is no need to examine the parameters. */
4957 if (current_class_type
&& TYPE_BEING_DEFINED (current_class_type
))
4958 /* If we're inside a class definition, there's no need to
4959 examine the parameters to the class itself. On the one
4960 hand, they will be checked when the class is defined, and,
4961 on the other, default arguments are valid in things like:
4962 template <class T = double>
4963 struct S { template <class U> void f(U); };
4964 Here the default argument for `S' has no bearing on the
4965 declaration of `f'. */
4966 last_level_to_check
= template_class_depth (current_class_type
) + 1;
4968 /* Check everything. */
4969 last_level_to_check
= 0;
4971 for (parm_level
= parms
;
4972 parm_level
&& TMPL_PARMS_DEPTH (parm_level
) >= last_level_to_check
;
4973 parm_level
= TREE_CHAIN (parm_level
))
4975 tree inner_parms
= TREE_VALUE (parm_level
);
4979 ntparms
= TREE_VEC_LENGTH (inner_parms
);
4980 for (i
= 0; i
< ntparms
; ++i
)
4982 if (TREE_VEC_ELT (inner_parms
, i
) == error_mark_node
)
4985 if (TREE_PURPOSE (TREE_VEC_ELT (inner_parms
, i
)))
4990 if (is_friend_decl
== 2)
4997 /* Clear out the default argument so that we are not
4999 TREE_PURPOSE (TREE_VEC_ELT (inner_parms
, i
)) = NULL_TREE
;
5003 /* At this point, if we're still interested in issuing messages,
5004 they must apply to classes surrounding the object declared. */
5006 msg
= G_("default argument for template parameter for class "
5013 /* Worker for push_template_decl_real, called via
5014 for_each_template_parm. DATA is really an int, indicating the
5015 level of the parameters we are interested in. If T is a template
5016 parameter of that level, return nonzero. */
5019 template_parm_this_level_p (tree t
, void* data
)
5021 int this_level
= *(int *)data
;
5024 if (TREE_CODE (t
) == TEMPLATE_PARM_INDEX
)
5025 level
= TEMPLATE_PARM_LEVEL (t
);
5027 level
= TEMPLATE_TYPE_LEVEL (t
);
5028 return level
== this_level
;
5031 /* Creates a TEMPLATE_DECL for the indicated DECL using the template
5032 parameters given by current_template_args, or reuses a
5033 previously existing one, if appropriate. Returns the DECL, or an
5034 equivalent one, if it is replaced via a call to duplicate_decls.
5036 If IS_FRIEND is true, DECL is a friend declaration. */
5039 push_template_decl_real (tree decl
, bool is_friend
)
5047 int new_template_p
= 0;
5048 /* True if the template is a member template, in the sense of
5050 bool member_template_p
= false;
5052 if (decl
== error_mark_node
|| !current_template_parms
)
5053 return error_mark_node
;
5055 /* See if this is a partial specialization. */
5056 is_partial
= ((DECL_IMPLICIT_TYPEDEF_P (decl
)
5057 && TREE_CODE (TREE_TYPE (decl
)) != ENUMERAL_TYPE
5058 && CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_TYPE (decl
)))
5060 && DECL_LANG_SPECIFIC (decl
)
5061 && DECL_TEMPLATE_SPECIALIZATION (decl
)
5062 && TINFO_USED_TEMPLATE_ID (DECL_TEMPLATE_INFO (decl
))));
5064 if (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_FRIEND_P (decl
))
5068 /* For a friend, we want the context of the friend function, not
5069 the type of which it is a friend. */
5070 ctx
= CP_DECL_CONTEXT (decl
);
5071 else if (CP_DECL_CONTEXT (decl
)
5072 && TREE_CODE (CP_DECL_CONTEXT (decl
)) != NAMESPACE_DECL
)
5073 /* In the case of a virtual function, we want the class in which
5075 ctx
= CP_DECL_CONTEXT (decl
);
5077 /* Otherwise, if we're currently defining some class, the DECL
5078 is assumed to be a member of the class. */
5079 ctx
= current_scope ();
5081 if (ctx
&& TREE_CODE (ctx
) == NAMESPACE_DECL
)
5084 if (!DECL_CONTEXT (decl
))
5085 DECL_CONTEXT (decl
) = FROB_CONTEXT (current_namespace
);
5087 /* See if this is a primary template. */
5088 if (is_friend
&& ctx
5089 && uses_template_parms_level (ctx
, processing_template_decl
))
5090 /* A friend template that specifies a class context, i.e.
5091 template <typename T> friend void A<T>::f();
5094 else if (TREE_CODE (decl
) == TYPE_DECL
5095 && LAMBDA_TYPE_P (TREE_TYPE (decl
)))
5098 is_primary
= template_parm_scope_p ();
5102 warning (OPT_Wtemplates
, "template %qD declared", decl
);
5104 if (DECL_CLASS_SCOPE_P (decl
))
5105 member_template_p
= true;
5106 if (TREE_CODE (decl
) == TYPE_DECL
5107 && anon_aggrname_p (DECL_NAME (decl
)))
5109 error ("template class without a name");
5110 return error_mark_node
;
5112 else if (TREE_CODE (decl
) == FUNCTION_DECL
)
5114 if (member_template_p
)
5116 if (DECL_OVERRIDE_P (decl
) || DECL_FINAL_P (decl
))
5117 error ("member template %qD may not have virt-specifiers", decl
);
5119 if (DECL_DESTRUCTOR_P (decl
))
5123 A destructor shall not be a member template. */
5124 error ("destructor %qD declared as member template", decl
);
5125 return error_mark_node
;
5127 if (NEW_DELETE_OPNAME_P (DECL_NAME (decl
))
5128 && (!prototype_p (TREE_TYPE (decl
))
5129 || TYPE_ARG_TYPES (TREE_TYPE (decl
)) == void_list_node
5130 || !TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (decl
)))
5131 || (TREE_CHAIN (TYPE_ARG_TYPES ((TREE_TYPE (decl
))))
5132 == void_list_node
)))
5134 /* [basic.stc.dynamic.allocation]
5136 An allocation function can be a function
5137 template. ... Template allocation functions shall
5138 have two or more parameters. */
5139 error ("invalid template declaration of %qD", decl
);
5140 return error_mark_node
;
5143 else if (DECL_IMPLICIT_TYPEDEF_P (decl
)
5144 && CLASS_TYPE_P (TREE_TYPE (decl
)))
5146 else if (TREE_CODE (decl
) == TYPE_DECL
5147 && TYPE_DECL_ALIAS_P (decl
))
5148 /* alias-declaration */
5149 gcc_assert (!DECL_ARTIFICIAL (decl
));
5150 else if (VAR_P (decl
))
5151 /* C++14 variable template. */;
5154 error ("template declaration of %q#D", decl
);
5155 return error_mark_node
;
5159 /* Check to see that the rules regarding the use of default
5160 arguments are not being violated. */
5161 check_default_tmpl_args (decl
, current_template_parms
,
5162 is_primary
, is_partial
, /*is_friend_decl=*/0);
5164 /* Ensure that there are no parameter packs in the type of this
5165 declaration that have not been expanded. */
5166 if (TREE_CODE (decl
) == FUNCTION_DECL
)
5168 /* Check each of the arguments individually to see if there are
5169 any bare parameter packs. */
5170 tree type
= TREE_TYPE (decl
);
5171 tree arg
= DECL_ARGUMENTS (decl
);
5172 tree argtype
= TYPE_ARG_TYPES (type
);
5174 while (arg
&& argtype
)
5176 if (!DECL_PACK_P (arg
)
5177 && check_for_bare_parameter_packs (TREE_TYPE (arg
)))
5179 /* This is a PARM_DECL that contains unexpanded parameter
5180 packs. We have already complained about this in the
5181 check_for_bare_parameter_packs call, so just replace
5182 these types with ERROR_MARK_NODE. */
5183 TREE_TYPE (arg
) = error_mark_node
;
5184 TREE_VALUE (argtype
) = error_mark_node
;
5187 arg
= DECL_CHAIN (arg
);
5188 argtype
= TREE_CHAIN (argtype
);
5191 /* Check for bare parameter packs in the return type and the
5192 exception specifiers. */
5193 if (check_for_bare_parameter_packs (TREE_TYPE (type
)))
5194 /* Errors were already issued, set return type to int
5195 as the frontend doesn't expect error_mark_node as
5197 TREE_TYPE (type
) = integer_type_node
;
5198 if (check_for_bare_parameter_packs (TYPE_RAISES_EXCEPTIONS (type
)))
5199 TYPE_RAISES_EXCEPTIONS (type
) = NULL_TREE
;
5201 else if (check_for_bare_parameter_packs ((TREE_CODE (decl
) == TYPE_DECL
5202 && TYPE_DECL_ALIAS_P (decl
))
5203 ? DECL_ORIGINAL_TYPE (decl
)
5204 : TREE_TYPE (decl
)))
5206 TREE_TYPE (decl
) = error_mark_node
;
5207 return error_mark_node
;
5211 return process_partial_specialization (decl
);
5213 args
= current_template_args ();
5216 || TREE_CODE (ctx
) == FUNCTION_DECL
5217 || (CLASS_TYPE_P (ctx
) && TYPE_BEING_DEFINED (ctx
))
5218 || (TREE_CODE (decl
) == TYPE_DECL
5219 && LAMBDA_TYPE_P (TREE_TYPE (decl
)))
5220 || (is_friend
&& !DECL_TEMPLATE_INFO (decl
)))
5222 if (DECL_LANG_SPECIFIC (decl
)
5223 && DECL_TEMPLATE_INFO (decl
)
5224 && DECL_TI_TEMPLATE (decl
))
5225 tmpl
= DECL_TI_TEMPLATE (decl
);
5226 /* If DECL is a TYPE_DECL for a class-template, then there won't
5227 be DECL_LANG_SPECIFIC. The information equivalent to
5228 DECL_TEMPLATE_INFO is found in TYPE_TEMPLATE_INFO instead. */
5229 else if (DECL_IMPLICIT_TYPEDEF_P (decl
)
5230 && TYPE_TEMPLATE_INFO (TREE_TYPE (decl
))
5231 && TYPE_TI_TEMPLATE (TREE_TYPE (decl
)))
5233 /* Since a template declaration already existed for this
5234 class-type, we must be redeclaring it here. Make sure
5235 that the redeclaration is valid. */
5236 redeclare_class_template (TREE_TYPE (decl
),
5237 current_template_parms
,
5238 current_template_constraints ());
5239 /* We don't need to create a new TEMPLATE_DECL; just use the
5240 one we already had. */
5241 tmpl
= TYPE_TI_TEMPLATE (TREE_TYPE (decl
));
5245 tmpl
= build_template_decl (decl
, current_template_parms
,
5249 if (DECL_LANG_SPECIFIC (decl
)
5250 && DECL_TEMPLATE_SPECIALIZATION (decl
))
5252 /* A specialization of a member template of a template
5254 SET_DECL_TEMPLATE_SPECIALIZATION (tmpl
);
5255 DECL_TEMPLATE_INFO (tmpl
) = DECL_TEMPLATE_INFO (decl
);
5256 DECL_TEMPLATE_INFO (decl
) = NULL_TREE
;
5262 tree a
, t
, current
, parms
;
5264 tree tinfo
= get_template_info (decl
);
5268 error ("template definition of non-template %q#D", decl
);
5269 return error_mark_node
;
5272 tmpl
= TI_TEMPLATE (tinfo
);
5274 if (DECL_FUNCTION_TEMPLATE_P (tmpl
)
5275 && DECL_TEMPLATE_INFO (decl
) && DECL_TI_ARGS (decl
)
5276 && DECL_TEMPLATE_SPECIALIZATION (decl
)
5277 && DECL_MEMBER_TEMPLATE_P (tmpl
))
5281 /* The declaration is a specialization of a member
5282 template, declared outside the class. Therefore, the
5283 innermost template arguments will be NULL, so we
5284 replace them with the arguments determined by the
5285 earlier call to check_explicit_specialization. */
5286 args
= DECL_TI_ARGS (decl
);
5289 = build_template_decl (decl
, current_template_parms
,
5291 DECL_TEMPLATE_RESULT (new_tmpl
) = decl
;
5292 TREE_TYPE (new_tmpl
) = TREE_TYPE (decl
);
5293 DECL_TI_TEMPLATE (decl
) = new_tmpl
;
5294 SET_DECL_TEMPLATE_SPECIALIZATION (new_tmpl
);
5295 DECL_TEMPLATE_INFO (new_tmpl
)
5296 = build_template_info (tmpl
, args
);
5298 register_specialization (new_tmpl
,
5299 most_general_template (tmpl
),
5305 /* Make sure the template headers we got make sense. */
5307 parms
= DECL_TEMPLATE_PARMS (tmpl
);
5308 i
= TMPL_PARMS_DEPTH (parms
);
5309 if (TMPL_ARGS_DEPTH (args
) != i
)
5311 error ("expected %d levels of template parms for %q#D, got %d",
5312 i
, decl
, TMPL_ARGS_DEPTH (args
));
5313 DECL_INTERFACE_KNOWN (decl
) = 1;
5314 return error_mark_node
;
5317 for (current
= decl
; i
> 0; --i
, parms
= TREE_CHAIN (parms
))
5319 a
= TMPL_ARGS_LEVEL (args
, i
);
5320 t
= INNERMOST_TEMPLATE_PARMS (parms
);
5322 if (TREE_VEC_LENGTH (t
) != TREE_VEC_LENGTH (a
))
5324 if (current
== decl
)
5325 error ("got %d template parameters for %q#D",
5326 TREE_VEC_LENGTH (a
), decl
);
5328 error ("got %d template parameters for %q#T",
5329 TREE_VEC_LENGTH (a
), current
);
5330 error (" but %d required", TREE_VEC_LENGTH (t
));
5331 /* Avoid crash in import_export_decl. */
5332 DECL_INTERFACE_KNOWN (decl
) = 1;
5333 return error_mark_node
;
5336 if (current
== decl
)
5338 else if (current
== NULL_TREE
)
5339 /* Can happen in erroneous input. */
5342 current
= get_containing_scope (current
);
5345 /* Check that the parms are used in the appropriate qualifying scopes
5346 in the declarator. */
5347 if (!comp_template_args
5349 TI_ARGS (get_template_info (DECL_TEMPLATE_RESULT (tmpl
)))))
5352 template arguments to %qD do not match original template %qD",
5353 decl
, DECL_TEMPLATE_RESULT (tmpl
));
5354 if (!uses_template_parms (TI_ARGS (tinfo
)))
5355 inform (input_location
, "use template<> for an explicit specialization");
5356 /* Avoid crash in import_export_decl. */
5357 DECL_INTERFACE_KNOWN (decl
) = 1;
5358 return error_mark_node
;
5362 DECL_TEMPLATE_RESULT (tmpl
) = decl
;
5363 TREE_TYPE (tmpl
) = TREE_TYPE (decl
);
5365 /* Push template declarations for global functions and types. Note
5366 that we do not try to push a global template friend declared in a
5367 template class; such a thing may well depend on the template
5368 parameters of the class. */
5369 if (new_template_p
&& !ctx
5370 && !(is_friend
&& template_class_depth (current_class_type
) > 0))
5372 tmpl
= pushdecl_namespace_level (tmpl
, is_friend
);
5373 if (tmpl
== error_mark_node
)
5374 return error_mark_node
;
5376 /* Hide template friend classes that haven't been declared yet. */
5377 if (is_friend
&& TREE_CODE (decl
) == TYPE_DECL
)
5379 DECL_ANTICIPATED (tmpl
) = 1;
5380 DECL_FRIEND_P (tmpl
) = 1;
5386 tree parms
= DECL_TEMPLATE_PARMS (tmpl
);
5389 DECL_PRIMARY_TEMPLATE (tmpl
) = tmpl
;
5390 if (DECL_CONV_FN_P (tmpl
))
5392 int depth
= TMPL_PARMS_DEPTH (parms
);
5394 /* It is a conversion operator. See if the type converted to
5395 depends on innermost template operands. */
5397 if (uses_template_parms_level (TREE_TYPE (TREE_TYPE (tmpl
)),
5399 DECL_TEMPLATE_CONV_FN_P (tmpl
) = 1;
5402 /* Give template template parms a DECL_CONTEXT of the template
5403 for which they are a parameter. */
5404 parms
= INNERMOST_TEMPLATE_PARMS (parms
);
5405 for (i
= TREE_VEC_LENGTH (parms
) - 1; i
>= 0; --i
)
5407 tree parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
5408 if (TREE_CODE (parm
) == TEMPLATE_DECL
)
5409 DECL_CONTEXT (parm
) = tmpl
;
5412 if (TREE_CODE (decl
) == TYPE_DECL
5413 && TYPE_DECL_ALIAS_P (decl
)
5414 && complex_alias_template_p (tmpl
))
5415 TEMPLATE_DECL_COMPLEX_ALIAS_P (tmpl
) = true;
5418 /* The DECL_TI_ARGS of DECL contains full set of arguments referring
5419 back to its most general template. If TMPL is a specialization,
5420 ARGS may only have the innermost set of arguments. Add the missing
5421 argument levels if necessary. */
5422 if (DECL_TEMPLATE_INFO (tmpl
))
5423 args
= add_outermost_template_args (DECL_TI_ARGS (tmpl
), args
);
5425 info
= build_template_info (tmpl
, args
);
5427 if (DECL_IMPLICIT_TYPEDEF_P (decl
))
5428 SET_TYPE_TEMPLATE_INFO (TREE_TYPE (tmpl
), info
);
5431 if (is_primary
&& !DECL_LANG_SPECIFIC (decl
))
5432 retrofit_lang_decl (decl
);
5433 if (DECL_LANG_SPECIFIC (decl
))
5434 DECL_TEMPLATE_INFO (decl
) = info
;
5437 if (flag_implicit_templates
5439 && TREE_PUBLIC (decl
)
5440 && VAR_OR_FUNCTION_DECL_P (decl
))
5441 /* Set DECL_COMDAT on template instantiations; if we force
5442 them to be emitted by explicit instantiation or -frepo,
5443 mark_needed will tell cgraph to do the right thing. */
5444 DECL_COMDAT (decl
) = true;
5446 return DECL_TEMPLATE_RESULT (tmpl
);
5450 push_template_decl (tree decl
)
5452 return push_template_decl_real (decl
, false);
5455 /* FN is an inheriting constructor that inherits from the constructor
5456 template INHERITED; turn FN into a constructor template with a matching
5460 add_inherited_template_parms (tree fn
, tree inherited
)
5463 = INNERMOST_TEMPLATE_PARMS (DECL_TEMPLATE_PARMS (inherited
));
5464 inner_parms
= copy_node (inner_parms
);
5466 = tree_cons (size_int (processing_template_decl
+ 1),
5467 inner_parms
, current_template_parms
);
5468 tree tmpl
= build_template_decl (fn
, parms
, /*member*/true);
5469 tree args
= template_parms_to_args (parms
);
5470 DECL_TEMPLATE_INFO (fn
) = build_template_info (tmpl
, args
);
5471 TREE_TYPE (tmpl
) = TREE_TYPE (fn
);
5472 DECL_TEMPLATE_RESULT (tmpl
) = fn
;
5473 DECL_ARTIFICIAL (tmpl
) = true;
5474 DECL_PRIMARY_TEMPLATE (tmpl
) = tmpl
;
5478 /* Called when a class template TYPE is redeclared with the indicated
5479 template PARMS, e.g.:
5481 template <class T> struct S;
5482 template <class T> struct S {}; */
5485 redeclare_class_template (tree type
, tree parms
, tree cons
)
5491 if (!TYPE_TEMPLATE_INFO (type
))
5493 error ("%qT is not a template type", type
);
5497 tmpl
= TYPE_TI_TEMPLATE (type
);
5498 if (!PRIMARY_TEMPLATE_P (tmpl
))
5499 /* The type is nested in some template class. Nothing to worry
5500 about here; there are no new template parameters for the nested
5506 error ("template specifiers not specified in declaration of %qD",
5511 parms
= INNERMOST_TEMPLATE_PARMS (parms
);
5512 tmpl_parms
= DECL_INNERMOST_TEMPLATE_PARMS (tmpl
);
5514 if (TREE_VEC_LENGTH (parms
) != TREE_VEC_LENGTH (tmpl_parms
))
5516 error_n (input_location
, TREE_VEC_LENGTH (parms
),
5517 "redeclared with %d template parameter",
5518 "redeclared with %d template parameters",
5519 TREE_VEC_LENGTH (parms
));
5520 inform_n (DECL_SOURCE_LOCATION (tmpl
), TREE_VEC_LENGTH (tmpl_parms
),
5521 "previous declaration %qD used %d template parameter",
5522 "previous declaration %qD used %d template parameters",
5523 tmpl
, TREE_VEC_LENGTH (tmpl_parms
));
5527 for (i
= 0; i
< TREE_VEC_LENGTH (tmpl_parms
); ++i
)
5534 if (TREE_VEC_ELT (tmpl_parms
, i
) == error_mark_node
5535 || TREE_VEC_ELT (parms
, i
) == error_mark_node
)
5538 tmpl_parm
= TREE_VALUE (TREE_VEC_ELT (tmpl_parms
, i
));
5539 if (error_operand_p (tmpl_parm
))
5542 parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
5543 tmpl_default
= TREE_PURPOSE (TREE_VEC_ELT (tmpl_parms
, i
));
5544 parm_default
= TREE_PURPOSE (TREE_VEC_ELT (parms
, i
));
5546 /* TMPL_PARM and PARM can be either TYPE_DECL, PARM_DECL, or
5548 if (TREE_CODE (tmpl_parm
) != TREE_CODE (parm
)
5549 || (TREE_CODE (tmpl_parm
) != TYPE_DECL
5550 && !same_type_p (TREE_TYPE (tmpl_parm
), TREE_TYPE (parm
)))
5551 || (TREE_CODE (tmpl_parm
) != PARM_DECL
5552 && (TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (tmpl_parm
))
5553 != TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (parm
))))
5554 || (TREE_CODE (tmpl_parm
) == PARM_DECL
5555 && (TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (tmpl_parm
))
5556 != TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm
)))))
5558 error ("template parameter %q+#D", tmpl_parm
);
5559 error ("redeclared here as %q#D", parm
);
5563 if (tmpl_default
!= NULL_TREE
&& parm_default
!= NULL_TREE
)
5565 /* We have in [temp.param]:
5567 A template-parameter may not be given default arguments
5568 by two different declarations in the same scope. */
5569 error_at (input_location
, "redefinition of default argument for %q#D", parm
);
5570 inform (DECL_SOURCE_LOCATION (tmpl_parm
),
5571 "original definition appeared here");
5575 if (parm_default
!= NULL_TREE
)
5576 /* Update the previous template parameters (which are the ones
5577 that will really count) with the new default value. */
5578 TREE_PURPOSE (TREE_VEC_ELT (tmpl_parms
, i
)) = parm_default
;
5579 else if (tmpl_default
!= NULL_TREE
)
5580 /* Update the new parameters, too; they'll be used as the
5581 parameters for any members. */
5582 TREE_PURPOSE (TREE_VEC_ELT (parms
, i
)) = tmpl_default
;
5584 /* Give each template template parm in this redeclaration a
5585 DECL_CONTEXT of the template for which they are a parameter. */
5586 if (TREE_CODE (parm
) == TEMPLATE_DECL
)
5588 gcc_assert (DECL_CONTEXT (parm
) == NULL_TREE
);
5589 DECL_CONTEXT (parm
) = tmpl
;
5593 // Cannot redeclare a class template with a different set of constraints.
5594 if (!equivalent_constraints (get_constraints (tmpl
), cons
))
5596 error_at (input_location
, "redeclaration %q#D with different "
5597 "constraints", tmpl
);
5598 inform (DECL_SOURCE_LOCATION (tmpl
),
5599 "original declaration appeared here");
5605 /* The actual substitution part of instantiate_non_dependent_expr_sfinae,
5606 to be used when the caller has already checked
5607 (processing_template_decl
5608 && !instantiation_dependent_expression_p (expr)
5609 && potential_constant_expression (expr))
5610 and cleared processing_template_decl. */
5613 instantiate_non_dependent_expr_internal (tree expr
, tsubst_flags_t complain
)
5615 return tsubst_copy_and_build (expr
,
5618 /*in_decl=*/NULL_TREE
,
5619 /*function_p=*/false,
5620 /*integral_constant_expression_p=*/true);
5623 /* Simplify EXPR if it is a non-dependent expression. Returns the
5624 (possibly simplified) expression. */
5627 instantiate_non_dependent_expr_sfinae (tree expr
, tsubst_flags_t complain
)
5629 if (expr
== NULL_TREE
)
5632 /* If we're in a template, but EXPR isn't value dependent, simplify
5633 it. We're supposed to treat:
5635 template <typename T> void f(T[1 + 1]);
5636 template <typename T> void f(T[2]);
5638 as two declarations of the same function, for example. */
5639 if (processing_template_decl
5640 && !instantiation_dependent_expression_p (expr
)
5641 && potential_constant_expression (expr
))
5643 processing_template_decl_sentinel s
;
5644 expr
= instantiate_non_dependent_expr_internal (expr
, complain
);
5650 instantiate_non_dependent_expr (tree expr
)
5652 return instantiate_non_dependent_expr_sfinae (expr
, tf_error
);
5655 /* True iff T is a specialization of a variable template. */
5658 variable_template_specialization_p (tree t
)
5660 if (!VAR_P (t
) || !DECL_LANG_SPECIFIC (t
) || !DECL_TEMPLATE_INFO (t
))
5662 tree tmpl
= DECL_TI_TEMPLATE (t
);
5663 return variable_template_p (tmpl
);
5666 /* Return TRUE iff T is a type alias, a TEMPLATE_DECL for an alias
5667 template declaration, or a TYPE_DECL for an alias declaration. */
5670 alias_type_or_template_p (tree t
)
5674 return ((TREE_CODE (t
) == TYPE_DECL
&& TYPE_DECL_ALIAS_P (t
))
5677 && TYPE_DECL_ALIAS_P (TYPE_NAME (t
)))
5678 || DECL_ALIAS_TEMPLATE_P (t
));
5681 /* Return TRUE iff T is a specialization of an alias template. */
5684 alias_template_specialization_p (const_tree t
)
5686 /* It's an alias template specialization if it's an alias and its
5687 TYPE_NAME is a specialization of a primary template. */
5688 if (TYPE_ALIAS_P (t
))
5690 tree name
= TYPE_NAME (t
);
5691 if (DECL_LANG_SPECIFIC (name
))
5692 if (tree ti
= DECL_TEMPLATE_INFO (name
))
5694 tree tmpl
= TI_TEMPLATE (ti
);
5695 return PRIMARY_TEMPLATE_P (tmpl
);
5701 /* An alias template is complex from a SFINAE perspective if a template-id
5702 using that alias can be ill-formed when the expansion is not, as with
5703 the void_t template. We determine this by checking whether the
5704 expansion for the alias template uses all its template parameters. */
5706 struct uses_all_template_parms_data
5713 uses_all_template_parms_r (tree t
, void *data_
)
5715 struct uses_all_template_parms_data
&data
5716 = *(struct uses_all_template_parms_data
*)data_
;
5717 tree idx
= get_template_parm_index (t
);
5719 if (TEMPLATE_PARM_LEVEL (idx
) == data
.level
)
5720 data
.seen
[TEMPLATE_PARM_IDX (idx
)] = true;
5725 complex_alias_template_p (const_tree tmpl
)
5727 struct uses_all_template_parms_data data
;
5728 tree pat
= DECL_ORIGINAL_TYPE (DECL_TEMPLATE_RESULT (tmpl
));
5729 tree parms
= DECL_TEMPLATE_PARMS (tmpl
);
5730 data
.level
= TMPL_PARMS_DEPTH (parms
);
5731 int len
= TREE_VEC_LENGTH (INNERMOST_TEMPLATE_PARMS (parms
));
5732 data
.seen
= XALLOCAVEC (bool, len
);
5733 for (int i
= 0; i
< len
; ++i
)
5734 data
.seen
[i
] = false;
5736 for_each_template_parm (pat
, uses_all_template_parms_r
, &data
, NULL
, true);
5737 for (int i
= 0; i
< len
; ++i
)
5743 /* Return TRUE iff T is a specialization of a complex alias template with
5744 dependent template-arguments. */
5747 dependent_alias_template_spec_p (const_tree t
)
5749 return (alias_template_specialization_p (t
)
5750 && TEMPLATE_DECL_COMPLEX_ALIAS_P (DECL_TI_TEMPLATE (TYPE_NAME (t
)))
5751 && (any_dependent_template_arguments_p
5752 (INNERMOST_TEMPLATE_ARGS (TYPE_TI_ARGS (t
)))));
5755 /* Return the number of innermost template parameters in TMPL. */
5758 num_innermost_template_parms (tree tmpl
)
5760 tree parms
= INNERMOST_TEMPLATE_PARMS (DECL_TEMPLATE_PARMS (tmpl
));
5761 return TREE_VEC_LENGTH (parms
);
5764 /* Return either TMPL or another template that it is equivalent to under DR
5765 1286: An alias that just changes the name of a template is equivalent to
5766 the other template. */
5769 get_underlying_template (tree tmpl
)
5771 gcc_assert (TREE_CODE (tmpl
) == TEMPLATE_DECL
);
5772 while (DECL_ALIAS_TEMPLATE_P (tmpl
))
5774 tree result
= DECL_ORIGINAL_TYPE (DECL_TEMPLATE_RESULT (tmpl
));
5775 if (TYPE_TEMPLATE_INFO (result
))
5777 tree sub
= TYPE_TI_TEMPLATE (result
);
5778 if (PRIMARY_TEMPLATE_P (sub
)
5779 && (num_innermost_template_parms (tmpl
)
5780 == num_innermost_template_parms (sub
)))
5782 tree alias_args
= INNERMOST_TEMPLATE_ARGS
5783 (template_parms_to_args (DECL_TEMPLATE_PARMS (tmpl
)));
5784 if (!comp_template_args (TYPE_TI_ARGS (result
), alias_args
))
5786 /* The alias type is equivalent to the pattern of the
5787 underlying template, so strip the alias. */
5797 /* Subroutine of convert_nontype_argument. Converts EXPR to TYPE, which
5798 must be a function or a pointer-to-function type, as specified
5799 in [temp.arg.nontype]: disambiguate EXPR if it is an overload set,
5800 and check that the resulting function has external linkage. */
5803 convert_nontype_argument_function (tree type
, tree expr
,
5804 tsubst_flags_t complain
)
5808 linkage_kind linkage
;
5810 fn
= instantiate_type (type
, fns
, tf_none
);
5811 if (fn
== error_mark_node
)
5812 return error_mark_node
;
5815 if (TREE_CODE (fn_no_ptr
) == ADDR_EXPR
)
5816 fn_no_ptr
= TREE_OPERAND (fn_no_ptr
, 0);
5817 if (BASELINK_P (fn_no_ptr
))
5818 fn_no_ptr
= BASELINK_FUNCTIONS (fn_no_ptr
);
5820 /* [temp.arg.nontype]/1
5822 A template-argument for a non-type, non-template template-parameter
5825 -- the address of an object or function with external [C++11: or
5826 internal] linkage. */
5828 if (TREE_CODE (fn_no_ptr
) != FUNCTION_DECL
)
5830 if (complain
& tf_error
)
5832 error ("%qE is not a valid template argument for type %qT",
5834 if (TYPE_PTR_P (type
))
5835 error ("it must be the address of a function with "
5836 "external linkage");
5838 error ("it must be the name of a function with "
5839 "external linkage");
5844 linkage
= decl_linkage (fn_no_ptr
);
5845 if (cxx_dialect
>= cxx11
? linkage
== lk_none
: linkage
!= lk_external
)
5847 if (complain
& tf_error
)
5849 if (cxx_dialect
>= cxx11
)
5850 error ("%qE is not a valid template argument for type %qT "
5851 "because %qD has no linkage",
5852 expr
, type
, fn_no_ptr
);
5854 error ("%qE is not a valid template argument for type %qT "
5855 "because %qD does not have external linkage",
5856 expr
, type
, fn_no_ptr
);
5864 /* Subroutine of convert_nontype_argument.
5865 Check if EXPR of type TYPE is a valid pointer-to-member constant.
5866 Emit an error otherwise. */
5869 check_valid_ptrmem_cst_expr (tree type
, tree expr
,
5870 tsubst_flags_t complain
)
5873 if (expr
&& (null_ptr_cst_p (expr
) || TREE_CODE (expr
) == PTRMEM_CST
))
5875 if (cxx_dialect
>= cxx11
&& null_member_pointer_value_p (expr
))
5877 if (processing_template_decl
5878 && TREE_CODE (expr
) == ADDR_EXPR
5879 && TREE_CODE (TREE_OPERAND (expr
, 0)) == OFFSET_REF
)
5881 if (complain
& tf_error
)
5883 error ("%qE is not a valid template argument for type %qT",
5885 error ("it must be a pointer-to-member of the form %<&X::Y%>");
5890 /* Returns TRUE iff the address of OP is value-dependent.
5892 14.6.2.4 [temp.dep.temp]:
5893 A non-integral non-type template-argument is dependent if its type is
5894 dependent or it has either of the following forms
5897 and contains a nested-name-specifier which specifies a class-name that
5898 names a dependent type.
5900 We generalize this to just say that the address of a member of a
5901 dependent class is value-dependent; the above doesn't cover the
5902 address of a static data member named with an unqualified-id. */
5905 has_value_dependent_address (tree op
)
5907 /* We could use get_inner_reference here, but there's no need;
5908 this is only relevant for template non-type arguments, which
5909 can only be expressed as &id-expression. */
5912 tree ctx
= CP_DECL_CONTEXT (op
);
5913 if (TYPE_P (ctx
) && dependent_type_p (ctx
))
5920 /* The next set of functions are used for providing helpful explanatory
5921 diagnostics for failed overload resolution. Their messages should be
5922 indented by two spaces for consistency with the messages in
5926 unify_success (bool /*explain_p*/)
5932 unify_parameter_deduction_failure (bool explain_p
, tree parm
)
5935 inform (input_location
,
5936 " couldn't deduce template parameter %qD", parm
);
5941 unify_invalid (bool /*explain_p*/)
5947 unify_cv_qual_mismatch (bool explain_p
, tree parm
, tree arg
)
5950 inform (input_location
,
5951 " types %qT and %qT have incompatible cv-qualifiers",
5957 unify_type_mismatch (bool explain_p
, tree parm
, tree arg
)
5960 inform (input_location
, " mismatched types %qT and %qT", parm
, arg
);
5965 unify_parameter_pack_mismatch (bool explain_p
, tree parm
, tree arg
)
5968 inform (input_location
,
5969 " template parameter %qD is not a parameter pack, but "
5976 unify_ptrmem_cst_mismatch (bool explain_p
, tree parm
, tree arg
)
5979 inform (input_location
,
5980 " template argument %qE does not match "
5981 "pointer-to-member constant %qE",
5987 unify_expression_unequal (bool explain_p
, tree parm
, tree arg
)
5990 inform (input_location
, " %qE is not equivalent to %qE", parm
, arg
);
5995 unify_parameter_pack_inconsistent (bool explain_p
, tree old_arg
, tree new_arg
)
5998 inform (input_location
,
5999 " inconsistent parameter pack deduction with %qT and %qT",
6005 unify_inconsistency (bool explain_p
, tree parm
, tree first
, tree second
)
6010 inform (input_location
,
6011 " deduced conflicting types for parameter %qT (%qT and %qT)",
6012 parm
, first
, second
);
6014 inform (input_location
,
6015 " deduced conflicting values for non-type parameter "
6016 "%qE (%qE and %qE)", parm
, first
, second
);
6022 unify_vla_arg (bool explain_p
, tree arg
)
6025 inform (input_location
,
6026 " variable-sized array type %qT is not "
6027 "a valid template argument",
6033 unify_method_type_error (bool explain_p
, tree arg
)
6036 inform (input_location
,
6037 " member function type %qT is not a valid template argument",
6043 unify_arity (bool explain_p
, int have
, int wanted
, bool least_p
= false)
6048 inform_n (input_location
, wanted
,
6049 " candidate expects at least %d argument, %d provided",
6050 " candidate expects at least %d arguments, %d provided",
6053 inform_n (input_location
, wanted
,
6054 " candidate expects %d argument, %d provided",
6055 " candidate expects %d arguments, %d provided",
6062 unify_too_many_arguments (bool explain_p
, int have
, int wanted
)
6064 return unify_arity (explain_p
, have
, wanted
);
6068 unify_too_few_arguments (bool explain_p
, int have
, int wanted
,
6069 bool least_p
= false)
6071 return unify_arity (explain_p
, have
, wanted
, least_p
);
6075 unify_arg_conversion (bool explain_p
, tree to_type
,
6076 tree from_type
, tree arg
)
6079 inform (EXPR_LOC_OR_LOC (arg
, input_location
),
6080 " cannot convert %qE (type %qT) to type %qT",
6081 arg
, from_type
, to_type
);
6086 unify_no_common_base (bool explain_p
, enum template_base_result r
,
6087 tree parm
, tree arg
)
6092 case tbr_ambiguous_baseclass
:
6093 inform (input_location
, " %qT is an ambiguous base class of %qT",
6097 inform (input_location
, " %qT is not derived from %qT", arg
, parm
);
6104 unify_inconsistent_template_template_parameters (bool explain_p
)
6107 inform (input_location
,
6108 " template parameters of a template template argument are "
6109 "inconsistent with other deduced template arguments");
6114 unify_template_deduction_failure (bool explain_p
, tree parm
, tree arg
)
6117 inform (input_location
,
6118 " can't deduce a template for %qT from non-template type %qT",
6124 unify_template_argument_mismatch (bool explain_p
, tree parm
, tree arg
)
6127 inform (input_location
,
6128 " template argument %qE does not match %qD", arg
, parm
);
6133 unify_overload_resolution_failure (bool explain_p
, tree arg
)
6136 inform (input_location
,
6137 " could not resolve address from overloaded function %qE",
6142 /* Attempt to convert the non-type template parameter EXPR to the
6143 indicated TYPE. If the conversion is successful, return the
6144 converted value. If the conversion is unsuccessful, return
6145 NULL_TREE if we issued an error message, or error_mark_node if we
6146 did not. We issue error messages for out-and-out bad template
6147 parameters, but not simply because the conversion failed, since we
6148 might be just trying to do argument deduction. Both TYPE and EXPR
6149 must be non-dependent.
6151 The conversion follows the special rules described in
6152 [temp.arg.nontype], and it is much more strict than an implicit
6155 This function is called twice for each template argument (see
6156 lookup_template_class for a more accurate description of this
6157 problem). This means that we need to handle expressions which
6158 are not valid in a C++ source, but can be created from the
6159 first call (for instance, casts to perform conversions). These
6160 hacks can go away after we fix the double coercion problem. */
6163 convert_nontype_argument (tree type
, tree expr
, tsubst_flags_t complain
)
6167 /* Detect immediately string literals as invalid non-type argument.
6168 This special-case is not needed for correctness (we would easily
6169 catch this later), but only to provide better diagnostic for this
6170 common user mistake. As suggested by DR 100, we do not mention
6171 linkage issues in the diagnostic as this is not the point. */
6172 /* FIXME we're making this OK. */
6173 if (TREE_CODE (expr
) == STRING_CST
)
6175 if (complain
& tf_error
)
6176 error ("%qE is not a valid template argument for type %qT "
6177 "because string literals can never be used in this context",
6182 /* Add the ADDR_EXPR now for the benefit of
6183 value_dependent_expression_p. */
6184 if (TYPE_PTROBV_P (type
)
6185 && TREE_CODE (TREE_TYPE (expr
)) == ARRAY_TYPE
)
6187 expr
= decay_conversion (expr
, complain
);
6188 if (expr
== error_mark_node
)
6189 return error_mark_node
;
6192 /* If we are in a template, EXPR may be non-dependent, but still
6193 have a syntactic, rather than semantic, form. For example, EXPR
6194 might be a SCOPE_REF, rather than the VAR_DECL to which the
6195 SCOPE_REF refers. Preserving the qualifying scope is necessary
6196 so that access checking can be performed when the template is
6197 instantiated -- but here we need the resolved form so that we can
6198 convert the argument. */
6199 bool non_dep
= false;
6200 if (TYPE_REF_OBJ_P (type
)
6201 && has_value_dependent_address (expr
))
6202 /* If we want the address and it's value-dependent, don't fold. */;
6203 else if (!type_unknown_p (expr
)
6204 && processing_template_decl
6205 && !instantiation_dependent_expression_p (expr
)
6206 && potential_constant_expression (expr
))
6208 if (error_operand_p (expr
))
6209 return error_mark_node
;
6210 expr_type
= TREE_TYPE (expr
);
6211 if (TREE_CODE (type
) == REFERENCE_TYPE
)
6212 expr
= mark_lvalue_use (expr
);
6214 expr
= mark_rvalue_use (expr
);
6216 /* If the argument is non-dependent, perform any conversions in
6217 non-dependent context as well. */
6218 processing_template_decl_sentinel
s (non_dep
);
6220 expr
= instantiate_non_dependent_expr_internal (expr
, complain
);
6222 /* 14.3.2/5: The null pointer{,-to-member} conversion is applied
6223 to a non-type argument of "nullptr". */
6224 if (expr
== nullptr_node
&& TYPE_PTR_OR_PTRMEM_P (type
))
6225 expr
= convert (type
, expr
);
6227 /* In C++11, integral or enumeration non-type template arguments can be
6228 arbitrary constant expressions. Pointer and pointer to
6229 member arguments can be general constant expressions that evaluate
6230 to a null value, but otherwise still need to be of a specific form. */
6231 if (cxx_dialect
>= cxx11
)
6233 if (TREE_CODE (expr
) == PTRMEM_CST
)
6234 /* A PTRMEM_CST is already constant, and a valid template
6235 argument for a parameter of pointer to member type, we just want
6236 to leave it in that form rather than lower it to a
6238 else if (INTEGRAL_OR_ENUMERATION_TYPE_P (type
))
6239 expr
= maybe_constant_value (expr
);
6240 else if (cxx_dialect
>= cxx1z
)
6242 if (TREE_CODE (type
) != REFERENCE_TYPE
)
6243 expr
= maybe_constant_value (expr
);
6244 else if (REFERENCE_REF_P (expr
))
6246 expr
= TREE_OPERAND (expr
, 0);
6247 expr
= maybe_constant_value (expr
);
6248 expr
= convert_from_reference (expr
);
6251 else if (TYPE_PTR_OR_PTRMEM_P (type
))
6253 tree folded
= maybe_constant_value (expr
);
6254 if (TYPE_PTR_P (type
) ? integer_zerop (folded
)
6255 : null_member_pointer_value_p (folded
))
6260 /* HACK: Due to double coercion, we can get a
6261 NOP_EXPR<REFERENCE_TYPE>(ADDR_EXPR<POINTER_TYPE> (arg)) here,
6262 which is the tree that we built on the first call (see
6263 below when coercing to reference to object or to reference to
6264 function). We just strip everything and get to the arg.
6265 See g++.old-deja/g++.oliva/template4.C and g++.dg/template/nontype9.C
6267 if (TYPE_REF_OBJ_P (type
) || TYPE_REFFN_P (type
))
6269 tree probe_type
, probe
= expr
;
6270 if (REFERENCE_REF_P (probe
))
6271 probe
= TREE_OPERAND (probe
, 0);
6272 probe_type
= TREE_TYPE (probe
);
6273 if (TREE_CODE (probe
) == NOP_EXPR
)
6275 /* ??? Maybe we could use convert_from_reference here, but we
6276 would need to relax its constraints because the NOP_EXPR
6277 could actually change the type to something more cv-qualified,
6278 and this is not folded by convert_from_reference. */
6279 tree addr
= TREE_OPERAND (probe
, 0);
6280 if (TREE_CODE (probe_type
) == REFERENCE_TYPE
6281 && TREE_CODE (addr
) == ADDR_EXPR
6282 && TYPE_PTR_P (TREE_TYPE (addr
))
6283 && (same_type_ignoring_top_level_qualifiers_p
6284 (TREE_TYPE (probe_type
),
6285 TREE_TYPE (TREE_TYPE (addr
)))))
6287 expr
= TREE_OPERAND (addr
, 0);
6288 expr_type
= TREE_TYPE (probe_type
);
6293 /* We could also generate a NOP_EXPR(ADDR_EXPR()) when the
6294 parameter is a pointer to object, through decay and
6295 qualification conversion. Let's strip everything. */
6296 else if (TREE_CODE (expr
) == NOP_EXPR
&& TYPE_PTROBV_P (type
))
6300 if (TREE_CODE (probe
) == ADDR_EXPR
6301 && TYPE_PTR_P (TREE_TYPE (probe
)))
6303 /* Skip the ADDR_EXPR only if it is part of the decay for
6304 an array. Otherwise, it is part of the original argument
6305 in the source code. */
6306 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (probe
, 0))) == ARRAY_TYPE
)
6307 probe
= TREE_OPERAND (probe
, 0);
6309 expr_type
= TREE_TYPE (expr
);
6313 /* [temp.arg.nontype]/5, bullet 1
6315 For a non-type template-parameter of integral or enumeration type,
6316 integral promotions (_conv.prom_) and integral conversions
6317 (_conv.integral_) are applied. */
6318 if (INTEGRAL_OR_ENUMERATION_TYPE_P (type
))
6320 tree t
= build_integral_nontype_arg_conv (type
, expr
, complain
);
6321 t
= maybe_constant_value (t
);
6322 if (t
!= error_mark_node
)
6325 if (!same_type_ignoring_top_level_qualifiers_p (type
, TREE_TYPE (expr
)))
6326 return error_mark_node
;
6328 /* Notice that there are constant expressions like '4 % 0' which
6329 do not fold into integer constants. */
6330 if (TREE_CODE (expr
) != INTEGER_CST
)
6332 if (complain
& tf_error
)
6334 int errs
= errorcount
, warns
= warningcount
+ werrorcount
;
6335 if (processing_template_decl
6336 && !require_potential_constant_expression (expr
))
6338 expr
= cxx_constant_value (expr
);
6339 if (errorcount
> errs
|| warningcount
+ werrorcount
> warns
)
6340 inform (EXPR_LOC_OR_LOC (expr
, input_location
),
6341 "in template argument for type %qT ", type
);
6342 if (expr
== error_mark_node
)
6344 /* else cxx_constant_value complained but gave us
6345 a real constant, so go ahead. */
6346 gcc_assert (TREE_CODE (expr
) == INTEGER_CST
);
6352 /* Avoid typedef problems. */
6353 if (TREE_TYPE (expr
) != type
)
6354 expr
= fold_convert (type
, expr
);
6356 /* [temp.arg.nontype]/5, bullet 2
6358 For a non-type template-parameter of type pointer to object,
6359 qualification conversions (_conv.qual_) and the array-to-pointer
6360 conversion (_conv.array_) are applied. */
6361 else if (TYPE_PTROBV_P (type
))
6363 /* [temp.arg.nontype]/1 (TC1 version, DR 49):
6365 A template-argument for a non-type, non-template template-parameter
6366 shall be one of: [...]
6368 -- the name of a non-type template-parameter;
6369 -- the address of an object or function with external linkage, [...]
6370 expressed as "& id-expression" where the & is optional if the name
6371 refers to a function or array, or if the corresponding
6372 template-parameter is a reference.
6374 Here, we do not care about functions, as they are invalid anyway
6375 for a parameter of type pointer-to-object. */
6377 if (DECL_P (expr
) && DECL_TEMPLATE_PARM_P (expr
))
6378 /* Non-type template parameters are OK. */
6380 else if (cxx_dialect
>= cxx11
&& integer_zerop (expr
))
6381 /* Null pointer values are OK in C++11. */;
6382 else if (TREE_CODE (expr
) != ADDR_EXPR
6383 && TREE_CODE (expr_type
) != ARRAY_TYPE
)
6387 if (complain
& tf_error
)
6388 error ("%qD is not a valid template argument "
6389 "because %qD is a variable, not the address of "
6390 "a variable", expr
, expr
);
6393 if (POINTER_TYPE_P (expr_type
))
6395 if (complain
& tf_error
)
6396 error ("%qE is not a valid template argument for %qT "
6397 "because it is not the address of a variable",
6401 /* Other values, like integer constants, might be valid
6402 non-type arguments of some other type. */
6403 return error_mark_node
;
6409 decl
= ((TREE_CODE (expr
) == ADDR_EXPR
)
6410 ? TREE_OPERAND (expr
, 0) : expr
);
6413 if (complain
& tf_error
)
6414 error ("%qE is not a valid template argument of type %qT "
6415 "because %qE is not a variable", expr
, type
, decl
);
6418 else if (cxx_dialect
< cxx11
&& !DECL_EXTERNAL_LINKAGE_P (decl
))
6420 if (complain
& tf_error
)
6421 error ("%qE is not a valid template argument of type %qT "
6422 "because %qD does not have external linkage",
6426 else if (cxx_dialect
>= cxx11
&& decl_linkage (decl
) == lk_none
)
6428 if (complain
& tf_error
)
6429 error ("%qE is not a valid template argument of type %qT "
6430 "because %qD has no linkage", expr
, type
, decl
);
6435 expr
= decay_conversion (expr
, complain
);
6436 if (expr
== error_mark_node
)
6437 return error_mark_node
;
6439 expr
= perform_qualification_conversions (type
, expr
);
6440 if (expr
== error_mark_node
)
6441 return error_mark_node
;
6443 /* [temp.arg.nontype]/5, bullet 3
6445 For a non-type template-parameter of type reference to object, no
6446 conversions apply. The type referred to by the reference may be more
6447 cv-qualified than the (otherwise identical) type of the
6448 template-argument. The template-parameter is bound directly to the
6449 template-argument, which must be an lvalue. */
6450 else if (TYPE_REF_OBJ_P (type
))
6452 if (!same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (type
),
6454 return error_mark_node
;
6456 if (!at_least_as_qualified_p (TREE_TYPE (type
), expr_type
))
6458 if (complain
& tf_error
)
6459 error ("%qE is not a valid template argument for type %qT "
6460 "because of conflicts in cv-qualification", expr
, type
);
6464 if (!real_lvalue_p (expr
))
6466 if (complain
& tf_error
)
6467 error ("%qE is not a valid template argument for type %qT "
6468 "because it is not an lvalue", expr
, type
);
6472 /* [temp.arg.nontype]/1
6474 A template-argument for a non-type, non-template template-parameter
6475 shall be one of: [...]
6477 -- the address of an object or function with external linkage. */
6478 if (INDIRECT_REF_P (expr
)
6479 && TYPE_REF_OBJ_P (TREE_TYPE (TREE_OPERAND (expr
, 0))))
6481 expr
= TREE_OPERAND (expr
, 0);
6484 if (complain
& tf_error
)
6485 error ("%q#D is not a valid template argument for type %qT "
6486 "because a reference variable does not have a constant "
6487 "address", expr
, type
);
6494 if (complain
& tf_error
)
6495 error ("%qE is not a valid template argument for type %qT "
6496 "because it is not an object with linkage",
6501 /* DR 1155 allows internal linkage in C++11 and up. */
6502 linkage_kind linkage
= decl_linkage (expr
);
6503 if (linkage
< (cxx_dialect
>= cxx11
? lk_internal
: lk_external
))
6505 if (complain
& tf_error
)
6506 error ("%qE is not a valid template argument for type %qT "
6507 "because object %qD does not have linkage",
6512 expr
= build_nop (type
, build_address (expr
));
6514 /* [temp.arg.nontype]/5, bullet 4
6516 For a non-type template-parameter of type pointer to function, only
6517 the function-to-pointer conversion (_conv.func_) is applied. If the
6518 template-argument represents a set of overloaded functions (or a
6519 pointer to such), the matching function is selected from the set
6521 else if (TYPE_PTRFN_P (type
))
6523 /* If the argument is a template-id, we might not have enough
6524 context information to decay the pointer. */
6525 if (!type_unknown_p (expr_type
))
6527 expr
= decay_conversion (expr
, complain
);
6528 if (expr
== error_mark_node
)
6529 return error_mark_node
;
6532 if (cxx_dialect
>= cxx11
&& integer_zerop (expr
))
6533 /* Null pointer values are OK in C++11. */
6534 return perform_qualification_conversions (type
, expr
);
6536 expr
= convert_nontype_argument_function (type
, expr
, complain
);
6537 if (!expr
|| expr
== error_mark_node
)
6540 /* [temp.arg.nontype]/5, bullet 5
6542 For a non-type template-parameter of type reference to function, no
6543 conversions apply. If the template-argument represents a set of
6544 overloaded functions, the matching function is selected from the set
6546 else if (TYPE_REFFN_P (type
))
6548 if (TREE_CODE (expr
) == ADDR_EXPR
)
6550 if (complain
& tf_error
)
6552 error ("%qE is not a valid template argument for type %qT "
6553 "because it is a pointer", expr
, type
);
6554 inform (input_location
, "try using %qE instead",
6555 TREE_OPERAND (expr
, 0));
6560 expr
= convert_nontype_argument_function (type
, expr
, complain
);
6561 if (!expr
|| expr
== error_mark_node
)
6564 expr
= build_nop (type
, build_address (expr
));
6566 /* [temp.arg.nontype]/5, bullet 6
6568 For a non-type template-parameter of type pointer to member function,
6569 no conversions apply. If the template-argument represents a set of
6570 overloaded member functions, the matching member function is selected
6571 from the set (_over.over_). */
6572 else if (TYPE_PTRMEMFUNC_P (type
))
6574 expr
= instantiate_type (type
, expr
, tf_none
);
6575 if (expr
== error_mark_node
)
6576 return error_mark_node
;
6578 /* [temp.arg.nontype] bullet 1 says the pointer to member
6579 expression must be a pointer-to-member constant. */
6580 if (!check_valid_ptrmem_cst_expr (type
, expr
, complain
))
6581 return error_mark_node
;
6583 /* There is no way to disable standard conversions in
6584 resolve_address_of_overloaded_function (called by
6585 instantiate_type). It is possible that the call succeeded by
6586 converting &B::I to &D::I (where B is a base of D), so we need
6587 to reject this conversion here.
6589 Actually, even if there was a way to disable standard conversions,
6590 it would still be better to reject them here so that we can
6591 provide a superior diagnostic. */
6592 if (!same_type_p (TREE_TYPE (expr
), type
))
6594 if (complain
& tf_error
)
6596 error ("%qE is not a valid template argument for type %qT "
6597 "because it is of type %qT", expr
, type
,
6599 /* If we are just one standard conversion off, explain. */
6600 if (can_convert_standard (type
, TREE_TYPE (expr
), complain
))
6601 inform (input_location
,
6602 "standard conversions are not allowed in this context");
6607 /* [temp.arg.nontype]/5, bullet 7
6609 For a non-type template-parameter of type pointer to data member,
6610 qualification conversions (_conv.qual_) are applied. */
6611 else if (TYPE_PTRDATAMEM_P (type
))
6613 /* [temp.arg.nontype] bullet 1 says the pointer to member
6614 expression must be a pointer-to-member constant. */
6615 if (!check_valid_ptrmem_cst_expr (type
, expr
, complain
))
6616 return error_mark_node
;
6618 expr
= perform_qualification_conversions (type
, expr
);
6619 if (expr
== error_mark_node
)
6622 else if (NULLPTR_TYPE_P (type
))
6624 if (expr
!= nullptr_node
)
6626 if (complain
& tf_error
)
6627 error ("%qE is not a valid template argument for type %qT "
6628 "because it is of type %qT", expr
, type
, TREE_TYPE (expr
));
6633 /* A template non-type parameter must be one of the above. */
6637 /* Sanity check: did we actually convert the argument to the
6639 gcc_assert (same_type_ignoring_top_level_qualifiers_p
6640 (type
, TREE_TYPE (expr
)));
6641 return convert_from_reference (expr
);
6644 /* Subroutine of coerce_template_template_parms, which returns 1 if
6645 PARM_PARM and ARG_PARM match using the rule for the template
6646 parameters of template template parameters. Both PARM and ARG are
6647 template parameters; the rest of the arguments are the same as for
6648 coerce_template_template_parms.
6651 coerce_template_template_parm (tree parm
,
6653 tsubst_flags_t complain
,
6657 if (arg
== NULL_TREE
|| error_operand_p (arg
)
6658 || parm
== NULL_TREE
|| error_operand_p (parm
))
6661 if (TREE_CODE (arg
) != TREE_CODE (parm
))
6664 switch (TREE_CODE (parm
))
6667 /* We encounter instantiations of templates like
6668 template <template <template <class> class> class TT>
6671 tree parmparm
= DECL_INNERMOST_TEMPLATE_PARMS (parm
);
6672 tree argparm
= DECL_INNERMOST_TEMPLATE_PARMS (arg
);
6674 if (!coerce_template_template_parms
6675 (parmparm
, argparm
, complain
, in_decl
, outer_args
))
6681 if (TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (arg
))
6682 && !TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (parm
)))
6683 /* Argument is a parameter pack but parameter is not. */
6688 /* The tsubst call is used to handle cases such as
6690 template <int> class C {};
6691 template <class T, template <T> class TT> class D {};
6694 i.e. the parameter list of TT depends on earlier parameters. */
6695 if (!uses_template_parms (TREE_TYPE (arg
)))
6697 tree t
= tsubst (TREE_TYPE (parm
), outer_args
, complain
, in_decl
);
6698 if (!uses_template_parms (t
)
6699 && !same_type_p (t
, TREE_TYPE (arg
)))
6703 if (TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (arg
))
6704 && !TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm
)))
6705 /* Argument is a parameter pack but parameter is not. */
6718 /* Return 1 if PARM_PARMS and ARG_PARMS matches using rule for
6719 template template parameters. Both PARM_PARMS and ARG_PARMS are
6720 vectors of TREE_LIST nodes containing TYPE_DECL, TEMPLATE_DECL
6723 Consider the example:
6724 template <class T> class A;
6725 template<template <class U> class TT> class B;
6727 For B<A>, PARM_PARMS are the parameters to TT, while ARG_PARMS are
6728 the parameters to A, and OUTER_ARGS contains A. */
6731 coerce_template_template_parms (tree parm_parms
,
6733 tsubst_flags_t complain
,
6737 int nparms
, nargs
, i
;
6741 gcc_assert (TREE_CODE (parm_parms
) == TREE_VEC
);
6742 gcc_assert (TREE_CODE (arg_parms
) == TREE_VEC
);
6744 nparms
= TREE_VEC_LENGTH (parm_parms
);
6745 nargs
= TREE_VEC_LENGTH (arg_parms
);
6747 /* Determine whether we have a parameter pack at the end of the
6748 template template parameter's template parameter list. */
6749 if (TREE_VEC_ELT (parm_parms
, nparms
- 1) != error_mark_node
)
6751 parm
= TREE_VALUE (TREE_VEC_ELT (parm_parms
, nparms
- 1));
6753 if (error_operand_p (parm
))
6756 switch (TREE_CODE (parm
))
6760 if (TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (parm
)))
6765 if (TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm
)))
6775 && !(variadic_p
&& nargs
>= nparms
- 1))
6778 /* Check all of the template parameters except the parameter pack at
6779 the end (if any). */
6780 for (i
= 0; i
< nparms
- variadic_p
; ++i
)
6782 if (TREE_VEC_ELT (parm_parms
, i
) == error_mark_node
6783 || TREE_VEC_ELT (arg_parms
, i
) == error_mark_node
)
6786 parm
= TREE_VALUE (TREE_VEC_ELT (parm_parms
, i
));
6787 arg
= TREE_VALUE (TREE_VEC_ELT (arg_parms
, i
));
6789 if (!coerce_template_template_parm (parm
, arg
, complain
, in_decl
,
6797 /* Check each of the template parameters in the template
6798 argument against the template parameter pack at the end of
6799 the template template parameter. */
6800 if (TREE_VEC_ELT (parm_parms
, i
) == error_mark_node
)
6803 parm
= TREE_VALUE (TREE_VEC_ELT (parm_parms
, i
));
6805 for (; i
< nargs
; ++i
)
6807 if (TREE_VEC_ELT (arg_parms
, i
) == error_mark_node
)
6810 arg
= TREE_VALUE (TREE_VEC_ELT (arg_parms
, i
));
6812 if (!coerce_template_template_parm (parm
, arg
, complain
, in_decl
,
6821 /* Verifies that the deduced template arguments (in TARGS) for the
6822 template template parameters (in TPARMS) represent valid bindings,
6823 by comparing the template parameter list of each template argument
6824 to the template parameter list of its corresponding template
6825 template parameter, in accordance with DR150. This
6826 routine can only be called after all template arguments have been
6827 deduced. It will return TRUE if all of the template template
6828 parameter bindings are okay, FALSE otherwise. */
6830 template_template_parm_bindings_ok_p (tree tparms
, tree targs
)
6832 int i
, ntparms
= TREE_VEC_LENGTH (tparms
);
6835 /* We're dealing with template parms in this process. */
6836 ++processing_template_decl
;
6838 targs
= INNERMOST_TEMPLATE_ARGS (targs
);
6840 for (i
= 0; i
< ntparms
; ++i
)
6842 tree tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, i
));
6843 tree targ
= TREE_VEC_ELT (targs
, i
);
6845 if (TREE_CODE (tparm
) == TEMPLATE_DECL
&& targ
)
6847 tree packed_args
= NULL_TREE
;
6850 if (ARGUMENT_PACK_P (targ
))
6852 /* Look inside the argument pack. */
6853 packed_args
= ARGUMENT_PACK_ARGS (targ
);
6854 len
= TREE_VEC_LENGTH (packed_args
);
6857 for (idx
= 0; idx
< len
; ++idx
)
6859 tree targ_parms
= NULL_TREE
;
6862 /* Extract the next argument from the argument
6864 targ
= TREE_VEC_ELT (packed_args
, idx
);
6866 if (PACK_EXPANSION_P (targ
))
6867 /* Look at the pattern of the pack expansion. */
6868 targ
= PACK_EXPANSION_PATTERN (targ
);
6870 /* Extract the template parameters from the template
6872 if (TREE_CODE (targ
) == TEMPLATE_DECL
)
6873 targ_parms
= DECL_INNERMOST_TEMPLATE_PARMS (targ
);
6874 else if (TREE_CODE (targ
) == TEMPLATE_TEMPLATE_PARM
)
6875 targ_parms
= DECL_INNERMOST_TEMPLATE_PARMS (TYPE_NAME (targ
));
6877 /* Verify that we can coerce the template template
6878 parameters from the template argument to the template
6879 parameter. This requires an exact match. */
6881 && !coerce_template_template_parms
6882 (DECL_INNERMOST_TEMPLATE_PARMS (tparm
),
6897 --processing_template_decl
;
6901 /* Since type attributes aren't mangled, we need to strip them from
6902 template type arguments. */
6905 canonicalize_type_argument (tree arg
, tsubst_flags_t complain
)
6907 if (!arg
|| arg
== error_mark_node
|| arg
== TYPE_CANONICAL (arg
))
6909 bool removed_attributes
= false;
6910 tree canon
= strip_typedefs (arg
, &removed_attributes
);
6911 if (removed_attributes
6912 && (complain
& tf_warning
))
6913 warning (0, "ignoring attributes on template argument %qT", arg
);
6917 // A template declaration can be substituted for a constrained
6918 // template template parameter only when the argument is more
6919 // constrained than the parameter.
6921 is_compatible_template_arg (tree parm
, tree arg
)
6923 tree parm_cons
= get_constraints (parm
);
6925 /* For now, allow constrained template template arguments
6926 and unconstrained template template parameters. */
6927 if (parm_cons
== NULL_TREE
)
6930 tree arg_cons
= get_constraints (arg
);
6932 // If the template parameter is constrained, we need to rewrite its
6933 // constraints in terms of the ARG's template parameters. This ensures
6934 // that all of the template parameter types will have the same depth.
6936 // Note that this is only valid when coerce_template_template_parm is
6937 // true for the innermost template parameters of PARM and ARG. In other
6938 // words, because coercion is successful, this conversion will be valid.
6941 tree args
= template_parms_to_args (DECL_TEMPLATE_PARMS (arg
));
6942 parm_cons
= tsubst_constraint_info (parm_cons
,
6943 INNERMOST_TEMPLATE_ARGS (args
),
6944 tf_none
, NULL_TREE
);
6945 if (parm_cons
== error_mark_node
)
6949 return subsumes (parm_cons
, arg_cons
);
6952 // Convert a placeholder argument into a binding to the original
6953 // parameter. The original parameter is saved as the TREE_TYPE of
6956 convert_wildcard_argument (tree parm
, tree arg
)
6958 TREE_TYPE (arg
) = parm
;
6962 /* Convert the indicated template ARG as necessary to match the
6963 indicated template PARM. Returns the converted ARG, or
6964 error_mark_node if the conversion was unsuccessful. Error and
6965 warning messages are issued under control of COMPLAIN. This
6966 conversion is for the Ith parameter in the parameter list. ARGS is
6967 the full set of template arguments deduced so far. */
6970 convert_template_argument (tree parm
,
6973 tsubst_flags_t complain
,
6979 int is_type
, requires_type
, is_tmpl_type
, requires_tmpl_type
;
6981 if (parm
== error_mark_node
)
6982 return error_mark_node
;
6984 /* Trivially convert placeholders. */
6985 if (TREE_CODE (arg
) == WILDCARD_DECL
)
6986 return convert_wildcard_argument (parm
, arg
);
6988 if (TREE_CODE (arg
) == TREE_LIST
6989 && TREE_CODE (TREE_VALUE (arg
)) == OFFSET_REF
)
6991 /* The template argument was the name of some
6992 member function. That's usually
6993 invalid, but static members are OK. In any
6994 case, grab the underlying fields/functions
6995 and issue an error later if required. */
6996 orig_arg
= TREE_VALUE (arg
);
6997 TREE_TYPE (arg
) = unknown_type_node
;
7002 requires_tmpl_type
= TREE_CODE (parm
) == TEMPLATE_DECL
;
7003 requires_type
= (TREE_CODE (parm
) == TYPE_DECL
7004 || requires_tmpl_type
);
7006 /* When determining whether an argument pack expansion is a template,
7007 look at the pattern. */
7008 if (TREE_CODE (arg
) == TYPE_PACK_EXPANSION
)
7009 arg
= PACK_EXPANSION_PATTERN (arg
);
7011 /* Deal with an injected-class-name used as a template template arg. */
7012 if (requires_tmpl_type
&& CLASS_TYPE_P (arg
))
7014 tree t
= maybe_get_template_decl_from_type_decl (TYPE_NAME (arg
));
7015 if (TREE_CODE (t
) == TEMPLATE_DECL
)
7017 if (cxx_dialect
>= cxx11
)
7018 /* OK under DR 1004. */;
7019 else if (complain
& tf_warning_or_error
)
7020 pedwarn (input_location
, OPT_Wpedantic
, "injected-class-name %qD"
7021 " used as template template argument", TYPE_NAME (arg
));
7022 else if (flag_pedantic_errors
)
7030 ((TREE_CODE (arg
) == TEMPLATE_DECL
7031 && TREE_CODE (DECL_TEMPLATE_RESULT (arg
)) == TYPE_DECL
)
7032 || (requires_tmpl_type
&& TREE_CODE (arg
) == TYPE_ARGUMENT_PACK
)
7033 || TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
7034 || TREE_CODE (arg
) == UNBOUND_CLASS_TEMPLATE
);
7037 && (TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
7038 || TREE_CODE (arg
) == UNBOUND_CLASS_TEMPLATE
))
7039 arg
= TYPE_STUB_DECL (arg
);
7041 is_type
= TYPE_P (arg
) || is_tmpl_type
;
7043 if (requires_type
&& ! is_type
&& TREE_CODE (arg
) == SCOPE_REF
7044 && TREE_CODE (TREE_OPERAND (arg
, 0)) == TEMPLATE_TYPE_PARM
)
7046 if (TREE_CODE (TREE_OPERAND (arg
, 1)) == BIT_NOT_EXPR
)
7048 if (complain
& tf_error
)
7049 error ("invalid use of destructor %qE as a type", orig_arg
);
7050 return error_mark_node
;
7053 permerror (input_location
,
7054 "to refer to a type member of a template parameter, "
7055 "use %<typename %E%>", orig_arg
);
7057 orig_arg
= make_typename_type (TREE_OPERAND (arg
, 0),
7058 TREE_OPERAND (arg
, 1),
7064 if (is_type
!= requires_type
)
7068 if (complain
& tf_error
)
7070 error ("type/value mismatch at argument %d in template "
7071 "parameter list for %qD",
7074 inform (input_location
,
7075 " expected a constant of type %qT, got %qT",
7077 (DECL_P (arg
) ? DECL_NAME (arg
) : orig_arg
));
7078 else if (requires_tmpl_type
)
7079 inform (input_location
,
7080 " expected a class template, got %qE", orig_arg
);
7082 inform (input_location
,
7083 " expected a type, got %qE", orig_arg
);
7086 return error_mark_node
;
7088 if (is_tmpl_type
^ requires_tmpl_type
)
7090 if (in_decl
&& (complain
& tf_error
))
7092 error ("type/value mismatch at argument %d in template "
7093 "parameter list for %qD",
7096 inform (input_location
,
7097 " expected a type, got %qT", DECL_NAME (arg
));
7099 inform (input_location
,
7100 " expected a class template, got %qT", orig_arg
);
7102 return error_mark_node
;
7107 if (requires_tmpl_type
)
7109 if (template_parameter_pack_p (parm
) && ARGUMENT_PACK_P (orig_arg
))
7111 else if (TREE_CODE (TREE_TYPE (arg
)) == UNBOUND_CLASS_TEMPLATE
)
7112 /* The number of argument required is not known yet.
7113 Just accept it for now. */
7114 val
= TREE_TYPE (arg
);
7117 tree parmparm
= DECL_INNERMOST_TEMPLATE_PARMS (parm
);
7120 /* Strip alias templates that are equivalent to another
7122 arg
= get_underlying_template (arg
);
7123 argparm
= DECL_INNERMOST_TEMPLATE_PARMS (arg
);
7125 if (coerce_template_template_parms (parmparm
, argparm
,
7131 /* TEMPLATE_TEMPLATE_PARM node is preferred over
7133 if (val
!= error_mark_node
)
7135 if (DECL_TEMPLATE_TEMPLATE_PARM_P (val
))
7136 val
= TREE_TYPE (val
);
7137 if (TREE_CODE (orig_arg
) == TYPE_PACK_EXPANSION
)
7138 val
= make_pack_expansion (val
);
7143 if (in_decl
&& (complain
& tf_error
))
7145 error ("type/value mismatch at argument %d in "
7146 "template parameter list for %qD",
7148 inform (input_location
,
7149 " expected a template of type %qD, got %qT",
7153 val
= error_mark_node
;
7156 // Check that the constraints are compatible before allowing the
7158 if (val
!= error_mark_node
)
7159 if (!is_compatible_template_arg (parm
, arg
))
7161 if (in_decl
&& (complain
& tf_error
))
7163 error ("constraint mismatch at argument %d in "
7164 "template parameter list for %qD",
7166 inform (input_location
, " expected %qD but got %qD",
7169 val
= error_mark_node
;
7175 /* We only form one instance of each template specialization.
7176 Therefore, if we use a non-canonical variant (i.e., a
7177 typedef), any future messages referring to the type will use
7178 the typedef, which is confusing if those future uses do not
7179 themselves also use the typedef. */
7181 val
= canonicalize_type_argument (val
, complain
);
7185 tree t
= tsubst (TREE_TYPE (parm
), args
, complain
, in_decl
);
7187 if (invalid_nontype_parm_type_p (t
, complain
))
7188 return error_mark_node
;
7190 if (template_parameter_pack_p (parm
) && ARGUMENT_PACK_P (orig_arg
))
7192 if (same_type_p (t
, TREE_TYPE (orig_arg
)))
7196 /* Not sure if this is reachable, but it doesn't hurt
7198 error ("type mismatch in nontype parameter pack");
7199 val
= error_mark_node
;
7202 else if (!dependent_template_arg_p (orig_arg
)
7203 && !uses_template_parms (t
))
7204 /* We used to call digest_init here. However, digest_init
7205 will report errors, which we don't want when complain
7206 is zero. More importantly, digest_init will try too
7207 hard to convert things: for example, `0' should not be
7208 converted to pointer type at this point according to
7209 the standard. Accepting this is not merely an
7210 extension, since deciding whether or not these
7211 conversions can occur is part of determining which
7212 function template to call, or whether a given explicit
7213 argument specification is valid. */
7214 val
= convert_nontype_argument (t
, orig_arg
, complain
);
7217 bool removed_attr
= false;
7218 val
= strip_typedefs_expr (orig_arg
, &removed_attr
);
7221 if (val
== NULL_TREE
)
7222 val
= error_mark_node
;
7223 else if (val
== error_mark_node
&& (complain
& tf_error
))
7224 error ("could not convert template argument %qE to %qT", orig_arg
, t
);
7226 if (INDIRECT_REF_P (val
))
7228 /* Reject template arguments that are references to built-in
7229 functions with no library fallbacks. */
7230 const_tree inner
= TREE_OPERAND (val
, 0);
7231 if (TREE_CODE (TREE_TYPE (inner
)) == REFERENCE_TYPE
7232 && TREE_CODE (TREE_TYPE (TREE_TYPE (inner
))) == FUNCTION_TYPE
7233 && TREE_CODE (TREE_TYPE (inner
)) == REFERENCE_TYPE
7234 && reject_gcc_builtin (TREE_OPERAND (inner
, 0)))
7235 return error_mark_node
;
7238 if (TREE_CODE (val
) == SCOPE_REF
)
7240 /* Strip typedefs from the SCOPE_REF. */
7241 tree type
= canonicalize_type_argument (TREE_TYPE (val
), complain
);
7242 tree scope
= canonicalize_type_argument (TREE_OPERAND (val
, 0),
7244 val
= build_qualified_name (type
, scope
, TREE_OPERAND (val
, 1),
7245 QUALIFIED_NAME_IS_TEMPLATE (val
));
7252 /* Coerces the remaining template arguments in INNER_ARGS (from
7253 ARG_IDX to the end) into the parameter pack at PARM_IDX in PARMS.
7254 Returns the coerced argument pack. PARM_IDX is the position of this
7255 parameter in the template parameter list. ARGS is the original
7256 template argument list. */
7258 coerce_template_parameter_pack (tree parms
,
7266 tsubst_flags_t complain
)
7268 tree parm
= TREE_VEC_ELT (parms
, parm_idx
);
7269 int nargs
= inner_args
? NUM_TMPL_ARGS (inner_args
) : 0;
7272 tree packed_parms
= NULL_TREE
;
7274 if (arg_idx
> nargs
)
7277 if (tree packs
= fixed_parameter_pack_p (TREE_VALUE (parm
)))
7279 /* When the template parameter is a non-type template parameter pack
7280 or template template parameter pack whose type or template
7281 parameters use parameter packs, we know exactly how many arguments
7282 we are looking for. Build a vector of the instantiated decls for
7283 these template parameters in PACKED_PARMS. */
7284 /* We can't use make_pack_expansion here because it would interpret a
7285 _DECL as a use rather than a declaration. */
7286 tree decl
= TREE_VALUE (parm
);
7287 tree exp
= cxx_make_type (TYPE_PACK_EXPANSION
);
7288 SET_PACK_EXPANSION_PATTERN (exp
, decl
);
7289 PACK_EXPANSION_PARAMETER_PACKS (exp
) = packs
;
7290 SET_TYPE_STRUCTURAL_EQUALITY (exp
);
7292 TREE_VEC_LENGTH (args
)--;
7293 packed_parms
= tsubst_pack_expansion (exp
, args
, complain
, decl
);
7294 TREE_VEC_LENGTH (args
)++;
7296 if (packed_parms
== error_mark_node
)
7297 return error_mark_node
;
7299 /* If we're doing a partial instantiation of a member template,
7300 verify that all of the types used for the non-type
7301 template parameter pack are, in fact, valid for non-type
7302 template parameters. */
7304 && PACK_EXPANSION_P (TREE_VEC_ELT (inner_args
, arg_idx
)))
7306 int j
, len
= TREE_VEC_LENGTH (packed_parms
);
7307 for (j
= 0; j
< len
; ++j
)
7309 tree t
= TREE_TYPE (TREE_VEC_ELT (packed_parms
, j
));
7310 if (invalid_nontype_parm_type_p (t
, complain
))
7311 return error_mark_node
;
7313 /* We don't know how many args we have yet, just
7314 use the unconverted ones for now. */
7318 packed_args
= make_tree_vec (TREE_VEC_LENGTH (packed_parms
));
7320 /* Check if we have a placeholder pack, which indicates we're
7321 in the context of a introduction list. In that case we want
7322 to match this pack to the single placeholder. */
7323 else if (arg_idx
< nargs
7324 && TREE_CODE (TREE_VEC_ELT (inner_args
, arg_idx
)) == WILDCARD_DECL
7325 && WILDCARD_PACK_P (TREE_VEC_ELT (inner_args
, arg_idx
)))
7327 nargs
= arg_idx
+ 1;
7328 packed_args
= make_tree_vec (1);
7331 packed_args
= make_tree_vec (nargs
- arg_idx
);
7333 /* Convert the remaining arguments, which will be a part of the
7334 parameter pack "parm". */
7335 for (; arg_idx
< nargs
; ++arg_idx
)
7337 tree arg
= TREE_VEC_ELT (inner_args
, arg_idx
);
7338 tree actual_parm
= TREE_VALUE (parm
);
7339 int pack_idx
= arg_idx
- parm_idx
;
7343 /* Once we've packed as many args as we have types, stop. */
7344 if (pack_idx
>= TREE_VEC_LENGTH (packed_parms
))
7346 else if (PACK_EXPANSION_P (arg
))
7347 /* We don't know how many args we have yet, just
7348 use the unconverted ones for now. */
7351 actual_parm
= TREE_VEC_ELT (packed_parms
, pack_idx
);
7354 if (arg
== error_mark_node
)
7356 if (complain
& tf_error
)
7357 error ("template argument %d is invalid", arg_idx
+ 1);
7360 arg
= convert_template_argument (actual_parm
,
7361 arg
, new_args
, complain
, parm_idx
,
7363 if (arg
== error_mark_node
)
7365 TREE_VEC_ELT (packed_args
, pack_idx
) = arg
;
7368 if (arg_idx
- parm_idx
< TREE_VEC_LENGTH (packed_args
)
7369 && TREE_VEC_LENGTH (packed_args
) > 0)
7371 if (complain
& tf_error
)
7372 error ("wrong number of template arguments (%d, should be %d)",
7373 arg_idx
- parm_idx
, TREE_VEC_LENGTH (packed_args
));
7374 return error_mark_node
;
7377 if (TREE_CODE (TREE_VALUE (parm
)) == TYPE_DECL
7378 || TREE_CODE (TREE_VALUE (parm
)) == TEMPLATE_DECL
)
7379 argument_pack
= cxx_make_type (TYPE_ARGUMENT_PACK
);
7382 argument_pack
= make_node (NONTYPE_ARGUMENT_PACK
);
7383 TREE_TYPE (argument_pack
)
7384 = tsubst (TREE_TYPE (TREE_VALUE (parm
)), new_args
, complain
, in_decl
);
7385 TREE_CONSTANT (argument_pack
) = 1;
7388 SET_ARGUMENT_PACK_ARGS (argument_pack
, packed_args
);
7389 #ifdef ENABLE_CHECKING
7390 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (packed_args
,
7391 TREE_VEC_LENGTH (packed_args
));
7393 return argument_pack
;
7396 /* Returns the number of pack expansions in the template argument vector
7400 pack_expansion_args_count (tree args
)
7405 for (i
= 0; i
< TREE_VEC_LENGTH (args
); ++i
)
7407 tree elt
= TREE_VEC_ELT (args
, i
);
7408 if (elt
&& PACK_EXPANSION_P (elt
))
7414 /* Convert all template arguments to their appropriate types, and
7415 return a vector containing the innermost resulting template
7416 arguments. If any error occurs, return error_mark_node. Error and
7417 warning messages are issued under control of COMPLAIN.
7419 If REQUIRE_ALL_ARGS is false, argument deduction will be performed
7420 for arguments not specified in ARGS. Otherwise, if
7421 USE_DEFAULT_ARGS is true, default arguments will be used to fill in
7422 unspecified arguments. If REQUIRE_ALL_ARGS is true, but
7423 USE_DEFAULT_ARGS is false, then all arguments must be specified in
7427 coerce_template_parms (tree parms
,
7430 tsubst_flags_t complain
,
7431 bool require_all_args
,
7432 bool use_default_args
)
7434 int nparms
, nargs
, parm_idx
, arg_idx
, lost
= 0;
7435 tree orig_inner_args
;
7438 tree new_inner_args
;
7439 int saved_unevaluated_operand
;
7440 int saved_inhibit_evaluation_warnings
;
7442 /* When used as a boolean value, indicates whether this is a
7443 variadic template parameter list. Since it's an int, we can also
7444 subtract it from nparms to get the number of non-variadic
7447 int variadic_args_p
= 0;
7448 int post_variadic_parms
= 0;
7450 /* Likewise for parameters with default arguments. */
7453 if (args
== error_mark_node
)
7454 return error_mark_node
;
7456 nparms
= TREE_VEC_LENGTH (parms
);
7458 /* Determine if there are any parameter packs or default arguments. */
7459 for (parm_idx
= 0; parm_idx
< nparms
; ++parm_idx
)
7461 tree parm
= TREE_VEC_ELT (parms
, parm_idx
);
7463 ++post_variadic_parms
;
7464 if (template_parameter_pack_p (TREE_VALUE (parm
)))
7466 if (TREE_PURPOSE (parm
))
7470 inner_args
= orig_inner_args
= INNERMOST_TEMPLATE_ARGS (args
);
7471 /* If there are no parameters that follow a parameter pack, we need to
7472 expand any argument packs so that we can deduce a parameter pack from
7473 some non-packed args followed by an argument pack, as in variadic85.C.
7474 If there are such parameters, we need to leave argument packs intact
7475 so the arguments are assigned properly. This can happen when dealing
7476 with a nested class inside a partial specialization of a class
7477 template, as in variadic92.C, or when deducing a template parameter pack
7478 from a sub-declarator, as in variadic114.C. */
7479 if (!post_variadic_parms
)
7480 inner_args
= expand_template_argument_pack (inner_args
);
7482 /* Count any pack expansion args. */
7483 variadic_args_p
= pack_expansion_args_count (inner_args
);
7485 nargs
= inner_args
? NUM_TMPL_ARGS (inner_args
) : 0;
7486 if ((nargs
> nparms
&& !variadic_p
)
7487 || (nargs
< nparms
- variadic_p
7490 && (!use_default_args
7491 || (TREE_VEC_ELT (parms
, nargs
) != error_mark_node
7492 && !TREE_PURPOSE (TREE_VEC_ELT (parms
, nargs
))))))
7494 if (complain
& tf_error
)
7496 if (variadic_p
|| default_p
)
7498 nparms
-= variadic_p
+ default_p
;
7499 error ("wrong number of template arguments "
7500 "(%d, should be at least %d)", nargs
, nparms
);
7503 error ("wrong number of template arguments "
7504 "(%d, should be %d)", nargs
, nparms
);
7507 inform (DECL_SOURCE_LOCATION (in_decl
),
7508 "provided for %qD", in_decl
);
7511 return error_mark_node
;
7513 /* We can't pass a pack expansion to a non-pack parameter of an alias
7514 template (DR 1430). */
7516 && (DECL_ALIAS_TEMPLATE_P (in_decl
)
7517 || concept_template_p (in_decl
))
7519 && nargs
- variadic_args_p
< nparms
- variadic_p
)
7521 if (complain
& tf_error
)
7523 for (int i
= 0; i
< TREE_VEC_LENGTH (inner_args
); ++i
)
7525 tree arg
= TREE_VEC_ELT (inner_args
, i
);
7526 tree parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
7528 if (PACK_EXPANSION_P (arg
)
7529 && !template_parameter_pack_p (parm
))
7531 if (DECL_ALIAS_TEMPLATE_P (in_decl
))
7532 error_at (location_of (arg
),
7533 "pack expansion argument for non-pack parameter "
7534 "%qD of alias template %qD", parm
, in_decl
);
7536 error_at (location_of (arg
),
7537 "pack expansion argument for non-pack parameter "
7538 "%qD of concept %qD", parm
, in_decl
);
7539 inform (DECL_SOURCE_LOCATION (parm
), "declared here");
7546 return error_mark_node
;
7549 /* We need to evaluate the template arguments, even though this
7550 template-id may be nested within a "sizeof". */
7551 saved_unevaluated_operand
= cp_unevaluated_operand
;
7552 cp_unevaluated_operand
= 0;
7553 saved_inhibit_evaluation_warnings
= c_inhibit_evaluation_warnings
;
7554 c_inhibit_evaluation_warnings
= 0;
7555 new_inner_args
= make_tree_vec (nparms
);
7556 new_args
= add_outermost_template_args (args
, new_inner_args
);
7557 int pack_adjust
= 0;
7558 for (parm_idx
= 0, arg_idx
= 0; parm_idx
< nparms
; parm_idx
++, arg_idx
++)
7563 /* Get the Ith template parameter. */
7564 parm
= TREE_VEC_ELT (parms
, parm_idx
);
7566 if (parm
== error_mark_node
)
7568 TREE_VEC_ELT (new_inner_args
, arg_idx
) = error_mark_node
;
7572 /* Calculate the next argument. */
7573 if (arg_idx
< nargs
)
7574 arg
= TREE_VEC_ELT (inner_args
, arg_idx
);
7578 if (template_parameter_pack_p (TREE_VALUE (parm
))
7579 && !(arg
&& ARGUMENT_PACK_P (arg
)))
7581 /* Some arguments will be placed in the
7582 template parameter pack PARM. */
7583 arg
= coerce_template_parameter_pack (parms
, parm_idx
, args
,
7584 inner_args
, arg_idx
,
7588 if (arg
== NULL_TREE
)
7590 /* We don't know how many args we have yet, just use the
7591 unconverted (and still packed) ones for now. */
7592 new_inner_args
= orig_inner_args
;
7597 TREE_VEC_ELT (new_inner_args
, parm_idx
) = arg
;
7599 /* Store this argument. */
7600 if (arg
== error_mark_node
)
7603 /* We are done with all of the arguments. */
7608 pack_adjust
= TREE_VEC_LENGTH (ARGUMENT_PACK_ARGS (arg
)) - 1;
7609 arg_idx
+= pack_adjust
;
7616 if (PACK_EXPANSION_P (arg
))
7618 /* "If every valid specialization of a variadic template
7619 requires an empty template parameter pack, the template is
7620 ill-formed, no diagnostic required." So check that the
7621 pattern works with this parameter. */
7622 tree pattern
= PACK_EXPANSION_PATTERN (arg
);
7623 tree conv
= convert_template_argument (TREE_VALUE (parm
),
7627 if (conv
== error_mark_node
)
7629 inform (input_location
, "so any instantiation with a "
7630 "non-empty parameter pack would be ill-formed");
7633 else if (TYPE_P (conv
) && !TYPE_P (pattern
))
7634 /* Recover from missing typename. */
7635 TREE_VEC_ELT (inner_args
, arg_idx
)
7636 = make_pack_expansion (conv
);
7638 /* We don't know how many args we have yet, just
7639 use the unconverted ones for now. */
7640 new_inner_args
= inner_args
;
7645 else if (require_all_args
)
7647 /* There must be a default arg in this case. */
7648 arg
= tsubst_template_arg (TREE_PURPOSE (parm
), new_args
,
7650 /* The position of the first default template argument,
7651 is also the number of non-defaulted arguments in NEW_INNER_ARGS.
7653 if (!NON_DEFAULT_TEMPLATE_ARGS_COUNT (new_inner_args
))
7654 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (new_inner_args
,
7655 arg_idx
- pack_adjust
);
7660 if (arg
== error_mark_node
)
7662 if (complain
& tf_error
)
7663 error ("template argument %d is invalid", arg_idx
+ 1);
7666 /* This only occurs if there was an error in the template
7667 parameter list itself (which we would already have
7668 reported) that we are trying to recover from, e.g., a class
7669 template with a parameter list such as
7670 template<typename..., typename>. */
7673 arg
= convert_template_argument (TREE_VALUE (parm
),
7674 arg
, new_args
, complain
,
7677 if (arg
== error_mark_node
)
7679 TREE_VEC_ELT (new_inner_args
, arg_idx
- pack_adjust
) = arg
;
7681 cp_unevaluated_operand
= saved_unevaluated_operand
;
7682 c_inhibit_evaluation_warnings
= saved_inhibit_evaluation_warnings
;
7684 if (variadic_p
&& arg_idx
< nargs
)
7686 if (complain
& tf_error
)
7688 error ("wrong number of template arguments "
7689 "(%d, should be %d)", nargs
, arg_idx
);
7691 error ("provided for %q+D", in_decl
);
7693 return error_mark_node
;
7697 return error_mark_node
;
7699 #ifdef ENABLE_CHECKING
7700 if (!NON_DEFAULT_TEMPLATE_ARGS_COUNT (new_inner_args
))
7701 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (new_inner_args
,
7702 TREE_VEC_LENGTH (new_inner_args
));
7705 return new_inner_args
;
7708 /* Convert all template arguments to their appropriate types, and
7709 return a vector containing the innermost resulting template
7710 arguments. If any error occurs, return error_mark_node. Error and
7711 warning messages are not issued.
7713 Note that no function argument deduction is performed, and default
7714 arguments are used to fill in unspecified arguments. */
7716 coerce_template_parms (tree parms
, tree args
, tree in_decl
)
7718 return coerce_template_parms (parms
, args
, in_decl
, tf_none
, true, true);
7721 /* Convert all template arguments to their appropriate type, and
7722 instantiate default arguments as needed. This returns a vector
7723 containing the innermost resulting template arguments, or
7724 error_mark_node if unsuccessful. */
7726 coerce_template_parms (tree parms
, tree args
, tree in_decl
,
7727 tsubst_flags_t complain
)
7729 return coerce_template_parms (parms
, args
, in_decl
, complain
, true, true);
7732 /* Like coerce_template_parms. If PARMS represents all template
7733 parameters levels, this function returns a vector of vectors
7734 representing all the resulting argument levels. Note that in this
7735 case, only the innermost arguments are coerced because the
7736 outermost ones are supposed to have been coerced already.
7738 Otherwise, if PARMS represents only (the innermost) vector of
7739 parameters, this function returns a vector containing just the
7740 innermost resulting arguments. */
7743 coerce_innermost_template_parms (tree parms
,
7746 tsubst_flags_t complain
,
7747 bool require_all_args
,
7748 bool use_default_args
)
7750 int parms_depth
= TMPL_PARMS_DEPTH (parms
);
7751 int args_depth
= TMPL_ARGS_DEPTH (args
);
7754 if (parms_depth
> 1)
7756 coerced_args
= make_tree_vec (parms_depth
);
7760 for (level
= parms
, cur_depth
= parms_depth
;
7761 parms_depth
> 0 && level
!= NULL_TREE
;
7762 level
= TREE_CHAIN (level
), --cur_depth
)
7765 if (cur_depth
== args_depth
)
7766 l
= coerce_template_parms (TREE_VALUE (level
),
7767 args
, in_decl
, complain
,
7771 l
= TMPL_ARGS_LEVEL (args
, cur_depth
);
7773 if (l
== error_mark_node
)
7774 return error_mark_node
;
7776 SET_TMPL_ARGS_LEVEL (coerced_args
, cur_depth
, l
);
7780 coerced_args
= coerce_template_parms (INNERMOST_TEMPLATE_PARMS (parms
),
7781 args
, in_decl
, complain
,
7784 return coerced_args
;
7787 /* Returns 1 if template args OT and NT are equivalent. */
7790 template_args_equal (tree ot
, tree nt
)
7794 if (nt
== NULL_TREE
|| ot
== NULL_TREE
)
7797 if (TREE_CODE (nt
) == TREE_VEC
)
7798 /* For member templates */
7799 return TREE_CODE (ot
) == TREE_VEC
&& comp_template_args (ot
, nt
);
7800 else if (PACK_EXPANSION_P (ot
))
7801 return (PACK_EXPANSION_P (nt
)
7802 && template_args_equal (PACK_EXPANSION_PATTERN (ot
),
7803 PACK_EXPANSION_PATTERN (nt
))
7804 && template_args_equal (PACK_EXPANSION_EXTRA_ARGS (ot
),
7805 PACK_EXPANSION_EXTRA_ARGS (nt
)));
7806 else if (ARGUMENT_PACK_P (ot
))
7811 if (!ARGUMENT_PACK_P (nt
))
7814 opack
= ARGUMENT_PACK_ARGS (ot
);
7815 npack
= ARGUMENT_PACK_ARGS (nt
);
7816 len
= TREE_VEC_LENGTH (opack
);
7817 if (TREE_VEC_LENGTH (npack
) != len
)
7819 for (i
= 0; i
< len
; ++i
)
7820 if (!template_args_equal (TREE_VEC_ELT (opack
, i
),
7821 TREE_VEC_ELT (npack
, i
)))
7825 else if (ot
&& TREE_CODE (ot
) == ARGUMENT_PACK_SELECT
)
7827 /* We get here probably because we are in the middle of substituting
7828 into the pattern of a pack expansion. In that case the
7829 ARGUMENT_PACK_SELECT temporarily replaces the pack argument we are
7830 interested in. So we want to use the initial pack argument for
7832 ot
= ARGUMENT_PACK_SELECT_FROM_PACK (ot
);
7833 if (nt
&& TREE_CODE (nt
) == ARGUMENT_PACK_SELECT
)
7834 nt
= ARGUMENT_PACK_SELECT_FROM_PACK (nt
);
7835 return template_args_equal (ot
, nt
);
7837 else if (TYPE_P (nt
))
7841 /* Don't treat an alias template specialization with dependent
7842 arguments as equivalent to its underlying type when used as a
7843 template argument; we need them to be distinct so that we
7844 substitute into the specialization arguments at instantiation
7845 time. And aliases can't be equivalent without being ==, so
7846 we don't need to look any deeper. */
7847 if (TYPE_ALIAS_P (nt
) || TYPE_ALIAS_P (ot
))
7850 return same_type_p (ot
, nt
);
7852 else if (TREE_CODE (ot
) == TREE_VEC
|| TYPE_P (ot
))
7856 /* Try to treat a template non-type argument that has been converted
7857 to the parameter type as equivalent to one that hasn't yet. */
7858 for (enum tree_code code1
= TREE_CODE (ot
);
7859 CONVERT_EXPR_CODE_P (code1
)
7860 || code1
== NON_LVALUE_EXPR
;
7861 code1
= TREE_CODE (ot
))
7862 ot
= TREE_OPERAND (ot
, 0);
7863 for (enum tree_code code2
= TREE_CODE (nt
);
7864 CONVERT_EXPR_CODE_P (code2
)
7865 || code2
== NON_LVALUE_EXPR
;
7866 code2
= TREE_CODE (nt
))
7867 nt
= TREE_OPERAND (nt
, 0);
7869 return cp_tree_equal (ot
, nt
);
7873 /* Returns 1 iff the OLDARGS and NEWARGS are in fact identical sets of
7874 template arguments. Returns 0 otherwise, and updates OLDARG_PTR and
7875 NEWARG_PTR with the offending arguments if they are non-NULL. */
7878 comp_template_args_with_info (tree oldargs
, tree newargs
,
7879 tree
*oldarg_ptr
, tree
*newarg_ptr
)
7883 if (oldargs
== newargs
)
7886 if (!oldargs
|| !newargs
)
7889 if (TREE_VEC_LENGTH (oldargs
) != TREE_VEC_LENGTH (newargs
))
7892 for (i
= 0; i
< TREE_VEC_LENGTH (oldargs
); ++i
)
7894 tree nt
= TREE_VEC_ELT (newargs
, i
);
7895 tree ot
= TREE_VEC_ELT (oldargs
, i
);
7897 if (! template_args_equal (ot
, nt
))
7899 if (oldarg_ptr
!= NULL
)
7901 if (newarg_ptr
!= NULL
)
7909 /* Returns 1 iff the OLDARGS and NEWARGS are in fact identical sets
7910 of template arguments. Returns 0 otherwise. */
7913 comp_template_args (tree oldargs
, tree newargs
)
7915 return comp_template_args_with_info (oldargs
, newargs
, NULL
, NULL
);
7919 add_pending_template (tree d
)
7921 tree ti
= (TYPE_P (d
)
7922 ? CLASSTYPE_TEMPLATE_INFO (d
)
7923 : DECL_TEMPLATE_INFO (d
));
7924 struct pending_template
*pt
;
7927 if (TI_PENDING_TEMPLATE_FLAG (ti
))
7930 /* We are called both from instantiate_decl, where we've already had a
7931 tinst_level pushed, and instantiate_template, where we haven't.
7933 level
= !current_tinst_level
|| current_tinst_level
->decl
!= d
;
7936 push_tinst_level (d
);
7938 pt
= ggc_alloc
<pending_template
> ();
7940 pt
->tinst
= current_tinst_level
;
7941 if (last_pending_template
)
7942 last_pending_template
->next
= pt
;
7944 pending_templates
= pt
;
7946 last_pending_template
= pt
;
7948 TI_PENDING_TEMPLATE_FLAG (ti
) = 1;
7955 /* Return a TEMPLATE_ID_EXPR corresponding to the indicated FNS and
7956 ARGLIST. Valid choices for FNS are given in the cp-tree.def
7957 documentation for TEMPLATE_ID_EXPR. */
7960 lookup_template_function (tree fns
, tree arglist
)
7964 if (fns
== error_mark_node
|| arglist
== error_mark_node
)
7965 return error_mark_node
;
7967 gcc_assert (!arglist
|| TREE_CODE (arglist
) == TREE_VEC
);
7969 if (!is_overloaded_fn (fns
) && !identifier_p (fns
))
7971 error ("%q#D is not a function template", fns
);
7972 return error_mark_node
;
7975 if (BASELINK_P (fns
))
7977 BASELINK_FUNCTIONS (fns
) = build2 (TEMPLATE_ID_EXPR
,
7979 BASELINK_FUNCTIONS (fns
),
7984 type
= TREE_TYPE (fns
);
7985 if (TREE_CODE (fns
) == OVERLOAD
|| !type
)
7986 type
= unknown_type_node
;
7988 return build2 (TEMPLATE_ID_EXPR
, type
, fns
, arglist
);
7991 /* Within the scope of a template class S<T>, the name S gets bound
7992 (in build_self_reference) to a TYPE_DECL for the class, not a
7993 TEMPLATE_DECL. If DECL is a TYPE_DECL for current_class_type,
7994 or one of its enclosing classes, and that type is a template,
7995 return the associated TEMPLATE_DECL. Otherwise, the original
7998 Also handle the case when DECL is a TREE_LIST of ambiguous
7999 injected-class-names from different bases. */
8002 maybe_get_template_decl_from_type_decl (tree decl
)
8004 if (decl
== NULL_TREE
)
8007 /* DR 176: A lookup that finds an injected-class-name (10.2
8008 [class.member.lookup]) can result in an ambiguity in certain cases
8009 (for example, if it is found in more than one base class). If all of
8010 the injected-class-names that are found refer to specializations of
8011 the same class template, and if the name is followed by a
8012 template-argument-list, the reference refers to the class template
8013 itself and not a specialization thereof, and is not ambiguous. */
8014 if (TREE_CODE (decl
) == TREE_LIST
)
8016 tree t
, tmpl
= NULL_TREE
;
8017 for (t
= decl
; t
; t
= TREE_CHAIN (t
))
8019 tree elt
= maybe_get_template_decl_from_type_decl (TREE_VALUE (t
));
8022 else if (tmpl
!= elt
)
8025 if (tmpl
&& t
== NULL_TREE
)
8031 return (decl
!= NULL_TREE
8032 && DECL_SELF_REFERENCE_P (decl
)
8033 && CLASSTYPE_TEMPLATE_INFO (TREE_TYPE (decl
)))
8034 ? CLASSTYPE_TI_TEMPLATE (TREE_TYPE (decl
)) : decl
;
8037 /* Given an IDENTIFIER_NODE (or type TEMPLATE_DECL) and a chain of
8038 parameters, find the desired type.
8040 D1 is the PTYPENAME terminal, and ARGLIST is the list of arguments.
8042 IN_DECL, if non-NULL, is the template declaration we are trying to
8045 If ENTERING_SCOPE is nonzero, we are about to enter the scope of
8046 the class we are looking up.
8048 Issue error and warning messages under control of COMPLAIN.
8050 If the template class is really a local class in a template
8051 function, then the FUNCTION_CONTEXT is the function in which it is
8054 ??? Note that this function is currently called *twice* for each
8055 template-id: the first time from the parser, while creating the
8056 incomplete type (finish_template_type), and the second type during the
8057 real instantiation (instantiate_template_class). This is surely something
8058 that we want to avoid. It also causes some problems with argument
8059 coercion (see convert_nontype_argument for more information on this). */
8062 lookup_template_class_1 (tree d1
, tree arglist
, tree in_decl
, tree context
,
8063 int entering_scope
, tsubst_flags_t complain
)
8065 tree templ
= NULL_TREE
, parmlist
;
8072 if (identifier_p (d1
))
8074 tree value
= innermost_non_namespace_value (d1
);
8075 if (value
&& DECL_TEMPLATE_TEMPLATE_PARM_P (value
))
8080 push_decl_namespace (context
);
8081 templ
= lookup_name (d1
);
8082 templ
= maybe_get_template_decl_from_type_decl (templ
);
8084 pop_decl_namespace ();
8087 context
= DECL_CONTEXT (templ
);
8089 else if (TREE_CODE (d1
) == TYPE_DECL
&& MAYBE_CLASS_TYPE_P (TREE_TYPE (d1
)))
8091 tree type
= TREE_TYPE (d1
);
8093 /* If we are declaring a constructor, say A<T>::A<T>, we will get
8094 an implicit typename for the second A. Deal with it. */
8095 if (TREE_CODE (type
) == TYPENAME_TYPE
&& TREE_TYPE (type
))
8096 type
= TREE_TYPE (type
);
8098 if (CLASSTYPE_TEMPLATE_INFO (type
))
8100 templ
= CLASSTYPE_TI_TEMPLATE (type
);
8101 d1
= DECL_NAME (templ
);
8104 else if (TREE_CODE (d1
) == ENUMERAL_TYPE
8105 || (TYPE_P (d1
) && MAYBE_CLASS_TYPE_P (d1
)))
8107 templ
= TYPE_TI_TEMPLATE (d1
);
8108 d1
= DECL_NAME (templ
);
8110 else if (DECL_TYPE_TEMPLATE_P (d1
))
8113 d1
= DECL_NAME (templ
);
8114 context
= DECL_CONTEXT (templ
);
8116 else if (DECL_TEMPLATE_TEMPLATE_PARM_P (d1
))
8119 d1
= DECL_NAME (templ
);
8122 /* Issue an error message if we didn't find a template. */
8125 if (complain
& tf_error
)
8126 error ("%qT is not a template", d1
);
8127 return error_mark_node
;
8130 if (TREE_CODE (templ
) != TEMPLATE_DECL
8131 /* Make sure it's a user visible template, if it was named by
8133 || ((complain
& tf_user
) && !DECL_TEMPLATE_PARM_P (templ
)
8134 && !PRIMARY_TEMPLATE_P (templ
)))
8136 if (complain
& tf_error
)
8138 error ("non-template type %qT used as a template", d1
);
8140 error ("for template declaration %q+D", in_decl
);
8142 return error_mark_node
;
8145 complain
&= ~tf_user
;
8147 /* An alias that just changes the name of a template is equivalent to the
8148 other template, so if any of the arguments are pack expansions, strip
8149 the alias to avoid problems with a pack expansion passed to a non-pack
8150 alias template parameter (DR 1430). */
8151 if (pack_expansion_args_count (INNERMOST_TEMPLATE_ARGS (arglist
)))
8152 templ
= get_underlying_template (templ
);
8154 if (DECL_TEMPLATE_TEMPLATE_PARM_P (templ
))
8156 /* Create a new TEMPLATE_DECL and TEMPLATE_TEMPLATE_PARM node to store
8157 template arguments */
8163 parmlist
= DECL_INNERMOST_TEMPLATE_PARMS (templ
);
8165 /* Consider an example where a template template parameter declared as
8167 template <class T, class U = std::allocator<T> > class TT
8169 The template parameter level of T and U are one level larger than
8170 of TT. To proper process the default argument of U, say when an
8171 instantiation `TT<int>' is seen, we need to build the full
8172 arguments containing {int} as the innermost level. Outer levels,
8173 available when not appearing as default template argument, can be
8174 obtained from the arguments of the enclosing template.
8176 Suppose that TT is later substituted with std::vector. The above
8177 instantiation is `TT<int, std::allocator<T> >' with TT at
8178 level 1, and T at level 2, while the template arguments at level 1
8179 becomes {std::vector} and the inner level 2 is {int}. */
8181 outer
= DECL_CONTEXT (templ
);
8183 outer
= TI_ARGS (get_template_info (DECL_TEMPLATE_RESULT (outer
)));
8184 else if (current_template_parms
)
8186 /* This is an argument of the current template, so we haven't set
8187 DECL_CONTEXT yet. */
8188 tree relevant_template_parms
;
8190 /* Parameter levels that are greater than the level of the given
8191 template template parm are irrelevant. */
8192 relevant_template_parms
= current_template_parms
;
8193 while (TMPL_PARMS_DEPTH (relevant_template_parms
)
8194 != TEMPLATE_TYPE_LEVEL (TREE_TYPE (templ
)))
8195 relevant_template_parms
= TREE_CHAIN (relevant_template_parms
);
8197 outer
= template_parms_to_args (relevant_template_parms
);
8201 arglist
= add_to_template_args (outer
, arglist
);
8203 arglist2
= coerce_template_parms (parmlist
, arglist
, templ
,
8205 /*require_all_args=*/true,
8206 /*use_default_args=*/true);
8207 if (arglist2
== error_mark_node
8208 || (!uses_template_parms (arglist2
)
8209 && check_instantiated_args (templ
, arglist2
, complain
)))
8210 return error_mark_node
;
8212 parm
= bind_template_template_parm (TREE_TYPE (templ
), arglist2
);
8217 tree template_type
= TREE_TYPE (templ
);
8220 tree found
= NULL_TREE
;
8223 int is_dependent_type
;
8224 int use_partial_inst_tmpl
= false;
8226 if (template_type
== error_mark_node
)
8227 /* An error occurred while building the template TEMPL, and a
8228 diagnostic has most certainly been emitted for that
8229 already. Let's propagate that error. */
8230 return error_mark_node
;
8232 gen_tmpl
= most_general_template (templ
);
8233 parmlist
= DECL_TEMPLATE_PARMS (gen_tmpl
);
8234 parm_depth
= TMPL_PARMS_DEPTH (parmlist
);
8235 arg_depth
= TMPL_ARGS_DEPTH (arglist
);
8237 if (arg_depth
== 1 && parm_depth
> 1)
8239 /* We've been given an incomplete set of template arguments.
8242 template <class T> struct S1 {
8243 template <class U> struct S2 {};
8244 template <class U> struct S2<U*> {};
8247 we will be called with an ARGLIST of `U*', but the
8248 TEMPLATE will be `template <class T> template
8249 <class U> struct S1<T>::S2'. We must fill in the missing
8252 = add_outermost_template_args (TYPE_TI_ARGS (TREE_TYPE (templ
)),
8254 arg_depth
= TMPL_ARGS_DEPTH (arglist
);
8257 /* Now we should have enough arguments. */
8258 gcc_assert (parm_depth
== arg_depth
);
8260 /* From here on, we're only interested in the most general
8263 /* Calculate the BOUND_ARGS. These will be the args that are
8264 actually tsubst'd into the definition to create the
8266 arglist
= coerce_innermost_template_parms (parmlist
, arglist
, gen_tmpl
,
8268 /*require_all_args=*/true,
8269 /*use_default_args=*/true);
8271 if (arglist
== error_mark_node
)
8272 /* We were unable to bind the arguments. */
8273 return error_mark_node
;
8275 /* In the scope of a template class, explicit references to the
8276 template class refer to the type of the template, not any
8277 instantiation of it. For example, in:
8279 template <class T> class C { void f(C<T>); }
8281 the `C<T>' is just the same as `C'. Outside of the
8282 class, however, such a reference is an instantiation. */
8284 || !PRIMARY_TEMPLATE_P (gen_tmpl
)
8285 || currently_open_class (template_type
))
8286 /* comp_template_args is expensive, check it last. */
8287 && comp_template_args (TYPE_TI_ARGS (template_type
),
8289 return template_type
;
8291 /* If we already have this specialization, return it. */
8292 elt
.tmpl
= gen_tmpl
;
8294 elt
.spec
= NULL_TREE
;
8295 hash
= spec_hasher::hash (&elt
);
8296 entry
= type_specializations
->find_with_hash (&elt
, hash
);
8301 /* If the the template's constraints are not satisfied,
8302 then we cannot form a valid type.
8304 Note that the check is deferred until after the hash
8305 lookup. This prevents redundant checks on previously
8306 instantiated specializations. */
8307 if (flag_concepts
&& !constraints_satisfied_p (gen_tmpl
, arglist
))
8309 if (complain
& tf_error
)
8311 error ("template constraint failure");
8312 diagnose_constraints (input_location
, gen_tmpl
, arglist
);
8314 return error_mark_node
;
8317 is_dependent_type
= uses_template_parms (arglist
);
8319 /* If the deduced arguments are invalid, then the binding
8321 if (!is_dependent_type
8322 && check_instantiated_args (gen_tmpl
,
8323 INNERMOST_TEMPLATE_ARGS (arglist
),
8325 return error_mark_node
;
8327 if (!is_dependent_type
8328 && !PRIMARY_TEMPLATE_P (gen_tmpl
)
8329 && !LAMBDA_TYPE_P (TREE_TYPE (gen_tmpl
))
8330 && TREE_CODE (CP_DECL_CONTEXT (gen_tmpl
)) == NAMESPACE_DECL
)
8332 found
= xref_tag_from_type (TREE_TYPE (gen_tmpl
),
8333 DECL_NAME (gen_tmpl
),
8334 /*tag_scope=*/ts_global
);
8338 context
= tsubst (DECL_CONTEXT (gen_tmpl
), arglist
,
8340 if (context
== error_mark_node
)
8341 return error_mark_node
;
8344 context
= global_namespace
;
8346 /* Create the type. */
8347 if (DECL_ALIAS_TEMPLATE_P (gen_tmpl
))
8349 /* The user referred to a specialization of an alias
8350 template represented by GEN_TMPL.
8352 [temp.alias]/2 says:
8354 When a template-id refers to the specialization of an
8355 alias template, it is equivalent to the associated
8356 type obtained by substitution of its
8357 template-arguments for the template-parameters in the
8358 type-id of the alias template. */
8360 t
= tsubst (TREE_TYPE (gen_tmpl
), arglist
, complain
, in_decl
);
8361 /* Note that the call above (by indirectly calling
8362 register_specialization in tsubst_decl) registers the
8363 TYPE_DECL representing the specialization of the alias
8364 template. So next time someone substitutes ARGLIST for
8365 the template parms into the alias template (GEN_TMPL),
8366 she'll get that TYPE_DECL back. */
8368 if (t
== error_mark_node
)
8371 else if (TREE_CODE (template_type
) == ENUMERAL_TYPE
)
8373 if (!is_dependent_type
)
8375 set_current_access_from_decl (TYPE_NAME (template_type
));
8376 t
= start_enum (TYPE_IDENTIFIER (template_type
), NULL_TREE
,
8377 tsubst (ENUM_UNDERLYING_TYPE (template_type
),
8378 arglist
, complain
, in_decl
),
8379 SCOPED_ENUM_P (template_type
), NULL
);
8381 if (t
== error_mark_node
)
8386 /* We don't want to call start_enum for this type, since
8387 the values for the enumeration constants may involve
8388 template parameters. And, no one should be interested
8389 in the enumeration constants for such a type. */
8390 t
= cxx_make_type (ENUMERAL_TYPE
);
8391 SET_SCOPED_ENUM_P (t
, SCOPED_ENUM_P (template_type
));
8393 SET_OPAQUE_ENUM_P (t
, OPAQUE_ENUM_P (template_type
));
8394 ENUM_FIXED_UNDERLYING_TYPE_P (t
)
8395 = ENUM_FIXED_UNDERLYING_TYPE_P (template_type
);
8397 else if (CLASS_TYPE_P (template_type
))
8399 t
= make_class_type (TREE_CODE (template_type
));
8400 CLASSTYPE_DECLARED_CLASS (t
)
8401 = CLASSTYPE_DECLARED_CLASS (template_type
);
8402 SET_CLASSTYPE_IMPLICIT_INSTANTIATION (t
);
8403 TYPE_FOR_JAVA (t
) = TYPE_FOR_JAVA (template_type
);
8405 /* A local class. Make sure the decl gets registered properly. */
8406 if (context
== current_function_decl
)
8407 pushtag (DECL_NAME (gen_tmpl
), t
, /*tag_scope=*/ts_current
);
8409 if (comp_template_args (CLASSTYPE_TI_ARGS (template_type
), arglist
))
8410 /* This instantiation is another name for the primary
8411 template type. Set the TYPE_CANONICAL field
8413 TYPE_CANONICAL (t
) = template_type
;
8414 else if (any_template_arguments_need_structural_equality_p (arglist
))
8415 /* Some of the template arguments require structural
8416 equality testing, so this template class requires
8417 structural equality testing. */
8418 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8423 /* If we called start_enum or pushtag above, this information
8424 will already be set up. */
8427 TYPE_CONTEXT (t
) = FROB_CONTEXT (context
);
8429 type_decl
= create_implicit_typedef (DECL_NAME (gen_tmpl
), t
);
8430 DECL_CONTEXT (type_decl
) = TYPE_CONTEXT (t
);
8431 DECL_SOURCE_LOCATION (type_decl
)
8432 = DECL_SOURCE_LOCATION (TYPE_STUB_DECL (template_type
));
8435 type_decl
= TYPE_NAME (t
);
8437 if (CLASS_TYPE_P (template_type
))
8439 TREE_PRIVATE (type_decl
)
8440 = TREE_PRIVATE (TYPE_MAIN_DECL (template_type
));
8441 TREE_PROTECTED (type_decl
)
8442 = TREE_PROTECTED (TYPE_MAIN_DECL (template_type
));
8443 if (CLASSTYPE_VISIBILITY_SPECIFIED (template_type
))
8445 DECL_VISIBILITY_SPECIFIED (type_decl
) = 1;
8446 DECL_VISIBILITY (type_decl
) = CLASSTYPE_VISIBILITY (template_type
);
8450 if (OVERLOAD_TYPE_P (t
)
8451 && !DECL_ALIAS_TEMPLATE_P (gen_tmpl
))
8453 static const char *tags
[] = {"abi_tag", "may_alias"};
8455 for (unsigned ix
= 0; ix
!= 2; ix
++)
8458 = lookup_attribute (tags
[ix
], TYPE_ATTRIBUTES (template_type
));
8462 else if (!TREE_CHAIN (attributes
) && !TYPE_ATTRIBUTES (t
))
8463 TYPE_ATTRIBUTES (t
) = attributes
;
8466 = tree_cons (TREE_PURPOSE (attributes
),
8467 TREE_VALUE (attributes
),
8468 TYPE_ATTRIBUTES (t
));
8472 /* Let's consider the explicit specialization of a member
8473 of a class template specialization that is implicitly instantiated,
8478 template<class U> struct M {}; //#0
8483 struct S<int>::M<char> //#1
8487 [temp.expl.spec]/4 says this is valid.
8489 In this case, when we write:
8492 M is instantiated from the CLASSTYPE_TI_TEMPLATE of #1, not from
8495 When we encounter #1, we want to store the partial instantiation
8496 of M (template<class T> S<int>::M<T>) in its CLASSTYPE_TI_TEMPLATE.
8498 For all cases other than this "explicit specialization of member of a
8499 class template", we just want to store the most general template into
8500 the CLASSTYPE_TI_TEMPLATE of M.
8502 This case of "explicit specialization of member of a class template"
8504 1/ the enclosing class is an instantiation of, and therefore not
8505 the same as, the context of the most general template, and
8506 2/ we aren't looking at the partial instantiation itself, i.e.
8507 the innermost arguments are not the same as the innermost parms of
8508 the most general template.
8510 So it's only when 1/ and 2/ happens that we want to use the partial
8511 instantiation of the member template in lieu of its most general
8514 if (PRIMARY_TEMPLATE_P (gen_tmpl
)
8515 && TMPL_ARGS_HAVE_MULTIPLE_LEVELS (arglist
)
8516 /* the enclosing class must be an instantiation... */
8517 && CLASS_TYPE_P (context
)
8518 && !same_type_p (context
, DECL_CONTEXT (gen_tmpl
)))
8520 tree partial_inst_args
;
8521 TREE_VEC_LENGTH (arglist
)--;
8522 ++processing_template_decl
;
8524 tsubst (INNERMOST_TEMPLATE_ARGS
8525 (TYPE_TI_ARGS (TREE_TYPE (gen_tmpl
))),
8526 arglist
, complain
, NULL_TREE
);
8527 --processing_template_decl
;
8528 TREE_VEC_LENGTH (arglist
)++;
8529 use_partial_inst_tmpl
=
8530 /*...and we must not be looking at the partial instantiation
8532 !comp_template_args (INNERMOST_TEMPLATE_ARGS (arglist
),
8536 if (!use_partial_inst_tmpl
)
8537 /* This case is easy; there are no member templates involved. */
8541 /* This is a full instantiation of a member template. Find
8542 the partial instantiation of which this is an instance. */
8544 /* Temporarily reduce by one the number of levels in the ARGLIST
8545 so as to avoid comparing the last set of arguments. */
8546 TREE_VEC_LENGTH (arglist
)--;
8547 found
= tsubst (gen_tmpl
, arglist
, complain
, NULL_TREE
);
8548 TREE_VEC_LENGTH (arglist
)++;
8549 /* FOUND is either a proper class type, or an alias
8550 template specialization. In the later case, it's a
8551 TYPE_DECL, resulting from the substituting of arguments
8552 for parameters in the TYPE_DECL of the alias template
8553 done earlier. So be careful while getting the template
8555 found
= TREE_CODE (found
) == TYPE_DECL
8556 ? TYPE_TI_TEMPLATE (TREE_TYPE (found
))
8557 : CLASSTYPE_TI_TEMPLATE (found
);
8560 // Build template info for the new specialization.
8561 SET_TYPE_TEMPLATE_INFO (t
, build_template_info (found
, arglist
));
8564 slot
= type_specializations
->find_slot_with_hash (&elt
, hash
, INSERT
);
8565 entry
= ggc_alloc
<spec_entry
> ();
8569 /* Note this use of the partial instantiation so we can check it
8570 later in maybe_process_partial_specialization. */
8571 DECL_TEMPLATE_INSTANTIATIONS (found
)
8572 = tree_cons (arglist
, t
,
8573 DECL_TEMPLATE_INSTANTIATIONS (found
));
8575 if (TREE_CODE (template_type
) == ENUMERAL_TYPE
&& !is_dependent_type
8576 && !DECL_ALIAS_TEMPLATE_P (gen_tmpl
))
8577 /* Now that the type has been registered on the instantiations
8578 list, we set up the enumerators. Because the enumeration
8579 constants may involve the enumeration type itself, we make
8580 sure to register the type first, and then create the
8581 constants. That way, doing tsubst_expr for the enumeration
8582 constants won't result in recursive calls here; we'll find
8583 the instantiation and exit above. */
8584 tsubst_enum (template_type
, t
, arglist
);
8586 if (CLASS_TYPE_P (template_type
) && is_dependent_type
)
8587 /* If the type makes use of template parameters, the
8588 code that generates debugging information will crash. */
8589 DECL_IGNORED_P (TYPE_MAIN_DECL (t
)) = 1;
8591 /* Possibly limit visibility based on template args. */
8592 TREE_PUBLIC (type_decl
) = 1;
8593 determine_visibility (type_decl
);
8595 inherit_targ_abi_tags (t
);
8601 /* Wrapper for lookup_template_class_1. */
8604 lookup_template_class (tree d1
, tree arglist
, tree in_decl
, tree context
,
8605 int entering_scope
, tsubst_flags_t complain
)
8608 timevar_push (TV_TEMPLATE_INST
);
8609 ret
= lookup_template_class_1 (d1
, arglist
, in_decl
, context
,
8610 entering_scope
, complain
);
8611 timevar_pop (TV_TEMPLATE_INST
);
8615 /* Return a TEMPLATE_ID_EXPR for the given variable template and ARGLIST. */
8618 lookup_template_variable (tree templ
, tree arglist
)
8620 /* The type of the expression is NULL_TREE since the template-id could refer
8621 to an explicit or partial specialization. */
8622 tree type
= NULL_TREE
;
8623 if (flag_concepts
&& variable_concept_p (templ
))
8624 /* Except that concepts are always bool. */
8625 type
= boolean_type_node
;
8626 return build2 (TEMPLATE_ID_EXPR
, type
, templ
, arglist
);
8629 /* Instantiate a variable declaration from a TEMPLATE_ID_EXPR for use. */
8632 finish_template_variable (tree var
, tsubst_flags_t complain
)
8634 tree templ
= TREE_OPERAND (var
, 0);
8635 tree arglist
= TREE_OPERAND (var
, 1);
8637 /* We never want to return a VAR_DECL for a variable concept, since they
8638 aren't instantiated. In a template, leave the TEMPLATE_ID_EXPR alone. */
8639 bool concept_p
= flag_concepts
&& variable_concept_p (templ
);
8640 if (concept_p
&& processing_template_decl
)
8643 tree tmpl_args
= DECL_TI_ARGS (DECL_TEMPLATE_RESULT (templ
));
8644 arglist
= add_outermost_template_args (tmpl_args
, arglist
);
8646 tree parms
= DECL_TEMPLATE_PARMS (templ
);
8647 arglist
= coerce_innermost_template_parms (parms
, arglist
, templ
, complain
,
8649 /*use_default*/true);
8651 if (flag_concepts
&& !constraints_satisfied_p (templ
, arglist
))
8653 if (complain
& tf_error
)
8655 error ("constraints for %qD not satisfied", templ
);
8656 diagnose_constraints (location_of (var
), templ
, arglist
);
8658 return error_mark_node
;
8661 /* If a template-id refers to a specialization of a variable
8662 concept, then the expression is true if and only if the
8663 concept's constraints are satisfied by the given template
8666 NOTE: This is an extension of Concepts Lite TS that
8667 allows constraints to be used in expressions. */
8670 tree decl
= DECL_TEMPLATE_RESULT (templ
);
8671 return evaluate_variable_concept (decl
, arglist
);
8674 return instantiate_template (templ
, arglist
, complain
);
8681 /* True when we should also visit template parameters that occur in
8682 non-deduced contexts. */
8683 bool include_nondeduced_p
;
8684 hash_set
<tree
> *visited
;
8687 /* Called from for_each_template_parm via walk_tree. */
8690 for_each_template_parm_r (tree
*tp
, int *walk_subtrees
, void *d
)
8693 struct pair_fn_data
*pfd
= (struct pair_fn_data
*) d
;
8694 tree_fn_t fn
= pfd
->fn
;
8695 void *data
= pfd
->data
;
8698 && (pfd
->include_nondeduced_p
|| TREE_CODE (t
) != TYPENAME_TYPE
)
8699 && for_each_template_parm (TYPE_CONTEXT (t
), fn
, data
, pfd
->visited
,
8700 pfd
->include_nondeduced_p
))
8701 return error_mark_node
;
8703 switch (TREE_CODE (t
))
8706 if (TYPE_PTRMEMFUNC_P (t
))
8712 if (!TYPE_TEMPLATE_INFO (t
))
8714 else if (for_each_template_parm (TYPE_TI_ARGS (t
),
8715 fn
, data
, pfd
->visited
,
8716 pfd
->include_nondeduced_p
))
8717 return error_mark_node
;
8721 if (for_each_template_parm (TYPE_MIN_VALUE (t
),
8722 fn
, data
, pfd
->visited
,
8723 pfd
->include_nondeduced_p
)
8724 || for_each_template_parm (TYPE_MAX_VALUE (t
),
8725 fn
, data
, pfd
->visited
,
8726 pfd
->include_nondeduced_p
))
8727 return error_mark_node
;
8731 /* Since we're not going to walk subtrees, we have to do this
8733 if (for_each_template_parm (TYPE_METHOD_BASETYPE (t
), fn
, data
,
8734 pfd
->visited
, pfd
->include_nondeduced_p
))
8735 return error_mark_node
;
8739 /* Check the return type. */
8740 if (for_each_template_parm (TREE_TYPE (t
), fn
, data
, pfd
->visited
,
8741 pfd
->include_nondeduced_p
))
8742 return error_mark_node
;
8744 /* Check the parameter types. Since default arguments are not
8745 instantiated until they are needed, the TYPE_ARG_TYPES may
8746 contain expressions that involve template parameters. But,
8747 no-one should be looking at them yet. And, once they're
8748 instantiated, they don't contain template parameters, so
8749 there's no point in looking at them then, either. */
8753 for (parm
= TYPE_ARG_TYPES (t
); parm
; parm
= TREE_CHAIN (parm
))
8754 if (for_each_template_parm (TREE_VALUE (parm
), fn
, data
,
8755 pfd
->visited
, pfd
->include_nondeduced_p
))
8756 return error_mark_node
;
8758 /* Since we've already handled the TYPE_ARG_TYPES, we don't
8759 want walk_tree walking into them itself. */
8765 case UNDERLYING_TYPE
:
8766 if (pfd
->include_nondeduced_p
8767 && for_each_template_parm (TYPE_VALUES_RAW (t
), fn
, data
,
8769 pfd
->include_nondeduced_p
))
8770 return error_mark_node
;
8775 if (DECL_LANG_SPECIFIC (t
) && DECL_TEMPLATE_INFO (t
)
8776 && for_each_template_parm (DECL_TI_ARGS (t
), fn
, data
,
8777 pfd
->visited
, pfd
->include_nondeduced_p
))
8778 return error_mark_node
;
8783 if (TREE_CODE (t
) == CONST_DECL
&& DECL_TEMPLATE_PARM_P (t
)
8784 && for_each_template_parm (DECL_INITIAL (t
), fn
, data
,
8785 pfd
->visited
, pfd
->include_nondeduced_p
))
8786 return error_mark_node
;
8787 if (DECL_CONTEXT (t
)
8788 && pfd
->include_nondeduced_p
8789 && for_each_template_parm (DECL_CONTEXT (t
), fn
, data
,
8790 pfd
->visited
, pfd
->include_nondeduced_p
))
8791 return error_mark_node
;
8794 case BOUND_TEMPLATE_TEMPLATE_PARM
:
8795 /* Record template parameters such as `T' inside `TT<T>'. */
8796 if (for_each_template_parm (TYPE_TI_ARGS (t
), fn
, data
, pfd
->visited
,
8797 pfd
->include_nondeduced_p
))
8798 return error_mark_node
;
8801 case TEMPLATE_TEMPLATE_PARM
:
8802 case TEMPLATE_TYPE_PARM
:
8803 case TEMPLATE_PARM_INDEX
:
8804 if (fn
&& (*fn
)(t
, data
))
8805 return error_mark_node
;
8807 return error_mark_node
;
8811 /* A template template parameter is encountered. */
8812 if (DECL_TEMPLATE_TEMPLATE_PARM_P (t
)
8813 && for_each_template_parm (TREE_TYPE (t
), fn
, data
, pfd
->visited
,
8814 pfd
->include_nondeduced_p
))
8815 return error_mark_node
;
8817 /* Already substituted template template parameter */
8823 || for_each_template_parm (TYPENAME_TYPE_FULLNAME (t
), fn
,
8825 pfd
->include_nondeduced_p
))
8826 return error_mark_node
;
8830 if (TREE_TYPE (t
) && TYPE_PTRMEMFUNC_P (TREE_TYPE (t
))
8831 && pfd
->include_nondeduced_p
8832 && for_each_template_parm (TYPE_PTRMEMFUNC_FN_TYPE
8833 (TREE_TYPE (t
)), fn
, data
,
8834 pfd
->visited
, pfd
->include_nondeduced_p
))
8835 return error_mark_node
;
8840 /* If there's no type, then this thing must be some expression
8841 involving template parameters. */
8842 if (!fn
&& !TREE_TYPE (t
))
8843 return error_mark_node
;
8848 case IMPLICIT_CONV_EXPR
:
8849 case REINTERPRET_CAST_EXPR
:
8850 case CONST_CAST_EXPR
:
8851 case STATIC_CAST_EXPR
:
8852 case DYNAMIC_CAST_EXPR
:
8856 case PSEUDO_DTOR_EXPR
:
8858 return error_mark_node
;
8865 /* We didn't find any template parameters we liked. */
8869 /* For each TEMPLATE_TYPE_PARM, TEMPLATE_TEMPLATE_PARM,
8870 BOUND_TEMPLATE_TEMPLATE_PARM or TEMPLATE_PARM_INDEX in T,
8871 call FN with the parameter and the DATA.
8872 If FN returns nonzero, the iteration is terminated, and
8873 for_each_template_parm returns 1. Otherwise, the iteration
8874 continues. If FN never returns a nonzero value, the value
8875 returned by for_each_template_parm is 0. If FN is NULL, it is
8876 considered to be the function which always returns 1.
8878 If INCLUDE_NONDEDUCED_P, then this routine will also visit template
8879 parameters that occur in non-deduced contexts. When false, only
8880 visits those template parameters that can be deduced. */
8883 for_each_template_parm (tree t
, tree_fn_t fn
, void* data
,
8884 hash_set
<tree
> *visited
,
8885 bool include_nondeduced_p
)
8887 struct pair_fn_data pfd
;
8893 pfd
.include_nondeduced_p
= include_nondeduced_p
;
8895 /* Walk the tree. (Conceptually, we would like to walk without
8896 duplicates, but for_each_template_parm_r recursively calls
8897 for_each_template_parm, so we would need to reorganize a fair
8898 bit to use walk_tree_without_duplicates, so we keep our own
8901 pfd
.visited
= visited
;
8903 pfd
.visited
= new hash_set
<tree
>;
8904 result
= cp_walk_tree (&t
,
8905 for_each_template_parm_r
,
8907 pfd
.visited
) != NULL_TREE
;
8919 /* Returns true if T depends on any template parameter. */
8922 uses_template_parms (tree t
)
8928 int saved_processing_template_decl
;
8930 saved_processing_template_decl
= processing_template_decl
;
8931 if (!saved_processing_template_decl
)
8932 processing_template_decl
= 1;
8934 dependent_p
= dependent_type_p (t
);
8935 else if (TREE_CODE (t
) == TREE_VEC
)
8936 dependent_p
= any_dependent_template_arguments_p (t
);
8937 else if (TREE_CODE (t
) == TREE_LIST
)
8938 dependent_p
= (uses_template_parms (TREE_VALUE (t
))
8939 || uses_template_parms (TREE_CHAIN (t
)));
8940 else if (TREE_CODE (t
) == TYPE_DECL
)
8941 dependent_p
= dependent_type_p (TREE_TYPE (t
));
8944 || TREE_CODE (t
) == TEMPLATE_PARM_INDEX
8945 || TREE_CODE (t
) == OVERLOAD
8948 || TREE_CODE (t
) == TRAIT_EXPR
8949 || TREE_CODE (t
) == CONSTRUCTOR
8950 || CONSTANT_CLASS_P (t
))
8951 dependent_p
= (type_dependent_expression_p (t
)
8952 || value_dependent_expression_p (t
));
8955 gcc_assert (t
== error_mark_node
);
8956 dependent_p
= false;
8959 processing_template_decl
= saved_processing_template_decl
;
8964 /* Returns true iff current_function_decl is an incompletely instantiated
8965 template. Useful instead of processing_template_decl because the latter
8966 is set to 0 during instantiate_non_dependent_expr. */
8969 in_template_function (void)
8971 tree fn
= current_function_decl
;
8973 ++processing_template_decl
;
8974 ret
= (fn
&& DECL_LANG_SPECIFIC (fn
)
8975 && DECL_TEMPLATE_INFO (fn
)
8976 && any_dependent_template_arguments_p (DECL_TI_ARGS (fn
)));
8977 --processing_template_decl
;
8981 /* Returns true if T depends on any template parameter with level LEVEL. */
8984 uses_template_parms_level (tree t
, int level
)
8986 return for_each_template_parm (t
, template_parm_this_level_p
, &level
, NULL
,
8987 /*include_nondeduced_p=*/true);
8990 /* Returns TRUE iff INST is an instantiation we don't need to do in an
8991 ill-formed translation unit, i.e. a variable or function that isn't
8992 usable in a constant expression. */
8995 neglectable_inst_p (tree d
)
8998 && !(TREE_CODE (d
) == FUNCTION_DECL
? DECL_DECLARED_CONSTEXPR_P (d
)
8999 : decl_maybe_constant_var_p (d
)));
9002 /* Returns TRUE iff we should refuse to instantiate DECL because it's
9003 neglectable and instantiated from within an erroneous instantiation. */
9006 limit_bad_template_recursion (tree decl
)
9008 struct tinst_level
*lev
= current_tinst_level
;
9009 int errs
= errorcount
+ sorrycount
;
9010 if (lev
== NULL
|| errs
== 0 || !neglectable_inst_p (decl
))
9013 for (; lev
; lev
= lev
->next
)
9014 if (neglectable_inst_p (lev
->decl
))
9017 return (lev
&& errs
> lev
->errors
);
9020 static int tinst_depth
;
9021 extern int max_tinst_depth
;
9024 static GTY(()) struct tinst_level
*last_error_tinst_level
;
9026 /* We're starting to instantiate D; record the template instantiation context
9027 for diagnostics and to restore it later. */
9030 push_tinst_level (tree d
)
9032 return push_tinst_level_loc (d
, input_location
);
9035 /* We're starting to instantiate D; record the template instantiation context
9036 at LOC for diagnostics and to restore it later. */
9039 push_tinst_level_loc (tree d
, location_t loc
)
9041 struct tinst_level
*new_level
;
9043 if (tinst_depth
>= max_tinst_depth
)
9045 fatal_error (input_location
,
9046 "template instantiation depth exceeds maximum of %d"
9047 " (use -ftemplate-depth= to increase the maximum)",
9052 /* If the current instantiation caused problems, don't let it instantiate
9053 anything else. Do allow deduction substitution and decls usable in
9054 constant expressions. */
9055 if (limit_bad_template_recursion (d
))
9058 new_level
= ggc_alloc
<tinst_level
> ();
9059 new_level
->decl
= d
;
9060 new_level
->locus
= loc
;
9061 new_level
->errors
= errorcount
+sorrycount
;
9062 new_level
->in_system_header_p
= in_system_header_at (input_location
);
9063 new_level
->next
= current_tinst_level
;
9064 current_tinst_level
= new_level
;
9067 if (GATHER_STATISTICS
&& (tinst_depth
> depth_reached
))
9068 depth_reached
= tinst_depth
;
9073 /* We're done instantiating this template; return to the instantiation
9077 pop_tinst_level (void)
9079 /* Restore the filename and line number stashed away when we started
9080 this instantiation. */
9081 input_location
= current_tinst_level
->locus
;
9082 current_tinst_level
= current_tinst_level
->next
;
9086 /* We're instantiating a deferred template; restore the template
9087 instantiation context in which the instantiation was requested, which
9088 is one step out from LEVEL. Return the corresponding DECL or TYPE. */
9091 reopen_tinst_level (struct tinst_level
*level
)
9093 struct tinst_level
*t
;
9096 for (t
= level
; t
; t
= t
->next
)
9099 current_tinst_level
= level
;
9101 if (current_tinst_level
)
9102 current_tinst_level
->errors
= errorcount
+sorrycount
;
9106 /* Returns the TINST_LEVEL which gives the original instantiation
9109 struct tinst_level
*
9110 outermost_tinst_level (void)
9112 struct tinst_level
*level
= current_tinst_level
;
9115 level
= level
->next
;
9119 /* DECL is a friend FUNCTION_DECL or TEMPLATE_DECL. ARGS is the
9120 vector of template arguments, as for tsubst.
9122 Returns an appropriate tsubst'd friend declaration. */
9125 tsubst_friend_function (tree decl
, tree args
)
9129 if (TREE_CODE (decl
) == FUNCTION_DECL
9130 && DECL_TEMPLATE_INSTANTIATION (decl
)
9131 && TREE_CODE (DECL_TI_TEMPLATE (decl
)) != TEMPLATE_DECL
)
9132 /* This was a friend declared with an explicit template
9133 argument list, e.g.:
9137 to indicate that f was a template instantiation, not a new
9138 function declaration. Now, we have to figure out what
9139 instantiation of what template. */
9141 tree template_id
, arglist
, fns
;
9144 tree ns
= decl_namespace_context (TYPE_MAIN_DECL (current_class_type
));
9146 /* Friend functions are looked up in the containing namespace scope.
9147 We must enter that scope, to avoid finding member functions of the
9148 current class with same name. */
9149 push_nested_namespace (ns
);
9150 fns
= tsubst_expr (DECL_TI_TEMPLATE (decl
), args
,
9151 tf_warning_or_error
, NULL_TREE
,
9152 /*integral_constant_expression_p=*/false);
9153 pop_nested_namespace (ns
);
9154 arglist
= tsubst (DECL_TI_ARGS (decl
), args
,
9155 tf_warning_or_error
, NULL_TREE
);
9156 template_id
= lookup_template_function (fns
, arglist
);
9158 new_friend
= tsubst (decl
, args
, tf_warning_or_error
, NULL_TREE
);
9159 tmpl
= determine_specialization (template_id
, new_friend
,
9161 /*need_member_template=*/0,
9162 TREE_VEC_LENGTH (args
),
9164 return instantiate_template (tmpl
, new_args
, tf_error
);
9167 new_friend
= tsubst (decl
, args
, tf_warning_or_error
, NULL_TREE
);
9169 /* The NEW_FRIEND will look like an instantiation, to the
9170 compiler, but is not an instantiation from the point of view of
9171 the language. For example, we might have had:
9173 template <class T> struct S {
9174 template <class U> friend void f(T, U);
9177 Then, in S<int>, template <class U> void f(int, U) is not an
9178 instantiation of anything. */
9179 if (new_friend
== error_mark_node
)
9180 return error_mark_node
;
9182 DECL_USE_TEMPLATE (new_friend
) = 0;
9183 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
9185 DECL_USE_TEMPLATE (DECL_TEMPLATE_RESULT (new_friend
)) = 0;
9186 DECL_SAVED_TREE (DECL_TEMPLATE_RESULT (new_friend
))
9187 = DECL_SAVED_TREE (DECL_TEMPLATE_RESULT (decl
));
9190 /* The mangled name for the NEW_FRIEND is incorrect. The function
9191 is not a template instantiation and should not be mangled like
9192 one. Therefore, we forget the mangling here; we'll recompute it
9193 later if we need it. */
9194 if (TREE_CODE (new_friend
) != TEMPLATE_DECL
)
9196 SET_DECL_RTL (new_friend
, NULL
);
9197 SET_DECL_ASSEMBLER_NAME (new_friend
, NULL_TREE
);
9200 if (DECL_NAMESPACE_SCOPE_P (new_friend
))
9203 tree new_friend_template_info
;
9204 tree new_friend_result_template_info
;
9206 int new_friend_is_defn
;
9208 /* We must save some information from NEW_FRIEND before calling
9209 duplicate decls since that function will free NEW_FRIEND if
9211 new_friend_template_info
= DECL_TEMPLATE_INFO (new_friend
);
9212 new_friend_is_defn
=
9213 (DECL_INITIAL (DECL_TEMPLATE_RESULT
9214 (template_for_substitution (new_friend
)))
9216 if (TREE_CODE (new_friend
) == TEMPLATE_DECL
)
9218 /* This declaration is a `primary' template. */
9219 DECL_PRIMARY_TEMPLATE (new_friend
) = new_friend
;
9221 new_friend_result_template_info
9222 = DECL_TEMPLATE_INFO (DECL_TEMPLATE_RESULT (new_friend
));
9225 new_friend_result_template_info
= NULL_TREE
;
9227 /* Make the init_value nonzero so pushdecl knows this is a defn. */
9228 if (new_friend_is_defn
)
9229 DECL_INITIAL (new_friend
) = error_mark_node
;
9231 /* Inside pushdecl_namespace_level, we will push into the
9232 current namespace. However, the friend function should go
9233 into the namespace of the template. */
9234 ns
= decl_namespace_context (new_friend
);
9235 push_nested_namespace (ns
);
9236 old_decl
= pushdecl_namespace_level (new_friend
, /*is_friend=*/true);
9237 pop_nested_namespace (ns
);
9239 if (old_decl
== error_mark_node
)
9240 return error_mark_node
;
9242 if (old_decl
!= new_friend
)
9244 /* This new friend declaration matched an existing
9245 declaration. For example, given:
9247 template <class T> void f(T);
9248 template <class U> class C {
9249 template <class T> friend void f(T) {}
9252 the friend declaration actually provides the definition
9253 of `f', once C has been instantiated for some type. So,
9254 old_decl will be the out-of-class template declaration,
9255 while new_friend is the in-class definition.
9257 But, if `f' was called before this point, the
9258 instantiation of `f' will have DECL_TI_ARGS corresponding
9259 to `T' but not to `U', references to which might appear
9260 in the definition of `f'. Previously, the most general
9261 template for an instantiation of `f' was the out-of-class
9262 version; now it is the in-class version. Therefore, we
9263 run through all specialization of `f', adding to their
9264 DECL_TI_ARGS appropriately. In particular, they need a
9265 new set of outer arguments, corresponding to the
9266 arguments for this class instantiation.
9268 The same situation can arise with something like this:
9271 template <class T> class C {
9275 when `C<int>' is instantiated. Now, `f(int)' is defined
9278 if (!new_friend_is_defn
)
9279 /* On the other hand, if the in-class declaration does
9280 *not* provide a definition, then we don't want to alter
9281 existing definitions. We can just leave everything
9286 tree new_template
= TI_TEMPLATE (new_friend_template_info
);
9287 tree new_args
= TI_ARGS (new_friend_template_info
);
9289 /* Overwrite whatever template info was there before, if
9290 any, with the new template information pertaining to
9292 DECL_TEMPLATE_INFO (old_decl
) = new_friend_template_info
;
9294 if (TREE_CODE (old_decl
) != TEMPLATE_DECL
)
9296 /* We should have called reregister_specialization in
9298 gcc_assert (retrieve_specialization (new_template
,
9302 /* Instantiate it if the global has already been used. */
9303 if (DECL_ODR_USED (old_decl
))
9304 instantiate_decl (old_decl
, /*defer_ok=*/true,
9305 /*expl_inst_class_mem_p=*/false);
9311 /* Indicate that the old function template is a partial
9313 DECL_TEMPLATE_INFO (DECL_TEMPLATE_RESULT (old_decl
))
9314 = new_friend_result_template_info
;
9316 gcc_assert (new_template
9317 == most_general_template (new_template
));
9318 gcc_assert (new_template
!= old_decl
);
9320 /* Reassign any specializations already in the hash table
9321 to the new more general template, and add the
9322 additional template args. */
9323 for (t
= DECL_TEMPLATE_INSTANTIATIONS (old_decl
);
9327 tree spec
= TREE_VALUE (t
);
9330 elt
.tmpl
= old_decl
;
9331 elt
.args
= DECL_TI_ARGS (spec
);
9332 elt
.spec
= NULL_TREE
;
9334 decl_specializations
->remove_elt (&elt
);
9337 = add_outermost_template_args (new_args
,
9338 DECL_TI_ARGS (spec
));
9340 register_specialization
9341 (spec
, new_template
, DECL_TI_ARGS (spec
), true, 0);
9344 DECL_TEMPLATE_INSTANTIATIONS (old_decl
) = NULL_TREE
;
9348 /* The information from NEW_FRIEND has been merged into OLD_DECL
9349 by duplicate_decls. */
9350 new_friend
= old_decl
;
9355 tree context
= DECL_CONTEXT (new_friend
);
9359 template <class T> class C {
9360 template <class U> friend void C1<U>::f (); // case 1
9361 friend void C2<T>::f (); // case 2
9363 we only need to make sure CONTEXT is a complete type for
9364 case 2. To distinguish between the two cases, we note that
9365 CONTEXT of case 1 remains dependent type after tsubst while
9366 this isn't true for case 2. */
9367 ++processing_template_decl
;
9368 dependent_p
= dependent_type_p (context
);
9369 --processing_template_decl
;
9372 && !complete_type_or_else (context
, NULL_TREE
))
9373 return error_mark_node
;
9375 if (COMPLETE_TYPE_P (context
))
9377 tree fn
= new_friend
;
9378 /* do_friend adds the TEMPLATE_DECL for any member friend
9379 template even if it isn't a member template, i.e.
9380 template <class T> friend A<T>::f();
9381 Look through it in that case. */
9382 if (TREE_CODE (fn
) == TEMPLATE_DECL
9383 && !PRIMARY_TEMPLATE_P (fn
))
9384 fn
= DECL_TEMPLATE_RESULT (fn
);
9385 /* Check to see that the declaration is really present, and,
9386 possibly obtain an improved declaration. */
9387 fn
= check_classfn (context
, fn
, NULL_TREE
);
9397 /* FRIEND_TMPL is a friend TEMPLATE_DECL. ARGS is the vector of
9398 template arguments, as for tsubst.
9400 Returns an appropriate tsubst'd friend type or error_mark_node on
9404 tsubst_friend_class (tree friend_tmpl
, tree args
)
9410 if (DECL_TEMPLATE_TEMPLATE_PARM_P (friend_tmpl
))
9412 tree t
= tsubst (TREE_TYPE (friend_tmpl
), args
, tf_none
, NULL_TREE
);
9413 return TREE_TYPE (t
);
9416 context
= CP_DECL_CONTEXT (friend_tmpl
);
9418 if (context
!= global_namespace
)
9420 if (TREE_CODE (context
) == NAMESPACE_DECL
)
9421 push_nested_namespace (context
);
9423 push_nested_class (tsubst (context
, args
, tf_none
, NULL_TREE
));
9426 /* Look for a class template declaration. We look for hidden names
9427 because two friend declarations of the same template are the
9428 same. For example, in:
9431 template <typename> friend class F;
9433 template <typename> struct B {
9434 template <typename> friend class F;
9437 both F templates are the same. */
9438 tmpl
= lookup_name_real (DECL_NAME (friend_tmpl
), 0, 0,
9439 /*block_p=*/true, 0, LOOKUP_HIDDEN
);
9441 /* But, if we don't find one, it might be because we're in a
9442 situation like this:
9450 Here, in the scope of (say) S<int>, `S' is bound to a TYPE_DECL
9451 for `S<int>', not the TEMPLATE_DECL. */
9452 if (!tmpl
|| !DECL_CLASS_TEMPLATE_P (tmpl
))
9454 tmpl
= lookup_name_prefer_type (DECL_NAME (friend_tmpl
), 1);
9455 tmpl
= maybe_get_template_decl_from_type_decl (tmpl
);
9458 if (tmpl
&& DECL_CLASS_TEMPLATE_P (tmpl
))
9460 /* The friend template has already been declared. Just
9461 check to see that the declarations match, and install any new
9462 default parameters. We must tsubst the default parameters,
9463 of course. We only need the innermost template parameters
9464 because that is all that redeclare_class_template will look
9466 if (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (friend_tmpl
))
9467 > TMPL_ARGS_DEPTH (args
))
9470 location_t saved_input_location
;
9471 parms
= tsubst_template_parms (DECL_TEMPLATE_PARMS (friend_tmpl
),
9472 args
, tf_warning_or_error
);
9474 saved_input_location
= input_location
;
9475 input_location
= DECL_SOURCE_LOCATION (friend_tmpl
);
9476 tree cons
= get_constraints (tmpl
);
9477 redeclare_class_template (TREE_TYPE (tmpl
), parms
, cons
);
9478 input_location
= saved_input_location
;
9482 friend_type
= TREE_TYPE (tmpl
);
9486 /* The friend template has not already been declared. In this
9487 case, the instantiation of the template class will cause the
9488 injection of this template into the global scope. */
9489 tmpl
= tsubst (friend_tmpl
, args
, tf_warning_or_error
, NULL_TREE
);
9490 if (tmpl
== error_mark_node
)
9491 return error_mark_node
;
9493 /* The new TMPL is not an instantiation of anything, so we
9494 forget its origins. We don't reset CLASSTYPE_TI_TEMPLATE for
9495 the new type because that is supposed to be the corresponding
9496 template decl, i.e., TMPL. */
9497 DECL_USE_TEMPLATE (tmpl
) = 0;
9498 DECL_TEMPLATE_INFO (tmpl
) = NULL_TREE
;
9499 CLASSTYPE_USE_TEMPLATE (TREE_TYPE (tmpl
)) = 0;
9500 CLASSTYPE_TI_ARGS (TREE_TYPE (tmpl
))
9501 = INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (TREE_TYPE (tmpl
)));
9503 /* Inject this template into the global scope. */
9504 friend_type
= TREE_TYPE (pushdecl_top_level_maybe_friend (tmpl
, true));
9507 if (context
!= global_namespace
)
9509 if (TREE_CODE (context
) == NAMESPACE_DECL
)
9510 pop_nested_namespace (context
);
9512 pop_nested_class ();
9518 /* Returns zero if TYPE cannot be completed later due to circularity.
9519 Otherwise returns one. */
9522 can_complete_type_without_circularity (tree type
)
9524 if (type
== NULL_TREE
|| type
== error_mark_node
)
9526 else if (COMPLETE_TYPE_P (type
))
9528 else if (TREE_CODE (type
) == ARRAY_TYPE
&& TYPE_DOMAIN (type
))
9529 return can_complete_type_without_circularity (TREE_TYPE (type
));
9530 else if (CLASS_TYPE_P (type
)
9531 && TYPE_BEING_DEFINED (TYPE_MAIN_VARIANT (type
)))
9537 static tree
tsubst_omp_clauses (tree
, bool, bool, tree
, tsubst_flags_t
, tree
);
9539 /* Apply any attributes which had to be deferred until instantiation
9540 time. DECL_P, ATTRIBUTES and ATTR_FLAGS are as cplus_decl_attributes;
9541 ARGS, COMPLAIN, IN_DECL are as tsubst. */
9544 apply_late_template_attributes (tree
*decl_p
, tree attributes
, int attr_flags
,
9545 tree args
, tsubst_flags_t complain
, tree in_decl
)
9547 tree last_dep
= NULL_TREE
;
9551 for (t
= attributes
; t
; t
= TREE_CHAIN (t
))
9552 if (ATTR_IS_DEPENDENT (t
))
9555 attributes
= copy_list (attributes
);
9559 if (DECL_P (*decl_p
))
9561 if (TREE_TYPE (*decl_p
) == error_mark_node
)
9563 p
= &DECL_ATTRIBUTES (*decl_p
);
9566 p
= &TYPE_ATTRIBUTES (*decl_p
);
9570 tree late_attrs
= NULL_TREE
;
9571 tree
*q
= &late_attrs
;
9573 for (*p
= attributes
; *p
; )
9576 if (ATTR_IS_DEPENDENT (t
))
9578 *p
= TREE_CHAIN (t
);
9579 TREE_CHAIN (t
) = NULL_TREE
;
9580 if ((flag_openmp
|| flag_openmp_simd
|| flag_cilkplus
)
9581 && is_attribute_p ("omp declare simd",
9582 get_attribute_name (t
))
9585 tree clauses
= TREE_VALUE (TREE_VALUE (t
));
9586 clauses
= tsubst_omp_clauses (clauses
, true, false, args
,
9588 c_omp_declare_simd_clauses_to_decls (*decl_p
, clauses
);
9589 clauses
= finish_omp_clauses (clauses
, false, true);
9590 tree parms
= DECL_ARGUMENTS (*decl_p
);
9592 = c_omp_declare_simd_clauses_to_numbers (parms
, clauses
);
9594 TREE_VALUE (TREE_VALUE (t
)) = clauses
;
9596 TREE_VALUE (t
) = NULL_TREE
;
9598 /* If the first attribute argument is an identifier, don't
9599 pass it through tsubst. Attributes like mode, format,
9600 cleanup and several target specific attributes expect it
9602 else if (attribute_takes_identifier_p (get_attribute_name (t
))
9606 = tsubst_expr (TREE_CHAIN (TREE_VALUE (t
)), args
, complain
,
9608 /*integral_constant_expression_p=*/false);
9609 if (chain
!= TREE_CHAIN (TREE_VALUE (t
)))
9611 = tree_cons (NULL_TREE
, TREE_VALUE (TREE_VALUE (t
)),
9614 else if (TREE_VALUE (t
) && PACK_EXPANSION_P (TREE_VALUE (t
)))
9616 /* An attribute pack expansion. */
9617 tree purp
= TREE_PURPOSE (t
);
9618 tree pack
= (tsubst_pack_expansion
9619 (TREE_VALUE (t
), args
, complain
, in_decl
));
9620 int len
= TREE_VEC_LENGTH (pack
);
9621 for (int i
= 0; i
< len
; ++i
)
9623 tree elt
= TREE_VEC_ELT (pack
, i
);
9624 *q
= build_tree_list (purp
, elt
);
9625 q
= &TREE_CHAIN (*q
);
9631 = tsubst_expr (TREE_VALUE (t
), args
, complain
, in_decl
,
9632 /*integral_constant_expression_p=*/false);
9634 q
= &TREE_CHAIN (t
);
9637 p
= &TREE_CHAIN (t
);
9640 cplus_decl_attributes (decl_p
, late_attrs
, attr_flags
);
9644 /* Perform (or defer) access check for typedefs that were referenced
9645 from within the template TMPL code.
9646 This is a subroutine of instantiate_decl and instantiate_class_template.
9647 TMPL is the template to consider and TARGS is the list of arguments of
9651 perform_typedefs_access_check (tree tmpl
, tree targs
)
9653 location_t saved_location
;
9655 qualified_typedef_usage_t
*iter
;
9658 || (!CLASS_TYPE_P (tmpl
)
9659 && TREE_CODE (tmpl
) != FUNCTION_DECL
))
9662 saved_location
= input_location
;
9663 FOR_EACH_VEC_SAFE_ELT (get_types_needing_access_check (tmpl
), i
, iter
)
9665 tree type_decl
= iter
->typedef_decl
;
9666 tree type_scope
= iter
->context
;
9668 if (!type_decl
|| !type_scope
|| !CLASS_TYPE_P (type_scope
))
9671 if (uses_template_parms (type_decl
))
9672 type_decl
= tsubst (type_decl
, targs
, tf_error
, NULL_TREE
);
9673 if (uses_template_parms (type_scope
))
9674 type_scope
= tsubst (type_scope
, targs
, tf_error
, NULL_TREE
);
9676 /* Make access check error messages point to the location
9677 of the use of the typedef. */
9678 input_location
= iter
->locus
;
9679 perform_or_defer_access_check (TYPE_BINFO (type_scope
),
9680 type_decl
, type_decl
,
9681 tf_warning_or_error
);
9683 input_location
= saved_location
;
9687 instantiate_class_template_1 (tree type
)
9689 tree templ
, args
, pattern
, t
, member
;
9693 unsigned int saved_maximum_field_alignment
;
9696 if (type
== error_mark_node
)
9697 return error_mark_node
;
9699 if (COMPLETE_OR_OPEN_TYPE_P (type
)
9700 || uses_template_parms (type
))
9703 /* Figure out which template is being instantiated. */
9704 templ
= most_general_template (CLASSTYPE_TI_TEMPLATE (type
));
9705 gcc_assert (TREE_CODE (templ
) == TEMPLATE_DECL
);
9707 /* Determine what specialization of the original template to
9709 t
= most_specialized_partial_spec (type
, tf_warning_or_error
);
9710 if (t
== error_mark_node
)
9712 TYPE_BEING_DEFINED (type
) = 1;
9713 return error_mark_node
;
9717 /* This TYPE is actually an instantiation of a partial
9718 specialization. We replace the innermost set of ARGS with
9719 the arguments appropriate for substitution. For example,
9722 template <class T> struct S {};
9723 template <class T> struct S<T*> {};
9725 and supposing that we are instantiating S<int*>, ARGS will
9726 presently be {int*} -- but we need {int}. */
9727 pattern
= TREE_TYPE (t
);
9728 args
= TREE_PURPOSE (t
);
9732 pattern
= TREE_TYPE (templ
);
9733 args
= CLASSTYPE_TI_ARGS (type
);
9736 /* If the template we're instantiating is incomplete, then clearly
9737 there's nothing we can do. */
9738 if (!COMPLETE_TYPE_P (pattern
))
9741 /* If we've recursively instantiated too many templates, stop. */
9742 if (! push_tinst_level (type
))
9745 /* Now we're really doing the instantiation. Mark the type as in
9746 the process of being defined. */
9747 TYPE_BEING_DEFINED (type
) = 1;
9749 /* We may be in the middle of deferred access check. Disable
9751 push_deferring_access_checks (dk_no_deferred
);
9753 int saved_unevaluated_operand
= cp_unevaluated_operand
;
9754 int saved_inhibit_evaluation_warnings
= c_inhibit_evaluation_warnings
;
9756 fn_context
= decl_function_context (TYPE_MAIN_DECL (type
));
9757 /* Also avoid push_to_top_level for a lambda in an NSDMI. */
9758 if (!fn_context
&& LAMBDA_TYPE_P (type
) && TYPE_CLASS_SCOPE_P (type
))
9759 fn_context
= error_mark_node
;
9761 push_to_top_level ();
9764 cp_unevaluated_operand
= 0;
9765 c_inhibit_evaluation_warnings
= 0;
9767 /* Use #pragma pack from the template context. */
9768 saved_maximum_field_alignment
= maximum_field_alignment
;
9769 maximum_field_alignment
= TYPE_PRECISION (pattern
);
9771 SET_CLASSTYPE_INTERFACE_UNKNOWN (type
);
9773 /* Set the input location to the most specialized template definition.
9774 This is needed if tsubsting causes an error. */
9775 typedecl
= TYPE_MAIN_DECL (pattern
);
9776 input_location
= DECL_SOURCE_LOCATION (TYPE_NAME (type
)) =
9777 DECL_SOURCE_LOCATION (typedecl
);
9779 TYPE_PACKED (type
) = TYPE_PACKED (pattern
);
9780 TYPE_ALIGN (type
) = TYPE_ALIGN (pattern
);
9781 TYPE_USER_ALIGN (type
) = TYPE_USER_ALIGN (pattern
);
9782 TYPE_FOR_JAVA (type
) = TYPE_FOR_JAVA (pattern
); /* For libjava's JArray<T> */
9783 if (ANON_AGGR_TYPE_P (pattern
))
9784 SET_ANON_AGGR_TYPE_P (type
);
9785 if (CLASSTYPE_VISIBILITY_SPECIFIED (pattern
))
9787 CLASSTYPE_VISIBILITY_SPECIFIED (type
) = 1;
9788 CLASSTYPE_VISIBILITY (type
) = CLASSTYPE_VISIBILITY (pattern
);
9789 /* Adjust visibility for template arguments. */
9790 determine_visibility (TYPE_MAIN_DECL (type
));
9792 if (CLASS_TYPE_P (type
))
9793 CLASSTYPE_FINAL (type
) = CLASSTYPE_FINAL (pattern
);
9795 pbinfo
= TYPE_BINFO (pattern
);
9797 /* We should never instantiate a nested class before its enclosing
9798 class; we need to look up the nested class by name before we can
9799 instantiate it, and that lookup should instantiate the enclosing
9801 gcc_assert (!DECL_CLASS_SCOPE_P (TYPE_MAIN_DECL (pattern
))
9802 || COMPLETE_OR_OPEN_TYPE_P (TYPE_CONTEXT (type
)));
9804 base_list
= NULL_TREE
;
9805 if (BINFO_N_BASE_BINFOS (pbinfo
))
9811 /* We must enter the scope containing the type, as that is where
9812 the accessibility of types named in dependent bases are
9814 pushed_scope
= push_scope (CP_TYPE_CONTEXT (type
));
9816 /* Substitute into each of the bases to determine the actual
9818 for (i
= 0; BINFO_BASE_ITERATE (pbinfo
, i
, pbase_binfo
); i
++)
9821 tree access
= BINFO_BASE_ACCESS (pbinfo
, i
);
9822 tree expanded_bases
= NULL_TREE
;
9825 if (PACK_EXPANSION_P (BINFO_TYPE (pbase_binfo
)))
9828 tsubst_pack_expansion (BINFO_TYPE (pbase_binfo
),
9829 args
, tf_error
, NULL_TREE
);
9830 if (expanded_bases
== error_mark_node
)
9833 len
= TREE_VEC_LENGTH (expanded_bases
);
9836 for (idx
= 0; idx
< len
; idx
++)
9839 /* Extract the already-expanded base class. */
9840 base
= TREE_VEC_ELT (expanded_bases
, idx
);
9842 /* Substitute to figure out the base class. */
9843 base
= tsubst (BINFO_TYPE (pbase_binfo
), args
, tf_error
,
9846 if (base
== error_mark_node
)
9849 base_list
= tree_cons (access
, base
, base_list
);
9850 if (BINFO_VIRTUAL_P (pbase_binfo
))
9851 TREE_TYPE (base_list
) = integer_type_node
;
9855 /* The list is now in reverse order; correct that. */
9856 base_list
= nreverse (base_list
);
9859 pop_scope (pushed_scope
);
9861 /* Now call xref_basetypes to set up all the base-class
9863 xref_basetypes (type
, base_list
);
9865 apply_late_template_attributes (&type
, TYPE_ATTRIBUTES (pattern
),
9866 (int) ATTR_FLAG_TYPE_IN_PLACE
,
9867 args
, tf_error
, NULL_TREE
);
9868 fixup_attribute_variants (type
);
9870 /* Now that our base classes are set up, enter the scope of the
9871 class, so that name lookups into base classes, etc. will work
9872 correctly. This is precisely analogous to what we do in
9873 begin_class_definition when defining an ordinary non-template
9874 class, except we also need to push the enclosing classes. */
9875 push_nested_class (type
);
9877 /* Now members are processed in the order of declaration. */
9878 for (member
= CLASSTYPE_DECL_LIST (pattern
);
9879 member
; member
= TREE_CHAIN (member
))
9881 tree t
= TREE_VALUE (member
);
9883 if (TREE_PURPOSE (member
))
9887 /* Build new CLASSTYPE_NESTED_UTDS. */
9890 bool class_template_p
;
9892 class_template_p
= (TREE_CODE (t
) != ENUMERAL_TYPE
9893 && TYPE_LANG_SPECIFIC (t
)
9894 && CLASSTYPE_IS_TEMPLATE (t
));
9895 /* If the member is a class template, then -- even after
9896 substitution -- there may be dependent types in the
9897 template argument list for the class. We increment
9898 PROCESSING_TEMPLATE_DECL so that dependent_type_p, as
9899 that function will assume that no types are dependent
9900 when outside of a template. */
9901 if (class_template_p
)
9902 ++processing_template_decl
;
9903 newtag
= tsubst (t
, args
, tf_error
, NULL_TREE
);
9904 if (class_template_p
)
9905 --processing_template_decl
;
9906 if (newtag
== error_mark_node
)
9909 if (TREE_CODE (newtag
) != ENUMERAL_TYPE
)
9911 tree name
= TYPE_IDENTIFIER (t
);
9913 if (class_template_p
)
9914 /* Unfortunately, lookup_template_class sets
9915 CLASSTYPE_IMPLICIT_INSTANTIATION for a partial
9916 instantiation (i.e., for the type of a member
9917 template class nested within a template class.)
9918 This behavior is required for
9919 maybe_process_partial_specialization to work
9920 correctly, but is not accurate in this case;
9921 the TAG is not an instantiation of anything.
9922 (The corresponding TEMPLATE_DECL is an
9923 instantiation, but the TYPE is not.) */
9924 CLASSTYPE_USE_TEMPLATE (newtag
) = 0;
9926 /* Now, we call pushtag to put this NEWTAG into the scope of
9927 TYPE. We first set up the IDENTIFIER_TYPE_VALUE to avoid
9928 pushtag calling push_template_decl. We don't have to do
9929 this for enums because it will already have been done in
9932 SET_IDENTIFIER_TYPE_VALUE (name
, newtag
);
9933 pushtag (name
, newtag
, /*tag_scope=*/ts_current
);
9936 else if (DECL_DECLARES_FUNCTION_P (t
))
9938 /* Build new TYPE_METHODS. */
9941 if (TREE_CODE (t
) == TEMPLATE_DECL
)
9942 ++processing_template_decl
;
9943 r
= tsubst (t
, args
, tf_error
, NULL_TREE
);
9944 if (TREE_CODE (t
) == TEMPLATE_DECL
)
9945 --processing_template_decl
;
9946 set_current_access_from_decl (r
);
9947 finish_member_declaration (r
);
9948 /* Instantiate members marked with attribute used. */
9949 if (r
!= error_mark_node
&& DECL_PRESERVE_P (r
))
9951 if (TREE_CODE (r
) == FUNCTION_DECL
9952 && DECL_OMP_DECLARE_REDUCTION_P (r
))
9953 cp_check_omp_declare_reduction (r
);
9955 else if (DECL_CLASS_TEMPLATE_P (t
)
9956 && LAMBDA_TYPE_P (TREE_TYPE (t
)))
9957 /* A closure type for a lambda in a default argument for a
9958 member template. Ignore it; it will be instantiated with
9959 the default argument. */;
9962 /* Build new TYPE_FIELDS. */
9963 if (TREE_CODE (t
) == STATIC_ASSERT
)
9967 ++c_inhibit_evaluation_warnings
;
9969 tsubst_expr (STATIC_ASSERT_CONDITION (t
), args
,
9970 tf_warning_or_error
, NULL_TREE
,
9971 /*integral_constant_expression_p=*/true);
9972 --c_inhibit_evaluation_warnings
;
9974 finish_static_assert (condition
,
9975 STATIC_ASSERT_MESSAGE (t
),
9976 STATIC_ASSERT_SOURCE_LOCATION (t
),
9979 else if (TREE_CODE (t
) != CONST_DECL
)
9982 tree vec
= NULL_TREE
;
9985 /* The file and line for this declaration, to
9986 assist in error message reporting. Since we
9987 called push_tinst_level above, we don't need to
9989 input_location
= DECL_SOURCE_LOCATION (t
);
9991 if (TREE_CODE (t
) == TEMPLATE_DECL
)
9992 ++processing_template_decl
;
9993 r
= tsubst (t
, args
, tf_warning_or_error
, NULL_TREE
);
9994 if (TREE_CODE (t
) == TEMPLATE_DECL
)
9995 --processing_template_decl
;
9997 if (TREE_CODE (r
) == TREE_VEC
)
9999 /* A capture pack became multiple fields. */
10001 len
= TREE_VEC_LENGTH (vec
);
10004 for (int i
= 0; i
< len
; ++i
)
10007 r
= TREE_VEC_ELT (vec
, i
);
10012 [t]he initialization (and any associated
10013 side-effects) of a static data member does
10014 not occur unless the static data member is
10015 itself used in a way that requires the
10016 definition of the static data member to
10019 Therefore, we do not substitute into the
10020 initialized for the static data member here. */
10021 finish_static_data_member_decl
10023 /*init=*/NULL_TREE
,
10024 /*init_const_expr_p=*/false,
10025 /*asmspec_tree=*/NULL_TREE
,
10027 /* Instantiate members marked with attribute used. */
10028 if (r
!= error_mark_node
&& DECL_PRESERVE_P (r
))
10031 else if (TREE_CODE (r
) == FIELD_DECL
)
10033 /* Determine whether R has a valid type and can be
10034 completed later. If R is invalid, then its type
10035 is replaced by error_mark_node. */
10036 tree rtype
= TREE_TYPE (r
);
10037 if (can_complete_type_without_circularity (rtype
))
10038 complete_type (rtype
);
10040 if (!COMPLETE_TYPE_P (rtype
))
10042 cxx_incomplete_type_error (r
, rtype
);
10043 TREE_TYPE (r
) = error_mark_node
;
10047 /* If it is a TYPE_DECL for a class-scoped ENUMERAL_TYPE,
10048 such a thing will already have been added to the field
10049 list by tsubst_enum in finish_member_declaration in the
10050 CLASSTYPE_NESTED_UTDS case above. */
10051 if (!(TREE_CODE (r
) == TYPE_DECL
10052 && TREE_CODE (TREE_TYPE (r
)) == ENUMERAL_TYPE
10053 && DECL_ARTIFICIAL (r
)))
10055 set_current_access_from_decl (r
);
10056 finish_member_declaration (r
);
10064 if (TYPE_P (t
) || DECL_CLASS_TEMPLATE_P (t
)
10065 || DECL_TEMPLATE_TEMPLATE_PARM_P (t
))
10067 /* Build new CLASSTYPE_FRIEND_CLASSES. */
10069 tree friend_type
= t
;
10070 bool adjust_processing_template_decl
= false;
10072 if (TREE_CODE (friend_type
) == TEMPLATE_DECL
)
10074 /* template <class T> friend class C; */
10075 friend_type
= tsubst_friend_class (friend_type
, args
);
10076 adjust_processing_template_decl
= true;
10078 else if (TREE_CODE (friend_type
) == UNBOUND_CLASS_TEMPLATE
)
10080 /* template <class T> friend class C::D; */
10081 friend_type
= tsubst (friend_type
, args
,
10082 tf_warning_or_error
, NULL_TREE
);
10083 if (TREE_CODE (friend_type
) == TEMPLATE_DECL
)
10084 friend_type
= TREE_TYPE (friend_type
);
10085 adjust_processing_template_decl
= true;
10087 else if (TREE_CODE (friend_type
) == TYPENAME_TYPE
10088 || TREE_CODE (friend_type
) == TEMPLATE_TYPE_PARM
)
10090 /* This could be either
10094 when dependent_type_p is false or
10096 template <class U> friend class T::C;
10099 friend_type
= tsubst (friend_type
, args
,
10100 tf_warning_or_error
, NULL_TREE
);
10101 /* Bump processing_template_decl for correct
10102 dependent_type_p calculation. */
10103 ++processing_template_decl
;
10104 if (dependent_type_p (friend_type
))
10105 adjust_processing_template_decl
= true;
10106 --processing_template_decl
;
10108 else if (!CLASSTYPE_USE_TEMPLATE (friend_type
)
10109 && hidden_name_p (TYPE_NAME (friend_type
)))
10113 where C hasn't been declared yet. Let's lookup name
10114 from namespace scope directly, bypassing any name that
10115 come from dependent base class. */
10116 tree ns
= decl_namespace_context (TYPE_MAIN_DECL (friend_type
));
10118 /* The call to xref_tag_from_type does injection for friend
10120 push_nested_namespace (ns
);
10122 xref_tag_from_type (friend_type
, NULL_TREE
,
10123 /*tag_scope=*/ts_current
);
10124 pop_nested_namespace (ns
);
10126 else if (uses_template_parms (friend_type
))
10127 /* friend class C<T>; */
10128 friend_type
= tsubst (friend_type
, args
,
10129 tf_warning_or_error
, NULL_TREE
);
10134 where C is already declared or
10136 friend class C<int>;
10138 We don't have to do anything in these cases. */
10140 if (adjust_processing_template_decl
)
10141 /* Trick make_friend_class into realizing that the friend
10142 we're adding is a template, not an ordinary class. It's
10143 important that we use make_friend_class since it will
10144 perform some error-checking and output cross-reference
10146 ++processing_template_decl
;
10148 if (friend_type
!= error_mark_node
)
10149 make_friend_class (type
, friend_type
, /*complain=*/false);
10151 if (adjust_processing_template_decl
)
10152 --processing_template_decl
;
10156 /* Build new DECL_FRIENDLIST. */
10159 /* The file and line for this declaration, to
10160 assist in error message reporting. Since we
10161 called push_tinst_level above, we don't need to
10163 input_location
= DECL_SOURCE_LOCATION (t
);
10165 if (TREE_CODE (t
) == TEMPLATE_DECL
)
10167 ++processing_template_decl
;
10168 push_deferring_access_checks (dk_no_check
);
10171 r
= tsubst_friend_function (t
, args
);
10172 add_friend (type
, r
, /*complain=*/false);
10173 if (TREE_CODE (t
) == TEMPLATE_DECL
)
10175 pop_deferring_access_checks ();
10176 --processing_template_decl
;
10184 /* Restore these before substituting into the lambda capture
10186 cp_unevaluated_operand
= saved_unevaluated_operand
;
10187 c_inhibit_evaluation_warnings
= saved_inhibit_evaluation_warnings
;
10190 if (tree expr
= CLASSTYPE_LAMBDA_EXPR (type
))
10192 tree decl
= lambda_function (type
);
10195 if (!DECL_TEMPLATE_INFO (decl
)
10196 || DECL_TEMPLATE_RESULT (DECL_TI_TEMPLATE (decl
)) != decl
)
10197 instantiate_decl (decl
, false, false);
10199 /* We need to instantiate the capture list from the template
10200 after we've instantiated the closure members, but before we
10201 consider adding the conversion op. Also keep any captures
10202 that may have been added during instantiation of the op(). */
10203 tree tmpl_expr
= CLASSTYPE_LAMBDA_EXPR (pattern
);
10205 = tsubst_copy_and_build (LAMBDA_EXPR_CAPTURE_LIST (tmpl_expr
),
10206 args
, tf_warning_or_error
, NULL_TREE
,
10209 LAMBDA_EXPR_CAPTURE_LIST (expr
)
10210 = chainon (tmpl_cap
, nreverse (LAMBDA_EXPR_CAPTURE_LIST (expr
)));
10212 maybe_add_lambda_conv_op (type
);
10215 gcc_assert (errorcount
);
10218 /* Set the file and line number information to whatever is given for
10219 the class itself. This puts error messages involving generated
10220 implicit functions at a predictable point, and the same point
10221 that would be used for non-template classes. */
10222 input_location
= DECL_SOURCE_LOCATION (typedecl
);
10224 unreverse_member_declarations (type
);
10225 finish_struct_1 (type
);
10226 TYPE_BEING_DEFINED (type
) = 0;
10228 /* We don't instantiate default arguments for member functions. 14.7.1:
10230 The implicit instantiation of a class template specialization causes
10231 the implicit instantiation of the declarations, but not of the
10232 definitions or default arguments, of the class member functions,
10233 member classes, static data members and member templates.... */
10235 /* Some typedefs referenced from within the template code need to be access
10236 checked at template instantiation time, i.e now. These types were
10237 added to the template at parsing time. Let's get those and perform
10238 the access checks then. */
10239 perform_typedefs_access_check (pattern
, args
);
10240 perform_deferred_access_checks (tf_warning_or_error
);
10241 pop_nested_class ();
10242 maximum_field_alignment
= saved_maximum_field_alignment
;
10244 pop_from_top_level ();
10245 pop_deferring_access_checks ();
10246 pop_tinst_level ();
10248 /* The vtable for a template class can be emitted in any translation
10249 unit in which the class is instantiated. When there is no key
10250 method, however, finish_struct_1 will already have added TYPE to
10251 the keyed_classes list. */
10252 if (TYPE_CONTAINS_VPTR_P (type
) && CLASSTYPE_KEY_METHOD (type
))
10253 keyed_classes
= tree_cons (NULL_TREE
, type
, keyed_classes
);
10258 /* Wrapper for instantiate_class_template_1. */
10261 instantiate_class_template (tree type
)
10264 timevar_push (TV_TEMPLATE_INST
);
10265 ret
= instantiate_class_template_1 (type
);
10266 timevar_pop (TV_TEMPLATE_INST
);
10271 tsubst_template_arg (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
10277 else if (TYPE_P (t
))
10278 r
= tsubst (t
, args
, complain
, in_decl
);
10281 if (!(complain
& tf_warning
))
10282 ++c_inhibit_evaluation_warnings
;
10283 r
= tsubst_expr (t
, args
, complain
, in_decl
,
10284 /*integral_constant_expression_p=*/true);
10285 if (!(complain
& tf_warning
))
10286 --c_inhibit_evaluation_warnings
;
10291 /* Given a function parameter pack TMPL_PARM and some function parameters
10292 instantiated from it at *SPEC_P, return a NONTYPE_ARGUMENT_PACK of them
10293 and set *SPEC_P to point at the next point in the list. */
10296 extract_fnparm_pack (tree tmpl_parm
, tree
*spec_p
)
10298 /* Collect all of the extra "packed" parameters into an
10302 tree argpack
= make_node (NONTYPE_ARGUMENT_PACK
);
10303 tree argtypepack
= cxx_make_type (TYPE_ARGUMENT_PACK
);
10304 tree spec_parm
= *spec_p
;
10307 for (len
= 0; spec_parm
; ++len
, spec_parm
= TREE_CHAIN (spec_parm
))
10309 && !function_parameter_expanded_from_pack_p (spec_parm
, tmpl_parm
))
10312 /* Fill in PARMVEC and PARMTYPEVEC with all of the parameters. */
10313 parmvec
= make_tree_vec (len
);
10314 parmtypevec
= make_tree_vec (len
);
10315 spec_parm
= *spec_p
;
10316 for (i
= 0; i
< len
; i
++, spec_parm
= DECL_CHAIN (spec_parm
))
10318 TREE_VEC_ELT (parmvec
, i
) = spec_parm
;
10319 TREE_VEC_ELT (parmtypevec
, i
) = TREE_TYPE (spec_parm
);
10322 /* Build the argument packs. */
10323 SET_ARGUMENT_PACK_ARGS (argpack
, parmvec
);
10324 SET_ARGUMENT_PACK_ARGS (argtypepack
, parmtypevec
);
10325 TREE_TYPE (argpack
) = argtypepack
;
10326 *spec_p
= spec_parm
;
10331 /* Give a chain SPEC_PARM of PARM_DECLs, pack them into a
10332 NONTYPE_ARGUMENT_PACK. */
10335 make_fnparm_pack (tree spec_parm
)
10337 return extract_fnparm_pack (NULL_TREE
, &spec_parm
);
10340 /* Return 1 if the Ith element of the argument pack ARG_PACK is a
10341 pack expansion with no extra args, 2 if it has extra args, or 0
10342 if it is not a pack expansion. */
10345 argument_pack_element_is_expansion_p (tree arg_pack
, int i
)
10347 tree vec
= ARGUMENT_PACK_ARGS (arg_pack
);
10348 if (i
>= TREE_VEC_LENGTH (vec
))
10350 tree elt
= TREE_VEC_ELT (vec
, i
);
10352 /* A decl pack is itself an expansion. */
10353 elt
= TREE_TYPE (elt
);
10354 if (!PACK_EXPANSION_P (elt
))
10356 if (PACK_EXPANSION_EXTRA_ARGS (elt
))
10362 /* Creates and return an ARGUMENT_PACK_SELECT tree node. */
10365 make_argument_pack_select (tree arg_pack
, unsigned index
)
10367 tree aps
= make_node (ARGUMENT_PACK_SELECT
);
10369 ARGUMENT_PACK_SELECT_FROM_PACK (aps
) = arg_pack
;
10370 ARGUMENT_PACK_SELECT_INDEX (aps
) = index
;
10375 /* This is a subroutine of tsubst_pack_expansion.
10377 It returns TRUE if we need to use the PACK_EXPANSION_EXTRA_ARGS
10378 mechanism to store the (non complete list of) arguments of the
10379 substitution and return a non substituted pack expansion, in order
10380 to wait for when we have enough arguments to really perform the
10384 use_pack_expansion_extra_args_p (tree parm_packs
,
10386 bool has_empty_arg
)
10388 /* If one pack has an expansion and another pack has a normal
10389 argument or if one pack has an empty argument and an another
10390 one hasn't then tsubst_pack_expansion cannot perform the
10391 substitution and need to fall back on the
10392 PACK_EXPANSION_EXTRA mechanism. */
10393 if (parm_packs
== NULL_TREE
)
10395 else if (has_empty_arg
)
10398 bool has_expansion_arg
= false;
10399 for (int i
= 0 ; i
< arg_pack_len
; ++i
)
10401 bool has_non_expansion_arg
= false;
10402 for (tree parm_pack
= parm_packs
;
10404 parm_pack
= TREE_CHAIN (parm_pack
))
10406 tree arg
= TREE_VALUE (parm_pack
);
10408 int exp
= argument_pack_element_is_expansion_p (arg
, i
);
10410 /* We can't substitute a pack expansion with extra args into
10414 has_expansion_arg
= true;
10416 has_non_expansion_arg
= true;
10419 if (has_expansion_arg
&& has_non_expansion_arg
)
10425 /* [temp.variadic]/6 says that:
10427 The instantiation of a pack expansion [...]
10428 produces a list E1,E2, ..., En, where N is the number of elements
10429 in the pack expansion parameters.
10431 This subroutine of tsubst_pack_expansion produces one of these Ei.
10433 PATTERN is the pattern of the pack expansion. PARM_PACKS is a
10434 TREE_LIST in which each TREE_PURPOSE is a parameter pack of
10435 PATTERN, and each TREE_VALUE is its corresponding argument pack.
10436 INDEX is the index 'i' of the element Ei to produce. ARGS,
10437 COMPLAIN, and IN_DECL are the same parameters as for the
10438 tsubst_pack_expansion function.
10440 The function returns the resulting Ei upon successful completion,
10441 or error_mark_node.
10443 Note that this function possibly modifies the ARGS parameter, so
10444 it's the responsibility of the caller to restore it. */
10447 gen_elem_of_pack_expansion_instantiation (tree pattern
,
10450 tree args
/* This parm gets
10452 tsubst_flags_t complain
,
10456 bool ith_elem_is_expansion
= false;
10458 /* For each parameter pack, change the substitution of the parameter
10459 pack to the ith argument in its argument pack, then expand the
10461 for (tree pack
= parm_packs
; pack
; pack
= TREE_CHAIN (pack
))
10463 tree parm
= TREE_PURPOSE (pack
);
10464 tree arg_pack
= TREE_VALUE (pack
);
10465 tree aps
; /* instance of ARGUMENT_PACK_SELECT. */
10467 ith_elem_is_expansion
|=
10468 argument_pack_element_is_expansion_p (arg_pack
, index
);
10470 /* Select the Ith argument from the pack. */
10471 if (TREE_CODE (parm
) == PARM_DECL
10472 || TREE_CODE (parm
) == FIELD_DECL
)
10476 aps
= make_argument_pack_select (arg_pack
, index
);
10477 if (!mark_used (parm
, complain
) && !(complain
& tf_error
))
10478 return error_mark_node
;
10479 register_local_specialization (aps
, parm
);
10482 aps
= retrieve_local_specialization (parm
);
10487 template_parm_level_and_index (parm
, &level
, &idx
);
10491 aps
= make_argument_pack_select (arg_pack
, index
);
10492 /* Update the corresponding argument. */
10493 TMPL_ARG (args
, level
, idx
) = aps
;
10496 /* Re-use the ARGUMENT_PACK_SELECT. */
10497 aps
= TMPL_ARG (args
, level
, idx
);
10499 ARGUMENT_PACK_SELECT_INDEX (aps
) = index
;
10502 /* Substitute into the PATTERN with the (possibly altered)
10504 if (pattern
== in_decl
)
10505 /* Expanding a fixed parameter pack from
10506 coerce_template_parameter_pack. */
10507 t
= tsubst_decl (pattern
, args
, complain
);
10508 else if (pattern
== error_mark_node
)
10509 t
= error_mark_node
;
10510 else if (constraint_p (pattern
))
10512 if (processing_template_decl
)
10513 t
= tsubst_constraint (pattern
, args
, complain
, in_decl
);
10515 t
= (constraints_satisfied_p (pattern
, args
)
10516 ? boolean_true_node
: boolean_false_node
);
10518 else if (!TYPE_P (pattern
))
10519 t
= tsubst_expr (pattern
, args
, complain
, in_decl
,
10520 /*integral_constant_expression_p=*/false);
10522 t
= tsubst (pattern
, args
, complain
, in_decl
);
10524 /* If the Ith argument pack element is a pack expansion, then
10525 the Ith element resulting from the substituting is going to
10526 be a pack expansion as well. */
10527 if (ith_elem_is_expansion
)
10528 t
= make_pack_expansion (t
);
10533 /* When the unexpanded parameter pack in a fold expression expands to an empty
10534 sequence, the value of the expression is as follows; the program is
10535 ill-formed if the operator is not listed in this table.
10546 expand_empty_fold (tree t
, tsubst_flags_t complain
)
10548 tree_code code
= (tree_code
)TREE_INT_CST_LOW (TREE_OPERAND (t
, 0));
10549 if (!FOLD_EXPR_MODIFY_P (t
))
10553 return integer_one_node
;
10555 return integer_zero_node
;
10557 return integer_minus_one_node
;
10559 return integer_zero_node
;
10560 case TRUTH_ANDIF_EXPR
:
10561 return boolean_true_node
;
10562 case TRUTH_ORIF_EXPR
:
10563 return boolean_false_node
;
10564 case COMPOUND_EXPR
:
10570 if (complain
& tf_error
)
10571 error_at (location_of (t
),
10572 "fold of empty expansion over %O", code
);
10573 return error_mark_node
;
10576 /* Given a fold-expression T and a current LEFT and RIGHT operand,
10577 form an expression that combines the two terms using the
10581 fold_expression (tree t
, tree left
, tree right
, tsubst_flags_t complain
)
10583 tree op
= FOLD_EXPR_OP (t
);
10584 tree_code code
= (tree_code
)TREE_INT_CST_LOW (op
);
10586 // Handle compound assignment operators.
10587 if (FOLD_EXPR_MODIFY_P (t
))
10588 return build_x_modify_expr (input_location
, left
, code
, right
, complain
);
10592 case COMPOUND_EXPR
:
10593 return build_x_compound_expr (input_location
, left
, right
, complain
);
10595 return build_m_component_ref (left
, right
, complain
);
10597 return build_x_binary_op (input_location
, code
,
10598 left
, TREE_CODE (left
),
10599 right
, TREE_CODE (right
),
10605 /* Substitute ARGS into the pack of a fold expression T. */
10608 tsubst_fold_expr_pack (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
10610 return tsubst_pack_expansion (FOLD_EXPR_PACK (t
), args
, complain
, in_decl
);
10613 /* Substitute ARGS into the pack of a fold expression T. */
10616 tsubst_fold_expr_init (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
10618 return tsubst_expr (FOLD_EXPR_INIT (t
), args
, complain
, in_decl
, false);
10621 /* Expand a PACK of arguments into a grouped as left fold.
10622 Given a pack containing elements A0, A1, ..., An and an
10623 operator @, this builds the expression:
10625 ((A0 @ A1) @ A2) ... @ An
10627 Note that PACK must not be empty.
10629 The operator is defined by the original fold expression T. */
10632 expand_left_fold (tree t
, tree pack
, tsubst_flags_t complain
)
10634 tree left
= TREE_VEC_ELT (pack
, 0);
10635 for (int i
= 1; i
< TREE_VEC_LENGTH (pack
); ++i
)
10637 tree right
= TREE_VEC_ELT (pack
, i
);
10638 left
= fold_expression (t
, left
, right
, complain
);
10643 /* Substitute into a unary left fold expression. */
10646 tsubst_unary_left_fold (tree t
, tree args
, tsubst_flags_t complain
,
10649 tree pack
= tsubst_fold_expr_pack (t
, args
, complain
, in_decl
);
10650 if (pack
== error_mark_node
)
10651 return error_mark_node
;
10652 if (TREE_VEC_LENGTH (pack
) == 0)
10653 return expand_empty_fold (t
, complain
);
10655 return expand_left_fold (t
, pack
, complain
);
10658 /* Substitute into a binary left fold expression.
10660 Do ths by building a single (non-empty) vector of argumnts and
10661 building the expression from those elements. */
10664 tsubst_binary_left_fold (tree t
, tree args
, tsubst_flags_t complain
,
10667 tree pack
= tsubst_fold_expr_pack (t
, args
, complain
, in_decl
);
10668 if (pack
== error_mark_node
)
10669 return error_mark_node
;
10670 tree init
= tsubst_fold_expr_init (t
, args
, complain
, in_decl
);
10671 if (init
== error_mark_node
)
10672 return error_mark_node
;
10674 tree vec
= make_tree_vec (TREE_VEC_LENGTH (pack
) + 1);
10675 TREE_VEC_ELT (vec
, 0) = init
;
10676 for (int i
= 0; i
< TREE_VEC_LENGTH (pack
); ++i
)
10677 TREE_VEC_ELT (vec
, i
+ 1) = TREE_VEC_ELT (pack
, i
);
10679 return expand_left_fold (t
, vec
, complain
);
10682 /* Expand a PACK of arguments into a grouped as right fold.
10683 Given a pack containing elementns A0, A1, ..., and an
10684 operator @, this builds the expression:
10686 A0@ ... (An-2 @ (An-1 @ An))
10688 Note that PACK must not be empty.
10690 The operator is defined by the original fold expression T. */
10693 expand_right_fold (tree t
, tree pack
, tsubst_flags_t complain
)
10695 // Build the expression.
10696 int n
= TREE_VEC_LENGTH (pack
);
10697 tree right
= TREE_VEC_ELT (pack
, n
- 1);
10698 for (--n
; n
!= 0; --n
)
10700 tree left
= TREE_VEC_ELT (pack
, n
- 1);
10701 right
= fold_expression (t
, left
, right
, complain
);
10706 /* Substitute into a unary right fold expression. */
10709 tsubst_unary_right_fold (tree t
, tree args
, tsubst_flags_t complain
,
10712 tree pack
= tsubst_fold_expr_pack (t
, args
, complain
, in_decl
);
10713 if (pack
== error_mark_node
)
10714 return error_mark_node
;
10715 if (TREE_VEC_LENGTH (pack
) == 0)
10716 return expand_empty_fold (t
, complain
);
10718 return expand_right_fold (t
, pack
, complain
);
10721 /* Substitute into a binary right fold expression.
10723 Do ths by building a single (non-empty) vector of arguments and
10724 building the expression from those elements. */
10727 tsubst_binary_right_fold (tree t
, tree args
, tsubst_flags_t complain
,
10730 tree pack
= tsubst_fold_expr_pack (t
, args
, complain
, in_decl
);
10731 if (pack
== error_mark_node
)
10732 return error_mark_node
;
10733 tree init
= tsubst_fold_expr_init (t
, args
, complain
, in_decl
);
10734 if (init
== error_mark_node
)
10735 return error_mark_node
;
10737 int n
= TREE_VEC_LENGTH (pack
);
10738 tree vec
= make_tree_vec (n
+ 1);
10739 for (int i
= 0; i
< n
; ++i
)
10740 TREE_VEC_ELT (vec
, i
) = TREE_VEC_ELT (pack
, i
);
10741 TREE_VEC_ELT (vec
, n
) = init
;
10743 return expand_right_fold (t
, vec
, complain
);
10747 /* Substitute ARGS into T, which is an pack expansion
10748 (i.e. TYPE_PACK_EXPANSION or EXPR_PACK_EXPANSION). Returns a
10749 TREE_VEC with the substituted arguments, a PACK_EXPANSION_* node
10750 (if only a partial substitution could be performed) or
10751 ERROR_MARK_NODE if there was an error. */
10753 tsubst_pack_expansion (tree t
, tree args
, tsubst_flags_t complain
,
10757 tree pack
, packs
= NULL_TREE
;
10758 bool unsubstituted_packs
= false;
10761 hash_map
<tree
, tree
> *saved_local_specializations
= NULL
;
10762 bool need_local_specializations
= false;
10765 gcc_assert (PACK_EXPANSION_P (t
));
10766 pattern
= PACK_EXPANSION_PATTERN (t
);
10768 /* Add in any args remembered from an earlier partial instantiation. */
10769 args
= add_to_template_args (PACK_EXPANSION_EXTRA_ARGS (t
), args
);
10771 levels
= TMPL_ARGS_DEPTH (args
);
10773 /* Determine the argument packs that will instantiate the parameter
10774 packs used in the expansion expression. While we're at it,
10775 compute the number of arguments to be expanded and make sure it
10777 for (pack
= PACK_EXPANSION_PARAMETER_PACKS (t
); pack
;
10778 pack
= TREE_CHAIN (pack
))
10780 tree parm_pack
= TREE_VALUE (pack
);
10781 tree arg_pack
= NULL_TREE
;
10782 tree orig_arg
= NULL_TREE
;
10785 if (TREE_CODE (parm_pack
) == BASES
)
10787 if (BASES_DIRECT (parm_pack
))
10788 return calculate_direct_bases (tsubst_expr (BASES_TYPE (parm_pack
),
10789 args
, complain
, in_decl
, false));
10791 return calculate_bases (tsubst_expr (BASES_TYPE (parm_pack
),
10792 args
, complain
, in_decl
, false));
10794 if (TREE_CODE (parm_pack
) == PARM_DECL
)
10796 /* We know we have correct local_specializations if this
10797 expansion is at function scope, or if we're dealing with a
10798 local parameter in a requires expression; for the latter,
10799 tsubst_requires_expr set it up appropriately. */
10800 if (PACK_EXPANSION_LOCAL_P (t
) || CONSTRAINT_VAR_P (parm_pack
))
10801 arg_pack
= retrieve_local_specialization (parm_pack
);
10804 /* We can't rely on local_specializations for a parameter
10805 name used later in a function declaration (such as in a
10806 late-specified return type). Even if it exists, it might
10807 have the wrong value for a recursive call. Just make a
10808 dummy decl, since it's only used for its type. */
10809 arg_pack
= tsubst_decl (parm_pack
, args
, complain
);
10810 if (arg_pack
&& DECL_PACK_P (arg_pack
))
10811 /* Partial instantiation of the parm_pack, we can't build
10812 up an argument pack yet. */
10813 arg_pack
= NULL_TREE
;
10815 arg_pack
= make_fnparm_pack (arg_pack
);
10816 need_local_specializations
= true;
10819 else if (TREE_CODE (parm_pack
) == FIELD_DECL
)
10820 arg_pack
= tsubst_copy (parm_pack
, args
, complain
, in_decl
);
10824 template_parm_level_and_index (parm_pack
, &level
, &idx
);
10826 if (level
<= levels
)
10827 arg_pack
= TMPL_ARG (args
, level
, idx
);
10830 orig_arg
= arg_pack
;
10831 if (arg_pack
&& TREE_CODE (arg_pack
) == ARGUMENT_PACK_SELECT
)
10832 arg_pack
= ARGUMENT_PACK_SELECT_FROM_PACK (arg_pack
);
10834 if (arg_pack
&& !ARGUMENT_PACK_P (arg_pack
))
10835 /* This can only happen if we forget to expand an argument
10836 pack somewhere else. Just return an error, silently. */
10838 result
= make_tree_vec (1);
10839 TREE_VEC_ELT (result
, 0) = error_mark_node
;
10846 TREE_VEC_LENGTH (ARGUMENT_PACK_ARGS (arg_pack
));
10848 /* Don't bother trying to do a partial substitution with
10849 incomplete packs; we'll try again after deduction. */
10850 if (ARGUMENT_PACK_INCOMPLETE_P (arg_pack
))
10855 else if (len
!= my_len
)
10857 if (!(complain
& tf_error
))
10858 /* Fail quietly. */;
10859 else if (TREE_CODE (t
) == TYPE_PACK_EXPANSION
)
10860 error ("mismatched argument pack lengths while expanding "
10864 error ("mismatched argument pack lengths while expanding "
10867 return error_mark_node
;
10870 /* Keep track of the parameter packs and their corresponding
10872 packs
= tree_cons (parm_pack
, arg_pack
, packs
);
10873 TREE_TYPE (packs
) = orig_arg
;
10877 /* We can't substitute for this parameter pack. We use a flag as
10878 well as the missing_level counter because function parameter
10879 packs don't have a level. */
10880 unsubstituted_packs
= true;
10884 /* If the expansion is just T..., return the matching argument pack. */
10885 if (!unsubstituted_packs
10886 && TREE_PURPOSE (packs
) == pattern
)
10888 tree args
= ARGUMENT_PACK_ARGS (TREE_VALUE (packs
));
10889 if (TREE_CODE (t
) == TYPE_PACK_EXPANSION
10890 || pack_expansion_args_count (args
))
10892 /* Otherwise use the normal path so we get convert_from_reference. */
10895 /* We cannot expand this expansion expression, because we don't have
10896 all of the argument packs we need. */
10897 if (use_pack_expansion_extra_args_p (packs
, len
, unsubstituted_packs
))
10899 /* We got some full packs, but we can't substitute them in until we
10900 have values for all the packs. So remember these until then. */
10902 t
= make_pack_expansion (pattern
);
10903 PACK_EXPANSION_EXTRA_ARGS (t
) = args
;
10906 else if (unsubstituted_packs
)
10908 /* There were no real arguments, we're just replacing a parameter
10909 pack with another version of itself. Substitute into the
10910 pattern and return a PACK_EXPANSION_*. The caller will need to
10912 if (TREE_CODE (t
) == EXPR_PACK_EXPANSION
)
10913 t
= tsubst_expr (pattern
, args
, complain
, in_decl
,
10914 /*integral_constant_expression_p=*/false);
10916 t
= tsubst (pattern
, args
, complain
, in_decl
);
10917 t
= make_pack_expansion (t
);
10921 gcc_assert (len
>= 0);
10923 if (need_local_specializations
)
10925 /* We're in a late-specified return type, so create our own local
10926 specializations map; the current map is either NULL or (in the
10927 case of recursive unification) might have bindings that we don't
10928 want to use or alter. */
10929 saved_local_specializations
= local_specializations
;
10930 local_specializations
= new hash_map
<tree
, tree
>;
10933 /* For each argument in each argument pack, substitute into the
10935 result
= make_tree_vec (len
);
10936 for (i
= 0; i
< len
; ++i
)
10938 t
= gen_elem_of_pack_expansion_instantiation (pattern
, packs
,
10942 TREE_VEC_ELT (result
, i
) = t
;
10943 if (t
== error_mark_node
)
10945 result
= error_mark_node
;
10950 /* Update ARGS to restore the substitution from parameter packs to
10951 their argument packs. */
10952 for (pack
= packs
; pack
; pack
= TREE_CHAIN (pack
))
10954 tree parm
= TREE_PURPOSE (pack
);
10956 if (TREE_CODE (parm
) == PARM_DECL
10957 || TREE_CODE (parm
) == FIELD_DECL
)
10958 register_local_specialization (TREE_TYPE (pack
), parm
);
10963 if (TREE_VALUE (pack
) == NULL_TREE
)
10966 template_parm_level_and_index (parm
, &level
, &idx
);
10968 /* Update the corresponding argument. */
10969 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (args
))
10970 TREE_VEC_ELT (TREE_VEC_ELT (args
, level
-1 ), idx
) =
10973 TREE_VEC_ELT (args
, idx
) = TREE_TYPE (pack
);
10977 if (need_local_specializations
)
10979 delete local_specializations
;
10980 local_specializations
= saved_local_specializations
;
10986 /* Given PARM_DECL PARM, find the corresponding PARM_DECL in the template
10987 TMPL. We do this using DECL_PARM_INDEX, which should work even with
10988 parameter packs; all parms generated from a function parameter pack will
10989 have the same DECL_PARM_INDEX. */
10992 get_pattern_parm (tree parm
, tree tmpl
)
10994 tree pattern
= DECL_TEMPLATE_RESULT (tmpl
);
10997 if (DECL_ARTIFICIAL (parm
))
10999 for (patparm
= DECL_ARGUMENTS (pattern
);
11000 patparm
; patparm
= DECL_CHAIN (patparm
))
11001 if (DECL_ARTIFICIAL (patparm
)
11002 && DECL_NAME (parm
) == DECL_NAME (patparm
))
11007 patparm
= FUNCTION_FIRST_USER_PARM (DECL_TEMPLATE_RESULT (tmpl
));
11008 patparm
= chain_index (DECL_PARM_INDEX (parm
)-1, patparm
);
11009 gcc_assert (DECL_PARM_INDEX (patparm
)
11010 == DECL_PARM_INDEX (parm
));
11016 /* Substitute ARGS into the vector or list of template arguments T. */
11019 tsubst_template_args (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
11022 int len
, need_new
= 0, i
, expanded_len_adjust
= 0, out
;
11025 if (t
== error_mark_node
)
11026 return error_mark_node
;
11028 len
= TREE_VEC_LENGTH (t
);
11029 elts
= XALLOCAVEC (tree
, len
);
11031 for (i
= 0; i
< len
; i
++)
11033 tree orig_arg
= TREE_VEC_ELT (t
, i
);
11036 if (TREE_CODE (orig_arg
) == TREE_VEC
)
11037 new_arg
= tsubst_template_args (orig_arg
, args
, complain
, in_decl
);
11038 else if (PACK_EXPANSION_P (orig_arg
))
11040 /* Substitute into an expansion expression. */
11041 new_arg
= tsubst_pack_expansion (orig_arg
, args
, complain
, in_decl
);
11043 if (TREE_CODE (new_arg
) == TREE_VEC
)
11044 /* Add to the expanded length adjustment the number of
11045 expanded arguments. We subtract one from this
11046 measurement, because the argument pack expression
11047 itself is already counted as 1 in
11048 LEN. EXPANDED_LEN_ADJUST can actually be negative, if
11049 the argument pack is empty. */
11050 expanded_len_adjust
+= TREE_VEC_LENGTH (new_arg
) - 1;
11052 else if (ARGUMENT_PACK_P (orig_arg
))
11054 /* Substitute into each of the arguments. */
11055 new_arg
= TYPE_P (orig_arg
)
11056 ? cxx_make_type (TREE_CODE (orig_arg
))
11057 : make_node (TREE_CODE (orig_arg
));
11059 SET_ARGUMENT_PACK_ARGS (
11061 tsubst_template_args (ARGUMENT_PACK_ARGS (orig_arg
),
11062 args
, complain
, in_decl
));
11064 if (ARGUMENT_PACK_ARGS (new_arg
) == error_mark_node
)
11065 new_arg
= error_mark_node
;
11067 if (TREE_CODE (new_arg
) == NONTYPE_ARGUMENT_PACK
) {
11068 TREE_TYPE (new_arg
) = tsubst (TREE_TYPE (orig_arg
), args
,
11069 complain
, in_decl
);
11070 TREE_CONSTANT (new_arg
) = TREE_CONSTANT (orig_arg
);
11072 if (TREE_TYPE (new_arg
) == error_mark_node
)
11073 new_arg
= error_mark_node
;
11077 new_arg
= tsubst_template_arg (orig_arg
, args
, complain
, in_decl
);
11079 if (new_arg
== error_mark_node
)
11080 return error_mark_node
;
11083 if (new_arg
!= orig_arg
)
11090 /* Make space for the expanded arguments coming from template
11092 t
= make_tree_vec (len
+ expanded_len_adjust
);
11093 /* ORIG_T can contain TREE_VECs. That happens if ORIG_T contains the
11094 arguments for a member template.
11095 In that case each TREE_VEC in ORIG_T represents a level of template
11096 arguments, and ORIG_T won't carry any non defaulted argument count.
11097 It will rather be the nested TREE_VECs that will carry one.
11098 In other words, ORIG_T carries a non defaulted argument count only
11099 if it doesn't contain any nested TREE_VEC. */
11100 if (NON_DEFAULT_TEMPLATE_ARGS_COUNT (orig_t
))
11102 int count
= GET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (orig_t
);
11103 count
+= expanded_len_adjust
;
11104 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (t
, count
);
11106 for (i
= 0, out
= 0; i
< len
; i
++)
11108 if ((PACK_EXPANSION_P (TREE_VEC_ELT (orig_t
, i
))
11109 || ARGUMENT_PACK_P (TREE_VEC_ELT (orig_t
, i
)))
11110 && TREE_CODE (elts
[i
]) == TREE_VEC
)
11114 /* Now expand the template argument pack "in place". */
11115 for (idx
= 0; idx
< TREE_VEC_LENGTH (elts
[i
]); idx
++, out
++)
11116 TREE_VEC_ELT (t
, out
) = TREE_VEC_ELT (elts
[i
], idx
);
11120 TREE_VEC_ELT (t
, out
) = elts
[i
];
11128 /* Return the result of substituting ARGS into the template parameters
11129 given by PARMS. If there are m levels of ARGS and m + n levels of
11130 PARMS, then the result will contain n levels of PARMS. For
11131 example, if PARMS is `template <class T> template <class U>
11132 template <T*, U, class V>' and ARGS is {{int}, {double}} then the
11133 result will be `template <int*, double, class V>'. */
11136 tsubst_template_parms (tree parms
, tree args
, tsubst_flags_t complain
)
11138 tree r
= NULL_TREE
;
11141 /* When substituting into a template, we must set
11142 PROCESSING_TEMPLATE_DECL as the template parameters may be
11143 dependent if they are based on one-another, and the dependency
11144 predicates are short-circuit outside of templates. */
11145 ++processing_template_decl
;
11147 for (new_parms
= &r
;
11148 parms
&& TMPL_PARMS_DEPTH (parms
) > TMPL_ARGS_DEPTH (args
);
11149 new_parms
= &(TREE_CHAIN (*new_parms
)),
11150 parms
= TREE_CHAIN (parms
))
11153 make_tree_vec (TREE_VEC_LENGTH (TREE_VALUE (parms
)));
11156 for (i
= 0; i
< TREE_VEC_LENGTH (new_vec
); ++i
)
11160 if (parms
== error_mark_node
)
11163 tuple
= TREE_VEC_ELT (TREE_VALUE (parms
), i
);
11165 if (tuple
== error_mark_node
)
11168 TREE_VEC_ELT (new_vec
, i
) =
11169 tsubst_template_parm (tuple
, args
, complain
);
11173 tree_cons (size_int (TMPL_PARMS_DEPTH (parms
)
11174 - TMPL_ARGS_DEPTH (args
)),
11175 new_vec
, NULL_TREE
);
11178 --processing_template_decl
;
11183 /* Return the result of substituting ARGS into one template parameter
11184 given by T. T Must be a TREE_LIST which TREE_VALUE is the template
11185 parameter and which TREE_PURPOSE is the default argument of the
11186 template parameter. */
11189 tsubst_template_parm (tree t
, tree args
, tsubst_flags_t complain
)
11191 tree default_value
, parm_decl
;
11193 if (args
== NULL_TREE
11195 || t
== error_mark_node
)
11198 gcc_assert (TREE_CODE (t
) == TREE_LIST
);
11200 default_value
= TREE_PURPOSE (t
);
11201 parm_decl
= TREE_VALUE (t
);
11203 parm_decl
= tsubst (parm_decl
, args
, complain
, NULL_TREE
);
11204 if (TREE_CODE (parm_decl
) == PARM_DECL
11205 && invalid_nontype_parm_type_p (TREE_TYPE (parm_decl
), complain
))
11206 parm_decl
= error_mark_node
;
11207 default_value
= tsubst_template_arg (default_value
, args
,
11208 complain
, NULL_TREE
);
11210 return build_tree_list (default_value
, parm_decl
);
11213 /* Substitute the ARGS into the indicated aggregate (or enumeration)
11214 type T. If T is not an aggregate or enumeration type, it is
11215 handled as if by tsubst. IN_DECL is as for tsubst. If
11216 ENTERING_SCOPE is nonzero, T is the context for a template which
11217 we are presently tsubst'ing. Return the substituted value. */
11220 tsubst_aggr_type (tree t
,
11222 tsubst_flags_t complain
,
11224 int entering_scope
)
11226 if (t
== NULL_TREE
)
11229 switch (TREE_CODE (t
))
11232 if (TYPE_PTRMEMFUNC_P (t
))
11233 return tsubst (TYPE_PTRMEMFUNC_FN_TYPE (t
), args
, complain
, in_decl
);
11235 /* Else fall through. */
11236 case ENUMERAL_TYPE
:
11238 if (TYPE_TEMPLATE_INFO (t
) && uses_template_parms (t
))
11243 int saved_unevaluated_operand
;
11244 int saved_inhibit_evaluation_warnings
;
11246 /* In "sizeof(X<I>)" we need to evaluate "I". */
11247 saved_unevaluated_operand
= cp_unevaluated_operand
;
11248 cp_unevaluated_operand
= 0;
11249 saved_inhibit_evaluation_warnings
= c_inhibit_evaluation_warnings
;
11250 c_inhibit_evaluation_warnings
= 0;
11252 /* First, determine the context for the type we are looking
11254 context
= TYPE_CONTEXT (t
);
11255 if (context
&& TYPE_P (context
))
11257 context
= tsubst_aggr_type (context
, args
, complain
,
11258 in_decl
, /*entering_scope=*/1);
11259 /* If context is a nested class inside a class template,
11260 it may still need to be instantiated (c++/33959). */
11261 context
= complete_type (context
);
11264 /* Then, figure out what arguments are appropriate for the
11265 type we are trying to find. For example, given:
11267 template <class T> struct S;
11268 template <class T, class U> void f(T, U) { S<U> su; }
11270 and supposing that we are instantiating f<int, double>,
11271 then our ARGS will be {int, double}, but, when looking up
11272 S we only want {double}. */
11273 argvec
= tsubst_template_args (TYPE_TI_ARGS (t
), args
,
11274 complain
, in_decl
);
11275 if (argvec
== error_mark_node
)
11276 r
= error_mark_node
;
11279 r
= lookup_template_class (t
, argvec
, in_decl
, context
,
11280 entering_scope
, complain
);
11281 r
= cp_build_qualified_type_real (r
, cp_type_quals (t
), complain
);
11284 cp_unevaluated_operand
= saved_unevaluated_operand
;
11285 c_inhibit_evaluation_warnings
= saved_inhibit_evaluation_warnings
;
11290 /* This is not a template type, so there's nothing to do. */
11294 return tsubst (t
, args
, complain
, in_decl
);
11298 /* Substitute into the default argument ARG (a default argument for
11299 FN), which has the indicated TYPE. */
11302 tsubst_default_argument (tree fn
, tree type
, tree arg
, tsubst_flags_t complain
)
11304 tree saved_class_ptr
= NULL_TREE
;
11305 tree saved_class_ref
= NULL_TREE
;
11306 int errs
= errorcount
+ sorrycount
;
11308 /* This can happen in invalid code. */
11309 if (TREE_CODE (arg
) == DEFAULT_ARG
)
11312 /* This default argument came from a template. Instantiate the
11313 default argument here, not in tsubst. In the case of
11322 we must be careful to do name lookup in the scope of S<T>,
11323 rather than in the current class. */
11324 push_access_scope (fn
);
11325 /* The "this" pointer is not valid in a default argument. */
11328 saved_class_ptr
= current_class_ptr
;
11329 cp_function_chain
->x_current_class_ptr
= NULL_TREE
;
11330 saved_class_ref
= current_class_ref
;
11331 cp_function_chain
->x_current_class_ref
= NULL_TREE
;
11334 push_deferring_access_checks(dk_no_deferred
);
11335 /* The default argument expression may cause implicitly defined
11336 member functions to be synthesized, which will result in garbage
11337 collection. We must treat this situation as if we were within
11338 the body of function so as to avoid collecting live data on the
11341 arg
= tsubst_expr (arg
, DECL_TI_ARGS (fn
),
11342 complain
, NULL_TREE
,
11343 /*integral_constant_expression_p=*/false);
11345 pop_deferring_access_checks();
11347 /* Restore the "this" pointer. */
11350 cp_function_chain
->x_current_class_ptr
= saved_class_ptr
;
11351 cp_function_chain
->x_current_class_ref
= saved_class_ref
;
11354 if (errorcount
+sorrycount
> errs
11355 && (complain
& tf_warning_or_error
))
11356 inform (input_location
,
11357 " when instantiating default argument for call to %D", fn
);
11359 /* Make sure the default argument is reasonable. */
11360 arg
= check_default_argument (type
, arg
, complain
);
11362 pop_access_scope (fn
);
11367 /* Substitute into all the default arguments for FN. */
11370 tsubst_default_arguments (tree fn
, tsubst_flags_t complain
)
11375 tmpl_args
= DECL_TI_ARGS (fn
);
11377 /* If this function is not yet instantiated, we certainly don't need
11378 its default arguments. */
11379 if (uses_template_parms (tmpl_args
))
11381 /* Don't do this again for clones. */
11382 if (DECL_CLONED_FUNCTION_P (fn
))
11385 for (arg
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
11387 arg
= TREE_CHAIN (arg
))
11388 if (TREE_PURPOSE (arg
))
11389 TREE_PURPOSE (arg
) = tsubst_default_argument (fn
,
11391 TREE_PURPOSE (arg
),
11395 /* Substitute the ARGS into the T, which is a _DECL. Return the
11396 result of the substitution. Issue error and warning messages under
11397 control of COMPLAIN. */
11400 tsubst_decl (tree t
, tree args
, tsubst_flags_t complain
)
11402 #define RETURN(EXP) do { r = (EXP); goto out; } while(0)
11403 location_t saved_loc
;
11404 tree r
= NULL_TREE
;
11406 hashval_t hash
= 0;
11408 /* Set the filename and linenumber to improve error-reporting. */
11409 saved_loc
= input_location
;
11410 input_location
= DECL_SOURCE_LOCATION (t
);
11412 switch (TREE_CODE (t
))
11414 case TEMPLATE_DECL
:
11416 /* We can get here when processing a member function template,
11417 member class template, or template template parameter. */
11418 tree decl
= DECL_TEMPLATE_RESULT (t
);
11423 if (DECL_TEMPLATE_TEMPLATE_PARM_P (t
))
11425 /* Template template parameter is treated here. */
11426 tree new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
11427 if (new_type
== error_mark_node
)
11428 r
= error_mark_node
;
11429 /* If we get a real template back, return it. This can happen in
11430 the context of most_specialized_partial_spec. */
11431 else if (TREE_CODE (new_type
) == TEMPLATE_DECL
)
11434 /* The new TEMPLATE_DECL was built in
11435 reduce_template_parm_level. */
11436 r
= TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL (new_type
);
11440 /* We might already have an instance of this template.
11441 The ARGS are for the surrounding class type, so the
11442 full args contain the tsubst'd args for the context,
11443 plus the innermost args from the template decl. */
11444 tmpl_args
= DECL_CLASS_TEMPLATE_P (t
)
11445 ? CLASSTYPE_TI_ARGS (TREE_TYPE (t
))
11446 : DECL_TI_ARGS (DECL_TEMPLATE_RESULT (t
));
11447 /* Because this is a template, the arguments will still be
11448 dependent, even after substitution. If
11449 PROCESSING_TEMPLATE_DECL is not set, the dependency
11450 predicates will short-circuit. */
11451 ++processing_template_decl
;
11452 full_args
= tsubst_template_args (tmpl_args
, args
,
11453 complain
, in_decl
);
11454 --processing_template_decl
;
11455 if (full_args
== error_mark_node
)
11456 RETURN (error_mark_node
);
11458 /* If this is a default template template argument,
11459 tsubst might not have changed anything. */
11460 if (full_args
== tmpl_args
)
11463 hash
= hash_tmpl_and_args (t
, full_args
);
11464 spec
= retrieve_specialization (t
, full_args
, hash
);
11465 if (spec
!= NULL_TREE
)
11471 /* Make a new template decl. It will be similar to the
11472 original, but will record the current template arguments.
11473 We also create a new function declaration, which is just
11474 like the old one, but points to this new template, rather
11475 than the old one. */
11477 gcc_assert (DECL_LANG_SPECIFIC (r
) != 0);
11478 DECL_CHAIN (r
) = NULL_TREE
;
11480 // Build new template info linking to the original template decl.
11481 DECL_TEMPLATE_INFO (r
) = build_template_info (t
, args
);
11483 if (TREE_CODE (decl
) == TYPE_DECL
11484 && !TYPE_DECL_ALIAS_P (decl
))
11487 ++processing_template_decl
;
11488 new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
11489 --processing_template_decl
;
11490 if (new_type
== error_mark_node
)
11491 RETURN (error_mark_node
);
11493 TREE_TYPE (r
) = new_type
;
11494 /* For a partial specialization, we need to keep pointing to
11495 the primary template. */
11496 if (!DECL_TEMPLATE_SPECIALIZATION (t
))
11497 CLASSTYPE_TI_TEMPLATE (new_type
) = r
;
11498 DECL_TEMPLATE_RESULT (r
) = TYPE_MAIN_DECL (new_type
);
11499 DECL_TI_ARGS (r
) = CLASSTYPE_TI_ARGS (new_type
);
11500 DECL_CONTEXT (r
) = TYPE_CONTEXT (new_type
);
11505 ++processing_template_decl
;
11506 new_decl
= tsubst (decl
, args
, complain
, in_decl
);
11507 --processing_template_decl
;
11508 if (new_decl
== error_mark_node
)
11509 RETURN (error_mark_node
);
11511 DECL_TEMPLATE_RESULT (r
) = new_decl
;
11512 DECL_TI_TEMPLATE (new_decl
) = r
;
11513 TREE_TYPE (r
) = TREE_TYPE (new_decl
);
11514 DECL_TI_ARGS (r
) = DECL_TI_ARGS (new_decl
);
11515 DECL_CONTEXT (r
) = DECL_CONTEXT (new_decl
);
11518 SET_DECL_IMPLICIT_INSTANTIATION (r
);
11519 DECL_TEMPLATE_INSTANTIATIONS (r
) = NULL_TREE
;
11520 DECL_TEMPLATE_SPECIALIZATIONS (r
) = NULL_TREE
;
11522 /* The template parameters for this new template are all the
11523 template parameters for the old template, except the
11524 outermost level of parameters. */
11525 DECL_TEMPLATE_PARMS (r
)
11526 = tsubst_template_parms (DECL_TEMPLATE_PARMS (t
), args
,
11529 if (PRIMARY_TEMPLATE_P (t
))
11530 DECL_PRIMARY_TEMPLATE (r
) = r
;
11532 if (TREE_CODE (decl
) != TYPE_DECL
&& !VAR_P (decl
))
11533 /* Record this non-type partial instantiation. */
11534 register_specialization (r
, t
,
11535 DECL_TI_ARGS (DECL_TEMPLATE_RESULT (r
)),
11540 case FUNCTION_DECL
:
11543 tree argvec
= NULL_TREE
;
11551 /* Nobody should be tsubst'ing into non-template functions. */
11552 gcc_assert (DECL_TEMPLATE_INFO (t
) != NULL_TREE
);
11554 if (TREE_CODE (DECL_TI_TEMPLATE (t
)) == TEMPLATE_DECL
)
11559 /* If T is not dependent, just return it. We have to
11560 increment PROCESSING_TEMPLATE_DECL because
11561 value_dependent_expression_p assumes that nothing is
11562 dependent when PROCESSING_TEMPLATE_DECL is zero. */
11563 ++processing_template_decl
;
11564 dependent_p
= value_dependent_expression_p (t
);
11565 --processing_template_decl
;
11569 /* Calculate the most general template of which R is a
11570 specialization, and the complete set of arguments used to
11572 gen_tmpl
= most_general_template (DECL_TI_TEMPLATE (t
));
11573 argvec
= tsubst_template_args (DECL_TI_ARGS
11574 (DECL_TEMPLATE_RESULT
11575 (DECL_TI_TEMPLATE (t
))),
11576 args
, complain
, in_decl
);
11577 if (argvec
== error_mark_node
)
11578 RETURN (error_mark_node
);
11580 /* Check to see if we already have this specialization. */
11581 hash
= hash_tmpl_and_args (gen_tmpl
, argvec
);
11582 spec
= retrieve_specialization (gen_tmpl
, argvec
, hash
);
11590 /* We can see more levels of arguments than parameters if
11591 there was a specialization of a member template, like
11594 template <class T> struct S { template <class U> void f(); }
11595 template <> template <class U> void S<int>::f(U);
11597 Here, we'll be substituting into the specialization,
11598 because that's where we can find the code we actually
11599 want to generate, but we'll have enough arguments for
11600 the most general template.
11602 We also deal with the peculiar case:
11604 template <class T> struct S {
11605 template <class U> friend void f();
11607 template <class U> void f() {}
11609 template void f<double>();
11611 Here, the ARGS for the instantiation of will be {int,
11612 double}. But, we only need as many ARGS as there are
11613 levels of template parameters in CODE_PATTERN. We are
11614 careful not to get fooled into reducing the ARGS in
11617 template <class T> struct S { template <class U> void f(U); }
11618 template <class T> template <> void S<T>::f(int) {}
11620 which we can spot because the pattern will be a
11621 specialization in this case. */
11622 args_depth
= TMPL_ARGS_DEPTH (args
);
11624 TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (DECL_TI_TEMPLATE (t
)));
11625 if (args_depth
> parms_depth
11626 && !DECL_TEMPLATE_SPECIALIZATION (t
))
11627 args
= get_innermost_template_args (args
, parms_depth
);
11631 /* This special case arises when we have something like this:
11633 template <class T> struct S {
11634 friend void f<int>(int, double);
11637 Here, the DECL_TI_TEMPLATE for the friend declaration
11638 will be an IDENTIFIER_NODE. We are being called from
11639 tsubst_friend_function, and we want only to create a
11640 new decl (R) with appropriate types so that we can call
11641 determine_specialization. */
11642 gen_tmpl
= NULL_TREE
;
11645 if (DECL_CLASS_SCOPE_P (t
))
11647 if (DECL_NAME (t
) == constructor_name (DECL_CONTEXT (t
)))
11651 ctx
= tsubst_aggr_type (DECL_CONTEXT (t
), args
,
11652 complain
, t
, /*entering_scope=*/1);
11657 ctx
= DECL_CONTEXT (t
);
11659 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
11660 if (type
== error_mark_node
)
11661 RETURN (error_mark_node
);
11663 /* If we hit excessive deduction depth, the type is bogus even if
11664 it isn't error_mark_node, so don't build a decl. */
11665 if (excessive_deduction_depth
)
11666 RETURN (error_mark_node
);
11668 /* We do NOT check for matching decls pushed separately at this
11669 point, as they may not represent instantiations of this
11670 template, and in any case are considered separate under the
11673 DECL_USE_TEMPLATE (r
) = 0;
11674 TREE_TYPE (r
) = type
;
11675 /* Clear out the mangled name and RTL for the instantiation. */
11676 SET_DECL_ASSEMBLER_NAME (r
, NULL_TREE
);
11677 SET_DECL_RTL (r
, NULL
);
11678 /* Leave DECL_INITIAL set on deleted instantiations. */
11679 if (!DECL_DELETED_FN (r
))
11680 DECL_INITIAL (r
) = NULL_TREE
;
11681 DECL_CONTEXT (r
) = ctx
;
11683 /* OpenMP UDRs have the only argument a reference to the declared
11684 type. We want to diagnose if the declared type is a reference,
11685 which is invalid, but as references to references are usually
11686 quietly merged, diagnose it here. */
11687 if (DECL_OMP_DECLARE_REDUCTION_P (t
))
11690 = TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (t
))));
11691 argtype
= tsubst (argtype
, args
, complain
, in_decl
);
11692 if (TREE_CODE (argtype
) == REFERENCE_TYPE
)
11693 error_at (DECL_SOURCE_LOCATION (t
),
11694 "reference type %qT in "
11695 "%<#pragma omp declare reduction%>", argtype
);
11696 if (strchr (IDENTIFIER_POINTER (DECL_NAME (t
)), '~') == NULL
)
11697 DECL_NAME (r
) = omp_reduction_id (ERROR_MARK
, DECL_NAME (t
),
11701 if (member
&& DECL_CONV_FN_P (r
))
11702 /* Type-conversion operator. Reconstruct the name, in
11703 case it's the name of one of the template's parameters. */
11704 DECL_NAME (r
) = mangle_conv_op_name_for_type (TREE_TYPE (type
));
11706 DECL_ARGUMENTS (r
) = tsubst (DECL_ARGUMENTS (t
), args
,
11708 DECL_RESULT (r
) = NULL_TREE
;
11710 TREE_STATIC (r
) = 0;
11711 TREE_PUBLIC (r
) = TREE_PUBLIC (t
);
11712 DECL_EXTERNAL (r
) = 1;
11713 /* If this is an instantiation of a function with internal
11714 linkage, we already know what object file linkage will be
11715 assigned to the instantiation. */
11716 DECL_INTERFACE_KNOWN (r
) = !TREE_PUBLIC (r
);
11717 DECL_DEFER_OUTPUT (r
) = 0;
11718 DECL_CHAIN (r
) = NULL_TREE
;
11719 DECL_PENDING_INLINE_INFO (r
) = 0;
11720 DECL_PENDING_INLINE_P (r
) = 0;
11721 DECL_SAVED_TREE (r
) = NULL_TREE
;
11722 DECL_STRUCT_FUNCTION (r
) = NULL
;
11724 /* We'll re-clone as appropriate in instantiate_template. */
11725 DECL_CLONED_FUNCTION (r
) = NULL_TREE
;
11727 /* If we aren't complaining now, return on error before we register
11728 the specialization so that we'll complain eventually. */
11729 if ((complain
& tf_error
) == 0
11730 && IDENTIFIER_OPNAME_P (DECL_NAME (r
))
11731 && !grok_op_properties (r
, /*complain=*/false))
11732 RETURN (error_mark_node
);
11734 /* When instantiating a constrained member, substitute
11735 into the constraints to create a new constraint. */
11736 if (tree ci
= get_constraints (t
))
11739 ci
= tsubst_constraint_info (ci
, argvec
, complain
, NULL_TREE
);
11740 set_constraints (r
, ci
);
11743 /* Set up the DECL_TEMPLATE_INFO for R. There's no need to do
11744 this in the special friend case mentioned above where
11745 GEN_TMPL is NULL. */
11748 DECL_TEMPLATE_INFO (r
)
11749 = build_template_info (gen_tmpl
, argvec
);
11750 SET_DECL_IMPLICIT_INSTANTIATION (r
);
11753 = register_specialization (r
, gen_tmpl
, argvec
, false, hash
);
11755 /* We instantiated this while substituting into
11756 the type earlier (template/friend54.C). */
11759 /* We're not supposed to instantiate default arguments
11760 until they are called, for a template. But, for a
11763 template <class T> void f ()
11764 { extern void g(int i = T()); }
11766 we should do the substitution when the template is
11767 instantiated. We handle the member function case in
11768 instantiate_class_template since the default arguments
11769 might refer to other members of the class. */
11771 && !PRIMARY_TEMPLATE_P (gen_tmpl
)
11772 && !uses_template_parms (argvec
))
11773 tsubst_default_arguments (r
, complain
);
11776 DECL_TEMPLATE_INFO (r
) = NULL_TREE
;
11778 /* Copy the list of befriending classes. */
11779 for (friends
= &DECL_BEFRIENDING_CLASSES (r
);
11781 friends
= &TREE_CHAIN (*friends
))
11783 *friends
= copy_node (*friends
);
11784 TREE_VALUE (*friends
) = tsubst (TREE_VALUE (*friends
),
11789 if (DECL_CONSTRUCTOR_P (r
) || DECL_DESTRUCTOR_P (r
))
11791 maybe_retrofit_in_chrg (r
);
11792 if (DECL_CONSTRUCTOR_P (r
))
11793 grok_ctor_properties (ctx
, r
);
11794 if (DECL_INHERITED_CTOR_BASE (r
))
11795 deduce_inheriting_ctor (r
);
11796 /* If this is an instantiation of a member template, clone it.
11797 If it isn't, that'll be handled by
11798 clone_constructors_and_destructors. */
11799 if (PRIMARY_TEMPLATE_P (gen_tmpl
))
11800 clone_function_decl (r
, /*update_method_vec_p=*/0);
11802 else if ((complain
& tf_error
) != 0
11803 && IDENTIFIER_OPNAME_P (DECL_NAME (r
))
11804 && !grok_op_properties (r
, /*complain=*/true))
11805 RETURN (error_mark_node
);
11807 if (DECL_FRIEND_P (t
) && DECL_FRIEND_CONTEXT (t
))
11808 SET_DECL_FRIEND_CONTEXT (r
,
11809 tsubst (DECL_FRIEND_CONTEXT (t
),
11810 args
, complain
, in_decl
));
11812 /* Possibly limit visibility based on template args. */
11813 DECL_VISIBILITY (r
) = VISIBILITY_DEFAULT
;
11814 if (DECL_VISIBILITY_SPECIFIED (t
))
11816 DECL_VISIBILITY_SPECIFIED (r
) = 0;
11817 DECL_ATTRIBUTES (r
)
11818 = remove_attribute ("visibility", DECL_ATTRIBUTES (r
));
11820 determine_visibility (r
);
11821 if (DECL_DEFAULTED_OUTSIDE_CLASS_P (r
)
11822 && !processing_template_decl
)
11823 defaulted_late_check (r
);
11825 apply_late_template_attributes (&r
, DECL_ATTRIBUTES (r
), 0,
11826 args
, complain
, in_decl
);
11832 tree type
= NULL_TREE
;
11834 tree expanded_types
= NULL_TREE
;
11835 tree prev_r
= NULL_TREE
;
11836 tree first_r
= NULL_TREE
;
11838 if (DECL_PACK_P (t
))
11840 /* If there is a local specialization that isn't a
11841 parameter pack, it means that we're doing a "simple"
11842 substitution from inside tsubst_pack_expansion. Just
11843 return the local specialization (which will be a single
11845 tree spec
= retrieve_local_specialization (t
);
11847 && TREE_CODE (spec
) == PARM_DECL
11848 && TREE_CODE (TREE_TYPE (spec
)) != TYPE_PACK_EXPANSION
)
11851 /* Expand the TYPE_PACK_EXPANSION that provides the types for
11852 the parameters in this function parameter pack. */
11853 expanded_types
= tsubst_pack_expansion (TREE_TYPE (t
), args
,
11854 complain
, in_decl
);
11855 if (TREE_CODE (expanded_types
) == TREE_VEC
)
11857 len
= TREE_VEC_LENGTH (expanded_types
);
11859 /* Zero-length parameter packs are boring. Just substitute
11862 RETURN (tsubst (TREE_CHAIN (t
), args
, complain
,
11867 /* All we did was update the type. Make a note of that. */
11868 type
= expanded_types
;
11869 expanded_types
= NULL_TREE
;
11873 /* Loop through all of the parameters we'll build. When T is
11874 a function parameter pack, LEN is the number of expanded
11875 types in EXPANDED_TYPES; otherwise, LEN is 1. */
11877 for (i
= 0; i
< len
; ++i
)
11881 if (DECL_TEMPLATE_PARM_P (t
))
11882 SET_DECL_TEMPLATE_PARM_P (r
);
11884 if (expanded_types
)
11885 /* We're on the Ith parameter of the function parameter
11888 /* Get the Ith type. */
11889 type
= TREE_VEC_ELT (expanded_types
, i
);
11891 /* Rename the parameter to include the index. */
11893 = make_ith_pack_parameter_name (DECL_NAME (r
), i
);
11896 /* We're dealing with a normal parameter. */
11897 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
11899 type
= type_decays_to (type
);
11900 TREE_TYPE (r
) = type
;
11901 cp_apply_type_quals_to_decl (cp_type_quals (type
), r
);
11903 if (DECL_INITIAL (r
))
11905 if (TREE_CODE (DECL_INITIAL (r
)) != TEMPLATE_PARM_INDEX
)
11906 DECL_INITIAL (r
) = TREE_TYPE (r
);
11908 DECL_INITIAL (r
) = tsubst (DECL_INITIAL (r
), args
,
11909 complain
, in_decl
);
11912 DECL_CONTEXT (r
) = NULL_TREE
;
11914 if (!DECL_TEMPLATE_PARM_P (r
))
11915 DECL_ARG_TYPE (r
) = type_passed_as (type
);
11917 apply_late_template_attributes (&r
, DECL_ATTRIBUTES (r
), 0,
11918 args
, complain
, in_decl
);
11920 /* Keep track of the first new parameter we
11921 generate. That's what will be returned to the
11926 /* Build a proper chain of parameters when substituting
11927 into a function parameter pack. */
11929 DECL_CHAIN (prev_r
) = r
;
11932 /* If cp_unevaluated_operand is set, we're just looking for a
11933 single dummy parameter, so don't keep going. */
11934 if (DECL_CHAIN (t
) && !cp_unevaluated_operand
)
11935 DECL_CHAIN (r
) = tsubst (DECL_CHAIN (t
), args
,
11936 complain
, DECL_CHAIN (t
));
11938 /* FIRST_R contains the start of the chain we've built. */
11945 tree type
= NULL_TREE
;
11946 tree vec
= NULL_TREE
;
11947 tree expanded_types
= NULL_TREE
;
11950 if (PACK_EXPANSION_P (TREE_TYPE (t
)))
11952 /* This field is a lambda capture pack. Return a TREE_VEC of
11953 the expanded fields to instantiate_class_template_1 and
11954 store them in the specializations hash table as a
11955 NONTYPE_ARGUMENT_PACK so that tsubst_copy can find them. */
11956 expanded_types
= tsubst_pack_expansion (TREE_TYPE (t
), args
,
11957 complain
, in_decl
);
11958 if (TREE_CODE (expanded_types
) == TREE_VEC
)
11960 len
= TREE_VEC_LENGTH (expanded_types
);
11961 vec
= make_tree_vec (len
);
11965 /* All we did was update the type. Make a note of that. */
11966 type
= expanded_types
;
11967 expanded_types
= NULL_TREE
;
11971 for (int i
= 0; i
< len
; ++i
)
11974 if (expanded_types
)
11976 type
= TREE_VEC_ELT (expanded_types
, i
);
11978 = make_ith_pack_parameter_name (DECL_NAME (r
), i
);
11981 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
11983 if (type
== error_mark_node
)
11984 RETURN (error_mark_node
);
11985 TREE_TYPE (r
) = type
;
11986 cp_apply_type_quals_to_decl (cp_type_quals (type
), r
);
11988 if (DECL_C_BIT_FIELD (r
))
11989 /* For bit-fields, DECL_INITIAL gives the number of bits. For
11990 non-bit-fields DECL_INITIAL is a non-static data member
11991 initializer, which gets deferred instantiation. */
11993 = tsubst_expr (DECL_INITIAL (t
), args
,
11995 /*integral_constant_expression_p=*/true);
11996 else if (DECL_INITIAL (t
))
11998 /* Set up DECL_TEMPLATE_INFO so that we can get at the
11999 NSDMI in perform_member_init. Still set DECL_INITIAL
12000 so that we know there is one. */
12001 DECL_INITIAL (r
) = void_node
;
12002 gcc_assert (DECL_LANG_SPECIFIC (r
) == NULL
);
12003 retrofit_lang_decl (r
);
12004 DECL_TEMPLATE_INFO (r
) = build_template_info (t
, args
);
12006 /* We don't have to set DECL_CONTEXT here; it is set by
12007 finish_member_declaration. */
12008 DECL_CHAIN (r
) = NULL_TREE
;
12010 apply_late_template_attributes (&r
, DECL_ATTRIBUTES (r
), 0,
12011 args
, complain
, in_decl
);
12014 TREE_VEC_ELT (vec
, i
) = r
;
12020 tree pack
= make_node (NONTYPE_ARGUMENT_PACK
);
12021 tree tpack
= cxx_make_type (TYPE_ARGUMENT_PACK
);
12022 SET_ARGUMENT_PACK_ARGS (pack
, vec
);
12023 SET_ARGUMENT_PACK_ARGS (tpack
, expanded_types
);
12024 TREE_TYPE (pack
) = tpack
;
12025 register_specialization (pack
, t
, args
, false, 0);
12031 /* We reach here only for member using decls. We also need to check
12032 uses_template_parms because DECL_DEPENDENT_P is not set for a
12033 using-declaration that designates a member of the current
12034 instantiation (c++/53549). */
12035 if (DECL_DEPENDENT_P (t
)
12036 || uses_template_parms (USING_DECL_SCOPE (t
)))
12038 tree inst_scope
= tsubst_copy (USING_DECL_SCOPE (t
), args
,
12039 complain
, in_decl
);
12040 tree name
= tsubst_copy (DECL_NAME (t
), args
, complain
, in_decl
);
12041 r
= do_class_using_decl (inst_scope
, name
);
12043 r
= error_mark_node
;
12046 TREE_PROTECTED (r
) = TREE_PROTECTED (t
);
12047 TREE_PRIVATE (r
) = TREE_PRIVATE (t
);
12053 DECL_CHAIN (r
) = NULL_TREE
;
12060 tree argvec
= NULL_TREE
;
12061 tree gen_tmpl
= NULL_TREE
;
12063 tree tmpl
= NULL_TREE
;
12065 tree type
= NULL_TREE
;
12068 if (TREE_TYPE (t
) == error_mark_node
)
12069 RETURN (error_mark_node
);
12071 if (TREE_CODE (t
) == TYPE_DECL
12072 && t
== TYPE_MAIN_DECL (TREE_TYPE (t
)))
12074 /* If this is the canonical decl, we don't have to
12075 mess with instantiations, and often we can't (for
12076 typename, template type parms and such). Note that
12077 TYPE_NAME is not correct for the above test if
12078 we've copied the type for a typedef. */
12079 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
12080 if (type
== error_mark_node
)
12081 RETURN (error_mark_node
);
12082 r
= TYPE_NAME (type
);
12086 /* Check to see if we already have the specialization we
12089 if (DECL_CLASS_SCOPE_P (t
) || DECL_NAMESPACE_SCOPE_P (t
))
12091 /* T is a static data member or namespace-scope entity.
12092 We have to substitute into namespace-scope variables
12093 (not just variable templates) because of cases like:
12095 template <class T> void f() { extern T t; }
12097 where the entity referenced is not known until
12098 instantiation time. */
12100 ctx
= DECL_CONTEXT (t
);
12101 if (DECL_CLASS_SCOPE_P (t
))
12103 ctx
= tsubst_aggr_type (ctx
, args
,
12105 in_decl
, /*entering_scope=*/1);
12106 /* If CTX is unchanged, then T is in fact the
12107 specialization we want. That situation occurs when
12108 referencing a static data member within in its own
12109 class. We can use pointer equality, rather than
12110 same_type_p, because DECL_CONTEXT is always
12112 if (ctx
== DECL_CONTEXT (t
)
12113 /* ... unless T is a member template; in which
12114 case our caller can be willing to create a
12115 specialization of that template represented
12117 && !(DECL_TI_TEMPLATE (t
)
12118 && DECL_MEMBER_TEMPLATE_P (DECL_TI_TEMPLATE (t
))))
12124 tmpl
= DECL_TI_TEMPLATE (t
);
12125 gen_tmpl
= most_general_template (tmpl
);
12126 argvec
= tsubst (DECL_TI_ARGS (t
), args
, complain
, in_decl
);
12127 if (argvec
!= error_mark_node
)
12128 argvec
= (coerce_innermost_template_parms
12129 (DECL_TEMPLATE_PARMS (gen_tmpl
),
12130 argvec
, t
, complain
,
12131 /*all*/true, /*defarg*/true));
12132 if (argvec
== error_mark_node
)
12133 RETURN (error_mark_node
);
12134 hash
= hash_tmpl_and_args (gen_tmpl
, argvec
);
12135 spec
= retrieve_specialization (gen_tmpl
, argvec
, hash
);
12140 /* A local variable. */
12142 /* Subsequent calls to pushdecl will fill this in. */
12144 spec
= retrieve_local_specialization (t
);
12146 /* If we already have the specialization we need, there is
12147 nothing more to do. */
12154 /* Create a new node for the specialization we need. */
12156 if (type
== NULL_TREE
)
12158 if (is_typedef_decl (t
))
12159 type
= DECL_ORIGINAL_TYPE (t
);
12161 type
= TREE_TYPE (t
);
12163 && VAR_HAD_UNKNOWN_BOUND (t
)
12164 && type
!= error_mark_node
)
12165 type
= strip_array_domain (type
);
12166 type
= tsubst (type
, args
, complain
, in_decl
);
12170 /* Even if the original location is out of scope, the
12171 newly substituted one is not. */
12172 DECL_DEAD_FOR_LOCAL (r
) = 0;
12173 DECL_INITIALIZED_P (r
) = 0;
12174 DECL_TEMPLATE_INSTANTIATED (r
) = 0;
12175 if (type
== error_mark_node
)
12176 RETURN (error_mark_node
);
12177 if (TREE_CODE (type
) == FUNCTION_TYPE
)
12179 /* It may seem that this case cannot occur, since:
12184 declares a function, not a variable. However:
12187 template <typename T> void g() { T t; }
12188 template void g<f>();
12190 is an attempt to declare a variable with function
12192 error ("variable %qD has function type",
12193 /* R is not yet sufficiently initialized, so we
12194 just use its name. */
12196 RETURN (error_mark_node
);
12198 type
= complete_type (type
);
12199 /* Wait until cp_finish_decl to set this again, to handle
12200 circular dependency (template/instantiate6.C). */
12201 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (r
) = 0;
12202 type
= check_var_type (DECL_NAME (r
), type
);
12204 if (DECL_HAS_VALUE_EXPR_P (t
))
12206 tree ve
= DECL_VALUE_EXPR (t
);
12207 ve
= tsubst_expr (ve
, args
, complain
, in_decl
,
12208 /*constant_expression_p=*/false);
12209 if (REFERENCE_REF_P (ve
))
12211 gcc_assert (TREE_CODE (type
) == REFERENCE_TYPE
);
12212 ve
= TREE_OPERAND (ve
, 0);
12214 SET_DECL_VALUE_EXPR (r
, ve
);
12216 if (CP_DECL_THREAD_LOCAL_P (r
)
12217 && !processing_template_decl
)
12218 set_decl_tls_model (r
, decl_default_tls_model (r
));
12220 else if (DECL_SELF_REFERENCE_P (t
))
12221 SET_DECL_SELF_REFERENCE_P (r
);
12222 TREE_TYPE (r
) = type
;
12223 cp_apply_type_quals_to_decl (cp_type_quals (type
), r
);
12224 DECL_CONTEXT (r
) = ctx
;
12225 /* Clear out the mangled name and RTL for the instantiation. */
12226 SET_DECL_ASSEMBLER_NAME (r
, NULL_TREE
);
12227 if (CODE_CONTAINS_STRUCT (TREE_CODE (t
), TS_DECL_WRTL
))
12228 SET_DECL_RTL (r
, NULL
);
12229 /* The initializer must not be expanded until it is required;
12230 see [temp.inst]. */
12231 DECL_INITIAL (r
) = NULL_TREE
;
12232 if (CODE_CONTAINS_STRUCT (TREE_CODE (t
), TS_DECL_WRTL
))
12233 SET_DECL_RTL (r
, NULL
);
12234 DECL_SIZE (r
) = DECL_SIZE_UNIT (r
) = 0;
12237 /* Possibly limit visibility based on template args. */
12238 DECL_VISIBILITY (r
) = VISIBILITY_DEFAULT
;
12239 if (DECL_VISIBILITY_SPECIFIED (t
))
12241 DECL_VISIBILITY_SPECIFIED (r
) = 0;
12242 DECL_ATTRIBUTES (r
)
12243 = remove_attribute ("visibility", DECL_ATTRIBUTES (r
));
12245 determine_visibility (r
);
12250 /* A static data member declaration is always marked
12251 external when it is declared in-class, even if an
12252 initializer is present. We mimic the non-template
12253 processing here. */
12254 DECL_EXTERNAL (r
) = 1;
12255 if (DECL_NAMESPACE_SCOPE_P (t
))
12256 DECL_NOT_REALLY_EXTERN (r
) = 1;
12258 DECL_TEMPLATE_INFO (r
) = build_template_info (tmpl
, argvec
);
12259 SET_DECL_IMPLICIT_INSTANTIATION (r
);
12260 register_specialization (r
, gen_tmpl
, argvec
, false, hash
);
12262 else if (!cp_unevaluated_operand
)
12263 register_local_specialization (r
, t
);
12265 DECL_CHAIN (r
) = NULL_TREE
;
12267 apply_late_template_attributes (&r
, DECL_ATTRIBUTES (r
),
12269 args
, complain
, in_decl
);
12271 /* Preserve a typedef that names a type. */
12272 if (is_typedef_decl (r
))
12274 DECL_ORIGINAL_TYPE (r
) = NULL_TREE
;
12275 set_underlying_type (r
);
12276 if (TYPE_DECL_ALIAS_P (r
) && type
!= error_mark_node
)
12277 /* An alias template specialization can be dependent
12278 even if its underlying type is not. */
12279 TYPE_DEPENDENT_P_VALID (TREE_TYPE (r
)) = false;
12282 layout_decl (r
, 0);
12287 gcc_unreachable ();
12292 /* Restore the file and line information. */
12293 input_location
= saved_loc
;
12298 /* Substitute into the ARG_TYPES of a function type.
12299 If END is a TREE_CHAIN, leave it and any following types
12303 tsubst_arg_types (tree arg_types
,
12306 tsubst_flags_t complain
,
12309 tree remaining_arg_types
;
12310 tree type
= NULL_TREE
;
12312 tree expanded_args
= NULL_TREE
;
12315 if (!arg_types
|| arg_types
== void_list_node
|| arg_types
== end
)
12318 remaining_arg_types
= tsubst_arg_types (TREE_CHAIN (arg_types
),
12319 args
, end
, complain
, in_decl
);
12320 if (remaining_arg_types
== error_mark_node
)
12321 return error_mark_node
;
12323 if (PACK_EXPANSION_P (TREE_VALUE (arg_types
)))
12325 /* For a pack expansion, perform substitution on the
12326 entire expression. Later on, we'll handle the arguments
12328 expanded_args
= tsubst_pack_expansion (TREE_VALUE (arg_types
),
12329 args
, complain
, in_decl
);
12331 if (TREE_CODE (expanded_args
) == TREE_VEC
)
12332 /* So that we'll spin through the parameters, one by one. */
12333 i
= TREE_VEC_LENGTH (expanded_args
);
12336 /* We only partially substituted into the parameter
12337 pack. Our type is TYPE_PACK_EXPANSION. */
12338 type
= expanded_args
;
12339 expanded_args
= NULL_TREE
;
12347 type
= TREE_VEC_ELT (expanded_args
, i
);
12349 type
= tsubst (TREE_VALUE (arg_types
), args
, complain
, in_decl
);
12351 if (type
== error_mark_node
)
12352 return error_mark_node
;
12353 if (VOID_TYPE_P (type
))
12355 if (complain
& tf_error
)
12357 error ("invalid parameter type %qT", type
);
12359 error ("in declaration %q+D", in_decl
);
12361 return error_mark_node
;
12364 if (abstract_virtuals_error_sfinae (ACU_PARM
, type
, complain
))
12365 return error_mark_node
;
12367 /* Do array-to-pointer, function-to-pointer conversion, and ignore
12368 top-level qualifiers as required. */
12369 type
= cv_unqualified (type_decays_to (type
));
12371 /* We do not substitute into default arguments here. The standard
12372 mandates that they be instantiated only when needed, which is
12373 done in build_over_call. */
12374 default_arg
= TREE_PURPOSE (arg_types
);
12376 if (default_arg
&& TREE_CODE (default_arg
) == DEFAULT_ARG
)
12378 /* We've instantiated a template before its default arguments
12379 have been parsed. This can happen for a nested template
12380 class, and is not an error unless we require the default
12381 argument in a call of this function. */
12382 remaining_arg_types
=
12383 tree_cons (default_arg
, type
, remaining_arg_types
);
12384 vec_safe_push (DEFARG_INSTANTIATIONS(default_arg
), remaining_arg_types
);
12387 remaining_arg_types
=
12388 hash_tree_cons (default_arg
, type
, remaining_arg_types
);
12391 return remaining_arg_types
;
12394 /* Substitute into a FUNCTION_TYPE or METHOD_TYPE. This routine does
12395 *not* handle the exception-specification for FNTYPE, because the
12396 initial substitution of explicitly provided template parameters
12397 during argument deduction forbids substitution into the
12398 exception-specification:
12402 All references in the function type of the function template to the
12403 corresponding template parameters are replaced by the specified tem-
12404 plate argument values. If a substitution in a template parameter or
12405 in the function type of the function template results in an invalid
12406 type, type deduction fails. [Note: The equivalent substitution in
12407 exception specifications is done only when the function is instanti-
12408 ated, at which point a program is ill-formed if the substitution
12409 results in an invalid type.] */
12412 tsubst_function_type (tree t
,
12414 tsubst_flags_t complain
,
12418 tree arg_types
= NULL_TREE
;
12421 /* The TYPE_CONTEXT is not used for function/method types. */
12422 gcc_assert (TYPE_CONTEXT (t
) == NULL_TREE
);
12424 /* DR 1227: Mixing immediate and non-immediate contexts in deduction
12426 bool late_return_type_p
= TYPE_HAS_LATE_RETURN_TYPE (t
);
12428 if (late_return_type_p
)
12430 /* Substitute the argument types. */
12431 arg_types
= tsubst_arg_types (TYPE_ARG_TYPES (t
), args
, NULL_TREE
,
12432 complain
, in_decl
);
12433 if (arg_types
== error_mark_node
)
12434 return error_mark_node
;
12436 tree save_ccp
= current_class_ptr
;
12437 tree save_ccr
= current_class_ref
;
12438 tree this_type
= (TREE_CODE (t
) == METHOD_TYPE
12439 ? TREE_TYPE (TREE_VALUE (arg_types
)) : NULL_TREE
);
12440 bool do_inject
= this_type
&& CLASS_TYPE_P (this_type
);
12443 /* DR 1207: 'this' is in scope in the trailing return type. */
12444 inject_this_parameter (this_type
, cp_type_quals (this_type
));
12447 /* Substitute the return type. */
12448 return_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
12452 current_class_ptr
= save_ccp
;
12453 current_class_ref
= save_ccr
;
12457 /* Substitute the return type. */
12458 return_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
12460 if (return_type
== error_mark_node
)
12461 return error_mark_node
;
12462 /* DR 486 clarifies that creation of a function type with an
12463 invalid return type is a deduction failure. */
12464 if (TREE_CODE (return_type
) == ARRAY_TYPE
12465 || TREE_CODE (return_type
) == FUNCTION_TYPE
)
12467 if (complain
& tf_error
)
12469 if (TREE_CODE (return_type
) == ARRAY_TYPE
)
12470 error ("function returning an array");
12472 error ("function returning a function");
12474 return error_mark_node
;
12477 if (abstract_virtuals_error_sfinae (ACU_RETURN
, return_type
, complain
))
12478 return error_mark_node
;
12480 if (!late_return_type_p
)
12482 /* Substitute the argument types. */
12483 arg_types
= tsubst_arg_types (TYPE_ARG_TYPES (t
), args
, NULL_TREE
,
12484 complain
, in_decl
);
12485 if (arg_types
== error_mark_node
)
12486 return error_mark_node
;
12489 /* Construct a new type node and return it. */
12490 if (TREE_CODE (t
) == FUNCTION_TYPE
)
12492 fntype
= build_function_type (return_type
, arg_types
);
12493 fntype
= apply_memfn_quals (fntype
,
12494 type_memfn_quals (t
),
12495 type_memfn_rqual (t
));
12499 tree r
= TREE_TYPE (TREE_VALUE (arg_types
));
12500 /* Don't pick up extra function qualifiers from the basetype. */
12501 r
= cp_build_qualified_type_real (r
, type_memfn_quals (t
), complain
);
12502 if (! MAYBE_CLASS_TYPE_P (r
))
12506 Type deduction may fail for any of the following
12509 -- Attempting to create "pointer to member of T" when T
12510 is not a class type. */
12511 if (complain
& tf_error
)
12512 error ("creating pointer to member function of non-class type %qT",
12514 return error_mark_node
;
12517 fntype
= build_method_type_directly (r
, return_type
,
12518 TREE_CHAIN (arg_types
));
12519 fntype
= build_ref_qualified_type (fntype
, type_memfn_rqual (t
));
12521 fntype
= cp_build_type_attribute_variant (fntype
, TYPE_ATTRIBUTES (t
));
12523 if (late_return_type_p
)
12524 TYPE_HAS_LATE_RETURN_TYPE (fntype
) = 1;
12529 /* FNTYPE is a FUNCTION_TYPE or METHOD_TYPE. Substitute the template
12530 ARGS into that specification, and return the substituted
12531 specification. If there is no specification, return NULL_TREE. */
12534 tsubst_exception_specification (tree fntype
,
12536 tsubst_flags_t complain
,
12543 specs
= TYPE_RAISES_EXCEPTIONS (fntype
);
12544 new_specs
= NULL_TREE
;
12545 if (specs
&& TREE_PURPOSE (specs
))
12547 /* A noexcept-specifier. */
12548 tree expr
= TREE_PURPOSE (specs
);
12549 if (TREE_CODE (expr
) == INTEGER_CST
)
12553 /* Defer instantiation of noexcept-specifiers to avoid
12554 excessive instantiations (c++/49107). */
12555 new_specs
= make_node (DEFERRED_NOEXCEPT
);
12556 if (DEFERRED_NOEXCEPT_SPEC_P (specs
))
12558 /* We already partially instantiated this member template,
12559 so combine the new args with the old. */
12560 DEFERRED_NOEXCEPT_PATTERN (new_specs
)
12561 = DEFERRED_NOEXCEPT_PATTERN (expr
);
12562 DEFERRED_NOEXCEPT_ARGS (new_specs
)
12563 = add_to_template_args (DEFERRED_NOEXCEPT_ARGS (expr
), args
);
12567 DEFERRED_NOEXCEPT_PATTERN (new_specs
) = expr
;
12568 DEFERRED_NOEXCEPT_ARGS (new_specs
) = args
;
12572 new_specs
= tsubst_copy_and_build
12573 (expr
, args
, complain
, in_decl
, /*function_p=*/false,
12574 /*integral_constant_expression_p=*/true);
12575 new_specs
= build_noexcept_spec (new_specs
, complain
);
12579 if (! TREE_VALUE (specs
))
12586 tree expanded_specs
= NULL_TREE
;
12588 if (PACK_EXPANSION_P (TREE_VALUE (specs
)))
12590 /* Expand the pack expansion type. */
12591 expanded_specs
= tsubst_pack_expansion (TREE_VALUE (specs
),
12595 if (expanded_specs
== error_mark_node
)
12596 return error_mark_node
;
12597 else if (TREE_CODE (expanded_specs
) == TREE_VEC
)
12598 len
= TREE_VEC_LENGTH (expanded_specs
);
12601 /* We're substituting into a member template, so
12602 we got a TYPE_PACK_EXPANSION back. Add that
12603 expansion and move on. */
12604 gcc_assert (TREE_CODE (expanded_specs
)
12605 == TYPE_PACK_EXPANSION
);
12606 new_specs
= add_exception_specifier (new_specs
,
12609 specs
= TREE_CHAIN (specs
);
12614 for (i
= 0; i
< len
; ++i
)
12616 if (expanded_specs
)
12617 spec
= TREE_VEC_ELT (expanded_specs
, i
);
12619 spec
= tsubst (TREE_VALUE (specs
), args
, complain
, in_decl
);
12620 if (spec
== error_mark_node
)
12622 new_specs
= add_exception_specifier (new_specs
, spec
,
12626 specs
= TREE_CHAIN (specs
);
12632 /* Take the tree structure T and replace template parameters used
12633 therein with the argument vector ARGS. IN_DECL is an associated
12634 decl for diagnostics. If an error occurs, returns ERROR_MARK_NODE.
12635 Issue error and warning messages under control of COMPLAIN. Note
12636 that we must be relatively non-tolerant of extensions here, in
12637 order to preserve conformance; if we allow substitutions that
12638 should not be allowed, we may allow argument deductions that should
12639 not succeed, and therefore report ambiguous overload situations
12640 where there are none. In theory, we could allow the substitution,
12641 but indicate that it should have failed, and allow our caller to
12642 make sure that the right thing happens, but we don't try to do this
12645 This function is used for dealing with types, decls and the like;
12646 for expressions, use tsubst_expr or tsubst_copy. */
12649 tsubst (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
12651 enum tree_code code
;
12652 tree type
, r
= NULL_TREE
;
12654 if (t
== NULL_TREE
|| t
== error_mark_node
12655 || t
== integer_type_node
12656 || t
== void_type_node
12657 || t
== char_type_node
12658 || t
== unknown_type_node
12659 || TREE_CODE (t
) == NAMESPACE_DECL
12660 || TREE_CODE (t
) == TRANSLATION_UNIT_DECL
)
12664 return tsubst_decl (t
, args
, complain
);
12666 if (args
== NULL_TREE
)
12669 code
= TREE_CODE (t
);
12671 if (code
== IDENTIFIER_NODE
)
12672 type
= IDENTIFIER_TYPE_VALUE (t
);
12674 type
= TREE_TYPE (t
);
12676 gcc_assert (type
!= unknown_type_node
);
12678 /* Reuse typedefs. We need to do this to handle dependent attributes,
12679 such as attribute aligned. */
12681 && typedef_variant_p (t
))
12683 tree decl
= TYPE_NAME (t
);
12685 if (alias_template_specialization_p (t
))
12687 /* DECL represents an alias template and we want to
12689 tree tmpl
= most_general_template (DECL_TI_TEMPLATE (decl
));
12690 tree gen_args
= tsubst (DECL_TI_ARGS (decl
), args
, complain
, in_decl
);
12691 r
= instantiate_alias_template (tmpl
, gen_args
, complain
);
12693 else if (DECL_CLASS_SCOPE_P (decl
)
12694 && CLASSTYPE_TEMPLATE_INFO (DECL_CONTEXT (decl
))
12695 && uses_template_parms (DECL_CONTEXT (decl
)))
12697 tree tmpl
= most_general_template (DECL_TI_TEMPLATE (decl
));
12698 tree gen_args
= tsubst (DECL_TI_ARGS (decl
), args
, complain
, in_decl
);
12699 r
= retrieve_specialization (tmpl
, gen_args
, 0);
12701 else if (DECL_FUNCTION_SCOPE_P (decl
)
12702 && DECL_TEMPLATE_INFO (DECL_CONTEXT (decl
))
12703 && uses_template_parms (DECL_TI_ARGS (DECL_CONTEXT (decl
))))
12704 r
= retrieve_local_specialization (decl
);
12706 /* The typedef is from a non-template context. */
12712 r
= cp_build_qualified_type_real
12713 (r
, cp_type_quals (t
) | cp_type_quals (r
),
12714 complain
| tf_ignore_bad_quals
);
12719 /* We don't have an instantiation yet, so drop the typedef. */
12720 int quals
= cp_type_quals (t
);
12721 t
= DECL_ORIGINAL_TYPE (decl
);
12722 t
= cp_build_qualified_type_real (t
, quals
,
12723 complain
| tf_ignore_bad_quals
);
12728 && code
!= TYPENAME_TYPE
12729 && code
!= TEMPLATE_TYPE_PARM
12730 && code
!= IDENTIFIER_NODE
12731 && code
!= FUNCTION_TYPE
12732 && code
!= METHOD_TYPE
)
12733 type
= tsubst (type
, args
, complain
, in_decl
);
12734 if (type
== error_mark_node
)
12735 return error_mark_node
;
12741 case ENUMERAL_TYPE
:
12742 return tsubst_aggr_type (t
, args
, complain
, in_decl
,
12743 /*entering_scope=*/0);
12746 case IDENTIFIER_NODE
:
12757 if (t
== integer_type_node
)
12760 if (TREE_CODE (TYPE_MIN_VALUE (t
)) == INTEGER_CST
12761 && TREE_CODE (TYPE_MAX_VALUE (t
)) == INTEGER_CST
)
12765 tree max
, omax
= TREE_OPERAND (TYPE_MAX_VALUE (t
), 0);
12767 max
= tsubst_expr (omax
, args
, complain
, in_decl
,
12768 /*integral_constant_expression_p=*/false);
12770 /* Fix up type of the magic NOP_EXPR with TREE_SIDE_EFFECTS if
12772 if (TREE_CODE (max
) == NOP_EXPR
12773 && TREE_SIDE_EFFECTS (omax
)
12774 && !TREE_TYPE (max
))
12775 TREE_TYPE (max
) = TREE_TYPE (TREE_OPERAND (max
, 0));
12777 /* If we're in a partial instantiation, preserve the magic NOP_EXPR
12778 with TREE_SIDE_EFFECTS that indicates this is not an integral
12779 constant expression. */
12780 if (processing_template_decl
12781 && TREE_SIDE_EFFECTS (omax
) && TREE_CODE (omax
) == NOP_EXPR
)
12783 gcc_assert (TREE_CODE (max
) == NOP_EXPR
);
12784 TREE_SIDE_EFFECTS (max
) = 1;
12787 return compute_array_index_type (NULL_TREE
, max
, complain
);
12790 case TEMPLATE_TYPE_PARM
:
12791 case TEMPLATE_TEMPLATE_PARM
:
12792 case BOUND_TEMPLATE_TEMPLATE_PARM
:
12793 case TEMPLATE_PARM_INDEX
:
12798 tree arg
= NULL_TREE
;
12800 /* Early in template argument deduction substitution, we don't
12801 want to reduce the level of 'auto', or it will be confused
12802 with a normal template parm in subsequent deduction. */
12803 if (is_auto (t
) && (complain
& tf_partial
))
12808 gcc_assert (TREE_VEC_LENGTH (args
) > 0);
12809 template_parm_level_and_index (t
, &level
, &idx
);
12811 levels
= TMPL_ARGS_DEPTH (args
);
12812 if (level
<= levels
12813 && TREE_VEC_LENGTH (TMPL_ARGS_LEVEL (args
, level
)) > 0)
12815 arg
= TMPL_ARG (args
, level
, idx
);
12817 if (arg
&& TREE_CODE (arg
) == ARGUMENT_PACK_SELECT
)
12819 /* See through ARGUMENT_PACK_SELECT arguments. */
12820 arg
= ARGUMENT_PACK_SELECT_ARG (arg
);
12821 /* If the selected argument is an expansion E, that most
12822 likely means we were called from
12823 gen_elem_of_pack_expansion_instantiation during the
12824 substituting of pack an argument pack (which Ith
12825 element is a pack expansion, where I is
12826 ARGUMENT_PACK_SELECT_INDEX) into a pack expansion.
12827 In this case, the Ith element resulting from this
12828 substituting is going to be a pack expansion, which
12829 pattern is the pattern of E. Let's return the
12831 gen_elem_of_pack_expansion_instantiation will
12832 build the resulting pack expansion from it. */
12833 if (PACK_EXPANSION_P (arg
))
12835 /* Make sure we aren't throwing away arg info. */
12836 gcc_assert (!PACK_EXPANSION_EXTRA_ARGS (arg
));
12837 arg
= PACK_EXPANSION_PATTERN (arg
);
12842 if (arg
== error_mark_node
)
12843 return error_mark_node
;
12844 else if (arg
!= NULL_TREE
)
12846 if (ARGUMENT_PACK_P (arg
))
12847 /* If ARG is an argument pack, we don't actually want to
12848 perform a substitution here, because substitutions
12849 for argument packs are only done
12850 element-by-element. We can get to this point when
12851 substituting the type of a non-type template
12852 parameter pack, when that type actually contains
12853 template parameter packs from an outer template, e.g.,
12855 template<typename... Types> struct A {
12856 template<Types... Values> struct B { };
12860 if (code
== TEMPLATE_TYPE_PARM
)
12863 gcc_assert (TYPE_P (arg
));
12865 quals
= cp_type_quals (arg
) | cp_type_quals (t
);
12867 return cp_build_qualified_type_real
12868 (arg
, quals
, complain
| tf_ignore_bad_quals
);
12870 else if (code
== BOUND_TEMPLATE_TEMPLATE_PARM
)
12872 /* We are processing a type constructed from a
12873 template template parameter. */
12874 tree argvec
= tsubst (TYPE_TI_ARGS (t
),
12875 args
, complain
, in_decl
);
12876 if (argvec
== error_mark_node
)
12877 return error_mark_node
;
12879 gcc_assert (TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
12880 || TREE_CODE (arg
) == TEMPLATE_DECL
12881 || TREE_CODE (arg
) == UNBOUND_CLASS_TEMPLATE
);
12883 if (TREE_CODE (arg
) == UNBOUND_CLASS_TEMPLATE
)
12884 /* Consider this code:
12886 template <template <class> class Template>
12888 template <class Arg> using Bind = Template<Arg>;
12891 template <template <class> class Template, class Arg>
12892 using Instantiate = Template<Arg>; //#0
12894 template <template <class> class Template,
12897 Instantiate<Internal<Template>::template Bind,
12900 When #1 is parsed, the
12901 BOUND_TEMPLATE_TEMPLATE_PARM representing the
12902 parameter `Template' in #0 matches the
12903 UNBOUND_CLASS_TEMPLATE representing the argument
12904 `Internal<Template>::template Bind'; We then want
12905 to assemble the type `Bind<Argument>' that can't
12906 be fully created right now, because
12907 `Internal<Template>' not being complete, the Bind
12908 template cannot be looked up in that context. So
12909 we need to "store" `Bind<Argument>' for later
12910 when the context of Bind becomes complete. Let's
12911 store that in a TYPENAME_TYPE. */
12912 return make_typename_type (TYPE_CONTEXT (arg
),
12913 build_nt (TEMPLATE_ID_EXPR
,
12914 TYPE_IDENTIFIER (arg
),
12919 /* We can get a TEMPLATE_TEMPLATE_PARM here when we
12920 are resolving nested-types in the signature of a
12921 member function templates. Otherwise ARG is a
12922 TEMPLATE_DECL and is the real template to be
12924 if (TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
)
12925 arg
= TYPE_NAME (arg
);
12927 r
= lookup_template_class (arg
,
12929 DECL_CONTEXT (arg
),
12930 /*entering_scope=*/0,
12932 return cp_build_qualified_type_real
12933 (r
, cp_type_quals (t
) | cp_type_quals (r
), complain
);
12936 /* TEMPLATE_TEMPLATE_PARM or TEMPLATE_PARM_INDEX. */
12937 return convert_from_reference (unshare_expr (arg
));
12941 /* This can happen during the attempted tsubst'ing in
12942 unify. This means that we don't yet have any information
12943 about the template parameter in question. */
12946 /* If we get here, we must have been looking at a parm for a
12947 more deeply nested template. Make a new version of this
12948 template parameter, but with a lower level. */
12951 case TEMPLATE_TYPE_PARM
:
12952 case TEMPLATE_TEMPLATE_PARM
:
12953 case BOUND_TEMPLATE_TEMPLATE_PARM
:
12954 if (cp_type_quals (t
))
12956 r
= tsubst (TYPE_MAIN_VARIANT (t
), args
, complain
, in_decl
);
12957 r
= cp_build_qualified_type_real
12958 (r
, cp_type_quals (t
),
12959 complain
| (code
== TEMPLATE_TYPE_PARM
12960 ? tf_ignore_bad_quals
: 0));
12962 else if (TREE_CODE (t
) == TEMPLATE_TYPE_PARM
12963 && PLACEHOLDER_TYPE_CONSTRAINTS (t
)
12964 && (r
= (TEMPLATE_PARM_DESCENDANTS
12965 (TEMPLATE_TYPE_PARM_INDEX (t
))))
12966 && (r
= TREE_TYPE (r
))
12967 && !PLACEHOLDER_TYPE_CONSTRAINTS (r
))
12968 /* Break infinite recursion when substituting the constraints
12969 of a constrained placeholder. */;
12973 TEMPLATE_TYPE_PARM_INDEX (r
)
12974 = reduce_template_parm_level (TEMPLATE_TYPE_PARM_INDEX (t
),
12975 r
, levels
, args
, complain
);
12976 TYPE_STUB_DECL (r
) = TYPE_NAME (r
) = TEMPLATE_TYPE_DECL (r
);
12977 TYPE_MAIN_VARIANT (r
) = r
;
12978 TYPE_POINTER_TO (r
) = NULL_TREE
;
12979 TYPE_REFERENCE_TO (r
) = NULL_TREE
;
12981 if (TREE_CODE (r
) == TEMPLATE_TEMPLATE_PARM
)
12982 /* We have reduced the level of the template
12983 template parameter, but not the levels of its
12984 template parameters, so canonical_type_parameter
12985 will not be able to find the canonical template
12986 template parameter for this level. Thus, we
12987 require structural equality checking to compare
12988 TEMPLATE_TEMPLATE_PARMs. */
12989 SET_TYPE_STRUCTURAL_EQUALITY (r
);
12990 else if (TYPE_STRUCTURAL_EQUALITY_P (t
))
12991 SET_TYPE_STRUCTURAL_EQUALITY (r
);
12993 TYPE_CANONICAL (r
) = canonical_type_parameter (r
);
12995 /* Propagate constraints on placeholders. */
12996 if (TREE_CODE (t
) == TEMPLATE_TYPE_PARM
)
12997 if (tree constr
= PLACEHOLDER_TYPE_CONSTRAINTS (t
))
12998 PLACEHOLDER_TYPE_CONSTRAINTS (r
)
12999 = tsubst_constraint (constr
, args
, complain
, in_decl
);
13001 if (code
== BOUND_TEMPLATE_TEMPLATE_PARM
)
13003 tree argvec
= tsubst (TYPE_TI_ARGS (t
), args
,
13004 complain
, in_decl
);
13005 if (argvec
== error_mark_node
)
13006 return error_mark_node
;
13008 TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (r
)
13009 = build_template_info (TYPE_TI_TEMPLATE (t
), argvec
);
13014 case TEMPLATE_PARM_INDEX
:
13015 r
= reduce_template_parm_level (t
, type
, levels
, args
, complain
);
13019 gcc_unreachable ();
13027 tree purpose
, value
, chain
;
13029 if (t
== void_list_node
)
13032 purpose
= TREE_PURPOSE (t
);
13035 purpose
= tsubst (purpose
, args
, complain
, in_decl
);
13036 if (purpose
== error_mark_node
)
13037 return error_mark_node
;
13039 value
= TREE_VALUE (t
);
13042 value
= tsubst (value
, args
, complain
, in_decl
);
13043 if (value
== error_mark_node
)
13044 return error_mark_node
;
13046 chain
= TREE_CHAIN (t
);
13047 if (chain
&& chain
!= void_type_node
)
13049 chain
= tsubst (chain
, args
, complain
, in_decl
);
13050 if (chain
== error_mark_node
)
13051 return error_mark_node
;
13053 if (purpose
== TREE_PURPOSE (t
)
13054 && value
== TREE_VALUE (t
)
13055 && chain
== TREE_CHAIN (t
))
13057 return hash_tree_cons (purpose
, value
, chain
);
13061 /* We should never be tsubsting a binfo. */
13062 gcc_unreachable ();
13065 /* A vector of template arguments. */
13066 gcc_assert (!type
);
13067 return tsubst_template_args (t
, args
, complain
, in_decl
);
13070 case REFERENCE_TYPE
:
13072 if (type
== TREE_TYPE (t
) && TREE_CODE (type
) != METHOD_TYPE
)
13077 Type deduction may fail for any of the following
13080 -- Attempting to create a pointer to reference type.
13081 -- Attempting to create a reference to a reference type or
13082 a reference to void.
13084 Core issue 106 says that creating a reference to a reference
13085 during instantiation is no longer a cause for failure. We
13086 only enforce this check in strict C++98 mode. */
13087 if ((TREE_CODE (type
) == REFERENCE_TYPE
13088 && (((cxx_dialect
== cxx98
) && flag_iso
) || code
!= REFERENCE_TYPE
))
13089 || (code
== REFERENCE_TYPE
&& VOID_TYPE_P (type
)))
13091 static location_t last_loc
;
13093 /* We keep track of the last time we issued this error
13094 message to avoid spewing a ton of messages during a
13095 single bad template instantiation. */
13096 if (complain
& tf_error
13097 && last_loc
!= input_location
)
13099 if (VOID_TYPE_P (type
))
13100 error ("forming reference to void");
13101 else if (code
== POINTER_TYPE
)
13102 error ("forming pointer to reference type %qT", type
);
13104 error ("forming reference to reference type %qT", type
);
13105 last_loc
= input_location
;
13108 return error_mark_node
;
13110 else if (TREE_CODE (type
) == FUNCTION_TYPE
13111 && (type_memfn_quals (type
) != TYPE_UNQUALIFIED
13112 || type_memfn_rqual (type
) != REF_QUAL_NONE
))
13114 if (complain
& tf_error
)
13116 if (code
== POINTER_TYPE
)
13117 error ("forming pointer to qualified function type %qT",
13120 error ("forming reference to qualified function type %qT",
13123 return error_mark_node
;
13125 else if (code
== POINTER_TYPE
)
13127 r
= build_pointer_type (type
);
13128 if (TREE_CODE (type
) == METHOD_TYPE
)
13129 r
= build_ptrmemfunc_type (r
);
13131 else if (TREE_CODE (type
) == REFERENCE_TYPE
)
13132 /* In C++0x, during template argument substitution, when there is an
13133 attempt to create a reference to a reference type, reference
13134 collapsing is applied as described in [14.3.1/4 temp.arg.type]:
13136 "If a template-argument for a template-parameter T names a type
13137 that is a reference to a type A, an attempt to create the type
13138 'lvalue reference to cv T' creates the type 'lvalue reference to
13139 A,' while an attempt to create the type type rvalue reference to
13140 cv T' creates the type T"
13142 r
= cp_build_reference_type
13144 TYPE_REF_IS_RVALUE (t
) && TYPE_REF_IS_RVALUE (type
));
13146 r
= cp_build_reference_type (type
, TYPE_REF_IS_RVALUE (t
));
13147 r
= cp_build_qualified_type_real (r
, cp_type_quals (t
), complain
);
13149 if (r
!= error_mark_node
)
13150 /* Will this ever be needed for TYPE_..._TO values? */
13157 r
= tsubst (TYPE_OFFSET_BASETYPE (t
), args
, complain
, in_decl
);
13158 if (r
== error_mark_node
|| !MAYBE_CLASS_TYPE_P (r
))
13162 Type deduction may fail for any of the following
13165 -- Attempting to create "pointer to member of T" when T
13166 is not a class type. */
13167 if (complain
& tf_error
)
13168 error ("creating pointer to member of non-class type %qT", r
);
13169 return error_mark_node
;
13171 if (TREE_CODE (type
) == REFERENCE_TYPE
)
13173 if (complain
& tf_error
)
13174 error ("creating pointer to member reference type %qT", type
);
13175 return error_mark_node
;
13177 if (VOID_TYPE_P (type
))
13179 if (complain
& tf_error
)
13180 error ("creating pointer to member of type void");
13181 return error_mark_node
;
13183 gcc_assert (TREE_CODE (type
) != METHOD_TYPE
);
13184 if (TREE_CODE (type
) == FUNCTION_TYPE
)
13186 /* The type of the implicit object parameter gets its
13187 cv-qualifiers from the FUNCTION_TYPE. */
13190 = build_memfn_type (type
, r
, type_memfn_quals (type
),
13191 type_memfn_rqual (type
));
13192 memptr
= build_ptrmemfunc_type (build_pointer_type (method_type
));
13193 return cp_build_qualified_type_real (memptr
, cp_type_quals (t
),
13197 return cp_build_qualified_type_real (build_ptrmem_type (r
, type
),
13201 case FUNCTION_TYPE
:
13206 fntype
= tsubst_function_type (t
, args
, complain
, in_decl
);
13207 if (fntype
== error_mark_node
)
13208 return error_mark_node
;
13210 /* Substitute the exception specification. */
13211 specs
= tsubst_exception_specification (t
, args
, complain
,
13212 in_decl
, /*defer_ok*/true);
13213 if (specs
== error_mark_node
)
13214 return error_mark_node
;
13216 fntype
= build_exception_variant (fntype
, specs
);
13221 tree domain
= tsubst (TYPE_DOMAIN (t
), args
, complain
, in_decl
);
13222 if (domain
== error_mark_node
)
13223 return error_mark_node
;
13225 /* As an optimization, we avoid regenerating the array type if
13226 it will obviously be the same as T. */
13227 if (type
== TREE_TYPE (t
) && domain
== TYPE_DOMAIN (t
))
13230 /* These checks should match the ones in create_array_type_for_decl.
13234 The deduction may fail for any of the following reasons:
13236 -- Attempting to create an array with an element type that
13237 is void, a function type, or a reference type, or [DR337]
13238 an abstract class type. */
13239 if (VOID_TYPE_P (type
)
13240 || TREE_CODE (type
) == FUNCTION_TYPE
13241 || (TREE_CODE (type
) == ARRAY_TYPE
13242 && TYPE_DOMAIN (type
) == NULL_TREE
)
13243 || TREE_CODE (type
) == REFERENCE_TYPE
)
13245 if (complain
& tf_error
)
13246 error ("creating array of %qT", type
);
13247 return error_mark_node
;
13250 if (abstract_virtuals_error_sfinae (ACU_ARRAY
, type
, complain
))
13251 return error_mark_node
;
13253 r
= build_cplus_array_type (type
, domain
);
13255 if (TYPE_USER_ALIGN (t
))
13257 TYPE_ALIGN (r
) = TYPE_ALIGN (t
);
13258 TYPE_USER_ALIGN (r
) = 1;
13264 case TYPENAME_TYPE
:
13266 tree ctx
= tsubst_aggr_type (TYPE_CONTEXT (t
), args
, complain
,
13267 in_decl
, /*entering_scope=*/1);
13268 tree f
= tsubst_copy (TYPENAME_TYPE_FULLNAME (t
), args
,
13269 complain
, in_decl
);
13271 if (ctx
== error_mark_node
|| f
== error_mark_node
)
13272 return error_mark_node
;
13274 if (!MAYBE_CLASS_TYPE_P (ctx
))
13276 if (complain
& tf_error
)
13277 error ("%qT is not a class, struct, or union type", ctx
);
13278 return error_mark_node
;
13280 else if (!uses_template_parms (ctx
) && !TYPE_BEING_DEFINED (ctx
))
13282 /* Normally, make_typename_type does not require that the CTX
13283 have complete type in order to allow things like:
13285 template <class T> struct S { typename S<T>::X Y; };
13287 But, such constructs have already been resolved by this
13288 point, so here CTX really should have complete type, unless
13289 it's a partial instantiation. */
13290 ctx
= complete_type (ctx
);
13291 if (!COMPLETE_TYPE_P (ctx
))
13293 if (complain
& tf_error
)
13294 cxx_incomplete_type_error (NULL_TREE
, ctx
);
13295 return error_mark_node
;
13299 f
= make_typename_type (ctx
, f
, typename_type
,
13300 complain
| tf_keep_type_decl
);
13301 if (f
== error_mark_node
)
13303 if (TREE_CODE (f
) == TYPE_DECL
)
13305 complain
|= tf_ignore_bad_quals
;
13309 if (TREE_CODE (f
) != TYPENAME_TYPE
)
13311 if (TYPENAME_IS_ENUM_P (t
) && TREE_CODE (f
) != ENUMERAL_TYPE
)
13313 if (complain
& tf_error
)
13314 error ("%qT resolves to %qT, which is not an enumeration type",
13317 return error_mark_node
;
13319 else if (TYPENAME_IS_CLASS_P (t
) && !CLASS_TYPE_P (f
))
13321 if (complain
& tf_error
)
13322 error ("%qT resolves to %qT, which is is not a class type",
13325 return error_mark_node
;
13329 return cp_build_qualified_type_real
13330 (f
, cp_type_quals (f
) | cp_type_quals (t
), complain
);
13333 case UNBOUND_CLASS_TEMPLATE
:
13335 tree ctx
= tsubst_aggr_type (TYPE_CONTEXT (t
), args
, complain
,
13336 in_decl
, /*entering_scope=*/1);
13337 tree name
= TYPE_IDENTIFIER (t
);
13338 tree parm_list
= DECL_TEMPLATE_PARMS (TYPE_NAME (t
));
13340 if (ctx
== error_mark_node
|| name
== error_mark_node
)
13341 return error_mark_node
;
13344 parm_list
= tsubst_template_parms (parm_list
, args
, complain
);
13345 return make_unbound_class_template (ctx
, name
, parm_list
, complain
);
13352 ++cp_unevaluated_operand
;
13353 ++c_inhibit_evaluation_warnings
;
13355 type
= tsubst_expr (TYPEOF_TYPE_EXPR (t
), args
,
13357 /*integral_constant_expression_p=*/false);
13359 --cp_unevaluated_operand
;
13360 --c_inhibit_evaluation_warnings
;
13362 type
= finish_typeof (type
);
13363 return cp_build_qualified_type_real (type
,
13365 | cp_type_quals (type
),
13369 case DECLTYPE_TYPE
:
13373 ++cp_unevaluated_operand
;
13374 ++c_inhibit_evaluation_warnings
;
13376 type
= tsubst_copy_and_build (DECLTYPE_TYPE_EXPR (t
), args
,
13377 complain
|tf_decltype
, in_decl
,
13378 /*function_p*/false,
13379 /*integral_constant_expression*/false);
13381 --cp_unevaluated_operand
;
13382 --c_inhibit_evaluation_warnings
;
13384 if (DECLTYPE_FOR_LAMBDA_CAPTURE (t
))
13385 type
= lambda_capture_field_type (type
,
13386 DECLTYPE_FOR_INIT_CAPTURE (t
));
13387 else if (DECLTYPE_FOR_LAMBDA_PROXY (t
))
13388 type
= lambda_proxy_type (type
);
13391 bool id
= DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (t
);
13392 if (id
&& TREE_CODE (DECLTYPE_TYPE_EXPR (t
)) == BIT_NOT_EXPR
13394 /* In a template ~id could be either a complement expression
13395 or an unqualified-id naming a destructor; if instantiating
13396 it produces an expression, it's not an id-expression or
13399 type
= finish_decltype_type (type
, id
, complain
);
13401 return cp_build_qualified_type_real (type
,
13403 | cp_type_quals (type
),
13404 complain
| tf_ignore_bad_quals
);
13407 case UNDERLYING_TYPE
:
13409 tree type
= tsubst (UNDERLYING_TYPE_TYPE (t
), args
,
13410 complain
, in_decl
);
13411 return finish_underlying_type (type
);
13414 case TYPE_ARGUMENT_PACK
:
13415 case NONTYPE_ARGUMENT_PACK
:
13417 tree r
= TYPE_P (t
) ? cxx_make_type (code
) : make_node (code
);
13419 tsubst_template_args (ARGUMENT_PACK_ARGS (t
),
13423 SET_ARGUMENT_PACK_ARGS (r
, packed_out
);
13425 /* For template nontype argument packs, also substitute into
13427 if (code
== NONTYPE_ARGUMENT_PACK
)
13428 TREE_TYPE (r
) = tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
13447 /* We should use one of the expression tsubsts for these codes. */
13448 gcc_unreachable ();
13451 sorry ("use of %qs in template", get_tree_code_name (code
));
13452 return error_mark_node
;
13456 /* Like tsubst_expr for a BASELINK. OBJECT_TYPE, if non-NULL, is the
13457 type of the expression on the left-hand side of the "." or "->"
13461 tsubst_baselink (tree baselink
, tree object_type
,
13462 tree args
, tsubst_flags_t complain
, tree in_decl
)
13465 tree qualifying_scope
;
13468 tree template_args
= 0;
13469 bool template_id_p
= false;
13470 bool qualified
= BASELINK_QUALIFIED_P (baselink
);
13472 /* A baselink indicates a function from a base class. Both the
13473 BASELINK_ACCESS_BINFO and the base class referenced may
13474 indicate bases of the template class, rather than the
13475 instantiated class. In addition, lookups that were not
13476 ambiguous before may be ambiguous now. Therefore, we perform
13477 the lookup again. */
13478 qualifying_scope
= BINFO_TYPE (BASELINK_ACCESS_BINFO (baselink
));
13479 qualifying_scope
= tsubst (qualifying_scope
, args
,
13480 complain
, in_decl
);
13481 fns
= BASELINK_FUNCTIONS (baselink
);
13482 optype
= tsubst (BASELINK_OPTYPE (baselink
), args
, complain
, in_decl
);
13483 if (TREE_CODE (fns
) == TEMPLATE_ID_EXPR
)
13485 template_id_p
= true;
13486 template_args
= TREE_OPERAND (fns
, 1);
13487 fns
= TREE_OPERAND (fns
, 0);
13489 template_args
= tsubst_template_args (template_args
, args
,
13490 complain
, in_decl
);
13492 name
= DECL_NAME (get_first_fn (fns
));
13493 if (IDENTIFIER_TYPENAME_P (name
))
13494 name
= mangle_conv_op_name_for_type (optype
);
13495 baselink
= lookup_fnfields (qualifying_scope
, name
, /*protect=*/1);
13497 return error_mark_node
;
13499 /* If lookup found a single function, mark it as used at this
13500 point. (If it lookup found multiple functions the one selected
13501 later by overload resolution will be marked as used at that
13503 if (BASELINK_P (baselink
))
13504 fns
= BASELINK_FUNCTIONS (baselink
);
13505 if (!template_id_p
&& !really_overloaded_fn (fns
)
13506 && !mark_used (OVL_CURRENT (fns
), complain
) && !(complain
& tf_error
))
13507 return error_mark_node
;
13509 /* Add back the template arguments, if present. */
13510 if (BASELINK_P (baselink
) && template_id_p
)
13511 BASELINK_FUNCTIONS (baselink
)
13512 = build_nt (TEMPLATE_ID_EXPR
,
13513 BASELINK_FUNCTIONS (baselink
),
13515 /* Update the conversion operator type. */
13516 BASELINK_OPTYPE (baselink
) = optype
;
13519 object_type
= current_class_type
;
13522 baselink
= adjust_result_of_qualified_name_lookup (baselink
,
13528 /* Like tsubst_expr for a SCOPE_REF, given by QUALIFIED_ID. DONE is
13529 true if the qualified-id will be a postfix-expression in-and-of
13530 itself; false if more of the postfix-expression follows the
13531 QUALIFIED_ID. ADDRESS_P is true if the qualified-id is the operand
13535 tsubst_qualified_id (tree qualified_id
, tree args
,
13536 tsubst_flags_t complain
, tree in_decl
,
13537 bool done
, bool address_p
)
13543 tree template_args
;
13544 location_t loc
= UNKNOWN_LOCATION
;
13546 gcc_assert (TREE_CODE (qualified_id
) == SCOPE_REF
);
13548 /* Figure out what name to look up. */
13549 name
= TREE_OPERAND (qualified_id
, 1);
13550 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
13552 is_template
= true;
13553 loc
= EXPR_LOCATION (name
);
13554 template_args
= TREE_OPERAND (name
, 1);
13556 template_args
= tsubst_template_args (template_args
, args
,
13557 complain
, in_decl
);
13558 name
= TREE_OPERAND (name
, 0);
13562 is_template
= false;
13563 template_args
= NULL_TREE
;
13566 /* Substitute into the qualifying scope. When there are no ARGS, we
13567 are just trying to simplify a non-dependent expression. In that
13568 case the qualifying scope may be dependent, and, in any case,
13569 substituting will not help. */
13570 scope
= TREE_OPERAND (qualified_id
, 0);
13573 scope
= tsubst (scope
, args
, complain
, in_decl
);
13574 expr
= tsubst_copy (name
, args
, complain
, in_decl
);
13579 if (dependent_scope_p (scope
))
13582 expr
= build_min_nt_loc (loc
, TEMPLATE_ID_EXPR
, expr
, template_args
);
13583 return build_qualified_name (NULL_TREE
, scope
, expr
,
13584 QUALIFIED_NAME_IS_TEMPLATE (qualified_id
));
13587 if (!BASELINK_P (name
) && !DECL_P (expr
))
13589 if (TREE_CODE (expr
) == BIT_NOT_EXPR
)
13591 /* A BIT_NOT_EXPR is used to represent a destructor. */
13592 if (!check_dtor_name (scope
, TREE_OPERAND (expr
, 0)))
13594 error ("qualifying type %qT does not match destructor name ~%qT",
13595 scope
, TREE_OPERAND (expr
, 0));
13596 expr
= error_mark_node
;
13599 expr
= lookup_qualified_name (scope
, complete_dtor_identifier
,
13600 /*is_type_p=*/0, false);
13603 expr
= lookup_qualified_name (scope
, expr
, /*is_type_p=*/0, false);
13604 if (TREE_CODE (TREE_CODE (expr
) == TEMPLATE_DECL
13605 ? DECL_TEMPLATE_RESULT (expr
) : expr
) == TYPE_DECL
)
13607 if (complain
& tf_error
)
13609 error ("dependent-name %qE is parsed as a non-type, but "
13610 "instantiation yields a type", qualified_id
);
13611 inform (input_location
, "say %<typename %E%> if a type is meant", qualified_id
);
13613 return error_mark_node
;
13619 check_accessibility_of_qualified_id (expr
, /*object_type=*/NULL_TREE
,
13621 /* Remember that there was a reference to this entity. */
13622 if (!mark_used (expr
, complain
) && !(complain
& tf_error
))
13623 return error_mark_node
;
13626 if (expr
== error_mark_node
|| TREE_CODE (expr
) == TREE_LIST
)
13628 if (complain
& tf_error
)
13629 qualified_name_lookup_error (scope
,
13630 TREE_OPERAND (qualified_id
, 1),
13631 expr
, input_location
);
13632 return error_mark_node
;
13636 expr
= lookup_template_function (expr
, template_args
);
13638 if (expr
== error_mark_node
&& complain
& tf_error
)
13639 qualified_name_lookup_error (scope
, TREE_OPERAND (qualified_id
, 1),
13640 expr
, input_location
);
13641 else if (TYPE_P (scope
))
13643 expr
= (adjust_result_of_qualified_name_lookup
13644 (expr
, scope
, current_nonlambda_class_type ()));
13645 expr
= (finish_qualified_id_expr
13646 (scope
, expr
, done
, address_p
&& PTRMEM_OK_P (qualified_id
),
13647 QUALIFIED_NAME_IS_TEMPLATE (qualified_id
),
13648 /*template_arg_p=*/false, complain
));
13651 /* Expressions do not generally have reference type. */
13652 if (TREE_CODE (expr
) != SCOPE_REF
13653 /* However, if we're about to form a pointer-to-member, we just
13654 want the referenced member referenced. */
13655 && TREE_CODE (expr
) != OFFSET_REF
)
13656 expr
= convert_from_reference (expr
);
13661 /* tsubst the initializer for a VAR_DECL. INIT is the unsubstituted
13662 initializer, DECL is the substituted VAR_DECL. Other arguments are as
13666 tsubst_init (tree init
, tree decl
, tree args
,
13667 tsubst_flags_t complain
, tree in_decl
)
13672 init
= tsubst_expr (init
, args
, complain
, in_decl
, false);
13676 /* If we had an initializer but it
13677 instantiated to nothing,
13678 value-initialize the object. This will
13679 only occur when the initializer was a
13680 pack expansion where the parameter packs
13681 used in that expansion were of length
13683 init
= build_value_init (TREE_TYPE (decl
),
13685 if (TREE_CODE (init
) == AGGR_INIT_EXPR
)
13686 init
= get_target_expr_sfinae (init
, complain
);
13692 /* Like tsubst, but deals with expressions. This function just replaces
13693 template parms; to finish processing the resultant expression, use
13694 tsubst_copy_and_build or tsubst_expr. */
13697 tsubst_copy (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
13699 enum tree_code code
;
13702 if (t
== NULL_TREE
|| t
== error_mark_node
|| args
== NULL_TREE
)
13705 code
= TREE_CODE (t
);
13710 r
= retrieve_local_specialization (t
);
13712 if (r
== NULL_TREE
)
13714 /* We get here for a use of 'this' in an NSDMI. */
13715 if (DECL_NAME (t
) == this_identifier
13716 && current_function_decl
13717 && DECL_CONSTRUCTOR_P (current_function_decl
))
13718 return current_class_ptr
;
13720 /* This can happen for a parameter name used later in a function
13721 declaration (such as in a late-specified return type). Just
13722 make a dummy decl, since it's only used for its type. */
13723 gcc_assert (cp_unevaluated_operand
!= 0);
13724 r
= tsubst_decl (t
, args
, complain
);
13725 /* Give it the template pattern as its context; its true context
13726 hasn't been instantiated yet and this is good enough for
13728 DECL_CONTEXT (r
) = DECL_CONTEXT (t
);
13731 if (TREE_CODE (r
) == ARGUMENT_PACK_SELECT
)
13732 r
= ARGUMENT_PACK_SELECT_ARG (r
);
13733 if (!mark_used (r
, complain
) && !(complain
& tf_error
))
13734 return error_mark_node
;
13742 if (DECL_TEMPLATE_PARM_P (t
))
13743 return tsubst_copy (DECL_INITIAL (t
), args
, complain
, in_decl
);
13744 /* There is no need to substitute into namespace-scope
13746 if (DECL_NAMESPACE_SCOPE_P (t
))
13748 /* If ARGS is NULL, then T is known to be non-dependent. */
13749 if (args
== NULL_TREE
)
13750 return scalar_constant_value (t
);
13752 /* Unfortunately, we cannot just call lookup_name here.
13755 template <int I> int f() {
13757 struct S { void g() { E e = a; } };
13760 When we instantiate f<7>::S::g(), say, lookup_name is not
13761 clever enough to find f<7>::a. */
13763 = tsubst_aggr_type (DECL_CONTEXT (t
), args
, complain
, in_decl
,
13764 /*entering_scope=*/0);
13766 for (v
= TYPE_VALUES (enum_type
);
13768 v
= TREE_CHAIN (v
))
13769 if (TREE_PURPOSE (v
) == DECL_NAME (t
))
13770 return TREE_VALUE (v
);
13772 /* We didn't find the name. That should never happen; if
13773 name-lookup found it during preliminary parsing, we
13774 should find it again here during instantiation. */
13775 gcc_unreachable ();
13780 if (PACK_EXPANSION_P (TREE_TYPE (t
)))
13782 /* Check for a local specialization set up by
13783 tsubst_pack_expansion. */
13784 if (tree r
= retrieve_local_specialization (t
))
13786 if (TREE_CODE (r
) == ARGUMENT_PACK_SELECT
)
13787 r
= ARGUMENT_PACK_SELECT_ARG (r
);
13791 /* When retrieving a capture pack from a generic lambda, remove the
13792 lambda call op's own template argument list from ARGS. Only the
13793 template arguments active for the closure type should be used to
13794 retrieve the pack specialization. */
13795 if (LAMBDA_FUNCTION_P (current_function_decl
)
13796 && (template_class_depth (DECL_CONTEXT (t
))
13797 != TMPL_ARGS_DEPTH (args
)))
13798 args
= strip_innermost_template_args (args
, 1);
13800 /* Otherwise return the full NONTYPE_ARGUMENT_PACK that
13801 tsubst_decl put in the hash table. */
13802 return retrieve_specialization (t
, args
, 0);
13805 if (DECL_CONTEXT (t
))
13809 ctx
= tsubst_aggr_type (DECL_CONTEXT (t
), args
, complain
, in_decl
,
13810 /*entering_scope=*/1);
13811 if (ctx
!= DECL_CONTEXT (t
))
13813 tree r
= lookup_field (ctx
, DECL_NAME (t
), 0, false);
13816 if (complain
& tf_error
)
13817 error ("using invalid field %qD", t
);
13818 return error_mark_node
;
13827 case FUNCTION_DECL
:
13828 if (DECL_LANG_SPECIFIC (t
) && DECL_TEMPLATE_INFO (t
))
13829 r
= tsubst (t
, args
, complain
, in_decl
);
13830 else if (local_variable_p (t
))
13832 r
= retrieve_local_specialization (t
);
13833 if (r
== NULL_TREE
)
13835 /* First try name lookup to find the instantiation. */
13836 r
= lookup_name (DECL_NAME (t
));
13839 /* Make sure that the one we found is the one we want. */
13840 tree ctx
= DECL_CONTEXT (t
);
13841 if (DECL_LANG_SPECIFIC (ctx
) && DECL_TEMPLATE_INFO (ctx
))
13842 ctx
= tsubst (ctx
, args
, complain
, in_decl
);
13843 if (ctx
!= DECL_CONTEXT (r
))
13851 /* This can happen for a variable used in a
13852 late-specified return type of a local lambda, or for a
13853 local static or constant. Building a new VAR_DECL
13854 should be OK in all those cases. */
13855 r
= tsubst_decl (t
, args
, complain
);
13856 if (decl_maybe_constant_var_p (r
))
13858 /* We can't call cp_finish_decl, so handle the
13859 initializer by hand. */
13860 tree init
= tsubst_init (DECL_INITIAL (t
), r
, args
,
13861 complain
, in_decl
);
13862 if (!processing_template_decl
)
13863 init
= maybe_constant_init (init
);
13864 if (processing_template_decl
13865 ? potential_constant_expression (init
)
13866 : reduced_constant_expression_p (init
))
13867 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (r
)
13868 = TREE_CONSTANT (r
) = true;
13869 DECL_INITIAL (r
) = init
;
13871 gcc_assert (cp_unevaluated_operand
|| TREE_STATIC (r
)
13872 || decl_constant_var_p (r
)
13873 || errorcount
|| sorrycount
);
13874 if (!processing_template_decl
)
13876 if (TREE_STATIC (r
))
13877 rest_of_decl_compilation (r
, toplevel_bindings_p (),
13880 r
= process_outer_var_ref (r
, complain
);
13883 /* Remember this for subsequent uses. */
13884 if (local_specializations
)
13885 register_local_specialization (r
, t
);
13890 if (!mark_used (r
, complain
) && !(complain
& tf_error
))
13891 return error_mark_node
;
13894 case NAMESPACE_DECL
:
13898 /* An OVERLOAD will always be a non-dependent overload set; an
13899 overload set from function scope will just be represented with an
13900 IDENTIFIER_NODE, and from class scope with a BASELINK. */
13901 gcc_assert (!uses_template_parms (t
));
13905 return tsubst_baselink (t
, current_nonlambda_class_type (),
13906 args
, complain
, in_decl
);
13908 case TEMPLATE_DECL
:
13909 if (DECL_TEMPLATE_TEMPLATE_PARM_P (t
))
13910 return tsubst (TREE_TYPE (DECL_TEMPLATE_RESULT (t
)),
13911 args
, complain
, in_decl
);
13912 else if (DECL_FUNCTION_TEMPLATE_P (t
) && DECL_MEMBER_TEMPLATE_P (t
))
13913 return tsubst (t
, args
, complain
, in_decl
);
13914 else if (DECL_CLASS_SCOPE_P (t
)
13915 && uses_template_parms (DECL_CONTEXT (t
)))
13917 /* Template template argument like the following example need
13920 template <template <class> class TT> struct C {};
13921 template <class T> struct D {
13922 template <class U> struct E {};
13927 We are processing the template argument `E' in #1 for
13928 the template instantiation #2. Originally, `E' is a
13929 TEMPLATE_DECL with `D<T>' as its DECL_CONTEXT. Now we
13930 have to substitute this with one having context `D<int>'. */
13932 tree context
= tsubst (DECL_CONTEXT (t
), args
, complain
, in_decl
);
13933 return lookup_field (context
, DECL_NAME(t
), 0, false);
13936 /* Ordinary template template argument. */
13940 case REINTERPRET_CAST_EXPR
:
13941 case CONST_CAST_EXPR
:
13942 case STATIC_CAST_EXPR
:
13943 case DYNAMIC_CAST_EXPR
:
13944 case IMPLICIT_CONV_EXPR
:
13948 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
13949 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
13950 return build1 (code
, type
, op0
);
13954 if (PACK_EXPANSION_P (TREE_OPERAND (t
, 0)))
13957 tree expanded
, op
= TREE_OPERAND (t
, 0);
13960 if (SIZEOF_EXPR_TYPE_P (t
))
13961 op
= TREE_TYPE (op
);
13963 ++cp_unevaluated_operand
;
13964 ++c_inhibit_evaluation_warnings
;
13965 /* We only want to compute the number of arguments. */
13966 expanded
= tsubst_pack_expansion (op
, args
, complain
, in_decl
);
13967 --cp_unevaluated_operand
;
13968 --c_inhibit_evaluation_warnings
;
13970 if (TREE_CODE (expanded
) == TREE_VEC
)
13971 len
= TREE_VEC_LENGTH (expanded
);
13973 if (expanded
== error_mark_node
)
13974 return error_mark_node
;
13975 else if (PACK_EXPANSION_P (expanded
)
13976 || (TREE_CODE (expanded
) == TREE_VEC
13978 && PACK_EXPANSION_P (TREE_VEC_ELT (expanded
, len
-1))))
13980 if (TREE_CODE (expanded
) == TREE_VEC
)
13981 expanded
= TREE_VEC_ELT (expanded
, len
- 1);
13983 if (TYPE_P (expanded
))
13984 return cxx_sizeof_or_alignof_type (expanded
, SIZEOF_EXPR
,
13985 complain
& tf_error
);
13987 return cxx_sizeof_or_alignof_expr (expanded
, SIZEOF_EXPR
,
13988 complain
& tf_error
);
13991 return build_int_cst (size_type_node
, len
);
13993 if (SIZEOF_EXPR_TYPE_P (t
))
13995 r
= tsubst (TREE_TYPE (TREE_OPERAND (t
, 0)),
13996 args
, complain
, in_decl
);
13997 r
= build1 (NOP_EXPR
, r
, error_mark_node
);
13998 r
= build1 (SIZEOF_EXPR
,
13999 tsubst (TREE_TYPE (t
), args
, complain
, in_decl
), r
);
14000 SIZEOF_EXPR_TYPE_P (r
) = 1;
14007 case TRUTH_NOT_EXPR
:
14010 case UNARY_PLUS_EXPR
: /* Unary + */
14012 case AT_ENCODE_EXPR
:
14016 case REALPART_EXPR
:
14017 case IMAGPART_EXPR
:
14020 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
14021 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
14022 return build1 (code
, type
, op0
);
14025 case COMPONENT_REF
:
14030 object
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
14031 name
= TREE_OPERAND (t
, 1);
14032 if (TREE_CODE (name
) == BIT_NOT_EXPR
)
14034 name
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
14035 complain
, in_decl
);
14036 name
= build1 (BIT_NOT_EXPR
, NULL_TREE
, name
);
14038 else if (TREE_CODE (name
) == SCOPE_REF
14039 && TREE_CODE (TREE_OPERAND (name
, 1)) == BIT_NOT_EXPR
)
14041 tree base
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
14042 complain
, in_decl
);
14043 name
= TREE_OPERAND (name
, 1);
14044 name
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
14045 complain
, in_decl
);
14046 name
= build1 (BIT_NOT_EXPR
, NULL_TREE
, name
);
14047 name
= build_qualified_name (/*type=*/NULL_TREE
,
14049 /*template_p=*/false);
14051 else if (BASELINK_P (name
))
14052 name
= tsubst_baselink (name
,
14053 non_reference (TREE_TYPE (object
)),
14057 name
= tsubst_copy (name
, args
, complain
, in_decl
);
14058 return build_nt (COMPONENT_REF
, object
, name
, NULL_TREE
);
14064 case TRUNC_DIV_EXPR
:
14065 case CEIL_DIV_EXPR
:
14066 case FLOOR_DIV_EXPR
:
14067 case ROUND_DIV_EXPR
:
14068 case EXACT_DIV_EXPR
:
14072 case TRUNC_MOD_EXPR
:
14073 case FLOOR_MOD_EXPR
:
14074 case TRUTH_ANDIF_EXPR
:
14075 case TRUTH_ORIF_EXPR
:
14076 case TRUTH_AND_EXPR
:
14077 case TRUTH_OR_EXPR
:
14090 case COMPOUND_EXPR
:
14093 case PREDECREMENT_EXPR
:
14094 case PREINCREMENT_EXPR
:
14095 case POSTDECREMENT_EXPR
:
14096 case POSTINCREMENT_EXPR
:
14098 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
14099 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
14100 return build_nt (code
, op0
, op1
);
14105 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
14106 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
14107 return build_qualified_name (/*type=*/NULL_TREE
, op0
, op1
,
14108 QUALIFIED_NAME_IS_TEMPLATE (t
));
14113 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
14114 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
14115 return build_nt (ARRAY_REF
, op0
, op1
, NULL_TREE
, NULL_TREE
);
14120 int n
= VL_EXP_OPERAND_LENGTH (t
);
14121 tree result
= build_vl_exp (CALL_EXPR
, n
);
14123 for (i
= 0; i
< n
; i
++)
14124 TREE_OPERAND (t
, i
) = tsubst_copy (TREE_OPERAND (t
, i
), args
,
14125 complain
, in_decl
);
14131 case PSEUDO_DTOR_EXPR
:
14132 case VEC_PERM_EXPR
:
14134 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
14135 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
14136 tree op2
= tsubst_copy (TREE_OPERAND (t
, 2), args
, complain
, in_decl
);
14137 r
= build_nt (code
, op0
, op1
, op2
);
14138 TREE_NO_WARNING (r
) = TREE_NO_WARNING (t
);
14144 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
14145 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
14146 tree op2
= tsubst_copy (TREE_OPERAND (t
, 2), args
, complain
, in_decl
);
14147 r
= build_nt (code
, op0
, op1
, op2
);
14148 NEW_EXPR_USE_GLOBAL (r
) = NEW_EXPR_USE_GLOBAL (t
);
14154 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
14155 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
14156 r
= build_nt (code
, op0
, op1
);
14157 DELETE_EXPR_USE_GLOBAL (r
) = DELETE_EXPR_USE_GLOBAL (t
);
14158 DELETE_EXPR_USE_VEC (r
) = DELETE_EXPR_USE_VEC (t
);
14162 case TEMPLATE_ID_EXPR
:
14164 /* Substituted template arguments */
14165 tree fn
= TREE_OPERAND (t
, 0);
14166 tree targs
= TREE_OPERAND (t
, 1);
14168 fn
= tsubst_copy (fn
, args
, complain
, in_decl
);
14170 targs
= tsubst_template_args (targs
, args
, complain
, in_decl
);
14172 return lookup_template_function (fn
, targs
);
14177 tree purpose
, value
, chain
;
14179 if (t
== void_list_node
)
14182 purpose
= TREE_PURPOSE (t
);
14184 purpose
= tsubst_copy (purpose
, args
, complain
, in_decl
);
14185 value
= TREE_VALUE (t
);
14187 value
= tsubst_copy (value
, args
, complain
, in_decl
);
14188 chain
= TREE_CHAIN (t
);
14189 if (chain
&& chain
!= void_type_node
)
14190 chain
= tsubst_copy (chain
, args
, complain
, in_decl
);
14191 if (purpose
== TREE_PURPOSE (t
)
14192 && value
== TREE_VALUE (t
)
14193 && chain
== TREE_CHAIN (t
))
14195 return tree_cons (purpose
, value
, chain
);
14200 case ENUMERAL_TYPE
:
14202 case TEMPLATE_TYPE_PARM
:
14203 case TEMPLATE_TEMPLATE_PARM
:
14204 case BOUND_TEMPLATE_TEMPLATE_PARM
:
14205 case TEMPLATE_PARM_INDEX
:
14207 case REFERENCE_TYPE
:
14209 case FUNCTION_TYPE
:
14212 case TYPENAME_TYPE
:
14213 case UNBOUND_CLASS_TEMPLATE
:
14215 case DECLTYPE_TYPE
:
14217 return tsubst (t
, args
, complain
, in_decl
);
14221 /* Fall through. */
14222 case IDENTIFIER_NODE
:
14223 if (IDENTIFIER_TYPENAME_P (t
))
14225 tree new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
14226 return mangle_conv_op_name_for_type (new_type
);
14232 /* This is handled by tsubst_copy_and_build. */
14233 gcc_unreachable ();
14237 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
14238 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
14239 return build_x_va_arg (EXPR_LOCATION (t
), op0
, type
);
14242 case CLEANUP_POINT_EXPR
:
14243 /* We shouldn't have built any of these during initial template
14244 generation. Instead, they should be built during instantiation
14245 in response to the saved STMT_IS_FULL_EXPR_P setting. */
14246 gcc_unreachable ();
14250 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
14251 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
14252 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
14253 r
= build2 (code
, type
, op0
, op1
);
14254 PTRMEM_OK_P (r
) = PTRMEM_OK_P (t
);
14255 if (!mark_used (TREE_OPERAND (r
, 1), complain
)
14256 && !(complain
& tf_error
))
14257 return error_mark_node
;
14261 case EXPR_PACK_EXPANSION
:
14262 error ("invalid use of pack expansion expression");
14263 return error_mark_node
;
14265 case NONTYPE_ARGUMENT_PACK
:
14266 error ("use %<...%> to expand argument pack");
14267 return error_mark_node
;
14270 gcc_checking_assert (t
== void_node
&& VOID_TYPE_P (TREE_TYPE (t
)));
14278 /* Instantiate any typedefs in the type. */
14279 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
14280 r
= fold_convert (type
, t
);
14281 gcc_assert (TREE_CODE (r
) == code
);
14286 /* These can sometimes show up in a partial instantiation, but never
14287 involve template parms. */
14288 gcc_assert (!uses_template_parms (t
));
14291 case UNARY_LEFT_FOLD_EXPR
:
14292 return tsubst_unary_left_fold (t
, args
, complain
, in_decl
);
14293 case UNARY_RIGHT_FOLD_EXPR
:
14294 return tsubst_unary_right_fold (t
, args
, complain
, in_decl
);
14295 case BINARY_LEFT_FOLD_EXPR
:
14296 return tsubst_binary_left_fold (t
, args
, complain
, in_decl
);
14297 case BINARY_RIGHT_FOLD_EXPR
:
14298 return tsubst_binary_right_fold (t
, args
, complain
, in_decl
);
14301 /* We shouldn't get here, but keep going if !ENABLE_CHECKING. */
14302 gcc_checking_assert (false);
14307 /* Helper function for tsubst_omp_clauses, used for instantiation of
14308 OMP_CLAUSE_DECL of clauses. */
14311 tsubst_omp_clause_decl (tree decl
, tree args
, tsubst_flags_t complain
,
14314 if (decl
== NULL_TREE
)
14317 /* Handle an OpenMP array section represented as a TREE_LIST (or
14318 OMP_CLAUSE_DEPEND_KIND). An OMP_CLAUSE_DEPEND (with a depend
14319 kind of OMP_CLAUSE_DEPEND_SINK) can also be represented as a
14320 TREE_LIST. We can handle it exactly the same as an array section
14321 (purpose, value, and a chain), even though the nomenclature
14322 (low_bound, length, etc) is different. */
14323 if (TREE_CODE (decl
) == TREE_LIST
)
14326 = tsubst_expr (TREE_PURPOSE (decl
), args
, complain
, in_decl
,
14327 /*integral_constant_expression_p=*/false);
14328 tree length
= tsubst_expr (TREE_VALUE (decl
), args
, complain
, in_decl
,
14329 /*integral_constant_expression_p=*/false);
14330 tree chain
= tsubst_omp_clause_decl (TREE_CHAIN (decl
), args
, complain
,
14332 if (TREE_PURPOSE (decl
) == low_bound
14333 && TREE_VALUE (decl
) == length
14334 && TREE_CHAIN (decl
) == chain
)
14336 tree ret
= tree_cons (low_bound
, length
, chain
);
14337 OMP_CLAUSE_DEPEND_SINK_NEGATIVE (ret
)
14338 = OMP_CLAUSE_DEPEND_SINK_NEGATIVE (decl
);
14341 tree ret
= tsubst_expr (decl
, args
, complain
, in_decl
,
14342 /*integral_constant_expression_p=*/false);
14343 /* Undo convert_from_reference tsubst_expr could have called. */
14345 && REFERENCE_REF_P (ret
)
14346 && !REFERENCE_REF_P (decl
))
14347 ret
= TREE_OPERAND (ret
, 0);
14351 /* Like tsubst_copy, but specifically for OpenMP clauses. */
14354 tsubst_omp_clauses (tree clauses
, bool declare_simd
, bool allow_fields
,
14355 tree args
, tsubst_flags_t complain
, tree in_decl
)
14357 tree new_clauses
= NULL_TREE
, nc
, oc
;
14358 tree linear_no_step
= NULL_TREE
;
14360 for (oc
= clauses
; oc
; oc
= OMP_CLAUSE_CHAIN (oc
))
14362 nc
= copy_node (oc
);
14363 OMP_CLAUSE_CHAIN (nc
) = new_clauses
;
14366 switch (OMP_CLAUSE_CODE (nc
))
14368 case OMP_CLAUSE_LASTPRIVATE
:
14369 if (OMP_CLAUSE_LASTPRIVATE_STMT (oc
))
14371 OMP_CLAUSE_LASTPRIVATE_STMT (nc
) = push_stmt_list ();
14372 tsubst_expr (OMP_CLAUSE_LASTPRIVATE_STMT (oc
), args
, complain
,
14373 in_decl
, /*integral_constant_expression_p=*/false);
14374 OMP_CLAUSE_LASTPRIVATE_STMT (nc
)
14375 = pop_stmt_list (OMP_CLAUSE_LASTPRIVATE_STMT (nc
));
14378 case OMP_CLAUSE_PRIVATE
:
14379 case OMP_CLAUSE_SHARED
:
14380 case OMP_CLAUSE_FIRSTPRIVATE
:
14381 case OMP_CLAUSE_COPYIN
:
14382 case OMP_CLAUSE_COPYPRIVATE
:
14383 case OMP_CLAUSE_UNIFORM
:
14384 case OMP_CLAUSE_DEPEND
:
14385 case OMP_CLAUSE_FROM
:
14386 case OMP_CLAUSE_TO
:
14387 case OMP_CLAUSE_MAP
:
14388 case OMP_CLAUSE_USE_DEVICE_PTR
:
14389 case OMP_CLAUSE_IS_DEVICE_PTR
:
14390 OMP_CLAUSE_DECL (nc
)
14391 = tsubst_omp_clause_decl (OMP_CLAUSE_DECL (oc
), args
, complain
,
14394 case OMP_CLAUSE_IF
:
14395 case OMP_CLAUSE_NUM_THREADS
:
14396 case OMP_CLAUSE_SCHEDULE
:
14397 case OMP_CLAUSE_COLLAPSE
:
14398 case OMP_CLAUSE_FINAL
:
14399 case OMP_CLAUSE_DEVICE
:
14400 case OMP_CLAUSE_DIST_SCHEDULE
:
14401 case OMP_CLAUSE_NUM_TEAMS
:
14402 case OMP_CLAUSE_THREAD_LIMIT
:
14403 case OMP_CLAUSE_SAFELEN
:
14404 case OMP_CLAUSE_SIMDLEN
:
14405 case OMP_CLAUSE_NUM_TASKS
:
14406 case OMP_CLAUSE_GRAINSIZE
:
14407 case OMP_CLAUSE_PRIORITY
:
14408 case OMP_CLAUSE_ORDERED
:
14409 case OMP_CLAUSE_HINT
:
14410 OMP_CLAUSE_OPERAND (nc
, 0)
14411 = tsubst_expr (OMP_CLAUSE_OPERAND (oc
, 0), args
, complain
,
14412 in_decl
, /*integral_constant_expression_p=*/false);
14414 case OMP_CLAUSE_REDUCTION
:
14415 if (OMP_CLAUSE_REDUCTION_PLACEHOLDER (oc
))
14417 tree placeholder
= OMP_CLAUSE_REDUCTION_PLACEHOLDER (oc
);
14418 if (TREE_CODE (placeholder
) == SCOPE_REF
)
14420 tree scope
= tsubst (TREE_OPERAND (placeholder
, 0), args
,
14421 complain
, in_decl
);
14422 OMP_CLAUSE_REDUCTION_PLACEHOLDER (nc
)
14423 = build_qualified_name (NULL_TREE
, scope
,
14424 TREE_OPERAND (placeholder
, 1),
14428 gcc_assert (identifier_p (placeholder
));
14430 OMP_CLAUSE_DECL (nc
)
14431 = tsubst_omp_clause_decl (OMP_CLAUSE_DECL (oc
), args
, complain
,
14434 case OMP_CLAUSE_LINEAR
:
14435 case OMP_CLAUSE_ALIGNED
:
14436 OMP_CLAUSE_DECL (nc
)
14437 = tsubst_omp_clause_decl (OMP_CLAUSE_DECL (oc
), args
, complain
,
14439 OMP_CLAUSE_OPERAND (nc
, 1)
14440 = tsubst_expr (OMP_CLAUSE_OPERAND (oc
, 1), args
, complain
,
14441 in_decl
, /*integral_constant_expression_p=*/false);
14442 if (OMP_CLAUSE_CODE (oc
) == OMP_CLAUSE_LINEAR
14443 && OMP_CLAUSE_LINEAR_STEP (oc
) == NULL_TREE
)
14445 gcc_assert (!linear_no_step
);
14446 linear_no_step
= nc
;
14449 case OMP_CLAUSE_NOWAIT
:
14450 case OMP_CLAUSE_DEFAULT
:
14451 case OMP_CLAUSE_UNTIED
:
14452 case OMP_CLAUSE_MERGEABLE
:
14453 case OMP_CLAUSE_INBRANCH
:
14454 case OMP_CLAUSE_NOTINBRANCH
:
14455 case OMP_CLAUSE_PROC_BIND
:
14456 case OMP_CLAUSE_FOR
:
14457 case OMP_CLAUSE_PARALLEL
:
14458 case OMP_CLAUSE_SECTIONS
:
14459 case OMP_CLAUSE_TASKGROUP
:
14460 case OMP_CLAUSE_NOGROUP
:
14461 case OMP_CLAUSE_THREADS
:
14462 case OMP_CLAUSE_SIMD
:
14463 case OMP_CLAUSE_DEFAULTMAP
:
14466 gcc_unreachable ();
14469 switch (OMP_CLAUSE_CODE (nc
))
14471 case OMP_CLAUSE_PRIVATE
:
14472 case OMP_CLAUSE_FIRSTPRIVATE
:
14473 case OMP_CLAUSE_LASTPRIVATE
:
14474 case OMP_CLAUSE_COPYPRIVATE
:
14475 case OMP_CLAUSE_LINEAR
:
14476 case OMP_CLAUSE_REDUCTION
:
14477 case OMP_CLAUSE_USE_DEVICE_PTR
:
14478 case OMP_CLAUSE_IS_DEVICE_PTR
:
14479 /* tsubst_expr on SCOPE_REF results in returning
14480 finish_non_static_data_member result. Undo that here. */
14481 if (TREE_CODE (OMP_CLAUSE_DECL (oc
)) == SCOPE_REF
14482 && (TREE_CODE (TREE_OPERAND (OMP_CLAUSE_DECL (oc
), 1))
14483 == IDENTIFIER_NODE
))
14485 tree t
= OMP_CLAUSE_DECL (nc
);
14488 switch (TREE_CODE (v
))
14490 case COMPONENT_REF
:
14494 case POINTER_PLUS_EXPR
:
14495 v
= TREE_OPERAND (v
, 0);
14498 if (DECL_CONTEXT (v
) == current_function_decl
14499 && DECL_ARTIFICIAL (v
)
14500 && DECL_NAME (v
) == this_identifier
)
14501 OMP_CLAUSE_DECL (nc
) = TREE_OPERAND (t
, 1);
14508 else if (VAR_P (OMP_CLAUSE_DECL (oc
))
14509 && DECL_HAS_VALUE_EXPR_P (OMP_CLAUSE_DECL (oc
))
14510 && DECL_ARTIFICIAL (OMP_CLAUSE_DECL (oc
))
14511 && DECL_LANG_SPECIFIC (OMP_CLAUSE_DECL (oc
))
14512 && DECL_OMP_PRIVATIZED_MEMBER (OMP_CLAUSE_DECL (oc
)))
14514 tree decl
= OMP_CLAUSE_DECL (nc
);
14517 if (!DECL_LANG_SPECIFIC (decl
))
14518 retrofit_lang_decl (decl
);
14519 DECL_OMP_PRIVATIZED_MEMBER (decl
) = 1;
14528 new_clauses
= nreverse (new_clauses
);
14531 new_clauses
= finish_omp_clauses (new_clauses
, allow_fields
);
14532 if (linear_no_step
)
14533 for (nc
= new_clauses
; nc
; nc
= OMP_CLAUSE_CHAIN (nc
))
14534 if (nc
== linear_no_step
)
14536 OMP_CLAUSE_LINEAR_STEP (nc
) = NULL_TREE
;
14540 return new_clauses
;
14543 /* Like tsubst_copy_and_build, but unshare TREE_LIST nodes. */
14546 tsubst_copy_asm_operands (tree t
, tree args
, tsubst_flags_t complain
,
14549 #define RECUR(t) tsubst_copy_asm_operands (t, args, complain, in_decl)
14551 tree purpose
, value
, chain
;
14556 if (TREE_CODE (t
) != TREE_LIST
)
14557 return tsubst_copy_and_build (t
, args
, complain
, in_decl
,
14558 /*function_p=*/false,
14559 /*integral_constant_expression_p=*/false);
14561 if (t
== void_list_node
)
14564 purpose
= TREE_PURPOSE (t
);
14566 purpose
= RECUR (purpose
);
14567 value
= TREE_VALUE (t
);
14570 if (TREE_CODE (value
) != LABEL_DECL
)
14571 value
= RECUR (value
);
14574 value
= lookup_label (DECL_NAME (value
));
14575 gcc_assert (TREE_CODE (value
) == LABEL_DECL
);
14576 TREE_USED (value
) = 1;
14579 chain
= TREE_CHAIN (t
);
14580 if (chain
&& chain
!= void_type_node
)
14581 chain
= RECUR (chain
);
14582 return tree_cons (purpose
, value
, chain
);
14586 /* Used to temporarily communicate the list of #pragma omp parallel
14587 clauses to #pragma omp for instantiation if they are combined
14590 static tree
*omp_parallel_combined_clauses
;
14592 /* Substitute one OMP_FOR iterator. */
14595 tsubst_omp_for_iterator (tree t
, int i
, tree declv
, tree orig_declv
,
14596 tree initv
, tree condv
, tree incrv
, tree
*clauses
,
14597 tree args
, tsubst_flags_t complain
, tree in_decl
,
14598 bool integral_constant_expression_p
)
14600 #define RECUR(NODE) \
14601 tsubst_expr ((NODE), args, complain, in_decl, \
14602 integral_constant_expression_p)
14603 tree decl
, init
, cond
, incr
;
14605 init
= TREE_VEC_ELT (OMP_FOR_INIT (t
), i
);
14606 gcc_assert (TREE_CODE (init
) == MODIFY_EXPR
);
14608 if (orig_declv
&& OMP_FOR_ORIG_DECLS (t
))
14610 tree o
= TREE_VEC_ELT (OMP_FOR_ORIG_DECLS (t
), i
);
14611 TREE_VEC_ELT (orig_declv
, i
) = RECUR (o
);
14614 decl
= TREE_OPERAND (init
, 0);
14615 init
= TREE_OPERAND (init
, 1);
14616 tree decl_expr
= NULL_TREE
;
14617 if (init
&& TREE_CODE (init
) == DECL_EXPR
)
14619 /* We need to jump through some hoops to handle declarations in the
14620 for-init-statement, since we might need to handle auto deduction,
14621 but we need to keep control of initialization. */
14623 init
= DECL_INITIAL (DECL_EXPR_DECL (init
));
14624 decl
= tsubst_decl (decl
, args
, complain
);
14628 if (TREE_CODE (decl
) == SCOPE_REF
)
14630 decl
= RECUR (decl
);
14631 if (TREE_CODE (decl
) == COMPONENT_REF
)
14635 switch (TREE_CODE (v
))
14637 case COMPONENT_REF
:
14641 case POINTER_PLUS_EXPR
:
14642 v
= TREE_OPERAND (v
, 0);
14645 if (DECL_CONTEXT (v
) == current_function_decl
14646 && DECL_ARTIFICIAL (v
)
14647 && DECL_NAME (v
) == this_identifier
)
14649 decl
= TREE_OPERAND (decl
, 1);
14650 decl
= omp_privatize_field (decl
);
14660 decl
= RECUR (decl
);
14662 init
= RECUR (init
);
14664 tree auto_node
= type_uses_auto (TREE_TYPE (decl
));
14665 if (auto_node
&& init
)
14667 = do_auto_deduction (TREE_TYPE (decl
), init
, auto_node
);
14669 gcc_assert (!type_dependent_expression_p (decl
));
14671 if (!CLASS_TYPE_P (TREE_TYPE (decl
)))
14675 /* Declare the variable, but don't let that initialize it. */
14676 tree init_sav
= DECL_INITIAL (DECL_EXPR_DECL (decl_expr
));
14677 DECL_INITIAL (DECL_EXPR_DECL (decl_expr
)) = NULL_TREE
;
14679 DECL_INITIAL (DECL_EXPR_DECL (decl_expr
)) = init_sav
;
14682 cond
= RECUR (TREE_VEC_ELT (OMP_FOR_COND (t
), i
));
14683 incr
= TREE_VEC_ELT (OMP_FOR_INCR (t
), i
);
14684 if (TREE_CODE (incr
) == MODIFY_EXPR
)
14686 tree lhs
= RECUR (TREE_OPERAND (incr
, 0));
14687 tree rhs
= RECUR (TREE_OPERAND (incr
, 1));
14688 incr
= build_x_modify_expr (EXPR_LOCATION (incr
), lhs
,
14689 NOP_EXPR
, rhs
, complain
);
14692 incr
= RECUR (incr
);
14693 TREE_VEC_ELT (declv
, i
) = decl
;
14694 TREE_VEC_ELT (initv
, i
) = init
;
14695 TREE_VEC_ELT (condv
, i
) = cond
;
14696 TREE_VEC_ELT (incrv
, i
) = incr
;
14702 /* Declare and initialize the variable. */
14710 for (j
= (omp_parallel_combined_clauses
== NULL
? 1 : 0); j
< 2; j
++)
14712 for (pc
= j
? clauses
: omp_parallel_combined_clauses
; *pc
; )
14714 if (OMP_CLAUSE_CODE (*pc
) == OMP_CLAUSE_PRIVATE
14715 && OMP_CLAUSE_DECL (*pc
) == decl
)
14717 else if (OMP_CLAUSE_CODE (*pc
) == OMP_CLAUSE_LASTPRIVATE
14718 && OMP_CLAUSE_DECL (*pc
) == decl
)
14722 /* Move lastprivate (decl) clause to OMP_FOR_CLAUSES. */
14724 *pc
= OMP_CLAUSE_CHAIN (c
);
14725 OMP_CLAUSE_CHAIN (c
) = *clauses
;
14728 else if (OMP_CLAUSE_CODE (*pc
) == OMP_CLAUSE_FIRSTPRIVATE
14729 && OMP_CLAUSE_DECL (*pc
) == decl
)
14731 error ("iteration variable %qD should not be firstprivate",
14733 *pc
= OMP_CLAUSE_CHAIN (*pc
);
14735 else if (OMP_CLAUSE_CODE (*pc
) == OMP_CLAUSE_REDUCTION
14736 && OMP_CLAUSE_DECL (*pc
) == decl
)
14738 error ("iteration variable %qD should not be reduction",
14740 *pc
= OMP_CLAUSE_CHAIN (*pc
);
14743 pc
= &OMP_CLAUSE_CHAIN (*pc
);
14748 if (*pc
== NULL_TREE
)
14750 tree c
= build_omp_clause (input_location
, OMP_CLAUSE_PRIVATE
);
14751 OMP_CLAUSE_DECL (c
) = decl
;
14752 c
= finish_omp_clauses (c
, true);
14755 OMP_CLAUSE_CHAIN (c
) = *clauses
;
14760 cond
= TREE_VEC_ELT (OMP_FOR_COND (t
), i
);
14761 if (COMPARISON_CLASS_P (cond
))
14763 tree op0
= RECUR (TREE_OPERAND (cond
, 0));
14764 tree op1
= RECUR (TREE_OPERAND (cond
, 1));
14765 cond
= build2 (TREE_CODE (cond
), boolean_type_node
, op0
, op1
);
14768 cond
= RECUR (cond
);
14769 incr
= TREE_VEC_ELT (OMP_FOR_INCR (t
), i
);
14770 switch (TREE_CODE (incr
))
14772 case PREINCREMENT_EXPR
:
14773 case PREDECREMENT_EXPR
:
14774 case POSTINCREMENT_EXPR
:
14775 case POSTDECREMENT_EXPR
:
14776 incr
= build2 (TREE_CODE (incr
), TREE_TYPE (decl
),
14777 RECUR (TREE_OPERAND (incr
, 0)), NULL_TREE
);
14780 if (TREE_CODE (TREE_OPERAND (incr
, 1)) == PLUS_EXPR
14781 || TREE_CODE (TREE_OPERAND (incr
, 1)) == MINUS_EXPR
)
14783 tree rhs
= TREE_OPERAND (incr
, 1);
14784 tree lhs
= RECUR (TREE_OPERAND (incr
, 0));
14785 tree rhs0
= RECUR (TREE_OPERAND (rhs
, 0));
14786 tree rhs1
= RECUR (TREE_OPERAND (rhs
, 1));
14787 incr
= build2 (MODIFY_EXPR
, TREE_TYPE (decl
), lhs
,
14788 build2 (TREE_CODE (rhs
), TREE_TYPE (decl
),
14792 incr
= RECUR (incr
);
14795 if (TREE_CODE (TREE_OPERAND (incr
, 1)) == PLUS_EXPR
14796 || TREE_CODE (TREE_OPERAND (incr
, 1)) == MINUS_EXPR
)
14798 tree lhs
= RECUR (TREE_OPERAND (incr
, 0));
14799 incr
= build2 (MODIFY_EXPR
, TREE_TYPE (decl
), lhs
,
14800 build2 (TREE_CODE (TREE_OPERAND (incr
, 1)),
14801 TREE_TYPE (decl
), lhs
,
14802 RECUR (TREE_OPERAND (incr
, 2))));
14804 else if (TREE_CODE (TREE_OPERAND (incr
, 1)) == NOP_EXPR
14805 && (TREE_CODE (TREE_OPERAND (incr
, 2)) == PLUS_EXPR
14806 || (TREE_CODE (TREE_OPERAND (incr
, 2)) == MINUS_EXPR
)))
14808 tree rhs
= TREE_OPERAND (incr
, 2);
14809 tree lhs
= RECUR (TREE_OPERAND (incr
, 0));
14810 tree rhs0
= RECUR (TREE_OPERAND (rhs
, 0));
14811 tree rhs1
= RECUR (TREE_OPERAND (rhs
, 1));
14812 incr
= build2 (MODIFY_EXPR
, TREE_TYPE (decl
), lhs
,
14813 build2 (TREE_CODE (rhs
), TREE_TYPE (decl
),
14817 incr
= RECUR (incr
);
14820 incr
= RECUR (incr
);
14824 TREE_VEC_ELT (declv
, i
) = decl
;
14825 TREE_VEC_ELT (initv
, i
) = init
;
14826 TREE_VEC_ELT (condv
, i
) = cond
;
14827 TREE_VEC_ELT (incrv
, i
) = incr
;
14831 /* Like tsubst_copy for expressions, etc. but also does semantic
14835 tsubst_expr (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
,
14836 bool integral_constant_expression_p
)
14838 #define RETURN(EXP) do { r = (EXP); goto out; } while(0)
14839 #define RECUR(NODE) \
14840 tsubst_expr ((NODE), args, complain, in_decl, \
14841 integral_constant_expression_p)
14847 if (t
== NULL_TREE
|| t
== error_mark_node
)
14850 loc
= input_location
;
14851 if (EXPR_HAS_LOCATION (t
))
14852 input_location
= EXPR_LOCATION (t
);
14853 if (STATEMENT_CODE_P (TREE_CODE (t
)))
14854 current_stmt_tree ()->stmts_are_full_exprs_p
= STMT_IS_FULL_EXPR_P (t
);
14856 switch (TREE_CODE (t
))
14858 case STATEMENT_LIST
:
14860 tree_stmt_iterator i
;
14861 for (i
= tsi_start (t
); !tsi_end_p (i
); tsi_next (&i
))
14862 RECUR (tsi_stmt (i
));
14866 case CTOR_INITIALIZER
:
14867 finish_mem_initializers (tsubst_initializer_list
14868 (TREE_OPERAND (t
, 0), args
));
14872 finish_return_stmt (RECUR (TREE_OPERAND (t
, 0)));
14876 tmp
= RECUR (EXPR_STMT_EXPR (t
));
14877 if (EXPR_STMT_STMT_EXPR_RESULT (t
))
14878 finish_stmt_expr_expr (tmp
, cur_stmt_expr
);
14880 finish_expr_stmt (tmp
);
14884 do_using_directive (USING_STMT_NAMESPACE (t
));
14889 tree decl
, pattern_decl
;
14892 pattern_decl
= decl
= DECL_EXPR_DECL (t
);
14893 if (TREE_CODE (decl
) == LABEL_DECL
)
14894 finish_label_decl (DECL_NAME (decl
));
14895 else if (TREE_CODE (decl
) == USING_DECL
)
14897 tree scope
= USING_DECL_SCOPE (decl
);
14898 tree name
= DECL_NAME (decl
);
14901 scope
= tsubst (scope
, args
, complain
, in_decl
);
14902 decl
= lookup_qualified_name (scope
, name
,
14903 /*is_type_p=*/false,
14904 /*complain=*/false);
14905 if (decl
== error_mark_node
|| TREE_CODE (decl
) == TREE_LIST
)
14906 qualified_name_lookup_error (scope
, name
, decl
, input_location
);
14908 do_local_using_decl (decl
, scope
, name
);
14910 else if (DECL_PACK_P (decl
))
14912 /* Don't build up decls for a variadic capture proxy, we'll
14913 instantiate the elements directly as needed. */
14918 init
= DECL_INITIAL (decl
);
14919 decl
= tsubst (decl
, args
, complain
, in_decl
);
14920 if (decl
!= error_mark_node
)
14922 /* By marking the declaration as instantiated, we avoid
14923 trying to instantiate it. Since instantiate_decl can't
14924 handle local variables, and since we've already done
14925 all that needs to be done, that's the right thing to
14928 DECL_TEMPLATE_INSTANTIATED (decl
) = 1;
14930 && ANON_AGGR_TYPE_P (TREE_TYPE (decl
)))
14931 /* Anonymous aggregates are a special case. */
14932 finish_anon_union (decl
);
14933 else if (is_capture_proxy (DECL_EXPR_DECL (t
)))
14935 DECL_CONTEXT (decl
) = current_function_decl
;
14936 if (DECL_NAME (decl
) == this_identifier
)
14938 tree lam
= DECL_CONTEXT (current_function_decl
);
14939 lam
= CLASSTYPE_LAMBDA_EXPR (lam
);
14940 LAMBDA_EXPR_THIS_CAPTURE (lam
) = decl
;
14942 insert_capture_proxy (decl
);
14944 else if (DECL_IMPLICIT_TYPEDEF_P (t
))
14945 /* We already did a pushtag. */;
14946 else if (TREE_CODE (decl
) == FUNCTION_DECL
14947 && DECL_OMP_DECLARE_REDUCTION_P (decl
)
14948 && DECL_FUNCTION_SCOPE_P (pattern_decl
))
14950 DECL_CONTEXT (decl
) = NULL_TREE
;
14952 DECL_CONTEXT (decl
) = current_function_decl
;
14953 cp_check_omp_declare_reduction (decl
);
14957 int const_init
= false;
14958 maybe_push_decl (decl
);
14960 && DECL_PRETTY_FUNCTION_P (decl
))
14962 /* For __PRETTY_FUNCTION__ we have to adjust the
14964 const char *const name
14965 = cxx_printable_name (current_function_decl
, 2);
14966 init
= cp_fname_init (name
, &TREE_TYPE (decl
));
14969 init
= tsubst_init (init
, decl
, args
, complain
, in_decl
);
14972 const_init
= (DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P
14974 cp_finish_decl (decl
, init
, const_init
, NULL_TREE
, 0);
14983 stmt
= begin_for_stmt (NULL_TREE
, NULL_TREE
);
14984 RECUR (FOR_INIT_STMT (t
));
14985 finish_for_init_stmt (stmt
);
14986 tmp
= RECUR (FOR_COND (t
));
14987 finish_for_cond (tmp
, stmt
, false);
14988 tmp
= RECUR (FOR_EXPR (t
));
14989 finish_for_expr (tmp
, stmt
);
14990 RECUR (FOR_BODY (t
));
14991 finish_for_stmt (stmt
);
14994 case RANGE_FOR_STMT
:
14997 stmt
= begin_for_stmt (NULL_TREE
, NULL_TREE
);
14998 decl
= RANGE_FOR_DECL (t
);
14999 decl
= tsubst (decl
, args
, complain
, in_decl
);
15000 maybe_push_decl (decl
);
15001 expr
= RECUR (RANGE_FOR_EXPR (t
));
15002 stmt
= cp_convert_range_for (stmt
, decl
, expr
, RANGE_FOR_IVDEP (t
));
15003 RECUR (RANGE_FOR_BODY (t
));
15004 finish_for_stmt (stmt
);
15009 stmt
= begin_while_stmt ();
15010 tmp
= RECUR (WHILE_COND (t
));
15011 finish_while_stmt_cond (tmp
, stmt
, false);
15012 RECUR (WHILE_BODY (t
));
15013 finish_while_stmt (stmt
);
15017 stmt
= begin_do_stmt ();
15018 RECUR (DO_BODY (t
));
15019 finish_do_body (stmt
);
15020 tmp
= RECUR (DO_COND (t
));
15021 finish_do_stmt (tmp
, stmt
, false);
15025 stmt
= begin_if_stmt ();
15026 tmp
= RECUR (IF_COND (t
));
15027 finish_if_stmt_cond (tmp
, stmt
);
15028 RECUR (THEN_CLAUSE (t
));
15029 finish_then_clause (stmt
);
15031 if (ELSE_CLAUSE (t
))
15033 begin_else_clause (stmt
);
15034 RECUR (ELSE_CLAUSE (t
));
15035 finish_else_clause (stmt
);
15038 finish_if_stmt (stmt
);
15042 if (BIND_EXPR_BODY_BLOCK (t
))
15043 stmt
= begin_function_body ();
15045 stmt
= begin_compound_stmt (BIND_EXPR_TRY_BLOCK (t
)
15046 ? BCS_TRY_BLOCK
: 0);
15048 RECUR (BIND_EXPR_BODY (t
));
15050 if (BIND_EXPR_BODY_BLOCK (t
))
15051 finish_function_body (stmt
);
15053 finish_compound_stmt (stmt
);
15057 finish_break_stmt ();
15060 case CONTINUE_STMT
:
15061 finish_continue_stmt ();
15065 stmt
= begin_switch_stmt ();
15066 tmp
= RECUR (SWITCH_STMT_COND (t
));
15067 finish_switch_cond (tmp
, stmt
);
15068 RECUR (SWITCH_STMT_BODY (t
));
15069 finish_switch_stmt (stmt
);
15072 case CASE_LABEL_EXPR
:
15074 tree low
= RECUR (CASE_LOW (t
));
15075 tree high
= RECUR (CASE_HIGH (t
));
15076 finish_case_label (EXPR_LOCATION (t
), low
, high
);
15082 tree decl
= LABEL_EXPR_LABEL (t
);
15085 label
= finish_label_stmt (DECL_NAME (decl
));
15086 if (DECL_ATTRIBUTES (decl
) != NULL_TREE
)
15087 cplus_decl_attributes (&label
, DECL_ATTRIBUTES (decl
), 0);
15092 tmp
= GOTO_DESTINATION (t
);
15093 if (TREE_CODE (tmp
) != LABEL_DECL
)
15094 /* Computed goto's must be tsubst'd into. On the other hand,
15095 non-computed gotos must not be; the identifier in question
15096 will have no binding. */
15099 tmp
= DECL_NAME (tmp
);
15100 finish_goto_stmt (tmp
);
15105 tree string
= RECUR (ASM_STRING (t
));
15106 tree outputs
= tsubst_copy_asm_operands (ASM_OUTPUTS (t
), args
,
15107 complain
, in_decl
);
15108 tree inputs
= tsubst_copy_asm_operands (ASM_INPUTS (t
), args
,
15109 complain
, in_decl
);
15110 tree clobbers
= tsubst_copy_asm_operands (ASM_CLOBBERS (t
), args
,
15111 complain
, in_decl
);
15112 tree labels
= tsubst_copy_asm_operands (ASM_LABELS (t
), args
,
15113 complain
, in_decl
);
15114 tmp
= finish_asm_stmt (ASM_VOLATILE_P (t
), string
, outputs
, inputs
,
15116 tree asm_expr
= tmp
;
15117 if (TREE_CODE (asm_expr
) == CLEANUP_POINT_EXPR
)
15118 asm_expr
= TREE_OPERAND (asm_expr
, 0);
15119 ASM_INPUT_P (asm_expr
) = ASM_INPUT_P (t
);
15126 stmt
= begin_try_block ();
15127 RECUR (TRY_STMTS (t
));
15128 finish_cleanup_try_block (stmt
);
15129 finish_cleanup (RECUR (TRY_HANDLERS (t
)), stmt
);
15133 tree compound_stmt
= NULL_TREE
;
15135 if (FN_TRY_BLOCK_P (t
))
15136 stmt
= begin_function_try_block (&compound_stmt
);
15138 stmt
= begin_try_block ();
15140 RECUR (TRY_STMTS (t
));
15142 if (FN_TRY_BLOCK_P (t
))
15143 finish_function_try_block (stmt
);
15145 finish_try_block (stmt
);
15147 RECUR (TRY_HANDLERS (t
));
15148 if (FN_TRY_BLOCK_P (t
))
15149 finish_function_handler_sequence (stmt
, compound_stmt
);
15151 finish_handler_sequence (stmt
);
15157 tree decl
= HANDLER_PARMS (t
);
15161 decl
= tsubst (decl
, args
, complain
, in_decl
);
15162 /* Prevent instantiate_decl from trying to instantiate
15163 this variable. We've already done all that needs to be
15165 if (decl
!= error_mark_node
)
15166 DECL_TEMPLATE_INSTANTIATED (decl
) = 1;
15168 stmt
= begin_handler ();
15169 finish_handler_parms (decl
, stmt
);
15170 RECUR (HANDLER_BODY (t
));
15171 finish_handler (stmt
);
15176 tmp
= tsubst (TREE_TYPE (t
), args
, complain
, NULL_TREE
);
15177 if (CLASS_TYPE_P (tmp
))
15179 /* Local classes are not independent templates; they are
15180 instantiated along with their containing function. And this
15181 way we don't have to deal with pushing out of one local class
15182 to instantiate a member of another local class. */
15184 /* Closures are handled by the LAMBDA_EXPR. */
15185 gcc_assert (!LAMBDA_TYPE_P (TREE_TYPE (t
)));
15186 complete_type (tmp
);
15187 for (fn
= TYPE_METHODS (tmp
); fn
; fn
= DECL_CHAIN (fn
))
15188 if (!DECL_ARTIFICIAL (fn
))
15189 instantiate_decl (fn
, /*defer_ok*/0, /*expl_inst_class*/false);
15193 case STATIC_ASSERT
:
15197 ++c_inhibit_evaluation_warnings
;
15199 tsubst_expr (STATIC_ASSERT_CONDITION (t
),
15202 /*integral_constant_expression_p=*/true);
15203 --c_inhibit_evaluation_warnings
;
15205 finish_static_assert (condition
,
15206 STATIC_ASSERT_MESSAGE (t
),
15207 STATIC_ASSERT_SOURCE_LOCATION (t
),
15208 /*member_p=*/false);
15213 r
= push_omp_privatization_clauses (OMP_PARALLEL_COMBINED (t
));
15214 tmp
= tsubst_omp_clauses (OMP_PARALLEL_CLAUSES (t
), false, true,
15215 args
, complain
, in_decl
);
15216 if (OMP_PARALLEL_COMBINED (t
))
15217 omp_parallel_combined_clauses
= &tmp
;
15218 stmt
= begin_omp_parallel ();
15219 RECUR (OMP_PARALLEL_BODY (t
));
15220 gcc_assert (omp_parallel_combined_clauses
== NULL
);
15221 OMP_PARALLEL_COMBINED (finish_omp_parallel (tmp
, stmt
))
15222 = OMP_PARALLEL_COMBINED (t
);
15223 pop_omp_privatization_clauses (r
);
15227 r
= push_omp_privatization_clauses (false);
15228 tmp
= tsubst_omp_clauses (OMP_TASK_CLAUSES (t
), false, true,
15229 args
, complain
, in_decl
);
15230 stmt
= begin_omp_task ();
15231 RECUR (OMP_TASK_BODY (t
));
15232 finish_omp_task (tmp
, stmt
);
15233 pop_omp_privatization_clauses (r
);
15240 case OMP_DISTRIBUTE
:
15243 tree clauses
, body
, pre_body
;
15244 tree declv
= NULL_TREE
, initv
= NULL_TREE
, condv
= NULL_TREE
;
15245 tree orig_declv
= NULL_TREE
;
15246 tree incrv
= NULL_TREE
;
15249 r
= push_omp_privatization_clauses (OMP_FOR_INIT (t
) == NULL_TREE
);
15250 clauses
= tsubst_omp_clauses (OMP_FOR_CLAUSES (t
), false, true,
15251 args
, complain
, in_decl
);
15252 if (OMP_FOR_INIT (t
) != NULL_TREE
)
15254 declv
= make_tree_vec (TREE_VEC_LENGTH (OMP_FOR_INIT (t
)));
15255 if (TREE_CODE (t
) == OMP_FOR
&& OMP_FOR_ORIG_DECLS (t
))
15256 orig_declv
= make_tree_vec (TREE_VEC_LENGTH (OMP_FOR_INIT (t
)));
15257 initv
= make_tree_vec (TREE_VEC_LENGTH (OMP_FOR_INIT (t
)));
15258 condv
= make_tree_vec (TREE_VEC_LENGTH (OMP_FOR_INIT (t
)));
15259 incrv
= make_tree_vec (TREE_VEC_LENGTH (OMP_FOR_INIT (t
)));
15262 stmt
= begin_omp_structured_block ();
15264 pre_body
= push_stmt_list ();
15265 RECUR (OMP_FOR_PRE_BODY (t
));
15266 pre_body
= pop_stmt_list (pre_body
);
15268 if (OMP_FOR_INIT (t
) != NULL_TREE
)
15269 for (i
= 0; i
< TREE_VEC_LENGTH (OMP_FOR_INIT (t
)); i
++)
15270 tsubst_omp_for_iterator (t
, i
, declv
, orig_declv
, initv
, condv
,
15271 incrv
, &clauses
, args
, complain
, in_decl
,
15272 integral_constant_expression_p
);
15273 omp_parallel_combined_clauses
= NULL
;
15275 body
= push_stmt_list ();
15276 RECUR (OMP_FOR_BODY (t
));
15277 body
= pop_stmt_list (body
);
15279 if (OMP_FOR_INIT (t
) != NULL_TREE
)
15280 t
= finish_omp_for (EXPR_LOCATION (t
), TREE_CODE (t
), declv
,
15281 orig_declv
, initv
, condv
, incrv
, body
, pre_body
,
15285 t
= make_node (TREE_CODE (t
));
15286 TREE_TYPE (t
) = void_type_node
;
15287 OMP_FOR_BODY (t
) = body
;
15288 OMP_FOR_PRE_BODY (t
) = pre_body
;
15289 OMP_FOR_CLAUSES (t
) = clauses
;
15290 SET_EXPR_LOCATION (t
, EXPR_LOCATION (t
));
15294 add_stmt (finish_omp_structured_block (stmt
));
15295 pop_omp_privatization_clauses (r
);
15300 omp_parallel_combined_clauses
= NULL
;
15305 r
= push_omp_privatization_clauses (TREE_CODE (t
) == OMP_TEAMS
15306 && OMP_TEAMS_COMBINED (t
));
15307 tmp
= tsubst_omp_clauses (OMP_CLAUSES (t
), false, true,
15308 args
, complain
, in_decl
);
15309 stmt
= push_stmt_list ();
15310 RECUR (OMP_BODY (t
));
15311 stmt
= pop_stmt_list (stmt
);
15314 OMP_BODY (t
) = stmt
;
15315 OMP_CLAUSES (t
) = tmp
;
15317 pop_omp_privatization_clauses (r
);
15320 case OMP_TARGET_DATA
:
15322 tmp
= tsubst_omp_clauses (OMP_CLAUSES (t
), false, true,
15323 args
, complain
, in_decl
);
15324 keep_next_level (true);
15325 stmt
= begin_omp_structured_block ();
15327 RECUR (OMP_BODY (t
));
15328 stmt
= finish_omp_structured_block (stmt
);
15331 OMP_BODY (t
) = stmt
;
15332 OMP_CLAUSES (t
) = tmp
;
15336 case OMP_TARGET_UPDATE
:
15337 case OMP_TARGET_ENTER_DATA
:
15338 case OMP_TARGET_EXIT_DATA
:
15339 tmp
= tsubst_omp_clauses (OMP_STANDALONE_CLAUSES (t
), false, true,
15340 args
, complain
, in_decl
);
15342 OMP_STANDALONE_CLAUSES (t
) = tmp
;
15347 tmp
= tsubst_omp_clauses (OMP_ORDERED_CLAUSES (t
), false, true,
15348 args
, complain
, in_decl
);
15349 stmt
= push_stmt_list ();
15350 RECUR (OMP_BODY (t
));
15351 stmt
= pop_stmt_list (stmt
);
15354 OMP_BODY (t
) = stmt
;
15355 OMP_ORDERED_CLAUSES (t
) = tmp
;
15361 case OMP_TASKGROUP
:
15362 stmt
= push_stmt_list ();
15363 RECUR (OMP_BODY (t
));
15364 stmt
= pop_stmt_list (stmt
);
15367 OMP_BODY (t
) = stmt
;
15372 gcc_assert (OMP_ATOMIC_DEPENDENT_P (t
));
15373 if (TREE_CODE (TREE_OPERAND (t
, 1)) != MODIFY_EXPR
)
15375 tree op1
= TREE_OPERAND (t
, 1);
15376 tree rhs1
= NULL_TREE
;
15378 if (TREE_CODE (op1
) == COMPOUND_EXPR
)
15380 rhs1
= RECUR (TREE_OPERAND (op1
, 0));
15381 op1
= TREE_OPERAND (op1
, 1);
15383 lhs
= RECUR (TREE_OPERAND (op1
, 0));
15384 rhs
= RECUR (TREE_OPERAND (op1
, 1));
15385 finish_omp_atomic (OMP_ATOMIC
, TREE_CODE (op1
), lhs
, rhs
,
15386 NULL_TREE
, NULL_TREE
, rhs1
,
15387 OMP_ATOMIC_SEQ_CST (t
));
15391 tree op1
= TREE_OPERAND (t
, 1);
15392 tree v
= NULL_TREE
, lhs
, rhs
= NULL_TREE
, lhs1
= NULL_TREE
;
15393 tree rhs1
= NULL_TREE
;
15394 enum tree_code code
= TREE_CODE (TREE_OPERAND (op1
, 1));
15395 enum tree_code opcode
= NOP_EXPR
;
15396 if (code
== OMP_ATOMIC_READ
)
15398 v
= RECUR (TREE_OPERAND (op1
, 0));
15399 lhs
= RECUR (TREE_OPERAND (TREE_OPERAND (op1
, 1), 0));
15401 else if (code
== OMP_ATOMIC_CAPTURE_OLD
15402 || code
== OMP_ATOMIC_CAPTURE_NEW
)
15404 tree op11
= TREE_OPERAND (TREE_OPERAND (op1
, 1), 1);
15405 v
= RECUR (TREE_OPERAND (op1
, 0));
15406 lhs1
= RECUR (TREE_OPERAND (TREE_OPERAND (op1
, 1), 0));
15407 if (TREE_CODE (op11
) == COMPOUND_EXPR
)
15409 rhs1
= RECUR (TREE_OPERAND (op11
, 0));
15410 op11
= TREE_OPERAND (op11
, 1);
15412 lhs
= RECUR (TREE_OPERAND (op11
, 0));
15413 rhs
= RECUR (TREE_OPERAND (op11
, 1));
15414 opcode
= TREE_CODE (op11
);
15415 if (opcode
== MODIFY_EXPR
)
15421 lhs
= RECUR (TREE_OPERAND (op1
, 0));
15422 rhs
= RECUR (TREE_OPERAND (op1
, 1));
15424 finish_omp_atomic (code
, opcode
, lhs
, rhs
, v
, lhs1
, rhs1
,
15425 OMP_ATOMIC_SEQ_CST (t
));
15429 case TRANSACTION_EXPR
:
15432 flags
|= (TRANSACTION_EXPR_OUTER (t
) ? TM_STMT_ATTR_OUTER
: 0);
15433 flags
|= (TRANSACTION_EXPR_RELAXED (t
) ? TM_STMT_ATTR_RELAXED
: 0);
15435 if (TRANSACTION_EXPR_IS_STMT (t
))
15437 tree body
= TRANSACTION_EXPR_BODY (t
);
15438 tree noex
= NULL_TREE
;
15439 if (TREE_CODE (body
) == MUST_NOT_THROW_EXPR
)
15441 noex
= MUST_NOT_THROW_COND (body
);
15442 if (noex
== NULL_TREE
)
15443 noex
= boolean_true_node
;
15444 body
= TREE_OPERAND (body
, 0);
15446 stmt
= begin_transaction_stmt (input_location
, NULL
, flags
);
15448 finish_transaction_stmt (stmt
, NULL
, flags
, RECUR (noex
));
15452 stmt
= build_transaction_expr (EXPR_LOCATION (t
),
15453 RECUR (TRANSACTION_EXPR_BODY (t
)),
15460 case MUST_NOT_THROW_EXPR
:
15462 tree op0
= RECUR (TREE_OPERAND (t
, 0));
15463 tree cond
= RECUR (MUST_NOT_THROW_COND (t
));
15464 RETURN (build_must_not_throw_expr (op0
, cond
));
15467 case EXPR_PACK_EXPANSION
:
15468 error ("invalid use of pack expansion expression");
15469 RETURN (error_mark_node
);
15471 case NONTYPE_ARGUMENT_PACK
:
15472 error ("use %<...%> to expand argument pack");
15473 RETURN (error_mark_node
);
15475 case CILK_SPAWN_STMT
:
15476 cfun
->calls_cilk_spawn
= 1;
15477 RETURN (build_cilk_spawn (EXPR_LOCATION (t
), RECUR (CILK_SPAWN_FN (t
))));
15479 case CILK_SYNC_STMT
:
15480 RETURN (build_cilk_sync ());
15482 case COMPOUND_EXPR
:
15483 tmp
= RECUR (TREE_OPERAND (t
, 0));
15484 if (tmp
== NULL_TREE
)
15485 /* If the first operand was a statement, we're done with it. */
15486 RETURN (RECUR (TREE_OPERAND (t
, 1)));
15487 RETURN (build_x_compound_expr (EXPR_LOCATION (t
), tmp
,
15488 RECUR (TREE_OPERAND (t
, 1)),
15491 case ANNOTATE_EXPR
:
15492 tmp
= RECUR (TREE_OPERAND (t
, 0));
15493 RETURN (build2_loc (EXPR_LOCATION (t
), ANNOTATE_EXPR
,
15494 TREE_TYPE (tmp
), tmp
, RECUR (TREE_OPERAND (t
, 1))));
15497 gcc_assert (!STATEMENT_CODE_P (TREE_CODE (t
)));
15499 RETURN (tsubst_copy_and_build (t
, args
, complain
, in_decl
,
15500 /*function_p=*/false,
15501 integral_constant_expression_p
));
15504 RETURN (NULL_TREE
);
15506 input_location
= loc
;
15512 /* Instantiate the special body of the artificial DECL_OMP_DECLARE_REDUCTION
15513 function. For description of the body see comment above
15514 cp_parser_omp_declare_reduction_exprs. */
15517 tsubst_omp_udr (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
15519 if (t
== NULL_TREE
|| t
== error_mark_node
)
15522 gcc_assert (TREE_CODE (t
) == STATEMENT_LIST
);
15524 tree_stmt_iterator tsi
;
15527 memset (stmts
, 0, sizeof stmts
);
15528 for (i
= 0, tsi
= tsi_start (t
);
15529 i
< 7 && !tsi_end_p (tsi
);
15530 i
++, tsi_next (&tsi
))
15531 stmts
[i
] = tsi_stmt (tsi
);
15532 gcc_assert (tsi_end_p (tsi
));
15536 gcc_assert (TREE_CODE (stmts
[0]) == DECL_EXPR
15537 && TREE_CODE (stmts
[1]) == DECL_EXPR
);
15538 tree omp_out
= tsubst (DECL_EXPR_DECL (stmts
[0]),
15539 args
, complain
, in_decl
);
15540 tree omp_in
= tsubst (DECL_EXPR_DECL (stmts
[1]),
15541 args
, complain
, in_decl
);
15542 DECL_CONTEXT (omp_out
) = current_function_decl
;
15543 DECL_CONTEXT (omp_in
) = current_function_decl
;
15544 keep_next_level (true);
15545 tree block
= begin_omp_structured_block ();
15546 tsubst_expr (stmts
[2], args
, complain
, in_decl
, false);
15547 block
= finish_omp_structured_block (block
);
15548 block
= maybe_cleanup_point_expr_void (block
);
15549 add_decl_expr (omp_out
);
15550 if (TREE_NO_WARNING (DECL_EXPR_DECL (stmts
[0])))
15551 TREE_NO_WARNING (omp_out
) = 1;
15552 add_decl_expr (omp_in
);
15553 finish_expr_stmt (block
);
15557 gcc_assert (TREE_CODE (stmts
[3]) == DECL_EXPR
15558 && TREE_CODE (stmts
[4]) == DECL_EXPR
);
15559 tree omp_priv
= tsubst (DECL_EXPR_DECL (stmts
[3]),
15560 args
, complain
, in_decl
);
15561 tree omp_orig
= tsubst (DECL_EXPR_DECL (stmts
[4]),
15562 args
, complain
, in_decl
);
15563 DECL_CONTEXT (omp_priv
) = current_function_decl
;
15564 DECL_CONTEXT (omp_orig
) = current_function_decl
;
15565 keep_next_level (true);
15566 tree block
= begin_omp_structured_block ();
15567 tsubst_expr (stmts
[5], args
, complain
, in_decl
, false);
15568 block
= finish_omp_structured_block (block
);
15569 block
= maybe_cleanup_point_expr_void (block
);
15570 cp_walk_tree (&block
, cp_remove_omp_priv_cleanup_stmt
, omp_priv
, NULL
);
15571 add_decl_expr (omp_priv
);
15572 add_decl_expr (omp_orig
);
15573 finish_expr_stmt (block
);
15575 add_decl_expr (omp_orig
);
15579 /* T is a postfix-expression that is not being used in a function
15580 call. Return the substituted version of T. */
15583 tsubst_non_call_postfix_expression (tree t
, tree args
,
15584 tsubst_flags_t complain
,
15587 if (TREE_CODE (t
) == SCOPE_REF
)
15588 t
= tsubst_qualified_id (t
, args
, complain
, in_decl
,
15589 /*done=*/false, /*address_p=*/false);
15591 t
= tsubst_copy_and_build (t
, args
, complain
, in_decl
,
15592 /*function_p=*/false,
15593 /*integral_constant_expression_p=*/false);
15598 /* Like tsubst but deals with expressions and performs semantic
15599 analysis. FUNCTION_P is true if T is the "F" in "F (ARGS)". */
15602 tsubst_copy_and_build (tree t
,
15604 tsubst_flags_t complain
,
15607 bool integral_constant_expression_p
)
15609 #define RETURN(EXP) do { retval = (EXP); goto out; } while(0)
15610 #define RECUR(NODE) \
15611 tsubst_copy_and_build (NODE, args, complain, in_decl, \
15612 /*function_p=*/false, \
15613 integral_constant_expression_p)
15618 if (t
== NULL_TREE
|| t
== error_mark_node
)
15621 loc
= input_location
;
15622 if (EXPR_HAS_LOCATION (t
))
15623 input_location
= EXPR_LOCATION (t
);
15625 /* N3276 decltype magic only applies to calls at the top level or on the
15626 right side of a comma. */
15627 tsubst_flags_t decltype_flag
= (complain
& tf_decltype
);
15628 complain
&= ~tf_decltype
;
15630 switch (TREE_CODE (t
))
15634 /* Fall through. */
15635 case IDENTIFIER_NODE
:
15639 bool non_integral_constant_expression_p
;
15640 const char *error_msg
;
15642 if (IDENTIFIER_TYPENAME_P (t
))
15644 tree new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
15645 t
= mangle_conv_op_name_for_type (new_type
);
15648 /* Look up the name. */
15649 decl
= lookup_name (t
);
15651 /* By convention, expressions use ERROR_MARK_NODE to indicate
15652 failure, not NULL_TREE. */
15653 if (decl
== NULL_TREE
)
15654 decl
= error_mark_node
;
15656 decl
= finish_id_expression (t
, decl
, NULL_TREE
,
15658 integral_constant_expression_p
,
15659 /*allow_non_integral_constant_expression_p=*/(cxx_dialect
>= cxx11
),
15660 &non_integral_constant_expression_p
,
15661 /*template_p=*/false,
15663 /*address_p=*/false,
15664 /*template_arg_p=*/false,
15669 if (!function_p
&& identifier_p (decl
))
15671 if (complain
& tf_error
)
15672 unqualified_name_lookup_error (decl
);
15673 decl
= error_mark_node
;
15678 case TEMPLATE_ID_EXPR
:
15681 tree templ
= RECUR (TREE_OPERAND (t
, 0));
15682 tree targs
= TREE_OPERAND (t
, 1);
15685 targs
= tsubst_template_args (targs
, args
, complain
, in_decl
);
15686 if (targs
== error_mark_node
)
15687 return error_mark_node
;
15689 if (variable_template_p (templ
))
15691 templ
= lookup_template_variable (templ
, targs
);
15692 if (!any_dependent_template_arguments_p (targs
))
15694 templ
= finish_template_variable (templ
, complain
);
15697 RETURN (convert_from_reference (templ
));
15700 if (TREE_CODE (templ
) == COMPONENT_REF
)
15702 object
= TREE_OPERAND (templ
, 0);
15703 templ
= TREE_OPERAND (templ
, 1);
15706 object
= NULL_TREE
;
15707 templ
= lookup_template_function (templ
, targs
);
15710 RETURN (build3 (COMPONENT_REF
, TREE_TYPE (templ
),
15711 object
, templ
, NULL_TREE
));
15713 RETURN (baselink_for_fns (templ
));
15718 tree r
= RECUR (TREE_OPERAND (t
, 0));
15720 if (REFERENCE_REF_P (t
))
15722 /* A type conversion to reference type will be enclosed in
15723 such an indirect ref, but the substitution of the cast
15724 will have also added such an indirect ref. */
15725 if (TREE_CODE (TREE_TYPE (r
)) == REFERENCE_TYPE
)
15726 r
= convert_from_reference (r
);
15729 r
= build_x_indirect_ref (input_location
, r
, RO_UNARY_STAR
,
15730 complain
|decltype_flag
);
15736 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
15737 tree op0
= RECUR (TREE_OPERAND (t
, 0));
15738 RETURN (build_nop (type
, op0
));
15741 case IMPLICIT_CONV_EXPR
:
15743 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
15744 tree expr
= RECUR (TREE_OPERAND (t
, 0));
15745 int flags
= LOOKUP_IMPLICIT
;
15746 if (IMPLICIT_CONV_EXPR_DIRECT_INIT (t
))
15747 flags
= LOOKUP_NORMAL
;
15748 RETURN (perform_implicit_conversion_flags (type
, expr
, complain
,
15754 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
15755 tree op0
= RECUR (TREE_OPERAND (t
, 0));
15756 RETURN (build1 (CONVERT_EXPR
, type
, op0
));
15760 case REINTERPRET_CAST_EXPR
:
15761 case CONST_CAST_EXPR
:
15762 case DYNAMIC_CAST_EXPR
:
15763 case STATIC_CAST_EXPR
:
15766 tree op
, r
= NULL_TREE
;
15768 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
15769 if (integral_constant_expression_p
15770 && !cast_valid_in_integral_constant_expression_p (type
))
15772 if (complain
& tf_error
)
15773 error ("a cast to a type other than an integral or "
15774 "enumeration type cannot appear in a constant-expression");
15775 RETURN (error_mark_node
);
15778 op
= RECUR (TREE_OPERAND (t
, 0));
15780 warning_sentinel
s(warn_useless_cast
);
15781 switch (TREE_CODE (t
))
15784 r
= build_functional_cast (type
, op
, complain
);
15786 case REINTERPRET_CAST_EXPR
:
15787 r
= build_reinterpret_cast (type
, op
, complain
);
15789 case CONST_CAST_EXPR
:
15790 r
= build_const_cast (type
, op
, complain
);
15792 case DYNAMIC_CAST_EXPR
:
15793 r
= build_dynamic_cast (type
, op
, complain
);
15795 case STATIC_CAST_EXPR
:
15796 r
= build_static_cast (type
, op
, complain
);
15799 gcc_unreachable ();
15805 case POSTDECREMENT_EXPR
:
15806 case POSTINCREMENT_EXPR
:
15807 op1
= tsubst_non_call_postfix_expression (TREE_OPERAND (t
, 0),
15808 args
, complain
, in_decl
);
15809 RETURN (build_x_unary_op (input_location
, TREE_CODE (t
), op1
,
15810 complain
|decltype_flag
));
15812 case PREDECREMENT_EXPR
:
15813 case PREINCREMENT_EXPR
:
15817 case TRUTH_NOT_EXPR
:
15818 case UNARY_PLUS_EXPR
: /* Unary + */
15819 case REALPART_EXPR
:
15820 case IMAGPART_EXPR
:
15821 RETURN (build_x_unary_op (input_location
, TREE_CODE (t
),
15822 RECUR (TREE_OPERAND (t
, 0)),
15823 complain
|decltype_flag
));
15825 case FIX_TRUNC_EXPR
:
15826 RETURN (cp_build_unary_op (FIX_TRUNC_EXPR
, RECUR (TREE_OPERAND (t
, 0)),
15830 op1
= TREE_OPERAND (t
, 0);
15831 if (TREE_CODE (op1
) == LABEL_DECL
)
15832 RETURN (finish_label_address_expr (DECL_NAME (op1
),
15833 EXPR_LOCATION (op1
)));
15834 if (TREE_CODE (op1
) == SCOPE_REF
)
15835 op1
= tsubst_qualified_id (op1
, args
, complain
, in_decl
,
15836 /*done=*/true, /*address_p=*/true);
15838 op1
= tsubst_non_call_postfix_expression (op1
, args
, complain
,
15840 RETURN (build_x_unary_op (input_location
, ADDR_EXPR
, op1
,
15841 complain
|decltype_flag
));
15846 case TRUNC_DIV_EXPR
:
15847 case CEIL_DIV_EXPR
:
15848 case FLOOR_DIV_EXPR
:
15849 case ROUND_DIV_EXPR
:
15850 case EXACT_DIV_EXPR
:
15854 case TRUNC_MOD_EXPR
:
15855 case FLOOR_MOD_EXPR
:
15856 case TRUTH_ANDIF_EXPR
:
15857 case TRUTH_ORIF_EXPR
:
15858 case TRUTH_AND_EXPR
:
15859 case TRUTH_OR_EXPR
:
15875 warning_sentinel
s1(warn_type_limits
);
15876 warning_sentinel
s2(warn_div_by_zero
);
15877 warning_sentinel
s3(warn_logical_op
);
15878 warning_sentinel
s4(warn_tautological_compare
);
15879 tree op0
= RECUR (TREE_OPERAND (t
, 0));
15880 tree op1
= RECUR (TREE_OPERAND (t
, 1));
15881 tree r
= build_x_binary_op
15882 (input_location
, TREE_CODE (t
),
15884 (TREE_NO_WARNING (TREE_OPERAND (t
, 0))
15886 : TREE_CODE (TREE_OPERAND (t
, 0))),
15888 (TREE_NO_WARNING (TREE_OPERAND (t
, 1))
15890 : TREE_CODE (TREE_OPERAND (t
, 1))),
15892 complain
|decltype_flag
);
15893 if (EXPR_P (r
) && TREE_NO_WARNING (t
))
15894 TREE_NO_WARNING (r
) = TREE_NO_WARNING (t
);
15899 case POINTER_PLUS_EXPR
:
15901 tree op0
= RECUR (TREE_OPERAND (t
, 0));
15902 tree op1
= RECUR (TREE_OPERAND (t
, 1));
15903 return fold_build_pointer_plus (op0
, op1
);
15907 RETURN (tsubst_qualified_id (t
, args
, complain
, in_decl
, /*done=*/true,
15908 /*address_p=*/false));
15910 op1
= tsubst_non_call_postfix_expression (TREE_OPERAND (t
, 0),
15911 args
, complain
, in_decl
);
15912 RETURN (build_x_array_ref (EXPR_LOCATION (t
), op1
,
15913 RECUR (TREE_OPERAND (t
, 1)),
15914 complain
|decltype_flag
));
15916 case ARRAY_NOTATION_REF
:
15918 tree start_index
, length
, stride
;
15919 op1
= tsubst_non_call_postfix_expression (ARRAY_NOTATION_ARRAY (t
),
15920 args
, complain
, in_decl
);
15921 start_index
= RECUR (ARRAY_NOTATION_START (t
));
15922 length
= RECUR (ARRAY_NOTATION_LENGTH (t
));
15923 stride
= RECUR (ARRAY_NOTATION_STRIDE (t
));
15924 RETURN (build_array_notation_ref (EXPR_LOCATION (t
), op1
, start_index
,
15925 length
, stride
, TREE_TYPE (op1
)));
15928 if (PACK_EXPANSION_P (TREE_OPERAND (t
, 0)))
15929 RETURN (tsubst_copy (t
, args
, complain
, in_decl
));
15936 op1
= TREE_OPERAND (t
, 0);
15937 if (TREE_CODE (t
) == SIZEOF_EXPR
&& SIZEOF_EXPR_TYPE_P (t
))
15938 op1
= TREE_TYPE (op1
);
15941 /* When there are no ARGS, we are trying to evaluate a
15942 non-dependent expression from the parser. Trying to do
15943 the substitutions may not work. */
15945 op1
= TREE_TYPE (op1
);
15949 ++cp_unevaluated_operand
;
15950 ++c_inhibit_evaluation_warnings
;
15952 op1
= tsubst (op1
, args
, complain
, in_decl
);
15954 op1
= tsubst_copy_and_build (op1
, args
, complain
, in_decl
,
15955 /*function_p=*/false,
15956 /*integral_constant_expression_p=*/
15958 --cp_unevaluated_operand
;
15959 --c_inhibit_evaluation_warnings
;
15962 r
= cxx_sizeof_or_alignof_type (op1
, TREE_CODE (t
),
15963 complain
& tf_error
);
15965 r
= cxx_sizeof_or_alignof_expr (op1
, TREE_CODE (t
),
15966 complain
& tf_error
);
15967 if (TREE_CODE (t
) == SIZEOF_EXPR
&& r
!= error_mark_node
)
15969 if (TREE_CODE (r
) != SIZEOF_EXPR
|| TYPE_P (op1
))
15971 if (!processing_template_decl
&& TYPE_P (op1
))
15973 r
= build_min (SIZEOF_EXPR
, size_type_node
,
15974 build1 (NOP_EXPR
, op1
, error_mark_node
));
15975 SIZEOF_EXPR_TYPE_P (r
) = 1;
15978 r
= build_min (SIZEOF_EXPR
, size_type_node
, op1
);
15979 TREE_SIDE_EFFECTS (r
) = 0;
15980 TREE_READONLY (r
) = 1;
15982 SET_EXPR_LOCATION (r
, EXPR_LOCATION (t
));
15987 case AT_ENCODE_EXPR
:
15989 op1
= TREE_OPERAND (t
, 0);
15990 ++cp_unevaluated_operand
;
15991 ++c_inhibit_evaluation_warnings
;
15992 op1
= tsubst_copy_and_build (op1
, args
, complain
, in_decl
,
15993 /*function_p=*/false,
15994 /*integral_constant_expression_p=*/false);
15995 --cp_unevaluated_operand
;
15996 --c_inhibit_evaluation_warnings
;
15997 RETURN (objc_build_encode_expr (op1
));
16000 case NOEXCEPT_EXPR
:
16001 op1
= TREE_OPERAND (t
, 0);
16002 ++cp_unevaluated_operand
;
16003 ++c_inhibit_evaluation_warnings
;
16004 ++cp_noexcept_operand
;
16005 op1
= tsubst_copy_and_build (op1
, args
, complain
, in_decl
,
16006 /*function_p=*/false,
16007 /*integral_constant_expression_p=*/false);
16008 --cp_unevaluated_operand
;
16009 --c_inhibit_evaluation_warnings
;
16010 --cp_noexcept_operand
;
16011 RETURN (finish_noexcept_expr (op1
, complain
));
16015 warning_sentinel
s(warn_div_by_zero
);
16016 tree lhs
= RECUR (TREE_OPERAND (t
, 0));
16017 tree rhs
= RECUR (TREE_OPERAND (t
, 2));
16018 tree r
= build_x_modify_expr
16019 (EXPR_LOCATION (t
), lhs
, TREE_CODE (TREE_OPERAND (t
, 1)), rhs
,
16020 complain
|decltype_flag
);
16021 /* TREE_NO_WARNING must be set if either the expression was
16022 parenthesized or it uses an operator such as >>= rather
16023 than plain assignment. In the former case, it was already
16024 set and must be copied. In the latter case,
16025 build_x_modify_expr sets it and it must not be reset
16027 if (TREE_NO_WARNING (t
))
16028 TREE_NO_WARNING (r
) = TREE_NO_WARNING (t
);
16034 op1
= tsubst_non_call_postfix_expression (TREE_OPERAND (t
, 0),
16035 args
, complain
, in_decl
);
16036 /* Remember that there was a reference to this entity. */
16038 && !mark_used (op1
, complain
) && !(complain
& tf_error
))
16039 RETURN (error_mark_node
);
16040 RETURN (build_x_arrow (input_location
, op1
, complain
));
16044 tree placement
= RECUR (TREE_OPERAND (t
, 0));
16045 tree init
= RECUR (TREE_OPERAND (t
, 3));
16046 vec
<tree
, va_gc
> *placement_vec
;
16047 vec
<tree
, va_gc
> *init_vec
;
16050 if (placement
== NULL_TREE
)
16051 placement_vec
= NULL
;
16054 placement_vec
= make_tree_vector ();
16055 for (; placement
!= NULL_TREE
; placement
= TREE_CHAIN (placement
))
16056 vec_safe_push (placement_vec
, TREE_VALUE (placement
));
16059 /* If there was an initializer in the original tree, but it
16060 instantiated to an empty list, then we should pass a
16061 non-NULL empty vector to tell build_new that it was an
16062 empty initializer() rather than no initializer. This can
16063 only happen when the initializer is a pack expansion whose
16064 parameter packs are of length zero. */
16065 if (init
== NULL_TREE
&& TREE_OPERAND (t
, 3) == NULL_TREE
)
16069 init_vec
= make_tree_vector ();
16070 if (init
== void_node
)
16071 gcc_assert (init_vec
!= NULL
);
16074 for (; init
!= NULL_TREE
; init
= TREE_CHAIN (init
))
16075 vec_safe_push (init_vec
, TREE_VALUE (init
));
16079 tree op1
= tsubst (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
16080 tree op2
= RECUR (TREE_OPERAND (t
, 2));
16081 ret
= build_new (&placement_vec
, op1
, op2
, &init_vec
,
16082 NEW_EXPR_USE_GLOBAL (t
),
16085 if (placement_vec
!= NULL
)
16086 release_tree_vector (placement_vec
);
16087 if (init_vec
!= NULL
)
16088 release_tree_vector (init_vec
);
16095 tree op0
= RECUR (TREE_OPERAND (t
, 0));
16096 tree op1
= RECUR (TREE_OPERAND (t
, 1));
16097 RETURN (delete_sanity (op0
, op1
,
16098 DELETE_EXPR_USE_VEC (t
),
16099 DELETE_EXPR_USE_GLOBAL (t
),
16103 case COMPOUND_EXPR
:
16105 tree op0
= tsubst_copy_and_build (TREE_OPERAND (t
, 0), args
,
16106 complain
& ~tf_decltype
, in_decl
,
16107 /*function_p=*/false,
16108 integral_constant_expression_p
);
16109 RETURN (build_x_compound_expr (EXPR_LOCATION (t
),
16111 RECUR (TREE_OPERAND (t
, 1)),
16112 complain
|decltype_flag
));
16118 vec
<tree
, va_gc
> *call_args
;
16119 unsigned int nargs
, i
;
16124 function
= CALL_EXPR_FN (t
);
16125 /* When we parsed the expression, we determined whether or
16126 not Koenig lookup should be performed. */
16127 koenig_p
= KOENIG_LOOKUP_P (t
);
16128 if (TREE_CODE (function
) == SCOPE_REF
)
16130 qualified_p
= true;
16131 function
= tsubst_qualified_id (function
, args
, complain
, in_decl
,
16133 /*address_p=*/false);
16135 else if (koenig_p
&& identifier_p (function
))
16137 /* Do nothing; calling tsubst_copy_and_build on an identifier
16138 would incorrectly perform unqualified lookup again.
16140 Note that we can also have an IDENTIFIER_NODE if the earlier
16141 unqualified lookup found a member function; in that case
16142 koenig_p will be false and we do want to do the lookup
16143 again to find the instantiated member function.
16145 FIXME but doing that causes c++/15272, so we need to stop
16146 using IDENTIFIER_NODE in that situation. */
16147 qualified_p
= false;
16151 if (TREE_CODE (function
) == COMPONENT_REF
)
16153 tree op
= TREE_OPERAND (function
, 1);
16155 qualified_p
= (TREE_CODE (op
) == SCOPE_REF
16156 || (BASELINK_P (op
)
16157 && BASELINK_QUALIFIED_P (op
)));
16160 qualified_p
= false;
16162 if (TREE_CODE (function
) == ADDR_EXPR
16163 && TREE_CODE (TREE_OPERAND (function
, 0)) == FUNCTION_DECL
)
16164 /* Avoid error about taking the address of a constructor. */
16165 function
= TREE_OPERAND (function
, 0);
16167 function
= tsubst_copy_and_build (function
, args
, complain
,
16170 integral_constant_expression_p
);
16172 if (BASELINK_P (function
))
16173 qualified_p
= true;
16176 nargs
= call_expr_nargs (t
);
16177 call_args
= make_tree_vector ();
16178 for (i
= 0; i
< nargs
; ++i
)
16180 tree arg
= CALL_EXPR_ARG (t
, i
);
16182 if (!PACK_EXPANSION_P (arg
))
16183 vec_safe_push (call_args
, RECUR (CALL_EXPR_ARG (t
, i
)));
16186 /* Expand the pack expansion and push each entry onto
16188 arg
= tsubst_pack_expansion (arg
, args
, complain
, in_decl
);
16189 if (TREE_CODE (arg
) == TREE_VEC
)
16191 unsigned int len
, j
;
16193 len
= TREE_VEC_LENGTH (arg
);
16194 for (j
= 0; j
< len
; ++j
)
16196 tree value
= TREE_VEC_ELT (arg
, j
);
16197 if (value
!= NULL_TREE
)
16198 value
= convert_from_reference (value
);
16199 vec_safe_push (call_args
, value
);
16204 /* A partial substitution. Add one entry. */
16205 vec_safe_push (call_args
, arg
);
16210 /* We do not perform argument-dependent lookup if normal
16211 lookup finds a non-function, in accordance with the
16212 expected resolution of DR 218. */
16214 && ((is_overloaded_fn (function
)
16215 /* If lookup found a member function, the Koenig lookup is
16216 not appropriate, even if an unqualified-name was used
16217 to denote the function. */
16218 && !DECL_FUNCTION_MEMBER_P (get_first_fn (function
)))
16219 || identifier_p (function
))
16220 /* Only do this when substitution turns a dependent call
16221 into a non-dependent call. */
16222 && type_dependent_expression_p_push (t
)
16223 && !any_type_dependent_arguments_p (call_args
))
16224 function
= perform_koenig_lookup (function
, call_args
, tf_none
);
16226 if (identifier_p (function
)
16227 && !any_type_dependent_arguments_p (call_args
))
16229 if (koenig_p
&& (complain
& tf_warning_or_error
))
16231 /* For backwards compatibility and good diagnostics, try
16232 the unqualified lookup again if we aren't in SFINAE
16234 tree unq
= (tsubst_copy_and_build
16235 (function
, args
, complain
, in_decl
, true,
16236 integral_constant_expression_p
));
16237 if (unq
== error_mark_node
)
16238 RETURN (error_mark_node
);
16240 if (unq
!= function
)
16243 if (INDIRECT_REF_P (fn
))
16244 fn
= TREE_OPERAND (fn
, 0);
16245 if (TREE_CODE (fn
) == COMPONENT_REF
)
16246 fn
= TREE_OPERAND (fn
, 1);
16247 if (is_overloaded_fn (fn
))
16248 fn
= get_first_fn (fn
);
16249 if (permerror (EXPR_LOC_OR_LOC (t
, input_location
),
16250 "%qD was not declared in this scope, "
16251 "and no declarations were found by "
16252 "argument-dependent lookup at the point "
16253 "of instantiation", function
))
16256 /* Can't say anything more. */;
16257 else if (DECL_CLASS_SCOPE_P (fn
))
16259 location_t loc
= EXPR_LOC_OR_LOC (t
,
16262 "declarations in dependent base %qT are "
16263 "not found by unqualified lookup",
16264 DECL_CLASS_CONTEXT (fn
));
16265 if (current_class_ptr
)
16267 "use %<this->%D%> instead", function
);
16270 "use %<%T::%D%> instead",
16271 current_class_name
, function
);
16274 inform (DECL_SOURCE_LOCATION (fn
),
16275 "%qD declared here, later in the "
16276 "translation unit", fn
);
16281 if (identifier_p (function
))
16283 if (complain
& tf_error
)
16284 unqualified_name_lookup_error (function
);
16285 release_tree_vector (call_args
);
16286 RETURN (error_mark_node
);
16290 /* Remember that there was a reference to this entity. */
16291 if (DECL_P (function
)
16292 && !mark_used (function
, complain
) && !(complain
& tf_error
))
16293 RETURN (error_mark_node
);
16295 /* Put back tf_decltype for the actual call. */
16296 complain
|= decltype_flag
;
16298 if (TREE_CODE (function
) == OFFSET_REF
)
16299 ret
= build_offset_ref_call_from_tree (function
, &call_args
,
16301 else if (TREE_CODE (function
) == COMPONENT_REF
)
16303 tree instance
= TREE_OPERAND (function
, 0);
16304 tree fn
= TREE_OPERAND (function
, 1);
16306 if (processing_template_decl
16307 && (type_dependent_expression_p (instance
)
16308 || (!BASELINK_P (fn
)
16309 && TREE_CODE (fn
) != FIELD_DECL
)
16310 || type_dependent_expression_p (fn
)
16311 || any_type_dependent_arguments_p (call_args
)))
16312 ret
= build_nt_call_vec (function
, call_args
);
16313 else if (!BASELINK_P (fn
))
16314 ret
= finish_call_expr (function
, &call_args
,
16315 /*disallow_virtual=*/false,
16316 /*koenig_p=*/false,
16319 ret
= (build_new_method_call
16321 &call_args
, NULL_TREE
,
16322 qualified_p
? LOOKUP_NONVIRTUAL
: LOOKUP_NORMAL
,
16327 ret
= finish_call_expr (function
, &call_args
,
16328 /*disallow_virtual=*/qualified_p
,
16332 release_tree_vector (call_args
);
16339 tree cond
= RECUR (TREE_OPERAND (t
, 0));
16340 tree folded_cond
= fold_non_dependent_expr (cond
);
16343 if (TREE_CODE (folded_cond
) == INTEGER_CST
)
16345 if (integer_zerop (folded_cond
))
16347 ++c_inhibit_evaluation_warnings
;
16348 exp1
= RECUR (TREE_OPERAND (t
, 1));
16349 --c_inhibit_evaluation_warnings
;
16350 exp2
= RECUR (TREE_OPERAND (t
, 2));
16354 exp1
= RECUR (TREE_OPERAND (t
, 1));
16355 ++c_inhibit_evaluation_warnings
;
16356 exp2
= RECUR (TREE_OPERAND (t
, 2));
16357 --c_inhibit_evaluation_warnings
;
16359 cond
= folded_cond
;
16363 exp1
= RECUR (TREE_OPERAND (t
, 1));
16364 exp2
= RECUR (TREE_OPERAND (t
, 2));
16367 RETURN (build_x_conditional_expr (EXPR_LOCATION (t
),
16368 cond
, exp1
, exp2
, complain
));
16371 case PSEUDO_DTOR_EXPR
:
16373 tree op0
= RECUR (TREE_OPERAND (t
, 0));
16374 tree op1
= RECUR (TREE_OPERAND (t
, 1));
16375 tree op2
= tsubst (TREE_OPERAND (t
, 2), args
, complain
, in_decl
);
16376 RETURN (finish_pseudo_destructor_expr (op0
, op1
, op2
,
16382 tree purpose
, value
, chain
;
16384 if (t
== void_list_node
)
16387 if ((TREE_PURPOSE (t
) && PACK_EXPANSION_P (TREE_PURPOSE (t
)))
16388 || (TREE_VALUE (t
) && PACK_EXPANSION_P (TREE_VALUE (t
))))
16390 /* We have pack expansions, so expand those and
16391 create a new list out of it. */
16392 tree purposevec
= NULL_TREE
;
16393 tree valuevec
= NULL_TREE
;
16397 /* Expand the argument expressions. */
16398 if (TREE_PURPOSE (t
))
16399 purposevec
= tsubst_pack_expansion (TREE_PURPOSE (t
), args
,
16400 complain
, in_decl
);
16401 if (TREE_VALUE (t
))
16402 valuevec
= tsubst_pack_expansion (TREE_VALUE (t
), args
,
16403 complain
, in_decl
);
16405 /* Build the rest of the list. */
16406 chain
= TREE_CHAIN (t
);
16407 if (chain
&& chain
!= void_type_node
)
16408 chain
= RECUR (chain
);
16410 /* Determine the number of arguments. */
16411 if (purposevec
&& TREE_CODE (purposevec
) == TREE_VEC
)
16413 len
= TREE_VEC_LENGTH (purposevec
);
16414 gcc_assert (!valuevec
|| len
== TREE_VEC_LENGTH (valuevec
));
16416 else if (TREE_CODE (valuevec
) == TREE_VEC
)
16417 len
= TREE_VEC_LENGTH (valuevec
);
16420 /* Since we only performed a partial substitution into
16421 the argument pack, we only RETURN (a single list
16423 if (purposevec
== TREE_PURPOSE (t
)
16424 && valuevec
== TREE_VALUE (t
)
16425 && chain
== TREE_CHAIN (t
))
16428 RETURN (tree_cons (purposevec
, valuevec
, chain
));
16431 /* Convert the argument vectors into a TREE_LIST */
16435 /* Grab the Ith values. */
16437 purpose
= purposevec
? TREE_VEC_ELT (purposevec
, i
)
16440 = valuevec
? convert_from_reference (TREE_VEC_ELT (valuevec
, i
))
16443 /* Build the list (backwards). */
16444 chain
= tree_cons (purpose
, value
, chain
);
16450 purpose
= TREE_PURPOSE (t
);
16452 purpose
= RECUR (purpose
);
16453 value
= TREE_VALUE (t
);
16455 value
= RECUR (value
);
16456 chain
= TREE_CHAIN (t
);
16457 if (chain
&& chain
!= void_type_node
)
16458 chain
= RECUR (chain
);
16459 if (purpose
== TREE_PURPOSE (t
)
16460 && value
== TREE_VALUE (t
)
16461 && chain
== TREE_CHAIN (t
))
16463 RETURN (tree_cons (purpose
, value
, chain
));
16466 case COMPONENT_REF
:
16473 object
= tsubst_non_call_postfix_expression (TREE_OPERAND (t
, 0),
16474 args
, complain
, in_decl
);
16475 /* Remember that there was a reference to this entity. */
16476 if (DECL_P (object
)
16477 && !mark_used (object
, complain
) && !(complain
& tf_error
))
16478 RETURN (error_mark_node
);
16479 object_type
= TREE_TYPE (object
);
16481 member
= TREE_OPERAND (t
, 1);
16482 if (BASELINK_P (member
))
16483 member
= tsubst_baselink (member
,
16484 non_reference (TREE_TYPE (object
)),
16485 args
, complain
, in_decl
);
16487 member
= tsubst_copy (member
, args
, complain
, in_decl
);
16488 if (member
== error_mark_node
)
16489 RETURN (error_mark_node
);
16491 if (type_dependent_expression_p (object
))
16492 /* We can't do much here. */;
16493 else if (!CLASS_TYPE_P (object_type
))
16495 if (scalarish_type_p (object_type
))
16497 tree s
= NULL_TREE
;
16498 tree dtor
= member
;
16500 if (TREE_CODE (dtor
) == SCOPE_REF
)
16502 s
= TREE_OPERAND (dtor
, 0);
16503 dtor
= TREE_OPERAND (dtor
, 1);
16505 if (TREE_CODE (dtor
) == BIT_NOT_EXPR
)
16507 dtor
= TREE_OPERAND (dtor
, 0);
16509 RETURN (finish_pseudo_destructor_expr
16510 (object
, s
, dtor
, input_location
));
16514 else if (TREE_CODE (member
) == SCOPE_REF
16515 && TREE_CODE (TREE_OPERAND (member
, 1)) == TEMPLATE_ID_EXPR
)
16517 /* Lookup the template functions now that we know what the
16519 tree scope
= TREE_OPERAND (member
, 0);
16520 tree tmpl
= TREE_OPERAND (TREE_OPERAND (member
, 1), 0);
16521 tree args
= TREE_OPERAND (TREE_OPERAND (member
, 1), 1);
16522 member
= lookup_qualified_name (scope
, tmpl
,
16523 /*is_type_p=*/false,
16524 /*complain=*/false);
16525 if (BASELINK_P (member
))
16527 BASELINK_FUNCTIONS (member
)
16528 = build_nt (TEMPLATE_ID_EXPR
, BASELINK_FUNCTIONS (member
),
16530 member
= (adjust_result_of_qualified_name_lookup
16531 (member
, BINFO_TYPE (BASELINK_BINFO (member
)),
16536 qualified_name_lookup_error (scope
, tmpl
, member
,
16538 RETURN (error_mark_node
);
16541 else if (TREE_CODE (member
) == SCOPE_REF
16542 && !CLASS_TYPE_P (TREE_OPERAND (member
, 0))
16543 && TREE_CODE (TREE_OPERAND (member
, 0)) != NAMESPACE_DECL
)
16545 if (complain
& tf_error
)
16547 if (TYPE_P (TREE_OPERAND (member
, 0)))
16548 error ("%qT is not a class or namespace",
16549 TREE_OPERAND (member
, 0));
16551 error ("%qD is not a class or namespace",
16552 TREE_OPERAND (member
, 0));
16554 RETURN (error_mark_node
);
16556 else if (TREE_CODE (member
) == FIELD_DECL
)
16558 r
= finish_non_static_data_member (member
, object
, NULL_TREE
);
16559 if (TREE_CODE (r
) == COMPONENT_REF
)
16560 REF_PARENTHESIZED_P (r
) = REF_PARENTHESIZED_P (t
);
16564 r
= finish_class_member_access_expr (object
, member
,
16565 /*template_p=*/false,
16567 if (TREE_CODE (r
) == COMPONENT_REF
)
16568 REF_PARENTHESIZED_P (r
) = REF_PARENTHESIZED_P (t
);
16573 RETURN (build_throw
16574 (RECUR (TREE_OPERAND (t
, 0))));
16578 vec
<constructor_elt
, va_gc
> *n
;
16579 constructor_elt
*ce
;
16580 unsigned HOST_WIDE_INT idx
;
16581 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
16582 bool process_index_p
;
16584 bool need_copy_p
= false;
16587 if (type
== error_mark_node
)
16588 RETURN (error_mark_node
);
16590 /* digest_init will do the wrong thing if we let it. */
16591 if (type
&& TYPE_PTRMEMFUNC_P (type
))
16594 /* We do not want to process the index of aggregate
16595 initializers as they are identifier nodes which will be
16596 looked up by digest_init. */
16597 process_index_p
= !(type
&& MAYBE_CLASS_TYPE_P (type
));
16599 n
= vec_safe_copy (CONSTRUCTOR_ELTS (t
));
16600 newlen
= vec_safe_length (n
);
16601 FOR_EACH_VEC_SAFE_ELT (n
, idx
, ce
)
16603 if (ce
->index
&& process_index_p
16604 /* An identifier index is looked up in the type
16605 being initialized, not the current scope. */
16606 && TREE_CODE (ce
->index
) != IDENTIFIER_NODE
)
16607 ce
->index
= RECUR (ce
->index
);
16609 if (PACK_EXPANSION_P (ce
->value
))
16611 /* Substitute into the pack expansion. */
16612 ce
->value
= tsubst_pack_expansion (ce
->value
, args
, complain
,
16615 if (ce
->value
== error_mark_node
16616 || PACK_EXPANSION_P (ce
->value
))
16618 else if (TREE_VEC_LENGTH (ce
->value
) == 1)
16619 /* Just move the argument into place. */
16620 ce
->value
= TREE_VEC_ELT (ce
->value
, 0);
16623 /* Update the length of the final CONSTRUCTOR
16624 arguments vector, and note that we will need to
16626 newlen
= newlen
+ TREE_VEC_LENGTH (ce
->value
) - 1;
16627 need_copy_p
= true;
16631 ce
->value
= RECUR (ce
->value
);
16636 vec
<constructor_elt
, va_gc
> *old_n
= n
;
16638 vec_alloc (n
, newlen
);
16639 FOR_EACH_VEC_ELT (*old_n
, idx
, ce
)
16641 if (TREE_CODE (ce
->value
) == TREE_VEC
)
16643 int i
, len
= TREE_VEC_LENGTH (ce
->value
);
16644 for (i
= 0; i
< len
; ++i
)
16645 CONSTRUCTOR_APPEND_ELT (n
, 0,
16646 TREE_VEC_ELT (ce
->value
, i
));
16649 CONSTRUCTOR_APPEND_ELT (n
, 0, ce
->value
);
16653 r
= build_constructor (init_list_type_node
, n
);
16654 CONSTRUCTOR_IS_DIRECT_INIT (r
) = CONSTRUCTOR_IS_DIRECT_INIT (t
);
16656 if (TREE_HAS_CONSTRUCTOR (t
))
16657 RETURN (finish_compound_literal (type
, r
, complain
));
16659 TREE_TYPE (r
) = type
;
16665 tree operand_0
= TREE_OPERAND (t
, 0);
16666 if (TYPE_P (operand_0
))
16668 operand_0
= tsubst (operand_0
, args
, complain
, in_decl
);
16669 RETURN (get_typeid (operand_0
, complain
));
16673 operand_0
= RECUR (operand_0
);
16674 RETURN (build_typeid (operand_0
, complain
));
16681 else if (DECL_PACK_P (t
))
16683 /* We don't build decls for an instantiation of a
16684 variadic capture proxy, we instantiate the elements
16686 gcc_assert (DECL_HAS_VALUE_EXPR_P (t
));
16687 return RECUR (DECL_VALUE_EXPR (t
));
16693 tree r
= tsubst_copy (t
, args
, complain
, in_decl
);
16694 /* ??? We're doing a subset of finish_id_expression here. */
16696 && !processing_template_decl
16697 && !cp_unevaluated_operand
16698 && (TREE_STATIC (r
) || DECL_EXTERNAL (r
))
16699 && CP_DECL_THREAD_LOCAL_P (r
))
16701 if (tree wrap
= get_tls_wrapper_fn (r
))
16702 /* Replace an evaluated use of the thread_local variable with
16703 a call to its wrapper. */
16704 r
= build_cxx_call (wrap
, 0, NULL
, tf_warning_or_error
);
16706 else if (outer_automatic_var_p (r
))
16708 r
= process_outer_var_ref (r
, complain
);
16709 if (is_capture_proxy (r
))
16710 register_local_specialization (r
, t
);
16713 if (TREE_CODE (TREE_TYPE (t
)) != REFERENCE_TYPE
)
16714 /* If the original type was a reference, we'll be wrapped in
16715 the appropriate INDIRECT_REF. */
16716 r
= convert_from_reference (r
);
16722 tree op0
= RECUR (TREE_OPERAND (t
, 0));
16723 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
16724 RETURN (build_x_va_arg (EXPR_LOCATION (t
), op0
, type
));
16727 case OFFSETOF_EXPR
:
16728 RETURN (finish_offsetof (RECUR (TREE_OPERAND (t
, 0)),
16729 EXPR_LOCATION (t
)));
16733 tree type1
= tsubst (TRAIT_EXPR_TYPE1 (t
), args
,
16734 complain
, in_decl
);
16736 tree type2
= TRAIT_EXPR_TYPE2 (t
);
16737 if (type2
&& TREE_CODE (type2
) == TREE_LIST
)
16738 type2
= RECUR (type2
);
16740 type2
= tsubst (type2
, args
, complain
, in_decl
);
16742 RETURN (finish_trait_expr (TRAIT_EXPR_KIND (t
), type1
, type2
));
16747 tree old_stmt_expr
= cur_stmt_expr
;
16748 tree stmt_expr
= begin_stmt_expr ();
16750 cur_stmt_expr
= stmt_expr
;
16751 tsubst_expr (STMT_EXPR_STMT (t
), args
, complain
, in_decl
,
16752 integral_constant_expression_p
);
16753 stmt_expr
= finish_stmt_expr (stmt_expr
, false);
16754 cur_stmt_expr
= old_stmt_expr
;
16756 /* If the resulting list of expression statement is empty,
16757 fold it further into void_node. */
16758 if (empty_expr_stmt_p (stmt_expr
))
16759 stmt_expr
= void_node
;
16761 RETURN (stmt_expr
);
16766 tree r
= build_lambda_expr ();
16768 tree type
= tsubst (LAMBDA_EXPR_CLOSURE (t
), args
, complain
, NULL_TREE
);
16769 LAMBDA_EXPR_CLOSURE (r
) = type
;
16770 CLASSTYPE_LAMBDA_EXPR (type
) = r
;
16772 LAMBDA_EXPR_LOCATION (r
)
16773 = LAMBDA_EXPR_LOCATION (t
);
16774 LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (r
)
16775 = LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (t
);
16776 LAMBDA_EXPR_MUTABLE_P (r
) = LAMBDA_EXPR_MUTABLE_P (t
);
16777 LAMBDA_EXPR_DISCRIMINATOR (r
)
16778 = (LAMBDA_EXPR_DISCRIMINATOR (t
));
16779 tree scope
= LAMBDA_EXPR_EXTRA_SCOPE (t
);
16781 /* No substitution needed. */;
16782 else if (VAR_OR_FUNCTION_DECL_P (scope
))
16783 /* For a function or variable scope, we want to use tsubst so that we
16784 don't complain about referring to an auto before deduction. */
16785 scope
= tsubst (scope
, args
, complain
, in_decl
);
16786 else if (TREE_CODE (scope
) == PARM_DECL
)
16788 /* Look up the parameter we want directly, as tsubst_copy
16789 doesn't do what we need. */
16790 tree fn
= tsubst (DECL_CONTEXT (scope
), args
, complain
, in_decl
);
16791 tree parm
= FUNCTION_FIRST_USER_PARM (fn
);
16792 while (DECL_PARM_INDEX (parm
) != DECL_PARM_INDEX (scope
))
16793 parm
= DECL_CHAIN (parm
);
16795 /* FIXME Work around the parm not having DECL_CONTEXT set. */
16796 if (DECL_CONTEXT (scope
) == NULL_TREE
)
16797 DECL_CONTEXT (scope
) = fn
;
16799 else if (TREE_CODE (scope
) == FIELD_DECL
)
16800 /* For a field, use tsubst_copy so that we look up the existing field
16801 rather than build a new one. */
16802 scope
= RECUR (scope
);
16804 gcc_unreachable ();
16805 LAMBDA_EXPR_EXTRA_SCOPE (r
) = scope
;
16806 LAMBDA_EXPR_RETURN_TYPE (r
)
16807 = tsubst (LAMBDA_EXPR_RETURN_TYPE (t
), args
, complain
, in_decl
);
16809 gcc_assert (LAMBDA_EXPR_THIS_CAPTURE (t
) == NULL_TREE
16810 && LAMBDA_EXPR_PENDING_PROXIES (t
) == NULL
);
16812 /* Do this again now that LAMBDA_EXPR_EXTRA_SCOPE is set. */
16813 determine_visibility (TYPE_NAME (type
));
16814 /* Now that we know visibility, instantiate the type so we have a
16815 declaration of the op() for later calls to lambda_function. */
16816 complete_type (type
);
16818 LAMBDA_EXPR_THIS_CAPTURE (r
) = NULL_TREE
;
16820 insert_pending_capture_proxies ();
16822 RETURN (build_lambda_object (r
));
16826 /* We can get here for a constant initializer of non-dependent type.
16827 FIXME stop folding in cp_parser_initializer_clause. */
16829 tree r
= get_target_expr_sfinae (RECUR (TARGET_EXPR_INITIAL (t
)),
16834 case TRANSACTION_EXPR
:
16835 RETURN (tsubst_expr(t
, args
, complain
, in_decl
,
16836 integral_constant_expression_p
));
16839 RETURN (finish_parenthesized_expr (RECUR (TREE_OPERAND (t
, 0))));
16841 case VEC_PERM_EXPR
:
16843 tree op0
= RECUR (TREE_OPERAND (t
, 0));
16844 tree op1
= RECUR (TREE_OPERAND (t
, 1));
16845 tree op2
= RECUR (TREE_OPERAND (t
, 2));
16846 RETURN (build_x_vec_perm_expr (input_location
, op0
, op1
, op2
,
16850 case REQUIRES_EXPR
:
16851 RETURN (tsubst_requires_expr (t
, args
, complain
, in_decl
));
16854 /* Handle Objective-C++ constructs, if appropriate. */
16857 = objcp_tsubst_copy_and_build (t
, args
, complain
,
16858 in_decl
, /*function_p=*/false);
16862 RETURN (tsubst_copy (t
, args
, complain
, in_decl
));
16868 input_location
= loc
;
16872 /* Verify that the instantiated ARGS are valid. For type arguments,
16873 make sure that the type's linkage is ok. For non-type arguments,
16874 make sure they are constants if they are integral or enumerations.
16875 Emit an error under control of COMPLAIN, and return TRUE on error. */
16878 check_instantiated_arg (tree tmpl
, tree t
, tsubst_flags_t complain
)
16880 if (dependent_template_arg_p (t
))
16882 if (ARGUMENT_PACK_P (t
))
16884 tree vec
= ARGUMENT_PACK_ARGS (t
);
16885 int len
= TREE_VEC_LENGTH (vec
);
16886 bool result
= false;
16889 for (i
= 0; i
< len
; ++i
)
16890 if (check_instantiated_arg (tmpl
, TREE_VEC_ELT (vec
, i
), complain
))
16894 else if (TYPE_P (t
))
16896 /* [basic.link]: A name with no linkage (notably, the name
16897 of a class or enumeration declared in a local scope)
16898 shall not be used to declare an entity with linkage.
16899 This implies that names with no linkage cannot be used as
16902 DR 757 relaxes this restriction for C++0x. */
16903 tree nt
= (cxx_dialect
> cxx98
? NULL_TREE
16904 : no_linkage_check (t
, /*relaxed_p=*/false));
16908 /* DR 488 makes use of a type with no linkage cause
16909 type deduction to fail. */
16910 if (complain
& tf_error
)
16912 if (TYPE_ANONYMOUS_P (nt
))
16913 error ("%qT is/uses anonymous type", t
);
16915 error ("template argument for %qD uses local type %qT",
16920 /* In order to avoid all sorts of complications, we do not
16921 allow variably-modified types as template arguments. */
16922 else if (variably_modified_type_p (t
, NULL_TREE
))
16924 if (complain
& tf_error
)
16925 error ("%qT is a variably modified type", t
);
16929 /* Class template and alias template arguments should be OK. */
16930 else if (DECL_TYPE_TEMPLATE_P (t
))
16932 /* A non-type argument of integral or enumerated type must be a
16934 else if (TREE_TYPE (t
)
16935 && INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (t
))
16936 && !REFERENCE_REF_P (t
)
16937 && !TREE_CONSTANT (t
))
16939 if (complain
& tf_error
)
16940 error ("integral expression %qE is not constant", t
);
16947 check_instantiated_args (tree tmpl
, tree args
, tsubst_flags_t complain
)
16949 int ix
, len
= DECL_NTPARMS (tmpl
);
16950 bool result
= false;
16952 for (ix
= 0; ix
!= len
; ix
++)
16954 if (check_instantiated_arg (tmpl
, TREE_VEC_ELT (args
, ix
), complain
))
16957 if (result
&& (complain
& tf_error
))
16958 error (" trying to instantiate %qD", tmpl
);
16962 /* We're out of SFINAE context now, so generate diagnostics for the access
16963 errors we saw earlier when instantiating D from TMPL and ARGS. */
16966 recheck_decl_substitution (tree d
, tree tmpl
, tree args
)
16968 tree pattern
= DECL_TEMPLATE_RESULT (tmpl
);
16969 tree type
= TREE_TYPE (pattern
);
16970 location_t loc
= input_location
;
16972 push_access_scope (d
);
16973 push_deferring_access_checks (dk_no_deferred
);
16974 input_location
= DECL_SOURCE_LOCATION (pattern
);
16975 tsubst (type
, args
, tf_warning_or_error
, d
);
16976 input_location
= loc
;
16977 pop_deferring_access_checks ();
16978 pop_access_scope (d
);
16981 /* Instantiate the indicated variable, function, or alias template TMPL with
16982 the template arguments in TARG_PTR. */
16985 instantiate_template_1 (tree tmpl
, tree orig_args
, tsubst_flags_t complain
)
16987 tree targ_ptr
= orig_args
;
16991 bool access_ok
= true;
16993 if (tmpl
== error_mark_node
)
16994 return error_mark_node
;
16996 gcc_assert (TREE_CODE (tmpl
) == TEMPLATE_DECL
);
16998 /* If this function is a clone, handle it specially. */
16999 if (DECL_CLONED_FUNCTION_P (tmpl
))
17004 /* Use DECL_ABSTRACT_ORIGIN because only FUNCTION_DECLs have
17005 DECL_CLONED_FUNCTION. */
17006 spec
= instantiate_template (DECL_ABSTRACT_ORIGIN (tmpl
),
17007 targ_ptr
, complain
);
17008 if (spec
== error_mark_node
)
17009 return error_mark_node
;
17011 /* Look for the clone. */
17012 FOR_EACH_CLONE (clone
, spec
)
17013 if (DECL_NAME (clone
) == DECL_NAME (tmpl
))
17015 /* We should always have found the clone by now. */
17016 gcc_unreachable ();
17020 if (targ_ptr
== error_mark_node
)
17021 return error_mark_node
;
17023 /* Check to see if we already have this specialization. */
17024 gen_tmpl
= most_general_template (tmpl
);
17025 if (tmpl
!= gen_tmpl
)
17026 /* The TMPL is a partial instantiation. To get a full set of
17027 arguments we must add the arguments used to perform the
17028 partial instantiation. */
17029 targ_ptr
= add_outermost_template_args (DECL_TI_ARGS (tmpl
),
17032 /* It would be nice to avoid hashing here and then again in tsubst_decl,
17033 but it doesn't seem to be on the hot path. */
17034 spec
= retrieve_specialization (gen_tmpl
, targ_ptr
, 0);
17036 gcc_assert (tmpl
== gen_tmpl
17037 || ((fndecl
= retrieve_specialization (tmpl
, orig_args
, 0))
17039 || fndecl
== NULL_TREE
);
17041 if (spec
!= NULL_TREE
)
17043 if (FNDECL_HAS_ACCESS_ERRORS (spec
))
17045 if (complain
& tf_error
)
17046 recheck_decl_substitution (spec
, gen_tmpl
, targ_ptr
);
17047 return error_mark_node
;
17052 if (check_instantiated_args (gen_tmpl
, INNERMOST_TEMPLATE_ARGS (targ_ptr
),
17054 return error_mark_node
;
17056 /* We are building a FUNCTION_DECL, during which the access of its
17057 parameters and return types have to be checked. However this
17058 FUNCTION_DECL which is the desired context for access checking
17059 is not built yet. We solve this chicken-and-egg problem by
17060 deferring all checks until we have the FUNCTION_DECL. */
17061 push_deferring_access_checks (dk_deferred
);
17063 /* Instantiation of the function happens in the context of the function
17064 template, not the context of the overload resolution we're doing. */
17065 push_to_top_level ();
17066 /* If there are dependent arguments, e.g. because we're doing partial
17067 ordering, make sure processing_template_decl stays set. */
17068 if (uses_template_parms (targ_ptr
))
17069 ++processing_template_decl
;
17070 if (DECL_CLASS_SCOPE_P (gen_tmpl
))
17072 tree ctx
= tsubst_aggr_type (DECL_CONTEXT (gen_tmpl
), targ_ptr
,
17073 complain
, gen_tmpl
, true);
17074 push_nested_class (ctx
);
17077 tree pattern
= DECL_TEMPLATE_RESULT (gen_tmpl
);
17079 if (VAR_P (pattern
))
17081 /* We need to determine if we're using a partial or explicit
17082 specialization now, because the type of the variable could be
17084 tree tid
= lookup_template_variable (gen_tmpl
, targ_ptr
);
17085 tree elt
= most_specialized_partial_spec (tid
, complain
);
17086 if (elt
== error_mark_node
)
17087 pattern
= error_mark_node
;
17090 tmpl
= TREE_VALUE (elt
);
17091 pattern
= DECL_TEMPLATE_RESULT (tmpl
);
17092 targ_ptr
= TREE_PURPOSE (elt
);
17096 /* Substitute template parameters to obtain the specialization. */
17097 fndecl
= tsubst (pattern
, targ_ptr
, complain
, gen_tmpl
);
17098 if (DECL_CLASS_SCOPE_P (gen_tmpl
))
17099 pop_nested_class ();
17100 pop_from_top_level ();
17102 if (fndecl
== error_mark_node
)
17104 pop_deferring_access_checks ();
17105 return error_mark_node
;
17108 /* The DECL_TI_TEMPLATE should always be the immediate parent
17109 template, not the most general template. */
17110 DECL_TI_TEMPLATE (fndecl
) = tmpl
;
17111 DECL_TI_ARGS (fndecl
) = targ_ptr
;
17113 /* Now we know the specialization, compute access previously
17115 push_access_scope (fndecl
);
17116 if (!perform_deferred_access_checks (complain
))
17118 pop_access_scope (fndecl
);
17119 pop_deferring_access_checks ();
17121 /* If we've just instantiated the main entry point for a function,
17122 instantiate all the alternate entry points as well. We do this
17123 by cloning the instantiation of the main entry point, not by
17124 instantiating the template clones. */
17125 if (DECL_CHAIN (gen_tmpl
) && DECL_CLONED_FUNCTION_P (DECL_CHAIN (gen_tmpl
)))
17126 clone_function_decl (fndecl
, /*update_method_vec_p=*/0);
17130 if (!(complain
& tf_error
))
17132 /* Remember to reinstantiate when we're out of SFINAE so the user
17133 can see the errors. */
17134 FNDECL_HAS_ACCESS_ERRORS (fndecl
) = true;
17136 return error_mark_node
;
17141 /* Wrapper for instantiate_template_1. */
17144 instantiate_template (tree tmpl
, tree orig_args
, tsubst_flags_t complain
)
17147 timevar_push (TV_TEMPLATE_INST
);
17148 ret
= instantiate_template_1 (tmpl
, orig_args
, complain
);
17149 timevar_pop (TV_TEMPLATE_INST
);
17153 /* Instantiate the alias template TMPL with ARGS. Also push a template
17154 instantiation level, which instantiate_template doesn't do because
17155 functions and variables have sufficient context established by the
17159 instantiate_alias_template (tree tmpl
, tree args
, tsubst_flags_t complain
)
17161 struct pending_template
*old_last_pend
= last_pending_template
;
17162 struct tinst_level
*old_error_tinst
= last_error_tinst_level
;
17163 if (tmpl
== error_mark_node
|| args
== error_mark_node
)
17164 return error_mark_node
;
17165 tree tinst
= build_tree_list (tmpl
, args
);
17166 if (!push_tinst_level (tinst
))
17169 return error_mark_node
;
17173 coerce_innermost_template_parms (DECL_TEMPLATE_PARMS (tmpl
),
17174 args
, tmpl
, complain
,
17175 /*require_all_args=*/true,
17176 /*use_default_args=*/true);
17178 tree r
= instantiate_template (tmpl
, args
, complain
);
17179 pop_tinst_level ();
17180 /* We can't free this if a pending_template entry or last_error_tinst_level
17181 is pointing at it. */
17182 if (last_pending_template
== old_last_pend
17183 && last_error_tinst_level
== old_error_tinst
)
17189 /* PARM is a template parameter pack for FN. Returns true iff
17190 PARM is used in a deducible way in the argument list of FN. */
17193 pack_deducible_p (tree parm
, tree fn
)
17195 tree t
= FUNCTION_FIRST_USER_PARMTYPE (fn
);
17196 for (; t
; t
= TREE_CHAIN (t
))
17198 tree type
= TREE_VALUE (t
);
17200 if (!PACK_EXPANSION_P (type
))
17202 for (packs
= PACK_EXPANSION_PARAMETER_PACKS (type
);
17203 packs
; packs
= TREE_CHAIN (packs
))
17204 if (template_args_equal (TREE_VALUE (packs
), parm
))
17206 /* The template parameter pack is used in a function parameter
17207 pack. If this is the end of the parameter list, the
17208 template parameter pack is deducible. */
17209 if (TREE_CHAIN (t
) == void_list_node
)
17212 /* Otherwise, not. Well, it could be deduced from
17213 a non-pack parameter, but doing so would end up with
17214 a deduction mismatch, so don't bother. */
17218 /* The template parameter pack isn't used in any function parameter
17219 packs, but it might be used deeper, e.g. tuple<Args...>. */
17223 /* The FN is a TEMPLATE_DECL for a function. ARGS is an array with
17224 NARGS elements of the arguments that are being used when calling
17225 it. TARGS is a vector into which the deduced template arguments
17228 Returns either a FUNCTION_DECL for the matching specialization of FN or
17229 NULL_TREE if no suitable specialization can be found. If EXPLAIN_P is
17230 true, diagnostics will be printed to explain why it failed.
17232 If FN is a conversion operator, or we are trying to produce a specific
17233 specialization, RETURN_TYPE is the return type desired.
17235 The EXPLICIT_TARGS are explicit template arguments provided via a
17238 The parameter STRICT is one of:
17241 We are deducing arguments for a function call, as in
17242 [temp.deduct.call]. If RETURN_TYPE is non-null, we are
17243 deducing arguments for a call to the result of a conversion
17244 function template, as in [over.call.object].
17247 We are deducing arguments for a conversion function, as in
17248 [temp.deduct.conv].
17251 We are deducing arguments when doing an explicit instantiation
17252 as in [temp.explicit], when determining an explicit specialization
17253 as in [temp.expl.spec], or when taking the address of a function
17254 template, as in [temp.deduct.funcaddr]. */
17257 fn_type_unification (tree fn
,
17258 tree explicit_targs
,
17261 unsigned int nargs
,
17263 unification_kind_t strict
,
17270 tree decl
= NULL_TREE
;
17271 tsubst_flags_t complain
= (explain_p
? tf_warning_or_error
: tf_none
);
17273 static int deduction_depth
;
17274 struct pending_template
*old_last_pend
= last_pending_template
;
17275 struct tinst_level
*old_error_tinst
= last_error_tinst_level
;
17276 tree tparms
= DECL_INNERMOST_TEMPLATE_PARMS (fn
);
17278 tree r
= error_mark_node
;
17281 complain
|= tf_decltype
;
17283 /* In C++0x, it's possible to have a function template whose type depends
17284 on itself recursively. This is most obvious with decltype, but can also
17285 occur with enumeration scope (c++/48969). So we need to catch infinite
17286 recursion and reject the substitution at deduction time; this function
17287 will return error_mark_node for any repeated substitution.
17289 This also catches excessive recursion such as when f<N> depends on
17290 f<N-1> across all integers, and returns error_mark_node for all the
17291 substitutions back up to the initial one.
17293 This is, of course, not reentrant. */
17294 if (excessive_deduction_depth
)
17295 return error_mark_node
;
17296 tinst
= build_tree_list (fn
, NULL_TREE
);
17299 gcc_assert (TREE_CODE (fn
) == TEMPLATE_DECL
);
17301 fntype
= TREE_TYPE (fn
);
17302 if (explicit_targs
)
17306 The specified template arguments must match the template
17307 parameters in kind (i.e., type, nontype, template), and there
17308 must not be more arguments than there are parameters;
17309 otherwise type deduction fails.
17311 Nontype arguments must match the types of the corresponding
17312 nontype template parameters, or must be convertible to the
17313 types of the corresponding nontype parameters as specified in
17314 _temp.arg.nontype_, otherwise type deduction fails.
17316 All references in the function type of the function template
17317 to the corresponding template parameters are replaced by the
17318 specified template argument values. If a substitution in a
17319 template parameter or in the function type of the function
17320 template results in an invalid type, type deduction fails. */
17321 int i
, len
= TREE_VEC_LENGTH (tparms
);
17322 location_t loc
= input_location
;
17323 bool incomplete
= false;
17325 /* Adjust any explicit template arguments before entering the
17326 substitution context. */
17328 = (coerce_template_parms (tparms
, explicit_targs
, NULL_TREE
,
17330 /*require_all_args=*/false,
17331 /*use_default_args=*/false));
17332 if (explicit_targs
== error_mark_node
)
17335 /* Substitute the explicit args into the function type. This is
17336 necessary so that, for instance, explicitly declared function
17337 arguments can match null pointed constants. If we were given
17338 an incomplete set of explicit args, we must not do semantic
17339 processing during substitution as we could create partial
17341 for (i
= 0; i
< len
; i
++)
17343 tree parm
= TREE_VALUE (TREE_VEC_ELT (tparms
, i
));
17344 bool parameter_pack
= false;
17345 tree targ
= TREE_VEC_ELT (explicit_targs
, i
);
17347 /* Dig out the actual parm. */
17348 if (TREE_CODE (parm
) == TYPE_DECL
17349 || TREE_CODE (parm
) == TEMPLATE_DECL
)
17351 parm
= TREE_TYPE (parm
);
17352 parameter_pack
= TEMPLATE_TYPE_PARAMETER_PACK (parm
);
17354 else if (TREE_CODE (parm
) == PARM_DECL
)
17356 parm
= DECL_INITIAL (parm
);
17357 parameter_pack
= TEMPLATE_PARM_PARAMETER_PACK (parm
);
17360 if (!parameter_pack
&& targ
== NULL_TREE
)
17361 /* No explicit argument for this template parameter. */
17364 if (parameter_pack
&& pack_deducible_p (parm
, fn
))
17366 /* Mark the argument pack as "incomplete". We could
17367 still deduce more arguments during unification.
17368 We remove this mark in type_unification_real. */
17371 ARGUMENT_PACK_INCOMPLETE_P(targ
) = 1;
17372 ARGUMENT_PACK_EXPLICIT_ARGS (targ
)
17373 = ARGUMENT_PACK_ARGS (targ
);
17376 /* We have some incomplete argument packs. */
17381 TREE_VALUE (tinst
) = explicit_targs
;
17382 if (!push_tinst_level (tinst
))
17384 excessive_deduction_depth
= true;
17387 processing_template_decl
+= incomplete
;
17388 input_location
= DECL_SOURCE_LOCATION (fn
);
17389 /* Ignore any access checks; we'll see them again in
17390 instantiate_template and they might have the wrong
17391 access path at this point. */
17392 push_deferring_access_checks (dk_deferred
);
17393 fntype
= tsubst (TREE_TYPE (fn
), explicit_targs
,
17394 complain
| tf_partial
, NULL_TREE
);
17395 pop_deferring_access_checks ();
17396 input_location
= loc
;
17397 processing_template_decl
-= incomplete
;
17398 pop_tinst_level ();
17400 if (fntype
== error_mark_node
)
17403 /* Place the explicitly specified arguments in TARGS. */
17404 for (i
= NUM_TMPL_ARGS (explicit_targs
); i
--;)
17405 TREE_VEC_ELT (targs
, i
) = TREE_VEC_ELT (explicit_targs
, i
);
17408 /* Never do unification on the 'this' parameter. */
17409 parms
= skip_artificial_parms_for (fn
, TYPE_ARG_TYPES (fntype
));
17411 if (return_type
&& strict
== DEDUCE_CALL
)
17413 /* We're deducing for a call to the result of a template conversion
17414 function. The parms we really want are in return_type. */
17415 if (POINTER_TYPE_P (return_type
))
17416 return_type
= TREE_TYPE (return_type
);
17417 parms
= TYPE_ARG_TYPES (return_type
);
17419 else if (return_type
)
17423 parms
= tree_cons (NULL_TREE
, TREE_TYPE (fntype
), parms
);
17424 new_args
= XALLOCAVEC (tree
, nargs
+ 1);
17425 new_args
[0] = return_type
;
17426 memcpy (new_args
+ 1, args
, nargs
* sizeof (tree
));
17431 /* We allow incomplete unification without an error message here
17432 because the standard doesn't seem to explicitly prohibit it. Our
17433 callers must be ready to deal with unification failures in any
17436 TREE_VALUE (tinst
) = targs
;
17437 /* If we aren't explaining yet, push tinst context so we can see where
17438 any errors (e.g. from class instantiations triggered by instantiation
17439 of default template arguments) come from. If we are explaining, this
17440 context is redundant. */
17441 if (!explain_p
&& !push_tinst_level (tinst
))
17443 excessive_deduction_depth
= true;
17447 /* type_unification_real will pass back any access checks from default
17448 template argument substitution. */
17449 vec
<deferred_access_check
, va_gc
> *checks
;
17452 ok
= !type_unification_real (DECL_INNERMOST_TEMPLATE_PARMS (fn
),
17453 targs
, parms
, args
, nargs
, /*subr=*/0,
17454 strict
, flags
, &checks
, explain_p
);
17456 pop_tinst_level ();
17460 /* Now that we have bindings for all of the template arguments,
17461 ensure that the arguments deduced for the template template
17462 parameters have compatible template parameter lists. We cannot
17463 check this property before we have deduced all template
17464 arguments, because the template parameter types of a template
17465 template parameter might depend on prior template parameters
17466 deduced after the template template parameter. The following
17467 ill-formed example illustrates this issue:
17469 template<typename T, template<T> class C> void f(C<5>, T);
17471 template<int N> struct X {};
17474 f(X<5>(), 5l); // error: template argument deduction fails
17477 The template parameter list of 'C' depends on the template type
17478 parameter 'T', but 'C' is deduced to 'X' before 'T' is deduced to
17479 'long'. Thus, we can't check that 'C' cannot bind to 'X' at the
17480 time that we deduce 'C'. */
17481 if (!template_template_parm_bindings_ok_p
17482 (DECL_INNERMOST_TEMPLATE_PARMS (fn
), targs
))
17484 unify_inconsistent_template_template_parameters (explain_p
);
17488 /* All is well so far. Now, check:
17492 When all template arguments have been deduced, all uses of
17493 template parameters in nondeduced contexts are replaced with
17494 the corresponding deduced argument values. If the
17495 substitution results in an invalid type, as described above,
17496 type deduction fails. */
17497 TREE_VALUE (tinst
) = targs
;
17498 if (!push_tinst_level (tinst
))
17500 excessive_deduction_depth
= true;
17504 /* Also collect access checks from the instantiation. */
17505 reopen_deferring_access_checks (checks
);
17507 decl
= instantiate_template (fn
, targs
, complain
);
17509 checks
= get_deferred_access_checks ();
17510 pop_deferring_access_checks ();
17512 pop_tinst_level ();
17514 if (decl
== error_mark_node
)
17517 /* Now perform any access checks encountered during substitution. */
17518 push_access_scope (decl
);
17519 ok
= perform_access_checks (checks
, complain
);
17520 pop_access_scope (decl
);
17524 /* If we're looking for an exact match, check that what we got
17525 is indeed an exact match. It might not be if some template
17526 parameters are used in non-deduced contexts. But don't check
17527 for an exact match if we have dependent template arguments;
17528 in that case we're doing partial ordering, and we already know
17529 that we have two candidates that will provide the actual type. */
17530 if (strict
== DEDUCE_EXACT
&& !any_dependent_template_arguments_p (targs
))
17532 tree substed
= TREE_TYPE (decl
);
17536 = skip_artificial_parms_for (decl
, TYPE_ARG_TYPES (substed
));
17538 sarg
= tree_cons (NULL_TREE
, TREE_TYPE (substed
), sarg
);
17539 for (i
= 0; i
< nargs
&& sarg
; ++i
, sarg
= TREE_CHAIN (sarg
))
17540 if (!same_type_p (args
[i
], TREE_VALUE (sarg
)))
17542 unify_type_mismatch (explain_p
, args
[i
],
17543 TREE_VALUE (sarg
));
17552 if (excessive_deduction_depth
)
17554 if (deduction_depth
== 0)
17555 /* Reset once we're all the way out. */
17556 excessive_deduction_depth
= false;
17559 /* We can't free this if a pending_template entry or last_error_tinst_level
17560 is pointing at it. */
17561 if (last_pending_template
== old_last_pend
17562 && last_error_tinst_level
== old_error_tinst
)
17568 /* Adjust types before performing type deduction, as described in
17569 [temp.deduct.call] and [temp.deduct.conv]. The rules in these two
17570 sections are symmetric. PARM is the type of a function parameter
17571 or the return type of the conversion function. ARG is the type of
17572 the argument passed to the call, or the type of the value
17573 initialized with the result of the conversion function.
17574 ARG_EXPR is the original argument expression, which may be null. */
17577 maybe_adjust_types_for_deduction (unification_kind_t strict
,
17590 /* Swap PARM and ARG throughout the remainder of this
17591 function; the handling is precisely symmetric since PARM
17592 will initialize ARG rather than vice versa. */
17593 std::swap (parm
, arg
);
17597 /* Core issue #873: Do the DR606 thing (see below) for these cases,
17598 too, but here handle it by stripping the reference from PARM
17599 rather than by adding it to ARG. */
17600 if (TREE_CODE (*parm
) == REFERENCE_TYPE
17601 && TYPE_REF_IS_RVALUE (*parm
)
17602 && TREE_CODE (TREE_TYPE (*parm
)) == TEMPLATE_TYPE_PARM
17603 && cp_type_quals (TREE_TYPE (*parm
)) == TYPE_UNQUALIFIED
17604 && TREE_CODE (*arg
) == REFERENCE_TYPE
17605 && !TYPE_REF_IS_RVALUE (*arg
))
17606 *parm
= TREE_TYPE (*parm
);
17607 /* Nothing else to do in this case. */
17611 gcc_unreachable ();
17614 if (TREE_CODE (*parm
) != REFERENCE_TYPE
)
17616 /* [temp.deduct.call]
17618 If P is not a reference type:
17620 --If A is an array type, the pointer type produced by the
17621 array-to-pointer standard conversion (_conv.array_) is
17622 used in place of A for type deduction; otherwise,
17624 --If A is a function type, the pointer type produced by
17625 the function-to-pointer standard conversion
17626 (_conv.func_) is used in place of A for type deduction;
17629 --If A is a cv-qualified type, the top level
17630 cv-qualifiers of A's type are ignored for type
17632 if (TREE_CODE (*arg
) == ARRAY_TYPE
)
17633 *arg
= build_pointer_type (TREE_TYPE (*arg
));
17634 else if (TREE_CODE (*arg
) == FUNCTION_TYPE
)
17635 *arg
= build_pointer_type (*arg
);
17637 *arg
= TYPE_MAIN_VARIANT (*arg
);
17640 /* From C++0x [14.8.2.1/3 temp.deduct.call] (after DR606), "If P is
17641 of the form T&&, where T is a template parameter, and the argument
17642 is an lvalue, T is deduced as A& */
17643 if (TREE_CODE (*parm
) == REFERENCE_TYPE
17644 && TYPE_REF_IS_RVALUE (*parm
)
17645 && TREE_CODE (TREE_TYPE (*parm
)) == TEMPLATE_TYPE_PARM
17646 && cp_type_quals (TREE_TYPE (*parm
)) == TYPE_UNQUALIFIED
17647 && (arg_expr
? real_lvalue_p (arg_expr
)
17648 /* try_one_overload doesn't provide an arg_expr, but
17649 functions are always lvalues. */
17650 : TREE_CODE (*arg
) == FUNCTION_TYPE
))
17651 *arg
= build_reference_type (*arg
);
17653 /* [temp.deduct.call]
17655 If P is a cv-qualified type, the top level cv-qualifiers
17656 of P's type are ignored for type deduction. If P is a
17657 reference type, the type referred to by P is used for
17659 *parm
= TYPE_MAIN_VARIANT (*parm
);
17660 if (TREE_CODE (*parm
) == REFERENCE_TYPE
)
17662 *parm
= TREE_TYPE (*parm
);
17663 result
|= UNIFY_ALLOW_OUTER_MORE_CV_QUAL
;
17666 /* DR 322. For conversion deduction, remove a reference type on parm
17667 too (which has been swapped into ARG). */
17668 if (strict
== DEDUCE_CONV
&& TREE_CODE (*arg
) == REFERENCE_TYPE
)
17669 *arg
= TREE_TYPE (*arg
);
17674 /* Subroutine of unify_one_argument. PARM is a function parameter of a
17675 template which does contain any deducible template parameters; check if
17676 ARG is a suitable match for it. STRICT, FLAGS and EXPLAIN_P are as in
17677 unify_one_argument. */
17680 check_non_deducible_conversion (tree parm
, tree arg
, int strict
,
17681 int flags
, bool explain_p
)
17686 type
= TREE_TYPE (arg
);
17690 if (same_type_p (parm
, type
))
17691 return unify_success (explain_p
);
17693 if (strict
== DEDUCE_CONV
)
17695 if (can_convert_arg (type
, parm
, NULL_TREE
, flags
,
17696 explain_p
? tf_warning_or_error
: tf_none
))
17697 return unify_success (explain_p
);
17699 else if (strict
!= DEDUCE_EXACT
)
17701 if (can_convert_arg (parm
, type
,
17702 TYPE_P (arg
) ? NULL_TREE
: arg
,
17703 flags
, explain_p
? tf_warning_or_error
: tf_none
))
17704 return unify_success (explain_p
);
17707 if (strict
== DEDUCE_EXACT
)
17708 return unify_type_mismatch (explain_p
, parm
, arg
);
17710 return unify_arg_conversion (explain_p
, parm
, type
, arg
);
17713 static bool uses_deducible_template_parms (tree type
);
17715 /* Returns true iff the expression EXPR is one from which a template
17716 argument can be deduced. In other words, if it's an undecorated
17717 use of a template non-type parameter. */
17720 deducible_expression (tree expr
)
17722 return (TREE_CODE (expr
) == TEMPLATE_PARM_INDEX
);
17725 /* Returns true iff the array domain DOMAIN uses a template parameter in a
17726 deducible way; that is, if it has a max value of <PARM> - 1. */
17729 deducible_array_bound (tree domain
)
17731 if (domain
== NULL_TREE
)
17734 tree max
= TYPE_MAX_VALUE (domain
);
17735 if (TREE_CODE (max
) != MINUS_EXPR
)
17738 return deducible_expression (TREE_OPERAND (max
, 0));
17741 /* Returns true iff the template arguments ARGS use a template parameter
17742 in a deducible way. */
17745 deducible_template_args (tree args
)
17747 for (int i
= 0; i
< TREE_VEC_LENGTH (args
); ++i
)
17750 tree elt
= TREE_VEC_ELT (args
, i
);
17751 if (ARGUMENT_PACK_P (elt
))
17752 deducible
= deducible_template_args (ARGUMENT_PACK_ARGS (elt
));
17755 if (PACK_EXPANSION_P (elt
))
17756 elt
= PACK_EXPANSION_PATTERN (elt
);
17757 if (TREE_CODE (elt
) == TEMPLATE_TEMPLATE_PARM
)
17759 else if (TYPE_P (elt
))
17760 deducible
= uses_deducible_template_parms (elt
);
17762 deducible
= deducible_expression (elt
);
17770 /* Returns true iff TYPE contains any deducible references to template
17771 parameters, as per 14.8.2.5. */
17774 uses_deducible_template_parms (tree type
)
17776 if (PACK_EXPANSION_P (type
))
17777 type
= PACK_EXPANSION_PATTERN (type
);
17784 if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
17785 || TREE_CODE (type
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
17791 if (POINTER_TYPE_P (type
))
17792 return uses_deducible_template_parms (TREE_TYPE (type
));
17794 /* T[integer-constant ]
17796 if (TREE_CODE (type
) == ARRAY_TYPE
)
17797 return (uses_deducible_template_parms (TREE_TYPE (type
))
17798 || deducible_array_bound (TYPE_DOMAIN (type
)));
17810 if (TYPE_PTRMEM_P (type
))
17811 return (uses_deducible_template_parms (TYPE_PTRMEM_CLASS_TYPE (type
))
17812 || (uses_deducible_template_parms
17813 (TYPE_PTRMEM_POINTED_TO_TYPE (type
))));
17815 /* template-name <T> (where template-name refers to a class template)
17816 template-name <i> (where template-name refers to a class template) */
17817 if (CLASS_TYPE_P (type
)
17818 && CLASSTYPE_TEMPLATE_INFO (type
)
17819 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (type
)))
17820 return deducible_template_args (INNERMOST_TEMPLATE_ARGS
17821 (CLASSTYPE_TI_ARGS (type
)));
17826 if (TREE_CODE (type
) == FUNCTION_TYPE
17827 || TREE_CODE (type
) == METHOD_TYPE
)
17829 if (uses_deducible_template_parms (TREE_TYPE (type
)))
17831 tree parm
= TYPE_ARG_TYPES (type
);
17832 if (TREE_CODE (type
) == METHOD_TYPE
)
17833 parm
= TREE_CHAIN (parm
);
17834 for (; parm
; parm
= TREE_CHAIN (parm
))
17835 if (uses_deducible_template_parms (TREE_VALUE (parm
)))
17842 /* Subroutine of type_unification_real and unify_pack_expansion to
17843 handle unification of a single P/A pair. Parameters are as
17844 for those functions. */
17847 unify_one_argument (tree tparms
, tree targs
, tree parm
, tree arg
,
17848 int subr
, unification_kind_t strict
,
17851 tree arg_expr
= NULL_TREE
;
17854 if (arg
== error_mark_node
|| parm
== error_mark_node
)
17855 return unify_invalid (explain_p
);
17856 if (arg
== unknown_type_node
)
17857 /* We can't deduce anything from this, but we might get all the
17858 template args from other function args. */
17859 return unify_success (explain_p
);
17861 /* Implicit conversions (Clause 4) will be performed on a function
17862 argument to convert it to the type of the corresponding function
17863 parameter if the parameter type contains no template-parameters that
17864 participate in template argument deduction. */
17865 if (strict
!= DEDUCE_EXACT
17866 && TYPE_P (parm
) && !uses_deducible_template_parms (parm
))
17867 /* For function parameters with no deducible template parameters,
17868 just return. We'll check non-dependent conversions later. */
17869 return unify_success (explain_p
);
17874 arg_strict
= (UNIFY_ALLOW_OUTER_LEVEL
17875 | UNIFY_ALLOW_MORE_CV_QUAL
17876 | UNIFY_ALLOW_DERIVED
);
17880 arg_strict
= UNIFY_ALLOW_LESS_CV_QUAL
;
17884 arg_strict
= UNIFY_ALLOW_NONE
;
17888 gcc_unreachable ();
17891 /* We only do these transformations if this is the top-level
17892 parameter_type_list in a call or declaration matching; in other
17893 situations (nested function declarators, template argument lists) we
17894 won't be comparing a type to an expression, and we don't do any type
17900 gcc_assert (TREE_TYPE (arg
) != NULL_TREE
);
17901 if (type_unknown_p (arg
))
17903 /* [temp.deduct.type] A template-argument can be
17904 deduced from a pointer to function or pointer
17905 to member function argument if the set of
17906 overloaded functions does not contain function
17907 templates and at most one of a set of
17908 overloaded functions provides a unique
17911 if (resolve_overloaded_unification
17912 (tparms
, targs
, parm
, arg
, strict
,
17913 arg_strict
, explain_p
))
17914 return unify_success (explain_p
);
17915 return unify_overload_resolution_failure (explain_p
, arg
);
17919 arg
= unlowered_expr_type (arg
);
17920 if (arg
== error_mark_node
)
17921 return unify_invalid (explain_p
);
17925 maybe_adjust_types_for_deduction (strict
, &parm
, &arg
, arg_expr
);
17928 if ((TYPE_P (parm
) || TREE_CODE (parm
) == TEMPLATE_DECL
)
17929 != (TYPE_P (arg
) || TREE_CODE (arg
) == TEMPLATE_DECL
))
17930 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
17932 /* For deduction from an init-list we need the actual list. */
17933 if (arg_expr
&& BRACE_ENCLOSED_INITIALIZER_P (arg_expr
))
17935 return unify (tparms
, targs
, parm
, arg
, arg_strict
, explain_p
);
17938 /* Most parms like fn_type_unification.
17940 If SUBR is 1, we're being called recursively (to unify the
17941 arguments of a function or method parameter of a function
17944 CHECKS is a pointer to a vector of access checks encountered while
17945 substituting default template arguments. */
17948 type_unification_real (tree tparms
,
17952 unsigned int xnargs
,
17954 unification_kind_t strict
,
17956 vec
<deferred_access_check
, va_gc
> **checks
,
17961 int ntparms
= TREE_VEC_LENGTH (tparms
);
17962 int saw_undeduced
= 0;
17965 unsigned int nargs
;
17968 gcc_assert (TREE_CODE (tparms
) == TREE_VEC
);
17969 gcc_assert (xparms
== NULL_TREE
|| TREE_CODE (xparms
) == TREE_LIST
);
17970 gcc_assert (ntparms
> 0);
17972 /* Reset the number of non-defaulted template arguments contained
17974 NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
) = NULL_TREE
;
17982 while (parms
&& parms
!= void_list_node
17985 parm
= TREE_VALUE (parms
);
17987 if (TREE_CODE (parm
) == TYPE_PACK_EXPANSION
17988 && (!TREE_CHAIN (parms
) || TREE_CHAIN (parms
) == void_list_node
))
17989 /* For a function parameter pack that occurs at the end of the
17990 parameter-declaration-list, the type A of each remaining
17991 argument of the call is compared with the type P of the
17992 declarator-id of the function parameter pack. */
17995 parms
= TREE_CHAIN (parms
);
17997 if (TREE_CODE (parm
) == TYPE_PACK_EXPANSION
)
17998 /* For a function parameter pack that does not occur at the
17999 end of the parameter-declaration-list, the type of the
18000 parameter pack is a non-deduced context. */
18006 if (unify_one_argument (tparms
, targs
, parm
, arg
, subr
, strict
,
18012 && parms
!= void_list_node
18013 && TREE_CODE (TREE_VALUE (parms
)) == TYPE_PACK_EXPANSION
)
18015 /* Unify the remaining arguments with the pack expansion type. */
18017 tree parmvec
= make_tree_vec (1);
18019 /* Allocate a TREE_VEC and copy in all of the arguments */
18020 argvec
= make_tree_vec (nargs
- ia
);
18021 for (i
= 0; ia
< nargs
; ++ia
, ++i
)
18022 TREE_VEC_ELT (argvec
, i
) = args
[ia
];
18024 /* Copy the parameter into parmvec. */
18025 TREE_VEC_ELT (parmvec
, 0) = TREE_VALUE (parms
);
18026 if (unify_pack_expansion (tparms
, targs
, parmvec
, argvec
, strict
,
18027 /*subr=*/subr
, explain_p
))
18030 /* Advance to the end of the list of parameters. */
18031 parms
= TREE_CHAIN (parms
);
18034 /* Fail if we've reached the end of the parm list, and more args
18035 are present, and the parm list isn't variadic. */
18036 if (ia
< nargs
&& parms
== void_list_node
)
18037 return unify_too_many_arguments (explain_p
, nargs
, ia
);
18038 /* Fail if parms are left and they don't have default values and
18039 they aren't all deduced as empty packs (c++/57397). This is
18040 consistent with sufficient_parms_p. */
18041 if (parms
&& parms
!= void_list_node
18042 && TREE_PURPOSE (parms
) == NULL_TREE
)
18044 unsigned int count
= nargs
;
18049 type_pack_p
= TREE_CODE (TREE_VALUE (p
)) == TYPE_PACK_EXPANSION
;
18052 p
= TREE_CHAIN (p
);
18054 while (p
&& p
!= void_list_node
);
18055 if (count
!= nargs
)
18056 return unify_too_few_arguments (explain_p
, ia
, count
,
18062 tsubst_flags_t complain
= (explain_p
18063 ? tf_warning_or_error
18066 for (i
= 0; i
< ntparms
; i
++)
18068 tree targ
= TREE_VEC_ELT (targs
, i
);
18069 tree tparm
= TREE_VEC_ELT (tparms
, i
);
18071 /* Clear the "incomplete" flags on all argument packs now so that
18072 substituting them into later default arguments works. */
18073 if (targ
&& ARGUMENT_PACK_P (targ
))
18075 ARGUMENT_PACK_INCOMPLETE_P (targ
) = 0;
18076 ARGUMENT_PACK_EXPLICIT_ARGS (targ
) = NULL_TREE
;
18079 if (targ
|| tparm
== error_mark_node
)
18081 tparm
= TREE_VALUE (tparm
);
18083 /* If this is an undeduced nontype parameter that depends on
18084 a type parameter, try another pass; its type may have been
18085 deduced from a later argument than the one from which
18086 this parameter can be deduced. */
18087 if (TREE_CODE (tparm
) == PARM_DECL
18088 && uses_template_parms (TREE_TYPE (tparm
))
18089 && saw_undeduced
< 2)
18095 /* Core issue #226 (C++0x) [temp.deduct]:
18097 If a template argument has not been deduced, its
18098 default template argument, if any, is used.
18100 When we are in C++98 mode, TREE_PURPOSE will either
18101 be NULL_TREE or ERROR_MARK_NODE, so we do not need
18102 to explicitly check cxx_dialect here. */
18103 if (TREE_PURPOSE (TREE_VEC_ELT (tparms
, i
)))
18104 /* OK, there is a default argument. Wait until after the
18105 conversion check to do substitution. */
18108 /* If the type parameter is a parameter pack, then it will
18109 be deduced to an empty parameter pack. */
18110 if (template_parameter_pack_p (tparm
))
18114 if (TREE_CODE (tparm
) == TEMPLATE_PARM_INDEX
)
18116 arg
= make_node (NONTYPE_ARGUMENT_PACK
);
18117 TREE_TYPE (arg
) = TREE_TYPE (TEMPLATE_PARM_DECL (tparm
));
18118 TREE_CONSTANT (arg
) = 1;
18121 arg
= cxx_make_type (TYPE_ARGUMENT_PACK
);
18123 SET_ARGUMENT_PACK_ARGS (arg
, make_tree_vec (0));
18125 TREE_VEC_ELT (targs
, i
) = arg
;
18129 return unify_parameter_deduction_failure (explain_p
, tparm
);
18132 /* DR 1391: All parameters have args, now check non-dependent parms for
18134 if (saw_undeduced
< 2)
18135 for (ia
= 0, parms
= xparms
, args
= xargs
, nargs
= xnargs
;
18136 parms
&& parms
!= void_list_node
&& ia
< nargs
; )
18138 parm
= TREE_VALUE (parms
);
18140 if (TREE_CODE (parm
) == TYPE_PACK_EXPANSION
18141 && (!TREE_CHAIN (parms
)
18142 || TREE_CHAIN (parms
) == void_list_node
))
18143 /* For a function parameter pack that occurs at the end of the
18144 parameter-declaration-list, the type A of each remaining
18145 argument of the call is compared with the type P of the
18146 declarator-id of the function parameter pack. */
18149 parms
= TREE_CHAIN (parms
);
18151 if (TREE_CODE (parm
) == TYPE_PACK_EXPANSION
)
18152 /* For a function parameter pack that does not occur at the
18153 end of the parameter-declaration-list, the type of the
18154 parameter pack is a non-deduced context. */
18160 if (uses_template_parms (parm
))
18162 if (check_non_deducible_conversion (parm
, arg
, strict
, flags
,
18167 /* Now substitute into the default template arguments. */
18168 for (i
= 0; i
< ntparms
; i
++)
18170 tree targ
= TREE_VEC_ELT (targs
, i
);
18171 tree tparm
= TREE_VEC_ELT (tparms
, i
);
18173 if (targ
|| tparm
== error_mark_node
)
18175 tree parm
= TREE_VALUE (tparm
);
18177 if (TREE_CODE (parm
) == PARM_DECL
18178 && uses_template_parms (TREE_TYPE (parm
))
18179 && saw_undeduced
< 2)
18182 tree arg
= TREE_PURPOSE (tparm
);
18183 reopen_deferring_access_checks (*checks
);
18184 location_t save_loc
= input_location
;
18186 input_location
= DECL_SOURCE_LOCATION (parm
);
18187 arg
= tsubst_template_arg (arg
, targs
, complain
, NULL_TREE
);
18188 arg
= convert_template_argument (parm
, arg
, targs
, complain
,
18190 input_location
= save_loc
;
18191 *checks
= get_deferred_access_checks ();
18192 pop_deferring_access_checks ();
18193 if (arg
== error_mark_node
)
18197 TREE_VEC_ELT (targs
, i
) = arg
;
18198 /* The position of the first default template argument,
18199 is also the number of non-defaulted arguments in TARGS.
18201 if (!NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
))
18202 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
, i
);
18207 if (saw_undeduced
++ == 1)
18210 #ifdef ENABLE_CHECKING
18211 if (!NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
))
18212 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
, TREE_VEC_LENGTH (targs
));
18215 return unify_success (explain_p
);
18218 /* Subroutine of type_unification_real. Args are like the variables
18219 at the call site. ARG is an overloaded function (or template-id);
18220 we try deducing template args from each of the overloads, and if
18221 only one succeeds, we go with that. Modifies TARGS and returns
18222 true on success. */
18225 resolve_overloaded_unification (tree tparms
,
18229 unification_kind_t strict
,
18233 tree tempargs
= copy_node (targs
);
18235 tree goodfn
= NULL_TREE
;
18238 if (TREE_CODE (arg
) == ADDR_EXPR
)
18240 arg
= TREE_OPERAND (arg
, 0);
18246 if (TREE_CODE (arg
) == COMPONENT_REF
)
18247 /* Handle `&x' where `x' is some static or non-static member
18249 arg
= TREE_OPERAND (arg
, 1);
18251 if (TREE_CODE (arg
) == OFFSET_REF
)
18252 arg
= TREE_OPERAND (arg
, 1);
18254 /* Strip baselink information. */
18255 if (BASELINK_P (arg
))
18256 arg
= BASELINK_FUNCTIONS (arg
);
18258 if (TREE_CODE (arg
) == TEMPLATE_ID_EXPR
)
18260 /* If we got some explicit template args, we need to plug them into
18261 the affected templates before we try to unify, in case the
18262 explicit args will completely resolve the templates in question. */
18265 tree expl_subargs
= TREE_OPERAND (arg
, 1);
18266 arg
= TREE_OPERAND (arg
, 0);
18268 for (; arg
; arg
= OVL_NEXT (arg
))
18270 tree fn
= OVL_CURRENT (arg
);
18271 tree subargs
, elem
;
18273 if (TREE_CODE (fn
) != TEMPLATE_DECL
)
18276 subargs
= coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (fn
),
18277 expl_subargs
, NULL_TREE
, tf_none
,
18278 /*require_all_args=*/true,
18279 /*use_default_args=*/true);
18280 if (subargs
!= error_mark_node
18281 && !any_dependent_template_arguments_p (subargs
))
18283 elem
= TREE_TYPE (instantiate_template (fn
, subargs
, tf_none
));
18284 if (try_one_overload (tparms
, targs
, tempargs
, parm
,
18285 elem
, strict
, sub_strict
, addr_p
, explain_p
)
18286 && (!goodfn
|| !same_type_p (goodfn
, elem
)))
18295 /* If no templates (or more than one) are fully resolved by the
18296 explicit arguments, this template-id is a non-deduced context; it
18297 could still be OK if we deduce all template arguments for the
18298 enclosing call through other arguments. */
18302 else if (TREE_CODE (arg
) != OVERLOAD
18303 && TREE_CODE (arg
) != FUNCTION_DECL
)
18304 /* If ARG is, for example, "(0, &f)" then its type will be unknown
18305 -- but the deduction does not succeed because the expression is
18306 not just the function on its own. */
18309 for (; arg
; arg
= OVL_NEXT (arg
))
18310 if (try_one_overload (tparms
, targs
, tempargs
, parm
,
18311 TREE_TYPE (OVL_CURRENT (arg
)),
18312 strict
, sub_strict
, addr_p
, explain_p
)
18313 && (!goodfn
|| !decls_match (goodfn
, OVL_CURRENT (arg
))))
18315 goodfn
= OVL_CURRENT (arg
);
18319 /* [temp.deduct.type] A template-argument can be deduced from a pointer
18320 to function or pointer to member function argument if the set of
18321 overloaded functions does not contain function templates and at most
18322 one of a set of overloaded functions provides a unique match.
18324 So if we found multiple possibilities, we return success but don't
18325 deduce anything. */
18329 int i
= TREE_VEC_LENGTH (targs
);
18331 if (TREE_VEC_ELT (tempargs
, i
))
18333 tree old
= TREE_VEC_ELT (targs
, i
);
18334 tree new_
= TREE_VEC_ELT (tempargs
, i
);
18335 if (new_
&& old
&& ARGUMENT_PACK_P (old
)
18336 && ARGUMENT_PACK_EXPLICIT_ARGS (old
))
18337 /* Don't forget explicit template arguments in a pack. */
18338 ARGUMENT_PACK_EXPLICIT_ARGS (new_
)
18339 = ARGUMENT_PACK_EXPLICIT_ARGS (old
);
18340 TREE_VEC_ELT (targs
, i
) = new_
;
18349 /* Core DR 115: In contexts where deduction is done and fails, or in
18350 contexts where deduction is not done, if a template argument list is
18351 specified and it, along with any default template arguments, identifies
18352 a single function template specialization, then the template-id is an
18353 lvalue for the function template specialization. */
18356 resolve_nondeduced_context (tree orig_expr
)
18358 tree expr
, offset
, baselink
;
18361 if (!type_unknown_p (orig_expr
))
18366 offset
= NULL_TREE
;
18367 baselink
= NULL_TREE
;
18369 if (TREE_CODE (expr
) == ADDR_EXPR
)
18371 expr
= TREE_OPERAND (expr
, 0);
18374 if (TREE_CODE (expr
) == OFFSET_REF
)
18377 expr
= TREE_OPERAND (expr
, 1);
18379 if (BASELINK_P (expr
))
18382 expr
= BASELINK_FUNCTIONS (expr
);
18385 if (TREE_CODE (expr
) == TEMPLATE_ID_EXPR
)
18388 tree goodfn
= NULL_TREE
;
18390 /* If we got some explicit template args, we need to plug them into
18391 the affected templates before we try to unify, in case the
18392 explicit args will completely resolve the templates in question. */
18394 tree expl_subargs
= TREE_OPERAND (expr
, 1);
18395 tree arg
= TREE_OPERAND (expr
, 0);
18396 tree badfn
= NULL_TREE
;
18397 tree badargs
= NULL_TREE
;
18399 for (; arg
; arg
= OVL_NEXT (arg
))
18401 tree fn
= OVL_CURRENT (arg
);
18402 tree subargs
, elem
;
18404 if (TREE_CODE (fn
) != TEMPLATE_DECL
)
18407 subargs
= coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (fn
),
18408 expl_subargs
, NULL_TREE
, tf_none
,
18409 /*require_all_args=*/true,
18410 /*use_default_args=*/true);
18411 if (subargs
!= error_mark_node
18412 && !any_dependent_template_arguments_p (subargs
))
18414 elem
= instantiate_template (fn
, subargs
, tf_none
);
18415 if (elem
== error_mark_node
)
18420 else if (elem
&& (!goodfn
|| !decls_match (goodfn
, elem
)))
18429 mark_used (goodfn
);
18432 expr
= build_baselink (BASELINK_BINFO (baselink
),
18433 BASELINK_ACCESS_BINFO (baselink
),
18434 expr
, BASELINK_OPTYPE (baselink
));
18438 = TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (offset
, 0)));
18439 expr
= build_offset_ref (base
, expr
, addr
, tf_warning_or_error
);
18442 expr
= cp_build_addr_expr (expr
, tf_warning_or_error
);
18445 else if (good
== 0 && badargs
)
18446 /* There were no good options and at least one bad one, so let the
18447 user know what the problem is. */
18448 instantiate_template (badfn
, badargs
, tf_warning_or_error
);
18453 /* Subroutine of resolve_overloaded_unification; does deduction for a single
18454 overload. Fills TARGS with any deduced arguments, or error_mark_node if
18455 different overloads deduce different arguments for a given parm.
18456 ADDR_P is true if the expression for which deduction is being
18457 performed was of the form "& fn" rather than simply "fn".
18459 Returns 1 on success. */
18462 try_one_overload (tree tparms
,
18467 unification_kind_t strict
,
18476 if (arg
== error_mark_node
)
18479 /* [temp.deduct.type] A template-argument can be deduced from a pointer
18480 to function or pointer to member function argument if the set of
18481 overloaded functions does not contain function templates and at most
18482 one of a set of overloaded functions provides a unique match.
18484 So if this is a template, just return success. */
18486 if (uses_template_parms (arg
))
18489 if (TREE_CODE (arg
) == METHOD_TYPE
)
18490 arg
= build_ptrmemfunc_type (build_pointer_type (arg
));
18492 arg
= build_pointer_type (arg
);
18494 sub_strict
|= maybe_adjust_types_for_deduction (strict
, &parm
, &arg
, NULL
);
18496 /* We don't copy orig_targs for this because if we have already deduced
18497 some template args from previous args, unify would complain when we
18498 try to deduce a template parameter for the same argument, even though
18499 there isn't really a conflict. */
18500 nargs
= TREE_VEC_LENGTH (targs
);
18501 tempargs
= make_tree_vec (nargs
);
18503 if (unify (tparms
, tempargs
, parm
, arg
, sub_strict
, explain_p
))
18506 /* First make sure we didn't deduce anything that conflicts with
18507 explicitly specified args. */
18508 for (i
= nargs
; i
--; )
18510 tree elt
= TREE_VEC_ELT (tempargs
, i
);
18511 tree oldelt
= TREE_VEC_ELT (orig_targs
, i
);
18515 else if (uses_template_parms (elt
))
18516 /* Since we're unifying against ourselves, we will fill in
18517 template args used in the function parm list with our own
18518 template parms. Discard them. */
18519 TREE_VEC_ELT (tempargs
, i
) = NULL_TREE
;
18520 else if (oldelt
&& !template_args_equal (oldelt
, elt
))
18524 for (i
= nargs
; i
--; )
18526 tree elt
= TREE_VEC_ELT (tempargs
, i
);
18529 TREE_VEC_ELT (targs
, i
) = elt
;
18535 /* PARM is a template class (perhaps with unbound template
18536 parameters). ARG is a fully instantiated type. If ARG can be
18537 bound to PARM, return ARG, otherwise return NULL_TREE. TPARMS and
18538 TARGS are as for unify. */
18541 try_class_unification (tree tparms
, tree targs
, tree parm
, tree arg
,
18544 tree copy_of_targs
;
18546 if (!CLASSTYPE_TEMPLATE_INFO (arg
)
18547 || (most_general_template (CLASSTYPE_TI_TEMPLATE (arg
))
18548 != most_general_template (CLASSTYPE_TI_TEMPLATE (parm
))))
18551 /* We need to make a new template argument vector for the call to
18552 unify. If we used TARGS, we'd clutter it up with the result of
18553 the attempted unification, even if this class didn't work out.
18554 We also don't want to commit ourselves to all the unifications
18555 we've already done, since unification is supposed to be done on
18556 an argument-by-argument basis. In other words, consider the
18557 following pathological case:
18559 template <int I, int J, int K>
18562 template <int I, int J>
18563 struct S<I, J, 2> : public S<I, I, I>, S<J, J, J> {};
18565 template <int I, int J, int K>
18566 void f(S<I, J, K>, S<I, I, I>);
18575 Now, by the time we consider the unification involving `s2', we
18576 already know that we must have `f<0, 0, 0>'. But, even though
18577 `S<0, 1, 2>' is derived from `S<0, 0, 0>', the code is invalid
18578 because there are two ways to unify base classes of S<0, 1, 2>
18579 with S<I, I, I>. If we kept the already deduced knowledge, we
18580 would reject the possibility I=1. */
18581 copy_of_targs
= make_tree_vec (TREE_VEC_LENGTH (targs
));
18583 /* If unification failed, we're done. */
18584 if (unify (tparms
, copy_of_targs
, CLASSTYPE_TI_ARGS (parm
),
18585 CLASSTYPE_TI_ARGS (arg
), UNIFY_ALLOW_NONE
, explain_p
))
18591 /* Given a template type PARM and a class type ARG, find the unique
18592 base type in ARG that is an instance of PARM. We do not examine
18593 ARG itself; only its base-classes. If there is not exactly one
18594 appropriate base class, return NULL_TREE. PARM may be the type of
18595 a partial specialization, as well as a plain template type. Used
18598 static enum template_base_result
18599 get_template_base (tree tparms
, tree targs
, tree parm
, tree arg
,
18600 bool explain_p
, tree
*result
)
18602 tree rval
= NULL_TREE
;
18605 gcc_assert (RECORD_OR_UNION_CODE_P (TREE_CODE (arg
)));
18607 binfo
= TYPE_BINFO (complete_type (arg
));
18610 /* The type could not be completed. */
18611 *result
= NULL_TREE
;
18612 return tbr_incomplete_type
;
18615 /* Walk in inheritance graph order. The search order is not
18616 important, and this avoids multiple walks of virtual bases. */
18617 for (binfo
= TREE_CHAIN (binfo
); binfo
; binfo
= TREE_CHAIN (binfo
))
18619 tree r
= try_class_unification (tparms
, targs
, parm
,
18620 BINFO_TYPE (binfo
), explain_p
);
18624 /* If there is more than one satisfactory baseclass, then:
18628 If they yield more than one possible deduced A, the type
18632 if (rval
&& !same_type_p (r
, rval
))
18634 *result
= NULL_TREE
;
18635 return tbr_ambiguous_baseclass
;
18643 return tbr_success
;
18646 /* Returns the level of DECL, which declares a template parameter. */
18649 template_decl_level (tree decl
)
18651 switch (TREE_CODE (decl
))
18654 case TEMPLATE_DECL
:
18655 return TEMPLATE_TYPE_LEVEL (TREE_TYPE (decl
));
18658 return TEMPLATE_PARM_LEVEL (DECL_INITIAL (decl
));
18661 gcc_unreachable ();
18666 /* Decide whether ARG can be unified with PARM, considering only the
18667 cv-qualifiers of each type, given STRICT as documented for unify.
18668 Returns nonzero iff the unification is OK on that basis. */
18671 check_cv_quals_for_unify (int strict
, tree arg
, tree parm
)
18673 int arg_quals
= cp_type_quals (arg
);
18674 int parm_quals
= cp_type_quals (parm
);
18676 if (TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
18677 && !(strict
& UNIFY_ALLOW_OUTER_MORE_CV_QUAL
))
18679 /* Although a CVR qualifier is ignored when being applied to a
18680 substituted template parameter ([8.3.2]/1 for example), that
18681 does not allow us to unify "const T" with "int&" because both
18682 types are not of the form "cv-list T" [14.8.2.5 temp.deduct.type].
18683 It is ok when we're allowing additional CV qualifiers
18684 at the outer level [14.8.2.1]/3,1st bullet. */
18685 if ((TREE_CODE (arg
) == REFERENCE_TYPE
18686 || TREE_CODE (arg
) == FUNCTION_TYPE
18687 || TREE_CODE (arg
) == METHOD_TYPE
)
18688 && (parm_quals
& (TYPE_QUAL_CONST
| TYPE_QUAL_VOLATILE
)))
18691 if ((!POINTER_TYPE_P (arg
) && TREE_CODE (arg
) != TEMPLATE_TYPE_PARM
)
18692 && (parm_quals
& TYPE_QUAL_RESTRICT
))
18696 if (!(strict
& (UNIFY_ALLOW_MORE_CV_QUAL
| UNIFY_ALLOW_OUTER_MORE_CV_QUAL
))
18697 && (arg_quals
& parm_quals
) != parm_quals
)
18700 if (!(strict
& (UNIFY_ALLOW_LESS_CV_QUAL
| UNIFY_ALLOW_OUTER_LESS_CV_QUAL
))
18701 && (parm_quals
& arg_quals
) != arg_quals
)
18707 /* Determines the LEVEL and INDEX for the template parameter PARM. */
18709 template_parm_level_and_index (tree parm
, int* level
, int* index
)
18711 if (TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
18712 || TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
18713 || TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
18715 *index
= TEMPLATE_TYPE_IDX (parm
);
18716 *level
= TEMPLATE_TYPE_LEVEL (parm
);
18720 *index
= TEMPLATE_PARM_IDX (parm
);
18721 *level
= TEMPLATE_PARM_LEVEL (parm
);
18725 #define RECUR_AND_CHECK_FAILURE(TP, TA, P, A, S, EP) \
18727 if (unify (TP, TA, P, A, S, EP)) \
18731 /* Unifies the remaining arguments in PACKED_ARGS with the pack
18732 expansion at the end of PACKED_PARMS. Returns 0 if the type
18733 deduction succeeds, 1 otherwise. STRICT is the same as in
18734 unify. CALL_ARGS_P is true iff PACKED_ARGS is actually a function
18735 call argument list. We'll need to adjust the arguments to make them
18736 types. SUBR tells us if this is from a recursive call to
18737 type_unification_real, or for comparing two template argument
18741 unify_pack_expansion (tree tparms
, tree targs
, tree packed_parms
,
18742 tree packed_args
, unification_kind_t strict
,
18743 bool subr
, bool explain_p
)
18746 = TREE_VEC_ELT (packed_parms
, TREE_VEC_LENGTH (packed_parms
) - 1);
18747 tree pattern
= PACK_EXPANSION_PATTERN (parm
);
18748 tree pack
, packs
= NULL_TREE
;
18749 int i
, start
= TREE_VEC_LENGTH (packed_parms
) - 1;
18751 packed_args
= expand_template_argument_pack (packed_args
);
18753 int len
= TREE_VEC_LENGTH (packed_args
);
18755 /* Determine the parameter packs we will be deducing from the
18756 pattern, and record their current deductions. */
18757 for (pack
= PACK_EXPANSION_PARAMETER_PACKS (parm
);
18758 pack
; pack
= TREE_CHAIN (pack
))
18760 tree parm_pack
= TREE_VALUE (pack
);
18763 /* Determine the index and level of this parameter pack. */
18764 template_parm_level_and_index (parm_pack
, &level
, &idx
);
18766 /* Keep track of the parameter packs and their corresponding
18768 packs
= tree_cons (parm_pack
, TMPL_ARG (targs
, level
, idx
), packs
);
18769 TREE_TYPE (packs
) = make_tree_vec (len
- start
);
18772 /* Loop through all of the arguments that have not yet been
18773 unified and unify each with the pattern. */
18774 for (i
= start
; i
< len
; i
++)
18777 bool any_explicit
= false;
18778 tree arg
= TREE_VEC_ELT (packed_args
, i
);
18780 /* For each parameter pack, set its TMPL_ARG to either NULL_TREE
18781 or the element of its argument pack at the current index if
18782 this argument was explicitly specified. */
18783 for (pack
= packs
; pack
; pack
= TREE_CHAIN (pack
))
18787 template_parm_level_and_index (TREE_PURPOSE (pack
), &level
, &idx
);
18790 if (TREE_VALUE (pack
)
18791 && (pargs
= ARGUMENT_PACK_EXPLICIT_ARGS (TREE_VALUE (pack
)))
18792 && (i
- start
< TREE_VEC_LENGTH (pargs
)))
18794 any_explicit
= true;
18795 arg
= TREE_VEC_ELT (pargs
, i
- start
);
18797 TMPL_ARG (targs
, level
, idx
) = arg
;
18800 /* If we had explicit template arguments, substitute them into the
18801 pattern before deduction. */
18804 /* Some arguments might still be unspecified or dependent. */
18806 ++processing_template_decl
;
18807 dependent
= any_dependent_template_arguments_p (targs
);
18809 --processing_template_decl
;
18810 parm
= tsubst (pattern
, targs
,
18811 explain_p
? tf_warning_or_error
: tf_none
,
18814 --processing_template_decl
;
18815 if (parm
== error_mark_node
)
18821 /* Unify the pattern with the current argument. */
18822 if (unify_one_argument (tparms
, targs
, parm
, arg
, subr
, strict
,
18826 /* For each parameter pack, collect the deduced value. */
18827 for (pack
= packs
; pack
; pack
= TREE_CHAIN (pack
))
18830 template_parm_level_and_index (TREE_PURPOSE (pack
), &level
, &idx
);
18832 TREE_VEC_ELT (TREE_TYPE (pack
), i
- start
) =
18833 TMPL_ARG (targs
, level
, idx
);
18837 /* Verify that the results of unification with the parameter packs
18838 produce results consistent with what we've seen before, and make
18839 the deduced argument packs available. */
18840 for (pack
= packs
; pack
; pack
= TREE_CHAIN (pack
))
18842 tree old_pack
= TREE_VALUE (pack
);
18843 tree new_args
= TREE_TYPE (pack
);
18844 int i
, len
= TREE_VEC_LENGTH (new_args
);
18846 bool nondeduced_p
= false;
18848 /* By default keep the original deduced argument pack.
18849 If necessary, more specific code is going to update the
18850 resulting deduced argument later down in this function. */
18851 template_parm_level_and_index (TREE_PURPOSE (pack
), &level
, &idx
);
18852 TMPL_ARG (targs
, level
, idx
) = old_pack
;
18854 /* If NEW_ARGS contains any NULL_TREE entries, we didn't
18855 actually deduce anything. */
18856 for (i
= 0; i
< len
&& !nondeduced_p
; ++i
)
18857 if (TREE_VEC_ELT (new_args
, i
) == NULL_TREE
)
18858 nondeduced_p
= true;
18862 if (old_pack
&& ARGUMENT_PACK_INCOMPLETE_P (old_pack
))
18864 /* If we had fewer function args than explicit template args,
18865 just use the explicits. */
18866 tree explicit_args
= ARGUMENT_PACK_EXPLICIT_ARGS (old_pack
);
18867 int explicit_len
= TREE_VEC_LENGTH (explicit_args
);
18868 if (len
< explicit_len
)
18869 new_args
= explicit_args
;
18875 /* Build the deduced *_ARGUMENT_PACK. */
18876 if (TREE_CODE (TREE_PURPOSE (pack
)) == TEMPLATE_PARM_INDEX
)
18878 result
= make_node (NONTYPE_ARGUMENT_PACK
);
18879 TREE_TYPE (result
) =
18880 TREE_TYPE (TEMPLATE_PARM_DECL (TREE_PURPOSE (pack
)));
18881 TREE_CONSTANT (result
) = 1;
18884 result
= cxx_make_type (TYPE_ARGUMENT_PACK
);
18886 SET_ARGUMENT_PACK_ARGS (result
, new_args
);
18888 /* Note the deduced argument packs for this parameter
18890 TMPL_ARG (targs
, level
, idx
) = result
;
18892 else if (ARGUMENT_PACK_INCOMPLETE_P (old_pack
)
18893 && (ARGUMENT_PACK_ARGS (old_pack
)
18894 == ARGUMENT_PACK_EXPLICIT_ARGS (old_pack
)))
18896 /* We only had the explicitly-provided arguments before, but
18897 now we have a complete set of arguments. */
18898 tree explicit_args
= ARGUMENT_PACK_EXPLICIT_ARGS (old_pack
);
18900 SET_ARGUMENT_PACK_ARGS (old_pack
, new_args
);
18901 ARGUMENT_PACK_INCOMPLETE_P (old_pack
) = 1;
18902 ARGUMENT_PACK_EXPLICIT_ARGS (old_pack
) = explicit_args
;
18906 tree bad_old_arg
= NULL_TREE
, bad_new_arg
= NULL_TREE
;
18907 tree old_args
= ARGUMENT_PACK_ARGS (old_pack
);
18909 if (!comp_template_args_with_info (old_args
, new_args
,
18910 &bad_old_arg
, &bad_new_arg
))
18911 /* Inconsistent unification of this parameter pack. */
18912 return unify_parameter_pack_inconsistent (explain_p
,
18918 return unify_success (explain_p
);
18921 /* Handle unification of the domain of an array. PARM_DOM and ARG_DOM are
18922 INTEGER_TYPEs representing the TYPE_DOMAIN of ARRAY_TYPEs. The other
18923 parameters and return value are as for unify. */
18926 unify_array_domain (tree tparms
, tree targs
,
18927 tree parm_dom
, tree arg_dom
,
18935 /* Our representation of array types uses "N - 1" as the
18936 TYPE_MAX_VALUE for an array with "N" elements, if "N" is
18937 not an integer constant. We cannot unify arbitrarily
18938 complex expressions, so we eliminate the MINUS_EXPRs
18940 parm_max
= TYPE_MAX_VALUE (parm_dom
);
18941 parm_cst
= TREE_CODE (parm_max
) == INTEGER_CST
;
18944 gcc_assert (TREE_CODE (parm_max
) == MINUS_EXPR
);
18945 parm_max
= TREE_OPERAND (parm_max
, 0);
18947 arg_max
= TYPE_MAX_VALUE (arg_dom
);
18948 arg_cst
= TREE_CODE (arg_max
) == INTEGER_CST
;
18951 /* The ARG_MAX may not be a simple MINUS_EXPR, if we are
18952 trying to unify the type of a variable with the type
18953 of a template parameter. For example:
18955 template <unsigned int N>
18956 void f (char (&) [N]);
18963 Here, the type of the ARG will be "int [g(i)]", and
18964 may be a SAVE_EXPR, etc. */
18965 if (TREE_CODE (arg_max
) != MINUS_EXPR
)
18966 return unify_vla_arg (explain_p
, arg_dom
);
18967 arg_max
= TREE_OPERAND (arg_max
, 0);
18970 /* If only one of the bounds used a MINUS_EXPR, compensate
18971 by adding one to the other bound. */
18972 if (parm_cst
&& !arg_cst
)
18973 parm_max
= fold_build2_loc (input_location
, PLUS_EXPR
,
18977 else if (arg_cst
&& !parm_cst
)
18978 arg_max
= fold_build2_loc (input_location
, PLUS_EXPR
,
18983 return unify (tparms
, targs
, parm_max
, arg_max
,
18984 UNIFY_ALLOW_INTEGER
, explain_p
);
18987 /* Deduce the value of template parameters. TPARMS is the (innermost)
18988 set of template parameters to a template. TARGS is the bindings
18989 for those template parameters, as determined thus far; TARGS may
18990 include template arguments for outer levels of template parameters
18991 as well. PARM is a parameter to a template function, or a
18992 subcomponent of that parameter; ARG is the corresponding argument.
18993 This function attempts to match PARM with ARG in a manner
18994 consistent with the existing assignments in TARGS. If more values
18995 are deduced, then TARGS is updated.
18997 Returns 0 if the type deduction succeeds, 1 otherwise. The
18998 parameter STRICT is a bitwise or of the following flags:
19001 Require an exact match between PARM and ARG.
19002 UNIFY_ALLOW_MORE_CV_QUAL:
19003 Allow the deduced ARG to be more cv-qualified (by qualification
19004 conversion) than ARG.
19005 UNIFY_ALLOW_LESS_CV_QUAL:
19006 Allow the deduced ARG to be less cv-qualified than ARG.
19007 UNIFY_ALLOW_DERIVED:
19008 Allow the deduced ARG to be a template base class of ARG,
19009 or a pointer to a template base class of the type pointed to by
19011 UNIFY_ALLOW_INTEGER:
19012 Allow any integral type to be deduced. See the TEMPLATE_PARM_INDEX
19013 case for more information.
19014 UNIFY_ALLOW_OUTER_LEVEL:
19015 This is the outermost level of a deduction. Used to determine validity
19016 of qualification conversions. A valid qualification conversion must
19017 have const qualified pointers leading up to the inner type which
19018 requires additional CV quals, except at the outer level, where const
19019 is not required [conv.qual]. It would be normal to set this flag in
19020 addition to setting UNIFY_ALLOW_MORE_CV_QUAL.
19021 UNIFY_ALLOW_OUTER_MORE_CV_QUAL:
19022 This is the outermost level of a deduction, and PARM can be more CV
19023 qualified at this point.
19024 UNIFY_ALLOW_OUTER_LESS_CV_QUAL:
19025 This is the outermost level of a deduction, and PARM can be less CV
19026 qualified at this point. */
19029 unify (tree tparms
, tree targs
, tree parm
, tree arg
, int strict
,
19035 int strict_in
= strict
;
19037 /* I don't think this will do the right thing with respect to types.
19038 But the only case I've seen it in so far has been array bounds, where
19039 signedness is the only information lost, and I think that will be
19041 while (TREE_CODE (parm
) == NOP_EXPR
)
19042 parm
= TREE_OPERAND (parm
, 0);
19044 if (arg
== error_mark_node
)
19045 return unify_invalid (explain_p
);
19046 if (arg
== unknown_type_node
19047 || arg
== init_list_type_node
)
19048 /* We can't deduce anything from this, but we might get all the
19049 template args from other function args. */
19050 return unify_success (explain_p
);
19052 /* If PARM uses template parameters, then we can't bail out here,
19053 even if ARG == PARM, since we won't record unifications for the
19054 template parameters. We might need them if we're trying to
19055 figure out which of two things is more specialized. */
19056 if (arg
== parm
&& !uses_template_parms (parm
))
19057 return unify_success (explain_p
);
19059 /* Handle init lists early, so the rest of the function can assume
19060 we're dealing with a type. */
19061 if (BRACE_ENCLOSED_INITIALIZER_P (arg
))
19065 tree orig_parm
= parm
;
19067 /* Replace T with std::initializer_list<T> for deduction. */
19068 if (TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
19069 && flag_deduce_init_list
)
19070 parm
= listify (parm
);
19072 if (!is_std_init_list (parm
)
19073 && TREE_CODE (parm
) != ARRAY_TYPE
)
19074 /* We can only deduce from an initializer list argument if the
19075 parameter is std::initializer_list or an array; otherwise this
19076 is a non-deduced context. */
19077 return unify_success (explain_p
);
19079 if (TREE_CODE (parm
) == ARRAY_TYPE
)
19080 elttype
= TREE_TYPE (parm
);
19083 elttype
= TREE_VEC_ELT (CLASSTYPE_TI_ARGS (parm
), 0);
19084 /* Deduction is defined in terms of a single type, so just punt
19085 on the (bizarre) std::initializer_list<T...>. */
19086 if (PACK_EXPANSION_P (elttype
))
19087 return unify_success (explain_p
);
19090 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (arg
), i
, elt
)
19092 int elt_strict
= strict
;
19094 if (elt
== error_mark_node
)
19095 return unify_invalid (explain_p
);
19097 if (!BRACE_ENCLOSED_INITIALIZER_P (elt
))
19099 tree type
= TREE_TYPE (elt
);
19100 if (type
== error_mark_node
)
19101 return unify_invalid (explain_p
);
19102 /* It should only be possible to get here for a call. */
19103 gcc_assert (elt_strict
& UNIFY_ALLOW_OUTER_LEVEL
);
19104 elt_strict
|= maybe_adjust_types_for_deduction
19105 (DEDUCE_CALL
, &elttype
, &type
, elt
);
19109 RECUR_AND_CHECK_FAILURE (tparms
, targs
, elttype
, elt
, elt_strict
,
19113 if (TREE_CODE (parm
) == ARRAY_TYPE
19114 && deducible_array_bound (TYPE_DOMAIN (parm
)))
19116 /* Also deduce from the length of the initializer list. */
19117 tree max
= size_int (CONSTRUCTOR_NELTS (arg
));
19118 tree idx
= compute_array_index_type (NULL_TREE
, max
, tf_none
);
19119 if (idx
== error_mark_node
)
19120 return unify_invalid (explain_p
);
19121 return unify_array_domain (tparms
, targs
, TYPE_DOMAIN (parm
),
19125 /* If the std::initializer_list<T> deduction worked, replace the
19126 deduced A with std::initializer_list<A>. */
19127 if (orig_parm
!= parm
)
19129 idx
= TEMPLATE_TYPE_IDX (orig_parm
);
19130 targ
= TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
);
19131 targ
= listify (targ
);
19132 TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
) = targ
;
19134 return unify_success (explain_p
);
19137 /* Immediately reject some pairs that won't unify because of
19138 cv-qualification mismatches. */
19139 if (TREE_CODE (arg
) == TREE_CODE (parm
)
19141 /* It is the elements of the array which hold the cv quals of an array
19142 type, and the elements might be template type parms. We'll check
19143 when we recurse. */
19144 && TREE_CODE (arg
) != ARRAY_TYPE
19145 /* We check the cv-qualifiers when unifying with template type
19146 parameters below. We want to allow ARG `const T' to unify with
19147 PARM `T' for example, when computing which of two templates
19148 is more specialized, for example. */
19149 && TREE_CODE (arg
) != TEMPLATE_TYPE_PARM
19150 && !check_cv_quals_for_unify (strict_in
, arg
, parm
))
19151 return unify_cv_qual_mismatch (explain_p
, parm
, arg
);
19153 if (!(strict
& UNIFY_ALLOW_OUTER_LEVEL
)
19154 && TYPE_P (parm
) && !CP_TYPE_CONST_P (parm
))
19155 strict
&= ~UNIFY_ALLOW_MORE_CV_QUAL
;
19156 strict
&= ~UNIFY_ALLOW_OUTER_LEVEL
;
19157 strict
&= ~UNIFY_ALLOW_DERIVED
;
19158 strict
&= ~UNIFY_ALLOW_OUTER_MORE_CV_QUAL
;
19159 strict
&= ~UNIFY_ALLOW_OUTER_LESS_CV_QUAL
;
19161 switch (TREE_CODE (parm
))
19163 case TYPENAME_TYPE
:
19165 case UNBOUND_CLASS_TEMPLATE
:
19166 /* In a type which contains a nested-name-specifier, template
19167 argument values cannot be deduced for template parameters used
19168 within the nested-name-specifier. */
19169 return unify_success (explain_p
);
19171 case TEMPLATE_TYPE_PARM
:
19172 case TEMPLATE_TEMPLATE_PARM
:
19173 case BOUND_TEMPLATE_TEMPLATE_PARM
:
19174 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, 0));
19175 if (error_operand_p (tparm
))
19176 return unify_invalid (explain_p
);
19178 if (TEMPLATE_TYPE_LEVEL (parm
)
19179 != template_decl_level (tparm
))
19180 /* The PARM is not one we're trying to unify. Just check
19181 to see if it matches ARG. */
19183 if (TREE_CODE (arg
) == TREE_CODE (parm
)
19184 && (is_auto (parm
) ? is_auto (arg
)
19185 : same_type_p (parm
, arg
)))
19186 return unify_success (explain_p
);
19188 return unify_type_mismatch (explain_p
, parm
, arg
);
19190 idx
= TEMPLATE_TYPE_IDX (parm
);
19191 targ
= TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
);
19192 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, idx
));
19193 if (error_operand_p (tparm
))
19194 return unify_invalid (explain_p
);
19196 /* Check for mixed types and values. */
19197 if ((TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
19198 && TREE_CODE (tparm
) != TYPE_DECL
)
19199 || (TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
19200 && TREE_CODE (tparm
) != TEMPLATE_DECL
))
19201 gcc_unreachable ();
19203 if (TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
19205 /* ARG must be constructed from a template class or a template
19206 template parameter. */
19207 if (TREE_CODE (arg
) != BOUND_TEMPLATE_TEMPLATE_PARM
19208 && !CLASSTYPE_SPECIALIZATION_OF_PRIMARY_TEMPLATE_P (arg
))
19209 return unify_template_deduction_failure (explain_p
, parm
, arg
);
19211 tree parmvec
= TYPE_TI_ARGS (parm
);
19212 /* An alias template name is never deduced. */
19213 if (TYPE_ALIAS_P (arg
))
19214 arg
= strip_typedefs (arg
);
19215 tree argvec
= INNERMOST_TEMPLATE_ARGS (TYPE_TI_ARGS (arg
));
19216 tree full_argvec
= add_to_template_args (targs
, argvec
);
19218 = DECL_INNERMOST_TEMPLATE_PARMS
19219 (TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL (parm
));
19221 int parm_variadic_p
= 0;
19223 /* The resolution to DR150 makes clear that default
19224 arguments for an N-argument may not be used to bind T
19225 to a template template parameter with fewer than N
19226 parameters. It is not safe to permit the binding of
19227 default arguments as an extension, as that may change
19228 the meaning of a conforming program. Consider:
19230 struct Dense { static const unsigned int dim = 1; };
19232 template <template <typename> class View,
19234 void operator+(float, View<Block> const&);
19236 template <typename Block,
19237 unsigned int Dim = Block::dim>
19238 struct Lvalue_proxy { operator float() const; };
19242 Lvalue_proxy<Dense> p;
19247 Here, if Lvalue_proxy is permitted to bind to View, then
19248 the global operator+ will be used; if they are not, the
19249 Lvalue_proxy will be converted to float. */
19250 if (coerce_template_parms (parm_parms
,
19252 TYPE_TI_TEMPLATE (parm
),
19254 ? tf_warning_or_error
19256 /*require_all_args=*/true,
19257 /*use_default_args=*/false)
19258 == error_mark_node
)
19261 /* Deduce arguments T, i from TT<T> or TT<i>.
19262 We check each element of PARMVEC and ARGVEC individually
19263 rather than the whole TREE_VEC since they can have
19264 different number of elements. */
19266 parmvec
= expand_template_argument_pack (parmvec
);
19267 argvec
= expand_template_argument_pack (argvec
);
19269 len
= TREE_VEC_LENGTH (parmvec
);
19271 /* Check if the parameters end in a pack, making them
19274 && PACK_EXPANSION_P (TREE_VEC_ELT (parmvec
, len
- 1)))
19275 parm_variadic_p
= 1;
19277 for (i
= 0; i
< len
- parm_variadic_p
; ++i
)
19278 /* If the template argument list of P contains a pack
19279 expansion that is not the last template argument, the
19280 entire template argument list is a non-deduced
19282 if (PACK_EXPANSION_P (TREE_VEC_ELT (parmvec
, i
)))
19283 return unify_success (explain_p
);
19285 if (TREE_VEC_LENGTH (argvec
) < len
- parm_variadic_p
)
19286 return unify_too_few_arguments (explain_p
,
19287 TREE_VEC_LENGTH (argvec
), len
);
19289 for (i
= 0; i
< len
- parm_variadic_p
; ++i
)
19291 RECUR_AND_CHECK_FAILURE (tparms
, targs
,
19292 TREE_VEC_ELT (parmvec
, i
),
19293 TREE_VEC_ELT (argvec
, i
),
19294 UNIFY_ALLOW_NONE
, explain_p
);
19297 if (parm_variadic_p
19298 && unify_pack_expansion (tparms
, targs
,
19301 /*subr=*/true, explain_p
))
19304 arg
= TYPE_TI_TEMPLATE (arg
);
19306 /* Fall through to deduce template name. */
19309 if (TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
19310 || TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
19312 /* Deduce template name TT from TT, TT<>, TT<T> and TT<i>. */
19314 /* Simple cases: Value already set, does match or doesn't. */
19315 if (targ
!= NULL_TREE
&& template_args_equal (targ
, arg
))
19316 return unify_success (explain_p
);
19318 return unify_inconsistency (explain_p
, parm
, targ
, arg
);
19322 /* If PARM is `const T' and ARG is only `int', we don't have
19323 a match unless we are allowing additional qualification.
19324 If ARG is `const int' and PARM is just `T' that's OK;
19325 that binds `const int' to `T'. */
19326 if (!check_cv_quals_for_unify (strict_in
| UNIFY_ALLOW_LESS_CV_QUAL
,
19328 return unify_cv_qual_mismatch (explain_p
, parm
, arg
);
19330 /* Consider the case where ARG is `const volatile int' and
19331 PARM is `const T'. Then, T should be `volatile int'. */
19332 arg
= cp_build_qualified_type_real
19333 (arg
, cp_type_quals (arg
) & ~cp_type_quals (parm
), tf_none
);
19334 if (arg
== error_mark_node
)
19335 return unify_invalid (explain_p
);
19337 /* Simple cases: Value already set, does match or doesn't. */
19338 if (targ
!= NULL_TREE
&& same_type_p (targ
, arg
))
19339 return unify_success (explain_p
);
19341 return unify_inconsistency (explain_p
, parm
, targ
, arg
);
19343 /* Make sure that ARG is not a variable-sized array. (Note
19344 that were talking about variable-sized arrays (like
19345 `int[n]'), rather than arrays of unknown size (like
19346 `int[]').) We'll get very confused by such a type since
19347 the bound of the array is not constant, and therefore
19348 not mangleable. Besides, such types are not allowed in
19349 ISO C++, so we can do as we please here. We do allow
19350 them for 'auto' deduction, since that isn't ABI-exposed. */
19351 if (!is_auto (parm
) && variably_modified_type_p (arg
, NULL_TREE
))
19352 return unify_vla_arg (explain_p
, arg
);
19354 /* Strip typedefs as in convert_template_argument. */
19355 arg
= canonicalize_type_argument (arg
, tf_none
);
19358 /* If ARG is a parameter pack or an expansion, we cannot unify
19359 against it unless PARM is also a parameter pack. */
19360 if ((template_parameter_pack_p (arg
) || PACK_EXPANSION_P (arg
))
19361 && !template_parameter_pack_p (parm
))
19362 return unify_parameter_pack_mismatch (explain_p
, parm
, arg
);
19364 /* If the argument deduction results is a METHOD_TYPE,
19365 then there is a problem.
19366 METHOD_TYPE doesn't map to any real C++ type the result of
19367 the deduction can not be of that type. */
19368 if (TREE_CODE (arg
) == METHOD_TYPE
)
19369 return unify_method_type_error (explain_p
, arg
);
19371 TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
) = arg
;
19372 return unify_success (explain_p
);
19374 case TEMPLATE_PARM_INDEX
:
19375 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, 0));
19376 if (error_operand_p (tparm
))
19377 return unify_invalid (explain_p
);
19379 if (TEMPLATE_PARM_LEVEL (parm
)
19380 != template_decl_level (tparm
))
19382 /* The PARM is not one we're trying to unify. Just check
19383 to see if it matches ARG. */
19384 int result
= !(TREE_CODE (arg
) == TREE_CODE (parm
)
19385 && cp_tree_equal (parm
, arg
));
19387 unify_expression_unequal (explain_p
, parm
, arg
);
19391 idx
= TEMPLATE_PARM_IDX (parm
);
19392 targ
= TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
);
19396 int x
= !cp_tree_equal (targ
, arg
);
19398 unify_inconsistency (explain_p
, parm
, targ
, arg
);
19402 /* [temp.deduct.type] If, in the declaration of a function template
19403 with a non-type template-parameter, the non-type
19404 template-parameter is used in an expression in the function
19405 parameter-list and, if the corresponding template-argument is
19406 deduced, the template-argument type shall match the type of the
19407 template-parameter exactly, except that a template-argument
19408 deduced from an array bound may be of any integral type.
19409 The non-type parameter might use already deduced type parameters. */
19410 tparm
= tsubst (TREE_TYPE (parm
), targs
, 0, NULL_TREE
);
19411 if (!TREE_TYPE (arg
))
19412 /* Template-parameter dependent expression. Just accept it for now.
19413 It will later be processed in convert_template_argument. */
19415 else if (same_type_p (TREE_TYPE (arg
), tparm
))
19417 else if ((strict
& UNIFY_ALLOW_INTEGER
)
19418 && CP_INTEGRAL_TYPE_P (tparm
))
19419 /* Convert the ARG to the type of PARM; the deduced non-type
19420 template argument must exactly match the types of the
19421 corresponding parameter. */
19422 arg
= fold (build_nop (tparm
, arg
));
19423 else if (uses_template_parms (tparm
))
19424 /* We haven't deduced the type of this parameter yet. Try again
19426 return unify_success (explain_p
);
19428 return unify_type_mismatch (explain_p
, tparm
, TREE_TYPE (arg
));
19430 /* If ARG is a parameter pack or an expansion, we cannot unify
19431 against it unless PARM is also a parameter pack. */
19432 if ((template_parameter_pack_p (arg
) || PACK_EXPANSION_P (arg
))
19433 && !TEMPLATE_PARM_PARAMETER_PACK (parm
))
19434 return unify_parameter_pack_mismatch (explain_p
, parm
, arg
);
19437 bool removed_attr
= false;
19438 arg
= strip_typedefs_expr (arg
, &removed_attr
);
19440 TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
) = arg
;
19441 return unify_success (explain_p
);
19445 /* A pointer-to-member constant can be unified only with
19446 another constant. */
19447 if (TREE_CODE (arg
) != PTRMEM_CST
)
19448 return unify_ptrmem_cst_mismatch (explain_p
, parm
, arg
);
19450 /* Just unify the class member. It would be useless (and possibly
19451 wrong, depending on the strict flags) to unify also
19452 PTRMEM_CST_CLASS, because we want to be sure that both parm and
19453 arg refer to the same variable, even if through different
19454 classes. For instance:
19456 struct A { int x; };
19459 Unification of &A::x and &B::x must succeed. */
19460 return unify (tparms
, targs
, PTRMEM_CST_MEMBER (parm
),
19461 PTRMEM_CST_MEMBER (arg
), strict
, explain_p
);
19466 if (!TYPE_PTR_P (arg
))
19467 return unify_type_mismatch (explain_p
, parm
, arg
);
19469 /* [temp.deduct.call]
19471 A can be another pointer or pointer to member type that can
19472 be converted to the deduced A via a qualification
19473 conversion (_conv.qual_).
19475 We pass down STRICT here rather than UNIFY_ALLOW_NONE.
19476 This will allow for additional cv-qualification of the
19477 pointed-to types if appropriate. */
19479 if (TREE_CODE (TREE_TYPE (arg
)) == RECORD_TYPE
)
19480 /* The derived-to-base conversion only persists through one
19481 level of pointers. */
19482 strict
|= (strict_in
& UNIFY_ALLOW_DERIVED
);
19484 return unify (tparms
, targs
, TREE_TYPE (parm
),
19485 TREE_TYPE (arg
), strict
, explain_p
);
19488 case REFERENCE_TYPE
:
19489 if (TREE_CODE (arg
) != REFERENCE_TYPE
)
19490 return unify_type_mismatch (explain_p
, parm
, arg
);
19491 return unify (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
19492 strict
& UNIFY_ALLOW_MORE_CV_QUAL
, explain_p
);
19495 if (TREE_CODE (arg
) != ARRAY_TYPE
)
19496 return unify_type_mismatch (explain_p
, parm
, arg
);
19497 if ((TYPE_DOMAIN (parm
) == NULL_TREE
)
19498 != (TYPE_DOMAIN (arg
) == NULL_TREE
))
19499 return unify_type_mismatch (explain_p
, parm
, arg
);
19500 RECUR_AND_CHECK_FAILURE (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
19501 strict
& UNIFY_ALLOW_MORE_CV_QUAL
, explain_p
);
19502 if (TYPE_DOMAIN (parm
) != NULL_TREE
)
19503 return unify_array_domain (tparms
, targs
, TYPE_DOMAIN (parm
),
19504 TYPE_DOMAIN (arg
), explain_p
);
19505 return unify_success (explain_p
);
19512 case ENUMERAL_TYPE
:
19515 if (TREE_CODE (arg
) != TREE_CODE (parm
))
19516 return unify_type_mismatch (explain_p
, parm
, arg
);
19518 /* We have already checked cv-qualification at the top of the
19520 if (!same_type_ignoring_top_level_qualifiers_p (arg
, parm
))
19521 return unify_type_mismatch (explain_p
, parm
, arg
);
19523 /* As far as unification is concerned, this wins. Later checks
19524 will invalidate it if necessary. */
19525 return unify_success (explain_p
);
19527 /* Types INTEGER_CST and MINUS_EXPR can come from array bounds. */
19528 /* Type INTEGER_CST can come from ordinary constant template args. */
19530 while (TREE_CODE (arg
) == NOP_EXPR
)
19531 arg
= TREE_OPERAND (arg
, 0);
19533 if (TREE_CODE (arg
) != INTEGER_CST
)
19534 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
19535 return (tree_int_cst_equal (parm
, arg
)
19536 ? unify_success (explain_p
)
19537 : unify_template_argument_mismatch (explain_p
, parm
, arg
));
19541 int i
, len
, argslen
;
19542 int parm_variadic_p
= 0;
19544 if (TREE_CODE (arg
) != TREE_VEC
)
19545 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
19547 len
= TREE_VEC_LENGTH (parm
);
19548 argslen
= TREE_VEC_LENGTH (arg
);
19550 /* Check for pack expansions in the parameters. */
19551 for (i
= 0; i
< len
; ++i
)
19553 if (PACK_EXPANSION_P (TREE_VEC_ELT (parm
, i
)))
19556 /* We can unify against something with a trailing
19558 parm_variadic_p
= 1;
19560 /* [temp.deduct.type]/9: If the template argument list of
19561 P contains a pack expansion that is not the last
19562 template argument, the entire template argument list
19563 is a non-deduced context. */
19564 return unify_success (explain_p
);
19568 /* If we don't have enough arguments to satisfy the parameters
19569 (not counting the pack expression at the end), or we have
19570 too many arguments for a parameter list that doesn't end in
19571 a pack expression, we can't unify. */
19572 if (parm_variadic_p
19573 ? argslen
< len
- parm_variadic_p
19575 return unify_arity (explain_p
, TREE_VEC_LENGTH (arg
), len
);
19577 /* Unify all of the parameters that precede the (optional)
19578 pack expression. */
19579 for (i
= 0; i
< len
- parm_variadic_p
; ++i
)
19581 RECUR_AND_CHECK_FAILURE (tparms
, targs
,
19582 TREE_VEC_ELT (parm
, i
),
19583 TREE_VEC_ELT (arg
, i
),
19584 UNIFY_ALLOW_NONE
, explain_p
);
19586 if (parm_variadic_p
)
19587 return unify_pack_expansion (tparms
, targs
, parm
, arg
,
19589 /*subr=*/true, explain_p
);
19590 return unify_success (explain_p
);
19595 if (TREE_CODE (arg
) != TREE_CODE (parm
))
19596 return unify_type_mismatch (explain_p
, parm
, arg
);
19598 if (TYPE_PTRMEMFUNC_P (parm
))
19600 if (!TYPE_PTRMEMFUNC_P (arg
))
19601 return unify_type_mismatch (explain_p
, parm
, arg
);
19603 return unify (tparms
, targs
,
19604 TYPE_PTRMEMFUNC_FN_TYPE (parm
),
19605 TYPE_PTRMEMFUNC_FN_TYPE (arg
),
19606 strict
, explain_p
);
19608 else if (TYPE_PTRMEMFUNC_P (arg
))
19609 return unify_type_mismatch (explain_p
, parm
, arg
);
19611 if (CLASSTYPE_TEMPLATE_INFO (parm
))
19613 tree t
= NULL_TREE
;
19615 if (strict_in
& UNIFY_ALLOW_DERIVED
)
19617 /* First, we try to unify the PARM and ARG directly. */
19618 t
= try_class_unification (tparms
, targs
,
19619 parm
, arg
, explain_p
);
19623 /* Fallback to the special case allowed in
19624 [temp.deduct.call]:
19626 If P is a class, and P has the form
19627 template-id, then A can be a derived class of
19628 the deduced A. Likewise, if P is a pointer to
19629 a class of the form template-id, A can be a
19630 pointer to a derived class pointed to by the
19632 enum template_base_result r
;
19633 r
= get_template_base (tparms
, targs
, parm
, arg
,
19637 return unify_no_common_base (explain_p
, r
, parm
, arg
);
19640 else if (CLASSTYPE_TEMPLATE_INFO (arg
)
19641 && (CLASSTYPE_TI_TEMPLATE (parm
)
19642 == CLASSTYPE_TI_TEMPLATE (arg
)))
19643 /* Perhaps PARM is something like S<U> and ARG is S<int>.
19644 Then, we should unify `int' and `U'. */
19647 /* There's no chance of unification succeeding. */
19648 return unify_type_mismatch (explain_p
, parm
, arg
);
19650 return unify (tparms
, targs
, CLASSTYPE_TI_ARGS (parm
),
19651 CLASSTYPE_TI_ARGS (t
), UNIFY_ALLOW_NONE
, explain_p
);
19653 else if (!same_type_ignoring_top_level_qualifiers_p (parm
, arg
))
19654 return unify_type_mismatch (explain_p
, parm
, arg
);
19655 return unify_success (explain_p
);
19658 case FUNCTION_TYPE
:
19660 unsigned int nargs
;
19665 if (TREE_CODE (arg
) != TREE_CODE (parm
))
19666 return unify_type_mismatch (explain_p
, parm
, arg
);
19668 /* CV qualifications for methods can never be deduced, they must
19669 match exactly. We need to check them explicitly here,
19670 because type_unification_real treats them as any other
19671 cv-qualified parameter. */
19672 if (TREE_CODE (parm
) == METHOD_TYPE
19673 && (!check_cv_quals_for_unify
19675 class_of_this_parm (arg
),
19676 class_of_this_parm (parm
))))
19677 return unify_cv_qual_mismatch (explain_p
, parm
, arg
);
19679 RECUR_AND_CHECK_FAILURE (tparms
, targs
, TREE_TYPE (parm
),
19680 TREE_TYPE (arg
), UNIFY_ALLOW_NONE
, explain_p
);
19682 nargs
= list_length (TYPE_ARG_TYPES (arg
));
19683 args
= XALLOCAVEC (tree
, nargs
);
19684 for (a
= TYPE_ARG_TYPES (arg
), i
= 0;
19685 a
!= NULL_TREE
&& a
!= void_list_node
;
19686 a
= TREE_CHAIN (a
), ++i
)
19687 args
[i
] = TREE_VALUE (a
);
19690 return type_unification_real (tparms
, targs
, TYPE_ARG_TYPES (parm
),
19691 args
, nargs
, 1, DEDUCE_EXACT
,
19692 LOOKUP_NORMAL
, NULL
, explain_p
);
19696 /* Unify a pointer to member with a pointer to member function, which
19697 deduces the type of the member as a function type. */
19698 if (TYPE_PTRMEMFUNC_P (arg
))
19700 /* Check top-level cv qualifiers */
19701 if (!check_cv_quals_for_unify (UNIFY_ALLOW_NONE
, arg
, parm
))
19702 return unify_cv_qual_mismatch (explain_p
, parm
, arg
);
19704 RECUR_AND_CHECK_FAILURE (tparms
, targs
, TYPE_OFFSET_BASETYPE (parm
),
19705 TYPE_PTRMEMFUNC_OBJECT_TYPE (arg
),
19706 UNIFY_ALLOW_NONE
, explain_p
);
19708 /* Determine the type of the function we are unifying against. */
19709 tree fntype
= static_fn_type (arg
);
19711 return unify (tparms
, targs
, TREE_TYPE (parm
), fntype
, strict
, explain_p
);
19714 if (TREE_CODE (arg
) != OFFSET_TYPE
)
19715 return unify_type_mismatch (explain_p
, parm
, arg
);
19716 RECUR_AND_CHECK_FAILURE (tparms
, targs
, TYPE_OFFSET_BASETYPE (parm
),
19717 TYPE_OFFSET_BASETYPE (arg
),
19718 UNIFY_ALLOW_NONE
, explain_p
);
19719 return unify (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
19720 strict
, explain_p
);
19723 if (DECL_TEMPLATE_PARM_P (parm
))
19724 return unify (tparms
, targs
, DECL_INITIAL (parm
), arg
, strict
, explain_p
);
19725 if (arg
!= scalar_constant_value (parm
))
19726 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
19727 return unify_success (explain_p
);
19730 case TEMPLATE_DECL
:
19731 /* Matched cases are handled by the ARG == PARM test above. */
19732 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
19735 /* A non-type template parameter that is a variable should be a
19736 an integral constant, in which case, it whould have been
19737 folded into its (constant) value. So we should not be getting
19738 a variable here. */
19739 gcc_unreachable ();
19741 case TYPE_ARGUMENT_PACK
:
19742 case NONTYPE_ARGUMENT_PACK
:
19743 return unify (tparms
, targs
, ARGUMENT_PACK_ARGS (parm
),
19744 ARGUMENT_PACK_ARGS (arg
), strict
, explain_p
);
19747 case DECLTYPE_TYPE
:
19748 case UNDERLYING_TYPE
:
19749 /* Cannot deduce anything from TYPEOF_TYPE, DECLTYPE_TYPE,
19750 or UNDERLYING_TYPE nodes. */
19751 return unify_success (explain_p
);
19754 /* Unification fails if we hit an error node. */
19755 return unify_invalid (explain_p
);
19758 if (REFERENCE_REF_P (parm
))
19760 if (REFERENCE_REF_P (arg
))
19761 arg
= TREE_OPERAND (arg
, 0);
19762 return unify (tparms
, targs
, TREE_OPERAND (parm
, 0), arg
,
19763 strict
, explain_p
);
19768 /* An unresolved overload is a nondeduced context. */
19769 if (is_overloaded_fn (parm
) || type_unknown_p (parm
))
19770 return unify_success (explain_p
);
19771 gcc_assert (EXPR_P (parm
));
19773 /* We must be looking at an expression. This can happen with
19777 void foo(S<I>, S<I + 2>);
19779 This is a "nondeduced context":
19783 The nondeduced contexts are:
19785 --A type that is a template-id in which one or more of
19786 the template-arguments is an expression that references
19787 a template-parameter.
19789 In these cases, we assume deduction succeeded, but don't
19790 actually infer any unifications. */
19792 if (!uses_template_parms (parm
)
19793 && !template_args_equal (parm
, arg
))
19794 return unify_expression_unequal (explain_p
, parm
, arg
);
19796 return unify_success (explain_p
);
19799 #undef RECUR_AND_CHECK_FAILURE
19801 /* Note that DECL can be defined in this translation unit, if
19805 mark_definable (tree decl
)
19808 DECL_NOT_REALLY_EXTERN (decl
) = 1;
19809 FOR_EACH_CLONE (clone
, decl
)
19810 DECL_NOT_REALLY_EXTERN (clone
) = 1;
19813 /* Called if RESULT is explicitly instantiated, or is a member of an
19814 explicitly instantiated class. */
19817 mark_decl_instantiated (tree result
, int extern_p
)
19819 SET_DECL_EXPLICIT_INSTANTIATION (result
);
19821 /* If this entity has already been written out, it's too late to
19822 make any modifications. */
19823 if (TREE_ASM_WRITTEN (result
))
19826 /* For anonymous namespace we don't need to do anything. */
19827 if (decl_anon_ns_mem_p (result
))
19829 gcc_assert (!TREE_PUBLIC (result
));
19833 if (TREE_CODE (result
) != FUNCTION_DECL
)
19834 /* The TREE_PUBLIC flag for function declarations will have been
19835 set correctly by tsubst. */
19836 TREE_PUBLIC (result
) = 1;
19838 /* This might have been set by an earlier implicit instantiation. */
19839 DECL_COMDAT (result
) = 0;
19842 DECL_NOT_REALLY_EXTERN (result
) = 0;
19845 mark_definable (result
);
19846 mark_needed (result
);
19847 /* Always make artificials weak. */
19848 if (DECL_ARTIFICIAL (result
) && flag_weak
)
19849 comdat_linkage (result
);
19850 /* For WIN32 we also want to put explicit instantiations in
19851 linkonce sections. */
19852 else if (TREE_PUBLIC (result
))
19853 maybe_make_one_only (result
);
19856 /* If EXTERN_P, then this function will not be emitted -- unless
19857 followed by an explicit instantiation, at which point its linkage
19858 will be adjusted. If !EXTERN_P, then this function will be
19859 emitted here. In neither circumstance do we want
19860 import_export_decl to adjust the linkage. */
19861 DECL_INTERFACE_KNOWN (result
) = 1;
19864 /* Subroutine of more_specialized_fn: check whether TARGS is missing any
19865 important template arguments. If any are missing, we check whether
19866 they're important by using error_mark_node for substituting into any
19867 args that were used for partial ordering (the ones between ARGS and END)
19868 and seeing if it bubbles up. */
19871 check_undeduced_parms (tree targs
, tree args
, tree end
)
19873 bool found
= false;
19875 for (i
= TREE_VEC_LENGTH (targs
) - 1; i
>= 0; --i
)
19876 if (TREE_VEC_ELT (targs
, i
) == NULL_TREE
)
19879 TREE_VEC_ELT (targs
, i
) = error_mark_node
;
19883 tree substed
= tsubst_arg_types (args
, targs
, end
, tf_none
, NULL_TREE
);
19884 if (substed
== error_mark_node
)
19890 /* Given two function templates PAT1 and PAT2, return:
19892 1 if PAT1 is more specialized than PAT2 as described in [temp.func.order].
19893 -1 if PAT2 is more specialized than PAT1.
19894 0 if neither is more specialized.
19896 LEN indicates the number of parameters we should consider
19897 (defaulted parameters should not be considered).
19899 The 1998 std underspecified function template partial ordering, and
19900 DR214 addresses the issue. We take pairs of arguments, one from
19901 each of the templates, and deduce them against each other. One of
19902 the templates will be more specialized if all the *other*
19903 template's arguments deduce against its arguments and at least one
19904 of its arguments *does* *not* deduce against the other template's
19905 corresponding argument. Deduction is done as for class templates.
19906 The arguments used in deduction have reference and top level cv
19907 qualifiers removed. Iff both arguments were originally reference
19908 types *and* deduction succeeds in both directions, an lvalue reference
19909 wins against an rvalue reference and otherwise the template
19910 with the more cv-qualified argument wins for that pairing (if
19911 neither is more cv-qualified, they both are equal). Unlike regular
19912 deduction, after all the arguments have been deduced in this way,
19913 we do *not* verify the deduced template argument values can be
19914 substituted into non-deduced contexts.
19916 The logic can be a bit confusing here, because we look at deduce1 and
19917 targs1 to see if pat2 is at least as specialized, and vice versa; if we
19918 can find template arguments for pat1 to make arg1 look like arg2, that
19919 means that arg2 is at least as specialized as arg1. */
19922 more_specialized_fn (tree pat1
, tree pat2
, int len
)
19924 tree decl1
= DECL_TEMPLATE_RESULT (pat1
);
19925 tree decl2
= DECL_TEMPLATE_RESULT (pat2
);
19926 tree targs1
= make_tree_vec (DECL_NTPARMS (pat1
));
19927 tree targs2
= make_tree_vec (DECL_NTPARMS (pat2
));
19928 tree tparms1
= DECL_INNERMOST_TEMPLATE_PARMS (pat1
);
19929 tree tparms2
= DECL_INNERMOST_TEMPLATE_PARMS (pat2
);
19930 tree args1
= TYPE_ARG_TYPES (TREE_TYPE (decl1
));
19931 tree args2
= TYPE_ARG_TYPES (TREE_TYPE (decl2
));
19932 tree origs1
, origs2
;
19933 bool lose1
= false;
19934 bool lose2
= false;
19936 /* Remove the this parameter from non-static member functions. If
19937 one is a non-static member function and the other is not a static
19938 member function, remove the first parameter from that function
19939 also. This situation occurs for operator functions where we
19940 locate both a member function (with this pointer) and non-member
19941 operator (with explicit first operand). */
19942 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl1
))
19944 len
--; /* LEN is the number of significant arguments for DECL1 */
19945 args1
= TREE_CHAIN (args1
);
19946 if (!DECL_STATIC_FUNCTION_P (decl2
))
19947 args2
= TREE_CHAIN (args2
);
19949 else if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl2
))
19951 args2
= TREE_CHAIN (args2
);
19952 if (!DECL_STATIC_FUNCTION_P (decl1
))
19955 args1
= TREE_CHAIN (args1
);
19959 /* If only one is a conversion operator, they are unordered. */
19960 if (DECL_CONV_FN_P (decl1
) != DECL_CONV_FN_P (decl2
))
19963 /* Consider the return type for a conversion function */
19964 if (DECL_CONV_FN_P (decl1
))
19966 args1
= tree_cons (NULL_TREE
, TREE_TYPE (TREE_TYPE (decl1
)), args1
);
19967 args2
= tree_cons (NULL_TREE
, TREE_TYPE (TREE_TYPE (decl2
)), args2
);
19971 processing_template_decl
++;
19977 /* Stop when an ellipsis is seen. */
19978 && args1
!= NULL_TREE
&& args2
!= NULL_TREE
)
19980 tree arg1
= TREE_VALUE (args1
);
19981 tree arg2
= TREE_VALUE (args2
);
19982 int deduce1
, deduce2
;
19988 if (TREE_CODE (arg1
) == TYPE_PACK_EXPANSION
19989 && TREE_CODE (arg2
) == TYPE_PACK_EXPANSION
)
19991 /* When both arguments are pack expansions, we need only
19992 unify the patterns themselves. */
19993 arg1
= PACK_EXPANSION_PATTERN (arg1
);
19994 arg2
= PACK_EXPANSION_PATTERN (arg2
);
19996 /* This is the last comparison we need to do. */
20000 if (TREE_CODE (arg1
) == REFERENCE_TYPE
)
20002 ref1
= TYPE_REF_IS_RVALUE (arg1
) + 1;
20003 arg1
= TREE_TYPE (arg1
);
20004 quals1
= cp_type_quals (arg1
);
20007 if (TREE_CODE (arg2
) == REFERENCE_TYPE
)
20009 ref2
= TYPE_REF_IS_RVALUE (arg2
) + 1;
20010 arg2
= TREE_TYPE (arg2
);
20011 quals2
= cp_type_quals (arg2
);
20014 arg1
= TYPE_MAIN_VARIANT (arg1
);
20015 arg2
= TYPE_MAIN_VARIANT (arg2
);
20017 if (TREE_CODE (arg1
) == TYPE_PACK_EXPANSION
)
20019 int i
, len2
= list_length (args2
);
20020 tree parmvec
= make_tree_vec (1);
20021 tree argvec
= make_tree_vec (len2
);
20024 /* Setup the parameter vector, which contains only ARG1. */
20025 TREE_VEC_ELT (parmvec
, 0) = arg1
;
20027 /* Setup the argument vector, which contains the remaining
20029 for (i
= 0; i
< len2
; i
++, ta
= TREE_CHAIN (ta
))
20030 TREE_VEC_ELT (argvec
, i
) = TREE_VALUE (ta
);
20032 deduce1
= (unify_pack_expansion (tparms1
, targs1
, parmvec
,
20033 argvec
, DEDUCE_EXACT
,
20034 /*subr=*/true, /*explain_p=*/false)
20037 /* We cannot deduce in the other direction, because ARG1 is
20038 a pack expansion but ARG2 is not. */
20041 else if (TREE_CODE (arg2
) == TYPE_PACK_EXPANSION
)
20043 int i
, len1
= list_length (args1
);
20044 tree parmvec
= make_tree_vec (1);
20045 tree argvec
= make_tree_vec (len1
);
20048 /* Setup the parameter vector, which contains only ARG1. */
20049 TREE_VEC_ELT (parmvec
, 0) = arg2
;
20051 /* Setup the argument vector, which contains the remaining
20053 for (i
= 0; i
< len1
; i
++, ta
= TREE_CHAIN (ta
))
20054 TREE_VEC_ELT (argvec
, i
) = TREE_VALUE (ta
);
20056 deduce2
= (unify_pack_expansion (tparms2
, targs2
, parmvec
,
20057 argvec
, DEDUCE_EXACT
,
20058 /*subr=*/true, /*explain_p=*/false)
20061 /* We cannot deduce in the other direction, because ARG2 is
20062 a pack expansion but ARG1 is not.*/
20068 /* The normal case, where neither argument is a pack
20070 deduce1
= (unify (tparms1
, targs1
, arg1
, arg2
,
20071 UNIFY_ALLOW_NONE
, /*explain_p=*/false)
20073 deduce2
= (unify (tparms2
, targs2
, arg2
, arg1
,
20074 UNIFY_ALLOW_NONE
, /*explain_p=*/false)
20078 /* If we couldn't deduce arguments for tparms1 to make arg1 match
20079 arg2, then arg2 is not as specialized as arg1. */
20085 /* "If, for a given type, deduction succeeds in both directions
20086 (i.e., the types are identical after the transformations above)
20087 and both P and A were reference types (before being replaced with
20088 the type referred to above):
20089 - if the type from the argument template was an lvalue reference and
20090 the type from the parameter template was not, the argument type is
20091 considered to be more specialized than the other; otherwise,
20092 - if the type from the argument template is more cv-qualified
20093 than the type from the parameter template (as described above),
20094 the argument type is considered to be more specialized than the other;
20096 - neither type is more specialized than the other." */
20098 if (deduce1
&& deduce2
)
20100 if (ref1
&& ref2
&& ref1
!= ref2
)
20107 else if (quals1
!= quals2
&& quals1
>= 0 && quals2
>= 0)
20109 if ((quals1
& quals2
) == quals2
)
20111 if ((quals1
& quals2
) == quals1
)
20116 if (lose1
&& lose2
)
20117 /* We've failed to deduce something in either direction.
20118 These must be unordered. */
20121 if (TREE_CODE (arg1
) == TYPE_PACK_EXPANSION
20122 || TREE_CODE (arg2
) == TYPE_PACK_EXPANSION
)
20123 /* We have already processed all of the arguments in our
20124 handing of the pack expansion type. */
20127 args1
= TREE_CHAIN (args1
);
20128 args2
= TREE_CHAIN (args2
);
20131 /* "In most cases, all template parameters must have values in order for
20132 deduction to succeed, but for partial ordering purposes a template
20133 parameter may remain without a value provided it is not used in the
20134 types being used for partial ordering."
20136 Thus, if we are missing any of the targs1 we need to substitute into
20137 origs1, then pat2 is not as specialized as pat1. This can happen when
20138 there is a nondeduced context. */
20139 if (!lose2
&& check_undeduced_parms (targs1
, origs1
, args1
))
20141 if (!lose1
&& check_undeduced_parms (targs2
, origs2
, args2
))
20144 processing_template_decl
--;
20146 /* If both deductions succeed, the partial ordering selects the more
20147 constrained template. */
20148 if (!lose1
&& !lose2
)
20150 tree c1
= get_constraints (DECL_TEMPLATE_RESULT (pat1
));
20151 tree c2
= get_constraints (DECL_TEMPLATE_RESULT (pat2
));
20152 lose1
= !subsumes_constraints (c1
, c2
);
20153 lose2
= !subsumes_constraints (c2
, c1
);
20156 /* All things being equal, if the next argument is a pack expansion
20157 for one function but not for the other, prefer the
20158 non-variadic function. FIXME this is bogus; see c++/41958. */
20160 && args1
&& TREE_VALUE (args1
)
20161 && args2
&& TREE_VALUE (args2
))
20163 lose1
= TREE_CODE (TREE_VALUE (args1
)) == TYPE_PACK_EXPANSION
;
20164 lose2
= TREE_CODE (TREE_VALUE (args2
)) == TYPE_PACK_EXPANSION
;
20167 if (lose1
== lose2
)
20175 /* Determine which of two partial specializations of TMPL is more
20178 PAT1 is a TREE_LIST whose TREE_VALUE is the TEMPLATE_DECL corresponding
20179 to the first partial specialization. The TREE_PURPOSE is the
20180 innermost set of template parameters for the partial
20181 specialization. PAT2 is similar, but for the second template.
20183 Return 1 if the first partial specialization is more specialized;
20184 -1 if the second is more specialized; 0 if neither is more
20187 See [temp.class.order] for information about determining which of
20188 two templates is more specialized. */
20191 more_specialized_partial_spec (tree tmpl
, tree pat1
, tree pat2
)
20195 bool any_deductions
= false;
20197 tree tmpl1
= TREE_VALUE (pat1
);
20198 tree tmpl2
= TREE_VALUE (pat2
);
20199 tree parms1
= DECL_INNERMOST_TEMPLATE_PARMS (tmpl1
);
20200 tree parms2
= DECL_INNERMOST_TEMPLATE_PARMS (tmpl2
);
20201 tree specargs1
= TI_ARGS (get_template_info (DECL_TEMPLATE_RESULT (tmpl1
)));
20202 tree specargs2
= TI_ARGS (get_template_info (DECL_TEMPLATE_RESULT (tmpl2
)));
20204 /* Just like what happens for functions, if we are ordering between
20205 different template specializations, we may encounter dependent
20206 types in the arguments, and we need our dependency check functions
20207 to behave correctly. */
20208 ++processing_template_decl
;
20209 targs
= get_partial_spec_bindings (tmpl
, parms1
, specargs1
, specargs2
);
20213 any_deductions
= true;
20216 targs
= get_partial_spec_bindings (tmpl
, parms2
, specargs2
, specargs1
);
20220 any_deductions
= true;
20222 --processing_template_decl
;
20224 /* If both deductions succeed, the partial ordering selects the more
20225 constrained template. */
20226 if (!winner
&& any_deductions
)
20227 return more_constrained (tmpl1
, tmpl2
);
20229 /* In the case of a tie where at least one of the templates
20230 has a parameter pack at the end, the template with the most
20231 non-packed parameters wins. */
20234 && (template_args_variadic_p (TREE_PURPOSE (pat1
))
20235 || template_args_variadic_p (TREE_PURPOSE (pat2
))))
20237 tree args1
= INNERMOST_TEMPLATE_ARGS (TREE_PURPOSE (pat1
));
20238 tree args2
= INNERMOST_TEMPLATE_ARGS (TREE_PURPOSE (pat2
));
20239 int len1
= TREE_VEC_LENGTH (args1
);
20240 int len2
= TREE_VEC_LENGTH (args2
);
20242 /* We don't count the pack expansion at the end. */
20243 if (template_args_variadic_p (TREE_PURPOSE (pat1
)))
20245 if (template_args_variadic_p (TREE_PURPOSE (pat2
)))
20250 else if (len1
< len2
)
20257 /* Return the template arguments that will produce the function signature
20258 DECL from the function template FN, with the explicit template
20259 arguments EXPLICIT_ARGS. If CHECK_RETTYPE is true, the return type must
20260 also match. Return NULL_TREE if no satisfactory arguments could be
20264 get_bindings (tree fn
, tree decl
, tree explicit_args
, bool check_rettype
)
20266 int ntparms
= DECL_NTPARMS (fn
);
20267 tree targs
= make_tree_vec (ntparms
);
20268 tree decl_type
= TREE_TYPE (decl
);
20269 tree decl_arg_types
;
20271 unsigned int nargs
, ix
;
20274 gcc_assert (decl
!= DECL_TEMPLATE_RESULT (fn
));
20276 /* Never do unification on the 'this' parameter. */
20277 decl_arg_types
= skip_artificial_parms_for (decl
,
20278 TYPE_ARG_TYPES (decl_type
));
20280 nargs
= list_length (decl_arg_types
);
20281 args
= XALLOCAVEC (tree
, nargs
);
20282 for (arg
= decl_arg_types
, ix
= 0;
20283 arg
!= NULL_TREE
&& arg
!= void_list_node
;
20284 arg
= TREE_CHAIN (arg
), ++ix
)
20285 args
[ix
] = TREE_VALUE (arg
);
20287 if (fn_type_unification (fn
, explicit_args
, targs
,
20289 (check_rettype
|| DECL_CONV_FN_P (fn
)
20290 ? TREE_TYPE (decl_type
) : NULL_TREE
),
20291 DEDUCE_EXACT
, LOOKUP_NORMAL
, /*explain_p=*/false,
20293 == error_mark_node
)
20299 /* Return the innermost template arguments that, when applied to a partial
20300 specialization of TMPL whose innermost template parameters are
20301 TPARMS, and whose specialization arguments are SPEC_ARGS, yield the
20304 For example, suppose we have:
20306 template <class T, class U> struct S {};
20307 template <class T> struct S<T*, int> {};
20309 Then, suppose we want to get `S<double*, int>'. The TPARMS will be
20310 {T}, the SPEC_ARGS will be {T*, int} and the ARGS will be {double*,
20311 int}. The resulting vector will be {double}, indicating that `T'
20312 is bound to `double'. */
20315 get_partial_spec_bindings (tree tmpl
, tree tparms
, tree spec_args
, tree args
)
20317 int i
, ntparms
= TREE_VEC_LENGTH (tparms
);
20319 tree innermost_deduced_args
;
20321 innermost_deduced_args
= make_tree_vec (ntparms
);
20322 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (args
))
20324 deduced_args
= copy_node (args
);
20325 SET_TMPL_ARGS_LEVEL (deduced_args
,
20326 TMPL_ARGS_DEPTH (deduced_args
),
20327 innermost_deduced_args
);
20330 deduced_args
= innermost_deduced_args
;
20332 if (unify (tparms
, deduced_args
,
20333 INNERMOST_TEMPLATE_ARGS (spec_args
),
20334 INNERMOST_TEMPLATE_ARGS (args
),
20335 UNIFY_ALLOW_NONE
, /*explain_p=*/false))
20338 for (i
= 0; i
< ntparms
; ++i
)
20339 if (! TREE_VEC_ELT (innermost_deduced_args
, i
))
20342 /* Verify that nondeduced template arguments agree with the type
20343 obtained from argument deduction.
20347 struct A { typedef int X; };
20348 template <class T, class U> struct C {};
20349 template <class T> struct C<T, typename T::X> {};
20351 Then with the instantiation `C<A, int>', we can deduce that
20352 `T' is `A' but unify () does not check whether `typename T::X'
20354 spec_args
= tsubst (spec_args
, deduced_args
, tf_none
, NULL_TREE
);
20355 spec_args
= coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (tmpl
),
20357 tf_none
, false, false);
20358 if (spec_args
== error_mark_node
20359 /* We only need to check the innermost arguments; the other
20360 arguments will always agree. */
20361 || !comp_template_args (INNERMOST_TEMPLATE_ARGS (spec_args
),
20362 INNERMOST_TEMPLATE_ARGS (args
)))
20365 /* Now that we have bindings for all of the template arguments,
20366 ensure that the arguments deduced for the template template
20367 parameters have compatible template parameter lists. See the use
20368 of template_template_parm_bindings_ok_p in fn_type_unification
20369 for more information. */
20370 if (!template_template_parm_bindings_ok_p (tparms
, deduced_args
))
20373 return deduced_args
;
20376 // Compare two function templates T1 and T2 by deducing bindings
20377 // from one against the other. If both deductions succeed, compare
20378 // constraints to see which is more constrained.
20380 more_specialized_inst (tree t1
, tree t2
)
20385 if (get_bindings (t1
, DECL_TEMPLATE_RESULT (t2
), NULL_TREE
, true))
20391 if (get_bindings (t2
, DECL_TEMPLATE_RESULT (t1
), NULL_TREE
, true))
20397 // If both deductions succeed, then one may be more constrained.
20398 if (count
== 2 && fate
== 0)
20399 fate
= more_constrained (t1
, t2
);
20404 /* TEMPLATES is a TREE_LIST. Each TREE_VALUE is a TEMPLATE_DECL.
20405 Return the TREE_LIST node with the most specialized template, if
20406 any. If there is no most specialized template, the error_mark_node
20409 Note that this function does not look at, or modify, the
20410 TREE_PURPOSE or TREE_TYPE of any of the nodes. Since the node
20411 returned is one of the elements of INSTANTIATIONS, callers may
20412 store information in the TREE_PURPOSE or TREE_TYPE of the nodes,
20413 and retrieve it from the value returned. */
20416 most_specialized_instantiation (tree templates
)
20420 ++processing_template_decl
;
20423 for (fn
= TREE_CHAIN (templates
); fn
; fn
= TREE_CHAIN (fn
))
20425 int fate
= more_specialized_inst (TREE_VALUE (champ
), TREE_VALUE (fn
));
20430 /* Equally specialized, move to next function. If there
20431 is no next function, nothing's most specialized. */
20432 fn
= TREE_CHAIN (fn
);
20440 /* Now verify that champ is better than everything earlier in the
20441 instantiation list. */
20442 for (fn
= templates
; fn
!= champ
; fn
= TREE_CHAIN (fn
)) {
20443 if (more_specialized_inst (TREE_VALUE (champ
), TREE_VALUE (fn
)) != 1)
20450 processing_template_decl
--;
20453 return error_mark_node
;
20458 /* If DECL is a specialization of some template, return the most
20459 general such template. Otherwise, returns NULL_TREE.
20461 For example, given:
20463 template <class T> struct S { template <class U> void f(U); };
20465 if TMPL is `template <class U> void S<int>::f(U)' this will return
20466 the full template. This function will not trace past partial
20467 specializations, however. For example, given in addition:
20469 template <class T> struct S<T*> { template <class U> void f(U); };
20471 if TMPL is `template <class U> void S<int*>::f(U)' this will return
20472 `template <class T> template <class U> S<T*>::f(U)'. */
20475 most_general_template (tree decl
)
20477 if (TREE_CODE (decl
) != TEMPLATE_DECL
)
20479 if (tree tinfo
= get_template_info (decl
))
20480 decl
= TI_TEMPLATE (tinfo
);
20481 /* The TI_TEMPLATE can be an IDENTIFIER_NODE for a
20482 template friend, or a FIELD_DECL for a capture pack. */
20483 if (TREE_CODE (decl
) != TEMPLATE_DECL
)
20487 /* Look for more and more general templates. */
20488 while (DECL_LANG_SPECIFIC (decl
) && DECL_TEMPLATE_INFO (decl
))
20490 /* The DECL_TI_TEMPLATE can be an IDENTIFIER_NODE in some cases.
20491 (See cp-tree.h for details.) */
20492 if (TREE_CODE (DECL_TI_TEMPLATE (decl
)) != TEMPLATE_DECL
)
20495 if (CLASS_TYPE_P (TREE_TYPE (decl
))
20496 && !TYPE_DECL_ALIAS_P (TYPE_NAME (TREE_TYPE (decl
)))
20497 && CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_TYPE (decl
)))
20500 /* Stop if we run into an explicitly specialized class template. */
20501 if (!DECL_NAMESPACE_SCOPE_P (decl
)
20502 && DECL_CONTEXT (decl
)
20503 && CLASSTYPE_TEMPLATE_SPECIALIZATION (DECL_CONTEXT (decl
)))
20506 decl
= DECL_TI_TEMPLATE (decl
);
20512 /* Return the most specialized of the template partial specializations
20513 which can produce TARGET, a specialization of some class or variable
20514 template. The value returned is actually a TREE_LIST; the TREE_VALUE is
20515 a TEMPLATE_DECL node corresponding to the partial specialization, while
20516 the TREE_PURPOSE is the set of template arguments that must be
20517 substituted into the template pattern in order to generate TARGET.
20519 If the choice of partial specialization is ambiguous, a diagnostic
20520 is issued, and the error_mark_node is returned. If there are no
20521 partial specializations matching TARGET, then NULL_TREE is
20522 returned, indicating that the primary template should be used. */
20525 most_specialized_partial_spec (tree target
, tsubst_flags_t complain
)
20527 tree list
= NULL_TREE
;
20532 tree outer_args
= NULL_TREE
;
20535 if (TYPE_P (target
))
20537 tree tinfo
= CLASSTYPE_TEMPLATE_INFO (target
);
20538 tmpl
= TI_TEMPLATE (tinfo
);
20539 args
= TI_ARGS (tinfo
);
20541 else if (TREE_CODE (target
) == TEMPLATE_ID_EXPR
)
20543 tmpl
= TREE_OPERAND (target
, 0);
20544 args
= TREE_OPERAND (target
, 1);
20546 else if (VAR_P (target
))
20548 tree tinfo
= DECL_TEMPLATE_INFO (target
);
20549 tmpl
= TI_TEMPLATE (tinfo
);
20550 args
= TI_ARGS (tinfo
);
20553 gcc_unreachable ();
20555 tree main_tmpl
= most_general_template (tmpl
);
20557 /* For determining which partial specialization to use, only the
20558 innermost args are interesting. */
20559 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (args
))
20561 outer_args
= strip_innermost_template_args (args
, 1);
20562 args
= INNERMOST_TEMPLATE_ARGS (args
);
20565 for (t
= DECL_TEMPLATE_SPECIALIZATIONS (main_tmpl
); t
; t
= TREE_CHAIN (t
))
20567 tree partial_spec_args
;
20569 tree spec_tmpl
= TREE_VALUE (t
);
20571 partial_spec_args
= TREE_PURPOSE (t
);
20573 ++processing_template_decl
;
20577 /* Discard the outer levels of args, and then substitute in the
20578 template args from the enclosing class. */
20579 partial_spec_args
= INNERMOST_TEMPLATE_ARGS (partial_spec_args
);
20580 partial_spec_args
= tsubst_template_args
20581 (partial_spec_args
, outer_args
, tf_none
, NULL_TREE
);
20583 /* And the same for the partial specialization TEMPLATE_DECL. */
20584 spec_tmpl
= tsubst (spec_tmpl
, outer_args
, tf_none
, NULL_TREE
);
20587 partial_spec_args
=
20588 coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (tmpl
),
20591 /*require_all_args=*/true,
20592 /*use_default_args=*/true);
20594 --processing_template_decl
;
20596 if (partial_spec_args
== error_mark_node
)
20597 return error_mark_node
;
20598 if (spec_tmpl
== error_mark_node
)
20599 return error_mark_node
;
20601 tree parms
= DECL_INNERMOST_TEMPLATE_PARMS (spec_tmpl
);
20602 spec_args
= get_partial_spec_bindings (tmpl
, parms
,
20608 spec_args
= add_to_template_args (outer_args
, spec_args
);
20610 /* Keep the candidate only if the constraints are satisfied,
20611 or if we're not compiling with concepts. */
20613 || constraints_satisfied_p (spec_tmpl
, spec_args
))
20615 list
= tree_cons (spec_args
, TREE_VALUE (t
), list
);
20616 TREE_TYPE (list
) = TREE_TYPE (t
);
20624 ambiguous_p
= false;
20627 t
= TREE_CHAIN (t
);
20628 for (; t
; t
= TREE_CHAIN (t
))
20630 fate
= more_specialized_partial_spec (tmpl
, champ
, t
);
20637 t
= TREE_CHAIN (t
);
20640 ambiguous_p
= true;
20649 for (t
= list
; t
&& t
!= champ
; t
= TREE_CHAIN (t
))
20651 fate
= more_specialized_partial_spec (tmpl
, champ
, t
);
20654 ambiguous_p
= true;
20662 char *spaces
= NULL
;
20663 if (!(complain
& tf_error
))
20664 return error_mark_node
;
20665 if (TYPE_P (target
))
20666 error ("ambiguous template instantiation for %q#T", target
);
20668 error ("ambiguous template instantiation for %q#D", target
);
20669 str
= ngettext ("candidate is:", "candidates are:", list_length (list
));
20670 for (t
= list
; t
; t
= TREE_CHAIN (t
))
20672 tree subst
= build_tree_list (TREE_VALUE (t
), TREE_PURPOSE (t
));
20673 inform (DECL_SOURCE_LOCATION (TREE_VALUE (t
)),
20674 "%s %#S", spaces
? spaces
: str
, subst
);
20675 spaces
= spaces
? spaces
: get_spaces (str
);
20678 return error_mark_node
;
20684 /* Explicitly instantiate DECL. */
20687 do_decl_instantiation (tree decl
, tree storage
)
20689 tree result
= NULL_TREE
;
20692 if (!decl
|| decl
== error_mark_node
)
20693 /* An error occurred, for which grokdeclarator has already issued
20694 an appropriate message. */
20696 else if (! DECL_LANG_SPECIFIC (decl
))
20698 error ("explicit instantiation of non-template %q#D", decl
);
20702 bool var_templ
= (DECL_TEMPLATE_INFO (decl
)
20703 && variable_template_p (DECL_TI_TEMPLATE (decl
)));
20705 if (VAR_P (decl
) && !var_templ
)
20707 /* There is an asymmetry here in the way VAR_DECLs and
20708 FUNCTION_DECLs are handled by grokdeclarator. In the case of
20709 the latter, the DECL we get back will be marked as a
20710 template instantiation, and the appropriate
20711 DECL_TEMPLATE_INFO will be set up. This does not happen for
20712 VAR_DECLs so we do the lookup here. Probably, grokdeclarator
20713 should handle VAR_DECLs as it currently handles
20715 if (!DECL_CLASS_SCOPE_P (decl
))
20717 error ("%qD is not a static data member of a class template", decl
);
20720 result
= lookup_field (DECL_CONTEXT (decl
), DECL_NAME (decl
), 0, false);
20721 if (!result
|| !VAR_P (result
))
20723 error ("no matching template for %qD found", decl
);
20726 if (!same_type_p (TREE_TYPE (result
), TREE_TYPE (decl
)))
20728 error ("type %qT for explicit instantiation %qD does not match "
20729 "declared type %qT", TREE_TYPE (result
), decl
,
20734 else if (TREE_CODE (decl
) != FUNCTION_DECL
&& !var_templ
)
20736 error ("explicit instantiation of %q#D", decl
);
20742 /* Check for various error cases. Note that if the explicit
20743 instantiation is valid the RESULT will currently be marked as an
20744 *implicit* instantiation; DECL_EXPLICIT_INSTANTIATION is not set
20745 until we get here. */
20747 if (DECL_TEMPLATE_SPECIALIZATION (result
))
20749 /* DR 259 [temp.spec].
20751 Both an explicit instantiation and a declaration of an explicit
20752 specialization shall not appear in a program unless the explicit
20753 instantiation follows a declaration of the explicit specialization.
20755 For a given set of template parameters, if an explicit
20756 instantiation of a template appears after a declaration of an
20757 explicit specialization for that template, the explicit
20758 instantiation has no effect. */
20761 else if (DECL_EXPLICIT_INSTANTIATION (result
))
20765 No program shall explicitly instantiate any template more
20768 We check DECL_NOT_REALLY_EXTERN so as not to complain when
20769 the first instantiation was `extern' and the second is not,
20770 and EXTERN_P for the opposite case. */
20771 if (DECL_NOT_REALLY_EXTERN (result
) && !extern_p
)
20772 permerror (input_location
, "duplicate explicit instantiation of %q#D", result
);
20773 /* If an "extern" explicit instantiation follows an ordinary
20774 explicit instantiation, the template is instantiated. */
20778 else if (!DECL_IMPLICIT_INSTANTIATION (result
))
20780 error ("no matching template for %qD found", result
);
20783 else if (!DECL_TEMPLATE_INFO (result
))
20785 permerror (input_location
, "explicit instantiation of non-template %q#D", result
);
20789 if (storage
== NULL_TREE
)
20791 else if (storage
== ridpointers
[(int) RID_EXTERN
])
20793 if (!in_system_header_at (input_location
) && (cxx_dialect
== cxx98
))
20794 pedwarn (input_location
, OPT_Wpedantic
,
20795 "ISO C++ 1998 forbids the use of %<extern%> on explicit "
20800 error ("storage class %qD applied to template instantiation", storage
);
20802 check_explicit_instantiation_namespace (result
);
20803 mark_decl_instantiated (result
, extern_p
);
20805 instantiate_decl (result
, /*defer_ok=*/1,
20806 /*expl_inst_class_mem_p=*/false);
20810 mark_class_instantiated (tree t
, int extern_p
)
20812 SET_CLASSTYPE_EXPLICIT_INSTANTIATION (t
);
20813 SET_CLASSTYPE_INTERFACE_KNOWN (t
);
20814 CLASSTYPE_INTERFACE_ONLY (t
) = extern_p
;
20815 TYPE_DECL_SUPPRESS_DEBUG (TYPE_NAME (t
)) = extern_p
;
20818 CLASSTYPE_DEBUG_REQUESTED (t
) = 1;
20819 rest_of_type_compilation (t
, 1);
20823 /* Called from do_type_instantiation through binding_table_foreach to
20824 do recursive instantiation for the type bound in ENTRY. */
20826 bt_instantiate_type_proc (binding_entry entry
, void *data
)
20828 tree storage
= *(tree
*) data
;
20830 if (MAYBE_CLASS_TYPE_P (entry
->type
)
20831 && !uses_template_parms (CLASSTYPE_TI_ARGS (entry
->type
)))
20832 do_type_instantiation (TYPE_MAIN_DECL (entry
->type
), storage
, 0);
20835 /* Called from do_type_instantiation to instantiate a member
20836 (a member function or a static member variable) of an
20837 explicitly instantiated class template. */
20839 instantiate_class_member (tree decl
, int extern_p
)
20841 mark_decl_instantiated (decl
, extern_p
);
20843 instantiate_decl (decl
, /*defer_ok=*/1,
20844 /*expl_inst_class_mem_p=*/true);
20847 /* Perform an explicit instantiation of template class T. STORAGE, if
20848 non-null, is the RID for extern, inline or static. COMPLAIN is
20849 nonzero if this is called from the parser, zero if called recursively,
20850 since the standard is unclear (as detailed below). */
20853 do_type_instantiation (tree t
, tree storage
, tsubst_flags_t complain
)
20858 int previous_instantiation_extern_p
= 0;
20860 if (TREE_CODE (t
) == TYPE_DECL
)
20863 if (! CLASS_TYPE_P (t
) || ! CLASSTYPE_TEMPLATE_INFO (t
))
20866 (TYPE_TEMPLATE_INFO (t
)) ? TYPE_TI_TEMPLATE (t
) : NULL
;
20868 error ("explicit instantiation of non-class template %qD", tmpl
);
20870 error ("explicit instantiation of non-template type %qT", t
);
20876 if (!COMPLETE_TYPE_P (t
))
20878 if (complain
& tf_error
)
20879 error ("explicit instantiation of %q#T before definition of template",
20884 if (storage
!= NULL_TREE
)
20886 if (!in_system_header_at (input_location
))
20888 if (storage
== ridpointers
[(int) RID_EXTERN
])
20890 if (cxx_dialect
== cxx98
)
20891 pedwarn (input_location
, OPT_Wpedantic
,
20892 "ISO C++ 1998 forbids the use of %<extern%> on "
20893 "explicit instantiations");
20896 pedwarn (input_location
, OPT_Wpedantic
,
20897 "ISO C++ forbids the use of %qE"
20898 " on explicit instantiations", storage
);
20901 if (storage
== ridpointers
[(int) RID_INLINE
])
20903 else if (storage
== ridpointers
[(int) RID_EXTERN
])
20905 else if (storage
== ridpointers
[(int) RID_STATIC
])
20909 error ("storage class %qD applied to template instantiation",
20915 if (CLASSTYPE_TEMPLATE_SPECIALIZATION (t
))
20917 /* DR 259 [temp.spec].
20919 Both an explicit instantiation and a declaration of an explicit
20920 specialization shall not appear in a program unless the explicit
20921 instantiation follows a declaration of the explicit specialization.
20923 For a given set of template parameters, if an explicit
20924 instantiation of a template appears after a declaration of an
20925 explicit specialization for that template, the explicit
20926 instantiation has no effect. */
20929 else if (CLASSTYPE_EXPLICIT_INSTANTIATION (t
))
20933 No program shall explicitly instantiate any template more
20936 If PREVIOUS_INSTANTIATION_EXTERN_P, then the first explicit
20937 instantiation was `extern'. If EXTERN_P then the second is.
20938 These cases are OK. */
20939 previous_instantiation_extern_p
= CLASSTYPE_INTERFACE_ONLY (t
);
20941 if (!previous_instantiation_extern_p
&& !extern_p
20942 && (complain
& tf_error
))
20943 permerror (input_location
, "duplicate explicit instantiation of %q#T", t
);
20945 /* If we've already instantiated the template, just return now. */
20946 if (!CLASSTYPE_INTERFACE_ONLY (t
))
20950 check_explicit_instantiation_namespace (TYPE_NAME (t
));
20951 mark_class_instantiated (t
, extern_p
);
20959 /* In contrast to implicit instantiation, where only the
20960 declarations, and not the definitions, of members are
20961 instantiated, we have here:
20965 The explicit instantiation of a class template specialization
20966 implies the instantiation of all of its members not
20967 previously explicitly specialized in the translation unit
20968 containing the explicit instantiation.
20970 Of course, we can't instantiate member template classes, since
20971 we don't have any arguments for them. Note that the standard
20972 is unclear on whether the instantiation of the members are
20973 *explicit* instantiations or not. However, the most natural
20974 interpretation is that it should be an explicit instantiation. */
20977 for (tmp
= TYPE_METHODS (t
); tmp
; tmp
= DECL_CHAIN (tmp
))
20978 if (TREE_CODE (tmp
) == FUNCTION_DECL
20979 && DECL_TEMPLATE_INSTANTIATION (tmp
))
20980 instantiate_class_member (tmp
, extern_p
);
20982 for (tmp
= TYPE_FIELDS (t
); tmp
; tmp
= DECL_CHAIN (tmp
))
20983 if (VAR_P (tmp
) && DECL_TEMPLATE_INSTANTIATION (tmp
))
20984 instantiate_class_member (tmp
, extern_p
);
20986 if (CLASSTYPE_NESTED_UTDS (t
))
20987 binding_table_foreach (CLASSTYPE_NESTED_UTDS (t
),
20988 bt_instantiate_type_proc
, &storage
);
20992 /* Given a function DECL, which is a specialization of TMPL, modify
20993 DECL to be a re-instantiation of TMPL with the same template
20994 arguments. TMPL should be the template into which tsubst'ing
20995 should occur for DECL, not the most general template.
20997 One reason for doing this is a scenario like this:
21000 void f(const T&, int i);
21002 void g() { f(3, 7); }
21005 void f(const T& t, const int i) { }
21007 Note that when the template is first instantiated, with
21008 instantiate_template, the resulting DECL will have no name for the
21009 first parameter, and the wrong type for the second. So, when we go
21010 to instantiate the DECL, we regenerate it. */
21013 regenerate_decl_from_template (tree decl
, tree tmpl
)
21015 /* The arguments used to instantiate DECL, from the most general
21020 args
= DECL_TI_ARGS (decl
);
21021 code_pattern
= DECL_TEMPLATE_RESULT (tmpl
);
21023 /* Make sure that we can see identifiers, and compute access
21025 push_access_scope (decl
);
21027 if (TREE_CODE (decl
) == FUNCTION_DECL
)
21035 args_depth
= TMPL_ARGS_DEPTH (args
);
21036 parms_depth
= TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl
));
21037 if (args_depth
> parms_depth
)
21038 args
= get_innermost_template_args (args
, parms_depth
);
21040 specs
= tsubst_exception_specification (TREE_TYPE (code_pattern
),
21041 args
, tf_error
, NULL_TREE
,
21042 /*defer_ok*/false);
21043 if (specs
&& specs
!= error_mark_node
)
21044 TREE_TYPE (decl
) = build_exception_variant (TREE_TYPE (decl
),
21047 /* Merge parameter declarations. */
21048 decl_parm
= skip_artificial_parms_for (decl
,
21049 DECL_ARGUMENTS (decl
));
21051 = skip_artificial_parms_for (code_pattern
,
21052 DECL_ARGUMENTS (code_pattern
));
21053 while (decl_parm
&& !DECL_PACK_P (pattern_parm
))
21058 if (DECL_NAME (decl_parm
) != DECL_NAME (pattern_parm
))
21059 DECL_NAME (decl_parm
) = DECL_NAME (pattern_parm
);
21060 parm_type
= tsubst (TREE_TYPE (pattern_parm
), args
, tf_error
,
21062 parm_type
= type_decays_to (parm_type
);
21063 if (!same_type_p (TREE_TYPE (decl_parm
), parm_type
))
21064 TREE_TYPE (decl_parm
) = parm_type
;
21065 attributes
= DECL_ATTRIBUTES (pattern_parm
);
21066 if (DECL_ATTRIBUTES (decl_parm
) != attributes
)
21068 DECL_ATTRIBUTES (decl_parm
) = attributes
;
21069 cplus_decl_attributes (&decl_parm
, attributes
, /*flags=*/0);
21071 decl_parm
= DECL_CHAIN (decl_parm
);
21072 pattern_parm
= DECL_CHAIN (pattern_parm
);
21074 /* Merge any parameters that match with the function parameter
21076 if (pattern_parm
&& DECL_PACK_P (pattern_parm
))
21079 tree expanded_types
;
21080 /* Expand the TYPE_PACK_EXPANSION that provides the types for
21081 the parameters in this function parameter pack. */
21082 expanded_types
= tsubst_pack_expansion (TREE_TYPE (pattern_parm
),
21083 args
, tf_error
, NULL_TREE
);
21084 len
= TREE_VEC_LENGTH (expanded_types
);
21085 for (i
= 0; i
< len
; i
++)
21090 if (DECL_NAME (decl_parm
) != DECL_NAME (pattern_parm
))
21091 /* Rename the parameter to include the index. */
21092 DECL_NAME (decl_parm
) =
21093 make_ith_pack_parameter_name (DECL_NAME (pattern_parm
), i
);
21094 parm_type
= TREE_VEC_ELT (expanded_types
, i
);
21095 parm_type
= type_decays_to (parm_type
);
21096 if (!same_type_p (TREE_TYPE (decl_parm
), parm_type
))
21097 TREE_TYPE (decl_parm
) = parm_type
;
21098 attributes
= DECL_ATTRIBUTES (pattern_parm
);
21099 if (DECL_ATTRIBUTES (decl_parm
) != attributes
)
21101 DECL_ATTRIBUTES (decl_parm
) = attributes
;
21102 cplus_decl_attributes (&decl_parm
, attributes
, /*flags=*/0);
21104 decl_parm
= DECL_CHAIN (decl_parm
);
21107 /* Merge additional specifiers from the CODE_PATTERN. */
21108 if (DECL_DECLARED_INLINE_P (code_pattern
)
21109 && !DECL_DECLARED_INLINE_P (decl
))
21110 DECL_DECLARED_INLINE_P (decl
) = 1;
21112 else if (VAR_P (decl
))
21114 DECL_INITIAL (decl
) =
21115 tsubst_expr (DECL_INITIAL (code_pattern
), args
,
21116 tf_error
, DECL_TI_TEMPLATE (decl
),
21117 /*integral_constant_expression_p=*/false);
21118 if (VAR_HAD_UNKNOWN_BOUND (decl
))
21119 TREE_TYPE (decl
) = tsubst (TREE_TYPE (code_pattern
), args
,
21120 tf_error
, DECL_TI_TEMPLATE (decl
));
21123 gcc_unreachable ();
21125 pop_access_scope (decl
);
21128 /* Return the TEMPLATE_DECL into which DECL_TI_ARGS(DECL) should be
21129 substituted to get DECL. */
21132 template_for_substitution (tree decl
)
21134 tree tmpl
= DECL_TI_TEMPLATE (decl
);
21136 /* Set TMPL to the template whose DECL_TEMPLATE_RESULT is the pattern
21137 for the instantiation. This is not always the most general
21138 template. Consider, for example:
21141 struct S { template <class U> void f();
21142 template <> void f<int>(); };
21144 and an instantiation of S<double>::f<int>. We want TD to be the
21145 specialization S<T>::f<int>, not the more general S<T>::f<U>. */
21146 while (/* An instantiation cannot have a definition, so we need a
21147 more general template. */
21148 DECL_TEMPLATE_INSTANTIATION (tmpl
)
21149 /* We must also deal with friend templates. Given:
21151 template <class T> struct S {
21152 template <class U> friend void f() {};
21155 S<int>::f<U> say, is not an instantiation of S<T>::f<U>,
21156 so far as the language is concerned, but that's still
21157 where we get the pattern for the instantiation from. On
21158 other hand, if the definition comes outside the class, say:
21160 template <class T> struct S {
21161 template <class U> friend void f();
21163 template <class U> friend void f() {}
21165 we don't need to look any further. That's what the check for
21166 DECL_INITIAL is for. */
21167 || (TREE_CODE (decl
) == FUNCTION_DECL
21168 && DECL_FRIEND_PSEUDO_TEMPLATE_INSTANTIATION (tmpl
)
21169 && !DECL_INITIAL (DECL_TEMPLATE_RESULT (tmpl
))))
21171 /* The present template, TD, should not be a definition. If it
21172 were a definition, we should be using it! Note that we
21173 cannot restructure the loop to just keep going until we find
21174 a template with a definition, since that might go too far if
21175 a specialization was declared, but not defined. */
21177 /* Fetch the more general template. */
21178 tmpl
= DECL_TI_TEMPLATE (tmpl
);
21184 /* Returns true if we need to instantiate this template instance even if we
21185 know we aren't going to emit it. */
21188 always_instantiate_p (tree decl
)
21190 /* We always instantiate inline functions so that we can inline them. An
21191 explicit instantiation declaration prohibits implicit instantiation of
21192 non-inline functions. With high levels of optimization, we would
21193 normally inline non-inline functions -- but we're not allowed to do
21194 that for "extern template" functions. Therefore, we check
21195 DECL_DECLARED_INLINE_P, rather than possibly_inlined_p. */
21196 return ((TREE_CODE (decl
) == FUNCTION_DECL
21197 && (DECL_DECLARED_INLINE_P (decl
)
21198 || type_uses_auto (TREE_TYPE (TREE_TYPE (decl
)))))
21199 /* And we need to instantiate static data members so that
21200 their initializers are available in integral constant
21203 && decl_maybe_constant_var_p (decl
)));
21206 /* If FN has a noexcept-specifier that hasn't been instantiated yet,
21207 instantiate it now, modifying TREE_TYPE (fn). */
21210 maybe_instantiate_noexcept (tree fn
)
21212 tree fntype
, spec
, noex
, clone
;
21214 /* Don't instantiate a noexcept-specification from template context. */
21215 if (processing_template_decl
)
21218 if (DECL_CLONED_FUNCTION_P (fn
))
21219 fn
= DECL_CLONED_FUNCTION (fn
);
21220 fntype
= TREE_TYPE (fn
);
21221 spec
= TYPE_RAISES_EXCEPTIONS (fntype
);
21223 if (!spec
|| !TREE_PURPOSE (spec
))
21226 noex
= TREE_PURPOSE (spec
);
21228 if (TREE_CODE (noex
) == DEFERRED_NOEXCEPT
)
21230 if (DEFERRED_NOEXCEPT_PATTERN (noex
) == NULL_TREE
)
21231 spec
= get_defaulted_eh_spec (fn
);
21232 else if (push_tinst_level (fn
))
21234 push_access_scope (fn
);
21235 push_deferring_access_checks (dk_no_deferred
);
21236 input_location
= DECL_SOURCE_LOCATION (fn
);
21237 noex
= tsubst_copy_and_build (DEFERRED_NOEXCEPT_PATTERN (noex
),
21238 DEFERRED_NOEXCEPT_ARGS (noex
),
21239 tf_warning_or_error
, fn
,
21240 /*function_p=*/false,
21241 /*integral_constant_expression_p=*/true);
21242 pop_deferring_access_checks ();
21243 pop_access_scope (fn
);
21244 pop_tinst_level ();
21245 spec
= build_noexcept_spec (noex
, tf_warning_or_error
);
21246 if (spec
== error_mark_node
)
21247 spec
= noexcept_false_spec
;
21250 spec
= noexcept_false_spec
;
21252 TREE_TYPE (fn
) = build_exception_variant (fntype
, spec
);
21255 FOR_EACH_CLONE (clone
, fn
)
21257 if (TREE_TYPE (clone
) == fntype
)
21258 TREE_TYPE (clone
) = TREE_TYPE (fn
);
21260 TREE_TYPE (clone
) = build_exception_variant (TREE_TYPE (clone
), spec
);
21264 /* Produce the definition of D, a _DECL generated from a template. If
21265 DEFER_OK is nonzero, then we don't have to actually do the
21266 instantiation now; we just have to do it sometime. Normally it is
21267 an error if this is an explicit instantiation but D is undefined.
21268 EXPL_INST_CLASS_MEM_P is true iff D is a member of an
21269 explicitly instantiated class template. */
21272 instantiate_decl (tree d
, int defer_ok
,
21273 bool expl_inst_class_mem_p
)
21275 tree tmpl
= DECL_TI_TEMPLATE (d
);
21282 bool pattern_defined
;
21283 location_t saved_loc
= input_location
;
21284 int saved_unevaluated_operand
= cp_unevaluated_operand
;
21285 int saved_inhibit_evaluation_warnings
= c_inhibit_evaluation_warnings
;
21289 bool nested
= false;
21291 /* This function should only be used to instantiate templates for
21292 functions and static member variables. */
21293 gcc_assert (VAR_OR_FUNCTION_DECL_P (d
));
21295 /* A concept is never instantiated. */
21296 gcc_assert (!DECL_DECLARED_CONCEPT_P (d
));
21298 /* Variables are never deferred; if instantiation is required, they
21299 are instantiated right away. That allows for better code in the
21300 case that an expression refers to the value of the variable --
21301 if the variable has a constant value the referring expression can
21302 take advantage of that fact. */
21304 || DECL_DECLARED_CONSTEXPR_P (d
))
21307 /* Don't instantiate cloned functions. Instead, instantiate the
21308 functions they cloned. */
21309 if (TREE_CODE (d
) == FUNCTION_DECL
&& DECL_CLONED_FUNCTION_P (d
))
21310 d
= DECL_CLONED_FUNCTION (d
);
21312 if (DECL_TEMPLATE_INSTANTIATED (d
)
21313 || (TREE_CODE (d
) == FUNCTION_DECL
21314 && DECL_DEFAULTED_FN (d
) && DECL_INITIAL (d
))
21315 || DECL_TEMPLATE_SPECIALIZATION (d
))
21316 /* D has already been instantiated or explicitly specialized, so
21317 there's nothing for us to do here.
21319 It might seem reasonable to check whether or not D is an explicit
21320 instantiation, and, if so, stop here. But when an explicit
21321 instantiation is deferred until the end of the compilation,
21322 DECL_EXPLICIT_INSTANTIATION is set, even though we still need to do
21323 the instantiation. */
21326 /* Check to see whether we know that this template will be
21327 instantiated in some other file, as with "extern template"
21329 external_p
= (DECL_INTERFACE_KNOWN (d
) && DECL_REALLY_EXTERN (d
));
21331 /* In general, we do not instantiate such templates. */
21332 if (external_p
&& !always_instantiate_p (d
))
21335 gen_tmpl
= most_general_template (tmpl
);
21336 gen_args
= DECL_TI_ARGS (d
);
21338 if (tmpl
!= gen_tmpl
)
21339 /* We should already have the extra args. */
21340 gcc_assert (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (gen_tmpl
))
21341 == TMPL_ARGS_DEPTH (gen_args
));
21342 /* And what's in the hash table should match D. */
21343 gcc_assert ((spec
= retrieve_specialization (gen_tmpl
, gen_args
, 0)) == d
21344 || spec
== NULL_TREE
);
21346 /* This needs to happen before any tsubsting. */
21347 if (! push_tinst_level (d
))
21350 timevar_push (TV_TEMPLATE_INST
);
21352 /* Set TD to the template whose DECL_TEMPLATE_RESULT is the pattern
21353 for the instantiation. */
21354 td
= template_for_substitution (d
);
21355 code_pattern
= DECL_TEMPLATE_RESULT (td
);
21357 /* We should never be trying to instantiate a member of a class
21358 template or partial specialization. */
21359 gcc_assert (d
!= code_pattern
);
21361 if ((DECL_NAMESPACE_SCOPE_P (d
) && !DECL_INITIALIZED_IN_CLASS_P (d
))
21362 || DECL_TEMPLATE_SPECIALIZATION (td
))
21363 /* In the case of a friend template whose definition is provided
21364 outside the class, we may have too many arguments. Drop the
21365 ones we don't need. The same is true for specializations. */
21366 args
= get_innermost_template_args
21367 (gen_args
, TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (td
)));
21371 if (TREE_CODE (d
) == FUNCTION_DECL
)
21373 deleted_p
= DECL_DELETED_FN (code_pattern
);
21374 pattern_defined
= (DECL_SAVED_TREE (code_pattern
) != NULL_TREE
21375 || DECL_DEFAULTED_OUTSIDE_CLASS_P (code_pattern
)
21381 pattern_defined
= ! DECL_IN_AGGR_P (code_pattern
);
21384 /* We may be in the middle of deferred access check. Disable it now. */
21385 push_deferring_access_checks (dk_no_deferred
);
21387 /* Unless an explicit instantiation directive has already determined
21388 the linkage of D, remember that a definition is available for
21390 if (pattern_defined
21391 && !DECL_INTERFACE_KNOWN (d
)
21392 && !DECL_NOT_REALLY_EXTERN (d
))
21393 mark_definable (d
);
21395 DECL_SOURCE_LOCATION (td
) = DECL_SOURCE_LOCATION (code_pattern
);
21396 DECL_SOURCE_LOCATION (d
) = DECL_SOURCE_LOCATION (code_pattern
);
21397 input_location
= DECL_SOURCE_LOCATION (d
);
21399 /* If D is a member of an explicitly instantiated class template,
21400 and no definition is available, treat it like an implicit
21402 if (!pattern_defined
&& expl_inst_class_mem_p
21403 && DECL_EXPLICIT_INSTANTIATION (d
))
21405 /* Leave linkage flags alone on instantiations with anonymous
21407 if (TREE_PUBLIC (d
))
21409 DECL_NOT_REALLY_EXTERN (d
) = 0;
21410 DECL_INTERFACE_KNOWN (d
) = 0;
21412 SET_DECL_IMPLICIT_INSTANTIATION (d
);
21415 /* Defer all other templates, unless we have been explicitly
21416 forbidden from doing so. */
21417 if (/* If there is no definition, we cannot instantiate the
21420 /* If it's OK to postpone instantiation, do so. */
21422 /* If this is a static data member that will be defined
21423 elsewhere, we don't want to instantiate the entire data
21424 member, but we do want to instantiate the initializer so that
21425 we can substitute that elsewhere. */
21426 || (external_p
&& VAR_P (d
))
21427 /* Handle here a deleted function too, avoid generating
21428 its body (c++/61080). */
21431 /* The definition of the static data member is now required so
21432 we must substitute the initializer. */
21434 && !DECL_INITIAL (d
)
21435 && DECL_INITIAL (code_pattern
))
21439 bool const_init
= false;
21440 bool enter_context
= DECL_CLASS_SCOPE_P (d
);
21442 ns
= decl_namespace_context (d
);
21443 push_nested_namespace (ns
);
21445 push_nested_class (DECL_CONTEXT (d
));
21446 init
= tsubst_expr (DECL_INITIAL (code_pattern
),
21448 tf_warning_or_error
, NULL_TREE
,
21449 /*integral_constant_expression_p=*/false);
21450 /* If instantiating the initializer involved instantiating this
21451 again, don't call cp_finish_decl twice. */
21452 if (!DECL_INITIAL (d
))
21454 /* Make sure the initializer is still constant, in case of
21455 circular dependency (template/instantiate6.C). */
21457 = DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (code_pattern
);
21458 cp_finish_decl (d
, init
, /*init_const_expr_p=*/const_init
,
21459 /*asmspec_tree=*/NULL_TREE
,
21460 LOOKUP_ONLYCONVERTING
);
21463 pop_nested_class ();
21464 pop_nested_namespace (ns
);
21467 /* We restore the source position here because it's used by
21468 add_pending_template. */
21469 input_location
= saved_loc
;
21471 if (at_eof
&& !pattern_defined
21472 && DECL_EXPLICIT_INSTANTIATION (d
)
21473 && DECL_NOT_REALLY_EXTERN (d
))
21476 The definition of a non-exported function template, a
21477 non-exported member function template, or a non-exported
21478 member function or static data member of a class template
21479 shall be present in every translation unit in which it is
21480 explicitly instantiated. */
21481 permerror (input_location
, "explicit instantiation of %qD "
21482 "but no definition available", d
);
21484 /* If we're in unevaluated context, we just wanted to get the
21485 constant value; this isn't an odr use, so don't queue
21486 a full instantiation. */
21487 if (cp_unevaluated_operand
!= 0)
21489 /* ??? Historically, we have instantiated inline functions, even
21490 when marked as "extern template". */
21491 if (!(external_p
&& VAR_P (d
)))
21492 add_pending_template (d
);
21495 /* Tell the repository that D is available in this translation unit
21496 -- and see if it is supposed to be instantiated here. */
21497 if (TREE_PUBLIC (d
) && !DECL_REALLY_EXTERN (d
) && !repo_emit_p (d
))
21499 /* In a PCH file, despite the fact that the repository hasn't
21500 requested instantiation in the PCH it is still possible that
21501 an instantiation will be required in a file that includes the
21504 add_pending_template (d
);
21505 /* Instantiate inline functions so that the inliner can do its
21506 job, even though we'll not be emitting a copy of this
21508 if (!(TREE_CODE (d
) == FUNCTION_DECL
&& possibly_inlined_p (d
)))
21512 fn_context
= decl_function_context (d
);
21513 nested
= (current_function_decl
!= NULL_TREE
);
21514 vec
<tree
> omp_privatization_save
;
21516 save_omp_privatization_clauses (omp_privatization_save
);
21519 push_to_top_level ();
21523 push_function_context ();
21524 cp_unevaluated_operand
= 0;
21525 c_inhibit_evaluation_warnings
= 0;
21528 /* Mark D as instantiated so that recursive calls to
21529 instantiate_decl do not try to instantiate it again. */
21530 DECL_TEMPLATE_INSTANTIATED (d
) = 1;
21532 /* Regenerate the declaration in case the template has been modified
21533 by a subsequent redeclaration. */
21534 regenerate_decl_from_template (d
, td
);
21536 /* We already set the file and line above. Reset them now in case
21537 they changed as a result of calling regenerate_decl_from_template. */
21538 input_location
= DECL_SOURCE_LOCATION (d
);
21543 bool const_init
= false;
21545 /* Clear out DECL_RTL; whatever was there before may not be right
21546 since we've reset the type of the declaration. */
21547 SET_DECL_RTL (d
, NULL
);
21548 DECL_IN_AGGR_P (d
) = 0;
21550 /* The initializer is placed in DECL_INITIAL by
21551 regenerate_decl_from_template so we don't need to
21552 push/pop_access_scope again here. Pull it out so that
21553 cp_finish_decl can process it. */
21554 init
= DECL_INITIAL (d
);
21555 DECL_INITIAL (d
) = NULL_TREE
;
21556 DECL_INITIALIZED_P (d
) = 0;
21558 /* Clear DECL_EXTERNAL so that cp_finish_decl will process the
21559 initializer. That function will defer actual emission until
21560 we have a chance to determine linkage. */
21561 DECL_EXTERNAL (d
) = 0;
21563 /* Enter the scope of D so that access-checking works correctly. */
21564 bool enter_context
= DECL_CLASS_SCOPE_P (d
);
21566 push_nested_class (DECL_CONTEXT (d
));
21568 const_init
= DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (code_pattern
);
21569 cp_finish_decl (d
, init
, const_init
, NULL_TREE
, 0);
21572 pop_nested_class ();
21574 if (variable_template_p (td
))
21575 note_variable_template_instantiation (d
);
21577 else if (TREE_CODE (d
) == FUNCTION_DECL
&& DECL_DEFAULTED_FN (code_pattern
))
21578 synthesize_method (d
);
21579 else if (TREE_CODE (d
) == FUNCTION_DECL
)
21581 hash_map
<tree
, tree
> *saved_local_specializations
;
21585 tree block
= NULL_TREE
;
21587 /* Save away the current list, in case we are instantiating one
21588 template from within the body of another. */
21589 saved_local_specializations
= local_specializations
;
21591 /* Set up the list of local specializations. */
21592 local_specializations
= new hash_map
<tree
, tree
>;
21594 /* Set up context. */
21595 if (DECL_OMP_DECLARE_REDUCTION_P (code_pattern
)
21596 && TREE_CODE (DECL_CONTEXT (code_pattern
)) == FUNCTION_DECL
)
21597 block
= push_stmt_list ();
21599 start_preparsed_function (d
, NULL_TREE
, SF_PRE_PARSED
);
21601 /* Some typedefs referenced from within the template code need to be
21602 access checked at template instantiation time, i.e now. These
21603 types were added to the template at parsing time. Let's get those
21604 and perform the access checks then. */
21605 perform_typedefs_access_check (DECL_TEMPLATE_RESULT (gen_tmpl
),
21608 /* Create substitution entries for the parameters. */
21609 subst_decl
= DECL_TEMPLATE_RESULT (template_for_substitution (d
));
21610 tmpl_parm
= DECL_ARGUMENTS (subst_decl
);
21611 spec_parm
= DECL_ARGUMENTS (d
);
21612 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (d
))
21614 register_local_specialization (spec_parm
, tmpl_parm
);
21615 spec_parm
= skip_artificial_parms_for (d
, spec_parm
);
21616 tmpl_parm
= skip_artificial_parms_for (subst_decl
, tmpl_parm
);
21618 for (; tmpl_parm
; tmpl_parm
= DECL_CHAIN (tmpl_parm
))
21620 if (!DECL_PACK_P (tmpl_parm
))
21622 register_local_specialization (spec_parm
, tmpl_parm
);
21623 spec_parm
= DECL_CHAIN (spec_parm
);
21627 /* Register the (value) argument pack as a specialization of
21628 TMPL_PARM, then move on. */
21629 tree argpack
= extract_fnparm_pack (tmpl_parm
, &spec_parm
);
21630 register_local_specialization (argpack
, tmpl_parm
);
21633 gcc_assert (!spec_parm
);
21635 /* Substitute into the body of the function. */
21636 if (DECL_OMP_DECLARE_REDUCTION_P (code_pattern
))
21637 tsubst_omp_udr (DECL_SAVED_TREE (code_pattern
), args
,
21638 tf_warning_or_error
, tmpl
);
21641 tsubst_expr (DECL_SAVED_TREE (code_pattern
), args
,
21642 tf_warning_or_error
, tmpl
,
21643 /*integral_constant_expression_p=*/false);
21645 /* Set the current input_location to the end of the function
21646 so that finish_function knows where we are. */
21648 = DECL_STRUCT_FUNCTION (code_pattern
)->function_end_locus
;
21650 /* Remember if we saw an infinite loop in the template. */
21651 current_function_infinite_loop
21652 = DECL_STRUCT_FUNCTION (code_pattern
)->language
->infinite_loop
;
21655 /* We don't need the local specializations any more. */
21656 delete local_specializations
;
21657 local_specializations
= saved_local_specializations
;
21659 /* Finish the function. */
21660 if (DECL_OMP_DECLARE_REDUCTION_P (code_pattern
)
21661 && TREE_CODE (DECL_CONTEXT (code_pattern
)) == FUNCTION_DECL
)
21662 DECL_SAVED_TREE (d
) = pop_stmt_list (block
);
21665 d
= finish_function (0);
21666 expand_or_defer_fn (d
);
21669 if (DECL_OMP_DECLARE_REDUCTION_P (code_pattern
))
21670 cp_check_omp_declare_reduction (d
);
21673 /* We're not deferring instantiation any more. */
21674 TI_PENDING_TEMPLATE_FLAG (DECL_TEMPLATE_INFO (d
)) = 0;
21677 pop_from_top_level ();
21679 pop_function_context ();
21682 input_location
= saved_loc
;
21683 cp_unevaluated_operand
= saved_unevaluated_operand
;
21684 c_inhibit_evaluation_warnings
= saved_inhibit_evaluation_warnings
;
21685 pop_deferring_access_checks ();
21686 pop_tinst_level ();
21688 restore_omp_privatization_clauses (omp_privatization_save
);
21690 timevar_pop (TV_TEMPLATE_INST
);
21695 /* Run through the list of templates that we wish we could
21696 instantiate, and instantiate any we can. RETRIES is the
21697 number of times we retry pending template instantiation. */
21700 instantiate_pending_templates (int retries
)
21703 location_t saved_loc
= input_location
;
21705 /* Instantiating templates may trigger vtable generation. This in turn
21706 may require further template instantiations. We place a limit here
21707 to avoid infinite loop. */
21708 if (pending_templates
&& retries
>= max_tinst_depth
)
21710 tree decl
= pending_templates
->tinst
->decl
;
21712 fatal_error (input_location
,
21713 "template instantiation depth exceeds maximum of %d"
21714 " instantiating %q+D, possibly from virtual table generation"
21715 " (use -ftemplate-depth= to increase the maximum)",
21716 max_tinst_depth
, decl
);
21717 if (TREE_CODE (decl
) == FUNCTION_DECL
)
21718 /* Pretend that we defined it. */
21719 DECL_INITIAL (decl
) = error_mark_node
;
21725 struct pending_template
**t
= &pending_templates
;
21726 struct pending_template
*last
= NULL
;
21730 tree instantiation
= reopen_tinst_level ((*t
)->tinst
);
21731 bool complete
= false;
21733 if (TYPE_P (instantiation
))
21737 if (!COMPLETE_TYPE_P (instantiation
))
21739 instantiate_class_template (instantiation
);
21740 if (CLASSTYPE_TEMPLATE_INSTANTIATION (instantiation
))
21741 for (fn
= TYPE_METHODS (instantiation
);
21743 fn
= TREE_CHAIN (fn
))
21744 if (! DECL_ARTIFICIAL (fn
))
21745 instantiate_decl (fn
,
21747 /*expl_inst_class_mem_p=*/false);
21748 if (COMPLETE_TYPE_P (instantiation
))
21752 complete
= COMPLETE_TYPE_P (instantiation
);
21756 if (!DECL_TEMPLATE_SPECIALIZATION (instantiation
)
21757 && !DECL_TEMPLATE_INSTANTIATED (instantiation
))
21760 = instantiate_decl (instantiation
,
21762 /*expl_inst_class_mem_p=*/false);
21763 if (DECL_TEMPLATE_INSTANTIATED (instantiation
))
21767 complete
= (DECL_TEMPLATE_SPECIALIZATION (instantiation
)
21768 || DECL_TEMPLATE_INSTANTIATED (instantiation
));
21772 /* If INSTANTIATION has been instantiated, then we don't
21773 need to consider it again in the future. */
21781 current_tinst_level
= NULL
;
21783 last_pending_template
= last
;
21785 while (reconsider
);
21787 input_location
= saved_loc
;
21790 /* Substitute ARGVEC into T, which is a list of initializers for
21791 either base class or a non-static data member. The TREE_PURPOSEs
21792 are DECLs, and the TREE_VALUEs are the initializer values. Used by
21793 instantiate_decl. */
21796 tsubst_initializer_list (tree t
, tree argvec
)
21798 tree inits
= NULL_TREE
;
21800 for (; t
; t
= TREE_CHAIN (t
))
21804 tree expanded_bases
= NULL_TREE
;
21805 tree expanded_arguments
= NULL_TREE
;
21808 if (TREE_CODE (TREE_PURPOSE (t
)) == TYPE_PACK_EXPANSION
)
21813 /* Expand the base class expansion type into separate base
21815 expanded_bases
= tsubst_pack_expansion (TREE_PURPOSE (t
), argvec
,
21816 tf_warning_or_error
,
21818 if (expanded_bases
== error_mark_node
)
21821 /* We'll be building separate TREE_LISTs of arguments for
21823 len
= TREE_VEC_LENGTH (expanded_bases
);
21824 expanded_arguments
= make_tree_vec (len
);
21825 for (i
= 0; i
< len
; i
++)
21826 TREE_VEC_ELT (expanded_arguments
, i
) = NULL_TREE
;
21828 /* Build a dummy EXPR_PACK_EXPANSION that will be used to
21829 expand each argument in the TREE_VALUE of t. */
21830 expr
= make_node (EXPR_PACK_EXPANSION
);
21831 PACK_EXPANSION_LOCAL_P (expr
) = true;
21832 PACK_EXPANSION_PARAMETER_PACKS (expr
) =
21833 PACK_EXPANSION_PARAMETER_PACKS (TREE_PURPOSE (t
));
21835 if (TREE_VALUE (t
) == void_type_node
)
21836 /* VOID_TYPE_NODE is used to indicate
21837 value-initialization. */
21839 for (i
= 0; i
< len
; i
++)
21840 TREE_VEC_ELT (expanded_arguments
, i
) = void_type_node
;
21844 /* Substitute parameter packs into each argument in the
21846 in_base_initializer
= 1;
21847 for (arg
= TREE_VALUE (t
); arg
; arg
= TREE_CHAIN (arg
))
21849 tree expanded_exprs
;
21851 /* Expand the argument. */
21852 SET_PACK_EXPANSION_PATTERN (expr
, TREE_VALUE (arg
));
21854 = tsubst_pack_expansion (expr
, argvec
,
21855 tf_warning_or_error
,
21857 if (expanded_exprs
== error_mark_node
)
21860 /* Prepend each of the expanded expressions to the
21861 corresponding TREE_LIST in EXPANDED_ARGUMENTS. */
21862 for (i
= 0; i
< len
; i
++)
21864 TREE_VEC_ELT (expanded_arguments
, i
) =
21865 tree_cons (NULL_TREE
,
21866 TREE_VEC_ELT (expanded_exprs
, i
),
21867 TREE_VEC_ELT (expanded_arguments
, i
));
21870 in_base_initializer
= 0;
21872 /* Reverse all of the TREE_LISTs in EXPANDED_ARGUMENTS,
21873 since we built them backwards. */
21874 for (i
= 0; i
< len
; i
++)
21876 TREE_VEC_ELT (expanded_arguments
, i
) =
21877 nreverse (TREE_VEC_ELT (expanded_arguments
, i
));
21882 for (i
= 0; i
< len
; ++i
)
21884 if (expanded_bases
)
21886 decl
= TREE_VEC_ELT (expanded_bases
, i
);
21887 decl
= expand_member_init (decl
);
21888 init
= TREE_VEC_ELT (expanded_arguments
, i
);
21893 decl
= tsubst_copy (TREE_PURPOSE (t
), argvec
,
21894 tf_warning_or_error
, NULL_TREE
);
21896 decl
= expand_member_init (decl
);
21897 if (decl
&& !DECL_P (decl
))
21898 in_base_initializer
= 1;
21900 init
= TREE_VALUE (t
);
21902 if (init
!= void_type_node
)
21903 init
= tsubst_expr (init
, argvec
,
21904 tf_warning_or_error
, NULL_TREE
,
21905 /*integral_constant_expression_p=*/false);
21906 if (init
== NULL_TREE
&& tmp
!= NULL_TREE
)
21907 /* If we had an initializer but it instantiated to nothing,
21908 value-initialize the object. This will only occur when
21909 the initializer was a pack expansion where the parameter
21910 packs used in that expansion were of length zero. */
21911 init
= void_type_node
;
21912 in_base_initializer
= 0;
21917 init
= build_tree_list (decl
, init
);
21918 TREE_CHAIN (init
) = inits
;
21926 /* Set CURRENT_ACCESS_SPECIFIER based on the protection of DECL. */
21929 set_current_access_from_decl (tree decl
)
21931 if (TREE_PRIVATE (decl
))
21932 current_access_specifier
= access_private_node
;
21933 else if (TREE_PROTECTED (decl
))
21934 current_access_specifier
= access_protected_node
;
21936 current_access_specifier
= access_public_node
;
21939 /* Instantiate an enumerated type. TAG is the template type, NEWTAG
21940 is the instantiation (which should have been created with
21941 start_enum) and ARGS are the template arguments to use. */
21944 tsubst_enum (tree tag
, tree newtag
, tree args
)
21948 if (SCOPED_ENUM_P (newtag
))
21949 begin_scope (sk_scoped_enum
, newtag
);
21951 for (e
= TYPE_VALUES (tag
); e
; e
= TREE_CHAIN (e
))
21956 decl
= TREE_VALUE (e
);
21957 /* Note that in a template enum, the TREE_VALUE is the
21958 CONST_DECL, not the corresponding INTEGER_CST. */
21959 value
= tsubst_expr (DECL_INITIAL (decl
),
21960 args
, tf_warning_or_error
, NULL_TREE
,
21961 /*integral_constant_expression_p=*/true);
21963 /* Give this enumeration constant the correct access. */
21964 set_current_access_from_decl (decl
);
21966 /* Actually build the enumerator itself. Here we're assuming that
21967 enumerators can't have dependent attributes. */
21968 build_enumerator (DECL_NAME (decl
), value
, newtag
,
21969 DECL_ATTRIBUTES (decl
), DECL_SOURCE_LOCATION (decl
));
21972 if (SCOPED_ENUM_P (newtag
))
21975 finish_enum_value_list (newtag
);
21976 finish_enum (newtag
);
21978 DECL_SOURCE_LOCATION (TYPE_NAME (newtag
))
21979 = DECL_SOURCE_LOCATION (TYPE_NAME (tag
));
21982 /* DECL is a FUNCTION_DECL that is a template specialization. Return
21983 its type -- but without substituting the innermost set of template
21984 arguments. So, innermost set of template parameters will appear in
21988 get_mostly_instantiated_function_type (tree decl
)
21990 /* For a function, DECL_TI_TEMPLATE is partially instantiated. */
21991 return TREE_TYPE (DECL_TI_TEMPLATE (decl
));
21994 /* Return truthvalue if we're processing a template different from
21995 the last one involved in diagnostics. */
21997 problematic_instantiation_changed (void)
21999 return current_tinst_level
!= last_error_tinst_level
;
22002 /* Remember current template involved in diagnostics. */
22004 record_last_problematic_instantiation (void)
22006 last_error_tinst_level
= current_tinst_level
;
22009 struct tinst_level
*
22010 current_instantiation (void)
22012 return current_tinst_level
;
22015 /* Return TRUE if current_function_decl is being instantiated, false
22019 instantiating_current_function_p (void)
22021 return (current_instantiation ()
22022 && current_instantiation ()->decl
== current_function_decl
);
22025 /* [temp.param] Check that template non-type parm TYPE is of an allowable
22026 type. Return zero for ok, nonzero for disallowed. Issue error and
22027 warning messages under control of COMPLAIN. */
22030 invalid_nontype_parm_type_p (tree type
, tsubst_flags_t complain
)
22032 if (INTEGRAL_OR_ENUMERATION_TYPE_P (type
))
22034 else if (POINTER_TYPE_P (type
))
22036 else if (TYPE_PTRMEM_P (type
))
22038 else if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
)
22040 else if (TREE_CODE (type
) == TYPENAME_TYPE
)
22042 else if (TREE_CODE (type
) == DECLTYPE_TYPE
)
22044 else if (TREE_CODE (type
) == NULLPTR_TYPE
)
22046 /* A bound template template parm could later be instantiated to have a valid
22047 nontype parm type via an alias template. */
22048 else if (cxx_dialect
>= cxx11
22049 && TREE_CODE (type
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
22052 if (complain
& tf_error
)
22054 if (type
== error_mark_node
)
22055 inform (input_location
, "invalid template non-type parameter");
22057 error ("%q#T is not a valid type for a template non-type parameter",
22063 /* Returns TRUE if TYPE is dependent, in the sense of [temp.dep.type].
22064 Assumes that TYPE really is a type, and not the ERROR_MARK_NODE.*/
22067 dependent_type_p_r (tree type
)
22073 A type is dependent if it is:
22075 -- a template parameter. Template template parameters are types
22076 for us (since TYPE_P holds true for them) so we handle
22078 if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
22079 || TREE_CODE (type
) == TEMPLATE_TEMPLATE_PARM
)
22081 /* -- a qualified-id with a nested-name-specifier which contains a
22082 class-name that names a dependent type or whose unqualified-id
22083 names a dependent type. */
22084 if (TREE_CODE (type
) == TYPENAME_TYPE
)
22087 /* An alias template specialization can be dependent even if the
22088 resulting type is not. */
22089 if (dependent_alias_template_spec_p (type
))
22092 /* -- a cv-qualified type where the cv-unqualified type is
22094 No code is necessary for this bullet; the code below handles
22095 cv-qualified types, and we don't want to strip aliases with
22096 TYPE_MAIN_VARIANT because of DR 1558. */
22097 /* -- a compound type constructed from any dependent type. */
22098 if (TYPE_PTRMEM_P (type
))
22099 return (dependent_type_p (TYPE_PTRMEM_CLASS_TYPE (type
))
22100 || dependent_type_p (TYPE_PTRMEM_POINTED_TO_TYPE
22102 else if (TYPE_PTR_P (type
)
22103 || TREE_CODE (type
) == REFERENCE_TYPE
)
22104 return dependent_type_p (TREE_TYPE (type
));
22105 else if (TREE_CODE (type
) == FUNCTION_TYPE
22106 || TREE_CODE (type
) == METHOD_TYPE
)
22110 if (dependent_type_p (TREE_TYPE (type
)))
22112 for (arg_type
= TYPE_ARG_TYPES (type
);
22114 arg_type
= TREE_CHAIN (arg_type
))
22115 if (dependent_type_p (TREE_VALUE (arg_type
)))
22119 /* -- an array type constructed from any dependent type or whose
22120 size is specified by a constant expression that is
22123 We checked for type- and value-dependence of the bounds in
22124 compute_array_index_type, so TYPE_DEPENDENT_P is already set. */
22125 if (TREE_CODE (type
) == ARRAY_TYPE
)
22127 if (TYPE_DOMAIN (type
)
22128 && dependent_type_p (TYPE_DOMAIN (type
)))
22130 return dependent_type_p (TREE_TYPE (type
));
22133 /* -- a template-id in which either the template name is a template
22135 if (TREE_CODE (type
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
22137 /* ... or any of the template arguments is a dependent type or
22138 an expression that is type-dependent or value-dependent. */
22139 else if (CLASS_TYPE_P (type
) && CLASSTYPE_TEMPLATE_INFO (type
)
22140 && (any_dependent_template_arguments_p
22141 (INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (type
)))))
22144 /* All TYPEOF_TYPEs, DECLTYPE_TYPEs, and UNDERLYING_TYPEs are
22145 dependent; if the argument of the `typeof' expression is not
22146 type-dependent, then it should already been have resolved. */
22147 if (TREE_CODE (type
) == TYPEOF_TYPE
22148 || TREE_CODE (type
) == DECLTYPE_TYPE
22149 || TREE_CODE (type
) == UNDERLYING_TYPE
)
22152 /* A template argument pack is dependent if any of its packed
22154 if (TREE_CODE (type
) == TYPE_ARGUMENT_PACK
)
22156 tree args
= ARGUMENT_PACK_ARGS (type
);
22157 int i
, len
= TREE_VEC_LENGTH (args
);
22158 for (i
= 0; i
< len
; ++i
)
22159 if (dependent_template_arg_p (TREE_VEC_ELT (args
, i
)))
22163 /* All TYPE_PACK_EXPANSIONs are dependent, because parameter packs must
22164 be template parameters. */
22165 if (TREE_CODE (type
) == TYPE_PACK_EXPANSION
)
22168 /* The standard does not specifically mention types that are local
22169 to template functions or local classes, but they should be
22170 considered dependent too. For example:
22172 template <int I> void f() {
22177 The size of `E' cannot be known until the value of `I' has been
22178 determined. Therefore, `E' must be considered dependent. */
22179 scope
= TYPE_CONTEXT (type
);
22180 if (scope
&& TYPE_P (scope
))
22181 return dependent_type_p (scope
);
22182 /* Don't use type_dependent_expression_p here, as it can lead
22183 to infinite recursion trying to determine whether a lambda
22184 nested in a lambda is dependent (c++/47687). */
22185 else if (scope
&& TREE_CODE (scope
) == FUNCTION_DECL
22186 && DECL_LANG_SPECIFIC (scope
)
22187 && DECL_TEMPLATE_INFO (scope
)
22188 && (any_dependent_template_arguments_p
22189 (INNERMOST_TEMPLATE_ARGS (DECL_TI_ARGS (scope
)))))
22192 /* Other types are non-dependent. */
22196 /* Returns TRUE if TYPE is dependent, in the sense of
22197 [temp.dep.type]. Note that a NULL type is considered dependent. */
22200 dependent_type_p (tree type
)
22202 /* If there are no template parameters in scope, then there can't be
22203 any dependent types. */
22204 if (!processing_template_decl
)
22206 /* If we are not processing a template, then nobody should be
22207 providing us with a dependent type. */
22209 gcc_assert (TREE_CODE (type
) != TEMPLATE_TYPE_PARM
|| is_auto (type
));
22213 /* If the type is NULL, we have not computed a type for the entity
22214 in question; in that case, the type is dependent. */
22218 /* Erroneous types can be considered non-dependent. */
22219 if (type
== error_mark_node
)
22222 /* If we have not already computed the appropriate value for TYPE,
22224 if (!TYPE_DEPENDENT_P_VALID (type
))
22226 TYPE_DEPENDENT_P (type
) = dependent_type_p_r (type
);
22227 TYPE_DEPENDENT_P_VALID (type
) = 1;
22230 return TYPE_DEPENDENT_P (type
);
22233 /* Returns TRUE if SCOPE is a dependent scope, in which we can't do any
22234 lookup. In other words, a dependent type that is not the current
22238 dependent_scope_p (tree scope
)
22240 return (scope
&& TYPE_P (scope
) && dependent_type_p (scope
)
22241 && !currently_open_class (scope
));
22244 /* T is a SCOPE_REF; return whether we need to consider it
22245 instantiation-dependent so that we can check access at instantiation
22246 time even though we know which member it resolves to. */
22249 instantiation_dependent_scope_ref_p (tree t
)
22251 if (DECL_P (TREE_OPERAND (t
, 1))
22252 && CLASS_TYPE_P (TREE_OPERAND (t
, 0))
22253 && accessible_in_template_p (TREE_OPERAND (t
, 0),
22254 TREE_OPERAND (t
, 1)))
22260 /* Returns TRUE if the EXPRESSION is value-dependent, in the sense of
22261 [temp.dep.constexpr]. EXPRESSION is already known to be a constant
22264 /* Note that this predicate is not appropriate for general expressions;
22265 only constant expressions (that satisfy potential_constant_expression)
22266 can be tested for value dependence. */
22269 value_dependent_expression_p (tree expression
)
22271 if (!processing_template_decl
)
22274 /* A name declared with a dependent type. */
22275 if (DECL_P (expression
) && type_dependent_expression_p (expression
))
22278 switch (TREE_CODE (expression
))
22280 case IDENTIFIER_NODE
:
22281 /* A name that has not been looked up -- must be dependent. */
22284 case TEMPLATE_PARM_INDEX
:
22285 /* A non-type template parm. */
22289 /* A non-type template parm. */
22290 if (DECL_TEMPLATE_PARM_P (expression
))
22292 return value_dependent_expression_p (DECL_INITIAL (expression
));
22295 /* A constant with literal type and is initialized
22296 with an expression that is value-dependent.
22298 Note that a non-dependent parenthesized initializer will have
22299 already been replaced with its constant value, so if we see
22300 a TREE_LIST it must be dependent. */
22301 if (DECL_INITIAL (expression
)
22302 && decl_constant_var_p (expression
)
22303 && (TREE_CODE (DECL_INITIAL (expression
)) == TREE_LIST
22304 /* cp_finish_decl doesn't fold reference initializers. */
22305 || TREE_CODE (TREE_TYPE (expression
)) == REFERENCE_TYPE
22306 || value_dependent_expression_p (DECL_INITIAL (expression
))))
22310 case DYNAMIC_CAST_EXPR
:
22311 case STATIC_CAST_EXPR
:
22312 case CONST_CAST_EXPR
:
22313 case REINTERPRET_CAST_EXPR
:
22315 /* These expressions are value-dependent if the type to which
22316 the cast occurs is dependent or the expression being casted
22317 is value-dependent. */
22319 tree type
= TREE_TYPE (expression
);
22321 if (dependent_type_p (type
))
22324 /* A functional cast has a list of operands. */
22325 expression
= TREE_OPERAND (expression
, 0);
22328 /* If there are no operands, it must be an expression such
22329 as "int()". This should not happen for aggregate types
22330 because it would form non-constant expressions. */
22331 gcc_assert (cxx_dialect
>= cxx11
22332 || INTEGRAL_OR_ENUMERATION_TYPE_P (type
));
22337 if (TREE_CODE (expression
) == TREE_LIST
)
22338 return any_value_dependent_elements_p (expression
);
22340 return value_dependent_expression_p (expression
);
22344 if (SIZEOF_EXPR_TYPE_P (expression
))
22345 return dependent_type_p (TREE_TYPE (TREE_OPERAND (expression
, 0)));
22349 /* A `sizeof' expression is value-dependent if the operand is
22350 type-dependent or is a pack expansion. */
22351 expression
= TREE_OPERAND (expression
, 0);
22352 if (PACK_EXPANSION_P (expression
))
22354 else if (TYPE_P (expression
))
22355 return dependent_type_p (expression
);
22356 return instantiation_dependent_expression_p (expression
);
22358 case AT_ENCODE_EXPR
:
22359 /* An 'encode' expression is value-dependent if the operand is
22361 expression
= TREE_OPERAND (expression
, 0);
22362 return dependent_type_p (expression
);
22364 case NOEXCEPT_EXPR
:
22365 expression
= TREE_OPERAND (expression
, 0);
22366 return instantiation_dependent_expression_p (expression
);
22369 /* All instantiation-dependent expressions should also be considered
22370 value-dependent. */
22371 return instantiation_dependent_scope_ref_p (expression
);
22373 case COMPONENT_REF
:
22374 return (value_dependent_expression_p (TREE_OPERAND (expression
, 0))
22375 || value_dependent_expression_p (TREE_OPERAND (expression
, 1)));
22377 case NONTYPE_ARGUMENT_PACK
:
22378 /* A NONTYPE_ARGUMENT_PACK is value-dependent if any packed argument
22379 is value-dependent. */
22381 tree values
= ARGUMENT_PACK_ARGS (expression
);
22382 int i
, len
= TREE_VEC_LENGTH (values
);
22384 for (i
= 0; i
< len
; ++i
)
22385 if (value_dependent_expression_p (TREE_VEC_ELT (values
, i
)))
22393 tree type2
= TRAIT_EXPR_TYPE2 (expression
);
22394 return (dependent_type_p (TRAIT_EXPR_TYPE1 (expression
))
22395 || (type2
? dependent_type_p (type2
) : false));
22399 return ((value_dependent_expression_p (TREE_OPERAND (expression
, 0)))
22400 || (value_dependent_expression_p (TREE_OPERAND (expression
, 2))));
22403 return ((value_dependent_expression_p (TREE_OPERAND (expression
, 0)))
22404 || (value_dependent_expression_p (TREE_OPERAND (expression
, 1))));
22408 tree op
= TREE_OPERAND (expression
, 0);
22409 return (value_dependent_expression_p (op
)
22410 || has_value_dependent_address (op
));
22413 case REQUIRES_EXPR
:
22414 /* Treat all requires-expressions as value-dependent so
22415 we don't try to fold them. */
22419 return dependent_type_p (TREE_OPERAND (expression
, 0));
22423 tree fn
= get_callee_fndecl (expression
);
22425 if (!fn
&& value_dependent_expression_p (CALL_EXPR_FN (expression
)))
22427 nargs
= call_expr_nargs (expression
);
22428 for (i
= 0; i
< nargs
; ++i
)
22430 tree op
= CALL_EXPR_ARG (expression
, i
);
22431 /* In a call to a constexpr member function, look through the
22432 implicit ADDR_EXPR on the object argument so that it doesn't
22433 cause the call to be considered value-dependent. We also
22434 look through it in potential_constant_expression. */
22435 if (i
== 0 && fn
&& DECL_DECLARED_CONSTEXPR_P (fn
)
22436 && DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
)
22437 && TREE_CODE (op
) == ADDR_EXPR
)
22438 op
= TREE_OPERAND (op
, 0);
22439 if (value_dependent_expression_p (op
))
22445 case TEMPLATE_ID_EXPR
:
22446 /* If a TEMPLATE_ID_EXPR involves a dependent name, it will be
22448 return type_dependent_expression_p (expression
)
22449 || variable_concept_p (TREE_OPERAND (expression
, 0));
22455 if (dependent_type_p (TREE_TYPE (expression
)))
22457 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (expression
), ix
, val
)
22458 if (value_dependent_expression_p (val
))
22464 /* Treat a GNU statement expression as dependent to avoid crashing
22465 under instantiate_non_dependent_expr; it can't be constant. */
22469 /* A constant expression is value-dependent if any subexpression is
22470 value-dependent. */
22471 switch (TREE_CODE_CLASS (TREE_CODE (expression
)))
22473 case tcc_reference
:
22475 case tcc_comparison
:
22477 case tcc_expression
:
22480 int i
, len
= cp_tree_operand_length (expression
);
22482 for (i
= 0; i
< len
; i
++)
22484 tree t
= TREE_OPERAND (expression
, i
);
22486 /* In some cases, some of the operands may be missing.l
22487 (For example, in the case of PREDECREMENT_EXPR, the
22488 amount to increment by may be missing.) That doesn't
22489 make the expression dependent. */
22490 if (t
&& value_dependent_expression_p (t
))
22501 /* The expression is not value-dependent. */
22505 /* Returns TRUE if the EXPRESSION is type-dependent, in the sense of
22506 [temp.dep.expr]. Note that an expression with no type is
22507 considered dependent. Other parts of the compiler arrange for an
22508 expression with type-dependent subexpressions to have no type, so
22509 this function doesn't have to be fully recursive. */
22512 type_dependent_expression_p (tree expression
)
22514 if (!processing_template_decl
)
22517 if (expression
== NULL_TREE
|| expression
== error_mark_node
)
22520 /* An unresolved name is always dependent. */
22521 if (identifier_p (expression
)
22522 || TREE_CODE (expression
) == USING_DECL
22523 || TREE_CODE (expression
) == WILDCARD_DECL
)
22526 /* A fold expression is type-dependent. */
22527 if (TREE_CODE (expression
) == UNARY_LEFT_FOLD_EXPR
22528 || TREE_CODE (expression
) == UNARY_RIGHT_FOLD_EXPR
22529 || TREE_CODE (expression
) == BINARY_LEFT_FOLD_EXPR
22530 || TREE_CODE (expression
) == BINARY_RIGHT_FOLD_EXPR
)
22533 /* Some expression forms are never type-dependent. */
22534 if (TREE_CODE (expression
) == PSEUDO_DTOR_EXPR
22535 || TREE_CODE (expression
) == SIZEOF_EXPR
22536 || TREE_CODE (expression
) == ALIGNOF_EXPR
22537 || TREE_CODE (expression
) == AT_ENCODE_EXPR
22538 || TREE_CODE (expression
) == NOEXCEPT_EXPR
22539 || TREE_CODE (expression
) == TRAIT_EXPR
22540 || TREE_CODE (expression
) == TYPEID_EXPR
22541 || TREE_CODE (expression
) == DELETE_EXPR
22542 || TREE_CODE (expression
) == VEC_DELETE_EXPR
22543 || TREE_CODE (expression
) == THROW_EXPR
22544 || TREE_CODE (expression
) == REQUIRES_EXPR
)
22547 /* The types of these expressions depends only on the type to which
22548 the cast occurs. */
22549 if (TREE_CODE (expression
) == DYNAMIC_CAST_EXPR
22550 || TREE_CODE (expression
) == STATIC_CAST_EXPR
22551 || TREE_CODE (expression
) == CONST_CAST_EXPR
22552 || TREE_CODE (expression
) == REINTERPRET_CAST_EXPR
22553 || TREE_CODE (expression
) == IMPLICIT_CONV_EXPR
22554 || TREE_CODE (expression
) == CAST_EXPR
)
22555 return dependent_type_p (TREE_TYPE (expression
));
22557 /* The types of these expressions depends only on the type created
22558 by the expression. */
22559 if (TREE_CODE (expression
) == NEW_EXPR
22560 || TREE_CODE (expression
) == VEC_NEW_EXPR
)
22562 /* For NEW_EXPR tree nodes created inside a template, either
22563 the object type itself or a TREE_LIST may appear as the
22565 tree type
= TREE_OPERAND (expression
, 1);
22566 if (TREE_CODE (type
) == TREE_LIST
)
22567 /* This is an array type. We need to check array dimensions
22569 return dependent_type_p (TREE_VALUE (TREE_PURPOSE (type
)))
22570 || value_dependent_expression_p
22571 (TREE_OPERAND (TREE_VALUE (type
), 1));
22573 return dependent_type_p (type
);
22576 if (TREE_CODE (expression
) == SCOPE_REF
)
22578 tree scope
= TREE_OPERAND (expression
, 0);
22579 tree name
= TREE_OPERAND (expression
, 1);
22581 /* 14.6.2.2 [temp.dep.expr]: An id-expression is type-dependent if it
22582 contains an identifier associated by name lookup with one or more
22583 declarations declared with a dependent type, or...a
22584 nested-name-specifier or qualified-id that names a member of an
22585 unknown specialization. */
22586 return (type_dependent_expression_p (name
)
22587 || dependent_scope_p (scope
));
22590 if (TREE_CODE (expression
) == FUNCTION_DECL
22591 && DECL_LANG_SPECIFIC (expression
)
22592 && DECL_TEMPLATE_INFO (expression
)
22593 && (any_dependent_template_arguments_p
22594 (INNERMOST_TEMPLATE_ARGS (DECL_TI_ARGS (expression
)))))
22597 if (TREE_CODE (expression
) == TEMPLATE_DECL
22598 && !DECL_TEMPLATE_TEMPLATE_PARM_P (expression
))
22601 if (TREE_CODE (expression
) == STMT_EXPR
)
22602 expression
= stmt_expr_value_expr (expression
);
22604 if (BRACE_ENCLOSED_INITIALIZER_P (expression
))
22609 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (expression
), i
, elt
)
22611 if (type_dependent_expression_p (elt
))
22617 /* A static data member of the current instantiation with incomplete
22618 array type is type-dependent, as the definition and specializations
22619 can have different bounds. */
22620 if (VAR_P (expression
)
22621 && DECL_CLASS_SCOPE_P (expression
)
22622 && dependent_type_p (DECL_CONTEXT (expression
))
22623 && VAR_HAD_UNKNOWN_BOUND (expression
))
22626 /* An array of unknown bound depending on a variadic parameter, eg:
22628 template<typename... Args>
22629 void foo (Args... args)
22631 int arr[] = { args... };
22634 template<int... vals>
22637 int arr[] = { vals... };
22640 If the array has no length and has an initializer, it must be that
22641 we couldn't determine its length in cp_complete_array_type because
22642 it is dependent. */
22643 if (VAR_P (expression
)
22644 && TREE_CODE (TREE_TYPE (expression
)) == ARRAY_TYPE
22645 && !TYPE_DOMAIN (TREE_TYPE (expression
))
22646 && DECL_INITIAL (expression
))
22649 /* A variable template specialization is type-dependent if it has any
22650 dependent template arguments. */
22651 if (VAR_P (expression
)
22652 && DECL_LANG_SPECIFIC (expression
)
22653 && DECL_TEMPLATE_INFO (expression
)
22654 && variable_template_p (DECL_TI_TEMPLATE (expression
)))
22655 return any_dependent_template_arguments_p (DECL_TI_ARGS (expression
));
22657 /* Always dependent, on the number of arguments if nothing else. */
22658 if (TREE_CODE (expression
) == EXPR_PACK_EXPANSION
)
22661 if (TREE_TYPE (expression
) == unknown_type_node
)
22663 if (TREE_CODE (expression
) == ADDR_EXPR
)
22664 return type_dependent_expression_p (TREE_OPERAND (expression
, 0));
22665 if (TREE_CODE (expression
) == COMPONENT_REF
22666 || TREE_CODE (expression
) == OFFSET_REF
)
22668 if (type_dependent_expression_p (TREE_OPERAND (expression
, 0)))
22670 expression
= TREE_OPERAND (expression
, 1);
22671 if (identifier_p (expression
))
22674 /* SCOPE_REF with non-null TREE_TYPE is always non-dependent. */
22675 if (TREE_CODE (expression
) == SCOPE_REF
)
22678 if (BASELINK_P (expression
))
22680 if (BASELINK_OPTYPE (expression
)
22681 && dependent_type_p (BASELINK_OPTYPE (expression
)))
22683 expression
= BASELINK_FUNCTIONS (expression
);
22686 if (TREE_CODE (expression
) == TEMPLATE_ID_EXPR
)
22688 if (any_dependent_template_arguments_p
22689 (TREE_OPERAND (expression
, 1)))
22691 expression
= TREE_OPERAND (expression
, 0);
22692 if (identifier_p (expression
))
22696 gcc_assert (TREE_CODE (expression
) == OVERLOAD
22697 || TREE_CODE (expression
) == FUNCTION_DECL
);
22701 if (type_dependent_expression_p (OVL_CURRENT (expression
)))
22703 expression
= OVL_NEXT (expression
);
22708 gcc_assert (TREE_CODE (expression
) != TYPE_DECL
);
22710 return (dependent_type_p (TREE_TYPE (expression
)));
22713 /* walk_tree callback function for instantiation_dependent_expression_p,
22714 below. Returns non-zero if a dependent subexpression is found. */
22717 instantiation_dependent_r (tree
*tp
, int *walk_subtrees
,
22722 /* We don't have to worry about decltype currently because decltype
22723 of an instantiation-dependent expr is a dependent type. This
22724 might change depending on the resolution of DR 1172. */
22725 *walk_subtrees
= false;
22728 enum tree_code code
= TREE_CODE (*tp
);
22731 /* Don't treat an argument list as dependent just because it has no
22739 /* A constant with a dependent initializer is dependent. */
22740 if (value_dependent_expression_p (*tp
))
22744 case TEMPLATE_PARM_INDEX
:
22747 /* Handle expressions with type operands. */
22751 case AT_ENCODE_EXPR
:
22753 tree op
= TREE_OPERAND (*tp
, 0);
22754 if (code
== SIZEOF_EXPR
&& SIZEOF_EXPR_TYPE_P (*tp
))
22755 op
= TREE_TYPE (op
);
22758 if (dependent_type_p (op
))
22762 *walk_subtrees
= false;
22770 if (value_dependent_expression_p (*tp
))
22772 *walk_subtrees
= false;
22775 case COMPONENT_REF
:
22776 if (identifier_p (TREE_OPERAND (*tp
, 1)))
22777 /* In a template, finish_class_member_access_expr creates a
22778 COMPONENT_REF with an IDENTIFIER_NODE for op1 even if it isn't
22779 type-dependent, so that we can check access control at
22780 instantiation time (PR 42277). See also Core issue 1273. */
22785 if (instantiation_dependent_scope_ref_p (*tp
))
22790 /* Treat statement-expressions as dependent. */
22794 /* Treat requires-expressions as dependent. */
22795 case REQUIRES_EXPR
:
22799 /* Treat calls to function concepts as dependent. */
22800 if (function_concept_check_p (*tp
))
22804 case TEMPLATE_ID_EXPR
:
22805 /* And variable concepts. */
22806 if (variable_concept_p (TREE_OPERAND (*tp
, 0)))
22814 if (type_dependent_expression_p (*tp
))
22820 /* Returns TRUE if the EXPRESSION is instantiation-dependent, in the
22821 sense defined by the ABI:
22823 "An expression is instantiation-dependent if it is type-dependent
22824 or value-dependent, or it has a subexpression that is type-dependent
22825 or value-dependent." */
22828 instantiation_dependent_expression_p (tree expression
)
22832 if (!processing_template_decl
)
22835 if (expression
== error_mark_node
)
22838 result
= cp_walk_tree_without_duplicates (&expression
,
22839 instantiation_dependent_r
, NULL
);
22840 return result
!= NULL_TREE
;
22843 /* Like type_dependent_expression_p, but it also works while not processing
22844 a template definition, i.e. during substitution or mangling. */
22847 type_dependent_expression_p_push (tree expr
)
22850 ++processing_template_decl
;
22851 b
= type_dependent_expression_p (expr
);
22852 --processing_template_decl
;
22856 /* Returns TRUE if ARGS contains a type-dependent expression. */
22859 any_type_dependent_arguments_p (const vec
<tree
, va_gc
> *args
)
22864 FOR_EACH_VEC_SAFE_ELT (args
, i
, arg
)
22866 if (type_dependent_expression_p (arg
))
22872 /* Returns TRUE if LIST (a TREE_LIST whose TREE_VALUEs are
22873 expressions) contains any type-dependent expressions. */
22876 any_type_dependent_elements_p (const_tree list
)
22878 for (; list
; list
= TREE_CHAIN (list
))
22879 if (type_dependent_expression_p (TREE_VALUE (list
)))
22885 /* Returns TRUE if LIST (a TREE_LIST whose TREE_VALUEs are
22886 expressions) contains any value-dependent expressions. */
22889 any_value_dependent_elements_p (const_tree list
)
22891 for (; list
; list
= TREE_CHAIN (list
))
22892 if (value_dependent_expression_p (TREE_VALUE (list
)))
22898 /* Returns TRUE if the ARG (a template argument) is dependent. */
22901 dependent_template_arg_p (tree arg
)
22903 if (!processing_template_decl
)
22906 /* Assume a template argument that was wrongly written by the user
22907 is dependent. This is consistent with what
22908 any_dependent_template_arguments_p [that calls this function]
22910 if (!arg
|| arg
== error_mark_node
)
22913 if (TREE_CODE (arg
) == ARGUMENT_PACK_SELECT
)
22914 arg
= ARGUMENT_PACK_SELECT_ARG (arg
);
22916 if (TREE_CODE (arg
) == TEMPLATE_DECL
22917 || TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
)
22918 return dependent_template_p (arg
);
22919 else if (ARGUMENT_PACK_P (arg
))
22921 tree args
= ARGUMENT_PACK_ARGS (arg
);
22922 int i
, len
= TREE_VEC_LENGTH (args
);
22923 for (i
= 0; i
< len
; ++i
)
22925 if (dependent_template_arg_p (TREE_VEC_ELT (args
, i
)))
22931 else if (TYPE_P (arg
))
22932 return dependent_type_p (arg
);
22934 return (type_dependent_expression_p (arg
)
22935 || value_dependent_expression_p (arg
));
22938 /* Returns true if ARGS (a collection of template arguments) contains
22939 any types that require structural equality testing. */
22942 any_template_arguments_need_structural_equality_p (tree args
)
22949 if (args
== error_mark_node
)
22952 for (i
= 0; i
< TMPL_ARGS_DEPTH (args
); ++i
)
22954 tree level
= TMPL_ARGS_LEVEL (args
, i
+ 1);
22955 for (j
= 0; j
< TREE_VEC_LENGTH (level
); ++j
)
22957 tree arg
= TREE_VEC_ELT (level
, j
);
22958 tree packed_args
= NULL_TREE
;
22961 if (ARGUMENT_PACK_P (arg
))
22963 /* Look inside the argument pack. */
22964 packed_args
= ARGUMENT_PACK_ARGS (arg
);
22965 len
= TREE_VEC_LENGTH (packed_args
);
22968 for (k
= 0; k
< len
; ++k
)
22971 arg
= TREE_VEC_ELT (packed_args
, k
);
22973 if (error_operand_p (arg
))
22975 else if (TREE_CODE (arg
) == TEMPLATE_DECL
)
22977 else if (TYPE_P (arg
) && TYPE_STRUCTURAL_EQUALITY_P (arg
))
22979 else if (!TYPE_P (arg
) && TREE_TYPE (arg
)
22980 && TYPE_STRUCTURAL_EQUALITY_P (TREE_TYPE (arg
)))
22989 /* Returns true if ARGS (a collection of template arguments) contains
22990 any dependent arguments. */
22993 any_dependent_template_arguments_p (const_tree args
)
23000 if (args
== error_mark_node
)
23003 for (i
= 0; i
< TMPL_ARGS_DEPTH (args
); ++i
)
23005 const_tree level
= TMPL_ARGS_LEVEL (args
, i
+ 1);
23006 for (j
= 0; j
< TREE_VEC_LENGTH (level
); ++j
)
23007 if (dependent_template_arg_p (TREE_VEC_ELT (level
, j
)))
23014 /* Returns TRUE if the template TMPL is dependent. */
23017 dependent_template_p (tree tmpl
)
23019 if (TREE_CODE (tmpl
) == OVERLOAD
)
23023 if (dependent_template_p (OVL_CURRENT (tmpl
)))
23025 tmpl
= OVL_NEXT (tmpl
);
23030 /* Template template parameters are dependent. */
23031 if (DECL_TEMPLATE_TEMPLATE_PARM_P (tmpl
)
23032 || TREE_CODE (tmpl
) == TEMPLATE_TEMPLATE_PARM
)
23034 /* So are names that have not been looked up. */
23035 if (TREE_CODE (tmpl
) == SCOPE_REF
|| identifier_p (tmpl
))
23037 /* So are member templates of dependent classes. */
23038 if (TYPE_P (CP_DECL_CONTEXT (tmpl
)))
23039 return dependent_type_p (DECL_CONTEXT (tmpl
));
23043 /* Returns TRUE if the specialization TMPL<ARGS> is dependent. */
23046 dependent_template_id_p (tree tmpl
, tree args
)
23048 return (dependent_template_p (tmpl
)
23049 || any_dependent_template_arguments_p (args
));
23052 /* Returns TRUE if OMP_FOR with DECLV, INITV, CONDV and INCRV vectors
23056 dependent_omp_for_p (tree declv
, tree initv
, tree condv
, tree incrv
)
23060 if (!processing_template_decl
)
23063 for (i
= 0; i
< TREE_VEC_LENGTH (declv
); i
++)
23065 tree decl
= TREE_VEC_ELT (declv
, i
);
23066 tree init
= TREE_VEC_ELT (initv
, i
);
23067 tree cond
= TREE_VEC_ELT (condv
, i
);
23068 tree incr
= TREE_VEC_ELT (incrv
, i
);
23070 if (type_dependent_expression_p (decl
)
23071 || TREE_CODE (decl
) == SCOPE_REF
)
23074 if (init
&& type_dependent_expression_p (init
))
23077 if (type_dependent_expression_p (cond
))
23080 if (COMPARISON_CLASS_P (cond
)
23081 && (type_dependent_expression_p (TREE_OPERAND (cond
, 0))
23082 || type_dependent_expression_p (TREE_OPERAND (cond
, 1))))
23085 if (TREE_CODE (incr
) == MODOP_EXPR
)
23087 if (type_dependent_expression_p (TREE_OPERAND (incr
, 0))
23088 || type_dependent_expression_p (TREE_OPERAND (incr
, 2)))
23091 else if (type_dependent_expression_p (incr
))
23093 else if (TREE_CODE (incr
) == MODIFY_EXPR
)
23095 if (type_dependent_expression_p (TREE_OPERAND (incr
, 0)))
23097 else if (BINARY_CLASS_P (TREE_OPERAND (incr
, 1)))
23099 tree t
= TREE_OPERAND (incr
, 1);
23100 if (type_dependent_expression_p (TREE_OPERAND (t
, 0))
23101 || type_dependent_expression_p (TREE_OPERAND (t
, 1)))
23110 /* TYPE is a TYPENAME_TYPE. Returns the ordinary TYPE to which the
23111 TYPENAME_TYPE corresponds. Returns the original TYPENAME_TYPE if
23112 no such TYPE can be found. Note that this function peers inside
23113 uninstantiated templates and therefore should be used only in
23114 extremely limited situations. ONLY_CURRENT_P restricts this
23115 peering to the currently open classes hierarchy (which is required
23116 when comparing types). */
23119 resolve_typename_type (tree type
, bool only_current_p
)
23128 gcc_assert (TREE_CODE (type
) == TYPENAME_TYPE
);
23130 scope
= TYPE_CONTEXT (type
);
23131 /* Usually the non-qualified identifier of a TYPENAME_TYPE is
23132 TYPE_IDENTIFIER (type). But when 'type' is a typedef variant of
23133 a TYPENAME_TYPE node, then TYPE_NAME (type) is set to the TYPE_DECL representing
23134 the typedef. In that case TYPE_IDENTIFIER (type) is not the non-qualified
23135 identifier of the TYPENAME_TYPE anymore.
23136 So by getting the TYPE_IDENTIFIER of the _main declaration_ of the
23137 TYPENAME_TYPE instead, we avoid messing up with a possible
23138 typedef variant case. */
23139 name
= TYPE_IDENTIFIER (TYPE_MAIN_VARIANT (type
));
23141 /* If the SCOPE is itself a TYPENAME_TYPE, then we need to resolve
23142 it first before we can figure out what NAME refers to. */
23143 if (TREE_CODE (scope
) == TYPENAME_TYPE
)
23145 if (TYPENAME_IS_RESOLVING_P (scope
))
23146 /* Given a class template A with a dependent base with nested type C,
23147 typedef typename A::C::C C will land us here, as trying to resolve
23148 the initial A::C leads to the local C typedef, which leads back to
23149 A::C::C. So we break the recursion now. */
23152 scope
= resolve_typename_type (scope
, only_current_p
);
23154 /* If we don't know what SCOPE refers to, then we cannot resolve the
23156 if (TREE_CODE (scope
) == TYPENAME_TYPE
)
23158 /* If the SCOPE is a template type parameter, we have no way of
23159 resolving the name. */
23160 if (TREE_CODE (scope
) == TEMPLATE_TYPE_PARM
)
23162 /* If the SCOPE is not the current instantiation, there's no reason
23163 to look inside it. */
23164 if (only_current_p
&& !currently_open_class (scope
))
23166 /* If this is a typedef, we don't want to look inside (c++/11987). */
23167 if (typedef_variant_p (type
))
23169 /* If SCOPE isn't the template itself, it will not have a valid
23170 TYPE_FIELDS list. */
23171 if (CLASS_TYPE_P (scope
)
23172 && same_type_p (scope
, CLASSTYPE_PRIMARY_TEMPLATE_TYPE (scope
)))
23173 /* scope is either the template itself or a compatible instantiation
23174 like X<T>, so look up the name in the original template. */
23175 scope
= CLASSTYPE_PRIMARY_TEMPLATE_TYPE (scope
);
23177 /* scope is a partial instantiation, so we can't do the lookup or we
23178 will lose the template arguments. */
23180 /* Enter the SCOPE so that name lookup will be resolved as if we
23181 were in the class definition. In particular, SCOPE will no
23182 longer be considered a dependent type. */
23183 pushed_scope
= push_scope (scope
);
23184 /* Look up the declaration. */
23185 decl
= lookup_member (scope
, name
, /*protect=*/0, /*want_type=*/true,
23186 tf_warning_or_error
);
23188 result
= NULL_TREE
;
23190 /* For a TYPENAME_TYPE like "typename X::template Y<T>", we want to
23191 find a TEMPLATE_DECL. Otherwise, we want to find a TYPE_DECL. */
23194 else if (identifier_p (TYPENAME_TYPE_FULLNAME (type
))
23195 && TREE_CODE (decl
) == TYPE_DECL
)
23197 result
= TREE_TYPE (decl
);
23198 if (result
== error_mark_node
)
23199 result
= NULL_TREE
;
23201 else if (TREE_CODE (TYPENAME_TYPE_FULLNAME (type
)) == TEMPLATE_ID_EXPR
23202 && DECL_CLASS_TEMPLATE_P (decl
))
23206 /* Obtain the template and the arguments. */
23207 tmpl
= TREE_OPERAND (TYPENAME_TYPE_FULLNAME (type
), 0);
23208 args
= TREE_OPERAND (TYPENAME_TYPE_FULLNAME (type
), 1);
23209 /* Instantiate the template. */
23210 result
= lookup_template_class (tmpl
, args
, NULL_TREE
, NULL_TREE
,
23211 /*entering_scope=*/0,
23212 tf_error
| tf_user
);
23213 if (result
== error_mark_node
)
23214 result
= NULL_TREE
;
23217 /* Leave the SCOPE. */
23219 pop_scope (pushed_scope
);
23221 /* If we failed to resolve it, return the original typename. */
23225 /* If lookup found a typename type, resolve that too. */
23226 if (TREE_CODE (result
) == TYPENAME_TYPE
&& !TYPENAME_IS_RESOLVING_P (result
))
23228 /* Ill-formed programs can cause infinite recursion here, so we
23229 must catch that. */
23230 TYPENAME_IS_RESOLVING_P (type
) = 1;
23231 result
= resolve_typename_type (result
, only_current_p
);
23232 TYPENAME_IS_RESOLVING_P (type
) = 0;
23235 /* Qualify the resulting type. */
23236 quals
= cp_type_quals (type
);
23238 result
= cp_build_qualified_type (result
, cp_type_quals (result
) | quals
);
23243 /* EXPR is an expression which is not type-dependent. Return a proxy
23244 for EXPR that can be used to compute the types of larger
23245 expressions containing EXPR. */
23248 build_non_dependent_expr (tree expr
)
23252 #ifdef ENABLE_CHECKING
23253 /* Try to get a constant value for all non-dependent expressions in
23254 order to expose bugs in *_dependent_expression_p and constexpr. */
23255 if (cxx_dialect
>= cxx11
)
23256 fold_non_dependent_expr (expr
);
23259 /* Preserve OVERLOADs; the functions must be available to resolve
23262 if (TREE_CODE (inner_expr
) == STMT_EXPR
)
23263 inner_expr
= stmt_expr_value_expr (inner_expr
);
23264 if (TREE_CODE (inner_expr
) == ADDR_EXPR
)
23265 inner_expr
= TREE_OPERAND (inner_expr
, 0);
23266 if (TREE_CODE (inner_expr
) == COMPONENT_REF
)
23267 inner_expr
= TREE_OPERAND (inner_expr
, 1);
23268 if (is_overloaded_fn (inner_expr
)
23269 || TREE_CODE (inner_expr
) == OFFSET_REF
)
23271 /* There is no need to return a proxy for a variable. */
23274 /* Preserve string constants; conversions from string constants to
23275 "char *" are allowed, even though normally a "const char *"
23276 cannot be used to initialize a "char *". */
23277 if (TREE_CODE (expr
) == STRING_CST
)
23279 /* Preserve void and arithmetic constants, as an optimization -- there is no
23280 reason to create a new node. */
23281 if (TREE_CODE (expr
) == VOID_CST
23282 || TREE_CODE (expr
) == INTEGER_CST
23283 || TREE_CODE (expr
) == REAL_CST
)
23285 /* Preserve THROW_EXPRs -- all throw-expressions have type "void".
23286 There is at least one place where we want to know that a
23287 particular expression is a throw-expression: when checking a ?:
23288 expression, there are special rules if the second or third
23289 argument is a throw-expression. */
23290 if (TREE_CODE (expr
) == THROW_EXPR
)
23293 /* Don't wrap an initializer list, we need to be able to look inside. */
23294 if (BRACE_ENCLOSED_INITIALIZER_P (expr
))
23297 /* Don't wrap a dummy object, we need to be able to test for it. */
23298 if (is_dummy_object (expr
))
23301 if (TREE_CODE (expr
) == COND_EXPR
)
23302 return build3 (COND_EXPR
,
23304 TREE_OPERAND (expr
, 0),
23305 (TREE_OPERAND (expr
, 1)
23306 ? build_non_dependent_expr (TREE_OPERAND (expr
, 1))
23307 : build_non_dependent_expr (TREE_OPERAND (expr
, 0))),
23308 build_non_dependent_expr (TREE_OPERAND (expr
, 2)));
23309 if (TREE_CODE (expr
) == COMPOUND_EXPR
23310 && !COMPOUND_EXPR_OVERLOADED (expr
))
23311 return build2 (COMPOUND_EXPR
,
23313 TREE_OPERAND (expr
, 0),
23314 build_non_dependent_expr (TREE_OPERAND (expr
, 1)));
23316 /* If the type is unknown, it can't really be non-dependent */
23317 gcc_assert (TREE_TYPE (expr
) != unknown_type_node
);
23319 /* Otherwise, build a NON_DEPENDENT_EXPR. */
23320 return build1 (NON_DEPENDENT_EXPR
, TREE_TYPE (expr
), expr
);
23323 /* ARGS is a vector of expressions as arguments to a function call.
23324 Replace the arguments with equivalent non-dependent expressions.
23325 This modifies ARGS in place. */
23328 make_args_non_dependent (vec
<tree
, va_gc
> *args
)
23333 FOR_EACH_VEC_SAFE_ELT (args
, ix
, arg
)
23335 tree newarg
= build_non_dependent_expr (arg
);
23337 (*args
)[ix
] = newarg
;
23341 /* Returns a type which represents 'auto' or 'decltype(auto)'. We use a
23342 TEMPLATE_TYPE_PARM with a level one deeper than the actual template
23346 make_auto_1 (tree name
)
23348 tree au
= cxx_make_type (TEMPLATE_TYPE_PARM
);
23349 TYPE_NAME (au
) = build_decl (input_location
,
23350 TYPE_DECL
, name
, au
);
23351 TYPE_STUB_DECL (au
) = TYPE_NAME (au
);
23352 TEMPLATE_TYPE_PARM_INDEX (au
) = build_template_parm_index
23353 (0, processing_template_decl
+ 1, processing_template_decl
+ 1,
23354 TYPE_NAME (au
), NULL_TREE
);
23355 TYPE_CANONICAL (au
) = canonical_type_parameter (au
);
23356 DECL_ARTIFICIAL (TYPE_NAME (au
)) = 1;
23357 SET_DECL_TEMPLATE_PARM_P (TYPE_NAME (au
));
23363 make_decltype_auto (void)
23365 return make_auto_1 (get_identifier ("decltype(auto)"));
23371 return make_auto_1 (get_identifier ("auto"));
23374 /* Given type ARG, return std::initializer_list<ARG>. */
23379 tree std_init_list
= namespace_binding
23380 (get_identifier ("initializer_list"), std_node
);
23382 if (!std_init_list
|| !DECL_CLASS_TEMPLATE_P (std_init_list
))
23384 error ("deducing from brace-enclosed initializer list requires "
23385 "#include <initializer_list>");
23386 return error_mark_node
;
23388 argvec
= make_tree_vec (1);
23389 TREE_VEC_ELT (argvec
, 0) = arg
;
23390 return lookup_template_class (std_init_list
, argvec
, NULL_TREE
,
23391 NULL_TREE
, 0, tf_warning_or_error
);
23394 /* Replace auto in TYPE with std::initializer_list<auto>. */
23397 listify_autos (tree type
, tree auto_node
)
23399 tree init_auto
= listify (auto_node
);
23400 tree argvec
= make_tree_vec (1);
23401 TREE_VEC_ELT (argvec
, 0) = init_auto
;
23402 if (processing_template_decl
)
23403 argvec
= add_to_template_args (current_template_args (), argvec
);
23404 return tsubst (type
, argvec
, tf_warning_or_error
, NULL_TREE
);
23407 /* Replace occurrences of 'auto' in TYPE with the appropriate type deduced
23408 from INIT. AUTO_NODE is the TEMPLATE_TYPE_PARM used for 'auto' in TYPE. */
23411 do_auto_deduction (tree type
, tree init
, tree auto_node
)
23413 return do_auto_deduction (type
, init
, auto_node
,
23414 tf_warning_or_error
,
23418 /* Replace occurrences of 'auto' in TYPE with the appropriate type deduced
23419 from INIT. AUTO_NODE is the TEMPLATE_TYPE_PARM used for 'auto' in TYPE.
23420 The CONTEXT determines the context in which auto deduction is performed
23421 and is used to control error diagnostics. */
23424 do_auto_deduction (tree type
, tree init
, tree auto_node
,
23425 tsubst_flags_t complain
, auto_deduction_context context
)
23429 if (init
== error_mark_node
)
23430 return error_mark_node
;
23432 if (type_dependent_expression_p (init
))
23433 /* Defining a subset of type-dependent expressions that we can deduce
23434 from ahead of time isn't worth the trouble. */
23437 /* [dcl.spec.auto]: Obtain P from T by replacing the occurrences of auto
23438 with either a new invented type template parameter U or, if the
23439 initializer is a braced-init-list (8.5.4), with
23440 std::initializer_list<U>. */
23441 if (BRACE_ENCLOSED_INITIALIZER_P (init
))
23443 if (!DIRECT_LIST_INIT_P (init
))
23444 type
= listify_autos (type
, auto_node
);
23445 else if (CONSTRUCTOR_NELTS (init
) == 1)
23446 init
= CONSTRUCTOR_ELT (init
, 0)->value
;
23449 if (complain
& tf_warning_or_error
)
23451 if (permerror (input_location
, "direct-list-initialization of "
23452 "%<auto%> requires exactly one element"))
23453 inform (input_location
,
23454 "for deduction to %<std::initializer_list%>, use copy-"
23455 "list-initialization (i.e. add %<=%> before the %<{%>)");
23457 type
= listify_autos (type
, auto_node
);
23461 init
= resolve_nondeduced_context (init
);
23463 targs
= make_tree_vec (1);
23464 if (AUTO_IS_DECLTYPE (auto_node
))
23466 bool id
= (DECL_P (init
) || (TREE_CODE (init
) == COMPONENT_REF
23467 && !REF_PARENTHESIZED_P (init
)));
23468 TREE_VEC_ELT (targs
, 0)
23469 = finish_decltype_type (init
, id
, tf_warning_or_error
);
23470 if (type
!= auto_node
)
23472 if (complain
& tf_error
)
23473 error ("%qT as type rather than plain %<decltype(auto)%>", type
);
23474 return error_mark_node
;
23479 tree parms
= build_tree_list (NULL_TREE
, type
);
23480 tree tparms
= make_tree_vec (1);
23483 TREE_VEC_ELT (tparms
, 0)
23484 = build_tree_list (NULL_TREE
, TYPE_NAME (auto_node
));
23485 val
= type_unification_real (tparms
, targs
, parms
, &init
, 1, 0,
23486 DEDUCE_CALL
, LOOKUP_NORMAL
,
23487 NULL
, /*explain_p=*/false);
23490 if (processing_template_decl
)
23491 /* Try again at instantiation time. */
23493 if (type
&& type
!= error_mark_node
23494 && (complain
& tf_error
))
23495 /* If type is error_mark_node a diagnostic must have been
23496 emitted by now. Also, having a mention to '<type error>'
23497 in the diagnostic is not really useful to the user. */
23499 if (cfun
&& auto_node
== current_function_auto_return_pattern
23500 && LAMBDA_FUNCTION_P (current_function_decl
))
23501 error ("unable to deduce lambda return type from %qE", init
);
23503 error ("unable to deduce %qT from %qE", type
, init
);
23505 return error_mark_node
;
23509 /* If the list of declarators contains more than one declarator, the type
23510 of each declared variable is determined as described above. If the
23511 type deduced for the template parameter U is not the same in each
23512 deduction, the program is ill-formed. */
23513 if (TREE_TYPE (auto_node
)
23514 && !same_type_p (TREE_TYPE (auto_node
), TREE_VEC_ELT (targs
, 0)))
23516 if (cfun
&& auto_node
== current_function_auto_return_pattern
23517 && LAMBDA_FUNCTION_P (current_function_decl
))
23518 error ("inconsistent types %qT and %qT deduced for "
23519 "lambda return type", TREE_TYPE (auto_node
),
23520 TREE_VEC_ELT (targs
, 0));
23522 error ("inconsistent deduction for %qT: %qT and then %qT",
23523 auto_node
, TREE_TYPE (auto_node
), TREE_VEC_ELT (targs
, 0));
23524 return error_mark_node
;
23526 if (context
!= adc_requirement
)
23527 TREE_TYPE (auto_node
) = TREE_VEC_ELT (targs
, 0);
23529 /* Check any placeholder constraints against the deduced type. */
23530 if (flag_concepts
&& !processing_template_decl
)
23531 if (tree constr
= PLACEHOLDER_TYPE_CONSTRAINTS (auto_node
))
23533 /* Use the deduced type to check the associated constraints. */
23534 if (!constraints_satisfied_p (constr
, targs
))
23536 if (complain
& tf_warning_or_error
)
23540 case adc_unspecified
:
23541 error("placeholder constraints not satisfied");
23543 case adc_variable_type
:
23544 error ("deduced initializer does not satisfy "
23545 "placeholder constraints");
23547 case adc_return_type
:
23548 error ("deduced return type does not satisfy "
23549 "placeholder constraints");
23551 case adc_requirement
:
23552 error ("deduced expression type does not saatisy "
23553 "placeholder constraints");
23556 diagnose_constraints (input_location
, constr
, targs
);
23558 return error_mark_node
;
23562 if (processing_template_decl
)
23563 targs
= add_to_template_args (current_template_args (), targs
);
23564 return tsubst (type
, targs
, complain
, NULL_TREE
);
23567 /* Substitutes LATE_RETURN_TYPE for 'auto' in TYPE and returns the
23571 splice_late_return_type (tree type
, tree late_return_type
)
23573 if (is_auto (type
))
23575 if (late_return_type
)
23576 return late_return_type
;
23578 tree idx
= get_template_parm_index (type
);
23579 if (TEMPLATE_PARM_LEVEL (idx
) <= processing_template_decl
)
23580 /* In an abbreviated function template we didn't know we were dealing
23581 with a function template when we saw the auto return type, so update
23582 it to have the correct level. */
23583 return make_auto_1 (TYPE_IDENTIFIER (type
));
23588 /* Returns true iff TYPE is a TEMPLATE_TYPE_PARM representing 'auto' or
23589 'decltype(auto)'. */
23592 is_auto (const_tree type
)
23594 if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
23595 && (TYPE_IDENTIFIER (type
) == get_identifier ("auto")
23596 || TYPE_IDENTIFIER (type
) == get_identifier ("decltype(auto)")))
23602 /* Returns the TEMPLATE_TYPE_PARM in TYPE representing `auto' iff TYPE contains
23603 a use of `auto'. Returns NULL_TREE otherwise. */
23606 type_uses_auto (tree type
)
23608 return find_type_usage (type
, is_auto
);
23611 /* Returns true iff TYPE is a TEMPLATE_TYPE_PARM representing 'auto',
23612 'decltype(auto)' or a concept. */
23615 is_auto_or_concept (const_tree type
)
23617 return is_auto (type
); // or concept
23620 /* Returns the TEMPLATE_TYPE_PARM in TYPE representing a generic type (`auto' or
23621 a concept identifier) iff TYPE contains a use of a generic type. Returns
23622 NULL_TREE otherwise. */
23625 type_uses_auto_or_concept (tree type
)
23627 return find_type_usage (type
, is_auto_or_concept
);
23631 /* For a given template T, return the vector of typedefs referenced
23632 in T for which access check is needed at T instantiation time.
23633 T is either a FUNCTION_DECL or a RECORD_TYPE.
23634 Those typedefs were added to T by the function
23635 append_type_to_template_for_access_check. */
23637 vec
<qualified_typedef_usage_t
, va_gc
> *
23638 get_types_needing_access_check (tree t
)
23641 vec
<qualified_typedef_usage_t
, va_gc
> *result
= NULL
;
23643 if (!t
|| t
== error_mark_node
)
23646 if (!(ti
= get_template_info (t
)))
23649 if (CLASS_TYPE_P (t
)
23650 || TREE_CODE (t
) == FUNCTION_DECL
)
23652 if (!TI_TEMPLATE (ti
))
23655 result
= TI_TYPEDEFS_NEEDING_ACCESS_CHECKING (ti
);
23661 /* Append the typedef TYPE_DECL used in template T to a list of typedefs
23662 tied to T. That list of typedefs will be access checked at
23663 T instantiation time.
23664 T is either a FUNCTION_DECL or a RECORD_TYPE.
23665 TYPE_DECL is a TYPE_DECL node representing a typedef.
23666 SCOPE is the scope through which TYPE_DECL is accessed.
23667 LOCATION is the location of the usage point of TYPE_DECL.
23669 This function is a subroutine of
23670 append_type_to_template_for_access_check. */
23673 append_type_to_template_for_access_check_1 (tree t
,
23676 location_t location
)
23678 qualified_typedef_usage_t typedef_usage
;
23681 if (!t
|| t
== error_mark_node
)
23684 gcc_assert ((TREE_CODE (t
) == FUNCTION_DECL
23685 || CLASS_TYPE_P (t
))
23687 && TREE_CODE (type_decl
) == TYPE_DECL
23690 if (!(ti
= get_template_info (t
)))
23693 gcc_assert (TI_TEMPLATE (ti
));
23695 typedef_usage
.typedef_decl
= type_decl
;
23696 typedef_usage
.context
= scope
;
23697 typedef_usage
.locus
= location
;
23699 vec_safe_push (TI_TYPEDEFS_NEEDING_ACCESS_CHECKING (ti
), typedef_usage
);
23702 /* Append TYPE_DECL to the template TEMPL.
23703 TEMPL is either a class type, a FUNCTION_DECL or a a TEMPLATE_DECL.
23704 At TEMPL instanciation time, TYPE_DECL will be checked to see
23705 if it can be accessed through SCOPE.
23706 LOCATION is the location of the usage point of TYPE_DECL.
23708 e.g. consider the following code snippet:
23715 template<class U> struct S
23717 C::myint mi; // <-- usage point of the typedef C::myint
23722 At S<char> instantiation time, we need to check the access of C::myint
23723 In other words, we need to check the access of the myint typedef through
23724 the C scope. For that purpose, this function will add the myint typedef
23725 and the scope C through which its being accessed to a list of typedefs
23726 tied to the template S. That list will be walked at template instantiation
23727 time and access check performed on each typedefs it contains.
23728 Note that this particular code snippet should yield an error because
23729 myint is private to C. */
23732 append_type_to_template_for_access_check (tree templ
,
23735 location_t location
)
23737 qualified_typedef_usage_t
*iter
;
23740 gcc_assert (type_decl
&& (TREE_CODE (type_decl
) == TYPE_DECL
));
23742 /* Make sure we don't append the type to the template twice. */
23743 FOR_EACH_VEC_SAFE_ELT (get_types_needing_access_check (templ
), i
, iter
)
23744 if (iter
->typedef_decl
== type_decl
&& scope
== iter
->context
)
23747 append_type_to_template_for_access_check_1 (templ
, type_decl
,
23751 /* Convert the generic type parameters in PARM that match the types given in the
23752 range [START_IDX, END_IDX) from the current_template_parms into generic type
23756 convert_generic_types_to_packs (tree parm
, int start_idx
, int end_idx
)
23758 tree current
= current_template_parms
;
23759 int depth
= TMPL_PARMS_DEPTH (current
);
23760 current
= INNERMOST_TEMPLATE_PARMS (current
);
23761 tree replacement
= make_tree_vec (TREE_VEC_LENGTH (current
));
23763 for (int i
= 0; i
< start_idx
; ++i
)
23764 TREE_VEC_ELT (replacement
, i
)
23765 = TREE_TYPE (TREE_VALUE (TREE_VEC_ELT (current
, i
)));
23767 for (int i
= start_idx
; i
< end_idx
; ++i
)
23769 /* Create a distinct parameter pack type from the current parm and add it
23770 to the replacement args to tsubst below into the generic function
23773 tree o
= TREE_TYPE (TREE_VALUE
23774 (TREE_VEC_ELT (current
, i
)));
23775 tree t
= copy_type (o
);
23776 TEMPLATE_TYPE_PARM_INDEX (t
)
23777 = reduce_template_parm_level (TEMPLATE_TYPE_PARM_INDEX (o
),
23779 TREE_TYPE (TEMPLATE_TYPE_DECL (t
)) = t
;
23780 TYPE_STUB_DECL (t
) = TYPE_NAME (t
) = TEMPLATE_TYPE_DECL (t
);
23781 TYPE_MAIN_VARIANT (t
) = t
;
23782 TEMPLATE_TYPE_PARAMETER_PACK (t
) = true;
23783 TYPE_CANONICAL (t
) = canonical_type_parameter (t
);
23784 TREE_VEC_ELT (replacement
, i
) = t
;
23785 TREE_VALUE (TREE_VEC_ELT (current
, i
)) = TREE_CHAIN (t
);
23788 for (int i
= end_idx
, e
= TREE_VEC_LENGTH (current
); i
< e
; ++i
)
23789 TREE_VEC_ELT (replacement
, i
)
23790 = TREE_TYPE (TREE_VALUE (TREE_VEC_ELT (current
, i
)));
23792 /* If there are more levels then build up the replacement with the outer
23795 replacement
= add_to_template_args (template_parms_to_args
23796 (TREE_CHAIN (current_template_parms
)),
23799 return tsubst (parm
, replacement
, tf_none
, NULL_TREE
);
23802 /* Entries in the decl_constraint hash table. */
23803 struct GTY((for_user
)) constr_entry
23809 /* Hashing function and equality for constraint entries. */
23810 struct constr_hasher
: ggc_ptr_hash
<constr_entry
>
23812 static hashval_t
hash (constr_entry
*e
)
23814 return (hashval_t
)DECL_UID (e
->decl
);
23817 static bool equal (constr_entry
*e1
, constr_entry
*e2
)
23819 return e1
->decl
== e2
->decl
;
23823 /* A mapping from declarations to constraint information. Note that
23824 both templates and their underlying declarations are mapped to the
23825 same constraint information.
23827 FIXME: This is defined in pt.c because garbage collection
23828 code is not being generated for constraint.cc. */
23830 static GTY (()) hash_table
<constr_hasher
> *decl_constraints
;
23832 /* Returns true iff cinfo contains a valid set of constraints.
23833 This is the case when the associated requirements have been
23834 successfully decomposed into lists of atomic constraints.
23835 That is, when the saved assumptions are not error_mark_node. */
23838 valid_constraints_p (tree cinfo
)
23840 gcc_assert (cinfo
);
23841 return CI_ASSUMPTIONS (cinfo
) != error_mark_node
;
23844 /* Returns the template constraints of declaration T. If T is not
23845 constrained, return NULL_TREE. Note that T must be non-null. */
23848 get_constraints (tree t
)
23850 gcc_assert (DECL_P (t
));
23851 if (TREE_CODE (t
) == TEMPLATE_DECL
)
23852 t
= DECL_TEMPLATE_RESULT (t
);
23853 constr_entry elt
= { t
, NULL_TREE
};
23854 constr_entry
* found
= decl_constraints
->find (&elt
);
23861 /* Associate the given constraint information CI with the declaration
23862 T. If T is a template, then the constraints are associated with
23863 its underlying declaration. Don't build associations if CI is
23867 set_constraints (tree t
, tree ci
)
23872 if (TREE_CODE (t
) == TEMPLATE_DECL
)
23873 t
= DECL_TEMPLATE_RESULT (t
);
23874 gcc_assert (!get_constraints (t
));
23875 constr_entry elt
= {t
, ci
};
23876 constr_entry
** slot
= decl_constraints
->find_slot (&elt
, INSERT
);
23877 constr_entry
* entry
= ggc_alloc
<constr_entry
> ();
23882 /* Remove the associated constraints of the declaration T. */
23885 remove_constraints (tree t
)
23887 gcc_assert (DECL_P (t
));
23888 if (TREE_CODE (t
) == TEMPLATE_DECL
)
23889 t
= DECL_TEMPLATE_RESULT (t
);
23891 constr_entry elt
= {t
, NULL_TREE
};
23892 constr_entry
** slot
= decl_constraints
->find_slot (&elt
, NO_INSERT
);
23894 decl_constraints
->clear_slot (slot
);
23897 /* Set up the hash table for constraint association. */
23900 init_constraint_processing (void)
23902 decl_constraints
= hash_table
<constr_hasher
>::create_ggc(37);
23905 /* Set up the hash tables for template instantiations. */
23908 init_template_processing (void)
23910 decl_specializations
= hash_table
<spec_hasher
>::create_ggc (37);
23911 type_specializations
= hash_table
<spec_hasher
>::create_ggc (37);
23914 /* Print stats about the template hash tables for -fstats. */
23917 print_template_statistics (void)
23919 fprintf (stderr
, "decl_specializations: size %ld, %ld elements, "
23920 "%f collisions\n", (long) decl_specializations
->size (),
23921 (long) decl_specializations
->elements (),
23922 decl_specializations
->collisions ());
23923 fprintf (stderr
, "type_specializations: size %ld, %ld elements, "
23924 "%f collisions\n", (long) type_specializations
->size (),
23925 (long) type_specializations
->elements (),
23926 type_specializations
->collisions ());
23929 #include "gt-cp-pt.h"