1 /* Handle parameterized types (templates) for GNU -*- C++ -*-.
2 Copyright (C) 1992-2015 Free Software Foundation, Inc.
3 Written by Ken Raeburn (raeburn@cygnus.com) while at Watchmaker Computing.
4 Rewritten by Jason Merrill (jason@cygnus.com).
6 This file is part of GCC.
8 GCC is free software; you can redistribute it and/or modify
9 it under the terms of the GNU General Public License as published by
10 the Free Software Foundation; either version 3, or (at your option)
13 GCC is distributed in the hope that it will be useful,
14 but WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 GNU General Public License for more details.
18 You should have received a copy of the GNU General Public License
19 along with GCC; see the file COPYING3. If not see
20 <http://www.gnu.org/licenses/>. */
22 /* Known bugs or deficiencies include:
24 all methods must be provided in header files; can't use a source
25 file that contains only the method templates and "just win". */
29 #include "coretypes.h"
33 #include "stringpool.h"
36 #include "stor-layout.h"
40 #include "c-family/c-common.h"
41 #include "c-family/c-objc.h"
42 #include "cp-objcp-common.h"
43 #include "tree-inline.h"
47 #include "tree-iterator.h"
48 #include "type-utils.h"
51 /* The type of functions taking a tree, and some additional data, and
53 typedef int (*tree_fn_t
) (tree
, void*);
55 /* The PENDING_TEMPLATES is a TREE_LIST of templates whose
56 instantiations have been deferred, either because their definitions
57 were not yet available, or because we were putting off doing the work. */
58 struct GTY ((chain_next ("%h.next"))) pending_template
{
59 struct pending_template
*next
;
60 struct tinst_level
*tinst
;
63 static GTY(()) struct pending_template
*pending_templates
;
64 static GTY(()) struct pending_template
*last_pending_template
;
66 int processing_template_parmlist
;
67 static int template_header_count
;
69 static GTY(()) tree saved_trees
;
70 static vec
<int> inline_parm_levels
;
72 static GTY(()) struct tinst_level
*current_tinst_level
;
74 static GTY(()) tree saved_access_scope
;
76 /* Live only within one (recursive) call to tsubst_expr. We use
77 this to pass the statement expression node from the STMT_EXPR
78 to the EXPR_STMT that is its result. */
79 static tree cur_stmt_expr
;
81 // -------------------------------------------------------------------------- //
82 // Local Specialization Stack
84 // Implementation of the RAII helper for creating new local
86 local_specialization_stack::local_specialization_stack ()
87 : saved (local_specializations
)
89 local_specializations
= new hash_map
<tree
, tree
>;
92 local_specialization_stack::~local_specialization_stack ()
94 delete local_specializations
;
95 local_specializations
= saved
;
98 /* True if we've recursed into fn_type_unification too many times. */
99 static bool excessive_deduction_depth
;
101 struct GTY((for_user
)) spec_entry
108 struct spec_hasher
: ggc_ptr_hash
<spec_entry
>
110 static hashval_t
hash (spec_entry
*);
111 static bool equal (spec_entry
*, spec_entry
*);
114 static GTY (()) hash_table
<spec_hasher
> *decl_specializations
;
116 static GTY (()) hash_table
<spec_hasher
> *type_specializations
;
118 /* Contains canonical template parameter types. The vector is indexed by
119 the TEMPLATE_TYPE_IDX of the template parameter. Each element is a
120 TREE_LIST, whose TREE_VALUEs contain the canonical template
121 parameters of various types and levels. */
122 static GTY(()) vec
<tree
, va_gc
> *canonical_template_parms
;
124 #define UNIFY_ALLOW_NONE 0
125 #define UNIFY_ALLOW_MORE_CV_QUAL 1
126 #define UNIFY_ALLOW_LESS_CV_QUAL 2
127 #define UNIFY_ALLOW_DERIVED 4
128 #define UNIFY_ALLOW_INTEGER 8
129 #define UNIFY_ALLOW_OUTER_LEVEL 16
130 #define UNIFY_ALLOW_OUTER_MORE_CV_QUAL 32
131 #define UNIFY_ALLOW_OUTER_LESS_CV_QUAL 64
133 enum template_base_result
{
135 tbr_ambiguous_baseclass
,
139 static void push_access_scope (tree
);
140 static void pop_access_scope (tree
);
141 static bool resolve_overloaded_unification (tree
, tree
, tree
, tree
,
142 unification_kind_t
, int,
144 static int try_one_overload (tree
, tree
, tree
, tree
, tree
,
145 unification_kind_t
, int, bool, bool);
146 static int unify (tree
, tree
, tree
, tree
, int, bool);
147 static void add_pending_template (tree
);
148 static tree
reopen_tinst_level (struct tinst_level
*);
149 static tree
tsubst_initializer_list (tree
, tree
);
150 static tree
get_partial_spec_bindings (tree
, tree
, tree
, tree
);
151 static tree
coerce_template_parms (tree
, tree
, tree
, tsubst_flags_t
,
153 static tree
coerce_innermost_template_parms (tree
, tree
, tree
, tsubst_flags_t
,
155 static void tsubst_enum (tree
, tree
, tree
);
156 static tree
add_to_template_args (tree
, tree
);
157 static tree
add_outermost_template_args (tree
, tree
);
158 static bool check_instantiated_args (tree
, tree
, tsubst_flags_t
);
159 static int maybe_adjust_types_for_deduction (unification_kind_t
, tree
*, tree
*,
161 static int type_unification_real (tree
, tree
, tree
, const tree
*,
162 unsigned int, int, unification_kind_t
, int,
163 vec
<deferred_access_check
, va_gc
> **,
165 static void note_template_header (int);
166 static tree
convert_nontype_argument_function (tree
, tree
, tsubst_flags_t
);
167 static tree
convert_nontype_argument (tree
, tree
, tsubst_flags_t
);
168 static tree
convert_template_argument (tree
, tree
, tree
,
169 tsubst_flags_t
, int, tree
);
170 static int for_each_template_parm (tree
, tree_fn_t
, void*,
171 hash_set
<tree
> *, bool);
172 static tree
expand_template_argument_pack (tree
);
173 static tree
build_template_parm_index (int, int, int, tree
, tree
);
174 static bool inline_needs_template_parms (tree
, bool);
175 static void push_inline_template_parms_recursive (tree
, int);
176 static tree
reduce_template_parm_level (tree
, tree
, int, tree
, tsubst_flags_t
);
177 static int mark_template_parm (tree
, void *);
178 static int template_parm_this_level_p (tree
, void *);
179 static tree
tsubst_friend_function (tree
, tree
);
180 static tree
tsubst_friend_class (tree
, tree
);
181 static int can_complete_type_without_circularity (tree
);
182 static tree
get_bindings (tree
, tree
, tree
, bool);
183 static int template_decl_level (tree
);
184 static int check_cv_quals_for_unify (int, tree
, tree
);
185 static void template_parm_level_and_index (tree
, int*, int*);
186 static int unify_pack_expansion (tree
, tree
, tree
,
187 tree
, unification_kind_t
, bool, bool);
188 static tree
tsubst_template_arg (tree
, tree
, tsubst_flags_t
, tree
);
189 static tree
tsubst_template_args (tree
, tree
, tsubst_flags_t
, tree
);
190 static tree
tsubst_template_parms (tree
, tree
, tsubst_flags_t
);
191 static void regenerate_decl_from_template (tree
, tree
);
192 static tree
most_specialized_partial_spec (tree
, tsubst_flags_t
);
193 static tree
tsubst_aggr_type (tree
, tree
, tsubst_flags_t
, tree
, int);
194 static tree
tsubst_arg_types (tree
, tree
, tree
, tsubst_flags_t
, tree
);
195 static tree
tsubst_function_type (tree
, tree
, tsubst_flags_t
, tree
);
196 static bool check_specialization_scope (void);
197 static tree
process_partial_specialization (tree
);
198 static void set_current_access_from_decl (tree
);
199 static enum template_base_result
get_template_base (tree
, tree
, tree
, tree
,
201 static tree
try_class_unification (tree
, tree
, tree
, tree
, bool);
202 static int coerce_template_template_parms (tree
, tree
, tsubst_flags_t
,
204 static bool template_template_parm_bindings_ok_p (tree
, tree
);
205 static int template_args_equal (tree
, tree
);
206 static void tsubst_default_arguments (tree
, tsubst_flags_t
);
207 static tree
for_each_template_parm_r (tree
*, int *, void *);
208 static tree
copy_default_args_to_explicit_spec_1 (tree
, tree
);
209 static void copy_default_args_to_explicit_spec (tree
);
210 static int invalid_nontype_parm_type_p (tree
, tsubst_flags_t
);
211 static bool dependent_template_arg_p (tree
);
212 static bool any_template_arguments_need_structural_equality_p (tree
);
213 static bool dependent_type_p_r (tree
);
214 static tree
tsubst_copy (tree
, tree
, tsubst_flags_t
, tree
);
215 static tree
tsubst_decl (tree
, tree
, tsubst_flags_t
);
216 static void perform_typedefs_access_check (tree tmpl
, tree targs
);
217 static void append_type_to_template_for_access_check_1 (tree
, tree
, tree
,
219 static tree
listify (tree
);
220 static tree
listify_autos (tree
, tree
);
221 static tree
tsubst_template_parm (tree
, tree
, tsubst_flags_t
);
222 static tree
instantiate_alias_template (tree
, tree
, tsubst_flags_t
);
223 static bool complex_alias_template_p (const_tree tmpl
);
225 /* Make the current scope suitable for access checking when we are
226 processing T. T can be FUNCTION_DECL for instantiated function
227 template, VAR_DECL for static member variable, or TYPE_DECL for
228 alias template (needed by instantiate_decl). */
231 push_access_scope (tree t
)
233 gcc_assert (VAR_OR_FUNCTION_DECL_P (t
)
234 || TREE_CODE (t
) == TYPE_DECL
);
236 if (DECL_FRIEND_CONTEXT (t
))
237 push_nested_class (DECL_FRIEND_CONTEXT (t
));
238 else if (DECL_CLASS_SCOPE_P (t
))
239 push_nested_class (DECL_CONTEXT (t
));
241 push_to_top_level ();
243 if (TREE_CODE (t
) == FUNCTION_DECL
)
245 saved_access_scope
= tree_cons
246 (NULL_TREE
, current_function_decl
, saved_access_scope
);
247 current_function_decl
= t
;
251 /* Restore the scope set up by push_access_scope. T is the node we
255 pop_access_scope (tree t
)
257 if (TREE_CODE (t
) == FUNCTION_DECL
)
259 current_function_decl
= TREE_VALUE (saved_access_scope
);
260 saved_access_scope
= TREE_CHAIN (saved_access_scope
);
263 if (DECL_FRIEND_CONTEXT (t
) || DECL_CLASS_SCOPE_P (t
))
266 pop_from_top_level ();
269 /* Do any processing required when DECL (a member template
270 declaration) is finished. Returns the TEMPLATE_DECL corresponding
271 to DECL, unless it is a specialization, in which case the DECL
272 itself is returned. */
275 finish_member_template_decl (tree decl
)
277 if (decl
== error_mark_node
)
278 return error_mark_node
;
280 gcc_assert (DECL_P (decl
));
282 if (TREE_CODE (decl
) == TYPE_DECL
)
286 type
= TREE_TYPE (decl
);
287 if (type
== error_mark_node
)
288 return error_mark_node
;
289 if (MAYBE_CLASS_TYPE_P (type
)
290 && CLASSTYPE_TEMPLATE_INFO (type
)
291 && !CLASSTYPE_TEMPLATE_SPECIALIZATION (type
))
293 tree tmpl
= CLASSTYPE_TI_TEMPLATE (type
);
294 check_member_template (tmpl
);
299 else if (TREE_CODE (decl
) == FIELD_DECL
)
300 error ("data member %qD cannot be a member template", decl
);
301 else if (DECL_TEMPLATE_INFO (decl
))
303 if (!DECL_TEMPLATE_SPECIALIZATION (decl
))
305 check_member_template (DECL_TI_TEMPLATE (decl
));
306 return DECL_TI_TEMPLATE (decl
);
312 error ("invalid member template declaration %qD", decl
);
314 return error_mark_node
;
317 /* Create a template info node. */
320 build_template_info (tree template_decl
, tree template_args
)
322 tree result
= make_node (TEMPLATE_INFO
);
323 TI_TEMPLATE (result
) = template_decl
;
324 TI_ARGS (result
) = template_args
;
328 /* Return the template info node corresponding to T, whatever T is. */
331 get_template_info (const_tree t
)
333 tree tinfo
= NULL_TREE
;
335 if (!t
|| t
== error_mark_node
)
338 if (TREE_CODE (t
) == NAMESPACE_DECL
)
341 if (DECL_P (t
) && DECL_LANG_SPECIFIC (t
))
342 tinfo
= DECL_TEMPLATE_INFO (t
);
344 if (!tinfo
&& DECL_IMPLICIT_TYPEDEF_P (t
))
347 if (OVERLOAD_TYPE_P (t
))
348 tinfo
= TYPE_TEMPLATE_INFO (t
);
349 else if (TREE_CODE (t
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
350 tinfo
= TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (t
);
355 /* Returns the template nesting level of the indicated class TYPE.
365 A<T>::B<U> has depth two, while A<T> has depth one.
366 Both A<T>::B<int> and A<int>::B<U> have depth one, if
367 they are instantiations, not specializations.
369 This function is guaranteed to return 0 if passed NULL_TREE so
370 that, for example, `template_class_depth (current_class_type)' is
374 template_class_depth (tree type
)
379 type
&& TREE_CODE (type
) != NAMESPACE_DECL
;
380 type
= (TREE_CODE (type
) == FUNCTION_DECL
)
381 ? CP_DECL_CONTEXT (type
) : CP_TYPE_CONTEXT (type
))
383 tree tinfo
= get_template_info (type
);
385 if (tinfo
&& PRIMARY_TEMPLATE_P (TI_TEMPLATE (tinfo
))
386 && uses_template_parms (INNERMOST_TEMPLATE_ARGS (TI_ARGS (tinfo
))))
393 /* Subroutine of maybe_begin_member_template_processing.
394 Returns true if processing DECL needs us to push template parms. */
397 inline_needs_template_parms (tree decl
, bool nsdmi
)
399 if (!decl
|| (!nsdmi
&& ! DECL_TEMPLATE_INFO (decl
)))
402 return (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (most_general_template (decl
)))
403 > (processing_template_decl
+ DECL_TEMPLATE_SPECIALIZATION (decl
)));
406 /* Subroutine of maybe_begin_member_template_processing.
407 Push the template parms in PARMS, starting from LEVELS steps into the
408 chain, and ending at the beginning, since template parms are listed
412 push_inline_template_parms_recursive (tree parmlist
, int levels
)
414 tree parms
= TREE_VALUE (parmlist
);
418 push_inline_template_parms_recursive (TREE_CHAIN (parmlist
), levels
- 1);
420 ++processing_template_decl
;
421 current_template_parms
422 = tree_cons (size_int (processing_template_decl
),
423 parms
, current_template_parms
);
424 TEMPLATE_PARMS_FOR_INLINE (current_template_parms
) = 1;
426 begin_scope (TREE_VEC_LENGTH (parms
) ? sk_template_parms
: sk_template_spec
,
428 for (i
= 0; i
< TREE_VEC_LENGTH (parms
); ++i
)
430 tree parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
432 if (error_operand_p (parm
))
435 gcc_assert (DECL_P (parm
));
437 switch (TREE_CODE (parm
))
446 /* Make a CONST_DECL as is done in process_template_parm.
447 It is ugly that we recreate this here; the original
448 version built in process_template_parm is no longer
450 tree decl
= build_decl (DECL_SOURCE_LOCATION (parm
),
451 CONST_DECL
, DECL_NAME (parm
),
453 DECL_ARTIFICIAL (decl
) = 1;
454 TREE_CONSTANT (decl
) = 1;
455 TREE_READONLY (decl
) = 1;
456 DECL_INITIAL (decl
) = DECL_INITIAL (parm
);
457 SET_DECL_TEMPLATE_PARM_P (decl
);
468 /* Restore the template parameter context for a member template, a
469 friend template defined in a class definition, or a non-template
470 member of template class. */
473 maybe_begin_member_template_processing (tree decl
)
477 bool nsdmi
= TREE_CODE (decl
) == FIELD_DECL
;
481 tree ctx
= DECL_CONTEXT (decl
);
482 decl
= (CLASSTYPE_TEMPLATE_INFO (ctx
)
483 /* Disregard full specializations (c++/60999). */
484 && uses_template_parms (ctx
)
485 ? CLASSTYPE_TI_TEMPLATE (ctx
) : NULL_TREE
);
488 if (inline_needs_template_parms (decl
, nsdmi
))
490 parms
= DECL_TEMPLATE_PARMS (most_general_template (decl
));
491 levels
= TMPL_PARMS_DEPTH (parms
) - processing_template_decl
;
493 if (DECL_TEMPLATE_SPECIALIZATION (decl
))
496 parms
= TREE_CHAIN (parms
);
499 push_inline_template_parms_recursive (parms
, levels
);
502 /* Remember how many levels of template parameters we pushed so that
503 we can pop them later. */
504 inline_parm_levels
.safe_push (levels
);
507 /* Undo the effects of maybe_begin_member_template_processing. */
510 maybe_end_member_template_processing (void)
515 if (inline_parm_levels
.length () == 0)
518 last
= inline_parm_levels
.pop ();
519 for (i
= 0; i
< last
; ++i
)
521 --processing_template_decl
;
522 current_template_parms
= TREE_CHAIN (current_template_parms
);
527 /* Return a new template argument vector which contains all of ARGS,
528 but has as its innermost set of arguments the EXTRA_ARGS. */
531 add_to_template_args (tree args
, tree extra_args
)
538 if (args
== NULL_TREE
|| extra_args
== error_mark_node
)
541 extra_depth
= TMPL_ARGS_DEPTH (extra_args
);
542 new_args
= make_tree_vec (TMPL_ARGS_DEPTH (args
) + extra_depth
);
544 for (i
= 1; i
<= TMPL_ARGS_DEPTH (args
); ++i
)
545 SET_TMPL_ARGS_LEVEL (new_args
, i
, TMPL_ARGS_LEVEL (args
, i
));
547 for (j
= 1; j
<= extra_depth
; ++j
, ++i
)
548 SET_TMPL_ARGS_LEVEL (new_args
, i
, TMPL_ARGS_LEVEL (extra_args
, j
));
553 /* Like add_to_template_args, but only the outermost ARGS are added to
554 the EXTRA_ARGS. In particular, all but TMPL_ARGS_DEPTH
555 (EXTRA_ARGS) levels are added. This function is used to combine
556 the template arguments from a partial instantiation with the
557 template arguments used to attain the full instantiation from the
558 partial instantiation. */
561 add_outermost_template_args (tree args
, tree extra_args
)
565 /* If there are more levels of EXTRA_ARGS than there are ARGS,
566 something very fishy is going on. */
567 gcc_assert (TMPL_ARGS_DEPTH (args
) >= TMPL_ARGS_DEPTH (extra_args
));
569 /* If *all* the new arguments will be the EXTRA_ARGS, just return
571 if (TMPL_ARGS_DEPTH (args
) == TMPL_ARGS_DEPTH (extra_args
))
574 /* For the moment, we make ARGS look like it contains fewer levels. */
575 TREE_VEC_LENGTH (args
) -= TMPL_ARGS_DEPTH (extra_args
);
577 new_args
= add_to_template_args (args
, extra_args
);
579 /* Now, we restore ARGS to its full dimensions. */
580 TREE_VEC_LENGTH (args
) += TMPL_ARGS_DEPTH (extra_args
);
585 /* Return the N levels of innermost template arguments from the ARGS. */
588 get_innermost_template_args (tree args
, int n
)
596 /* If N is 1, just return the innermost set of template arguments. */
598 return TMPL_ARGS_LEVEL (args
, TMPL_ARGS_DEPTH (args
));
600 /* If we're not removing anything, just return the arguments we were
602 extra_levels
= TMPL_ARGS_DEPTH (args
) - n
;
603 gcc_assert (extra_levels
>= 0);
604 if (extra_levels
== 0)
607 /* Make a new set of arguments, not containing the outer arguments. */
608 new_args
= make_tree_vec (n
);
609 for (i
= 1; i
<= n
; ++i
)
610 SET_TMPL_ARGS_LEVEL (new_args
, i
,
611 TMPL_ARGS_LEVEL (args
, i
+ extra_levels
));
616 /* The inverse of get_innermost_template_args: Return all but the innermost
617 EXTRA_LEVELS levels of template arguments from the ARGS. */
620 strip_innermost_template_args (tree args
, int extra_levels
)
623 int n
= TMPL_ARGS_DEPTH (args
) - extra_levels
;
628 /* If N is 1, just return the outermost set of template arguments. */
630 return TMPL_ARGS_LEVEL (args
, 1);
632 /* If we're not removing anything, just return the arguments we were
634 gcc_assert (extra_levels
>= 0);
635 if (extra_levels
== 0)
638 /* Make a new set of arguments, not containing the inner arguments. */
639 new_args
= make_tree_vec (n
);
640 for (i
= 1; i
<= n
; ++i
)
641 SET_TMPL_ARGS_LEVEL (new_args
, i
,
642 TMPL_ARGS_LEVEL (args
, i
));
647 /* We've got a template header coming up; push to a new level for storing
651 begin_template_parm_list (void)
653 /* We use a non-tag-transparent scope here, which causes pushtag to
654 put tags in this scope, rather than in the enclosing class or
655 namespace scope. This is the right thing, since we want
656 TEMPLATE_DECLS, and not TYPE_DECLS for template classes. For a
657 global template class, push_template_decl handles putting the
658 TEMPLATE_DECL into top-level scope. For a nested template class,
661 template <class T> struct S1 {
662 template <class T> struct S2 {};
665 pushtag contains special code to call pushdecl_with_scope on the
666 TEMPLATE_DECL for S2. */
667 begin_scope (sk_template_parms
, NULL
);
668 ++processing_template_decl
;
669 ++processing_template_parmlist
;
670 note_template_header (0);
672 /* Add a dummy parameter level while we process the parameter list. */
673 current_template_parms
674 = tree_cons (size_int (processing_template_decl
),
676 current_template_parms
);
679 /* This routine is called when a specialization is declared. If it is
680 invalid to declare a specialization here, an error is reported and
681 false is returned, otherwise this routine will return true. */
684 check_specialization_scope (void)
686 tree scope
= current_scope ();
690 An explicit specialization shall be declared in the namespace of
691 which the template is a member, or, for member templates, in the
692 namespace of which the enclosing class or enclosing class
693 template is a member. An explicit specialization of a member
694 function, member class or static data member of a class template
695 shall be declared in the namespace of which the class template
697 if (scope
&& TREE_CODE (scope
) != NAMESPACE_DECL
)
699 error ("explicit specialization in non-namespace scope %qD", scope
);
705 In an explicit specialization declaration for a member of a class
706 template or a member template that appears in namespace scope,
707 the member template and some of its enclosing class templates may
708 remain unspecialized, except that the declaration shall not
709 explicitly specialize a class member template if its enclosing
710 class templates are not explicitly specialized as well. */
711 if (current_template_parms
)
713 error ("enclosing class templates are not explicitly specialized");
720 /* We've just seen template <>. */
723 begin_specialization (void)
725 begin_scope (sk_template_spec
, NULL
);
726 note_template_header (1);
727 return check_specialization_scope ();
730 /* Called at then end of processing a declaration preceded by
734 end_specialization (void)
737 reset_specialization ();
740 /* Any template <>'s that we have seen thus far are not referring to a
741 function specialization. */
744 reset_specialization (void)
746 processing_specialization
= 0;
747 template_header_count
= 0;
750 /* We've just seen a template header. If SPECIALIZATION is nonzero,
751 it was of the form template <>. */
754 note_template_header (int specialization
)
756 processing_specialization
= specialization
;
757 template_header_count
++;
760 /* We're beginning an explicit instantiation. */
763 begin_explicit_instantiation (void)
765 gcc_assert (!processing_explicit_instantiation
);
766 processing_explicit_instantiation
= true;
771 end_explicit_instantiation (void)
773 gcc_assert (processing_explicit_instantiation
);
774 processing_explicit_instantiation
= false;
777 /* An explicit specialization or partial specialization of TMPL is being
778 declared. Check that the namespace in which the specialization is
779 occurring is permissible. Returns false iff it is invalid to
780 specialize TMPL in the current namespace. */
783 check_specialization_namespace (tree tmpl
)
785 tree tpl_ns
= decl_namespace_context (tmpl
);
789 An explicit specialization shall be declared in the namespace of
790 which the template is a member, or, for member templates, in the
791 namespace of which the enclosing class or enclosing class
792 template is a member. An explicit specialization of a member
793 function, member class or static data member of a class template
794 shall be declared in the namespace of which the class template is
796 if (current_scope() != DECL_CONTEXT (tmpl
)
797 && !at_namespace_scope_p ())
799 error ("specialization of %qD must appear at namespace scope", tmpl
);
802 if (is_associated_namespace (current_namespace
, tpl_ns
))
803 /* Same or super-using namespace. */
807 permerror (input_location
,
808 "specialization of %qD in different namespace", tmpl
);
809 permerror (DECL_SOURCE_LOCATION (tmpl
),
810 " from definition of %q#D", tmpl
);
815 /* SPEC is an explicit instantiation. Check that it is valid to
816 perform this explicit instantiation in the current namespace. */
819 check_explicit_instantiation_namespace (tree spec
)
823 /* DR 275: An explicit instantiation shall appear in an enclosing
824 namespace of its template. */
825 ns
= decl_namespace_context (spec
);
826 if (!is_ancestor (current_namespace
, ns
))
827 permerror (input_location
, "explicit instantiation of %qD in namespace %qD "
828 "(which does not enclose namespace %qD)",
829 spec
, current_namespace
, ns
);
832 // Returns the type of a template specialization only if that
833 // specialization needs to be defined. Otherwise (e.g., if the type has
834 // already been defined), the function returns NULL_TREE.
836 maybe_new_partial_specialization (tree type
)
838 // An implicit instantiation of an incomplete type implies
839 // the definition of a new class template.
841 // template<typename T>
844 // template<typename T>
847 // Here, S<T*> is an implicit instantiation of S whose type
849 if (CLASSTYPE_IMPLICIT_INSTANTIATION (type
) && !COMPLETE_TYPE_P (type
))
852 // It can also be the case that TYPE is a completed specialization.
853 // Continuing the previous example, suppose we also declare:
855 // template<typename T>
856 // requires Integral<T>
859 // Here, S<T*> refers to the specialization S<T*> defined
860 // above. However, we need to differentiate definitions because
861 // we intend to define a new partial specialization. In this case,
862 // we rely on the fact that the constraints are different for
863 // this declaration than that above.
865 // Note that we also get here for injected class names and
866 // late-parsed template definitions. We must ensure that we
867 // do not create new type declarations for those cases.
868 if (flag_concepts
&& CLASSTYPE_TEMPLATE_SPECIALIZATION (type
))
870 tree tmpl
= CLASSTYPE_TI_TEMPLATE (type
);
871 tree args
= CLASSTYPE_TI_ARGS (type
);
873 // If there are no template parameters, this cannot be a new
874 // partial template specializtion?
875 if (!current_template_parms
)
878 // If the constraints are not the same as those of the primary
879 // then, we can probably create a new specialization.
880 tree type_constr
= current_template_constraints ();
882 if (type
== TREE_TYPE (tmpl
))
883 if (tree main_constr
= get_constraints (tmpl
))
884 if (equivalent_constraints (type_constr
, main_constr
))
887 // Also, if there's a pre-existing specialization with matching
888 // constraints, then this also isn't new.
889 tree specs
= DECL_TEMPLATE_SPECIALIZATIONS (tmpl
);
892 tree spec_tmpl
= TREE_VALUE (specs
);
893 tree spec_args
= TREE_PURPOSE (specs
);
894 tree spec_constr
= get_constraints (spec_tmpl
);
895 if (comp_template_args (args
, spec_args
)
896 && equivalent_constraints (type_constr
, spec_constr
))
898 specs
= TREE_CHAIN (specs
);
901 // Create a new type node (and corresponding type decl)
902 // for the newly declared specialization.
903 tree t
= make_class_type (TREE_CODE (type
));
904 CLASSTYPE_DECLARED_CLASS (t
) = CLASSTYPE_DECLARED_CLASS (type
);
905 TYPE_FOR_JAVA (t
) = TYPE_FOR_JAVA (type
);
906 SET_TYPE_TEMPLATE_INFO (t
, build_template_info (tmpl
, args
));
908 /* We only need a separate type node for storing the definition of this
909 partial specialization; uses of S<T*> are unconstrained, so all are
910 equivalent. So keep TYPE_CANONICAL the same. */
911 TYPE_CANONICAL (t
) = TYPE_CANONICAL (type
);
913 // Build the corresponding type decl.
914 tree d
= create_implicit_typedef (DECL_NAME (tmpl
), t
);
915 DECL_CONTEXT (d
) = TYPE_CONTEXT (t
);
916 DECL_SOURCE_LOCATION (d
) = input_location
;
924 /* The TYPE is being declared. If it is a template type, that means it
925 is a partial specialization. Do appropriate error-checking. */
928 maybe_process_partial_specialization (tree type
)
932 if (type
== error_mark_node
)
933 return error_mark_node
;
935 /* A lambda that appears in specialization context is not itself a
937 if (CLASS_TYPE_P (type
) && CLASSTYPE_LAMBDA_EXPR (type
))
940 if (TREE_CODE (type
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
942 error ("name of class shadows template template parameter %qD",
944 return error_mark_node
;
947 context
= TYPE_CONTEXT (type
);
949 if (TYPE_ALIAS_P (type
))
951 if (TYPE_TEMPLATE_INFO (type
)
952 && DECL_ALIAS_TEMPLATE_P (TYPE_TI_TEMPLATE (type
)))
953 error ("specialization of alias template %qD",
954 TYPE_TI_TEMPLATE (type
));
956 error ("explicit specialization of non-template %qT", type
);
957 return error_mark_node
;
959 else if (CLASS_TYPE_P (type
) && CLASSTYPE_USE_TEMPLATE (type
))
961 /* This is for ordinary explicit specialization and partial
962 specialization of a template class such as:
964 template <> class C<int>;
968 template <class T> class C<T*>;
970 Make sure that `C<int>' and `C<T*>' are implicit instantiations. */
972 if (tree t
= maybe_new_partial_specialization (type
))
974 if (!check_specialization_namespace (CLASSTYPE_TI_TEMPLATE (t
))
975 && !at_namespace_scope_p ())
976 return error_mark_node
;
977 SET_CLASSTYPE_TEMPLATE_SPECIALIZATION (t
);
978 DECL_SOURCE_LOCATION (TYPE_MAIN_DECL (t
)) = input_location
;
979 if (processing_template_decl
)
981 tree decl
= push_template_decl (TYPE_MAIN_DECL (t
));
982 if (decl
== error_mark_node
)
983 return error_mark_node
;
984 return TREE_TYPE (decl
);
987 else if (CLASSTYPE_TEMPLATE_INSTANTIATION (type
))
988 error ("specialization of %qT after instantiation", type
);
989 else if (errorcount
&& !processing_specialization
990 && CLASSTYPE_TEMPLATE_SPECIALIZATION (type
)
991 && !uses_template_parms (CLASSTYPE_TI_ARGS (type
)))
992 /* Trying to define a specialization either without a template<> header
993 or in an inappropriate place. We've already given an error, so just
994 bail now so we don't actually define the specialization. */
995 return error_mark_node
;
997 else if (CLASS_TYPE_P (type
)
998 && !CLASSTYPE_USE_TEMPLATE (type
)
999 && CLASSTYPE_TEMPLATE_INFO (type
)
1000 && context
&& CLASS_TYPE_P (context
)
1001 && CLASSTYPE_TEMPLATE_INFO (context
))
1003 /* This is for an explicit specialization of member class
1004 template according to [temp.expl.spec/18]:
1006 template <> template <class U> class C<int>::D;
1008 The context `C<int>' must be an implicit instantiation.
1009 Otherwise this is just a member class template declared
1012 template <> class C<int> { template <class U> class D; };
1013 template <> template <class U> class C<int>::D;
1015 In the first case, `C<int>::D' is a specialization of `C<T>::D'
1016 while in the second case, `C<int>::D' is a primary template
1017 and `C<T>::D' may not exist. */
1019 if (CLASSTYPE_IMPLICIT_INSTANTIATION (context
)
1020 && !COMPLETE_TYPE_P (type
))
1023 tree tmpl
= CLASSTYPE_TI_TEMPLATE (type
);
1025 if (current_namespace
1026 != decl_namespace_context (tmpl
))
1028 permerror (input_location
,
1029 "specializing %q#T in different namespace", type
);
1030 permerror (DECL_SOURCE_LOCATION (tmpl
),
1031 " from definition of %q#D", tmpl
);
1034 /* Check for invalid specialization after instantiation:
1036 template <> template <> class C<int>::D<int>;
1037 template <> template <class U> class C<int>::D; */
1039 for (t
= DECL_TEMPLATE_INSTANTIATIONS (tmpl
);
1040 t
; t
= TREE_CHAIN (t
))
1042 tree inst
= TREE_VALUE (t
);
1043 if (CLASSTYPE_TEMPLATE_SPECIALIZATION (inst
)
1044 || !COMPLETE_OR_OPEN_TYPE_P (inst
))
1046 /* We already have a full specialization of this partial
1047 instantiation, or a full specialization has been
1048 looked up but not instantiated. Reassign it to the
1049 new member specialization template. */
1053 elt
.tmpl
= most_general_template (tmpl
);
1054 elt
.args
= CLASSTYPE_TI_ARGS (inst
);
1057 type_specializations
->remove_elt (&elt
);
1060 elt
.args
= INNERMOST_TEMPLATE_ARGS (elt
.args
);
1063 = type_specializations
->find_slot (&elt
, INSERT
);
1064 entry
= ggc_alloc
<spec_entry
> ();
1069 /* But if we've had an implicit instantiation, that's a
1070 problem ([temp.expl.spec]/6). */
1071 error ("specialization %qT after instantiation %qT",
1075 /* Mark TYPE as a specialization. And as a result, we only
1076 have one level of template argument for the innermost
1078 SET_CLASSTYPE_TEMPLATE_SPECIALIZATION (type
);
1079 DECL_SOURCE_LOCATION (TYPE_MAIN_DECL (type
)) = input_location
;
1080 CLASSTYPE_TI_ARGS (type
)
1081 = INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (type
));
1084 else if (processing_specialization
)
1086 /* Someday C++0x may allow for enum template specialization. */
1087 if (cxx_dialect
> cxx98
&& TREE_CODE (type
) == ENUMERAL_TYPE
1088 && CLASS_TYPE_P (context
) && CLASSTYPE_USE_TEMPLATE (context
))
1089 pedwarn (input_location
, OPT_Wpedantic
, "template specialization "
1090 "of %qD not allowed by ISO C++", type
);
1093 error ("explicit specialization of non-template %qT", type
);
1094 return error_mark_node
;
1101 /* Returns nonzero if we can optimize the retrieval of specializations
1102 for TMPL, a TEMPLATE_DECL. In particular, for such a template, we
1103 do not use DECL_TEMPLATE_SPECIALIZATIONS at all. */
1106 optimize_specialization_lookup_p (tree tmpl
)
1108 return (DECL_FUNCTION_TEMPLATE_P (tmpl
)
1109 && DECL_CLASS_SCOPE_P (tmpl
)
1110 /* DECL_CLASS_SCOPE_P holds of T::f even if T is a template
1112 && CLASS_TYPE_P (DECL_CONTEXT (tmpl
))
1113 /* The optimized lookup depends on the fact that the
1114 template arguments for the member function template apply
1115 purely to the containing class, which is not true if the
1116 containing class is an explicit or partial
1118 && !CLASSTYPE_TEMPLATE_SPECIALIZATION (DECL_CONTEXT (tmpl
))
1119 && !DECL_MEMBER_TEMPLATE_P (tmpl
)
1120 && !DECL_CONV_FN_P (tmpl
)
1121 /* It is possible to have a template that is not a member
1122 template and is not a member of a template class:
1124 template <typename T>
1125 struct S { friend A::f(); };
1127 Here, the friend function is a template, but the context does
1128 not have template information. The optimized lookup relies
1129 on having ARGS be the template arguments for both the class
1130 and the function template. */
1131 && !DECL_FRIEND_P (DECL_TEMPLATE_RESULT (tmpl
)));
1134 /* Make sure ARGS doesn't use any inappropriate typedefs; we should have
1135 gone through coerce_template_parms by now. */
1138 check_unstripped_args (tree args ATTRIBUTE_UNUSED
)
1140 #ifdef ENABLE_CHECKING
1141 ++processing_template_decl
;
1142 if (!any_dependent_template_arguments_p (args
))
1144 tree inner
= INNERMOST_TEMPLATE_ARGS (args
);
1145 for (int i
= 0; i
< TREE_VEC_LENGTH (inner
); ++i
)
1147 tree arg
= TREE_VEC_ELT (inner
, i
);
1148 if (TREE_CODE (arg
) == TEMPLATE_DECL
)
1150 else if (TYPE_P (arg
))
1151 gcc_assert (strip_typedefs (arg
, NULL
) == arg
);
1152 else if (strip_typedefs (TREE_TYPE (arg
), NULL
) != TREE_TYPE (arg
))
1153 /* Allow typedefs on the type of a non-type argument, since a
1154 parameter can have them. */;
1156 gcc_assert (strip_typedefs_expr (arg
, NULL
) == arg
);
1159 --processing_template_decl
;
1163 /* Retrieve the specialization (in the sense of [temp.spec] - a
1164 specialization is either an instantiation or an explicit
1165 specialization) of TMPL for the given template ARGS. If there is
1166 no such specialization, return NULL_TREE. The ARGS are a vector of
1167 arguments, or a vector of vectors of arguments, in the case of
1168 templates with more than one level of parameters.
1170 If TMPL is a type template and CLASS_SPECIALIZATIONS_P is true,
1171 then we search for a partial specialization matching ARGS. This
1172 parameter is ignored if TMPL is not a class template.
1174 We can also look up a FIELD_DECL, if it is a lambda capture pack; the
1175 result is a NONTYPE_ARGUMENT_PACK. */
1178 retrieve_specialization (tree tmpl
, tree args
, hashval_t hash
)
1180 if (tmpl
== NULL_TREE
)
1183 if (args
== error_mark_node
)
1186 gcc_assert (TREE_CODE (tmpl
) == TEMPLATE_DECL
1187 || TREE_CODE (tmpl
) == FIELD_DECL
);
1189 /* There should be as many levels of arguments as there are
1190 levels of parameters. */
1191 gcc_assert (TMPL_ARGS_DEPTH (args
)
1192 == (TREE_CODE (tmpl
) == TEMPLATE_DECL
1193 ? TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl
))
1194 : template_class_depth (DECL_CONTEXT (tmpl
))));
1196 check_unstripped_args (args
);
1198 if (optimize_specialization_lookup_p (tmpl
))
1200 tree class_template
;
1201 tree class_specialization
;
1202 vec
<tree
, va_gc
> *methods
;
1206 /* The template arguments actually apply to the containing
1207 class. Find the class specialization with those
1209 class_template
= CLASSTYPE_TI_TEMPLATE (DECL_CONTEXT (tmpl
));
1210 class_specialization
1211 = retrieve_specialization (class_template
, args
, 0);
1212 if (!class_specialization
)
1214 /* Now, find the appropriate entry in the CLASSTYPE_METHOD_VEC
1215 for the specialization. */
1216 idx
= class_method_index_for_fn (class_specialization
, tmpl
);
1219 /* Iterate through the methods with the indicated name, looking
1220 for the one that has an instance of TMPL. */
1221 methods
= CLASSTYPE_METHOD_VEC (class_specialization
);
1222 for (fns
= (*methods
)[idx
]; fns
; fns
= OVL_NEXT (fns
))
1224 tree fn
= OVL_CURRENT (fns
);
1225 if (DECL_TEMPLATE_INFO (fn
) && DECL_TI_TEMPLATE (fn
) == tmpl
1226 /* using-declarations can add base methods to the method vec,
1227 and we don't want those here. */
1228 && DECL_CONTEXT (fn
) == class_specialization
)
1237 hash_table
<spec_hasher
> *specializations
;
1241 elt
.spec
= NULL_TREE
;
1243 if (DECL_CLASS_TEMPLATE_P (tmpl
))
1244 specializations
= type_specializations
;
1246 specializations
= decl_specializations
;
1249 hash
= spec_hasher::hash (&elt
);
1250 found
= specializations
->find_with_hash (&elt
, hash
);
1258 /* Like retrieve_specialization, but for local declarations. */
1261 retrieve_local_specialization (tree tmpl
)
1263 if (local_specializations
== NULL
)
1266 tree
*slot
= local_specializations
->get (tmpl
);
1267 return slot
? *slot
: NULL_TREE
;
1270 /* Returns nonzero iff DECL is a specialization of TMPL. */
1273 is_specialization_of (tree decl
, tree tmpl
)
1277 if (TREE_CODE (decl
) == FUNCTION_DECL
)
1281 t
= DECL_TEMPLATE_INFO (t
) ? DECL_TI_TEMPLATE (t
) : NULL_TREE
)
1287 gcc_assert (TREE_CODE (decl
) == TYPE_DECL
);
1289 for (t
= TREE_TYPE (decl
);
1291 t
= CLASSTYPE_USE_TEMPLATE (t
)
1292 ? TREE_TYPE (CLASSTYPE_TI_TEMPLATE (t
)) : NULL_TREE
)
1293 if (same_type_ignoring_top_level_qualifiers_p (t
, TREE_TYPE (tmpl
)))
1300 /* Returns nonzero iff DECL is a specialization of friend declaration
1301 FRIEND_DECL according to [temp.friend]. */
1304 is_specialization_of_friend (tree decl
, tree friend_decl
)
1306 bool need_template
= true;
1309 gcc_assert (TREE_CODE (decl
) == FUNCTION_DECL
1310 || TREE_CODE (decl
) == TYPE_DECL
);
1312 /* For [temp.friend/6] when FRIEND_DECL is an ordinary member function
1313 of a template class, we want to check if DECL is a specialization
1315 if (TREE_CODE (friend_decl
) == FUNCTION_DECL
1316 && DECL_TEMPLATE_INFO (friend_decl
)
1317 && !DECL_USE_TEMPLATE (friend_decl
))
1319 /* We want a TEMPLATE_DECL for `is_specialization_of'. */
1320 friend_decl
= DECL_TI_TEMPLATE (friend_decl
);
1321 need_template
= false;
1323 else if (TREE_CODE (friend_decl
) == TEMPLATE_DECL
1324 && !PRIMARY_TEMPLATE_P (friend_decl
))
1325 need_template
= false;
1327 /* There is nothing to do if this is not a template friend. */
1328 if (TREE_CODE (friend_decl
) != TEMPLATE_DECL
)
1331 if (is_specialization_of (decl
, friend_decl
))
1335 A member of a class template may be declared to be a friend of a
1336 non-template class. In this case, the corresponding member of
1337 every specialization of the class template is a friend of the
1338 class granting friendship.
1340 For example, given a template friend declaration
1342 template <class T> friend void A<T>::f();
1344 the member function below is considered a friend
1346 template <> struct A<int> {
1350 For this type of template friend, TEMPLATE_DEPTH below will be
1351 nonzero. To determine if DECL is a friend of FRIEND, we first
1352 check if the enclosing class is a specialization of another. */
1354 template_depth
= template_class_depth (CP_DECL_CONTEXT (friend_decl
));
1356 && DECL_CLASS_SCOPE_P (decl
)
1357 && is_specialization_of (TYPE_NAME (DECL_CONTEXT (decl
)),
1358 CLASSTYPE_TI_TEMPLATE (DECL_CONTEXT (friend_decl
))))
1360 /* Next, we check the members themselves. In order to handle
1361 a few tricky cases, such as when FRIEND_DECL's are
1363 template <class T> friend void A<T>::g(T t);
1364 template <class T> template <T t> friend void A<T>::h();
1368 void A<int>::g(int);
1369 template <int> void A<int>::h();
1371 we need to figure out ARGS, the template arguments from
1372 the context of DECL. This is required for template substitution
1373 of `T' in the function parameter of `g' and template parameter
1374 of `h' in the above examples. Here ARGS corresponds to `int'. */
1376 tree context
= DECL_CONTEXT (decl
);
1377 tree args
= NULL_TREE
;
1378 int current_depth
= 0;
1380 while (current_depth
< template_depth
)
1382 if (CLASSTYPE_TEMPLATE_INFO (context
))
1384 if (current_depth
== 0)
1385 args
= TYPE_TI_ARGS (context
);
1387 args
= add_to_template_args (TYPE_TI_ARGS (context
), args
);
1390 context
= TYPE_CONTEXT (context
);
1393 if (TREE_CODE (decl
) == FUNCTION_DECL
)
1398 tree friend_args_type
;
1399 tree decl_args_type
;
1401 /* Make sure that both DECL and FRIEND_DECL are templates or
1403 is_template
= DECL_TEMPLATE_INFO (decl
)
1404 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (decl
));
1405 if (need_template
^ is_template
)
1407 else if (is_template
)
1409 /* If both are templates, check template parameter list. */
1411 = tsubst_template_parms (DECL_TEMPLATE_PARMS (friend_decl
),
1413 if (!comp_template_parms
1414 (DECL_TEMPLATE_PARMS (DECL_TI_TEMPLATE (decl
)),
1418 decl_type
= TREE_TYPE (DECL_TI_TEMPLATE (decl
));
1421 decl_type
= TREE_TYPE (decl
);
1423 friend_type
= tsubst_function_type (TREE_TYPE (friend_decl
), args
,
1424 tf_none
, NULL_TREE
);
1425 if (friend_type
== error_mark_node
)
1428 /* Check if return types match. */
1429 if (!same_type_p (TREE_TYPE (decl_type
), TREE_TYPE (friend_type
)))
1432 /* Check if function parameter types match, ignoring the
1433 `this' parameter. */
1434 friend_args_type
= TYPE_ARG_TYPES (friend_type
);
1435 decl_args_type
= TYPE_ARG_TYPES (decl_type
);
1436 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (friend_decl
))
1437 friend_args_type
= TREE_CHAIN (friend_args_type
);
1438 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
1439 decl_args_type
= TREE_CHAIN (decl_args_type
);
1441 return compparms (decl_args_type
, friend_args_type
);
1445 /* DECL is a TYPE_DECL */
1447 tree decl_type
= TREE_TYPE (decl
);
1449 /* Make sure that both DECL and FRIEND_DECL are templates or
1452 = CLASSTYPE_TEMPLATE_INFO (decl_type
)
1453 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (decl_type
));
1455 if (need_template
^ is_template
)
1457 else if (is_template
)
1460 /* If both are templates, check the name of the two
1461 TEMPLATE_DECL's first because is_friend didn't. */
1462 if (DECL_NAME (CLASSTYPE_TI_TEMPLATE (decl_type
))
1463 != DECL_NAME (friend_decl
))
1466 /* Now check template parameter list. */
1468 = tsubst_template_parms (DECL_TEMPLATE_PARMS (friend_decl
),
1470 return comp_template_parms
1471 (DECL_TEMPLATE_PARMS (CLASSTYPE_TI_TEMPLATE (decl_type
)),
1475 return (DECL_NAME (decl
)
1476 == DECL_NAME (friend_decl
));
1482 /* Register the specialization SPEC as a specialization of TMPL with
1483 the indicated ARGS. IS_FRIEND indicates whether the specialization
1484 is actually just a friend declaration. Returns SPEC, or an
1485 equivalent prior declaration, if available.
1487 We also store instantiations of field packs in the hash table, even
1488 though they are not themselves templates, to make lookup easier. */
1491 register_specialization (tree spec
, tree tmpl
, tree args
, bool is_friend
,
1495 spec_entry
**slot
= NULL
;
1498 gcc_assert ((TREE_CODE (tmpl
) == TEMPLATE_DECL
&& DECL_P (spec
))
1499 || (TREE_CODE (tmpl
) == FIELD_DECL
1500 && TREE_CODE (spec
) == NONTYPE_ARGUMENT_PACK
));
1502 if (TREE_CODE (spec
) == FUNCTION_DECL
1503 && uses_template_parms (DECL_TI_ARGS (spec
)))
1504 /* This is the FUNCTION_DECL for a partial instantiation. Don't
1505 register it; we want the corresponding TEMPLATE_DECL instead.
1506 We use `uses_template_parms (DECL_TI_ARGS (spec))' rather than
1507 the more obvious `uses_template_parms (spec)' to avoid problems
1508 with default function arguments. In particular, given
1509 something like this:
1511 template <class T> void f(T t1, T t = T())
1513 the default argument expression is not substituted for in an
1514 instantiation unless and until it is actually needed. */
1517 if (optimize_specialization_lookup_p (tmpl
))
1518 /* We don't put these specializations in the hash table, but we might
1519 want to give an error about a mismatch. */
1520 fn
= retrieve_specialization (tmpl
, args
, 0);
1528 hash
= spec_hasher::hash (&elt
);
1531 decl_specializations
->find_slot_with_hash (&elt
, hash
, INSERT
);
1533 fn
= ((spec_entry
*) *slot
)->spec
;
1538 /* We can sometimes try to re-register a specialization that we've
1539 already got. In particular, regenerate_decl_from_template calls
1540 duplicate_decls which will update the specialization list. But,
1541 we'll still get called again here anyhow. It's more convenient
1542 to simply allow this than to try to prevent it. */
1545 else if (fn
&& DECL_TEMPLATE_SPECIALIZATION (spec
))
1547 if (DECL_TEMPLATE_INSTANTIATION (fn
))
1549 if (DECL_ODR_USED (fn
)
1550 || DECL_EXPLICIT_INSTANTIATION (fn
))
1552 error ("specialization of %qD after instantiation",
1554 return error_mark_node
;
1559 /* This situation should occur only if the first
1560 specialization is an implicit instantiation, the
1561 second is an explicit specialization, and the
1562 implicit instantiation has not yet been used. That
1563 situation can occur if we have implicitly
1564 instantiated a member function and then specialized
1567 We can also wind up here if a friend declaration that
1568 looked like an instantiation turns out to be a
1571 template <class T> void foo(T);
1572 class S { friend void foo<>(int) };
1573 template <> void foo(int);
1575 We transform the existing DECL in place so that any
1576 pointers to it become pointers to the updated
1579 If there was a definition for the template, but not
1580 for the specialization, we want this to look as if
1581 there were no definition, and vice versa. */
1582 DECL_INITIAL (fn
) = NULL_TREE
;
1583 duplicate_decls (spec
, fn
, is_friend
);
1584 /* The call to duplicate_decls will have applied
1587 An explicit specialization of a function template
1588 is inline only if it is explicitly declared to be,
1589 and independently of whether its function template
1592 to the primary function; now copy the inline bits to
1593 the various clones. */
1594 FOR_EACH_CLONE (clone
, fn
)
1596 DECL_DECLARED_INLINE_P (clone
)
1597 = DECL_DECLARED_INLINE_P (fn
);
1598 DECL_SOURCE_LOCATION (clone
)
1599 = DECL_SOURCE_LOCATION (fn
);
1600 DECL_DELETED_FN (clone
)
1601 = DECL_DELETED_FN (fn
);
1603 check_specialization_namespace (tmpl
);
1608 else if (DECL_TEMPLATE_SPECIALIZATION (fn
))
1610 if (!duplicate_decls (spec
, fn
, is_friend
) && DECL_INITIAL (spec
))
1611 /* Dup decl failed, but this is a new definition. Set the
1612 line number so any errors match this new
1614 DECL_SOURCE_LOCATION (fn
) = DECL_SOURCE_LOCATION (spec
);
1620 return duplicate_decls (spec
, fn
, is_friend
);
1622 /* A specialization must be declared in the same namespace as the
1623 template it is specializing. */
1624 if (DECL_P (spec
) && DECL_TEMPLATE_SPECIALIZATION (spec
)
1625 && !check_specialization_namespace (tmpl
))
1626 DECL_CONTEXT (spec
) = DECL_CONTEXT (tmpl
);
1628 if (slot
!= NULL
/* !optimize_specialization_lookup_p (tmpl) */)
1630 spec_entry
*entry
= ggc_alloc
<spec_entry
> ();
1631 gcc_assert (tmpl
&& args
&& spec
);
1634 if ((TREE_CODE (spec
) == FUNCTION_DECL
&& DECL_NAMESPACE_SCOPE_P (spec
)
1635 && PRIMARY_TEMPLATE_P (tmpl
)
1636 && DECL_SAVED_TREE (DECL_TEMPLATE_RESULT (tmpl
)) == NULL_TREE
)
1637 || variable_template_p (tmpl
))
1638 /* If TMPL is a forward declaration of a template function, keep a list
1639 of all specializations in case we need to reassign them to a friend
1640 template later in tsubst_friend_function.
1642 Also keep a list of all variable template instantiations so that
1643 process_partial_specialization can check whether a later partial
1644 specialization would have used it. */
1645 DECL_TEMPLATE_INSTANTIATIONS (tmpl
)
1646 = tree_cons (args
, spec
, DECL_TEMPLATE_INSTANTIATIONS (tmpl
));
1652 /* Returns true iff two spec_entry nodes are equivalent. */
1654 int comparing_specializations
;
1657 spec_hasher::equal (spec_entry
*e1
, spec_entry
*e2
)
1661 ++comparing_specializations
;
1662 equal
= (e1
->tmpl
== e2
->tmpl
1663 && comp_template_args (e1
->args
, e2
->args
));
1664 if (equal
&& flag_concepts
1665 /* tmpl could be a FIELD_DECL for a capture pack. */
1666 && TREE_CODE (e1
->tmpl
) == TEMPLATE_DECL
1667 && VAR_P (DECL_TEMPLATE_RESULT (e1
->tmpl
))
1668 && uses_template_parms (e1
->args
))
1670 /* Partial specializations of a variable template can be distinguished by
1672 tree c1
= e1
->spec
? get_constraints (e1
->spec
) : NULL_TREE
;
1673 tree c2
= e2
->spec
? get_constraints (e2
->spec
) : NULL_TREE
;
1674 equal
= equivalent_constraints (c1
, c2
);
1676 --comparing_specializations
;
1681 /* Returns a hash for a template TMPL and template arguments ARGS. */
1684 hash_tmpl_and_args (tree tmpl
, tree args
)
1686 hashval_t val
= DECL_UID (tmpl
);
1687 return iterative_hash_template_arg (args
, val
);
1690 /* Returns a hash for a spec_entry node based on the TMPL and ARGS members,
1694 spec_hasher::hash (spec_entry
*e
)
1696 return hash_tmpl_and_args (e
->tmpl
, e
->args
);
1699 /* Recursively calculate a hash value for a template argument ARG, for use
1700 in the hash tables of template specializations. */
1703 iterative_hash_template_arg (tree arg
, hashval_t val
)
1705 unsigned HOST_WIDE_INT i
;
1706 enum tree_code code
;
1709 if (arg
== NULL_TREE
)
1710 return iterative_hash_object (arg
, val
);
1715 if (TREE_CODE (arg
) == ARGUMENT_PACK_SELECT
)
1716 /* We can get one of these when re-hashing a previous entry in the middle
1717 of substituting into a pack expansion. Just look through it. */
1718 arg
= ARGUMENT_PACK_SELECT_FROM_PACK (arg
);
1720 code
= TREE_CODE (arg
);
1721 tclass
= TREE_CODE_CLASS (code
);
1723 val
= iterative_hash_object (code
, val
);
1730 case IDENTIFIER_NODE
:
1731 return iterative_hash_object (IDENTIFIER_HASH_VALUE (arg
), val
);
1735 int i
, len
= TREE_VEC_LENGTH (arg
);
1736 for (i
= 0; i
< len
; ++i
)
1737 val
= iterative_hash_template_arg (TREE_VEC_ELT (arg
, i
), val
);
1741 case TYPE_PACK_EXPANSION
:
1742 case EXPR_PACK_EXPANSION
:
1743 val
= iterative_hash_template_arg (PACK_EXPANSION_PATTERN (arg
), val
);
1744 return iterative_hash_template_arg (PACK_EXPANSION_EXTRA_ARGS (arg
), val
);
1746 case TYPE_ARGUMENT_PACK
:
1747 case NONTYPE_ARGUMENT_PACK
:
1748 return iterative_hash_template_arg (ARGUMENT_PACK_ARGS (arg
), val
);
1751 for (; arg
; arg
= TREE_CHAIN (arg
))
1752 val
= iterative_hash_template_arg (TREE_VALUE (arg
), val
);
1756 for (; arg
; arg
= OVL_NEXT (arg
))
1757 val
= iterative_hash_template_arg (OVL_CURRENT (arg
), val
);
1763 iterative_hash_template_arg (TREE_TYPE (arg
), val
);
1764 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (arg
), i
, field
, value
)
1766 val
= iterative_hash_template_arg (field
, val
);
1767 val
= iterative_hash_template_arg (value
, val
);
1773 if (!DECL_ARTIFICIAL (arg
))
1775 val
= iterative_hash_object (DECL_PARM_INDEX (arg
), val
);
1776 val
= iterative_hash_object (DECL_PARM_LEVEL (arg
), val
);
1778 return iterative_hash_template_arg (TREE_TYPE (arg
), val
);
1781 return iterative_hash_template_arg (TARGET_EXPR_INITIAL (arg
), val
);
1784 val
= iterative_hash_template_arg (PTRMEM_CST_CLASS (arg
), val
);
1785 return iterative_hash_template_arg (PTRMEM_CST_MEMBER (arg
), val
);
1787 case TEMPLATE_PARM_INDEX
:
1788 val
= iterative_hash_template_arg
1789 (TREE_TYPE (TEMPLATE_PARM_DECL (arg
)), val
);
1790 val
= iterative_hash_object (TEMPLATE_PARM_LEVEL (arg
), val
);
1791 return iterative_hash_object (TEMPLATE_PARM_IDX (arg
), val
);
1794 val
= iterative_hash_object (TRAIT_EXPR_KIND (arg
), val
);
1795 val
= iterative_hash_template_arg (TRAIT_EXPR_TYPE1 (arg
), val
);
1796 return iterative_hash_template_arg (TRAIT_EXPR_TYPE2 (arg
), val
);
1799 val
= iterative_hash_template_arg (BINFO_TYPE (BASELINK_BINFO (arg
)),
1801 return iterative_hash_template_arg (DECL_NAME (get_first_fn (arg
)),
1805 val
= iterative_hash_template_arg (TREE_OPERAND (arg
, 0), val
);
1806 code
= TREE_CODE (TREE_OPERAND (arg
, 1));
1807 val
= iterative_hash_object (code
, val
);
1808 return iterative_hash_template_arg (TREE_OPERAND (arg
, 2), val
);
1811 /* A lambda can't appear in a template arg, but don't crash on
1813 gcc_assert (seen_error ());
1817 case IMPLICIT_CONV_EXPR
:
1818 case STATIC_CAST_EXPR
:
1819 case REINTERPRET_CAST_EXPR
:
1820 case CONST_CAST_EXPR
:
1821 case DYNAMIC_CAST_EXPR
:
1823 val
= iterative_hash_template_arg (TREE_TYPE (arg
), val
);
1824 /* Now hash operands as usual. */
1834 if (alias_template_specialization_p (arg
))
1836 // We want an alias specialization that survived strip_typedefs
1837 // to hash differently from its TYPE_CANONICAL, to avoid hash
1838 // collisions that compare as different in template_args_equal.
1839 // These could be dependent specializations that strip_typedefs
1840 // left alone, or untouched specializations because
1841 // coerce_template_parms returns the unconverted template
1842 // arguments if it sees incomplete argument packs.
1843 tree ti
= TYPE_TEMPLATE_INFO (arg
);
1844 return hash_tmpl_and_args (TI_TEMPLATE (ti
), TI_ARGS (ti
));
1846 if (TYPE_CANONICAL (arg
))
1847 return iterative_hash_object (TYPE_HASH (TYPE_CANONICAL (arg
)),
1849 else if (TREE_CODE (arg
) == DECLTYPE_TYPE
)
1850 return iterative_hash_template_arg (DECLTYPE_TYPE_EXPR (arg
), val
);
1851 /* Otherwise just compare the types during lookup. */
1854 case tcc_declaration
:
1856 return iterative_hash_expr (arg
, val
);
1859 gcc_assert (IS_EXPR_CODE_CLASS (tclass
));
1861 unsigned n
= cp_tree_operand_length (arg
);
1862 for (i
= 0; i
< n
; ++i
)
1863 val
= iterative_hash_template_arg (TREE_OPERAND (arg
, i
), val
);
1871 /* Unregister the specialization SPEC as a specialization of TMPL.
1872 Replace it with NEW_SPEC, if NEW_SPEC is non-NULL. Returns true
1873 if the SPEC was listed as a specialization of TMPL.
1875 Note that SPEC has been ggc_freed, so we can't look inside it. */
1878 reregister_specialization (tree spec
, tree tinfo
, tree new_spec
)
1883 elt
.tmpl
= most_general_template (TI_TEMPLATE (tinfo
));
1884 elt
.args
= TI_ARGS (tinfo
);
1885 elt
.spec
= NULL_TREE
;
1887 entry
= decl_specializations
->find (&elt
);
1890 gcc_assert (entry
->spec
== spec
|| entry
->spec
== new_spec
);
1891 gcc_assert (new_spec
!= NULL_TREE
);
1892 entry
->spec
= new_spec
;
1899 /* Like register_specialization, but for local declarations. We are
1900 registering SPEC, an instantiation of TMPL. */
1903 register_local_specialization (tree spec
, tree tmpl
)
1905 local_specializations
->put (tmpl
, spec
);
1908 /* TYPE is a class type. Returns true if TYPE is an explicitly
1909 specialized class. */
1912 explicit_class_specialization_p (tree type
)
1914 if (!CLASSTYPE_TEMPLATE_SPECIALIZATION (type
))
1916 return !uses_template_parms (CLASSTYPE_TI_ARGS (type
));
1919 /* Print the list of functions at FNS, going through all the overloads
1920 for each element of the list. Alternatively, FNS can not be a
1921 TREE_LIST, in which case it will be printed together with all the
1924 MORE and *STR should respectively be FALSE and NULL when the function
1925 is called from the outside. They are used internally on recursive
1926 calls. print_candidates manages the two parameters and leaves NULL
1927 in *STR when it ends. */
1930 print_candidates_1 (tree fns
, bool more
, const char **str
)
1933 char *spaces
= NULL
;
1935 for (fn
= fns
; fn
; fn
= OVL_NEXT (fn
))
1936 if (TREE_CODE (fn
) == TREE_LIST
)
1938 for (fn2
= fn
; fn2
!= NULL_TREE
; fn2
= TREE_CHAIN (fn2
))
1939 print_candidates_1 (TREE_VALUE (fn2
),
1940 TREE_CHAIN (fn2
) || more
, str
);
1944 tree cand
= OVL_CURRENT (fn
);
1947 /* Pick the prefix string. */
1948 if (!more
&& !OVL_NEXT (fns
))
1950 inform (DECL_SOURCE_LOCATION (cand
),
1951 "candidate is: %#D", cand
);
1955 *str
= _("candidates are:");
1956 spaces
= get_spaces (*str
);
1958 inform (DECL_SOURCE_LOCATION (cand
), "%s %#D", *str
, cand
);
1959 *str
= spaces
? spaces
: *str
;
1969 /* Print the list of candidate FNS in an error message. FNS can also
1970 be a TREE_LIST of non-functions in the case of an ambiguous lookup. */
1973 print_candidates (tree fns
)
1975 const char *str
= NULL
;
1976 print_candidates_1 (fns
, false, &str
);
1977 gcc_assert (str
== NULL
);
1980 /* Get a (possibly) constrained template declaration for the
1981 purpose of ordering candidates. */
1983 get_template_for_ordering (tree list
)
1985 gcc_assert (TREE_CODE (list
) == TREE_LIST
);
1986 tree f
= TREE_VALUE (list
);
1987 if (tree ti
= DECL_TEMPLATE_INFO (f
))
1988 return TI_TEMPLATE (ti
);
1992 /* Among candidates having the same signature, return the
1993 most constrained or NULL_TREE if there is no best candidate.
1994 If the signatures of candidates vary (e.g., template
1995 specialization vs. member function), then there can be no
1998 Note that we don't compare constraints on the functions
1999 themselves, but rather those of their templates. */
2001 most_constrained_function (tree candidates
)
2003 // Try to find the best candidate in a first pass.
2004 tree champ
= candidates
;
2005 for (tree c
= TREE_CHAIN (champ
); c
; c
= TREE_CHAIN (c
))
2007 int winner
= more_constrained (get_template_for_ordering (champ
),
2008 get_template_for_ordering (c
));
2010 champ
= c
; // The candidate is more constrained
2011 else if (winner
== 0)
2012 return NULL_TREE
; // Neither is more constrained
2015 // Verify that the champ is better than previous candidates.
2016 for (tree c
= candidates
; c
!= champ
; c
= TREE_CHAIN (c
)) {
2017 if (!more_constrained (get_template_for_ordering (champ
),
2018 get_template_for_ordering (c
)))
2026 /* Returns the template (one of the functions given by TEMPLATE_ID)
2027 which can be specialized to match the indicated DECL with the
2028 explicit template args given in TEMPLATE_ID. The DECL may be
2029 NULL_TREE if none is available. In that case, the functions in
2030 TEMPLATE_ID are non-members.
2032 If NEED_MEMBER_TEMPLATE is nonzero the function is known to be a
2033 specialization of a member template.
2035 The TEMPLATE_COUNT is the number of references to qualifying
2036 template classes that appeared in the name of the function. See
2037 check_explicit_specialization for a more accurate description.
2039 TSK indicates what kind of template declaration (if any) is being
2040 declared. TSK_TEMPLATE indicates that the declaration given by
2041 DECL, though a FUNCTION_DECL, has template parameters, and is
2042 therefore a template function.
2044 The template args (those explicitly specified and those deduced)
2045 are output in a newly created vector *TARGS_OUT.
2047 If it is impossible to determine the result, an error message is
2048 issued. The error_mark_node is returned to indicate failure. */
2051 determine_specialization (tree template_id
,
2054 int need_member_template
,
2060 tree explicit_targs
;
2061 tree candidates
= NULL_TREE
;
2063 /* A TREE_LIST of templates of which DECL may be a specialization.
2064 The TREE_VALUE of each node is a TEMPLATE_DECL. The
2065 corresponding TREE_PURPOSE is the set of template arguments that,
2066 when used to instantiate the template, would produce a function
2067 with the signature of DECL. */
2068 tree templates
= NULL_TREE
;
2070 cp_binding_level
*b
;
2072 *targs_out
= NULL_TREE
;
2074 if (template_id
== error_mark_node
|| decl
== error_mark_node
)
2075 return error_mark_node
;
2077 /* We shouldn't be specializing a member template of an
2078 unspecialized class template; we already gave an error in
2079 check_specialization_scope, now avoid crashing. */
2080 if (template_count
&& DECL_CLASS_SCOPE_P (decl
)
2081 && template_class_depth (DECL_CONTEXT (decl
)) > 0)
2083 gcc_assert (errorcount
);
2084 return error_mark_node
;
2087 fns
= TREE_OPERAND (template_id
, 0);
2088 explicit_targs
= TREE_OPERAND (template_id
, 1);
2090 if (fns
== error_mark_node
)
2091 return error_mark_node
;
2093 /* Check for baselinks. */
2094 if (BASELINK_P (fns
))
2095 fns
= BASELINK_FUNCTIONS (fns
);
2097 if (TREE_CODE (decl
) == FUNCTION_DECL
&& !is_overloaded_fn (fns
))
2099 error ("%qD is not a function template", fns
);
2100 return error_mark_node
;
2102 else if (VAR_P (decl
) && !variable_template_p (fns
))
2104 error ("%qD is not a variable template", fns
);
2105 return error_mark_node
;
2108 /* Count the number of template headers specified for this
2111 for (b
= current_binding_level
;
2112 b
->kind
== sk_template_parms
;
2116 tree orig_fns
= fns
;
2118 if (variable_template_p (fns
))
2120 tree parms
= INNERMOST_TEMPLATE_PARMS (DECL_TEMPLATE_PARMS (fns
));
2121 targs
= coerce_template_parms (parms
, explicit_targs
, fns
,
2122 tf_warning_or_error
,
2123 /*req_all*/true, /*use_defarg*/true);
2124 if (targs
!= error_mark_node
)
2125 templates
= tree_cons (targs
, fns
, templates
);
2127 else for (; fns
; fns
= OVL_NEXT (fns
))
2129 tree fn
= OVL_CURRENT (fns
);
2131 if (TREE_CODE (fn
) == TEMPLATE_DECL
)
2133 tree decl_arg_types
;
2137 /* In case of explicit specialization, we need to check if
2138 the number of template headers appearing in the specialization
2139 is correct. This is usually done in check_explicit_specialization,
2140 but the check done there cannot be exhaustive when specializing
2141 member functions. Consider the following code:
2143 template <> void A<int>::f(int);
2144 template <> template <> void A<int>::f(int);
2146 Assuming that A<int> is not itself an explicit specialization
2147 already, the first line specializes "f" which is a non-template
2148 member function, whilst the second line specializes "f" which
2149 is a template member function. So both lines are syntactically
2150 correct, and check_explicit_specialization does not reject
2153 Here, we can do better, as we are matching the specialization
2154 against the declarations. We count the number of template
2155 headers, and we check if they match TEMPLATE_COUNT + 1
2156 (TEMPLATE_COUNT is the number of qualifying template classes,
2157 plus there must be another header for the member template
2160 Notice that if header_count is zero, this is not a
2161 specialization but rather a template instantiation, so there
2162 is no check we can perform here. */
2163 if (header_count
&& header_count
!= template_count
+ 1)
2166 /* Check that the number of template arguments at the
2167 innermost level for DECL is the same as for FN. */
2168 if (current_binding_level
->kind
== sk_template_parms
2169 && !current_binding_level
->explicit_spec_p
2170 && (TREE_VEC_LENGTH (DECL_INNERMOST_TEMPLATE_PARMS (fn
))
2171 != TREE_VEC_LENGTH (INNERMOST_TEMPLATE_PARMS
2172 (current_template_parms
))))
2175 /* DECL might be a specialization of FN. */
2176 decl_arg_types
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
2177 fn_arg_types
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
2179 /* For a non-static member function, we need to make sure
2180 that the const qualification is the same. Since
2181 get_bindings does not try to merge the "this" parameter,
2182 we must do the comparison explicitly. */
2183 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
)
2184 && !same_type_p (TREE_VALUE (fn_arg_types
),
2185 TREE_VALUE (decl_arg_types
)))
2188 /* Skip the "this" parameter and, for constructors of
2189 classes with virtual bases, the VTT parameter. A
2190 full specialization of a constructor will have a VTT
2191 parameter, but a template never will. */
2193 = skip_artificial_parms_for (decl
, decl_arg_types
);
2195 = skip_artificial_parms_for (fn
, fn_arg_types
);
2197 /* Function templates cannot be specializations; there are
2198 no partial specializations of functions. Therefore, if
2199 the type of DECL does not match FN, there is no
2202 Note that it should never be the case that we have both
2203 candidates added here, and for regular member functions
2205 if (tsk
== tsk_template
)
2207 if (compparms (fn_arg_types
, decl_arg_types
))
2208 candidates
= tree_cons (NULL_TREE
, fn
, candidates
);
2212 /* See whether this function might be a specialization of this
2213 template. Suppress access control because we might be trying
2214 to make this specialization a friend, and we have already done
2215 access control for the declaration of the specialization. */
2216 push_deferring_access_checks (dk_no_check
);
2217 targs
= get_bindings (fn
, decl
, explicit_targs
, /*check_ret=*/true);
2218 pop_deferring_access_checks ();
2221 /* We cannot deduce template arguments that when used to
2222 specialize TMPL will produce DECL. */
2225 /* Remove, from the set of candidates, all those functions
2226 whose constraints are not satisfied. */
2227 if (flag_concepts
&& !constraints_satisfied_p (fn
, targs
))
2230 // Then, try to form the new function type.
2231 insttype
= tsubst (TREE_TYPE (fn
), targs
, tf_none
, NULL_TREE
);
2232 if (insttype
== error_mark_node
)
2235 = skip_artificial_parms_for (fn
, TYPE_ARG_TYPES (insttype
));
2236 if (!compparms (fn_arg_types
, decl_arg_types
))
2239 /* Save this template, and the arguments deduced. */
2240 templates
= tree_cons (targs
, fn
, templates
);
2242 else if (need_member_template
)
2243 /* FN is an ordinary member function, and we need a
2244 specialization of a member template. */
2246 else if (TREE_CODE (fn
) != FUNCTION_DECL
)
2247 /* We can get IDENTIFIER_NODEs here in certain erroneous
2250 else if (!DECL_FUNCTION_MEMBER_P (fn
))
2251 /* This is just an ordinary non-member function. Nothing can
2252 be a specialization of that. */
2254 else if (DECL_ARTIFICIAL (fn
))
2255 /* Cannot specialize functions that are created implicitly. */
2259 tree decl_arg_types
;
2261 /* This is an ordinary member function. However, since
2262 we're here, we can assume its enclosing class is a
2263 template class. For example,
2265 template <typename T> struct S { void f(); };
2266 template <> void S<int>::f() {}
2268 Here, S<int>::f is a non-template, but S<int> is a
2269 template class. If FN has the same type as DECL, we
2270 might be in business. */
2272 if (!DECL_TEMPLATE_INFO (fn
))
2273 /* Its enclosing class is an explicit specialization
2274 of a template class. This is not a candidate. */
2277 if (!same_type_p (TREE_TYPE (TREE_TYPE (decl
)),
2278 TREE_TYPE (TREE_TYPE (fn
))))
2279 /* The return types differ. */
2282 /* Adjust the type of DECL in case FN is a static member. */
2283 decl_arg_types
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
2284 if (DECL_STATIC_FUNCTION_P (fn
)
2285 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
2286 decl_arg_types
= TREE_CHAIN (decl_arg_types
);
2288 if (!compparms (TYPE_ARG_TYPES (TREE_TYPE (fn
)),
2292 // If the deduced arguments do not satisfy the constraints,
2293 // this is not a candidate.
2294 if (flag_concepts
&& !constraints_satisfied_p (fn
))
2297 // Add the candidate.
2298 candidates
= tree_cons (NULL_TREE
, fn
, candidates
);
2302 if (templates
&& TREE_CHAIN (templates
))
2308 It is possible for a specialization with a given function
2309 signature to be instantiated from more than one function
2310 template. In such cases, explicit specification of the
2311 template arguments must be used to uniquely identify the
2312 function template specialization being specialized.
2314 Note that here, there's no suggestion that we're supposed to
2315 determine which of the candidate templates is most
2316 specialized. However, we, also have:
2320 Partial ordering of overloaded function template
2321 declarations is used in the following contexts to select
2322 the function template to which a function template
2323 specialization refers:
2325 -- when an explicit specialization refers to a function
2328 So, we do use the partial ordering rules, at least for now.
2329 This extension can only serve to make invalid programs valid,
2330 so it's safe. And, there is strong anecdotal evidence that
2331 the committee intended the partial ordering rules to apply;
2332 the EDG front end has that behavior, and John Spicer claims
2333 that the committee simply forgot to delete the wording in
2334 [temp.expl.spec]. */
2335 tree tmpl
= most_specialized_instantiation (templates
);
2336 if (tmpl
!= error_mark_node
)
2339 TREE_CHAIN (templates
) = NULL_TREE
;
2343 // Concepts allows multiple declarations of member functions
2344 // with the same signature. Like above, we need to rely on
2345 // on the partial ordering of those candidates to determine which
2347 if (flag_concepts
&& candidates
&& TREE_CHAIN (candidates
))
2349 if (tree cand
= most_constrained_function (candidates
))
2352 TREE_CHAIN (cand
) = NULL_TREE
;
2356 if (templates
== NULL_TREE
&& candidates
== NULL_TREE
)
2358 error ("template-id %qD for %q+D does not match any template "
2359 "declaration", template_id
, decl
);
2360 if (header_count
&& header_count
!= template_count
+ 1)
2361 inform (input_location
, "saw %d %<template<>%>, need %d for "
2362 "specializing a member function template",
2363 header_count
, template_count
+ 1);
2365 print_candidates (orig_fns
);
2366 return error_mark_node
;
2368 else if ((templates
&& TREE_CHAIN (templates
))
2369 || (candidates
&& TREE_CHAIN (candidates
))
2370 || (templates
&& candidates
))
2372 error ("ambiguous template specialization %qD for %q+D",
2374 candidates
= chainon (candidates
, templates
);
2375 print_candidates (candidates
);
2376 return error_mark_node
;
2379 /* We have one, and exactly one, match. */
2382 tree fn
= TREE_VALUE (candidates
);
2383 *targs_out
= copy_node (DECL_TI_ARGS (fn
));
2385 // Propagate the candidate's constraints to the declaration.
2386 set_constraints (decl
, get_constraints (fn
));
2388 /* DECL is a re-declaration or partial instantiation of a template
2390 if (TREE_CODE (fn
) == TEMPLATE_DECL
)
2392 /* It was a specialization of an ordinary member function in a
2394 return DECL_TI_TEMPLATE (fn
);
2397 /* It was a specialization of a template. */
2398 targs
= DECL_TI_ARGS (DECL_TEMPLATE_RESULT (TREE_VALUE (templates
)));
2399 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (targs
))
2401 *targs_out
= copy_node (targs
);
2402 SET_TMPL_ARGS_LEVEL (*targs_out
,
2403 TMPL_ARGS_DEPTH (*targs_out
),
2404 TREE_PURPOSE (templates
));
2407 *targs_out
= TREE_PURPOSE (templates
);
2408 return TREE_VALUE (templates
);
2411 /* Returns a chain of parameter types, exactly like the SPEC_TYPES,
2412 but with the default argument values filled in from those in the
2416 copy_default_args_to_explicit_spec_1 (tree spec_types
,
2419 tree new_spec_types
;
2424 if (spec_types
== void_list_node
)
2425 return void_list_node
;
2427 /* Substitute into the rest of the list. */
2429 copy_default_args_to_explicit_spec_1 (TREE_CHAIN (spec_types
),
2430 TREE_CHAIN (tmpl_types
));
2432 /* Add the default argument for this parameter. */
2433 return hash_tree_cons (TREE_PURPOSE (tmpl_types
),
2434 TREE_VALUE (spec_types
),
2438 /* DECL is an explicit specialization. Replicate default arguments
2439 from the template it specializes. (That way, code like:
2441 template <class T> void f(T = 3);
2442 template <> void f(double);
2445 works, as required.) An alternative approach would be to look up
2446 the correct default arguments at the call-site, but this approach
2447 is consistent with how implicit instantiations are handled. */
2450 copy_default_args_to_explicit_spec (tree decl
)
2455 tree new_spec_types
;
2459 tree object_type
= NULL_TREE
;
2460 tree in_charge
= NULL_TREE
;
2461 tree vtt
= NULL_TREE
;
2463 /* See if there's anything we need to do. */
2464 tmpl
= DECL_TI_TEMPLATE (decl
);
2465 tmpl_types
= TYPE_ARG_TYPES (TREE_TYPE (DECL_TEMPLATE_RESULT (tmpl
)));
2466 for (t
= tmpl_types
; t
; t
= TREE_CHAIN (t
))
2467 if (TREE_PURPOSE (t
))
2472 old_type
= TREE_TYPE (decl
);
2473 spec_types
= TYPE_ARG_TYPES (old_type
);
2475 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
2477 /* Remove the this pointer, but remember the object's type for
2479 object_type
= TREE_TYPE (TREE_VALUE (spec_types
));
2480 spec_types
= TREE_CHAIN (spec_types
);
2481 tmpl_types
= TREE_CHAIN (tmpl_types
);
2483 if (DECL_HAS_IN_CHARGE_PARM_P (decl
))
2485 /* DECL may contain more parameters than TMPL due to the extra
2486 in-charge parameter in constructors and destructors. */
2487 in_charge
= spec_types
;
2488 spec_types
= TREE_CHAIN (spec_types
);
2490 if (DECL_HAS_VTT_PARM_P (decl
))
2493 spec_types
= TREE_CHAIN (spec_types
);
2497 /* Compute the merged default arguments. */
2499 copy_default_args_to_explicit_spec_1 (spec_types
, tmpl_types
);
2501 /* Compute the new FUNCTION_TYPE. */
2505 new_spec_types
= hash_tree_cons (TREE_PURPOSE (vtt
),
2510 /* Put the in-charge parameter back. */
2511 new_spec_types
= hash_tree_cons (TREE_PURPOSE (in_charge
),
2512 TREE_VALUE (in_charge
),
2515 new_type
= build_method_type_directly (object_type
,
2516 TREE_TYPE (old_type
),
2520 new_type
= build_function_type (TREE_TYPE (old_type
),
2522 new_type
= cp_build_type_attribute_variant (new_type
,
2523 TYPE_ATTRIBUTES (old_type
));
2524 new_type
= build_exception_variant (new_type
,
2525 TYPE_RAISES_EXCEPTIONS (old_type
));
2527 if (TYPE_HAS_LATE_RETURN_TYPE (old_type
))
2528 TYPE_HAS_LATE_RETURN_TYPE (new_type
) = 1;
2530 TREE_TYPE (decl
) = new_type
;
2533 /* Return the number of template headers we expect to see for a definition
2534 or specialization of CTYPE or one of its non-template members. */
2537 num_template_headers_for_class (tree ctype
)
2539 int num_templates
= 0;
2541 while (ctype
&& CLASS_TYPE_P (ctype
))
2543 /* You're supposed to have one `template <...>' for every
2544 template class, but you don't need one for a full
2545 specialization. For example:
2547 template <class T> struct S{};
2548 template <> struct S<int> { void f(); };
2549 void S<int>::f () {}
2551 is correct; there shouldn't be a `template <>' for the
2552 definition of `S<int>::f'. */
2553 if (!CLASSTYPE_TEMPLATE_INFO (ctype
))
2554 /* If CTYPE does not have template information of any
2555 kind, then it is not a template, nor is it nested
2556 within a template. */
2558 if (explicit_class_specialization_p (ctype
))
2560 if (PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (ctype
)))
2563 ctype
= TYPE_CONTEXT (ctype
);
2566 return num_templates
;
2569 /* Do a simple sanity check on the template headers that precede the
2570 variable declaration DECL. */
2573 check_template_variable (tree decl
)
2575 tree ctx
= CP_DECL_CONTEXT (decl
);
2576 int wanted
= num_template_headers_for_class (ctx
);
2577 if (DECL_LANG_SPECIFIC (decl
) && DECL_TEMPLATE_INFO (decl
)
2578 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (decl
)))
2580 if (cxx_dialect
< cxx14
)
2581 pedwarn (DECL_SOURCE_LOCATION (decl
), 0,
2582 "variable templates only available with "
2583 "-std=c++14 or -std=gnu++14");
2585 // Namespace-scope variable templates should have a template header.
2588 if (template_header_count
> wanted
)
2590 bool warned
= pedwarn (DECL_SOURCE_LOCATION (decl
), 0,
2591 "too many template headers for %D (should be %d)",
2593 if (warned
&& CLASS_TYPE_P (ctx
)
2594 && CLASSTYPE_TEMPLATE_SPECIALIZATION (ctx
))
2595 inform (DECL_SOURCE_LOCATION (decl
),
2596 "members of an explicitly specialized class are defined "
2597 "without a template header");
2601 /* Check to see if the function just declared, as indicated in
2602 DECLARATOR, and in DECL, is a specialization of a function
2603 template. We may also discover that the declaration is an explicit
2604 instantiation at this point.
2606 Returns DECL, or an equivalent declaration that should be used
2607 instead if all goes well. Issues an error message if something is
2608 amiss. Returns error_mark_node if the error is not easily
2611 FLAGS is a bitmask consisting of the following flags:
2613 2: The function has a definition.
2614 4: The function is a friend.
2616 The TEMPLATE_COUNT is the number of references to qualifying
2617 template classes that appeared in the name of the function. For
2620 template <class T> struct S { void f(); };
2623 the TEMPLATE_COUNT would be 1. However, explicitly specialized
2624 classes are not counted in the TEMPLATE_COUNT, so that in
2626 template <class T> struct S {};
2627 template <> struct S<int> { void f(); }
2628 template <> void S<int>::f();
2630 the TEMPLATE_COUNT would be 0. (Note that this declaration is
2631 invalid; there should be no template <>.)
2633 If the function is a specialization, it is marked as such via
2634 DECL_TEMPLATE_SPECIALIZATION. Furthermore, its DECL_TEMPLATE_INFO
2635 is set up correctly, and it is added to the list of specializations
2636 for that template. */
2639 check_explicit_specialization (tree declarator
,
2644 int have_def
= flags
& 2;
2645 int is_friend
= flags
& 4;
2646 bool is_concept
= flags
& 8;
2647 int specialization
= 0;
2648 int explicit_instantiation
= 0;
2649 int member_specialization
= 0;
2650 tree ctype
= DECL_CLASS_CONTEXT (decl
);
2651 tree dname
= DECL_NAME (decl
);
2656 if (!processing_specialization
)
2659 tsk
= tsk_excessive_parms
;
2662 tsk
= current_tmpl_spec_kind (template_count
);
2667 if (processing_specialization
&& !VAR_P (decl
))
2670 SET_DECL_TEMPLATE_SPECIALIZATION (decl
);
2672 else if (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
)
2675 /* This could be something like:
2677 template <class T> void f(T);
2678 class S { friend void f<>(int); } */
2682 /* This case handles bogus declarations like template <>
2683 template <class T> void f<int>(); */
2685 error ("template-id %qD in declaration of primary template",
2692 case tsk_invalid_member_spec
:
2693 /* The error has already been reported in
2694 check_specialization_scope. */
2695 return error_mark_node
;
2697 case tsk_invalid_expl_inst
:
2698 error ("template parameter list used in explicit instantiation");
2704 error ("definition provided for explicit instantiation");
2706 explicit_instantiation
= 1;
2709 case tsk_excessive_parms
:
2710 case tsk_insufficient_parms
:
2711 if (tsk
== tsk_excessive_parms
)
2712 error ("too many template parameter lists in declaration of %qD",
2714 else if (template_header_count
)
2715 error("too few template parameter lists in declaration of %qD", decl
);
2717 error("explicit specialization of %qD must be introduced by "
2718 "%<template <>%>", decl
);
2723 error ("explicit specialization declared %<concept%>");
2725 if (VAR_P (decl
) && TREE_CODE (declarator
) != TEMPLATE_ID_EXPR
)
2726 /* In cases like template<> constexpr bool v = true;
2727 We'll give an error in check_template_variable. */
2730 SET_DECL_TEMPLATE_SPECIALIZATION (decl
);
2732 member_specialization
= 1;
2738 if (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
)
2740 /* This case handles bogus declarations like template <>
2741 template <class T> void f<int>(); */
2743 if (!uses_template_parms (declarator
))
2744 error ("template-id %qD in declaration of primary template",
2746 else if (variable_template_p (TREE_OPERAND (declarator
, 0)))
2748 /* Partial specialization of variable template. */
2749 SET_DECL_TEMPLATE_SPECIALIZATION (decl
);
2753 else if (cxx_dialect
< cxx14
)
2754 error ("non-type partial specialization %qD "
2755 "is not allowed", declarator
);
2757 error ("non-class, non-variable partial specialization %qD "
2758 "is not allowed", declarator
);
2763 if (ctype
&& CLASSTYPE_TEMPLATE_INSTANTIATION (ctype
))
2764 /* This is a specialization of a member template, without
2765 specialization the containing class. Something like:
2767 template <class T> struct S {
2768 template <class U> void f (U);
2770 template <> template <class U> void S<int>::f(U) {}
2772 That's a specialization -- but of the entire template. */
2780 if ((specialization
|| member_specialization
)
2781 /* This doesn't apply to variable templates. */
2782 && (TREE_CODE (TREE_TYPE (decl
)) == FUNCTION_TYPE
2783 || TREE_CODE (TREE_TYPE (decl
)) == METHOD_TYPE
))
2785 tree t
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
2786 for (; t
; t
= TREE_CHAIN (t
))
2787 if (TREE_PURPOSE (t
))
2789 permerror (input_location
,
2790 "default argument specified in explicit specialization");
2795 if (specialization
|| member_specialization
|| explicit_instantiation
)
2797 tree tmpl
= NULL_TREE
;
2798 tree targs
= NULL_TREE
;
2799 bool was_template_id
= (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
);
2801 /* Make sure that the declarator is a TEMPLATE_ID_EXPR. */
2802 if (!was_template_id
)
2806 gcc_assert (identifier_p (declarator
));
2811 /* If there is no class context, the explicit instantiation
2812 must be at namespace scope. */
2813 gcc_assert (DECL_NAMESPACE_SCOPE_P (decl
));
2815 /* Find the namespace binding, using the declaration
2817 fns
= lookup_qualified_name (CP_DECL_CONTEXT (decl
), dname
,
2819 if (fns
== error_mark_node
|| !is_overloaded_fn (fns
))
2821 error ("%qD is not a template function", dname
);
2822 fns
= error_mark_node
;
2826 tree fn
= OVL_CURRENT (fns
);
2827 if (!is_associated_namespace (CP_DECL_CONTEXT (decl
),
2828 CP_DECL_CONTEXT (fn
)))
2829 error ("%qD is not declared in %qD",
2830 decl
, current_namespace
);
2834 declarator
= lookup_template_function (fns
, NULL_TREE
);
2837 if (declarator
== error_mark_node
)
2838 return error_mark_node
;
2840 if (ctype
!= NULL_TREE
&& TYPE_BEING_DEFINED (ctype
))
2842 if (!explicit_instantiation
)
2843 /* A specialization in class scope. This is invalid,
2844 but the error will already have been flagged by
2845 check_specialization_scope. */
2846 return error_mark_node
;
2849 /* It's not valid to write an explicit instantiation in
2852 class C { template void f(); }
2854 This case is caught by the parser. However, on
2857 template class C { void f(); };
2859 (which is invalid) we can get here. The error will be
2866 else if (ctype
!= NULL_TREE
2867 && (identifier_p (TREE_OPERAND (declarator
, 0))))
2869 // We'll match variable templates in start_decl.
2873 /* Find the list of functions in ctype that have the same
2874 name as the declared function. */
2875 tree name
= TREE_OPERAND (declarator
, 0);
2876 tree fns
= NULL_TREE
;
2879 if (constructor_name_p (name
, ctype
))
2881 int is_constructor
= DECL_CONSTRUCTOR_P (decl
);
2883 if (is_constructor
? !TYPE_HAS_USER_CONSTRUCTOR (ctype
)
2884 : !CLASSTYPE_DESTRUCTORS (ctype
))
2886 /* From [temp.expl.spec]:
2888 If such an explicit specialization for the member
2889 of a class template names an implicitly-declared
2890 special member function (clause _special_), the
2891 program is ill-formed.
2893 Similar language is found in [temp.explicit]. */
2894 error ("specialization of implicitly-declared special member function");
2895 return error_mark_node
;
2898 name
= is_constructor
? ctor_identifier
: dtor_identifier
;
2901 if (!DECL_CONV_FN_P (decl
))
2903 idx
= lookup_fnfields_1 (ctype
, name
);
2905 fns
= (*CLASSTYPE_METHOD_VEC (ctype
))[idx
];
2909 vec
<tree
, va_gc
> *methods
;
2912 /* For a type-conversion operator, we cannot do a
2913 name-based lookup. We might be looking for `operator
2914 int' which will be a specialization of `operator T'.
2915 So, we find *all* the conversion operators, and then
2916 select from them. */
2919 methods
= CLASSTYPE_METHOD_VEC (ctype
);
2921 for (idx
= CLASSTYPE_FIRST_CONVERSION_SLOT
;
2922 methods
->iterate (idx
, &ovl
);
2925 if (!DECL_CONV_FN_P (OVL_CURRENT (ovl
)))
2926 /* There are no more conversion functions. */
2929 /* Glue all these conversion functions together
2930 with those we already have. */
2931 for (; ovl
; ovl
= OVL_NEXT (ovl
))
2932 fns
= ovl_cons (OVL_CURRENT (ovl
), fns
);
2936 if (fns
== NULL_TREE
)
2938 error ("no member function %qD declared in %qT", name
, ctype
);
2939 return error_mark_node
;
2942 TREE_OPERAND (declarator
, 0) = fns
;
2945 /* Figure out what exactly is being specialized at this point.
2946 Note that for an explicit instantiation, even one for a
2947 member function, we cannot tell apriori whether the
2948 instantiation is for a member template, or just a member
2949 function of a template class. Even if a member template is
2950 being instantiated, the member template arguments may be
2951 elided if they can be deduced from the rest of the
2953 tmpl
= determine_specialization (declarator
, decl
,
2955 member_specialization
,
2959 if (!tmpl
|| tmpl
== error_mark_node
)
2960 /* We couldn't figure out what this declaration was
2962 return error_mark_node
;
2965 tree gen_tmpl
= most_general_template (tmpl
);
2967 if (explicit_instantiation
)
2969 /* We don't set DECL_EXPLICIT_INSTANTIATION here; that
2970 is done by do_decl_instantiation later. */
2972 int arg_depth
= TMPL_ARGS_DEPTH (targs
);
2973 int parm_depth
= TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl
));
2975 if (arg_depth
> parm_depth
)
2977 /* If TMPL is not the most general template (for
2978 example, if TMPL is a friend template that is
2979 injected into namespace scope), then there will
2980 be too many levels of TARGS. Remove some of them
2985 new_targs
= make_tree_vec (parm_depth
);
2986 for (i
= arg_depth
- parm_depth
; i
< arg_depth
; ++i
)
2987 TREE_VEC_ELT (new_targs
, i
- (arg_depth
- parm_depth
))
2988 = TREE_VEC_ELT (targs
, i
);
2992 return instantiate_template (tmpl
, targs
, tf_error
);
2995 /* If we thought that the DECL was a member function, but it
2996 turns out to be specializing a static member function,
2997 make DECL a static member function as well. */
2998 if (DECL_FUNCTION_TEMPLATE_P (tmpl
)
2999 && DECL_STATIC_FUNCTION_P (tmpl
)
3000 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
3001 revert_static_member_fn (decl
);
3003 /* If this is a specialization of a member template of a
3004 template class, we want to return the TEMPLATE_DECL, not
3005 the specialization of it. */
3006 if (tsk
== tsk_template
&& !was_template_id
)
3008 tree result
= DECL_TEMPLATE_RESULT (tmpl
);
3009 SET_DECL_TEMPLATE_SPECIALIZATION (tmpl
);
3010 DECL_INITIAL (result
) = NULL_TREE
;
3014 DECL_SOURCE_LOCATION (tmpl
) = DECL_SOURCE_LOCATION (decl
);
3015 DECL_SOURCE_LOCATION (result
)
3016 = DECL_SOURCE_LOCATION (decl
);
3017 /* We want to use the argument list specified in the
3018 definition, not in the original declaration. */
3019 DECL_ARGUMENTS (result
) = DECL_ARGUMENTS (decl
);
3020 for (parm
= DECL_ARGUMENTS (result
); parm
;
3021 parm
= DECL_CHAIN (parm
))
3022 DECL_CONTEXT (parm
) = result
;
3024 return register_specialization (tmpl
, gen_tmpl
, targs
,
3028 /* Set up the DECL_TEMPLATE_INFO for DECL. */
3029 DECL_TEMPLATE_INFO (decl
) = build_template_info (tmpl
, targs
);
3031 if (was_template_id
)
3032 TINFO_USED_TEMPLATE_ID (DECL_TEMPLATE_INFO (decl
)) = true;
3034 /* Inherit default function arguments from the template
3035 DECL is specializing. */
3036 if (DECL_FUNCTION_TEMPLATE_P (tmpl
))
3037 copy_default_args_to_explicit_spec (decl
);
3039 /* This specialization has the same protection as the
3040 template it specializes. */
3041 TREE_PRIVATE (decl
) = TREE_PRIVATE (gen_tmpl
);
3042 TREE_PROTECTED (decl
) = TREE_PROTECTED (gen_tmpl
);
3044 /* 7.1.1-1 [dcl.stc]
3046 A storage-class-specifier shall not be specified in an
3047 explicit specialization...
3049 The parser rejects these, so unless action is taken here,
3050 explicit function specializations will always appear with
3053 The action recommended by the C++ CWG in response to C++
3054 defect report 605 is to make the storage class and linkage
3055 of the explicit specialization match the templated function:
3057 http://www.open-std.org/jtc1/sc22/wg21/docs/cwg_active.html#605
3059 if (tsk
== tsk_expl_spec
&& DECL_FUNCTION_TEMPLATE_P (gen_tmpl
))
3061 tree tmpl_func
= DECL_TEMPLATE_RESULT (gen_tmpl
);
3062 gcc_assert (TREE_CODE (tmpl_func
) == FUNCTION_DECL
);
3064 /* A concept cannot be specialized. */
3065 if (DECL_DECLARED_CONCEPT_P (tmpl_func
))
3067 error ("explicit specialization of function concept %qD",
3069 return error_mark_node
;
3072 /* This specialization has the same linkage and visibility as
3073 the function template it specializes. */
3074 TREE_PUBLIC (decl
) = TREE_PUBLIC (tmpl_func
);
3075 if (! TREE_PUBLIC (decl
))
3077 DECL_INTERFACE_KNOWN (decl
) = 1;
3078 DECL_NOT_REALLY_EXTERN (decl
) = 1;
3080 DECL_THIS_STATIC (decl
) = DECL_THIS_STATIC (tmpl_func
);
3081 if (DECL_VISIBILITY_SPECIFIED (tmpl_func
))
3083 DECL_VISIBILITY_SPECIFIED (decl
) = 1;
3084 DECL_VISIBILITY (decl
) = DECL_VISIBILITY (tmpl_func
);
3088 /* If DECL is a friend declaration, declared using an
3089 unqualified name, the namespace associated with DECL may
3090 have been set incorrectly. For example, in:
3092 template <typename T> void f(T);
3094 struct S { friend void f<int>(int); }
3097 we will have set the DECL_CONTEXT for the friend
3098 declaration to N, rather than to the global namespace. */
3099 if (DECL_NAMESPACE_SCOPE_P (decl
))
3100 DECL_CONTEXT (decl
) = DECL_CONTEXT (tmpl
);
3102 if (is_friend
&& !have_def
)
3103 /* This is not really a declaration of a specialization.
3104 It's just the name of an instantiation. But, it's not
3105 a request for an instantiation, either. */
3106 SET_DECL_IMPLICIT_INSTANTIATION (decl
);
3107 else if (TREE_CODE (decl
) == FUNCTION_DECL
)
3108 /* A specialization is not necessarily COMDAT. */
3109 DECL_COMDAT (decl
) = (TREE_PUBLIC (decl
)
3110 && DECL_DECLARED_INLINE_P (decl
));
3111 else if (VAR_P (decl
))
3112 DECL_COMDAT (decl
) = false;
3114 /* If this is a full specialization, register it so that we can find
3115 it again. Partial specializations will be registered in
3116 process_partial_specialization. */
3117 if (!processing_template_decl
)
3118 decl
= register_specialization (decl
, gen_tmpl
, targs
,
3121 /* A 'structor should already have clones. */
3122 gcc_assert (decl
== error_mark_node
3123 || variable_template_p (tmpl
)
3124 || !(DECL_CONSTRUCTOR_P (decl
)
3125 || DECL_DESTRUCTOR_P (decl
))
3126 || DECL_CLONED_FUNCTION_P (DECL_CHAIN (decl
)));
3133 /* Returns 1 iff PARMS1 and PARMS2 are identical sets of template
3134 parameters. These are represented in the same format used for
3135 DECL_TEMPLATE_PARMS. */
3138 comp_template_parms (const_tree parms1
, const_tree parms2
)
3143 if (parms1
== parms2
)
3146 for (p1
= parms1
, p2
= parms2
;
3147 p1
!= NULL_TREE
&& p2
!= NULL_TREE
;
3148 p1
= TREE_CHAIN (p1
), p2
= TREE_CHAIN (p2
))
3150 tree t1
= TREE_VALUE (p1
);
3151 tree t2
= TREE_VALUE (p2
);
3154 gcc_assert (TREE_CODE (t1
) == TREE_VEC
);
3155 gcc_assert (TREE_CODE (t2
) == TREE_VEC
);
3157 if (TREE_VEC_LENGTH (t1
) != TREE_VEC_LENGTH (t2
))
3160 for (i
= 0; i
< TREE_VEC_LENGTH (t2
); ++i
)
3162 tree parm1
= TREE_VALUE (TREE_VEC_ELT (t1
, i
));
3163 tree parm2
= TREE_VALUE (TREE_VEC_ELT (t2
, i
));
3165 /* If either of the template parameters are invalid, assume
3166 they match for the sake of error recovery. */
3167 if (error_operand_p (parm1
) || error_operand_p (parm2
))
3170 if (TREE_CODE (parm1
) != TREE_CODE (parm2
))
3173 if (TREE_CODE (parm1
) == TEMPLATE_TYPE_PARM
3174 && (TEMPLATE_TYPE_PARAMETER_PACK (parm1
)
3175 == TEMPLATE_TYPE_PARAMETER_PACK (parm2
)))
3177 else if (!same_type_p (TREE_TYPE (parm1
), TREE_TYPE (parm2
)))
3182 if ((p1
!= NULL_TREE
) != (p2
!= NULL_TREE
))
3183 /* One set of parameters has more parameters lists than the
3190 /* Determine whether PARM is a parameter pack. */
3193 template_parameter_pack_p (const_tree parm
)
3195 /* Determine if we have a non-type template parameter pack. */
3196 if (TREE_CODE (parm
) == PARM_DECL
)
3197 return (DECL_TEMPLATE_PARM_P (parm
)
3198 && TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm
)));
3199 if (TREE_CODE (parm
) == TEMPLATE_PARM_INDEX
)
3200 return TEMPLATE_PARM_PARAMETER_PACK (parm
);
3202 /* If this is a list of template parameters, we could get a
3203 TYPE_DECL or a TEMPLATE_DECL. */
3204 if (TREE_CODE (parm
) == TYPE_DECL
|| TREE_CODE (parm
) == TEMPLATE_DECL
)
3205 parm
= TREE_TYPE (parm
);
3207 /* Otherwise it must be a type template parameter. */
3208 return ((TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
3209 || TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
)
3210 && TEMPLATE_TYPE_PARAMETER_PACK (parm
));
3213 /* Determine if T is a function parameter pack. */
3216 function_parameter_pack_p (const_tree t
)
3218 if (t
&& TREE_CODE (t
) == PARM_DECL
)
3219 return DECL_PACK_P (t
);
3223 /* Return the function template declaration of PRIMARY_FUNC_TMPL_INST.
3224 PRIMARY_FUNC_TMPL_INST is a primary function template instantiation. */
3227 get_function_template_decl (const_tree primary_func_tmpl_inst
)
3229 if (! primary_func_tmpl_inst
3230 || TREE_CODE (primary_func_tmpl_inst
) != FUNCTION_DECL
3231 || ! primary_template_instantiation_p (primary_func_tmpl_inst
))
3234 return DECL_TEMPLATE_RESULT (DECL_TI_TEMPLATE (primary_func_tmpl_inst
));
3237 /* Return true iff the function parameter PARAM_DECL was expanded
3238 from the function parameter pack PACK. */
3241 function_parameter_expanded_from_pack_p (tree param_decl
, tree pack
)
3243 if (DECL_ARTIFICIAL (param_decl
)
3244 || !function_parameter_pack_p (pack
))
3247 /* The parameter pack and its pack arguments have the same
3249 return DECL_PARM_INDEX (pack
) == DECL_PARM_INDEX (param_decl
);
3252 /* Determine whether ARGS describes a variadic template args list,
3253 i.e., one that is terminated by a template argument pack. */
3256 template_args_variadic_p (tree args
)
3261 if (args
== NULL_TREE
)
3264 args
= INNERMOST_TEMPLATE_ARGS (args
);
3265 nargs
= TREE_VEC_LENGTH (args
);
3270 last_parm
= TREE_VEC_ELT (args
, nargs
- 1);
3272 return ARGUMENT_PACK_P (last_parm
);
3275 /* Generate a new name for the parameter pack name NAME (an
3276 IDENTIFIER_NODE) that incorporates its */
3279 make_ith_pack_parameter_name (tree name
, int i
)
3281 /* Munge the name to include the parameter index. */
3282 #define NUMBUF_LEN 128
3283 char numbuf
[NUMBUF_LEN
];
3287 if (name
== NULL_TREE
)
3289 snprintf (numbuf
, NUMBUF_LEN
, "%i", i
);
3290 newname_len
= IDENTIFIER_LENGTH (name
)
3291 + strlen (numbuf
) + 2;
3292 newname
= (char*)alloca (newname_len
);
3293 snprintf (newname
, newname_len
,
3294 "%s#%i", IDENTIFIER_POINTER (name
), i
);
3295 return get_identifier (newname
);
3298 /* Return true if T is a primary function, class or alias template
3302 primary_template_instantiation_p (const_tree t
)
3307 if (TREE_CODE (t
) == FUNCTION_DECL
)
3308 return DECL_LANG_SPECIFIC (t
)
3309 && DECL_TEMPLATE_INSTANTIATION (t
)
3310 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (t
));
3311 else if (CLASS_TYPE_P (t
) && !TYPE_DECL_ALIAS_P (TYPE_NAME (t
)))
3312 return CLASSTYPE_TEMPLATE_INSTANTIATION (t
)
3313 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (t
));
3314 else if (alias_template_specialization_p (t
))
3319 /* Return true if PARM is a template template parameter. */
3322 template_template_parameter_p (const_tree parm
)
3324 return DECL_TEMPLATE_TEMPLATE_PARM_P (parm
);
3327 /* Return true iff PARM is a DECL representing a type template
3331 template_type_parameter_p (const_tree parm
)
3334 && (TREE_CODE (parm
) == TYPE_DECL
3335 || TREE_CODE (parm
) == TEMPLATE_DECL
)
3336 && DECL_TEMPLATE_PARM_P (parm
));
3339 /* Return the template parameters of T if T is a
3340 primary template instantiation, NULL otherwise. */
3343 get_primary_template_innermost_parameters (const_tree t
)
3345 tree parms
= NULL
, template_info
= NULL
;
3347 if ((template_info
= get_template_info (t
))
3348 && primary_template_instantiation_p (t
))
3349 parms
= INNERMOST_TEMPLATE_PARMS
3350 (DECL_TEMPLATE_PARMS (TI_TEMPLATE (template_info
)));
3355 /* Return the template parameters of the LEVELth level from the full list
3356 of template parameters PARMS. */
3359 get_template_parms_at_level (tree parms
, int level
)
3363 || TREE_CODE (parms
) != TREE_LIST
3364 || level
> TMPL_PARMS_DEPTH (parms
))
3367 for (p
= parms
; p
; p
= TREE_CHAIN (p
))
3368 if (TMPL_PARMS_DEPTH (p
) == level
)
3374 /* Returns the template arguments of T if T is a template instantiation,
3378 get_template_innermost_arguments (const_tree t
)
3380 tree args
= NULL
, template_info
= NULL
;
3382 if ((template_info
= get_template_info (t
))
3383 && TI_ARGS (template_info
))
3384 args
= INNERMOST_TEMPLATE_ARGS (TI_ARGS (template_info
));
3389 /* Return the argument pack elements of T if T is a template argument pack,
3393 get_template_argument_pack_elems (const_tree t
)
3395 if (TREE_CODE (t
) != TYPE_ARGUMENT_PACK
3396 && TREE_CODE (t
) != NONTYPE_ARGUMENT_PACK
)
3399 return ARGUMENT_PACK_ARGS (t
);
3402 /* Structure used to track the progress of find_parameter_packs_r. */
3403 struct find_parameter_pack_data
3405 /* TREE_LIST that will contain all of the parameter packs found by
3407 tree
* parameter_packs
;
3409 /* Set of AST nodes that have been visited by the traversal. */
3410 hash_set
<tree
> *visited
;
3413 /* Identifies all of the argument packs that occur in a template
3414 argument and appends them to the TREE_LIST inside DATA, which is a
3415 find_parameter_pack_data structure. This is a subroutine of
3416 make_pack_expansion and uses_parameter_packs. */
3418 find_parameter_packs_r (tree
*tp
, int *walk_subtrees
, void* data
)
3421 struct find_parameter_pack_data
* ppd
=
3422 (struct find_parameter_pack_data
*)data
;
3423 bool parameter_pack_p
= false;
3425 /* Handle type aliases/typedefs. */
3426 if (TYPE_ALIAS_P (t
))
3428 if (TYPE_TEMPLATE_INFO (t
))
3429 cp_walk_tree (&TYPE_TI_ARGS (t
),
3430 &find_parameter_packs_r
,
3436 /* Identify whether this is a parameter pack or not. */
3437 switch (TREE_CODE (t
))
3439 case TEMPLATE_PARM_INDEX
:
3440 if (TEMPLATE_PARM_PARAMETER_PACK (t
))
3441 parameter_pack_p
= true;
3444 case TEMPLATE_TYPE_PARM
:
3445 t
= TYPE_MAIN_VARIANT (t
);
3446 case TEMPLATE_TEMPLATE_PARM
:
3447 if (TEMPLATE_TYPE_PARAMETER_PACK (t
))
3448 parameter_pack_p
= true;
3453 if (DECL_PACK_P (t
))
3455 /* We don't want to walk into the type of a PARM_DECL,
3456 because we don't want to see the type parameter pack. */
3458 parameter_pack_p
= true;
3462 /* Look through a lambda capture proxy to the field pack. */
3464 if (DECL_HAS_VALUE_EXPR_P (t
))
3466 tree v
= DECL_VALUE_EXPR (t
);
3468 &find_parameter_packs_r
,
3472 else if (variable_template_specialization_p (t
))
3474 cp_walk_tree (&DECL_TI_ARGS (t
),
3475 find_parameter_packs_r
,
3482 parameter_pack_p
= true;
3485 /* Not a parameter pack. */
3489 if (parameter_pack_p
)
3491 /* Add this parameter pack to the list. */
3492 *ppd
->parameter_packs
= tree_cons (NULL_TREE
, t
, *ppd
->parameter_packs
);
3496 cp_walk_tree (&TYPE_CONTEXT (t
),
3497 &find_parameter_packs_r
, ppd
, ppd
->visited
);
3499 /* This switch statement will return immediately if we don't find a
3501 switch (TREE_CODE (t
))
3503 case TEMPLATE_PARM_INDEX
:
3506 case BOUND_TEMPLATE_TEMPLATE_PARM
:
3507 /* Check the template itself. */
3508 cp_walk_tree (&TREE_TYPE (TYPE_TI_TEMPLATE (t
)),
3509 &find_parameter_packs_r
, ppd
, ppd
->visited
);
3510 /* Check the template arguments. */
3511 cp_walk_tree (&TYPE_TI_ARGS (t
), &find_parameter_packs_r
, ppd
,
3516 case TEMPLATE_TYPE_PARM
:
3517 case TEMPLATE_TEMPLATE_PARM
:
3524 if (TYPE_PTRMEMFUNC_P (t
))
3530 if (TYPE_TEMPLATE_INFO (t
))
3531 cp_walk_tree (&TYPE_TI_ARGS (t
),
3532 &find_parameter_packs_r
, ppd
, ppd
->visited
);
3539 cp_walk_tree (&TREE_TYPE (t
),
3540 &find_parameter_packs_r
, ppd
, ppd
->visited
);
3544 cp_walk_tree (&TYPENAME_TYPE_FULLNAME (t
), &find_parameter_packs_r
,
3549 case TYPE_PACK_EXPANSION
:
3550 case EXPR_PACK_EXPANSION
:
3555 cp_walk_tree (&TYPE_MAX_VALUE (t
), &find_parameter_packs_r
,
3560 case IDENTIFIER_NODE
:
3561 cp_walk_tree (&TREE_TYPE (t
), &find_parameter_packs_r
, ppd
,
3573 /* Determines if the expression or type T uses any parameter packs. */
3575 uses_parameter_packs (tree t
)
3577 tree parameter_packs
= NULL_TREE
;
3578 struct find_parameter_pack_data ppd
;
3579 ppd
.parameter_packs
= ¶meter_packs
;
3580 ppd
.visited
= new hash_set
<tree
>;
3581 cp_walk_tree (&t
, &find_parameter_packs_r
, &ppd
, ppd
.visited
);
3583 return parameter_packs
!= NULL_TREE
;
3586 /* Turn ARG, which may be an expression, type, or a TREE_LIST
3587 representation a base-class initializer into a parameter pack
3588 expansion. If all goes well, the resulting node will be an
3589 EXPR_PACK_EXPANSION, TYPE_PACK_EXPANSION, or TREE_LIST,
3592 make_pack_expansion (tree arg
)
3595 tree parameter_packs
= NULL_TREE
;
3596 bool for_types
= false;
3597 struct find_parameter_pack_data ppd
;
3599 if (!arg
|| arg
== error_mark_node
)
3602 if (TREE_CODE (arg
) == TREE_LIST
&& TREE_PURPOSE (arg
))
3604 /* A TREE_LIST with a non-null TREE_PURPOSE is for a base
3605 class initializer. In this case, the TREE_PURPOSE will be a
3606 _TYPE node (representing the base class expansion we're
3607 initializing) and the TREE_VALUE will be a TREE_LIST
3608 containing the initialization arguments.
3610 The resulting expansion looks somewhat different from most
3611 expansions. Rather than returning just one _EXPANSION, we
3612 return a TREE_LIST whose TREE_PURPOSE is a
3613 TYPE_PACK_EXPANSION containing the bases that will be
3614 initialized. The TREE_VALUE will be identical to the
3615 original TREE_VALUE, which is a list of arguments that will
3616 be passed to each base. We do not introduce any new pack
3617 expansion nodes into the TREE_VALUE (although it is possible
3618 that some already exist), because the TREE_PURPOSE and
3619 TREE_VALUE all need to be expanded together with the same
3620 _EXPANSION node. Note that the TYPE_PACK_EXPANSION in the
3621 resulting TREE_PURPOSE will mention the parameter packs in
3622 both the bases and the arguments to the bases. */
3625 tree parameter_packs
= NULL_TREE
;
3627 /* Determine which parameter packs will be used by the base
3629 ppd
.visited
= new hash_set
<tree
>;
3630 ppd
.parameter_packs
= ¶meter_packs
;
3631 cp_walk_tree (&TREE_PURPOSE (arg
), &find_parameter_packs_r
,
3634 if (parameter_packs
== NULL_TREE
)
3636 error ("base initializer expansion %<%T%> contains no parameter packs", arg
);
3638 return error_mark_node
;
3641 if (TREE_VALUE (arg
) != void_type_node
)
3643 /* Collect the sets of parameter packs used in each of the
3644 initialization arguments. */
3645 for (value
= TREE_VALUE (arg
); value
; value
= TREE_CHAIN (value
))
3647 /* Determine which parameter packs will be expanded in this
3649 cp_walk_tree (&TREE_VALUE (value
), &find_parameter_packs_r
,
3656 /* Create the pack expansion type for the base type. */
3657 purpose
= cxx_make_type (TYPE_PACK_EXPANSION
);
3658 SET_PACK_EXPANSION_PATTERN (purpose
, TREE_PURPOSE (arg
));
3659 PACK_EXPANSION_PARAMETER_PACKS (purpose
) = parameter_packs
;
3661 /* Just use structural equality for these TYPE_PACK_EXPANSIONS;
3662 they will rarely be compared to anything. */
3663 SET_TYPE_STRUCTURAL_EQUALITY (purpose
);
3665 return tree_cons (purpose
, TREE_VALUE (arg
), NULL_TREE
);
3668 if (TYPE_P (arg
) || TREE_CODE (arg
) == TEMPLATE_DECL
)
3671 /* Build the PACK_EXPANSION_* node. */
3673 ? cxx_make_type (TYPE_PACK_EXPANSION
)
3674 : make_node (EXPR_PACK_EXPANSION
);
3675 SET_PACK_EXPANSION_PATTERN (result
, arg
);
3676 if (TREE_CODE (result
) == EXPR_PACK_EXPANSION
)
3678 /* Propagate type and const-expression information. */
3679 TREE_TYPE (result
) = TREE_TYPE (arg
);
3680 TREE_CONSTANT (result
) = TREE_CONSTANT (arg
);
3683 /* Just use structural equality for these TYPE_PACK_EXPANSIONS;
3684 they will rarely be compared to anything. */
3685 SET_TYPE_STRUCTURAL_EQUALITY (result
);
3687 /* Determine which parameter packs will be expanded. */
3688 ppd
.parameter_packs
= ¶meter_packs
;
3689 ppd
.visited
= new hash_set
<tree
>;
3690 cp_walk_tree (&arg
, &find_parameter_packs_r
, &ppd
, ppd
.visited
);
3693 /* Make sure we found some parameter packs. */
3694 if (parameter_packs
== NULL_TREE
)
3697 error ("expansion pattern %<%T%> contains no argument packs", arg
);
3699 error ("expansion pattern %<%E%> contains no argument packs", arg
);
3700 return error_mark_node
;
3702 PACK_EXPANSION_PARAMETER_PACKS (result
) = parameter_packs
;
3704 PACK_EXPANSION_LOCAL_P (result
) = at_function_scope_p ();
3709 /* Checks T for any "bare" parameter packs, which have not yet been
3710 expanded, and issues an error if any are found. This operation can
3711 only be done on full expressions or types (e.g., an expression
3712 statement, "if" condition, etc.), because we could have expressions like:
3714 foo(f(g(h(args)))...)
3716 where "args" is a parameter pack. check_for_bare_parameter_packs
3717 should not be called for the subexpressions args, h(args),
3718 g(h(args)), or f(g(h(args))), because we would produce erroneous
3721 Returns TRUE and emits an error if there were bare parameter packs,
3722 returns FALSE otherwise. */
3724 check_for_bare_parameter_packs (tree t
)
3726 tree parameter_packs
= NULL_TREE
;
3727 struct find_parameter_pack_data ppd
;
3729 if (!processing_template_decl
|| !t
|| t
== error_mark_node
)
3732 if (TREE_CODE (t
) == TYPE_DECL
)
3735 ppd
.parameter_packs
= ¶meter_packs
;
3736 ppd
.visited
= new hash_set
<tree
>;
3737 cp_walk_tree (&t
, &find_parameter_packs_r
, &ppd
, ppd
.visited
);
3740 if (parameter_packs
)
3742 error ("parameter packs not expanded with %<...%>:");
3743 while (parameter_packs
)
3745 tree pack
= TREE_VALUE (parameter_packs
);
3746 tree name
= NULL_TREE
;
3748 if (TREE_CODE (pack
) == TEMPLATE_TYPE_PARM
3749 || TREE_CODE (pack
) == TEMPLATE_TEMPLATE_PARM
)
3750 name
= TYPE_NAME (pack
);
3751 else if (TREE_CODE (pack
) == TEMPLATE_PARM_INDEX
)
3752 name
= DECL_NAME (TEMPLATE_PARM_DECL (pack
));
3754 name
= DECL_NAME (pack
);
3757 inform (input_location
, " %qD", name
);
3759 inform (input_location
, " <anonymous>");
3761 parameter_packs
= TREE_CHAIN (parameter_packs
);
3770 /* Expand any parameter packs that occur in the template arguments in
3773 expand_template_argument_pack (tree args
)
3775 tree result_args
= NULL_TREE
;
3776 int in_arg
, out_arg
= 0, nargs
= args
? TREE_VEC_LENGTH (args
) : 0;
3777 int num_result_args
= -1;
3778 int non_default_args_count
= -1;
3780 /* First, determine if we need to expand anything, and the number of
3781 slots we'll need. */
3782 for (in_arg
= 0; in_arg
< nargs
; ++in_arg
)
3784 tree arg
= TREE_VEC_ELT (args
, in_arg
);
3785 if (arg
== NULL_TREE
)
3787 if (ARGUMENT_PACK_P (arg
))
3789 int num_packed
= TREE_VEC_LENGTH (ARGUMENT_PACK_ARGS (arg
));
3790 if (num_result_args
< 0)
3791 num_result_args
= in_arg
+ num_packed
;
3793 num_result_args
+= num_packed
;
3797 if (num_result_args
>= 0)
3802 /* If no expansion is necessary, we're done. */
3803 if (num_result_args
< 0)
3806 /* Expand arguments. */
3807 result_args
= make_tree_vec (num_result_args
);
3808 if (NON_DEFAULT_TEMPLATE_ARGS_COUNT (args
))
3809 non_default_args_count
=
3810 GET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (args
);
3811 for (in_arg
= 0; in_arg
< nargs
; ++in_arg
)
3813 tree arg
= TREE_VEC_ELT (args
, in_arg
);
3814 if (ARGUMENT_PACK_P (arg
))
3816 tree packed
= ARGUMENT_PACK_ARGS (arg
);
3817 int i
, num_packed
= TREE_VEC_LENGTH (packed
);
3818 for (i
= 0; i
< num_packed
; ++i
, ++out_arg
)
3819 TREE_VEC_ELT (result_args
, out_arg
) = TREE_VEC_ELT(packed
, i
);
3820 if (non_default_args_count
> 0)
3821 non_default_args_count
+= num_packed
- 1;
3825 TREE_VEC_ELT (result_args
, out_arg
) = arg
;
3829 if (non_default_args_count
>= 0)
3830 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (result_args
, non_default_args_count
);
3834 /* Checks if DECL shadows a template parameter.
3836 [temp.local]: A template-parameter shall not be redeclared within its
3837 scope (including nested scopes).
3839 Emits an error and returns TRUE if the DECL shadows a parameter,
3840 returns FALSE otherwise. */
3843 check_template_shadow (tree decl
)
3847 /* If we're not in a template, we can't possibly shadow a template
3849 if (!current_template_parms
)
3852 /* Figure out what we're shadowing. */
3853 if (TREE_CODE (decl
) == OVERLOAD
)
3854 decl
= OVL_CURRENT (decl
);
3855 olddecl
= innermost_non_namespace_value (DECL_NAME (decl
));
3857 /* If there's no previous binding for this name, we're not shadowing
3858 anything, let alone a template parameter. */
3862 /* If we're not shadowing a template parameter, we're done. Note
3863 that OLDDECL might be an OVERLOAD (or perhaps even an
3864 ERROR_MARK), so we can't just blithely assume it to be a _DECL
3866 if (!DECL_P (olddecl
) || !DECL_TEMPLATE_PARM_P (olddecl
))
3869 /* We check for decl != olddecl to avoid bogus errors for using a
3870 name inside a class. We check TPFI to avoid duplicate errors for
3871 inline member templates. */
3873 || (DECL_TEMPLATE_PARM_P (decl
)
3874 && TEMPLATE_PARMS_FOR_INLINE (current_template_parms
)))
3877 /* Don't complain about the injected class name, as we've already
3878 complained about the class itself. */
3879 if (DECL_SELF_REFERENCE_P (decl
))
3882 if (DECL_TEMPLATE_PARM_P (decl
))
3883 error ("declaration of template parameter %q+D shadows "
3884 "template parameter", decl
);
3886 error ("declaration of %q+#D shadows template parameter", decl
);
3887 inform (DECL_SOURCE_LOCATION (olddecl
),
3888 "template parameter %qD declared here", olddecl
);
3892 /* Return a new TEMPLATE_PARM_INDEX with the indicated INDEX, LEVEL,
3893 ORIG_LEVEL, DECL, and TYPE. */
3896 build_template_parm_index (int index
,
3902 tree t
= make_node (TEMPLATE_PARM_INDEX
);
3903 TEMPLATE_PARM_IDX (t
) = index
;
3904 TEMPLATE_PARM_LEVEL (t
) = level
;
3905 TEMPLATE_PARM_ORIG_LEVEL (t
) = orig_level
;
3906 TEMPLATE_PARM_DECL (t
) = decl
;
3907 TREE_TYPE (t
) = type
;
3908 TREE_CONSTANT (t
) = TREE_CONSTANT (decl
);
3909 TREE_READONLY (t
) = TREE_READONLY (decl
);
3914 /* Find the canonical type parameter for the given template type
3915 parameter. Returns the canonical type parameter, which may be TYPE
3916 if no such parameter existed. */
3919 canonical_type_parameter (tree type
)
3922 int idx
= TEMPLATE_TYPE_IDX (type
);
3923 if (!canonical_template_parms
)
3924 vec_alloc (canonical_template_parms
, idx
+1);
3926 while (canonical_template_parms
->length () <= (unsigned)idx
)
3927 vec_safe_push (canonical_template_parms
, NULL_TREE
);
3929 list
= (*canonical_template_parms
)[idx
];
3930 while (list
&& !comptypes (type
, TREE_VALUE (list
), COMPARE_STRUCTURAL
))
3931 list
= TREE_CHAIN (list
);
3934 return TREE_VALUE (list
);
3937 (*canonical_template_parms
)[idx
]
3938 = tree_cons (NULL_TREE
, type
,
3939 (*canonical_template_parms
)[idx
]);
3944 /* Return a TEMPLATE_PARM_INDEX, similar to INDEX, but whose
3945 TEMPLATE_PARM_LEVEL has been decreased by LEVELS. If such a
3946 TEMPLATE_PARM_INDEX already exists, it is returned; otherwise, a
3947 new one is created. */
3950 reduce_template_parm_level (tree index
, tree type
, int levels
, tree args
,
3951 tsubst_flags_t complain
)
3953 if (TEMPLATE_PARM_DESCENDANTS (index
) == NULL_TREE
3954 || (TEMPLATE_PARM_LEVEL (TEMPLATE_PARM_DESCENDANTS (index
))
3955 != TEMPLATE_PARM_LEVEL (index
) - levels
)
3956 || !same_type_p (type
, TREE_TYPE (TEMPLATE_PARM_DESCENDANTS (index
))))
3958 tree orig_decl
= TEMPLATE_PARM_DECL (index
);
3961 decl
= build_decl (DECL_SOURCE_LOCATION (orig_decl
),
3962 TREE_CODE (orig_decl
), DECL_NAME (orig_decl
), type
);
3963 TREE_CONSTANT (decl
) = TREE_CONSTANT (orig_decl
);
3964 TREE_READONLY (decl
) = TREE_READONLY (orig_decl
);
3965 DECL_ARTIFICIAL (decl
) = 1;
3966 SET_DECL_TEMPLATE_PARM_P (decl
);
3968 t
= build_template_parm_index (TEMPLATE_PARM_IDX (index
),
3969 TEMPLATE_PARM_LEVEL (index
) - levels
,
3970 TEMPLATE_PARM_ORIG_LEVEL (index
),
3972 TEMPLATE_PARM_DESCENDANTS (index
) = t
;
3973 TEMPLATE_PARM_PARAMETER_PACK (t
)
3974 = TEMPLATE_PARM_PARAMETER_PACK (index
);
3976 /* Template template parameters need this. */
3977 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
3979 DECL_TEMPLATE_RESULT (decl
)
3980 = build_decl (DECL_SOURCE_LOCATION (decl
),
3981 TYPE_DECL
, DECL_NAME (decl
), type
);
3982 DECL_ARTIFICIAL (DECL_TEMPLATE_RESULT (decl
)) = true;
3983 DECL_TEMPLATE_PARMS (decl
) = tsubst_template_parms
3984 (DECL_TEMPLATE_PARMS (orig_decl
), args
, complain
);
3988 return TEMPLATE_PARM_DESCENDANTS (index
);
3991 /* Process information from new template parameter PARM and append it
3992 to the LIST being built. This new parameter is a non-type
3993 parameter iff IS_NON_TYPE is true. This new parameter is a
3994 parameter pack iff IS_PARAMETER_PACK is true. The location of PARM
3998 process_template_parm (tree list
, location_t parm_loc
, tree parm
,
3999 bool is_non_type
, bool is_parameter_pack
)
4004 gcc_assert (TREE_CODE (parm
) == TREE_LIST
);
4005 tree defval
= TREE_PURPOSE (parm
);
4006 tree constr
= TREE_TYPE (parm
);
4010 tree p
= tree_last (list
);
4012 if (p
&& TREE_VALUE (p
) != error_mark_node
)
4015 if (TREE_CODE (p
) == TYPE_DECL
|| TREE_CODE (p
) == TEMPLATE_DECL
)
4016 idx
= TEMPLATE_TYPE_IDX (TREE_TYPE (p
));
4018 idx
= TEMPLATE_PARM_IDX (DECL_INITIAL (p
));
4026 parm
= TREE_VALUE (parm
);
4028 SET_DECL_TEMPLATE_PARM_P (parm
);
4030 if (TREE_TYPE (parm
) != error_mark_node
)
4034 The top-level cv-qualifiers on the template-parameter are
4035 ignored when determining its type. */
4036 TREE_TYPE (parm
) = TYPE_MAIN_VARIANT (TREE_TYPE (parm
));
4037 if (invalid_nontype_parm_type_p (TREE_TYPE (parm
), 1))
4038 TREE_TYPE (parm
) = error_mark_node
;
4039 else if (uses_parameter_packs (TREE_TYPE (parm
))
4040 && !is_parameter_pack
4041 /* If we're in a nested template parameter list, the template
4042 template parameter could be a parameter pack. */
4043 && processing_template_parmlist
== 1)
4045 /* This template parameter is not a parameter pack, but it
4046 should be. Complain about "bare" parameter packs. */
4047 check_for_bare_parameter_packs (TREE_TYPE (parm
));
4049 /* Recover by calling this a parameter pack. */
4050 is_parameter_pack
= true;
4054 /* A template parameter is not modifiable. */
4055 TREE_CONSTANT (parm
) = 1;
4056 TREE_READONLY (parm
) = 1;
4057 decl
= build_decl (parm_loc
,
4058 CONST_DECL
, DECL_NAME (parm
), TREE_TYPE (parm
));
4059 TREE_CONSTANT (decl
) = 1;
4060 TREE_READONLY (decl
) = 1;
4061 DECL_INITIAL (parm
) = DECL_INITIAL (decl
)
4062 = build_template_parm_index (idx
, processing_template_decl
,
4063 processing_template_decl
,
4064 decl
, TREE_TYPE (parm
));
4066 TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm
))
4067 = is_parameter_pack
;
4072 parm
= TREE_VALUE (TREE_VALUE (parm
));
4074 if (parm
&& TREE_CODE (parm
) == TEMPLATE_DECL
)
4076 t
= cxx_make_type (TEMPLATE_TEMPLATE_PARM
);
4077 /* This is for distinguishing between real templates and template
4078 template parameters */
4079 TREE_TYPE (parm
) = t
;
4080 TREE_TYPE (DECL_TEMPLATE_RESULT (parm
)) = t
;
4085 t
= cxx_make_type (TEMPLATE_TYPE_PARM
);
4086 /* parm is either IDENTIFIER_NODE or NULL_TREE. */
4087 decl
= build_decl (parm_loc
,
4088 TYPE_DECL
, parm
, t
);
4091 TYPE_NAME (t
) = decl
;
4092 TYPE_STUB_DECL (t
) = decl
;
4094 TEMPLATE_TYPE_PARM_INDEX (t
)
4095 = build_template_parm_index (idx
, processing_template_decl
,
4096 processing_template_decl
,
4097 decl
, TREE_TYPE (parm
));
4098 TEMPLATE_TYPE_PARAMETER_PACK (t
) = is_parameter_pack
;
4099 TYPE_CANONICAL (t
) = canonical_type_parameter (t
);
4101 DECL_ARTIFICIAL (decl
) = 1;
4102 SET_DECL_TEMPLATE_PARM_P (decl
);
4104 /* Build requirements for the type/template parameter.
4105 This must be done after SET_DECL_TEMPLATE_PARM_P or
4106 process_template_parm could fail. */
4107 tree reqs
= finish_shorthand_constraint (parm
, constr
);
4111 /* Build the parameter node linking the parameter declaration,
4112 its default argument (if any), and its constraints (if any). */
4113 parm
= build_tree_list (defval
, parm
);
4114 TEMPLATE_PARM_CONSTRAINTS (parm
) = reqs
;
4116 return chainon (list
, parm
);
4119 /* The end of a template parameter list has been reached. Process the
4120 tree list into a parameter vector, converting each parameter into a more
4121 useful form. Type parameters are saved as IDENTIFIER_NODEs, and others
4125 end_template_parm_list (tree parms
)
4129 tree saved_parmlist
= make_tree_vec (list_length (parms
));
4131 /* Pop the dummy parameter level and add the real one. */
4132 current_template_parms
= TREE_CHAIN (current_template_parms
);
4134 current_template_parms
4135 = tree_cons (size_int (processing_template_decl
),
4136 saved_parmlist
, current_template_parms
);
4138 for (parm
= parms
, nparms
= 0; parm
; parm
= next
, nparms
++)
4140 next
= TREE_CHAIN (parm
);
4141 TREE_VEC_ELT (saved_parmlist
, nparms
) = parm
;
4142 TREE_CHAIN (parm
) = NULL_TREE
;
4145 --processing_template_parmlist
;
4147 return saved_parmlist
;
4150 // Explicitly indicate the end of the template parameter list. We assume
4151 // that the current template parameters have been constructed and/or
4152 // managed explicitly, as when creating new template template parameters
4153 // from a shorthand constraint.
4155 end_template_parm_list ()
4157 --processing_template_parmlist
;
4160 /* end_template_decl is called after a template declaration is seen. */
4163 end_template_decl (void)
4165 reset_specialization ();
4167 if (! processing_template_decl
)
4170 /* This matches the pushlevel in begin_template_parm_list. */
4173 --processing_template_decl
;
4174 current_template_parms
= TREE_CHAIN (current_template_parms
);
4177 /* Takes a TREE_LIST representing a template parameter and convert it
4178 into an argument suitable to be passed to the type substitution
4179 functions. Note that If the TREE_LIST contains an error_mark
4180 node, the returned argument is error_mark_node. */
4183 template_parm_to_arg (tree t
)
4187 || TREE_CODE (t
) != TREE_LIST
)
4190 if (error_operand_p (TREE_VALUE (t
)))
4191 return error_mark_node
;
4195 if (TREE_CODE (t
) == TYPE_DECL
4196 || TREE_CODE (t
) == TEMPLATE_DECL
)
4200 if (TEMPLATE_TYPE_PARAMETER_PACK (t
))
4202 /* Turn this argument into a TYPE_ARGUMENT_PACK
4203 with a single element, which expands T. */
4204 tree vec
= make_tree_vec (1);
4205 #ifdef ENABLE_CHECKING
4206 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT
4207 (vec
, TREE_VEC_LENGTH (vec
));
4209 TREE_VEC_ELT (vec
, 0) = make_pack_expansion (t
);
4211 t
= cxx_make_type (TYPE_ARGUMENT_PACK
);
4212 SET_ARGUMENT_PACK_ARGS (t
, vec
);
4217 t
= DECL_INITIAL (t
);
4219 if (TEMPLATE_PARM_PARAMETER_PACK (t
))
4221 /* Turn this argument into a NONTYPE_ARGUMENT_PACK
4222 with a single element, which expands T. */
4223 tree vec
= make_tree_vec (1);
4224 tree type
= TREE_TYPE (TEMPLATE_PARM_DECL (t
));
4225 #ifdef ENABLE_CHECKING
4226 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT
4227 (vec
, TREE_VEC_LENGTH (vec
));
4229 t
= convert_from_reference (t
);
4230 TREE_VEC_ELT (vec
, 0) = make_pack_expansion (t
);
4232 t
= make_node (NONTYPE_ARGUMENT_PACK
);
4233 SET_ARGUMENT_PACK_ARGS (t
, vec
);
4234 TREE_TYPE (t
) = type
;
4237 t
= convert_from_reference (t
);
4242 /* Given a set of template parameters, return them as a set of template
4243 arguments. The template parameters are represented as a TREE_VEC, in
4244 the form documented in cp-tree.h for template arguments. */
4247 template_parms_to_args (tree parms
)
4250 tree args
= NULL_TREE
;
4251 int length
= TMPL_PARMS_DEPTH (parms
);
4254 /* If there is only one level of template parameters, we do not
4255 create a TREE_VEC of TREE_VECs. Instead, we return a single
4256 TREE_VEC containing the arguments. */
4258 args
= make_tree_vec (length
);
4260 for (header
= parms
; header
; header
= TREE_CHAIN (header
))
4262 tree a
= copy_node (TREE_VALUE (header
));
4265 TREE_TYPE (a
) = NULL_TREE
;
4266 for (i
= TREE_VEC_LENGTH (a
) - 1; i
>= 0; --i
)
4267 TREE_VEC_ELT (a
, i
) = template_parm_to_arg (TREE_VEC_ELT (a
, i
));
4269 #ifdef ENABLE_CHECKING
4270 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (a
, TREE_VEC_LENGTH (a
));
4274 TREE_VEC_ELT (args
, --l
) = a
;
4282 /* Within the declaration of a template, return the currently active
4283 template parameters as an argument TREE_VEC. */
4286 current_template_args (void)
4288 return template_parms_to_args (current_template_parms
);
4291 /* Update the declared TYPE by doing any lookups which were thought to be
4292 dependent, but are not now that we know the SCOPE of the declarator. */
4295 maybe_update_decl_type (tree orig_type
, tree scope
)
4297 tree type
= orig_type
;
4299 if (type
== NULL_TREE
)
4302 if (TREE_CODE (orig_type
) == TYPE_DECL
)
4303 type
= TREE_TYPE (type
);
4305 if (scope
&& TYPE_P (scope
) && dependent_type_p (scope
)
4306 && dependent_type_p (type
)
4307 /* Don't bother building up the args in this case. */
4308 && TREE_CODE (type
) != TEMPLATE_TYPE_PARM
)
4310 /* tsubst in the args corresponding to the template parameters,
4311 including auto if present. Most things will be unchanged, but
4312 make_typename_type and tsubst_qualified_id will resolve
4313 TYPENAME_TYPEs and SCOPE_REFs that were previously dependent. */
4314 tree args
= current_template_args ();
4315 tree auto_node
= type_uses_auto (type
);
4319 tree auto_vec
= make_tree_vec (1);
4320 TREE_VEC_ELT (auto_vec
, 0) = auto_node
;
4321 args
= add_to_template_args (args
, auto_vec
);
4323 pushed
= push_scope (scope
);
4324 type
= tsubst (type
, args
, tf_warning_or_error
, NULL_TREE
);
4329 if (type
== error_mark_node
)
4332 if (TREE_CODE (orig_type
) == TYPE_DECL
)
4334 if (same_type_p (type
, TREE_TYPE (orig_type
)))
4337 type
= TYPE_NAME (type
);
4342 /* Return a TEMPLATE_DECL corresponding to DECL, using the indicated
4343 template PARMS and constraints, CONSTR. If MEMBER_TEMPLATE_P is true,
4344 the new template is a member template. */
4347 build_template_decl (tree decl
, tree parms
, bool member_template_p
)
4349 tree tmpl
= build_lang_decl (TEMPLATE_DECL
, DECL_NAME (decl
), NULL_TREE
);
4350 DECL_TEMPLATE_PARMS (tmpl
) = parms
;
4351 DECL_CONTEXT (tmpl
) = DECL_CONTEXT (decl
);
4352 DECL_SOURCE_LOCATION (tmpl
) = DECL_SOURCE_LOCATION (decl
);
4353 DECL_MEMBER_TEMPLATE_P (tmpl
) = member_template_p
;
4358 struct template_parm_data
4360 /* The level of the template parameters we are currently
4364 /* The index of the specialization argument we are currently
4368 /* An array whose size is the number of template parameters. The
4369 elements are nonzero if the parameter has been used in any one
4370 of the arguments processed so far. */
4373 /* An array whose size is the number of template arguments. The
4374 elements are nonzero if the argument makes use of template
4375 parameters of this level. */
4376 int* arg_uses_template_parms
;
4379 /* Subroutine of push_template_decl used to see if each template
4380 parameter in a partial specialization is used in the explicit
4381 argument list. If T is of the LEVEL given in DATA (which is
4382 treated as a template_parm_data*), then DATA->PARMS is marked
4386 mark_template_parm (tree t
, void* data
)
4390 struct template_parm_data
* tpd
= (struct template_parm_data
*) data
;
4392 template_parm_level_and_index (t
, &level
, &idx
);
4394 if (level
== tpd
->level
)
4396 tpd
->parms
[idx
] = 1;
4397 tpd
->arg_uses_template_parms
[tpd
->current_arg
] = 1;
4400 /* Return zero so that for_each_template_parm will continue the
4401 traversal of the tree; we want to mark *every* template parm. */
4405 /* Process the partial specialization DECL. */
4408 process_partial_specialization (tree decl
)
4410 tree type
= TREE_TYPE (decl
);
4411 tree tinfo
= get_template_info (decl
);
4412 tree maintmpl
= TI_TEMPLATE (tinfo
);
4413 tree specargs
= TI_ARGS (tinfo
);
4414 tree inner_args
= INNERMOST_TEMPLATE_ARGS (specargs
);
4415 tree main_inner_parms
= DECL_INNERMOST_TEMPLATE_PARMS (maintmpl
);
4418 int nargs
= TREE_VEC_LENGTH (inner_args
);
4421 bool did_error_intro
= false;
4422 struct template_parm_data tpd
;
4423 struct template_parm_data tpd2
;
4425 gcc_assert (current_template_parms
);
4427 /* A concept cannot be specialized. */
4428 if (flag_concepts
&& variable_concept_p (maintmpl
))
4430 error ("specialization of variable concept %q#D", maintmpl
);
4431 return error_mark_node
;
4434 inner_parms
= INNERMOST_TEMPLATE_PARMS (current_template_parms
);
4435 ntparms
= TREE_VEC_LENGTH (inner_parms
);
4437 /* We check that each of the template parameters given in the
4438 partial specialization is used in the argument list to the
4439 specialization. For example:
4441 template <class T> struct S;
4442 template <class T> struct S<T*>;
4444 The second declaration is OK because `T*' uses the template
4445 parameter T, whereas
4447 template <class T> struct S<int>;
4449 is no good. Even trickier is:
4460 The S2<T> declaration is actually invalid; it is a
4461 full-specialization. Of course,
4464 struct S2<T (*)(U)>;
4466 or some such would have been OK. */
4467 tpd
.level
= TMPL_PARMS_DEPTH (current_template_parms
);
4468 tpd
.parms
= XALLOCAVEC (int, ntparms
);
4469 memset (tpd
.parms
, 0, sizeof (int) * ntparms
);
4471 tpd
.arg_uses_template_parms
= XALLOCAVEC (int, nargs
);
4472 memset (tpd
.arg_uses_template_parms
, 0, sizeof (int) * nargs
);
4473 for (i
= 0; i
< nargs
; ++i
)
4475 tpd
.current_arg
= i
;
4476 for_each_template_parm (TREE_VEC_ELT (inner_args
, i
),
4477 &mark_template_parm
,
4480 /*include_nondeduced_p=*/false);
4482 for (i
= 0; i
< ntparms
; ++i
)
4483 if (tpd
.parms
[i
] == 0)
4485 /* One of the template parms was not used in a deduced context in the
4487 if (!did_error_intro
)
4489 error ("template parameters not deducible in "
4490 "partial specialization:");
4491 did_error_intro
= true;
4494 inform (input_location
, " %qD",
4495 TREE_VALUE (TREE_VEC_ELT (inner_parms
, i
)));
4498 if (did_error_intro
)
4499 return error_mark_node
;
4501 /* [temp.class.spec]
4503 The argument list of the specialization shall not be identical to
4504 the implicit argument list of the primary template. */
4506 = TI_ARGS (get_template_info (DECL_TEMPLATE_RESULT (maintmpl
)));
4507 if (comp_template_args (inner_args
, INNERMOST_TEMPLATE_ARGS (main_args
))
4509 || !subsumes_constraints (current_template_constraints (),
4510 get_constraints (maintmpl
))))
4513 error ("partial specialization %q+D does not specialize "
4514 "any template arguments", decl
);
4516 error ("partial specialization %q+D does not specialize any "
4517 "template arguments and is not more constrained than", decl
);
4518 inform (DECL_SOURCE_LOCATION (maintmpl
), "primary template here");
4521 /* A partial specialization that replaces multiple parameters of the
4522 primary template with a pack expansion is less specialized for those
4524 if (nargs
< DECL_NTPARMS (maintmpl
))
4526 error ("partial specialization is not more specialized than the "
4527 "primary template because it replaces multiple parameters "
4528 "with a pack expansion");
4529 inform (DECL_SOURCE_LOCATION (maintmpl
), "primary template here");
4533 /* [temp.class.spec]
4535 A partially specialized non-type argument expression shall not
4536 involve template parameters of the partial specialization except
4537 when the argument expression is a simple identifier.
4539 The type of a template parameter corresponding to a specialized
4540 non-type argument shall not be dependent on a parameter of the
4543 Also, we verify that pack expansions only occur at the
4544 end of the argument list. */
4545 gcc_assert (nargs
== DECL_NTPARMS (maintmpl
));
4547 for (i
= 0; i
< nargs
; ++i
)
4549 tree parm
= TREE_VALUE (TREE_VEC_ELT (main_inner_parms
, i
));
4550 tree arg
= TREE_VEC_ELT (inner_args
, i
);
4551 tree packed_args
= NULL_TREE
;
4554 if (ARGUMENT_PACK_P (arg
))
4556 /* Extract the arguments from the argument pack. We'll be
4557 iterating over these in the following loop. */
4558 packed_args
= ARGUMENT_PACK_ARGS (arg
);
4559 len
= TREE_VEC_LENGTH (packed_args
);
4562 for (j
= 0; j
< len
; j
++)
4565 /* Get the Jth argument in the parameter pack. */
4566 arg
= TREE_VEC_ELT (packed_args
, j
);
4568 if (PACK_EXPANSION_P (arg
))
4570 /* Pack expansions must come at the end of the
4572 if ((packed_args
&& j
< len
- 1)
4573 || (!packed_args
&& i
< nargs
- 1))
4575 if (TREE_CODE (arg
) == EXPR_PACK_EXPANSION
)
4576 error ("parameter pack argument %qE must be at the "
4577 "end of the template argument list", arg
);
4579 error ("parameter pack argument %qT must be at the "
4580 "end of the template argument list", arg
);
4584 if (TREE_CODE (arg
) == EXPR_PACK_EXPANSION
)
4585 /* We only care about the pattern. */
4586 arg
= PACK_EXPANSION_PATTERN (arg
);
4588 if (/* These first two lines are the `non-type' bit. */
4590 && TREE_CODE (arg
) != TEMPLATE_DECL
4591 /* This next two lines are the `argument expression is not just a
4592 simple identifier' condition and also the `specialized
4593 non-type argument' bit. */
4594 && TREE_CODE (arg
) != TEMPLATE_PARM_INDEX
4595 && !(REFERENCE_REF_P (arg
)
4596 && TREE_CODE (TREE_OPERAND (arg
, 0)) == TEMPLATE_PARM_INDEX
))
4598 if ((!packed_args
&& tpd
.arg_uses_template_parms
[i
])
4599 || (packed_args
&& uses_template_parms (arg
)))
4600 error ("template argument %qE involves template parameter(s)",
4604 /* Look at the corresponding template parameter,
4605 marking which template parameters its type depends
4607 tree type
= TREE_TYPE (parm
);
4611 /* We haven't yet initialized TPD2. Do so now. */
4612 tpd2
.arg_uses_template_parms
= XALLOCAVEC (int, nargs
);
4613 /* The number of parameters here is the number in the
4614 main template, which, as checked in the assertion
4616 tpd2
.parms
= XALLOCAVEC (int, nargs
);
4618 TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (maintmpl
));
4621 /* Mark the template parameters. But this time, we're
4622 looking for the template parameters of the main
4623 template, not in the specialization. */
4624 tpd2
.current_arg
= i
;
4625 tpd2
.arg_uses_template_parms
[i
] = 0;
4626 memset (tpd2
.parms
, 0, sizeof (int) * nargs
);
4627 for_each_template_parm (type
,
4628 &mark_template_parm
,
4631 /*include_nondeduced_p=*/false);
4633 if (tpd2
.arg_uses_template_parms
[i
])
4635 /* The type depended on some template parameters.
4636 If they are fully specialized in the
4637 specialization, that's OK. */
4640 for (j
= 0; j
< nargs
; ++j
)
4641 if (tpd2
.parms
[j
] != 0
4642 && tpd
.arg_uses_template_parms
[j
])
4645 error_n (input_location
, count
,
4646 "type %qT of template argument %qE depends "
4647 "on a template parameter",
4648 "type %qT of template argument %qE depends "
4649 "on template parameters",
4658 /* We should only get here once. */
4659 if (TREE_CODE (decl
) == TYPE_DECL
)
4660 gcc_assert (!COMPLETE_TYPE_P (type
));
4662 // Build the template decl.
4663 tree tmpl
= build_template_decl (decl
, current_template_parms
,
4664 DECL_MEMBER_TEMPLATE_P (maintmpl
));
4665 TREE_TYPE (tmpl
) = type
;
4666 DECL_TEMPLATE_RESULT (tmpl
) = decl
;
4667 SET_DECL_TEMPLATE_SPECIALIZATION (tmpl
);
4668 DECL_TEMPLATE_INFO (tmpl
) = build_template_info (maintmpl
, specargs
);
4669 DECL_PRIMARY_TEMPLATE (tmpl
) = maintmpl
;
4672 /* We didn't register this in check_explicit_specialization so we could
4673 wait until the constraints were set. */
4674 decl
= register_specialization (decl
, maintmpl
, specargs
, false, 0);
4676 associate_classtype_constraints (type
);
4678 DECL_TEMPLATE_SPECIALIZATIONS (maintmpl
)
4679 = tree_cons (specargs
, tmpl
,
4680 DECL_TEMPLATE_SPECIALIZATIONS (maintmpl
));
4681 TREE_TYPE (DECL_TEMPLATE_SPECIALIZATIONS (maintmpl
)) = type
;
4683 for (inst
= DECL_TEMPLATE_INSTANTIATIONS (maintmpl
); inst
;
4684 inst
= TREE_CHAIN (inst
))
4686 tree instance
= TREE_VALUE (inst
);
4687 if (TYPE_P (instance
)
4688 ? (COMPLETE_TYPE_P (instance
)
4689 && CLASSTYPE_IMPLICIT_INSTANTIATION (instance
))
4690 : DECL_TEMPLATE_INSTANTIATION (instance
))
4692 tree spec
= most_specialized_partial_spec (instance
, tf_none
);
4693 if (spec
&& TREE_VALUE (spec
) == tmpl
)
4695 tree inst_decl
= (DECL_P (instance
)
4696 ? instance
: TYPE_NAME (instance
));
4697 permerror (input_location
,
4698 "partial specialization of %qD after instantiation "
4699 "of %qD", decl
, inst_decl
);
4707 /* PARM is a template parameter of some form; return the corresponding
4708 TEMPLATE_PARM_INDEX. */
4711 get_template_parm_index (tree parm
)
4713 if (TREE_CODE (parm
) == PARM_DECL
4714 || TREE_CODE (parm
) == CONST_DECL
)
4715 parm
= DECL_INITIAL (parm
);
4716 else if (TREE_CODE (parm
) == TYPE_DECL
4717 || TREE_CODE (parm
) == TEMPLATE_DECL
)
4718 parm
= TREE_TYPE (parm
);
4719 if (TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
4720 || TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
4721 || TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
)
4722 parm
= TEMPLATE_TYPE_PARM_INDEX (parm
);
4723 gcc_assert (TREE_CODE (parm
) == TEMPLATE_PARM_INDEX
);
4727 /* Subroutine of fixed_parameter_pack_p below. Look for any template
4728 parameter packs used by the template parameter PARM. */
4731 fixed_parameter_pack_p_1 (tree parm
, struct find_parameter_pack_data
*ppd
)
4733 /* A type parm can't refer to another parm. */
4734 if (TREE_CODE (parm
) == TYPE_DECL
)
4736 else if (TREE_CODE (parm
) == PARM_DECL
)
4738 cp_walk_tree (&TREE_TYPE (parm
), &find_parameter_packs_r
,
4743 gcc_assert (TREE_CODE (parm
) == TEMPLATE_DECL
);
4745 tree vec
= INNERMOST_TEMPLATE_PARMS (DECL_TEMPLATE_PARMS (parm
));
4746 for (int i
= 0; i
< TREE_VEC_LENGTH (vec
); ++i
)
4747 fixed_parameter_pack_p_1 (TREE_VALUE (TREE_VEC_ELT (vec
, i
)), ppd
);
4750 /* PARM is a template parameter pack. Return any parameter packs used in
4751 its type or the type of any of its template parameters. If there are
4752 any such packs, it will be instantiated into a fixed template parameter
4753 list by partial instantiation rather than be fully deduced. */
4756 fixed_parameter_pack_p (tree parm
)
4758 /* This can only be true in a member template. */
4759 if (TEMPLATE_PARM_ORIG_LEVEL (get_template_parm_index (parm
)) < 2)
4761 /* This can only be true for a parameter pack. */
4762 if (!template_parameter_pack_p (parm
))
4764 /* A type parm can't refer to another parm. */
4765 if (TREE_CODE (parm
) == TYPE_DECL
)
4768 tree parameter_packs
= NULL_TREE
;
4769 struct find_parameter_pack_data ppd
;
4770 ppd
.parameter_packs
= ¶meter_packs
;
4771 ppd
.visited
= new hash_set
<tree
>;
4773 fixed_parameter_pack_p_1 (parm
, &ppd
);
4776 return parameter_packs
;
4779 /* Check that a template declaration's use of default arguments and
4780 parameter packs is not invalid. Here, PARMS are the template
4781 parameters. IS_PRIMARY is true if DECL is the thing declared by
4782 a primary template. IS_PARTIAL is true if DECL is a partial
4785 IS_FRIEND_DECL is nonzero if DECL is a friend function template
4786 declaration (but not a definition); 1 indicates a declaration, 2
4787 indicates a redeclaration. When IS_FRIEND_DECL=2, no errors are
4788 emitted for extraneous default arguments.
4790 Returns TRUE if there were no errors found, FALSE otherwise. */
4793 check_default_tmpl_args (tree decl
, tree parms
, bool is_primary
,
4794 bool is_partial
, int is_friend_decl
)
4797 int last_level_to_check
;
4799 bool no_errors
= true;
4803 A default template-argument shall not be specified in a
4804 function template declaration or a function template definition, nor
4805 in the template-parameter-list of the definition of a member of a
4808 if (TREE_CODE (CP_DECL_CONTEXT (decl
)) == FUNCTION_DECL
4809 || (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_LOCAL_FUNCTION_P (decl
)))
4810 /* You can't have a function template declaration in a local
4811 scope, nor you can you define a member of a class template in a
4815 if ((TREE_CODE (decl
) == TYPE_DECL
4817 && LAMBDA_TYPE_P (TREE_TYPE (decl
)))
4818 || (TREE_CODE (decl
) == FUNCTION_DECL
4819 && LAMBDA_FUNCTION_P (decl
)))
4820 /* A lambda doesn't have an explicit declaration; don't complain
4821 about the parms of the enclosing class. */
4824 if (current_class_type
4825 && !TYPE_BEING_DEFINED (current_class_type
)
4826 && DECL_LANG_SPECIFIC (decl
)
4827 && DECL_DECLARES_FUNCTION_P (decl
)
4828 /* If this is either a friend defined in the scope of the class
4829 or a member function. */
4830 && (DECL_FUNCTION_MEMBER_P (decl
)
4831 ? same_type_p (DECL_CONTEXT (decl
), current_class_type
)
4832 : DECL_FRIEND_CONTEXT (decl
)
4833 ? same_type_p (DECL_FRIEND_CONTEXT (decl
), current_class_type
)
4835 /* And, if it was a member function, it really was defined in
4836 the scope of the class. */
4837 && (!DECL_FUNCTION_MEMBER_P (decl
)
4838 || DECL_INITIALIZED_IN_CLASS_P (decl
)))
4839 /* We already checked these parameters when the template was
4840 declared, so there's no need to do it again now. This function
4841 was defined in class scope, but we're processing its body now
4842 that the class is complete. */
4845 /* Core issue 226 (C++0x only): the following only applies to class
4848 && ((cxx_dialect
== cxx98
) || TREE_CODE (decl
) != FUNCTION_DECL
))
4852 If a template-parameter has a default template-argument, all
4853 subsequent template-parameters shall have a default
4854 template-argument supplied. */
4855 for (parm_level
= parms
; parm_level
; parm_level
= TREE_CHAIN (parm_level
))
4857 tree inner_parms
= TREE_VALUE (parm_level
);
4858 int ntparms
= TREE_VEC_LENGTH (inner_parms
);
4859 int seen_def_arg_p
= 0;
4862 for (i
= 0; i
< ntparms
; ++i
)
4864 tree parm
= TREE_VEC_ELT (inner_parms
, i
);
4866 if (parm
== error_mark_node
)
4869 if (TREE_PURPOSE (parm
))
4871 else if (seen_def_arg_p
4872 && !template_parameter_pack_p (TREE_VALUE (parm
)))
4874 error ("no default argument for %qD", TREE_VALUE (parm
));
4875 /* For better subsequent error-recovery, we indicate that
4876 there should have been a default argument. */
4877 TREE_PURPOSE (parm
) = error_mark_node
;
4880 else if (!is_partial
4882 /* Don't complain about an enclosing partial
4884 && parm_level
== parms
4885 && TREE_CODE (decl
) == TYPE_DECL
4887 && template_parameter_pack_p (TREE_VALUE (parm
))
4888 /* A fixed parameter pack will be partially
4889 instantiated into a fixed length list. */
4890 && !fixed_parameter_pack_p (TREE_VALUE (parm
)))
4892 /* A primary class template can only have one
4893 parameter pack, at the end of the template
4896 error ("parameter pack %q+D must be at the end of the"
4897 " template parameter list", TREE_VALUE (parm
));
4899 TREE_VALUE (TREE_VEC_ELT (inner_parms
, i
))
4907 if (((cxx_dialect
== cxx98
) && TREE_CODE (decl
) != TYPE_DECL
)
4911 /* For an ordinary class template, default template arguments are
4912 allowed at the innermost level, e.g.:
4913 template <class T = int>
4915 but, in a partial specialization, they're not allowed even
4916 there, as we have in [temp.class.spec]:
4918 The template parameter list of a specialization shall not
4919 contain default template argument values.
4921 So, for a partial specialization, or for a function template
4922 (in C++98/C++03), we look at all of them. */
4925 /* But, for a primary class template that is not a partial
4926 specialization we look at all template parameters except the
4928 parms
= TREE_CHAIN (parms
);
4930 /* Figure out what error message to issue. */
4931 if (is_friend_decl
== 2)
4932 msg
= G_("default template arguments may not be used in function template "
4933 "friend re-declaration");
4934 else if (is_friend_decl
)
4935 msg
= G_("default template arguments may not be used in function template "
4936 "friend declarations");
4937 else if (TREE_CODE (decl
) == FUNCTION_DECL
&& (cxx_dialect
== cxx98
))
4938 msg
= G_("default template arguments may not be used in function templates "
4939 "without -std=c++11 or -std=gnu++11");
4940 else if (is_partial
)
4941 msg
= G_("default template arguments may not be used in "
4942 "partial specializations");
4944 msg
= G_("default argument for template parameter for class enclosing %qD");
4946 if (current_class_type
&& TYPE_BEING_DEFINED (current_class_type
))
4947 /* If we're inside a class definition, there's no need to
4948 examine the parameters to the class itself. On the one
4949 hand, they will be checked when the class is defined, and,
4950 on the other, default arguments are valid in things like:
4951 template <class T = double>
4952 struct S { template <class U> void f(U); };
4953 Here the default argument for `S' has no bearing on the
4954 declaration of `f'. */
4955 last_level_to_check
= template_class_depth (current_class_type
) + 1;
4957 /* Check everything. */
4958 last_level_to_check
= 0;
4960 for (parm_level
= parms
;
4961 parm_level
&& TMPL_PARMS_DEPTH (parm_level
) >= last_level_to_check
;
4962 parm_level
= TREE_CHAIN (parm_level
))
4964 tree inner_parms
= TREE_VALUE (parm_level
);
4968 ntparms
= TREE_VEC_LENGTH (inner_parms
);
4969 for (i
= 0; i
< ntparms
; ++i
)
4971 if (TREE_VEC_ELT (inner_parms
, i
) == error_mark_node
)
4974 if (TREE_PURPOSE (TREE_VEC_ELT (inner_parms
, i
)))
4979 if (is_friend_decl
== 2)
4986 /* Clear out the default argument so that we are not
4988 TREE_PURPOSE (TREE_VEC_ELT (inner_parms
, i
)) = NULL_TREE
;
4992 /* At this point, if we're still interested in issuing messages,
4993 they must apply to classes surrounding the object declared. */
4995 msg
= G_("default argument for template parameter for class "
5002 /* Worker for push_template_decl_real, called via
5003 for_each_template_parm. DATA is really an int, indicating the
5004 level of the parameters we are interested in. If T is a template
5005 parameter of that level, return nonzero. */
5008 template_parm_this_level_p (tree t
, void* data
)
5010 int this_level
= *(int *)data
;
5013 if (TREE_CODE (t
) == TEMPLATE_PARM_INDEX
)
5014 level
= TEMPLATE_PARM_LEVEL (t
);
5016 level
= TEMPLATE_TYPE_LEVEL (t
);
5017 return level
== this_level
;
5020 /* Creates a TEMPLATE_DECL for the indicated DECL using the template
5021 parameters given by current_template_args, or reuses a
5022 previously existing one, if appropriate. Returns the DECL, or an
5023 equivalent one, if it is replaced via a call to duplicate_decls.
5025 If IS_FRIEND is true, DECL is a friend declaration. */
5028 push_template_decl_real (tree decl
, bool is_friend
)
5036 int new_template_p
= 0;
5037 /* True if the template is a member template, in the sense of
5039 bool member_template_p
= false;
5041 if (decl
== error_mark_node
|| !current_template_parms
)
5042 return error_mark_node
;
5044 /* See if this is a partial specialization. */
5045 is_partial
= ((DECL_IMPLICIT_TYPEDEF_P (decl
)
5046 && TREE_CODE (TREE_TYPE (decl
)) != ENUMERAL_TYPE
5047 && CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_TYPE (decl
)))
5049 && DECL_LANG_SPECIFIC (decl
)
5050 && DECL_TEMPLATE_SPECIALIZATION (decl
)
5051 && TINFO_USED_TEMPLATE_ID (DECL_TEMPLATE_INFO (decl
))));
5053 if (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_FRIEND_P (decl
))
5057 /* For a friend, we want the context of the friend function, not
5058 the type of which it is a friend. */
5059 ctx
= CP_DECL_CONTEXT (decl
);
5060 else if (CP_DECL_CONTEXT (decl
)
5061 && TREE_CODE (CP_DECL_CONTEXT (decl
)) != NAMESPACE_DECL
)
5062 /* In the case of a virtual function, we want the class in which
5064 ctx
= CP_DECL_CONTEXT (decl
);
5066 /* Otherwise, if we're currently defining some class, the DECL
5067 is assumed to be a member of the class. */
5068 ctx
= current_scope ();
5070 if (ctx
&& TREE_CODE (ctx
) == NAMESPACE_DECL
)
5073 if (!DECL_CONTEXT (decl
))
5074 DECL_CONTEXT (decl
) = FROB_CONTEXT (current_namespace
);
5076 /* See if this is a primary template. */
5077 if (is_friend
&& ctx
5078 && uses_template_parms_level (ctx
, processing_template_decl
))
5079 /* A friend template that specifies a class context, i.e.
5080 template <typename T> friend void A<T>::f();
5083 else if (TREE_CODE (decl
) == TYPE_DECL
5084 && LAMBDA_TYPE_P (TREE_TYPE (decl
)))
5087 is_primary
= template_parm_scope_p ();
5091 if (DECL_CLASS_SCOPE_P (decl
))
5092 member_template_p
= true;
5093 if (TREE_CODE (decl
) == TYPE_DECL
5094 && anon_aggrname_p (DECL_NAME (decl
)))
5096 error ("template class without a name");
5097 return error_mark_node
;
5099 else if (TREE_CODE (decl
) == FUNCTION_DECL
)
5101 if (member_template_p
)
5103 if (DECL_OVERRIDE_P (decl
) || DECL_FINAL_P (decl
))
5104 error ("member template %qD may not have virt-specifiers", decl
);
5106 if (DECL_DESTRUCTOR_P (decl
))
5110 A destructor shall not be a member template. */
5111 error ("destructor %qD declared as member template", decl
);
5112 return error_mark_node
;
5114 if (NEW_DELETE_OPNAME_P (DECL_NAME (decl
))
5115 && (!prototype_p (TREE_TYPE (decl
))
5116 || TYPE_ARG_TYPES (TREE_TYPE (decl
)) == void_list_node
5117 || !TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (decl
)))
5118 || (TREE_CHAIN (TYPE_ARG_TYPES ((TREE_TYPE (decl
))))
5119 == void_list_node
)))
5121 /* [basic.stc.dynamic.allocation]
5123 An allocation function can be a function
5124 template. ... Template allocation functions shall
5125 have two or more parameters. */
5126 error ("invalid template declaration of %qD", decl
);
5127 return error_mark_node
;
5130 else if (DECL_IMPLICIT_TYPEDEF_P (decl
)
5131 && CLASS_TYPE_P (TREE_TYPE (decl
)))
5133 else if (TREE_CODE (decl
) == TYPE_DECL
5134 && TYPE_DECL_ALIAS_P (decl
))
5135 /* alias-declaration */
5136 gcc_assert (!DECL_ARTIFICIAL (decl
));
5137 else if (VAR_P (decl
))
5138 /* C++14 variable template. */;
5141 error ("template declaration of %q#D", decl
);
5142 return error_mark_node
;
5146 /* Check to see that the rules regarding the use of default
5147 arguments are not being violated. */
5148 check_default_tmpl_args (decl
, current_template_parms
,
5149 is_primary
, is_partial
, /*is_friend_decl=*/0);
5151 /* Ensure that there are no parameter packs in the type of this
5152 declaration that have not been expanded. */
5153 if (TREE_CODE (decl
) == FUNCTION_DECL
)
5155 /* Check each of the arguments individually to see if there are
5156 any bare parameter packs. */
5157 tree type
= TREE_TYPE (decl
);
5158 tree arg
= DECL_ARGUMENTS (decl
);
5159 tree argtype
= TYPE_ARG_TYPES (type
);
5161 while (arg
&& argtype
)
5163 if (!DECL_PACK_P (arg
)
5164 && check_for_bare_parameter_packs (TREE_TYPE (arg
)))
5166 /* This is a PARM_DECL that contains unexpanded parameter
5167 packs. We have already complained about this in the
5168 check_for_bare_parameter_packs call, so just replace
5169 these types with ERROR_MARK_NODE. */
5170 TREE_TYPE (arg
) = error_mark_node
;
5171 TREE_VALUE (argtype
) = error_mark_node
;
5174 arg
= DECL_CHAIN (arg
);
5175 argtype
= TREE_CHAIN (argtype
);
5178 /* Check for bare parameter packs in the return type and the
5179 exception specifiers. */
5180 if (check_for_bare_parameter_packs (TREE_TYPE (type
)))
5181 /* Errors were already issued, set return type to int
5182 as the frontend doesn't expect error_mark_node as
5184 TREE_TYPE (type
) = integer_type_node
;
5185 if (check_for_bare_parameter_packs (TYPE_RAISES_EXCEPTIONS (type
)))
5186 TYPE_RAISES_EXCEPTIONS (type
) = NULL_TREE
;
5188 else if (check_for_bare_parameter_packs ((TREE_CODE (decl
) == TYPE_DECL
5189 && TYPE_DECL_ALIAS_P (decl
))
5190 ? DECL_ORIGINAL_TYPE (decl
)
5191 : TREE_TYPE (decl
)))
5193 TREE_TYPE (decl
) = error_mark_node
;
5194 return error_mark_node
;
5198 return process_partial_specialization (decl
);
5200 args
= current_template_args ();
5203 || TREE_CODE (ctx
) == FUNCTION_DECL
5204 || (CLASS_TYPE_P (ctx
) && TYPE_BEING_DEFINED (ctx
))
5205 || (TREE_CODE (decl
) == TYPE_DECL
5206 && LAMBDA_TYPE_P (TREE_TYPE (decl
)))
5207 || (is_friend
&& !DECL_TEMPLATE_INFO (decl
)))
5209 if (DECL_LANG_SPECIFIC (decl
)
5210 && DECL_TEMPLATE_INFO (decl
)
5211 && DECL_TI_TEMPLATE (decl
))
5212 tmpl
= DECL_TI_TEMPLATE (decl
);
5213 /* If DECL is a TYPE_DECL for a class-template, then there won't
5214 be DECL_LANG_SPECIFIC. The information equivalent to
5215 DECL_TEMPLATE_INFO is found in TYPE_TEMPLATE_INFO instead. */
5216 else if (DECL_IMPLICIT_TYPEDEF_P (decl
)
5217 && TYPE_TEMPLATE_INFO (TREE_TYPE (decl
))
5218 && TYPE_TI_TEMPLATE (TREE_TYPE (decl
)))
5220 /* Since a template declaration already existed for this
5221 class-type, we must be redeclaring it here. Make sure
5222 that the redeclaration is valid. */
5223 redeclare_class_template (TREE_TYPE (decl
),
5224 current_template_parms
,
5225 current_template_constraints ());
5226 /* We don't need to create a new TEMPLATE_DECL; just use the
5227 one we already had. */
5228 tmpl
= TYPE_TI_TEMPLATE (TREE_TYPE (decl
));
5232 tmpl
= build_template_decl (decl
, current_template_parms
,
5236 if (DECL_LANG_SPECIFIC (decl
)
5237 && DECL_TEMPLATE_SPECIALIZATION (decl
))
5239 /* A specialization of a member template of a template
5241 SET_DECL_TEMPLATE_SPECIALIZATION (tmpl
);
5242 DECL_TEMPLATE_INFO (tmpl
) = DECL_TEMPLATE_INFO (decl
);
5243 DECL_TEMPLATE_INFO (decl
) = NULL_TREE
;
5249 tree a
, t
, current
, parms
;
5251 tree tinfo
= get_template_info (decl
);
5255 error ("template definition of non-template %q#D", decl
);
5256 return error_mark_node
;
5259 tmpl
= TI_TEMPLATE (tinfo
);
5261 if (DECL_FUNCTION_TEMPLATE_P (tmpl
)
5262 && DECL_TEMPLATE_INFO (decl
) && DECL_TI_ARGS (decl
)
5263 && DECL_TEMPLATE_SPECIALIZATION (decl
)
5264 && DECL_MEMBER_TEMPLATE_P (tmpl
))
5268 /* The declaration is a specialization of a member
5269 template, declared outside the class. Therefore, the
5270 innermost template arguments will be NULL, so we
5271 replace them with the arguments determined by the
5272 earlier call to check_explicit_specialization. */
5273 args
= DECL_TI_ARGS (decl
);
5276 = build_template_decl (decl
, current_template_parms
,
5278 DECL_TEMPLATE_RESULT (new_tmpl
) = decl
;
5279 TREE_TYPE (new_tmpl
) = TREE_TYPE (decl
);
5280 DECL_TI_TEMPLATE (decl
) = new_tmpl
;
5281 SET_DECL_TEMPLATE_SPECIALIZATION (new_tmpl
);
5282 DECL_TEMPLATE_INFO (new_tmpl
)
5283 = build_template_info (tmpl
, args
);
5285 register_specialization (new_tmpl
,
5286 most_general_template (tmpl
),
5292 /* Make sure the template headers we got make sense. */
5294 parms
= DECL_TEMPLATE_PARMS (tmpl
);
5295 i
= TMPL_PARMS_DEPTH (parms
);
5296 if (TMPL_ARGS_DEPTH (args
) != i
)
5298 error ("expected %d levels of template parms for %q#D, got %d",
5299 i
, decl
, TMPL_ARGS_DEPTH (args
));
5300 DECL_INTERFACE_KNOWN (decl
) = 1;
5301 return error_mark_node
;
5304 for (current
= decl
; i
> 0; --i
, parms
= TREE_CHAIN (parms
))
5306 a
= TMPL_ARGS_LEVEL (args
, i
);
5307 t
= INNERMOST_TEMPLATE_PARMS (parms
);
5309 if (TREE_VEC_LENGTH (t
) != TREE_VEC_LENGTH (a
))
5311 if (current
== decl
)
5312 error ("got %d template parameters for %q#D",
5313 TREE_VEC_LENGTH (a
), decl
);
5315 error ("got %d template parameters for %q#T",
5316 TREE_VEC_LENGTH (a
), current
);
5317 error (" but %d required", TREE_VEC_LENGTH (t
));
5318 /* Avoid crash in import_export_decl. */
5319 DECL_INTERFACE_KNOWN (decl
) = 1;
5320 return error_mark_node
;
5323 if (current
== decl
)
5325 else if (current
== NULL_TREE
)
5326 /* Can happen in erroneous input. */
5329 current
= get_containing_scope (current
);
5332 /* Check that the parms are used in the appropriate qualifying scopes
5333 in the declarator. */
5334 if (!comp_template_args
5336 TI_ARGS (get_template_info (DECL_TEMPLATE_RESULT (tmpl
)))))
5339 template arguments to %qD do not match original template %qD",
5340 decl
, DECL_TEMPLATE_RESULT (tmpl
));
5341 if (!uses_template_parms (TI_ARGS (tinfo
)))
5342 inform (input_location
, "use template<> for an explicit specialization");
5343 /* Avoid crash in import_export_decl. */
5344 DECL_INTERFACE_KNOWN (decl
) = 1;
5345 return error_mark_node
;
5349 DECL_TEMPLATE_RESULT (tmpl
) = decl
;
5350 TREE_TYPE (tmpl
) = TREE_TYPE (decl
);
5352 /* Push template declarations for global functions and types. Note
5353 that we do not try to push a global template friend declared in a
5354 template class; such a thing may well depend on the template
5355 parameters of the class. */
5356 if (new_template_p
&& !ctx
5357 && !(is_friend
&& template_class_depth (current_class_type
) > 0))
5359 tmpl
= pushdecl_namespace_level (tmpl
, is_friend
);
5360 if (tmpl
== error_mark_node
)
5361 return error_mark_node
;
5363 /* Hide template friend classes that haven't been declared yet. */
5364 if (is_friend
&& TREE_CODE (decl
) == TYPE_DECL
)
5366 DECL_ANTICIPATED (tmpl
) = 1;
5367 DECL_FRIEND_P (tmpl
) = 1;
5373 tree parms
= DECL_TEMPLATE_PARMS (tmpl
);
5376 DECL_PRIMARY_TEMPLATE (tmpl
) = tmpl
;
5377 if (DECL_CONV_FN_P (tmpl
))
5379 int depth
= TMPL_PARMS_DEPTH (parms
);
5381 /* It is a conversion operator. See if the type converted to
5382 depends on innermost template operands. */
5384 if (uses_template_parms_level (TREE_TYPE (TREE_TYPE (tmpl
)),
5386 DECL_TEMPLATE_CONV_FN_P (tmpl
) = 1;
5389 /* Give template template parms a DECL_CONTEXT of the template
5390 for which they are a parameter. */
5391 parms
= INNERMOST_TEMPLATE_PARMS (parms
);
5392 for (i
= TREE_VEC_LENGTH (parms
) - 1; i
>= 0; --i
)
5394 tree parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
5395 if (TREE_CODE (parm
) == TEMPLATE_DECL
)
5396 DECL_CONTEXT (parm
) = tmpl
;
5399 if (TREE_CODE (decl
) == TYPE_DECL
5400 && TYPE_DECL_ALIAS_P (decl
)
5401 && complex_alias_template_p (tmpl
))
5402 TEMPLATE_DECL_COMPLEX_ALIAS_P (tmpl
) = true;
5405 /* The DECL_TI_ARGS of DECL contains full set of arguments referring
5406 back to its most general template. If TMPL is a specialization,
5407 ARGS may only have the innermost set of arguments. Add the missing
5408 argument levels if necessary. */
5409 if (DECL_TEMPLATE_INFO (tmpl
))
5410 args
= add_outermost_template_args (DECL_TI_ARGS (tmpl
), args
);
5412 info
= build_template_info (tmpl
, args
);
5414 if (DECL_IMPLICIT_TYPEDEF_P (decl
))
5415 SET_TYPE_TEMPLATE_INFO (TREE_TYPE (tmpl
), info
);
5418 if (is_primary
&& !DECL_LANG_SPECIFIC (decl
))
5419 retrofit_lang_decl (decl
);
5420 if (DECL_LANG_SPECIFIC (decl
))
5421 DECL_TEMPLATE_INFO (decl
) = info
;
5424 if (flag_implicit_templates
5426 && TREE_PUBLIC (decl
)
5427 && VAR_OR_FUNCTION_DECL_P (decl
))
5428 /* Set DECL_COMDAT on template instantiations; if we force
5429 them to be emitted by explicit instantiation or -frepo,
5430 mark_needed will tell cgraph to do the right thing. */
5431 DECL_COMDAT (decl
) = true;
5433 return DECL_TEMPLATE_RESULT (tmpl
);
5437 push_template_decl (tree decl
)
5439 return push_template_decl_real (decl
, false);
5442 /* FN is an inheriting constructor that inherits from the constructor
5443 template INHERITED; turn FN into a constructor template with a matching
5447 add_inherited_template_parms (tree fn
, tree inherited
)
5450 = INNERMOST_TEMPLATE_PARMS (DECL_TEMPLATE_PARMS (inherited
));
5451 inner_parms
= copy_node (inner_parms
);
5453 = tree_cons (size_int (processing_template_decl
+ 1),
5454 inner_parms
, current_template_parms
);
5455 tree tmpl
= build_template_decl (fn
, parms
, /*member*/true);
5456 tree args
= template_parms_to_args (parms
);
5457 DECL_TEMPLATE_INFO (fn
) = build_template_info (tmpl
, args
);
5458 TREE_TYPE (tmpl
) = TREE_TYPE (fn
);
5459 DECL_TEMPLATE_RESULT (tmpl
) = fn
;
5460 DECL_ARTIFICIAL (tmpl
) = true;
5461 DECL_PRIMARY_TEMPLATE (tmpl
) = tmpl
;
5465 /* Called when a class template TYPE is redeclared with the indicated
5466 template PARMS, e.g.:
5468 template <class T> struct S;
5469 template <class T> struct S {}; */
5472 redeclare_class_template (tree type
, tree parms
, tree cons
)
5478 if (!TYPE_TEMPLATE_INFO (type
))
5480 error ("%qT is not a template type", type
);
5484 tmpl
= TYPE_TI_TEMPLATE (type
);
5485 if (!PRIMARY_TEMPLATE_P (tmpl
))
5486 /* The type is nested in some template class. Nothing to worry
5487 about here; there are no new template parameters for the nested
5493 error ("template specifiers not specified in declaration of %qD",
5498 parms
= INNERMOST_TEMPLATE_PARMS (parms
);
5499 tmpl_parms
= DECL_INNERMOST_TEMPLATE_PARMS (tmpl
);
5501 if (TREE_VEC_LENGTH (parms
) != TREE_VEC_LENGTH (tmpl_parms
))
5503 error_n (input_location
, TREE_VEC_LENGTH (parms
),
5504 "redeclared with %d template parameter",
5505 "redeclared with %d template parameters",
5506 TREE_VEC_LENGTH (parms
));
5507 inform_n (DECL_SOURCE_LOCATION (tmpl
), TREE_VEC_LENGTH (tmpl_parms
),
5508 "previous declaration %qD used %d template parameter",
5509 "previous declaration %qD used %d template parameters",
5510 tmpl
, TREE_VEC_LENGTH (tmpl_parms
));
5514 for (i
= 0; i
< TREE_VEC_LENGTH (tmpl_parms
); ++i
)
5521 if (TREE_VEC_ELT (tmpl_parms
, i
) == error_mark_node
5522 || TREE_VEC_ELT (parms
, i
) == error_mark_node
)
5525 tmpl_parm
= TREE_VALUE (TREE_VEC_ELT (tmpl_parms
, i
));
5526 if (error_operand_p (tmpl_parm
))
5529 parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
5530 tmpl_default
= TREE_PURPOSE (TREE_VEC_ELT (tmpl_parms
, i
));
5531 parm_default
= TREE_PURPOSE (TREE_VEC_ELT (parms
, i
));
5533 /* TMPL_PARM and PARM can be either TYPE_DECL, PARM_DECL, or
5535 if (TREE_CODE (tmpl_parm
) != TREE_CODE (parm
)
5536 || (TREE_CODE (tmpl_parm
) != TYPE_DECL
5537 && !same_type_p (TREE_TYPE (tmpl_parm
), TREE_TYPE (parm
)))
5538 || (TREE_CODE (tmpl_parm
) != PARM_DECL
5539 && (TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (tmpl_parm
))
5540 != TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (parm
))))
5541 || (TREE_CODE (tmpl_parm
) == PARM_DECL
5542 && (TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (tmpl_parm
))
5543 != TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm
)))))
5545 error ("template parameter %q+#D", tmpl_parm
);
5546 error ("redeclared here as %q#D", parm
);
5550 if (tmpl_default
!= NULL_TREE
&& parm_default
!= NULL_TREE
)
5552 /* We have in [temp.param]:
5554 A template-parameter may not be given default arguments
5555 by two different declarations in the same scope. */
5556 error_at (input_location
, "redefinition of default argument for %q#D", parm
);
5557 inform (DECL_SOURCE_LOCATION (tmpl_parm
),
5558 "original definition appeared here");
5562 if (parm_default
!= NULL_TREE
)
5563 /* Update the previous template parameters (which are the ones
5564 that will really count) with the new default value. */
5565 TREE_PURPOSE (TREE_VEC_ELT (tmpl_parms
, i
)) = parm_default
;
5566 else if (tmpl_default
!= NULL_TREE
)
5567 /* Update the new parameters, too; they'll be used as the
5568 parameters for any members. */
5569 TREE_PURPOSE (TREE_VEC_ELT (parms
, i
)) = tmpl_default
;
5571 /* Give each template template parm in this redeclaration a
5572 DECL_CONTEXT of the template for which they are a parameter. */
5573 if (TREE_CODE (parm
) == TEMPLATE_DECL
)
5575 gcc_assert (DECL_CONTEXT (parm
) == NULL_TREE
);
5576 DECL_CONTEXT (parm
) = tmpl
;
5580 // Cannot redeclare a class template with a different set of constraints.
5581 if (!equivalent_constraints (get_constraints (tmpl
), cons
))
5583 error_at (input_location
, "redeclaration %q#D with different "
5584 "constraints", tmpl
);
5585 inform (DECL_SOURCE_LOCATION (tmpl
),
5586 "original declaration appeared here");
5592 /* The actual substitution part of instantiate_non_dependent_expr_sfinae,
5593 to be used when the caller has already checked
5594 (processing_template_decl
5595 && !instantiation_dependent_expression_p (expr)
5596 && potential_constant_expression (expr))
5597 and cleared processing_template_decl. */
5600 instantiate_non_dependent_expr_internal (tree expr
, tsubst_flags_t complain
)
5602 return tsubst_copy_and_build (expr
,
5605 /*in_decl=*/NULL_TREE
,
5606 /*function_p=*/false,
5607 /*integral_constant_expression_p=*/true);
5610 /* Simplify EXPR if it is a non-dependent expression. Returns the
5611 (possibly simplified) expression. */
5614 instantiate_non_dependent_expr_sfinae (tree expr
, tsubst_flags_t complain
)
5616 if (expr
== NULL_TREE
)
5619 /* If we're in a template, but EXPR isn't value dependent, simplify
5620 it. We're supposed to treat:
5622 template <typename T> void f(T[1 + 1]);
5623 template <typename T> void f(T[2]);
5625 as two declarations of the same function, for example. */
5626 if (processing_template_decl
5627 && !instantiation_dependent_expression_p (expr
)
5628 && potential_constant_expression (expr
))
5630 processing_template_decl_sentinel s
;
5631 expr
= instantiate_non_dependent_expr_internal (expr
, complain
);
5637 instantiate_non_dependent_expr (tree expr
)
5639 return instantiate_non_dependent_expr_sfinae (expr
, tf_error
);
5642 /* True iff T is a specialization of a variable template. */
5645 variable_template_specialization_p (tree t
)
5647 if (!VAR_P (t
) || !DECL_LANG_SPECIFIC (t
) || !DECL_TEMPLATE_INFO (t
))
5649 tree tmpl
= DECL_TI_TEMPLATE (t
);
5650 return variable_template_p (tmpl
);
5653 /* Return TRUE iff T is a type alias, a TEMPLATE_DECL for an alias
5654 template declaration, or a TYPE_DECL for an alias declaration. */
5657 alias_type_or_template_p (tree t
)
5661 return ((TREE_CODE (t
) == TYPE_DECL
&& TYPE_DECL_ALIAS_P (t
))
5664 && TYPE_DECL_ALIAS_P (TYPE_NAME (t
)))
5665 || DECL_ALIAS_TEMPLATE_P (t
));
5668 /* Return TRUE iff T is a specialization of an alias template. */
5671 alias_template_specialization_p (const_tree t
)
5673 /* It's an alias template specialization if it's an alias and its
5674 TYPE_NAME is a specialization of a primary template. */
5675 if (TYPE_ALIAS_P (t
))
5677 tree name
= TYPE_NAME (t
);
5678 if (DECL_LANG_SPECIFIC (name
))
5679 if (tree ti
= DECL_TEMPLATE_INFO (name
))
5681 tree tmpl
= TI_TEMPLATE (ti
);
5682 return PRIMARY_TEMPLATE_P (tmpl
);
5688 /* An alias template is complex from a SFINAE perspective if a template-id
5689 using that alias can be ill-formed when the expansion is not, as with
5690 the void_t template. We determine this by checking whether the
5691 expansion for the alias template uses all its template parameters. */
5693 struct uses_all_template_parms_data
5700 uses_all_template_parms_r (tree t
, void *data_
)
5702 struct uses_all_template_parms_data
&data
5703 = *(struct uses_all_template_parms_data
*)data_
;
5704 tree idx
= get_template_parm_index (t
);
5706 if (TEMPLATE_PARM_LEVEL (idx
) == data
.level
)
5707 data
.seen
[TEMPLATE_PARM_IDX (idx
)] = true;
5712 complex_alias_template_p (const_tree tmpl
)
5714 struct uses_all_template_parms_data data
;
5715 tree pat
= DECL_ORIGINAL_TYPE (DECL_TEMPLATE_RESULT (tmpl
));
5716 tree parms
= DECL_TEMPLATE_PARMS (tmpl
);
5717 data
.level
= TMPL_PARMS_DEPTH (parms
);
5718 int len
= TREE_VEC_LENGTH (INNERMOST_TEMPLATE_PARMS (parms
));
5719 data
.seen
= XALLOCAVEC (bool, len
);
5720 for (int i
= 0; i
< len
; ++i
)
5721 data
.seen
[i
] = false;
5723 for_each_template_parm (pat
, uses_all_template_parms_r
, &data
, NULL
, true);
5724 for (int i
= 0; i
< len
; ++i
)
5730 /* Return TRUE iff T is a specialization of a complex alias template with
5731 dependent template-arguments. */
5734 dependent_alias_template_spec_p (const_tree t
)
5736 return (alias_template_specialization_p (t
)
5737 && TEMPLATE_DECL_COMPLEX_ALIAS_P (DECL_TI_TEMPLATE (TYPE_NAME (t
)))
5738 && (any_dependent_template_arguments_p
5739 (INNERMOST_TEMPLATE_ARGS (TYPE_TI_ARGS (t
)))));
5742 /* Return the number of innermost template parameters in TMPL. */
5745 num_innermost_template_parms (tree tmpl
)
5747 tree parms
= INNERMOST_TEMPLATE_PARMS (DECL_TEMPLATE_PARMS (tmpl
));
5748 return TREE_VEC_LENGTH (parms
);
5751 /* Return either TMPL or another template that it is equivalent to under DR
5752 1286: An alias that just changes the name of a template is equivalent to
5753 the other template. */
5756 get_underlying_template (tree tmpl
)
5758 gcc_assert (TREE_CODE (tmpl
) == TEMPLATE_DECL
);
5759 while (DECL_ALIAS_TEMPLATE_P (tmpl
))
5761 tree result
= DECL_ORIGINAL_TYPE (DECL_TEMPLATE_RESULT (tmpl
));
5762 if (TYPE_TEMPLATE_INFO (result
))
5764 tree sub
= TYPE_TI_TEMPLATE (result
);
5765 if (PRIMARY_TEMPLATE_P (sub
)
5766 && (num_innermost_template_parms (tmpl
)
5767 == num_innermost_template_parms (sub
)))
5769 tree alias_args
= INNERMOST_TEMPLATE_ARGS
5770 (template_parms_to_args (DECL_TEMPLATE_PARMS (tmpl
)));
5771 if (!comp_template_args (TYPE_TI_ARGS (result
), alias_args
))
5773 /* The alias type is equivalent to the pattern of the
5774 underlying template, so strip the alias. */
5784 /* Subroutine of convert_nontype_argument. Converts EXPR to TYPE, which
5785 must be a function or a pointer-to-function type, as specified
5786 in [temp.arg.nontype]: disambiguate EXPR if it is an overload set,
5787 and check that the resulting function has external linkage. */
5790 convert_nontype_argument_function (tree type
, tree expr
,
5791 tsubst_flags_t complain
)
5795 linkage_kind linkage
;
5797 fn
= instantiate_type (type
, fns
, tf_none
);
5798 if (fn
== error_mark_node
)
5799 return error_mark_node
;
5802 if (TREE_CODE (fn_no_ptr
) == ADDR_EXPR
)
5803 fn_no_ptr
= TREE_OPERAND (fn_no_ptr
, 0);
5804 if (BASELINK_P (fn_no_ptr
))
5805 fn_no_ptr
= BASELINK_FUNCTIONS (fn_no_ptr
);
5807 /* [temp.arg.nontype]/1
5809 A template-argument for a non-type, non-template template-parameter
5812 -- the address of an object or function with external [C++11: or
5813 internal] linkage. */
5815 if (TREE_CODE (fn_no_ptr
) != FUNCTION_DECL
)
5817 if (complain
& tf_error
)
5819 error ("%qE is not a valid template argument for type %qT",
5821 if (TYPE_PTR_P (type
))
5822 error ("it must be the address of a function with "
5823 "external linkage");
5825 error ("it must be the name of a function with "
5826 "external linkage");
5831 linkage
= decl_linkage (fn_no_ptr
);
5832 if (cxx_dialect
>= cxx11
? linkage
== lk_none
: linkage
!= lk_external
)
5834 if (complain
& tf_error
)
5836 if (cxx_dialect
>= cxx11
)
5837 error ("%qE is not a valid template argument for type %qT "
5838 "because %qD has no linkage",
5839 expr
, type
, fn_no_ptr
);
5841 error ("%qE is not a valid template argument for type %qT "
5842 "because %qD does not have external linkage",
5843 expr
, type
, fn_no_ptr
);
5851 /* Subroutine of convert_nontype_argument.
5852 Check if EXPR of type TYPE is a valid pointer-to-member constant.
5853 Emit an error otherwise. */
5856 check_valid_ptrmem_cst_expr (tree type
, tree expr
,
5857 tsubst_flags_t complain
)
5860 if (expr
&& (null_ptr_cst_p (expr
) || TREE_CODE (expr
) == PTRMEM_CST
))
5862 if (cxx_dialect
>= cxx11
&& null_member_pointer_value_p (expr
))
5864 if (processing_template_decl
5865 && TREE_CODE (expr
) == ADDR_EXPR
5866 && TREE_CODE (TREE_OPERAND (expr
, 0)) == OFFSET_REF
)
5868 if (complain
& tf_error
)
5870 error ("%qE is not a valid template argument for type %qT",
5872 error ("it must be a pointer-to-member of the form %<&X::Y%>");
5877 /* Returns TRUE iff the address of OP is value-dependent.
5879 14.6.2.4 [temp.dep.temp]:
5880 A non-integral non-type template-argument is dependent if its type is
5881 dependent or it has either of the following forms
5884 and contains a nested-name-specifier which specifies a class-name that
5885 names a dependent type.
5887 We generalize this to just say that the address of a member of a
5888 dependent class is value-dependent; the above doesn't cover the
5889 address of a static data member named with an unqualified-id. */
5892 has_value_dependent_address (tree op
)
5894 /* We could use get_inner_reference here, but there's no need;
5895 this is only relevant for template non-type arguments, which
5896 can only be expressed as &id-expression. */
5899 tree ctx
= CP_DECL_CONTEXT (op
);
5900 if (TYPE_P (ctx
) && dependent_type_p (ctx
))
5907 /* The next set of functions are used for providing helpful explanatory
5908 diagnostics for failed overload resolution. Their messages should be
5909 indented by two spaces for consistency with the messages in
5913 unify_success (bool /*explain_p*/)
5919 unify_parameter_deduction_failure (bool explain_p
, tree parm
)
5922 inform (input_location
,
5923 " couldn't deduce template parameter %qD", parm
);
5928 unify_invalid (bool /*explain_p*/)
5934 unify_cv_qual_mismatch (bool explain_p
, tree parm
, tree arg
)
5937 inform (input_location
,
5938 " types %qT and %qT have incompatible cv-qualifiers",
5944 unify_type_mismatch (bool explain_p
, tree parm
, tree arg
)
5947 inform (input_location
, " mismatched types %qT and %qT", parm
, arg
);
5952 unify_parameter_pack_mismatch (bool explain_p
, tree parm
, tree arg
)
5955 inform (input_location
,
5956 " template parameter %qD is not a parameter pack, but "
5963 unify_ptrmem_cst_mismatch (bool explain_p
, tree parm
, tree arg
)
5966 inform (input_location
,
5967 " template argument %qE does not match "
5968 "pointer-to-member constant %qE",
5974 unify_expression_unequal (bool explain_p
, tree parm
, tree arg
)
5977 inform (input_location
, " %qE is not equivalent to %qE", parm
, arg
);
5982 unify_parameter_pack_inconsistent (bool explain_p
, tree old_arg
, tree new_arg
)
5985 inform (input_location
,
5986 " inconsistent parameter pack deduction with %qT and %qT",
5992 unify_inconsistency (bool explain_p
, tree parm
, tree first
, tree second
)
5997 inform (input_location
,
5998 " deduced conflicting types for parameter %qT (%qT and %qT)",
5999 parm
, first
, second
);
6001 inform (input_location
,
6002 " deduced conflicting values for non-type parameter "
6003 "%qE (%qE and %qE)", parm
, first
, second
);
6009 unify_vla_arg (bool explain_p
, tree arg
)
6012 inform (input_location
,
6013 " variable-sized array type %qT is not "
6014 "a valid template argument",
6020 unify_method_type_error (bool explain_p
, tree arg
)
6023 inform (input_location
,
6024 " member function type %qT is not a valid template argument",
6030 unify_arity (bool explain_p
, int have
, int wanted
, bool least_p
= false)
6035 inform_n (input_location
, wanted
,
6036 " candidate expects at least %d argument, %d provided",
6037 " candidate expects at least %d arguments, %d provided",
6040 inform_n (input_location
, wanted
,
6041 " candidate expects %d argument, %d provided",
6042 " candidate expects %d arguments, %d provided",
6049 unify_too_many_arguments (bool explain_p
, int have
, int wanted
)
6051 return unify_arity (explain_p
, have
, wanted
);
6055 unify_too_few_arguments (bool explain_p
, int have
, int wanted
,
6056 bool least_p
= false)
6058 return unify_arity (explain_p
, have
, wanted
, least_p
);
6062 unify_arg_conversion (bool explain_p
, tree to_type
,
6063 tree from_type
, tree arg
)
6066 inform (EXPR_LOC_OR_LOC (arg
, input_location
),
6067 " cannot convert %qE (type %qT) to type %qT",
6068 arg
, from_type
, to_type
);
6073 unify_no_common_base (bool explain_p
, enum template_base_result r
,
6074 tree parm
, tree arg
)
6079 case tbr_ambiguous_baseclass
:
6080 inform (input_location
, " %qT is an ambiguous base class of %qT",
6084 inform (input_location
, " %qT is not derived from %qT", arg
, parm
);
6091 unify_inconsistent_template_template_parameters (bool explain_p
)
6094 inform (input_location
,
6095 " template parameters of a template template argument are "
6096 "inconsistent with other deduced template arguments");
6101 unify_template_deduction_failure (bool explain_p
, tree parm
, tree arg
)
6104 inform (input_location
,
6105 " can't deduce a template for %qT from non-template type %qT",
6111 unify_template_argument_mismatch (bool explain_p
, tree parm
, tree arg
)
6114 inform (input_location
,
6115 " template argument %qE does not match %qD", arg
, parm
);
6120 unify_overload_resolution_failure (bool explain_p
, tree arg
)
6123 inform (input_location
,
6124 " could not resolve address from overloaded function %qE",
6129 /* Attempt to convert the non-type template parameter EXPR to the
6130 indicated TYPE. If the conversion is successful, return the
6131 converted value. If the conversion is unsuccessful, return
6132 NULL_TREE if we issued an error message, or error_mark_node if we
6133 did not. We issue error messages for out-and-out bad template
6134 parameters, but not simply because the conversion failed, since we
6135 might be just trying to do argument deduction. Both TYPE and EXPR
6136 must be non-dependent.
6138 The conversion follows the special rules described in
6139 [temp.arg.nontype], and it is much more strict than an implicit
6142 This function is called twice for each template argument (see
6143 lookup_template_class for a more accurate description of this
6144 problem). This means that we need to handle expressions which
6145 are not valid in a C++ source, but can be created from the
6146 first call (for instance, casts to perform conversions). These
6147 hacks can go away after we fix the double coercion problem. */
6150 convert_nontype_argument (tree type
, tree expr
, tsubst_flags_t complain
)
6154 /* Detect immediately string literals as invalid non-type argument.
6155 This special-case is not needed for correctness (we would easily
6156 catch this later), but only to provide better diagnostic for this
6157 common user mistake. As suggested by DR 100, we do not mention
6158 linkage issues in the diagnostic as this is not the point. */
6159 /* FIXME we're making this OK. */
6160 if (TREE_CODE (expr
) == STRING_CST
)
6162 if (complain
& tf_error
)
6163 error ("%qE is not a valid template argument for type %qT "
6164 "because string literals can never be used in this context",
6169 /* Add the ADDR_EXPR now for the benefit of
6170 value_dependent_expression_p. */
6171 if (TYPE_PTROBV_P (type
)
6172 && TREE_CODE (TREE_TYPE (expr
)) == ARRAY_TYPE
)
6174 expr
= decay_conversion (expr
, complain
);
6175 if (expr
== error_mark_node
)
6176 return error_mark_node
;
6179 /* If we are in a template, EXPR may be non-dependent, but still
6180 have a syntactic, rather than semantic, form. For example, EXPR
6181 might be a SCOPE_REF, rather than the VAR_DECL to which the
6182 SCOPE_REF refers. Preserving the qualifying scope is necessary
6183 so that access checking can be performed when the template is
6184 instantiated -- but here we need the resolved form so that we can
6185 convert the argument. */
6186 bool non_dep
= false;
6187 if (TYPE_REF_OBJ_P (type
)
6188 && has_value_dependent_address (expr
))
6189 /* If we want the address and it's value-dependent, don't fold. */;
6190 else if (!type_unknown_p (expr
)
6191 && processing_template_decl
6192 && !instantiation_dependent_expression_p (expr
)
6193 && potential_constant_expression (expr
))
6195 if (error_operand_p (expr
))
6196 return error_mark_node
;
6197 expr_type
= TREE_TYPE (expr
);
6198 if (TREE_CODE (type
) == REFERENCE_TYPE
)
6199 expr
= mark_lvalue_use (expr
);
6201 expr
= mark_rvalue_use (expr
);
6203 /* If the argument is non-dependent, perform any conversions in
6204 non-dependent context as well. */
6205 processing_template_decl_sentinel
s (non_dep
);
6207 expr
= instantiate_non_dependent_expr_internal (expr
, complain
);
6209 /* 14.3.2/5: The null pointer{,-to-member} conversion is applied
6210 to a non-type argument of "nullptr". */
6211 if (expr
== nullptr_node
&& TYPE_PTR_OR_PTRMEM_P (type
))
6212 expr
= convert (type
, expr
);
6214 /* In C++11, integral or enumeration non-type template arguments can be
6215 arbitrary constant expressions. Pointer and pointer to
6216 member arguments can be general constant expressions that evaluate
6217 to a null value, but otherwise still need to be of a specific form. */
6218 if (cxx_dialect
>= cxx11
)
6220 if (TREE_CODE (expr
) == PTRMEM_CST
)
6221 /* A PTRMEM_CST is already constant, and a valid template
6222 argument for a parameter of pointer to member type, we just want
6223 to leave it in that form rather than lower it to a
6225 else if (INTEGRAL_OR_ENUMERATION_TYPE_P (type
))
6226 expr
= maybe_constant_value (expr
);
6227 else if (TYPE_PTR_OR_PTRMEM_P (type
))
6229 tree folded
= maybe_constant_value (expr
);
6230 if (TYPE_PTR_P (type
) ? integer_zerop (folded
)
6231 : null_member_pointer_value_p (folded
))
6236 /* HACK: Due to double coercion, we can get a
6237 NOP_EXPR<REFERENCE_TYPE>(ADDR_EXPR<POINTER_TYPE> (arg)) here,
6238 which is the tree that we built on the first call (see
6239 below when coercing to reference to object or to reference to
6240 function). We just strip everything and get to the arg.
6241 See g++.old-deja/g++.oliva/template4.C and g++.dg/template/nontype9.C
6243 if (TYPE_REF_OBJ_P (type
) || TYPE_REFFN_P (type
))
6245 tree probe_type
, probe
= expr
;
6246 if (REFERENCE_REF_P (probe
))
6247 probe
= TREE_OPERAND (probe
, 0);
6248 probe_type
= TREE_TYPE (probe
);
6249 if (TREE_CODE (probe
) == NOP_EXPR
)
6251 /* ??? Maybe we could use convert_from_reference here, but we
6252 would need to relax its constraints because the NOP_EXPR
6253 could actually change the type to something more cv-qualified,
6254 and this is not folded by convert_from_reference. */
6255 tree addr
= TREE_OPERAND (probe
, 0);
6256 if (TREE_CODE (probe_type
) == REFERENCE_TYPE
6257 && TREE_CODE (addr
) == ADDR_EXPR
6258 && TYPE_PTR_P (TREE_TYPE (addr
))
6259 && (same_type_ignoring_top_level_qualifiers_p
6260 (TREE_TYPE (probe_type
),
6261 TREE_TYPE (TREE_TYPE (addr
)))))
6263 expr
= TREE_OPERAND (addr
, 0);
6264 expr_type
= TREE_TYPE (probe_type
);
6269 /* We could also generate a NOP_EXPR(ADDR_EXPR()) when the
6270 parameter is a pointer to object, through decay and
6271 qualification conversion. Let's strip everything. */
6272 else if (TREE_CODE (expr
) == NOP_EXPR
&& TYPE_PTROBV_P (type
))
6276 if (TREE_CODE (probe
) == ADDR_EXPR
6277 && TYPE_PTR_P (TREE_TYPE (probe
)))
6279 /* Skip the ADDR_EXPR only if it is part of the decay for
6280 an array. Otherwise, it is part of the original argument
6281 in the source code. */
6282 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (probe
, 0))) == ARRAY_TYPE
)
6283 probe
= TREE_OPERAND (probe
, 0);
6285 expr_type
= TREE_TYPE (expr
);
6289 /* [temp.arg.nontype]/5, bullet 1
6291 For a non-type template-parameter of integral or enumeration type,
6292 integral promotions (_conv.prom_) and integral conversions
6293 (_conv.integral_) are applied. */
6294 if (INTEGRAL_OR_ENUMERATION_TYPE_P (type
))
6296 tree t
= build_integral_nontype_arg_conv (type
, expr
, complain
);
6297 t
= maybe_constant_value (t
);
6298 if (t
!= error_mark_node
)
6301 if (!same_type_ignoring_top_level_qualifiers_p (type
, TREE_TYPE (expr
)))
6302 return error_mark_node
;
6304 /* Notice that there are constant expressions like '4 % 0' which
6305 do not fold into integer constants. */
6306 if (TREE_CODE (expr
) != INTEGER_CST
)
6308 if (complain
& tf_error
)
6310 int errs
= errorcount
, warns
= warningcount
+ werrorcount
;
6311 if (processing_template_decl
6312 && !require_potential_constant_expression (expr
))
6314 expr
= cxx_constant_value (expr
);
6315 if (errorcount
> errs
|| warningcount
+ werrorcount
> warns
)
6316 inform (EXPR_LOC_OR_LOC (expr
, input_location
),
6317 "in template argument for type %qT ", type
);
6318 if (expr
== error_mark_node
)
6320 /* else cxx_constant_value complained but gave us
6321 a real constant, so go ahead. */
6322 gcc_assert (TREE_CODE (expr
) == INTEGER_CST
);
6328 /* Avoid typedef problems. */
6329 if (TREE_TYPE (expr
) != type
)
6330 expr
= fold_convert (type
, expr
);
6332 /* [temp.arg.nontype]/5, bullet 2
6334 For a non-type template-parameter of type pointer to object,
6335 qualification conversions (_conv.qual_) and the array-to-pointer
6336 conversion (_conv.array_) are applied. */
6337 else if (TYPE_PTROBV_P (type
))
6339 /* [temp.arg.nontype]/1 (TC1 version, DR 49):
6341 A template-argument for a non-type, non-template template-parameter
6342 shall be one of: [...]
6344 -- the name of a non-type template-parameter;
6345 -- the address of an object or function with external linkage, [...]
6346 expressed as "& id-expression" where the & is optional if the name
6347 refers to a function or array, or if the corresponding
6348 template-parameter is a reference.
6350 Here, we do not care about functions, as they are invalid anyway
6351 for a parameter of type pointer-to-object. */
6353 if (DECL_P (expr
) && DECL_TEMPLATE_PARM_P (expr
))
6354 /* Non-type template parameters are OK. */
6356 else if (cxx_dialect
>= cxx11
&& integer_zerop (expr
))
6357 /* Null pointer values are OK in C++11. */;
6358 else if (TREE_CODE (expr
) != ADDR_EXPR
6359 && TREE_CODE (expr_type
) != ARRAY_TYPE
)
6363 if (complain
& tf_error
)
6364 error ("%qD is not a valid template argument "
6365 "because %qD is a variable, not the address of "
6366 "a variable", expr
, expr
);
6369 if (POINTER_TYPE_P (expr_type
))
6371 if (complain
& tf_error
)
6372 error ("%qE is not a valid template argument for %qT "
6373 "because it is not the address of a variable",
6377 /* Other values, like integer constants, might be valid
6378 non-type arguments of some other type. */
6379 return error_mark_node
;
6385 decl
= ((TREE_CODE (expr
) == ADDR_EXPR
)
6386 ? TREE_OPERAND (expr
, 0) : expr
);
6389 if (complain
& tf_error
)
6390 error ("%qE is not a valid template argument of type %qT "
6391 "because %qE is not a variable", expr
, type
, decl
);
6394 else if (cxx_dialect
< cxx11
&& !DECL_EXTERNAL_LINKAGE_P (decl
))
6396 if (complain
& tf_error
)
6397 error ("%qE is not a valid template argument of type %qT "
6398 "because %qD does not have external linkage",
6402 else if (cxx_dialect
>= cxx11
&& decl_linkage (decl
) == lk_none
)
6404 if (complain
& tf_error
)
6405 error ("%qE is not a valid template argument of type %qT "
6406 "because %qD has no linkage", expr
, type
, decl
);
6411 expr
= decay_conversion (expr
, complain
);
6412 if (expr
== error_mark_node
)
6413 return error_mark_node
;
6415 expr
= perform_qualification_conversions (type
, expr
);
6416 if (expr
== error_mark_node
)
6417 return error_mark_node
;
6419 /* [temp.arg.nontype]/5, bullet 3
6421 For a non-type template-parameter of type reference to object, no
6422 conversions apply. The type referred to by the reference may be more
6423 cv-qualified than the (otherwise identical) type of the
6424 template-argument. The template-parameter is bound directly to the
6425 template-argument, which must be an lvalue. */
6426 else if (TYPE_REF_OBJ_P (type
))
6428 if (!same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (type
),
6430 return error_mark_node
;
6432 if (!at_least_as_qualified_p (TREE_TYPE (type
), expr_type
))
6434 if (complain
& tf_error
)
6435 error ("%qE is not a valid template argument for type %qT "
6436 "because of conflicts in cv-qualification", expr
, type
);
6440 if (!real_lvalue_p (expr
))
6442 if (complain
& tf_error
)
6443 error ("%qE is not a valid template argument for type %qT "
6444 "because it is not an lvalue", expr
, type
);
6448 /* [temp.arg.nontype]/1
6450 A template-argument for a non-type, non-template template-parameter
6451 shall be one of: [...]
6453 -- the address of an object or function with external linkage. */
6454 if (INDIRECT_REF_P (expr
)
6455 && TYPE_REF_OBJ_P (TREE_TYPE (TREE_OPERAND (expr
, 0))))
6457 expr
= TREE_OPERAND (expr
, 0);
6460 if (complain
& tf_error
)
6461 error ("%q#D is not a valid template argument for type %qT "
6462 "because a reference variable does not have a constant "
6463 "address", expr
, type
);
6470 if (complain
& tf_error
)
6471 error ("%qE is not a valid template argument for type %qT "
6472 "because it is not an object with linkage",
6477 /* DR 1155 allows internal linkage in C++11 and up. */
6478 linkage_kind linkage
= decl_linkage (expr
);
6479 if (linkage
< (cxx_dialect
>= cxx11
? lk_internal
: lk_external
))
6481 if (complain
& tf_error
)
6482 error ("%qE is not a valid template argument for type %qT "
6483 "because object %qD does not have linkage",
6488 expr
= build_nop (type
, build_address (expr
));
6490 /* [temp.arg.nontype]/5, bullet 4
6492 For a non-type template-parameter of type pointer to function, only
6493 the function-to-pointer conversion (_conv.func_) is applied. If the
6494 template-argument represents a set of overloaded functions (or a
6495 pointer to such), the matching function is selected from the set
6497 else if (TYPE_PTRFN_P (type
))
6499 /* If the argument is a template-id, we might not have enough
6500 context information to decay the pointer. */
6501 if (!type_unknown_p (expr_type
))
6503 expr
= decay_conversion (expr
, complain
);
6504 if (expr
== error_mark_node
)
6505 return error_mark_node
;
6508 if (cxx_dialect
>= cxx11
&& integer_zerop (expr
))
6509 /* Null pointer values are OK in C++11. */
6510 return perform_qualification_conversions (type
, expr
);
6512 expr
= convert_nontype_argument_function (type
, expr
, complain
);
6513 if (!expr
|| expr
== error_mark_node
)
6516 /* [temp.arg.nontype]/5, bullet 5
6518 For a non-type template-parameter of type reference to function, no
6519 conversions apply. If the template-argument represents a set of
6520 overloaded functions, the matching function is selected from the set
6522 else if (TYPE_REFFN_P (type
))
6524 if (TREE_CODE (expr
) == ADDR_EXPR
)
6526 if (complain
& tf_error
)
6528 error ("%qE is not a valid template argument for type %qT "
6529 "because it is a pointer", expr
, type
);
6530 inform (input_location
, "try using %qE instead",
6531 TREE_OPERAND (expr
, 0));
6536 expr
= convert_nontype_argument_function (type
, expr
, complain
);
6537 if (!expr
|| expr
== error_mark_node
)
6540 expr
= build_nop (type
, build_address (expr
));
6542 /* [temp.arg.nontype]/5, bullet 6
6544 For a non-type template-parameter of type pointer to member function,
6545 no conversions apply. If the template-argument represents a set of
6546 overloaded member functions, the matching member function is selected
6547 from the set (_over.over_). */
6548 else if (TYPE_PTRMEMFUNC_P (type
))
6550 expr
= instantiate_type (type
, expr
, tf_none
);
6551 if (expr
== error_mark_node
)
6552 return error_mark_node
;
6554 /* [temp.arg.nontype] bullet 1 says the pointer to member
6555 expression must be a pointer-to-member constant. */
6556 if (!check_valid_ptrmem_cst_expr (type
, expr
, complain
))
6557 return error_mark_node
;
6559 /* There is no way to disable standard conversions in
6560 resolve_address_of_overloaded_function (called by
6561 instantiate_type). It is possible that the call succeeded by
6562 converting &B::I to &D::I (where B is a base of D), so we need
6563 to reject this conversion here.
6565 Actually, even if there was a way to disable standard conversions,
6566 it would still be better to reject them here so that we can
6567 provide a superior diagnostic. */
6568 if (!same_type_p (TREE_TYPE (expr
), type
))
6570 if (complain
& tf_error
)
6572 error ("%qE is not a valid template argument for type %qT "
6573 "because it is of type %qT", expr
, type
,
6575 /* If we are just one standard conversion off, explain. */
6576 if (can_convert_standard (type
, TREE_TYPE (expr
), complain
))
6577 inform (input_location
,
6578 "standard conversions are not allowed in this context");
6583 /* [temp.arg.nontype]/5, bullet 7
6585 For a non-type template-parameter of type pointer to data member,
6586 qualification conversions (_conv.qual_) are applied. */
6587 else if (TYPE_PTRDATAMEM_P (type
))
6589 /* [temp.arg.nontype] bullet 1 says the pointer to member
6590 expression must be a pointer-to-member constant. */
6591 if (!check_valid_ptrmem_cst_expr (type
, expr
, complain
))
6592 return error_mark_node
;
6594 expr
= perform_qualification_conversions (type
, expr
);
6595 if (expr
== error_mark_node
)
6598 else if (NULLPTR_TYPE_P (type
))
6600 if (expr
!= nullptr_node
)
6602 if (complain
& tf_error
)
6603 error ("%qE is not a valid template argument for type %qT "
6604 "because it is of type %qT", expr
, type
, TREE_TYPE (expr
));
6609 /* A template non-type parameter must be one of the above. */
6613 /* Sanity check: did we actually convert the argument to the
6615 gcc_assert (same_type_ignoring_top_level_qualifiers_p
6616 (type
, TREE_TYPE (expr
)));
6617 return convert_from_reference (expr
);
6620 /* Subroutine of coerce_template_template_parms, which returns 1 if
6621 PARM_PARM and ARG_PARM match using the rule for the template
6622 parameters of template template parameters. Both PARM and ARG are
6623 template parameters; the rest of the arguments are the same as for
6624 coerce_template_template_parms.
6627 coerce_template_template_parm (tree parm
,
6629 tsubst_flags_t complain
,
6633 if (arg
== NULL_TREE
|| error_operand_p (arg
)
6634 || parm
== NULL_TREE
|| error_operand_p (parm
))
6637 if (TREE_CODE (arg
) != TREE_CODE (parm
))
6640 switch (TREE_CODE (parm
))
6643 /* We encounter instantiations of templates like
6644 template <template <template <class> class> class TT>
6647 tree parmparm
= DECL_INNERMOST_TEMPLATE_PARMS (parm
);
6648 tree argparm
= DECL_INNERMOST_TEMPLATE_PARMS (arg
);
6650 if (!coerce_template_template_parms
6651 (parmparm
, argparm
, complain
, in_decl
, outer_args
))
6657 if (TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (arg
))
6658 && !TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (parm
)))
6659 /* Argument is a parameter pack but parameter is not. */
6664 /* The tsubst call is used to handle cases such as
6666 template <int> class C {};
6667 template <class T, template <T> class TT> class D {};
6670 i.e. the parameter list of TT depends on earlier parameters. */
6671 if (!uses_template_parms (TREE_TYPE (arg
)))
6673 tree t
= tsubst (TREE_TYPE (parm
), outer_args
, complain
, in_decl
);
6674 if (!uses_template_parms (t
)
6675 && !same_type_p (t
, TREE_TYPE (arg
)))
6679 if (TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (arg
))
6680 && !TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm
)))
6681 /* Argument is a parameter pack but parameter is not. */
6694 /* Return 1 if PARM_PARMS and ARG_PARMS matches using rule for
6695 template template parameters. Both PARM_PARMS and ARG_PARMS are
6696 vectors of TREE_LIST nodes containing TYPE_DECL, TEMPLATE_DECL
6699 Consider the example:
6700 template <class T> class A;
6701 template<template <class U> class TT> class B;
6703 For B<A>, PARM_PARMS are the parameters to TT, while ARG_PARMS are
6704 the parameters to A, and OUTER_ARGS contains A. */
6707 coerce_template_template_parms (tree parm_parms
,
6709 tsubst_flags_t complain
,
6713 int nparms
, nargs
, i
;
6717 gcc_assert (TREE_CODE (parm_parms
) == TREE_VEC
);
6718 gcc_assert (TREE_CODE (arg_parms
) == TREE_VEC
);
6720 nparms
= TREE_VEC_LENGTH (parm_parms
);
6721 nargs
= TREE_VEC_LENGTH (arg_parms
);
6723 /* Determine whether we have a parameter pack at the end of the
6724 template template parameter's template parameter list. */
6725 if (TREE_VEC_ELT (parm_parms
, nparms
- 1) != error_mark_node
)
6727 parm
= TREE_VALUE (TREE_VEC_ELT (parm_parms
, nparms
- 1));
6729 if (error_operand_p (parm
))
6732 switch (TREE_CODE (parm
))
6736 if (TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (parm
)))
6741 if (TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm
)))
6751 && !(variadic_p
&& nargs
>= nparms
- 1))
6754 /* Check all of the template parameters except the parameter pack at
6755 the end (if any). */
6756 for (i
= 0; i
< nparms
- variadic_p
; ++i
)
6758 if (TREE_VEC_ELT (parm_parms
, i
) == error_mark_node
6759 || TREE_VEC_ELT (arg_parms
, i
) == error_mark_node
)
6762 parm
= TREE_VALUE (TREE_VEC_ELT (parm_parms
, i
));
6763 arg
= TREE_VALUE (TREE_VEC_ELT (arg_parms
, i
));
6765 if (!coerce_template_template_parm (parm
, arg
, complain
, in_decl
,
6773 /* Check each of the template parameters in the template
6774 argument against the template parameter pack at the end of
6775 the template template parameter. */
6776 if (TREE_VEC_ELT (parm_parms
, i
) == error_mark_node
)
6779 parm
= TREE_VALUE (TREE_VEC_ELT (parm_parms
, i
));
6781 for (; i
< nargs
; ++i
)
6783 if (TREE_VEC_ELT (arg_parms
, i
) == error_mark_node
)
6786 arg
= TREE_VALUE (TREE_VEC_ELT (arg_parms
, i
));
6788 if (!coerce_template_template_parm (parm
, arg
, complain
, in_decl
,
6797 /* Verifies that the deduced template arguments (in TARGS) for the
6798 template template parameters (in TPARMS) represent valid bindings,
6799 by comparing the template parameter list of each template argument
6800 to the template parameter list of its corresponding template
6801 template parameter, in accordance with DR150. This
6802 routine can only be called after all template arguments have been
6803 deduced. It will return TRUE if all of the template template
6804 parameter bindings are okay, FALSE otherwise. */
6806 template_template_parm_bindings_ok_p (tree tparms
, tree targs
)
6808 int i
, ntparms
= TREE_VEC_LENGTH (tparms
);
6811 /* We're dealing with template parms in this process. */
6812 ++processing_template_decl
;
6814 targs
= INNERMOST_TEMPLATE_ARGS (targs
);
6816 for (i
= 0; i
< ntparms
; ++i
)
6818 tree tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, i
));
6819 tree targ
= TREE_VEC_ELT (targs
, i
);
6821 if (TREE_CODE (tparm
) == TEMPLATE_DECL
&& targ
)
6823 tree packed_args
= NULL_TREE
;
6826 if (ARGUMENT_PACK_P (targ
))
6828 /* Look inside the argument pack. */
6829 packed_args
= ARGUMENT_PACK_ARGS (targ
);
6830 len
= TREE_VEC_LENGTH (packed_args
);
6833 for (idx
= 0; idx
< len
; ++idx
)
6835 tree targ_parms
= NULL_TREE
;
6838 /* Extract the next argument from the argument
6840 targ
= TREE_VEC_ELT (packed_args
, idx
);
6842 if (PACK_EXPANSION_P (targ
))
6843 /* Look at the pattern of the pack expansion. */
6844 targ
= PACK_EXPANSION_PATTERN (targ
);
6846 /* Extract the template parameters from the template
6848 if (TREE_CODE (targ
) == TEMPLATE_DECL
)
6849 targ_parms
= DECL_INNERMOST_TEMPLATE_PARMS (targ
);
6850 else if (TREE_CODE (targ
) == TEMPLATE_TEMPLATE_PARM
)
6851 targ_parms
= DECL_INNERMOST_TEMPLATE_PARMS (TYPE_NAME (targ
));
6853 /* Verify that we can coerce the template template
6854 parameters from the template argument to the template
6855 parameter. This requires an exact match. */
6857 && !coerce_template_template_parms
6858 (DECL_INNERMOST_TEMPLATE_PARMS (tparm
),
6873 --processing_template_decl
;
6877 /* Since type attributes aren't mangled, we need to strip them from
6878 template type arguments. */
6881 canonicalize_type_argument (tree arg
, tsubst_flags_t complain
)
6883 if (!arg
|| arg
== error_mark_node
|| arg
== TYPE_CANONICAL (arg
))
6885 bool removed_attributes
= false;
6886 tree canon
= strip_typedefs (arg
, &removed_attributes
);
6887 if (removed_attributes
6888 && (complain
& tf_warning
))
6889 warning (0, "ignoring attributes on template argument %qT", arg
);
6893 // A template declaration can be substituted for a constrained
6894 // template template parameter only when the argument is more
6895 // constrained than the parameter.
6897 is_compatible_template_arg (tree parm
, tree arg
)
6899 tree parm_cons
= get_constraints (parm
);
6901 /* For now, allow constrained template template arguments
6902 and unconstrained template template parameters. */
6903 if (parm_cons
== NULL_TREE
)
6906 tree arg_cons
= get_constraints (arg
);
6908 // If the template parameter is constrained, we need to rewrite its
6909 // constraints in terms of the ARG's template parameters. This ensures
6910 // that all of the template parameter types will have the same depth.
6912 // Note that this is only valid when coerce_template_template_parm is
6913 // true for the innermost template parameters of PARM and ARG. In other
6914 // words, because coercion is successful, this conversion will be valid.
6917 tree args
= template_parms_to_args (DECL_TEMPLATE_PARMS (arg
));
6918 parm_cons
= tsubst_constraint_info (parm_cons
,
6919 INNERMOST_TEMPLATE_ARGS (args
),
6920 tf_none
, NULL_TREE
);
6921 if (parm_cons
== error_mark_node
)
6925 return subsumes (parm_cons
, arg_cons
);
6928 // Convert a placeholder argument into a binding to the original
6929 // parameter. The original parameter is saved as the TREE_TYPE of
6932 convert_wildcard_argument (tree parm
, tree arg
)
6934 TREE_TYPE (arg
) = parm
;
6938 /* Convert the indicated template ARG as necessary to match the
6939 indicated template PARM. Returns the converted ARG, or
6940 error_mark_node if the conversion was unsuccessful. Error and
6941 warning messages are issued under control of COMPLAIN. This
6942 conversion is for the Ith parameter in the parameter list. ARGS is
6943 the full set of template arguments deduced so far. */
6946 convert_template_argument (tree parm
,
6949 tsubst_flags_t complain
,
6955 int is_type
, requires_type
, is_tmpl_type
, requires_tmpl_type
;
6957 if (parm
== error_mark_node
)
6958 return error_mark_node
;
6960 /* Trivially convert placeholders. */
6961 if (TREE_CODE (arg
) == WILDCARD_DECL
)
6962 return convert_wildcard_argument (parm
, arg
);
6964 if (TREE_CODE (arg
) == TREE_LIST
6965 && TREE_CODE (TREE_VALUE (arg
)) == OFFSET_REF
)
6967 /* The template argument was the name of some
6968 member function. That's usually
6969 invalid, but static members are OK. In any
6970 case, grab the underlying fields/functions
6971 and issue an error later if required. */
6972 orig_arg
= TREE_VALUE (arg
);
6973 TREE_TYPE (arg
) = unknown_type_node
;
6978 requires_tmpl_type
= TREE_CODE (parm
) == TEMPLATE_DECL
;
6979 requires_type
= (TREE_CODE (parm
) == TYPE_DECL
6980 || requires_tmpl_type
);
6982 /* When determining whether an argument pack expansion is a template,
6983 look at the pattern. */
6984 if (TREE_CODE (arg
) == TYPE_PACK_EXPANSION
)
6985 arg
= PACK_EXPANSION_PATTERN (arg
);
6987 /* Deal with an injected-class-name used as a template template arg. */
6988 if (requires_tmpl_type
&& CLASS_TYPE_P (arg
))
6990 tree t
= maybe_get_template_decl_from_type_decl (TYPE_NAME (arg
));
6991 if (TREE_CODE (t
) == TEMPLATE_DECL
)
6993 if (cxx_dialect
>= cxx11
)
6994 /* OK under DR 1004. */;
6995 else if (complain
& tf_warning_or_error
)
6996 pedwarn (input_location
, OPT_Wpedantic
, "injected-class-name %qD"
6997 " used as template template argument", TYPE_NAME (arg
));
6998 else if (flag_pedantic_errors
)
7006 ((TREE_CODE (arg
) == TEMPLATE_DECL
7007 && TREE_CODE (DECL_TEMPLATE_RESULT (arg
)) == TYPE_DECL
)
7008 || (requires_tmpl_type
&& TREE_CODE (arg
) == TYPE_ARGUMENT_PACK
)
7009 || TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
7010 || TREE_CODE (arg
) == UNBOUND_CLASS_TEMPLATE
);
7013 && (TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
7014 || TREE_CODE (arg
) == UNBOUND_CLASS_TEMPLATE
))
7015 arg
= TYPE_STUB_DECL (arg
);
7017 is_type
= TYPE_P (arg
) || is_tmpl_type
;
7019 if (requires_type
&& ! is_type
&& TREE_CODE (arg
) == SCOPE_REF
7020 && TREE_CODE (TREE_OPERAND (arg
, 0)) == TEMPLATE_TYPE_PARM
)
7022 if (TREE_CODE (TREE_OPERAND (arg
, 1)) == BIT_NOT_EXPR
)
7024 if (complain
& tf_error
)
7025 error ("invalid use of destructor %qE as a type", orig_arg
);
7026 return error_mark_node
;
7029 permerror (input_location
,
7030 "to refer to a type member of a template parameter, "
7031 "use %<typename %E%>", orig_arg
);
7033 orig_arg
= make_typename_type (TREE_OPERAND (arg
, 0),
7034 TREE_OPERAND (arg
, 1),
7040 if (is_type
!= requires_type
)
7044 if (complain
& tf_error
)
7046 error ("type/value mismatch at argument %d in template "
7047 "parameter list for %qD",
7050 inform (input_location
,
7051 " expected a constant of type %qT, got %qT",
7053 (DECL_P (arg
) ? DECL_NAME (arg
) : orig_arg
));
7054 else if (requires_tmpl_type
)
7055 inform (input_location
,
7056 " expected a class template, got %qE", orig_arg
);
7058 inform (input_location
,
7059 " expected a type, got %qE", orig_arg
);
7062 return error_mark_node
;
7064 if (is_tmpl_type
^ requires_tmpl_type
)
7066 if (in_decl
&& (complain
& tf_error
))
7068 error ("type/value mismatch at argument %d in template "
7069 "parameter list for %qD",
7072 inform (input_location
,
7073 " expected a type, got %qT", DECL_NAME (arg
));
7075 inform (input_location
,
7076 " expected a class template, got %qT", orig_arg
);
7078 return error_mark_node
;
7083 if (requires_tmpl_type
)
7085 if (template_parameter_pack_p (parm
) && ARGUMENT_PACK_P (orig_arg
))
7087 else if (TREE_CODE (TREE_TYPE (arg
)) == UNBOUND_CLASS_TEMPLATE
)
7088 /* The number of argument required is not known yet.
7089 Just accept it for now. */
7090 val
= TREE_TYPE (arg
);
7093 tree parmparm
= DECL_INNERMOST_TEMPLATE_PARMS (parm
);
7096 /* Strip alias templates that are equivalent to another
7098 arg
= get_underlying_template (arg
);
7099 argparm
= DECL_INNERMOST_TEMPLATE_PARMS (arg
);
7101 if (coerce_template_template_parms (parmparm
, argparm
,
7107 /* TEMPLATE_TEMPLATE_PARM node is preferred over
7109 if (val
!= error_mark_node
)
7111 if (DECL_TEMPLATE_TEMPLATE_PARM_P (val
))
7112 val
= TREE_TYPE (val
);
7113 if (TREE_CODE (orig_arg
) == TYPE_PACK_EXPANSION
)
7114 val
= make_pack_expansion (val
);
7119 if (in_decl
&& (complain
& tf_error
))
7121 error ("type/value mismatch at argument %d in "
7122 "template parameter list for %qD",
7124 inform (input_location
,
7125 " expected a template of type %qD, got %qT",
7129 val
= error_mark_node
;
7132 // Check that the constraints are compatible before allowing the
7134 if (val
!= error_mark_node
)
7135 if (!is_compatible_template_arg (parm
, arg
))
7137 if (in_decl
&& (complain
& tf_error
))
7139 error ("constraint mismatch at argument %d in "
7140 "template parameter list for %qD",
7142 inform (input_location
, " expected %qD but got %qD",
7145 val
= error_mark_node
;
7151 /* We only form one instance of each template specialization.
7152 Therefore, if we use a non-canonical variant (i.e., a
7153 typedef), any future messages referring to the type will use
7154 the typedef, which is confusing if those future uses do not
7155 themselves also use the typedef. */
7157 val
= canonicalize_type_argument (val
, complain
);
7161 tree t
= tsubst (TREE_TYPE (parm
), args
, complain
, in_decl
);
7163 if (invalid_nontype_parm_type_p (t
, complain
))
7164 return error_mark_node
;
7166 if (template_parameter_pack_p (parm
) && ARGUMENT_PACK_P (orig_arg
))
7168 if (same_type_p (t
, TREE_TYPE (orig_arg
)))
7172 /* Not sure if this is reachable, but it doesn't hurt
7174 error ("type mismatch in nontype parameter pack");
7175 val
= error_mark_node
;
7178 else if (!dependent_template_arg_p (orig_arg
)
7179 && !uses_template_parms (t
))
7180 /* We used to call digest_init here. However, digest_init
7181 will report errors, which we don't want when complain
7182 is zero. More importantly, digest_init will try too
7183 hard to convert things: for example, `0' should not be
7184 converted to pointer type at this point according to
7185 the standard. Accepting this is not merely an
7186 extension, since deciding whether or not these
7187 conversions can occur is part of determining which
7188 function template to call, or whether a given explicit
7189 argument specification is valid. */
7190 val
= convert_nontype_argument (t
, orig_arg
, complain
);
7193 bool removed_attr
= false;
7194 val
= strip_typedefs_expr (orig_arg
, &removed_attr
);
7197 if (val
== NULL_TREE
)
7198 val
= error_mark_node
;
7199 else if (val
== error_mark_node
&& (complain
& tf_error
))
7200 error ("could not convert template argument %qE to %qT", orig_arg
, t
);
7202 if (TREE_CODE (val
) == SCOPE_REF
)
7204 /* Strip typedefs from the SCOPE_REF. */
7205 tree type
= canonicalize_type_argument (TREE_TYPE (val
), complain
);
7206 tree scope
= canonicalize_type_argument (TREE_OPERAND (val
, 0),
7208 val
= build_qualified_name (type
, scope
, TREE_OPERAND (val
, 1),
7209 QUALIFIED_NAME_IS_TEMPLATE (val
));
7216 /* Coerces the remaining template arguments in INNER_ARGS (from
7217 ARG_IDX to the end) into the parameter pack at PARM_IDX in PARMS.
7218 Returns the coerced argument pack. PARM_IDX is the position of this
7219 parameter in the template parameter list. ARGS is the original
7220 template argument list. */
7222 coerce_template_parameter_pack (tree parms
,
7230 tsubst_flags_t complain
)
7232 tree parm
= TREE_VEC_ELT (parms
, parm_idx
);
7233 int nargs
= inner_args
? NUM_TMPL_ARGS (inner_args
) : 0;
7236 tree packed_parms
= NULL_TREE
;
7238 if (arg_idx
> nargs
)
7241 if (tree packs
= fixed_parameter_pack_p (TREE_VALUE (parm
)))
7243 /* When the template parameter is a non-type template parameter pack
7244 or template template parameter pack whose type or template
7245 parameters use parameter packs, we know exactly how many arguments
7246 we are looking for. Build a vector of the instantiated decls for
7247 these template parameters in PACKED_PARMS. */
7248 /* We can't use make_pack_expansion here because it would interpret a
7249 _DECL as a use rather than a declaration. */
7250 tree decl
= TREE_VALUE (parm
);
7251 tree exp
= cxx_make_type (TYPE_PACK_EXPANSION
);
7252 SET_PACK_EXPANSION_PATTERN (exp
, decl
);
7253 PACK_EXPANSION_PARAMETER_PACKS (exp
) = packs
;
7254 SET_TYPE_STRUCTURAL_EQUALITY (exp
);
7256 TREE_VEC_LENGTH (args
)--;
7257 packed_parms
= tsubst_pack_expansion (exp
, args
, complain
, decl
);
7258 TREE_VEC_LENGTH (args
)++;
7260 if (packed_parms
== error_mark_node
)
7261 return error_mark_node
;
7263 /* If we're doing a partial instantiation of a member template,
7264 verify that all of the types used for the non-type
7265 template parameter pack are, in fact, valid for non-type
7266 template parameters. */
7268 && PACK_EXPANSION_P (TREE_VEC_ELT (inner_args
, arg_idx
)))
7270 int j
, len
= TREE_VEC_LENGTH (packed_parms
);
7271 for (j
= 0; j
< len
; ++j
)
7273 tree t
= TREE_TYPE (TREE_VEC_ELT (packed_parms
, j
));
7274 if (invalid_nontype_parm_type_p (t
, complain
))
7275 return error_mark_node
;
7277 /* We don't know how many args we have yet, just
7278 use the unconverted ones for now. */
7282 packed_args
= make_tree_vec (TREE_VEC_LENGTH (packed_parms
));
7284 /* Check if we have a placeholder pack, which indicates we're
7285 in the context of a introduction list. In that case we want
7286 to match this pack to the single placeholder. */
7287 else if (arg_idx
< nargs
7288 && TREE_CODE (TREE_VEC_ELT (inner_args
, arg_idx
)) == WILDCARD_DECL
7289 && WILDCARD_PACK_P (TREE_VEC_ELT (inner_args
, arg_idx
)))
7291 nargs
= arg_idx
+ 1;
7292 packed_args
= make_tree_vec (1);
7295 packed_args
= make_tree_vec (nargs
- arg_idx
);
7297 /* Convert the remaining arguments, which will be a part of the
7298 parameter pack "parm". */
7299 for (; arg_idx
< nargs
; ++arg_idx
)
7301 tree arg
= TREE_VEC_ELT (inner_args
, arg_idx
);
7302 tree actual_parm
= TREE_VALUE (parm
);
7303 int pack_idx
= arg_idx
- parm_idx
;
7307 /* Once we've packed as many args as we have types, stop. */
7308 if (pack_idx
>= TREE_VEC_LENGTH (packed_parms
))
7310 else if (PACK_EXPANSION_P (arg
))
7311 /* We don't know how many args we have yet, just
7312 use the unconverted ones for now. */
7315 actual_parm
= TREE_VEC_ELT (packed_parms
, pack_idx
);
7318 if (arg
== error_mark_node
)
7320 if (complain
& tf_error
)
7321 error ("template argument %d is invalid", arg_idx
+ 1);
7324 arg
= convert_template_argument (actual_parm
,
7325 arg
, new_args
, complain
, parm_idx
,
7327 if (arg
== error_mark_node
)
7329 TREE_VEC_ELT (packed_args
, pack_idx
) = arg
;
7332 if (arg_idx
- parm_idx
< TREE_VEC_LENGTH (packed_args
)
7333 && TREE_VEC_LENGTH (packed_args
) > 0)
7335 if (complain
& tf_error
)
7336 error ("wrong number of template arguments (%d, should be %d)",
7337 arg_idx
- parm_idx
, TREE_VEC_LENGTH (packed_args
));
7338 return error_mark_node
;
7341 if (TREE_CODE (TREE_VALUE (parm
)) == TYPE_DECL
7342 || TREE_CODE (TREE_VALUE (parm
)) == TEMPLATE_DECL
)
7343 argument_pack
= cxx_make_type (TYPE_ARGUMENT_PACK
);
7346 argument_pack
= make_node (NONTYPE_ARGUMENT_PACK
);
7347 TREE_TYPE (argument_pack
)
7348 = tsubst (TREE_TYPE (TREE_VALUE (parm
)), new_args
, complain
, in_decl
);
7349 TREE_CONSTANT (argument_pack
) = 1;
7352 SET_ARGUMENT_PACK_ARGS (argument_pack
, packed_args
);
7353 #ifdef ENABLE_CHECKING
7354 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (packed_args
,
7355 TREE_VEC_LENGTH (packed_args
));
7357 return argument_pack
;
7360 /* Returns the number of pack expansions in the template argument vector
7364 pack_expansion_args_count (tree args
)
7369 for (i
= 0; i
< TREE_VEC_LENGTH (args
); ++i
)
7371 tree elt
= TREE_VEC_ELT (args
, i
);
7372 if (elt
&& PACK_EXPANSION_P (elt
))
7378 /* Convert all template arguments to their appropriate types, and
7379 return a vector containing the innermost resulting template
7380 arguments. If any error occurs, return error_mark_node. Error and
7381 warning messages are issued under control of COMPLAIN.
7383 If REQUIRE_ALL_ARGS is false, argument deduction will be performed
7384 for arguments not specified in ARGS. Otherwise, if
7385 USE_DEFAULT_ARGS is true, default arguments will be used to fill in
7386 unspecified arguments. If REQUIRE_ALL_ARGS is true, but
7387 USE_DEFAULT_ARGS is false, then all arguments must be specified in
7391 coerce_template_parms (tree parms
,
7394 tsubst_flags_t complain
,
7395 bool require_all_args
,
7396 bool use_default_args
)
7398 int nparms
, nargs
, parm_idx
, arg_idx
, lost
= 0;
7399 tree orig_inner_args
;
7402 tree new_inner_args
;
7403 int saved_unevaluated_operand
;
7404 int saved_inhibit_evaluation_warnings
;
7406 /* When used as a boolean value, indicates whether this is a
7407 variadic template parameter list. Since it's an int, we can also
7408 subtract it from nparms to get the number of non-variadic
7411 int variadic_args_p
= 0;
7412 int post_variadic_parms
= 0;
7414 /* Likewise for parameters with default arguments. */
7417 if (args
== error_mark_node
)
7418 return error_mark_node
;
7420 nparms
= TREE_VEC_LENGTH (parms
);
7422 /* Determine if there are any parameter packs or default arguments. */
7423 for (parm_idx
= 0; parm_idx
< nparms
; ++parm_idx
)
7425 tree parm
= TREE_VEC_ELT (parms
, parm_idx
);
7427 ++post_variadic_parms
;
7428 if (template_parameter_pack_p (TREE_VALUE (parm
)))
7430 if (TREE_PURPOSE (parm
))
7434 inner_args
= orig_inner_args
= INNERMOST_TEMPLATE_ARGS (args
);
7435 /* If there are no parameters that follow a parameter pack, we need to
7436 expand any argument packs so that we can deduce a parameter pack from
7437 some non-packed args followed by an argument pack, as in variadic85.C.
7438 If there are such parameters, we need to leave argument packs intact
7439 so the arguments are assigned properly. This can happen when dealing
7440 with a nested class inside a partial specialization of a class
7441 template, as in variadic92.C, or when deducing a template parameter pack
7442 from a sub-declarator, as in variadic114.C. */
7443 if (!post_variadic_parms
)
7444 inner_args
= expand_template_argument_pack (inner_args
);
7446 /* Count any pack expansion args. */
7447 variadic_args_p
= pack_expansion_args_count (inner_args
);
7449 nargs
= inner_args
? NUM_TMPL_ARGS (inner_args
) : 0;
7450 if ((nargs
> nparms
&& !variadic_p
)
7451 || (nargs
< nparms
- variadic_p
7454 && (!use_default_args
7455 || (TREE_VEC_ELT (parms
, nargs
) != error_mark_node
7456 && !TREE_PURPOSE (TREE_VEC_ELT (parms
, nargs
))))))
7458 if (complain
& tf_error
)
7460 if (variadic_p
|| default_p
)
7462 nparms
-= variadic_p
+ default_p
;
7463 error ("wrong number of template arguments "
7464 "(%d, should be at least %d)", nargs
, nparms
);
7467 error ("wrong number of template arguments "
7468 "(%d, should be %d)", nargs
, nparms
);
7471 inform (DECL_SOURCE_LOCATION (in_decl
),
7472 "provided for %qD", in_decl
);
7475 return error_mark_node
;
7477 /* We can't pass a pack expansion to a non-pack parameter of an alias
7478 template (DR 1430). */
7480 && (DECL_ALIAS_TEMPLATE_P (in_decl
)
7481 || concept_template_p (in_decl
))
7483 && nargs
- variadic_args_p
< nparms
- variadic_p
)
7485 if (complain
& tf_error
)
7487 for (int i
= 0; i
< TREE_VEC_LENGTH (inner_args
); ++i
)
7489 tree arg
= TREE_VEC_ELT (inner_args
, i
);
7490 tree parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
7492 if (PACK_EXPANSION_P (arg
)
7493 && !template_parameter_pack_p (parm
))
7495 if (DECL_ALIAS_TEMPLATE_P (in_decl
))
7496 error_at (location_of (arg
),
7497 "pack expansion argument for non-pack parameter "
7498 "%qD of alias template %qD", parm
, in_decl
);
7500 error_at (location_of (arg
),
7501 "pack expansion argument for non-pack parameter "
7502 "%qD of concept %qD", parm
, in_decl
);
7503 inform (DECL_SOURCE_LOCATION (parm
), "declared here");
7510 return error_mark_node
;
7513 /* We need to evaluate the template arguments, even though this
7514 template-id may be nested within a "sizeof". */
7515 saved_unevaluated_operand
= cp_unevaluated_operand
;
7516 cp_unevaluated_operand
= 0;
7517 saved_inhibit_evaluation_warnings
= c_inhibit_evaluation_warnings
;
7518 c_inhibit_evaluation_warnings
= 0;
7519 new_inner_args
= make_tree_vec (nparms
);
7520 new_args
= add_outermost_template_args (args
, new_inner_args
);
7521 int pack_adjust
= 0;
7522 for (parm_idx
= 0, arg_idx
= 0; parm_idx
< nparms
; parm_idx
++, arg_idx
++)
7527 /* Get the Ith template parameter. */
7528 parm
= TREE_VEC_ELT (parms
, parm_idx
);
7530 if (parm
== error_mark_node
)
7532 TREE_VEC_ELT (new_inner_args
, arg_idx
) = error_mark_node
;
7536 /* Calculate the next argument. */
7537 if (arg_idx
< nargs
)
7538 arg
= TREE_VEC_ELT (inner_args
, arg_idx
);
7542 if (template_parameter_pack_p (TREE_VALUE (parm
))
7543 && !(arg
&& ARGUMENT_PACK_P (arg
)))
7545 /* Some arguments will be placed in the
7546 template parameter pack PARM. */
7547 arg
= coerce_template_parameter_pack (parms
, parm_idx
, args
,
7548 inner_args
, arg_idx
,
7552 if (arg
== NULL_TREE
)
7554 /* We don't know how many args we have yet, just use the
7555 unconverted (and still packed) ones for now. */
7556 new_inner_args
= orig_inner_args
;
7561 TREE_VEC_ELT (new_inner_args
, parm_idx
) = arg
;
7563 /* Store this argument. */
7564 if (arg
== error_mark_node
)
7567 /* We are done with all of the arguments. */
7572 pack_adjust
= TREE_VEC_LENGTH (ARGUMENT_PACK_ARGS (arg
)) - 1;
7573 arg_idx
+= pack_adjust
;
7580 if (PACK_EXPANSION_P (arg
))
7582 /* "If every valid specialization of a variadic template
7583 requires an empty template parameter pack, the template is
7584 ill-formed, no diagnostic required." So check that the
7585 pattern works with this parameter. */
7586 tree pattern
= PACK_EXPANSION_PATTERN (arg
);
7587 tree conv
= convert_template_argument (TREE_VALUE (parm
),
7591 if (conv
== error_mark_node
)
7593 inform (input_location
, "so any instantiation with a "
7594 "non-empty parameter pack would be ill-formed");
7597 else if (TYPE_P (conv
) && !TYPE_P (pattern
))
7598 /* Recover from missing typename. */
7599 TREE_VEC_ELT (inner_args
, arg_idx
)
7600 = make_pack_expansion (conv
);
7602 /* We don't know how many args we have yet, just
7603 use the unconverted ones for now. */
7604 new_inner_args
= inner_args
;
7609 else if (require_all_args
)
7611 /* There must be a default arg in this case. */
7612 arg
= tsubst_template_arg (TREE_PURPOSE (parm
), new_args
,
7614 /* The position of the first default template argument,
7615 is also the number of non-defaulted arguments in NEW_INNER_ARGS.
7617 if (!NON_DEFAULT_TEMPLATE_ARGS_COUNT (new_inner_args
))
7618 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (new_inner_args
,
7619 arg_idx
- pack_adjust
);
7624 if (arg
== error_mark_node
)
7626 if (complain
& tf_error
)
7627 error ("template argument %d is invalid", arg_idx
+ 1);
7630 /* This only occurs if there was an error in the template
7631 parameter list itself (which we would already have
7632 reported) that we are trying to recover from, e.g., a class
7633 template with a parameter list such as
7634 template<typename..., typename>. */
7637 arg
= convert_template_argument (TREE_VALUE (parm
),
7638 arg
, new_args
, complain
,
7641 if (arg
== error_mark_node
)
7643 TREE_VEC_ELT (new_inner_args
, arg_idx
- pack_adjust
) = arg
;
7645 cp_unevaluated_operand
= saved_unevaluated_operand
;
7646 c_inhibit_evaluation_warnings
= saved_inhibit_evaluation_warnings
;
7648 if (variadic_p
&& arg_idx
< nargs
)
7650 if (complain
& tf_error
)
7652 error ("wrong number of template arguments "
7653 "(%d, should be %d)", nargs
, arg_idx
);
7655 error ("provided for %q+D", in_decl
);
7657 return error_mark_node
;
7661 return error_mark_node
;
7663 #ifdef ENABLE_CHECKING
7664 if (!NON_DEFAULT_TEMPLATE_ARGS_COUNT (new_inner_args
))
7665 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (new_inner_args
,
7666 TREE_VEC_LENGTH (new_inner_args
));
7669 return new_inner_args
;
7672 /* Convert all template arguments to their appropriate types, and
7673 return a vector containing the innermost resulting template
7674 arguments. If any error occurs, return error_mark_node. Error and
7675 warning messages are not issued.
7677 Note that no function argument deduction is performed, and default
7678 arguments are used to fill in unspecified arguments. */
7680 coerce_template_parms (tree parms
, tree args
, tree in_decl
)
7682 return coerce_template_parms (parms
, args
, in_decl
, tf_none
, true, true);
7685 /* Convert all template arguments to their appropriate type, and
7686 instantiate default arguments as needed. This returns a vector
7687 containing the innermost resulting template arguments, or
7688 error_mark_node if unsuccessful. */
7690 coerce_template_parms (tree parms
, tree args
, tree in_decl
,
7691 tsubst_flags_t complain
)
7693 return coerce_template_parms (parms
, args
, in_decl
, complain
, true, true);
7696 /* Like coerce_template_parms. If PARMS represents all template
7697 parameters levels, this function returns a vector of vectors
7698 representing all the resulting argument levels. Note that in this
7699 case, only the innermost arguments are coerced because the
7700 outermost ones are supposed to have been coerced already.
7702 Otherwise, if PARMS represents only (the innermost) vector of
7703 parameters, this function returns a vector containing just the
7704 innermost resulting arguments. */
7707 coerce_innermost_template_parms (tree parms
,
7710 tsubst_flags_t complain
,
7711 bool require_all_args
,
7712 bool use_default_args
)
7714 int parms_depth
= TMPL_PARMS_DEPTH (parms
);
7715 int args_depth
= TMPL_ARGS_DEPTH (args
);
7718 if (parms_depth
> 1)
7720 coerced_args
= make_tree_vec (parms_depth
);
7724 for (level
= parms
, cur_depth
= parms_depth
;
7725 parms_depth
> 0 && level
!= NULL_TREE
;
7726 level
= TREE_CHAIN (level
), --cur_depth
)
7729 if (cur_depth
== args_depth
)
7730 l
= coerce_template_parms (TREE_VALUE (level
),
7731 args
, in_decl
, complain
,
7735 l
= TMPL_ARGS_LEVEL (args
, cur_depth
);
7737 if (l
== error_mark_node
)
7738 return error_mark_node
;
7740 SET_TMPL_ARGS_LEVEL (coerced_args
, cur_depth
, l
);
7744 coerced_args
= coerce_template_parms (INNERMOST_TEMPLATE_PARMS (parms
),
7745 args
, in_decl
, complain
,
7748 return coerced_args
;
7751 /* Returns 1 if template args OT and NT are equivalent. */
7754 template_args_equal (tree ot
, tree nt
)
7758 if (nt
== NULL_TREE
|| ot
== NULL_TREE
)
7761 if (TREE_CODE (nt
) == TREE_VEC
)
7762 /* For member templates */
7763 return TREE_CODE (ot
) == TREE_VEC
&& comp_template_args (ot
, nt
);
7764 else if (PACK_EXPANSION_P (ot
))
7765 return (PACK_EXPANSION_P (nt
)
7766 && template_args_equal (PACK_EXPANSION_PATTERN (ot
),
7767 PACK_EXPANSION_PATTERN (nt
))
7768 && template_args_equal (PACK_EXPANSION_EXTRA_ARGS (ot
),
7769 PACK_EXPANSION_EXTRA_ARGS (nt
)));
7770 else if (ARGUMENT_PACK_P (ot
))
7775 if (!ARGUMENT_PACK_P (nt
))
7778 opack
= ARGUMENT_PACK_ARGS (ot
);
7779 npack
= ARGUMENT_PACK_ARGS (nt
);
7780 len
= TREE_VEC_LENGTH (opack
);
7781 if (TREE_VEC_LENGTH (npack
) != len
)
7783 for (i
= 0; i
< len
; ++i
)
7784 if (!template_args_equal (TREE_VEC_ELT (opack
, i
),
7785 TREE_VEC_ELT (npack
, i
)))
7789 else if (ot
&& TREE_CODE (ot
) == ARGUMENT_PACK_SELECT
)
7791 /* We get here probably because we are in the middle of substituting
7792 into the pattern of a pack expansion. In that case the
7793 ARGUMENT_PACK_SELECT temporarily replaces the pack argument we are
7794 interested in. So we want to use the initial pack argument for
7796 ot
= ARGUMENT_PACK_SELECT_FROM_PACK (ot
);
7797 if (nt
&& TREE_CODE (nt
) == ARGUMENT_PACK_SELECT
)
7798 nt
= ARGUMENT_PACK_SELECT_FROM_PACK (nt
);
7799 return template_args_equal (ot
, nt
);
7801 else if (TYPE_P (nt
))
7805 /* Don't treat an alias template specialization with dependent
7806 arguments as equivalent to its underlying type when used as a
7807 template argument; we need them to be distinct so that we
7808 substitute into the specialization arguments at instantiation
7809 time. And aliases can't be equivalent without being ==, so
7810 we don't need to look any deeper. */
7811 if (TYPE_ALIAS_P (nt
) || TYPE_ALIAS_P (ot
))
7814 return same_type_p (ot
, nt
);
7816 else if (TREE_CODE (ot
) == TREE_VEC
|| TYPE_P (ot
))
7820 /* Try to treat a template non-type argument that has been converted
7821 to the parameter type as equivalent to one that hasn't yet. */
7822 for (enum tree_code code1
= TREE_CODE (ot
);
7823 CONVERT_EXPR_CODE_P (code1
)
7824 || code1
== NON_LVALUE_EXPR
;
7825 code1
= TREE_CODE (ot
))
7826 ot
= TREE_OPERAND (ot
, 0);
7827 for (enum tree_code code2
= TREE_CODE (nt
);
7828 CONVERT_EXPR_CODE_P (code2
)
7829 || code2
== NON_LVALUE_EXPR
;
7830 code2
= TREE_CODE (nt
))
7831 nt
= TREE_OPERAND (nt
, 0);
7833 return cp_tree_equal (ot
, nt
);
7837 /* Returns 1 iff the OLDARGS and NEWARGS are in fact identical sets of
7838 template arguments. Returns 0 otherwise, and updates OLDARG_PTR and
7839 NEWARG_PTR with the offending arguments if they are non-NULL. */
7842 comp_template_args_with_info (tree oldargs
, tree newargs
,
7843 tree
*oldarg_ptr
, tree
*newarg_ptr
)
7847 if (oldargs
== newargs
)
7850 if (!oldargs
|| !newargs
)
7853 if (TREE_VEC_LENGTH (oldargs
) != TREE_VEC_LENGTH (newargs
))
7856 for (i
= 0; i
< TREE_VEC_LENGTH (oldargs
); ++i
)
7858 tree nt
= TREE_VEC_ELT (newargs
, i
);
7859 tree ot
= TREE_VEC_ELT (oldargs
, i
);
7861 if (! template_args_equal (ot
, nt
))
7863 if (oldarg_ptr
!= NULL
)
7865 if (newarg_ptr
!= NULL
)
7873 /* Returns 1 iff the OLDARGS and NEWARGS are in fact identical sets
7874 of template arguments. Returns 0 otherwise. */
7877 comp_template_args (tree oldargs
, tree newargs
)
7879 return comp_template_args_with_info (oldargs
, newargs
, NULL
, NULL
);
7883 add_pending_template (tree d
)
7885 tree ti
= (TYPE_P (d
)
7886 ? CLASSTYPE_TEMPLATE_INFO (d
)
7887 : DECL_TEMPLATE_INFO (d
));
7888 struct pending_template
*pt
;
7891 if (TI_PENDING_TEMPLATE_FLAG (ti
))
7894 /* We are called both from instantiate_decl, where we've already had a
7895 tinst_level pushed, and instantiate_template, where we haven't.
7897 level
= !current_tinst_level
|| current_tinst_level
->decl
!= d
;
7900 push_tinst_level (d
);
7902 pt
= ggc_alloc
<pending_template
> ();
7904 pt
->tinst
= current_tinst_level
;
7905 if (last_pending_template
)
7906 last_pending_template
->next
= pt
;
7908 pending_templates
= pt
;
7910 last_pending_template
= pt
;
7912 TI_PENDING_TEMPLATE_FLAG (ti
) = 1;
7919 /* Return a TEMPLATE_ID_EXPR corresponding to the indicated FNS and
7920 ARGLIST. Valid choices for FNS are given in the cp-tree.def
7921 documentation for TEMPLATE_ID_EXPR. */
7924 lookup_template_function (tree fns
, tree arglist
)
7928 if (fns
== error_mark_node
|| arglist
== error_mark_node
)
7929 return error_mark_node
;
7931 gcc_assert (!arglist
|| TREE_CODE (arglist
) == TREE_VEC
);
7933 if (!is_overloaded_fn (fns
) && !identifier_p (fns
))
7935 error ("%q#D is not a function template", fns
);
7936 return error_mark_node
;
7939 if (BASELINK_P (fns
))
7941 BASELINK_FUNCTIONS (fns
) = build2 (TEMPLATE_ID_EXPR
,
7943 BASELINK_FUNCTIONS (fns
),
7948 type
= TREE_TYPE (fns
);
7949 if (TREE_CODE (fns
) == OVERLOAD
|| !type
)
7950 type
= unknown_type_node
;
7952 return build2 (TEMPLATE_ID_EXPR
, type
, fns
, arglist
);
7955 /* Within the scope of a template class S<T>, the name S gets bound
7956 (in build_self_reference) to a TYPE_DECL for the class, not a
7957 TEMPLATE_DECL. If DECL is a TYPE_DECL for current_class_type,
7958 or one of its enclosing classes, and that type is a template,
7959 return the associated TEMPLATE_DECL. Otherwise, the original
7962 Also handle the case when DECL is a TREE_LIST of ambiguous
7963 injected-class-names from different bases. */
7966 maybe_get_template_decl_from_type_decl (tree decl
)
7968 if (decl
== NULL_TREE
)
7971 /* DR 176: A lookup that finds an injected-class-name (10.2
7972 [class.member.lookup]) can result in an ambiguity in certain cases
7973 (for example, if it is found in more than one base class). If all of
7974 the injected-class-names that are found refer to specializations of
7975 the same class template, and if the name is followed by a
7976 template-argument-list, the reference refers to the class template
7977 itself and not a specialization thereof, and is not ambiguous. */
7978 if (TREE_CODE (decl
) == TREE_LIST
)
7980 tree t
, tmpl
= NULL_TREE
;
7981 for (t
= decl
; t
; t
= TREE_CHAIN (t
))
7983 tree elt
= maybe_get_template_decl_from_type_decl (TREE_VALUE (t
));
7986 else if (tmpl
!= elt
)
7989 if (tmpl
&& t
== NULL_TREE
)
7995 return (decl
!= NULL_TREE
7996 && DECL_SELF_REFERENCE_P (decl
)
7997 && CLASSTYPE_TEMPLATE_INFO (TREE_TYPE (decl
)))
7998 ? CLASSTYPE_TI_TEMPLATE (TREE_TYPE (decl
)) : decl
;
8001 /* Given an IDENTIFIER_NODE (or type TEMPLATE_DECL) and a chain of
8002 parameters, find the desired type.
8004 D1 is the PTYPENAME terminal, and ARGLIST is the list of arguments.
8006 IN_DECL, if non-NULL, is the template declaration we are trying to
8009 If ENTERING_SCOPE is nonzero, we are about to enter the scope of
8010 the class we are looking up.
8012 Issue error and warning messages under control of COMPLAIN.
8014 If the template class is really a local class in a template
8015 function, then the FUNCTION_CONTEXT is the function in which it is
8018 ??? Note that this function is currently called *twice* for each
8019 template-id: the first time from the parser, while creating the
8020 incomplete type (finish_template_type), and the second type during the
8021 real instantiation (instantiate_template_class). This is surely something
8022 that we want to avoid. It also causes some problems with argument
8023 coercion (see convert_nontype_argument for more information on this). */
8026 lookup_template_class_1 (tree d1
, tree arglist
, tree in_decl
, tree context
,
8027 int entering_scope
, tsubst_flags_t complain
)
8029 tree templ
= NULL_TREE
, parmlist
;
8036 if (identifier_p (d1
))
8038 tree value
= innermost_non_namespace_value (d1
);
8039 if (value
&& DECL_TEMPLATE_TEMPLATE_PARM_P (value
))
8044 push_decl_namespace (context
);
8045 templ
= lookup_name (d1
);
8046 templ
= maybe_get_template_decl_from_type_decl (templ
);
8048 pop_decl_namespace ();
8051 context
= DECL_CONTEXT (templ
);
8053 else if (TREE_CODE (d1
) == TYPE_DECL
&& MAYBE_CLASS_TYPE_P (TREE_TYPE (d1
)))
8055 tree type
= TREE_TYPE (d1
);
8057 /* If we are declaring a constructor, say A<T>::A<T>, we will get
8058 an implicit typename for the second A. Deal with it. */
8059 if (TREE_CODE (type
) == TYPENAME_TYPE
&& TREE_TYPE (type
))
8060 type
= TREE_TYPE (type
);
8062 if (CLASSTYPE_TEMPLATE_INFO (type
))
8064 templ
= CLASSTYPE_TI_TEMPLATE (type
);
8065 d1
= DECL_NAME (templ
);
8068 else if (TREE_CODE (d1
) == ENUMERAL_TYPE
8069 || (TYPE_P (d1
) && MAYBE_CLASS_TYPE_P (d1
)))
8071 templ
= TYPE_TI_TEMPLATE (d1
);
8072 d1
= DECL_NAME (templ
);
8074 else if (DECL_TYPE_TEMPLATE_P (d1
))
8077 d1
= DECL_NAME (templ
);
8078 context
= DECL_CONTEXT (templ
);
8080 else if (DECL_TEMPLATE_TEMPLATE_PARM_P (d1
))
8083 d1
= DECL_NAME (templ
);
8086 /* Issue an error message if we didn't find a template. */
8089 if (complain
& tf_error
)
8090 error ("%qT is not a template", d1
);
8091 return error_mark_node
;
8094 if (TREE_CODE (templ
) != TEMPLATE_DECL
8095 /* Make sure it's a user visible template, if it was named by
8097 || ((complain
& tf_user
) && !DECL_TEMPLATE_PARM_P (templ
)
8098 && !PRIMARY_TEMPLATE_P (templ
)))
8100 if (complain
& tf_error
)
8102 error ("non-template type %qT used as a template", d1
);
8104 error ("for template declaration %q+D", in_decl
);
8106 return error_mark_node
;
8109 complain
&= ~tf_user
;
8111 /* An alias that just changes the name of a template is equivalent to the
8112 other template, so if any of the arguments are pack expansions, strip
8113 the alias to avoid problems with a pack expansion passed to a non-pack
8114 alias template parameter (DR 1430). */
8115 if (pack_expansion_args_count (INNERMOST_TEMPLATE_ARGS (arglist
)))
8116 templ
= get_underlying_template (templ
);
8118 if (DECL_TEMPLATE_TEMPLATE_PARM_P (templ
))
8120 /* Create a new TEMPLATE_DECL and TEMPLATE_TEMPLATE_PARM node to store
8121 template arguments */
8127 parmlist
= DECL_INNERMOST_TEMPLATE_PARMS (templ
);
8129 /* Consider an example where a template template parameter declared as
8131 template <class T, class U = std::allocator<T> > class TT
8133 The template parameter level of T and U are one level larger than
8134 of TT. To proper process the default argument of U, say when an
8135 instantiation `TT<int>' is seen, we need to build the full
8136 arguments containing {int} as the innermost level. Outer levels,
8137 available when not appearing as default template argument, can be
8138 obtained from the arguments of the enclosing template.
8140 Suppose that TT is later substituted with std::vector. The above
8141 instantiation is `TT<int, std::allocator<T> >' with TT at
8142 level 1, and T at level 2, while the template arguments at level 1
8143 becomes {std::vector} and the inner level 2 is {int}. */
8145 outer
= DECL_CONTEXT (templ
);
8147 outer
= TI_ARGS (get_template_info (DECL_TEMPLATE_RESULT (outer
)));
8148 else if (current_template_parms
)
8150 /* This is an argument of the current template, so we haven't set
8151 DECL_CONTEXT yet. */
8152 tree relevant_template_parms
;
8154 /* Parameter levels that are greater than the level of the given
8155 template template parm are irrelevant. */
8156 relevant_template_parms
= current_template_parms
;
8157 while (TMPL_PARMS_DEPTH (relevant_template_parms
)
8158 != TEMPLATE_TYPE_LEVEL (TREE_TYPE (templ
)))
8159 relevant_template_parms
= TREE_CHAIN (relevant_template_parms
);
8161 outer
= template_parms_to_args (relevant_template_parms
);
8165 arglist
= add_to_template_args (outer
, arglist
);
8167 arglist2
= coerce_template_parms (parmlist
, arglist
, templ
,
8169 /*require_all_args=*/true,
8170 /*use_default_args=*/true);
8171 if (arglist2
== error_mark_node
8172 || (!uses_template_parms (arglist2
)
8173 && check_instantiated_args (templ
, arglist2
, complain
)))
8174 return error_mark_node
;
8176 parm
= bind_template_template_parm (TREE_TYPE (templ
), arglist2
);
8181 tree template_type
= TREE_TYPE (templ
);
8184 tree found
= NULL_TREE
;
8187 int is_dependent_type
;
8188 int use_partial_inst_tmpl
= false;
8190 if (template_type
== error_mark_node
)
8191 /* An error occurred while building the template TEMPL, and a
8192 diagnostic has most certainly been emitted for that
8193 already. Let's propagate that error. */
8194 return error_mark_node
;
8196 gen_tmpl
= most_general_template (templ
);
8197 parmlist
= DECL_TEMPLATE_PARMS (gen_tmpl
);
8198 parm_depth
= TMPL_PARMS_DEPTH (parmlist
);
8199 arg_depth
= TMPL_ARGS_DEPTH (arglist
);
8201 if (arg_depth
== 1 && parm_depth
> 1)
8203 /* We've been given an incomplete set of template arguments.
8206 template <class T> struct S1 {
8207 template <class U> struct S2 {};
8208 template <class U> struct S2<U*> {};
8211 we will be called with an ARGLIST of `U*', but the
8212 TEMPLATE will be `template <class T> template
8213 <class U> struct S1<T>::S2'. We must fill in the missing
8216 = add_outermost_template_args (TYPE_TI_ARGS (TREE_TYPE (templ
)),
8218 arg_depth
= TMPL_ARGS_DEPTH (arglist
);
8221 /* Now we should have enough arguments. */
8222 gcc_assert (parm_depth
== arg_depth
);
8224 /* From here on, we're only interested in the most general
8227 /* Calculate the BOUND_ARGS. These will be the args that are
8228 actually tsubst'd into the definition to create the
8230 arglist
= coerce_innermost_template_parms (parmlist
, arglist
, gen_tmpl
,
8232 /*require_all_args=*/true,
8233 /*use_default_args=*/true);
8235 if (arglist
== error_mark_node
)
8236 /* We were unable to bind the arguments. */
8237 return error_mark_node
;
8239 /* In the scope of a template class, explicit references to the
8240 template class refer to the type of the template, not any
8241 instantiation of it. For example, in:
8243 template <class T> class C { void f(C<T>); }
8245 the `C<T>' is just the same as `C'. Outside of the
8246 class, however, such a reference is an instantiation. */
8248 || !PRIMARY_TEMPLATE_P (gen_tmpl
)
8249 || currently_open_class (template_type
))
8250 /* comp_template_args is expensive, check it last. */
8251 && comp_template_args (TYPE_TI_ARGS (template_type
),
8253 return template_type
;
8255 /* If we already have this specialization, return it. */
8256 elt
.tmpl
= gen_tmpl
;
8258 elt
.spec
= NULL_TREE
;
8259 hash
= spec_hasher::hash (&elt
);
8260 entry
= type_specializations
->find_with_hash (&elt
, hash
);
8265 /* If the the template's constraints are not satisfied,
8266 then we cannot form a valid type.
8268 Note that the check is deferred until after the hash
8269 lookup. This prevents redundant checks on previously
8270 instantiated specializations. */
8271 if (flag_concepts
&& !constraints_satisfied_p (gen_tmpl
, arglist
))
8273 if (complain
& tf_error
)
8275 error ("template constraint failure");
8276 diagnose_constraints (input_location
, gen_tmpl
, arglist
);
8278 return error_mark_node
;
8281 is_dependent_type
= uses_template_parms (arglist
);
8283 /* If the deduced arguments are invalid, then the binding
8285 if (!is_dependent_type
8286 && check_instantiated_args (gen_tmpl
,
8287 INNERMOST_TEMPLATE_ARGS (arglist
),
8289 return error_mark_node
;
8291 if (!is_dependent_type
8292 && !PRIMARY_TEMPLATE_P (gen_tmpl
)
8293 && !LAMBDA_TYPE_P (TREE_TYPE (gen_tmpl
))
8294 && TREE_CODE (CP_DECL_CONTEXT (gen_tmpl
)) == NAMESPACE_DECL
)
8296 found
= xref_tag_from_type (TREE_TYPE (gen_tmpl
),
8297 DECL_NAME (gen_tmpl
),
8298 /*tag_scope=*/ts_global
);
8302 context
= tsubst (DECL_CONTEXT (gen_tmpl
), arglist
,
8304 if (context
== error_mark_node
)
8305 return error_mark_node
;
8308 context
= global_namespace
;
8310 /* Create the type. */
8311 if (DECL_ALIAS_TEMPLATE_P (gen_tmpl
))
8313 /* The user referred to a specialization of an alias
8314 template represented by GEN_TMPL.
8316 [temp.alias]/2 says:
8318 When a template-id refers to the specialization of an
8319 alias template, it is equivalent to the associated
8320 type obtained by substitution of its
8321 template-arguments for the template-parameters in the
8322 type-id of the alias template. */
8324 t
= tsubst (TREE_TYPE (gen_tmpl
), arglist
, complain
, in_decl
);
8325 /* Note that the call above (by indirectly calling
8326 register_specialization in tsubst_decl) registers the
8327 TYPE_DECL representing the specialization of the alias
8328 template. So next time someone substitutes ARGLIST for
8329 the template parms into the alias template (GEN_TMPL),
8330 she'll get that TYPE_DECL back. */
8332 if (t
== error_mark_node
)
8335 else if (TREE_CODE (template_type
) == ENUMERAL_TYPE
)
8337 if (!is_dependent_type
)
8339 set_current_access_from_decl (TYPE_NAME (template_type
));
8340 t
= start_enum (TYPE_IDENTIFIER (template_type
), NULL_TREE
,
8341 tsubst (ENUM_UNDERLYING_TYPE (template_type
),
8342 arglist
, complain
, in_decl
),
8343 SCOPED_ENUM_P (template_type
), NULL
);
8345 if (t
== error_mark_node
)
8350 /* We don't want to call start_enum for this type, since
8351 the values for the enumeration constants may involve
8352 template parameters. And, no one should be interested
8353 in the enumeration constants for such a type. */
8354 t
= cxx_make_type (ENUMERAL_TYPE
);
8355 SET_SCOPED_ENUM_P (t
, SCOPED_ENUM_P (template_type
));
8357 SET_OPAQUE_ENUM_P (t
, OPAQUE_ENUM_P (template_type
));
8358 ENUM_FIXED_UNDERLYING_TYPE_P (t
)
8359 = ENUM_FIXED_UNDERLYING_TYPE_P (template_type
);
8361 else if (CLASS_TYPE_P (template_type
))
8363 t
= make_class_type (TREE_CODE (template_type
));
8364 CLASSTYPE_DECLARED_CLASS (t
)
8365 = CLASSTYPE_DECLARED_CLASS (template_type
);
8366 SET_CLASSTYPE_IMPLICIT_INSTANTIATION (t
);
8367 TYPE_FOR_JAVA (t
) = TYPE_FOR_JAVA (template_type
);
8369 /* A local class. Make sure the decl gets registered properly. */
8370 if (context
== current_function_decl
)
8371 pushtag (DECL_NAME (gen_tmpl
), t
, /*tag_scope=*/ts_current
);
8373 if (comp_template_args (CLASSTYPE_TI_ARGS (template_type
), arglist
))
8374 /* This instantiation is another name for the primary
8375 template type. Set the TYPE_CANONICAL field
8377 TYPE_CANONICAL (t
) = template_type
;
8378 else if (any_template_arguments_need_structural_equality_p (arglist
))
8379 /* Some of the template arguments require structural
8380 equality testing, so this template class requires
8381 structural equality testing. */
8382 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8387 /* If we called start_enum or pushtag above, this information
8388 will already be set up. */
8391 TYPE_CONTEXT (t
) = FROB_CONTEXT (context
);
8393 type_decl
= create_implicit_typedef (DECL_NAME (gen_tmpl
), t
);
8394 DECL_CONTEXT (type_decl
) = TYPE_CONTEXT (t
);
8395 DECL_SOURCE_LOCATION (type_decl
)
8396 = DECL_SOURCE_LOCATION (TYPE_STUB_DECL (template_type
));
8399 type_decl
= TYPE_NAME (t
);
8401 if (CLASS_TYPE_P (template_type
))
8403 TREE_PRIVATE (type_decl
)
8404 = TREE_PRIVATE (TYPE_MAIN_DECL (template_type
));
8405 TREE_PROTECTED (type_decl
)
8406 = TREE_PROTECTED (TYPE_MAIN_DECL (template_type
));
8407 if (CLASSTYPE_VISIBILITY_SPECIFIED (template_type
))
8409 DECL_VISIBILITY_SPECIFIED (type_decl
) = 1;
8410 DECL_VISIBILITY (type_decl
) = CLASSTYPE_VISIBILITY (template_type
);
8414 if (OVERLOAD_TYPE_P (t
)
8415 && !DECL_ALIAS_TEMPLATE_P (gen_tmpl
))
8417 static const char *tags
[] = {"abi_tag", "may_alias"};
8419 for (unsigned ix
= 0; ix
!= 2; ix
++)
8422 = lookup_attribute (tags
[ix
], TYPE_ATTRIBUTES (template_type
));
8426 else if (!TREE_CHAIN (attributes
) && !TYPE_ATTRIBUTES (t
))
8427 TYPE_ATTRIBUTES (t
) = attributes
;
8430 = tree_cons (TREE_PURPOSE (attributes
),
8431 TREE_VALUE (attributes
),
8432 TYPE_ATTRIBUTES (t
));
8436 /* Let's consider the explicit specialization of a member
8437 of a class template specialization that is implicitly instantiated,
8442 template<class U> struct M {}; //#0
8447 struct S<int>::M<char> //#1
8451 [temp.expl.spec]/4 says this is valid.
8453 In this case, when we write:
8456 M is instantiated from the CLASSTYPE_TI_TEMPLATE of #1, not from
8459 When we encounter #1, we want to store the partial instantiation
8460 of M (template<class T> S<int>::M<T>) in its CLASSTYPE_TI_TEMPLATE.
8462 For all cases other than this "explicit specialization of member of a
8463 class template", we just want to store the most general template into
8464 the CLASSTYPE_TI_TEMPLATE of M.
8466 This case of "explicit specialization of member of a class template"
8468 1/ the enclosing class is an instantiation of, and therefore not
8469 the same as, the context of the most general template, and
8470 2/ we aren't looking at the partial instantiation itself, i.e.
8471 the innermost arguments are not the same as the innermost parms of
8472 the most general template.
8474 So it's only when 1/ and 2/ happens that we want to use the partial
8475 instantiation of the member template in lieu of its most general
8478 if (PRIMARY_TEMPLATE_P (gen_tmpl
)
8479 && TMPL_ARGS_HAVE_MULTIPLE_LEVELS (arglist
)
8480 /* the enclosing class must be an instantiation... */
8481 && CLASS_TYPE_P (context
)
8482 && !same_type_p (context
, DECL_CONTEXT (gen_tmpl
)))
8484 tree partial_inst_args
;
8485 TREE_VEC_LENGTH (arglist
)--;
8486 ++processing_template_decl
;
8488 tsubst (INNERMOST_TEMPLATE_ARGS
8489 (TYPE_TI_ARGS (TREE_TYPE (gen_tmpl
))),
8490 arglist
, complain
, NULL_TREE
);
8491 --processing_template_decl
;
8492 TREE_VEC_LENGTH (arglist
)++;
8493 use_partial_inst_tmpl
=
8494 /*...and we must not be looking at the partial instantiation
8496 !comp_template_args (INNERMOST_TEMPLATE_ARGS (arglist
),
8500 if (!use_partial_inst_tmpl
)
8501 /* This case is easy; there are no member templates involved. */
8505 /* This is a full instantiation of a member template. Find
8506 the partial instantiation of which this is an instance. */
8508 /* Temporarily reduce by one the number of levels in the ARGLIST
8509 so as to avoid comparing the last set of arguments. */
8510 TREE_VEC_LENGTH (arglist
)--;
8511 found
= tsubst (gen_tmpl
, arglist
, complain
, NULL_TREE
);
8512 TREE_VEC_LENGTH (arglist
)++;
8513 /* FOUND is either a proper class type, or an alias
8514 template specialization. In the later case, it's a
8515 TYPE_DECL, resulting from the substituting of arguments
8516 for parameters in the TYPE_DECL of the alias template
8517 done earlier. So be careful while getting the template
8519 found
= TREE_CODE (found
) == TYPE_DECL
8520 ? TYPE_TI_TEMPLATE (TREE_TYPE (found
))
8521 : CLASSTYPE_TI_TEMPLATE (found
);
8524 // Build template info for the new specialization.
8525 SET_TYPE_TEMPLATE_INFO (t
, build_template_info (found
, arglist
));
8528 slot
= type_specializations
->find_slot_with_hash (&elt
, hash
, INSERT
);
8529 entry
= ggc_alloc
<spec_entry
> ();
8533 /* Note this use of the partial instantiation so we can check it
8534 later in maybe_process_partial_specialization. */
8535 DECL_TEMPLATE_INSTANTIATIONS (found
)
8536 = tree_cons (arglist
, t
,
8537 DECL_TEMPLATE_INSTANTIATIONS (found
));
8539 if (TREE_CODE (template_type
) == ENUMERAL_TYPE
&& !is_dependent_type
8540 && !DECL_ALIAS_TEMPLATE_P (gen_tmpl
))
8541 /* Now that the type has been registered on the instantiations
8542 list, we set up the enumerators. Because the enumeration
8543 constants may involve the enumeration type itself, we make
8544 sure to register the type first, and then create the
8545 constants. That way, doing tsubst_expr for the enumeration
8546 constants won't result in recursive calls here; we'll find
8547 the instantiation and exit above. */
8548 tsubst_enum (template_type
, t
, arglist
);
8550 if (CLASS_TYPE_P (template_type
) && is_dependent_type
)
8551 /* If the type makes use of template parameters, the
8552 code that generates debugging information will crash. */
8553 DECL_IGNORED_P (TYPE_MAIN_DECL (t
)) = 1;
8555 /* Possibly limit visibility based on template args. */
8556 TREE_PUBLIC (type_decl
) = 1;
8557 determine_visibility (type_decl
);
8559 inherit_targ_abi_tags (t
);
8565 /* Wrapper for lookup_template_class_1. */
8568 lookup_template_class (tree d1
, tree arglist
, tree in_decl
, tree context
,
8569 int entering_scope
, tsubst_flags_t complain
)
8572 timevar_push (TV_TEMPLATE_INST
);
8573 ret
= lookup_template_class_1 (d1
, arglist
, in_decl
, context
,
8574 entering_scope
, complain
);
8575 timevar_pop (TV_TEMPLATE_INST
);
8579 /* Return a TEMPLATE_ID_EXPR for the given variable template and ARGLIST. */
8582 lookup_template_variable (tree templ
, tree arglist
)
8584 /* The type of the expression is NULL_TREE since the template-id could refer
8585 to an explicit or partial specialization. */
8586 tree type
= NULL_TREE
;
8587 if (flag_concepts
&& variable_concept_p (templ
))
8588 /* Except that concepts are always bool. */
8589 type
= boolean_type_node
;
8590 return build2 (TEMPLATE_ID_EXPR
, type
, templ
, arglist
);
8593 /* Instantiate a variable declaration from a TEMPLATE_ID_EXPR for use. */
8596 finish_template_variable (tree var
, tsubst_flags_t complain
)
8598 tree templ
= TREE_OPERAND (var
, 0);
8599 tree arglist
= TREE_OPERAND (var
, 1);
8601 /* We never want to return a VAR_DECL for a variable concept, since they
8602 aren't instantiated. In a template, leave the TEMPLATE_ID_EXPR alone. */
8603 bool concept_p
= flag_concepts
&& variable_concept_p (templ
);
8604 if (concept_p
&& processing_template_decl
)
8607 tree tmpl_args
= DECL_TI_ARGS (DECL_TEMPLATE_RESULT (templ
));
8608 arglist
= add_outermost_template_args (tmpl_args
, arglist
);
8610 tree parms
= DECL_TEMPLATE_PARMS (templ
);
8611 arglist
= coerce_innermost_template_parms (parms
, arglist
, templ
, complain
,
8613 /*use_default*/true);
8615 if (flag_concepts
&& !constraints_satisfied_p (templ
, arglist
))
8617 if (complain
& tf_error
)
8619 error ("constraints for %qD not satisfied", templ
);
8620 diagnose_constraints (location_of (var
), templ
, arglist
);
8622 return error_mark_node
;
8625 /* If a template-id refers to a specialization of a variable
8626 concept, then the expression is true if and only if the
8627 concept's constraints are satisfied by the given template
8630 NOTE: This is an extension of Concepts Lite TS that
8631 allows constraints to be used in expressions. */
8634 tree decl
= DECL_TEMPLATE_RESULT (templ
);
8635 return evaluate_variable_concept (decl
, arglist
);
8638 return instantiate_template (templ
, arglist
, complain
);
8645 /* True when we should also visit template parameters that occur in
8646 non-deduced contexts. */
8647 bool include_nondeduced_p
;
8648 hash_set
<tree
> *visited
;
8651 /* Called from for_each_template_parm via walk_tree. */
8654 for_each_template_parm_r (tree
*tp
, int *walk_subtrees
, void *d
)
8657 struct pair_fn_data
*pfd
= (struct pair_fn_data
*) d
;
8658 tree_fn_t fn
= pfd
->fn
;
8659 void *data
= pfd
->data
;
8662 && (pfd
->include_nondeduced_p
|| TREE_CODE (t
) != TYPENAME_TYPE
)
8663 && for_each_template_parm (TYPE_CONTEXT (t
), fn
, data
, pfd
->visited
,
8664 pfd
->include_nondeduced_p
))
8665 return error_mark_node
;
8667 switch (TREE_CODE (t
))
8670 if (TYPE_PTRMEMFUNC_P (t
))
8676 if (!TYPE_TEMPLATE_INFO (t
))
8678 else if (for_each_template_parm (TYPE_TI_ARGS (t
),
8679 fn
, data
, pfd
->visited
,
8680 pfd
->include_nondeduced_p
))
8681 return error_mark_node
;
8685 if (for_each_template_parm (TYPE_MIN_VALUE (t
),
8686 fn
, data
, pfd
->visited
,
8687 pfd
->include_nondeduced_p
)
8688 || for_each_template_parm (TYPE_MAX_VALUE (t
),
8689 fn
, data
, pfd
->visited
,
8690 pfd
->include_nondeduced_p
))
8691 return error_mark_node
;
8695 /* Since we're not going to walk subtrees, we have to do this
8697 if (for_each_template_parm (TYPE_METHOD_BASETYPE (t
), fn
, data
,
8698 pfd
->visited
, pfd
->include_nondeduced_p
))
8699 return error_mark_node
;
8703 /* Check the return type. */
8704 if (for_each_template_parm (TREE_TYPE (t
), fn
, data
, pfd
->visited
,
8705 pfd
->include_nondeduced_p
))
8706 return error_mark_node
;
8708 /* Check the parameter types. Since default arguments are not
8709 instantiated until they are needed, the TYPE_ARG_TYPES may
8710 contain expressions that involve template parameters. But,
8711 no-one should be looking at them yet. And, once they're
8712 instantiated, they don't contain template parameters, so
8713 there's no point in looking at them then, either. */
8717 for (parm
= TYPE_ARG_TYPES (t
); parm
; parm
= TREE_CHAIN (parm
))
8718 if (for_each_template_parm (TREE_VALUE (parm
), fn
, data
,
8719 pfd
->visited
, pfd
->include_nondeduced_p
))
8720 return error_mark_node
;
8722 /* Since we've already handled the TYPE_ARG_TYPES, we don't
8723 want walk_tree walking into them itself. */
8729 case UNDERLYING_TYPE
:
8730 if (pfd
->include_nondeduced_p
8731 && for_each_template_parm (TYPE_VALUES_RAW (t
), fn
, data
,
8733 pfd
->include_nondeduced_p
))
8734 return error_mark_node
;
8739 if (DECL_LANG_SPECIFIC (t
) && DECL_TEMPLATE_INFO (t
)
8740 && for_each_template_parm (DECL_TI_ARGS (t
), fn
, data
,
8741 pfd
->visited
, pfd
->include_nondeduced_p
))
8742 return error_mark_node
;
8747 if (TREE_CODE (t
) == CONST_DECL
&& DECL_TEMPLATE_PARM_P (t
)
8748 && for_each_template_parm (DECL_INITIAL (t
), fn
, data
,
8749 pfd
->visited
, pfd
->include_nondeduced_p
))
8750 return error_mark_node
;
8751 if (DECL_CONTEXT (t
)
8752 && pfd
->include_nondeduced_p
8753 && for_each_template_parm (DECL_CONTEXT (t
), fn
, data
,
8754 pfd
->visited
, pfd
->include_nondeduced_p
))
8755 return error_mark_node
;
8758 case BOUND_TEMPLATE_TEMPLATE_PARM
:
8759 /* Record template parameters such as `T' inside `TT<T>'. */
8760 if (for_each_template_parm (TYPE_TI_ARGS (t
), fn
, data
, pfd
->visited
,
8761 pfd
->include_nondeduced_p
))
8762 return error_mark_node
;
8765 case TEMPLATE_TEMPLATE_PARM
:
8766 case TEMPLATE_TYPE_PARM
:
8767 case TEMPLATE_PARM_INDEX
:
8768 if (fn
&& (*fn
)(t
, data
))
8769 return error_mark_node
;
8771 return error_mark_node
;
8775 /* A template template parameter is encountered. */
8776 if (DECL_TEMPLATE_TEMPLATE_PARM_P (t
)
8777 && for_each_template_parm (TREE_TYPE (t
), fn
, data
, pfd
->visited
,
8778 pfd
->include_nondeduced_p
))
8779 return error_mark_node
;
8781 /* Already substituted template template parameter */
8787 || for_each_template_parm (TYPENAME_TYPE_FULLNAME (t
), fn
,
8789 pfd
->include_nondeduced_p
))
8790 return error_mark_node
;
8794 if (TREE_TYPE (t
) && TYPE_PTRMEMFUNC_P (TREE_TYPE (t
))
8795 && pfd
->include_nondeduced_p
8796 && for_each_template_parm (TYPE_PTRMEMFUNC_FN_TYPE
8797 (TREE_TYPE (t
)), fn
, data
,
8798 pfd
->visited
, pfd
->include_nondeduced_p
))
8799 return error_mark_node
;
8804 /* If there's no type, then this thing must be some expression
8805 involving template parameters. */
8806 if (!fn
&& !TREE_TYPE (t
))
8807 return error_mark_node
;
8812 case IMPLICIT_CONV_EXPR
:
8813 case REINTERPRET_CAST_EXPR
:
8814 case CONST_CAST_EXPR
:
8815 case STATIC_CAST_EXPR
:
8816 case DYNAMIC_CAST_EXPR
:
8820 case PSEUDO_DTOR_EXPR
:
8822 return error_mark_node
;
8829 /* We didn't find any template parameters we liked. */
8833 /* For each TEMPLATE_TYPE_PARM, TEMPLATE_TEMPLATE_PARM,
8834 BOUND_TEMPLATE_TEMPLATE_PARM or TEMPLATE_PARM_INDEX in T,
8835 call FN with the parameter and the DATA.
8836 If FN returns nonzero, the iteration is terminated, and
8837 for_each_template_parm returns 1. Otherwise, the iteration
8838 continues. If FN never returns a nonzero value, the value
8839 returned by for_each_template_parm is 0. If FN is NULL, it is
8840 considered to be the function which always returns 1.
8842 If INCLUDE_NONDEDUCED_P, then this routine will also visit template
8843 parameters that occur in non-deduced contexts. When false, only
8844 visits those template parameters that can be deduced. */
8847 for_each_template_parm (tree t
, tree_fn_t fn
, void* data
,
8848 hash_set
<tree
> *visited
,
8849 bool include_nondeduced_p
)
8851 struct pair_fn_data pfd
;
8857 pfd
.include_nondeduced_p
= include_nondeduced_p
;
8859 /* Walk the tree. (Conceptually, we would like to walk without
8860 duplicates, but for_each_template_parm_r recursively calls
8861 for_each_template_parm, so we would need to reorganize a fair
8862 bit to use walk_tree_without_duplicates, so we keep our own
8865 pfd
.visited
= visited
;
8867 pfd
.visited
= new hash_set
<tree
>;
8868 result
= cp_walk_tree (&t
,
8869 for_each_template_parm_r
,
8871 pfd
.visited
) != NULL_TREE
;
8883 /* Returns true if T depends on any template parameter. */
8886 uses_template_parms (tree t
)
8892 int saved_processing_template_decl
;
8894 saved_processing_template_decl
= processing_template_decl
;
8895 if (!saved_processing_template_decl
)
8896 processing_template_decl
= 1;
8898 dependent_p
= dependent_type_p (t
);
8899 else if (TREE_CODE (t
) == TREE_VEC
)
8900 dependent_p
= any_dependent_template_arguments_p (t
);
8901 else if (TREE_CODE (t
) == TREE_LIST
)
8902 dependent_p
= (uses_template_parms (TREE_VALUE (t
))
8903 || uses_template_parms (TREE_CHAIN (t
)));
8904 else if (TREE_CODE (t
) == TYPE_DECL
)
8905 dependent_p
= dependent_type_p (TREE_TYPE (t
));
8908 || TREE_CODE (t
) == TEMPLATE_PARM_INDEX
8909 || TREE_CODE (t
) == OVERLOAD
8912 || TREE_CODE (t
) == TRAIT_EXPR
8913 || TREE_CODE (t
) == CONSTRUCTOR
8914 || CONSTANT_CLASS_P (t
))
8915 dependent_p
= (type_dependent_expression_p (t
)
8916 || value_dependent_expression_p (t
));
8919 gcc_assert (t
== error_mark_node
);
8920 dependent_p
= false;
8923 processing_template_decl
= saved_processing_template_decl
;
8928 /* Returns true iff current_function_decl is an incompletely instantiated
8929 template. Useful instead of processing_template_decl because the latter
8930 is set to 0 during instantiate_non_dependent_expr. */
8933 in_template_function (void)
8935 tree fn
= current_function_decl
;
8937 ++processing_template_decl
;
8938 ret
= (fn
&& DECL_LANG_SPECIFIC (fn
)
8939 && DECL_TEMPLATE_INFO (fn
)
8940 && any_dependent_template_arguments_p (DECL_TI_ARGS (fn
)));
8941 --processing_template_decl
;
8945 /* Returns true if T depends on any template parameter with level LEVEL. */
8948 uses_template_parms_level (tree t
, int level
)
8950 return for_each_template_parm (t
, template_parm_this_level_p
, &level
, NULL
,
8951 /*include_nondeduced_p=*/true);
8954 /* Returns TRUE iff INST is an instantiation we don't need to do in an
8955 ill-formed translation unit, i.e. a variable or function that isn't
8956 usable in a constant expression. */
8959 neglectable_inst_p (tree d
)
8962 && !(TREE_CODE (d
) == FUNCTION_DECL
? DECL_DECLARED_CONSTEXPR_P (d
)
8963 : decl_maybe_constant_var_p (d
)));
8966 /* Returns TRUE iff we should refuse to instantiate DECL because it's
8967 neglectable and instantiated from within an erroneous instantiation. */
8970 limit_bad_template_recursion (tree decl
)
8972 struct tinst_level
*lev
= current_tinst_level
;
8973 int errs
= errorcount
+ sorrycount
;
8974 if (lev
== NULL
|| errs
== 0 || !neglectable_inst_p (decl
))
8977 for (; lev
; lev
= lev
->next
)
8978 if (neglectable_inst_p (lev
->decl
))
8981 return (lev
&& errs
> lev
->errors
);
8984 static int tinst_depth
;
8985 extern int max_tinst_depth
;
8988 static GTY(()) struct tinst_level
*last_error_tinst_level
;
8990 /* We're starting to instantiate D; record the template instantiation context
8991 for diagnostics and to restore it later. */
8994 push_tinst_level (tree d
)
8996 return push_tinst_level_loc (d
, input_location
);
8999 /* We're starting to instantiate D; record the template instantiation context
9000 at LOC for diagnostics and to restore it later. */
9003 push_tinst_level_loc (tree d
, location_t loc
)
9005 struct tinst_level
*new_level
;
9007 if (tinst_depth
>= max_tinst_depth
)
9009 fatal_error (input_location
,
9010 "template instantiation depth exceeds maximum of %d"
9011 " (use -ftemplate-depth= to increase the maximum)",
9016 /* If the current instantiation caused problems, don't let it instantiate
9017 anything else. Do allow deduction substitution and decls usable in
9018 constant expressions. */
9019 if (limit_bad_template_recursion (d
))
9022 new_level
= ggc_alloc
<tinst_level
> ();
9023 new_level
->decl
= d
;
9024 new_level
->locus
= loc
;
9025 new_level
->errors
= errorcount
+sorrycount
;
9026 new_level
->in_system_header_p
= in_system_header_at (input_location
);
9027 new_level
->next
= current_tinst_level
;
9028 current_tinst_level
= new_level
;
9031 if (GATHER_STATISTICS
&& (tinst_depth
> depth_reached
))
9032 depth_reached
= tinst_depth
;
9037 /* We're done instantiating this template; return to the instantiation
9041 pop_tinst_level (void)
9043 /* Restore the filename and line number stashed away when we started
9044 this instantiation. */
9045 input_location
= current_tinst_level
->locus
;
9046 current_tinst_level
= current_tinst_level
->next
;
9050 /* We're instantiating a deferred template; restore the template
9051 instantiation context in which the instantiation was requested, which
9052 is one step out from LEVEL. Return the corresponding DECL or TYPE. */
9055 reopen_tinst_level (struct tinst_level
*level
)
9057 struct tinst_level
*t
;
9060 for (t
= level
; t
; t
= t
->next
)
9063 current_tinst_level
= level
;
9065 if (current_tinst_level
)
9066 current_tinst_level
->errors
= errorcount
+sorrycount
;
9070 /* Returns the TINST_LEVEL which gives the original instantiation
9073 struct tinst_level
*
9074 outermost_tinst_level (void)
9076 struct tinst_level
*level
= current_tinst_level
;
9079 level
= level
->next
;
9083 /* DECL is a friend FUNCTION_DECL or TEMPLATE_DECL. ARGS is the
9084 vector of template arguments, as for tsubst.
9086 Returns an appropriate tsubst'd friend declaration. */
9089 tsubst_friend_function (tree decl
, tree args
)
9093 if (TREE_CODE (decl
) == FUNCTION_DECL
9094 && DECL_TEMPLATE_INSTANTIATION (decl
)
9095 && TREE_CODE (DECL_TI_TEMPLATE (decl
)) != TEMPLATE_DECL
)
9096 /* This was a friend declared with an explicit template
9097 argument list, e.g.:
9101 to indicate that f was a template instantiation, not a new
9102 function declaration. Now, we have to figure out what
9103 instantiation of what template. */
9105 tree template_id
, arglist
, fns
;
9108 tree ns
= decl_namespace_context (TYPE_MAIN_DECL (current_class_type
));
9110 /* Friend functions are looked up in the containing namespace scope.
9111 We must enter that scope, to avoid finding member functions of the
9112 current class with same name. */
9113 push_nested_namespace (ns
);
9114 fns
= tsubst_expr (DECL_TI_TEMPLATE (decl
), args
,
9115 tf_warning_or_error
, NULL_TREE
,
9116 /*integral_constant_expression_p=*/false);
9117 pop_nested_namespace (ns
);
9118 arglist
= tsubst (DECL_TI_ARGS (decl
), args
,
9119 tf_warning_or_error
, NULL_TREE
);
9120 template_id
= lookup_template_function (fns
, arglist
);
9122 new_friend
= tsubst (decl
, args
, tf_warning_or_error
, NULL_TREE
);
9123 tmpl
= determine_specialization (template_id
, new_friend
,
9125 /*need_member_template=*/0,
9126 TREE_VEC_LENGTH (args
),
9128 return instantiate_template (tmpl
, new_args
, tf_error
);
9131 new_friend
= tsubst (decl
, args
, tf_warning_or_error
, NULL_TREE
);
9133 /* The NEW_FRIEND will look like an instantiation, to the
9134 compiler, but is not an instantiation from the point of view of
9135 the language. For example, we might have had:
9137 template <class T> struct S {
9138 template <class U> friend void f(T, U);
9141 Then, in S<int>, template <class U> void f(int, U) is not an
9142 instantiation of anything. */
9143 if (new_friend
== error_mark_node
)
9144 return error_mark_node
;
9146 DECL_USE_TEMPLATE (new_friend
) = 0;
9147 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
9149 DECL_USE_TEMPLATE (DECL_TEMPLATE_RESULT (new_friend
)) = 0;
9150 DECL_SAVED_TREE (DECL_TEMPLATE_RESULT (new_friend
))
9151 = DECL_SAVED_TREE (DECL_TEMPLATE_RESULT (decl
));
9154 /* The mangled name for the NEW_FRIEND is incorrect. The function
9155 is not a template instantiation and should not be mangled like
9156 one. Therefore, we forget the mangling here; we'll recompute it
9157 later if we need it. */
9158 if (TREE_CODE (new_friend
) != TEMPLATE_DECL
)
9160 SET_DECL_RTL (new_friend
, NULL
);
9161 SET_DECL_ASSEMBLER_NAME (new_friend
, NULL_TREE
);
9164 if (DECL_NAMESPACE_SCOPE_P (new_friend
))
9167 tree new_friend_template_info
;
9168 tree new_friend_result_template_info
;
9170 int new_friend_is_defn
;
9172 /* We must save some information from NEW_FRIEND before calling
9173 duplicate decls since that function will free NEW_FRIEND if
9175 new_friend_template_info
= DECL_TEMPLATE_INFO (new_friend
);
9176 new_friend_is_defn
=
9177 (DECL_INITIAL (DECL_TEMPLATE_RESULT
9178 (template_for_substitution (new_friend
)))
9180 if (TREE_CODE (new_friend
) == TEMPLATE_DECL
)
9182 /* This declaration is a `primary' template. */
9183 DECL_PRIMARY_TEMPLATE (new_friend
) = new_friend
;
9185 new_friend_result_template_info
9186 = DECL_TEMPLATE_INFO (DECL_TEMPLATE_RESULT (new_friend
));
9189 new_friend_result_template_info
= NULL_TREE
;
9191 /* Make the init_value nonzero so pushdecl knows this is a defn. */
9192 if (new_friend_is_defn
)
9193 DECL_INITIAL (new_friend
) = error_mark_node
;
9195 /* Inside pushdecl_namespace_level, we will push into the
9196 current namespace. However, the friend function should go
9197 into the namespace of the template. */
9198 ns
= decl_namespace_context (new_friend
);
9199 push_nested_namespace (ns
);
9200 old_decl
= pushdecl_namespace_level (new_friend
, /*is_friend=*/true);
9201 pop_nested_namespace (ns
);
9203 if (old_decl
== error_mark_node
)
9204 return error_mark_node
;
9206 if (old_decl
!= new_friend
)
9208 /* This new friend declaration matched an existing
9209 declaration. For example, given:
9211 template <class T> void f(T);
9212 template <class U> class C {
9213 template <class T> friend void f(T) {}
9216 the friend declaration actually provides the definition
9217 of `f', once C has been instantiated for some type. So,
9218 old_decl will be the out-of-class template declaration,
9219 while new_friend is the in-class definition.
9221 But, if `f' was called before this point, the
9222 instantiation of `f' will have DECL_TI_ARGS corresponding
9223 to `T' but not to `U', references to which might appear
9224 in the definition of `f'. Previously, the most general
9225 template for an instantiation of `f' was the out-of-class
9226 version; now it is the in-class version. Therefore, we
9227 run through all specialization of `f', adding to their
9228 DECL_TI_ARGS appropriately. In particular, they need a
9229 new set of outer arguments, corresponding to the
9230 arguments for this class instantiation.
9232 The same situation can arise with something like this:
9235 template <class T> class C {
9239 when `C<int>' is instantiated. Now, `f(int)' is defined
9242 if (!new_friend_is_defn
)
9243 /* On the other hand, if the in-class declaration does
9244 *not* provide a definition, then we don't want to alter
9245 existing definitions. We can just leave everything
9250 tree new_template
= TI_TEMPLATE (new_friend_template_info
);
9251 tree new_args
= TI_ARGS (new_friend_template_info
);
9253 /* Overwrite whatever template info was there before, if
9254 any, with the new template information pertaining to
9256 DECL_TEMPLATE_INFO (old_decl
) = new_friend_template_info
;
9258 if (TREE_CODE (old_decl
) != TEMPLATE_DECL
)
9260 /* We should have called reregister_specialization in
9262 gcc_assert (retrieve_specialization (new_template
,
9266 /* Instantiate it if the global has already been used. */
9267 if (DECL_ODR_USED (old_decl
))
9268 instantiate_decl (old_decl
, /*defer_ok=*/true,
9269 /*expl_inst_class_mem_p=*/false);
9275 /* Indicate that the old function template is a partial
9277 DECL_TEMPLATE_INFO (DECL_TEMPLATE_RESULT (old_decl
))
9278 = new_friend_result_template_info
;
9280 gcc_assert (new_template
9281 == most_general_template (new_template
));
9282 gcc_assert (new_template
!= old_decl
);
9284 /* Reassign any specializations already in the hash table
9285 to the new more general template, and add the
9286 additional template args. */
9287 for (t
= DECL_TEMPLATE_INSTANTIATIONS (old_decl
);
9291 tree spec
= TREE_VALUE (t
);
9294 elt
.tmpl
= old_decl
;
9295 elt
.args
= DECL_TI_ARGS (spec
);
9296 elt
.spec
= NULL_TREE
;
9298 decl_specializations
->remove_elt (&elt
);
9301 = add_outermost_template_args (new_args
,
9302 DECL_TI_ARGS (spec
));
9304 register_specialization
9305 (spec
, new_template
, DECL_TI_ARGS (spec
), true, 0);
9308 DECL_TEMPLATE_INSTANTIATIONS (old_decl
) = NULL_TREE
;
9312 /* The information from NEW_FRIEND has been merged into OLD_DECL
9313 by duplicate_decls. */
9314 new_friend
= old_decl
;
9319 tree context
= DECL_CONTEXT (new_friend
);
9323 template <class T> class C {
9324 template <class U> friend void C1<U>::f (); // case 1
9325 friend void C2<T>::f (); // case 2
9327 we only need to make sure CONTEXT is a complete type for
9328 case 2. To distinguish between the two cases, we note that
9329 CONTEXT of case 1 remains dependent type after tsubst while
9330 this isn't true for case 2. */
9331 ++processing_template_decl
;
9332 dependent_p
= dependent_type_p (context
);
9333 --processing_template_decl
;
9336 && !complete_type_or_else (context
, NULL_TREE
))
9337 return error_mark_node
;
9339 if (COMPLETE_TYPE_P (context
))
9341 tree fn
= new_friend
;
9342 /* do_friend adds the TEMPLATE_DECL for any member friend
9343 template even if it isn't a member template, i.e.
9344 template <class T> friend A<T>::f();
9345 Look through it in that case. */
9346 if (TREE_CODE (fn
) == TEMPLATE_DECL
9347 && !PRIMARY_TEMPLATE_P (fn
))
9348 fn
= DECL_TEMPLATE_RESULT (fn
);
9349 /* Check to see that the declaration is really present, and,
9350 possibly obtain an improved declaration. */
9351 fn
= check_classfn (context
, fn
, NULL_TREE
);
9361 /* FRIEND_TMPL is a friend TEMPLATE_DECL. ARGS is the vector of
9362 template arguments, as for tsubst.
9364 Returns an appropriate tsubst'd friend type or error_mark_node on
9368 tsubst_friend_class (tree friend_tmpl
, tree args
)
9374 if (DECL_TEMPLATE_TEMPLATE_PARM_P (friend_tmpl
))
9376 tree t
= tsubst (TREE_TYPE (friend_tmpl
), args
, tf_none
, NULL_TREE
);
9377 return TREE_TYPE (t
);
9380 context
= CP_DECL_CONTEXT (friend_tmpl
);
9382 if (context
!= global_namespace
)
9384 if (TREE_CODE (context
) == NAMESPACE_DECL
)
9385 push_nested_namespace (context
);
9387 push_nested_class (tsubst (context
, args
, tf_none
, NULL_TREE
));
9390 /* Look for a class template declaration. We look for hidden names
9391 because two friend declarations of the same template are the
9392 same. For example, in:
9395 template <typename> friend class F;
9397 template <typename> struct B {
9398 template <typename> friend class F;
9401 both F templates are the same. */
9402 tmpl
= lookup_name_real (DECL_NAME (friend_tmpl
), 0, 0,
9403 /*block_p=*/true, 0, LOOKUP_HIDDEN
);
9405 /* But, if we don't find one, it might be because we're in a
9406 situation like this:
9414 Here, in the scope of (say) S<int>, `S' is bound to a TYPE_DECL
9415 for `S<int>', not the TEMPLATE_DECL. */
9416 if (!tmpl
|| !DECL_CLASS_TEMPLATE_P (tmpl
))
9418 tmpl
= lookup_name_prefer_type (DECL_NAME (friend_tmpl
), 1);
9419 tmpl
= maybe_get_template_decl_from_type_decl (tmpl
);
9422 if (tmpl
&& DECL_CLASS_TEMPLATE_P (tmpl
))
9424 /* The friend template has already been declared. Just
9425 check to see that the declarations match, and install any new
9426 default parameters. We must tsubst the default parameters,
9427 of course. We only need the innermost template parameters
9428 because that is all that redeclare_class_template will look
9430 if (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (friend_tmpl
))
9431 > TMPL_ARGS_DEPTH (args
))
9434 location_t saved_input_location
;
9435 parms
= tsubst_template_parms (DECL_TEMPLATE_PARMS (friend_tmpl
),
9436 args
, tf_warning_or_error
);
9438 saved_input_location
= input_location
;
9439 input_location
= DECL_SOURCE_LOCATION (friend_tmpl
);
9440 tree cons
= get_constraints (tmpl
);
9441 redeclare_class_template (TREE_TYPE (tmpl
), parms
, cons
);
9442 input_location
= saved_input_location
;
9446 friend_type
= TREE_TYPE (tmpl
);
9450 /* The friend template has not already been declared. In this
9451 case, the instantiation of the template class will cause the
9452 injection of this template into the global scope. */
9453 tmpl
= tsubst (friend_tmpl
, args
, tf_warning_or_error
, NULL_TREE
);
9454 if (tmpl
== error_mark_node
)
9455 return error_mark_node
;
9457 /* The new TMPL is not an instantiation of anything, so we
9458 forget its origins. We don't reset CLASSTYPE_TI_TEMPLATE for
9459 the new type because that is supposed to be the corresponding
9460 template decl, i.e., TMPL. */
9461 DECL_USE_TEMPLATE (tmpl
) = 0;
9462 DECL_TEMPLATE_INFO (tmpl
) = NULL_TREE
;
9463 CLASSTYPE_USE_TEMPLATE (TREE_TYPE (tmpl
)) = 0;
9464 CLASSTYPE_TI_ARGS (TREE_TYPE (tmpl
))
9465 = INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (TREE_TYPE (tmpl
)));
9467 /* Inject this template into the global scope. */
9468 friend_type
= TREE_TYPE (pushdecl_top_level_maybe_friend (tmpl
, true));
9471 if (context
!= global_namespace
)
9473 if (TREE_CODE (context
) == NAMESPACE_DECL
)
9474 pop_nested_namespace (context
);
9476 pop_nested_class ();
9482 /* Returns zero if TYPE cannot be completed later due to circularity.
9483 Otherwise returns one. */
9486 can_complete_type_without_circularity (tree type
)
9488 if (type
== NULL_TREE
|| type
== error_mark_node
)
9490 else if (COMPLETE_TYPE_P (type
))
9492 else if (TREE_CODE (type
) == ARRAY_TYPE
&& TYPE_DOMAIN (type
))
9493 return can_complete_type_without_circularity (TREE_TYPE (type
));
9494 else if (CLASS_TYPE_P (type
)
9495 && TYPE_BEING_DEFINED (TYPE_MAIN_VARIANT (type
)))
9501 static tree
tsubst_omp_clauses (tree
, bool, tree
, tsubst_flags_t
, tree
);
9503 /* Apply any attributes which had to be deferred until instantiation
9504 time. DECL_P, ATTRIBUTES and ATTR_FLAGS are as cplus_decl_attributes;
9505 ARGS, COMPLAIN, IN_DECL are as tsubst. */
9508 apply_late_template_attributes (tree
*decl_p
, tree attributes
, int attr_flags
,
9509 tree args
, tsubst_flags_t complain
, tree in_decl
)
9511 tree last_dep
= NULL_TREE
;
9515 for (t
= attributes
; t
; t
= TREE_CHAIN (t
))
9516 if (ATTR_IS_DEPENDENT (t
))
9519 attributes
= copy_list (attributes
);
9523 if (DECL_P (*decl_p
))
9525 if (TREE_TYPE (*decl_p
) == error_mark_node
)
9527 p
= &DECL_ATTRIBUTES (*decl_p
);
9530 p
= &TYPE_ATTRIBUTES (*decl_p
);
9534 tree late_attrs
= NULL_TREE
;
9535 tree
*q
= &late_attrs
;
9537 for (*p
= attributes
; *p
; )
9540 if (ATTR_IS_DEPENDENT (t
))
9542 *p
= TREE_CHAIN (t
);
9543 TREE_CHAIN (t
) = NULL_TREE
;
9544 if ((flag_openmp
|| flag_openmp_simd
|| flag_cilkplus
)
9545 && is_attribute_p ("omp declare simd",
9546 get_attribute_name (t
))
9549 tree clauses
= TREE_VALUE (TREE_VALUE (t
));
9550 clauses
= tsubst_omp_clauses (clauses
, true, args
,
9552 c_omp_declare_simd_clauses_to_decls (*decl_p
, clauses
);
9553 clauses
= finish_omp_clauses (clauses
);
9554 tree parms
= DECL_ARGUMENTS (*decl_p
);
9556 = c_omp_declare_simd_clauses_to_numbers (parms
, clauses
);
9558 TREE_VALUE (TREE_VALUE (t
)) = clauses
;
9560 TREE_VALUE (t
) = NULL_TREE
;
9562 /* If the first attribute argument is an identifier, don't
9563 pass it through tsubst. Attributes like mode, format,
9564 cleanup and several target specific attributes expect it
9566 else if (attribute_takes_identifier_p (get_attribute_name (t
))
9570 = tsubst_expr (TREE_CHAIN (TREE_VALUE (t
)), args
, complain
,
9572 /*integral_constant_expression_p=*/false);
9573 if (chain
!= TREE_CHAIN (TREE_VALUE (t
)))
9575 = tree_cons (NULL_TREE
, TREE_VALUE (TREE_VALUE (t
)),
9578 else if (TREE_VALUE (t
) && PACK_EXPANSION_P (TREE_VALUE (t
)))
9580 /* An attribute pack expansion. */
9581 tree purp
= TREE_PURPOSE (t
);
9582 tree pack
= (tsubst_pack_expansion
9583 (TREE_VALUE (t
), args
, complain
, in_decl
));
9584 int len
= TREE_VEC_LENGTH (pack
);
9585 for (int i
= 0; i
< len
; ++i
)
9587 tree elt
= TREE_VEC_ELT (pack
, i
);
9588 *q
= build_tree_list (purp
, elt
);
9589 q
= &TREE_CHAIN (*q
);
9595 = tsubst_expr (TREE_VALUE (t
), args
, complain
, in_decl
,
9596 /*integral_constant_expression_p=*/false);
9598 q
= &TREE_CHAIN (t
);
9601 p
= &TREE_CHAIN (t
);
9604 cplus_decl_attributes (decl_p
, late_attrs
, attr_flags
);
9608 /* Perform (or defer) access check for typedefs that were referenced
9609 from within the template TMPL code.
9610 This is a subroutine of instantiate_decl and instantiate_class_template.
9611 TMPL is the template to consider and TARGS is the list of arguments of
9615 perform_typedefs_access_check (tree tmpl
, tree targs
)
9617 location_t saved_location
;
9619 qualified_typedef_usage_t
*iter
;
9622 || (!CLASS_TYPE_P (tmpl
)
9623 && TREE_CODE (tmpl
) != FUNCTION_DECL
))
9626 saved_location
= input_location
;
9627 FOR_EACH_VEC_SAFE_ELT (get_types_needing_access_check (tmpl
), i
, iter
)
9629 tree type_decl
= iter
->typedef_decl
;
9630 tree type_scope
= iter
->context
;
9632 if (!type_decl
|| !type_scope
|| !CLASS_TYPE_P (type_scope
))
9635 if (uses_template_parms (type_decl
))
9636 type_decl
= tsubst (type_decl
, targs
, tf_error
, NULL_TREE
);
9637 if (uses_template_parms (type_scope
))
9638 type_scope
= tsubst (type_scope
, targs
, tf_error
, NULL_TREE
);
9640 /* Make access check error messages point to the location
9641 of the use of the typedef. */
9642 input_location
= iter
->locus
;
9643 perform_or_defer_access_check (TYPE_BINFO (type_scope
),
9644 type_decl
, type_decl
,
9645 tf_warning_or_error
);
9647 input_location
= saved_location
;
9651 instantiate_class_template_1 (tree type
)
9653 tree templ
, args
, pattern
, t
, member
;
9657 unsigned int saved_maximum_field_alignment
;
9660 if (type
== error_mark_node
)
9661 return error_mark_node
;
9663 if (COMPLETE_OR_OPEN_TYPE_P (type
)
9664 || uses_template_parms (type
))
9667 /* Figure out which template is being instantiated. */
9668 templ
= most_general_template (CLASSTYPE_TI_TEMPLATE (type
));
9669 gcc_assert (TREE_CODE (templ
) == TEMPLATE_DECL
);
9671 /* Determine what specialization of the original template to
9673 t
= most_specialized_partial_spec (type
, tf_warning_or_error
);
9674 if (t
== error_mark_node
)
9676 TYPE_BEING_DEFINED (type
) = 1;
9677 return error_mark_node
;
9681 /* This TYPE is actually an instantiation of a partial
9682 specialization. We replace the innermost set of ARGS with
9683 the arguments appropriate for substitution. For example,
9686 template <class T> struct S {};
9687 template <class T> struct S<T*> {};
9689 and supposing that we are instantiating S<int*>, ARGS will
9690 presently be {int*} -- but we need {int}. */
9691 pattern
= TREE_TYPE (t
);
9692 args
= TREE_PURPOSE (t
);
9696 pattern
= TREE_TYPE (templ
);
9697 args
= CLASSTYPE_TI_ARGS (type
);
9700 /* If the template we're instantiating is incomplete, then clearly
9701 there's nothing we can do. */
9702 if (!COMPLETE_TYPE_P (pattern
))
9705 /* If we've recursively instantiated too many templates, stop. */
9706 if (! push_tinst_level (type
))
9709 /* Now we're really doing the instantiation. Mark the type as in
9710 the process of being defined. */
9711 TYPE_BEING_DEFINED (type
) = 1;
9713 /* We may be in the middle of deferred access check. Disable
9715 push_deferring_access_checks (dk_no_deferred
);
9717 int saved_unevaluated_operand
= cp_unevaluated_operand
;
9718 int saved_inhibit_evaluation_warnings
= c_inhibit_evaluation_warnings
;
9720 fn_context
= decl_function_context (TYPE_MAIN_DECL (type
));
9721 /* Also avoid push_to_top_level for a lambda in an NSDMI. */
9722 if (!fn_context
&& LAMBDA_TYPE_P (type
) && TYPE_CLASS_SCOPE_P (type
))
9723 fn_context
= error_mark_node
;
9725 push_to_top_level ();
9728 cp_unevaluated_operand
= 0;
9729 c_inhibit_evaluation_warnings
= 0;
9731 /* Use #pragma pack from the template context. */
9732 saved_maximum_field_alignment
= maximum_field_alignment
;
9733 maximum_field_alignment
= TYPE_PRECISION (pattern
);
9735 SET_CLASSTYPE_INTERFACE_UNKNOWN (type
);
9737 /* Set the input location to the most specialized template definition.
9738 This is needed if tsubsting causes an error. */
9739 typedecl
= TYPE_MAIN_DECL (pattern
);
9740 input_location
= DECL_SOURCE_LOCATION (TYPE_NAME (type
)) =
9741 DECL_SOURCE_LOCATION (typedecl
);
9743 TYPE_PACKED (type
) = TYPE_PACKED (pattern
);
9744 TYPE_ALIGN (type
) = TYPE_ALIGN (pattern
);
9745 TYPE_USER_ALIGN (type
) = TYPE_USER_ALIGN (pattern
);
9746 TYPE_FOR_JAVA (type
) = TYPE_FOR_JAVA (pattern
); /* For libjava's JArray<T> */
9747 if (ANON_AGGR_TYPE_P (pattern
))
9748 SET_ANON_AGGR_TYPE_P (type
);
9749 if (CLASSTYPE_VISIBILITY_SPECIFIED (pattern
))
9751 CLASSTYPE_VISIBILITY_SPECIFIED (type
) = 1;
9752 CLASSTYPE_VISIBILITY (type
) = CLASSTYPE_VISIBILITY (pattern
);
9753 /* Adjust visibility for template arguments. */
9754 determine_visibility (TYPE_MAIN_DECL (type
));
9756 if (CLASS_TYPE_P (type
))
9757 CLASSTYPE_FINAL (type
) = CLASSTYPE_FINAL (pattern
);
9759 pbinfo
= TYPE_BINFO (pattern
);
9761 /* We should never instantiate a nested class before its enclosing
9762 class; we need to look up the nested class by name before we can
9763 instantiate it, and that lookup should instantiate the enclosing
9765 gcc_assert (!DECL_CLASS_SCOPE_P (TYPE_MAIN_DECL (pattern
))
9766 || COMPLETE_OR_OPEN_TYPE_P (TYPE_CONTEXT (type
)));
9768 base_list
= NULL_TREE
;
9769 if (BINFO_N_BASE_BINFOS (pbinfo
))
9775 /* We must enter the scope containing the type, as that is where
9776 the accessibility of types named in dependent bases are
9778 pushed_scope
= push_scope (CP_TYPE_CONTEXT (type
));
9780 /* Substitute into each of the bases to determine the actual
9782 for (i
= 0; BINFO_BASE_ITERATE (pbinfo
, i
, pbase_binfo
); i
++)
9785 tree access
= BINFO_BASE_ACCESS (pbinfo
, i
);
9786 tree expanded_bases
= NULL_TREE
;
9789 if (PACK_EXPANSION_P (BINFO_TYPE (pbase_binfo
)))
9792 tsubst_pack_expansion (BINFO_TYPE (pbase_binfo
),
9793 args
, tf_error
, NULL_TREE
);
9794 if (expanded_bases
== error_mark_node
)
9797 len
= TREE_VEC_LENGTH (expanded_bases
);
9800 for (idx
= 0; idx
< len
; idx
++)
9803 /* Extract the already-expanded base class. */
9804 base
= TREE_VEC_ELT (expanded_bases
, idx
);
9806 /* Substitute to figure out the base class. */
9807 base
= tsubst (BINFO_TYPE (pbase_binfo
), args
, tf_error
,
9810 if (base
== error_mark_node
)
9813 base_list
= tree_cons (access
, base
, base_list
);
9814 if (BINFO_VIRTUAL_P (pbase_binfo
))
9815 TREE_TYPE (base_list
) = integer_type_node
;
9819 /* The list is now in reverse order; correct that. */
9820 base_list
= nreverse (base_list
);
9823 pop_scope (pushed_scope
);
9825 /* Now call xref_basetypes to set up all the base-class
9827 xref_basetypes (type
, base_list
);
9829 apply_late_template_attributes (&type
, TYPE_ATTRIBUTES (pattern
),
9830 (int) ATTR_FLAG_TYPE_IN_PLACE
,
9831 args
, tf_error
, NULL_TREE
);
9832 fixup_attribute_variants (type
);
9834 /* Now that our base classes are set up, enter the scope of the
9835 class, so that name lookups into base classes, etc. will work
9836 correctly. This is precisely analogous to what we do in
9837 begin_class_definition when defining an ordinary non-template
9838 class, except we also need to push the enclosing classes. */
9839 push_nested_class (type
);
9841 /* Now members are processed in the order of declaration. */
9842 for (member
= CLASSTYPE_DECL_LIST (pattern
);
9843 member
; member
= TREE_CHAIN (member
))
9845 tree t
= TREE_VALUE (member
);
9847 if (TREE_PURPOSE (member
))
9851 /* Build new CLASSTYPE_NESTED_UTDS. */
9854 bool class_template_p
;
9856 class_template_p
= (TREE_CODE (t
) != ENUMERAL_TYPE
9857 && TYPE_LANG_SPECIFIC (t
)
9858 && CLASSTYPE_IS_TEMPLATE (t
));
9859 /* If the member is a class template, then -- even after
9860 substitution -- there may be dependent types in the
9861 template argument list for the class. We increment
9862 PROCESSING_TEMPLATE_DECL so that dependent_type_p, as
9863 that function will assume that no types are dependent
9864 when outside of a template. */
9865 if (class_template_p
)
9866 ++processing_template_decl
;
9867 newtag
= tsubst (t
, args
, tf_error
, NULL_TREE
);
9868 if (class_template_p
)
9869 --processing_template_decl
;
9870 if (newtag
== error_mark_node
)
9873 if (TREE_CODE (newtag
) != ENUMERAL_TYPE
)
9875 tree name
= TYPE_IDENTIFIER (t
);
9877 if (class_template_p
)
9878 /* Unfortunately, lookup_template_class sets
9879 CLASSTYPE_IMPLICIT_INSTANTIATION for a partial
9880 instantiation (i.e., for the type of a member
9881 template class nested within a template class.)
9882 This behavior is required for
9883 maybe_process_partial_specialization to work
9884 correctly, but is not accurate in this case;
9885 the TAG is not an instantiation of anything.
9886 (The corresponding TEMPLATE_DECL is an
9887 instantiation, but the TYPE is not.) */
9888 CLASSTYPE_USE_TEMPLATE (newtag
) = 0;
9890 /* Now, we call pushtag to put this NEWTAG into the scope of
9891 TYPE. We first set up the IDENTIFIER_TYPE_VALUE to avoid
9892 pushtag calling push_template_decl. We don't have to do
9893 this for enums because it will already have been done in
9896 SET_IDENTIFIER_TYPE_VALUE (name
, newtag
);
9897 pushtag (name
, newtag
, /*tag_scope=*/ts_current
);
9900 else if (DECL_DECLARES_FUNCTION_P (t
))
9902 /* Build new TYPE_METHODS. */
9905 if (TREE_CODE (t
) == TEMPLATE_DECL
)
9906 ++processing_template_decl
;
9907 r
= tsubst (t
, args
, tf_error
, NULL_TREE
);
9908 if (TREE_CODE (t
) == TEMPLATE_DECL
)
9909 --processing_template_decl
;
9910 set_current_access_from_decl (r
);
9911 finish_member_declaration (r
);
9912 /* Instantiate members marked with attribute used. */
9913 if (r
!= error_mark_node
&& DECL_PRESERVE_P (r
))
9915 if (TREE_CODE (r
) == FUNCTION_DECL
9916 && DECL_OMP_DECLARE_REDUCTION_P (r
))
9917 cp_check_omp_declare_reduction (r
);
9919 else if (DECL_CLASS_TEMPLATE_P (t
)
9920 && LAMBDA_TYPE_P (TREE_TYPE (t
)))
9921 /* A closure type for a lambda in a default argument for a
9922 member template. Ignore it; it will be instantiated with
9923 the default argument. */;
9926 /* Build new TYPE_FIELDS. */
9927 if (TREE_CODE (t
) == STATIC_ASSERT
)
9931 ++c_inhibit_evaluation_warnings
;
9933 tsubst_expr (STATIC_ASSERT_CONDITION (t
), args
,
9934 tf_warning_or_error
, NULL_TREE
,
9935 /*integral_constant_expression_p=*/true);
9936 --c_inhibit_evaluation_warnings
;
9938 finish_static_assert (condition
,
9939 STATIC_ASSERT_MESSAGE (t
),
9940 STATIC_ASSERT_SOURCE_LOCATION (t
),
9943 else if (TREE_CODE (t
) != CONST_DECL
)
9946 tree vec
= NULL_TREE
;
9949 /* The file and line for this declaration, to
9950 assist in error message reporting. Since we
9951 called push_tinst_level above, we don't need to
9953 input_location
= DECL_SOURCE_LOCATION (t
);
9955 if (TREE_CODE (t
) == TEMPLATE_DECL
)
9956 ++processing_template_decl
;
9957 r
= tsubst (t
, args
, tf_warning_or_error
, NULL_TREE
);
9958 if (TREE_CODE (t
) == TEMPLATE_DECL
)
9959 --processing_template_decl
;
9961 if (TREE_CODE (r
) == TREE_VEC
)
9963 /* A capture pack became multiple fields. */
9965 len
= TREE_VEC_LENGTH (vec
);
9968 for (int i
= 0; i
< len
; ++i
)
9971 r
= TREE_VEC_ELT (vec
, i
);
9976 [t]he initialization (and any associated
9977 side-effects) of a static data member does
9978 not occur unless the static data member is
9979 itself used in a way that requires the
9980 definition of the static data member to
9983 Therefore, we do not substitute into the
9984 initialized for the static data member here. */
9985 finish_static_data_member_decl
9988 /*init_const_expr_p=*/false,
9989 /*asmspec_tree=*/NULL_TREE
,
9991 /* Instantiate members marked with attribute used. */
9992 if (r
!= error_mark_node
&& DECL_PRESERVE_P (r
))
9995 else if (TREE_CODE (r
) == FIELD_DECL
)
9997 /* Determine whether R has a valid type and can be
9998 completed later. If R is invalid, then its type
9999 is replaced by error_mark_node. */
10000 tree rtype
= TREE_TYPE (r
);
10001 if (can_complete_type_without_circularity (rtype
))
10002 complete_type (rtype
);
10004 if (!COMPLETE_TYPE_P (rtype
))
10006 cxx_incomplete_type_error (r
, rtype
);
10007 TREE_TYPE (r
) = error_mark_node
;
10011 /* If it is a TYPE_DECL for a class-scoped ENUMERAL_TYPE,
10012 such a thing will already have been added to the field
10013 list by tsubst_enum in finish_member_declaration in the
10014 CLASSTYPE_NESTED_UTDS case above. */
10015 if (!(TREE_CODE (r
) == TYPE_DECL
10016 && TREE_CODE (TREE_TYPE (r
)) == ENUMERAL_TYPE
10017 && DECL_ARTIFICIAL (r
)))
10019 set_current_access_from_decl (r
);
10020 finish_member_declaration (r
);
10028 if (TYPE_P (t
) || DECL_CLASS_TEMPLATE_P (t
)
10029 || DECL_TEMPLATE_TEMPLATE_PARM_P (t
))
10031 /* Build new CLASSTYPE_FRIEND_CLASSES. */
10033 tree friend_type
= t
;
10034 bool adjust_processing_template_decl
= false;
10036 if (TREE_CODE (friend_type
) == TEMPLATE_DECL
)
10038 /* template <class T> friend class C; */
10039 friend_type
= tsubst_friend_class (friend_type
, args
);
10040 adjust_processing_template_decl
= true;
10042 else if (TREE_CODE (friend_type
) == UNBOUND_CLASS_TEMPLATE
)
10044 /* template <class T> friend class C::D; */
10045 friend_type
= tsubst (friend_type
, args
,
10046 tf_warning_or_error
, NULL_TREE
);
10047 if (TREE_CODE (friend_type
) == TEMPLATE_DECL
)
10048 friend_type
= TREE_TYPE (friend_type
);
10049 adjust_processing_template_decl
= true;
10051 else if (TREE_CODE (friend_type
) == TYPENAME_TYPE
10052 || TREE_CODE (friend_type
) == TEMPLATE_TYPE_PARM
)
10054 /* This could be either
10058 when dependent_type_p is false or
10060 template <class U> friend class T::C;
10063 friend_type
= tsubst (friend_type
, args
,
10064 tf_warning_or_error
, NULL_TREE
);
10065 /* Bump processing_template_decl for correct
10066 dependent_type_p calculation. */
10067 ++processing_template_decl
;
10068 if (dependent_type_p (friend_type
))
10069 adjust_processing_template_decl
= true;
10070 --processing_template_decl
;
10072 else if (!CLASSTYPE_USE_TEMPLATE (friend_type
)
10073 && hidden_name_p (TYPE_NAME (friend_type
)))
10077 where C hasn't been declared yet. Let's lookup name
10078 from namespace scope directly, bypassing any name that
10079 come from dependent base class. */
10080 tree ns
= decl_namespace_context (TYPE_MAIN_DECL (friend_type
));
10082 /* The call to xref_tag_from_type does injection for friend
10084 push_nested_namespace (ns
);
10086 xref_tag_from_type (friend_type
, NULL_TREE
,
10087 /*tag_scope=*/ts_current
);
10088 pop_nested_namespace (ns
);
10090 else if (uses_template_parms (friend_type
))
10091 /* friend class C<T>; */
10092 friend_type
= tsubst (friend_type
, args
,
10093 tf_warning_or_error
, NULL_TREE
);
10098 where C is already declared or
10100 friend class C<int>;
10102 We don't have to do anything in these cases. */
10104 if (adjust_processing_template_decl
)
10105 /* Trick make_friend_class into realizing that the friend
10106 we're adding is a template, not an ordinary class. It's
10107 important that we use make_friend_class since it will
10108 perform some error-checking and output cross-reference
10110 ++processing_template_decl
;
10112 if (friend_type
!= error_mark_node
)
10113 make_friend_class (type
, friend_type
, /*complain=*/false);
10115 if (adjust_processing_template_decl
)
10116 --processing_template_decl
;
10120 /* Build new DECL_FRIENDLIST. */
10123 /* The file and line for this declaration, to
10124 assist in error message reporting. Since we
10125 called push_tinst_level above, we don't need to
10127 input_location
= DECL_SOURCE_LOCATION (t
);
10129 if (TREE_CODE (t
) == TEMPLATE_DECL
)
10131 ++processing_template_decl
;
10132 push_deferring_access_checks (dk_no_check
);
10135 r
= tsubst_friend_function (t
, args
);
10136 add_friend (type
, r
, /*complain=*/false);
10137 if (TREE_CODE (t
) == TEMPLATE_DECL
)
10139 pop_deferring_access_checks ();
10140 --processing_template_decl
;
10148 /* Restore these before substituting into the lambda capture
10150 cp_unevaluated_operand
= saved_unevaluated_operand
;
10151 c_inhibit_evaluation_warnings
= saved_inhibit_evaluation_warnings
;
10154 if (tree expr
= CLASSTYPE_LAMBDA_EXPR (type
))
10156 tree decl
= lambda_function (type
);
10159 if (!DECL_TEMPLATE_INFO (decl
)
10160 || DECL_TEMPLATE_RESULT (DECL_TI_TEMPLATE (decl
)) != decl
)
10161 instantiate_decl (decl
, false, false);
10163 /* We need to instantiate the capture list from the template
10164 after we've instantiated the closure members, but before we
10165 consider adding the conversion op. Also keep any captures
10166 that may have been added during instantiation of the op(). */
10167 tree tmpl_expr
= CLASSTYPE_LAMBDA_EXPR (pattern
);
10169 = tsubst_copy_and_build (LAMBDA_EXPR_CAPTURE_LIST (tmpl_expr
),
10170 args
, tf_warning_or_error
, NULL_TREE
,
10173 LAMBDA_EXPR_CAPTURE_LIST (expr
)
10174 = chainon (tmpl_cap
, nreverse (LAMBDA_EXPR_CAPTURE_LIST (expr
)));
10176 maybe_add_lambda_conv_op (type
);
10179 gcc_assert (errorcount
);
10182 /* Set the file and line number information to whatever is given for
10183 the class itself. This puts error messages involving generated
10184 implicit functions at a predictable point, and the same point
10185 that would be used for non-template classes. */
10186 input_location
= DECL_SOURCE_LOCATION (typedecl
);
10188 unreverse_member_declarations (type
);
10189 finish_struct_1 (type
);
10190 TYPE_BEING_DEFINED (type
) = 0;
10192 /* We don't instantiate default arguments for member functions. 14.7.1:
10194 The implicit instantiation of a class template specialization causes
10195 the implicit instantiation of the declarations, but not of the
10196 definitions or default arguments, of the class member functions,
10197 member classes, static data members and member templates.... */
10199 /* Some typedefs referenced from within the template code need to be access
10200 checked at template instantiation time, i.e now. These types were
10201 added to the template at parsing time. Let's get those and perform
10202 the access checks then. */
10203 perform_typedefs_access_check (pattern
, args
);
10204 perform_deferred_access_checks (tf_warning_or_error
);
10205 pop_nested_class ();
10206 maximum_field_alignment
= saved_maximum_field_alignment
;
10208 pop_from_top_level ();
10209 pop_deferring_access_checks ();
10210 pop_tinst_level ();
10212 /* The vtable for a template class can be emitted in any translation
10213 unit in which the class is instantiated. When there is no key
10214 method, however, finish_struct_1 will already have added TYPE to
10215 the keyed_classes list. */
10216 if (TYPE_CONTAINS_VPTR_P (type
) && CLASSTYPE_KEY_METHOD (type
))
10217 keyed_classes
= tree_cons (NULL_TREE
, type
, keyed_classes
);
10222 /* Wrapper for instantiate_class_template_1. */
10225 instantiate_class_template (tree type
)
10228 timevar_push (TV_TEMPLATE_INST
);
10229 ret
= instantiate_class_template_1 (type
);
10230 timevar_pop (TV_TEMPLATE_INST
);
10235 tsubst_template_arg (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
10241 else if (TYPE_P (t
))
10242 r
= tsubst (t
, args
, complain
, in_decl
);
10245 if (!(complain
& tf_warning
))
10246 ++c_inhibit_evaluation_warnings
;
10247 r
= tsubst_expr (t
, args
, complain
, in_decl
,
10248 /*integral_constant_expression_p=*/true);
10249 if (!(complain
& tf_warning
))
10250 --c_inhibit_evaluation_warnings
;
10255 /* Given a function parameter pack TMPL_PARM and some function parameters
10256 instantiated from it at *SPEC_P, return a NONTYPE_ARGUMENT_PACK of them
10257 and set *SPEC_P to point at the next point in the list. */
10260 extract_fnparm_pack (tree tmpl_parm
, tree
*spec_p
)
10262 /* Collect all of the extra "packed" parameters into an
10266 tree argpack
= make_node (NONTYPE_ARGUMENT_PACK
);
10267 tree argtypepack
= cxx_make_type (TYPE_ARGUMENT_PACK
);
10268 tree spec_parm
= *spec_p
;
10271 for (len
= 0; spec_parm
; ++len
, spec_parm
= TREE_CHAIN (spec_parm
))
10273 && !function_parameter_expanded_from_pack_p (spec_parm
, tmpl_parm
))
10276 /* Fill in PARMVEC and PARMTYPEVEC with all of the parameters. */
10277 parmvec
= make_tree_vec (len
);
10278 parmtypevec
= make_tree_vec (len
);
10279 spec_parm
= *spec_p
;
10280 for (i
= 0; i
< len
; i
++, spec_parm
= DECL_CHAIN (spec_parm
))
10282 TREE_VEC_ELT (parmvec
, i
) = spec_parm
;
10283 TREE_VEC_ELT (parmtypevec
, i
) = TREE_TYPE (spec_parm
);
10286 /* Build the argument packs. */
10287 SET_ARGUMENT_PACK_ARGS (argpack
, parmvec
);
10288 SET_ARGUMENT_PACK_ARGS (argtypepack
, parmtypevec
);
10289 TREE_TYPE (argpack
) = argtypepack
;
10290 *spec_p
= spec_parm
;
10295 /* Give a chain SPEC_PARM of PARM_DECLs, pack them into a
10296 NONTYPE_ARGUMENT_PACK. */
10299 make_fnparm_pack (tree spec_parm
)
10301 return extract_fnparm_pack (NULL_TREE
, &spec_parm
);
10304 /* Return 1 if the Ith element of the argument pack ARG_PACK is a
10305 pack expansion with no extra args, 2 if it has extra args, or 0
10306 if it is not a pack expansion. */
10309 argument_pack_element_is_expansion_p (tree arg_pack
, int i
)
10311 tree vec
= ARGUMENT_PACK_ARGS (arg_pack
);
10312 if (i
>= TREE_VEC_LENGTH (vec
))
10314 tree elt
= TREE_VEC_ELT (vec
, i
);
10316 /* A decl pack is itself an expansion. */
10317 elt
= TREE_TYPE (elt
);
10318 if (!PACK_EXPANSION_P (elt
))
10320 if (PACK_EXPANSION_EXTRA_ARGS (elt
))
10326 /* Creates and return an ARGUMENT_PACK_SELECT tree node. */
10329 make_argument_pack_select (tree arg_pack
, unsigned index
)
10331 tree aps
= make_node (ARGUMENT_PACK_SELECT
);
10333 ARGUMENT_PACK_SELECT_FROM_PACK (aps
) = arg_pack
;
10334 ARGUMENT_PACK_SELECT_INDEX (aps
) = index
;
10339 /* This is a subroutine of tsubst_pack_expansion.
10341 It returns TRUE if we need to use the PACK_EXPANSION_EXTRA_ARGS
10342 mechanism to store the (non complete list of) arguments of the
10343 substitution and return a non substituted pack expansion, in order
10344 to wait for when we have enough arguments to really perform the
10348 use_pack_expansion_extra_args_p (tree parm_packs
,
10350 bool has_empty_arg
)
10352 /* If one pack has an expansion and another pack has a normal
10353 argument or if one pack has an empty argument and an another
10354 one hasn't then tsubst_pack_expansion cannot perform the
10355 substitution and need to fall back on the
10356 PACK_EXPANSION_EXTRA mechanism. */
10357 if (parm_packs
== NULL_TREE
)
10359 else if (has_empty_arg
)
10362 bool has_expansion_arg
= false;
10363 for (int i
= 0 ; i
< arg_pack_len
; ++i
)
10365 bool has_non_expansion_arg
= false;
10366 for (tree parm_pack
= parm_packs
;
10368 parm_pack
= TREE_CHAIN (parm_pack
))
10370 tree arg
= TREE_VALUE (parm_pack
);
10372 int exp
= argument_pack_element_is_expansion_p (arg
, i
);
10374 /* We can't substitute a pack expansion with extra args into
10378 has_expansion_arg
= true;
10380 has_non_expansion_arg
= true;
10383 if (has_expansion_arg
&& has_non_expansion_arg
)
10389 /* [temp.variadic]/6 says that:
10391 The instantiation of a pack expansion [...]
10392 produces a list E1,E2, ..., En, where N is the number of elements
10393 in the pack expansion parameters.
10395 This subroutine of tsubst_pack_expansion produces one of these Ei.
10397 PATTERN is the pattern of the pack expansion. PARM_PACKS is a
10398 TREE_LIST in which each TREE_PURPOSE is a parameter pack of
10399 PATTERN, and each TREE_VALUE is its corresponding argument pack.
10400 INDEX is the index 'i' of the element Ei to produce. ARGS,
10401 COMPLAIN, and IN_DECL are the same parameters as for the
10402 tsubst_pack_expansion function.
10404 The function returns the resulting Ei upon successful completion,
10405 or error_mark_node.
10407 Note that this function possibly modifies the ARGS parameter, so
10408 it's the responsibility of the caller to restore it. */
10411 gen_elem_of_pack_expansion_instantiation (tree pattern
,
10414 tree args
/* This parm gets
10416 tsubst_flags_t complain
,
10420 bool ith_elem_is_expansion
= false;
10422 /* For each parameter pack, change the substitution of the parameter
10423 pack to the ith argument in its argument pack, then expand the
10425 for (tree pack
= parm_packs
; pack
; pack
= TREE_CHAIN (pack
))
10427 tree parm
= TREE_PURPOSE (pack
);
10428 tree arg_pack
= TREE_VALUE (pack
);
10429 tree aps
; /* instance of ARGUMENT_PACK_SELECT. */
10431 ith_elem_is_expansion
|=
10432 argument_pack_element_is_expansion_p (arg_pack
, index
);
10434 /* Select the Ith argument from the pack. */
10435 if (TREE_CODE (parm
) == PARM_DECL
10436 || TREE_CODE (parm
) == FIELD_DECL
)
10440 aps
= make_argument_pack_select (arg_pack
, index
);
10441 if (!mark_used (parm
, complain
) && !(complain
& tf_error
))
10442 return error_mark_node
;
10443 register_local_specialization (aps
, parm
);
10446 aps
= retrieve_local_specialization (parm
);
10451 template_parm_level_and_index (parm
, &level
, &idx
);
10455 aps
= make_argument_pack_select (arg_pack
, index
);
10456 /* Update the corresponding argument. */
10457 TMPL_ARG (args
, level
, idx
) = aps
;
10460 /* Re-use the ARGUMENT_PACK_SELECT. */
10461 aps
= TMPL_ARG (args
, level
, idx
);
10463 ARGUMENT_PACK_SELECT_INDEX (aps
) = index
;
10466 /* Substitute into the PATTERN with the (possibly altered)
10468 if (pattern
== in_decl
)
10469 /* Expanding a fixed parameter pack from
10470 coerce_template_parameter_pack. */
10471 t
= tsubst_decl (pattern
, args
, complain
);
10472 else if (pattern
== error_mark_node
)
10473 t
= error_mark_node
;
10474 else if (constraint_p (pattern
))
10476 if (processing_template_decl
)
10477 t
= tsubst_constraint (pattern
, args
, complain
, in_decl
);
10479 t
= (constraints_satisfied_p (pattern
, args
)
10480 ? boolean_true_node
: boolean_false_node
);
10482 else if (!TYPE_P (pattern
))
10483 t
= tsubst_expr (pattern
, args
, complain
, in_decl
,
10484 /*integral_constant_expression_p=*/false);
10486 t
= tsubst (pattern
, args
, complain
, in_decl
);
10488 /* If the Ith argument pack element is a pack expansion, then
10489 the Ith element resulting from the substituting is going to
10490 be a pack expansion as well. */
10491 if (ith_elem_is_expansion
)
10492 t
= make_pack_expansion (t
);
10497 /* Substitute ARGS into T, which is an pack expansion
10498 (i.e. TYPE_PACK_EXPANSION or EXPR_PACK_EXPANSION). Returns a
10499 TREE_VEC with the substituted arguments, a PACK_EXPANSION_* node
10500 (if only a partial substitution could be performed) or
10501 ERROR_MARK_NODE if there was an error. */
10503 tsubst_pack_expansion (tree t
, tree args
, tsubst_flags_t complain
,
10507 tree pack
, packs
= NULL_TREE
;
10508 bool unsubstituted_packs
= false;
10511 hash_map
<tree
, tree
> *saved_local_specializations
= NULL
;
10512 bool need_local_specializations
= false;
10515 gcc_assert (PACK_EXPANSION_P (t
));
10516 pattern
= PACK_EXPANSION_PATTERN (t
);
10518 /* Add in any args remembered from an earlier partial instantiation. */
10519 args
= add_to_template_args (PACK_EXPANSION_EXTRA_ARGS (t
), args
);
10521 levels
= TMPL_ARGS_DEPTH (args
);
10523 /* Determine the argument packs that will instantiate the parameter
10524 packs used in the expansion expression. While we're at it,
10525 compute the number of arguments to be expanded and make sure it
10527 for (pack
= PACK_EXPANSION_PARAMETER_PACKS (t
); pack
;
10528 pack
= TREE_CHAIN (pack
))
10530 tree parm_pack
= TREE_VALUE (pack
);
10531 tree arg_pack
= NULL_TREE
;
10532 tree orig_arg
= NULL_TREE
;
10535 if (TREE_CODE (parm_pack
) == BASES
)
10537 if (BASES_DIRECT (parm_pack
))
10538 return calculate_direct_bases (tsubst_expr (BASES_TYPE (parm_pack
),
10539 args
, complain
, in_decl
, false));
10541 return calculate_bases (tsubst_expr (BASES_TYPE (parm_pack
),
10542 args
, complain
, in_decl
, false));
10544 if (TREE_CODE (parm_pack
) == PARM_DECL
)
10546 /* We know we have correct local_specializations if this
10547 expansion is at function scope, or if we're dealing with a
10548 local parameter in a requires expression; for the latter,
10549 tsubst_requires_expr set it up appropriately. */
10550 if (PACK_EXPANSION_LOCAL_P (t
) || CONSTRAINT_VAR_P (parm_pack
))
10551 arg_pack
= retrieve_local_specialization (parm_pack
);
10554 /* We can't rely on local_specializations for a parameter
10555 name used later in a function declaration (such as in a
10556 late-specified return type). Even if it exists, it might
10557 have the wrong value for a recursive call. Just make a
10558 dummy decl, since it's only used for its type. */
10559 arg_pack
= tsubst_decl (parm_pack
, args
, complain
);
10560 if (arg_pack
&& DECL_PACK_P (arg_pack
))
10561 /* Partial instantiation of the parm_pack, we can't build
10562 up an argument pack yet. */
10563 arg_pack
= NULL_TREE
;
10565 arg_pack
= make_fnparm_pack (arg_pack
);
10566 need_local_specializations
= true;
10569 else if (TREE_CODE (parm_pack
) == FIELD_DECL
)
10570 arg_pack
= tsubst_copy (parm_pack
, args
, complain
, in_decl
);
10574 template_parm_level_and_index (parm_pack
, &level
, &idx
);
10576 if (level
<= levels
)
10577 arg_pack
= TMPL_ARG (args
, level
, idx
);
10580 orig_arg
= arg_pack
;
10581 if (arg_pack
&& TREE_CODE (arg_pack
) == ARGUMENT_PACK_SELECT
)
10582 arg_pack
= ARGUMENT_PACK_SELECT_FROM_PACK (arg_pack
);
10584 if (arg_pack
&& !ARGUMENT_PACK_P (arg_pack
))
10585 /* This can only happen if we forget to expand an argument
10586 pack somewhere else. Just return an error, silently. */
10588 result
= make_tree_vec (1);
10589 TREE_VEC_ELT (result
, 0) = error_mark_node
;
10596 TREE_VEC_LENGTH (ARGUMENT_PACK_ARGS (arg_pack
));
10598 /* Don't bother trying to do a partial substitution with
10599 incomplete packs; we'll try again after deduction. */
10600 if (ARGUMENT_PACK_INCOMPLETE_P (arg_pack
))
10605 else if (len
!= my_len
)
10607 if (!(complain
& tf_error
))
10608 /* Fail quietly. */;
10609 else if (TREE_CODE (t
) == TYPE_PACK_EXPANSION
)
10610 error ("mismatched argument pack lengths while expanding "
10614 error ("mismatched argument pack lengths while expanding "
10617 return error_mark_node
;
10620 /* Keep track of the parameter packs and their corresponding
10622 packs
= tree_cons (parm_pack
, arg_pack
, packs
);
10623 TREE_TYPE (packs
) = orig_arg
;
10627 /* We can't substitute for this parameter pack. We use a flag as
10628 well as the missing_level counter because function parameter
10629 packs don't have a level. */
10630 unsubstituted_packs
= true;
10634 /* If the expansion is just T..., return the matching argument pack. */
10635 if (!unsubstituted_packs
10636 && TREE_PURPOSE (packs
) == pattern
)
10638 tree args
= ARGUMENT_PACK_ARGS (TREE_VALUE (packs
));
10639 if (TREE_CODE (t
) == TYPE_PACK_EXPANSION
10640 || pack_expansion_args_count (args
))
10642 /* Otherwise use the normal path so we get convert_from_reference. */
10645 /* We cannot expand this expansion expression, because we don't have
10646 all of the argument packs we need. */
10647 if (use_pack_expansion_extra_args_p (packs
, len
, unsubstituted_packs
))
10649 /* We got some full packs, but we can't substitute them in until we
10650 have values for all the packs. So remember these until then. */
10652 t
= make_pack_expansion (pattern
);
10653 PACK_EXPANSION_EXTRA_ARGS (t
) = args
;
10656 else if (unsubstituted_packs
)
10658 /* There were no real arguments, we're just replacing a parameter
10659 pack with another version of itself. Substitute into the
10660 pattern and return a PACK_EXPANSION_*. The caller will need to
10662 if (TREE_CODE (t
) == EXPR_PACK_EXPANSION
)
10663 t
= tsubst_expr (pattern
, args
, complain
, in_decl
,
10664 /*integral_constant_expression_p=*/false);
10666 t
= tsubst (pattern
, args
, complain
, in_decl
);
10667 t
= make_pack_expansion (t
);
10671 gcc_assert (len
>= 0);
10673 if (need_local_specializations
)
10675 /* We're in a late-specified return type, so create our own local
10676 specializations map; the current map is either NULL or (in the
10677 case of recursive unification) might have bindings that we don't
10678 want to use or alter. */
10679 saved_local_specializations
= local_specializations
;
10680 local_specializations
= new hash_map
<tree
, tree
>;
10683 /* For each argument in each argument pack, substitute into the
10685 result
= make_tree_vec (len
);
10686 for (i
= 0; i
< len
; ++i
)
10688 t
= gen_elem_of_pack_expansion_instantiation (pattern
, packs
,
10692 TREE_VEC_ELT (result
, i
) = t
;
10693 if (t
== error_mark_node
)
10695 result
= error_mark_node
;
10700 /* Update ARGS to restore the substitution from parameter packs to
10701 their argument packs. */
10702 for (pack
= packs
; pack
; pack
= TREE_CHAIN (pack
))
10704 tree parm
= TREE_PURPOSE (pack
);
10706 if (TREE_CODE (parm
) == PARM_DECL
10707 || TREE_CODE (parm
) == FIELD_DECL
)
10708 register_local_specialization (TREE_TYPE (pack
), parm
);
10713 if (TREE_VALUE (pack
) == NULL_TREE
)
10716 template_parm_level_and_index (parm
, &level
, &idx
);
10718 /* Update the corresponding argument. */
10719 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (args
))
10720 TREE_VEC_ELT (TREE_VEC_ELT (args
, level
-1 ), idx
) =
10723 TREE_VEC_ELT (args
, idx
) = TREE_TYPE (pack
);
10727 if (need_local_specializations
)
10729 delete local_specializations
;
10730 local_specializations
= saved_local_specializations
;
10736 /* Given PARM_DECL PARM, find the corresponding PARM_DECL in the template
10737 TMPL. We do this using DECL_PARM_INDEX, which should work even with
10738 parameter packs; all parms generated from a function parameter pack will
10739 have the same DECL_PARM_INDEX. */
10742 get_pattern_parm (tree parm
, tree tmpl
)
10744 tree pattern
= DECL_TEMPLATE_RESULT (tmpl
);
10747 if (DECL_ARTIFICIAL (parm
))
10749 for (patparm
= DECL_ARGUMENTS (pattern
);
10750 patparm
; patparm
= DECL_CHAIN (patparm
))
10751 if (DECL_ARTIFICIAL (patparm
)
10752 && DECL_NAME (parm
) == DECL_NAME (patparm
))
10757 patparm
= FUNCTION_FIRST_USER_PARM (DECL_TEMPLATE_RESULT (tmpl
));
10758 patparm
= chain_index (DECL_PARM_INDEX (parm
)-1, patparm
);
10759 gcc_assert (DECL_PARM_INDEX (patparm
)
10760 == DECL_PARM_INDEX (parm
));
10766 /* Substitute ARGS into the vector or list of template arguments T. */
10769 tsubst_template_args (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
10772 int len
, need_new
= 0, i
, expanded_len_adjust
= 0, out
;
10775 if (t
== error_mark_node
)
10776 return error_mark_node
;
10778 len
= TREE_VEC_LENGTH (t
);
10779 elts
= XALLOCAVEC (tree
, len
);
10781 for (i
= 0; i
< len
; i
++)
10783 tree orig_arg
= TREE_VEC_ELT (t
, i
);
10786 if (TREE_CODE (orig_arg
) == TREE_VEC
)
10787 new_arg
= tsubst_template_args (orig_arg
, args
, complain
, in_decl
);
10788 else if (PACK_EXPANSION_P (orig_arg
))
10790 /* Substitute into an expansion expression. */
10791 new_arg
= tsubst_pack_expansion (orig_arg
, args
, complain
, in_decl
);
10793 if (TREE_CODE (new_arg
) == TREE_VEC
)
10794 /* Add to the expanded length adjustment the number of
10795 expanded arguments. We subtract one from this
10796 measurement, because the argument pack expression
10797 itself is already counted as 1 in
10798 LEN. EXPANDED_LEN_ADJUST can actually be negative, if
10799 the argument pack is empty. */
10800 expanded_len_adjust
+= TREE_VEC_LENGTH (new_arg
) - 1;
10802 else if (ARGUMENT_PACK_P (orig_arg
))
10804 /* Substitute into each of the arguments. */
10805 new_arg
= TYPE_P (orig_arg
)
10806 ? cxx_make_type (TREE_CODE (orig_arg
))
10807 : make_node (TREE_CODE (orig_arg
));
10809 SET_ARGUMENT_PACK_ARGS (
10811 tsubst_template_args (ARGUMENT_PACK_ARGS (orig_arg
),
10812 args
, complain
, in_decl
));
10814 if (ARGUMENT_PACK_ARGS (new_arg
) == error_mark_node
)
10815 new_arg
= error_mark_node
;
10817 if (TREE_CODE (new_arg
) == NONTYPE_ARGUMENT_PACK
) {
10818 TREE_TYPE (new_arg
) = tsubst (TREE_TYPE (orig_arg
), args
,
10819 complain
, in_decl
);
10820 TREE_CONSTANT (new_arg
) = TREE_CONSTANT (orig_arg
);
10822 if (TREE_TYPE (new_arg
) == error_mark_node
)
10823 new_arg
= error_mark_node
;
10827 new_arg
= tsubst_template_arg (orig_arg
, args
, complain
, in_decl
);
10829 if (new_arg
== error_mark_node
)
10830 return error_mark_node
;
10833 if (new_arg
!= orig_arg
)
10840 /* Make space for the expanded arguments coming from template
10842 t
= make_tree_vec (len
+ expanded_len_adjust
);
10843 /* ORIG_T can contain TREE_VECs. That happens if ORIG_T contains the
10844 arguments for a member template.
10845 In that case each TREE_VEC in ORIG_T represents a level of template
10846 arguments, and ORIG_T won't carry any non defaulted argument count.
10847 It will rather be the nested TREE_VECs that will carry one.
10848 In other words, ORIG_T carries a non defaulted argument count only
10849 if it doesn't contain any nested TREE_VEC. */
10850 if (NON_DEFAULT_TEMPLATE_ARGS_COUNT (orig_t
))
10852 int count
= GET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (orig_t
);
10853 count
+= expanded_len_adjust
;
10854 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (t
, count
);
10856 for (i
= 0, out
= 0; i
< len
; i
++)
10858 if ((PACK_EXPANSION_P (TREE_VEC_ELT (orig_t
, i
))
10859 || ARGUMENT_PACK_P (TREE_VEC_ELT (orig_t
, i
)))
10860 && TREE_CODE (elts
[i
]) == TREE_VEC
)
10864 /* Now expand the template argument pack "in place". */
10865 for (idx
= 0; idx
< TREE_VEC_LENGTH (elts
[i
]); idx
++, out
++)
10866 TREE_VEC_ELT (t
, out
) = TREE_VEC_ELT (elts
[i
], idx
);
10870 TREE_VEC_ELT (t
, out
) = elts
[i
];
10878 /* Return the result of substituting ARGS into the template parameters
10879 given by PARMS. If there are m levels of ARGS and m + n levels of
10880 PARMS, then the result will contain n levels of PARMS. For
10881 example, if PARMS is `template <class T> template <class U>
10882 template <T*, U, class V>' and ARGS is {{int}, {double}} then the
10883 result will be `template <int*, double, class V>'. */
10886 tsubst_template_parms (tree parms
, tree args
, tsubst_flags_t complain
)
10888 tree r
= NULL_TREE
;
10891 /* When substituting into a template, we must set
10892 PROCESSING_TEMPLATE_DECL as the template parameters may be
10893 dependent if they are based on one-another, and the dependency
10894 predicates are short-circuit outside of templates. */
10895 ++processing_template_decl
;
10897 for (new_parms
= &r
;
10898 parms
&& TMPL_PARMS_DEPTH (parms
) > TMPL_ARGS_DEPTH (args
);
10899 new_parms
= &(TREE_CHAIN (*new_parms
)),
10900 parms
= TREE_CHAIN (parms
))
10903 make_tree_vec (TREE_VEC_LENGTH (TREE_VALUE (parms
)));
10906 for (i
= 0; i
< TREE_VEC_LENGTH (new_vec
); ++i
)
10910 if (parms
== error_mark_node
)
10913 tuple
= TREE_VEC_ELT (TREE_VALUE (parms
), i
);
10915 if (tuple
== error_mark_node
)
10918 TREE_VEC_ELT (new_vec
, i
) =
10919 tsubst_template_parm (tuple
, args
, complain
);
10923 tree_cons (size_int (TMPL_PARMS_DEPTH (parms
)
10924 - TMPL_ARGS_DEPTH (args
)),
10925 new_vec
, NULL_TREE
);
10928 --processing_template_decl
;
10933 /* Return the result of substituting ARGS into one template parameter
10934 given by T. T Must be a TREE_LIST which TREE_VALUE is the template
10935 parameter and which TREE_PURPOSE is the default argument of the
10936 template parameter. */
10939 tsubst_template_parm (tree t
, tree args
, tsubst_flags_t complain
)
10941 tree default_value
, parm_decl
;
10943 if (args
== NULL_TREE
10945 || t
== error_mark_node
)
10948 gcc_assert (TREE_CODE (t
) == TREE_LIST
);
10950 default_value
= TREE_PURPOSE (t
);
10951 parm_decl
= TREE_VALUE (t
);
10953 parm_decl
= tsubst (parm_decl
, args
, complain
, NULL_TREE
);
10954 if (TREE_CODE (parm_decl
) == PARM_DECL
10955 && invalid_nontype_parm_type_p (TREE_TYPE (parm_decl
), complain
))
10956 parm_decl
= error_mark_node
;
10957 default_value
= tsubst_template_arg (default_value
, args
,
10958 complain
, NULL_TREE
);
10960 return build_tree_list (default_value
, parm_decl
);
10963 /* Substitute the ARGS into the indicated aggregate (or enumeration)
10964 type T. If T is not an aggregate or enumeration type, it is
10965 handled as if by tsubst. IN_DECL is as for tsubst. If
10966 ENTERING_SCOPE is nonzero, T is the context for a template which
10967 we are presently tsubst'ing. Return the substituted value. */
10970 tsubst_aggr_type (tree t
,
10972 tsubst_flags_t complain
,
10974 int entering_scope
)
10976 if (t
== NULL_TREE
)
10979 switch (TREE_CODE (t
))
10982 if (TYPE_PTRMEMFUNC_P (t
))
10983 return tsubst (TYPE_PTRMEMFUNC_FN_TYPE (t
), args
, complain
, in_decl
);
10985 /* Else fall through. */
10986 case ENUMERAL_TYPE
:
10988 if (TYPE_TEMPLATE_INFO (t
) && uses_template_parms (t
))
10993 int saved_unevaluated_operand
;
10994 int saved_inhibit_evaluation_warnings
;
10996 /* In "sizeof(X<I>)" we need to evaluate "I". */
10997 saved_unevaluated_operand
= cp_unevaluated_operand
;
10998 cp_unevaluated_operand
= 0;
10999 saved_inhibit_evaluation_warnings
= c_inhibit_evaluation_warnings
;
11000 c_inhibit_evaluation_warnings
= 0;
11002 /* First, determine the context for the type we are looking
11004 context
= TYPE_CONTEXT (t
);
11005 if (context
&& TYPE_P (context
))
11007 context
= tsubst_aggr_type (context
, args
, complain
,
11008 in_decl
, /*entering_scope=*/1);
11009 /* If context is a nested class inside a class template,
11010 it may still need to be instantiated (c++/33959). */
11011 context
= complete_type (context
);
11014 /* Then, figure out what arguments are appropriate for the
11015 type we are trying to find. For example, given:
11017 template <class T> struct S;
11018 template <class T, class U> void f(T, U) { S<U> su; }
11020 and supposing that we are instantiating f<int, double>,
11021 then our ARGS will be {int, double}, but, when looking up
11022 S we only want {double}. */
11023 argvec
= tsubst_template_args (TYPE_TI_ARGS (t
), args
,
11024 complain
, in_decl
);
11025 if (argvec
== error_mark_node
)
11026 r
= error_mark_node
;
11029 r
= lookup_template_class (t
, argvec
, in_decl
, context
,
11030 entering_scope
, complain
);
11031 r
= cp_build_qualified_type_real (r
, cp_type_quals (t
), complain
);
11034 cp_unevaluated_operand
= saved_unevaluated_operand
;
11035 c_inhibit_evaluation_warnings
= saved_inhibit_evaluation_warnings
;
11040 /* This is not a template type, so there's nothing to do. */
11044 return tsubst (t
, args
, complain
, in_decl
);
11048 /* Substitute into the default argument ARG (a default argument for
11049 FN), which has the indicated TYPE. */
11052 tsubst_default_argument (tree fn
, tree type
, tree arg
, tsubst_flags_t complain
)
11054 tree saved_class_ptr
= NULL_TREE
;
11055 tree saved_class_ref
= NULL_TREE
;
11056 int errs
= errorcount
+ sorrycount
;
11058 /* This can happen in invalid code. */
11059 if (TREE_CODE (arg
) == DEFAULT_ARG
)
11062 /* This default argument came from a template. Instantiate the
11063 default argument here, not in tsubst. In the case of
11072 we must be careful to do name lookup in the scope of S<T>,
11073 rather than in the current class. */
11074 push_access_scope (fn
);
11075 /* The "this" pointer is not valid in a default argument. */
11078 saved_class_ptr
= current_class_ptr
;
11079 cp_function_chain
->x_current_class_ptr
= NULL_TREE
;
11080 saved_class_ref
= current_class_ref
;
11081 cp_function_chain
->x_current_class_ref
= NULL_TREE
;
11084 push_deferring_access_checks(dk_no_deferred
);
11085 /* The default argument expression may cause implicitly defined
11086 member functions to be synthesized, which will result in garbage
11087 collection. We must treat this situation as if we were within
11088 the body of function so as to avoid collecting live data on the
11091 arg
= tsubst_expr (arg
, DECL_TI_ARGS (fn
),
11092 complain
, NULL_TREE
,
11093 /*integral_constant_expression_p=*/false);
11095 pop_deferring_access_checks();
11097 /* Restore the "this" pointer. */
11100 cp_function_chain
->x_current_class_ptr
= saved_class_ptr
;
11101 cp_function_chain
->x_current_class_ref
= saved_class_ref
;
11104 if (errorcount
+sorrycount
> errs
11105 && (complain
& tf_warning_or_error
))
11106 inform (input_location
,
11107 " when instantiating default argument for call to %D", fn
);
11109 /* Make sure the default argument is reasonable. */
11110 arg
= check_default_argument (type
, arg
, complain
);
11112 pop_access_scope (fn
);
11117 /* Substitute into all the default arguments for FN. */
11120 tsubst_default_arguments (tree fn
, tsubst_flags_t complain
)
11125 tmpl_args
= DECL_TI_ARGS (fn
);
11127 /* If this function is not yet instantiated, we certainly don't need
11128 its default arguments. */
11129 if (uses_template_parms (tmpl_args
))
11131 /* Don't do this again for clones. */
11132 if (DECL_CLONED_FUNCTION_P (fn
))
11135 for (arg
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
11137 arg
= TREE_CHAIN (arg
))
11138 if (TREE_PURPOSE (arg
))
11139 TREE_PURPOSE (arg
) = tsubst_default_argument (fn
,
11141 TREE_PURPOSE (arg
),
11145 /* Substitute the ARGS into the T, which is a _DECL. Return the
11146 result of the substitution. Issue error and warning messages under
11147 control of COMPLAIN. */
11150 tsubst_decl (tree t
, tree args
, tsubst_flags_t complain
)
11152 #define RETURN(EXP) do { r = (EXP); goto out; } while(0)
11153 location_t saved_loc
;
11154 tree r
= NULL_TREE
;
11156 hashval_t hash
= 0;
11158 /* Set the filename and linenumber to improve error-reporting. */
11159 saved_loc
= input_location
;
11160 input_location
= DECL_SOURCE_LOCATION (t
);
11162 switch (TREE_CODE (t
))
11164 case TEMPLATE_DECL
:
11166 /* We can get here when processing a member function template,
11167 member class template, or template template parameter. */
11168 tree decl
= DECL_TEMPLATE_RESULT (t
);
11173 if (DECL_TEMPLATE_TEMPLATE_PARM_P (t
))
11175 /* Template template parameter is treated here. */
11176 tree new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
11177 if (new_type
== error_mark_node
)
11178 r
= error_mark_node
;
11179 /* If we get a real template back, return it. This can happen in
11180 the context of most_specialized_partial_spec. */
11181 else if (TREE_CODE (new_type
) == TEMPLATE_DECL
)
11184 /* The new TEMPLATE_DECL was built in
11185 reduce_template_parm_level. */
11186 r
= TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL (new_type
);
11190 /* We might already have an instance of this template.
11191 The ARGS are for the surrounding class type, so the
11192 full args contain the tsubst'd args for the context,
11193 plus the innermost args from the template decl. */
11194 tmpl_args
= DECL_CLASS_TEMPLATE_P (t
)
11195 ? CLASSTYPE_TI_ARGS (TREE_TYPE (t
))
11196 : DECL_TI_ARGS (DECL_TEMPLATE_RESULT (t
));
11197 /* Because this is a template, the arguments will still be
11198 dependent, even after substitution. If
11199 PROCESSING_TEMPLATE_DECL is not set, the dependency
11200 predicates will short-circuit. */
11201 ++processing_template_decl
;
11202 full_args
= tsubst_template_args (tmpl_args
, args
,
11203 complain
, in_decl
);
11204 --processing_template_decl
;
11205 if (full_args
== error_mark_node
)
11206 RETURN (error_mark_node
);
11208 /* If this is a default template template argument,
11209 tsubst might not have changed anything. */
11210 if (full_args
== tmpl_args
)
11213 hash
= hash_tmpl_and_args (t
, full_args
);
11214 spec
= retrieve_specialization (t
, full_args
, hash
);
11215 if (spec
!= NULL_TREE
)
11221 /* Make a new template decl. It will be similar to the
11222 original, but will record the current template arguments.
11223 We also create a new function declaration, which is just
11224 like the old one, but points to this new template, rather
11225 than the old one. */
11227 gcc_assert (DECL_LANG_SPECIFIC (r
) != 0);
11228 DECL_CHAIN (r
) = NULL_TREE
;
11230 // Build new template info linking to the original template decl.
11231 DECL_TEMPLATE_INFO (r
) = build_template_info (t
, args
);
11233 if (TREE_CODE (decl
) == TYPE_DECL
11234 && !TYPE_DECL_ALIAS_P (decl
))
11237 ++processing_template_decl
;
11238 new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
11239 --processing_template_decl
;
11240 if (new_type
== error_mark_node
)
11241 RETURN (error_mark_node
);
11243 TREE_TYPE (r
) = new_type
;
11244 /* For a partial specialization, we need to keep pointing to
11245 the primary template. */
11246 if (!DECL_TEMPLATE_SPECIALIZATION (t
))
11247 CLASSTYPE_TI_TEMPLATE (new_type
) = r
;
11248 DECL_TEMPLATE_RESULT (r
) = TYPE_MAIN_DECL (new_type
);
11249 DECL_TI_ARGS (r
) = CLASSTYPE_TI_ARGS (new_type
);
11250 DECL_CONTEXT (r
) = TYPE_CONTEXT (new_type
);
11255 ++processing_template_decl
;
11256 new_decl
= tsubst (decl
, args
, complain
, in_decl
);
11257 --processing_template_decl
;
11258 if (new_decl
== error_mark_node
)
11259 RETURN (error_mark_node
);
11261 DECL_TEMPLATE_RESULT (r
) = new_decl
;
11262 DECL_TI_TEMPLATE (new_decl
) = r
;
11263 TREE_TYPE (r
) = TREE_TYPE (new_decl
);
11264 DECL_TI_ARGS (r
) = DECL_TI_ARGS (new_decl
);
11265 DECL_CONTEXT (r
) = DECL_CONTEXT (new_decl
);
11268 SET_DECL_IMPLICIT_INSTANTIATION (r
);
11269 DECL_TEMPLATE_INSTANTIATIONS (r
) = NULL_TREE
;
11270 DECL_TEMPLATE_SPECIALIZATIONS (r
) = NULL_TREE
;
11272 /* The template parameters for this new template are all the
11273 template parameters for the old template, except the
11274 outermost level of parameters. */
11275 DECL_TEMPLATE_PARMS (r
)
11276 = tsubst_template_parms (DECL_TEMPLATE_PARMS (t
), args
,
11279 if (PRIMARY_TEMPLATE_P (t
))
11280 DECL_PRIMARY_TEMPLATE (r
) = r
;
11282 if (TREE_CODE (decl
) != TYPE_DECL
&& !VAR_P (decl
))
11283 /* Record this non-type partial instantiation. */
11284 register_specialization (r
, t
,
11285 DECL_TI_ARGS (DECL_TEMPLATE_RESULT (r
)),
11290 case FUNCTION_DECL
:
11293 tree argvec
= NULL_TREE
;
11301 /* Nobody should be tsubst'ing into non-template functions. */
11302 gcc_assert (DECL_TEMPLATE_INFO (t
) != NULL_TREE
);
11304 if (TREE_CODE (DECL_TI_TEMPLATE (t
)) == TEMPLATE_DECL
)
11309 /* If T is not dependent, just return it. We have to
11310 increment PROCESSING_TEMPLATE_DECL because
11311 value_dependent_expression_p assumes that nothing is
11312 dependent when PROCESSING_TEMPLATE_DECL is zero. */
11313 ++processing_template_decl
;
11314 dependent_p
= value_dependent_expression_p (t
);
11315 --processing_template_decl
;
11319 /* Calculate the most general template of which R is a
11320 specialization, and the complete set of arguments used to
11322 gen_tmpl
= most_general_template (DECL_TI_TEMPLATE (t
));
11323 argvec
= tsubst_template_args (DECL_TI_ARGS
11324 (DECL_TEMPLATE_RESULT
11325 (DECL_TI_TEMPLATE (t
))),
11326 args
, complain
, in_decl
);
11327 if (argvec
== error_mark_node
)
11328 RETURN (error_mark_node
);
11330 /* Check to see if we already have this specialization. */
11331 hash
= hash_tmpl_and_args (gen_tmpl
, argvec
);
11332 spec
= retrieve_specialization (gen_tmpl
, argvec
, hash
);
11340 /* We can see more levels of arguments than parameters if
11341 there was a specialization of a member template, like
11344 template <class T> struct S { template <class U> void f(); }
11345 template <> template <class U> void S<int>::f(U);
11347 Here, we'll be substituting into the specialization,
11348 because that's where we can find the code we actually
11349 want to generate, but we'll have enough arguments for
11350 the most general template.
11352 We also deal with the peculiar case:
11354 template <class T> struct S {
11355 template <class U> friend void f();
11357 template <class U> void f() {}
11359 template void f<double>();
11361 Here, the ARGS for the instantiation of will be {int,
11362 double}. But, we only need as many ARGS as there are
11363 levels of template parameters in CODE_PATTERN. We are
11364 careful not to get fooled into reducing the ARGS in
11367 template <class T> struct S { template <class U> void f(U); }
11368 template <class T> template <> void S<T>::f(int) {}
11370 which we can spot because the pattern will be a
11371 specialization in this case. */
11372 args_depth
= TMPL_ARGS_DEPTH (args
);
11374 TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (DECL_TI_TEMPLATE (t
)));
11375 if (args_depth
> parms_depth
11376 && !DECL_TEMPLATE_SPECIALIZATION (t
))
11377 args
= get_innermost_template_args (args
, parms_depth
);
11381 /* This special case arises when we have something like this:
11383 template <class T> struct S {
11384 friend void f<int>(int, double);
11387 Here, the DECL_TI_TEMPLATE for the friend declaration
11388 will be an IDENTIFIER_NODE. We are being called from
11389 tsubst_friend_function, and we want only to create a
11390 new decl (R) with appropriate types so that we can call
11391 determine_specialization. */
11392 gen_tmpl
= NULL_TREE
;
11395 if (DECL_CLASS_SCOPE_P (t
))
11397 if (DECL_NAME (t
) == constructor_name (DECL_CONTEXT (t
)))
11401 ctx
= tsubst_aggr_type (DECL_CONTEXT (t
), args
,
11402 complain
, t
, /*entering_scope=*/1);
11407 ctx
= DECL_CONTEXT (t
);
11409 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
11410 if (type
== error_mark_node
)
11411 RETURN (error_mark_node
);
11413 /* If we hit excessive deduction depth, the type is bogus even if
11414 it isn't error_mark_node, so don't build a decl. */
11415 if (excessive_deduction_depth
)
11416 RETURN (error_mark_node
);
11418 /* We do NOT check for matching decls pushed separately at this
11419 point, as they may not represent instantiations of this
11420 template, and in any case are considered separate under the
11423 DECL_USE_TEMPLATE (r
) = 0;
11424 TREE_TYPE (r
) = type
;
11425 /* Clear out the mangled name and RTL for the instantiation. */
11426 SET_DECL_ASSEMBLER_NAME (r
, NULL_TREE
);
11427 SET_DECL_RTL (r
, NULL
);
11428 /* Leave DECL_INITIAL set on deleted instantiations. */
11429 if (!DECL_DELETED_FN (r
))
11430 DECL_INITIAL (r
) = NULL_TREE
;
11431 DECL_CONTEXT (r
) = ctx
;
11433 /* OpenMP UDRs have the only argument a reference to the declared
11434 type. We want to diagnose if the declared type is a reference,
11435 which is invalid, but as references to references are usually
11436 quietly merged, diagnose it here. */
11437 if (DECL_OMP_DECLARE_REDUCTION_P (t
))
11440 = TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (t
))));
11441 argtype
= tsubst (argtype
, args
, complain
, in_decl
);
11442 if (TREE_CODE (argtype
) == REFERENCE_TYPE
)
11443 error_at (DECL_SOURCE_LOCATION (t
),
11444 "reference type %qT in "
11445 "%<#pragma omp declare reduction%>", argtype
);
11446 if (strchr (IDENTIFIER_POINTER (DECL_NAME (t
)), '~') == NULL
)
11447 DECL_NAME (r
) = omp_reduction_id (ERROR_MARK
, DECL_NAME (t
),
11451 if (member
&& DECL_CONV_FN_P (r
))
11452 /* Type-conversion operator. Reconstruct the name, in
11453 case it's the name of one of the template's parameters. */
11454 DECL_NAME (r
) = mangle_conv_op_name_for_type (TREE_TYPE (type
));
11456 DECL_ARGUMENTS (r
) = tsubst (DECL_ARGUMENTS (t
), args
,
11458 DECL_RESULT (r
) = NULL_TREE
;
11460 TREE_STATIC (r
) = 0;
11461 TREE_PUBLIC (r
) = TREE_PUBLIC (t
);
11462 DECL_EXTERNAL (r
) = 1;
11463 /* If this is an instantiation of a function with internal
11464 linkage, we already know what object file linkage will be
11465 assigned to the instantiation. */
11466 DECL_INTERFACE_KNOWN (r
) = !TREE_PUBLIC (r
);
11467 DECL_DEFER_OUTPUT (r
) = 0;
11468 DECL_CHAIN (r
) = NULL_TREE
;
11469 DECL_PENDING_INLINE_INFO (r
) = 0;
11470 DECL_PENDING_INLINE_P (r
) = 0;
11471 DECL_SAVED_TREE (r
) = NULL_TREE
;
11472 DECL_STRUCT_FUNCTION (r
) = NULL
;
11474 /* We'll re-clone as appropriate in instantiate_template. */
11475 DECL_CLONED_FUNCTION (r
) = NULL_TREE
;
11477 /* If we aren't complaining now, return on error before we register
11478 the specialization so that we'll complain eventually. */
11479 if ((complain
& tf_error
) == 0
11480 && IDENTIFIER_OPNAME_P (DECL_NAME (r
))
11481 && !grok_op_properties (r
, /*complain=*/false))
11482 RETURN (error_mark_node
);
11484 /* When instantiating a constrained member, substitute
11485 into the constraints to create a new constraint. */
11486 if (tree ci
= get_constraints (t
))
11489 ci
= tsubst_constraint_info (ci
, argvec
, complain
, NULL_TREE
);
11490 set_constraints (r
, ci
);
11493 /* Set up the DECL_TEMPLATE_INFO for R. There's no need to do
11494 this in the special friend case mentioned above where
11495 GEN_TMPL is NULL. */
11498 DECL_TEMPLATE_INFO (r
)
11499 = build_template_info (gen_tmpl
, argvec
);
11500 SET_DECL_IMPLICIT_INSTANTIATION (r
);
11503 = register_specialization (r
, gen_tmpl
, argvec
, false, hash
);
11505 /* We instantiated this while substituting into
11506 the type earlier (template/friend54.C). */
11509 /* We're not supposed to instantiate default arguments
11510 until they are called, for a template. But, for a
11513 template <class T> void f ()
11514 { extern void g(int i = T()); }
11516 we should do the substitution when the template is
11517 instantiated. We handle the member function case in
11518 instantiate_class_template since the default arguments
11519 might refer to other members of the class. */
11521 && !PRIMARY_TEMPLATE_P (gen_tmpl
)
11522 && !uses_template_parms (argvec
))
11523 tsubst_default_arguments (r
, complain
);
11526 DECL_TEMPLATE_INFO (r
) = NULL_TREE
;
11528 /* Copy the list of befriending classes. */
11529 for (friends
= &DECL_BEFRIENDING_CLASSES (r
);
11531 friends
= &TREE_CHAIN (*friends
))
11533 *friends
= copy_node (*friends
);
11534 TREE_VALUE (*friends
) = tsubst (TREE_VALUE (*friends
),
11539 if (DECL_CONSTRUCTOR_P (r
) || DECL_DESTRUCTOR_P (r
))
11541 maybe_retrofit_in_chrg (r
);
11542 if (DECL_CONSTRUCTOR_P (r
))
11543 grok_ctor_properties (ctx
, r
);
11544 if (DECL_INHERITED_CTOR_BASE (r
))
11545 deduce_inheriting_ctor (r
);
11546 /* If this is an instantiation of a member template, clone it.
11547 If it isn't, that'll be handled by
11548 clone_constructors_and_destructors. */
11549 if (PRIMARY_TEMPLATE_P (gen_tmpl
))
11550 clone_function_decl (r
, /*update_method_vec_p=*/0);
11552 else if ((complain
& tf_error
) != 0
11553 && IDENTIFIER_OPNAME_P (DECL_NAME (r
))
11554 && !grok_op_properties (r
, /*complain=*/true))
11555 RETURN (error_mark_node
);
11557 if (DECL_FRIEND_P (t
) && DECL_FRIEND_CONTEXT (t
))
11558 SET_DECL_FRIEND_CONTEXT (r
,
11559 tsubst (DECL_FRIEND_CONTEXT (t
),
11560 args
, complain
, in_decl
));
11562 /* Possibly limit visibility based on template args. */
11563 DECL_VISIBILITY (r
) = VISIBILITY_DEFAULT
;
11564 if (DECL_VISIBILITY_SPECIFIED (t
))
11566 DECL_VISIBILITY_SPECIFIED (r
) = 0;
11567 DECL_ATTRIBUTES (r
)
11568 = remove_attribute ("visibility", DECL_ATTRIBUTES (r
));
11570 determine_visibility (r
);
11571 if (DECL_DEFAULTED_OUTSIDE_CLASS_P (r
)
11572 && !processing_template_decl
)
11573 defaulted_late_check (r
);
11575 apply_late_template_attributes (&r
, DECL_ATTRIBUTES (r
), 0,
11576 args
, complain
, in_decl
);
11582 tree type
= NULL_TREE
;
11584 tree expanded_types
= NULL_TREE
;
11585 tree prev_r
= NULL_TREE
;
11586 tree first_r
= NULL_TREE
;
11588 if (DECL_PACK_P (t
))
11590 /* If there is a local specialization that isn't a
11591 parameter pack, it means that we're doing a "simple"
11592 substitution from inside tsubst_pack_expansion. Just
11593 return the local specialization (which will be a single
11595 tree spec
= retrieve_local_specialization (t
);
11597 && TREE_CODE (spec
) == PARM_DECL
11598 && TREE_CODE (TREE_TYPE (spec
)) != TYPE_PACK_EXPANSION
)
11601 /* Expand the TYPE_PACK_EXPANSION that provides the types for
11602 the parameters in this function parameter pack. */
11603 expanded_types
= tsubst_pack_expansion (TREE_TYPE (t
), args
,
11604 complain
, in_decl
);
11605 if (TREE_CODE (expanded_types
) == TREE_VEC
)
11607 len
= TREE_VEC_LENGTH (expanded_types
);
11609 /* Zero-length parameter packs are boring. Just substitute
11612 RETURN (tsubst (TREE_CHAIN (t
), args
, complain
,
11617 /* All we did was update the type. Make a note of that. */
11618 type
= expanded_types
;
11619 expanded_types
= NULL_TREE
;
11623 /* Loop through all of the parameters we'll build. When T is
11624 a function parameter pack, LEN is the number of expanded
11625 types in EXPANDED_TYPES; otherwise, LEN is 1. */
11627 for (i
= 0; i
< len
; ++i
)
11631 if (DECL_TEMPLATE_PARM_P (t
))
11632 SET_DECL_TEMPLATE_PARM_P (r
);
11634 if (expanded_types
)
11635 /* We're on the Ith parameter of the function parameter
11638 /* Get the Ith type. */
11639 type
= TREE_VEC_ELT (expanded_types
, i
);
11641 /* Rename the parameter to include the index. */
11643 = make_ith_pack_parameter_name (DECL_NAME (r
), i
);
11646 /* We're dealing with a normal parameter. */
11647 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
11649 type
= type_decays_to (type
);
11650 TREE_TYPE (r
) = type
;
11651 cp_apply_type_quals_to_decl (cp_type_quals (type
), r
);
11653 if (DECL_INITIAL (r
))
11655 if (TREE_CODE (DECL_INITIAL (r
)) != TEMPLATE_PARM_INDEX
)
11656 DECL_INITIAL (r
) = TREE_TYPE (r
);
11658 DECL_INITIAL (r
) = tsubst (DECL_INITIAL (r
), args
,
11659 complain
, in_decl
);
11662 DECL_CONTEXT (r
) = NULL_TREE
;
11664 if (!DECL_TEMPLATE_PARM_P (r
))
11665 DECL_ARG_TYPE (r
) = type_passed_as (type
);
11667 apply_late_template_attributes (&r
, DECL_ATTRIBUTES (r
), 0,
11668 args
, complain
, in_decl
);
11670 /* Keep track of the first new parameter we
11671 generate. That's what will be returned to the
11676 /* Build a proper chain of parameters when substituting
11677 into a function parameter pack. */
11679 DECL_CHAIN (prev_r
) = r
;
11682 /* If cp_unevaluated_operand is set, we're just looking for a
11683 single dummy parameter, so don't keep going. */
11684 if (DECL_CHAIN (t
) && !cp_unevaluated_operand
)
11685 DECL_CHAIN (r
) = tsubst (DECL_CHAIN (t
), args
,
11686 complain
, DECL_CHAIN (t
));
11688 /* FIRST_R contains the start of the chain we've built. */
11695 tree type
= NULL_TREE
;
11696 tree vec
= NULL_TREE
;
11697 tree expanded_types
= NULL_TREE
;
11700 if (PACK_EXPANSION_P (TREE_TYPE (t
)))
11702 /* This field is a lambda capture pack. Return a TREE_VEC of
11703 the expanded fields to instantiate_class_template_1 and
11704 store them in the specializations hash table as a
11705 NONTYPE_ARGUMENT_PACK so that tsubst_copy can find them. */
11706 expanded_types
= tsubst_pack_expansion (TREE_TYPE (t
), args
,
11707 complain
, in_decl
);
11708 if (TREE_CODE (expanded_types
) == TREE_VEC
)
11710 len
= TREE_VEC_LENGTH (expanded_types
);
11711 vec
= make_tree_vec (len
);
11715 /* All we did was update the type. Make a note of that. */
11716 type
= expanded_types
;
11717 expanded_types
= NULL_TREE
;
11721 for (int i
= 0; i
< len
; ++i
)
11724 if (expanded_types
)
11726 type
= TREE_VEC_ELT (expanded_types
, i
);
11728 = make_ith_pack_parameter_name (DECL_NAME (r
), i
);
11731 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
11733 if (type
== error_mark_node
)
11734 RETURN (error_mark_node
);
11735 TREE_TYPE (r
) = type
;
11736 cp_apply_type_quals_to_decl (cp_type_quals (type
), r
);
11738 if (DECL_C_BIT_FIELD (r
))
11739 /* For bit-fields, DECL_INITIAL gives the number of bits. For
11740 non-bit-fields DECL_INITIAL is a non-static data member
11741 initializer, which gets deferred instantiation. */
11743 = tsubst_expr (DECL_INITIAL (t
), args
,
11745 /*integral_constant_expression_p=*/true);
11746 else if (DECL_INITIAL (t
))
11748 /* Set up DECL_TEMPLATE_INFO so that we can get at the
11749 NSDMI in perform_member_init. Still set DECL_INITIAL
11750 so that we know there is one. */
11751 DECL_INITIAL (r
) = void_node
;
11752 gcc_assert (DECL_LANG_SPECIFIC (r
) == NULL
);
11753 retrofit_lang_decl (r
);
11754 DECL_TEMPLATE_INFO (r
) = build_template_info (t
, args
);
11756 /* We don't have to set DECL_CONTEXT here; it is set by
11757 finish_member_declaration. */
11758 DECL_CHAIN (r
) = NULL_TREE
;
11760 apply_late_template_attributes (&r
, DECL_ATTRIBUTES (r
), 0,
11761 args
, complain
, in_decl
);
11764 TREE_VEC_ELT (vec
, i
) = r
;
11770 tree pack
= make_node (NONTYPE_ARGUMENT_PACK
);
11771 tree tpack
= cxx_make_type (TYPE_ARGUMENT_PACK
);
11772 SET_ARGUMENT_PACK_ARGS (pack
, vec
);
11773 SET_ARGUMENT_PACK_ARGS (tpack
, expanded_types
);
11774 TREE_TYPE (pack
) = tpack
;
11775 register_specialization (pack
, t
, args
, false, 0);
11781 /* We reach here only for member using decls. We also need to check
11782 uses_template_parms because DECL_DEPENDENT_P is not set for a
11783 using-declaration that designates a member of the current
11784 instantiation (c++/53549). */
11785 if (DECL_DEPENDENT_P (t
)
11786 || uses_template_parms (USING_DECL_SCOPE (t
)))
11788 tree inst_scope
= tsubst_copy (USING_DECL_SCOPE (t
), args
,
11789 complain
, in_decl
);
11790 tree name
= tsubst_copy (DECL_NAME (t
), args
, complain
, in_decl
);
11791 r
= do_class_using_decl (inst_scope
, name
);
11793 r
= error_mark_node
;
11796 TREE_PROTECTED (r
) = TREE_PROTECTED (t
);
11797 TREE_PRIVATE (r
) = TREE_PRIVATE (t
);
11803 DECL_CHAIN (r
) = NULL_TREE
;
11810 tree argvec
= NULL_TREE
;
11811 tree gen_tmpl
= NULL_TREE
;
11813 tree tmpl
= NULL_TREE
;
11815 tree type
= NULL_TREE
;
11818 if (TREE_TYPE (t
) == error_mark_node
)
11819 RETURN (error_mark_node
);
11821 if (TREE_CODE (t
) == TYPE_DECL
11822 && t
== TYPE_MAIN_DECL (TREE_TYPE (t
)))
11824 /* If this is the canonical decl, we don't have to
11825 mess with instantiations, and often we can't (for
11826 typename, template type parms and such). Note that
11827 TYPE_NAME is not correct for the above test if
11828 we've copied the type for a typedef. */
11829 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
11830 if (type
== error_mark_node
)
11831 RETURN (error_mark_node
);
11832 r
= TYPE_NAME (type
);
11836 /* Check to see if we already have the specialization we
11839 if (DECL_CLASS_SCOPE_P (t
) || DECL_NAMESPACE_SCOPE_P (t
))
11841 /* T is a static data member or namespace-scope entity.
11842 We have to substitute into namespace-scope variables
11843 (not just variable templates) because of cases like:
11845 template <class T> void f() { extern T t; }
11847 where the entity referenced is not known until
11848 instantiation time. */
11850 ctx
= DECL_CONTEXT (t
);
11851 if (DECL_CLASS_SCOPE_P (t
))
11853 ctx
= tsubst_aggr_type (ctx
, args
,
11855 in_decl
, /*entering_scope=*/1);
11856 /* If CTX is unchanged, then T is in fact the
11857 specialization we want. That situation occurs when
11858 referencing a static data member within in its own
11859 class. We can use pointer equality, rather than
11860 same_type_p, because DECL_CONTEXT is always
11862 if (ctx
== DECL_CONTEXT (t
)
11863 /* ... unless T is a member template; in which
11864 case our caller can be willing to create a
11865 specialization of that template represented
11867 && !(DECL_TI_TEMPLATE (t
)
11868 && DECL_MEMBER_TEMPLATE_P (DECL_TI_TEMPLATE (t
))))
11874 tmpl
= DECL_TI_TEMPLATE (t
);
11875 gen_tmpl
= most_general_template (tmpl
);
11876 argvec
= tsubst (DECL_TI_ARGS (t
), args
, complain
, in_decl
);
11877 if (argvec
!= error_mark_node
)
11878 argvec
= (coerce_innermost_template_parms
11879 (DECL_TEMPLATE_PARMS (gen_tmpl
),
11880 argvec
, t
, complain
,
11881 /*all*/true, /*defarg*/true));
11882 if (argvec
== error_mark_node
)
11883 RETURN (error_mark_node
);
11884 hash
= hash_tmpl_and_args (gen_tmpl
, argvec
);
11885 spec
= retrieve_specialization (gen_tmpl
, argvec
, hash
);
11890 /* A local variable. */
11892 /* Subsequent calls to pushdecl will fill this in. */
11894 spec
= retrieve_local_specialization (t
);
11896 /* If we already have the specialization we need, there is
11897 nothing more to do. */
11904 /* Create a new node for the specialization we need. */
11906 if (type
== NULL_TREE
)
11908 if (is_typedef_decl (t
))
11909 type
= DECL_ORIGINAL_TYPE (t
);
11911 type
= TREE_TYPE (t
);
11913 && VAR_HAD_UNKNOWN_BOUND (t
)
11914 && type
!= error_mark_node
)
11915 type
= strip_array_domain (type
);
11916 type
= tsubst (type
, args
, complain
, in_decl
);
11920 /* Even if the original location is out of scope, the
11921 newly substituted one is not. */
11922 DECL_DEAD_FOR_LOCAL (r
) = 0;
11923 DECL_INITIALIZED_P (r
) = 0;
11924 DECL_TEMPLATE_INSTANTIATED (r
) = 0;
11925 if (type
== error_mark_node
)
11926 RETURN (error_mark_node
);
11927 if (TREE_CODE (type
) == FUNCTION_TYPE
)
11929 /* It may seem that this case cannot occur, since:
11934 declares a function, not a variable. However:
11937 template <typename T> void g() { T t; }
11938 template void g<f>();
11940 is an attempt to declare a variable with function
11942 error ("variable %qD has function type",
11943 /* R is not yet sufficiently initialized, so we
11944 just use its name. */
11946 RETURN (error_mark_node
);
11948 type
= complete_type (type
);
11949 /* Wait until cp_finish_decl to set this again, to handle
11950 circular dependency (template/instantiate6.C). */
11951 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (r
) = 0;
11952 type
= check_var_type (DECL_NAME (r
), type
);
11954 if (DECL_HAS_VALUE_EXPR_P (t
))
11956 tree ve
= DECL_VALUE_EXPR (t
);
11957 ve
= tsubst_expr (ve
, args
, complain
, in_decl
,
11958 /*constant_expression_p=*/false);
11959 if (REFERENCE_REF_P (ve
))
11961 gcc_assert (TREE_CODE (type
) == REFERENCE_TYPE
);
11962 ve
= TREE_OPERAND (ve
, 0);
11964 SET_DECL_VALUE_EXPR (r
, ve
);
11966 if (CP_DECL_THREAD_LOCAL_P (r
)
11967 && !processing_template_decl
)
11968 set_decl_tls_model (r
, decl_default_tls_model (r
));
11970 else if (DECL_SELF_REFERENCE_P (t
))
11971 SET_DECL_SELF_REFERENCE_P (r
);
11972 TREE_TYPE (r
) = type
;
11973 cp_apply_type_quals_to_decl (cp_type_quals (type
), r
);
11974 DECL_CONTEXT (r
) = ctx
;
11975 /* Clear out the mangled name and RTL for the instantiation. */
11976 SET_DECL_ASSEMBLER_NAME (r
, NULL_TREE
);
11977 if (CODE_CONTAINS_STRUCT (TREE_CODE (t
), TS_DECL_WRTL
))
11978 SET_DECL_RTL (r
, NULL
);
11979 /* The initializer must not be expanded until it is required;
11980 see [temp.inst]. */
11981 DECL_INITIAL (r
) = NULL_TREE
;
11982 if (CODE_CONTAINS_STRUCT (TREE_CODE (t
), TS_DECL_WRTL
))
11983 SET_DECL_RTL (r
, NULL
);
11984 DECL_SIZE (r
) = DECL_SIZE_UNIT (r
) = 0;
11987 /* Possibly limit visibility based on template args. */
11988 DECL_VISIBILITY (r
) = VISIBILITY_DEFAULT
;
11989 if (DECL_VISIBILITY_SPECIFIED (t
))
11991 DECL_VISIBILITY_SPECIFIED (r
) = 0;
11992 DECL_ATTRIBUTES (r
)
11993 = remove_attribute ("visibility", DECL_ATTRIBUTES (r
));
11995 determine_visibility (r
);
12000 /* A static data member declaration is always marked
12001 external when it is declared in-class, even if an
12002 initializer is present. We mimic the non-template
12003 processing here. */
12004 DECL_EXTERNAL (r
) = 1;
12005 if (DECL_NAMESPACE_SCOPE_P (t
))
12006 DECL_NOT_REALLY_EXTERN (r
) = 1;
12008 DECL_TEMPLATE_INFO (r
) = build_template_info (tmpl
, argvec
);
12009 SET_DECL_IMPLICIT_INSTANTIATION (r
);
12010 register_specialization (r
, gen_tmpl
, argvec
, false, hash
);
12012 else if (!cp_unevaluated_operand
)
12013 register_local_specialization (r
, t
);
12015 DECL_CHAIN (r
) = NULL_TREE
;
12017 apply_late_template_attributes (&r
, DECL_ATTRIBUTES (r
),
12019 args
, complain
, in_decl
);
12021 /* Preserve a typedef that names a type. */
12022 if (is_typedef_decl (r
))
12024 DECL_ORIGINAL_TYPE (r
) = NULL_TREE
;
12025 set_underlying_type (r
);
12026 if (TYPE_DECL_ALIAS_P (r
) && type
!= error_mark_node
)
12027 /* An alias template specialization can be dependent
12028 even if its underlying type is not. */
12029 TYPE_DEPENDENT_P_VALID (TREE_TYPE (r
)) = false;
12032 layout_decl (r
, 0);
12037 gcc_unreachable ();
12042 /* Restore the file and line information. */
12043 input_location
= saved_loc
;
12048 /* Substitute into the ARG_TYPES of a function type.
12049 If END is a TREE_CHAIN, leave it and any following types
12053 tsubst_arg_types (tree arg_types
,
12056 tsubst_flags_t complain
,
12059 tree remaining_arg_types
;
12060 tree type
= NULL_TREE
;
12062 tree expanded_args
= NULL_TREE
;
12065 if (!arg_types
|| arg_types
== void_list_node
|| arg_types
== end
)
12068 remaining_arg_types
= tsubst_arg_types (TREE_CHAIN (arg_types
),
12069 args
, end
, complain
, in_decl
);
12070 if (remaining_arg_types
== error_mark_node
)
12071 return error_mark_node
;
12073 if (PACK_EXPANSION_P (TREE_VALUE (arg_types
)))
12075 /* For a pack expansion, perform substitution on the
12076 entire expression. Later on, we'll handle the arguments
12078 expanded_args
= tsubst_pack_expansion (TREE_VALUE (arg_types
),
12079 args
, complain
, in_decl
);
12081 if (TREE_CODE (expanded_args
) == TREE_VEC
)
12082 /* So that we'll spin through the parameters, one by one. */
12083 i
= TREE_VEC_LENGTH (expanded_args
);
12086 /* We only partially substituted into the parameter
12087 pack. Our type is TYPE_PACK_EXPANSION. */
12088 type
= expanded_args
;
12089 expanded_args
= NULL_TREE
;
12097 type
= TREE_VEC_ELT (expanded_args
, i
);
12099 type
= tsubst (TREE_VALUE (arg_types
), args
, complain
, in_decl
);
12101 if (type
== error_mark_node
)
12102 return error_mark_node
;
12103 if (VOID_TYPE_P (type
))
12105 if (complain
& tf_error
)
12107 error ("invalid parameter type %qT", type
);
12109 error ("in declaration %q+D", in_decl
);
12111 return error_mark_node
;
12114 if (abstract_virtuals_error_sfinae (ACU_PARM
, type
, complain
))
12115 return error_mark_node
;
12117 /* Do array-to-pointer, function-to-pointer conversion, and ignore
12118 top-level qualifiers as required. */
12119 type
= cv_unqualified (type_decays_to (type
));
12121 /* We do not substitute into default arguments here. The standard
12122 mandates that they be instantiated only when needed, which is
12123 done in build_over_call. */
12124 default_arg
= TREE_PURPOSE (arg_types
);
12126 if (default_arg
&& TREE_CODE (default_arg
) == DEFAULT_ARG
)
12128 /* We've instantiated a template before its default arguments
12129 have been parsed. This can happen for a nested template
12130 class, and is not an error unless we require the default
12131 argument in a call of this function. */
12132 remaining_arg_types
=
12133 tree_cons (default_arg
, type
, remaining_arg_types
);
12134 vec_safe_push (DEFARG_INSTANTIATIONS(default_arg
), remaining_arg_types
);
12137 remaining_arg_types
=
12138 hash_tree_cons (default_arg
, type
, remaining_arg_types
);
12141 return remaining_arg_types
;
12144 /* Substitute into a FUNCTION_TYPE or METHOD_TYPE. This routine does
12145 *not* handle the exception-specification for FNTYPE, because the
12146 initial substitution of explicitly provided template parameters
12147 during argument deduction forbids substitution into the
12148 exception-specification:
12152 All references in the function type of the function template to the
12153 corresponding template parameters are replaced by the specified tem-
12154 plate argument values. If a substitution in a template parameter or
12155 in the function type of the function template results in an invalid
12156 type, type deduction fails. [Note: The equivalent substitution in
12157 exception specifications is done only when the function is instanti-
12158 ated, at which point a program is ill-formed if the substitution
12159 results in an invalid type.] */
12162 tsubst_function_type (tree t
,
12164 tsubst_flags_t complain
,
12168 tree arg_types
= NULL_TREE
;
12171 /* The TYPE_CONTEXT is not used for function/method types. */
12172 gcc_assert (TYPE_CONTEXT (t
) == NULL_TREE
);
12174 /* DR 1227: Mixing immediate and non-immediate contexts in deduction
12176 bool late_return_type_p
= TYPE_HAS_LATE_RETURN_TYPE (t
);
12178 if (late_return_type_p
)
12180 /* Substitute the argument types. */
12181 arg_types
= tsubst_arg_types (TYPE_ARG_TYPES (t
), args
, NULL_TREE
,
12182 complain
, in_decl
);
12183 if (arg_types
== error_mark_node
)
12184 return error_mark_node
;
12186 tree save_ccp
= current_class_ptr
;
12187 tree save_ccr
= current_class_ref
;
12188 tree this_type
= (TREE_CODE (t
) == METHOD_TYPE
12189 ? TREE_TYPE (TREE_VALUE (arg_types
)) : NULL_TREE
);
12190 bool do_inject
= this_type
&& CLASS_TYPE_P (this_type
);
12193 /* DR 1207: 'this' is in scope in the trailing return type. */
12194 inject_this_parameter (this_type
, cp_type_quals (this_type
));
12197 /* Substitute the return type. */
12198 return_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
12202 current_class_ptr
= save_ccp
;
12203 current_class_ref
= save_ccr
;
12207 /* Substitute the return type. */
12208 return_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
12210 if (return_type
== error_mark_node
)
12211 return error_mark_node
;
12212 /* DR 486 clarifies that creation of a function type with an
12213 invalid return type is a deduction failure. */
12214 if (TREE_CODE (return_type
) == ARRAY_TYPE
12215 || TREE_CODE (return_type
) == FUNCTION_TYPE
)
12217 if (complain
& tf_error
)
12219 if (TREE_CODE (return_type
) == ARRAY_TYPE
)
12220 error ("function returning an array");
12222 error ("function returning a function");
12224 return error_mark_node
;
12227 if (abstract_virtuals_error_sfinae (ACU_RETURN
, return_type
, complain
))
12228 return error_mark_node
;
12230 if (!late_return_type_p
)
12232 /* Substitute the argument types. */
12233 arg_types
= tsubst_arg_types (TYPE_ARG_TYPES (t
), args
, NULL_TREE
,
12234 complain
, in_decl
);
12235 if (arg_types
== error_mark_node
)
12236 return error_mark_node
;
12239 /* Construct a new type node and return it. */
12240 if (TREE_CODE (t
) == FUNCTION_TYPE
)
12242 fntype
= build_function_type (return_type
, arg_types
);
12243 fntype
= apply_memfn_quals (fntype
,
12244 type_memfn_quals (t
),
12245 type_memfn_rqual (t
));
12249 tree r
= TREE_TYPE (TREE_VALUE (arg_types
));
12250 /* Don't pick up extra function qualifiers from the basetype. */
12251 r
= cp_build_qualified_type_real (r
, type_memfn_quals (t
), complain
);
12252 if (! MAYBE_CLASS_TYPE_P (r
))
12256 Type deduction may fail for any of the following
12259 -- Attempting to create "pointer to member of T" when T
12260 is not a class type. */
12261 if (complain
& tf_error
)
12262 error ("creating pointer to member function of non-class type %qT",
12264 return error_mark_node
;
12267 fntype
= build_method_type_directly (r
, return_type
,
12268 TREE_CHAIN (arg_types
));
12269 fntype
= build_ref_qualified_type (fntype
, type_memfn_rqual (t
));
12271 fntype
= cp_build_type_attribute_variant (fntype
, TYPE_ATTRIBUTES (t
));
12273 if (late_return_type_p
)
12274 TYPE_HAS_LATE_RETURN_TYPE (fntype
) = 1;
12279 /* FNTYPE is a FUNCTION_TYPE or METHOD_TYPE. Substitute the template
12280 ARGS into that specification, and return the substituted
12281 specification. If there is no specification, return NULL_TREE. */
12284 tsubst_exception_specification (tree fntype
,
12286 tsubst_flags_t complain
,
12293 specs
= TYPE_RAISES_EXCEPTIONS (fntype
);
12294 new_specs
= NULL_TREE
;
12295 if (specs
&& TREE_PURPOSE (specs
))
12297 /* A noexcept-specifier. */
12298 tree expr
= TREE_PURPOSE (specs
);
12299 if (TREE_CODE (expr
) == INTEGER_CST
)
12303 /* Defer instantiation of noexcept-specifiers to avoid
12304 excessive instantiations (c++/49107). */
12305 new_specs
= make_node (DEFERRED_NOEXCEPT
);
12306 if (DEFERRED_NOEXCEPT_SPEC_P (specs
))
12308 /* We already partially instantiated this member template,
12309 so combine the new args with the old. */
12310 DEFERRED_NOEXCEPT_PATTERN (new_specs
)
12311 = DEFERRED_NOEXCEPT_PATTERN (expr
);
12312 DEFERRED_NOEXCEPT_ARGS (new_specs
)
12313 = add_to_template_args (DEFERRED_NOEXCEPT_ARGS (expr
), args
);
12317 DEFERRED_NOEXCEPT_PATTERN (new_specs
) = expr
;
12318 DEFERRED_NOEXCEPT_ARGS (new_specs
) = args
;
12322 new_specs
= tsubst_copy_and_build
12323 (expr
, args
, complain
, in_decl
, /*function_p=*/false,
12324 /*integral_constant_expression_p=*/true);
12325 new_specs
= build_noexcept_spec (new_specs
, complain
);
12329 if (! TREE_VALUE (specs
))
12336 tree expanded_specs
= NULL_TREE
;
12338 if (PACK_EXPANSION_P (TREE_VALUE (specs
)))
12340 /* Expand the pack expansion type. */
12341 expanded_specs
= tsubst_pack_expansion (TREE_VALUE (specs
),
12345 if (expanded_specs
== error_mark_node
)
12346 return error_mark_node
;
12347 else if (TREE_CODE (expanded_specs
) == TREE_VEC
)
12348 len
= TREE_VEC_LENGTH (expanded_specs
);
12351 /* We're substituting into a member template, so
12352 we got a TYPE_PACK_EXPANSION back. Add that
12353 expansion and move on. */
12354 gcc_assert (TREE_CODE (expanded_specs
)
12355 == TYPE_PACK_EXPANSION
);
12356 new_specs
= add_exception_specifier (new_specs
,
12359 specs
= TREE_CHAIN (specs
);
12364 for (i
= 0; i
< len
; ++i
)
12366 if (expanded_specs
)
12367 spec
= TREE_VEC_ELT (expanded_specs
, i
);
12369 spec
= tsubst (TREE_VALUE (specs
), args
, complain
, in_decl
);
12370 if (spec
== error_mark_node
)
12372 new_specs
= add_exception_specifier (new_specs
, spec
,
12376 specs
= TREE_CHAIN (specs
);
12382 /* Take the tree structure T and replace template parameters used
12383 therein with the argument vector ARGS. IN_DECL is an associated
12384 decl for diagnostics. If an error occurs, returns ERROR_MARK_NODE.
12385 Issue error and warning messages under control of COMPLAIN. Note
12386 that we must be relatively non-tolerant of extensions here, in
12387 order to preserve conformance; if we allow substitutions that
12388 should not be allowed, we may allow argument deductions that should
12389 not succeed, and therefore report ambiguous overload situations
12390 where there are none. In theory, we could allow the substitution,
12391 but indicate that it should have failed, and allow our caller to
12392 make sure that the right thing happens, but we don't try to do this
12395 This function is used for dealing with types, decls and the like;
12396 for expressions, use tsubst_expr or tsubst_copy. */
12399 tsubst (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
12401 enum tree_code code
;
12402 tree type
, r
= NULL_TREE
;
12404 if (t
== NULL_TREE
|| t
== error_mark_node
12405 || t
== integer_type_node
12406 || t
== void_type_node
12407 || t
== char_type_node
12408 || t
== unknown_type_node
12409 || TREE_CODE (t
) == NAMESPACE_DECL
12410 || TREE_CODE (t
) == TRANSLATION_UNIT_DECL
)
12414 return tsubst_decl (t
, args
, complain
);
12416 if (args
== NULL_TREE
)
12419 code
= TREE_CODE (t
);
12421 if (code
== IDENTIFIER_NODE
)
12422 type
= IDENTIFIER_TYPE_VALUE (t
);
12424 type
= TREE_TYPE (t
);
12426 gcc_assert (type
!= unknown_type_node
);
12428 /* Reuse typedefs. We need to do this to handle dependent attributes,
12429 such as attribute aligned. */
12431 && typedef_variant_p (t
))
12433 tree decl
= TYPE_NAME (t
);
12435 if (alias_template_specialization_p (t
))
12437 /* DECL represents an alias template and we want to
12439 tree tmpl
= most_general_template (DECL_TI_TEMPLATE (decl
));
12440 tree gen_args
= tsubst (DECL_TI_ARGS (decl
), args
, complain
, in_decl
);
12441 r
= instantiate_alias_template (tmpl
, gen_args
, complain
);
12443 else if (DECL_CLASS_SCOPE_P (decl
)
12444 && CLASSTYPE_TEMPLATE_INFO (DECL_CONTEXT (decl
))
12445 && uses_template_parms (DECL_CONTEXT (decl
)))
12447 tree tmpl
= most_general_template (DECL_TI_TEMPLATE (decl
));
12448 tree gen_args
= tsubst (DECL_TI_ARGS (decl
), args
, complain
, in_decl
);
12449 r
= retrieve_specialization (tmpl
, gen_args
, 0);
12451 else if (DECL_FUNCTION_SCOPE_P (decl
)
12452 && DECL_TEMPLATE_INFO (DECL_CONTEXT (decl
))
12453 && uses_template_parms (DECL_TI_ARGS (DECL_CONTEXT (decl
))))
12454 r
= retrieve_local_specialization (decl
);
12456 /* The typedef is from a non-template context. */
12462 r
= cp_build_qualified_type_real
12463 (r
, cp_type_quals (t
) | cp_type_quals (r
),
12464 complain
| tf_ignore_bad_quals
);
12469 /* We don't have an instantiation yet, so drop the typedef. */
12470 int quals
= cp_type_quals (t
);
12471 t
= DECL_ORIGINAL_TYPE (decl
);
12472 t
= cp_build_qualified_type_real (t
, quals
,
12473 complain
| tf_ignore_bad_quals
);
12478 && code
!= TYPENAME_TYPE
12479 && code
!= TEMPLATE_TYPE_PARM
12480 && code
!= IDENTIFIER_NODE
12481 && code
!= FUNCTION_TYPE
12482 && code
!= METHOD_TYPE
)
12483 type
= tsubst (type
, args
, complain
, in_decl
);
12484 if (type
== error_mark_node
)
12485 return error_mark_node
;
12491 case ENUMERAL_TYPE
:
12492 return tsubst_aggr_type (t
, args
, complain
, in_decl
,
12493 /*entering_scope=*/0);
12496 case IDENTIFIER_NODE
:
12507 if (t
== integer_type_node
)
12510 if (TREE_CODE (TYPE_MIN_VALUE (t
)) == INTEGER_CST
12511 && TREE_CODE (TYPE_MAX_VALUE (t
)) == INTEGER_CST
)
12515 tree max
, omax
= TREE_OPERAND (TYPE_MAX_VALUE (t
), 0);
12517 max
= tsubst_expr (omax
, args
, complain
, in_decl
,
12518 /*integral_constant_expression_p=*/false);
12520 /* Fix up type of the magic NOP_EXPR with TREE_SIDE_EFFECTS if
12522 if (TREE_CODE (max
) == NOP_EXPR
12523 && TREE_SIDE_EFFECTS (omax
)
12524 && !TREE_TYPE (max
))
12525 TREE_TYPE (max
) = TREE_TYPE (TREE_OPERAND (max
, 0));
12527 /* If we're in a partial instantiation, preserve the magic NOP_EXPR
12528 with TREE_SIDE_EFFECTS that indicates this is not an integral
12529 constant expression. */
12530 if (processing_template_decl
12531 && TREE_SIDE_EFFECTS (omax
) && TREE_CODE (omax
) == NOP_EXPR
)
12533 gcc_assert (TREE_CODE (max
) == NOP_EXPR
);
12534 TREE_SIDE_EFFECTS (max
) = 1;
12537 return compute_array_index_type (NULL_TREE
, max
, complain
);
12540 case TEMPLATE_TYPE_PARM
:
12541 case TEMPLATE_TEMPLATE_PARM
:
12542 case BOUND_TEMPLATE_TEMPLATE_PARM
:
12543 case TEMPLATE_PARM_INDEX
:
12548 tree arg
= NULL_TREE
;
12550 /* Early in template argument deduction substitution, we don't
12551 want to reduce the level of 'auto', or it will be confused
12552 with a normal template parm in subsequent deduction. */
12553 if (is_auto (t
) && (complain
& tf_partial
))
12558 gcc_assert (TREE_VEC_LENGTH (args
) > 0);
12559 template_parm_level_and_index (t
, &level
, &idx
);
12561 levels
= TMPL_ARGS_DEPTH (args
);
12562 if (level
<= levels
12563 && TREE_VEC_LENGTH (TMPL_ARGS_LEVEL (args
, level
)) > 0)
12565 arg
= TMPL_ARG (args
, level
, idx
);
12567 if (arg
&& TREE_CODE (arg
) == ARGUMENT_PACK_SELECT
)
12569 /* See through ARGUMENT_PACK_SELECT arguments. */
12570 arg
= ARGUMENT_PACK_SELECT_ARG (arg
);
12571 /* If the selected argument is an expansion E, that most
12572 likely means we were called from
12573 gen_elem_of_pack_expansion_instantiation during the
12574 substituting of pack an argument pack (which Ith
12575 element is a pack expansion, where I is
12576 ARGUMENT_PACK_SELECT_INDEX) into a pack expansion.
12577 In this case, the Ith element resulting from this
12578 substituting is going to be a pack expansion, which
12579 pattern is the pattern of E. Let's return the
12581 gen_elem_of_pack_expansion_instantiation will
12582 build the resulting pack expansion from it. */
12583 if (PACK_EXPANSION_P (arg
))
12585 /* Make sure we aren't throwing away arg info. */
12586 gcc_assert (!PACK_EXPANSION_EXTRA_ARGS (arg
));
12587 arg
= PACK_EXPANSION_PATTERN (arg
);
12592 if (arg
== error_mark_node
)
12593 return error_mark_node
;
12594 else if (arg
!= NULL_TREE
)
12596 if (ARGUMENT_PACK_P (arg
))
12597 /* If ARG is an argument pack, we don't actually want to
12598 perform a substitution here, because substitutions
12599 for argument packs are only done
12600 element-by-element. We can get to this point when
12601 substituting the type of a non-type template
12602 parameter pack, when that type actually contains
12603 template parameter packs from an outer template, e.g.,
12605 template<typename... Types> struct A {
12606 template<Types... Values> struct B { };
12610 if (code
== TEMPLATE_TYPE_PARM
)
12613 gcc_assert (TYPE_P (arg
));
12615 quals
= cp_type_quals (arg
) | cp_type_quals (t
);
12617 return cp_build_qualified_type_real
12618 (arg
, quals
, complain
| tf_ignore_bad_quals
);
12620 else if (code
== BOUND_TEMPLATE_TEMPLATE_PARM
)
12622 /* We are processing a type constructed from a
12623 template template parameter. */
12624 tree argvec
= tsubst (TYPE_TI_ARGS (t
),
12625 args
, complain
, in_decl
);
12626 if (argvec
== error_mark_node
)
12627 return error_mark_node
;
12629 gcc_assert (TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
12630 || TREE_CODE (arg
) == TEMPLATE_DECL
12631 || TREE_CODE (arg
) == UNBOUND_CLASS_TEMPLATE
);
12633 if (TREE_CODE (arg
) == UNBOUND_CLASS_TEMPLATE
)
12634 /* Consider this code:
12636 template <template <class> class Template>
12638 template <class Arg> using Bind = Template<Arg>;
12641 template <template <class> class Template, class Arg>
12642 using Instantiate = Template<Arg>; //#0
12644 template <template <class> class Template,
12647 Instantiate<Internal<Template>::template Bind,
12650 When #1 is parsed, the
12651 BOUND_TEMPLATE_TEMPLATE_PARM representing the
12652 parameter `Template' in #0 matches the
12653 UNBOUND_CLASS_TEMPLATE representing the argument
12654 `Internal<Template>::template Bind'; We then want
12655 to assemble the type `Bind<Argument>' that can't
12656 be fully created right now, because
12657 `Internal<Template>' not being complete, the Bind
12658 template cannot be looked up in that context. So
12659 we need to "store" `Bind<Argument>' for later
12660 when the context of Bind becomes complete. Let's
12661 store that in a TYPENAME_TYPE. */
12662 return make_typename_type (TYPE_CONTEXT (arg
),
12663 build_nt (TEMPLATE_ID_EXPR
,
12664 TYPE_IDENTIFIER (arg
),
12669 /* We can get a TEMPLATE_TEMPLATE_PARM here when we
12670 are resolving nested-types in the signature of a
12671 member function templates. Otherwise ARG is a
12672 TEMPLATE_DECL and is the real template to be
12674 if (TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
)
12675 arg
= TYPE_NAME (arg
);
12677 r
= lookup_template_class (arg
,
12679 DECL_CONTEXT (arg
),
12680 /*entering_scope=*/0,
12682 return cp_build_qualified_type_real
12683 (r
, cp_type_quals (t
) | cp_type_quals (r
), complain
);
12686 /* TEMPLATE_TEMPLATE_PARM or TEMPLATE_PARM_INDEX. */
12687 return convert_from_reference (unshare_expr (arg
));
12691 /* This can happen during the attempted tsubst'ing in
12692 unify. This means that we don't yet have any information
12693 about the template parameter in question. */
12696 /* If we get here, we must have been looking at a parm for a
12697 more deeply nested template. Make a new version of this
12698 template parameter, but with a lower level. */
12701 case TEMPLATE_TYPE_PARM
:
12702 case TEMPLATE_TEMPLATE_PARM
:
12703 case BOUND_TEMPLATE_TEMPLATE_PARM
:
12704 if (cp_type_quals (t
))
12706 r
= tsubst (TYPE_MAIN_VARIANT (t
), args
, complain
, in_decl
);
12707 r
= cp_build_qualified_type_real
12708 (r
, cp_type_quals (t
),
12709 complain
| (code
== TEMPLATE_TYPE_PARM
12710 ? tf_ignore_bad_quals
: 0));
12712 else if (TREE_CODE (t
) == TEMPLATE_TYPE_PARM
12713 && PLACEHOLDER_TYPE_CONSTRAINTS (t
)
12714 && (r
= (TEMPLATE_PARM_DESCENDANTS
12715 (TEMPLATE_TYPE_PARM_INDEX (t
))))
12716 && (r
= TREE_TYPE (r
))
12717 && !PLACEHOLDER_TYPE_CONSTRAINTS (r
))
12718 /* Break infinite recursion when substituting the constraints
12719 of a constrained placeholder. */;
12723 TEMPLATE_TYPE_PARM_INDEX (r
)
12724 = reduce_template_parm_level (TEMPLATE_TYPE_PARM_INDEX (t
),
12725 r
, levels
, args
, complain
);
12726 TYPE_STUB_DECL (r
) = TYPE_NAME (r
) = TEMPLATE_TYPE_DECL (r
);
12727 TYPE_MAIN_VARIANT (r
) = r
;
12728 TYPE_POINTER_TO (r
) = NULL_TREE
;
12729 TYPE_REFERENCE_TO (r
) = NULL_TREE
;
12731 if (TREE_CODE (r
) == TEMPLATE_TEMPLATE_PARM
)
12732 /* We have reduced the level of the template
12733 template parameter, but not the levels of its
12734 template parameters, so canonical_type_parameter
12735 will not be able to find the canonical template
12736 template parameter for this level. Thus, we
12737 require structural equality checking to compare
12738 TEMPLATE_TEMPLATE_PARMs. */
12739 SET_TYPE_STRUCTURAL_EQUALITY (r
);
12740 else if (TYPE_STRUCTURAL_EQUALITY_P (t
))
12741 SET_TYPE_STRUCTURAL_EQUALITY (r
);
12743 TYPE_CANONICAL (r
) = canonical_type_parameter (r
);
12745 /* Propagate constraints on placeholders. */
12746 if (TREE_CODE (t
) == TEMPLATE_TYPE_PARM
)
12747 if (tree constr
= PLACEHOLDER_TYPE_CONSTRAINTS (t
))
12748 PLACEHOLDER_TYPE_CONSTRAINTS (r
)
12749 = tsubst_constraint (constr
, args
, complain
, in_decl
);
12751 if (code
== BOUND_TEMPLATE_TEMPLATE_PARM
)
12753 tree argvec
= tsubst (TYPE_TI_ARGS (t
), args
,
12754 complain
, in_decl
);
12755 if (argvec
== error_mark_node
)
12756 return error_mark_node
;
12758 TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (r
)
12759 = build_template_info (TYPE_TI_TEMPLATE (t
), argvec
);
12764 case TEMPLATE_PARM_INDEX
:
12765 r
= reduce_template_parm_level (t
, type
, levels
, args
, complain
);
12769 gcc_unreachable ();
12777 tree purpose
, value
, chain
;
12779 if (t
== void_list_node
)
12782 purpose
= TREE_PURPOSE (t
);
12785 purpose
= tsubst (purpose
, args
, complain
, in_decl
);
12786 if (purpose
== error_mark_node
)
12787 return error_mark_node
;
12789 value
= TREE_VALUE (t
);
12792 value
= tsubst (value
, args
, complain
, in_decl
);
12793 if (value
== error_mark_node
)
12794 return error_mark_node
;
12796 chain
= TREE_CHAIN (t
);
12797 if (chain
&& chain
!= void_type_node
)
12799 chain
= tsubst (chain
, args
, complain
, in_decl
);
12800 if (chain
== error_mark_node
)
12801 return error_mark_node
;
12803 if (purpose
== TREE_PURPOSE (t
)
12804 && value
== TREE_VALUE (t
)
12805 && chain
== TREE_CHAIN (t
))
12807 return hash_tree_cons (purpose
, value
, chain
);
12811 /* We should never be tsubsting a binfo. */
12812 gcc_unreachable ();
12815 /* A vector of template arguments. */
12816 gcc_assert (!type
);
12817 return tsubst_template_args (t
, args
, complain
, in_decl
);
12820 case REFERENCE_TYPE
:
12822 if (type
== TREE_TYPE (t
) && TREE_CODE (type
) != METHOD_TYPE
)
12827 Type deduction may fail for any of the following
12830 -- Attempting to create a pointer to reference type.
12831 -- Attempting to create a reference to a reference type or
12832 a reference to void.
12834 Core issue 106 says that creating a reference to a reference
12835 during instantiation is no longer a cause for failure. We
12836 only enforce this check in strict C++98 mode. */
12837 if ((TREE_CODE (type
) == REFERENCE_TYPE
12838 && (((cxx_dialect
== cxx98
) && flag_iso
) || code
!= REFERENCE_TYPE
))
12839 || (code
== REFERENCE_TYPE
&& VOID_TYPE_P (type
)))
12841 static location_t last_loc
;
12843 /* We keep track of the last time we issued this error
12844 message to avoid spewing a ton of messages during a
12845 single bad template instantiation. */
12846 if (complain
& tf_error
12847 && last_loc
!= input_location
)
12849 if (VOID_TYPE_P (type
))
12850 error ("forming reference to void");
12851 else if (code
== POINTER_TYPE
)
12852 error ("forming pointer to reference type %qT", type
);
12854 error ("forming reference to reference type %qT", type
);
12855 last_loc
= input_location
;
12858 return error_mark_node
;
12860 else if (TREE_CODE (type
) == FUNCTION_TYPE
12861 && (type_memfn_quals (type
) != TYPE_UNQUALIFIED
12862 || type_memfn_rqual (type
) != REF_QUAL_NONE
))
12864 if (complain
& tf_error
)
12866 if (code
== POINTER_TYPE
)
12867 error ("forming pointer to qualified function type %qT",
12870 error ("forming reference to qualified function type %qT",
12873 return error_mark_node
;
12875 else if (code
== POINTER_TYPE
)
12877 r
= build_pointer_type (type
);
12878 if (TREE_CODE (type
) == METHOD_TYPE
)
12879 r
= build_ptrmemfunc_type (r
);
12881 else if (TREE_CODE (type
) == REFERENCE_TYPE
)
12882 /* In C++0x, during template argument substitution, when there is an
12883 attempt to create a reference to a reference type, reference
12884 collapsing is applied as described in [14.3.1/4 temp.arg.type]:
12886 "If a template-argument for a template-parameter T names a type
12887 that is a reference to a type A, an attempt to create the type
12888 'lvalue reference to cv T' creates the type 'lvalue reference to
12889 A,' while an attempt to create the type type rvalue reference to
12890 cv T' creates the type T"
12892 r
= cp_build_reference_type
12894 TYPE_REF_IS_RVALUE (t
) && TYPE_REF_IS_RVALUE (type
));
12896 r
= cp_build_reference_type (type
, TYPE_REF_IS_RVALUE (t
));
12897 r
= cp_build_qualified_type_real (r
, cp_type_quals (t
), complain
);
12899 if (r
!= error_mark_node
)
12900 /* Will this ever be needed for TYPE_..._TO values? */
12907 r
= tsubst (TYPE_OFFSET_BASETYPE (t
), args
, complain
, in_decl
);
12908 if (r
== error_mark_node
|| !MAYBE_CLASS_TYPE_P (r
))
12912 Type deduction may fail for any of the following
12915 -- Attempting to create "pointer to member of T" when T
12916 is not a class type. */
12917 if (complain
& tf_error
)
12918 error ("creating pointer to member of non-class type %qT", r
);
12919 return error_mark_node
;
12921 if (TREE_CODE (type
) == REFERENCE_TYPE
)
12923 if (complain
& tf_error
)
12924 error ("creating pointer to member reference type %qT", type
);
12925 return error_mark_node
;
12927 if (VOID_TYPE_P (type
))
12929 if (complain
& tf_error
)
12930 error ("creating pointer to member of type void");
12931 return error_mark_node
;
12933 gcc_assert (TREE_CODE (type
) != METHOD_TYPE
);
12934 if (TREE_CODE (type
) == FUNCTION_TYPE
)
12936 /* The type of the implicit object parameter gets its
12937 cv-qualifiers from the FUNCTION_TYPE. */
12940 = build_memfn_type (type
, r
, type_memfn_quals (type
),
12941 type_memfn_rqual (type
));
12942 memptr
= build_ptrmemfunc_type (build_pointer_type (method_type
));
12943 return cp_build_qualified_type_real (memptr
, cp_type_quals (t
),
12947 return cp_build_qualified_type_real (build_ptrmem_type (r
, type
),
12951 case FUNCTION_TYPE
:
12956 fntype
= tsubst_function_type (t
, args
, complain
, in_decl
);
12957 if (fntype
== error_mark_node
)
12958 return error_mark_node
;
12960 /* Substitute the exception specification. */
12961 specs
= tsubst_exception_specification (t
, args
, complain
,
12962 in_decl
, /*defer_ok*/true);
12963 if (specs
== error_mark_node
)
12964 return error_mark_node
;
12966 fntype
= build_exception_variant (fntype
, specs
);
12971 tree domain
= tsubst (TYPE_DOMAIN (t
), args
, complain
, in_decl
);
12972 if (domain
== error_mark_node
)
12973 return error_mark_node
;
12975 /* As an optimization, we avoid regenerating the array type if
12976 it will obviously be the same as T. */
12977 if (type
== TREE_TYPE (t
) && domain
== TYPE_DOMAIN (t
))
12980 /* These checks should match the ones in create_array_type_for_decl.
12984 The deduction may fail for any of the following reasons:
12986 -- Attempting to create an array with an element type that
12987 is void, a function type, or a reference type, or [DR337]
12988 an abstract class type. */
12989 if (VOID_TYPE_P (type
)
12990 || TREE_CODE (type
) == FUNCTION_TYPE
12991 || (TREE_CODE (type
) == ARRAY_TYPE
12992 && TYPE_DOMAIN (type
) == NULL_TREE
)
12993 || TREE_CODE (type
) == REFERENCE_TYPE
)
12995 if (complain
& tf_error
)
12996 error ("creating array of %qT", type
);
12997 return error_mark_node
;
13000 if (abstract_virtuals_error_sfinae (ACU_ARRAY
, type
, complain
))
13001 return error_mark_node
;
13003 r
= build_cplus_array_type (type
, domain
);
13005 if (TYPE_USER_ALIGN (t
))
13007 TYPE_ALIGN (r
) = TYPE_ALIGN (t
);
13008 TYPE_USER_ALIGN (r
) = 1;
13014 case TYPENAME_TYPE
:
13016 tree ctx
= tsubst_aggr_type (TYPE_CONTEXT (t
), args
, complain
,
13017 in_decl
, /*entering_scope=*/1);
13018 tree f
= tsubst_copy (TYPENAME_TYPE_FULLNAME (t
), args
,
13019 complain
, in_decl
);
13021 if (ctx
== error_mark_node
|| f
== error_mark_node
)
13022 return error_mark_node
;
13024 if (!MAYBE_CLASS_TYPE_P (ctx
))
13026 if (complain
& tf_error
)
13027 error ("%qT is not a class, struct, or union type", ctx
);
13028 return error_mark_node
;
13030 else if (!uses_template_parms (ctx
) && !TYPE_BEING_DEFINED (ctx
))
13032 /* Normally, make_typename_type does not require that the CTX
13033 have complete type in order to allow things like:
13035 template <class T> struct S { typename S<T>::X Y; };
13037 But, such constructs have already been resolved by this
13038 point, so here CTX really should have complete type, unless
13039 it's a partial instantiation. */
13040 ctx
= complete_type (ctx
);
13041 if (!COMPLETE_TYPE_P (ctx
))
13043 if (complain
& tf_error
)
13044 cxx_incomplete_type_error (NULL_TREE
, ctx
);
13045 return error_mark_node
;
13049 f
= make_typename_type (ctx
, f
, typename_type
,
13050 complain
| tf_keep_type_decl
);
13051 if (f
== error_mark_node
)
13053 if (TREE_CODE (f
) == TYPE_DECL
)
13055 complain
|= tf_ignore_bad_quals
;
13059 if (TREE_CODE (f
) != TYPENAME_TYPE
)
13061 if (TYPENAME_IS_ENUM_P (t
) && TREE_CODE (f
) != ENUMERAL_TYPE
)
13063 if (complain
& tf_error
)
13064 error ("%qT resolves to %qT, which is not an enumeration type",
13067 return error_mark_node
;
13069 else if (TYPENAME_IS_CLASS_P (t
) && !CLASS_TYPE_P (f
))
13071 if (complain
& tf_error
)
13072 error ("%qT resolves to %qT, which is is not a class type",
13075 return error_mark_node
;
13079 return cp_build_qualified_type_real
13080 (f
, cp_type_quals (f
) | cp_type_quals (t
), complain
);
13083 case UNBOUND_CLASS_TEMPLATE
:
13085 tree ctx
= tsubst_aggr_type (TYPE_CONTEXT (t
), args
, complain
,
13086 in_decl
, /*entering_scope=*/1);
13087 tree name
= TYPE_IDENTIFIER (t
);
13088 tree parm_list
= DECL_TEMPLATE_PARMS (TYPE_NAME (t
));
13090 if (ctx
== error_mark_node
|| name
== error_mark_node
)
13091 return error_mark_node
;
13094 parm_list
= tsubst_template_parms (parm_list
, args
, complain
);
13095 return make_unbound_class_template (ctx
, name
, parm_list
, complain
);
13102 ++cp_unevaluated_operand
;
13103 ++c_inhibit_evaluation_warnings
;
13105 type
= tsubst_expr (TYPEOF_TYPE_EXPR (t
), args
,
13107 /*integral_constant_expression_p=*/false);
13109 --cp_unevaluated_operand
;
13110 --c_inhibit_evaluation_warnings
;
13112 type
= finish_typeof (type
);
13113 return cp_build_qualified_type_real (type
,
13115 | cp_type_quals (type
),
13119 case DECLTYPE_TYPE
:
13123 ++cp_unevaluated_operand
;
13124 ++c_inhibit_evaluation_warnings
;
13126 type
= tsubst_copy_and_build (DECLTYPE_TYPE_EXPR (t
), args
,
13127 complain
|tf_decltype
, in_decl
,
13128 /*function_p*/false,
13129 /*integral_constant_expression*/false);
13131 --cp_unevaluated_operand
;
13132 --c_inhibit_evaluation_warnings
;
13134 if (DECLTYPE_FOR_LAMBDA_CAPTURE (t
))
13135 type
= lambda_capture_field_type (type
,
13136 DECLTYPE_FOR_INIT_CAPTURE (t
));
13137 else if (DECLTYPE_FOR_LAMBDA_PROXY (t
))
13138 type
= lambda_proxy_type (type
);
13141 bool id
= DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (t
);
13142 if (id
&& TREE_CODE (DECLTYPE_TYPE_EXPR (t
)) == BIT_NOT_EXPR
13144 /* In a template ~id could be either a complement expression
13145 or an unqualified-id naming a destructor; if instantiating
13146 it produces an expression, it's not an id-expression or
13149 type
= finish_decltype_type (type
, id
, complain
);
13151 return cp_build_qualified_type_real (type
,
13153 | cp_type_quals (type
),
13154 complain
| tf_ignore_bad_quals
);
13157 case UNDERLYING_TYPE
:
13159 tree type
= tsubst (UNDERLYING_TYPE_TYPE (t
), args
,
13160 complain
, in_decl
);
13161 return finish_underlying_type (type
);
13164 case TYPE_ARGUMENT_PACK
:
13165 case NONTYPE_ARGUMENT_PACK
:
13167 tree r
= TYPE_P (t
) ? cxx_make_type (code
) : make_node (code
);
13169 tsubst_template_args (ARGUMENT_PACK_ARGS (t
),
13173 SET_ARGUMENT_PACK_ARGS (r
, packed_out
);
13175 /* For template nontype argument packs, also substitute into
13177 if (code
== NONTYPE_ARGUMENT_PACK
)
13178 TREE_TYPE (r
) = tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
13197 /* We should use one of the expression tsubsts for these codes. */
13198 gcc_unreachable ();
13201 sorry ("use of %qs in template", get_tree_code_name (code
));
13202 return error_mark_node
;
13206 /* Like tsubst_expr for a BASELINK. OBJECT_TYPE, if non-NULL, is the
13207 type of the expression on the left-hand side of the "." or "->"
13211 tsubst_baselink (tree baselink
, tree object_type
,
13212 tree args
, tsubst_flags_t complain
, tree in_decl
)
13215 tree qualifying_scope
;
13218 tree template_args
= 0;
13219 bool template_id_p
= false;
13220 bool qualified
= BASELINK_QUALIFIED_P (baselink
);
13222 /* A baselink indicates a function from a base class. Both the
13223 BASELINK_ACCESS_BINFO and the base class referenced may
13224 indicate bases of the template class, rather than the
13225 instantiated class. In addition, lookups that were not
13226 ambiguous before may be ambiguous now. Therefore, we perform
13227 the lookup again. */
13228 qualifying_scope
= BINFO_TYPE (BASELINK_ACCESS_BINFO (baselink
));
13229 qualifying_scope
= tsubst (qualifying_scope
, args
,
13230 complain
, in_decl
);
13231 fns
= BASELINK_FUNCTIONS (baselink
);
13232 optype
= tsubst (BASELINK_OPTYPE (baselink
), args
, complain
, in_decl
);
13233 if (TREE_CODE (fns
) == TEMPLATE_ID_EXPR
)
13235 template_id_p
= true;
13236 template_args
= TREE_OPERAND (fns
, 1);
13237 fns
= TREE_OPERAND (fns
, 0);
13239 template_args
= tsubst_template_args (template_args
, args
,
13240 complain
, in_decl
);
13242 name
= DECL_NAME (get_first_fn (fns
));
13243 if (IDENTIFIER_TYPENAME_P (name
))
13244 name
= mangle_conv_op_name_for_type (optype
);
13245 baselink
= lookup_fnfields (qualifying_scope
, name
, /*protect=*/1);
13247 return error_mark_node
;
13249 /* If lookup found a single function, mark it as used at this
13250 point. (If it lookup found multiple functions the one selected
13251 later by overload resolution will be marked as used at that
13253 if (BASELINK_P (baselink
))
13254 fns
= BASELINK_FUNCTIONS (baselink
);
13255 if (!template_id_p
&& !really_overloaded_fn (fns
)
13256 && !mark_used (OVL_CURRENT (fns
), complain
) && !(complain
& tf_error
))
13257 return error_mark_node
;
13259 /* Add back the template arguments, if present. */
13260 if (BASELINK_P (baselink
) && template_id_p
)
13261 BASELINK_FUNCTIONS (baselink
)
13262 = build_nt (TEMPLATE_ID_EXPR
,
13263 BASELINK_FUNCTIONS (baselink
),
13265 /* Update the conversion operator type. */
13266 BASELINK_OPTYPE (baselink
) = optype
;
13269 object_type
= current_class_type
;
13272 baselink
= adjust_result_of_qualified_name_lookup (baselink
,
13278 /* Like tsubst_expr for a SCOPE_REF, given by QUALIFIED_ID. DONE is
13279 true if the qualified-id will be a postfix-expression in-and-of
13280 itself; false if more of the postfix-expression follows the
13281 QUALIFIED_ID. ADDRESS_P is true if the qualified-id is the operand
13285 tsubst_qualified_id (tree qualified_id
, tree args
,
13286 tsubst_flags_t complain
, tree in_decl
,
13287 bool done
, bool address_p
)
13293 tree template_args
;
13294 location_t loc
= UNKNOWN_LOCATION
;
13296 gcc_assert (TREE_CODE (qualified_id
) == SCOPE_REF
);
13298 /* Figure out what name to look up. */
13299 name
= TREE_OPERAND (qualified_id
, 1);
13300 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
13302 is_template
= true;
13303 loc
= EXPR_LOCATION (name
);
13304 template_args
= TREE_OPERAND (name
, 1);
13306 template_args
= tsubst_template_args (template_args
, args
,
13307 complain
, in_decl
);
13308 name
= TREE_OPERAND (name
, 0);
13312 is_template
= false;
13313 template_args
= NULL_TREE
;
13316 /* Substitute into the qualifying scope. When there are no ARGS, we
13317 are just trying to simplify a non-dependent expression. In that
13318 case the qualifying scope may be dependent, and, in any case,
13319 substituting will not help. */
13320 scope
= TREE_OPERAND (qualified_id
, 0);
13323 scope
= tsubst (scope
, args
, complain
, in_decl
);
13324 expr
= tsubst_copy (name
, args
, complain
, in_decl
);
13329 if (dependent_scope_p (scope
))
13332 expr
= build_min_nt_loc (loc
, TEMPLATE_ID_EXPR
, expr
, template_args
);
13333 return build_qualified_name (NULL_TREE
, scope
, expr
,
13334 QUALIFIED_NAME_IS_TEMPLATE (qualified_id
));
13337 if (!BASELINK_P (name
) && !DECL_P (expr
))
13339 if (TREE_CODE (expr
) == BIT_NOT_EXPR
)
13341 /* A BIT_NOT_EXPR is used to represent a destructor. */
13342 if (!check_dtor_name (scope
, TREE_OPERAND (expr
, 0)))
13344 error ("qualifying type %qT does not match destructor name ~%qT",
13345 scope
, TREE_OPERAND (expr
, 0));
13346 expr
= error_mark_node
;
13349 expr
= lookup_qualified_name (scope
, complete_dtor_identifier
,
13350 /*is_type_p=*/0, false);
13353 expr
= lookup_qualified_name (scope
, expr
, /*is_type_p=*/0, false);
13354 if (TREE_CODE (TREE_CODE (expr
) == TEMPLATE_DECL
13355 ? DECL_TEMPLATE_RESULT (expr
) : expr
) == TYPE_DECL
)
13357 if (complain
& tf_error
)
13359 error ("dependent-name %qE is parsed as a non-type, but "
13360 "instantiation yields a type", qualified_id
);
13361 inform (input_location
, "say %<typename %E%> if a type is meant", qualified_id
);
13363 return error_mark_node
;
13369 check_accessibility_of_qualified_id (expr
, /*object_type=*/NULL_TREE
,
13371 /* Remember that there was a reference to this entity. */
13372 if (!mark_used (expr
, complain
) && !(complain
& tf_error
))
13373 return error_mark_node
;
13376 if (expr
== error_mark_node
|| TREE_CODE (expr
) == TREE_LIST
)
13378 if (complain
& tf_error
)
13379 qualified_name_lookup_error (scope
,
13380 TREE_OPERAND (qualified_id
, 1),
13381 expr
, input_location
);
13382 return error_mark_node
;
13386 expr
= lookup_template_function (expr
, template_args
);
13388 if (expr
== error_mark_node
&& complain
& tf_error
)
13389 qualified_name_lookup_error (scope
, TREE_OPERAND (qualified_id
, 1),
13390 expr
, input_location
);
13391 else if (TYPE_P (scope
))
13393 expr
= (adjust_result_of_qualified_name_lookup
13394 (expr
, scope
, current_nonlambda_class_type ()));
13395 expr
= (finish_qualified_id_expr
13396 (scope
, expr
, done
, address_p
&& PTRMEM_OK_P (qualified_id
),
13397 QUALIFIED_NAME_IS_TEMPLATE (qualified_id
),
13398 /*template_arg_p=*/false, complain
));
13401 /* Expressions do not generally have reference type. */
13402 if (TREE_CODE (expr
) != SCOPE_REF
13403 /* However, if we're about to form a pointer-to-member, we just
13404 want the referenced member referenced. */
13405 && TREE_CODE (expr
) != OFFSET_REF
)
13406 expr
= convert_from_reference (expr
);
13411 /* tsubst the initializer for a VAR_DECL. INIT is the unsubstituted
13412 initializer, DECL is the substituted VAR_DECL. Other arguments are as
13416 tsubst_init (tree init
, tree decl
, tree args
,
13417 tsubst_flags_t complain
, tree in_decl
)
13422 init
= tsubst_expr (init
, args
, complain
, in_decl
, false);
13426 /* If we had an initializer but it
13427 instantiated to nothing,
13428 value-initialize the object. This will
13429 only occur when the initializer was a
13430 pack expansion where the parameter packs
13431 used in that expansion were of length
13433 init
= build_value_init (TREE_TYPE (decl
),
13435 if (TREE_CODE (init
) == AGGR_INIT_EXPR
)
13436 init
= get_target_expr_sfinae (init
, complain
);
13442 /* Like tsubst, but deals with expressions. This function just replaces
13443 template parms; to finish processing the resultant expression, use
13444 tsubst_copy_and_build or tsubst_expr. */
13447 tsubst_copy (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
13449 enum tree_code code
;
13452 if (t
== NULL_TREE
|| t
== error_mark_node
|| args
== NULL_TREE
)
13455 code
= TREE_CODE (t
);
13460 r
= retrieve_local_specialization (t
);
13462 if (r
== NULL_TREE
)
13464 /* We get here for a use of 'this' in an NSDMI. */
13465 if (DECL_NAME (t
) == this_identifier
13466 && current_function_decl
13467 && DECL_CONSTRUCTOR_P (current_function_decl
))
13468 return current_class_ptr
;
13470 /* This can happen for a parameter name used later in a function
13471 declaration (such as in a late-specified return type). Just
13472 make a dummy decl, since it's only used for its type. */
13473 gcc_assert (cp_unevaluated_operand
!= 0);
13474 r
= tsubst_decl (t
, args
, complain
);
13475 /* Give it the template pattern as its context; its true context
13476 hasn't been instantiated yet and this is good enough for
13478 DECL_CONTEXT (r
) = DECL_CONTEXT (t
);
13481 if (TREE_CODE (r
) == ARGUMENT_PACK_SELECT
)
13482 r
= ARGUMENT_PACK_SELECT_ARG (r
);
13483 if (!mark_used (r
, complain
) && !(complain
& tf_error
))
13484 return error_mark_node
;
13492 if (DECL_TEMPLATE_PARM_P (t
))
13493 return tsubst_copy (DECL_INITIAL (t
), args
, complain
, in_decl
);
13494 /* There is no need to substitute into namespace-scope
13496 if (DECL_NAMESPACE_SCOPE_P (t
))
13498 /* If ARGS is NULL, then T is known to be non-dependent. */
13499 if (args
== NULL_TREE
)
13500 return scalar_constant_value (t
);
13502 /* Unfortunately, we cannot just call lookup_name here.
13505 template <int I> int f() {
13507 struct S { void g() { E e = a; } };
13510 When we instantiate f<7>::S::g(), say, lookup_name is not
13511 clever enough to find f<7>::a. */
13513 = tsubst_aggr_type (DECL_CONTEXT (t
), args
, complain
, in_decl
,
13514 /*entering_scope=*/0);
13516 for (v
= TYPE_VALUES (enum_type
);
13518 v
= TREE_CHAIN (v
))
13519 if (TREE_PURPOSE (v
) == DECL_NAME (t
))
13520 return TREE_VALUE (v
);
13522 /* We didn't find the name. That should never happen; if
13523 name-lookup found it during preliminary parsing, we
13524 should find it again here during instantiation. */
13525 gcc_unreachable ();
13530 if (PACK_EXPANSION_P (TREE_TYPE (t
)))
13532 /* Check for a local specialization set up by
13533 tsubst_pack_expansion. */
13534 if (tree r
= retrieve_local_specialization (t
))
13536 if (TREE_CODE (r
) == ARGUMENT_PACK_SELECT
)
13537 r
= ARGUMENT_PACK_SELECT_ARG (r
);
13541 /* When retrieving a capture pack from a generic lambda, remove the
13542 lambda call op's own template argument list from ARGS. Only the
13543 template arguments active for the closure type should be used to
13544 retrieve the pack specialization. */
13545 if (LAMBDA_FUNCTION_P (current_function_decl
)
13546 && (template_class_depth (DECL_CONTEXT (t
))
13547 != TMPL_ARGS_DEPTH (args
)))
13548 args
= strip_innermost_template_args (args
, 1);
13550 /* Otherwise return the full NONTYPE_ARGUMENT_PACK that
13551 tsubst_decl put in the hash table. */
13552 return retrieve_specialization (t
, args
, 0);
13555 if (DECL_CONTEXT (t
))
13559 ctx
= tsubst_aggr_type (DECL_CONTEXT (t
), args
, complain
, in_decl
,
13560 /*entering_scope=*/1);
13561 if (ctx
!= DECL_CONTEXT (t
))
13563 tree r
= lookup_field (ctx
, DECL_NAME (t
), 0, false);
13566 if (complain
& tf_error
)
13567 error ("using invalid field %qD", t
);
13568 return error_mark_node
;
13577 case FUNCTION_DECL
:
13578 if (DECL_LANG_SPECIFIC (t
) && DECL_TEMPLATE_INFO (t
))
13579 r
= tsubst (t
, args
, complain
, in_decl
);
13580 else if (local_variable_p (t
))
13582 r
= retrieve_local_specialization (t
);
13583 if (r
== NULL_TREE
)
13585 /* First try name lookup to find the instantiation. */
13586 r
= lookup_name (DECL_NAME (t
));
13589 /* Make sure that the one we found is the one we want. */
13590 tree ctx
= tsubst (DECL_CONTEXT (t
), args
,
13591 complain
, in_decl
);
13592 if (ctx
!= DECL_CONTEXT (r
))
13600 /* This can happen for a variable used in a
13601 late-specified return type of a local lambda, or for a
13602 local static or constant. Building a new VAR_DECL
13603 should be OK in all those cases. */
13604 r
= tsubst_decl (t
, args
, complain
);
13605 if (decl_maybe_constant_var_p (r
))
13607 /* We can't call cp_finish_decl, so handle the
13608 initializer by hand. */
13609 tree init
= tsubst_init (DECL_INITIAL (t
), r
, args
,
13610 complain
, in_decl
);
13611 if (!processing_template_decl
)
13612 init
= maybe_constant_init (init
);
13613 if (processing_template_decl
13614 ? potential_constant_expression (init
)
13615 : reduced_constant_expression_p (init
))
13616 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (r
)
13617 = TREE_CONSTANT (r
) = true;
13618 DECL_INITIAL (r
) = init
;
13620 gcc_assert (cp_unevaluated_operand
|| TREE_STATIC (r
)
13621 || decl_constant_var_p (r
)
13622 || errorcount
|| sorrycount
);
13623 if (!processing_template_decl
)
13625 if (TREE_STATIC (r
))
13626 rest_of_decl_compilation (r
, toplevel_bindings_p (),
13629 r
= process_outer_var_ref (r
, complain
);
13632 /* Remember this for subsequent uses. */
13633 if (local_specializations
)
13634 register_local_specialization (r
, t
);
13639 if (!mark_used (r
, complain
) && !(complain
& tf_error
))
13640 return error_mark_node
;
13643 case NAMESPACE_DECL
:
13647 /* An OVERLOAD will always be a non-dependent overload set; an
13648 overload set from function scope will just be represented with an
13649 IDENTIFIER_NODE, and from class scope with a BASELINK. */
13650 gcc_assert (!uses_template_parms (t
));
13654 return tsubst_baselink (t
, current_nonlambda_class_type (),
13655 args
, complain
, in_decl
);
13657 case TEMPLATE_DECL
:
13658 if (DECL_TEMPLATE_TEMPLATE_PARM_P (t
))
13659 return tsubst (TREE_TYPE (DECL_TEMPLATE_RESULT (t
)),
13660 args
, complain
, in_decl
);
13661 else if (DECL_FUNCTION_TEMPLATE_P (t
) && DECL_MEMBER_TEMPLATE_P (t
))
13662 return tsubst (t
, args
, complain
, in_decl
);
13663 else if (DECL_CLASS_SCOPE_P (t
)
13664 && uses_template_parms (DECL_CONTEXT (t
)))
13666 /* Template template argument like the following example need
13669 template <template <class> class TT> struct C {};
13670 template <class T> struct D {
13671 template <class U> struct E {};
13676 We are processing the template argument `E' in #1 for
13677 the template instantiation #2. Originally, `E' is a
13678 TEMPLATE_DECL with `D<T>' as its DECL_CONTEXT. Now we
13679 have to substitute this with one having context `D<int>'. */
13681 tree context
= tsubst (DECL_CONTEXT (t
), args
, complain
, in_decl
);
13682 return lookup_field (context
, DECL_NAME(t
), 0, false);
13685 /* Ordinary template template argument. */
13689 case REINTERPRET_CAST_EXPR
:
13690 case CONST_CAST_EXPR
:
13691 case STATIC_CAST_EXPR
:
13692 case DYNAMIC_CAST_EXPR
:
13693 case IMPLICIT_CONV_EXPR
:
13697 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
13698 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
13699 return build1 (code
, type
, op0
);
13703 if (PACK_EXPANSION_P (TREE_OPERAND (t
, 0)))
13706 tree expanded
, op
= TREE_OPERAND (t
, 0);
13709 if (SIZEOF_EXPR_TYPE_P (t
))
13710 op
= TREE_TYPE (op
);
13712 ++cp_unevaluated_operand
;
13713 ++c_inhibit_evaluation_warnings
;
13714 /* We only want to compute the number of arguments. */
13715 expanded
= tsubst_pack_expansion (op
, args
, complain
, in_decl
);
13716 --cp_unevaluated_operand
;
13717 --c_inhibit_evaluation_warnings
;
13719 if (TREE_CODE (expanded
) == TREE_VEC
)
13720 len
= TREE_VEC_LENGTH (expanded
);
13722 if (expanded
== error_mark_node
)
13723 return error_mark_node
;
13724 else if (PACK_EXPANSION_P (expanded
)
13725 || (TREE_CODE (expanded
) == TREE_VEC
13727 && PACK_EXPANSION_P (TREE_VEC_ELT (expanded
, len
-1))))
13729 if (TREE_CODE (expanded
) == TREE_VEC
)
13730 expanded
= TREE_VEC_ELT (expanded
, len
- 1);
13732 if (TYPE_P (expanded
))
13733 return cxx_sizeof_or_alignof_type (expanded
, SIZEOF_EXPR
,
13734 complain
& tf_error
);
13736 return cxx_sizeof_or_alignof_expr (expanded
, SIZEOF_EXPR
,
13737 complain
& tf_error
);
13740 return build_int_cst (size_type_node
, len
);
13742 if (SIZEOF_EXPR_TYPE_P (t
))
13744 r
= tsubst (TREE_TYPE (TREE_OPERAND (t
, 0)),
13745 args
, complain
, in_decl
);
13746 r
= build1 (NOP_EXPR
, r
, error_mark_node
);
13747 r
= build1 (SIZEOF_EXPR
,
13748 tsubst (TREE_TYPE (t
), args
, complain
, in_decl
), r
);
13749 SIZEOF_EXPR_TYPE_P (r
) = 1;
13756 case TRUTH_NOT_EXPR
:
13759 case UNARY_PLUS_EXPR
: /* Unary + */
13761 case AT_ENCODE_EXPR
:
13765 case REALPART_EXPR
:
13766 case IMAGPART_EXPR
:
13769 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
13770 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
13771 return build1 (code
, type
, op0
);
13774 case COMPONENT_REF
:
13779 object
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
13780 name
= TREE_OPERAND (t
, 1);
13781 if (TREE_CODE (name
) == BIT_NOT_EXPR
)
13783 name
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
13784 complain
, in_decl
);
13785 name
= build1 (BIT_NOT_EXPR
, NULL_TREE
, name
);
13787 else if (TREE_CODE (name
) == SCOPE_REF
13788 && TREE_CODE (TREE_OPERAND (name
, 1)) == BIT_NOT_EXPR
)
13790 tree base
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
13791 complain
, in_decl
);
13792 name
= TREE_OPERAND (name
, 1);
13793 name
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
13794 complain
, in_decl
);
13795 name
= build1 (BIT_NOT_EXPR
, NULL_TREE
, name
);
13796 name
= build_qualified_name (/*type=*/NULL_TREE
,
13798 /*template_p=*/false);
13800 else if (BASELINK_P (name
))
13801 name
= tsubst_baselink (name
,
13802 non_reference (TREE_TYPE (object
)),
13806 name
= tsubst_copy (name
, args
, complain
, in_decl
);
13807 return build_nt (COMPONENT_REF
, object
, name
, NULL_TREE
);
13813 case TRUNC_DIV_EXPR
:
13814 case CEIL_DIV_EXPR
:
13815 case FLOOR_DIV_EXPR
:
13816 case ROUND_DIV_EXPR
:
13817 case EXACT_DIV_EXPR
:
13821 case TRUNC_MOD_EXPR
:
13822 case FLOOR_MOD_EXPR
:
13823 case TRUTH_ANDIF_EXPR
:
13824 case TRUTH_ORIF_EXPR
:
13825 case TRUTH_AND_EXPR
:
13826 case TRUTH_OR_EXPR
:
13839 case COMPOUND_EXPR
:
13842 case PREDECREMENT_EXPR
:
13843 case PREINCREMENT_EXPR
:
13844 case POSTDECREMENT_EXPR
:
13845 case POSTINCREMENT_EXPR
:
13847 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
13848 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
13849 return build_nt (code
, op0
, op1
);
13854 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
13855 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
13856 return build_qualified_name (/*type=*/NULL_TREE
, op0
, op1
,
13857 QUALIFIED_NAME_IS_TEMPLATE (t
));
13862 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
13863 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
13864 return build_nt (ARRAY_REF
, op0
, op1
, NULL_TREE
, NULL_TREE
);
13869 int n
= VL_EXP_OPERAND_LENGTH (t
);
13870 tree result
= build_vl_exp (CALL_EXPR
, n
);
13872 for (i
= 0; i
< n
; i
++)
13873 TREE_OPERAND (t
, i
) = tsubst_copy (TREE_OPERAND (t
, i
), args
,
13874 complain
, in_decl
);
13880 case PSEUDO_DTOR_EXPR
:
13881 case VEC_PERM_EXPR
:
13883 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
13884 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
13885 tree op2
= tsubst_copy (TREE_OPERAND (t
, 2), args
, complain
, in_decl
);
13886 r
= build_nt (code
, op0
, op1
, op2
);
13887 TREE_NO_WARNING (r
) = TREE_NO_WARNING (t
);
13893 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
13894 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
13895 tree op2
= tsubst_copy (TREE_OPERAND (t
, 2), args
, complain
, in_decl
);
13896 r
= build_nt (code
, op0
, op1
, op2
);
13897 NEW_EXPR_USE_GLOBAL (r
) = NEW_EXPR_USE_GLOBAL (t
);
13903 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
13904 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
13905 r
= build_nt (code
, op0
, op1
);
13906 DELETE_EXPR_USE_GLOBAL (r
) = DELETE_EXPR_USE_GLOBAL (t
);
13907 DELETE_EXPR_USE_VEC (r
) = DELETE_EXPR_USE_VEC (t
);
13911 case TEMPLATE_ID_EXPR
:
13913 /* Substituted template arguments */
13914 tree fn
= TREE_OPERAND (t
, 0);
13915 tree targs
= TREE_OPERAND (t
, 1);
13917 fn
= tsubst_copy (fn
, args
, complain
, in_decl
);
13919 targs
= tsubst_template_args (targs
, args
, complain
, in_decl
);
13921 return lookup_template_function (fn
, targs
);
13926 tree purpose
, value
, chain
;
13928 if (t
== void_list_node
)
13931 purpose
= TREE_PURPOSE (t
);
13933 purpose
= tsubst_copy (purpose
, args
, complain
, in_decl
);
13934 value
= TREE_VALUE (t
);
13936 value
= tsubst_copy (value
, args
, complain
, in_decl
);
13937 chain
= TREE_CHAIN (t
);
13938 if (chain
&& chain
!= void_type_node
)
13939 chain
= tsubst_copy (chain
, args
, complain
, in_decl
);
13940 if (purpose
== TREE_PURPOSE (t
)
13941 && value
== TREE_VALUE (t
)
13942 && chain
== TREE_CHAIN (t
))
13944 return tree_cons (purpose
, value
, chain
);
13949 case ENUMERAL_TYPE
:
13951 case TEMPLATE_TYPE_PARM
:
13952 case TEMPLATE_TEMPLATE_PARM
:
13953 case BOUND_TEMPLATE_TEMPLATE_PARM
:
13954 case TEMPLATE_PARM_INDEX
:
13956 case REFERENCE_TYPE
:
13958 case FUNCTION_TYPE
:
13961 case TYPENAME_TYPE
:
13962 case UNBOUND_CLASS_TEMPLATE
:
13964 case DECLTYPE_TYPE
:
13966 return tsubst (t
, args
, complain
, in_decl
);
13970 /* Fall through. */
13971 case IDENTIFIER_NODE
:
13972 if (IDENTIFIER_TYPENAME_P (t
))
13974 tree new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
13975 return mangle_conv_op_name_for_type (new_type
);
13981 /* This is handled by tsubst_copy_and_build. */
13982 gcc_unreachable ();
13986 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
13987 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
13988 return build_x_va_arg (EXPR_LOCATION (t
), op0
, type
);
13991 case CLEANUP_POINT_EXPR
:
13992 /* We shouldn't have built any of these during initial template
13993 generation. Instead, they should be built during instantiation
13994 in response to the saved STMT_IS_FULL_EXPR_P setting. */
13995 gcc_unreachable ();
13999 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
14000 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
14001 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
14002 r
= build2 (code
, type
, op0
, op1
);
14003 PTRMEM_OK_P (r
) = PTRMEM_OK_P (t
);
14004 if (!mark_used (TREE_OPERAND (r
, 1), complain
)
14005 && !(complain
& tf_error
))
14006 return error_mark_node
;
14010 case EXPR_PACK_EXPANSION
:
14011 error ("invalid use of pack expansion expression");
14012 return error_mark_node
;
14014 case NONTYPE_ARGUMENT_PACK
:
14015 error ("use %<...%> to expand argument pack");
14016 return error_mark_node
;
14019 gcc_checking_assert (t
== void_node
&& VOID_TYPE_P (TREE_TYPE (t
)));
14027 /* Instantiate any typedefs in the type. */
14028 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
14029 r
= fold_convert (type
, t
);
14030 gcc_assert (TREE_CODE (r
) == code
);
14035 /* These can sometimes show up in a partial instantiation, but never
14036 involve template parms. */
14037 gcc_assert (!uses_template_parms (t
));
14041 /* We shouldn't get here, but keep going if !ENABLE_CHECKING. */
14042 gcc_checking_assert (false);
14047 /* Helper function for tsubst_omp_clauses, used for instantiation of
14048 OMP_CLAUSE_DECL of clauses that handles also OpenMP array sections
14049 represented with TREE_LIST. */
14052 tsubst_omp_clause_decl (tree decl
, tree args
, tsubst_flags_t complain
,
14055 if (TREE_CODE (decl
) == TREE_LIST
)
14058 = tsubst_expr (TREE_PURPOSE (decl
), args
, complain
, in_decl
,
14059 /*integral_constant_expression_p=*/false);
14060 tree length
= tsubst_expr (TREE_VALUE (decl
), args
, complain
, in_decl
,
14061 /*integral_constant_expression_p=*/false);
14062 tree chain
= tsubst_omp_clause_decl (TREE_CHAIN (decl
), args
, complain
,
14064 if (TREE_PURPOSE (decl
) == low_bound
14065 && TREE_VALUE (decl
) == length
14066 && TREE_CHAIN (decl
) == chain
)
14068 return tree_cons (low_bound
, length
, chain
);
14070 return tsubst_copy (decl
, args
, complain
, in_decl
);
14073 /* Like tsubst_copy, but specifically for OpenMP clauses. */
14076 tsubst_omp_clauses (tree clauses
, bool declare_simd
,
14077 tree args
, tsubst_flags_t complain
, tree in_decl
)
14079 tree new_clauses
= NULL
, nc
, oc
;
14081 for (oc
= clauses
; oc
; oc
= OMP_CLAUSE_CHAIN (oc
))
14083 nc
= copy_node (oc
);
14084 OMP_CLAUSE_CHAIN (nc
) = new_clauses
;
14087 switch (OMP_CLAUSE_CODE (nc
))
14089 case OMP_CLAUSE_LASTPRIVATE
:
14090 if (OMP_CLAUSE_LASTPRIVATE_STMT (oc
))
14092 OMP_CLAUSE_LASTPRIVATE_STMT (nc
) = push_stmt_list ();
14093 tsubst_expr (OMP_CLAUSE_LASTPRIVATE_STMT (oc
), args
, complain
,
14094 in_decl
, /*integral_constant_expression_p=*/false);
14095 OMP_CLAUSE_LASTPRIVATE_STMT (nc
)
14096 = pop_stmt_list (OMP_CLAUSE_LASTPRIVATE_STMT (nc
));
14099 case OMP_CLAUSE_PRIVATE
:
14100 case OMP_CLAUSE_SHARED
:
14101 case OMP_CLAUSE_FIRSTPRIVATE
:
14102 case OMP_CLAUSE_COPYIN
:
14103 case OMP_CLAUSE_COPYPRIVATE
:
14104 case OMP_CLAUSE_UNIFORM
:
14105 OMP_CLAUSE_DECL (nc
) = tsubst_copy (OMP_CLAUSE_DECL (oc
), args
,
14106 complain
, in_decl
);
14108 case OMP_CLAUSE_DEPEND
:
14109 case OMP_CLAUSE_FROM
:
14110 case OMP_CLAUSE_TO
:
14111 case OMP_CLAUSE_MAP
:
14112 OMP_CLAUSE_DECL (nc
)
14113 = tsubst_omp_clause_decl (OMP_CLAUSE_DECL (oc
), args
, complain
,
14116 case OMP_CLAUSE_IF
:
14117 case OMP_CLAUSE_NUM_THREADS
:
14118 case OMP_CLAUSE_SCHEDULE
:
14119 case OMP_CLAUSE_COLLAPSE
:
14120 case OMP_CLAUSE_FINAL
:
14121 case OMP_CLAUSE_DEVICE
:
14122 case OMP_CLAUSE_DIST_SCHEDULE
:
14123 case OMP_CLAUSE_NUM_TEAMS
:
14124 case OMP_CLAUSE_THREAD_LIMIT
:
14125 case OMP_CLAUSE_SAFELEN
:
14126 case OMP_CLAUSE_SIMDLEN
:
14127 OMP_CLAUSE_OPERAND (nc
, 0)
14128 = tsubst_expr (OMP_CLAUSE_OPERAND (oc
, 0), args
, complain
,
14129 in_decl
, /*integral_constant_expression_p=*/false);
14131 case OMP_CLAUSE_REDUCTION
:
14132 if (OMP_CLAUSE_REDUCTION_PLACEHOLDER (oc
))
14134 tree placeholder
= OMP_CLAUSE_REDUCTION_PLACEHOLDER (oc
);
14135 if (TREE_CODE (placeholder
) == SCOPE_REF
)
14137 tree scope
= tsubst (TREE_OPERAND (placeholder
, 0), args
,
14138 complain
, in_decl
);
14139 OMP_CLAUSE_REDUCTION_PLACEHOLDER (nc
)
14140 = build_qualified_name (NULL_TREE
, scope
,
14141 TREE_OPERAND (placeholder
, 1),
14145 gcc_assert (identifier_p (placeholder
));
14147 OMP_CLAUSE_DECL (nc
) = tsubst_copy (OMP_CLAUSE_DECL (oc
), args
,
14148 complain
, in_decl
);
14150 case OMP_CLAUSE_LINEAR
:
14151 case OMP_CLAUSE_ALIGNED
:
14152 OMP_CLAUSE_DECL (nc
) = tsubst_copy (OMP_CLAUSE_DECL (oc
), args
,
14153 complain
, in_decl
);
14154 OMP_CLAUSE_OPERAND (nc
, 1)
14155 = tsubst_expr (OMP_CLAUSE_OPERAND (oc
, 1), args
, complain
,
14156 in_decl
, /*integral_constant_expression_p=*/false);
14158 case OMP_CLAUSE_NOWAIT
:
14159 case OMP_CLAUSE_ORDERED
:
14160 case OMP_CLAUSE_DEFAULT
:
14161 case OMP_CLAUSE_UNTIED
:
14162 case OMP_CLAUSE_MERGEABLE
:
14163 case OMP_CLAUSE_INBRANCH
:
14164 case OMP_CLAUSE_NOTINBRANCH
:
14165 case OMP_CLAUSE_PROC_BIND
:
14166 case OMP_CLAUSE_FOR
:
14167 case OMP_CLAUSE_PARALLEL
:
14168 case OMP_CLAUSE_SECTIONS
:
14169 case OMP_CLAUSE_TASKGROUP
:
14172 gcc_unreachable ();
14176 new_clauses
= nreverse (new_clauses
);
14178 new_clauses
= finish_omp_clauses (new_clauses
);
14179 return new_clauses
;
14182 /* Like tsubst_copy_and_build, but unshare TREE_LIST nodes. */
14185 tsubst_copy_asm_operands (tree t
, tree args
, tsubst_flags_t complain
,
14188 #define RECUR(t) tsubst_copy_asm_operands (t, args, complain, in_decl)
14190 tree purpose
, value
, chain
;
14195 if (TREE_CODE (t
) != TREE_LIST
)
14196 return tsubst_copy_and_build (t
, args
, complain
, in_decl
,
14197 /*function_p=*/false,
14198 /*integral_constant_expression_p=*/false);
14200 if (t
== void_list_node
)
14203 purpose
= TREE_PURPOSE (t
);
14205 purpose
= RECUR (purpose
);
14206 value
= TREE_VALUE (t
);
14209 if (TREE_CODE (value
) != LABEL_DECL
)
14210 value
= RECUR (value
);
14213 value
= lookup_label (DECL_NAME (value
));
14214 gcc_assert (TREE_CODE (value
) == LABEL_DECL
);
14215 TREE_USED (value
) = 1;
14218 chain
= TREE_CHAIN (t
);
14219 if (chain
&& chain
!= void_type_node
)
14220 chain
= RECUR (chain
);
14221 return tree_cons (purpose
, value
, chain
);
14225 /* Substitute one OMP_FOR iterator. */
14228 tsubst_omp_for_iterator (tree t
, int i
, tree declv
, tree initv
,
14229 tree condv
, tree incrv
, tree
*clauses
,
14230 tree args
, tsubst_flags_t complain
, tree in_decl
,
14231 bool integral_constant_expression_p
)
14233 #define RECUR(NODE) \
14234 tsubst_expr ((NODE), args, complain, in_decl, \
14235 integral_constant_expression_p)
14236 tree decl
, init
, cond
, incr
;
14238 init
= TREE_VEC_ELT (OMP_FOR_INIT (t
), i
);
14239 gcc_assert (TREE_CODE (init
) == MODIFY_EXPR
);
14240 decl
= TREE_OPERAND (init
, 0);
14241 init
= TREE_OPERAND (init
, 1);
14242 tree decl_expr
= NULL_TREE
;
14243 if (init
&& TREE_CODE (init
) == DECL_EXPR
)
14245 /* We need to jump through some hoops to handle declarations in the
14246 for-init-statement, since we might need to handle auto deduction,
14247 but we need to keep control of initialization. */
14249 init
= DECL_INITIAL (DECL_EXPR_DECL (init
));
14250 decl
= tsubst_decl (decl
, args
, complain
);
14253 decl
= RECUR (decl
);
14254 init
= RECUR (init
);
14256 tree auto_node
= type_uses_auto (TREE_TYPE (decl
));
14257 if (auto_node
&& init
)
14259 = do_auto_deduction (TREE_TYPE (decl
), init
, auto_node
);
14261 gcc_assert (!type_dependent_expression_p (decl
));
14263 if (!CLASS_TYPE_P (TREE_TYPE (decl
)))
14267 /* Declare the variable, but don't let that initialize it. */
14268 tree init_sav
= DECL_INITIAL (DECL_EXPR_DECL (decl_expr
));
14269 DECL_INITIAL (DECL_EXPR_DECL (decl_expr
)) = NULL_TREE
;
14271 DECL_INITIAL (DECL_EXPR_DECL (decl_expr
)) = init_sav
;
14274 cond
= RECUR (TREE_VEC_ELT (OMP_FOR_COND (t
), i
));
14275 incr
= TREE_VEC_ELT (OMP_FOR_INCR (t
), i
);
14276 if (TREE_CODE (incr
) == MODIFY_EXPR
)
14278 tree lhs
= RECUR (TREE_OPERAND (incr
, 0));
14279 tree rhs
= RECUR (TREE_OPERAND (incr
, 1));
14280 incr
= build_x_modify_expr (EXPR_LOCATION (incr
), lhs
,
14281 NOP_EXPR
, rhs
, complain
);
14284 incr
= RECUR (incr
);
14285 TREE_VEC_ELT (declv
, i
) = decl
;
14286 TREE_VEC_ELT (initv
, i
) = init
;
14287 TREE_VEC_ELT (condv
, i
) = cond
;
14288 TREE_VEC_ELT (incrv
, i
) = incr
;
14294 /* Declare and initialize the variable. */
14301 for (c
= *clauses
; c
; c
= OMP_CLAUSE_CHAIN (c
))
14303 if ((OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_PRIVATE
14304 || OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_LASTPRIVATE
)
14305 && OMP_CLAUSE_DECL (c
) == decl
)
14307 else if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_FIRSTPRIVATE
14308 && OMP_CLAUSE_DECL (c
) == decl
)
14309 error ("iteration variable %qD should not be firstprivate", decl
);
14310 else if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_REDUCTION
14311 && OMP_CLAUSE_DECL (c
) == decl
)
14312 error ("iteration variable %qD should not be reduction", decl
);
14316 c
= build_omp_clause (input_location
, OMP_CLAUSE_PRIVATE
);
14317 OMP_CLAUSE_DECL (c
) = decl
;
14318 c
= finish_omp_clauses (c
);
14321 OMP_CLAUSE_CHAIN (c
) = *clauses
;
14326 cond
= TREE_VEC_ELT (OMP_FOR_COND (t
), i
);
14327 if (COMPARISON_CLASS_P (cond
))
14329 tree op0
= RECUR (TREE_OPERAND (cond
, 0));
14330 tree op1
= RECUR (TREE_OPERAND (cond
, 1));
14331 cond
= build2 (TREE_CODE (cond
), boolean_type_node
, op0
, op1
);
14334 cond
= RECUR (cond
);
14335 incr
= TREE_VEC_ELT (OMP_FOR_INCR (t
), i
);
14336 switch (TREE_CODE (incr
))
14338 case PREINCREMENT_EXPR
:
14339 case PREDECREMENT_EXPR
:
14340 case POSTINCREMENT_EXPR
:
14341 case POSTDECREMENT_EXPR
:
14342 incr
= build2 (TREE_CODE (incr
), TREE_TYPE (decl
),
14343 RECUR (TREE_OPERAND (incr
, 0)), NULL_TREE
);
14346 if (TREE_CODE (TREE_OPERAND (incr
, 1)) == PLUS_EXPR
14347 || TREE_CODE (TREE_OPERAND (incr
, 1)) == MINUS_EXPR
)
14349 tree rhs
= TREE_OPERAND (incr
, 1);
14350 tree lhs
= RECUR (TREE_OPERAND (incr
, 0));
14351 tree rhs0
= RECUR (TREE_OPERAND (rhs
, 0));
14352 tree rhs1
= RECUR (TREE_OPERAND (rhs
, 1));
14353 incr
= build2 (MODIFY_EXPR
, TREE_TYPE (decl
), lhs
,
14354 build2 (TREE_CODE (rhs
), TREE_TYPE (decl
),
14358 incr
= RECUR (incr
);
14361 if (TREE_CODE (TREE_OPERAND (incr
, 1)) == PLUS_EXPR
14362 || TREE_CODE (TREE_OPERAND (incr
, 1)) == MINUS_EXPR
)
14364 tree lhs
= RECUR (TREE_OPERAND (incr
, 0));
14365 incr
= build2 (MODIFY_EXPR
, TREE_TYPE (decl
), lhs
,
14366 build2 (TREE_CODE (TREE_OPERAND (incr
, 1)),
14367 TREE_TYPE (decl
), lhs
,
14368 RECUR (TREE_OPERAND (incr
, 2))));
14370 else if (TREE_CODE (TREE_OPERAND (incr
, 1)) == NOP_EXPR
14371 && (TREE_CODE (TREE_OPERAND (incr
, 2)) == PLUS_EXPR
14372 || (TREE_CODE (TREE_OPERAND (incr
, 2)) == MINUS_EXPR
)))
14374 tree rhs
= TREE_OPERAND (incr
, 2);
14375 tree lhs
= RECUR (TREE_OPERAND (incr
, 0));
14376 tree rhs0
= RECUR (TREE_OPERAND (rhs
, 0));
14377 tree rhs1
= RECUR (TREE_OPERAND (rhs
, 1));
14378 incr
= build2 (MODIFY_EXPR
, TREE_TYPE (decl
), lhs
,
14379 build2 (TREE_CODE (rhs
), TREE_TYPE (decl
),
14383 incr
= RECUR (incr
);
14386 incr
= RECUR (incr
);
14390 TREE_VEC_ELT (declv
, i
) = decl
;
14391 TREE_VEC_ELT (initv
, i
) = init
;
14392 TREE_VEC_ELT (condv
, i
) = cond
;
14393 TREE_VEC_ELT (incrv
, i
) = incr
;
14397 /* Like tsubst_copy for expressions, etc. but also does semantic
14401 tsubst_expr (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
,
14402 bool integral_constant_expression_p
)
14404 #define RETURN(EXP) do { r = (EXP); goto out; } while(0)
14405 #define RECUR(NODE) \
14406 tsubst_expr ((NODE), args, complain, in_decl, \
14407 integral_constant_expression_p)
14413 if (t
== NULL_TREE
|| t
== error_mark_node
)
14416 loc
= input_location
;
14417 if (EXPR_HAS_LOCATION (t
))
14418 input_location
= EXPR_LOCATION (t
);
14419 if (STATEMENT_CODE_P (TREE_CODE (t
)))
14420 current_stmt_tree ()->stmts_are_full_exprs_p
= STMT_IS_FULL_EXPR_P (t
);
14422 switch (TREE_CODE (t
))
14424 case STATEMENT_LIST
:
14426 tree_stmt_iterator i
;
14427 for (i
= tsi_start (t
); !tsi_end_p (i
); tsi_next (&i
))
14428 RECUR (tsi_stmt (i
));
14432 case CTOR_INITIALIZER
:
14433 finish_mem_initializers (tsubst_initializer_list
14434 (TREE_OPERAND (t
, 0), args
));
14438 finish_return_stmt (RECUR (TREE_OPERAND (t
, 0)));
14442 tmp
= RECUR (EXPR_STMT_EXPR (t
));
14443 if (EXPR_STMT_STMT_EXPR_RESULT (t
))
14444 finish_stmt_expr_expr (tmp
, cur_stmt_expr
);
14446 finish_expr_stmt (tmp
);
14450 do_using_directive (USING_STMT_NAMESPACE (t
));
14455 tree decl
, pattern_decl
;
14458 pattern_decl
= decl
= DECL_EXPR_DECL (t
);
14459 if (TREE_CODE (decl
) == LABEL_DECL
)
14460 finish_label_decl (DECL_NAME (decl
));
14461 else if (TREE_CODE (decl
) == USING_DECL
)
14463 tree scope
= USING_DECL_SCOPE (decl
);
14464 tree name
= DECL_NAME (decl
);
14467 scope
= tsubst (scope
, args
, complain
, in_decl
);
14468 decl
= lookup_qualified_name (scope
, name
,
14469 /*is_type_p=*/false,
14470 /*complain=*/false);
14471 if (decl
== error_mark_node
|| TREE_CODE (decl
) == TREE_LIST
)
14472 qualified_name_lookup_error (scope
, name
, decl
, input_location
);
14474 do_local_using_decl (decl
, scope
, name
);
14476 else if (DECL_PACK_P (decl
))
14478 /* Don't build up decls for a variadic capture proxy, we'll
14479 instantiate the elements directly as needed. */
14484 init
= DECL_INITIAL (decl
);
14485 decl
= tsubst (decl
, args
, complain
, in_decl
);
14486 if (decl
!= error_mark_node
)
14488 /* By marking the declaration as instantiated, we avoid
14489 trying to instantiate it. Since instantiate_decl can't
14490 handle local variables, and since we've already done
14491 all that needs to be done, that's the right thing to
14494 DECL_TEMPLATE_INSTANTIATED (decl
) = 1;
14496 && ANON_AGGR_TYPE_P (TREE_TYPE (decl
)))
14497 /* Anonymous aggregates are a special case. */
14498 finish_anon_union (decl
);
14499 else if (is_capture_proxy (DECL_EXPR_DECL (t
)))
14501 DECL_CONTEXT (decl
) = current_function_decl
;
14502 if (DECL_NAME (decl
) == this_identifier
)
14504 tree lam
= DECL_CONTEXT (current_function_decl
);
14505 lam
= CLASSTYPE_LAMBDA_EXPR (lam
);
14506 LAMBDA_EXPR_THIS_CAPTURE (lam
) = decl
;
14508 insert_capture_proxy (decl
);
14510 else if (DECL_IMPLICIT_TYPEDEF_P (t
))
14511 /* We already did a pushtag. */;
14512 else if (TREE_CODE (decl
) == FUNCTION_DECL
14513 && DECL_OMP_DECLARE_REDUCTION_P (decl
)
14514 && DECL_FUNCTION_SCOPE_P (pattern_decl
))
14516 DECL_CONTEXT (decl
) = NULL_TREE
;
14518 DECL_CONTEXT (decl
) = current_function_decl
;
14519 cp_check_omp_declare_reduction (decl
);
14523 int const_init
= false;
14524 maybe_push_decl (decl
);
14526 && DECL_PRETTY_FUNCTION_P (decl
))
14528 /* For __PRETTY_FUNCTION__ we have to adjust the
14530 const char *const name
14531 = cxx_printable_name (current_function_decl
, 2);
14532 init
= cp_fname_init (name
, &TREE_TYPE (decl
));
14535 init
= tsubst_init (init
, decl
, args
, complain
, in_decl
);
14538 const_init
= (DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P
14540 cp_finish_decl (decl
, init
, const_init
, NULL_TREE
, 0);
14549 stmt
= begin_for_stmt (NULL_TREE
, NULL_TREE
);
14550 RECUR (FOR_INIT_STMT (t
));
14551 finish_for_init_stmt (stmt
);
14552 tmp
= RECUR (FOR_COND (t
));
14553 finish_for_cond (tmp
, stmt
, false);
14554 tmp
= RECUR (FOR_EXPR (t
));
14555 finish_for_expr (tmp
, stmt
);
14556 RECUR (FOR_BODY (t
));
14557 finish_for_stmt (stmt
);
14560 case RANGE_FOR_STMT
:
14563 stmt
= begin_for_stmt (NULL_TREE
, NULL_TREE
);
14564 decl
= RANGE_FOR_DECL (t
);
14565 decl
= tsubst (decl
, args
, complain
, in_decl
);
14566 maybe_push_decl (decl
);
14567 expr
= RECUR (RANGE_FOR_EXPR (t
));
14568 stmt
= cp_convert_range_for (stmt
, decl
, expr
, RANGE_FOR_IVDEP (t
));
14569 RECUR (RANGE_FOR_BODY (t
));
14570 finish_for_stmt (stmt
);
14575 stmt
= begin_while_stmt ();
14576 tmp
= RECUR (WHILE_COND (t
));
14577 finish_while_stmt_cond (tmp
, stmt
, false);
14578 RECUR (WHILE_BODY (t
));
14579 finish_while_stmt (stmt
);
14583 stmt
= begin_do_stmt ();
14584 RECUR (DO_BODY (t
));
14585 finish_do_body (stmt
);
14586 tmp
= RECUR (DO_COND (t
));
14587 finish_do_stmt (tmp
, stmt
, false);
14591 stmt
= begin_if_stmt ();
14592 tmp
= RECUR (IF_COND (t
));
14593 finish_if_stmt_cond (tmp
, stmt
);
14594 RECUR (THEN_CLAUSE (t
));
14595 finish_then_clause (stmt
);
14597 if (ELSE_CLAUSE (t
))
14599 begin_else_clause (stmt
);
14600 RECUR (ELSE_CLAUSE (t
));
14601 finish_else_clause (stmt
);
14604 finish_if_stmt (stmt
);
14608 if (BIND_EXPR_BODY_BLOCK (t
))
14609 stmt
= begin_function_body ();
14611 stmt
= begin_compound_stmt (BIND_EXPR_TRY_BLOCK (t
)
14612 ? BCS_TRY_BLOCK
: 0);
14614 RECUR (BIND_EXPR_BODY (t
));
14616 if (BIND_EXPR_BODY_BLOCK (t
))
14617 finish_function_body (stmt
);
14619 finish_compound_stmt (stmt
);
14623 finish_break_stmt ();
14626 case CONTINUE_STMT
:
14627 finish_continue_stmt ();
14631 stmt
= begin_switch_stmt ();
14632 tmp
= RECUR (SWITCH_STMT_COND (t
));
14633 finish_switch_cond (tmp
, stmt
);
14634 RECUR (SWITCH_STMT_BODY (t
));
14635 finish_switch_stmt (stmt
);
14638 case CASE_LABEL_EXPR
:
14640 tree low
= RECUR (CASE_LOW (t
));
14641 tree high
= RECUR (CASE_HIGH (t
));
14642 finish_case_label (EXPR_LOCATION (t
), low
, high
);
14648 tree decl
= LABEL_EXPR_LABEL (t
);
14651 label
= finish_label_stmt (DECL_NAME (decl
));
14652 if (DECL_ATTRIBUTES (decl
) != NULL_TREE
)
14653 cplus_decl_attributes (&label
, DECL_ATTRIBUTES (decl
), 0);
14658 tmp
= GOTO_DESTINATION (t
);
14659 if (TREE_CODE (tmp
) != LABEL_DECL
)
14660 /* Computed goto's must be tsubst'd into. On the other hand,
14661 non-computed gotos must not be; the identifier in question
14662 will have no binding. */
14665 tmp
= DECL_NAME (tmp
);
14666 finish_goto_stmt (tmp
);
14671 tree string
= RECUR (ASM_STRING (t
));
14672 tree outputs
= tsubst_copy_asm_operands (ASM_OUTPUTS (t
), args
,
14673 complain
, in_decl
);
14674 tree inputs
= tsubst_copy_asm_operands (ASM_INPUTS (t
), args
,
14675 complain
, in_decl
);
14676 tree clobbers
= tsubst_copy_asm_operands (ASM_CLOBBERS (t
), args
,
14677 complain
, in_decl
);
14678 tree labels
= tsubst_copy_asm_operands (ASM_LABELS (t
), args
,
14679 complain
, in_decl
);
14680 tmp
= finish_asm_stmt (ASM_VOLATILE_P (t
), string
, outputs
, inputs
,
14682 tree asm_expr
= tmp
;
14683 if (TREE_CODE (asm_expr
) == CLEANUP_POINT_EXPR
)
14684 asm_expr
= TREE_OPERAND (asm_expr
, 0);
14685 ASM_INPUT_P (asm_expr
) = ASM_INPUT_P (t
);
14692 stmt
= begin_try_block ();
14693 RECUR (TRY_STMTS (t
));
14694 finish_cleanup_try_block (stmt
);
14695 finish_cleanup (RECUR (TRY_HANDLERS (t
)), stmt
);
14699 tree compound_stmt
= NULL_TREE
;
14701 if (FN_TRY_BLOCK_P (t
))
14702 stmt
= begin_function_try_block (&compound_stmt
);
14704 stmt
= begin_try_block ();
14706 RECUR (TRY_STMTS (t
));
14708 if (FN_TRY_BLOCK_P (t
))
14709 finish_function_try_block (stmt
);
14711 finish_try_block (stmt
);
14713 RECUR (TRY_HANDLERS (t
));
14714 if (FN_TRY_BLOCK_P (t
))
14715 finish_function_handler_sequence (stmt
, compound_stmt
);
14717 finish_handler_sequence (stmt
);
14723 tree decl
= HANDLER_PARMS (t
);
14727 decl
= tsubst (decl
, args
, complain
, in_decl
);
14728 /* Prevent instantiate_decl from trying to instantiate
14729 this variable. We've already done all that needs to be
14731 if (decl
!= error_mark_node
)
14732 DECL_TEMPLATE_INSTANTIATED (decl
) = 1;
14734 stmt
= begin_handler ();
14735 finish_handler_parms (decl
, stmt
);
14736 RECUR (HANDLER_BODY (t
));
14737 finish_handler (stmt
);
14742 tmp
= tsubst (TREE_TYPE (t
), args
, complain
, NULL_TREE
);
14743 if (CLASS_TYPE_P (tmp
))
14745 /* Local classes are not independent templates; they are
14746 instantiated along with their containing function. And this
14747 way we don't have to deal with pushing out of one local class
14748 to instantiate a member of another local class. */
14750 /* Closures are handled by the LAMBDA_EXPR. */
14751 gcc_assert (!LAMBDA_TYPE_P (TREE_TYPE (t
)));
14752 complete_type (tmp
);
14753 for (fn
= TYPE_METHODS (tmp
); fn
; fn
= DECL_CHAIN (fn
))
14754 if (!DECL_ARTIFICIAL (fn
))
14755 instantiate_decl (fn
, /*defer_ok*/0, /*expl_inst_class*/false);
14759 case STATIC_ASSERT
:
14763 ++c_inhibit_evaluation_warnings
;
14765 tsubst_expr (STATIC_ASSERT_CONDITION (t
),
14768 /*integral_constant_expression_p=*/true);
14769 --c_inhibit_evaluation_warnings
;
14771 finish_static_assert (condition
,
14772 STATIC_ASSERT_MESSAGE (t
),
14773 STATIC_ASSERT_SOURCE_LOCATION (t
),
14774 /*member_p=*/false);
14779 tmp
= tsubst_omp_clauses (OMP_PARALLEL_CLAUSES (t
), false,
14780 args
, complain
, in_decl
);
14781 stmt
= begin_omp_parallel ();
14782 RECUR (OMP_PARALLEL_BODY (t
));
14783 OMP_PARALLEL_COMBINED (finish_omp_parallel (tmp
, stmt
))
14784 = OMP_PARALLEL_COMBINED (t
);
14788 tmp
= tsubst_omp_clauses (OMP_TASK_CLAUSES (t
), false,
14789 args
, complain
, in_decl
);
14790 stmt
= begin_omp_task ();
14791 RECUR (OMP_TASK_BODY (t
));
14792 finish_omp_task (tmp
, stmt
);
14799 case OMP_DISTRIBUTE
:
14801 tree clauses
, body
, pre_body
;
14802 tree declv
= NULL_TREE
, initv
= NULL_TREE
, condv
= NULL_TREE
;
14803 tree incrv
= NULL_TREE
;
14806 clauses
= tsubst_omp_clauses (OMP_FOR_CLAUSES (t
), false,
14807 args
, complain
, in_decl
);
14808 if (OMP_FOR_INIT (t
) != NULL_TREE
)
14810 declv
= make_tree_vec (TREE_VEC_LENGTH (OMP_FOR_INIT (t
)));
14811 initv
= make_tree_vec (TREE_VEC_LENGTH (OMP_FOR_INIT (t
)));
14812 condv
= make_tree_vec (TREE_VEC_LENGTH (OMP_FOR_INIT (t
)));
14813 incrv
= make_tree_vec (TREE_VEC_LENGTH (OMP_FOR_INIT (t
)));
14816 stmt
= begin_omp_structured_block ();
14818 pre_body
= push_stmt_list ();
14819 RECUR (OMP_FOR_PRE_BODY (t
));
14820 pre_body
= pop_stmt_list (pre_body
);
14822 if (OMP_FOR_INIT (t
) != NULL_TREE
)
14823 for (i
= 0; i
< TREE_VEC_LENGTH (OMP_FOR_INIT (t
)); i
++)
14824 tsubst_omp_for_iterator (t
, i
, declv
, initv
, condv
, incrv
,
14825 &clauses
, args
, complain
, in_decl
,
14826 integral_constant_expression_p
);
14828 body
= push_stmt_list ();
14829 RECUR (OMP_FOR_BODY (t
));
14830 body
= pop_stmt_list (body
);
14832 if (OMP_FOR_INIT (t
) != NULL_TREE
)
14833 t
= finish_omp_for (EXPR_LOCATION (t
), TREE_CODE (t
), declv
, initv
,
14834 condv
, incrv
, body
, pre_body
, clauses
);
14837 t
= make_node (TREE_CODE (t
));
14838 TREE_TYPE (t
) = void_type_node
;
14839 OMP_FOR_BODY (t
) = body
;
14840 OMP_FOR_PRE_BODY (t
) = pre_body
;
14841 OMP_FOR_CLAUSES (t
) = clauses
;
14842 SET_EXPR_LOCATION (t
, EXPR_LOCATION (t
));
14846 add_stmt (finish_omp_structured_block (stmt
));
14853 tmp
= tsubst_omp_clauses (OMP_CLAUSES (t
), false,
14854 args
, complain
, in_decl
);
14855 stmt
= push_stmt_list ();
14856 RECUR (OMP_BODY (t
));
14857 stmt
= pop_stmt_list (stmt
);
14860 OMP_BODY (t
) = stmt
;
14861 OMP_CLAUSES (t
) = tmp
;
14865 case OMP_TARGET_DATA
:
14867 tmp
= tsubst_omp_clauses (OMP_CLAUSES (t
), false,
14868 args
, complain
, in_decl
);
14869 keep_next_level (true);
14870 stmt
= begin_omp_structured_block ();
14872 RECUR (OMP_BODY (t
));
14873 stmt
= finish_omp_structured_block (stmt
);
14876 OMP_BODY (t
) = stmt
;
14877 OMP_CLAUSES (t
) = tmp
;
14881 case OMP_TARGET_UPDATE
:
14882 tmp
= tsubst_omp_clauses (OMP_TARGET_UPDATE_CLAUSES (t
), false,
14883 args
, complain
, in_decl
);
14885 OMP_TARGET_UPDATE_CLAUSES (t
) = tmp
;
14892 case OMP_TASKGROUP
:
14894 stmt
= push_stmt_list ();
14895 RECUR (OMP_BODY (t
));
14896 stmt
= pop_stmt_list (stmt
);
14899 OMP_BODY (t
) = stmt
;
14904 gcc_assert (OMP_ATOMIC_DEPENDENT_P (t
));
14905 if (TREE_CODE (TREE_OPERAND (t
, 1)) != MODIFY_EXPR
)
14907 tree op1
= TREE_OPERAND (t
, 1);
14908 tree rhs1
= NULL_TREE
;
14910 if (TREE_CODE (op1
) == COMPOUND_EXPR
)
14912 rhs1
= RECUR (TREE_OPERAND (op1
, 0));
14913 op1
= TREE_OPERAND (op1
, 1);
14915 lhs
= RECUR (TREE_OPERAND (op1
, 0));
14916 rhs
= RECUR (TREE_OPERAND (op1
, 1));
14917 finish_omp_atomic (OMP_ATOMIC
, TREE_CODE (op1
), lhs
, rhs
,
14918 NULL_TREE
, NULL_TREE
, rhs1
,
14919 OMP_ATOMIC_SEQ_CST (t
));
14923 tree op1
= TREE_OPERAND (t
, 1);
14924 tree v
= NULL_TREE
, lhs
, rhs
= NULL_TREE
, lhs1
= NULL_TREE
;
14925 tree rhs1
= NULL_TREE
;
14926 enum tree_code code
= TREE_CODE (TREE_OPERAND (op1
, 1));
14927 enum tree_code opcode
= NOP_EXPR
;
14928 if (code
== OMP_ATOMIC_READ
)
14930 v
= RECUR (TREE_OPERAND (op1
, 0));
14931 lhs
= RECUR (TREE_OPERAND (TREE_OPERAND (op1
, 1), 0));
14933 else if (code
== OMP_ATOMIC_CAPTURE_OLD
14934 || code
== OMP_ATOMIC_CAPTURE_NEW
)
14936 tree op11
= TREE_OPERAND (TREE_OPERAND (op1
, 1), 1);
14937 v
= RECUR (TREE_OPERAND (op1
, 0));
14938 lhs1
= RECUR (TREE_OPERAND (TREE_OPERAND (op1
, 1), 0));
14939 if (TREE_CODE (op11
) == COMPOUND_EXPR
)
14941 rhs1
= RECUR (TREE_OPERAND (op11
, 0));
14942 op11
= TREE_OPERAND (op11
, 1);
14944 lhs
= RECUR (TREE_OPERAND (op11
, 0));
14945 rhs
= RECUR (TREE_OPERAND (op11
, 1));
14946 opcode
= TREE_CODE (op11
);
14947 if (opcode
== MODIFY_EXPR
)
14953 lhs
= RECUR (TREE_OPERAND (op1
, 0));
14954 rhs
= RECUR (TREE_OPERAND (op1
, 1));
14956 finish_omp_atomic (code
, opcode
, lhs
, rhs
, v
, lhs1
, rhs1
,
14957 OMP_ATOMIC_SEQ_CST (t
));
14961 case TRANSACTION_EXPR
:
14964 flags
|= (TRANSACTION_EXPR_OUTER (t
) ? TM_STMT_ATTR_OUTER
: 0);
14965 flags
|= (TRANSACTION_EXPR_RELAXED (t
) ? TM_STMT_ATTR_RELAXED
: 0);
14967 if (TRANSACTION_EXPR_IS_STMT (t
))
14969 tree body
= TRANSACTION_EXPR_BODY (t
);
14970 tree noex
= NULL_TREE
;
14971 if (TREE_CODE (body
) == MUST_NOT_THROW_EXPR
)
14973 noex
= MUST_NOT_THROW_COND (body
);
14974 if (noex
== NULL_TREE
)
14975 noex
= boolean_true_node
;
14976 body
= TREE_OPERAND (body
, 0);
14978 stmt
= begin_transaction_stmt (input_location
, NULL
, flags
);
14980 finish_transaction_stmt (stmt
, NULL
, flags
, RECUR (noex
));
14984 stmt
= build_transaction_expr (EXPR_LOCATION (t
),
14985 RECUR (TRANSACTION_EXPR_BODY (t
)),
14992 case MUST_NOT_THROW_EXPR
:
14994 tree op0
= RECUR (TREE_OPERAND (t
, 0));
14995 tree cond
= RECUR (MUST_NOT_THROW_COND (t
));
14996 RETURN (build_must_not_throw_expr (op0
, cond
));
14999 case EXPR_PACK_EXPANSION
:
15000 error ("invalid use of pack expansion expression");
15001 RETURN (error_mark_node
);
15003 case NONTYPE_ARGUMENT_PACK
:
15004 error ("use %<...%> to expand argument pack");
15005 RETURN (error_mark_node
);
15007 case CILK_SPAWN_STMT
:
15008 cfun
->calls_cilk_spawn
= 1;
15009 RETURN (build_cilk_spawn (EXPR_LOCATION (t
), RECUR (CILK_SPAWN_FN (t
))));
15011 case CILK_SYNC_STMT
:
15012 RETURN (build_cilk_sync ());
15014 case COMPOUND_EXPR
:
15015 tmp
= RECUR (TREE_OPERAND (t
, 0));
15016 if (tmp
== NULL_TREE
)
15017 /* If the first operand was a statement, we're done with it. */
15018 RETURN (RECUR (TREE_OPERAND (t
, 1)));
15019 RETURN (build_x_compound_expr (EXPR_LOCATION (t
), tmp
,
15020 RECUR (TREE_OPERAND (t
, 1)),
15023 case ANNOTATE_EXPR
:
15024 tmp
= RECUR (TREE_OPERAND (t
, 0));
15025 RETURN (build2_loc (EXPR_LOCATION (t
), ANNOTATE_EXPR
,
15026 TREE_TYPE (tmp
), tmp
, RECUR (TREE_OPERAND (t
, 1))));
15029 gcc_assert (!STATEMENT_CODE_P (TREE_CODE (t
)));
15031 RETURN (tsubst_copy_and_build (t
, args
, complain
, in_decl
,
15032 /*function_p=*/false,
15033 integral_constant_expression_p
));
15036 RETURN (NULL_TREE
);
15038 input_location
= loc
;
15044 /* Instantiate the special body of the artificial DECL_OMP_DECLARE_REDUCTION
15045 function. For description of the body see comment above
15046 cp_parser_omp_declare_reduction_exprs. */
15049 tsubst_omp_udr (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
15051 if (t
== NULL_TREE
|| t
== error_mark_node
)
15054 gcc_assert (TREE_CODE (t
) == STATEMENT_LIST
);
15056 tree_stmt_iterator tsi
;
15059 memset (stmts
, 0, sizeof stmts
);
15060 for (i
= 0, tsi
= tsi_start (t
);
15061 i
< 7 && !tsi_end_p (tsi
);
15062 i
++, tsi_next (&tsi
))
15063 stmts
[i
] = tsi_stmt (tsi
);
15064 gcc_assert (tsi_end_p (tsi
));
15068 gcc_assert (TREE_CODE (stmts
[0]) == DECL_EXPR
15069 && TREE_CODE (stmts
[1]) == DECL_EXPR
);
15070 tree omp_out
= tsubst (DECL_EXPR_DECL (stmts
[0]),
15071 args
, complain
, in_decl
);
15072 tree omp_in
= tsubst (DECL_EXPR_DECL (stmts
[1]),
15073 args
, complain
, in_decl
);
15074 DECL_CONTEXT (omp_out
) = current_function_decl
;
15075 DECL_CONTEXT (omp_in
) = current_function_decl
;
15076 keep_next_level (true);
15077 tree block
= begin_omp_structured_block ();
15078 tsubst_expr (stmts
[2], args
, complain
, in_decl
, false);
15079 block
= finish_omp_structured_block (block
);
15080 block
= maybe_cleanup_point_expr_void (block
);
15081 add_decl_expr (omp_out
);
15082 if (TREE_NO_WARNING (DECL_EXPR_DECL (stmts
[0])))
15083 TREE_NO_WARNING (omp_out
) = 1;
15084 add_decl_expr (omp_in
);
15085 finish_expr_stmt (block
);
15089 gcc_assert (TREE_CODE (stmts
[3]) == DECL_EXPR
15090 && TREE_CODE (stmts
[4]) == DECL_EXPR
);
15091 tree omp_priv
= tsubst (DECL_EXPR_DECL (stmts
[3]),
15092 args
, complain
, in_decl
);
15093 tree omp_orig
= tsubst (DECL_EXPR_DECL (stmts
[4]),
15094 args
, complain
, in_decl
);
15095 DECL_CONTEXT (omp_priv
) = current_function_decl
;
15096 DECL_CONTEXT (omp_orig
) = current_function_decl
;
15097 keep_next_level (true);
15098 tree block
= begin_omp_structured_block ();
15099 tsubst_expr (stmts
[5], args
, complain
, in_decl
, false);
15100 block
= finish_omp_structured_block (block
);
15101 block
= maybe_cleanup_point_expr_void (block
);
15102 cp_walk_tree (&block
, cp_remove_omp_priv_cleanup_stmt
, omp_priv
, NULL
);
15103 add_decl_expr (omp_priv
);
15104 add_decl_expr (omp_orig
);
15105 finish_expr_stmt (block
);
15107 add_decl_expr (omp_orig
);
15111 /* T is a postfix-expression that is not being used in a function
15112 call. Return the substituted version of T. */
15115 tsubst_non_call_postfix_expression (tree t
, tree args
,
15116 tsubst_flags_t complain
,
15119 if (TREE_CODE (t
) == SCOPE_REF
)
15120 t
= tsubst_qualified_id (t
, args
, complain
, in_decl
,
15121 /*done=*/false, /*address_p=*/false);
15123 t
= tsubst_copy_and_build (t
, args
, complain
, in_decl
,
15124 /*function_p=*/false,
15125 /*integral_constant_expression_p=*/false);
15130 /* Like tsubst but deals with expressions and performs semantic
15131 analysis. FUNCTION_P is true if T is the "F" in "F (ARGS)". */
15134 tsubst_copy_and_build (tree t
,
15136 tsubst_flags_t complain
,
15139 bool integral_constant_expression_p
)
15141 #define RETURN(EXP) do { retval = (EXP); goto out; } while(0)
15142 #define RECUR(NODE) \
15143 tsubst_copy_and_build (NODE, args, complain, in_decl, \
15144 /*function_p=*/false, \
15145 integral_constant_expression_p)
15150 if (t
== NULL_TREE
|| t
== error_mark_node
)
15153 loc
= input_location
;
15154 if (EXPR_HAS_LOCATION (t
))
15155 input_location
= EXPR_LOCATION (t
);
15157 /* N3276 decltype magic only applies to calls at the top level or on the
15158 right side of a comma. */
15159 tsubst_flags_t decltype_flag
= (complain
& tf_decltype
);
15160 complain
&= ~tf_decltype
;
15162 switch (TREE_CODE (t
))
15166 /* Fall through. */
15167 case IDENTIFIER_NODE
:
15171 bool non_integral_constant_expression_p
;
15172 const char *error_msg
;
15174 if (IDENTIFIER_TYPENAME_P (t
))
15176 tree new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
15177 t
= mangle_conv_op_name_for_type (new_type
);
15180 /* Look up the name. */
15181 decl
= lookup_name (t
);
15183 /* By convention, expressions use ERROR_MARK_NODE to indicate
15184 failure, not NULL_TREE. */
15185 if (decl
== NULL_TREE
)
15186 decl
= error_mark_node
;
15188 decl
= finish_id_expression (t
, decl
, NULL_TREE
,
15190 integral_constant_expression_p
,
15191 /*allow_non_integral_constant_expression_p=*/(cxx_dialect
>= cxx11
),
15192 &non_integral_constant_expression_p
,
15193 /*template_p=*/false,
15195 /*address_p=*/false,
15196 /*template_arg_p=*/false,
15201 if (!function_p
&& identifier_p (decl
))
15203 if (complain
& tf_error
)
15204 unqualified_name_lookup_error (decl
);
15205 decl
= error_mark_node
;
15210 case TEMPLATE_ID_EXPR
:
15213 tree templ
= RECUR (TREE_OPERAND (t
, 0));
15214 tree targs
= TREE_OPERAND (t
, 1);
15217 targs
= tsubst_template_args (targs
, args
, complain
, in_decl
);
15218 if (targs
== error_mark_node
)
15219 return error_mark_node
;
15221 if (variable_template_p (templ
))
15223 templ
= lookup_template_variable (templ
, targs
);
15224 if (!any_dependent_template_arguments_p (targs
))
15226 templ
= finish_template_variable (templ
, complain
);
15229 RETURN (convert_from_reference (templ
));
15232 if (TREE_CODE (templ
) == COMPONENT_REF
)
15234 object
= TREE_OPERAND (templ
, 0);
15235 templ
= TREE_OPERAND (templ
, 1);
15238 object
= NULL_TREE
;
15239 templ
= lookup_template_function (templ
, targs
);
15242 RETURN (build3 (COMPONENT_REF
, TREE_TYPE (templ
),
15243 object
, templ
, NULL_TREE
));
15245 RETURN (baselink_for_fns (templ
));
15250 tree r
= RECUR (TREE_OPERAND (t
, 0));
15252 if (REFERENCE_REF_P (t
))
15254 /* A type conversion to reference type will be enclosed in
15255 such an indirect ref, but the substitution of the cast
15256 will have also added such an indirect ref. */
15257 if (TREE_CODE (TREE_TYPE (r
)) == REFERENCE_TYPE
)
15258 r
= convert_from_reference (r
);
15261 r
= build_x_indirect_ref (input_location
, r
, RO_UNARY_STAR
,
15262 complain
|decltype_flag
);
15268 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
15269 tree op0
= RECUR (TREE_OPERAND (t
, 0));
15270 RETURN (build_nop (type
, op0
));
15273 case IMPLICIT_CONV_EXPR
:
15275 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
15276 tree expr
= RECUR (TREE_OPERAND (t
, 0));
15277 int flags
= LOOKUP_IMPLICIT
;
15278 if (IMPLICIT_CONV_EXPR_DIRECT_INIT (t
))
15279 flags
= LOOKUP_NORMAL
;
15280 RETURN (perform_implicit_conversion_flags (type
, expr
, complain
,
15286 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
15287 tree op0
= RECUR (TREE_OPERAND (t
, 0));
15288 RETURN (build1 (CONVERT_EXPR
, type
, op0
));
15292 case REINTERPRET_CAST_EXPR
:
15293 case CONST_CAST_EXPR
:
15294 case DYNAMIC_CAST_EXPR
:
15295 case STATIC_CAST_EXPR
:
15298 tree op
, r
= NULL_TREE
;
15300 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
15301 if (integral_constant_expression_p
15302 && !cast_valid_in_integral_constant_expression_p (type
))
15304 if (complain
& tf_error
)
15305 error ("a cast to a type other than an integral or "
15306 "enumeration type cannot appear in a constant-expression");
15307 RETURN (error_mark_node
);
15310 op
= RECUR (TREE_OPERAND (t
, 0));
15312 warning_sentinel
s(warn_useless_cast
);
15313 switch (TREE_CODE (t
))
15316 r
= build_functional_cast (type
, op
, complain
);
15318 case REINTERPRET_CAST_EXPR
:
15319 r
= build_reinterpret_cast (type
, op
, complain
);
15321 case CONST_CAST_EXPR
:
15322 r
= build_const_cast (type
, op
, complain
);
15324 case DYNAMIC_CAST_EXPR
:
15325 r
= build_dynamic_cast (type
, op
, complain
);
15327 case STATIC_CAST_EXPR
:
15328 r
= build_static_cast (type
, op
, complain
);
15331 gcc_unreachable ();
15337 case POSTDECREMENT_EXPR
:
15338 case POSTINCREMENT_EXPR
:
15339 op1
= tsubst_non_call_postfix_expression (TREE_OPERAND (t
, 0),
15340 args
, complain
, in_decl
);
15341 RETURN (build_x_unary_op (input_location
, TREE_CODE (t
), op1
,
15342 complain
|decltype_flag
));
15344 case PREDECREMENT_EXPR
:
15345 case PREINCREMENT_EXPR
:
15349 case TRUTH_NOT_EXPR
:
15350 case UNARY_PLUS_EXPR
: /* Unary + */
15351 case REALPART_EXPR
:
15352 case IMAGPART_EXPR
:
15353 RETURN (build_x_unary_op (input_location
, TREE_CODE (t
),
15354 RECUR (TREE_OPERAND (t
, 0)),
15355 complain
|decltype_flag
));
15357 case FIX_TRUNC_EXPR
:
15358 RETURN (cp_build_unary_op (FIX_TRUNC_EXPR
, RECUR (TREE_OPERAND (t
, 0)),
15362 op1
= TREE_OPERAND (t
, 0);
15363 if (TREE_CODE (op1
) == LABEL_DECL
)
15364 RETURN (finish_label_address_expr (DECL_NAME (op1
),
15365 EXPR_LOCATION (op1
)));
15366 if (TREE_CODE (op1
) == SCOPE_REF
)
15367 op1
= tsubst_qualified_id (op1
, args
, complain
, in_decl
,
15368 /*done=*/true, /*address_p=*/true);
15370 op1
= tsubst_non_call_postfix_expression (op1
, args
, complain
,
15372 RETURN (build_x_unary_op (input_location
, ADDR_EXPR
, op1
,
15373 complain
|decltype_flag
));
15378 case TRUNC_DIV_EXPR
:
15379 case CEIL_DIV_EXPR
:
15380 case FLOOR_DIV_EXPR
:
15381 case ROUND_DIV_EXPR
:
15382 case EXACT_DIV_EXPR
:
15386 case TRUNC_MOD_EXPR
:
15387 case FLOOR_MOD_EXPR
:
15388 case TRUTH_ANDIF_EXPR
:
15389 case TRUTH_ORIF_EXPR
:
15390 case TRUTH_AND_EXPR
:
15391 case TRUTH_OR_EXPR
:
15407 warning_sentinel
s1(warn_type_limits
);
15408 warning_sentinel
s2(warn_div_by_zero
);
15409 warning_sentinel
s3(warn_logical_op
);
15410 warning_sentinel
s4(warn_tautological_compare
);
15411 tree op0
= RECUR (TREE_OPERAND (t
, 0));
15412 tree op1
= RECUR (TREE_OPERAND (t
, 1));
15413 tree r
= build_x_binary_op
15414 (input_location
, TREE_CODE (t
),
15416 (TREE_NO_WARNING (TREE_OPERAND (t
, 0))
15418 : TREE_CODE (TREE_OPERAND (t
, 0))),
15420 (TREE_NO_WARNING (TREE_OPERAND (t
, 1))
15422 : TREE_CODE (TREE_OPERAND (t
, 1))),
15424 complain
|decltype_flag
);
15425 if (EXPR_P (r
) && TREE_NO_WARNING (t
))
15426 TREE_NO_WARNING (r
) = TREE_NO_WARNING (t
);
15431 case POINTER_PLUS_EXPR
:
15433 tree op0
= RECUR (TREE_OPERAND (t
, 0));
15434 tree op1
= RECUR (TREE_OPERAND (t
, 1));
15435 return fold_build_pointer_plus (op0
, op1
);
15439 RETURN (tsubst_qualified_id (t
, args
, complain
, in_decl
, /*done=*/true,
15440 /*address_p=*/false));
15442 op1
= tsubst_non_call_postfix_expression (TREE_OPERAND (t
, 0),
15443 args
, complain
, in_decl
);
15444 RETURN (build_x_array_ref (EXPR_LOCATION (t
), op1
,
15445 RECUR (TREE_OPERAND (t
, 1)),
15446 complain
|decltype_flag
));
15448 case ARRAY_NOTATION_REF
:
15450 tree start_index
, length
, stride
;
15451 op1
= tsubst_non_call_postfix_expression (ARRAY_NOTATION_ARRAY (t
),
15452 args
, complain
, in_decl
);
15453 start_index
= RECUR (ARRAY_NOTATION_START (t
));
15454 length
= RECUR (ARRAY_NOTATION_LENGTH (t
));
15455 stride
= RECUR (ARRAY_NOTATION_STRIDE (t
));
15456 RETURN (build_array_notation_ref (EXPR_LOCATION (t
), op1
, start_index
,
15457 length
, stride
, TREE_TYPE (op1
)));
15460 if (PACK_EXPANSION_P (TREE_OPERAND (t
, 0)))
15461 RETURN (tsubst_copy (t
, args
, complain
, in_decl
));
15468 op1
= TREE_OPERAND (t
, 0);
15469 if (TREE_CODE (t
) == SIZEOF_EXPR
&& SIZEOF_EXPR_TYPE_P (t
))
15470 op1
= TREE_TYPE (op1
);
15473 /* When there are no ARGS, we are trying to evaluate a
15474 non-dependent expression from the parser. Trying to do
15475 the substitutions may not work. */
15477 op1
= TREE_TYPE (op1
);
15481 ++cp_unevaluated_operand
;
15482 ++c_inhibit_evaluation_warnings
;
15484 op1
= tsubst (op1
, args
, complain
, in_decl
);
15486 op1
= tsubst_copy_and_build (op1
, args
, complain
, in_decl
,
15487 /*function_p=*/false,
15488 /*integral_constant_expression_p=*/
15490 --cp_unevaluated_operand
;
15491 --c_inhibit_evaluation_warnings
;
15494 r
= cxx_sizeof_or_alignof_type (op1
, TREE_CODE (t
),
15495 complain
& tf_error
);
15497 r
= cxx_sizeof_or_alignof_expr (op1
, TREE_CODE (t
),
15498 complain
& tf_error
);
15499 if (TREE_CODE (t
) == SIZEOF_EXPR
&& r
!= error_mark_node
)
15501 if (TREE_CODE (r
) != SIZEOF_EXPR
|| TYPE_P (op1
))
15503 if (!processing_template_decl
&& TYPE_P (op1
))
15505 r
= build_min (SIZEOF_EXPR
, size_type_node
,
15506 build1 (NOP_EXPR
, op1
, error_mark_node
));
15507 SIZEOF_EXPR_TYPE_P (r
) = 1;
15510 r
= build_min (SIZEOF_EXPR
, size_type_node
, op1
);
15511 TREE_SIDE_EFFECTS (r
) = 0;
15512 TREE_READONLY (r
) = 1;
15514 SET_EXPR_LOCATION (r
, EXPR_LOCATION (t
));
15519 case AT_ENCODE_EXPR
:
15521 op1
= TREE_OPERAND (t
, 0);
15522 ++cp_unevaluated_operand
;
15523 ++c_inhibit_evaluation_warnings
;
15524 op1
= tsubst_copy_and_build (op1
, args
, complain
, in_decl
,
15525 /*function_p=*/false,
15526 /*integral_constant_expression_p=*/false);
15527 --cp_unevaluated_operand
;
15528 --c_inhibit_evaluation_warnings
;
15529 RETURN (objc_build_encode_expr (op1
));
15532 case NOEXCEPT_EXPR
:
15533 op1
= TREE_OPERAND (t
, 0);
15534 ++cp_unevaluated_operand
;
15535 ++c_inhibit_evaluation_warnings
;
15536 ++cp_noexcept_operand
;
15537 op1
= tsubst_copy_and_build (op1
, args
, complain
, in_decl
,
15538 /*function_p=*/false,
15539 /*integral_constant_expression_p=*/false);
15540 --cp_unevaluated_operand
;
15541 --c_inhibit_evaluation_warnings
;
15542 --cp_noexcept_operand
;
15543 RETURN (finish_noexcept_expr (op1
, complain
));
15547 warning_sentinel
s(warn_div_by_zero
);
15548 tree lhs
= RECUR (TREE_OPERAND (t
, 0));
15549 tree rhs
= RECUR (TREE_OPERAND (t
, 2));
15550 tree r
= build_x_modify_expr
15551 (EXPR_LOCATION (t
), lhs
, TREE_CODE (TREE_OPERAND (t
, 1)), rhs
,
15552 complain
|decltype_flag
);
15553 /* TREE_NO_WARNING must be set if either the expression was
15554 parenthesized or it uses an operator such as >>= rather
15555 than plain assignment. In the former case, it was already
15556 set and must be copied. In the latter case,
15557 build_x_modify_expr sets it and it must not be reset
15559 if (TREE_NO_WARNING (t
))
15560 TREE_NO_WARNING (r
) = TREE_NO_WARNING (t
);
15566 op1
= tsubst_non_call_postfix_expression (TREE_OPERAND (t
, 0),
15567 args
, complain
, in_decl
);
15568 /* Remember that there was a reference to this entity. */
15570 && !mark_used (op1
, complain
) && !(complain
& tf_error
))
15571 RETURN (error_mark_node
);
15572 RETURN (build_x_arrow (input_location
, op1
, complain
));
15576 tree placement
= RECUR (TREE_OPERAND (t
, 0));
15577 tree init
= RECUR (TREE_OPERAND (t
, 3));
15578 vec
<tree
, va_gc
> *placement_vec
;
15579 vec
<tree
, va_gc
> *init_vec
;
15582 if (placement
== NULL_TREE
)
15583 placement_vec
= NULL
;
15586 placement_vec
= make_tree_vector ();
15587 for (; placement
!= NULL_TREE
; placement
= TREE_CHAIN (placement
))
15588 vec_safe_push (placement_vec
, TREE_VALUE (placement
));
15591 /* If there was an initializer in the original tree, but it
15592 instantiated to an empty list, then we should pass a
15593 non-NULL empty vector to tell build_new that it was an
15594 empty initializer() rather than no initializer. This can
15595 only happen when the initializer is a pack expansion whose
15596 parameter packs are of length zero. */
15597 if (init
== NULL_TREE
&& TREE_OPERAND (t
, 3) == NULL_TREE
)
15601 init_vec
= make_tree_vector ();
15602 if (init
== void_node
)
15603 gcc_assert (init_vec
!= NULL
);
15606 for (; init
!= NULL_TREE
; init
= TREE_CHAIN (init
))
15607 vec_safe_push (init_vec
, TREE_VALUE (init
));
15611 tree op1
= tsubst (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
15612 tree op2
= RECUR (TREE_OPERAND (t
, 2));
15613 ret
= build_new (&placement_vec
, op1
, op2
, &init_vec
,
15614 NEW_EXPR_USE_GLOBAL (t
),
15617 if (placement_vec
!= NULL
)
15618 release_tree_vector (placement_vec
);
15619 if (init_vec
!= NULL
)
15620 release_tree_vector (init_vec
);
15627 tree op0
= RECUR (TREE_OPERAND (t
, 0));
15628 tree op1
= RECUR (TREE_OPERAND (t
, 1));
15629 RETURN (delete_sanity (op0
, op1
,
15630 DELETE_EXPR_USE_VEC (t
),
15631 DELETE_EXPR_USE_GLOBAL (t
),
15635 case COMPOUND_EXPR
:
15637 tree op0
= tsubst_copy_and_build (TREE_OPERAND (t
, 0), args
,
15638 complain
& ~tf_decltype
, in_decl
,
15639 /*function_p=*/false,
15640 integral_constant_expression_p
);
15641 RETURN (build_x_compound_expr (EXPR_LOCATION (t
),
15643 RECUR (TREE_OPERAND (t
, 1)),
15644 complain
|decltype_flag
));
15650 vec
<tree
, va_gc
> *call_args
;
15651 unsigned int nargs
, i
;
15656 function
= CALL_EXPR_FN (t
);
15657 /* When we parsed the expression, we determined whether or
15658 not Koenig lookup should be performed. */
15659 koenig_p
= KOENIG_LOOKUP_P (t
);
15660 if (TREE_CODE (function
) == SCOPE_REF
)
15662 qualified_p
= true;
15663 function
= tsubst_qualified_id (function
, args
, complain
, in_decl
,
15665 /*address_p=*/false);
15667 else if (koenig_p
&& identifier_p (function
))
15669 /* Do nothing; calling tsubst_copy_and_build on an identifier
15670 would incorrectly perform unqualified lookup again.
15672 Note that we can also have an IDENTIFIER_NODE if the earlier
15673 unqualified lookup found a member function; in that case
15674 koenig_p will be false and we do want to do the lookup
15675 again to find the instantiated member function.
15677 FIXME but doing that causes c++/15272, so we need to stop
15678 using IDENTIFIER_NODE in that situation. */
15679 qualified_p
= false;
15683 if (TREE_CODE (function
) == COMPONENT_REF
)
15685 tree op
= TREE_OPERAND (function
, 1);
15687 qualified_p
= (TREE_CODE (op
) == SCOPE_REF
15688 || (BASELINK_P (op
)
15689 && BASELINK_QUALIFIED_P (op
)));
15692 qualified_p
= false;
15694 if (TREE_CODE (function
) == ADDR_EXPR
15695 && TREE_CODE (TREE_OPERAND (function
, 0)) == FUNCTION_DECL
)
15696 /* Avoid error about taking the address of a constructor. */
15697 function
= TREE_OPERAND (function
, 0);
15699 function
= tsubst_copy_and_build (function
, args
, complain
,
15702 integral_constant_expression_p
);
15704 if (BASELINK_P (function
))
15705 qualified_p
= true;
15708 nargs
= call_expr_nargs (t
);
15709 call_args
= make_tree_vector ();
15710 for (i
= 0; i
< nargs
; ++i
)
15712 tree arg
= CALL_EXPR_ARG (t
, i
);
15714 if (!PACK_EXPANSION_P (arg
))
15715 vec_safe_push (call_args
, RECUR (CALL_EXPR_ARG (t
, i
)));
15718 /* Expand the pack expansion and push each entry onto
15720 arg
= tsubst_pack_expansion (arg
, args
, complain
, in_decl
);
15721 if (TREE_CODE (arg
) == TREE_VEC
)
15723 unsigned int len
, j
;
15725 len
= TREE_VEC_LENGTH (arg
);
15726 for (j
= 0; j
< len
; ++j
)
15728 tree value
= TREE_VEC_ELT (arg
, j
);
15729 if (value
!= NULL_TREE
)
15730 value
= convert_from_reference (value
);
15731 vec_safe_push (call_args
, value
);
15736 /* A partial substitution. Add one entry. */
15737 vec_safe_push (call_args
, arg
);
15742 /* We do not perform argument-dependent lookup if normal
15743 lookup finds a non-function, in accordance with the
15744 expected resolution of DR 218. */
15746 && ((is_overloaded_fn (function
)
15747 /* If lookup found a member function, the Koenig lookup is
15748 not appropriate, even if an unqualified-name was used
15749 to denote the function. */
15750 && !DECL_FUNCTION_MEMBER_P (get_first_fn (function
)))
15751 || identifier_p (function
))
15752 /* Only do this when substitution turns a dependent call
15753 into a non-dependent call. */
15754 && type_dependent_expression_p_push (t
)
15755 && !any_type_dependent_arguments_p (call_args
))
15756 function
= perform_koenig_lookup (function
, call_args
, tf_none
);
15758 if (identifier_p (function
)
15759 && !any_type_dependent_arguments_p (call_args
))
15761 if (koenig_p
&& (complain
& tf_warning_or_error
))
15763 /* For backwards compatibility and good diagnostics, try
15764 the unqualified lookup again if we aren't in SFINAE
15766 tree unq
= (tsubst_copy_and_build
15767 (function
, args
, complain
, in_decl
, true,
15768 integral_constant_expression_p
));
15769 if (unq
== error_mark_node
)
15770 RETURN (error_mark_node
);
15772 if (unq
!= function
)
15775 if (INDIRECT_REF_P (fn
))
15776 fn
= TREE_OPERAND (fn
, 0);
15777 if (TREE_CODE (fn
) == COMPONENT_REF
)
15778 fn
= TREE_OPERAND (fn
, 1);
15779 if (is_overloaded_fn (fn
))
15780 fn
= get_first_fn (fn
);
15781 if (permerror (EXPR_LOC_OR_LOC (t
, input_location
),
15782 "%qD was not declared in this scope, "
15783 "and no declarations were found by "
15784 "argument-dependent lookup at the point "
15785 "of instantiation", function
))
15788 /* Can't say anything more. */;
15789 else if (DECL_CLASS_SCOPE_P (fn
))
15791 location_t loc
= EXPR_LOC_OR_LOC (t
,
15794 "declarations in dependent base %qT are "
15795 "not found by unqualified lookup",
15796 DECL_CLASS_CONTEXT (fn
));
15797 if (current_class_ptr
)
15799 "use %<this->%D%> instead", function
);
15802 "use %<%T::%D%> instead",
15803 current_class_name
, function
);
15806 inform (DECL_SOURCE_LOCATION (fn
),
15807 "%qD declared here, later in the "
15808 "translation unit", fn
);
15813 if (identifier_p (function
))
15815 if (complain
& tf_error
)
15816 unqualified_name_lookup_error (function
);
15817 release_tree_vector (call_args
);
15818 RETURN (error_mark_node
);
15822 /* Remember that there was a reference to this entity. */
15823 if (DECL_P (function
)
15824 && !mark_used (function
, complain
) && !(complain
& tf_error
))
15825 RETURN (error_mark_node
);
15827 /* Put back tf_decltype for the actual call. */
15828 complain
|= decltype_flag
;
15830 if (TREE_CODE (function
) == OFFSET_REF
)
15831 ret
= build_offset_ref_call_from_tree (function
, &call_args
,
15833 else if (TREE_CODE (function
) == COMPONENT_REF
)
15835 tree instance
= TREE_OPERAND (function
, 0);
15836 tree fn
= TREE_OPERAND (function
, 1);
15838 if (processing_template_decl
15839 && (type_dependent_expression_p (instance
)
15840 || (!BASELINK_P (fn
)
15841 && TREE_CODE (fn
) != FIELD_DECL
)
15842 || type_dependent_expression_p (fn
)
15843 || any_type_dependent_arguments_p (call_args
)))
15844 ret
= build_nt_call_vec (function
, call_args
);
15845 else if (!BASELINK_P (fn
))
15846 ret
= finish_call_expr (function
, &call_args
,
15847 /*disallow_virtual=*/false,
15848 /*koenig_p=*/false,
15851 ret
= (build_new_method_call
15853 &call_args
, NULL_TREE
,
15854 qualified_p
? LOOKUP_NONVIRTUAL
: LOOKUP_NORMAL
,
15859 ret
= finish_call_expr (function
, &call_args
,
15860 /*disallow_virtual=*/qualified_p
,
15864 release_tree_vector (call_args
);
15871 tree cond
= RECUR (TREE_OPERAND (t
, 0));
15872 tree folded_cond
= fold_non_dependent_expr (cond
);
15875 if (TREE_CODE (folded_cond
) == INTEGER_CST
)
15877 if (integer_zerop (folded_cond
))
15879 ++c_inhibit_evaluation_warnings
;
15880 exp1
= RECUR (TREE_OPERAND (t
, 1));
15881 --c_inhibit_evaluation_warnings
;
15882 exp2
= RECUR (TREE_OPERAND (t
, 2));
15886 exp1
= RECUR (TREE_OPERAND (t
, 1));
15887 ++c_inhibit_evaluation_warnings
;
15888 exp2
= RECUR (TREE_OPERAND (t
, 2));
15889 --c_inhibit_evaluation_warnings
;
15891 cond
= folded_cond
;
15895 exp1
= RECUR (TREE_OPERAND (t
, 1));
15896 exp2
= RECUR (TREE_OPERAND (t
, 2));
15899 RETURN (build_x_conditional_expr (EXPR_LOCATION (t
),
15900 cond
, exp1
, exp2
, complain
));
15903 case PSEUDO_DTOR_EXPR
:
15905 tree op0
= RECUR (TREE_OPERAND (t
, 0));
15906 tree op1
= RECUR (TREE_OPERAND (t
, 1));
15907 tree op2
= tsubst (TREE_OPERAND (t
, 2), args
, complain
, in_decl
);
15908 RETURN (finish_pseudo_destructor_expr (op0
, op1
, op2
,
15914 tree purpose
, value
, chain
;
15916 if (t
== void_list_node
)
15919 if ((TREE_PURPOSE (t
) && PACK_EXPANSION_P (TREE_PURPOSE (t
)))
15920 || (TREE_VALUE (t
) && PACK_EXPANSION_P (TREE_VALUE (t
))))
15922 /* We have pack expansions, so expand those and
15923 create a new list out of it. */
15924 tree purposevec
= NULL_TREE
;
15925 tree valuevec
= NULL_TREE
;
15929 /* Expand the argument expressions. */
15930 if (TREE_PURPOSE (t
))
15931 purposevec
= tsubst_pack_expansion (TREE_PURPOSE (t
), args
,
15932 complain
, in_decl
);
15933 if (TREE_VALUE (t
))
15934 valuevec
= tsubst_pack_expansion (TREE_VALUE (t
), args
,
15935 complain
, in_decl
);
15937 /* Build the rest of the list. */
15938 chain
= TREE_CHAIN (t
);
15939 if (chain
&& chain
!= void_type_node
)
15940 chain
= RECUR (chain
);
15942 /* Determine the number of arguments. */
15943 if (purposevec
&& TREE_CODE (purposevec
) == TREE_VEC
)
15945 len
= TREE_VEC_LENGTH (purposevec
);
15946 gcc_assert (!valuevec
|| len
== TREE_VEC_LENGTH (valuevec
));
15948 else if (TREE_CODE (valuevec
) == TREE_VEC
)
15949 len
= TREE_VEC_LENGTH (valuevec
);
15952 /* Since we only performed a partial substitution into
15953 the argument pack, we only RETURN (a single list
15955 if (purposevec
== TREE_PURPOSE (t
)
15956 && valuevec
== TREE_VALUE (t
)
15957 && chain
== TREE_CHAIN (t
))
15960 RETURN (tree_cons (purposevec
, valuevec
, chain
));
15963 /* Convert the argument vectors into a TREE_LIST */
15967 /* Grab the Ith values. */
15969 purpose
= purposevec
? TREE_VEC_ELT (purposevec
, i
)
15972 = valuevec
? convert_from_reference (TREE_VEC_ELT (valuevec
, i
))
15975 /* Build the list (backwards). */
15976 chain
= tree_cons (purpose
, value
, chain
);
15982 purpose
= TREE_PURPOSE (t
);
15984 purpose
= RECUR (purpose
);
15985 value
= TREE_VALUE (t
);
15987 value
= RECUR (value
);
15988 chain
= TREE_CHAIN (t
);
15989 if (chain
&& chain
!= void_type_node
)
15990 chain
= RECUR (chain
);
15991 if (purpose
== TREE_PURPOSE (t
)
15992 && value
== TREE_VALUE (t
)
15993 && chain
== TREE_CHAIN (t
))
15995 RETURN (tree_cons (purpose
, value
, chain
));
15998 case COMPONENT_REF
:
16005 object
= tsubst_non_call_postfix_expression (TREE_OPERAND (t
, 0),
16006 args
, complain
, in_decl
);
16007 /* Remember that there was a reference to this entity. */
16008 if (DECL_P (object
)
16009 && !mark_used (object
, complain
) && !(complain
& tf_error
))
16010 RETURN (error_mark_node
);
16011 object_type
= TREE_TYPE (object
);
16013 member
= TREE_OPERAND (t
, 1);
16014 if (BASELINK_P (member
))
16015 member
= tsubst_baselink (member
,
16016 non_reference (TREE_TYPE (object
)),
16017 args
, complain
, in_decl
);
16019 member
= tsubst_copy (member
, args
, complain
, in_decl
);
16020 if (member
== error_mark_node
)
16021 RETURN (error_mark_node
);
16023 if (type_dependent_expression_p (object
))
16024 /* We can't do much here. */;
16025 else if (!CLASS_TYPE_P (object_type
))
16027 if (scalarish_type_p (object_type
))
16029 tree s
= NULL_TREE
;
16030 tree dtor
= member
;
16032 if (TREE_CODE (dtor
) == SCOPE_REF
)
16034 s
= TREE_OPERAND (dtor
, 0);
16035 dtor
= TREE_OPERAND (dtor
, 1);
16037 if (TREE_CODE (dtor
) == BIT_NOT_EXPR
)
16039 dtor
= TREE_OPERAND (dtor
, 0);
16041 RETURN (finish_pseudo_destructor_expr
16042 (object
, s
, dtor
, input_location
));
16046 else if (TREE_CODE (member
) == SCOPE_REF
16047 && TREE_CODE (TREE_OPERAND (member
, 1)) == TEMPLATE_ID_EXPR
)
16049 /* Lookup the template functions now that we know what the
16051 tree scope
= TREE_OPERAND (member
, 0);
16052 tree tmpl
= TREE_OPERAND (TREE_OPERAND (member
, 1), 0);
16053 tree args
= TREE_OPERAND (TREE_OPERAND (member
, 1), 1);
16054 member
= lookup_qualified_name (scope
, tmpl
,
16055 /*is_type_p=*/false,
16056 /*complain=*/false);
16057 if (BASELINK_P (member
))
16059 BASELINK_FUNCTIONS (member
)
16060 = build_nt (TEMPLATE_ID_EXPR
, BASELINK_FUNCTIONS (member
),
16062 member
= (adjust_result_of_qualified_name_lookup
16063 (member
, BINFO_TYPE (BASELINK_BINFO (member
)),
16068 qualified_name_lookup_error (scope
, tmpl
, member
,
16070 RETURN (error_mark_node
);
16073 else if (TREE_CODE (member
) == SCOPE_REF
16074 && !CLASS_TYPE_P (TREE_OPERAND (member
, 0))
16075 && TREE_CODE (TREE_OPERAND (member
, 0)) != NAMESPACE_DECL
)
16077 if (complain
& tf_error
)
16079 if (TYPE_P (TREE_OPERAND (member
, 0)))
16080 error ("%qT is not a class or namespace",
16081 TREE_OPERAND (member
, 0));
16083 error ("%qD is not a class or namespace",
16084 TREE_OPERAND (member
, 0));
16086 RETURN (error_mark_node
);
16088 else if (TREE_CODE (member
) == FIELD_DECL
)
16090 r
= finish_non_static_data_member (member
, object
, NULL_TREE
);
16091 if (TREE_CODE (r
) == COMPONENT_REF
)
16092 REF_PARENTHESIZED_P (r
) = REF_PARENTHESIZED_P (t
);
16096 r
= finish_class_member_access_expr (object
, member
,
16097 /*template_p=*/false,
16099 if (TREE_CODE (r
) == COMPONENT_REF
)
16100 REF_PARENTHESIZED_P (r
) = REF_PARENTHESIZED_P (t
);
16105 RETURN (build_throw
16106 (RECUR (TREE_OPERAND (t
, 0))));
16110 vec
<constructor_elt
, va_gc
> *n
;
16111 constructor_elt
*ce
;
16112 unsigned HOST_WIDE_INT idx
;
16113 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
16114 bool process_index_p
;
16116 bool need_copy_p
= false;
16119 if (type
== error_mark_node
)
16120 RETURN (error_mark_node
);
16122 /* digest_init will do the wrong thing if we let it. */
16123 if (type
&& TYPE_PTRMEMFUNC_P (type
))
16126 /* We do not want to process the index of aggregate
16127 initializers as they are identifier nodes which will be
16128 looked up by digest_init. */
16129 process_index_p
= !(type
&& MAYBE_CLASS_TYPE_P (type
));
16131 n
= vec_safe_copy (CONSTRUCTOR_ELTS (t
));
16132 newlen
= vec_safe_length (n
);
16133 FOR_EACH_VEC_SAFE_ELT (n
, idx
, ce
)
16135 if (ce
->index
&& process_index_p
16136 /* An identifier index is looked up in the type
16137 being initialized, not the current scope. */
16138 && TREE_CODE (ce
->index
) != IDENTIFIER_NODE
)
16139 ce
->index
= RECUR (ce
->index
);
16141 if (PACK_EXPANSION_P (ce
->value
))
16143 /* Substitute into the pack expansion. */
16144 ce
->value
= tsubst_pack_expansion (ce
->value
, args
, complain
,
16147 if (ce
->value
== error_mark_node
16148 || PACK_EXPANSION_P (ce
->value
))
16150 else if (TREE_VEC_LENGTH (ce
->value
) == 1)
16151 /* Just move the argument into place. */
16152 ce
->value
= TREE_VEC_ELT (ce
->value
, 0);
16155 /* Update the length of the final CONSTRUCTOR
16156 arguments vector, and note that we will need to
16158 newlen
= newlen
+ TREE_VEC_LENGTH (ce
->value
) - 1;
16159 need_copy_p
= true;
16163 ce
->value
= RECUR (ce
->value
);
16168 vec
<constructor_elt
, va_gc
> *old_n
= n
;
16170 vec_alloc (n
, newlen
);
16171 FOR_EACH_VEC_ELT (*old_n
, idx
, ce
)
16173 if (TREE_CODE (ce
->value
) == TREE_VEC
)
16175 int i
, len
= TREE_VEC_LENGTH (ce
->value
);
16176 for (i
= 0; i
< len
; ++i
)
16177 CONSTRUCTOR_APPEND_ELT (n
, 0,
16178 TREE_VEC_ELT (ce
->value
, i
));
16181 CONSTRUCTOR_APPEND_ELT (n
, 0, ce
->value
);
16185 r
= build_constructor (init_list_type_node
, n
);
16186 CONSTRUCTOR_IS_DIRECT_INIT (r
) = CONSTRUCTOR_IS_DIRECT_INIT (t
);
16188 if (TREE_HAS_CONSTRUCTOR (t
))
16189 RETURN (finish_compound_literal (type
, r
, complain
));
16191 TREE_TYPE (r
) = type
;
16197 tree operand_0
= TREE_OPERAND (t
, 0);
16198 if (TYPE_P (operand_0
))
16200 operand_0
= tsubst (operand_0
, args
, complain
, in_decl
);
16201 RETURN (get_typeid (operand_0
, complain
));
16205 operand_0
= RECUR (operand_0
);
16206 RETURN (build_typeid (operand_0
, complain
));
16213 else if (DECL_PACK_P (t
))
16215 /* We don't build decls for an instantiation of a
16216 variadic capture proxy, we instantiate the elements
16218 gcc_assert (DECL_HAS_VALUE_EXPR_P (t
));
16219 return RECUR (DECL_VALUE_EXPR (t
));
16225 tree r
= tsubst_copy (t
, args
, complain
, in_decl
);
16226 /* ??? We're doing a subset of finish_id_expression here. */
16228 && !processing_template_decl
16229 && !cp_unevaluated_operand
16230 && (TREE_STATIC (r
) || DECL_EXTERNAL (r
))
16231 && CP_DECL_THREAD_LOCAL_P (r
))
16233 if (tree wrap
= get_tls_wrapper_fn (r
))
16234 /* Replace an evaluated use of the thread_local variable with
16235 a call to its wrapper. */
16236 r
= build_cxx_call (wrap
, 0, NULL
, tf_warning_or_error
);
16238 else if (outer_automatic_var_p (r
))
16240 r
= process_outer_var_ref (r
, complain
);
16241 if (is_capture_proxy (r
))
16242 register_local_specialization (r
, t
);
16245 if (TREE_CODE (TREE_TYPE (t
)) != REFERENCE_TYPE
)
16246 /* If the original type was a reference, we'll be wrapped in
16247 the appropriate INDIRECT_REF. */
16248 r
= convert_from_reference (r
);
16254 tree op0
= RECUR (TREE_OPERAND (t
, 0));
16255 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
16256 RETURN (build_x_va_arg (EXPR_LOCATION (t
), op0
, type
));
16259 case OFFSETOF_EXPR
:
16260 RETURN (finish_offsetof (RECUR (TREE_OPERAND (t
, 0)),
16261 EXPR_LOCATION (t
)));
16265 tree type1
= tsubst (TRAIT_EXPR_TYPE1 (t
), args
,
16266 complain
, in_decl
);
16268 tree type2
= TRAIT_EXPR_TYPE2 (t
);
16269 if (type2
&& TREE_CODE (type2
) == TREE_LIST
)
16270 type2
= RECUR (type2
);
16272 type2
= tsubst (type2
, args
, complain
, in_decl
);
16274 RETURN (finish_trait_expr (TRAIT_EXPR_KIND (t
), type1
, type2
));
16279 tree old_stmt_expr
= cur_stmt_expr
;
16280 tree stmt_expr
= begin_stmt_expr ();
16282 cur_stmt_expr
= stmt_expr
;
16283 tsubst_expr (STMT_EXPR_STMT (t
), args
, complain
, in_decl
,
16284 integral_constant_expression_p
);
16285 stmt_expr
= finish_stmt_expr (stmt_expr
, false);
16286 cur_stmt_expr
= old_stmt_expr
;
16288 /* If the resulting list of expression statement is empty,
16289 fold it further into void_node. */
16290 if (empty_expr_stmt_p (stmt_expr
))
16291 stmt_expr
= void_node
;
16293 RETURN (stmt_expr
);
16298 tree r
= build_lambda_expr ();
16300 tree type
= tsubst (LAMBDA_EXPR_CLOSURE (t
), args
, complain
, NULL_TREE
);
16301 LAMBDA_EXPR_CLOSURE (r
) = type
;
16302 CLASSTYPE_LAMBDA_EXPR (type
) = r
;
16304 LAMBDA_EXPR_LOCATION (r
)
16305 = LAMBDA_EXPR_LOCATION (t
);
16306 LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (r
)
16307 = LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (t
);
16308 LAMBDA_EXPR_MUTABLE_P (r
) = LAMBDA_EXPR_MUTABLE_P (t
);
16309 LAMBDA_EXPR_DISCRIMINATOR (r
)
16310 = (LAMBDA_EXPR_DISCRIMINATOR (t
));
16311 /* For a function scope, we want to use tsubst so that we don't
16312 complain about referring to an auto function before its return
16313 type has been deduced. Otherwise, we want to use tsubst_copy so
16314 that we look up the existing field/parameter/variable rather
16315 than build a new one. */
16316 tree scope
= LAMBDA_EXPR_EXTRA_SCOPE (t
);
16317 if (scope
&& TREE_CODE (scope
) == FUNCTION_DECL
)
16318 scope
= tsubst (scope
, args
, complain
, in_decl
);
16319 else if (scope
&& TREE_CODE (scope
) == PARM_DECL
)
16321 /* Look up the parameter we want directly, as tsubst_copy
16322 doesn't do what we need. */
16323 tree fn
= tsubst (DECL_CONTEXT (scope
), args
, complain
, in_decl
);
16324 tree parm
= FUNCTION_FIRST_USER_PARM (fn
);
16325 while (DECL_PARM_INDEX (parm
) != DECL_PARM_INDEX (scope
))
16326 parm
= DECL_CHAIN (parm
);
16328 /* FIXME Work around the parm not having DECL_CONTEXT set. */
16329 if (DECL_CONTEXT (scope
) == NULL_TREE
)
16330 DECL_CONTEXT (scope
) = fn
;
16333 scope
= RECUR (scope
);
16334 LAMBDA_EXPR_EXTRA_SCOPE (r
) = scope
;
16335 LAMBDA_EXPR_RETURN_TYPE (r
)
16336 = tsubst (LAMBDA_EXPR_RETURN_TYPE (t
), args
, complain
, in_decl
);
16338 gcc_assert (LAMBDA_EXPR_THIS_CAPTURE (t
) == NULL_TREE
16339 && LAMBDA_EXPR_PENDING_PROXIES (t
) == NULL
);
16341 /* Do this again now that LAMBDA_EXPR_EXTRA_SCOPE is set. */
16342 determine_visibility (TYPE_NAME (type
));
16343 /* Now that we know visibility, instantiate the type so we have a
16344 declaration of the op() for later calls to lambda_function. */
16345 complete_type (type
);
16347 LAMBDA_EXPR_THIS_CAPTURE (r
) = NULL_TREE
;
16349 insert_pending_capture_proxies ();
16351 RETURN (build_lambda_object (r
));
16355 /* We can get here for a constant initializer of non-dependent type.
16356 FIXME stop folding in cp_parser_initializer_clause. */
16358 tree r
= get_target_expr_sfinae (RECUR (TARGET_EXPR_INITIAL (t
)),
16363 case TRANSACTION_EXPR
:
16364 RETURN (tsubst_expr(t
, args
, complain
, in_decl
,
16365 integral_constant_expression_p
));
16368 RETURN (finish_parenthesized_expr (RECUR (TREE_OPERAND (t
, 0))));
16370 case VEC_PERM_EXPR
:
16372 tree op0
= RECUR (TREE_OPERAND (t
, 0));
16373 tree op1
= RECUR (TREE_OPERAND (t
, 1));
16374 tree op2
= RECUR (TREE_OPERAND (t
, 2));
16375 RETURN (build_x_vec_perm_expr (input_location
, op0
, op1
, op2
,
16379 case REQUIRES_EXPR
:
16380 RETURN (tsubst_requires_expr (t
, args
, complain
, in_decl
));
16383 /* Handle Objective-C++ constructs, if appropriate. */
16386 = objcp_tsubst_copy_and_build (t
, args
, complain
,
16387 in_decl
, /*function_p=*/false);
16391 RETURN (tsubst_copy (t
, args
, complain
, in_decl
));
16397 input_location
= loc
;
16401 /* Verify that the instantiated ARGS are valid. For type arguments,
16402 make sure that the type's linkage is ok. For non-type arguments,
16403 make sure they are constants if they are integral or enumerations.
16404 Emit an error under control of COMPLAIN, and return TRUE on error. */
16407 check_instantiated_arg (tree tmpl
, tree t
, tsubst_flags_t complain
)
16409 if (dependent_template_arg_p (t
))
16411 if (ARGUMENT_PACK_P (t
))
16413 tree vec
= ARGUMENT_PACK_ARGS (t
);
16414 int len
= TREE_VEC_LENGTH (vec
);
16415 bool result
= false;
16418 for (i
= 0; i
< len
; ++i
)
16419 if (check_instantiated_arg (tmpl
, TREE_VEC_ELT (vec
, i
), complain
))
16423 else if (TYPE_P (t
))
16425 /* [basic.link]: A name with no linkage (notably, the name
16426 of a class or enumeration declared in a local scope)
16427 shall not be used to declare an entity with linkage.
16428 This implies that names with no linkage cannot be used as
16431 DR 757 relaxes this restriction for C++0x. */
16432 tree nt
= (cxx_dialect
> cxx98
? NULL_TREE
16433 : no_linkage_check (t
, /*relaxed_p=*/false));
16437 /* DR 488 makes use of a type with no linkage cause
16438 type deduction to fail. */
16439 if (complain
& tf_error
)
16441 if (TYPE_ANONYMOUS_P (nt
))
16442 error ("%qT is/uses anonymous type", t
);
16444 error ("template argument for %qD uses local type %qT",
16449 /* In order to avoid all sorts of complications, we do not
16450 allow variably-modified types as template arguments. */
16451 else if (variably_modified_type_p (t
, NULL_TREE
))
16453 if (complain
& tf_error
)
16454 error ("%qT is a variably modified type", t
);
16458 /* Class template and alias template arguments should be OK. */
16459 else if (DECL_TYPE_TEMPLATE_P (t
))
16461 /* A non-type argument of integral or enumerated type must be a
16463 else if (TREE_TYPE (t
)
16464 && INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (t
))
16465 && !REFERENCE_REF_P (t
)
16466 && !TREE_CONSTANT (t
))
16468 if (complain
& tf_error
)
16469 error ("integral expression %qE is not constant", t
);
16476 check_instantiated_args (tree tmpl
, tree args
, tsubst_flags_t complain
)
16478 int ix
, len
= DECL_NTPARMS (tmpl
);
16479 bool result
= false;
16481 for (ix
= 0; ix
!= len
; ix
++)
16483 if (check_instantiated_arg (tmpl
, TREE_VEC_ELT (args
, ix
), complain
))
16486 if (result
&& (complain
& tf_error
))
16487 error (" trying to instantiate %qD", tmpl
);
16491 /* We're out of SFINAE context now, so generate diagnostics for the access
16492 errors we saw earlier when instantiating D from TMPL and ARGS. */
16495 recheck_decl_substitution (tree d
, tree tmpl
, tree args
)
16497 tree pattern
= DECL_TEMPLATE_RESULT (tmpl
);
16498 tree type
= TREE_TYPE (pattern
);
16499 location_t loc
= input_location
;
16501 push_access_scope (d
);
16502 push_deferring_access_checks (dk_no_deferred
);
16503 input_location
= DECL_SOURCE_LOCATION (pattern
);
16504 tsubst (type
, args
, tf_warning_or_error
, d
);
16505 input_location
= loc
;
16506 pop_deferring_access_checks ();
16507 pop_access_scope (d
);
16510 /* Instantiate the indicated variable, function, or alias template TMPL with
16511 the template arguments in TARG_PTR. */
16514 instantiate_template_1 (tree tmpl
, tree orig_args
, tsubst_flags_t complain
)
16516 tree targ_ptr
= orig_args
;
16520 bool access_ok
= true;
16522 if (tmpl
== error_mark_node
)
16523 return error_mark_node
;
16525 gcc_assert (TREE_CODE (tmpl
) == TEMPLATE_DECL
);
16527 /* If this function is a clone, handle it specially. */
16528 if (DECL_CLONED_FUNCTION_P (tmpl
))
16533 /* Use DECL_ABSTRACT_ORIGIN because only FUNCTION_DECLs have
16534 DECL_CLONED_FUNCTION. */
16535 spec
= instantiate_template (DECL_ABSTRACT_ORIGIN (tmpl
),
16536 targ_ptr
, complain
);
16537 if (spec
== error_mark_node
)
16538 return error_mark_node
;
16540 /* Look for the clone. */
16541 FOR_EACH_CLONE (clone
, spec
)
16542 if (DECL_NAME (clone
) == DECL_NAME (tmpl
))
16544 /* We should always have found the clone by now. */
16545 gcc_unreachable ();
16549 if (targ_ptr
== error_mark_node
)
16550 return error_mark_node
;
16552 /* Check to see if we already have this specialization. */
16553 gen_tmpl
= most_general_template (tmpl
);
16554 if (tmpl
!= gen_tmpl
)
16555 /* The TMPL is a partial instantiation. To get a full set of
16556 arguments we must add the arguments used to perform the
16557 partial instantiation. */
16558 targ_ptr
= add_outermost_template_args (DECL_TI_ARGS (tmpl
),
16561 /* It would be nice to avoid hashing here and then again in tsubst_decl,
16562 but it doesn't seem to be on the hot path. */
16563 spec
= retrieve_specialization (gen_tmpl
, targ_ptr
, 0);
16565 gcc_assert (tmpl
== gen_tmpl
16566 || ((fndecl
= retrieve_specialization (tmpl
, orig_args
, 0))
16568 || fndecl
== NULL_TREE
);
16570 if (spec
!= NULL_TREE
)
16572 if (FNDECL_HAS_ACCESS_ERRORS (spec
))
16574 if (complain
& tf_error
)
16575 recheck_decl_substitution (spec
, gen_tmpl
, targ_ptr
);
16576 return error_mark_node
;
16581 if (check_instantiated_args (gen_tmpl
, INNERMOST_TEMPLATE_ARGS (targ_ptr
),
16583 return error_mark_node
;
16585 /* We are building a FUNCTION_DECL, during which the access of its
16586 parameters and return types have to be checked. However this
16587 FUNCTION_DECL which is the desired context for access checking
16588 is not built yet. We solve this chicken-and-egg problem by
16589 deferring all checks until we have the FUNCTION_DECL. */
16590 push_deferring_access_checks (dk_deferred
);
16592 /* Instantiation of the function happens in the context of the function
16593 template, not the context of the overload resolution we're doing. */
16594 push_to_top_level ();
16595 /* If there are dependent arguments, e.g. because we're doing partial
16596 ordering, make sure processing_template_decl stays set. */
16597 if (uses_template_parms (targ_ptr
))
16598 ++processing_template_decl
;
16599 if (DECL_CLASS_SCOPE_P (gen_tmpl
))
16601 tree ctx
= tsubst_aggr_type (DECL_CONTEXT (gen_tmpl
), targ_ptr
,
16602 complain
, gen_tmpl
, true);
16603 push_nested_class (ctx
);
16606 tree pattern
= DECL_TEMPLATE_RESULT (gen_tmpl
);
16608 if (VAR_P (pattern
))
16610 /* We need to determine if we're using a partial or explicit
16611 specialization now, because the type of the variable could be
16613 tree tid
= lookup_template_variable (gen_tmpl
, targ_ptr
);
16614 tree elt
= most_specialized_partial_spec (tid
, complain
);
16615 if (elt
== error_mark_node
)
16616 pattern
= error_mark_node
;
16619 tmpl
= TREE_VALUE (elt
);
16620 pattern
= DECL_TEMPLATE_RESULT (tmpl
);
16621 targ_ptr
= TREE_PURPOSE (elt
);
16625 /* Substitute template parameters to obtain the specialization. */
16626 fndecl
= tsubst (pattern
, targ_ptr
, complain
, gen_tmpl
);
16627 if (DECL_CLASS_SCOPE_P (gen_tmpl
))
16628 pop_nested_class ();
16629 pop_from_top_level ();
16631 if (fndecl
== error_mark_node
)
16633 pop_deferring_access_checks ();
16634 return error_mark_node
;
16637 /* The DECL_TI_TEMPLATE should always be the immediate parent
16638 template, not the most general template. */
16639 DECL_TI_TEMPLATE (fndecl
) = tmpl
;
16640 DECL_TI_ARGS (fndecl
) = targ_ptr
;
16642 /* Now we know the specialization, compute access previously
16644 push_access_scope (fndecl
);
16645 if (!perform_deferred_access_checks (complain
))
16647 pop_access_scope (fndecl
);
16648 pop_deferring_access_checks ();
16650 /* If we've just instantiated the main entry point for a function,
16651 instantiate all the alternate entry points as well. We do this
16652 by cloning the instantiation of the main entry point, not by
16653 instantiating the template clones. */
16654 if (DECL_CHAIN (gen_tmpl
) && DECL_CLONED_FUNCTION_P (DECL_CHAIN (gen_tmpl
)))
16655 clone_function_decl (fndecl
, /*update_method_vec_p=*/0);
16659 if (!(complain
& tf_error
))
16661 /* Remember to reinstantiate when we're out of SFINAE so the user
16662 can see the errors. */
16663 FNDECL_HAS_ACCESS_ERRORS (fndecl
) = true;
16665 return error_mark_node
;
16670 /* Wrapper for instantiate_template_1. */
16673 instantiate_template (tree tmpl
, tree orig_args
, tsubst_flags_t complain
)
16676 timevar_push (TV_TEMPLATE_INST
);
16677 ret
= instantiate_template_1 (tmpl
, orig_args
, complain
);
16678 timevar_pop (TV_TEMPLATE_INST
);
16682 /* Instantiate the alias template TMPL with ARGS. Also push a template
16683 instantiation level, which instantiate_template doesn't do because
16684 functions and variables have sufficient context established by the
16688 instantiate_alias_template (tree tmpl
, tree args
, tsubst_flags_t complain
)
16690 struct pending_template
*old_last_pend
= last_pending_template
;
16691 struct tinst_level
*old_error_tinst
= last_error_tinst_level
;
16692 if (tmpl
== error_mark_node
|| args
== error_mark_node
)
16693 return error_mark_node
;
16694 tree tinst
= build_tree_list (tmpl
, args
);
16695 if (!push_tinst_level (tinst
))
16698 return error_mark_node
;
16702 coerce_innermost_template_parms (DECL_TEMPLATE_PARMS (tmpl
),
16703 args
, tmpl
, complain
,
16704 /*require_all_args=*/true,
16705 /*use_default_args=*/true);
16707 tree r
= instantiate_template (tmpl
, args
, complain
);
16708 pop_tinst_level ();
16709 /* We can't free this if a pending_template entry or last_error_tinst_level
16710 is pointing at it. */
16711 if (last_pending_template
== old_last_pend
16712 && last_error_tinst_level
== old_error_tinst
)
16718 /* PARM is a template parameter pack for FN. Returns true iff
16719 PARM is used in a deducible way in the argument list of FN. */
16722 pack_deducible_p (tree parm
, tree fn
)
16724 tree t
= FUNCTION_FIRST_USER_PARMTYPE (fn
);
16725 for (; t
; t
= TREE_CHAIN (t
))
16727 tree type
= TREE_VALUE (t
);
16729 if (!PACK_EXPANSION_P (type
))
16731 for (packs
= PACK_EXPANSION_PARAMETER_PACKS (type
);
16732 packs
; packs
= TREE_CHAIN (packs
))
16733 if (template_args_equal (TREE_VALUE (packs
), parm
))
16735 /* The template parameter pack is used in a function parameter
16736 pack. If this is the end of the parameter list, the
16737 template parameter pack is deducible. */
16738 if (TREE_CHAIN (t
) == void_list_node
)
16741 /* Otherwise, not. Well, it could be deduced from
16742 a non-pack parameter, but doing so would end up with
16743 a deduction mismatch, so don't bother. */
16747 /* The template parameter pack isn't used in any function parameter
16748 packs, but it might be used deeper, e.g. tuple<Args...>. */
16752 /* The FN is a TEMPLATE_DECL for a function. ARGS is an array with
16753 NARGS elements of the arguments that are being used when calling
16754 it. TARGS is a vector into which the deduced template arguments
16757 Returns either a FUNCTION_DECL for the matching specialization of FN or
16758 NULL_TREE if no suitable specialization can be found. If EXPLAIN_P is
16759 true, diagnostics will be printed to explain why it failed.
16761 If FN is a conversion operator, or we are trying to produce a specific
16762 specialization, RETURN_TYPE is the return type desired.
16764 The EXPLICIT_TARGS are explicit template arguments provided via a
16767 The parameter STRICT is one of:
16770 We are deducing arguments for a function call, as in
16771 [temp.deduct.call].
16774 We are deducing arguments for a conversion function, as in
16775 [temp.deduct.conv].
16778 We are deducing arguments when doing an explicit instantiation
16779 as in [temp.explicit], when determining an explicit specialization
16780 as in [temp.expl.spec], or when taking the address of a function
16781 template, as in [temp.deduct.funcaddr]. */
16784 fn_type_unification (tree fn
,
16785 tree explicit_targs
,
16788 unsigned int nargs
,
16790 unification_kind_t strict
,
16797 tree decl
= NULL_TREE
;
16798 tsubst_flags_t complain
= (explain_p
? tf_warning_or_error
: tf_none
);
16800 static int deduction_depth
;
16801 struct pending_template
*old_last_pend
= last_pending_template
;
16802 struct tinst_level
*old_error_tinst
= last_error_tinst_level
;
16803 tree tparms
= DECL_INNERMOST_TEMPLATE_PARMS (fn
);
16805 tree r
= error_mark_node
;
16808 complain
|= tf_decltype
;
16810 /* In C++0x, it's possible to have a function template whose type depends
16811 on itself recursively. This is most obvious with decltype, but can also
16812 occur with enumeration scope (c++/48969). So we need to catch infinite
16813 recursion and reject the substitution at deduction time; this function
16814 will return error_mark_node for any repeated substitution.
16816 This also catches excessive recursion such as when f<N> depends on
16817 f<N-1> across all integers, and returns error_mark_node for all the
16818 substitutions back up to the initial one.
16820 This is, of course, not reentrant. */
16821 if (excessive_deduction_depth
)
16822 return error_mark_node
;
16823 tinst
= build_tree_list (fn
, NULL_TREE
);
16826 gcc_assert (TREE_CODE (fn
) == TEMPLATE_DECL
);
16828 fntype
= TREE_TYPE (fn
);
16829 if (explicit_targs
)
16833 The specified template arguments must match the template
16834 parameters in kind (i.e., type, nontype, template), and there
16835 must not be more arguments than there are parameters;
16836 otherwise type deduction fails.
16838 Nontype arguments must match the types of the corresponding
16839 nontype template parameters, or must be convertible to the
16840 types of the corresponding nontype parameters as specified in
16841 _temp.arg.nontype_, otherwise type deduction fails.
16843 All references in the function type of the function template
16844 to the corresponding template parameters are replaced by the
16845 specified template argument values. If a substitution in a
16846 template parameter or in the function type of the function
16847 template results in an invalid type, type deduction fails. */
16848 int i
, len
= TREE_VEC_LENGTH (tparms
);
16849 location_t loc
= input_location
;
16850 bool incomplete
= false;
16852 /* Adjust any explicit template arguments before entering the
16853 substitution context. */
16855 = (coerce_template_parms (tparms
, explicit_targs
, NULL_TREE
,
16857 /*require_all_args=*/false,
16858 /*use_default_args=*/false));
16859 if (explicit_targs
== error_mark_node
)
16862 /* Substitute the explicit args into the function type. This is
16863 necessary so that, for instance, explicitly declared function
16864 arguments can match null pointed constants. If we were given
16865 an incomplete set of explicit args, we must not do semantic
16866 processing during substitution as we could create partial
16868 for (i
= 0; i
< len
; i
++)
16870 tree parm
= TREE_VALUE (TREE_VEC_ELT (tparms
, i
));
16871 bool parameter_pack
= false;
16872 tree targ
= TREE_VEC_ELT (explicit_targs
, i
);
16874 /* Dig out the actual parm. */
16875 if (TREE_CODE (parm
) == TYPE_DECL
16876 || TREE_CODE (parm
) == TEMPLATE_DECL
)
16878 parm
= TREE_TYPE (parm
);
16879 parameter_pack
= TEMPLATE_TYPE_PARAMETER_PACK (parm
);
16881 else if (TREE_CODE (parm
) == PARM_DECL
)
16883 parm
= DECL_INITIAL (parm
);
16884 parameter_pack
= TEMPLATE_PARM_PARAMETER_PACK (parm
);
16887 if (!parameter_pack
&& targ
== NULL_TREE
)
16888 /* No explicit argument for this template parameter. */
16891 if (parameter_pack
&& pack_deducible_p (parm
, fn
))
16893 /* Mark the argument pack as "incomplete". We could
16894 still deduce more arguments during unification.
16895 We remove this mark in type_unification_real. */
16898 ARGUMENT_PACK_INCOMPLETE_P(targ
) = 1;
16899 ARGUMENT_PACK_EXPLICIT_ARGS (targ
)
16900 = ARGUMENT_PACK_ARGS (targ
);
16903 /* We have some incomplete argument packs. */
16908 TREE_VALUE (tinst
) = explicit_targs
;
16909 if (!push_tinst_level (tinst
))
16911 excessive_deduction_depth
= true;
16914 processing_template_decl
+= incomplete
;
16915 input_location
= DECL_SOURCE_LOCATION (fn
);
16916 /* Ignore any access checks; we'll see them again in
16917 instantiate_template and they might have the wrong
16918 access path at this point. */
16919 push_deferring_access_checks (dk_deferred
);
16920 fntype
= tsubst (TREE_TYPE (fn
), explicit_targs
,
16921 complain
| tf_partial
, NULL_TREE
);
16922 pop_deferring_access_checks ();
16923 input_location
= loc
;
16924 processing_template_decl
-= incomplete
;
16925 pop_tinst_level ();
16927 if (fntype
== error_mark_node
)
16930 /* Place the explicitly specified arguments in TARGS. */
16931 for (i
= NUM_TMPL_ARGS (explicit_targs
); i
--;)
16932 TREE_VEC_ELT (targs
, i
) = TREE_VEC_ELT (explicit_targs
, i
);
16935 /* Never do unification on the 'this' parameter. */
16936 parms
= skip_artificial_parms_for (fn
, TYPE_ARG_TYPES (fntype
));
16942 parms
= tree_cons (NULL_TREE
, TREE_TYPE (fntype
), parms
);
16943 new_args
= XALLOCAVEC (tree
, nargs
+ 1);
16944 new_args
[0] = return_type
;
16945 memcpy (new_args
+ 1, args
, nargs
* sizeof (tree
));
16950 /* We allow incomplete unification without an error message here
16951 because the standard doesn't seem to explicitly prohibit it. Our
16952 callers must be ready to deal with unification failures in any
16955 TREE_VALUE (tinst
) = targs
;
16956 /* If we aren't explaining yet, push tinst context so we can see where
16957 any errors (e.g. from class instantiations triggered by instantiation
16958 of default template arguments) come from. If we are explaining, this
16959 context is redundant. */
16960 if (!explain_p
&& !push_tinst_level (tinst
))
16962 excessive_deduction_depth
= true;
16966 /* type_unification_real will pass back any access checks from default
16967 template argument substitution. */
16968 vec
<deferred_access_check
, va_gc
> *checks
;
16971 ok
= !type_unification_real (DECL_INNERMOST_TEMPLATE_PARMS (fn
),
16972 targs
, parms
, args
, nargs
, /*subr=*/0,
16973 strict
, flags
, &checks
, explain_p
);
16975 pop_tinst_level ();
16979 /* Now that we have bindings for all of the template arguments,
16980 ensure that the arguments deduced for the template template
16981 parameters have compatible template parameter lists. We cannot
16982 check this property before we have deduced all template
16983 arguments, because the template parameter types of a template
16984 template parameter might depend on prior template parameters
16985 deduced after the template template parameter. The following
16986 ill-formed example illustrates this issue:
16988 template<typename T, template<T> class C> void f(C<5>, T);
16990 template<int N> struct X {};
16993 f(X<5>(), 5l); // error: template argument deduction fails
16996 The template parameter list of 'C' depends on the template type
16997 parameter 'T', but 'C' is deduced to 'X' before 'T' is deduced to
16998 'long'. Thus, we can't check that 'C' cannot bind to 'X' at the
16999 time that we deduce 'C'. */
17000 if (!template_template_parm_bindings_ok_p
17001 (DECL_INNERMOST_TEMPLATE_PARMS (fn
), targs
))
17003 unify_inconsistent_template_template_parameters (explain_p
);
17007 /* All is well so far. Now, check:
17011 When all template arguments have been deduced, all uses of
17012 template parameters in nondeduced contexts are replaced with
17013 the corresponding deduced argument values. If the
17014 substitution results in an invalid type, as described above,
17015 type deduction fails. */
17016 TREE_VALUE (tinst
) = targs
;
17017 if (!push_tinst_level (tinst
))
17019 excessive_deduction_depth
= true;
17023 /* Also collect access checks from the instantiation. */
17024 reopen_deferring_access_checks (checks
);
17026 decl
= instantiate_template (fn
, targs
, complain
);
17028 checks
= get_deferred_access_checks ();
17029 pop_deferring_access_checks ();
17031 pop_tinst_level ();
17033 if (decl
== error_mark_node
)
17036 /* Now perform any access checks encountered during substitution. */
17037 push_access_scope (decl
);
17038 ok
= perform_access_checks (checks
, complain
);
17039 pop_access_scope (decl
);
17043 /* If we're looking for an exact match, check that what we got
17044 is indeed an exact match. It might not be if some template
17045 parameters are used in non-deduced contexts. But don't check
17046 for an exact match if we have dependent template arguments;
17047 in that case we're doing partial ordering, and we already know
17048 that we have two candidates that will provide the actual type. */
17049 if (strict
== DEDUCE_EXACT
&& !any_dependent_template_arguments_p (targs
))
17051 tree substed
= TREE_TYPE (decl
);
17055 = skip_artificial_parms_for (decl
, TYPE_ARG_TYPES (substed
));
17057 sarg
= tree_cons (NULL_TREE
, TREE_TYPE (substed
), sarg
);
17058 for (i
= 0; i
< nargs
&& sarg
; ++i
, sarg
= TREE_CHAIN (sarg
))
17059 if (!same_type_p (args
[i
], TREE_VALUE (sarg
)))
17061 unify_type_mismatch (explain_p
, args
[i
],
17062 TREE_VALUE (sarg
));
17071 if (excessive_deduction_depth
)
17073 if (deduction_depth
== 0)
17074 /* Reset once we're all the way out. */
17075 excessive_deduction_depth
= false;
17078 /* We can't free this if a pending_template entry or last_error_tinst_level
17079 is pointing at it. */
17080 if (last_pending_template
== old_last_pend
17081 && last_error_tinst_level
== old_error_tinst
)
17087 /* Adjust types before performing type deduction, as described in
17088 [temp.deduct.call] and [temp.deduct.conv]. The rules in these two
17089 sections are symmetric. PARM is the type of a function parameter
17090 or the return type of the conversion function. ARG is the type of
17091 the argument passed to the call, or the type of the value
17092 initialized with the result of the conversion function.
17093 ARG_EXPR is the original argument expression, which may be null. */
17096 maybe_adjust_types_for_deduction (unification_kind_t strict
,
17109 /* Swap PARM and ARG throughout the remainder of this
17110 function; the handling is precisely symmetric since PARM
17111 will initialize ARG rather than vice versa. */
17112 std::swap (parm
, arg
);
17116 /* Core issue #873: Do the DR606 thing (see below) for these cases,
17117 too, but here handle it by stripping the reference from PARM
17118 rather than by adding it to ARG. */
17119 if (TREE_CODE (*parm
) == REFERENCE_TYPE
17120 && TYPE_REF_IS_RVALUE (*parm
)
17121 && TREE_CODE (TREE_TYPE (*parm
)) == TEMPLATE_TYPE_PARM
17122 && cp_type_quals (TREE_TYPE (*parm
)) == TYPE_UNQUALIFIED
17123 && TREE_CODE (*arg
) == REFERENCE_TYPE
17124 && !TYPE_REF_IS_RVALUE (*arg
))
17125 *parm
= TREE_TYPE (*parm
);
17126 /* Nothing else to do in this case. */
17130 gcc_unreachable ();
17133 if (TREE_CODE (*parm
) != REFERENCE_TYPE
)
17135 /* [temp.deduct.call]
17137 If P is not a reference type:
17139 --If A is an array type, the pointer type produced by the
17140 array-to-pointer standard conversion (_conv.array_) is
17141 used in place of A for type deduction; otherwise,
17143 --If A is a function type, the pointer type produced by
17144 the function-to-pointer standard conversion
17145 (_conv.func_) is used in place of A for type deduction;
17148 --If A is a cv-qualified type, the top level
17149 cv-qualifiers of A's type are ignored for type
17151 if (TREE_CODE (*arg
) == ARRAY_TYPE
)
17152 *arg
= build_pointer_type (TREE_TYPE (*arg
));
17153 else if (TREE_CODE (*arg
) == FUNCTION_TYPE
)
17154 *arg
= build_pointer_type (*arg
);
17156 *arg
= TYPE_MAIN_VARIANT (*arg
);
17159 /* From C++0x [14.8.2.1/3 temp.deduct.call] (after DR606), "If P is
17160 of the form T&&, where T is a template parameter, and the argument
17161 is an lvalue, T is deduced as A& */
17162 if (TREE_CODE (*parm
) == REFERENCE_TYPE
17163 && TYPE_REF_IS_RVALUE (*parm
)
17164 && TREE_CODE (TREE_TYPE (*parm
)) == TEMPLATE_TYPE_PARM
17165 && cp_type_quals (TREE_TYPE (*parm
)) == TYPE_UNQUALIFIED
17166 && (arg_expr
? real_lvalue_p (arg_expr
)
17167 /* try_one_overload doesn't provide an arg_expr, but
17168 functions are always lvalues. */
17169 : TREE_CODE (*arg
) == FUNCTION_TYPE
))
17170 *arg
= build_reference_type (*arg
);
17172 /* [temp.deduct.call]
17174 If P is a cv-qualified type, the top level cv-qualifiers
17175 of P's type are ignored for type deduction. If P is a
17176 reference type, the type referred to by P is used for
17178 *parm
= TYPE_MAIN_VARIANT (*parm
);
17179 if (TREE_CODE (*parm
) == REFERENCE_TYPE
)
17181 *parm
= TREE_TYPE (*parm
);
17182 result
|= UNIFY_ALLOW_OUTER_MORE_CV_QUAL
;
17185 /* DR 322. For conversion deduction, remove a reference type on parm
17186 too (which has been swapped into ARG). */
17187 if (strict
== DEDUCE_CONV
&& TREE_CODE (*arg
) == REFERENCE_TYPE
)
17188 *arg
= TREE_TYPE (*arg
);
17193 /* Subroutine of unify_one_argument. PARM is a function parameter of a
17194 template which does contain any deducible template parameters; check if
17195 ARG is a suitable match for it. STRICT, FLAGS and EXPLAIN_P are as in
17196 unify_one_argument. */
17199 check_non_deducible_conversion (tree parm
, tree arg
, int strict
,
17200 int flags
, bool explain_p
)
17205 type
= TREE_TYPE (arg
);
17209 if (same_type_p (parm
, type
))
17210 return unify_success (explain_p
);
17212 if (strict
== DEDUCE_CONV
)
17214 if (can_convert_arg (type
, parm
, NULL_TREE
, flags
,
17215 explain_p
? tf_warning_or_error
: tf_none
))
17216 return unify_success (explain_p
);
17218 else if (strict
!= DEDUCE_EXACT
)
17220 if (can_convert_arg (parm
, type
,
17221 TYPE_P (arg
) ? NULL_TREE
: arg
,
17222 flags
, explain_p
? tf_warning_or_error
: tf_none
))
17223 return unify_success (explain_p
);
17226 if (strict
== DEDUCE_EXACT
)
17227 return unify_type_mismatch (explain_p
, parm
, arg
);
17229 return unify_arg_conversion (explain_p
, parm
, type
, arg
);
17232 static bool uses_deducible_template_parms (tree type
);
17234 /* Returns true iff the expression EXPR is one from which a template
17235 argument can be deduced. In other words, if it's an undecorated
17236 use of a template non-type parameter. */
17239 deducible_expression (tree expr
)
17241 return (TREE_CODE (expr
) == TEMPLATE_PARM_INDEX
);
17244 /* Returns true iff the array domain DOMAIN uses a template parameter in a
17245 deducible way; that is, if it has a max value of <PARM> - 1. */
17248 deducible_array_bound (tree domain
)
17250 if (domain
== NULL_TREE
)
17253 tree max
= TYPE_MAX_VALUE (domain
);
17254 if (TREE_CODE (max
) != MINUS_EXPR
)
17257 return deducible_expression (TREE_OPERAND (max
, 0));
17260 /* Returns true iff the template arguments ARGS use a template parameter
17261 in a deducible way. */
17264 deducible_template_args (tree args
)
17266 for (int i
= 0; i
< TREE_VEC_LENGTH (args
); ++i
)
17269 tree elt
= TREE_VEC_ELT (args
, i
);
17270 if (ARGUMENT_PACK_P (elt
))
17271 deducible
= deducible_template_args (ARGUMENT_PACK_ARGS (elt
));
17274 if (PACK_EXPANSION_P (elt
))
17275 elt
= PACK_EXPANSION_PATTERN (elt
);
17276 if (TREE_CODE (elt
) == TEMPLATE_TEMPLATE_PARM
)
17278 else if (TYPE_P (elt
))
17279 deducible
= uses_deducible_template_parms (elt
);
17281 deducible
= deducible_expression (elt
);
17289 /* Returns true iff TYPE contains any deducible references to template
17290 parameters, as per 14.8.2.5. */
17293 uses_deducible_template_parms (tree type
)
17295 if (PACK_EXPANSION_P (type
))
17296 type
= PACK_EXPANSION_PATTERN (type
);
17303 if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
17304 || TREE_CODE (type
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
17310 if (POINTER_TYPE_P (type
))
17311 return uses_deducible_template_parms (TREE_TYPE (type
));
17313 /* T[integer-constant ]
17315 if (TREE_CODE (type
) == ARRAY_TYPE
)
17316 return (uses_deducible_template_parms (TREE_TYPE (type
))
17317 || deducible_array_bound (TYPE_DOMAIN (type
)));
17329 if (TYPE_PTRMEM_P (type
))
17330 return (uses_deducible_template_parms (TYPE_PTRMEM_CLASS_TYPE (type
))
17331 || (uses_deducible_template_parms
17332 (TYPE_PTRMEM_POINTED_TO_TYPE (type
))));
17334 /* template-name <T> (where template-name refers to a class template)
17335 template-name <i> (where template-name refers to a class template) */
17336 if (CLASS_TYPE_P (type
)
17337 && CLASSTYPE_TEMPLATE_INFO (type
)
17338 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (type
)))
17339 return deducible_template_args (INNERMOST_TEMPLATE_ARGS
17340 (CLASSTYPE_TI_ARGS (type
)));
17345 if (TREE_CODE (type
) == FUNCTION_TYPE
17346 || TREE_CODE (type
) == METHOD_TYPE
)
17348 if (uses_deducible_template_parms (TREE_TYPE (type
)))
17350 tree parm
= TYPE_ARG_TYPES (type
);
17351 if (TREE_CODE (type
) == METHOD_TYPE
)
17352 parm
= TREE_CHAIN (parm
);
17353 for (; parm
; parm
= TREE_CHAIN (parm
))
17354 if (uses_deducible_template_parms (TREE_VALUE (parm
)))
17361 /* Subroutine of type_unification_real and unify_pack_expansion to
17362 handle unification of a single P/A pair. Parameters are as
17363 for those functions. */
17366 unify_one_argument (tree tparms
, tree targs
, tree parm
, tree arg
,
17367 int subr
, unification_kind_t strict
,
17370 tree arg_expr
= NULL_TREE
;
17373 if (arg
== error_mark_node
|| parm
== error_mark_node
)
17374 return unify_invalid (explain_p
);
17375 if (arg
== unknown_type_node
)
17376 /* We can't deduce anything from this, but we might get all the
17377 template args from other function args. */
17378 return unify_success (explain_p
);
17380 /* Implicit conversions (Clause 4) will be performed on a function
17381 argument to convert it to the type of the corresponding function
17382 parameter if the parameter type contains no template-parameters that
17383 participate in template argument deduction. */
17384 if (strict
!= DEDUCE_EXACT
17385 && TYPE_P (parm
) && !uses_deducible_template_parms (parm
))
17386 /* For function parameters with no deducible template parameters,
17387 just return. We'll check non-dependent conversions later. */
17388 return unify_success (explain_p
);
17393 arg_strict
= (UNIFY_ALLOW_OUTER_LEVEL
17394 | UNIFY_ALLOW_MORE_CV_QUAL
17395 | UNIFY_ALLOW_DERIVED
);
17399 arg_strict
= UNIFY_ALLOW_LESS_CV_QUAL
;
17403 arg_strict
= UNIFY_ALLOW_NONE
;
17407 gcc_unreachable ();
17410 /* We only do these transformations if this is the top-level
17411 parameter_type_list in a call or declaration matching; in other
17412 situations (nested function declarators, template argument lists) we
17413 won't be comparing a type to an expression, and we don't do any type
17419 gcc_assert (TREE_TYPE (arg
) != NULL_TREE
);
17420 if (type_unknown_p (arg
))
17422 /* [temp.deduct.type] A template-argument can be
17423 deduced from a pointer to function or pointer
17424 to member function argument if the set of
17425 overloaded functions does not contain function
17426 templates and at most one of a set of
17427 overloaded functions provides a unique
17430 if (resolve_overloaded_unification
17431 (tparms
, targs
, parm
, arg
, strict
,
17432 arg_strict
, explain_p
))
17433 return unify_success (explain_p
);
17434 return unify_overload_resolution_failure (explain_p
, arg
);
17438 arg
= unlowered_expr_type (arg
);
17439 if (arg
== error_mark_node
)
17440 return unify_invalid (explain_p
);
17444 maybe_adjust_types_for_deduction (strict
, &parm
, &arg
, arg_expr
);
17447 if ((TYPE_P (parm
) || TREE_CODE (parm
) == TEMPLATE_DECL
)
17448 != (TYPE_P (arg
) || TREE_CODE (arg
) == TEMPLATE_DECL
))
17449 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
17451 /* For deduction from an init-list we need the actual list. */
17452 if (arg_expr
&& BRACE_ENCLOSED_INITIALIZER_P (arg_expr
))
17454 return unify (tparms
, targs
, parm
, arg
, arg_strict
, explain_p
);
17457 /* Most parms like fn_type_unification.
17459 If SUBR is 1, we're being called recursively (to unify the
17460 arguments of a function or method parameter of a function
17463 CHECKS is a pointer to a vector of access checks encountered while
17464 substituting default template arguments. */
17467 type_unification_real (tree tparms
,
17471 unsigned int xnargs
,
17473 unification_kind_t strict
,
17475 vec
<deferred_access_check
, va_gc
> **checks
,
17480 int ntparms
= TREE_VEC_LENGTH (tparms
);
17481 int saw_undeduced
= 0;
17484 unsigned int nargs
;
17487 gcc_assert (TREE_CODE (tparms
) == TREE_VEC
);
17488 gcc_assert (xparms
== NULL_TREE
|| TREE_CODE (xparms
) == TREE_LIST
);
17489 gcc_assert (ntparms
> 0);
17491 /* Reset the number of non-defaulted template arguments contained
17493 NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
) = NULL_TREE
;
17501 while (parms
&& parms
!= void_list_node
17504 parm
= TREE_VALUE (parms
);
17506 if (TREE_CODE (parm
) == TYPE_PACK_EXPANSION
17507 && (!TREE_CHAIN (parms
) || TREE_CHAIN (parms
) == void_list_node
))
17508 /* For a function parameter pack that occurs at the end of the
17509 parameter-declaration-list, the type A of each remaining
17510 argument of the call is compared with the type P of the
17511 declarator-id of the function parameter pack. */
17514 parms
= TREE_CHAIN (parms
);
17516 if (TREE_CODE (parm
) == TYPE_PACK_EXPANSION
)
17517 /* For a function parameter pack that does not occur at the
17518 end of the parameter-declaration-list, the type of the
17519 parameter pack is a non-deduced context. */
17525 if (unify_one_argument (tparms
, targs
, parm
, arg
, subr
, strict
,
17531 && parms
!= void_list_node
17532 && TREE_CODE (TREE_VALUE (parms
)) == TYPE_PACK_EXPANSION
)
17534 /* Unify the remaining arguments with the pack expansion type. */
17536 tree parmvec
= make_tree_vec (1);
17538 /* Allocate a TREE_VEC and copy in all of the arguments */
17539 argvec
= make_tree_vec (nargs
- ia
);
17540 for (i
= 0; ia
< nargs
; ++ia
, ++i
)
17541 TREE_VEC_ELT (argvec
, i
) = args
[ia
];
17543 /* Copy the parameter into parmvec. */
17544 TREE_VEC_ELT (parmvec
, 0) = TREE_VALUE (parms
);
17545 if (unify_pack_expansion (tparms
, targs
, parmvec
, argvec
, strict
,
17546 /*subr=*/subr
, explain_p
))
17549 /* Advance to the end of the list of parameters. */
17550 parms
= TREE_CHAIN (parms
);
17553 /* Fail if we've reached the end of the parm list, and more args
17554 are present, and the parm list isn't variadic. */
17555 if (ia
< nargs
&& parms
== void_list_node
)
17556 return unify_too_many_arguments (explain_p
, nargs
, ia
);
17557 /* Fail if parms are left and they don't have default values and
17558 they aren't all deduced as empty packs (c++/57397). This is
17559 consistent with sufficient_parms_p. */
17560 if (parms
&& parms
!= void_list_node
17561 && TREE_PURPOSE (parms
) == NULL_TREE
)
17563 unsigned int count
= nargs
;
17568 type_pack_p
= TREE_CODE (TREE_VALUE (p
)) == TYPE_PACK_EXPANSION
;
17571 p
= TREE_CHAIN (p
);
17573 while (p
&& p
!= void_list_node
);
17574 if (count
!= nargs
)
17575 return unify_too_few_arguments (explain_p
, ia
, count
,
17581 tsubst_flags_t complain
= (explain_p
17582 ? tf_warning_or_error
17585 for (i
= 0; i
< ntparms
; i
++)
17587 tree targ
= TREE_VEC_ELT (targs
, i
);
17588 tree tparm
= TREE_VEC_ELT (tparms
, i
);
17590 /* Clear the "incomplete" flags on all argument packs now so that
17591 substituting them into later default arguments works. */
17592 if (targ
&& ARGUMENT_PACK_P (targ
))
17594 ARGUMENT_PACK_INCOMPLETE_P (targ
) = 0;
17595 ARGUMENT_PACK_EXPLICIT_ARGS (targ
) = NULL_TREE
;
17598 if (targ
|| tparm
== error_mark_node
)
17600 tparm
= TREE_VALUE (tparm
);
17602 /* If this is an undeduced nontype parameter that depends on
17603 a type parameter, try another pass; its type may have been
17604 deduced from a later argument than the one from which
17605 this parameter can be deduced. */
17606 if (TREE_CODE (tparm
) == PARM_DECL
17607 && uses_template_parms (TREE_TYPE (tparm
))
17608 && saw_undeduced
< 2)
17614 /* Core issue #226 (C++0x) [temp.deduct]:
17616 If a template argument has not been deduced, its
17617 default template argument, if any, is used.
17619 When we are in C++98 mode, TREE_PURPOSE will either
17620 be NULL_TREE or ERROR_MARK_NODE, so we do not need
17621 to explicitly check cxx_dialect here. */
17622 if (TREE_PURPOSE (TREE_VEC_ELT (tparms
, i
)))
17623 /* OK, there is a default argument. Wait until after the
17624 conversion check to do substitution. */
17627 /* If the type parameter is a parameter pack, then it will
17628 be deduced to an empty parameter pack. */
17629 if (template_parameter_pack_p (tparm
))
17633 if (TREE_CODE (tparm
) == TEMPLATE_PARM_INDEX
)
17635 arg
= make_node (NONTYPE_ARGUMENT_PACK
);
17636 TREE_TYPE (arg
) = TREE_TYPE (TEMPLATE_PARM_DECL (tparm
));
17637 TREE_CONSTANT (arg
) = 1;
17640 arg
= cxx_make_type (TYPE_ARGUMENT_PACK
);
17642 SET_ARGUMENT_PACK_ARGS (arg
, make_tree_vec (0));
17644 TREE_VEC_ELT (targs
, i
) = arg
;
17648 return unify_parameter_deduction_failure (explain_p
, tparm
);
17651 /* DR 1391: All parameters have args, now check non-dependent parms for
17653 if (saw_undeduced
< 2)
17654 for (ia
= 0, parms
= xparms
, args
= xargs
, nargs
= xnargs
;
17655 parms
&& parms
!= void_list_node
&& ia
< nargs
; )
17657 parm
= TREE_VALUE (parms
);
17659 if (TREE_CODE (parm
) == TYPE_PACK_EXPANSION
17660 && (!TREE_CHAIN (parms
)
17661 || TREE_CHAIN (parms
) == void_list_node
))
17662 /* For a function parameter pack that occurs at the end of the
17663 parameter-declaration-list, the type A of each remaining
17664 argument of the call is compared with the type P of the
17665 declarator-id of the function parameter pack. */
17668 parms
= TREE_CHAIN (parms
);
17670 if (TREE_CODE (parm
) == TYPE_PACK_EXPANSION
)
17671 /* For a function parameter pack that does not occur at the
17672 end of the parameter-declaration-list, the type of the
17673 parameter pack is a non-deduced context. */
17679 if (uses_template_parms (parm
))
17681 if (check_non_deducible_conversion (parm
, arg
, strict
, flags
,
17686 /* Now substitute into the default template arguments. */
17687 for (i
= 0; i
< ntparms
; i
++)
17689 tree targ
= TREE_VEC_ELT (targs
, i
);
17690 tree tparm
= TREE_VEC_ELT (tparms
, i
);
17692 if (targ
|| tparm
== error_mark_node
)
17694 tree parm
= TREE_VALUE (tparm
);
17696 if (TREE_CODE (parm
) == PARM_DECL
17697 && uses_template_parms (TREE_TYPE (parm
))
17698 && saw_undeduced
< 2)
17701 tree arg
= TREE_PURPOSE (tparm
);
17702 reopen_deferring_access_checks (*checks
);
17703 location_t save_loc
= input_location
;
17705 input_location
= DECL_SOURCE_LOCATION (parm
);
17706 arg
= tsubst_template_arg (arg
, targs
, complain
, NULL_TREE
);
17707 arg
= convert_template_argument (parm
, arg
, targs
, complain
,
17709 input_location
= save_loc
;
17710 *checks
= get_deferred_access_checks ();
17711 pop_deferring_access_checks ();
17712 if (arg
== error_mark_node
)
17716 TREE_VEC_ELT (targs
, i
) = arg
;
17717 /* The position of the first default template argument,
17718 is also the number of non-defaulted arguments in TARGS.
17720 if (!NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
))
17721 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
, i
);
17726 if (saw_undeduced
++ == 1)
17729 #ifdef ENABLE_CHECKING
17730 if (!NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
))
17731 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
, TREE_VEC_LENGTH (targs
));
17734 return unify_success (explain_p
);
17737 /* Subroutine of type_unification_real. Args are like the variables
17738 at the call site. ARG is an overloaded function (or template-id);
17739 we try deducing template args from each of the overloads, and if
17740 only one succeeds, we go with that. Modifies TARGS and returns
17741 true on success. */
17744 resolve_overloaded_unification (tree tparms
,
17748 unification_kind_t strict
,
17752 tree tempargs
= copy_node (targs
);
17754 tree goodfn
= NULL_TREE
;
17757 if (TREE_CODE (arg
) == ADDR_EXPR
)
17759 arg
= TREE_OPERAND (arg
, 0);
17765 if (TREE_CODE (arg
) == COMPONENT_REF
)
17766 /* Handle `&x' where `x' is some static or non-static member
17768 arg
= TREE_OPERAND (arg
, 1);
17770 if (TREE_CODE (arg
) == OFFSET_REF
)
17771 arg
= TREE_OPERAND (arg
, 1);
17773 /* Strip baselink information. */
17774 if (BASELINK_P (arg
))
17775 arg
= BASELINK_FUNCTIONS (arg
);
17777 if (TREE_CODE (arg
) == TEMPLATE_ID_EXPR
)
17779 /* If we got some explicit template args, we need to plug them into
17780 the affected templates before we try to unify, in case the
17781 explicit args will completely resolve the templates in question. */
17784 tree expl_subargs
= TREE_OPERAND (arg
, 1);
17785 arg
= TREE_OPERAND (arg
, 0);
17787 for (; arg
; arg
= OVL_NEXT (arg
))
17789 tree fn
= OVL_CURRENT (arg
);
17790 tree subargs
, elem
;
17792 if (TREE_CODE (fn
) != TEMPLATE_DECL
)
17795 subargs
= coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (fn
),
17796 expl_subargs
, NULL_TREE
, tf_none
,
17797 /*require_all_args=*/true,
17798 /*use_default_args=*/true);
17799 if (subargs
!= error_mark_node
17800 && !any_dependent_template_arguments_p (subargs
))
17802 elem
= TREE_TYPE (instantiate_template (fn
, subargs
, tf_none
));
17803 if (try_one_overload (tparms
, targs
, tempargs
, parm
,
17804 elem
, strict
, sub_strict
, addr_p
, explain_p
)
17805 && (!goodfn
|| !same_type_p (goodfn
, elem
)))
17814 /* If no templates (or more than one) are fully resolved by the
17815 explicit arguments, this template-id is a non-deduced context; it
17816 could still be OK if we deduce all template arguments for the
17817 enclosing call through other arguments. */
17821 else if (TREE_CODE (arg
) != OVERLOAD
17822 && TREE_CODE (arg
) != FUNCTION_DECL
)
17823 /* If ARG is, for example, "(0, &f)" then its type will be unknown
17824 -- but the deduction does not succeed because the expression is
17825 not just the function on its own. */
17828 for (; arg
; arg
= OVL_NEXT (arg
))
17829 if (try_one_overload (tparms
, targs
, tempargs
, parm
,
17830 TREE_TYPE (OVL_CURRENT (arg
)),
17831 strict
, sub_strict
, addr_p
, explain_p
)
17832 && (!goodfn
|| !decls_match (goodfn
, OVL_CURRENT (arg
))))
17834 goodfn
= OVL_CURRENT (arg
);
17838 /* [temp.deduct.type] A template-argument can be deduced from a pointer
17839 to function or pointer to member function argument if the set of
17840 overloaded functions does not contain function templates and at most
17841 one of a set of overloaded functions provides a unique match.
17843 So if we found multiple possibilities, we return success but don't
17844 deduce anything. */
17848 int i
= TREE_VEC_LENGTH (targs
);
17850 if (TREE_VEC_ELT (tempargs
, i
))
17852 tree old
= TREE_VEC_ELT (targs
, i
);
17853 tree new_
= TREE_VEC_ELT (tempargs
, i
);
17854 if (new_
&& old
&& ARGUMENT_PACK_P (old
)
17855 && ARGUMENT_PACK_EXPLICIT_ARGS (old
))
17856 /* Don't forget explicit template arguments in a pack. */
17857 ARGUMENT_PACK_EXPLICIT_ARGS (new_
)
17858 = ARGUMENT_PACK_EXPLICIT_ARGS (old
);
17859 TREE_VEC_ELT (targs
, i
) = new_
;
17868 /* Core DR 115: In contexts where deduction is done and fails, or in
17869 contexts where deduction is not done, if a template argument list is
17870 specified and it, along with any default template arguments, identifies
17871 a single function template specialization, then the template-id is an
17872 lvalue for the function template specialization. */
17875 resolve_nondeduced_context (tree orig_expr
)
17877 tree expr
, offset
, baselink
;
17880 if (!type_unknown_p (orig_expr
))
17885 offset
= NULL_TREE
;
17886 baselink
= NULL_TREE
;
17888 if (TREE_CODE (expr
) == ADDR_EXPR
)
17890 expr
= TREE_OPERAND (expr
, 0);
17893 if (TREE_CODE (expr
) == OFFSET_REF
)
17896 expr
= TREE_OPERAND (expr
, 1);
17898 if (BASELINK_P (expr
))
17901 expr
= BASELINK_FUNCTIONS (expr
);
17904 if (TREE_CODE (expr
) == TEMPLATE_ID_EXPR
)
17907 tree goodfn
= NULL_TREE
;
17909 /* If we got some explicit template args, we need to plug them into
17910 the affected templates before we try to unify, in case the
17911 explicit args will completely resolve the templates in question. */
17913 tree expl_subargs
= TREE_OPERAND (expr
, 1);
17914 tree arg
= TREE_OPERAND (expr
, 0);
17915 tree badfn
= NULL_TREE
;
17916 tree badargs
= NULL_TREE
;
17918 for (; arg
; arg
= OVL_NEXT (arg
))
17920 tree fn
= OVL_CURRENT (arg
);
17921 tree subargs
, elem
;
17923 if (TREE_CODE (fn
) != TEMPLATE_DECL
)
17926 subargs
= coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (fn
),
17927 expl_subargs
, NULL_TREE
, tf_none
,
17928 /*require_all_args=*/true,
17929 /*use_default_args=*/true);
17930 if (subargs
!= error_mark_node
17931 && !any_dependent_template_arguments_p (subargs
))
17933 elem
= instantiate_template (fn
, subargs
, tf_none
);
17934 if (elem
== error_mark_node
)
17939 else if (elem
&& (!goodfn
|| !decls_match (goodfn
, elem
)))
17948 mark_used (goodfn
);
17951 expr
= build_baselink (BASELINK_BINFO (baselink
),
17952 BASELINK_ACCESS_BINFO (baselink
),
17953 expr
, BASELINK_OPTYPE (baselink
));
17957 = TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (offset
, 0)));
17958 expr
= build_offset_ref (base
, expr
, addr
, tf_warning_or_error
);
17961 expr
= cp_build_addr_expr (expr
, tf_warning_or_error
);
17964 else if (good
== 0 && badargs
)
17965 /* There were no good options and at least one bad one, so let the
17966 user know what the problem is. */
17967 instantiate_template (badfn
, badargs
, tf_warning_or_error
);
17972 /* Subroutine of resolve_overloaded_unification; does deduction for a single
17973 overload. Fills TARGS with any deduced arguments, or error_mark_node if
17974 different overloads deduce different arguments for a given parm.
17975 ADDR_P is true if the expression for which deduction is being
17976 performed was of the form "& fn" rather than simply "fn".
17978 Returns 1 on success. */
17981 try_one_overload (tree tparms
,
17986 unification_kind_t strict
,
17995 if (arg
== error_mark_node
)
17998 /* [temp.deduct.type] A template-argument can be deduced from a pointer
17999 to function or pointer to member function argument if the set of
18000 overloaded functions does not contain function templates and at most
18001 one of a set of overloaded functions provides a unique match.
18003 So if this is a template, just return success. */
18005 if (uses_template_parms (arg
))
18008 if (TREE_CODE (arg
) == METHOD_TYPE
)
18009 arg
= build_ptrmemfunc_type (build_pointer_type (arg
));
18011 arg
= build_pointer_type (arg
);
18013 sub_strict
|= maybe_adjust_types_for_deduction (strict
, &parm
, &arg
, NULL
);
18015 /* We don't copy orig_targs for this because if we have already deduced
18016 some template args from previous args, unify would complain when we
18017 try to deduce a template parameter for the same argument, even though
18018 there isn't really a conflict. */
18019 nargs
= TREE_VEC_LENGTH (targs
);
18020 tempargs
= make_tree_vec (nargs
);
18022 if (unify (tparms
, tempargs
, parm
, arg
, sub_strict
, explain_p
))
18025 /* First make sure we didn't deduce anything that conflicts with
18026 explicitly specified args. */
18027 for (i
= nargs
; i
--; )
18029 tree elt
= TREE_VEC_ELT (tempargs
, i
);
18030 tree oldelt
= TREE_VEC_ELT (orig_targs
, i
);
18034 else if (uses_template_parms (elt
))
18035 /* Since we're unifying against ourselves, we will fill in
18036 template args used in the function parm list with our own
18037 template parms. Discard them. */
18038 TREE_VEC_ELT (tempargs
, i
) = NULL_TREE
;
18039 else if (oldelt
&& !template_args_equal (oldelt
, elt
))
18043 for (i
= nargs
; i
--; )
18045 tree elt
= TREE_VEC_ELT (tempargs
, i
);
18048 TREE_VEC_ELT (targs
, i
) = elt
;
18054 /* PARM is a template class (perhaps with unbound template
18055 parameters). ARG is a fully instantiated type. If ARG can be
18056 bound to PARM, return ARG, otherwise return NULL_TREE. TPARMS and
18057 TARGS are as for unify. */
18060 try_class_unification (tree tparms
, tree targs
, tree parm
, tree arg
,
18063 tree copy_of_targs
;
18065 if (!CLASSTYPE_TEMPLATE_INFO (arg
)
18066 || (most_general_template (CLASSTYPE_TI_TEMPLATE (arg
))
18067 != most_general_template (CLASSTYPE_TI_TEMPLATE (parm
))))
18070 /* We need to make a new template argument vector for the call to
18071 unify. If we used TARGS, we'd clutter it up with the result of
18072 the attempted unification, even if this class didn't work out.
18073 We also don't want to commit ourselves to all the unifications
18074 we've already done, since unification is supposed to be done on
18075 an argument-by-argument basis. In other words, consider the
18076 following pathological case:
18078 template <int I, int J, int K>
18081 template <int I, int J>
18082 struct S<I, J, 2> : public S<I, I, I>, S<J, J, J> {};
18084 template <int I, int J, int K>
18085 void f(S<I, J, K>, S<I, I, I>);
18094 Now, by the time we consider the unification involving `s2', we
18095 already know that we must have `f<0, 0, 0>'. But, even though
18096 `S<0, 1, 2>' is derived from `S<0, 0, 0>', the code is invalid
18097 because there are two ways to unify base classes of S<0, 1, 2>
18098 with S<I, I, I>. If we kept the already deduced knowledge, we
18099 would reject the possibility I=1. */
18100 copy_of_targs
= make_tree_vec (TREE_VEC_LENGTH (targs
));
18102 /* If unification failed, we're done. */
18103 if (unify (tparms
, copy_of_targs
, CLASSTYPE_TI_ARGS (parm
),
18104 CLASSTYPE_TI_ARGS (arg
), UNIFY_ALLOW_NONE
, explain_p
))
18110 /* Given a template type PARM and a class type ARG, find the unique
18111 base type in ARG that is an instance of PARM. We do not examine
18112 ARG itself; only its base-classes. If there is not exactly one
18113 appropriate base class, return NULL_TREE. PARM may be the type of
18114 a partial specialization, as well as a plain template type. Used
18117 static enum template_base_result
18118 get_template_base (tree tparms
, tree targs
, tree parm
, tree arg
,
18119 bool explain_p
, tree
*result
)
18121 tree rval
= NULL_TREE
;
18124 gcc_assert (RECORD_OR_UNION_CODE_P (TREE_CODE (arg
)));
18126 binfo
= TYPE_BINFO (complete_type (arg
));
18129 /* The type could not be completed. */
18130 *result
= NULL_TREE
;
18131 return tbr_incomplete_type
;
18134 /* Walk in inheritance graph order. The search order is not
18135 important, and this avoids multiple walks of virtual bases. */
18136 for (binfo
= TREE_CHAIN (binfo
); binfo
; binfo
= TREE_CHAIN (binfo
))
18138 tree r
= try_class_unification (tparms
, targs
, parm
,
18139 BINFO_TYPE (binfo
), explain_p
);
18143 /* If there is more than one satisfactory baseclass, then:
18147 If they yield more than one possible deduced A, the type
18151 if (rval
&& !same_type_p (r
, rval
))
18153 *result
= NULL_TREE
;
18154 return tbr_ambiguous_baseclass
;
18162 return tbr_success
;
18165 /* Returns the level of DECL, which declares a template parameter. */
18168 template_decl_level (tree decl
)
18170 switch (TREE_CODE (decl
))
18173 case TEMPLATE_DECL
:
18174 return TEMPLATE_TYPE_LEVEL (TREE_TYPE (decl
));
18177 return TEMPLATE_PARM_LEVEL (DECL_INITIAL (decl
));
18180 gcc_unreachable ();
18185 /* Decide whether ARG can be unified with PARM, considering only the
18186 cv-qualifiers of each type, given STRICT as documented for unify.
18187 Returns nonzero iff the unification is OK on that basis. */
18190 check_cv_quals_for_unify (int strict
, tree arg
, tree parm
)
18192 int arg_quals
= cp_type_quals (arg
);
18193 int parm_quals
= cp_type_quals (parm
);
18195 if (TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
18196 && !(strict
& UNIFY_ALLOW_OUTER_MORE_CV_QUAL
))
18198 /* Although a CVR qualifier is ignored when being applied to a
18199 substituted template parameter ([8.3.2]/1 for example), that
18200 does not allow us to unify "const T" with "int&" because both
18201 types are not of the form "cv-list T" [14.8.2.5 temp.deduct.type].
18202 It is ok when we're allowing additional CV qualifiers
18203 at the outer level [14.8.2.1]/3,1st bullet. */
18204 if ((TREE_CODE (arg
) == REFERENCE_TYPE
18205 || TREE_CODE (arg
) == FUNCTION_TYPE
18206 || TREE_CODE (arg
) == METHOD_TYPE
)
18207 && (parm_quals
& (TYPE_QUAL_CONST
| TYPE_QUAL_VOLATILE
)))
18210 if ((!POINTER_TYPE_P (arg
) && TREE_CODE (arg
) != TEMPLATE_TYPE_PARM
)
18211 && (parm_quals
& TYPE_QUAL_RESTRICT
))
18215 if (!(strict
& (UNIFY_ALLOW_MORE_CV_QUAL
| UNIFY_ALLOW_OUTER_MORE_CV_QUAL
))
18216 && (arg_quals
& parm_quals
) != parm_quals
)
18219 if (!(strict
& (UNIFY_ALLOW_LESS_CV_QUAL
| UNIFY_ALLOW_OUTER_LESS_CV_QUAL
))
18220 && (parm_quals
& arg_quals
) != arg_quals
)
18226 /* Determines the LEVEL and INDEX for the template parameter PARM. */
18228 template_parm_level_and_index (tree parm
, int* level
, int* index
)
18230 if (TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
18231 || TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
18232 || TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
18234 *index
= TEMPLATE_TYPE_IDX (parm
);
18235 *level
= TEMPLATE_TYPE_LEVEL (parm
);
18239 *index
= TEMPLATE_PARM_IDX (parm
);
18240 *level
= TEMPLATE_PARM_LEVEL (parm
);
18244 #define RECUR_AND_CHECK_FAILURE(TP, TA, P, A, S, EP) \
18246 if (unify (TP, TA, P, A, S, EP)) \
18250 /* Unifies the remaining arguments in PACKED_ARGS with the pack
18251 expansion at the end of PACKED_PARMS. Returns 0 if the type
18252 deduction succeeds, 1 otherwise. STRICT is the same as in
18253 unify. CALL_ARGS_P is true iff PACKED_ARGS is actually a function
18254 call argument list. We'll need to adjust the arguments to make them
18255 types. SUBR tells us if this is from a recursive call to
18256 type_unification_real, or for comparing two template argument
18260 unify_pack_expansion (tree tparms
, tree targs
, tree packed_parms
,
18261 tree packed_args
, unification_kind_t strict
,
18262 bool subr
, bool explain_p
)
18265 = TREE_VEC_ELT (packed_parms
, TREE_VEC_LENGTH (packed_parms
) - 1);
18266 tree pattern
= PACK_EXPANSION_PATTERN (parm
);
18267 tree pack
, packs
= NULL_TREE
;
18268 int i
, start
= TREE_VEC_LENGTH (packed_parms
) - 1;
18270 packed_args
= expand_template_argument_pack (packed_args
);
18272 int len
= TREE_VEC_LENGTH (packed_args
);
18274 /* Determine the parameter packs we will be deducing from the
18275 pattern, and record their current deductions. */
18276 for (pack
= PACK_EXPANSION_PARAMETER_PACKS (parm
);
18277 pack
; pack
= TREE_CHAIN (pack
))
18279 tree parm_pack
= TREE_VALUE (pack
);
18282 /* Determine the index and level of this parameter pack. */
18283 template_parm_level_and_index (parm_pack
, &level
, &idx
);
18285 /* Keep track of the parameter packs and their corresponding
18287 packs
= tree_cons (parm_pack
, TMPL_ARG (targs
, level
, idx
), packs
);
18288 TREE_TYPE (packs
) = make_tree_vec (len
- start
);
18291 /* Loop through all of the arguments that have not yet been
18292 unified and unify each with the pattern. */
18293 for (i
= start
; i
< len
; i
++)
18296 bool any_explicit
= false;
18297 tree arg
= TREE_VEC_ELT (packed_args
, i
);
18299 /* For each parameter pack, set its TMPL_ARG to either NULL_TREE
18300 or the element of its argument pack at the current index if
18301 this argument was explicitly specified. */
18302 for (pack
= packs
; pack
; pack
= TREE_CHAIN (pack
))
18306 template_parm_level_and_index (TREE_PURPOSE (pack
), &level
, &idx
);
18309 if (TREE_VALUE (pack
)
18310 && (pargs
= ARGUMENT_PACK_EXPLICIT_ARGS (TREE_VALUE (pack
)))
18311 && (i
- start
< TREE_VEC_LENGTH (pargs
)))
18313 any_explicit
= true;
18314 arg
= TREE_VEC_ELT (pargs
, i
- start
);
18316 TMPL_ARG (targs
, level
, idx
) = arg
;
18319 /* If we had explicit template arguments, substitute them into the
18320 pattern before deduction. */
18323 /* Some arguments might still be unspecified or dependent. */
18325 ++processing_template_decl
;
18326 dependent
= any_dependent_template_arguments_p (targs
);
18328 --processing_template_decl
;
18329 parm
= tsubst (pattern
, targs
,
18330 explain_p
? tf_warning_or_error
: tf_none
,
18333 --processing_template_decl
;
18334 if (parm
== error_mark_node
)
18340 /* Unify the pattern with the current argument. */
18341 if (unify_one_argument (tparms
, targs
, parm
, arg
, subr
, strict
,
18345 /* For each parameter pack, collect the deduced value. */
18346 for (pack
= packs
; pack
; pack
= TREE_CHAIN (pack
))
18349 template_parm_level_and_index (TREE_PURPOSE (pack
), &level
, &idx
);
18351 TREE_VEC_ELT (TREE_TYPE (pack
), i
- start
) =
18352 TMPL_ARG (targs
, level
, idx
);
18356 /* Verify that the results of unification with the parameter packs
18357 produce results consistent with what we've seen before, and make
18358 the deduced argument packs available. */
18359 for (pack
= packs
; pack
; pack
= TREE_CHAIN (pack
))
18361 tree old_pack
= TREE_VALUE (pack
);
18362 tree new_args
= TREE_TYPE (pack
);
18363 int i
, len
= TREE_VEC_LENGTH (new_args
);
18365 bool nondeduced_p
= false;
18367 /* By default keep the original deduced argument pack.
18368 If necessary, more specific code is going to update the
18369 resulting deduced argument later down in this function. */
18370 template_parm_level_and_index (TREE_PURPOSE (pack
), &level
, &idx
);
18371 TMPL_ARG (targs
, level
, idx
) = old_pack
;
18373 /* If NEW_ARGS contains any NULL_TREE entries, we didn't
18374 actually deduce anything. */
18375 for (i
= 0; i
< len
&& !nondeduced_p
; ++i
)
18376 if (TREE_VEC_ELT (new_args
, i
) == NULL_TREE
)
18377 nondeduced_p
= true;
18381 if (old_pack
&& ARGUMENT_PACK_INCOMPLETE_P (old_pack
))
18383 /* If we had fewer function args than explicit template args,
18384 just use the explicits. */
18385 tree explicit_args
= ARGUMENT_PACK_EXPLICIT_ARGS (old_pack
);
18386 int explicit_len
= TREE_VEC_LENGTH (explicit_args
);
18387 if (len
< explicit_len
)
18388 new_args
= explicit_args
;
18394 /* Build the deduced *_ARGUMENT_PACK. */
18395 if (TREE_CODE (TREE_PURPOSE (pack
)) == TEMPLATE_PARM_INDEX
)
18397 result
= make_node (NONTYPE_ARGUMENT_PACK
);
18398 TREE_TYPE (result
) =
18399 TREE_TYPE (TEMPLATE_PARM_DECL (TREE_PURPOSE (pack
)));
18400 TREE_CONSTANT (result
) = 1;
18403 result
= cxx_make_type (TYPE_ARGUMENT_PACK
);
18405 SET_ARGUMENT_PACK_ARGS (result
, new_args
);
18407 /* Note the deduced argument packs for this parameter
18409 TMPL_ARG (targs
, level
, idx
) = result
;
18411 else if (ARGUMENT_PACK_INCOMPLETE_P (old_pack
)
18412 && (ARGUMENT_PACK_ARGS (old_pack
)
18413 == ARGUMENT_PACK_EXPLICIT_ARGS (old_pack
)))
18415 /* We only had the explicitly-provided arguments before, but
18416 now we have a complete set of arguments. */
18417 tree explicit_args
= ARGUMENT_PACK_EXPLICIT_ARGS (old_pack
);
18419 SET_ARGUMENT_PACK_ARGS (old_pack
, new_args
);
18420 ARGUMENT_PACK_INCOMPLETE_P (old_pack
) = 1;
18421 ARGUMENT_PACK_EXPLICIT_ARGS (old_pack
) = explicit_args
;
18425 tree bad_old_arg
= NULL_TREE
, bad_new_arg
= NULL_TREE
;
18426 tree old_args
= ARGUMENT_PACK_ARGS (old_pack
);
18428 if (!comp_template_args_with_info (old_args
, new_args
,
18429 &bad_old_arg
, &bad_new_arg
))
18430 /* Inconsistent unification of this parameter pack. */
18431 return unify_parameter_pack_inconsistent (explain_p
,
18437 return unify_success (explain_p
);
18440 /* Handle unification of the domain of an array. PARM_DOM and ARG_DOM are
18441 INTEGER_TYPEs representing the TYPE_DOMAIN of ARRAY_TYPEs. The other
18442 parameters and return value are as for unify. */
18445 unify_array_domain (tree tparms
, tree targs
,
18446 tree parm_dom
, tree arg_dom
,
18454 /* Our representation of array types uses "N - 1" as the
18455 TYPE_MAX_VALUE for an array with "N" elements, if "N" is
18456 not an integer constant. We cannot unify arbitrarily
18457 complex expressions, so we eliminate the MINUS_EXPRs
18459 parm_max
= TYPE_MAX_VALUE (parm_dom
);
18460 parm_cst
= TREE_CODE (parm_max
) == INTEGER_CST
;
18463 gcc_assert (TREE_CODE (parm_max
) == MINUS_EXPR
);
18464 parm_max
= TREE_OPERAND (parm_max
, 0);
18466 arg_max
= TYPE_MAX_VALUE (arg_dom
);
18467 arg_cst
= TREE_CODE (arg_max
) == INTEGER_CST
;
18470 /* The ARG_MAX may not be a simple MINUS_EXPR, if we are
18471 trying to unify the type of a variable with the type
18472 of a template parameter. For example:
18474 template <unsigned int N>
18475 void f (char (&) [N]);
18482 Here, the type of the ARG will be "int [g(i)]", and
18483 may be a SAVE_EXPR, etc. */
18484 if (TREE_CODE (arg_max
) != MINUS_EXPR
)
18485 return unify_vla_arg (explain_p
, arg_dom
);
18486 arg_max
= TREE_OPERAND (arg_max
, 0);
18489 /* If only one of the bounds used a MINUS_EXPR, compensate
18490 by adding one to the other bound. */
18491 if (parm_cst
&& !arg_cst
)
18492 parm_max
= fold_build2_loc (input_location
, PLUS_EXPR
,
18496 else if (arg_cst
&& !parm_cst
)
18497 arg_max
= fold_build2_loc (input_location
, PLUS_EXPR
,
18502 return unify (tparms
, targs
, parm_max
, arg_max
,
18503 UNIFY_ALLOW_INTEGER
, explain_p
);
18506 /* Deduce the value of template parameters. TPARMS is the (innermost)
18507 set of template parameters to a template. TARGS is the bindings
18508 for those template parameters, as determined thus far; TARGS may
18509 include template arguments for outer levels of template parameters
18510 as well. PARM is a parameter to a template function, or a
18511 subcomponent of that parameter; ARG is the corresponding argument.
18512 This function attempts to match PARM with ARG in a manner
18513 consistent with the existing assignments in TARGS. If more values
18514 are deduced, then TARGS is updated.
18516 Returns 0 if the type deduction succeeds, 1 otherwise. The
18517 parameter STRICT is a bitwise or of the following flags:
18520 Require an exact match between PARM and ARG.
18521 UNIFY_ALLOW_MORE_CV_QUAL:
18522 Allow the deduced ARG to be more cv-qualified (by qualification
18523 conversion) than ARG.
18524 UNIFY_ALLOW_LESS_CV_QUAL:
18525 Allow the deduced ARG to be less cv-qualified than ARG.
18526 UNIFY_ALLOW_DERIVED:
18527 Allow the deduced ARG to be a template base class of ARG,
18528 or a pointer to a template base class of the type pointed to by
18530 UNIFY_ALLOW_INTEGER:
18531 Allow any integral type to be deduced. See the TEMPLATE_PARM_INDEX
18532 case for more information.
18533 UNIFY_ALLOW_OUTER_LEVEL:
18534 This is the outermost level of a deduction. Used to determine validity
18535 of qualification conversions. A valid qualification conversion must
18536 have const qualified pointers leading up to the inner type which
18537 requires additional CV quals, except at the outer level, where const
18538 is not required [conv.qual]. It would be normal to set this flag in
18539 addition to setting UNIFY_ALLOW_MORE_CV_QUAL.
18540 UNIFY_ALLOW_OUTER_MORE_CV_QUAL:
18541 This is the outermost level of a deduction, and PARM can be more CV
18542 qualified at this point.
18543 UNIFY_ALLOW_OUTER_LESS_CV_QUAL:
18544 This is the outermost level of a deduction, and PARM can be less CV
18545 qualified at this point. */
18548 unify (tree tparms
, tree targs
, tree parm
, tree arg
, int strict
,
18554 int strict_in
= strict
;
18556 /* I don't think this will do the right thing with respect to types.
18557 But the only case I've seen it in so far has been array bounds, where
18558 signedness is the only information lost, and I think that will be
18560 while (TREE_CODE (parm
) == NOP_EXPR
)
18561 parm
= TREE_OPERAND (parm
, 0);
18563 if (arg
== error_mark_node
)
18564 return unify_invalid (explain_p
);
18565 if (arg
== unknown_type_node
18566 || arg
== init_list_type_node
)
18567 /* We can't deduce anything from this, but we might get all the
18568 template args from other function args. */
18569 return unify_success (explain_p
);
18571 /* If PARM uses template parameters, then we can't bail out here,
18572 even if ARG == PARM, since we won't record unifications for the
18573 template parameters. We might need them if we're trying to
18574 figure out which of two things is more specialized. */
18575 if (arg
== parm
&& !uses_template_parms (parm
))
18576 return unify_success (explain_p
);
18578 /* Handle init lists early, so the rest of the function can assume
18579 we're dealing with a type. */
18580 if (BRACE_ENCLOSED_INITIALIZER_P (arg
))
18584 tree orig_parm
= parm
;
18586 /* Replace T with std::initializer_list<T> for deduction. */
18587 if (TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
18588 && flag_deduce_init_list
)
18589 parm
= listify (parm
);
18591 if (!is_std_init_list (parm
)
18592 && TREE_CODE (parm
) != ARRAY_TYPE
)
18593 /* We can only deduce from an initializer list argument if the
18594 parameter is std::initializer_list or an array; otherwise this
18595 is a non-deduced context. */
18596 return unify_success (explain_p
);
18598 if (TREE_CODE (parm
) == ARRAY_TYPE
)
18599 elttype
= TREE_TYPE (parm
);
18602 elttype
= TREE_VEC_ELT (CLASSTYPE_TI_ARGS (parm
), 0);
18603 /* Deduction is defined in terms of a single type, so just punt
18604 on the (bizarre) std::initializer_list<T...>. */
18605 if (PACK_EXPANSION_P (elttype
))
18606 return unify_success (explain_p
);
18609 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (arg
), i
, elt
)
18611 int elt_strict
= strict
;
18613 if (elt
== error_mark_node
)
18614 return unify_invalid (explain_p
);
18616 if (!BRACE_ENCLOSED_INITIALIZER_P (elt
))
18618 tree type
= TREE_TYPE (elt
);
18619 if (type
== error_mark_node
)
18620 return unify_invalid (explain_p
);
18621 /* It should only be possible to get here for a call. */
18622 gcc_assert (elt_strict
& UNIFY_ALLOW_OUTER_LEVEL
);
18623 elt_strict
|= maybe_adjust_types_for_deduction
18624 (DEDUCE_CALL
, &elttype
, &type
, elt
);
18628 RECUR_AND_CHECK_FAILURE (tparms
, targs
, elttype
, elt
, elt_strict
,
18632 if (TREE_CODE (parm
) == ARRAY_TYPE
18633 && deducible_array_bound (TYPE_DOMAIN (parm
)))
18635 /* Also deduce from the length of the initializer list. */
18636 tree max
= size_int (CONSTRUCTOR_NELTS (arg
));
18637 tree idx
= compute_array_index_type (NULL_TREE
, max
, tf_none
);
18638 if (idx
== error_mark_node
)
18639 return unify_invalid (explain_p
);
18640 return unify_array_domain (tparms
, targs
, TYPE_DOMAIN (parm
),
18644 /* If the std::initializer_list<T> deduction worked, replace the
18645 deduced A with std::initializer_list<A>. */
18646 if (orig_parm
!= parm
)
18648 idx
= TEMPLATE_TYPE_IDX (orig_parm
);
18649 targ
= TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
);
18650 targ
= listify (targ
);
18651 TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
) = targ
;
18653 return unify_success (explain_p
);
18656 /* Immediately reject some pairs that won't unify because of
18657 cv-qualification mismatches. */
18658 if (TREE_CODE (arg
) == TREE_CODE (parm
)
18660 /* It is the elements of the array which hold the cv quals of an array
18661 type, and the elements might be template type parms. We'll check
18662 when we recurse. */
18663 && TREE_CODE (arg
) != ARRAY_TYPE
18664 /* We check the cv-qualifiers when unifying with template type
18665 parameters below. We want to allow ARG `const T' to unify with
18666 PARM `T' for example, when computing which of two templates
18667 is more specialized, for example. */
18668 && TREE_CODE (arg
) != TEMPLATE_TYPE_PARM
18669 && !check_cv_quals_for_unify (strict_in
, arg
, parm
))
18670 return unify_cv_qual_mismatch (explain_p
, parm
, arg
);
18672 if (!(strict
& UNIFY_ALLOW_OUTER_LEVEL
)
18673 && TYPE_P (parm
) && !CP_TYPE_CONST_P (parm
))
18674 strict
&= ~UNIFY_ALLOW_MORE_CV_QUAL
;
18675 strict
&= ~UNIFY_ALLOW_OUTER_LEVEL
;
18676 strict
&= ~UNIFY_ALLOW_DERIVED
;
18677 strict
&= ~UNIFY_ALLOW_OUTER_MORE_CV_QUAL
;
18678 strict
&= ~UNIFY_ALLOW_OUTER_LESS_CV_QUAL
;
18680 switch (TREE_CODE (parm
))
18682 case TYPENAME_TYPE
:
18684 case UNBOUND_CLASS_TEMPLATE
:
18685 /* In a type which contains a nested-name-specifier, template
18686 argument values cannot be deduced for template parameters used
18687 within the nested-name-specifier. */
18688 return unify_success (explain_p
);
18690 case TEMPLATE_TYPE_PARM
:
18691 case TEMPLATE_TEMPLATE_PARM
:
18692 case BOUND_TEMPLATE_TEMPLATE_PARM
:
18693 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, 0));
18694 if (error_operand_p (tparm
))
18695 return unify_invalid (explain_p
);
18697 if (TEMPLATE_TYPE_LEVEL (parm
)
18698 != template_decl_level (tparm
))
18699 /* The PARM is not one we're trying to unify. Just check
18700 to see if it matches ARG. */
18702 if (TREE_CODE (arg
) == TREE_CODE (parm
)
18703 && (is_auto (parm
) ? is_auto (arg
)
18704 : same_type_p (parm
, arg
)))
18705 return unify_success (explain_p
);
18707 return unify_type_mismatch (explain_p
, parm
, arg
);
18709 idx
= TEMPLATE_TYPE_IDX (parm
);
18710 targ
= TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
);
18711 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, idx
));
18712 if (error_operand_p (tparm
))
18713 return unify_invalid (explain_p
);
18715 /* Check for mixed types and values. */
18716 if ((TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
18717 && TREE_CODE (tparm
) != TYPE_DECL
)
18718 || (TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
18719 && TREE_CODE (tparm
) != TEMPLATE_DECL
))
18720 gcc_unreachable ();
18722 if (TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
18724 /* ARG must be constructed from a template class or a template
18725 template parameter. */
18726 if (TREE_CODE (arg
) != BOUND_TEMPLATE_TEMPLATE_PARM
18727 && !CLASSTYPE_SPECIALIZATION_OF_PRIMARY_TEMPLATE_P (arg
))
18728 return unify_template_deduction_failure (explain_p
, parm
, arg
);
18730 tree parmvec
= TYPE_TI_ARGS (parm
);
18731 /* An alias template name is never deduced. */
18732 if (TYPE_ALIAS_P (arg
))
18733 arg
= strip_typedefs (arg
);
18734 tree argvec
= INNERMOST_TEMPLATE_ARGS (TYPE_TI_ARGS (arg
));
18735 tree full_argvec
= add_to_template_args (targs
, argvec
);
18737 = DECL_INNERMOST_TEMPLATE_PARMS
18738 (TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL (parm
));
18740 int parm_variadic_p
= 0;
18742 /* The resolution to DR150 makes clear that default
18743 arguments for an N-argument may not be used to bind T
18744 to a template template parameter with fewer than N
18745 parameters. It is not safe to permit the binding of
18746 default arguments as an extension, as that may change
18747 the meaning of a conforming program. Consider:
18749 struct Dense { static const unsigned int dim = 1; };
18751 template <template <typename> class View,
18753 void operator+(float, View<Block> const&);
18755 template <typename Block,
18756 unsigned int Dim = Block::dim>
18757 struct Lvalue_proxy { operator float() const; };
18761 Lvalue_proxy<Dense> p;
18766 Here, if Lvalue_proxy is permitted to bind to View, then
18767 the global operator+ will be used; if they are not, the
18768 Lvalue_proxy will be converted to float. */
18769 if (coerce_template_parms (parm_parms
,
18771 TYPE_TI_TEMPLATE (parm
),
18773 ? tf_warning_or_error
18775 /*require_all_args=*/true,
18776 /*use_default_args=*/false)
18777 == error_mark_node
)
18780 /* Deduce arguments T, i from TT<T> or TT<i>.
18781 We check each element of PARMVEC and ARGVEC individually
18782 rather than the whole TREE_VEC since they can have
18783 different number of elements. */
18785 parmvec
= expand_template_argument_pack (parmvec
);
18786 argvec
= expand_template_argument_pack (argvec
);
18788 len
= TREE_VEC_LENGTH (parmvec
);
18790 /* Check if the parameters end in a pack, making them
18793 && PACK_EXPANSION_P (TREE_VEC_ELT (parmvec
, len
- 1)))
18794 parm_variadic_p
= 1;
18796 for (i
= 0; i
< len
- parm_variadic_p
; ++i
)
18797 /* If the template argument list of P contains a pack
18798 expansion that is not the last template argument, the
18799 entire template argument list is a non-deduced
18801 if (PACK_EXPANSION_P (TREE_VEC_ELT (parmvec
, i
)))
18802 return unify_success (explain_p
);
18804 if (TREE_VEC_LENGTH (argvec
) < len
- parm_variadic_p
)
18805 return unify_too_few_arguments (explain_p
,
18806 TREE_VEC_LENGTH (argvec
), len
);
18808 for (i
= 0; i
< len
- parm_variadic_p
; ++i
)
18810 RECUR_AND_CHECK_FAILURE (tparms
, targs
,
18811 TREE_VEC_ELT (parmvec
, i
),
18812 TREE_VEC_ELT (argvec
, i
),
18813 UNIFY_ALLOW_NONE
, explain_p
);
18816 if (parm_variadic_p
18817 && unify_pack_expansion (tparms
, targs
,
18820 /*subr=*/true, explain_p
))
18823 arg
= TYPE_TI_TEMPLATE (arg
);
18825 /* Fall through to deduce template name. */
18828 if (TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
18829 || TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
18831 /* Deduce template name TT from TT, TT<>, TT<T> and TT<i>. */
18833 /* Simple cases: Value already set, does match or doesn't. */
18834 if (targ
!= NULL_TREE
&& template_args_equal (targ
, arg
))
18835 return unify_success (explain_p
);
18837 return unify_inconsistency (explain_p
, parm
, targ
, arg
);
18841 /* If PARM is `const T' and ARG is only `int', we don't have
18842 a match unless we are allowing additional qualification.
18843 If ARG is `const int' and PARM is just `T' that's OK;
18844 that binds `const int' to `T'. */
18845 if (!check_cv_quals_for_unify (strict_in
| UNIFY_ALLOW_LESS_CV_QUAL
,
18847 return unify_cv_qual_mismatch (explain_p
, parm
, arg
);
18849 /* Consider the case where ARG is `const volatile int' and
18850 PARM is `const T'. Then, T should be `volatile int'. */
18851 arg
= cp_build_qualified_type_real
18852 (arg
, cp_type_quals (arg
) & ~cp_type_quals (parm
), tf_none
);
18853 if (arg
== error_mark_node
)
18854 return unify_invalid (explain_p
);
18856 /* Simple cases: Value already set, does match or doesn't. */
18857 if (targ
!= NULL_TREE
&& same_type_p (targ
, arg
))
18858 return unify_success (explain_p
);
18860 return unify_inconsistency (explain_p
, parm
, targ
, arg
);
18862 /* Make sure that ARG is not a variable-sized array. (Note
18863 that were talking about variable-sized arrays (like
18864 `int[n]'), rather than arrays of unknown size (like
18865 `int[]').) We'll get very confused by such a type since
18866 the bound of the array is not constant, and therefore
18867 not mangleable. Besides, such types are not allowed in
18868 ISO C++, so we can do as we please here. We do allow
18869 them for 'auto' deduction, since that isn't ABI-exposed. */
18870 if (!is_auto (parm
) && variably_modified_type_p (arg
, NULL_TREE
))
18871 return unify_vla_arg (explain_p
, arg
);
18873 /* Strip typedefs as in convert_template_argument. */
18874 arg
= canonicalize_type_argument (arg
, tf_none
);
18877 /* If ARG is a parameter pack or an expansion, we cannot unify
18878 against it unless PARM is also a parameter pack. */
18879 if ((template_parameter_pack_p (arg
) || PACK_EXPANSION_P (arg
))
18880 && !template_parameter_pack_p (parm
))
18881 return unify_parameter_pack_mismatch (explain_p
, parm
, arg
);
18883 /* If the argument deduction results is a METHOD_TYPE,
18884 then there is a problem.
18885 METHOD_TYPE doesn't map to any real C++ type the result of
18886 the deduction can not be of that type. */
18887 if (TREE_CODE (arg
) == METHOD_TYPE
)
18888 return unify_method_type_error (explain_p
, arg
);
18890 TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
) = arg
;
18891 return unify_success (explain_p
);
18893 case TEMPLATE_PARM_INDEX
:
18894 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, 0));
18895 if (error_operand_p (tparm
))
18896 return unify_invalid (explain_p
);
18898 if (TEMPLATE_PARM_LEVEL (parm
)
18899 != template_decl_level (tparm
))
18901 /* The PARM is not one we're trying to unify. Just check
18902 to see if it matches ARG. */
18903 int result
= !(TREE_CODE (arg
) == TREE_CODE (parm
)
18904 && cp_tree_equal (parm
, arg
));
18906 unify_expression_unequal (explain_p
, parm
, arg
);
18910 idx
= TEMPLATE_PARM_IDX (parm
);
18911 targ
= TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
);
18915 int x
= !cp_tree_equal (targ
, arg
);
18917 unify_inconsistency (explain_p
, parm
, targ
, arg
);
18921 /* [temp.deduct.type] If, in the declaration of a function template
18922 with a non-type template-parameter, the non-type
18923 template-parameter is used in an expression in the function
18924 parameter-list and, if the corresponding template-argument is
18925 deduced, the template-argument type shall match the type of the
18926 template-parameter exactly, except that a template-argument
18927 deduced from an array bound may be of any integral type.
18928 The non-type parameter might use already deduced type parameters. */
18929 tparm
= tsubst (TREE_TYPE (parm
), targs
, 0, NULL_TREE
);
18930 if (!TREE_TYPE (arg
))
18931 /* Template-parameter dependent expression. Just accept it for now.
18932 It will later be processed in convert_template_argument. */
18934 else if (same_type_p (TREE_TYPE (arg
), tparm
))
18936 else if ((strict
& UNIFY_ALLOW_INTEGER
)
18937 && CP_INTEGRAL_TYPE_P (tparm
))
18938 /* Convert the ARG to the type of PARM; the deduced non-type
18939 template argument must exactly match the types of the
18940 corresponding parameter. */
18941 arg
= fold (build_nop (tparm
, arg
));
18942 else if (uses_template_parms (tparm
))
18943 /* We haven't deduced the type of this parameter yet. Try again
18945 return unify_success (explain_p
);
18947 return unify_type_mismatch (explain_p
, tparm
, TREE_TYPE (arg
));
18949 /* If ARG is a parameter pack or an expansion, we cannot unify
18950 against it unless PARM is also a parameter pack. */
18951 if ((template_parameter_pack_p (arg
) || PACK_EXPANSION_P (arg
))
18952 && !TEMPLATE_PARM_PARAMETER_PACK (parm
))
18953 return unify_parameter_pack_mismatch (explain_p
, parm
, arg
);
18956 bool removed_attr
= false;
18957 arg
= strip_typedefs_expr (arg
, &removed_attr
);
18959 TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
) = arg
;
18960 return unify_success (explain_p
);
18964 /* A pointer-to-member constant can be unified only with
18965 another constant. */
18966 if (TREE_CODE (arg
) != PTRMEM_CST
)
18967 return unify_ptrmem_cst_mismatch (explain_p
, parm
, arg
);
18969 /* Just unify the class member. It would be useless (and possibly
18970 wrong, depending on the strict flags) to unify also
18971 PTRMEM_CST_CLASS, because we want to be sure that both parm and
18972 arg refer to the same variable, even if through different
18973 classes. For instance:
18975 struct A { int x; };
18978 Unification of &A::x and &B::x must succeed. */
18979 return unify (tparms
, targs
, PTRMEM_CST_MEMBER (parm
),
18980 PTRMEM_CST_MEMBER (arg
), strict
, explain_p
);
18985 if (!TYPE_PTR_P (arg
))
18986 return unify_type_mismatch (explain_p
, parm
, arg
);
18988 /* [temp.deduct.call]
18990 A can be another pointer or pointer to member type that can
18991 be converted to the deduced A via a qualification
18992 conversion (_conv.qual_).
18994 We pass down STRICT here rather than UNIFY_ALLOW_NONE.
18995 This will allow for additional cv-qualification of the
18996 pointed-to types if appropriate. */
18998 if (TREE_CODE (TREE_TYPE (arg
)) == RECORD_TYPE
)
18999 /* The derived-to-base conversion only persists through one
19000 level of pointers. */
19001 strict
|= (strict_in
& UNIFY_ALLOW_DERIVED
);
19003 return unify (tparms
, targs
, TREE_TYPE (parm
),
19004 TREE_TYPE (arg
), strict
, explain_p
);
19007 case REFERENCE_TYPE
:
19008 if (TREE_CODE (arg
) != REFERENCE_TYPE
)
19009 return unify_type_mismatch (explain_p
, parm
, arg
);
19010 return unify (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
19011 strict
& UNIFY_ALLOW_MORE_CV_QUAL
, explain_p
);
19014 if (TREE_CODE (arg
) != ARRAY_TYPE
)
19015 return unify_type_mismatch (explain_p
, parm
, arg
);
19016 if ((TYPE_DOMAIN (parm
) == NULL_TREE
)
19017 != (TYPE_DOMAIN (arg
) == NULL_TREE
))
19018 return unify_type_mismatch (explain_p
, parm
, arg
);
19019 RECUR_AND_CHECK_FAILURE (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
19020 strict
& UNIFY_ALLOW_MORE_CV_QUAL
, explain_p
);
19021 if (TYPE_DOMAIN (parm
) != NULL_TREE
)
19022 return unify_array_domain (tparms
, targs
, TYPE_DOMAIN (parm
),
19023 TYPE_DOMAIN (arg
), explain_p
);
19024 return unify_success (explain_p
);
19031 case ENUMERAL_TYPE
:
19034 if (TREE_CODE (arg
) != TREE_CODE (parm
))
19035 return unify_type_mismatch (explain_p
, parm
, arg
);
19037 /* We have already checked cv-qualification at the top of the
19039 if (!same_type_ignoring_top_level_qualifiers_p (arg
, parm
))
19040 return unify_type_mismatch (explain_p
, parm
, arg
);
19042 /* As far as unification is concerned, this wins. Later checks
19043 will invalidate it if necessary. */
19044 return unify_success (explain_p
);
19046 /* Types INTEGER_CST and MINUS_EXPR can come from array bounds. */
19047 /* Type INTEGER_CST can come from ordinary constant template args. */
19049 while (TREE_CODE (arg
) == NOP_EXPR
)
19050 arg
= TREE_OPERAND (arg
, 0);
19052 if (TREE_CODE (arg
) != INTEGER_CST
)
19053 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
19054 return (tree_int_cst_equal (parm
, arg
)
19055 ? unify_success (explain_p
)
19056 : unify_template_argument_mismatch (explain_p
, parm
, arg
));
19060 int i
, len
, argslen
;
19061 int parm_variadic_p
= 0;
19063 if (TREE_CODE (arg
) != TREE_VEC
)
19064 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
19066 len
= TREE_VEC_LENGTH (parm
);
19067 argslen
= TREE_VEC_LENGTH (arg
);
19069 /* Check for pack expansions in the parameters. */
19070 for (i
= 0; i
< len
; ++i
)
19072 if (PACK_EXPANSION_P (TREE_VEC_ELT (parm
, i
)))
19075 /* We can unify against something with a trailing
19077 parm_variadic_p
= 1;
19079 /* [temp.deduct.type]/9: If the template argument list of
19080 P contains a pack expansion that is not the last
19081 template argument, the entire template argument list
19082 is a non-deduced context. */
19083 return unify_success (explain_p
);
19087 /* If we don't have enough arguments to satisfy the parameters
19088 (not counting the pack expression at the end), or we have
19089 too many arguments for a parameter list that doesn't end in
19090 a pack expression, we can't unify. */
19091 if (parm_variadic_p
19092 ? argslen
< len
- parm_variadic_p
19094 return unify_arity (explain_p
, TREE_VEC_LENGTH (arg
), len
);
19096 /* Unify all of the parameters that precede the (optional)
19097 pack expression. */
19098 for (i
= 0; i
< len
- parm_variadic_p
; ++i
)
19100 RECUR_AND_CHECK_FAILURE (tparms
, targs
,
19101 TREE_VEC_ELT (parm
, i
),
19102 TREE_VEC_ELT (arg
, i
),
19103 UNIFY_ALLOW_NONE
, explain_p
);
19105 if (parm_variadic_p
)
19106 return unify_pack_expansion (tparms
, targs
, parm
, arg
,
19108 /*subr=*/true, explain_p
);
19109 return unify_success (explain_p
);
19114 if (TREE_CODE (arg
) != TREE_CODE (parm
))
19115 return unify_type_mismatch (explain_p
, parm
, arg
);
19117 if (TYPE_PTRMEMFUNC_P (parm
))
19119 if (!TYPE_PTRMEMFUNC_P (arg
))
19120 return unify_type_mismatch (explain_p
, parm
, arg
);
19122 return unify (tparms
, targs
,
19123 TYPE_PTRMEMFUNC_FN_TYPE (parm
),
19124 TYPE_PTRMEMFUNC_FN_TYPE (arg
),
19125 strict
, explain_p
);
19127 else if (TYPE_PTRMEMFUNC_P (arg
))
19128 return unify_type_mismatch (explain_p
, parm
, arg
);
19130 if (CLASSTYPE_TEMPLATE_INFO (parm
))
19132 tree t
= NULL_TREE
;
19134 if (strict_in
& UNIFY_ALLOW_DERIVED
)
19136 /* First, we try to unify the PARM and ARG directly. */
19137 t
= try_class_unification (tparms
, targs
,
19138 parm
, arg
, explain_p
);
19142 /* Fallback to the special case allowed in
19143 [temp.deduct.call]:
19145 If P is a class, and P has the form
19146 template-id, then A can be a derived class of
19147 the deduced A. Likewise, if P is a pointer to
19148 a class of the form template-id, A can be a
19149 pointer to a derived class pointed to by the
19151 enum template_base_result r
;
19152 r
= get_template_base (tparms
, targs
, parm
, arg
,
19156 return unify_no_common_base (explain_p
, r
, parm
, arg
);
19159 else if (CLASSTYPE_TEMPLATE_INFO (arg
)
19160 && (CLASSTYPE_TI_TEMPLATE (parm
)
19161 == CLASSTYPE_TI_TEMPLATE (arg
)))
19162 /* Perhaps PARM is something like S<U> and ARG is S<int>.
19163 Then, we should unify `int' and `U'. */
19166 /* There's no chance of unification succeeding. */
19167 return unify_type_mismatch (explain_p
, parm
, arg
);
19169 return unify (tparms
, targs
, CLASSTYPE_TI_ARGS (parm
),
19170 CLASSTYPE_TI_ARGS (t
), UNIFY_ALLOW_NONE
, explain_p
);
19172 else if (!same_type_ignoring_top_level_qualifiers_p (parm
, arg
))
19173 return unify_type_mismatch (explain_p
, parm
, arg
);
19174 return unify_success (explain_p
);
19177 case FUNCTION_TYPE
:
19179 unsigned int nargs
;
19184 if (TREE_CODE (arg
) != TREE_CODE (parm
))
19185 return unify_type_mismatch (explain_p
, parm
, arg
);
19187 /* CV qualifications for methods can never be deduced, they must
19188 match exactly. We need to check them explicitly here,
19189 because type_unification_real treats them as any other
19190 cv-qualified parameter. */
19191 if (TREE_CODE (parm
) == METHOD_TYPE
19192 && (!check_cv_quals_for_unify
19194 class_of_this_parm (arg
),
19195 class_of_this_parm (parm
))))
19196 return unify_cv_qual_mismatch (explain_p
, parm
, arg
);
19198 RECUR_AND_CHECK_FAILURE (tparms
, targs
, TREE_TYPE (parm
),
19199 TREE_TYPE (arg
), UNIFY_ALLOW_NONE
, explain_p
);
19201 nargs
= list_length (TYPE_ARG_TYPES (arg
));
19202 args
= XALLOCAVEC (tree
, nargs
);
19203 for (a
= TYPE_ARG_TYPES (arg
), i
= 0;
19204 a
!= NULL_TREE
&& a
!= void_list_node
;
19205 a
= TREE_CHAIN (a
), ++i
)
19206 args
[i
] = TREE_VALUE (a
);
19209 return type_unification_real (tparms
, targs
, TYPE_ARG_TYPES (parm
),
19210 args
, nargs
, 1, DEDUCE_EXACT
,
19211 LOOKUP_NORMAL
, NULL
, explain_p
);
19215 /* Unify a pointer to member with a pointer to member function, which
19216 deduces the type of the member as a function type. */
19217 if (TYPE_PTRMEMFUNC_P (arg
))
19219 /* Check top-level cv qualifiers */
19220 if (!check_cv_quals_for_unify (UNIFY_ALLOW_NONE
, arg
, parm
))
19221 return unify_cv_qual_mismatch (explain_p
, parm
, arg
);
19223 RECUR_AND_CHECK_FAILURE (tparms
, targs
, TYPE_OFFSET_BASETYPE (parm
),
19224 TYPE_PTRMEMFUNC_OBJECT_TYPE (arg
),
19225 UNIFY_ALLOW_NONE
, explain_p
);
19227 /* Determine the type of the function we are unifying against. */
19228 tree fntype
= static_fn_type (arg
);
19230 return unify (tparms
, targs
, TREE_TYPE (parm
), fntype
, strict
, explain_p
);
19233 if (TREE_CODE (arg
) != OFFSET_TYPE
)
19234 return unify_type_mismatch (explain_p
, parm
, arg
);
19235 RECUR_AND_CHECK_FAILURE (tparms
, targs
, TYPE_OFFSET_BASETYPE (parm
),
19236 TYPE_OFFSET_BASETYPE (arg
),
19237 UNIFY_ALLOW_NONE
, explain_p
);
19238 return unify (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
19239 strict
, explain_p
);
19242 if (DECL_TEMPLATE_PARM_P (parm
))
19243 return unify (tparms
, targs
, DECL_INITIAL (parm
), arg
, strict
, explain_p
);
19244 if (arg
!= scalar_constant_value (parm
))
19245 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
19246 return unify_success (explain_p
);
19249 case TEMPLATE_DECL
:
19250 /* Matched cases are handled by the ARG == PARM test above. */
19251 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
19254 /* A non-type template parameter that is a variable should be a
19255 an integral constant, in which case, it whould have been
19256 folded into its (constant) value. So we should not be getting
19257 a variable here. */
19258 gcc_unreachable ();
19260 case TYPE_ARGUMENT_PACK
:
19261 case NONTYPE_ARGUMENT_PACK
:
19262 return unify (tparms
, targs
, ARGUMENT_PACK_ARGS (parm
),
19263 ARGUMENT_PACK_ARGS (arg
), strict
, explain_p
);
19266 case DECLTYPE_TYPE
:
19267 case UNDERLYING_TYPE
:
19268 /* Cannot deduce anything from TYPEOF_TYPE, DECLTYPE_TYPE,
19269 or UNDERLYING_TYPE nodes. */
19270 return unify_success (explain_p
);
19273 /* Unification fails if we hit an error node. */
19274 return unify_invalid (explain_p
);
19277 if (REFERENCE_REF_P (parm
))
19279 if (REFERENCE_REF_P (arg
))
19280 arg
= TREE_OPERAND (arg
, 0);
19281 return unify (tparms
, targs
, TREE_OPERAND (parm
, 0), arg
,
19282 strict
, explain_p
);
19287 /* An unresolved overload is a nondeduced context. */
19288 if (is_overloaded_fn (parm
) || type_unknown_p (parm
))
19289 return unify_success (explain_p
);
19290 gcc_assert (EXPR_P (parm
));
19292 /* We must be looking at an expression. This can happen with
19296 void foo(S<I>, S<I + 2>);
19298 This is a "nondeduced context":
19302 The nondeduced contexts are:
19304 --A type that is a template-id in which one or more of
19305 the template-arguments is an expression that references
19306 a template-parameter.
19308 In these cases, we assume deduction succeeded, but don't
19309 actually infer any unifications. */
19311 if (!uses_template_parms (parm
)
19312 && !template_args_equal (parm
, arg
))
19313 return unify_expression_unequal (explain_p
, parm
, arg
);
19315 return unify_success (explain_p
);
19318 #undef RECUR_AND_CHECK_FAILURE
19320 /* Note that DECL can be defined in this translation unit, if
19324 mark_definable (tree decl
)
19327 DECL_NOT_REALLY_EXTERN (decl
) = 1;
19328 FOR_EACH_CLONE (clone
, decl
)
19329 DECL_NOT_REALLY_EXTERN (clone
) = 1;
19332 /* Called if RESULT is explicitly instantiated, or is a member of an
19333 explicitly instantiated class. */
19336 mark_decl_instantiated (tree result
, int extern_p
)
19338 SET_DECL_EXPLICIT_INSTANTIATION (result
);
19340 /* If this entity has already been written out, it's too late to
19341 make any modifications. */
19342 if (TREE_ASM_WRITTEN (result
))
19345 /* For anonymous namespace we don't need to do anything. */
19346 if (decl_anon_ns_mem_p (result
))
19348 gcc_assert (!TREE_PUBLIC (result
));
19352 if (TREE_CODE (result
) != FUNCTION_DECL
)
19353 /* The TREE_PUBLIC flag for function declarations will have been
19354 set correctly by tsubst. */
19355 TREE_PUBLIC (result
) = 1;
19357 /* This might have been set by an earlier implicit instantiation. */
19358 DECL_COMDAT (result
) = 0;
19361 DECL_NOT_REALLY_EXTERN (result
) = 0;
19364 mark_definable (result
);
19365 mark_needed (result
);
19366 /* Always make artificials weak. */
19367 if (DECL_ARTIFICIAL (result
) && flag_weak
)
19368 comdat_linkage (result
);
19369 /* For WIN32 we also want to put explicit instantiations in
19370 linkonce sections. */
19371 else if (TREE_PUBLIC (result
))
19372 maybe_make_one_only (result
);
19375 /* If EXTERN_P, then this function will not be emitted -- unless
19376 followed by an explicit instantiation, at which point its linkage
19377 will be adjusted. If !EXTERN_P, then this function will be
19378 emitted here. In neither circumstance do we want
19379 import_export_decl to adjust the linkage. */
19380 DECL_INTERFACE_KNOWN (result
) = 1;
19383 /* Subroutine of more_specialized_fn: check whether TARGS is missing any
19384 important template arguments. If any are missing, we check whether
19385 they're important by using error_mark_node for substituting into any
19386 args that were used for partial ordering (the ones between ARGS and END)
19387 and seeing if it bubbles up. */
19390 check_undeduced_parms (tree targs
, tree args
, tree end
)
19392 bool found
= false;
19394 for (i
= TREE_VEC_LENGTH (targs
) - 1; i
>= 0; --i
)
19395 if (TREE_VEC_ELT (targs
, i
) == NULL_TREE
)
19398 TREE_VEC_ELT (targs
, i
) = error_mark_node
;
19402 tree substed
= tsubst_arg_types (args
, targs
, end
, tf_none
, NULL_TREE
);
19403 if (substed
== error_mark_node
)
19409 /* Given two function templates PAT1 and PAT2, return:
19411 1 if PAT1 is more specialized than PAT2 as described in [temp.func.order].
19412 -1 if PAT2 is more specialized than PAT1.
19413 0 if neither is more specialized.
19415 LEN indicates the number of parameters we should consider
19416 (defaulted parameters should not be considered).
19418 The 1998 std underspecified function template partial ordering, and
19419 DR214 addresses the issue. We take pairs of arguments, one from
19420 each of the templates, and deduce them against each other. One of
19421 the templates will be more specialized if all the *other*
19422 template's arguments deduce against its arguments and at least one
19423 of its arguments *does* *not* deduce against the other template's
19424 corresponding argument. Deduction is done as for class templates.
19425 The arguments used in deduction have reference and top level cv
19426 qualifiers removed. Iff both arguments were originally reference
19427 types *and* deduction succeeds in both directions, an lvalue reference
19428 wins against an rvalue reference and otherwise the template
19429 with the more cv-qualified argument wins for that pairing (if
19430 neither is more cv-qualified, they both are equal). Unlike regular
19431 deduction, after all the arguments have been deduced in this way,
19432 we do *not* verify the deduced template argument values can be
19433 substituted into non-deduced contexts.
19435 The logic can be a bit confusing here, because we look at deduce1 and
19436 targs1 to see if pat2 is at least as specialized, and vice versa; if we
19437 can find template arguments for pat1 to make arg1 look like arg2, that
19438 means that arg2 is at least as specialized as arg1. */
19441 more_specialized_fn (tree pat1
, tree pat2
, int len
)
19443 tree decl1
= DECL_TEMPLATE_RESULT (pat1
);
19444 tree decl2
= DECL_TEMPLATE_RESULT (pat2
);
19445 tree targs1
= make_tree_vec (DECL_NTPARMS (pat1
));
19446 tree targs2
= make_tree_vec (DECL_NTPARMS (pat2
));
19447 tree tparms1
= DECL_INNERMOST_TEMPLATE_PARMS (pat1
);
19448 tree tparms2
= DECL_INNERMOST_TEMPLATE_PARMS (pat2
);
19449 tree args1
= TYPE_ARG_TYPES (TREE_TYPE (decl1
));
19450 tree args2
= TYPE_ARG_TYPES (TREE_TYPE (decl2
));
19451 tree origs1
, origs2
;
19452 bool lose1
= false;
19453 bool lose2
= false;
19455 /* Remove the this parameter from non-static member functions. If
19456 one is a non-static member function and the other is not a static
19457 member function, remove the first parameter from that function
19458 also. This situation occurs for operator functions where we
19459 locate both a member function (with this pointer) and non-member
19460 operator (with explicit first operand). */
19461 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl1
))
19463 len
--; /* LEN is the number of significant arguments for DECL1 */
19464 args1
= TREE_CHAIN (args1
);
19465 if (!DECL_STATIC_FUNCTION_P (decl2
))
19466 args2
= TREE_CHAIN (args2
);
19468 else if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl2
))
19470 args2
= TREE_CHAIN (args2
);
19471 if (!DECL_STATIC_FUNCTION_P (decl1
))
19474 args1
= TREE_CHAIN (args1
);
19478 /* If only one is a conversion operator, they are unordered. */
19479 if (DECL_CONV_FN_P (decl1
) != DECL_CONV_FN_P (decl2
))
19482 /* Consider the return type for a conversion function */
19483 if (DECL_CONV_FN_P (decl1
))
19485 args1
= tree_cons (NULL_TREE
, TREE_TYPE (TREE_TYPE (decl1
)), args1
);
19486 args2
= tree_cons (NULL_TREE
, TREE_TYPE (TREE_TYPE (decl2
)), args2
);
19490 processing_template_decl
++;
19496 /* Stop when an ellipsis is seen. */
19497 && args1
!= NULL_TREE
&& args2
!= NULL_TREE
)
19499 tree arg1
= TREE_VALUE (args1
);
19500 tree arg2
= TREE_VALUE (args2
);
19501 int deduce1
, deduce2
;
19507 if (TREE_CODE (arg1
) == TYPE_PACK_EXPANSION
19508 && TREE_CODE (arg2
) == TYPE_PACK_EXPANSION
)
19510 /* When both arguments are pack expansions, we need only
19511 unify the patterns themselves. */
19512 arg1
= PACK_EXPANSION_PATTERN (arg1
);
19513 arg2
= PACK_EXPANSION_PATTERN (arg2
);
19515 /* This is the last comparison we need to do. */
19519 if (TREE_CODE (arg1
) == REFERENCE_TYPE
)
19521 ref1
= TYPE_REF_IS_RVALUE (arg1
) + 1;
19522 arg1
= TREE_TYPE (arg1
);
19523 quals1
= cp_type_quals (arg1
);
19526 if (TREE_CODE (arg2
) == REFERENCE_TYPE
)
19528 ref2
= TYPE_REF_IS_RVALUE (arg2
) + 1;
19529 arg2
= TREE_TYPE (arg2
);
19530 quals2
= cp_type_quals (arg2
);
19533 arg1
= TYPE_MAIN_VARIANT (arg1
);
19534 arg2
= TYPE_MAIN_VARIANT (arg2
);
19536 if (TREE_CODE (arg1
) == TYPE_PACK_EXPANSION
)
19538 int i
, len2
= list_length (args2
);
19539 tree parmvec
= make_tree_vec (1);
19540 tree argvec
= make_tree_vec (len2
);
19543 /* Setup the parameter vector, which contains only ARG1. */
19544 TREE_VEC_ELT (parmvec
, 0) = arg1
;
19546 /* Setup the argument vector, which contains the remaining
19548 for (i
= 0; i
< len2
; i
++, ta
= TREE_CHAIN (ta
))
19549 TREE_VEC_ELT (argvec
, i
) = TREE_VALUE (ta
);
19551 deduce1
= (unify_pack_expansion (tparms1
, targs1
, parmvec
,
19552 argvec
, DEDUCE_EXACT
,
19553 /*subr=*/true, /*explain_p=*/false)
19556 /* We cannot deduce in the other direction, because ARG1 is
19557 a pack expansion but ARG2 is not. */
19560 else if (TREE_CODE (arg2
) == TYPE_PACK_EXPANSION
)
19562 int i
, len1
= list_length (args1
);
19563 tree parmvec
= make_tree_vec (1);
19564 tree argvec
= make_tree_vec (len1
);
19567 /* Setup the parameter vector, which contains only ARG1. */
19568 TREE_VEC_ELT (parmvec
, 0) = arg2
;
19570 /* Setup the argument vector, which contains the remaining
19572 for (i
= 0; i
< len1
; i
++, ta
= TREE_CHAIN (ta
))
19573 TREE_VEC_ELT (argvec
, i
) = TREE_VALUE (ta
);
19575 deduce2
= (unify_pack_expansion (tparms2
, targs2
, parmvec
,
19576 argvec
, DEDUCE_EXACT
,
19577 /*subr=*/true, /*explain_p=*/false)
19580 /* We cannot deduce in the other direction, because ARG2 is
19581 a pack expansion but ARG1 is not.*/
19587 /* The normal case, where neither argument is a pack
19589 deduce1
= (unify (tparms1
, targs1
, arg1
, arg2
,
19590 UNIFY_ALLOW_NONE
, /*explain_p=*/false)
19592 deduce2
= (unify (tparms2
, targs2
, arg2
, arg1
,
19593 UNIFY_ALLOW_NONE
, /*explain_p=*/false)
19597 /* If we couldn't deduce arguments for tparms1 to make arg1 match
19598 arg2, then arg2 is not as specialized as arg1. */
19604 /* "If, for a given type, deduction succeeds in both directions
19605 (i.e., the types are identical after the transformations above)
19606 and both P and A were reference types (before being replaced with
19607 the type referred to above):
19608 - if the type from the argument template was an lvalue reference and
19609 the type from the parameter template was not, the argument type is
19610 considered to be more specialized than the other; otherwise,
19611 - if the type from the argument template is more cv-qualified
19612 than the type from the parameter template (as described above),
19613 the argument type is considered to be more specialized than the other;
19615 - neither type is more specialized than the other." */
19617 if (deduce1
&& deduce2
)
19619 if (ref1
&& ref2
&& ref1
!= ref2
)
19626 else if (quals1
!= quals2
&& quals1
>= 0 && quals2
>= 0)
19628 if ((quals1
& quals2
) == quals2
)
19630 if ((quals1
& quals2
) == quals1
)
19635 if (lose1
&& lose2
)
19636 /* We've failed to deduce something in either direction.
19637 These must be unordered. */
19640 if (TREE_CODE (arg1
) == TYPE_PACK_EXPANSION
19641 || TREE_CODE (arg2
) == TYPE_PACK_EXPANSION
)
19642 /* We have already processed all of the arguments in our
19643 handing of the pack expansion type. */
19646 args1
= TREE_CHAIN (args1
);
19647 args2
= TREE_CHAIN (args2
);
19650 /* "In most cases, all template parameters must have values in order for
19651 deduction to succeed, but for partial ordering purposes a template
19652 parameter may remain without a value provided it is not used in the
19653 types being used for partial ordering."
19655 Thus, if we are missing any of the targs1 we need to substitute into
19656 origs1, then pat2 is not as specialized as pat1. This can happen when
19657 there is a nondeduced context. */
19658 if (!lose2
&& check_undeduced_parms (targs1
, origs1
, args1
))
19660 if (!lose1
&& check_undeduced_parms (targs2
, origs2
, args2
))
19663 processing_template_decl
--;
19665 /* If both deductions succeed, the partial ordering selects the more
19666 constrained template. */
19667 if (!lose1
&& !lose2
)
19669 tree c1
= get_constraints (DECL_TEMPLATE_RESULT (pat1
));
19670 tree c2
= get_constraints (DECL_TEMPLATE_RESULT (pat2
));
19671 lose1
= !subsumes_constraints (c1
, c2
);
19672 lose2
= !subsumes_constraints (c2
, c1
);
19675 /* All things being equal, if the next argument is a pack expansion
19676 for one function but not for the other, prefer the
19677 non-variadic function. FIXME this is bogus; see c++/41958. */
19679 && args1
&& TREE_VALUE (args1
)
19680 && args2
&& TREE_VALUE (args2
))
19682 lose1
= TREE_CODE (TREE_VALUE (args1
)) == TYPE_PACK_EXPANSION
;
19683 lose2
= TREE_CODE (TREE_VALUE (args2
)) == TYPE_PACK_EXPANSION
;
19686 if (lose1
== lose2
)
19694 /* Determine which of two partial specializations of TMPL is more
19697 PAT1 is a TREE_LIST whose TREE_VALUE is the TEMPLATE_DECL corresponding
19698 to the first partial specialization. The TREE_PURPOSE is the
19699 innermost set of template parameters for the partial
19700 specialization. PAT2 is similar, but for the second template.
19702 Return 1 if the first partial specialization is more specialized;
19703 -1 if the second is more specialized; 0 if neither is more
19706 See [temp.class.order] for information about determining which of
19707 two templates is more specialized. */
19710 more_specialized_partial_spec (tree tmpl
, tree pat1
, tree pat2
)
19714 bool any_deductions
= false;
19716 tree tmpl1
= TREE_VALUE (pat1
);
19717 tree tmpl2
= TREE_VALUE (pat2
);
19718 tree parms1
= DECL_INNERMOST_TEMPLATE_PARMS (tmpl1
);
19719 tree parms2
= DECL_INNERMOST_TEMPLATE_PARMS (tmpl2
);
19720 tree specargs1
= TI_ARGS (get_template_info (DECL_TEMPLATE_RESULT (tmpl1
)));
19721 tree specargs2
= TI_ARGS (get_template_info (DECL_TEMPLATE_RESULT (tmpl2
)));
19723 /* Just like what happens for functions, if we are ordering between
19724 different template specializations, we may encounter dependent
19725 types in the arguments, and we need our dependency check functions
19726 to behave correctly. */
19727 ++processing_template_decl
;
19728 targs
= get_partial_spec_bindings (tmpl
, parms1
, specargs1
, specargs2
);
19732 any_deductions
= true;
19735 targs
= get_partial_spec_bindings (tmpl
, parms2
, specargs2
, specargs1
);
19739 any_deductions
= true;
19741 --processing_template_decl
;
19743 /* If both deductions succeed, the partial ordering selects the more
19744 constrained template. */
19745 if (!winner
&& any_deductions
)
19746 return more_constrained (tmpl1
, tmpl2
);
19748 /* In the case of a tie where at least one of the templates
19749 has a parameter pack at the end, the template with the most
19750 non-packed parameters wins. */
19753 && (template_args_variadic_p (TREE_PURPOSE (pat1
))
19754 || template_args_variadic_p (TREE_PURPOSE (pat2
))))
19756 tree args1
= INNERMOST_TEMPLATE_ARGS (TREE_PURPOSE (pat1
));
19757 tree args2
= INNERMOST_TEMPLATE_ARGS (TREE_PURPOSE (pat2
));
19758 int len1
= TREE_VEC_LENGTH (args1
);
19759 int len2
= TREE_VEC_LENGTH (args2
);
19761 /* We don't count the pack expansion at the end. */
19762 if (template_args_variadic_p (TREE_PURPOSE (pat1
)))
19764 if (template_args_variadic_p (TREE_PURPOSE (pat2
)))
19769 else if (len1
< len2
)
19776 /* Return the template arguments that will produce the function signature
19777 DECL from the function template FN, with the explicit template
19778 arguments EXPLICIT_ARGS. If CHECK_RETTYPE is true, the return type must
19779 also match. Return NULL_TREE if no satisfactory arguments could be
19783 get_bindings (tree fn
, tree decl
, tree explicit_args
, bool check_rettype
)
19785 int ntparms
= DECL_NTPARMS (fn
);
19786 tree targs
= make_tree_vec (ntparms
);
19787 tree decl_type
= TREE_TYPE (decl
);
19788 tree decl_arg_types
;
19790 unsigned int nargs
, ix
;
19793 gcc_assert (decl
!= DECL_TEMPLATE_RESULT (fn
));
19795 /* Never do unification on the 'this' parameter. */
19796 decl_arg_types
= skip_artificial_parms_for (decl
,
19797 TYPE_ARG_TYPES (decl_type
));
19799 nargs
= list_length (decl_arg_types
);
19800 args
= XALLOCAVEC (tree
, nargs
);
19801 for (arg
= decl_arg_types
, ix
= 0;
19802 arg
!= NULL_TREE
&& arg
!= void_list_node
;
19803 arg
= TREE_CHAIN (arg
), ++ix
)
19804 args
[ix
] = TREE_VALUE (arg
);
19806 if (fn_type_unification (fn
, explicit_args
, targs
,
19808 (check_rettype
|| DECL_CONV_FN_P (fn
)
19809 ? TREE_TYPE (decl_type
) : NULL_TREE
),
19810 DEDUCE_EXACT
, LOOKUP_NORMAL
, /*explain_p=*/false,
19812 == error_mark_node
)
19818 /* Return the innermost template arguments that, when applied to a partial
19819 specialization of TMPL whose innermost template parameters are
19820 TPARMS, and whose specialization arguments are SPEC_ARGS, yield the
19823 For example, suppose we have:
19825 template <class T, class U> struct S {};
19826 template <class T> struct S<T*, int> {};
19828 Then, suppose we want to get `S<double*, int>'. The TPARMS will be
19829 {T}, the SPEC_ARGS will be {T*, int} and the ARGS will be {double*,
19830 int}. The resulting vector will be {double}, indicating that `T'
19831 is bound to `double'. */
19834 get_partial_spec_bindings (tree tmpl
, tree tparms
, tree spec_args
, tree args
)
19836 int i
, ntparms
= TREE_VEC_LENGTH (tparms
);
19838 tree innermost_deduced_args
;
19840 innermost_deduced_args
= make_tree_vec (ntparms
);
19841 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (args
))
19843 deduced_args
= copy_node (args
);
19844 SET_TMPL_ARGS_LEVEL (deduced_args
,
19845 TMPL_ARGS_DEPTH (deduced_args
),
19846 innermost_deduced_args
);
19849 deduced_args
= innermost_deduced_args
;
19851 if (unify (tparms
, deduced_args
,
19852 INNERMOST_TEMPLATE_ARGS (spec_args
),
19853 INNERMOST_TEMPLATE_ARGS (args
),
19854 UNIFY_ALLOW_NONE
, /*explain_p=*/false))
19857 for (i
= 0; i
< ntparms
; ++i
)
19858 if (! TREE_VEC_ELT (innermost_deduced_args
, i
))
19861 /* Verify that nondeduced template arguments agree with the type
19862 obtained from argument deduction.
19866 struct A { typedef int X; };
19867 template <class T, class U> struct C {};
19868 template <class T> struct C<T, typename T::X> {};
19870 Then with the instantiation `C<A, int>', we can deduce that
19871 `T' is `A' but unify () does not check whether `typename T::X'
19873 spec_args
= tsubst (spec_args
, deduced_args
, tf_none
, NULL_TREE
);
19874 spec_args
= coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (tmpl
),
19876 tf_none
, false, false);
19877 if (spec_args
== error_mark_node
19878 /* We only need to check the innermost arguments; the other
19879 arguments will always agree. */
19880 || !comp_template_args (INNERMOST_TEMPLATE_ARGS (spec_args
),
19881 INNERMOST_TEMPLATE_ARGS (args
)))
19884 /* Now that we have bindings for all of the template arguments,
19885 ensure that the arguments deduced for the template template
19886 parameters have compatible template parameter lists. See the use
19887 of template_template_parm_bindings_ok_p in fn_type_unification
19888 for more information. */
19889 if (!template_template_parm_bindings_ok_p (tparms
, deduced_args
))
19892 return deduced_args
;
19895 // Compare two function templates T1 and T2 by deducing bindings
19896 // from one against the other. If both deductions succeed, compare
19897 // constraints to see which is more constrained.
19899 more_specialized_inst (tree t1
, tree t2
)
19904 if (get_bindings (t1
, DECL_TEMPLATE_RESULT (t2
), NULL_TREE
, true))
19910 if (get_bindings (t2
, DECL_TEMPLATE_RESULT (t1
), NULL_TREE
, true))
19916 // If both deductions succeed, then one may be more constrained.
19917 if (count
== 2 && fate
== 0)
19918 fate
= more_constrained (t1
, t2
);
19923 /* TEMPLATES is a TREE_LIST. Each TREE_VALUE is a TEMPLATE_DECL.
19924 Return the TREE_LIST node with the most specialized template, if
19925 any. If there is no most specialized template, the error_mark_node
19928 Note that this function does not look at, or modify, the
19929 TREE_PURPOSE or TREE_TYPE of any of the nodes. Since the node
19930 returned is one of the elements of INSTANTIATIONS, callers may
19931 store information in the TREE_PURPOSE or TREE_TYPE of the nodes,
19932 and retrieve it from the value returned. */
19935 most_specialized_instantiation (tree templates
)
19939 ++processing_template_decl
;
19942 for (fn
= TREE_CHAIN (templates
); fn
; fn
= TREE_CHAIN (fn
))
19944 int fate
= more_specialized_inst (TREE_VALUE (champ
), TREE_VALUE (fn
));
19949 /* Equally specialized, move to next function. If there
19950 is no next function, nothing's most specialized. */
19951 fn
= TREE_CHAIN (fn
);
19959 /* Now verify that champ is better than everything earlier in the
19960 instantiation list. */
19961 for (fn
= templates
; fn
!= champ
; fn
= TREE_CHAIN (fn
)) {
19962 if (more_specialized_inst (TREE_VALUE (champ
), TREE_VALUE (fn
)) != 1)
19969 processing_template_decl
--;
19972 return error_mark_node
;
19977 /* If DECL is a specialization of some template, return the most
19978 general such template. Otherwise, returns NULL_TREE.
19980 For example, given:
19982 template <class T> struct S { template <class U> void f(U); };
19984 if TMPL is `template <class U> void S<int>::f(U)' this will return
19985 the full template. This function will not trace past partial
19986 specializations, however. For example, given in addition:
19988 template <class T> struct S<T*> { template <class U> void f(U); };
19990 if TMPL is `template <class U> void S<int*>::f(U)' this will return
19991 `template <class T> template <class U> S<T*>::f(U)'. */
19994 most_general_template (tree decl
)
19996 if (TREE_CODE (decl
) != TEMPLATE_DECL
)
19998 if (tree tinfo
= get_template_info (decl
))
19999 decl
= TI_TEMPLATE (tinfo
);
20000 /* The TI_TEMPLATE can be an IDENTIFIER_NODE for a
20001 template friend, or a FIELD_DECL for a capture pack. */
20002 if (TREE_CODE (decl
) != TEMPLATE_DECL
)
20006 /* Look for more and more general templates. */
20007 while (DECL_LANG_SPECIFIC (decl
) && DECL_TEMPLATE_INFO (decl
))
20009 /* The DECL_TI_TEMPLATE can be an IDENTIFIER_NODE in some cases.
20010 (See cp-tree.h for details.) */
20011 if (TREE_CODE (DECL_TI_TEMPLATE (decl
)) != TEMPLATE_DECL
)
20014 if (CLASS_TYPE_P (TREE_TYPE (decl
))
20015 && !TYPE_DECL_ALIAS_P (TYPE_NAME (TREE_TYPE (decl
)))
20016 && CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_TYPE (decl
)))
20019 /* Stop if we run into an explicitly specialized class template. */
20020 if (!DECL_NAMESPACE_SCOPE_P (decl
)
20021 && DECL_CONTEXT (decl
)
20022 && CLASSTYPE_TEMPLATE_SPECIALIZATION (DECL_CONTEXT (decl
)))
20025 decl
= DECL_TI_TEMPLATE (decl
);
20031 /* Return the most specialized of the template partial specializations
20032 which can produce TARGET, a specialization of some class or variable
20033 template. The value returned is actually a TREE_LIST; the TREE_VALUE is
20034 a TEMPLATE_DECL node corresponding to the partial specialization, while
20035 the TREE_PURPOSE is the set of template arguments that must be
20036 substituted into the template pattern in order to generate TARGET.
20038 If the choice of partial specialization is ambiguous, a diagnostic
20039 is issued, and the error_mark_node is returned. If there are no
20040 partial specializations matching TARGET, then NULL_TREE is
20041 returned, indicating that the primary template should be used. */
20044 most_specialized_partial_spec (tree target
, tsubst_flags_t complain
)
20046 tree list
= NULL_TREE
;
20051 tree outer_args
= NULL_TREE
;
20054 if (TYPE_P (target
))
20056 tree tinfo
= CLASSTYPE_TEMPLATE_INFO (target
);
20057 tmpl
= TI_TEMPLATE (tinfo
);
20058 args
= TI_ARGS (tinfo
);
20060 else if (TREE_CODE (target
) == TEMPLATE_ID_EXPR
)
20062 tmpl
= TREE_OPERAND (target
, 0);
20063 args
= TREE_OPERAND (target
, 1);
20065 else if (VAR_P (target
))
20067 tree tinfo
= DECL_TEMPLATE_INFO (target
);
20068 tmpl
= TI_TEMPLATE (tinfo
);
20069 args
= TI_ARGS (tinfo
);
20072 gcc_unreachable ();
20074 tree main_tmpl
= most_general_template (tmpl
);
20076 /* For determining which partial specialization to use, only the
20077 innermost args are interesting. */
20078 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (args
))
20080 outer_args
= strip_innermost_template_args (args
, 1);
20081 args
= INNERMOST_TEMPLATE_ARGS (args
);
20084 for (t
= DECL_TEMPLATE_SPECIALIZATIONS (main_tmpl
); t
; t
= TREE_CHAIN (t
))
20086 tree partial_spec_args
;
20088 tree spec_tmpl
= TREE_VALUE (t
);
20090 partial_spec_args
= TREE_PURPOSE (t
);
20092 ++processing_template_decl
;
20096 /* Discard the outer levels of args, and then substitute in the
20097 template args from the enclosing class. */
20098 partial_spec_args
= INNERMOST_TEMPLATE_ARGS (partial_spec_args
);
20099 partial_spec_args
= tsubst_template_args
20100 (partial_spec_args
, outer_args
, tf_none
, NULL_TREE
);
20102 /* And the same for the partial specialization TEMPLATE_DECL. */
20103 spec_tmpl
= tsubst (spec_tmpl
, outer_args
, tf_none
, NULL_TREE
);
20106 partial_spec_args
=
20107 coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (tmpl
),
20110 /*require_all_args=*/true,
20111 /*use_default_args=*/true);
20113 --processing_template_decl
;
20115 if (partial_spec_args
== error_mark_node
)
20116 return error_mark_node
;
20117 if (spec_tmpl
== error_mark_node
)
20118 return error_mark_node
;
20120 tree parms
= DECL_INNERMOST_TEMPLATE_PARMS (spec_tmpl
);
20121 spec_args
= get_partial_spec_bindings (tmpl
, parms
,
20127 spec_args
= add_to_template_args (outer_args
, spec_args
);
20129 /* Keep the candidate only if the constraints are satisfied,
20130 or if we're not compiling with concepts. */
20132 || constraints_satisfied_p (spec_tmpl
, spec_args
))
20134 list
= tree_cons (spec_args
, TREE_VALUE (t
), list
);
20135 TREE_TYPE (list
) = TREE_TYPE (t
);
20143 ambiguous_p
= false;
20146 t
= TREE_CHAIN (t
);
20147 for (; t
; t
= TREE_CHAIN (t
))
20149 fate
= more_specialized_partial_spec (tmpl
, champ
, t
);
20156 t
= TREE_CHAIN (t
);
20159 ambiguous_p
= true;
20168 for (t
= list
; t
&& t
!= champ
; t
= TREE_CHAIN (t
))
20170 fate
= more_specialized_partial_spec (tmpl
, champ
, t
);
20173 ambiguous_p
= true;
20181 char *spaces
= NULL
;
20182 if (!(complain
& tf_error
))
20183 return error_mark_node
;
20184 if (TYPE_P (target
))
20185 error ("ambiguous template instantiation for %q#T", target
);
20187 error ("ambiguous template instantiation for %q#D", target
);
20188 str
= ngettext ("candidate is:", "candidates are:", list_length (list
));
20189 for (t
= list
; t
; t
= TREE_CHAIN (t
))
20191 tree subst
= build_tree_list (TREE_VALUE (t
), TREE_PURPOSE (t
));
20192 inform (DECL_SOURCE_LOCATION (TREE_VALUE (t
)),
20193 "%s %#S", spaces
? spaces
: str
, subst
);
20194 spaces
= spaces
? spaces
: get_spaces (str
);
20197 return error_mark_node
;
20203 /* Explicitly instantiate DECL. */
20206 do_decl_instantiation (tree decl
, tree storage
)
20208 tree result
= NULL_TREE
;
20211 if (!decl
|| decl
== error_mark_node
)
20212 /* An error occurred, for which grokdeclarator has already issued
20213 an appropriate message. */
20215 else if (! DECL_LANG_SPECIFIC (decl
))
20217 error ("explicit instantiation of non-template %q#D", decl
);
20221 bool var_templ
= (DECL_TEMPLATE_INFO (decl
)
20222 && variable_template_p (DECL_TI_TEMPLATE (decl
)));
20224 if (VAR_P (decl
) && !var_templ
)
20226 /* There is an asymmetry here in the way VAR_DECLs and
20227 FUNCTION_DECLs are handled by grokdeclarator. In the case of
20228 the latter, the DECL we get back will be marked as a
20229 template instantiation, and the appropriate
20230 DECL_TEMPLATE_INFO will be set up. This does not happen for
20231 VAR_DECLs so we do the lookup here. Probably, grokdeclarator
20232 should handle VAR_DECLs as it currently handles
20234 if (!DECL_CLASS_SCOPE_P (decl
))
20236 error ("%qD is not a static data member of a class template", decl
);
20239 result
= lookup_field (DECL_CONTEXT (decl
), DECL_NAME (decl
), 0, false);
20240 if (!result
|| !VAR_P (result
))
20242 error ("no matching template for %qD found", decl
);
20245 if (!same_type_p (TREE_TYPE (result
), TREE_TYPE (decl
)))
20247 error ("type %qT for explicit instantiation %qD does not match "
20248 "declared type %qT", TREE_TYPE (result
), decl
,
20253 else if (TREE_CODE (decl
) != FUNCTION_DECL
&& !var_templ
)
20255 error ("explicit instantiation of %q#D", decl
);
20261 /* Check for various error cases. Note that if the explicit
20262 instantiation is valid the RESULT will currently be marked as an
20263 *implicit* instantiation; DECL_EXPLICIT_INSTANTIATION is not set
20264 until we get here. */
20266 if (DECL_TEMPLATE_SPECIALIZATION (result
))
20268 /* DR 259 [temp.spec].
20270 Both an explicit instantiation and a declaration of an explicit
20271 specialization shall not appear in a program unless the explicit
20272 instantiation follows a declaration of the explicit specialization.
20274 For a given set of template parameters, if an explicit
20275 instantiation of a template appears after a declaration of an
20276 explicit specialization for that template, the explicit
20277 instantiation has no effect. */
20280 else if (DECL_EXPLICIT_INSTANTIATION (result
))
20284 No program shall explicitly instantiate any template more
20287 We check DECL_NOT_REALLY_EXTERN so as not to complain when
20288 the first instantiation was `extern' and the second is not,
20289 and EXTERN_P for the opposite case. */
20290 if (DECL_NOT_REALLY_EXTERN (result
) && !extern_p
)
20291 permerror (input_location
, "duplicate explicit instantiation of %q#D", result
);
20292 /* If an "extern" explicit instantiation follows an ordinary
20293 explicit instantiation, the template is instantiated. */
20297 else if (!DECL_IMPLICIT_INSTANTIATION (result
))
20299 error ("no matching template for %qD found", result
);
20302 else if (!DECL_TEMPLATE_INFO (result
))
20304 permerror (input_location
, "explicit instantiation of non-template %q#D", result
);
20308 if (storage
== NULL_TREE
)
20310 else if (storage
== ridpointers
[(int) RID_EXTERN
])
20312 if (!in_system_header_at (input_location
) && (cxx_dialect
== cxx98
))
20313 pedwarn (input_location
, OPT_Wpedantic
,
20314 "ISO C++ 1998 forbids the use of %<extern%> on explicit "
20319 error ("storage class %qD applied to template instantiation", storage
);
20321 check_explicit_instantiation_namespace (result
);
20322 mark_decl_instantiated (result
, extern_p
);
20324 instantiate_decl (result
, /*defer_ok=*/1,
20325 /*expl_inst_class_mem_p=*/false);
20329 mark_class_instantiated (tree t
, int extern_p
)
20331 SET_CLASSTYPE_EXPLICIT_INSTANTIATION (t
);
20332 SET_CLASSTYPE_INTERFACE_KNOWN (t
);
20333 CLASSTYPE_INTERFACE_ONLY (t
) = extern_p
;
20334 TYPE_DECL_SUPPRESS_DEBUG (TYPE_NAME (t
)) = extern_p
;
20337 CLASSTYPE_DEBUG_REQUESTED (t
) = 1;
20338 rest_of_type_compilation (t
, 1);
20342 /* Called from do_type_instantiation through binding_table_foreach to
20343 do recursive instantiation for the type bound in ENTRY. */
20345 bt_instantiate_type_proc (binding_entry entry
, void *data
)
20347 tree storage
= *(tree
*) data
;
20349 if (MAYBE_CLASS_TYPE_P (entry
->type
)
20350 && !uses_template_parms (CLASSTYPE_TI_ARGS (entry
->type
)))
20351 do_type_instantiation (TYPE_MAIN_DECL (entry
->type
), storage
, 0);
20354 /* Called from do_type_instantiation to instantiate a member
20355 (a member function or a static member variable) of an
20356 explicitly instantiated class template. */
20358 instantiate_class_member (tree decl
, int extern_p
)
20360 mark_decl_instantiated (decl
, extern_p
);
20362 instantiate_decl (decl
, /*defer_ok=*/1,
20363 /*expl_inst_class_mem_p=*/true);
20366 /* Perform an explicit instantiation of template class T. STORAGE, if
20367 non-null, is the RID for extern, inline or static. COMPLAIN is
20368 nonzero if this is called from the parser, zero if called recursively,
20369 since the standard is unclear (as detailed below). */
20372 do_type_instantiation (tree t
, tree storage
, tsubst_flags_t complain
)
20377 int previous_instantiation_extern_p
= 0;
20379 if (TREE_CODE (t
) == TYPE_DECL
)
20382 if (! CLASS_TYPE_P (t
) || ! CLASSTYPE_TEMPLATE_INFO (t
))
20385 (TYPE_TEMPLATE_INFO (t
)) ? TYPE_TI_TEMPLATE (t
) : NULL
;
20387 error ("explicit instantiation of non-class template %qD", tmpl
);
20389 error ("explicit instantiation of non-template type %qT", t
);
20395 if (!COMPLETE_TYPE_P (t
))
20397 if (complain
& tf_error
)
20398 error ("explicit instantiation of %q#T before definition of template",
20403 if (storage
!= NULL_TREE
)
20405 if (!in_system_header_at (input_location
))
20407 if (storage
== ridpointers
[(int) RID_EXTERN
])
20409 if (cxx_dialect
== cxx98
)
20410 pedwarn (input_location
, OPT_Wpedantic
,
20411 "ISO C++ 1998 forbids the use of %<extern%> on "
20412 "explicit instantiations");
20415 pedwarn (input_location
, OPT_Wpedantic
,
20416 "ISO C++ forbids the use of %qE"
20417 " on explicit instantiations", storage
);
20420 if (storage
== ridpointers
[(int) RID_INLINE
])
20422 else if (storage
== ridpointers
[(int) RID_EXTERN
])
20424 else if (storage
== ridpointers
[(int) RID_STATIC
])
20428 error ("storage class %qD applied to template instantiation",
20434 if (CLASSTYPE_TEMPLATE_SPECIALIZATION (t
))
20436 /* DR 259 [temp.spec].
20438 Both an explicit instantiation and a declaration of an explicit
20439 specialization shall not appear in a program unless the explicit
20440 instantiation follows a declaration of the explicit specialization.
20442 For a given set of template parameters, if an explicit
20443 instantiation of a template appears after a declaration of an
20444 explicit specialization for that template, the explicit
20445 instantiation has no effect. */
20448 else if (CLASSTYPE_EXPLICIT_INSTANTIATION (t
))
20452 No program shall explicitly instantiate any template more
20455 If PREVIOUS_INSTANTIATION_EXTERN_P, then the first explicit
20456 instantiation was `extern'. If EXTERN_P then the second is.
20457 These cases are OK. */
20458 previous_instantiation_extern_p
= CLASSTYPE_INTERFACE_ONLY (t
);
20460 if (!previous_instantiation_extern_p
&& !extern_p
20461 && (complain
& tf_error
))
20462 permerror (input_location
, "duplicate explicit instantiation of %q#T", t
);
20464 /* If we've already instantiated the template, just return now. */
20465 if (!CLASSTYPE_INTERFACE_ONLY (t
))
20469 check_explicit_instantiation_namespace (TYPE_NAME (t
));
20470 mark_class_instantiated (t
, extern_p
);
20478 /* In contrast to implicit instantiation, where only the
20479 declarations, and not the definitions, of members are
20480 instantiated, we have here:
20484 The explicit instantiation of a class template specialization
20485 implies the instantiation of all of its members not
20486 previously explicitly specialized in the translation unit
20487 containing the explicit instantiation.
20489 Of course, we can't instantiate member template classes, since
20490 we don't have any arguments for them. Note that the standard
20491 is unclear on whether the instantiation of the members are
20492 *explicit* instantiations or not. However, the most natural
20493 interpretation is that it should be an explicit instantiation. */
20496 for (tmp
= TYPE_METHODS (t
); tmp
; tmp
= DECL_CHAIN (tmp
))
20497 if (TREE_CODE (tmp
) == FUNCTION_DECL
20498 && DECL_TEMPLATE_INSTANTIATION (tmp
))
20499 instantiate_class_member (tmp
, extern_p
);
20501 for (tmp
= TYPE_FIELDS (t
); tmp
; tmp
= DECL_CHAIN (tmp
))
20502 if (VAR_P (tmp
) && DECL_TEMPLATE_INSTANTIATION (tmp
))
20503 instantiate_class_member (tmp
, extern_p
);
20505 if (CLASSTYPE_NESTED_UTDS (t
))
20506 binding_table_foreach (CLASSTYPE_NESTED_UTDS (t
),
20507 bt_instantiate_type_proc
, &storage
);
20511 /* Given a function DECL, which is a specialization of TMPL, modify
20512 DECL to be a re-instantiation of TMPL with the same template
20513 arguments. TMPL should be the template into which tsubst'ing
20514 should occur for DECL, not the most general template.
20516 One reason for doing this is a scenario like this:
20519 void f(const T&, int i);
20521 void g() { f(3, 7); }
20524 void f(const T& t, const int i) { }
20526 Note that when the template is first instantiated, with
20527 instantiate_template, the resulting DECL will have no name for the
20528 first parameter, and the wrong type for the second. So, when we go
20529 to instantiate the DECL, we regenerate it. */
20532 regenerate_decl_from_template (tree decl
, tree tmpl
)
20534 /* The arguments used to instantiate DECL, from the most general
20539 args
= DECL_TI_ARGS (decl
);
20540 code_pattern
= DECL_TEMPLATE_RESULT (tmpl
);
20542 /* Make sure that we can see identifiers, and compute access
20544 push_access_scope (decl
);
20546 if (TREE_CODE (decl
) == FUNCTION_DECL
)
20554 args_depth
= TMPL_ARGS_DEPTH (args
);
20555 parms_depth
= TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl
));
20556 if (args_depth
> parms_depth
)
20557 args
= get_innermost_template_args (args
, parms_depth
);
20559 specs
= tsubst_exception_specification (TREE_TYPE (code_pattern
),
20560 args
, tf_error
, NULL_TREE
,
20561 /*defer_ok*/false);
20562 if (specs
&& specs
!= error_mark_node
)
20563 TREE_TYPE (decl
) = build_exception_variant (TREE_TYPE (decl
),
20566 /* Merge parameter declarations. */
20567 decl_parm
= skip_artificial_parms_for (decl
,
20568 DECL_ARGUMENTS (decl
));
20570 = skip_artificial_parms_for (code_pattern
,
20571 DECL_ARGUMENTS (code_pattern
));
20572 while (decl_parm
&& !DECL_PACK_P (pattern_parm
))
20577 if (DECL_NAME (decl_parm
) != DECL_NAME (pattern_parm
))
20578 DECL_NAME (decl_parm
) = DECL_NAME (pattern_parm
);
20579 parm_type
= tsubst (TREE_TYPE (pattern_parm
), args
, tf_error
,
20581 parm_type
= type_decays_to (parm_type
);
20582 if (!same_type_p (TREE_TYPE (decl_parm
), parm_type
))
20583 TREE_TYPE (decl_parm
) = parm_type
;
20584 attributes
= DECL_ATTRIBUTES (pattern_parm
);
20585 if (DECL_ATTRIBUTES (decl_parm
) != attributes
)
20587 DECL_ATTRIBUTES (decl_parm
) = attributes
;
20588 cplus_decl_attributes (&decl_parm
, attributes
, /*flags=*/0);
20590 decl_parm
= DECL_CHAIN (decl_parm
);
20591 pattern_parm
= DECL_CHAIN (pattern_parm
);
20593 /* Merge any parameters that match with the function parameter
20595 if (pattern_parm
&& DECL_PACK_P (pattern_parm
))
20598 tree expanded_types
;
20599 /* Expand the TYPE_PACK_EXPANSION that provides the types for
20600 the parameters in this function parameter pack. */
20601 expanded_types
= tsubst_pack_expansion (TREE_TYPE (pattern_parm
),
20602 args
, tf_error
, NULL_TREE
);
20603 len
= TREE_VEC_LENGTH (expanded_types
);
20604 for (i
= 0; i
< len
; i
++)
20609 if (DECL_NAME (decl_parm
) != DECL_NAME (pattern_parm
))
20610 /* Rename the parameter to include the index. */
20611 DECL_NAME (decl_parm
) =
20612 make_ith_pack_parameter_name (DECL_NAME (pattern_parm
), i
);
20613 parm_type
= TREE_VEC_ELT (expanded_types
, i
);
20614 parm_type
= type_decays_to (parm_type
);
20615 if (!same_type_p (TREE_TYPE (decl_parm
), parm_type
))
20616 TREE_TYPE (decl_parm
) = parm_type
;
20617 attributes
= DECL_ATTRIBUTES (pattern_parm
);
20618 if (DECL_ATTRIBUTES (decl_parm
) != attributes
)
20620 DECL_ATTRIBUTES (decl_parm
) = attributes
;
20621 cplus_decl_attributes (&decl_parm
, attributes
, /*flags=*/0);
20623 decl_parm
= DECL_CHAIN (decl_parm
);
20626 /* Merge additional specifiers from the CODE_PATTERN. */
20627 if (DECL_DECLARED_INLINE_P (code_pattern
)
20628 && !DECL_DECLARED_INLINE_P (decl
))
20629 DECL_DECLARED_INLINE_P (decl
) = 1;
20631 else if (VAR_P (decl
))
20633 DECL_INITIAL (decl
) =
20634 tsubst_expr (DECL_INITIAL (code_pattern
), args
,
20635 tf_error
, DECL_TI_TEMPLATE (decl
),
20636 /*integral_constant_expression_p=*/false);
20637 if (VAR_HAD_UNKNOWN_BOUND (decl
))
20638 TREE_TYPE (decl
) = tsubst (TREE_TYPE (code_pattern
), args
,
20639 tf_error
, DECL_TI_TEMPLATE (decl
));
20642 gcc_unreachable ();
20644 pop_access_scope (decl
);
20647 /* Return the TEMPLATE_DECL into which DECL_TI_ARGS(DECL) should be
20648 substituted to get DECL. */
20651 template_for_substitution (tree decl
)
20653 tree tmpl
= DECL_TI_TEMPLATE (decl
);
20655 /* Set TMPL to the template whose DECL_TEMPLATE_RESULT is the pattern
20656 for the instantiation. This is not always the most general
20657 template. Consider, for example:
20660 struct S { template <class U> void f();
20661 template <> void f<int>(); };
20663 and an instantiation of S<double>::f<int>. We want TD to be the
20664 specialization S<T>::f<int>, not the more general S<T>::f<U>. */
20665 while (/* An instantiation cannot have a definition, so we need a
20666 more general template. */
20667 DECL_TEMPLATE_INSTANTIATION (tmpl
)
20668 /* We must also deal with friend templates. Given:
20670 template <class T> struct S {
20671 template <class U> friend void f() {};
20674 S<int>::f<U> say, is not an instantiation of S<T>::f<U>,
20675 so far as the language is concerned, but that's still
20676 where we get the pattern for the instantiation from. On
20677 other hand, if the definition comes outside the class, say:
20679 template <class T> struct S {
20680 template <class U> friend void f();
20682 template <class U> friend void f() {}
20684 we don't need to look any further. That's what the check for
20685 DECL_INITIAL is for. */
20686 || (TREE_CODE (decl
) == FUNCTION_DECL
20687 && DECL_FRIEND_PSEUDO_TEMPLATE_INSTANTIATION (tmpl
)
20688 && !DECL_INITIAL (DECL_TEMPLATE_RESULT (tmpl
))))
20690 /* The present template, TD, should not be a definition. If it
20691 were a definition, we should be using it! Note that we
20692 cannot restructure the loop to just keep going until we find
20693 a template with a definition, since that might go too far if
20694 a specialization was declared, but not defined. */
20696 /* Fetch the more general template. */
20697 tmpl
= DECL_TI_TEMPLATE (tmpl
);
20703 /* Returns true if we need to instantiate this template instance even if we
20704 know we aren't going to emit it. */
20707 always_instantiate_p (tree decl
)
20709 /* We always instantiate inline functions so that we can inline them. An
20710 explicit instantiation declaration prohibits implicit instantiation of
20711 non-inline functions. With high levels of optimization, we would
20712 normally inline non-inline functions -- but we're not allowed to do
20713 that for "extern template" functions. Therefore, we check
20714 DECL_DECLARED_INLINE_P, rather than possibly_inlined_p. */
20715 return ((TREE_CODE (decl
) == FUNCTION_DECL
20716 && (DECL_DECLARED_INLINE_P (decl
)
20717 || type_uses_auto (TREE_TYPE (TREE_TYPE (decl
)))))
20718 /* And we need to instantiate static data members so that
20719 their initializers are available in integral constant
20722 && decl_maybe_constant_var_p (decl
)));
20725 /* If FN has a noexcept-specifier that hasn't been instantiated yet,
20726 instantiate it now, modifying TREE_TYPE (fn). */
20729 maybe_instantiate_noexcept (tree fn
)
20731 tree fntype
, spec
, noex
, clone
;
20733 /* Don't instantiate a noexcept-specification from template context. */
20734 if (processing_template_decl
)
20737 if (DECL_CLONED_FUNCTION_P (fn
))
20738 fn
= DECL_CLONED_FUNCTION (fn
);
20739 fntype
= TREE_TYPE (fn
);
20740 spec
= TYPE_RAISES_EXCEPTIONS (fntype
);
20742 if (!spec
|| !TREE_PURPOSE (spec
))
20745 noex
= TREE_PURPOSE (spec
);
20747 if (TREE_CODE (noex
) == DEFERRED_NOEXCEPT
)
20749 if (DEFERRED_NOEXCEPT_PATTERN (noex
) == NULL_TREE
)
20750 spec
= get_defaulted_eh_spec (fn
);
20751 else if (push_tinst_level (fn
))
20753 push_access_scope (fn
);
20754 push_deferring_access_checks (dk_no_deferred
);
20755 input_location
= DECL_SOURCE_LOCATION (fn
);
20756 noex
= tsubst_copy_and_build (DEFERRED_NOEXCEPT_PATTERN (noex
),
20757 DEFERRED_NOEXCEPT_ARGS (noex
),
20758 tf_warning_or_error
, fn
,
20759 /*function_p=*/false,
20760 /*integral_constant_expression_p=*/true);
20761 pop_deferring_access_checks ();
20762 pop_access_scope (fn
);
20763 pop_tinst_level ();
20764 spec
= build_noexcept_spec (noex
, tf_warning_or_error
);
20765 if (spec
== error_mark_node
)
20766 spec
= noexcept_false_spec
;
20769 spec
= noexcept_false_spec
;
20771 TREE_TYPE (fn
) = build_exception_variant (fntype
, spec
);
20774 FOR_EACH_CLONE (clone
, fn
)
20776 if (TREE_TYPE (clone
) == fntype
)
20777 TREE_TYPE (clone
) = TREE_TYPE (fn
);
20779 TREE_TYPE (clone
) = build_exception_variant (TREE_TYPE (clone
), spec
);
20783 /* Produce the definition of D, a _DECL generated from a template. If
20784 DEFER_OK is nonzero, then we don't have to actually do the
20785 instantiation now; we just have to do it sometime. Normally it is
20786 an error if this is an explicit instantiation but D is undefined.
20787 EXPL_INST_CLASS_MEM_P is true iff D is a member of an
20788 explicitly instantiated class template. */
20791 instantiate_decl (tree d
, int defer_ok
,
20792 bool expl_inst_class_mem_p
)
20794 tree tmpl
= DECL_TI_TEMPLATE (d
);
20801 bool pattern_defined
;
20802 location_t saved_loc
= input_location
;
20803 int saved_unevaluated_operand
= cp_unevaluated_operand
;
20804 int saved_inhibit_evaluation_warnings
= c_inhibit_evaluation_warnings
;
20810 /* This function should only be used to instantiate templates for
20811 functions and static member variables. */
20812 gcc_assert (VAR_OR_FUNCTION_DECL_P (d
));
20814 /* A concept is never instantiated. */
20815 gcc_assert (!DECL_DECLARED_CONCEPT_P (d
));
20817 /* Variables are never deferred; if instantiation is required, they
20818 are instantiated right away. That allows for better code in the
20819 case that an expression refers to the value of the variable --
20820 if the variable has a constant value the referring expression can
20821 take advantage of that fact. */
20823 || DECL_DECLARED_CONSTEXPR_P (d
))
20826 /* Don't instantiate cloned functions. Instead, instantiate the
20827 functions they cloned. */
20828 if (TREE_CODE (d
) == FUNCTION_DECL
&& DECL_CLONED_FUNCTION_P (d
))
20829 d
= DECL_CLONED_FUNCTION (d
);
20831 if (DECL_TEMPLATE_INSTANTIATED (d
)
20832 || (TREE_CODE (d
) == FUNCTION_DECL
20833 && DECL_DEFAULTED_FN (d
) && DECL_INITIAL (d
))
20834 || DECL_TEMPLATE_SPECIALIZATION (d
))
20835 /* D has already been instantiated or explicitly specialized, so
20836 there's nothing for us to do here.
20838 It might seem reasonable to check whether or not D is an explicit
20839 instantiation, and, if so, stop here. But when an explicit
20840 instantiation is deferred until the end of the compilation,
20841 DECL_EXPLICIT_INSTANTIATION is set, even though we still need to do
20842 the instantiation. */
20845 /* Check to see whether we know that this template will be
20846 instantiated in some other file, as with "extern template"
20848 external_p
= (DECL_INTERFACE_KNOWN (d
) && DECL_REALLY_EXTERN (d
));
20850 /* In general, we do not instantiate such templates. */
20851 if (external_p
&& !always_instantiate_p (d
))
20854 gen_tmpl
= most_general_template (tmpl
);
20855 gen_args
= DECL_TI_ARGS (d
);
20857 if (tmpl
!= gen_tmpl
)
20858 /* We should already have the extra args. */
20859 gcc_assert (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (gen_tmpl
))
20860 == TMPL_ARGS_DEPTH (gen_args
));
20861 /* And what's in the hash table should match D. */
20862 gcc_assert ((spec
= retrieve_specialization (gen_tmpl
, gen_args
, 0)) == d
20863 || spec
== NULL_TREE
);
20865 /* This needs to happen before any tsubsting. */
20866 if (! push_tinst_level (d
))
20869 timevar_push (TV_TEMPLATE_INST
);
20871 /* Set TD to the template whose DECL_TEMPLATE_RESULT is the pattern
20872 for the instantiation. */
20873 td
= template_for_substitution (d
);
20874 code_pattern
= DECL_TEMPLATE_RESULT (td
);
20876 /* We should never be trying to instantiate a member of a class
20877 template or partial specialization. */
20878 gcc_assert (d
!= code_pattern
);
20880 if ((DECL_NAMESPACE_SCOPE_P (d
) && !DECL_INITIALIZED_IN_CLASS_P (d
))
20881 || DECL_TEMPLATE_SPECIALIZATION (td
))
20882 /* In the case of a friend template whose definition is provided
20883 outside the class, we may have too many arguments. Drop the
20884 ones we don't need. The same is true for specializations. */
20885 args
= get_innermost_template_args
20886 (gen_args
, TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (td
)));
20890 if (TREE_CODE (d
) == FUNCTION_DECL
)
20892 deleted_p
= DECL_DELETED_FN (code_pattern
);
20893 pattern_defined
= (DECL_SAVED_TREE (code_pattern
) != NULL_TREE
20894 || DECL_DEFAULTED_OUTSIDE_CLASS_P (code_pattern
)
20900 pattern_defined
= ! DECL_IN_AGGR_P (code_pattern
);
20903 /* We may be in the middle of deferred access check. Disable it now. */
20904 push_deferring_access_checks (dk_no_deferred
);
20906 /* Unless an explicit instantiation directive has already determined
20907 the linkage of D, remember that a definition is available for
20909 if (pattern_defined
20910 && !DECL_INTERFACE_KNOWN (d
)
20911 && !DECL_NOT_REALLY_EXTERN (d
))
20912 mark_definable (d
);
20914 DECL_SOURCE_LOCATION (td
) = DECL_SOURCE_LOCATION (code_pattern
);
20915 DECL_SOURCE_LOCATION (d
) = DECL_SOURCE_LOCATION (code_pattern
);
20916 input_location
= DECL_SOURCE_LOCATION (d
);
20918 /* If D is a member of an explicitly instantiated class template,
20919 and no definition is available, treat it like an implicit
20921 if (!pattern_defined
&& expl_inst_class_mem_p
20922 && DECL_EXPLICIT_INSTANTIATION (d
))
20924 /* Leave linkage flags alone on instantiations with anonymous
20926 if (TREE_PUBLIC (d
))
20928 DECL_NOT_REALLY_EXTERN (d
) = 0;
20929 DECL_INTERFACE_KNOWN (d
) = 0;
20931 SET_DECL_IMPLICIT_INSTANTIATION (d
);
20934 /* Defer all other templates, unless we have been explicitly
20935 forbidden from doing so. */
20936 if (/* If there is no definition, we cannot instantiate the
20939 /* If it's OK to postpone instantiation, do so. */
20941 /* If this is a static data member that will be defined
20942 elsewhere, we don't want to instantiate the entire data
20943 member, but we do want to instantiate the initializer so that
20944 we can substitute that elsewhere. */
20945 || (external_p
&& VAR_P (d
))
20946 /* Handle here a deleted function too, avoid generating
20947 its body (c++/61080). */
20950 /* The definition of the static data member is now required so
20951 we must substitute the initializer. */
20953 && !DECL_INITIAL (d
)
20954 && DECL_INITIAL (code_pattern
))
20958 bool const_init
= false;
20959 bool enter_context
= DECL_CLASS_SCOPE_P (d
);
20961 ns
= decl_namespace_context (d
);
20962 push_nested_namespace (ns
);
20964 push_nested_class (DECL_CONTEXT (d
));
20965 init
= tsubst_expr (DECL_INITIAL (code_pattern
),
20967 tf_warning_or_error
, NULL_TREE
,
20968 /*integral_constant_expression_p=*/false);
20969 /* If instantiating the initializer involved instantiating this
20970 again, don't call cp_finish_decl twice. */
20971 if (!DECL_INITIAL (d
))
20973 /* Make sure the initializer is still constant, in case of
20974 circular dependency (template/instantiate6.C). */
20976 = DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (code_pattern
);
20977 cp_finish_decl (d
, init
, /*init_const_expr_p=*/const_init
,
20978 /*asmspec_tree=*/NULL_TREE
,
20979 LOOKUP_ONLYCONVERTING
);
20982 pop_nested_class ();
20983 pop_nested_namespace (ns
);
20986 /* We restore the source position here because it's used by
20987 add_pending_template. */
20988 input_location
= saved_loc
;
20990 if (at_eof
&& !pattern_defined
20991 && DECL_EXPLICIT_INSTANTIATION (d
)
20992 && DECL_NOT_REALLY_EXTERN (d
))
20995 The definition of a non-exported function template, a
20996 non-exported member function template, or a non-exported
20997 member function or static data member of a class template
20998 shall be present in every translation unit in which it is
20999 explicitly instantiated. */
21000 permerror (input_location
, "explicit instantiation of %qD "
21001 "but no definition available", d
);
21003 /* If we're in unevaluated context, we just wanted to get the
21004 constant value; this isn't an odr use, so don't queue
21005 a full instantiation. */
21006 if (cp_unevaluated_operand
!= 0)
21008 /* ??? Historically, we have instantiated inline functions, even
21009 when marked as "extern template". */
21010 if (!(external_p
&& VAR_P (d
)))
21011 add_pending_template (d
);
21014 /* Tell the repository that D is available in this translation unit
21015 -- and see if it is supposed to be instantiated here. */
21016 if (TREE_PUBLIC (d
) && !DECL_REALLY_EXTERN (d
) && !repo_emit_p (d
))
21018 /* In a PCH file, despite the fact that the repository hasn't
21019 requested instantiation in the PCH it is still possible that
21020 an instantiation will be required in a file that includes the
21023 add_pending_template (d
);
21024 /* Instantiate inline functions so that the inliner can do its
21025 job, even though we'll not be emitting a copy of this
21027 if (!(TREE_CODE (d
) == FUNCTION_DECL
&& possibly_inlined_p (d
)))
21031 fn_context
= decl_function_context (d
);
21032 nested
= (current_function_decl
!= NULL_TREE
);
21034 push_to_top_level ();
21038 push_function_context ();
21039 cp_unevaluated_operand
= 0;
21040 c_inhibit_evaluation_warnings
= 0;
21043 /* Mark D as instantiated so that recursive calls to
21044 instantiate_decl do not try to instantiate it again. */
21045 DECL_TEMPLATE_INSTANTIATED (d
) = 1;
21047 /* Regenerate the declaration in case the template has been modified
21048 by a subsequent redeclaration. */
21049 regenerate_decl_from_template (d
, td
);
21051 /* We already set the file and line above. Reset them now in case
21052 they changed as a result of calling regenerate_decl_from_template. */
21053 input_location
= DECL_SOURCE_LOCATION (d
);
21058 bool const_init
= false;
21060 /* Clear out DECL_RTL; whatever was there before may not be right
21061 since we've reset the type of the declaration. */
21062 SET_DECL_RTL (d
, NULL
);
21063 DECL_IN_AGGR_P (d
) = 0;
21065 /* The initializer is placed in DECL_INITIAL by
21066 regenerate_decl_from_template so we don't need to
21067 push/pop_access_scope again here. Pull it out so that
21068 cp_finish_decl can process it. */
21069 init
= DECL_INITIAL (d
);
21070 DECL_INITIAL (d
) = NULL_TREE
;
21071 DECL_INITIALIZED_P (d
) = 0;
21073 /* Clear DECL_EXTERNAL so that cp_finish_decl will process the
21074 initializer. That function will defer actual emission until
21075 we have a chance to determine linkage. */
21076 DECL_EXTERNAL (d
) = 0;
21078 /* Enter the scope of D so that access-checking works correctly. */
21079 bool enter_context
= DECL_CLASS_SCOPE_P (d
);
21081 push_nested_class (DECL_CONTEXT (d
));
21083 const_init
= DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (code_pattern
);
21084 cp_finish_decl (d
, init
, const_init
, NULL_TREE
, 0);
21087 pop_nested_class ();
21089 if (variable_template_p (td
))
21090 note_variable_template_instantiation (d
);
21092 else if (TREE_CODE (d
) == FUNCTION_DECL
&& DECL_DEFAULTED_FN (code_pattern
))
21093 synthesize_method (d
);
21094 else if (TREE_CODE (d
) == FUNCTION_DECL
)
21096 hash_map
<tree
, tree
> *saved_local_specializations
;
21100 tree block
= NULL_TREE
;
21102 /* Save away the current list, in case we are instantiating one
21103 template from within the body of another. */
21104 saved_local_specializations
= local_specializations
;
21106 /* Set up the list of local specializations. */
21107 local_specializations
= new hash_map
<tree
, tree
>;
21109 /* Set up context. */
21110 if (DECL_OMP_DECLARE_REDUCTION_P (code_pattern
)
21111 && TREE_CODE (DECL_CONTEXT (code_pattern
)) == FUNCTION_DECL
)
21112 block
= push_stmt_list ();
21114 start_preparsed_function (d
, NULL_TREE
, SF_PRE_PARSED
);
21116 /* Some typedefs referenced from within the template code need to be
21117 access checked at template instantiation time, i.e now. These
21118 types were added to the template at parsing time. Let's get those
21119 and perform the access checks then. */
21120 perform_typedefs_access_check (DECL_TEMPLATE_RESULT (gen_tmpl
),
21123 /* Create substitution entries for the parameters. */
21124 subst_decl
= DECL_TEMPLATE_RESULT (template_for_substitution (d
));
21125 tmpl_parm
= DECL_ARGUMENTS (subst_decl
);
21126 spec_parm
= DECL_ARGUMENTS (d
);
21127 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (d
))
21129 register_local_specialization (spec_parm
, tmpl_parm
);
21130 spec_parm
= skip_artificial_parms_for (d
, spec_parm
);
21131 tmpl_parm
= skip_artificial_parms_for (subst_decl
, tmpl_parm
);
21133 for (; tmpl_parm
; tmpl_parm
= DECL_CHAIN (tmpl_parm
))
21135 if (!DECL_PACK_P (tmpl_parm
))
21137 register_local_specialization (spec_parm
, tmpl_parm
);
21138 spec_parm
= DECL_CHAIN (spec_parm
);
21142 /* Register the (value) argument pack as a specialization of
21143 TMPL_PARM, then move on. */
21144 tree argpack
= extract_fnparm_pack (tmpl_parm
, &spec_parm
);
21145 register_local_specialization (argpack
, tmpl_parm
);
21148 gcc_assert (!spec_parm
);
21150 /* Substitute into the body of the function. */
21151 if (DECL_OMP_DECLARE_REDUCTION_P (code_pattern
))
21152 tsubst_omp_udr (DECL_SAVED_TREE (code_pattern
), args
,
21153 tf_warning_or_error
, tmpl
);
21156 tsubst_expr (DECL_SAVED_TREE (code_pattern
), args
,
21157 tf_warning_or_error
, tmpl
,
21158 /*integral_constant_expression_p=*/false);
21160 /* Set the current input_location to the end of the function
21161 so that finish_function knows where we are. */
21163 = DECL_STRUCT_FUNCTION (code_pattern
)->function_end_locus
;
21165 /* Remember if we saw an infinite loop in the template. */
21166 current_function_infinite_loop
21167 = DECL_STRUCT_FUNCTION (code_pattern
)->language
->infinite_loop
;
21170 /* We don't need the local specializations any more. */
21171 delete local_specializations
;
21172 local_specializations
= saved_local_specializations
;
21174 /* Finish the function. */
21175 if (DECL_OMP_DECLARE_REDUCTION_P (code_pattern
)
21176 && TREE_CODE (DECL_CONTEXT (code_pattern
)) == FUNCTION_DECL
)
21177 DECL_SAVED_TREE (d
) = pop_stmt_list (block
);
21180 d
= finish_function (0);
21181 expand_or_defer_fn (d
);
21184 if (DECL_OMP_DECLARE_REDUCTION_P (code_pattern
))
21185 cp_check_omp_declare_reduction (d
);
21188 /* We're not deferring instantiation any more. */
21189 TI_PENDING_TEMPLATE_FLAG (DECL_TEMPLATE_INFO (d
)) = 0;
21192 pop_from_top_level ();
21194 pop_function_context ();
21197 input_location
= saved_loc
;
21198 cp_unevaluated_operand
= saved_unevaluated_operand
;
21199 c_inhibit_evaluation_warnings
= saved_inhibit_evaluation_warnings
;
21200 pop_deferring_access_checks ();
21201 pop_tinst_level ();
21203 timevar_pop (TV_TEMPLATE_INST
);
21208 /* Run through the list of templates that we wish we could
21209 instantiate, and instantiate any we can. RETRIES is the
21210 number of times we retry pending template instantiation. */
21213 instantiate_pending_templates (int retries
)
21216 location_t saved_loc
= input_location
;
21218 /* Instantiating templates may trigger vtable generation. This in turn
21219 may require further template instantiations. We place a limit here
21220 to avoid infinite loop. */
21221 if (pending_templates
&& retries
>= max_tinst_depth
)
21223 tree decl
= pending_templates
->tinst
->decl
;
21225 fatal_error (input_location
,
21226 "template instantiation depth exceeds maximum of %d"
21227 " instantiating %q+D, possibly from virtual table generation"
21228 " (use -ftemplate-depth= to increase the maximum)",
21229 max_tinst_depth
, decl
);
21230 if (TREE_CODE (decl
) == FUNCTION_DECL
)
21231 /* Pretend that we defined it. */
21232 DECL_INITIAL (decl
) = error_mark_node
;
21238 struct pending_template
**t
= &pending_templates
;
21239 struct pending_template
*last
= NULL
;
21243 tree instantiation
= reopen_tinst_level ((*t
)->tinst
);
21244 bool complete
= false;
21246 if (TYPE_P (instantiation
))
21250 if (!COMPLETE_TYPE_P (instantiation
))
21252 instantiate_class_template (instantiation
);
21253 if (CLASSTYPE_TEMPLATE_INSTANTIATION (instantiation
))
21254 for (fn
= TYPE_METHODS (instantiation
);
21256 fn
= TREE_CHAIN (fn
))
21257 if (! DECL_ARTIFICIAL (fn
))
21258 instantiate_decl (fn
,
21260 /*expl_inst_class_mem_p=*/false);
21261 if (COMPLETE_TYPE_P (instantiation
))
21265 complete
= COMPLETE_TYPE_P (instantiation
);
21269 if (!DECL_TEMPLATE_SPECIALIZATION (instantiation
)
21270 && !DECL_TEMPLATE_INSTANTIATED (instantiation
))
21273 = instantiate_decl (instantiation
,
21275 /*expl_inst_class_mem_p=*/false);
21276 if (DECL_TEMPLATE_INSTANTIATED (instantiation
))
21280 complete
= (DECL_TEMPLATE_SPECIALIZATION (instantiation
)
21281 || DECL_TEMPLATE_INSTANTIATED (instantiation
));
21285 /* If INSTANTIATION has been instantiated, then we don't
21286 need to consider it again in the future. */
21294 current_tinst_level
= NULL
;
21296 last_pending_template
= last
;
21298 while (reconsider
);
21300 input_location
= saved_loc
;
21303 /* Substitute ARGVEC into T, which is a list of initializers for
21304 either base class or a non-static data member. The TREE_PURPOSEs
21305 are DECLs, and the TREE_VALUEs are the initializer values. Used by
21306 instantiate_decl. */
21309 tsubst_initializer_list (tree t
, tree argvec
)
21311 tree inits
= NULL_TREE
;
21313 for (; t
; t
= TREE_CHAIN (t
))
21317 tree expanded_bases
= NULL_TREE
;
21318 tree expanded_arguments
= NULL_TREE
;
21321 if (TREE_CODE (TREE_PURPOSE (t
)) == TYPE_PACK_EXPANSION
)
21326 /* Expand the base class expansion type into separate base
21328 expanded_bases
= tsubst_pack_expansion (TREE_PURPOSE (t
), argvec
,
21329 tf_warning_or_error
,
21331 if (expanded_bases
== error_mark_node
)
21334 /* We'll be building separate TREE_LISTs of arguments for
21336 len
= TREE_VEC_LENGTH (expanded_bases
);
21337 expanded_arguments
= make_tree_vec (len
);
21338 for (i
= 0; i
< len
; i
++)
21339 TREE_VEC_ELT (expanded_arguments
, i
) = NULL_TREE
;
21341 /* Build a dummy EXPR_PACK_EXPANSION that will be used to
21342 expand each argument in the TREE_VALUE of t. */
21343 expr
= make_node (EXPR_PACK_EXPANSION
);
21344 PACK_EXPANSION_LOCAL_P (expr
) = true;
21345 PACK_EXPANSION_PARAMETER_PACKS (expr
) =
21346 PACK_EXPANSION_PARAMETER_PACKS (TREE_PURPOSE (t
));
21348 if (TREE_VALUE (t
) == void_type_node
)
21349 /* VOID_TYPE_NODE is used to indicate
21350 value-initialization. */
21352 for (i
= 0; i
< len
; i
++)
21353 TREE_VEC_ELT (expanded_arguments
, i
) = void_type_node
;
21357 /* Substitute parameter packs into each argument in the
21359 in_base_initializer
= 1;
21360 for (arg
= TREE_VALUE (t
); arg
; arg
= TREE_CHAIN (arg
))
21362 tree expanded_exprs
;
21364 /* Expand the argument. */
21365 SET_PACK_EXPANSION_PATTERN (expr
, TREE_VALUE (arg
));
21367 = tsubst_pack_expansion (expr
, argvec
,
21368 tf_warning_or_error
,
21370 if (expanded_exprs
== error_mark_node
)
21373 /* Prepend each of the expanded expressions to the
21374 corresponding TREE_LIST in EXPANDED_ARGUMENTS. */
21375 for (i
= 0; i
< len
; i
++)
21377 TREE_VEC_ELT (expanded_arguments
, i
) =
21378 tree_cons (NULL_TREE
,
21379 TREE_VEC_ELT (expanded_exprs
, i
),
21380 TREE_VEC_ELT (expanded_arguments
, i
));
21383 in_base_initializer
= 0;
21385 /* Reverse all of the TREE_LISTs in EXPANDED_ARGUMENTS,
21386 since we built them backwards. */
21387 for (i
= 0; i
< len
; i
++)
21389 TREE_VEC_ELT (expanded_arguments
, i
) =
21390 nreverse (TREE_VEC_ELT (expanded_arguments
, i
));
21395 for (i
= 0; i
< len
; ++i
)
21397 if (expanded_bases
)
21399 decl
= TREE_VEC_ELT (expanded_bases
, i
);
21400 decl
= expand_member_init (decl
);
21401 init
= TREE_VEC_ELT (expanded_arguments
, i
);
21406 decl
= tsubst_copy (TREE_PURPOSE (t
), argvec
,
21407 tf_warning_or_error
, NULL_TREE
);
21409 decl
= expand_member_init (decl
);
21410 if (decl
&& !DECL_P (decl
))
21411 in_base_initializer
= 1;
21413 init
= TREE_VALUE (t
);
21415 if (init
!= void_type_node
)
21416 init
= tsubst_expr (init
, argvec
,
21417 tf_warning_or_error
, NULL_TREE
,
21418 /*integral_constant_expression_p=*/false);
21419 if (init
== NULL_TREE
&& tmp
!= NULL_TREE
)
21420 /* If we had an initializer but it instantiated to nothing,
21421 value-initialize the object. This will only occur when
21422 the initializer was a pack expansion where the parameter
21423 packs used in that expansion were of length zero. */
21424 init
= void_type_node
;
21425 in_base_initializer
= 0;
21430 init
= build_tree_list (decl
, init
);
21431 TREE_CHAIN (init
) = inits
;
21439 /* Set CURRENT_ACCESS_SPECIFIER based on the protection of DECL. */
21442 set_current_access_from_decl (tree decl
)
21444 if (TREE_PRIVATE (decl
))
21445 current_access_specifier
= access_private_node
;
21446 else if (TREE_PROTECTED (decl
))
21447 current_access_specifier
= access_protected_node
;
21449 current_access_specifier
= access_public_node
;
21452 /* Instantiate an enumerated type. TAG is the template type, NEWTAG
21453 is the instantiation (which should have been created with
21454 start_enum) and ARGS are the template arguments to use. */
21457 tsubst_enum (tree tag
, tree newtag
, tree args
)
21461 if (SCOPED_ENUM_P (newtag
))
21462 begin_scope (sk_scoped_enum
, newtag
);
21464 for (e
= TYPE_VALUES (tag
); e
; e
= TREE_CHAIN (e
))
21469 decl
= TREE_VALUE (e
);
21470 /* Note that in a template enum, the TREE_VALUE is the
21471 CONST_DECL, not the corresponding INTEGER_CST. */
21472 value
= tsubst_expr (DECL_INITIAL (decl
),
21473 args
, tf_warning_or_error
, NULL_TREE
,
21474 /*integral_constant_expression_p=*/true);
21476 /* Give this enumeration constant the correct access. */
21477 set_current_access_from_decl (decl
);
21479 /* Actually build the enumerator itself. Here we're assuming that
21480 enumerators can't have dependent attributes. */
21481 build_enumerator (DECL_NAME (decl
), value
, newtag
,
21482 DECL_ATTRIBUTES (decl
), DECL_SOURCE_LOCATION (decl
));
21485 if (SCOPED_ENUM_P (newtag
))
21488 finish_enum_value_list (newtag
);
21489 finish_enum (newtag
);
21491 DECL_SOURCE_LOCATION (TYPE_NAME (newtag
))
21492 = DECL_SOURCE_LOCATION (TYPE_NAME (tag
));
21495 /* DECL is a FUNCTION_DECL that is a template specialization. Return
21496 its type -- but without substituting the innermost set of template
21497 arguments. So, innermost set of template parameters will appear in
21501 get_mostly_instantiated_function_type (tree decl
)
21503 /* For a function, DECL_TI_TEMPLATE is partially instantiated. */
21504 return TREE_TYPE (DECL_TI_TEMPLATE (decl
));
21507 /* Return truthvalue if we're processing a template different from
21508 the last one involved in diagnostics. */
21510 problematic_instantiation_changed (void)
21512 return current_tinst_level
!= last_error_tinst_level
;
21515 /* Remember current template involved in diagnostics. */
21517 record_last_problematic_instantiation (void)
21519 last_error_tinst_level
= current_tinst_level
;
21522 struct tinst_level
*
21523 current_instantiation (void)
21525 return current_tinst_level
;
21528 /* Return TRUE if current_function_decl is being instantiated, false
21532 instantiating_current_function_p (void)
21534 return (current_instantiation ()
21535 && current_instantiation ()->decl
== current_function_decl
);
21538 /* [temp.param] Check that template non-type parm TYPE is of an allowable
21539 type. Return zero for ok, nonzero for disallowed. Issue error and
21540 warning messages under control of COMPLAIN. */
21543 invalid_nontype_parm_type_p (tree type
, tsubst_flags_t complain
)
21545 if (INTEGRAL_OR_ENUMERATION_TYPE_P (type
))
21547 else if (POINTER_TYPE_P (type
))
21549 else if (TYPE_PTRMEM_P (type
))
21551 else if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
)
21553 else if (TREE_CODE (type
) == TYPENAME_TYPE
)
21555 else if (TREE_CODE (type
) == DECLTYPE_TYPE
)
21557 else if (TREE_CODE (type
) == NULLPTR_TYPE
)
21559 /* A bound template template parm could later be instantiated to have a valid
21560 nontype parm type via an alias template. */
21561 else if (cxx_dialect
>= cxx11
21562 && TREE_CODE (type
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
21565 if (complain
& tf_error
)
21567 if (type
== error_mark_node
)
21568 inform (input_location
, "invalid template non-type parameter");
21570 error ("%q#T is not a valid type for a template non-type parameter",
21576 /* Returns TRUE if TYPE is dependent, in the sense of [temp.dep.type].
21577 Assumes that TYPE really is a type, and not the ERROR_MARK_NODE.*/
21580 dependent_type_p_r (tree type
)
21586 A type is dependent if it is:
21588 -- a template parameter. Template template parameters are types
21589 for us (since TYPE_P holds true for them) so we handle
21591 if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
21592 || TREE_CODE (type
) == TEMPLATE_TEMPLATE_PARM
)
21594 /* -- a qualified-id with a nested-name-specifier which contains a
21595 class-name that names a dependent type or whose unqualified-id
21596 names a dependent type. */
21597 if (TREE_CODE (type
) == TYPENAME_TYPE
)
21600 /* An alias template specialization can be dependent even if the
21601 resulting type is not. */
21602 if (dependent_alias_template_spec_p (type
))
21605 /* -- a cv-qualified type where the cv-unqualified type is
21607 No code is necessary for this bullet; the code below handles
21608 cv-qualified types, and we don't want to strip aliases with
21609 TYPE_MAIN_VARIANT because of DR 1558. */
21610 /* -- a compound type constructed from any dependent type. */
21611 if (TYPE_PTRMEM_P (type
))
21612 return (dependent_type_p (TYPE_PTRMEM_CLASS_TYPE (type
))
21613 || dependent_type_p (TYPE_PTRMEM_POINTED_TO_TYPE
21615 else if (TYPE_PTR_P (type
)
21616 || TREE_CODE (type
) == REFERENCE_TYPE
)
21617 return dependent_type_p (TREE_TYPE (type
));
21618 else if (TREE_CODE (type
) == FUNCTION_TYPE
21619 || TREE_CODE (type
) == METHOD_TYPE
)
21623 if (dependent_type_p (TREE_TYPE (type
)))
21625 for (arg_type
= TYPE_ARG_TYPES (type
);
21627 arg_type
= TREE_CHAIN (arg_type
))
21628 if (dependent_type_p (TREE_VALUE (arg_type
)))
21632 /* -- an array type constructed from any dependent type or whose
21633 size is specified by a constant expression that is
21636 We checked for type- and value-dependence of the bounds in
21637 compute_array_index_type, so TYPE_DEPENDENT_P is already set. */
21638 if (TREE_CODE (type
) == ARRAY_TYPE
)
21640 if (TYPE_DOMAIN (type
)
21641 && dependent_type_p (TYPE_DOMAIN (type
)))
21643 return dependent_type_p (TREE_TYPE (type
));
21646 /* -- a template-id in which either the template name is a template
21648 if (TREE_CODE (type
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
21650 /* ... or any of the template arguments is a dependent type or
21651 an expression that is type-dependent or value-dependent. */
21652 else if (CLASS_TYPE_P (type
) && CLASSTYPE_TEMPLATE_INFO (type
)
21653 && (any_dependent_template_arguments_p
21654 (INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (type
)))))
21657 /* All TYPEOF_TYPEs, DECLTYPE_TYPEs, and UNDERLYING_TYPEs are
21658 dependent; if the argument of the `typeof' expression is not
21659 type-dependent, then it should already been have resolved. */
21660 if (TREE_CODE (type
) == TYPEOF_TYPE
21661 || TREE_CODE (type
) == DECLTYPE_TYPE
21662 || TREE_CODE (type
) == UNDERLYING_TYPE
)
21665 /* A template argument pack is dependent if any of its packed
21667 if (TREE_CODE (type
) == TYPE_ARGUMENT_PACK
)
21669 tree args
= ARGUMENT_PACK_ARGS (type
);
21670 int i
, len
= TREE_VEC_LENGTH (args
);
21671 for (i
= 0; i
< len
; ++i
)
21672 if (dependent_template_arg_p (TREE_VEC_ELT (args
, i
)))
21676 /* All TYPE_PACK_EXPANSIONs are dependent, because parameter packs must
21677 be template parameters. */
21678 if (TREE_CODE (type
) == TYPE_PACK_EXPANSION
)
21681 /* The standard does not specifically mention types that are local
21682 to template functions or local classes, but they should be
21683 considered dependent too. For example:
21685 template <int I> void f() {
21690 The size of `E' cannot be known until the value of `I' has been
21691 determined. Therefore, `E' must be considered dependent. */
21692 scope
= TYPE_CONTEXT (type
);
21693 if (scope
&& TYPE_P (scope
))
21694 return dependent_type_p (scope
);
21695 /* Don't use type_dependent_expression_p here, as it can lead
21696 to infinite recursion trying to determine whether a lambda
21697 nested in a lambda is dependent (c++/47687). */
21698 else if (scope
&& TREE_CODE (scope
) == FUNCTION_DECL
21699 && DECL_LANG_SPECIFIC (scope
)
21700 && DECL_TEMPLATE_INFO (scope
)
21701 && (any_dependent_template_arguments_p
21702 (INNERMOST_TEMPLATE_ARGS (DECL_TI_ARGS (scope
)))))
21705 /* Other types are non-dependent. */
21709 /* Returns TRUE if TYPE is dependent, in the sense of
21710 [temp.dep.type]. Note that a NULL type is considered dependent. */
21713 dependent_type_p (tree type
)
21715 /* If there are no template parameters in scope, then there can't be
21716 any dependent types. */
21717 if (!processing_template_decl
)
21719 /* If we are not processing a template, then nobody should be
21720 providing us with a dependent type. */
21722 gcc_assert (TREE_CODE (type
) != TEMPLATE_TYPE_PARM
|| is_auto (type
));
21726 /* If the type is NULL, we have not computed a type for the entity
21727 in question; in that case, the type is dependent. */
21731 /* Erroneous types can be considered non-dependent. */
21732 if (type
== error_mark_node
)
21735 /* If we have not already computed the appropriate value for TYPE,
21737 if (!TYPE_DEPENDENT_P_VALID (type
))
21739 TYPE_DEPENDENT_P (type
) = dependent_type_p_r (type
);
21740 TYPE_DEPENDENT_P_VALID (type
) = 1;
21743 return TYPE_DEPENDENT_P (type
);
21746 /* Returns TRUE if SCOPE is a dependent scope, in which we can't do any
21747 lookup. In other words, a dependent type that is not the current
21751 dependent_scope_p (tree scope
)
21753 return (scope
&& TYPE_P (scope
) && dependent_type_p (scope
)
21754 && !currently_open_class (scope
));
21757 /* T is a SCOPE_REF; return whether we need to consider it
21758 instantiation-dependent so that we can check access at instantiation
21759 time even though we know which member it resolves to. */
21762 instantiation_dependent_scope_ref_p (tree t
)
21764 if (DECL_P (TREE_OPERAND (t
, 1))
21765 && CLASS_TYPE_P (TREE_OPERAND (t
, 0))
21766 && accessible_in_template_p (TREE_OPERAND (t
, 0),
21767 TREE_OPERAND (t
, 1)))
21773 /* Returns TRUE if the EXPRESSION is value-dependent, in the sense of
21774 [temp.dep.constexpr]. EXPRESSION is already known to be a constant
21777 /* Note that this predicate is not appropriate for general expressions;
21778 only constant expressions (that satisfy potential_constant_expression)
21779 can be tested for value dependence. */
21782 value_dependent_expression_p (tree expression
)
21784 if (!processing_template_decl
)
21787 /* A name declared with a dependent type. */
21788 if (DECL_P (expression
) && type_dependent_expression_p (expression
))
21791 switch (TREE_CODE (expression
))
21793 case IDENTIFIER_NODE
:
21794 /* A name that has not been looked up -- must be dependent. */
21797 case TEMPLATE_PARM_INDEX
:
21798 /* A non-type template parm. */
21802 /* A non-type template parm. */
21803 if (DECL_TEMPLATE_PARM_P (expression
))
21805 return value_dependent_expression_p (DECL_INITIAL (expression
));
21808 /* A constant with literal type and is initialized
21809 with an expression that is value-dependent.
21811 Note that a non-dependent parenthesized initializer will have
21812 already been replaced with its constant value, so if we see
21813 a TREE_LIST it must be dependent. */
21814 if (DECL_INITIAL (expression
)
21815 && decl_constant_var_p (expression
)
21816 && (TREE_CODE (DECL_INITIAL (expression
)) == TREE_LIST
21817 /* cp_finish_decl doesn't fold reference initializers. */
21818 || TREE_CODE (TREE_TYPE (expression
)) == REFERENCE_TYPE
21819 || value_dependent_expression_p (DECL_INITIAL (expression
))))
21823 case DYNAMIC_CAST_EXPR
:
21824 case STATIC_CAST_EXPR
:
21825 case CONST_CAST_EXPR
:
21826 case REINTERPRET_CAST_EXPR
:
21828 /* These expressions are value-dependent if the type to which
21829 the cast occurs is dependent or the expression being casted
21830 is value-dependent. */
21832 tree type
= TREE_TYPE (expression
);
21834 if (dependent_type_p (type
))
21837 /* A functional cast has a list of operands. */
21838 expression
= TREE_OPERAND (expression
, 0);
21841 /* If there are no operands, it must be an expression such
21842 as "int()". This should not happen for aggregate types
21843 because it would form non-constant expressions. */
21844 gcc_assert (cxx_dialect
>= cxx11
21845 || INTEGRAL_OR_ENUMERATION_TYPE_P (type
));
21850 if (TREE_CODE (expression
) == TREE_LIST
)
21851 return any_value_dependent_elements_p (expression
);
21853 return value_dependent_expression_p (expression
);
21857 if (SIZEOF_EXPR_TYPE_P (expression
))
21858 return dependent_type_p (TREE_TYPE (TREE_OPERAND (expression
, 0)));
21862 /* A `sizeof' expression is value-dependent if the operand is
21863 type-dependent or is a pack expansion. */
21864 expression
= TREE_OPERAND (expression
, 0);
21865 if (PACK_EXPANSION_P (expression
))
21867 else if (TYPE_P (expression
))
21868 return dependent_type_p (expression
);
21869 return instantiation_dependent_expression_p (expression
);
21871 case AT_ENCODE_EXPR
:
21872 /* An 'encode' expression is value-dependent if the operand is
21874 expression
= TREE_OPERAND (expression
, 0);
21875 return dependent_type_p (expression
);
21877 case NOEXCEPT_EXPR
:
21878 expression
= TREE_OPERAND (expression
, 0);
21879 return instantiation_dependent_expression_p (expression
);
21882 /* All instantiation-dependent expressions should also be considered
21883 value-dependent. */
21884 return instantiation_dependent_scope_ref_p (expression
);
21886 case COMPONENT_REF
:
21887 return (value_dependent_expression_p (TREE_OPERAND (expression
, 0))
21888 || value_dependent_expression_p (TREE_OPERAND (expression
, 1)));
21890 case NONTYPE_ARGUMENT_PACK
:
21891 /* A NONTYPE_ARGUMENT_PACK is value-dependent if any packed argument
21892 is value-dependent. */
21894 tree values
= ARGUMENT_PACK_ARGS (expression
);
21895 int i
, len
= TREE_VEC_LENGTH (values
);
21897 for (i
= 0; i
< len
; ++i
)
21898 if (value_dependent_expression_p (TREE_VEC_ELT (values
, i
)))
21906 tree type2
= TRAIT_EXPR_TYPE2 (expression
);
21907 return (dependent_type_p (TRAIT_EXPR_TYPE1 (expression
))
21908 || (type2
? dependent_type_p (type2
) : false));
21912 return ((value_dependent_expression_p (TREE_OPERAND (expression
, 0)))
21913 || (value_dependent_expression_p (TREE_OPERAND (expression
, 2))));
21916 return ((value_dependent_expression_p (TREE_OPERAND (expression
, 0)))
21917 || (value_dependent_expression_p (TREE_OPERAND (expression
, 1))));
21921 tree op
= TREE_OPERAND (expression
, 0);
21922 return (value_dependent_expression_p (op
)
21923 || has_value_dependent_address (op
));
21926 case REQUIRES_EXPR
:
21927 /* Treat all requires-expressions as value-dependent so
21928 we don't try to fold them. */
21932 return dependent_type_p (TREE_OPERAND (expression
, 0));
21936 tree fn
= get_callee_fndecl (expression
);
21938 if (!fn
&& value_dependent_expression_p (CALL_EXPR_FN (expression
)))
21940 nargs
= call_expr_nargs (expression
);
21941 for (i
= 0; i
< nargs
; ++i
)
21943 tree op
= CALL_EXPR_ARG (expression
, i
);
21944 /* In a call to a constexpr member function, look through the
21945 implicit ADDR_EXPR on the object argument so that it doesn't
21946 cause the call to be considered value-dependent. We also
21947 look through it in potential_constant_expression. */
21948 if (i
== 0 && fn
&& DECL_DECLARED_CONSTEXPR_P (fn
)
21949 && DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
)
21950 && TREE_CODE (op
) == ADDR_EXPR
)
21951 op
= TREE_OPERAND (op
, 0);
21952 if (value_dependent_expression_p (op
))
21958 case TEMPLATE_ID_EXPR
:
21959 /* If a TEMPLATE_ID_EXPR involves a dependent name, it will be
21961 return type_dependent_expression_p (expression
)
21962 || variable_concept_p (TREE_OPERAND (expression
, 0));
21968 if (dependent_type_p (TREE_TYPE (expression
)))
21970 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (expression
), ix
, val
)
21971 if (value_dependent_expression_p (val
))
21977 /* Treat a GNU statement expression as dependent to avoid crashing
21978 under instantiate_non_dependent_expr; it can't be constant. */
21982 /* A constant expression is value-dependent if any subexpression is
21983 value-dependent. */
21984 switch (TREE_CODE_CLASS (TREE_CODE (expression
)))
21986 case tcc_reference
:
21988 case tcc_comparison
:
21990 case tcc_expression
:
21993 int i
, len
= cp_tree_operand_length (expression
);
21995 for (i
= 0; i
< len
; i
++)
21997 tree t
= TREE_OPERAND (expression
, i
);
21999 /* In some cases, some of the operands may be missing.l
22000 (For example, in the case of PREDECREMENT_EXPR, the
22001 amount to increment by may be missing.) That doesn't
22002 make the expression dependent. */
22003 if (t
&& value_dependent_expression_p (t
))
22014 /* The expression is not value-dependent. */
22018 /* Returns TRUE if the EXPRESSION is type-dependent, in the sense of
22019 [temp.dep.expr]. Note that an expression with no type is
22020 considered dependent. Other parts of the compiler arrange for an
22021 expression with type-dependent subexpressions to have no type, so
22022 this function doesn't have to be fully recursive. */
22025 type_dependent_expression_p (tree expression
)
22027 if (!processing_template_decl
)
22030 if (expression
== NULL_TREE
|| expression
== error_mark_node
)
22033 /* An unresolved name is always dependent. */
22034 if (identifier_p (expression
)
22035 || TREE_CODE (expression
) == USING_DECL
22036 || TREE_CODE (expression
) == WILDCARD_DECL
)
22039 /* Some expression forms are never type-dependent. */
22040 if (TREE_CODE (expression
) == PSEUDO_DTOR_EXPR
22041 || TREE_CODE (expression
) == SIZEOF_EXPR
22042 || TREE_CODE (expression
) == ALIGNOF_EXPR
22043 || TREE_CODE (expression
) == AT_ENCODE_EXPR
22044 || TREE_CODE (expression
) == NOEXCEPT_EXPR
22045 || TREE_CODE (expression
) == TRAIT_EXPR
22046 || TREE_CODE (expression
) == TYPEID_EXPR
22047 || TREE_CODE (expression
) == DELETE_EXPR
22048 || TREE_CODE (expression
) == VEC_DELETE_EXPR
22049 || TREE_CODE (expression
) == THROW_EXPR
22050 || TREE_CODE (expression
) == REQUIRES_EXPR
)
22053 /* The types of these expressions depends only on the type to which
22054 the cast occurs. */
22055 if (TREE_CODE (expression
) == DYNAMIC_CAST_EXPR
22056 || TREE_CODE (expression
) == STATIC_CAST_EXPR
22057 || TREE_CODE (expression
) == CONST_CAST_EXPR
22058 || TREE_CODE (expression
) == REINTERPRET_CAST_EXPR
22059 || TREE_CODE (expression
) == IMPLICIT_CONV_EXPR
22060 || TREE_CODE (expression
) == CAST_EXPR
)
22061 return dependent_type_p (TREE_TYPE (expression
));
22063 /* The types of these expressions depends only on the type created
22064 by the expression. */
22065 if (TREE_CODE (expression
) == NEW_EXPR
22066 || TREE_CODE (expression
) == VEC_NEW_EXPR
)
22068 /* For NEW_EXPR tree nodes created inside a template, either
22069 the object type itself or a TREE_LIST may appear as the
22071 tree type
= TREE_OPERAND (expression
, 1);
22072 if (TREE_CODE (type
) == TREE_LIST
)
22073 /* This is an array type. We need to check array dimensions
22075 return dependent_type_p (TREE_VALUE (TREE_PURPOSE (type
)))
22076 || value_dependent_expression_p
22077 (TREE_OPERAND (TREE_VALUE (type
), 1));
22079 return dependent_type_p (type
);
22082 if (TREE_CODE (expression
) == SCOPE_REF
)
22084 tree scope
= TREE_OPERAND (expression
, 0);
22085 tree name
= TREE_OPERAND (expression
, 1);
22087 /* 14.6.2.2 [temp.dep.expr]: An id-expression is type-dependent if it
22088 contains an identifier associated by name lookup with one or more
22089 declarations declared with a dependent type, or...a
22090 nested-name-specifier or qualified-id that names a member of an
22091 unknown specialization. */
22092 return (type_dependent_expression_p (name
)
22093 || dependent_scope_p (scope
));
22096 if (TREE_CODE (expression
) == FUNCTION_DECL
22097 && DECL_LANG_SPECIFIC (expression
)
22098 && DECL_TEMPLATE_INFO (expression
)
22099 && (any_dependent_template_arguments_p
22100 (INNERMOST_TEMPLATE_ARGS (DECL_TI_ARGS (expression
)))))
22103 if (TREE_CODE (expression
) == TEMPLATE_DECL
22104 && !DECL_TEMPLATE_TEMPLATE_PARM_P (expression
))
22107 if (TREE_CODE (expression
) == STMT_EXPR
)
22108 expression
= stmt_expr_value_expr (expression
);
22110 if (BRACE_ENCLOSED_INITIALIZER_P (expression
))
22115 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (expression
), i
, elt
)
22117 if (type_dependent_expression_p (elt
))
22123 /* A static data member of the current instantiation with incomplete
22124 array type is type-dependent, as the definition and specializations
22125 can have different bounds. */
22126 if (VAR_P (expression
)
22127 && DECL_CLASS_SCOPE_P (expression
)
22128 && dependent_type_p (DECL_CONTEXT (expression
))
22129 && VAR_HAD_UNKNOWN_BOUND (expression
))
22132 /* An array of unknown bound depending on a variadic parameter, eg:
22134 template<typename... Args>
22135 void foo (Args... args)
22137 int arr[] = { args... };
22140 template<int... vals>
22143 int arr[] = { vals... };
22146 If the array has no length and has an initializer, it must be that
22147 we couldn't determine its length in cp_complete_array_type because
22148 it is dependent. */
22149 if (VAR_P (expression
)
22150 && TREE_CODE (TREE_TYPE (expression
)) == ARRAY_TYPE
22151 && !TYPE_DOMAIN (TREE_TYPE (expression
))
22152 && DECL_INITIAL (expression
))
22155 /* A variable template specialization is type-dependent if it has any
22156 dependent template arguments. */
22157 if (VAR_P (expression
)
22158 && DECL_LANG_SPECIFIC (expression
)
22159 && DECL_TEMPLATE_INFO (expression
)
22160 && variable_template_p (DECL_TI_TEMPLATE (expression
)))
22161 return any_dependent_template_arguments_p (DECL_TI_ARGS (expression
));
22163 /* Always dependent, on the number of arguments if nothing else. */
22164 if (TREE_CODE (expression
) == EXPR_PACK_EXPANSION
)
22167 if (TREE_TYPE (expression
) == unknown_type_node
)
22169 if (TREE_CODE (expression
) == ADDR_EXPR
)
22170 return type_dependent_expression_p (TREE_OPERAND (expression
, 0));
22171 if (TREE_CODE (expression
) == COMPONENT_REF
22172 || TREE_CODE (expression
) == OFFSET_REF
)
22174 if (type_dependent_expression_p (TREE_OPERAND (expression
, 0)))
22176 expression
= TREE_OPERAND (expression
, 1);
22177 if (identifier_p (expression
))
22180 /* SCOPE_REF with non-null TREE_TYPE is always non-dependent. */
22181 if (TREE_CODE (expression
) == SCOPE_REF
)
22184 if (BASELINK_P (expression
))
22186 if (BASELINK_OPTYPE (expression
)
22187 && dependent_type_p (BASELINK_OPTYPE (expression
)))
22189 expression
= BASELINK_FUNCTIONS (expression
);
22192 if (TREE_CODE (expression
) == TEMPLATE_ID_EXPR
)
22194 if (any_dependent_template_arguments_p
22195 (TREE_OPERAND (expression
, 1)))
22197 expression
= TREE_OPERAND (expression
, 0);
22198 if (identifier_p (expression
))
22202 gcc_assert (TREE_CODE (expression
) == OVERLOAD
22203 || TREE_CODE (expression
) == FUNCTION_DECL
);
22207 if (type_dependent_expression_p (OVL_CURRENT (expression
)))
22209 expression
= OVL_NEXT (expression
);
22214 gcc_assert (TREE_CODE (expression
) != TYPE_DECL
);
22216 return (dependent_type_p (TREE_TYPE (expression
)));
22219 /* walk_tree callback function for instantiation_dependent_expression_p,
22220 below. Returns non-zero if a dependent subexpression is found. */
22223 instantiation_dependent_r (tree
*tp
, int *walk_subtrees
,
22228 /* We don't have to worry about decltype currently because decltype
22229 of an instantiation-dependent expr is a dependent type. This
22230 might change depending on the resolution of DR 1172. */
22231 *walk_subtrees
= false;
22234 enum tree_code code
= TREE_CODE (*tp
);
22237 /* Don't treat an argument list as dependent just because it has no
22245 /* A constant with a dependent initializer is dependent. */
22246 if (value_dependent_expression_p (*tp
))
22250 case TEMPLATE_PARM_INDEX
:
22253 /* Handle expressions with type operands. */
22257 case AT_ENCODE_EXPR
:
22259 tree op
= TREE_OPERAND (*tp
, 0);
22260 if (code
== SIZEOF_EXPR
&& SIZEOF_EXPR_TYPE_P (*tp
))
22261 op
= TREE_TYPE (op
);
22264 if (dependent_type_p (op
))
22268 *walk_subtrees
= false;
22276 if (value_dependent_expression_p (*tp
))
22278 *walk_subtrees
= false;
22281 case COMPONENT_REF
:
22282 if (identifier_p (TREE_OPERAND (*tp
, 1)))
22283 /* In a template, finish_class_member_access_expr creates a
22284 COMPONENT_REF with an IDENTIFIER_NODE for op1 even if it isn't
22285 type-dependent, so that we can check access control at
22286 instantiation time (PR 42277). See also Core issue 1273. */
22291 if (instantiation_dependent_scope_ref_p (*tp
))
22296 /* Treat statement-expressions as dependent. */
22300 /* Treat requires-expressions as dependent. */
22301 case REQUIRES_EXPR
:
22305 /* Treat calls to function concepts as dependent. */
22306 if (function_concept_check_p (*tp
))
22310 case TEMPLATE_ID_EXPR
:
22311 /* And variable concepts. */
22312 if (variable_concept_p (TREE_OPERAND (*tp
, 0)))
22320 if (type_dependent_expression_p (*tp
))
22326 /* Returns TRUE if the EXPRESSION is instantiation-dependent, in the
22327 sense defined by the ABI:
22329 "An expression is instantiation-dependent if it is type-dependent
22330 or value-dependent, or it has a subexpression that is type-dependent
22331 or value-dependent." */
22334 instantiation_dependent_expression_p (tree expression
)
22338 if (!processing_template_decl
)
22341 if (expression
== error_mark_node
)
22344 result
= cp_walk_tree_without_duplicates (&expression
,
22345 instantiation_dependent_r
, NULL
);
22346 return result
!= NULL_TREE
;
22349 /* Like type_dependent_expression_p, but it also works while not processing
22350 a template definition, i.e. during substitution or mangling. */
22353 type_dependent_expression_p_push (tree expr
)
22356 ++processing_template_decl
;
22357 b
= type_dependent_expression_p (expr
);
22358 --processing_template_decl
;
22362 /* Returns TRUE if ARGS contains a type-dependent expression. */
22365 any_type_dependent_arguments_p (const vec
<tree
, va_gc
> *args
)
22370 FOR_EACH_VEC_SAFE_ELT (args
, i
, arg
)
22372 if (type_dependent_expression_p (arg
))
22378 /* Returns TRUE if LIST (a TREE_LIST whose TREE_VALUEs are
22379 expressions) contains any type-dependent expressions. */
22382 any_type_dependent_elements_p (const_tree list
)
22384 for (; list
; list
= TREE_CHAIN (list
))
22385 if (type_dependent_expression_p (TREE_VALUE (list
)))
22391 /* Returns TRUE if LIST (a TREE_LIST whose TREE_VALUEs are
22392 expressions) contains any value-dependent expressions. */
22395 any_value_dependent_elements_p (const_tree list
)
22397 for (; list
; list
= TREE_CHAIN (list
))
22398 if (value_dependent_expression_p (TREE_VALUE (list
)))
22404 /* Returns TRUE if the ARG (a template argument) is dependent. */
22407 dependent_template_arg_p (tree arg
)
22409 if (!processing_template_decl
)
22412 /* Assume a template argument that was wrongly written by the user
22413 is dependent. This is consistent with what
22414 any_dependent_template_arguments_p [that calls this function]
22416 if (!arg
|| arg
== error_mark_node
)
22419 if (TREE_CODE (arg
) == ARGUMENT_PACK_SELECT
)
22420 arg
= ARGUMENT_PACK_SELECT_ARG (arg
);
22422 if (TREE_CODE (arg
) == TEMPLATE_DECL
22423 || TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
)
22424 return dependent_template_p (arg
);
22425 else if (ARGUMENT_PACK_P (arg
))
22427 tree args
= ARGUMENT_PACK_ARGS (arg
);
22428 int i
, len
= TREE_VEC_LENGTH (args
);
22429 for (i
= 0; i
< len
; ++i
)
22431 if (dependent_template_arg_p (TREE_VEC_ELT (args
, i
)))
22437 else if (TYPE_P (arg
))
22438 return dependent_type_p (arg
);
22440 return (type_dependent_expression_p (arg
)
22441 || value_dependent_expression_p (arg
));
22444 /* Returns true if ARGS (a collection of template arguments) contains
22445 any types that require structural equality testing. */
22448 any_template_arguments_need_structural_equality_p (tree args
)
22455 if (args
== error_mark_node
)
22458 for (i
= 0; i
< TMPL_ARGS_DEPTH (args
); ++i
)
22460 tree level
= TMPL_ARGS_LEVEL (args
, i
+ 1);
22461 for (j
= 0; j
< TREE_VEC_LENGTH (level
); ++j
)
22463 tree arg
= TREE_VEC_ELT (level
, j
);
22464 tree packed_args
= NULL_TREE
;
22467 if (ARGUMENT_PACK_P (arg
))
22469 /* Look inside the argument pack. */
22470 packed_args
= ARGUMENT_PACK_ARGS (arg
);
22471 len
= TREE_VEC_LENGTH (packed_args
);
22474 for (k
= 0; k
< len
; ++k
)
22477 arg
= TREE_VEC_ELT (packed_args
, k
);
22479 if (error_operand_p (arg
))
22481 else if (TREE_CODE (arg
) == TEMPLATE_DECL
)
22483 else if (TYPE_P (arg
) && TYPE_STRUCTURAL_EQUALITY_P (arg
))
22485 else if (!TYPE_P (arg
) && TREE_TYPE (arg
)
22486 && TYPE_STRUCTURAL_EQUALITY_P (TREE_TYPE (arg
)))
22495 /* Returns true if ARGS (a collection of template arguments) contains
22496 any dependent arguments. */
22499 any_dependent_template_arguments_p (const_tree args
)
22506 if (args
== error_mark_node
)
22509 for (i
= 0; i
< TMPL_ARGS_DEPTH (args
); ++i
)
22511 const_tree level
= TMPL_ARGS_LEVEL (args
, i
+ 1);
22512 for (j
= 0; j
< TREE_VEC_LENGTH (level
); ++j
)
22513 if (dependent_template_arg_p (TREE_VEC_ELT (level
, j
)))
22520 /* Returns TRUE if the template TMPL is dependent. */
22523 dependent_template_p (tree tmpl
)
22525 if (TREE_CODE (tmpl
) == OVERLOAD
)
22529 if (dependent_template_p (OVL_CURRENT (tmpl
)))
22531 tmpl
= OVL_NEXT (tmpl
);
22536 /* Template template parameters are dependent. */
22537 if (DECL_TEMPLATE_TEMPLATE_PARM_P (tmpl
)
22538 || TREE_CODE (tmpl
) == TEMPLATE_TEMPLATE_PARM
)
22540 /* So are names that have not been looked up. */
22541 if (TREE_CODE (tmpl
) == SCOPE_REF
|| identifier_p (tmpl
))
22543 /* So are member templates of dependent classes. */
22544 if (TYPE_P (CP_DECL_CONTEXT (tmpl
)))
22545 return dependent_type_p (DECL_CONTEXT (tmpl
));
22549 /* Returns TRUE if the specialization TMPL<ARGS> is dependent. */
22552 dependent_template_id_p (tree tmpl
, tree args
)
22554 return (dependent_template_p (tmpl
)
22555 || any_dependent_template_arguments_p (args
));
22558 /* Returns TRUE if OMP_FOR with DECLV, INITV, CONDV and INCRV vectors
22562 dependent_omp_for_p (tree declv
, tree initv
, tree condv
, tree incrv
)
22566 if (!processing_template_decl
)
22569 for (i
= 0; i
< TREE_VEC_LENGTH (declv
); i
++)
22571 tree decl
= TREE_VEC_ELT (declv
, i
);
22572 tree init
= TREE_VEC_ELT (initv
, i
);
22573 tree cond
= TREE_VEC_ELT (condv
, i
);
22574 tree incr
= TREE_VEC_ELT (incrv
, i
);
22576 if (type_dependent_expression_p (decl
))
22579 if (init
&& type_dependent_expression_p (init
))
22582 if (type_dependent_expression_p (cond
))
22585 if (COMPARISON_CLASS_P (cond
)
22586 && (type_dependent_expression_p (TREE_OPERAND (cond
, 0))
22587 || type_dependent_expression_p (TREE_OPERAND (cond
, 1))))
22590 if (TREE_CODE (incr
) == MODOP_EXPR
)
22592 if (type_dependent_expression_p (TREE_OPERAND (incr
, 0))
22593 || type_dependent_expression_p (TREE_OPERAND (incr
, 2)))
22596 else if (type_dependent_expression_p (incr
))
22598 else if (TREE_CODE (incr
) == MODIFY_EXPR
)
22600 if (type_dependent_expression_p (TREE_OPERAND (incr
, 0)))
22602 else if (BINARY_CLASS_P (TREE_OPERAND (incr
, 1)))
22604 tree t
= TREE_OPERAND (incr
, 1);
22605 if (type_dependent_expression_p (TREE_OPERAND (t
, 0))
22606 || type_dependent_expression_p (TREE_OPERAND (t
, 1)))
22615 /* TYPE is a TYPENAME_TYPE. Returns the ordinary TYPE to which the
22616 TYPENAME_TYPE corresponds. Returns the original TYPENAME_TYPE if
22617 no such TYPE can be found. Note that this function peers inside
22618 uninstantiated templates and therefore should be used only in
22619 extremely limited situations. ONLY_CURRENT_P restricts this
22620 peering to the currently open classes hierarchy (which is required
22621 when comparing types). */
22624 resolve_typename_type (tree type
, bool only_current_p
)
22633 gcc_assert (TREE_CODE (type
) == TYPENAME_TYPE
);
22635 scope
= TYPE_CONTEXT (type
);
22636 /* Usually the non-qualified identifier of a TYPENAME_TYPE is
22637 TYPE_IDENTIFIER (type). But when 'type' is a typedef variant of
22638 a TYPENAME_TYPE node, then TYPE_NAME (type) is set to the TYPE_DECL representing
22639 the typedef. In that case TYPE_IDENTIFIER (type) is not the non-qualified
22640 identifier of the TYPENAME_TYPE anymore.
22641 So by getting the TYPE_IDENTIFIER of the _main declaration_ of the
22642 TYPENAME_TYPE instead, we avoid messing up with a possible
22643 typedef variant case. */
22644 name
= TYPE_IDENTIFIER (TYPE_MAIN_VARIANT (type
));
22646 /* If the SCOPE is itself a TYPENAME_TYPE, then we need to resolve
22647 it first before we can figure out what NAME refers to. */
22648 if (TREE_CODE (scope
) == TYPENAME_TYPE
)
22650 if (TYPENAME_IS_RESOLVING_P (scope
))
22651 /* Given a class template A with a dependent base with nested type C,
22652 typedef typename A::C::C C will land us here, as trying to resolve
22653 the initial A::C leads to the local C typedef, which leads back to
22654 A::C::C. So we break the recursion now. */
22657 scope
= resolve_typename_type (scope
, only_current_p
);
22659 /* If we don't know what SCOPE refers to, then we cannot resolve the
22661 if (TREE_CODE (scope
) == TYPENAME_TYPE
)
22663 /* If the SCOPE is a template type parameter, we have no way of
22664 resolving the name. */
22665 if (TREE_CODE (scope
) == TEMPLATE_TYPE_PARM
)
22667 /* If the SCOPE is not the current instantiation, there's no reason
22668 to look inside it. */
22669 if (only_current_p
&& !currently_open_class (scope
))
22671 /* If this is a typedef, we don't want to look inside (c++/11987). */
22672 if (typedef_variant_p (type
))
22674 /* If SCOPE isn't the template itself, it will not have a valid
22675 TYPE_FIELDS list. */
22676 if (CLASS_TYPE_P (scope
)
22677 && same_type_p (scope
, CLASSTYPE_PRIMARY_TEMPLATE_TYPE (scope
)))
22678 /* scope is either the template itself or a compatible instantiation
22679 like X<T>, so look up the name in the original template. */
22680 scope
= CLASSTYPE_PRIMARY_TEMPLATE_TYPE (scope
);
22682 /* scope is a partial instantiation, so we can't do the lookup or we
22683 will lose the template arguments. */
22685 /* Enter the SCOPE so that name lookup will be resolved as if we
22686 were in the class definition. In particular, SCOPE will no
22687 longer be considered a dependent type. */
22688 pushed_scope
= push_scope (scope
);
22689 /* Look up the declaration. */
22690 decl
= lookup_member (scope
, name
, /*protect=*/0, /*want_type=*/true,
22691 tf_warning_or_error
);
22693 result
= NULL_TREE
;
22695 /* For a TYPENAME_TYPE like "typename X::template Y<T>", we want to
22696 find a TEMPLATE_DECL. Otherwise, we want to find a TYPE_DECL. */
22699 else if (identifier_p (TYPENAME_TYPE_FULLNAME (type
))
22700 && TREE_CODE (decl
) == TYPE_DECL
)
22702 result
= TREE_TYPE (decl
);
22703 if (result
== error_mark_node
)
22704 result
= NULL_TREE
;
22706 else if (TREE_CODE (TYPENAME_TYPE_FULLNAME (type
)) == TEMPLATE_ID_EXPR
22707 && DECL_CLASS_TEMPLATE_P (decl
))
22711 /* Obtain the template and the arguments. */
22712 tmpl
= TREE_OPERAND (TYPENAME_TYPE_FULLNAME (type
), 0);
22713 args
= TREE_OPERAND (TYPENAME_TYPE_FULLNAME (type
), 1);
22714 /* Instantiate the template. */
22715 result
= lookup_template_class (tmpl
, args
, NULL_TREE
, NULL_TREE
,
22716 /*entering_scope=*/0,
22717 tf_error
| tf_user
);
22718 if (result
== error_mark_node
)
22719 result
= NULL_TREE
;
22722 /* Leave the SCOPE. */
22724 pop_scope (pushed_scope
);
22726 /* If we failed to resolve it, return the original typename. */
22730 /* If lookup found a typename type, resolve that too. */
22731 if (TREE_CODE (result
) == TYPENAME_TYPE
&& !TYPENAME_IS_RESOLVING_P (result
))
22733 /* Ill-formed programs can cause infinite recursion here, so we
22734 must catch that. */
22735 TYPENAME_IS_RESOLVING_P (type
) = 1;
22736 result
= resolve_typename_type (result
, only_current_p
);
22737 TYPENAME_IS_RESOLVING_P (type
) = 0;
22740 /* Qualify the resulting type. */
22741 quals
= cp_type_quals (type
);
22743 result
= cp_build_qualified_type (result
, cp_type_quals (result
) | quals
);
22748 /* EXPR is an expression which is not type-dependent. Return a proxy
22749 for EXPR that can be used to compute the types of larger
22750 expressions containing EXPR. */
22753 build_non_dependent_expr (tree expr
)
22757 #ifdef ENABLE_CHECKING
22758 /* Try to get a constant value for all non-dependent expressions in
22759 order to expose bugs in *_dependent_expression_p and constexpr. */
22760 if (cxx_dialect
>= cxx11
)
22761 fold_non_dependent_expr (expr
);
22764 /* Preserve OVERLOADs; the functions must be available to resolve
22767 if (TREE_CODE (inner_expr
) == STMT_EXPR
)
22768 inner_expr
= stmt_expr_value_expr (inner_expr
);
22769 if (TREE_CODE (inner_expr
) == ADDR_EXPR
)
22770 inner_expr
= TREE_OPERAND (inner_expr
, 0);
22771 if (TREE_CODE (inner_expr
) == COMPONENT_REF
)
22772 inner_expr
= TREE_OPERAND (inner_expr
, 1);
22773 if (is_overloaded_fn (inner_expr
)
22774 || TREE_CODE (inner_expr
) == OFFSET_REF
)
22776 /* There is no need to return a proxy for a variable. */
22779 /* Preserve string constants; conversions from string constants to
22780 "char *" are allowed, even though normally a "const char *"
22781 cannot be used to initialize a "char *". */
22782 if (TREE_CODE (expr
) == STRING_CST
)
22784 /* Preserve void and arithmetic constants, as an optimization -- there is no
22785 reason to create a new node. */
22786 if (TREE_CODE (expr
) == VOID_CST
22787 || TREE_CODE (expr
) == INTEGER_CST
22788 || TREE_CODE (expr
) == REAL_CST
)
22790 /* Preserve THROW_EXPRs -- all throw-expressions have type "void".
22791 There is at least one place where we want to know that a
22792 particular expression is a throw-expression: when checking a ?:
22793 expression, there are special rules if the second or third
22794 argument is a throw-expression. */
22795 if (TREE_CODE (expr
) == THROW_EXPR
)
22798 /* Don't wrap an initializer list, we need to be able to look inside. */
22799 if (BRACE_ENCLOSED_INITIALIZER_P (expr
))
22802 /* Don't wrap a dummy object, we need to be able to test for it. */
22803 if (is_dummy_object (expr
))
22806 if (TREE_CODE (expr
) == COND_EXPR
)
22807 return build3 (COND_EXPR
,
22809 TREE_OPERAND (expr
, 0),
22810 (TREE_OPERAND (expr
, 1)
22811 ? build_non_dependent_expr (TREE_OPERAND (expr
, 1))
22812 : build_non_dependent_expr (TREE_OPERAND (expr
, 0))),
22813 build_non_dependent_expr (TREE_OPERAND (expr
, 2)));
22814 if (TREE_CODE (expr
) == COMPOUND_EXPR
22815 && !COMPOUND_EXPR_OVERLOADED (expr
))
22816 return build2 (COMPOUND_EXPR
,
22818 TREE_OPERAND (expr
, 0),
22819 build_non_dependent_expr (TREE_OPERAND (expr
, 1)));
22821 /* If the type is unknown, it can't really be non-dependent */
22822 gcc_assert (TREE_TYPE (expr
) != unknown_type_node
);
22824 /* Otherwise, build a NON_DEPENDENT_EXPR. */
22825 return build1 (NON_DEPENDENT_EXPR
, TREE_TYPE (expr
), expr
);
22828 /* ARGS is a vector of expressions as arguments to a function call.
22829 Replace the arguments with equivalent non-dependent expressions.
22830 This modifies ARGS in place. */
22833 make_args_non_dependent (vec
<tree
, va_gc
> *args
)
22838 FOR_EACH_VEC_SAFE_ELT (args
, ix
, arg
)
22840 tree newarg
= build_non_dependent_expr (arg
);
22842 (*args
)[ix
] = newarg
;
22846 /* Returns a type which represents 'auto' or 'decltype(auto)'. We use a
22847 TEMPLATE_TYPE_PARM with a level one deeper than the actual template
22851 make_auto_1 (tree name
)
22853 tree au
= cxx_make_type (TEMPLATE_TYPE_PARM
);
22854 TYPE_NAME (au
) = build_decl (input_location
,
22855 TYPE_DECL
, name
, au
);
22856 TYPE_STUB_DECL (au
) = TYPE_NAME (au
);
22857 TEMPLATE_TYPE_PARM_INDEX (au
) = build_template_parm_index
22858 (0, processing_template_decl
+ 1, processing_template_decl
+ 1,
22859 TYPE_NAME (au
), NULL_TREE
);
22860 TYPE_CANONICAL (au
) = canonical_type_parameter (au
);
22861 DECL_ARTIFICIAL (TYPE_NAME (au
)) = 1;
22862 SET_DECL_TEMPLATE_PARM_P (TYPE_NAME (au
));
22868 make_decltype_auto (void)
22870 return make_auto_1 (get_identifier ("decltype(auto)"));
22876 return make_auto_1 (get_identifier ("auto"));
22879 /* Given type ARG, return std::initializer_list<ARG>. */
22884 tree std_init_list
= namespace_binding
22885 (get_identifier ("initializer_list"), std_node
);
22887 if (!std_init_list
|| !DECL_CLASS_TEMPLATE_P (std_init_list
))
22889 error ("deducing from brace-enclosed initializer list requires "
22890 "#include <initializer_list>");
22891 return error_mark_node
;
22893 argvec
= make_tree_vec (1);
22894 TREE_VEC_ELT (argvec
, 0) = arg
;
22895 return lookup_template_class (std_init_list
, argvec
, NULL_TREE
,
22896 NULL_TREE
, 0, tf_warning_or_error
);
22899 /* Replace auto in TYPE with std::initializer_list<auto>. */
22902 listify_autos (tree type
, tree auto_node
)
22904 tree init_auto
= listify (auto_node
);
22905 tree argvec
= make_tree_vec (1);
22906 TREE_VEC_ELT (argvec
, 0) = init_auto
;
22907 if (processing_template_decl
)
22908 argvec
= add_to_template_args (current_template_args (), argvec
);
22909 return tsubst (type
, argvec
, tf_warning_or_error
, NULL_TREE
);
22912 /* Replace occurrences of 'auto' in TYPE with the appropriate type deduced
22913 from INIT. AUTO_NODE is the TEMPLATE_TYPE_PARM used for 'auto' in TYPE. */
22916 do_auto_deduction (tree type
, tree init
, tree auto_node
)
22918 return do_auto_deduction (type
, init
, auto_node
,
22919 tf_warning_or_error
,
22923 /* Replace occurrences of 'auto' in TYPE with the appropriate type deduced
22924 from INIT. AUTO_NODE is the TEMPLATE_TYPE_PARM used for 'auto' in TYPE.
22925 The CONTEXT determines the context in which auto deduction is performed
22926 and is used to control error diagnostics. */
22929 do_auto_deduction (tree type
, tree init
, tree auto_node
,
22930 tsubst_flags_t complain
, auto_deduction_context context
)
22934 if (init
== error_mark_node
)
22935 return error_mark_node
;
22937 if (type_dependent_expression_p (init
))
22938 /* Defining a subset of type-dependent expressions that we can deduce
22939 from ahead of time isn't worth the trouble. */
22942 /* [dcl.spec.auto]: Obtain P from T by replacing the occurrences of auto
22943 with either a new invented type template parameter U or, if the
22944 initializer is a braced-init-list (8.5.4), with
22945 std::initializer_list<U>. */
22946 if (BRACE_ENCLOSED_INITIALIZER_P (init
))
22948 if (!DIRECT_LIST_INIT_P (init
))
22949 type
= listify_autos (type
, auto_node
);
22950 else if (CONSTRUCTOR_NELTS (init
) == 1)
22951 init
= CONSTRUCTOR_ELT (init
, 0)->value
;
22954 if (complain
& tf_warning_or_error
)
22956 if (permerror (input_location
, "direct-list-initialization of "
22957 "%<auto%> requires exactly one element"))
22958 inform (input_location
,
22959 "for deduction to %<std::initializer_list%>, use copy-"
22960 "list-initialization (i.e. add %<=%> before the %<{%>)");
22962 type
= listify_autos (type
, auto_node
);
22966 init
= resolve_nondeduced_context (init
);
22968 targs
= make_tree_vec (1);
22969 if (AUTO_IS_DECLTYPE (auto_node
))
22971 bool id
= (DECL_P (init
) || (TREE_CODE (init
) == COMPONENT_REF
22972 && !REF_PARENTHESIZED_P (init
)));
22973 TREE_VEC_ELT (targs
, 0)
22974 = finish_decltype_type (init
, id
, tf_warning_or_error
);
22975 if (type
!= auto_node
)
22977 if (complain
& tf_error
)
22978 error ("%qT as type rather than plain %<decltype(auto)%>", type
);
22979 return error_mark_node
;
22984 tree parms
= build_tree_list (NULL_TREE
, type
);
22985 tree tparms
= make_tree_vec (1);
22988 TREE_VEC_ELT (tparms
, 0)
22989 = build_tree_list (NULL_TREE
, TYPE_NAME (auto_node
));
22990 val
= type_unification_real (tparms
, targs
, parms
, &init
, 1, 0,
22991 DEDUCE_CALL
, LOOKUP_NORMAL
,
22992 NULL
, /*explain_p=*/false);
22995 if (processing_template_decl
)
22996 /* Try again at instantiation time. */
22998 if (type
&& type
!= error_mark_node
22999 && (complain
& tf_error
))
23000 /* If type is error_mark_node a diagnostic must have been
23001 emitted by now. Also, having a mention to '<type error>'
23002 in the diagnostic is not really useful to the user. */
23004 if (cfun
&& auto_node
== current_function_auto_return_pattern
23005 && LAMBDA_FUNCTION_P (current_function_decl
))
23006 error ("unable to deduce lambda return type from %qE", init
);
23008 error ("unable to deduce %qT from %qE", type
, init
);
23010 return error_mark_node
;
23014 /* If the list of declarators contains more than one declarator, the type
23015 of each declared variable is determined as described above. If the
23016 type deduced for the template parameter U is not the same in each
23017 deduction, the program is ill-formed. */
23018 if (TREE_TYPE (auto_node
)
23019 && !same_type_p (TREE_TYPE (auto_node
), TREE_VEC_ELT (targs
, 0)))
23021 if (cfun
&& auto_node
== current_function_auto_return_pattern
23022 && LAMBDA_FUNCTION_P (current_function_decl
))
23023 error ("inconsistent types %qT and %qT deduced for "
23024 "lambda return type", TREE_TYPE (auto_node
),
23025 TREE_VEC_ELT (targs
, 0));
23027 error ("inconsistent deduction for %qT: %qT and then %qT",
23028 auto_node
, TREE_TYPE (auto_node
), TREE_VEC_ELT (targs
, 0));
23029 return error_mark_node
;
23031 if (context
!= adc_requirement
)
23032 TREE_TYPE (auto_node
) = TREE_VEC_ELT (targs
, 0);
23034 /* Check any placeholder constraints against the deduced type. */
23035 if (flag_concepts
&& !processing_template_decl
)
23036 if (tree constr
= PLACEHOLDER_TYPE_CONSTRAINTS (auto_node
))
23038 /* Use the deduced type to check the associated constraints. */
23039 if (!constraints_satisfied_p (constr
, targs
))
23041 if (complain
& tf_warning_or_error
)
23045 case adc_unspecified
:
23046 error("placeholder constraints not satisfied");
23048 case adc_variable_type
:
23049 error ("deduced initializer does not satisfy "
23050 "placeholder constraints");
23052 case adc_return_type
:
23053 error ("deduced return type does not satisfy "
23054 "placeholder constraints");
23056 case adc_requirement
:
23057 error ("deduced expression type does not saatisy "
23058 "placeholder constraints");
23061 diagnose_constraints (input_location
, constr
, targs
);
23063 return error_mark_node
;
23067 if (processing_template_decl
)
23068 targs
= add_to_template_args (current_template_args (), targs
);
23069 return tsubst (type
, targs
, complain
, NULL_TREE
);
23072 /* Substitutes LATE_RETURN_TYPE for 'auto' in TYPE and returns the
23076 splice_late_return_type (tree type
, tree late_return_type
)
23078 if (is_auto (type
))
23080 if (late_return_type
)
23081 return late_return_type
;
23083 tree idx
= get_template_parm_index (type
);
23084 if (TEMPLATE_PARM_LEVEL (idx
) <= processing_template_decl
)
23085 /* In an abbreviated function template we didn't know we were dealing
23086 with a function template when we saw the auto return type, so update
23087 it to have the correct level. */
23088 return make_auto_1 (TYPE_IDENTIFIER (type
));
23093 /* Returns true iff TYPE is a TEMPLATE_TYPE_PARM representing 'auto' or
23094 'decltype(auto)'. */
23097 is_auto (const_tree type
)
23099 if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
23100 && (TYPE_IDENTIFIER (type
) == get_identifier ("auto")
23101 || TYPE_IDENTIFIER (type
) == get_identifier ("decltype(auto)")))
23107 /* Returns the TEMPLATE_TYPE_PARM in TYPE representing `auto' iff TYPE contains
23108 a use of `auto'. Returns NULL_TREE otherwise. */
23111 type_uses_auto (tree type
)
23113 return find_type_usage (type
, is_auto
);
23116 /* Returns true iff TYPE is a TEMPLATE_TYPE_PARM representing 'auto',
23117 'decltype(auto)' or a concept. */
23120 is_auto_or_concept (const_tree type
)
23122 return is_auto (type
); // or concept
23125 /* Returns the TEMPLATE_TYPE_PARM in TYPE representing a generic type (`auto' or
23126 a concept identifier) iff TYPE contains a use of a generic type. Returns
23127 NULL_TREE otherwise. */
23130 type_uses_auto_or_concept (tree type
)
23132 return find_type_usage (type
, is_auto_or_concept
);
23136 /* For a given template T, return the vector of typedefs referenced
23137 in T for which access check is needed at T instantiation time.
23138 T is either a FUNCTION_DECL or a RECORD_TYPE.
23139 Those typedefs were added to T by the function
23140 append_type_to_template_for_access_check. */
23142 vec
<qualified_typedef_usage_t
, va_gc
> *
23143 get_types_needing_access_check (tree t
)
23146 vec
<qualified_typedef_usage_t
, va_gc
> *result
= NULL
;
23148 if (!t
|| t
== error_mark_node
)
23151 if (!(ti
= get_template_info (t
)))
23154 if (CLASS_TYPE_P (t
)
23155 || TREE_CODE (t
) == FUNCTION_DECL
)
23157 if (!TI_TEMPLATE (ti
))
23160 result
= TI_TYPEDEFS_NEEDING_ACCESS_CHECKING (ti
);
23166 /* Append the typedef TYPE_DECL used in template T to a list of typedefs
23167 tied to T. That list of typedefs will be access checked at
23168 T instantiation time.
23169 T is either a FUNCTION_DECL or a RECORD_TYPE.
23170 TYPE_DECL is a TYPE_DECL node representing a typedef.
23171 SCOPE is the scope through which TYPE_DECL is accessed.
23172 LOCATION is the location of the usage point of TYPE_DECL.
23174 This function is a subroutine of
23175 append_type_to_template_for_access_check. */
23178 append_type_to_template_for_access_check_1 (tree t
,
23181 location_t location
)
23183 qualified_typedef_usage_t typedef_usage
;
23186 if (!t
|| t
== error_mark_node
)
23189 gcc_assert ((TREE_CODE (t
) == FUNCTION_DECL
23190 || CLASS_TYPE_P (t
))
23192 && TREE_CODE (type_decl
) == TYPE_DECL
23195 if (!(ti
= get_template_info (t
)))
23198 gcc_assert (TI_TEMPLATE (ti
));
23200 typedef_usage
.typedef_decl
= type_decl
;
23201 typedef_usage
.context
= scope
;
23202 typedef_usage
.locus
= location
;
23204 vec_safe_push (TI_TYPEDEFS_NEEDING_ACCESS_CHECKING (ti
), typedef_usage
);
23207 /* Append TYPE_DECL to the template TEMPL.
23208 TEMPL is either a class type, a FUNCTION_DECL or a a TEMPLATE_DECL.
23209 At TEMPL instanciation time, TYPE_DECL will be checked to see
23210 if it can be accessed through SCOPE.
23211 LOCATION is the location of the usage point of TYPE_DECL.
23213 e.g. consider the following code snippet:
23220 template<class U> struct S
23222 C::myint mi; // <-- usage point of the typedef C::myint
23227 At S<char> instantiation time, we need to check the access of C::myint
23228 In other words, we need to check the access of the myint typedef through
23229 the C scope. For that purpose, this function will add the myint typedef
23230 and the scope C through which its being accessed to a list of typedefs
23231 tied to the template S. That list will be walked at template instantiation
23232 time and access check performed on each typedefs it contains.
23233 Note that this particular code snippet should yield an error because
23234 myint is private to C. */
23237 append_type_to_template_for_access_check (tree templ
,
23240 location_t location
)
23242 qualified_typedef_usage_t
*iter
;
23245 gcc_assert (type_decl
&& (TREE_CODE (type_decl
) == TYPE_DECL
));
23247 /* Make sure we don't append the type to the template twice. */
23248 FOR_EACH_VEC_SAFE_ELT (get_types_needing_access_check (templ
), i
, iter
)
23249 if (iter
->typedef_decl
== type_decl
&& scope
== iter
->context
)
23252 append_type_to_template_for_access_check_1 (templ
, type_decl
,
23256 /* Convert the generic type parameters in PARM that match the types given in the
23257 range [START_IDX, END_IDX) from the current_template_parms into generic type
23261 convert_generic_types_to_packs (tree parm
, int start_idx
, int end_idx
)
23263 tree current
= current_template_parms
;
23264 int depth
= TMPL_PARMS_DEPTH (current
);
23265 current
= INNERMOST_TEMPLATE_PARMS (current
);
23266 tree replacement
= make_tree_vec (TREE_VEC_LENGTH (current
));
23268 for (int i
= 0; i
< start_idx
; ++i
)
23269 TREE_VEC_ELT (replacement
, i
)
23270 = TREE_TYPE (TREE_VALUE (TREE_VEC_ELT (current
, i
)));
23272 for (int i
= start_idx
; i
< end_idx
; ++i
)
23274 /* Create a distinct parameter pack type from the current parm and add it
23275 to the replacement args to tsubst below into the generic function
23278 tree o
= TREE_TYPE (TREE_VALUE
23279 (TREE_VEC_ELT (current
, i
)));
23280 tree t
= copy_type (o
);
23281 TEMPLATE_TYPE_PARM_INDEX (t
)
23282 = reduce_template_parm_level (TEMPLATE_TYPE_PARM_INDEX (o
),
23284 TREE_TYPE (TEMPLATE_TYPE_DECL (t
)) = t
;
23285 TYPE_STUB_DECL (t
) = TYPE_NAME (t
) = TEMPLATE_TYPE_DECL (t
);
23286 TYPE_MAIN_VARIANT (t
) = t
;
23287 TEMPLATE_TYPE_PARAMETER_PACK (t
) = true;
23288 TYPE_CANONICAL (t
) = canonical_type_parameter (t
);
23289 TREE_VEC_ELT (replacement
, i
) = t
;
23290 TREE_VALUE (TREE_VEC_ELT (current
, i
)) = TREE_CHAIN (t
);
23293 for (int i
= end_idx
, e
= TREE_VEC_LENGTH (current
); i
< e
; ++i
)
23294 TREE_VEC_ELT (replacement
, i
)
23295 = TREE_TYPE (TREE_VALUE (TREE_VEC_ELT (current
, i
)));
23297 /* If there are more levels then build up the replacement with the outer
23300 replacement
= add_to_template_args (template_parms_to_args
23301 (TREE_CHAIN (current_template_parms
)),
23304 return tsubst (parm
, replacement
, tf_none
, NULL_TREE
);
23307 /* Entries in the decl_constraint hash table. */
23308 struct GTY((for_user
)) constr_entry
23314 /* Hashing function and equality for constraint entries. */
23315 struct constr_hasher
: ggc_ptr_hash
<constr_entry
>
23317 static hashval_t
hash (constr_entry
*e
)
23319 return (hashval_t
)DECL_UID (e
->decl
);
23322 static bool equal (constr_entry
*e1
, constr_entry
*e2
)
23324 return e1
->decl
== e2
->decl
;
23328 /* A mapping from declarations to constraint information. Note that
23329 both templates and their underlying declarations are mapped to the
23330 same constraint information.
23332 FIXME: This is defined in pt.c because garbage collection
23333 code is not being generated for constraint.cc. */
23335 static GTY (()) hash_table
<constr_hasher
> *decl_constraints
;
23337 /* Returns true iff cinfo contains a valid set of constraints.
23338 This is the case when the associated requirements have been
23339 successfully decomposed into lists of atomic constraints.
23340 That is, when the saved assumptions are not error_mark_node. */
23343 valid_constraints_p (tree cinfo
)
23345 gcc_assert (cinfo
);
23346 return CI_ASSUMPTIONS (cinfo
) != error_mark_node
;
23349 /* Returns the template constraints of declaration T. If T is not
23350 constrained, return NULL_TREE. Note that T must be non-null. */
23353 get_constraints (tree t
)
23355 gcc_assert (DECL_P (t
));
23356 if (TREE_CODE (t
) == TEMPLATE_DECL
)
23357 t
= DECL_TEMPLATE_RESULT (t
);
23358 constr_entry elt
= { t
, NULL_TREE
};
23359 constr_entry
* found
= decl_constraints
->find (&elt
);
23366 /* Associate the given constraint information CI with the declaration
23367 T. If T is a template, then the constraints are associated with
23368 its underlying declaration. Don't build associations if CI is
23372 set_constraints (tree t
, tree ci
)
23377 if (TREE_CODE (t
) == TEMPLATE_DECL
)
23378 t
= DECL_TEMPLATE_RESULT (t
);
23379 gcc_assert (!get_constraints (t
));
23380 constr_entry elt
= {t
, ci
};
23381 constr_entry
** slot
= decl_constraints
->find_slot (&elt
, INSERT
);
23382 constr_entry
* entry
= ggc_alloc
<constr_entry
> ();
23387 /* Remove the associated constraints of the declaration T. */
23390 remove_constraints (tree t
)
23392 gcc_assert (DECL_P (t
));
23393 if (TREE_CODE (t
) == TEMPLATE_DECL
)
23394 t
= DECL_TEMPLATE_RESULT (t
);
23396 constr_entry elt
= {t
, NULL_TREE
};
23397 constr_entry
** slot
= decl_constraints
->find_slot (&elt
, NO_INSERT
);
23399 decl_constraints
->clear_slot (slot
);
23402 /* Set up the hash table for constraint association. */
23405 init_constraint_processing (void)
23407 decl_constraints
= hash_table
<constr_hasher
>::create_ggc(37);
23410 /* Set up the hash tables for template instantiations. */
23413 init_template_processing (void)
23415 decl_specializations
= hash_table
<spec_hasher
>::create_ggc (37);
23416 type_specializations
= hash_table
<spec_hasher
>::create_ggc (37);
23419 /* Print stats about the template hash tables for -fstats. */
23422 print_template_statistics (void)
23424 fprintf (stderr
, "decl_specializations: size %ld, %ld elements, "
23425 "%f collisions\n", (long) decl_specializations
->size (),
23426 (long) decl_specializations
->elements (),
23427 decl_specializations
->collisions ());
23428 fprintf (stderr
, "type_specializations: size %ld, %ld elements, "
23429 "%f collisions\n", (long) type_specializations
->size (),
23430 (long) type_specializations
->elements (),
23431 type_specializations
->collisions ());
23434 #include "gt-cp-pt.h"