1 /* Handle parameterized types (templates) for GNU C++.
2 Copyright (C) 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000,
3 2001, 2002, 2003, 2004 Free Software Foundation, Inc.
4 Written by Ken Raeburn (raeburn@cygnus.com) while at Watchmaker Computing.
5 Rewritten by Jason Merrill (jason@cygnus.com).
7 This file is part of GCC.
9 GCC is free software; you can redistribute it and/or modify
10 it under the terms of the GNU General Public License as published by
11 the Free Software Foundation; either version 2, or (at your option)
14 GCC is distributed in the hope that it will be useful,
15 but WITHOUT ANY WARRANTY; without even the implied warranty of
16 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
17 GNU General Public License for more details.
19 You should have received a copy of the GNU General Public License
20 along with GCC; see the file COPYING. If not, write to
21 the Free Software Foundation, 59 Temple Place - Suite 330,
22 Boston, MA 02111-1307, USA. */
24 /* Known bugs or deficiencies include:
26 all methods must be provided in header files; can't use a source
27 file that contains only the method templates and "just win". */
31 #include "coretypes.h"
37 #include "tree-inline.h"
44 #include "tree-iterator.h"
46 /* The type of functions taking a tree, and some additional data, and
48 typedef int (*tree_fn_t
) (tree
, void*);
50 /* The PENDING_TEMPLATES is a TREE_LIST of templates whose
51 instantiations have been deferred, either because their definitions
52 were not yet available, or because we were putting off doing the work.
53 The TREE_PURPOSE of each entry is either a DECL (for a function or
54 static data member), or a TYPE (for a class) indicating what we are
55 hoping to instantiate. The TREE_VALUE is not used. */
56 static GTY(()) tree pending_templates
;
57 static GTY(()) tree last_pending_template
;
59 int processing_template_parmlist
;
60 static int template_header_count
;
62 static GTY(()) tree saved_trees
;
63 static GTY(()) varray_type inline_parm_levels
;
64 static size_t inline_parm_levels_used
;
66 static GTY(()) tree current_tinst_level
;
68 static GTY(()) tree saved_access_scope
;
70 /* A map from local variable declarations in the body of the template
71 presently being instantiated to the corresponding instantiated
73 static htab_t local_specializations
;
75 #define UNIFY_ALLOW_NONE 0
76 #define UNIFY_ALLOW_MORE_CV_QUAL 1
77 #define UNIFY_ALLOW_LESS_CV_QUAL 2
78 #define UNIFY_ALLOW_DERIVED 4
79 #define UNIFY_ALLOW_INTEGER 8
80 #define UNIFY_ALLOW_OUTER_LEVEL 16
81 #define UNIFY_ALLOW_OUTER_MORE_CV_QUAL 32
82 #define UNIFY_ALLOW_OUTER_LESS_CV_QUAL 64
83 #define UNIFY_ALLOW_MAX_CORRECTION 128
85 #define GTB_VIA_VIRTUAL 1 /* The base class we are examining is
86 virtual, or a base class of a virtual
88 #define GTB_IGNORE_TYPE 2 /* We don't need to try to unify the current
89 type with the desired type. */
91 static void push_access_scope (tree
);
92 static void pop_access_scope (tree
);
93 static int resolve_overloaded_unification (tree
, tree
, tree
, tree
,
94 unification_kind_t
, int);
95 static int try_one_overload (tree
, tree
, tree
, tree
, tree
,
96 unification_kind_t
, int, bool);
97 static int unify (tree
, tree
, tree
, tree
, int);
98 static void add_pending_template (tree
);
99 static void reopen_tinst_level (tree
);
100 static tree
classtype_mangled_name (tree
);
101 static char* mangle_class_name_for_template (const char *, tree
, tree
);
102 static tree
tsubst_initializer_list (tree
, tree
);
103 static tree
get_class_bindings (tree
, tree
, tree
);
104 static tree
coerce_template_parms (tree
, tree
, tree
, tsubst_flags_t
, int);
105 static void tsubst_enum (tree
, tree
, tree
);
106 static tree
add_to_template_args (tree
, tree
);
107 static tree
add_outermost_template_args (tree
, tree
);
108 static bool check_instantiated_args (tree
, tree
, tsubst_flags_t
);
109 static int maybe_adjust_types_for_deduction (unification_kind_t
, tree
*, tree
*);
110 static int type_unification_real (tree
, tree
, tree
, tree
,
111 int, unification_kind_t
, int, int);
112 static void note_template_header (int);
113 static tree
convert_nontype_argument (tree
, tree
);
114 static tree
convert_template_argument (tree
, tree
, tree
,
115 tsubst_flags_t
, int, tree
);
116 static tree
get_bindings_overload (tree
, tree
, tree
);
117 static int for_each_template_parm (tree
, tree_fn_t
, void*, htab_t
);
118 static tree
build_template_parm_index (int, int, int, tree
, tree
);
119 static int inline_needs_template_parms (tree
);
120 static void push_inline_template_parms_recursive (tree
, int);
121 static tree
retrieve_specialization (tree
, tree
);
122 static tree
retrieve_local_specialization (tree
);
123 static tree
register_specialization (tree
, tree
, tree
);
124 static void register_local_specialization (tree
, tree
);
125 static tree
reduce_template_parm_level (tree
, tree
, int);
126 static tree
build_template_decl (tree
, tree
);
127 static int mark_template_parm (tree
, void *);
128 static int template_parm_this_level_p (tree
, void *);
129 static tree
tsubst_friend_function (tree
, tree
);
130 static tree
tsubst_friend_class (tree
, tree
);
131 static int can_complete_type_without_circularity (tree
);
132 static tree
get_bindings (tree
, tree
, tree
);
133 static tree
get_bindings_real (tree
, tree
, tree
, int, int, int);
134 static int template_decl_level (tree
);
135 static int check_cv_quals_for_unify (int, tree
, tree
);
136 static tree
tsubst_template_arg (tree
, tree
, tsubst_flags_t
, tree
);
137 static tree
tsubst_template_args (tree
, tree
, tsubst_flags_t
, tree
);
138 static tree
tsubst_template_parms (tree
, tree
, tsubst_flags_t
);
139 static void regenerate_decl_from_template (tree
, tree
);
140 static tree
most_specialized (tree
, tree
, tree
);
141 static tree
most_specialized_class (tree
, tree
);
142 static int template_class_depth_real (tree
, int);
143 static tree
tsubst_aggr_type (tree
, tree
, tsubst_flags_t
, tree
, int);
144 static tree
tsubst_decl (tree
, tree
, tree
, tsubst_flags_t
);
145 static tree
tsubst_arg_types (tree
, tree
, tsubst_flags_t
, tree
);
146 static tree
tsubst_function_type (tree
, tree
, tsubst_flags_t
, tree
);
147 static void check_specialization_scope (void);
148 static tree
process_partial_specialization (tree
);
149 static void set_current_access_from_decl (tree
);
150 static void check_default_tmpl_args (tree
, tree
, int, int);
151 static tree
tsubst_call_declarator_parms (tree
, tree
, tsubst_flags_t
, tree
);
152 static tree
get_template_base_recursive (tree
, tree
, tree
, tree
, tree
, int);
153 static tree
get_template_base (tree
, tree
, tree
, tree
);
154 static int verify_class_unification (tree
, tree
, tree
);
155 static tree
try_class_unification (tree
, tree
, tree
, tree
);
156 static int coerce_template_template_parms (tree
, tree
, tsubst_flags_t
,
158 static tree
determine_specialization (tree
, tree
, tree
*, int);
159 static int template_args_equal (tree
, tree
);
160 static void tsubst_default_arguments (tree
);
161 static tree
for_each_template_parm_r (tree
*, int *, void *);
162 static tree
copy_default_args_to_explicit_spec_1 (tree
, tree
);
163 static void copy_default_args_to_explicit_spec (tree
);
164 static int invalid_nontype_parm_type_p (tree
, tsubst_flags_t
);
165 static int eq_local_specializations (const void *, const void *);
166 static bool dependent_type_p_r (tree
);
167 static tree
tsubst (tree
, tree
, tsubst_flags_t
, tree
);
168 static tree
tsubst_expr (tree
, tree
, tsubst_flags_t
, tree
);
169 static tree
tsubst_copy (tree
, tree
, tsubst_flags_t
, tree
);
171 /* Make the current scope suitable for access checking when we are
172 processing T. T can be FUNCTION_DECL for instantiated function
173 template, or VAR_DECL for static member variable (need by
174 instantiate_decl). */
177 push_access_scope (tree t
)
179 my_friendly_assert (TREE_CODE (t
) == FUNCTION_DECL
180 || TREE_CODE (t
) == VAR_DECL
,
183 if (DECL_CLASS_SCOPE_P (t
))
184 push_nested_class (DECL_CONTEXT (t
));
186 push_to_top_level ();
188 if (TREE_CODE (t
) == FUNCTION_DECL
)
190 saved_access_scope
= tree_cons
191 (NULL_TREE
, current_function_decl
, saved_access_scope
);
192 current_function_decl
= t
;
196 /* Restore the scope set up by push_access_scope. T is the node we
200 pop_access_scope (tree t
)
202 if (TREE_CODE (t
) == FUNCTION_DECL
)
204 current_function_decl
= TREE_VALUE (saved_access_scope
);
205 saved_access_scope
= TREE_CHAIN (saved_access_scope
);
208 if (DECL_CLASS_SCOPE_P (t
))
211 pop_from_top_level ();
214 /* Do any processing required when DECL (a member template
215 declaration) is finished. Returns the TEMPLATE_DECL corresponding
216 to DECL, unless it is a specialization, in which case the DECL
217 itself is returned. */
220 finish_member_template_decl (tree decl
)
222 if (decl
== error_mark_node
)
223 return error_mark_node
;
225 my_friendly_assert (DECL_P (decl
), 20020812);
227 if (TREE_CODE (decl
) == TYPE_DECL
)
231 type
= TREE_TYPE (decl
);
232 if (IS_AGGR_TYPE (type
)
233 && CLASSTYPE_TEMPLATE_INFO (type
)
234 && !CLASSTYPE_TEMPLATE_SPECIALIZATION (type
))
236 tree tmpl
= CLASSTYPE_TI_TEMPLATE (type
);
237 check_member_template (tmpl
);
242 else if (TREE_CODE (decl
) == FIELD_DECL
)
243 error ("data member `%D' cannot be a member template", decl
);
244 else if (DECL_TEMPLATE_INFO (decl
))
246 if (!DECL_TEMPLATE_SPECIALIZATION (decl
))
248 check_member_template (DECL_TI_TEMPLATE (decl
));
249 return DECL_TI_TEMPLATE (decl
);
255 error ("invalid member template declaration `%D'", decl
);
257 return error_mark_node
;
260 /* Returns the template nesting level of the indicated class TYPE.
270 A<T>::B<U> has depth two, while A<T> has depth one.
271 Both A<T>::B<int> and A<int>::B<U> have depth one, if
272 COUNT_SPECIALIZATIONS is 0 or if they are instantiations, not
275 This function is guaranteed to return 0 if passed NULL_TREE so
276 that, for example, `template_class_depth (current_class_type)' is
280 template_class_depth_real (tree type
, int count_specializations
)
285 type
&& TREE_CODE (type
) != NAMESPACE_DECL
;
286 type
= (TREE_CODE (type
) == FUNCTION_DECL
)
287 ? CP_DECL_CONTEXT (type
) : TYPE_CONTEXT (type
))
289 if (TREE_CODE (type
) != FUNCTION_DECL
)
291 if (CLASSTYPE_TEMPLATE_INFO (type
)
292 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (type
))
293 && ((count_specializations
294 && CLASSTYPE_TEMPLATE_SPECIALIZATION (type
))
295 || uses_template_parms (CLASSTYPE_TI_ARGS (type
))))
300 if (DECL_TEMPLATE_INFO (type
)
301 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (type
))
302 && ((count_specializations
303 && DECL_TEMPLATE_SPECIALIZATION (type
))
304 || uses_template_parms (DECL_TI_ARGS (type
))))
312 /* Returns the template nesting level of the indicated class TYPE.
313 Like template_class_depth_real, but instantiations do not count in
317 template_class_depth (tree type
)
319 return template_class_depth_real (type
, /*count_specializations=*/0);
322 /* Returns 1 if processing DECL as part of do_pending_inlines
323 needs us to push template parms. */
326 inline_needs_template_parms (tree decl
)
328 if (! DECL_TEMPLATE_INFO (decl
))
331 return (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (most_general_template (decl
)))
332 > (processing_template_decl
+ DECL_TEMPLATE_SPECIALIZATION (decl
)));
335 /* Subroutine of maybe_begin_member_template_processing.
336 Push the template parms in PARMS, starting from LEVELS steps into the
337 chain, and ending at the beginning, since template parms are listed
341 push_inline_template_parms_recursive (tree parmlist
, int levels
)
343 tree parms
= TREE_VALUE (parmlist
);
347 push_inline_template_parms_recursive (TREE_CHAIN (parmlist
), levels
- 1);
349 ++processing_template_decl
;
350 current_template_parms
351 = tree_cons (size_int (processing_template_decl
),
352 parms
, current_template_parms
);
353 TEMPLATE_PARMS_FOR_INLINE (current_template_parms
) = 1;
355 begin_scope (TREE_VEC_LENGTH (parms
) ? sk_template_parms
: sk_template_spec
,
357 for (i
= 0; i
< TREE_VEC_LENGTH (parms
); ++i
)
359 tree parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
360 my_friendly_assert (DECL_P (parm
), 0);
362 switch (TREE_CODE (parm
))
371 /* Make a CONST_DECL as is done in process_template_parm.
372 It is ugly that we recreate this here; the original
373 version built in process_template_parm is no longer
375 tree decl
= build_decl (CONST_DECL
, DECL_NAME (parm
),
377 DECL_ARTIFICIAL (decl
) = 1;
378 TREE_CONSTANT (decl
) = 1;
379 TREE_INVARIANT (decl
) = 1;
380 TREE_READONLY (decl
) = 1;
381 DECL_INITIAL (decl
) = DECL_INITIAL (parm
);
382 SET_DECL_TEMPLATE_PARM_P (decl
);
393 /* Restore the template parameter context for a member template or
394 a friend template defined in a class definition. */
397 maybe_begin_member_template_processing (tree decl
)
402 if (inline_needs_template_parms (decl
))
404 parms
= DECL_TEMPLATE_PARMS (most_general_template (decl
));
405 levels
= TMPL_PARMS_DEPTH (parms
) - processing_template_decl
;
407 if (DECL_TEMPLATE_SPECIALIZATION (decl
))
410 parms
= TREE_CHAIN (parms
);
413 push_inline_template_parms_recursive (parms
, levels
);
416 /* Remember how many levels of template parameters we pushed so that
417 we can pop them later. */
418 if (!inline_parm_levels
)
419 VARRAY_INT_INIT (inline_parm_levels
, 4, "inline_parm_levels");
420 if (inline_parm_levels_used
== inline_parm_levels
->num_elements
)
421 VARRAY_GROW (inline_parm_levels
, 2 * inline_parm_levels_used
);
422 VARRAY_INT (inline_parm_levels
, inline_parm_levels_used
) = levels
;
423 ++inline_parm_levels_used
;
426 /* Undo the effects of begin_member_template_processing. */
429 maybe_end_member_template_processing (void)
433 if (!inline_parm_levels_used
)
436 --inline_parm_levels_used
;
438 i
< VARRAY_INT (inline_parm_levels
, inline_parm_levels_used
);
441 --processing_template_decl
;
442 current_template_parms
= TREE_CHAIN (current_template_parms
);
447 /* Returns nonzero iff T is a member template function. We must be
450 template <class T> class C { void f(); }
452 Here, f is a template function, and a member, but not a member
453 template. This function does not concern itself with the origin of
454 T, only its present state. So if we have
456 template <class T> class C { template <class U> void f(U); }
458 then neither C<int>::f<char> nor C<T>::f<double> is considered
459 to be a member template. But, `template <class U> void
460 C<int>::f(U)' is considered a member template. */
463 is_member_template (tree t
)
465 if (!DECL_FUNCTION_TEMPLATE_P (t
))
466 /* Anything that isn't a function or a template function is
467 certainly not a member template. */
470 /* A local class can't have member templates. */
471 if (decl_function_context (t
))
474 return (DECL_FUNCTION_MEMBER_P (DECL_TEMPLATE_RESULT (t
))
475 /* If there are more levels of template parameters than
476 there are template classes surrounding the declaration,
477 then we have a member template. */
478 && (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (t
)) >
479 template_class_depth (DECL_CONTEXT (t
))));
483 /* Returns nonzero iff T is a member template class. See
484 is_member_template for a description of what precisely constitutes
485 a member template. */
488 is_member_template_class (tree t
)
490 if (!DECL_CLASS_TEMPLATE_P (t
))
491 /* Anything that isn't a class template, is certainly not a member
495 if (!DECL_CLASS_SCOPE_P (t
))
496 /* Anything whose context isn't a class type is surely not a
500 /* If there are more levels of template parameters than there are
501 template classes surrounding the declaration, then we have a
503 return (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (t
)) >
504 template_class_depth (DECL_CONTEXT (t
)));
508 /* Return a new template argument vector which contains all of ARGS,
509 but has as its innermost set of arguments the EXTRA_ARGS. */
512 add_to_template_args (tree args
, tree extra_args
)
519 extra_depth
= TMPL_ARGS_DEPTH (extra_args
);
520 new_args
= make_tree_vec (TMPL_ARGS_DEPTH (args
) + extra_depth
);
522 for (i
= 1; i
<= TMPL_ARGS_DEPTH (args
); ++i
)
523 SET_TMPL_ARGS_LEVEL (new_args
, i
, TMPL_ARGS_LEVEL (args
, i
));
525 for (j
= 1; j
<= extra_depth
; ++j
, ++i
)
526 SET_TMPL_ARGS_LEVEL (new_args
, i
, TMPL_ARGS_LEVEL (extra_args
, j
));
531 /* Like add_to_template_args, but only the outermost ARGS are added to
532 the EXTRA_ARGS. In particular, all but TMPL_ARGS_DEPTH
533 (EXTRA_ARGS) levels are added. This function is used to combine
534 the template arguments from a partial instantiation with the
535 template arguments used to attain the full instantiation from the
536 partial instantiation. */
539 add_outermost_template_args (tree args
, tree extra_args
)
543 /* If there are more levels of EXTRA_ARGS than there are ARGS,
544 something very fishy is going on. */
545 my_friendly_assert (TMPL_ARGS_DEPTH (args
) >= TMPL_ARGS_DEPTH (extra_args
),
548 /* If *all* the new arguments will be the EXTRA_ARGS, just return
550 if (TMPL_ARGS_DEPTH (args
) == TMPL_ARGS_DEPTH (extra_args
))
553 /* For the moment, we make ARGS look like it contains fewer levels. */
554 TREE_VEC_LENGTH (args
) -= TMPL_ARGS_DEPTH (extra_args
);
556 new_args
= add_to_template_args (args
, extra_args
);
558 /* Now, we restore ARGS to its full dimensions. */
559 TREE_VEC_LENGTH (args
) += TMPL_ARGS_DEPTH (extra_args
);
564 /* Return the N levels of innermost template arguments from the ARGS. */
567 get_innermost_template_args (tree args
, int n
)
573 my_friendly_assert (n
>= 0, 20000603);
575 /* If N is 1, just return the innermost set of template arguments. */
577 return TMPL_ARGS_LEVEL (args
, TMPL_ARGS_DEPTH (args
));
579 /* If we're not removing anything, just return the arguments we were
581 extra_levels
= TMPL_ARGS_DEPTH (args
) - n
;
582 my_friendly_assert (extra_levels
>= 0, 20000603);
583 if (extra_levels
== 0)
586 /* Make a new set of arguments, not containing the outer arguments. */
587 new_args
= make_tree_vec (n
);
588 for (i
= 1; i
<= n
; ++i
)
589 SET_TMPL_ARGS_LEVEL (new_args
, i
,
590 TMPL_ARGS_LEVEL (args
, i
+ extra_levels
));
595 /* We've got a template header coming up; push to a new level for storing
599 begin_template_parm_list (void)
601 /* We use a non-tag-transparent scope here, which causes pushtag to
602 put tags in this scope, rather than in the enclosing class or
603 namespace scope. This is the right thing, since we want
604 TEMPLATE_DECLS, and not TYPE_DECLS for template classes. For a
605 global template class, push_template_decl handles putting the
606 TEMPLATE_DECL into top-level scope. For a nested template class,
609 template <class T> struct S1 {
610 template <class T> struct S2 {};
613 pushtag contains special code to call pushdecl_with_scope on the
614 TEMPLATE_DECL for S2. */
615 begin_scope (sk_template_parms
, NULL
);
616 ++processing_template_decl
;
617 ++processing_template_parmlist
;
618 note_template_header (0);
621 /* This routine is called when a specialization is declared. If it is
622 invalid to declare a specialization here, an error is reported. */
625 check_specialization_scope (void)
627 tree scope
= current_scope ();
631 An explicit specialization shall be declared in the namespace of
632 which the template is a member, or, for member templates, in the
633 namespace of which the enclosing class or enclosing class
634 template is a member. An explicit specialization of a member
635 function, member class or static data member of a class template
636 shall be declared in the namespace of which the class template
638 if (scope
&& TREE_CODE (scope
) != NAMESPACE_DECL
)
639 error ("explicit specialization in non-namespace scope `%D'",
644 In an explicit specialization declaration for a member of a class
645 template or a member template that appears in namespace scope,
646 the member template and some of its enclosing class templates may
647 remain unspecialized, except that the declaration shall not
648 explicitly specialize a class member template if its enclosing
649 class templates are not explicitly specialized as well. */
650 if (current_template_parms
)
651 error ("enclosing class templates are not explicitly specialized");
654 /* We've just seen template <>. */
657 begin_specialization (void)
659 begin_scope (sk_template_spec
, NULL
);
660 note_template_header (1);
661 check_specialization_scope ();
664 /* Called at then end of processing a declaration preceded by
668 end_specialization (void)
671 reset_specialization ();
674 /* Any template <>'s that we have seen thus far are not referring to a
675 function specialization. */
678 reset_specialization (void)
680 processing_specialization
= 0;
681 template_header_count
= 0;
684 /* We've just seen a template header. If SPECIALIZATION is nonzero,
685 it was of the form template <>. */
688 note_template_header (int specialization
)
690 processing_specialization
= specialization
;
691 template_header_count
++;
694 /* We're beginning an explicit instantiation. */
697 begin_explicit_instantiation (void)
699 my_friendly_assert (!processing_explicit_instantiation
, 20020913);
700 processing_explicit_instantiation
= true;
705 end_explicit_instantiation (void)
707 my_friendly_assert(processing_explicit_instantiation
, 20020913);
708 processing_explicit_instantiation
= false;
711 /* The TYPE is being declared. If it is a template type, that means it
712 is a partial specialization. Do appropriate error-checking. */
715 maybe_process_partial_specialization (tree type
)
717 /* TYPE maybe an ERROR_MARK_NODE. */
718 tree context
= TYPE_P (type
) ? TYPE_CONTEXT (type
) : NULL_TREE
;
720 if (CLASS_TYPE_P (type
) && CLASSTYPE_USE_TEMPLATE (type
))
722 /* This is for ordinary explicit specialization and partial
723 specialization of a template class such as:
725 template <> class C<int>;
729 template <class T> class C<T*>;
731 Make sure that `C<int>' and `C<T*>' are implicit instantiations. */
733 if (CLASSTYPE_IMPLICIT_INSTANTIATION (type
)
734 && !COMPLETE_TYPE_P (type
))
736 tree tpl_ns
= decl_namespace_context (CLASSTYPE_TI_TEMPLATE (type
));
737 if (is_associated_namespace (current_namespace
, tpl_ns
))
738 /* Same or super-using namespace. */;
741 pedwarn ("specializing `%#T' in different namespace", type
);
742 cp_pedwarn_at (" from definition of `%#D'",
743 CLASSTYPE_TI_TEMPLATE (type
));
745 SET_CLASSTYPE_TEMPLATE_SPECIALIZATION (type
);
746 if (processing_template_decl
)
747 push_template_decl (TYPE_MAIN_DECL (type
));
749 else if (CLASSTYPE_TEMPLATE_INSTANTIATION (type
))
750 error ("specialization of `%T' after instantiation", type
);
752 else if (CLASS_TYPE_P (type
)
753 && !CLASSTYPE_USE_TEMPLATE (type
)
754 && CLASSTYPE_TEMPLATE_INFO (type
)
755 && context
&& CLASS_TYPE_P (context
)
756 && CLASSTYPE_TEMPLATE_INFO (context
))
758 /* This is for an explicit specialization of member class
759 template according to [temp.expl.spec/18]:
761 template <> template <class U> class C<int>::D;
763 The context `C<int>' must be an implicit instantiation.
764 Otherwise this is just a member class template declared
767 template <> class C<int> { template <class U> class D; };
768 template <> template <class U> class C<int>::D;
770 In the first case, `C<int>::D' is a specialization of `C<T>::D'
771 while in the second case, `C<int>::D' is a primary template
772 and `C<T>::D' may not exist. */
774 if (CLASSTYPE_IMPLICIT_INSTANTIATION (context
)
775 && !COMPLETE_TYPE_P (type
))
779 if (current_namespace
780 != decl_namespace_context (CLASSTYPE_TI_TEMPLATE (type
)))
782 pedwarn ("specializing `%#T' in different namespace", type
);
783 cp_pedwarn_at (" from definition of `%#D'",
784 CLASSTYPE_TI_TEMPLATE (type
));
787 /* Check for invalid specialization after instantiation:
789 template <> template <> class C<int>::D<int>;
790 template <> template <class U> class C<int>::D; */
792 for (t
= DECL_TEMPLATE_INSTANTIATIONS
793 (most_general_template (CLASSTYPE_TI_TEMPLATE (type
)));
794 t
; t
= TREE_CHAIN (t
))
795 if (TREE_VALUE (t
) != type
796 && TYPE_CONTEXT (TREE_VALUE (t
)) == context
)
797 error ("specialization `%T' after instantiation `%T'",
798 type
, TREE_VALUE (t
));
800 /* Mark TYPE as a specialization. And as a result, we only
801 have one level of template argument for the innermost
803 SET_CLASSTYPE_TEMPLATE_SPECIALIZATION (type
);
804 CLASSTYPE_TI_ARGS (type
)
805 = INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (type
));
808 else if (processing_specialization
)
809 error ("explicit specialization of non-template `%T'", type
);
812 /* Retrieve the specialization (in the sense of [temp.spec] - a
813 specialization is either an instantiation or an explicit
814 specialization) of TMPL for the given template ARGS. If there is
815 no such specialization, return NULL_TREE. The ARGS are a vector of
816 arguments, or a vector of vectors of arguments, in the case of
817 templates with more than one level of parameters. */
820 retrieve_specialization (tree tmpl
, tree args
)
824 my_friendly_assert (TREE_CODE (tmpl
) == TEMPLATE_DECL
, 0);
826 /* There should be as many levels of arguments as there are
827 levels of parameters. */
828 my_friendly_assert (TMPL_ARGS_DEPTH (args
)
829 == TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl
)),
832 for (s
= DECL_TEMPLATE_SPECIALIZATIONS (tmpl
);
835 if (comp_template_args (TREE_PURPOSE (s
), args
))
836 return TREE_VALUE (s
);
841 /* Like retrieve_specialization, but for local declarations. */
844 retrieve_local_specialization (tree tmpl
)
846 tree spec
= htab_find_with_hash (local_specializations
, tmpl
,
847 htab_hash_pointer (tmpl
));
848 return spec
? TREE_PURPOSE (spec
) : NULL_TREE
;
851 /* Returns nonzero iff DECL is a specialization of TMPL. */
854 is_specialization_of (tree decl
, tree tmpl
)
858 if (TREE_CODE (decl
) == FUNCTION_DECL
)
862 t
= DECL_TEMPLATE_INFO (t
) ? DECL_TI_TEMPLATE (t
) : NULL_TREE
)
868 my_friendly_assert (TREE_CODE (decl
) == TYPE_DECL
, 0);
870 for (t
= TREE_TYPE (decl
);
872 t
= CLASSTYPE_USE_TEMPLATE (t
)
873 ? TREE_TYPE (CLASSTYPE_TI_TEMPLATE (t
)) : NULL_TREE
)
874 if (same_type_ignoring_top_level_qualifiers_p (t
, TREE_TYPE (tmpl
)))
881 /* Returns nonzero iff DECL is a specialization of friend declaration
882 FRIEND according to [temp.friend]. */
885 is_specialization_of_friend (tree decl
, tree
friend)
887 bool need_template
= true;
890 my_friendly_assert (TREE_CODE (decl
) == FUNCTION_DECL
, 0);
892 /* For [temp.friend/6] when FRIEND is an ordinary member function
893 of a template class, we want to check if DECL is a specialization
895 if (TREE_CODE (friend) == FUNCTION_DECL
896 && DECL_TEMPLATE_INFO (friend)
897 && !DECL_USE_TEMPLATE (friend))
899 friend = DECL_TI_TEMPLATE (friend);
900 need_template
= false;
903 /* There is nothing to do if this is not a template friend. */
904 if (TREE_CODE (friend) != TEMPLATE_DECL
)
907 if (is_specialization_of (decl
, friend))
911 A member of a class template may be declared to be a friend of a
912 non-template class. In this case, the corresponding member of
913 every specialization of the class template is a friend of the
914 class granting friendship.
916 For example, given a template friend declaration
918 template <class T> friend void A<T>::f();
920 the member function below is considered a friend
922 template <> struct A<int> {
926 For this type of template friend, TEMPLATE_DEPTH below will be
927 nonzero. To determine if DECL is a friend of FRIEND, we first
928 check if the enclosing class is a specialization of another. */
930 template_depth
= template_class_depth (DECL_CONTEXT (friend));
932 && DECL_CLASS_SCOPE_P (decl
)
933 && is_specialization_of (TYPE_NAME (DECL_CONTEXT (decl
)),
934 CLASSTYPE_TI_TEMPLATE (DECL_CONTEXT (friend))))
936 /* Next, we check the members themselves. In order to handle
937 a few tricky cases like
939 template <class T> friend void A<T>::g(T t);
940 template <class T> template <T t> friend void A<T>::h();
942 we need to figure out what ARGS is (corresponding to `T' in above
943 examples) from DECL for later processing. */
945 tree context
= DECL_CONTEXT (decl
);
946 tree args
= NULL_TREE
;
947 int current_depth
= 0;
948 while (current_depth
< template_depth
)
950 if (CLASSTYPE_TEMPLATE_INFO (context
))
952 if (current_depth
== 0)
953 args
= TYPE_TI_ARGS (context
);
955 args
= add_to_template_args (TYPE_TI_ARGS (context
), args
);
958 context
= TYPE_CONTEXT (context
);
961 if (TREE_CODE (decl
) == FUNCTION_DECL
)
966 tree friend_args_type
;
969 /* Make sure that both DECL and FRIEND are templates or
971 is_template
= DECL_TEMPLATE_INFO (decl
)
972 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (decl
));
973 if (need_template
^ is_template
)
975 else if (is_template
)
977 /* If both are templates, check template parameter list. */
979 = tsubst_template_parms (DECL_TEMPLATE_PARMS (friend),
981 if (!comp_template_parms
982 (DECL_TEMPLATE_PARMS (DECL_TI_TEMPLATE (decl
)),
986 decl_type
= TREE_TYPE (DECL_TI_TEMPLATE (decl
));
989 decl_type
= TREE_TYPE (decl
);
991 friend_type
= tsubst_function_type (TREE_TYPE (friend), args
,
993 if (friend_type
== error_mark_node
)
996 /* Check if return types match. */
997 if (!same_type_p (TREE_TYPE (decl_type
), TREE_TYPE (friend_type
)))
1000 /* Check if function parameter types match, ignoring the
1001 `this' parameter. */
1002 friend_args_type
= TYPE_ARG_TYPES (friend_type
);
1003 decl_args_type
= TYPE_ARG_TYPES (decl_type
);
1004 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (friend))
1005 friend_args_type
= TREE_CHAIN (friend_args_type
);
1006 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
1007 decl_args_type
= TREE_CHAIN (decl_args_type
);
1008 if (compparms (decl_args_type
, friend_args_type
))
1015 /* Register the specialization SPEC as a specialization of TMPL with
1016 the indicated ARGS. Returns SPEC, or an equivalent prior
1017 declaration, if available. */
1020 register_specialization (tree spec
, tree tmpl
, tree args
)
1024 my_friendly_assert (TREE_CODE (tmpl
) == TEMPLATE_DECL
, 0);
1026 if (TREE_CODE (spec
) == FUNCTION_DECL
1027 && uses_template_parms (DECL_TI_ARGS (spec
)))
1028 /* This is the FUNCTION_DECL for a partial instantiation. Don't
1029 register it; we want the corresponding TEMPLATE_DECL instead.
1030 We use `uses_template_parms (DECL_TI_ARGS (spec))' rather than
1031 the more obvious `uses_template_parms (spec)' to avoid problems
1032 with default function arguments. In particular, given
1033 something like this:
1035 template <class T> void f(T t1, T t = T())
1037 the default argument expression is not substituted for in an
1038 instantiation unless and until it is actually needed. */
1041 /* There should be as many levels of arguments as there are
1042 levels of parameters. */
1043 my_friendly_assert (TMPL_ARGS_DEPTH (args
)
1044 == TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl
)),
1047 for (s
= DECL_TEMPLATE_SPECIALIZATIONS (tmpl
);
1051 tree fn
= TREE_VALUE (s
);
1053 /* We can sometimes try to re-register a specialization that we've
1054 already got. In particular, regenerate_decl_from_template
1055 calls duplicate_decls which will update the specialization
1056 list. But, we'll still get called again here anyhow. It's
1057 more convenient to simply allow this than to try to prevent it. */
1060 else if (comp_template_args (TREE_PURPOSE (s
), args
))
1062 if (DECL_TEMPLATE_SPECIALIZATION (spec
))
1064 if (DECL_TEMPLATE_INSTANTIATION (fn
))
1067 || DECL_EXPLICIT_INSTANTIATION (fn
))
1069 error ("specialization of %D after instantiation",
1075 /* This situation should occur only if the first
1076 specialization is an implicit instantiation,
1077 the second is an explicit specialization, and
1078 the implicit instantiation has not yet been
1079 used. That situation can occur if we have
1080 implicitly instantiated a member function and
1081 then specialized it later.
1083 We can also wind up here if a friend
1084 declaration that looked like an instantiation
1085 turns out to be a specialization:
1087 template <class T> void foo(T);
1088 class S { friend void foo<>(int) };
1089 template <> void foo(int);
1091 We transform the existing DECL in place so that
1092 any pointers to it become pointers to the
1093 updated declaration.
1095 If there was a definition for the template, but
1096 not for the specialization, we want this to
1097 look as if there were no definition, and vice
1099 DECL_INITIAL (fn
) = NULL_TREE
;
1100 duplicate_decls (spec
, fn
);
1105 else if (DECL_TEMPLATE_SPECIALIZATION (fn
))
1107 if (!duplicate_decls (spec
, fn
) && DECL_INITIAL (spec
))
1108 /* Dup decl failed, but this is a new
1109 definition. Set the line number so any errors
1110 match this new definition. */
1111 DECL_SOURCE_LOCATION (fn
) = DECL_SOURCE_LOCATION (spec
);
1119 DECL_TEMPLATE_SPECIALIZATIONS (tmpl
)
1120 = tree_cons (args
, spec
, DECL_TEMPLATE_SPECIALIZATIONS (tmpl
));
1125 /* Unregister the specialization SPEC as a specialization of TMPL.
1126 Replace it with NEW_SPEC, if NEW_SPEC is non-NULL. Returns true
1127 if the SPEC was listed as a specialization of TMPL. */
1130 reregister_specialization (tree spec
, tree tmpl
, tree new_spec
)
1134 for (s
= &DECL_TEMPLATE_SPECIALIZATIONS (tmpl
);
1136 s
= &TREE_CHAIN (*s
))
1137 if (TREE_VALUE (*s
) == spec
)
1140 *s
= TREE_CHAIN (*s
);
1142 TREE_VALUE (*s
) = new_spec
;
1149 /* Compare an entry in the local specializations hash table P1 (which
1150 is really a pointer to a TREE_LIST) with P2 (which is really a
1154 eq_local_specializations (const void *p1
, const void *p2
)
1156 return TREE_VALUE ((tree
) p1
) == (tree
) p2
;
1159 /* Hash P1, an entry in the local specializations table. */
1162 hash_local_specialization (const void* p1
)
1164 return htab_hash_pointer (TREE_VALUE ((tree
) p1
));
1167 /* Like register_specialization, but for local declarations. We are
1168 registering SPEC, an instantiation of TMPL. */
1171 register_local_specialization (tree spec
, tree tmpl
)
1175 slot
= htab_find_slot_with_hash (local_specializations
, tmpl
,
1176 htab_hash_pointer (tmpl
), INSERT
);
1177 *slot
= build_tree_list (spec
, tmpl
);
1180 /* Print the list of candidate FNS in an error message. */
1183 print_candidates (tree fns
)
1187 const char *str
= "candidates are:";
1189 for (fn
= fns
; fn
!= NULL_TREE
; fn
= TREE_CHAIN (fn
))
1193 for (f
= TREE_VALUE (fn
); f
; f
= OVL_NEXT (f
))
1194 cp_error_at ("%s %+#D", str
, OVL_CURRENT (f
));
1199 /* Returns the template (one of the functions given by TEMPLATE_ID)
1200 which can be specialized to match the indicated DECL with the
1201 explicit template args given in TEMPLATE_ID. The DECL may be
1202 NULL_TREE if none is available. In that case, the functions in
1203 TEMPLATE_ID are non-members.
1205 If NEED_MEMBER_TEMPLATE is nonzero the function is known to be a
1206 specialization of a member template.
1208 The template args (those explicitly specified and those deduced)
1209 are output in a newly created vector *TARGS_OUT.
1211 If it is impossible to determine the result, an error message is
1212 issued. The error_mark_node is returned to indicate failure. */
1215 determine_specialization (tree template_id
,
1218 int need_member_template
)
1222 tree explicit_targs
;
1223 tree candidates
= NULL_TREE
;
1224 tree templates
= NULL_TREE
;
1226 *targs_out
= NULL_TREE
;
1228 if (template_id
== error_mark_node
)
1229 return error_mark_node
;
1231 fns
= TREE_OPERAND (template_id
, 0);
1232 explicit_targs
= TREE_OPERAND (template_id
, 1);
1234 if (fns
== error_mark_node
)
1235 return error_mark_node
;
1237 /* Check for baselinks. */
1238 if (BASELINK_P (fns
))
1239 fns
= BASELINK_FUNCTIONS (fns
);
1241 if (!is_overloaded_fn (fns
))
1243 error ("`%D' is not a function template", fns
);
1244 return error_mark_node
;
1247 for (; fns
; fns
= OVL_NEXT (fns
))
1249 tree fn
= OVL_CURRENT (fns
);
1251 if (TREE_CODE (fn
) == TEMPLATE_DECL
)
1253 tree decl_arg_types
;
1256 /* DECL might be a specialization of FN. */
1258 /* Adjust the type of DECL in case FN is a static member. */
1259 decl_arg_types
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
1260 if (DECL_STATIC_FUNCTION_P (fn
)
1261 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
1262 decl_arg_types
= TREE_CHAIN (decl_arg_types
);
1264 /* Check that the number of function parameters matches.
1266 template <class T> void f(int i = 0);
1267 template <> void f<int>();
1268 The specialization f<int> is invalid but is not caught
1269 by get_bindings below. */
1271 fn_arg_types
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
1272 if (list_length (fn_arg_types
) != list_length (decl_arg_types
))
1275 /* For a non-static member function, we need to make sure that
1276 the const qualification is the same. This can be done by
1277 checking the 'this' in the argument list. */
1278 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
)
1279 && !same_type_p (TREE_VALUE (fn_arg_types
),
1280 TREE_VALUE (decl_arg_types
)))
1283 /* See whether this function might be a specialization of this
1285 targs
= get_bindings (fn
, decl
, explicit_targs
);
1288 /* We cannot deduce template arguments that when used to
1289 specialize TMPL will produce DECL. */
1292 /* Save this template, and the arguments deduced. */
1293 templates
= tree_cons (targs
, fn
, templates
);
1295 else if (need_member_template
)
1296 /* FN is an ordinary member function, and we need a
1297 specialization of a member template. */
1299 else if (TREE_CODE (fn
) != FUNCTION_DECL
)
1300 /* We can get IDENTIFIER_NODEs here in certain erroneous
1303 else if (!DECL_FUNCTION_MEMBER_P (fn
))
1304 /* This is just an ordinary non-member function. Nothing can
1305 be a specialization of that. */
1307 else if (DECL_ARTIFICIAL (fn
))
1308 /* Cannot specialize functions that are created implicitly. */
1312 tree decl_arg_types
;
1314 /* This is an ordinary member function. However, since
1315 we're here, we can assume it's enclosing class is a
1316 template class. For example,
1318 template <typename T> struct S { void f(); };
1319 template <> void S<int>::f() {}
1321 Here, S<int>::f is a non-template, but S<int> is a
1322 template class. If FN has the same type as DECL, we
1323 might be in business. */
1325 if (!DECL_TEMPLATE_INFO (fn
))
1326 /* Its enclosing class is an explicit specialization
1327 of a template class. This is not a candidate. */
1330 if (!same_type_p (TREE_TYPE (TREE_TYPE (decl
)),
1331 TREE_TYPE (TREE_TYPE (fn
))))
1332 /* The return types differ. */
1335 /* Adjust the type of DECL in case FN is a static member. */
1336 decl_arg_types
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
1337 if (DECL_STATIC_FUNCTION_P (fn
)
1338 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
1339 decl_arg_types
= TREE_CHAIN (decl_arg_types
);
1341 if (compparms (TYPE_ARG_TYPES (TREE_TYPE (fn
)),
1344 candidates
= tree_cons (NULL_TREE
, fn
, candidates
);
1348 if (templates
&& TREE_CHAIN (templates
))
1354 It is possible for a specialization with a given function
1355 signature to be instantiated from more than one function
1356 template. In such cases, explicit specification of the
1357 template arguments must be used to uniquely identify the
1358 function template specialization being specialized.
1360 Note that here, there's no suggestion that we're supposed to
1361 determine which of the candidate templates is most
1362 specialized. However, we, also have:
1366 Partial ordering of overloaded function template
1367 declarations is used in the following contexts to select
1368 the function template to which a function template
1369 specialization refers:
1371 -- when an explicit specialization refers to a function
1374 So, we do use the partial ordering rules, at least for now.
1375 This extension can only serve to make invalid programs valid,
1376 so it's safe. And, there is strong anecdotal evidence that
1377 the committee intended the partial ordering rules to apply;
1378 the EDG front-end has that behavior, and John Spicer claims
1379 that the committee simply forgot to delete the wording in
1380 [temp.expl.spec]. */
1381 tree tmpl
= most_specialized (templates
, decl
, explicit_targs
);
1382 if (tmpl
&& tmpl
!= error_mark_node
)
1384 targs
= get_bindings (tmpl
, decl
, explicit_targs
);
1385 templates
= tree_cons (targs
, tmpl
, NULL_TREE
);
1389 if (templates
== NULL_TREE
&& candidates
== NULL_TREE
)
1391 cp_error_at ("template-id `%D' for `%+D' does not match any template declaration",
1393 return error_mark_node
;
1395 else if ((templates
&& TREE_CHAIN (templates
))
1396 || (candidates
&& TREE_CHAIN (candidates
))
1397 || (templates
&& candidates
))
1399 cp_error_at ("ambiguous template specialization `%D' for `%+D'",
1401 chainon (candidates
, templates
);
1402 print_candidates (candidates
);
1403 return error_mark_node
;
1406 /* We have one, and exactly one, match. */
1409 /* It was a specialization of an ordinary member function in a
1411 *targs_out
= copy_node (DECL_TI_ARGS (TREE_VALUE (candidates
)));
1412 return DECL_TI_TEMPLATE (TREE_VALUE (candidates
));
1415 /* It was a specialization of a template. */
1416 targs
= DECL_TI_ARGS (DECL_TEMPLATE_RESULT (TREE_VALUE (templates
)));
1417 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (targs
))
1419 *targs_out
= copy_node (targs
);
1420 SET_TMPL_ARGS_LEVEL (*targs_out
,
1421 TMPL_ARGS_DEPTH (*targs_out
),
1422 TREE_PURPOSE (templates
));
1425 *targs_out
= TREE_PURPOSE (templates
);
1426 return TREE_VALUE (templates
);
1429 /* Returns a chain of parameter types, exactly like the SPEC_TYPES,
1430 but with the default argument values filled in from those in the
1434 copy_default_args_to_explicit_spec_1 (tree spec_types
,
1437 tree new_spec_types
;
1442 if (spec_types
== void_list_node
)
1443 return void_list_node
;
1445 /* Substitute into the rest of the list. */
1447 copy_default_args_to_explicit_spec_1 (TREE_CHAIN (spec_types
),
1448 TREE_CHAIN (tmpl_types
));
1450 /* Add the default argument for this parameter. */
1451 return hash_tree_cons (TREE_PURPOSE (tmpl_types
),
1452 TREE_VALUE (spec_types
),
1456 /* DECL is an explicit specialization. Replicate default arguments
1457 from the template it specializes. (That way, code like:
1459 template <class T> void f(T = 3);
1460 template <> void f(double);
1463 works, as required.) An alternative approach would be to look up
1464 the correct default arguments at the call-site, but this approach
1465 is consistent with how implicit instantiations are handled. */
1468 copy_default_args_to_explicit_spec (tree decl
)
1473 tree new_spec_types
;
1477 tree object_type
= NULL_TREE
;
1478 tree in_charge
= NULL_TREE
;
1479 tree vtt
= NULL_TREE
;
1481 /* See if there's anything we need to do. */
1482 tmpl
= DECL_TI_TEMPLATE (decl
);
1483 tmpl_types
= TYPE_ARG_TYPES (TREE_TYPE (DECL_TEMPLATE_RESULT (tmpl
)));
1484 for (t
= tmpl_types
; t
; t
= TREE_CHAIN (t
))
1485 if (TREE_PURPOSE (t
))
1490 old_type
= TREE_TYPE (decl
);
1491 spec_types
= TYPE_ARG_TYPES (old_type
);
1493 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
1495 /* Remove the this pointer, but remember the object's type for
1497 object_type
= TREE_TYPE (TREE_VALUE (spec_types
));
1498 spec_types
= TREE_CHAIN (spec_types
);
1499 tmpl_types
= TREE_CHAIN (tmpl_types
);
1501 if (DECL_HAS_IN_CHARGE_PARM_P (decl
))
1503 /* DECL may contain more parameters than TMPL due to the extra
1504 in-charge parameter in constructors and destructors. */
1505 in_charge
= spec_types
;
1506 spec_types
= TREE_CHAIN (spec_types
);
1508 if (DECL_HAS_VTT_PARM_P (decl
))
1511 spec_types
= TREE_CHAIN (spec_types
);
1515 /* Compute the merged default arguments. */
1517 copy_default_args_to_explicit_spec_1 (spec_types
, tmpl_types
);
1519 /* Compute the new FUNCTION_TYPE. */
1523 new_spec_types
= hash_tree_cons (TREE_PURPOSE (vtt
),
1528 /* Put the in-charge parameter back. */
1529 new_spec_types
= hash_tree_cons (TREE_PURPOSE (in_charge
),
1530 TREE_VALUE (in_charge
),
1533 new_type
= build_method_type_directly (object_type
,
1534 TREE_TYPE (old_type
),
1538 new_type
= build_function_type (TREE_TYPE (old_type
),
1540 new_type
= cp_build_type_attribute_variant (new_type
,
1541 TYPE_ATTRIBUTES (old_type
));
1542 new_type
= build_exception_variant (new_type
,
1543 TYPE_RAISES_EXCEPTIONS (old_type
));
1544 TREE_TYPE (decl
) = new_type
;
1547 /* Check to see if the function just declared, as indicated in
1548 DECLARATOR, and in DECL, is a specialization of a function
1549 template. We may also discover that the declaration is an explicit
1550 instantiation at this point.
1552 Returns DECL, or an equivalent declaration that should be used
1553 instead if all goes well. Issues an error message if something is
1554 amiss. Returns error_mark_node if the error is not easily
1557 FLAGS is a bitmask consisting of the following flags:
1559 2: The function has a definition.
1560 4: The function is a friend.
1562 The TEMPLATE_COUNT is the number of references to qualifying
1563 template classes that appeared in the name of the function. For
1566 template <class T> struct S { void f(); };
1569 the TEMPLATE_COUNT would be 1. However, explicitly specialized
1570 classes are not counted in the TEMPLATE_COUNT, so that in
1572 template <class T> struct S {};
1573 template <> struct S<int> { void f(); }
1574 template <> void S<int>::f();
1576 the TEMPLATE_COUNT would be 0. (Note that this declaration is
1577 invalid; there should be no template <>.)
1579 If the function is a specialization, it is marked as such via
1580 DECL_TEMPLATE_SPECIALIZATION. Furthermore, its DECL_TEMPLATE_INFO
1581 is set up correctly, and it is added to the list of specializations
1582 for that template. */
1585 check_explicit_specialization (tree declarator
,
1590 int have_def
= flags
& 2;
1591 int is_friend
= flags
& 4;
1592 int specialization
= 0;
1593 int explicit_instantiation
= 0;
1594 int member_specialization
= 0;
1595 tree ctype
= DECL_CLASS_CONTEXT (decl
);
1596 tree dname
= DECL_NAME (decl
);
1599 tsk
= current_tmpl_spec_kind (template_count
);
1604 if (processing_specialization
)
1607 SET_DECL_TEMPLATE_SPECIALIZATION (decl
);
1609 else if (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
)
1612 /* This could be something like:
1614 template <class T> void f(T);
1615 class S { friend void f<>(int); } */
1619 /* This case handles bogus declarations like template <>
1620 template <class T> void f<int>(); */
1622 error ("template-id `%D' in declaration of primary template",
1629 case tsk_invalid_member_spec
:
1630 /* The error has already been reported in
1631 check_specialization_scope. */
1632 return error_mark_node
;
1634 case tsk_invalid_expl_inst
:
1635 error ("template parameter list used in explicit instantiation");
1641 error ("definition provided for explicit instantiation");
1643 explicit_instantiation
= 1;
1646 case tsk_excessive_parms
:
1647 error ("too many template parameter lists in declaration of `%D'",
1649 return error_mark_node
;
1653 SET_DECL_TEMPLATE_SPECIALIZATION (decl
);
1655 member_specialization
= 1;
1660 case tsk_insufficient_parms
:
1661 if (template_header_count
)
1663 error("too few template parameter lists in declaration of `%D'",
1667 else if (ctype
!= NULL_TREE
1668 && !TYPE_BEING_DEFINED (ctype
)
1669 && CLASSTYPE_TEMPLATE_INSTANTIATION (ctype
)
1672 /* For backwards compatibility, we accept:
1674 template <class T> struct S { void f(); };
1675 void S<int>::f() {} // Missing template <>
1677 That used to be valid C++. */
1680 ("explicit specialization not preceded by `template <>'");
1682 SET_DECL_TEMPLATE_SPECIALIZATION (decl
);
1687 if (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
)
1689 /* This case handles bogus declarations like template <>
1690 template <class T> void f<int>(); */
1692 if (uses_template_parms (declarator
))
1693 error ("function template partial specialization `%D' "
1694 "is not allowed", declarator
);
1696 error ("template-id `%D' in declaration of primary template",
1701 if (ctype
&& CLASSTYPE_TEMPLATE_INSTANTIATION (ctype
))
1702 /* This is a specialization of a member template, without
1703 specialization the containing class. Something like:
1705 template <class T> struct S {
1706 template <class U> void f (U);
1708 template <> template <class U> void S<int>::f(U) {}
1710 That's a specialization -- but of the entire template. */
1718 if (specialization
|| member_specialization
)
1720 tree t
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
1721 for (; t
; t
= TREE_CHAIN (t
))
1722 if (TREE_PURPOSE (t
))
1725 ("default argument specified in explicit specialization");
1728 if (current_lang_name
== lang_name_c
)
1729 error ("template specialization with C linkage");
1732 if (specialization
|| member_specialization
|| explicit_instantiation
)
1734 tree tmpl
= NULL_TREE
;
1735 tree targs
= NULL_TREE
;
1737 /* Make sure that the declarator is a TEMPLATE_ID_EXPR. */
1738 if (TREE_CODE (declarator
) != TEMPLATE_ID_EXPR
)
1742 my_friendly_assert (TREE_CODE (declarator
) == IDENTIFIER_NODE
, 0);
1747 /* If there is no class context, the explicit instantiation
1748 must be at namespace scope. */
1749 my_friendly_assert (DECL_NAMESPACE_SCOPE_P (decl
), 20030625);
1751 /* Find the namespace binding, using the declaration
1753 fns
= namespace_binding (dname
, CP_DECL_CONTEXT (decl
));
1756 declarator
= lookup_template_function (fns
, NULL_TREE
);
1759 if (declarator
== error_mark_node
)
1760 return error_mark_node
;
1762 if (ctype
!= NULL_TREE
&& TYPE_BEING_DEFINED (ctype
))
1764 if (!explicit_instantiation
)
1765 /* A specialization in class scope. This is invalid,
1766 but the error will already have been flagged by
1767 check_specialization_scope. */
1768 return error_mark_node
;
1771 /* It's not valid to write an explicit instantiation in
1774 class C { template void f(); }
1776 This case is caught by the parser. However, on
1779 template class C { void f(); };
1781 (which is invalid) we can get here. The error will be
1788 else if (ctype
!= NULL_TREE
1789 && (TREE_CODE (TREE_OPERAND (declarator
, 0)) ==
1792 /* Find the list of functions in ctype that have the same
1793 name as the declared function. */
1794 tree name
= TREE_OPERAND (declarator
, 0);
1795 tree fns
= NULL_TREE
;
1798 if (constructor_name_p (name
, ctype
))
1800 int is_constructor
= DECL_CONSTRUCTOR_P (decl
);
1802 if (is_constructor
? !TYPE_HAS_CONSTRUCTOR (ctype
)
1803 : !TYPE_HAS_DESTRUCTOR (ctype
))
1805 /* From [temp.expl.spec]:
1807 If such an explicit specialization for the member
1808 of a class template names an implicitly-declared
1809 special member function (clause _special_), the
1810 program is ill-formed.
1812 Similar language is found in [temp.explicit]. */
1813 error ("specialization of implicitly-declared special member function");
1814 return error_mark_node
;
1817 name
= is_constructor
? ctor_identifier
: dtor_identifier
;
1820 if (!DECL_CONV_FN_P (decl
))
1822 idx
= lookup_fnfields_1 (ctype
, name
);
1824 fns
= TREE_VEC_ELT (CLASSTYPE_METHOD_VEC (ctype
), idx
);
1830 /* For a type-conversion operator, we cannot do a
1831 name-based lookup. We might be looking for `operator
1832 int' which will be a specialization of `operator T'.
1833 So, we find *all* the conversion operators, and then
1834 select from them. */
1837 methods
= CLASSTYPE_METHOD_VEC (ctype
);
1839 for (idx
= CLASSTYPE_FIRST_CONVERSION_SLOT
;
1840 idx
< TREE_VEC_LENGTH (methods
); ++idx
)
1842 tree ovl
= TREE_VEC_ELT (methods
, idx
);
1844 if (!ovl
|| !DECL_CONV_FN_P (OVL_CURRENT (ovl
)))
1845 /* There are no more conversion functions. */
1848 /* Glue all these conversion functions together
1849 with those we already have. */
1850 for (; ovl
; ovl
= OVL_NEXT (ovl
))
1851 fns
= ovl_cons (OVL_CURRENT (ovl
), fns
);
1855 if (fns
== NULL_TREE
)
1857 error ("no member function `%D' declared in `%T'",
1859 return error_mark_node
;
1862 TREE_OPERAND (declarator
, 0) = fns
;
1865 /* Figure out what exactly is being specialized at this point.
1866 Note that for an explicit instantiation, even one for a
1867 member function, we cannot tell apriori whether the
1868 instantiation is for a member template, or just a member
1869 function of a template class. Even if a member template is
1870 being instantiated, the member template arguments may be
1871 elided if they can be deduced from the rest of the
1873 tmpl
= determine_specialization (declarator
, decl
,
1875 member_specialization
);
1877 if (!tmpl
|| tmpl
== error_mark_node
)
1878 /* We couldn't figure out what this declaration was
1880 return error_mark_node
;
1883 tree gen_tmpl
= most_general_template (tmpl
);
1885 if (explicit_instantiation
)
1887 /* We don't set DECL_EXPLICIT_INSTANTIATION here; that
1888 is done by do_decl_instantiation later. */
1890 int arg_depth
= TMPL_ARGS_DEPTH (targs
);
1891 int parm_depth
= TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl
));
1893 if (arg_depth
> parm_depth
)
1895 /* If TMPL is not the most general template (for
1896 example, if TMPL is a friend template that is
1897 injected into namespace scope), then there will
1898 be too many levels of TARGS. Remove some of them
1903 new_targs
= make_tree_vec (parm_depth
);
1904 for (i
= arg_depth
- parm_depth
; i
< arg_depth
; ++i
)
1905 TREE_VEC_ELT (new_targs
, i
- (arg_depth
- parm_depth
))
1906 = TREE_VEC_ELT (targs
, i
);
1910 return instantiate_template (tmpl
, targs
, tf_error
);
1913 /* If we thought that the DECL was a member function, but it
1914 turns out to be specializing a static member function,
1915 make DECL a static member function as well. */
1916 if (DECL_STATIC_FUNCTION_P (tmpl
)
1917 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
1918 revert_static_member_fn (decl
);
1920 /* If this is a specialization of a member template of a
1921 template class. In we want to return the TEMPLATE_DECL,
1922 not the specialization of it. */
1923 if (tsk
== tsk_template
)
1925 SET_DECL_TEMPLATE_SPECIALIZATION (tmpl
);
1926 DECL_INITIAL (DECL_TEMPLATE_RESULT (tmpl
)) = NULL_TREE
;
1929 DECL_SOURCE_LOCATION (tmpl
) = DECL_SOURCE_LOCATION (decl
);
1930 DECL_SOURCE_LOCATION (DECL_TEMPLATE_RESULT (tmpl
))
1931 = DECL_SOURCE_LOCATION (decl
);
1936 /* Set up the DECL_TEMPLATE_INFO for DECL. */
1937 DECL_TEMPLATE_INFO (decl
) = tree_cons (tmpl
, targs
, NULL_TREE
);
1939 /* Inherit default function arguments from the template
1940 DECL is specializing. */
1941 copy_default_args_to_explicit_spec (decl
);
1943 /* This specialization has the same protection as the
1944 template it specializes. */
1945 TREE_PRIVATE (decl
) = TREE_PRIVATE (gen_tmpl
);
1946 TREE_PROTECTED (decl
) = TREE_PROTECTED (gen_tmpl
);
1948 if (is_friend
&& !have_def
)
1949 /* This is not really a declaration of a specialization.
1950 It's just the name of an instantiation. But, it's not
1951 a request for an instantiation, either. */
1952 SET_DECL_IMPLICIT_INSTANTIATION (decl
);
1953 else if (DECL_CONSTRUCTOR_P (decl
) || DECL_DESTRUCTOR_P (decl
))
1954 /* This is indeed a specialization. In case of constructors
1955 and destructors, we need in-charge and not-in-charge
1956 versions in V3 ABI. */
1957 clone_function_decl (decl
, /*update_method_vec_p=*/0);
1959 /* Register this specialization so that we can find it
1961 decl
= register_specialization (decl
, gen_tmpl
, targs
);
1968 /* TYPE is being declared. Verify that the use of template headers
1969 and such is reasonable. Issue error messages if not. */
1972 maybe_check_template_type (tree type
)
1974 if (template_header_count
)
1976 /* We are in the scope of some `template <...>' header. */
1979 = template_class_depth_real (TYPE_CONTEXT (type
),
1980 /*count_specializations=*/1);
1982 if (template_header_count
<= context_depth
)
1983 /* This is OK; the template headers are for the context. We
1984 are actually too lenient here; like
1985 check_explicit_specialization we should consider the number
1986 of template types included in the actual declaration. For
1989 template <class T> struct S {
1990 template <class U> template <class V>
1996 template <class T> struct S {
1997 template <class U> struct I;
2000 template <class T> template <class U.
2005 else if (template_header_count
> context_depth
+ 1)
2006 /* There are two many template parameter lists. */
2007 error ("too many template parameter lists in declaration of `%T'", type
);
2011 /* Returns 1 iff PARMS1 and PARMS2 are identical sets of template
2012 parameters. These are represented in the same format used for
2013 DECL_TEMPLATE_PARMS. */
2015 int comp_template_parms (tree parms1
, tree parms2
)
2020 if (parms1
== parms2
)
2023 for (p1
= parms1
, p2
= parms2
;
2024 p1
!= NULL_TREE
&& p2
!= NULL_TREE
;
2025 p1
= TREE_CHAIN (p1
), p2
= TREE_CHAIN (p2
))
2027 tree t1
= TREE_VALUE (p1
);
2028 tree t2
= TREE_VALUE (p2
);
2031 my_friendly_assert (TREE_CODE (t1
) == TREE_VEC
, 0);
2032 my_friendly_assert (TREE_CODE (t2
) == TREE_VEC
, 0);
2034 if (TREE_VEC_LENGTH (t1
) != TREE_VEC_LENGTH (t2
))
2037 for (i
= 0; i
< TREE_VEC_LENGTH (t2
); ++i
)
2039 tree parm1
= TREE_VALUE (TREE_VEC_ELT (t1
, i
));
2040 tree parm2
= TREE_VALUE (TREE_VEC_ELT (t2
, i
));
2042 if (TREE_CODE (parm1
) != TREE_CODE (parm2
))
2045 if (TREE_CODE (parm1
) == TEMPLATE_TYPE_PARM
)
2047 else if (!same_type_p (TREE_TYPE (parm1
), TREE_TYPE (parm2
)))
2052 if ((p1
!= NULL_TREE
) != (p2
!= NULL_TREE
))
2053 /* One set of parameters has more parameters lists than the
2060 /* Complain if DECL shadows a template parameter.
2062 [temp.local]: A template-parameter shall not be redeclared within its
2063 scope (including nested scopes). */
2066 check_template_shadow (tree decl
)
2070 /* If we're not in a template, we can't possibly shadow a template
2072 if (!current_template_parms
)
2075 /* Figure out what we're shadowing. */
2076 if (TREE_CODE (decl
) == OVERLOAD
)
2077 decl
= OVL_CURRENT (decl
);
2078 olddecl
= IDENTIFIER_VALUE (DECL_NAME (decl
));
2080 /* If there's no previous binding for this name, we're not shadowing
2081 anything, let alone a template parameter. */
2085 /* If we're not shadowing a template parameter, we're done. Note
2086 that OLDDECL might be an OVERLOAD (or perhaps even an
2087 ERROR_MARK), so we can't just blithely assume it to be a _DECL
2089 if (!DECL_P (olddecl
) || !DECL_TEMPLATE_PARM_P (olddecl
))
2092 /* We check for decl != olddecl to avoid bogus errors for using a
2093 name inside a class. We check TPFI to avoid duplicate errors for
2094 inline member templates. */
2096 || TEMPLATE_PARMS_FOR_INLINE (current_template_parms
))
2099 cp_error_at ("declaration of `%#D'", decl
);
2100 cp_error_at (" shadows template parm `%#D'", olddecl
);
2103 /* Return a new TEMPLATE_PARM_INDEX with the indicated INDEX, LEVEL,
2104 ORIG_LEVEL, DECL, and TYPE. */
2107 build_template_parm_index (int index
,
2113 tree t
= make_node (TEMPLATE_PARM_INDEX
);
2114 TEMPLATE_PARM_IDX (t
) = index
;
2115 TEMPLATE_PARM_LEVEL (t
) = level
;
2116 TEMPLATE_PARM_ORIG_LEVEL (t
) = orig_level
;
2117 TEMPLATE_PARM_DECL (t
) = decl
;
2118 TREE_TYPE (t
) = type
;
2119 TREE_CONSTANT (t
) = TREE_CONSTANT (decl
);
2120 TREE_INVARIANT (t
) = TREE_INVARIANT (decl
);
2121 TREE_READONLY (t
) = TREE_READONLY (decl
);
2126 /* Return a TEMPLATE_PARM_INDEX, similar to INDEX, but whose
2127 TEMPLATE_PARM_LEVEL has been decreased by LEVELS. If such a
2128 TEMPLATE_PARM_INDEX already exists, it is returned; otherwise, a
2129 new one is created. */
2132 reduce_template_parm_level (tree index
, tree type
, int levels
)
2134 if (TEMPLATE_PARM_DESCENDANTS (index
) == NULL_TREE
2135 || (TEMPLATE_PARM_LEVEL (TEMPLATE_PARM_DESCENDANTS (index
))
2136 != TEMPLATE_PARM_LEVEL (index
) - levels
))
2138 tree orig_decl
= TEMPLATE_PARM_DECL (index
);
2141 decl
= build_decl (TREE_CODE (orig_decl
), DECL_NAME (orig_decl
), type
);
2142 TREE_CONSTANT (decl
) = TREE_CONSTANT (orig_decl
);
2143 TREE_INVARIANT (decl
) = TREE_INVARIANT (orig_decl
);
2144 TREE_READONLY (decl
) = TREE_READONLY (orig_decl
);
2145 DECL_ARTIFICIAL (decl
) = 1;
2146 SET_DECL_TEMPLATE_PARM_P (decl
);
2148 t
= build_template_parm_index (TEMPLATE_PARM_IDX (index
),
2149 TEMPLATE_PARM_LEVEL (index
) - levels
,
2150 TEMPLATE_PARM_ORIG_LEVEL (index
),
2152 TEMPLATE_PARM_DESCENDANTS (index
) = t
;
2154 /* Template template parameters need this. */
2155 DECL_TEMPLATE_PARMS (decl
)
2156 = DECL_TEMPLATE_PARMS (TEMPLATE_PARM_DECL (index
));
2159 return TEMPLATE_PARM_DESCENDANTS (index
);
2162 /* Process information from new template parameter NEXT and append it to the
2163 LIST being built. This new parameter is a non-type parameter iff
2164 IS_NON_TYPE is true. */
2167 process_template_parm (tree list
, tree next
, bool is_non_type
)
2175 my_friendly_assert (TREE_CODE (parm
) == TREE_LIST
, 259);
2176 defval
= TREE_PURPOSE (parm
);
2180 tree p
= TREE_VALUE (tree_last (list
));
2182 if (TREE_CODE (p
) == TYPE_DECL
|| TREE_CODE (p
) == TEMPLATE_DECL
)
2183 idx
= TEMPLATE_TYPE_IDX (TREE_TYPE (p
));
2185 idx
= TEMPLATE_PARM_IDX (DECL_INITIAL (p
));
2193 parm
= TREE_VALUE (parm
);
2195 SET_DECL_TEMPLATE_PARM_P (parm
);
2199 The top-level cv-qualifiers on the template-parameter are
2200 ignored when determining its type. */
2201 TREE_TYPE (parm
) = TYPE_MAIN_VARIANT (TREE_TYPE (parm
));
2203 /* A template parameter is not modifiable. */
2204 TREE_CONSTANT (parm
) = 1;
2205 TREE_INVARIANT (parm
) = 1;
2206 TREE_READONLY (parm
) = 1;
2207 if (invalid_nontype_parm_type_p (TREE_TYPE (parm
), 1))
2208 TREE_TYPE (parm
) = void_type_node
;
2209 decl
= build_decl (CONST_DECL
, DECL_NAME (parm
), TREE_TYPE (parm
));
2210 TREE_CONSTANT (decl
) = 1;
2211 TREE_INVARIANT (decl
) = 1;
2212 TREE_READONLY (decl
) = 1;
2213 DECL_INITIAL (parm
) = DECL_INITIAL (decl
)
2214 = build_template_parm_index (idx
, processing_template_decl
,
2215 processing_template_decl
,
2216 decl
, TREE_TYPE (parm
));
2221 parm
= TREE_VALUE (TREE_VALUE (parm
));
2223 if (parm
&& TREE_CODE (parm
) == TEMPLATE_DECL
)
2225 t
= make_aggr_type (TEMPLATE_TEMPLATE_PARM
);
2226 /* This is for distinguishing between real templates and template
2227 template parameters */
2228 TREE_TYPE (parm
) = t
;
2229 TREE_TYPE (DECL_TEMPLATE_RESULT (parm
)) = t
;
2234 t
= make_aggr_type (TEMPLATE_TYPE_PARM
);
2235 /* parm is either IDENTIFIER_NODE or NULL_TREE. */
2236 decl
= build_decl (TYPE_DECL
, parm
, t
);
2239 TYPE_NAME (t
) = decl
;
2240 TYPE_STUB_DECL (t
) = decl
;
2242 TEMPLATE_TYPE_PARM_INDEX (t
)
2243 = build_template_parm_index (idx
, processing_template_decl
,
2244 processing_template_decl
,
2245 decl
, TREE_TYPE (parm
));
2247 DECL_ARTIFICIAL (decl
) = 1;
2248 SET_DECL_TEMPLATE_PARM_P (decl
);
2250 parm
= build_tree_list (defval
, parm
);
2251 return chainon (list
, parm
);
2254 /* The end of a template parameter list has been reached. Process the
2255 tree list into a parameter vector, converting each parameter into a more
2256 useful form. Type parameters are saved as IDENTIFIER_NODEs, and others
2260 end_template_parm_list (tree parms
)
2264 tree saved_parmlist
= make_tree_vec (list_length (parms
));
2266 current_template_parms
2267 = tree_cons (size_int (processing_template_decl
),
2268 saved_parmlist
, current_template_parms
);
2270 for (parm
= parms
, nparms
= 0; parm
; parm
= next
, nparms
++)
2272 next
= TREE_CHAIN (parm
);
2273 TREE_VEC_ELT (saved_parmlist
, nparms
) = parm
;
2274 TREE_CHAIN (parm
) = NULL_TREE
;
2277 --processing_template_parmlist
;
2279 return saved_parmlist
;
2282 /* end_template_decl is called after a template declaration is seen. */
2285 end_template_decl (void)
2287 reset_specialization ();
2289 if (! processing_template_decl
)
2292 /* This matches the pushlevel in begin_template_parm_list. */
2295 --processing_template_decl
;
2296 current_template_parms
= TREE_CHAIN (current_template_parms
);
2299 /* Given a template argument vector containing the template PARMS.
2300 The innermost PARMS are given first. */
2303 current_template_args (void)
2306 tree args
= NULL_TREE
;
2307 int length
= TMPL_PARMS_DEPTH (current_template_parms
);
2310 /* If there is only one level of template parameters, we do not
2311 create a TREE_VEC of TREE_VECs. Instead, we return a single
2312 TREE_VEC containing the arguments. */
2314 args
= make_tree_vec (length
);
2316 for (header
= current_template_parms
; header
; header
= TREE_CHAIN (header
))
2318 tree a
= copy_node (TREE_VALUE (header
));
2321 TREE_TYPE (a
) = NULL_TREE
;
2322 for (i
= TREE_VEC_LENGTH (a
) - 1; i
>= 0; --i
)
2324 tree t
= TREE_VEC_ELT (a
, i
);
2326 /* T will be a list if we are called from within a
2327 begin/end_template_parm_list pair, but a vector directly
2328 if within a begin/end_member_template_processing pair. */
2329 if (TREE_CODE (t
) == TREE_LIST
)
2333 if (TREE_CODE (t
) == TYPE_DECL
2334 || TREE_CODE (t
) == TEMPLATE_DECL
)
2337 t
= DECL_INITIAL (t
);
2338 TREE_VEC_ELT (a
, i
) = t
;
2343 TREE_VEC_ELT (args
, --l
) = a
;
2351 /* Return a TEMPLATE_DECL corresponding to DECL, using the indicated
2352 template PARMS. Used by push_template_decl below. */
2355 build_template_decl (tree decl
, tree parms
)
2357 tree tmpl
= build_lang_decl (TEMPLATE_DECL
, DECL_NAME (decl
), NULL_TREE
);
2358 DECL_TEMPLATE_PARMS (tmpl
) = parms
;
2359 DECL_CONTEXT (tmpl
) = DECL_CONTEXT (decl
);
2360 if (DECL_LANG_SPECIFIC (decl
))
2362 DECL_STATIC_FUNCTION_P (tmpl
) = DECL_STATIC_FUNCTION_P (decl
);
2363 DECL_CONSTRUCTOR_P (tmpl
) = DECL_CONSTRUCTOR_P (decl
);
2364 DECL_DESTRUCTOR_P (tmpl
) = DECL_DESTRUCTOR_P (decl
);
2365 DECL_NONCONVERTING_P (tmpl
) = DECL_NONCONVERTING_P (decl
);
2366 DECL_ASSIGNMENT_OPERATOR_P (tmpl
) = DECL_ASSIGNMENT_OPERATOR_P (decl
);
2367 if (DECL_OVERLOADED_OPERATOR_P (decl
))
2368 SET_OVERLOADED_OPERATOR_CODE (tmpl
,
2369 DECL_OVERLOADED_OPERATOR_P (decl
));
2375 struct template_parm_data
2377 /* The level of the template parameters we are currently
2381 /* The index of the specialization argument we are currently
2385 /* An array whose size is the number of template parameters. The
2386 elements are nonzero if the parameter has been used in any one
2387 of the arguments processed so far. */
2390 /* An array whose size is the number of template arguments. The
2391 elements are nonzero if the argument makes use of template
2392 parameters of this level. */
2393 int* arg_uses_template_parms
;
2396 /* Subroutine of push_template_decl used to see if each template
2397 parameter in a partial specialization is used in the explicit
2398 argument list. If T is of the LEVEL given in DATA (which is
2399 treated as a template_parm_data*), then DATA->PARMS is marked
2403 mark_template_parm (tree t
, void* data
)
2407 struct template_parm_data
* tpd
= (struct template_parm_data
*) data
;
2409 if (TREE_CODE (t
) == TEMPLATE_PARM_INDEX
)
2411 level
= TEMPLATE_PARM_LEVEL (t
);
2412 idx
= TEMPLATE_PARM_IDX (t
);
2416 level
= TEMPLATE_TYPE_LEVEL (t
);
2417 idx
= TEMPLATE_TYPE_IDX (t
);
2420 if (level
== tpd
->level
)
2422 tpd
->parms
[idx
] = 1;
2423 tpd
->arg_uses_template_parms
[tpd
->current_arg
] = 1;
2426 /* Return zero so that for_each_template_parm will continue the
2427 traversal of the tree; we want to mark *every* template parm. */
2431 /* Process the partial specialization DECL. */
2434 process_partial_specialization (tree decl
)
2436 tree type
= TREE_TYPE (decl
);
2437 tree maintmpl
= CLASSTYPE_TI_TEMPLATE (type
);
2438 tree specargs
= CLASSTYPE_TI_ARGS (type
);
2439 tree inner_args
= INNERMOST_TEMPLATE_ARGS (specargs
);
2440 tree inner_parms
= INNERMOST_TEMPLATE_PARMS (current_template_parms
);
2441 tree main_inner_parms
= DECL_INNERMOST_TEMPLATE_PARMS (maintmpl
);
2442 int nargs
= TREE_VEC_LENGTH (inner_args
);
2443 int ntparms
= TREE_VEC_LENGTH (inner_parms
);
2445 int did_error_intro
= 0;
2446 struct template_parm_data tpd
;
2447 struct template_parm_data tpd2
;
2449 /* We check that each of the template parameters given in the
2450 partial specialization is used in the argument list to the
2451 specialization. For example:
2453 template <class T> struct S;
2454 template <class T> struct S<T*>;
2456 The second declaration is OK because `T*' uses the template
2457 parameter T, whereas
2459 template <class T> struct S<int>;
2461 is no good. Even trickier is:
2472 The S2<T> declaration is actually invalid; it is a
2473 full-specialization. Of course,
2476 struct S2<T (*)(U)>;
2478 or some such would have been OK. */
2479 tpd
.level
= TMPL_PARMS_DEPTH (current_template_parms
);
2480 tpd
.parms
= alloca (sizeof (int) * ntparms
);
2481 memset (tpd
.parms
, 0, sizeof (int) * ntparms
);
2483 tpd
.arg_uses_template_parms
= alloca (sizeof (int) * nargs
);
2484 memset (tpd
.arg_uses_template_parms
, 0, sizeof (int) * nargs
);
2485 for (i
= 0; i
< nargs
; ++i
)
2487 tpd
.current_arg
= i
;
2488 for_each_template_parm (TREE_VEC_ELT (inner_args
, i
),
2489 &mark_template_parm
,
2493 for (i
= 0; i
< ntparms
; ++i
)
2494 if (tpd
.parms
[i
] == 0)
2496 /* One of the template parms was not used in the
2498 if (!did_error_intro
)
2500 error ("template parameters not used in partial specialization:");
2501 did_error_intro
= 1;
2505 TREE_VALUE (TREE_VEC_ELT (inner_parms
, i
)));
2508 /* [temp.class.spec]
2510 The argument list of the specialization shall not be identical to
2511 the implicit argument list of the primary template. */
2512 if (comp_template_args
2514 INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (TREE_TYPE
2516 error ("partial specialization `%T' does not specialize any template arguments", type
);
2518 /* [temp.class.spec]
2520 A partially specialized non-type argument expression shall not
2521 involve template parameters of the partial specialization except
2522 when the argument expression is a simple identifier.
2524 The type of a template parameter corresponding to a specialized
2525 non-type argument shall not be dependent on a parameter of the
2527 my_friendly_assert (nargs
== DECL_NTPARMS (maintmpl
), 0);
2529 for (i
= 0; i
< nargs
; ++i
)
2531 tree arg
= TREE_VEC_ELT (inner_args
, i
);
2532 if (/* These first two lines are the `non-type' bit. */
2534 && TREE_CODE (arg
) != TEMPLATE_DECL
2535 /* This next line is the `argument expression is not just a
2536 simple identifier' condition and also the `specialized
2537 non-type argument' bit. */
2538 && TREE_CODE (arg
) != TEMPLATE_PARM_INDEX
)
2540 if (tpd
.arg_uses_template_parms
[i
])
2541 error ("template argument `%E' involves template parameter(s)", arg
);
2544 /* Look at the corresponding template parameter,
2545 marking which template parameters its type depends
2548 TREE_TYPE (TREE_VALUE (TREE_VEC_ELT (main_inner_parms
,
2553 /* We haven't yet initialized TPD2. Do so now. */
2554 tpd2
.arg_uses_template_parms
2555 = alloca (sizeof (int) * nargs
);
2556 /* The number of parameters here is the number in the
2557 main template, which, as checked in the assertion
2559 tpd2
.parms
= alloca (sizeof (int) * nargs
);
2561 TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (maintmpl
));
2564 /* Mark the template parameters. But this time, we're
2565 looking for the template parameters of the main
2566 template, not in the specialization. */
2567 tpd2
.current_arg
= i
;
2568 tpd2
.arg_uses_template_parms
[i
] = 0;
2569 memset (tpd2
.parms
, 0, sizeof (int) * nargs
);
2570 for_each_template_parm (type
,
2571 &mark_template_parm
,
2575 if (tpd2
.arg_uses_template_parms
[i
])
2577 /* The type depended on some template parameters.
2578 If they are fully specialized in the
2579 specialization, that's OK. */
2581 for (j
= 0; j
< nargs
; ++j
)
2582 if (tpd2
.parms
[j
] != 0
2583 && tpd
.arg_uses_template_parms
[j
])
2585 error ("type `%T' of template argument `%E' depends on template parameter(s)",
2595 if (retrieve_specialization (maintmpl
, specargs
))
2596 /* We've already got this specialization. */
2599 DECL_TEMPLATE_SPECIALIZATIONS (maintmpl
)
2600 = tree_cons (inner_args
, inner_parms
,
2601 DECL_TEMPLATE_SPECIALIZATIONS (maintmpl
));
2602 TREE_TYPE (DECL_TEMPLATE_SPECIALIZATIONS (maintmpl
)) = type
;
2606 /* Check that a template declaration's use of default arguments is not
2607 invalid. Here, PARMS are the template parameters. IS_PRIMARY is
2608 nonzero if DECL is the thing declared by a primary template.
2609 IS_PARTIAL is nonzero if DECL is a partial specialization. */
2612 check_default_tmpl_args (tree decl
, tree parms
, int is_primary
, int is_partial
)
2615 int last_level_to_check
;
2620 A default template-argument shall not be specified in a
2621 function template declaration or a function template definition, nor
2622 in the template-parameter-list of the definition of a member of a
2625 if (TREE_CODE (CP_DECL_CONTEXT (decl
)) == FUNCTION_DECL
)
2626 /* You can't have a function template declaration in a local
2627 scope, nor you can you define a member of a class template in a
2631 if (current_class_type
2632 && !TYPE_BEING_DEFINED (current_class_type
)
2633 && DECL_LANG_SPECIFIC (decl
)
2634 /* If this is either a friend defined in the scope of the class
2635 or a member function. */
2636 && (DECL_FUNCTION_MEMBER_P (decl
)
2637 ? same_type_p (DECL_CONTEXT (decl
), current_class_type
)
2638 : DECL_FRIEND_CONTEXT (decl
)
2639 ? same_type_p (DECL_FRIEND_CONTEXT (decl
), current_class_type
)
2641 /* And, if it was a member function, it really was defined in
2642 the scope of the class. */
2643 && (!DECL_FUNCTION_MEMBER_P (decl
)
2644 || DECL_INITIALIZED_IN_CLASS_P (decl
)))
2645 /* We already checked these parameters when the template was
2646 declared, so there's no need to do it again now. This function
2647 was defined in class scope, but we're processing it's body now
2648 that the class is complete. */
2653 If a template-parameter has a default template-argument, all
2654 subsequent template-parameters shall have a default
2655 template-argument supplied. */
2656 for (parm_level
= parms
; parm_level
; parm_level
= TREE_CHAIN (parm_level
))
2658 tree inner_parms
= TREE_VALUE (parm_level
);
2659 int ntparms
= TREE_VEC_LENGTH (inner_parms
);
2660 int seen_def_arg_p
= 0;
2663 for (i
= 0; i
< ntparms
; ++i
)
2665 tree parm
= TREE_VEC_ELT (inner_parms
, i
);
2666 if (TREE_PURPOSE (parm
))
2668 else if (seen_def_arg_p
)
2670 error ("no default argument for `%D'", TREE_VALUE (parm
));
2671 /* For better subsequent error-recovery, we indicate that
2672 there should have been a default argument. */
2673 TREE_PURPOSE (parm
) = error_mark_node
;
2678 if (TREE_CODE (decl
) != TYPE_DECL
|| is_partial
|| !is_primary
)
2679 /* For an ordinary class template, default template arguments are
2680 allowed at the innermost level, e.g.:
2681 template <class T = int>
2683 but, in a partial specialization, they're not allowed even
2684 there, as we have in [temp.class.spec]:
2686 The template parameter list of a specialization shall not
2687 contain default template argument values.
2689 So, for a partial specialization, or for a function template,
2690 we look at all of them. */
2693 /* But, for a primary class template that is not a partial
2694 specialization we look at all template parameters except the
2696 parms
= TREE_CHAIN (parms
);
2698 /* Figure out what error message to issue. */
2699 if (TREE_CODE (decl
) == FUNCTION_DECL
)
2700 msg
= "default template arguments may not be used in function templates";
2701 else if (is_partial
)
2702 msg
= "default template arguments may not be used in partial specializations";
2704 msg
= "default argument for template parameter for class enclosing `%D'";
2706 if (current_class_type
&& TYPE_BEING_DEFINED (current_class_type
))
2707 /* If we're inside a class definition, there's no need to
2708 examine the parameters to the class itself. On the one
2709 hand, they will be checked when the class is defined, and,
2710 on the other, default arguments are valid in things like:
2711 template <class T = double>
2712 struct S { template <class U> void f(U); };
2713 Here the default argument for `S' has no bearing on the
2714 declaration of `f'. */
2715 last_level_to_check
= template_class_depth (current_class_type
) + 1;
2717 /* Check everything. */
2718 last_level_to_check
= 0;
2720 for (parm_level
= parms
;
2721 parm_level
&& TMPL_PARMS_DEPTH (parm_level
) >= last_level_to_check
;
2722 parm_level
= TREE_CHAIN (parm_level
))
2724 tree inner_parms
= TREE_VALUE (parm_level
);
2728 ntparms
= TREE_VEC_LENGTH (inner_parms
);
2729 for (i
= 0; i
< ntparms
; ++i
)
2730 if (TREE_PURPOSE (TREE_VEC_ELT (inner_parms
, i
)))
2738 /* Clear out the default argument so that we are not
2740 TREE_PURPOSE (TREE_VEC_ELT (inner_parms
, i
)) = NULL_TREE
;
2743 /* At this point, if we're still interested in issuing messages,
2744 they must apply to classes surrounding the object declared. */
2746 msg
= "default argument for template parameter for class enclosing `%D'";
2750 /* Worker for push_template_decl_real, called via
2751 for_each_template_parm. DATA is really an int, indicating the
2752 level of the parameters we are interested in. If T is a template
2753 parameter of that level, return nonzero. */
2756 template_parm_this_level_p (tree t
, void* data
)
2758 int this_level
= *(int *)data
;
2761 if (TREE_CODE (t
) == TEMPLATE_PARM_INDEX
)
2762 level
= TEMPLATE_PARM_LEVEL (t
);
2764 level
= TEMPLATE_TYPE_LEVEL (t
);
2765 return level
== this_level
;
2768 /* Creates a TEMPLATE_DECL for the indicated DECL using the template
2769 parameters given by current_template_args, or reuses a
2770 previously existing one, if appropriate. Returns the DECL, or an
2771 equivalent one, if it is replaced via a call to duplicate_decls.
2773 If IS_FRIEND is nonzero, DECL is a friend declaration. */
2776 push_template_decl_real (tree decl
, int is_friend
)
2784 int new_template_p
= 0;
2786 if (decl
== error_mark_node
)
2789 /* See if this is a partial specialization. */
2790 is_partial
= (DECL_IMPLICIT_TYPEDEF_P (decl
)
2791 && TREE_CODE (TREE_TYPE (decl
)) != ENUMERAL_TYPE
2792 && CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_TYPE (decl
)));
2794 is_friend
|= (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_FRIEND_P (decl
));
2797 /* For a friend, we want the context of the friend function, not
2798 the type of which it is a friend. */
2799 ctx
= DECL_CONTEXT (decl
);
2800 else if (CP_DECL_CONTEXT (decl
)
2801 && TREE_CODE (CP_DECL_CONTEXT (decl
)) != NAMESPACE_DECL
)
2802 /* In the case of a virtual function, we want the class in which
2804 ctx
= CP_DECL_CONTEXT (decl
);
2806 /* Otherwise, if we're currently defining some class, the DECL
2807 is assumed to be a member of the class. */
2808 ctx
= current_scope ();
2810 if (ctx
&& TREE_CODE (ctx
) == NAMESPACE_DECL
)
2813 if (!DECL_CONTEXT (decl
))
2814 DECL_CONTEXT (decl
) = FROB_CONTEXT (current_namespace
);
2816 /* See if this is a primary template. */
2817 primary
= template_parm_scope_p ();
2821 if (current_lang_name
== lang_name_c
)
2822 error ("template with C linkage");
2823 else if (TREE_CODE (decl
) == TYPE_DECL
2824 && ANON_AGGRNAME_P (DECL_NAME (decl
)))
2825 error ("template class without a name");
2826 else if (TREE_CODE (decl
) == FUNCTION_DECL
2827 && DECL_DESTRUCTOR_P (decl
))
2831 A destructor shall not be a member template. */
2832 error ("destructor `%D' declared as member template", decl
);
2833 return error_mark_node
;
2835 else if ((DECL_IMPLICIT_TYPEDEF_P (decl
)
2836 && CLASS_TYPE_P (TREE_TYPE (decl
)))
2837 || (TREE_CODE (decl
) == VAR_DECL
&& ctx
&& CLASS_TYPE_P (ctx
))
2838 || TREE_CODE (decl
) == FUNCTION_DECL
)
2842 error ("template declaration of `%#D'", decl
);
2843 return error_mark_node
;
2847 /* Check to see that the rules regarding the use of default
2848 arguments are not being violated. */
2849 check_default_tmpl_args (decl
, current_template_parms
,
2850 primary
, is_partial
);
2853 return process_partial_specialization (decl
);
2855 args
= current_template_args ();
2858 || TREE_CODE (ctx
) == FUNCTION_DECL
2859 || (CLASS_TYPE_P (ctx
) && TYPE_BEING_DEFINED (ctx
))
2860 || (is_friend
&& !DECL_TEMPLATE_INFO (decl
)))
2862 if (DECL_LANG_SPECIFIC (decl
)
2863 && DECL_TEMPLATE_INFO (decl
)
2864 && DECL_TI_TEMPLATE (decl
))
2865 tmpl
= DECL_TI_TEMPLATE (decl
);
2866 /* If DECL is a TYPE_DECL for a class-template, then there won't
2867 be DECL_LANG_SPECIFIC. The information equivalent to
2868 DECL_TEMPLATE_INFO is found in TYPE_TEMPLATE_INFO instead. */
2869 else if (DECL_IMPLICIT_TYPEDEF_P (decl
)
2870 && TYPE_TEMPLATE_INFO (TREE_TYPE (decl
))
2871 && TYPE_TI_TEMPLATE (TREE_TYPE (decl
)))
2873 /* Since a template declaration already existed for this
2874 class-type, we must be redeclaring it here. Make sure
2875 that the redeclaration is valid. */
2876 redeclare_class_template (TREE_TYPE (decl
),
2877 current_template_parms
);
2878 /* We don't need to create a new TEMPLATE_DECL; just use the
2879 one we already had. */
2880 tmpl
= TYPE_TI_TEMPLATE (TREE_TYPE (decl
));
2884 tmpl
= build_template_decl (decl
, current_template_parms
);
2887 if (DECL_LANG_SPECIFIC (decl
)
2888 && DECL_TEMPLATE_SPECIALIZATION (decl
))
2890 /* A specialization of a member template of a template
2892 SET_DECL_TEMPLATE_SPECIALIZATION (tmpl
);
2893 DECL_TEMPLATE_INFO (tmpl
) = DECL_TEMPLATE_INFO (decl
);
2894 DECL_TEMPLATE_INFO (decl
) = NULL_TREE
;
2900 tree a
, t
, current
, parms
;
2903 if (TREE_CODE (decl
) == TYPE_DECL
)
2905 if ((IS_AGGR_TYPE_CODE (TREE_CODE (TREE_TYPE (decl
)))
2906 || TREE_CODE (TREE_TYPE (decl
)) == ENUMERAL_TYPE
)
2907 && TYPE_TEMPLATE_INFO (TREE_TYPE (decl
))
2908 && TYPE_TI_TEMPLATE (TREE_TYPE (decl
)))
2909 tmpl
= TYPE_TI_TEMPLATE (TREE_TYPE (decl
));
2912 error ("`%D' does not declare a template type", decl
);
2916 else if (!DECL_LANG_SPECIFIC (decl
) || !DECL_TEMPLATE_INFO (decl
))
2918 error ("template definition of non-template `%#D'", decl
);
2922 tmpl
= DECL_TI_TEMPLATE (decl
);
2924 if (DECL_FUNCTION_TEMPLATE_P (tmpl
)
2925 && DECL_TEMPLATE_INFO (decl
) && DECL_TI_ARGS (decl
)
2926 && DECL_TEMPLATE_SPECIALIZATION (decl
)
2927 && is_member_template (tmpl
))
2931 /* The declaration is a specialization of a member
2932 template, declared outside the class. Therefore, the
2933 innermost template arguments will be NULL, so we
2934 replace them with the arguments determined by the
2935 earlier call to check_explicit_specialization. */
2936 args
= DECL_TI_ARGS (decl
);
2939 = build_template_decl (decl
, current_template_parms
);
2940 DECL_TEMPLATE_RESULT (new_tmpl
) = decl
;
2941 TREE_TYPE (new_tmpl
) = TREE_TYPE (decl
);
2942 DECL_TI_TEMPLATE (decl
) = new_tmpl
;
2943 SET_DECL_TEMPLATE_SPECIALIZATION (new_tmpl
);
2944 DECL_TEMPLATE_INFO (new_tmpl
)
2945 = tree_cons (tmpl
, args
, NULL_TREE
);
2947 register_specialization (new_tmpl
,
2948 most_general_template (tmpl
),
2953 /* Make sure the template headers we got make sense. */
2955 parms
= DECL_TEMPLATE_PARMS (tmpl
);
2956 i
= TMPL_PARMS_DEPTH (parms
);
2957 if (TMPL_ARGS_DEPTH (args
) != i
)
2959 error ("expected %d levels of template parms for `%#D', got %d",
2960 i
, decl
, TMPL_ARGS_DEPTH (args
));
2963 for (current
= decl
; i
> 0; --i
, parms
= TREE_CHAIN (parms
))
2965 a
= TMPL_ARGS_LEVEL (args
, i
);
2966 t
= INNERMOST_TEMPLATE_PARMS (parms
);
2968 if (TREE_VEC_LENGTH (t
) != TREE_VEC_LENGTH (a
))
2970 if (current
== decl
)
2971 error ("got %d template parameters for `%#D'",
2972 TREE_VEC_LENGTH (a
), decl
);
2974 error ("got %d template parameters for `%#T'",
2975 TREE_VEC_LENGTH (a
), current
);
2976 error (" but %d required", TREE_VEC_LENGTH (t
));
2979 /* Perhaps we should also check that the parms are used in the
2980 appropriate qualifying scopes in the declarator? */
2982 if (current
== decl
)
2985 current
= TYPE_CONTEXT (current
);
2989 DECL_TEMPLATE_RESULT (tmpl
) = decl
;
2990 TREE_TYPE (tmpl
) = TREE_TYPE (decl
);
2992 /* Push template declarations for global functions and types. Note
2993 that we do not try to push a global template friend declared in a
2994 template class; such a thing may well depend on the template
2995 parameters of the class. */
2996 if (new_template_p
&& !ctx
2997 && !(is_friend
&& template_class_depth (current_class_type
) > 0))
2998 tmpl
= pushdecl_namespace_level (tmpl
);
3002 DECL_PRIMARY_TEMPLATE (tmpl
) = tmpl
;
3003 if (DECL_CONV_FN_P (tmpl
))
3005 int depth
= TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl
));
3007 /* It is a conversion operator. See if the type converted to
3008 depends on innermost template operands. */
3010 if (uses_template_parms_level (TREE_TYPE (TREE_TYPE (tmpl
)),
3012 DECL_TEMPLATE_CONV_FN_P (tmpl
) = 1;
3016 /* The DECL_TI_ARGS of DECL contains full set of arguments referring
3017 back to its most general template. If TMPL is a specialization,
3018 ARGS may only have the innermost set of arguments. Add the missing
3019 argument levels if necessary. */
3020 if (DECL_TEMPLATE_INFO (tmpl
))
3021 args
= add_outermost_template_args (DECL_TI_ARGS (tmpl
), args
);
3023 info
= tree_cons (tmpl
, args
, NULL_TREE
);
3025 if (DECL_IMPLICIT_TYPEDEF_P (decl
))
3027 SET_TYPE_TEMPLATE_INFO (TREE_TYPE (tmpl
), info
);
3028 if ((!ctx
|| TREE_CODE (ctx
) != FUNCTION_DECL
)
3029 && TREE_CODE (TREE_TYPE (decl
)) != ENUMERAL_TYPE
3030 /* Don't change the name if we've already set it up. */
3031 && !IDENTIFIER_TEMPLATE (DECL_NAME (decl
)))
3032 DECL_NAME (decl
) = classtype_mangled_name (TREE_TYPE (decl
));
3034 else if (DECL_LANG_SPECIFIC (decl
))
3035 DECL_TEMPLATE_INFO (decl
) = info
;
3037 return DECL_TEMPLATE_RESULT (tmpl
);
3041 push_template_decl (tree decl
)
3043 return push_template_decl_real (decl
, 0);
3046 /* Called when a class template TYPE is redeclared with the indicated
3047 template PARMS, e.g.:
3049 template <class T> struct S;
3050 template <class T> struct S {}; */
3053 redeclare_class_template (tree type
, tree parms
)
3059 if (!TYPE_TEMPLATE_INFO (type
))
3061 error ("`%T' is not a template type", type
);
3065 tmpl
= TYPE_TI_TEMPLATE (type
);
3066 if (!PRIMARY_TEMPLATE_P (tmpl
))
3067 /* The type is nested in some template class. Nothing to worry
3068 about here; there are no new template parameters for the nested
3072 parms
= INNERMOST_TEMPLATE_PARMS (parms
);
3073 tmpl_parms
= DECL_INNERMOST_TEMPLATE_PARMS (tmpl
);
3075 if (TREE_VEC_LENGTH (parms
) != TREE_VEC_LENGTH (tmpl_parms
))
3077 cp_error_at ("previous declaration `%D'", tmpl
);
3078 error ("used %d template parameter%s instead of %d",
3079 TREE_VEC_LENGTH (tmpl_parms
),
3080 TREE_VEC_LENGTH (tmpl_parms
) == 1 ? "" : "s",
3081 TREE_VEC_LENGTH (parms
));
3085 for (i
= 0; i
< TREE_VEC_LENGTH (tmpl_parms
); ++i
)
3087 tree tmpl_parm
= TREE_VALUE (TREE_VEC_ELT (tmpl_parms
, i
));
3088 tree parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
3089 tree tmpl_default
= TREE_PURPOSE (TREE_VEC_ELT (tmpl_parms
, i
));
3090 tree parm_default
= TREE_PURPOSE (TREE_VEC_ELT (parms
, i
));
3092 if (TREE_CODE (tmpl_parm
) != TREE_CODE (parm
))
3094 cp_error_at ("template parameter `%#D'", tmpl_parm
);
3095 error ("redeclared here as `%#D'", parm
);
3099 if (tmpl_default
!= NULL_TREE
&& parm_default
!= NULL_TREE
)
3101 /* We have in [temp.param]:
3103 A template-parameter may not be given default arguments
3104 by two different declarations in the same scope. */
3105 error ("redefinition of default argument for `%#D'", parm
);
3106 error ("%J original definition appeared here", tmpl_parm
);
3110 if (parm_default
!= NULL_TREE
)
3111 /* Update the previous template parameters (which are the ones
3112 that will really count) with the new default value. */
3113 TREE_PURPOSE (TREE_VEC_ELT (tmpl_parms
, i
)) = parm_default
;
3114 else if (tmpl_default
!= NULL_TREE
)
3115 /* Update the new parameters, too; they'll be used as the
3116 parameters for any members. */
3117 TREE_PURPOSE (TREE_VEC_ELT (parms
, i
)) = tmpl_default
;
3121 /* Simplify EXPR if it is a non-dependent expression. Returns the
3122 (possibly simplified) expression. */
3125 fold_non_dependent_expr (tree expr
)
3127 /* If we're in a template, but EXPR isn't value dependent, simplify
3128 it. We're supposed to treat:
3130 template <typename T> void f(T[1 + 1]);
3131 template <typename T> void f(T[2]);
3133 as two declarations of the same function, for example. */
3134 if (processing_template_decl
3135 && !type_dependent_expression_p (expr
)
3136 && !value_dependent_expression_p (expr
))
3138 HOST_WIDE_INT saved_processing_template_decl
;
3140 saved_processing_template_decl
= processing_template_decl
;
3141 processing_template_decl
= 0;
3142 expr
= tsubst_copy_and_build (expr
,
3145 /*in_decl=*/NULL_TREE
,
3146 /*function_p=*/false);
3147 processing_template_decl
= saved_processing_template_decl
;
3152 /* Attempt to convert the non-type template parameter EXPR to the
3153 indicated TYPE. If the conversion is successful, return the
3154 converted value. If the conversion is unsuccessful, return
3155 NULL_TREE if we issued an error message, or error_mark_node if we
3156 did not. We issue error messages for out-and-out bad template
3157 parameters, but not simply because the conversion failed, since we
3158 might be just trying to do argument deduction. Both TYPE and EXPR
3159 must be non-dependent. */
3162 convert_nontype_argument (tree type
, tree expr
)
3166 /* If we are in a template, EXPR may be non-dependent, but still
3167 have a syntactic, rather than semantic, form. For example, EXPR
3168 might be a SCOPE_REF, rather than the VAR_DECL to which the
3169 SCOPE_REF refers. Preserving the qualifying scope is necessary
3170 so that access checking can be performed when the template is
3171 instantiated -- but here we need the resolved form so that we can
3172 convert the argument. */
3173 expr
= fold_non_dependent_expr (expr
);
3174 expr_type
= TREE_TYPE (expr
);
3176 /* A template-argument for a non-type, non-template
3177 template-parameter shall be one of:
3179 --an integral constant-expression of integral or enumeration
3182 --the name of a non-type template-parameter; or
3184 --the name of an object or function with external linkage,
3185 including function templates and function template-ids but
3186 excluding non-static class members, expressed as id-expression;
3189 --the address of an object or function with external linkage,
3190 including function templates and function template-ids but
3191 excluding non-static class members, expressed as & id-expression
3192 where the & is optional if the name refers to a function or
3195 --a pointer to member expressed as described in _expr.unary.op_. */
3197 /* An integral constant-expression can include const variables or
3198 . enumerators. Simplify things by folding them to their values,
3199 unless we're about to bind the declaration to a reference
3201 if (INTEGRAL_TYPE_P (expr_type
) && TREE_CODE (type
) != REFERENCE_TYPE
)
3204 tree const_expr
= decl_constant_value (expr
);
3205 /* In a template, the initializer for a VAR_DECL may not be
3206 marked as TREE_CONSTANT, in which case decl_constant_value
3207 will not return the initializer. Handle that special case
3209 if (expr
== const_expr
3210 && TREE_CODE (expr
) == VAR_DECL
3211 && DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (expr
)
3212 && CP_TYPE_CONST_NON_VOLATILE_P (TREE_TYPE (expr
))
3213 /* DECL_INITIAL can be NULL if we are processing a
3214 variable initialized to an expression involving itself.
3215 We know it is initialized to a constant -- but not what
3217 && DECL_INITIAL (expr
))
3218 const_expr
= DECL_INITIAL (expr
);
3219 if (expr
== const_expr
)
3221 expr
= fold_non_dependent_expr (const_expr
);
3224 if (is_overloaded_fn (expr
))
3225 /* OK for now. We'll check that it has external linkage later.
3226 Check this first since if expr_type is the unknown_type_node
3227 we would otherwise complain below. */
3229 else if (TYPE_PTR_TO_MEMBER_P (expr_type
))
3231 if (TREE_CODE (expr
) != PTRMEM_CST
)
3234 else if (TYPE_PTR_P (expr_type
)
3235 || TREE_CODE (expr_type
) == ARRAY_TYPE
3236 || TREE_CODE (type
) == REFERENCE_TYPE
3237 /* If expr is the address of an overloaded function, we
3238 will get the unknown_type_node at this point. */
3239 || expr_type
== unknown_type_node
)
3245 if (TREE_CODE (expr_type
) == ARRAY_TYPE
3246 || (TREE_CODE (type
) == REFERENCE_TYPE
3247 && TREE_CODE (e
) != ADDR_EXPR
))
3251 if (TREE_CODE (e
) != ADDR_EXPR
)
3254 error ("`%E' is not a valid template argument", expr
);
3255 if (TYPE_PTR_P (expr_type
))
3257 if (TREE_CODE (TREE_TYPE (expr_type
)) == FUNCTION_TYPE
)
3258 error ("it must be the address of a function with external linkage");
3260 error ("it must be the address of an object with external linkage");
3262 else if (TYPE_PTR_TO_MEMBER_P (expr_type
))
3263 error ("it must be a pointer-to-member of the form `&X::Y'");
3268 referent
= TREE_OPERAND (e
, 0);
3269 STRIP_NOPS (referent
);
3272 if (TREE_CODE (referent
) == STRING_CST
)
3274 error ("string literal %E is not a valid template argument because it is the address of an object with static linkage",
3279 if (TREE_CODE (referent
) == SCOPE_REF
)
3280 referent
= TREE_OPERAND (referent
, 1);
3282 if (is_overloaded_fn (referent
))
3283 /* We'll check that it has external linkage later. */
3285 else if (TREE_CODE (referent
) != VAR_DECL
)
3287 else if (!DECL_EXTERNAL_LINKAGE_P (referent
))
3289 error ("address of non-extern `%E' cannot be used as template argument", referent
);
3290 return error_mark_node
;
3293 else if (INTEGRAL_TYPE_P (expr_type
) || TYPE_PTR_TO_MEMBER_P (expr_type
))
3295 if (! TREE_CONSTANT (expr
))
3298 error ("non-constant `%E' cannot be used as template argument",
3306 error ("type '%T' cannot be used as a value for a non-type "
3307 "template-parameter", expr
);
3308 else if (DECL_P (expr
))
3309 error ("invalid use of '%D' as a non-type template-argument", expr
);
3311 error ("invalid use of '%E' as a non-type template-argument", expr
);
3316 switch (TREE_CODE (type
))
3321 /* For a non-type template-parameter of integral or enumeration
3322 type, integral promotions (_conv.prom_) and integral
3323 conversions (_conv.integral_) are applied. */
3324 if (!INTEGRAL_TYPE_P (expr_type
))
3325 return error_mark_node
;
3327 /* [conv.integral] does not allow conversions between two different
3328 enumeration types. */
3329 if (TREE_CODE (type
) == ENUMERAL_TYPE
3330 && TREE_CODE (expr_type
) == ENUMERAL_TYPE
3331 && !same_type_ignoring_top_level_qualifiers_p (type
, expr_type
))
3332 return error_mark_node
;
3334 /* It's safe to call digest_init in this case; we know we're
3335 just converting one integral constant expression to another. */
3336 expr
= digest_init (type
, expr
, (tree
*) 0);
3338 if (TREE_CODE (expr
) != INTEGER_CST
)
3339 /* Curiously, some TREE_CONSTANT integral expressions do not
3340 simplify to integer constants. For example, `3 % 0',
3341 remains a TRUNC_MOD_EXPR. */
3350 /* For a non-type template-parameter of type pointer to data
3351 member, qualification conversions (_conv.qual_) are
3353 e
= perform_qualification_conversions (type
, expr
);
3354 if (TREE_CODE (e
) == NOP_EXPR
)
3355 /* The call to perform_qualification_conversions will
3356 insert a NOP_EXPR over EXPR to do express conversion,
3357 if necessary. But, that will confuse us if we use
3358 this (converted) template parameter to instantiate
3359 another template; then the thing will not look like a
3360 valid template argument. So, just make a new
3361 constant, of the appropriate type. */
3362 e
= make_ptrmem_cst (type
, PTRMEM_CST_MEMBER (expr
));
3368 tree type_pointed_to
= TREE_TYPE (type
);
3370 if (TREE_CODE (type_pointed_to
) == FUNCTION_TYPE
)
3372 /* For a non-type template-parameter of type pointer to
3373 function, only the function-to-pointer conversion
3374 (_conv.func_) is applied. If the template-argument
3375 represents a set of overloaded functions (or a pointer to
3376 such), the matching function is selected from the set
3381 if (TREE_CODE (expr
) == ADDR_EXPR
)
3382 fns
= TREE_OPERAND (expr
, 0);
3386 fn
= instantiate_type (type_pointed_to
, fns
, tf_none
);
3388 if (fn
== error_mark_node
)
3389 return error_mark_node
;
3391 if (!DECL_EXTERNAL_LINKAGE_P (fn
))
3393 if (really_overloaded_fn (fns
))
3394 return error_mark_node
;
3399 expr
= build_unary_op (ADDR_EXPR
, fn
, 0);
3401 my_friendly_assert (same_type_p (type
, TREE_TYPE (expr
)),
3407 /* For a non-type template-parameter of type pointer to
3408 object, qualification conversions (_conv.qual_) and the
3409 array-to-pointer conversion (_conv.array_) are applied.
3410 [Note: In particular, neither the null pointer conversion
3411 (_conv.ptr_) nor the derived-to-base conversion
3412 (_conv.ptr_) are applied. Although 0 is a valid
3413 template-argument for a non-type template-parameter of
3414 integral type, it is not a valid template-argument for a
3415 non-type template-parameter of pointer type.]
3417 The call to decay_conversion performs the
3418 array-to-pointer conversion, if appropriate. */
3419 expr
= decay_conversion (expr
);
3421 if (expr
== error_mark_node
)
3422 return error_mark_node
;
3424 return perform_qualification_conversions (type
, expr
);
3429 case REFERENCE_TYPE
:
3431 tree type_referred_to
= TREE_TYPE (type
);
3433 /* If this expression already has reference type, get the
3434 underlying object. */
3435 if (TREE_CODE (expr_type
) == REFERENCE_TYPE
)
3437 if (TREE_CODE (expr
) == NOP_EXPR
3438 && TREE_CODE (TREE_OPERAND (expr
, 0)) == ADDR_EXPR
)
3440 my_friendly_assert (TREE_CODE (expr
) == ADDR_EXPR
, 20000604);
3441 expr
= TREE_OPERAND (expr
, 0);
3442 expr_type
= TREE_TYPE (expr
);
3445 if (TREE_CODE (type_referred_to
) == FUNCTION_TYPE
)
3447 /* For a non-type template-parameter of type reference to
3448 function, no conversions apply. If the
3449 template-argument represents a set of overloaded
3450 functions, the matching function is selected from the
3451 set (_over.over_). */
3454 fn
= instantiate_type (type_referred_to
, expr
, tf_none
);
3456 if (fn
== error_mark_node
)
3457 return error_mark_node
;
3459 if (!DECL_EXTERNAL_LINKAGE_P (fn
))
3461 if (really_overloaded_fn (expr
))
3462 /* Don't issue an error here; we might get a different
3463 function if the overloading had worked out
3465 return error_mark_node
;
3470 my_friendly_assert (same_type_p (type_referred_to
,
3478 /* For a non-type template-parameter of type reference to
3479 object, no conversions apply. The type referred to by the
3480 reference may be more cv-qualified than the (otherwise
3481 identical) type of the template-argument. The
3482 template-parameter is bound directly to the
3483 template-argument, which must be an lvalue. */
3484 if (!same_type_p (TYPE_MAIN_VARIANT (expr_type
),
3485 TYPE_MAIN_VARIANT (type_referred_to
))
3486 || !at_least_as_qualified_p (type_referred_to
,
3488 || !real_lvalue_p (expr
))
3489 return error_mark_node
;
3492 cxx_mark_addressable (expr
);
3493 return build_nop (type
, build_address (expr
));
3499 my_friendly_assert (TYPE_PTRMEMFUNC_P (type
), 20010112);
3501 /* For a non-type template-parameter of type pointer to member
3502 function, no conversions apply. If the template-argument
3503 represents a set of overloaded member functions, the
3504 matching member function is selected from the set
3507 if (!TYPE_PTRMEMFUNC_P (expr_type
) &&
3508 expr_type
!= unknown_type_node
)
3509 return error_mark_node
;
3511 if (TREE_CODE (expr
) == PTRMEM_CST
)
3513 /* A ptr-to-member constant. */
3514 if (!same_type_p (type
, expr_type
))
3515 return error_mark_node
;
3520 if (TREE_CODE (expr
) != ADDR_EXPR
)
3521 return error_mark_node
;
3523 expr
= instantiate_type (type
, expr
, tf_none
);
3525 if (expr
== error_mark_node
)
3526 return error_mark_node
;
3528 if (!same_type_p (type
, TREE_TYPE (expr
)))
3529 return error_mark_node
;
3536 /* All non-type parameters must have one of these types. */
3541 return error_mark_node
;
3544 /* Return 1 if PARM_PARMS and ARG_PARMS matches using rule for
3545 template template parameters. Both PARM_PARMS and ARG_PARMS are
3546 vectors of TREE_LIST nodes containing TYPE_DECL, TEMPLATE_DECL
3549 ARG_PARMS may contain more parameters than PARM_PARMS. If this is
3550 the case, then extra parameters must have default arguments.
3552 Consider the example:
3553 template <class T, class Allocator = allocator> class vector;
3554 template<template <class U> class TT> class C;
3556 C<vector> is a valid instantiation. PARM_PARMS for the above code
3557 contains a TYPE_DECL (for U), ARG_PARMS contains two TYPE_DECLs (for
3558 T and Allocator) and OUTER_ARGS contains the argument that is used to
3559 substitute the TT parameter. */
3562 coerce_template_template_parms (tree parm_parms
,
3564 tsubst_flags_t complain
,
3568 int nparms
, nargs
, i
;
3571 my_friendly_assert (TREE_CODE (parm_parms
) == TREE_VEC
, 0);
3572 my_friendly_assert (TREE_CODE (arg_parms
) == TREE_VEC
, 0);
3574 nparms
= TREE_VEC_LENGTH (parm_parms
);
3575 nargs
= TREE_VEC_LENGTH (arg_parms
);
3577 /* The rule here is opposite of coerce_template_parms. */
3580 && TREE_PURPOSE (TREE_VEC_ELT (arg_parms
, nparms
)) == NULL_TREE
))
3583 for (i
= 0; i
< nparms
; ++i
)
3585 parm
= TREE_VALUE (TREE_VEC_ELT (parm_parms
, i
));
3586 arg
= TREE_VALUE (TREE_VEC_ELT (arg_parms
, i
));
3588 if (arg
== NULL_TREE
|| arg
== error_mark_node
3589 || parm
== NULL_TREE
|| parm
== error_mark_node
)
3592 if (TREE_CODE (arg
) != TREE_CODE (parm
))
3595 switch (TREE_CODE (parm
))
3601 /* We encounter instantiations of templates like
3602 template <template <template <class> class> class TT>
3605 tree parmparm
= DECL_INNERMOST_TEMPLATE_PARMS (parm
);
3606 tree argparm
= DECL_INNERMOST_TEMPLATE_PARMS (arg
);
3608 if (!coerce_template_template_parms
3609 (parmparm
, argparm
, complain
, in_decl
, outer_args
))
3615 /* The tsubst call is used to handle cases such as
3616 template <class T, template <T> class TT> class D;
3617 i.e. the parameter list of TT depends on earlier parameters. */
3619 (tsubst (TREE_TYPE (parm
), outer_args
, complain
, in_decl
),
3631 /* Convert the indicated template ARG as necessary to match the
3632 indicated template PARM. Returns the converted ARG, or
3633 error_mark_node if the conversion was unsuccessful. Error and
3634 warning messages are issued under control of COMPLAIN. This
3635 conversion is for the Ith parameter in the parameter list. ARGS is
3636 the full set of template arguments deduced so far. */
3639 convert_template_argument (tree parm
,
3642 tsubst_flags_t complain
,
3648 int is_type
, requires_type
, is_tmpl_type
, requires_tmpl_type
;
3650 inner_args
= INNERMOST_TEMPLATE_ARGS (args
);
3652 if (TREE_CODE (arg
) == TREE_LIST
3653 && TREE_CODE (TREE_VALUE (arg
)) == OFFSET_REF
)
3655 /* The template argument was the name of some
3656 member function. That's usually
3657 invalid, but static members are OK. In any
3658 case, grab the underlying fields/functions
3659 and issue an error later if required. */
3660 arg
= TREE_VALUE (arg
);
3661 TREE_TYPE (arg
) = unknown_type_node
;
3664 requires_tmpl_type
= TREE_CODE (parm
) == TEMPLATE_DECL
;
3665 requires_type
= (TREE_CODE (parm
) == TYPE_DECL
3666 || requires_tmpl_type
);
3668 is_tmpl_type
= ((TREE_CODE (arg
) == TEMPLATE_DECL
3669 && TREE_CODE (DECL_TEMPLATE_RESULT (arg
)) == TYPE_DECL
)
3670 || TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
3671 || TREE_CODE (arg
) == UNBOUND_CLASS_TEMPLATE
);
3674 && (TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
3675 || TREE_CODE (arg
) == UNBOUND_CLASS_TEMPLATE
))
3676 arg
= TYPE_STUB_DECL (arg
);
3678 is_type
= TYPE_P (arg
) || is_tmpl_type
;
3680 if (requires_type
&& ! is_type
&& TREE_CODE (arg
) == SCOPE_REF
3681 && TREE_CODE (TREE_OPERAND (arg
, 0)) == TEMPLATE_TYPE_PARM
)
3683 pedwarn ("to refer to a type member of a template parameter, use `typename %E'", arg
);
3685 arg
= make_typename_type (TREE_OPERAND (arg
, 0),
3686 TREE_OPERAND (arg
, 1),
3687 complain
& tf_error
);
3690 if (is_type
!= requires_type
)
3694 if (complain
& tf_error
)
3696 error ("type/value mismatch at argument %d in template parameter list for `%D'",
3699 error (" expected a constant of type `%T', got `%T'",
3701 (is_tmpl_type
? DECL_NAME (arg
) : arg
));
3702 else if (requires_tmpl_type
)
3703 error (" expected a class template, got `%E'", arg
);
3705 error (" expected a type, got `%E'", arg
);
3708 return error_mark_node
;
3710 if (is_tmpl_type
^ requires_tmpl_type
)
3712 if (in_decl
&& (complain
& tf_error
))
3714 error ("type/value mismatch at argument %d in template parameter list for `%D'",
3717 error (" expected a type, got `%T'", DECL_NAME (arg
));
3719 error (" expected a class template, got `%T'", arg
);
3721 return error_mark_node
;
3726 if (requires_tmpl_type
)
3728 if (TREE_CODE (TREE_TYPE (arg
)) == UNBOUND_CLASS_TEMPLATE
)
3729 /* The number of argument required is not known yet.
3730 Just accept it for now. */
3731 val
= TREE_TYPE (arg
);
3734 tree parmparm
= DECL_INNERMOST_TEMPLATE_PARMS (parm
);
3735 tree argparm
= DECL_INNERMOST_TEMPLATE_PARMS (arg
);
3737 if (coerce_template_template_parms (parmparm
, argparm
,
3743 /* TEMPLATE_TEMPLATE_PARM node is preferred over
3745 if (val
!= error_mark_node
3746 && DECL_TEMPLATE_TEMPLATE_PARM_P (val
))
3747 val
= TREE_TYPE (val
);
3751 if (in_decl
&& (complain
& tf_error
))
3753 error ("type/value mismatch at argument %d in template parameter list for `%D'",
3755 error (" expected a template of type `%D', got `%D'", parm
, arg
);
3758 val
= error_mark_node
;
3767 tree t
= tsubst (TREE_TYPE (parm
), args
, complain
, in_decl
);
3769 if (invalid_nontype_parm_type_p (t
, complain
))
3770 return error_mark_node
;
3772 if (!uses_template_parms (arg
) && !uses_template_parms (t
))
3773 /* We used to call digest_init here. However, digest_init
3774 will report errors, which we don't want when complain
3775 is zero. More importantly, digest_init will try too
3776 hard to convert things: for example, `0' should not be
3777 converted to pointer type at this point according to
3778 the standard. Accepting this is not merely an
3779 extension, since deciding whether or not these
3780 conversions can occur is part of determining which
3781 function template to call, or whether a given explicit
3782 argument specification is valid. */
3783 val
= convert_nontype_argument (t
, arg
);
3787 if (val
== NULL_TREE
)
3788 val
= error_mark_node
;
3789 else if (val
== error_mark_node
&& (complain
& tf_error
))
3790 error ("could not convert template argument `%E' to `%T'",
3797 /* Convert all template arguments to their appropriate types, and
3798 return a vector containing the innermost resulting template
3799 arguments. If any error occurs, return error_mark_node. Error and
3800 warning messages are issued under control of COMPLAIN.
3802 If REQUIRE_ALL_ARGUMENTS is nonzero, all arguments must be
3803 provided in ARGLIST, or else trailing parameters must have default
3804 values. If REQUIRE_ALL_ARGUMENTS is zero, we will attempt argument
3805 deduction for any unspecified trailing arguments. */
3808 coerce_template_parms (tree parms
,
3811 tsubst_flags_t complain
,
3812 int require_all_arguments
)
3814 int nparms
, nargs
, i
, lost
= 0;
3817 tree new_inner_args
;
3819 inner_args
= INNERMOST_TEMPLATE_ARGS (args
);
3820 nargs
= inner_args
? NUM_TMPL_ARGS (inner_args
) : 0;
3821 nparms
= TREE_VEC_LENGTH (parms
);
3825 && require_all_arguments
3826 && TREE_PURPOSE (TREE_VEC_ELT (parms
, nargs
)) == NULL_TREE
))
3828 if (complain
& tf_error
)
3830 error ("wrong number of template arguments (%d, should be %d)",
3834 cp_error_at ("provided for `%D'", in_decl
);
3837 return error_mark_node
;
3840 new_inner_args
= make_tree_vec (nparms
);
3841 new_args
= add_outermost_template_args (args
, new_inner_args
);
3842 for (i
= 0; i
< nparms
; i
++)
3847 /* Get the Ith template parameter. */
3848 parm
= TREE_VEC_ELT (parms
, i
);
3850 /* Calculate the Ith argument. */
3852 arg
= TREE_VEC_ELT (inner_args
, i
);
3853 else if (require_all_arguments
)
3854 /* There must be a default arg in this case. */
3855 arg
= tsubst_template_arg (TREE_PURPOSE (parm
), new_args
,
3860 my_friendly_assert (arg
, 20030727);
3861 if (arg
== error_mark_node
)
3862 error ("template argument %d is invalid", i
+ 1);
3864 arg
= convert_template_argument (TREE_VALUE (parm
),
3865 arg
, new_args
, complain
, i
,
3868 if (arg
== error_mark_node
)
3870 TREE_VEC_ELT (new_inner_args
, i
) = arg
;
3874 return error_mark_node
;
3876 return new_inner_args
;
3879 /* Returns 1 if template args OT and NT are equivalent. */
3882 template_args_equal (tree ot
, tree nt
)
3887 if (TREE_CODE (nt
) == TREE_VEC
)
3888 /* For member templates */
3889 return TREE_CODE (ot
) == TREE_VEC
&& comp_template_args (ot
, nt
);
3890 else if (TYPE_P (nt
))
3891 return TYPE_P (ot
) && same_type_p (ot
, nt
);
3892 else if (TREE_CODE (ot
) == TREE_VEC
|| TYPE_P (ot
))
3895 return cp_tree_equal (ot
, nt
);
3898 /* Returns 1 iff the OLDARGS and NEWARGS are in fact identical sets
3899 of template arguments. Returns 0 otherwise. */
3902 comp_template_args (tree oldargs
, tree newargs
)
3906 if (TREE_VEC_LENGTH (oldargs
) != TREE_VEC_LENGTH (newargs
))
3909 for (i
= 0; i
< TREE_VEC_LENGTH (oldargs
); ++i
)
3911 tree nt
= TREE_VEC_ELT (newargs
, i
);
3912 tree ot
= TREE_VEC_ELT (oldargs
, i
);
3914 if (! template_args_equal (ot
, nt
))
3920 /* Given class template name and parameter list, produce a user-friendly name
3921 for the instantiation. */
3924 mangle_class_name_for_template (const char* name
, tree parms
, tree arglist
)
3926 static struct obstack scratch_obstack
;
3927 static char *scratch_firstobj
;
3930 if (!scratch_firstobj
)
3931 gcc_obstack_init (&scratch_obstack
);
3933 obstack_free (&scratch_obstack
, scratch_firstobj
);
3934 scratch_firstobj
= obstack_alloc (&scratch_obstack
, 1);
3936 #define ccat(C) obstack_1grow (&scratch_obstack, (C));
3937 #define cat(S) obstack_grow (&scratch_obstack, (S), strlen (S))
3941 nparms
= TREE_VEC_LENGTH (parms
);
3942 arglist
= INNERMOST_TEMPLATE_ARGS (arglist
);
3943 my_friendly_assert (nparms
== TREE_VEC_LENGTH (arglist
), 268);
3944 for (i
= 0; i
< nparms
; i
++)
3946 tree parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
3947 tree arg
= TREE_VEC_ELT (arglist
, i
);
3952 if (TREE_CODE (parm
) == TYPE_DECL
)
3954 cat (type_as_string (arg
, TFF_CHASE_TYPEDEF
));
3957 else if (TREE_CODE (parm
) == TEMPLATE_DECL
)
3959 if (TREE_CODE (arg
) == TEMPLATE_DECL
)
3961 /* Already substituted with real template. Just output
3962 the template name here */
3963 tree context
= DECL_CONTEXT (arg
);
3966 /* The template may be defined in a namespace, or
3967 may be a member template. */
3968 my_friendly_assert (TREE_CODE (context
) == NAMESPACE_DECL
3969 || CLASS_TYPE_P (context
),
3971 cat(decl_as_string (DECL_CONTEXT (arg
), TFF_PLAIN_IDENTIFIER
));
3974 cat (IDENTIFIER_POINTER (DECL_NAME (arg
)));
3977 /* Output the parameter declaration. */
3978 cat (type_as_string (arg
, TFF_CHASE_TYPEDEF
));
3982 my_friendly_assert (TREE_CODE (parm
) == PARM_DECL
, 269);
3984 /* No need to check arglist against parmlist here; we did that
3985 in coerce_template_parms, called from lookup_template_class. */
3986 cat (expr_as_string (arg
, TFF_PLAIN_IDENTIFIER
));
3989 char *bufp
= obstack_next_free (&scratch_obstack
);
3991 while (bufp
[offset
- 1] == ' ')
3993 obstack_blank_fast (&scratch_obstack
, offset
);
3995 /* B<C<char> >, not B<C<char>> */
3996 if (bufp
[offset
- 1] == '>')
4001 return (char *) obstack_base (&scratch_obstack
);
4005 classtype_mangled_name (tree t
)
4007 if (CLASSTYPE_TEMPLATE_INFO (t
)
4008 /* Specializations have already had their names set up in
4009 lookup_template_class. */
4010 && !CLASSTYPE_TEMPLATE_SPECIALIZATION (t
))
4012 tree tmpl
= most_general_template (CLASSTYPE_TI_TEMPLATE (t
));
4014 /* For non-primary templates, the template parameters are
4015 implicit from their surrounding context. */
4016 if (PRIMARY_TEMPLATE_P (tmpl
))
4018 tree name
= DECL_NAME (tmpl
);
4019 char *mangled_name
= mangle_class_name_for_template
4020 (IDENTIFIER_POINTER (name
),
4021 DECL_INNERMOST_TEMPLATE_PARMS (tmpl
),
4022 CLASSTYPE_TI_ARGS (t
));
4023 tree id
= get_identifier (mangled_name
);
4024 IDENTIFIER_TEMPLATE (id
) = name
;
4029 return TYPE_IDENTIFIER (t
);
4033 add_pending_template (tree d
)
4035 tree ti
= (TYPE_P (d
)
4036 ? CLASSTYPE_TEMPLATE_INFO (d
)
4037 : DECL_TEMPLATE_INFO (d
));
4041 if (TI_PENDING_TEMPLATE_FLAG (ti
))
4044 /* We are called both from instantiate_decl, where we've already had a
4045 tinst_level pushed, and instantiate_template, where we haven't.
4047 level
= !(current_tinst_level
&& TINST_DECL (current_tinst_level
) == d
);
4050 push_tinst_level (d
);
4052 pt
= tree_cons (current_tinst_level
, d
, NULL_TREE
);
4053 if (last_pending_template
)
4054 TREE_CHAIN (last_pending_template
) = pt
;
4056 pending_templates
= pt
;
4058 last_pending_template
= pt
;
4060 TI_PENDING_TEMPLATE_FLAG (ti
) = 1;
4067 /* Return a TEMPLATE_ID_EXPR corresponding to the indicated FNS and
4068 ARGLIST. Valid choices for FNS are given in the cp-tree.def
4069 documentation for TEMPLATE_ID_EXPR. */
4072 lookup_template_function (tree fns
, tree arglist
)
4076 if (fns
== error_mark_node
|| arglist
== error_mark_node
)
4077 return error_mark_node
;
4079 my_friendly_assert (!arglist
|| TREE_CODE (arglist
) == TREE_VEC
, 20030726);
4080 if (fns
== NULL_TREE
4081 || TREE_CODE (fns
) == FUNCTION_DECL
)
4083 error ("non-template used as template");
4084 return error_mark_node
;
4087 my_friendly_assert (TREE_CODE (fns
) == TEMPLATE_DECL
4088 || TREE_CODE (fns
) == OVERLOAD
4090 || TREE_CODE (fns
) == IDENTIFIER_NODE
,
4093 if (BASELINK_P (fns
))
4095 BASELINK_FUNCTIONS (fns
) = build (TEMPLATE_ID_EXPR
,
4097 BASELINK_FUNCTIONS (fns
),
4102 type
= TREE_TYPE (fns
);
4103 if (TREE_CODE (fns
) == OVERLOAD
|| !type
)
4104 type
= unknown_type_node
;
4106 return build (TEMPLATE_ID_EXPR
, type
, fns
, arglist
);
4109 /* Within the scope of a template class S<T>, the name S gets bound
4110 (in build_self_reference) to a TYPE_DECL for the class, not a
4111 TEMPLATE_DECL. If DECL is a TYPE_DECL for current_class_type,
4112 or one of its enclosing classes, and that type is a template,
4113 return the associated TEMPLATE_DECL. Otherwise, the original
4114 DECL is returned. */
4117 maybe_get_template_decl_from_type_decl (tree decl
)
4119 return (decl
!= NULL_TREE
4120 && TREE_CODE (decl
) == TYPE_DECL
4121 && DECL_ARTIFICIAL (decl
)
4122 && CLASS_TYPE_P (TREE_TYPE (decl
))
4123 && CLASSTYPE_TEMPLATE_INFO (TREE_TYPE (decl
)))
4124 ? CLASSTYPE_TI_TEMPLATE (TREE_TYPE (decl
)) : decl
;
4127 /* Given an IDENTIFIER_NODE (type TEMPLATE_DECL) and a chain of
4128 parameters, find the desired type.
4130 D1 is the PTYPENAME terminal, and ARGLIST is the list of arguments.
4132 IN_DECL, if non-NULL, is the template declaration we are trying to
4135 If ENTERING_SCOPE is nonzero, we are about to enter the scope of
4136 the class we are looking up.
4138 Issue error and warning messages under control of COMPLAIN.
4140 If the template class is really a local class in a template
4141 function, then the FUNCTION_CONTEXT is the function in which it is
4142 being instantiated. */
4145 lookup_template_class (tree d1
,
4150 tsubst_flags_t complain
)
4152 tree
template = NULL_TREE
, parmlist
;
4155 timevar_push (TV_NAME_LOOKUP
);
4157 if (TREE_CODE (d1
) == IDENTIFIER_NODE
)
4159 if (IDENTIFIER_VALUE (d1
)
4160 && DECL_TEMPLATE_TEMPLATE_PARM_P (IDENTIFIER_VALUE (d1
)))
4161 template = IDENTIFIER_VALUE (d1
);
4165 push_decl_namespace (context
);
4166 template = lookup_name (d1
, /*prefer_type=*/0);
4167 template = maybe_get_template_decl_from_type_decl (template);
4169 pop_decl_namespace ();
4172 context
= DECL_CONTEXT (template);
4174 else if (TREE_CODE (d1
) == TYPE_DECL
&& IS_AGGR_TYPE (TREE_TYPE (d1
)))
4176 tree type
= TREE_TYPE (d1
);
4178 /* If we are declaring a constructor, say A<T>::A<T>, we will get
4179 an implicit typename for the second A. Deal with it. */
4180 if (TREE_CODE (type
) == TYPENAME_TYPE
&& TREE_TYPE (type
))
4181 type
= TREE_TYPE (type
);
4183 if (CLASSTYPE_TEMPLATE_INFO (type
))
4185 template = CLASSTYPE_TI_TEMPLATE (type
);
4186 d1
= DECL_NAME (template);
4189 else if (TREE_CODE (d1
) == ENUMERAL_TYPE
4190 || (TYPE_P (d1
) && IS_AGGR_TYPE (d1
)))
4192 template = TYPE_TI_TEMPLATE (d1
);
4193 d1
= DECL_NAME (template);
4195 else if (TREE_CODE (d1
) == TEMPLATE_DECL
4196 && TREE_CODE (DECL_TEMPLATE_RESULT (d1
)) == TYPE_DECL
)
4199 d1
= DECL_NAME (template);
4200 context
= DECL_CONTEXT (template);
4203 /* With something like `template <class T> class X class X { ... };'
4204 we could end up with D1 having nothing but an IDENTIFIER_VALUE.
4205 We don't want to do that, but we have to deal with the situation,
4206 so let's give them some syntax errors to chew on instead of a
4207 crash. Alternatively D1 might not be a template type at all. */
4210 if (complain
& tf_error
)
4211 error ("`%T' is not a template", d1
);
4212 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP
, error_mark_node
);
4215 if (TREE_CODE (template) != TEMPLATE_DECL
4216 /* Make sure it's a user visible template, if it was named by
4218 || ((complain
& tf_user
) && !DECL_TEMPLATE_PARM_P (template)
4219 && !PRIMARY_TEMPLATE_P (template)))
4221 if (complain
& tf_error
)
4223 error ("non-template type `%T' used as a template", d1
);
4225 cp_error_at ("for template declaration `%D'", in_decl
);
4227 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP
, error_mark_node
);
4230 complain
&= ~tf_user
;
4232 if (DECL_TEMPLATE_TEMPLATE_PARM_P (template))
4234 /* Create a new TEMPLATE_DECL and TEMPLATE_TEMPLATE_PARM node to store
4235 template arguments */
4240 parmlist
= DECL_INNERMOST_TEMPLATE_PARMS (template);
4242 /* Consider an example where a template template parameter declared as
4244 template <class T, class U = std::allocator<T> > class TT
4246 The template parameter level of T and U are one level larger than
4247 of TT. To proper process the default argument of U, say when an
4248 instantiation `TT<int>' is seen, we need to build the full
4249 arguments containing {int} as the innermost level. Outer levels,
4250 available when not appearing as default template argument, can be
4251 obtained from `current_template_args ()'.
4253 Suppose that TT is later substituted with std::vector. The above
4254 instantiation is `TT<int, std::allocator<T> >' with TT at
4255 level 1, and T at level 2, while the template arguments at level 1
4256 becomes {std::vector} and the inner level 2 is {int}. */
4258 if (current_template_parms
)
4259 arglist
= add_to_template_args (current_template_args (), arglist
);
4261 arglist2
= coerce_template_parms (parmlist
, arglist
, template,
4262 complain
, /*require_all_args=*/1);
4263 if (arglist2
== error_mark_node
4264 || (!uses_template_parms (arglist2
)
4265 && check_instantiated_args (template, arglist2
, complain
)))
4266 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP
, error_mark_node
);
4268 parm
= bind_template_template_parm (TREE_TYPE (template), arglist2
);
4269 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP
, parm
);
4273 tree template_type
= TREE_TYPE (template);
4276 tree found
= NULL_TREE
;
4280 int is_partial_instantiation
;
4282 gen_tmpl
= most_general_template (template);
4283 parmlist
= DECL_TEMPLATE_PARMS (gen_tmpl
);
4284 parm_depth
= TMPL_PARMS_DEPTH (parmlist
);
4285 arg_depth
= TMPL_ARGS_DEPTH (arglist
);
4287 if (arg_depth
== 1 && parm_depth
> 1)
4289 /* We've been given an incomplete set of template arguments.
4292 template <class T> struct S1 {
4293 template <class U> struct S2 {};
4294 template <class U> struct S2<U*> {};
4297 we will be called with an ARGLIST of `U*', but the
4298 TEMPLATE will be `template <class T> template
4299 <class U> struct S1<T>::S2'. We must fill in the missing
4302 = add_outermost_template_args (TYPE_TI_ARGS (TREE_TYPE (template)),
4304 arg_depth
= TMPL_ARGS_DEPTH (arglist
);
4307 /* Now we should have enough arguments. */
4308 my_friendly_assert (parm_depth
== arg_depth
, 0);
4310 /* From here on, we're only interested in the most general
4312 template = gen_tmpl
;
4314 /* Calculate the BOUND_ARGS. These will be the args that are
4315 actually tsubst'd into the definition to create the
4319 /* We have multiple levels of arguments to coerce, at once. */
4321 int saved_depth
= TMPL_ARGS_DEPTH (arglist
);
4323 tree bound_args
= make_tree_vec (parm_depth
);
4325 for (i
= saved_depth
,
4326 t
= DECL_TEMPLATE_PARMS (template);
4327 i
> 0 && t
!= NULL_TREE
;
4328 --i
, t
= TREE_CHAIN (t
))
4330 tree a
= coerce_template_parms (TREE_VALUE (t
),
4332 complain
, /*require_all_args=*/1);
4334 /* Don't process further if one of the levels fails. */
4335 if (a
== error_mark_node
)
4337 /* Restore the ARGLIST to its full size. */
4338 TREE_VEC_LENGTH (arglist
) = saved_depth
;
4339 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP
, error_mark_node
);
4342 SET_TMPL_ARGS_LEVEL (bound_args
, i
, a
);
4344 /* We temporarily reduce the length of the ARGLIST so
4345 that coerce_template_parms will see only the arguments
4346 corresponding to the template parameters it is
4348 TREE_VEC_LENGTH (arglist
)--;
4351 /* Restore the ARGLIST to its full size. */
4352 TREE_VEC_LENGTH (arglist
) = saved_depth
;
4354 arglist
= bound_args
;
4358 = coerce_template_parms (INNERMOST_TEMPLATE_PARMS (parmlist
),
4359 INNERMOST_TEMPLATE_ARGS (arglist
),
4361 complain
, /*require_all_args=*/1);
4363 if (arglist
== error_mark_node
)
4364 /* We were unable to bind the arguments. */
4365 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP
, error_mark_node
);
4367 /* In the scope of a template class, explicit references to the
4368 template class refer to the type of the template, not any
4369 instantiation of it. For example, in:
4371 template <class T> class C { void f(C<T>); }
4373 the `C<T>' is just the same as `C'. Outside of the
4374 class, however, such a reference is an instantiation. */
4375 if (comp_template_args (TYPE_TI_ARGS (template_type
),
4378 found
= template_type
;
4380 if (!entering_scope
&& PRIMARY_TEMPLATE_P (template))
4384 for (ctx
= current_class_type
;
4385 ctx
&& TREE_CODE (ctx
) != NAMESPACE_DECL
;
4387 ? TYPE_CONTEXT (ctx
)
4388 : DECL_CONTEXT (ctx
)))
4389 if (TYPE_P (ctx
) && same_type_p (ctx
, template_type
))
4392 /* We're not in the scope of the class, so the
4393 TEMPLATE_TYPE is not the type we want after all. */
4399 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP
, found
);
4401 for (tp
= &DECL_TEMPLATE_INSTANTIATIONS (template);
4403 tp
= &TREE_CHAIN (*tp
))
4404 if (comp_template_args (TREE_PURPOSE (*tp
), arglist
))
4408 /* Use the move-to-front heuristic to speed up future
4410 *tp
= TREE_CHAIN (*tp
);
4412 = DECL_TEMPLATE_INSTANTIATIONS (template);
4413 DECL_TEMPLATE_INSTANTIATIONS (template) = found
;
4415 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP
, TREE_VALUE (found
));
4418 /* This type is a "partial instantiation" if any of the template
4419 arguments still involve template parameters. Note that we set
4420 IS_PARTIAL_INSTANTIATION for partial specializations as
4422 is_partial_instantiation
= uses_template_parms (arglist
);
4424 /* If the deduced arguments are invalid, then the binding
4426 if (!is_partial_instantiation
4427 && check_instantiated_args (template,
4428 INNERMOST_TEMPLATE_ARGS (arglist
),
4430 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP
, error_mark_node
);
4432 if (!is_partial_instantiation
4433 && !PRIMARY_TEMPLATE_P (template)
4434 && TREE_CODE (CP_DECL_CONTEXT (template)) == NAMESPACE_DECL
)
4436 found
= xref_tag_from_type (TREE_TYPE (template),
4437 DECL_NAME (template),
4439 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP
, found
);
4442 context
= tsubst (DECL_CONTEXT (template), arglist
,
4445 context
= global_namespace
;
4447 /* Create the type. */
4448 if (TREE_CODE (template_type
) == ENUMERAL_TYPE
)
4450 if (!is_partial_instantiation
)
4452 set_current_access_from_decl (TYPE_NAME (template_type
));
4453 t
= start_enum (TYPE_IDENTIFIER (template_type
));
4456 /* We don't want to call start_enum for this type, since
4457 the values for the enumeration constants may involve
4458 template parameters. And, no one should be interested
4459 in the enumeration constants for such a type. */
4460 t
= make_node (ENUMERAL_TYPE
);
4464 t
= make_aggr_type (TREE_CODE (template_type
));
4465 CLASSTYPE_DECLARED_CLASS (t
)
4466 = CLASSTYPE_DECLARED_CLASS (template_type
);
4467 SET_CLASSTYPE_IMPLICIT_INSTANTIATION (t
);
4468 TYPE_FOR_JAVA (t
) = TYPE_FOR_JAVA (template_type
);
4470 /* A local class. Make sure the decl gets registered properly. */
4471 if (context
== current_function_decl
)
4472 pushtag (DECL_NAME (template), t
, 0);
4475 /* If we called start_enum or pushtag above, this information
4476 will already be set up. */
4479 TYPE_CONTEXT (t
) = FROB_CONTEXT (context
);
4481 type_decl
= create_implicit_typedef (DECL_NAME (template), t
);
4482 DECL_CONTEXT (type_decl
) = TYPE_CONTEXT (t
);
4483 TYPE_STUB_DECL (t
) = type_decl
;
4484 DECL_SOURCE_LOCATION (type_decl
)
4485 = DECL_SOURCE_LOCATION (TYPE_STUB_DECL (template_type
));
4488 type_decl
= TYPE_NAME (t
);
4490 TREE_PRIVATE (type_decl
)
4491 = TREE_PRIVATE (TYPE_STUB_DECL (template_type
));
4492 TREE_PROTECTED (type_decl
)
4493 = TREE_PROTECTED (TYPE_STUB_DECL (template_type
));
4495 /* Set up the template information. We have to figure out which
4496 template is the immediate parent if this is a full
4498 if (parm_depth
== 1 || is_partial_instantiation
4499 || !PRIMARY_TEMPLATE_P (template))
4500 /* This case is easy; there are no member templates involved. */
4504 /* This is a full instantiation of a member template. Look
4505 for a partial instantiation of which this is an instance. */
4507 for (found
= DECL_TEMPLATE_INSTANTIATIONS (template);
4508 found
; found
= TREE_CHAIN (found
))
4511 tree tmpl
= CLASSTYPE_TI_TEMPLATE (TREE_VALUE (found
));
4513 /* We only want partial instantiations, here, not
4514 specializations or full instantiations. */
4515 if (CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_VALUE (found
))
4516 || !uses_template_parms (TREE_VALUE (found
)))
4519 /* Temporarily reduce by one the number of levels in the
4520 ARGLIST and in FOUND so as to avoid comparing the
4521 last set of arguments. */
4522 TREE_VEC_LENGTH (arglist
)--;
4523 TREE_VEC_LENGTH (TREE_PURPOSE (found
)) --;
4525 /* See if the arguments match. If they do, then TMPL is
4526 the partial instantiation we want. */
4527 success
= comp_template_args (TREE_PURPOSE (found
), arglist
);
4529 /* Restore the argument vectors to their full size. */
4530 TREE_VEC_LENGTH (arglist
)++;
4531 TREE_VEC_LENGTH (TREE_PURPOSE (found
))++;
4542 /* There was no partial instantiation. This happens
4543 where C<T> is a member template of A<T> and it's used
4546 template <typename T> struct B { A<T>::C<int> m; };
4549 Create the partial instantiation.
4551 TREE_VEC_LENGTH (arglist
)--;
4552 found
= tsubst (template, arglist
, complain
, NULL_TREE
);
4553 TREE_VEC_LENGTH (arglist
)++;
4557 SET_TYPE_TEMPLATE_INFO (t
, tree_cons (found
, arglist
, NULL_TREE
));
4558 DECL_TEMPLATE_INSTANTIATIONS (template)
4559 = tree_cons (arglist
, t
,
4560 DECL_TEMPLATE_INSTANTIATIONS (template));
4562 if (TREE_CODE (t
) == ENUMERAL_TYPE
4563 && !is_partial_instantiation
)
4564 /* Now that the type has been registered on the instantiations
4565 list, we set up the enumerators. Because the enumeration
4566 constants may involve the enumeration type itself, we make
4567 sure to register the type first, and then create the
4568 constants. That way, doing tsubst_expr for the enumeration
4569 constants won't result in recursive calls here; we'll find
4570 the instantiation and exit above. */
4571 tsubst_enum (template_type
, t
, arglist
);
4573 /* Reset the name of the type, now that CLASSTYPE_TEMPLATE_INFO
4575 if (TREE_CODE (t
) != ENUMERAL_TYPE
)
4576 DECL_NAME (type_decl
) = classtype_mangled_name (t
);
4577 if (is_partial_instantiation
)
4578 /* If the type makes use of template parameters, the
4579 code that generates debugging information will crash. */
4580 DECL_IGNORED_P (TYPE_STUB_DECL (t
)) = 1;
4582 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP
, t
);
4584 timevar_pop (TV_NAME_LOOKUP
);
4594 /* Called from for_each_template_parm via walk_tree. */
4597 for_each_template_parm_r (tree
*tp
, int *walk_subtrees
, void *d
)
4600 struct pair_fn_data
*pfd
= (struct pair_fn_data
*) d
;
4601 tree_fn_t fn
= pfd
->fn
;
4602 void *data
= pfd
->data
;
4605 && for_each_template_parm (TYPE_CONTEXT (t
), fn
, data
, pfd
->visited
))
4606 return error_mark_node
;
4608 switch (TREE_CODE (t
))
4611 if (TYPE_PTRMEMFUNC_P (t
))
4617 if (!TYPE_TEMPLATE_INFO (t
))
4619 else if (for_each_template_parm (TREE_VALUE (TYPE_TEMPLATE_INFO (t
)),
4620 fn
, data
, pfd
->visited
))
4621 return error_mark_node
;
4625 /* Since we're not going to walk subtrees, we have to do this
4627 if (for_each_template_parm (TYPE_METHOD_BASETYPE (t
), fn
, data
,
4629 return error_mark_node
;
4633 /* Check the return type. */
4634 if (for_each_template_parm (TREE_TYPE (t
), fn
, data
, pfd
->visited
))
4635 return error_mark_node
;
4637 /* Check the parameter types. Since default arguments are not
4638 instantiated until they are needed, the TYPE_ARG_TYPES may
4639 contain expressions that involve template parameters. But,
4640 no-one should be looking at them yet. And, once they're
4641 instantiated, they don't contain template parameters, so
4642 there's no point in looking at them then, either. */
4646 for (parm
= TYPE_ARG_TYPES (t
); parm
; parm
= TREE_CHAIN (parm
))
4647 if (for_each_template_parm (TREE_VALUE (parm
), fn
, data
,
4649 return error_mark_node
;
4651 /* Since we've already handled the TYPE_ARG_TYPES, we don't
4652 want walk_tree walking into them itself. */
4658 if (for_each_template_parm (TYPE_FIELDS (t
), fn
, data
,
4660 return error_mark_node
;
4665 if (DECL_LANG_SPECIFIC (t
) && DECL_TEMPLATE_INFO (t
)
4666 && for_each_template_parm (DECL_TI_ARGS (t
), fn
, data
,
4668 return error_mark_node
;
4673 if (TREE_CODE (t
) == CONST_DECL
&& DECL_TEMPLATE_PARM_P (t
)
4674 && for_each_template_parm (DECL_INITIAL (t
), fn
, data
,
4676 return error_mark_node
;
4677 if (DECL_CONTEXT (t
)
4678 && for_each_template_parm (DECL_CONTEXT (t
), fn
, data
,
4680 return error_mark_node
;
4683 case BOUND_TEMPLATE_TEMPLATE_PARM
:
4684 /* Record template parameters such as `T' inside `TT<T>'. */
4685 if (for_each_template_parm (TYPE_TI_ARGS (t
), fn
, data
, pfd
->visited
))
4686 return error_mark_node
;
4689 case TEMPLATE_TEMPLATE_PARM
:
4690 case TEMPLATE_TYPE_PARM
:
4691 case TEMPLATE_PARM_INDEX
:
4692 if (fn
&& (*fn
)(t
, data
))
4693 return error_mark_node
;
4695 return error_mark_node
;
4699 /* A template template parameter is encountered. */
4700 if (DECL_TEMPLATE_TEMPLATE_PARM_P (t
)
4701 && for_each_template_parm (TREE_TYPE (t
), fn
, data
, pfd
->visited
))
4702 return error_mark_node
;
4704 /* Already substituted template template parameter */
4710 || for_each_template_parm (TYPENAME_TYPE_FULLNAME (t
), fn
,
4711 data
, pfd
->visited
))
4712 return error_mark_node
;
4716 if (TREE_TYPE (t
) && TYPE_PTRMEMFUNC_P (TREE_TYPE (t
))
4717 && for_each_template_parm (TYPE_PTRMEMFUNC_FN_TYPE
4718 (TREE_TYPE (t
)), fn
, data
,
4720 return error_mark_node
;
4725 /* If there's no type, then this thing must be some expression
4726 involving template parameters. */
4727 if (!fn
&& !TREE_TYPE (t
))
4728 return error_mark_node
;
4733 case REINTERPRET_CAST_EXPR
:
4734 case CONST_CAST_EXPR
:
4735 case STATIC_CAST_EXPR
:
4736 case DYNAMIC_CAST_EXPR
:
4740 case PSEUDO_DTOR_EXPR
:
4742 return error_mark_node
;
4746 /* If we do not handle this case specially, we end up walking
4747 the BINFO hierarchy, which is circular, and therefore
4748 confuses walk_tree. */
4750 if (for_each_template_parm (BASELINK_FUNCTIONS (*tp
), fn
, data
,
4752 return error_mark_node
;
4759 /* We didn't find any template parameters we liked. */
4763 /* For each TEMPLATE_TYPE_PARM, TEMPLATE_TEMPLATE_PARM,
4764 BOUND_TEMPLATE_TEMPLATE_PARM or TEMPLATE_PARM_INDEX in T,
4765 call FN with the parameter and the DATA.
4766 If FN returns nonzero, the iteration is terminated, and
4767 for_each_template_parm returns 1. Otherwise, the iteration
4768 continues. If FN never returns a nonzero value, the value
4769 returned by for_each_template_parm is 0. If FN is NULL, it is
4770 considered to be the function which always returns 1. */
4773 for_each_template_parm (tree t
, tree_fn_t fn
, void* data
, htab_t visited
)
4775 struct pair_fn_data pfd
;
4782 /* Walk the tree. (Conceptually, we would like to walk without
4783 duplicates, but for_each_template_parm_r recursively calls
4784 for_each_template_parm, so we would need to reorganize a fair
4785 bit to use walk_tree_without_duplicates, so we keep our own
4788 pfd
.visited
= visited
;
4790 pfd
.visited
= htab_create (37, htab_hash_pointer
, htab_eq_pointer
,
4792 result
= walk_tree (&t
,
4793 for_each_template_parm_r
,
4795 pfd
.visited
) != NULL_TREE
;
4799 htab_delete (pfd
.visited
);
4804 /* Returns true if T depends on any template parameter. */
4807 uses_template_parms (tree t
)
4810 int saved_processing_template_decl
;
4812 saved_processing_template_decl
= processing_template_decl
;
4813 if (!saved_processing_template_decl
)
4814 processing_template_decl
= 1;
4816 dependent_p
= dependent_type_p (t
);
4817 else if (TREE_CODE (t
) == TREE_VEC
)
4818 dependent_p
= any_dependent_template_arguments_p (t
);
4819 else if (TREE_CODE (t
) == TREE_LIST
)
4820 dependent_p
= (uses_template_parms (TREE_VALUE (t
))
4821 || uses_template_parms (TREE_CHAIN (t
)));
4824 || TREE_CODE (t
) == TEMPLATE_PARM_INDEX
4825 || TREE_CODE (t
) == OVERLOAD
4826 || TREE_CODE (t
) == BASELINK
4827 || TREE_CODE_CLASS (TREE_CODE (t
)) == 'c')
4828 dependent_p
= (type_dependent_expression_p (t
)
4829 || value_dependent_expression_p (t
));
4830 else if (t
== error_mark_node
)
4831 dependent_p
= false;
4834 processing_template_decl
= saved_processing_template_decl
;
4839 /* Returns true if T depends on any template parameter with level LEVEL. */
4842 uses_template_parms_level (tree t
, int level
)
4844 return for_each_template_parm (t
, template_parm_this_level_p
, &level
, NULL
);
4847 static int tinst_depth
;
4848 extern int max_tinst_depth
;
4849 #ifdef GATHER_STATISTICS
4852 static int tinst_level_tick
;
4853 static int last_template_error_tick
;
4855 /* We're starting to instantiate D; record the template instantiation context
4856 for diagnostics and to restore it later. */
4859 push_tinst_level (tree d
)
4863 if (tinst_depth
>= max_tinst_depth
)
4865 /* If the instantiation in question still has unbound template parms,
4866 we don't really care if we can't instantiate it, so just return.
4867 This happens with base instantiation for implicit `typename'. */
4868 if (uses_template_parms (d
))
4871 last_template_error_tick
= tinst_level_tick
;
4872 error ("template instantiation depth exceeds maximum of %d (use -ftemplate-depth-NN to increase the maximum) instantiating `%D'",
4873 max_tinst_depth
, d
);
4875 print_instantiation_context ();
4880 new = make_node (TINST_LEVEL
);
4881 SET_EXPR_LOCATION (new, input_location
);
4882 TINST_DECL (new) = d
;
4883 TREE_CHAIN (new) = current_tinst_level
;
4884 current_tinst_level
= new;
4887 #ifdef GATHER_STATISTICS
4888 if (tinst_depth
> depth_reached
)
4889 depth_reached
= tinst_depth
;
4896 /* We're done instantiating this template; return to the instantiation
4900 pop_tinst_level (void)
4902 tree old
= current_tinst_level
;
4904 /* Restore the filename and line number stashed away when we started
4905 this instantiation. */
4906 input_location
= EXPR_LOCATION (old
);
4907 extract_interface_info ();
4909 current_tinst_level
= TREE_CHAIN (old
);
4914 /* We're instantiating a deferred template; restore the template
4915 instantiation context in which the instantiation was requested, which
4916 is one step out from LEVEL. */
4919 reopen_tinst_level (tree level
)
4924 for (t
= level
; t
; t
= TREE_CHAIN (t
))
4927 current_tinst_level
= level
;
4931 /* Return the outermost template instantiation context, for use with
4932 -falt-external-templates. */
4935 tinst_for_decl (void)
4937 tree p
= current_tinst_level
;
4940 for (; TREE_CHAIN (p
) ; p
= TREE_CHAIN (p
))
4945 /* DECL is a friend FUNCTION_DECL or TEMPLATE_DECL. ARGS is the
4946 vector of template arguments, as for tsubst.
4948 Returns an appropriate tsubst'd friend declaration. */
4951 tsubst_friend_function (tree decl
, tree args
)
4954 location_t saved_loc
= input_location
;
4956 input_location
= DECL_SOURCE_LOCATION (decl
);
4958 if (TREE_CODE (decl
) == FUNCTION_DECL
4959 && DECL_TEMPLATE_INSTANTIATION (decl
)
4960 && TREE_CODE (DECL_TI_TEMPLATE (decl
)) != TEMPLATE_DECL
)
4961 /* This was a friend declared with an explicit template
4962 argument list, e.g.:
4966 to indicate that f was a template instantiation, not a new
4967 function declaration. Now, we have to figure out what
4968 instantiation of what template. */
4970 tree template_id
, arglist
, fns
;
4973 tree ns
= decl_namespace_context (TYPE_MAIN_DECL (current_class_type
));
4975 /* Friend functions are looked up in the containing namespace scope.
4976 We must enter that scope, to avoid finding member functions of the
4977 current cless with same name. */
4978 push_nested_namespace (ns
);
4979 fns
= tsubst_expr (DECL_TI_TEMPLATE (decl
), args
,
4980 tf_error
| tf_warning
, NULL_TREE
);
4981 pop_nested_namespace (ns
);
4982 arglist
= tsubst (DECL_TI_ARGS (decl
), args
,
4983 tf_error
| tf_warning
, NULL_TREE
);
4984 template_id
= lookup_template_function (fns
, arglist
);
4986 new_friend
= tsubst (decl
, args
, tf_error
| tf_warning
, NULL_TREE
);
4987 tmpl
= determine_specialization (template_id
, new_friend
,
4989 /*need_member_template=*/0);
4990 new_friend
= instantiate_template (tmpl
, new_args
, tf_error
);
4994 new_friend
= tsubst (decl
, args
, tf_error
| tf_warning
, NULL_TREE
);
4996 /* The NEW_FRIEND will look like an instantiation, to the
4997 compiler, but is not an instantiation from the point of view of
4998 the language. For example, we might have had:
5000 template <class T> struct S {
5001 template <class U> friend void f(T, U);
5004 Then, in S<int>, template <class U> void f(int, U) is not an
5005 instantiation of anything. */
5006 if (new_friend
== error_mark_node
)
5007 return error_mark_node
;
5009 DECL_USE_TEMPLATE (new_friend
) = 0;
5010 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
5012 DECL_USE_TEMPLATE (DECL_TEMPLATE_RESULT (new_friend
)) = 0;
5013 DECL_SAVED_TREE (DECL_TEMPLATE_RESULT (new_friend
))
5014 = DECL_SAVED_TREE (DECL_TEMPLATE_RESULT (decl
));
5017 /* The mangled name for the NEW_FRIEND is incorrect. The function
5018 is not a template instantiation and should not be mangled like
5019 one. Therefore, we forget the mangling here; we'll recompute it
5020 later if we need it. */
5021 if (TREE_CODE (new_friend
) != TEMPLATE_DECL
)
5023 SET_DECL_RTL (new_friend
, NULL_RTX
);
5024 SET_DECL_ASSEMBLER_NAME (new_friend
, NULL_TREE
);
5027 if (DECL_NAMESPACE_SCOPE_P (new_friend
))
5030 tree new_friend_template_info
;
5031 tree new_friend_result_template_info
;
5033 int new_friend_is_defn
;
5035 /* We must save some information from NEW_FRIEND before calling
5036 duplicate decls since that function will free NEW_FRIEND if
5038 new_friend_template_info
= DECL_TEMPLATE_INFO (new_friend
);
5039 new_friend_is_defn
=
5040 (DECL_INITIAL (DECL_TEMPLATE_RESULT
5041 (template_for_substitution (new_friend
)))
5043 if (TREE_CODE (new_friend
) == TEMPLATE_DECL
)
5045 /* This declaration is a `primary' template. */
5046 DECL_PRIMARY_TEMPLATE (new_friend
) = new_friend
;
5048 new_friend_result_template_info
5049 = DECL_TEMPLATE_INFO (DECL_TEMPLATE_RESULT (new_friend
));
5052 new_friend_result_template_info
= NULL_TREE
;
5054 /* Inside pushdecl_namespace_level, we will push into the
5055 current namespace. However, the friend function should go
5056 into the namespace of the template. */
5057 ns
= decl_namespace_context (new_friend
);
5058 push_nested_namespace (ns
);
5059 old_decl
= pushdecl_namespace_level (new_friend
);
5060 pop_nested_namespace (ns
);
5062 if (old_decl
!= new_friend
)
5064 /* This new friend declaration matched an existing
5065 declaration. For example, given:
5067 template <class T> void f(T);
5068 template <class U> class C {
5069 template <class T> friend void f(T) {}
5072 the friend declaration actually provides the definition
5073 of `f', once C has been instantiated for some type. So,
5074 old_decl will be the out-of-class template declaration,
5075 while new_friend is the in-class definition.
5077 But, if `f' was called before this point, the
5078 instantiation of `f' will have DECL_TI_ARGS corresponding
5079 to `T' but not to `U', references to which might appear
5080 in the definition of `f'. Previously, the most general
5081 template for an instantiation of `f' was the out-of-class
5082 version; now it is the in-class version. Therefore, we
5083 run through all specialization of `f', adding to their
5084 DECL_TI_ARGS appropriately. In particular, they need a
5085 new set of outer arguments, corresponding to the
5086 arguments for this class instantiation.
5088 The same situation can arise with something like this:
5091 template <class T> class C {
5095 when `C<int>' is instantiated. Now, `f(int)' is defined
5098 if (!new_friend_is_defn
)
5099 /* On the other hand, if the in-class declaration does
5100 *not* provide a definition, then we don't want to alter
5101 existing definitions. We can just leave everything
5106 /* Overwrite whatever template info was there before, if
5107 any, with the new template information pertaining to
5109 DECL_TEMPLATE_INFO (old_decl
) = new_friend_template_info
;
5111 if (TREE_CODE (old_decl
) != TEMPLATE_DECL
)
5112 reregister_specialization (new_friend
,
5113 most_general_template (old_decl
),
5118 tree new_friend_args
;
5120 DECL_TEMPLATE_INFO (DECL_TEMPLATE_RESULT (old_decl
))
5121 = new_friend_result_template_info
;
5123 new_friend_args
= TI_ARGS (new_friend_template_info
);
5124 for (t
= DECL_TEMPLATE_SPECIALIZATIONS (old_decl
);
5128 tree spec
= TREE_VALUE (t
);
5131 = add_outermost_template_args (new_friend_args
,
5132 DECL_TI_ARGS (spec
));
5135 /* Now, since specializations are always supposed to
5136 hang off of the most general template, we must move
5138 t
= most_general_template (old_decl
);
5141 DECL_TEMPLATE_SPECIALIZATIONS (t
)
5142 = chainon (DECL_TEMPLATE_SPECIALIZATIONS (t
),
5143 DECL_TEMPLATE_SPECIALIZATIONS (old_decl
));
5144 DECL_TEMPLATE_SPECIALIZATIONS (old_decl
) = NULL_TREE
;
5149 /* The information from NEW_FRIEND has been merged into OLD_DECL
5150 by duplicate_decls. */
5151 new_friend
= old_decl
;
5154 else if (COMPLETE_TYPE_P (DECL_CONTEXT (new_friend
)))
5156 /* Check to see that the declaration is really present, and,
5157 possibly obtain an improved declaration. */
5158 tree fn
= check_classfn (DECL_CONTEXT (new_friend
),
5159 new_friend
, NULL_TREE
);
5166 input_location
= saved_loc
;
5170 /* FRIEND_TMPL is a friend TEMPLATE_DECL. ARGS is the vector of
5171 template arguments, as for tsubst.
5173 Returns an appropriate tsubst'd friend type or error_mark_node on
5177 tsubst_friend_class (tree friend_tmpl
, tree args
)
5183 context
= DECL_CONTEXT (friend_tmpl
);
5187 if (TREE_CODE (context
) == NAMESPACE_DECL
)
5188 push_nested_namespace (context
);
5190 push_nested_class (tsubst (context
, args
, tf_none
, NULL_TREE
));
5193 /* First, we look for a class template. */
5194 tmpl
= lookup_name (DECL_NAME (friend_tmpl
), /*prefer_type=*/0);
5196 /* But, if we don't find one, it might be because we're in a
5197 situation like this:
5205 Here, in the scope of (say) S<int>, `S' is bound to a TYPE_DECL
5206 for `S<int>', not the TEMPLATE_DECL. */
5207 if (!tmpl
|| !DECL_CLASS_TEMPLATE_P (tmpl
))
5209 tmpl
= lookup_name (DECL_NAME (friend_tmpl
), /*prefer_type=*/1);
5210 tmpl
= maybe_get_template_decl_from_type_decl (tmpl
);
5213 if (tmpl
&& DECL_CLASS_TEMPLATE_P (tmpl
))
5215 /* The friend template has already been declared. Just
5216 check to see that the declarations match, and install any new
5217 default parameters. We must tsubst the default parameters,
5218 of course. We only need the innermost template parameters
5219 because that is all that redeclare_class_template will look
5221 if (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (friend_tmpl
))
5222 > TMPL_ARGS_DEPTH (args
))
5225 parms
= tsubst_template_parms (DECL_TEMPLATE_PARMS (friend_tmpl
),
5226 args
, tf_error
| tf_warning
);
5227 redeclare_class_template (TREE_TYPE (tmpl
), parms
);
5230 friend_type
= TREE_TYPE (tmpl
);
5234 /* The friend template has not already been declared. In this
5235 case, the instantiation of the template class will cause the
5236 injection of this template into the global scope. */
5237 tmpl
= tsubst (friend_tmpl
, args
, tf_error
| tf_warning
, NULL_TREE
);
5239 /* The new TMPL is not an instantiation of anything, so we
5240 forget its origins. We don't reset CLASSTYPE_TI_TEMPLATE for
5241 the new type because that is supposed to be the corresponding
5242 template decl, i.e., TMPL. */
5243 DECL_USE_TEMPLATE (tmpl
) = 0;
5244 DECL_TEMPLATE_INFO (tmpl
) = NULL_TREE
;
5245 CLASSTYPE_USE_TEMPLATE (TREE_TYPE (tmpl
)) = 0;
5246 CLASSTYPE_TI_ARGS (TREE_TYPE (tmpl
))
5247 = INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (TREE_TYPE (tmpl
)));
5249 /* Inject this template into the global scope. */
5250 friend_type
= TREE_TYPE (pushdecl_top_level (tmpl
));
5255 if (TREE_CODE (context
) == NAMESPACE_DECL
)
5256 pop_nested_namespace (context
);
5258 pop_nested_class ();
5264 /* Returns zero if TYPE cannot be completed later due to circularity.
5265 Otherwise returns one. */
5268 can_complete_type_without_circularity (tree type
)
5270 if (type
== NULL_TREE
|| type
== error_mark_node
)
5272 else if (COMPLETE_TYPE_P (type
))
5274 else if (TREE_CODE (type
) == ARRAY_TYPE
&& TYPE_DOMAIN (type
))
5275 return can_complete_type_without_circularity (TREE_TYPE (type
));
5276 else if (CLASS_TYPE_P (type
)
5277 && TYPE_BEING_DEFINED (TYPE_MAIN_VARIANT (type
)))
5284 instantiate_class_template (tree type
)
5286 tree
template, args
, pattern
, t
, member
;
5290 if (type
== error_mark_node
)
5291 return error_mark_node
;
5293 if (TYPE_BEING_DEFINED (type
)
5294 || COMPLETE_TYPE_P (type
)
5295 || dependent_type_p (type
))
5298 /* Figure out which template is being instantiated. */
5299 template = most_general_template (CLASSTYPE_TI_TEMPLATE (type
));
5300 my_friendly_assert (TREE_CODE (template) == TEMPLATE_DECL
, 279);
5302 /* Figure out which arguments are being used to do the
5304 args
= CLASSTYPE_TI_ARGS (type
);
5306 /* Determine what specialization of the original template to
5308 t
= most_specialized_class (template, args
);
5309 if (t
== error_mark_node
)
5311 const char *str
= "candidates are:";
5312 error ("ambiguous class template instantiation for `%#T'", type
);
5313 for (t
= DECL_TEMPLATE_SPECIALIZATIONS (template); t
;
5316 if (get_class_bindings (TREE_VALUE (t
), TREE_PURPOSE (t
), args
))
5318 cp_error_at ("%s %+#T", str
, TREE_TYPE (t
));
5322 TYPE_BEING_DEFINED (type
) = 1;
5323 return error_mark_node
;
5327 pattern
= TREE_TYPE (t
);
5329 pattern
= TREE_TYPE (template);
5331 /* If the template we're instantiating is incomplete, then clearly
5332 there's nothing we can do. */
5333 if (!COMPLETE_TYPE_P (pattern
))
5336 /* If we've recursively instantiated too many templates, stop. */
5337 if (! push_tinst_level (type
))
5340 /* Now we're really doing the instantiation. Mark the type as in
5341 the process of being defined. */
5342 TYPE_BEING_DEFINED (type
) = 1;
5344 /* We may be in the middle of deferred access check. Disable
5346 push_deferring_access_checks (dk_no_deferred
);
5348 push_to_top_level ();
5352 /* This TYPE is actually an instantiation of a partial
5353 specialization. We replace the innermost set of ARGS with
5354 the arguments appropriate for substitution. For example,
5357 template <class T> struct S {};
5358 template <class T> struct S<T*> {};
5360 and supposing that we are instantiating S<int*>, ARGS will
5361 present be {int*} but we need {int}. */
5363 = get_class_bindings (TREE_VALUE (t
), TREE_PURPOSE (t
),
5366 /* If there were multiple levels in ARGS, replacing the
5367 innermost level would alter CLASSTYPE_TI_ARGS, which we don't
5368 want, so we make a copy first. */
5369 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (args
))
5371 args
= copy_node (args
);
5372 SET_TMPL_ARGS_LEVEL (args
, TMPL_ARGS_DEPTH (args
), inner_args
);
5378 SET_CLASSTYPE_INTERFACE_UNKNOWN (type
);
5380 /* Set the input location to the template definition. This is needed
5381 if tsubsting causes an error. */
5382 input_location
= DECL_SOURCE_LOCATION (TYPE_NAME (pattern
));
5384 TYPE_HAS_CONSTRUCTOR (type
) = TYPE_HAS_CONSTRUCTOR (pattern
);
5385 TYPE_HAS_DESTRUCTOR (type
) = TYPE_HAS_DESTRUCTOR (pattern
);
5386 TYPE_HAS_NEW_OPERATOR (type
) = TYPE_HAS_NEW_OPERATOR (pattern
);
5387 TYPE_HAS_ARRAY_NEW_OPERATOR (type
) = TYPE_HAS_ARRAY_NEW_OPERATOR (pattern
);
5388 TYPE_GETS_DELETE (type
) = TYPE_GETS_DELETE (pattern
);
5389 TYPE_HAS_ASSIGN_REF (type
) = TYPE_HAS_ASSIGN_REF (pattern
);
5390 TYPE_HAS_CONST_ASSIGN_REF (type
) = TYPE_HAS_CONST_ASSIGN_REF (pattern
);
5391 TYPE_HAS_ABSTRACT_ASSIGN_REF (type
) = TYPE_HAS_ABSTRACT_ASSIGN_REF (pattern
);
5392 TYPE_HAS_INIT_REF (type
) = TYPE_HAS_INIT_REF (pattern
);
5393 TYPE_HAS_CONST_INIT_REF (type
) = TYPE_HAS_CONST_INIT_REF (pattern
);
5394 TYPE_HAS_DEFAULT_CONSTRUCTOR (type
) = TYPE_HAS_DEFAULT_CONSTRUCTOR (pattern
);
5395 TYPE_HAS_CONVERSION (type
) = TYPE_HAS_CONVERSION (pattern
);
5396 TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (type
)
5397 = TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (pattern
);
5398 TYPE_USES_MULTIPLE_INHERITANCE (type
)
5399 = TYPE_USES_MULTIPLE_INHERITANCE (pattern
);
5400 TYPE_USES_VIRTUAL_BASECLASSES (type
)
5401 = TYPE_USES_VIRTUAL_BASECLASSES (pattern
);
5402 TYPE_PACKED (type
) = TYPE_PACKED (pattern
);
5403 TYPE_ALIGN (type
) = TYPE_ALIGN (pattern
);
5404 TYPE_USER_ALIGN (type
) = TYPE_USER_ALIGN (pattern
);
5405 TYPE_FOR_JAVA (type
) = TYPE_FOR_JAVA (pattern
); /* For libjava's JArray<T> */
5406 if (ANON_AGGR_TYPE_P (pattern
))
5407 SET_ANON_AGGR_TYPE_P (type
);
5409 pbinfo
= TYPE_BINFO (pattern
);
5411 #ifdef ENABLE_CHECKING
5412 if (DECL_CLASS_SCOPE_P (TYPE_MAIN_DECL (pattern
))
5413 && ! COMPLETE_TYPE_P (TYPE_CONTEXT (type
))
5414 && ! TYPE_BEING_DEFINED (TYPE_CONTEXT (type
)))
5415 /* We should never instantiate a nested class before its enclosing
5416 class; we need to look up the nested class by name before we can
5417 instantiate it, and that lookup should instantiate the enclosing
5422 if (BINFO_BASE_BINFOS (pbinfo
))
5424 tree base_list
= NULL_TREE
;
5425 tree pbases
= BINFO_BASE_BINFOS (pbinfo
);
5426 tree paccesses
= BINFO_BASE_ACCESSES (pbinfo
);
5427 tree context
= TYPE_CONTEXT (type
);
5431 /* We must enter the scope containing the type, as that is where
5432 the accessibility of types named in dependent bases are
5434 pop_p
= push_scope (context
? context
: global_namespace
);
5436 /* Substitute into each of the bases to determine the actual
5438 for (i
= 0; i
< TREE_VEC_LENGTH (pbases
); ++i
)
5444 pbase
= TREE_VEC_ELT (pbases
, i
);
5445 access
= TREE_VEC_ELT (paccesses
, i
);
5447 /* Substitute to figure out the base class. */
5448 base
= tsubst (BINFO_TYPE (pbase
), args
, tf_error
, NULL_TREE
);
5449 if (base
== error_mark_node
)
5452 base_list
= tree_cons (access
, base
, base_list
);
5453 if (BINFO_VIRTUAL_P (pbase
))
5454 TREE_TYPE (base_list
) = integer_type_node
;
5457 /* The list is now in reverse order; correct that. */
5458 base_list
= nreverse (base_list
);
5460 /* Now call xref_basetypes to set up all the base-class
5462 xref_basetypes (type
, base_list
);
5465 pop_scope (context
? context
: global_namespace
);
5468 /* Now that our base classes are set up, enter the scope of the
5469 class, so that name lookups into base classes, etc. will work
5470 correctly. This is precisely analogous to what we do in
5471 begin_class_definition when defining an ordinary non-template
5475 /* Now members are processed in the order of declaration. */
5476 for (member
= CLASSTYPE_DECL_LIST (pattern
);
5477 member
; member
= TREE_CHAIN (member
))
5479 tree t
= TREE_VALUE (member
);
5481 if (TREE_PURPOSE (member
))
5485 /* Build new CLASSTYPE_NESTED_UTDS. */
5488 tree name
= TYPE_IDENTIFIER (tag
);
5491 newtag
= tsubst (tag
, args
, tf_error
, NULL_TREE
);
5492 if (newtag
== error_mark_node
)
5495 if (TREE_CODE (newtag
) != ENUMERAL_TYPE
)
5497 if (TYPE_LANG_SPECIFIC (tag
) && CLASSTYPE_IS_TEMPLATE (tag
))
5498 /* Unfortunately, lookup_template_class sets
5499 CLASSTYPE_IMPLICIT_INSTANTIATION for a partial
5500 instantiation (i.e., for the type of a member
5501 template class nested within a template class.)
5502 This behavior is required for
5503 maybe_process_partial_specialization to work
5504 correctly, but is not accurate in this case;
5505 the TAG is not an instantiation of anything.
5506 (The corresponding TEMPLATE_DECL is an
5507 instantiation, but the TYPE is not.) */
5508 CLASSTYPE_USE_TEMPLATE (newtag
) = 0;
5510 /* Now, we call pushtag to put this NEWTAG into the scope of
5511 TYPE. We first set up the IDENTIFIER_TYPE_VALUE to avoid
5512 pushtag calling push_template_decl. We don't have to do
5513 this for enums because it will already have been done in
5516 SET_IDENTIFIER_TYPE_VALUE (name
, newtag
);
5517 pushtag (name
, newtag
, /*globalize=*/0);
5520 else if (TREE_CODE (t
) == FUNCTION_DECL
5521 || DECL_FUNCTION_TEMPLATE_P (t
))
5523 /* Build new TYPE_METHODS. */
5526 if (TREE_CODE (t
) == TEMPLATE_DECL
)
5527 ++processing_template_decl
;
5528 r
= tsubst (t
, args
, tf_error
, NULL_TREE
);
5529 if (TREE_CODE (t
) == TEMPLATE_DECL
)
5530 --processing_template_decl
;
5531 set_current_access_from_decl (r
);
5532 grok_special_member_properties (r
);
5533 finish_member_declaration (r
);
5537 /* Build new TYPE_FIELDS. */
5539 if (TREE_CODE (t
) != CONST_DECL
)
5543 /* The the file and line for this declaration, to
5544 assist in error message reporting. Since we
5545 called push_tinst_level above, we don't need to
5547 input_location
= DECL_SOURCE_LOCATION (t
);
5549 if (TREE_CODE (t
) == TEMPLATE_DECL
)
5550 ++processing_template_decl
;
5551 r
= tsubst (t
, args
, tf_error
| tf_warning
, NULL_TREE
);
5552 if (TREE_CODE (t
) == TEMPLATE_DECL
)
5553 --processing_template_decl
;
5554 if (TREE_CODE (r
) == VAR_DECL
)
5558 if (DECL_INITIALIZED_IN_CLASS_P (r
))
5559 init
= tsubst_expr (DECL_INITIAL (t
), args
,
5560 tf_error
| tf_warning
, NULL_TREE
);
5564 finish_static_data_member_decl
5565 (r
, init
, /*asmspec_tree=*/NULL_TREE
, /*flags=*/0);
5567 if (DECL_INITIALIZED_IN_CLASS_P (r
))
5568 check_static_variable_definition (r
, TREE_TYPE (r
));
5570 else if (TREE_CODE (r
) == FIELD_DECL
)
5572 /* Determine whether R has a valid type and can be
5573 completed later. If R is invalid, then it is
5574 replaced by error_mark_node so that it will not be
5575 added to TYPE_FIELDS. */
5576 tree rtype
= TREE_TYPE (r
);
5577 if (can_complete_type_without_circularity (rtype
))
5578 complete_type (rtype
);
5580 if (!COMPLETE_TYPE_P (rtype
))
5582 cxx_incomplete_type_error (r
, rtype
);
5583 r
= error_mark_node
;
5587 /* If it is a TYPE_DECL for a class-scoped ENUMERAL_TYPE,
5588 such a thing will already have been added to the field
5589 list by tsubst_enum in finish_member_declaration in the
5590 CLASSTYPE_NESTED_UTDS case above. */
5591 if (!(TREE_CODE (r
) == TYPE_DECL
5592 && TREE_CODE (TREE_TYPE (r
)) == ENUMERAL_TYPE
5593 && DECL_ARTIFICIAL (r
)))
5595 set_current_access_from_decl (r
);
5596 finish_member_declaration (r
);
5603 if (TYPE_P (t
) || DECL_CLASS_TEMPLATE_P (t
))
5605 /* Build new CLASSTYPE_FRIEND_CLASSES. */
5607 tree friend_type
= t
;
5608 tree new_friend_type
;
5610 if (TREE_CODE (friend_type
) == TEMPLATE_DECL
)
5611 new_friend_type
= tsubst_friend_class (friend_type
, args
);
5612 else if (uses_template_parms (friend_type
))
5613 new_friend_type
= tsubst (friend_type
, args
,
5614 tf_error
| tf_warning
, NULL_TREE
);
5615 else if (CLASSTYPE_USE_TEMPLATE (friend_type
))
5616 new_friend_type
= friend_type
;
5619 tree ns
= decl_namespace_context (TYPE_MAIN_DECL (friend_type
));
5621 /* The call to xref_tag_from_type does injection for friend
5623 push_nested_namespace (ns
);
5625 xref_tag_from_type (friend_type
, NULL_TREE
, 1);
5626 pop_nested_namespace (ns
);
5629 if (TREE_CODE (friend_type
) == TEMPLATE_DECL
)
5630 /* Trick make_friend_class into realizing that the friend
5631 we're adding is a template, not an ordinary class. It's
5632 important that we use make_friend_class since it will
5633 perform some error-checking and output cross-reference
5635 ++processing_template_decl
;
5637 if (new_friend_type
!= error_mark_node
)
5638 make_friend_class (type
, new_friend_type
,
5639 /*complain=*/false);
5641 if (TREE_CODE (friend_type
) == TEMPLATE_DECL
)
5642 --processing_template_decl
;
5646 /* Build new DECL_FRIENDLIST. */
5649 if (TREE_CODE (t
) == TEMPLATE_DECL
)
5650 ++processing_template_decl
;
5651 r
= tsubst_friend_function (t
, args
);
5652 if (TREE_CODE (t
) == TEMPLATE_DECL
)
5653 --processing_template_decl
;
5654 add_friend (type
, r
, /*complain=*/false);
5659 /* Set the file and line number information to whatever is given for
5660 the class itself. This puts error messages involving generated
5661 implicit functions at a predictable point, and the same point
5662 that would be used for non-template classes. */
5663 typedecl
= TYPE_MAIN_DECL (type
);
5664 input_location
= DECL_SOURCE_LOCATION (typedecl
);
5666 unreverse_member_declarations (type
);
5667 finish_struct_1 (type
);
5669 /* Clear this now so repo_template_used is happy. */
5670 TYPE_BEING_DEFINED (type
) = 0;
5671 repo_template_used (type
);
5673 /* Now that the class is complete, instantiate default arguments for
5674 any member functions. We don't do this earlier because the
5675 default arguments may reference members of the class. */
5676 if (!PRIMARY_TEMPLATE_P (template))
5677 for (t
= TYPE_METHODS (type
); t
; t
= TREE_CHAIN (t
))
5678 if (TREE_CODE (t
) == FUNCTION_DECL
5679 /* Implicitly generated member functions will not have template
5680 information; they are not instantiations, but instead are
5681 created "fresh" for each instantiation. */
5682 && DECL_TEMPLATE_INFO (t
))
5683 tsubst_default_arguments (t
);
5686 pop_from_top_level ();
5687 pop_deferring_access_checks ();
5690 if (TYPE_CONTAINS_VPTR_P (type
))
5691 keyed_classes
= tree_cons (NULL_TREE
, type
, keyed_classes
);
5697 tsubst_template_arg (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
5703 else if (TYPE_P (t
))
5704 r
= tsubst (t
, args
, complain
, in_decl
);
5707 r
= tsubst_expr (t
, args
, complain
, in_decl
);
5709 if (!uses_template_parms (r
))
5711 /* Sometimes, one of the args was an expression involving a
5712 template constant parameter, like N - 1. Now that we've
5713 tsubst'd, we might have something like 2 - 1. This will
5714 confuse lookup_template_class, so we do constant folding
5715 here. We have to unset processing_template_decl, to fool
5716 tsubst_copy_and_build() into building an actual tree. */
5718 /* If the TREE_TYPE of ARG is not NULL_TREE, ARG is already
5719 as simple as it's going to get, and trying to reprocess
5720 the trees will break. Once tsubst_expr et al DTRT for
5721 non-dependent exprs, this code can go away, as the type
5722 will always be set. */
5725 int saved_processing_template_decl
= processing_template_decl
;
5726 processing_template_decl
= 0;
5727 r
= tsubst_copy_and_build (r
, /*args=*/NULL_TREE
,
5728 tf_error
, /*in_decl=*/NULL_TREE
,
5729 /*function_p=*/false);
5730 processing_template_decl
= saved_processing_template_decl
;
5738 /* Substitute ARGS into the vector or list of template arguments T. */
5741 tsubst_template_args (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
5743 int len
= TREE_VEC_LENGTH (t
);
5744 int need_new
= 0, i
;
5745 tree
*elts
= alloca (len
* sizeof (tree
));
5747 for (i
= 0; i
< len
; i
++)
5749 tree orig_arg
= TREE_VEC_ELT (t
, i
);
5752 if (TREE_CODE (orig_arg
) == TREE_VEC
)
5753 new_arg
= tsubst_template_args (orig_arg
, args
, complain
, in_decl
);
5755 new_arg
= tsubst_template_arg (orig_arg
, args
, complain
, in_decl
);
5757 if (new_arg
== error_mark_node
)
5758 return error_mark_node
;
5761 if (new_arg
!= orig_arg
)
5768 t
= make_tree_vec (len
);
5769 for (i
= 0; i
< len
; i
++)
5770 TREE_VEC_ELT (t
, i
) = elts
[i
];
5775 /* Return the result of substituting ARGS into the template parameters
5776 given by PARMS. If there are m levels of ARGS and m + n levels of
5777 PARMS, then the result will contain n levels of PARMS. For
5778 example, if PARMS is `template <class T> template <class U>
5779 template <T*, U, class V>' and ARGS is {{int}, {double}} then the
5780 result will be `template <int*, double, class V>'. */
5783 tsubst_template_parms (tree parms
, tree args
, tsubst_flags_t complain
)
5788 for (new_parms
= &r
;
5789 TMPL_PARMS_DEPTH (parms
) > TMPL_ARGS_DEPTH (args
);
5790 new_parms
= &(TREE_CHAIN (*new_parms
)),
5791 parms
= TREE_CHAIN (parms
))
5794 make_tree_vec (TREE_VEC_LENGTH (TREE_VALUE (parms
)));
5797 for (i
= 0; i
< TREE_VEC_LENGTH (new_vec
); ++i
)
5799 tree tuple
= TREE_VEC_ELT (TREE_VALUE (parms
), i
);
5800 tree default_value
= TREE_PURPOSE (tuple
);
5801 tree parm_decl
= TREE_VALUE (tuple
);
5803 parm_decl
= tsubst (parm_decl
, args
, complain
, NULL_TREE
);
5804 default_value
= tsubst_template_arg (default_value
, args
,
5805 complain
, NULL_TREE
);
5807 tuple
= build_tree_list (default_value
, parm_decl
);
5808 TREE_VEC_ELT (new_vec
, i
) = tuple
;
5812 tree_cons (size_int (TMPL_PARMS_DEPTH (parms
)
5813 - TMPL_ARGS_DEPTH (args
)),
5814 new_vec
, NULL_TREE
);
5820 /* Substitute the ARGS into the indicated aggregate (or enumeration)
5821 type T. If T is not an aggregate or enumeration type, it is
5822 handled as if by tsubst. IN_DECL is as for tsubst. If
5823 ENTERING_SCOPE is nonzero, T is the context for a template which
5824 we are presently tsubst'ing. Return the substituted value. */
5827 tsubst_aggr_type (tree t
,
5829 tsubst_flags_t complain
,
5836 switch (TREE_CODE (t
))
5839 if (TYPE_PTRMEMFUNC_P (t
))
5840 return tsubst (TYPE_PTRMEMFUNC_FN_TYPE (t
), args
, complain
, in_decl
);
5842 /* Else fall through. */
5845 if (TYPE_TEMPLATE_INFO (t
))
5851 /* First, determine the context for the type we are looking
5853 context
= TYPE_CONTEXT (t
);
5855 context
= tsubst_aggr_type (context
, args
, complain
,
5856 in_decl
, /*entering_scope=*/1);
5858 /* Then, figure out what arguments are appropriate for the
5859 type we are trying to find. For example, given:
5861 template <class T> struct S;
5862 template <class T, class U> void f(T, U) { S<U> su; }
5864 and supposing that we are instantiating f<int, double>,
5865 then our ARGS will be {int, double}, but, when looking up
5866 S we only want {double}. */
5867 argvec
= tsubst_template_args (TYPE_TI_ARGS (t
), args
,
5869 if (argvec
== error_mark_node
)
5870 return error_mark_node
;
5872 r
= lookup_template_class (t
, argvec
, in_decl
, context
,
5873 entering_scope
, complain
);
5875 return cp_build_qualified_type_real (r
, TYPE_QUALS (t
), complain
);
5878 /* This is not a template type, so there's nothing to do. */
5882 return tsubst (t
, args
, complain
, in_decl
);
5886 /* Substitute into the default argument ARG (a default argument for
5887 FN), which has the indicated TYPE. */
5890 tsubst_default_argument (tree fn
, tree type
, tree arg
)
5892 /* This default argument came from a template. Instantiate the
5893 default argument here, not in tsubst. In the case of
5902 we must be careful to do name lookup in the scope of S<T>,
5903 rather than in the current class. */
5904 push_access_scope (fn
);
5905 /* The default argument expression should not be considered to be
5906 within the scope of FN. Since push_access_scope sets
5907 current_function_decl, we must explicitly clear it here. */
5908 current_function_decl
= NULL_TREE
;
5910 push_deferring_access_checks(dk_no_deferred
);
5911 arg
= tsubst_expr (arg
, DECL_TI_ARGS (fn
),
5912 tf_error
| tf_warning
, NULL_TREE
);
5913 pop_deferring_access_checks();
5915 pop_access_scope (fn
);
5917 /* Make sure the default argument is reasonable. */
5918 arg
= check_default_argument (type
, arg
);
5923 /* Substitute into all the default arguments for FN. */
5926 tsubst_default_arguments (tree fn
)
5931 tmpl_args
= DECL_TI_ARGS (fn
);
5933 /* If this function is not yet instantiated, we certainly don't need
5934 its default arguments. */
5935 if (uses_template_parms (tmpl_args
))
5938 for (arg
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
5940 arg
= TREE_CHAIN (arg
))
5941 if (TREE_PURPOSE (arg
))
5942 TREE_PURPOSE (arg
) = tsubst_default_argument (fn
,
5944 TREE_PURPOSE (arg
));
5947 /* Substitute the ARGS into the T, which is a _DECL. TYPE is the
5948 (already computed) substitution of ARGS into TREE_TYPE (T), if
5949 appropriate. Return the result of the substitution. Issue error
5950 and warning messages under control of COMPLAIN. */
5953 tsubst_decl (tree t
, tree args
, tree type
, tsubst_flags_t complain
)
5955 location_t saved_loc
;
5959 /* Set the filename and linenumber to improve error-reporting. */
5960 saved_loc
= input_location
;
5961 input_location
= DECL_SOURCE_LOCATION (t
);
5963 switch (TREE_CODE (t
))
5967 /* We can get here when processing a member template function
5968 of a template class. */
5969 tree decl
= DECL_TEMPLATE_RESULT (t
);
5971 int is_template_template_parm
= DECL_TEMPLATE_TEMPLATE_PARM_P (t
);
5973 if (!is_template_template_parm
)
5975 /* We might already have an instance of this template.
5976 The ARGS are for the surrounding class type, so the
5977 full args contain the tsubst'd args for the context,
5978 plus the innermost args from the template decl. */
5979 tree tmpl_args
= DECL_CLASS_TEMPLATE_P (t
)
5980 ? CLASSTYPE_TI_ARGS (TREE_TYPE (t
))
5981 : DECL_TI_ARGS (DECL_TEMPLATE_RESULT (t
));
5984 full_args
= tsubst_template_args (tmpl_args
, args
,
5987 /* tsubst_template_args doesn't copy the vector if
5988 nothing changed. But, *something* should have
5990 my_friendly_assert (full_args
!= tmpl_args
, 0);
5992 spec
= retrieve_specialization (t
, full_args
);
5993 if (spec
!= NULL_TREE
)
6000 /* Make a new template decl. It will be similar to the
6001 original, but will record the current template arguments.
6002 We also create a new function declaration, which is just
6003 like the old one, but points to this new template, rather
6004 than the old one. */
6006 my_friendly_assert (DECL_LANG_SPECIFIC (r
) != 0, 0);
6007 TREE_CHAIN (r
) = NULL_TREE
;
6009 if (is_template_template_parm
)
6011 tree new_decl
= tsubst (decl
, args
, complain
, in_decl
);
6012 DECL_TEMPLATE_RESULT (r
) = new_decl
;
6013 TREE_TYPE (r
) = TREE_TYPE (new_decl
);
6018 = tsubst_aggr_type (DECL_CONTEXT (t
), args
,
6020 /*entering_scope=*/1);
6021 DECL_TEMPLATE_INFO (r
) = build_tree_list (t
, args
);
6023 if (TREE_CODE (decl
) == TYPE_DECL
)
6025 tree new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
6026 if (new_type
== error_mark_node
)
6027 return error_mark_node
;
6029 TREE_TYPE (r
) = new_type
;
6030 CLASSTYPE_TI_TEMPLATE (new_type
) = r
;
6031 DECL_TEMPLATE_RESULT (r
) = TYPE_MAIN_DECL (new_type
);
6032 DECL_TI_ARGS (r
) = CLASSTYPE_TI_ARGS (new_type
);
6036 tree new_decl
= tsubst (decl
, args
, complain
, in_decl
);
6037 if (new_decl
== error_mark_node
)
6038 return error_mark_node
;
6040 DECL_TEMPLATE_RESULT (r
) = new_decl
;
6041 DECL_TI_TEMPLATE (new_decl
) = r
;
6042 TREE_TYPE (r
) = TREE_TYPE (new_decl
);
6043 DECL_TI_ARGS (r
) = DECL_TI_ARGS (new_decl
);
6046 SET_DECL_IMPLICIT_INSTANTIATION (r
);
6047 DECL_TEMPLATE_INSTANTIATIONS (r
) = NULL_TREE
;
6048 DECL_TEMPLATE_SPECIALIZATIONS (r
) = NULL_TREE
;
6050 /* The template parameters for this new template are all the
6051 template parameters for the old template, except the
6052 outermost level of parameters. */
6053 DECL_TEMPLATE_PARMS (r
)
6054 = tsubst_template_parms (DECL_TEMPLATE_PARMS (t
), args
,
6057 if (PRIMARY_TEMPLATE_P (t
))
6058 DECL_PRIMARY_TEMPLATE (r
) = r
;
6060 if (TREE_CODE (decl
) != TYPE_DECL
)
6061 /* Record this non-type partial instantiation. */
6062 register_specialization (r
, t
,
6063 DECL_TI_ARGS (DECL_TEMPLATE_RESULT (r
)));
6070 tree argvec
= NULL_TREE
;
6077 /* Nobody should be tsubst'ing into non-template functions. */
6078 my_friendly_assert (DECL_TEMPLATE_INFO (t
) != NULL_TREE
, 0);
6080 if (TREE_CODE (DECL_TI_TEMPLATE (t
)) == TEMPLATE_DECL
)
6085 /* If T is not dependent, just return it. We have to
6086 increment PROCESSING_TEMPLATE_DECL because
6087 value_dependent_expression_p assumes that nothing is
6088 dependent when PROCESSING_TEMPLATE_DECL is zero. */
6089 ++processing_template_decl
;
6090 dependent_p
= value_dependent_expression_p (t
);
6091 --processing_template_decl
;
6095 /* Calculate the most general template of which R is a
6096 specialization, and the complete set of arguments used to
6098 gen_tmpl
= most_general_template (DECL_TI_TEMPLATE (t
));
6099 argvec
= tsubst_template_args (DECL_TI_ARGS
6100 (DECL_TEMPLATE_RESULT (gen_tmpl
)),
6101 args
, complain
, in_decl
);
6103 /* Check to see if we already have this specialization. */
6104 spec
= retrieve_specialization (gen_tmpl
, argvec
);
6112 /* We can see more levels of arguments than parameters if
6113 there was a specialization of a member template, like
6116 template <class T> struct S { template <class U> void f(); }
6117 template <> template <class U> void S<int>::f(U);
6119 Here, we'll be substituting into the specialization,
6120 because that's where we can find the code we actually
6121 want to generate, but we'll have enough arguments for
6122 the most general template.
6124 We also deal with the peculiar case:
6126 template <class T> struct S {
6127 template <class U> friend void f();
6129 template <class U> void f() {}
6131 template void f<double>();
6133 Here, the ARGS for the instantiation of will be {int,
6134 double}. But, we only need as many ARGS as there are
6135 levels of template parameters in CODE_PATTERN. We are
6136 careful not to get fooled into reducing the ARGS in
6139 template <class T> struct S { template <class U> void f(U); }
6140 template <class T> template <> void S<T>::f(int) {}
6142 which we can spot because the pattern will be a
6143 specialization in this case. */
6144 args_depth
= TMPL_ARGS_DEPTH (args
);
6146 TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (DECL_TI_TEMPLATE (t
)));
6147 if (args_depth
> parms_depth
6148 && !DECL_TEMPLATE_SPECIALIZATION (t
))
6149 args
= get_innermost_template_args (args
, parms_depth
);
6153 /* This special case arises when we have something like this:
6155 template <class T> struct S {
6156 friend void f<int>(int, double);
6159 Here, the DECL_TI_TEMPLATE for the friend declaration
6160 will be an IDENTIFIER_NODE. We are being called from
6161 tsubst_friend_function, and we want only to create a
6162 new decl (R) with appropriate types so that we can call
6163 determine_specialization. */
6164 gen_tmpl
= NULL_TREE
;
6167 if (DECL_CLASS_SCOPE_P (t
))
6169 if (DECL_NAME (t
) == constructor_name (DECL_CONTEXT (t
)))
6173 ctx
= tsubst_aggr_type (DECL_CONTEXT (t
), args
,
6174 complain
, t
, /*entering_scope=*/1);
6179 ctx
= DECL_CONTEXT (t
);
6181 type
= tsubst (type
, args
, complain
, in_decl
);
6182 if (type
== error_mark_node
)
6183 return error_mark_node
;
6185 /* We do NOT check for matching decls pushed separately at this
6186 point, as they may not represent instantiations of this
6187 template, and in any case are considered separate under the
6190 DECL_USE_TEMPLATE (r
) = 0;
6191 TREE_TYPE (r
) = type
;
6192 /* Clear out the mangled name and RTL for the instantiation. */
6193 SET_DECL_ASSEMBLER_NAME (r
, NULL_TREE
);
6194 SET_DECL_RTL (r
, NULL_RTX
);
6195 DECL_INITIAL (r
) = NULL_TREE
;
6196 DECL_CONTEXT (r
) = ctx
;
6198 if (member
&& DECL_CONV_FN_P (r
))
6199 /* Type-conversion operator. Reconstruct the name, in
6200 case it's the name of one of the template's parameters. */
6201 DECL_NAME (r
) = mangle_conv_op_name_for_type (TREE_TYPE (type
));
6203 DECL_ARGUMENTS (r
) = tsubst (DECL_ARGUMENTS (t
), args
,
6205 DECL_RESULT (r
) = NULL_TREE
;
6207 TREE_STATIC (r
) = 0;
6208 TREE_PUBLIC (r
) = TREE_PUBLIC (t
);
6209 DECL_EXTERNAL (r
) = 1;
6210 DECL_INTERFACE_KNOWN (r
) = 0;
6211 DECL_DEFER_OUTPUT (r
) = 0;
6212 TREE_CHAIN (r
) = NULL_TREE
;
6213 DECL_PENDING_INLINE_INFO (r
) = 0;
6214 DECL_PENDING_INLINE_P (r
) = 0;
6215 DECL_SAVED_TREE (r
) = NULL_TREE
;
6217 if (DECL_CLONED_FUNCTION (r
))
6219 DECL_CLONED_FUNCTION (r
) = tsubst (DECL_CLONED_FUNCTION (t
),
6221 TREE_CHAIN (r
) = TREE_CHAIN (DECL_CLONED_FUNCTION (r
));
6222 TREE_CHAIN (DECL_CLONED_FUNCTION (r
)) = r
;
6225 /* Set up the DECL_TEMPLATE_INFO for R. There's no need to do
6226 this in the special friend case mentioned above where
6227 GEN_TMPL is NULL. */
6230 DECL_TEMPLATE_INFO (r
)
6231 = tree_cons (gen_tmpl
, argvec
, NULL_TREE
);
6232 SET_DECL_IMPLICIT_INSTANTIATION (r
);
6233 register_specialization (r
, gen_tmpl
, argvec
);
6235 /* We're not supposed to instantiate default arguments
6236 until they are called, for a template. But, for a
6239 template <class T> void f ()
6240 { extern void g(int i = T()); }
6242 we should do the substitution when the template is
6243 instantiated. We handle the member function case in
6244 instantiate_class_template since the default arguments
6245 might refer to other members of the class. */
6247 && !PRIMARY_TEMPLATE_P (gen_tmpl
)
6248 && !uses_template_parms (argvec
))
6249 tsubst_default_arguments (r
);
6252 /* Copy the list of befriending classes. */
6253 for (friends
= &DECL_BEFRIENDING_CLASSES (r
);
6255 friends
= &TREE_CHAIN (*friends
))
6257 *friends
= copy_node (*friends
);
6258 TREE_VALUE (*friends
) = tsubst (TREE_VALUE (*friends
),
6263 if (DECL_CONSTRUCTOR_P (r
) || DECL_DESTRUCTOR_P (r
))
6265 maybe_retrofit_in_chrg (r
);
6266 if (DECL_CONSTRUCTOR_P (r
))
6267 grok_ctor_properties (ctx
, r
);
6268 /* If this is an instantiation of a member template, clone it.
6269 If it isn't, that'll be handled by
6270 clone_constructors_and_destructors. */
6271 if (PRIMARY_TEMPLATE_P (gen_tmpl
))
6272 clone_function_decl (r
, /*update_method_vec_p=*/0);
6274 else if (IDENTIFIER_OPNAME_P (DECL_NAME (r
)))
6275 grok_op_properties (r
, DECL_FRIEND_P (r
),
6276 (complain
& tf_error
) != 0);
6278 if (DECL_FRIEND_P (t
) && DECL_FRIEND_CONTEXT (t
))
6279 SET_DECL_FRIEND_CONTEXT (r
,
6280 tsubst (DECL_FRIEND_CONTEXT (t
),
6281 args
, complain
, in_decl
));
6288 if (DECL_TEMPLATE_PARM_P (t
))
6289 SET_DECL_TEMPLATE_PARM_P (r
);
6291 TREE_TYPE (r
) = type
;
6292 c_apply_type_quals_to_decl (cp_type_quals (type
), r
);
6294 if (DECL_INITIAL (r
))
6296 if (TREE_CODE (DECL_INITIAL (r
)) != TEMPLATE_PARM_INDEX
)
6297 DECL_INITIAL (r
) = TREE_TYPE (r
);
6299 DECL_INITIAL (r
) = tsubst (DECL_INITIAL (r
), args
,
6303 DECL_CONTEXT (r
) = NULL_TREE
;
6305 if (!DECL_TEMPLATE_PARM_P (r
))
6306 DECL_ARG_TYPE (r
) = type_passed_as (type
);
6308 TREE_CHAIN (r
) = tsubst (TREE_CHAIN (t
), args
,
6309 complain
, TREE_CHAIN (t
));
6316 TREE_TYPE (r
) = type
;
6317 c_apply_type_quals_to_decl (cp_type_quals (type
), r
);
6319 /* We don't have to set DECL_CONTEXT here; it is set by
6320 finish_member_declaration. */
6321 DECL_INITIAL (r
) = tsubst_expr (DECL_INITIAL (t
), args
,
6323 TREE_CHAIN (r
) = NULL_TREE
;
6324 if (VOID_TYPE_P (type
))
6325 cp_error_at ("instantiation of `%D' as type `%T'", r
, type
);
6332 /* It is not a dependent using decl any more. */
6333 TREE_TYPE (r
) = void_type_node
;
6335 = tsubst_copy (DECL_INITIAL (t
), args
, complain
, in_decl
);
6337 = tsubst_copy (DECL_NAME (t
), args
, complain
, in_decl
);
6338 TREE_CHAIN (r
) = NULL_TREE
;
6343 if (TREE_CODE (type
) == TEMPLATE_TEMPLATE_PARM
6344 || t
== TYPE_MAIN_DECL (TREE_TYPE (t
)))
6346 /* If this is the canonical decl, we don't have to mess with
6347 instantiations, and often we can't (for typename, template
6348 type parms and such). Note that TYPE_NAME is not correct for
6349 the above test if we've copied the type for a typedef. */
6350 r
= TYPE_NAME (type
);
6358 tree argvec
= NULL_TREE
;
6359 tree gen_tmpl
= NULL_TREE
;
6361 tree tmpl
= NULL_TREE
;
6365 /* Assume this is a non-local variable. */
6368 if (TYPE_P (CP_DECL_CONTEXT (t
)))
6369 ctx
= tsubst_aggr_type (DECL_CONTEXT (t
), args
,
6371 in_decl
, /*entering_scope=*/1);
6372 else if (DECL_NAMESPACE_SCOPE_P (t
))
6373 ctx
= DECL_CONTEXT (t
);
6376 /* Subsequent calls to pushdecl will fill this in. */
6381 /* Check to see if we already have this specialization. */
6384 tmpl
= DECL_TI_TEMPLATE (t
);
6385 gen_tmpl
= most_general_template (tmpl
);
6386 argvec
= tsubst (DECL_TI_ARGS (t
), args
, complain
, in_decl
);
6387 spec
= retrieve_specialization (gen_tmpl
, argvec
);
6390 spec
= retrieve_local_specialization (t
);
6399 if (TREE_CODE (r
) == VAR_DECL
)
6401 type
= complete_type (type
);
6402 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (r
)
6403 = DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (t
);
6405 else if (DECL_SELF_REFERENCE_P (t
))
6406 SET_DECL_SELF_REFERENCE_P (r
);
6407 TREE_TYPE (r
) = type
;
6408 c_apply_type_quals_to_decl (cp_type_quals (type
), r
);
6409 DECL_CONTEXT (r
) = ctx
;
6410 /* Clear out the mangled name and RTL for the instantiation. */
6411 SET_DECL_ASSEMBLER_NAME (r
, NULL_TREE
);
6412 SET_DECL_RTL (r
, NULL_RTX
);
6414 /* Don't try to expand the initializer until someone tries to use
6415 this variable; otherwise we run into circular dependencies. */
6416 DECL_INITIAL (r
) = NULL_TREE
;
6417 SET_DECL_RTL (r
, NULL_RTX
);
6418 DECL_SIZE (r
) = DECL_SIZE_UNIT (r
) = 0;
6420 /* Even if the original location is out of scope, the newly
6421 substituted one is not. */
6422 if (TREE_CODE (r
) == VAR_DECL
)
6424 DECL_DEAD_FOR_LOCAL (r
) = 0;
6425 DECL_INITIALIZED_P (r
) = 0;
6430 /* A static data member declaration is always marked
6431 external when it is declared in-class, even if an
6432 initializer is present. We mimic the non-template
6434 DECL_EXTERNAL (r
) = 1;
6436 register_specialization (r
, gen_tmpl
, argvec
);
6437 DECL_TEMPLATE_INFO (r
) = tree_cons (tmpl
, argvec
, NULL_TREE
);
6438 SET_DECL_IMPLICIT_INSTANTIATION (r
);
6441 register_local_specialization (r
, t
);
6443 TREE_CHAIN (r
) = NULL_TREE
;
6444 if (TREE_CODE (r
) == VAR_DECL
&& VOID_TYPE_P (type
))
6445 cp_error_at ("instantiation of `%D' as type `%T'", r
, type
);
6446 /* Compute the size, alignment, etc. of R. */
6455 /* Restore the file and line information. */
6456 input_location
= saved_loc
;
6461 /* Substitute into the ARG_TYPES of a function type. */
6464 tsubst_arg_types (tree arg_types
,
6466 tsubst_flags_t complain
,
6469 tree remaining_arg_types
;
6472 if (!arg_types
|| arg_types
== void_list_node
)
6475 remaining_arg_types
= tsubst_arg_types (TREE_CHAIN (arg_types
),
6476 args
, complain
, in_decl
);
6477 if (remaining_arg_types
== error_mark_node
)
6478 return error_mark_node
;
6480 type
= tsubst (TREE_VALUE (arg_types
), args
, complain
, in_decl
);
6481 if (type
== error_mark_node
)
6482 return error_mark_node
;
6483 if (VOID_TYPE_P (type
))
6485 if (complain
& tf_error
)
6487 error ("invalid parameter type `%T'", type
);
6489 cp_error_at ("in declaration `%D'", in_decl
);
6491 return error_mark_node
;
6494 /* Do array-to-pointer, function-to-pointer conversion, and ignore
6495 top-level qualifiers as required. */
6496 type
= TYPE_MAIN_VARIANT (type_decays_to (type
));
6498 /* Note that we do not substitute into default arguments here. The
6499 standard mandates that they be instantiated only when needed,
6500 which is done in build_over_call. */
6501 return hash_tree_cons (TREE_PURPOSE (arg_types
), type
,
6502 remaining_arg_types
);
6506 /* Substitute into a FUNCTION_TYPE or METHOD_TYPE. This routine does
6507 *not* handle the exception-specification for FNTYPE, because the
6508 initial substitution of explicitly provided template parameters
6509 during argument deduction forbids substitution into the
6510 exception-specification:
6514 All references in the function type of the function template to the
6515 corresponding template parameters are replaced by the specified tem-
6516 plate argument values. If a substitution in a template parameter or
6517 in the function type of the function template results in an invalid
6518 type, type deduction fails. [Note: The equivalent substitution in
6519 exception specifications is done only when the function is instanti-
6520 ated, at which point a program is ill-formed if the substitution
6521 results in an invalid type.] */
6524 tsubst_function_type (tree t
,
6526 tsubst_flags_t complain
,
6533 /* The TYPE_CONTEXT is not used for function/method types. */
6534 my_friendly_assert (TYPE_CONTEXT (t
) == NULL_TREE
, 0);
6536 /* Substitute the return type. */
6537 return_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
6538 if (return_type
== error_mark_node
)
6539 return error_mark_node
;
6541 /* Substitute the argument types. */
6542 arg_types
= tsubst_arg_types (TYPE_ARG_TYPES (t
), args
,
6544 if (arg_types
== error_mark_node
)
6545 return error_mark_node
;
6547 /* Construct a new type node and return it. */
6548 if (TREE_CODE (t
) == FUNCTION_TYPE
)
6549 fntype
= build_function_type (return_type
, arg_types
);
6552 tree r
= TREE_TYPE (TREE_VALUE (arg_types
));
6553 if (! IS_AGGR_TYPE (r
))
6557 Type deduction may fail for any of the following
6560 -- Attempting to create "pointer to member of T" when T
6561 is not a class type. */
6562 if (complain
& tf_error
)
6563 error ("creating pointer to member function of non-class type `%T'",
6565 return error_mark_node
;
6568 fntype
= build_method_type_directly (r
, return_type
,
6569 TREE_CHAIN (arg_types
));
6571 fntype
= cp_build_qualified_type_real (fntype
, TYPE_QUALS (t
), complain
);
6572 fntype
= cp_build_type_attribute_variant (fntype
, TYPE_ATTRIBUTES (t
));
6577 /* Substitute into the PARMS of a call-declarator. */
6580 tsubst_call_declarator_parms (tree parms
,
6582 tsubst_flags_t complain
,
6589 if (!parms
|| parms
== void_list_node
)
6592 new_parms
= tsubst_call_declarator_parms (TREE_CHAIN (parms
),
6593 args
, complain
, in_decl
);
6595 /* Figure out the type of this parameter. */
6596 type
= tsubst (TREE_VALUE (parms
), args
, complain
, in_decl
);
6598 /* Figure out the default argument as well. Note that we use
6599 tsubst_expr since the default argument is really an expression. */
6600 defarg
= tsubst_expr (TREE_PURPOSE (parms
), args
, complain
, in_decl
);
6602 /* Chain this parameter on to the front of those we have already
6603 processed. We don't use hash_tree_cons because that function
6604 doesn't check TREE_PARMLIST. */
6605 new_parms
= tree_cons (defarg
, type
, new_parms
);
6610 /* Take the tree structure T and replace template parameters used
6611 therein with the argument vector ARGS. IN_DECL is an associated
6612 decl for diagnostics. If an error occurs, returns ERROR_MARK_NODE.
6613 Issue error and warning messages under control of COMPLAIN. Note
6614 that we must be relatively non-tolerant of extensions here, in
6615 order to preserve conformance; if we allow substitutions that
6616 should not be allowed, we may allow argument deductions that should
6617 not succeed, and therefore report ambiguous overload situations
6618 where there are none. In theory, we could allow the substitution,
6619 but indicate that it should have failed, and allow our caller to
6620 make sure that the right thing happens, but we don't try to do this
6623 This function is used for dealing with types, decls and the like;
6624 for expressions, use tsubst_expr or tsubst_copy. */
6627 tsubst (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
6631 if (t
== NULL_TREE
|| t
== error_mark_node
6632 || t
== integer_type_node
6633 || t
== void_type_node
6634 || t
== char_type_node
6635 || TREE_CODE (t
) == NAMESPACE_DECL
)
6638 if (TREE_CODE (t
) == IDENTIFIER_NODE
)
6639 type
= IDENTIFIER_TYPE_VALUE (t
);
6641 type
= TREE_TYPE (t
);
6643 my_friendly_assert (type
!= unknown_type_node
, 20030716);
6645 if (type
&& TREE_CODE (t
) != FUNCTION_DECL
6646 && TREE_CODE (t
) != TYPENAME_TYPE
6647 && TREE_CODE (t
) != TEMPLATE_DECL
6648 && TREE_CODE (t
) != IDENTIFIER_NODE
6649 && TREE_CODE (t
) != FUNCTION_TYPE
6650 && TREE_CODE (t
) != METHOD_TYPE
)
6651 type
= tsubst (type
, args
, complain
, in_decl
);
6652 if (type
== error_mark_node
)
6653 return error_mark_node
;
6656 return tsubst_decl (t
, args
, type
, complain
);
6658 switch (TREE_CODE (t
))
6663 return tsubst_aggr_type (t
, args
, complain
, in_decl
,
6664 /*entering_scope=*/0);
6667 case IDENTIFIER_NODE
:
6679 if (t
== integer_type_node
)
6682 if (TREE_CODE (TYPE_MIN_VALUE (t
)) == INTEGER_CST
6683 && TREE_CODE (TYPE_MAX_VALUE (t
)) == INTEGER_CST
)
6687 tree max
, omax
= TREE_OPERAND (TYPE_MAX_VALUE (t
), 0);
6689 /* The array dimension behaves like a non-type template arg,
6690 in that we want to fold it as much as possible. */
6691 max
= tsubst_template_arg (omax
, args
, complain
, in_decl
);
6692 if (!processing_template_decl
)
6693 max
= decl_constant_value (max
);
6695 if (integer_zerop (omax
))
6697 /* Still allow an explicit array of size zero. */
6699 pedwarn ("creating array with size zero");
6701 else if (integer_zerop (max
)
6702 || (TREE_CODE (max
) == INTEGER_CST
6703 && INT_CST_LT (max
, integer_zero_node
)))
6707 Type deduction may fail for any of the following
6710 Attempting to create an array with a size that is
6711 zero or negative. */
6712 if (complain
& tf_error
)
6713 error ("creating array with size zero (`%E')", max
);
6715 return error_mark_node
;
6718 return compute_array_index_type (NULL_TREE
, max
);
6721 case TEMPLATE_TYPE_PARM
:
6722 case TEMPLATE_TEMPLATE_PARM
:
6723 case BOUND_TEMPLATE_TEMPLATE_PARM
:
6724 case TEMPLATE_PARM_INDEX
:
6732 if (TREE_CODE (t
) == TEMPLATE_TYPE_PARM
6733 || TREE_CODE (t
) == TEMPLATE_TEMPLATE_PARM
6734 || TREE_CODE (t
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
6736 idx
= TEMPLATE_TYPE_IDX (t
);
6737 level
= TEMPLATE_TYPE_LEVEL (t
);
6741 idx
= TEMPLATE_PARM_IDX (t
);
6742 level
= TEMPLATE_PARM_LEVEL (t
);
6745 if (TREE_VEC_LENGTH (args
) > 0)
6747 tree arg
= NULL_TREE
;
6749 levels
= TMPL_ARGS_DEPTH (args
);
6750 if (level
<= levels
)
6751 arg
= TMPL_ARG (args
, level
, idx
);
6753 if (arg
== error_mark_node
)
6754 return error_mark_node
;
6755 else if (arg
!= NULL_TREE
)
6757 if (TREE_CODE (t
) == TEMPLATE_TYPE_PARM
)
6759 my_friendly_assert (TYPE_P (arg
), 0);
6760 return cp_build_qualified_type_real
6761 (arg
, cp_type_quals (arg
) | cp_type_quals (t
),
6762 complain
| tf_ignore_bad_quals
);
6764 else if (TREE_CODE (t
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
6766 /* We are processing a type constructed from
6767 a template template parameter. */
6768 tree argvec
= tsubst (TYPE_TI_ARGS (t
),
6769 args
, complain
, in_decl
);
6770 if (argvec
== error_mark_node
)
6771 return error_mark_node
;
6773 /* We can get a TEMPLATE_TEMPLATE_PARM here when
6774 we are resolving nested-types in the signature of
6775 a member function templates.
6776 Otherwise ARG is a TEMPLATE_DECL and is the real
6777 template to be instantiated. */
6778 if (TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
)
6779 arg
= TYPE_NAME (arg
);
6781 r
= lookup_template_class (arg
,
6784 /*entering_scope=*/0,
6786 return cp_build_qualified_type_real
6787 (r
, TYPE_QUALS (t
), complain
);
6790 /* TEMPLATE_TEMPLATE_PARM or TEMPLATE_PARM_INDEX. */
6798 /* This can happen during the attempted tsubst'ing in
6799 unify. This means that we don't yet have any information
6800 about the template parameter in question. */
6803 /* If we get here, we must have been looking at a parm for a
6804 more deeply nested template. Make a new version of this
6805 template parameter, but with a lower level. */
6806 switch (TREE_CODE (t
))
6808 case TEMPLATE_TYPE_PARM
:
6809 case TEMPLATE_TEMPLATE_PARM
:
6810 case BOUND_TEMPLATE_TEMPLATE_PARM
:
6811 if (cp_type_quals (t
))
6813 r
= tsubst (TYPE_MAIN_VARIANT (t
), args
, complain
, in_decl
);
6814 r
= cp_build_qualified_type_real
6815 (r
, cp_type_quals (t
),
6816 complain
| (TREE_CODE (t
) == TEMPLATE_TYPE_PARM
6817 ? tf_ignore_bad_quals
: 0));
6822 TEMPLATE_TYPE_PARM_INDEX (r
)
6823 = reduce_template_parm_level (TEMPLATE_TYPE_PARM_INDEX (t
),
6825 TYPE_STUB_DECL (r
) = TYPE_NAME (r
) = TEMPLATE_TYPE_DECL (r
);
6826 TYPE_MAIN_VARIANT (r
) = r
;
6827 TYPE_POINTER_TO (r
) = NULL_TREE
;
6828 TYPE_REFERENCE_TO (r
) = NULL_TREE
;
6830 if (TREE_CODE (t
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
6832 tree argvec
= tsubst (TYPE_TI_ARGS (t
), args
,
6834 if (argvec
== error_mark_node
)
6835 return error_mark_node
;
6837 TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (r
)
6838 = tree_cons (TYPE_TI_TEMPLATE (t
), argvec
, NULL_TREE
);
6843 case TEMPLATE_PARM_INDEX
:
6844 r
= reduce_template_parm_level (t
, type
, levels
);
6856 tree purpose
, value
, chain
;
6858 if (t
== void_list_node
)
6861 purpose
= TREE_PURPOSE (t
);
6864 purpose
= tsubst (purpose
, args
, complain
, in_decl
);
6865 if (purpose
== error_mark_node
)
6866 return error_mark_node
;
6868 value
= TREE_VALUE (t
);
6871 value
= tsubst (value
, args
, complain
, in_decl
);
6872 if (value
== error_mark_node
)
6873 return error_mark_node
;
6875 chain
= TREE_CHAIN (t
);
6876 if (chain
&& chain
!= void_type_node
)
6878 chain
= tsubst (chain
, args
, complain
, in_decl
);
6879 if (chain
== error_mark_node
)
6880 return error_mark_node
;
6882 if (purpose
== TREE_PURPOSE (t
)
6883 && value
== TREE_VALUE (t
)
6884 && chain
== TREE_CHAIN (t
))
6886 return hash_tree_cons (purpose
, value
, chain
);
6890 /* A binfo node. We always need to make a copy, of the node
6891 itself and of its BINFO_BASE_BINFOS. */
6892 my_friendly_assert (type
, 20040628);
6896 /* Make sure type isn't a typedef copy. */
6897 type
= BINFO_TYPE (TYPE_BINFO (type
));
6899 TREE_TYPE (t
) = complete_type (type
);
6900 if (IS_AGGR_TYPE (type
))
6902 BINFO_VTABLE (t
) = BINFO_VTABLE (TYPE_BINFO (type
));
6903 BINFO_VIRTUALS (t
) = BINFO_VIRTUALS (TYPE_BINFO (type
));
6904 if (BINFO_BASE_BINFOS (TYPE_BINFO (type
)) != NULL_TREE
)
6905 BINFO_BASE_BINFOS (t
)
6906 = copy_node (BINFO_BASE_BINFOS (TYPE_BINFO (type
)));
6911 /* A vector of template arguments. */
6912 my_friendly_assert (!type
, 20040628);
6913 return tsubst_template_args (t
, args
, complain
, in_decl
);
6916 case REFERENCE_TYPE
:
6918 enum tree_code code
;
6920 if (type
== TREE_TYPE (t
) && TREE_CODE (type
) != METHOD_TYPE
)
6923 code
= TREE_CODE (t
);
6928 Type deduction may fail for any of the following
6931 -- Attempting to create a pointer to reference type.
6932 -- Attempting to create a reference to a reference type or
6933 a reference to void. */
6934 if (TREE_CODE (type
) == REFERENCE_TYPE
6935 || (code
== REFERENCE_TYPE
&& TREE_CODE (type
) == VOID_TYPE
))
6937 static location_t last_loc
;
6939 /* We keep track of the last time we issued this error
6940 message to avoid spewing a ton of messages during a
6941 single bad template instantiation. */
6942 if (complain
& tf_error
6943 #ifdef USE_MAPPED_LOCATION
6944 && last_loc
!= input_location
)
6946 && (last_loc
.line
!= input_line
6947 || last_loc
.file
!= input_filename
))
6950 if (TREE_CODE (type
) == VOID_TYPE
)
6951 error ("forming reference to void");
6953 error ("forming %s to reference type `%T'",
6954 (code
== POINTER_TYPE
) ? "pointer" : "reference",
6956 last_loc
= input_location
;
6959 return error_mark_node
;
6961 else if (code
== POINTER_TYPE
)
6963 r
= build_pointer_type (type
);
6964 if (TREE_CODE (type
) == METHOD_TYPE
)
6965 r
= build_ptrmemfunc_type (r
);
6968 r
= build_reference_type (type
);
6969 r
= cp_build_qualified_type_real (r
, TYPE_QUALS (t
), complain
);
6971 if (r
!= error_mark_node
)
6972 /* Will this ever be needed for TYPE_..._TO values? */
6979 r
= tsubst (TYPE_OFFSET_BASETYPE (t
), args
, complain
, in_decl
);
6980 if (r
== error_mark_node
|| !IS_AGGR_TYPE (r
))
6984 Type deduction may fail for any of the following
6987 -- Attempting to create "pointer to member of T" when T
6988 is not a class type. */
6989 if (complain
& tf_error
)
6990 error ("creating pointer to member of non-class type `%T'", r
);
6991 return error_mark_node
;
6993 if (TREE_CODE (type
) == REFERENCE_TYPE
)
6995 if (complain
& tf_error
)
6996 error ("creating pointer to member reference type `%T'", type
);
6998 return error_mark_node
;
7000 my_friendly_assert (TREE_CODE (type
) != METHOD_TYPE
, 20011231);
7001 if (TREE_CODE (type
) == FUNCTION_TYPE
)
7003 /* This is really a method type. The cv qualifiers of the
7004 this pointer should _not_ be determined by the cv
7005 qualifiers of the class type. They should be held
7006 somewhere in the FUNCTION_TYPE, but we don't do that at
7007 the moment. Consider
7008 typedef void (Func) () const;
7010 template <typename T1> void Foo (Func T1::*);
7015 method_type
= build_method_type_directly (TYPE_MAIN_VARIANT (r
),
7017 TYPE_ARG_TYPES (type
));
7018 return build_ptrmemfunc_type (build_pointer_type (method_type
));
7021 return cp_build_qualified_type_real (build_ptrmem_type (r
, type
),
7031 fntype
= tsubst_function_type (t
, args
, complain
, in_decl
);
7032 if (fntype
== error_mark_node
)
7033 return error_mark_node
;
7035 /* Substitute the exception specification. */
7036 raises
= TYPE_RAISES_EXCEPTIONS (t
);
7039 tree list
= NULL_TREE
;
7041 if (! TREE_VALUE (raises
))
7044 for (; raises
!= NULL_TREE
; raises
= TREE_CHAIN (raises
))
7046 tree spec
= TREE_VALUE (raises
);
7048 spec
= tsubst (spec
, args
, complain
, in_decl
);
7049 if (spec
== error_mark_node
)
7051 list
= add_exception_specifier (list
, spec
, complain
);
7053 fntype
= build_exception_variant (fntype
, list
);
7059 tree domain
= tsubst (TYPE_DOMAIN (t
), args
, complain
, in_decl
);
7060 if (domain
== error_mark_node
)
7061 return error_mark_node
;
7063 /* As an optimization, we avoid regenerating the array type if
7064 it will obviously be the same as T. */
7065 if (type
== TREE_TYPE (t
) && domain
== TYPE_DOMAIN (t
))
7068 /* These checks should match the ones in grokdeclarator.
7072 The deduction may fail for any of the following reasons:
7074 -- Attempting to create an array with an element type that
7075 is void, a function type, or a reference type, or [DR337]
7076 an abstract class type. */
7077 if (TREE_CODE (type
) == VOID_TYPE
7078 || TREE_CODE (type
) == FUNCTION_TYPE
7079 || TREE_CODE (type
) == REFERENCE_TYPE
)
7081 if (complain
& tf_error
)
7082 error ("creating array of `%T'", type
);
7083 return error_mark_node
;
7085 if (CLASS_TYPE_P (type
) && CLASSTYPE_PURE_VIRTUALS (type
))
7087 if (complain
& tf_error
)
7088 error ("creating array of `%T', which is an abstract class type",
7090 return error_mark_node
;
7093 r
= build_cplus_array_type (type
, domain
);
7100 tree e1
= tsubst (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
7101 tree e2
= tsubst (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
7103 if (e1
== error_mark_node
|| e2
== error_mark_node
)
7104 return error_mark_node
;
7106 return fold (build (TREE_CODE (t
), TREE_TYPE (t
), e1
, e2
));
7112 tree e
= tsubst (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
7113 if (e
== error_mark_node
)
7114 return error_mark_node
;
7116 return fold (build (TREE_CODE (t
), TREE_TYPE (t
), e
));
7121 tree ctx
= tsubst_aggr_type (TYPE_CONTEXT (t
), args
, complain
,
7122 in_decl
, /*entering_scope=*/1);
7123 tree f
= tsubst_copy (TYPENAME_TYPE_FULLNAME (t
), args
,
7126 if (ctx
== error_mark_node
|| f
== error_mark_node
)
7127 return error_mark_node
;
7129 if (!IS_AGGR_TYPE (ctx
))
7131 if (complain
& tf_error
)
7132 error ("`%T' is not a class, struct, or union type",
7134 return error_mark_node
;
7136 else if (!uses_template_parms (ctx
) && !TYPE_BEING_DEFINED (ctx
))
7138 /* Normally, make_typename_type does not require that the CTX
7139 have complete type in order to allow things like:
7141 template <class T> struct S { typename S<T>::X Y; };
7143 But, such constructs have already been resolved by this
7144 point, so here CTX really should have complete type, unless
7145 it's a partial instantiation. */
7146 ctx
= complete_type (ctx
);
7147 if (!COMPLETE_TYPE_P (ctx
))
7149 if (complain
& tf_error
)
7150 cxx_incomplete_type_error (NULL_TREE
, ctx
);
7151 return error_mark_node
;
7155 f
= make_typename_type (ctx
, f
,
7156 (complain
& tf_error
) | tf_keep_type_decl
);
7157 if (f
== error_mark_node
)
7159 if (TREE_CODE (f
) == TYPE_DECL
)
7161 complain
|= tf_ignore_bad_quals
;
7165 return cp_build_qualified_type_real
7166 (f
, cp_type_quals (f
) | cp_type_quals (t
), complain
);
7169 case UNBOUND_CLASS_TEMPLATE
:
7171 tree ctx
= tsubst_aggr_type (TYPE_CONTEXT (t
), args
, complain
,
7172 in_decl
, /*entering_scope=*/1);
7173 tree name
= TYPE_IDENTIFIER (t
);
7175 if (ctx
== error_mark_node
|| name
== error_mark_node
)
7176 return error_mark_node
;
7178 return make_unbound_class_template (ctx
, name
, complain
);
7188 tree e1
= tsubst (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
7189 tree e2
= tsubst_expr (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
7190 if (e1
== error_mark_node
|| e2
== error_mark_node
)
7191 return error_mark_node
;
7193 return build_nt (ARRAY_REF
, e1
, e2
, NULL_TREE
, NULL_TREE
);
7198 tree e1
= tsubst (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
7199 tree e2
= tsubst (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
7200 if (e1
== error_mark_node
|| e2
== error_mark_node
)
7201 return error_mark_node
;
7203 return build_nt (TREE_CODE (t
), e1
, e2
);
7210 type
= finish_typeof (tsubst_expr (TYPEOF_TYPE_EXPR (t
), args
,
7211 complain
, in_decl
));
7212 return cp_build_qualified_type_real (type
,
7214 | cp_type_quals (type
),
7219 sorry ("use of `%s' in template",
7220 tree_code_name
[(int) TREE_CODE (t
)]);
7221 return error_mark_node
;
7225 /* Like tsubst_expr for a BASELINK. OBJECT_TYPE, if non-NULL, is the
7226 type of the expression on the left-hand side of the "." or "->"
7230 tsubst_baselink (tree baselink
, tree object_type
,
7231 tree args
, tsubst_flags_t complain
, tree in_decl
)
7234 tree qualifying_scope
;
7236 tree template_args
= 0;
7237 bool template_id_p
= false;
7239 /* A baselink indicates a function from a base class. The
7240 BASELINK_ACCESS_BINFO and BASELINK_BINFO are going to have
7241 non-dependent types; otherwise, the lookup could not have
7242 succeeded. However, they may indicate bases of the template
7243 class, rather than the instantiated class.
7245 In addition, lookups that were not ambiguous before may be
7246 ambiguous now. Therefore, we perform the lookup again. */
7247 qualifying_scope
= BINFO_TYPE (BASELINK_ACCESS_BINFO (baselink
));
7248 fns
= BASELINK_FUNCTIONS (baselink
);
7249 if (TREE_CODE (fns
) == TEMPLATE_ID_EXPR
)
7251 template_id_p
= true;
7252 template_args
= TREE_OPERAND (fns
, 1);
7253 fns
= TREE_OPERAND (fns
, 0);
7255 template_args
= tsubst_template_args (template_args
, args
,
7258 name
= DECL_NAME (get_first_fn (fns
));
7259 baselink
= lookup_fnfields (qualifying_scope
, name
, /*protect=*/1);
7260 if (BASELINK_P (baselink
) && template_id_p
)
7261 BASELINK_FUNCTIONS (baselink
)
7262 = build_nt (TEMPLATE_ID_EXPR
,
7263 BASELINK_FUNCTIONS (baselink
),
7266 object_type
= current_class_type
;
7267 return adjust_result_of_qualified_name_lookup (baselink
,
7272 /* Like tsubst_expr for a SCOPE_REF, given by QUALIFIED_ID. DONE is
7273 true if the qualified-id will be a postfix-expression in-and-of
7274 itself; false if more of the postfix-expression follows the
7275 QUALIFIED_ID. ADDRESS_P is true if the qualified-id is the operand
7279 tsubst_qualified_id (tree qualified_id
, tree args
,
7280 tsubst_flags_t complain
, tree in_decl
,
7281 bool done
, bool address_p
)
7289 my_friendly_assert (TREE_CODE (qualified_id
) == SCOPE_REF
, 20030706);
7291 /* Figure out what name to look up. */
7292 name
= TREE_OPERAND (qualified_id
, 1);
7293 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
7296 template_args
= TREE_OPERAND (name
, 1);
7298 template_args
= tsubst_template_args (template_args
, args
,
7300 name
= TREE_OPERAND (name
, 0);
7304 is_template
= false;
7305 template_args
= NULL_TREE
;
7308 /* Substitute into the qualifying scope. When there are no ARGS, we
7309 are just trying to simplify a non-dependent expression. In that
7310 case the qualifying scope may be dependent, and, in any case,
7311 substituting will not help. */
7312 scope
= TREE_OPERAND (qualified_id
, 0);
7315 scope
= tsubst (scope
, args
, complain
, in_decl
);
7316 expr
= tsubst_copy (name
, args
, complain
, in_decl
);
7321 if (dependent_type_p (scope
))
7322 return build_nt (SCOPE_REF
, scope
, expr
);
7324 if (!BASELINK_P (name
) && !DECL_P (expr
))
7326 expr
= lookup_qualified_name (scope
, expr
, /*is_type_p=*/0, false);
7327 if (TREE_CODE (TREE_CODE (expr
) == TEMPLATE_DECL
7328 ? DECL_TEMPLATE_RESULT (expr
) : expr
) == TYPE_DECL
)
7330 if (complain
& tf_error
)
7332 error ("dependent-name `%E' is parsed as a non-type, but "
7333 "instantiation yields a type", qualified_id
);
7334 inform ("say `typename %E' if a type is meant", qualified_id
);
7336 return error_mark_node
;
7341 check_accessibility_of_qualified_id (expr
, /*object_type=*/NULL_TREE
,
7344 /* Remember that there was a reference to this entity. */
7349 expr
= lookup_template_function (expr
, template_args
);
7351 if (expr
== error_mark_node
&& complain
& tf_error
)
7352 qualified_name_lookup_error (scope
, TREE_OPERAND (qualified_id
, 1));
7353 else if (TYPE_P (scope
))
7355 expr
= (adjust_result_of_qualified_name_lookup
7356 (expr
, scope
, current_class_type
));
7357 expr
= finish_qualified_id_expr (scope
, expr
, done
, address_p
);
7363 /* Like tsubst, but deals with expressions. This function just replaces
7364 template parms; to finish processing the resultant expression, use
7368 tsubst_copy (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
7370 enum tree_code code
;
7373 if (t
== NULL_TREE
|| t
== error_mark_node
)
7376 code
= TREE_CODE (t
);
7381 r
= retrieve_local_specialization (t
);
7382 my_friendly_assert (r
!= NULL
, 20020903);
7391 if (DECL_TEMPLATE_PARM_P (t
))
7392 return tsubst_copy (DECL_INITIAL (t
), args
, complain
, in_decl
);
7393 /* There is no need to substitute into namespace-scope
7395 if (DECL_NAMESPACE_SCOPE_P (t
))
7397 /* If ARGS is NULL, then T is known to be non-dependent. */
7398 if (args
== NULL_TREE
)
7399 return decl_constant_value (t
);
7401 /* Unfortunately, we cannot just call lookup_name here.
7404 template <int I> int f() {
7406 struct S { void g() { E e = a; } };
7409 When we instantiate f<7>::S::g(), say, lookup_name is not
7410 clever enough to find f<7>::a. */
7412 = tsubst_aggr_type (TREE_TYPE (t
), args
, complain
, in_decl
,
7413 /*entering_scope=*/0);
7415 for (v
= TYPE_VALUES (enum_type
);
7418 if (TREE_PURPOSE (v
) == DECL_NAME (t
))
7419 return TREE_VALUE (v
);
7421 /* We didn't find the name. That should never happen; if
7422 name-lookup found it during preliminary parsing, we
7423 should find it again here during instantiation. */
7429 if (DECL_CONTEXT (t
))
7433 ctx
= tsubst_aggr_type (DECL_CONTEXT (t
), args
, complain
, in_decl
,
7434 /*entering_scope=*/1);
7435 if (ctx
!= DECL_CONTEXT (t
))
7436 return lookup_field (ctx
, DECL_NAME (t
), 0, false);
7442 if ((DECL_LANG_SPECIFIC (t
) && DECL_TEMPLATE_INFO (t
))
7443 || local_variable_p (t
))
7444 t
= tsubst (t
, args
, complain
, in_decl
);
7449 return tsubst_baselink (t
, current_class_type
, args
, complain
, in_decl
);
7452 if (DECL_TEMPLATE_TEMPLATE_PARM_P (t
))
7453 return tsubst (TREE_TYPE (DECL_TEMPLATE_RESULT (t
)),
7454 args
, complain
, in_decl
);
7455 else if (is_member_template (t
))
7456 return tsubst (t
, args
, complain
, in_decl
);
7457 else if (DECL_CLASS_SCOPE_P (t
)
7458 && uses_template_parms (DECL_CONTEXT (t
)))
7460 /* Template template argument like the following example need
7463 template <template <class> class TT> struct C {};
7464 template <class T> struct D {
7465 template <class U> struct E {};
7470 We are processing the template argument `E' in #1 for
7471 the template instantiation #2. Originally, `E' is a
7472 TEMPLATE_DECL with `D<T>' as its DECL_CONTEXT. Now we
7473 have to substitute this with one having context `D<int>'. */
7475 tree context
= tsubst (DECL_CONTEXT (t
), args
, complain
, in_decl
);
7476 return lookup_field (context
, DECL_NAME(t
), 0, false);
7479 /* Ordinary template template argument. */
7483 case REINTERPRET_CAST_EXPR
:
7484 case CONST_CAST_EXPR
:
7485 case STATIC_CAST_EXPR
:
7486 case DYNAMIC_CAST_EXPR
:
7489 (code
, tsubst (TREE_TYPE (t
), args
, complain
, in_decl
),
7490 tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
));
7494 case TRUTH_NOT_EXPR
:
7497 case CONVERT_EXPR
: /* Unary + */
7506 (code
, tsubst (TREE_TYPE (t
), args
, complain
, in_decl
),
7507 tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
));
7514 object
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
7515 name
= TREE_OPERAND (t
, 1);
7516 if (TREE_CODE (name
) == BIT_NOT_EXPR
)
7518 name
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
7520 name
= build1 (BIT_NOT_EXPR
, NULL_TREE
, name
);
7522 else if (TREE_CODE (name
) == SCOPE_REF
7523 && TREE_CODE (TREE_OPERAND (name
, 1)) == BIT_NOT_EXPR
)
7525 tree base
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
7527 name
= TREE_OPERAND (name
, 1);
7528 name
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
7530 name
= build1 (BIT_NOT_EXPR
, NULL_TREE
, name
);
7531 name
= build_nt (SCOPE_REF
, base
, name
);
7533 else if (TREE_CODE (name
) == BASELINK
)
7534 name
= tsubst_baselink (name
,
7535 non_reference (TREE_TYPE (object
)),
7539 name
= tsubst_copy (name
, args
, complain
, in_decl
);
7540 return build_nt (COMPONENT_REF
, object
, name
, NULL_TREE
);
7546 case TRUNC_DIV_EXPR
:
7548 case FLOOR_DIV_EXPR
:
7549 case ROUND_DIV_EXPR
:
7550 case EXACT_DIV_EXPR
:
7554 case TRUNC_MOD_EXPR
:
7555 case FLOOR_MOD_EXPR
:
7556 case TRUTH_ANDIF_EXPR
:
7557 case TRUTH_ORIF_EXPR
:
7558 case TRUTH_AND_EXPR
:
7577 case PREDECREMENT_EXPR
:
7578 case PREINCREMENT_EXPR
:
7579 case POSTDECREMENT_EXPR
:
7580 case POSTINCREMENT_EXPR
:
7582 (code
, tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
),
7583 tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
));
7586 return build_nt (code
,
7587 tsubst_copy (TREE_OPERAND (t
, 0), args
,
7589 tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
,
7595 case PSEUDO_DTOR_EXPR
:
7598 (code
, tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
),
7599 tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
),
7600 tsubst_copy (TREE_OPERAND (t
, 2), args
, complain
, in_decl
));
7607 (code
, tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
),
7608 tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
),
7609 tsubst_copy (TREE_OPERAND (t
, 2), args
, complain
, in_decl
));
7610 NEW_EXPR_USE_GLOBAL (r
) = NEW_EXPR_USE_GLOBAL (t
);
7617 (code
, tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
),
7618 tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
));
7619 DELETE_EXPR_USE_GLOBAL (r
) = DELETE_EXPR_USE_GLOBAL (t
);
7620 DELETE_EXPR_USE_VEC (r
) = DELETE_EXPR_USE_VEC (t
);
7624 case TEMPLATE_ID_EXPR
:
7626 /* Substituted template arguments */
7627 tree fn
= TREE_OPERAND (t
, 0);
7628 tree targs
= TREE_OPERAND (t
, 1);
7630 fn
= tsubst_copy (fn
, args
, complain
, in_decl
);
7632 targs
= tsubst_template_args (targs
, args
, complain
, in_decl
);
7634 return lookup_template_function (fn
, targs
);
7639 tree purpose
, value
, chain
;
7641 if (t
== void_list_node
)
7644 purpose
= TREE_PURPOSE (t
);
7646 purpose
= tsubst_copy (purpose
, args
, complain
, in_decl
);
7647 value
= TREE_VALUE (t
);
7649 value
= tsubst_copy (value
, args
, complain
, in_decl
);
7650 chain
= TREE_CHAIN (t
);
7651 if (chain
&& chain
!= void_type_node
)
7652 chain
= tsubst_copy (chain
, args
, complain
, in_decl
);
7653 if (purpose
== TREE_PURPOSE (t
)
7654 && value
== TREE_VALUE (t
)
7655 && chain
== TREE_CHAIN (t
))
7657 return tree_cons (purpose
, value
, chain
);
7664 case TEMPLATE_TYPE_PARM
:
7665 case TEMPLATE_TEMPLATE_PARM
:
7666 case BOUND_TEMPLATE_TEMPLATE_PARM
:
7667 case TEMPLATE_PARM_INDEX
:
7669 case REFERENCE_TYPE
:
7675 case UNBOUND_CLASS_TEMPLATE
:
7678 return tsubst (t
, args
, complain
, in_decl
);
7680 case IDENTIFIER_NODE
:
7681 if (IDENTIFIER_TYPENAME_P (t
))
7683 tree new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
7684 return mangle_conv_op_name_for_type (new_type
);
7691 r
= build_constructor
7692 (tsubst (TREE_TYPE (t
), args
, complain
, in_decl
),
7693 tsubst_copy (CONSTRUCTOR_ELTS (t
), args
, complain
, in_decl
));
7694 TREE_HAS_CONSTRUCTOR (r
) = TREE_HAS_CONSTRUCTOR (t
);
7699 return build_x_va_arg (tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
,
7701 tsubst (TREE_TYPE (t
), args
, complain
, in_decl
));
7703 case CLEANUP_POINT_EXPR
:
7704 /* We shouldn't have built any of these during initial template
7705 generation. Instead, they should be built during instantiation
7706 in response to the saved STMT_IS_FULL_EXPR_P setting. */
7714 /* Like tsubst_copy for expressions, etc. but also does semantic
7718 tsubst_expr (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
7720 /* Live only within one (recursive) call to tsubst_expr. We use
7721 this to pass the statement expression node from the STMT_EXPR
7722 to the EXPR_STMT that is its result. */
7723 static tree cur_stmt_expr
;
7727 if (t
== NULL_TREE
|| t
== error_mark_node
)
7730 if (EXPR_HAS_LOCATION (t
))
7731 input_location
= EXPR_LOCATION (t
);
7732 if (STATEMENT_CODE_P (TREE_CODE (t
)))
7733 current_stmt_tree ()->stmts_are_full_exprs_p
= STMT_IS_FULL_EXPR_P (t
);
7735 switch (TREE_CODE (t
))
7737 case STATEMENT_LIST
:
7739 tree_stmt_iterator i
;
7740 for (i
= tsi_start (t
); !tsi_end_p (i
); tsi_next (&i
))
7741 tsubst_expr (tsi_stmt (i
), args
, complain
, in_decl
);
7745 case CTOR_INITIALIZER
:
7746 finish_mem_initializers (tsubst_initializer_list
7747 (TREE_OPERAND (t
, 0), args
));
7751 finish_return_stmt (tsubst_expr (TREE_OPERAND (t
, 0),
7752 args
, complain
, in_decl
));
7757 tree old_stmt_expr
= cur_stmt_expr
;
7758 tree stmt_expr
= begin_stmt_expr ();
7760 cur_stmt_expr
= stmt_expr
;
7761 tsubst_expr (STMT_EXPR_STMT (t
), args
, complain
, in_decl
);
7762 stmt_expr
= finish_stmt_expr (stmt_expr
, false);
7763 cur_stmt_expr
= old_stmt_expr
;
7769 tmp
= tsubst_expr (EXPR_STMT_EXPR (t
), args
, complain
, in_decl
);
7770 if (EXPR_STMT_STMT_EXPR_RESULT (t
))
7771 finish_stmt_expr_expr (tmp
, cur_stmt_expr
);
7773 finish_expr_stmt (tmp
);
7777 do_using_directive (tsubst_expr (USING_STMT_NAMESPACE (t
),
7778 args
, complain
, in_decl
));
7786 decl
= DECL_EXPR_DECL (t
);
7787 if (TREE_CODE (decl
) == LABEL_DECL
)
7788 finish_label_decl (DECL_NAME (decl
));
7789 else if (TREE_CODE (decl
) == USING_DECL
)
7791 tree scope
= DECL_INITIAL (decl
);
7792 tree name
= DECL_NAME (decl
);
7795 scope
= tsubst_expr (scope
, args
, complain
, in_decl
);
7796 decl
= lookup_qualified_name (scope
, name
,
7797 /*is_type_p=*/false,
7798 /*complain=*/false);
7799 if (decl
== error_mark_node
)
7800 qualified_name_lookup_error (scope
, name
);
7802 do_local_using_decl (decl
, scope
, name
);
7806 init
= DECL_INITIAL (decl
);
7807 decl
= tsubst (decl
, args
, complain
, in_decl
);
7808 if (decl
!= error_mark_node
)
7811 DECL_INITIAL (decl
) = error_mark_node
;
7812 /* By marking the declaration as instantiated, we avoid
7813 trying to instantiate it. Since instantiate_decl can't
7814 handle local variables, and since we've already done
7815 all that needs to be done, that's the right thing to
7817 if (TREE_CODE (decl
) == VAR_DECL
)
7818 DECL_TEMPLATE_INSTANTIATED (decl
) = 1;
7819 if (TREE_CODE (decl
) == VAR_DECL
7820 && ANON_AGGR_TYPE_P (TREE_TYPE (decl
)))
7821 /* Anonymous aggregates are a special case. */
7822 finish_anon_union (decl
);
7825 maybe_push_decl (decl
);
7826 if (TREE_CODE (decl
) == VAR_DECL
7827 && DECL_PRETTY_FUNCTION_P (decl
))
7829 /* For __PRETTY_FUNCTION__ we have to adjust the
7831 const char *const name
7832 = cxx_printable_name (current_function_decl
, 2);
7833 init
= cp_fname_init (name
, &TREE_TYPE (decl
));
7836 init
= tsubst_expr (init
, args
, complain
, in_decl
);
7837 cp_finish_decl (decl
, init
, NULL_TREE
, 0);
7842 /* A DECL_EXPR can also be used as an expression, in the condition
7843 clause of an if/for/while construct. */
7848 stmt
= begin_for_stmt ();
7849 tsubst_expr (FOR_INIT_STMT (t
), args
, complain
, in_decl
);
7850 finish_for_init_stmt (stmt
);
7851 tmp
= tsubst_expr (FOR_COND (t
), args
, complain
, in_decl
);
7852 finish_for_cond (tmp
, stmt
);
7853 tmp
= tsubst_expr (FOR_EXPR (t
), args
, complain
, in_decl
);
7854 finish_for_expr (tmp
, stmt
);
7855 tsubst_expr (FOR_BODY (t
), args
, complain
, in_decl
);
7856 finish_for_stmt (stmt
);
7860 stmt
= begin_while_stmt ();
7861 tmp
= tsubst_expr (WHILE_COND (t
), args
, complain
, in_decl
);
7862 finish_while_stmt_cond (tmp
, stmt
);
7863 tsubst_expr (WHILE_BODY (t
), args
, complain
, in_decl
);
7864 finish_while_stmt (stmt
);
7868 stmt
= begin_do_stmt ();
7869 tsubst_expr (DO_BODY (t
), args
, complain
, in_decl
);
7870 finish_do_body (stmt
);
7871 tmp
= tsubst_expr (DO_COND (t
), args
, complain
, in_decl
);
7872 finish_do_stmt (tmp
, stmt
);
7876 stmt
= begin_if_stmt ();
7877 tmp
= tsubst_expr (IF_COND (t
), args
, complain
, in_decl
);
7878 finish_if_stmt_cond (tmp
, stmt
);
7879 tsubst_expr (THEN_CLAUSE (t
), args
, complain
, in_decl
);
7880 finish_then_clause (stmt
);
7882 if (ELSE_CLAUSE (t
))
7884 begin_else_clause (stmt
);
7885 tsubst_expr (ELSE_CLAUSE (t
), args
, complain
, in_decl
);
7886 finish_else_clause (stmt
);
7889 finish_if_stmt (stmt
);
7893 if (BIND_EXPR_BODY_BLOCK (t
))
7894 stmt
= begin_function_body ();
7896 stmt
= begin_compound_stmt (BIND_EXPR_TRY_BLOCK (t
)
7897 ? BCS_TRY_BLOCK
: 0);
7899 tsubst_expr (BIND_EXPR_BODY (t
), args
, complain
, in_decl
);
7901 if (BIND_EXPR_BODY_BLOCK (t
))
7902 finish_function_body (stmt
);
7904 finish_compound_stmt (stmt
);
7908 finish_break_stmt ();
7912 finish_continue_stmt ();
7916 stmt
= begin_switch_stmt ();
7917 tmp
= tsubst_expr (SWITCH_COND (t
), args
, complain
, in_decl
);
7918 finish_switch_cond (tmp
, stmt
);
7919 tsubst_expr (SWITCH_BODY (t
), args
, complain
, in_decl
);
7920 finish_switch_stmt (stmt
);
7923 case CASE_LABEL_EXPR
:
7924 finish_case_label (tsubst_expr (CASE_LOW (t
), args
, complain
, in_decl
),
7925 tsubst_expr (CASE_HIGH (t
), args
, complain
,
7930 finish_label_stmt (DECL_NAME (LABEL_EXPR_LABEL (t
)));
7934 tmp
= GOTO_DESTINATION (t
);
7935 if (TREE_CODE (tmp
) != LABEL_DECL
)
7936 /* Computed goto's must be tsubst'd into. On the other hand,
7937 non-computed gotos must not be; the identifier in question
7938 will have no binding. */
7939 tmp
= tsubst_expr (tmp
, args
, complain
, in_decl
);
7941 tmp
= DECL_NAME (tmp
);
7942 finish_goto_stmt (tmp
);
7946 tmp
= finish_asm_stmt
7947 (ASM_VOLATILE_P (t
),
7948 tsubst_expr (ASM_STRING (t
), args
, complain
, in_decl
),
7949 tsubst_expr (ASM_OUTPUTS (t
), args
, complain
, in_decl
),
7950 tsubst_expr (ASM_INPUTS (t
), args
, complain
, in_decl
),
7951 tsubst_expr (ASM_CLOBBERS (t
), args
, complain
, in_decl
));
7952 ASM_INPUT_P (tmp
) = ASM_INPUT_P (t
);
7958 stmt
= begin_try_block ();
7959 tsubst_expr (TRY_STMTS (t
), args
, complain
, in_decl
);
7960 finish_cleanup_try_block (stmt
);
7961 finish_cleanup (tsubst_expr (TRY_HANDLERS (t
), args
,
7967 if (FN_TRY_BLOCK_P (t
))
7968 stmt
= begin_function_try_block ();
7970 stmt
= begin_try_block ();
7972 tsubst_expr (TRY_STMTS (t
), args
, complain
, in_decl
);
7974 if (FN_TRY_BLOCK_P (t
))
7975 finish_function_try_block (stmt
);
7977 finish_try_block (stmt
);
7979 tsubst_expr (TRY_HANDLERS (t
), args
, complain
, in_decl
);
7980 if (FN_TRY_BLOCK_P (t
))
7981 finish_function_handler_sequence (stmt
);
7983 finish_handler_sequence (stmt
);
7991 stmt
= begin_handler ();
7992 if (HANDLER_PARMS (t
))
7994 decl
= HANDLER_PARMS (t
);
7995 decl
= tsubst (decl
, args
, complain
, in_decl
);
7996 /* Prevent instantiate_decl from trying to instantiate
7997 this variable. We've already done all that needs to be
7999 DECL_TEMPLATE_INSTANTIATED (decl
) = 1;
8003 finish_handler_parms (decl
, stmt
);
8004 tsubst_expr (HANDLER_BODY (t
), args
, complain
, in_decl
);
8005 finish_handler (stmt
);
8010 tsubst (TREE_TYPE (t
), args
, complain
, NULL_TREE
);
8014 if (!STATEMENT_CODE_P (TREE_CODE (t
)))
8015 return tsubst_copy_and_build (t
, args
, complain
, in_decl
,
8016 /*function_p=*/false);
8023 /* T is a postfix-expression that is not being used in a function
8024 call. Return the substituted version of T. */
8027 tsubst_non_call_postfix_expression (tree t
, tree args
,
8028 tsubst_flags_t complain
,
8031 if (TREE_CODE (t
) == SCOPE_REF
)
8032 t
= tsubst_qualified_id (t
, args
, complain
, in_decl
,
8033 /*done=*/false, /*address_p=*/false);
8035 t
= tsubst_copy_and_build (t
, args
, complain
, in_decl
,
8036 /*function_p=*/false);
8041 /* Like tsubst but deals with expressions and performs semantic
8042 analysis. FUNCTION_P is true if T is the "F" in "F (ARGS)". */
8045 tsubst_copy_and_build (tree t
,
8047 tsubst_flags_t complain
,
8051 #define RECUR(NODE) \
8052 tsubst_copy_and_build (NODE, args, complain, in_decl, /*function_p=*/false)
8056 if (t
== NULL_TREE
|| t
== error_mark_node
)
8059 switch (TREE_CODE (t
))
8064 case IDENTIFIER_NODE
:
8068 tree qualifying_class
;
8069 bool non_integral_constant_expression_p
;
8070 const char *error_msg
;
8072 if (IDENTIFIER_TYPENAME_P (t
))
8074 tree new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
8075 t
= mangle_conv_op_name_for_type (new_type
);
8078 /* Look up the name. */
8079 decl
= lookup_name (t
, 0);
8081 /* By convention, expressions use ERROR_MARK_NODE to indicate
8082 failure, not NULL_TREE. */
8083 if (decl
== NULL_TREE
)
8084 decl
= error_mark_node
;
8086 decl
= finish_id_expression (t
, decl
, NULL_TREE
,
8089 /*integral_constant_expression_p=*/false,
8090 /*allow_non_integral_constant_expression_p=*/false,
8091 &non_integral_constant_expression_p
,
8095 if (!function_p
&& TREE_CODE (decl
) == IDENTIFIER_NODE
)
8096 decl
= unqualified_name_lookup_error (decl
);
8100 case TEMPLATE_ID_EXPR
:
8103 tree
template = RECUR (TREE_OPERAND (t
, 0));
8104 tree targs
= TREE_OPERAND (t
, 1);
8107 targs
= tsubst_template_args (targs
, args
, complain
, in_decl
);
8109 if (TREE_CODE (template) == COMPONENT_REF
)
8111 object
= TREE_OPERAND (template, 0);
8112 template = TREE_OPERAND (template, 1);
8116 template = lookup_template_function (template, targs
);
8119 return build (COMPONENT_REF
, TREE_TYPE (template),
8120 object
, template, NULL_TREE
);
8126 return build_x_indirect_ref (RECUR (TREE_OPERAND (t
, 0)), "unary *");
8130 (tsubst (TREE_TYPE (t
), args
, complain
, in_decl
),
8131 RECUR (TREE_OPERAND (t
, 0)));
8134 return build_functional_cast
8135 (tsubst (TREE_TYPE (t
), args
, complain
, in_decl
),
8136 RECUR (TREE_OPERAND (t
, 0)));
8138 case REINTERPRET_CAST_EXPR
:
8139 return build_reinterpret_cast
8140 (tsubst (TREE_TYPE (t
), args
, complain
, in_decl
),
8141 RECUR (TREE_OPERAND (t
, 0)));
8143 case CONST_CAST_EXPR
:
8144 return build_const_cast
8145 (tsubst (TREE_TYPE (t
), args
, complain
, in_decl
),
8146 RECUR (TREE_OPERAND (t
, 0)));
8148 case DYNAMIC_CAST_EXPR
:
8149 return build_dynamic_cast
8150 (tsubst (TREE_TYPE (t
), args
, complain
, in_decl
),
8151 RECUR (TREE_OPERAND (t
, 0)));
8153 case STATIC_CAST_EXPR
:
8154 return build_static_cast
8155 (tsubst (TREE_TYPE (t
), args
, complain
, in_decl
),
8156 RECUR (TREE_OPERAND (t
, 0)));
8158 case POSTDECREMENT_EXPR
:
8159 case POSTINCREMENT_EXPR
:
8160 op1
= tsubst_non_call_postfix_expression (TREE_OPERAND (t
, 0),
8161 args
, complain
, in_decl
);
8162 return build_x_unary_op (TREE_CODE (t
), op1
);
8164 case PREDECREMENT_EXPR
:
8165 case PREINCREMENT_EXPR
:
8169 case TRUTH_NOT_EXPR
:
8170 case CONVERT_EXPR
: /* Unary + */
8173 return build_x_unary_op (TREE_CODE (t
), RECUR (TREE_OPERAND (t
, 0)));
8176 op1
= TREE_OPERAND (t
, 0);
8177 if (TREE_CODE (op1
) == SCOPE_REF
)
8178 op1
= tsubst_qualified_id (op1
, args
, complain
, in_decl
,
8179 /*done=*/true, /*address_p=*/true);
8181 op1
= tsubst_non_call_postfix_expression (op1
, args
, complain
,
8183 if (TREE_CODE (op1
) == LABEL_DECL
)
8184 return finish_label_address_expr (DECL_NAME (op1
));
8185 return build_x_unary_op (ADDR_EXPR
, op1
);
8190 case TRUNC_DIV_EXPR
:
8192 case FLOOR_DIV_EXPR
:
8193 case ROUND_DIV_EXPR
:
8194 case EXACT_DIV_EXPR
:
8198 case TRUNC_MOD_EXPR
:
8199 case FLOOR_MOD_EXPR
:
8200 case TRUTH_ANDIF_EXPR
:
8201 case TRUTH_ORIF_EXPR
:
8202 case TRUTH_AND_EXPR
:
8218 return build_x_binary_op
8220 RECUR (TREE_OPERAND (t
, 0)),
8221 RECUR (TREE_OPERAND (t
, 1)),
8222 /*overloaded_p=*/NULL
);
8225 return tsubst_qualified_id (t
, args
, complain
, in_decl
, /*done=*/true,
8226 /*address_p=*/false);
8229 if (tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
)
8232 return build_nt (ARRAY_REF
, NULL_TREE
, RECUR (TREE_OPERAND (t
, 1)),
8233 NULL_TREE
, NULL_TREE
);
8235 op1
= tsubst_non_call_postfix_expression (TREE_OPERAND (t
, 0),
8236 args
, complain
, in_decl
);
8237 /* Remember that there was a reference to this entity. */
8240 return grok_array_decl (op1
, RECUR (TREE_OPERAND (t
, 1)));
8244 op1
= TREE_OPERAND (t
, 0);
8247 /* When there are no ARGS, we are trying to evaluate a
8248 non-dependent expression from the parser. Trying to do
8249 the substitutions may not work. */
8251 op1
= TREE_TYPE (op1
);
8260 return cxx_sizeof_or_alignof_type (op1
, TREE_CODE (t
), true);
8262 return cxx_sizeof_or_alignof_expr (op1
, TREE_CODE (t
));
8265 return build_x_modify_expr
8266 (RECUR (TREE_OPERAND (t
, 0)),
8267 TREE_CODE (TREE_OPERAND (t
, 1)),
8268 RECUR (TREE_OPERAND (t
, 2)));
8271 op1
= tsubst_non_call_postfix_expression (TREE_OPERAND (t
, 0),
8272 args
, complain
, in_decl
);
8273 /* Remember that there was a reference to this entity. */
8276 return build_x_arrow (op1
);
8280 (RECUR (TREE_OPERAND (t
, 0)),
8281 RECUR (TREE_OPERAND (t
, 1)),
8282 RECUR (TREE_OPERAND (t
, 2)),
8283 RECUR (TREE_OPERAND (t
, 3)),
8284 NEW_EXPR_USE_GLOBAL (t
));
8287 return delete_sanity
8288 (RECUR (TREE_OPERAND (t
, 0)),
8289 RECUR (TREE_OPERAND (t
, 1)),
8290 DELETE_EXPR_USE_VEC (t
),
8291 DELETE_EXPR_USE_GLOBAL (t
));
8294 return build_x_compound_expr (RECUR (TREE_OPERAND (t
, 0)),
8295 RECUR (TREE_OPERAND (t
, 1)));
8304 function
= TREE_OPERAND (t
, 0);
8305 /* When we parsed the expression, we determined whether or
8306 not Koenig lookup should be performed. */
8307 koenig_p
= KOENIG_LOOKUP_P (t
);
8308 if (TREE_CODE (function
) == SCOPE_REF
)
8311 function
= tsubst_qualified_id (function
, args
, complain
, in_decl
,
8313 /*address_p=*/false);
8317 qualified_p
= (TREE_CODE (function
) == COMPONENT_REF
8318 && (TREE_CODE (TREE_OPERAND (function
, 1))
8320 function
= tsubst_copy_and_build (function
, args
, complain
,
8323 if (BASELINK_P (function
))
8327 call_args
= RECUR (TREE_OPERAND (t
, 1));
8329 /* We do not perform argument-dependent lookup if normal
8330 lookup finds a non-function, in accordance with the
8331 expected resolution of DR 218. */
8333 && (is_overloaded_fn (function
)
8334 || TREE_CODE (function
) == IDENTIFIER_NODE
))
8335 function
= perform_koenig_lookup (function
, call_args
);
8337 if (TREE_CODE (function
) == IDENTIFIER_NODE
)
8339 unqualified_name_lookup_error (function
);
8340 return error_mark_node
;
8343 /* Remember that there was a reference to this entity. */
8344 if (DECL_P (function
))
8345 mark_used (function
);
8347 function
= convert_from_reference (function
);
8349 if (TREE_CODE (function
) == OFFSET_REF
)
8350 return build_offset_ref_call_from_tree (function
, call_args
);
8351 if (TREE_CODE (function
) == COMPONENT_REF
)
8353 if (!BASELINK_P (TREE_OPERAND (function
, 1)))
8354 return finish_call_expr (function
, call_args
,
8355 /*disallow_virtual=*/false,
8356 /*koenig_p=*/false);
8358 return (build_new_method_call
8359 (TREE_OPERAND (function
, 0),
8360 TREE_OPERAND (function
, 1),
8361 call_args
, NULL_TREE
,
8362 qualified_p
? LOOKUP_NONVIRTUAL
: LOOKUP_NORMAL
));
8364 return finish_call_expr (function
, call_args
,
8365 /*disallow_virtual=*/qualified_p
,
8370 return build_x_conditional_expr
8371 (RECUR (TREE_OPERAND (t
, 0)),
8372 RECUR (TREE_OPERAND (t
, 1)),
8373 RECUR (TREE_OPERAND (t
, 2)));
8375 case PSEUDO_DTOR_EXPR
:
8376 return finish_pseudo_destructor_expr
8377 (RECUR (TREE_OPERAND (t
, 0)),
8378 RECUR (TREE_OPERAND (t
, 1)),
8379 RECUR (TREE_OPERAND (t
, 2)));
8383 tree purpose
, value
, chain
;
8385 if (t
== void_list_node
)
8388 purpose
= TREE_PURPOSE (t
);
8390 purpose
= RECUR (purpose
);
8391 value
= TREE_VALUE (t
);
8393 value
= RECUR (value
);
8394 chain
= TREE_CHAIN (t
);
8395 if (chain
&& chain
!= void_type_node
)
8396 chain
= RECUR (chain
);
8397 if (purpose
== TREE_PURPOSE (t
)
8398 && value
== TREE_VALUE (t
)
8399 && chain
== TREE_CHAIN (t
))
8401 return tree_cons (purpose
, value
, chain
);
8409 object
= tsubst_non_call_postfix_expression (TREE_OPERAND (t
, 0),
8410 args
, complain
, in_decl
);
8411 /* Remember that there was a reference to this entity. */
8412 if (DECL_P (object
))
8415 member
= TREE_OPERAND (t
, 1);
8416 if (BASELINK_P (member
))
8417 member
= tsubst_baselink (member
,
8418 non_reference (TREE_TYPE (object
)),
8419 args
, complain
, in_decl
);
8421 member
= tsubst_copy (member
, args
, complain
, in_decl
);
8423 if (!CLASS_TYPE_P (TREE_TYPE (object
)))
8425 if (TREE_CODE (member
) == BIT_NOT_EXPR
)
8426 return finish_pseudo_destructor_expr (object
,
8428 TREE_TYPE (object
));
8429 else if (TREE_CODE (member
) == SCOPE_REF
8430 && (TREE_CODE (TREE_OPERAND (member
, 1)) == BIT_NOT_EXPR
))
8431 return finish_pseudo_destructor_expr (object
,
8433 TREE_TYPE (object
));
8435 else if (TREE_CODE (member
) == SCOPE_REF
8436 && TREE_CODE (TREE_OPERAND (member
, 1)) == TEMPLATE_ID_EXPR
)
8441 /* Lookup the template functions now that we know what the
8443 tmpl
= TREE_OPERAND (TREE_OPERAND (member
, 1), 0);
8444 args
= TREE_OPERAND (TREE_OPERAND (member
, 1), 1);
8445 member
= lookup_qualified_name (TREE_OPERAND (member
, 0), tmpl
,
8446 /*is_type_p=*/false,
8447 /*complain=*/false);
8448 if (BASELINK_P (member
))
8449 BASELINK_FUNCTIONS (member
)
8450 = build_nt (TEMPLATE_ID_EXPR
, BASELINK_FUNCTIONS (member
),
8454 qualified_name_lookup_error (TREE_TYPE (object
), tmpl
);
8455 return error_mark_node
;
8458 else if (TREE_CODE (member
) == FIELD_DECL
)
8459 return finish_non_static_data_member (member
, object
, NULL_TREE
);
8461 return finish_class_member_access_expr (object
, member
);
8466 (RECUR (TREE_OPERAND (t
, 0)));
8472 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
8475 /* digest_init will do the wrong thing if we let it. */
8476 if (type
&& TYPE_PTRMEMFUNC_P (type
))
8480 /* We do not want to process the purpose of aggregate
8481 initializers as they are identifier nodes which will be
8482 looked up by digest_init. */
8483 purpose_p
= !(type
&& IS_AGGR_TYPE (type
));
8484 for (elts
= CONSTRUCTOR_ELTS (t
);
8486 elts
= TREE_CHAIN (elts
))
8488 tree purpose
= TREE_PURPOSE (elts
);
8489 tree value
= TREE_VALUE (elts
);
8491 if (purpose
&& purpose_p
)
8492 purpose
= RECUR (purpose
);
8493 value
= RECUR (value
);
8494 r
= tree_cons (purpose
, value
, r
);
8497 r
= build_constructor (NULL_TREE
, nreverse (r
));
8498 TREE_HAS_CONSTRUCTOR (r
) = TREE_HAS_CONSTRUCTOR (t
);
8501 return digest_init (type
, r
, 0);
8507 tree operand_0
= RECUR (TREE_OPERAND (t
, 0));
8508 if (TYPE_P (operand_0
))
8509 return get_typeid (operand_0
);
8510 return build_typeid (operand_0
);
8514 return convert_from_reference (tsubst_copy (t
, args
, complain
, in_decl
));
8518 t
= tsubst_copy (t
, args
, complain
, in_decl
);
8519 return convert_from_reference (t
);
8522 return build_x_va_arg (RECUR (TREE_OPERAND (t
, 0)),
8523 tsubst_copy (TREE_TYPE (t
), args
, complain
,
8527 return tsubst_copy (t
, args
, complain
, in_decl
);
8533 /* Verify that the instantiated ARGS are valid. For type arguments,
8534 make sure that the type's linkage is ok. For non-type arguments,
8535 make sure they are constants if they are integral or enumerations.
8536 Emit an error under control of COMPLAIN, and return TRUE on error. */
8539 check_instantiated_args (tree tmpl
, tree args
, tsubst_flags_t complain
)
8541 int ix
, len
= DECL_NTPARMS (tmpl
);
8542 bool result
= false;
8544 for (ix
= 0; ix
!= len
; ix
++)
8546 tree t
= TREE_VEC_ELT (args
, ix
);
8550 /* [basic.link]: A name with no linkage (notably, the name
8551 of a class or enumeration declared in a local scope)
8552 shall not be used to declare an entity with linkage.
8553 This implies that names with no linkage cannot be used as
8554 template arguments. */
8555 tree nt
= no_linkage_check (t
);
8559 if (!(complain
& tf_error
))
8561 else if (TYPE_ANONYMOUS_P (nt
))
8562 error ("`%T' uses anonymous type", t
);
8564 error ("`%T' uses local type `%T'", t
, nt
);
8567 /* In order to avoid all sorts of complications, we do not
8568 allow variably-modified types as template arguments. */
8569 else if (variably_modified_type_p (t
, NULL_TREE
))
8571 if (complain
& tf_error
)
8572 error ("`%T' is a variably modified type", t
);
8576 /* A non-type argument of integral or enumerated type must be a
8578 else if (TREE_TYPE (t
)
8579 && INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (t
))
8580 && !TREE_CONSTANT (t
))
8582 if (complain
& tf_error
)
8583 error ("integral expression `%E' is not constant", t
);
8587 if (result
&& complain
& tf_error
)
8588 error (" trying to instantiate `%D'", tmpl
);
8592 /* Instantiate the indicated variable or function template TMPL with
8593 the template arguments in TARG_PTR. */
8596 instantiate_template (tree tmpl
, tree targ_ptr
, tsubst_flags_t complain
)
8602 if (tmpl
== error_mark_node
)
8603 return error_mark_node
;
8605 my_friendly_assert (TREE_CODE (tmpl
) == TEMPLATE_DECL
, 283);
8607 /* If this function is a clone, handle it specially. */
8608 if (DECL_CLONED_FUNCTION_P (tmpl
))
8613 spec
= instantiate_template (DECL_CLONED_FUNCTION (tmpl
), targ_ptr
,
8615 if (spec
== error_mark_node
)
8616 return error_mark_node
;
8618 /* Look for the clone. */
8619 for (clone
= TREE_CHAIN (spec
);
8620 clone
&& DECL_CLONED_FUNCTION_P (clone
);
8621 clone
= TREE_CHAIN (clone
))
8622 if (DECL_NAME (clone
) == DECL_NAME (tmpl
))
8624 /* We should always have found the clone by now. */
8629 /* Check to see if we already have this specialization. */
8630 spec
= retrieve_specialization (tmpl
, targ_ptr
);
8631 if (spec
!= NULL_TREE
)
8634 gen_tmpl
= most_general_template (tmpl
);
8635 if (tmpl
!= gen_tmpl
)
8637 /* The TMPL is a partial instantiation. To get a full set of
8638 arguments we must add the arguments used to perform the
8639 partial instantiation. */
8640 targ_ptr
= add_outermost_template_args (DECL_TI_ARGS (tmpl
),
8643 /* Check to see if we already have this specialization. */
8644 spec
= retrieve_specialization (gen_tmpl
, targ_ptr
);
8645 if (spec
!= NULL_TREE
)
8649 if (check_instantiated_args (gen_tmpl
, INNERMOST_TEMPLATE_ARGS (targ_ptr
),
8651 return error_mark_node
;
8653 /* We are building a FUNCTION_DECL, during which the access of its
8654 parameters and return types have to be checked. However this
8655 FUNCTION_DECL which is the desired context for access checking
8656 is not built yet. We solve this chicken-and-egg problem by
8657 deferring all checks until we have the FUNCTION_DECL. */
8658 push_deferring_access_checks (dk_deferred
);
8660 /* Substitute template parameters. */
8661 fndecl
= tsubst (DECL_TEMPLATE_RESULT (gen_tmpl
),
8662 targ_ptr
, complain
, gen_tmpl
);
8664 /* Now we know the specialization, compute access previously
8666 push_access_scope (fndecl
);
8667 perform_deferred_access_checks ();
8668 pop_access_scope (fndecl
);
8669 pop_deferring_access_checks ();
8671 /* The DECL_TI_TEMPLATE should always be the immediate parent
8672 template, not the most general template. */
8673 DECL_TI_TEMPLATE (fndecl
) = tmpl
;
8675 /* If we've just instantiated the main entry point for a function,
8676 instantiate all the alternate entry points as well. We do this
8677 by cloning the instantiation of the main entry point, not by
8678 instantiating the template clones. */
8679 if (TREE_CHAIN (gen_tmpl
) && DECL_CLONED_FUNCTION_P (TREE_CHAIN (gen_tmpl
)))
8680 clone_function_decl (fndecl
, /*update_method_vec_p=*/0);
8685 /* The FN is a TEMPLATE_DECL for a function. The ARGS are the
8686 arguments that are being used when calling it. TARGS is a vector
8687 into which the deduced template arguments are placed.
8689 Return zero for success, 2 for an incomplete match that doesn't resolve
8690 all the types, and 1 for complete failure. An error message will be
8691 printed only for an incomplete match.
8693 If FN is a conversion operator, or we are trying to produce a specific
8694 specialization, RETURN_TYPE is the return type desired.
8696 The EXPLICIT_TARGS are explicit template arguments provided via a
8699 The parameter STRICT is one of:
8702 We are deducing arguments for a function call, as in
8706 We are deducing arguments for a conversion function, as in
8710 We are deducing arguments when doing an explicit instantiation
8711 as in [temp.explicit], when determining an explicit specialization
8712 as in [temp.expl.spec], or when taking the address of a function
8713 template, as in [temp.deduct.funcaddr].
8716 We are deducing arguments when calculating the partial
8717 ordering between specializations of function or class
8718 templates, as in [temp.func.order] and [temp.class.order].
8720 LEN is the number of parms to consider before returning success, or -1
8721 for all. This is used in partial ordering to avoid comparing parms for
8722 which no actual argument was passed, since they are not considered in
8723 overload resolution (and are explicitly excluded from consideration in
8724 partial ordering in [temp.func.order]/6). */
8727 fn_type_unification (tree fn
,
8728 tree explicit_targs
,
8732 unification_kind_t strict
,
8739 my_friendly_assert (TREE_CODE (fn
) == TEMPLATE_DECL
, 0);
8741 fntype
= TREE_TYPE (fn
);
8746 The specified template arguments must match the template
8747 parameters in kind (i.e., type, nontype, template), and there
8748 must not be more arguments than there are parameters;
8749 otherwise type deduction fails.
8751 Nontype arguments must match the types of the corresponding
8752 nontype template parameters, or must be convertible to the
8753 types of the corresponding nontype parameters as specified in
8754 _temp.arg.nontype_, otherwise type deduction fails.
8756 All references in the function type of the function template
8757 to the corresponding template parameters are replaced by the
8758 specified template argument values. If a substitution in a
8759 template parameter or in the function type of the function
8760 template results in an invalid type, type deduction fails. */
8762 tree converted_args
;
8766 = (coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (fn
),
8767 explicit_targs
, NULL_TREE
, tf_none
,
8768 /*require_all_arguments=*/0));
8769 if (converted_args
== error_mark_node
)
8772 /* Substitute the explicit args into the function type. This is
8773 necessary so that, for instance, explicitly declared function
8774 arguments can match null pointed constants. If we were given
8775 an incomplete set of explicit args, we must not do semantic
8776 processing during substitution as we could create partial
8778 incomplete
= NUM_TMPL_ARGS (explicit_targs
) != NUM_TMPL_ARGS (targs
);
8779 processing_template_decl
+= incomplete
;
8780 fntype
= tsubst (fntype
, converted_args
, tf_none
, NULL_TREE
);
8781 processing_template_decl
-= incomplete
;
8783 if (fntype
== error_mark_node
)
8786 /* Place the explicitly specified arguments in TARGS. */
8787 for (i
= NUM_TMPL_ARGS (converted_args
); i
--;)
8788 TREE_VEC_ELT (targs
, i
) = TREE_VEC_ELT (converted_args
, i
);
8791 parms
= TYPE_ARG_TYPES (fntype
);
8792 /* Never do unification on the 'this' parameter. */
8793 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
))
8794 parms
= TREE_CHAIN (parms
);
8798 /* We've been given a return type to match, prepend it. */
8799 parms
= tree_cons (NULL_TREE
, TREE_TYPE (fntype
), parms
);
8800 args
= tree_cons (NULL_TREE
, return_type
, args
);
8805 /* We allow incomplete unification without an error message here
8806 because the standard doesn't seem to explicitly prohibit it. Our
8807 callers must be ready to deal with unification failures in any
8809 result
= type_unification_real (DECL_INNERMOST_TEMPLATE_PARMS (fn
),
8810 targs
, parms
, args
, /*subr=*/0,
8811 strict
, /*allow_incomplete*/1, len
);
8814 /* All is well so far. Now, check:
8818 When all template arguments have been deduced, all uses of
8819 template parameters in nondeduced contexts are replaced with
8820 the corresponding deduced argument values. If the
8821 substitution results in an invalid type, as described above,
8822 type deduction fails. */
8823 if (tsubst (TREE_TYPE (fn
), targs
, tf_none
, NULL_TREE
)
8830 /* Adjust types before performing type deduction, as described in
8831 [temp.deduct.call] and [temp.deduct.conv]. The rules in these two
8832 sections are symmetric. PARM is the type of a function parameter
8833 or the return type of the conversion function. ARG is the type of
8834 the argument passed to the call, or the type of the value
8835 initialized with the result of the conversion function. */
8838 maybe_adjust_types_for_deduction (unification_kind_t strict
,
8851 /* Swap PARM and ARG throughout the remainder of this
8852 function; the handling is precisely symmetric since PARM
8853 will initialize ARG rather than vice versa. */
8861 /* There is nothing to do in this case. */
8865 /* DR 214. [temp.func.order] is underspecified, and leads to no
8866 ordering between things like `T *' and `T const &' for `U *'.
8867 The former has T=U and the latter T=U*. The former looks more
8868 specialized and John Spicer considers it well-formed (the EDG
8869 compiler accepts it).
8871 John also confirms that deduction should proceed as in a function
8872 call. Which implies the usual ARG and PARM conversions as DEDUCE_CALL.
8873 However, in ordering, ARG can have REFERENCE_TYPE, but no argument
8874 to an actual call can have such a type.
8876 If both ARG and PARM are REFERENCE_TYPE, we change neither.
8877 If only ARG is a REFERENCE_TYPE, we look through that and then
8878 proceed as with DEDUCE_CALL (which could further convert it). */
8879 if (TREE_CODE (*arg
) == REFERENCE_TYPE
)
8881 if (TREE_CODE (*parm
) == REFERENCE_TYPE
)
8883 *arg
= TREE_TYPE (*arg
);
8890 if (TREE_CODE (*parm
) != REFERENCE_TYPE
)
8892 /* [temp.deduct.call]
8894 If P is not a reference type:
8896 --If A is an array type, the pointer type produced by the
8897 array-to-pointer standard conversion (_conv.array_) is
8898 used in place of A for type deduction; otherwise,
8900 --If A is a function type, the pointer type produced by
8901 the function-to-pointer standard conversion
8902 (_conv.func_) is used in place of A for type deduction;
8905 --If A is a cv-qualified type, the top level
8906 cv-qualifiers of A's type are ignored for type
8908 if (TREE_CODE (*arg
) == ARRAY_TYPE
)
8909 *arg
= build_pointer_type (TREE_TYPE (*arg
));
8910 else if (TREE_CODE (*arg
) == FUNCTION_TYPE
)
8911 *arg
= build_pointer_type (*arg
);
8913 *arg
= TYPE_MAIN_VARIANT (*arg
);
8916 /* [temp.deduct.call]
8918 If P is a cv-qualified type, the top level cv-qualifiers
8919 of P's type are ignored for type deduction. If P is a
8920 reference type, the type referred to by P is used for
8922 *parm
= TYPE_MAIN_VARIANT (*parm
);
8923 if (TREE_CODE (*parm
) == REFERENCE_TYPE
)
8925 *parm
= TREE_TYPE (*parm
);
8926 result
|= UNIFY_ALLOW_OUTER_MORE_CV_QUAL
;
8929 /* DR 322. For conversion deduction, remove a reference type on parm
8930 too (which has been swapped into ARG). */
8931 if (strict
== DEDUCE_CONV
&& TREE_CODE (*arg
) == REFERENCE_TYPE
)
8932 *arg
= TREE_TYPE (*arg
);
8937 /* Most parms like fn_type_unification.
8939 If SUBR is 1, we're being called recursively (to unify the
8940 arguments of a function or method parameter of a function
8944 type_unification_real (tree tparms
,
8949 unification_kind_t strict
,
8950 int allow_incomplete
,
8955 int ntparms
= TREE_VEC_LENGTH (tparms
);
8957 int saw_undeduced
= 0;
8961 my_friendly_assert (TREE_CODE (tparms
) == TREE_VEC
, 289);
8962 my_friendly_assert (xparms
== NULL_TREE
8963 || TREE_CODE (xparms
) == TREE_LIST
, 290);
8964 my_friendly_assert (!xargs
|| TREE_CODE (xargs
) == TREE_LIST
, 291);
8965 my_friendly_assert (ntparms
> 0, 292);
8970 sub_strict
= (UNIFY_ALLOW_OUTER_LEVEL
| UNIFY_ALLOW_MORE_CV_QUAL
8971 | UNIFY_ALLOW_DERIVED
);
8975 sub_strict
= UNIFY_ALLOW_LESS_CV_QUAL
;
8979 sub_strict
= UNIFY_ALLOW_NONE
;
8983 sub_strict
= UNIFY_ALLOW_NONE
;
8999 && parms
!= void_list_node
9001 && args
!= void_list_node
)
9003 parm
= TREE_VALUE (parms
);
9004 parms
= TREE_CHAIN (parms
);
9005 arg
= TREE_VALUE (args
);
9006 args
= TREE_CHAIN (args
);
9008 if (arg
== error_mark_node
)
9010 if (arg
== unknown_type_node
)
9011 /* We can't deduce anything from this, but we might get all the
9012 template args from other function args. */
9015 /* Conversions will be performed on a function argument that
9016 corresponds with a function parameter that contains only
9017 non-deducible template parameters and explicitly specified
9018 template parameters. */
9019 if (!uses_template_parms (parm
))
9024 type
= TREE_TYPE (arg
);
9028 if (strict
== DEDUCE_EXACT
|| strict
== DEDUCE_ORDER
)
9030 if (same_type_p (parm
, type
))
9034 /* It might work; we shouldn't check now, because we might
9035 get into infinite recursion. Overload resolution will
9044 my_friendly_assert (TREE_TYPE (arg
) != NULL_TREE
, 293);
9045 if (type_unknown_p (arg
))
9047 /* [temp.deduct.type] A template-argument can be deduced from
9048 a pointer to function or pointer to member function
9049 argument if the set of overloaded functions does not
9050 contain function templates and at most one of a set of
9051 overloaded functions provides a unique match. */
9053 if (resolve_overloaded_unification
9054 (tparms
, targs
, parm
, arg
, strict
, sub_strict
)
9059 arg
= TREE_TYPE (arg
);
9060 if (arg
== error_mark_node
)
9065 int arg_strict
= sub_strict
;
9068 arg_strict
|= maybe_adjust_types_for_deduction (strict
, &parm
, &arg
);
9070 if (unify (tparms
, targs
, parm
, arg
, arg_strict
))
9074 /* Are we done with the interesting parms? */
9078 /* Fail if we've reached the end of the parm list, and more args
9079 are present, and the parm list isn't variadic. */
9080 if (args
&& args
!= void_list_node
&& parms
== void_list_node
)
9082 /* Fail if parms are left and they don't have default values. */
9084 && parms
!= void_list_node
9085 && TREE_PURPOSE (parms
) == NULL_TREE
)
9090 for (i
= 0; i
< ntparms
; i
++)
9091 if (TREE_VEC_ELT (targs
, i
) == NULL_TREE
)
9093 tree tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, i
));
9095 /* If this is an undeduced nontype parameter that depends on
9096 a type parameter, try another pass; its type may have been
9097 deduced from a later argument than the one from which
9098 this parameter can be deduced. */
9099 if (TREE_CODE (tparm
) == PARM_DECL
9100 && uses_template_parms (TREE_TYPE (tparm
))
9101 && !saw_undeduced
++)
9104 if (!allow_incomplete
)
9105 error ("incomplete type unification");
9111 /* Subroutine of type_unification_real. Args are like the variables at the
9112 call site. ARG is an overloaded function (or template-id); we try
9113 deducing template args from each of the overloads, and if only one
9114 succeeds, we go with that. Modifies TARGS and returns 0 on success. */
9117 resolve_overloaded_unification (tree tparms
,
9121 unification_kind_t strict
,
9124 tree tempargs
= copy_node (targs
);
9128 if (TREE_CODE (arg
) == ADDR_EXPR
)
9130 arg
= TREE_OPERAND (arg
, 0);
9136 if (TREE_CODE (arg
) == COMPONENT_REF
)
9137 /* Handle `&x' where `x' is some static or non-static member
9139 arg
= TREE_OPERAND (arg
, 1);
9141 if (TREE_CODE (arg
) == OFFSET_REF
)
9142 arg
= TREE_OPERAND (arg
, 1);
9144 /* Strip baselink information. */
9145 if (BASELINK_P (arg
))
9146 arg
= BASELINK_FUNCTIONS (arg
);
9148 if (TREE_CODE (arg
) == TEMPLATE_ID_EXPR
)
9150 /* If we got some explicit template args, we need to plug them into
9151 the affected templates before we try to unify, in case the
9152 explicit args will completely resolve the templates in question. */
9154 tree expl_subargs
= TREE_OPERAND (arg
, 1);
9155 arg
= TREE_OPERAND (arg
, 0);
9157 for (; arg
; arg
= OVL_NEXT (arg
))
9159 tree fn
= OVL_CURRENT (arg
);
9162 if (TREE_CODE (fn
) != TEMPLATE_DECL
)
9165 subargs
= get_bindings_overload (fn
, DECL_TEMPLATE_RESULT (fn
),
9169 elem
= tsubst (TREE_TYPE (fn
), subargs
, tf_none
, NULL_TREE
);
9170 good
+= try_one_overload (tparms
, targs
, tempargs
, parm
,
9171 elem
, strict
, sub_strict
, addr_p
);
9175 else if (TREE_CODE (arg
) == OVERLOAD
9176 || TREE_CODE (arg
) == FUNCTION_DECL
)
9178 for (; arg
; arg
= OVL_NEXT (arg
))
9179 good
+= try_one_overload (tparms
, targs
, tempargs
, parm
,
9180 TREE_TYPE (OVL_CURRENT (arg
)),
9181 strict
, sub_strict
, addr_p
);
9186 /* [temp.deduct.type] A template-argument can be deduced from a pointer
9187 to function or pointer to member function argument if the set of
9188 overloaded functions does not contain function templates and at most
9189 one of a set of overloaded functions provides a unique match.
9191 So if we found multiple possibilities, we return success but don't
9196 int i
= TREE_VEC_LENGTH (targs
);
9198 if (TREE_VEC_ELT (tempargs
, i
))
9199 TREE_VEC_ELT (targs
, i
) = TREE_VEC_ELT (tempargs
, i
);
9207 /* Subroutine of resolve_overloaded_unification; does deduction for a single
9208 overload. Fills TARGS with any deduced arguments, or error_mark_node if
9209 different overloads deduce different arguments for a given parm.
9210 ADDR_P is true if the expression for which deduction is being
9211 performed was of the form "& fn" rather than simply "fn".
9213 Returns 1 on success. */
9216 try_one_overload (tree tparms
,
9221 unification_kind_t strict
,
9229 /* [temp.deduct.type] A template-argument can be deduced from a pointer
9230 to function or pointer to member function argument if the set of
9231 overloaded functions does not contain function templates and at most
9232 one of a set of overloaded functions provides a unique match.
9234 So if this is a template, just return success. */
9236 if (uses_template_parms (arg
))
9239 if (TREE_CODE (arg
) == METHOD_TYPE
)
9240 arg
= build_ptrmemfunc_type (build_pointer_type (arg
));
9242 arg
= build_pointer_type (arg
);
9244 sub_strict
|= maybe_adjust_types_for_deduction (strict
, &parm
, &arg
);
9246 /* We don't copy orig_targs for this because if we have already deduced
9247 some template args from previous args, unify would complain when we
9248 try to deduce a template parameter for the same argument, even though
9249 there isn't really a conflict. */
9250 nargs
= TREE_VEC_LENGTH (targs
);
9251 tempargs
= make_tree_vec (nargs
);
9253 if (unify (tparms
, tempargs
, parm
, arg
, sub_strict
) != 0)
9256 /* First make sure we didn't deduce anything that conflicts with
9257 explicitly specified args. */
9258 for (i
= nargs
; i
--; )
9260 tree elt
= TREE_VEC_ELT (tempargs
, i
);
9261 tree oldelt
= TREE_VEC_ELT (orig_targs
, i
);
9263 if (elt
== NULL_TREE
)
9265 else if (uses_template_parms (elt
))
9267 /* Since we're unifying against ourselves, we will fill in template
9268 args used in the function parm list with our own template parms.
9270 TREE_VEC_ELT (tempargs
, i
) = NULL_TREE
;
9273 else if (oldelt
&& ! template_args_equal (oldelt
, elt
))
9277 for (i
= nargs
; i
--; )
9279 tree elt
= TREE_VEC_ELT (tempargs
, i
);
9282 TREE_VEC_ELT (targs
, i
) = elt
;
9288 /* Verify that nondeduce template argument agrees with the type
9289 obtained from argument deduction. Return nonzero if the
9294 struct A { typedef int X; };
9295 template <class T, class U> struct C {};
9296 template <class T> struct C<T, typename T::X> {};
9298 Then with the instantiation `C<A, int>', we can deduce that
9299 `T' is `A' but unify () does not check whether `typename T::X'
9300 is `int'. This function ensure that they agree.
9302 TARGS, PARMS are the same as the arguments of unify.
9303 ARGS contains template arguments from all levels. */
9306 verify_class_unification (tree targs
, tree parms
, tree args
)
9308 parms
= tsubst (parms
, add_outermost_template_args (args
, targs
),
9309 tf_none
, NULL_TREE
);
9310 if (parms
== error_mark_node
)
9313 return !comp_template_args (parms
, INNERMOST_TEMPLATE_ARGS (args
));
9316 /* PARM is a template class (perhaps with unbound template
9317 parameters). ARG is a fully instantiated type. If ARG can be
9318 bound to PARM, return ARG, otherwise return NULL_TREE. TPARMS and
9319 TARGS are as for unify. */
9322 try_class_unification (tree tparms
, tree targs
, tree parm
, tree arg
)
9326 if (!CLASSTYPE_TEMPLATE_INFO (arg
)
9327 || (most_general_template (CLASSTYPE_TI_TEMPLATE (arg
))
9328 != most_general_template (CLASSTYPE_TI_TEMPLATE (parm
))))
9331 /* We need to make a new template argument vector for the call to
9332 unify. If we used TARGS, we'd clutter it up with the result of
9333 the attempted unification, even if this class didn't work out.
9334 We also don't want to commit ourselves to all the unifications
9335 we've already done, since unification is supposed to be done on
9336 an argument-by-argument basis. In other words, consider the
9337 following pathological case:
9339 template <int I, int J, int K>
9342 template <int I, int J>
9343 struct S<I, J, 2> : public S<I, I, I>, S<J, J, J> {};
9345 template <int I, int J, int K>
9346 void f(S<I, J, K>, S<I, I, I>);
9355 Now, by the time we consider the unification involving `s2', we
9356 already know that we must have `f<0, 0, 0>'. But, even though
9357 `S<0, 1, 2>' is derived from `S<0, 0, 0>', the code is invalid
9358 because there are two ways to unify base classes of S<0, 1, 2>
9359 with S<I, I, I>. If we kept the already deduced knowledge, we
9360 would reject the possibility I=1. */
9361 copy_of_targs
= make_tree_vec (TREE_VEC_LENGTH (targs
));
9363 /* If unification failed, we're done. */
9364 if (unify (tparms
, copy_of_targs
, CLASSTYPE_TI_ARGS (parm
),
9365 CLASSTYPE_TI_ARGS (arg
), UNIFY_ALLOW_NONE
))
9371 /* Subroutine of get_template_base. RVAL, if non-NULL, is a base we
9372 have already discovered to be satisfactory. ARG_BINFO is the binfo
9373 for the base class of ARG that we are currently examining. */
9376 get_template_base_recursive (tree tparms
,
9385 tree arg
= BINFO_TYPE (arg_binfo
);
9387 if (!(flags
& GTB_IGNORE_TYPE
))
9389 tree r
= try_class_unification (tparms
, targs
,
9392 /* If there is more than one satisfactory baseclass, then:
9396 If they yield more than one possible deduced A, the type
9400 if (r
&& rval
&& !same_type_p (r
, rval
))
9401 return error_mark_node
;
9406 binfos
= BINFO_BASE_BINFOS (arg_binfo
);
9407 n_baselinks
= binfos
? TREE_VEC_LENGTH (binfos
) : 0;
9409 /* Process base types. */
9410 for (i
= 0; i
< n_baselinks
; i
++)
9412 tree base_binfo
= TREE_VEC_ELT (binfos
, i
);
9415 /* Skip this base, if we've already seen it. */
9416 if (BINFO_MARKED (base_binfo
))
9420 (flags
& GTB_VIA_VIRTUAL
) || BINFO_VIRTUAL_P (base_binfo
);
9422 /* When searching for a non-virtual, we cannot mark virtually
9425 BINFO_MARKED (base_binfo
) = 1;
9427 rval
= get_template_base_recursive (tparms
, targs
,
9431 GTB_VIA_VIRTUAL
* this_virtual
);
9433 /* If we discovered more than one matching base class, we can
9435 if (rval
== error_mark_node
)
9436 return error_mark_node
;
9442 /* Given a template type PARM and a class type ARG, find the unique
9443 base type in ARG that is an instance of PARM. We do not examine
9444 ARG itself; only its base-classes. If there is no appropriate base
9445 class, return NULL_TREE. If there is more than one, return
9446 error_mark_node. PARM may be the type of a partial specialization,
9447 as well as a plain template type. Used by unify. */
9450 get_template_base (tree tparms
, tree targs
, tree parm
, tree arg
)
9455 my_friendly_assert (IS_AGGR_TYPE_CODE (TREE_CODE (arg
)), 92);
9457 arg_binfo
= TYPE_BINFO (complete_type (arg
));
9458 rval
= get_template_base_recursive (tparms
, targs
,
9463 /* Since get_template_base_recursive marks the bases classes, we
9464 must unmark them here. */
9465 dfs_walk (arg_binfo
, dfs_unmark
, markedp
, 0);
9470 /* Returns the level of DECL, which declares a template parameter. */
9473 template_decl_level (tree decl
)
9475 switch (TREE_CODE (decl
))
9479 return TEMPLATE_TYPE_LEVEL (TREE_TYPE (decl
));
9482 return TEMPLATE_PARM_LEVEL (DECL_INITIAL (decl
));
9490 /* Decide whether ARG can be unified with PARM, considering only the
9491 cv-qualifiers of each type, given STRICT as documented for unify.
9492 Returns nonzero iff the unification is OK on that basis. */
9495 check_cv_quals_for_unify (int strict
, tree arg
, tree parm
)
9497 int arg_quals
= cp_type_quals (arg
);
9498 int parm_quals
= cp_type_quals (parm
);
9500 if (TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
9501 && !(strict
& UNIFY_ALLOW_OUTER_MORE_CV_QUAL
))
9503 /* Although a CVR qualifier is ignored when being applied to a
9504 substituted template parameter ([8.3.2]/1 for example), that
9505 does not apply during deduction [14.8.2.4]/1, (even though
9506 that is not explicitly mentioned, [14.8.2.4]/9 indicates
9507 this). Except when we're allowing additional CV qualifiers
9508 at the outer level [14.8.2.1]/3,1st bullet. */
9509 if ((TREE_CODE (arg
) == REFERENCE_TYPE
9510 || TREE_CODE (arg
) == FUNCTION_TYPE
9511 || TREE_CODE (arg
) == METHOD_TYPE
)
9512 && (parm_quals
& (TYPE_QUAL_CONST
| TYPE_QUAL_VOLATILE
)))
9515 if ((!POINTER_TYPE_P (arg
) && TREE_CODE (arg
) != TEMPLATE_TYPE_PARM
)
9516 && (parm_quals
& TYPE_QUAL_RESTRICT
))
9520 if (!(strict
& (UNIFY_ALLOW_MORE_CV_QUAL
| UNIFY_ALLOW_OUTER_MORE_CV_QUAL
))
9521 && (arg_quals
& parm_quals
) != parm_quals
)
9524 if (!(strict
& (UNIFY_ALLOW_LESS_CV_QUAL
| UNIFY_ALLOW_OUTER_LESS_CV_QUAL
))
9525 && (parm_quals
& arg_quals
) != arg_quals
)
9531 /* Takes parameters as for type_unification. Returns 0 if the
9532 type deduction succeeds, 1 otherwise. The parameter STRICT is a
9533 bitwise or of the following flags:
9536 Require an exact match between PARM and ARG.
9537 UNIFY_ALLOW_MORE_CV_QUAL:
9538 Allow the deduced ARG to be more cv-qualified (by qualification
9539 conversion) than ARG.
9540 UNIFY_ALLOW_LESS_CV_QUAL:
9541 Allow the deduced ARG to be less cv-qualified than ARG.
9542 UNIFY_ALLOW_DERIVED:
9543 Allow the deduced ARG to be a template base class of ARG,
9544 or a pointer to a template base class of the type pointed to by
9546 UNIFY_ALLOW_INTEGER:
9547 Allow any integral type to be deduced. See the TEMPLATE_PARM_INDEX
9548 case for more information.
9549 UNIFY_ALLOW_OUTER_LEVEL:
9550 This is the outermost level of a deduction. Used to determine validity
9551 of qualification conversions. A valid qualification conversion must
9552 have const qualified pointers leading up to the inner type which
9553 requires additional CV quals, except at the outer level, where const
9554 is not required [conv.qual]. It would be normal to set this flag in
9555 addition to setting UNIFY_ALLOW_MORE_CV_QUAL.
9556 UNIFY_ALLOW_OUTER_MORE_CV_QUAL:
9557 This is the outermost level of a deduction, and PARM can be more CV
9558 qualified at this point.
9559 UNIFY_ALLOW_OUTER_LESS_CV_QUAL:
9560 This is the outermost level of a deduction, and PARM can be less CV
9561 qualified at this point.
9562 UNIFY_ALLOW_MAX_CORRECTION:
9563 This is an INTEGER_TYPE's maximum value. Used if the range may
9564 have been derived from a size specification, such as an array size.
9565 If the size was given by a nontype template parameter N, the maximum
9566 value will have the form N-1. The flag says that we can (and indeed
9567 must) unify N with (ARG + 1), an exception to the normal rules on
9571 unify (tree tparms
, tree targs
, tree parm
, tree arg
, int strict
)
9576 int strict_in
= strict
;
9578 /* I don't think this will do the right thing with respect to types.
9579 But the only case I've seen it in so far has been array bounds, where
9580 signedness is the only information lost, and I think that will be
9582 while (TREE_CODE (parm
) == NOP_EXPR
)
9583 parm
= TREE_OPERAND (parm
, 0);
9585 if (arg
== error_mark_node
)
9587 if (arg
== unknown_type_node
)
9588 /* We can't deduce anything from this, but we might get all the
9589 template args from other function args. */
9592 /* If PARM uses template parameters, then we can't bail out here,
9593 even if ARG == PARM, since we won't record unifications for the
9594 template parameters. We might need them if we're trying to
9595 figure out which of two things is more specialized. */
9596 if (arg
== parm
&& !uses_template_parms (parm
))
9599 /* Immediately reject some pairs that won't unify because of
9600 cv-qualification mismatches. */
9601 if (TREE_CODE (arg
) == TREE_CODE (parm
)
9603 /* It is the elements of the array which hold the cv quals of an array
9604 type, and the elements might be template type parms. We'll check
9606 && TREE_CODE (arg
) != ARRAY_TYPE
9607 /* We check the cv-qualifiers when unifying with template type
9608 parameters below. We want to allow ARG `const T' to unify with
9609 PARM `T' for example, when computing which of two templates
9610 is more specialized, for example. */
9611 && TREE_CODE (arg
) != TEMPLATE_TYPE_PARM
9612 && !check_cv_quals_for_unify (strict_in
, arg
, parm
))
9615 if (!(strict
& UNIFY_ALLOW_OUTER_LEVEL
)
9616 && TYPE_P (parm
) && !CP_TYPE_CONST_P (parm
))
9617 strict
&= ~UNIFY_ALLOW_MORE_CV_QUAL
;
9618 strict
&= ~UNIFY_ALLOW_OUTER_LEVEL
;
9619 strict
&= ~UNIFY_ALLOW_DERIVED
;
9620 strict
&= ~UNIFY_ALLOW_OUTER_MORE_CV_QUAL
;
9621 strict
&= ~UNIFY_ALLOW_OUTER_LESS_CV_QUAL
;
9622 strict
&= ~UNIFY_ALLOW_MAX_CORRECTION
;
9624 switch (TREE_CODE (parm
))
9628 case UNBOUND_CLASS_TEMPLATE
:
9629 /* In a type which contains a nested-name-specifier, template
9630 argument values cannot be deduced for template parameters used
9631 within the nested-name-specifier. */
9634 case TEMPLATE_TYPE_PARM
:
9635 case TEMPLATE_TEMPLATE_PARM
:
9636 case BOUND_TEMPLATE_TEMPLATE_PARM
:
9637 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, 0));
9639 if (TEMPLATE_TYPE_LEVEL (parm
)
9640 != template_decl_level (tparm
))
9641 /* The PARM is not one we're trying to unify. Just check
9642 to see if it matches ARG. */
9643 return (TREE_CODE (arg
) == TREE_CODE (parm
)
9644 && same_type_p (parm
, arg
)) ? 0 : 1;
9645 idx
= TEMPLATE_TYPE_IDX (parm
);
9646 targ
= TREE_VEC_ELT (targs
, idx
);
9647 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, idx
));
9649 /* Check for mixed types and values. */
9650 if ((TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
9651 && TREE_CODE (tparm
) != TYPE_DECL
)
9652 || (TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
9653 && TREE_CODE (tparm
) != TEMPLATE_DECL
))
9656 if (TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
9658 /* ARG must be constructed from a template class or a template
9659 template parameter. */
9660 if (TREE_CODE (arg
) != BOUND_TEMPLATE_TEMPLATE_PARM
9661 && (TREE_CODE (arg
) != RECORD_TYPE
|| !CLASSTYPE_TEMPLATE_INFO (arg
)))
9665 tree parmtmpl
= TYPE_TI_TEMPLATE (parm
);
9666 tree parmvec
= TYPE_TI_ARGS (parm
);
9667 tree argvec
= TYPE_TI_ARGS (arg
);
9669 = DECL_INNERMOST_TEMPLATE_PARMS (TYPE_TI_TEMPLATE (arg
));
9672 /* The parameter and argument roles have to be switched here
9673 in order to handle default arguments properly. For example,
9674 template<template <class> class TT> void f(TT<int>)
9675 should be able to accept vector<int> which comes from
9676 template <class T, class Allocator = allocator>
9679 if (coerce_template_parms (argtmplvec
, parmvec
, parmtmpl
, 0, 1)
9683 /* Deduce arguments T, i from TT<T> or TT<i>.
9684 We check each element of PARMVEC and ARGVEC individually
9685 rather than the whole TREE_VEC since they can have
9686 different number of elements. */
9688 for (i
= 0; i
< TREE_VEC_LENGTH (parmvec
); ++i
)
9690 tree t
= TREE_VEC_ELT (parmvec
, i
);
9692 if (unify (tparms
, targs
, t
,
9693 TREE_VEC_ELT (argvec
, i
),
9698 arg
= TYPE_TI_TEMPLATE (arg
);
9700 /* Fall through to deduce template name. */
9703 if (TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
9704 || TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
9706 /* Deduce template name TT from TT, TT<>, TT<T> and TT<i>. */
9708 /* Simple cases: Value already set, does match or doesn't. */
9709 if (targ
!= NULL_TREE
&& template_args_equal (targ
, arg
))
9716 /* If PARM is `const T' and ARG is only `int', we don't have
9717 a match unless we are allowing additional qualification.
9718 If ARG is `const int' and PARM is just `T' that's OK;
9719 that binds `const int' to `T'. */
9720 if (!check_cv_quals_for_unify (strict_in
| UNIFY_ALLOW_LESS_CV_QUAL
,
9724 /* Consider the case where ARG is `const volatile int' and
9725 PARM is `const T'. Then, T should be `volatile int'. */
9726 arg
= cp_build_qualified_type_real
9727 (arg
, cp_type_quals (arg
) & ~cp_type_quals (parm
), tf_none
);
9728 if (arg
== error_mark_node
)
9731 /* Simple cases: Value already set, does match or doesn't. */
9732 if (targ
!= NULL_TREE
&& same_type_p (targ
, arg
))
9737 /* Make sure that ARG is not a variable-sized array. (Note
9738 that were talking about variable-sized arrays (like
9739 `int[n]'), rather than arrays of unknown size (like
9740 `int[]').) We'll get very confused by such a type since
9741 the bound of the array will not be computable in an
9742 instantiation. Besides, such types are not allowed in
9743 ISO C++, so we can do as we please here. */
9744 if (variably_modified_type_p (arg
, NULL_TREE
))
9748 TREE_VEC_ELT (targs
, idx
) = arg
;
9751 case TEMPLATE_PARM_INDEX
:
9752 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, 0));
9754 if (TEMPLATE_PARM_LEVEL (parm
)
9755 != template_decl_level (tparm
))
9756 /* The PARM is not one we're trying to unify. Just check
9757 to see if it matches ARG. */
9758 return !(TREE_CODE (arg
) == TREE_CODE (parm
)
9759 && cp_tree_equal (parm
, arg
));
9761 idx
= TEMPLATE_PARM_IDX (parm
);
9762 targ
= TREE_VEC_ELT (targs
, idx
);
9765 return !cp_tree_equal (targ
, arg
);
9767 /* [temp.deduct.type] If, in the declaration of a function template
9768 with a non-type template-parameter, the non-type
9769 template-parameter is used in an expression in the function
9770 parameter-list and, if the corresponding template-argument is
9771 deduced, the template-argument type shall match the type of the
9772 template-parameter exactly, except that a template-argument
9773 deduced from an array bound may be of any integral type.
9774 The non-type parameter might use already deduced type parameters. */
9775 tparm
= tsubst (TREE_TYPE (parm
), targs
, 0, NULL_TREE
);
9776 if (!TREE_TYPE (arg
))
9777 /* Template-parameter dependent expression. Just accept it for now.
9778 It will later be processed in convert_template_argument. */
9780 else if (same_type_p (TREE_TYPE (arg
), tparm
))
9782 else if ((strict
& UNIFY_ALLOW_INTEGER
)
9783 && (TREE_CODE (tparm
) == INTEGER_TYPE
9784 || TREE_CODE (tparm
) == BOOLEAN_TYPE
))
9786 else if (uses_template_parms (tparm
))
9787 /* We haven't deduced the type of this parameter yet. Try again
9793 TREE_VEC_ELT (targs
, idx
) = arg
;
9798 /* A pointer-to-member constant can be unified only with
9799 another constant. */
9800 if (TREE_CODE (arg
) != PTRMEM_CST
)
9803 /* Just unify the class member. It would be useless (and possibly
9804 wrong, depending on the strict flags) to unify also
9805 PTRMEM_CST_CLASS, because we want to be sure that both parm and
9806 arg refer to the same variable, even if through different
9807 classes. For instance:
9809 struct A { int x; };
9812 Unification of &A::x and &B::x must succeed. */
9813 return unify (tparms
, targs
, PTRMEM_CST_MEMBER (parm
),
9814 PTRMEM_CST_MEMBER (arg
), strict
);
9819 if (TREE_CODE (arg
) != POINTER_TYPE
)
9822 /* [temp.deduct.call]
9824 A can be another pointer or pointer to member type that can
9825 be converted to the deduced A via a qualification
9826 conversion (_conv.qual_).
9828 We pass down STRICT here rather than UNIFY_ALLOW_NONE.
9829 This will allow for additional cv-qualification of the
9830 pointed-to types if appropriate. */
9832 if (TREE_CODE (TREE_TYPE (arg
)) == RECORD_TYPE
)
9833 /* The derived-to-base conversion only persists through one
9834 level of pointers. */
9835 strict
|= (strict_in
& UNIFY_ALLOW_DERIVED
);
9837 return unify (tparms
, targs
, TREE_TYPE (parm
),
9838 TREE_TYPE (arg
), strict
);
9841 case REFERENCE_TYPE
:
9842 if (TREE_CODE (arg
) != REFERENCE_TYPE
)
9844 return unify (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
9845 strict
& UNIFY_ALLOW_MORE_CV_QUAL
);
9848 if (TREE_CODE (arg
) != ARRAY_TYPE
)
9850 if ((TYPE_DOMAIN (parm
) == NULL_TREE
)
9851 != (TYPE_DOMAIN (arg
) == NULL_TREE
))
9853 if (TYPE_DOMAIN (parm
) != NULL_TREE
9854 && unify (tparms
, targs
, TYPE_DOMAIN (parm
),
9855 TYPE_DOMAIN (arg
), UNIFY_ALLOW_NONE
) != 0)
9857 return unify (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
9858 strict
& UNIFY_ALLOW_MORE_CV_QUAL
);
9866 if (TREE_CODE (arg
) != TREE_CODE (parm
))
9869 if (TREE_CODE (parm
) == INTEGER_TYPE
9870 && TREE_CODE (TYPE_MAX_VALUE (parm
)) != INTEGER_CST
)
9872 if (TYPE_MIN_VALUE (parm
) && TYPE_MIN_VALUE (arg
)
9873 && unify (tparms
, targs
, TYPE_MIN_VALUE (parm
),
9874 TYPE_MIN_VALUE (arg
), UNIFY_ALLOW_INTEGER
))
9876 if (TYPE_MAX_VALUE (parm
) && TYPE_MAX_VALUE (arg
)
9877 && unify (tparms
, targs
, TYPE_MAX_VALUE (parm
),
9878 TYPE_MAX_VALUE (arg
),
9879 UNIFY_ALLOW_INTEGER
| UNIFY_ALLOW_MAX_CORRECTION
))
9882 /* We have already checked cv-qualification at the top of the
9884 else if (!same_type_ignoring_top_level_qualifiers_p (arg
, parm
))
9887 /* As far as unification is concerned, this wins. Later checks
9888 will invalidate it if necessary. */
9891 /* Types INTEGER_CST and MINUS_EXPR can come from array bounds. */
9892 /* Type INTEGER_CST can come from ordinary constant template args. */
9894 while (TREE_CODE (arg
) == NOP_EXPR
)
9895 arg
= TREE_OPERAND (arg
, 0);
9897 if (TREE_CODE (arg
) != INTEGER_CST
)
9899 return !tree_int_cst_equal (parm
, arg
);
9904 if (TREE_CODE (arg
) != TREE_VEC
)
9906 if (TREE_VEC_LENGTH (parm
) != TREE_VEC_LENGTH (arg
))
9908 for (i
= 0; i
< TREE_VEC_LENGTH (parm
); ++i
)
9909 if (unify (tparms
, targs
,
9910 TREE_VEC_ELT (parm
, i
), TREE_VEC_ELT (arg
, i
),
9918 if (TREE_CODE (arg
) != TREE_CODE (parm
))
9921 if (TYPE_PTRMEMFUNC_P (parm
))
9923 if (!TYPE_PTRMEMFUNC_P (arg
))
9926 return unify (tparms
, targs
,
9927 TYPE_PTRMEMFUNC_FN_TYPE (parm
),
9928 TYPE_PTRMEMFUNC_FN_TYPE (arg
),
9932 if (CLASSTYPE_TEMPLATE_INFO (parm
))
9936 if (strict_in
& UNIFY_ALLOW_DERIVED
)
9938 /* First, we try to unify the PARM and ARG directly. */
9939 t
= try_class_unification (tparms
, targs
,
9944 /* Fallback to the special case allowed in
9947 If P is a class, and P has the form
9948 template-id, then A can be a derived class of
9949 the deduced A. Likewise, if P is a pointer to
9950 a class of the form template-id, A can be a
9951 pointer to a derived class pointed to by the
9953 t
= get_template_base (tparms
, targs
,
9956 if (! t
|| t
== error_mark_node
)
9960 else if (CLASSTYPE_TEMPLATE_INFO (arg
)
9961 && (CLASSTYPE_TI_TEMPLATE (parm
)
9962 == CLASSTYPE_TI_TEMPLATE (arg
)))
9963 /* Perhaps PARM is something like S<U> and ARG is S<int>.
9964 Then, we should unify `int' and `U'. */
9967 /* There's no chance of unification succeeding. */
9970 return unify (tparms
, targs
, CLASSTYPE_TI_ARGS (parm
),
9971 CLASSTYPE_TI_ARGS (t
), UNIFY_ALLOW_NONE
);
9973 else if (!same_type_ignoring_top_level_qualifiers_p (parm
, arg
))
9979 if (TREE_CODE (arg
) != TREE_CODE (parm
))
9982 if (unify (tparms
, targs
, TREE_TYPE (parm
),
9983 TREE_TYPE (arg
), UNIFY_ALLOW_NONE
))
9985 return type_unification_real (tparms
, targs
, TYPE_ARG_TYPES (parm
),
9986 TYPE_ARG_TYPES (arg
), 1,
9987 DEDUCE_EXACT
, 0, -1);
9990 if (TREE_CODE (arg
) != OFFSET_TYPE
)
9992 if (unify (tparms
, targs
, TYPE_OFFSET_BASETYPE (parm
),
9993 TYPE_OFFSET_BASETYPE (arg
), UNIFY_ALLOW_NONE
))
9995 return unify (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
9999 if (DECL_TEMPLATE_PARM_P (parm
))
10000 return unify (tparms
, targs
, DECL_INITIAL (parm
), arg
, strict
);
10001 if (arg
!= decl_constant_value (parm
))
10006 case TEMPLATE_DECL
:
10007 /* Matched cases are handled by the ARG == PARM test above. */
10011 if (tree_int_cst_equal (TREE_OPERAND (parm
, 1), integer_one_node
)
10012 && (strict_in
& UNIFY_ALLOW_MAX_CORRECTION
))
10014 /* We handle this case specially, since it comes up with
10015 arrays. In particular, something like:
10017 template <int N> void f(int (&x)[N]);
10019 Here, we are trying to unify the range type, which
10020 looks like [0 ... (N - 1)]. */
10022 t1
= TREE_OPERAND (parm
, 0);
10023 t2
= TREE_OPERAND (parm
, 1);
10025 t
= fold (build (PLUS_EXPR
, integer_type_node
, arg
, t2
));
10027 return unify (tparms
, targs
, t1
, t
, strict
);
10029 /* Else fall through. */
10032 if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (TREE_CODE (parm
))))
10035 /* We're looking at an expression. This can happen with
10039 void foo(S<I>, S<I + 2>);
10041 This is a "nondeduced context":
10045 The nondeduced contexts are:
10047 --A type that is a template-id in which one or more of
10048 the template-arguments is an expression that references
10049 a template-parameter.
10051 In these cases, we assume deduction succeeded, but don't
10052 actually infer any unifications. */
10054 if (!uses_template_parms (parm
)
10055 && !template_args_equal (parm
, arg
))
10061 sorry ("use of `%s' in template type unification",
10062 tree_code_name
[(int) TREE_CODE (parm
)]);
10068 /* Called if RESULT is explicitly instantiated, or is a member of an
10069 explicitly instantiated class, or if using -frepo and the
10070 instantiation of RESULT has been assigned to this file. */
10073 mark_decl_instantiated (tree result
, int extern_p
)
10075 SET_DECL_EXPLICIT_INSTANTIATION (result
);
10077 /* If this entity has already been written out, it's too late to
10078 make any modifications. */
10079 if (TREE_ASM_WRITTEN (result
))
10082 if (TREE_CODE (result
) != FUNCTION_DECL
)
10083 /* The TREE_PUBLIC flag for function declarations will have been
10084 set correctly by tsubst. */
10085 TREE_PUBLIC (result
) = 1;
10087 /* This might have been set by an earlier implicit instantiation. */
10088 DECL_COMDAT (result
) = 0;
10092 DECL_INTERFACE_KNOWN (result
) = 1;
10093 DECL_NOT_REALLY_EXTERN (result
) = 1;
10095 /* Always make artificials weak. */
10096 if (DECL_ARTIFICIAL (result
) && flag_weak
)
10097 comdat_linkage (result
);
10098 /* For WIN32 we also want to put explicit instantiations in
10099 linkonce sections. */
10100 else if (TREE_PUBLIC (result
))
10101 maybe_make_one_only (result
);
10105 /* Given two function templates PAT1 and PAT2, return:
10107 DEDUCE should be DEDUCE_EXACT or DEDUCE_ORDER.
10109 1 if PAT1 is more specialized than PAT2 as described in [temp.func.order].
10110 -1 if PAT2 is more specialized than PAT1.
10111 0 if neither is more specialized.
10113 LEN is passed through to fn_type_unification. */
10116 more_specialized (tree pat1
, tree pat2
, int deduce
, int len
)
10121 /* If template argument deduction succeeds, we substitute the
10122 resulting arguments into non-deduced contexts. While doing that,
10123 we must be aware that we may encounter dependent types. */
10124 ++processing_template_decl
;
10125 targs
= get_bindings_real (pat1
, DECL_TEMPLATE_RESULT (pat2
),
10126 NULL_TREE
, 0, deduce
, len
);
10130 targs
= get_bindings_real (pat2
, DECL_TEMPLATE_RESULT (pat1
),
10131 NULL_TREE
, 0, deduce
, len
);
10134 --processing_template_decl
;
10139 /* Given two class template specialization list nodes PAT1 and PAT2, return:
10141 1 if PAT1 is more specialized than PAT2 as described in [temp.class.order].
10142 -1 if PAT2 is more specialized than PAT1.
10143 0 if neither is more specialized.
10145 FULL_ARGS is the full set of template arguments that triggers this
10146 partial ordering. */
10149 more_specialized_class (tree pat1
, tree pat2
, tree full_args
)
10154 /* Just like what happens for functions, if we are ordering between
10155 different class template specializations, we may encounter dependent
10156 types in the arguments, and we need our dependency check functions
10157 to behave correctly. */
10158 ++processing_template_decl
;
10159 targs
= get_class_bindings (TREE_VALUE (pat1
), TREE_PURPOSE (pat1
),
10160 add_outermost_template_args (full_args
, TREE_PURPOSE (pat2
)));
10164 targs
= get_class_bindings (TREE_VALUE (pat2
), TREE_PURPOSE (pat2
),
10165 add_outermost_template_args (full_args
, TREE_PURPOSE (pat1
)));
10168 --processing_template_decl
;
10173 /* Return the template arguments that will produce the function signature
10174 DECL from the function template FN, with the explicit template
10175 arguments EXPLICIT_ARGS. If CHECK_RETTYPE is 1, the return type must
10176 also match. Return NULL_TREE if no satisfactory arguments could be
10177 found. DEDUCE and LEN are passed through to fn_type_unification. */
10180 get_bindings_real (tree fn
,
10182 tree explicit_args
,
10187 int ntparms
= DECL_NTPARMS (fn
);
10188 tree targs
= make_tree_vec (ntparms
);
10190 tree decl_arg_types
;
10193 /* Substitute the explicit template arguments into the type of DECL.
10194 The call to fn_type_unification will handle substitution into the
10196 decl_type
= TREE_TYPE (decl
);
10197 if (explicit_args
&& uses_template_parms (decl_type
))
10200 tree converted_args
;
10202 if (DECL_TEMPLATE_INFO (decl
))
10203 tmpl
= DECL_TI_TEMPLATE (decl
);
10205 /* We can get here for some invalid specializations. */
10209 = (coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (tmpl
),
10210 explicit_args
, NULL_TREE
,
10211 tf_none
, /*require_all_arguments=*/0));
10212 if (converted_args
== error_mark_node
)
10215 decl_type
= tsubst (decl_type
, converted_args
, tf_none
, NULL_TREE
);
10216 if (decl_type
== error_mark_node
)
10220 decl_arg_types
= TYPE_ARG_TYPES (decl_type
);
10221 /* Never do unification on the 'this' parameter. */
10222 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
10223 decl_arg_types
= TREE_CHAIN (decl_arg_types
);
10225 i
= fn_type_unification (fn
, explicit_args
, targs
,
10227 (check_rettype
|| DECL_CONV_FN_P (fn
)
10228 ? TREE_TYPE (decl_type
) : NULL_TREE
),
10237 /* For most uses, we want to check the return type. */
10240 get_bindings (tree fn
, tree decl
, tree explicit_args
)
10242 return get_bindings_real (fn
, decl
, explicit_args
, 1, DEDUCE_EXACT
, -1);
10245 /* But for resolve_overloaded_unification, we only care about the parameter
10249 get_bindings_overload (tree fn
, tree decl
, tree explicit_args
)
10251 return get_bindings_real (fn
, decl
, explicit_args
, 0, DEDUCE_EXACT
, -1);
10254 /* Return the innermost template arguments that, when applied to a
10255 template specialization whose innermost template parameters are
10256 TPARMS, and whose specialization arguments are PARMS, yield the
10259 For example, suppose we have:
10261 template <class T, class U> struct S {};
10262 template <class T> struct S<T*, int> {};
10264 Then, suppose we want to get `S<double*, int>'. The TPARMS will be
10265 {T}, the PARMS will be {T*, int} and the ARGS will be {double*,
10266 int}. The resulting vector will be {double}, indicating that `T'
10267 is bound to `double'. */
10270 get_class_bindings (tree tparms
, tree parms
, tree args
)
10272 int i
, ntparms
= TREE_VEC_LENGTH (tparms
);
10273 tree vec
= make_tree_vec (ntparms
);
10275 if (unify (tparms
, vec
, parms
, INNERMOST_TEMPLATE_ARGS (args
),
10279 for (i
= 0; i
< ntparms
; ++i
)
10280 if (! TREE_VEC_ELT (vec
, i
))
10283 if (verify_class_unification (vec
, parms
, args
))
10289 /* In INSTANTIATIONS is a list of <INSTANTIATION, TEMPLATE> pairs.
10290 Pick the most specialized template, and return the corresponding
10291 instantiation, or if there is no corresponding instantiation, the
10292 template itself. If there is no most specialized template,
10293 error_mark_node is returned. If there are no templates at all,
10294 NULL_TREE is returned. */
10297 most_specialized_instantiation (tree instantiations
)
10302 if (!instantiations
)
10305 champ
= instantiations
;
10306 for (fn
= TREE_CHAIN (instantiations
); fn
; fn
= TREE_CHAIN (fn
))
10308 fate
= more_specialized (TREE_VALUE (champ
), TREE_VALUE (fn
),
10316 fn
= TREE_CHAIN (fn
);
10318 return error_mark_node
;
10324 for (fn
= instantiations
; fn
&& fn
!= champ
; fn
= TREE_CHAIN (fn
))
10326 fate
= more_specialized (TREE_VALUE (champ
), TREE_VALUE (fn
),
10329 return error_mark_node
;
10332 return TREE_PURPOSE (champ
) ? TREE_PURPOSE (champ
) : TREE_VALUE (champ
);
10335 /* Return the most specialized of the list of templates in FNS that can
10336 produce an instantiation matching DECL, given the explicit template
10337 arguments EXPLICIT_ARGS. */
10340 most_specialized (tree fns
, tree decl
, tree explicit_args
)
10342 tree candidates
= NULL_TREE
;
10345 for (fn
= fns
; fn
; fn
= TREE_CHAIN (fn
))
10347 tree candidate
= TREE_VALUE (fn
);
10349 args
= get_bindings (candidate
, decl
, explicit_args
);
10351 candidates
= tree_cons (NULL_TREE
, candidate
, candidates
);
10354 return most_specialized_instantiation (candidates
);
10357 /* If DECL is a specialization of some template, return the most
10358 general such template. Otherwise, returns NULL_TREE.
10360 For example, given:
10362 template <class T> struct S { template <class U> void f(U); };
10364 if TMPL is `template <class U> void S<int>::f(U)' this will return
10365 the full template. This function will not trace past partial
10366 specializations, however. For example, given in addition:
10368 template <class T> struct S<T*> { template <class U> void f(U); };
10370 if TMPL is `template <class U> void S<int*>::f(U)' this will return
10371 `template <class T> template <class U> S<T*>::f(U)'. */
10374 most_general_template (tree decl
)
10376 /* If DECL is a FUNCTION_DECL, find the TEMPLATE_DECL of which it is
10377 an immediate specialization. */
10378 if (TREE_CODE (decl
) == FUNCTION_DECL
)
10380 if (DECL_TEMPLATE_INFO (decl
)) {
10381 decl
= DECL_TI_TEMPLATE (decl
);
10383 /* The DECL_TI_TEMPLATE can be an IDENTIFIER_NODE for a
10384 template friend. */
10385 if (TREE_CODE (decl
) != TEMPLATE_DECL
)
10391 /* Look for more and more general templates. */
10392 while (DECL_TEMPLATE_INFO (decl
))
10394 /* The DECL_TI_TEMPLATE can be an IDENTIFIER_NODE in some cases.
10395 (See cp-tree.h for details.) */
10396 if (TREE_CODE (DECL_TI_TEMPLATE (decl
)) != TEMPLATE_DECL
)
10399 if (CLASS_TYPE_P (TREE_TYPE (decl
))
10400 && CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_TYPE (decl
)))
10403 /* Stop if we run into an explicitly specialized class template. */
10404 if (!DECL_NAMESPACE_SCOPE_P (decl
)
10405 && DECL_CONTEXT (decl
)
10406 && CLASSTYPE_TEMPLATE_SPECIALIZATION (DECL_CONTEXT (decl
)))
10409 decl
= DECL_TI_TEMPLATE (decl
);
10415 /* Return the most specialized of the class template specializations
10416 of TMPL which can produce an instantiation matching ARGS, or
10417 error_mark_node if the choice is ambiguous. */
10420 most_specialized_class (tree tmpl
, tree args
)
10422 tree list
= NULL_TREE
;
10427 tmpl
= most_general_template (tmpl
);
10428 for (t
= DECL_TEMPLATE_SPECIALIZATIONS (tmpl
); t
; t
= TREE_CHAIN (t
))
10431 = get_class_bindings (TREE_VALUE (t
), TREE_PURPOSE (t
), args
);
10434 list
= tree_cons (TREE_PURPOSE (t
), TREE_VALUE (t
), list
);
10435 TREE_TYPE (list
) = TREE_TYPE (t
);
10444 t
= TREE_CHAIN (t
);
10445 for (; t
; t
= TREE_CHAIN (t
))
10447 fate
= more_specialized_class (champ
, t
, args
);
10454 t
= TREE_CHAIN (t
);
10456 return error_mark_node
;
10462 for (t
= list
; t
&& t
!= champ
; t
= TREE_CHAIN (t
))
10464 fate
= more_specialized_class (champ
, t
, args
);
10466 return error_mark_node
;
10472 /* Explicitly instantiate DECL. */
10475 do_decl_instantiation (tree decl
, tree storage
)
10477 tree result
= NULL_TREE
;
10481 /* An error occurred, for which grokdeclarator has already issued
10482 an appropriate message. */
10484 else if (! DECL_LANG_SPECIFIC (decl
))
10486 error ("explicit instantiation of non-template `%#D'", decl
);
10489 else if (TREE_CODE (decl
) == VAR_DECL
)
10491 /* There is an asymmetry here in the way VAR_DECLs and
10492 FUNCTION_DECLs are handled by grokdeclarator. In the case of
10493 the latter, the DECL we get back will be marked as a
10494 template instantiation, and the appropriate
10495 DECL_TEMPLATE_INFO will be set up. This does not happen for
10496 VAR_DECLs so we do the lookup here. Probably, grokdeclarator
10497 should handle VAR_DECLs as it currently handles
10499 result
= lookup_field (DECL_CONTEXT (decl
), DECL_NAME (decl
), 0, false);
10500 if (!result
|| TREE_CODE (result
) != VAR_DECL
)
10502 error ("no matching template for `%D' found", decl
);
10506 else if (TREE_CODE (decl
) != FUNCTION_DECL
)
10508 error ("explicit instantiation of `%#D'", decl
);
10514 /* Check for various error cases. Note that if the explicit
10515 instantiation is valid the RESULT will currently be marked as an
10516 *implicit* instantiation; DECL_EXPLICIT_INSTANTIATION is not set
10517 until we get here. */
10519 if (DECL_TEMPLATE_SPECIALIZATION (result
))
10521 /* DR 259 [temp.spec].
10523 Both an explicit instantiation and a declaration of an explicit
10524 specialization shall not appear in a program unless the explicit
10525 instantiation follows a declaration of the explicit specialization.
10527 For a given set of template parameters, if an explicit
10528 instantiation of a template appears after a declaration of an
10529 explicit specialization for that template, the explicit
10530 instantiation has no effect. */
10533 else if (DECL_EXPLICIT_INSTANTIATION (result
))
10537 No program shall explicitly instantiate any template more
10540 We check DECL_INTERFACE_KNOWN so as not to complain when the first
10541 instantiation was `extern' and the second is not, and EXTERN_P for
10542 the opposite case. If -frepo, chances are we already got marked
10543 as an explicit instantiation because of the repo file. */
10544 if (DECL_INTERFACE_KNOWN (result
) && !extern_p
&& !flag_use_repository
)
10545 pedwarn ("duplicate explicit instantiation of `%#D'", result
);
10547 /* If we've already instantiated the template, just return now. */
10548 if (DECL_INTERFACE_KNOWN (result
))
10551 else if (!DECL_IMPLICIT_INSTANTIATION (result
))
10553 error ("no matching template for `%D' found", result
);
10556 else if (!DECL_TEMPLATE_INFO (result
))
10558 pedwarn ("explicit instantiation of non-template `%#D'", result
);
10562 if (storage
== NULL_TREE
)
10564 else if (storage
== ridpointers
[(int) RID_EXTERN
])
10566 if (pedantic
&& !in_system_header
)
10567 pedwarn ("ISO C++ forbids the use of `extern' on explicit instantiations");
10571 error ("storage class `%D' applied to template instantiation",
10574 mark_decl_instantiated (result
, extern_p
);
10575 repo_template_instantiated (result
, extern_p
);
10577 instantiate_decl (result
, /*defer_ok=*/1, /*undefined_ok=*/0);
10581 mark_class_instantiated (tree t
, int extern_p
)
10583 SET_CLASSTYPE_EXPLICIT_INSTANTIATION (t
);
10584 SET_CLASSTYPE_INTERFACE_KNOWN (t
);
10585 CLASSTYPE_INTERFACE_ONLY (t
) = extern_p
;
10586 TYPE_DECL_SUPPRESS_DEBUG (TYPE_NAME (t
)) = extern_p
;
10589 CLASSTYPE_DEBUG_REQUESTED (t
) = 1;
10590 rest_of_type_compilation (t
, 1);
10594 /* Called from do_type_instantiation through binding_table_foreach to
10595 do recursive instantiation for the type bound in ENTRY. */
10597 bt_instantiate_type_proc (binding_entry entry
, void *data
)
10599 tree storage
= *(tree
*) data
;
10601 if (IS_AGGR_TYPE (entry
->type
)
10602 && !uses_template_parms (CLASSTYPE_TI_ARGS (entry
->type
)))
10603 do_type_instantiation (TYPE_MAIN_DECL (entry
->type
), storage
, 0);
10606 /* Called from do_type_instantiation to instantiate a member
10607 (a member function or a static member variable) of an
10608 explicitly instantiated class template. */
10610 instantiate_class_member (tree decl
, int extern_p
)
10612 mark_decl_instantiated (decl
, extern_p
);
10613 repo_template_instantiated (decl
, extern_p
);
10615 instantiate_decl (decl
, /*defer_ok=*/1, /* undefined_ok=*/1);
10618 /* Perform an explicit instantiation of template class T. STORAGE, if
10619 non-null, is the RID for extern, inline or static. COMPLAIN is
10620 nonzero if this is called from the parser, zero if called recursively,
10621 since the standard is unclear (as detailed below). */
10624 do_type_instantiation (tree t
, tree storage
, tsubst_flags_t complain
)
10629 int previous_instantiation_extern_p
= 0;
10631 if (TREE_CODE (t
) == TYPE_DECL
)
10634 if (! CLASS_TYPE_P (t
) || ! CLASSTYPE_TEMPLATE_INFO (t
))
10636 error ("explicit instantiation of non-template type `%T'", t
);
10642 if (!COMPLETE_TYPE_P (t
))
10644 if (complain
& tf_error
)
10645 error ("explicit instantiation of `%#T' before definition of template",
10650 if (storage
!= NULL_TREE
)
10652 if (pedantic
&& !in_system_header
)
10653 pedwarn("ISO C++ forbids the use of `%E' on explicit instantiations",
10656 if (storage
== ridpointers
[(int) RID_INLINE
])
10658 else if (storage
== ridpointers
[(int) RID_EXTERN
])
10660 else if (storage
== ridpointers
[(int) RID_STATIC
])
10664 error ("storage class `%D' applied to template instantiation",
10670 if (CLASSTYPE_TEMPLATE_SPECIALIZATION (t
))
10672 /* DR 259 [temp.spec].
10674 Both an explicit instantiation and a declaration of an explicit
10675 specialization shall not appear in a program unless the explicit
10676 instantiation follows a declaration of the explicit specialization.
10678 For a given set of template parameters, if an explicit
10679 instantiation of a template appears after a declaration of an
10680 explicit specialization for that template, the explicit
10681 instantiation has no effect. */
10684 else if (CLASSTYPE_EXPLICIT_INSTANTIATION (t
))
10688 No program shall explicitly instantiate any template more
10691 If PREVIOUS_INSTANTIATION_EXTERN_P, then the first explicit
10692 instantiation was `extern'. If EXTERN_P then the second is.
10693 If -frepo, chances are we already got marked as an explicit
10694 instantiation because of the repo file. All these cases are
10697 previous_instantiation_extern_p
= CLASSTYPE_INTERFACE_ONLY (t
);
10699 if (!previous_instantiation_extern_p
&& !extern_p
10700 && !flag_use_repository
10701 && (complain
& tf_error
))
10702 pedwarn ("duplicate explicit instantiation of `%#T'", t
);
10704 /* If we've already instantiated the template, just return now. */
10705 if (!CLASSTYPE_INTERFACE_ONLY (t
))
10709 mark_class_instantiated (t
, extern_p
);
10710 repo_template_instantiated (t
, extern_p
);
10718 /* In contrast to implicit instantiation, where only the
10719 declarations, and not the definitions, of members are
10720 instantiated, we have here:
10724 The explicit instantiation of a class template specialization
10725 implies the instantiation of all of its members not
10726 previously explicitly specialized in the translation unit
10727 containing the explicit instantiation.
10729 Of course, we can't instantiate member template classes, since
10730 we don't have any arguments for them. Note that the standard
10731 is unclear on whether the instantiation of the members are
10732 *explicit* instantiations or not. However, the most natural
10733 interpretation is that it should be an explicit instantiation. */
10736 for (tmp
= TYPE_METHODS (t
); tmp
; tmp
= TREE_CHAIN (tmp
))
10737 if (TREE_CODE (tmp
) == FUNCTION_DECL
10738 && DECL_TEMPLATE_INSTANTIATION (tmp
))
10739 instantiate_class_member (tmp
, extern_p
);
10741 for (tmp
= TYPE_FIELDS (t
); tmp
; tmp
= TREE_CHAIN (tmp
))
10742 if (TREE_CODE (tmp
) == VAR_DECL
&& DECL_TEMPLATE_INSTANTIATION (tmp
))
10743 instantiate_class_member (tmp
, extern_p
);
10745 if (CLASSTYPE_NESTED_UTDS (t
))
10746 binding_table_foreach (CLASSTYPE_NESTED_UTDS (t
),
10747 bt_instantiate_type_proc
, &storage
);
10751 /* Given a function DECL, which is a specialization of TMPL, modify
10752 DECL to be a re-instantiation of TMPL with the same template
10753 arguments. TMPL should be the template into which tsubst'ing
10754 should occur for DECL, not the most general template.
10756 One reason for doing this is a scenario like this:
10759 void f(const T&, int i);
10761 void g() { f(3, 7); }
10764 void f(const T& t, const int i) { }
10766 Note that when the template is first instantiated, with
10767 instantiate_template, the resulting DECL will have no name for the
10768 first parameter, and the wrong type for the second. So, when we go
10769 to instantiate the DECL, we regenerate it. */
10772 regenerate_decl_from_template (tree decl
, tree tmpl
)
10774 /* The most general version of TMPL. */
10776 /* The arguments used to instantiate DECL, from the most general
10783 args
= DECL_TI_ARGS (decl
);
10784 code_pattern
= DECL_TEMPLATE_RESULT (tmpl
);
10786 /* Unregister the specialization so that when we tsubst we will not
10787 just return DECL. We don't have to unregister DECL from TMPL
10788 because if would only be registered there if it were a partial
10789 instantiation of a specialization, which it isn't: it's a full
10791 gen_tmpl
= most_general_template (tmpl
);
10792 unregistered
= reregister_specialization (decl
, gen_tmpl
,
10793 /*new_spec=*/NULL_TREE
);
10795 /* If the DECL was not unregistered then something peculiar is
10796 happening: we created a specialization but did not call
10797 register_specialization for it. */
10798 my_friendly_assert (unregistered
, 0);
10800 /* Make sure that we can see identifiers, and compute access
10802 push_access_scope (decl
);
10804 /* Do the substitution to get the new declaration. */
10805 new_decl
= tsubst (code_pattern
, args
, tf_error
, NULL_TREE
);
10807 if (TREE_CODE (decl
) == VAR_DECL
)
10809 /* Set up DECL_INITIAL, since tsubst doesn't. */
10810 if (!DECL_INITIALIZED_IN_CLASS_P (decl
))
10811 DECL_INITIAL (new_decl
) =
10812 tsubst_expr (DECL_INITIAL (code_pattern
), args
,
10813 tf_error
, DECL_TI_TEMPLATE (decl
));
10815 else if (TREE_CODE (decl
) == FUNCTION_DECL
)
10817 /* Convince duplicate_decls to use the DECL_ARGUMENTS from the
10819 DECL_INITIAL (new_decl
) = error_mark_node
;
10820 /* And don't complain about a duplicate definition. */
10821 DECL_INITIAL (decl
) = NULL_TREE
;
10824 pop_access_scope (decl
);
10826 /* The immediate parent of the new template is still whatever it was
10827 before, even though tsubst sets DECL_TI_TEMPLATE up as the most
10828 general template. We also reset the DECL_ASSEMBLER_NAME since
10829 tsubst always calculates the name as if the function in question
10830 were really a template instance, and sometimes, with friend
10831 functions, this is not so. See tsubst_friend_function for
10833 DECL_TI_TEMPLATE (new_decl
) = DECL_TI_TEMPLATE (decl
);
10834 COPY_DECL_ASSEMBLER_NAME (decl
, new_decl
);
10835 COPY_DECL_RTL (decl
, new_decl
);
10836 DECL_USE_TEMPLATE (new_decl
) = DECL_USE_TEMPLATE (decl
);
10838 /* Call duplicate decls to merge the old and new declarations. */
10839 duplicate_decls (new_decl
, decl
);
10841 /* Now, re-register the specialization. */
10842 register_specialization (decl
, gen_tmpl
, args
);
10845 /* Return the TEMPLATE_DECL into which DECL_TI_ARGS(DECL) should be
10846 substituted to get DECL. */
10849 template_for_substitution (tree decl
)
10851 tree tmpl
= DECL_TI_TEMPLATE (decl
);
10853 /* Set TMPL to the template whose DECL_TEMPLATE_RESULT is the pattern
10854 for the instantiation. This is not always the most general
10855 template. Consider, for example:
10858 struct S { template <class U> void f();
10859 template <> void f<int>(); };
10861 and an instantiation of S<double>::f<int>. We want TD to be the
10862 specialization S<T>::f<int>, not the more general S<T>::f<U>. */
10863 while (/* An instantiation cannot have a definition, so we need a
10864 more general template. */
10865 DECL_TEMPLATE_INSTANTIATION (tmpl
)
10866 /* We must also deal with friend templates. Given:
10868 template <class T> struct S {
10869 template <class U> friend void f() {};
10872 S<int>::f<U> say, is not an instantiation of S<T>::f<U>,
10873 so far as the language is concerned, but that's still
10874 where we get the pattern for the instantiation from. On
10875 other hand, if the definition comes outside the class, say:
10877 template <class T> struct S {
10878 template <class U> friend void f();
10880 template <class U> friend void f() {}
10882 we don't need to look any further. That's what the check for
10883 DECL_INITIAL is for. */
10884 || (TREE_CODE (decl
) == FUNCTION_DECL
10885 && DECL_FRIEND_PSEUDO_TEMPLATE_INSTANTIATION (tmpl
)
10886 && !DECL_INITIAL (DECL_TEMPLATE_RESULT (tmpl
))))
10888 /* The present template, TD, should not be a definition. If it
10889 were a definition, we should be using it! Note that we
10890 cannot restructure the loop to just keep going until we find
10891 a template with a definition, since that might go too far if
10892 a specialization was declared, but not defined. */
10893 my_friendly_assert (!(TREE_CODE (decl
) == VAR_DECL
10894 && !DECL_IN_AGGR_P (DECL_TEMPLATE_RESULT (tmpl
))),
10897 /* Fetch the more general template. */
10898 tmpl
= DECL_TI_TEMPLATE (tmpl
);
10904 /* Produce the definition of D, a _DECL generated from a template. If
10905 DEFER_OK is nonzero, then we don't have to actually do the
10906 instantiation now; we just have to do it sometime. Normally it is
10907 an error if this is an explicit instantiation but D is undefined.
10908 If UNDEFINED_OK is nonzero, then instead we treat it as an implicit
10909 instantiation. UNDEFINED_OK is nonzero only if we are being used
10910 to instantiate the members of an explicitly instantiated class
10915 instantiate_decl (tree d
, int defer_ok
, int undefined_ok
)
10917 tree tmpl
= DECL_TI_TEMPLATE (d
);
10924 int pattern_defined
;
10926 location_t saved_loc
= input_location
;
10928 /* This function should only be used to instantiate templates for
10929 functions and static member variables. */
10930 my_friendly_assert (TREE_CODE (d
) == FUNCTION_DECL
10931 || TREE_CODE (d
) == VAR_DECL
, 0);
10933 /* Variables are never deferred; if instantiation is required, they
10934 are instantiated right away. That allows for better code in the
10935 case that an expression refers to the value of the variable --
10936 if the variable has a constant value the referring expression can
10937 take advantage of that fact. */
10938 if (TREE_CODE (d
) == VAR_DECL
)
10941 /* Don't instantiate cloned functions. Instead, instantiate the
10942 functions they cloned. */
10943 if (TREE_CODE (d
) == FUNCTION_DECL
&& DECL_CLONED_FUNCTION_P (d
))
10944 d
= DECL_CLONED_FUNCTION (d
);
10946 if (DECL_TEMPLATE_INSTANTIATED (d
))
10947 /* D has already been instantiated. It might seem reasonable to
10948 check whether or not D is an explicit instantiation, and, if so,
10949 stop here. But when an explicit instantiation is deferred
10950 until the end of the compilation, DECL_EXPLICIT_INSTANTIATION
10951 is set, even though we still need to do the instantiation. */
10954 /* If we already have a specialization of this declaration, then
10955 there's no reason to instantiate it. Note that
10956 retrieve_specialization gives us both instantiations and
10957 specializations, so we must explicitly check
10958 DECL_TEMPLATE_SPECIALIZATION. */
10959 gen_tmpl
= most_general_template (tmpl
);
10960 gen_args
= DECL_TI_ARGS (d
);
10961 spec
= retrieve_specialization (gen_tmpl
, gen_args
);
10962 if (spec
!= NULL_TREE
&& DECL_TEMPLATE_SPECIALIZATION (spec
))
10965 /* This needs to happen before any tsubsting. */
10966 if (! push_tinst_level (d
))
10969 timevar_push (TV_PARSE
);
10971 /* We may be in the middle of deferred access check. Disable it now. */
10972 push_deferring_access_checks (dk_no_deferred
);
10974 /* Set TD to the template whose DECL_TEMPLATE_RESULT is the pattern
10975 for the instantiation. */
10976 td
= template_for_substitution (d
);
10977 code_pattern
= DECL_TEMPLATE_RESULT (td
);
10979 if ((DECL_NAMESPACE_SCOPE_P (d
) && !DECL_INITIALIZED_IN_CLASS_P (d
))
10980 || DECL_TEMPLATE_SPECIALIZATION (td
))
10981 /* In the case of a friend template whose definition is provided
10982 outside the class, we may have too many arguments. Drop the
10983 ones we don't need. The same is true for specializations. */
10984 args
= get_innermost_template_args
10985 (gen_args
, TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (td
)));
10989 if (TREE_CODE (d
) == FUNCTION_DECL
)
10990 pattern_defined
= (DECL_SAVED_TREE (code_pattern
) != NULL_TREE
);
10992 pattern_defined
= ! DECL_IN_AGGR_P (code_pattern
);
10994 input_location
= DECL_SOURCE_LOCATION (d
);
10996 if (pattern_defined
)
10998 /* Let the repository code that this template definition is
11001 The repository doesn't need to know about cloned functions
11002 because they never actually show up in the object file. It
11003 does need to know about the clones; those are the symbols
11004 that the linker will be emitting error messages about. */
11005 if (DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (d
)
11006 || DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (d
))
11010 for (t
= TREE_CHAIN (d
);
11011 t
&& DECL_CLONED_FUNCTION_P (t
);
11012 t
= TREE_CHAIN (t
))
11013 repo_template_used (t
);
11016 repo_template_used (d
);
11019 import_export_decl (d
);
11022 if (! pattern_defined
&& DECL_EXPLICIT_INSTANTIATION (d
) && undefined_ok
)
11023 SET_DECL_IMPLICIT_INSTANTIATION (d
);
11027 /* Recheck the substitutions to obtain any warning messages
11028 about ignoring cv qualifiers. */
11029 tree gen
= DECL_TEMPLATE_RESULT (gen_tmpl
);
11030 tree type
= TREE_TYPE (gen
);
11032 /* Make sure that we can see identifiers, and compute access
11033 correctly. D is already the target FUNCTION_DECL with the
11035 push_access_scope (d
);
11037 if (TREE_CODE (gen
) == FUNCTION_DECL
)
11039 tsubst (DECL_ARGUMENTS (gen
), gen_args
, tf_error
| tf_warning
, d
);
11040 tsubst (TYPE_RAISES_EXCEPTIONS (type
), gen_args
,
11041 tf_error
| tf_warning
, d
);
11042 /* Don't simply tsubst the function type, as that will give
11043 duplicate warnings about poor parameter qualifications.
11044 The function arguments are the same as the decl_arguments
11045 without the top level cv qualifiers. */
11046 type
= TREE_TYPE (type
);
11048 tsubst (type
, gen_args
, tf_error
| tf_warning
, d
);
11050 pop_access_scope (d
);
11053 if (TREE_CODE (d
) == VAR_DECL
&& DECL_INITIALIZED_IN_CLASS_P (d
)
11054 && DECL_INITIAL (d
) == NULL_TREE
)
11055 /* We should have set up DECL_INITIAL in instantiate_class_template. */
11057 /* Reject all external templates except inline functions. */
11058 else if (DECL_INTERFACE_KNOWN (d
)
11059 && ! DECL_NOT_REALLY_EXTERN (d
)
11060 && ! (TREE_CODE (d
) == FUNCTION_DECL
11061 && DECL_INLINE (d
)))
11063 /* Defer all other templates, unless we have been explicitly
11064 forbidden from doing so. We restore the source position here
11065 because it's used by add_pending_template. */
11066 else if (! pattern_defined
|| defer_ok
)
11068 input_location
= saved_loc
;
11070 if (at_eof
&& !pattern_defined
11071 && DECL_EXPLICIT_INSTANTIATION (d
))
11074 The definition of a non-exported function template, a
11075 non-exported member function template, or a non-exported
11076 member function or static data member of a class template
11077 shall be present in every translation unit in which it is
11078 explicitly instantiated. */
11080 ("explicit instantiation of `%D' but no definition available", d
);
11082 add_pending_template (d
);
11086 need_push
= !cfun
|| !global_bindings_p ();
11088 push_to_top_level ();
11090 /* Mark D as instantiated so that recursive calls to
11091 instantiate_decl do not try to instantiate it again. */
11092 DECL_TEMPLATE_INSTANTIATED (d
) = 1;
11094 /* Regenerate the declaration in case the template has been modified
11095 by a subsequent redeclaration. */
11096 regenerate_decl_from_template (d
, td
);
11098 /* We already set the file and line above. Reset them now in case
11099 they changed as a result of calling regenerate_decl_from_template. */
11100 input_location
= DECL_SOURCE_LOCATION (d
);
11102 if (TREE_CODE (d
) == VAR_DECL
)
11104 /* Clear out DECL_RTL; whatever was there before may not be right
11105 since we've reset the type of the declaration. */
11106 SET_DECL_RTL (d
, NULL_RTX
);
11108 DECL_IN_AGGR_P (d
) = 0;
11109 import_export_decl (d
);
11110 DECL_EXTERNAL (d
) = ! DECL_NOT_REALLY_EXTERN (d
);
11112 if (DECL_EXTERNAL (d
))
11114 /* The fact that this code is executing indicates that:
11116 (1) D is a template static data member, for which a
11117 definition is available.
11119 (2) An implicit or explicit instantiation has occurred.
11121 (3) We are not going to emit a definition of the static
11122 data member at this time.
11124 This situation is peculiar, but it occurs on platforms
11125 without weak symbols when performing an implicit
11126 instantiation. There, we cannot implicitly instantiate a
11127 defined static data member in more than one translation
11128 unit, so import_export_decl marks the declaration as
11129 external; we must rely on explicit instantiation.
11131 Reset instantiated marker to make sure that later
11132 explicit instantiation will be processed. */
11133 DECL_TEMPLATE_INSTANTIATED (d
) = 0;
11137 /* This is done in analogous to `start_decl'. It is
11138 required for correct access checking. */
11139 push_nested_class (DECL_CONTEXT (d
));
11141 (!DECL_INITIALIZED_IN_CLASS_P (d
)
11142 ? DECL_INITIAL (d
) : NULL_TREE
),
11144 /* Normally, pop_nested_class is called by cp_finish_decl
11145 above. But when instantiate_decl is triggered during
11146 instantiate_class_template processing, its DECL_CONTEXT
11147 is still not completed yet, and pop_nested_class isn't
11149 if (!COMPLETE_TYPE_P (DECL_CONTEXT (d
)))
11150 pop_nested_class ();
11153 else if (TREE_CODE (d
) == FUNCTION_DECL
)
11155 htab_t saved_local_specializations
;
11160 /* Mark D as instantiated so that recursive calls to
11161 instantiate_decl do not try to instantiate it again. */
11162 DECL_TEMPLATE_INSTANTIATED (d
) = 1;
11164 /* Save away the current list, in case we are instantiating one
11165 template from within the body of another. */
11166 saved_local_specializations
= local_specializations
;
11168 /* Set up the list of local specializations. */
11169 local_specializations
= htab_create (37,
11170 hash_local_specialization
,
11171 eq_local_specializations
,
11174 /* Set up context. */
11175 import_export_decl (d
);
11176 start_preparsed_function (d
, NULL_TREE
, SF_PRE_PARSED
);
11178 /* Create substitution entries for the parameters. */
11179 subst_decl
= DECL_TEMPLATE_RESULT (template_for_substitution (d
));
11180 tmpl_parm
= DECL_ARGUMENTS (subst_decl
);
11181 spec_parm
= DECL_ARGUMENTS (d
);
11182 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (d
))
11184 register_local_specialization (spec_parm
, tmpl_parm
);
11185 spec_parm
= skip_artificial_parms_for (d
, spec_parm
);
11186 tmpl_parm
= skip_artificial_parms_for (subst_decl
, tmpl_parm
);
11190 register_local_specialization (spec_parm
, tmpl_parm
);
11191 tmpl_parm
= TREE_CHAIN (tmpl_parm
);
11192 spec_parm
= TREE_CHAIN (spec_parm
);
11194 my_friendly_assert (!spec_parm
, 20020813);
11196 /* Substitute into the body of the function. */
11197 tsubst_expr (DECL_SAVED_TREE (code_pattern
), args
,
11198 tf_error
| tf_warning
, tmpl
);
11200 /* We don't need the local specializations any more. */
11201 htab_delete (local_specializations
);
11202 local_specializations
= saved_local_specializations
;
11204 /* Finish the function. */
11205 d
= finish_function (0);
11206 expand_or_defer_fn (d
);
11209 /* We're not deferring instantiation any more. */
11210 TI_PENDING_TEMPLATE_FLAG (DECL_TEMPLATE_INFO (d
)) = 0;
11213 pop_from_top_level ();
11216 input_location
= saved_loc
;
11217 pop_deferring_access_checks ();
11218 pop_tinst_level ();
11220 timevar_pop (TV_PARSE
);
11225 /* Run through the list of templates that we wish we could
11226 instantiate, and instantiate any we can. */
11229 instantiate_pending_templates (void)
11232 tree last
= NULL_TREE
;
11233 int instantiated_something
= 0;
11235 location_t saved_loc
= input_location
;
11241 t
= &pending_templates
;
11244 tree instantiation
= TREE_VALUE (*t
);
11246 reopen_tinst_level (TREE_PURPOSE (*t
));
11248 if (TYPE_P (instantiation
))
11252 if (!COMPLETE_TYPE_P (instantiation
))
11254 instantiate_class_template (instantiation
);
11255 if (CLASSTYPE_TEMPLATE_INSTANTIATION (instantiation
))
11256 for (fn
= TYPE_METHODS (instantiation
);
11258 fn
= TREE_CHAIN (fn
))
11259 if (! DECL_ARTIFICIAL (fn
))
11260 instantiate_decl (fn
, /*defer_ok=*/0,
11261 /*undefined_ok=*/0);
11262 if (COMPLETE_TYPE_P (instantiation
))
11264 instantiated_something
= 1;
11269 if (COMPLETE_TYPE_P (instantiation
))
11270 /* If INSTANTIATION has been instantiated, then we don't
11271 need to consider it again in the future. */
11272 *t
= TREE_CHAIN (*t
);
11276 t
= &TREE_CHAIN (*t
);
11281 if (!DECL_TEMPLATE_SPECIALIZATION (instantiation
)
11282 && !DECL_TEMPLATE_INSTANTIATED (instantiation
))
11284 instantiation
= instantiate_decl (instantiation
,
11286 /*undefined_ok=*/0);
11287 if (DECL_TEMPLATE_INSTANTIATED (instantiation
))
11289 instantiated_something
= 1;
11294 if (DECL_TEMPLATE_SPECIALIZATION (instantiation
)
11295 || DECL_TEMPLATE_INSTANTIATED (instantiation
))
11296 /* If INSTANTIATION has been instantiated, then we don't
11297 need to consider it again in the future. */
11298 *t
= TREE_CHAIN (*t
);
11302 t
= &TREE_CHAIN (*t
);
11306 current_tinst_level
= NULL_TREE
;
11308 last_pending_template
= last
;
11310 while (reconsider
);
11312 input_location
= saved_loc
;
11313 return instantiated_something
;
11316 /* Substitute ARGVEC into T, which is a list of initializers for
11317 either base class or a non-static data member. The TREE_PURPOSEs
11318 are DECLs, and the TREE_VALUEs are the initializer values. Used by
11319 instantiate_decl. */
11322 tsubst_initializer_list (tree t
, tree argvec
)
11324 tree inits
= NULL_TREE
;
11326 for (; t
; t
= TREE_CHAIN (t
))
11332 decl
= tsubst_copy (TREE_PURPOSE (t
), argvec
, tf_error
| tf_warning
,
11334 decl
= expand_member_init (decl
);
11335 if (decl
&& !DECL_P (decl
))
11336 in_base_initializer
= 1;
11338 init
= tsubst_expr (TREE_VALUE (t
), argvec
, tf_error
| tf_warning
,
11342 else if (TREE_CODE (init
) == TREE_LIST
)
11343 for (val
= init
; val
; val
= TREE_CHAIN (val
))
11344 TREE_VALUE (val
) = convert_from_reference (TREE_VALUE (val
));
11345 else if (init
!= void_type_node
)
11346 init
= convert_from_reference (init
);
11348 in_base_initializer
= 0;
11352 init
= build_tree_list (decl
, init
);
11353 TREE_CHAIN (init
) = inits
;
11360 /* Set CURRENT_ACCESS_SPECIFIER based on the protection of DECL. */
11363 set_current_access_from_decl (tree decl
)
11365 if (TREE_PRIVATE (decl
))
11366 current_access_specifier
= access_private_node
;
11367 else if (TREE_PROTECTED (decl
))
11368 current_access_specifier
= access_protected_node
;
11370 current_access_specifier
= access_public_node
;
11373 /* Instantiate an enumerated type. TAG is the template type, NEWTAG
11374 is the instantiation (which should have been created with
11375 start_enum) and ARGS are the template arguments to use. */
11378 tsubst_enum (tree tag
, tree newtag
, tree args
)
11382 for (e
= TYPE_VALUES (tag
); e
; e
= TREE_CHAIN (e
))
11387 decl
= TREE_VALUE (e
);
11388 /* Note that in a template enum, the TREE_VALUE is the
11389 CONST_DECL, not the corresponding INTEGER_CST. */
11390 value
= tsubst_expr (DECL_INITIAL (decl
),
11391 args
, tf_error
| tf_warning
,
11394 /* Give this enumeration constant the correct access. */
11395 set_current_access_from_decl (decl
);
11397 /* Actually build the enumerator itself. */
11398 build_enumerator (DECL_NAME (decl
), value
, newtag
);
11401 finish_enum (newtag
);
11402 DECL_SOURCE_LOCATION (TYPE_NAME (newtag
))
11403 = DECL_SOURCE_LOCATION (TYPE_NAME (tag
));
11406 /* DECL is a FUNCTION_DECL that is a template specialization. Return
11407 its type -- but without substituting the innermost set of template
11408 arguments. So, innermost set of template parameters will appear in
11412 get_mostly_instantiated_function_type (tree decl
)
11420 tmpl
= most_general_template (DECL_TI_TEMPLATE (decl
));
11421 targs
= DECL_TI_ARGS (decl
);
11422 tparms
= DECL_TEMPLATE_PARMS (tmpl
);
11423 parm_depth
= TMPL_PARMS_DEPTH (tparms
);
11425 /* There should be as many levels of arguments as there are levels
11427 my_friendly_assert (parm_depth
== TMPL_ARGS_DEPTH (targs
), 0);
11429 fn_type
= TREE_TYPE (tmpl
);
11431 if (parm_depth
== 1)
11432 /* No substitution is necessary. */
11439 /* Replace the innermost level of the TARGS with NULL_TREEs to
11440 let tsubst know not to substitute for those parameters. */
11441 partial_args
= make_tree_vec (TREE_VEC_LENGTH (targs
));
11442 for (i
= 1; i
< TMPL_ARGS_DEPTH (targs
); ++i
)
11443 SET_TMPL_ARGS_LEVEL (partial_args
, i
,
11444 TMPL_ARGS_LEVEL (targs
, i
));
11445 SET_TMPL_ARGS_LEVEL (partial_args
,
11446 TMPL_ARGS_DEPTH (targs
),
11447 make_tree_vec (DECL_NTPARMS (tmpl
)));
11449 /* Make sure that we can see identifiers, and compute access
11450 correctly. We can just use the context of DECL for the
11451 partial substitution here. It depends only on outer template
11452 parameters, regardless of whether the innermost level is
11453 specialized or not. */
11454 push_access_scope (decl
);
11456 ++processing_template_decl
;
11457 /* Now, do the (partial) substitution to figure out the
11458 appropriate function type. */
11459 fn_type
= tsubst (fn_type
, partial_args
, tf_error
, NULL_TREE
);
11460 --processing_template_decl
;
11462 /* Substitute into the template parameters to obtain the real
11463 innermost set of parameters. This step is important if the
11464 innermost set of template parameters contains value
11465 parameters whose types depend on outer template parameters. */
11466 TREE_VEC_LENGTH (partial_args
)--;
11467 tparms
= tsubst_template_parms (tparms
, partial_args
, tf_error
);
11469 pop_access_scope (decl
);
11475 /* Return truthvalue if we're processing a template different from
11476 the last one involved in diagnostics. */
11478 problematic_instantiation_changed (void)
11480 return last_template_error_tick
!= tinst_level_tick
;
11483 /* Remember current template involved in diagnostics. */
11485 record_last_problematic_instantiation (void)
11487 last_template_error_tick
= tinst_level_tick
;
11491 current_instantiation (void)
11493 return current_tinst_level
;
11496 /* [temp.param] Check that template non-type parm TYPE is of an allowable
11497 type. Return zero for ok, nonzero for disallowed. Issue error and
11498 warning messages under control of COMPLAIN. */
11501 invalid_nontype_parm_type_p (tree type
, tsubst_flags_t complain
)
11503 if (INTEGRAL_TYPE_P (type
))
11505 else if (POINTER_TYPE_P (type
))
11507 else if (TYPE_PTR_TO_MEMBER_P (type
))
11509 else if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
)
11511 else if (TREE_CODE (type
) == TYPENAME_TYPE
)
11514 if (complain
& tf_error
)
11515 error ("`%#T' is not a valid type for a template constant parameter",
11520 /* Returns TRUE if TYPE is dependent, in the sense of [temp.dep.type].
11521 Assumes that TYPE really is a type, and not the ERROR_MARK_NODE.*/
11524 dependent_type_p_r (tree type
)
11530 A type is dependent if it is:
11532 -- a template parameter. Template template parameters are
11533 types for us (since TYPE_P holds true for them) so we
11534 handle them here. */
11535 if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
11536 || TREE_CODE (type
) == TEMPLATE_TEMPLATE_PARM
)
11538 /* -- a qualified-id with a nested-name-specifier which contains a
11539 class-name that names a dependent type or whose unqualified-id
11540 names a dependent type. */
11541 if (TREE_CODE (type
) == TYPENAME_TYPE
)
11543 /* -- a cv-qualified type where the cv-unqualified type is
11545 type
= TYPE_MAIN_VARIANT (type
);
11546 /* -- a compound type constructed from any dependent type. */
11547 if (TYPE_PTR_TO_MEMBER_P (type
))
11548 return (dependent_type_p (TYPE_PTRMEM_CLASS_TYPE (type
))
11549 || dependent_type_p (TYPE_PTRMEM_POINTED_TO_TYPE
11551 else if (TREE_CODE (type
) == POINTER_TYPE
11552 || TREE_CODE (type
) == REFERENCE_TYPE
)
11553 return dependent_type_p (TREE_TYPE (type
));
11554 else if (TREE_CODE (type
) == FUNCTION_TYPE
11555 || TREE_CODE (type
) == METHOD_TYPE
)
11559 if (dependent_type_p (TREE_TYPE (type
)))
11561 for (arg_type
= TYPE_ARG_TYPES (type
);
11563 arg_type
= TREE_CHAIN (arg_type
))
11564 if (dependent_type_p (TREE_VALUE (arg_type
)))
11568 /* -- an array type constructed from any dependent type or whose
11569 size is specified by a constant expression that is
11570 value-dependent. */
11571 if (TREE_CODE (type
) == ARRAY_TYPE
)
11573 if (TYPE_DOMAIN (type
)
11574 && ((value_dependent_expression_p
11575 (TYPE_MAX_VALUE (TYPE_DOMAIN (type
))))
11576 || (type_dependent_expression_p
11577 (TYPE_MAX_VALUE (TYPE_DOMAIN (type
))))))
11579 return dependent_type_p (TREE_TYPE (type
));
11582 /* -- a template-id in which either the template name is a template
11584 if (TREE_CODE (type
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
11586 /* ... or any of the template arguments is a dependent type or
11587 an expression that is type-dependent or value-dependent. */
11588 else if (CLASS_TYPE_P (type
) && CLASSTYPE_TEMPLATE_INFO (type
)
11589 && (any_dependent_template_arguments_p
11590 (INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (type
)))))
11593 /* All TYPEOF_TYPEs are dependent; if the argument of the `typeof'
11594 expression is not type-dependent, then it should already been
11596 if (TREE_CODE (type
) == TYPEOF_TYPE
)
11599 /* The standard does not specifically mention types that are local
11600 to template functions or local classes, but they should be
11601 considered dependent too. For example:
11603 template <int I> void f() {
11608 The size of `E' cannot be known until the value of `I' has been
11609 determined. Therefore, `E' must be considered dependent. */
11610 scope
= TYPE_CONTEXT (type
);
11611 if (scope
&& TYPE_P (scope
))
11612 return dependent_type_p (scope
);
11613 else if (scope
&& TREE_CODE (scope
) == FUNCTION_DECL
)
11614 return type_dependent_expression_p (scope
);
11616 /* Other types are non-dependent. */
11620 /* Returns TRUE if TYPE is dependent, in the sense of
11621 [temp.dep.type]. */
11624 dependent_type_p (tree type
)
11626 /* If there are no template parameters in scope, then there can't be
11627 any dependent types. */
11628 if (!processing_template_decl
)
11631 /* If the type is NULL, we have not computed a type for the entity
11632 in question; in that case, the type is dependent. */
11636 /* Erroneous types can be considered non-dependent. */
11637 if (type
== error_mark_node
)
11640 /* If we have not already computed the appropriate value for TYPE,
11642 if (!TYPE_DEPENDENT_P_VALID (type
))
11644 TYPE_DEPENDENT_P (type
) = dependent_type_p_r (type
);
11645 TYPE_DEPENDENT_P_VALID (type
) = 1;
11648 return TYPE_DEPENDENT_P (type
);
11651 /* Returns TRUE if EXPRESSION is dependent, according to CRITERION. */
11654 dependent_scope_ref_p (tree expression
, bool criterion (tree
))
11659 my_friendly_assert (TREE_CODE (expression
) == SCOPE_REF
, 20030714);
11661 if (!TYPE_P (TREE_OPERAND (expression
, 0)))
11664 scope
= TREE_OPERAND (expression
, 0);
11665 name
= TREE_OPERAND (expression
, 1);
11669 An id-expression is type-dependent if it contains a
11670 nested-name-specifier that contains a class-name that names a
11672 /* The suggested resolution to Core Issue 2 implies that if the
11673 qualifying type is the current class, then we must peek
11676 && currently_open_class (scope
)
11677 && !criterion (name
))
11679 if (dependent_type_p (scope
))
11685 /* Returns TRUE if the EXPRESSION is value-dependent, in the sense of
11686 [temp.dep.constexpr] */
11689 value_dependent_expression_p (tree expression
)
11691 if (!processing_template_decl
)
11694 /* A name declared with a dependent type. */
11695 if (TREE_CODE (expression
) == IDENTIFIER_NODE
11696 || (DECL_P (expression
)
11697 && type_dependent_expression_p (expression
)))
11699 /* A non-type template parameter. */
11700 if ((TREE_CODE (expression
) == CONST_DECL
11701 && DECL_TEMPLATE_PARM_P (expression
))
11702 || TREE_CODE (expression
) == TEMPLATE_PARM_INDEX
)
11704 /* A constant with integral or enumeration type and is initialized
11705 with an expression that is value-dependent. */
11706 if (TREE_CODE (expression
) == VAR_DECL
11707 && DECL_INITIAL (expression
)
11708 && INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (expression
))
11709 && value_dependent_expression_p (DECL_INITIAL (expression
)))
11711 /* These expressions are value-dependent if the type to which the
11712 cast occurs is dependent or the expression being casted is
11713 value-dependent. */
11714 if (TREE_CODE (expression
) == DYNAMIC_CAST_EXPR
11715 || TREE_CODE (expression
) == STATIC_CAST_EXPR
11716 || TREE_CODE (expression
) == CONST_CAST_EXPR
11717 || TREE_CODE (expression
) == REINTERPRET_CAST_EXPR
11718 || TREE_CODE (expression
) == CAST_EXPR
)
11720 tree type
= TREE_TYPE (expression
);
11721 if (dependent_type_p (type
))
11723 /* A functional cast has a list of operands. */
11724 expression
= TREE_OPERAND (expression
, 0);
11727 /* If there are no operands, it must be an expression such
11728 as "int()". This should not happen for aggregate types
11729 because it would form non-constant expressions. */
11730 my_friendly_assert (INTEGRAL_OR_ENUMERATION_TYPE_P (type
),
11735 if (TREE_CODE (expression
) == TREE_LIST
)
11739 if (value_dependent_expression_p (TREE_VALUE (expression
)))
11741 expression
= TREE_CHAIN (expression
);
11743 while (expression
);
11747 return value_dependent_expression_p (expression
);
11749 /* A `sizeof' expression is value-dependent if the operand is
11751 if (TREE_CODE (expression
) == SIZEOF_EXPR
11752 || TREE_CODE (expression
) == ALIGNOF_EXPR
)
11754 expression
= TREE_OPERAND (expression
, 0);
11755 if (TYPE_P (expression
))
11756 return dependent_type_p (expression
);
11757 return type_dependent_expression_p (expression
);
11759 if (TREE_CODE (expression
) == SCOPE_REF
)
11760 return dependent_scope_ref_p (expression
, value_dependent_expression_p
);
11761 if (TREE_CODE (expression
) == COMPONENT_REF
)
11762 return (value_dependent_expression_p (TREE_OPERAND (expression
, 0))
11763 || value_dependent_expression_p (TREE_OPERAND (expression
, 1)));
11764 /* A constant expression is value-dependent if any subexpression is
11765 value-dependent. */
11766 if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (TREE_CODE (expression
))))
11768 switch (TREE_CODE_CLASS (TREE_CODE (expression
)))
11771 return (value_dependent_expression_p
11772 (TREE_OPERAND (expression
, 0)));
11775 return ((value_dependent_expression_p
11776 (TREE_OPERAND (expression
, 0)))
11777 || (value_dependent_expression_p
11778 (TREE_OPERAND (expression
, 1))));
11782 for (i
= 0; i
< first_rtl_op (TREE_CODE (expression
)); ++i
)
11783 /* In some cases, some of the operands may be missing.
11784 (For example, in the case of PREDECREMENT_EXPR, the
11785 amount to increment by may be missing.) That doesn't
11786 make the expression dependent. */
11787 if (TREE_OPERAND (expression
, i
)
11788 && (value_dependent_expression_p
11789 (TREE_OPERAND (expression
, i
))))
11796 /* The expression is not value-dependent. */
11800 /* Returns TRUE if the EXPRESSION is type-dependent, in the sense of
11801 [temp.dep.expr]. */
11804 type_dependent_expression_p (tree expression
)
11806 if (!processing_template_decl
)
11809 if (expression
== error_mark_node
)
11812 /* An unresolved name is always dependent. */
11813 if (TREE_CODE (expression
) == IDENTIFIER_NODE
)
11816 /* Some expression forms are never type-dependent. */
11817 if (TREE_CODE (expression
) == PSEUDO_DTOR_EXPR
11818 || TREE_CODE (expression
) == SIZEOF_EXPR
11819 || TREE_CODE (expression
) == ALIGNOF_EXPR
11820 || TREE_CODE (expression
) == TYPEID_EXPR
11821 || TREE_CODE (expression
) == DELETE_EXPR
11822 || TREE_CODE (expression
) == VEC_DELETE_EXPR
11823 || TREE_CODE (expression
) == THROW_EXPR
)
11826 /* The types of these expressions depends only on the type to which
11827 the cast occurs. */
11828 if (TREE_CODE (expression
) == DYNAMIC_CAST_EXPR
11829 || TREE_CODE (expression
) == STATIC_CAST_EXPR
11830 || TREE_CODE (expression
) == CONST_CAST_EXPR
11831 || TREE_CODE (expression
) == REINTERPRET_CAST_EXPR
11832 || TREE_CODE (expression
) == CAST_EXPR
)
11833 return dependent_type_p (TREE_TYPE (expression
));
11835 /* The types of these expressions depends only on the type created
11836 by the expression. */
11837 if (TREE_CODE (expression
) == NEW_EXPR
11838 || TREE_CODE (expression
) == VEC_NEW_EXPR
)
11840 /* For NEW_EXPR tree nodes created inside a template, either
11841 the object type itself or a TREE_LIST may appear as the
11843 tree type
= TREE_OPERAND (expression
, 1);
11844 if (TREE_CODE (type
) == TREE_LIST
)
11845 /* This is an array type. We need to check array dimensions
11847 return dependent_type_p (TREE_VALUE (TREE_PURPOSE (type
)))
11848 || value_dependent_expression_p
11849 (TREE_OPERAND (TREE_VALUE (type
), 1));
11851 return dependent_type_p (type
);
11854 if (TREE_CODE (expression
) == SCOPE_REF
11855 && dependent_scope_ref_p (expression
,
11856 type_dependent_expression_p
))
11859 if (TREE_CODE (expression
) == FUNCTION_DECL
11860 && DECL_LANG_SPECIFIC (expression
)
11861 && DECL_TEMPLATE_INFO (expression
)
11862 && (any_dependent_template_arguments_p
11863 (INNERMOST_TEMPLATE_ARGS (DECL_TI_ARGS (expression
)))))
11866 if (TREE_CODE (expression
) == TEMPLATE_DECL
11867 && !DECL_TEMPLATE_TEMPLATE_PARM_P (expression
))
11870 if (TREE_TYPE (expression
) == unknown_type_node
)
11872 if (TREE_CODE (expression
) == ADDR_EXPR
)
11873 return type_dependent_expression_p (TREE_OPERAND (expression
, 0));
11874 if (TREE_CODE (expression
) == COMPONENT_REF
11875 || TREE_CODE (expression
) == OFFSET_REF
)
11877 if (type_dependent_expression_p (TREE_OPERAND (expression
, 0)))
11879 expression
= TREE_OPERAND (expression
, 1);
11880 if (TREE_CODE (expression
) == IDENTIFIER_NODE
)
11884 if (TREE_CODE (expression
) == BASELINK
)
11885 expression
= BASELINK_FUNCTIONS (expression
);
11886 if (TREE_CODE (expression
) == TEMPLATE_ID_EXPR
)
11888 if (any_dependent_template_arguments_p
11889 (TREE_OPERAND (expression
, 1)))
11891 expression
= TREE_OPERAND (expression
, 0);
11893 if (TREE_CODE (expression
) == OVERLOAD
)
11897 if (type_dependent_expression_p (OVL_CURRENT (expression
)))
11899 expression
= OVL_NEXT (expression
);
11906 return (dependent_type_p (TREE_TYPE (expression
)));
11909 /* Returns TRUE if ARGS (a TREE_LIST of arguments to a function call)
11910 contains a type-dependent expression. */
11913 any_type_dependent_arguments_p (tree args
)
11917 tree arg
= TREE_VALUE (args
);
11919 if (type_dependent_expression_p (arg
))
11921 args
= TREE_CHAIN (args
);
11926 /* Returns TRUE if the ARG (a template argument) is dependent. */
11929 dependent_template_arg_p (tree arg
)
11931 if (!processing_template_decl
)
11934 if (TREE_CODE (arg
) == TEMPLATE_DECL
11935 || TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
)
11936 return dependent_template_p (arg
);
11937 else if (TYPE_P (arg
))
11938 return dependent_type_p (arg
);
11940 return (type_dependent_expression_p (arg
)
11941 || value_dependent_expression_p (arg
));
11944 /* Returns true if ARGS (a collection of template arguments) contains
11945 any dependent arguments. */
11948 any_dependent_template_arguments_p (tree args
)
11956 for (i
= 0; i
< TMPL_ARGS_DEPTH (args
); ++i
)
11958 tree level
= TMPL_ARGS_LEVEL (args
, i
+ 1);
11959 for (j
= 0; j
< TREE_VEC_LENGTH (level
); ++j
)
11960 if (dependent_template_arg_p (TREE_VEC_ELT (level
, j
)))
11967 /* Returns TRUE if the template TMPL is dependent. */
11970 dependent_template_p (tree tmpl
)
11972 if (TREE_CODE (tmpl
) == OVERLOAD
)
11976 if (dependent_template_p (OVL_FUNCTION (tmpl
)))
11978 tmpl
= OVL_CHAIN (tmpl
);
11983 /* Template template parameters are dependent. */
11984 if (DECL_TEMPLATE_TEMPLATE_PARM_P (tmpl
)
11985 || TREE_CODE (tmpl
) == TEMPLATE_TEMPLATE_PARM
)
11987 /* So are qualified names that have not been looked up. */
11988 if (TREE_CODE (tmpl
) == SCOPE_REF
)
11990 /* So are member templates of dependent classes. */
11991 if (TYPE_P (CP_DECL_CONTEXT (tmpl
)))
11992 return dependent_type_p (DECL_CONTEXT (tmpl
));
11996 /* Returns TRUE if the specialization TMPL<ARGS> is dependent. */
11999 dependent_template_id_p (tree tmpl
, tree args
)
12001 return (dependent_template_p (tmpl
)
12002 || any_dependent_template_arguments_p (args
));
12005 /* TYPE is a TYPENAME_TYPE. Returns the ordinary TYPE to which the
12006 TYPENAME_TYPE corresponds. Returns ERROR_MARK_NODE if no such TYPE
12007 can be found. Note that this function peers inside uninstantiated
12008 templates and therefore should be used only in extremely limited
12012 resolve_typename_type (tree type
, bool only_current_p
)
12020 my_friendly_assert (TREE_CODE (type
) == TYPENAME_TYPE
,
12023 scope
= TYPE_CONTEXT (type
);
12024 name
= TYPE_IDENTIFIER (type
);
12026 /* If the SCOPE is itself a TYPENAME_TYPE, then we need to resolve
12027 it first before we can figure out what NAME refers to. */
12028 if (TREE_CODE (scope
) == TYPENAME_TYPE
)
12029 scope
= resolve_typename_type (scope
, only_current_p
);
12030 /* If we don't know what SCOPE refers to, then we cannot resolve the
12032 if (scope
== error_mark_node
|| TREE_CODE (scope
) == TYPENAME_TYPE
)
12033 return error_mark_node
;
12034 /* If the SCOPE is a template type parameter, we have no way of
12035 resolving the name. */
12036 if (TREE_CODE (scope
) == TEMPLATE_TYPE_PARM
)
12038 /* If the SCOPE is not the current instantiation, there's no reason
12039 to look inside it. */
12040 if (only_current_p
&& !currently_open_class (scope
))
12041 return error_mark_node
;
12042 /* If SCOPE is a partial instantiation, it will not have a valid
12043 TYPE_FIELDS list, so use the original template. */
12044 scope
= CLASSTYPE_PRIMARY_TEMPLATE_TYPE (scope
);
12045 /* Enter the SCOPE so that name lookup will be resolved as if we
12046 were in the class definition. In particular, SCOPE will no
12047 longer be considered a dependent type. */
12048 pop_p
= push_scope (scope
);
12049 /* Look up the declaration. */
12050 decl
= lookup_member (scope
, name
, /*protect=*/0, /*want_type=*/true);
12051 /* Obtain the set of qualifiers applied to the TYPE. */
12052 quals
= cp_type_quals (type
);
12053 /* For a TYPENAME_TYPE like "typename X::template Y<T>", we want to
12054 find a TEMPLATE_DECL. Otherwise, we want to find a TYPE_DECL. */
12056 type
= error_mark_node
;
12057 else if (TREE_CODE (TYPENAME_TYPE_FULLNAME (type
)) == IDENTIFIER_NODE
12058 && TREE_CODE (decl
) == TYPE_DECL
)
12059 type
= TREE_TYPE (decl
);
12060 else if (TREE_CODE (TYPENAME_TYPE_FULLNAME (type
)) == TEMPLATE_ID_EXPR
12061 && DECL_CLASS_TEMPLATE_P (decl
))
12065 /* Obtain the template and the arguments. */
12066 tmpl
= TREE_OPERAND (TYPENAME_TYPE_FULLNAME (type
), 0);
12067 args
= TREE_OPERAND (TYPENAME_TYPE_FULLNAME (type
), 1);
12068 /* Instantiate the template. */
12069 type
= lookup_template_class (tmpl
, args
, NULL_TREE
, NULL_TREE
,
12070 /*entering_scope=*/0, tf_error
| tf_user
);
12073 type
= error_mark_node
;
12074 /* Qualify the resulting type. */
12075 if (type
!= error_mark_node
&& quals
)
12076 type
= cp_build_qualified_type (type
, quals
);
12077 /* Leave the SCOPE. */
12084 /* EXPR is an expression which is not type-dependent. Return a proxy
12085 for EXPR that can be used to compute the types of larger
12086 expressions containing EXPR. */
12089 build_non_dependent_expr (tree expr
)
12093 /* Preserve null pointer constants so that the type of things like
12094 "p == 0" where "p" is a pointer can be determined. */
12095 if (null_ptr_cst_p (expr
))
12097 /* Preserve OVERLOADs; the functions must be available to resolve
12099 inner_expr
= (TREE_CODE (expr
) == ADDR_EXPR
?
12100 TREE_OPERAND (expr
, 0) : expr
);
12101 if (TREE_CODE (inner_expr
) == OVERLOAD
12102 || TREE_CODE (inner_expr
) == FUNCTION_DECL
12103 || TREE_CODE (inner_expr
) == TEMPLATE_DECL
12104 || TREE_CODE (inner_expr
) == TEMPLATE_ID_EXPR
)
12106 /* Preserve string constants; conversions from string constants to
12107 "char *" are allowed, even though normally a "const char *"
12108 cannot be used to initialize a "char *". */
12109 if (TREE_CODE (expr
) == STRING_CST
)
12111 /* Preserve arithmetic constants, as an optimization -- there is no
12112 reason to create a new node. */
12113 if (TREE_CODE (expr
) == INTEGER_CST
|| TREE_CODE (expr
) == REAL_CST
)
12115 /* Preserve THROW_EXPRs -- all throw-expressions have type "void".
12116 There is at least one place where we want to know that a
12117 particular expression is a throw-expression: when checking a ?:
12118 expression, there are special rules if the second or third
12119 argument is a throw-expression. */
12120 if (TREE_CODE (expr
) == THROW_EXPR
)
12123 if (TREE_CODE (expr
) == COND_EXPR
)
12124 return build (COND_EXPR
,
12126 TREE_OPERAND (expr
, 0),
12127 (TREE_OPERAND (expr
, 1)
12128 ? build_non_dependent_expr (TREE_OPERAND (expr
, 1))
12129 : build_non_dependent_expr (TREE_OPERAND (expr
, 0))),
12130 build_non_dependent_expr (TREE_OPERAND (expr
, 2)));
12131 if (TREE_CODE (expr
) == COMPOUND_EXPR
12132 && !COMPOUND_EXPR_OVERLOADED (expr
))
12133 return build (COMPOUND_EXPR
,
12135 TREE_OPERAND (expr
, 0),
12136 build_non_dependent_expr (TREE_OPERAND (expr
, 1)));
12138 /* Otherwise, build a NON_DEPENDENT_EXPR.
12140 REFERENCE_TYPEs are not stripped for expressions in templates
12141 because doing so would play havoc with mangling. Consider, for
12144 template <typename T> void f<T& g>() { g(); }
12146 In the body of "f", the expression for "g" will have
12147 REFERENCE_TYPE, even though the standard says that it should
12148 not. The reason is that we must preserve the syntactic form of
12149 the expression so that mangling (say) "f<g>" inside the body of
12150 "f" works out correctly. Therefore, the REFERENCE_TYPE is
12152 return build1 (NON_DEPENDENT_EXPR
, non_reference (TREE_TYPE (expr
)), expr
);
12155 /* ARGS is a TREE_LIST of expressions as arguments to a function call.
12156 Return a new TREE_LIST with the various arguments replaced with
12157 equivalent non-dependent expressions. */
12160 build_non_dependent_args (tree args
)
12165 new_args
= NULL_TREE
;
12166 for (a
= args
; a
; a
= TREE_CHAIN (a
))
12167 new_args
= tree_cons (NULL_TREE
,
12168 build_non_dependent_expr (TREE_VALUE (a
)),
12170 return nreverse (new_args
);
12173 #include "gt-cp-pt.h"