1 /* Handle parameterized types (templates) for GNU C++.
2 Copyright (C) 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000
3 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 GNU CC.
9 GNU CC 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 GNU CC 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 GNU CC; 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". */
48 /* The type of functions taking a tree, and some additional data, and
50 typedef int (*tree_fn_t
) PARAMS ((tree
, void*));
52 extern struct obstack permanent_obstack
;
54 /* The PENDING_TEMPLATES is a TREE_LIST of templates whose
55 instantiations have been deferred, either because their definitions
56 were not yet available, or because we were putting off doing the
57 work. The TREE_PURPOSE of each entry is a SRCLOC indicating where
58 the instantiate request occurred; the TREE_VALUE is a either a DECL
59 (for a function or static data member), or a TYPE (for a class)
60 indicating what we are hoping to instantiate. */
61 static tree pending_templates
;
62 static tree
*template_tail
= &pending_templates
;
64 static tree maybe_templates
;
65 static tree
*maybe_template_tail
= &maybe_templates
;
67 int processing_template_parmlist
;
68 static int template_header_count
;
70 static tree saved_trees
;
71 static varray_type inline_parm_levels
;
72 static size_t inline_parm_levels_used
;
74 static tree current_tinst_level
;
76 /* A map from local variable declarations in the body of the template
77 presently being instantiated to the corresponding instantiated
79 static htab_t local_specializations
;
81 #define obstack_chunk_alloc xmalloc
82 #define obstack_chunk_free free
84 #define UNIFY_ALLOW_NONE 0
85 #define UNIFY_ALLOW_MORE_CV_QUAL 1
86 #define UNIFY_ALLOW_LESS_CV_QUAL 2
87 #define UNIFY_ALLOW_DERIVED 4
88 #define UNIFY_ALLOW_INTEGER 8
90 #define GTB_VIA_VIRTUAL 1 /* The base class we are examining is
91 virtual, or a base class of a virtual
93 #define GTB_IGNORE_TYPE 2 /* We don't need to try to unify the current
94 type with the desired type. */
96 static int resolve_overloaded_unification
PARAMS ((tree
, tree
, tree
, tree
,
97 unification_kind_t
, int));
98 static int try_one_overload
PARAMS ((tree
, tree
, tree
, tree
, tree
,
99 unification_kind_t
, int));
100 static int unify
PARAMS ((tree
, tree
, tree
, tree
, int));
101 static void add_pending_template
PARAMS ((tree
));
102 static int push_tinst_level
PARAMS ((tree
));
103 static void reopen_tinst_level
PARAMS ((tree
));
104 static tree classtype_mangled_name
PARAMS ((tree
));
105 static char *mangle_class_name_for_template
PARAMS ((const char *, tree
, tree
));
106 static tree tsubst_initializer_list
PARAMS ((tree
, tree
));
107 static int list_eq
PARAMS ((tree
, tree
));
108 static tree get_class_bindings
PARAMS ((tree
, tree
, tree
));
109 static tree coerce_template_parms
PARAMS ((tree
, tree
, tree
, int, int));
110 static void tsubst_enum
PARAMS ((tree
, tree
, tree
));
111 static tree add_to_template_args
PARAMS ((tree
, tree
));
112 static tree add_outermost_template_args
PARAMS ((tree
, tree
));
113 static void maybe_adjust_types_for_deduction
PARAMS ((unification_kind_t
, tree
*,
115 static int type_unification_real
PARAMS ((tree
, tree
, tree
, tree
,
116 int, unification_kind_t
, int));
117 static void note_template_header
PARAMS ((int));
118 static tree maybe_fold_nontype_arg
PARAMS ((tree
));
119 static tree convert_nontype_argument
PARAMS ((tree
, tree
));
120 static tree convert_template_argument
PARAMS ((tree
, tree
, tree
, int,
122 static tree get_bindings_overload
PARAMS ((tree
, tree
, tree
));
123 static int for_each_template_parm
PARAMS ((tree
, tree_fn_t
, void*));
124 static tree build_template_parm_index
PARAMS ((int, int, int, tree
, tree
));
125 static int inline_needs_template_parms
PARAMS ((tree
));
126 static void push_inline_template_parms_recursive
PARAMS ((tree
, int));
127 static tree retrieve_specialization
PARAMS ((tree
, tree
));
128 static tree retrieve_local_specialization
PARAMS ((tree
));
129 static tree register_specialization
PARAMS ((tree
, tree
, tree
));
130 static tree register_local_specialization
PARAMS ((tree
, tree
));
131 static int unregister_specialization
PARAMS ((tree
, tree
));
132 static tree reduce_template_parm_level
PARAMS ((tree
, tree
, int));
133 static tree build_template_decl
PARAMS ((tree
, tree
));
134 static int mark_template_parm
PARAMS ((tree
, void *));
135 static tree tsubst_friend_function
PARAMS ((tree
, tree
));
136 static tree tsubst_friend_class
PARAMS ((tree
, tree
));
137 static tree get_bindings_real
PARAMS ((tree
, tree
, tree
, int));
138 static int template_decl_level
PARAMS ((tree
));
139 static tree maybe_get_template_decl_from_type_decl
PARAMS ((tree
));
140 static int check_cv_quals_for_unify
PARAMS ((int, tree
, tree
));
141 static tree tsubst_template_arg_vector
PARAMS ((tree
, tree
, int));
142 static tree tsubst_template_parms
PARAMS ((tree
, tree
, int));
143 static void regenerate_decl_from_template
PARAMS ((tree
, tree
));
144 static tree most_specialized
PARAMS ((tree
, tree
, tree
));
145 static tree most_specialized_class
PARAMS ((tree
, tree
));
146 static void set_mangled_name_for_template_decl
PARAMS ((tree
));
147 static int template_class_depth_real
PARAMS ((tree
, int));
148 static tree tsubst_aggr_type
PARAMS ((tree
, tree
, int, tree
, int));
149 static tree tsubst_decl
PARAMS ((tree
, tree
, tree
, tree
));
150 static tree tsubst_arg_types
PARAMS ((tree
, tree
, int, tree
));
151 static tree tsubst_function_type
PARAMS ((tree
, tree
, int, tree
));
152 static void check_specialization_scope
PARAMS ((void));
153 static tree process_partial_specialization
PARAMS ((tree
));
154 static void set_current_access_from_decl
PARAMS ((tree
));
155 static void check_default_tmpl_args
PARAMS ((tree
, tree
, int, int));
156 static tree tsubst_call_declarator_parms
PARAMS ((tree
, tree
, int, tree
));
157 static tree get_template_base_recursive
PARAMS ((tree
, tree
,
158 tree
, tree
, tree
, int));
159 static tree get_template_base
PARAMS ((tree
, tree
, tree
, tree
));
160 static int verify_class_unification
PARAMS ((tree
, tree
, tree
));
161 static tree try_class_unification
PARAMS ((tree
, tree
, tree
, tree
));
162 static int coerce_template_template_parms
PARAMS ((tree
, tree
, int,
164 static tree determine_specialization
PARAMS ((tree
, tree
, tree
*, int));
165 static int template_args_equal
PARAMS ((tree
, tree
));
166 static void tsubst_default_arguments
PARAMS ((tree
));
167 static tree for_each_template_parm_r
PARAMS ((tree
*, int *, void *));
168 static tree instantiate_clone
PARAMS ((tree
, tree
));
170 /* Called once to initialize pt.c. */
175 ggc_add_tree_root (&pending_templates
, 1);
176 ggc_add_tree_root (&maybe_templates
, 1);
177 ggc_add_tree_root (&saved_trees
, 1);
178 ggc_add_tree_root (¤t_tinst_level
, 1);
181 /* Do any processing required when DECL (a member template declaration
182 using TEMPLATE_PARAMETERS as its innermost parameter list) is
183 finished. Returns the TEMPLATE_DECL corresponding to DECL, unless
184 it is a specialization, in which case the DECL itself is returned. */
187 finish_member_template_decl (decl
)
190 if (decl
== NULL_TREE
|| decl
== void_type_node
)
192 else if (decl
== error_mark_node
)
193 /* By returning NULL_TREE, the parser will just ignore this
194 declaration. We have already issued the error. */
196 else if (TREE_CODE (decl
) == TREE_LIST
)
198 /* Assume that the class is the only declspec. */
199 decl
= TREE_VALUE (decl
);
200 if (IS_AGGR_TYPE (decl
) && CLASSTYPE_TEMPLATE_INFO (decl
)
201 && ! CLASSTYPE_TEMPLATE_SPECIALIZATION (decl
))
203 tree tmpl
= CLASSTYPE_TI_TEMPLATE (decl
);
204 check_member_template (tmpl
);
209 else if (TREE_CODE (decl
) == FIELD_DECL
)
210 cp_error ("data member `%D' cannot be a member template", decl
);
211 else if (DECL_TEMPLATE_INFO (decl
))
213 if (!DECL_TEMPLATE_SPECIALIZATION (decl
))
215 check_member_template (DECL_TI_TEMPLATE (decl
));
216 return DECL_TI_TEMPLATE (decl
);
222 cp_error ("invalid member template declaration `%D'", decl
);
224 return error_mark_node
;
227 /* Returns the template nesting level of the indicated class TYPE.
237 A<T>::B<U> has depth two, while A<T> has depth one.
238 Both A<T>::B<int> and A<int>::B<U> have depth one, if
239 COUNT_SPECIALIZATIONS is 0 or if they are instantiations, not
242 This function is guaranteed to return 0 if passed NULL_TREE so
243 that, for example, `template_class_depth (current_class_type)' is
247 template_class_depth_real (type
, count_specializations
)
249 int count_specializations
;
254 type
&& TREE_CODE (type
) != NAMESPACE_DECL
;
255 type
= (TREE_CODE (type
) == FUNCTION_DECL
)
256 ? CP_DECL_CONTEXT (type
) : TYPE_CONTEXT (type
))
258 if (TREE_CODE (type
) != FUNCTION_DECL
)
260 if (CLASSTYPE_TEMPLATE_INFO (type
)
261 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (type
))
262 && ((count_specializations
263 && CLASSTYPE_TEMPLATE_SPECIALIZATION (type
))
264 || uses_template_parms (CLASSTYPE_TI_ARGS (type
))))
269 if (DECL_TEMPLATE_INFO (type
)
270 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (type
))
271 && ((count_specializations
272 && DECL_TEMPLATE_SPECIALIZATION (type
))
273 || uses_template_parms (DECL_TI_ARGS (type
))))
281 /* Returns the template nesting level of the indicated class TYPE.
282 Like template_class_depth_real, but instantiations do not count in
286 template_class_depth (type
)
289 return template_class_depth_real (type
, /*count_specializations=*/0);
292 /* Returns 1 if processing DECL as part of do_pending_inlines
293 needs us to push template parms. */
296 inline_needs_template_parms (decl
)
299 if (! DECL_TEMPLATE_INFO (decl
))
302 return (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (most_general_template (decl
)))
303 > (processing_template_decl
+ DECL_TEMPLATE_SPECIALIZATION (decl
)));
306 /* Subroutine of maybe_begin_member_template_processing.
307 Push the template parms in PARMS, starting from LEVELS steps into the
308 chain, and ending at the beginning, since template parms are listed
312 push_inline_template_parms_recursive (parmlist
, levels
)
316 tree parms
= TREE_VALUE (parmlist
);
320 push_inline_template_parms_recursive (TREE_CHAIN (parmlist
), levels
- 1);
322 ++processing_template_decl
;
323 current_template_parms
324 = tree_cons (build_int_2 (0, processing_template_decl
),
325 parms
, current_template_parms
);
326 TEMPLATE_PARMS_FOR_INLINE (current_template_parms
) = 1;
329 for (i
= 0; i
< TREE_VEC_LENGTH (parms
); ++i
)
331 tree parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
332 my_friendly_assert (DECL_P (parm
), 0);
334 switch (TREE_CODE (parm
))
343 /* Make a CONST_DECL as is done in process_template_parm.
344 It is ugly that we recreate this here; the original
345 version built in process_template_parm is no longer
347 tree decl
= build_decl (CONST_DECL
, DECL_NAME (parm
),
349 DECL_ARTIFICIAL (decl
) = 1;
350 DECL_INITIAL (decl
) = DECL_INITIAL (parm
);
351 SET_DECL_TEMPLATE_PARM_P (decl
);
357 my_friendly_abort (0);
362 /* Restore the template parameter context for a member template or
363 a friend template defined in a class definition. */
366 maybe_begin_member_template_processing (decl
)
372 if (inline_needs_template_parms (decl
))
374 parms
= DECL_TEMPLATE_PARMS (most_general_template (decl
));
375 levels
= TMPL_PARMS_DEPTH (parms
) - processing_template_decl
;
377 if (DECL_TEMPLATE_SPECIALIZATION (decl
))
380 parms
= TREE_CHAIN (parms
);
383 push_inline_template_parms_recursive (parms
, levels
);
386 /* Remember how many levels of template parameters we pushed so that
387 we can pop them later. */
388 if (!inline_parm_levels
)
389 VARRAY_INT_INIT (inline_parm_levels
, 4, "inline_parm_levels");
390 if (inline_parm_levels_used
== inline_parm_levels
->num_elements
)
391 VARRAY_GROW (inline_parm_levels
, 2 * inline_parm_levels_used
);
392 VARRAY_INT (inline_parm_levels
, inline_parm_levels_used
) = levels
;
393 ++inline_parm_levels_used
;
396 /* Undo the effects of begin_member_template_processing. */
399 maybe_end_member_template_processing ()
403 if (!inline_parm_levels_used
)
406 --inline_parm_levels_used
;
408 i
< VARRAY_INT (inline_parm_levels
, inline_parm_levels_used
);
411 --processing_template_decl
;
412 current_template_parms
= TREE_CHAIN (current_template_parms
);
417 /* Returns non-zero iff T is a member template function. We must be
420 template <class T> class C { void f(); }
422 Here, f is a template function, and a member, but not a member
423 template. This function does not concern itself with the origin of
424 T, only its present state. So if we have
426 template <class T> class C { template <class U> void f(U); }
428 then neither C<int>::f<char> nor C<T>::f<double> is considered
429 to be a member template. But, `template <class U> void
430 C<int>::f(U)' is considered a member template. */
433 is_member_template (t
)
436 if (!DECL_FUNCTION_TEMPLATE_P (t
))
437 /* Anything that isn't a function or a template function is
438 certainly not a member template. */
441 /* A local class can't have member templates. */
442 if (decl_function_context (t
))
445 return (DECL_FUNCTION_MEMBER_P (DECL_TEMPLATE_RESULT (t
))
446 /* If there are more levels of template parameters than
447 there are template classes surrounding the declaration,
448 then we have a member template. */
449 && (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (t
)) >
450 template_class_depth (DECL_CONTEXT (t
))));
454 /* Returns non-zero iff T is a member template class. See
455 is_member_template for a description of what precisely constitutes
456 a member template. */
459 is_member_template_class (t
)
462 if (!DECL_CLASS_TEMPLATE_P (t
))
463 /* Anything that isn't a class template, is certainly not a member
467 if (!DECL_CLASS_SCOPE_P (t
))
468 /* Anything whose context isn't a class type is surely not a
472 /* If there are more levels of template parameters than there are
473 template classes surrounding the declaration, then we have a
475 return (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (t
)) >
476 template_class_depth (DECL_CONTEXT (t
)));
480 /* Return a new template argument vector which contains all of ARGS,
481 but has as its innermost set of arguments the EXTRA_ARGS. */
484 add_to_template_args (args
, extra_args
)
493 extra_depth
= TMPL_ARGS_DEPTH (extra_args
);
494 new_args
= make_tree_vec (TMPL_ARGS_DEPTH (args
) + extra_depth
);
496 for (i
= 1; i
<= TMPL_ARGS_DEPTH (args
); ++i
)
497 SET_TMPL_ARGS_LEVEL (new_args
, i
, TMPL_ARGS_LEVEL (args
, i
));
499 for (j
= 1; j
<= extra_depth
; ++j
, ++i
)
500 SET_TMPL_ARGS_LEVEL (new_args
, i
, TMPL_ARGS_LEVEL (extra_args
, j
));
505 /* Like add_to_template_args, but only the outermost ARGS are added to
506 the EXTRA_ARGS. In particular, all but TMPL_ARGS_DEPTH
507 (EXTRA_ARGS) levels are added. This function is used to combine
508 the template arguments from a partial instantiation with the
509 template arguments used to attain the full instantiation from the
510 partial instantiation. */
513 add_outermost_template_args (args
, extra_args
)
519 /* If there are more levels of EXTRA_ARGS than there are ARGS,
520 something very fishy is going on. */
521 my_friendly_assert (TMPL_ARGS_DEPTH (args
) >= TMPL_ARGS_DEPTH (extra_args
),
524 /* If *all* the new arguments will be the EXTRA_ARGS, just return
526 if (TMPL_ARGS_DEPTH (args
) == TMPL_ARGS_DEPTH (extra_args
))
529 /* For the moment, we make ARGS look like it contains fewer levels. */
530 TREE_VEC_LENGTH (args
) -= TMPL_ARGS_DEPTH (extra_args
);
532 new_args
= add_to_template_args (args
, extra_args
);
534 /* Now, we restore ARGS to its full dimensions. */
535 TREE_VEC_LENGTH (args
) += TMPL_ARGS_DEPTH (extra_args
);
540 /* Return the N levels of innermost template arguments from the ARGS. */
543 get_innermost_template_args (args
, n
)
551 my_friendly_assert (n
>= 0, 20000603);
553 /* If N is 1, just return the innermost set of template arguments. */
555 return TMPL_ARGS_LEVEL (args
, TMPL_ARGS_DEPTH (args
));
557 /* If we're not removing anything, just return the arguments we were
559 extra_levels
= TMPL_ARGS_DEPTH (args
) - n
;
560 my_friendly_assert (extra_levels
>= 0, 20000603);
561 if (extra_levels
== 0)
564 /* Make a new set of arguments, not containing the outer arguments. */
565 new_args
= make_tree_vec (n
);
566 for (i
= 1; i
<= n
; ++i
)
567 SET_TMPL_ARGS_LEVEL (new_args
, i
,
568 TMPL_ARGS_LEVEL (args
, i
+ extra_levels
));
573 /* We've got a template header coming up; push to a new level for storing
577 begin_template_parm_list ()
579 /* We use a non-tag-transparent scope here, which causes pushtag to
580 put tags in this scope, rather than in the enclosing class or
581 namespace scope. This is the right thing, since we want
582 TEMPLATE_DECLS, and not TYPE_DECLS for template classes. For a
583 global template class, push_template_decl handles putting the
584 TEMPLATE_DECL into top-level scope. For a nested template class,
587 template <class T> struct S1 {
588 template <class T> struct S2 {};
591 pushtag contains special code to call pushdecl_with_scope on the
592 TEMPLATE_DECL for S2. */
593 begin_scope (sk_template_parms
);
594 ++processing_template_decl
;
595 ++processing_template_parmlist
;
596 note_template_header (0);
599 /* This routine is called when a specialization is declared. If it is
600 illegal to declare a specialization here, an error is reported. */
603 check_specialization_scope ()
605 tree scope
= current_scope ();
609 An explicit specialization shall be declared in the namespace of
610 which the template is a member, or, for member templates, in the
611 namespace of which the enclosing class or enclosing class
612 template is a member. An explicit specialization of a member
613 function, member class or static data member of a class template
614 shall be declared in the namespace of which the class template
616 if (scope
&& TREE_CODE (scope
) != NAMESPACE_DECL
)
617 cp_error ("explicit specialization in non-namespace scope `%D'",
622 In an explicit specialization declaration for a member of a class
623 template or a member template that appears in namespace scope,
624 the member template and some of its enclosing class templates may
625 remain unspecialized, except that the declaration shall not
626 explicitly specialize a class member template if its enclosing
627 class templates are not explicitly specialized as well. */
628 if (current_template_parms
)
629 cp_error ("enclosing class templates are not explicitly specialized");
632 /* We've just seen template <>. */
635 begin_specialization ()
637 begin_scope (sk_template_spec
);
638 note_template_header (1);
639 check_specialization_scope ();
642 /* Called at then end of processing a declaration preceded by
646 end_specialization ()
649 reset_specialization ();
652 /* Any template <>'s that we have seen thus far are not referring to a
653 function specialization. */
656 reset_specialization ()
658 processing_specialization
= 0;
659 template_header_count
= 0;
662 /* We've just seen a template header. If SPECIALIZATION is non-zero,
663 it was of the form template <>. */
666 note_template_header (specialization
)
669 processing_specialization
= specialization
;
670 template_header_count
++;
673 /* We're beginning an explicit instantiation. */
676 begin_explicit_instantiation ()
678 ++processing_explicit_instantiation
;
683 end_explicit_instantiation ()
685 my_friendly_assert(processing_explicit_instantiation
> 0, 0);
686 --processing_explicit_instantiation
;
689 /* The TYPE is being declared. If it is a template type, that means it
690 is a partial specialization. Do appropriate error-checking. */
693 maybe_process_partial_specialization (type
)
696 if (IS_AGGR_TYPE (type
) && CLASSTYPE_USE_TEMPLATE (type
))
698 if (CLASSTYPE_IMPLICIT_INSTANTIATION (type
)
699 && !COMPLETE_TYPE_P (type
))
701 if (current_namespace
702 != decl_namespace_context (CLASSTYPE_TI_TEMPLATE (type
)))
704 cp_pedwarn ("specializing `%#T' in different namespace", type
);
705 cp_pedwarn_at (" from definition of `%#D'",
706 CLASSTYPE_TI_TEMPLATE (type
));
708 SET_CLASSTYPE_TEMPLATE_SPECIALIZATION (type
);
709 if (processing_template_decl
)
710 push_template_decl (TYPE_MAIN_DECL (type
));
712 else if (CLASSTYPE_TEMPLATE_INSTANTIATION (type
))
713 cp_error ("specialization of `%T' after instantiation", type
);
715 else if (processing_specialization
)
716 cp_error ("explicit specialization of non-template `%T'", type
);
719 /* Retrieve the specialization (in the sense of [temp.spec] - a
720 specialization is either an instantiation or an explicit
721 specialization) of TMPL for the given template ARGS. If there is
722 no such specialization, return NULL_TREE. The ARGS are a vector of
723 arguments, or a vector of vectors of arguments, in the case of
724 templates with more than one level of parameters. */
727 retrieve_specialization (tmpl
, args
)
733 my_friendly_assert (TREE_CODE (tmpl
) == TEMPLATE_DECL
, 0);
735 /* There should be as many levels of arguments as there are
736 levels of parameters. */
737 my_friendly_assert (TMPL_ARGS_DEPTH (args
)
738 == TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl
)),
741 for (s
= DECL_TEMPLATE_SPECIALIZATIONS (tmpl
);
744 if (comp_template_args (TREE_PURPOSE (s
), args
))
745 return TREE_VALUE (s
);
750 /* Like retrieve_specialization, but for local declarations. */
753 retrieve_local_specialization (tmpl
)
756 return (tree
) htab_find (local_specializations
, tmpl
);
759 /* Returns non-zero iff DECL is a specialization of TMPL. */
762 is_specialization_of (decl
, tmpl
)
768 if (TREE_CODE (decl
) == FUNCTION_DECL
)
772 t
= DECL_TEMPLATE_INFO (t
) ? DECL_TI_TEMPLATE (t
) : NULL_TREE
)
778 my_friendly_assert (TREE_CODE (decl
) == TYPE_DECL
, 0);
780 for (t
= TREE_TYPE (decl
);
782 t
= CLASSTYPE_USE_TEMPLATE (t
)
783 ? TREE_TYPE (CLASSTYPE_TI_TEMPLATE (t
)) : NULL_TREE
)
784 if (same_type_ignoring_top_level_qualifiers_p (t
, TREE_TYPE (tmpl
)))
791 /* Register the specialization SPEC as a specialization of TMPL with
792 the indicated ARGS. Returns SPEC, or an equivalent prior
793 declaration, if available. */
796 register_specialization (spec
, tmpl
, args
)
803 my_friendly_assert (TREE_CODE (tmpl
) == TEMPLATE_DECL
, 0);
805 if (TREE_CODE (spec
) == FUNCTION_DECL
806 && uses_template_parms (DECL_TI_ARGS (spec
)))
807 /* This is the FUNCTION_DECL for a partial instantiation. Don't
808 register it; we want the corresponding TEMPLATE_DECL instead.
809 We use `uses_template_parms (DECL_TI_ARGS (spec))' rather than
810 the more obvious `uses_template_parms (spec)' to avoid problems
811 with default function arguments. In particular, given
814 template <class T> void f(T t1, T t = T())
816 the default argument expression is not substituted for in an
817 instantiation unless and until it is actually needed. */
820 /* There should be as many levels of arguments as there are
821 levels of parameters. */
822 my_friendly_assert (TMPL_ARGS_DEPTH (args
)
823 == TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl
)),
826 for (s
= DECL_TEMPLATE_SPECIALIZATIONS (tmpl
);
830 tree fn
= TREE_VALUE (s
);
832 /* We can sometimes try to re-register a specialization that we've
833 already got. In particular, regenerate_decl_from_template
834 calls duplicate_decls which will update the specialization
835 list. But, we'll still get called again here anyhow. It's
836 more convenient to simply allow this than to try to prevent it. */
839 else if (comp_template_args (TREE_PURPOSE (s
), args
))
841 if (DECL_TEMPLATE_SPECIALIZATION (spec
))
843 if (DECL_TEMPLATE_INSTANTIATION (fn
))
846 || DECL_EXPLICIT_INSTANTIATION (fn
))
848 cp_error ("specialization of %D after instantiation",
854 /* This situation should occur only if the first
855 specialization is an implicit instantiation,
856 the second is an explicit specialization, and
857 the implicit instantiation has not yet been
858 used. That situation can occur if we have
859 implicitly instantiated a member function and
860 then specialized it later.
862 We can also wind up here if a friend
863 declaration that looked like an instantiation
864 turns out to be a specialization:
866 template <class T> void foo(T);
867 class S { friend void foo<>(int) };
868 template <> void foo(int);
870 We transform the existing DECL in place so that
871 any pointers to it become pointers to the
874 If there was a definition for the template, but
875 not for the specialization, we want this to
876 look as if there is no definition, and vice
878 DECL_INITIAL (fn
) = NULL_TREE
;
879 duplicate_decls (spec
, fn
);
884 else if (DECL_TEMPLATE_SPECIALIZATION (fn
))
886 duplicate_decls (spec
, fn
);
893 DECL_TEMPLATE_SPECIALIZATIONS (tmpl
)
894 = tree_cons (args
, spec
, DECL_TEMPLATE_SPECIALIZATIONS (tmpl
));
899 /* Unregister the specialization SPEC as a specialization of TMPL.
900 Returns nonzero if the SPEC was listed as a specialization of
904 unregister_specialization (spec
, tmpl
)
910 for (s
= &DECL_TEMPLATE_SPECIALIZATIONS (tmpl
);
912 s
= &TREE_CHAIN (*s
))
913 if (TREE_VALUE (*s
) == spec
)
915 *s
= TREE_CHAIN (*s
);
922 /* Like register_specialization, but for local declarations. We are
923 registering SPEC, an instantiation of TMPL. */
926 register_local_specialization (spec
, tmpl
)
932 slot
= htab_find_slot (local_specializations
, tmpl
, INSERT
);
938 /* Print the list of candidate FNS in an error message. */
941 print_candidates (fns
)
946 const char *str
= "candidates are:";
948 for (fn
= fns
; fn
!= NULL_TREE
; fn
= TREE_CHAIN (fn
))
952 for (f
= TREE_VALUE (fn
); f
; f
= OVL_NEXT (f
))
953 cp_error_at ("%s %+#D", str
, OVL_CURRENT (f
));
958 /* Returns the template (one of the functions given by TEMPLATE_ID)
959 which can be specialized to match the indicated DECL with the
960 explicit template args given in TEMPLATE_ID. The DECL may be
961 NULL_TREE if none is available. In that case, the functions in
962 TEMPLATE_ID are non-members.
964 If NEED_MEMBER_TEMPLATE is non-zero the function is known to be a
965 specialization of a member template.
967 The template args (those explicitly specified and those deduced)
968 are output in a newly created vector *TARGS_OUT.
970 If it is impossible to determine the result, an error message is
971 issued. The error_mark_node is returned to indicate failure. */
974 determine_specialization (template_id
, decl
, targs_out
,
975 need_member_template
)
979 int need_member_template
;
984 tree candidates
= NULL_TREE
;
985 tree templates
= NULL_TREE
;
987 *targs_out
= NULL_TREE
;
989 if (template_id
== error_mark_node
)
990 return error_mark_node
;
992 fns
= TREE_OPERAND (template_id
, 0);
993 explicit_targs
= TREE_OPERAND (template_id
, 1);
995 if (fns
== error_mark_node
)
996 return error_mark_node
;
998 /* Check for baselinks. */
999 if (BASELINK_P (fns
))
1000 fns
= TREE_VALUE (fns
);
1002 if (!is_overloaded_fn (fns
))
1004 cp_error ("`%D' is not a function template", fns
);
1005 return error_mark_node
;
1008 for (; fns
; fns
= OVL_NEXT (fns
))
1012 tree fn
= OVL_CURRENT (fns
);
1014 if (TREE_CODE (fn
) == TEMPLATE_DECL
)
1015 /* DECL might be a specialization of FN. */
1017 else if (need_member_template
)
1018 /* FN is an ordinary member function, and we need a
1019 specialization of a member template. */
1021 else if (TREE_CODE (fn
) != FUNCTION_DECL
)
1022 /* We can get IDENTIFIER_NODEs here in certain erroneous
1025 else if (!DECL_FUNCTION_MEMBER_P (fn
))
1026 /* This is just an ordinary non-member function. Nothing can
1027 be a specialization of that. */
1031 tree decl_arg_types
;
1033 /* This is an ordinary member function. However, since
1034 we're here, we can assume it's enclosing class is a
1035 template class. For example,
1037 template <typename T> struct S { void f(); };
1038 template <> void S<int>::f() {}
1040 Here, S<int>::f is a non-template, but S<int> is a
1041 template class. If FN has the same type as DECL, we
1042 might be in business. */
1043 if (!same_type_p (TREE_TYPE (TREE_TYPE (decl
)),
1044 TREE_TYPE (TREE_TYPE (fn
))))
1045 /* The return types differ. */
1048 /* Adjust the type of DECL in case FN is a static member. */
1049 decl_arg_types
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
1050 if (DECL_STATIC_FUNCTION_P (fn
)
1051 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
1052 decl_arg_types
= TREE_CHAIN (decl_arg_types
);
1054 if (compparms (TYPE_ARG_TYPES (TREE_TYPE (fn
)),
1057 candidates
= tree_cons (NULL_TREE
, fn
, candidates
);
1062 /* See whether this function might be a specialization of this
1064 targs
= get_bindings (tmpl
, decl
, explicit_targs
);
1067 /* We cannot deduce template arguments that when used to
1068 specialize TMPL will produce DECL. */
1071 /* Save this template, and the arguments deduced. */
1072 templates
= tree_cons (targs
, tmpl
, templates
);
1075 if (templates
&& TREE_CHAIN (templates
))
1081 It is possible for a specialization with a given function
1082 signature to be instantiated from more than one function
1083 template. In such cases, explicit specification of the
1084 template arguments must be used to uniquely identify the
1085 function template specialization being specialized.
1087 Note that here, there's no suggestion that we're supposed to
1088 determine which of the candidate templates is most
1089 specialized. However, we, also have:
1093 Partial ordering of overloaded function template
1094 declarations is used in the following contexts to select
1095 the function template to which a function template
1096 specialization refers:
1098 -- when an explicit specialization refers to a function
1101 So, we do use the partial ordering rules, at least for now.
1102 This extension can only serve to make illegal programs legal,
1103 so it's safe. And, there is strong anecdotal evidence that
1104 the committee intended the partial ordering rules to apply;
1105 the EDG front-end has that behavior, and John Spicer claims
1106 that the committee simply forgot to delete the wording in
1107 [temp.expl.spec]. */
1108 tree tmpl
= most_specialized (templates
, decl
, explicit_targs
);
1109 if (tmpl
&& tmpl
!= error_mark_node
)
1111 targs
= get_bindings (tmpl
, decl
, explicit_targs
);
1112 templates
= tree_cons (targs
, tmpl
, NULL_TREE
);
1116 if (templates
== NULL_TREE
&& candidates
== NULL_TREE
)
1118 cp_error_at ("template-id `%D' for `%+D' does not match any template declaration",
1120 return error_mark_node
;
1122 else if ((templates
&& TREE_CHAIN (templates
))
1123 || (candidates
&& TREE_CHAIN (candidates
))
1124 || (templates
&& candidates
))
1126 cp_error_at ("ambiguous template specialization `%D' for `%+D'",
1128 chainon (candidates
, templates
);
1129 print_candidates (candidates
);
1130 return error_mark_node
;
1133 /* We have one, and exactly one, match. */
1136 /* It was a specialization of an ordinary member function in a
1138 *targs_out
= copy_node (DECL_TI_ARGS (TREE_VALUE (candidates
)));
1139 return DECL_TI_TEMPLATE (TREE_VALUE (candidates
));
1142 /* It was a specialization of a template. */
1143 targs
= DECL_TI_ARGS (DECL_TEMPLATE_RESULT (TREE_VALUE (templates
)));
1144 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (targs
))
1146 *targs_out
= copy_node (targs
);
1147 SET_TMPL_ARGS_LEVEL (*targs_out
,
1148 TMPL_ARGS_DEPTH (*targs_out
),
1149 TREE_PURPOSE (templates
));
1152 *targs_out
= TREE_PURPOSE (templates
);
1153 return TREE_VALUE (templates
);
1156 /* Check to see if the function just declared, as indicated in
1157 DECLARATOR, and in DECL, is a specialization of a function
1158 template. We may also discover that the declaration is an explicit
1159 instantiation at this point.
1161 Returns DECL, or an equivalent declaration that should be used
1162 instead if all goes well. Issues an error message if something is
1163 amiss. Returns error_mark_node if the error is not easily
1166 FLAGS is a bitmask consisting of the following flags:
1168 2: The function has a definition.
1169 4: The function is a friend.
1171 The TEMPLATE_COUNT is the number of references to qualifying
1172 template classes that appeared in the name of the function. For
1175 template <class T> struct S { void f(); };
1178 the TEMPLATE_COUNT would be 1. However, explicitly specialized
1179 classes are not counted in the TEMPLATE_COUNT, so that in
1181 template <class T> struct S {};
1182 template <> struct S<int> { void f(); }
1183 template <> void S<int>::f();
1185 the TEMPLATE_COUNT would be 0. (Note that this declaration is
1186 illegal; there should be no template <>.)
1188 If the function is a specialization, it is marked as such via
1189 DECL_TEMPLATE_SPECIALIZATION. Furthermore, its DECL_TEMPLATE_INFO
1190 is set up correctly, and it is added to the list of specializations
1191 for that template. */
1194 check_explicit_specialization (declarator
, decl
, template_count
, flags
)
1200 int have_def
= flags
& 2;
1201 int is_friend
= flags
& 4;
1202 int specialization
= 0;
1203 int explicit_instantiation
= 0;
1204 int member_specialization
= 0;
1205 tree ctype
= DECL_CLASS_CONTEXT (decl
);
1206 tree dname
= DECL_NAME (decl
);
1209 tsk
= current_tmpl_spec_kind (template_count
);
1214 if (processing_specialization
)
1217 SET_DECL_TEMPLATE_SPECIALIZATION (decl
);
1219 else if (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
)
1222 /* This could be something like:
1224 template <class T> void f(T);
1225 class S { friend void f<>(int); } */
1229 /* This case handles bogus declarations like template <>
1230 template <class T> void f<int>(); */
1232 cp_error ("template-id `%D' in declaration of primary template",
1239 case tsk_invalid_member_spec
:
1240 /* The error has already been reported in
1241 check_specialization_scope. */
1242 return error_mark_node
;
1244 case tsk_invalid_expl_inst
:
1245 cp_error ("template parameter list used in explicit instantiation");
1251 cp_error ("definition provided for explicit instantiation");
1253 explicit_instantiation
= 1;
1256 case tsk_excessive_parms
:
1257 cp_error ("too many template parameter lists in declaration of `%D'",
1259 return error_mark_node
;
1263 SET_DECL_TEMPLATE_SPECIALIZATION (decl
);
1265 member_specialization
= 1;
1270 case tsk_insufficient_parms
:
1271 if (template_header_count
)
1273 cp_error("too few template parameter lists in declaration of `%D'",
1277 else if (ctype
!= NULL_TREE
1278 && !TYPE_BEING_DEFINED (ctype
)
1279 && CLASSTYPE_TEMPLATE_INSTANTIATION (ctype
)
1282 /* For backwards compatibility, we accept:
1284 template <class T> struct S { void f(); };
1285 void S<int>::f() {} // Missing template <>
1287 That used to be legal C++. */
1290 ("explicit specialization not preceded by `template <>'");
1292 SET_DECL_TEMPLATE_SPECIALIZATION (decl
);
1297 if (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
)
1299 /* This case handles bogus declarations like template <>
1300 template <class T> void f<int>(); */
1302 if (uses_template_parms (declarator
))
1303 cp_error ("partial specialization `%D' of function template",
1306 cp_error ("template-id `%D' in declaration of primary template",
1311 if (ctype
&& CLASSTYPE_TEMPLATE_INSTANTIATION (ctype
))
1312 /* This is a specialization of a member template, without
1313 specialization the containing class. Something like:
1315 template <class T> struct S {
1316 template <class U> void f (U);
1318 template <> template <class U> void S<int>::f(U) {}
1320 That's a specialization -- but of the entire template. */
1325 my_friendly_abort (20000309);
1328 if (specialization
|| member_specialization
)
1330 tree t
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
1331 for (; t
; t
= TREE_CHAIN (t
))
1332 if (TREE_PURPOSE (t
))
1335 ("default argument specified in explicit specialization");
1338 if (current_lang_name
== lang_name_c
)
1339 cp_error ("template specialization with C linkage");
1342 if (specialization
|| member_specialization
|| explicit_instantiation
)
1344 tree tmpl
= NULL_TREE
;
1345 tree targs
= NULL_TREE
;
1347 /* Make sure that the declarator is a TEMPLATE_ID_EXPR. */
1348 if (TREE_CODE (declarator
) != TEMPLATE_ID_EXPR
)
1352 my_friendly_assert (TREE_CODE (declarator
) == IDENTIFIER_NODE
,
1355 fns
= IDENTIFIER_NAMESPACE_VALUE (dname
);
1360 lookup_template_function (fns
, NULL_TREE
);
1363 if (declarator
== error_mark_node
)
1364 return error_mark_node
;
1366 if (ctype
!= NULL_TREE
&& TYPE_BEING_DEFINED (ctype
))
1368 if (!explicit_instantiation
)
1369 /* A specialization in class scope. This is illegal,
1370 but the error will already have been flagged by
1371 check_specialization_scope. */
1372 return error_mark_node
;
1375 /* It's not legal to write an explicit instantiation in
1378 class C { template void f(); }
1380 This case is caught by the parser. However, on
1383 template class C { void f(); };
1385 (which is illegal) we can get here. The error will be
1392 else if (TREE_CODE (TREE_OPERAND (declarator
, 0)) == LOOKUP_EXPR
)
1394 /* A friend declaration. We can't do much, because we don't
1395 know what this resolves to, yet. */
1396 my_friendly_assert (is_friend
!= 0, 0);
1397 my_friendly_assert (!explicit_instantiation
, 0);
1398 SET_DECL_IMPLICIT_INSTANTIATION (decl
);
1401 else if (ctype
!= NULL_TREE
1402 && (TREE_CODE (TREE_OPERAND (declarator
, 0)) ==
1405 /* Find the list of functions in ctype that have the same
1406 name as the declared function. */
1407 tree name
= TREE_OPERAND (declarator
, 0);
1408 tree fns
= NULL_TREE
;
1411 if (name
== constructor_name (ctype
)
1412 || name
== constructor_name_full (ctype
))
1414 int is_constructor
= DECL_CONSTRUCTOR_P (decl
);
1416 if (is_constructor
? !TYPE_HAS_CONSTRUCTOR (ctype
)
1417 : !TYPE_HAS_DESTRUCTOR (ctype
))
1419 /* From [temp.expl.spec]:
1421 If such an explicit specialization for the member
1422 of a class template names an implicitly-declared
1423 special member function (clause _special_), the
1424 program is ill-formed.
1426 Similar language is found in [temp.explicit]. */
1427 cp_error ("specialization of implicitly-declared special member function");
1428 return error_mark_node
;
1431 name
= is_constructor
? ctor_identifier
: dtor_identifier
;
1434 if (!DECL_CONV_FN_P (decl
))
1436 idx
= lookup_fnfields_1 (ctype
, name
);
1438 fns
= TREE_VEC_ELT (CLASSTYPE_METHOD_VEC (ctype
), idx
);
1444 /* For a type-conversion operator, we cannot do a
1445 name-based lookup. We might be looking for `operator
1446 int' which will be a specialization of `operator T'.
1447 So, we find *all* the conversion operators, and then
1448 select from them. */
1451 methods
= CLASSTYPE_METHOD_VEC (ctype
);
1453 for (idx
= 2; idx
< TREE_VEC_LENGTH (methods
); ++idx
)
1455 tree ovl
= TREE_VEC_ELT (methods
, idx
);
1457 if (!ovl
|| !DECL_CONV_FN_P (OVL_CURRENT (ovl
)))
1458 /* There are no more conversion functions. */
1461 /* Glue all these conversion functions together
1462 with those we already have. */
1463 for (; ovl
; ovl
= OVL_NEXT (ovl
))
1464 fns
= ovl_cons (OVL_CURRENT (ovl
), fns
);
1468 if (fns
== NULL_TREE
)
1470 cp_error ("no member function `%D' declared in `%T'",
1472 return error_mark_node
;
1475 TREE_OPERAND (declarator
, 0) = fns
;
1478 /* Figure out what exactly is being specialized at this point.
1479 Note that for an explicit instantiation, even one for a
1480 member function, we cannot tell apriori whether the
1481 instantiation is for a member template, or just a member
1482 function of a template class. Even if a member template is
1483 being instantiated, the member template arguments may be
1484 elided if they can be deduced from the rest of the
1486 tmpl
= determine_specialization (declarator
, decl
,
1488 member_specialization
);
1490 if (!tmpl
|| tmpl
== error_mark_node
)
1491 /* We couldn't figure out what this declaration was
1493 return error_mark_node
;
1496 tree gen_tmpl
= most_general_template (tmpl
);
1498 if (explicit_instantiation
)
1500 /* We don't set DECL_EXPLICIT_INSTANTIATION here; that
1501 is done by do_decl_instantiation later. */
1503 int arg_depth
= TMPL_ARGS_DEPTH (targs
);
1504 int parm_depth
= TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl
));
1506 if (arg_depth
> parm_depth
)
1508 /* If TMPL is not the most general template (for
1509 example, if TMPL is a friend template that is
1510 injected into namespace scope), then there will
1511 be too many levels of TARGS. Remove some of them
1516 new_targs
= make_tree_vec (parm_depth
);
1517 for (i
= arg_depth
- parm_depth
; i
< arg_depth
; ++i
)
1518 TREE_VEC_ELT (new_targs
, i
- (arg_depth
- parm_depth
))
1519 = TREE_VEC_ELT (targs
, i
);
1523 return instantiate_template (tmpl
, targs
);
1526 /* If this is a specialization of a member template of a
1527 template class. In we want to return the TEMPLATE_DECL,
1528 not the specialization of it. */
1529 if (tsk
== tsk_template
)
1531 SET_DECL_TEMPLATE_SPECIALIZATION (tmpl
);
1532 DECL_INITIAL (DECL_TEMPLATE_RESULT (tmpl
)) = NULL_TREE
;
1536 /* If we though that the DECL was a member function, but it
1537 turns out to be specializing a static member function,
1538 make DECL a static member function as well. */
1539 if (DECL_STATIC_FUNCTION_P (tmpl
)
1540 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
1542 revert_static_member_fn (decl
);
1543 last_function_parms
= TREE_CHAIN (last_function_parms
);
1546 /* Set up the DECL_TEMPLATE_INFO for DECL. */
1547 DECL_TEMPLATE_INFO (decl
) = tree_cons (tmpl
, targs
, NULL_TREE
);
1549 /* Mangle the function name appropriately. Note that we do
1550 not mangle specializations of non-template member
1551 functions of template classes, e.g. with
1553 template <class T> struct S { void f(); }
1555 and given the specialization
1557 template <> void S<int>::f() {}
1559 we do not mangle S<int>::f() here. That's because it's
1560 just an ordinary member function and doesn't need special
1561 treatment. We do this here so that the ordinary,
1562 non-template, name-mangling algorithm will not be used
1564 if ((is_member_template (tmpl
) || ctype
== NULL_TREE
)
1565 && name_mangling_version
>= 1)
1566 set_mangled_name_for_template_decl (decl
);
1568 if (is_friend
&& !have_def
)
1569 /* This is not really a declaration of a specialization.
1570 It's just the name of an instantiation. But, it's not
1571 a request for an instantiation, either. */
1572 SET_DECL_IMPLICIT_INSTANTIATION (decl
);
1574 /* Register this specialization so that we can find it
1576 decl
= register_specialization (decl
, gen_tmpl
, targs
);
1583 /* TYPE is being declared. Verify that the use of template headers
1584 and such is reasonable. Issue error messages if not. */
1587 maybe_check_template_type (type
)
1590 if (template_header_count
)
1592 /* We are in the scope of some `template <...>' header. */
1595 = template_class_depth_real (TYPE_CONTEXT (type
),
1596 /*count_specializations=*/1);
1598 if (template_header_count
<= context_depth
)
1599 /* This is OK; the template headers are for the context. We
1600 are actually too lenient here; like
1601 check_explicit_specialization we should consider the number
1602 of template types included in the actual declaration. For
1605 template <class T> struct S {
1606 template <class U> template <class V>
1612 template <class T> struct S {
1613 template <class U> struct I;
1616 template <class T> template <class U.
1621 else if (template_header_count
> context_depth
+ 1)
1622 /* There are two many template parameter lists. */
1623 cp_error ("too many template parameter lists in declaration of `%T'", type
);
1627 /* Returns 1 iff PARMS1 and PARMS2 are identical sets of template
1628 parameters. These are represented in the same format used for
1629 DECL_TEMPLATE_PARMS. */
1631 int comp_template_parms (parms1
, parms2
)
1638 if (parms1
== parms2
)
1641 for (p1
= parms1
, p2
= parms2
;
1642 p1
!= NULL_TREE
&& p2
!= NULL_TREE
;
1643 p1
= TREE_CHAIN (p1
), p2
= TREE_CHAIN (p2
))
1645 tree t1
= TREE_VALUE (p1
);
1646 tree t2
= TREE_VALUE (p2
);
1649 my_friendly_assert (TREE_CODE (t1
) == TREE_VEC
, 0);
1650 my_friendly_assert (TREE_CODE (t2
) == TREE_VEC
, 0);
1652 if (TREE_VEC_LENGTH (t1
) != TREE_VEC_LENGTH (t2
))
1655 for (i
= 0; i
< TREE_VEC_LENGTH (t2
); ++i
)
1657 tree parm1
= TREE_VALUE (TREE_VEC_ELT (t1
, i
));
1658 tree parm2
= TREE_VALUE (TREE_VEC_ELT (t2
, i
));
1660 if (TREE_CODE (parm1
) != TREE_CODE (parm2
))
1663 if (TREE_CODE (parm1
) == TEMPLATE_TYPE_PARM
)
1665 else if (!same_type_p (TREE_TYPE (parm1
), TREE_TYPE (parm2
)))
1670 if ((p1
!= NULL_TREE
) != (p2
!= NULL_TREE
))
1671 /* One set of parameters has more parameters lists than the
1678 /* Complain if DECL shadows a template parameter.
1680 [temp.local]: A template-parameter shall not be redeclared within its
1681 scope (including nested scopes). */
1684 check_template_shadow (decl
)
1689 /* If we're not in a template, we can't possibly shadow a template
1691 if (!current_template_parms
)
1694 /* Figure out what we're shadowing. */
1695 if (TREE_CODE (decl
) == OVERLOAD
)
1696 decl
= OVL_CURRENT (decl
);
1697 olddecl
= IDENTIFIER_VALUE (DECL_NAME (decl
));
1699 /* If there's no previous binding for this name, we're not shadowing
1700 anything, let alone a template parameter. */
1704 /* If we're not shadowing a template parameter, we're done. Note
1705 that OLDDECL might be an OVERLOAD (or perhaps even an
1706 ERROR_MARK), so we can't just blithely assume it to be a _DECL
1708 if (!DECL_P (olddecl
) || !DECL_TEMPLATE_PARM_P (olddecl
))
1711 /* We check for decl != olddecl to avoid bogus errors for using a
1712 name inside a class. We check TPFI to avoid duplicate errors for
1713 inline member templates. */
1715 || TEMPLATE_PARMS_FOR_INLINE (current_template_parms
))
1718 cp_error_at ("declaration of `%#D'", decl
);
1719 cp_error_at (" shadows template parm `%#D'", olddecl
);
1722 /* Return a new TEMPLATE_PARM_INDEX with the indicated INDEX, LEVEL,
1723 ORIG_LEVEL, DECL, and TYPE. */
1726 build_template_parm_index (index
, level
, orig_level
, decl
, type
)
1733 tree t
= make_node (TEMPLATE_PARM_INDEX
);
1734 TEMPLATE_PARM_IDX (t
) = index
;
1735 TEMPLATE_PARM_LEVEL (t
) = level
;
1736 TEMPLATE_PARM_ORIG_LEVEL (t
) = orig_level
;
1737 TEMPLATE_PARM_DECL (t
) = decl
;
1738 TREE_TYPE (t
) = type
;
1743 /* Return a TEMPLATE_PARM_INDEX, similar to INDEX, but whose
1744 TEMPLATE_PARM_LEVEL has been decreased by LEVELS. If such a
1745 TEMPLATE_PARM_INDEX already exists, it is returned; otherwise, a
1746 new one is created. */
1749 reduce_template_parm_level (index
, type
, levels
)
1754 if (TEMPLATE_PARM_DESCENDANTS (index
) == NULL_TREE
1755 || (TEMPLATE_PARM_LEVEL (TEMPLATE_PARM_DESCENDANTS (index
))
1756 != TEMPLATE_PARM_LEVEL (index
) - levels
))
1759 = build_decl (TREE_CODE (TEMPLATE_PARM_DECL (index
)),
1760 DECL_NAME (TEMPLATE_PARM_DECL (index
)),
1763 = build_template_parm_index (TEMPLATE_PARM_IDX (index
),
1764 TEMPLATE_PARM_LEVEL (index
) - levels
,
1765 TEMPLATE_PARM_ORIG_LEVEL (index
),
1767 TEMPLATE_PARM_DESCENDANTS (index
) = t
;
1769 /* Template template parameters need this. */
1770 DECL_TEMPLATE_PARMS (decl
)
1771 = DECL_TEMPLATE_PARMS (TEMPLATE_PARM_DECL (index
));
1774 return TEMPLATE_PARM_DESCENDANTS (index
);
1777 /* Process information from new template parameter NEXT and append it to the
1778 LIST being built. */
1781 process_template_parm (list
, next
)
1790 my_friendly_assert (TREE_CODE (parm
) == TREE_LIST
, 259);
1791 defval
= TREE_PURPOSE (parm
);
1792 parm
= TREE_VALUE (parm
);
1793 is_type
= TREE_PURPOSE (parm
) == class_type_node
;
1797 tree p
= TREE_VALUE (tree_last (list
));
1799 if (TREE_CODE (p
) == TYPE_DECL
|| TREE_CODE (p
) == TEMPLATE_DECL
)
1800 idx
= TEMPLATE_TYPE_IDX (TREE_TYPE (p
));
1802 idx
= TEMPLATE_PARM_IDX (DECL_INITIAL (p
));
1810 my_friendly_assert (TREE_CODE (TREE_PURPOSE (parm
)) == TREE_LIST
, 260);
1811 /* is a const-param */
1812 parm
= grokdeclarator (TREE_VALUE (parm
), TREE_PURPOSE (parm
),
1813 PARM
, 0, NULL_TREE
);
1817 The top-level cv-qualifiers on the template-parameter are
1818 ignored when determining its type. */
1819 TREE_TYPE (parm
) = TYPE_MAIN_VARIANT (TREE_TYPE (parm
));
1821 /* A template parameter is not modifiable. */
1822 TREE_READONLY (parm
) = 1;
1823 if (IS_AGGR_TYPE (TREE_TYPE (parm
))
1824 && TREE_CODE (TREE_TYPE (parm
)) != TEMPLATE_TYPE_PARM
1825 && TREE_CODE (TREE_TYPE (parm
)) != TYPENAME_TYPE
)
1827 cp_error ("`%#T' is not a valid type for a template constant parameter",
1829 if (DECL_NAME (parm
) == NULL_TREE
)
1830 error (" a template type parameter must begin with `class' or `typename'");
1831 TREE_TYPE (parm
) = void_type_node
;
1834 && (TREE_CODE (TREE_TYPE (parm
)) == REAL_TYPE
1835 || TREE_CODE (TREE_TYPE (parm
)) == COMPLEX_TYPE
))
1836 cp_pedwarn ("`%T' is not a valid type for a template constant parameter",
1838 decl
= build_decl (CONST_DECL
, DECL_NAME (parm
), TREE_TYPE (parm
));
1839 DECL_INITIAL (parm
) = DECL_INITIAL (decl
)
1840 = build_template_parm_index (idx
, processing_template_decl
,
1841 processing_template_decl
,
1842 decl
, TREE_TYPE (parm
));
1847 parm
= TREE_VALUE (parm
);
1849 if (parm
&& TREE_CODE (parm
) == TEMPLATE_DECL
)
1851 t
= make_aggr_type (TEMPLATE_TEMPLATE_PARM
);
1852 /* This is for distinguishing between real templates and template
1853 template parameters */
1854 TREE_TYPE (parm
) = t
;
1855 TREE_TYPE (DECL_TEMPLATE_RESULT (parm
)) = t
;
1860 t
= make_aggr_type (TEMPLATE_TYPE_PARM
);
1861 /* parm is either IDENTIFIER_NODE or NULL_TREE */
1862 decl
= build_decl (TYPE_DECL
, parm
, t
);
1865 TYPE_NAME (t
) = decl
;
1866 TYPE_STUB_DECL (t
) = decl
;
1868 TEMPLATE_TYPE_PARM_INDEX (t
)
1869 = build_template_parm_index (idx
, processing_template_decl
,
1870 processing_template_decl
,
1871 decl
, TREE_TYPE (parm
));
1873 DECL_ARTIFICIAL (decl
) = 1;
1874 SET_DECL_TEMPLATE_PARM_P (decl
);
1876 parm
= build_tree_list (defval
, parm
);
1877 return chainon (list
, parm
);
1880 /* The end of a template parameter list has been reached. Process the
1881 tree list into a parameter vector, converting each parameter into a more
1882 useful form. Type parameters are saved as IDENTIFIER_NODEs, and others
1886 end_template_parm_list (parms
)
1891 tree saved_parmlist
= make_tree_vec (list_length (parms
));
1893 current_template_parms
1894 = tree_cons (build_int_2 (0, processing_template_decl
),
1895 saved_parmlist
, current_template_parms
);
1897 for (parm
= parms
, nparms
= 0;
1899 parm
= TREE_CHAIN (parm
), nparms
++)
1900 TREE_VEC_ELT (saved_parmlist
, nparms
) = parm
;
1902 --processing_template_parmlist
;
1904 return saved_parmlist
;
1907 /* end_template_decl is called after a template declaration is seen. */
1910 end_template_decl ()
1912 reset_specialization ();
1914 if (! processing_template_decl
)
1917 /* This matches the pushlevel in begin_template_parm_list. */
1920 --processing_template_decl
;
1921 current_template_parms
= TREE_CHAIN (current_template_parms
);
1924 /* Given a template argument vector containing the template PARMS.
1925 The innermost PARMS are given first. */
1928 current_template_args ()
1931 tree args
= NULL_TREE
;
1932 int length
= TMPL_PARMS_DEPTH (current_template_parms
);
1935 /* If there is only one level of template parameters, we do not
1936 create a TREE_VEC of TREE_VECs. Instead, we return a single
1937 TREE_VEC containing the arguments. */
1939 args
= make_tree_vec (length
);
1941 for (header
= current_template_parms
; header
; header
= TREE_CHAIN (header
))
1943 tree a
= copy_node (TREE_VALUE (header
));
1946 TREE_TYPE (a
) = NULL_TREE
;
1947 for (i
= TREE_VEC_LENGTH (a
) - 1; i
>= 0; --i
)
1949 tree t
= TREE_VEC_ELT (a
, i
);
1951 /* T will be a list if we are called from within a
1952 begin/end_template_parm_list pair, but a vector directly
1953 if within a begin/end_member_template_processing pair. */
1954 if (TREE_CODE (t
) == TREE_LIST
)
1958 if (TREE_CODE (t
) == TYPE_DECL
1959 || TREE_CODE (t
) == TEMPLATE_DECL
)
1962 t
= DECL_INITIAL (t
);
1963 TREE_VEC_ELT (a
, i
) = t
;
1968 TREE_VEC_ELT (args
, --l
) = a
;
1976 /* Return a TEMPLATE_DECL corresponding to DECL, using the indicated
1977 template PARMS. Used by push_template_decl below. */
1980 build_template_decl (decl
, parms
)
1984 tree tmpl
= build_lang_decl (TEMPLATE_DECL
, DECL_NAME (decl
), NULL_TREE
);
1985 DECL_TEMPLATE_PARMS (tmpl
) = parms
;
1986 DECL_CONTEXT (tmpl
) = DECL_CONTEXT (decl
);
1987 if (DECL_LANG_SPECIFIC (decl
))
1989 if (CAN_HAVE_FULL_LANG_DECL_P (decl
))
1990 DECL_VIRTUAL_CONTEXT (tmpl
) = DECL_VIRTUAL_CONTEXT (decl
);
1991 DECL_STATIC_FUNCTION_P (tmpl
) = DECL_STATIC_FUNCTION_P (decl
);
1992 DECL_CONSTRUCTOR_P (tmpl
) = DECL_CONSTRUCTOR_P (decl
);
1993 DECL_NONCONVERTING_P (tmpl
) = DECL_NONCONVERTING_P (decl
);
1994 DECL_ASSIGNMENT_OPERATOR_P (tmpl
) = DECL_ASSIGNMENT_OPERATOR_P (decl
);
1995 if (DECL_OVERLOADED_OPERATOR_P (decl
))
1996 SET_OVERLOADED_OPERATOR_CODE (tmpl
,
1997 DECL_OVERLOADED_OPERATOR_P (decl
));
2003 struct template_parm_data
2005 /* The level of the template parameters we are currently
2009 /* The index of the specialization argument we are currently
2013 /* An array whose size is the number of template parameters. The
2014 elements are non-zero if the parameter has been used in any one
2015 of the arguments processed so far. */
2018 /* An array whose size is the number of template arguments. The
2019 elements are non-zero if the argument makes use of template
2020 parameters of this level. */
2021 int* arg_uses_template_parms
;
2024 /* Subroutine of push_template_decl used to see if each template
2025 parameter in a partial specialization is used in the explicit
2026 argument list. If T is of the LEVEL given in DATA (which is
2027 treated as a template_parm_data*), then DATA->PARMS is marked
2031 mark_template_parm (t
, data
)
2037 struct template_parm_data
* tpd
= (struct template_parm_data
*) data
;
2039 if (TREE_CODE (t
) == TEMPLATE_PARM_INDEX
)
2041 level
= TEMPLATE_PARM_LEVEL (t
);
2042 idx
= TEMPLATE_PARM_IDX (t
);
2046 level
= TEMPLATE_TYPE_LEVEL (t
);
2047 idx
= TEMPLATE_TYPE_IDX (t
);
2050 if (level
== tpd
->level
)
2052 tpd
->parms
[idx
] = 1;
2053 tpd
->arg_uses_template_parms
[tpd
->current_arg
] = 1;
2056 /* Return zero so that for_each_template_parm will continue the
2057 traversal of the tree; we want to mark *every* template parm. */
2061 /* Process the partial specialization DECL. */
2064 process_partial_specialization (decl
)
2067 tree type
= TREE_TYPE (decl
);
2068 tree maintmpl
= CLASSTYPE_TI_TEMPLATE (type
);
2069 tree specargs
= CLASSTYPE_TI_ARGS (type
);
2070 tree inner_args
= INNERMOST_TEMPLATE_ARGS (specargs
);
2071 tree inner_parms
= INNERMOST_TEMPLATE_PARMS (current_template_parms
);
2072 tree main_inner_parms
= DECL_INNERMOST_TEMPLATE_PARMS (maintmpl
);
2073 int nargs
= TREE_VEC_LENGTH (inner_args
);
2074 int ntparms
= TREE_VEC_LENGTH (inner_parms
);
2076 int did_error_intro
= 0;
2077 struct template_parm_data tpd
;
2078 struct template_parm_data tpd2
;
2080 /* We check that each of the template parameters given in the
2081 partial specialization is used in the argument list to the
2082 specialization. For example:
2084 template <class T> struct S;
2085 template <class T> struct S<T*>;
2087 The second declaration is OK because `T*' uses the template
2088 parameter T, whereas
2090 template <class T> struct S<int>;
2092 is no good. Even trickier is:
2103 The S2<T> declaration is actually illegal; it is a
2104 full-specialization. Of course,
2107 struct S2<T (*)(U)>;
2109 or some such would have been OK. */
2110 tpd
.level
= TMPL_PARMS_DEPTH (current_template_parms
);
2111 tpd
.parms
= alloca (sizeof (int) * ntparms
);
2112 memset ((PTR
) tpd
.parms
, 0, sizeof (int) * ntparms
);
2114 tpd
.arg_uses_template_parms
= alloca (sizeof (int) * nargs
);
2115 memset ((PTR
) tpd
.arg_uses_template_parms
, 0, sizeof (int) * nargs
);
2116 for (i
= 0; i
< nargs
; ++i
)
2118 tpd
.current_arg
= i
;
2119 for_each_template_parm (TREE_VEC_ELT (inner_args
, i
),
2120 &mark_template_parm
,
2123 for (i
= 0; i
< ntparms
; ++i
)
2124 if (tpd
.parms
[i
] == 0)
2126 /* One of the template parms was not used in the
2128 if (!did_error_intro
)
2130 cp_error ("template parameters not used in partial specialization:");
2131 did_error_intro
= 1;
2135 TREE_VALUE (TREE_VEC_ELT (inner_parms
, i
)));
2138 /* [temp.class.spec]
2140 The argument list of the specialization shall not be identical to
2141 the implicit argument list of the primary template. */
2142 if (comp_template_args
2144 INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (TREE_TYPE
2146 cp_error ("partial specialization `%T' does not specialize any template arguments", type
);
2148 /* [temp.class.spec]
2150 A partially specialized non-type argument expression shall not
2151 involve template parameters of the partial specialization except
2152 when the argument expression is a simple identifier.
2154 The type of a template parameter corresponding to a specialized
2155 non-type argument shall not be dependent on a parameter of the
2157 my_friendly_assert (nargs
== DECL_NTPARMS (maintmpl
), 0);
2159 for (i
= 0; i
< nargs
; ++i
)
2161 tree arg
= TREE_VEC_ELT (inner_args
, i
);
2162 if (/* These first two lines are the `non-type' bit. */
2164 && TREE_CODE (arg
) != TEMPLATE_DECL
2165 /* This next line is the `argument expression is not just a
2166 simple identifier' condition and also the `specialized
2167 non-type argument' bit. */
2168 && TREE_CODE (arg
) != TEMPLATE_PARM_INDEX
)
2170 if (tpd
.arg_uses_template_parms
[i
])
2171 cp_error ("template argument `%E' involves template parameter(s)", arg
);
2174 /* Look at the corresponding template parameter,
2175 marking which template parameters its type depends
2178 TREE_TYPE (TREE_VALUE (TREE_VEC_ELT (main_inner_parms
,
2183 /* We haven't yet initialized TPD2. Do so now. */
2184 tpd2
.arg_uses_template_parms
2185 = (int*) alloca (sizeof (int) * nargs
);
2186 /* The number of parameters here is the number in the
2187 main template, which, as checked in the assertion
2189 tpd2
.parms
= (int*) alloca (sizeof (int) * nargs
);
2191 TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (maintmpl
));
2194 /* Mark the template parameters. But this time, we're
2195 looking for the template parameters of the main
2196 template, not in the specialization. */
2197 tpd2
.current_arg
= i
;
2198 tpd2
.arg_uses_template_parms
[i
] = 0;
2199 memset ((PTR
) tpd2
.parms
, 0, sizeof (int) * nargs
);
2200 for_each_template_parm (type
,
2201 &mark_template_parm
,
2204 if (tpd2
.arg_uses_template_parms
[i
])
2206 /* The type depended on some template parameters.
2207 If they are fully specialized in the
2208 specialization, that's OK. */
2210 for (j
= 0; j
< nargs
; ++j
)
2211 if (tpd2
.parms
[j
] != 0
2212 && tpd
.arg_uses_template_parms
[j
])
2214 cp_error ("type `%T' of template argument `%E' depends on template parameter(s)",
2224 if (retrieve_specialization (maintmpl
, specargs
))
2225 /* We've already got this specialization. */
2228 DECL_TEMPLATE_SPECIALIZATIONS (maintmpl
)
2229 = tree_cons (inner_args
, inner_parms
,
2230 DECL_TEMPLATE_SPECIALIZATIONS (maintmpl
));
2231 TREE_TYPE (DECL_TEMPLATE_SPECIALIZATIONS (maintmpl
)) = type
;
2235 /* Check that a template declaration's use of default arguments is not
2236 invalid. Here, PARMS are the template parameters. IS_PRIMARY is
2237 non-zero if DECL is the thing declared by a primary template.
2238 IS_PARTIAL is non-zero if DECL is a partial specialization. */
2241 check_default_tmpl_args (decl
, parms
, is_primary
, is_partial
)
2248 int last_level_to_check
;
2253 A default template-argument shall not be specified in a
2254 function template declaration or a function template definition, nor
2255 in the template-parameter-list of the definition of a member of a
2258 if (TREE_CODE (CP_DECL_CONTEXT (decl
)) == FUNCTION_DECL
)
2259 /* You can't have a function template declaration in a local
2260 scope, nor you can you define a member of a class template in a
2264 if (current_class_type
2265 && !TYPE_BEING_DEFINED (current_class_type
)
2266 && DECL_LANG_SPECIFIC (decl
)
2267 /* If this is either a friend defined in the scope of the class
2268 or a member function. */
2269 && ((DECL_CONTEXT (decl
)
2270 && same_type_p (DECL_CONTEXT (decl
), current_class_type
))
2271 || (DECL_FRIEND_CONTEXT (decl
)
2272 && same_type_p (DECL_FRIEND_CONTEXT (decl
),
2273 current_class_type
)))
2274 /* And, if it was a member function, it really was defined in
2275 the scope of the class. */
2276 && (!DECL_FUNCTION_MEMBER_P (decl
) || DECL_DEFINED_IN_CLASS_P (decl
)))
2277 /* We already checked these parameters when the template was
2278 declared, so there's no need to do it again now. This function
2279 was defined in class scope, but we're processing it's body now
2280 that the class is complete. */
2285 If a template-parameter has a default template-argument, all
2286 subsequent template-parameters shall have a default
2287 template-argument supplied. */
2288 for (parm_level
= parms
; parm_level
; parm_level
= TREE_CHAIN (parm_level
))
2290 tree inner_parms
= TREE_VALUE (parm_level
);
2291 int ntparms
= TREE_VEC_LENGTH (inner_parms
);
2292 int seen_def_arg_p
= 0;
2295 for (i
= 0; i
< ntparms
; ++i
)
2297 tree parm
= TREE_VEC_ELT (inner_parms
, i
);
2298 if (TREE_PURPOSE (parm
))
2300 else if (seen_def_arg_p
)
2302 cp_error ("no default argument for `%D'", TREE_VALUE (parm
));
2303 /* For better subsequent error-recovery, we indicate that
2304 there should have been a default argument. */
2305 TREE_PURPOSE (parm
) = error_mark_node
;
2310 if (TREE_CODE (decl
) != TYPE_DECL
|| is_partial
|| !is_primary
)
2311 /* For an ordinary class template, default template arguments are
2312 allowed at the innermost level, e.g.:
2313 template <class T = int>
2315 but, in a partial specialization, they're not allowed even
2316 there, as we have in [temp.class.spec]:
2318 The template parameter list of a specialization shall not
2319 contain default template argument values.
2321 So, for a partial specialization, or for a function template,
2322 we look at all of them. */
2325 /* But, for a primary class template that is not a partial
2326 specialization we look at all template parameters except the
2328 parms
= TREE_CHAIN (parms
);
2330 /* Figure out what error message to issue. */
2331 if (TREE_CODE (decl
) == FUNCTION_DECL
)
2332 msg
= "default argument for template parameter in function template `%D'";
2333 else if (is_partial
)
2334 msg
= "default argument in partial specialization `%D'";
2336 msg
= "default argument for template parameter for class enclosing `%D'";
2338 if (current_class_type
&& TYPE_BEING_DEFINED (current_class_type
))
2339 /* If we're inside a class definition, there's no need to
2340 examine the parameters to the class itself. On the one
2341 hand, they will be checked when the class is defined, and,
2342 on the other, default arguments are legal in things like:
2343 template <class T = double>
2344 struct S { template <class U> void f(U); };
2345 Here the default argument for `S' has no bearing on the
2346 declaration of `f'. */
2347 last_level_to_check
= template_class_depth (current_class_type
) + 1;
2349 /* Check everything. */
2350 last_level_to_check
= 0;
2352 for (parm_level
= parms
;
2353 parm_level
&& TMPL_PARMS_DEPTH (parm_level
) >= last_level_to_check
;
2354 parm_level
= TREE_CHAIN (parm_level
))
2356 tree inner_parms
= TREE_VALUE (parm_level
);
2360 ntparms
= TREE_VEC_LENGTH (inner_parms
);
2361 for (i
= 0; i
< ntparms
; ++i
)
2362 if (TREE_PURPOSE (TREE_VEC_ELT (inner_parms
, i
)))
2366 cp_error (msg
, decl
);
2370 /* Clear out the default argument so that we are not
2372 TREE_PURPOSE (TREE_VEC_ELT (inner_parms
, i
)) = NULL_TREE
;
2375 /* At this point, if we're still interested in issuing messages,
2376 they must apply to classes surrounding the object declared. */
2378 msg
= "default argument for template parameter for class enclosing `%D'";
2382 /* Creates a TEMPLATE_DECL for the indicated DECL using the template
2383 parameters given by current_template_args, or reuses a
2384 previously existing one, if appropriate. Returns the DECL, or an
2385 equivalent one, if it is replaced via a call to duplicate_decls.
2387 If IS_FRIEND is non-zero, DECL is a friend declaration. */
2390 push_template_decl_real (decl
, is_friend
)
2400 int new_template_p
= 0;
2402 /* See if this is a partial specialization. */
2403 is_partial
= (DECL_IMPLICIT_TYPEDEF_P (decl
)
2404 && TREE_CODE (TREE_TYPE (decl
)) != ENUMERAL_TYPE
2405 && CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_TYPE (decl
)));
2407 is_friend
|= (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_FRIEND_P (decl
));
2410 /* For a friend, we want the context of the friend function, not
2411 the type of which it is a friend. */
2412 ctx
= DECL_CONTEXT (decl
);
2413 else if (CP_DECL_CONTEXT (decl
)
2414 && TREE_CODE (CP_DECL_CONTEXT (decl
)) != NAMESPACE_DECL
)
2415 /* In the case of a virtual function, we want the class in which
2417 ctx
= CP_DECL_CONTEXT (decl
);
2419 /* Otherwise, if we're currently defining some class, the DECL
2420 is assumed to be a member of the class. */
2421 ctx
= current_scope ();
2423 if (ctx
&& TREE_CODE (ctx
) == NAMESPACE_DECL
)
2426 if (!DECL_CONTEXT (decl
))
2427 DECL_CONTEXT (decl
) = FROB_CONTEXT (current_namespace
);
2429 /* See if this is a primary template. */
2430 primary
= template_parm_scope_p ();
2434 if (current_lang_name
== lang_name_c
)
2435 cp_error ("template with C linkage");
2436 else if (TREE_CODE (decl
) == TYPE_DECL
2437 && ANON_AGGRNAME_P (DECL_NAME (decl
)))
2438 cp_error ("template class without a name");
2439 else if ((DECL_IMPLICIT_TYPEDEF_P (decl
)
2440 && CLASS_TYPE_P (TREE_TYPE (decl
)))
2441 || (TREE_CODE (decl
) == VAR_DECL
&& ctx
&& CLASS_TYPE_P (ctx
))
2442 || TREE_CODE (decl
) == FUNCTION_DECL
)
2445 cp_error ("template declaration of `%#D'", decl
);
2448 /* Check to see that the rules regarding the use of default
2449 arguments are not being violated. */
2450 check_default_tmpl_args (decl
, current_template_parms
,
2451 primary
, is_partial
);
2454 return process_partial_specialization (decl
);
2456 args
= current_template_args ();
2459 || TREE_CODE (ctx
) == FUNCTION_DECL
2460 || TYPE_BEING_DEFINED (ctx
)
2461 || (is_friend
&& !DECL_TEMPLATE_INFO (decl
)))
2463 if (DECL_LANG_SPECIFIC (decl
)
2464 && DECL_TEMPLATE_INFO (decl
)
2465 && DECL_TI_TEMPLATE (decl
))
2466 tmpl
= DECL_TI_TEMPLATE (decl
);
2467 /* If DECL is a TYPE_DECL for a class-template, then there won't
2468 be DECL_LANG_SPECIFIC. The information equivalent to
2469 DECL_TEMPLATE_INFO is found in TYPE_TEMPLATE_INFO instead. */
2470 else if (DECL_IMPLICIT_TYPEDEF_P (decl
)
2471 && TYPE_TEMPLATE_INFO (TREE_TYPE (decl
))
2472 && TYPE_TI_TEMPLATE (TREE_TYPE (decl
)))
2474 /* Since a template declaration already existed for this
2475 class-type, we must be redeclaring it here. Make sure
2476 that the redeclaration is legal. */
2477 redeclare_class_template (TREE_TYPE (decl
),
2478 current_template_parms
);
2479 /* We don't need to create a new TEMPLATE_DECL; just use the
2480 one we already had. */
2481 tmpl
= TYPE_TI_TEMPLATE (TREE_TYPE (decl
));
2485 tmpl
= build_template_decl (decl
, current_template_parms
);
2488 if (DECL_LANG_SPECIFIC (decl
)
2489 && DECL_TEMPLATE_SPECIALIZATION (decl
))
2491 /* A specialization of a member template of a template
2493 SET_DECL_TEMPLATE_SPECIALIZATION (tmpl
);
2494 DECL_TEMPLATE_INFO (tmpl
) = DECL_TEMPLATE_INFO (decl
);
2495 DECL_TEMPLATE_INFO (decl
) = NULL_TREE
;
2501 tree a
, t
, current
, parms
;
2504 if (TREE_CODE (decl
) == TYPE_DECL
)
2506 if ((IS_AGGR_TYPE_CODE (TREE_CODE (TREE_TYPE (decl
)))
2507 || TREE_CODE (TREE_TYPE (decl
)) == ENUMERAL_TYPE
)
2508 && TYPE_TEMPLATE_INFO (TREE_TYPE (decl
))
2509 && TYPE_TI_TEMPLATE (TREE_TYPE (decl
)))
2510 tmpl
= TYPE_TI_TEMPLATE (TREE_TYPE (decl
));
2513 cp_error ("`%D' does not declare a template type", decl
);
2517 else if (! DECL_TEMPLATE_INFO (decl
))
2519 cp_error ("template definition of non-template `%#D'", decl
);
2523 tmpl
= DECL_TI_TEMPLATE (decl
);
2525 if (is_member_template (tmpl
)
2526 && DECL_FUNCTION_TEMPLATE_P (tmpl
)
2527 && DECL_TEMPLATE_INFO (decl
) && DECL_TI_ARGS (decl
)
2528 && DECL_TEMPLATE_SPECIALIZATION (decl
))
2532 /* The declaration is a specialization of a member
2533 template, declared outside the class. Therefore, the
2534 innermost template arguments will be NULL, so we
2535 replace them with the arguments determined by the
2536 earlier call to check_explicit_specialization. */
2537 args
= DECL_TI_ARGS (decl
);
2540 = build_template_decl (decl
, current_template_parms
);
2541 DECL_TEMPLATE_RESULT (new_tmpl
) = decl
;
2542 TREE_TYPE (new_tmpl
) = TREE_TYPE (decl
);
2543 DECL_TI_TEMPLATE (decl
) = new_tmpl
;
2544 SET_DECL_TEMPLATE_SPECIALIZATION (new_tmpl
);
2545 DECL_TEMPLATE_INFO (new_tmpl
)
2546 = tree_cons (tmpl
, args
, NULL_TREE
);
2548 register_specialization (new_tmpl
,
2549 most_general_template (tmpl
),
2554 /* Make sure the template headers we got make sense. */
2556 parms
= DECL_TEMPLATE_PARMS (tmpl
);
2557 i
= TMPL_PARMS_DEPTH (parms
);
2558 if (TMPL_ARGS_DEPTH (args
) != i
)
2560 cp_error ("expected %d levels of template parms for `%#D', got %d",
2561 i
, decl
, TMPL_ARGS_DEPTH (args
));
2564 for (current
= decl
; i
> 0; --i
, parms
= TREE_CHAIN (parms
))
2566 a
= TMPL_ARGS_LEVEL (args
, i
);
2567 t
= INNERMOST_TEMPLATE_PARMS (parms
);
2569 if (TREE_VEC_LENGTH (t
) != TREE_VEC_LENGTH (a
))
2571 if (current
== decl
)
2572 cp_error ("got %d template parameters for `%#D'",
2573 TREE_VEC_LENGTH (a
), decl
);
2575 cp_error ("got %d template parameters for `%#T'",
2576 TREE_VEC_LENGTH (a
), current
);
2577 cp_error (" but %d required", TREE_VEC_LENGTH (t
));
2580 /* Perhaps we should also check that the parms are used in the
2581 appropriate qualifying scopes in the declarator? */
2583 if (current
== decl
)
2586 current
= TYPE_CONTEXT (current
);
2590 DECL_TEMPLATE_RESULT (tmpl
) = decl
;
2591 TREE_TYPE (tmpl
) = TREE_TYPE (decl
);
2593 /* Push template declarations for global functions and types. Note
2594 that we do not try to push a global template friend declared in a
2595 template class; such a thing may well depend on the template
2596 parameters of the class. */
2597 if (new_template_p
&& !ctx
2598 && !(is_friend
&& template_class_depth (current_class_type
) > 0))
2599 tmpl
= pushdecl_namespace_level (tmpl
);
2602 DECL_PRIMARY_TEMPLATE (tmpl
) = tmpl
;
2604 info
= tree_cons (tmpl
, args
, NULL_TREE
);
2606 if (DECL_IMPLICIT_TYPEDEF_P (decl
))
2608 SET_TYPE_TEMPLATE_INFO (TREE_TYPE (tmpl
), info
);
2609 if ((!ctx
|| TREE_CODE (ctx
) != FUNCTION_DECL
)
2610 && TREE_CODE (TREE_TYPE (decl
)) != ENUMERAL_TYPE
)
2611 DECL_NAME (decl
) = classtype_mangled_name (TREE_TYPE (decl
));
2613 else if (DECL_LANG_SPECIFIC (decl
))
2614 DECL_TEMPLATE_INFO (decl
) = info
;
2616 return DECL_TEMPLATE_RESULT (tmpl
);
2620 push_template_decl (decl
)
2623 return push_template_decl_real (decl
, 0);
2626 /* Called when a class template TYPE is redeclared with the indicated
2627 template PARMS, e.g.:
2629 template <class T> struct S;
2630 template <class T> struct S {}; */
2633 redeclare_class_template (type
, parms
)
2641 if (!TYPE_TEMPLATE_INFO (type
))
2643 cp_error ("`%T' is not a template type", type
);
2647 tmpl
= TYPE_TI_TEMPLATE (type
);
2648 if (!PRIMARY_TEMPLATE_P (tmpl
))
2649 /* The type is nested in some template class. Nothing to worry
2650 about here; there are no new template parameters for the nested
2654 parms
= INNERMOST_TEMPLATE_PARMS (parms
);
2655 tmpl_parms
= DECL_INNERMOST_TEMPLATE_PARMS (tmpl
);
2657 if (TREE_VEC_LENGTH (parms
) != TREE_VEC_LENGTH (tmpl_parms
))
2659 cp_error_at ("previous declaration `%D'", tmpl
);
2660 cp_error ("used %d template parameter%s instead of %d",
2661 TREE_VEC_LENGTH (tmpl_parms
),
2662 TREE_VEC_LENGTH (tmpl_parms
) == 1 ? "" : "s",
2663 TREE_VEC_LENGTH (parms
));
2667 for (i
= 0; i
< TREE_VEC_LENGTH (tmpl_parms
); ++i
)
2669 tree tmpl_parm
= TREE_VALUE (TREE_VEC_ELT (tmpl_parms
, i
));
2670 tree parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
2671 tree tmpl_default
= TREE_PURPOSE (TREE_VEC_ELT (tmpl_parms
, i
));
2672 tree parm_default
= TREE_PURPOSE (TREE_VEC_ELT (parms
, i
));
2674 if (TREE_CODE (tmpl_parm
) != TREE_CODE (parm
))
2676 cp_error_at ("template parameter `%#D'", tmpl_parm
);
2677 cp_error ("redeclared here as `%#D'", parm
);
2681 if (tmpl_default
!= NULL_TREE
&& parm_default
!= NULL_TREE
)
2683 /* We have in [temp.param]:
2685 A template-parameter may not be given default arguments
2686 by two different declarations in the same scope. */
2687 cp_error ("redefinition of default argument for `%#D'", parm
);
2688 cp_error_at (" original definition appeared here", tmpl_parm
);
2692 if (parm_default
!= NULL_TREE
)
2693 /* Update the previous template parameters (which are the ones
2694 that will really count) with the new default value. */
2695 TREE_PURPOSE (TREE_VEC_ELT (tmpl_parms
, i
)) = parm_default
;
2696 else if (tmpl_default
!= NULL_TREE
)
2697 /* Update the new parameters, too; they'll be used as the
2698 parameters for any members. */
2699 TREE_PURPOSE (TREE_VEC_ELT (parms
, i
)) = tmpl_default
;
2703 /* Attempt to convert the non-type template parameter EXPR to the
2704 indicated TYPE. If the conversion is successful, return the
2705 converted value. If the conversion is unsuccessful, return
2706 NULL_TREE if we issued an error message, or error_mark_node if we
2707 did not. We issue error messages for out-and-out bad template
2708 parameters, but not simply because the conversion failed, since we
2709 might be just trying to do argument deduction. By the time this
2710 function is called, neither TYPE nor EXPR may make use of template
2714 convert_nontype_argument (type
, expr
)
2718 tree expr_type
= TREE_TYPE (expr
);
2720 /* A template-argument for a non-type, non-template
2721 template-parameter shall be one of:
2723 --an integral constant-expression of integral or enumeration
2726 --the name of a non-type template-parameter; or
2728 --the name of an object or function with external linkage,
2729 including function templates and function template-ids but
2730 excluding non-static class members, expressed as id-expression;
2733 --the address of an object or function with external linkage,
2734 including function templates and function template-ids but
2735 excluding non-static class members, expressed as & id-expression
2736 where the & is optional if the name refers to a function or
2739 --a pointer to member expressed as described in _expr.unary.op_. */
2741 /* An integral constant-expression can include const variables or
2742 enumerators. Simplify things by folding them to their values,
2743 unless we're about to bind the declaration to a reference
2745 if (INTEGRAL_TYPE_P (expr_type
)
2746 && TREE_CODE (type
) != REFERENCE_TYPE
)
2747 expr
= decl_constant_value (expr
);
2749 if (is_overloaded_fn (expr
))
2750 /* OK for now. We'll check that it has external linkage later.
2751 Check this first since if expr_type is the unknown_type_node
2752 we would otherwise complain below. */
2754 else if (TYPE_PTRMEM_P (expr_type
)
2755 || TYPE_PTRMEMFUNC_P (expr_type
))
2757 if (TREE_CODE (expr
) != PTRMEM_CST
)
2760 else if (TYPE_PTR_P (expr_type
)
2761 || TYPE_PTRMEM_P (expr_type
)
2762 || TREE_CODE (expr_type
) == ARRAY_TYPE
2763 || TREE_CODE (type
) == REFERENCE_TYPE
2764 /* If expr is the address of an overloaded function, we
2765 will get the unknown_type_node at this point. */
2766 || expr_type
== unknown_type_node
)
2772 if (TREE_CODE (expr_type
) == ARRAY_TYPE
2773 || (TREE_CODE (type
) == REFERENCE_TYPE
2774 && TREE_CODE (e
) != ADDR_EXPR
))
2778 if (TREE_CODE (e
) != ADDR_EXPR
)
2781 cp_error ("`%E' is not a valid template argument", expr
);
2782 if (TYPE_PTR_P (expr_type
))
2784 if (TREE_CODE (TREE_TYPE (expr_type
)) == FUNCTION_TYPE
)
2785 cp_error ("it must be the address of a function with external linkage");
2787 cp_error ("it must be the address of an object with external linkage");
2789 else if (TYPE_PTRMEM_P (expr_type
)
2790 || TYPE_PTRMEMFUNC_P (expr_type
))
2791 cp_error ("it must be a pointer-to-member of the form `&X::Y'");
2796 referent
= TREE_OPERAND (e
, 0);
2797 STRIP_NOPS (referent
);
2800 if (TREE_CODE (referent
) == STRING_CST
)
2802 cp_error ("string literal %E is not a valid template argument because it is the address of an object with static linkage",
2807 if (is_overloaded_fn (referent
))
2808 /* We'll check that it has external linkage later. */
2810 else if (TREE_CODE (referent
) != VAR_DECL
)
2812 else if (!DECL_EXTERNAL_LINKAGE_P (referent
))
2814 cp_error ("address of non-extern `%E' cannot be used as template argument", referent
);
2815 return error_mark_node
;
2818 else if (INTEGRAL_TYPE_P (expr_type
)
2819 || TYPE_PTRMEM_P (expr_type
)
2820 || TYPE_PTRMEMFUNC_P (expr_type
)
2821 /* The next two are g++ extensions. */
2822 || TREE_CODE (expr_type
) == REAL_TYPE
2823 || TREE_CODE (expr_type
) == COMPLEX_TYPE
)
2825 if (! TREE_CONSTANT (expr
))
2828 cp_error ("non-constant `%E' cannot be used as template argument",
2835 cp_error ("object `%E' cannot be used as template argument", expr
);
2839 switch (TREE_CODE (type
))
2844 /* For a non-type template-parameter of integral or enumeration
2845 type, integral promotions (_conv.prom_) and integral
2846 conversions (_conv.integral_) are applied. */
2847 if (!INTEGRAL_TYPE_P (expr_type
))
2848 return error_mark_node
;
2850 /* It's safe to call digest_init in this case; we know we're
2851 just converting one integral constant expression to another. */
2852 expr
= digest_init (type
, expr
, (tree
*) 0);
2854 if (TREE_CODE (expr
) != INTEGER_CST
)
2855 /* Curiously, some TREE_CONSTANT integral expressions do not
2856 simplify to integer constants. For example, `3 % 0',
2857 remains a TRUNC_MOD_EXPR. */
2864 /* These are g++ extensions. */
2865 if (TREE_CODE (expr_type
) != TREE_CODE (type
))
2866 return error_mark_node
;
2868 expr
= digest_init (type
, expr
, (tree
*) 0);
2870 if (TREE_CODE (expr
) != REAL_CST
)
2877 tree type_pointed_to
= TREE_TYPE (type
);
2879 if (TYPE_PTRMEM_P (type
))
2883 /* For a non-type template-parameter of type pointer to data
2884 member, qualification conversions (_conv.qual_) are
2886 e
= perform_qualification_conversions (type
, expr
);
2887 if (TREE_CODE (e
) == NOP_EXPR
)
2888 /* The call to perform_qualification_conversions will
2889 insert a NOP_EXPR over EXPR to do express conversion,
2890 if necessary. But, that will confuse us if we use
2891 this (converted) template parameter to instantiate
2892 another template; then the thing will not look like a
2893 valid template argument. So, just make a new
2894 constant, of the appropriate type. */
2895 e
= make_ptrmem_cst (type
, PTRMEM_CST_MEMBER (expr
));
2898 else if (TREE_CODE (type_pointed_to
) == FUNCTION_TYPE
)
2900 /* For a non-type template-parameter of type pointer to
2901 function, only the function-to-pointer conversion
2902 (_conv.func_) is applied. If the template-argument
2903 represents a set of overloaded functions (or a pointer to
2904 such), the matching function is selected from the set
2909 if (TREE_CODE (expr
) == ADDR_EXPR
)
2910 fns
= TREE_OPERAND (expr
, 0);
2914 fn
= instantiate_type (type_pointed_to
, fns
, itf_none
);
2916 if (fn
== error_mark_node
)
2917 return error_mark_node
;
2919 if (!DECL_EXTERNAL_LINKAGE_P (fn
))
2921 if (really_overloaded_fn (fns
))
2922 return error_mark_node
;
2927 expr
= build_unary_op (ADDR_EXPR
, fn
, 0);
2929 my_friendly_assert (same_type_p (type
, TREE_TYPE (expr
)),
2935 /* For a non-type template-parameter of type pointer to
2936 object, qualification conversions (_conv.qual_) and the
2937 array-to-pointer conversion (_conv.array_) are applied.
2938 [Note: In particular, neither the null pointer conversion
2939 (_conv.ptr_) nor the derived-to-base conversion
2940 (_conv.ptr_) are applied. Although 0 is a valid
2941 template-argument for a non-type template-parameter of
2942 integral type, it is not a valid template-argument for a
2943 non-type template-parameter of pointer type.]
2945 The call to decay_conversion performs the
2946 array-to-pointer conversion, if appropriate. */
2947 expr
= decay_conversion (expr
);
2949 if (expr
== error_mark_node
)
2950 return error_mark_node
;
2952 return perform_qualification_conversions (type
, expr
);
2957 case REFERENCE_TYPE
:
2959 tree type_referred_to
= TREE_TYPE (type
);
2961 /* If this expression already has reference type, get the
2962 underling object. */
2963 if (TREE_CODE (expr_type
) == REFERENCE_TYPE
)
2965 my_friendly_assert (TREE_CODE (expr
) == ADDR_EXPR
, 20000604);
2966 expr
= TREE_OPERAND (expr
, 0);
2967 expr_type
= TREE_TYPE (expr
);
2970 if (TREE_CODE (type_referred_to
) == FUNCTION_TYPE
)
2972 /* For a non-type template-parameter of type reference to
2973 function, no conversions apply. If the
2974 template-argument represents a set of overloaded
2975 functions, the matching function is selected from the
2976 set (_over.over_). */
2979 fn
= instantiate_type (type_referred_to
, expr
, itf_none
);
2981 if (fn
== error_mark_node
)
2982 return error_mark_node
;
2984 if (!DECL_EXTERNAL_LINKAGE_P (fn
))
2986 if (really_overloaded_fn (expr
))
2987 /* Don't issue an error here; we might get a different
2988 function if the overloading had worked out
2990 return error_mark_node
;
2995 my_friendly_assert (same_type_p (type_referred_to
,
3003 /* For a non-type template-parameter of type reference to
3004 object, no conversions apply. The type referred to by the
3005 reference may be more cv-qualified than the (otherwise
3006 identical) type of the template-argument. The
3007 template-parameter is bound directly to the
3008 template-argument, which must be an lvalue. */
3009 if (!same_type_p (TYPE_MAIN_VARIANT (expr_type
),
3010 TYPE_MAIN_VARIANT (type_referred_to
))
3011 || !at_least_as_qualified_p (type_referred_to
,
3013 || !real_lvalue_p (expr
))
3014 return error_mark_node
;
3017 mark_addressable (expr
);
3018 return build1 (ADDR_EXPR
, type
, expr
);
3024 if (!TYPE_PTRMEMFUNC_P (type
))
3025 /* This handles templates like
3026 template<class T, T t> void f();
3027 when T is substituted with any class. The second template
3028 parameter becomes invalid and the template candidate is
3030 return error_mark_node
;
3032 /* For a non-type template-parameter of type pointer to member
3033 function, no conversions apply. If the template-argument
3034 represents a set of overloaded member functions, the
3035 matching member function is selected from the set
3038 if (!TYPE_PTRMEMFUNC_P (expr_type
) &&
3039 expr_type
!= unknown_type_node
)
3040 return error_mark_node
;
3042 if (TREE_CODE (expr
) == PTRMEM_CST
)
3044 /* A ptr-to-member constant. */
3045 if (!same_type_p (type
, expr_type
))
3046 return error_mark_node
;
3051 if (TREE_CODE (expr
) != ADDR_EXPR
)
3052 return error_mark_node
;
3054 expr
= instantiate_type (type
, expr
, itf_none
);
3056 if (expr
== error_mark_node
)
3057 return error_mark_node
;
3059 my_friendly_assert (same_type_p (type
, TREE_TYPE (expr
)),
3066 /* All non-type parameters must have one of these types. */
3067 my_friendly_abort (0);
3071 return error_mark_node
;
3074 /* Return 1 if PARM_PARMS and ARG_PARMS matches using rule for
3075 template template parameters. Both PARM_PARMS and ARG_PARMS are
3076 vectors of TREE_LIST nodes containing TYPE_DECL, TEMPLATE_DECL
3079 ARG_PARMS may contain more parameters than PARM_PARMS. If this is
3080 the case, then extra parameters must have default arguments.
3082 Consider the example:
3083 template <class T, class Allocator = allocator> class vector;
3084 template<template <class U> class TT> class C;
3086 C<vector> is a valid instantiation. PARM_PARMS for the above code
3087 contains a TYPE_DECL (for U), ARG_PARMS contains two TYPE_DECLs (for
3088 T and Allocator) and OUTER_ARGS contains the argument that is used to
3089 substitute the TT parameter. */
3092 coerce_template_template_parms (parm_parms
, arg_parms
, complain
,
3093 in_decl
, outer_args
)
3094 tree parm_parms
, arg_parms
;
3096 tree in_decl
, outer_args
;
3098 int nparms
, nargs
, i
;
3101 my_friendly_assert (TREE_CODE (parm_parms
) == TREE_VEC
, 0);
3102 my_friendly_assert (TREE_CODE (arg_parms
) == TREE_VEC
, 0);
3104 nparms
= TREE_VEC_LENGTH (parm_parms
);
3105 nargs
= TREE_VEC_LENGTH (arg_parms
);
3107 /* The rule here is opposite of coerce_template_parms. */
3110 && TREE_PURPOSE (TREE_VEC_ELT (arg_parms
, nparms
)) == NULL_TREE
))
3113 for (i
= 0; i
< nparms
; ++i
)
3115 parm
= TREE_VALUE (TREE_VEC_ELT (parm_parms
, i
));
3116 arg
= TREE_VALUE (TREE_VEC_ELT (arg_parms
, i
));
3118 if (arg
== NULL_TREE
|| arg
== error_mark_node
3119 || parm
== NULL_TREE
|| parm
== error_mark_node
)
3122 if (TREE_CODE (arg
) != TREE_CODE (parm
))
3125 switch (TREE_CODE (parm
))
3131 /* We encounter instantiations of templates like
3132 template <template <template <class> class> class TT>
3135 tree parmparm
= DECL_INNERMOST_TEMPLATE_PARMS (parm
);
3136 tree argparm
= DECL_INNERMOST_TEMPLATE_PARMS (arg
);
3138 if (!coerce_template_template_parms (parmparm
, argparm
,
3146 /* The tsubst call is used to handle cases such as
3147 template <class T, template <T> class TT> class D;
3148 i.e. the parameter list of TT depends on earlier parameters. */
3149 if (!same_type_p (tsubst (TREE_TYPE (parm
), outer_args
,
3156 my_friendly_abort (0);
3162 /* Convert the indicated template ARG as necessary to match the
3163 indicated template PARM. Returns the converted ARG, or
3164 error_mark_node if the conversion was unsuccessful. Error messages
3165 are issued if COMPLAIN is non-zero. This conversion is for the Ith
3166 parameter in the parameter list. ARGS is the full set of template
3167 arguments deduced so far. */
3170 convert_template_argument (parm
, arg
, args
, complain
, i
, in_decl
)
3180 int is_type
, requires_type
, is_tmpl_type
, requires_tmpl_type
;
3182 inner_args
= INNERMOST_TEMPLATE_ARGS (args
);
3184 if (TREE_CODE (arg
) == TREE_LIST
3185 && TREE_TYPE (arg
) != NULL_TREE
3186 && TREE_CODE (TREE_TYPE (arg
)) == OFFSET_TYPE
)
3188 /* The template argument was the name of some
3189 member function. That's usually
3190 illegal, but static members are OK. In any
3191 case, grab the underlying fields/functions
3192 and issue an error later if required. */
3193 arg
= TREE_VALUE (arg
);
3194 TREE_TYPE (arg
) = unknown_type_node
;
3197 requires_tmpl_type
= TREE_CODE (parm
) == TEMPLATE_DECL
;
3198 requires_type
= (TREE_CODE (parm
) == TYPE_DECL
3199 || requires_tmpl_type
);
3201 /* Check if it is a class template. If REQUIRES_TMPL_TYPE is true,
3202 we also accept implicitly created TYPE_DECL as a valid argument.
3203 This is necessary to handle the case where we pass a template name
3204 to a template template parameter in a scope where we've derived from
3205 in instantiation of that template, so the template name refers to that
3206 instantiation. We really ought to handle this better. */
3208 = ((TREE_CODE (arg
) == TEMPLATE_DECL
3209 && TREE_CODE (DECL_TEMPLATE_RESULT (arg
)) == TYPE_DECL
)
3210 || TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
3211 || (TREE_CODE (arg
) == RECORD_TYPE
3212 && CLASSTYPE_TEMPLATE_INFO (arg
)
3213 && TREE_CODE (TYPE_NAME (arg
)) == TYPE_DECL
3214 && DECL_ARTIFICIAL (TYPE_NAME (arg
))
3215 && requires_tmpl_type
3216 && is_base_of_enclosing_class (arg
, current_class_type
)));
3217 if (is_tmpl_type
&& TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
)
3218 arg
= TYPE_STUB_DECL (arg
);
3219 else if (is_tmpl_type
&& TREE_CODE (arg
) == RECORD_TYPE
)
3220 arg
= CLASSTYPE_TI_TEMPLATE (arg
);
3222 is_type
= TYPE_P (arg
) || is_tmpl_type
;
3224 if (requires_type
&& ! is_type
&& TREE_CODE (arg
) == SCOPE_REF
3225 && TREE_CODE (TREE_OPERAND (arg
, 0)) == TEMPLATE_TYPE_PARM
)
3227 cp_pedwarn ("to refer to a type member of a template parameter, use `typename %E'", arg
);
3229 arg
= make_typename_type (TREE_OPERAND (arg
, 0),
3230 TREE_OPERAND (arg
, 1),
3234 if (is_type
!= requires_type
)
3240 cp_error ("type/value mismatch at argument %d in template parameter list for `%D'",
3243 cp_error (" expected a constant of type `%T', got `%T'",
3245 (is_tmpl_type
? DECL_NAME (arg
) : arg
));
3247 cp_error (" expected a type, got `%E'", arg
);
3250 return error_mark_node
;
3252 if (is_tmpl_type
^ requires_tmpl_type
)
3254 if (in_decl
&& complain
)
3256 cp_error ("type/value mismatch at argument %d in template parameter list for `%D'",
3259 cp_error (" expected a type, got `%T'", DECL_NAME (arg
));
3261 cp_error (" expected a class template, got `%T'", arg
);
3263 return error_mark_node
;
3268 if (requires_tmpl_type
)
3270 tree parmparm
= DECL_INNERMOST_TEMPLATE_PARMS (parm
);
3271 tree argparm
= DECL_INNERMOST_TEMPLATE_PARMS (arg
);
3273 if (coerce_template_template_parms (parmparm
, argparm
, complain
,
3274 in_decl
, inner_args
))
3278 /* TEMPLATE_TEMPLATE_PARM node is preferred over
3280 if (val
!= error_mark_node
3281 && DECL_TEMPLATE_TEMPLATE_PARM_P (val
))
3282 val
= TREE_TYPE (val
);
3286 if (in_decl
&& complain
)
3288 cp_error ("type/value mismatch at argument %d in template parameter list for `%D'",
3290 cp_error (" expected a template of type `%D', got `%D'", parm
, arg
);
3293 val
= error_mark_node
;
3298 val
= groktypename (arg
);
3299 if (! processing_template_decl
)
3301 /* [basic.link]: A name with no linkage (notably, the
3302 name of a class or enumeration declared in a local
3303 scope) shall not be used to declare an entity with
3304 linkage. This implies that names with no linkage
3305 cannot be used as template arguments. */
3306 tree t
= no_linkage_check (val
);
3309 if (ANON_AGGRNAME_P (TYPE_IDENTIFIER (t
)))
3311 ("template-argument `%T' uses anonymous type", val
);
3314 ("template-argument `%T' uses local type `%T'",
3316 return error_mark_node
;
3323 tree t
= tsubst (TREE_TYPE (parm
), args
, complain
, in_decl
);
3325 if (processing_template_decl
)
3326 arg
= maybe_fold_nontype_arg (arg
);
3328 if (!uses_template_parms (arg
) && !uses_template_parms (t
))
3329 /* We used to call digest_init here. However, digest_init
3330 will report errors, which we don't want when complain
3331 is zero. More importantly, digest_init will try too
3332 hard to convert things: for example, `0' should not be
3333 converted to pointer type at this point according to
3334 the standard. Accepting this is not merely an
3335 extension, since deciding whether or not these
3336 conversions can occur is part of determining which
3337 function template to call, or whether a given explicit
3338 argument specification is legal. */
3339 val
= convert_nontype_argument (t
, arg
);
3343 if (val
== NULL_TREE
)
3344 val
= error_mark_node
;
3345 else if (val
== error_mark_node
&& complain
)
3346 cp_error ("could not convert template argument `%E' to `%T'",
3353 /* Convert all template arguments to their appropriate types, and
3354 return a vector containing the innermost resulting template
3355 arguments. If any error occurs, return error_mark_node, and, if
3356 COMPLAIN is non-zero, issue an error message. Some error messages
3357 are issued even if COMPLAIN is zero; for instance, if a template
3358 argument is composed from a local class.
3360 If REQUIRE_ALL_ARGUMENTS is non-zero, all arguments must be
3361 provided in ARGLIST, or else trailing parameters must have default
3362 values. If REQUIRE_ALL_ARGUMENTS is zero, we will attempt argument
3363 deduction for any unspecified trailing arguments. */
3366 coerce_template_parms (parms
, args
, in_decl
,
3368 require_all_arguments
)
3372 int require_all_arguments
;
3374 int nparms
, nargs
, i
, lost
= 0;
3377 tree new_inner_args
;
3379 inner_args
= INNERMOST_TEMPLATE_ARGS (args
);
3380 nargs
= NUM_TMPL_ARGS (inner_args
);
3381 nparms
= TREE_VEC_LENGTH (parms
);
3385 && require_all_arguments
3386 && TREE_PURPOSE (TREE_VEC_ELT (parms
, nargs
)) == NULL_TREE
))
3390 cp_error ("wrong number of template arguments (%d, should be %d)",
3394 cp_error_at ("provided for `%D'", in_decl
);
3397 return error_mark_node
;
3400 new_inner_args
= make_tree_vec (nparms
);
3401 new_args
= add_outermost_template_args (args
, new_inner_args
);
3402 for (i
= 0; i
< nparms
; i
++)
3407 /* Get the Ith template parameter. */
3408 parm
= TREE_VEC_ELT (parms
, i
);
3410 /* Calculate the Ith argument. */
3411 if (inner_args
&& TREE_CODE (inner_args
) == TREE_LIST
)
3413 arg
= TREE_VALUE (inner_args
);
3414 inner_args
= TREE_CHAIN (inner_args
);
3417 arg
= TREE_VEC_ELT (inner_args
, i
);
3418 /* If no template argument was supplied, look for a default
3420 else if (TREE_PURPOSE (parm
) == NULL_TREE
)
3422 /* There was no default value. */
3423 my_friendly_assert (!require_all_arguments
, 0);
3426 else if (TREE_CODE (TREE_VALUE (parm
)) == TYPE_DECL
)
3427 arg
= tsubst (TREE_PURPOSE (parm
), new_args
, complain
, in_decl
);
3429 arg
= tsubst_expr (TREE_PURPOSE (parm
), new_args
, complain
,
3432 /* Now, convert the Ith argument, as necessary. */
3433 if (arg
== NULL_TREE
)
3434 /* We're out of arguments. */
3436 my_friendly_assert (!require_all_arguments
, 0);
3439 else if (arg
== error_mark_node
)
3441 cp_error ("template argument %d is invalid", i
+ 1);
3442 arg
= error_mark_node
;
3445 arg
= convert_template_argument (TREE_VALUE (parm
),
3446 arg
, new_args
, complain
, i
,
3449 if (arg
== error_mark_node
)
3451 TREE_VEC_ELT (new_inner_args
, i
) = arg
;
3455 return error_mark_node
;
3457 return new_inner_args
;
3460 /* Returns 1 if template args OT and NT are equivalent. */
3463 template_args_equal (ot
, nt
)
3469 if (TREE_CODE (nt
) == TREE_VEC
)
3470 /* For member templates */
3471 return TREE_CODE (ot
) == TREE_VEC
&& comp_template_args (ot
, nt
);
3472 else if (TYPE_P (nt
))
3473 return TYPE_P (ot
) && same_type_p (ot
, nt
);
3474 else if (TREE_CODE (ot
) == TREE_VEC
|| TYPE_P (ot
))
3477 return (cp_tree_equal (ot
, nt
) > 0);
3480 /* Returns 1 iff the OLDARGS and NEWARGS are in fact identical sets
3481 of template arguments. Returns 0 otherwise. */
3484 comp_template_args (oldargs
, newargs
)
3485 tree oldargs
, newargs
;
3489 if (TREE_VEC_LENGTH (oldargs
) != TREE_VEC_LENGTH (newargs
))
3492 for (i
= 0; i
< TREE_VEC_LENGTH (oldargs
); ++i
)
3494 tree nt
= TREE_VEC_ELT (newargs
, i
);
3495 tree ot
= TREE_VEC_ELT (oldargs
, i
);
3497 if (! template_args_equal (ot
, nt
))
3503 /* Given class template name and parameter list, produce a user-friendly name
3504 for the instantiation. */
3507 mangle_class_name_for_template (name
, parms
, arglist
)
3509 tree parms
, arglist
;
3511 static struct obstack scratch_obstack
;
3512 static char *scratch_firstobj
;
3515 if (!scratch_firstobj
)
3516 gcc_obstack_init (&scratch_obstack
);
3518 obstack_free (&scratch_obstack
, scratch_firstobj
);
3519 scratch_firstobj
= obstack_alloc (&scratch_obstack
, 1);
3521 #define ccat(c) obstack_1grow (&scratch_obstack, (c));
3522 #define cat(s) obstack_grow (&scratch_obstack, (s), strlen (s))
3526 nparms
= TREE_VEC_LENGTH (parms
);
3527 arglist
= INNERMOST_TEMPLATE_ARGS (arglist
);
3528 my_friendly_assert (nparms
== TREE_VEC_LENGTH (arglist
), 268);
3529 for (i
= 0; i
< nparms
; i
++)
3531 tree parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
3532 tree arg
= TREE_VEC_ELT (arglist
, i
);
3537 if (TREE_CODE (parm
) == TYPE_DECL
)
3539 cat (type_as_string (arg
, TFF_CHASE_TYPEDEF
));
3542 else if (TREE_CODE (parm
) == TEMPLATE_DECL
)
3544 if (TREE_CODE (arg
) == TEMPLATE_DECL
)
3546 /* Already substituted with real template. Just output
3547 the template name here */
3548 tree context
= DECL_CONTEXT (arg
);
3551 /* The template may be defined in a namespace, or
3552 may be a member template. */
3553 my_friendly_assert (TREE_CODE (context
) == NAMESPACE_DECL
3554 || CLASS_TYPE_P (context
),
3556 cat(decl_as_string (DECL_CONTEXT (arg
), TFF_PLAIN_IDENTIFIER
));
3559 cat (IDENTIFIER_POINTER (DECL_NAME (arg
)));
3562 /* Output the parameter declaration */
3563 cat (type_as_string (arg
, TFF_CHASE_TYPEDEF
));
3567 my_friendly_assert (TREE_CODE (parm
) == PARM_DECL
, 269);
3569 if (TREE_CODE (arg
) == TREE_LIST
)
3571 /* New list cell was built because old chain link was in
3573 my_friendly_assert (TREE_PURPOSE (arg
) == NULL_TREE
, 270);
3574 arg
= TREE_VALUE (arg
);
3576 /* No need to check arglist against parmlist here; we did that
3577 in coerce_template_parms, called from lookup_template_class. */
3578 cat (expr_as_string (arg
, TFF_PLAIN_IDENTIFIER
));
3581 char *bufp
= obstack_next_free (&scratch_obstack
);
3583 while (bufp
[offset
- 1] == ' ')
3585 obstack_blank_fast (&scratch_obstack
, offset
);
3587 /* B<C<char> >, not B<C<char>> */
3588 if (bufp
[offset
- 1] == '>')
3593 return (char *) obstack_base (&scratch_obstack
);
3597 classtype_mangled_name (t
)
3600 if (CLASSTYPE_TEMPLATE_INFO (t
)
3601 /* Specializations have already had their names set up in
3602 lookup_template_class. */
3603 && !CLASSTYPE_TEMPLATE_SPECIALIZATION (t
))
3605 tree tmpl
= most_general_template (CLASSTYPE_TI_TEMPLATE (t
));
3607 /* For non-primary templates, the template parameters are
3608 implicit from their surrounding context. */
3609 if (PRIMARY_TEMPLATE_P (tmpl
))
3611 tree name
= DECL_NAME (tmpl
);
3612 char *mangled_name
= mangle_class_name_for_template
3613 (IDENTIFIER_POINTER (name
),
3614 DECL_INNERMOST_TEMPLATE_PARMS (tmpl
),
3615 CLASSTYPE_TI_ARGS (t
));
3616 tree id
= get_identifier (mangled_name
);
3617 IDENTIFIER_TEMPLATE (id
) = name
;
3622 return TYPE_IDENTIFIER (t
);
3626 add_pending_template (d
)
3629 tree ti
= (TYPE_P (d
)
3630 ? CLASSTYPE_TEMPLATE_INFO (d
)
3631 : DECL_TEMPLATE_INFO (d
));
3634 if (TI_PENDING_TEMPLATE_FLAG (ti
))
3637 /* We are called both from instantiate_decl, where we've already had a
3638 tinst_level pushed, and instantiate_template, where we haven't.
3640 level
= !(current_tinst_level
&& TINST_DECL (current_tinst_level
) == d
);
3643 push_tinst_level (d
);
3645 *template_tail
= tree_cons (current_tinst_level
, d
, NULL_TREE
);
3646 template_tail
= &TREE_CHAIN (*template_tail
);
3647 TI_PENDING_TEMPLATE_FLAG (ti
) = 1;
3654 /* Return a TEMPLATE_ID_EXPR corresponding to the indicated FNS (which
3655 may be either a _DECL or an overloaded function or an
3656 IDENTIFIER_NODE), and ARGLIST. */
3659 lookup_template_function (fns
, arglist
)
3664 if (fns
== NULL_TREE
)
3666 cp_error ("non-template used as template");
3667 return error_mark_node
;
3670 type
= TREE_TYPE (fns
);
3671 if (TREE_CODE (fns
) == OVERLOAD
|| !type
)
3672 type
= unknown_type_node
;
3674 if (processing_template_decl
)
3675 return build_min (TEMPLATE_ID_EXPR
, type
, fns
, arglist
);
3677 return build (TEMPLATE_ID_EXPR
, type
, fns
, arglist
);
3680 /* Within the scope of a template class S<T>, the name S gets bound
3681 (in build_self_reference) to a TYPE_DECL for the class, not a
3682 TEMPLATE_DECL. If DECL is a TYPE_DECL for current_class_type,
3683 or one of its enclosing classes, and that type is a template,
3684 return the associated TEMPLATE_DECL. Otherwise, the original
3685 DECL is returned. */
3688 maybe_get_template_decl_from_type_decl (decl
)
3691 return (decl
!= NULL_TREE
3692 && TREE_CODE (decl
) == TYPE_DECL
3693 && DECL_ARTIFICIAL (decl
)
3694 && CLASS_TYPE_P (TREE_TYPE (decl
))
3695 && CLASSTYPE_TEMPLATE_INFO (TREE_TYPE (decl
)))
3696 ? CLASSTYPE_TI_TEMPLATE (TREE_TYPE (decl
)) : decl
;
3699 /* Given an IDENTIFIER_NODE (type TEMPLATE_DECL) and a chain of
3700 parameters, find the desired type.
3702 D1 is the PTYPENAME terminal, and ARGLIST is the list of arguments.
3703 (Actually ARGLIST may be either a TREE_LIST or a TREE_VEC. It will
3704 be a TREE_LIST if called directly from the parser, and a TREE_VEC
3707 IN_DECL, if non-NULL, is the template declaration we are trying to
3710 If ENTERING_SCOPE is non-zero, we are about to enter the scope of
3711 the class we are looking up.
3713 If the template class is really a local class in a template
3714 function, then the FUNCTION_CONTEXT is the function in which it is
3715 being instantiated. */
3718 lookup_template_class (d1
, arglist
, in_decl
, context
, entering_scope
)
3724 tree
template = NULL_TREE
, parmlist
;
3727 if (TREE_CODE (d1
) == IDENTIFIER_NODE
)
3729 if (IDENTIFIER_VALUE (d1
)
3730 && DECL_TEMPLATE_TEMPLATE_PARM_P (IDENTIFIER_VALUE (d1
)))
3731 template = IDENTIFIER_VALUE (d1
);
3735 push_decl_namespace (context
);
3736 template = lookup_name (d1
, /*prefer_type=*/0);
3737 template = maybe_get_template_decl_from_type_decl (template);
3739 pop_decl_namespace ();
3742 context
= DECL_CONTEXT (template);
3744 else if (TREE_CODE (d1
) == TYPE_DECL
&& IS_AGGR_TYPE (TREE_TYPE (d1
)))
3746 tree type
= TREE_TYPE (d1
);
3748 /* If we are declaring a constructor, say A<T>::A<T>, we will get
3749 an implicit typename for the second A. Deal with it. */
3750 if (TREE_CODE (type
) == TYPENAME_TYPE
&& TREE_TYPE (type
))
3751 type
= TREE_TYPE (type
);
3753 if (CLASSTYPE_TEMPLATE_INFO (type
))
3755 template = CLASSTYPE_TI_TEMPLATE (type
);
3756 d1
= DECL_NAME (template);
3759 else if (TREE_CODE (d1
) == ENUMERAL_TYPE
3760 || (TYPE_P (d1
) && IS_AGGR_TYPE (d1
)))
3762 template = TYPE_TI_TEMPLATE (d1
);
3763 d1
= DECL_NAME (template);
3765 else if (TREE_CODE (d1
) == TEMPLATE_DECL
3766 && TREE_CODE (DECL_TEMPLATE_RESULT (d1
)) == TYPE_DECL
)
3769 d1
= DECL_NAME (template);
3770 context
= DECL_CONTEXT (template);
3773 /* With something like `template <class T> class X class X { ... };'
3774 we could end up with D1 having nothing but an IDENTIFIER_VALUE.
3775 We don't want to do that, but we have to deal with the situation,
3776 so let's give them some syntax errors to chew on instead of a
3777 crash. Alternatively D1 might not be a template type at all. */
3780 cp_error ("`%T' is not a template", d1
);
3781 return error_mark_node
;
3784 if (TREE_CODE (template) != TEMPLATE_DECL
)
3786 cp_error ("non-template type `%T' used as a template", d1
);
3788 cp_error_at ("for template declaration `%D'", in_decl
);
3789 return error_mark_node
;
3792 if (DECL_TEMPLATE_TEMPLATE_PARM_P (template))
3794 /* Create a new TEMPLATE_DECL and TEMPLATE_TEMPLATE_PARM node to store
3795 template arguments */
3800 parmlist
= DECL_INNERMOST_TEMPLATE_PARMS (template);
3802 arglist2
= coerce_template_parms (parmlist
, arglist
, template, 1, 1);
3803 if (arglist2
== error_mark_node
)
3804 return error_mark_node
;
3806 parm
= copy_template_template_parm (TREE_TYPE (template), arglist2
);
3807 TYPE_SIZE (parm
) = 0;
3812 tree template_type
= TREE_TYPE (template);
3815 tree found
= NULL_TREE
;
3818 int is_partial_instantiation
;
3820 gen_tmpl
= most_general_template (template);
3821 parmlist
= DECL_TEMPLATE_PARMS (gen_tmpl
);
3822 parm_depth
= TMPL_PARMS_DEPTH (parmlist
);
3823 arg_depth
= TMPL_ARGS_DEPTH (arglist
);
3825 if (arg_depth
== 1 && parm_depth
> 1)
3827 /* We've been given an incomplete set of template arguments.
3830 template <class T> struct S1 {
3831 template <class U> struct S2 {};
3832 template <class U> struct S2<U*> {};
3835 we will be called with an ARGLIST of `U*', but the
3836 TEMPLATE will be `template <class T> template
3837 <class U> struct S1<T>::S2'. We must fill in the missing
3840 = add_outermost_template_args (TYPE_TI_ARGS (TREE_TYPE (template)),
3842 arg_depth
= TMPL_ARGS_DEPTH (arglist
);
3845 /* Now we should enough arguments. */
3846 my_friendly_assert (parm_depth
== arg_depth
, 0);
3848 /* From here on, we're only interested in the most general
3850 template = gen_tmpl
;
3852 /* Calculate the BOUND_ARGS. These will be the args that are
3853 actually tsubst'd into the definition to create the
3857 /* We have multiple levels of arguments to coerce, at once. */
3859 int saved_depth
= TMPL_ARGS_DEPTH (arglist
);
3861 tree bound_args
= make_tree_vec (parm_depth
);
3863 for (i
= saved_depth
,
3864 t
= DECL_TEMPLATE_PARMS (template);
3865 i
> 0 && t
!= NULL_TREE
;
3866 --i
, t
= TREE_CHAIN (t
))
3868 tree a
= coerce_template_parms (TREE_VALUE (t
),
3869 arglist
, template, 1, 1);
3870 SET_TMPL_ARGS_LEVEL (bound_args
, i
, a
);
3872 /* We temporarily reduce the length of the ARGLIST so
3873 that coerce_template_parms will see only the arguments
3874 corresponding to the template parameters it is
3876 TREE_VEC_LENGTH (arglist
)--;
3879 /* Restore the ARGLIST to its full size. */
3880 TREE_VEC_LENGTH (arglist
) = saved_depth
;
3882 arglist
= bound_args
;
3886 = coerce_template_parms (INNERMOST_TEMPLATE_PARMS (parmlist
),
3887 INNERMOST_TEMPLATE_ARGS (arglist
),
3890 if (arglist
== error_mark_node
)
3891 /* We were unable to bind the arguments. */
3892 return error_mark_node
;
3894 /* In the scope of a template class, explicit references to the
3895 template class refer to the type of the template, not any
3896 instantiation of it. For example, in:
3898 template <class T> class C { void f(C<T>); }
3900 the `C<T>' is just the same as `C'. Outside of the
3901 class, however, such a reference is an instantiation. */
3902 if (comp_template_args (TYPE_TI_ARGS (template_type
),
3905 found
= template_type
;
3907 if (!entering_scope
&& PRIMARY_TEMPLATE_P (template))
3911 /* Note that we use DECL_CONTEXT, rather than
3912 CP_DECL_CONTEXT, so that the termination test is
3913 always just `ctx'. We're not interested in namespace
3915 for (ctx
= current_class_type
;
3917 ctx
= (TYPE_P (ctx
)) ? TYPE_CONTEXT (ctx
) : DECL_CONTEXT (ctx
))
3918 if (same_type_p (ctx
, template_type
))
3922 /* We're not in the scope of the class, so the
3923 TEMPLATE_TYPE is not the type we want after
3931 for (found
= DECL_TEMPLATE_INSTANTIATIONS (template);
3932 found
; found
= TREE_CHAIN (found
))
3933 if (comp_template_args (TREE_PURPOSE (found
), arglist
))
3934 return TREE_VALUE (found
);
3936 /* This type is a "partial instantiation" if any of the template
3937 arguments still involve template parameters. Note that we set
3938 IS_PARTIAL_INSTANTIATION for partial specializations as
3940 is_partial_instantiation
= uses_template_parms (arglist
);
3942 if (!is_partial_instantiation
3943 && !PRIMARY_TEMPLATE_P (template)
3944 && TREE_CODE (CP_DECL_CONTEXT (template)) == NAMESPACE_DECL
)
3946 found
= xref_tag_from_type (TREE_TYPE (template),
3947 DECL_NAME (template),
3952 context
= tsubst (DECL_CONTEXT (template), arglist
,
3953 /*complain=*/0, in_decl
);
3955 context
= global_namespace
;
3957 /* Create the type. */
3958 if (TREE_CODE (template_type
) == ENUMERAL_TYPE
)
3960 if (!is_partial_instantiation
)
3962 set_current_access_from_decl (TYPE_NAME (template_type
));
3963 t
= start_enum (TYPE_IDENTIFIER (template_type
));
3966 /* We don't want to call start_enum for this type, since
3967 the values for the enumeration constants may involve
3968 template parameters. And, no one should be interested
3969 in the enumeration constants for such a type. */
3970 t
= make_node (ENUMERAL_TYPE
);
3974 t
= make_aggr_type (TREE_CODE (template_type
));
3975 CLASSTYPE_DECLARED_CLASS (t
)
3976 = CLASSTYPE_DECLARED_CLASS (template_type
);
3977 CLASSTYPE_GOT_SEMICOLON (t
) = 1;
3978 SET_CLASSTYPE_IMPLICIT_INSTANTIATION (t
);
3979 TYPE_FOR_JAVA (t
) = TYPE_FOR_JAVA (template_type
);
3981 /* A local class. Make sure the decl gets registered properly. */
3982 if (context
== current_function_decl
)
3983 pushtag (DECL_NAME (template), t
, 0);
3986 /* If we called start_enum or pushtag above, this information
3987 will already be set up. */
3990 TYPE_CONTEXT (t
) = FROB_CONTEXT (context
);
3992 type_decl
= create_implicit_typedef (DECL_NAME (template), t
);
3993 DECL_CONTEXT (type_decl
) = TYPE_CONTEXT (t
);
3994 TYPE_STUB_DECL (t
) = type_decl
;
3995 DECL_SOURCE_FILE (type_decl
)
3996 = DECL_SOURCE_FILE (TYPE_STUB_DECL (template_type
));
3997 DECL_SOURCE_LINE (type_decl
)
3998 = DECL_SOURCE_LINE (TYPE_STUB_DECL (template_type
));
4001 type_decl
= TYPE_NAME (t
);
4003 /* Set up the template information. We have to figure out which
4004 template is the immediate parent if this is a full
4006 if (parm_depth
== 1 || is_partial_instantiation
4007 || !PRIMARY_TEMPLATE_P (template))
4008 /* This case is easy; there are no member templates involved. */
4012 /* This is a full instantiation of a member template. Look
4013 for a partial instantiation of which this is an instance. */
4015 for (found
= DECL_TEMPLATE_INSTANTIATIONS (template);
4016 found
; found
= TREE_CHAIN (found
))
4019 tree tmpl
= CLASSTYPE_TI_TEMPLATE (TREE_VALUE (found
));
4021 /* We only want partial instantiations, here, not
4022 specializations or full instantiations. */
4023 if (CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_VALUE (found
))
4024 || !uses_template_parms (TREE_VALUE (found
)))
4027 /* Temporarily reduce by one the number of levels in the
4028 ARGLIST and in FOUND so as to avoid comparing the
4029 last set of arguments. */
4030 TREE_VEC_LENGTH (arglist
)--;
4031 TREE_VEC_LENGTH (TREE_PURPOSE (found
)) --;
4033 /* See if the arguments match. If they do, then TMPL is
4034 the partial instantiation we want. */
4035 success
= comp_template_args (TREE_PURPOSE (found
), arglist
);
4037 /* Restore the argument vectors to their full size. */
4038 TREE_VEC_LENGTH (arglist
)++;
4039 TREE_VEC_LENGTH (TREE_PURPOSE (found
))++;
4050 /* There was no partial instantiation. This happens
4051 where C<T> is a member template of A<T> and it's used
4054 template <typename T> struct B { A<T>::C<int> m; };
4057 Create the partial instantiation.
4059 TREE_VEC_LENGTH (arglist
)--;
4060 template = tsubst (template, arglist
, /*complain=*/0, NULL_TREE
);
4061 TREE_VEC_LENGTH (arglist
)++;
4066 SET_TYPE_TEMPLATE_INFO (t
, tree_cons (found
, arglist
, NULL_TREE
));
4067 DECL_TEMPLATE_INSTANTIATIONS (template)
4068 = tree_cons (arglist
, t
,
4069 DECL_TEMPLATE_INSTANTIATIONS (template));
4071 if (TREE_CODE (t
) == ENUMERAL_TYPE
4072 && !is_partial_instantiation
)
4073 /* Now that the type has been registered on the instantiations
4074 list, we set up the enumerators. Because the enumeration
4075 constants may involve the enumeration type itself, we make
4076 sure to register the type first, and then create the
4077 constants. That way, doing tsubst_expr for the enumeration
4078 constants won't result in recursive calls here; we'll find
4079 the instantiation and exit above. */
4080 tsubst_enum (template_type
, t
, arglist
);
4082 /* Reset the name of the type, now that CLASSTYPE_TEMPLATE_INFO
4084 if (TREE_CODE (t
) != ENUMERAL_TYPE
)
4085 DECL_NAME (type_decl
) = classtype_mangled_name (t
);
4086 DECL_ASSEMBLER_NAME (type_decl
) = DECL_NAME (type_decl
);
4087 if (!is_partial_instantiation
)
4090 DECL_ASSEMBLER_NAME (type_decl
) = mangle_decl (type_decl
);
4092 DECL_ASSEMBLER_NAME (type_decl
)
4093 = get_identifier (build_overload_name (t
, 1, 1));
4095 /* For backwards compatibility; code that uses
4096 -fexternal-templates expects looking up a template to
4097 instantiate it. I think DDD still relies on this.
4098 (jason 8/20/1998) */
4099 if (TREE_CODE (t
) != ENUMERAL_TYPE
4100 && flag_external_templates
4101 && CLASSTYPE_INTERFACE_KNOWN (TREE_TYPE (template))
4102 && ! CLASSTYPE_INTERFACE_ONLY (TREE_TYPE (template)))
4103 add_pending_template (t
);
4106 /* If the type makes use of template parameters, the
4107 code that generates debugging information will crash. */
4108 DECL_IGNORED_P (TYPE_STUB_DECL (t
)) = 1;
4120 /* Called from for_each_template_parm via walk_tree. */
4123 for_each_template_parm_r (tp
, walk_subtrees
, d
)
4129 struct pair_fn_data
*pfd
= (struct pair_fn_data
*) d
;
4130 tree_fn_t fn
= pfd
->fn
;
4131 void *data
= pfd
->data
;
4134 && for_each_template_parm (TYPE_CONTEXT (t
), fn
, data
))
4135 return error_mark_node
;
4137 switch (TREE_CODE (t
))
4140 if (TYPE_PTRMEMFUNC_P (t
))
4146 if (!TYPE_TEMPLATE_INFO (t
))
4148 else if (for_each_template_parm (TREE_VALUE (TYPE_TEMPLATE_INFO (t
)),
4150 return error_mark_node
;
4154 /* Since we're not going to walk subtrees, we have to do this
4156 if (for_each_template_parm (TYPE_METHOD_BASETYPE (t
), fn
, data
))
4157 return error_mark_node
;
4160 /* Check the return type. */
4161 if (for_each_template_parm (TREE_TYPE (t
), fn
, data
))
4162 return error_mark_node
;
4164 /* Check the parameter types. Since default arguments are not
4165 instantiated until they are needed, the TYPE_ARG_TYPES may
4166 contain expressions that involve template parameters. But,
4167 no-one should be looking at them yet. And, once they're
4168 instantiated, they don't contain template parameters, so
4169 there's no point in looking at them then, either. */
4173 for (parm
= TYPE_ARG_TYPES (t
); parm
; parm
= TREE_CHAIN (parm
))
4174 if (for_each_template_parm (TREE_VALUE (parm
), fn
, data
))
4175 return error_mark_node
;
4177 /* Since we've already handled the TYPE_ARG_TYPES, we don't
4178 want walk_tree walking into them itself. */
4185 if (DECL_LANG_SPECIFIC (t
) && DECL_TEMPLATE_INFO (t
)
4186 && for_each_template_parm (DECL_TI_ARGS (t
), fn
, data
))
4187 return error_mark_node
;
4192 if (DECL_CONTEXT (t
)
4193 && for_each_template_parm (DECL_CONTEXT (t
), fn
, data
))
4194 return error_mark_node
;
4197 case BOUND_TEMPLATE_TEMPLATE_PARM
:
4198 /* Record template parameters such as `T' inside `TT<T>'. */
4199 if (for_each_template_parm (TYPE_TI_ARGS (t
), fn
, data
))
4200 return error_mark_node
;
4203 case TEMPLATE_TEMPLATE_PARM
:
4204 case TEMPLATE_TYPE_PARM
:
4205 case TEMPLATE_PARM_INDEX
:
4206 if (fn
&& (*fn
)(t
, data
))
4207 return error_mark_node
;
4209 return error_mark_node
;
4213 /* A template template parameter is encountered */
4214 if (DECL_TEMPLATE_TEMPLATE_PARM_P (t
)
4215 && for_each_template_parm (TREE_TYPE (t
), fn
, data
))
4216 return error_mark_node
;
4218 /* Already substituted template template parameter */
4223 if (!fn
|| for_each_template_parm (TYPENAME_TYPE_FULLNAME (t
), fn
, data
))
4224 return error_mark_node
;
4228 if (TREE_TYPE (t
) && TYPE_PTRMEMFUNC_P (TREE_TYPE (t
))
4229 && for_each_template_parm (TYPE_PTRMEMFUNC_FN_TYPE
4230 (TREE_TYPE (t
)), fn
, data
))
4231 return error_mark_node
;
4236 /* If there's no type, then this thing must be some expression
4237 involving template parameters. */
4238 if (!fn
&& !TREE_TYPE (t
))
4239 return error_mark_node
;
4244 case REINTERPRET_CAST_EXPR
:
4245 case CONST_CAST_EXPR
:
4246 case STATIC_CAST_EXPR
:
4247 case DYNAMIC_CAST_EXPR
:
4252 case PSEUDO_DTOR_EXPR
:
4254 return error_mark_node
;
4261 /* We didn't find any template parameters we liked. */
4265 /* For each TEMPLATE_TYPE_PARM, TEMPLATE_TEMPLATE_PARM,
4266 BOUND_TEMPLATE_TEMPLATE_PARM or TEMPLATE_PARM_INDEX in T,
4267 call FN with the parameter and the DATA.
4268 If FN returns non-zero, the iteration is terminated, and
4269 for_each_template_parm returns 1. Otherwise, the iteration
4270 continues. If FN never returns a non-zero value, the value
4271 returned by for_each_template_parm is 0. If FN is NULL, it is
4272 considered to be the function which always returns 1. */
4275 for_each_template_parm (t
, fn
, data
)
4280 struct pair_fn_data pfd
;
4286 /* Walk the tree. */
4287 return walk_tree_without_duplicates (&t
,
4288 for_each_template_parm_r
,
4293 uses_template_parms (t
)
4296 return for_each_template_parm (t
, 0, 0);
4299 static int tinst_depth
;
4300 extern int max_tinst_depth
;
4301 #ifdef GATHER_STATISTICS
4304 static int tinst_level_tick
;
4305 static int last_template_error_tick
;
4307 /* We're starting to instantiate D; record the template instantiation context
4308 for diagnostics and to restore it later. */
4311 push_tinst_level (d
)
4316 if (tinst_depth
>= max_tinst_depth
)
4318 /* If the instantiation in question still has unbound template parms,
4319 we don't really care if we can't instantiate it, so just return.
4320 This happens with base instantiation for implicit `typename'. */
4321 if (uses_template_parms (d
))
4324 last_template_error_tick
= tinst_level_tick
;
4325 cp_error ("template instantiation depth exceeds maximum of %d (use -ftemplate-depth-NN to increase the maximum) instantiating `%D'",
4326 max_tinst_depth
, d
);
4328 print_instantiation_context ();
4333 new = build_expr_wfl (d
, input_filename
, lineno
, 0);
4334 TREE_CHAIN (new) = current_tinst_level
;
4335 current_tinst_level
= new;
4338 #ifdef GATHER_STATISTICS
4339 if (tinst_depth
> depth_reached
)
4340 depth_reached
= tinst_depth
;
4347 /* We're done instantiating this template; return to the instantiation
4353 tree old
= current_tinst_level
;
4355 /* Restore the filename and line number stashed away when we started
4356 this instantiation. */
4357 lineno
= TINST_LINE (old
);
4358 input_filename
= TINST_FILE (old
);
4359 extract_interface_info ();
4361 current_tinst_level
= TREE_CHAIN (old
);
4366 /* We're instantiating a deferred template; restore the template
4367 instantiation context in which the instantiation was requested, which
4368 is one step out from LEVEL. */
4371 reopen_tinst_level (level
)
4377 for (t
= level
; t
; t
= TREE_CHAIN (t
))
4380 current_tinst_level
= level
;
4384 /* Return the outermost template instantiation context, for use with
4385 -falt-external-templates. */
4390 tree p
= current_tinst_level
;
4393 for (; TREE_CHAIN (p
) ; p
= TREE_CHAIN (p
))
4398 /* DECL is a friend FUNCTION_DECL or TEMPLATE_DECL. ARGS is the
4399 vector of template arguments, as for tsubst.
4401 Returns an appropriate tsubst'd friend declaration. */
4404 tsubst_friend_function (decl
, args
)
4410 const char *file
= input_filename
;
4412 lineno
= DECL_SOURCE_LINE (decl
);
4413 input_filename
= DECL_SOURCE_FILE (decl
);
4415 if (TREE_CODE (decl
) == FUNCTION_DECL
4416 && DECL_TEMPLATE_INSTANTIATION (decl
)
4417 && TREE_CODE (DECL_TI_TEMPLATE (decl
)) != TEMPLATE_DECL
)
4418 /* This was a friend declared with an explicit template
4419 argument list, e.g.:
4423 to indicate that f was a template instantiation, not a new
4424 function declaration. Now, we have to figure out what
4425 instantiation of what template. */
4427 tree template_id
, arglist
, fns
;
4430 tree ns
= CP_DECL_CONTEXT (TYPE_MAIN_DECL (current_class_type
));
4432 /* Friend functions are looked up in the containing namespace scope.
4433 We must enter that scope, to avoid finding member functions of the
4434 current cless with same name. */
4435 push_nested_namespace (ns
);
4436 fns
= tsubst_expr (DECL_TI_TEMPLATE (decl
), args
,
4437 /*complain=*/1, NULL_TREE
);
4438 pop_nested_namespace (ns
);
4439 arglist
= tsubst (DECL_TI_ARGS (decl
), args
,
4440 /*complain=*/1, NULL_TREE
);
4441 template_id
= lookup_template_function (fns
, arglist
);
4443 new_friend
= tsubst (decl
, args
, /*complain=*/1, NULL_TREE
);
4444 tmpl
= determine_specialization (template_id
, new_friend
,
4446 /*need_member_template=*/0);
4447 new_friend
= instantiate_template (tmpl
, new_args
);
4451 new_friend
= tsubst (decl
, args
, /*complain=*/1, NULL_TREE
);
4453 /* The NEW_FRIEND will look like an instantiation, to the
4454 compiler, but is not an instantiation from the point of view of
4455 the language. For example, we might have had:
4457 template <class T> struct S {
4458 template <class U> friend void f(T, U);
4461 Then, in S<int>, template <class U> void f(int, U) is not an
4462 instantiation of anything. */
4463 DECL_USE_TEMPLATE (new_friend
) = 0;
4464 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
4466 DECL_USE_TEMPLATE (DECL_TEMPLATE_RESULT (new_friend
)) = 0;
4467 DECL_SAVED_TREE (DECL_TEMPLATE_RESULT (new_friend
))
4468 = DECL_SAVED_TREE (DECL_TEMPLATE_RESULT (decl
));
4471 /* The mangled name for the NEW_FRIEND is incorrect. The call to
4472 tsubst will have resulted in a call to
4473 set_mangled_name_for_template_decl. But, the function is not a
4474 template instantiation and should not be mangled like one.
4475 Therefore, we remangle the function name. We don't have to do
4476 this if the NEW_FRIEND is a template since
4477 set_mangled_name_for_template_decl doesn't do anything if the
4478 function declaration still uses template arguments. */
4479 if (TREE_CODE (new_friend
) != TEMPLATE_DECL
)
4481 set_mangled_name_for_decl (new_friend
);
4482 DECL_RTL (new_friend
) = 0;
4483 make_decl_rtl (new_friend
, NULL_PTR
, 1);
4486 if (DECL_NAMESPACE_SCOPE_P (new_friend
))
4489 tree new_friend_template_info
;
4490 tree new_friend_result_template_info
;
4492 int new_friend_is_defn
;
4494 /* We must save some information from NEW_FRIEND before calling
4495 duplicate decls since that function will free NEW_FRIEND if
4497 new_friend_template_info
= DECL_TEMPLATE_INFO (new_friend
);
4498 if (TREE_CODE (new_friend
) == TEMPLATE_DECL
)
4500 /* This declaration is a `primary' template. */
4501 DECL_PRIMARY_TEMPLATE (new_friend
) = new_friend
;
4504 = DECL_INITIAL (DECL_TEMPLATE_RESULT (new_friend
)) != NULL_TREE
;
4505 new_friend_result_template_info
4506 = DECL_TEMPLATE_INFO (DECL_TEMPLATE_RESULT (new_friend
));
4510 new_friend_is_defn
= DECL_INITIAL (new_friend
) != NULL_TREE
;
4511 new_friend_result_template_info
= NULL_TREE
;
4514 /* Inside pushdecl_namespace_level, we will push into the
4515 current namespace. However, the friend function should go
4516 into the namespace of the template. */
4517 ns
= decl_namespace_context (new_friend
);
4518 push_nested_namespace (ns
);
4519 old_decl
= pushdecl_namespace_level (new_friend
);
4520 pop_nested_namespace (ns
);
4522 if (old_decl
!= new_friend
)
4524 /* This new friend declaration matched an existing
4525 declaration. For example, given:
4527 template <class T> void f(T);
4528 template <class U> class C {
4529 template <class T> friend void f(T) {}
4532 the friend declaration actually provides the definition
4533 of `f', once C has been instantiated for some type. So,
4534 old_decl will be the out-of-class template declaration,
4535 while new_friend is the in-class definition.
4537 But, if `f' was called before this point, the
4538 instantiation of `f' will have DECL_TI_ARGS corresponding
4539 to `T' but not to `U', references to which might appear
4540 in the definition of `f'. Previously, the most general
4541 template for an instantiation of `f' was the out-of-class
4542 version; now it is the in-class version. Therefore, we
4543 run through all specialization of `f', adding to their
4544 DECL_TI_ARGS appropriately. In particular, they need a
4545 new set of outer arguments, corresponding to the
4546 arguments for this class instantiation.
4548 The same situation can arise with something like this:
4551 template <class T> class C {
4555 when `C<int>' is instantiated. Now, `f(int)' is defined
4558 if (!new_friend_is_defn
)
4559 /* On the other hand, if the in-class declaration does
4560 *not* provide a definition, then we don't want to alter
4561 existing definitions. We can just leave everything
4566 /* Overwrite whatever template info was there before, if
4567 any, with the new template information pertaining to
4569 DECL_TEMPLATE_INFO (old_decl
) = new_friend_template_info
;
4571 if (TREE_CODE (old_decl
) != TEMPLATE_DECL
)
4572 /* duplicate_decls will take care of this case. */
4577 tree new_friend_args
;
4579 DECL_TEMPLATE_INFO (DECL_TEMPLATE_RESULT (old_decl
))
4580 = new_friend_result_template_info
;
4582 new_friend_args
= TI_ARGS (new_friend_template_info
);
4583 for (t
= DECL_TEMPLATE_SPECIALIZATIONS (old_decl
);
4587 tree spec
= TREE_VALUE (t
);
4590 = add_outermost_template_args (new_friend_args
,
4591 DECL_TI_ARGS (spec
));
4594 /* Now, since specializations are always supposed to
4595 hang off of the most general template, we must move
4597 t
= most_general_template (old_decl
);
4600 DECL_TEMPLATE_SPECIALIZATIONS (t
)
4601 = chainon (DECL_TEMPLATE_SPECIALIZATIONS (t
),
4602 DECL_TEMPLATE_SPECIALIZATIONS (old_decl
));
4603 DECL_TEMPLATE_SPECIALIZATIONS (old_decl
) = NULL_TREE
;
4608 /* The information from NEW_FRIEND has been merged into OLD_DECL
4609 by duplicate_decls. */
4610 new_friend
= old_decl
;
4613 else if (COMPLETE_TYPE_P (DECL_CONTEXT (new_friend
)))
4615 /* Check to see that the declaration is really present, and,
4616 possibly obtain an improved declaration. */
4617 tree fn
= check_classfn (DECL_CONTEXT (new_friend
),
4626 input_filename
= file
;
4630 /* FRIEND_TMPL is a friend TEMPLATE_DECL. ARGS is the vector of
4631 template arguments, as for tsubst.
4633 Returns an appropriate tsubst'd friend type or error_mark_node on
4637 tsubst_friend_class (friend_tmpl
, args
)
4644 /* First, we look for a class template. */
4645 tmpl
= lookup_name (DECL_NAME (friend_tmpl
), /*prefer_type=*/0);
4647 /* But, if we don't find one, it might be because we're in a
4648 situation like this:
4656 Here, in the scope of (say) S<int>, `S' is bound to a TYPE_DECL
4657 for `S<int>', not the TEMPLATE_DECL. */
4658 if (!tmpl
|| !DECL_CLASS_TEMPLATE_P (tmpl
))
4660 tmpl
= lookup_name (DECL_NAME (friend_tmpl
), /*prefer_type=*/1);
4661 tmpl
= maybe_get_template_decl_from_type_decl (tmpl
);
4664 if (tmpl
&& DECL_CLASS_TEMPLATE_P (tmpl
))
4666 /* The friend template has already been declared. Just
4667 check to see that the declarations match, and install any new
4668 default parameters. We must tsubst the default parameters,
4669 of course. We only need the innermost template parameters
4670 because that is all that redeclare_class_template will look
4673 = tsubst_template_parms (DECL_TEMPLATE_PARMS (friend_tmpl
),
4674 args
, /*complain=*/1);
4676 return error_mark_node
;
4677 redeclare_class_template (TREE_TYPE (tmpl
), parms
);
4678 friend_type
= TREE_TYPE (tmpl
);
4682 /* The friend template has not already been declared. In this
4683 case, the instantiation of the template class will cause the
4684 injection of this template into the global scope. */
4685 tmpl
= tsubst (friend_tmpl
, args
, /*complain=*/1, NULL_TREE
);
4687 /* The new TMPL is not an instantiation of anything, so we
4688 forget its origins. We don't reset CLASSTYPE_TI_TEMPLATE for
4689 the new type because that is supposed to be the corresponding
4690 template decl, i.e., TMPL. */
4691 DECL_USE_TEMPLATE (tmpl
) = 0;
4692 DECL_TEMPLATE_INFO (tmpl
) = NULL_TREE
;
4693 CLASSTYPE_USE_TEMPLATE (TREE_TYPE (tmpl
)) = 0;
4695 /* Inject this template into the global scope. */
4696 friend_type
= TREE_TYPE (pushdecl_top_level (tmpl
));
4703 instantiate_class_template (type
)
4706 tree
template, args
, pattern
, t
;
4709 if (type
== error_mark_node
)
4710 return error_mark_node
;
4712 if (TYPE_BEING_DEFINED (type
) || COMPLETE_TYPE_P (type
))
4715 /* Figure out which template is being instantiated. */
4716 template = most_general_template (CLASSTYPE_TI_TEMPLATE (type
));
4717 my_friendly_assert (TREE_CODE (template) == TEMPLATE_DECL
, 279);
4719 /* Figure out which arguments are being used to do the
4721 args
= CLASSTYPE_TI_ARGS (type
);
4722 PARTIAL_INSTANTIATION_P (type
) = uses_template_parms (args
);
4724 if (pedantic
&& PARTIAL_INSTANTIATION_P (type
))
4725 /* If this is a partial instantiation, then we can't instantiate
4726 the type; there's no telling whether or not one of the
4727 template parameters might eventually be instantiated to some
4728 value that results in a specialization being used. For
4740 Now, the `S<U>' in `f<int>' is the specialization, not an
4741 instantiation of the original template. */
4744 /* Determine what specialization of the original template to
4746 if (PARTIAL_INSTANTIATION_P (type
))
4747 /* There's no telling which specialization is appropriate at this
4748 point. Since all peeking at the innards of this partial
4749 instantiation are extensions (like the "implicit typename"
4750 extension, which allows users to omit the keyword `typename' on
4751 names that are declared as types in template base classes), we
4752 are free to do what we please.
4754 Trying to figure out which partial instantiation to use can
4755 cause a crash. (Some of the template arguments don't even have
4756 types.) So, we just use the most general version. */
4760 t
= most_specialized_class (template, args
);
4762 if (t
== error_mark_node
)
4764 const char *str
= "candidates are:";
4765 cp_error ("ambiguous class template instantiation for `%#T'", type
);
4766 for (t
= DECL_TEMPLATE_SPECIALIZATIONS (template); t
;
4769 if (get_class_bindings (TREE_VALUE (t
), TREE_PURPOSE (t
),
4772 cp_error_at ("%s %+#T", str
, TREE_TYPE (t
));
4776 TYPE_BEING_DEFINED (type
) = 1;
4777 return error_mark_node
;
4782 pattern
= TREE_TYPE (t
);
4784 pattern
= TREE_TYPE (template);
4786 /* If the template we're instantiating is incomplete, then clearly
4787 there's nothing we can do. */
4788 if (!COMPLETE_TYPE_P (pattern
))
4791 /* If this is a partial instantiation, don't tsubst anything. We will
4792 only use this type for implicit typename, so the actual contents don't
4793 matter. All that matters is whether a particular name is a type. */
4794 if (PARTIAL_INSTANTIATION_P (type
))
4796 /* The fields set here must be kept in sync with those cleared
4797 in begin_class_definition. */
4798 TYPE_BINFO_BASETYPES (type
) = TYPE_BINFO_BASETYPES (pattern
);
4799 TYPE_FIELDS (type
) = TYPE_FIELDS (pattern
);
4800 TYPE_METHODS (type
) = TYPE_METHODS (pattern
);
4801 CLASSTYPE_TAGS (type
) = CLASSTYPE_TAGS (pattern
);
4802 CLASSTYPE_VBASECLASSES (type
) = CLASSTYPE_VBASECLASSES (pattern
);
4804 /* Pretend that the type is complete, so that we will look
4805 inside it during name lookup and such. */
4806 TYPE_SIZE (type
) = bitsize_zero_node
;
4810 /* If we've recursively instantiated too many templates, stop. */
4811 if (! push_tinst_level (type
))
4814 /* Now we're really doing the instantiation. Mark the type as in
4815 the process of being defined. */
4816 TYPE_BEING_DEFINED (type
) = 1;
4818 maybe_push_to_top_level (uses_template_parms (type
));
4822 /* This TYPE is actually a instantiation of of a partial
4823 specialization. We replace the innermost set of ARGS with
4824 the arguments appropriate for substitution. For example,
4827 template <class T> struct S {};
4828 template <class T> struct S<T*> {};
4830 and supposing that we are instantiating S<int*>, ARGS will
4831 present be {int*} but we need {int}. */
4833 = get_class_bindings (TREE_VALUE (t
), TREE_PURPOSE (t
),
4836 /* If there were multiple levels in ARGS, replacing the
4837 innermost level would alter CLASSTYPE_TI_ARGS, which we don't
4838 want, so we make a copy first. */
4839 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (args
))
4841 args
= copy_node (args
);
4842 SET_TMPL_ARGS_LEVEL (args
, TMPL_ARGS_DEPTH (args
), inner_args
);
4848 if (flag_external_templates
)
4850 if (flag_alt_external_templates
)
4852 CLASSTYPE_INTERFACE_ONLY (type
) = interface_only
;
4853 SET_CLASSTYPE_INTERFACE_UNKNOWN_X (type
, interface_unknown
);
4854 CLASSTYPE_VTABLE_NEEDS_WRITING (type
)
4855 = (! CLASSTYPE_INTERFACE_ONLY (type
)
4856 && CLASSTYPE_INTERFACE_KNOWN (type
));
4860 CLASSTYPE_INTERFACE_ONLY (type
) = CLASSTYPE_INTERFACE_ONLY (pattern
);
4861 SET_CLASSTYPE_INTERFACE_UNKNOWN_X
4862 (type
, CLASSTYPE_INTERFACE_UNKNOWN (pattern
));
4863 CLASSTYPE_VTABLE_NEEDS_WRITING (type
)
4864 = (! CLASSTYPE_INTERFACE_ONLY (type
)
4865 && CLASSTYPE_INTERFACE_KNOWN (type
));
4870 SET_CLASSTYPE_INTERFACE_UNKNOWN (type
);
4871 CLASSTYPE_VTABLE_NEEDS_WRITING (type
) = 1;
4874 TYPE_HAS_CONSTRUCTOR (type
) = TYPE_HAS_CONSTRUCTOR (pattern
);
4875 TYPE_HAS_DESTRUCTOR (type
) = TYPE_HAS_DESTRUCTOR (pattern
);
4876 TYPE_OVERLOADS_CALL_EXPR (type
) = TYPE_OVERLOADS_CALL_EXPR (pattern
);
4877 TYPE_OVERLOADS_ARRAY_REF (type
) = TYPE_OVERLOADS_ARRAY_REF (pattern
);
4878 TYPE_OVERLOADS_ARROW (type
) = TYPE_OVERLOADS_ARROW (pattern
);
4879 TYPE_HAS_NEW_OPERATOR (type
) = TYPE_HAS_NEW_OPERATOR (pattern
);
4880 TYPE_HAS_ARRAY_NEW_OPERATOR (type
) = TYPE_HAS_ARRAY_NEW_OPERATOR (pattern
);
4881 TYPE_GETS_DELETE (type
) = TYPE_GETS_DELETE (pattern
);
4882 TYPE_VEC_DELETE_TAKES_SIZE (type
) = TYPE_VEC_DELETE_TAKES_SIZE (pattern
);
4883 TYPE_HAS_ASSIGN_REF (type
) = TYPE_HAS_ASSIGN_REF (pattern
);
4884 TYPE_HAS_CONST_ASSIGN_REF (type
) = TYPE_HAS_CONST_ASSIGN_REF (pattern
);
4885 TYPE_HAS_ABSTRACT_ASSIGN_REF (type
) = TYPE_HAS_ABSTRACT_ASSIGN_REF (pattern
);
4886 TYPE_HAS_INIT_REF (type
) = TYPE_HAS_INIT_REF (pattern
);
4887 TYPE_HAS_CONST_INIT_REF (type
) = TYPE_HAS_CONST_INIT_REF (pattern
);
4888 TYPE_HAS_DEFAULT_CONSTRUCTOR (type
) = TYPE_HAS_DEFAULT_CONSTRUCTOR (pattern
);
4889 TYPE_HAS_CONVERSION (type
) = TYPE_HAS_CONVERSION (pattern
);
4890 TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (type
)
4891 = TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (pattern
);
4892 TYPE_USES_MULTIPLE_INHERITANCE (type
)
4893 = TYPE_USES_MULTIPLE_INHERITANCE (pattern
);
4894 TYPE_USES_VIRTUAL_BASECLASSES (type
)
4895 = TYPE_USES_VIRTUAL_BASECLASSES (pattern
);
4896 TYPE_PACKED (type
) = TYPE_PACKED (pattern
);
4897 TYPE_ALIGN (type
) = TYPE_ALIGN (pattern
);
4898 TYPE_USER_ALIGN (type
) = TYPE_USER_ALIGN (pattern
);
4899 TYPE_FOR_JAVA (type
) = TYPE_FOR_JAVA (pattern
); /* For libjava's JArray<T> */
4900 if (ANON_AGGR_TYPE_P (pattern
))
4901 SET_ANON_AGGR_TYPE_P (type
);
4903 if (TYPE_BINFO_BASETYPES (pattern
))
4905 tree base_list
= NULL_TREE
;
4906 tree pbases
= TYPE_BINFO_BASETYPES (pattern
);
4909 /* Substitute into each of the bases to determine the actual
4911 for (i
= 0; i
< TREE_VEC_LENGTH (pbases
); ++i
)
4917 pbase
= TREE_VEC_ELT (pbases
, i
);
4919 /* Substitute to figure out the base class. */
4920 base
= tsubst (BINFO_TYPE (pbase
), args
,
4921 /*complain=*/1, NULL_TREE
);
4922 if (base
== error_mark_node
)
4925 /* Calculate the correct access node. */
4926 if (TREE_VIA_VIRTUAL (pbase
))
4928 if (TREE_VIA_PUBLIC (pbase
))
4929 access
= access_public_virtual_node
;
4930 else if (TREE_VIA_PROTECTED (pbase
))
4931 access
= access_protected_virtual_node
;
4933 access
= access_private_virtual_node
;
4937 if (TREE_VIA_PUBLIC (pbase
))
4938 access
= access_public_node
;
4939 else if (TREE_VIA_PROTECTED (pbase
))
4940 access
= access_protected_node
;
4942 access
= access_private_node
;
4945 base_list
= tree_cons (access
, base
, base_list
);
4948 /* The list is now in reverse order; correct that. */
4949 base_list
= nreverse (base_list
);
4951 /* Now call xref_basetypes to set up all the base-class
4953 xref_basetypes (TREE_CODE (pattern
) == RECORD_TYPE
4954 ? (CLASSTYPE_DECLARED_CLASS (pattern
)
4955 ? class_type_node
: record_type_node
)
4957 DECL_NAME (TYPE_NAME (pattern
)),
4962 /* Now that our base classes are set up, enter the scope of the
4963 class, so that name lookups into base classes, etc. will work
4964 correctly. This is precisely analogous to what we do in
4965 begin_class_definition when defining an ordinary non-template
4967 pushclass (type
, 1);
4969 for (t
= CLASSTYPE_TAGS (pattern
); t
; t
= TREE_CHAIN (t
))
4971 tree tag
= TREE_VALUE (t
);
4972 tree name
= TYPE_IDENTIFIER (tag
);
4975 newtag
= tsubst (tag
, args
, /*complain=*/1, NULL_TREE
);
4976 if (TREE_CODE (newtag
) != ENUMERAL_TYPE
)
4978 if (TYPE_LANG_SPECIFIC (tag
) && CLASSTYPE_IS_TEMPLATE (tag
))
4979 /* Unfortunately, lookup_template_class sets
4980 CLASSTYPE_IMPLICIT_INSTANTIATION for a partial
4981 instantiation (i.e., for the type of a member template
4982 class nested within a template class.) This behavior is
4983 required for maybe_process_partial_specialization to work
4984 correctly, but is not accurate in this case; the TAG is not
4985 an instantiation of anything. (The corresponding
4986 TEMPLATE_DECL is an instantiation, but the TYPE is not.) */
4987 CLASSTYPE_USE_TEMPLATE (newtag
) = 0;
4989 /* Now, we call pushtag to put this NEWTAG into the scope of
4990 TYPE. We first set up the IDENTIFIER_TYPE_VALUE to avoid
4991 pushtag calling push_template_decl. We don't have to do
4992 this for enums because it will already have been done in
4995 SET_IDENTIFIER_TYPE_VALUE (name
, newtag
);
4996 pushtag (name
, newtag
, /*globalize=*/0);
5000 /* Don't replace enum constants here. */
5001 for (t
= TYPE_FIELDS (pattern
); t
; t
= TREE_CHAIN (t
))
5002 if (TREE_CODE (t
) != CONST_DECL
)
5006 /* The the file and line for this declaration, to assist in
5007 error message reporting. Since we called push_tinst_level
5008 above, we don't need to restore these. */
5009 lineno
= DECL_SOURCE_LINE (t
);
5010 input_filename
= DECL_SOURCE_FILE (t
);
5012 r
= tsubst (t
, args
, /*complain=*/1, NULL_TREE
);
5013 if (TREE_CODE (r
) == VAR_DECL
)
5017 if (DECL_DEFINED_IN_CLASS_P (r
))
5018 init
= tsubst_expr (DECL_INITIAL (t
), args
,
5019 /*complain=*/1, NULL_TREE
);
5023 finish_static_data_member_decl (r
, init
,
5024 /*asmspec_tree=*/NULL_TREE
,
5027 if (DECL_DEFINED_IN_CLASS_P (r
))
5028 check_static_variable_definition (r
, TREE_TYPE (r
));
5031 /* R will have a TREE_CHAIN if and only if it has already been
5032 processed by finish_member_declaration. This can happen
5033 if, for example, it is a TYPE_DECL for a class-scoped
5034 ENUMERAL_TYPE; such a thing will already have been added to
5035 the field list by tsubst_enum above. */
5036 if (!TREE_CHAIN (r
))
5038 set_current_access_from_decl (r
);
5039 finish_member_declaration (r
);
5043 /* Set up the list (TYPE_METHODS) and vector (CLASSTYPE_METHOD_VEC)
5044 for this instantiation. */
5045 for (t
= TYPE_METHODS (pattern
); t
; t
= TREE_CHAIN (t
))
5047 tree r
= tsubst (t
, args
, /*complain=*/1, NULL_TREE
);
5048 set_current_access_from_decl (r
);
5049 finish_member_declaration (r
);
5052 /* Construct the DECL_FRIENDLIST for the new class type. */
5053 typedecl
= TYPE_MAIN_DECL (type
);
5054 for (t
= DECL_FRIENDLIST (TYPE_MAIN_DECL (pattern
));
5060 for (friends
= TREE_VALUE (t
);
5061 friends
!= NULL_TREE
;
5062 friends
= TREE_CHAIN (friends
))
5063 if (TREE_PURPOSE (friends
) == error_mark_node
)
5065 tsubst_friend_function (TREE_VALUE (friends
),
5068 my_friendly_abort (20000216);
5071 for (t
= CLASSTYPE_FRIEND_CLASSES (pattern
);
5075 tree friend_type
= TREE_VALUE (t
);
5076 tree new_friend_type
;
5078 if (TREE_CODE (friend_type
) == TEMPLATE_DECL
)
5079 new_friend_type
= tsubst_friend_class (friend_type
, args
);
5080 else if (uses_template_parms (friend_type
))
5081 new_friend_type
= tsubst (friend_type
, args
, /*complain=*/1,
5085 tree ns
= decl_namespace_context (TYPE_MAIN_DECL (friend_type
));
5087 /* The call to xref_tag_from_type does injection for friend
5089 push_nested_namespace (ns
);
5091 xref_tag_from_type (friend_type
, NULL_TREE
, 1);
5092 pop_nested_namespace (ns
);
5095 if (TREE_CODE (friend_type
) == TEMPLATE_DECL
)
5096 /* Trick make_friend_class into realizing that the friend
5097 we're adding is a template, not an ordinary class. It's
5098 important that we use make_friend_class since it will
5099 perform some error-checking and output cross-reference
5101 ++processing_template_decl
;
5103 if (new_friend_type
!= error_mark_node
)
5104 make_friend_class (type
, new_friend_type
);
5106 if (TREE_CODE (friend_type
) == TEMPLATE_DECL
)
5107 --processing_template_decl
;
5110 for (t
= TYPE_FIELDS (type
); t
; t
= TREE_CHAIN (t
))
5111 if (TREE_CODE (t
) == FIELD_DECL
)
5113 TREE_TYPE (t
) = complete_type (TREE_TYPE (t
));
5114 require_complete_type (t
);
5117 /* Set the file and line number information to whatever is given for
5118 the class itself. This puts error messages involving generated
5119 implicit functions at a predictable point, and the same point
5120 that would be used for non-template classes. */
5121 lineno
= DECL_SOURCE_LINE (typedecl
);
5122 input_filename
= DECL_SOURCE_FILE (typedecl
);
5124 unreverse_member_declarations (type
);
5125 finish_struct_1 (type
);
5126 CLASSTYPE_GOT_SEMICOLON (type
) = 1;
5128 /* Clear this now so repo_template_used is happy. */
5129 TYPE_BEING_DEFINED (type
) = 0;
5130 repo_template_used (type
);
5132 /* Now that the class is complete, instantiate default arguments for
5133 any member functions. We don't do this earlier because the
5134 default arguments may reference members of the class. */
5135 if (!PRIMARY_TEMPLATE_P (template))
5136 for (t
= TYPE_METHODS (type
); t
; t
= TREE_CHAIN (t
))
5137 if (TREE_CODE (t
) == FUNCTION_DECL
5138 /* Implicitly generated member functions will not have template
5139 information; they are not instantiations, but instead are
5140 created "fresh" for each instantiation. */
5141 && DECL_TEMPLATE_INFO (t
))
5142 tsubst_default_arguments (t
);
5145 pop_from_top_level ();
5155 if (t1
== NULL_TREE
)
5156 return t2
== NULL_TREE
;
5157 if (t2
== NULL_TREE
)
5159 /* Don't care if one declares its arg const and the other doesn't -- the
5160 main variant of the arg type is all that matters. */
5161 if (TYPE_MAIN_VARIANT (TREE_VALUE (t1
))
5162 != TYPE_MAIN_VARIANT (TREE_VALUE (t2
)))
5164 return list_eq (TREE_CHAIN (t1
), TREE_CHAIN (t2
));
5167 /* If arg is a non-type template parameter that does not depend on template
5168 arguments, fold it like we weren't in the body of a template. */
5171 maybe_fold_nontype_arg (arg
)
5174 /* If we're not in a template, ARG is already as simple as it's going to
5175 get, and trying to reprocess the trees will break. */
5176 if (! processing_template_decl
)
5179 if (!TYPE_P (arg
) && !uses_template_parms (arg
))
5181 /* Sometimes, one of the args was an expression involving a
5182 template constant parameter, like N - 1. Now that we've
5183 tsubst'd, we might have something like 2 - 1. This will
5184 confuse lookup_template_class, so we do constant folding
5185 here. We have to unset processing_template_decl, to
5186 fool build_expr_from_tree() into building an actual
5189 int saved_processing_template_decl
= processing_template_decl
;
5190 processing_template_decl
= 0;
5191 arg
= fold (build_expr_from_tree (arg
));
5192 processing_template_decl
= saved_processing_template_decl
;
5197 /* Substitute ARGS into the vector of template arguments T. */
5200 tsubst_template_arg_vector (t
, args
, complain
)
5205 int len
= TREE_VEC_LENGTH (t
), need_new
= 0, i
;
5206 tree
*elts
= (tree
*) alloca (len
* sizeof (tree
));
5208 memset ((char *) elts
, 0, len
* sizeof (tree
));
5210 for (i
= 0; i
< len
; i
++)
5212 if (TREE_VEC_ELT (t
, i
) != NULL_TREE
5213 && TREE_CODE (TREE_VEC_ELT (t
, i
)) == TREE_VEC
)
5214 elts
[i
] = tsubst_template_arg_vector (TREE_VEC_ELT (t
, i
),
5217 elts
[i
] = maybe_fold_nontype_arg
5218 (tsubst_expr (TREE_VEC_ELT (t
, i
), args
, complain
,
5221 if (elts
[i
] == error_mark_node
)
5222 return error_mark_node
;
5224 if (elts
[i
] != TREE_VEC_ELT (t
, i
))
5231 t
= make_tree_vec (len
);
5232 for (i
= 0; i
< len
; i
++)
5233 TREE_VEC_ELT (t
, i
) = elts
[i
];
5238 /* Return the result of substituting ARGS into the template parameters
5239 given by PARMS. If there are m levels of ARGS and m + n levels of
5240 PARMS, then the result will contain n levels of PARMS. For
5241 example, if PARMS is `template <class T> template <class U>
5242 template <T*, U, class V>' and ARGS is {{int}, {double}} then the
5243 result will be `template <int*, double, class V>'. */
5246 tsubst_template_parms (parms
, args
, complain
)
5254 for (new_parms
= &r
;
5255 TMPL_PARMS_DEPTH (parms
) > TMPL_ARGS_DEPTH (args
);
5256 new_parms
= &(TREE_CHAIN (*new_parms
)),
5257 parms
= TREE_CHAIN (parms
))
5260 make_tree_vec (TREE_VEC_LENGTH (TREE_VALUE (parms
)));
5263 for (i
= 0; i
< TREE_VEC_LENGTH (new_vec
); ++i
)
5265 tree default_value
=
5266 TREE_PURPOSE (TREE_VEC_ELT (TREE_VALUE (parms
), i
));
5268 TREE_VALUE (TREE_VEC_ELT (TREE_VALUE (parms
), i
));
5270 TREE_VEC_ELT (new_vec
, i
)
5271 = build_tree_list (tsubst (default_value
, args
, complain
,
5273 tsubst (parm_decl
, args
, complain
,
5278 tree_cons (build_int_2 (0, (TMPL_PARMS_DEPTH (parms
)
5279 - TMPL_ARGS_DEPTH (args
))),
5280 new_vec
, NULL_TREE
);
5286 /* Substitute the ARGS into the indicated aggregate (or enumeration)
5287 type T. If T is not an aggregate or enumeration type, it is
5288 handled as if by tsubst. IN_DECL is as for tsubst. If
5289 ENTERING_SCOPE is non-zero, T is the context for a template which
5290 we are presently tsubst'ing. Return the substituted value. */
5293 tsubst_aggr_type (t
, args
, complain
, in_decl
, entering_scope
)
5303 switch (TREE_CODE (t
))
5306 if (TYPE_PTRMEMFUNC_P (t
))
5308 tree r
= build_ptrmemfunc_type
5309 (tsubst (TYPE_PTRMEMFUNC_FN_TYPE (t
), args
, complain
, in_decl
));
5310 return cp_build_qualified_type_real (r
, TYPE_QUALS (t
),
5314 /* else fall through */
5317 if (TYPE_TEMPLATE_INFO (t
))
5323 /* First, determine the context for the type we are looking
5325 if (TYPE_CONTEXT (t
) != NULL_TREE
)
5326 context
= tsubst_aggr_type (TYPE_CONTEXT (t
), args
,
5328 in_decl
, /*entering_scope=*/1);
5330 context
= NULL_TREE
;
5332 /* Then, figure out what arguments are appropriate for the
5333 type we are trying to find. For example, given:
5335 template <class T> struct S;
5336 template <class T, class U> void f(T, U) { S<U> su; }
5338 and supposing that we are instantiating f<int, double>,
5339 then our ARGS will be {int, double}, but, when looking up
5340 S we only want {double}. */
5341 argvec
= tsubst_template_arg_vector (TYPE_TI_ARGS (t
), args
,
5343 if (argvec
== error_mark_node
)
5344 return error_mark_node
;
5346 r
= lookup_template_class (t
, argvec
, in_decl
, context
,
5349 return cp_build_qualified_type_real (r
, TYPE_QUALS (t
),
5353 /* This is not a template type, so there's nothing to do. */
5357 return tsubst (t
, args
, complain
, in_decl
);
5361 /* Substitute into the default argument ARG (a default argument for
5362 FN), which has the indicated TYPE. */
5365 tsubst_default_argument (fn
, type
, arg
)
5370 /* This default argument came from a template. Instantiate the
5371 default argument here, not in tsubst. In the case of
5380 we must be careful to do name lookup in the scope of S<T>,
5381 rather than in the current class. */
5382 if (DECL_CLASS_SCOPE_P (fn
))
5383 pushclass (DECL_CONTEXT (fn
), 2);
5385 arg
= tsubst_expr (arg
, DECL_TI_ARGS (fn
), /*complain=*/1, NULL_TREE
);
5387 if (DECL_CLASS_SCOPE_P (fn
))
5390 /* Make sure the default argument is reasonable. */
5391 arg
= check_default_argument (type
, arg
);
5396 /* Substitute into all the default arguments for FN. */
5399 tsubst_default_arguments (fn
)
5405 tmpl_args
= DECL_TI_ARGS (fn
);
5407 /* If this function is not yet instantiated, we certainly don't need
5408 its default arguments. */
5409 if (uses_template_parms (tmpl_args
))
5412 for (arg
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
5414 arg
= TREE_CHAIN (arg
))
5415 if (TREE_PURPOSE (arg
))
5416 TREE_PURPOSE (arg
) = tsubst_default_argument (fn
,
5418 TREE_PURPOSE (arg
));
5421 /* Substitute the ARGS into the T, which is a _DECL. TYPE is the
5422 (already computed) substitution of ARGS into TREE_TYPE (T), if
5423 appropriate. Return the result of the substitution. IN_DECL is as
5427 tsubst_decl (t
, args
, type
, in_decl
)
5434 const char *saved_filename
;
5437 /* Set the filename and linenumber to improve error-reporting. */
5438 saved_lineno
= lineno
;
5439 saved_filename
= input_filename
;
5440 lineno
= DECL_SOURCE_LINE (t
);
5441 input_filename
= DECL_SOURCE_FILE (t
);
5443 switch (TREE_CODE (t
))
5447 /* We can get here when processing a member template function
5448 of a template class. */
5449 tree decl
= DECL_TEMPLATE_RESULT (t
);
5451 int is_template_template_parm
= DECL_TEMPLATE_TEMPLATE_PARM_P (t
);
5453 if (!is_template_template_parm
)
5455 /* We might already have an instance of this template.
5456 The ARGS are for the surrounding class type, so the
5457 full args contain the tsubst'd args for the context,
5458 plus the innermost args from the template decl. */
5459 tree tmpl_args
= DECL_CLASS_TEMPLATE_P (t
)
5460 ? CLASSTYPE_TI_ARGS (TREE_TYPE (t
))
5461 : DECL_TI_ARGS (DECL_TEMPLATE_RESULT (t
));
5464 full_args
= tsubst_template_arg_vector (tmpl_args
, args
,
5467 /* tsubst_template_arg_vector doesn't copy the vector if
5468 nothing changed. But, *something* should have
5470 my_friendly_assert (full_args
!= tmpl_args
, 0);
5472 spec
= retrieve_specialization (t
, full_args
);
5473 if (spec
!= NULL_TREE
)
5480 /* Make a new template decl. It will be similar to the
5481 original, but will record the current template arguments.
5482 We also create a new function declaration, which is just
5483 like the old one, but points to this new template, rather
5484 than the old one. */
5486 my_friendly_assert (DECL_LANG_SPECIFIC (r
) != 0, 0);
5487 TREE_CHAIN (r
) = NULL_TREE
;
5489 if (is_template_template_parm
)
5491 tree new_decl
= tsubst (decl
, args
, /*complain=*/1, in_decl
);
5492 DECL_TEMPLATE_RESULT (r
) = new_decl
;
5493 TREE_TYPE (r
) = TREE_TYPE (new_decl
);
5498 = tsubst_aggr_type (DECL_CONTEXT (t
), args
,
5499 /*complain=*/1, in_decl
,
5500 /*entering_scope=*/1);
5501 DECL_VIRTUAL_CONTEXT (r
)
5502 = tsubst_aggr_type (DECL_VIRTUAL_CONTEXT (t
), args
,
5503 /*complain=*/1, in_decl
,
5504 /*entering_scope=*/1);
5505 DECL_TEMPLATE_INFO (r
) = build_tree_list (t
, args
);
5507 if (TREE_CODE (decl
) == TYPE_DECL
)
5509 tree new_type
= tsubst (TREE_TYPE (t
), args
,
5510 /*complain=*/1, in_decl
);
5511 TREE_TYPE (r
) = new_type
;
5512 CLASSTYPE_TI_TEMPLATE (new_type
) = r
;
5513 DECL_TEMPLATE_RESULT (r
) = TYPE_MAIN_DECL (new_type
);
5514 DECL_TI_ARGS (r
) = CLASSTYPE_TI_ARGS (new_type
);
5518 tree new_decl
= tsubst (decl
, args
, /*complain=*/1, in_decl
);
5520 DECL_TEMPLATE_RESULT (r
) = new_decl
;
5521 DECL_TI_TEMPLATE (new_decl
) = r
;
5522 TREE_TYPE (r
) = TREE_TYPE (new_decl
);
5523 DECL_TI_ARGS (r
) = DECL_TI_ARGS (new_decl
);
5526 SET_DECL_IMPLICIT_INSTANTIATION (r
);
5527 DECL_TEMPLATE_INSTANTIATIONS (r
) = NULL_TREE
;
5528 DECL_TEMPLATE_SPECIALIZATIONS (r
) = NULL_TREE
;
5530 /* The template parameters for this new template are all the
5531 template parameters for the old template, except the
5532 outermost level of parameters. */
5533 DECL_TEMPLATE_PARMS (r
)
5534 = tsubst_template_parms (DECL_TEMPLATE_PARMS (t
), args
,
5537 if (PRIMARY_TEMPLATE_P (t
))
5538 DECL_PRIMARY_TEMPLATE (r
) = r
;
5540 /* We don't partially instantiate partial specializations. */
5541 if (TREE_CODE (decl
) == TYPE_DECL
)
5544 /* Record this partial instantiation. */
5545 register_specialization (r
, t
,
5546 DECL_TI_ARGS (DECL_TEMPLATE_RESULT (r
)));
5554 tree argvec
= NULL_TREE
;
5561 /* Nobody should be tsubst'ing into non-template functions. */
5562 my_friendly_assert (DECL_TEMPLATE_INFO (t
) != NULL_TREE
, 0);
5564 if (TREE_CODE (DECL_TI_TEMPLATE (t
)) == TEMPLATE_DECL
)
5568 /* Calculate the most general template of which R is a
5569 specialization, and the complete set of arguments used to
5571 gen_tmpl
= most_general_template (DECL_TI_TEMPLATE (t
));
5573 = tsubst_template_arg_vector (DECL_TI_ARGS
5574 (DECL_TEMPLATE_RESULT (gen_tmpl
)),
5575 args
, /*complain=*/1);
5577 /* Check to see if we already have this specialization. */
5578 spec
= retrieve_specialization (gen_tmpl
, argvec
);
5586 /* We can see more levels of arguments than parameters if
5587 there was a specialization of a member template, like
5590 template <class T> struct S { template <class U> void f(); }
5591 template <> template <class U> void S<int>::f(U);
5593 Here, we'll be substituting into the specialization,
5594 because that's where we can find the code we actually
5595 want to generate, but we'll have enough arguments for
5596 the most general template.
5598 We also deal with the peculiar case:
5600 template <class T> struct S {
5601 template <class U> friend void f();
5603 template <class U> void f() {}
5605 template void f<double>();
5607 Here, the ARGS for the instantiation of will be {int,
5608 double}. But, we only need as many ARGS as there are
5609 levels of template parameters in CODE_PATTERN. We are
5610 careful not to get fooled into reducing the ARGS in
5613 template <class T> struct S { template <class U> void f(U); }
5614 template <class T> template <> void S<T>::f(int) {}
5616 which we can spot because the pattern will be a
5617 specialization in this case. */
5618 args_depth
= TMPL_ARGS_DEPTH (args
);
5620 TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (DECL_TI_TEMPLATE (t
)));
5621 if (args_depth
> parms_depth
5622 && !DECL_TEMPLATE_SPECIALIZATION (t
))
5623 args
= get_innermost_template_args (args
, parms_depth
);
5627 /* This special case arises when we have something like this:
5629 template <class T> struct S {
5630 friend void f<int>(int, double);
5633 Here, the DECL_TI_TEMPLATE for the friend declaration
5634 will be a LOOKUP_EXPR or an IDENTIFIER_NODE. We are
5635 being called from tsubst_friend_function, and we want
5636 only to create a new decl (R) with appropriate types so
5637 that we can call determine_specialization. */
5638 my_friendly_assert ((TREE_CODE (DECL_TI_TEMPLATE (t
))
5640 || (TREE_CODE (DECL_TI_TEMPLATE (t
))
5641 == IDENTIFIER_NODE
), 0);
5642 gen_tmpl
= NULL_TREE
;
5645 if (DECL_CLASS_SCOPE_P (t
))
5647 if (DECL_NAME (t
) == constructor_name (DECL_CONTEXT (t
)))
5651 ctx
= tsubst_aggr_type (DECL_CONTEXT (t
), args
,
5653 /*entering_scope=*/1);
5658 ctx
= DECL_CONTEXT (t
);
5660 type
= tsubst (type
, args
, /*complain=*/1, in_decl
);
5661 if (type
== error_mark_node
)
5662 return error_mark_node
;
5664 /* We do NOT check for matching decls pushed separately at this
5665 point, as they may not represent instantiations of this
5666 template, and in any case are considered separate under the
5669 DECL_USE_TEMPLATE (r
) = 0;
5670 TREE_TYPE (r
) = type
;
5672 DECL_CONTEXT (r
) = ctx
;
5673 DECL_VIRTUAL_CONTEXT (r
)
5674 = tsubst_aggr_type (DECL_VIRTUAL_CONTEXT (t
), args
,
5676 /*entering_scope=*/1);
5678 if (member
&& DECL_CONV_FN_P (r
))
5680 /* Type-conversion operator. Reconstruct the name, in
5681 case it's the name of one of the template's parameters. */
5683 DECL_NAME (r
) = mangle_conv_op_name_for_type (TREE_TYPE (type
));
5685 DECL_NAME (r
) = build_typename_overload (TREE_TYPE (type
));
5688 DECL_ARGUMENTS (r
) = tsubst (DECL_ARGUMENTS (t
), args
,
5690 DECL_TEMPLATE_RESULT (r
) = NULL_TREE
;
5692 TREE_STATIC (r
) = 0;
5693 TREE_PUBLIC (r
) = TREE_PUBLIC (t
);
5694 DECL_EXTERNAL (r
) = 1;
5695 DECL_INTERFACE_KNOWN (r
) = 0;
5696 DECL_DEFER_OUTPUT (r
) = 0;
5697 TREE_CHAIN (r
) = NULL_TREE
;
5698 DECL_PENDING_INLINE_INFO (r
) = 0;
5699 DECL_PENDING_INLINE_P (r
) = 0;
5700 DECL_SAVED_TREE (r
) = NULL_TREE
;
5702 if (DECL_CLONED_FUNCTION (r
))
5704 DECL_CLONED_FUNCTION (r
) = tsubst (DECL_CLONED_FUNCTION (t
),
5705 args
, /*complain=*/1, t
);
5706 TREE_CHAIN (r
) = TREE_CHAIN (DECL_CLONED_FUNCTION (r
));
5707 TREE_CHAIN (DECL_CLONED_FUNCTION (r
)) = r
;
5710 /* Set up the DECL_TEMPLATE_INFO for R and compute its mangled
5711 name. There's no need to do this in the special friend
5712 case mentioned above where GEN_TMPL is NULL. */
5715 DECL_TEMPLATE_INFO (r
)
5716 = tree_cons (gen_tmpl
, argvec
, NULL_TREE
);
5717 SET_DECL_IMPLICIT_INSTANTIATION (r
);
5718 register_specialization (r
, gen_tmpl
, argvec
);
5720 /* Set the mangled name for R. */
5721 if (DECL_DESTRUCTOR_P (t
))
5724 set_mangled_name_for_decl (r
);
5726 DECL_ASSEMBLER_NAME (r
) = build_destructor_name (ctx
);
5730 /* Instantiations of template functions must be mangled
5731 specially, in order to conform to 14.5.5.1
5732 [temp.over.link]. */
5733 tree tmpl
= DECL_TI_TEMPLATE (t
);
5735 /* TMPL will be NULL if this is a specialization of a
5736 member function of a template class. */
5737 if (name_mangling_version
< 1
5738 || tmpl
== NULL_TREE
5739 || (member
&& !is_member_template (tmpl
)
5740 && !DECL_TEMPLATE_INFO (tmpl
)))
5741 set_mangled_name_for_decl (r
);
5743 set_mangled_name_for_template_decl (r
);
5747 make_decl_rtl (r
, NULL_PTR
, 1);
5749 /* Like grokfndecl. If we don't do this, pushdecl will
5750 mess up our TREE_CHAIN because it doesn't find a
5751 previous decl. Sigh. */
5753 && ! uses_template_parms (r
)
5754 && (IDENTIFIER_GLOBAL_VALUE (DECL_ASSEMBLER_NAME (r
))
5756 SET_IDENTIFIER_GLOBAL_VALUE (DECL_ASSEMBLER_NAME (r
), r
);
5758 /* We're not supposed to instantiate default arguments
5759 until they are called, for a template. But, for a
5762 template <class T> void f ()
5763 { extern void g(int i = T()); }
5765 we should do the substitution when the template is
5766 instantiated. We handle the member function case in
5767 instantiate_class_template since the default arguments
5768 might refer to other members of the class. */
5770 && !PRIMARY_TEMPLATE_P (gen_tmpl
)
5771 && !uses_template_parms (argvec
))
5772 tsubst_default_arguments (r
);
5775 /* Copy the list of befriending classes. */
5776 for (friends
= &DECL_BEFRIENDING_CLASSES (r
);
5778 friends
= &TREE_CHAIN (*friends
))
5780 *friends
= copy_node (*friends
);
5781 TREE_VALUE (*friends
) = tsubst (TREE_VALUE (*friends
),
5782 args
, /*complain=*/1,
5786 if (DECL_CONSTRUCTOR_P (r
) || DECL_DESTRUCTOR_P (r
))
5788 maybe_retrofit_in_chrg (r
);
5789 if (DECL_CONSTRUCTOR_P (r
))
5790 grok_ctor_properties (ctx
, r
);
5792 else if (IDENTIFIER_OPNAME_P (DECL_NAME (r
)))
5793 grok_op_properties (r
, DECL_VIRTUAL_P (r
), DECL_FRIEND_P (r
));
5800 TREE_TYPE (r
) = type
;
5801 c_apply_type_quals_to_decl (CP_TYPE_QUALS (type
), r
);
5803 if (TREE_CODE (DECL_INITIAL (r
)) != TEMPLATE_PARM_INDEX
)
5804 DECL_INITIAL (r
) = TREE_TYPE (r
);
5806 DECL_INITIAL (r
) = tsubst (DECL_INITIAL (r
), args
,
5807 /*complain=*/1, in_decl
);
5809 DECL_CONTEXT (r
) = NULL_TREE
;
5810 if (PROMOTE_PROTOTYPES
5811 && (TREE_CODE (type
) == INTEGER_TYPE
5812 || TREE_CODE (type
) == ENUMERAL_TYPE
)
5813 && TYPE_PRECISION (type
) < TYPE_PRECISION (integer_type_node
))
5814 DECL_ARG_TYPE (r
) = integer_type_node
;
5816 TREE_CHAIN (r
) = tsubst (TREE_CHAIN (t
), args
,
5817 /*complain=*/1, TREE_CHAIN (t
));
5824 TREE_TYPE (r
) = type
;
5825 c_apply_type_quals_to_decl (CP_TYPE_QUALS (type
), r
);
5827 /* We don't have to set DECL_CONTEXT here; it is set by
5828 finish_member_declaration. */
5829 DECL_INITIAL (r
) = tsubst_expr (DECL_INITIAL (t
), args
,
5830 /*complain=*/1, in_decl
);
5831 TREE_CHAIN (r
) = NULL_TREE
;
5832 if (TREE_CODE (type
) == VOID_TYPE
)
5833 cp_error_at ("instantiation of `%D' as type void", r
);
5841 = tsubst_copy (DECL_INITIAL (t
), args
, /*complain=*/1, in_decl
);
5842 TREE_CHAIN (r
) = NULL_TREE
;
5847 if (TREE_CODE (type
) == TEMPLATE_TEMPLATE_PARM
5848 || t
== TYPE_MAIN_DECL (TREE_TYPE (t
)))
5850 /* If this is the canonical decl, we don't have to mess with
5851 instantiations, and often we can't (for typename, template
5852 type parms and such). Note that TYPE_NAME is not correct for
5853 the above test if we've copied the type for a typedef. */
5854 r
= TYPE_NAME (type
);
5862 tree argvec
= NULL_TREE
;
5863 tree gen_tmpl
= NULL_TREE
;
5865 tree tmpl
= NULL_TREE
;
5869 /* Assume this is a non-local variable. */
5872 if (TYPE_P (CP_DECL_CONTEXT (t
)))
5873 ctx
= tsubst_aggr_type (DECL_CONTEXT (t
), args
,
5875 in_decl
, /*entering_scope=*/1);
5878 /* Subsequent calls to pushdecl will fill this in. */
5880 if (!DECL_NAMESPACE_SCOPE_P (t
))
5884 /* Check to see if we already have this specialization. */
5887 tmpl
= DECL_TI_TEMPLATE (t
);
5888 gen_tmpl
= most_general_template (tmpl
);
5889 argvec
= tsubst (DECL_TI_ARGS (t
), args
, /*complain=*/1, in_decl
);
5890 spec
= retrieve_specialization (gen_tmpl
, argvec
);
5893 spec
= retrieve_local_specialization (t
);
5902 TREE_TYPE (r
) = type
;
5903 c_apply_type_quals_to_decl (CP_TYPE_QUALS (type
), r
);
5904 DECL_CONTEXT (r
) = ctx
;
5906 /* Don't try to expand the initializer until someone tries to use
5907 this variable; otherwise we run into circular dependencies. */
5908 DECL_INITIAL (r
) = NULL_TREE
;
5910 DECL_SIZE (r
) = DECL_SIZE_UNIT (r
) = 0;
5912 /* For __PRETTY_FUNCTION__ we have to adjust the initializer. */
5913 if (DECL_PRETTY_FUNCTION_P (r
))
5915 DECL_INITIAL (r
) = tsubst (DECL_INITIAL (t
),
5919 TREE_TYPE (r
) = TREE_TYPE (DECL_INITIAL (r
));
5922 /* Even if the original location is out of scope, the newly
5923 substituted one is not. */
5924 if (TREE_CODE (r
) == VAR_DECL
)
5925 DECL_DEAD_FOR_LOCAL (r
) = 0;
5929 /* A static data member declaration is always marked
5930 external when it is declared in-class, even if an
5931 initializer is present. We mimic the non-template
5933 DECL_EXTERNAL (r
) = 1;
5935 register_specialization (r
, gen_tmpl
, argvec
);
5936 DECL_TEMPLATE_INFO (r
) = tree_cons (tmpl
, argvec
, NULL_TREE
);
5937 SET_DECL_IMPLICIT_INSTANTIATION (r
);
5940 register_local_specialization (r
, t
);
5942 TREE_CHAIN (r
) = NULL_TREE
;
5943 if (TREE_CODE (r
) == VAR_DECL
&& TREE_CODE (type
) == VOID_TYPE
)
5944 cp_error_at ("instantiation of `%D' as type void", r
);
5949 my_friendly_abort (0);
5952 /* Restore the file and line information. */
5953 lineno
= saved_lineno
;
5954 input_filename
= saved_filename
;
5959 /* Substitue into the ARG_TYPES of a function type. */
5962 tsubst_arg_types (arg_types
, args
, complain
, in_decl
)
5968 tree remaining_arg_types
;
5971 if (!arg_types
|| arg_types
== void_list_node
)
5974 remaining_arg_types
= tsubst_arg_types (TREE_CHAIN (arg_types
),
5975 args
, complain
, in_decl
);
5976 if (remaining_arg_types
== error_mark_node
)
5977 return error_mark_node
;
5979 type
= tsubst (TREE_VALUE (arg_types
), args
, complain
, in_decl
);
5980 if (type
== error_mark_node
)
5981 return error_mark_node
;
5983 /* Do array-to-pointer, function-to-pointer conversion, and ignore
5984 top-level qualifiers as required. */
5985 type
= TYPE_MAIN_VARIANT (type_decays_to (type
));
5987 /* Note that we do not substitute into default arguments here. The
5988 standard mandates that they be instantiated only when needed,
5989 which is done in build_over_call. */
5990 return hash_tree_cons (TREE_PURPOSE (arg_types
), type
,
5991 remaining_arg_types
);
5995 /* Substitute into a FUNCTION_TYPE or METHOD_TYPE. This routine does
5996 *not* handle the exception-specification for FNTYPE, because the
5997 initial substitution of explicitly provided template parameters
5998 during argument deduction forbids substitution into the
5999 exception-specification:
6003 All references in the function type of the function template to the
6004 corresponding template parameters are replaced by the specified tem-
6005 plate argument values. If a substitution in a template parameter or
6006 in the function type of the function template results in an invalid
6007 type, type deduction fails. [Note: The equivalent substitution in
6008 exception specifications is done only when the function is instanti-
6009 ated, at which point a program is ill-formed if the substitution
6010 results in an invalid type.] */
6013 tsubst_function_type (t
, args
, complain
, in_decl
)
6023 /* The TYPE_CONTEXT is not used for function/method types. */
6024 my_friendly_assert (TYPE_CONTEXT (t
) == NULL_TREE
, 0);
6026 /* Substitue the return type. */
6027 return_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
6028 if (return_type
== error_mark_node
)
6029 return error_mark_node
;
6031 /* Substitue the argument types. */
6032 arg_types
= tsubst_arg_types (TYPE_ARG_TYPES (t
), args
,
6034 if (arg_types
== error_mark_node
)
6035 return error_mark_node
;
6037 /* Construct a new type node and return it. */
6038 if (TREE_CODE (t
) == FUNCTION_TYPE
)
6039 fntype
= build_function_type (return_type
, arg_types
);
6042 tree r
= TREE_TYPE (TREE_VALUE (arg_types
));
6043 if (! IS_AGGR_TYPE (r
))
6047 Type deduction may fail for any of the following
6050 -- Attempting to create "pointer to member of T" when T
6051 is not a class type. */
6053 cp_error ("creating pointer to member function of non-class type `%T'",
6055 return error_mark_node
;
6058 fntype
= build_cplus_method_type (r
, return_type
, TREE_CHAIN
6061 fntype
= build_qualified_type (fntype
, TYPE_QUALS (t
));
6062 fntype
= build_type_attribute_variant (fntype
, TYPE_ATTRIBUTES (t
));
6067 /* Substitute into the PARMS of a call-declarator. */
6070 tsubst_call_declarator_parms (parms
, args
, complain
, in_decl
)
6080 if (!parms
|| parms
== void_list_node
)
6083 new_parms
= tsubst_call_declarator_parms (TREE_CHAIN (parms
),
6084 args
, complain
, in_decl
);
6086 /* Figure out the type of this parameter. */
6087 type
= tsubst (TREE_VALUE (parms
), args
, complain
, in_decl
);
6089 /* Figure out the default argument as well. Note that we use
6090 tsubst_expr since the default argument is really an expression. */
6091 defarg
= tsubst_expr (TREE_PURPOSE (parms
), args
, complain
, in_decl
);
6093 /* Chain this parameter on to the front of those we have already
6094 processed. We don't use hash_tree_cons because that function
6095 doesn't check TREE_PARMLIST. */
6096 new_parms
= tree_cons (defarg
, type
, new_parms
);
6098 /* And note that these are parameters. */
6099 TREE_PARMLIST (new_parms
) = 1;
6104 /* Take the tree structure T and replace template parameters used
6105 therein with the argument vector ARGS. IN_DECL is an associated
6106 decl for diagnostics. If an error occurs, returns ERROR_MARK_NODE.
6107 An appropriate error message is issued only if COMPLAIN is
6108 non-zero. Note that we must be relatively non-tolerant of
6109 extensions here, in order to preserve conformance; if we allow
6110 substitutions that should not be allowed, we may allow argument
6111 deductions that should not succeed, and therefore report ambiguous
6112 overload situations where there are none. In theory, we could
6113 allow the substitution, but indicate that it should have failed,
6114 and allow our caller to make sure that the right thing happens, but
6115 we don't try to do this yet.
6117 This function is used for dealing with types, decls and the like;
6118 for expressions, use tsubst_expr or tsubst_copy. */
6121 tsubst (t
, args
, complain
, in_decl
)
6128 if (t
== NULL_TREE
|| t
== error_mark_node
6129 || t
== integer_type_node
6130 || t
== void_type_node
6131 || t
== char_type_node
6132 || TREE_CODE (t
) == NAMESPACE_DECL
)
6135 if (TREE_CODE (t
) == IDENTIFIER_NODE
)
6136 type
= IDENTIFIER_TYPE_VALUE (t
);
6138 type
= TREE_TYPE (t
);
6139 if (type
== unknown_type_node
)
6140 my_friendly_abort (42);
6142 if (type
&& TREE_CODE (t
) != FUNCTION_DECL
6143 && TREE_CODE (t
) != TYPENAME_TYPE
6144 && TREE_CODE (t
) != TEMPLATE_DECL
6145 && TREE_CODE (t
) != IDENTIFIER_NODE
6146 && TREE_CODE (t
) != FUNCTION_TYPE
6147 && TREE_CODE (t
) != METHOD_TYPE
)
6148 type
= tsubst (type
, args
, complain
, in_decl
);
6149 if (type
== error_mark_node
)
6150 return error_mark_node
;
6153 return tsubst_decl (t
, args
, type
, in_decl
);
6155 switch (TREE_CODE (t
))
6160 return tsubst_aggr_type (t
, args
, complain
, in_decl
,
6161 /*entering_scope=*/0);
6164 case IDENTIFIER_NODE
:
6177 if (t
== integer_type_node
)
6180 if (TREE_CODE (TYPE_MIN_VALUE (t
)) == INTEGER_CST
6181 && TREE_CODE (TYPE_MAX_VALUE (t
)) == INTEGER_CST
)
6185 tree max
, omax
= TREE_OPERAND (TYPE_MAX_VALUE (t
), 0);
6187 max
= tsubst_expr (omax
, args
, complain
, in_decl
);
6188 if (max
== error_mark_node
)
6189 return error_mark_node
;
6191 /* See if we can reduce this expression to something simpler. */
6192 max
= maybe_fold_nontype_arg (max
);
6193 if (!processing_template_decl
)
6194 max
= decl_constant_value (max
);
6196 if (processing_template_decl
6197 /* When providing explicit arguments to a template
6198 function, but leaving some arguments for subsequent
6199 deduction, MAX may be template-dependent even if we're
6200 not PROCESSING_TEMPLATE_DECL. We still need to check for
6201 template parms, though; MAX won't be an INTEGER_CST for
6202 dynamic arrays, either. */
6203 || (TREE_CODE (max
) != INTEGER_CST
6204 && uses_template_parms (max
)))
6206 tree itype
= make_node (INTEGER_TYPE
);
6207 TYPE_MIN_VALUE (itype
) = size_zero_node
;
6208 TYPE_MAX_VALUE (itype
) = build_min (MINUS_EXPR
, sizetype
, max
,
6213 if (integer_zerop (omax
))
6215 /* Still allow an explicit array of size zero. */
6217 pedwarn ("creating array with size zero");
6219 else if (integer_zerop (max
)
6220 || (TREE_CODE (max
) == INTEGER_CST
6221 && INT_CST_LT (max
, integer_zero_node
)))
6225 Type deduction may fail for any of the following
6228 Attempting to create an array with a size that is
6229 zero or negative. */
6231 cp_error ("creating array with size zero (`%E')", max
);
6233 return error_mark_node
;
6236 return compute_array_index_type (NULL_TREE
, max
);
6239 case TEMPLATE_TYPE_PARM
:
6240 case TEMPLATE_TEMPLATE_PARM
:
6241 case BOUND_TEMPLATE_TEMPLATE_PARM
:
6242 case TEMPLATE_PARM_INDEX
:
6250 if (TREE_CODE (t
) == TEMPLATE_TYPE_PARM
6251 || TREE_CODE (t
) == TEMPLATE_TEMPLATE_PARM
6252 || TREE_CODE (t
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
6254 idx
= TEMPLATE_TYPE_IDX (t
);
6255 level
= TEMPLATE_TYPE_LEVEL (t
);
6259 idx
= TEMPLATE_PARM_IDX (t
);
6260 level
= TEMPLATE_PARM_LEVEL (t
);
6263 if (TREE_VEC_LENGTH (args
) > 0)
6265 tree arg
= NULL_TREE
;
6267 levels
= TMPL_ARGS_DEPTH (args
);
6268 if (level
<= levels
)
6269 arg
= TMPL_ARG (args
, level
, idx
);
6271 if (arg
== error_mark_node
)
6272 return error_mark_node
;
6273 else if (arg
!= NULL_TREE
)
6275 if (TREE_CODE (t
) == TEMPLATE_TYPE_PARM
)
6277 my_friendly_assert (TYPE_P (arg
), 0);
6278 return cp_build_qualified_type_real
6279 (arg
, CP_TYPE_QUALS (arg
) | CP_TYPE_QUALS (t
),
6282 else if (TREE_CODE (t
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
6284 /* We are processing a type constructed from
6285 a template template parameter */
6286 tree argvec
= tsubst (TYPE_TI_ARGS (t
),
6287 args
, complain
, in_decl
);
6288 if (argvec
== error_mark_node
)
6289 return error_mark_node
;
6291 /* We can get a TEMPLATE_TEMPLATE_PARM here when
6292 we are resolving nested-types in the signature of
6293 a member function templates.
6294 Otherwise ARG is a TEMPLATE_DECL and is the real
6295 template to be instantiated. */
6296 if (TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
)
6297 arg
= TYPE_NAME (arg
);
6299 r
= lookup_template_class (arg
,
6302 /*entering_scope=*/0);
6303 return cp_build_qualified_type_real (r
,
6308 /* TEMPLATE_TEMPLATE_PARM or TEMPLATE_PARM_INDEX. */
6313 my_friendly_abort (981018);
6316 /* This can happen during the attempted tsubst'ing in
6317 unify. This means that we don't yet have any information
6318 about the template parameter in question. */
6321 /* If we get here, we must have been looking at a parm for a
6322 more deeply nested template. Make a new version of this
6323 template parameter, but with a lower level. */
6324 switch (TREE_CODE (t
))
6326 case TEMPLATE_TYPE_PARM
:
6327 case TEMPLATE_TEMPLATE_PARM
:
6328 case BOUND_TEMPLATE_TEMPLATE_PARM
:
6329 if (CP_TYPE_QUALS (t
))
6331 r
= tsubst (TYPE_MAIN_VARIANT (t
), args
, complain
, in_decl
);
6332 r
= cp_build_qualified_type_real (r
, CP_TYPE_QUALS (t
),
6338 TEMPLATE_TYPE_PARM_INDEX (r
)
6339 = reduce_template_parm_level (TEMPLATE_TYPE_PARM_INDEX (t
),
6341 TYPE_STUB_DECL (r
) = TYPE_NAME (r
) = TEMPLATE_TYPE_DECL (r
);
6342 TYPE_MAIN_VARIANT (r
) = r
;
6343 TYPE_POINTER_TO (r
) = NULL_TREE
;
6344 TYPE_REFERENCE_TO (r
) = NULL_TREE
;
6346 if (TREE_CODE (t
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
6348 tree argvec
= tsubst (TYPE_TI_ARGS (t
), args
,
6350 if (argvec
== error_mark_node
)
6351 return error_mark_node
;
6353 TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (r
)
6354 = tree_cons (TYPE_TI_TEMPLATE (t
), argvec
, NULL_TREE
);
6359 case TEMPLATE_PARM_INDEX
:
6360 r
= reduce_template_parm_level (t
, type
, levels
);
6364 my_friendly_abort (0);
6372 tree purpose
, value
, chain
, result
;
6374 if (t
== void_list_node
)
6377 purpose
= TREE_PURPOSE (t
);
6380 purpose
= tsubst (purpose
, args
, complain
, in_decl
);
6381 if (purpose
== error_mark_node
)
6382 return error_mark_node
;
6384 value
= TREE_VALUE (t
);
6387 value
= tsubst (value
, args
, complain
, in_decl
);
6388 if (value
== error_mark_node
)
6389 return error_mark_node
;
6391 chain
= TREE_CHAIN (t
);
6392 if (chain
&& chain
!= void_type_node
)
6394 chain
= tsubst (chain
, args
, complain
, in_decl
);
6395 if (chain
== error_mark_node
)
6396 return error_mark_node
;
6398 if (purpose
== TREE_PURPOSE (t
)
6399 && value
== TREE_VALUE (t
)
6400 && chain
== TREE_CHAIN (t
))
6402 result
= hash_tree_cons (purpose
, value
, chain
);
6403 TREE_PARMLIST (result
) = TREE_PARMLIST (t
);
6407 if (type
!= NULL_TREE
)
6409 /* A binfo node. We always need to make a copy, of the node
6410 itself and of its BINFO_BASETYPES. */
6414 /* Make sure type isn't a typedef copy. */
6415 type
= BINFO_TYPE (TYPE_BINFO (type
));
6417 TREE_TYPE (t
) = complete_type (type
);
6418 if (IS_AGGR_TYPE (type
))
6420 BINFO_VTABLE (t
) = TYPE_BINFO_VTABLE (type
);
6421 BINFO_VIRTUALS (t
) = TYPE_BINFO_VIRTUALS (type
);
6422 if (TYPE_BINFO_BASETYPES (type
) != NULL_TREE
)
6423 BINFO_BASETYPES (t
) = copy_node (TYPE_BINFO_BASETYPES (type
));
6428 /* Otherwise, a vector of template arguments. */
6429 return tsubst_template_arg_vector (t
, args
, complain
);
6432 case REFERENCE_TYPE
:
6434 enum tree_code code
;
6436 if (type
== TREE_TYPE (t
))
6439 code
= TREE_CODE (t
);
6444 Type deduction may fail for any of the following
6447 -- Attempting to create a pointer to reference type.
6448 -- Attempting to create a reference to a reference type or
6449 a reference to void. */
6450 if (TREE_CODE (type
) == REFERENCE_TYPE
6451 || (code
== REFERENCE_TYPE
&& TREE_CODE (type
) == VOID_TYPE
))
6453 static int last_line
= 0;
6454 static const char* last_file
= 0;
6456 /* We keep track of the last time we issued this error
6457 message to avoid spewing a ton of messages during a
6458 single bad template instantiation. */
6459 if (complain
&& (last_line
!= lineno
||
6460 last_file
!= input_filename
))
6462 if (TREE_CODE (type
) == VOID_TYPE
)
6463 cp_error ("forming reference to void");
6465 cp_error ("forming %s to reference type `%T'",
6466 (code
== POINTER_TYPE
) ? "pointer" : "reference",
6469 last_file
= input_filename
;
6472 return error_mark_node
;
6474 else if (code
== POINTER_TYPE
)
6475 r
= build_pointer_type (type
);
6477 r
= build_reference_type (type
);
6478 r
= cp_build_qualified_type_real (r
, TYPE_QUALS (t
), complain
);
6480 if (r
!= error_mark_node
)
6481 /* Will this ever be needed for TYPE_..._TO values? */
6488 r
= tsubst (TYPE_OFFSET_BASETYPE (t
), args
, complain
, in_decl
);
6489 if (r
== error_mark_node
|| !IS_AGGR_TYPE (r
))
6493 Type deduction may fail for any of the following
6496 -- Attempting to create "pointer to member of T" when T
6497 is not a class type. */
6499 cp_error ("creating pointer to member of non-class type `%T'",
6501 return error_mark_node
;
6503 return build_offset_type (r
, type
);
6511 fntype
= tsubst_function_type (t
, args
, complain
, in_decl
);
6512 if (fntype
== error_mark_node
)
6513 return error_mark_node
;
6515 /* Substitue the exception specification. */
6516 raises
= TYPE_RAISES_EXCEPTIONS (t
);
6519 tree list
= NULL_TREE
;
6521 if (! TREE_VALUE (raises
))
6524 for (; raises
!= NULL_TREE
; raises
= TREE_CHAIN (raises
))
6526 tree spec
= TREE_VALUE (raises
);
6528 spec
= tsubst (spec
, args
, complain
, in_decl
);
6529 if (spec
== error_mark_node
)
6531 list
= add_exception_specifier (list
, spec
, complain
);
6533 fntype
= build_exception_variant (fntype
, list
);
6539 tree domain
= tsubst (TYPE_DOMAIN (t
), args
, complain
, in_decl
);
6540 if (domain
== error_mark_node
)
6541 return error_mark_node
;
6543 /* As an optimization, we avoid regenerating the array type if
6544 it will obviously be the same as T. */
6545 if (type
== TREE_TYPE (t
) && domain
== TYPE_DOMAIN (t
))
6548 /* These checks should match the ones in grokdeclarator.
6552 The deduction may fail for any of the following reasons:
6554 -- Attempting to create an array with an element type that
6555 is void, a function type, or a reference type. */
6556 if (TREE_CODE (type
) == VOID_TYPE
6557 || TREE_CODE (type
) == FUNCTION_TYPE
6558 || TREE_CODE (type
) == REFERENCE_TYPE
)
6561 cp_error ("creating array of `%T'", type
);
6562 return error_mark_node
;
6565 r
= build_cplus_array_type (type
, domain
);
6572 tree e1
= tsubst (TREE_OPERAND (t
, 0), args
, complain
,
6574 tree e2
= tsubst (TREE_OPERAND (t
, 1), args
, complain
,
6577 if (e1
== error_mark_node
|| e2
== error_mark_node
)
6578 return error_mark_node
;
6580 return fold (build (TREE_CODE (t
), TREE_TYPE (t
), e1
, e2
));
6586 tree e
= tsubst (TREE_OPERAND (t
, 0), args
, complain
,
6588 if (e
== error_mark_node
)
6589 return error_mark_node
;
6591 return fold (build (TREE_CODE (t
), TREE_TYPE (t
), e
));
6596 tree ctx
= tsubst_aggr_type (TYPE_CONTEXT (t
), args
, complain
,
6597 in_decl
, /*entering_scope=*/1);
6598 tree f
= tsubst_copy (TYPENAME_TYPE_FULLNAME (t
), args
,
6601 if (ctx
== error_mark_node
|| f
== error_mark_node
)
6602 return error_mark_node
;
6604 if (!IS_AGGR_TYPE (ctx
))
6607 cp_error ("`%T' is not a class, struct, or union type",
6609 return error_mark_node
;
6611 else if (!uses_template_parms (ctx
) && !TYPE_BEING_DEFINED (ctx
))
6613 /* Normally, make_typename_type does not require that the CTX
6614 have complete type in order to allow things like:
6616 template <class T> struct S { typename S<T>::X Y; };
6618 But, such constructs have already been resolved by this
6619 point, so here CTX really should have complete type, unless
6620 it's a partial instantiation. */
6621 ctx
= complete_type (ctx
);
6622 if (!COMPLETE_TYPE_P (ctx
))
6625 incomplete_type_error (NULL_TREE
, ctx
);
6626 return error_mark_node
;
6630 f
= make_typename_type (ctx
, f
, complain
);
6631 if (f
== error_mark_node
)
6633 return cp_build_qualified_type_real (f
,
6635 | CP_TYPE_QUALS (t
),
6641 tree e
= tsubst (TREE_OPERAND (t
, 0), args
, complain
,
6643 if (e
== error_mark_node
)
6644 return error_mark_node
;
6645 return make_pointer_declarator (type
, e
);
6650 tree e
= tsubst (TREE_OPERAND (t
, 0), args
, complain
,
6652 if (e
== error_mark_node
)
6653 return error_mark_node
;
6654 return make_reference_declarator (type
, e
);
6659 tree e1
= tsubst (TREE_OPERAND (t
, 0), args
, complain
,
6661 tree e2
= tsubst_expr (TREE_OPERAND (t
, 1), args
, complain
,
6663 if (e1
== error_mark_node
|| e2
== error_mark_node
)
6664 return error_mark_node
;
6666 return build_parse_node (ARRAY_REF
, e1
, e2
, tsubst_expr
);
6671 tree e1
= tsubst (TREE_OPERAND (t
, 0), args
, complain
,
6673 tree e2
= (tsubst_call_declarator_parms
6674 (CALL_DECLARATOR_PARMS (t
), args
, complain
, in_decl
));
6675 tree e3
= tsubst (CALL_DECLARATOR_EXCEPTION_SPEC (t
), args
,
6678 if (e1
== error_mark_node
|| e2
== error_mark_node
6679 || e3
== error_mark_node
)
6680 return error_mark_node
;
6682 return make_call_declarator (e1
, e2
, CALL_DECLARATOR_QUALS (t
), e3
);
6687 tree e1
= tsubst (TREE_OPERAND (t
, 0), args
, complain
,
6689 tree e2
= tsubst (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
6690 if (e1
== error_mark_node
|| e2
== error_mark_node
)
6691 return error_mark_node
;
6693 return build_parse_node (TREE_CODE (t
), e1
, e2
);
6698 tree e1
= tsubst_expr (TYPE_FIELDS (t
), args
, complain
,
6700 if (e1
== error_mark_node
)
6701 return error_mark_node
;
6703 return TREE_TYPE (e1
);
6713 /* This code should match declare_hidden_char_array in
6715 name
= (*decl_printable_name
) (current_function_decl
, 2);
6716 len
= strlen (name
) + 1;
6717 type
= build_array_type (char_type_node
,
6718 build_index_type (build_int_2 (len
, 0)));
6719 str
= build_string (len
, name
);
6720 TREE_TYPE (str
) = type
;
6725 sorry ("use of `%s' in template",
6726 tree_code_name
[(int) TREE_CODE (t
)]);
6727 return error_mark_node
;
6731 /* Like tsubst, but deals with expressions. This function just replaces
6732 template parms; to finish processing the resultant expression, use
6736 tsubst_copy (t
, args
, complain
, in_decl
)
6741 enum tree_code code
;
6744 if (t
== NULL_TREE
|| t
== error_mark_node
)
6747 code
= TREE_CODE (t
);
6752 return do_identifier (DECL_NAME (t
), 0, NULL_TREE
);
6759 if (!DECL_CONTEXT (t
))
6760 /* This is a global enumeration constant. */
6763 /* Unfortunately, we cannot just call lookup_name here.
6766 template <int I> int f() {
6768 struct S { void g() { E e = a; } };
6771 When we instantiate f<7>::S::g(), say, lookup_name is not
6772 clever enough to find f<7>::a. */
6774 = tsubst_aggr_type (TREE_TYPE (t
), args
, complain
, in_decl
,
6775 /*entering_scope=*/0);
6777 for (v
= TYPE_VALUES (enum_type
);
6780 if (TREE_PURPOSE (v
) == DECL_NAME (t
))
6781 return TREE_VALUE (v
);
6783 /* We didn't find the name. That should never happen; if
6784 name-lookup found it during preliminary parsing, we
6785 should find it again here during instantiation. */
6786 my_friendly_abort (0);
6791 if (DECL_CONTEXT (t
))
6795 ctx
= tsubst_aggr_type (DECL_CONTEXT (t
), args
, complain
, in_decl
,
6796 /*entering_scope=*/1);
6797 if (ctx
!= DECL_CONTEXT (t
))
6798 return lookup_field (ctx
, DECL_NAME (t
), 0, 0);
6804 if (DECL_LANG_SPECIFIC (t
) && DECL_TEMPLATE_INFO (t
))
6805 t
= tsubst (t
, args
, complain
, in_decl
);
6810 if (is_member_template (t
))
6811 return tsubst (t
, args
, complain
, in_decl
);
6817 /* We must tsbust into a LOOKUP_EXPR in case the names to
6818 which it refers is a conversion operator; in that case the
6819 name will change. We avoid making unnecessary copies,
6822 tree id
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
6824 if (id
!= TREE_OPERAND (t
, 0))
6826 r
= build_nt (LOOKUP_EXPR
, id
);
6827 LOOKUP_EXPR_GLOBAL (r
) = LOOKUP_EXPR_GLOBAL (t
);
6835 case REINTERPRET_CAST_EXPR
:
6836 case CONST_CAST_EXPR
:
6837 case STATIC_CAST_EXPR
:
6838 case DYNAMIC_CAST_EXPR
:
6841 (code
, tsubst (TREE_TYPE (t
), args
, complain
, in_decl
),
6842 tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
));
6845 case PREDECREMENT_EXPR
:
6846 case PREINCREMENT_EXPR
:
6847 case POSTDECREMENT_EXPR
:
6848 case POSTINCREMENT_EXPR
:
6850 case TRUTH_NOT_EXPR
:
6853 case CONVERT_EXPR
: /* Unary + */
6862 (code
, tsubst (TREE_TYPE (t
), args
, complain
, in_decl
),
6863 tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
));
6868 case TRUNC_DIV_EXPR
:
6870 case FLOOR_DIV_EXPR
:
6871 case ROUND_DIV_EXPR
:
6872 case EXACT_DIV_EXPR
:
6874 case BIT_ANDTC_EXPR
:
6877 case TRUNC_MOD_EXPR
:
6878 case FLOOR_MOD_EXPR
:
6879 case TRUTH_ANDIF_EXPR
:
6880 case TRUTH_ORIF_EXPR
:
6881 case TRUTH_AND_EXPR
:
6902 (code
, tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
),
6903 tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
));
6907 tree fn
= TREE_OPERAND (t
, 0);
6908 if (is_overloaded_fn (fn
))
6909 fn
= tsubst_copy (get_first_fn (fn
), args
, complain
, in_decl
);
6911 /* Sometimes FN is a LOOKUP_EXPR. */
6912 fn
= tsubst_copy (fn
, args
, complain
, in_decl
);
6914 (code
, fn
, tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
,
6919 case METHOD_CALL_EXPR
:
6921 tree name
= TREE_OPERAND (t
, 0);
6922 if (TREE_CODE (name
) == BIT_NOT_EXPR
)
6924 name
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
6926 name
= build1 (BIT_NOT_EXPR
, NULL_TREE
, name
);
6928 else if (TREE_CODE (name
) == SCOPE_REF
6929 && TREE_CODE (TREE_OPERAND (name
, 1)) == BIT_NOT_EXPR
)
6931 tree base
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
6933 name
= TREE_OPERAND (name
, 1);
6934 name
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
6936 name
= build1 (BIT_NOT_EXPR
, NULL_TREE
, name
);
6937 name
= build_nt (SCOPE_REF
, base
, name
);
6940 name
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
6942 (code
, name
, tsubst_copy (TREE_OPERAND (t
, 1), args
,
6944 tsubst_copy (TREE_OPERAND (t
, 2), args
, complain
, in_decl
),
6949 /* This processing should really occur in tsubst_expr, However,
6950 tsubst_expr does not recurse into expressions, since it
6951 assumes that there aren't any statements inside them.
6952 Instead, it simply calls build_expr_from_tree. So, we need
6953 to expand the STMT_EXPR here. */
6954 if (!processing_template_decl
)
6956 tree stmt_expr
= begin_stmt_expr ();
6957 tsubst_expr (STMT_EXPR_STMT (t
), args
,
6959 return finish_stmt_expr (stmt_expr
);
6966 case PSEUDO_DTOR_EXPR
:
6969 (code
, tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
),
6970 tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
),
6971 tsubst_copy (TREE_OPERAND (t
, 2), args
, complain
, in_decl
));
6978 (code
, tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
),
6979 tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
),
6980 tsubst_copy (TREE_OPERAND (t
, 2), args
, complain
, in_decl
));
6981 NEW_EXPR_USE_GLOBAL (r
) = NEW_EXPR_USE_GLOBAL (t
);
6988 (code
, tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
),
6989 tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
));
6990 DELETE_EXPR_USE_GLOBAL (r
) = DELETE_EXPR_USE_GLOBAL (t
);
6991 DELETE_EXPR_USE_VEC (r
) = DELETE_EXPR_USE_VEC (t
);
6995 case TEMPLATE_ID_EXPR
:
6997 /* Substituted template arguments */
6998 tree targs
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
,
7001 if (targs
&& TREE_CODE (targs
) == TREE_LIST
)
7004 for (chain
= targs
; chain
; chain
= TREE_CHAIN (chain
))
7005 TREE_VALUE (chain
) = maybe_fold_nontype_arg (TREE_VALUE (chain
));
7010 for (i
= 0; i
< TREE_VEC_LENGTH (targs
); ++i
)
7011 TREE_VEC_ELT (targs
, i
)
7012 = maybe_fold_nontype_arg (TREE_VEC_ELT (targs
, i
));
7015 return lookup_template_function
7016 (tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
), targs
);
7021 tree purpose
, value
, chain
;
7023 if (t
== void_list_node
)
7026 purpose
= TREE_PURPOSE (t
);
7028 purpose
= tsubst_copy (purpose
, args
, complain
, in_decl
);
7029 value
= TREE_VALUE (t
);
7031 value
= tsubst_copy (value
, args
, complain
, in_decl
);
7032 chain
= TREE_CHAIN (t
);
7033 if (chain
&& chain
!= void_type_node
)
7034 chain
= tsubst_copy (chain
, args
, complain
, in_decl
);
7035 if (purpose
== TREE_PURPOSE (t
)
7036 && value
== TREE_VALUE (t
)
7037 && chain
== TREE_CHAIN (t
))
7039 return tree_cons (purpose
, value
, chain
);
7046 case TEMPLATE_TYPE_PARM
:
7047 case TEMPLATE_TEMPLATE_PARM
:
7048 case BOUND_TEMPLATE_TEMPLATE_PARM
:
7049 case TEMPLATE_PARM_INDEX
:
7051 case REFERENCE_TYPE
:
7058 return tsubst (t
, args
, complain
, in_decl
);
7060 case IDENTIFIER_NODE
:
7061 if (IDENTIFIER_TYPENAME_P (t
))
7063 tree new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
7065 return mangle_conv_op_name_for_type (new_type
);
7067 return (build_typename_overload (new_type
));
7075 (CONSTRUCTOR
, tsubst (TREE_TYPE (t
), args
, complain
, in_decl
),
7076 NULL_TREE
, tsubst_copy (CONSTRUCTOR_ELTS (t
), args
,
7077 complain
, in_decl
));
7078 TREE_HAS_CONSTRUCTOR (r
) = TREE_HAS_CONSTRUCTOR (t
);
7083 return build_x_va_arg (tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
,
7085 tsubst (TREE_TYPE (t
), args
, complain
, in_decl
));
7088 return tsubst (t
, args
, complain
, in_decl
);
7095 /* Like tsubst_copy, but also does semantic processing. */
7098 tsubst_expr (t
, args
, complain
, in_decl
)
7105 if (t
== NULL_TREE
|| t
== error_mark_node
)
7108 if (processing_template_decl
)
7109 return tsubst_copy (t
, args
, complain
, in_decl
);
7111 switch (TREE_CODE (t
))
7115 finish_named_return_value
7116 (TREE_OPERAND (t
, 0),
7117 tsubst_expr (TREE_OPERAND (t
, 1), args
, /*complain=*/1, in_decl
));
7118 tsubst_expr (TREE_CHAIN (t
), args
, complain
, in_decl
);
7121 case CTOR_INITIALIZER
:
7123 tree member_init_list
;
7124 tree base_init_list
;
7128 = tsubst_initializer_list (TREE_OPERAND (t
, 0), args
);
7130 = tsubst_initializer_list (TREE_OPERAND (t
, 1), args
);
7131 setup_vtbl_ptr (member_init_list
, base_init_list
);
7132 tsubst_expr (TREE_CHAIN (t
), args
, complain
, in_decl
);
7138 finish_return_stmt (tsubst_expr (RETURN_EXPR (t
),
7139 args
, complain
, in_decl
));
7144 finish_expr_stmt (tsubst_expr (EXPR_STMT_EXPR (t
),
7145 args
, complain
, in_decl
));
7154 decl
= DECL_STMT_DECL (t
);
7155 if (TREE_CODE (decl
) == LABEL_DECL
)
7156 finish_label_decl (DECL_NAME (decl
));
7159 init
= DECL_INITIAL (decl
);
7160 decl
= tsubst (decl
, args
, complain
, in_decl
);
7161 init
= tsubst_expr (init
, args
, complain
, in_decl
);
7162 if (decl
!= error_mark_node
)
7164 if (TREE_CODE (decl
) != TYPE_DECL
)
7165 /* Make sure the type is instantiated now. */
7166 complete_type (TREE_TYPE (decl
));
7168 DECL_INITIAL (decl
) = error_mark_node
;
7169 /* By marking the declaration as instantiated, we avoid
7170 trying to instantiate it. Since instantiate_decl can't
7171 handle local variables, and since we've already done
7172 all that needs to be done, that's the right thing to
7174 if (TREE_CODE (decl
) == VAR_DECL
)
7175 DECL_TEMPLATE_INSTANTIATED (decl
) = 1;
7176 maybe_push_decl (decl
);
7177 cp_finish_decl (decl
, init
, NULL_TREE
, 0);
7188 stmt
= begin_for_stmt ();
7189 for (tmp
= FOR_INIT_STMT (t
); tmp
; tmp
= TREE_CHAIN (tmp
))
7190 tsubst_expr (tmp
, args
, complain
, in_decl
);
7191 finish_for_init_stmt (stmt
);
7192 finish_for_cond (tsubst_expr (FOR_COND (t
), args
,
7195 tmp
= tsubst_expr (FOR_EXPR (t
), args
, complain
, in_decl
);
7196 finish_for_expr (tmp
, stmt
);
7197 tsubst_expr (FOR_BODY (t
), args
, complain
, in_decl
);
7198 finish_for_stmt (stmt
);
7205 stmt
= begin_while_stmt ();
7206 finish_while_stmt_cond (tsubst_expr (WHILE_COND (t
),
7207 args
, complain
, in_decl
),
7209 tsubst_expr (WHILE_BODY (t
), args
, complain
, in_decl
);
7210 finish_while_stmt (stmt
);
7217 stmt
= begin_do_stmt ();
7218 tsubst_expr (DO_BODY (t
), args
, complain
, in_decl
);
7219 finish_do_body (stmt
);
7220 finish_do_stmt (tsubst_expr (DO_COND (t
), args
,
7231 stmt
= begin_if_stmt ();
7232 finish_if_stmt_cond (tsubst_expr (IF_COND (t
),
7233 args
, complain
, in_decl
),
7236 if (tmp
= THEN_CLAUSE (t
), tmp
)
7238 tsubst_expr (tmp
, args
, complain
, in_decl
);
7239 finish_then_clause (stmt
);
7242 if (tmp
= ELSE_CLAUSE (t
), tmp
)
7244 begin_else_clause ();
7245 tsubst_expr (tmp
, args
, complain
, in_decl
);
7246 finish_else_clause (stmt
);
7258 stmt
= begin_compound_stmt (COMPOUND_STMT_NO_SCOPE (t
));
7259 for (substmt
= COMPOUND_BODY (t
);
7260 substmt
!= NULL_TREE
;
7261 substmt
= TREE_CHAIN (substmt
))
7262 tsubst_expr (substmt
, args
, complain
, in_decl
);
7263 return finish_compound_stmt (COMPOUND_STMT_NO_SCOPE (t
), stmt
);
7269 finish_break_stmt ();
7274 finish_continue_stmt ();
7282 stmt
= begin_switch_stmt ();
7283 val
= tsubst_expr (SWITCH_COND (t
), args
, complain
, in_decl
);
7284 finish_switch_cond (val
, stmt
);
7285 tsubst_expr (SWITCH_BODY (t
), args
, complain
, in_decl
);
7286 finish_switch_stmt (stmt
);
7292 finish_case_label (tsubst_expr (CASE_LOW (t
), args
, complain
, in_decl
),
7293 tsubst_expr (CASE_HIGH (t
), args
, complain
,
7298 lineno
= STMT_LINENO (t
);
7299 finish_label_stmt (DECL_NAME (LABEL_STMT_LABEL (t
)));
7304 t
= GOTO_DESTINATION (t
);
7305 if (TREE_CODE (t
) != LABEL_DECL
)
7306 /* Computed goto's must be tsubst'd into. On the other hand,
7307 non-computed gotos must not be; the identifier in question
7308 will have no binding. */
7309 t
= tsubst_expr (t
, args
, complain
, in_decl
);
7312 finish_goto_stmt (t
);
7317 finish_asm_stmt (ASM_CV_QUAL (t
),
7318 tsubst_expr (ASM_STRING (t
), args
, complain
, in_decl
),
7319 tsubst_expr (ASM_OUTPUTS (t
), args
, complain
, in_decl
),
7320 tsubst_expr (ASM_INPUTS (t
), args
, complain
, in_decl
),
7321 tsubst_expr (ASM_CLOBBERS (t
), args
, complain
,
7329 stmt
= begin_try_block ();
7330 tsubst_expr (TRY_STMTS (t
), args
, complain
, in_decl
);
7331 finish_cleanup_try_block (stmt
);
7332 finish_cleanup (tsubst_expr (TRY_HANDLERS (t
), args
,
7340 if (FN_TRY_BLOCK_P (t
))
7341 stmt
= begin_function_try_block ();
7343 stmt
= begin_try_block ();
7345 tsubst_expr (TRY_STMTS (t
), args
, complain
, in_decl
);
7347 if (FN_TRY_BLOCK_P (t
))
7348 finish_function_try_block (stmt
);
7350 finish_try_block (stmt
);
7352 handler
= TRY_HANDLERS (t
);
7353 for (; handler
; handler
= TREE_CHAIN (handler
))
7354 tsubst_expr (handler
, args
, complain
, in_decl
);
7355 if (FN_TRY_BLOCK_P (t
))
7356 finish_function_handler_sequence (stmt
);
7358 finish_handler_sequence (stmt
);
7368 stmt
= begin_handler ();
7369 if (HANDLER_PARMS (t
))
7371 decl
= DECL_STMT_DECL (HANDLER_PARMS (t
));
7372 decl
= tsubst (decl
, args
, complain
, in_decl
);
7373 /* Prevent instantiate_decl from trying to instantiate
7374 this variable. We've already done all that needs to be
7376 DECL_TEMPLATE_INSTANTIATED (decl
) = 1;
7380 blocks
= finish_handler_parms (decl
, stmt
);
7381 tsubst_expr (HANDLER_BODY (t
), args
, complain
, in_decl
);
7382 finish_handler (blocks
, stmt
);
7389 tsubst (t
, args
, complain
, NULL_TREE
);
7393 return build_expr_from_tree (tsubst_copy (t
, args
, complain
, in_decl
));
7398 /* TMPL is a TEMPLATE_DECL for a cloned constructor or destructor.
7399 Instantiate it with the ARGS. */
7402 instantiate_clone (tmpl
, args
)
7409 /* Instantiated the cloned function, rather than the clone. */
7410 spec
= instantiate_template (DECL_CLONED_FUNCTION (tmpl
), args
);
7412 /* Then, see if we've already cloned the instantiation. */
7413 for (clone
= TREE_CHAIN (spec
);
7414 clone
&& DECL_CLONED_FUNCTION_P (clone
);
7415 clone
= TREE_CHAIN (clone
))
7416 if (DECL_NAME (clone
) == DECL_NAME (tmpl
))
7419 /* If we haven't, do so know. */
7421 clone_function_decl (spec
, /*update_method_vec_p=*/0);
7424 for (clone
= TREE_CHAIN (spec
);
7425 clone
&& DECL_CLONED_FUNCTION_P (clone
);
7426 clone
= TREE_CHAIN (clone
))
7427 if (DECL_NAME (clone
) == DECL_NAME (tmpl
))
7430 /* We should always have found the clone by now. */
7431 my_friendly_abort (20000411);
7435 /* Instantiate the indicated variable or function template TMPL with
7436 the template arguments in TARG_PTR. */
7439 instantiate_template (tmpl
, targ_ptr
)
7440 tree tmpl
, targ_ptr
;
7449 if (tmpl
== error_mark_node
)
7450 return error_mark_node
;
7452 my_friendly_assert (TREE_CODE (tmpl
) == TEMPLATE_DECL
, 283);
7454 /* If this function is a clone, handle it specially. */
7455 if (DECL_CLONED_FUNCTION_P (tmpl
))
7456 return instantiate_clone (tmpl
, targ_ptr
);
7458 /* Check to see if we already have this specialization. */
7459 spec
= retrieve_specialization (tmpl
, targ_ptr
);
7460 if (spec
!= NULL_TREE
)
7463 gen_tmpl
= most_general_template (tmpl
);
7464 if (tmpl
!= gen_tmpl
)
7466 /* The TMPL is a partial instantiation. To get a full set of
7467 arguments we must add the arguments used to perform the
7468 partial instantiation. */
7469 targ_ptr
= add_outermost_template_args (DECL_TI_ARGS (tmpl
),
7472 /* Check to see if we already have this specialization. */
7473 spec
= retrieve_specialization (gen_tmpl
, targ_ptr
);
7474 if (spec
!= NULL_TREE
)
7478 len
= DECL_NTPARMS (gen_tmpl
);
7479 inner_args
= INNERMOST_TEMPLATE_ARGS (targ_ptr
);
7483 tree t
= TREE_VEC_ELT (inner_args
, i
);
7486 tree nt
= target_type (t
);
7487 if (IS_AGGR_TYPE (nt
) && decl_function_context (TYPE_MAIN_DECL (nt
)))
7489 cp_error ("type `%T' composed from a local class is not a valid template-argument", t
);
7490 cp_error (" trying to instantiate `%D'", gen_tmpl
);
7491 return error_mark_node
;
7496 /* substitute template parameters */
7497 fndecl
= tsubst (DECL_TEMPLATE_RESULT (gen_tmpl
),
7498 targ_ptr
, /*complain=*/1, gen_tmpl
);
7499 /* The DECL_TI_TEMPLATE should always be the immediate parent
7500 template, not the most general template. */
7501 DECL_TI_TEMPLATE (fndecl
) = tmpl
;
7503 if (flag_external_templates
)
7504 add_pending_template (fndecl
);
7506 /* If we've just instantiated the main entry point for a function,
7507 instantiate all the alternate entry points as well. */
7508 for (clone
= TREE_CHAIN (gen_tmpl
);
7509 clone
&& DECL_CLONED_FUNCTION_P (clone
);
7510 clone
= TREE_CHAIN (clone
))
7511 instantiate_template (clone
, targ_ptr
);
7516 /* Push the name of the class template into the scope of the instantiation. */
7519 overload_template_name (type
)
7522 tree id
= DECL_NAME (CLASSTYPE_TI_TEMPLATE (type
));
7525 if (IDENTIFIER_CLASS_VALUE (id
)
7526 && TREE_TYPE (IDENTIFIER_CLASS_VALUE (id
)) == type
)
7529 decl
= build_decl (TYPE_DECL
, id
, type
);
7530 DECL_ARTIFICIAL (decl
) = 1;
7531 pushdecl_class_level (decl
);
7534 /* The FN is a TEMPLATE_DECL for a function. The ARGS are the
7535 arguments that are being used when calling it. TARGS is a vector
7536 into which the deduced template arguments are placed.
7538 Return zero for success, 2 for an incomplete match that doesn't resolve
7539 all the types, and 1 for complete failure. An error message will be
7540 printed only for an incomplete match.
7542 If FN is a conversion operator, RETURN_TYPE is the type desired as
7543 the result of the conversion operator.
7545 TPARMS is a vector of template parameters.
7547 The EXPLICIT_TARGS are explicit template arguments provided via a
7550 The parameter STRICT is one of:
7553 We are deducing arguments for a function call, as in
7557 We are deducing arguments for a conversion function, as in
7561 We are deducing arguments when calculating the partial
7562 ordering between specializations of function or class
7563 templates, as in [temp.func.order] and [temp.class.order],
7564 when doing an explicit instantiation as in [temp.explicit],
7565 when determining an explicit specialization as in
7566 [temp.expl.spec], or when taking the address of a function
7567 template, as in [temp.deduct.funcaddr].
7569 The other arguments are as for type_unification. */
7572 fn_type_unification (fn
, explicit_targs
, targs
, args
, return_type
,
7574 tree fn
, explicit_targs
, targs
, args
, return_type
;
7575 unification_kind_t strict
;
7581 my_friendly_assert (TREE_CODE (fn
) == TEMPLATE_DECL
, 0);
7583 fntype
= TREE_TYPE (fn
);
7588 The specified template arguments must match the template
7589 parameters in kind (i.e., type, nontype, template), and there
7590 must not be more arguments than there are parameters;
7591 otherwise type deduction fails.
7593 Nontype arguments must match the types of the corresponding
7594 nontype template parameters, or must be convertible to the
7595 types of the corresponding nontype parameters as specified in
7596 _temp.arg.nontype_, otherwise type deduction fails.
7598 All references in the function type of the function template
7599 to the corresponding template parameters are replaced by the
7600 specified template argument values. If a substitution in a
7601 template parameter or in the function type of the function
7602 template results in an invalid type, type deduction fails. */
7604 tree converted_args
;
7607 = (coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (fn
),
7608 explicit_targs
, NULL_TREE
, /*complain=*/0,
7609 /*require_all_arguments=*/0));
7610 if (converted_args
== error_mark_node
)
7613 fntype
= tsubst (fntype
, converted_args
, /*complain=*/0, NULL_TREE
);
7614 if (fntype
== error_mark_node
)
7617 /* Place the explicitly specified arguments in TARGS. */
7618 for (i
= 0; i
< TREE_VEC_LENGTH (targs
); i
++)
7619 TREE_VEC_ELT (targs
, i
) = TREE_VEC_ELT (converted_args
, i
);
7622 parms
= TYPE_ARG_TYPES (fntype
);
7624 if (DECL_CONV_FN_P (fn
))
7626 /* This is a template conversion operator. Remove `this', since
7627 we could be comparing conversions from different classes. */
7628 parms
= TREE_CHAIN (parms
);
7629 args
= TREE_CHAIN (args
);
7630 my_friendly_assert (return_type
!= NULL_TREE
, 20000227);
7635 /* We've been given a return type to match, prepend it. */
7636 parms
= tree_cons (NULL_TREE
, TREE_TYPE (fntype
), parms
);
7637 args
= tree_cons (NULL_TREE
, return_type
, args
);
7640 /* We allow incomplete unification without an error message here
7641 because the standard doesn't seem to explicitly prohibit it. Our
7642 callers must be ready to deal with unification failures in any
7644 result
= type_unification_real (DECL_INNERMOST_TEMPLATE_PARMS (fn
),
7645 targs
, parms
, args
, /*subr=*/0,
7646 strict
, /*allow_incomplete*/1);
7649 /* All is well so far. Now, check:
7653 When all template arguments have been deduced, all uses of
7654 template parameters in nondeduced contexts are replaced with
7655 the corresponding deduced argument values. If the
7656 substitution results in an invalid type, as described above,
7657 type deduction fails. */
7658 if (tsubst (TREE_TYPE (fn
), targs
, /*complain=*/0, NULL_TREE
)
7665 /* Adjust types before performing type deduction, as described in
7666 [temp.deduct.call] and [temp.deduct.conv]. The rules in these two
7667 sections are symmetric. PARM is the type of a function parameter
7668 or the return type of the conversion function. ARG is the type of
7669 the argument passed to the call, or the type of the value
7670 initialized with the result of the conversion function. */
7673 maybe_adjust_types_for_deduction (strict
, parm
, arg
)
7674 unification_kind_t strict
;
7685 /* Swap PARM and ARG throughout the remainder of this
7686 function; the handling is precisely symmetric since PARM
7687 will initialize ARG rather than vice versa. */
7695 /* There is nothing to do in this case. */
7699 my_friendly_abort (0);
7702 if (TREE_CODE (*parm
) != REFERENCE_TYPE
)
7704 /* [temp.deduct.call]
7706 If P is not a reference type:
7708 --If A is an array type, the pointer type produced by the
7709 array-to-pointer standard conversion (_conv.array_) is
7710 used in place of A for type deduction; otherwise,
7712 --If A is a function type, the pointer type produced by
7713 the function-to-pointer standard conversion
7714 (_conv.func_) is used in place of A for type deduction;
7717 --If A is a cv-qualified type, the top level
7718 cv-qualifiers of A's type are ignored for type
7720 if (TREE_CODE (*arg
) == ARRAY_TYPE
)
7721 *arg
= build_pointer_type (TREE_TYPE (*arg
));
7722 else if (TREE_CODE (*arg
) == FUNCTION_TYPE
)
7723 *arg
= build_pointer_type (*arg
);
7725 *arg
= TYPE_MAIN_VARIANT (*arg
);
7728 /* [temp.deduct.call]
7730 If P is a cv-qualified type, the top level cv-qualifiers
7731 of P's type are ignored for type deduction. If P is a
7732 reference type, the type referred to by P is used for
7734 *parm
= TYPE_MAIN_VARIANT (*parm
);
7735 if (TREE_CODE (*parm
) == REFERENCE_TYPE
)
7736 *parm
= TREE_TYPE (*parm
);
7739 /* Like type_unification.
7741 If SUBR is 1, we're being called recursively (to unify the
7742 arguments of a function or method parameter of a function
7746 type_unification_real (tparms
, targs
, parms
, args
, subr
,
7747 strict
, allow_incomplete
)
7748 tree tparms
, targs
, parms
, args
;
7750 unification_kind_t strict
;
7751 int allow_incomplete
;
7755 int ntparms
= TREE_VEC_LENGTH (tparms
);
7758 my_friendly_assert (TREE_CODE (tparms
) == TREE_VEC
, 289);
7759 my_friendly_assert (parms
== NULL_TREE
7760 || TREE_CODE (parms
) == TREE_LIST
, 290);
7761 /* ARGS could be NULL (via a call from parse.y to
7762 build_x_function_call). */
7764 my_friendly_assert (TREE_CODE (args
) == TREE_LIST
, 291);
7765 my_friendly_assert (ntparms
> 0, 292);
7770 sub_strict
= UNIFY_ALLOW_MORE_CV_QUAL
| UNIFY_ALLOW_DERIVED
;
7774 sub_strict
= UNIFY_ALLOW_LESS_CV_QUAL
;
7778 sub_strict
= UNIFY_ALLOW_NONE
;
7782 my_friendly_abort (0);
7786 && parms
!= void_list_node
7788 && args
!= void_list_node
)
7790 parm
= TREE_VALUE (parms
);
7791 parms
= TREE_CHAIN (parms
);
7792 arg
= TREE_VALUE (args
);
7793 args
= TREE_CHAIN (args
);
7795 if (arg
== error_mark_node
)
7797 if (arg
== unknown_type_node
)
7798 /* We can't deduce anything from this, but we might get all the
7799 template args from other function args. */
7802 /* Conversions will be performed on a function argument that
7803 corresponds with a function parameter that contains only
7804 non-deducible template parameters and explicitly specified
7805 template parameters. */
7806 if (! uses_template_parms (parm
))
7811 type
= TREE_TYPE (arg
);
7818 if (strict
== DEDUCE_EXACT
)
7820 if (same_type_p (parm
, type
))
7824 /* It might work; we shouldn't check now, because we might
7825 get into infinite recursion. Overload resolution will
7834 my_friendly_assert (TREE_TYPE (arg
) != NULL_TREE
, 293);
7835 if (type_unknown_p (arg
))
7837 /* [temp.deduct.type] A template-argument can be deduced from
7838 a pointer to function or pointer to member function
7839 argument if the set of overloaded functions does not
7840 contain function templates and at most one of a set of
7841 overloaded functions provides a unique match. */
7843 if (resolve_overloaded_unification
7844 (tparms
, targs
, parm
, arg
, strict
, sub_strict
)
7849 arg
= TREE_TYPE (arg
);
7853 maybe_adjust_types_for_deduction (strict
, &parm
, &arg
);
7855 if (unify (tparms
, targs
, parm
, arg
, sub_strict
))
7858 /* Fail if we've reached the end of the parm list, and more args
7859 are present, and the parm list isn't variadic. */
7860 if (args
&& args
!= void_list_node
&& parms
== void_list_node
)
7862 /* Fail if parms are left and they don't have default values. */
7864 && parms
!= void_list_node
7865 && TREE_PURPOSE (parms
) == NULL_TREE
)
7868 for (i
= 0; i
< ntparms
; i
++)
7869 if (TREE_VEC_ELT (targs
, i
) == NULL_TREE
)
7871 if (!allow_incomplete
)
7872 error ("incomplete type unification");
7878 /* Subroutine of type_unification_real. Args are like the variables at the
7879 call site. ARG is an overloaded function (or template-id); we try
7880 deducing template args from each of the overloads, and if only one
7881 succeeds, we go with that. Modifies TARGS and returns 0 on success. */
7884 resolve_overloaded_unification (tparms
, targs
, parm
, arg
, strict
,
7886 tree tparms
, targs
, parm
, arg
;
7887 unification_kind_t strict
;
7890 tree tempargs
= copy_node (targs
);
7893 if (TREE_CODE (arg
) == ADDR_EXPR
)
7894 arg
= TREE_OPERAND (arg
, 0);
7896 if (TREE_CODE (arg
) == COMPONENT_REF
)
7897 /* Handle `&x' where `x' is some static or non-static member
7899 arg
= TREE_OPERAND (arg
, 1);
7901 if (TREE_CODE (arg
) == OFFSET_REF
)
7902 arg
= TREE_OPERAND (arg
, 1);
7904 /* Strip baselink information. */
7905 while (TREE_CODE (arg
) == TREE_LIST
)
7906 arg
= TREE_VALUE (arg
);
7908 if (TREE_CODE (arg
) == TEMPLATE_ID_EXPR
)
7910 /* If we got some explicit template args, we need to plug them into
7911 the affected templates before we try to unify, in case the
7912 explicit args will completely resolve the templates in question. */
7914 tree expl_subargs
= TREE_OPERAND (arg
, 1);
7915 arg
= TREE_OPERAND (arg
, 0);
7917 for (; arg
; arg
= OVL_NEXT (arg
))
7919 tree fn
= OVL_CURRENT (arg
);
7922 if (TREE_CODE (fn
) != TEMPLATE_DECL
)
7925 subargs
= get_bindings_overload (fn
, DECL_TEMPLATE_RESULT (fn
),
7929 elem
= tsubst (TREE_TYPE (fn
), subargs
, /*complain=*/0,
7931 if (TREE_CODE (elem
) == METHOD_TYPE
)
7932 elem
= build_ptrmemfunc_type (build_pointer_type (elem
));
7933 good
+= try_one_overload (tparms
, targs
, tempargs
, parm
, elem
,
7934 strict
, sub_strict
);
7938 else if (TREE_CODE (arg
) == OVERLOAD
)
7940 for (; arg
; arg
= OVL_NEXT (arg
))
7942 tree type
= TREE_TYPE (OVL_CURRENT (arg
));
7943 if (TREE_CODE (type
) == METHOD_TYPE
)
7944 type
= build_ptrmemfunc_type (build_pointer_type (type
));
7945 good
+= try_one_overload (tparms
, targs
, tempargs
, parm
,
7947 strict
, sub_strict
);
7951 my_friendly_abort (981006);
7953 /* [temp.deduct.type] A template-argument can be deduced from a pointer
7954 to function or pointer to member function argument if the set of
7955 overloaded functions does not contain function templates and at most
7956 one of a set of overloaded functions provides a unique match.
7958 So if we found multiple possibilities, we return success but don't
7963 int i
= TREE_VEC_LENGTH (targs
);
7965 if (TREE_VEC_ELT (tempargs
, i
))
7966 TREE_VEC_ELT (targs
, i
) = TREE_VEC_ELT (tempargs
, i
);
7974 /* Subroutine of resolve_overloaded_unification; does deduction for a single
7975 overload. Fills TARGS with any deduced arguments, or error_mark_node if
7976 different overloads deduce different arguments for a given parm.
7977 Returns 1 on success. */
7980 try_one_overload (tparms
, orig_targs
, targs
, parm
, arg
, strict
,
7982 tree tparms
, orig_targs
, targs
, parm
, arg
;
7983 unification_kind_t strict
;
7990 /* [temp.deduct.type] A template-argument can be deduced from a pointer
7991 to function or pointer to member function argument if the set of
7992 overloaded functions does not contain function templates and at most
7993 one of a set of overloaded functions provides a unique match.
7995 So if this is a template, just return success. */
7997 if (uses_template_parms (arg
))
8000 maybe_adjust_types_for_deduction (strict
, &parm
, &arg
);
8002 /* We don't copy orig_targs for this because if we have already deduced
8003 some template args from previous args, unify would complain when we
8004 try to deduce a template parameter for the same argument, even though
8005 there isn't really a conflict. */
8006 nargs
= TREE_VEC_LENGTH (targs
);
8007 tempargs
= make_tree_vec (nargs
);
8009 if (unify (tparms
, tempargs
, parm
, arg
, sub_strict
) != 0)
8012 /* First make sure we didn't deduce anything that conflicts with
8013 explicitly specified args. */
8014 for (i
= nargs
; i
--; )
8016 tree elt
= TREE_VEC_ELT (tempargs
, i
);
8017 tree oldelt
= TREE_VEC_ELT (orig_targs
, i
);
8019 if (elt
== NULL_TREE
)
8021 else if (uses_template_parms (elt
))
8023 /* Since we're unifying against ourselves, we will fill in template
8024 args used in the function parm list with our own template parms.
8026 TREE_VEC_ELT (tempargs
, i
) = NULL_TREE
;
8029 else if (oldelt
&& ! template_args_equal (oldelt
, elt
))
8033 for (i
= nargs
; i
--; )
8035 tree elt
= TREE_VEC_ELT (tempargs
, i
);
8038 TREE_VEC_ELT (targs
, i
) = elt
;
8044 /* Verify that nondeduce template argument agrees with the type
8045 obtained from argument deduction. Return nonzero if the
8050 struct A { typedef int X; };
8051 template <class T, class U> struct C {};
8052 template <class T> struct C<T, typename T::X> {};
8054 Then with the instantiation `C<A, int>', we can deduce that
8055 `T' is `A' but unify () does not check whether `typename T::X'
8056 is `int'. This function ensure that they agree.
8058 TARGS, PARMS are the same as the arguments of unify.
8059 ARGS contains template arguments from all levels. */
8062 verify_class_unification (targs
, parms
, args
)
8063 tree targs
, parms
, args
;
8066 int nparms
= TREE_VEC_LENGTH (parms
);
8067 tree new_parms
= tsubst (parms
, add_outermost_template_args (args
, targs
),
8068 /*complain=*/0, NULL_TREE
);
8069 if (new_parms
== error_mark_node
)
8072 args
= INNERMOST_TEMPLATE_ARGS (args
);
8074 for (i
= 0; i
< nparms
; i
++)
8076 tree parm
= TREE_VEC_ELT (new_parms
, i
);
8077 tree arg
= TREE_VEC_ELT (args
, i
);
8079 /* In case we are deducing from a function argument of a function
8080 templates, some parameters may not be deduced yet. So we
8081 make sure that only fully substituted elements of PARM are
8084 if (!uses_template_parms (parm
) && !template_args_equal (parm
, arg
))
8090 /* PARM is a template class (perhaps with unbound template
8091 parameters). ARG is a fully instantiated type. If ARG can be
8092 bound to PARM, return ARG, otherwise return NULL_TREE. TPARMS and
8093 TARGS are as for unify. */
8096 try_class_unification (tparms
, targs
, parm
, arg
)
8104 if (!CLASSTYPE_TEMPLATE_INFO (arg
)
8105 || CLASSTYPE_TI_TEMPLATE (arg
) != CLASSTYPE_TI_TEMPLATE (parm
))
8108 /* We need to make a new template argument vector for the call to
8109 unify. If we used TARGS, we'd clutter it up with the result of
8110 the attempted unification, even if this class didn't work out.
8111 We also don't want to commit ourselves to all the unifications
8112 we've already done, since unification is supposed to be done on
8113 an argument-by-argument basis. In other words, consider the
8114 following pathological case:
8116 template <int I, int J, int K>
8119 template <int I, int J>
8120 struct S<I, J, 2> : public S<I, I, I>, S<J, J, J> {};
8122 template <int I, int J, int K>
8123 void f(S<I, J, K>, S<I, I, I>);
8132 Now, by the time we consider the unification involving `s2', we
8133 already know that we must have `f<0, 0, 0>'. But, even though
8134 `S<0, 1, 2>' is derived from `S<0, 0, 0>', the code is not legal
8135 because there are two ways to unify base classes of S<0, 1, 2>
8136 with S<I, I, I>. If we kept the already deduced knowledge, we
8137 would reject the possibility I=1. */
8138 copy_of_targs
= make_tree_vec (TREE_VEC_LENGTH (targs
));
8140 /* If unification failed, we're done. */
8141 if (unify (tparms
, copy_of_targs
, CLASSTYPE_TI_ARGS (parm
),
8142 CLASSTYPE_TI_ARGS (arg
), UNIFY_ALLOW_NONE
))
8148 /* Subroutine of get_template_base. RVAL, if non-NULL, is a base we
8149 have already discovered to be satisfactory. ARG_BINFO is the binfo
8150 for the base class of ARG that we are currently examining. */
8153 get_template_base_recursive (tparms
, targs
, parm
,
8154 arg_binfo
, rval
, flags
)
8164 tree arg
= BINFO_TYPE (arg_binfo
);
8166 if (!(flags
& GTB_IGNORE_TYPE
))
8168 tree r
= try_class_unification (tparms
, targs
,
8171 /* If there is more than one satisfactory baseclass, then:
8175 If they yield more than one possible deduced A, the type
8179 if (r
&& rval
&& !same_type_p (r
, rval
))
8180 return error_mark_node
;
8185 binfos
= BINFO_BASETYPES (arg_binfo
);
8186 n_baselinks
= binfos
? TREE_VEC_LENGTH (binfos
) : 0;
8188 /* Process base types. */
8189 for (i
= 0; i
< n_baselinks
; i
++)
8191 tree base_binfo
= TREE_VEC_ELT (binfos
, i
);
8194 /* Skip this base, if we've already seen it. */
8195 if (BINFO_MARKED (base_binfo
))
8199 (flags
& GTB_VIA_VIRTUAL
) || TREE_VIA_VIRTUAL (base_binfo
);
8201 /* When searching for a non-virtual, we cannot mark virtually
8204 SET_BINFO_MARKED (base_binfo
);
8206 rval
= get_template_base_recursive (tparms
, targs
,
8210 GTB_VIA_VIRTUAL
* this_virtual
);
8212 /* If we discovered more than one matching base class, we can
8214 if (rval
== error_mark_node
)
8215 return error_mark_node
;
8221 /* Given a template type PARM and a class type ARG, find the unique
8222 base type in ARG that is an instance of PARM. We do not examine
8223 ARG itself; only its base-classes. If there is no appropriate base
8224 class, return NULL_TREE. If there is more than one, return
8225 error_mark_node. PARM may be the type of a partial specialization,
8226 as well as a plain template type. Used by unify. */
8229 get_template_base (tparms
, targs
, parm
, arg
)
8238 my_friendly_assert (IS_AGGR_TYPE_CODE (TREE_CODE (arg
)), 92);
8240 arg_binfo
= TYPE_BINFO (complete_type (arg
));
8241 rval
= get_template_base_recursive (tparms
, targs
,
8246 /* Since get_template_base_recursive marks the bases classes, we
8247 must unmark them here. */
8248 dfs_walk (arg_binfo
, dfs_unmark
, markedp
, 0);
8253 /* Returns the level of DECL, which declares a template parameter. */
8256 template_decl_level (decl
)
8259 switch (TREE_CODE (decl
))
8263 return TEMPLATE_TYPE_LEVEL (TREE_TYPE (decl
));
8266 return TEMPLATE_PARM_LEVEL (DECL_INITIAL (decl
));
8269 my_friendly_abort (0);
8274 /* Decide whether ARG can be unified with PARM, considering only the
8275 cv-qualifiers of each type, given STRICT as documented for unify.
8276 Returns non-zero iff the unification is OK on that basis.*/
8279 check_cv_quals_for_unify (strict
, arg
, parm
)
8284 if (!(strict
& UNIFY_ALLOW_MORE_CV_QUAL
)
8285 && !at_least_as_qualified_p (arg
, parm
))
8288 if (!(strict
& UNIFY_ALLOW_LESS_CV_QUAL
)
8289 && !at_least_as_qualified_p (parm
, arg
))
8295 /* Takes parameters as for type_unification. Returns 0 if the
8296 type deduction succeeds, 1 otherwise. The parameter STRICT is a
8297 bitwise or of the following flags:
8300 Require an exact match between PARM and ARG.
8301 UNIFY_ALLOW_MORE_CV_QUAL:
8302 Allow the deduced ARG to be more cv-qualified than ARG.
8303 UNIFY_ALLOW_LESS_CV_QUAL:
8304 Allow the deduced ARG to be less cv-qualified than ARG.
8305 UNIFY_ALLOW_DERIVED:
8306 Allow the deduced ARG to be a template base class of ARG,
8307 or a pointer to a template base class of the type pointed to by
8309 UNIFY_ALLOW_INTEGER:
8310 Allow any integral type to be deduced. See the TEMPLATE_PARM_INDEX
8311 case for more information. */
8314 unify (tparms
, targs
, parm
, arg
, strict
)
8315 tree tparms
, targs
, parm
, arg
;
8322 /* I don't think this will do the right thing with respect to types.
8323 But the only case I've seen it in so far has been array bounds, where
8324 signedness is the only information lost, and I think that will be
8326 while (TREE_CODE (parm
) == NOP_EXPR
)
8327 parm
= TREE_OPERAND (parm
, 0);
8329 if (arg
== error_mark_node
)
8331 if (arg
== unknown_type_node
)
8332 /* We can't deduce anything from this, but we might get all the
8333 template args from other function args. */
8336 /* If PARM uses template parameters, then we can't bail out here,
8337 even if ARG == PARM, since we won't record unifications for the
8338 template parameters. We might need them if we're trying to
8339 figure out which of two things is more specialized. */
8340 if (arg
== parm
&& !uses_template_parms (parm
))
8343 /* Immediately reject some pairs that won't unify because of
8344 cv-qualification mismatches. */
8345 if (TREE_CODE (arg
) == TREE_CODE (parm
)
8347 /* We check the cv-qualifiers when unifying with template type
8348 parameters below. We want to allow ARG `const T' to unify with
8349 PARM `T' for example, when computing which of two templates
8350 is more specialized, for example. */
8351 && TREE_CODE (arg
) != TEMPLATE_TYPE_PARM
8352 && !check_cv_quals_for_unify (strict
, arg
, parm
))
8355 switch (TREE_CODE (parm
))
8358 /* In a type which contains a nested-name-specifier, template
8359 argument values cannot be deduced for template parameters used
8360 within the nested-name-specifier. */
8363 case TEMPLATE_TYPE_PARM
:
8364 case TEMPLATE_TEMPLATE_PARM
:
8365 case BOUND_TEMPLATE_TEMPLATE_PARM
:
8366 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, 0));
8368 if (TEMPLATE_TYPE_LEVEL (parm
)
8369 != template_decl_level (tparm
))
8370 /* The PARM is not one we're trying to unify. Just check
8371 to see if it matches ARG. */
8372 return (TREE_CODE (arg
) == TREE_CODE (parm
)
8373 && same_type_p (parm
, arg
)) ? 0 : 1;
8374 idx
= TEMPLATE_TYPE_IDX (parm
);
8375 targ
= TREE_VEC_ELT (targs
, idx
);
8376 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, idx
));
8378 /* Check for mixed types and values. */
8379 if ((TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
8380 && TREE_CODE (tparm
) != TYPE_DECL
)
8381 || (TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
8382 && TREE_CODE (tparm
) != TEMPLATE_DECL
))
8385 if (TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
8387 /* ARG must be constructed from a template class. */
8388 if (TREE_CODE (arg
) != RECORD_TYPE
|| !CLASSTYPE_TEMPLATE_INFO (arg
))
8392 tree parmtmpl
= TYPE_TI_TEMPLATE (parm
);
8393 tree parmvec
= TYPE_TI_ARGS (parm
);
8394 tree argvec
= CLASSTYPE_TI_ARGS (arg
);
8396 = DECL_INNERMOST_TEMPLATE_PARMS (CLASSTYPE_TI_TEMPLATE (arg
));
8399 /* The parameter and argument roles have to be switched here
8400 in order to handle default arguments properly. For example,
8401 template<template <class> class TT> void f(TT<int>)
8402 should be able to accept vector<int> which comes from
8403 template <class T, class Allocator = allocator>
8406 if (coerce_template_parms (argtmplvec
, parmvec
, parmtmpl
, 0, 1)
8410 /* Deduce arguments T, i from TT<T> or TT<i>.
8411 We check each element of PARMVEC and ARGVEC individually
8412 rather than the whole TREE_VEC since they can have
8413 different number of elements. */
8415 for (i
= 0; i
< TREE_VEC_LENGTH (parmvec
); ++i
)
8417 tree t
= TREE_VEC_ELT (parmvec
, i
);
8419 if (unify (tparms
, targs
, t
,
8420 TREE_VEC_ELT (argvec
, i
),
8425 arg
= CLASSTYPE_TI_TEMPLATE (arg
);
8427 /* Fall through to deduce template name. */
8430 if (TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
8431 || TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
8433 /* Deduce template name TT from TT, TT<>, TT<T> and TT<i>. */
8435 /* Simple cases: Value already set, does match or doesn't. */
8436 if (targ
!= NULL_TREE
&& template_args_equal (targ
, arg
))
8443 /* If PARM is `const T' and ARG is only `int', we don't have
8444 a match unless we are allowing additional qualification.
8445 If ARG is `const int' and PARM is just `T' that's OK;
8446 that binds `const int' to `T'. */
8447 if (!check_cv_quals_for_unify (strict
| UNIFY_ALLOW_LESS_CV_QUAL
,
8451 /* Consider the case where ARG is `const volatile int' and
8452 PARM is `const T'. Then, T should be `volatile int'. */
8454 cp_build_qualified_type_real (arg
,
8456 & ~CP_TYPE_QUALS (parm
),
8458 if (arg
== error_mark_node
)
8461 /* Simple cases: Value already set, does match or doesn't. */
8462 if (targ
!= NULL_TREE
&& same_type_p (targ
, arg
))
8468 /* Make sure that ARG is not a variable-sized array. (Note that
8469 were talking about variable-sized arrays (like `int[n]'),
8470 rather than arrays of unknown size (like `int[]').) We'll
8471 get very confused by such a type since the bound of the array
8472 will not be computable in an instantiation. Besides, such
8473 types are not allowed in ISO C++, so we can do as we please
8475 if (TREE_CODE (arg
) == ARRAY_TYPE
8476 && !uses_template_parms (arg
)
8477 && (TREE_CODE (TYPE_MAX_VALUE (TYPE_DOMAIN (arg
)))
8481 TREE_VEC_ELT (targs
, idx
) = arg
;
8484 case TEMPLATE_PARM_INDEX
:
8485 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, 0));
8487 if (TEMPLATE_PARM_LEVEL (parm
)
8488 != template_decl_level (tparm
))
8489 /* The PARM is not one we're trying to unify. Just check
8490 to see if it matches ARG. */
8491 return (TREE_CODE (arg
) == TREE_CODE (parm
)
8492 && cp_tree_equal (parm
, arg
) > 0) ? 0 : 1;
8494 idx
= TEMPLATE_PARM_IDX (parm
);
8495 targ
= TREE_VEC_ELT (targs
, idx
);
8499 int i
= (cp_tree_equal (targ
, arg
) > 0);
8505 my_friendly_abort (42);
8508 /* [temp.deduct.type] If, in the declaration of a function template
8509 with a non-type template-parameter, the non-type
8510 template-parameter is used in an expression in the function
8511 parameter-list and, if the corresponding template-argument is
8512 deduced, the template-argument type shall match the type of the
8513 template-parameter exactly, except that a template-argument
8514 deduced from an array bound may be of any integral type.
8515 The non-type parameter might use already deduced type parameters. */
8516 if (same_type_p (TREE_TYPE (arg
),
8517 tsubst (TREE_TYPE (parm
), targs
, 0, NULL_TREE
)))
8519 else if ((strict
& UNIFY_ALLOW_INTEGER
)
8520 && (TREE_CODE (TREE_TYPE (parm
)) == INTEGER_TYPE
8521 || TREE_CODE (TREE_TYPE (parm
)) == BOOLEAN_TYPE
))
8526 TREE_VEC_ELT (targs
, idx
) = arg
;
8533 if (TREE_CODE (arg
) != POINTER_TYPE
)
8536 /* [temp.deduct.call]
8538 A can be another pointer or pointer to member type that can
8539 be converted to the deduced A via a qualification
8540 conversion (_conv.qual_).
8542 We pass down STRICT here rather than UNIFY_ALLOW_NONE.
8543 This will allow for additional cv-qualification of the
8544 pointed-to types if appropriate. In general, this is a bit
8545 too generous; we are only supposed to allow qualification
8546 conversions and this method will allow an ARG of char** and
8547 a deduced ARG of const char**. However, overload
8548 resolution will subsequently invalidate the candidate, so
8549 this is probably OK. */
8550 sub_strict
= strict
;
8552 if (TREE_CODE (TREE_TYPE (arg
)) != RECORD_TYPE
)
8553 /* The derived-to-base conversion only persists through one
8554 level of pointers. */
8555 sub_strict
&= ~UNIFY_ALLOW_DERIVED
;
8557 return unify (tparms
, targs
, TREE_TYPE (parm
),
8558 TREE_TYPE (arg
), sub_strict
);
8561 case REFERENCE_TYPE
:
8562 if (TREE_CODE (arg
) != REFERENCE_TYPE
)
8564 return unify (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
8568 if (TREE_CODE (arg
) != ARRAY_TYPE
)
8570 if ((TYPE_DOMAIN (parm
) == NULL_TREE
)
8571 != (TYPE_DOMAIN (arg
) == NULL_TREE
))
8573 if (TYPE_DOMAIN (parm
) != NULL_TREE
8574 && unify (tparms
, targs
, TYPE_DOMAIN (parm
),
8575 TYPE_DOMAIN (arg
), UNIFY_ALLOW_NONE
) != 0)
8577 return unify (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
8586 if (TREE_CODE (arg
) != TREE_CODE (parm
))
8589 if (TREE_CODE (parm
) == INTEGER_TYPE
8590 && TREE_CODE (TYPE_MAX_VALUE (parm
)) != INTEGER_CST
)
8592 if (TYPE_MIN_VALUE (parm
) && TYPE_MIN_VALUE (arg
)
8593 && unify (tparms
, targs
, TYPE_MIN_VALUE (parm
),
8594 TYPE_MIN_VALUE (arg
), UNIFY_ALLOW_INTEGER
))
8596 if (TYPE_MAX_VALUE (parm
) && TYPE_MAX_VALUE (arg
)
8597 && unify (tparms
, targs
, TYPE_MAX_VALUE (parm
),
8598 TYPE_MAX_VALUE (arg
), UNIFY_ALLOW_INTEGER
))
8601 /* We have already checked cv-qualification at the top of the
8603 else if (!same_type_ignoring_top_level_qualifiers_p (arg
, parm
))
8606 /* As far as unification is concerned, this wins. Later checks
8607 will invalidate it if necessary. */
8610 /* Types INTEGER_CST and MINUS_EXPR can come from array bounds. */
8611 /* Type INTEGER_CST can come from ordinary constant template args. */
8613 while (TREE_CODE (arg
) == NOP_EXPR
)
8614 arg
= TREE_OPERAND (arg
, 0);
8616 if (TREE_CODE (arg
) != INTEGER_CST
)
8618 return !tree_int_cst_equal (parm
, arg
);
8623 if (TREE_CODE (arg
) != TREE_VEC
)
8625 if (TREE_VEC_LENGTH (parm
) != TREE_VEC_LENGTH (arg
))
8627 for (i
= 0; i
< TREE_VEC_LENGTH (parm
); ++i
)
8628 if (unify (tparms
, targs
,
8629 TREE_VEC_ELT (parm
, i
), TREE_VEC_ELT (arg
, i
),
8637 if (TREE_CODE (arg
) != TREE_CODE (parm
))
8640 if (TYPE_PTRMEMFUNC_P (parm
))
8642 if (!TYPE_PTRMEMFUNC_P (arg
))
8645 return unify (tparms
, targs
,
8646 TYPE_PTRMEMFUNC_FN_TYPE (parm
),
8647 TYPE_PTRMEMFUNC_FN_TYPE (arg
),
8651 if (CLASSTYPE_TEMPLATE_INFO (parm
))
8655 if (strict
& UNIFY_ALLOW_DERIVED
)
8657 /* First, we try to unify the PARM and ARG directly. */
8658 t
= try_class_unification (tparms
, targs
,
8663 /* Fallback to the special case allowed in
8666 If P is a class, and P has the form
8667 template-id, then A can be a derived class of
8668 the deduced A. Likewise, if P is a pointer to
8669 a class of the form template-id, A can be a
8670 pointer to a derived class pointed to by the
8672 t
= get_template_base (tparms
, targs
,
8675 if (! t
|| t
== error_mark_node
)
8679 else if (CLASSTYPE_TEMPLATE_INFO (arg
)
8680 && (CLASSTYPE_TI_TEMPLATE (parm
)
8681 == CLASSTYPE_TI_TEMPLATE (arg
)))
8682 /* Perhaps PARM is something like S<U> and ARG is S<int>.
8683 Then, we should unify `int' and `U'. */
8686 /* There's no chance of unification succeeding. */
8689 return unify (tparms
, targs
, CLASSTYPE_TI_ARGS (parm
),
8690 CLASSTYPE_TI_ARGS (t
), UNIFY_ALLOW_NONE
);
8692 else if (!same_type_ignoring_top_level_qualifiers_p (parm
, arg
))
8698 if (TREE_CODE (arg
) != TREE_CODE (parm
))
8701 if (unify (tparms
, targs
, TREE_TYPE (parm
),
8702 TREE_TYPE (arg
), UNIFY_ALLOW_NONE
))
8704 return type_unification_real (tparms
, targs
, TYPE_ARG_TYPES (parm
),
8705 TYPE_ARG_TYPES (arg
), 1,
8709 if (TREE_CODE (arg
) != OFFSET_TYPE
)
8711 if (unify (tparms
, targs
, TYPE_OFFSET_BASETYPE (parm
),
8712 TYPE_OFFSET_BASETYPE (arg
), UNIFY_ALLOW_NONE
))
8714 return unify (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
8718 if (arg
!= decl_constant_value (parm
))
8723 /* Matched cases are handled by the ARG == PARM test above. */
8727 if (TREE_CODE (TREE_OPERAND (parm
, 1)) == INTEGER_CST
)
8729 /* We handle this case specially, since it comes up with
8730 arrays. In particular, something like:
8732 template <int N> void f(int (&x)[N]);
8734 Here, we are trying to unify the range type, which
8735 looks like [0 ... (N - 1)]. */
8737 t1
= TREE_OPERAND (parm
, 0);
8738 t2
= TREE_OPERAND (parm
, 1);
8740 t
= fold (build (PLUS_EXPR
, integer_type_node
, arg
, t2
));
8742 return unify (tparms
, targs
, t1
, t
, strict
);
8744 /* else fall through */
8747 if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (TREE_CODE (parm
))))
8750 /* We're looking at an expression. This can happen with
8754 void foo(S<I>, S<I + 2>);
8756 This is a "nondeduced context":
8760 The nondeduced contexts are:
8762 --A type that is a template-id in which one or more of
8763 the template-arguments is an expression that references
8764 a template-parameter.
8766 In these cases, we assume deduction succeeded, but don't
8767 actually infer any unifications. */
8769 if (!uses_template_parms (parm
)
8770 && !template_args_equal (parm
, arg
))
8776 sorry ("use of `%s' in template type unification",
8777 tree_code_name
[(int) TREE_CODE (parm
)]);
8783 /* Called if RESULT is explicitly instantiated, or is a member of an
8784 explicitly instantiated class, or if using -frepo and the
8785 instantiation of RESULT has been assigned to this file. */
8788 mark_decl_instantiated (result
, extern_p
)
8792 if (TREE_CODE (result
) != FUNCTION_DECL
)
8793 /* The TREE_PUBLIC flag for function declarations will have been
8794 set correctly by tsubst. */
8795 TREE_PUBLIC (result
) = 1;
8797 /* We used to set this unconditionally; we moved that to
8798 do_decl_instantiation so it wouldn't get set on members of
8799 explicit class template instantiations. But we still need to set
8800 it here for the 'extern template' case in order to suppress
8801 implicit instantiations. */
8803 SET_DECL_EXPLICIT_INSTANTIATION (result
);
8807 DECL_INTERFACE_KNOWN (result
) = 1;
8808 DECL_NOT_REALLY_EXTERN (result
) = 1;
8810 /* Always make artificials weak. */
8811 if (DECL_ARTIFICIAL (result
) && flag_weak
)
8812 comdat_linkage (result
);
8813 /* For WIN32 we also want to put explicit instantiations in
8814 linkonce sections. */
8815 else if (TREE_PUBLIC (result
))
8816 maybe_make_one_only (result
);
8818 else if (TREE_CODE (result
) == FUNCTION_DECL
)
8822 /* Given two function templates PAT1 and PAT2, and explicit template
8823 arguments EXPLICIT_ARGS return:
8825 1 if PAT1 is more specialized than PAT2 as described in [temp.func.order].
8826 -1 if PAT2 is more specialized than PAT1.
8827 0 if neither is more specialized. */
8830 more_specialized (pat1
, pat2
, explicit_args
)
8831 tree pat1
, pat2
, explicit_args
;
8837 = get_bindings_overload (pat1
, DECL_TEMPLATE_RESULT (pat2
), explicit_args
);
8842 = get_bindings_overload (pat2
, DECL_TEMPLATE_RESULT (pat1
), explicit_args
);
8849 /* Given two class template specialization list nodes PAT1 and PAT2, return:
8851 1 if PAT1 is more specialized than PAT2 as described in [temp.class.order].
8852 -1 if PAT2 is more specialized than PAT1.
8853 0 if neither is more specialized. */
8856 more_specialized_class (pat1
, pat2
)
8862 targs
= get_class_bindings (TREE_VALUE (pat1
), TREE_PURPOSE (pat1
),
8863 TREE_PURPOSE (pat2
));
8867 targs
= get_class_bindings (TREE_VALUE (pat2
), TREE_PURPOSE (pat2
),
8868 TREE_PURPOSE (pat1
));
8875 /* Return the template arguments that will produce the function signature
8876 DECL from the function template FN, with the explicit template
8877 arguments EXPLICIT_ARGS. If CHECK_RETTYPE is 1, the return type must
8878 also match. Return NULL_TREE if no satisfactory arguments could be
8882 get_bindings_real (fn
, decl
, explicit_args
, check_rettype
)
8883 tree fn
, decl
, explicit_args
;
8886 int ntparms
= DECL_NTPARMS (fn
);
8887 tree targs
= make_tree_vec (ntparms
);
8889 tree decl_arg_types
;
8892 /* Substitute the explicit template arguments into the type of DECL.
8893 The call to fn_type_unification will handle substitution into the
8895 decl_type
= TREE_TYPE (decl
);
8896 if (explicit_args
&& uses_template_parms (decl_type
))
8899 tree converted_args
;
8901 if (DECL_TEMPLATE_INFO (decl
))
8902 tmpl
= DECL_TI_TEMPLATE (decl
);
8904 /* We can get here for some illegal specializations. */
8908 = (coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (tmpl
),
8909 explicit_args
, NULL_TREE
,
8911 /*require_all_arguments=*/0));
8912 if (converted_args
== error_mark_node
)
8915 decl_type
= tsubst (decl_type
, converted_args
, /*complain=*/0,
8917 if (decl_type
== error_mark_node
)
8921 /* If FN is a static member function, adjust the type of DECL
8923 decl_arg_types
= TYPE_ARG_TYPES (decl_type
);
8924 if (DECL_STATIC_FUNCTION_P (fn
)
8925 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
8926 decl_arg_types
= TREE_CHAIN (decl_arg_types
);
8928 i
= fn_type_unification (fn
, explicit_args
, targs
,
8930 (check_rettype
|| DECL_CONV_FN_P (fn
)
8931 ? TREE_TYPE (decl_type
) : NULL_TREE
),
8940 /* For most uses, we want to check the return type. */
8943 get_bindings (fn
, decl
, explicit_args
)
8944 tree fn
, decl
, explicit_args
;
8946 return get_bindings_real (fn
, decl
, explicit_args
, 1);
8949 /* But for more_specialized, we only care about the parameter types. */
8952 get_bindings_overload (fn
, decl
, explicit_args
)
8953 tree fn
, decl
, explicit_args
;
8955 return get_bindings_real (fn
, decl
, explicit_args
, 0);
8958 /* Return the innermost template arguments that, when applied to a
8959 template specialization whose innermost template parameters are
8960 TPARMS, and whose specialization arguments are ARGS, yield the
8963 For example, suppose we have:
8965 template <class T, class U> struct S {};
8966 template <class T> struct S<T*, int> {};
8968 Then, suppose we want to get `S<double*, int>'. The TPARMS will be
8969 {T}, the PARMS will be {T*, int} and the ARGS will be {double*,
8970 int}. The resulting vector will be {double}, indicating that `T'
8971 is bound to `double'. */
8974 get_class_bindings (tparms
, parms
, args
)
8975 tree tparms
, parms
, args
;
8977 int i
, ntparms
= TREE_VEC_LENGTH (tparms
);
8978 tree vec
= make_tree_vec (ntparms
);
8980 if (unify (tparms
, vec
, parms
, INNERMOST_TEMPLATE_ARGS (args
),
8984 for (i
= 0; i
< ntparms
; ++i
)
8985 if (! TREE_VEC_ELT (vec
, i
))
8988 if (verify_class_unification (vec
, parms
, args
))
8994 /* In INSTANTIATIONS is a list of <INSTANTIATION, TEMPLATE> pairs.
8995 Pick the most specialized template, and return the corresponding
8996 instantiation, or if there is no corresponding instantiation, the
8997 template itself. EXPLICIT_ARGS is any template arguments explicitly
8998 mentioned in a template-id. If there is no most specialized
8999 template, error_mark_node is returned. If there are no templates
9000 at all, NULL_TREE is returned. */
9003 most_specialized_instantiation (instantiations
, explicit_args
)
9004 tree instantiations
;
9010 if (!instantiations
)
9013 champ
= instantiations
;
9014 for (fn
= TREE_CHAIN (instantiations
); fn
; fn
= TREE_CHAIN (fn
))
9016 fate
= more_specialized (TREE_VALUE (champ
),
9017 TREE_VALUE (fn
), explicit_args
);
9024 fn
= TREE_CHAIN (fn
);
9026 return error_mark_node
;
9032 for (fn
= instantiations
; fn
&& fn
!= champ
; fn
= TREE_CHAIN (fn
))
9034 fate
= more_specialized (TREE_VALUE (champ
),
9035 TREE_VALUE (fn
), explicit_args
);
9037 return error_mark_node
;
9040 return TREE_PURPOSE (champ
) ? TREE_PURPOSE (champ
) : TREE_VALUE (champ
);
9043 /* Return the most specialized of the list of templates in FNS that can
9044 produce an instantiation matching DECL, given the explicit template
9045 arguments EXPLICIT_ARGS. */
9048 most_specialized (fns
, decl
, explicit_args
)
9049 tree fns
, decl
, explicit_args
;
9051 tree candidates
= NULL_TREE
;
9054 for (fn
= fns
; fn
; fn
= TREE_CHAIN (fn
))
9056 tree candidate
= TREE_VALUE (fn
);
9058 args
= get_bindings (candidate
, decl
, explicit_args
);
9060 candidates
= tree_cons (NULL_TREE
, candidate
, candidates
);
9063 return most_specialized_instantiation (candidates
, explicit_args
);
9066 /* If DECL is a specialization of some template, return the most
9067 general such template. Otherwise, returns NULL_TREE.
9071 template <class T> struct S { template <class U> void f(U); };
9073 if TMPL is `template <class U> void S<int>::f(U)' this will return
9074 the full template. This function will not trace past partial
9075 specializations, however. For example, given in addition:
9077 template <class T> struct S<T*> { template <class U> void f(U); };
9079 if TMPL is `template <class U> void S<int*>::f(U)' this will return
9080 `template <class T> template <class U> S<T*>::f(U)'. */
9083 most_general_template (decl
)
9086 /* If DECL is a FUNCTION_DECL, find the TEMPLATE_DECL of which it is
9087 an immediate specialization. */
9088 if (TREE_CODE (decl
) == FUNCTION_DECL
)
9090 if (DECL_TEMPLATE_INFO (decl
)) {
9091 decl
= DECL_TI_TEMPLATE (decl
);
9093 /* The DECL_TI_TEMPLATE can be an IDENTIFIER_NODE for a
9095 if (TREE_CODE (decl
) != TEMPLATE_DECL
)
9101 /* Look for more and more general templates. */
9102 while (DECL_TEMPLATE_INFO (decl
))
9104 /* The DECL_TI_TEMPLATE can be a LOOKUP_EXPR or IDENTIFIER_NODE
9105 in some cases. (See cp-tree.h for details.) */
9106 if (TREE_CODE (DECL_TI_TEMPLATE (decl
)) != TEMPLATE_DECL
)
9109 /* Stop if we run into an explicitly specialized class template. */
9110 if (!DECL_NAMESPACE_SCOPE_P (decl
)
9111 && DECL_CONTEXT (decl
)
9112 && CLASSTYPE_TEMPLATE_SPECIALIZATION (DECL_CONTEXT (decl
)))
9115 decl
= DECL_TI_TEMPLATE (decl
);
9121 /* Return the most specialized of the class template specializations
9122 of TMPL which can produce an instantiation matching ARGS, or
9123 error_mark_node if the choice is ambiguous. */
9126 most_specialized_class (tmpl
, args
)
9130 tree list
= NULL_TREE
;
9135 tmpl
= most_general_template (tmpl
);
9136 for (t
= DECL_TEMPLATE_SPECIALIZATIONS (tmpl
); t
; t
= TREE_CHAIN (t
))
9139 = get_class_bindings (TREE_VALUE (t
), TREE_PURPOSE (t
), args
);
9142 list
= tree_cons (TREE_PURPOSE (t
), TREE_VALUE (t
), list
);
9143 TREE_TYPE (list
) = TREE_TYPE (t
);
9153 for (; t
; t
= TREE_CHAIN (t
))
9155 fate
= more_specialized_class (champ
, t
);
9164 return error_mark_node
;
9170 for (t
= list
; t
&& t
!= champ
; t
= TREE_CHAIN (t
))
9172 fate
= more_specialized_class (champ
, t
);
9174 return error_mark_node
;
9180 /* called from the parser. */
9183 do_decl_instantiation (declspecs
, declarator
, storage
)
9184 tree declspecs
, declarator
, storage
;
9186 tree decl
= grokdeclarator (declarator
, declspecs
, NORMAL
, 0, NULL_TREE
);
9187 tree result
= NULL_TREE
;
9191 /* An error occurred, for which grokdeclarator has already issued
9192 an appropriate message. */
9194 else if (! DECL_LANG_SPECIFIC (decl
))
9196 cp_error ("explicit instantiation of non-template `%#D'", decl
);
9199 else if (TREE_CODE (decl
) == VAR_DECL
)
9201 /* There is an asymmetry here in the way VAR_DECLs and
9202 FUNCTION_DECLs are handled by grokdeclarator. In the case of
9203 the latter, the DECL we get back will be marked as a
9204 template instantiation, and the appropriate
9205 DECL_TEMPLATE_INFO will be set up. This does not happen for
9206 VAR_DECLs so we do the lookup here. Probably, grokdeclarator
9207 should handle VAR_DECLs as it currently handles
9209 result
= lookup_field (DECL_CONTEXT (decl
), DECL_NAME (decl
), 0, 0);
9210 if (result
&& TREE_CODE (result
) != VAR_DECL
)
9212 cp_error ("no matching template for `%D' found", result
);
9216 else if (TREE_CODE (decl
) != FUNCTION_DECL
)
9218 cp_error ("explicit instantiation of `%#D'", decl
);
9224 /* Check for various error cases. Note that if the explicit
9225 instantiation is legal the RESULT will currently be marked as an
9226 *implicit* instantiation; DECL_EXPLICIT_INSTANTIATION is not set
9227 until we get here. */
9229 if (DECL_TEMPLATE_SPECIALIZATION (result
))
9233 No program shall both explicitly instantiate and explicitly
9234 specialize a template. */
9235 cp_pedwarn ("explicit instantiation of `%#D' after", result
);
9236 cp_pedwarn_at ("explicit specialization here", result
);
9239 else if (DECL_EXPLICIT_INSTANTIATION (result
))
9243 No program shall explicitly instantiate any template more
9246 We check DECL_INTERFACE_KNOWN so as not to complain when the first
9247 instantiation was `extern' and the second is not, and EXTERN_P for
9248 the opposite case. If -frepo, chances are we already got marked
9249 as an explicit instantiation because of the repo file. */
9250 if (DECL_INTERFACE_KNOWN (result
) && !extern_p
&& !flag_use_repository
)
9251 cp_pedwarn ("duplicate explicit instantiation of `%#D'", result
);
9253 /* If we've already instantiated the template, just return now. */
9254 if (DECL_INTERFACE_KNOWN (result
))
9257 else if (!DECL_IMPLICIT_INSTANTIATION (result
))
9259 cp_error ("no matching template for `%D' found", result
);
9262 else if (!DECL_TEMPLATE_INFO (result
))
9264 cp_pedwarn ("explicit instantiation of non-template `%#D'", result
);
9268 if (flag_external_templates
)
9271 if (storage
== NULL_TREE
)
9273 else if (storage
== ridpointers
[(int) RID_EXTERN
])
9276 cp_pedwarn ("ISO C++ forbids the use of `extern' on explicit instantiations");
9280 cp_error ("storage class `%D' applied to template instantiation",
9283 /* Under the new ABI, we need to make sure to instantiate all the
9284 cloned versions of constructors or destructors. */
9286 (DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (result
) ||
9287 DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (result
)) &&
9288 !(TREE_CHAIN (result
) &&
9289 DECL_CLONED_FUNCTION (TREE_CHAIN (result
))))
9290 clone_function_decl(result
, /*update_method_vec_p=*/0);
9292 SET_DECL_EXPLICIT_INSTANTIATION (result
);
9293 mark_decl_instantiated (result
, extern_p
);
9294 repo_template_instantiated (result
, extern_p
);
9296 instantiate_decl (result
, /*defer_ok=*/1);
9300 mark_class_instantiated (t
, extern_p
)
9304 SET_CLASSTYPE_EXPLICIT_INSTANTIATION (t
);
9305 SET_CLASSTYPE_INTERFACE_KNOWN (t
);
9306 CLASSTYPE_INTERFACE_ONLY (t
) = extern_p
;
9307 CLASSTYPE_VTABLE_NEEDS_WRITING (t
) = ! extern_p
;
9308 TYPE_DECL_SUPPRESS_DEBUG (TYPE_NAME (t
)) = extern_p
;
9311 CLASSTYPE_DEBUG_REQUESTED (t
) = 1;
9312 rest_of_type_compilation (t
, 1);
9316 /* Perform an explicit instantiation of template class T. STORAGE, if
9317 non-null, is the RID for extern, inline or static. COMPLAIN is
9318 non-zero if this is called from the parser, zero if called recursively,
9319 since the standard is unclear (as detailed below). */
9322 do_type_instantiation (t
, storage
, complain
)
9330 if (TREE_CODE (t
) == TYPE_DECL
)
9333 if (! CLASS_TYPE_P (t
) || ! CLASSTYPE_TEMPLATE_INFO (t
))
9335 cp_error ("explicit instantiation of non-template type `%T'", t
);
9341 /* With -fexternal-templates, explicit instantiations are treated the same
9342 as implicit ones. */
9343 if (flag_external_templates
)
9346 if (!COMPLETE_TYPE_P (t
))
9349 cp_error ("explicit instantiation of `%#T' before definition of template",
9354 if (storage
!= NULL_TREE
)
9357 cp_pedwarn("ISO C++ forbids the use of `%s' on explicit instantiations",
9358 IDENTIFIER_POINTER (storage
));
9360 if (storage
== ridpointers
[(int) RID_INLINE
])
9362 else if (storage
== ridpointers
[(int) RID_EXTERN
])
9364 else if (storage
== ridpointers
[(int) RID_STATIC
])
9368 cp_error ("storage class `%D' applied to template instantiation",
9374 if (CLASSTYPE_TEMPLATE_SPECIALIZATION (t
))
9378 No program shall both explicitly instantiate and explicitly
9379 specialize a template. */
9382 cp_error ("explicit instantiation of `%#T' after", t
);
9383 cp_error_at ("explicit specialization here", t
);
9387 else if (CLASSTYPE_EXPLICIT_INSTANTIATION (t
))
9391 No program shall explicitly instantiate any template more
9394 If CLASSTYPE_INTERFACE_ONLY, then the first explicit instantiation
9395 was `extern'. If EXTERN_P then the second is. If -frepo, chances
9396 are we already got marked as an explicit instantion because of the
9397 repo file. All these cases are OK. */
9398 if (!CLASSTYPE_INTERFACE_ONLY (t
) && !extern_p
&& !flag_use_repository
9400 cp_pedwarn ("duplicate explicit instantiation of `%#T'", t
);
9402 /* If we've already instantiated the template, just return now. */
9403 if (!CLASSTYPE_INTERFACE_ONLY (t
))
9407 mark_class_instantiated (t
, extern_p
);
9408 repo_template_instantiated (t
, extern_p
);
9416 /* In contrast to implicit instantiation, where only the
9417 declarations, and not the definitions, of members are
9418 instantiated, we have here:
9422 The explicit instantiation of a class template specialization
9423 implies the instantiation of all of its members not
9424 previously explicitly specialized in the translation unit
9425 containing the explicit instantiation.
9427 Of course, we can't instantiate member template classes, since
9428 we don't have any arguments for them. Note that the standard
9429 is unclear on whether the instantiation of the members are
9430 *explicit* instantiations or not. We choose to be generous,
9431 and not set DECL_EXPLICIT_INSTANTIATION. Therefore, we allow
9432 the explicit instantiation of a class where some of the members
9433 have no definition in the current translation unit. */
9436 for (tmp
= TYPE_METHODS (t
); tmp
; tmp
= TREE_CHAIN (tmp
))
9437 if (TREE_CODE (tmp
) == FUNCTION_DECL
9438 && DECL_TEMPLATE_INSTANTIATION (tmp
))
9440 mark_decl_instantiated (tmp
, extern_p
);
9441 repo_template_instantiated (tmp
, extern_p
);
9443 instantiate_decl (tmp
, /*defer_ok=*/1);
9446 for (tmp
= TYPE_FIELDS (t
); tmp
; tmp
= TREE_CHAIN (tmp
))
9447 if (TREE_CODE (tmp
) == VAR_DECL
&& DECL_TEMPLATE_INSTANTIATION (tmp
))
9449 mark_decl_instantiated (tmp
, extern_p
);
9450 repo_template_instantiated (tmp
, extern_p
);
9452 instantiate_decl (tmp
, /*defer_ok=*/1);
9455 for (tmp
= CLASSTYPE_TAGS (t
); tmp
; tmp
= TREE_CHAIN (tmp
))
9456 if (IS_AGGR_TYPE (TREE_VALUE (tmp
))
9457 && !uses_template_parms (CLASSTYPE_TI_ARGS (TREE_VALUE (tmp
))))
9458 do_type_instantiation (TYPE_MAIN_DECL (TREE_VALUE (tmp
)), storage
, 0);
9462 /* Given a function DECL, which is a specialization of TMPL, modify
9463 DECL to be a re-instantiation of TMPL with the same template
9464 arguments. TMPL should be the template into which tsubst'ing
9465 should occur for DECL, not the most general template.
9467 One reason for doing this is a scenario like this:
9470 void f(const T&, int i);
9472 void g() { f(3, 7); }
9475 void f(const T& t, const int i) { }
9477 Note that when the template is first instantiated, with
9478 instantiate_template, the resulting DECL will have no name for the
9479 first parameter, and the wrong type for the second. So, when we go
9480 to instantiate the DECL, we regenerate it. */
9483 regenerate_decl_from_template (decl
, tmpl
)
9487 /* The most general version of TMPL. */
9489 /* The arguments used to instantiate DECL, from the most general
9496 args
= DECL_TI_ARGS (decl
);
9497 code_pattern
= DECL_TEMPLATE_RESULT (tmpl
);
9499 /* Unregister the specialization so that when we tsubst we will not
9500 just return DECL. We don't have to unregister DECL from TMPL
9501 because if would only be registered there if it were a partial
9502 instantiation of a specialization, which it isn't: it's a full
9504 gen_tmpl
= most_general_template (tmpl
);
9505 unregistered
= unregister_specialization (decl
, gen_tmpl
);
9507 /* If the DECL was not unregistered then something peculiar is
9508 happening: we created a specialization but did not call
9509 register_specialization for it. */
9510 my_friendly_assert (unregistered
, 0);
9512 if (TREE_CODE (decl
) == VAR_DECL
)
9513 /* Make sure that we can see identifiers, and compute access
9514 correctly, for the class members used in the declaration of
9515 this static variable. */
9516 pushclass (DECL_CONTEXT (decl
), 2);
9518 /* Do the substitution to get the new declaration. */
9519 new_decl
= tsubst (code_pattern
, args
, /*complain=*/1, NULL_TREE
);
9521 if (TREE_CODE (decl
) == VAR_DECL
)
9523 /* Set up DECL_INITIAL, since tsubst doesn't. */
9524 DECL_INITIAL (new_decl
) =
9525 tsubst_expr (DECL_INITIAL (code_pattern
), args
,
9526 /*complain=*/1, DECL_TI_TEMPLATE (decl
));
9527 /* Pop the class context we pushed above. */
9530 else if (TREE_CODE (decl
) == FUNCTION_DECL
)
9532 /* Convince duplicate_decls to use the DECL_ARGUMENTS from the
9534 DECL_INITIAL (new_decl
) = error_mark_node
;
9535 /* And don't complain about a duplicate definition. */
9536 DECL_INITIAL (decl
) = NULL_TREE
;
9539 /* The immediate parent of the new template is still whatever it was
9540 before, even though tsubst sets DECL_TI_TEMPLATE up as the most
9541 general template. We also reset the DECL_ASSEMBLER_NAME since
9542 tsubst always calculates the name as if the function in question
9543 were really a template instance, and sometimes, with friend
9544 functions, this is not so. See tsubst_friend_function for
9546 DECL_TI_TEMPLATE (new_decl
) = DECL_TI_TEMPLATE (decl
);
9547 DECL_ASSEMBLER_NAME (new_decl
) = DECL_ASSEMBLER_NAME (decl
);
9548 DECL_RTL (new_decl
) = DECL_RTL (decl
);
9549 DECL_USE_TEMPLATE (new_decl
) = DECL_USE_TEMPLATE (decl
);
9551 /* Call duplicate decls to merge the old and new declarations. */
9552 duplicate_decls (new_decl
, decl
);
9554 /* Now, re-register the specialization. */
9555 register_specialization (decl
, gen_tmpl
, args
);
9558 /* Produce the definition of D, a _DECL generated from a template. If
9559 DEFER_OK is non-zero, then we don't have to actually do the
9560 instantiation now; we just have to do it sometime. */
9563 instantiate_decl (d
, defer_ok
)
9567 tree tmpl
= DECL_TI_TEMPLATE (d
);
9568 tree args
= DECL_TI_ARGS (d
);
9573 int pattern_defined
;
9575 const char *file
= input_filename
;
9577 /* This function should only be used to instantiate templates for
9578 functions and static member variables. */
9579 my_friendly_assert (TREE_CODE (d
) == FUNCTION_DECL
9580 || TREE_CODE (d
) == VAR_DECL
, 0);
9582 /* Don't instantiate cloned functions. Instead, instantiate the
9583 functions they cloned. */
9584 if (TREE_CODE (d
) == FUNCTION_DECL
&& DECL_CLONED_FUNCTION_P (d
))
9585 d
= DECL_CLONED_FUNCTION (d
);
9587 if (DECL_TEMPLATE_INSTANTIATED (d
))
9588 /* D has already been instantiated. It might seem reasonable to
9589 check whether or not D is an explicit instantiation, and, if so,
9590 stop here. But when an explicit instantiation is deferred
9591 until the end of the compilation, DECL_EXPLICIT_INSTANTIATION
9592 is set, even though we still need to do the instantiation. */
9595 /* If we already have a specialization of this declaration, then
9596 there's no reason to instantiate it. Note that
9597 retrieve_specialization gives us both instantiations and
9598 specializations, so we must explicitly check
9599 DECL_TEMPLATE_SPECIALIZATION. */
9600 gen_tmpl
= most_general_template (tmpl
);
9601 spec
= retrieve_specialization (gen_tmpl
, args
);
9602 if (spec
!= NULL_TREE
&& DECL_TEMPLATE_SPECIALIZATION (spec
))
9605 /* This needs to happen before any tsubsting. */
9606 if (! push_tinst_level (d
))
9609 timevar_push (TV_PARSE
);
9611 /* Set TD to the template whose DECL_TEMPLATE_RESULT is the pattern
9612 for the instantiation. This is not always the most general
9613 template. Consider, for example:
9616 struct S { template <class U> void f();
9617 template <> void f<int>(); };
9619 and an instantiation of S<double>::f<int>. We want TD to be the
9620 specialization S<T>::f<int>, not the more general S<T>::f<U>. */
9622 while (/* An instantiation cannot have a definition, so we need a
9623 more general template. */
9624 DECL_TEMPLATE_INSTANTIATION (td
)
9625 /* We must also deal with friend templates. Given:
9627 template <class T> struct S {
9628 template <class U> friend void f() {};
9631 S<int>::f<U> say, is not an instantiation of S<T>::f<U>,
9632 so far as the language is concerned, but that's still
9633 where we get the pattern for the instantiation from. On
9634 other hand, if the definition comes outside the class, say:
9636 template <class T> struct S {
9637 template <class U> friend void f();
9639 template <class U> friend void f() {}
9641 we don't need to look any further. That's what the check for
9642 DECL_INITIAL is for. */
9643 || (TREE_CODE (d
) == FUNCTION_DECL
9644 && DECL_FRIEND_PSEUDO_TEMPLATE_INSTANTIATION (td
)
9645 && !DECL_INITIAL (DECL_TEMPLATE_RESULT (td
))))
9647 /* The present template, TD, should not be a definition. If it
9648 were a definition, we should be using it! Note that we
9649 cannot restructure the loop to just keep going until we find
9650 a template with a definition, since that might go too far if
9651 a specialization was declared, but not defined. */
9652 my_friendly_assert (!(TREE_CODE (d
) == VAR_DECL
9653 && !DECL_IN_AGGR_P (DECL_TEMPLATE_RESULT (td
))),
9656 /* Fetch the more general template. */
9657 td
= DECL_TI_TEMPLATE (td
);
9660 code_pattern
= DECL_TEMPLATE_RESULT (td
);
9662 if (TREE_CODE (d
) == FUNCTION_DECL
)
9663 pattern_defined
= (DECL_SAVED_TREE (code_pattern
) != NULL_TREE
);
9665 pattern_defined
= ! DECL_IN_AGGR_P (code_pattern
);
9667 push_to_top_level ();
9668 lineno
= DECL_SOURCE_LINE (d
);
9669 input_filename
= DECL_SOURCE_FILE (d
);
9671 if (pattern_defined
)
9673 repo_template_used (d
);
9675 if (flag_external_templates
&& ! DECL_INTERFACE_KNOWN (d
))
9677 if (flag_alt_external_templates
)
9679 if (interface_unknown
)
9680 warn_if_unknown_interface (d
);
9682 else if (DECL_INTERFACE_KNOWN (code_pattern
))
9684 DECL_INTERFACE_KNOWN (d
) = 1;
9685 DECL_NOT_REALLY_EXTERN (d
) = ! DECL_EXTERNAL (code_pattern
);
9688 warn_if_unknown_interface (code_pattern
);
9692 import_export_decl (d
);
9695 /* We need to set up DECL_INITIAL regardless of pattern_defined if
9696 the variable is a static const initialized in the class body. */
9697 if (TREE_CODE (d
) == VAR_DECL
9698 && TREE_READONLY (d
)
9699 && DECL_INITIAL (d
) == NULL_TREE
9700 && DECL_INITIAL (code_pattern
) != NULL_TREE
)
9702 /* Reject all external templates except inline functions. */
9703 else if (DECL_INTERFACE_KNOWN (d
)
9704 && ! DECL_NOT_REALLY_EXTERN (d
)
9705 && ! (TREE_CODE (d
) == FUNCTION_DECL
&& DECL_INLINE (d
)))
9707 /* Defer all other templates, unless we have been explicitly
9708 forbidden from doing so. We restore the source position here
9709 because it's used by add_pending_template. */
9710 else if (! pattern_defined
|| defer_ok
)
9713 input_filename
= file
;
9715 if (at_eof
&& !pattern_defined
9716 && DECL_EXPLICIT_INSTANTIATION (d
))
9719 The definition of a non-exported function template, a
9720 non-exported member function template, or a non-exported
9721 member function or static data member of a class template
9722 shall be present in every translation unit in which it is
9723 explicitly instantiated. */
9724 cp_error ("explicit instantiation of `%D' but no definition available",
9727 add_pending_template (d
);
9731 /* We're now committed to instantiating this template. Mark it as
9732 instantiated so that recursive calls to instantiate_decl do not
9733 try to instantiate it again. */
9734 DECL_TEMPLATE_INSTANTIATED (d
) = 1;
9736 /* Regenerate the declaration in case the template has been modified
9737 by a subsequent redeclaration. */
9738 regenerate_decl_from_template (d
, td
);
9740 /* We already set the file and line above. Reset them now in case
9741 they changed as a result of calling regenerate_decl_from_template. */
9742 lineno
= DECL_SOURCE_LINE (d
);
9743 input_filename
= DECL_SOURCE_FILE (d
);
9745 if (TREE_CODE (d
) == VAR_DECL
)
9747 DECL_IN_AGGR_P (d
) = 0;
9748 if (DECL_INTERFACE_KNOWN (d
))
9749 DECL_EXTERNAL (d
) = ! DECL_NOT_REALLY_EXTERN (d
);
9752 DECL_EXTERNAL (d
) = 1;
9753 DECL_NOT_REALLY_EXTERN (d
) = 1;
9755 cp_finish_decl (d
, DECL_INITIAL (d
), NULL_TREE
, 0);
9757 else if (TREE_CODE (d
) == FUNCTION_DECL
)
9759 htab_t saved_local_specializations
;
9761 /* Save away the current list, in case we are instantiating one
9762 template from within the body of another. */
9763 saved_local_specializations
= local_specializations
;
9765 /* Set up the list of local specializations. */
9766 local_specializations
= htab_create (37,
9771 /* Set up context. */
9772 start_function (NULL_TREE
, d
, NULL_TREE
, SF_PRE_PARSED
);
9774 /* We already set up __FUNCTION__, etc., so we don't want to do
9776 function_name_declared_p
= 1;
9778 /* Substitute into the body of the function. */
9779 tsubst_expr (DECL_SAVED_TREE (code_pattern
), args
,
9780 /*complain=*/1, tmpl
);
9782 /* We don't need the local specializations any more. */
9783 htab_delete (local_specializations
);
9784 local_specializations
= saved_local_specializations
;
9786 /* Finish the function. */
9787 expand_body (finish_function (0));
9790 /* We're not deferring instantiation any more. */
9791 TI_PENDING_TEMPLATE_FLAG (DECL_TEMPLATE_INFO (d
)) = 0;
9795 input_filename
= file
;
9797 pop_from_top_level ();
9800 timevar_pop (TV_PARSE
);
9805 /* Run through the list of templates that we wish we could
9806 instantiate, and instantiate any we can. */
9809 instantiate_pending_templates ()
9812 int instantiated_something
= 0;
9819 t
= &pending_templates
;
9822 tree instantiation
= TREE_VALUE (*t
);
9824 reopen_tinst_level (TREE_PURPOSE (*t
));
9826 if (TYPE_P (instantiation
))
9830 if (!COMPLETE_TYPE_P (instantiation
))
9832 instantiate_class_template (instantiation
);
9833 if (CLASSTYPE_TEMPLATE_INSTANTIATION (instantiation
))
9834 for (fn
= TYPE_METHODS (instantiation
);
9836 fn
= TREE_CHAIN (fn
))
9837 if (! DECL_ARTIFICIAL (fn
))
9838 instantiate_decl (fn
, /*defer_ok=*/0);
9839 if (COMPLETE_TYPE_P (instantiation
))
9841 instantiated_something
= 1;
9846 if (COMPLETE_TYPE_P (instantiation
))
9847 /* If INSTANTIATION has been instantiated, then we don't
9848 need to consider it again in the future. */
9849 *t
= TREE_CHAIN (*t
);
9851 t
= &TREE_CHAIN (*t
);
9855 if (!DECL_TEMPLATE_SPECIALIZATION (instantiation
)
9856 && !DECL_TEMPLATE_INSTANTIATED (instantiation
))
9858 instantiation
= instantiate_decl (instantiation
,
9860 if (DECL_TEMPLATE_INSTANTIATED (instantiation
))
9862 instantiated_something
= 1;
9867 if (DECL_TEMPLATE_SPECIALIZATION (instantiation
)
9868 || DECL_TEMPLATE_INSTANTIATED (instantiation
))
9869 /* If INSTANTIATION has been instantiated, then we don't
9870 need to consider it again in the future. */
9871 *t
= TREE_CHAIN (*t
);
9873 t
= &TREE_CHAIN (*t
);
9876 current_tinst_level
= NULL_TREE
;
9880 /* Go through the things that are template instantiations if we are
9881 using guiding declarations. */
9882 t
= &maybe_templates
;
9889 fn
= TREE_VALUE (*t
);
9891 if (DECL_INITIAL (fn
))
9892 /* If the FN is already defined, then it was either already
9893 instantiated or, even though guiding declarations were
9894 allowed, a non-template definition was provided. */
9898 template = TREE_PURPOSE (*t
);
9899 args
= get_bindings (template, fn
, NULL_TREE
);
9900 fn
= instantiate_template (template, args
);
9901 instantiate_decl (fn
, /*defer_ok=*/0);
9905 /* Remove this entry from the chain. */
9906 *t
= TREE_CHAIN (*t
);
9908 maybe_template_tail
= t
;
9912 return instantiated_something
;
9915 /* Substitute ARGVEC into T, which is a list of initializers for
9916 either base class or a non-static data member. The TREE_PURPOSEs
9917 are DECLs, and the TREE_VALUEs are the initializer values. Used by
9918 instantiate_decl. */
9921 tsubst_initializer_list (t
, argvec
)
9924 tree first
= NULL_TREE
;
9927 for (; t
; t
= TREE_CHAIN (t
))
9933 decl
= tsubst_copy (TREE_PURPOSE (t
), argvec
, /*complain=*/1,
9935 init
= tsubst_expr (TREE_VALUE (t
), argvec
, /*complain=*/1,
9940 else if (TREE_CODE (init
) == TREE_LIST
)
9941 for (val
= init
; val
; val
= TREE_CHAIN (val
))
9942 TREE_VALUE (val
) = convert_from_reference (TREE_VALUE (val
));
9944 init
= convert_from_reference (init
);
9946 *p
= build_tree_list (decl
, init
);
9947 p
= &TREE_CHAIN (*p
);
9952 /* Set CURRENT_ACCESS_SPECIFIER based on the protection of DECL. */
9955 set_current_access_from_decl (decl
)
9958 if (TREE_PRIVATE (decl
))
9959 current_access_specifier
= access_private_node
;
9960 else if (TREE_PROTECTED (decl
))
9961 current_access_specifier
= access_protected_node
;
9963 current_access_specifier
= access_public_node
;
9966 /* Instantiate an enumerated type. TAG is the template type, NEWTAG
9967 is the instantiation (which should have been created with
9968 start_enum) and ARGS are the template arguments to use. */
9971 tsubst_enum (tag
, newtag
, args
)
9978 for (e
= TYPE_VALUES (tag
); e
; e
= TREE_CHAIN (e
))
9982 /* Note that in a template enum, the TREE_VALUE is the
9983 CONST_DECL, not the corresponding INTEGER_CST. */
9984 value
= tsubst_expr (DECL_INITIAL (TREE_VALUE (e
)),
9985 args
, /*complain=*/1,
9988 /* Give this enumeration constant the correct access. */
9989 set_current_access_from_decl (TREE_VALUE (e
));
9991 /* Actually build the enumerator itself. */
9992 build_enumerator (TREE_PURPOSE (e
), value
, newtag
);
9995 finish_enum (newtag
);
9996 DECL_SOURCE_LINE (TYPE_NAME (newtag
)) = DECL_SOURCE_LINE (TYPE_NAME (tag
));
9997 DECL_SOURCE_FILE (TYPE_NAME (newtag
)) = DECL_SOURCE_FILE (TYPE_NAME (tag
));
10000 /* DECL is a FUNCTION_DECL that is a template specialization. Return
10001 its type -- but without substituting the innermost set of template
10002 arguments. So, innermost set of template parameters will appear in
10003 the type. If CONTEXTP is non-NULL, then the partially substituted
10004 DECL_CONTEXT (if any) will also be filled in. Similarly, TPARMSP
10005 will be filled in with the substituted template parameters, if it
10009 get_mostly_instantiated_function_type (decl
, contextp
, tparmsp
)
10014 tree context
= NULL_TREE
;
10021 tmpl
= most_general_template (DECL_TI_TEMPLATE (decl
));
10022 targs
= DECL_TI_ARGS (decl
);
10023 tparms
= DECL_TEMPLATE_PARMS (tmpl
);
10024 parm_depth
= TMPL_PARMS_DEPTH (tparms
);
10026 /* There should be as many levels of arguments as there are levels
10028 my_friendly_assert (parm_depth
== TMPL_ARGS_DEPTH (targs
), 0);
10030 fn_type
= TREE_TYPE (tmpl
);
10031 if (DECL_STATIC_FUNCTION_P (decl
))
10032 context
= DECL_CONTEXT (decl
);
10034 if (parm_depth
== 1)
10035 /* No substitution is necessary. */
10042 /* Replace the innermost level of the TARGS with NULL_TREEs to
10043 let tsubst know not to substitute for those parameters. */
10044 partial_args
= make_tree_vec (TREE_VEC_LENGTH (targs
));
10045 for (i
= 1; i
< TMPL_ARGS_DEPTH (targs
); ++i
)
10046 SET_TMPL_ARGS_LEVEL (partial_args
, i
,
10047 TMPL_ARGS_LEVEL (targs
, i
));
10048 SET_TMPL_ARGS_LEVEL (partial_args
,
10049 TMPL_ARGS_DEPTH (targs
),
10050 make_tree_vec (DECL_NTPARMS (tmpl
)));
10052 /* Now, do the (partial) substitution to figure out the
10053 appropriate function type. */
10054 fn_type
= tsubst (fn_type
, partial_args
, /*complain=*/1, NULL_TREE
);
10055 if (DECL_STATIC_FUNCTION_P (decl
))
10056 context
= tsubst (context
, partial_args
, /*complain=*/1, NULL_TREE
);
10058 /* Substitute into the template parameters to obtain the real
10059 innermost set of parameters. This step is important if the
10060 innermost set of template parameters contains value
10061 parameters whose types depend on outer template parameters. */
10062 TREE_VEC_LENGTH (partial_args
)--;
10063 tparms
= tsubst_template_parms (tparms
, partial_args
, /*complain=*/1);
10067 *contextp
= context
;
10074 /* Set the DECL_ASSEMBLER_NAME for DECL, which is a FUNCTION_DECL that
10075 is either an instantiation or specialization of a template
10079 set_mangled_name_for_template_decl (decl
)
10082 tree context
= NULL_TREE
;
10089 my_friendly_assert (TREE_CODE (decl
) == FUNCTION_DECL
, 0);
10090 my_friendly_assert (DECL_TEMPLATE_INFO (decl
) != NULL_TREE
, 0);
10092 /* Under the new ABI, we don't need special machinery. */
10095 set_mangled_name_for_decl (decl
);
10099 /* The names of template functions must be mangled so as to indicate
10100 what template is being specialized with what template arguments.
10101 For example, each of the following three functions must get
10102 different mangled names:
10105 template <> void f<7>(int);
10106 template <> void f<8>(int); */
10108 targs
= DECL_TI_ARGS (decl
);
10109 if (uses_template_parms (targs
))
10110 /* This DECL is for a partial instantiation. There's no need to
10111 mangle the name of such an entity. */
10114 /* We now compute the PARMS and RET_TYPE to give to
10115 build_decl_overload_real. The PARMS and RET_TYPE are the
10116 parameter and return types of the template, after all but the
10117 innermost template arguments have been substituted, not the
10118 parameter and return types of the function DECL. For example,
10121 template <class T> T f(T);
10123 both PARMS and RET_TYPE should be `T' even if DECL is `int f(int)'.
10124 A more subtle example is:
10126 template <class T> struct S { template <class U> void f(T, U); }
10128 Here, if DECL is `void S<int>::f(int, double)', PARMS should be
10129 {int, U}. Thus, the args that we want to subsitute into the
10130 return and parameter type for the function are those in TARGS,
10131 with the innermost level omitted. */
10132 fn_type
= get_mostly_instantiated_function_type (decl
, &context
, &tparms
);
10134 /* Now, get the innermost parameters and arguments, and figure out
10135 the parameter and return types. */
10136 tparms
= INNERMOST_TEMPLATE_PARMS (tparms
);
10137 targs
= INNERMOST_TEMPLATE_ARGS (targs
);
10138 ret_type
= TREE_TYPE (fn_type
);
10139 parm_types
= TYPE_ARG_TYPES (fn_type
);
10141 /* For a static member function, we generate a fake `this' pointer,
10142 for the purposes of mangling. This indicates of which class the
10143 function is a member. Because of:
10147 There shall not be a static and a nonstatic member function
10148 with the same name and the same parameter types
10150 we don't have to worry that this will result in a clash with a
10151 non-static member function. */
10152 if (DECL_STATIC_FUNCTION_P (decl
))
10153 parm_types
= hash_tree_chain (build_pointer_type (context
), parm_types
);
10155 /* There should be the same number of template parameters as
10156 template arguments. */
10157 my_friendly_assert (TREE_VEC_LENGTH (tparms
) == TREE_VEC_LENGTH (targs
),
10160 /* Actually set the DECL_ASSEMBLER_NAME. */
10161 DECL_ASSEMBLER_NAME (decl
)
10162 = build_decl_overload_real (decl
, parm_types
, ret_type
,
10164 DECL_FUNCTION_MEMBER_P (decl
)
10165 + DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (decl
));
10168 /* Return truthvalue if we're processing a template different from
10169 the last one involved in diagnostics. */
10171 problematic_instantiation_changed ()
10173 return last_template_error_tick
!= tinst_level_tick
;
10176 /* Remember current template involved in diagnostics. */
10178 record_last_problematic_instantiation ()
10180 last_template_error_tick
= tinst_level_tick
;
10184 current_instantiation ()
10186 return current_tinst_level
;