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 external linkage",
6477 if (!DECL_EXTERNAL_LINKAGE_P (expr
))
6479 if (complain
& tf_error
)
6480 error ("%qE is not a valid template argument for type %qT "
6481 "because object %qD has not external linkage",
6486 expr
= build_nop (type
, build_address (expr
));
6488 /* [temp.arg.nontype]/5, bullet 4
6490 For a non-type template-parameter of type pointer to function, only
6491 the function-to-pointer conversion (_conv.func_) is applied. If the
6492 template-argument represents a set of overloaded functions (or a
6493 pointer to such), the matching function is selected from the set
6495 else if (TYPE_PTRFN_P (type
))
6497 /* If the argument is a template-id, we might not have enough
6498 context information to decay the pointer. */
6499 if (!type_unknown_p (expr_type
))
6501 expr
= decay_conversion (expr
, complain
);
6502 if (expr
== error_mark_node
)
6503 return error_mark_node
;
6506 if (cxx_dialect
>= cxx11
&& integer_zerop (expr
))
6507 /* Null pointer values are OK in C++11. */
6508 return perform_qualification_conversions (type
, expr
);
6510 expr
= convert_nontype_argument_function (type
, expr
, complain
);
6511 if (!expr
|| expr
== error_mark_node
)
6514 /* [temp.arg.nontype]/5, bullet 5
6516 For a non-type template-parameter of type reference to function, no
6517 conversions apply. If the template-argument represents a set of
6518 overloaded functions, the matching function is selected from the set
6520 else if (TYPE_REFFN_P (type
))
6522 if (TREE_CODE (expr
) == ADDR_EXPR
)
6524 if (complain
& tf_error
)
6526 error ("%qE is not a valid template argument for type %qT "
6527 "because it is a pointer", expr
, type
);
6528 inform (input_location
, "try using %qE instead",
6529 TREE_OPERAND (expr
, 0));
6534 expr
= convert_nontype_argument_function (type
, expr
, complain
);
6535 if (!expr
|| expr
== error_mark_node
)
6538 expr
= build_nop (type
, build_address (expr
));
6540 /* [temp.arg.nontype]/5, bullet 6
6542 For a non-type template-parameter of type pointer to member function,
6543 no conversions apply. If the template-argument represents a set of
6544 overloaded member functions, the matching member function is selected
6545 from the set (_over.over_). */
6546 else if (TYPE_PTRMEMFUNC_P (type
))
6548 expr
= instantiate_type (type
, expr
, tf_none
);
6549 if (expr
== error_mark_node
)
6550 return error_mark_node
;
6552 /* [temp.arg.nontype] bullet 1 says the pointer to member
6553 expression must be a pointer-to-member constant. */
6554 if (!check_valid_ptrmem_cst_expr (type
, expr
, complain
))
6555 return error_mark_node
;
6557 /* There is no way to disable standard conversions in
6558 resolve_address_of_overloaded_function (called by
6559 instantiate_type). It is possible that the call succeeded by
6560 converting &B::I to &D::I (where B is a base of D), so we need
6561 to reject this conversion here.
6563 Actually, even if there was a way to disable standard conversions,
6564 it would still be better to reject them here so that we can
6565 provide a superior diagnostic. */
6566 if (!same_type_p (TREE_TYPE (expr
), type
))
6568 if (complain
& tf_error
)
6570 error ("%qE is not a valid template argument for type %qT "
6571 "because it is of type %qT", expr
, type
,
6573 /* If we are just one standard conversion off, explain. */
6574 if (can_convert_standard (type
, TREE_TYPE (expr
), complain
))
6575 inform (input_location
,
6576 "standard conversions are not allowed in this context");
6581 /* [temp.arg.nontype]/5, bullet 7
6583 For a non-type template-parameter of type pointer to data member,
6584 qualification conversions (_conv.qual_) are applied. */
6585 else if (TYPE_PTRDATAMEM_P (type
))
6587 /* [temp.arg.nontype] bullet 1 says the pointer to member
6588 expression must be a pointer-to-member constant. */
6589 if (!check_valid_ptrmem_cst_expr (type
, expr
, complain
))
6590 return error_mark_node
;
6592 expr
= perform_qualification_conversions (type
, expr
);
6593 if (expr
== error_mark_node
)
6596 else if (NULLPTR_TYPE_P (type
))
6598 if (expr
!= nullptr_node
)
6600 if (complain
& tf_error
)
6601 error ("%qE is not a valid template argument for type %qT "
6602 "because it is of type %qT", expr
, type
, TREE_TYPE (expr
));
6607 /* A template non-type parameter must be one of the above. */
6611 /* Sanity check: did we actually convert the argument to the
6613 gcc_assert (same_type_ignoring_top_level_qualifiers_p
6614 (type
, TREE_TYPE (expr
)));
6615 return convert_from_reference (expr
);
6618 /* Subroutine of coerce_template_template_parms, which returns 1 if
6619 PARM_PARM and ARG_PARM match using the rule for the template
6620 parameters of template template parameters. Both PARM and ARG are
6621 template parameters; the rest of the arguments are the same as for
6622 coerce_template_template_parms.
6625 coerce_template_template_parm (tree parm
,
6627 tsubst_flags_t complain
,
6631 if (arg
== NULL_TREE
|| error_operand_p (arg
)
6632 || parm
== NULL_TREE
|| error_operand_p (parm
))
6635 if (TREE_CODE (arg
) != TREE_CODE (parm
))
6638 switch (TREE_CODE (parm
))
6641 /* We encounter instantiations of templates like
6642 template <template <template <class> class> class TT>
6645 tree parmparm
= DECL_INNERMOST_TEMPLATE_PARMS (parm
);
6646 tree argparm
= DECL_INNERMOST_TEMPLATE_PARMS (arg
);
6648 if (!coerce_template_template_parms
6649 (parmparm
, argparm
, complain
, in_decl
, outer_args
))
6655 if (TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (arg
))
6656 && !TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (parm
)))
6657 /* Argument is a parameter pack but parameter is not. */
6662 /* The tsubst call is used to handle cases such as
6664 template <int> class C {};
6665 template <class T, template <T> class TT> class D {};
6668 i.e. the parameter list of TT depends on earlier parameters. */
6669 if (!uses_template_parms (TREE_TYPE (arg
)))
6671 tree t
= tsubst (TREE_TYPE (parm
), outer_args
, complain
, in_decl
);
6672 if (!uses_template_parms (t
)
6673 && !same_type_p (t
, TREE_TYPE (arg
)))
6677 if (TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (arg
))
6678 && !TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm
)))
6679 /* Argument is a parameter pack but parameter is not. */
6692 /* Return 1 if PARM_PARMS and ARG_PARMS matches using rule for
6693 template template parameters. Both PARM_PARMS and ARG_PARMS are
6694 vectors of TREE_LIST nodes containing TYPE_DECL, TEMPLATE_DECL
6697 Consider the example:
6698 template <class T> class A;
6699 template<template <class U> class TT> class B;
6701 For B<A>, PARM_PARMS are the parameters to TT, while ARG_PARMS are
6702 the parameters to A, and OUTER_ARGS contains A. */
6705 coerce_template_template_parms (tree parm_parms
,
6707 tsubst_flags_t complain
,
6711 int nparms
, nargs
, i
;
6715 gcc_assert (TREE_CODE (parm_parms
) == TREE_VEC
);
6716 gcc_assert (TREE_CODE (arg_parms
) == TREE_VEC
);
6718 nparms
= TREE_VEC_LENGTH (parm_parms
);
6719 nargs
= TREE_VEC_LENGTH (arg_parms
);
6721 /* Determine whether we have a parameter pack at the end of the
6722 template template parameter's template parameter list. */
6723 if (TREE_VEC_ELT (parm_parms
, nparms
- 1) != error_mark_node
)
6725 parm
= TREE_VALUE (TREE_VEC_ELT (parm_parms
, nparms
- 1));
6727 if (error_operand_p (parm
))
6730 switch (TREE_CODE (parm
))
6734 if (TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (parm
)))
6739 if (TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm
)))
6749 && !(variadic_p
&& nargs
>= nparms
- 1))
6752 /* Check all of the template parameters except the parameter pack at
6753 the end (if any). */
6754 for (i
= 0; i
< nparms
- variadic_p
; ++i
)
6756 if (TREE_VEC_ELT (parm_parms
, i
) == error_mark_node
6757 || TREE_VEC_ELT (arg_parms
, i
) == error_mark_node
)
6760 parm
= TREE_VALUE (TREE_VEC_ELT (parm_parms
, i
));
6761 arg
= TREE_VALUE (TREE_VEC_ELT (arg_parms
, i
));
6763 if (!coerce_template_template_parm (parm
, arg
, complain
, in_decl
,
6771 /* Check each of the template parameters in the template
6772 argument against the template parameter pack at the end of
6773 the template template parameter. */
6774 if (TREE_VEC_ELT (parm_parms
, i
) == error_mark_node
)
6777 parm
= TREE_VALUE (TREE_VEC_ELT (parm_parms
, i
));
6779 for (; i
< nargs
; ++i
)
6781 if (TREE_VEC_ELT (arg_parms
, i
) == error_mark_node
)
6784 arg
= TREE_VALUE (TREE_VEC_ELT (arg_parms
, i
));
6786 if (!coerce_template_template_parm (parm
, arg
, complain
, in_decl
,
6795 /* Verifies that the deduced template arguments (in TARGS) for the
6796 template template parameters (in TPARMS) represent valid bindings,
6797 by comparing the template parameter list of each template argument
6798 to the template parameter list of its corresponding template
6799 template parameter, in accordance with DR150. This
6800 routine can only be called after all template arguments have been
6801 deduced. It will return TRUE if all of the template template
6802 parameter bindings are okay, FALSE otherwise. */
6804 template_template_parm_bindings_ok_p (tree tparms
, tree targs
)
6806 int i
, ntparms
= TREE_VEC_LENGTH (tparms
);
6809 /* We're dealing with template parms in this process. */
6810 ++processing_template_decl
;
6812 targs
= INNERMOST_TEMPLATE_ARGS (targs
);
6814 for (i
= 0; i
< ntparms
; ++i
)
6816 tree tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, i
));
6817 tree targ
= TREE_VEC_ELT (targs
, i
);
6819 if (TREE_CODE (tparm
) == TEMPLATE_DECL
&& targ
)
6821 tree packed_args
= NULL_TREE
;
6824 if (ARGUMENT_PACK_P (targ
))
6826 /* Look inside the argument pack. */
6827 packed_args
= ARGUMENT_PACK_ARGS (targ
);
6828 len
= TREE_VEC_LENGTH (packed_args
);
6831 for (idx
= 0; idx
< len
; ++idx
)
6833 tree targ_parms
= NULL_TREE
;
6836 /* Extract the next argument from the argument
6838 targ
= TREE_VEC_ELT (packed_args
, idx
);
6840 if (PACK_EXPANSION_P (targ
))
6841 /* Look at the pattern of the pack expansion. */
6842 targ
= PACK_EXPANSION_PATTERN (targ
);
6844 /* Extract the template parameters from the template
6846 if (TREE_CODE (targ
) == TEMPLATE_DECL
)
6847 targ_parms
= DECL_INNERMOST_TEMPLATE_PARMS (targ
);
6848 else if (TREE_CODE (targ
) == TEMPLATE_TEMPLATE_PARM
)
6849 targ_parms
= DECL_INNERMOST_TEMPLATE_PARMS (TYPE_NAME (targ
));
6851 /* Verify that we can coerce the template template
6852 parameters from the template argument to the template
6853 parameter. This requires an exact match. */
6855 && !coerce_template_template_parms
6856 (DECL_INNERMOST_TEMPLATE_PARMS (tparm
),
6871 --processing_template_decl
;
6875 /* Since type attributes aren't mangled, we need to strip them from
6876 template type arguments. */
6879 canonicalize_type_argument (tree arg
, tsubst_flags_t complain
)
6881 if (!arg
|| arg
== error_mark_node
|| arg
== TYPE_CANONICAL (arg
))
6883 bool removed_attributes
= false;
6884 tree canon
= strip_typedefs (arg
, &removed_attributes
);
6885 if (removed_attributes
6886 && (complain
& tf_warning
))
6887 warning (0, "ignoring attributes on template argument %qT", arg
);
6891 // A template declaration can be substituted for a constrained
6892 // template template parameter only when the argument is more
6893 // constrained than the parameter.
6895 is_compatible_template_arg (tree parm
, tree arg
)
6897 tree parm_cons
= get_constraints (parm
);
6899 /* For now, allow constrained template template arguments
6900 and unconstrained template template parameters. */
6901 if (parm_cons
== NULL_TREE
)
6904 tree arg_cons
= get_constraints (arg
);
6906 // If the template parameter is constrained, we need to rewrite its
6907 // constraints in terms of the ARG's template parameters. This ensures
6908 // that all of the template parameter types will have the same depth.
6910 // Note that this is only valid when coerce_template_template_parm is
6911 // true for the innermost template parameters of PARM and ARG. In other
6912 // words, because coercion is successful, this conversion will be valid.
6915 tree args
= template_parms_to_args (DECL_TEMPLATE_PARMS (arg
));
6916 parm_cons
= tsubst_constraint_info (parm_cons
,
6917 INNERMOST_TEMPLATE_ARGS (args
),
6918 tf_none
, NULL_TREE
);
6919 if (parm_cons
== error_mark_node
)
6923 return subsumes (parm_cons
, arg_cons
);
6926 // Convert a placeholder argument into a binding to the original
6927 // parameter. The original parameter is saved as the TREE_TYPE of
6930 convert_wildcard_argument (tree parm
, tree arg
)
6932 TREE_TYPE (arg
) = parm
;
6936 /* Convert the indicated template ARG as necessary to match the
6937 indicated template PARM. Returns the converted ARG, or
6938 error_mark_node if the conversion was unsuccessful. Error and
6939 warning messages are issued under control of COMPLAIN. This
6940 conversion is for the Ith parameter in the parameter list. ARGS is
6941 the full set of template arguments deduced so far. */
6944 convert_template_argument (tree parm
,
6947 tsubst_flags_t complain
,
6953 int is_type
, requires_type
, is_tmpl_type
, requires_tmpl_type
;
6955 if (parm
== error_mark_node
)
6956 return error_mark_node
;
6958 /* Trivially convert placeholders. */
6959 if (TREE_CODE (arg
) == WILDCARD_DECL
)
6960 return convert_wildcard_argument (parm
, arg
);
6962 if (TREE_CODE (arg
) == TREE_LIST
6963 && TREE_CODE (TREE_VALUE (arg
)) == OFFSET_REF
)
6965 /* The template argument was the name of some
6966 member function. That's usually
6967 invalid, but static members are OK. In any
6968 case, grab the underlying fields/functions
6969 and issue an error later if required. */
6970 orig_arg
= TREE_VALUE (arg
);
6971 TREE_TYPE (arg
) = unknown_type_node
;
6976 requires_tmpl_type
= TREE_CODE (parm
) == TEMPLATE_DECL
;
6977 requires_type
= (TREE_CODE (parm
) == TYPE_DECL
6978 || requires_tmpl_type
);
6980 /* When determining whether an argument pack expansion is a template,
6981 look at the pattern. */
6982 if (TREE_CODE (arg
) == TYPE_PACK_EXPANSION
)
6983 arg
= PACK_EXPANSION_PATTERN (arg
);
6985 /* Deal with an injected-class-name used as a template template arg. */
6986 if (requires_tmpl_type
&& CLASS_TYPE_P (arg
))
6988 tree t
= maybe_get_template_decl_from_type_decl (TYPE_NAME (arg
));
6989 if (TREE_CODE (t
) == TEMPLATE_DECL
)
6991 if (cxx_dialect
>= cxx11
)
6992 /* OK under DR 1004. */;
6993 else if (complain
& tf_warning_or_error
)
6994 pedwarn (input_location
, OPT_Wpedantic
, "injected-class-name %qD"
6995 " used as template template argument", TYPE_NAME (arg
));
6996 else if (flag_pedantic_errors
)
7004 ((TREE_CODE (arg
) == TEMPLATE_DECL
7005 && TREE_CODE (DECL_TEMPLATE_RESULT (arg
)) == TYPE_DECL
)
7006 || (requires_tmpl_type
&& TREE_CODE (arg
) == TYPE_ARGUMENT_PACK
)
7007 || TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
7008 || TREE_CODE (arg
) == UNBOUND_CLASS_TEMPLATE
);
7011 && (TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
7012 || TREE_CODE (arg
) == UNBOUND_CLASS_TEMPLATE
))
7013 arg
= TYPE_STUB_DECL (arg
);
7015 is_type
= TYPE_P (arg
) || is_tmpl_type
;
7017 if (requires_type
&& ! is_type
&& TREE_CODE (arg
) == SCOPE_REF
7018 && TREE_CODE (TREE_OPERAND (arg
, 0)) == TEMPLATE_TYPE_PARM
)
7020 if (TREE_CODE (TREE_OPERAND (arg
, 1)) == BIT_NOT_EXPR
)
7022 if (complain
& tf_error
)
7023 error ("invalid use of destructor %qE as a type", orig_arg
);
7024 return error_mark_node
;
7027 permerror (input_location
,
7028 "to refer to a type member of a template parameter, "
7029 "use %<typename %E%>", orig_arg
);
7031 orig_arg
= make_typename_type (TREE_OPERAND (arg
, 0),
7032 TREE_OPERAND (arg
, 1),
7038 if (is_type
!= requires_type
)
7042 if (complain
& tf_error
)
7044 error ("type/value mismatch at argument %d in template "
7045 "parameter list for %qD",
7048 inform (input_location
,
7049 " expected a constant of type %qT, got %qT",
7051 (DECL_P (arg
) ? DECL_NAME (arg
) : orig_arg
));
7052 else if (requires_tmpl_type
)
7053 inform (input_location
,
7054 " expected a class template, got %qE", orig_arg
);
7056 inform (input_location
,
7057 " expected a type, got %qE", orig_arg
);
7060 return error_mark_node
;
7062 if (is_tmpl_type
^ requires_tmpl_type
)
7064 if (in_decl
&& (complain
& tf_error
))
7066 error ("type/value mismatch at argument %d in template "
7067 "parameter list for %qD",
7070 inform (input_location
,
7071 " expected a type, got %qT", DECL_NAME (arg
));
7073 inform (input_location
,
7074 " expected a class template, got %qT", orig_arg
);
7076 return error_mark_node
;
7081 if (requires_tmpl_type
)
7083 if (template_parameter_pack_p (parm
) && ARGUMENT_PACK_P (orig_arg
))
7085 else if (TREE_CODE (TREE_TYPE (arg
)) == UNBOUND_CLASS_TEMPLATE
)
7086 /* The number of argument required is not known yet.
7087 Just accept it for now. */
7088 val
= TREE_TYPE (arg
);
7091 tree parmparm
= DECL_INNERMOST_TEMPLATE_PARMS (parm
);
7094 /* Strip alias templates that are equivalent to another
7096 arg
= get_underlying_template (arg
);
7097 argparm
= DECL_INNERMOST_TEMPLATE_PARMS (arg
);
7099 if (coerce_template_template_parms (parmparm
, argparm
,
7105 /* TEMPLATE_TEMPLATE_PARM node is preferred over
7107 if (val
!= error_mark_node
)
7109 if (DECL_TEMPLATE_TEMPLATE_PARM_P (val
))
7110 val
= TREE_TYPE (val
);
7111 if (TREE_CODE (orig_arg
) == TYPE_PACK_EXPANSION
)
7112 val
= make_pack_expansion (val
);
7117 if (in_decl
&& (complain
& tf_error
))
7119 error ("type/value mismatch at argument %d in "
7120 "template parameter list for %qD",
7122 inform (input_location
,
7123 " expected a template of type %qD, got %qT",
7127 val
= error_mark_node
;
7130 // Check that the constraints are compatible before allowing the
7132 if (val
!= error_mark_node
)
7133 if (!is_compatible_template_arg (parm
, arg
))
7135 if (in_decl
&& (complain
& tf_error
))
7137 error ("constraint mismatch at argument %d in "
7138 "template parameter list for %qD",
7140 inform (input_location
, " expected %qD but got %qD",
7143 val
= error_mark_node
;
7149 /* We only form one instance of each template specialization.
7150 Therefore, if we use a non-canonical variant (i.e., a
7151 typedef), any future messages referring to the type will use
7152 the typedef, which is confusing if those future uses do not
7153 themselves also use the typedef. */
7155 val
= canonicalize_type_argument (val
, complain
);
7159 tree t
= tsubst (TREE_TYPE (parm
), args
, complain
, in_decl
);
7161 if (invalid_nontype_parm_type_p (t
, complain
))
7162 return error_mark_node
;
7164 if (template_parameter_pack_p (parm
) && ARGUMENT_PACK_P (orig_arg
))
7166 if (same_type_p (t
, TREE_TYPE (orig_arg
)))
7170 /* Not sure if this is reachable, but it doesn't hurt
7172 error ("type mismatch in nontype parameter pack");
7173 val
= error_mark_node
;
7176 else if (!dependent_template_arg_p (orig_arg
)
7177 && !uses_template_parms (t
))
7178 /* We used to call digest_init here. However, digest_init
7179 will report errors, which we don't want when complain
7180 is zero. More importantly, digest_init will try too
7181 hard to convert things: for example, `0' should not be
7182 converted to pointer type at this point according to
7183 the standard. Accepting this is not merely an
7184 extension, since deciding whether or not these
7185 conversions can occur is part of determining which
7186 function template to call, or whether a given explicit
7187 argument specification is valid. */
7188 val
= convert_nontype_argument (t
, orig_arg
, complain
);
7191 bool removed_attr
= false;
7192 val
= strip_typedefs_expr (orig_arg
, &removed_attr
);
7195 if (val
== NULL_TREE
)
7196 val
= error_mark_node
;
7197 else if (val
== error_mark_node
&& (complain
& tf_error
))
7198 error ("could not convert template argument %qE to %qT", orig_arg
, t
);
7200 if (TREE_CODE (val
) == SCOPE_REF
)
7202 /* Strip typedefs from the SCOPE_REF. */
7203 tree type
= canonicalize_type_argument (TREE_TYPE (val
), complain
);
7204 tree scope
= canonicalize_type_argument (TREE_OPERAND (val
, 0),
7206 val
= build_qualified_name (type
, scope
, TREE_OPERAND (val
, 1),
7207 QUALIFIED_NAME_IS_TEMPLATE (val
));
7214 /* Coerces the remaining template arguments in INNER_ARGS (from
7215 ARG_IDX to the end) into the parameter pack at PARM_IDX in PARMS.
7216 Returns the coerced argument pack. PARM_IDX is the position of this
7217 parameter in the template parameter list. ARGS is the original
7218 template argument list. */
7220 coerce_template_parameter_pack (tree parms
,
7228 tsubst_flags_t complain
)
7230 tree parm
= TREE_VEC_ELT (parms
, parm_idx
);
7231 int nargs
= inner_args
? NUM_TMPL_ARGS (inner_args
) : 0;
7234 tree packed_parms
= NULL_TREE
;
7236 if (arg_idx
> nargs
)
7239 if (tree packs
= fixed_parameter_pack_p (TREE_VALUE (parm
)))
7241 /* When the template parameter is a non-type template parameter pack
7242 or template template parameter pack whose type or template
7243 parameters use parameter packs, we know exactly how many arguments
7244 we are looking for. Build a vector of the instantiated decls for
7245 these template parameters in PACKED_PARMS. */
7246 /* We can't use make_pack_expansion here because it would interpret a
7247 _DECL as a use rather than a declaration. */
7248 tree decl
= TREE_VALUE (parm
);
7249 tree exp
= cxx_make_type (TYPE_PACK_EXPANSION
);
7250 SET_PACK_EXPANSION_PATTERN (exp
, decl
);
7251 PACK_EXPANSION_PARAMETER_PACKS (exp
) = packs
;
7252 SET_TYPE_STRUCTURAL_EQUALITY (exp
);
7254 TREE_VEC_LENGTH (args
)--;
7255 packed_parms
= tsubst_pack_expansion (exp
, args
, complain
, decl
);
7256 TREE_VEC_LENGTH (args
)++;
7258 if (packed_parms
== error_mark_node
)
7259 return error_mark_node
;
7261 /* If we're doing a partial instantiation of a member template,
7262 verify that all of the types used for the non-type
7263 template parameter pack are, in fact, valid for non-type
7264 template parameters. */
7266 && PACK_EXPANSION_P (TREE_VEC_ELT (inner_args
, arg_idx
)))
7268 int j
, len
= TREE_VEC_LENGTH (packed_parms
);
7269 for (j
= 0; j
< len
; ++j
)
7271 tree t
= TREE_TYPE (TREE_VEC_ELT (packed_parms
, j
));
7272 if (invalid_nontype_parm_type_p (t
, complain
))
7273 return error_mark_node
;
7275 /* We don't know how many args we have yet, just
7276 use the unconverted ones for now. */
7280 packed_args
= make_tree_vec (TREE_VEC_LENGTH (packed_parms
));
7282 /* Check if we have a placeholder pack, which indicates we're
7283 in the context of a introduction list. In that case we want
7284 to match this pack to the single placeholder. */
7285 else if (arg_idx
< nargs
7286 && TREE_CODE (TREE_VEC_ELT (inner_args
, arg_idx
)) == WILDCARD_DECL
7287 && WILDCARD_PACK_P (TREE_VEC_ELT (inner_args
, arg_idx
)))
7289 nargs
= arg_idx
+ 1;
7290 packed_args
= make_tree_vec (1);
7293 packed_args
= make_tree_vec (nargs
- arg_idx
);
7295 /* Convert the remaining arguments, which will be a part of the
7296 parameter pack "parm". */
7297 for (; arg_idx
< nargs
; ++arg_idx
)
7299 tree arg
= TREE_VEC_ELT (inner_args
, arg_idx
);
7300 tree actual_parm
= TREE_VALUE (parm
);
7301 int pack_idx
= arg_idx
- parm_idx
;
7305 /* Once we've packed as many args as we have types, stop. */
7306 if (pack_idx
>= TREE_VEC_LENGTH (packed_parms
))
7308 else if (PACK_EXPANSION_P (arg
))
7309 /* We don't know how many args we have yet, just
7310 use the unconverted ones for now. */
7313 actual_parm
= TREE_VEC_ELT (packed_parms
, pack_idx
);
7316 if (arg
== error_mark_node
)
7318 if (complain
& tf_error
)
7319 error ("template argument %d is invalid", arg_idx
+ 1);
7322 arg
= convert_template_argument (actual_parm
,
7323 arg
, new_args
, complain
, parm_idx
,
7325 if (arg
== error_mark_node
)
7327 TREE_VEC_ELT (packed_args
, pack_idx
) = arg
;
7330 if (arg_idx
- parm_idx
< TREE_VEC_LENGTH (packed_args
)
7331 && TREE_VEC_LENGTH (packed_args
) > 0)
7333 if (complain
& tf_error
)
7334 error ("wrong number of template arguments (%d, should be %d)",
7335 arg_idx
- parm_idx
, TREE_VEC_LENGTH (packed_args
));
7336 return error_mark_node
;
7339 if (TREE_CODE (TREE_VALUE (parm
)) == TYPE_DECL
7340 || TREE_CODE (TREE_VALUE (parm
)) == TEMPLATE_DECL
)
7341 argument_pack
= cxx_make_type (TYPE_ARGUMENT_PACK
);
7344 argument_pack
= make_node (NONTYPE_ARGUMENT_PACK
);
7345 TREE_TYPE (argument_pack
)
7346 = tsubst (TREE_TYPE (TREE_VALUE (parm
)), new_args
, complain
, in_decl
);
7347 TREE_CONSTANT (argument_pack
) = 1;
7350 SET_ARGUMENT_PACK_ARGS (argument_pack
, packed_args
);
7351 #ifdef ENABLE_CHECKING
7352 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (packed_args
,
7353 TREE_VEC_LENGTH (packed_args
));
7355 return argument_pack
;
7358 /* Returns the number of pack expansions in the template argument vector
7362 pack_expansion_args_count (tree args
)
7367 for (i
= 0; i
< TREE_VEC_LENGTH (args
); ++i
)
7369 tree elt
= TREE_VEC_ELT (args
, i
);
7370 if (elt
&& PACK_EXPANSION_P (elt
))
7376 /* Convert all template arguments to their appropriate types, and
7377 return a vector containing the innermost resulting template
7378 arguments. If any error occurs, return error_mark_node. Error and
7379 warning messages are issued under control of COMPLAIN.
7381 If REQUIRE_ALL_ARGS is false, argument deduction will be performed
7382 for arguments not specified in ARGS. Otherwise, if
7383 USE_DEFAULT_ARGS is true, default arguments will be used to fill in
7384 unspecified arguments. If REQUIRE_ALL_ARGS is true, but
7385 USE_DEFAULT_ARGS is false, then all arguments must be specified in
7389 coerce_template_parms (tree parms
,
7392 tsubst_flags_t complain
,
7393 bool require_all_args
,
7394 bool use_default_args
)
7396 int nparms
, nargs
, parm_idx
, arg_idx
, lost
= 0;
7397 tree orig_inner_args
;
7400 tree new_inner_args
;
7401 int saved_unevaluated_operand
;
7402 int saved_inhibit_evaluation_warnings
;
7404 /* When used as a boolean value, indicates whether this is a
7405 variadic template parameter list. Since it's an int, we can also
7406 subtract it from nparms to get the number of non-variadic
7409 int variadic_args_p
= 0;
7410 int post_variadic_parms
= 0;
7412 /* Likewise for parameters with default arguments. */
7415 if (args
== error_mark_node
)
7416 return error_mark_node
;
7418 nparms
= TREE_VEC_LENGTH (parms
);
7420 /* Determine if there are any parameter packs or default arguments. */
7421 for (parm_idx
= 0; parm_idx
< nparms
; ++parm_idx
)
7423 tree parm
= TREE_VEC_ELT (parms
, parm_idx
);
7425 ++post_variadic_parms
;
7426 if (template_parameter_pack_p (TREE_VALUE (parm
)))
7428 if (TREE_PURPOSE (parm
))
7432 inner_args
= orig_inner_args
= INNERMOST_TEMPLATE_ARGS (args
);
7433 /* If there are no parameters that follow a parameter pack, we need to
7434 expand any argument packs so that we can deduce a parameter pack from
7435 some non-packed args followed by an argument pack, as in variadic85.C.
7436 If there are such parameters, we need to leave argument packs intact
7437 so the arguments are assigned properly. This can happen when dealing
7438 with a nested class inside a partial specialization of a class
7439 template, as in variadic92.C, or when deducing a template parameter pack
7440 from a sub-declarator, as in variadic114.C. */
7441 if (!post_variadic_parms
)
7442 inner_args
= expand_template_argument_pack (inner_args
);
7444 /* Count any pack expansion args. */
7445 variadic_args_p
= pack_expansion_args_count (inner_args
);
7447 nargs
= inner_args
? NUM_TMPL_ARGS (inner_args
) : 0;
7448 if ((nargs
> nparms
&& !variadic_p
)
7449 || (nargs
< nparms
- variadic_p
7452 && (!use_default_args
7453 || (TREE_VEC_ELT (parms
, nargs
) != error_mark_node
7454 && !TREE_PURPOSE (TREE_VEC_ELT (parms
, nargs
))))))
7456 if (complain
& tf_error
)
7458 if (variadic_p
|| default_p
)
7460 nparms
-= variadic_p
+ default_p
;
7461 error ("wrong number of template arguments "
7462 "(%d, should be at least %d)", nargs
, nparms
);
7465 error ("wrong number of template arguments "
7466 "(%d, should be %d)", nargs
, nparms
);
7469 inform (DECL_SOURCE_LOCATION (in_decl
),
7470 "provided for %qD", in_decl
);
7473 return error_mark_node
;
7475 /* We can't pass a pack expansion to a non-pack parameter of an alias
7476 template (DR 1430). */
7478 && (DECL_ALIAS_TEMPLATE_P (in_decl
)
7479 || concept_template_p (in_decl
))
7481 && nargs
- variadic_args_p
< nparms
- variadic_p
)
7483 if (complain
& tf_error
)
7485 for (int i
= 0; i
< TREE_VEC_LENGTH (inner_args
); ++i
)
7487 tree arg
= TREE_VEC_ELT (inner_args
, i
);
7488 tree parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
7490 if (PACK_EXPANSION_P (arg
)
7491 && !template_parameter_pack_p (parm
))
7493 if (DECL_ALIAS_TEMPLATE_P (in_decl
))
7494 error_at (location_of (arg
),
7495 "pack expansion argument for non-pack parameter "
7496 "%qD of alias template %qD", parm
, in_decl
);
7498 error_at (location_of (arg
),
7499 "pack expansion argument for non-pack parameter "
7500 "%qD of concept %qD", parm
, in_decl
);
7501 inform (DECL_SOURCE_LOCATION (parm
), "declared here");
7508 return error_mark_node
;
7511 /* We need to evaluate the template arguments, even though this
7512 template-id may be nested within a "sizeof". */
7513 saved_unevaluated_operand
= cp_unevaluated_operand
;
7514 cp_unevaluated_operand
= 0;
7515 saved_inhibit_evaluation_warnings
= c_inhibit_evaluation_warnings
;
7516 c_inhibit_evaluation_warnings
= 0;
7517 new_inner_args
= make_tree_vec (nparms
);
7518 new_args
= add_outermost_template_args (args
, new_inner_args
);
7519 int pack_adjust
= 0;
7520 for (parm_idx
= 0, arg_idx
= 0; parm_idx
< nparms
; parm_idx
++, arg_idx
++)
7525 /* Get the Ith template parameter. */
7526 parm
= TREE_VEC_ELT (parms
, parm_idx
);
7528 if (parm
== error_mark_node
)
7530 TREE_VEC_ELT (new_inner_args
, arg_idx
) = error_mark_node
;
7534 /* Calculate the next argument. */
7535 if (arg_idx
< nargs
)
7536 arg
= TREE_VEC_ELT (inner_args
, arg_idx
);
7540 if (template_parameter_pack_p (TREE_VALUE (parm
))
7541 && !(arg
&& ARGUMENT_PACK_P (arg
)))
7543 /* Some arguments will be placed in the
7544 template parameter pack PARM. */
7545 arg
= coerce_template_parameter_pack (parms
, parm_idx
, args
,
7546 inner_args
, arg_idx
,
7550 if (arg
== NULL_TREE
)
7552 /* We don't know how many args we have yet, just use the
7553 unconverted (and still packed) ones for now. */
7554 new_inner_args
= orig_inner_args
;
7559 TREE_VEC_ELT (new_inner_args
, parm_idx
) = arg
;
7561 /* Store this argument. */
7562 if (arg
== error_mark_node
)
7565 /* We are done with all of the arguments. */
7570 pack_adjust
= TREE_VEC_LENGTH (ARGUMENT_PACK_ARGS (arg
)) - 1;
7571 arg_idx
+= pack_adjust
;
7578 if (PACK_EXPANSION_P (arg
))
7580 /* "If every valid specialization of a variadic template
7581 requires an empty template parameter pack, the template is
7582 ill-formed, no diagnostic required." So check that the
7583 pattern works with this parameter. */
7584 tree pattern
= PACK_EXPANSION_PATTERN (arg
);
7585 tree conv
= convert_template_argument (TREE_VALUE (parm
),
7589 if (conv
== error_mark_node
)
7591 inform (input_location
, "so any instantiation with a "
7592 "non-empty parameter pack would be ill-formed");
7595 else if (TYPE_P (conv
) && !TYPE_P (pattern
))
7596 /* Recover from missing typename. */
7597 TREE_VEC_ELT (inner_args
, arg_idx
)
7598 = make_pack_expansion (conv
);
7600 /* We don't know how many args we have yet, just
7601 use the unconverted ones for now. */
7602 new_inner_args
= inner_args
;
7607 else if (require_all_args
)
7609 /* There must be a default arg in this case. */
7610 arg
= tsubst_template_arg (TREE_PURPOSE (parm
), new_args
,
7612 /* The position of the first default template argument,
7613 is also the number of non-defaulted arguments in NEW_INNER_ARGS.
7615 if (!NON_DEFAULT_TEMPLATE_ARGS_COUNT (new_inner_args
))
7616 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (new_inner_args
,
7617 arg_idx
- pack_adjust
);
7622 if (arg
== error_mark_node
)
7624 if (complain
& tf_error
)
7625 error ("template argument %d is invalid", arg_idx
+ 1);
7628 /* This only occurs if there was an error in the template
7629 parameter list itself (which we would already have
7630 reported) that we are trying to recover from, e.g., a class
7631 template with a parameter list such as
7632 template<typename..., typename>. */
7635 arg
= convert_template_argument (TREE_VALUE (parm
),
7636 arg
, new_args
, complain
,
7639 if (arg
== error_mark_node
)
7641 TREE_VEC_ELT (new_inner_args
, arg_idx
- pack_adjust
) = arg
;
7643 cp_unevaluated_operand
= saved_unevaluated_operand
;
7644 c_inhibit_evaluation_warnings
= saved_inhibit_evaluation_warnings
;
7646 if (variadic_p
&& arg_idx
< nargs
)
7648 if (complain
& tf_error
)
7650 error ("wrong number of template arguments "
7651 "(%d, should be %d)", nargs
, arg_idx
);
7653 error ("provided for %q+D", in_decl
);
7655 return error_mark_node
;
7659 return error_mark_node
;
7661 #ifdef ENABLE_CHECKING
7662 if (!NON_DEFAULT_TEMPLATE_ARGS_COUNT (new_inner_args
))
7663 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (new_inner_args
,
7664 TREE_VEC_LENGTH (new_inner_args
));
7667 return new_inner_args
;
7670 /* Convert all template arguments to their appropriate types, and
7671 return a vector containing the innermost resulting template
7672 arguments. If any error occurs, return error_mark_node. Error and
7673 warning messages are not issued.
7675 Note that no function argument deduction is performed, and default
7676 arguments are used to fill in unspecified arguments. */
7678 coerce_template_parms (tree parms
, tree args
, tree in_decl
)
7680 return coerce_template_parms (parms
, args
, in_decl
, tf_none
, true, true);
7683 /* Convert all template arguments to their appropriate type, and
7684 instantiate default arguments as needed. This returns a vector
7685 containing the innermost resulting template arguments, or
7686 error_mark_node if unsuccessful. */
7688 coerce_template_parms (tree parms
, tree args
, tree in_decl
,
7689 tsubst_flags_t complain
)
7691 return coerce_template_parms (parms
, args
, in_decl
, complain
, true, true);
7694 /* Like coerce_template_parms. If PARMS represents all template
7695 parameters levels, this function returns a vector of vectors
7696 representing all the resulting argument levels. Note that in this
7697 case, only the innermost arguments are coerced because the
7698 outermost ones are supposed to have been coerced already.
7700 Otherwise, if PARMS represents only (the innermost) vector of
7701 parameters, this function returns a vector containing just the
7702 innermost resulting arguments. */
7705 coerce_innermost_template_parms (tree parms
,
7708 tsubst_flags_t complain
,
7709 bool require_all_args
,
7710 bool use_default_args
)
7712 int parms_depth
= TMPL_PARMS_DEPTH (parms
);
7713 int args_depth
= TMPL_ARGS_DEPTH (args
);
7716 if (parms_depth
> 1)
7718 coerced_args
= make_tree_vec (parms_depth
);
7722 for (level
= parms
, cur_depth
= parms_depth
;
7723 parms_depth
> 0 && level
!= NULL_TREE
;
7724 level
= TREE_CHAIN (level
), --cur_depth
)
7727 if (cur_depth
== args_depth
)
7728 l
= coerce_template_parms (TREE_VALUE (level
),
7729 args
, in_decl
, complain
,
7733 l
= TMPL_ARGS_LEVEL (args
, cur_depth
);
7735 if (l
== error_mark_node
)
7736 return error_mark_node
;
7738 SET_TMPL_ARGS_LEVEL (coerced_args
, cur_depth
, l
);
7742 coerced_args
= coerce_template_parms (INNERMOST_TEMPLATE_PARMS (parms
),
7743 args
, in_decl
, complain
,
7746 return coerced_args
;
7749 /* Returns 1 if template args OT and NT are equivalent. */
7752 template_args_equal (tree ot
, tree nt
)
7756 if (nt
== NULL_TREE
|| ot
== NULL_TREE
)
7759 if (TREE_CODE (nt
) == TREE_VEC
)
7760 /* For member templates */
7761 return TREE_CODE (ot
) == TREE_VEC
&& comp_template_args (ot
, nt
);
7762 else if (PACK_EXPANSION_P (ot
))
7763 return (PACK_EXPANSION_P (nt
)
7764 && template_args_equal (PACK_EXPANSION_PATTERN (ot
),
7765 PACK_EXPANSION_PATTERN (nt
))
7766 && template_args_equal (PACK_EXPANSION_EXTRA_ARGS (ot
),
7767 PACK_EXPANSION_EXTRA_ARGS (nt
)));
7768 else if (ARGUMENT_PACK_P (ot
))
7773 if (!ARGUMENT_PACK_P (nt
))
7776 opack
= ARGUMENT_PACK_ARGS (ot
);
7777 npack
= ARGUMENT_PACK_ARGS (nt
);
7778 len
= TREE_VEC_LENGTH (opack
);
7779 if (TREE_VEC_LENGTH (npack
) != len
)
7781 for (i
= 0; i
< len
; ++i
)
7782 if (!template_args_equal (TREE_VEC_ELT (opack
, i
),
7783 TREE_VEC_ELT (npack
, i
)))
7787 else if (ot
&& TREE_CODE (ot
) == ARGUMENT_PACK_SELECT
)
7789 /* We get here probably because we are in the middle of substituting
7790 into the pattern of a pack expansion. In that case the
7791 ARGUMENT_PACK_SELECT temporarily replaces the pack argument we are
7792 interested in. So we want to use the initial pack argument for
7794 ot
= ARGUMENT_PACK_SELECT_FROM_PACK (ot
);
7795 if (nt
&& TREE_CODE (nt
) == ARGUMENT_PACK_SELECT
)
7796 nt
= ARGUMENT_PACK_SELECT_FROM_PACK (nt
);
7797 return template_args_equal (ot
, nt
);
7799 else if (TYPE_P (nt
))
7803 /* Don't treat an alias template specialization with dependent
7804 arguments as equivalent to its underlying type when used as a
7805 template argument; we need them to be distinct so that we
7806 substitute into the specialization arguments at instantiation
7807 time. And aliases can't be equivalent without being ==, so
7808 we don't need to look any deeper. */
7809 if (TYPE_ALIAS_P (nt
) || TYPE_ALIAS_P (ot
))
7812 return same_type_p (ot
, nt
);
7814 else if (TREE_CODE (ot
) == TREE_VEC
|| TYPE_P (ot
))
7818 /* Try to treat a template non-type argument that has been converted
7819 to the parameter type as equivalent to one that hasn't yet. */
7820 for (enum tree_code code1
= TREE_CODE (ot
);
7821 CONVERT_EXPR_CODE_P (code1
)
7822 || code1
== NON_LVALUE_EXPR
;
7823 code1
= TREE_CODE (ot
))
7824 ot
= TREE_OPERAND (ot
, 0);
7825 for (enum tree_code code2
= TREE_CODE (nt
);
7826 CONVERT_EXPR_CODE_P (code2
)
7827 || code2
== NON_LVALUE_EXPR
;
7828 code2
= TREE_CODE (nt
))
7829 nt
= TREE_OPERAND (nt
, 0);
7831 return cp_tree_equal (ot
, nt
);
7835 /* Returns 1 iff the OLDARGS and NEWARGS are in fact identical sets of
7836 template arguments. Returns 0 otherwise, and updates OLDARG_PTR and
7837 NEWARG_PTR with the offending arguments if they are non-NULL. */
7840 comp_template_args_with_info (tree oldargs
, tree newargs
,
7841 tree
*oldarg_ptr
, tree
*newarg_ptr
)
7845 if (oldargs
== newargs
)
7848 if (!oldargs
|| !newargs
)
7851 if (TREE_VEC_LENGTH (oldargs
) != TREE_VEC_LENGTH (newargs
))
7854 for (i
= 0; i
< TREE_VEC_LENGTH (oldargs
); ++i
)
7856 tree nt
= TREE_VEC_ELT (newargs
, i
);
7857 tree ot
= TREE_VEC_ELT (oldargs
, i
);
7859 if (! template_args_equal (ot
, nt
))
7861 if (oldarg_ptr
!= NULL
)
7863 if (newarg_ptr
!= NULL
)
7871 /* Returns 1 iff the OLDARGS and NEWARGS are in fact identical sets
7872 of template arguments. Returns 0 otherwise. */
7875 comp_template_args (tree oldargs
, tree newargs
)
7877 return comp_template_args_with_info (oldargs
, newargs
, NULL
, NULL
);
7881 add_pending_template (tree d
)
7883 tree ti
= (TYPE_P (d
)
7884 ? CLASSTYPE_TEMPLATE_INFO (d
)
7885 : DECL_TEMPLATE_INFO (d
));
7886 struct pending_template
*pt
;
7889 if (TI_PENDING_TEMPLATE_FLAG (ti
))
7892 /* We are called both from instantiate_decl, where we've already had a
7893 tinst_level pushed, and instantiate_template, where we haven't.
7895 level
= !current_tinst_level
|| current_tinst_level
->decl
!= d
;
7898 push_tinst_level (d
);
7900 pt
= ggc_alloc
<pending_template
> ();
7902 pt
->tinst
= current_tinst_level
;
7903 if (last_pending_template
)
7904 last_pending_template
->next
= pt
;
7906 pending_templates
= pt
;
7908 last_pending_template
= pt
;
7910 TI_PENDING_TEMPLATE_FLAG (ti
) = 1;
7917 /* Return a TEMPLATE_ID_EXPR corresponding to the indicated FNS and
7918 ARGLIST. Valid choices for FNS are given in the cp-tree.def
7919 documentation for TEMPLATE_ID_EXPR. */
7922 lookup_template_function (tree fns
, tree arglist
)
7926 if (fns
== error_mark_node
|| arglist
== error_mark_node
)
7927 return error_mark_node
;
7929 gcc_assert (!arglist
|| TREE_CODE (arglist
) == TREE_VEC
);
7931 if (!is_overloaded_fn (fns
) && !identifier_p (fns
))
7933 error ("%q#D is not a function template", fns
);
7934 return error_mark_node
;
7937 if (BASELINK_P (fns
))
7939 BASELINK_FUNCTIONS (fns
) = build2 (TEMPLATE_ID_EXPR
,
7941 BASELINK_FUNCTIONS (fns
),
7946 type
= TREE_TYPE (fns
);
7947 if (TREE_CODE (fns
) == OVERLOAD
|| !type
)
7948 type
= unknown_type_node
;
7950 return build2 (TEMPLATE_ID_EXPR
, type
, fns
, arglist
);
7953 /* Within the scope of a template class S<T>, the name S gets bound
7954 (in build_self_reference) to a TYPE_DECL for the class, not a
7955 TEMPLATE_DECL. If DECL is a TYPE_DECL for current_class_type,
7956 or one of its enclosing classes, and that type is a template,
7957 return the associated TEMPLATE_DECL. Otherwise, the original
7960 Also handle the case when DECL is a TREE_LIST of ambiguous
7961 injected-class-names from different bases. */
7964 maybe_get_template_decl_from_type_decl (tree decl
)
7966 if (decl
== NULL_TREE
)
7969 /* DR 176: A lookup that finds an injected-class-name (10.2
7970 [class.member.lookup]) can result in an ambiguity in certain cases
7971 (for example, if it is found in more than one base class). If all of
7972 the injected-class-names that are found refer to specializations of
7973 the same class template, and if the name is followed by a
7974 template-argument-list, the reference refers to the class template
7975 itself and not a specialization thereof, and is not ambiguous. */
7976 if (TREE_CODE (decl
) == TREE_LIST
)
7978 tree t
, tmpl
= NULL_TREE
;
7979 for (t
= decl
; t
; t
= TREE_CHAIN (t
))
7981 tree elt
= maybe_get_template_decl_from_type_decl (TREE_VALUE (t
));
7984 else if (tmpl
!= elt
)
7987 if (tmpl
&& t
== NULL_TREE
)
7993 return (decl
!= NULL_TREE
7994 && DECL_SELF_REFERENCE_P (decl
)
7995 && CLASSTYPE_TEMPLATE_INFO (TREE_TYPE (decl
)))
7996 ? CLASSTYPE_TI_TEMPLATE (TREE_TYPE (decl
)) : decl
;
7999 /* Given an IDENTIFIER_NODE (or type TEMPLATE_DECL) and a chain of
8000 parameters, find the desired type.
8002 D1 is the PTYPENAME terminal, and ARGLIST is the list of arguments.
8004 IN_DECL, if non-NULL, is the template declaration we are trying to
8007 If ENTERING_SCOPE is nonzero, we are about to enter the scope of
8008 the class we are looking up.
8010 Issue error and warning messages under control of COMPLAIN.
8012 If the template class is really a local class in a template
8013 function, then the FUNCTION_CONTEXT is the function in which it is
8016 ??? Note that this function is currently called *twice* for each
8017 template-id: the first time from the parser, while creating the
8018 incomplete type (finish_template_type), and the second type during the
8019 real instantiation (instantiate_template_class). This is surely something
8020 that we want to avoid. It also causes some problems with argument
8021 coercion (see convert_nontype_argument for more information on this). */
8024 lookup_template_class_1 (tree d1
, tree arglist
, tree in_decl
, tree context
,
8025 int entering_scope
, tsubst_flags_t complain
)
8027 tree templ
= NULL_TREE
, parmlist
;
8034 if (identifier_p (d1
))
8036 tree value
= innermost_non_namespace_value (d1
);
8037 if (value
&& DECL_TEMPLATE_TEMPLATE_PARM_P (value
))
8042 push_decl_namespace (context
);
8043 templ
= lookup_name (d1
);
8044 templ
= maybe_get_template_decl_from_type_decl (templ
);
8046 pop_decl_namespace ();
8049 context
= DECL_CONTEXT (templ
);
8051 else if (TREE_CODE (d1
) == TYPE_DECL
&& MAYBE_CLASS_TYPE_P (TREE_TYPE (d1
)))
8053 tree type
= TREE_TYPE (d1
);
8055 /* If we are declaring a constructor, say A<T>::A<T>, we will get
8056 an implicit typename for the second A. Deal with it. */
8057 if (TREE_CODE (type
) == TYPENAME_TYPE
&& TREE_TYPE (type
))
8058 type
= TREE_TYPE (type
);
8060 if (CLASSTYPE_TEMPLATE_INFO (type
))
8062 templ
= CLASSTYPE_TI_TEMPLATE (type
);
8063 d1
= DECL_NAME (templ
);
8066 else if (TREE_CODE (d1
) == ENUMERAL_TYPE
8067 || (TYPE_P (d1
) && MAYBE_CLASS_TYPE_P (d1
)))
8069 templ
= TYPE_TI_TEMPLATE (d1
);
8070 d1
= DECL_NAME (templ
);
8072 else if (DECL_TYPE_TEMPLATE_P (d1
))
8075 d1
= DECL_NAME (templ
);
8076 context
= DECL_CONTEXT (templ
);
8078 else if (DECL_TEMPLATE_TEMPLATE_PARM_P (d1
))
8081 d1
= DECL_NAME (templ
);
8084 /* Issue an error message if we didn't find a template. */
8087 if (complain
& tf_error
)
8088 error ("%qT is not a template", d1
);
8089 return error_mark_node
;
8092 if (TREE_CODE (templ
) != TEMPLATE_DECL
8093 /* Make sure it's a user visible template, if it was named by
8095 || ((complain
& tf_user
) && !DECL_TEMPLATE_PARM_P (templ
)
8096 && !PRIMARY_TEMPLATE_P (templ
)))
8098 if (complain
& tf_error
)
8100 error ("non-template type %qT used as a template", d1
);
8102 error ("for template declaration %q+D", in_decl
);
8104 return error_mark_node
;
8107 complain
&= ~tf_user
;
8109 /* An alias that just changes the name of a template is equivalent to the
8110 other template, so if any of the arguments are pack expansions, strip
8111 the alias to avoid problems with a pack expansion passed to a non-pack
8112 alias template parameter (DR 1430). */
8113 if (pack_expansion_args_count (INNERMOST_TEMPLATE_ARGS (arglist
)))
8114 templ
= get_underlying_template (templ
);
8116 if (DECL_TEMPLATE_TEMPLATE_PARM_P (templ
))
8118 /* Create a new TEMPLATE_DECL and TEMPLATE_TEMPLATE_PARM node to store
8119 template arguments */
8125 parmlist
= DECL_INNERMOST_TEMPLATE_PARMS (templ
);
8127 /* Consider an example where a template template parameter declared as
8129 template <class T, class U = std::allocator<T> > class TT
8131 The template parameter level of T and U are one level larger than
8132 of TT. To proper process the default argument of U, say when an
8133 instantiation `TT<int>' is seen, we need to build the full
8134 arguments containing {int} as the innermost level. Outer levels,
8135 available when not appearing as default template argument, can be
8136 obtained from the arguments of the enclosing template.
8138 Suppose that TT is later substituted with std::vector. The above
8139 instantiation is `TT<int, std::allocator<T> >' with TT at
8140 level 1, and T at level 2, while the template arguments at level 1
8141 becomes {std::vector} and the inner level 2 is {int}. */
8143 outer
= DECL_CONTEXT (templ
);
8145 outer
= TI_ARGS (get_template_info (DECL_TEMPLATE_RESULT (outer
)));
8146 else if (current_template_parms
)
8148 /* This is an argument of the current template, so we haven't set
8149 DECL_CONTEXT yet. */
8150 tree relevant_template_parms
;
8152 /* Parameter levels that are greater than the level of the given
8153 template template parm are irrelevant. */
8154 relevant_template_parms
= current_template_parms
;
8155 while (TMPL_PARMS_DEPTH (relevant_template_parms
)
8156 != TEMPLATE_TYPE_LEVEL (TREE_TYPE (templ
)))
8157 relevant_template_parms
= TREE_CHAIN (relevant_template_parms
);
8159 outer
= template_parms_to_args (relevant_template_parms
);
8163 arglist
= add_to_template_args (outer
, arglist
);
8165 arglist2
= coerce_template_parms (parmlist
, arglist
, templ
,
8167 /*require_all_args=*/true,
8168 /*use_default_args=*/true);
8169 if (arglist2
== error_mark_node
8170 || (!uses_template_parms (arglist2
)
8171 && check_instantiated_args (templ
, arglist2
, complain
)))
8172 return error_mark_node
;
8174 parm
= bind_template_template_parm (TREE_TYPE (templ
), arglist2
);
8179 tree template_type
= TREE_TYPE (templ
);
8182 tree found
= NULL_TREE
;
8185 int is_dependent_type
;
8186 int use_partial_inst_tmpl
= false;
8188 if (template_type
== error_mark_node
)
8189 /* An error occurred while building the template TEMPL, and a
8190 diagnostic has most certainly been emitted for that
8191 already. Let's propagate that error. */
8192 return error_mark_node
;
8194 gen_tmpl
= most_general_template (templ
);
8195 parmlist
= DECL_TEMPLATE_PARMS (gen_tmpl
);
8196 parm_depth
= TMPL_PARMS_DEPTH (parmlist
);
8197 arg_depth
= TMPL_ARGS_DEPTH (arglist
);
8199 if (arg_depth
== 1 && parm_depth
> 1)
8201 /* We've been given an incomplete set of template arguments.
8204 template <class T> struct S1 {
8205 template <class U> struct S2 {};
8206 template <class U> struct S2<U*> {};
8209 we will be called with an ARGLIST of `U*', but the
8210 TEMPLATE will be `template <class T> template
8211 <class U> struct S1<T>::S2'. We must fill in the missing
8214 = add_outermost_template_args (TYPE_TI_ARGS (TREE_TYPE (templ
)),
8216 arg_depth
= TMPL_ARGS_DEPTH (arglist
);
8219 /* Now we should have enough arguments. */
8220 gcc_assert (parm_depth
== arg_depth
);
8222 /* From here on, we're only interested in the most general
8225 /* Calculate the BOUND_ARGS. These will be the args that are
8226 actually tsubst'd into the definition to create the
8228 arglist
= coerce_innermost_template_parms (parmlist
, arglist
, gen_tmpl
,
8230 /*require_all_args=*/true,
8231 /*use_default_args=*/true);
8233 if (arglist
== error_mark_node
)
8234 /* We were unable to bind the arguments. */
8235 return error_mark_node
;
8237 /* In the scope of a template class, explicit references to the
8238 template class refer to the type of the template, not any
8239 instantiation of it. For example, in:
8241 template <class T> class C { void f(C<T>); }
8243 the `C<T>' is just the same as `C'. Outside of the
8244 class, however, such a reference is an instantiation. */
8246 || !PRIMARY_TEMPLATE_P (gen_tmpl
)
8247 || currently_open_class (template_type
))
8248 /* comp_template_args is expensive, check it last. */
8249 && comp_template_args (TYPE_TI_ARGS (template_type
),
8251 return template_type
;
8253 /* If we already have this specialization, return it. */
8254 elt
.tmpl
= gen_tmpl
;
8256 elt
.spec
= NULL_TREE
;
8257 hash
= spec_hasher::hash (&elt
);
8258 entry
= type_specializations
->find_with_hash (&elt
, hash
);
8263 /* If the the template's constraints are not satisfied,
8264 then we cannot form a valid type.
8266 Note that the check is deferred until after the hash
8267 lookup. This prevents redundant checks on previously
8268 instantiated specializations. */
8269 if (flag_concepts
&& !constraints_satisfied_p (gen_tmpl
, arglist
))
8271 if (complain
& tf_error
)
8273 error ("template constraint failure");
8274 diagnose_constraints (input_location
, gen_tmpl
, arglist
);
8276 return error_mark_node
;
8279 is_dependent_type
= uses_template_parms (arglist
);
8281 /* If the deduced arguments are invalid, then the binding
8283 if (!is_dependent_type
8284 && check_instantiated_args (gen_tmpl
,
8285 INNERMOST_TEMPLATE_ARGS (arglist
),
8287 return error_mark_node
;
8289 if (!is_dependent_type
8290 && !PRIMARY_TEMPLATE_P (gen_tmpl
)
8291 && !LAMBDA_TYPE_P (TREE_TYPE (gen_tmpl
))
8292 && TREE_CODE (CP_DECL_CONTEXT (gen_tmpl
)) == NAMESPACE_DECL
)
8294 found
= xref_tag_from_type (TREE_TYPE (gen_tmpl
),
8295 DECL_NAME (gen_tmpl
),
8296 /*tag_scope=*/ts_global
);
8300 context
= tsubst (DECL_CONTEXT (gen_tmpl
), arglist
,
8302 if (context
== error_mark_node
)
8303 return error_mark_node
;
8306 context
= global_namespace
;
8308 /* Create the type. */
8309 if (DECL_ALIAS_TEMPLATE_P (gen_tmpl
))
8311 /* The user referred to a specialization of an alias
8312 template represented by GEN_TMPL.
8314 [temp.alias]/2 says:
8316 When a template-id refers to the specialization of an
8317 alias template, it is equivalent to the associated
8318 type obtained by substitution of its
8319 template-arguments for the template-parameters in the
8320 type-id of the alias template. */
8322 t
= tsubst (TREE_TYPE (gen_tmpl
), arglist
, complain
, in_decl
);
8323 /* Note that the call above (by indirectly calling
8324 register_specialization in tsubst_decl) registers the
8325 TYPE_DECL representing the specialization of the alias
8326 template. So next time someone substitutes ARGLIST for
8327 the template parms into the alias template (GEN_TMPL),
8328 she'll get that TYPE_DECL back. */
8330 if (t
== error_mark_node
)
8333 else if (TREE_CODE (template_type
) == ENUMERAL_TYPE
)
8335 if (!is_dependent_type
)
8337 set_current_access_from_decl (TYPE_NAME (template_type
));
8338 t
= start_enum (TYPE_IDENTIFIER (template_type
), NULL_TREE
,
8339 tsubst (ENUM_UNDERLYING_TYPE (template_type
),
8340 arglist
, complain
, in_decl
),
8341 SCOPED_ENUM_P (template_type
), NULL
);
8343 if (t
== error_mark_node
)
8348 /* We don't want to call start_enum for this type, since
8349 the values for the enumeration constants may involve
8350 template parameters. And, no one should be interested
8351 in the enumeration constants for such a type. */
8352 t
= cxx_make_type (ENUMERAL_TYPE
);
8353 SET_SCOPED_ENUM_P (t
, SCOPED_ENUM_P (template_type
));
8355 SET_OPAQUE_ENUM_P (t
, OPAQUE_ENUM_P (template_type
));
8356 ENUM_FIXED_UNDERLYING_TYPE_P (t
)
8357 = ENUM_FIXED_UNDERLYING_TYPE_P (template_type
);
8359 else if (CLASS_TYPE_P (template_type
))
8361 t
= make_class_type (TREE_CODE (template_type
));
8362 CLASSTYPE_DECLARED_CLASS (t
)
8363 = CLASSTYPE_DECLARED_CLASS (template_type
);
8364 SET_CLASSTYPE_IMPLICIT_INSTANTIATION (t
);
8365 TYPE_FOR_JAVA (t
) = TYPE_FOR_JAVA (template_type
);
8367 /* A local class. Make sure the decl gets registered properly. */
8368 if (context
== current_function_decl
)
8369 pushtag (DECL_NAME (gen_tmpl
), t
, /*tag_scope=*/ts_current
);
8371 if (comp_template_args (CLASSTYPE_TI_ARGS (template_type
), arglist
))
8372 /* This instantiation is another name for the primary
8373 template type. Set the TYPE_CANONICAL field
8375 TYPE_CANONICAL (t
) = template_type
;
8376 else if (any_template_arguments_need_structural_equality_p (arglist
))
8377 /* Some of the template arguments require structural
8378 equality testing, so this template class requires
8379 structural equality testing. */
8380 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8385 /* If we called start_enum or pushtag above, this information
8386 will already be set up. */
8389 TYPE_CONTEXT (t
) = FROB_CONTEXT (context
);
8391 type_decl
= create_implicit_typedef (DECL_NAME (gen_tmpl
), t
);
8392 DECL_CONTEXT (type_decl
) = TYPE_CONTEXT (t
);
8393 DECL_SOURCE_LOCATION (type_decl
)
8394 = DECL_SOURCE_LOCATION (TYPE_STUB_DECL (template_type
));
8397 type_decl
= TYPE_NAME (t
);
8399 if (CLASS_TYPE_P (template_type
))
8401 TREE_PRIVATE (type_decl
)
8402 = TREE_PRIVATE (TYPE_MAIN_DECL (template_type
));
8403 TREE_PROTECTED (type_decl
)
8404 = TREE_PROTECTED (TYPE_MAIN_DECL (template_type
));
8405 if (CLASSTYPE_VISIBILITY_SPECIFIED (template_type
))
8407 DECL_VISIBILITY_SPECIFIED (type_decl
) = 1;
8408 DECL_VISIBILITY (type_decl
) = CLASSTYPE_VISIBILITY (template_type
);
8412 if (OVERLOAD_TYPE_P (t
)
8413 && !DECL_ALIAS_TEMPLATE_P (gen_tmpl
))
8415 static const char *tags
[] = {"abi_tag", "may_alias"};
8417 for (unsigned ix
= 0; ix
!= 2; ix
++)
8420 = lookup_attribute (tags
[ix
], TYPE_ATTRIBUTES (template_type
));
8424 else if (!TREE_CHAIN (attributes
) && !TYPE_ATTRIBUTES (t
))
8425 TYPE_ATTRIBUTES (t
) = attributes
;
8428 = tree_cons (TREE_PURPOSE (attributes
),
8429 TREE_VALUE (attributes
),
8430 TYPE_ATTRIBUTES (t
));
8434 /* Let's consider the explicit specialization of a member
8435 of a class template specialization that is implicitly instantiated,
8440 template<class U> struct M {}; //#0
8445 struct S<int>::M<char> //#1
8449 [temp.expl.spec]/4 says this is valid.
8451 In this case, when we write:
8454 M is instantiated from the CLASSTYPE_TI_TEMPLATE of #1, not from
8457 When we encounter #1, we want to store the partial instantiation
8458 of M (template<class T> S<int>::M<T>) in its CLASSTYPE_TI_TEMPLATE.
8460 For all cases other than this "explicit specialization of member of a
8461 class template", we just want to store the most general template into
8462 the CLASSTYPE_TI_TEMPLATE of M.
8464 This case of "explicit specialization of member of a class template"
8466 1/ the enclosing class is an instantiation of, and therefore not
8467 the same as, the context of the most general template, and
8468 2/ we aren't looking at the partial instantiation itself, i.e.
8469 the innermost arguments are not the same as the innermost parms of
8470 the most general template.
8472 So it's only when 1/ and 2/ happens that we want to use the partial
8473 instantiation of the member template in lieu of its most general
8476 if (PRIMARY_TEMPLATE_P (gen_tmpl
)
8477 && TMPL_ARGS_HAVE_MULTIPLE_LEVELS (arglist
)
8478 /* the enclosing class must be an instantiation... */
8479 && CLASS_TYPE_P (context
)
8480 && !same_type_p (context
, DECL_CONTEXT (gen_tmpl
)))
8482 tree partial_inst_args
;
8483 TREE_VEC_LENGTH (arglist
)--;
8484 ++processing_template_decl
;
8486 tsubst (INNERMOST_TEMPLATE_ARGS
8487 (TYPE_TI_ARGS (TREE_TYPE (gen_tmpl
))),
8488 arglist
, complain
, NULL_TREE
);
8489 --processing_template_decl
;
8490 TREE_VEC_LENGTH (arglist
)++;
8491 use_partial_inst_tmpl
=
8492 /*...and we must not be looking at the partial instantiation
8494 !comp_template_args (INNERMOST_TEMPLATE_ARGS (arglist
),
8498 if (!use_partial_inst_tmpl
)
8499 /* This case is easy; there are no member templates involved. */
8503 /* This is a full instantiation of a member template. Find
8504 the partial instantiation of which this is an instance. */
8506 /* Temporarily reduce by one the number of levels in the ARGLIST
8507 so as to avoid comparing the last set of arguments. */
8508 TREE_VEC_LENGTH (arglist
)--;
8509 found
= tsubst (gen_tmpl
, arglist
, complain
, NULL_TREE
);
8510 TREE_VEC_LENGTH (arglist
)++;
8511 /* FOUND is either a proper class type, or an alias
8512 template specialization. In the later case, it's a
8513 TYPE_DECL, resulting from the substituting of arguments
8514 for parameters in the TYPE_DECL of the alias template
8515 done earlier. So be careful while getting the template
8517 found
= TREE_CODE (found
) == TYPE_DECL
8518 ? TYPE_TI_TEMPLATE (TREE_TYPE (found
))
8519 : CLASSTYPE_TI_TEMPLATE (found
);
8522 // Build template info for the new specialization.
8523 SET_TYPE_TEMPLATE_INFO (t
, build_template_info (found
, arglist
));
8526 slot
= type_specializations
->find_slot_with_hash (&elt
, hash
, INSERT
);
8527 entry
= ggc_alloc
<spec_entry
> ();
8531 /* Note this use of the partial instantiation so we can check it
8532 later in maybe_process_partial_specialization. */
8533 DECL_TEMPLATE_INSTANTIATIONS (found
)
8534 = tree_cons (arglist
, t
,
8535 DECL_TEMPLATE_INSTANTIATIONS (found
));
8537 if (TREE_CODE (template_type
) == ENUMERAL_TYPE
&& !is_dependent_type
8538 && !DECL_ALIAS_TEMPLATE_P (gen_tmpl
))
8539 /* Now that the type has been registered on the instantiations
8540 list, we set up the enumerators. Because the enumeration
8541 constants may involve the enumeration type itself, we make
8542 sure to register the type first, and then create the
8543 constants. That way, doing tsubst_expr for the enumeration
8544 constants won't result in recursive calls here; we'll find
8545 the instantiation and exit above. */
8546 tsubst_enum (template_type
, t
, arglist
);
8548 if (CLASS_TYPE_P (template_type
) && is_dependent_type
)
8549 /* If the type makes use of template parameters, the
8550 code that generates debugging information will crash. */
8551 DECL_IGNORED_P (TYPE_MAIN_DECL (t
)) = 1;
8553 /* Possibly limit visibility based on template args. */
8554 TREE_PUBLIC (type_decl
) = 1;
8555 determine_visibility (type_decl
);
8557 inherit_targ_abi_tags (t
);
8563 /* Wrapper for lookup_template_class_1. */
8566 lookup_template_class (tree d1
, tree arglist
, tree in_decl
, tree context
,
8567 int entering_scope
, tsubst_flags_t complain
)
8570 timevar_push (TV_TEMPLATE_INST
);
8571 ret
= lookup_template_class_1 (d1
, arglist
, in_decl
, context
,
8572 entering_scope
, complain
);
8573 timevar_pop (TV_TEMPLATE_INST
);
8577 /* Return a TEMPLATE_ID_EXPR for the given variable template and ARGLIST. */
8580 lookup_template_variable (tree templ
, tree arglist
)
8582 /* The type of the expression is NULL_TREE since the template-id could refer
8583 to an explicit or partial specialization. */
8584 tree type
= NULL_TREE
;
8585 if (flag_concepts
&& variable_concept_p (templ
))
8586 /* Except that concepts are always bool. */
8587 type
= boolean_type_node
;
8588 return build2 (TEMPLATE_ID_EXPR
, type
, templ
, arglist
);
8591 /* Instantiate a variable declaration from a TEMPLATE_ID_EXPR for use. */
8594 finish_template_variable (tree var
, tsubst_flags_t complain
)
8596 tree templ
= TREE_OPERAND (var
, 0);
8597 tree arglist
= TREE_OPERAND (var
, 1);
8599 /* We never want to return a VAR_DECL for a variable concept, since they
8600 aren't instantiated. In a template, leave the TEMPLATE_ID_EXPR alone. */
8601 bool concept_p
= flag_concepts
&& variable_concept_p (templ
);
8602 if (concept_p
&& processing_template_decl
)
8605 tree tmpl_args
= DECL_TI_ARGS (DECL_TEMPLATE_RESULT (templ
));
8606 arglist
= add_outermost_template_args (tmpl_args
, arglist
);
8608 tree parms
= DECL_TEMPLATE_PARMS (templ
);
8609 arglist
= coerce_innermost_template_parms (parms
, arglist
, templ
, complain
,
8611 /*use_default*/true);
8613 if (flag_concepts
&& !constraints_satisfied_p (templ
, arglist
))
8615 if (complain
& tf_error
)
8617 error ("constraints for %qD not satisfied", templ
);
8618 diagnose_constraints (location_of (var
), templ
, arglist
);
8620 return error_mark_node
;
8623 /* If a template-id refers to a specialization of a variable
8624 concept, then the expression is true if and only if the
8625 concept's constraints are satisfied by the given template
8628 NOTE: This is an extension of Concepts Lite TS that
8629 allows constraints to be used in expressions. */
8632 tree decl
= DECL_TEMPLATE_RESULT (templ
);
8633 return evaluate_variable_concept (decl
, arglist
);
8636 return instantiate_template (templ
, arglist
, complain
);
8643 /* True when we should also visit template parameters that occur in
8644 non-deduced contexts. */
8645 bool include_nondeduced_p
;
8646 hash_set
<tree
> *visited
;
8649 /* Called from for_each_template_parm via walk_tree. */
8652 for_each_template_parm_r (tree
*tp
, int *walk_subtrees
, void *d
)
8655 struct pair_fn_data
*pfd
= (struct pair_fn_data
*) d
;
8656 tree_fn_t fn
= pfd
->fn
;
8657 void *data
= pfd
->data
;
8660 && (pfd
->include_nondeduced_p
|| TREE_CODE (t
) != TYPENAME_TYPE
)
8661 && for_each_template_parm (TYPE_CONTEXT (t
), fn
, data
, pfd
->visited
,
8662 pfd
->include_nondeduced_p
))
8663 return error_mark_node
;
8665 switch (TREE_CODE (t
))
8668 if (TYPE_PTRMEMFUNC_P (t
))
8674 if (!TYPE_TEMPLATE_INFO (t
))
8676 else if (for_each_template_parm (TYPE_TI_ARGS (t
),
8677 fn
, data
, pfd
->visited
,
8678 pfd
->include_nondeduced_p
))
8679 return error_mark_node
;
8683 if (for_each_template_parm (TYPE_MIN_VALUE (t
),
8684 fn
, data
, pfd
->visited
,
8685 pfd
->include_nondeduced_p
)
8686 || for_each_template_parm (TYPE_MAX_VALUE (t
),
8687 fn
, data
, pfd
->visited
,
8688 pfd
->include_nondeduced_p
))
8689 return error_mark_node
;
8693 /* Since we're not going to walk subtrees, we have to do this
8695 if (for_each_template_parm (TYPE_METHOD_BASETYPE (t
), fn
, data
,
8696 pfd
->visited
, pfd
->include_nondeduced_p
))
8697 return error_mark_node
;
8701 /* Check the return type. */
8702 if (for_each_template_parm (TREE_TYPE (t
), fn
, data
, pfd
->visited
,
8703 pfd
->include_nondeduced_p
))
8704 return error_mark_node
;
8706 /* Check the parameter types. Since default arguments are not
8707 instantiated until they are needed, the TYPE_ARG_TYPES may
8708 contain expressions that involve template parameters. But,
8709 no-one should be looking at them yet. And, once they're
8710 instantiated, they don't contain template parameters, so
8711 there's no point in looking at them then, either. */
8715 for (parm
= TYPE_ARG_TYPES (t
); parm
; parm
= TREE_CHAIN (parm
))
8716 if (for_each_template_parm (TREE_VALUE (parm
), fn
, data
,
8717 pfd
->visited
, pfd
->include_nondeduced_p
))
8718 return error_mark_node
;
8720 /* Since we've already handled the TYPE_ARG_TYPES, we don't
8721 want walk_tree walking into them itself. */
8727 case UNDERLYING_TYPE
:
8728 if (pfd
->include_nondeduced_p
8729 && for_each_template_parm (TYPE_VALUES_RAW (t
), fn
, data
,
8731 pfd
->include_nondeduced_p
))
8732 return error_mark_node
;
8737 if (DECL_LANG_SPECIFIC (t
) && DECL_TEMPLATE_INFO (t
)
8738 && for_each_template_parm (DECL_TI_ARGS (t
), fn
, data
,
8739 pfd
->visited
, pfd
->include_nondeduced_p
))
8740 return error_mark_node
;
8745 if (TREE_CODE (t
) == CONST_DECL
&& DECL_TEMPLATE_PARM_P (t
)
8746 && for_each_template_parm (DECL_INITIAL (t
), fn
, data
,
8747 pfd
->visited
, pfd
->include_nondeduced_p
))
8748 return error_mark_node
;
8749 if (DECL_CONTEXT (t
)
8750 && pfd
->include_nondeduced_p
8751 && for_each_template_parm (DECL_CONTEXT (t
), fn
, data
,
8752 pfd
->visited
, pfd
->include_nondeduced_p
))
8753 return error_mark_node
;
8756 case BOUND_TEMPLATE_TEMPLATE_PARM
:
8757 /* Record template parameters such as `T' inside `TT<T>'. */
8758 if (for_each_template_parm (TYPE_TI_ARGS (t
), fn
, data
, pfd
->visited
,
8759 pfd
->include_nondeduced_p
))
8760 return error_mark_node
;
8763 case TEMPLATE_TEMPLATE_PARM
:
8764 case TEMPLATE_TYPE_PARM
:
8765 case TEMPLATE_PARM_INDEX
:
8766 if (fn
&& (*fn
)(t
, data
))
8767 return error_mark_node
;
8769 return error_mark_node
;
8773 /* A template template parameter is encountered. */
8774 if (DECL_TEMPLATE_TEMPLATE_PARM_P (t
)
8775 && for_each_template_parm (TREE_TYPE (t
), fn
, data
, pfd
->visited
,
8776 pfd
->include_nondeduced_p
))
8777 return error_mark_node
;
8779 /* Already substituted template template parameter */
8785 || for_each_template_parm (TYPENAME_TYPE_FULLNAME (t
), fn
,
8787 pfd
->include_nondeduced_p
))
8788 return error_mark_node
;
8792 if (TREE_TYPE (t
) && TYPE_PTRMEMFUNC_P (TREE_TYPE (t
))
8793 && pfd
->include_nondeduced_p
8794 && for_each_template_parm (TYPE_PTRMEMFUNC_FN_TYPE
8795 (TREE_TYPE (t
)), fn
, data
,
8796 pfd
->visited
, pfd
->include_nondeduced_p
))
8797 return error_mark_node
;
8802 /* If there's no type, then this thing must be some expression
8803 involving template parameters. */
8804 if (!fn
&& !TREE_TYPE (t
))
8805 return error_mark_node
;
8810 case IMPLICIT_CONV_EXPR
:
8811 case REINTERPRET_CAST_EXPR
:
8812 case CONST_CAST_EXPR
:
8813 case STATIC_CAST_EXPR
:
8814 case DYNAMIC_CAST_EXPR
:
8818 case PSEUDO_DTOR_EXPR
:
8820 return error_mark_node
;
8827 /* We didn't find any template parameters we liked. */
8831 /* For each TEMPLATE_TYPE_PARM, TEMPLATE_TEMPLATE_PARM,
8832 BOUND_TEMPLATE_TEMPLATE_PARM or TEMPLATE_PARM_INDEX in T,
8833 call FN with the parameter and the DATA.
8834 If FN returns nonzero, the iteration is terminated, and
8835 for_each_template_parm returns 1. Otherwise, the iteration
8836 continues. If FN never returns a nonzero value, the value
8837 returned by for_each_template_parm is 0. If FN is NULL, it is
8838 considered to be the function which always returns 1.
8840 If INCLUDE_NONDEDUCED_P, then this routine will also visit template
8841 parameters that occur in non-deduced contexts. When false, only
8842 visits those template parameters that can be deduced. */
8845 for_each_template_parm (tree t
, tree_fn_t fn
, void* data
,
8846 hash_set
<tree
> *visited
,
8847 bool include_nondeduced_p
)
8849 struct pair_fn_data pfd
;
8855 pfd
.include_nondeduced_p
= include_nondeduced_p
;
8857 /* Walk the tree. (Conceptually, we would like to walk without
8858 duplicates, but for_each_template_parm_r recursively calls
8859 for_each_template_parm, so we would need to reorganize a fair
8860 bit to use walk_tree_without_duplicates, so we keep our own
8863 pfd
.visited
= visited
;
8865 pfd
.visited
= new hash_set
<tree
>;
8866 result
= cp_walk_tree (&t
,
8867 for_each_template_parm_r
,
8869 pfd
.visited
) != NULL_TREE
;
8881 /* Returns true if T depends on any template parameter. */
8884 uses_template_parms (tree t
)
8890 int saved_processing_template_decl
;
8892 saved_processing_template_decl
= processing_template_decl
;
8893 if (!saved_processing_template_decl
)
8894 processing_template_decl
= 1;
8896 dependent_p
= dependent_type_p (t
);
8897 else if (TREE_CODE (t
) == TREE_VEC
)
8898 dependent_p
= any_dependent_template_arguments_p (t
);
8899 else if (TREE_CODE (t
) == TREE_LIST
)
8900 dependent_p
= (uses_template_parms (TREE_VALUE (t
))
8901 || uses_template_parms (TREE_CHAIN (t
)));
8902 else if (TREE_CODE (t
) == TYPE_DECL
)
8903 dependent_p
= dependent_type_p (TREE_TYPE (t
));
8906 || TREE_CODE (t
) == TEMPLATE_PARM_INDEX
8907 || TREE_CODE (t
) == OVERLOAD
8910 || TREE_CODE (t
) == TRAIT_EXPR
8911 || TREE_CODE (t
) == CONSTRUCTOR
8912 || CONSTANT_CLASS_P (t
))
8913 dependent_p
= (type_dependent_expression_p (t
)
8914 || value_dependent_expression_p (t
));
8917 gcc_assert (t
== error_mark_node
);
8918 dependent_p
= false;
8921 processing_template_decl
= saved_processing_template_decl
;
8926 /* Returns true iff current_function_decl is an incompletely instantiated
8927 template. Useful instead of processing_template_decl because the latter
8928 is set to 0 during instantiate_non_dependent_expr. */
8931 in_template_function (void)
8933 tree fn
= current_function_decl
;
8935 ++processing_template_decl
;
8936 ret
= (fn
&& DECL_LANG_SPECIFIC (fn
)
8937 && DECL_TEMPLATE_INFO (fn
)
8938 && any_dependent_template_arguments_p (DECL_TI_ARGS (fn
)));
8939 --processing_template_decl
;
8943 /* Returns true if T depends on any template parameter with level LEVEL. */
8946 uses_template_parms_level (tree t
, int level
)
8948 return for_each_template_parm (t
, template_parm_this_level_p
, &level
, NULL
,
8949 /*include_nondeduced_p=*/true);
8952 /* Returns TRUE iff INST is an instantiation we don't need to do in an
8953 ill-formed translation unit, i.e. a variable or function that isn't
8954 usable in a constant expression. */
8957 neglectable_inst_p (tree d
)
8960 && !(TREE_CODE (d
) == FUNCTION_DECL
? DECL_DECLARED_CONSTEXPR_P (d
)
8961 : decl_maybe_constant_var_p (d
)));
8964 /* Returns TRUE iff we should refuse to instantiate DECL because it's
8965 neglectable and instantiated from within an erroneous instantiation. */
8968 limit_bad_template_recursion (tree decl
)
8970 struct tinst_level
*lev
= current_tinst_level
;
8971 int errs
= errorcount
+ sorrycount
;
8972 if (lev
== NULL
|| errs
== 0 || !neglectable_inst_p (decl
))
8975 for (; lev
; lev
= lev
->next
)
8976 if (neglectable_inst_p (lev
->decl
))
8979 return (lev
&& errs
> lev
->errors
);
8982 static int tinst_depth
;
8983 extern int max_tinst_depth
;
8986 static GTY(()) struct tinst_level
*last_error_tinst_level
;
8988 /* We're starting to instantiate D; record the template instantiation context
8989 for diagnostics and to restore it later. */
8992 push_tinst_level (tree d
)
8994 return push_tinst_level_loc (d
, input_location
);
8997 /* We're starting to instantiate D; record the template instantiation context
8998 at LOC for diagnostics and to restore it later. */
9001 push_tinst_level_loc (tree d
, location_t loc
)
9003 struct tinst_level
*new_level
;
9005 if (tinst_depth
>= max_tinst_depth
)
9007 fatal_error (input_location
,
9008 "template instantiation depth exceeds maximum of %d"
9009 " (use -ftemplate-depth= to increase the maximum)",
9014 /* If the current instantiation caused problems, don't let it instantiate
9015 anything else. Do allow deduction substitution and decls usable in
9016 constant expressions. */
9017 if (limit_bad_template_recursion (d
))
9020 new_level
= ggc_alloc
<tinst_level
> ();
9021 new_level
->decl
= d
;
9022 new_level
->locus
= loc
;
9023 new_level
->errors
= errorcount
+sorrycount
;
9024 new_level
->in_system_header_p
= in_system_header_at (input_location
);
9025 new_level
->next
= current_tinst_level
;
9026 current_tinst_level
= new_level
;
9029 if (GATHER_STATISTICS
&& (tinst_depth
> depth_reached
))
9030 depth_reached
= tinst_depth
;
9035 /* We're done instantiating this template; return to the instantiation
9039 pop_tinst_level (void)
9041 /* Restore the filename and line number stashed away when we started
9042 this instantiation. */
9043 input_location
= current_tinst_level
->locus
;
9044 current_tinst_level
= current_tinst_level
->next
;
9048 /* We're instantiating a deferred template; restore the template
9049 instantiation context in which the instantiation was requested, which
9050 is one step out from LEVEL. Return the corresponding DECL or TYPE. */
9053 reopen_tinst_level (struct tinst_level
*level
)
9055 struct tinst_level
*t
;
9058 for (t
= level
; t
; t
= t
->next
)
9061 current_tinst_level
= level
;
9063 if (current_tinst_level
)
9064 current_tinst_level
->errors
= errorcount
+sorrycount
;
9068 /* Returns the TINST_LEVEL which gives the original instantiation
9071 struct tinst_level
*
9072 outermost_tinst_level (void)
9074 struct tinst_level
*level
= current_tinst_level
;
9077 level
= level
->next
;
9081 /* DECL is a friend FUNCTION_DECL or TEMPLATE_DECL. ARGS is the
9082 vector of template arguments, as for tsubst.
9084 Returns an appropriate tsubst'd friend declaration. */
9087 tsubst_friend_function (tree decl
, tree args
)
9091 if (TREE_CODE (decl
) == FUNCTION_DECL
9092 && DECL_TEMPLATE_INSTANTIATION (decl
)
9093 && TREE_CODE (DECL_TI_TEMPLATE (decl
)) != TEMPLATE_DECL
)
9094 /* This was a friend declared with an explicit template
9095 argument list, e.g.:
9099 to indicate that f was a template instantiation, not a new
9100 function declaration. Now, we have to figure out what
9101 instantiation of what template. */
9103 tree template_id
, arglist
, fns
;
9106 tree ns
= decl_namespace_context (TYPE_MAIN_DECL (current_class_type
));
9108 /* Friend functions are looked up in the containing namespace scope.
9109 We must enter that scope, to avoid finding member functions of the
9110 current class with same name. */
9111 push_nested_namespace (ns
);
9112 fns
= tsubst_expr (DECL_TI_TEMPLATE (decl
), args
,
9113 tf_warning_or_error
, NULL_TREE
,
9114 /*integral_constant_expression_p=*/false);
9115 pop_nested_namespace (ns
);
9116 arglist
= tsubst (DECL_TI_ARGS (decl
), args
,
9117 tf_warning_or_error
, NULL_TREE
);
9118 template_id
= lookup_template_function (fns
, arglist
);
9120 new_friend
= tsubst (decl
, args
, tf_warning_or_error
, NULL_TREE
);
9121 tmpl
= determine_specialization (template_id
, new_friend
,
9123 /*need_member_template=*/0,
9124 TREE_VEC_LENGTH (args
),
9126 return instantiate_template (tmpl
, new_args
, tf_error
);
9129 new_friend
= tsubst (decl
, args
, tf_warning_or_error
, NULL_TREE
);
9131 /* The NEW_FRIEND will look like an instantiation, to the
9132 compiler, but is not an instantiation from the point of view of
9133 the language. For example, we might have had:
9135 template <class T> struct S {
9136 template <class U> friend void f(T, U);
9139 Then, in S<int>, template <class U> void f(int, U) is not an
9140 instantiation of anything. */
9141 if (new_friend
== error_mark_node
)
9142 return error_mark_node
;
9144 DECL_USE_TEMPLATE (new_friend
) = 0;
9145 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
9147 DECL_USE_TEMPLATE (DECL_TEMPLATE_RESULT (new_friend
)) = 0;
9148 DECL_SAVED_TREE (DECL_TEMPLATE_RESULT (new_friend
))
9149 = DECL_SAVED_TREE (DECL_TEMPLATE_RESULT (decl
));
9152 /* The mangled name for the NEW_FRIEND is incorrect. The function
9153 is not a template instantiation and should not be mangled like
9154 one. Therefore, we forget the mangling here; we'll recompute it
9155 later if we need it. */
9156 if (TREE_CODE (new_friend
) != TEMPLATE_DECL
)
9158 SET_DECL_RTL (new_friend
, NULL
);
9159 SET_DECL_ASSEMBLER_NAME (new_friend
, NULL_TREE
);
9162 if (DECL_NAMESPACE_SCOPE_P (new_friend
))
9165 tree new_friend_template_info
;
9166 tree new_friend_result_template_info
;
9168 int new_friend_is_defn
;
9170 /* We must save some information from NEW_FRIEND before calling
9171 duplicate decls since that function will free NEW_FRIEND if
9173 new_friend_template_info
= DECL_TEMPLATE_INFO (new_friend
);
9174 new_friend_is_defn
=
9175 (DECL_INITIAL (DECL_TEMPLATE_RESULT
9176 (template_for_substitution (new_friend
)))
9178 if (TREE_CODE (new_friend
) == TEMPLATE_DECL
)
9180 /* This declaration is a `primary' template. */
9181 DECL_PRIMARY_TEMPLATE (new_friend
) = new_friend
;
9183 new_friend_result_template_info
9184 = DECL_TEMPLATE_INFO (DECL_TEMPLATE_RESULT (new_friend
));
9187 new_friend_result_template_info
= NULL_TREE
;
9189 /* Make the init_value nonzero so pushdecl knows this is a defn. */
9190 if (new_friend_is_defn
)
9191 DECL_INITIAL (new_friend
) = error_mark_node
;
9193 /* Inside pushdecl_namespace_level, we will push into the
9194 current namespace. However, the friend function should go
9195 into the namespace of the template. */
9196 ns
= decl_namespace_context (new_friend
);
9197 push_nested_namespace (ns
);
9198 old_decl
= pushdecl_namespace_level (new_friend
, /*is_friend=*/true);
9199 pop_nested_namespace (ns
);
9201 if (old_decl
== error_mark_node
)
9202 return error_mark_node
;
9204 if (old_decl
!= new_friend
)
9206 /* This new friend declaration matched an existing
9207 declaration. For example, given:
9209 template <class T> void f(T);
9210 template <class U> class C {
9211 template <class T> friend void f(T) {}
9214 the friend declaration actually provides the definition
9215 of `f', once C has been instantiated for some type. So,
9216 old_decl will be the out-of-class template declaration,
9217 while new_friend is the in-class definition.
9219 But, if `f' was called before this point, the
9220 instantiation of `f' will have DECL_TI_ARGS corresponding
9221 to `T' but not to `U', references to which might appear
9222 in the definition of `f'. Previously, the most general
9223 template for an instantiation of `f' was the out-of-class
9224 version; now it is the in-class version. Therefore, we
9225 run through all specialization of `f', adding to their
9226 DECL_TI_ARGS appropriately. In particular, they need a
9227 new set of outer arguments, corresponding to the
9228 arguments for this class instantiation.
9230 The same situation can arise with something like this:
9233 template <class T> class C {
9237 when `C<int>' is instantiated. Now, `f(int)' is defined
9240 if (!new_friend_is_defn
)
9241 /* On the other hand, if the in-class declaration does
9242 *not* provide a definition, then we don't want to alter
9243 existing definitions. We can just leave everything
9248 tree new_template
= TI_TEMPLATE (new_friend_template_info
);
9249 tree new_args
= TI_ARGS (new_friend_template_info
);
9251 /* Overwrite whatever template info was there before, if
9252 any, with the new template information pertaining to
9254 DECL_TEMPLATE_INFO (old_decl
) = new_friend_template_info
;
9256 if (TREE_CODE (old_decl
) != TEMPLATE_DECL
)
9258 /* We should have called reregister_specialization in
9260 gcc_assert (retrieve_specialization (new_template
,
9264 /* Instantiate it if the global has already been used. */
9265 if (DECL_ODR_USED (old_decl
))
9266 instantiate_decl (old_decl
, /*defer_ok=*/true,
9267 /*expl_inst_class_mem_p=*/false);
9273 /* Indicate that the old function template is a partial
9275 DECL_TEMPLATE_INFO (DECL_TEMPLATE_RESULT (old_decl
))
9276 = new_friend_result_template_info
;
9278 gcc_assert (new_template
9279 == most_general_template (new_template
));
9280 gcc_assert (new_template
!= old_decl
);
9282 /* Reassign any specializations already in the hash table
9283 to the new more general template, and add the
9284 additional template args. */
9285 for (t
= DECL_TEMPLATE_INSTANTIATIONS (old_decl
);
9289 tree spec
= TREE_VALUE (t
);
9292 elt
.tmpl
= old_decl
;
9293 elt
.args
= DECL_TI_ARGS (spec
);
9294 elt
.spec
= NULL_TREE
;
9296 decl_specializations
->remove_elt (&elt
);
9299 = add_outermost_template_args (new_args
,
9300 DECL_TI_ARGS (spec
));
9302 register_specialization
9303 (spec
, new_template
, DECL_TI_ARGS (spec
), true, 0);
9306 DECL_TEMPLATE_INSTANTIATIONS (old_decl
) = NULL_TREE
;
9310 /* The information from NEW_FRIEND has been merged into OLD_DECL
9311 by duplicate_decls. */
9312 new_friend
= old_decl
;
9317 tree context
= DECL_CONTEXT (new_friend
);
9321 template <class T> class C {
9322 template <class U> friend void C1<U>::f (); // case 1
9323 friend void C2<T>::f (); // case 2
9325 we only need to make sure CONTEXT is a complete type for
9326 case 2. To distinguish between the two cases, we note that
9327 CONTEXT of case 1 remains dependent type after tsubst while
9328 this isn't true for case 2. */
9329 ++processing_template_decl
;
9330 dependent_p
= dependent_type_p (context
);
9331 --processing_template_decl
;
9334 && !complete_type_or_else (context
, NULL_TREE
))
9335 return error_mark_node
;
9337 if (COMPLETE_TYPE_P (context
))
9339 tree fn
= new_friend
;
9340 /* do_friend adds the TEMPLATE_DECL for any member friend
9341 template even if it isn't a member template, i.e.
9342 template <class T> friend A<T>::f();
9343 Look through it in that case. */
9344 if (TREE_CODE (fn
) == TEMPLATE_DECL
9345 && !PRIMARY_TEMPLATE_P (fn
))
9346 fn
= DECL_TEMPLATE_RESULT (fn
);
9347 /* Check to see that the declaration is really present, and,
9348 possibly obtain an improved declaration. */
9349 fn
= check_classfn (context
, fn
, NULL_TREE
);
9359 /* FRIEND_TMPL is a friend TEMPLATE_DECL. ARGS is the vector of
9360 template arguments, as for tsubst.
9362 Returns an appropriate tsubst'd friend type or error_mark_node on
9366 tsubst_friend_class (tree friend_tmpl
, tree args
)
9372 if (DECL_TEMPLATE_TEMPLATE_PARM_P (friend_tmpl
))
9374 tree t
= tsubst (TREE_TYPE (friend_tmpl
), args
, tf_none
, NULL_TREE
);
9375 return TREE_TYPE (t
);
9378 context
= CP_DECL_CONTEXT (friend_tmpl
);
9380 if (context
!= global_namespace
)
9382 if (TREE_CODE (context
) == NAMESPACE_DECL
)
9383 push_nested_namespace (context
);
9385 push_nested_class (tsubst (context
, args
, tf_none
, NULL_TREE
));
9388 /* Look for a class template declaration. We look for hidden names
9389 because two friend declarations of the same template are the
9390 same. For example, in:
9393 template <typename> friend class F;
9395 template <typename> struct B {
9396 template <typename> friend class F;
9399 both F templates are the same. */
9400 tmpl
= lookup_name_real (DECL_NAME (friend_tmpl
), 0, 0,
9401 /*block_p=*/true, 0, LOOKUP_HIDDEN
);
9403 /* But, if we don't find one, it might be because we're in a
9404 situation like this:
9412 Here, in the scope of (say) S<int>, `S' is bound to a TYPE_DECL
9413 for `S<int>', not the TEMPLATE_DECL. */
9414 if (!tmpl
|| !DECL_CLASS_TEMPLATE_P (tmpl
))
9416 tmpl
= lookup_name_prefer_type (DECL_NAME (friend_tmpl
), 1);
9417 tmpl
= maybe_get_template_decl_from_type_decl (tmpl
);
9420 if (tmpl
&& DECL_CLASS_TEMPLATE_P (tmpl
))
9422 /* The friend template has already been declared. Just
9423 check to see that the declarations match, and install any new
9424 default parameters. We must tsubst the default parameters,
9425 of course. We only need the innermost template parameters
9426 because that is all that redeclare_class_template will look
9428 if (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (friend_tmpl
))
9429 > TMPL_ARGS_DEPTH (args
))
9432 location_t saved_input_location
;
9433 parms
= tsubst_template_parms (DECL_TEMPLATE_PARMS (friend_tmpl
),
9434 args
, tf_warning_or_error
);
9436 saved_input_location
= input_location
;
9437 input_location
= DECL_SOURCE_LOCATION (friend_tmpl
);
9438 tree cons
= get_constraints (tmpl
);
9439 redeclare_class_template (TREE_TYPE (tmpl
), parms
, cons
);
9440 input_location
= saved_input_location
;
9444 friend_type
= TREE_TYPE (tmpl
);
9448 /* The friend template has not already been declared. In this
9449 case, the instantiation of the template class will cause the
9450 injection of this template into the global scope. */
9451 tmpl
= tsubst (friend_tmpl
, args
, tf_warning_or_error
, NULL_TREE
);
9452 if (tmpl
== error_mark_node
)
9453 return error_mark_node
;
9455 /* The new TMPL is not an instantiation of anything, so we
9456 forget its origins. We don't reset CLASSTYPE_TI_TEMPLATE for
9457 the new type because that is supposed to be the corresponding
9458 template decl, i.e., TMPL. */
9459 DECL_USE_TEMPLATE (tmpl
) = 0;
9460 DECL_TEMPLATE_INFO (tmpl
) = NULL_TREE
;
9461 CLASSTYPE_USE_TEMPLATE (TREE_TYPE (tmpl
)) = 0;
9462 CLASSTYPE_TI_ARGS (TREE_TYPE (tmpl
))
9463 = INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (TREE_TYPE (tmpl
)));
9465 /* Inject this template into the global scope. */
9466 friend_type
= TREE_TYPE (pushdecl_top_level_maybe_friend (tmpl
, true));
9469 if (context
!= global_namespace
)
9471 if (TREE_CODE (context
) == NAMESPACE_DECL
)
9472 pop_nested_namespace (context
);
9474 pop_nested_class ();
9480 /* Returns zero if TYPE cannot be completed later due to circularity.
9481 Otherwise returns one. */
9484 can_complete_type_without_circularity (tree type
)
9486 if (type
== NULL_TREE
|| type
== error_mark_node
)
9488 else if (COMPLETE_TYPE_P (type
))
9490 else if (TREE_CODE (type
) == ARRAY_TYPE
&& TYPE_DOMAIN (type
))
9491 return can_complete_type_without_circularity (TREE_TYPE (type
));
9492 else if (CLASS_TYPE_P (type
)
9493 && TYPE_BEING_DEFINED (TYPE_MAIN_VARIANT (type
)))
9499 static tree
tsubst_omp_clauses (tree
, bool, tree
, tsubst_flags_t
, tree
);
9501 /* Apply any attributes which had to be deferred until instantiation
9502 time. DECL_P, ATTRIBUTES and ATTR_FLAGS are as cplus_decl_attributes;
9503 ARGS, COMPLAIN, IN_DECL are as tsubst. */
9506 apply_late_template_attributes (tree
*decl_p
, tree attributes
, int attr_flags
,
9507 tree args
, tsubst_flags_t complain
, tree in_decl
)
9509 tree last_dep
= NULL_TREE
;
9513 for (t
= attributes
; t
; t
= TREE_CHAIN (t
))
9514 if (ATTR_IS_DEPENDENT (t
))
9517 attributes
= copy_list (attributes
);
9521 if (DECL_P (*decl_p
))
9523 if (TREE_TYPE (*decl_p
) == error_mark_node
)
9525 p
= &DECL_ATTRIBUTES (*decl_p
);
9528 p
= &TYPE_ATTRIBUTES (*decl_p
);
9532 tree late_attrs
= NULL_TREE
;
9533 tree
*q
= &late_attrs
;
9535 for (*p
= attributes
; *p
; )
9538 if (ATTR_IS_DEPENDENT (t
))
9540 *p
= TREE_CHAIN (t
);
9541 TREE_CHAIN (t
) = NULL_TREE
;
9542 if ((flag_openmp
|| flag_openmp_simd
|| flag_cilkplus
)
9543 && is_attribute_p ("omp declare simd",
9544 get_attribute_name (t
))
9547 tree clauses
= TREE_VALUE (TREE_VALUE (t
));
9548 clauses
= tsubst_omp_clauses (clauses
, true, args
,
9550 c_omp_declare_simd_clauses_to_decls (*decl_p
, clauses
);
9551 clauses
= finish_omp_clauses (clauses
);
9552 tree parms
= DECL_ARGUMENTS (*decl_p
);
9554 = c_omp_declare_simd_clauses_to_numbers (parms
, clauses
);
9556 TREE_VALUE (TREE_VALUE (t
)) = clauses
;
9558 TREE_VALUE (t
) = NULL_TREE
;
9560 /* If the first attribute argument is an identifier, don't
9561 pass it through tsubst. Attributes like mode, format,
9562 cleanup and several target specific attributes expect it
9564 else if (attribute_takes_identifier_p (get_attribute_name (t
))
9568 = tsubst_expr (TREE_CHAIN (TREE_VALUE (t
)), args
, complain
,
9570 /*integral_constant_expression_p=*/false);
9571 if (chain
!= TREE_CHAIN (TREE_VALUE (t
)))
9573 = tree_cons (NULL_TREE
, TREE_VALUE (TREE_VALUE (t
)),
9576 else if (TREE_VALUE (t
) && PACK_EXPANSION_P (TREE_VALUE (t
)))
9578 /* An attribute pack expansion. */
9579 tree purp
= TREE_PURPOSE (t
);
9580 tree pack
= (tsubst_pack_expansion
9581 (TREE_VALUE (t
), args
, complain
, in_decl
));
9582 int len
= TREE_VEC_LENGTH (pack
);
9583 for (int i
= 0; i
< len
; ++i
)
9585 tree elt
= TREE_VEC_ELT (pack
, i
);
9586 *q
= build_tree_list (purp
, elt
);
9587 q
= &TREE_CHAIN (*q
);
9593 = tsubst_expr (TREE_VALUE (t
), args
, complain
, in_decl
,
9594 /*integral_constant_expression_p=*/false);
9596 q
= &TREE_CHAIN (t
);
9599 p
= &TREE_CHAIN (t
);
9602 cplus_decl_attributes (decl_p
, late_attrs
, attr_flags
);
9606 /* Perform (or defer) access check for typedefs that were referenced
9607 from within the template TMPL code.
9608 This is a subroutine of instantiate_decl and instantiate_class_template.
9609 TMPL is the template to consider and TARGS is the list of arguments of
9613 perform_typedefs_access_check (tree tmpl
, tree targs
)
9615 location_t saved_location
;
9617 qualified_typedef_usage_t
*iter
;
9620 || (!CLASS_TYPE_P (tmpl
)
9621 && TREE_CODE (tmpl
) != FUNCTION_DECL
))
9624 saved_location
= input_location
;
9625 FOR_EACH_VEC_SAFE_ELT (get_types_needing_access_check (tmpl
), i
, iter
)
9627 tree type_decl
= iter
->typedef_decl
;
9628 tree type_scope
= iter
->context
;
9630 if (!type_decl
|| !type_scope
|| !CLASS_TYPE_P (type_scope
))
9633 if (uses_template_parms (type_decl
))
9634 type_decl
= tsubst (type_decl
, targs
, tf_error
, NULL_TREE
);
9635 if (uses_template_parms (type_scope
))
9636 type_scope
= tsubst (type_scope
, targs
, tf_error
, NULL_TREE
);
9638 /* Make access check error messages point to the location
9639 of the use of the typedef. */
9640 input_location
= iter
->locus
;
9641 perform_or_defer_access_check (TYPE_BINFO (type_scope
),
9642 type_decl
, type_decl
,
9643 tf_warning_or_error
);
9645 input_location
= saved_location
;
9649 instantiate_class_template_1 (tree type
)
9651 tree templ
, args
, pattern
, t
, member
;
9655 unsigned int saved_maximum_field_alignment
;
9658 if (type
== error_mark_node
)
9659 return error_mark_node
;
9661 if (COMPLETE_OR_OPEN_TYPE_P (type
)
9662 || uses_template_parms (type
))
9665 /* Figure out which template is being instantiated. */
9666 templ
= most_general_template (CLASSTYPE_TI_TEMPLATE (type
));
9667 gcc_assert (TREE_CODE (templ
) == TEMPLATE_DECL
);
9669 /* Determine what specialization of the original template to
9671 t
= most_specialized_partial_spec (type
, tf_warning_or_error
);
9672 if (t
== error_mark_node
)
9674 TYPE_BEING_DEFINED (type
) = 1;
9675 return error_mark_node
;
9679 /* This TYPE is actually an instantiation of a partial
9680 specialization. We replace the innermost set of ARGS with
9681 the arguments appropriate for substitution. For example,
9684 template <class T> struct S {};
9685 template <class T> struct S<T*> {};
9687 and supposing that we are instantiating S<int*>, ARGS will
9688 presently be {int*} -- but we need {int}. */
9689 pattern
= TREE_TYPE (t
);
9690 args
= TREE_PURPOSE (t
);
9694 pattern
= TREE_TYPE (templ
);
9695 args
= CLASSTYPE_TI_ARGS (type
);
9698 /* If the template we're instantiating is incomplete, then clearly
9699 there's nothing we can do. */
9700 if (!COMPLETE_TYPE_P (pattern
))
9703 /* If we've recursively instantiated too many templates, stop. */
9704 if (! push_tinst_level (type
))
9707 /* Now we're really doing the instantiation. Mark the type as in
9708 the process of being defined. */
9709 TYPE_BEING_DEFINED (type
) = 1;
9711 /* We may be in the middle of deferred access check. Disable
9713 push_deferring_access_checks (dk_no_deferred
);
9715 int saved_unevaluated_operand
= cp_unevaluated_operand
;
9716 int saved_inhibit_evaluation_warnings
= c_inhibit_evaluation_warnings
;
9718 fn_context
= decl_function_context (TYPE_MAIN_DECL (type
));
9719 /* Also avoid push_to_top_level for a lambda in an NSDMI. */
9720 if (!fn_context
&& LAMBDA_TYPE_P (type
) && TYPE_CLASS_SCOPE_P (type
))
9721 fn_context
= error_mark_node
;
9723 push_to_top_level ();
9726 cp_unevaluated_operand
= 0;
9727 c_inhibit_evaluation_warnings
= 0;
9729 /* Use #pragma pack from the template context. */
9730 saved_maximum_field_alignment
= maximum_field_alignment
;
9731 maximum_field_alignment
= TYPE_PRECISION (pattern
);
9733 SET_CLASSTYPE_INTERFACE_UNKNOWN (type
);
9735 /* Set the input location to the most specialized template definition.
9736 This is needed if tsubsting causes an error. */
9737 typedecl
= TYPE_MAIN_DECL (pattern
);
9738 input_location
= DECL_SOURCE_LOCATION (TYPE_NAME (type
)) =
9739 DECL_SOURCE_LOCATION (typedecl
);
9741 TYPE_PACKED (type
) = TYPE_PACKED (pattern
);
9742 TYPE_ALIGN (type
) = TYPE_ALIGN (pattern
);
9743 TYPE_USER_ALIGN (type
) = TYPE_USER_ALIGN (pattern
);
9744 TYPE_FOR_JAVA (type
) = TYPE_FOR_JAVA (pattern
); /* For libjava's JArray<T> */
9745 if (ANON_AGGR_TYPE_P (pattern
))
9746 SET_ANON_AGGR_TYPE_P (type
);
9747 if (CLASSTYPE_VISIBILITY_SPECIFIED (pattern
))
9749 CLASSTYPE_VISIBILITY_SPECIFIED (type
) = 1;
9750 CLASSTYPE_VISIBILITY (type
) = CLASSTYPE_VISIBILITY (pattern
);
9751 /* Adjust visibility for template arguments. */
9752 determine_visibility (TYPE_MAIN_DECL (type
));
9754 if (CLASS_TYPE_P (type
))
9755 CLASSTYPE_FINAL (type
) = CLASSTYPE_FINAL (pattern
);
9757 pbinfo
= TYPE_BINFO (pattern
);
9759 /* We should never instantiate a nested class before its enclosing
9760 class; we need to look up the nested class by name before we can
9761 instantiate it, and that lookup should instantiate the enclosing
9763 gcc_assert (!DECL_CLASS_SCOPE_P (TYPE_MAIN_DECL (pattern
))
9764 || COMPLETE_OR_OPEN_TYPE_P (TYPE_CONTEXT (type
)));
9766 base_list
= NULL_TREE
;
9767 if (BINFO_N_BASE_BINFOS (pbinfo
))
9773 /* We must enter the scope containing the type, as that is where
9774 the accessibility of types named in dependent bases are
9776 pushed_scope
= push_scope (CP_TYPE_CONTEXT (type
));
9778 /* Substitute into each of the bases to determine the actual
9780 for (i
= 0; BINFO_BASE_ITERATE (pbinfo
, i
, pbase_binfo
); i
++)
9783 tree access
= BINFO_BASE_ACCESS (pbinfo
, i
);
9784 tree expanded_bases
= NULL_TREE
;
9787 if (PACK_EXPANSION_P (BINFO_TYPE (pbase_binfo
)))
9790 tsubst_pack_expansion (BINFO_TYPE (pbase_binfo
),
9791 args
, tf_error
, NULL_TREE
);
9792 if (expanded_bases
== error_mark_node
)
9795 len
= TREE_VEC_LENGTH (expanded_bases
);
9798 for (idx
= 0; idx
< len
; idx
++)
9801 /* Extract the already-expanded base class. */
9802 base
= TREE_VEC_ELT (expanded_bases
, idx
);
9804 /* Substitute to figure out the base class. */
9805 base
= tsubst (BINFO_TYPE (pbase_binfo
), args
, tf_error
,
9808 if (base
== error_mark_node
)
9811 base_list
= tree_cons (access
, base
, base_list
);
9812 if (BINFO_VIRTUAL_P (pbase_binfo
))
9813 TREE_TYPE (base_list
) = integer_type_node
;
9817 /* The list is now in reverse order; correct that. */
9818 base_list
= nreverse (base_list
);
9821 pop_scope (pushed_scope
);
9823 /* Now call xref_basetypes to set up all the base-class
9825 xref_basetypes (type
, base_list
);
9827 apply_late_template_attributes (&type
, TYPE_ATTRIBUTES (pattern
),
9828 (int) ATTR_FLAG_TYPE_IN_PLACE
,
9829 args
, tf_error
, NULL_TREE
);
9830 fixup_attribute_variants (type
);
9832 /* Now that our base classes are set up, enter the scope of the
9833 class, so that name lookups into base classes, etc. will work
9834 correctly. This is precisely analogous to what we do in
9835 begin_class_definition when defining an ordinary non-template
9836 class, except we also need to push the enclosing classes. */
9837 push_nested_class (type
);
9839 /* Now members are processed in the order of declaration. */
9840 for (member
= CLASSTYPE_DECL_LIST (pattern
);
9841 member
; member
= TREE_CHAIN (member
))
9843 tree t
= TREE_VALUE (member
);
9845 if (TREE_PURPOSE (member
))
9849 /* Build new CLASSTYPE_NESTED_UTDS. */
9852 bool class_template_p
;
9854 class_template_p
= (TREE_CODE (t
) != ENUMERAL_TYPE
9855 && TYPE_LANG_SPECIFIC (t
)
9856 && CLASSTYPE_IS_TEMPLATE (t
));
9857 /* If the member is a class template, then -- even after
9858 substitution -- there may be dependent types in the
9859 template argument list for the class. We increment
9860 PROCESSING_TEMPLATE_DECL so that dependent_type_p, as
9861 that function will assume that no types are dependent
9862 when outside of a template. */
9863 if (class_template_p
)
9864 ++processing_template_decl
;
9865 newtag
= tsubst (t
, args
, tf_error
, NULL_TREE
);
9866 if (class_template_p
)
9867 --processing_template_decl
;
9868 if (newtag
== error_mark_node
)
9871 if (TREE_CODE (newtag
) != ENUMERAL_TYPE
)
9873 tree name
= TYPE_IDENTIFIER (t
);
9875 if (class_template_p
)
9876 /* Unfortunately, lookup_template_class sets
9877 CLASSTYPE_IMPLICIT_INSTANTIATION for a partial
9878 instantiation (i.e., for the type of a member
9879 template class nested within a template class.)
9880 This behavior is required for
9881 maybe_process_partial_specialization to work
9882 correctly, but is not accurate in this case;
9883 the TAG is not an instantiation of anything.
9884 (The corresponding TEMPLATE_DECL is an
9885 instantiation, but the TYPE is not.) */
9886 CLASSTYPE_USE_TEMPLATE (newtag
) = 0;
9888 /* Now, we call pushtag to put this NEWTAG into the scope of
9889 TYPE. We first set up the IDENTIFIER_TYPE_VALUE to avoid
9890 pushtag calling push_template_decl. We don't have to do
9891 this for enums because it will already have been done in
9894 SET_IDENTIFIER_TYPE_VALUE (name
, newtag
);
9895 pushtag (name
, newtag
, /*tag_scope=*/ts_current
);
9898 else if (DECL_DECLARES_FUNCTION_P (t
))
9900 /* Build new TYPE_METHODS. */
9903 if (TREE_CODE (t
) == TEMPLATE_DECL
)
9904 ++processing_template_decl
;
9905 r
= tsubst (t
, args
, tf_error
, NULL_TREE
);
9906 if (TREE_CODE (t
) == TEMPLATE_DECL
)
9907 --processing_template_decl
;
9908 set_current_access_from_decl (r
);
9909 finish_member_declaration (r
);
9910 /* Instantiate members marked with attribute used. */
9911 if (r
!= error_mark_node
&& DECL_PRESERVE_P (r
))
9913 if (TREE_CODE (r
) == FUNCTION_DECL
9914 && DECL_OMP_DECLARE_REDUCTION_P (r
))
9915 cp_check_omp_declare_reduction (r
);
9917 else if (DECL_CLASS_TEMPLATE_P (t
)
9918 && LAMBDA_TYPE_P (TREE_TYPE (t
)))
9919 /* A closure type for a lambda in a default argument for a
9920 member template. Ignore it; it will be instantiated with
9921 the default argument. */;
9924 /* Build new TYPE_FIELDS. */
9925 if (TREE_CODE (t
) == STATIC_ASSERT
)
9929 ++c_inhibit_evaluation_warnings
;
9931 tsubst_expr (STATIC_ASSERT_CONDITION (t
), args
,
9932 tf_warning_or_error
, NULL_TREE
,
9933 /*integral_constant_expression_p=*/true);
9934 --c_inhibit_evaluation_warnings
;
9936 finish_static_assert (condition
,
9937 STATIC_ASSERT_MESSAGE (t
),
9938 STATIC_ASSERT_SOURCE_LOCATION (t
),
9941 else if (TREE_CODE (t
) != CONST_DECL
)
9944 tree vec
= NULL_TREE
;
9947 /* The file and line for this declaration, to
9948 assist in error message reporting. Since we
9949 called push_tinst_level above, we don't need to
9951 input_location
= DECL_SOURCE_LOCATION (t
);
9953 if (TREE_CODE (t
) == TEMPLATE_DECL
)
9954 ++processing_template_decl
;
9955 r
= tsubst (t
, args
, tf_warning_or_error
, NULL_TREE
);
9956 if (TREE_CODE (t
) == TEMPLATE_DECL
)
9957 --processing_template_decl
;
9959 if (TREE_CODE (r
) == TREE_VEC
)
9961 /* A capture pack became multiple fields. */
9963 len
= TREE_VEC_LENGTH (vec
);
9966 for (int i
= 0; i
< len
; ++i
)
9969 r
= TREE_VEC_ELT (vec
, i
);
9974 [t]he initialization (and any associated
9975 side-effects) of a static data member does
9976 not occur unless the static data member is
9977 itself used in a way that requires the
9978 definition of the static data member to
9981 Therefore, we do not substitute into the
9982 initialized for the static data member here. */
9983 finish_static_data_member_decl
9986 /*init_const_expr_p=*/false,
9987 /*asmspec_tree=*/NULL_TREE
,
9989 /* Instantiate members marked with attribute used. */
9990 if (r
!= error_mark_node
&& DECL_PRESERVE_P (r
))
9993 else if (TREE_CODE (r
) == FIELD_DECL
)
9995 /* Determine whether R has a valid type and can be
9996 completed later. If R is invalid, then its type
9997 is replaced by error_mark_node. */
9998 tree rtype
= TREE_TYPE (r
);
9999 if (can_complete_type_without_circularity (rtype
))
10000 complete_type (rtype
);
10002 if (!COMPLETE_TYPE_P (rtype
))
10004 cxx_incomplete_type_error (r
, rtype
);
10005 TREE_TYPE (r
) = error_mark_node
;
10009 /* If it is a TYPE_DECL for a class-scoped ENUMERAL_TYPE,
10010 such a thing will already have been added to the field
10011 list by tsubst_enum in finish_member_declaration in the
10012 CLASSTYPE_NESTED_UTDS case above. */
10013 if (!(TREE_CODE (r
) == TYPE_DECL
10014 && TREE_CODE (TREE_TYPE (r
)) == ENUMERAL_TYPE
10015 && DECL_ARTIFICIAL (r
)))
10017 set_current_access_from_decl (r
);
10018 finish_member_declaration (r
);
10026 if (TYPE_P (t
) || DECL_CLASS_TEMPLATE_P (t
)
10027 || DECL_TEMPLATE_TEMPLATE_PARM_P (t
))
10029 /* Build new CLASSTYPE_FRIEND_CLASSES. */
10031 tree friend_type
= t
;
10032 bool adjust_processing_template_decl
= false;
10034 if (TREE_CODE (friend_type
) == TEMPLATE_DECL
)
10036 /* template <class T> friend class C; */
10037 friend_type
= tsubst_friend_class (friend_type
, args
);
10038 adjust_processing_template_decl
= true;
10040 else if (TREE_CODE (friend_type
) == UNBOUND_CLASS_TEMPLATE
)
10042 /* template <class T> friend class C::D; */
10043 friend_type
= tsubst (friend_type
, args
,
10044 tf_warning_or_error
, NULL_TREE
);
10045 if (TREE_CODE (friend_type
) == TEMPLATE_DECL
)
10046 friend_type
= TREE_TYPE (friend_type
);
10047 adjust_processing_template_decl
= true;
10049 else if (TREE_CODE (friend_type
) == TYPENAME_TYPE
10050 || TREE_CODE (friend_type
) == TEMPLATE_TYPE_PARM
)
10052 /* This could be either
10056 when dependent_type_p is false or
10058 template <class U> friend class T::C;
10061 friend_type
= tsubst (friend_type
, args
,
10062 tf_warning_or_error
, NULL_TREE
);
10063 /* Bump processing_template_decl for correct
10064 dependent_type_p calculation. */
10065 ++processing_template_decl
;
10066 if (dependent_type_p (friend_type
))
10067 adjust_processing_template_decl
= true;
10068 --processing_template_decl
;
10070 else if (!CLASSTYPE_USE_TEMPLATE (friend_type
)
10071 && hidden_name_p (TYPE_NAME (friend_type
)))
10075 where C hasn't been declared yet. Let's lookup name
10076 from namespace scope directly, bypassing any name that
10077 come from dependent base class. */
10078 tree ns
= decl_namespace_context (TYPE_MAIN_DECL (friend_type
));
10080 /* The call to xref_tag_from_type does injection for friend
10082 push_nested_namespace (ns
);
10084 xref_tag_from_type (friend_type
, NULL_TREE
,
10085 /*tag_scope=*/ts_current
);
10086 pop_nested_namespace (ns
);
10088 else if (uses_template_parms (friend_type
))
10089 /* friend class C<T>; */
10090 friend_type
= tsubst (friend_type
, args
,
10091 tf_warning_or_error
, NULL_TREE
);
10096 where C is already declared or
10098 friend class C<int>;
10100 We don't have to do anything in these cases. */
10102 if (adjust_processing_template_decl
)
10103 /* Trick make_friend_class into realizing that the friend
10104 we're adding is a template, not an ordinary class. It's
10105 important that we use make_friend_class since it will
10106 perform some error-checking and output cross-reference
10108 ++processing_template_decl
;
10110 if (friend_type
!= error_mark_node
)
10111 make_friend_class (type
, friend_type
, /*complain=*/false);
10113 if (adjust_processing_template_decl
)
10114 --processing_template_decl
;
10118 /* Build new DECL_FRIENDLIST. */
10121 /* The file and line for this declaration, to
10122 assist in error message reporting. Since we
10123 called push_tinst_level above, we don't need to
10125 input_location
= DECL_SOURCE_LOCATION (t
);
10127 if (TREE_CODE (t
) == TEMPLATE_DECL
)
10129 ++processing_template_decl
;
10130 push_deferring_access_checks (dk_no_check
);
10133 r
= tsubst_friend_function (t
, args
);
10134 add_friend (type
, r
, /*complain=*/false);
10135 if (TREE_CODE (t
) == TEMPLATE_DECL
)
10137 pop_deferring_access_checks ();
10138 --processing_template_decl
;
10146 /* Restore these before substituting into the lambda capture
10148 cp_unevaluated_operand
= saved_unevaluated_operand
;
10149 c_inhibit_evaluation_warnings
= saved_inhibit_evaluation_warnings
;
10152 if (tree expr
= CLASSTYPE_LAMBDA_EXPR (type
))
10154 tree decl
= lambda_function (type
);
10157 if (!DECL_TEMPLATE_INFO (decl
)
10158 || DECL_TEMPLATE_RESULT (DECL_TI_TEMPLATE (decl
)) != decl
)
10159 instantiate_decl (decl
, false, false);
10161 /* We need to instantiate the capture list from the template
10162 after we've instantiated the closure members, but before we
10163 consider adding the conversion op. Also keep any captures
10164 that may have been added during instantiation of the op(). */
10165 tree tmpl_expr
= CLASSTYPE_LAMBDA_EXPR (pattern
);
10167 = tsubst_copy_and_build (LAMBDA_EXPR_CAPTURE_LIST (tmpl_expr
),
10168 args
, tf_warning_or_error
, NULL_TREE
,
10171 LAMBDA_EXPR_CAPTURE_LIST (expr
)
10172 = chainon (tmpl_cap
, nreverse (LAMBDA_EXPR_CAPTURE_LIST (expr
)));
10174 maybe_add_lambda_conv_op (type
);
10177 gcc_assert (errorcount
);
10180 /* Set the file and line number information to whatever is given for
10181 the class itself. This puts error messages involving generated
10182 implicit functions at a predictable point, and the same point
10183 that would be used for non-template classes. */
10184 input_location
= DECL_SOURCE_LOCATION (typedecl
);
10186 unreverse_member_declarations (type
);
10187 finish_struct_1 (type
);
10188 TYPE_BEING_DEFINED (type
) = 0;
10190 /* We don't instantiate default arguments for member functions. 14.7.1:
10192 The implicit instantiation of a class template specialization causes
10193 the implicit instantiation of the declarations, but not of the
10194 definitions or default arguments, of the class member functions,
10195 member classes, static data members and member templates.... */
10197 /* Some typedefs referenced from within the template code need to be access
10198 checked at template instantiation time, i.e now. These types were
10199 added to the template at parsing time. Let's get those and perform
10200 the access checks then. */
10201 perform_typedefs_access_check (pattern
, args
);
10202 perform_deferred_access_checks (tf_warning_or_error
);
10203 pop_nested_class ();
10204 maximum_field_alignment
= saved_maximum_field_alignment
;
10206 pop_from_top_level ();
10207 pop_deferring_access_checks ();
10208 pop_tinst_level ();
10210 /* The vtable for a template class can be emitted in any translation
10211 unit in which the class is instantiated. When there is no key
10212 method, however, finish_struct_1 will already have added TYPE to
10213 the keyed_classes list. */
10214 if (TYPE_CONTAINS_VPTR_P (type
) && CLASSTYPE_KEY_METHOD (type
))
10215 keyed_classes
= tree_cons (NULL_TREE
, type
, keyed_classes
);
10220 /* Wrapper for instantiate_class_template_1. */
10223 instantiate_class_template (tree type
)
10226 timevar_push (TV_TEMPLATE_INST
);
10227 ret
= instantiate_class_template_1 (type
);
10228 timevar_pop (TV_TEMPLATE_INST
);
10233 tsubst_template_arg (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
10239 else if (TYPE_P (t
))
10240 r
= tsubst (t
, args
, complain
, in_decl
);
10243 if (!(complain
& tf_warning
))
10244 ++c_inhibit_evaluation_warnings
;
10245 r
= tsubst_expr (t
, args
, complain
, in_decl
,
10246 /*integral_constant_expression_p=*/true);
10247 if (!(complain
& tf_warning
))
10248 --c_inhibit_evaluation_warnings
;
10253 /* Given a function parameter pack TMPL_PARM and some function parameters
10254 instantiated from it at *SPEC_P, return a NONTYPE_ARGUMENT_PACK of them
10255 and set *SPEC_P to point at the next point in the list. */
10258 extract_fnparm_pack (tree tmpl_parm
, tree
*spec_p
)
10260 /* Collect all of the extra "packed" parameters into an
10264 tree argpack
= make_node (NONTYPE_ARGUMENT_PACK
);
10265 tree argtypepack
= cxx_make_type (TYPE_ARGUMENT_PACK
);
10266 tree spec_parm
= *spec_p
;
10269 for (len
= 0; spec_parm
; ++len
, spec_parm
= TREE_CHAIN (spec_parm
))
10271 && !function_parameter_expanded_from_pack_p (spec_parm
, tmpl_parm
))
10274 /* Fill in PARMVEC and PARMTYPEVEC with all of the parameters. */
10275 parmvec
= make_tree_vec (len
);
10276 parmtypevec
= make_tree_vec (len
);
10277 spec_parm
= *spec_p
;
10278 for (i
= 0; i
< len
; i
++, spec_parm
= DECL_CHAIN (spec_parm
))
10280 TREE_VEC_ELT (parmvec
, i
) = spec_parm
;
10281 TREE_VEC_ELT (parmtypevec
, i
) = TREE_TYPE (spec_parm
);
10284 /* Build the argument packs. */
10285 SET_ARGUMENT_PACK_ARGS (argpack
, parmvec
);
10286 SET_ARGUMENT_PACK_ARGS (argtypepack
, parmtypevec
);
10287 TREE_TYPE (argpack
) = argtypepack
;
10288 *spec_p
= spec_parm
;
10293 /* Give a chain SPEC_PARM of PARM_DECLs, pack them into a
10294 NONTYPE_ARGUMENT_PACK. */
10297 make_fnparm_pack (tree spec_parm
)
10299 return extract_fnparm_pack (NULL_TREE
, &spec_parm
);
10302 /* Return 1 if the Ith element of the argument pack ARG_PACK is a
10303 pack expansion with no extra args, 2 if it has extra args, or 0
10304 if it is not a pack expansion. */
10307 argument_pack_element_is_expansion_p (tree arg_pack
, int i
)
10309 tree vec
= ARGUMENT_PACK_ARGS (arg_pack
);
10310 if (i
>= TREE_VEC_LENGTH (vec
))
10312 tree elt
= TREE_VEC_ELT (vec
, i
);
10314 /* A decl pack is itself an expansion. */
10315 elt
= TREE_TYPE (elt
);
10316 if (!PACK_EXPANSION_P (elt
))
10318 if (PACK_EXPANSION_EXTRA_ARGS (elt
))
10324 /* Creates and return an ARGUMENT_PACK_SELECT tree node. */
10327 make_argument_pack_select (tree arg_pack
, unsigned index
)
10329 tree aps
= make_node (ARGUMENT_PACK_SELECT
);
10331 ARGUMENT_PACK_SELECT_FROM_PACK (aps
) = arg_pack
;
10332 ARGUMENT_PACK_SELECT_INDEX (aps
) = index
;
10337 /* This is a subroutine of tsubst_pack_expansion.
10339 It returns TRUE if we need to use the PACK_EXPANSION_EXTRA_ARGS
10340 mechanism to store the (non complete list of) arguments of the
10341 substitution and return a non substituted pack expansion, in order
10342 to wait for when we have enough arguments to really perform the
10346 use_pack_expansion_extra_args_p (tree parm_packs
,
10348 bool has_empty_arg
)
10350 /* If one pack has an expansion and another pack has a normal
10351 argument or if one pack has an empty argument and an another
10352 one hasn't then tsubst_pack_expansion cannot perform the
10353 substitution and need to fall back on the
10354 PACK_EXPANSION_EXTRA mechanism. */
10355 if (parm_packs
== NULL_TREE
)
10357 else if (has_empty_arg
)
10360 bool has_expansion_arg
= false;
10361 for (int i
= 0 ; i
< arg_pack_len
; ++i
)
10363 bool has_non_expansion_arg
= false;
10364 for (tree parm_pack
= parm_packs
;
10366 parm_pack
= TREE_CHAIN (parm_pack
))
10368 tree arg
= TREE_VALUE (parm_pack
);
10370 int exp
= argument_pack_element_is_expansion_p (arg
, i
);
10372 /* We can't substitute a pack expansion with extra args into
10376 has_expansion_arg
= true;
10378 has_non_expansion_arg
= true;
10381 if (has_expansion_arg
&& has_non_expansion_arg
)
10387 /* [temp.variadic]/6 says that:
10389 The instantiation of a pack expansion [...]
10390 produces a list E1,E2, ..., En, where N is the number of elements
10391 in the pack expansion parameters.
10393 This subroutine of tsubst_pack_expansion produces one of these Ei.
10395 PATTERN is the pattern of the pack expansion. PARM_PACKS is a
10396 TREE_LIST in which each TREE_PURPOSE is a parameter pack of
10397 PATTERN, and each TREE_VALUE is its corresponding argument pack.
10398 INDEX is the index 'i' of the element Ei to produce. ARGS,
10399 COMPLAIN, and IN_DECL are the same parameters as for the
10400 tsubst_pack_expansion function.
10402 The function returns the resulting Ei upon successful completion,
10403 or error_mark_node.
10405 Note that this function possibly modifies the ARGS parameter, so
10406 it's the responsibility of the caller to restore it. */
10409 gen_elem_of_pack_expansion_instantiation (tree pattern
,
10412 tree args
/* This parm gets
10414 tsubst_flags_t complain
,
10418 bool ith_elem_is_expansion
= false;
10420 /* For each parameter pack, change the substitution of the parameter
10421 pack to the ith argument in its argument pack, then expand the
10423 for (tree pack
= parm_packs
; pack
; pack
= TREE_CHAIN (pack
))
10425 tree parm
= TREE_PURPOSE (pack
);
10426 tree arg_pack
= TREE_VALUE (pack
);
10427 tree aps
; /* instance of ARGUMENT_PACK_SELECT. */
10429 ith_elem_is_expansion
|=
10430 argument_pack_element_is_expansion_p (arg_pack
, index
);
10432 /* Select the Ith argument from the pack. */
10433 if (TREE_CODE (parm
) == PARM_DECL
10434 || TREE_CODE (parm
) == FIELD_DECL
)
10438 aps
= make_argument_pack_select (arg_pack
, index
);
10439 if (!mark_used (parm
, complain
) && !(complain
& tf_error
))
10440 return error_mark_node
;
10441 register_local_specialization (aps
, parm
);
10444 aps
= retrieve_local_specialization (parm
);
10449 template_parm_level_and_index (parm
, &level
, &idx
);
10453 aps
= make_argument_pack_select (arg_pack
, index
);
10454 /* Update the corresponding argument. */
10455 TMPL_ARG (args
, level
, idx
) = aps
;
10458 /* Re-use the ARGUMENT_PACK_SELECT. */
10459 aps
= TMPL_ARG (args
, level
, idx
);
10461 ARGUMENT_PACK_SELECT_INDEX (aps
) = index
;
10464 /* Substitute into the PATTERN with the (possibly altered)
10466 if (pattern
== in_decl
)
10467 /* Expanding a fixed parameter pack from
10468 coerce_template_parameter_pack. */
10469 t
= tsubst_decl (pattern
, args
, complain
);
10470 else if (pattern
== error_mark_node
)
10471 t
= error_mark_node
;
10472 else if (constraint_p (pattern
))
10474 if (processing_template_decl
)
10475 t
= tsubst_constraint (pattern
, args
, complain
, in_decl
);
10477 t
= (constraints_satisfied_p (pattern
, args
)
10478 ? boolean_true_node
: boolean_false_node
);
10480 else if (!TYPE_P (pattern
))
10481 t
= tsubst_expr (pattern
, args
, complain
, in_decl
,
10482 /*integral_constant_expression_p=*/false);
10484 t
= tsubst (pattern
, args
, complain
, in_decl
);
10486 /* If the Ith argument pack element is a pack expansion, then
10487 the Ith element resulting from the substituting is going to
10488 be a pack expansion as well. */
10489 if (ith_elem_is_expansion
)
10490 t
= make_pack_expansion (t
);
10495 /* Substitute ARGS into T, which is an pack expansion
10496 (i.e. TYPE_PACK_EXPANSION or EXPR_PACK_EXPANSION). Returns a
10497 TREE_VEC with the substituted arguments, a PACK_EXPANSION_* node
10498 (if only a partial substitution could be performed) or
10499 ERROR_MARK_NODE if there was an error. */
10501 tsubst_pack_expansion (tree t
, tree args
, tsubst_flags_t complain
,
10505 tree pack
, packs
= NULL_TREE
;
10506 bool unsubstituted_packs
= false;
10509 hash_map
<tree
, tree
> *saved_local_specializations
= NULL
;
10510 bool need_local_specializations
= false;
10513 gcc_assert (PACK_EXPANSION_P (t
));
10514 pattern
= PACK_EXPANSION_PATTERN (t
);
10516 /* Add in any args remembered from an earlier partial instantiation. */
10517 args
= add_to_template_args (PACK_EXPANSION_EXTRA_ARGS (t
), args
);
10519 levels
= TMPL_ARGS_DEPTH (args
);
10521 /* Determine the argument packs that will instantiate the parameter
10522 packs used in the expansion expression. While we're at it,
10523 compute the number of arguments to be expanded and make sure it
10525 for (pack
= PACK_EXPANSION_PARAMETER_PACKS (t
); pack
;
10526 pack
= TREE_CHAIN (pack
))
10528 tree parm_pack
= TREE_VALUE (pack
);
10529 tree arg_pack
= NULL_TREE
;
10530 tree orig_arg
= NULL_TREE
;
10533 if (TREE_CODE (parm_pack
) == BASES
)
10535 if (BASES_DIRECT (parm_pack
))
10536 return calculate_direct_bases (tsubst_expr (BASES_TYPE (parm_pack
),
10537 args
, complain
, in_decl
, false));
10539 return calculate_bases (tsubst_expr (BASES_TYPE (parm_pack
),
10540 args
, complain
, in_decl
, false));
10542 if (TREE_CODE (parm_pack
) == PARM_DECL
)
10544 /* We know we have correct local_specializations if this
10545 expansion is at function scope, or if we're dealing with a
10546 local parameter in a requires expression; for the latter,
10547 tsubst_requires_expr set it up appropriately. */
10548 if (PACK_EXPANSION_LOCAL_P (t
) || CONSTRAINT_VAR_P (parm_pack
))
10549 arg_pack
= retrieve_local_specialization (parm_pack
);
10552 /* We can't rely on local_specializations for a parameter
10553 name used later in a function declaration (such as in a
10554 late-specified return type). Even if it exists, it might
10555 have the wrong value for a recursive call. Just make a
10556 dummy decl, since it's only used for its type. */
10557 arg_pack
= tsubst_decl (parm_pack
, args
, complain
);
10558 if (arg_pack
&& DECL_PACK_P (arg_pack
))
10559 /* Partial instantiation of the parm_pack, we can't build
10560 up an argument pack yet. */
10561 arg_pack
= NULL_TREE
;
10563 arg_pack
= make_fnparm_pack (arg_pack
);
10564 need_local_specializations
= true;
10567 else if (TREE_CODE (parm_pack
) == FIELD_DECL
)
10568 arg_pack
= tsubst_copy (parm_pack
, args
, complain
, in_decl
);
10572 template_parm_level_and_index (parm_pack
, &level
, &idx
);
10574 if (level
<= levels
)
10575 arg_pack
= TMPL_ARG (args
, level
, idx
);
10578 orig_arg
= arg_pack
;
10579 if (arg_pack
&& TREE_CODE (arg_pack
) == ARGUMENT_PACK_SELECT
)
10580 arg_pack
= ARGUMENT_PACK_SELECT_FROM_PACK (arg_pack
);
10582 if (arg_pack
&& !ARGUMENT_PACK_P (arg_pack
))
10583 /* This can only happen if we forget to expand an argument
10584 pack somewhere else. Just return an error, silently. */
10586 result
= make_tree_vec (1);
10587 TREE_VEC_ELT (result
, 0) = error_mark_node
;
10594 TREE_VEC_LENGTH (ARGUMENT_PACK_ARGS (arg_pack
));
10596 /* Don't bother trying to do a partial substitution with
10597 incomplete packs; we'll try again after deduction. */
10598 if (ARGUMENT_PACK_INCOMPLETE_P (arg_pack
))
10603 else if (len
!= my_len
)
10605 if (!(complain
& tf_error
))
10606 /* Fail quietly. */;
10607 else if (TREE_CODE (t
) == TYPE_PACK_EXPANSION
)
10608 error ("mismatched argument pack lengths while expanding "
10612 error ("mismatched argument pack lengths while expanding "
10615 return error_mark_node
;
10618 /* Keep track of the parameter packs and their corresponding
10620 packs
= tree_cons (parm_pack
, arg_pack
, packs
);
10621 TREE_TYPE (packs
) = orig_arg
;
10625 /* We can't substitute for this parameter pack. We use a flag as
10626 well as the missing_level counter because function parameter
10627 packs don't have a level. */
10628 unsubstituted_packs
= true;
10632 /* If the expansion is just T..., return the matching argument pack. */
10633 if (!unsubstituted_packs
10634 && TREE_PURPOSE (packs
) == pattern
)
10636 tree args
= ARGUMENT_PACK_ARGS (TREE_VALUE (packs
));
10637 if (TREE_CODE (t
) == TYPE_PACK_EXPANSION
10638 || pack_expansion_args_count (args
))
10640 /* Otherwise use the normal path so we get convert_from_reference. */
10643 /* We cannot expand this expansion expression, because we don't have
10644 all of the argument packs we need. */
10645 if (use_pack_expansion_extra_args_p (packs
, len
, unsubstituted_packs
))
10647 /* We got some full packs, but we can't substitute them in until we
10648 have values for all the packs. So remember these until then. */
10650 t
= make_pack_expansion (pattern
);
10651 PACK_EXPANSION_EXTRA_ARGS (t
) = args
;
10654 else if (unsubstituted_packs
)
10656 /* There were no real arguments, we're just replacing a parameter
10657 pack with another version of itself. Substitute into the
10658 pattern and return a PACK_EXPANSION_*. The caller will need to
10660 if (TREE_CODE (t
) == EXPR_PACK_EXPANSION
)
10661 t
= tsubst_expr (pattern
, args
, complain
, in_decl
,
10662 /*integral_constant_expression_p=*/false);
10664 t
= tsubst (pattern
, args
, complain
, in_decl
);
10665 t
= make_pack_expansion (t
);
10669 gcc_assert (len
>= 0);
10671 if (need_local_specializations
)
10673 /* We're in a late-specified return type, so create our own local
10674 specializations map; the current map is either NULL or (in the
10675 case of recursive unification) might have bindings that we don't
10676 want to use or alter. */
10677 saved_local_specializations
= local_specializations
;
10678 local_specializations
= new hash_map
<tree
, tree
>;
10681 /* For each argument in each argument pack, substitute into the
10683 result
= make_tree_vec (len
);
10684 for (i
= 0; i
< len
; ++i
)
10686 t
= gen_elem_of_pack_expansion_instantiation (pattern
, packs
,
10690 TREE_VEC_ELT (result
, i
) = t
;
10691 if (t
== error_mark_node
)
10693 result
= error_mark_node
;
10698 /* Update ARGS to restore the substitution from parameter packs to
10699 their argument packs. */
10700 for (pack
= packs
; pack
; pack
= TREE_CHAIN (pack
))
10702 tree parm
= TREE_PURPOSE (pack
);
10704 if (TREE_CODE (parm
) == PARM_DECL
10705 || TREE_CODE (parm
) == FIELD_DECL
)
10706 register_local_specialization (TREE_TYPE (pack
), parm
);
10711 if (TREE_VALUE (pack
) == NULL_TREE
)
10714 template_parm_level_and_index (parm
, &level
, &idx
);
10716 /* Update the corresponding argument. */
10717 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (args
))
10718 TREE_VEC_ELT (TREE_VEC_ELT (args
, level
-1 ), idx
) =
10721 TREE_VEC_ELT (args
, idx
) = TREE_TYPE (pack
);
10725 if (need_local_specializations
)
10727 delete local_specializations
;
10728 local_specializations
= saved_local_specializations
;
10734 /* Given PARM_DECL PARM, find the corresponding PARM_DECL in the template
10735 TMPL. We do this using DECL_PARM_INDEX, which should work even with
10736 parameter packs; all parms generated from a function parameter pack will
10737 have the same DECL_PARM_INDEX. */
10740 get_pattern_parm (tree parm
, tree tmpl
)
10742 tree pattern
= DECL_TEMPLATE_RESULT (tmpl
);
10745 if (DECL_ARTIFICIAL (parm
))
10747 for (patparm
= DECL_ARGUMENTS (pattern
);
10748 patparm
; patparm
= DECL_CHAIN (patparm
))
10749 if (DECL_ARTIFICIAL (patparm
)
10750 && DECL_NAME (parm
) == DECL_NAME (patparm
))
10755 patparm
= FUNCTION_FIRST_USER_PARM (DECL_TEMPLATE_RESULT (tmpl
));
10756 patparm
= chain_index (DECL_PARM_INDEX (parm
)-1, patparm
);
10757 gcc_assert (DECL_PARM_INDEX (patparm
)
10758 == DECL_PARM_INDEX (parm
));
10764 /* Substitute ARGS into the vector or list of template arguments T. */
10767 tsubst_template_args (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
10770 int len
, need_new
= 0, i
, expanded_len_adjust
= 0, out
;
10773 if (t
== error_mark_node
)
10774 return error_mark_node
;
10776 len
= TREE_VEC_LENGTH (t
);
10777 elts
= XALLOCAVEC (tree
, len
);
10779 for (i
= 0; i
< len
; i
++)
10781 tree orig_arg
= TREE_VEC_ELT (t
, i
);
10784 if (TREE_CODE (orig_arg
) == TREE_VEC
)
10785 new_arg
= tsubst_template_args (orig_arg
, args
, complain
, in_decl
);
10786 else if (PACK_EXPANSION_P (orig_arg
))
10788 /* Substitute into an expansion expression. */
10789 new_arg
= tsubst_pack_expansion (orig_arg
, args
, complain
, in_decl
);
10791 if (TREE_CODE (new_arg
) == TREE_VEC
)
10792 /* Add to the expanded length adjustment the number of
10793 expanded arguments. We subtract one from this
10794 measurement, because the argument pack expression
10795 itself is already counted as 1 in
10796 LEN. EXPANDED_LEN_ADJUST can actually be negative, if
10797 the argument pack is empty. */
10798 expanded_len_adjust
+= TREE_VEC_LENGTH (new_arg
) - 1;
10800 else if (ARGUMENT_PACK_P (orig_arg
))
10802 /* Substitute into each of the arguments. */
10803 new_arg
= TYPE_P (orig_arg
)
10804 ? cxx_make_type (TREE_CODE (orig_arg
))
10805 : make_node (TREE_CODE (orig_arg
));
10807 SET_ARGUMENT_PACK_ARGS (
10809 tsubst_template_args (ARGUMENT_PACK_ARGS (orig_arg
),
10810 args
, complain
, in_decl
));
10812 if (ARGUMENT_PACK_ARGS (new_arg
) == error_mark_node
)
10813 new_arg
= error_mark_node
;
10815 if (TREE_CODE (new_arg
) == NONTYPE_ARGUMENT_PACK
) {
10816 TREE_TYPE (new_arg
) = tsubst (TREE_TYPE (orig_arg
), args
,
10817 complain
, in_decl
);
10818 TREE_CONSTANT (new_arg
) = TREE_CONSTANT (orig_arg
);
10820 if (TREE_TYPE (new_arg
) == error_mark_node
)
10821 new_arg
= error_mark_node
;
10825 new_arg
= tsubst_template_arg (orig_arg
, args
, complain
, in_decl
);
10827 if (new_arg
== error_mark_node
)
10828 return error_mark_node
;
10831 if (new_arg
!= orig_arg
)
10838 /* Make space for the expanded arguments coming from template
10840 t
= make_tree_vec (len
+ expanded_len_adjust
);
10841 /* ORIG_T can contain TREE_VECs. That happens if ORIG_T contains the
10842 arguments for a member template.
10843 In that case each TREE_VEC in ORIG_T represents a level of template
10844 arguments, and ORIG_T won't carry any non defaulted argument count.
10845 It will rather be the nested TREE_VECs that will carry one.
10846 In other words, ORIG_T carries a non defaulted argument count only
10847 if it doesn't contain any nested TREE_VEC. */
10848 if (NON_DEFAULT_TEMPLATE_ARGS_COUNT (orig_t
))
10850 int count
= GET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (orig_t
);
10851 count
+= expanded_len_adjust
;
10852 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (t
, count
);
10854 for (i
= 0, out
= 0; i
< len
; i
++)
10856 if ((PACK_EXPANSION_P (TREE_VEC_ELT (orig_t
, i
))
10857 || ARGUMENT_PACK_P (TREE_VEC_ELT (orig_t
, i
)))
10858 && TREE_CODE (elts
[i
]) == TREE_VEC
)
10862 /* Now expand the template argument pack "in place". */
10863 for (idx
= 0; idx
< TREE_VEC_LENGTH (elts
[i
]); idx
++, out
++)
10864 TREE_VEC_ELT (t
, out
) = TREE_VEC_ELT (elts
[i
], idx
);
10868 TREE_VEC_ELT (t
, out
) = elts
[i
];
10876 /* Return the result of substituting ARGS into the template parameters
10877 given by PARMS. If there are m levels of ARGS and m + n levels of
10878 PARMS, then the result will contain n levels of PARMS. For
10879 example, if PARMS is `template <class T> template <class U>
10880 template <T*, U, class V>' and ARGS is {{int}, {double}} then the
10881 result will be `template <int*, double, class V>'. */
10884 tsubst_template_parms (tree parms
, tree args
, tsubst_flags_t complain
)
10886 tree r
= NULL_TREE
;
10889 /* When substituting into a template, we must set
10890 PROCESSING_TEMPLATE_DECL as the template parameters may be
10891 dependent if they are based on one-another, and the dependency
10892 predicates are short-circuit outside of templates. */
10893 ++processing_template_decl
;
10895 for (new_parms
= &r
;
10896 parms
&& TMPL_PARMS_DEPTH (parms
) > TMPL_ARGS_DEPTH (args
);
10897 new_parms
= &(TREE_CHAIN (*new_parms
)),
10898 parms
= TREE_CHAIN (parms
))
10901 make_tree_vec (TREE_VEC_LENGTH (TREE_VALUE (parms
)));
10904 for (i
= 0; i
< TREE_VEC_LENGTH (new_vec
); ++i
)
10908 if (parms
== error_mark_node
)
10911 tuple
= TREE_VEC_ELT (TREE_VALUE (parms
), i
);
10913 if (tuple
== error_mark_node
)
10916 TREE_VEC_ELT (new_vec
, i
) =
10917 tsubst_template_parm (tuple
, args
, complain
);
10921 tree_cons (size_int (TMPL_PARMS_DEPTH (parms
)
10922 - TMPL_ARGS_DEPTH (args
)),
10923 new_vec
, NULL_TREE
);
10926 --processing_template_decl
;
10931 /* Return the result of substituting ARGS into one template parameter
10932 given by T. T Must be a TREE_LIST which TREE_VALUE is the template
10933 parameter and which TREE_PURPOSE is the default argument of the
10934 template parameter. */
10937 tsubst_template_parm (tree t
, tree args
, tsubst_flags_t complain
)
10939 tree default_value
, parm_decl
;
10941 if (args
== NULL_TREE
10943 || t
== error_mark_node
)
10946 gcc_assert (TREE_CODE (t
) == TREE_LIST
);
10948 default_value
= TREE_PURPOSE (t
);
10949 parm_decl
= TREE_VALUE (t
);
10951 parm_decl
= tsubst (parm_decl
, args
, complain
, NULL_TREE
);
10952 if (TREE_CODE (parm_decl
) == PARM_DECL
10953 && invalid_nontype_parm_type_p (TREE_TYPE (parm_decl
), complain
))
10954 parm_decl
= error_mark_node
;
10955 default_value
= tsubst_template_arg (default_value
, args
,
10956 complain
, NULL_TREE
);
10958 return build_tree_list (default_value
, parm_decl
);
10961 /* Substitute the ARGS into the indicated aggregate (or enumeration)
10962 type T. If T is not an aggregate or enumeration type, it is
10963 handled as if by tsubst. IN_DECL is as for tsubst. If
10964 ENTERING_SCOPE is nonzero, T is the context for a template which
10965 we are presently tsubst'ing. Return the substituted value. */
10968 tsubst_aggr_type (tree t
,
10970 tsubst_flags_t complain
,
10972 int entering_scope
)
10974 if (t
== NULL_TREE
)
10977 switch (TREE_CODE (t
))
10980 if (TYPE_PTRMEMFUNC_P (t
))
10981 return tsubst (TYPE_PTRMEMFUNC_FN_TYPE (t
), args
, complain
, in_decl
);
10983 /* Else fall through. */
10984 case ENUMERAL_TYPE
:
10986 if (TYPE_TEMPLATE_INFO (t
) && uses_template_parms (t
))
10991 int saved_unevaluated_operand
;
10992 int saved_inhibit_evaluation_warnings
;
10994 /* In "sizeof(X<I>)" we need to evaluate "I". */
10995 saved_unevaluated_operand
= cp_unevaluated_operand
;
10996 cp_unevaluated_operand
= 0;
10997 saved_inhibit_evaluation_warnings
= c_inhibit_evaluation_warnings
;
10998 c_inhibit_evaluation_warnings
= 0;
11000 /* First, determine the context for the type we are looking
11002 context
= TYPE_CONTEXT (t
);
11003 if (context
&& TYPE_P (context
))
11005 context
= tsubst_aggr_type (context
, args
, complain
,
11006 in_decl
, /*entering_scope=*/1);
11007 /* If context is a nested class inside a class template,
11008 it may still need to be instantiated (c++/33959). */
11009 context
= complete_type (context
);
11012 /* Then, figure out what arguments are appropriate for the
11013 type we are trying to find. For example, given:
11015 template <class T> struct S;
11016 template <class T, class U> void f(T, U) { S<U> su; }
11018 and supposing that we are instantiating f<int, double>,
11019 then our ARGS will be {int, double}, but, when looking up
11020 S we only want {double}. */
11021 argvec
= tsubst_template_args (TYPE_TI_ARGS (t
), args
,
11022 complain
, in_decl
);
11023 if (argvec
== error_mark_node
)
11024 r
= error_mark_node
;
11027 r
= lookup_template_class (t
, argvec
, in_decl
, context
,
11028 entering_scope
, complain
);
11029 r
= cp_build_qualified_type_real (r
, cp_type_quals (t
), complain
);
11032 cp_unevaluated_operand
= saved_unevaluated_operand
;
11033 c_inhibit_evaluation_warnings
= saved_inhibit_evaluation_warnings
;
11038 /* This is not a template type, so there's nothing to do. */
11042 return tsubst (t
, args
, complain
, in_decl
);
11046 /* Substitute into the default argument ARG (a default argument for
11047 FN), which has the indicated TYPE. */
11050 tsubst_default_argument (tree fn
, tree type
, tree arg
, tsubst_flags_t complain
)
11052 tree saved_class_ptr
= NULL_TREE
;
11053 tree saved_class_ref
= NULL_TREE
;
11054 int errs
= errorcount
+ sorrycount
;
11056 /* This can happen in invalid code. */
11057 if (TREE_CODE (arg
) == DEFAULT_ARG
)
11060 /* This default argument came from a template. Instantiate the
11061 default argument here, not in tsubst. In the case of
11070 we must be careful to do name lookup in the scope of S<T>,
11071 rather than in the current class. */
11072 push_access_scope (fn
);
11073 /* The "this" pointer is not valid in a default argument. */
11076 saved_class_ptr
= current_class_ptr
;
11077 cp_function_chain
->x_current_class_ptr
= NULL_TREE
;
11078 saved_class_ref
= current_class_ref
;
11079 cp_function_chain
->x_current_class_ref
= NULL_TREE
;
11082 push_deferring_access_checks(dk_no_deferred
);
11083 /* The default argument expression may cause implicitly defined
11084 member functions to be synthesized, which will result in garbage
11085 collection. We must treat this situation as if we were within
11086 the body of function so as to avoid collecting live data on the
11089 arg
= tsubst_expr (arg
, DECL_TI_ARGS (fn
),
11090 complain
, NULL_TREE
,
11091 /*integral_constant_expression_p=*/false);
11093 pop_deferring_access_checks();
11095 /* Restore the "this" pointer. */
11098 cp_function_chain
->x_current_class_ptr
= saved_class_ptr
;
11099 cp_function_chain
->x_current_class_ref
= saved_class_ref
;
11102 if (errorcount
+sorrycount
> errs
11103 && (complain
& tf_warning_or_error
))
11104 inform (input_location
,
11105 " when instantiating default argument for call to %D", fn
);
11107 /* Make sure the default argument is reasonable. */
11108 arg
= check_default_argument (type
, arg
, complain
);
11110 pop_access_scope (fn
);
11115 /* Substitute into all the default arguments for FN. */
11118 tsubst_default_arguments (tree fn
, tsubst_flags_t complain
)
11123 tmpl_args
= DECL_TI_ARGS (fn
);
11125 /* If this function is not yet instantiated, we certainly don't need
11126 its default arguments. */
11127 if (uses_template_parms (tmpl_args
))
11129 /* Don't do this again for clones. */
11130 if (DECL_CLONED_FUNCTION_P (fn
))
11133 for (arg
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
11135 arg
= TREE_CHAIN (arg
))
11136 if (TREE_PURPOSE (arg
))
11137 TREE_PURPOSE (arg
) = tsubst_default_argument (fn
,
11139 TREE_PURPOSE (arg
),
11143 /* Substitute the ARGS into the T, which is a _DECL. Return the
11144 result of the substitution. Issue error and warning messages under
11145 control of COMPLAIN. */
11148 tsubst_decl (tree t
, tree args
, tsubst_flags_t complain
)
11150 #define RETURN(EXP) do { r = (EXP); goto out; } while(0)
11151 location_t saved_loc
;
11152 tree r
= NULL_TREE
;
11154 hashval_t hash
= 0;
11156 /* Set the filename and linenumber to improve error-reporting. */
11157 saved_loc
= input_location
;
11158 input_location
= DECL_SOURCE_LOCATION (t
);
11160 switch (TREE_CODE (t
))
11162 case TEMPLATE_DECL
:
11164 /* We can get here when processing a member function template,
11165 member class template, or template template parameter. */
11166 tree decl
= DECL_TEMPLATE_RESULT (t
);
11171 if (DECL_TEMPLATE_TEMPLATE_PARM_P (t
))
11173 /* Template template parameter is treated here. */
11174 tree new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
11175 if (new_type
== error_mark_node
)
11176 r
= error_mark_node
;
11177 /* If we get a real template back, return it. This can happen in
11178 the context of most_specialized_partial_spec. */
11179 else if (TREE_CODE (new_type
) == TEMPLATE_DECL
)
11182 /* The new TEMPLATE_DECL was built in
11183 reduce_template_parm_level. */
11184 r
= TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL (new_type
);
11188 /* We might already have an instance of this template.
11189 The ARGS are for the surrounding class type, so the
11190 full args contain the tsubst'd args for the context,
11191 plus the innermost args from the template decl. */
11192 tmpl_args
= DECL_CLASS_TEMPLATE_P (t
)
11193 ? CLASSTYPE_TI_ARGS (TREE_TYPE (t
))
11194 : DECL_TI_ARGS (DECL_TEMPLATE_RESULT (t
));
11195 /* Because this is a template, the arguments will still be
11196 dependent, even after substitution. If
11197 PROCESSING_TEMPLATE_DECL is not set, the dependency
11198 predicates will short-circuit. */
11199 ++processing_template_decl
;
11200 full_args
= tsubst_template_args (tmpl_args
, args
,
11201 complain
, in_decl
);
11202 --processing_template_decl
;
11203 if (full_args
== error_mark_node
)
11204 RETURN (error_mark_node
);
11206 /* If this is a default template template argument,
11207 tsubst might not have changed anything. */
11208 if (full_args
== tmpl_args
)
11211 hash
= hash_tmpl_and_args (t
, full_args
);
11212 spec
= retrieve_specialization (t
, full_args
, hash
);
11213 if (spec
!= NULL_TREE
)
11219 /* Make a new template decl. It will be similar to the
11220 original, but will record the current template arguments.
11221 We also create a new function declaration, which is just
11222 like the old one, but points to this new template, rather
11223 than the old one. */
11225 gcc_assert (DECL_LANG_SPECIFIC (r
) != 0);
11226 DECL_CHAIN (r
) = NULL_TREE
;
11228 // Build new template info linking to the original template decl.
11229 DECL_TEMPLATE_INFO (r
) = build_template_info (t
, args
);
11231 if (TREE_CODE (decl
) == TYPE_DECL
11232 && !TYPE_DECL_ALIAS_P (decl
))
11235 ++processing_template_decl
;
11236 new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
11237 --processing_template_decl
;
11238 if (new_type
== error_mark_node
)
11239 RETURN (error_mark_node
);
11241 TREE_TYPE (r
) = new_type
;
11242 /* For a partial specialization, we need to keep pointing to
11243 the primary template. */
11244 if (!DECL_TEMPLATE_SPECIALIZATION (t
))
11245 CLASSTYPE_TI_TEMPLATE (new_type
) = r
;
11246 DECL_TEMPLATE_RESULT (r
) = TYPE_MAIN_DECL (new_type
);
11247 DECL_TI_ARGS (r
) = CLASSTYPE_TI_ARGS (new_type
);
11248 DECL_CONTEXT (r
) = TYPE_CONTEXT (new_type
);
11253 ++processing_template_decl
;
11254 new_decl
= tsubst (decl
, args
, complain
, in_decl
);
11255 --processing_template_decl
;
11256 if (new_decl
== error_mark_node
)
11257 RETURN (error_mark_node
);
11259 DECL_TEMPLATE_RESULT (r
) = new_decl
;
11260 DECL_TI_TEMPLATE (new_decl
) = r
;
11261 TREE_TYPE (r
) = TREE_TYPE (new_decl
);
11262 DECL_TI_ARGS (r
) = DECL_TI_ARGS (new_decl
);
11263 DECL_CONTEXT (r
) = DECL_CONTEXT (new_decl
);
11266 SET_DECL_IMPLICIT_INSTANTIATION (r
);
11267 DECL_TEMPLATE_INSTANTIATIONS (r
) = NULL_TREE
;
11268 DECL_TEMPLATE_SPECIALIZATIONS (r
) = NULL_TREE
;
11270 /* The template parameters for this new template are all the
11271 template parameters for the old template, except the
11272 outermost level of parameters. */
11273 DECL_TEMPLATE_PARMS (r
)
11274 = tsubst_template_parms (DECL_TEMPLATE_PARMS (t
), args
,
11277 if (PRIMARY_TEMPLATE_P (t
))
11278 DECL_PRIMARY_TEMPLATE (r
) = r
;
11280 if (TREE_CODE (decl
) != TYPE_DECL
&& !VAR_P (decl
))
11281 /* Record this non-type partial instantiation. */
11282 register_specialization (r
, t
,
11283 DECL_TI_ARGS (DECL_TEMPLATE_RESULT (r
)),
11288 case FUNCTION_DECL
:
11291 tree argvec
= NULL_TREE
;
11299 /* Nobody should be tsubst'ing into non-template functions. */
11300 gcc_assert (DECL_TEMPLATE_INFO (t
) != NULL_TREE
);
11302 if (TREE_CODE (DECL_TI_TEMPLATE (t
)) == TEMPLATE_DECL
)
11307 /* If T is not dependent, just return it. We have to
11308 increment PROCESSING_TEMPLATE_DECL because
11309 value_dependent_expression_p assumes that nothing is
11310 dependent when PROCESSING_TEMPLATE_DECL is zero. */
11311 ++processing_template_decl
;
11312 dependent_p
= value_dependent_expression_p (t
);
11313 --processing_template_decl
;
11317 /* Calculate the most general template of which R is a
11318 specialization, and the complete set of arguments used to
11320 gen_tmpl
= most_general_template (DECL_TI_TEMPLATE (t
));
11321 argvec
= tsubst_template_args (DECL_TI_ARGS
11322 (DECL_TEMPLATE_RESULT
11323 (DECL_TI_TEMPLATE (t
))),
11324 args
, complain
, in_decl
);
11325 if (argvec
== error_mark_node
)
11326 RETURN (error_mark_node
);
11328 /* Check to see if we already have this specialization. */
11329 hash
= hash_tmpl_and_args (gen_tmpl
, argvec
);
11330 spec
= retrieve_specialization (gen_tmpl
, argvec
, hash
);
11338 /* We can see more levels of arguments than parameters if
11339 there was a specialization of a member template, like
11342 template <class T> struct S { template <class U> void f(); }
11343 template <> template <class U> void S<int>::f(U);
11345 Here, we'll be substituting into the specialization,
11346 because that's where we can find the code we actually
11347 want to generate, but we'll have enough arguments for
11348 the most general template.
11350 We also deal with the peculiar case:
11352 template <class T> struct S {
11353 template <class U> friend void f();
11355 template <class U> void f() {}
11357 template void f<double>();
11359 Here, the ARGS for the instantiation of will be {int,
11360 double}. But, we only need as many ARGS as there are
11361 levels of template parameters in CODE_PATTERN. We are
11362 careful not to get fooled into reducing the ARGS in
11365 template <class T> struct S { template <class U> void f(U); }
11366 template <class T> template <> void S<T>::f(int) {}
11368 which we can spot because the pattern will be a
11369 specialization in this case. */
11370 args_depth
= TMPL_ARGS_DEPTH (args
);
11372 TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (DECL_TI_TEMPLATE (t
)));
11373 if (args_depth
> parms_depth
11374 && !DECL_TEMPLATE_SPECIALIZATION (t
))
11375 args
= get_innermost_template_args (args
, parms_depth
);
11379 /* This special case arises when we have something like this:
11381 template <class T> struct S {
11382 friend void f<int>(int, double);
11385 Here, the DECL_TI_TEMPLATE for the friend declaration
11386 will be an IDENTIFIER_NODE. We are being called from
11387 tsubst_friend_function, and we want only to create a
11388 new decl (R) with appropriate types so that we can call
11389 determine_specialization. */
11390 gen_tmpl
= NULL_TREE
;
11393 if (DECL_CLASS_SCOPE_P (t
))
11395 if (DECL_NAME (t
) == constructor_name (DECL_CONTEXT (t
)))
11399 ctx
= tsubst_aggr_type (DECL_CONTEXT (t
), args
,
11400 complain
, t
, /*entering_scope=*/1);
11405 ctx
= DECL_CONTEXT (t
);
11407 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
11408 if (type
== error_mark_node
)
11409 RETURN (error_mark_node
);
11411 /* If we hit excessive deduction depth, the type is bogus even if
11412 it isn't error_mark_node, so don't build a decl. */
11413 if (excessive_deduction_depth
)
11414 RETURN (error_mark_node
);
11416 /* We do NOT check for matching decls pushed separately at this
11417 point, as they may not represent instantiations of this
11418 template, and in any case are considered separate under the
11421 DECL_USE_TEMPLATE (r
) = 0;
11422 TREE_TYPE (r
) = type
;
11423 /* Clear out the mangled name and RTL for the instantiation. */
11424 SET_DECL_ASSEMBLER_NAME (r
, NULL_TREE
);
11425 SET_DECL_RTL (r
, NULL
);
11426 /* Leave DECL_INITIAL set on deleted instantiations. */
11427 if (!DECL_DELETED_FN (r
))
11428 DECL_INITIAL (r
) = NULL_TREE
;
11429 DECL_CONTEXT (r
) = ctx
;
11431 /* OpenMP UDRs have the only argument a reference to the declared
11432 type. We want to diagnose if the declared type is a reference,
11433 which is invalid, but as references to references are usually
11434 quietly merged, diagnose it here. */
11435 if (DECL_OMP_DECLARE_REDUCTION_P (t
))
11438 = TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (t
))));
11439 argtype
= tsubst (argtype
, args
, complain
, in_decl
);
11440 if (TREE_CODE (argtype
) == REFERENCE_TYPE
)
11441 error_at (DECL_SOURCE_LOCATION (t
),
11442 "reference type %qT in "
11443 "%<#pragma omp declare reduction%>", argtype
);
11444 if (strchr (IDENTIFIER_POINTER (DECL_NAME (t
)), '~') == NULL
)
11445 DECL_NAME (r
) = omp_reduction_id (ERROR_MARK
, DECL_NAME (t
),
11449 if (member
&& DECL_CONV_FN_P (r
))
11450 /* Type-conversion operator. Reconstruct the name, in
11451 case it's the name of one of the template's parameters. */
11452 DECL_NAME (r
) = mangle_conv_op_name_for_type (TREE_TYPE (type
));
11454 DECL_ARGUMENTS (r
) = tsubst (DECL_ARGUMENTS (t
), args
,
11456 DECL_RESULT (r
) = NULL_TREE
;
11458 TREE_STATIC (r
) = 0;
11459 TREE_PUBLIC (r
) = TREE_PUBLIC (t
);
11460 DECL_EXTERNAL (r
) = 1;
11461 /* If this is an instantiation of a function with internal
11462 linkage, we already know what object file linkage will be
11463 assigned to the instantiation. */
11464 DECL_INTERFACE_KNOWN (r
) = !TREE_PUBLIC (r
);
11465 DECL_DEFER_OUTPUT (r
) = 0;
11466 DECL_CHAIN (r
) = NULL_TREE
;
11467 DECL_PENDING_INLINE_INFO (r
) = 0;
11468 DECL_PENDING_INLINE_P (r
) = 0;
11469 DECL_SAVED_TREE (r
) = NULL_TREE
;
11470 DECL_STRUCT_FUNCTION (r
) = NULL
;
11472 /* We'll re-clone as appropriate in instantiate_template. */
11473 DECL_CLONED_FUNCTION (r
) = NULL_TREE
;
11475 /* If we aren't complaining now, return on error before we register
11476 the specialization so that we'll complain eventually. */
11477 if ((complain
& tf_error
) == 0
11478 && IDENTIFIER_OPNAME_P (DECL_NAME (r
))
11479 && !grok_op_properties (r
, /*complain=*/false))
11480 RETURN (error_mark_node
);
11482 /* When instantiating a constrained member, substitute
11483 into the constraints to create a new constraint. */
11484 if (tree ci
= get_constraints (t
))
11487 ci
= tsubst_constraint_info (ci
, argvec
, complain
, NULL_TREE
);
11488 set_constraints (r
, ci
);
11491 /* Set up the DECL_TEMPLATE_INFO for R. There's no need to do
11492 this in the special friend case mentioned above where
11493 GEN_TMPL is NULL. */
11496 DECL_TEMPLATE_INFO (r
)
11497 = build_template_info (gen_tmpl
, argvec
);
11498 SET_DECL_IMPLICIT_INSTANTIATION (r
);
11501 = register_specialization (r
, gen_tmpl
, argvec
, false, hash
);
11503 /* We instantiated this while substituting into
11504 the type earlier (template/friend54.C). */
11507 /* We're not supposed to instantiate default arguments
11508 until they are called, for a template. But, for a
11511 template <class T> void f ()
11512 { extern void g(int i = T()); }
11514 we should do the substitution when the template is
11515 instantiated. We handle the member function case in
11516 instantiate_class_template since the default arguments
11517 might refer to other members of the class. */
11519 && !PRIMARY_TEMPLATE_P (gen_tmpl
)
11520 && !uses_template_parms (argvec
))
11521 tsubst_default_arguments (r
, complain
);
11524 DECL_TEMPLATE_INFO (r
) = NULL_TREE
;
11526 /* Copy the list of befriending classes. */
11527 for (friends
= &DECL_BEFRIENDING_CLASSES (r
);
11529 friends
= &TREE_CHAIN (*friends
))
11531 *friends
= copy_node (*friends
);
11532 TREE_VALUE (*friends
) = tsubst (TREE_VALUE (*friends
),
11537 if (DECL_CONSTRUCTOR_P (r
) || DECL_DESTRUCTOR_P (r
))
11539 maybe_retrofit_in_chrg (r
);
11540 if (DECL_CONSTRUCTOR_P (r
))
11541 grok_ctor_properties (ctx
, r
);
11542 if (DECL_INHERITED_CTOR_BASE (r
))
11543 deduce_inheriting_ctor (r
);
11544 /* If this is an instantiation of a member template, clone it.
11545 If it isn't, that'll be handled by
11546 clone_constructors_and_destructors. */
11547 if (PRIMARY_TEMPLATE_P (gen_tmpl
))
11548 clone_function_decl (r
, /*update_method_vec_p=*/0);
11550 else if ((complain
& tf_error
) != 0
11551 && IDENTIFIER_OPNAME_P (DECL_NAME (r
))
11552 && !grok_op_properties (r
, /*complain=*/true))
11553 RETURN (error_mark_node
);
11555 if (DECL_FRIEND_P (t
) && DECL_FRIEND_CONTEXT (t
))
11556 SET_DECL_FRIEND_CONTEXT (r
,
11557 tsubst (DECL_FRIEND_CONTEXT (t
),
11558 args
, complain
, in_decl
));
11560 /* Possibly limit visibility based on template args. */
11561 DECL_VISIBILITY (r
) = VISIBILITY_DEFAULT
;
11562 if (DECL_VISIBILITY_SPECIFIED (t
))
11564 DECL_VISIBILITY_SPECIFIED (r
) = 0;
11565 DECL_ATTRIBUTES (r
)
11566 = remove_attribute ("visibility", DECL_ATTRIBUTES (r
));
11568 determine_visibility (r
);
11569 if (DECL_DEFAULTED_OUTSIDE_CLASS_P (r
)
11570 && !processing_template_decl
)
11571 defaulted_late_check (r
);
11573 apply_late_template_attributes (&r
, DECL_ATTRIBUTES (r
), 0,
11574 args
, complain
, in_decl
);
11580 tree type
= NULL_TREE
;
11582 tree expanded_types
= NULL_TREE
;
11583 tree prev_r
= NULL_TREE
;
11584 tree first_r
= NULL_TREE
;
11586 if (DECL_PACK_P (t
))
11588 /* If there is a local specialization that isn't a
11589 parameter pack, it means that we're doing a "simple"
11590 substitution from inside tsubst_pack_expansion. Just
11591 return the local specialization (which will be a single
11593 tree spec
= retrieve_local_specialization (t
);
11595 && TREE_CODE (spec
) == PARM_DECL
11596 && TREE_CODE (TREE_TYPE (spec
)) != TYPE_PACK_EXPANSION
)
11599 /* Expand the TYPE_PACK_EXPANSION that provides the types for
11600 the parameters in this function parameter pack. */
11601 expanded_types
= tsubst_pack_expansion (TREE_TYPE (t
), args
,
11602 complain
, in_decl
);
11603 if (TREE_CODE (expanded_types
) == TREE_VEC
)
11605 len
= TREE_VEC_LENGTH (expanded_types
);
11607 /* Zero-length parameter packs are boring. Just substitute
11610 RETURN (tsubst (TREE_CHAIN (t
), args
, complain
,
11615 /* All we did was update the type. Make a note of that. */
11616 type
= expanded_types
;
11617 expanded_types
= NULL_TREE
;
11621 /* Loop through all of the parameters we'll build. When T is
11622 a function parameter pack, LEN is the number of expanded
11623 types in EXPANDED_TYPES; otherwise, LEN is 1. */
11625 for (i
= 0; i
< len
; ++i
)
11629 if (DECL_TEMPLATE_PARM_P (t
))
11630 SET_DECL_TEMPLATE_PARM_P (r
);
11632 if (expanded_types
)
11633 /* We're on the Ith parameter of the function parameter
11636 /* Get the Ith type. */
11637 type
= TREE_VEC_ELT (expanded_types
, i
);
11639 /* Rename the parameter to include the index. */
11641 = make_ith_pack_parameter_name (DECL_NAME (r
), i
);
11644 /* We're dealing with a normal parameter. */
11645 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
11647 type
= type_decays_to (type
);
11648 TREE_TYPE (r
) = type
;
11649 cp_apply_type_quals_to_decl (cp_type_quals (type
), r
);
11651 if (DECL_INITIAL (r
))
11653 if (TREE_CODE (DECL_INITIAL (r
)) != TEMPLATE_PARM_INDEX
)
11654 DECL_INITIAL (r
) = TREE_TYPE (r
);
11656 DECL_INITIAL (r
) = tsubst (DECL_INITIAL (r
), args
,
11657 complain
, in_decl
);
11660 DECL_CONTEXT (r
) = NULL_TREE
;
11662 if (!DECL_TEMPLATE_PARM_P (r
))
11663 DECL_ARG_TYPE (r
) = type_passed_as (type
);
11665 apply_late_template_attributes (&r
, DECL_ATTRIBUTES (r
), 0,
11666 args
, complain
, in_decl
);
11668 /* Keep track of the first new parameter we
11669 generate. That's what will be returned to the
11674 /* Build a proper chain of parameters when substituting
11675 into a function parameter pack. */
11677 DECL_CHAIN (prev_r
) = r
;
11680 /* If cp_unevaluated_operand is set, we're just looking for a
11681 single dummy parameter, so don't keep going. */
11682 if (DECL_CHAIN (t
) && !cp_unevaluated_operand
)
11683 DECL_CHAIN (r
) = tsubst (DECL_CHAIN (t
), args
,
11684 complain
, DECL_CHAIN (t
));
11686 /* FIRST_R contains the start of the chain we've built. */
11693 tree type
= NULL_TREE
;
11694 tree vec
= NULL_TREE
;
11695 tree expanded_types
= NULL_TREE
;
11698 if (PACK_EXPANSION_P (TREE_TYPE (t
)))
11700 /* This field is a lambda capture pack. Return a TREE_VEC of
11701 the expanded fields to instantiate_class_template_1 and
11702 store them in the specializations hash table as a
11703 NONTYPE_ARGUMENT_PACK so that tsubst_copy can find them. */
11704 expanded_types
= tsubst_pack_expansion (TREE_TYPE (t
), args
,
11705 complain
, in_decl
);
11706 if (TREE_CODE (expanded_types
) == TREE_VEC
)
11708 len
= TREE_VEC_LENGTH (expanded_types
);
11709 vec
= make_tree_vec (len
);
11713 /* All we did was update the type. Make a note of that. */
11714 type
= expanded_types
;
11715 expanded_types
= NULL_TREE
;
11719 for (int i
= 0; i
< len
; ++i
)
11722 if (expanded_types
)
11724 type
= TREE_VEC_ELT (expanded_types
, i
);
11726 = make_ith_pack_parameter_name (DECL_NAME (r
), i
);
11729 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
11731 if (type
== error_mark_node
)
11732 RETURN (error_mark_node
);
11733 TREE_TYPE (r
) = type
;
11734 cp_apply_type_quals_to_decl (cp_type_quals (type
), r
);
11736 if (DECL_C_BIT_FIELD (r
))
11737 /* For bit-fields, DECL_INITIAL gives the number of bits. For
11738 non-bit-fields DECL_INITIAL is a non-static data member
11739 initializer, which gets deferred instantiation. */
11741 = tsubst_expr (DECL_INITIAL (t
), args
,
11743 /*integral_constant_expression_p=*/true);
11744 else if (DECL_INITIAL (t
))
11746 /* Set up DECL_TEMPLATE_INFO so that we can get at the
11747 NSDMI in perform_member_init. Still set DECL_INITIAL
11748 so that we know there is one. */
11749 DECL_INITIAL (r
) = void_node
;
11750 gcc_assert (DECL_LANG_SPECIFIC (r
) == NULL
);
11751 retrofit_lang_decl (r
);
11752 DECL_TEMPLATE_INFO (r
) = build_template_info (t
, args
);
11754 /* We don't have to set DECL_CONTEXT here; it is set by
11755 finish_member_declaration. */
11756 DECL_CHAIN (r
) = NULL_TREE
;
11758 apply_late_template_attributes (&r
, DECL_ATTRIBUTES (r
), 0,
11759 args
, complain
, in_decl
);
11762 TREE_VEC_ELT (vec
, i
) = r
;
11768 tree pack
= make_node (NONTYPE_ARGUMENT_PACK
);
11769 tree tpack
= cxx_make_type (TYPE_ARGUMENT_PACK
);
11770 SET_ARGUMENT_PACK_ARGS (pack
, vec
);
11771 SET_ARGUMENT_PACK_ARGS (tpack
, expanded_types
);
11772 TREE_TYPE (pack
) = tpack
;
11773 register_specialization (pack
, t
, args
, false, 0);
11779 /* We reach here only for member using decls. We also need to check
11780 uses_template_parms because DECL_DEPENDENT_P is not set for a
11781 using-declaration that designates a member of the current
11782 instantiation (c++/53549). */
11783 if (DECL_DEPENDENT_P (t
)
11784 || uses_template_parms (USING_DECL_SCOPE (t
)))
11786 tree inst_scope
= tsubst_copy (USING_DECL_SCOPE (t
), args
,
11787 complain
, in_decl
);
11788 tree name
= tsubst_copy (DECL_NAME (t
), args
, complain
, in_decl
);
11789 r
= do_class_using_decl (inst_scope
, name
);
11791 r
= error_mark_node
;
11794 TREE_PROTECTED (r
) = TREE_PROTECTED (t
);
11795 TREE_PRIVATE (r
) = TREE_PRIVATE (t
);
11801 DECL_CHAIN (r
) = NULL_TREE
;
11808 tree argvec
= NULL_TREE
;
11809 tree gen_tmpl
= NULL_TREE
;
11811 tree tmpl
= NULL_TREE
;
11813 tree type
= NULL_TREE
;
11816 if (TREE_TYPE (t
) == error_mark_node
)
11817 RETURN (error_mark_node
);
11819 if (TREE_CODE (t
) == TYPE_DECL
11820 && t
== TYPE_MAIN_DECL (TREE_TYPE (t
)))
11822 /* If this is the canonical decl, we don't have to
11823 mess with instantiations, and often we can't (for
11824 typename, template type parms and such). Note that
11825 TYPE_NAME is not correct for the above test if
11826 we've copied the type for a typedef. */
11827 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
11828 if (type
== error_mark_node
)
11829 RETURN (error_mark_node
);
11830 r
= TYPE_NAME (type
);
11834 /* Check to see if we already have the specialization we
11837 if (DECL_CLASS_SCOPE_P (t
) || DECL_NAMESPACE_SCOPE_P (t
))
11839 /* T is a static data member or namespace-scope entity.
11840 We have to substitute into namespace-scope variables
11841 (not just variable templates) because of cases like:
11843 template <class T> void f() { extern T t; }
11845 where the entity referenced is not known until
11846 instantiation time. */
11848 ctx
= DECL_CONTEXT (t
);
11849 if (DECL_CLASS_SCOPE_P (t
))
11851 ctx
= tsubst_aggr_type (ctx
, args
,
11853 in_decl
, /*entering_scope=*/1);
11854 /* If CTX is unchanged, then T is in fact the
11855 specialization we want. That situation occurs when
11856 referencing a static data member within in its own
11857 class. We can use pointer equality, rather than
11858 same_type_p, because DECL_CONTEXT is always
11860 if (ctx
== DECL_CONTEXT (t
)
11861 /* ... unless T is a member template; in which
11862 case our caller can be willing to create a
11863 specialization of that template represented
11865 && !(DECL_TI_TEMPLATE (t
)
11866 && DECL_MEMBER_TEMPLATE_P (DECL_TI_TEMPLATE (t
))))
11872 tmpl
= DECL_TI_TEMPLATE (t
);
11873 gen_tmpl
= most_general_template (tmpl
);
11874 argvec
= tsubst (DECL_TI_ARGS (t
), args
, complain
, in_decl
);
11875 if (argvec
!= error_mark_node
)
11876 argvec
= (coerce_innermost_template_parms
11877 (DECL_TEMPLATE_PARMS (gen_tmpl
),
11878 argvec
, t
, complain
,
11879 /*all*/true, /*defarg*/true));
11880 if (argvec
== error_mark_node
)
11881 RETURN (error_mark_node
);
11882 hash
= hash_tmpl_and_args (gen_tmpl
, argvec
);
11883 spec
= retrieve_specialization (gen_tmpl
, argvec
, hash
);
11888 /* A local variable. */
11890 /* Subsequent calls to pushdecl will fill this in. */
11892 spec
= retrieve_local_specialization (t
);
11894 /* If we already have the specialization we need, there is
11895 nothing more to do. */
11902 /* Create a new node for the specialization we need. */
11904 if (type
== NULL_TREE
)
11906 if (is_typedef_decl (t
))
11907 type
= DECL_ORIGINAL_TYPE (t
);
11909 type
= TREE_TYPE (t
);
11911 && VAR_HAD_UNKNOWN_BOUND (t
)
11912 && type
!= error_mark_node
)
11913 type
= strip_array_domain (type
);
11914 type
= tsubst (type
, args
, complain
, in_decl
);
11918 /* Even if the original location is out of scope, the
11919 newly substituted one is not. */
11920 DECL_DEAD_FOR_LOCAL (r
) = 0;
11921 DECL_INITIALIZED_P (r
) = 0;
11922 DECL_TEMPLATE_INSTANTIATED (r
) = 0;
11923 if (type
== error_mark_node
)
11924 RETURN (error_mark_node
);
11925 if (TREE_CODE (type
) == FUNCTION_TYPE
)
11927 /* It may seem that this case cannot occur, since:
11932 declares a function, not a variable. However:
11935 template <typename T> void g() { T t; }
11936 template void g<f>();
11938 is an attempt to declare a variable with function
11940 error ("variable %qD has function type",
11941 /* R is not yet sufficiently initialized, so we
11942 just use its name. */
11944 RETURN (error_mark_node
);
11946 type
= complete_type (type
);
11947 /* Wait until cp_finish_decl to set this again, to handle
11948 circular dependency (template/instantiate6.C). */
11949 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (r
) = 0;
11950 type
= check_var_type (DECL_NAME (r
), type
);
11952 if (DECL_HAS_VALUE_EXPR_P (t
))
11954 tree ve
= DECL_VALUE_EXPR (t
);
11955 ve
= tsubst_expr (ve
, args
, complain
, in_decl
,
11956 /*constant_expression_p=*/false);
11957 if (REFERENCE_REF_P (ve
))
11959 gcc_assert (TREE_CODE (type
) == REFERENCE_TYPE
);
11960 ve
= TREE_OPERAND (ve
, 0);
11962 SET_DECL_VALUE_EXPR (r
, ve
);
11964 if (CP_DECL_THREAD_LOCAL_P (r
)
11965 && !processing_template_decl
)
11966 set_decl_tls_model (r
, decl_default_tls_model (r
));
11968 else if (DECL_SELF_REFERENCE_P (t
))
11969 SET_DECL_SELF_REFERENCE_P (r
);
11970 TREE_TYPE (r
) = type
;
11971 cp_apply_type_quals_to_decl (cp_type_quals (type
), r
);
11972 DECL_CONTEXT (r
) = ctx
;
11973 /* Clear out the mangled name and RTL for the instantiation. */
11974 SET_DECL_ASSEMBLER_NAME (r
, NULL_TREE
);
11975 if (CODE_CONTAINS_STRUCT (TREE_CODE (t
), TS_DECL_WRTL
))
11976 SET_DECL_RTL (r
, NULL
);
11977 /* The initializer must not be expanded until it is required;
11978 see [temp.inst]. */
11979 DECL_INITIAL (r
) = NULL_TREE
;
11980 if (CODE_CONTAINS_STRUCT (TREE_CODE (t
), TS_DECL_WRTL
))
11981 SET_DECL_RTL (r
, NULL
);
11982 DECL_SIZE (r
) = DECL_SIZE_UNIT (r
) = 0;
11985 /* Possibly limit visibility based on template args. */
11986 DECL_VISIBILITY (r
) = VISIBILITY_DEFAULT
;
11987 if (DECL_VISIBILITY_SPECIFIED (t
))
11989 DECL_VISIBILITY_SPECIFIED (r
) = 0;
11990 DECL_ATTRIBUTES (r
)
11991 = remove_attribute ("visibility", DECL_ATTRIBUTES (r
));
11993 determine_visibility (r
);
11998 /* A static data member declaration is always marked
11999 external when it is declared in-class, even if an
12000 initializer is present. We mimic the non-template
12001 processing here. */
12002 DECL_EXTERNAL (r
) = 1;
12003 if (DECL_NAMESPACE_SCOPE_P (t
))
12004 DECL_NOT_REALLY_EXTERN (r
) = 1;
12006 DECL_TEMPLATE_INFO (r
) = build_template_info (tmpl
, argvec
);
12007 SET_DECL_IMPLICIT_INSTANTIATION (r
);
12008 register_specialization (r
, gen_tmpl
, argvec
, false, hash
);
12010 else if (!cp_unevaluated_operand
)
12011 register_local_specialization (r
, t
);
12013 DECL_CHAIN (r
) = NULL_TREE
;
12015 apply_late_template_attributes (&r
, DECL_ATTRIBUTES (r
),
12017 args
, complain
, in_decl
);
12019 /* Preserve a typedef that names a type. */
12020 if (is_typedef_decl (r
))
12022 DECL_ORIGINAL_TYPE (r
) = NULL_TREE
;
12023 set_underlying_type (r
);
12024 if (TYPE_DECL_ALIAS_P (r
) && type
!= error_mark_node
)
12025 /* An alias template specialization can be dependent
12026 even if its underlying type is not. */
12027 TYPE_DEPENDENT_P_VALID (TREE_TYPE (r
)) = false;
12030 layout_decl (r
, 0);
12035 gcc_unreachable ();
12040 /* Restore the file and line information. */
12041 input_location
= saved_loc
;
12046 /* Substitute into the ARG_TYPES of a function type.
12047 If END is a TREE_CHAIN, leave it and any following types
12051 tsubst_arg_types (tree arg_types
,
12054 tsubst_flags_t complain
,
12057 tree remaining_arg_types
;
12058 tree type
= NULL_TREE
;
12060 tree expanded_args
= NULL_TREE
;
12063 if (!arg_types
|| arg_types
== void_list_node
|| arg_types
== end
)
12066 remaining_arg_types
= tsubst_arg_types (TREE_CHAIN (arg_types
),
12067 args
, end
, complain
, in_decl
);
12068 if (remaining_arg_types
== error_mark_node
)
12069 return error_mark_node
;
12071 if (PACK_EXPANSION_P (TREE_VALUE (arg_types
)))
12073 /* For a pack expansion, perform substitution on the
12074 entire expression. Later on, we'll handle the arguments
12076 expanded_args
= tsubst_pack_expansion (TREE_VALUE (arg_types
),
12077 args
, complain
, in_decl
);
12079 if (TREE_CODE (expanded_args
) == TREE_VEC
)
12080 /* So that we'll spin through the parameters, one by one. */
12081 i
= TREE_VEC_LENGTH (expanded_args
);
12084 /* We only partially substituted into the parameter
12085 pack. Our type is TYPE_PACK_EXPANSION. */
12086 type
= expanded_args
;
12087 expanded_args
= NULL_TREE
;
12095 type
= TREE_VEC_ELT (expanded_args
, i
);
12097 type
= tsubst (TREE_VALUE (arg_types
), args
, complain
, in_decl
);
12099 if (type
== error_mark_node
)
12100 return error_mark_node
;
12101 if (VOID_TYPE_P (type
))
12103 if (complain
& tf_error
)
12105 error ("invalid parameter type %qT", type
);
12107 error ("in declaration %q+D", in_decl
);
12109 return error_mark_node
;
12112 if (abstract_virtuals_error_sfinae (ACU_PARM
, type
, complain
))
12113 return error_mark_node
;
12115 /* Do array-to-pointer, function-to-pointer conversion, and ignore
12116 top-level qualifiers as required. */
12117 type
= cv_unqualified (type_decays_to (type
));
12119 /* We do not substitute into default arguments here. The standard
12120 mandates that they be instantiated only when needed, which is
12121 done in build_over_call. */
12122 default_arg
= TREE_PURPOSE (arg_types
);
12124 if (default_arg
&& TREE_CODE (default_arg
) == DEFAULT_ARG
)
12126 /* We've instantiated a template before its default arguments
12127 have been parsed. This can happen for a nested template
12128 class, and is not an error unless we require the default
12129 argument in a call of this function. */
12130 remaining_arg_types
=
12131 tree_cons (default_arg
, type
, remaining_arg_types
);
12132 vec_safe_push (DEFARG_INSTANTIATIONS(default_arg
), remaining_arg_types
);
12135 remaining_arg_types
=
12136 hash_tree_cons (default_arg
, type
, remaining_arg_types
);
12139 return remaining_arg_types
;
12142 /* Substitute into a FUNCTION_TYPE or METHOD_TYPE. This routine does
12143 *not* handle the exception-specification for FNTYPE, because the
12144 initial substitution of explicitly provided template parameters
12145 during argument deduction forbids substitution into the
12146 exception-specification:
12150 All references in the function type of the function template to the
12151 corresponding template parameters are replaced by the specified tem-
12152 plate argument values. If a substitution in a template parameter or
12153 in the function type of the function template results in an invalid
12154 type, type deduction fails. [Note: The equivalent substitution in
12155 exception specifications is done only when the function is instanti-
12156 ated, at which point a program is ill-formed if the substitution
12157 results in an invalid type.] */
12160 tsubst_function_type (tree t
,
12162 tsubst_flags_t complain
,
12166 tree arg_types
= NULL_TREE
;
12169 /* The TYPE_CONTEXT is not used for function/method types. */
12170 gcc_assert (TYPE_CONTEXT (t
) == NULL_TREE
);
12172 /* DR 1227: Mixing immediate and non-immediate contexts in deduction
12174 bool late_return_type_p
= TYPE_HAS_LATE_RETURN_TYPE (t
);
12176 if (late_return_type_p
)
12178 /* Substitute the argument types. */
12179 arg_types
= tsubst_arg_types (TYPE_ARG_TYPES (t
), args
, NULL_TREE
,
12180 complain
, in_decl
);
12181 if (arg_types
== error_mark_node
)
12182 return error_mark_node
;
12184 tree save_ccp
= current_class_ptr
;
12185 tree save_ccr
= current_class_ref
;
12186 tree this_type
= (TREE_CODE (t
) == METHOD_TYPE
12187 ? TREE_TYPE (TREE_VALUE (arg_types
)) : NULL_TREE
);
12188 bool do_inject
= this_type
&& CLASS_TYPE_P (this_type
);
12191 /* DR 1207: 'this' is in scope in the trailing return type. */
12192 inject_this_parameter (this_type
, cp_type_quals (this_type
));
12195 /* Substitute the return type. */
12196 return_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
12200 current_class_ptr
= save_ccp
;
12201 current_class_ref
= save_ccr
;
12205 /* Substitute the return type. */
12206 return_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
12208 if (return_type
== error_mark_node
)
12209 return error_mark_node
;
12210 /* DR 486 clarifies that creation of a function type with an
12211 invalid return type is a deduction failure. */
12212 if (TREE_CODE (return_type
) == ARRAY_TYPE
12213 || TREE_CODE (return_type
) == FUNCTION_TYPE
)
12215 if (complain
& tf_error
)
12217 if (TREE_CODE (return_type
) == ARRAY_TYPE
)
12218 error ("function returning an array");
12220 error ("function returning a function");
12222 return error_mark_node
;
12225 if (abstract_virtuals_error_sfinae (ACU_RETURN
, return_type
, complain
))
12226 return error_mark_node
;
12228 if (!late_return_type_p
)
12230 /* Substitute the argument types. */
12231 arg_types
= tsubst_arg_types (TYPE_ARG_TYPES (t
), args
, NULL_TREE
,
12232 complain
, in_decl
);
12233 if (arg_types
== error_mark_node
)
12234 return error_mark_node
;
12237 /* Construct a new type node and return it. */
12238 if (TREE_CODE (t
) == FUNCTION_TYPE
)
12240 fntype
= build_function_type (return_type
, arg_types
);
12241 fntype
= apply_memfn_quals (fntype
,
12242 type_memfn_quals (t
),
12243 type_memfn_rqual (t
));
12247 tree r
= TREE_TYPE (TREE_VALUE (arg_types
));
12248 /* Don't pick up extra function qualifiers from the basetype. */
12249 r
= cp_build_qualified_type_real (r
, type_memfn_quals (t
), complain
);
12250 if (! MAYBE_CLASS_TYPE_P (r
))
12254 Type deduction may fail for any of the following
12257 -- Attempting to create "pointer to member of T" when T
12258 is not a class type. */
12259 if (complain
& tf_error
)
12260 error ("creating pointer to member function of non-class type %qT",
12262 return error_mark_node
;
12265 fntype
= build_method_type_directly (r
, return_type
,
12266 TREE_CHAIN (arg_types
));
12267 fntype
= build_ref_qualified_type (fntype
, type_memfn_rqual (t
));
12269 fntype
= cp_build_type_attribute_variant (fntype
, TYPE_ATTRIBUTES (t
));
12271 if (late_return_type_p
)
12272 TYPE_HAS_LATE_RETURN_TYPE (fntype
) = 1;
12277 /* FNTYPE is a FUNCTION_TYPE or METHOD_TYPE. Substitute the template
12278 ARGS into that specification, and return the substituted
12279 specification. If there is no specification, return NULL_TREE. */
12282 tsubst_exception_specification (tree fntype
,
12284 tsubst_flags_t complain
,
12291 specs
= TYPE_RAISES_EXCEPTIONS (fntype
);
12292 new_specs
= NULL_TREE
;
12293 if (specs
&& TREE_PURPOSE (specs
))
12295 /* A noexcept-specifier. */
12296 tree expr
= TREE_PURPOSE (specs
);
12297 if (TREE_CODE (expr
) == INTEGER_CST
)
12301 /* Defer instantiation of noexcept-specifiers to avoid
12302 excessive instantiations (c++/49107). */
12303 new_specs
= make_node (DEFERRED_NOEXCEPT
);
12304 if (DEFERRED_NOEXCEPT_SPEC_P (specs
))
12306 /* We already partially instantiated this member template,
12307 so combine the new args with the old. */
12308 DEFERRED_NOEXCEPT_PATTERN (new_specs
)
12309 = DEFERRED_NOEXCEPT_PATTERN (expr
);
12310 DEFERRED_NOEXCEPT_ARGS (new_specs
)
12311 = add_to_template_args (DEFERRED_NOEXCEPT_ARGS (expr
), args
);
12315 DEFERRED_NOEXCEPT_PATTERN (new_specs
) = expr
;
12316 DEFERRED_NOEXCEPT_ARGS (new_specs
) = args
;
12320 new_specs
= tsubst_copy_and_build
12321 (expr
, args
, complain
, in_decl
, /*function_p=*/false,
12322 /*integral_constant_expression_p=*/true);
12323 new_specs
= build_noexcept_spec (new_specs
, complain
);
12327 if (! TREE_VALUE (specs
))
12334 tree expanded_specs
= NULL_TREE
;
12336 if (PACK_EXPANSION_P (TREE_VALUE (specs
)))
12338 /* Expand the pack expansion type. */
12339 expanded_specs
= tsubst_pack_expansion (TREE_VALUE (specs
),
12343 if (expanded_specs
== error_mark_node
)
12344 return error_mark_node
;
12345 else if (TREE_CODE (expanded_specs
) == TREE_VEC
)
12346 len
= TREE_VEC_LENGTH (expanded_specs
);
12349 /* We're substituting into a member template, so
12350 we got a TYPE_PACK_EXPANSION back. Add that
12351 expansion and move on. */
12352 gcc_assert (TREE_CODE (expanded_specs
)
12353 == TYPE_PACK_EXPANSION
);
12354 new_specs
= add_exception_specifier (new_specs
,
12357 specs
= TREE_CHAIN (specs
);
12362 for (i
= 0; i
< len
; ++i
)
12364 if (expanded_specs
)
12365 spec
= TREE_VEC_ELT (expanded_specs
, i
);
12367 spec
= tsubst (TREE_VALUE (specs
), args
, complain
, in_decl
);
12368 if (spec
== error_mark_node
)
12370 new_specs
= add_exception_specifier (new_specs
, spec
,
12374 specs
= TREE_CHAIN (specs
);
12380 /* Take the tree structure T and replace template parameters used
12381 therein with the argument vector ARGS. IN_DECL is an associated
12382 decl for diagnostics. If an error occurs, returns ERROR_MARK_NODE.
12383 Issue error and warning messages under control of COMPLAIN. Note
12384 that we must be relatively non-tolerant of extensions here, in
12385 order to preserve conformance; if we allow substitutions that
12386 should not be allowed, we may allow argument deductions that should
12387 not succeed, and therefore report ambiguous overload situations
12388 where there are none. In theory, we could allow the substitution,
12389 but indicate that it should have failed, and allow our caller to
12390 make sure that the right thing happens, but we don't try to do this
12393 This function is used for dealing with types, decls and the like;
12394 for expressions, use tsubst_expr or tsubst_copy. */
12397 tsubst (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
12399 enum tree_code code
;
12400 tree type
, r
= NULL_TREE
;
12402 if (t
== NULL_TREE
|| t
== error_mark_node
12403 || t
== integer_type_node
12404 || t
== void_type_node
12405 || t
== char_type_node
12406 || t
== unknown_type_node
12407 || TREE_CODE (t
) == NAMESPACE_DECL
12408 || TREE_CODE (t
) == TRANSLATION_UNIT_DECL
)
12412 return tsubst_decl (t
, args
, complain
);
12414 if (args
== NULL_TREE
)
12417 code
= TREE_CODE (t
);
12419 if (code
== IDENTIFIER_NODE
)
12420 type
= IDENTIFIER_TYPE_VALUE (t
);
12422 type
= TREE_TYPE (t
);
12424 gcc_assert (type
!= unknown_type_node
);
12426 /* Reuse typedefs. We need to do this to handle dependent attributes,
12427 such as attribute aligned. */
12429 && typedef_variant_p (t
))
12431 tree decl
= TYPE_NAME (t
);
12433 if (alias_template_specialization_p (t
))
12435 /* DECL represents an alias template and we want to
12437 tree tmpl
= most_general_template (DECL_TI_TEMPLATE (decl
));
12438 tree gen_args
= tsubst (DECL_TI_ARGS (decl
), args
, complain
, in_decl
);
12439 r
= instantiate_alias_template (tmpl
, gen_args
, complain
);
12441 else if (DECL_CLASS_SCOPE_P (decl
)
12442 && CLASSTYPE_TEMPLATE_INFO (DECL_CONTEXT (decl
))
12443 && uses_template_parms (DECL_CONTEXT (decl
)))
12445 tree tmpl
= most_general_template (DECL_TI_TEMPLATE (decl
));
12446 tree gen_args
= tsubst (DECL_TI_ARGS (decl
), args
, complain
, in_decl
);
12447 r
= retrieve_specialization (tmpl
, gen_args
, 0);
12449 else if (DECL_FUNCTION_SCOPE_P (decl
)
12450 && DECL_TEMPLATE_INFO (DECL_CONTEXT (decl
))
12451 && uses_template_parms (DECL_TI_ARGS (DECL_CONTEXT (decl
))))
12452 r
= retrieve_local_specialization (decl
);
12454 /* The typedef is from a non-template context. */
12460 r
= cp_build_qualified_type_real
12461 (r
, cp_type_quals (t
) | cp_type_quals (r
),
12462 complain
| tf_ignore_bad_quals
);
12467 /* We don't have an instantiation yet, so drop the typedef. */
12468 int quals
= cp_type_quals (t
);
12469 t
= DECL_ORIGINAL_TYPE (decl
);
12470 t
= cp_build_qualified_type_real (t
, quals
,
12471 complain
| tf_ignore_bad_quals
);
12476 && code
!= TYPENAME_TYPE
12477 && code
!= TEMPLATE_TYPE_PARM
12478 && code
!= IDENTIFIER_NODE
12479 && code
!= FUNCTION_TYPE
12480 && code
!= METHOD_TYPE
)
12481 type
= tsubst (type
, args
, complain
, in_decl
);
12482 if (type
== error_mark_node
)
12483 return error_mark_node
;
12489 case ENUMERAL_TYPE
:
12490 return tsubst_aggr_type (t
, args
, complain
, in_decl
,
12491 /*entering_scope=*/0);
12494 case IDENTIFIER_NODE
:
12505 if (t
== integer_type_node
)
12508 if (TREE_CODE (TYPE_MIN_VALUE (t
)) == INTEGER_CST
12509 && TREE_CODE (TYPE_MAX_VALUE (t
)) == INTEGER_CST
)
12513 tree max
, omax
= TREE_OPERAND (TYPE_MAX_VALUE (t
), 0);
12515 max
= tsubst_expr (omax
, args
, complain
, in_decl
,
12516 /*integral_constant_expression_p=*/false);
12518 /* Fix up type of the magic NOP_EXPR with TREE_SIDE_EFFECTS if
12520 if (TREE_CODE (max
) == NOP_EXPR
12521 && TREE_SIDE_EFFECTS (omax
)
12522 && !TREE_TYPE (max
))
12523 TREE_TYPE (max
) = TREE_TYPE (TREE_OPERAND (max
, 0));
12525 /* If we're in a partial instantiation, preserve the magic NOP_EXPR
12526 with TREE_SIDE_EFFECTS that indicates this is not an integral
12527 constant expression. */
12528 if (processing_template_decl
12529 && TREE_SIDE_EFFECTS (omax
) && TREE_CODE (omax
) == NOP_EXPR
)
12531 gcc_assert (TREE_CODE (max
) == NOP_EXPR
);
12532 TREE_SIDE_EFFECTS (max
) = 1;
12535 return compute_array_index_type (NULL_TREE
, max
, complain
);
12538 case TEMPLATE_TYPE_PARM
:
12539 case TEMPLATE_TEMPLATE_PARM
:
12540 case BOUND_TEMPLATE_TEMPLATE_PARM
:
12541 case TEMPLATE_PARM_INDEX
:
12546 tree arg
= NULL_TREE
;
12548 /* Early in template argument deduction substitution, we don't
12549 want to reduce the level of 'auto', or it will be confused
12550 with a normal template parm in subsequent deduction. */
12551 if (is_auto (t
) && (complain
& tf_partial
))
12556 gcc_assert (TREE_VEC_LENGTH (args
) > 0);
12557 template_parm_level_and_index (t
, &level
, &idx
);
12559 levels
= TMPL_ARGS_DEPTH (args
);
12560 if (level
<= levels
12561 && TREE_VEC_LENGTH (TMPL_ARGS_LEVEL (args
, level
)) > 0)
12563 arg
= TMPL_ARG (args
, level
, idx
);
12565 if (arg
&& TREE_CODE (arg
) == ARGUMENT_PACK_SELECT
)
12567 /* See through ARGUMENT_PACK_SELECT arguments. */
12568 arg
= ARGUMENT_PACK_SELECT_ARG (arg
);
12569 /* If the selected argument is an expansion E, that most
12570 likely means we were called from
12571 gen_elem_of_pack_expansion_instantiation during the
12572 substituting of pack an argument pack (which Ith
12573 element is a pack expansion, where I is
12574 ARGUMENT_PACK_SELECT_INDEX) into a pack expansion.
12575 In this case, the Ith element resulting from this
12576 substituting is going to be a pack expansion, which
12577 pattern is the pattern of E. Let's return the
12579 gen_elem_of_pack_expansion_instantiation will
12580 build the resulting pack expansion from it. */
12581 if (PACK_EXPANSION_P (arg
))
12583 /* Make sure we aren't throwing away arg info. */
12584 gcc_assert (!PACK_EXPANSION_EXTRA_ARGS (arg
));
12585 arg
= PACK_EXPANSION_PATTERN (arg
);
12590 if (arg
== error_mark_node
)
12591 return error_mark_node
;
12592 else if (arg
!= NULL_TREE
)
12594 if (ARGUMENT_PACK_P (arg
))
12595 /* If ARG is an argument pack, we don't actually want to
12596 perform a substitution here, because substitutions
12597 for argument packs are only done
12598 element-by-element. We can get to this point when
12599 substituting the type of a non-type template
12600 parameter pack, when that type actually contains
12601 template parameter packs from an outer template, e.g.,
12603 template<typename... Types> struct A {
12604 template<Types... Values> struct B { };
12608 if (code
== TEMPLATE_TYPE_PARM
)
12611 gcc_assert (TYPE_P (arg
));
12613 quals
= cp_type_quals (arg
) | cp_type_quals (t
);
12615 return cp_build_qualified_type_real
12616 (arg
, quals
, complain
| tf_ignore_bad_quals
);
12618 else if (code
== BOUND_TEMPLATE_TEMPLATE_PARM
)
12620 /* We are processing a type constructed from a
12621 template template parameter. */
12622 tree argvec
= tsubst (TYPE_TI_ARGS (t
),
12623 args
, complain
, in_decl
);
12624 if (argvec
== error_mark_node
)
12625 return error_mark_node
;
12627 gcc_assert (TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
12628 || TREE_CODE (arg
) == TEMPLATE_DECL
12629 || TREE_CODE (arg
) == UNBOUND_CLASS_TEMPLATE
);
12631 if (TREE_CODE (arg
) == UNBOUND_CLASS_TEMPLATE
)
12632 /* Consider this code:
12634 template <template <class> class Template>
12636 template <class Arg> using Bind = Template<Arg>;
12639 template <template <class> class Template, class Arg>
12640 using Instantiate = Template<Arg>; //#0
12642 template <template <class> class Template,
12645 Instantiate<Internal<Template>::template Bind,
12648 When #1 is parsed, the
12649 BOUND_TEMPLATE_TEMPLATE_PARM representing the
12650 parameter `Template' in #0 matches the
12651 UNBOUND_CLASS_TEMPLATE representing the argument
12652 `Internal<Template>::template Bind'; We then want
12653 to assemble the type `Bind<Argument>' that can't
12654 be fully created right now, because
12655 `Internal<Template>' not being complete, the Bind
12656 template cannot be looked up in that context. So
12657 we need to "store" `Bind<Argument>' for later
12658 when the context of Bind becomes complete. Let's
12659 store that in a TYPENAME_TYPE. */
12660 return make_typename_type (TYPE_CONTEXT (arg
),
12661 build_nt (TEMPLATE_ID_EXPR
,
12662 TYPE_IDENTIFIER (arg
),
12667 /* We can get a TEMPLATE_TEMPLATE_PARM here when we
12668 are resolving nested-types in the signature of a
12669 member function templates. Otherwise ARG is a
12670 TEMPLATE_DECL and is the real template to be
12672 if (TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
)
12673 arg
= TYPE_NAME (arg
);
12675 r
= lookup_template_class (arg
,
12677 DECL_CONTEXT (arg
),
12678 /*entering_scope=*/0,
12680 return cp_build_qualified_type_real
12681 (r
, cp_type_quals (t
) | cp_type_quals (r
), complain
);
12684 /* TEMPLATE_TEMPLATE_PARM or TEMPLATE_PARM_INDEX. */
12685 return convert_from_reference (unshare_expr (arg
));
12689 /* This can happen during the attempted tsubst'ing in
12690 unify. This means that we don't yet have any information
12691 about the template parameter in question. */
12694 /* If we get here, we must have been looking at a parm for a
12695 more deeply nested template. Make a new version of this
12696 template parameter, but with a lower level. */
12699 case TEMPLATE_TYPE_PARM
:
12700 case TEMPLATE_TEMPLATE_PARM
:
12701 case BOUND_TEMPLATE_TEMPLATE_PARM
:
12702 if (cp_type_quals (t
))
12704 r
= tsubst (TYPE_MAIN_VARIANT (t
), args
, complain
, in_decl
);
12705 r
= cp_build_qualified_type_real
12706 (r
, cp_type_quals (t
),
12707 complain
| (code
== TEMPLATE_TYPE_PARM
12708 ? tf_ignore_bad_quals
: 0));
12710 else if (TREE_CODE (t
) == TEMPLATE_TYPE_PARM
12711 && PLACEHOLDER_TYPE_CONSTRAINTS (t
)
12712 && (r
= (TEMPLATE_PARM_DESCENDANTS
12713 (TEMPLATE_TYPE_PARM_INDEX (t
))))
12714 && (r
= TREE_TYPE (r
))
12715 && !PLACEHOLDER_TYPE_CONSTRAINTS (r
))
12716 /* Break infinite recursion when substituting the constraints
12717 of a constrained placeholder. */;
12721 TEMPLATE_TYPE_PARM_INDEX (r
)
12722 = reduce_template_parm_level (TEMPLATE_TYPE_PARM_INDEX (t
),
12723 r
, levels
, args
, complain
);
12724 TYPE_STUB_DECL (r
) = TYPE_NAME (r
) = TEMPLATE_TYPE_DECL (r
);
12725 TYPE_MAIN_VARIANT (r
) = r
;
12726 TYPE_POINTER_TO (r
) = NULL_TREE
;
12727 TYPE_REFERENCE_TO (r
) = NULL_TREE
;
12729 if (TREE_CODE (r
) == TEMPLATE_TEMPLATE_PARM
)
12730 /* We have reduced the level of the template
12731 template parameter, but not the levels of its
12732 template parameters, so canonical_type_parameter
12733 will not be able to find the canonical template
12734 template parameter for this level. Thus, we
12735 require structural equality checking to compare
12736 TEMPLATE_TEMPLATE_PARMs. */
12737 SET_TYPE_STRUCTURAL_EQUALITY (r
);
12738 else if (TYPE_STRUCTURAL_EQUALITY_P (t
))
12739 SET_TYPE_STRUCTURAL_EQUALITY (r
);
12741 TYPE_CANONICAL (r
) = canonical_type_parameter (r
);
12743 /* Propagate constraints on placeholders. */
12744 if (TREE_CODE (t
) == TEMPLATE_TYPE_PARM
)
12745 if (tree constr
= PLACEHOLDER_TYPE_CONSTRAINTS (t
))
12746 PLACEHOLDER_TYPE_CONSTRAINTS (r
)
12747 = tsubst_constraint (constr
, args
, complain
, in_decl
);
12749 if (code
== BOUND_TEMPLATE_TEMPLATE_PARM
)
12751 tree argvec
= tsubst (TYPE_TI_ARGS (t
), args
,
12752 complain
, in_decl
);
12753 if (argvec
== error_mark_node
)
12754 return error_mark_node
;
12756 TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (r
)
12757 = build_template_info (TYPE_TI_TEMPLATE (t
), argvec
);
12762 case TEMPLATE_PARM_INDEX
:
12763 r
= reduce_template_parm_level (t
, type
, levels
, args
, complain
);
12767 gcc_unreachable ();
12775 tree purpose
, value
, chain
;
12777 if (t
== void_list_node
)
12780 purpose
= TREE_PURPOSE (t
);
12783 purpose
= tsubst (purpose
, args
, complain
, in_decl
);
12784 if (purpose
== error_mark_node
)
12785 return error_mark_node
;
12787 value
= TREE_VALUE (t
);
12790 value
= tsubst (value
, args
, complain
, in_decl
);
12791 if (value
== error_mark_node
)
12792 return error_mark_node
;
12794 chain
= TREE_CHAIN (t
);
12795 if (chain
&& chain
!= void_type_node
)
12797 chain
= tsubst (chain
, args
, complain
, in_decl
);
12798 if (chain
== error_mark_node
)
12799 return error_mark_node
;
12801 if (purpose
== TREE_PURPOSE (t
)
12802 && value
== TREE_VALUE (t
)
12803 && chain
== TREE_CHAIN (t
))
12805 return hash_tree_cons (purpose
, value
, chain
);
12809 /* We should never be tsubsting a binfo. */
12810 gcc_unreachable ();
12813 /* A vector of template arguments. */
12814 gcc_assert (!type
);
12815 return tsubst_template_args (t
, args
, complain
, in_decl
);
12818 case REFERENCE_TYPE
:
12820 if (type
== TREE_TYPE (t
) && TREE_CODE (type
) != METHOD_TYPE
)
12825 Type deduction may fail for any of the following
12828 -- Attempting to create a pointer to reference type.
12829 -- Attempting to create a reference to a reference type or
12830 a reference to void.
12832 Core issue 106 says that creating a reference to a reference
12833 during instantiation is no longer a cause for failure. We
12834 only enforce this check in strict C++98 mode. */
12835 if ((TREE_CODE (type
) == REFERENCE_TYPE
12836 && (((cxx_dialect
== cxx98
) && flag_iso
) || code
!= REFERENCE_TYPE
))
12837 || (code
== REFERENCE_TYPE
&& VOID_TYPE_P (type
)))
12839 static location_t last_loc
;
12841 /* We keep track of the last time we issued this error
12842 message to avoid spewing a ton of messages during a
12843 single bad template instantiation. */
12844 if (complain
& tf_error
12845 && last_loc
!= input_location
)
12847 if (VOID_TYPE_P (type
))
12848 error ("forming reference to void");
12849 else if (code
== POINTER_TYPE
)
12850 error ("forming pointer to reference type %qT", type
);
12852 error ("forming reference to reference type %qT", type
);
12853 last_loc
= input_location
;
12856 return error_mark_node
;
12858 else if (TREE_CODE (type
) == FUNCTION_TYPE
12859 && (type_memfn_quals (type
) != TYPE_UNQUALIFIED
12860 || type_memfn_rqual (type
) != REF_QUAL_NONE
))
12862 if (complain
& tf_error
)
12864 if (code
== POINTER_TYPE
)
12865 error ("forming pointer to qualified function type %qT",
12868 error ("forming reference to qualified function type %qT",
12871 return error_mark_node
;
12873 else if (code
== POINTER_TYPE
)
12875 r
= build_pointer_type (type
);
12876 if (TREE_CODE (type
) == METHOD_TYPE
)
12877 r
= build_ptrmemfunc_type (r
);
12879 else if (TREE_CODE (type
) == REFERENCE_TYPE
)
12880 /* In C++0x, during template argument substitution, when there is an
12881 attempt to create a reference to a reference type, reference
12882 collapsing is applied as described in [14.3.1/4 temp.arg.type]:
12884 "If a template-argument for a template-parameter T names a type
12885 that is a reference to a type A, an attempt to create the type
12886 'lvalue reference to cv T' creates the type 'lvalue reference to
12887 A,' while an attempt to create the type type rvalue reference to
12888 cv T' creates the type T"
12890 r
= cp_build_reference_type
12892 TYPE_REF_IS_RVALUE (t
) && TYPE_REF_IS_RVALUE (type
));
12894 r
= cp_build_reference_type (type
, TYPE_REF_IS_RVALUE (t
));
12895 r
= cp_build_qualified_type_real (r
, cp_type_quals (t
), complain
);
12897 if (r
!= error_mark_node
)
12898 /* Will this ever be needed for TYPE_..._TO values? */
12905 r
= tsubst (TYPE_OFFSET_BASETYPE (t
), args
, complain
, in_decl
);
12906 if (r
== error_mark_node
|| !MAYBE_CLASS_TYPE_P (r
))
12910 Type deduction may fail for any of the following
12913 -- Attempting to create "pointer to member of T" when T
12914 is not a class type. */
12915 if (complain
& tf_error
)
12916 error ("creating pointer to member of non-class type %qT", r
);
12917 return error_mark_node
;
12919 if (TREE_CODE (type
) == REFERENCE_TYPE
)
12921 if (complain
& tf_error
)
12922 error ("creating pointer to member reference type %qT", type
);
12923 return error_mark_node
;
12925 if (VOID_TYPE_P (type
))
12927 if (complain
& tf_error
)
12928 error ("creating pointer to member of type void");
12929 return error_mark_node
;
12931 gcc_assert (TREE_CODE (type
) != METHOD_TYPE
);
12932 if (TREE_CODE (type
) == FUNCTION_TYPE
)
12934 /* The type of the implicit object parameter gets its
12935 cv-qualifiers from the FUNCTION_TYPE. */
12938 = build_memfn_type (type
, r
, type_memfn_quals (type
),
12939 type_memfn_rqual (type
));
12940 memptr
= build_ptrmemfunc_type (build_pointer_type (method_type
));
12941 return cp_build_qualified_type_real (memptr
, cp_type_quals (t
),
12945 return cp_build_qualified_type_real (build_ptrmem_type (r
, type
),
12949 case FUNCTION_TYPE
:
12954 fntype
= tsubst_function_type (t
, args
, complain
, in_decl
);
12955 if (fntype
== error_mark_node
)
12956 return error_mark_node
;
12958 /* Substitute the exception specification. */
12959 specs
= tsubst_exception_specification (t
, args
, complain
,
12960 in_decl
, /*defer_ok*/true);
12961 if (specs
== error_mark_node
)
12962 return error_mark_node
;
12964 fntype
= build_exception_variant (fntype
, specs
);
12969 tree domain
= tsubst (TYPE_DOMAIN (t
), args
, complain
, in_decl
);
12970 if (domain
== error_mark_node
)
12971 return error_mark_node
;
12973 /* As an optimization, we avoid regenerating the array type if
12974 it will obviously be the same as T. */
12975 if (type
== TREE_TYPE (t
) && domain
== TYPE_DOMAIN (t
))
12978 /* These checks should match the ones in create_array_type_for_decl.
12982 The deduction may fail for any of the following reasons:
12984 -- Attempting to create an array with an element type that
12985 is void, a function type, or a reference type, or [DR337]
12986 an abstract class type. */
12987 if (VOID_TYPE_P (type
)
12988 || TREE_CODE (type
) == FUNCTION_TYPE
12989 || (TREE_CODE (type
) == ARRAY_TYPE
12990 && TYPE_DOMAIN (type
) == NULL_TREE
)
12991 || TREE_CODE (type
) == REFERENCE_TYPE
)
12993 if (complain
& tf_error
)
12994 error ("creating array of %qT", type
);
12995 return error_mark_node
;
12998 if (abstract_virtuals_error_sfinae (ACU_ARRAY
, type
, complain
))
12999 return error_mark_node
;
13001 r
= build_cplus_array_type (type
, domain
);
13003 if (TYPE_USER_ALIGN (t
))
13005 TYPE_ALIGN (r
) = TYPE_ALIGN (t
);
13006 TYPE_USER_ALIGN (r
) = 1;
13012 case TYPENAME_TYPE
:
13014 tree ctx
= tsubst_aggr_type (TYPE_CONTEXT (t
), args
, complain
,
13015 in_decl
, /*entering_scope=*/1);
13016 tree f
= tsubst_copy (TYPENAME_TYPE_FULLNAME (t
), args
,
13017 complain
, in_decl
);
13019 if (ctx
== error_mark_node
|| f
== error_mark_node
)
13020 return error_mark_node
;
13022 if (!MAYBE_CLASS_TYPE_P (ctx
))
13024 if (complain
& tf_error
)
13025 error ("%qT is not a class, struct, or union type", ctx
);
13026 return error_mark_node
;
13028 else if (!uses_template_parms (ctx
) && !TYPE_BEING_DEFINED (ctx
))
13030 /* Normally, make_typename_type does not require that the CTX
13031 have complete type in order to allow things like:
13033 template <class T> struct S { typename S<T>::X Y; };
13035 But, such constructs have already been resolved by this
13036 point, so here CTX really should have complete type, unless
13037 it's a partial instantiation. */
13038 ctx
= complete_type (ctx
);
13039 if (!COMPLETE_TYPE_P (ctx
))
13041 if (complain
& tf_error
)
13042 cxx_incomplete_type_error (NULL_TREE
, ctx
);
13043 return error_mark_node
;
13047 f
= make_typename_type (ctx
, f
, typename_type
,
13048 complain
| tf_keep_type_decl
);
13049 if (f
== error_mark_node
)
13051 if (TREE_CODE (f
) == TYPE_DECL
)
13053 complain
|= tf_ignore_bad_quals
;
13057 if (TREE_CODE (f
) != TYPENAME_TYPE
)
13059 if (TYPENAME_IS_ENUM_P (t
) && TREE_CODE (f
) != ENUMERAL_TYPE
)
13061 if (complain
& tf_error
)
13062 error ("%qT resolves to %qT, which is not an enumeration type",
13065 return error_mark_node
;
13067 else if (TYPENAME_IS_CLASS_P (t
) && !CLASS_TYPE_P (f
))
13069 if (complain
& tf_error
)
13070 error ("%qT resolves to %qT, which is is not a class type",
13073 return error_mark_node
;
13077 return cp_build_qualified_type_real
13078 (f
, cp_type_quals (f
) | cp_type_quals (t
), complain
);
13081 case UNBOUND_CLASS_TEMPLATE
:
13083 tree ctx
= tsubst_aggr_type (TYPE_CONTEXT (t
), args
, complain
,
13084 in_decl
, /*entering_scope=*/1);
13085 tree name
= TYPE_IDENTIFIER (t
);
13086 tree parm_list
= DECL_TEMPLATE_PARMS (TYPE_NAME (t
));
13088 if (ctx
== error_mark_node
|| name
== error_mark_node
)
13089 return error_mark_node
;
13092 parm_list
= tsubst_template_parms (parm_list
, args
, complain
);
13093 return make_unbound_class_template (ctx
, name
, parm_list
, complain
);
13100 ++cp_unevaluated_operand
;
13101 ++c_inhibit_evaluation_warnings
;
13103 type
= tsubst_expr (TYPEOF_TYPE_EXPR (t
), args
,
13105 /*integral_constant_expression_p=*/false);
13107 --cp_unevaluated_operand
;
13108 --c_inhibit_evaluation_warnings
;
13110 type
= finish_typeof (type
);
13111 return cp_build_qualified_type_real (type
,
13113 | cp_type_quals (type
),
13117 case DECLTYPE_TYPE
:
13121 ++cp_unevaluated_operand
;
13122 ++c_inhibit_evaluation_warnings
;
13124 type
= tsubst_copy_and_build (DECLTYPE_TYPE_EXPR (t
), args
,
13125 complain
|tf_decltype
, in_decl
,
13126 /*function_p*/false,
13127 /*integral_constant_expression*/false);
13129 --cp_unevaluated_operand
;
13130 --c_inhibit_evaluation_warnings
;
13132 if (DECLTYPE_FOR_LAMBDA_CAPTURE (t
))
13133 type
= lambda_capture_field_type (type
,
13134 DECLTYPE_FOR_INIT_CAPTURE (t
));
13135 else if (DECLTYPE_FOR_LAMBDA_PROXY (t
))
13136 type
= lambda_proxy_type (type
);
13139 bool id
= DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (t
);
13140 if (id
&& TREE_CODE (DECLTYPE_TYPE_EXPR (t
)) == BIT_NOT_EXPR
13142 /* In a template ~id could be either a complement expression
13143 or an unqualified-id naming a destructor; if instantiating
13144 it produces an expression, it's not an id-expression or
13147 type
= finish_decltype_type (type
, id
, complain
);
13149 return cp_build_qualified_type_real (type
,
13151 | cp_type_quals (type
),
13152 complain
| tf_ignore_bad_quals
);
13155 case UNDERLYING_TYPE
:
13157 tree type
= tsubst (UNDERLYING_TYPE_TYPE (t
), args
,
13158 complain
, in_decl
);
13159 return finish_underlying_type (type
);
13162 case TYPE_ARGUMENT_PACK
:
13163 case NONTYPE_ARGUMENT_PACK
:
13165 tree r
= TYPE_P (t
) ? cxx_make_type (code
) : make_node (code
);
13167 tsubst_template_args (ARGUMENT_PACK_ARGS (t
),
13171 SET_ARGUMENT_PACK_ARGS (r
, packed_out
);
13173 /* For template nontype argument packs, also substitute into
13175 if (code
== NONTYPE_ARGUMENT_PACK
)
13176 TREE_TYPE (r
) = tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
13195 /* We should use one of the expression tsubsts for these codes. */
13196 gcc_unreachable ();
13199 sorry ("use of %qs in template", get_tree_code_name (code
));
13200 return error_mark_node
;
13204 /* Like tsubst_expr for a BASELINK. OBJECT_TYPE, if non-NULL, is the
13205 type of the expression on the left-hand side of the "." or "->"
13209 tsubst_baselink (tree baselink
, tree object_type
,
13210 tree args
, tsubst_flags_t complain
, tree in_decl
)
13213 tree qualifying_scope
;
13216 tree template_args
= 0;
13217 bool template_id_p
= false;
13218 bool qualified
= BASELINK_QUALIFIED_P (baselink
);
13220 /* A baselink indicates a function from a base class. Both the
13221 BASELINK_ACCESS_BINFO and the base class referenced may
13222 indicate bases of the template class, rather than the
13223 instantiated class. In addition, lookups that were not
13224 ambiguous before may be ambiguous now. Therefore, we perform
13225 the lookup again. */
13226 qualifying_scope
= BINFO_TYPE (BASELINK_ACCESS_BINFO (baselink
));
13227 qualifying_scope
= tsubst (qualifying_scope
, args
,
13228 complain
, in_decl
);
13229 fns
= BASELINK_FUNCTIONS (baselink
);
13230 optype
= tsubst (BASELINK_OPTYPE (baselink
), args
, complain
, in_decl
);
13231 if (TREE_CODE (fns
) == TEMPLATE_ID_EXPR
)
13233 template_id_p
= true;
13234 template_args
= TREE_OPERAND (fns
, 1);
13235 fns
= TREE_OPERAND (fns
, 0);
13237 template_args
= tsubst_template_args (template_args
, args
,
13238 complain
, in_decl
);
13240 name
= DECL_NAME (get_first_fn (fns
));
13241 if (IDENTIFIER_TYPENAME_P (name
))
13242 name
= mangle_conv_op_name_for_type (optype
);
13243 baselink
= lookup_fnfields (qualifying_scope
, name
, /*protect=*/1);
13245 return error_mark_node
;
13247 /* If lookup found a single function, mark it as used at this
13248 point. (If it lookup found multiple functions the one selected
13249 later by overload resolution will be marked as used at that
13251 if (BASELINK_P (baselink
))
13252 fns
= BASELINK_FUNCTIONS (baselink
);
13253 if (!template_id_p
&& !really_overloaded_fn (fns
)
13254 && !mark_used (OVL_CURRENT (fns
), complain
) && !(complain
& tf_error
))
13255 return error_mark_node
;
13257 /* Add back the template arguments, if present. */
13258 if (BASELINK_P (baselink
) && template_id_p
)
13259 BASELINK_FUNCTIONS (baselink
)
13260 = build_nt (TEMPLATE_ID_EXPR
,
13261 BASELINK_FUNCTIONS (baselink
),
13263 /* Update the conversion operator type. */
13264 BASELINK_OPTYPE (baselink
) = optype
;
13267 object_type
= current_class_type
;
13270 baselink
= adjust_result_of_qualified_name_lookup (baselink
,
13276 /* Like tsubst_expr for a SCOPE_REF, given by QUALIFIED_ID. DONE is
13277 true if the qualified-id will be a postfix-expression in-and-of
13278 itself; false if more of the postfix-expression follows the
13279 QUALIFIED_ID. ADDRESS_P is true if the qualified-id is the operand
13283 tsubst_qualified_id (tree qualified_id
, tree args
,
13284 tsubst_flags_t complain
, tree in_decl
,
13285 bool done
, bool address_p
)
13291 tree template_args
;
13292 location_t loc
= UNKNOWN_LOCATION
;
13294 gcc_assert (TREE_CODE (qualified_id
) == SCOPE_REF
);
13296 /* Figure out what name to look up. */
13297 name
= TREE_OPERAND (qualified_id
, 1);
13298 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
13300 is_template
= true;
13301 loc
= EXPR_LOCATION (name
);
13302 template_args
= TREE_OPERAND (name
, 1);
13304 template_args
= tsubst_template_args (template_args
, args
,
13305 complain
, in_decl
);
13306 name
= TREE_OPERAND (name
, 0);
13310 is_template
= false;
13311 template_args
= NULL_TREE
;
13314 /* Substitute into the qualifying scope. When there are no ARGS, we
13315 are just trying to simplify a non-dependent expression. In that
13316 case the qualifying scope may be dependent, and, in any case,
13317 substituting will not help. */
13318 scope
= TREE_OPERAND (qualified_id
, 0);
13321 scope
= tsubst (scope
, args
, complain
, in_decl
);
13322 expr
= tsubst_copy (name
, args
, complain
, in_decl
);
13327 if (dependent_scope_p (scope
))
13330 expr
= build_min_nt_loc (loc
, TEMPLATE_ID_EXPR
, expr
, template_args
);
13331 return build_qualified_name (NULL_TREE
, scope
, expr
,
13332 QUALIFIED_NAME_IS_TEMPLATE (qualified_id
));
13335 if (!BASELINK_P (name
) && !DECL_P (expr
))
13337 if (TREE_CODE (expr
) == BIT_NOT_EXPR
)
13339 /* A BIT_NOT_EXPR is used to represent a destructor. */
13340 if (!check_dtor_name (scope
, TREE_OPERAND (expr
, 0)))
13342 error ("qualifying type %qT does not match destructor name ~%qT",
13343 scope
, TREE_OPERAND (expr
, 0));
13344 expr
= error_mark_node
;
13347 expr
= lookup_qualified_name (scope
, complete_dtor_identifier
,
13348 /*is_type_p=*/0, false);
13351 expr
= lookup_qualified_name (scope
, expr
, /*is_type_p=*/0, false);
13352 if (TREE_CODE (TREE_CODE (expr
) == TEMPLATE_DECL
13353 ? DECL_TEMPLATE_RESULT (expr
) : expr
) == TYPE_DECL
)
13355 if (complain
& tf_error
)
13357 error ("dependent-name %qE is parsed as a non-type, but "
13358 "instantiation yields a type", qualified_id
);
13359 inform (input_location
, "say %<typename %E%> if a type is meant", qualified_id
);
13361 return error_mark_node
;
13367 check_accessibility_of_qualified_id (expr
, /*object_type=*/NULL_TREE
,
13369 /* Remember that there was a reference to this entity. */
13370 if (!mark_used (expr
, complain
) && !(complain
& tf_error
))
13371 return error_mark_node
;
13374 if (expr
== error_mark_node
|| TREE_CODE (expr
) == TREE_LIST
)
13376 if (complain
& tf_error
)
13377 qualified_name_lookup_error (scope
,
13378 TREE_OPERAND (qualified_id
, 1),
13379 expr
, input_location
);
13380 return error_mark_node
;
13384 expr
= lookup_template_function (expr
, template_args
);
13386 if (expr
== error_mark_node
&& complain
& tf_error
)
13387 qualified_name_lookup_error (scope
, TREE_OPERAND (qualified_id
, 1),
13388 expr
, input_location
);
13389 else if (TYPE_P (scope
))
13391 expr
= (adjust_result_of_qualified_name_lookup
13392 (expr
, scope
, current_nonlambda_class_type ()));
13393 expr
= (finish_qualified_id_expr
13394 (scope
, expr
, done
, address_p
&& PTRMEM_OK_P (qualified_id
),
13395 QUALIFIED_NAME_IS_TEMPLATE (qualified_id
),
13396 /*template_arg_p=*/false, complain
));
13399 /* Expressions do not generally have reference type. */
13400 if (TREE_CODE (expr
) != SCOPE_REF
13401 /* However, if we're about to form a pointer-to-member, we just
13402 want the referenced member referenced. */
13403 && TREE_CODE (expr
) != OFFSET_REF
)
13404 expr
= convert_from_reference (expr
);
13409 /* tsubst the initializer for a VAR_DECL. INIT is the unsubstituted
13410 initializer, DECL is the substituted VAR_DECL. Other arguments are as
13414 tsubst_init (tree init
, tree decl
, tree args
,
13415 tsubst_flags_t complain
, tree in_decl
)
13420 init
= tsubst_expr (init
, args
, complain
, in_decl
, false);
13424 /* If we had an initializer but it
13425 instantiated to nothing,
13426 value-initialize the object. This will
13427 only occur when the initializer was a
13428 pack expansion where the parameter packs
13429 used in that expansion were of length
13431 init
= build_value_init (TREE_TYPE (decl
),
13433 if (TREE_CODE (init
) == AGGR_INIT_EXPR
)
13434 init
= get_target_expr_sfinae (init
, complain
);
13440 /* Like tsubst, but deals with expressions. This function just replaces
13441 template parms; to finish processing the resultant expression, use
13442 tsubst_copy_and_build or tsubst_expr. */
13445 tsubst_copy (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
13447 enum tree_code code
;
13450 if (t
== NULL_TREE
|| t
== error_mark_node
|| args
== NULL_TREE
)
13453 code
= TREE_CODE (t
);
13458 r
= retrieve_local_specialization (t
);
13460 if (r
== NULL_TREE
)
13462 /* We get here for a use of 'this' in an NSDMI. */
13463 if (DECL_NAME (t
) == this_identifier
13464 && current_function_decl
13465 && DECL_CONSTRUCTOR_P (current_function_decl
))
13466 return current_class_ptr
;
13468 /* This can happen for a parameter name used later in a function
13469 declaration (such as in a late-specified return type). Just
13470 make a dummy decl, since it's only used for its type. */
13471 gcc_assert (cp_unevaluated_operand
!= 0);
13472 r
= tsubst_decl (t
, args
, complain
);
13473 /* Give it the template pattern as its context; its true context
13474 hasn't been instantiated yet and this is good enough for
13476 DECL_CONTEXT (r
) = DECL_CONTEXT (t
);
13479 if (TREE_CODE (r
) == ARGUMENT_PACK_SELECT
)
13480 r
= ARGUMENT_PACK_SELECT_ARG (r
);
13481 if (!mark_used (r
, complain
) && !(complain
& tf_error
))
13482 return error_mark_node
;
13490 if (DECL_TEMPLATE_PARM_P (t
))
13491 return tsubst_copy (DECL_INITIAL (t
), args
, complain
, in_decl
);
13492 /* There is no need to substitute into namespace-scope
13494 if (DECL_NAMESPACE_SCOPE_P (t
))
13496 /* If ARGS is NULL, then T is known to be non-dependent. */
13497 if (args
== NULL_TREE
)
13498 return scalar_constant_value (t
);
13500 /* Unfortunately, we cannot just call lookup_name here.
13503 template <int I> int f() {
13505 struct S { void g() { E e = a; } };
13508 When we instantiate f<7>::S::g(), say, lookup_name is not
13509 clever enough to find f<7>::a. */
13511 = tsubst_aggr_type (DECL_CONTEXT (t
), args
, complain
, in_decl
,
13512 /*entering_scope=*/0);
13514 for (v
= TYPE_VALUES (enum_type
);
13516 v
= TREE_CHAIN (v
))
13517 if (TREE_PURPOSE (v
) == DECL_NAME (t
))
13518 return TREE_VALUE (v
);
13520 /* We didn't find the name. That should never happen; if
13521 name-lookup found it during preliminary parsing, we
13522 should find it again here during instantiation. */
13523 gcc_unreachable ();
13528 if (PACK_EXPANSION_P (TREE_TYPE (t
)))
13530 /* Check for a local specialization set up by
13531 tsubst_pack_expansion. */
13532 if (tree r
= retrieve_local_specialization (t
))
13534 if (TREE_CODE (r
) == ARGUMENT_PACK_SELECT
)
13535 r
= ARGUMENT_PACK_SELECT_ARG (r
);
13539 /* When retrieving a capture pack from a generic lambda, remove the
13540 lambda call op's own template argument list from ARGS. Only the
13541 template arguments active for the closure type should be used to
13542 retrieve the pack specialization. */
13543 if (LAMBDA_FUNCTION_P (current_function_decl
)
13544 && (template_class_depth (DECL_CONTEXT (t
))
13545 != TMPL_ARGS_DEPTH (args
)))
13546 args
= strip_innermost_template_args (args
, 1);
13548 /* Otherwise return the full NONTYPE_ARGUMENT_PACK that
13549 tsubst_decl put in the hash table. */
13550 return retrieve_specialization (t
, args
, 0);
13553 if (DECL_CONTEXT (t
))
13557 ctx
= tsubst_aggr_type (DECL_CONTEXT (t
), args
, complain
, in_decl
,
13558 /*entering_scope=*/1);
13559 if (ctx
!= DECL_CONTEXT (t
))
13561 tree r
= lookup_field (ctx
, DECL_NAME (t
), 0, false);
13564 if (complain
& tf_error
)
13565 error ("using invalid field %qD", t
);
13566 return error_mark_node
;
13575 case FUNCTION_DECL
:
13576 if (DECL_LANG_SPECIFIC (t
) && DECL_TEMPLATE_INFO (t
))
13577 r
= tsubst (t
, args
, complain
, in_decl
);
13578 else if (local_variable_p (t
))
13580 r
= retrieve_local_specialization (t
);
13581 if (r
== NULL_TREE
)
13583 /* First try name lookup to find the instantiation. */
13584 r
= lookup_name (DECL_NAME (t
));
13587 /* Make sure that the one we found is the one we want. */
13588 tree ctx
= tsubst (DECL_CONTEXT (t
), args
,
13589 complain
, in_decl
);
13590 if (ctx
!= DECL_CONTEXT (r
))
13598 /* This can happen for a variable used in a
13599 late-specified return type of a local lambda, or for a
13600 local static or constant. Building a new VAR_DECL
13601 should be OK in all those cases. */
13602 r
= tsubst_decl (t
, args
, complain
);
13603 if (decl_maybe_constant_var_p (r
))
13605 /* We can't call cp_finish_decl, so handle the
13606 initializer by hand. */
13607 tree init
= tsubst_init (DECL_INITIAL (t
), r
, args
,
13608 complain
, in_decl
);
13609 if (!processing_template_decl
)
13610 init
= maybe_constant_init (init
);
13611 if (processing_template_decl
13612 ? potential_constant_expression (init
)
13613 : reduced_constant_expression_p (init
))
13614 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (r
)
13615 = TREE_CONSTANT (r
) = true;
13616 DECL_INITIAL (r
) = init
;
13618 gcc_assert (cp_unevaluated_operand
|| TREE_STATIC (r
)
13619 || decl_constant_var_p (r
)
13620 || errorcount
|| sorrycount
);
13621 if (!processing_template_decl
)
13623 if (TREE_STATIC (r
))
13624 rest_of_decl_compilation (r
, toplevel_bindings_p (),
13627 r
= process_outer_var_ref (r
, complain
);
13630 /* Remember this for subsequent uses. */
13631 if (local_specializations
)
13632 register_local_specialization (r
, t
);
13637 if (!mark_used (r
, complain
) && !(complain
& tf_error
))
13638 return error_mark_node
;
13641 case NAMESPACE_DECL
:
13645 /* An OVERLOAD will always be a non-dependent overload set; an
13646 overload set from function scope will just be represented with an
13647 IDENTIFIER_NODE, and from class scope with a BASELINK. */
13648 gcc_assert (!uses_template_parms (t
));
13652 return tsubst_baselink (t
, current_nonlambda_class_type (),
13653 args
, complain
, in_decl
);
13655 case TEMPLATE_DECL
:
13656 if (DECL_TEMPLATE_TEMPLATE_PARM_P (t
))
13657 return tsubst (TREE_TYPE (DECL_TEMPLATE_RESULT (t
)),
13658 args
, complain
, in_decl
);
13659 else if (DECL_FUNCTION_TEMPLATE_P (t
) && DECL_MEMBER_TEMPLATE_P (t
))
13660 return tsubst (t
, args
, complain
, in_decl
);
13661 else if (DECL_CLASS_SCOPE_P (t
)
13662 && uses_template_parms (DECL_CONTEXT (t
)))
13664 /* Template template argument like the following example need
13667 template <template <class> class TT> struct C {};
13668 template <class T> struct D {
13669 template <class U> struct E {};
13674 We are processing the template argument `E' in #1 for
13675 the template instantiation #2. Originally, `E' is a
13676 TEMPLATE_DECL with `D<T>' as its DECL_CONTEXT. Now we
13677 have to substitute this with one having context `D<int>'. */
13679 tree context
= tsubst (DECL_CONTEXT (t
), args
, complain
, in_decl
);
13680 return lookup_field (context
, DECL_NAME(t
), 0, false);
13683 /* Ordinary template template argument. */
13687 case REINTERPRET_CAST_EXPR
:
13688 case CONST_CAST_EXPR
:
13689 case STATIC_CAST_EXPR
:
13690 case DYNAMIC_CAST_EXPR
:
13691 case IMPLICIT_CONV_EXPR
:
13695 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
13696 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
13697 return build1 (code
, type
, op0
);
13701 if (PACK_EXPANSION_P (TREE_OPERAND (t
, 0)))
13704 tree expanded
, op
= TREE_OPERAND (t
, 0);
13707 if (SIZEOF_EXPR_TYPE_P (t
))
13708 op
= TREE_TYPE (op
);
13710 ++cp_unevaluated_operand
;
13711 ++c_inhibit_evaluation_warnings
;
13712 /* We only want to compute the number of arguments. */
13713 expanded
= tsubst_pack_expansion (op
, args
, complain
, in_decl
);
13714 --cp_unevaluated_operand
;
13715 --c_inhibit_evaluation_warnings
;
13717 if (TREE_CODE (expanded
) == TREE_VEC
)
13718 len
= TREE_VEC_LENGTH (expanded
);
13720 if (expanded
== error_mark_node
)
13721 return error_mark_node
;
13722 else if (PACK_EXPANSION_P (expanded
)
13723 || (TREE_CODE (expanded
) == TREE_VEC
13725 && PACK_EXPANSION_P (TREE_VEC_ELT (expanded
, len
-1))))
13727 if (TREE_CODE (expanded
) == TREE_VEC
)
13728 expanded
= TREE_VEC_ELT (expanded
, len
- 1);
13730 if (TYPE_P (expanded
))
13731 return cxx_sizeof_or_alignof_type (expanded
, SIZEOF_EXPR
,
13732 complain
& tf_error
);
13734 return cxx_sizeof_or_alignof_expr (expanded
, SIZEOF_EXPR
,
13735 complain
& tf_error
);
13738 return build_int_cst (size_type_node
, len
);
13740 if (SIZEOF_EXPR_TYPE_P (t
))
13742 r
= tsubst (TREE_TYPE (TREE_OPERAND (t
, 0)),
13743 args
, complain
, in_decl
);
13744 r
= build1 (NOP_EXPR
, r
, error_mark_node
);
13745 r
= build1 (SIZEOF_EXPR
,
13746 tsubst (TREE_TYPE (t
), args
, complain
, in_decl
), r
);
13747 SIZEOF_EXPR_TYPE_P (r
) = 1;
13754 case TRUTH_NOT_EXPR
:
13757 case UNARY_PLUS_EXPR
: /* Unary + */
13759 case AT_ENCODE_EXPR
:
13763 case REALPART_EXPR
:
13764 case IMAGPART_EXPR
:
13767 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
13768 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
13769 return build1 (code
, type
, op0
);
13772 case COMPONENT_REF
:
13777 object
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
13778 name
= TREE_OPERAND (t
, 1);
13779 if (TREE_CODE (name
) == BIT_NOT_EXPR
)
13781 name
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
13782 complain
, in_decl
);
13783 name
= build1 (BIT_NOT_EXPR
, NULL_TREE
, name
);
13785 else if (TREE_CODE (name
) == SCOPE_REF
13786 && TREE_CODE (TREE_OPERAND (name
, 1)) == BIT_NOT_EXPR
)
13788 tree base
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
13789 complain
, in_decl
);
13790 name
= TREE_OPERAND (name
, 1);
13791 name
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
13792 complain
, in_decl
);
13793 name
= build1 (BIT_NOT_EXPR
, NULL_TREE
, name
);
13794 name
= build_qualified_name (/*type=*/NULL_TREE
,
13796 /*template_p=*/false);
13798 else if (BASELINK_P (name
))
13799 name
= tsubst_baselink (name
,
13800 non_reference (TREE_TYPE (object
)),
13804 name
= tsubst_copy (name
, args
, complain
, in_decl
);
13805 return build_nt (COMPONENT_REF
, object
, name
, NULL_TREE
);
13811 case TRUNC_DIV_EXPR
:
13812 case CEIL_DIV_EXPR
:
13813 case FLOOR_DIV_EXPR
:
13814 case ROUND_DIV_EXPR
:
13815 case EXACT_DIV_EXPR
:
13819 case TRUNC_MOD_EXPR
:
13820 case FLOOR_MOD_EXPR
:
13821 case TRUTH_ANDIF_EXPR
:
13822 case TRUTH_ORIF_EXPR
:
13823 case TRUTH_AND_EXPR
:
13824 case TRUTH_OR_EXPR
:
13837 case COMPOUND_EXPR
:
13840 case PREDECREMENT_EXPR
:
13841 case PREINCREMENT_EXPR
:
13842 case POSTDECREMENT_EXPR
:
13843 case POSTINCREMENT_EXPR
:
13845 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
13846 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
13847 return build_nt (code
, op0
, op1
);
13852 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
13853 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
13854 return build_qualified_name (/*type=*/NULL_TREE
, op0
, op1
,
13855 QUALIFIED_NAME_IS_TEMPLATE (t
));
13860 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
13861 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
13862 return build_nt (ARRAY_REF
, op0
, op1
, NULL_TREE
, NULL_TREE
);
13867 int n
= VL_EXP_OPERAND_LENGTH (t
);
13868 tree result
= build_vl_exp (CALL_EXPR
, n
);
13870 for (i
= 0; i
< n
; i
++)
13871 TREE_OPERAND (t
, i
) = tsubst_copy (TREE_OPERAND (t
, i
), args
,
13872 complain
, in_decl
);
13878 case PSEUDO_DTOR_EXPR
:
13879 case VEC_PERM_EXPR
:
13881 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
13882 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
13883 tree op2
= tsubst_copy (TREE_OPERAND (t
, 2), args
, complain
, in_decl
);
13884 r
= build_nt (code
, op0
, op1
, op2
);
13885 TREE_NO_WARNING (r
) = TREE_NO_WARNING (t
);
13891 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
13892 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
13893 tree op2
= tsubst_copy (TREE_OPERAND (t
, 2), args
, complain
, in_decl
);
13894 r
= build_nt (code
, op0
, op1
, op2
);
13895 NEW_EXPR_USE_GLOBAL (r
) = NEW_EXPR_USE_GLOBAL (t
);
13901 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
13902 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
13903 r
= build_nt (code
, op0
, op1
);
13904 DELETE_EXPR_USE_GLOBAL (r
) = DELETE_EXPR_USE_GLOBAL (t
);
13905 DELETE_EXPR_USE_VEC (r
) = DELETE_EXPR_USE_VEC (t
);
13909 case TEMPLATE_ID_EXPR
:
13911 /* Substituted template arguments */
13912 tree fn
= TREE_OPERAND (t
, 0);
13913 tree targs
= TREE_OPERAND (t
, 1);
13915 fn
= tsubst_copy (fn
, args
, complain
, in_decl
);
13917 targs
= tsubst_template_args (targs
, args
, complain
, in_decl
);
13919 return lookup_template_function (fn
, targs
);
13924 tree purpose
, value
, chain
;
13926 if (t
== void_list_node
)
13929 purpose
= TREE_PURPOSE (t
);
13931 purpose
= tsubst_copy (purpose
, args
, complain
, in_decl
);
13932 value
= TREE_VALUE (t
);
13934 value
= tsubst_copy (value
, args
, complain
, in_decl
);
13935 chain
= TREE_CHAIN (t
);
13936 if (chain
&& chain
!= void_type_node
)
13937 chain
= tsubst_copy (chain
, args
, complain
, in_decl
);
13938 if (purpose
== TREE_PURPOSE (t
)
13939 && value
== TREE_VALUE (t
)
13940 && chain
== TREE_CHAIN (t
))
13942 return tree_cons (purpose
, value
, chain
);
13947 case ENUMERAL_TYPE
:
13949 case TEMPLATE_TYPE_PARM
:
13950 case TEMPLATE_TEMPLATE_PARM
:
13951 case BOUND_TEMPLATE_TEMPLATE_PARM
:
13952 case TEMPLATE_PARM_INDEX
:
13954 case REFERENCE_TYPE
:
13956 case FUNCTION_TYPE
:
13959 case TYPENAME_TYPE
:
13960 case UNBOUND_CLASS_TEMPLATE
:
13962 case DECLTYPE_TYPE
:
13964 return tsubst (t
, args
, complain
, in_decl
);
13968 /* Fall through. */
13969 case IDENTIFIER_NODE
:
13970 if (IDENTIFIER_TYPENAME_P (t
))
13972 tree new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
13973 return mangle_conv_op_name_for_type (new_type
);
13979 /* This is handled by tsubst_copy_and_build. */
13980 gcc_unreachable ();
13984 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
13985 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
13986 return build_x_va_arg (EXPR_LOCATION (t
), op0
, type
);
13989 case CLEANUP_POINT_EXPR
:
13990 /* We shouldn't have built any of these during initial template
13991 generation. Instead, they should be built during instantiation
13992 in response to the saved STMT_IS_FULL_EXPR_P setting. */
13993 gcc_unreachable ();
13997 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
13998 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
13999 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
14000 r
= build2 (code
, type
, op0
, op1
);
14001 PTRMEM_OK_P (r
) = PTRMEM_OK_P (t
);
14002 if (!mark_used (TREE_OPERAND (r
, 1), complain
)
14003 && !(complain
& tf_error
))
14004 return error_mark_node
;
14008 case EXPR_PACK_EXPANSION
:
14009 error ("invalid use of pack expansion expression");
14010 return error_mark_node
;
14012 case NONTYPE_ARGUMENT_PACK
:
14013 error ("use %<...%> to expand argument pack");
14014 return error_mark_node
;
14017 gcc_checking_assert (t
== void_node
&& VOID_TYPE_P (TREE_TYPE (t
)));
14025 /* Instantiate any typedefs in the type. */
14026 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
14027 r
= fold_convert (type
, t
);
14028 gcc_assert (TREE_CODE (r
) == code
);
14033 /* These can sometimes show up in a partial instantiation, but never
14034 involve template parms. */
14035 gcc_assert (!uses_template_parms (t
));
14039 /* We shouldn't get here, but keep going if !ENABLE_CHECKING. */
14040 gcc_checking_assert (false);
14045 /* Helper function for tsubst_omp_clauses, used for instantiation of
14046 OMP_CLAUSE_DECL of clauses that handles also OpenMP array sections
14047 represented with TREE_LIST. */
14050 tsubst_omp_clause_decl (tree decl
, tree args
, tsubst_flags_t complain
,
14053 if (TREE_CODE (decl
) == TREE_LIST
)
14056 = tsubst_expr (TREE_PURPOSE (decl
), args
, complain
, in_decl
,
14057 /*integral_constant_expression_p=*/false);
14058 tree length
= tsubst_expr (TREE_VALUE (decl
), args
, complain
, in_decl
,
14059 /*integral_constant_expression_p=*/false);
14060 tree chain
= tsubst_omp_clause_decl (TREE_CHAIN (decl
), args
, complain
,
14062 if (TREE_PURPOSE (decl
) == low_bound
14063 && TREE_VALUE (decl
) == length
14064 && TREE_CHAIN (decl
) == chain
)
14066 return tree_cons (low_bound
, length
, chain
);
14068 return tsubst_copy (decl
, args
, complain
, in_decl
);
14071 /* Like tsubst_copy, but specifically for OpenMP clauses. */
14074 tsubst_omp_clauses (tree clauses
, bool declare_simd
,
14075 tree args
, tsubst_flags_t complain
, tree in_decl
)
14077 tree new_clauses
= NULL
, nc
, oc
;
14079 for (oc
= clauses
; oc
; oc
= OMP_CLAUSE_CHAIN (oc
))
14081 nc
= copy_node (oc
);
14082 OMP_CLAUSE_CHAIN (nc
) = new_clauses
;
14085 switch (OMP_CLAUSE_CODE (nc
))
14087 case OMP_CLAUSE_LASTPRIVATE
:
14088 if (OMP_CLAUSE_LASTPRIVATE_STMT (oc
))
14090 OMP_CLAUSE_LASTPRIVATE_STMT (nc
) = push_stmt_list ();
14091 tsubst_expr (OMP_CLAUSE_LASTPRIVATE_STMT (oc
), args
, complain
,
14092 in_decl
, /*integral_constant_expression_p=*/false);
14093 OMP_CLAUSE_LASTPRIVATE_STMT (nc
)
14094 = pop_stmt_list (OMP_CLAUSE_LASTPRIVATE_STMT (nc
));
14097 case OMP_CLAUSE_PRIVATE
:
14098 case OMP_CLAUSE_SHARED
:
14099 case OMP_CLAUSE_FIRSTPRIVATE
:
14100 case OMP_CLAUSE_COPYIN
:
14101 case OMP_CLAUSE_COPYPRIVATE
:
14102 case OMP_CLAUSE_UNIFORM
:
14103 OMP_CLAUSE_DECL (nc
) = tsubst_copy (OMP_CLAUSE_DECL (oc
), args
,
14104 complain
, in_decl
);
14106 case OMP_CLAUSE_DEPEND
:
14107 case OMP_CLAUSE_FROM
:
14108 case OMP_CLAUSE_TO
:
14109 case OMP_CLAUSE_MAP
:
14110 OMP_CLAUSE_DECL (nc
)
14111 = tsubst_omp_clause_decl (OMP_CLAUSE_DECL (oc
), args
, complain
,
14114 case OMP_CLAUSE_IF
:
14115 case OMP_CLAUSE_NUM_THREADS
:
14116 case OMP_CLAUSE_SCHEDULE
:
14117 case OMP_CLAUSE_COLLAPSE
:
14118 case OMP_CLAUSE_FINAL
:
14119 case OMP_CLAUSE_DEVICE
:
14120 case OMP_CLAUSE_DIST_SCHEDULE
:
14121 case OMP_CLAUSE_NUM_TEAMS
:
14122 case OMP_CLAUSE_THREAD_LIMIT
:
14123 case OMP_CLAUSE_SAFELEN
:
14124 case OMP_CLAUSE_SIMDLEN
:
14125 OMP_CLAUSE_OPERAND (nc
, 0)
14126 = tsubst_expr (OMP_CLAUSE_OPERAND (oc
, 0), args
, complain
,
14127 in_decl
, /*integral_constant_expression_p=*/false);
14129 case OMP_CLAUSE_REDUCTION
:
14130 if (OMP_CLAUSE_REDUCTION_PLACEHOLDER (oc
))
14132 tree placeholder
= OMP_CLAUSE_REDUCTION_PLACEHOLDER (oc
);
14133 if (TREE_CODE (placeholder
) == SCOPE_REF
)
14135 tree scope
= tsubst (TREE_OPERAND (placeholder
, 0), args
,
14136 complain
, in_decl
);
14137 OMP_CLAUSE_REDUCTION_PLACEHOLDER (nc
)
14138 = build_qualified_name (NULL_TREE
, scope
,
14139 TREE_OPERAND (placeholder
, 1),
14143 gcc_assert (identifier_p (placeholder
));
14145 OMP_CLAUSE_DECL (nc
) = tsubst_copy (OMP_CLAUSE_DECL (oc
), args
,
14146 complain
, in_decl
);
14148 case OMP_CLAUSE_LINEAR
:
14149 case OMP_CLAUSE_ALIGNED
:
14150 OMP_CLAUSE_DECL (nc
) = tsubst_copy (OMP_CLAUSE_DECL (oc
), args
,
14151 complain
, in_decl
);
14152 OMP_CLAUSE_OPERAND (nc
, 1)
14153 = tsubst_expr (OMP_CLAUSE_OPERAND (oc
, 1), args
, complain
,
14154 in_decl
, /*integral_constant_expression_p=*/false);
14156 case OMP_CLAUSE_NOWAIT
:
14157 case OMP_CLAUSE_ORDERED
:
14158 case OMP_CLAUSE_DEFAULT
:
14159 case OMP_CLAUSE_UNTIED
:
14160 case OMP_CLAUSE_MERGEABLE
:
14161 case OMP_CLAUSE_INBRANCH
:
14162 case OMP_CLAUSE_NOTINBRANCH
:
14163 case OMP_CLAUSE_PROC_BIND
:
14164 case OMP_CLAUSE_FOR
:
14165 case OMP_CLAUSE_PARALLEL
:
14166 case OMP_CLAUSE_SECTIONS
:
14167 case OMP_CLAUSE_TASKGROUP
:
14170 gcc_unreachable ();
14174 new_clauses
= nreverse (new_clauses
);
14176 new_clauses
= finish_omp_clauses (new_clauses
);
14177 return new_clauses
;
14180 /* Like tsubst_copy_and_build, but unshare TREE_LIST nodes. */
14183 tsubst_copy_asm_operands (tree t
, tree args
, tsubst_flags_t complain
,
14186 #define RECUR(t) tsubst_copy_asm_operands (t, args, complain, in_decl)
14188 tree purpose
, value
, chain
;
14193 if (TREE_CODE (t
) != TREE_LIST
)
14194 return tsubst_copy_and_build (t
, args
, complain
, in_decl
,
14195 /*function_p=*/false,
14196 /*integral_constant_expression_p=*/false);
14198 if (t
== void_list_node
)
14201 purpose
= TREE_PURPOSE (t
);
14203 purpose
= RECUR (purpose
);
14204 value
= TREE_VALUE (t
);
14207 if (TREE_CODE (value
) != LABEL_DECL
)
14208 value
= RECUR (value
);
14211 value
= lookup_label (DECL_NAME (value
));
14212 gcc_assert (TREE_CODE (value
) == LABEL_DECL
);
14213 TREE_USED (value
) = 1;
14216 chain
= TREE_CHAIN (t
);
14217 if (chain
&& chain
!= void_type_node
)
14218 chain
= RECUR (chain
);
14219 return tree_cons (purpose
, value
, chain
);
14223 /* Substitute one OMP_FOR iterator. */
14226 tsubst_omp_for_iterator (tree t
, int i
, tree declv
, tree initv
,
14227 tree condv
, tree incrv
, tree
*clauses
,
14228 tree args
, tsubst_flags_t complain
, tree in_decl
,
14229 bool integral_constant_expression_p
)
14231 #define RECUR(NODE) \
14232 tsubst_expr ((NODE), args, complain, in_decl, \
14233 integral_constant_expression_p)
14234 tree decl
, init
, cond
, incr
;
14236 init
= TREE_VEC_ELT (OMP_FOR_INIT (t
), i
);
14237 gcc_assert (TREE_CODE (init
) == MODIFY_EXPR
);
14238 decl
= TREE_OPERAND (init
, 0);
14239 init
= TREE_OPERAND (init
, 1);
14240 tree decl_expr
= NULL_TREE
;
14241 if (init
&& TREE_CODE (init
) == DECL_EXPR
)
14243 /* We need to jump through some hoops to handle declarations in the
14244 for-init-statement, since we might need to handle auto deduction,
14245 but we need to keep control of initialization. */
14247 init
= DECL_INITIAL (DECL_EXPR_DECL (init
));
14248 decl
= tsubst_decl (decl
, args
, complain
);
14251 decl
= RECUR (decl
);
14252 init
= RECUR (init
);
14254 tree auto_node
= type_uses_auto (TREE_TYPE (decl
));
14255 if (auto_node
&& init
)
14257 = do_auto_deduction (TREE_TYPE (decl
), init
, auto_node
);
14259 gcc_assert (!type_dependent_expression_p (decl
));
14261 if (!CLASS_TYPE_P (TREE_TYPE (decl
)))
14265 /* Declare the variable, but don't let that initialize it. */
14266 tree init_sav
= DECL_INITIAL (DECL_EXPR_DECL (decl_expr
));
14267 DECL_INITIAL (DECL_EXPR_DECL (decl_expr
)) = NULL_TREE
;
14269 DECL_INITIAL (DECL_EXPR_DECL (decl_expr
)) = init_sav
;
14272 cond
= RECUR (TREE_VEC_ELT (OMP_FOR_COND (t
), i
));
14273 incr
= TREE_VEC_ELT (OMP_FOR_INCR (t
), i
);
14274 if (TREE_CODE (incr
) == MODIFY_EXPR
)
14276 tree lhs
= RECUR (TREE_OPERAND (incr
, 0));
14277 tree rhs
= RECUR (TREE_OPERAND (incr
, 1));
14278 incr
= build_x_modify_expr (EXPR_LOCATION (incr
), lhs
,
14279 NOP_EXPR
, rhs
, complain
);
14282 incr
= RECUR (incr
);
14283 TREE_VEC_ELT (declv
, i
) = decl
;
14284 TREE_VEC_ELT (initv
, i
) = init
;
14285 TREE_VEC_ELT (condv
, i
) = cond
;
14286 TREE_VEC_ELT (incrv
, i
) = incr
;
14292 /* Declare and initialize the variable. */
14299 for (c
= *clauses
; c
; c
= OMP_CLAUSE_CHAIN (c
))
14301 if ((OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_PRIVATE
14302 || OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_LASTPRIVATE
)
14303 && OMP_CLAUSE_DECL (c
) == decl
)
14305 else if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_FIRSTPRIVATE
14306 && OMP_CLAUSE_DECL (c
) == decl
)
14307 error ("iteration variable %qD should not be firstprivate", decl
);
14308 else if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_REDUCTION
14309 && OMP_CLAUSE_DECL (c
) == decl
)
14310 error ("iteration variable %qD should not be reduction", decl
);
14314 c
= build_omp_clause (input_location
, OMP_CLAUSE_PRIVATE
);
14315 OMP_CLAUSE_DECL (c
) = decl
;
14316 c
= finish_omp_clauses (c
);
14319 OMP_CLAUSE_CHAIN (c
) = *clauses
;
14324 cond
= TREE_VEC_ELT (OMP_FOR_COND (t
), i
);
14325 if (COMPARISON_CLASS_P (cond
))
14327 tree op0
= RECUR (TREE_OPERAND (cond
, 0));
14328 tree op1
= RECUR (TREE_OPERAND (cond
, 1));
14329 cond
= build2 (TREE_CODE (cond
), boolean_type_node
, op0
, op1
);
14332 cond
= RECUR (cond
);
14333 incr
= TREE_VEC_ELT (OMP_FOR_INCR (t
), i
);
14334 switch (TREE_CODE (incr
))
14336 case PREINCREMENT_EXPR
:
14337 case PREDECREMENT_EXPR
:
14338 case POSTINCREMENT_EXPR
:
14339 case POSTDECREMENT_EXPR
:
14340 incr
= build2 (TREE_CODE (incr
), TREE_TYPE (decl
),
14341 RECUR (TREE_OPERAND (incr
, 0)), NULL_TREE
);
14344 if (TREE_CODE (TREE_OPERAND (incr
, 1)) == PLUS_EXPR
14345 || TREE_CODE (TREE_OPERAND (incr
, 1)) == MINUS_EXPR
)
14347 tree rhs
= TREE_OPERAND (incr
, 1);
14348 tree lhs
= RECUR (TREE_OPERAND (incr
, 0));
14349 tree rhs0
= RECUR (TREE_OPERAND (rhs
, 0));
14350 tree rhs1
= RECUR (TREE_OPERAND (rhs
, 1));
14351 incr
= build2 (MODIFY_EXPR
, TREE_TYPE (decl
), lhs
,
14352 build2 (TREE_CODE (rhs
), TREE_TYPE (decl
),
14356 incr
= RECUR (incr
);
14359 if (TREE_CODE (TREE_OPERAND (incr
, 1)) == PLUS_EXPR
14360 || TREE_CODE (TREE_OPERAND (incr
, 1)) == MINUS_EXPR
)
14362 tree lhs
= RECUR (TREE_OPERAND (incr
, 0));
14363 incr
= build2 (MODIFY_EXPR
, TREE_TYPE (decl
), lhs
,
14364 build2 (TREE_CODE (TREE_OPERAND (incr
, 1)),
14365 TREE_TYPE (decl
), lhs
,
14366 RECUR (TREE_OPERAND (incr
, 2))));
14368 else if (TREE_CODE (TREE_OPERAND (incr
, 1)) == NOP_EXPR
14369 && (TREE_CODE (TREE_OPERAND (incr
, 2)) == PLUS_EXPR
14370 || (TREE_CODE (TREE_OPERAND (incr
, 2)) == MINUS_EXPR
)))
14372 tree rhs
= TREE_OPERAND (incr
, 2);
14373 tree lhs
= RECUR (TREE_OPERAND (incr
, 0));
14374 tree rhs0
= RECUR (TREE_OPERAND (rhs
, 0));
14375 tree rhs1
= RECUR (TREE_OPERAND (rhs
, 1));
14376 incr
= build2 (MODIFY_EXPR
, TREE_TYPE (decl
), lhs
,
14377 build2 (TREE_CODE (rhs
), TREE_TYPE (decl
),
14381 incr
= RECUR (incr
);
14384 incr
= RECUR (incr
);
14388 TREE_VEC_ELT (declv
, i
) = decl
;
14389 TREE_VEC_ELT (initv
, i
) = init
;
14390 TREE_VEC_ELT (condv
, i
) = cond
;
14391 TREE_VEC_ELT (incrv
, i
) = incr
;
14395 /* Like tsubst_copy for expressions, etc. but also does semantic
14399 tsubst_expr (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
,
14400 bool integral_constant_expression_p
)
14402 #define RETURN(EXP) do { r = (EXP); goto out; } while(0)
14403 #define RECUR(NODE) \
14404 tsubst_expr ((NODE), args, complain, in_decl, \
14405 integral_constant_expression_p)
14411 if (t
== NULL_TREE
|| t
== error_mark_node
)
14414 loc
= input_location
;
14415 if (EXPR_HAS_LOCATION (t
))
14416 input_location
= EXPR_LOCATION (t
);
14417 if (STATEMENT_CODE_P (TREE_CODE (t
)))
14418 current_stmt_tree ()->stmts_are_full_exprs_p
= STMT_IS_FULL_EXPR_P (t
);
14420 switch (TREE_CODE (t
))
14422 case STATEMENT_LIST
:
14424 tree_stmt_iterator i
;
14425 for (i
= tsi_start (t
); !tsi_end_p (i
); tsi_next (&i
))
14426 RECUR (tsi_stmt (i
));
14430 case CTOR_INITIALIZER
:
14431 finish_mem_initializers (tsubst_initializer_list
14432 (TREE_OPERAND (t
, 0), args
));
14436 finish_return_stmt (RECUR (TREE_OPERAND (t
, 0)));
14440 tmp
= RECUR (EXPR_STMT_EXPR (t
));
14441 if (EXPR_STMT_STMT_EXPR_RESULT (t
))
14442 finish_stmt_expr_expr (tmp
, cur_stmt_expr
);
14444 finish_expr_stmt (tmp
);
14448 do_using_directive (USING_STMT_NAMESPACE (t
));
14453 tree decl
, pattern_decl
;
14456 pattern_decl
= decl
= DECL_EXPR_DECL (t
);
14457 if (TREE_CODE (decl
) == LABEL_DECL
)
14458 finish_label_decl (DECL_NAME (decl
));
14459 else if (TREE_CODE (decl
) == USING_DECL
)
14461 tree scope
= USING_DECL_SCOPE (decl
);
14462 tree name
= DECL_NAME (decl
);
14465 scope
= tsubst (scope
, args
, complain
, in_decl
);
14466 decl
= lookup_qualified_name (scope
, name
,
14467 /*is_type_p=*/false,
14468 /*complain=*/false);
14469 if (decl
== error_mark_node
|| TREE_CODE (decl
) == TREE_LIST
)
14470 qualified_name_lookup_error (scope
, name
, decl
, input_location
);
14472 do_local_using_decl (decl
, scope
, name
);
14474 else if (DECL_PACK_P (decl
))
14476 /* Don't build up decls for a variadic capture proxy, we'll
14477 instantiate the elements directly as needed. */
14482 init
= DECL_INITIAL (decl
);
14483 decl
= tsubst (decl
, args
, complain
, in_decl
);
14484 if (decl
!= error_mark_node
)
14486 /* By marking the declaration as instantiated, we avoid
14487 trying to instantiate it. Since instantiate_decl can't
14488 handle local variables, and since we've already done
14489 all that needs to be done, that's the right thing to
14492 DECL_TEMPLATE_INSTANTIATED (decl
) = 1;
14494 && ANON_AGGR_TYPE_P (TREE_TYPE (decl
)))
14495 /* Anonymous aggregates are a special case. */
14496 finish_anon_union (decl
);
14497 else if (is_capture_proxy (DECL_EXPR_DECL (t
)))
14499 DECL_CONTEXT (decl
) = current_function_decl
;
14500 if (DECL_NAME (decl
) == this_identifier
)
14502 tree lam
= DECL_CONTEXT (current_function_decl
);
14503 lam
= CLASSTYPE_LAMBDA_EXPR (lam
);
14504 LAMBDA_EXPR_THIS_CAPTURE (lam
) = decl
;
14506 insert_capture_proxy (decl
);
14508 else if (DECL_IMPLICIT_TYPEDEF_P (t
))
14509 /* We already did a pushtag. */;
14510 else if (TREE_CODE (decl
) == FUNCTION_DECL
14511 && DECL_OMP_DECLARE_REDUCTION_P (decl
)
14512 && DECL_FUNCTION_SCOPE_P (pattern_decl
))
14514 DECL_CONTEXT (decl
) = NULL_TREE
;
14516 DECL_CONTEXT (decl
) = current_function_decl
;
14517 cp_check_omp_declare_reduction (decl
);
14521 int const_init
= false;
14522 maybe_push_decl (decl
);
14524 && DECL_PRETTY_FUNCTION_P (decl
))
14526 /* For __PRETTY_FUNCTION__ we have to adjust the
14528 const char *const name
14529 = cxx_printable_name (current_function_decl
, 2);
14530 init
= cp_fname_init (name
, &TREE_TYPE (decl
));
14533 init
= tsubst_init (init
, decl
, args
, complain
, in_decl
);
14536 const_init
= (DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P
14538 cp_finish_decl (decl
, init
, const_init
, NULL_TREE
, 0);
14547 stmt
= begin_for_stmt (NULL_TREE
, NULL_TREE
);
14548 RECUR (FOR_INIT_STMT (t
));
14549 finish_for_init_stmt (stmt
);
14550 tmp
= RECUR (FOR_COND (t
));
14551 finish_for_cond (tmp
, stmt
, false);
14552 tmp
= RECUR (FOR_EXPR (t
));
14553 finish_for_expr (tmp
, stmt
);
14554 RECUR (FOR_BODY (t
));
14555 finish_for_stmt (stmt
);
14558 case RANGE_FOR_STMT
:
14561 stmt
= begin_for_stmt (NULL_TREE
, NULL_TREE
);
14562 decl
= RANGE_FOR_DECL (t
);
14563 decl
= tsubst (decl
, args
, complain
, in_decl
);
14564 maybe_push_decl (decl
);
14565 expr
= RECUR (RANGE_FOR_EXPR (t
));
14566 stmt
= cp_convert_range_for (stmt
, decl
, expr
, RANGE_FOR_IVDEP (t
));
14567 RECUR (RANGE_FOR_BODY (t
));
14568 finish_for_stmt (stmt
);
14573 stmt
= begin_while_stmt ();
14574 tmp
= RECUR (WHILE_COND (t
));
14575 finish_while_stmt_cond (tmp
, stmt
, false);
14576 RECUR (WHILE_BODY (t
));
14577 finish_while_stmt (stmt
);
14581 stmt
= begin_do_stmt ();
14582 RECUR (DO_BODY (t
));
14583 finish_do_body (stmt
);
14584 tmp
= RECUR (DO_COND (t
));
14585 finish_do_stmt (tmp
, stmt
, false);
14589 stmt
= begin_if_stmt ();
14590 tmp
= RECUR (IF_COND (t
));
14591 finish_if_stmt_cond (tmp
, stmt
);
14592 RECUR (THEN_CLAUSE (t
));
14593 finish_then_clause (stmt
);
14595 if (ELSE_CLAUSE (t
))
14597 begin_else_clause (stmt
);
14598 RECUR (ELSE_CLAUSE (t
));
14599 finish_else_clause (stmt
);
14602 finish_if_stmt (stmt
);
14606 if (BIND_EXPR_BODY_BLOCK (t
))
14607 stmt
= begin_function_body ();
14609 stmt
= begin_compound_stmt (BIND_EXPR_TRY_BLOCK (t
)
14610 ? BCS_TRY_BLOCK
: 0);
14612 RECUR (BIND_EXPR_BODY (t
));
14614 if (BIND_EXPR_BODY_BLOCK (t
))
14615 finish_function_body (stmt
);
14617 finish_compound_stmt (stmt
);
14621 finish_break_stmt ();
14624 case CONTINUE_STMT
:
14625 finish_continue_stmt ();
14629 stmt
= begin_switch_stmt ();
14630 tmp
= RECUR (SWITCH_STMT_COND (t
));
14631 finish_switch_cond (tmp
, stmt
);
14632 RECUR (SWITCH_STMT_BODY (t
));
14633 finish_switch_stmt (stmt
);
14636 case CASE_LABEL_EXPR
:
14638 tree low
= RECUR (CASE_LOW (t
));
14639 tree high
= RECUR (CASE_HIGH (t
));
14640 finish_case_label (EXPR_LOCATION (t
), low
, high
);
14646 tree decl
= LABEL_EXPR_LABEL (t
);
14649 label
= finish_label_stmt (DECL_NAME (decl
));
14650 if (DECL_ATTRIBUTES (decl
) != NULL_TREE
)
14651 cplus_decl_attributes (&label
, DECL_ATTRIBUTES (decl
), 0);
14656 tmp
= GOTO_DESTINATION (t
);
14657 if (TREE_CODE (tmp
) != LABEL_DECL
)
14658 /* Computed goto's must be tsubst'd into. On the other hand,
14659 non-computed gotos must not be; the identifier in question
14660 will have no binding. */
14663 tmp
= DECL_NAME (tmp
);
14664 finish_goto_stmt (tmp
);
14669 tree string
= RECUR (ASM_STRING (t
));
14670 tree outputs
= tsubst_copy_asm_operands (ASM_OUTPUTS (t
), args
,
14671 complain
, in_decl
);
14672 tree inputs
= tsubst_copy_asm_operands (ASM_INPUTS (t
), args
,
14673 complain
, in_decl
);
14674 tree clobbers
= tsubst_copy_asm_operands (ASM_CLOBBERS (t
), args
,
14675 complain
, in_decl
);
14676 tree labels
= tsubst_copy_asm_operands (ASM_LABELS (t
), args
,
14677 complain
, in_decl
);
14678 tmp
= finish_asm_stmt (ASM_VOLATILE_P (t
), string
, outputs
, inputs
,
14680 tree asm_expr
= tmp
;
14681 if (TREE_CODE (asm_expr
) == CLEANUP_POINT_EXPR
)
14682 asm_expr
= TREE_OPERAND (asm_expr
, 0);
14683 ASM_INPUT_P (asm_expr
) = ASM_INPUT_P (t
);
14690 stmt
= begin_try_block ();
14691 RECUR (TRY_STMTS (t
));
14692 finish_cleanup_try_block (stmt
);
14693 finish_cleanup (RECUR (TRY_HANDLERS (t
)), stmt
);
14697 tree compound_stmt
= NULL_TREE
;
14699 if (FN_TRY_BLOCK_P (t
))
14700 stmt
= begin_function_try_block (&compound_stmt
);
14702 stmt
= begin_try_block ();
14704 RECUR (TRY_STMTS (t
));
14706 if (FN_TRY_BLOCK_P (t
))
14707 finish_function_try_block (stmt
);
14709 finish_try_block (stmt
);
14711 RECUR (TRY_HANDLERS (t
));
14712 if (FN_TRY_BLOCK_P (t
))
14713 finish_function_handler_sequence (stmt
, compound_stmt
);
14715 finish_handler_sequence (stmt
);
14721 tree decl
= HANDLER_PARMS (t
);
14725 decl
= tsubst (decl
, args
, complain
, in_decl
);
14726 /* Prevent instantiate_decl from trying to instantiate
14727 this variable. We've already done all that needs to be
14729 if (decl
!= error_mark_node
)
14730 DECL_TEMPLATE_INSTANTIATED (decl
) = 1;
14732 stmt
= begin_handler ();
14733 finish_handler_parms (decl
, stmt
);
14734 RECUR (HANDLER_BODY (t
));
14735 finish_handler (stmt
);
14740 tmp
= tsubst (TREE_TYPE (t
), args
, complain
, NULL_TREE
);
14741 if (CLASS_TYPE_P (tmp
))
14743 /* Local classes are not independent templates; they are
14744 instantiated along with their containing function. And this
14745 way we don't have to deal with pushing out of one local class
14746 to instantiate a member of another local class. */
14748 /* Closures are handled by the LAMBDA_EXPR. */
14749 gcc_assert (!LAMBDA_TYPE_P (TREE_TYPE (t
)));
14750 complete_type (tmp
);
14751 for (fn
= TYPE_METHODS (tmp
); fn
; fn
= DECL_CHAIN (fn
))
14752 if (!DECL_ARTIFICIAL (fn
))
14753 instantiate_decl (fn
, /*defer_ok*/0, /*expl_inst_class*/false);
14757 case STATIC_ASSERT
:
14761 ++c_inhibit_evaluation_warnings
;
14763 tsubst_expr (STATIC_ASSERT_CONDITION (t
),
14766 /*integral_constant_expression_p=*/true);
14767 --c_inhibit_evaluation_warnings
;
14769 finish_static_assert (condition
,
14770 STATIC_ASSERT_MESSAGE (t
),
14771 STATIC_ASSERT_SOURCE_LOCATION (t
),
14772 /*member_p=*/false);
14777 tmp
= tsubst_omp_clauses (OMP_PARALLEL_CLAUSES (t
), false,
14778 args
, complain
, in_decl
);
14779 stmt
= begin_omp_parallel ();
14780 RECUR (OMP_PARALLEL_BODY (t
));
14781 OMP_PARALLEL_COMBINED (finish_omp_parallel (tmp
, stmt
))
14782 = OMP_PARALLEL_COMBINED (t
);
14786 tmp
= tsubst_omp_clauses (OMP_TASK_CLAUSES (t
), false,
14787 args
, complain
, in_decl
);
14788 stmt
= begin_omp_task ();
14789 RECUR (OMP_TASK_BODY (t
));
14790 finish_omp_task (tmp
, stmt
);
14797 case OMP_DISTRIBUTE
:
14799 tree clauses
, body
, pre_body
;
14800 tree declv
= NULL_TREE
, initv
= NULL_TREE
, condv
= NULL_TREE
;
14801 tree incrv
= NULL_TREE
;
14804 clauses
= tsubst_omp_clauses (OMP_FOR_CLAUSES (t
), false,
14805 args
, complain
, in_decl
);
14806 if (OMP_FOR_INIT (t
) != NULL_TREE
)
14808 declv
= make_tree_vec (TREE_VEC_LENGTH (OMP_FOR_INIT (t
)));
14809 initv
= make_tree_vec (TREE_VEC_LENGTH (OMP_FOR_INIT (t
)));
14810 condv
= make_tree_vec (TREE_VEC_LENGTH (OMP_FOR_INIT (t
)));
14811 incrv
= make_tree_vec (TREE_VEC_LENGTH (OMP_FOR_INIT (t
)));
14814 stmt
= begin_omp_structured_block ();
14816 pre_body
= push_stmt_list ();
14817 RECUR (OMP_FOR_PRE_BODY (t
));
14818 pre_body
= pop_stmt_list (pre_body
);
14820 if (OMP_FOR_INIT (t
) != NULL_TREE
)
14821 for (i
= 0; i
< TREE_VEC_LENGTH (OMP_FOR_INIT (t
)); i
++)
14822 tsubst_omp_for_iterator (t
, i
, declv
, initv
, condv
, incrv
,
14823 &clauses
, args
, complain
, in_decl
,
14824 integral_constant_expression_p
);
14826 body
= push_stmt_list ();
14827 RECUR (OMP_FOR_BODY (t
));
14828 body
= pop_stmt_list (body
);
14830 if (OMP_FOR_INIT (t
) != NULL_TREE
)
14831 t
= finish_omp_for (EXPR_LOCATION (t
), TREE_CODE (t
), declv
, initv
,
14832 condv
, incrv
, body
, pre_body
, clauses
);
14835 t
= make_node (TREE_CODE (t
));
14836 TREE_TYPE (t
) = void_type_node
;
14837 OMP_FOR_BODY (t
) = body
;
14838 OMP_FOR_PRE_BODY (t
) = pre_body
;
14839 OMP_FOR_CLAUSES (t
) = clauses
;
14840 SET_EXPR_LOCATION (t
, EXPR_LOCATION (t
));
14844 add_stmt (finish_omp_structured_block (stmt
));
14851 tmp
= tsubst_omp_clauses (OMP_CLAUSES (t
), false,
14852 args
, complain
, in_decl
);
14853 stmt
= push_stmt_list ();
14854 RECUR (OMP_BODY (t
));
14855 stmt
= pop_stmt_list (stmt
);
14858 OMP_BODY (t
) = stmt
;
14859 OMP_CLAUSES (t
) = tmp
;
14863 case OMP_TARGET_DATA
:
14865 tmp
= tsubst_omp_clauses (OMP_CLAUSES (t
), false,
14866 args
, complain
, in_decl
);
14867 keep_next_level (true);
14868 stmt
= begin_omp_structured_block ();
14870 RECUR (OMP_BODY (t
));
14871 stmt
= finish_omp_structured_block (stmt
);
14874 OMP_BODY (t
) = stmt
;
14875 OMP_CLAUSES (t
) = tmp
;
14879 case OMP_TARGET_UPDATE
:
14880 tmp
= tsubst_omp_clauses (OMP_TARGET_UPDATE_CLAUSES (t
), false,
14881 args
, complain
, in_decl
);
14883 OMP_TARGET_UPDATE_CLAUSES (t
) = tmp
;
14890 case OMP_TASKGROUP
:
14892 stmt
= push_stmt_list ();
14893 RECUR (OMP_BODY (t
));
14894 stmt
= pop_stmt_list (stmt
);
14897 OMP_BODY (t
) = stmt
;
14902 gcc_assert (OMP_ATOMIC_DEPENDENT_P (t
));
14903 if (TREE_CODE (TREE_OPERAND (t
, 1)) != MODIFY_EXPR
)
14905 tree op1
= TREE_OPERAND (t
, 1);
14906 tree rhs1
= NULL_TREE
;
14908 if (TREE_CODE (op1
) == COMPOUND_EXPR
)
14910 rhs1
= RECUR (TREE_OPERAND (op1
, 0));
14911 op1
= TREE_OPERAND (op1
, 1);
14913 lhs
= RECUR (TREE_OPERAND (op1
, 0));
14914 rhs
= RECUR (TREE_OPERAND (op1
, 1));
14915 finish_omp_atomic (OMP_ATOMIC
, TREE_CODE (op1
), lhs
, rhs
,
14916 NULL_TREE
, NULL_TREE
, rhs1
,
14917 OMP_ATOMIC_SEQ_CST (t
));
14921 tree op1
= TREE_OPERAND (t
, 1);
14922 tree v
= NULL_TREE
, lhs
, rhs
= NULL_TREE
, lhs1
= NULL_TREE
;
14923 tree rhs1
= NULL_TREE
;
14924 enum tree_code code
= TREE_CODE (TREE_OPERAND (op1
, 1));
14925 enum tree_code opcode
= NOP_EXPR
;
14926 if (code
== OMP_ATOMIC_READ
)
14928 v
= RECUR (TREE_OPERAND (op1
, 0));
14929 lhs
= RECUR (TREE_OPERAND (TREE_OPERAND (op1
, 1), 0));
14931 else if (code
== OMP_ATOMIC_CAPTURE_OLD
14932 || code
== OMP_ATOMIC_CAPTURE_NEW
)
14934 tree op11
= TREE_OPERAND (TREE_OPERAND (op1
, 1), 1);
14935 v
= RECUR (TREE_OPERAND (op1
, 0));
14936 lhs1
= RECUR (TREE_OPERAND (TREE_OPERAND (op1
, 1), 0));
14937 if (TREE_CODE (op11
) == COMPOUND_EXPR
)
14939 rhs1
= RECUR (TREE_OPERAND (op11
, 0));
14940 op11
= TREE_OPERAND (op11
, 1);
14942 lhs
= RECUR (TREE_OPERAND (op11
, 0));
14943 rhs
= RECUR (TREE_OPERAND (op11
, 1));
14944 opcode
= TREE_CODE (op11
);
14945 if (opcode
== MODIFY_EXPR
)
14951 lhs
= RECUR (TREE_OPERAND (op1
, 0));
14952 rhs
= RECUR (TREE_OPERAND (op1
, 1));
14954 finish_omp_atomic (code
, opcode
, lhs
, rhs
, v
, lhs1
, rhs1
,
14955 OMP_ATOMIC_SEQ_CST (t
));
14959 case TRANSACTION_EXPR
:
14962 flags
|= (TRANSACTION_EXPR_OUTER (t
) ? TM_STMT_ATTR_OUTER
: 0);
14963 flags
|= (TRANSACTION_EXPR_RELAXED (t
) ? TM_STMT_ATTR_RELAXED
: 0);
14965 if (TRANSACTION_EXPR_IS_STMT (t
))
14967 tree body
= TRANSACTION_EXPR_BODY (t
);
14968 tree noex
= NULL_TREE
;
14969 if (TREE_CODE (body
) == MUST_NOT_THROW_EXPR
)
14971 noex
= MUST_NOT_THROW_COND (body
);
14972 if (noex
== NULL_TREE
)
14973 noex
= boolean_true_node
;
14974 body
= TREE_OPERAND (body
, 0);
14976 stmt
= begin_transaction_stmt (input_location
, NULL
, flags
);
14978 finish_transaction_stmt (stmt
, NULL
, flags
, RECUR (noex
));
14982 stmt
= build_transaction_expr (EXPR_LOCATION (t
),
14983 RECUR (TRANSACTION_EXPR_BODY (t
)),
14990 case MUST_NOT_THROW_EXPR
:
14992 tree op0
= RECUR (TREE_OPERAND (t
, 0));
14993 tree cond
= RECUR (MUST_NOT_THROW_COND (t
));
14994 RETURN (build_must_not_throw_expr (op0
, cond
));
14997 case EXPR_PACK_EXPANSION
:
14998 error ("invalid use of pack expansion expression");
14999 RETURN (error_mark_node
);
15001 case NONTYPE_ARGUMENT_PACK
:
15002 error ("use %<...%> to expand argument pack");
15003 RETURN (error_mark_node
);
15005 case CILK_SPAWN_STMT
:
15006 cfun
->calls_cilk_spawn
= 1;
15007 RETURN (build_cilk_spawn (EXPR_LOCATION (t
), RECUR (CILK_SPAWN_FN (t
))));
15009 case CILK_SYNC_STMT
:
15010 RETURN (build_cilk_sync ());
15012 case COMPOUND_EXPR
:
15013 tmp
= RECUR (TREE_OPERAND (t
, 0));
15014 if (tmp
== NULL_TREE
)
15015 /* If the first operand was a statement, we're done with it. */
15016 RETURN (RECUR (TREE_OPERAND (t
, 1)));
15017 RETURN (build_x_compound_expr (EXPR_LOCATION (t
), tmp
,
15018 RECUR (TREE_OPERAND (t
, 1)),
15021 case ANNOTATE_EXPR
:
15022 tmp
= RECUR (TREE_OPERAND (t
, 0));
15023 RETURN (build2_loc (EXPR_LOCATION (t
), ANNOTATE_EXPR
,
15024 TREE_TYPE (tmp
), tmp
, RECUR (TREE_OPERAND (t
, 1))));
15027 gcc_assert (!STATEMENT_CODE_P (TREE_CODE (t
)));
15029 RETURN (tsubst_copy_and_build (t
, args
, complain
, in_decl
,
15030 /*function_p=*/false,
15031 integral_constant_expression_p
));
15034 RETURN (NULL_TREE
);
15036 input_location
= loc
;
15042 /* Instantiate the special body of the artificial DECL_OMP_DECLARE_REDUCTION
15043 function. For description of the body see comment above
15044 cp_parser_omp_declare_reduction_exprs. */
15047 tsubst_omp_udr (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
15049 if (t
== NULL_TREE
|| t
== error_mark_node
)
15052 gcc_assert (TREE_CODE (t
) == STATEMENT_LIST
);
15054 tree_stmt_iterator tsi
;
15057 memset (stmts
, 0, sizeof stmts
);
15058 for (i
= 0, tsi
= tsi_start (t
);
15059 i
< 7 && !tsi_end_p (tsi
);
15060 i
++, tsi_next (&tsi
))
15061 stmts
[i
] = tsi_stmt (tsi
);
15062 gcc_assert (tsi_end_p (tsi
));
15066 gcc_assert (TREE_CODE (stmts
[0]) == DECL_EXPR
15067 && TREE_CODE (stmts
[1]) == DECL_EXPR
);
15068 tree omp_out
= tsubst (DECL_EXPR_DECL (stmts
[0]),
15069 args
, complain
, in_decl
);
15070 tree omp_in
= tsubst (DECL_EXPR_DECL (stmts
[1]),
15071 args
, complain
, in_decl
);
15072 DECL_CONTEXT (omp_out
) = current_function_decl
;
15073 DECL_CONTEXT (omp_in
) = current_function_decl
;
15074 keep_next_level (true);
15075 tree block
= begin_omp_structured_block ();
15076 tsubst_expr (stmts
[2], args
, complain
, in_decl
, false);
15077 block
= finish_omp_structured_block (block
);
15078 block
= maybe_cleanup_point_expr_void (block
);
15079 add_decl_expr (omp_out
);
15080 if (TREE_NO_WARNING (DECL_EXPR_DECL (stmts
[0])))
15081 TREE_NO_WARNING (omp_out
) = 1;
15082 add_decl_expr (omp_in
);
15083 finish_expr_stmt (block
);
15087 gcc_assert (TREE_CODE (stmts
[3]) == DECL_EXPR
15088 && TREE_CODE (stmts
[4]) == DECL_EXPR
);
15089 tree omp_priv
= tsubst (DECL_EXPR_DECL (stmts
[3]),
15090 args
, complain
, in_decl
);
15091 tree omp_orig
= tsubst (DECL_EXPR_DECL (stmts
[4]),
15092 args
, complain
, in_decl
);
15093 DECL_CONTEXT (omp_priv
) = current_function_decl
;
15094 DECL_CONTEXT (omp_orig
) = current_function_decl
;
15095 keep_next_level (true);
15096 tree block
= begin_omp_structured_block ();
15097 tsubst_expr (stmts
[5], args
, complain
, in_decl
, false);
15098 block
= finish_omp_structured_block (block
);
15099 block
= maybe_cleanup_point_expr_void (block
);
15100 cp_walk_tree (&block
, cp_remove_omp_priv_cleanup_stmt
, omp_priv
, NULL
);
15101 add_decl_expr (omp_priv
);
15102 add_decl_expr (omp_orig
);
15103 finish_expr_stmt (block
);
15105 add_decl_expr (omp_orig
);
15109 /* T is a postfix-expression that is not being used in a function
15110 call. Return the substituted version of T. */
15113 tsubst_non_call_postfix_expression (tree t
, tree args
,
15114 tsubst_flags_t complain
,
15117 if (TREE_CODE (t
) == SCOPE_REF
)
15118 t
= tsubst_qualified_id (t
, args
, complain
, in_decl
,
15119 /*done=*/false, /*address_p=*/false);
15121 t
= tsubst_copy_and_build (t
, args
, complain
, in_decl
,
15122 /*function_p=*/false,
15123 /*integral_constant_expression_p=*/false);
15128 /* Like tsubst but deals with expressions and performs semantic
15129 analysis. FUNCTION_P is true if T is the "F" in "F (ARGS)". */
15132 tsubst_copy_and_build (tree t
,
15134 tsubst_flags_t complain
,
15137 bool integral_constant_expression_p
)
15139 #define RETURN(EXP) do { retval = (EXP); goto out; } while(0)
15140 #define RECUR(NODE) \
15141 tsubst_copy_and_build (NODE, args, complain, in_decl, \
15142 /*function_p=*/false, \
15143 integral_constant_expression_p)
15148 if (t
== NULL_TREE
|| t
== error_mark_node
)
15151 loc
= input_location
;
15152 if (EXPR_HAS_LOCATION (t
))
15153 input_location
= EXPR_LOCATION (t
);
15155 /* N3276 decltype magic only applies to calls at the top level or on the
15156 right side of a comma. */
15157 tsubst_flags_t decltype_flag
= (complain
& tf_decltype
);
15158 complain
&= ~tf_decltype
;
15160 switch (TREE_CODE (t
))
15164 /* Fall through. */
15165 case IDENTIFIER_NODE
:
15169 bool non_integral_constant_expression_p
;
15170 const char *error_msg
;
15172 if (IDENTIFIER_TYPENAME_P (t
))
15174 tree new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
15175 t
= mangle_conv_op_name_for_type (new_type
);
15178 /* Look up the name. */
15179 decl
= lookup_name (t
);
15181 /* By convention, expressions use ERROR_MARK_NODE to indicate
15182 failure, not NULL_TREE. */
15183 if (decl
== NULL_TREE
)
15184 decl
= error_mark_node
;
15186 decl
= finish_id_expression (t
, decl
, NULL_TREE
,
15188 integral_constant_expression_p
,
15189 /*allow_non_integral_constant_expression_p=*/(cxx_dialect
>= cxx11
),
15190 &non_integral_constant_expression_p
,
15191 /*template_p=*/false,
15193 /*address_p=*/false,
15194 /*template_arg_p=*/false,
15199 if (!function_p
&& identifier_p (decl
))
15201 if (complain
& tf_error
)
15202 unqualified_name_lookup_error (decl
);
15203 decl
= error_mark_node
;
15208 case TEMPLATE_ID_EXPR
:
15211 tree templ
= RECUR (TREE_OPERAND (t
, 0));
15212 tree targs
= TREE_OPERAND (t
, 1);
15215 targs
= tsubst_template_args (targs
, args
, complain
, in_decl
);
15216 if (targs
== error_mark_node
)
15217 return error_mark_node
;
15219 if (variable_template_p (templ
))
15221 templ
= lookup_template_variable (templ
, targs
);
15222 if (!any_dependent_template_arguments_p (targs
))
15224 templ
= finish_template_variable (templ
, complain
);
15227 RETURN (convert_from_reference (templ
));
15230 if (TREE_CODE (templ
) == COMPONENT_REF
)
15232 object
= TREE_OPERAND (templ
, 0);
15233 templ
= TREE_OPERAND (templ
, 1);
15236 object
= NULL_TREE
;
15237 templ
= lookup_template_function (templ
, targs
);
15240 RETURN (build3 (COMPONENT_REF
, TREE_TYPE (templ
),
15241 object
, templ
, NULL_TREE
));
15243 RETURN (baselink_for_fns (templ
));
15248 tree r
= RECUR (TREE_OPERAND (t
, 0));
15250 if (REFERENCE_REF_P (t
))
15252 /* A type conversion to reference type will be enclosed in
15253 such an indirect ref, but the substitution of the cast
15254 will have also added such an indirect ref. */
15255 if (TREE_CODE (TREE_TYPE (r
)) == REFERENCE_TYPE
)
15256 r
= convert_from_reference (r
);
15259 r
= build_x_indirect_ref (input_location
, r
, RO_UNARY_STAR
,
15260 complain
|decltype_flag
);
15266 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
15267 tree op0
= RECUR (TREE_OPERAND (t
, 0));
15268 RETURN (build_nop (type
, op0
));
15271 case IMPLICIT_CONV_EXPR
:
15273 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
15274 tree expr
= RECUR (TREE_OPERAND (t
, 0));
15275 int flags
= LOOKUP_IMPLICIT
;
15276 if (IMPLICIT_CONV_EXPR_DIRECT_INIT (t
))
15277 flags
= LOOKUP_NORMAL
;
15278 RETURN (perform_implicit_conversion_flags (type
, expr
, complain
,
15284 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
15285 tree op0
= RECUR (TREE_OPERAND (t
, 0));
15286 RETURN (build1 (CONVERT_EXPR
, type
, op0
));
15290 case REINTERPRET_CAST_EXPR
:
15291 case CONST_CAST_EXPR
:
15292 case DYNAMIC_CAST_EXPR
:
15293 case STATIC_CAST_EXPR
:
15296 tree op
, r
= NULL_TREE
;
15298 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
15299 if (integral_constant_expression_p
15300 && !cast_valid_in_integral_constant_expression_p (type
))
15302 if (complain
& tf_error
)
15303 error ("a cast to a type other than an integral or "
15304 "enumeration type cannot appear in a constant-expression");
15305 RETURN (error_mark_node
);
15308 op
= RECUR (TREE_OPERAND (t
, 0));
15310 warning_sentinel
s(warn_useless_cast
);
15311 switch (TREE_CODE (t
))
15314 r
= build_functional_cast (type
, op
, complain
);
15316 case REINTERPRET_CAST_EXPR
:
15317 r
= build_reinterpret_cast (type
, op
, complain
);
15319 case CONST_CAST_EXPR
:
15320 r
= build_const_cast (type
, op
, complain
);
15322 case DYNAMIC_CAST_EXPR
:
15323 r
= build_dynamic_cast (type
, op
, complain
);
15325 case STATIC_CAST_EXPR
:
15326 r
= build_static_cast (type
, op
, complain
);
15329 gcc_unreachable ();
15335 case POSTDECREMENT_EXPR
:
15336 case POSTINCREMENT_EXPR
:
15337 op1
= tsubst_non_call_postfix_expression (TREE_OPERAND (t
, 0),
15338 args
, complain
, in_decl
);
15339 RETURN (build_x_unary_op (input_location
, TREE_CODE (t
), op1
,
15340 complain
|decltype_flag
));
15342 case PREDECREMENT_EXPR
:
15343 case PREINCREMENT_EXPR
:
15347 case TRUTH_NOT_EXPR
:
15348 case UNARY_PLUS_EXPR
: /* Unary + */
15349 case REALPART_EXPR
:
15350 case IMAGPART_EXPR
:
15351 RETURN (build_x_unary_op (input_location
, TREE_CODE (t
),
15352 RECUR (TREE_OPERAND (t
, 0)),
15353 complain
|decltype_flag
));
15355 case FIX_TRUNC_EXPR
:
15356 RETURN (cp_build_unary_op (FIX_TRUNC_EXPR
, RECUR (TREE_OPERAND (t
, 0)),
15360 op1
= TREE_OPERAND (t
, 0);
15361 if (TREE_CODE (op1
) == LABEL_DECL
)
15362 RETURN (finish_label_address_expr (DECL_NAME (op1
),
15363 EXPR_LOCATION (op1
)));
15364 if (TREE_CODE (op1
) == SCOPE_REF
)
15365 op1
= tsubst_qualified_id (op1
, args
, complain
, in_decl
,
15366 /*done=*/true, /*address_p=*/true);
15368 op1
= tsubst_non_call_postfix_expression (op1
, args
, complain
,
15370 RETURN (build_x_unary_op (input_location
, ADDR_EXPR
, op1
,
15371 complain
|decltype_flag
));
15376 case TRUNC_DIV_EXPR
:
15377 case CEIL_DIV_EXPR
:
15378 case FLOOR_DIV_EXPR
:
15379 case ROUND_DIV_EXPR
:
15380 case EXACT_DIV_EXPR
:
15384 case TRUNC_MOD_EXPR
:
15385 case FLOOR_MOD_EXPR
:
15386 case TRUTH_ANDIF_EXPR
:
15387 case TRUTH_ORIF_EXPR
:
15388 case TRUTH_AND_EXPR
:
15389 case TRUTH_OR_EXPR
:
15405 warning_sentinel
s1(warn_type_limits
);
15406 warning_sentinel
s2(warn_div_by_zero
);
15407 warning_sentinel
s3(warn_logical_op
);
15408 warning_sentinel
s4(warn_tautological_compare
);
15409 tree op0
= RECUR (TREE_OPERAND (t
, 0));
15410 tree op1
= RECUR (TREE_OPERAND (t
, 1));
15411 tree r
= build_x_binary_op
15412 (input_location
, TREE_CODE (t
),
15414 (TREE_NO_WARNING (TREE_OPERAND (t
, 0))
15416 : TREE_CODE (TREE_OPERAND (t
, 0))),
15418 (TREE_NO_WARNING (TREE_OPERAND (t
, 1))
15420 : TREE_CODE (TREE_OPERAND (t
, 1))),
15422 complain
|decltype_flag
);
15423 if (EXPR_P (r
) && TREE_NO_WARNING (t
))
15424 TREE_NO_WARNING (r
) = TREE_NO_WARNING (t
);
15429 case POINTER_PLUS_EXPR
:
15431 tree op0
= RECUR (TREE_OPERAND (t
, 0));
15432 tree op1
= RECUR (TREE_OPERAND (t
, 1));
15433 return fold_build_pointer_plus (op0
, op1
);
15437 RETURN (tsubst_qualified_id (t
, args
, complain
, in_decl
, /*done=*/true,
15438 /*address_p=*/false));
15440 op1
= tsubst_non_call_postfix_expression (TREE_OPERAND (t
, 0),
15441 args
, complain
, in_decl
);
15442 RETURN (build_x_array_ref (EXPR_LOCATION (t
), op1
,
15443 RECUR (TREE_OPERAND (t
, 1)),
15444 complain
|decltype_flag
));
15446 case ARRAY_NOTATION_REF
:
15448 tree start_index
, length
, stride
;
15449 op1
= tsubst_non_call_postfix_expression (ARRAY_NOTATION_ARRAY (t
),
15450 args
, complain
, in_decl
);
15451 start_index
= RECUR (ARRAY_NOTATION_START (t
));
15452 length
= RECUR (ARRAY_NOTATION_LENGTH (t
));
15453 stride
= RECUR (ARRAY_NOTATION_STRIDE (t
));
15454 RETURN (build_array_notation_ref (EXPR_LOCATION (t
), op1
, start_index
,
15455 length
, stride
, TREE_TYPE (op1
)));
15458 if (PACK_EXPANSION_P (TREE_OPERAND (t
, 0)))
15459 RETURN (tsubst_copy (t
, args
, complain
, in_decl
));
15466 op1
= TREE_OPERAND (t
, 0);
15467 if (TREE_CODE (t
) == SIZEOF_EXPR
&& SIZEOF_EXPR_TYPE_P (t
))
15468 op1
= TREE_TYPE (op1
);
15471 /* When there are no ARGS, we are trying to evaluate a
15472 non-dependent expression from the parser. Trying to do
15473 the substitutions may not work. */
15475 op1
= TREE_TYPE (op1
);
15479 ++cp_unevaluated_operand
;
15480 ++c_inhibit_evaluation_warnings
;
15482 op1
= tsubst (op1
, args
, complain
, in_decl
);
15484 op1
= tsubst_copy_and_build (op1
, args
, complain
, in_decl
,
15485 /*function_p=*/false,
15486 /*integral_constant_expression_p=*/
15488 --cp_unevaluated_operand
;
15489 --c_inhibit_evaluation_warnings
;
15492 r
= cxx_sizeof_or_alignof_type (op1
, TREE_CODE (t
),
15493 complain
& tf_error
);
15495 r
= cxx_sizeof_or_alignof_expr (op1
, TREE_CODE (t
),
15496 complain
& tf_error
);
15497 if (TREE_CODE (t
) == SIZEOF_EXPR
&& r
!= error_mark_node
)
15499 if (TREE_CODE (r
) != SIZEOF_EXPR
|| TYPE_P (op1
))
15501 if (!processing_template_decl
&& TYPE_P (op1
))
15503 r
= build_min (SIZEOF_EXPR
, size_type_node
,
15504 build1 (NOP_EXPR
, op1
, error_mark_node
));
15505 SIZEOF_EXPR_TYPE_P (r
) = 1;
15508 r
= build_min (SIZEOF_EXPR
, size_type_node
, op1
);
15509 TREE_SIDE_EFFECTS (r
) = 0;
15510 TREE_READONLY (r
) = 1;
15512 SET_EXPR_LOCATION (r
, EXPR_LOCATION (t
));
15517 case AT_ENCODE_EXPR
:
15519 op1
= TREE_OPERAND (t
, 0);
15520 ++cp_unevaluated_operand
;
15521 ++c_inhibit_evaluation_warnings
;
15522 op1
= tsubst_copy_and_build (op1
, args
, complain
, in_decl
,
15523 /*function_p=*/false,
15524 /*integral_constant_expression_p=*/false);
15525 --cp_unevaluated_operand
;
15526 --c_inhibit_evaluation_warnings
;
15527 RETURN (objc_build_encode_expr (op1
));
15530 case NOEXCEPT_EXPR
:
15531 op1
= TREE_OPERAND (t
, 0);
15532 ++cp_unevaluated_operand
;
15533 ++c_inhibit_evaluation_warnings
;
15534 ++cp_noexcept_operand
;
15535 op1
= tsubst_copy_and_build (op1
, args
, complain
, in_decl
,
15536 /*function_p=*/false,
15537 /*integral_constant_expression_p=*/false);
15538 --cp_unevaluated_operand
;
15539 --c_inhibit_evaluation_warnings
;
15540 --cp_noexcept_operand
;
15541 RETURN (finish_noexcept_expr (op1
, complain
));
15545 warning_sentinel
s(warn_div_by_zero
);
15546 tree lhs
= RECUR (TREE_OPERAND (t
, 0));
15547 tree rhs
= RECUR (TREE_OPERAND (t
, 2));
15548 tree r
= build_x_modify_expr
15549 (EXPR_LOCATION (t
), lhs
, TREE_CODE (TREE_OPERAND (t
, 1)), rhs
,
15550 complain
|decltype_flag
);
15551 /* TREE_NO_WARNING must be set if either the expression was
15552 parenthesized or it uses an operator such as >>= rather
15553 than plain assignment. In the former case, it was already
15554 set and must be copied. In the latter case,
15555 build_x_modify_expr sets it and it must not be reset
15557 if (TREE_NO_WARNING (t
))
15558 TREE_NO_WARNING (r
) = TREE_NO_WARNING (t
);
15564 op1
= tsubst_non_call_postfix_expression (TREE_OPERAND (t
, 0),
15565 args
, complain
, in_decl
);
15566 /* Remember that there was a reference to this entity. */
15568 && !mark_used (op1
, complain
) && !(complain
& tf_error
))
15569 RETURN (error_mark_node
);
15570 RETURN (build_x_arrow (input_location
, op1
, complain
));
15574 tree placement
= RECUR (TREE_OPERAND (t
, 0));
15575 tree init
= RECUR (TREE_OPERAND (t
, 3));
15576 vec
<tree
, va_gc
> *placement_vec
;
15577 vec
<tree
, va_gc
> *init_vec
;
15580 if (placement
== NULL_TREE
)
15581 placement_vec
= NULL
;
15584 placement_vec
= make_tree_vector ();
15585 for (; placement
!= NULL_TREE
; placement
= TREE_CHAIN (placement
))
15586 vec_safe_push (placement_vec
, TREE_VALUE (placement
));
15589 /* If there was an initializer in the original tree, but it
15590 instantiated to an empty list, then we should pass a
15591 non-NULL empty vector to tell build_new that it was an
15592 empty initializer() rather than no initializer. This can
15593 only happen when the initializer is a pack expansion whose
15594 parameter packs are of length zero. */
15595 if (init
== NULL_TREE
&& TREE_OPERAND (t
, 3) == NULL_TREE
)
15599 init_vec
= make_tree_vector ();
15600 if (init
== void_node
)
15601 gcc_assert (init_vec
!= NULL
);
15604 for (; init
!= NULL_TREE
; init
= TREE_CHAIN (init
))
15605 vec_safe_push (init_vec
, TREE_VALUE (init
));
15609 tree op1
= tsubst (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
15610 tree op2
= RECUR (TREE_OPERAND (t
, 2));
15611 ret
= build_new (&placement_vec
, op1
, op2
, &init_vec
,
15612 NEW_EXPR_USE_GLOBAL (t
),
15615 if (placement_vec
!= NULL
)
15616 release_tree_vector (placement_vec
);
15617 if (init_vec
!= NULL
)
15618 release_tree_vector (init_vec
);
15625 tree op0
= RECUR (TREE_OPERAND (t
, 0));
15626 tree op1
= RECUR (TREE_OPERAND (t
, 1));
15627 RETURN (delete_sanity (op0
, op1
,
15628 DELETE_EXPR_USE_VEC (t
),
15629 DELETE_EXPR_USE_GLOBAL (t
),
15633 case COMPOUND_EXPR
:
15635 tree op0
= tsubst_copy_and_build (TREE_OPERAND (t
, 0), args
,
15636 complain
& ~tf_decltype
, in_decl
,
15637 /*function_p=*/false,
15638 integral_constant_expression_p
);
15639 RETURN (build_x_compound_expr (EXPR_LOCATION (t
),
15641 RECUR (TREE_OPERAND (t
, 1)),
15642 complain
|decltype_flag
));
15648 vec
<tree
, va_gc
> *call_args
;
15649 unsigned int nargs
, i
;
15654 function
= CALL_EXPR_FN (t
);
15655 /* When we parsed the expression, we determined whether or
15656 not Koenig lookup should be performed. */
15657 koenig_p
= KOENIG_LOOKUP_P (t
);
15658 if (TREE_CODE (function
) == SCOPE_REF
)
15660 qualified_p
= true;
15661 function
= tsubst_qualified_id (function
, args
, complain
, in_decl
,
15663 /*address_p=*/false);
15665 else if (koenig_p
&& identifier_p (function
))
15667 /* Do nothing; calling tsubst_copy_and_build on an identifier
15668 would incorrectly perform unqualified lookup again.
15670 Note that we can also have an IDENTIFIER_NODE if the earlier
15671 unqualified lookup found a member function; in that case
15672 koenig_p will be false and we do want to do the lookup
15673 again to find the instantiated member function.
15675 FIXME but doing that causes c++/15272, so we need to stop
15676 using IDENTIFIER_NODE in that situation. */
15677 qualified_p
= false;
15681 if (TREE_CODE (function
) == COMPONENT_REF
)
15683 tree op
= TREE_OPERAND (function
, 1);
15685 qualified_p
= (TREE_CODE (op
) == SCOPE_REF
15686 || (BASELINK_P (op
)
15687 && BASELINK_QUALIFIED_P (op
)));
15690 qualified_p
= false;
15692 if (TREE_CODE (function
) == ADDR_EXPR
15693 && TREE_CODE (TREE_OPERAND (function
, 0)) == FUNCTION_DECL
)
15694 /* Avoid error about taking the address of a constructor. */
15695 function
= TREE_OPERAND (function
, 0);
15697 function
= tsubst_copy_and_build (function
, args
, complain
,
15700 integral_constant_expression_p
);
15702 if (BASELINK_P (function
))
15703 qualified_p
= true;
15706 nargs
= call_expr_nargs (t
);
15707 call_args
= make_tree_vector ();
15708 for (i
= 0; i
< nargs
; ++i
)
15710 tree arg
= CALL_EXPR_ARG (t
, i
);
15712 if (!PACK_EXPANSION_P (arg
))
15713 vec_safe_push (call_args
, RECUR (CALL_EXPR_ARG (t
, i
)));
15716 /* Expand the pack expansion and push each entry onto
15718 arg
= tsubst_pack_expansion (arg
, args
, complain
, in_decl
);
15719 if (TREE_CODE (arg
) == TREE_VEC
)
15721 unsigned int len
, j
;
15723 len
= TREE_VEC_LENGTH (arg
);
15724 for (j
= 0; j
< len
; ++j
)
15726 tree value
= TREE_VEC_ELT (arg
, j
);
15727 if (value
!= NULL_TREE
)
15728 value
= convert_from_reference (value
);
15729 vec_safe_push (call_args
, value
);
15734 /* A partial substitution. Add one entry. */
15735 vec_safe_push (call_args
, arg
);
15740 /* We do not perform argument-dependent lookup if normal
15741 lookup finds a non-function, in accordance with the
15742 expected resolution of DR 218. */
15744 && ((is_overloaded_fn (function
)
15745 /* If lookup found a member function, the Koenig lookup is
15746 not appropriate, even if an unqualified-name was used
15747 to denote the function. */
15748 && !DECL_FUNCTION_MEMBER_P (get_first_fn (function
)))
15749 || identifier_p (function
))
15750 /* Only do this when substitution turns a dependent call
15751 into a non-dependent call. */
15752 && type_dependent_expression_p_push (t
)
15753 && !any_type_dependent_arguments_p (call_args
))
15754 function
= perform_koenig_lookup (function
, call_args
, tf_none
);
15756 if (identifier_p (function
)
15757 && !any_type_dependent_arguments_p (call_args
))
15759 if (koenig_p
&& (complain
& tf_warning_or_error
))
15761 /* For backwards compatibility and good diagnostics, try
15762 the unqualified lookup again if we aren't in SFINAE
15764 tree unq
= (tsubst_copy_and_build
15765 (function
, args
, complain
, in_decl
, true,
15766 integral_constant_expression_p
));
15767 if (unq
== error_mark_node
)
15768 RETURN (error_mark_node
);
15770 if (unq
!= function
)
15773 if (INDIRECT_REF_P (fn
))
15774 fn
= TREE_OPERAND (fn
, 0);
15775 if (TREE_CODE (fn
) == COMPONENT_REF
)
15776 fn
= TREE_OPERAND (fn
, 1);
15777 if (is_overloaded_fn (fn
))
15778 fn
= get_first_fn (fn
);
15779 if (permerror (EXPR_LOC_OR_LOC (t
, input_location
),
15780 "%qD was not declared in this scope, "
15781 "and no declarations were found by "
15782 "argument-dependent lookup at the point "
15783 "of instantiation", function
))
15786 /* Can't say anything more. */;
15787 else if (DECL_CLASS_SCOPE_P (fn
))
15789 location_t loc
= EXPR_LOC_OR_LOC (t
,
15792 "declarations in dependent base %qT are "
15793 "not found by unqualified lookup",
15794 DECL_CLASS_CONTEXT (fn
));
15795 if (current_class_ptr
)
15797 "use %<this->%D%> instead", function
);
15800 "use %<%T::%D%> instead",
15801 current_class_name
, function
);
15804 inform (DECL_SOURCE_LOCATION (fn
),
15805 "%qD declared here, later in the "
15806 "translation unit", fn
);
15811 if (identifier_p (function
))
15813 if (complain
& tf_error
)
15814 unqualified_name_lookup_error (function
);
15815 release_tree_vector (call_args
);
15816 RETURN (error_mark_node
);
15820 /* Remember that there was a reference to this entity. */
15821 if (DECL_P (function
)
15822 && !mark_used (function
, complain
) && !(complain
& tf_error
))
15823 RETURN (error_mark_node
);
15825 /* Put back tf_decltype for the actual call. */
15826 complain
|= decltype_flag
;
15828 if (TREE_CODE (function
) == OFFSET_REF
)
15829 ret
= build_offset_ref_call_from_tree (function
, &call_args
,
15831 else if (TREE_CODE (function
) == COMPONENT_REF
)
15833 tree instance
= TREE_OPERAND (function
, 0);
15834 tree fn
= TREE_OPERAND (function
, 1);
15836 if (processing_template_decl
15837 && (type_dependent_expression_p (instance
)
15838 || (!BASELINK_P (fn
)
15839 && TREE_CODE (fn
) != FIELD_DECL
)
15840 || type_dependent_expression_p (fn
)
15841 || any_type_dependent_arguments_p (call_args
)))
15842 ret
= build_nt_call_vec (function
, call_args
);
15843 else if (!BASELINK_P (fn
))
15844 ret
= finish_call_expr (function
, &call_args
,
15845 /*disallow_virtual=*/false,
15846 /*koenig_p=*/false,
15849 ret
= (build_new_method_call
15851 &call_args
, NULL_TREE
,
15852 qualified_p
? LOOKUP_NONVIRTUAL
: LOOKUP_NORMAL
,
15857 ret
= finish_call_expr (function
, &call_args
,
15858 /*disallow_virtual=*/qualified_p
,
15862 release_tree_vector (call_args
);
15869 tree cond
= RECUR (TREE_OPERAND (t
, 0));
15870 tree folded_cond
= fold_non_dependent_expr (cond
);
15873 if (TREE_CODE (folded_cond
) == INTEGER_CST
)
15875 if (integer_zerop (folded_cond
))
15877 ++c_inhibit_evaluation_warnings
;
15878 exp1
= RECUR (TREE_OPERAND (t
, 1));
15879 --c_inhibit_evaluation_warnings
;
15880 exp2
= RECUR (TREE_OPERAND (t
, 2));
15884 exp1
= RECUR (TREE_OPERAND (t
, 1));
15885 ++c_inhibit_evaluation_warnings
;
15886 exp2
= RECUR (TREE_OPERAND (t
, 2));
15887 --c_inhibit_evaluation_warnings
;
15889 cond
= folded_cond
;
15893 exp1
= RECUR (TREE_OPERAND (t
, 1));
15894 exp2
= RECUR (TREE_OPERAND (t
, 2));
15897 RETURN (build_x_conditional_expr (EXPR_LOCATION (t
),
15898 cond
, exp1
, exp2
, complain
));
15901 case PSEUDO_DTOR_EXPR
:
15903 tree op0
= RECUR (TREE_OPERAND (t
, 0));
15904 tree op1
= RECUR (TREE_OPERAND (t
, 1));
15905 tree op2
= tsubst (TREE_OPERAND (t
, 2), args
, complain
, in_decl
);
15906 RETURN (finish_pseudo_destructor_expr (op0
, op1
, op2
,
15912 tree purpose
, value
, chain
;
15914 if (t
== void_list_node
)
15917 if ((TREE_PURPOSE (t
) && PACK_EXPANSION_P (TREE_PURPOSE (t
)))
15918 || (TREE_VALUE (t
) && PACK_EXPANSION_P (TREE_VALUE (t
))))
15920 /* We have pack expansions, so expand those and
15921 create a new list out of it. */
15922 tree purposevec
= NULL_TREE
;
15923 tree valuevec
= NULL_TREE
;
15927 /* Expand the argument expressions. */
15928 if (TREE_PURPOSE (t
))
15929 purposevec
= tsubst_pack_expansion (TREE_PURPOSE (t
), args
,
15930 complain
, in_decl
);
15931 if (TREE_VALUE (t
))
15932 valuevec
= tsubst_pack_expansion (TREE_VALUE (t
), args
,
15933 complain
, in_decl
);
15935 /* Build the rest of the list. */
15936 chain
= TREE_CHAIN (t
);
15937 if (chain
&& chain
!= void_type_node
)
15938 chain
= RECUR (chain
);
15940 /* Determine the number of arguments. */
15941 if (purposevec
&& TREE_CODE (purposevec
) == TREE_VEC
)
15943 len
= TREE_VEC_LENGTH (purposevec
);
15944 gcc_assert (!valuevec
|| len
== TREE_VEC_LENGTH (valuevec
));
15946 else if (TREE_CODE (valuevec
) == TREE_VEC
)
15947 len
= TREE_VEC_LENGTH (valuevec
);
15950 /* Since we only performed a partial substitution into
15951 the argument pack, we only RETURN (a single list
15953 if (purposevec
== TREE_PURPOSE (t
)
15954 && valuevec
== TREE_VALUE (t
)
15955 && chain
== TREE_CHAIN (t
))
15958 RETURN (tree_cons (purposevec
, valuevec
, chain
));
15961 /* Convert the argument vectors into a TREE_LIST */
15965 /* Grab the Ith values. */
15967 purpose
= purposevec
? TREE_VEC_ELT (purposevec
, i
)
15970 = valuevec
? convert_from_reference (TREE_VEC_ELT (valuevec
, i
))
15973 /* Build the list (backwards). */
15974 chain
= tree_cons (purpose
, value
, chain
);
15980 purpose
= TREE_PURPOSE (t
);
15982 purpose
= RECUR (purpose
);
15983 value
= TREE_VALUE (t
);
15985 value
= RECUR (value
);
15986 chain
= TREE_CHAIN (t
);
15987 if (chain
&& chain
!= void_type_node
)
15988 chain
= RECUR (chain
);
15989 if (purpose
== TREE_PURPOSE (t
)
15990 && value
== TREE_VALUE (t
)
15991 && chain
== TREE_CHAIN (t
))
15993 RETURN (tree_cons (purpose
, value
, chain
));
15996 case COMPONENT_REF
:
16003 object
= tsubst_non_call_postfix_expression (TREE_OPERAND (t
, 0),
16004 args
, complain
, in_decl
);
16005 /* Remember that there was a reference to this entity. */
16006 if (DECL_P (object
)
16007 && !mark_used (object
, complain
) && !(complain
& tf_error
))
16008 RETURN (error_mark_node
);
16009 object_type
= TREE_TYPE (object
);
16011 member
= TREE_OPERAND (t
, 1);
16012 if (BASELINK_P (member
))
16013 member
= tsubst_baselink (member
,
16014 non_reference (TREE_TYPE (object
)),
16015 args
, complain
, in_decl
);
16017 member
= tsubst_copy (member
, args
, complain
, in_decl
);
16018 if (member
== error_mark_node
)
16019 RETURN (error_mark_node
);
16021 if (type_dependent_expression_p (object
))
16022 /* We can't do much here. */;
16023 else if (!CLASS_TYPE_P (object_type
))
16025 if (scalarish_type_p (object_type
))
16027 tree s
= NULL_TREE
;
16028 tree dtor
= member
;
16030 if (TREE_CODE (dtor
) == SCOPE_REF
)
16032 s
= TREE_OPERAND (dtor
, 0);
16033 dtor
= TREE_OPERAND (dtor
, 1);
16035 if (TREE_CODE (dtor
) == BIT_NOT_EXPR
)
16037 dtor
= TREE_OPERAND (dtor
, 0);
16039 RETURN (finish_pseudo_destructor_expr
16040 (object
, s
, dtor
, input_location
));
16044 else if (TREE_CODE (member
) == SCOPE_REF
16045 && TREE_CODE (TREE_OPERAND (member
, 1)) == TEMPLATE_ID_EXPR
)
16047 /* Lookup the template functions now that we know what the
16049 tree scope
= TREE_OPERAND (member
, 0);
16050 tree tmpl
= TREE_OPERAND (TREE_OPERAND (member
, 1), 0);
16051 tree args
= TREE_OPERAND (TREE_OPERAND (member
, 1), 1);
16052 member
= lookup_qualified_name (scope
, tmpl
,
16053 /*is_type_p=*/false,
16054 /*complain=*/false);
16055 if (BASELINK_P (member
))
16057 BASELINK_FUNCTIONS (member
)
16058 = build_nt (TEMPLATE_ID_EXPR
, BASELINK_FUNCTIONS (member
),
16060 member
= (adjust_result_of_qualified_name_lookup
16061 (member
, BINFO_TYPE (BASELINK_BINFO (member
)),
16066 qualified_name_lookup_error (scope
, tmpl
, member
,
16068 RETURN (error_mark_node
);
16071 else if (TREE_CODE (member
) == SCOPE_REF
16072 && !CLASS_TYPE_P (TREE_OPERAND (member
, 0))
16073 && TREE_CODE (TREE_OPERAND (member
, 0)) != NAMESPACE_DECL
)
16075 if (complain
& tf_error
)
16077 if (TYPE_P (TREE_OPERAND (member
, 0)))
16078 error ("%qT is not a class or namespace",
16079 TREE_OPERAND (member
, 0));
16081 error ("%qD is not a class or namespace",
16082 TREE_OPERAND (member
, 0));
16084 RETURN (error_mark_node
);
16086 else if (TREE_CODE (member
) == FIELD_DECL
)
16088 r
= finish_non_static_data_member (member
, object
, NULL_TREE
);
16089 if (TREE_CODE (r
) == COMPONENT_REF
)
16090 REF_PARENTHESIZED_P (r
) = REF_PARENTHESIZED_P (t
);
16094 r
= finish_class_member_access_expr (object
, member
,
16095 /*template_p=*/false,
16097 if (TREE_CODE (r
) == COMPONENT_REF
)
16098 REF_PARENTHESIZED_P (r
) = REF_PARENTHESIZED_P (t
);
16103 RETURN (build_throw
16104 (RECUR (TREE_OPERAND (t
, 0))));
16108 vec
<constructor_elt
, va_gc
> *n
;
16109 constructor_elt
*ce
;
16110 unsigned HOST_WIDE_INT idx
;
16111 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
16112 bool process_index_p
;
16114 bool need_copy_p
= false;
16117 if (type
== error_mark_node
)
16118 RETURN (error_mark_node
);
16120 /* digest_init will do the wrong thing if we let it. */
16121 if (type
&& TYPE_PTRMEMFUNC_P (type
))
16124 /* We do not want to process the index of aggregate
16125 initializers as they are identifier nodes which will be
16126 looked up by digest_init. */
16127 process_index_p
= !(type
&& MAYBE_CLASS_TYPE_P (type
));
16129 n
= vec_safe_copy (CONSTRUCTOR_ELTS (t
));
16130 newlen
= vec_safe_length (n
);
16131 FOR_EACH_VEC_SAFE_ELT (n
, idx
, ce
)
16133 if (ce
->index
&& process_index_p
16134 /* An identifier index is looked up in the type
16135 being initialized, not the current scope. */
16136 && TREE_CODE (ce
->index
) != IDENTIFIER_NODE
)
16137 ce
->index
= RECUR (ce
->index
);
16139 if (PACK_EXPANSION_P (ce
->value
))
16141 /* Substitute into the pack expansion. */
16142 ce
->value
= tsubst_pack_expansion (ce
->value
, args
, complain
,
16145 if (ce
->value
== error_mark_node
16146 || PACK_EXPANSION_P (ce
->value
))
16148 else if (TREE_VEC_LENGTH (ce
->value
) == 1)
16149 /* Just move the argument into place. */
16150 ce
->value
= TREE_VEC_ELT (ce
->value
, 0);
16153 /* Update the length of the final CONSTRUCTOR
16154 arguments vector, and note that we will need to
16156 newlen
= newlen
+ TREE_VEC_LENGTH (ce
->value
) - 1;
16157 need_copy_p
= true;
16161 ce
->value
= RECUR (ce
->value
);
16166 vec
<constructor_elt
, va_gc
> *old_n
= n
;
16168 vec_alloc (n
, newlen
);
16169 FOR_EACH_VEC_ELT (*old_n
, idx
, ce
)
16171 if (TREE_CODE (ce
->value
) == TREE_VEC
)
16173 int i
, len
= TREE_VEC_LENGTH (ce
->value
);
16174 for (i
= 0; i
< len
; ++i
)
16175 CONSTRUCTOR_APPEND_ELT (n
, 0,
16176 TREE_VEC_ELT (ce
->value
, i
));
16179 CONSTRUCTOR_APPEND_ELT (n
, 0, ce
->value
);
16183 r
= build_constructor (init_list_type_node
, n
);
16184 CONSTRUCTOR_IS_DIRECT_INIT (r
) = CONSTRUCTOR_IS_DIRECT_INIT (t
);
16186 if (TREE_HAS_CONSTRUCTOR (t
))
16187 RETURN (finish_compound_literal (type
, r
, complain
));
16189 TREE_TYPE (r
) = type
;
16195 tree operand_0
= TREE_OPERAND (t
, 0);
16196 if (TYPE_P (operand_0
))
16198 operand_0
= tsubst (operand_0
, args
, complain
, in_decl
);
16199 RETURN (get_typeid (operand_0
, complain
));
16203 operand_0
= RECUR (operand_0
);
16204 RETURN (build_typeid (operand_0
, complain
));
16211 else if (DECL_PACK_P (t
))
16213 /* We don't build decls for an instantiation of a
16214 variadic capture proxy, we instantiate the elements
16216 gcc_assert (DECL_HAS_VALUE_EXPR_P (t
));
16217 return RECUR (DECL_VALUE_EXPR (t
));
16223 tree r
= tsubst_copy (t
, args
, complain
, in_decl
);
16224 /* ??? We're doing a subset of finish_id_expression here. */
16226 && !processing_template_decl
16227 && !cp_unevaluated_operand
16228 && (TREE_STATIC (r
) || DECL_EXTERNAL (r
))
16229 && CP_DECL_THREAD_LOCAL_P (r
))
16231 if (tree wrap
= get_tls_wrapper_fn (r
))
16232 /* Replace an evaluated use of the thread_local variable with
16233 a call to its wrapper. */
16234 r
= build_cxx_call (wrap
, 0, NULL
, tf_warning_or_error
);
16236 else if (outer_automatic_var_p (r
))
16238 r
= process_outer_var_ref (r
, complain
);
16239 if (is_capture_proxy (r
))
16240 register_local_specialization (r
, t
);
16243 if (TREE_CODE (TREE_TYPE (t
)) != REFERENCE_TYPE
)
16244 /* If the original type was a reference, we'll be wrapped in
16245 the appropriate INDIRECT_REF. */
16246 r
= convert_from_reference (r
);
16252 tree op0
= RECUR (TREE_OPERAND (t
, 0));
16253 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
16254 RETURN (build_x_va_arg (EXPR_LOCATION (t
), op0
, type
));
16257 case OFFSETOF_EXPR
:
16258 RETURN (finish_offsetof (RECUR (TREE_OPERAND (t
, 0)),
16259 EXPR_LOCATION (t
)));
16263 tree type1
= tsubst (TRAIT_EXPR_TYPE1 (t
), args
,
16264 complain
, in_decl
);
16266 tree type2
= TRAIT_EXPR_TYPE2 (t
);
16267 if (type2
&& TREE_CODE (type2
) == TREE_LIST
)
16268 type2
= RECUR (type2
);
16270 type2
= tsubst (type2
, args
, complain
, in_decl
);
16272 RETURN (finish_trait_expr (TRAIT_EXPR_KIND (t
), type1
, type2
));
16277 tree old_stmt_expr
= cur_stmt_expr
;
16278 tree stmt_expr
= begin_stmt_expr ();
16280 cur_stmt_expr
= stmt_expr
;
16281 tsubst_expr (STMT_EXPR_STMT (t
), args
, complain
, in_decl
,
16282 integral_constant_expression_p
);
16283 stmt_expr
= finish_stmt_expr (stmt_expr
, false);
16284 cur_stmt_expr
= old_stmt_expr
;
16286 /* If the resulting list of expression statement is empty,
16287 fold it further into void_node. */
16288 if (empty_expr_stmt_p (stmt_expr
))
16289 stmt_expr
= void_node
;
16291 RETURN (stmt_expr
);
16296 tree r
= build_lambda_expr ();
16298 tree type
= tsubst (LAMBDA_EXPR_CLOSURE (t
), args
, complain
, NULL_TREE
);
16299 LAMBDA_EXPR_CLOSURE (r
) = type
;
16300 CLASSTYPE_LAMBDA_EXPR (type
) = r
;
16302 LAMBDA_EXPR_LOCATION (r
)
16303 = LAMBDA_EXPR_LOCATION (t
);
16304 LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (r
)
16305 = LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (t
);
16306 LAMBDA_EXPR_MUTABLE_P (r
) = LAMBDA_EXPR_MUTABLE_P (t
);
16307 LAMBDA_EXPR_DISCRIMINATOR (r
)
16308 = (LAMBDA_EXPR_DISCRIMINATOR (t
));
16309 /* For a function scope, we want to use tsubst so that we don't
16310 complain about referring to an auto function before its return
16311 type has been deduced. Otherwise, we want to use tsubst_copy so
16312 that we look up the existing field/parameter/variable rather
16313 than build a new one. */
16314 tree scope
= LAMBDA_EXPR_EXTRA_SCOPE (t
);
16315 if (scope
&& TREE_CODE (scope
) == FUNCTION_DECL
)
16316 scope
= tsubst (scope
, args
, complain
, in_decl
);
16317 else if (scope
&& TREE_CODE (scope
) == PARM_DECL
)
16319 /* Look up the parameter we want directly, as tsubst_copy
16320 doesn't do what we need. */
16321 tree fn
= tsubst (DECL_CONTEXT (scope
), args
, complain
, in_decl
);
16322 tree parm
= FUNCTION_FIRST_USER_PARM (fn
);
16323 while (DECL_PARM_INDEX (parm
) != DECL_PARM_INDEX (scope
))
16324 parm
= DECL_CHAIN (parm
);
16326 /* FIXME Work around the parm not having DECL_CONTEXT set. */
16327 if (DECL_CONTEXT (scope
) == NULL_TREE
)
16328 DECL_CONTEXT (scope
) = fn
;
16331 scope
= RECUR (scope
);
16332 LAMBDA_EXPR_EXTRA_SCOPE (r
) = scope
;
16333 LAMBDA_EXPR_RETURN_TYPE (r
)
16334 = tsubst (LAMBDA_EXPR_RETURN_TYPE (t
), args
, complain
, in_decl
);
16336 gcc_assert (LAMBDA_EXPR_THIS_CAPTURE (t
) == NULL_TREE
16337 && LAMBDA_EXPR_PENDING_PROXIES (t
) == NULL
);
16339 /* Do this again now that LAMBDA_EXPR_EXTRA_SCOPE is set. */
16340 determine_visibility (TYPE_NAME (type
));
16341 /* Now that we know visibility, instantiate the type so we have a
16342 declaration of the op() for later calls to lambda_function. */
16343 complete_type (type
);
16345 LAMBDA_EXPR_THIS_CAPTURE (r
) = NULL_TREE
;
16347 RETURN (build_lambda_object (r
));
16351 /* We can get here for a constant initializer of non-dependent type.
16352 FIXME stop folding in cp_parser_initializer_clause. */
16354 tree r
= get_target_expr_sfinae (RECUR (TARGET_EXPR_INITIAL (t
)),
16359 case TRANSACTION_EXPR
:
16360 RETURN (tsubst_expr(t
, args
, complain
, in_decl
,
16361 integral_constant_expression_p
));
16364 RETURN (finish_parenthesized_expr (RECUR (TREE_OPERAND (t
, 0))));
16366 case VEC_PERM_EXPR
:
16368 tree op0
= RECUR (TREE_OPERAND (t
, 0));
16369 tree op1
= RECUR (TREE_OPERAND (t
, 1));
16370 tree op2
= RECUR (TREE_OPERAND (t
, 2));
16371 RETURN (build_x_vec_perm_expr (input_location
, op0
, op1
, op2
,
16375 case REQUIRES_EXPR
:
16376 RETURN (tsubst_requires_expr (t
, args
, complain
, in_decl
));
16379 /* Handle Objective-C++ constructs, if appropriate. */
16382 = objcp_tsubst_copy_and_build (t
, args
, complain
,
16383 in_decl
, /*function_p=*/false);
16387 RETURN (tsubst_copy (t
, args
, complain
, in_decl
));
16393 input_location
= loc
;
16397 /* Verify that the instantiated ARGS are valid. For type arguments,
16398 make sure that the type's linkage is ok. For non-type arguments,
16399 make sure they are constants if they are integral or enumerations.
16400 Emit an error under control of COMPLAIN, and return TRUE on error. */
16403 check_instantiated_arg (tree tmpl
, tree t
, tsubst_flags_t complain
)
16405 if (dependent_template_arg_p (t
))
16407 if (ARGUMENT_PACK_P (t
))
16409 tree vec
= ARGUMENT_PACK_ARGS (t
);
16410 int len
= TREE_VEC_LENGTH (vec
);
16411 bool result
= false;
16414 for (i
= 0; i
< len
; ++i
)
16415 if (check_instantiated_arg (tmpl
, TREE_VEC_ELT (vec
, i
), complain
))
16419 else if (TYPE_P (t
))
16421 /* [basic.link]: A name with no linkage (notably, the name
16422 of a class or enumeration declared in a local scope)
16423 shall not be used to declare an entity with linkage.
16424 This implies that names with no linkage cannot be used as
16427 DR 757 relaxes this restriction for C++0x. */
16428 tree nt
= (cxx_dialect
> cxx98
? NULL_TREE
16429 : no_linkage_check (t
, /*relaxed_p=*/false));
16433 /* DR 488 makes use of a type with no linkage cause
16434 type deduction to fail. */
16435 if (complain
& tf_error
)
16437 if (TYPE_ANONYMOUS_P (nt
))
16438 error ("%qT is/uses anonymous type", t
);
16440 error ("template argument for %qD uses local type %qT",
16445 /* In order to avoid all sorts of complications, we do not
16446 allow variably-modified types as template arguments. */
16447 else if (variably_modified_type_p (t
, NULL_TREE
))
16449 if (complain
& tf_error
)
16450 error ("%qT is a variably modified type", t
);
16454 /* Class template and alias template arguments should be OK. */
16455 else if (DECL_TYPE_TEMPLATE_P (t
))
16457 /* A non-type argument of integral or enumerated type must be a
16459 else if (TREE_TYPE (t
)
16460 && INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (t
))
16461 && !REFERENCE_REF_P (t
)
16462 && !TREE_CONSTANT (t
))
16464 if (complain
& tf_error
)
16465 error ("integral expression %qE is not constant", t
);
16472 check_instantiated_args (tree tmpl
, tree args
, tsubst_flags_t complain
)
16474 int ix
, len
= DECL_NTPARMS (tmpl
);
16475 bool result
= false;
16477 for (ix
= 0; ix
!= len
; ix
++)
16479 if (check_instantiated_arg (tmpl
, TREE_VEC_ELT (args
, ix
), complain
))
16482 if (result
&& (complain
& tf_error
))
16483 error (" trying to instantiate %qD", tmpl
);
16487 /* We're out of SFINAE context now, so generate diagnostics for the access
16488 errors we saw earlier when instantiating D from TMPL and ARGS. */
16491 recheck_decl_substitution (tree d
, tree tmpl
, tree args
)
16493 tree pattern
= DECL_TEMPLATE_RESULT (tmpl
);
16494 tree type
= TREE_TYPE (pattern
);
16495 location_t loc
= input_location
;
16497 push_access_scope (d
);
16498 push_deferring_access_checks (dk_no_deferred
);
16499 input_location
= DECL_SOURCE_LOCATION (pattern
);
16500 tsubst (type
, args
, tf_warning_or_error
, d
);
16501 input_location
= loc
;
16502 pop_deferring_access_checks ();
16503 pop_access_scope (d
);
16506 /* Instantiate the indicated variable, function, or alias template TMPL with
16507 the template arguments in TARG_PTR. */
16510 instantiate_template_1 (tree tmpl
, tree orig_args
, tsubst_flags_t complain
)
16512 tree targ_ptr
= orig_args
;
16516 bool access_ok
= true;
16518 if (tmpl
== error_mark_node
)
16519 return error_mark_node
;
16521 gcc_assert (TREE_CODE (tmpl
) == TEMPLATE_DECL
);
16523 /* If this function is a clone, handle it specially. */
16524 if (DECL_CLONED_FUNCTION_P (tmpl
))
16529 /* Use DECL_ABSTRACT_ORIGIN because only FUNCTION_DECLs have
16530 DECL_CLONED_FUNCTION. */
16531 spec
= instantiate_template (DECL_ABSTRACT_ORIGIN (tmpl
),
16532 targ_ptr
, complain
);
16533 if (spec
== error_mark_node
)
16534 return error_mark_node
;
16536 /* Look for the clone. */
16537 FOR_EACH_CLONE (clone
, spec
)
16538 if (DECL_NAME (clone
) == DECL_NAME (tmpl
))
16540 /* We should always have found the clone by now. */
16541 gcc_unreachable ();
16545 if (targ_ptr
== error_mark_node
)
16546 return error_mark_node
;
16548 /* Check to see if we already have this specialization. */
16549 gen_tmpl
= most_general_template (tmpl
);
16550 if (tmpl
!= gen_tmpl
)
16551 /* The TMPL is a partial instantiation. To get a full set of
16552 arguments we must add the arguments used to perform the
16553 partial instantiation. */
16554 targ_ptr
= add_outermost_template_args (DECL_TI_ARGS (tmpl
),
16557 /* It would be nice to avoid hashing here and then again in tsubst_decl,
16558 but it doesn't seem to be on the hot path. */
16559 spec
= retrieve_specialization (gen_tmpl
, targ_ptr
, 0);
16561 gcc_assert (tmpl
== gen_tmpl
16562 || ((fndecl
= retrieve_specialization (tmpl
, orig_args
, 0))
16564 || fndecl
== NULL_TREE
);
16566 if (spec
!= NULL_TREE
)
16568 if (FNDECL_HAS_ACCESS_ERRORS (spec
))
16570 if (complain
& tf_error
)
16571 recheck_decl_substitution (spec
, gen_tmpl
, targ_ptr
);
16572 return error_mark_node
;
16577 if (check_instantiated_args (gen_tmpl
, INNERMOST_TEMPLATE_ARGS (targ_ptr
),
16579 return error_mark_node
;
16581 /* We are building a FUNCTION_DECL, during which the access of its
16582 parameters and return types have to be checked. However this
16583 FUNCTION_DECL which is the desired context for access checking
16584 is not built yet. We solve this chicken-and-egg problem by
16585 deferring all checks until we have the FUNCTION_DECL. */
16586 push_deferring_access_checks (dk_deferred
);
16588 /* Instantiation of the function happens in the context of the function
16589 template, not the context of the overload resolution we're doing. */
16590 push_to_top_level ();
16591 /* If there are dependent arguments, e.g. because we're doing partial
16592 ordering, make sure processing_template_decl stays set. */
16593 if (uses_template_parms (targ_ptr
))
16594 ++processing_template_decl
;
16595 if (DECL_CLASS_SCOPE_P (gen_tmpl
))
16597 tree ctx
= tsubst_aggr_type (DECL_CONTEXT (gen_tmpl
), targ_ptr
,
16598 complain
, gen_tmpl
, true);
16599 push_nested_class (ctx
);
16602 tree pattern
= DECL_TEMPLATE_RESULT (gen_tmpl
);
16604 if (VAR_P (pattern
))
16606 /* We need to determine if we're using a partial or explicit
16607 specialization now, because the type of the variable could be
16609 tree tid
= lookup_template_variable (gen_tmpl
, targ_ptr
);
16610 tree elt
= most_specialized_partial_spec (tid
, complain
);
16611 if (elt
== error_mark_node
)
16612 pattern
= error_mark_node
;
16615 tmpl
= TREE_VALUE (elt
);
16616 pattern
= DECL_TEMPLATE_RESULT (tmpl
);
16617 targ_ptr
= TREE_PURPOSE (elt
);
16621 /* Substitute template parameters to obtain the specialization. */
16622 fndecl
= tsubst (pattern
, targ_ptr
, complain
, gen_tmpl
);
16623 if (DECL_CLASS_SCOPE_P (gen_tmpl
))
16624 pop_nested_class ();
16625 pop_from_top_level ();
16627 if (fndecl
== error_mark_node
)
16629 pop_deferring_access_checks ();
16630 return error_mark_node
;
16633 /* The DECL_TI_TEMPLATE should always be the immediate parent
16634 template, not the most general template. */
16635 DECL_TI_TEMPLATE (fndecl
) = tmpl
;
16636 DECL_TI_ARGS (fndecl
) = targ_ptr
;
16638 /* Now we know the specialization, compute access previously
16640 push_access_scope (fndecl
);
16641 if (!perform_deferred_access_checks (complain
))
16643 pop_access_scope (fndecl
);
16644 pop_deferring_access_checks ();
16646 /* If we've just instantiated the main entry point for a function,
16647 instantiate all the alternate entry points as well. We do this
16648 by cloning the instantiation of the main entry point, not by
16649 instantiating the template clones. */
16650 if (DECL_CHAIN (gen_tmpl
) && DECL_CLONED_FUNCTION_P (DECL_CHAIN (gen_tmpl
)))
16651 clone_function_decl (fndecl
, /*update_method_vec_p=*/0);
16655 if (!(complain
& tf_error
))
16657 /* Remember to reinstantiate when we're out of SFINAE so the user
16658 can see the errors. */
16659 FNDECL_HAS_ACCESS_ERRORS (fndecl
) = true;
16661 return error_mark_node
;
16666 /* Wrapper for instantiate_template_1. */
16669 instantiate_template (tree tmpl
, tree orig_args
, tsubst_flags_t complain
)
16672 timevar_push (TV_TEMPLATE_INST
);
16673 ret
= instantiate_template_1 (tmpl
, orig_args
, complain
);
16674 timevar_pop (TV_TEMPLATE_INST
);
16678 /* Instantiate the alias template TMPL with ARGS. Also push a template
16679 instantiation level, which instantiate_template doesn't do because
16680 functions and variables have sufficient context established by the
16684 instantiate_alias_template (tree tmpl
, tree args
, tsubst_flags_t complain
)
16686 struct pending_template
*old_last_pend
= last_pending_template
;
16687 struct tinst_level
*old_error_tinst
= last_error_tinst_level
;
16688 if (tmpl
== error_mark_node
|| args
== error_mark_node
)
16689 return error_mark_node
;
16690 tree tinst
= build_tree_list (tmpl
, args
);
16691 if (!push_tinst_level (tinst
))
16694 return error_mark_node
;
16698 coerce_innermost_template_parms (DECL_TEMPLATE_PARMS (tmpl
),
16699 args
, tmpl
, complain
,
16700 /*require_all_args=*/true,
16701 /*use_default_args=*/true);
16703 tree r
= instantiate_template (tmpl
, args
, complain
);
16704 pop_tinst_level ();
16705 /* We can't free this if a pending_template entry or last_error_tinst_level
16706 is pointing at it. */
16707 if (last_pending_template
== old_last_pend
16708 && last_error_tinst_level
== old_error_tinst
)
16714 /* PARM is a template parameter pack for FN. Returns true iff
16715 PARM is used in a deducible way in the argument list of FN. */
16718 pack_deducible_p (tree parm
, tree fn
)
16720 tree t
= FUNCTION_FIRST_USER_PARMTYPE (fn
);
16721 for (; t
; t
= TREE_CHAIN (t
))
16723 tree type
= TREE_VALUE (t
);
16725 if (!PACK_EXPANSION_P (type
))
16727 for (packs
= PACK_EXPANSION_PARAMETER_PACKS (type
);
16728 packs
; packs
= TREE_CHAIN (packs
))
16729 if (template_args_equal (TREE_VALUE (packs
), parm
))
16731 /* The template parameter pack is used in a function parameter
16732 pack. If this is the end of the parameter list, the
16733 template parameter pack is deducible. */
16734 if (TREE_CHAIN (t
) == void_list_node
)
16737 /* Otherwise, not. Well, it could be deduced from
16738 a non-pack parameter, but doing so would end up with
16739 a deduction mismatch, so don't bother. */
16743 /* The template parameter pack isn't used in any function parameter
16744 packs, but it might be used deeper, e.g. tuple<Args...>. */
16748 /* The FN is a TEMPLATE_DECL for a function. ARGS is an array with
16749 NARGS elements of the arguments that are being used when calling
16750 it. TARGS is a vector into which the deduced template arguments
16753 Returns either a FUNCTION_DECL for the matching specialization of FN or
16754 NULL_TREE if no suitable specialization can be found. If EXPLAIN_P is
16755 true, diagnostics will be printed to explain why it failed.
16757 If FN is a conversion operator, or we are trying to produce a specific
16758 specialization, RETURN_TYPE is the return type desired.
16760 The EXPLICIT_TARGS are explicit template arguments provided via a
16763 The parameter STRICT is one of:
16766 We are deducing arguments for a function call, as in
16767 [temp.deduct.call].
16770 We are deducing arguments for a conversion function, as in
16771 [temp.deduct.conv].
16774 We are deducing arguments when doing an explicit instantiation
16775 as in [temp.explicit], when determining an explicit specialization
16776 as in [temp.expl.spec], or when taking the address of a function
16777 template, as in [temp.deduct.funcaddr]. */
16780 fn_type_unification (tree fn
,
16781 tree explicit_targs
,
16784 unsigned int nargs
,
16786 unification_kind_t strict
,
16793 tree decl
= NULL_TREE
;
16794 tsubst_flags_t complain
= (explain_p
? tf_warning_or_error
: tf_none
);
16796 static int deduction_depth
;
16797 struct pending_template
*old_last_pend
= last_pending_template
;
16798 struct tinst_level
*old_error_tinst
= last_error_tinst_level
;
16799 tree tparms
= DECL_INNERMOST_TEMPLATE_PARMS (fn
);
16801 tree r
= error_mark_node
;
16804 complain
|= tf_decltype
;
16806 /* In C++0x, it's possible to have a function template whose type depends
16807 on itself recursively. This is most obvious with decltype, but can also
16808 occur with enumeration scope (c++/48969). So we need to catch infinite
16809 recursion and reject the substitution at deduction time; this function
16810 will return error_mark_node for any repeated substitution.
16812 This also catches excessive recursion such as when f<N> depends on
16813 f<N-1> across all integers, and returns error_mark_node for all the
16814 substitutions back up to the initial one.
16816 This is, of course, not reentrant. */
16817 if (excessive_deduction_depth
)
16818 return error_mark_node
;
16819 tinst
= build_tree_list (fn
, NULL_TREE
);
16822 gcc_assert (TREE_CODE (fn
) == TEMPLATE_DECL
);
16824 fntype
= TREE_TYPE (fn
);
16825 if (explicit_targs
)
16829 The specified template arguments must match the template
16830 parameters in kind (i.e., type, nontype, template), and there
16831 must not be more arguments than there are parameters;
16832 otherwise type deduction fails.
16834 Nontype arguments must match the types of the corresponding
16835 nontype template parameters, or must be convertible to the
16836 types of the corresponding nontype parameters as specified in
16837 _temp.arg.nontype_, otherwise type deduction fails.
16839 All references in the function type of the function template
16840 to the corresponding template parameters are replaced by the
16841 specified template argument values. If a substitution in a
16842 template parameter or in the function type of the function
16843 template results in an invalid type, type deduction fails. */
16844 int i
, len
= TREE_VEC_LENGTH (tparms
);
16845 location_t loc
= input_location
;
16846 bool incomplete
= false;
16848 /* Adjust any explicit template arguments before entering the
16849 substitution context. */
16851 = (coerce_template_parms (tparms
, explicit_targs
, NULL_TREE
,
16853 /*require_all_args=*/false,
16854 /*use_default_args=*/false));
16855 if (explicit_targs
== error_mark_node
)
16858 /* Substitute the explicit args into the function type. This is
16859 necessary so that, for instance, explicitly declared function
16860 arguments can match null pointed constants. If we were given
16861 an incomplete set of explicit args, we must not do semantic
16862 processing during substitution as we could create partial
16864 for (i
= 0; i
< len
; i
++)
16866 tree parm
= TREE_VALUE (TREE_VEC_ELT (tparms
, i
));
16867 bool parameter_pack
= false;
16868 tree targ
= TREE_VEC_ELT (explicit_targs
, i
);
16870 /* Dig out the actual parm. */
16871 if (TREE_CODE (parm
) == TYPE_DECL
16872 || TREE_CODE (parm
) == TEMPLATE_DECL
)
16874 parm
= TREE_TYPE (parm
);
16875 parameter_pack
= TEMPLATE_TYPE_PARAMETER_PACK (parm
);
16877 else if (TREE_CODE (parm
) == PARM_DECL
)
16879 parm
= DECL_INITIAL (parm
);
16880 parameter_pack
= TEMPLATE_PARM_PARAMETER_PACK (parm
);
16883 if (!parameter_pack
&& targ
== NULL_TREE
)
16884 /* No explicit argument for this template parameter. */
16887 if (parameter_pack
&& pack_deducible_p (parm
, fn
))
16889 /* Mark the argument pack as "incomplete". We could
16890 still deduce more arguments during unification.
16891 We remove this mark in type_unification_real. */
16894 ARGUMENT_PACK_INCOMPLETE_P(targ
) = 1;
16895 ARGUMENT_PACK_EXPLICIT_ARGS (targ
)
16896 = ARGUMENT_PACK_ARGS (targ
);
16899 /* We have some incomplete argument packs. */
16904 TREE_VALUE (tinst
) = explicit_targs
;
16905 if (!push_tinst_level (tinst
))
16907 excessive_deduction_depth
= true;
16910 processing_template_decl
+= incomplete
;
16911 input_location
= DECL_SOURCE_LOCATION (fn
);
16912 /* Ignore any access checks; we'll see them again in
16913 instantiate_template and they might have the wrong
16914 access path at this point. */
16915 push_deferring_access_checks (dk_deferred
);
16916 fntype
= tsubst (TREE_TYPE (fn
), explicit_targs
,
16917 complain
| tf_partial
, NULL_TREE
);
16918 pop_deferring_access_checks ();
16919 input_location
= loc
;
16920 processing_template_decl
-= incomplete
;
16921 pop_tinst_level ();
16923 if (fntype
== error_mark_node
)
16926 /* Place the explicitly specified arguments in TARGS. */
16927 for (i
= NUM_TMPL_ARGS (explicit_targs
); i
--;)
16928 TREE_VEC_ELT (targs
, i
) = TREE_VEC_ELT (explicit_targs
, i
);
16931 /* Never do unification on the 'this' parameter. */
16932 parms
= skip_artificial_parms_for (fn
, TYPE_ARG_TYPES (fntype
));
16938 parms
= tree_cons (NULL_TREE
, TREE_TYPE (fntype
), parms
);
16939 new_args
= XALLOCAVEC (tree
, nargs
+ 1);
16940 new_args
[0] = return_type
;
16941 memcpy (new_args
+ 1, args
, nargs
* sizeof (tree
));
16946 /* We allow incomplete unification without an error message here
16947 because the standard doesn't seem to explicitly prohibit it. Our
16948 callers must be ready to deal with unification failures in any
16951 TREE_VALUE (tinst
) = targs
;
16952 /* If we aren't explaining yet, push tinst context so we can see where
16953 any errors (e.g. from class instantiations triggered by instantiation
16954 of default template arguments) come from. If we are explaining, this
16955 context is redundant. */
16956 if (!explain_p
&& !push_tinst_level (tinst
))
16958 excessive_deduction_depth
= true;
16962 /* type_unification_real will pass back any access checks from default
16963 template argument substitution. */
16964 vec
<deferred_access_check
, va_gc
> *checks
;
16967 ok
= !type_unification_real (DECL_INNERMOST_TEMPLATE_PARMS (fn
),
16968 targs
, parms
, args
, nargs
, /*subr=*/0,
16969 strict
, flags
, &checks
, explain_p
);
16971 pop_tinst_level ();
16975 /* Now that we have bindings for all of the template arguments,
16976 ensure that the arguments deduced for the template template
16977 parameters have compatible template parameter lists. We cannot
16978 check this property before we have deduced all template
16979 arguments, because the template parameter types of a template
16980 template parameter might depend on prior template parameters
16981 deduced after the template template parameter. The following
16982 ill-formed example illustrates this issue:
16984 template<typename T, template<T> class C> void f(C<5>, T);
16986 template<int N> struct X {};
16989 f(X<5>(), 5l); // error: template argument deduction fails
16992 The template parameter list of 'C' depends on the template type
16993 parameter 'T', but 'C' is deduced to 'X' before 'T' is deduced to
16994 'long'. Thus, we can't check that 'C' cannot bind to 'X' at the
16995 time that we deduce 'C'. */
16996 if (!template_template_parm_bindings_ok_p
16997 (DECL_INNERMOST_TEMPLATE_PARMS (fn
), targs
))
16999 unify_inconsistent_template_template_parameters (explain_p
);
17003 /* All is well so far. Now, check:
17007 When all template arguments have been deduced, all uses of
17008 template parameters in nondeduced contexts are replaced with
17009 the corresponding deduced argument values. If the
17010 substitution results in an invalid type, as described above,
17011 type deduction fails. */
17012 TREE_VALUE (tinst
) = targs
;
17013 if (!push_tinst_level (tinst
))
17015 excessive_deduction_depth
= true;
17019 /* Also collect access checks from the instantiation. */
17020 reopen_deferring_access_checks (checks
);
17022 decl
= instantiate_template (fn
, targs
, complain
);
17024 checks
= get_deferred_access_checks ();
17025 pop_deferring_access_checks ();
17027 pop_tinst_level ();
17029 if (decl
== error_mark_node
)
17032 /* Now perform any access checks encountered during substitution. */
17033 push_access_scope (decl
);
17034 ok
= perform_access_checks (checks
, complain
);
17035 pop_access_scope (decl
);
17039 /* If we're looking for an exact match, check that what we got
17040 is indeed an exact match. It might not be if some template
17041 parameters are used in non-deduced contexts. But don't check
17042 for an exact match if we have dependent template arguments;
17043 in that case we're doing partial ordering, and we already know
17044 that we have two candidates that will provide the actual type. */
17045 if (strict
== DEDUCE_EXACT
&& !any_dependent_template_arguments_p (targs
))
17047 tree substed
= TREE_TYPE (decl
);
17051 = skip_artificial_parms_for (decl
, TYPE_ARG_TYPES (substed
));
17053 sarg
= tree_cons (NULL_TREE
, TREE_TYPE (substed
), sarg
);
17054 for (i
= 0; i
< nargs
&& sarg
; ++i
, sarg
= TREE_CHAIN (sarg
))
17055 if (!same_type_p (args
[i
], TREE_VALUE (sarg
)))
17057 unify_type_mismatch (explain_p
, args
[i
],
17058 TREE_VALUE (sarg
));
17067 if (excessive_deduction_depth
)
17069 if (deduction_depth
== 0)
17070 /* Reset once we're all the way out. */
17071 excessive_deduction_depth
= false;
17074 /* We can't free this if a pending_template entry or last_error_tinst_level
17075 is pointing at it. */
17076 if (last_pending_template
== old_last_pend
17077 && last_error_tinst_level
== old_error_tinst
)
17083 /* Adjust types before performing type deduction, as described in
17084 [temp.deduct.call] and [temp.deduct.conv]. The rules in these two
17085 sections are symmetric. PARM is the type of a function parameter
17086 or the return type of the conversion function. ARG is the type of
17087 the argument passed to the call, or the type of the value
17088 initialized with the result of the conversion function.
17089 ARG_EXPR is the original argument expression, which may be null. */
17092 maybe_adjust_types_for_deduction (unification_kind_t strict
,
17105 /* Swap PARM and ARG throughout the remainder of this
17106 function; the handling is precisely symmetric since PARM
17107 will initialize ARG rather than vice versa. */
17108 std::swap (parm
, arg
);
17112 /* Core issue #873: Do the DR606 thing (see below) for these cases,
17113 too, but here handle it by stripping the reference from PARM
17114 rather than by adding it to ARG. */
17115 if (TREE_CODE (*parm
) == REFERENCE_TYPE
17116 && TYPE_REF_IS_RVALUE (*parm
)
17117 && TREE_CODE (TREE_TYPE (*parm
)) == TEMPLATE_TYPE_PARM
17118 && cp_type_quals (TREE_TYPE (*parm
)) == TYPE_UNQUALIFIED
17119 && TREE_CODE (*arg
) == REFERENCE_TYPE
17120 && !TYPE_REF_IS_RVALUE (*arg
))
17121 *parm
= TREE_TYPE (*parm
);
17122 /* Nothing else to do in this case. */
17126 gcc_unreachable ();
17129 if (TREE_CODE (*parm
) != REFERENCE_TYPE
)
17131 /* [temp.deduct.call]
17133 If P is not a reference type:
17135 --If A is an array type, the pointer type produced by the
17136 array-to-pointer standard conversion (_conv.array_) is
17137 used in place of A for type deduction; otherwise,
17139 --If A is a function type, the pointer type produced by
17140 the function-to-pointer standard conversion
17141 (_conv.func_) is used in place of A for type deduction;
17144 --If A is a cv-qualified type, the top level
17145 cv-qualifiers of A's type are ignored for type
17147 if (TREE_CODE (*arg
) == ARRAY_TYPE
)
17148 *arg
= build_pointer_type (TREE_TYPE (*arg
));
17149 else if (TREE_CODE (*arg
) == FUNCTION_TYPE
)
17150 *arg
= build_pointer_type (*arg
);
17152 *arg
= TYPE_MAIN_VARIANT (*arg
);
17155 /* From C++0x [14.8.2.1/3 temp.deduct.call] (after DR606), "If P is
17156 of the form T&&, where T is a template parameter, and the argument
17157 is an lvalue, T is deduced as A& */
17158 if (TREE_CODE (*parm
) == REFERENCE_TYPE
17159 && TYPE_REF_IS_RVALUE (*parm
)
17160 && TREE_CODE (TREE_TYPE (*parm
)) == TEMPLATE_TYPE_PARM
17161 && cp_type_quals (TREE_TYPE (*parm
)) == TYPE_UNQUALIFIED
17162 && (arg_expr
? real_lvalue_p (arg_expr
)
17163 /* try_one_overload doesn't provide an arg_expr, but
17164 functions are always lvalues. */
17165 : TREE_CODE (*arg
) == FUNCTION_TYPE
))
17166 *arg
= build_reference_type (*arg
);
17168 /* [temp.deduct.call]
17170 If P is a cv-qualified type, the top level cv-qualifiers
17171 of P's type are ignored for type deduction. If P is a
17172 reference type, the type referred to by P is used for
17174 *parm
= TYPE_MAIN_VARIANT (*parm
);
17175 if (TREE_CODE (*parm
) == REFERENCE_TYPE
)
17177 *parm
= TREE_TYPE (*parm
);
17178 result
|= UNIFY_ALLOW_OUTER_MORE_CV_QUAL
;
17181 /* DR 322. For conversion deduction, remove a reference type on parm
17182 too (which has been swapped into ARG). */
17183 if (strict
== DEDUCE_CONV
&& TREE_CODE (*arg
) == REFERENCE_TYPE
)
17184 *arg
= TREE_TYPE (*arg
);
17189 /* Subroutine of unify_one_argument. PARM is a function parameter of a
17190 template which does contain any deducible template parameters; check if
17191 ARG is a suitable match for it. STRICT, FLAGS and EXPLAIN_P are as in
17192 unify_one_argument. */
17195 check_non_deducible_conversion (tree parm
, tree arg
, int strict
,
17196 int flags
, bool explain_p
)
17201 type
= TREE_TYPE (arg
);
17205 if (same_type_p (parm
, type
))
17206 return unify_success (explain_p
);
17208 if (strict
== DEDUCE_CONV
)
17210 if (can_convert_arg (type
, parm
, NULL_TREE
, flags
,
17211 explain_p
? tf_warning_or_error
: tf_none
))
17212 return unify_success (explain_p
);
17214 else if (strict
!= DEDUCE_EXACT
)
17216 if (can_convert_arg (parm
, type
,
17217 TYPE_P (arg
) ? NULL_TREE
: arg
,
17218 flags
, explain_p
? tf_warning_or_error
: tf_none
))
17219 return unify_success (explain_p
);
17222 if (strict
== DEDUCE_EXACT
)
17223 return unify_type_mismatch (explain_p
, parm
, arg
);
17225 return unify_arg_conversion (explain_p
, parm
, type
, arg
);
17228 static bool uses_deducible_template_parms (tree type
);
17230 /* Returns true iff the expression EXPR is one from which a template
17231 argument can be deduced. In other words, if it's an undecorated
17232 use of a template non-type parameter. */
17235 deducible_expression (tree expr
)
17237 return (TREE_CODE (expr
) == TEMPLATE_PARM_INDEX
);
17240 /* Returns true iff the array domain DOMAIN uses a template parameter in a
17241 deducible way; that is, if it has a max value of <PARM> - 1. */
17244 deducible_array_bound (tree domain
)
17246 if (domain
== NULL_TREE
)
17249 tree max
= TYPE_MAX_VALUE (domain
);
17250 if (TREE_CODE (max
) != MINUS_EXPR
)
17253 return deducible_expression (TREE_OPERAND (max
, 0));
17256 /* Returns true iff the template arguments ARGS use a template parameter
17257 in a deducible way. */
17260 deducible_template_args (tree args
)
17262 for (int i
= 0; i
< TREE_VEC_LENGTH (args
); ++i
)
17265 tree elt
= TREE_VEC_ELT (args
, i
);
17266 if (ARGUMENT_PACK_P (elt
))
17267 deducible
= deducible_template_args (ARGUMENT_PACK_ARGS (elt
));
17270 if (PACK_EXPANSION_P (elt
))
17271 elt
= PACK_EXPANSION_PATTERN (elt
);
17272 if (TREE_CODE (elt
) == TEMPLATE_TEMPLATE_PARM
)
17274 else if (TYPE_P (elt
))
17275 deducible
= uses_deducible_template_parms (elt
);
17277 deducible
= deducible_expression (elt
);
17285 /* Returns true iff TYPE contains any deducible references to template
17286 parameters, as per 14.8.2.5. */
17289 uses_deducible_template_parms (tree type
)
17291 if (PACK_EXPANSION_P (type
))
17292 type
= PACK_EXPANSION_PATTERN (type
);
17299 if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
17300 || TREE_CODE (type
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
17306 if (POINTER_TYPE_P (type
))
17307 return uses_deducible_template_parms (TREE_TYPE (type
));
17309 /* T[integer-constant ]
17311 if (TREE_CODE (type
) == ARRAY_TYPE
)
17312 return (uses_deducible_template_parms (TREE_TYPE (type
))
17313 || deducible_array_bound (TYPE_DOMAIN (type
)));
17325 if (TYPE_PTRMEM_P (type
))
17326 return (uses_deducible_template_parms (TYPE_PTRMEM_CLASS_TYPE (type
))
17327 || (uses_deducible_template_parms
17328 (TYPE_PTRMEM_POINTED_TO_TYPE (type
))));
17330 /* template-name <T> (where template-name refers to a class template)
17331 template-name <i> (where template-name refers to a class template) */
17332 if (CLASS_TYPE_P (type
)
17333 && CLASSTYPE_TEMPLATE_INFO (type
)
17334 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (type
)))
17335 return deducible_template_args (INNERMOST_TEMPLATE_ARGS
17336 (CLASSTYPE_TI_ARGS (type
)));
17341 if (TREE_CODE (type
) == FUNCTION_TYPE
17342 || TREE_CODE (type
) == METHOD_TYPE
)
17344 if (uses_deducible_template_parms (TREE_TYPE (type
)))
17346 tree parm
= TYPE_ARG_TYPES (type
);
17347 if (TREE_CODE (type
) == METHOD_TYPE
)
17348 parm
= TREE_CHAIN (parm
);
17349 for (; parm
; parm
= TREE_CHAIN (parm
))
17350 if (uses_deducible_template_parms (TREE_VALUE (parm
)))
17357 /* Subroutine of type_unification_real and unify_pack_expansion to
17358 handle unification of a single P/A pair. Parameters are as
17359 for those functions. */
17362 unify_one_argument (tree tparms
, tree targs
, tree parm
, tree arg
,
17363 int subr
, unification_kind_t strict
,
17366 tree arg_expr
= NULL_TREE
;
17369 if (arg
== error_mark_node
|| parm
== error_mark_node
)
17370 return unify_invalid (explain_p
);
17371 if (arg
== unknown_type_node
)
17372 /* We can't deduce anything from this, but we might get all the
17373 template args from other function args. */
17374 return unify_success (explain_p
);
17376 /* Implicit conversions (Clause 4) will be performed on a function
17377 argument to convert it to the type of the corresponding function
17378 parameter if the parameter type contains no template-parameters that
17379 participate in template argument deduction. */
17380 if (strict
!= DEDUCE_EXACT
17381 && TYPE_P (parm
) && !uses_deducible_template_parms (parm
))
17382 /* For function parameters with no deducible template parameters,
17383 just return. We'll check non-dependent conversions later. */
17384 return unify_success (explain_p
);
17389 arg_strict
= (UNIFY_ALLOW_OUTER_LEVEL
17390 | UNIFY_ALLOW_MORE_CV_QUAL
17391 | UNIFY_ALLOW_DERIVED
);
17395 arg_strict
= UNIFY_ALLOW_LESS_CV_QUAL
;
17399 arg_strict
= UNIFY_ALLOW_NONE
;
17403 gcc_unreachable ();
17406 /* We only do these transformations if this is the top-level
17407 parameter_type_list in a call or declaration matching; in other
17408 situations (nested function declarators, template argument lists) we
17409 won't be comparing a type to an expression, and we don't do any type
17415 gcc_assert (TREE_TYPE (arg
) != NULL_TREE
);
17416 if (type_unknown_p (arg
))
17418 /* [temp.deduct.type] A template-argument can be
17419 deduced from a pointer to function or pointer
17420 to member function argument if the set of
17421 overloaded functions does not contain function
17422 templates and at most one of a set of
17423 overloaded functions provides a unique
17426 if (resolve_overloaded_unification
17427 (tparms
, targs
, parm
, arg
, strict
,
17428 arg_strict
, explain_p
))
17429 return unify_success (explain_p
);
17430 return unify_overload_resolution_failure (explain_p
, arg
);
17434 arg
= unlowered_expr_type (arg
);
17435 if (arg
== error_mark_node
)
17436 return unify_invalid (explain_p
);
17440 maybe_adjust_types_for_deduction (strict
, &parm
, &arg
, arg_expr
);
17443 if ((TYPE_P (parm
) || TREE_CODE (parm
) == TEMPLATE_DECL
)
17444 != (TYPE_P (arg
) || TREE_CODE (arg
) == TEMPLATE_DECL
))
17445 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
17447 /* For deduction from an init-list we need the actual list. */
17448 if (arg_expr
&& BRACE_ENCLOSED_INITIALIZER_P (arg_expr
))
17450 return unify (tparms
, targs
, parm
, arg
, arg_strict
, explain_p
);
17453 /* Most parms like fn_type_unification.
17455 If SUBR is 1, we're being called recursively (to unify the
17456 arguments of a function or method parameter of a function
17459 CHECKS is a pointer to a vector of access checks encountered while
17460 substituting default template arguments. */
17463 type_unification_real (tree tparms
,
17467 unsigned int xnargs
,
17469 unification_kind_t strict
,
17471 vec
<deferred_access_check
, va_gc
> **checks
,
17476 int ntparms
= TREE_VEC_LENGTH (tparms
);
17477 int saw_undeduced
= 0;
17480 unsigned int nargs
;
17483 gcc_assert (TREE_CODE (tparms
) == TREE_VEC
);
17484 gcc_assert (xparms
== NULL_TREE
|| TREE_CODE (xparms
) == TREE_LIST
);
17485 gcc_assert (ntparms
> 0);
17487 /* Reset the number of non-defaulted template arguments contained
17489 NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
) = NULL_TREE
;
17497 while (parms
&& parms
!= void_list_node
17500 parm
= TREE_VALUE (parms
);
17502 if (TREE_CODE (parm
) == TYPE_PACK_EXPANSION
17503 && (!TREE_CHAIN (parms
) || TREE_CHAIN (parms
) == void_list_node
))
17504 /* For a function parameter pack that occurs at the end of the
17505 parameter-declaration-list, the type A of each remaining
17506 argument of the call is compared with the type P of the
17507 declarator-id of the function parameter pack. */
17510 parms
= TREE_CHAIN (parms
);
17512 if (TREE_CODE (parm
) == TYPE_PACK_EXPANSION
)
17513 /* For a function parameter pack that does not occur at the
17514 end of the parameter-declaration-list, the type of the
17515 parameter pack is a non-deduced context. */
17521 if (unify_one_argument (tparms
, targs
, parm
, arg
, subr
, strict
,
17527 && parms
!= void_list_node
17528 && TREE_CODE (TREE_VALUE (parms
)) == TYPE_PACK_EXPANSION
)
17530 /* Unify the remaining arguments with the pack expansion type. */
17532 tree parmvec
= make_tree_vec (1);
17534 /* Allocate a TREE_VEC and copy in all of the arguments */
17535 argvec
= make_tree_vec (nargs
- ia
);
17536 for (i
= 0; ia
< nargs
; ++ia
, ++i
)
17537 TREE_VEC_ELT (argvec
, i
) = args
[ia
];
17539 /* Copy the parameter into parmvec. */
17540 TREE_VEC_ELT (parmvec
, 0) = TREE_VALUE (parms
);
17541 if (unify_pack_expansion (tparms
, targs
, parmvec
, argvec
, strict
,
17542 /*subr=*/subr
, explain_p
))
17545 /* Advance to the end of the list of parameters. */
17546 parms
= TREE_CHAIN (parms
);
17549 /* Fail if we've reached the end of the parm list, and more args
17550 are present, and the parm list isn't variadic. */
17551 if (ia
< nargs
&& parms
== void_list_node
)
17552 return unify_too_many_arguments (explain_p
, nargs
, ia
);
17553 /* Fail if parms are left and they don't have default values and
17554 they aren't all deduced as empty packs (c++/57397). This is
17555 consistent with sufficient_parms_p. */
17556 if (parms
&& parms
!= void_list_node
17557 && TREE_PURPOSE (parms
) == NULL_TREE
)
17559 unsigned int count
= nargs
;
17564 type_pack_p
= TREE_CODE (TREE_VALUE (p
)) == TYPE_PACK_EXPANSION
;
17567 p
= TREE_CHAIN (p
);
17569 while (p
&& p
!= void_list_node
);
17570 if (count
!= nargs
)
17571 return unify_too_few_arguments (explain_p
, ia
, count
,
17577 tsubst_flags_t complain
= (explain_p
17578 ? tf_warning_or_error
17581 for (i
= 0; i
< ntparms
; i
++)
17583 tree targ
= TREE_VEC_ELT (targs
, i
);
17584 tree tparm
= TREE_VEC_ELT (tparms
, i
);
17586 /* Clear the "incomplete" flags on all argument packs now so that
17587 substituting them into later default arguments works. */
17588 if (targ
&& ARGUMENT_PACK_P (targ
))
17590 ARGUMENT_PACK_INCOMPLETE_P (targ
) = 0;
17591 ARGUMENT_PACK_EXPLICIT_ARGS (targ
) = NULL_TREE
;
17594 if (targ
|| tparm
== error_mark_node
)
17596 tparm
= TREE_VALUE (tparm
);
17598 /* If this is an undeduced nontype parameter that depends on
17599 a type parameter, try another pass; its type may have been
17600 deduced from a later argument than the one from which
17601 this parameter can be deduced. */
17602 if (TREE_CODE (tparm
) == PARM_DECL
17603 && uses_template_parms (TREE_TYPE (tparm
))
17604 && saw_undeduced
< 2)
17610 /* Core issue #226 (C++0x) [temp.deduct]:
17612 If a template argument has not been deduced, its
17613 default template argument, if any, is used.
17615 When we are in C++98 mode, TREE_PURPOSE will either
17616 be NULL_TREE or ERROR_MARK_NODE, so we do not need
17617 to explicitly check cxx_dialect here. */
17618 if (TREE_PURPOSE (TREE_VEC_ELT (tparms
, i
)))
17619 /* OK, there is a default argument. Wait until after the
17620 conversion check to do substitution. */
17623 /* If the type parameter is a parameter pack, then it will
17624 be deduced to an empty parameter pack. */
17625 if (template_parameter_pack_p (tparm
))
17629 if (TREE_CODE (tparm
) == TEMPLATE_PARM_INDEX
)
17631 arg
= make_node (NONTYPE_ARGUMENT_PACK
);
17632 TREE_TYPE (arg
) = TREE_TYPE (TEMPLATE_PARM_DECL (tparm
));
17633 TREE_CONSTANT (arg
) = 1;
17636 arg
= cxx_make_type (TYPE_ARGUMENT_PACK
);
17638 SET_ARGUMENT_PACK_ARGS (arg
, make_tree_vec (0));
17640 TREE_VEC_ELT (targs
, i
) = arg
;
17644 return unify_parameter_deduction_failure (explain_p
, tparm
);
17647 /* DR 1391: All parameters have args, now check non-dependent parms for
17649 if (saw_undeduced
< 2)
17650 for (ia
= 0, parms
= xparms
, args
= xargs
, nargs
= xnargs
;
17651 parms
&& parms
!= void_list_node
&& ia
< nargs
; )
17653 parm
= TREE_VALUE (parms
);
17655 if (TREE_CODE (parm
) == TYPE_PACK_EXPANSION
17656 && (!TREE_CHAIN (parms
)
17657 || TREE_CHAIN (parms
) == void_list_node
))
17658 /* For a function parameter pack that occurs at the end of the
17659 parameter-declaration-list, the type A of each remaining
17660 argument of the call is compared with the type P of the
17661 declarator-id of the function parameter pack. */
17664 parms
= TREE_CHAIN (parms
);
17666 if (TREE_CODE (parm
) == TYPE_PACK_EXPANSION
)
17667 /* For a function parameter pack that does not occur at the
17668 end of the parameter-declaration-list, the type of the
17669 parameter pack is a non-deduced context. */
17675 if (uses_template_parms (parm
))
17677 if (check_non_deducible_conversion (parm
, arg
, strict
, flags
,
17682 /* Now substitute into the default template arguments. */
17683 for (i
= 0; i
< ntparms
; i
++)
17685 tree targ
= TREE_VEC_ELT (targs
, i
);
17686 tree tparm
= TREE_VEC_ELT (tparms
, i
);
17688 if (targ
|| tparm
== error_mark_node
)
17690 tree parm
= TREE_VALUE (tparm
);
17692 if (TREE_CODE (parm
) == PARM_DECL
17693 && uses_template_parms (TREE_TYPE (parm
))
17694 && saw_undeduced
< 2)
17697 tree arg
= TREE_PURPOSE (tparm
);
17698 reopen_deferring_access_checks (*checks
);
17699 location_t save_loc
= input_location
;
17701 input_location
= DECL_SOURCE_LOCATION (parm
);
17702 arg
= tsubst_template_arg (arg
, targs
, complain
, NULL_TREE
);
17703 arg
= convert_template_argument (parm
, arg
, targs
, complain
,
17705 input_location
= save_loc
;
17706 *checks
= get_deferred_access_checks ();
17707 pop_deferring_access_checks ();
17708 if (arg
== error_mark_node
)
17712 TREE_VEC_ELT (targs
, i
) = arg
;
17713 /* The position of the first default template argument,
17714 is also the number of non-defaulted arguments in TARGS.
17716 if (!NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
))
17717 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
, i
);
17722 if (saw_undeduced
++ == 1)
17725 #ifdef ENABLE_CHECKING
17726 if (!NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
))
17727 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
, TREE_VEC_LENGTH (targs
));
17730 return unify_success (explain_p
);
17733 /* Subroutine of type_unification_real. Args are like the variables
17734 at the call site. ARG is an overloaded function (or template-id);
17735 we try deducing template args from each of the overloads, and if
17736 only one succeeds, we go with that. Modifies TARGS and returns
17737 true on success. */
17740 resolve_overloaded_unification (tree tparms
,
17744 unification_kind_t strict
,
17748 tree tempargs
= copy_node (targs
);
17750 tree goodfn
= NULL_TREE
;
17753 if (TREE_CODE (arg
) == ADDR_EXPR
)
17755 arg
= TREE_OPERAND (arg
, 0);
17761 if (TREE_CODE (arg
) == COMPONENT_REF
)
17762 /* Handle `&x' where `x' is some static or non-static member
17764 arg
= TREE_OPERAND (arg
, 1);
17766 if (TREE_CODE (arg
) == OFFSET_REF
)
17767 arg
= TREE_OPERAND (arg
, 1);
17769 /* Strip baselink information. */
17770 if (BASELINK_P (arg
))
17771 arg
= BASELINK_FUNCTIONS (arg
);
17773 if (TREE_CODE (arg
) == TEMPLATE_ID_EXPR
)
17775 /* If we got some explicit template args, we need to plug them into
17776 the affected templates before we try to unify, in case the
17777 explicit args will completely resolve the templates in question. */
17780 tree expl_subargs
= TREE_OPERAND (arg
, 1);
17781 arg
= TREE_OPERAND (arg
, 0);
17783 for (; arg
; arg
= OVL_NEXT (arg
))
17785 tree fn
= OVL_CURRENT (arg
);
17786 tree subargs
, elem
;
17788 if (TREE_CODE (fn
) != TEMPLATE_DECL
)
17791 subargs
= coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (fn
),
17792 expl_subargs
, NULL_TREE
, tf_none
,
17793 /*require_all_args=*/true,
17794 /*use_default_args=*/true);
17795 if (subargs
!= error_mark_node
17796 && !any_dependent_template_arguments_p (subargs
))
17798 elem
= TREE_TYPE (instantiate_template (fn
, subargs
, tf_none
));
17799 if (try_one_overload (tparms
, targs
, tempargs
, parm
,
17800 elem
, strict
, sub_strict
, addr_p
, explain_p
)
17801 && (!goodfn
|| !same_type_p (goodfn
, elem
)))
17810 /* If no templates (or more than one) are fully resolved by the
17811 explicit arguments, this template-id is a non-deduced context; it
17812 could still be OK if we deduce all template arguments for the
17813 enclosing call through other arguments. */
17817 else if (TREE_CODE (arg
) != OVERLOAD
17818 && TREE_CODE (arg
) != FUNCTION_DECL
)
17819 /* If ARG is, for example, "(0, &f)" then its type will be unknown
17820 -- but the deduction does not succeed because the expression is
17821 not just the function on its own. */
17824 for (; arg
; arg
= OVL_NEXT (arg
))
17825 if (try_one_overload (tparms
, targs
, tempargs
, parm
,
17826 TREE_TYPE (OVL_CURRENT (arg
)),
17827 strict
, sub_strict
, addr_p
, explain_p
)
17828 && (!goodfn
|| !decls_match (goodfn
, OVL_CURRENT (arg
))))
17830 goodfn
= OVL_CURRENT (arg
);
17834 /* [temp.deduct.type] A template-argument can be deduced from a pointer
17835 to function or pointer to member function argument if the set of
17836 overloaded functions does not contain function templates and at most
17837 one of a set of overloaded functions provides a unique match.
17839 So if we found multiple possibilities, we return success but don't
17840 deduce anything. */
17844 int i
= TREE_VEC_LENGTH (targs
);
17846 if (TREE_VEC_ELT (tempargs
, i
))
17848 tree old
= TREE_VEC_ELT (targs
, i
);
17849 tree new_
= TREE_VEC_ELT (tempargs
, i
);
17850 if (new_
&& old
&& ARGUMENT_PACK_P (old
)
17851 && ARGUMENT_PACK_EXPLICIT_ARGS (old
))
17852 /* Don't forget explicit template arguments in a pack. */
17853 ARGUMENT_PACK_EXPLICIT_ARGS (new_
)
17854 = ARGUMENT_PACK_EXPLICIT_ARGS (old
);
17855 TREE_VEC_ELT (targs
, i
) = new_
;
17864 /* Core DR 115: In contexts where deduction is done and fails, or in
17865 contexts where deduction is not done, if a template argument list is
17866 specified and it, along with any default template arguments, identifies
17867 a single function template specialization, then the template-id is an
17868 lvalue for the function template specialization. */
17871 resolve_nondeduced_context (tree orig_expr
)
17873 tree expr
, offset
, baselink
;
17876 if (!type_unknown_p (orig_expr
))
17881 offset
= NULL_TREE
;
17882 baselink
= NULL_TREE
;
17884 if (TREE_CODE (expr
) == ADDR_EXPR
)
17886 expr
= TREE_OPERAND (expr
, 0);
17889 if (TREE_CODE (expr
) == OFFSET_REF
)
17892 expr
= TREE_OPERAND (expr
, 1);
17894 if (BASELINK_P (expr
))
17897 expr
= BASELINK_FUNCTIONS (expr
);
17900 if (TREE_CODE (expr
) == TEMPLATE_ID_EXPR
)
17903 tree goodfn
= NULL_TREE
;
17905 /* If we got some explicit template args, we need to plug them into
17906 the affected templates before we try to unify, in case the
17907 explicit args will completely resolve the templates in question. */
17909 tree expl_subargs
= TREE_OPERAND (expr
, 1);
17910 tree arg
= TREE_OPERAND (expr
, 0);
17911 tree badfn
= NULL_TREE
;
17912 tree badargs
= NULL_TREE
;
17914 for (; arg
; arg
= OVL_NEXT (arg
))
17916 tree fn
= OVL_CURRENT (arg
);
17917 tree subargs
, elem
;
17919 if (TREE_CODE (fn
) != TEMPLATE_DECL
)
17922 subargs
= coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (fn
),
17923 expl_subargs
, NULL_TREE
, tf_none
,
17924 /*require_all_args=*/true,
17925 /*use_default_args=*/true);
17926 if (subargs
!= error_mark_node
17927 && !any_dependent_template_arguments_p (subargs
))
17929 elem
= instantiate_template (fn
, subargs
, tf_none
);
17930 if (elem
== error_mark_node
)
17935 else if (elem
&& (!goodfn
|| !decls_match (goodfn
, elem
)))
17944 mark_used (goodfn
);
17947 expr
= build_baselink (BASELINK_BINFO (baselink
),
17948 BASELINK_ACCESS_BINFO (baselink
),
17949 expr
, BASELINK_OPTYPE (baselink
));
17953 = TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (offset
, 0)));
17954 expr
= build_offset_ref (base
, expr
, addr
, tf_warning_or_error
);
17957 expr
= cp_build_addr_expr (expr
, tf_warning_or_error
);
17960 else if (good
== 0 && badargs
)
17961 /* There were no good options and at least one bad one, so let the
17962 user know what the problem is. */
17963 instantiate_template (badfn
, badargs
, tf_warning_or_error
);
17968 /* Subroutine of resolve_overloaded_unification; does deduction for a single
17969 overload. Fills TARGS with any deduced arguments, or error_mark_node if
17970 different overloads deduce different arguments for a given parm.
17971 ADDR_P is true if the expression for which deduction is being
17972 performed was of the form "& fn" rather than simply "fn".
17974 Returns 1 on success. */
17977 try_one_overload (tree tparms
,
17982 unification_kind_t strict
,
17991 if (arg
== error_mark_node
)
17994 /* [temp.deduct.type] A template-argument can be deduced from a pointer
17995 to function or pointer to member function argument if the set of
17996 overloaded functions does not contain function templates and at most
17997 one of a set of overloaded functions provides a unique match.
17999 So if this is a template, just return success. */
18001 if (uses_template_parms (arg
))
18004 if (TREE_CODE (arg
) == METHOD_TYPE
)
18005 arg
= build_ptrmemfunc_type (build_pointer_type (arg
));
18007 arg
= build_pointer_type (arg
);
18009 sub_strict
|= maybe_adjust_types_for_deduction (strict
, &parm
, &arg
, NULL
);
18011 /* We don't copy orig_targs for this because if we have already deduced
18012 some template args from previous args, unify would complain when we
18013 try to deduce a template parameter for the same argument, even though
18014 there isn't really a conflict. */
18015 nargs
= TREE_VEC_LENGTH (targs
);
18016 tempargs
= make_tree_vec (nargs
);
18018 if (unify (tparms
, tempargs
, parm
, arg
, sub_strict
, explain_p
))
18021 /* First make sure we didn't deduce anything that conflicts with
18022 explicitly specified args. */
18023 for (i
= nargs
; i
--; )
18025 tree elt
= TREE_VEC_ELT (tempargs
, i
);
18026 tree oldelt
= TREE_VEC_ELT (orig_targs
, i
);
18030 else if (uses_template_parms (elt
))
18031 /* Since we're unifying against ourselves, we will fill in
18032 template args used in the function parm list with our own
18033 template parms. Discard them. */
18034 TREE_VEC_ELT (tempargs
, i
) = NULL_TREE
;
18035 else if (oldelt
&& !template_args_equal (oldelt
, elt
))
18039 for (i
= nargs
; i
--; )
18041 tree elt
= TREE_VEC_ELT (tempargs
, i
);
18044 TREE_VEC_ELT (targs
, i
) = elt
;
18050 /* PARM is a template class (perhaps with unbound template
18051 parameters). ARG is a fully instantiated type. If ARG can be
18052 bound to PARM, return ARG, otherwise return NULL_TREE. TPARMS and
18053 TARGS are as for unify. */
18056 try_class_unification (tree tparms
, tree targs
, tree parm
, tree arg
,
18059 tree copy_of_targs
;
18061 if (!CLASSTYPE_TEMPLATE_INFO (arg
)
18062 || (most_general_template (CLASSTYPE_TI_TEMPLATE (arg
))
18063 != most_general_template (CLASSTYPE_TI_TEMPLATE (parm
))))
18066 /* We need to make a new template argument vector for the call to
18067 unify. If we used TARGS, we'd clutter it up with the result of
18068 the attempted unification, even if this class didn't work out.
18069 We also don't want to commit ourselves to all the unifications
18070 we've already done, since unification is supposed to be done on
18071 an argument-by-argument basis. In other words, consider the
18072 following pathological case:
18074 template <int I, int J, int K>
18077 template <int I, int J>
18078 struct S<I, J, 2> : public S<I, I, I>, S<J, J, J> {};
18080 template <int I, int J, int K>
18081 void f(S<I, J, K>, S<I, I, I>);
18090 Now, by the time we consider the unification involving `s2', we
18091 already know that we must have `f<0, 0, 0>'. But, even though
18092 `S<0, 1, 2>' is derived from `S<0, 0, 0>', the code is invalid
18093 because there are two ways to unify base classes of S<0, 1, 2>
18094 with S<I, I, I>. If we kept the already deduced knowledge, we
18095 would reject the possibility I=1. */
18096 copy_of_targs
= make_tree_vec (TREE_VEC_LENGTH (targs
));
18098 /* If unification failed, we're done. */
18099 if (unify (tparms
, copy_of_targs
, CLASSTYPE_TI_ARGS (parm
),
18100 CLASSTYPE_TI_ARGS (arg
), UNIFY_ALLOW_NONE
, explain_p
))
18106 /* Given a template type PARM and a class type ARG, find the unique
18107 base type in ARG that is an instance of PARM. We do not examine
18108 ARG itself; only its base-classes. If there is not exactly one
18109 appropriate base class, return NULL_TREE. PARM may be the type of
18110 a partial specialization, as well as a plain template type. Used
18113 static enum template_base_result
18114 get_template_base (tree tparms
, tree targs
, tree parm
, tree arg
,
18115 bool explain_p
, tree
*result
)
18117 tree rval
= NULL_TREE
;
18120 gcc_assert (RECORD_OR_UNION_CODE_P (TREE_CODE (arg
)));
18122 binfo
= TYPE_BINFO (complete_type (arg
));
18125 /* The type could not be completed. */
18126 *result
= NULL_TREE
;
18127 return tbr_incomplete_type
;
18130 /* Walk in inheritance graph order. The search order is not
18131 important, and this avoids multiple walks of virtual bases. */
18132 for (binfo
= TREE_CHAIN (binfo
); binfo
; binfo
= TREE_CHAIN (binfo
))
18134 tree r
= try_class_unification (tparms
, targs
, parm
,
18135 BINFO_TYPE (binfo
), explain_p
);
18139 /* If there is more than one satisfactory baseclass, then:
18143 If they yield more than one possible deduced A, the type
18147 if (rval
&& !same_type_p (r
, rval
))
18149 *result
= NULL_TREE
;
18150 return tbr_ambiguous_baseclass
;
18158 return tbr_success
;
18161 /* Returns the level of DECL, which declares a template parameter. */
18164 template_decl_level (tree decl
)
18166 switch (TREE_CODE (decl
))
18169 case TEMPLATE_DECL
:
18170 return TEMPLATE_TYPE_LEVEL (TREE_TYPE (decl
));
18173 return TEMPLATE_PARM_LEVEL (DECL_INITIAL (decl
));
18176 gcc_unreachable ();
18181 /* Decide whether ARG can be unified with PARM, considering only the
18182 cv-qualifiers of each type, given STRICT as documented for unify.
18183 Returns nonzero iff the unification is OK on that basis. */
18186 check_cv_quals_for_unify (int strict
, tree arg
, tree parm
)
18188 int arg_quals
= cp_type_quals (arg
);
18189 int parm_quals
= cp_type_quals (parm
);
18191 if (TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
18192 && !(strict
& UNIFY_ALLOW_OUTER_MORE_CV_QUAL
))
18194 /* Although a CVR qualifier is ignored when being applied to a
18195 substituted template parameter ([8.3.2]/1 for example), that
18196 does not allow us to unify "const T" with "int&" because both
18197 types are not of the form "cv-list T" [14.8.2.5 temp.deduct.type].
18198 It is ok when we're allowing additional CV qualifiers
18199 at the outer level [14.8.2.1]/3,1st bullet. */
18200 if ((TREE_CODE (arg
) == REFERENCE_TYPE
18201 || TREE_CODE (arg
) == FUNCTION_TYPE
18202 || TREE_CODE (arg
) == METHOD_TYPE
)
18203 && (parm_quals
& (TYPE_QUAL_CONST
| TYPE_QUAL_VOLATILE
)))
18206 if ((!POINTER_TYPE_P (arg
) && TREE_CODE (arg
) != TEMPLATE_TYPE_PARM
)
18207 && (parm_quals
& TYPE_QUAL_RESTRICT
))
18211 if (!(strict
& (UNIFY_ALLOW_MORE_CV_QUAL
| UNIFY_ALLOW_OUTER_MORE_CV_QUAL
))
18212 && (arg_quals
& parm_quals
) != parm_quals
)
18215 if (!(strict
& (UNIFY_ALLOW_LESS_CV_QUAL
| UNIFY_ALLOW_OUTER_LESS_CV_QUAL
))
18216 && (parm_quals
& arg_quals
) != arg_quals
)
18222 /* Determines the LEVEL and INDEX for the template parameter PARM. */
18224 template_parm_level_and_index (tree parm
, int* level
, int* index
)
18226 if (TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
18227 || TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
18228 || TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
18230 *index
= TEMPLATE_TYPE_IDX (parm
);
18231 *level
= TEMPLATE_TYPE_LEVEL (parm
);
18235 *index
= TEMPLATE_PARM_IDX (parm
);
18236 *level
= TEMPLATE_PARM_LEVEL (parm
);
18240 #define RECUR_AND_CHECK_FAILURE(TP, TA, P, A, S, EP) \
18242 if (unify (TP, TA, P, A, S, EP)) \
18246 /* Unifies the remaining arguments in PACKED_ARGS with the pack
18247 expansion at the end of PACKED_PARMS. Returns 0 if the type
18248 deduction succeeds, 1 otherwise. STRICT is the same as in
18249 unify. CALL_ARGS_P is true iff PACKED_ARGS is actually a function
18250 call argument list. We'll need to adjust the arguments to make them
18251 types. SUBR tells us if this is from a recursive call to
18252 type_unification_real, or for comparing two template argument
18256 unify_pack_expansion (tree tparms
, tree targs
, tree packed_parms
,
18257 tree packed_args
, unification_kind_t strict
,
18258 bool subr
, bool explain_p
)
18261 = TREE_VEC_ELT (packed_parms
, TREE_VEC_LENGTH (packed_parms
) - 1);
18262 tree pattern
= PACK_EXPANSION_PATTERN (parm
);
18263 tree pack
, packs
= NULL_TREE
;
18264 int i
, start
= TREE_VEC_LENGTH (packed_parms
) - 1;
18266 packed_args
= expand_template_argument_pack (packed_args
);
18268 int len
= TREE_VEC_LENGTH (packed_args
);
18270 /* Determine the parameter packs we will be deducing from the
18271 pattern, and record their current deductions. */
18272 for (pack
= PACK_EXPANSION_PARAMETER_PACKS (parm
);
18273 pack
; pack
= TREE_CHAIN (pack
))
18275 tree parm_pack
= TREE_VALUE (pack
);
18278 /* Determine the index and level of this parameter pack. */
18279 template_parm_level_and_index (parm_pack
, &level
, &idx
);
18281 /* Keep track of the parameter packs and their corresponding
18283 packs
= tree_cons (parm_pack
, TMPL_ARG (targs
, level
, idx
), packs
);
18284 TREE_TYPE (packs
) = make_tree_vec (len
- start
);
18287 /* Loop through all of the arguments that have not yet been
18288 unified and unify each with the pattern. */
18289 for (i
= start
; i
< len
; i
++)
18292 bool any_explicit
= false;
18293 tree arg
= TREE_VEC_ELT (packed_args
, i
);
18295 /* For each parameter pack, set its TMPL_ARG to either NULL_TREE
18296 or the element of its argument pack at the current index if
18297 this argument was explicitly specified. */
18298 for (pack
= packs
; pack
; pack
= TREE_CHAIN (pack
))
18302 template_parm_level_and_index (TREE_PURPOSE (pack
), &level
, &idx
);
18305 if (TREE_VALUE (pack
)
18306 && (pargs
= ARGUMENT_PACK_EXPLICIT_ARGS (TREE_VALUE (pack
)))
18307 && (i
- start
< TREE_VEC_LENGTH (pargs
)))
18309 any_explicit
= true;
18310 arg
= TREE_VEC_ELT (pargs
, i
- start
);
18312 TMPL_ARG (targs
, level
, idx
) = arg
;
18315 /* If we had explicit template arguments, substitute them into the
18316 pattern before deduction. */
18319 /* Some arguments might still be unspecified or dependent. */
18321 ++processing_template_decl
;
18322 dependent
= any_dependent_template_arguments_p (targs
);
18324 --processing_template_decl
;
18325 parm
= tsubst (pattern
, targs
,
18326 explain_p
? tf_warning_or_error
: tf_none
,
18329 --processing_template_decl
;
18330 if (parm
== error_mark_node
)
18336 /* Unify the pattern with the current argument. */
18337 if (unify_one_argument (tparms
, targs
, parm
, arg
, subr
, strict
,
18341 /* For each parameter pack, collect the deduced value. */
18342 for (pack
= packs
; pack
; pack
= TREE_CHAIN (pack
))
18345 template_parm_level_and_index (TREE_PURPOSE (pack
), &level
, &idx
);
18347 TREE_VEC_ELT (TREE_TYPE (pack
), i
- start
) =
18348 TMPL_ARG (targs
, level
, idx
);
18352 /* Verify that the results of unification with the parameter packs
18353 produce results consistent with what we've seen before, and make
18354 the deduced argument packs available. */
18355 for (pack
= packs
; pack
; pack
= TREE_CHAIN (pack
))
18357 tree old_pack
= TREE_VALUE (pack
);
18358 tree new_args
= TREE_TYPE (pack
);
18359 int i
, len
= TREE_VEC_LENGTH (new_args
);
18361 bool nondeduced_p
= false;
18363 /* By default keep the original deduced argument pack.
18364 If necessary, more specific code is going to update the
18365 resulting deduced argument later down in this function. */
18366 template_parm_level_and_index (TREE_PURPOSE (pack
), &level
, &idx
);
18367 TMPL_ARG (targs
, level
, idx
) = old_pack
;
18369 /* If NEW_ARGS contains any NULL_TREE entries, we didn't
18370 actually deduce anything. */
18371 for (i
= 0; i
< len
&& !nondeduced_p
; ++i
)
18372 if (TREE_VEC_ELT (new_args
, i
) == NULL_TREE
)
18373 nondeduced_p
= true;
18377 if (old_pack
&& ARGUMENT_PACK_INCOMPLETE_P (old_pack
))
18379 /* If we had fewer function args than explicit template args,
18380 just use the explicits. */
18381 tree explicit_args
= ARGUMENT_PACK_EXPLICIT_ARGS (old_pack
);
18382 int explicit_len
= TREE_VEC_LENGTH (explicit_args
);
18383 if (len
< explicit_len
)
18384 new_args
= explicit_args
;
18390 /* Build the deduced *_ARGUMENT_PACK. */
18391 if (TREE_CODE (TREE_PURPOSE (pack
)) == TEMPLATE_PARM_INDEX
)
18393 result
= make_node (NONTYPE_ARGUMENT_PACK
);
18394 TREE_TYPE (result
) =
18395 TREE_TYPE (TEMPLATE_PARM_DECL (TREE_PURPOSE (pack
)));
18396 TREE_CONSTANT (result
) = 1;
18399 result
= cxx_make_type (TYPE_ARGUMENT_PACK
);
18401 SET_ARGUMENT_PACK_ARGS (result
, new_args
);
18403 /* Note the deduced argument packs for this parameter
18405 TMPL_ARG (targs
, level
, idx
) = result
;
18407 else if (ARGUMENT_PACK_INCOMPLETE_P (old_pack
)
18408 && (ARGUMENT_PACK_ARGS (old_pack
)
18409 == ARGUMENT_PACK_EXPLICIT_ARGS (old_pack
)))
18411 /* We only had the explicitly-provided arguments before, but
18412 now we have a complete set of arguments. */
18413 tree explicit_args
= ARGUMENT_PACK_EXPLICIT_ARGS (old_pack
);
18415 SET_ARGUMENT_PACK_ARGS (old_pack
, new_args
);
18416 ARGUMENT_PACK_INCOMPLETE_P (old_pack
) = 1;
18417 ARGUMENT_PACK_EXPLICIT_ARGS (old_pack
) = explicit_args
;
18421 tree bad_old_arg
= NULL_TREE
, bad_new_arg
= NULL_TREE
;
18422 tree old_args
= ARGUMENT_PACK_ARGS (old_pack
);
18424 if (!comp_template_args_with_info (old_args
, new_args
,
18425 &bad_old_arg
, &bad_new_arg
))
18426 /* Inconsistent unification of this parameter pack. */
18427 return unify_parameter_pack_inconsistent (explain_p
,
18433 return unify_success (explain_p
);
18436 /* Handle unification of the domain of an array. PARM_DOM and ARG_DOM are
18437 INTEGER_TYPEs representing the TYPE_DOMAIN of ARRAY_TYPEs. The other
18438 parameters and return value are as for unify. */
18441 unify_array_domain (tree tparms
, tree targs
,
18442 tree parm_dom
, tree arg_dom
,
18450 /* Our representation of array types uses "N - 1" as the
18451 TYPE_MAX_VALUE for an array with "N" elements, if "N" is
18452 not an integer constant. We cannot unify arbitrarily
18453 complex expressions, so we eliminate the MINUS_EXPRs
18455 parm_max
= TYPE_MAX_VALUE (parm_dom
);
18456 parm_cst
= TREE_CODE (parm_max
) == INTEGER_CST
;
18459 gcc_assert (TREE_CODE (parm_max
) == MINUS_EXPR
);
18460 parm_max
= TREE_OPERAND (parm_max
, 0);
18462 arg_max
= TYPE_MAX_VALUE (arg_dom
);
18463 arg_cst
= TREE_CODE (arg_max
) == INTEGER_CST
;
18466 /* The ARG_MAX may not be a simple MINUS_EXPR, if we are
18467 trying to unify the type of a variable with the type
18468 of a template parameter. For example:
18470 template <unsigned int N>
18471 void f (char (&) [N]);
18478 Here, the type of the ARG will be "int [g(i)]", and
18479 may be a SAVE_EXPR, etc. */
18480 if (TREE_CODE (arg_max
) != MINUS_EXPR
)
18481 return unify_vla_arg (explain_p
, arg_dom
);
18482 arg_max
= TREE_OPERAND (arg_max
, 0);
18485 /* If only one of the bounds used a MINUS_EXPR, compensate
18486 by adding one to the other bound. */
18487 if (parm_cst
&& !arg_cst
)
18488 parm_max
= fold_build2_loc (input_location
, PLUS_EXPR
,
18492 else if (arg_cst
&& !parm_cst
)
18493 arg_max
= fold_build2_loc (input_location
, PLUS_EXPR
,
18498 return unify (tparms
, targs
, parm_max
, arg_max
,
18499 UNIFY_ALLOW_INTEGER
, explain_p
);
18502 /* Deduce the value of template parameters. TPARMS is the (innermost)
18503 set of template parameters to a template. TARGS is the bindings
18504 for those template parameters, as determined thus far; TARGS may
18505 include template arguments for outer levels of template parameters
18506 as well. PARM is a parameter to a template function, or a
18507 subcomponent of that parameter; ARG is the corresponding argument.
18508 This function attempts to match PARM with ARG in a manner
18509 consistent with the existing assignments in TARGS. If more values
18510 are deduced, then TARGS is updated.
18512 Returns 0 if the type deduction succeeds, 1 otherwise. The
18513 parameter STRICT is a bitwise or of the following flags:
18516 Require an exact match between PARM and ARG.
18517 UNIFY_ALLOW_MORE_CV_QUAL:
18518 Allow the deduced ARG to be more cv-qualified (by qualification
18519 conversion) than ARG.
18520 UNIFY_ALLOW_LESS_CV_QUAL:
18521 Allow the deduced ARG to be less cv-qualified than ARG.
18522 UNIFY_ALLOW_DERIVED:
18523 Allow the deduced ARG to be a template base class of ARG,
18524 or a pointer to a template base class of the type pointed to by
18526 UNIFY_ALLOW_INTEGER:
18527 Allow any integral type to be deduced. See the TEMPLATE_PARM_INDEX
18528 case for more information.
18529 UNIFY_ALLOW_OUTER_LEVEL:
18530 This is the outermost level of a deduction. Used to determine validity
18531 of qualification conversions. A valid qualification conversion must
18532 have const qualified pointers leading up to the inner type which
18533 requires additional CV quals, except at the outer level, where const
18534 is not required [conv.qual]. It would be normal to set this flag in
18535 addition to setting UNIFY_ALLOW_MORE_CV_QUAL.
18536 UNIFY_ALLOW_OUTER_MORE_CV_QUAL:
18537 This is the outermost level of a deduction, and PARM can be more CV
18538 qualified at this point.
18539 UNIFY_ALLOW_OUTER_LESS_CV_QUAL:
18540 This is the outermost level of a deduction, and PARM can be less CV
18541 qualified at this point. */
18544 unify (tree tparms
, tree targs
, tree parm
, tree arg
, int strict
,
18550 int strict_in
= strict
;
18552 /* I don't think this will do the right thing with respect to types.
18553 But the only case I've seen it in so far has been array bounds, where
18554 signedness is the only information lost, and I think that will be
18556 while (TREE_CODE (parm
) == NOP_EXPR
)
18557 parm
= TREE_OPERAND (parm
, 0);
18559 if (arg
== error_mark_node
)
18560 return unify_invalid (explain_p
);
18561 if (arg
== unknown_type_node
18562 || arg
== init_list_type_node
)
18563 /* We can't deduce anything from this, but we might get all the
18564 template args from other function args. */
18565 return unify_success (explain_p
);
18567 /* If PARM uses template parameters, then we can't bail out here,
18568 even if ARG == PARM, since we won't record unifications for the
18569 template parameters. We might need them if we're trying to
18570 figure out which of two things is more specialized. */
18571 if (arg
== parm
&& !uses_template_parms (parm
))
18572 return unify_success (explain_p
);
18574 /* Handle init lists early, so the rest of the function can assume
18575 we're dealing with a type. */
18576 if (BRACE_ENCLOSED_INITIALIZER_P (arg
))
18580 tree orig_parm
= parm
;
18582 /* Replace T with std::initializer_list<T> for deduction. */
18583 if (TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
18584 && flag_deduce_init_list
)
18585 parm
= listify (parm
);
18587 if (!is_std_init_list (parm
)
18588 && TREE_CODE (parm
) != ARRAY_TYPE
)
18589 /* We can only deduce from an initializer list argument if the
18590 parameter is std::initializer_list or an array; otherwise this
18591 is a non-deduced context. */
18592 return unify_success (explain_p
);
18594 if (TREE_CODE (parm
) == ARRAY_TYPE
)
18595 elttype
= TREE_TYPE (parm
);
18598 elttype
= TREE_VEC_ELT (CLASSTYPE_TI_ARGS (parm
), 0);
18599 /* Deduction is defined in terms of a single type, so just punt
18600 on the (bizarre) std::initializer_list<T...>. */
18601 if (PACK_EXPANSION_P (elttype
))
18602 return unify_success (explain_p
);
18605 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (arg
), i
, elt
)
18607 int elt_strict
= strict
;
18609 if (elt
== error_mark_node
)
18610 return unify_invalid (explain_p
);
18612 if (!BRACE_ENCLOSED_INITIALIZER_P (elt
))
18614 tree type
= TREE_TYPE (elt
);
18615 if (type
== error_mark_node
)
18616 return unify_invalid (explain_p
);
18617 /* It should only be possible to get here for a call. */
18618 gcc_assert (elt_strict
& UNIFY_ALLOW_OUTER_LEVEL
);
18619 elt_strict
|= maybe_adjust_types_for_deduction
18620 (DEDUCE_CALL
, &elttype
, &type
, elt
);
18624 RECUR_AND_CHECK_FAILURE (tparms
, targs
, elttype
, elt
, elt_strict
,
18628 if (TREE_CODE (parm
) == ARRAY_TYPE
18629 && deducible_array_bound (TYPE_DOMAIN (parm
)))
18631 /* Also deduce from the length of the initializer list. */
18632 tree max
= size_int (CONSTRUCTOR_NELTS (arg
));
18633 tree idx
= compute_array_index_type (NULL_TREE
, max
, tf_none
);
18634 if (idx
== error_mark_node
)
18635 return unify_invalid (explain_p
);
18636 return unify_array_domain (tparms
, targs
, TYPE_DOMAIN (parm
),
18640 /* If the std::initializer_list<T> deduction worked, replace the
18641 deduced A with std::initializer_list<A>. */
18642 if (orig_parm
!= parm
)
18644 idx
= TEMPLATE_TYPE_IDX (orig_parm
);
18645 targ
= TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
);
18646 targ
= listify (targ
);
18647 TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
) = targ
;
18649 return unify_success (explain_p
);
18652 /* Immediately reject some pairs that won't unify because of
18653 cv-qualification mismatches. */
18654 if (TREE_CODE (arg
) == TREE_CODE (parm
)
18656 /* It is the elements of the array which hold the cv quals of an array
18657 type, and the elements might be template type parms. We'll check
18658 when we recurse. */
18659 && TREE_CODE (arg
) != ARRAY_TYPE
18660 /* We check the cv-qualifiers when unifying with template type
18661 parameters below. We want to allow ARG `const T' to unify with
18662 PARM `T' for example, when computing which of two templates
18663 is more specialized, for example. */
18664 && TREE_CODE (arg
) != TEMPLATE_TYPE_PARM
18665 && !check_cv_quals_for_unify (strict_in
, arg
, parm
))
18666 return unify_cv_qual_mismatch (explain_p
, parm
, arg
);
18668 if (!(strict
& UNIFY_ALLOW_OUTER_LEVEL
)
18669 && TYPE_P (parm
) && !CP_TYPE_CONST_P (parm
))
18670 strict
&= ~UNIFY_ALLOW_MORE_CV_QUAL
;
18671 strict
&= ~UNIFY_ALLOW_OUTER_LEVEL
;
18672 strict
&= ~UNIFY_ALLOW_DERIVED
;
18673 strict
&= ~UNIFY_ALLOW_OUTER_MORE_CV_QUAL
;
18674 strict
&= ~UNIFY_ALLOW_OUTER_LESS_CV_QUAL
;
18676 switch (TREE_CODE (parm
))
18678 case TYPENAME_TYPE
:
18680 case UNBOUND_CLASS_TEMPLATE
:
18681 /* In a type which contains a nested-name-specifier, template
18682 argument values cannot be deduced for template parameters used
18683 within the nested-name-specifier. */
18684 return unify_success (explain_p
);
18686 case TEMPLATE_TYPE_PARM
:
18687 case TEMPLATE_TEMPLATE_PARM
:
18688 case BOUND_TEMPLATE_TEMPLATE_PARM
:
18689 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, 0));
18690 if (error_operand_p (tparm
))
18691 return unify_invalid (explain_p
);
18693 if (TEMPLATE_TYPE_LEVEL (parm
)
18694 != template_decl_level (tparm
))
18695 /* The PARM is not one we're trying to unify. Just check
18696 to see if it matches ARG. */
18698 if (TREE_CODE (arg
) == TREE_CODE (parm
)
18699 && (is_auto (parm
) ? is_auto (arg
)
18700 : same_type_p (parm
, arg
)))
18701 return unify_success (explain_p
);
18703 return unify_type_mismatch (explain_p
, parm
, arg
);
18705 idx
= TEMPLATE_TYPE_IDX (parm
);
18706 targ
= TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
);
18707 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, idx
));
18708 if (error_operand_p (tparm
))
18709 return unify_invalid (explain_p
);
18711 /* Check for mixed types and values. */
18712 if ((TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
18713 && TREE_CODE (tparm
) != TYPE_DECL
)
18714 || (TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
18715 && TREE_CODE (tparm
) != TEMPLATE_DECL
))
18716 gcc_unreachable ();
18718 if (TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
18720 /* ARG must be constructed from a template class or a template
18721 template parameter. */
18722 if (TREE_CODE (arg
) != BOUND_TEMPLATE_TEMPLATE_PARM
18723 && !CLASSTYPE_SPECIALIZATION_OF_PRIMARY_TEMPLATE_P (arg
))
18724 return unify_template_deduction_failure (explain_p
, parm
, arg
);
18726 tree parmvec
= TYPE_TI_ARGS (parm
);
18727 /* An alias template name is never deduced. */
18728 if (TYPE_ALIAS_P (arg
))
18729 arg
= strip_typedefs (arg
);
18730 tree argvec
= INNERMOST_TEMPLATE_ARGS (TYPE_TI_ARGS (arg
));
18731 tree full_argvec
= add_to_template_args (targs
, argvec
);
18733 = DECL_INNERMOST_TEMPLATE_PARMS
18734 (TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL (parm
));
18736 int parm_variadic_p
= 0;
18738 /* The resolution to DR150 makes clear that default
18739 arguments for an N-argument may not be used to bind T
18740 to a template template parameter with fewer than N
18741 parameters. It is not safe to permit the binding of
18742 default arguments as an extension, as that may change
18743 the meaning of a conforming program. Consider:
18745 struct Dense { static const unsigned int dim = 1; };
18747 template <template <typename> class View,
18749 void operator+(float, View<Block> const&);
18751 template <typename Block,
18752 unsigned int Dim = Block::dim>
18753 struct Lvalue_proxy { operator float() const; };
18757 Lvalue_proxy<Dense> p;
18762 Here, if Lvalue_proxy is permitted to bind to View, then
18763 the global operator+ will be used; if they are not, the
18764 Lvalue_proxy will be converted to float. */
18765 if (coerce_template_parms (parm_parms
,
18767 TYPE_TI_TEMPLATE (parm
),
18769 ? tf_warning_or_error
18771 /*require_all_args=*/true,
18772 /*use_default_args=*/false)
18773 == error_mark_node
)
18776 /* Deduce arguments T, i from TT<T> or TT<i>.
18777 We check each element of PARMVEC and ARGVEC individually
18778 rather than the whole TREE_VEC since they can have
18779 different number of elements. */
18781 parmvec
= expand_template_argument_pack (parmvec
);
18782 argvec
= expand_template_argument_pack (argvec
);
18784 len
= TREE_VEC_LENGTH (parmvec
);
18786 /* Check if the parameters end in a pack, making them
18789 && PACK_EXPANSION_P (TREE_VEC_ELT (parmvec
, len
- 1)))
18790 parm_variadic_p
= 1;
18792 for (i
= 0; i
< len
- parm_variadic_p
; ++i
)
18793 /* If the template argument list of P contains a pack
18794 expansion that is not the last template argument, the
18795 entire template argument list is a non-deduced
18797 if (PACK_EXPANSION_P (TREE_VEC_ELT (parmvec
, i
)))
18798 return unify_success (explain_p
);
18800 if (TREE_VEC_LENGTH (argvec
) < len
- parm_variadic_p
)
18801 return unify_too_few_arguments (explain_p
,
18802 TREE_VEC_LENGTH (argvec
), len
);
18804 for (i
= 0; i
< len
- parm_variadic_p
; ++i
)
18806 RECUR_AND_CHECK_FAILURE (tparms
, targs
,
18807 TREE_VEC_ELT (parmvec
, i
),
18808 TREE_VEC_ELT (argvec
, i
),
18809 UNIFY_ALLOW_NONE
, explain_p
);
18812 if (parm_variadic_p
18813 && unify_pack_expansion (tparms
, targs
,
18816 /*subr=*/true, explain_p
))
18819 arg
= TYPE_TI_TEMPLATE (arg
);
18821 /* Fall through to deduce template name. */
18824 if (TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
18825 || TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
18827 /* Deduce template name TT from TT, TT<>, TT<T> and TT<i>. */
18829 /* Simple cases: Value already set, does match or doesn't. */
18830 if (targ
!= NULL_TREE
&& template_args_equal (targ
, arg
))
18831 return unify_success (explain_p
);
18833 return unify_inconsistency (explain_p
, parm
, targ
, arg
);
18837 /* If PARM is `const T' and ARG is only `int', we don't have
18838 a match unless we are allowing additional qualification.
18839 If ARG is `const int' and PARM is just `T' that's OK;
18840 that binds `const int' to `T'. */
18841 if (!check_cv_quals_for_unify (strict_in
| UNIFY_ALLOW_LESS_CV_QUAL
,
18843 return unify_cv_qual_mismatch (explain_p
, parm
, arg
);
18845 /* Consider the case where ARG is `const volatile int' and
18846 PARM is `const T'. Then, T should be `volatile int'. */
18847 arg
= cp_build_qualified_type_real
18848 (arg
, cp_type_quals (arg
) & ~cp_type_quals (parm
), tf_none
);
18849 if (arg
== error_mark_node
)
18850 return unify_invalid (explain_p
);
18852 /* Simple cases: Value already set, does match or doesn't. */
18853 if (targ
!= NULL_TREE
&& same_type_p (targ
, arg
))
18854 return unify_success (explain_p
);
18856 return unify_inconsistency (explain_p
, parm
, targ
, arg
);
18858 /* Make sure that ARG is not a variable-sized array. (Note
18859 that were talking about variable-sized arrays (like
18860 `int[n]'), rather than arrays of unknown size (like
18861 `int[]').) We'll get very confused by such a type since
18862 the bound of the array is not constant, and therefore
18863 not mangleable. Besides, such types are not allowed in
18864 ISO C++, so we can do as we please here. We do allow
18865 them for 'auto' deduction, since that isn't ABI-exposed. */
18866 if (!is_auto (parm
) && variably_modified_type_p (arg
, NULL_TREE
))
18867 return unify_vla_arg (explain_p
, arg
);
18869 /* Strip typedefs as in convert_template_argument. */
18870 arg
= canonicalize_type_argument (arg
, tf_none
);
18873 /* If ARG is a parameter pack or an expansion, we cannot unify
18874 against it unless PARM is also a parameter pack. */
18875 if ((template_parameter_pack_p (arg
) || PACK_EXPANSION_P (arg
))
18876 && !template_parameter_pack_p (parm
))
18877 return unify_parameter_pack_mismatch (explain_p
, parm
, arg
);
18879 /* If the argument deduction results is a METHOD_TYPE,
18880 then there is a problem.
18881 METHOD_TYPE doesn't map to any real C++ type the result of
18882 the deduction can not be of that type. */
18883 if (TREE_CODE (arg
) == METHOD_TYPE
)
18884 return unify_method_type_error (explain_p
, arg
);
18886 TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
) = arg
;
18887 return unify_success (explain_p
);
18889 case TEMPLATE_PARM_INDEX
:
18890 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, 0));
18891 if (error_operand_p (tparm
))
18892 return unify_invalid (explain_p
);
18894 if (TEMPLATE_PARM_LEVEL (parm
)
18895 != template_decl_level (tparm
))
18897 /* The PARM is not one we're trying to unify. Just check
18898 to see if it matches ARG. */
18899 int result
= !(TREE_CODE (arg
) == TREE_CODE (parm
)
18900 && cp_tree_equal (parm
, arg
));
18902 unify_expression_unequal (explain_p
, parm
, arg
);
18906 idx
= TEMPLATE_PARM_IDX (parm
);
18907 targ
= TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
);
18911 int x
= !cp_tree_equal (targ
, arg
);
18913 unify_inconsistency (explain_p
, parm
, targ
, arg
);
18917 /* [temp.deduct.type] If, in the declaration of a function template
18918 with a non-type template-parameter, the non-type
18919 template-parameter is used in an expression in the function
18920 parameter-list and, if the corresponding template-argument is
18921 deduced, the template-argument type shall match the type of the
18922 template-parameter exactly, except that a template-argument
18923 deduced from an array bound may be of any integral type.
18924 The non-type parameter might use already deduced type parameters. */
18925 tparm
= tsubst (TREE_TYPE (parm
), targs
, 0, NULL_TREE
);
18926 if (!TREE_TYPE (arg
))
18927 /* Template-parameter dependent expression. Just accept it for now.
18928 It will later be processed in convert_template_argument. */
18930 else if (same_type_p (TREE_TYPE (arg
), tparm
))
18932 else if ((strict
& UNIFY_ALLOW_INTEGER
)
18933 && CP_INTEGRAL_TYPE_P (tparm
))
18934 /* Convert the ARG to the type of PARM; the deduced non-type
18935 template argument must exactly match the types of the
18936 corresponding parameter. */
18937 arg
= fold (build_nop (tparm
, arg
));
18938 else if (uses_template_parms (tparm
))
18939 /* We haven't deduced the type of this parameter yet. Try again
18941 return unify_success (explain_p
);
18943 return unify_type_mismatch (explain_p
, tparm
, TREE_TYPE (arg
));
18945 /* If ARG is a parameter pack or an expansion, we cannot unify
18946 against it unless PARM is also a parameter pack. */
18947 if ((template_parameter_pack_p (arg
) || PACK_EXPANSION_P (arg
))
18948 && !TEMPLATE_PARM_PARAMETER_PACK (parm
))
18949 return unify_parameter_pack_mismatch (explain_p
, parm
, arg
);
18952 bool removed_attr
= false;
18953 arg
= strip_typedefs_expr (arg
, &removed_attr
);
18955 TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
) = arg
;
18956 return unify_success (explain_p
);
18960 /* A pointer-to-member constant can be unified only with
18961 another constant. */
18962 if (TREE_CODE (arg
) != PTRMEM_CST
)
18963 return unify_ptrmem_cst_mismatch (explain_p
, parm
, arg
);
18965 /* Just unify the class member. It would be useless (and possibly
18966 wrong, depending on the strict flags) to unify also
18967 PTRMEM_CST_CLASS, because we want to be sure that both parm and
18968 arg refer to the same variable, even if through different
18969 classes. For instance:
18971 struct A { int x; };
18974 Unification of &A::x and &B::x must succeed. */
18975 return unify (tparms
, targs
, PTRMEM_CST_MEMBER (parm
),
18976 PTRMEM_CST_MEMBER (arg
), strict
, explain_p
);
18981 if (!TYPE_PTR_P (arg
))
18982 return unify_type_mismatch (explain_p
, parm
, arg
);
18984 /* [temp.deduct.call]
18986 A can be another pointer or pointer to member type that can
18987 be converted to the deduced A via a qualification
18988 conversion (_conv.qual_).
18990 We pass down STRICT here rather than UNIFY_ALLOW_NONE.
18991 This will allow for additional cv-qualification of the
18992 pointed-to types if appropriate. */
18994 if (TREE_CODE (TREE_TYPE (arg
)) == RECORD_TYPE
)
18995 /* The derived-to-base conversion only persists through one
18996 level of pointers. */
18997 strict
|= (strict_in
& UNIFY_ALLOW_DERIVED
);
18999 return unify (tparms
, targs
, TREE_TYPE (parm
),
19000 TREE_TYPE (arg
), strict
, explain_p
);
19003 case REFERENCE_TYPE
:
19004 if (TREE_CODE (arg
) != REFERENCE_TYPE
)
19005 return unify_type_mismatch (explain_p
, parm
, arg
);
19006 return unify (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
19007 strict
& UNIFY_ALLOW_MORE_CV_QUAL
, explain_p
);
19010 if (TREE_CODE (arg
) != ARRAY_TYPE
)
19011 return unify_type_mismatch (explain_p
, parm
, arg
);
19012 if ((TYPE_DOMAIN (parm
) == NULL_TREE
)
19013 != (TYPE_DOMAIN (arg
) == NULL_TREE
))
19014 return unify_type_mismatch (explain_p
, parm
, arg
);
19015 RECUR_AND_CHECK_FAILURE (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
19016 strict
& UNIFY_ALLOW_MORE_CV_QUAL
, explain_p
);
19017 if (TYPE_DOMAIN (parm
) != NULL_TREE
)
19018 return unify_array_domain (tparms
, targs
, TYPE_DOMAIN (parm
),
19019 TYPE_DOMAIN (arg
), explain_p
);
19020 return unify_success (explain_p
);
19027 case ENUMERAL_TYPE
:
19030 if (TREE_CODE (arg
) != TREE_CODE (parm
))
19031 return unify_type_mismatch (explain_p
, parm
, arg
);
19033 /* We have already checked cv-qualification at the top of the
19035 if (!same_type_ignoring_top_level_qualifiers_p (arg
, parm
))
19036 return unify_type_mismatch (explain_p
, parm
, arg
);
19038 /* As far as unification is concerned, this wins. Later checks
19039 will invalidate it if necessary. */
19040 return unify_success (explain_p
);
19042 /* Types INTEGER_CST and MINUS_EXPR can come from array bounds. */
19043 /* Type INTEGER_CST can come from ordinary constant template args. */
19045 while (TREE_CODE (arg
) == NOP_EXPR
)
19046 arg
= TREE_OPERAND (arg
, 0);
19048 if (TREE_CODE (arg
) != INTEGER_CST
)
19049 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
19050 return (tree_int_cst_equal (parm
, arg
)
19051 ? unify_success (explain_p
)
19052 : unify_template_argument_mismatch (explain_p
, parm
, arg
));
19056 int i
, len
, argslen
;
19057 int parm_variadic_p
= 0;
19059 if (TREE_CODE (arg
) != TREE_VEC
)
19060 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
19062 len
= TREE_VEC_LENGTH (parm
);
19063 argslen
= TREE_VEC_LENGTH (arg
);
19065 /* Check for pack expansions in the parameters. */
19066 for (i
= 0; i
< len
; ++i
)
19068 if (PACK_EXPANSION_P (TREE_VEC_ELT (parm
, i
)))
19071 /* We can unify against something with a trailing
19073 parm_variadic_p
= 1;
19075 /* [temp.deduct.type]/9: If the template argument list of
19076 P contains a pack expansion that is not the last
19077 template argument, the entire template argument list
19078 is a non-deduced context. */
19079 return unify_success (explain_p
);
19083 /* If we don't have enough arguments to satisfy the parameters
19084 (not counting the pack expression at the end), or we have
19085 too many arguments for a parameter list that doesn't end in
19086 a pack expression, we can't unify. */
19087 if (parm_variadic_p
19088 ? argslen
< len
- parm_variadic_p
19090 return unify_arity (explain_p
, TREE_VEC_LENGTH (arg
), len
);
19092 /* Unify all of the parameters that precede the (optional)
19093 pack expression. */
19094 for (i
= 0; i
< len
- parm_variadic_p
; ++i
)
19096 RECUR_AND_CHECK_FAILURE (tparms
, targs
,
19097 TREE_VEC_ELT (parm
, i
),
19098 TREE_VEC_ELT (arg
, i
),
19099 UNIFY_ALLOW_NONE
, explain_p
);
19101 if (parm_variadic_p
)
19102 return unify_pack_expansion (tparms
, targs
, parm
, arg
,
19104 /*subr=*/true, explain_p
);
19105 return unify_success (explain_p
);
19110 if (TREE_CODE (arg
) != TREE_CODE (parm
))
19111 return unify_type_mismatch (explain_p
, parm
, arg
);
19113 if (TYPE_PTRMEMFUNC_P (parm
))
19115 if (!TYPE_PTRMEMFUNC_P (arg
))
19116 return unify_type_mismatch (explain_p
, parm
, arg
);
19118 return unify (tparms
, targs
,
19119 TYPE_PTRMEMFUNC_FN_TYPE (parm
),
19120 TYPE_PTRMEMFUNC_FN_TYPE (arg
),
19121 strict
, explain_p
);
19123 else if (TYPE_PTRMEMFUNC_P (arg
))
19124 return unify_type_mismatch (explain_p
, parm
, arg
);
19126 if (CLASSTYPE_TEMPLATE_INFO (parm
))
19128 tree t
= NULL_TREE
;
19130 if (strict_in
& UNIFY_ALLOW_DERIVED
)
19132 /* First, we try to unify the PARM and ARG directly. */
19133 t
= try_class_unification (tparms
, targs
,
19134 parm
, arg
, explain_p
);
19138 /* Fallback to the special case allowed in
19139 [temp.deduct.call]:
19141 If P is a class, and P has the form
19142 template-id, then A can be a derived class of
19143 the deduced A. Likewise, if P is a pointer to
19144 a class of the form template-id, A can be a
19145 pointer to a derived class pointed to by the
19147 enum template_base_result r
;
19148 r
= get_template_base (tparms
, targs
, parm
, arg
,
19152 return unify_no_common_base (explain_p
, r
, parm
, arg
);
19155 else if (CLASSTYPE_TEMPLATE_INFO (arg
)
19156 && (CLASSTYPE_TI_TEMPLATE (parm
)
19157 == CLASSTYPE_TI_TEMPLATE (arg
)))
19158 /* Perhaps PARM is something like S<U> and ARG is S<int>.
19159 Then, we should unify `int' and `U'. */
19162 /* There's no chance of unification succeeding. */
19163 return unify_type_mismatch (explain_p
, parm
, arg
);
19165 return unify (tparms
, targs
, CLASSTYPE_TI_ARGS (parm
),
19166 CLASSTYPE_TI_ARGS (t
), UNIFY_ALLOW_NONE
, explain_p
);
19168 else if (!same_type_ignoring_top_level_qualifiers_p (parm
, arg
))
19169 return unify_type_mismatch (explain_p
, parm
, arg
);
19170 return unify_success (explain_p
);
19173 case FUNCTION_TYPE
:
19175 unsigned int nargs
;
19180 if (TREE_CODE (arg
) != TREE_CODE (parm
))
19181 return unify_type_mismatch (explain_p
, parm
, arg
);
19183 /* CV qualifications for methods can never be deduced, they must
19184 match exactly. We need to check them explicitly here,
19185 because type_unification_real treats them as any other
19186 cv-qualified parameter. */
19187 if (TREE_CODE (parm
) == METHOD_TYPE
19188 && (!check_cv_quals_for_unify
19190 class_of_this_parm (arg
),
19191 class_of_this_parm (parm
))))
19192 return unify_cv_qual_mismatch (explain_p
, parm
, arg
);
19194 RECUR_AND_CHECK_FAILURE (tparms
, targs
, TREE_TYPE (parm
),
19195 TREE_TYPE (arg
), UNIFY_ALLOW_NONE
, explain_p
);
19197 nargs
= list_length (TYPE_ARG_TYPES (arg
));
19198 args
= XALLOCAVEC (tree
, nargs
);
19199 for (a
= TYPE_ARG_TYPES (arg
), i
= 0;
19200 a
!= NULL_TREE
&& a
!= void_list_node
;
19201 a
= TREE_CHAIN (a
), ++i
)
19202 args
[i
] = TREE_VALUE (a
);
19205 return type_unification_real (tparms
, targs
, TYPE_ARG_TYPES (parm
),
19206 args
, nargs
, 1, DEDUCE_EXACT
,
19207 LOOKUP_NORMAL
, NULL
, explain_p
);
19211 /* Unify a pointer to member with a pointer to member function, which
19212 deduces the type of the member as a function type. */
19213 if (TYPE_PTRMEMFUNC_P (arg
))
19215 /* Check top-level cv qualifiers */
19216 if (!check_cv_quals_for_unify (UNIFY_ALLOW_NONE
, arg
, parm
))
19217 return unify_cv_qual_mismatch (explain_p
, parm
, arg
);
19219 RECUR_AND_CHECK_FAILURE (tparms
, targs
, TYPE_OFFSET_BASETYPE (parm
),
19220 TYPE_PTRMEMFUNC_OBJECT_TYPE (arg
),
19221 UNIFY_ALLOW_NONE
, explain_p
);
19223 /* Determine the type of the function we are unifying against. */
19224 tree fntype
= static_fn_type (arg
);
19226 return unify (tparms
, targs
, TREE_TYPE (parm
), fntype
, strict
, explain_p
);
19229 if (TREE_CODE (arg
) != OFFSET_TYPE
)
19230 return unify_type_mismatch (explain_p
, parm
, arg
);
19231 RECUR_AND_CHECK_FAILURE (tparms
, targs
, TYPE_OFFSET_BASETYPE (parm
),
19232 TYPE_OFFSET_BASETYPE (arg
),
19233 UNIFY_ALLOW_NONE
, explain_p
);
19234 return unify (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
19235 strict
, explain_p
);
19238 if (DECL_TEMPLATE_PARM_P (parm
))
19239 return unify (tparms
, targs
, DECL_INITIAL (parm
), arg
, strict
, explain_p
);
19240 if (arg
!= scalar_constant_value (parm
))
19241 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
19242 return unify_success (explain_p
);
19245 case TEMPLATE_DECL
:
19246 /* Matched cases are handled by the ARG == PARM test above. */
19247 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
19250 /* A non-type template parameter that is a variable should be a
19251 an integral constant, in which case, it whould have been
19252 folded into its (constant) value. So we should not be getting
19253 a variable here. */
19254 gcc_unreachable ();
19256 case TYPE_ARGUMENT_PACK
:
19257 case NONTYPE_ARGUMENT_PACK
:
19258 return unify (tparms
, targs
, ARGUMENT_PACK_ARGS (parm
),
19259 ARGUMENT_PACK_ARGS (arg
), strict
, explain_p
);
19262 case DECLTYPE_TYPE
:
19263 case UNDERLYING_TYPE
:
19264 /* Cannot deduce anything from TYPEOF_TYPE, DECLTYPE_TYPE,
19265 or UNDERLYING_TYPE nodes. */
19266 return unify_success (explain_p
);
19269 /* Unification fails if we hit an error node. */
19270 return unify_invalid (explain_p
);
19273 if (REFERENCE_REF_P (parm
))
19275 if (REFERENCE_REF_P (arg
))
19276 arg
= TREE_OPERAND (arg
, 0);
19277 return unify (tparms
, targs
, TREE_OPERAND (parm
, 0), arg
,
19278 strict
, explain_p
);
19283 /* An unresolved overload is a nondeduced context. */
19284 if (is_overloaded_fn (parm
) || type_unknown_p (parm
))
19285 return unify_success (explain_p
);
19286 gcc_assert (EXPR_P (parm
));
19288 /* We must be looking at an expression. This can happen with
19292 void foo(S<I>, S<I + 2>);
19294 This is a "nondeduced context":
19298 The nondeduced contexts are:
19300 --A type that is a template-id in which one or more of
19301 the template-arguments is an expression that references
19302 a template-parameter.
19304 In these cases, we assume deduction succeeded, but don't
19305 actually infer any unifications. */
19307 if (!uses_template_parms (parm
)
19308 && !template_args_equal (parm
, arg
))
19309 return unify_expression_unequal (explain_p
, parm
, arg
);
19311 return unify_success (explain_p
);
19314 #undef RECUR_AND_CHECK_FAILURE
19316 /* Note that DECL can be defined in this translation unit, if
19320 mark_definable (tree decl
)
19323 DECL_NOT_REALLY_EXTERN (decl
) = 1;
19324 FOR_EACH_CLONE (clone
, decl
)
19325 DECL_NOT_REALLY_EXTERN (clone
) = 1;
19328 /* Called if RESULT is explicitly instantiated, or is a member of an
19329 explicitly instantiated class. */
19332 mark_decl_instantiated (tree result
, int extern_p
)
19334 SET_DECL_EXPLICIT_INSTANTIATION (result
);
19336 /* If this entity has already been written out, it's too late to
19337 make any modifications. */
19338 if (TREE_ASM_WRITTEN (result
))
19341 /* For anonymous namespace we don't need to do anything. */
19342 if (decl_anon_ns_mem_p (result
))
19344 gcc_assert (!TREE_PUBLIC (result
));
19348 if (TREE_CODE (result
) != FUNCTION_DECL
)
19349 /* The TREE_PUBLIC flag for function declarations will have been
19350 set correctly by tsubst. */
19351 TREE_PUBLIC (result
) = 1;
19353 /* This might have been set by an earlier implicit instantiation. */
19354 DECL_COMDAT (result
) = 0;
19357 DECL_NOT_REALLY_EXTERN (result
) = 0;
19360 mark_definable (result
);
19361 mark_needed (result
);
19362 /* Always make artificials weak. */
19363 if (DECL_ARTIFICIAL (result
) && flag_weak
)
19364 comdat_linkage (result
);
19365 /* For WIN32 we also want to put explicit instantiations in
19366 linkonce sections. */
19367 else if (TREE_PUBLIC (result
))
19368 maybe_make_one_only (result
);
19371 /* If EXTERN_P, then this function will not be emitted -- unless
19372 followed by an explicit instantiation, at which point its linkage
19373 will be adjusted. If !EXTERN_P, then this function will be
19374 emitted here. In neither circumstance do we want
19375 import_export_decl to adjust the linkage. */
19376 DECL_INTERFACE_KNOWN (result
) = 1;
19379 /* Subroutine of more_specialized_fn: check whether TARGS is missing any
19380 important template arguments. If any are missing, we check whether
19381 they're important by using error_mark_node for substituting into any
19382 args that were used for partial ordering (the ones between ARGS and END)
19383 and seeing if it bubbles up. */
19386 check_undeduced_parms (tree targs
, tree args
, tree end
)
19388 bool found
= false;
19390 for (i
= TREE_VEC_LENGTH (targs
) - 1; i
>= 0; --i
)
19391 if (TREE_VEC_ELT (targs
, i
) == NULL_TREE
)
19394 TREE_VEC_ELT (targs
, i
) = error_mark_node
;
19398 tree substed
= tsubst_arg_types (args
, targs
, end
, tf_none
, NULL_TREE
);
19399 if (substed
== error_mark_node
)
19405 /* Given two function templates PAT1 and PAT2, return:
19407 1 if PAT1 is more specialized than PAT2 as described in [temp.func.order].
19408 -1 if PAT2 is more specialized than PAT1.
19409 0 if neither is more specialized.
19411 LEN indicates the number of parameters we should consider
19412 (defaulted parameters should not be considered).
19414 The 1998 std underspecified function template partial ordering, and
19415 DR214 addresses the issue. We take pairs of arguments, one from
19416 each of the templates, and deduce them against each other. One of
19417 the templates will be more specialized if all the *other*
19418 template's arguments deduce against its arguments and at least one
19419 of its arguments *does* *not* deduce against the other template's
19420 corresponding argument. Deduction is done as for class templates.
19421 The arguments used in deduction have reference and top level cv
19422 qualifiers removed. Iff both arguments were originally reference
19423 types *and* deduction succeeds in both directions, an lvalue reference
19424 wins against an rvalue reference and otherwise the template
19425 with the more cv-qualified argument wins for that pairing (if
19426 neither is more cv-qualified, they both are equal). Unlike regular
19427 deduction, after all the arguments have been deduced in this way,
19428 we do *not* verify the deduced template argument values can be
19429 substituted into non-deduced contexts.
19431 The logic can be a bit confusing here, because we look at deduce1 and
19432 targs1 to see if pat2 is at least as specialized, and vice versa; if we
19433 can find template arguments for pat1 to make arg1 look like arg2, that
19434 means that arg2 is at least as specialized as arg1. */
19437 more_specialized_fn (tree pat1
, tree pat2
, int len
)
19439 tree decl1
= DECL_TEMPLATE_RESULT (pat1
);
19440 tree decl2
= DECL_TEMPLATE_RESULT (pat2
);
19441 tree targs1
= make_tree_vec (DECL_NTPARMS (pat1
));
19442 tree targs2
= make_tree_vec (DECL_NTPARMS (pat2
));
19443 tree tparms1
= DECL_INNERMOST_TEMPLATE_PARMS (pat1
);
19444 tree tparms2
= DECL_INNERMOST_TEMPLATE_PARMS (pat2
);
19445 tree args1
= TYPE_ARG_TYPES (TREE_TYPE (decl1
));
19446 tree args2
= TYPE_ARG_TYPES (TREE_TYPE (decl2
));
19447 tree origs1
, origs2
;
19448 bool lose1
= false;
19449 bool lose2
= false;
19451 /* Remove the this parameter from non-static member functions. If
19452 one is a non-static member function and the other is not a static
19453 member function, remove the first parameter from that function
19454 also. This situation occurs for operator functions where we
19455 locate both a member function (with this pointer) and non-member
19456 operator (with explicit first operand). */
19457 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl1
))
19459 len
--; /* LEN is the number of significant arguments for DECL1 */
19460 args1
= TREE_CHAIN (args1
);
19461 if (!DECL_STATIC_FUNCTION_P (decl2
))
19462 args2
= TREE_CHAIN (args2
);
19464 else if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl2
))
19466 args2
= TREE_CHAIN (args2
);
19467 if (!DECL_STATIC_FUNCTION_P (decl1
))
19470 args1
= TREE_CHAIN (args1
);
19474 /* If only one is a conversion operator, they are unordered. */
19475 if (DECL_CONV_FN_P (decl1
) != DECL_CONV_FN_P (decl2
))
19478 /* Consider the return type for a conversion function */
19479 if (DECL_CONV_FN_P (decl1
))
19481 args1
= tree_cons (NULL_TREE
, TREE_TYPE (TREE_TYPE (decl1
)), args1
);
19482 args2
= tree_cons (NULL_TREE
, TREE_TYPE (TREE_TYPE (decl2
)), args2
);
19486 processing_template_decl
++;
19492 /* Stop when an ellipsis is seen. */
19493 && args1
!= NULL_TREE
&& args2
!= NULL_TREE
)
19495 tree arg1
= TREE_VALUE (args1
);
19496 tree arg2
= TREE_VALUE (args2
);
19497 int deduce1
, deduce2
;
19503 if (TREE_CODE (arg1
) == TYPE_PACK_EXPANSION
19504 && TREE_CODE (arg2
) == TYPE_PACK_EXPANSION
)
19506 /* When both arguments are pack expansions, we need only
19507 unify the patterns themselves. */
19508 arg1
= PACK_EXPANSION_PATTERN (arg1
);
19509 arg2
= PACK_EXPANSION_PATTERN (arg2
);
19511 /* This is the last comparison we need to do. */
19515 if (TREE_CODE (arg1
) == REFERENCE_TYPE
)
19517 ref1
= TYPE_REF_IS_RVALUE (arg1
) + 1;
19518 arg1
= TREE_TYPE (arg1
);
19519 quals1
= cp_type_quals (arg1
);
19522 if (TREE_CODE (arg2
) == REFERENCE_TYPE
)
19524 ref2
= TYPE_REF_IS_RVALUE (arg2
) + 1;
19525 arg2
= TREE_TYPE (arg2
);
19526 quals2
= cp_type_quals (arg2
);
19529 arg1
= TYPE_MAIN_VARIANT (arg1
);
19530 arg2
= TYPE_MAIN_VARIANT (arg2
);
19532 if (TREE_CODE (arg1
) == TYPE_PACK_EXPANSION
)
19534 int i
, len2
= list_length (args2
);
19535 tree parmvec
= make_tree_vec (1);
19536 tree argvec
= make_tree_vec (len2
);
19539 /* Setup the parameter vector, which contains only ARG1. */
19540 TREE_VEC_ELT (parmvec
, 0) = arg1
;
19542 /* Setup the argument vector, which contains the remaining
19544 for (i
= 0; i
< len2
; i
++, ta
= TREE_CHAIN (ta
))
19545 TREE_VEC_ELT (argvec
, i
) = TREE_VALUE (ta
);
19547 deduce1
= (unify_pack_expansion (tparms1
, targs1
, parmvec
,
19548 argvec
, DEDUCE_EXACT
,
19549 /*subr=*/true, /*explain_p=*/false)
19552 /* We cannot deduce in the other direction, because ARG1 is
19553 a pack expansion but ARG2 is not. */
19556 else if (TREE_CODE (arg2
) == TYPE_PACK_EXPANSION
)
19558 int i
, len1
= list_length (args1
);
19559 tree parmvec
= make_tree_vec (1);
19560 tree argvec
= make_tree_vec (len1
);
19563 /* Setup the parameter vector, which contains only ARG1. */
19564 TREE_VEC_ELT (parmvec
, 0) = arg2
;
19566 /* Setup the argument vector, which contains the remaining
19568 for (i
= 0; i
< len1
; i
++, ta
= TREE_CHAIN (ta
))
19569 TREE_VEC_ELT (argvec
, i
) = TREE_VALUE (ta
);
19571 deduce2
= (unify_pack_expansion (tparms2
, targs2
, parmvec
,
19572 argvec
, DEDUCE_EXACT
,
19573 /*subr=*/true, /*explain_p=*/false)
19576 /* We cannot deduce in the other direction, because ARG2 is
19577 a pack expansion but ARG1 is not.*/
19583 /* The normal case, where neither argument is a pack
19585 deduce1
= (unify (tparms1
, targs1
, arg1
, arg2
,
19586 UNIFY_ALLOW_NONE
, /*explain_p=*/false)
19588 deduce2
= (unify (tparms2
, targs2
, arg2
, arg1
,
19589 UNIFY_ALLOW_NONE
, /*explain_p=*/false)
19593 /* If we couldn't deduce arguments for tparms1 to make arg1 match
19594 arg2, then arg2 is not as specialized as arg1. */
19600 /* "If, for a given type, deduction succeeds in both directions
19601 (i.e., the types are identical after the transformations above)
19602 and both P and A were reference types (before being replaced with
19603 the type referred to above):
19604 - if the type from the argument template was an lvalue reference and
19605 the type from the parameter template was not, the argument type is
19606 considered to be more specialized than the other; otherwise,
19607 - if the type from the argument template is more cv-qualified
19608 than the type from the parameter template (as described above),
19609 the argument type is considered to be more specialized than the other;
19611 - neither type is more specialized than the other." */
19613 if (deduce1
&& deduce2
)
19615 if (ref1
&& ref2
&& ref1
!= ref2
)
19622 else if (quals1
!= quals2
&& quals1
>= 0 && quals2
>= 0)
19624 if ((quals1
& quals2
) == quals2
)
19626 if ((quals1
& quals2
) == quals1
)
19631 if (lose1
&& lose2
)
19632 /* We've failed to deduce something in either direction.
19633 These must be unordered. */
19636 if (TREE_CODE (arg1
) == TYPE_PACK_EXPANSION
19637 || TREE_CODE (arg2
) == TYPE_PACK_EXPANSION
)
19638 /* We have already processed all of the arguments in our
19639 handing of the pack expansion type. */
19642 args1
= TREE_CHAIN (args1
);
19643 args2
= TREE_CHAIN (args2
);
19646 /* "In most cases, all template parameters must have values in order for
19647 deduction to succeed, but for partial ordering purposes a template
19648 parameter may remain without a value provided it is not used in the
19649 types being used for partial ordering."
19651 Thus, if we are missing any of the targs1 we need to substitute into
19652 origs1, then pat2 is not as specialized as pat1. This can happen when
19653 there is a nondeduced context. */
19654 if (!lose2
&& check_undeduced_parms (targs1
, origs1
, args1
))
19656 if (!lose1
&& check_undeduced_parms (targs2
, origs2
, args2
))
19659 processing_template_decl
--;
19661 /* If both deductions succeed, the partial ordering selects the more
19662 constrained template. */
19663 if (!lose1
&& !lose2
)
19665 tree c1
= get_constraints (DECL_TEMPLATE_RESULT (pat1
));
19666 tree c2
= get_constraints (DECL_TEMPLATE_RESULT (pat2
));
19667 lose1
= !subsumes_constraints (c1
, c2
);
19668 lose2
= !subsumes_constraints (c2
, c1
);
19671 /* All things being equal, if the next argument is a pack expansion
19672 for one function but not for the other, prefer the
19673 non-variadic function. FIXME this is bogus; see c++/41958. */
19675 && args1
&& TREE_VALUE (args1
)
19676 && args2
&& TREE_VALUE (args2
))
19678 lose1
= TREE_CODE (TREE_VALUE (args1
)) == TYPE_PACK_EXPANSION
;
19679 lose2
= TREE_CODE (TREE_VALUE (args2
)) == TYPE_PACK_EXPANSION
;
19682 if (lose1
== lose2
)
19690 /* Determine which of two partial specializations of TMPL is more
19693 PAT1 is a TREE_LIST whose TREE_VALUE is the TEMPLATE_DECL corresponding
19694 to the first partial specialization. The TREE_PURPOSE is the
19695 innermost set of template parameters for the partial
19696 specialization. PAT2 is similar, but for the second template.
19698 Return 1 if the first partial specialization is more specialized;
19699 -1 if the second is more specialized; 0 if neither is more
19702 See [temp.class.order] for information about determining which of
19703 two templates is more specialized. */
19706 more_specialized_partial_spec (tree tmpl
, tree pat1
, tree pat2
)
19710 bool any_deductions
= false;
19712 tree tmpl1
= TREE_VALUE (pat1
);
19713 tree tmpl2
= TREE_VALUE (pat2
);
19714 tree parms1
= DECL_INNERMOST_TEMPLATE_PARMS (tmpl1
);
19715 tree parms2
= DECL_INNERMOST_TEMPLATE_PARMS (tmpl2
);
19716 tree specargs1
= TI_ARGS (get_template_info (DECL_TEMPLATE_RESULT (tmpl1
)));
19717 tree specargs2
= TI_ARGS (get_template_info (DECL_TEMPLATE_RESULT (tmpl2
)));
19719 /* Just like what happens for functions, if we are ordering between
19720 different template specializations, we may encounter dependent
19721 types in the arguments, and we need our dependency check functions
19722 to behave correctly. */
19723 ++processing_template_decl
;
19724 targs
= get_partial_spec_bindings (tmpl
, parms1
, specargs1
, specargs2
);
19728 any_deductions
= true;
19731 targs
= get_partial_spec_bindings (tmpl
, parms2
, specargs2
, specargs1
);
19735 any_deductions
= true;
19737 --processing_template_decl
;
19739 /* If both deductions succeed, the partial ordering selects the more
19740 constrained template. */
19741 if (!winner
&& any_deductions
)
19742 return more_constrained (tmpl1
, tmpl2
);
19744 /* In the case of a tie where at least one of the templates
19745 has a parameter pack at the end, the template with the most
19746 non-packed parameters wins. */
19749 && (template_args_variadic_p (TREE_PURPOSE (pat1
))
19750 || template_args_variadic_p (TREE_PURPOSE (pat2
))))
19752 tree args1
= INNERMOST_TEMPLATE_ARGS (TREE_PURPOSE (pat1
));
19753 tree args2
= INNERMOST_TEMPLATE_ARGS (TREE_PURPOSE (pat2
));
19754 int len1
= TREE_VEC_LENGTH (args1
);
19755 int len2
= TREE_VEC_LENGTH (args2
);
19757 /* We don't count the pack expansion at the end. */
19758 if (template_args_variadic_p (TREE_PURPOSE (pat1
)))
19760 if (template_args_variadic_p (TREE_PURPOSE (pat2
)))
19765 else if (len1
< len2
)
19772 /* Return the template arguments that will produce the function signature
19773 DECL from the function template FN, with the explicit template
19774 arguments EXPLICIT_ARGS. If CHECK_RETTYPE is true, the return type must
19775 also match. Return NULL_TREE if no satisfactory arguments could be
19779 get_bindings (tree fn
, tree decl
, tree explicit_args
, bool check_rettype
)
19781 int ntparms
= DECL_NTPARMS (fn
);
19782 tree targs
= make_tree_vec (ntparms
);
19783 tree decl_type
= TREE_TYPE (decl
);
19784 tree decl_arg_types
;
19786 unsigned int nargs
, ix
;
19789 gcc_assert (decl
!= DECL_TEMPLATE_RESULT (fn
));
19791 /* Never do unification on the 'this' parameter. */
19792 decl_arg_types
= skip_artificial_parms_for (decl
,
19793 TYPE_ARG_TYPES (decl_type
));
19795 nargs
= list_length (decl_arg_types
);
19796 args
= XALLOCAVEC (tree
, nargs
);
19797 for (arg
= decl_arg_types
, ix
= 0;
19798 arg
!= NULL_TREE
&& arg
!= void_list_node
;
19799 arg
= TREE_CHAIN (arg
), ++ix
)
19800 args
[ix
] = TREE_VALUE (arg
);
19802 if (fn_type_unification (fn
, explicit_args
, targs
,
19804 (check_rettype
|| DECL_CONV_FN_P (fn
)
19805 ? TREE_TYPE (decl_type
) : NULL_TREE
),
19806 DEDUCE_EXACT
, LOOKUP_NORMAL
, /*explain_p=*/false,
19808 == error_mark_node
)
19814 /* Return the innermost template arguments that, when applied to a partial
19815 specialization of TMPL whose innermost template parameters are
19816 TPARMS, and whose specialization arguments are SPEC_ARGS, yield the
19819 For example, suppose we have:
19821 template <class T, class U> struct S {};
19822 template <class T> struct S<T*, int> {};
19824 Then, suppose we want to get `S<double*, int>'. The TPARMS will be
19825 {T}, the SPEC_ARGS will be {T*, int} and the ARGS will be {double*,
19826 int}. The resulting vector will be {double}, indicating that `T'
19827 is bound to `double'. */
19830 get_partial_spec_bindings (tree tmpl
, tree tparms
, tree spec_args
, tree args
)
19832 int i
, ntparms
= TREE_VEC_LENGTH (tparms
);
19834 tree innermost_deduced_args
;
19836 innermost_deduced_args
= make_tree_vec (ntparms
);
19837 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (args
))
19839 deduced_args
= copy_node (args
);
19840 SET_TMPL_ARGS_LEVEL (deduced_args
,
19841 TMPL_ARGS_DEPTH (deduced_args
),
19842 innermost_deduced_args
);
19845 deduced_args
= innermost_deduced_args
;
19847 if (unify (tparms
, deduced_args
,
19848 INNERMOST_TEMPLATE_ARGS (spec_args
),
19849 INNERMOST_TEMPLATE_ARGS (args
),
19850 UNIFY_ALLOW_NONE
, /*explain_p=*/false))
19853 for (i
= 0; i
< ntparms
; ++i
)
19854 if (! TREE_VEC_ELT (innermost_deduced_args
, i
))
19857 /* Verify that nondeduced template arguments agree with the type
19858 obtained from argument deduction.
19862 struct A { typedef int X; };
19863 template <class T, class U> struct C {};
19864 template <class T> struct C<T, typename T::X> {};
19866 Then with the instantiation `C<A, int>', we can deduce that
19867 `T' is `A' but unify () does not check whether `typename T::X'
19869 spec_args
= tsubst (spec_args
, deduced_args
, tf_none
, NULL_TREE
);
19870 spec_args
= coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (tmpl
),
19872 tf_none
, false, false);
19873 if (spec_args
== error_mark_node
19874 /* We only need to check the innermost arguments; the other
19875 arguments will always agree. */
19876 || !comp_template_args (INNERMOST_TEMPLATE_ARGS (spec_args
),
19877 INNERMOST_TEMPLATE_ARGS (args
)))
19880 /* Now that we have bindings for all of the template arguments,
19881 ensure that the arguments deduced for the template template
19882 parameters have compatible template parameter lists. See the use
19883 of template_template_parm_bindings_ok_p in fn_type_unification
19884 for more information. */
19885 if (!template_template_parm_bindings_ok_p (tparms
, deduced_args
))
19888 return deduced_args
;
19891 // Compare two function templates T1 and T2 by deducing bindings
19892 // from one against the other. If both deductions succeed, compare
19893 // constraints to see which is more constrained.
19895 more_specialized_inst (tree t1
, tree t2
)
19900 if (get_bindings (t1
, DECL_TEMPLATE_RESULT (t2
), NULL_TREE
, true))
19906 if (get_bindings (t2
, DECL_TEMPLATE_RESULT (t1
), NULL_TREE
, true))
19912 // If both deductions succeed, then one may be more constrained.
19913 if (count
== 2 && fate
== 0)
19914 fate
= more_constrained (t1
, t2
);
19919 /* TEMPLATES is a TREE_LIST. Each TREE_VALUE is a TEMPLATE_DECL.
19920 Return the TREE_LIST node with the most specialized template, if
19921 any. If there is no most specialized template, the error_mark_node
19924 Note that this function does not look at, or modify, the
19925 TREE_PURPOSE or TREE_TYPE of any of the nodes. Since the node
19926 returned is one of the elements of INSTANTIATIONS, callers may
19927 store information in the TREE_PURPOSE or TREE_TYPE of the nodes,
19928 and retrieve it from the value returned. */
19931 most_specialized_instantiation (tree templates
)
19935 ++processing_template_decl
;
19938 for (fn
= TREE_CHAIN (templates
); fn
; fn
= TREE_CHAIN (fn
))
19940 int fate
= more_specialized_inst (TREE_VALUE (champ
), TREE_VALUE (fn
));
19945 /* Equally specialized, move to next function. If there
19946 is no next function, nothing's most specialized. */
19947 fn
= TREE_CHAIN (fn
);
19955 /* Now verify that champ is better than everything earlier in the
19956 instantiation list. */
19957 for (fn
= templates
; fn
!= champ
; fn
= TREE_CHAIN (fn
)) {
19958 if (more_specialized_inst (TREE_VALUE (champ
), TREE_VALUE (fn
)) != 1)
19965 processing_template_decl
--;
19968 return error_mark_node
;
19973 /* If DECL is a specialization of some template, return the most
19974 general such template. Otherwise, returns NULL_TREE.
19976 For example, given:
19978 template <class T> struct S { template <class U> void f(U); };
19980 if TMPL is `template <class U> void S<int>::f(U)' this will return
19981 the full template. This function will not trace past partial
19982 specializations, however. For example, given in addition:
19984 template <class T> struct S<T*> { template <class U> void f(U); };
19986 if TMPL is `template <class U> void S<int*>::f(U)' this will return
19987 `template <class T> template <class U> S<T*>::f(U)'. */
19990 most_general_template (tree decl
)
19992 if (TREE_CODE (decl
) != TEMPLATE_DECL
)
19994 if (tree tinfo
= get_template_info (decl
))
19995 decl
= TI_TEMPLATE (tinfo
);
19996 /* The TI_TEMPLATE can be an IDENTIFIER_NODE for a
19997 template friend, or a FIELD_DECL for a capture pack. */
19998 if (TREE_CODE (decl
) != TEMPLATE_DECL
)
20002 /* Look for more and more general templates. */
20003 while (DECL_LANG_SPECIFIC (decl
) && DECL_TEMPLATE_INFO (decl
))
20005 /* The DECL_TI_TEMPLATE can be an IDENTIFIER_NODE in some cases.
20006 (See cp-tree.h for details.) */
20007 if (TREE_CODE (DECL_TI_TEMPLATE (decl
)) != TEMPLATE_DECL
)
20010 if (CLASS_TYPE_P (TREE_TYPE (decl
))
20011 && !TYPE_DECL_ALIAS_P (TYPE_NAME (TREE_TYPE (decl
)))
20012 && CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_TYPE (decl
)))
20015 /* Stop if we run into an explicitly specialized class template. */
20016 if (!DECL_NAMESPACE_SCOPE_P (decl
)
20017 && DECL_CONTEXT (decl
)
20018 && CLASSTYPE_TEMPLATE_SPECIALIZATION (DECL_CONTEXT (decl
)))
20021 decl
= DECL_TI_TEMPLATE (decl
);
20027 /* Return the most specialized of the template partial specializations
20028 which can produce TARGET, a specialization of some class or variable
20029 template. The value returned is actually a TREE_LIST; the TREE_VALUE is
20030 a TEMPLATE_DECL node corresponding to the partial specialization, while
20031 the TREE_PURPOSE is the set of template arguments that must be
20032 substituted into the template pattern in order to generate TARGET.
20034 If the choice of partial specialization is ambiguous, a diagnostic
20035 is issued, and the error_mark_node is returned. If there are no
20036 partial specializations matching TARGET, then NULL_TREE is
20037 returned, indicating that the primary template should be used. */
20040 most_specialized_partial_spec (tree target
, tsubst_flags_t complain
)
20042 tree list
= NULL_TREE
;
20047 tree outer_args
= NULL_TREE
;
20050 if (TYPE_P (target
))
20052 tree tinfo
= CLASSTYPE_TEMPLATE_INFO (target
);
20053 tmpl
= TI_TEMPLATE (tinfo
);
20054 args
= TI_ARGS (tinfo
);
20056 else if (TREE_CODE (target
) == TEMPLATE_ID_EXPR
)
20058 tmpl
= TREE_OPERAND (target
, 0);
20059 args
= TREE_OPERAND (target
, 1);
20061 else if (VAR_P (target
))
20063 tree tinfo
= DECL_TEMPLATE_INFO (target
);
20064 tmpl
= TI_TEMPLATE (tinfo
);
20065 args
= TI_ARGS (tinfo
);
20068 gcc_unreachable ();
20070 tree main_tmpl
= most_general_template (tmpl
);
20072 /* For determining which partial specialization to use, only the
20073 innermost args are interesting. */
20074 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (args
))
20076 outer_args
= strip_innermost_template_args (args
, 1);
20077 args
= INNERMOST_TEMPLATE_ARGS (args
);
20080 for (t
= DECL_TEMPLATE_SPECIALIZATIONS (main_tmpl
); t
; t
= TREE_CHAIN (t
))
20082 tree partial_spec_args
;
20084 tree spec_tmpl
= TREE_VALUE (t
);
20086 partial_spec_args
= TREE_PURPOSE (t
);
20088 ++processing_template_decl
;
20092 /* Discard the outer levels of args, and then substitute in the
20093 template args from the enclosing class. */
20094 partial_spec_args
= INNERMOST_TEMPLATE_ARGS (partial_spec_args
);
20095 partial_spec_args
= tsubst_template_args
20096 (partial_spec_args
, outer_args
, tf_none
, NULL_TREE
);
20098 /* And the same for the partial specialization TEMPLATE_DECL. */
20099 spec_tmpl
= tsubst (spec_tmpl
, outer_args
, tf_none
, NULL_TREE
);
20102 partial_spec_args
=
20103 coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (tmpl
),
20106 /*require_all_args=*/true,
20107 /*use_default_args=*/true);
20109 --processing_template_decl
;
20111 if (partial_spec_args
== error_mark_node
)
20112 return error_mark_node
;
20113 if (spec_tmpl
== error_mark_node
)
20114 return error_mark_node
;
20116 tree parms
= DECL_INNERMOST_TEMPLATE_PARMS (spec_tmpl
);
20117 spec_args
= get_partial_spec_bindings (tmpl
, parms
,
20123 spec_args
= add_to_template_args (outer_args
, spec_args
);
20125 /* Keep the candidate only if the constraints are satisfied,
20126 or if we're not compiling with concepts. */
20128 || constraints_satisfied_p (spec_tmpl
, spec_args
))
20130 list
= tree_cons (spec_args
, TREE_VALUE (t
), list
);
20131 TREE_TYPE (list
) = TREE_TYPE (t
);
20139 ambiguous_p
= false;
20142 t
= TREE_CHAIN (t
);
20143 for (; t
; t
= TREE_CHAIN (t
))
20145 fate
= more_specialized_partial_spec (tmpl
, champ
, t
);
20152 t
= TREE_CHAIN (t
);
20155 ambiguous_p
= true;
20164 for (t
= list
; t
&& t
!= champ
; t
= TREE_CHAIN (t
))
20166 fate
= more_specialized_partial_spec (tmpl
, champ
, t
);
20169 ambiguous_p
= true;
20177 char *spaces
= NULL
;
20178 if (!(complain
& tf_error
))
20179 return error_mark_node
;
20180 if (TYPE_P (target
))
20181 error ("ambiguous template instantiation for %q#T", target
);
20183 error ("ambiguous template instantiation for %q#D", target
);
20184 str
= ngettext ("candidate is:", "candidates are:", list_length (list
));
20185 for (t
= list
; t
; t
= TREE_CHAIN (t
))
20187 tree subst
= build_tree_list (TREE_VALUE (t
), TREE_PURPOSE (t
));
20188 inform (DECL_SOURCE_LOCATION (TREE_VALUE (t
)),
20189 "%s %#S", spaces
? spaces
: str
, subst
);
20190 spaces
= spaces
? spaces
: get_spaces (str
);
20193 return error_mark_node
;
20199 /* Explicitly instantiate DECL. */
20202 do_decl_instantiation (tree decl
, tree storage
)
20204 tree result
= NULL_TREE
;
20207 if (!decl
|| decl
== error_mark_node
)
20208 /* An error occurred, for which grokdeclarator has already issued
20209 an appropriate message. */
20211 else if (! DECL_LANG_SPECIFIC (decl
))
20213 error ("explicit instantiation of non-template %q#D", decl
);
20217 bool var_templ
= (DECL_TEMPLATE_INFO (decl
)
20218 && variable_template_p (DECL_TI_TEMPLATE (decl
)));
20220 if (VAR_P (decl
) && !var_templ
)
20222 /* There is an asymmetry here in the way VAR_DECLs and
20223 FUNCTION_DECLs are handled by grokdeclarator. In the case of
20224 the latter, the DECL we get back will be marked as a
20225 template instantiation, and the appropriate
20226 DECL_TEMPLATE_INFO will be set up. This does not happen for
20227 VAR_DECLs so we do the lookup here. Probably, grokdeclarator
20228 should handle VAR_DECLs as it currently handles
20230 if (!DECL_CLASS_SCOPE_P (decl
))
20232 error ("%qD is not a static data member of a class template", decl
);
20235 result
= lookup_field (DECL_CONTEXT (decl
), DECL_NAME (decl
), 0, false);
20236 if (!result
|| !VAR_P (result
))
20238 error ("no matching template for %qD found", decl
);
20241 if (!same_type_p (TREE_TYPE (result
), TREE_TYPE (decl
)))
20243 error ("type %qT for explicit instantiation %qD does not match "
20244 "declared type %qT", TREE_TYPE (result
), decl
,
20249 else if (TREE_CODE (decl
) != FUNCTION_DECL
&& !var_templ
)
20251 error ("explicit instantiation of %q#D", decl
);
20257 /* Check for various error cases. Note that if the explicit
20258 instantiation is valid the RESULT will currently be marked as an
20259 *implicit* instantiation; DECL_EXPLICIT_INSTANTIATION is not set
20260 until we get here. */
20262 if (DECL_TEMPLATE_SPECIALIZATION (result
))
20264 /* DR 259 [temp.spec].
20266 Both an explicit instantiation and a declaration of an explicit
20267 specialization shall not appear in a program unless the explicit
20268 instantiation follows a declaration of the explicit specialization.
20270 For a given set of template parameters, if an explicit
20271 instantiation of a template appears after a declaration of an
20272 explicit specialization for that template, the explicit
20273 instantiation has no effect. */
20276 else if (DECL_EXPLICIT_INSTANTIATION (result
))
20280 No program shall explicitly instantiate any template more
20283 We check DECL_NOT_REALLY_EXTERN so as not to complain when
20284 the first instantiation was `extern' and the second is not,
20285 and EXTERN_P for the opposite case. */
20286 if (DECL_NOT_REALLY_EXTERN (result
) && !extern_p
)
20287 permerror (input_location
, "duplicate explicit instantiation of %q#D", result
);
20288 /* If an "extern" explicit instantiation follows an ordinary
20289 explicit instantiation, the template is instantiated. */
20293 else if (!DECL_IMPLICIT_INSTANTIATION (result
))
20295 error ("no matching template for %qD found", result
);
20298 else if (!DECL_TEMPLATE_INFO (result
))
20300 permerror (input_location
, "explicit instantiation of non-template %q#D", result
);
20304 if (storage
== NULL_TREE
)
20306 else if (storage
== ridpointers
[(int) RID_EXTERN
])
20308 if (!in_system_header_at (input_location
) && (cxx_dialect
== cxx98
))
20309 pedwarn (input_location
, OPT_Wpedantic
,
20310 "ISO C++ 1998 forbids the use of %<extern%> on explicit "
20315 error ("storage class %qD applied to template instantiation", storage
);
20317 check_explicit_instantiation_namespace (result
);
20318 mark_decl_instantiated (result
, extern_p
);
20320 instantiate_decl (result
, /*defer_ok=*/1,
20321 /*expl_inst_class_mem_p=*/false);
20325 mark_class_instantiated (tree t
, int extern_p
)
20327 SET_CLASSTYPE_EXPLICIT_INSTANTIATION (t
);
20328 SET_CLASSTYPE_INTERFACE_KNOWN (t
);
20329 CLASSTYPE_INTERFACE_ONLY (t
) = extern_p
;
20330 TYPE_DECL_SUPPRESS_DEBUG (TYPE_NAME (t
)) = extern_p
;
20333 CLASSTYPE_DEBUG_REQUESTED (t
) = 1;
20334 rest_of_type_compilation (t
, 1);
20338 /* Called from do_type_instantiation through binding_table_foreach to
20339 do recursive instantiation for the type bound in ENTRY. */
20341 bt_instantiate_type_proc (binding_entry entry
, void *data
)
20343 tree storage
= *(tree
*) data
;
20345 if (MAYBE_CLASS_TYPE_P (entry
->type
)
20346 && !uses_template_parms (CLASSTYPE_TI_ARGS (entry
->type
)))
20347 do_type_instantiation (TYPE_MAIN_DECL (entry
->type
), storage
, 0);
20350 /* Called from do_type_instantiation to instantiate a member
20351 (a member function or a static member variable) of an
20352 explicitly instantiated class template. */
20354 instantiate_class_member (tree decl
, int extern_p
)
20356 mark_decl_instantiated (decl
, extern_p
);
20358 instantiate_decl (decl
, /*defer_ok=*/1,
20359 /*expl_inst_class_mem_p=*/true);
20362 /* Perform an explicit instantiation of template class T. STORAGE, if
20363 non-null, is the RID for extern, inline or static. COMPLAIN is
20364 nonzero if this is called from the parser, zero if called recursively,
20365 since the standard is unclear (as detailed below). */
20368 do_type_instantiation (tree t
, tree storage
, tsubst_flags_t complain
)
20373 int previous_instantiation_extern_p
= 0;
20375 if (TREE_CODE (t
) == TYPE_DECL
)
20378 if (! CLASS_TYPE_P (t
) || ! CLASSTYPE_TEMPLATE_INFO (t
))
20381 (TYPE_TEMPLATE_INFO (t
)) ? TYPE_TI_TEMPLATE (t
) : NULL
;
20383 error ("explicit instantiation of non-class template %qD", tmpl
);
20385 error ("explicit instantiation of non-template type %qT", t
);
20391 if (!COMPLETE_TYPE_P (t
))
20393 if (complain
& tf_error
)
20394 error ("explicit instantiation of %q#T before definition of template",
20399 if (storage
!= NULL_TREE
)
20401 if (!in_system_header_at (input_location
))
20403 if (storage
== ridpointers
[(int) RID_EXTERN
])
20405 if (cxx_dialect
== cxx98
)
20406 pedwarn (input_location
, OPT_Wpedantic
,
20407 "ISO C++ 1998 forbids the use of %<extern%> on "
20408 "explicit instantiations");
20411 pedwarn (input_location
, OPT_Wpedantic
,
20412 "ISO C++ forbids the use of %qE"
20413 " on explicit instantiations", storage
);
20416 if (storage
== ridpointers
[(int) RID_INLINE
])
20418 else if (storage
== ridpointers
[(int) RID_EXTERN
])
20420 else if (storage
== ridpointers
[(int) RID_STATIC
])
20424 error ("storage class %qD applied to template instantiation",
20430 if (CLASSTYPE_TEMPLATE_SPECIALIZATION (t
))
20432 /* DR 259 [temp.spec].
20434 Both an explicit instantiation and a declaration of an explicit
20435 specialization shall not appear in a program unless the explicit
20436 instantiation follows a declaration of the explicit specialization.
20438 For a given set of template parameters, if an explicit
20439 instantiation of a template appears after a declaration of an
20440 explicit specialization for that template, the explicit
20441 instantiation has no effect. */
20444 else if (CLASSTYPE_EXPLICIT_INSTANTIATION (t
))
20448 No program shall explicitly instantiate any template more
20451 If PREVIOUS_INSTANTIATION_EXTERN_P, then the first explicit
20452 instantiation was `extern'. If EXTERN_P then the second is.
20453 These cases are OK. */
20454 previous_instantiation_extern_p
= CLASSTYPE_INTERFACE_ONLY (t
);
20456 if (!previous_instantiation_extern_p
&& !extern_p
20457 && (complain
& tf_error
))
20458 permerror (input_location
, "duplicate explicit instantiation of %q#T", t
);
20460 /* If we've already instantiated the template, just return now. */
20461 if (!CLASSTYPE_INTERFACE_ONLY (t
))
20465 check_explicit_instantiation_namespace (TYPE_NAME (t
));
20466 mark_class_instantiated (t
, extern_p
);
20474 /* In contrast to implicit instantiation, where only the
20475 declarations, and not the definitions, of members are
20476 instantiated, we have here:
20480 The explicit instantiation of a class template specialization
20481 implies the instantiation of all of its members not
20482 previously explicitly specialized in the translation unit
20483 containing the explicit instantiation.
20485 Of course, we can't instantiate member template classes, since
20486 we don't have any arguments for them. Note that the standard
20487 is unclear on whether the instantiation of the members are
20488 *explicit* instantiations or not. However, the most natural
20489 interpretation is that it should be an explicit instantiation. */
20492 for (tmp
= TYPE_METHODS (t
); tmp
; tmp
= DECL_CHAIN (tmp
))
20493 if (TREE_CODE (tmp
) == FUNCTION_DECL
20494 && DECL_TEMPLATE_INSTANTIATION (tmp
))
20495 instantiate_class_member (tmp
, extern_p
);
20497 for (tmp
= TYPE_FIELDS (t
); tmp
; tmp
= DECL_CHAIN (tmp
))
20498 if (VAR_P (tmp
) && DECL_TEMPLATE_INSTANTIATION (tmp
))
20499 instantiate_class_member (tmp
, extern_p
);
20501 if (CLASSTYPE_NESTED_UTDS (t
))
20502 binding_table_foreach (CLASSTYPE_NESTED_UTDS (t
),
20503 bt_instantiate_type_proc
, &storage
);
20507 /* Given a function DECL, which is a specialization of TMPL, modify
20508 DECL to be a re-instantiation of TMPL with the same template
20509 arguments. TMPL should be the template into which tsubst'ing
20510 should occur for DECL, not the most general template.
20512 One reason for doing this is a scenario like this:
20515 void f(const T&, int i);
20517 void g() { f(3, 7); }
20520 void f(const T& t, const int i) { }
20522 Note that when the template is first instantiated, with
20523 instantiate_template, the resulting DECL will have no name for the
20524 first parameter, and the wrong type for the second. So, when we go
20525 to instantiate the DECL, we regenerate it. */
20528 regenerate_decl_from_template (tree decl
, tree tmpl
)
20530 /* The arguments used to instantiate DECL, from the most general
20535 args
= DECL_TI_ARGS (decl
);
20536 code_pattern
= DECL_TEMPLATE_RESULT (tmpl
);
20538 /* Make sure that we can see identifiers, and compute access
20540 push_access_scope (decl
);
20542 if (TREE_CODE (decl
) == FUNCTION_DECL
)
20550 args_depth
= TMPL_ARGS_DEPTH (args
);
20551 parms_depth
= TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl
));
20552 if (args_depth
> parms_depth
)
20553 args
= get_innermost_template_args (args
, parms_depth
);
20555 specs
= tsubst_exception_specification (TREE_TYPE (code_pattern
),
20556 args
, tf_error
, NULL_TREE
,
20557 /*defer_ok*/false);
20558 if (specs
&& specs
!= error_mark_node
)
20559 TREE_TYPE (decl
) = build_exception_variant (TREE_TYPE (decl
),
20562 /* Merge parameter declarations. */
20563 decl_parm
= skip_artificial_parms_for (decl
,
20564 DECL_ARGUMENTS (decl
));
20566 = skip_artificial_parms_for (code_pattern
,
20567 DECL_ARGUMENTS (code_pattern
));
20568 while (decl_parm
&& !DECL_PACK_P (pattern_parm
))
20573 if (DECL_NAME (decl_parm
) != DECL_NAME (pattern_parm
))
20574 DECL_NAME (decl_parm
) = DECL_NAME (pattern_parm
);
20575 parm_type
= tsubst (TREE_TYPE (pattern_parm
), args
, tf_error
,
20577 parm_type
= type_decays_to (parm_type
);
20578 if (!same_type_p (TREE_TYPE (decl_parm
), parm_type
))
20579 TREE_TYPE (decl_parm
) = parm_type
;
20580 attributes
= DECL_ATTRIBUTES (pattern_parm
);
20581 if (DECL_ATTRIBUTES (decl_parm
) != attributes
)
20583 DECL_ATTRIBUTES (decl_parm
) = attributes
;
20584 cplus_decl_attributes (&decl_parm
, attributes
, /*flags=*/0);
20586 decl_parm
= DECL_CHAIN (decl_parm
);
20587 pattern_parm
= DECL_CHAIN (pattern_parm
);
20589 /* Merge any parameters that match with the function parameter
20591 if (pattern_parm
&& DECL_PACK_P (pattern_parm
))
20594 tree expanded_types
;
20595 /* Expand the TYPE_PACK_EXPANSION that provides the types for
20596 the parameters in this function parameter pack. */
20597 expanded_types
= tsubst_pack_expansion (TREE_TYPE (pattern_parm
),
20598 args
, tf_error
, NULL_TREE
);
20599 len
= TREE_VEC_LENGTH (expanded_types
);
20600 for (i
= 0; i
< len
; i
++)
20605 if (DECL_NAME (decl_parm
) != DECL_NAME (pattern_parm
))
20606 /* Rename the parameter to include the index. */
20607 DECL_NAME (decl_parm
) =
20608 make_ith_pack_parameter_name (DECL_NAME (pattern_parm
), i
);
20609 parm_type
= TREE_VEC_ELT (expanded_types
, i
);
20610 parm_type
= type_decays_to (parm_type
);
20611 if (!same_type_p (TREE_TYPE (decl_parm
), parm_type
))
20612 TREE_TYPE (decl_parm
) = parm_type
;
20613 attributes
= DECL_ATTRIBUTES (pattern_parm
);
20614 if (DECL_ATTRIBUTES (decl_parm
) != attributes
)
20616 DECL_ATTRIBUTES (decl_parm
) = attributes
;
20617 cplus_decl_attributes (&decl_parm
, attributes
, /*flags=*/0);
20619 decl_parm
= DECL_CHAIN (decl_parm
);
20622 /* Merge additional specifiers from the CODE_PATTERN. */
20623 if (DECL_DECLARED_INLINE_P (code_pattern
)
20624 && !DECL_DECLARED_INLINE_P (decl
))
20625 DECL_DECLARED_INLINE_P (decl
) = 1;
20627 else if (VAR_P (decl
))
20629 DECL_INITIAL (decl
) =
20630 tsubst_expr (DECL_INITIAL (code_pattern
), args
,
20631 tf_error
, DECL_TI_TEMPLATE (decl
),
20632 /*integral_constant_expression_p=*/false);
20633 if (VAR_HAD_UNKNOWN_BOUND (decl
))
20634 TREE_TYPE (decl
) = tsubst (TREE_TYPE (code_pattern
), args
,
20635 tf_error
, DECL_TI_TEMPLATE (decl
));
20638 gcc_unreachable ();
20640 pop_access_scope (decl
);
20643 /* Return the TEMPLATE_DECL into which DECL_TI_ARGS(DECL) should be
20644 substituted to get DECL. */
20647 template_for_substitution (tree decl
)
20649 tree tmpl
= DECL_TI_TEMPLATE (decl
);
20651 /* Set TMPL to the template whose DECL_TEMPLATE_RESULT is the pattern
20652 for the instantiation. This is not always the most general
20653 template. Consider, for example:
20656 struct S { template <class U> void f();
20657 template <> void f<int>(); };
20659 and an instantiation of S<double>::f<int>. We want TD to be the
20660 specialization S<T>::f<int>, not the more general S<T>::f<U>. */
20661 while (/* An instantiation cannot have a definition, so we need a
20662 more general template. */
20663 DECL_TEMPLATE_INSTANTIATION (tmpl
)
20664 /* We must also deal with friend templates. Given:
20666 template <class T> struct S {
20667 template <class U> friend void f() {};
20670 S<int>::f<U> say, is not an instantiation of S<T>::f<U>,
20671 so far as the language is concerned, but that's still
20672 where we get the pattern for the instantiation from. On
20673 other hand, if the definition comes outside the class, say:
20675 template <class T> struct S {
20676 template <class U> friend void f();
20678 template <class U> friend void f() {}
20680 we don't need to look any further. That's what the check for
20681 DECL_INITIAL is for. */
20682 || (TREE_CODE (decl
) == FUNCTION_DECL
20683 && DECL_FRIEND_PSEUDO_TEMPLATE_INSTANTIATION (tmpl
)
20684 && !DECL_INITIAL (DECL_TEMPLATE_RESULT (tmpl
))))
20686 /* The present template, TD, should not be a definition. If it
20687 were a definition, we should be using it! Note that we
20688 cannot restructure the loop to just keep going until we find
20689 a template with a definition, since that might go too far if
20690 a specialization was declared, but not defined. */
20692 /* Fetch the more general template. */
20693 tmpl
= DECL_TI_TEMPLATE (tmpl
);
20699 /* Returns true if we need to instantiate this template instance even if we
20700 know we aren't going to emit it. */
20703 always_instantiate_p (tree decl
)
20705 /* We always instantiate inline functions so that we can inline them. An
20706 explicit instantiation declaration prohibits implicit instantiation of
20707 non-inline functions. With high levels of optimization, we would
20708 normally inline non-inline functions -- but we're not allowed to do
20709 that for "extern template" functions. Therefore, we check
20710 DECL_DECLARED_INLINE_P, rather than possibly_inlined_p. */
20711 return ((TREE_CODE (decl
) == FUNCTION_DECL
20712 && (DECL_DECLARED_INLINE_P (decl
)
20713 || type_uses_auto (TREE_TYPE (TREE_TYPE (decl
)))))
20714 /* And we need to instantiate static data members so that
20715 their initializers are available in integral constant
20718 && decl_maybe_constant_var_p (decl
)));
20721 /* If FN has a noexcept-specifier that hasn't been instantiated yet,
20722 instantiate it now, modifying TREE_TYPE (fn). */
20725 maybe_instantiate_noexcept (tree fn
)
20727 tree fntype
, spec
, noex
, clone
;
20729 /* Don't instantiate a noexcept-specification from template context. */
20730 if (processing_template_decl
)
20733 if (DECL_CLONED_FUNCTION_P (fn
))
20734 fn
= DECL_CLONED_FUNCTION (fn
);
20735 fntype
= TREE_TYPE (fn
);
20736 spec
= TYPE_RAISES_EXCEPTIONS (fntype
);
20738 if (!spec
|| !TREE_PURPOSE (spec
))
20741 noex
= TREE_PURPOSE (spec
);
20743 if (TREE_CODE (noex
) == DEFERRED_NOEXCEPT
)
20745 if (DEFERRED_NOEXCEPT_PATTERN (noex
) == NULL_TREE
)
20746 spec
= get_defaulted_eh_spec (fn
);
20747 else if (push_tinst_level (fn
))
20749 push_access_scope (fn
);
20750 push_deferring_access_checks (dk_no_deferred
);
20751 input_location
= DECL_SOURCE_LOCATION (fn
);
20752 noex
= tsubst_copy_and_build (DEFERRED_NOEXCEPT_PATTERN (noex
),
20753 DEFERRED_NOEXCEPT_ARGS (noex
),
20754 tf_warning_or_error
, fn
,
20755 /*function_p=*/false,
20756 /*integral_constant_expression_p=*/true);
20757 pop_deferring_access_checks ();
20758 pop_access_scope (fn
);
20759 pop_tinst_level ();
20760 spec
= build_noexcept_spec (noex
, tf_warning_or_error
);
20761 if (spec
== error_mark_node
)
20762 spec
= noexcept_false_spec
;
20765 spec
= noexcept_false_spec
;
20767 TREE_TYPE (fn
) = build_exception_variant (fntype
, spec
);
20770 FOR_EACH_CLONE (clone
, fn
)
20772 if (TREE_TYPE (clone
) == fntype
)
20773 TREE_TYPE (clone
) = TREE_TYPE (fn
);
20775 TREE_TYPE (clone
) = build_exception_variant (TREE_TYPE (clone
), spec
);
20779 /* Produce the definition of D, a _DECL generated from a template. If
20780 DEFER_OK is nonzero, then we don't have to actually do the
20781 instantiation now; we just have to do it sometime. Normally it is
20782 an error if this is an explicit instantiation but D is undefined.
20783 EXPL_INST_CLASS_MEM_P is true iff D is a member of an
20784 explicitly instantiated class template. */
20787 instantiate_decl (tree d
, int defer_ok
,
20788 bool expl_inst_class_mem_p
)
20790 tree tmpl
= DECL_TI_TEMPLATE (d
);
20797 bool pattern_defined
;
20798 location_t saved_loc
= input_location
;
20799 int saved_unevaluated_operand
= cp_unevaluated_operand
;
20800 int saved_inhibit_evaluation_warnings
= c_inhibit_evaluation_warnings
;
20806 /* This function should only be used to instantiate templates for
20807 functions and static member variables. */
20808 gcc_assert (VAR_OR_FUNCTION_DECL_P (d
));
20810 /* A concept is never instantiated. */
20811 gcc_assert (!DECL_DECLARED_CONCEPT_P (d
));
20813 /* Variables are never deferred; if instantiation is required, they
20814 are instantiated right away. That allows for better code in the
20815 case that an expression refers to the value of the variable --
20816 if the variable has a constant value the referring expression can
20817 take advantage of that fact. */
20819 || DECL_DECLARED_CONSTEXPR_P (d
))
20822 /* Don't instantiate cloned functions. Instead, instantiate the
20823 functions they cloned. */
20824 if (TREE_CODE (d
) == FUNCTION_DECL
&& DECL_CLONED_FUNCTION_P (d
))
20825 d
= DECL_CLONED_FUNCTION (d
);
20827 if (DECL_TEMPLATE_INSTANTIATED (d
)
20828 || (TREE_CODE (d
) == FUNCTION_DECL
20829 && DECL_DEFAULTED_FN (d
) && DECL_INITIAL (d
))
20830 || DECL_TEMPLATE_SPECIALIZATION (d
))
20831 /* D has already been instantiated or explicitly specialized, so
20832 there's nothing for us to do here.
20834 It might seem reasonable to check whether or not D is an explicit
20835 instantiation, and, if so, stop here. But when an explicit
20836 instantiation is deferred until the end of the compilation,
20837 DECL_EXPLICIT_INSTANTIATION is set, even though we still need to do
20838 the instantiation. */
20841 /* Check to see whether we know that this template will be
20842 instantiated in some other file, as with "extern template"
20844 external_p
= (DECL_INTERFACE_KNOWN (d
) && DECL_REALLY_EXTERN (d
));
20846 /* In general, we do not instantiate such templates. */
20847 if (external_p
&& !always_instantiate_p (d
))
20850 gen_tmpl
= most_general_template (tmpl
);
20851 gen_args
= DECL_TI_ARGS (d
);
20853 if (tmpl
!= gen_tmpl
)
20854 /* We should already have the extra args. */
20855 gcc_assert (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (gen_tmpl
))
20856 == TMPL_ARGS_DEPTH (gen_args
));
20857 /* And what's in the hash table should match D. */
20858 gcc_assert ((spec
= retrieve_specialization (gen_tmpl
, gen_args
, 0)) == d
20859 || spec
== NULL_TREE
);
20861 /* This needs to happen before any tsubsting. */
20862 if (! push_tinst_level (d
))
20865 timevar_push (TV_TEMPLATE_INST
);
20867 /* Set TD to the template whose DECL_TEMPLATE_RESULT is the pattern
20868 for the instantiation. */
20869 td
= template_for_substitution (d
);
20870 code_pattern
= DECL_TEMPLATE_RESULT (td
);
20872 /* We should never be trying to instantiate a member of a class
20873 template or partial specialization. */
20874 gcc_assert (d
!= code_pattern
);
20876 if ((DECL_NAMESPACE_SCOPE_P (d
) && !DECL_INITIALIZED_IN_CLASS_P (d
))
20877 || DECL_TEMPLATE_SPECIALIZATION (td
))
20878 /* In the case of a friend template whose definition is provided
20879 outside the class, we may have too many arguments. Drop the
20880 ones we don't need. The same is true for specializations. */
20881 args
= get_innermost_template_args
20882 (gen_args
, TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (td
)));
20886 if (TREE_CODE (d
) == FUNCTION_DECL
)
20888 deleted_p
= DECL_DELETED_FN (code_pattern
);
20889 pattern_defined
= (DECL_SAVED_TREE (code_pattern
) != NULL_TREE
20890 || DECL_DEFAULTED_OUTSIDE_CLASS_P (code_pattern
)
20896 pattern_defined
= ! DECL_IN_AGGR_P (code_pattern
);
20899 /* We may be in the middle of deferred access check. Disable it now. */
20900 push_deferring_access_checks (dk_no_deferred
);
20902 /* Unless an explicit instantiation directive has already determined
20903 the linkage of D, remember that a definition is available for
20905 if (pattern_defined
20906 && !DECL_INTERFACE_KNOWN (d
)
20907 && !DECL_NOT_REALLY_EXTERN (d
))
20908 mark_definable (d
);
20910 DECL_SOURCE_LOCATION (td
) = DECL_SOURCE_LOCATION (code_pattern
);
20911 DECL_SOURCE_LOCATION (d
) = DECL_SOURCE_LOCATION (code_pattern
);
20912 input_location
= DECL_SOURCE_LOCATION (d
);
20914 /* If D is a member of an explicitly instantiated class template,
20915 and no definition is available, treat it like an implicit
20917 if (!pattern_defined
&& expl_inst_class_mem_p
20918 && DECL_EXPLICIT_INSTANTIATION (d
))
20920 /* Leave linkage flags alone on instantiations with anonymous
20922 if (TREE_PUBLIC (d
))
20924 DECL_NOT_REALLY_EXTERN (d
) = 0;
20925 DECL_INTERFACE_KNOWN (d
) = 0;
20927 SET_DECL_IMPLICIT_INSTANTIATION (d
);
20930 /* Defer all other templates, unless we have been explicitly
20931 forbidden from doing so. */
20932 if (/* If there is no definition, we cannot instantiate the
20935 /* If it's OK to postpone instantiation, do so. */
20937 /* If this is a static data member that will be defined
20938 elsewhere, we don't want to instantiate the entire data
20939 member, but we do want to instantiate the initializer so that
20940 we can substitute that elsewhere. */
20941 || (external_p
&& VAR_P (d
))
20942 /* Handle here a deleted function too, avoid generating
20943 its body (c++/61080). */
20946 /* The definition of the static data member is now required so
20947 we must substitute the initializer. */
20949 && !DECL_INITIAL (d
)
20950 && DECL_INITIAL (code_pattern
))
20954 bool const_init
= false;
20955 bool enter_context
= DECL_CLASS_SCOPE_P (d
);
20957 ns
= decl_namespace_context (d
);
20958 push_nested_namespace (ns
);
20960 push_nested_class (DECL_CONTEXT (d
));
20961 init
= tsubst_expr (DECL_INITIAL (code_pattern
),
20963 tf_warning_or_error
, NULL_TREE
,
20964 /*integral_constant_expression_p=*/false);
20965 /* If instantiating the initializer involved instantiating this
20966 again, don't call cp_finish_decl twice. */
20967 if (!DECL_INITIAL (d
))
20969 /* Make sure the initializer is still constant, in case of
20970 circular dependency (template/instantiate6.C). */
20972 = DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (code_pattern
);
20973 cp_finish_decl (d
, init
, /*init_const_expr_p=*/const_init
,
20974 /*asmspec_tree=*/NULL_TREE
,
20975 LOOKUP_ONLYCONVERTING
);
20978 pop_nested_class ();
20979 pop_nested_namespace (ns
);
20982 /* We restore the source position here because it's used by
20983 add_pending_template. */
20984 input_location
= saved_loc
;
20986 if (at_eof
&& !pattern_defined
20987 && DECL_EXPLICIT_INSTANTIATION (d
)
20988 && DECL_NOT_REALLY_EXTERN (d
))
20991 The definition of a non-exported function template, a
20992 non-exported member function template, or a non-exported
20993 member function or static data member of a class template
20994 shall be present in every translation unit in which it is
20995 explicitly instantiated. */
20996 permerror (input_location
, "explicit instantiation of %qD "
20997 "but no definition available", d
);
20999 /* If we're in unevaluated context, we just wanted to get the
21000 constant value; this isn't an odr use, so don't queue
21001 a full instantiation. */
21002 if (cp_unevaluated_operand
!= 0)
21004 /* ??? Historically, we have instantiated inline functions, even
21005 when marked as "extern template". */
21006 if (!(external_p
&& VAR_P (d
)))
21007 add_pending_template (d
);
21010 /* Tell the repository that D is available in this translation unit
21011 -- and see if it is supposed to be instantiated here. */
21012 if (TREE_PUBLIC (d
) && !DECL_REALLY_EXTERN (d
) && !repo_emit_p (d
))
21014 /* In a PCH file, despite the fact that the repository hasn't
21015 requested instantiation in the PCH it is still possible that
21016 an instantiation will be required in a file that includes the
21019 add_pending_template (d
);
21020 /* Instantiate inline functions so that the inliner can do its
21021 job, even though we'll not be emitting a copy of this
21023 if (!(TREE_CODE (d
) == FUNCTION_DECL
&& possibly_inlined_p (d
)))
21027 fn_context
= decl_function_context (d
);
21028 nested
= (current_function_decl
!= NULL_TREE
);
21030 push_to_top_level ();
21034 push_function_context ();
21035 cp_unevaluated_operand
= 0;
21036 c_inhibit_evaluation_warnings
= 0;
21039 /* Mark D as instantiated so that recursive calls to
21040 instantiate_decl do not try to instantiate it again. */
21041 DECL_TEMPLATE_INSTANTIATED (d
) = 1;
21043 /* Regenerate the declaration in case the template has been modified
21044 by a subsequent redeclaration. */
21045 regenerate_decl_from_template (d
, td
);
21047 /* We already set the file and line above. Reset them now in case
21048 they changed as a result of calling regenerate_decl_from_template. */
21049 input_location
= DECL_SOURCE_LOCATION (d
);
21054 bool const_init
= false;
21056 /* Clear out DECL_RTL; whatever was there before may not be right
21057 since we've reset the type of the declaration. */
21058 SET_DECL_RTL (d
, NULL
);
21059 DECL_IN_AGGR_P (d
) = 0;
21061 /* The initializer is placed in DECL_INITIAL by
21062 regenerate_decl_from_template so we don't need to
21063 push/pop_access_scope again here. Pull it out so that
21064 cp_finish_decl can process it. */
21065 init
= DECL_INITIAL (d
);
21066 DECL_INITIAL (d
) = NULL_TREE
;
21067 DECL_INITIALIZED_P (d
) = 0;
21069 /* Clear DECL_EXTERNAL so that cp_finish_decl will process the
21070 initializer. That function will defer actual emission until
21071 we have a chance to determine linkage. */
21072 DECL_EXTERNAL (d
) = 0;
21074 /* Enter the scope of D so that access-checking works correctly. */
21075 bool enter_context
= DECL_CLASS_SCOPE_P (d
);
21077 push_nested_class (DECL_CONTEXT (d
));
21079 const_init
= DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (code_pattern
);
21080 cp_finish_decl (d
, init
, const_init
, NULL_TREE
, 0);
21083 pop_nested_class ();
21085 if (variable_template_p (td
))
21086 note_variable_template_instantiation (d
);
21088 else if (TREE_CODE (d
) == FUNCTION_DECL
&& DECL_DEFAULTED_FN (code_pattern
))
21089 synthesize_method (d
);
21090 else if (TREE_CODE (d
) == FUNCTION_DECL
)
21092 hash_map
<tree
, tree
> *saved_local_specializations
;
21096 tree block
= NULL_TREE
;
21098 /* Save away the current list, in case we are instantiating one
21099 template from within the body of another. */
21100 saved_local_specializations
= local_specializations
;
21102 /* Set up the list of local specializations. */
21103 local_specializations
= new hash_map
<tree
, tree
>;
21105 /* Set up context. */
21106 if (DECL_OMP_DECLARE_REDUCTION_P (code_pattern
)
21107 && TREE_CODE (DECL_CONTEXT (code_pattern
)) == FUNCTION_DECL
)
21108 block
= push_stmt_list ();
21110 start_preparsed_function (d
, NULL_TREE
, SF_PRE_PARSED
);
21112 /* Some typedefs referenced from within the template code need to be
21113 access checked at template instantiation time, i.e now. These
21114 types were added to the template at parsing time. Let's get those
21115 and perform the access checks then. */
21116 perform_typedefs_access_check (DECL_TEMPLATE_RESULT (gen_tmpl
),
21119 /* Create substitution entries for the parameters. */
21120 subst_decl
= DECL_TEMPLATE_RESULT (template_for_substitution (d
));
21121 tmpl_parm
= DECL_ARGUMENTS (subst_decl
);
21122 spec_parm
= DECL_ARGUMENTS (d
);
21123 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (d
))
21125 register_local_specialization (spec_parm
, tmpl_parm
);
21126 spec_parm
= skip_artificial_parms_for (d
, spec_parm
);
21127 tmpl_parm
= skip_artificial_parms_for (subst_decl
, tmpl_parm
);
21129 for (; tmpl_parm
; tmpl_parm
= DECL_CHAIN (tmpl_parm
))
21131 if (!DECL_PACK_P (tmpl_parm
))
21133 register_local_specialization (spec_parm
, tmpl_parm
);
21134 spec_parm
= DECL_CHAIN (spec_parm
);
21138 /* Register the (value) argument pack as a specialization of
21139 TMPL_PARM, then move on. */
21140 tree argpack
= extract_fnparm_pack (tmpl_parm
, &spec_parm
);
21141 register_local_specialization (argpack
, tmpl_parm
);
21144 gcc_assert (!spec_parm
);
21146 /* Substitute into the body of the function. */
21147 if (DECL_OMP_DECLARE_REDUCTION_P (code_pattern
))
21148 tsubst_omp_udr (DECL_SAVED_TREE (code_pattern
), args
,
21149 tf_warning_or_error
, tmpl
);
21152 tsubst_expr (DECL_SAVED_TREE (code_pattern
), args
,
21153 tf_warning_or_error
, tmpl
,
21154 /*integral_constant_expression_p=*/false);
21156 /* Set the current input_location to the end of the function
21157 so that finish_function knows where we are. */
21159 = DECL_STRUCT_FUNCTION (code_pattern
)->function_end_locus
;
21161 /* Remember if we saw an infinite loop in the template. */
21162 current_function_infinite_loop
21163 = DECL_STRUCT_FUNCTION (code_pattern
)->language
->infinite_loop
;
21166 /* We don't need the local specializations any more. */
21167 delete local_specializations
;
21168 local_specializations
= saved_local_specializations
;
21170 /* Finish the function. */
21171 if (DECL_OMP_DECLARE_REDUCTION_P (code_pattern
)
21172 && TREE_CODE (DECL_CONTEXT (code_pattern
)) == FUNCTION_DECL
)
21173 DECL_SAVED_TREE (d
) = pop_stmt_list (block
);
21176 d
= finish_function (0);
21177 expand_or_defer_fn (d
);
21180 if (DECL_OMP_DECLARE_REDUCTION_P (code_pattern
))
21181 cp_check_omp_declare_reduction (d
);
21184 /* We're not deferring instantiation any more. */
21185 TI_PENDING_TEMPLATE_FLAG (DECL_TEMPLATE_INFO (d
)) = 0;
21188 pop_from_top_level ();
21190 pop_function_context ();
21193 input_location
= saved_loc
;
21194 cp_unevaluated_operand
= saved_unevaluated_operand
;
21195 c_inhibit_evaluation_warnings
= saved_inhibit_evaluation_warnings
;
21196 pop_deferring_access_checks ();
21197 pop_tinst_level ();
21199 timevar_pop (TV_TEMPLATE_INST
);
21204 /* Run through the list of templates that we wish we could
21205 instantiate, and instantiate any we can. RETRIES is the
21206 number of times we retry pending template instantiation. */
21209 instantiate_pending_templates (int retries
)
21212 location_t saved_loc
= input_location
;
21214 /* Instantiating templates may trigger vtable generation. This in turn
21215 may require further template instantiations. We place a limit here
21216 to avoid infinite loop. */
21217 if (pending_templates
&& retries
>= max_tinst_depth
)
21219 tree decl
= pending_templates
->tinst
->decl
;
21221 fatal_error (input_location
,
21222 "template instantiation depth exceeds maximum of %d"
21223 " instantiating %q+D, possibly from virtual table generation"
21224 " (use -ftemplate-depth= to increase the maximum)",
21225 max_tinst_depth
, decl
);
21226 if (TREE_CODE (decl
) == FUNCTION_DECL
)
21227 /* Pretend that we defined it. */
21228 DECL_INITIAL (decl
) = error_mark_node
;
21234 struct pending_template
**t
= &pending_templates
;
21235 struct pending_template
*last
= NULL
;
21239 tree instantiation
= reopen_tinst_level ((*t
)->tinst
);
21240 bool complete
= false;
21242 if (TYPE_P (instantiation
))
21246 if (!COMPLETE_TYPE_P (instantiation
))
21248 instantiate_class_template (instantiation
);
21249 if (CLASSTYPE_TEMPLATE_INSTANTIATION (instantiation
))
21250 for (fn
= TYPE_METHODS (instantiation
);
21252 fn
= TREE_CHAIN (fn
))
21253 if (! DECL_ARTIFICIAL (fn
))
21254 instantiate_decl (fn
,
21256 /*expl_inst_class_mem_p=*/false);
21257 if (COMPLETE_TYPE_P (instantiation
))
21261 complete
= COMPLETE_TYPE_P (instantiation
);
21265 if (!DECL_TEMPLATE_SPECIALIZATION (instantiation
)
21266 && !DECL_TEMPLATE_INSTANTIATED (instantiation
))
21269 = instantiate_decl (instantiation
,
21271 /*expl_inst_class_mem_p=*/false);
21272 if (DECL_TEMPLATE_INSTANTIATED (instantiation
))
21276 complete
= (DECL_TEMPLATE_SPECIALIZATION (instantiation
)
21277 || DECL_TEMPLATE_INSTANTIATED (instantiation
));
21281 /* If INSTANTIATION has been instantiated, then we don't
21282 need to consider it again in the future. */
21290 current_tinst_level
= NULL
;
21292 last_pending_template
= last
;
21294 while (reconsider
);
21296 input_location
= saved_loc
;
21299 /* Substitute ARGVEC into T, which is a list of initializers for
21300 either base class or a non-static data member. The TREE_PURPOSEs
21301 are DECLs, and the TREE_VALUEs are the initializer values. Used by
21302 instantiate_decl. */
21305 tsubst_initializer_list (tree t
, tree argvec
)
21307 tree inits
= NULL_TREE
;
21309 for (; t
; t
= TREE_CHAIN (t
))
21313 tree expanded_bases
= NULL_TREE
;
21314 tree expanded_arguments
= NULL_TREE
;
21317 if (TREE_CODE (TREE_PURPOSE (t
)) == TYPE_PACK_EXPANSION
)
21322 /* Expand the base class expansion type into separate base
21324 expanded_bases
= tsubst_pack_expansion (TREE_PURPOSE (t
), argvec
,
21325 tf_warning_or_error
,
21327 if (expanded_bases
== error_mark_node
)
21330 /* We'll be building separate TREE_LISTs of arguments for
21332 len
= TREE_VEC_LENGTH (expanded_bases
);
21333 expanded_arguments
= make_tree_vec (len
);
21334 for (i
= 0; i
< len
; i
++)
21335 TREE_VEC_ELT (expanded_arguments
, i
) = NULL_TREE
;
21337 /* Build a dummy EXPR_PACK_EXPANSION that will be used to
21338 expand each argument in the TREE_VALUE of t. */
21339 expr
= make_node (EXPR_PACK_EXPANSION
);
21340 PACK_EXPANSION_LOCAL_P (expr
) = true;
21341 PACK_EXPANSION_PARAMETER_PACKS (expr
) =
21342 PACK_EXPANSION_PARAMETER_PACKS (TREE_PURPOSE (t
));
21344 if (TREE_VALUE (t
) == void_type_node
)
21345 /* VOID_TYPE_NODE is used to indicate
21346 value-initialization. */
21348 for (i
= 0; i
< len
; i
++)
21349 TREE_VEC_ELT (expanded_arguments
, i
) = void_type_node
;
21353 /* Substitute parameter packs into each argument in the
21355 in_base_initializer
= 1;
21356 for (arg
= TREE_VALUE (t
); arg
; arg
= TREE_CHAIN (arg
))
21358 tree expanded_exprs
;
21360 /* Expand the argument. */
21361 SET_PACK_EXPANSION_PATTERN (expr
, TREE_VALUE (arg
));
21363 = tsubst_pack_expansion (expr
, argvec
,
21364 tf_warning_or_error
,
21366 if (expanded_exprs
== error_mark_node
)
21369 /* Prepend each of the expanded expressions to the
21370 corresponding TREE_LIST in EXPANDED_ARGUMENTS. */
21371 for (i
= 0; i
< len
; i
++)
21373 TREE_VEC_ELT (expanded_arguments
, i
) =
21374 tree_cons (NULL_TREE
,
21375 TREE_VEC_ELT (expanded_exprs
, i
),
21376 TREE_VEC_ELT (expanded_arguments
, i
));
21379 in_base_initializer
= 0;
21381 /* Reverse all of the TREE_LISTs in EXPANDED_ARGUMENTS,
21382 since we built them backwards. */
21383 for (i
= 0; i
< len
; i
++)
21385 TREE_VEC_ELT (expanded_arguments
, i
) =
21386 nreverse (TREE_VEC_ELT (expanded_arguments
, i
));
21391 for (i
= 0; i
< len
; ++i
)
21393 if (expanded_bases
)
21395 decl
= TREE_VEC_ELT (expanded_bases
, i
);
21396 decl
= expand_member_init (decl
);
21397 init
= TREE_VEC_ELT (expanded_arguments
, i
);
21402 decl
= tsubst_copy (TREE_PURPOSE (t
), argvec
,
21403 tf_warning_or_error
, NULL_TREE
);
21405 decl
= expand_member_init (decl
);
21406 if (decl
&& !DECL_P (decl
))
21407 in_base_initializer
= 1;
21409 init
= TREE_VALUE (t
);
21411 if (init
!= void_type_node
)
21412 init
= tsubst_expr (init
, argvec
,
21413 tf_warning_or_error
, NULL_TREE
,
21414 /*integral_constant_expression_p=*/false);
21415 if (init
== NULL_TREE
&& tmp
!= NULL_TREE
)
21416 /* If we had an initializer but it instantiated to nothing,
21417 value-initialize the object. This will only occur when
21418 the initializer was a pack expansion where the parameter
21419 packs used in that expansion were of length zero. */
21420 init
= void_type_node
;
21421 in_base_initializer
= 0;
21426 init
= build_tree_list (decl
, init
);
21427 TREE_CHAIN (init
) = inits
;
21435 /* Set CURRENT_ACCESS_SPECIFIER based on the protection of DECL. */
21438 set_current_access_from_decl (tree decl
)
21440 if (TREE_PRIVATE (decl
))
21441 current_access_specifier
= access_private_node
;
21442 else if (TREE_PROTECTED (decl
))
21443 current_access_specifier
= access_protected_node
;
21445 current_access_specifier
= access_public_node
;
21448 /* Instantiate an enumerated type. TAG is the template type, NEWTAG
21449 is the instantiation (which should have been created with
21450 start_enum) and ARGS are the template arguments to use. */
21453 tsubst_enum (tree tag
, tree newtag
, tree args
)
21457 if (SCOPED_ENUM_P (newtag
))
21458 begin_scope (sk_scoped_enum
, newtag
);
21460 for (e
= TYPE_VALUES (tag
); e
; e
= TREE_CHAIN (e
))
21465 decl
= TREE_VALUE (e
);
21466 /* Note that in a template enum, the TREE_VALUE is the
21467 CONST_DECL, not the corresponding INTEGER_CST. */
21468 value
= tsubst_expr (DECL_INITIAL (decl
),
21469 args
, tf_warning_or_error
, NULL_TREE
,
21470 /*integral_constant_expression_p=*/true);
21472 /* Give this enumeration constant the correct access. */
21473 set_current_access_from_decl (decl
);
21475 /* Actually build the enumerator itself. Here we're assuming that
21476 enumerators can't have dependent attributes. */
21477 build_enumerator (DECL_NAME (decl
), value
, newtag
,
21478 DECL_ATTRIBUTES (decl
), DECL_SOURCE_LOCATION (decl
));
21481 if (SCOPED_ENUM_P (newtag
))
21484 finish_enum_value_list (newtag
);
21485 finish_enum (newtag
);
21487 DECL_SOURCE_LOCATION (TYPE_NAME (newtag
))
21488 = DECL_SOURCE_LOCATION (TYPE_NAME (tag
));
21491 /* DECL is a FUNCTION_DECL that is a template specialization. Return
21492 its type -- but without substituting the innermost set of template
21493 arguments. So, innermost set of template parameters will appear in
21497 get_mostly_instantiated_function_type (tree decl
)
21499 /* For a function, DECL_TI_TEMPLATE is partially instantiated. */
21500 return TREE_TYPE (DECL_TI_TEMPLATE (decl
));
21503 /* Return truthvalue if we're processing a template different from
21504 the last one involved in diagnostics. */
21506 problematic_instantiation_changed (void)
21508 return current_tinst_level
!= last_error_tinst_level
;
21511 /* Remember current template involved in diagnostics. */
21513 record_last_problematic_instantiation (void)
21515 last_error_tinst_level
= current_tinst_level
;
21518 struct tinst_level
*
21519 current_instantiation (void)
21521 return current_tinst_level
;
21524 /* Return TRUE if current_function_decl is being instantiated, false
21528 instantiating_current_function_p (void)
21530 return (current_instantiation ()
21531 && current_instantiation ()->decl
== current_function_decl
);
21534 /* [temp.param] Check that template non-type parm TYPE is of an allowable
21535 type. Return zero for ok, nonzero for disallowed. Issue error and
21536 warning messages under control of COMPLAIN. */
21539 invalid_nontype_parm_type_p (tree type
, tsubst_flags_t complain
)
21541 if (INTEGRAL_OR_ENUMERATION_TYPE_P (type
))
21543 else if (POINTER_TYPE_P (type
))
21545 else if (TYPE_PTRMEM_P (type
))
21547 else if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
)
21549 else if (TREE_CODE (type
) == TYPENAME_TYPE
)
21551 else if (TREE_CODE (type
) == DECLTYPE_TYPE
)
21553 else if (TREE_CODE (type
) == NULLPTR_TYPE
)
21555 /* A bound template template parm could later be instantiated to have a valid
21556 nontype parm type via an alias template. */
21557 else if (cxx_dialect
>= cxx11
21558 && TREE_CODE (type
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
21561 if (complain
& tf_error
)
21563 if (type
== error_mark_node
)
21564 inform (input_location
, "invalid template non-type parameter");
21566 error ("%q#T is not a valid type for a template non-type parameter",
21572 /* Returns TRUE if TYPE is dependent, in the sense of [temp.dep.type].
21573 Assumes that TYPE really is a type, and not the ERROR_MARK_NODE.*/
21576 dependent_type_p_r (tree type
)
21582 A type is dependent if it is:
21584 -- a template parameter. Template template parameters are types
21585 for us (since TYPE_P holds true for them) so we handle
21587 if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
21588 || TREE_CODE (type
) == TEMPLATE_TEMPLATE_PARM
)
21590 /* -- a qualified-id with a nested-name-specifier which contains a
21591 class-name that names a dependent type or whose unqualified-id
21592 names a dependent type. */
21593 if (TREE_CODE (type
) == TYPENAME_TYPE
)
21596 /* An alias template specialization can be dependent even if the
21597 resulting type is not. */
21598 if (dependent_alias_template_spec_p (type
))
21601 /* -- a cv-qualified type where the cv-unqualified type is
21603 No code is necessary for this bullet; the code below handles
21604 cv-qualified types, and we don't want to strip aliases with
21605 TYPE_MAIN_VARIANT because of DR 1558. */
21606 /* -- a compound type constructed from any dependent type. */
21607 if (TYPE_PTRMEM_P (type
))
21608 return (dependent_type_p (TYPE_PTRMEM_CLASS_TYPE (type
))
21609 || dependent_type_p (TYPE_PTRMEM_POINTED_TO_TYPE
21611 else if (TYPE_PTR_P (type
)
21612 || TREE_CODE (type
) == REFERENCE_TYPE
)
21613 return dependent_type_p (TREE_TYPE (type
));
21614 else if (TREE_CODE (type
) == FUNCTION_TYPE
21615 || TREE_CODE (type
) == METHOD_TYPE
)
21619 if (dependent_type_p (TREE_TYPE (type
)))
21621 for (arg_type
= TYPE_ARG_TYPES (type
);
21623 arg_type
= TREE_CHAIN (arg_type
))
21624 if (dependent_type_p (TREE_VALUE (arg_type
)))
21628 /* -- an array type constructed from any dependent type or whose
21629 size is specified by a constant expression that is
21632 We checked for type- and value-dependence of the bounds in
21633 compute_array_index_type, so TYPE_DEPENDENT_P is already set. */
21634 if (TREE_CODE (type
) == ARRAY_TYPE
)
21636 if (TYPE_DOMAIN (type
)
21637 && dependent_type_p (TYPE_DOMAIN (type
)))
21639 return dependent_type_p (TREE_TYPE (type
));
21642 /* -- a template-id in which either the template name is a template
21644 if (TREE_CODE (type
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
21646 /* ... or any of the template arguments is a dependent type or
21647 an expression that is type-dependent or value-dependent. */
21648 else if (CLASS_TYPE_P (type
) && CLASSTYPE_TEMPLATE_INFO (type
)
21649 && (any_dependent_template_arguments_p
21650 (INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (type
)))))
21653 /* All TYPEOF_TYPEs, DECLTYPE_TYPEs, and UNDERLYING_TYPEs are
21654 dependent; if the argument of the `typeof' expression is not
21655 type-dependent, then it should already been have resolved. */
21656 if (TREE_CODE (type
) == TYPEOF_TYPE
21657 || TREE_CODE (type
) == DECLTYPE_TYPE
21658 || TREE_CODE (type
) == UNDERLYING_TYPE
)
21661 /* A template argument pack is dependent if any of its packed
21663 if (TREE_CODE (type
) == TYPE_ARGUMENT_PACK
)
21665 tree args
= ARGUMENT_PACK_ARGS (type
);
21666 int i
, len
= TREE_VEC_LENGTH (args
);
21667 for (i
= 0; i
< len
; ++i
)
21668 if (dependent_template_arg_p (TREE_VEC_ELT (args
, i
)))
21672 /* All TYPE_PACK_EXPANSIONs are dependent, because parameter packs must
21673 be template parameters. */
21674 if (TREE_CODE (type
) == TYPE_PACK_EXPANSION
)
21677 /* The standard does not specifically mention types that are local
21678 to template functions or local classes, but they should be
21679 considered dependent too. For example:
21681 template <int I> void f() {
21686 The size of `E' cannot be known until the value of `I' has been
21687 determined. Therefore, `E' must be considered dependent. */
21688 scope
= TYPE_CONTEXT (type
);
21689 if (scope
&& TYPE_P (scope
))
21690 return dependent_type_p (scope
);
21691 /* Don't use type_dependent_expression_p here, as it can lead
21692 to infinite recursion trying to determine whether a lambda
21693 nested in a lambda is dependent (c++/47687). */
21694 else if (scope
&& TREE_CODE (scope
) == FUNCTION_DECL
21695 && DECL_LANG_SPECIFIC (scope
)
21696 && DECL_TEMPLATE_INFO (scope
)
21697 && (any_dependent_template_arguments_p
21698 (INNERMOST_TEMPLATE_ARGS (DECL_TI_ARGS (scope
)))))
21701 /* Other types are non-dependent. */
21705 /* Returns TRUE if TYPE is dependent, in the sense of
21706 [temp.dep.type]. Note that a NULL type is considered dependent. */
21709 dependent_type_p (tree type
)
21711 /* If there are no template parameters in scope, then there can't be
21712 any dependent types. */
21713 if (!processing_template_decl
)
21715 /* If we are not processing a template, then nobody should be
21716 providing us with a dependent type. */
21718 gcc_assert (TREE_CODE (type
) != TEMPLATE_TYPE_PARM
|| is_auto (type
));
21722 /* If the type is NULL, we have not computed a type for the entity
21723 in question; in that case, the type is dependent. */
21727 /* Erroneous types can be considered non-dependent. */
21728 if (type
== error_mark_node
)
21731 /* If we have not already computed the appropriate value for TYPE,
21733 if (!TYPE_DEPENDENT_P_VALID (type
))
21735 TYPE_DEPENDENT_P (type
) = dependent_type_p_r (type
);
21736 TYPE_DEPENDENT_P_VALID (type
) = 1;
21739 return TYPE_DEPENDENT_P (type
);
21742 /* Returns TRUE if SCOPE is a dependent scope, in which we can't do any
21743 lookup. In other words, a dependent type that is not the current
21747 dependent_scope_p (tree scope
)
21749 return (scope
&& TYPE_P (scope
) && dependent_type_p (scope
)
21750 && !currently_open_class (scope
));
21753 /* T is a SCOPE_REF; return whether we need to consider it
21754 instantiation-dependent so that we can check access at instantiation
21755 time even though we know which member it resolves to. */
21758 instantiation_dependent_scope_ref_p (tree t
)
21760 if (DECL_P (TREE_OPERAND (t
, 1))
21761 && CLASS_TYPE_P (TREE_OPERAND (t
, 0))
21762 && accessible_in_template_p (TREE_OPERAND (t
, 0),
21763 TREE_OPERAND (t
, 1)))
21769 /* Returns TRUE if the EXPRESSION is value-dependent, in the sense of
21770 [temp.dep.constexpr]. EXPRESSION is already known to be a constant
21773 /* Note that this predicate is not appropriate for general expressions;
21774 only constant expressions (that satisfy potential_constant_expression)
21775 can be tested for value dependence. */
21778 value_dependent_expression_p (tree expression
)
21780 if (!processing_template_decl
)
21783 /* A name declared with a dependent type. */
21784 if (DECL_P (expression
) && type_dependent_expression_p (expression
))
21787 switch (TREE_CODE (expression
))
21789 case IDENTIFIER_NODE
:
21790 /* A name that has not been looked up -- must be dependent. */
21793 case TEMPLATE_PARM_INDEX
:
21794 /* A non-type template parm. */
21798 /* A non-type template parm. */
21799 if (DECL_TEMPLATE_PARM_P (expression
))
21801 return value_dependent_expression_p (DECL_INITIAL (expression
));
21804 /* A constant with literal type and is initialized
21805 with an expression that is value-dependent.
21807 Note that a non-dependent parenthesized initializer will have
21808 already been replaced with its constant value, so if we see
21809 a TREE_LIST it must be dependent. */
21810 if (DECL_INITIAL (expression
)
21811 && decl_constant_var_p (expression
)
21812 && (TREE_CODE (DECL_INITIAL (expression
)) == TREE_LIST
21813 /* cp_finish_decl doesn't fold reference initializers. */
21814 || TREE_CODE (TREE_TYPE (expression
)) == REFERENCE_TYPE
21815 || value_dependent_expression_p (DECL_INITIAL (expression
))))
21819 case DYNAMIC_CAST_EXPR
:
21820 case STATIC_CAST_EXPR
:
21821 case CONST_CAST_EXPR
:
21822 case REINTERPRET_CAST_EXPR
:
21824 /* These expressions are value-dependent if the type to which
21825 the cast occurs is dependent or the expression being casted
21826 is value-dependent. */
21828 tree type
= TREE_TYPE (expression
);
21830 if (dependent_type_p (type
))
21833 /* A functional cast has a list of operands. */
21834 expression
= TREE_OPERAND (expression
, 0);
21837 /* If there are no operands, it must be an expression such
21838 as "int()". This should not happen for aggregate types
21839 because it would form non-constant expressions. */
21840 gcc_assert (cxx_dialect
>= cxx11
21841 || INTEGRAL_OR_ENUMERATION_TYPE_P (type
));
21846 if (TREE_CODE (expression
) == TREE_LIST
)
21847 return any_value_dependent_elements_p (expression
);
21849 return value_dependent_expression_p (expression
);
21853 if (SIZEOF_EXPR_TYPE_P (expression
))
21854 return dependent_type_p (TREE_TYPE (TREE_OPERAND (expression
, 0)));
21858 /* A `sizeof' expression is value-dependent if the operand is
21859 type-dependent or is a pack expansion. */
21860 expression
= TREE_OPERAND (expression
, 0);
21861 if (PACK_EXPANSION_P (expression
))
21863 else if (TYPE_P (expression
))
21864 return dependent_type_p (expression
);
21865 return instantiation_dependent_expression_p (expression
);
21867 case AT_ENCODE_EXPR
:
21868 /* An 'encode' expression is value-dependent if the operand is
21870 expression
= TREE_OPERAND (expression
, 0);
21871 return dependent_type_p (expression
);
21873 case NOEXCEPT_EXPR
:
21874 expression
= TREE_OPERAND (expression
, 0);
21875 return instantiation_dependent_expression_p (expression
);
21878 /* All instantiation-dependent expressions should also be considered
21879 value-dependent. */
21880 return instantiation_dependent_scope_ref_p (expression
);
21882 case COMPONENT_REF
:
21883 return (value_dependent_expression_p (TREE_OPERAND (expression
, 0))
21884 || value_dependent_expression_p (TREE_OPERAND (expression
, 1)));
21886 case NONTYPE_ARGUMENT_PACK
:
21887 /* A NONTYPE_ARGUMENT_PACK is value-dependent if any packed argument
21888 is value-dependent. */
21890 tree values
= ARGUMENT_PACK_ARGS (expression
);
21891 int i
, len
= TREE_VEC_LENGTH (values
);
21893 for (i
= 0; i
< len
; ++i
)
21894 if (value_dependent_expression_p (TREE_VEC_ELT (values
, i
)))
21902 tree type2
= TRAIT_EXPR_TYPE2 (expression
);
21903 return (dependent_type_p (TRAIT_EXPR_TYPE1 (expression
))
21904 || (type2
? dependent_type_p (type2
) : false));
21908 return ((value_dependent_expression_p (TREE_OPERAND (expression
, 0)))
21909 || (value_dependent_expression_p (TREE_OPERAND (expression
, 2))));
21912 return ((value_dependent_expression_p (TREE_OPERAND (expression
, 0)))
21913 || (value_dependent_expression_p (TREE_OPERAND (expression
, 1))));
21917 tree op
= TREE_OPERAND (expression
, 0);
21918 return (value_dependent_expression_p (op
)
21919 || has_value_dependent_address (op
));
21922 case REQUIRES_EXPR
:
21923 /* Treat all requires-expressions as value-dependent so
21924 we don't try to fold them. */
21928 return dependent_type_p (TREE_OPERAND (expression
, 0));
21932 tree fn
= get_callee_fndecl (expression
);
21934 if (!fn
&& value_dependent_expression_p (CALL_EXPR_FN (expression
)))
21936 nargs
= call_expr_nargs (expression
);
21937 for (i
= 0; i
< nargs
; ++i
)
21939 tree op
= CALL_EXPR_ARG (expression
, i
);
21940 /* In a call to a constexpr member function, look through the
21941 implicit ADDR_EXPR on the object argument so that it doesn't
21942 cause the call to be considered value-dependent. We also
21943 look through it in potential_constant_expression. */
21944 if (i
== 0 && fn
&& DECL_DECLARED_CONSTEXPR_P (fn
)
21945 && DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
)
21946 && TREE_CODE (op
) == ADDR_EXPR
)
21947 op
= TREE_OPERAND (op
, 0);
21948 if (value_dependent_expression_p (op
))
21954 case TEMPLATE_ID_EXPR
:
21955 /* If a TEMPLATE_ID_EXPR involves a dependent name, it will be
21957 return type_dependent_expression_p (expression
)
21958 || variable_concept_p (TREE_OPERAND (expression
, 0));
21964 if (dependent_type_p (TREE_TYPE (expression
)))
21966 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (expression
), ix
, val
)
21967 if (value_dependent_expression_p (val
))
21973 /* Treat a GNU statement expression as dependent to avoid crashing
21974 under instantiate_non_dependent_expr; it can't be constant. */
21978 /* A constant expression is value-dependent if any subexpression is
21979 value-dependent. */
21980 switch (TREE_CODE_CLASS (TREE_CODE (expression
)))
21982 case tcc_reference
:
21984 case tcc_comparison
:
21986 case tcc_expression
:
21989 int i
, len
= cp_tree_operand_length (expression
);
21991 for (i
= 0; i
< len
; i
++)
21993 tree t
= TREE_OPERAND (expression
, i
);
21995 /* In some cases, some of the operands may be missing.l
21996 (For example, in the case of PREDECREMENT_EXPR, the
21997 amount to increment by may be missing.) That doesn't
21998 make the expression dependent. */
21999 if (t
&& value_dependent_expression_p (t
))
22010 /* The expression is not value-dependent. */
22014 /* Returns TRUE if the EXPRESSION is type-dependent, in the sense of
22015 [temp.dep.expr]. Note that an expression with no type is
22016 considered dependent. Other parts of the compiler arrange for an
22017 expression with type-dependent subexpressions to have no type, so
22018 this function doesn't have to be fully recursive. */
22021 type_dependent_expression_p (tree expression
)
22023 if (!processing_template_decl
)
22026 if (expression
== NULL_TREE
|| expression
== error_mark_node
)
22029 /* An unresolved name is always dependent. */
22030 if (identifier_p (expression
)
22031 || TREE_CODE (expression
) == USING_DECL
22032 || TREE_CODE (expression
) == WILDCARD_DECL
)
22035 /* Some expression forms are never type-dependent. */
22036 if (TREE_CODE (expression
) == PSEUDO_DTOR_EXPR
22037 || TREE_CODE (expression
) == SIZEOF_EXPR
22038 || TREE_CODE (expression
) == ALIGNOF_EXPR
22039 || TREE_CODE (expression
) == AT_ENCODE_EXPR
22040 || TREE_CODE (expression
) == NOEXCEPT_EXPR
22041 || TREE_CODE (expression
) == TRAIT_EXPR
22042 || TREE_CODE (expression
) == TYPEID_EXPR
22043 || TREE_CODE (expression
) == DELETE_EXPR
22044 || TREE_CODE (expression
) == VEC_DELETE_EXPR
22045 || TREE_CODE (expression
) == THROW_EXPR
22046 || TREE_CODE (expression
) == REQUIRES_EXPR
)
22049 /* The types of these expressions depends only on the type to which
22050 the cast occurs. */
22051 if (TREE_CODE (expression
) == DYNAMIC_CAST_EXPR
22052 || TREE_CODE (expression
) == STATIC_CAST_EXPR
22053 || TREE_CODE (expression
) == CONST_CAST_EXPR
22054 || TREE_CODE (expression
) == REINTERPRET_CAST_EXPR
22055 || TREE_CODE (expression
) == IMPLICIT_CONV_EXPR
22056 || TREE_CODE (expression
) == CAST_EXPR
)
22057 return dependent_type_p (TREE_TYPE (expression
));
22059 /* The types of these expressions depends only on the type created
22060 by the expression. */
22061 if (TREE_CODE (expression
) == NEW_EXPR
22062 || TREE_CODE (expression
) == VEC_NEW_EXPR
)
22064 /* For NEW_EXPR tree nodes created inside a template, either
22065 the object type itself or a TREE_LIST may appear as the
22067 tree type
= TREE_OPERAND (expression
, 1);
22068 if (TREE_CODE (type
) == TREE_LIST
)
22069 /* This is an array type. We need to check array dimensions
22071 return dependent_type_p (TREE_VALUE (TREE_PURPOSE (type
)))
22072 || value_dependent_expression_p
22073 (TREE_OPERAND (TREE_VALUE (type
), 1));
22075 return dependent_type_p (type
);
22078 if (TREE_CODE (expression
) == SCOPE_REF
)
22080 tree scope
= TREE_OPERAND (expression
, 0);
22081 tree name
= TREE_OPERAND (expression
, 1);
22083 /* 14.6.2.2 [temp.dep.expr]: An id-expression is type-dependent if it
22084 contains an identifier associated by name lookup with one or more
22085 declarations declared with a dependent type, or...a
22086 nested-name-specifier or qualified-id that names a member of an
22087 unknown specialization. */
22088 return (type_dependent_expression_p (name
)
22089 || dependent_scope_p (scope
));
22092 if (TREE_CODE (expression
) == FUNCTION_DECL
22093 && DECL_LANG_SPECIFIC (expression
)
22094 && DECL_TEMPLATE_INFO (expression
)
22095 && (any_dependent_template_arguments_p
22096 (INNERMOST_TEMPLATE_ARGS (DECL_TI_ARGS (expression
)))))
22099 if (TREE_CODE (expression
) == TEMPLATE_DECL
22100 && !DECL_TEMPLATE_TEMPLATE_PARM_P (expression
))
22103 if (TREE_CODE (expression
) == STMT_EXPR
)
22104 expression
= stmt_expr_value_expr (expression
);
22106 if (BRACE_ENCLOSED_INITIALIZER_P (expression
))
22111 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (expression
), i
, elt
)
22113 if (type_dependent_expression_p (elt
))
22119 /* A static data member of the current instantiation with incomplete
22120 array type is type-dependent, as the definition and specializations
22121 can have different bounds. */
22122 if (VAR_P (expression
)
22123 && DECL_CLASS_SCOPE_P (expression
)
22124 && dependent_type_p (DECL_CONTEXT (expression
))
22125 && VAR_HAD_UNKNOWN_BOUND (expression
))
22128 /* An array of unknown bound depending on a variadic parameter, eg:
22130 template<typename... Args>
22131 void foo (Args... args)
22133 int arr[] = { args... };
22136 template<int... vals>
22139 int arr[] = { vals... };
22142 If the array has no length and has an initializer, it must be that
22143 we couldn't determine its length in cp_complete_array_type because
22144 it is dependent. */
22145 if (VAR_P (expression
)
22146 && TREE_CODE (TREE_TYPE (expression
)) == ARRAY_TYPE
22147 && !TYPE_DOMAIN (TREE_TYPE (expression
))
22148 && DECL_INITIAL (expression
))
22151 /* A variable template specialization is type-dependent if it has any
22152 dependent template arguments. */
22153 if (VAR_P (expression
)
22154 && DECL_LANG_SPECIFIC (expression
)
22155 && DECL_TEMPLATE_INFO (expression
)
22156 && variable_template_p (DECL_TI_TEMPLATE (expression
)))
22157 return any_dependent_template_arguments_p (DECL_TI_ARGS (expression
));
22159 /* Always dependent, on the number of arguments if nothing else. */
22160 if (TREE_CODE (expression
) == EXPR_PACK_EXPANSION
)
22163 if (TREE_TYPE (expression
) == unknown_type_node
)
22165 if (TREE_CODE (expression
) == ADDR_EXPR
)
22166 return type_dependent_expression_p (TREE_OPERAND (expression
, 0));
22167 if (TREE_CODE (expression
) == COMPONENT_REF
22168 || TREE_CODE (expression
) == OFFSET_REF
)
22170 if (type_dependent_expression_p (TREE_OPERAND (expression
, 0)))
22172 expression
= TREE_OPERAND (expression
, 1);
22173 if (identifier_p (expression
))
22176 /* SCOPE_REF with non-null TREE_TYPE is always non-dependent. */
22177 if (TREE_CODE (expression
) == SCOPE_REF
)
22180 if (BASELINK_P (expression
))
22182 if (BASELINK_OPTYPE (expression
)
22183 && dependent_type_p (BASELINK_OPTYPE (expression
)))
22185 expression
= BASELINK_FUNCTIONS (expression
);
22188 if (TREE_CODE (expression
) == TEMPLATE_ID_EXPR
)
22190 if (any_dependent_template_arguments_p
22191 (TREE_OPERAND (expression
, 1)))
22193 expression
= TREE_OPERAND (expression
, 0);
22194 if (identifier_p (expression
))
22198 gcc_assert (TREE_CODE (expression
) == OVERLOAD
22199 || TREE_CODE (expression
) == FUNCTION_DECL
);
22203 if (type_dependent_expression_p (OVL_CURRENT (expression
)))
22205 expression
= OVL_NEXT (expression
);
22210 gcc_assert (TREE_CODE (expression
) != TYPE_DECL
);
22212 return (dependent_type_p (TREE_TYPE (expression
)));
22215 /* walk_tree callback function for instantiation_dependent_expression_p,
22216 below. Returns non-zero if a dependent subexpression is found. */
22219 instantiation_dependent_r (tree
*tp
, int *walk_subtrees
,
22224 /* We don't have to worry about decltype currently because decltype
22225 of an instantiation-dependent expr is a dependent type. This
22226 might change depending on the resolution of DR 1172. */
22227 *walk_subtrees
= false;
22230 enum tree_code code
= TREE_CODE (*tp
);
22233 /* Don't treat an argument list as dependent just because it has no
22241 /* A constant with a dependent initializer is dependent. */
22242 if (value_dependent_expression_p (*tp
))
22246 case TEMPLATE_PARM_INDEX
:
22249 /* Handle expressions with type operands. */
22253 case AT_ENCODE_EXPR
:
22255 tree op
= TREE_OPERAND (*tp
, 0);
22256 if (code
== SIZEOF_EXPR
&& SIZEOF_EXPR_TYPE_P (*tp
))
22257 op
= TREE_TYPE (op
);
22260 if (dependent_type_p (op
))
22264 *walk_subtrees
= false;
22272 if (value_dependent_expression_p (*tp
))
22274 *walk_subtrees
= false;
22277 case COMPONENT_REF
:
22278 if (identifier_p (TREE_OPERAND (*tp
, 1)))
22279 /* In a template, finish_class_member_access_expr creates a
22280 COMPONENT_REF with an IDENTIFIER_NODE for op1 even if it isn't
22281 type-dependent, so that we can check access control at
22282 instantiation time (PR 42277). See also Core issue 1273. */
22287 if (instantiation_dependent_scope_ref_p (*tp
))
22292 /* Treat statement-expressions as dependent. */
22296 /* Treat requires-expressions as dependent. */
22297 case REQUIRES_EXPR
:
22301 /* Treat calls to function concepts as dependent. */
22302 if (function_concept_check_p (*tp
))
22306 case TEMPLATE_ID_EXPR
:
22307 /* And variable concepts. */
22308 if (variable_concept_p (TREE_OPERAND (*tp
, 0)))
22316 if (type_dependent_expression_p (*tp
))
22322 /* Returns TRUE if the EXPRESSION is instantiation-dependent, in the
22323 sense defined by the ABI:
22325 "An expression is instantiation-dependent if it is type-dependent
22326 or value-dependent, or it has a subexpression that is type-dependent
22327 or value-dependent." */
22330 instantiation_dependent_expression_p (tree expression
)
22334 if (!processing_template_decl
)
22337 if (expression
== error_mark_node
)
22340 result
= cp_walk_tree_without_duplicates (&expression
,
22341 instantiation_dependent_r
, NULL
);
22342 return result
!= NULL_TREE
;
22345 /* Like type_dependent_expression_p, but it also works while not processing
22346 a template definition, i.e. during substitution or mangling. */
22349 type_dependent_expression_p_push (tree expr
)
22352 ++processing_template_decl
;
22353 b
= type_dependent_expression_p (expr
);
22354 --processing_template_decl
;
22358 /* Returns TRUE if ARGS contains a type-dependent expression. */
22361 any_type_dependent_arguments_p (const vec
<tree
, va_gc
> *args
)
22366 FOR_EACH_VEC_SAFE_ELT (args
, i
, arg
)
22368 if (type_dependent_expression_p (arg
))
22374 /* Returns TRUE if LIST (a TREE_LIST whose TREE_VALUEs are
22375 expressions) contains any type-dependent expressions. */
22378 any_type_dependent_elements_p (const_tree list
)
22380 for (; list
; list
= TREE_CHAIN (list
))
22381 if (type_dependent_expression_p (TREE_VALUE (list
)))
22387 /* Returns TRUE if LIST (a TREE_LIST whose TREE_VALUEs are
22388 expressions) contains any value-dependent expressions. */
22391 any_value_dependent_elements_p (const_tree list
)
22393 for (; list
; list
= TREE_CHAIN (list
))
22394 if (value_dependent_expression_p (TREE_VALUE (list
)))
22400 /* Returns TRUE if the ARG (a template argument) is dependent. */
22403 dependent_template_arg_p (tree arg
)
22405 if (!processing_template_decl
)
22408 /* Assume a template argument that was wrongly written by the user
22409 is dependent. This is consistent with what
22410 any_dependent_template_arguments_p [that calls this function]
22412 if (!arg
|| arg
== error_mark_node
)
22415 if (TREE_CODE (arg
) == ARGUMENT_PACK_SELECT
)
22416 arg
= ARGUMENT_PACK_SELECT_ARG (arg
);
22418 if (TREE_CODE (arg
) == TEMPLATE_DECL
22419 || TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
)
22420 return dependent_template_p (arg
);
22421 else if (ARGUMENT_PACK_P (arg
))
22423 tree args
= ARGUMENT_PACK_ARGS (arg
);
22424 int i
, len
= TREE_VEC_LENGTH (args
);
22425 for (i
= 0; i
< len
; ++i
)
22427 if (dependent_template_arg_p (TREE_VEC_ELT (args
, i
)))
22433 else if (TYPE_P (arg
))
22434 return dependent_type_p (arg
);
22436 return (type_dependent_expression_p (arg
)
22437 || value_dependent_expression_p (arg
));
22440 /* Returns true if ARGS (a collection of template arguments) contains
22441 any types that require structural equality testing. */
22444 any_template_arguments_need_structural_equality_p (tree args
)
22451 if (args
== error_mark_node
)
22454 for (i
= 0; i
< TMPL_ARGS_DEPTH (args
); ++i
)
22456 tree level
= TMPL_ARGS_LEVEL (args
, i
+ 1);
22457 for (j
= 0; j
< TREE_VEC_LENGTH (level
); ++j
)
22459 tree arg
= TREE_VEC_ELT (level
, j
);
22460 tree packed_args
= NULL_TREE
;
22463 if (ARGUMENT_PACK_P (arg
))
22465 /* Look inside the argument pack. */
22466 packed_args
= ARGUMENT_PACK_ARGS (arg
);
22467 len
= TREE_VEC_LENGTH (packed_args
);
22470 for (k
= 0; k
< len
; ++k
)
22473 arg
= TREE_VEC_ELT (packed_args
, k
);
22475 if (error_operand_p (arg
))
22477 else if (TREE_CODE (arg
) == TEMPLATE_DECL
)
22479 else if (TYPE_P (arg
) && TYPE_STRUCTURAL_EQUALITY_P (arg
))
22481 else if (!TYPE_P (arg
) && TREE_TYPE (arg
)
22482 && TYPE_STRUCTURAL_EQUALITY_P (TREE_TYPE (arg
)))
22491 /* Returns true if ARGS (a collection of template arguments) contains
22492 any dependent arguments. */
22495 any_dependent_template_arguments_p (const_tree args
)
22502 if (args
== error_mark_node
)
22505 for (i
= 0; i
< TMPL_ARGS_DEPTH (args
); ++i
)
22507 const_tree level
= TMPL_ARGS_LEVEL (args
, i
+ 1);
22508 for (j
= 0; j
< TREE_VEC_LENGTH (level
); ++j
)
22509 if (dependent_template_arg_p (TREE_VEC_ELT (level
, j
)))
22516 /* Returns TRUE if the template TMPL is dependent. */
22519 dependent_template_p (tree tmpl
)
22521 if (TREE_CODE (tmpl
) == OVERLOAD
)
22525 if (dependent_template_p (OVL_CURRENT (tmpl
)))
22527 tmpl
= OVL_NEXT (tmpl
);
22532 /* Template template parameters are dependent. */
22533 if (DECL_TEMPLATE_TEMPLATE_PARM_P (tmpl
)
22534 || TREE_CODE (tmpl
) == TEMPLATE_TEMPLATE_PARM
)
22536 /* So are names that have not been looked up. */
22537 if (TREE_CODE (tmpl
) == SCOPE_REF
|| identifier_p (tmpl
))
22539 /* So are member templates of dependent classes. */
22540 if (TYPE_P (CP_DECL_CONTEXT (tmpl
)))
22541 return dependent_type_p (DECL_CONTEXT (tmpl
));
22545 /* Returns TRUE if the specialization TMPL<ARGS> is dependent. */
22548 dependent_template_id_p (tree tmpl
, tree args
)
22550 return (dependent_template_p (tmpl
)
22551 || any_dependent_template_arguments_p (args
));
22554 /* Returns TRUE if OMP_FOR with DECLV, INITV, CONDV and INCRV vectors
22558 dependent_omp_for_p (tree declv
, tree initv
, tree condv
, tree incrv
)
22562 if (!processing_template_decl
)
22565 for (i
= 0; i
< TREE_VEC_LENGTH (declv
); i
++)
22567 tree decl
= TREE_VEC_ELT (declv
, i
);
22568 tree init
= TREE_VEC_ELT (initv
, i
);
22569 tree cond
= TREE_VEC_ELT (condv
, i
);
22570 tree incr
= TREE_VEC_ELT (incrv
, i
);
22572 if (type_dependent_expression_p (decl
))
22575 if (init
&& type_dependent_expression_p (init
))
22578 if (type_dependent_expression_p (cond
))
22581 if (COMPARISON_CLASS_P (cond
)
22582 && (type_dependent_expression_p (TREE_OPERAND (cond
, 0))
22583 || type_dependent_expression_p (TREE_OPERAND (cond
, 1))))
22586 if (TREE_CODE (incr
) == MODOP_EXPR
)
22588 if (type_dependent_expression_p (TREE_OPERAND (incr
, 0))
22589 || type_dependent_expression_p (TREE_OPERAND (incr
, 2)))
22592 else if (type_dependent_expression_p (incr
))
22594 else if (TREE_CODE (incr
) == MODIFY_EXPR
)
22596 if (type_dependent_expression_p (TREE_OPERAND (incr
, 0)))
22598 else if (BINARY_CLASS_P (TREE_OPERAND (incr
, 1)))
22600 tree t
= TREE_OPERAND (incr
, 1);
22601 if (type_dependent_expression_p (TREE_OPERAND (t
, 0))
22602 || type_dependent_expression_p (TREE_OPERAND (t
, 1)))
22611 /* TYPE is a TYPENAME_TYPE. Returns the ordinary TYPE to which the
22612 TYPENAME_TYPE corresponds. Returns the original TYPENAME_TYPE if
22613 no such TYPE can be found. Note that this function peers inside
22614 uninstantiated templates and therefore should be used only in
22615 extremely limited situations. ONLY_CURRENT_P restricts this
22616 peering to the currently open classes hierarchy (which is required
22617 when comparing types). */
22620 resolve_typename_type (tree type
, bool only_current_p
)
22629 gcc_assert (TREE_CODE (type
) == TYPENAME_TYPE
);
22631 scope
= TYPE_CONTEXT (type
);
22632 /* Usually the non-qualified identifier of a TYPENAME_TYPE is
22633 TYPE_IDENTIFIER (type). But when 'type' is a typedef variant of
22634 a TYPENAME_TYPE node, then TYPE_NAME (type) is set to the TYPE_DECL representing
22635 the typedef. In that case TYPE_IDENTIFIER (type) is not the non-qualified
22636 identifier of the TYPENAME_TYPE anymore.
22637 So by getting the TYPE_IDENTIFIER of the _main declaration_ of the
22638 TYPENAME_TYPE instead, we avoid messing up with a possible
22639 typedef variant case. */
22640 name
= TYPE_IDENTIFIER (TYPE_MAIN_VARIANT (type
));
22642 /* If the SCOPE is itself a TYPENAME_TYPE, then we need to resolve
22643 it first before we can figure out what NAME refers to. */
22644 if (TREE_CODE (scope
) == TYPENAME_TYPE
)
22646 if (TYPENAME_IS_RESOLVING_P (scope
))
22647 /* Given a class template A with a dependent base with nested type C,
22648 typedef typename A::C::C C will land us here, as trying to resolve
22649 the initial A::C leads to the local C typedef, which leads back to
22650 A::C::C. So we break the recursion now. */
22653 scope
= resolve_typename_type (scope
, only_current_p
);
22655 /* If we don't know what SCOPE refers to, then we cannot resolve the
22657 if (TREE_CODE (scope
) == TYPENAME_TYPE
)
22659 /* If the SCOPE is a template type parameter, we have no way of
22660 resolving the name. */
22661 if (TREE_CODE (scope
) == TEMPLATE_TYPE_PARM
)
22663 /* If the SCOPE is not the current instantiation, there's no reason
22664 to look inside it. */
22665 if (only_current_p
&& !currently_open_class (scope
))
22667 /* If this is a typedef, we don't want to look inside (c++/11987). */
22668 if (typedef_variant_p (type
))
22670 /* If SCOPE isn't the template itself, it will not have a valid
22671 TYPE_FIELDS list. */
22672 if (same_type_p (scope
, CLASSTYPE_PRIMARY_TEMPLATE_TYPE (scope
)))
22673 /* scope is either the template itself or a compatible instantiation
22674 like X<T>, so look up the name in the original template. */
22675 scope
= CLASSTYPE_PRIMARY_TEMPLATE_TYPE (scope
);
22677 /* scope is a partial instantiation, so we can't do the lookup or we
22678 will lose the template arguments. */
22680 /* Enter the SCOPE so that name lookup will be resolved as if we
22681 were in the class definition. In particular, SCOPE will no
22682 longer be considered a dependent type. */
22683 pushed_scope
= push_scope (scope
);
22684 /* Look up the declaration. */
22685 decl
= lookup_member (scope
, name
, /*protect=*/0, /*want_type=*/true,
22686 tf_warning_or_error
);
22688 result
= NULL_TREE
;
22690 /* For a TYPENAME_TYPE like "typename X::template Y<T>", we want to
22691 find a TEMPLATE_DECL. Otherwise, we want to find a TYPE_DECL. */
22694 else if (identifier_p (TYPENAME_TYPE_FULLNAME (type
))
22695 && TREE_CODE (decl
) == TYPE_DECL
)
22697 result
= TREE_TYPE (decl
);
22698 if (result
== error_mark_node
)
22699 result
= NULL_TREE
;
22701 else if (TREE_CODE (TYPENAME_TYPE_FULLNAME (type
)) == TEMPLATE_ID_EXPR
22702 && DECL_CLASS_TEMPLATE_P (decl
))
22706 /* Obtain the template and the arguments. */
22707 tmpl
= TREE_OPERAND (TYPENAME_TYPE_FULLNAME (type
), 0);
22708 args
= TREE_OPERAND (TYPENAME_TYPE_FULLNAME (type
), 1);
22709 /* Instantiate the template. */
22710 result
= lookup_template_class (tmpl
, args
, NULL_TREE
, NULL_TREE
,
22711 /*entering_scope=*/0,
22712 tf_error
| tf_user
);
22713 if (result
== error_mark_node
)
22714 result
= NULL_TREE
;
22717 /* Leave the SCOPE. */
22719 pop_scope (pushed_scope
);
22721 /* If we failed to resolve it, return the original typename. */
22725 /* If lookup found a typename type, resolve that too. */
22726 if (TREE_CODE (result
) == TYPENAME_TYPE
&& !TYPENAME_IS_RESOLVING_P (result
))
22728 /* Ill-formed programs can cause infinite recursion here, so we
22729 must catch that. */
22730 TYPENAME_IS_RESOLVING_P (type
) = 1;
22731 result
= resolve_typename_type (result
, only_current_p
);
22732 TYPENAME_IS_RESOLVING_P (type
) = 0;
22735 /* Qualify the resulting type. */
22736 quals
= cp_type_quals (type
);
22738 result
= cp_build_qualified_type (result
, cp_type_quals (result
) | quals
);
22743 /* EXPR is an expression which is not type-dependent. Return a proxy
22744 for EXPR that can be used to compute the types of larger
22745 expressions containing EXPR. */
22748 build_non_dependent_expr (tree expr
)
22752 #ifdef ENABLE_CHECKING
22753 /* Try to get a constant value for all non-dependent expressions in
22754 order to expose bugs in *_dependent_expression_p and constexpr. */
22755 if (cxx_dialect
>= cxx11
)
22756 fold_non_dependent_expr (expr
);
22759 /* Preserve OVERLOADs; the functions must be available to resolve
22762 if (TREE_CODE (inner_expr
) == STMT_EXPR
)
22763 inner_expr
= stmt_expr_value_expr (inner_expr
);
22764 if (TREE_CODE (inner_expr
) == ADDR_EXPR
)
22765 inner_expr
= TREE_OPERAND (inner_expr
, 0);
22766 if (TREE_CODE (inner_expr
) == COMPONENT_REF
)
22767 inner_expr
= TREE_OPERAND (inner_expr
, 1);
22768 if (is_overloaded_fn (inner_expr
)
22769 || TREE_CODE (inner_expr
) == OFFSET_REF
)
22771 /* There is no need to return a proxy for a variable. */
22774 /* Preserve string constants; conversions from string constants to
22775 "char *" are allowed, even though normally a "const char *"
22776 cannot be used to initialize a "char *". */
22777 if (TREE_CODE (expr
) == STRING_CST
)
22779 /* Preserve void and arithmetic constants, as an optimization -- there is no
22780 reason to create a new node. */
22781 if (TREE_CODE (expr
) == VOID_CST
22782 || TREE_CODE (expr
) == INTEGER_CST
22783 || TREE_CODE (expr
) == REAL_CST
)
22785 /* Preserve THROW_EXPRs -- all throw-expressions have type "void".
22786 There is at least one place where we want to know that a
22787 particular expression is a throw-expression: when checking a ?:
22788 expression, there are special rules if the second or third
22789 argument is a throw-expression. */
22790 if (TREE_CODE (expr
) == THROW_EXPR
)
22793 /* Don't wrap an initializer list, we need to be able to look inside. */
22794 if (BRACE_ENCLOSED_INITIALIZER_P (expr
))
22797 /* Don't wrap a dummy object, we need to be able to test for it. */
22798 if (is_dummy_object (expr
))
22801 if (TREE_CODE (expr
) == COND_EXPR
)
22802 return build3 (COND_EXPR
,
22804 TREE_OPERAND (expr
, 0),
22805 (TREE_OPERAND (expr
, 1)
22806 ? build_non_dependent_expr (TREE_OPERAND (expr
, 1))
22807 : build_non_dependent_expr (TREE_OPERAND (expr
, 0))),
22808 build_non_dependent_expr (TREE_OPERAND (expr
, 2)));
22809 if (TREE_CODE (expr
) == COMPOUND_EXPR
22810 && !COMPOUND_EXPR_OVERLOADED (expr
))
22811 return build2 (COMPOUND_EXPR
,
22813 TREE_OPERAND (expr
, 0),
22814 build_non_dependent_expr (TREE_OPERAND (expr
, 1)));
22816 /* If the type is unknown, it can't really be non-dependent */
22817 gcc_assert (TREE_TYPE (expr
) != unknown_type_node
);
22819 /* Otherwise, build a NON_DEPENDENT_EXPR. */
22820 return build1 (NON_DEPENDENT_EXPR
, TREE_TYPE (expr
), expr
);
22823 /* ARGS is a vector of expressions as arguments to a function call.
22824 Replace the arguments with equivalent non-dependent expressions.
22825 This modifies ARGS in place. */
22828 make_args_non_dependent (vec
<tree
, va_gc
> *args
)
22833 FOR_EACH_VEC_SAFE_ELT (args
, ix
, arg
)
22835 tree newarg
= build_non_dependent_expr (arg
);
22837 (*args
)[ix
] = newarg
;
22841 /* Returns a type which represents 'auto' or 'decltype(auto)'. We use a
22842 TEMPLATE_TYPE_PARM with a level one deeper than the actual template
22846 make_auto_1 (tree name
)
22848 tree au
= cxx_make_type (TEMPLATE_TYPE_PARM
);
22849 TYPE_NAME (au
) = build_decl (input_location
,
22850 TYPE_DECL
, name
, au
);
22851 TYPE_STUB_DECL (au
) = TYPE_NAME (au
);
22852 TEMPLATE_TYPE_PARM_INDEX (au
) = build_template_parm_index
22853 (0, processing_template_decl
+ 1, processing_template_decl
+ 1,
22854 TYPE_NAME (au
), NULL_TREE
);
22855 TYPE_CANONICAL (au
) = canonical_type_parameter (au
);
22856 DECL_ARTIFICIAL (TYPE_NAME (au
)) = 1;
22857 SET_DECL_TEMPLATE_PARM_P (TYPE_NAME (au
));
22863 make_decltype_auto (void)
22865 return make_auto_1 (get_identifier ("decltype(auto)"));
22871 return make_auto_1 (get_identifier ("auto"));
22874 /* Given type ARG, return std::initializer_list<ARG>. */
22879 tree std_init_list
= namespace_binding
22880 (get_identifier ("initializer_list"), std_node
);
22882 if (!std_init_list
|| !DECL_CLASS_TEMPLATE_P (std_init_list
))
22884 error ("deducing from brace-enclosed initializer list requires "
22885 "#include <initializer_list>");
22886 return error_mark_node
;
22888 argvec
= make_tree_vec (1);
22889 TREE_VEC_ELT (argvec
, 0) = arg
;
22890 return lookup_template_class (std_init_list
, argvec
, NULL_TREE
,
22891 NULL_TREE
, 0, tf_warning_or_error
);
22894 /* Replace auto in TYPE with std::initializer_list<auto>. */
22897 listify_autos (tree type
, tree auto_node
)
22899 tree init_auto
= listify (auto_node
);
22900 tree argvec
= make_tree_vec (1);
22901 TREE_VEC_ELT (argvec
, 0) = init_auto
;
22902 if (processing_template_decl
)
22903 argvec
= add_to_template_args (current_template_args (), argvec
);
22904 return tsubst (type
, argvec
, tf_warning_or_error
, NULL_TREE
);
22907 /* Replace occurrences of 'auto' in TYPE with the appropriate type deduced
22908 from INIT. AUTO_NODE is the TEMPLATE_TYPE_PARM used for 'auto' in TYPE. */
22911 do_auto_deduction (tree type
, tree init
, tree auto_node
)
22913 return do_auto_deduction (type
, init
, auto_node
,
22914 tf_warning_or_error
,
22918 /* Replace occurrences of 'auto' in TYPE with the appropriate type deduced
22919 from INIT. AUTO_NODE is the TEMPLATE_TYPE_PARM used for 'auto' in TYPE.
22920 The CONTEXT determines the context in which auto deduction is performed
22921 and is used to control error diagnostics. */
22924 do_auto_deduction (tree type
, tree init
, tree auto_node
,
22925 tsubst_flags_t complain
, auto_deduction_context context
)
22929 if (init
== error_mark_node
)
22930 return error_mark_node
;
22932 if (type_dependent_expression_p (init
))
22933 /* Defining a subset of type-dependent expressions that we can deduce
22934 from ahead of time isn't worth the trouble. */
22937 /* [dcl.spec.auto]: Obtain P from T by replacing the occurrences of auto
22938 with either a new invented type template parameter U or, if the
22939 initializer is a braced-init-list (8.5.4), with
22940 std::initializer_list<U>. */
22941 if (BRACE_ENCLOSED_INITIALIZER_P (init
))
22943 if (!DIRECT_LIST_INIT_P (init
))
22944 type
= listify_autos (type
, auto_node
);
22945 else if (CONSTRUCTOR_NELTS (init
) == 1)
22946 init
= CONSTRUCTOR_ELT (init
, 0)->value
;
22949 if (complain
& tf_warning_or_error
)
22951 if (permerror (input_location
, "direct-list-initialization of "
22952 "%<auto%> requires exactly one element"))
22953 inform (input_location
,
22954 "for deduction to %<std::initializer_list%>, use copy-"
22955 "list-initialization (i.e. add %<=%> before the %<{%>)");
22957 type
= listify_autos (type
, auto_node
);
22961 init
= resolve_nondeduced_context (init
);
22963 targs
= make_tree_vec (1);
22964 if (AUTO_IS_DECLTYPE (auto_node
))
22966 bool id
= (DECL_P (init
) || (TREE_CODE (init
) == COMPONENT_REF
22967 && !REF_PARENTHESIZED_P (init
)));
22968 TREE_VEC_ELT (targs
, 0)
22969 = finish_decltype_type (init
, id
, tf_warning_or_error
);
22970 if (type
!= auto_node
)
22972 if (complain
& tf_error
)
22973 error ("%qT as type rather than plain %<decltype(auto)%>", type
);
22974 return error_mark_node
;
22979 tree parms
= build_tree_list (NULL_TREE
, type
);
22980 tree tparms
= make_tree_vec (1);
22983 TREE_VEC_ELT (tparms
, 0)
22984 = build_tree_list (NULL_TREE
, TYPE_NAME (auto_node
));
22985 val
= type_unification_real (tparms
, targs
, parms
, &init
, 1, 0,
22986 DEDUCE_CALL
, LOOKUP_NORMAL
,
22987 NULL
, /*explain_p=*/false);
22990 if (processing_template_decl
)
22991 /* Try again at instantiation time. */
22993 if (type
&& type
!= error_mark_node
22994 && (complain
& tf_error
))
22995 /* If type is error_mark_node a diagnostic must have been
22996 emitted by now. Also, having a mention to '<type error>'
22997 in the diagnostic is not really useful to the user. */
22999 if (cfun
&& auto_node
== current_function_auto_return_pattern
23000 && LAMBDA_FUNCTION_P (current_function_decl
))
23001 error ("unable to deduce lambda return type from %qE", init
);
23003 error ("unable to deduce %qT from %qE", type
, init
);
23005 return error_mark_node
;
23009 /* If the list of declarators contains more than one declarator, the type
23010 of each declared variable is determined as described above. If the
23011 type deduced for the template parameter U is not the same in each
23012 deduction, the program is ill-formed. */
23013 if (TREE_TYPE (auto_node
)
23014 && !same_type_p (TREE_TYPE (auto_node
), TREE_VEC_ELT (targs
, 0)))
23016 if (cfun
&& auto_node
== current_function_auto_return_pattern
23017 && LAMBDA_FUNCTION_P (current_function_decl
))
23018 error ("inconsistent types %qT and %qT deduced for "
23019 "lambda return type", TREE_TYPE (auto_node
),
23020 TREE_VEC_ELT (targs
, 0));
23022 error ("inconsistent deduction for %qT: %qT and then %qT",
23023 auto_node
, TREE_TYPE (auto_node
), TREE_VEC_ELT (targs
, 0));
23024 return error_mark_node
;
23026 if (context
!= adc_requirement
)
23027 TREE_TYPE (auto_node
) = TREE_VEC_ELT (targs
, 0);
23029 /* Check any placeholder constraints against the deduced type. */
23030 if (flag_concepts
&& !processing_template_decl
)
23031 if (tree constr
= PLACEHOLDER_TYPE_CONSTRAINTS (auto_node
))
23033 /* Use the deduced type to check the associated constraints. */
23034 if (!constraints_satisfied_p (constr
, targs
))
23036 if (complain
& tf_warning_or_error
)
23040 case adc_unspecified
:
23041 error("placeholder constraints not satisfied");
23043 case adc_variable_type
:
23044 error ("deduced initializer does not satisfy "
23045 "placeholder constraints");
23047 case adc_return_type
:
23048 error ("deduced return type does not satisfy "
23049 "placeholder constraints");
23051 case adc_requirement
:
23052 error ("deduced expression type does not saatisy "
23053 "placeholder constraints");
23056 diagnose_constraints (input_location
, constr
, targs
);
23058 return error_mark_node
;
23062 if (processing_template_decl
)
23063 targs
= add_to_template_args (current_template_args (), targs
);
23064 return tsubst (type
, targs
, complain
, NULL_TREE
);
23067 /* Substitutes LATE_RETURN_TYPE for 'auto' in TYPE and returns the
23071 splice_late_return_type (tree type
, tree late_return_type
)
23073 if (is_auto (type
))
23075 if (late_return_type
)
23076 return late_return_type
;
23078 tree idx
= get_template_parm_index (type
);
23079 if (TEMPLATE_PARM_LEVEL (idx
) <= processing_template_decl
)
23080 /* In an abbreviated function template we didn't know we were dealing
23081 with a function template when we saw the auto return type, so update
23082 it to have the correct level. */
23083 return make_auto_1 (TYPE_IDENTIFIER (type
));
23088 /* Returns true iff TYPE is a TEMPLATE_TYPE_PARM representing 'auto' or
23089 'decltype(auto)'. */
23092 is_auto (const_tree type
)
23094 if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
23095 && (TYPE_IDENTIFIER (type
) == get_identifier ("auto")
23096 || TYPE_IDENTIFIER (type
) == get_identifier ("decltype(auto)")))
23102 /* Returns the TEMPLATE_TYPE_PARM in TYPE representing `auto' iff TYPE contains
23103 a use of `auto'. Returns NULL_TREE otherwise. */
23106 type_uses_auto (tree type
)
23108 return find_type_usage (type
, is_auto
);
23111 /* Returns true iff TYPE is a TEMPLATE_TYPE_PARM representing 'auto',
23112 'decltype(auto)' or a concept. */
23115 is_auto_or_concept (const_tree type
)
23117 return is_auto (type
); // or concept
23120 /* Returns the TEMPLATE_TYPE_PARM in TYPE representing a generic type (`auto' or
23121 a concept identifier) iff TYPE contains a use of a generic type. Returns
23122 NULL_TREE otherwise. */
23125 type_uses_auto_or_concept (tree type
)
23127 return find_type_usage (type
, is_auto_or_concept
);
23131 /* For a given template T, return the vector of typedefs referenced
23132 in T for which access check is needed at T instantiation time.
23133 T is either a FUNCTION_DECL or a RECORD_TYPE.
23134 Those typedefs were added to T by the function
23135 append_type_to_template_for_access_check. */
23137 vec
<qualified_typedef_usage_t
, va_gc
> *
23138 get_types_needing_access_check (tree t
)
23141 vec
<qualified_typedef_usage_t
, va_gc
> *result
= NULL
;
23143 if (!t
|| t
== error_mark_node
)
23146 if (!(ti
= get_template_info (t
)))
23149 if (CLASS_TYPE_P (t
)
23150 || TREE_CODE (t
) == FUNCTION_DECL
)
23152 if (!TI_TEMPLATE (ti
))
23155 result
= TI_TYPEDEFS_NEEDING_ACCESS_CHECKING (ti
);
23161 /* Append the typedef TYPE_DECL used in template T to a list of typedefs
23162 tied to T. That list of typedefs will be access checked at
23163 T instantiation time.
23164 T is either a FUNCTION_DECL or a RECORD_TYPE.
23165 TYPE_DECL is a TYPE_DECL node representing a typedef.
23166 SCOPE is the scope through which TYPE_DECL is accessed.
23167 LOCATION is the location of the usage point of TYPE_DECL.
23169 This function is a subroutine of
23170 append_type_to_template_for_access_check. */
23173 append_type_to_template_for_access_check_1 (tree t
,
23176 location_t location
)
23178 qualified_typedef_usage_t typedef_usage
;
23181 if (!t
|| t
== error_mark_node
)
23184 gcc_assert ((TREE_CODE (t
) == FUNCTION_DECL
23185 || CLASS_TYPE_P (t
))
23187 && TREE_CODE (type_decl
) == TYPE_DECL
23190 if (!(ti
= get_template_info (t
)))
23193 gcc_assert (TI_TEMPLATE (ti
));
23195 typedef_usage
.typedef_decl
= type_decl
;
23196 typedef_usage
.context
= scope
;
23197 typedef_usage
.locus
= location
;
23199 vec_safe_push (TI_TYPEDEFS_NEEDING_ACCESS_CHECKING (ti
), typedef_usage
);
23202 /* Append TYPE_DECL to the template TEMPL.
23203 TEMPL is either a class type, a FUNCTION_DECL or a a TEMPLATE_DECL.
23204 At TEMPL instanciation time, TYPE_DECL will be checked to see
23205 if it can be accessed through SCOPE.
23206 LOCATION is the location of the usage point of TYPE_DECL.
23208 e.g. consider the following code snippet:
23215 template<class U> struct S
23217 C::myint mi; // <-- usage point of the typedef C::myint
23222 At S<char> instantiation time, we need to check the access of C::myint
23223 In other words, we need to check the access of the myint typedef through
23224 the C scope. For that purpose, this function will add the myint typedef
23225 and the scope C through which its being accessed to a list of typedefs
23226 tied to the template S. That list will be walked at template instantiation
23227 time and access check performed on each typedefs it contains.
23228 Note that this particular code snippet should yield an error because
23229 myint is private to C. */
23232 append_type_to_template_for_access_check (tree templ
,
23235 location_t location
)
23237 qualified_typedef_usage_t
*iter
;
23240 gcc_assert (type_decl
&& (TREE_CODE (type_decl
) == TYPE_DECL
));
23242 /* Make sure we don't append the type to the template twice. */
23243 FOR_EACH_VEC_SAFE_ELT (get_types_needing_access_check (templ
), i
, iter
)
23244 if (iter
->typedef_decl
== type_decl
&& scope
== iter
->context
)
23247 append_type_to_template_for_access_check_1 (templ
, type_decl
,
23251 /* Convert the generic type parameters in PARM that match the types given in the
23252 range [START_IDX, END_IDX) from the current_template_parms into generic type
23256 convert_generic_types_to_packs (tree parm
, int start_idx
, int end_idx
)
23258 tree current
= current_template_parms
;
23259 int depth
= TMPL_PARMS_DEPTH (current
);
23260 current
= INNERMOST_TEMPLATE_PARMS (current
);
23261 tree replacement
= make_tree_vec (TREE_VEC_LENGTH (current
));
23263 for (int i
= 0; i
< start_idx
; ++i
)
23264 TREE_VEC_ELT (replacement
, i
)
23265 = TREE_TYPE (TREE_VALUE (TREE_VEC_ELT (current
, i
)));
23267 for (int i
= start_idx
; i
< end_idx
; ++i
)
23269 /* Create a distinct parameter pack type from the current parm and add it
23270 to the replacement args to tsubst below into the generic function
23273 tree o
= TREE_TYPE (TREE_VALUE
23274 (TREE_VEC_ELT (current
, i
)));
23275 tree t
= copy_type (o
);
23276 TEMPLATE_TYPE_PARM_INDEX (t
)
23277 = reduce_template_parm_level (TEMPLATE_TYPE_PARM_INDEX (o
),
23279 TREE_TYPE (TEMPLATE_TYPE_DECL (t
)) = t
;
23280 TYPE_STUB_DECL (t
) = TYPE_NAME (t
) = TEMPLATE_TYPE_DECL (t
);
23281 TYPE_MAIN_VARIANT (t
) = t
;
23282 TEMPLATE_TYPE_PARAMETER_PACK (t
) = true;
23283 TYPE_CANONICAL (t
) = canonical_type_parameter (t
);
23284 TREE_VEC_ELT (replacement
, i
) = t
;
23285 TREE_VALUE (TREE_VEC_ELT (current
, i
)) = TREE_CHAIN (t
);
23288 for (int i
= end_idx
, e
= TREE_VEC_LENGTH (current
); i
< e
; ++i
)
23289 TREE_VEC_ELT (replacement
, i
)
23290 = TREE_TYPE (TREE_VALUE (TREE_VEC_ELT (current
, i
)));
23292 /* If there are more levels then build up the replacement with the outer
23295 replacement
= add_to_template_args (template_parms_to_args
23296 (TREE_CHAIN (current_template_parms
)),
23299 return tsubst (parm
, replacement
, tf_none
, NULL_TREE
);
23302 /* Entries in the decl_constraint hash table. */
23303 struct GTY((for_user
)) constr_entry
23309 /* Hashing function and equality for constraint entries. */
23310 struct constr_hasher
: ggc_ptr_hash
<constr_entry
>
23312 static hashval_t
hash (constr_entry
*e
)
23314 return (hashval_t
)DECL_UID (e
->decl
);
23317 static bool equal (constr_entry
*e1
, constr_entry
*e2
)
23319 return e1
->decl
== e2
->decl
;
23323 /* A mapping from declarations to constraint information. Note that
23324 both templates and their underlying declarations are mapped to the
23325 same constraint information.
23327 FIXME: This is defined in pt.c because garbage collection
23328 code is not being generated for constraint.cc. */
23330 static GTY (()) hash_table
<constr_hasher
> *decl_constraints
;
23332 /* Returns true iff cinfo contains a valid set of constraints.
23333 This is the case when the associated requirements have been
23334 successfully decomposed into lists of atomic constraints.
23335 That is, when the saved assumptions are not error_mark_node. */
23338 valid_constraints_p (tree cinfo
)
23340 gcc_assert (cinfo
);
23341 return CI_ASSUMPTIONS (cinfo
) != error_mark_node
;
23344 /* Returns the template constraints of declaration T. If T is not
23345 constrained, return NULL_TREE. Note that T must be non-null. */
23348 get_constraints (tree t
)
23350 gcc_assert (DECL_P (t
));
23351 if (TREE_CODE (t
) == TEMPLATE_DECL
)
23352 t
= DECL_TEMPLATE_RESULT (t
);
23353 constr_entry elt
= { t
, NULL_TREE
};
23354 constr_entry
* found
= decl_constraints
->find (&elt
);
23361 /* Associate the given constraint information CI with the declaration
23362 T. If T is a template, then the constraints are associated with
23363 its underlying declaration. Don't build associations if CI is
23367 set_constraints (tree t
, tree ci
)
23372 if (TREE_CODE (t
) == TEMPLATE_DECL
)
23373 t
= DECL_TEMPLATE_RESULT (t
);
23374 gcc_assert (!get_constraints (t
));
23375 constr_entry elt
= {t
, ci
};
23376 constr_entry
** slot
= decl_constraints
->find_slot (&elt
, INSERT
);
23377 constr_entry
* entry
= ggc_alloc
<constr_entry
> ();
23382 /* Remove the associated constraints of the declaration T. */
23385 remove_constraints (tree t
)
23387 gcc_assert (DECL_P (t
));
23388 if (TREE_CODE (t
) == TEMPLATE_DECL
)
23389 t
= DECL_TEMPLATE_RESULT (t
);
23391 constr_entry elt
= {t
, NULL_TREE
};
23392 constr_entry
** slot
= decl_constraints
->find_slot (&elt
, NO_INSERT
);
23394 decl_constraints
->clear_slot (slot
);
23397 /* Set up the hash table for constraint association. */
23400 init_constraint_processing (void)
23402 decl_constraints
= hash_table
<constr_hasher
>::create_ggc(37);
23405 /* Set up the hash tables for template instantiations. */
23408 init_template_processing (void)
23410 decl_specializations
= hash_table
<spec_hasher
>::create_ggc (37);
23411 type_specializations
= hash_table
<spec_hasher
>::create_ggc (37);
23414 /* Print stats about the template hash tables for -fstats. */
23417 print_template_statistics (void)
23419 fprintf (stderr
, "decl_specializations: size %ld, %ld elements, "
23420 "%f collisions\n", (long) decl_specializations
->size (),
23421 (long) decl_specializations
->elements (),
23422 decl_specializations
->collisions ());
23423 fprintf (stderr
, "type_specializations: size %ld, %ld elements, "
23424 "%f collisions\n", (long) type_specializations
->size (),
23425 (long) type_specializations
->elements (),
23426 type_specializations
->collisions ());
23429 #include "gt-cp-pt.h"