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 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 ((char *, tree
, tree
));
106 static tree tsubst_expr_values
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 tree try_class_unification
PARAMS ((tree
, tree
, tree
, tree
));
161 static int coerce_template_template_parms
PARAMS ((tree
, tree
, int,
163 static tree determine_specialization
PARAMS ((tree
, tree
, tree
*, int));
164 static int template_args_equal
PARAMS ((tree
, tree
));
165 static void print_template_context
PARAMS ((int));
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 SET_DECL_ARTIFICIAL (decl
);
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 preceeded 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_speciailization, 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 cp_error ("template-id `%D' in declaration of primary template",
1307 if (ctype
&& CLASSTYPE_TEMPLATE_INSTANTIATION (ctype
))
1308 /* This is a specialization of a member template, without
1309 specialization the containing class. Something like:
1311 template <class T> struct S {
1312 template <class U> void f (U);
1314 template <> template <class U> void S<int>::f(U) {}
1316 That's a specialization -- but of the entire template. */
1321 my_friendly_abort (20000309);
1324 if (specialization
|| member_specialization
)
1326 tree t
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
1327 for (; t
; t
= TREE_CHAIN (t
))
1328 if (TREE_PURPOSE (t
))
1331 ("default argument specified in explicit specialization");
1334 if (current_lang_name
== lang_name_c
)
1335 cp_error ("template specialization with C linkage");
1338 if (specialization
|| member_specialization
|| explicit_instantiation
)
1340 tree tmpl
= NULL_TREE
;
1341 tree targs
= NULL_TREE
;
1343 /* Make sure that the declarator is a TEMPLATE_ID_EXPR. */
1344 if (TREE_CODE (declarator
) != TEMPLATE_ID_EXPR
)
1348 my_friendly_assert (TREE_CODE (declarator
) == IDENTIFIER_NODE
,
1351 fns
= IDENTIFIER_NAMESPACE_VALUE (dname
);
1356 lookup_template_function (fns
, NULL_TREE
);
1359 if (declarator
== error_mark_node
)
1360 return error_mark_node
;
1362 if (ctype
!= NULL_TREE
&& TYPE_BEING_DEFINED (ctype
))
1364 if (!explicit_instantiation
)
1365 /* A specialization in class scope. This is illegal,
1366 but the error will already have been flagged by
1367 check_specialization_scope. */
1368 return error_mark_node
;
1371 /* It's not legal to write an explicit instantiation in
1374 class C { template void f(); }
1376 This case is caught by the parser. However, on
1379 template class C { void f(); };
1381 (which is illegal) we can get here. The error will be
1388 else if (TREE_CODE (TREE_OPERAND (declarator
, 0)) == LOOKUP_EXPR
)
1390 /* A friend declaration. We can't do much, because we don't
1391 know what this resolves to, yet. */
1392 my_friendly_assert (is_friend
!= 0, 0);
1393 my_friendly_assert (!explicit_instantiation
, 0);
1394 SET_DECL_IMPLICIT_INSTANTIATION (decl
);
1397 else if (ctype
!= NULL_TREE
1398 && (TREE_CODE (TREE_OPERAND (declarator
, 0)) ==
1401 /* Find the list of functions in ctype that have the same
1402 name as the declared function. */
1403 tree name
= TREE_OPERAND (declarator
, 0);
1404 tree fns
= NULL_TREE
;
1407 if (name
== constructor_name (ctype
)
1408 || name
== constructor_name_full (ctype
))
1410 int is_constructor
= DECL_CONSTRUCTOR_P (decl
);
1412 if (is_constructor
? !TYPE_HAS_CONSTRUCTOR (ctype
)
1413 : !TYPE_HAS_DESTRUCTOR (ctype
))
1415 /* From [temp.expl.spec]:
1417 If such an explicit specialization for the member
1418 of a class template names an implicitly-declared
1419 special member function (clause _special_), the
1420 program is ill-formed.
1422 Similar language is found in [temp.explicit]. */
1423 cp_error ("specialization of implicitly-declared special member function");
1424 return error_mark_node
;
1427 name
= is_constructor
? ctor_identifier
: dtor_identifier
;
1430 if (!DECL_CONV_FN_P (decl
))
1432 idx
= lookup_fnfields_1 (ctype
, name
);
1434 fns
= TREE_VEC_ELT (CLASSTYPE_METHOD_VEC (ctype
), idx
);
1440 /* For a type-conversion operator, we cannot do a
1441 name-based lookup. We might be looking for `operator
1442 int' which will be a specialization of `operator T'.
1443 So, we find *all* the conversion operators, and then
1444 select from them. */
1447 methods
= CLASSTYPE_METHOD_VEC (ctype
);
1449 for (idx
= 2; idx
< TREE_VEC_LENGTH (methods
); ++idx
)
1451 tree ovl
= TREE_VEC_ELT (methods
, idx
);
1453 if (!ovl
|| !DECL_CONV_FN_P (OVL_CURRENT (ovl
)))
1454 /* There are no more conversion functions. */
1457 /* Glue all these conversion functions together
1458 with those we already have. */
1459 for (; ovl
; ovl
= OVL_NEXT (ovl
))
1460 fns
= ovl_cons (OVL_CURRENT (ovl
), fns
);
1464 if (fns
== NULL_TREE
)
1466 cp_error ("no member function `%D' declared in `%T'",
1468 return error_mark_node
;
1471 TREE_OPERAND (declarator
, 0) = fns
;
1474 /* Figure out what exactly is being specialized at this point.
1475 Note that for an explicit instantiation, even one for a
1476 member function, we cannot tell apriori whether the
1477 instantiation is for a member template, or just a member
1478 function of a template class. Even if a member template is
1479 being instantiated, the member template arguments may be
1480 elided if they can be deduced from the rest of the
1482 tmpl
= determine_specialization (declarator
, decl
,
1484 member_specialization
);
1486 if (!tmpl
|| tmpl
== error_mark_node
)
1487 /* We couldn't figure out what this declaration was
1489 return error_mark_node
;
1492 tree gen_tmpl
= most_general_template (tmpl
);
1494 if (explicit_instantiation
)
1496 /* We don't set DECL_EXPLICIT_INSTANTIATION here; that
1497 is done by do_decl_instantiation later. */
1499 int arg_depth
= TMPL_ARGS_DEPTH (targs
);
1500 int parm_depth
= TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl
));
1502 if (arg_depth
> parm_depth
)
1504 /* If TMPL is not the most general template (for
1505 example, if TMPL is a friend template that is
1506 injected into namespace scope), then there will
1507 be too many levels fo TARGS. Remove some of them
1512 new_targs
= make_tree_vec (parm_depth
);
1513 for (i
= arg_depth
- parm_depth
; i
< arg_depth
; ++i
)
1514 TREE_VEC_ELT (new_targs
, i
- (arg_depth
- parm_depth
))
1515 = TREE_VEC_ELT (targs
, i
);
1519 return instantiate_template (tmpl
, targs
);
1522 /* If this is a specialization of a member template of a
1523 template class. In we want to return the TEMPLATE_DECL,
1524 not the specialization of it. */
1525 if (tsk
== tsk_template
)
1527 SET_DECL_TEMPLATE_SPECIALIZATION (tmpl
);
1528 DECL_INITIAL (DECL_TEMPLATE_RESULT (tmpl
)) = NULL_TREE
;
1532 /* If we though that the DECL was a member function, but it
1533 turns out to be specializing a static member function,
1534 make DECL a static member function as well. */
1535 if (DECL_STATIC_FUNCTION_P (tmpl
)
1536 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
1538 revert_static_member_fn (decl
);
1539 last_function_parms
= TREE_CHAIN (last_function_parms
);
1542 /* Set up the DECL_TEMPLATE_INFO for DECL. */
1543 DECL_TEMPLATE_INFO (decl
) = tree_cons (tmpl
, targs
, NULL_TREE
);
1545 /* Mangle the function name appropriately. Note that we do
1546 not mangle specializations of non-template member
1547 functions of template classes, e.g. with
1549 template <class T> struct S { void f(); }
1551 and given the specialization
1553 template <> void S<int>::f() {}
1555 we do not mangle S<int>::f() here. That's because it's
1556 just an ordinary member function and doesn't need special
1557 treatment. We do this here so that the ordinary,
1558 non-template, name-mangling algorithm will not be used
1560 if ((is_member_template (tmpl
) || ctype
== NULL_TREE
)
1561 && name_mangling_version
>= 1)
1562 set_mangled_name_for_template_decl (decl
);
1564 if (is_friend
&& !have_def
)
1565 /* This is not really a declaration of a specialization.
1566 It's just the name of an instantiation. But, it's not
1567 a request for an instantiation, either. */
1568 SET_DECL_IMPLICIT_INSTANTIATION (decl
);
1570 /* Register this specialization so that we can find it
1572 decl
= register_specialization (decl
, gen_tmpl
, targs
);
1579 /* TYPE is being declared. Verify that the use of template headers
1580 and such is reasonable. Issue error messages if not. */
1583 maybe_check_template_type (type
)
1586 if (template_header_count
)
1588 /* We are in the scope of some `template <...>' header. */
1591 = template_class_depth_real (TYPE_CONTEXT (type
),
1592 /*count_specializations=*/1);
1594 if (template_header_count
<= context_depth
)
1595 /* This is OK; the template headers are for the context. We
1596 are actually too lenient here; like
1597 check_explicit_specialization we should consider the number
1598 of template types included in the actual declaration. For
1601 template <class T> struct S {
1602 template <class U> template <class V>
1608 template <class T> struct S {
1609 template <class U> struct I;
1612 template <class T> template <class U.
1617 else if (template_header_count
> context_depth
+ 1)
1618 /* There are two many template parameter lists. */
1619 cp_error ("too many template parameter lists in declaration of `%T'", type
);
1623 /* Returns 1 iff PARMS1 and PARMS2 are identical sets of template
1624 parameters. These are represented in the same format used for
1625 DECL_TEMPLATE_PARMS. */
1627 int comp_template_parms (parms1
, parms2
)
1634 if (parms1
== parms2
)
1637 for (p1
= parms1
, p2
= parms2
;
1638 p1
!= NULL_TREE
&& p2
!= NULL_TREE
;
1639 p1
= TREE_CHAIN (p1
), p2
= TREE_CHAIN (p2
))
1641 tree t1
= TREE_VALUE (p1
);
1642 tree t2
= TREE_VALUE (p2
);
1645 my_friendly_assert (TREE_CODE (t1
) == TREE_VEC
, 0);
1646 my_friendly_assert (TREE_CODE (t2
) == TREE_VEC
, 0);
1648 if (TREE_VEC_LENGTH (t1
) != TREE_VEC_LENGTH (t2
))
1651 for (i
= 0; i
< TREE_VEC_LENGTH (t2
); ++i
)
1653 tree parm1
= TREE_VALUE (TREE_VEC_ELT (t1
, i
));
1654 tree parm2
= TREE_VALUE (TREE_VEC_ELT (t2
, i
));
1656 if (TREE_CODE (parm1
) != TREE_CODE (parm2
))
1659 if (TREE_CODE (parm1
) == TEMPLATE_TYPE_PARM
)
1661 else if (!same_type_p (TREE_TYPE (parm1
), TREE_TYPE (parm2
)))
1666 if ((p1
!= NULL_TREE
) != (p2
!= NULL_TREE
))
1667 /* One set of parameters has more parameters lists than the
1674 /* Complain if DECL shadows a template parameter.
1676 [temp.local]: A template-parameter shall not be redeclared within its
1677 scope (including nested scopes). */
1680 check_template_shadow (decl
)
1685 /* If we're not in a template, we can't possibly shadow a template
1687 if (!current_template_parms
)
1690 /* Figure out what we're shadowing. */
1691 if (TREE_CODE (decl
) == OVERLOAD
)
1692 decl
= OVL_CURRENT (decl
);
1693 olddecl
= IDENTIFIER_VALUE (DECL_NAME (decl
));
1695 /* If there's no previous binding for this name, we're not shadowing
1696 anything, let alone a template parameter. */
1700 /* If we're not shadowing a template parameter, we're done. Note
1701 that OLDDECL might be an OVERLOAD (or perhaps even an
1702 ERROR_MARK), so we can't just blithely assume it to be a _DECL
1704 if (!DECL_P (olddecl
) || !DECL_TEMPLATE_PARM_P (olddecl
))
1707 /* We check for decl != olddecl to avoid bogus errors for using a
1708 name inside a class. We check TPFI to avoid duplicate errors for
1709 inline member templates. */
1711 || TEMPLATE_PARMS_FOR_INLINE (current_template_parms
))
1714 cp_error_at ("declaration of `%#D'", decl
);
1715 cp_error_at (" shadows template parm `%#D'", olddecl
);
1718 /* Return a new TEMPLATE_PARM_INDEX with the indicated INDEX, LEVEL,
1719 ORIG_LEVEL, DECL, and TYPE. */
1722 build_template_parm_index (index
, level
, orig_level
, decl
, type
)
1729 tree t
= make_node (TEMPLATE_PARM_INDEX
);
1730 TEMPLATE_PARM_IDX (t
) = index
;
1731 TEMPLATE_PARM_LEVEL (t
) = level
;
1732 TEMPLATE_PARM_ORIG_LEVEL (t
) = orig_level
;
1733 TEMPLATE_PARM_DECL (t
) = decl
;
1734 TREE_TYPE (t
) = type
;
1739 /* Return a TEMPLATE_PARM_INDEX, similar to INDEX, but whose
1740 TEMPLATE_PARM_LEVEL has been decreased by LEVELS. If such a
1741 TEMPLATE_PARM_INDEX already exists, it is returned; otherwise, a
1742 new one is created. */
1745 reduce_template_parm_level (index
, type
, levels
)
1750 if (TEMPLATE_PARM_DESCENDANTS (index
) == NULL_TREE
1751 || (TEMPLATE_PARM_LEVEL (TEMPLATE_PARM_DESCENDANTS (index
))
1752 != TEMPLATE_PARM_LEVEL (index
) - levels
))
1755 = build_decl (TREE_CODE (TEMPLATE_PARM_DECL (index
)),
1756 DECL_NAME (TEMPLATE_PARM_DECL (index
)),
1759 = build_template_parm_index (TEMPLATE_PARM_IDX (index
),
1760 TEMPLATE_PARM_LEVEL (index
) - levels
,
1761 TEMPLATE_PARM_ORIG_LEVEL (index
),
1763 TEMPLATE_PARM_DESCENDANTS (index
) = t
;
1765 /* Template template parameters need this. */
1766 DECL_TEMPLATE_PARMS (decl
)
1767 = DECL_TEMPLATE_PARMS (TEMPLATE_PARM_DECL (index
));
1770 return TEMPLATE_PARM_DESCENDANTS (index
);
1773 /* Process information from new template parameter NEXT and append it to the
1774 LIST being built. */
1777 process_template_parm (list
, next
)
1786 my_friendly_assert (TREE_CODE (parm
) == TREE_LIST
, 259);
1787 defval
= TREE_PURPOSE (parm
);
1788 parm
= TREE_VALUE (parm
);
1789 is_type
= TREE_PURPOSE (parm
) == class_type_node
;
1793 tree p
= TREE_VALUE (tree_last (list
));
1795 if (TREE_CODE (p
) == TYPE_DECL
)
1796 idx
= TEMPLATE_TYPE_IDX (TREE_TYPE (p
));
1797 else if (TREE_CODE (p
) == TEMPLATE_DECL
)
1798 idx
= TEMPLATE_TYPE_IDX (TREE_TYPE (DECL_TEMPLATE_RESULT (p
)));
1800 idx
= TEMPLATE_PARM_IDX (DECL_INITIAL (p
));
1808 my_friendly_assert (TREE_CODE (TREE_PURPOSE (parm
)) == TREE_LIST
, 260);
1809 /* is a const-param */
1810 parm
= grokdeclarator (TREE_VALUE (parm
), TREE_PURPOSE (parm
),
1811 PARM
, 0, NULL_TREE
);
1815 The top-level cv-qualifiers on the template-parameter are
1816 ignored when determining its type. */
1817 TREE_TYPE (parm
) = TYPE_MAIN_VARIANT (TREE_TYPE (parm
));
1819 /* A template parameter is not modifiable. */
1820 TREE_READONLY (parm
) = 1;
1821 if (IS_AGGR_TYPE (TREE_TYPE (parm
))
1822 && TREE_CODE (TREE_TYPE (parm
)) != TEMPLATE_TYPE_PARM
1823 && TREE_CODE (TREE_TYPE (parm
)) != TYPENAME_TYPE
)
1825 cp_error ("`%#T' is not a valid type for a template constant parameter",
1827 if (DECL_NAME (parm
) == NULL_TREE
)
1828 error (" a template type parameter must begin with `class' or `typename'");
1829 TREE_TYPE (parm
) = void_type_node
;
1832 && (TREE_CODE (TREE_TYPE (parm
)) == REAL_TYPE
1833 || TREE_CODE (TREE_TYPE (parm
)) == COMPLEX_TYPE
))
1834 cp_pedwarn ("`%T' is not a valid type for a template constant parameter",
1836 decl
= build_decl (CONST_DECL
, DECL_NAME (parm
), TREE_TYPE (parm
));
1837 DECL_INITIAL (parm
) = DECL_INITIAL (decl
)
1838 = build_template_parm_index (idx
, processing_template_decl
,
1839 processing_template_decl
,
1840 decl
, TREE_TYPE (parm
));
1845 parm
= TREE_VALUE (parm
);
1847 if (parm
&& TREE_CODE (parm
) == TEMPLATE_DECL
)
1849 t
= make_aggr_type (TEMPLATE_TEMPLATE_PARM
);
1850 /* This is for distinguishing between real templates and template
1851 template parameters */
1852 TREE_TYPE (parm
) = t
;
1853 TREE_TYPE (DECL_TEMPLATE_RESULT (parm
)) = t
;
1858 t
= make_aggr_type (TEMPLATE_TYPE_PARM
);
1859 /* parm is either IDENTIFIER_NODE or NULL_TREE */
1860 decl
= build_decl (TYPE_DECL
, parm
, t
);
1863 TYPE_NAME (t
) = decl
;
1864 TYPE_STUB_DECL (t
) = decl
;
1866 TEMPLATE_TYPE_PARM_INDEX (t
)
1867 = build_template_parm_index (idx
, processing_template_decl
,
1868 processing_template_decl
,
1869 decl
, TREE_TYPE (parm
));
1871 SET_DECL_ARTIFICIAL (decl
);
1872 SET_DECL_TEMPLATE_PARM_P (decl
);
1874 parm
= build_tree_list (defval
, parm
);
1875 return chainon (list
, parm
);
1878 /* The end of a template parameter list has been reached. Process the
1879 tree list into a parameter vector, converting each parameter into a more
1880 useful form. Type parameters are saved as IDENTIFIER_NODEs, and others
1884 end_template_parm_list (parms
)
1889 tree saved_parmlist
= make_tree_vec (list_length (parms
));
1891 current_template_parms
1892 = tree_cons (build_int_2 (0, processing_template_decl
),
1893 saved_parmlist
, current_template_parms
);
1895 for (parm
= parms
, nparms
= 0;
1897 parm
= TREE_CHAIN (parm
), nparms
++)
1898 TREE_VEC_ELT (saved_parmlist
, nparms
) = parm
;
1900 --processing_template_parmlist
;
1902 return saved_parmlist
;
1905 /* end_template_decl is called after a template declaration is seen. */
1908 end_template_decl ()
1910 reset_specialization ();
1912 if (! processing_template_decl
)
1915 /* This matches the pushlevel in begin_template_parm_list. */
1918 --processing_template_decl
;
1919 current_template_parms
= TREE_CHAIN (current_template_parms
);
1922 /* Given a template argument vector containing the template PARMS.
1923 The innermost PARMS are given first. */
1926 current_template_args ()
1929 tree args
= NULL_TREE
;
1930 int length
= TMPL_PARMS_DEPTH (current_template_parms
);
1933 /* If there is only one level of template parameters, we do not
1934 create a TREE_VEC of TREE_VECs. Instead, we return a single
1935 TREE_VEC containing the arguments. */
1937 args
= make_tree_vec (length
);
1939 for (header
= current_template_parms
; header
; header
= TREE_CHAIN (header
))
1941 tree a
= copy_node (TREE_VALUE (header
));
1944 TREE_TYPE (a
) = NULL_TREE
;
1945 for (i
= TREE_VEC_LENGTH (a
) - 1; i
>= 0; --i
)
1947 tree t
= TREE_VEC_ELT (a
, i
);
1949 /* T will be a list if we are called from within a
1950 begin/end_template_parm_list pair, but a vector directly
1951 if within a begin/end_member_template_processing pair. */
1952 if (TREE_CODE (t
) == TREE_LIST
)
1956 if (TREE_CODE (t
) == TYPE_DECL
1957 || TREE_CODE (t
) == TEMPLATE_DECL
)
1960 t
= DECL_INITIAL (t
);
1961 TREE_VEC_ELT (a
, i
) = t
;
1966 TREE_VEC_ELT (args
, --l
) = a
;
1974 /* Return a TEMPLATE_DECL corresponding to DECL, using the indicated
1975 template PARMS. Used by push_template_decl below. */
1978 build_template_decl (decl
, parms
)
1982 tree tmpl
= build_lang_decl (TEMPLATE_DECL
, DECL_NAME (decl
), NULL_TREE
);
1983 DECL_TEMPLATE_PARMS (tmpl
) = parms
;
1984 DECL_CONTEXT (tmpl
) = DECL_CONTEXT (decl
);
1985 if (DECL_LANG_SPECIFIC (decl
))
1987 DECL_VIRTUAL_CONTEXT (tmpl
) = DECL_VIRTUAL_CONTEXT (decl
);
1988 DECL_STATIC_FUNCTION_P (tmpl
) = DECL_STATIC_FUNCTION_P (decl
);
1989 DECL_CONSTRUCTOR_P (tmpl
) = DECL_CONSTRUCTOR_P (decl
);
1990 DECL_NONCONVERTING_P (tmpl
) = DECL_NONCONVERTING_P (decl
);
1991 DECL_ASSIGNMENT_OPERATOR_P (tmpl
) = DECL_ASSIGNMENT_OPERATOR_P (decl
);
1992 if (DECL_OVERLOADED_OPERATOR_P (decl
))
1993 SET_OVERLOADED_OPERATOR_CODE (tmpl
,
1994 DECL_OVERLOADED_OPERATOR_P (decl
));
2000 struct template_parm_data
2002 /* The level of the template parameters we are currently
2006 /* The index of the specialization argument we are currently
2010 /* An array whose size is the number of template parameters. The
2011 elements are non-zero if the parameter has been used in any one
2012 of the arguments processed so far. */
2015 /* An array whose size is the number of template arguments. The
2016 elements are non-zero if the argument makes use of template
2017 parameters of this level. */
2018 int* arg_uses_template_parms
;
2021 /* Subroutine of push_template_decl used to see if each template
2022 parameter in a partial specialization is used in the explicit
2023 argument list. If T is of the LEVEL given in DATA (which is
2024 treated as a template_parm_data*), then DATA->PARMS is marked
2028 mark_template_parm (t
, data
)
2034 struct template_parm_data
* tpd
= (struct template_parm_data
*) data
;
2036 if (TREE_CODE (t
) == TEMPLATE_PARM_INDEX
)
2038 level
= TEMPLATE_PARM_LEVEL (t
);
2039 idx
= TEMPLATE_PARM_IDX (t
);
2043 level
= TEMPLATE_TYPE_LEVEL (t
);
2044 idx
= TEMPLATE_TYPE_IDX (t
);
2047 if (level
== tpd
->level
)
2049 tpd
->parms
[idx
] = 1;
2050 tpd
->arg_uses_template_parms
[tpd
->current_arg
] = 1;
2053 /* Return zero so that for_each_template_parm will continue the
2054 traversal of the tree; we want to mark *every* template parm. */
2058 /* Process the partial specialization DECL. */
2061 process_partial_specialization (decl
)
2064 tree type
= TREE_TYPE (decl
);
2065 tree maintmpl
= CLASSTYPE_TI_TEMPLATE (type
);
2066 tree specargs
= CLASSTYPE_TI_ARGS (type
);
2067 tree inner_args
= INNERMOST_TEMPLATE_ARGS (specargs
);
2068 tree inner_parms
= INNERMOST_TEMPLATE_PARMS (current_template_parms
);
2069 tree main_inner_parms
= DECL_INNERMOST_TEMPLATE_PARMS (maintmpl
);
2070 int nargs
= TREE_VEC_LENGTH (inner_args
);
2071 int ntparms
= TREE_VEC_LENGTH (inner_parms
);
2073 int did_error_intro
= 0;
2074 struct template_parm_data tpd
;
2075 struct template_parm_data tpd2
;
2077 /* We check that each of the template parameters given in the
2078 partial specialization is used in the argument list to the
2079 specialization. For example:
2081 template <class T> struct S;
2082 template <class T> struct S<T*>;
2084 The second declaration is OK because `T*' uses the template
2085 parameter T, whereas
2087 template <class T> struct S<int>;
2089 is no good. Even trickier is:
2100 The S2<T> declaration is actually illegal; it is a
2101 full-specialization. Of course,
2104 struct S2<T (*)(U)>;
2106 or some such would have been OK. */
2107 tpd
.level
= TMPL_PARMS_DEPTH (current_template_parms
);
2108 tpd
.parms
= alloca (sizeof (int) * ntparms
);
2109 bzero ((PTR
) tpd
.parms
, sizeof (int) * ntparms
);
2111 tpd
.arg_uses_template_parms
= alloca (sizeof (int) * nargs
);
2112 bzero ((PTR
) tpd
.arg_uses_template_parms
, sizeof (int) * nargs
);
2113 for (i
= 0; i
< nargs
; ++i
)
2115 tpd
.current_arg
= i
;
2116 for_each_template_parm (TREE_VEC_ELT (inner_args
, i
),
2117 &mark_template_parm
,
2120 for (i
= 0; i
< ntparms
; ++i
)
2121 if (tpd
.parms
[i
] == 0)
2123 /* One of the template parms was not used in the
2125 if (!did_error_intro
)
2127 cp_error ("template parameters not used in partial specialization:");
2128 did_error_intro
= 1;
2132 TREE_VALUE (TREE_VEC_ELT (inner_parms
, i
)));
2135 /* [temp.class.spec]
2137 The argument list of the specialization shall not be identical to
2138 the implicit argument list of the primary template. */
2139 if (comp_template_args
2141 INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (TREE_TYPE
2143 cp_error ("partial specialization `%T' does not specialize any template arguments", type
);
2145 /* [temp.class.spec]
2147 A partially specialized non-type argument expression shall not
2148 involve template parameters of the partial specialization except
2149 when the argument expression is a simple identifier.
2151 The type of a template parameter corresponding to a specialized
2152 non-type argument shall not be dependent on a parameter of the
2154 my_friendly_assert (nargs
== DECL_NTPARMS (maintmpl
), 0);
2156 for (i
= 0; i
< nargs
; ++i
)
2158 tree arg
= TREE_VEC_ELT (inner_args
, i
);
2159 if (/* These first two lines are the `non-type' bit. */
2161 && TREE_CODE (arg
) != TEMPLATE_DECL
2162 /* This next line is the `argument expression is not just a
2163 simple identifier' condition and also the `specialized
2164 non-type argument' bit. */
2165 && TREE_CODE (arg
) != TEMPLATE_PARM_INDEX
)
2167 if (tpd
.arg_uses_template_parms
[i
])
2168 cp_error ("template argument `%E' involves template parameter(s)", arg
);
2171 /* Look at the corresponding template parameter,
2172 marking which template parameters its type depends
2175 TREE_TYPE (TREE_VALUE (TREE_VEC_ELT (main_inner_parms
,
2180 /* We haven't yet initialized TPD2. Do so now. */
2181 tpd2
.arg_uses_template_parms
2182 = (int*) alloca (sizeof (int) * nargs
);
2183 /* The number of parameters here is the number in the
2184 main template, which, as checked in the assertion
2186 tpd2
.parms
= (int*) alloca (sizeof (int) * nargs
);
2188 TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (maintmpl
));
2191 /* Mark the template parameters. But this time, we're
2192 looking for the template parameters of the main
2193 template, not in the specialization. */
2194 tpd2
.current_arg
= i
;
2195 tpd2
.arg_uses_template_parms
[i
] = 0;
2196 bzero ((PTR
) tpd2
.parms
, sizeof (int) * nargs
);
2197 for_each_template_parm (type
,
2198 &mark_template_parm
,
2201 if (tpd2
.arg_uses_template_parms
[i
])
2203 /* The type depended on some template parameters.
2204 If they are fully specialized in the
2205 specialization, that's OK. */
2207 for (j
= 0; j
< nargs
; ++j
)
2208 if (tpd2
.parms
[j
] != 0
2209 && tpd
.arg_uses_template_parms
[j
])
2211 cp_error ("type `%T' of template argument `%E' depends on template parameter(s)",
2221 if (retrieve_specialization (maintmpl
, specargs
))
2222 /* We've already got this specialization. */
2225 DECL_TEMPLATE_SPECIALIZATIONS (maintmpl
)
2226 = tree_cons (inner_args
, inner_parms
,
2227 DECL_TEMPLATE_SPECIALIZATIONS (maintmpl
));
2228 TREE_TYPE (DECL_TEMPLATE_SPECIALIZATIONS (maintmpl
)) = type
;
2232 /* Check that a template declaration's use of default arguments is not
2233 invalid. Here, PARMS are the template parameters. IS_PRIMARY is
2234 non-zero if DECL is the thing declared by a primary template.
2235 IS_PARTIAL is non-zero if DECL is a partial specialization. */
2238 check_default_tmpl_args (decl
, parms
, is_primary
, is_partial
)
2245 int last_level_to_check
;
2250 A default template-argument shall not be specified in a
2251 function template declaration or a function template definition, nor
2252 in the template-parameter-list of the definition of a member of a
2255 if (TREE_CODE (CP_DECL_CONTEXT (decl
)) == FUNCTION_DECL
)
2256 /* You can't have a function template declaration in a local
2257 scope, nor you can you define a member of a class template in a
2261 if (current_class_type
2262 && !TYPE_BEING_DEFINED (current_class_type
)
2263 && DECL_LANG_SPECIFIC (decl
)
2264 /* If this is either a friend defined in the scope of the class
2265 or a member function. */
2266 && ((DECL_CONTEXT (decl
)
2267 && same_type_p (DECL_CONTEXT (decl
), current_class_type
))
2268 || (DECL_FRIEND_CONTEXT (decl
)
2269 && same_type_p (DECL_FRIEND_CONTEXT (decl
),
2270 current_class_type
)))
2271 /* And, if it was a member function, it really was defined in
2272 the scope of the class. */
2273 && (!DECL_FUNCTION_MEMBER_P (decl
) || DECL_DEFINED_IN_CLASS_P (decl
)))
2274 /* We already checked these parameters when the template was
2275 declared, so there's no need to do it again now. This function
2276 was defined in class scope, but we're processing it's body now
2277 that the class is complete. */
2282 If a template-parameter has a default template-argument, all
2283 subsequent template-parameters shall have a default
2284 template-argument supplied. */
2285 for (parm_level
= parms
; parm_level
; parm_level
= TREE_CHAIN (parm_level
))
2287 tree inner_parms
= TREE_VALUE (parm_level
);
2288 int ntparms
= TREE_VEC_LENGTH (inner_parms
);
2289 int seen_def_arg_p
= 0;
2292 for (i
= 0; i
< ntparms
; ++i
)
2294 tree parm
= TREE_VEC_ELT (inner_parms
, i
);
2295 if (TREE_PURPOSE (parm
))
2297 else if (seen_def_arg_p
)
2299 cp_error ("no default argument for `%D'", TREE_VALUE (parm
));
2300 /* For better subsequent error-recovery, we indicate that
2301 there should have been a default argument. */
2302 TREE_PURPOSE (parm
) = error_mark_node
;
2307 if (TREE_CODE (decl
) != TYPE_DECL
|| is_partial
|| !is_primary
)
2308 /* For an ordinary class template, default template arguments are
2309 allowed at the innermost level, e.g.:
2310 template <class T = int>
2312 but, in a partial specialization, they're not allowed even
2313 there, as we have in [temp.class.spec]:
2315 The template parameter list of a specialization shall not
2316 contain default template argument values.
2318 So, for a partial specialization, or for a function template,
2319 we look at all of them. */
2322 /* But, for a primary class template that is not a partial
2323 specialization we look at all template parameters except the
2325 parms
= TREE_CHAIN (parms
);
2327 /* Figure out what error message to issue. */
2328 if (TREE_CODE (decl
) == FUNCTION_DECL
)
2329 msg
= "default argument for template parameter in function template `%D'";
2330 else if (is_partial
)
2331 msg
= "default argument in partial specialization `%D'";
2333 msg
= "default argument for template parameter for class enclosing `%D'";
2335 if (current_class_type
&& TYPE_BEING_DEFINED (current_class_type
))
2336 /* If we're inside a class definition, there's no need to
2337 examine the parameters to the class itself. On the one
2338 hand, they will be checked when the class is defined, and,
2339 on the other, default arguments are legal in things like:
2340 template <class T = double>
2341 struct S { template <class U> void f(U); };
2342 Here the default argument for `S' has no bearing on the
2343 declaration of `f'. */
2344 last_level_to_check
= template_class_depth (current_class_type
) + 1;
2346 /* Check everything. */
2347 last_level_to_check
= 0;
2349 for (parm_level
= parms
;
2350 parm_level
&& TMPL_PARMS_DEPTH (parm_level
) >= last_level_to_check
;
2351 parm_level
= TREE_CHAIN (parm_level
))
2353 tree inner_parms
= TREE_VALUE (parm_level
);
2357 ntparms
= TREE_VEC_LENGTH (inner_parms
);
2358 for (i
= 0; i
< ntparms
; ++i
)
2359 if (TREE_PURPOSE (TREE_VEC_ELT (inner_parms
, i
)))
2363 cp_error (msg
, decl
);
2367 /* Clear out the default argument so that we are not
2369 TREE_PURPOSE (TREE_VEC_ELT (inner_parms
, i
)) = NULL_TREE
;
2372 /* At this point, if we're still interested in issuing messages,
2373 they must apply to classes surrounding the object declared. */
2375 msg
= "default argument for template parameter for class enclosing `%D'";
2379 /* Creates a TEMPLATE_DECL for the indicated DECL using the template
2380 parameters given by current_template_args, or reuses a
2381 previously existing one, if appropriate. Returns the DECL, or an
2382 equivalent one, if it is replaced via a call to duplicate_decls.
2384 If IS_FRIEND is non-zero, DECL is a friend declaration. */
2387 push_template_decl_real (decl
, is_friend
)
2397 int new_template_p
= 0;
2399 /* See if this is a partial specialization. */
2400 is_partial
= (DECL_IMPLICIT_TYPEDEF_P (decl
)
2401 && TREE_CODE (TREE_TYPE (decl
)) != ENUMERAL_TYPE
2402 && CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_TYPE (decl
)));
2404 is_friend
|= (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_FRIEND_P (decl
));
2407 /* For a friend, we want the context of the friend function, not
2408 the type of which it is a friend. */
2409 ctx
= DECL_CONTEXT (decl
);
2410 else if (CP_DECL_CONTEXT (decl
)
2411 && TREE_CODE (CP_DECL_CONTEXT (decl
)) != NAMESPACE_DECL
)
2412 /* In the case of a virtual function, we want the class in which
2414 ctx
= CP_DECL_CONTEXT (decl
);
2416 /* Otherwise, if we're currently definining some class, the DECL
2417 is assumed to be a member of the class. */
2418 ctx
= current_scope ();
2420 if (ctx
&& TREE_CODE (ctx
) == NAMESPACE_DECL
)
2423 if (!DECL_CONTEXT (decl
))
2424 DECL_CONTEXT (decl
) = FROB_CONTEXT (current_namespace
);
2426 /* See if this is a primary template. */
2427 primary
= template_parm_scope_p ();
2431 if (current_lang_name
== lang_name_c
)
2432 cp_error ("template with C linkage");
2433 else if (TREE_CODE (decl
) == TYPE_DECL
2434 && ANON_AGGRNAME_P (DECL_NAME (decl
)))
2435 cp_error ("template class without a name");
2436 else if ((DECL_IMPLICIT_TYPEDEF_P (decl
)
2437 && CLASS_TYPE_P (TREE_TYPE (decl
)))
2438 || (TREE_CODE (decl
) == VAR_DECL
&& ctx
&& CLASS_TYPE_P (ctx
))
2439 || TREE_CODE (decl
) == FUNCTION_DECL
)
2442 cp_error ("template declaration of `%#D'", decl
);
2445 /* Check to see that the rules regarding the use of default
2446 arguments are not being violated. */
2447 check_default_tmpl_args (decl
, current_template_parms
,
2448 primary
, is_partial
);
2451 return process_partial_specialization (decl
);
2453 args
= current_template_args ();
2456 || TREE_CODE (ctx
) == FUNCTION_DECL
2457 || TYPE_BEING_DEFINED (ctx
)
2458 || (is_friend
&& !DECL_TEMPLATE_INFO (decl
)))
2460 if (DECL_LANG_SPECIFIC (decl
)
2461 && DECL_TEMPLATE_INFO (decl
)
2462 && DECL_TI_TEMPLATE (decl
))
2463 tmpl
= DECL_TI_TEMPLATE (decl
);
2464 /* If DECL is a TYPE_DECL for a class-template, then there won't
2465 be DECL_LANG_SPECIFIC. The information equivalent to
2466 DECL_TEMPLATE_INFO is found in TYPE_TEMPLATE_INFO instead. */
2467 else if (DECL_IMPLICIT_TYPEDEF_P (decl
)
2468 && TYPE_TEMPLATE_INFO (TREE_TYPE (decl
))
2469 && TYPE_TI_TEMPLATE (TREE_TYPE (decl
)))
2471 /* Since a template declaration already existed for this
2472 class-type, we must be redeclaring it here. Make sure
2473 that the redeclaration is legal. */
2474 redeclare_class_template (TREE_TYPE (decl
),
2475 current_template_parms
);
2476 /* We don't need to create a new TEMPLATE_DECL; just use the
2477 one we already had. */
2478 tmpl
= TYPE_TI_TEMPLATE (TREE_TYPE (decl
));
2482 tmpl
= build_template_decl (decl
, current_template_parms
);
2485 if (DECL_LANG_SPECIFIC (decl
)
2486 && DECL_TEMPLATE_SPECIALIZATION (decl
))
2488 /* A specialization of a member template of a template
2490 SET_DECL_TEMPLATE_SPECIALIZATION (tmpl
);
2491 DECL_TEMPLATE_INFO (tmpl
) = DECL_TEMPLATE_INFO (decl
);
2492 DECL_TEMPLATE_INFO (decl
) = NULL_TREE
;
2498 tree a
, t
, current
, parms
;
2501 if (TREE_CODE (decl
) == TYPE_DECL
)
2503 if ((IS_AGGR_TYPE_CODE (TREE_CODE (TREE_TYPE (decl
)))
2504 || TREE_CODE (TREE_TYPE (decl
)) == ENUMERAL_TYPE
)
2505 && TYPE_TEMPLATE_INFO (TREE_TYPE (decl
))
2506 && TYPE_TI_TEMPLATE (TREE_TYPE (decl
)))
2507 tmpl
= TYPE_TI_TEMPLATE (TREE_TYPE (decl
));
2510 cp_error ("`%D' does not declare a template type", decl
);
2514 else if (! DECL_TEMPLATE_INFO (decl
))
2516 cp_error ("template definition of non-template `%#D'", decl
);
2520 tmpl
= DECL_TI_TEMPLATE (decl
);
2522 if (is_member_template (tmpl
)
2523 && DECL_FUNCTION_TEMPLATE_P (tmpl
)
2524 && DECL_TEMPLATE_INFO (decl
) && DECL_TI_ARGS (decl
)
2525 && DECL_TEMPLATE_SPECIALIZATION (decl
))
2529 /* The declaration is a specialization of a member
2530 template, declared outside the class. Therefore, the
2531 innermost template arguments will be NULL, so we
2532 replace them with the arguments determined by the
2533 earlier call to check_explicit_specialization. */
2534 args
= DECL_TI_ARGS (decl
);
2537 = build_template_decl (decl
, current_template_parms
);
2538 DECL_TEMPLATE_RESULT (new_tmpl
) = decl
;
2539 TREE_TYPE (new_tmpl
) = TREE_TYPE (decl
);
2540 DECL_TI_TEMPLATE (decl
) = new_tmpl
;
2541 SET_DECL_TEMPLATE_SPECIALIZATION (new_tmpl
);
2542 DECL_TEMPLATE_INFO (new_tmpl
)
2543 = tree_cons (tmpl
, args
, NULL_TREE
);
2545 register_specialization (new_tmpl
,
2546 most_general_template (tmpl
),
2551 /* Make sure the template headers we got make sense. */
2553 parms
= DECL_TEMPLATE_PARMS (tmpl
);
2554 i
= TMPL_PARMS_DEPTH (parms
);
2555 if (TMPL_ARGS_DEPTH (args
) != i
)
2557 cp_error ("expected %d levels of template parms for `%#D', got %d",
2558 i
, decl
, TMPL_ARGS_DEPTH (args
));
2561 for (current
= decl
; i
> 0; --i
, parms
= TREE_CHAIN (parms
))
2563 a
= TMPL_ARGS_LEVEL (args
, i
);
2564 t
= INNERMOST_TEMPLATE_PARMS (parms
);
2566 if (TREE_VEC_LENGTH (t
) != TREE_VEC_LENGTH (a
))
2568 if (current
== decl
)
2569 cp_error ("got %d template parameters for `%#D'",
2570 TREE_VEC_LENGTH (a
), decl
);
2572 cp_error ("got %d template parameters for `%#T'",
2573 TREE_VEC_LENGTH (a
), current
);
2574 cp_error (" but %d required", TREE_VEC_LENGTH (t
));
2577 /* Perhaps we should also check that the parms are used in the
2578 appropriate qualifying scopes in the declarator? */
2580 if (current
== decl
)
2583 current
= TYPE_CONTEXT (current
);
2587 DECL_TEMPLATE_RESULT (tmpl
) = decl
;
2588 TREE_TYPE (tmpl
) = TREE_TYPE (decl
);
2590 /* Push template declarations for global functions and types. Note
2591 that we do not try to push a global template friend declared in a
2592 template class; such a thing may well depend on the template
2593 parameters of the class. */
2594 if (new_template_p
&& !ctx
2595 && !(is_friend
&& template_class_depth (current_class_type
) > 0))
2596 tmpl
= pushdecl_namespace_level (tmpl
);
2599 DECL_PRIMARY_TEMPLATE (tmpl
) = tmpl
;
2601 info
= tree_cons (tmpl
, args
, NULL_TREE
);
2603 if (DECL_IMPLICIT_TYPEDEF_P (decl
))
2605 SET_TYPE_TEMPLATE_INFO (TREE_TYPE (tmpl
), info
);
2606 if ((!ctx
|| TREE_CODE (ctx
) != FUNCTION_DECL
)
2607 && TREE_CODE (TREE_TYPE (decl
)) != ENUMERAL_TYPE
)
2608 DECL_NAME (decl
) = classtype_mangled_name (TREE_TYPE (decl
));
2610 else if (DECL_LANG_SPECIFIC (decl
))
2611 DECL_TEMPLATE_INFO (decl
) = info
;
2613 return DECL_TEMPLATE_RESULT (tmpl
);
2617 push_template_decl (decl
)
2620 return push_template_decl_real (decl
, 0);
2623 /* Called when a class template TYPE is redeclared with the indicated
2624 template PARMS, e.g.:
2626 template <class T> struct S;
2627 template <class T> struct S {}; */
2630 redeclare_class_template (type
, parms
)
2638 if (!TYPE_TEMPLATE_INFO (type
))
2640 cp_error ("`%T' is not a template type", type
);
2644 tmpl
= TYPE_TI_TEMPLATE (type
);
2645 if (!PRIMARY_TEMPLATE_P (tmpl
))
2646 /* The type is nested in some template class. Nothing to worry
2647 about here; there are no new template parameters for the nested
2651 parms
= INNERMOST_TEMPLATE_PARMS (parms
);
2652 tmpl_parms
= DECL_INNERMOST_TEMPLATE_PARMS (tmpl
);
2654 if (TREE_VEC_LENGTH (parms
) != TREE_VEC_LENGTH (tmpl_parms
))
2656 cp_error_at ("previous declaration `%D'", tmpl
);
2657 cp_error ("used %d template parameter%s instead of %d",
2658 TREE_VEC_LENGTH (tmpl_parms
),
2659 TREE_VEC_LENGTH (tmpl_parms
) == 1 ? "" : "s",
2660 TREE_VEC_LENGTH (parms
));
2664 for (i
= 0; i
< TREE_VEC_LENGTH (tmpl_parms
); ++i
)
2666 tree tmpl_parm
= TREE_VALUE (TREE_VEC_ELT (tmpl_parms
, i
));
2667 tree parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
2668 tree tmpl_default
= TREE_PURPOSE (TREE_VEC_ELT (tmpl_parms
, i
));
2669 tree parm_default
= TREE_PURPOSE (TREE_VEC_ELT (parms
, i
));
2671 if (TREE_CODE (tmpl_parm
) != TREE_CODE (parm
))
2673 cp_error_at ("template parameter `%#D'", tmpl_parm
);
2674 cp_error ("redeclared here as `%#D'", parm
);
2678 if (tmpl_default
!= NULL_TREE
&& parm_default
!= NULL_TREE
)
2680 /* We have in [temp.param]:
2682 A template-parameter may not be given default arguments
2683 by two different declarations in the same scope. */
2684 cp_error ("redefinition of default argument for `%#D'", parm
);
2685 cp_error_at (" original definition appeared here", tmpl_parm
);
2689 if (parm_default
!= NULL_TREE
)
2690 /* Update the previous template parameters (which are the ones
2691 that will really count) with the new default value. */
2692 TREE_PURPOSE (TREE_VEC_ELT (tmpl_parms
, i
)) = parm_default
;
2693 else if (tmpl_default
!= NULL_TREE
)
2694 /* Update the new parameters, too; they'll be used as the
2695 parameters for any members. */
2696 TREE_PURPOSE (TREE_VEC_ELT (parms
, i
)) = tmpl_default
;
2700 /* Attempt to convert the non-type template parameter EXPR to the
2701 indicated TYPE. If the conversion is successful, return the
2702 converted value. If the conversion is unsuccesful, return
2703 NULL_TREE if we issued an error message, or error_mark_node if we
2704 did not. We issue error messages for out-and-out bad template
2705 parameters, but not simply because the conversion failed, since we
2706 might be just trying to do argument deduction. By the time this
2707 function is called, neither TYPE nor EXPR may make use of template
2711 convert_nontype_argument (type
, expr
)
2715 tree expr_type
= TREE_TYPE (expr
);
2717 /* A template-argument for a non-type, non-template
2718 template-parameter shall be one of:
2720 --an integral constant-expression of integral or enumeration
2723 --the name of a non-type template-parameter; or
2725 --the name of an object or function with external linkage,
2726 including function templates and function template-ids but
2727 excluding non-static class members, expressed as id-expression;
2730 --the address of an object or function with external linkage,
2731 including function templates and function template-ids but
2732 excluding non-static class members, expressed as & id-expression
2733 where the & is optional if the name refers to a function or
2736 --a pointer to member expressed as described in _expr.unary.op_. */
2738 /* An integral constant-expression can include const variables or
2739 enumerators. Simplify things by folding them to their values,
2740 unless we're about to bind the declaration to a reference
2742 if (INTEGRAL_TYPE_P (expr_type
)
2743 && TREE_CODE (type
) != REFERENCE_TYPE
)
2744 expr
= decl_constant_value (expr
);
2746 if (is_overloaded_fn (expr
))
2747 /* OK for now. We'll check that it has external linkage later.
2748 Check this first since if expr_type is the unknown_type_node
2749 we would otherwise complain below. */
2751 else if (TYPE_PTRMEM_P (expr_type
)
2752 || TYPE_PTRMEMFUNC_P (expr_type
))
2754 if (TREE_CODE (expr
) != PTRMEM_CST
)
2757 else if (TYPE_PTR_P (expr_type
)
2758 || TYPE_PTRMEM_P (expr_type
)
2759 || TREE_CODE (expr_type
) == ARRAY_TYPE
2760 || TREE_CODE (type
) == REFERENCE_TYPE
2761 /* If expr is the address of an overloaded function, we
2762 will get the unknown_type_node at this point. */
2763 || expr_type
== unknown_type_node
)
2769 if (TREE_CODE (expr_type
) == ARRAY_TYPE
2770 || (TREE_CODE (type
) == REFERENCE_TYPE
2771 && TREE_CODE (e
) != ADDR_EXPR
))
2775 if (TREE_CODE (e
) != ADDR_EXPR
)
2778 cp_error ("`%E' is not a valid template argument", expr
);
2779 if (TYPE_PTR_P (expr_type
))
2781 if (TREE_CODE (TREE_TYPE (expr_type
)) == FUNCTION_TYPE
)
2782 cp_error ("it must be the address of a function with external linkage");
2784 cp_error ("it must be the address of an object with external linkage");
2786 else if (TYPE_PTRMEM_P (expr_type
)
2787 || TYPE_PTRMEMFUNC_P (expr_type
))
2788 cp_error ("it must be a pointer-to-member of the form `&X::Y'");
2793 referent
= TREE_OPERAND (e
, 0);
2794 STRIP_NOPS (referent
);
2797 if (TREE_CODE (referent
) == STRING_CST
)
2799 cp_error ("string literal %E is not a valid template argument because it is the address of an object with static linkage",
2804 if (is_overloaded_fn (referent
))
2805 /* We'll check that it has external linkage later. */
2807 else if (TREE_CODE (referent
) != VAR_DECL
)
2809 else if (!TREE_PUBLIC (referent
))
2811 cp_error ("address of non-extern `%E' cannot be used as template argument", referent
);
2812 return error_mark_node
;
2815 else if (INTEGRAL_TYPE_P (expr_type
)
2816 || TYPE_PTRMEM_P (expr_type
)
2817 || TYPE_PTRMEMFUNC_P (expr_type
)
2818 /* The next two are g++ extensions. */
2819 || TREE_CODE (expr_type
) == REAL_TYPE
2820 || TREE_CODE (expr_type
) == COMPLEX_TYPE
)
2822 if (! TREE_CONSTANT (expr
))
2825 cp_error ("non-constant `%E' cannot be used as template argument",
2832 cp_error ("object `%E' cannot be used as template argument", expr
);
2836 switch (TREE_CODE (type
))
2841 /* For a non-type template-parameter of integral or enumeration
2842 type, integral promotions (_conv.prom_) and integral
2843 conversions (_conv.integral_) are applied. */
2844 if (!INTEGRAL_TYPE_P (expr_type
))
2845 return error_mark_node
;
2847 /* It's safe to call digest_init in this case; we know we're
2848 just converting one integral constant expression to another. */
2849 expr
= digest_init (type
, expr
, (tree
*) 0);
2851 if (TREE_CODE (expr
) != INTEGER_CST
)
2852 /* Curiously, some TREE_CONSTANT integral expressions do not
2853 simplify to integer constants. For example, `3 % 0',
2854 remains a TRUNC_MOD_EXPR. */
2861 /* These are g++ extensions. */
2862 if (TREE_CODE (expr_type
) != TREE_CODE (type
))
2863 return error_mark_node
;
2865 expr
= digest_init (type
, expr
, (tree
*) 0);
2867 if (TREE_CODE (expr
) != REAL_CST
)
2874 tree type_pointed_to
= TREE_TYPE (type
);
2876 if (TYPE_PTRMEM_P (type
))
2880 /* For a non-type template-parameter of type pointer to data
2881 member, qualification conversions (_conv.qual_) are
2883 e
= perform_qualification_conversions (type
, expr
);
2884 if (TREE_CODE (e
) == NOP_EXPR
)
2885 /* The call to perform_qualification_conversions will
2886 insert a NOP_EXPR over EXPR to do express conversion,
2887 if necessary. But, that will confuse us if we use
2888 this (converted) template parameter to instantiate
2889 another template; then the thing will not look like a
2890 valid template argument. So, just make a new
2891 constant, of the appropriate type. */
2892 e
= make_ptrmem_cst (type
, PTRMEM_CST_MEMBER (expr
));
2895 else if (TREE_CODE (type_pointed_to
) == FUNCTION_TYPE
)
2897 /* For a non-type template-parameter of type pointer to
2898 function, only the function-to-pointer conversion
2899 (_conv.func_) is applied. If the template-argument
2900 represents a set of overloaded functions (or a pointer to
2901 such), the matching function is selected from the set
2906 if (TREE_CODE (expr
) == ADDR_EXPR
)
2907 fns
= TREE_OPERAND (expr
, 0);
2911 fn
= instantiate_type (type_pointed_to
, fns
, 0);
2913 if (fn
== error_mark_node
)
2914 return error_mark_node
;
2916 if (!TREE_PUBLIC (fn
))
2918 if (really_overloaded_fn (fns
))
2919 return error_mark_node
;
2924 expr
= build_unary_op (ADDR_EXPR
, fn
, 0);
2926 my_friendly_assert (same_type_p (type
, TREE_TYPE (expr
)),
2932 /* For a non-type template-parameter of type pointer to
2933 object, qualification conversions (_conv.qual_) and the
2934 array-to-pointer conversion (_conv.array_) are applied.
2935 [Note: In particular, neither the null pointer conversion
2936 (_conv.ptr_) nor the derived-to-base conversion
2937 (_conv.ptr_) are applied. Although 0 is a valid
2938 template-argument for a non-type template-parameter of
2939 integral type, it is not a valid template-argument for a
2940 non-type template-parameter of pointer type.]
2942 The call to decay_conversion performs the
2943 array-to-pointer conversion, if appropriate. */
2944 expr
= decay_conversion (expr
);
2946 if (expr
== error_mark_node
)
2947 return error_mark_node
;
2949 return perform_qualification_conversions (type
, expr
);
2954 case REFERENCE_TYPE
:
2956 tree type_referred_to
= TREE_TYPE (type
);
2958 /* If this expression already has reference type, get the
2959 underling object. */
2960 if (TREE_CODE (expr_type
) == REFERENCE_TYPE
)
2962 my_friendly_assert (TREE_CODE (expr
) == ADDR_EXPR
, 20000604);
2963 expr
= TREE_OPERAND (expr
, 0);
2964 expr_type
= TREE_TYPE (expr
);
2967 if (TREE_CODE (type_referred_to
) == FUNCTION_TYPE
)
2969 /* For a non-type template-parameter of type reference to
2970 function, no conversions apply. If the
2971 template-argument represents a set of overloaded
2972 functions, the matching function is selected from the
2973 set (_over.over_). */
2976 fn
= instantiate_type (type_referred_to
, expr
, 0);
2978 if (fn
== error_mark_node
)
2979 return error_mark_node
;
2981 if (!TREE_PUBLIC (fn
))
2983 if (really_overloaded_fn (expr
))
2984 /* Don't issue an error here; we might get a different
2985 function if the overloading had worked out
2987 return error_mark_node
;
2992 my_friendly_assert (same_type_p (type_referred_to
,
3000 /* For a non-type template-parameter of type reference to
3001 object, no conversions apply. The type referred to by the
3002 reference may be more cv-qualified than the (otherwise
3003 identical) type of the template-argument. The
3004 template-parameter is bound directly to the
3005 template-argument, which must be an lvalue. */
3006 if (!same_type_p (TYPE_MAIN_VARIANT (expr_type
),
3007 TYPE_MAIN_VARIANT (type_referred_to
))
3008 || !at_least_as_qualified_p (type_referred_to
,
3010 || !real_lvalue_p (expr
))
3011 expr
= error_mark_node
;
3014 mark_addressable (expr
);
3015 return build1 (ADDR_EXPR
, type
, expr
);
3021 if (!TYPE_PTRMEMFUNC_P (type
))
3022 /* This handles templates like
3023 template<class T, T t> void f();
3024 when T is substituted with any class. The second template
3025 parameter becomes invalid and the template candidate is
3027 return error_mark_node
;
3029 /* For a non-type template-parameter of type pointer to member
3030 function, no conversions apply. If the template-argument
3031 represents a set of overloaded member functions, the
3032 matching member function is selected from the set
3035 if (!TYPE_PTRMEMFUNC_P (expr_type
) &&
3036 expr_type
!= unknown_type_node
)
3037 return error_mark_node
;
3039 if (TREE_CODE (expr
) == PTRMEM_CST
)
3041 /* A ptr-to-member constant. */
3042 if (!same_type_p (type
, expr_type
))
3043 return error_mark_node
;
3048 if (TREE_CODE (expr
) != ADDR_EXPR
)
3049 return error_mark_node
;
3051 expr
= instantiate_type (type
, expr
, 0);
3053 if (expr
== error_mark_node
)
3054 return error_mark_node
;
3056 my_friendly_assert (same_type_p (type
, TREE_TYPE (expr
)),
3063 /* All non-type parameters must have one of these types. */
3064 my_friendly_abort (0);
3068 return error_mark_node
;
3071 /* Return 1 if PARM_PARMS and ARG_PARMS matches using rule for
3072 template template parameters. Both PARM_PARMS and ARG_PARMS are
3073 vectors of TREE_LIST nodes containing TYPE_DECL, TEMPLATE_DECL
3076 ARG_PARMS may contain more parameters than PARM_PARMS. If this is
3077 the case, then extra parameters must have default arguments.
3079 Consider the example:
3080 template <class T, class Allocator = allocator> class vector;
3081 template<template <class U> class TT> class C;
3083 C<vector> is a valid instantiation. PARM_PARMS for the above code
3084 contains a TYPE_DECL (for U), ARG_PARMS contains two TYPE_DECLs (for
3085 T and Allocator) and OUTER_ARGS contains the argument that is used to
3086 substitute the TT parameter. */
3089 coerce_template_template_parms (parm_parms
, arg_parms
, complain
,
3090 in_decl
, outer_args
)
3091 tree parm_parms
, arg_parms
;
3093 tree in_decl
, outer_args
;
3095 int nparms
, nargs
, i
;
3098 my_friendly_assert (TREE_CODE (parm_parms
) == TREE_VEC
, 0);
3099 my_friendly_assert (TREE_CODE (arg_parms
) == TREE_VEC
, 0);
3101 nparms
= TREE_VEC_LENGTH (parm_parms
);
3102 nargs
= TREE_VEC_LENGTH (arg_parms
);
3104 /* The rule here is opposite of coerce_template_parms. */
3107 && TREE_PURPOSE (TREE_VEC_ELT (arg_parms
, nparms
)) == NULL_TREE
))
3110 for (i
= 0; i
< nparms
; ++i
)
3112 parm
= TREE_VALUE (TREE_VEC_ELT (parm_parms
, i
));
3113 arg
= TREE_VALUE (TREE_VEC_ELT (arg_parms
, i
));
3115 if (arg
== NULL_TREE
|| arg
== error_mark_node
3116 || parm
== NULL_TREE
|| parm
== error_mark_node
)
3119 if (TREE_CODE (arg
) != TREE_CODE (parm
))
3122 switch (TREE_CODE (parm
))
3128 /* We encounter instantiations of templates like
3129 template <template <template <class> class> class TT>
3132 tree parmparm
= DECL_INNERMOST_TEMPLATE_PARMS (parm
);
3133 tree argparm
= DECL_INNERMOST_TEMPLATE_PARMS (arg
);
3135 if (!coerce_template_template_parms (parmparm
, argparm
,
3143 /* The tsubst call is used to handle cases such as
3144 template <class T, template <T> class TT> class D;
3145 i.e. the parameter list of TT depends on earlier parameters. */
3146 if (!same_type_p (tsubst (TREE_TYPE (parm
), outer_args
,
3153 my_friendly_abort (0);
3159 /* Convert the indicated template ARG as necessary to match the
3160 indicated template PARM. Returns the converted ARG, or
3161 error_mark_node if the conversion was unsuccessful. Error messages
3162 are issued if COMPLAIN is non-zero. This conversion is for the Ith
3163 parameter in the parameter list. ARGS is the full set of template
3164 arguments deduced so far. */
3167 convert_template_argument (parm
, arg
, args
, complain
, i
, in_decl
)
3177 int is_type
, requires_type
, is_tmpl_type
, requires_tmpl_type
;
3179 inner_args
= INNERMOST_TEMPLATE_ARGS (args
);
3181 if (TREE_CODE (arg
) == TREE_LIST
3182 && TREE_TYPE (arg
) != NULL_TREE
3183 && TREE_CODE (TREE_TYPE (arg
)) == OFFSET_TYPE
)
3185 /* The template argument was the name of some
3186 member function. That's usually
3187 illegal, but static members are OK. In any
3188 case, grab the underlying fields/functions
3189 and issue an error later if required. */
3190 arg
= TREE_VALUE (arg
);
3191 TREE_TYPE (arg
) = unknown_type_node
;
3194 requires_tmpl_type
= TREE_CODE (parm
) == TEMPLATE_DECL
;
3195 requires_type
= (TREE_CODE (parm
) == TYPE_DECL
3196 || requires_tmpl_type
);
3198 /* Check if it is a class template. If REQUIRES_TMPL_TYPE is true,
3199 we also accept implicitly created TYPE_DECL as a valid argument.
3200 This is necessary to handle the case where we pass a template name
3201 to a template template parameter in a scope where we've derived from
3202 in instantiation of that template, so the template name refers to that
3203 instantiation. We really ought to handle this better. */
3205 = ((TREE_CODE (arg
) == TEMPLATE_DECL
3206 && TREE_CODE (DECL_TEMPLATE_RESULT (arg
)) == TYPE_DECL
)
3207 || (TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
3208 && !TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (arg
))
3209 || (TREE_CODE (arg
) == RECORD_TYPE
3210 && CLASSTYPE_TEMPLATE_INFO (arg
)
3211 && TREE_CODE (TYPE_NAME (arg
)) == TYPE_DECL
3212 && DECL_ARTIFICIAL (TYPE_NAME (arg
))
3213 && requires_tmpl_type
3214 && is_base_of_enclosing_class (arg
, current_class_type
)));
3215 if (is_tmpl_type
&& TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
)
3216 arg
= TYPE_STUB_DECL (arg
);
3217 else if (is_tmpl_type
&& TREE_CODE (arg
) == RECORD_TYPE
)
3218 arg
= CLASSTYPE_TI_TEMPLATE (arg
);
3220 is_type
= TYPE_P (arg
) || is_tmpl_type
;
3222 if (requires_type
&& ! is_type
&& TREE_CODE (arg
) == SCOPE_REF
3223 && TREE_CODE (TREE_OPERAND (arg
, 0)) == TEMPLATE_TYPE_PARM
)
3225 cp_pedwarn ("to refer to a type member of a template parameter, use `typename %E'", arg
);
3227 arg
= make_typename_type (TREE_OPERAND (arg
, 0),
3228 TREE_OPERAND (arg
, 1),
3232 if (is_type
!= requires_type
)
3238 cp_error ("type/value mismatch at argument %d in template parameter list for `%D'",
3241 cp_error (" expected a constant of type `%T', got `%T'",
3243 (is_tmpl_type
? DECL_NAME (arg
) : arg
));
3245 cp_error (" expected a type, got `%E'", arg
);
3248 return error_mark_node
;
3250 if (is_tmpl_type
^ requires_tmpl_type
)
3252 if (in_decl
&& complain
)
3254 cp_error ("type/value mismatch at argument %d in template parameter list for `%D'",
3257 cp_error (" expected a type, got `%T'", DECL_NAME (arg
));
3259 cp_error (" expected a class template, got `%T'", arg
);
3261 return error_mark_node
;
3266 if (requires_tmpl_type
)
3268 tree parmparm
= DECL_INNERMOST_TEMPLATE_PARMS (parm
);
3269 tree argparm
= DECL_INNERMOST_TEMPLATE_PARMS (arg
);
3271 if (coerce_template_template_parms (parmparm
, argparm
, complain
,
3272 in_decl
, inner_args
))
3276 /* TEMPLATE_TEMPLATE_PARM node is preferred over
3278 if (val
!= error_mark_node
3279 && DECL_TEMPLATE_TEMPLATE_PARM_P (val
))
3280 val
= TREE_TYPE (val
);
3284 if (in_decl
&& complain
)
3286 cp_error ("type/value mismatch at argument %d in template parameter list for `%D'",
3288 cp_error (" expected a template of type `%D', got `%D'", parm
, arg
);
3291 val
= error_mark_node
;
3296 val
= groktypename (arg
);
3297 if (! processing_template_decl
)
3299 /* [basic.link]: A name with no linkage (notably, the
3300 name of a class or enumeration declared in a local
3301 scope) shall not be used to declare an entity with
3302 linkage. This implies that names with no linkage
3303 cannot be used as template arguments. */
3304 tree t
= no_linkage_check (val
);
3307 if (ANON_AGGRNAME_P (TYPE_IDENTIFIER (t
)))
3309 ("template-argument `%T' uses anonymous type", val
);
3312 ("template-argument `%T' uses local type `%T'",
3314 return error_mark_node
;
3321 tree t
= tsubst (TREE_TYPE (parm
), args
, complain
, in_decl
);
3323 if (processing_template_decl
)
3324 arg
= maybe_fold_nontype_arg (arg
);
3326 if (!uses_template_parms (arg
) && !uses_template_parms (t
))
3327 /* We used to call digest_init here. However, digest_init
3328 will report errors, which we don't want when complain
3329 is zero. More importantly, digest_init will try too
3330 hard to convert things: for example, `0' should not be
3331 converted to pointer type at this point according to
3332 the standard. Accepting this is not merely an
3333 extension, since deciding whether or not these
3334 conversions can occur is part of determining which
3335 function template to call, or whether a given epxlicit
3336 argument specification is legal. */
3337 val
= convert_nontype_argument (t
, arg
);
3341 if (val
== NULL_TREE
)
3342 val
= error_mark_node
;
3343 else if (val
== error_mark_node
&& complain
)
3344 cp_error ("could not convert template argument `%E' to `%T'",
3351 /* Convert all template arguments to their appropriate types, and
3352 return a vector containing the innermost resulting template
3353 arguments. If any error occurs, return error_mark_node, and, if
3354 COMPLAIN is non-zero, issue an error message. Some error messages
3355 are issued even if COMPLAIN is zero; for instance, if a template
3356 argument is composed from a local class.
3358 If REQUIRE_ALL_ARGUMENTS is non-zero, all arguments must be
3359 provided in ARGLIST, or else trailing parameters must have default
3360 values. If REQUIRE_ALL_ARGUMENTS is zero, we will attempt argument
3361 deduction for any unspecified trailing arguments. */
3364 coerce_template_parms (parms
, args
, in_decl
,
3366 require_all_arguments
)
3370 int require_all_arguments
;
3372 int nparms
, nargs
, i
, lost
= 0;
3375 tree new_inner_args
;
3377 inner_args
= INNERMOST_TEMPLATE_ARGS (args
);
3378 nargs
= NUM_TMPL_ARGS (inner_args
);
3379 nparms
= TREE_VEC_LENGTH (parms
);
3383 && require_all_arguments
3384 && TREE_PURPOSE (TREE_VEC_ELT (parms
, nargs
)) == NULL_TREE
))
3388 cp_error ("wrong number of template arguments (%d, should be %d)",
3392 cp_error_at ("provided for `%D'", in_decl
);
3395 return error_mark_node
;
3398 new_inner_args
= make_tree_vec (nparms
);
3399 new_args
= add_outermost_template_args (args
, new_inner_args
);
3400 for (i
= 0; i
< nparms
; i
++)
3405 /* Get the Ith template parameter. */
3406 parm
= TREE_VEC_ELT (parms
, i
);
3408 /* Calculate the Ith argument. */
3409 if (inner_args
&& TREE_CODE (inner_args
) == TREE_LIST
)
3411 arg
= TREE_VALUE (inner_args
);
3412 inner_args
= TREE_CHAIN (inner_args
);
3415 arg
= TREE_VEC_ELT (inner_args
, i
);
3416 /* If no template argument was supplied, look for a default
3418 else if (TREE_PURPOSE (parm
) == NULL_TREE
)
3420 /* There was no default value. */
3421 my_friendly_assert (!require_all_arguments
, 0);
3424 else if (TREE_CODE (TREE_VALUE (parm
)) == TYPE_DECL
)
3425 arg
= tsubst (TREE_PURPOSE (parm
), new_args
, complain
, in_decl
);
3427 arg
= tsubst_expr (TREE_PURPOSE (parm
), new_args
, complain
,
3430 /* Now, convert the Ith argument, as necessary. */
3431 if (arg
== NULL_TREE
)
3432 /* We're out of arguments. */
3434 my_friendly_assert (!require_all_arguments
, 0);
3437 else if (arg
== error_mark_node
)
3439 cp_error ("template argument %d is invalid", i
+ 1);
3440 arg
= error_mark_node
;
3443 arg
= convert_template_argument (TREE_VALUE (parm
),
3444 arg
, new_args
, complain
, i
,
3447 if (arg
== error_mark_node
)
3449 TREE_VEC_ELT (new_inner_args
, i
) = arg
;
3453 return error_mark_node
;
3455 return new_inner_args
;
3458 /* Returns 1 if template args OT and NT are equivalent. */
3461 template_args_equal (ot
, nt
)
3466 if (TREE_CODE (nt
) != TREE_CODE (ot
))
3468 if (TREE_CODE (nt
) == TREE_VEC
)
3469 /* For member templates */
3470 return comp_template_args (ot
, nt
);
3471 else if (TYPE_P (ot
))
3472 return same_type_p (ot
, nt
);
3474 return (cp_tree_equal (ot
, nt
) > 0);
3477 /* Returns 1 iff the OLDARGS and NEWARGS are in fact identical sets
3478 of template arguments. Returns 0 otherwise. */
3481 comp_template_args (oldargs
, newargs
)
3482 tree oldargs
, newargs
;
3486 if (TREE_VEC_LENGTH (oldargs
) != TREE_VEC_LENGTH (newargs
))
3489 for (i
= 0; i
< TREE_VEC_LENGTH (oldargs
); ++i
)
3491 tree nt
= TREE_VEC_ELT (newargs
, i
);
3492 tree ot
= TREE_VEC_ELT (oldargs
, i
);
3494 if (! template_args_equal (ot
, nt
))
3500 /* Given class template name and parameter list, produce a user-friendly name
3501 for the instantiation. */
3504 mangle_class_name_for_template (name
, parms
, arglist
)
3506 tree parms
, arglist
;
3508 static struct obstack scratch_obstack
;
3509 static char *scratch_firstobj
;
3512 if (!scratch_firstobj
)
3513 gcc_obstack_init (&scratch_obstack
);
3515 obstack_free (&scratch_obstack
, scratch_firstobj
);
3516 scratch_firstobj
= obstack_alloc (&scratch_obstack
, 1);
3518 #define ccat(c) obstack_1grow (&scratch_obstack, (c));
3519 #define cat(s) obstack_grow (&scratch_obstack, (s), strlen (s))
3523 nparms
= TREE_VEC_LENGTH (parms
);
3524 arglist
= INNERMOST_TEMPLATE_ARGS (arglist
);
3525 my_friendly_assert (nparms
== TREE_VEC_LENGTH (arglist
), 268);
3526 for (i
= 0; i
< nparms
; i
++)
3528 tree parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
3529 tree arg
= TREE_VEC_ELT (arglist
, i
);
3534 if (TREE_CODE (parm
) == TYPE_DECL
)
3536 cat (type_as_string (arg
, TS_CHASE_TYPEDEFS
));
3539 else if (TREE_CODE (parm
) == TEMPLATE_DECL
)
3541 if (TREE_CODE (arg
) == TEMPLATE_DECL
)
3543 /* Already substituted with real template. Just output
3544 the template name here */
3545 tree context
= DECL_CONTEXT (arg
);
3548 /* The template may be defined in a namespace, or
3549 may be a member template. */
3550 my_friendly_assert (TREE_CODE (context
) == NAMESPACE_DECL
3551 || CLASS_TYPE_P (context
),
3553 cat(decl_as_string (DECL_CONTEXT (arg
), 0));
3556 cat (IDENTIFIER_POINTER (DECL_NAME (arg
)));
3559 /* Output the parameter declaration */
3560 cat (type_as_string (arg
, TS_CHASE_TYPEDEFS
));
3564 my_friendly_assert (TREE_CODE (parm
) == PARM_DECL
, 269);
3566 if (TREE_CODE (arg
) == TREE_LIST
)
3568 /* New list cell was built because old chain link was in
3570 my_friendly_assert (TREE_PURPOSE (arg
) == NULL_TREE
, 270);
3571 arg
= TREE_VALUE (arg
);
3573 /* No need to check arglist against parmlist here; we did that
3574 in coerce_template_parms, called from lookup_template_class. */
3575 cat (expr_as_string (arg
, 0));
3578 char *bufp
= obstack_next_free (&scratch_obstack
);
3580 while (bufp
[offset
- 1] == ' ')
3582 obstack_blank_fast (&scratch_obstack
, offset
);
3584 /* B<C<char> >, not B<C<char>> */
3585 if (bufp
[offset
- 1] == '>')
3590 return (char *) obstack_base (&scratch_obstack
);
3594 classtype_mangled_name (t
)
3597 if (CLASSTYPE_TEMPLATE_INFO (t
)
3598 /* Specializations have already had their names set up in
3599 lookup_template_class. */
3600 && !CLASSTYPE_TEMPLATE_SPECIALIZATION (t
))
3602 tree tmpl
= most_general_template (CLASSTYPE_TI_TEMPLATE (t
));
3604 /* For non-primary templates, the template parameters are
3605 implicit from their surrounding context. */
3606 if (PRIMARY_TEMPLATE_P (tmpl
))
3608 tree name
= DECL_NAME (tmpl
);
3609 char *mangled_name
= mangle_class_name_for_template
3610 (IDENTIFIER_POINTER (name
),
3611 DECL_INNERMOST_TEMPLATE_PARMS (tmpl
),
3612 CLASSTYPE_TI_ARGS (t
));
3613 tree id
= get_identifier (mangled_name
);
3614 IDENTIFIER_TEMPLATE (id
) = name
;
3619 return TYPE_IDENTIFIER (t
);
3623 add_pending_template (d
)
3626 tree ti
= (TYPE_P (d
)
3627 ? CLASSTYPE_TEMPLATE_INFO (d
)
3628 : DECL_TEMPLATE_INFO (d
));
3631 if (TI_PENDING_TEMPLATE_FLAG (ti
))
3634 /* We are called both from instantiate_decl, where we've already had a
3635 tinst_level pushed, and instantiate_template, where we haven't.
3637 level
= !(current_tinst_level
&& TINST_DECL (current_tinst_level
) == d
);
3640 push_tinst_level (d
);
3642 *template_tail
= tree_cons (current_tinst_level
, d
, NULL_TREE
);
3643 template_tail
= &TREE_CHAIN (*template_tail
);
3644 TI_PENDING_TEMPLATE_FLAG (ti
) = 1;
3651 /* Return a TEMPLATE_ID_EXPR corresponding to the indicated FNS (which
3652 may be either a _DECL or an overloaded function or an
3653 IDENTIFIER_NODE), and ARGLIST. */
3656 lookup_template_function (fns
, arglist
)
3661 if (fns
== NULL_TREE
)
3663 cp_error ("non-template used as template");
3664 return error_mark_node
;
3667 type
= TREE_TYPE (fns
);
3668 if (TREE_CODE (fns
) == OVERLOAD
|| !type
)
3669 type
= unknown_type_node
;
3671 if (processing_template_decl
)
3672 return build_min (TEMPLATE_ID_EXPR
, type
, fns
, arglist
);
3674 return build (TEMPLATE_ID_EXPR
, type
, fns
, arglist
);
3677 /* Within the scope of a template class S<T>, the name S gets bound
3678 (in build_self_reference) to a TYPE_DECL for the class, not a
3679 TEMPLATE_DECL. If DECL is a TYPE_DECL for current_class_type,
3680 or one of its enclosing classes, and that type is a template,
3681 return the associated TEMPLATE_DECL. Otherwise, the original
3682 DECL is returned. */
3685 maybe_get_template_decl_from_type_decl (decl
)
3688 return (decl
!= NULL_TREE
3689 && TREE_CODE (decl
) == TYPE_DECL
3690 && DECL_ARTIFICIAL (decl
)
3691 && CLASS_TYPE_P (TREE_TYPE (decl
))
3692 && CLASSTYPE_TEMPLATE_INFO (TREE_TYPE (decl
)))
3693 ? CLASSTYPE_TI_TEMPLATE (TREE_TYPE (decl
)) : decl
;
3696 /* Given an IDENTIFIER_NODE (type TEMPLATE_DECL) and a chain of
3697 parameters, find the desired type.
3699 D1 is the PTYPENAME terminal, and ARGLIST is the list of arguments.
3700 (Actually ARGLIST may be either a TREE_LIST or a TREE_VEC. It will
3701 be a TREE_LIST if called directly from the parser, and a TREE_VEC
3702 otherwise.) Since ARGLIST is build on the temp_decl_obstack, we must
3703 copy it here to keep it from being reclaimed when the decl storage
3706 IN_DECL, if non-NULL, is the template declaration we are trying to
3709 If ENTERING_SCOPE is non-zero, we are about to enter the scope of
3710 the class we are looking up.
3712 If the template class is really a local class in a template
3713 function, then the FUNCTION_CONTEXT is the function in which it is
3714 being instantiated. */
3717 lookup_template_class (d1
, arglist
, in_decl
, context
, entering_scope
)
3723 tree
template = NULL_TREE
, parmlist
;
3726 if (TREE_CODE (d1
) == IDENTIFIER_NODE
)
3728 if (IDENTIFIER_VALUE (d1
)
3729 && DECL_TEMPLATE_TEMPLATE_PARM_P (IDENTIFIER_VALUE (d1
)))
3730 template = IDENTIFIER_VALUE (d1
);
3734 push_decl_namespace (context
);
3735 template = lookup_name (d1
, /*prefer_type=*/0);
3736 template = maybe_get_template_decl_from_type_decl (template);
3738 pop_decl_namespace ();
3741 context
= DECL_CONTEXT (template);
3743 else if (TREE_CODE (d1
) == TYPE_DECL
&& IS_AGGR_TYPE (TREE_TYPE (d1
)))
3745 tree type
= TREE_TYPE (d1
);
3747 /* If we are declaring a constructor, say A<T>::A<T>, we will get
3748 an implicit typename for the second A. Deal with it. */
3749 if (TREE_CODE (type
) == TYPENAME_TYPE
&& TREE_TYPE (type
))
3750 type
= TREE_TYPE (type
);
3752 if (CLASSTYPE_TEMPLATE_INFO (type
))
3754 template = CLASSTYPE_TI_TEMPLATE (type
);
3755 d1
= DECL_NAME (template);
3758 else if (TREE_CODE (d1
) == ENUMERAL_TYPE
3759 || (TYPE_P (d1
) && IS_AGGR_TYPE (d1
)))
3761 template = TYPE_TI_TEMPLATE (d1
);
3762 d1
= DECL_NAME (template);
3764 else if (TREE_CODE (d1
) == TEMPLATE_DECL
3765 && TREE_CODE (DECL_TEMPLATE_RESULT (d1
)) == TYPE_DECL
)
3768 d1
= DECL_NAME (template);
3769 context
= DECL_CONTEXT (template);
3772 my_friendly_abort (272);
3774 /* With something like `template <class T> class X class X { ... };'
3775 we could end up with D1 having nothing but an IDENTIFIER_VALUE.
3776 We don't want to do that, but we have to deal with the situation,
3777 so let's give them some syntax errors to chew on instead of a
3781 cp_error ("`%T' is not a template", d1
);
3782 return error_mark_node
;
3785 if (context
== NULL_TREE
)
3786 context
= global_namespace
;
3788 if (TREE_CODE (template) != TEMPLATE_DECL
)
3790 cp_error ("non-template type `%T' used as a template", d1
);
3792 cp_error_at ("for template declaration `%D'", in_decl
);
3793 return error_mark_node
;
3796 if (DECL_TEMPLATE_TEMPLATE_PARM_P (template))
3798 /* Create a new TEMPLATE_DECL and TEMPLATE_TEMPLATE_PARM node to store
3799 template arguments */
3801 tree parm
= copy_template_template_parm (TREE_TYPE (template));
3802 tree template2
= TYPE_STUB_DECL (parm
);
3805 parmlist
= DECL_INNERMOST_TEMPLATE_PARMS (template);
3807 arglist2
= coerce_template_parms (parmlist
, arglist
, template, 1, 1);
3808 if (arglist2
== error_mark_node
)
3809 return error_mark_node
;
3811 TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (parm
)
3812 = tree_cons (template2
, arglist2
, NULL_TREE
);
3813 TYPE_SIZE (parm
) = 0;
3818 tree template_type
= TREE_TYPE (template);
3821 tree found
= NULL_TREE
;
3824 int is_partial_instantiation
;
3826 gen_tmpl
= most_general_template (template);
3827 parmlist
= DECL_TEMPLATE_PARMS (gen_tmpl
);
3828 parm_depth
= TMPL_PARMS_DEPTH (parmlist
);
3829 arg_depth
= TMPL_ARGS_DEPTH (arglist
);
3831 if (arg_depth
== 1 && parm_depth
> 1)
3833 /* We've been given an incomplete set of template arguments.
3836 template <class T> struct S1 {
3837 template <class U> struct S2 {};
3838 template <class U> struct S2<U*> {};
3841 we will be called with an ARGLIST of `U*', but the
3842 TEMPLATE will be `template <class T> template
3843 <class U> struct S1<T>::S2'. We must fill in the missing
3846 = add_outermost_template_args (TYPE_TI_ARGS (TREE_TYPE (template)),
3848 arg_depth
= TMPL_ARGS_DEPTH (arglist
);
3851 /* Now we should enough arguments. */
3852 my_friendly_assert (parm_depth
== arg_depth
, 0);
3854 /* From here on, we're only interested in the most general
3856 template = gen_tmpl
;
3858 /* Calculate the BOUND_ARGS. These will be the args that are
3859 actually tsubst'd into the definition to create the
3863 /* We have multiple levels of arguments to coerce, at once. */
3865 int saved_depth
= TMPL_ARGS_DEPTH (arglist
);
3867 tree bound_args
= make_tree_vec (parm_depth
);
3869 for (i
= saved_depth
,
3870 t
= DECL_TEMPLATE_PARMS (template);
3871 i
> 0 && t
!= NULL_TREE
;
3872 --i
, t
= TREE_CHAIN (t
))
3874 tree a
= coerce_template_parms (TREE_VALUE (t
),
3875 arglist
, template, 1, 1);
3876 SET_TMPL_ARGS_LEVEL (bound_args
, i
, a
);
3878 /* We temporarily reduce the length of the ARGLIST so
3879 that coerce_template_parms will see only the arguments
3880 corresponding to the template parameters it is
3882 TREE_VEC_LENGTH (arglist
)--;
3885 /* Restore the ARGLIST to its full size. */
3886 TREE_VEC_LENGTH (arglist
) = saved_depth
;
3888 arglist
= bound_args
;
3892 = coerce_template_parms (INNERMOST_TEMPLATE_PARMS (parmlist
),
3893 INNERMOST_TEMPLATE_ARGS (arglist
),
3896 if (arglist
== error_mark_node
)
3897 /* We were unable to bind the arguments. */
3898 return error_mark_node
;
3900 /* In the scope of a template class, explicit references to the
3901 template class refer to the type of the template, not any
3902 instantiation of it. For example, in:
3904 template <class T> class C { void f(C<T>); }
3906 the `C<T>' is just the same as `C'. Outside of the
3907 class, however, such a reference is an instantiation. */
3908 if (comp_template_args (TYPE_TI_ARGS (template_type
),
3911 found
= template_type
;
3913 if (!entering_scope
&& PRIMARY_TEMPLATE_P (template))
3917 /* Note that we use DECL_CONTEXT, rather than
3918 CP_DECL_CONTEXT, so that the termination test is
3919 always just `ctx'. We're not interested in namepace
3921 for (ctx
= current_class_type
;
3923 ctx
= (TYPE_P (ctx
)) ? TYPE_CONTEXT (ctx
) : DECL_CONTEXT (ctx
))
3924 if (same_type_p (ctx
, template_type
))
3928 /* We're not in the scope of the class, so the
3929 TEMPLATE_TYPE is not the type we want after
3937 for (found
= DECL_TEMPLATE_INSTANTIATIONS (template);
3938 found
; found
= TREE_CHAIN (found
))
3939 if (comp_template_args (TREE_PURPOSE (found
), arglist
))
3943 found
= TREE_VALUE (found
);
3949 /* This type is a "partial instantiation" if any of the template
3950 arguments still inolve template parameters. Note that we set
3951 IS_PARTIAL_INSTANTIATION for partial specializations as
3953 is_partial_instantiation
= uses_template_parms (arglist
);
3955 if (!is_partial_instantiation
3956 && !PRIMARY_TEMPLATE_P (template)
3957 && TREE_CODE (CP_DECL_CONTEXT (template)) == NAMESPACE_DECL
)
3959 found
= xref_tag_from_type (TREE_TYPE (template),
3960 DECL_NAME (template),
3965 /* Create the type. */
3966 if (TREE_CODE (template_type
) == ENUMERAL_TYPE
)
3968 if (!is_partial_instantiation
)
3969 t
= start_enum (TYPE_IDENTIFIER (template_type
));
3971 /* We don't want to call start_enum for this type, since
3972 the values for the enumeration constants may involve
3973 template parameters. And, no one should be interested
3974 in the enumeration constants for such a type. */
3975 t
= make_node (ENUMERAL_TYPE
);
3979 t
= make_aggr_type (TREE_CODE (template_type
));
3980 CLASSTYPE_DECLARED_CLASS (t
)
3981 = CLASSTYPE_DECLARED_CLASS (template_type
);
3982 CLASSTYPE_GOT_SEMICOLON (t
) = 1;
3983 SET_CLASSTYPE_IMPLICIT_INSTANTIATION (t
);
3984 TYPE_FOR_JAVA (t
) = TYPE_FOR_JAVA (template_type
);
3986 /* A local class. Make sure the decl gets registered properly. */
3987 if (context
== current_function_decl
)
3988 pushtag (DECL_NAME (template), t
, 0);
3991 /* If we called start_enum or pushtag above, this information
3992 will already be set up. */
3995 TYPE_CONTEXT (t
) = FROB_CONTEXT (context
);
3997 type_decl
= create_implicit_typedef (DECL_NAME (template), t
);
3998 DECL_CONTEXT (type_decl
) = TYPE_CONTEXT (t
);
3999 TYPE_STUB_DECL (t
) = type_decl
;
4000 DECL_SOURCE_FILE (type_decl
)
4001 = DECL_SOURCE_FILE (TYPE_STUB_DECL (template_type
));
4002 DECL_SOURCE_LINE (type_decl
)
4003 = DECL_SOURCE_LINE (TYPE_STUB_DECL (template_type
));
4006 type_decl
= TYPE_NAME (t
);
4008 /* Set up the template information. We have to figure out which
4009 template is the immediate parent if this is a full
4011 if (parm_depth
== 1 || is_partial_instantiation
4012 || !PRIMARY_TEMPLATE_P (template))
4013 /* This case is easy; there are no member templates involved. */
4017 /* This is a full instantiation of a member template. There
4018 should be some partial instantiation of which this is an
4021 for (found
= DECL_TEMPLATE_INSTANTIATIONS (template);
4022 found
; found
= TREE_CHAIN (found
))
4025 tree tmpl
= CLASSTYPE_TI_TEMPLATE (TREE_VALUE (found
));
4027 /* We only want partial instantiations, here, not
4028 specializations or full instantiations. */
4029 if (CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_VALUE (found
))
4030 || !uses_template_parms (TREE_VALUE (found
)))
4033 /* Temporarily reduce by one the number of levels in the
4034 ARGLIST and in FOUND so as to avoid comparing the
4035 last set of arguments. */
4036 TREE_VEC_LENGTH (arglist
)--;
4037 TREE_VEC_LENGTH (TREE_PURPOSE (found
)) --;
4039 /* See if the arguments match. If they do, then TMPL is
4040 the partial instantiation we want. */
4041 success
= comp_template_args (TREE_PURPOSE (found
), arglist
);
4043 /* Restore the argument vectors to their full size. */
4044 TREE_VEC_LENGTH (arglist
)++;
4045 TREE_VEC_LENGTH (TREE_PURPOSE (found
))++;
4055 my_friendly_abort (0);
4058 SET_TYPE_TEMPLATE_INFO (t
,
4059 tree_cons (found
, arglist
, NULL_TREE
));
4060 DECL_TEMPLATE_INSTANTIATIONS (template)
4061 = tree_cons (arglist
, t
,
4062 DECL_TEMPLATE_INSTANTIATIONS (template));
4064 if (TREE_CODE (t
) == ENUMERAL_TYPE
4065 && !is_partial_instantiation
)
4066 /* Now that the type has been registered on the instantiations
4067 list, we set up the enumerators. Because the enumeration
4068 constants may involve the enumeration type itself, we make
4069 sure to register the type first, and then create the
4070 constants. That way, doing tsubst_expr for the enumeration
4071 constants won't result in recursive calls here; we'll find
4072 the instantiation and exit above. */
4073 tsubst_enum (template_type
, t
, arglist
);
4075 /* Reset the name of the type, now that CLASSTYPE_TEMPLATE_INFO
4077 if (TREE_CODE (t
) != ENUMERAL_TYPE
)
4078 DECL_NAME (type_decl
) = classtype_mangled_name (t
);
4079 DECL_ASSEMBLER_NAME (type_decl
) = DECL_NAME (type_decl
);
4080 if (!is_partial_instantiation
)
4083 DECL_ASSEMBLER_NAME (type_decl
) = mangle_decl (type_decl
);
4085 DECL_ASSEMBLER_NAME (type_decl
)
4086 = get_identifier (build_overload_name (t
, 1, 1));
4088 /* For backwards compatibility; code that uses
4089 -fexternal-templates expects looking up a template to
4090 instantiate it. I think DDD still relies on this.
4091 (jason 8/20/1998) */
4092 if (TREE_CODE (t
) != ENUMERAL_TYPE
4093 && flag_external_templates
4094 && CLASSTYPE_INTERFACE_KNOWN (TREE_TYPE (template))
4095 && ! CLASSTYPE_INTERFACE_ONLY (TREE_TYPE (template)))
4096 add_pending_template (t
);
4099 /* If the type makes use of template parameters, the
4100 code that generates debugging information will crash. */
4101 DECL_IGNORED_P (TYPE_STUB_DECL (t
)) = 1;
4113 /* Called from for_each_template_parm via walk_tree. */
4116 for_each_template_parm_r (tp
, walk_subtrees
, d
)
4122 struct pair_fn_data
*pfd
= (struct pair_fn_data
*) d
;
4123 tree_fn_t fn
= pfd
->fn
;
4124 void *data
= pfd
->data
;
4127 && for_each_template_parm (TYPE_CONTEXT (t
), fn
, data
))
4128 return error_mark_node
;
4130 switch (TREE_CODE (t
))
4133 if (TYPE_PTRMEMFUNC_FLAG (t
))
4139 if (!TYPE_TEMPLATE_INFO (t
))
4141 else if (for_each_template_parm (TREE_VALUE (TYPE_TEMPLATE_INFO (t
)),
4143 return error_mark_node
;
4147 /* Since we're not going to walk subtrees, we have to do this
4149 if (for_each_template_parm (TYPE_METHOD_BASETYPE (t
), fn
, data
))
4150 return error_mark_node
;
4153 /* Check the return type. */
4154 if (for_each_template_parm (TREE_TYPE (t
), fn
, data
))
4155 return error_mark_node
;
4157 /* Check the parameter types. Since default arguments are not
4158 instantiated until they are needed, the TYPE_ARG_TYPES may
4159 contain expressions that involve template parameters. But,
4160 no-one should be looking at them yet. And, once they're
4161 instantiated, they don't contain template parameters, so
4162 there's no point in looking at them then, either. */
4166 for (parm
= TYPE_ARG_TYPES (t
); parm
; parm
= TREE_CHAIN (parm
))
4167 if (for_each_template_parm (TREE_VALUE (parm
), fn
, data
))
4168 return error_mark_node
;
4170 /* Since we've already handled the TYPE_ARG_TYPES, we don't
4171 want walk_tree walking into them itself. */
4178 if (DECL_LANG_SPECIFIC (t
) && DECL_TEMPLATE_INFO (t
)
4179 && for_each_template_parm (DECL_TI_ARGS (t
), fn
, data
))
4180 return error_mark_node
;
4185 if (DECL_CONTEXT (t
)
4186 && for_each_template_parm (DECL_CONTEXT (t
), fn
, data
))
4187 return error_mark_node
;
4190 case TEMPLATE_TEMPLATE_PARM
:
4191 /* Record template parameters such as `T' inside `TT<T>'. */
4192 if (TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (t
)
4193 && for_each_template_parm (TYPE_TI_ARGS (t
), fn
, data
))
4194 return error_mark_node
;
4197 case TEMPLATE_TYPE_PARM
:
4198 case TEMPLATE_PARM_INDEX
:
4199 if (fn
&& (*fn
)(t
, data
))
4200 return error_mark_node
;
4202 return error_mark_node
;
4206 /* A template template parameter is encountered */
4207 if (DECL_TEMPLATE_TEMPLATE_PARM_P (t
)
4208 && for_each_template_parm (TREE_TYPE (t
), fn
, data
))
4209 return error_mark_node
;
4211 /* Already substituted template template parameter */
4216 if (!fn
|| for_each_template_parm (TYPENAME_TYPE_FULLNAME (t
), fn
, data
))
4217 return error_mark_node
;
4221 if (TREE_TYPE (t
) && TYPE_PTRMEMFUNC_P (TREE_TYPE (t
))
4222 && for_each_template_parm (TYPE_PTRMEMFUNC_FN_TYPE
4223 (TREE_TYPE (t
)), fn
, data
))
4224 return error_mark_node
;
4229 /* If there's no type, then this thing must be some expression
4230 involving template parameters. */
4231 if (!fn
&& !TREE_TYPE (t
))
4232 return error_mark_node
;
4237 case REINTERPRET_CAST_EXPR
:
4238 case CONST_CAST_EXPR
:
4239 case STATIC_CAST_EXPR
:
4240 case DYNAMIC_CAST_EXPR
:
4245 case PSEUDO_DTOR_EXPR
:
4247 return error_mark_node
;
4254 /* We didn't find any template parameters we liked. */
4258 /* For each TEMPLATE_TYPE_PARM, TEMPLATE_TEMPLATE_PARM, or
4259 TEMPLATE_PARM_INDEX in T, call FN with the parameter and the DATA.
4260 If FN returns non-zero, the iteration is terminated, and
4261 for_each_template_parm returns 1. Otherwise, the iteration
4262 continues. If FN never returns a non-zero value, the value
4263 returned by for_each_template_parm is 0. If FN is NULL, it is
4264 considered to be the function which always returns 1. */
4267 for_each_template_parm (t
, fn
, data
)
4272 struct pair_fn_data pfd
;
4278 /* Walk the tree. */
4279 return walk_tree (&t
, for_each_template_parm_r
, &pfd
) != NULL_TREE
;
4283 uses_template_parms (t
)
4286 return for_each_template_parm (t
, 0, 0);
4289 static int tinst_depth
;
4290 extern int max_tinst_depth
;
4291 #ifdef GATHER_STATISTICS
4294 static int tinst_level_tick
;
4295 static int last_template_error_tick
;
4297 /* Print out all the template instantiations that we are currently
4298 working on. If ERR, we are being called from cp_thing, so do
4299 the right thing for an error message. */
4302 print_template_context (err
)
4305 tree p
= current_tinst_level
;
4307 const char *file
= input_filename
;
4311 if (current_function_decl
!= TINST_DECL (p
)
4312 && current_function_decl
!= NULL_TREE
)
4313 /* We can get here during the processing of some synthesized
4314 method. Then, TINST_DECL (p) will be the function that's causing
4319 if (current_function_decl
== TINST_DECL (p
))
4320 /* Avoid redundancy with the the "In function" line. */;
4322 fprintf (stderr
, "%s: In instantiation of `%s':\n",
4323 file
, decl_as_string (TINST_DECL (p
),
4324 TS_DECL_TYPE
| TS_FUNC_NORETURN
));
4326 line
= TINST_LINE (p
);
4327 file
= TINST_FILE (p
);
4332 for (; p
; p
= TREE_CHAIN (p
))
4334 fprintf (stderr
, "%s:%d: instantiated from `%s'\n", file
, line
,
4335 decl_as_string (TINST_DECL (p
),
4336 TS_DECL_TYPE
| TS_FUNC_NORETURN
));
4337 line
= TINST_LINE (p
);
4338 file
= TINST_FILE (p
);
4340 fprintf (stderr
, "%s:%d: instantiated from here\n", file
, line
);
4343 /* Called from cp_thing to print the template context for an error. */
4346 maybe_print_template_context ()
4348 if (last_template_error_tick
== tinst_level_tick
4349 || current_tinst_level
== 0)
4352 last_template_error_tick
= tinst_level_tick
;
4353 print_template_context (1);
4356 /* We're starting to instantiate D; record the template instantiation context
4357 for diagnostics and to restore it later. */
4360 push_tinst_level (d
)
4365 if (tinst_depth
>= max_tinst_depth
)
4367 /* If the instantiation in question still has unbound template parms,
4368 we don't really care if we can't instantiate it, so just return.
4369 This happens with base instantiation for implicit `typename'. */
4370 if (uses_template_parms (d
))
4373 last_template_error_tick
= tinst_level_tick
;
4374 cp_error ("template instantiation depth exceeds maximum of %d (use -ftemplate-depth-NN to increase the maximum) instantiating `%D'",
4375 max_tinst_depth
, d
);
4377 print_template_context (0);
4382 new = build_expr_wfl (d
, input_filename
, lineno
, 0);
4383 TREE_CHAIN (new) = current_tinst_level
;
4384 current_tinst_level
= new;
4387 #ifdef GATHER_STATISTICS
4388 if (tinst_depth
> depth_reached
)
4389 depth_reached
= tinst_depth
;
4396 /* We're done instantiating this template; return to the instantiation
4402 tree old
= current_tinst_level
;
4404 /* Restore the filename and line number stashed away when we started
4405 this instantiation. */
4406 lineno
= TINST_LINE (old
);
4407 input_filename
= TINST_FILE (old
);
4408 extract_interface_info ();
4410 current_tinst_level
= TREE_CHAIN (old
);
4415 /* We're instantiating a deferred template; restore the template
4416 instantiation context in which the instantiation was requested, which
4417 is one step out from LEVEL. */
4420 reopen_tinst_level (level
)
4426 for (t
= level
; t
; t
= TREE_CHAIN (t
))
4429 current_tinst_level
= level
;
4433 /* Return the outermost template instantiation context, for use with
4434 -falt-external-templates. */
4439 tree p
= current_tinst_level
;
4442 for (; TREE_CHAIN (p
) ; p
= TREE_CHAIN (p
))
4447 /* DECL is a friend FUNCTION_DECL or TEMPLATE_DECL. ARGS is the
4448 vector of template arguments, as for tsubst.
4450 Returns an appropriate tsbust'd friend declaration. */
4453 tsubst_friend_function (decl
, args
)
4459 const char *file
= input_filename
;
4461 lineno
= DECL_SOURCE_LINE (decl
);
4462 input_filename
= DECL_SOURCE_FILE (decl
);
4464 if (TREE_CODE (decl
) == FUNCTION_DECL
4465 && DECL_TEMPLATE_INSTANTIATION (decl
)
4466 && TREE_CODE (DECL_TI_TEMPLATE (decl
)) != TEMPLATE_DECL
)
4467 /* This was a friend declared with an explicit template
4468 argument list, e.g.:
4472 to indicate that f was a template instantiation, not a new
4473 function declaration. Now, we have to figure out what
4474 instantiation of what template. */
4481 = lookup_template_function (tsubst_expr (DECL_TI_TEMPLATE (decl
),
4482 args
, /*complain=*/1,
4484 tsubst (DECL_TI_ARGS (decl
),
4485 args
, /*complain=*/1,
4487 new_friend
= tsubst (decl
, args
, /*complain=*/1, NULL_TREE
);
4488 tmpl
= determine_specialization (template_id
, new_friend
,
4490 /*need_member_template=*/0);
4491 new_friend
= instantiate_template (tmpl
, new_args
);
4495 new_friend
= tsubst (decl
, args
, /*complain=*/1, NULL_TREE
);
4497 /* The NEW_FRIEND will look like an instantiation, to the
4498 compiler, but is not an instantiation from the point of view of
4499 the language. For example, we might have had:
4501 template <class T> struct S {
4502 template <class U> friend void f(T, U);
4505 Then, in S<int>, template <class U> void f(int, U) is not an
4506 instantiation of anything. */
4507 DECL_USE_TEMPLATE (new_friend
) = 0;
4508 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
4509 DECL_USE_TEMPLATE (DECL_TEMPLATE_RESULT (new_friend
)) = 0;
4511 /* The mangled name for the NEW_FRIEND is incorrect. The call to
4512 tsubst will have resulted in a call to
4513 set_mangled_name_for_template_decl. But, the function is not a
4514 template instantiation and should not be mangled like one.
4515 Therefore, we remangle the function name. We don't have to do
4516 this if the NEW_FRIEND is a template since
4517 set_mangled_name_for_template_decl doesn't do anything if the
4518 function declaration still uses template arguments. */
4519 if (TREE_CODE (new_friend
) != TEMPLATE_DECL
)
4521 set_mangled_name_for_decl (new_friend
);
4522 DECL_RTL (new_friend
) = 0;
4523 make_decl_rtl (new_friend
, NULL_PTR
, 1);
4526 if (DECL_NAMESPACE_SCOPE_P (new_friend
))
4529 tree new_friend_template_info
;
4530 tree new_friend_result_template_info
;
4532 int new_friend_is_defn
;
4534 /* We must save some information from NEW_FRIEND before calling
4535 duplicate decls since that function will free NEW_FRIEND if
4537 new_friend_template_info
= DECL_TEMPLATE_INFO (new_friend
);
4538 if (TREE_CODE (new_friend
) == TEMPLATE_DECL
)
4540 /* This declaration is a `primary' template. */
4541 DECL_PRIMARY_TEMPLATE (new_friend
) = new_friend
;
4544 = DECL_INITIAL (DECL_TEMPLATE_RESULT (new_friend
)) != NULL_TREE
;
4545 new_friend_result_template_info
4546 = DECL_TEMPLATE_INFO (DECL_TEMPLATE_RESULT (new_friend
));
4550 new_friend_is_defn
= DECL_INITIAL (new_friend
) != NULL_TREE
;
4551 new_friend_result_template_info
= NULL_TREE
;
4554 /* Inside pushdecl_namespace_level, we will push into the
4555 current namespace. However, the friend function should go
4556 into the namespace of the template. */
4557 ns
= decl_namespace_context (new_friend
);
4558 push_nested_namespace (ns
);
4559 old_decl
= pushdecl_namespace_level (new_friend
);
4560 pop_nested_namespace (ns
);
4562 if (old_decl
!= new_friend
)
4564 /* This new friend declaration matched an existing
4565 declaration. For example, given:
4567 template <class T> void f(T);
4568 template <class U> class C {
4569 template <class T> friend void f(T) {}
4572 the friend declaration actually provides the definition
4573 of `f', once C has been instantiated for some type. So,
4574 old_decl will be the out-of-class template declaration,
4575 while new_friend is the in-class definition.
4577 But, if `f' was called before this point, the
4578 instantiation of `f' will have DECL_TI_ARGS corresponding
4579 to `T' but not to `U', references to which might appear
4580 in the definition of `f'. Previously, the most general
4581 template for an instantiation of `f' was the out-of-class
4582 version; now it is the in-class version. Therefore, we
4583 run through all specialization of `f', adding to their
4584 DECL_TI_ARGS appropriately. In particular, they need a
4585 new set of outer arguments, corresponding to the
4586 arguments for this class instantiation.
4588 The same situation can arise with something like this:
4591 template <class T> class C {
4595 when `C<int>' is instantiated. Now, `f(int)' is defined
4598 if (!new_friend_is_defn
)
4599 /* On the other hand, if the in-class declaration does
4600 *not* provide a definition, then we don't want to alter
4601 existing definitions. We can just leave everything
4606 /* Overwrite whatever template info was there before, if
4607 any, with the new template information pertaining to
4609 DECL_TEMPLATE_INFO (old_decl
) = new_friend_template_info
;
4611 if (TREE_CODE (old_decl
) != TEMPLATE_DECL
)
4612 /* duplicate_decls will take care of this case. */
4617 tree new_friend_args
;
4619 DECL_TEMPLATE_INFO (DECL_TEMPLATE_RESULT (old_decl
))
4620 = new_friend_result_template_info
;
4622 new_friend_args
= TI_ARGS (new_friend_template_info
);
4623 for (t
= DECL_TEMPLATE_SPECIALIZATIONS (old_decl
);
4627 tree spec
= TREE_VALUE (t
);
4630 = add_outermost_template_args (new_friend_args
,
4631 DECL_TI_ARGS (spec
));
4634 /* Now, since specializations are always supposed to
4635 hang off of the most general template, we must move
4637 t
= most_general_template (old_decl
);
4640 DECL_TEMPLATE_SPECIALIZATIONS (t
)
4641 = chainon (DECL_TEMPLATE_SPECIALIZATIONS (t
),
4642 DECL_TEMPLATE_SPECIALIZATIONS (old_decl
));
4643 DECL_TEMPLATE_SPECIALIZATIONS (old_decl
) = NULL_TREE
;
4648 /* The information from NEW_FRIEND has been merged into OLD_DECL
4649 by duplicate_decls. */
4650 new_friend
= old_decl
;
4653 else if (COMPLETE_TYPE_P (DECL_CONTEXT (new_friend
)))
4655 /* Check to see that the declaration is really present, and,
4656 possibly obtain an improved declaration. */
4657 tree fn
= check_classfn (DECL_CONTEXT (new_friend
),
4666 input_filename
= file
;
4670 /* FRIEND_TMPL is a friend TEMPLATE_DECL. ARGS is the vector of
4671 template arguments, as for tsubst.
4673 Returns an appropriate tsbust'd friend type. */
4676 tsubst_friend_class (friend_tmpl
, args
)
4683 /* First, we look for a class template. */
4684 tmpl
= lookup_name (DECL_NAME (friend_tmpl
), /*prefer_type=*/0);
4686 /* But, if we don't find one, it might be because we're in a
4687 situation like this:
4695 Here, in the scope of (say) S<int>, `S' is bound to a TYPE_DECL
4696 for `S<int>', not the TEMPLATE_DECL. */
4697 if (!tmpl
|| !DECL_CLASS_TEMPLATE_P (tmpl
))
4699 tmpl
= lookup_name (DECL_NAME (friend_tmpl
), /*prefer_type=*/1);
4700 tmpl
= maybe_get_template_decl_from_type_decl (tmpl
);
4703 if (tmpl
&& DECL_CLASS_TEMPLATE_P (tmpl
))
4705 /* The friend template has already been declared. Just
4706 check to see that the declarations match, and install any new
4707 default parameters. We must tsubst the default parameters,
4708 of course. We only need the innermost template parameters
4709 because that is all that redeclare_class_template will look
4712 = tsubst_template_parms (DECL_TEMPLATE_PARMS (friend_tmpl
),
4713 args
, /*complain=*/1);
4714 redeclare_class_template (TREE_TYPE (tmpl
), parms
);
4715 friend_type
= TREE_TYPE (tmpl
);
4719 /* The friend template has not already been declared. In this
4720 case, the instantiation of the template class will cause the
4721 injection of this template into the global scope. */
4722 tmpl
= tsubst (friend_tmpl
, args
, /*complain=*/1, NULL_TREE
);
4724 /* The new TMPL is not an instantiation of anything, so we
4725 forget its origins. We don't reset CLASSTYPE_TI_TEMPLATE for
4726 the new type because that is supposed to be the corresponding
4727 template decl, i.e., TMPL. */
4728 DECL_USE_TEMPLATE (tmpl
) = 0;
4729 DECL_TEMPLATE_INFO (tmpl
) = NULL_TREE
;
4730 CLASSTYPE_USE_TEMPLATE (TREE_TYPE (tmpl
)) = 0;
4732 /* Inject this template into the global scope. */
4733 friend_type
= TREE_TYPE (pushdecl_top_level (tmpl
));
4740 instantiate_class_template (type
)
4743 tree
template, args
, pattern
, t
;
4746 if (type
== error_mark_node
)
4747 return error_mark_node
;
4749 if (TYPE_BEING_DEFINED (type
) || COMPLETE_TYPE_P (type
))
4752 /* Figure out which template is being instantiated. */
4753 template = most_general_template (CLASSTYPE_TI_TEMPLATE (type
));
4754 my_friendly_assert (TREE_CODE (template) == TEMPLATE_DECL
, 279);
4756 /* Figure out which arguments are being used to do the
4758 args
= CLASSTYPE_TI_ARGS (type
);
4759 PARTIAL_INSTANTIATION_P (type
) = uses_template_parms (args
);
4761 if (pedantic
&& PARTIAL_INSTANTIATION_P (type
))
4762 /* If this is a partial instantiation, then we can't instantiate
4763 the type; there's no telling whether or not one of the
4764 template parameters might eventually be instantiated to some
4765 value that results in a specialization being used. For
4777 Now, the `S<U>' in `f<int>' is the specialization, not an
4778 instantiation of the original template. */
4781 /* Determine what specialization of the original template to
4783 if (PARTIAL_INSTANTIATION_P (type
))
4784 /* There's no telling which specialization is appropriate at this
4785 point. Since all peeking at the innards of this partial
4786 instantiation are extensions (like the "implicit typename"
4787 extension, which allows users to omit the keyword `typename' on
4788 names that are declared as types in template base classes), we
4789 are free to do what we please.
4791 Trying to figure out which partial instantiation to use can
4792 cause a crash. (Some of the template arguments don't even have
4793 types.) So, we just use the most general version. */
4797 t
= most_specialized_class (template, args
);
4799 if (t
== error_mark_node
)
4801 const char *str
= "candidates are:";
4802 cp_error ("ambiguous class template instantiation for `%#T'", type
);
4803 for (t
= DECL_TEMPLATE_SPECIALIZATIONS (template); t
;
4806 if (get_class_bindings (TREE_VALUE (t
), TREE_PURPOSE (t
),
4809 cp_error_at ("%s %+#T", str
, TREE_TYPE (t
));
4813 TYPE_BEING_DEFINED (type
) = 1;
4814 return error_mark_node
;
4819 pattern
= TREE_TYPE (t
);
4821 pattern
= TREE_TYPE (template);
4823 /* If the template we're instantiating is incomplete, then clearly
4824 there's nothing we can do. */
4825 if (!COMPLETE_TYPE_P (pattern
))
4828 /* If this is a partial instantiation, don't tsubst anything. We will
4829 only use this type for implicit typename, so the actual contents don't
4830 matter. All that matters is whether a particular name is a type. */
4831 if (PARTIAL_INSTANTIATION_P (type
))
4833 /* The fields set here must be kept in sync with those cleared
4834 in begin_class_definition. */
4835 TYPE_BINFO_BASETYPES (type
) = TYPE_BINFO_BASETYPES (pattern
);
4836 TYPE_FIELDS (type
) = TYPE_FIELDS (pattern
);
4837 TYPE_METHODS (type
) = TYPE_METHODS (pattern
);
4838 CLASSTYPE_TAGS (type
) = CLASSTYPE_TAGS (pattern
);
4839 /* Pretend that the type is complete, so that we will look
4840 inside it during name lookup and such. */
4841 TYPE_SIZE (type
) = bitsize_zero_node
;
4845 /* If we've recursively instantiated too many templates, stop. */
4846 if (! push_tinst_level (type
))
4849 /* Now we're really doing the instantiation. Mark the type as in
4850 the process of being defined. */
4851 TYPE_BEING_DEFINED (type
) = 1;
4853 maybe_push_to_top_level (uses_template_parms (type
));
4857 /* This TYPE is actually a instantiation of of a partial
4858 specialization. We replace the innermost set of ARGS with
4859 the arguments appropriate for substitution. For example,
4862 template <class T> struct S {};
4863 template <class T> struct S<T*> {};
4865 and supposing that we are instantiating S<int*>, ARGS will
4866 present be {int*} but we need {int}. */
4868 = get_class_bindings (TREE_VALUE (t
), TREE_PURPOSE (t
),
4871 /* If there were multiple levels in ARGS, replacing the
4872 innermost level would alter CLASSTYPE_TI_ARGS, which we don't
4873 want, so we make a copy first. */
4874 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (args
))
4876 args
= copy_node (args
);
4877 SET_TMPL_ARGS_LEVEL (args
, TMPL_ARGS_DEPTH (args
), inner_args
);
4883 if (flag_external_templates
)
4885 if (flag_alt_external_templates
)
4887 CLASSTYPE_INTERFACE_ONLY (type
) = interface_only
;
4888 SET_CLASSTYPE_INTERFACE_UNKNOWN_X (type
, interface_unknown
);
4889 CLASSTYPE_VTABLE_NEEDS_WRITING (type
)
4890 = (! CLASSTYPE_INTERFACE_ONLY (type
)
4891 && CLASSTYPE_INTERFACE_KNOWN (type
));
4895 CLASSTYPE_INTERFACE_ONLY (type
) = CLASSTYPE_INTERFACE_ONLY (pattern
);
4896 SET_CLASSTYPE_INTERFACE_UNKNOWN_X
4897 (type
, CLASSTYPE_INTERFACE_UNKNOWN (pattern
));
4898 CLASSTYPE_VTABLE_NEEDS_WRITING (type
)
4899 = (! CLASSTYPE_INTERFACE_ONLY (type
)
4900 && CLASSTYPE_INTERFACE_KNOWN (type
));
4905 SET_CLASSTYPE_INTERFACE_UNKNOWN (type
);
4906 CLASSTYPE_VTABLE_NEEDS_WRITING (type
) = 1;
4909 TYPE_HAS_CONSTRUCTOR (type
) = TYPE_HAS_CONSTRUCTOR (pattern
);
4910 TYPE_HAS_DESTRUCTOR (type
) = TYPE_HAS_DESTRUCTOR (pattern
);
4911 TYPE_OVERLOADS_CALL_EXPR (type
) = TYPE_OVERLOADS_CALL_EXPR (pattern
);
4912 TYPE_OVERLOADS_ARRAY_REF (type
) = TYPE_OVERLOADS_ARRAY_REF (pattern
);
4913 TYPE_OVERLOADS_ARROW (type
) = TYPE_OVERLOADS_ARROW (pattern
);
4914 TYPE_HAS_NEW_OPERATOR (type
) = TYPE_HAS_NEW_OPERATOR (pattern
);
4915 TYPE_HAS_ARRAY_NEW_OPERATOR (type
) = TYPE_HAS_ARRAY_NEW_OPERATOR (pattern
);
4916 TYPE_GETS_DELETE (type
) = TYPE_GETS_DELETE (pattern
);
4917 TYPE_VEC_DELETE_TAKES_SIZE (type
) = TYPE_VEC_DELETE_TAKES_SIZE (pattern
);
4918 TYPE_HAS_ASSIGN_REF (type
) = TYPE_HAS_ASSIGN_REF (pattern
);
4919 TYPE_HAS_CONST_ASSIGN_REF (type
) = TYPE_HAS_CONST_ASSIGN_REF (pattern
);
4920 TYPE_HAS_ABSTRACT_ASSIGN_REF (type
) = TYPE_HAS_ABSTRACT_ASSIGN_REF (pattern
);
4921 TYPE_HAS_INIT_REF (type
) = TYPE_HAS_INIT_REF (pattern
);
4922 TYPE_HAS_CONST_INIT_REF (type
) = TYPE_HAS_CONST_INIT_REF (pattern
);
4923 TYPE_HAS_DEFAULT_CONSTRUCTOR (type
) = TYPE_HAS_DEFAULT_CONSTRUCTOR (pattern
);
4924 TYPE_HAS_CONVERSION (type
) = TYPE_HAS_CONVERSION (pattern
);
4925 TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (type
)
4926 = TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (pattern
);
4927 TYPE_USES_MULTIPLE_INHERITANCE (type
)
4928 = TYPE_USES_MULTIPLE_INHERITANCE (pattern
);
4929 TYPE_USES_VIRTUAL_BASECLASSES (type
)
4930 = TYPE_USES_VIRTUAL_BASECLASSES (pattern
);
4931 TYPE_PACKED (type
) = TYPE_PACKED (pattern
);
4932 TYPE_ALIGN (type
) = TYPE_ALIGN (pattern
);
4933 TYPE_USER_ALIGN (type
) = TYPE_USER_ALIGN (pattern
);
4934 TYPE_FOR_JAVA (type
) = TYPE_FOR_JAVA (pattern
); /* For libjava's JArray<T> */
4935 if (ANON_AGGR_TYPE_P (pattern
))
4936 SET_ANON_AGGR_TYPE_P (type
);
4938 if (TYPE_BINFO_BASETYPES (pattern
))
4940 tree base_list
= NULL_TREE
;
4941 tree pbases
= TYPE_BINFO_BASETYPES (pattern
);
4944 /* Substitute into each of the bases to determine the actual
4946 for (i
= 0; i
< TREE_VEC_LENGTH (pbases
); ++i
)
4952 pbase
= TREE_VEC_ELT (pbases
, i
);
4954 /* Substitue to figure out the base class. */
4955 base
= tsubst (BINFO_TYPE (pbase
), args
,
4956 /*complain=*/1, NULL_TREE
);
4957 if (base
== error_mark_node
)
4960 /* Calculate the correct access node. */
4961 if (TREE_VIA_VIRTUAL (pbase
))
4963 if (TREE_VIA_PUBLIC (pbase
))
4964 access
= access_public_virtual_node
;
4965 else if (TREE_VIA_PROTECTED (pbase
))
4966 access
= access_protected_virtual_node
;
4968 access
= access_private_virtual_node
;
4972 if (TREE_VIA_PUBLIC (pbase
))
4973 access
= access_public_node
;
4974 else if (TREE_VIA_PROTECTED (pbase
))
4975 access
= access_protected_node
;
4977 access
= access_private_node
;
4980 base_list
= tree_cons (access
, base
, base_list
);
4983 /* The list is now in reverse order; correct that. */
4984 base_list
= nreverse (base_list
);
4986 /* Now call xref_basetypes to set up all the base-class
4988 xref_basetypes (TREE_CODE (pattern
) == RECORD_TYPE
4989 ? (CLASSTYPE_DECLARED_CLASS (pattern
)
4990 ? class_type_node
: record_type_node
)
4992 DECL_NAME (TYPE_NAME (pattern
)),
4997 /* Now that our base classes are set up, enter the scope of the
4998 class, so that name lookups into base classes, etc. will work
4999 corectly. This is precisely analagous to what we do in
5000 begin_class_definition when defining an ordinary non-template
5002 pushclass (type
, 1);
5004 for (t
= CLASSTYPE_TAGS (pattern
); t
; t
= TREE_CHAIN (t
))
5006 tree tag
= TREE_VALUE (t
);
5007 tree name
= TYPE_IDENTIFIER (tag
);
5010 newtag
= tsubst (tag
, args
, /*complain=*/1, NULL_TREE
);
5011 if (TREE_CODE (newtag
) != ENUMERAL_TYPE
)
5013 if (TYPE_LANG_SPECIFIC (tag
) && CLASSTYPE_IS_TEMPLATE (tag
))
5014 /* Unfortunately, lookup_template_class sets
5015 CLASSTYPE_IMPLICIT_INSTANTIATION for a partial
5016 instantiation (i.e., for the type of a member template
5017 class nested within a template class.) This behavior is
5018 required for maybe_process_partial_specialization to work
5019 correctly, but is not accurate in this case; the TAG is not
5020 an instantiation of anything. (The corresponding
5021 TEMPLATE_DECL is an instantiation, but the TYPE is not.) */
5022 CLASSTYPE_USE_TEMPLATE (newtag
) = 0;
5024 /* Now, we call pushtag to put this NEWTAG into the scope of
5025 TYPE. We first set up the IDENTIFIER_TYPE_VALUE to avoid
5026 pushtag calling push_template_decl. We don't have to do
5027 this for enums because it will already have been done in
5030 SET_IDENTIFIER_TYPE_VALUE (name
, newtag
);
5031 pushtag (name
, newtag
, /*globalize=*/0);
5035 /* Don't replace enum constants here. */
5036 for (t
= TYPE_FIELDS (pattern
); t
; t
= TREE_CHAIN (t
))
5037 if (TREE_CODE (t
) != CONST_DECL
)
5041 /* The the file and line for this declaration, to assist in
5042 error message reporting. Since we called push_tinst_level
5043 above, we don't need to restore these. */
5044 lineno
= DECL_SOURCE_LINE (t
);
5045 input_filename
= DECL_SOURCE_FILE (t
);
5047 r
= tsubst (t
, args
, /*complain=*/1, NULL_TREE
);
5048 if (TREE_CODE (r
) == VAR_DECL
)
5052 if (DECL_DEFINED_IN_CLASS_P (r
))
5053 init
= tsubst_expr (DECL_INITIAL (t
), args
,
5054 /*complain=*/1, NULL_TREE
);
5058 finish_static_data_member_decl (r
, init
,
5059 /*asmspec_tree=*/NULL_TREE
,
5062 if (DECL_DEFINED_IN_CLASS_P (r
))
5063 check_static_variable_definition (r
, TREE_TYPE (r
));
5066 /* R will have a TREE_CHAIN if and only if it has already been
5067 processed by finish_member_declaration. This can happen
5068 if, for example, it is a TYPE_DECL for a class-scoped
5069 ENUMERAL_TYPE; such a thing will already have been added to
5070 the field list by tsubst_enum above. */
5071 if (!TREE_CHAIN (r
))
5073 set_current_access_from_decl (r
);
5074 finish_member_declaration (r
);
5078 /* Set up the list (TYPE_METHODS) and vector (CLASSTYPE_METHOD_VEC)
5079 for this instantiation. */
5080 for (t
= TYPE_METHODS (pattern
); t
; t
= TREE_CHAIN (t
))
5082 tree r
= tsubst (t
, args
, /*complain=*/1, NULL_TREE
);
5083 set_current_access_from_decl (r
);
5084 finish_member_declaration (r
);
5087 /* Construct the DECL_FRIENDLIST for the new class type. */
5088 typedecl
= TYPE_MAIN_DECL (type
);
5089 for (t
= DECL_FRIENDLIST (TYPE_MAIN_DECL (pattern
));
5095 for (friends
= TREE_VALUE (t
);
5096 friends
!= NULL_TREE
;
5097 friends
= TREE_CHAIN (friends
))
5098 if (TREE_PURPOSE (friends
) == error_mark_node
)
5100 tsubst_friend_function (TREE_VALUE (friends
),
5103 my_friendly_abort (20000216);
5106 for (t
= CLASSTYPE_FRIEND_CLASSES (pattern
);
5110 tree friend_type
= TREE_VALUE (t
);
5111 tree new_friend_type
;
5113 if (TREE_CODE (friend_type
) == TEMPLATE_DECL
)
5114 new_friend_type
= tsubst_friend_class (friend_type
, args
);
5115 else if (uses_template_parms (friend_type
))
5116 new_friend_type
= tsubst (friend_type
, args
, /*complain=*/1,
5120 tree ns
= decl_namespace_context (TYPE_MAIN_DECL (friend_type
));
5122 /* The call to xref_tag_from_type does injection for friend
5124 push_nested_namespace (ns
);
5126 xref_tag_from_type (friend_type
, NULL_TREE
, 1);
5127 pop_nested_namespace (ns
);
5130 if (TREE_CODE (friend_type
) == TEMPLATE_DECL
)
5131 /* Trick make_friend_class into realizing that the friend
5132 we're adding is a template, not an ordinary class. It's
5133 important that we use make_friend_class since it will
5134 perform some error-checking and output cross-reference
5136 ++processing_template_decl
;
5138 make_friend_class (type
, new_friend_type
);
5140 if (TREE_CODE (friend_type
) == TEMPLATE_DECL
)
5141 --processing_template_decl
;
5144 for (t
= TYPE_FIELDS (type
); t
; t
= TREE_CHAIN (t
))
5145 if (TREE_CODE (t
) == FIELD_DECL
)
5147 TREE_TYPE (t
) = complete_type (TREE_TYPE (t
));
5148 require_complete_type (t
);
5151 /* Set the file and line number information to whatever is given for
5152 the class itself. This puts error messages involving generated
5153 implicit functions at a predictable point, and the same point
5154 that would be used for non-template classes. */
5155 lineno
= DECL_SOURCE_LINE (typedecl
);
5156 input_filename
= DECL_SOURCE_FILE (typedecl
);
5158 unreverse_member_declarations (type
);
5159 finish_struct_1 (type
);
5160 CLASSTYPE_GOT_SEMICOLON (type
) = 1;
5162 /* Clear this now so repo_template_used is happy. */
5163 TYPE_BEING_DEFINED (type
) = 0;
5164 repo_template_used (type
);
5166 /* Now that the class is complete, instantiate default arguments for
5167 any member functions. We don't do this earlier because the
5168 default arguments may reference members of the class. */
5169 if (!PRIMARY_TEMPLATE_P (template))
5170 for (t
= TYPE_METHODS (type
); t
; t
= TREE_CHAIN (t
))
5171 if (TREE_CODE (t
) == FUNCTION_DECL
5172 /* Implicitly generated member functions will not have tmplate
5173 information; they are not instantiations, but instead are
5174 created "fresh" for each instantiation. */
5175 && DECL_TEMPLATE_INFO (t
))
5176 tsubst_default_arguments (t
);
5179 pop_from_top_level ();
5189 if (t1
== NULL_TREE
)
5190 return t2
== NULL_TREE
;
5191 if (t2
== NULL_TREE
)
5193 /* Don't care if one declares its arg const and the other doesn't -- the
5194 main variant of the arg type is all that matters. */
5195 if (TYPE_MAIN_VARIANT (TREE_VALUE (t1
))
5196 != TYPE_MAIN_VARIANT (TREE_VALUE (t2
)))
5198 return list_eq (TREE_CHAIN (t1
), TREE_CHAIN (t2
));
5201 /* If arg is a non-type template parameter that does not depend on template
5202 arguments, fold it like we weren't in the body of a template. */
5205 maybe_fold_nontype_arg (arg
)
5208 /* If we're not in a template, ARG is already as simple as it's going to
5209 get, and trying to reprocess the trees will break. */
5210 if (! processing_template_decl
)
5213 if (!TYPE_P (arg
) && !uses_template_parms (arg
))
5215 /* Sometimes, one of the args was an expression involving a
5216 template constant parameter, like N - 1. Now that we've
5217 tsubst'd, we might have something like 2 - 1. This will
5218 confuse lookup_template_class, so we do constant folding
5219 here. We have to unset processing_template_decl, to
5220 fool build_expr_from_tree() into building an actual
5223 int saved_processing_template_decl
= processing_template_decl
;
5224 processing_template_decl
= 0;
5225 arg
= fold (build_expr_from_tree (arg
));
5226 processing_template_decl
= saved_processing_template_decl
;
5231 /* Substitute ARGS into the vector of template arguments T. */
5234 tsubst_template_arg_vector (t
, args
, complain
)
5239 int len
= TREE_VEC_LENGTH (t
), need_new
= 0, i
;
5240 tree
*elts
= (tree
*) alloca (len
* sizeof (tree
));
5242 bzero ((char *) elts
, len
* sizeof (tree
));
5244 for (i
= 0; i
< len
; i
++)
5246 if (TREE_VEC_ELT (t
, i
) != NULL_TREE
5247 && TREE_CODE (TREE_VEC_ELT (t
, i
)) == TREE_VEC
)
5248 elts
[i
] = tsubst_template_arg_vector (TREE_VEC_ELT (t
, i
),
5251 elts
[i
] = maybe_fold_nontype_arg
5252 (tsubst_expr (TREE_VEC_ELT (t
, i
), args
, complain
,
5255 if (elts
[i
] != TREE_VEC_ELT (t
, i
))
5262 t
= make_tree_vec (len
);
5263 for (i
= 0; i
< len
; i
++)
5264 TREE_VEC_ELT (t
, i
) = elts
[i
];
5269 /* Return the result of substituting ARGS into the template parameters
5270 given by PARMS. If there are m levels of ARGS and m + n levels of
5271 PARMS, then the result will contain n levels of PARMS. For
5272 example, if PARMS is `template <class T> template <class U>
5273 template <T*, U, class V>' and ARGS is {{int}, {double}} then the
5274 result will be `template <int*, double, class V>'. */
5277 tsubst_template_parms (parms
, args
, complain
)
5285 for (new_parms
= &r
;
5286 TMPL_PARMS_DEPTH (parms
) > TMPL_ARGS_DEPTH (args
);
5287 new_parms
= &(TREE_CHAIN (*new_parms
)),
5288 parms
= TREE_CHAIN (parms
))
5291 make_tree_vec (TREE_VEC_LENGTH (TREE_VALUE (parms
)));
5294 for (i
= 0; i
< TREE_VEC_LENGTH (new_vec
); ++i
)
5296 tree default_value
=
5297 TREE_PURPOSE (TREE_VEC_ELT (TREE_VALUE (parms
), i
));
5299 TREE_VALUE (TREE_VEC_ELT (TREE_VALUE (parms
), i
));
5301 TREE_VEC_ELT (new_vec
, i
)
5302 = build_tree_list (tsubst (default_value
, args
, complain
,
5304 tsubst (parm_decl
, args
, complain
,
5309 tree_cons (build_int_2 (0, (TMPL_PARMS_DEPTH (parms
)
5310 - TMPL_ARGS_DEPTH (args
))),
5311 new_vec
, NULL_TREE
);
5317 /* Substitute the ARGS into the indicated aggregate (or enumeration)
5318 type T. If T is not an aggregate or enumeration type, it is
5319 handled as if by tsubst. IN_DECL is as for tsubst. If
5320 ENTERING_SCOPE is non-zero, T is the context for a template which
5321 we are presently tsubst'ing. Return the subsituted value. */
5324 tsubst_aggr_type (t
, args
, complain
, in_decl
, entering_scope
)
5334 switch (TREE_CODE (t
))
5337 if (TYPE_PTRMEMFUNC_P (t
))
5339 tree r
= build_ptrmemfunc_type
5340 (tsubst (TYPE_PTRMEMFUNC_FN_TYPE (t
), args
, complain
, in_decl
));
5341 return cp_build_qualified_type_real (r
, TYPE_QUALS (t
),
5345 /* else fall through */
5348 if (TYPE_TEMPLATE_INFO (t
))
5354 /* First, determine the context for the type we are looking
5356 if (TYPE_CONTEXT (t
) != NULL_TREE
)
5357 context
= tsubst_aggr_type (TYPE_CONTEXT (t
), args
,
5359 in_decl
, /*entering_scope=*/1);
5361 context
= NULL_TREE
;
5363 /* Then, figure out what arguments are appropriate for the
5364 type we are trying to find. For example, given:
5366 template <class T> struct S;
5367 template <class T, class U> void f(T, U) { S<U> su; }
5369 and supposing that we are instantiating f<int, double>,
5370 then our ARGS will be {int, double}, but, when looking up
5371 S we only want {double}. */
5372 argvec
= tsubst_template_arg_vector (TYPE_TI_ARGS (t
), args
,
5375 r
= lookup_template_class (t
, argvec
, in_decl
, context
,
5378 return cp_build_qualified_type_real (r
, TYPE_QUALS (t
),
5382 /* This is not a template type, so there's nothing to do. */
5386 return tsubst (t
, args
, complain
, in_decl
);
5390 /* Substitute into the default argument ARG (a default argument for
5391 FN), which has the indicated TYPE. */
5394 tsubst_default_argument (fn
, type
, arg
)
5399 /* This default argument came from a template. Instantiate the
5400 default argument here, not in tsubst. In the case of
5409 we must be careful to do name lookup in the scope of S<T>,
5410 rather than in the current class. */
5411 if (DECL_CLASS_SCOPE_P (fn
))
5412 pushclass (DECL_CONTEXT (fn
), 2);
5414 arg
= tsubst_expr (arg
, DECL_TI_ARGS (fn
), /*complain=*/1, NULL_TREE
);
5416 if (DECL_CLASS_SCOPE_P (fn
))
5419 /* Make sure the default argument is reasonable. */
5420 arg
= check_default_argument (type
, arg
);
5425 /* Substitute into all the default arguments for FN. */
5428 tsubst_default_arguments (fn
)
5434 tmpl_args
= DECL_TI_ARGS (fn
);
5436 /* If this function is not yet instantiated, we certainly don't need
5437 its default arguments. */
5438 if (uses_template_parms (tmpl_args
))
5441 for (arg
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
5443 arg
= TREE_CHAIN (arg
))
5444 if (TREE_PURPOSE (arg
))
5445 TREE_PURPOSE (arg
) = tsubst_default_argument (fn
,
5447 TREE_PURPOSE (arg
));
5450 /* Substitute the ARGS into the T, which is a _DECL. TYPE is the
5451 (already computed) substitution of ARGS into TREE_TYPE (T), if
5452 appropriate. Return the result of the substitution. IN_DECL is as
5456 tsubst_decl (t
, args
, type
, in_decl
)
5463 const char *saved_filename
;
5466 /* Set the filename and linenumber to improve error-reporting. */
5467 saved_lineno
= lineno
;
5468 saved_filename
= input_filename
;
5469 lineno
= DECL_SOURCE_LINE (t
);
5470 input_filename
= DECL_SOURCE_FILE (t
);
5472 switch (TREE_CODE (t
))
5476 /* We can get here when processing a member template function
5477 of a template class. */
5478 tree decl
= DECL_TEMPLATE_RESULT (t
);
5480 int is_template_template_parm
= DECL_TEMPLATE_TEMPLATE_PARM_P (t
);
5482 if (!is_template_template_parm
)
5484 /* We might already have an instance of this template.
5485 The ARGS are for the surrounding class type, so the
5486 full args contain the tsubst'd args for the context,
5487 plus the innermost args from the template decl. */
5488 tree tmpl_args
= DECL_CLASS_TEMPLATE_P (t
)
5489 ? CLASSTYPE_TI_ARGS (TREE_TYPE (t
))
5490 : DECL_TI_ARGS (DECL_TEMPLATE_RESULT (t
));
5493 full_args
= tsubst_template_arg_vector (tmpl_args
, args
,
5496 /* tsubst_template_arg_vector doesn't copy the vector if
5497 nothing changed. But, *something* should have
5499 my_friendly_assert (full_args
!= tmpl_args
, 0);
5501 spec
= retrieve_specialization (t
, full_args
);
5502 if (spec
!= NULL_TREE
)
5509 /* Make a new template decl. It will be similar to the
5510 original, but will record the current template arguments.
5511 We also create a new function declaration, which is just
5512 like the old one, but points to this new template, rather
5513 than the old one. */
5515 my_friendly_assert (DECL_LANG_SPECIFIC (r
) != 0, 0);
5516 TREE_CHAIN (r
) = NULL_TREE
;
5518 if (is_template_template_parm
)
5520 tree new_decl
= tsubst (decl
, args
, /*complain=*/1, in_decl
);
5521 DECL_TEMPLATE_RESULT (r
) = new_decl
;
5522 TREE_TYPE (r
) = TREE_TYPE (new_decl
);
5527 = tsubst_aggr_type (DECL_CONTEXT (t
), args
,
5528 /*complain=*/1, in_decl
,
5529 /*entering_scope=*/1);
5530 DECL_VIRTUAL_CONTEXT (r
)
5531 = tsubst_aggr_type (DECL_VIRTUAL_CONTEXT (t
), args
,
5532 /*complain=*/1, in_decl
,
5533 /*entering_scope=*/1);
5534 DECL_TEMPLATE_INFO (r
) = build_tree_list (t
, args
);
5536 if (TREE_CODE (decl
) == TYPE_DECL
)
5538 tree new_type
= tsubst (TREE_TYPE (t
), args
,
5539 /*complain=*/1, in_decl
);
5540 TREE_TYPE (r
) = new_type
;
5541 CLASSTYPE_TI_TEMPLATE (new_type
) = r
;
5542 DECL_TEMPLATE_RESULT (r
) = TYPE_MAIN_DECL (new_type
);
5543 DECL_TI_ARGS (r
) = CLASSTYPE_TI_ARGS (new_type
);
5547 tree new_decl
= tsubst (decl
, args
, /*complain=*/1, in_decl
);
5549 DECL_TEMPLATE_RESULT (r
) = new_decl
;
5550 DECL_TI_TEMPLATE (new_decl
) = r
;
5551 TREE_TYPE (r
) = TREE_TYPE (new_decl
);
5552 DECL_TI_ARGS (r
) = DECL_TI_ARGS (new_decl
);
5555 SET_DECL_IMPLICIT_INSTANTIATION (r
);
5556 DECL_TEMPLATE_INSTANTIATIONS (r
) = NULL_TREE
;
5557 DECL_TEMPLATE_SPECIALIZATIONS (r
) = NULL_TREE
;
5559 /* The template parameters for this new template are all the
5560 template parameters for the old template, except the
5561 outermost level of parameters. */
5562 DECL_TEMPLATE_PARMS (r
)
5563 = tsubst_template_parms (DECL_TEMPLATE_PARMS (t
), args
,
5566 if (PRIMARY_TEMPLATE_P (t
))
5567 DECL_PRIMARY_TEMPLATE (r
) = r
;
5569 /* We don't partially instantiate partial specializations. */
5570 if (TREE_CODE (decl
) == TYPE_DECL
)
5573 /* Record this partial instantiation. */
5574 register_specialization (r
, t
,
5575 DECL_TI_ARGS (DECL_TEMPLATE_RESULT (r
)));
5583 tree argvec
= NULL_TREE
;
5590 /* Nobody should be tsubst'ing into non-template functions. */
5591 my_friendly_assert (DECL_TEMPLATE_INFO (t
) != NULL_TREE
, 0);
5593 if (TREE_CODE (DECL_TI_TEMPLATE (t
)) == TEMPLATE_DECL
)
5597 /* Calculate the most general template of which R is a
5598 specialization, and the complete set of arguments used to
5600 gen_tmpl
= most_general_template (DECL_TI_TEMPLATE (t
));
5602 = tsubst_template_arg_vector (DECL_TI_ARGS
5603 (DECL_TEMPLATE_RESULT (gen_tmpl
)),
5604 args
, /*complain=*/1);
5606 /* Check to see if we already have this specialization. */
5607 spec
= retrieve_specialization (gen_tmpl
, argvec
);
5615 /* We can see more levels of arguments than parameters if
5616 there was a specialization of a member template, like
5619 template <class T> struct S { template <class U> void f(); }
5620 template <> template <class U> void S<int>::f(U);
5622 Here, we'll be subtituting into the specialization,
5623 because that's where we can find the code we actually
5624 want to generate, but we'll have enough arguments for
5625 the most general template.
5627 We also deal with the peculiar case:
5629 template <class T> struct S {
5630 template <class U> friend void f();
5632 template <class U> void f() {}
5634 template void f<double>();
5636 Here, the ARGS for the instantiation of will be {int,
5637 double}. But, we only need as many ARGS as there are
5638 levels of template parameters in CODE_PATTERN. We are
5639 careful not to get fooled into reducing the ARGS in
5642 template <class T> struct S { template <class U> void f(U); }
5643 template <class T> template <> void S<T>::f(int) {}
5645 which we can spot because the pattern will be a
5646 specialization in this case. */
5647 args_depth
= TMPL_ARGS_DEPTH (args
);
5649 TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (DECL_TI_TEMPLATE (t
)));
5650 if (args_depth
> parms_depth
5651 && !DECL_TEMPLATE_SPECIALIZATION (t
))
5652 args
= get_innermost_template_args (args
, parms_depth
);
5656 /* This special case arises when we have something like this:
5658 template <class T> struct S {
5659 friend void f<int>(int, double);
5662 Here, the DECL_TI_TEMPLATE for the friend declaration
5663 will be a LOOKUP_EXPR or an IDENTIFIER_NODE. We are
5664 being called from tsubst_friend_function, and we want
5665 only to create a new decl (R) with appropriate types so
5666 that we can call determine_specialization. */
5667 my_friendly_assert ((TREE_CODE (DECL_TI_TEMPLATE (t
))
5669 || (TREE_CODE (DECL_TI_TEMPLATE (t
))
5670 == IDENTIFIER_NODE
), 0);
5671 gen_tmpl
= NULL_TREE
;
5674 if (DECL_CLASS_SCOPE_P (t
))
5676 if (DECL_NAME (t
) == constructor_name (DECL_CONTEXT (t
)))
5680 ctx
= tsubst_aggr_type (DECL_CONTEXT (t
), args
,
5682 /*entering_scope=*/1);
5687 ctx
= DECL_CONTEXT (t
);
5689 type
= tsubst (type
, args
, /*complain=*/1, in_decl
);
5690 if (type
== error_mark_node
)
5691 return error_mark_node
;
5693 /* We do NOT check for matching decls pushed separately at this
5694 point, as they may not represent instantiations of this
5695 template, and in any case are considered separate under the
5696 discrete model. Instead, see add_maybe_template. */
5698 DECL_USE_TEMPLATE (r
) = 0;
5699 TREE_TYPE (r
) = type
;
5701 DECL_CONTEXT (r
) = ctx
;
5702 DECL_VIRTUAL_CONTEXT (r
)
5703 = tsubst_aggr_type (DECL_VIRTUAL_CONTEXT (t
), args
,
5705 /*entering_scope=*/1);
5707 if (member
&& DECL_CONV_FN_P (r
))
5709 /* Type-conversion operator. Reconstruct the name, in
5710 case it's the name of one of the template's parameters. */
5712 DECL_NAME (r
) = mangle_conv_op_name_for_type (TREE_TYPE (type
));
5714 DECL_NAME (r
) = build_typename_overload (TREE_TYPE (type
));
5717 DECL_ARGUMENTS (r
) = tsubst (DECL_ARGUMENTS (t
), args
,
5719 DECL_TEMPLATE_RESULT (r
) = NULL_TREE
;
5721 TREE_STATIC (r
) = 0;
5722 TREE_PUBLIC (r
) = TREE_PUBLIC (t
);
5723 DECL_EXTERNAL (r
) = 1;
5724 DECL_INTERFACE_KNOWN (r
) = 0;
5725 DECL_DEFER_OUTPUT (r
) = 0;
5726 TREE_CHAIN (r
) = NULL_TREE
;
5727 DECL_PENDING_INLINE_INFO (r
) = 0;
5728 DECL_PENDING_INLINE_P (r
) = 0;
5730 if (DECL_CLONED_FUNCTION (r
))
5732 DECL_CLONED_FUNCTION (r
) = tsubst (DECL_CLONED_FUNCTION (t
),
5733 args
, /*complain=*/1, t
);
5734 TREE_CHAIN (r
) = TREE_CHAIN (DECL_CLONED_FUNCTION (r
));
5735 TREE_CHAIN (DECL_CLONED_FUNCTION (r
)) = r
;
5738 /* Set up the DECL_TEMPLATE_INFO for R and compute its mangled
5739 name. There's no need to do this in the special friend
5740 case mentioned above where GEN_TMPL is NULL. */
5743 DECL_TEMPLATE_INFO (r
)
5744 = tree_cons (gen_tmpl
, argvec
, NULL_TREE
);
5745 SET_DECL_IMPLICIT_INSTANTIATION (r
);
5746 register_specialization (r
, gen_tmpl
, argvec
);
5748 /* Set the mangled name for R. */
5749 if (DECL_DESTRUCTOR_P (t
))
5752 set_mangled_name_for_decl (r
);
5754 DECL_ASSEMBLER_NAME (r
) = build_destructor_name (ctx
);
5758 /* Instantiations of template functions must be mangled
5759 specially, in order to conform to 14.5.5.1
5760 [temp.over.link]. */
5761 tree tmpl
= DECL_TI_TEMPLATE (t
);
5763 /* TMPL will be NULL if this is a specialization of a
5764 member function of a template class. */
5765 if (name_mangling_version
< 1
5766 || tmpl
== NULL_TREE
5767 || (member
&& !is_member_template (tmpl
)
5768 && !DECL_TEMPLATE_INFO (tmpl
)))
5769 set_mangled_name_for_decl (r
);
5771 set_mangled_name_for_template_decl (r
);
5775 make_decl_rtl (r
, NULL_PTR
, 1);
5777 /* Like grokfndecl. If we don't do this, pushdecl will
5778 mess up our TREE_CHAIN because it doesn't find a
5779 previous decl. Sigh. */
5781 && ! uses_template_parms (r
)
5782 && (IDENTIFIER_GLOBAL_VALUE (DECL_ASSEMBLER_NAME (r
))
5784 SET_IDENTIFIER_GLOBAL_VALUE (DECL_ASSEMBLER_NAME (r
), r
);
5786 /* We're not supposed to instantiate default arguments
5787 until they are called, for a template. But, for a
5790 template <class T> void f ()
5791 { extern void g(int i = T()); }
5793 we should do the substitution when the template is
5794 instantiated. We handle the member function case in
5795 instantiate_class_template since the default arguments
5796 might refer to other members of the class. */
5798 && !PRIMARY_TEMPLATE_P (gen_tmpl
)
5799 && !uses_template_parms (argvec
))
5800 tsubst_default_arguments (r
);
5803 /* Copy the list of befriending classes. */
5804 for (friends
= &DECL_BEFRIENDING_CLASSES (r
);
5806 friends
= &TREE_CHAIN (*friends
))
5808 *friends
= copy_node (*friends
);
5809 TREE_VALUE (*friends
) = tsubst (TREE_VALUE (*friends
),
5810 args
, /*complain=*/1,
5814 if (DECL_CONSTRUCTOR_P (r
) || DECL_DESTRUCTOR_P (r
))
5816 maybe_retrofit_in_chrg (r
);
5817 if (DECL_CONSTRUCTOR_P (r
))
5818 grok_ctor_properties (ctx
, r
);
5820 else if (IDENTIFIER_OPNAME_P (DECL_NAME (r
)))
5821 grok_op_properties (r
, DECL_VIRTUAL_P (r
), DECL_FRIEND_P (r
));
5828 TREE_TYPE (r
) = type
;
5829 c_apply_type_quals_to_decl (CP_TYPE_QUALS (type
), r
);
5831 if (TREE_CODE (DECL_INITIAL (r
)) != TEMPLATE_PARM_INDEX
)
5832 DECL_INITIAL (r
) = TREE_TYPE (r
);
5834 DECL_INITIAL (r
) = tsubst (DECL_INITIAL (r
), args
,
5835 /*complain=*/1, in_decl
);
5837 DECL_CONTEXT (r
) = NULL_TREE
;
5838 if (PROMOTE_PROTOTYPES
5839 && (TREE_CODE (type
) == INTEGER_TYPE
5840 || TREE_CODE (type
) == ENUMERAL_TYPE
)
5841 && TYPE_PRECISION (type
) < TYPE_PRECISION (integer_type_node
))
5842 DECL_ARG_TYPE (r
) = integer_type_node
;
5844 TREE_CHAIN (r
) = tsubst (TREE_CHAIN (t
), args
,
5845 /*complain=*/1, TREE_CHAIN (t
));
5852 TREE_TYPE (r
) = type
;
5853 c_apply_type_quals_to_decl (CP_TYPE_QUALS (type
), r
);
5855 /* We don't have to set DECL_CONTEXT here; it is set by
5856 finish_member_declaration. */
5857 DECL_INITIAL (r
) = tsubst_expr (DECL_INITIAL (t
), args
,
5858 /*complain=*/1, in_decl
);
5859 TREE_CHAIN (r
) = NULL_TREE
;
5860 if (TREE_CODE (type
) == VOID_TYPE
)
5861 cp_error_at ("instantiation of `%D' as type void", r
);
5869 = tsubst_copy (DECL_INITIAL (t
), args
, /*complain=*/1, in_decl
);
5870 TREE_CHAIN (r
) = NULL_TREE
;
5875 if (DECL_IMPLICIT_TYPEDEF_P (t
))
5877 /* For an implicit typedef, we just want the implicit
5878 typedef for the tsubst'd type. We've already got the
5879 tsubst'd type, as TYPE, so we just need it's associated
5881 r
= TYPE_NAME (type
);
5884 else if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
5885 || TREE_CODE (type
) == TEMPLATE_TEMPLATE_PARM
)
5887 /* For a template type parameter, we don't have to do
5888 anything special. */
5889 r
= TYPE_NAME (type
);
5897 tree argvec
= NULL_TREE
;
5898 tree gen_tmpl
= NULL_TREE
;
5900 tree tmpl
= NULL_TREE
;
5904 /* Assume this is a non-local variable. */
5907 if (TYPE_P (CP_DECL_CONTEXT (t
)))
5908 ctx
= tsubst_aggr_type (DECL_CONTEXT (t
), args
,
5910 in_decl
, /*entering_scope=*/1);
5913 /* Subsequent calls to pushdecl will fill this in. */
5915 if (!DECL_NAMESPACE_SCOPE_P (t
))
5919 /* Check to see if we already have this specialization. */
5922 tmpl
= DECL_TI_TEMPLATE (t
);
5923 gen_tmpl
= most_general_template (tmpl
);
5924 argvec
= tsubst (DECL_TI_ARGS (t
), args
, /*complain=*/1, in_decl
);
5925 spec
= retrieve_specialization (gen_tmpl
, argvec
);
5928 spec
= retrieve_local_specialization (t
);
5937 TREE_TYPE (r
) = type
;
5938 c_apply_type_quals_to_decl (CP_TYPE_QUALS (type
), r
);
5939 DECL_CONTEXT (r
) = ctx
;
5941 /* Don't try to expand the initializer until someone tries to use
5942 this variable; otherwise we run into circular dependencies. */
5943 DECL_INITIAL (r
) = NULL_TREE
;
5945 DECL_SIZE (r
) = DECL_SIZE_UNIT (r
) = 0;
5947 /* For __PRETTY_FUNCTION__ we have to adjust the initializer. */
5948 if (DECL_PRETTY_FUNCTION_P (r
))
5950 DECL_INITIAL (r
) = tsubst (DECL_INITIAL (t
),
5954 TREE_TYPE (r
) = TREE_TYPE (DECL_INITIAL (r
));
5957 /* Even if the original location is out of scope, the newly
5958 substituted one is not. */
5959 if (TREE_CODE (r
) == VAR_DECL
)
5960 DECL_DEAD_FOR_LOCAL (r
) = 0;
5964 /* A static data member declaration is always marked
5965 external when it is declared in-class, even if an
5966 initializer is present. We mimic the non-template
5968 DECL_EXTERNAL (r
) = 1;
5970 register_specialization (r
, gen_tmpl
, argvec
);
5971 DECL_TEMPLATE_INFO (r
) = tree_cons (tmpl
, argvec
, NULL_TREE
);
5972 SET_DECL_IMPLICIT_INSTANTIATION (r
);
5975 register_local_specialization (r
, t
);
5977 TREE_CHAIN (r
) = NULL_TREE
;
5978 if (TREE_CODE (r
) == VAR_DECL
&& TREE_CODE (type
) == VOID_TYPE
)
5979 cp_error_at ("instantiation of `%D' as type void", r
);
5984 my_friendly_abort (0);
5987 /* Restore the file and line information. */
5988 lineno
= saved_lineno
;
5989 input_filename
= saved_filename
;
5994 /* Substitue into the ARG_TYPES of a function type. */
5997 tsubst_arg_types (arg_types
, args
, complain
, in_decl
)
6003 tree remaining_arg_types
;
6006 if (!arg_types
|| arg_types
== void_list_node
)
6009 remaining_arg_types
= tsubst_arg_types (TREE_CHAIN (arg_types
),
6010 args
, complain
, in_decl
);
6011 if (remaining_arg_types
== error_mark_node
)
6012 return error_mark_node
;
6014 type
= tsubst (TREE_VALUE (arg_types
), args
, complain
, in_decl
);
6015 if (type
== error_mark_node
)
6016 return error_mark_node
;
6018 /* Do array-to-pointer, function-to-pointer conversion, and ignore
6019 top-level qualifiers as required. */
6020 type
= TYPE_MAIN_VARIANT (type_decays_to (type
));
6022 /* Note that we do not substitute into default arguments here. The
6023 standard mandates that they be instantiated only when needed,
6024 which is done in build_over_call. */
6025 return hash_tree_cons (TREE_PURPOSE (arg_types
), type
,
6026 remaining_arg_types
);
6030 /* Substitute into a FUNCTION_TYPE or METHOD_TYPE. This routine does
6031 *not* handle the exception-specification for FNTYPE, because the
6032 initial substitution of explicitly provided template parameters
6033 during argument deduction forbids substitution into the
6034 exception-specification:
6038 All references in the function type of the function template to the
6039 corresponding template parameters are replaced by the specified tem-
6040 plate argument values. If a substitution in a template parameter or
6041 in the function type of the function template results in an invalid
6042 type, type deduction fails. [Note: The equivalent substitution in
6043 exception specifications is done only when the function is instanti-
6044 ated, at which point a program is ill-formed if the substitution
6045 results in an invalid type.] */
6048 tsubst_function_type (t
, args
, complain
, in_decl
)
6058 /* The TYPE_CONTEXT is not used for function/method types. */
6059 my_friendly_assert (TYPE_CONTEXT (t
) == NULL_TREE
, 0);
6061 /* Substitue the return type. */
6062 return_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
6063 if (return_type
== error_mark_node
)
6064 return error_mark_node
;
6066 /* Substitue the argument types. */
6067 arg_types
= tsubst_arg_types (TYPE_ARG_TYPES (t
), args
,
6069 if (arg_types
== error_mark_node
)
6070 return error_mark_node
;
6072 /* Construct a new type node and return it. */
6073 if (TREE_CODE (t
) == FUNCTION_TYPE
)
6074 fntype
= build_function_type (return_type
, arg_types
);
6077 tree r
= TREE_TYPE (TREE_VALUE (arg_types
));
6078 if (! IS_AGGR_TYPE (r
))
6082 Type deduction may fail for any of the following
6085 -- Attempting to create "pointer to member of T" when T
6086 is not a class type. */
6088 cp_error ("creating pointer to member function of non-class type `%T'",
6090 return error_mark_node
;
6093 fntype
= build_cplus_method_type (r
, return_type
, TREE_CHAIN
6096 fntype
= build_qualified_type (fntype
, TYPE_QUALS (t
));
6097 fntype
= build_type_attribute_variant (fntype
, TYPE_ATTRIBUTES (t
));
6102 /* Substitute into the PARMS of a call-declarator. */
6105 tsubst_call_declarator_parms (parms
, args
, complain
, in_decl
)
6115 if (!parms
|| parms
== void_list_node
)
6118 new_parms
= tsubst_call_declarator_parms (TREE_CHAIN (parms
),
6119 args
, complain
, in_decl
);
6121 /* Figure out the type of this parameter. */
6122 type
= tsubst (TREE_VALUE (parms
), args
, complain
, in_decl
);
6124 /* Figure out the default argument as well. Note that we use
6125 tsubst_expr since the default argument is really an expression. */
6126 defarg
= tsubst_expr (TREE_PURPOSE (parms
), args
, complain
, in_decl
);
6128 /* Chain this parameter on to the front of those we have already
6129 processed. We don't use hash_tree_cons because that function
6130 doesn't check TREE_PARMLIST. */
6131 new_parms
= tree_cons (defarg
, type
, new_parms
);
6133 /* And note that these are parameters. */
6134 TREE_PARMLIST (new_parms
) = 1;
6139 /* Take the tree structure T and replace template parameters used
6140 therein with the argument vector ARGS. IN_DECL is an associated
6141 decl for diagnostics. If an error occurs, returns ERROR_MARK_NODE.
6142 An appropriate error message is issued only if COMPLAIN is
6143 non-zero. Note that we must be relatively non-tolerant of
6144 extensions here, in order to preserve conformance; if we allow
6145 substitutions that should not be allowed, we may allow argument
6146 deductions that should not succeed, and therefore report ambiguous
6147 overload situations where there are none. In theory, we could
6148 allow the substitution, but indicate that it should have failed,
6149 and allow our caller to make sure that the right thing happens, but
6150 we don't try to do this yet.
6152 This function is used for dealing with types, decls and the like;
6153 for expressions, use tsubst_expr or tsubst_copy. */
6156 tsubst (t
, args
, complain
, in_decl
)
6163 if (t
== NULL_TREE
|| t
== error_mark_node
6164 || t
== integer_type_node
6165 || t
== void_type_node
6166 || t
== char_type_node
6167 || TREE_CODE (t
) == NAMESPACE_DECL
)
6170 if (TREE_CODE (t
) == IDENTIFIER_NODE
)
6171 type
= IDENTIFIER_TYPE_VALUE (t
);
6173 type
= TREE_TYPE (t
);
6174 if (type
== unknown_type_node
)
6175 my_friendly_abort (42);
6177 if (type
&& TREE_CODE (t
) != FUNCTION_DECL
6178 && TREE_CODE (t
) != TYPENAME_TYPE
6179 && TREE_CODE (t
) != TEMPLATE_DECL
6180 && TREE_CODE (t
) != IDENTIFIER_NODE
6181 && TREE_CODE (t
) != FUNCTION_TYPE
6182 && TREE_CODE (t
) != METHOD_TYPE
)
6183 type
= tsubst (type
, args
, complain
, in_decl
);
6184 if (type
== error_mark_node
)
6185 return error_mark_node
;
6188 return tsubst_decl (t
, args
, type
, in_decl
);
6190 switch (TREE_CODE (t
))
6195 return tsubst_aggr_type (t
, args
, complain
, in_decl
,
6196 /*entering_scope=*/0);
6199 case IDENTIFIER_NODE
:
6211 if (t
== integer_type_node
)
6214 if (TREE_CODE (TYPE_MIN_VALUE (t
)) == INTEGER_CST
6215 && TREE_CODE (TYPE_MAX_VALUE (t
)) == INTEGER_CST
)
6219 tree max
, omax
= TREE_OPERAND (TYPE_MAX_VALUE (t
), 0);
6221 max
= tsubst_expr (omax
, args
, complain
, in_decl
);
6222 if (max
== error_mark_node
)
6223 return error_mark_node
;
6225 /* See if we can reduce this expression to something simpler. */
6226 max
= maybe_fold_nontype_arg (max
);
6227 if (!processing_template_decl
)
6228 max
= decl_constant_value (max
);
6230 if (processing_template_decl
6231 /* When providing explicit arguments to a template
6232 function, but leaving some arguments for subsequent
6233 deduction, MAX may be template-dependent even if we're
6234 not PROCESSING_TEMPLATE_DECL. We still need to check for
6235 template parms, though; MAX won't be an INTEGER_CST for
6236 dynamic arrays, either. */
6237 || (TREE_CODE (max
) != INTEGER_CST
6238 && uses_template_parms (max
)))
6240 tree itype
= make_node (INTEGER_TYPE
);
6241 TYPE_MIN_VALUE (itype
) = size_zero_node
;
6242 TYPE_MAX_VALUE (itype
) = build_min (MINUS_EXPR
, sizetype
, max
,
6247 if (integer_zerop (omax
))
6249 /* Still allow an explicit array of size zero. */
6251 pedwarn ("creating array with size zero");
6253 else if (integer_zerop (max
)
6254 || (TREE_CODE (max
) == INTEGER_CST
6255 && INT_CST_LT (max
, integer_zero_node
)))
6259 Type deduction may fail for any of the following
6262 Attempting to create an array with a size that is
6263 zero or negative. */
6265 cp_error ("creating array with size zero (`%E')", max
);
6267 return error_mark_node
;
6270 return compute_array_index_type (NULL_TREE
, max
);
6273 case TEMPLATE_TYPE_PARM
:
6274 case TEMPLATE_TEMPLATE_PARM
:
6275 case TEMPLATE_PARM_INDEX
:
6283 if (TREE_CODE (t
) == TEMPLATE_TYPE_PARM
6284 || TREE_CODE (t
) == TEMPLATE_TEMPLATE_PARM
)
6286 idx
= TEMPLATE_TYPE_IDX (t
);
6287 level
= TEMPLATE_TYPE_LEVEL (t
);
6291 idx
= TEMPLATE_PARM_IDX (t
);
6292 level
= TEMPLATE_PARM_LEVEL (t
);
6295 if (TREE_VEC_LENGTH (args
) > 0)
6297 tree arg
= NULL_TREE
;
6299 levels
= TMPL_ARGS_DEPTH (args
);
6300 if (level
<= levels
)
6301 arg
= TMPL_ARG (args
, level
, idx
);
6303 if (arg
== error_mark_node
)
6304 return error_mark_node
;
6305 else if (arg
!= NULL_TREE
)
6307 if (TREE_CODE (t
) == TEMPLATE_TYPE_PARM
)
6309 my_friendly_assert (TYPE_P (arg
), 0);
6310 return cp_build_qualified_type_real
6311 (arg
, CP_TYPE_QUALS (arg
) | CP_TYPE_QUALS (t
),
6314 else if (TREE_CODE (t
) == TEMPLATE_TEMPLATE_PARM
)
6316 if (TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (t
))
6318 /* We are processing a type constructed from
6319 a template template parameter */
6320 tree argvec
= tsubst (TYPE_TI_ARGS (t
),
6321 args
, complain
, in_decl
);
6322 if (argvec
== error_mark_node
)
6323 return error_mark_node
;
6325 /* We can get a TEMPLATE_TEMPLATE_PARM here when
6326 we are resolving nested-types in the signature of
6327 a member function templates.
6328 Otherwise ARG is a TEMPLATE_DECL and is the real
6329 template to be instantiated. */
6330 if (TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
)
6331 arg
= TYPE_NAME (arg
);
6333 r
= lookup_template_class (DECL_NAME (arg
),
6336 /*entering_scope=*/0);
6337 return cp_build_qualified_type_real (r
,
6342 /* We are processing a template argument list. */
6350 my_friendly_abort (981018);
6353 /* This can happen during the attempted tsubst'ing in
6354 unify. This means that we don't yet have any information
6355 about the template parameter in question. */
6358 /* If we get here, we must have been looking at a parm for a
6359 more deeply nested template. Make a new version of this
6360 template parameter, but with a lower level. */
6361 switch (TREE_CODE (t
))
6363 case TEMPLATE_TYPE_PARM
:
6364 case TEMPLATE_TEMPLATE_PARM
:
6366 TEMPLATE_TYPE_PARM_INDEX (r
)
6367 = reduce_template_parm_level (TEMPLATE_TYPE_PARM_INDEX (t
),
6369 TYPE_STUB_DECL (r
) = TYPE_NAME (r
) = TEMPLATE_TYPE_DECL (r
);
6370 TYPE_MAIN_VARIANT (r
) = r
;
6371 TYPE_POINTER_TO (r
) = NULL_TREE
;
6372 TYPE_REFERENCE_TO (r
) = NULL_TREE
;
6374 if (TREE_CODE (t
) == TEMPLATE_TEMPLATE_PARM
6375 && TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (t
))
6377 tree argvec
= tsubst (TYPE_TI_ARGS (t
), args
,
6379 if (argvec
== error_mark_node
)
6380 return error_mark_node
;
6382 TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (r
)
6383 = tree_cons (TYPE_NAME (t
), argvec
, NULL_TREE
);
6387 case TEMPLATE_PARM_INDEX
:
6388 r
= reduce_template_parm_level (t
, type
, levels
);
6392 my_friendly_abort (0);
6400 tree purpose
, value
, chain
, result
;
6402 if (t
== void_list_node
)
6405 purpose
= TREE_PURPOSE (t
);
6408 purpose
= tsubst (purpose
, args
, complain
, in_decl
);
6409 if (purpose
== error_mark_node
)
6410 return error_mark_node
;
6412 value
= TREE_VALUE (t
);
6415 value
= tsubst (value
, args
, complain
, in_decl
);
6416 if (value
== error_mark_node
)
6417 return error_mark_node
;
6419 chain
= TREE_CHAIN (t
);
6420 if (chain
&& chain
!= void_type_node
)
6422 chain
= tsubst (chain
, args
, complain
, in_decl
);
6423 if (chain
== error_mark_node
)
6424 return error_mark_node
;
6426 if (purpose
== TREE_PURPOSE (t
)
6427 && value
== TREE_VALUE (t
)
6428 && chain
== TREE_CHAIN (t
))
6430 result
= hash_tree_cons (purpose
, value
, chain
);
6431 TREE_PARMLIST (result
) = TREE_PARMLIST (t
);
6435 if (type
!= NULL_TREE
)
6437 /* A binfo node. We always need to make a copy, of the node
6438 itself and of its BINFO_BASETYPES. */
6442 /* Make sure type isn't a typedef copy. */
6443 type
= BINFO_TYPE (TYPE_BINFO (type
));
6445 TREE_TYPE (t
) = complete_type (type
);
6446 if (IS_AGGR_TYPE (type
))
6448 BINFO_VTABLE (t
) = TYPE_BINFO_VTABLE (type
);
6449 BINFO_VIRTUALS (t
) = TYPE_BINFO_VIRTUALS (type
);
6450 if (TYPE_BINFO_BASETYPES (type
) != NULL_TREE
)
6451 BINFO_BASETYPES (t
) = copy_node (TYPE_BINFO_BASETYPES (type
));
6456 /* Otherwise, a vector of template arguments. */
6457 return tsubst_template_arg_vector (t
, args
, complain
);
6460 case REFERENCE_TYPE
:
6462 enum tree_code code
;
6464 if (type
== TREE_TYPE (t
))
6467 code
= TREE_CODE (t
);
6472 Type deduction may fail for any of the following
6475 -- Attempting to create a pointer to reference type.
6476 -- Attempting to create a reference to a reference type or
6477 a reference to void. */
6478 if (TREE_CODE (type
) == REFERENCE_TYPE
6479 || (code
== REFERENCE_TYPE
&& TREE_CODE (type
) == VOID_TYPE
))
6481 static int last_line
= 0;
6482 static const char* last_file
= 0;
6484 /* We keep track of the last time we issued this error
6485 message to avoid spewing a ton of messages during a
6486 single bad template instantiation. */
6487 if (complain
&& (last_line
!= lineno
||
6488 last_file
!= input_filename
))
6490 if (TREE_CODE (type
) == VOID_TYPE
)
6491 cp_error ("forming reference to void");
6493 cp_error ("forming %s to reference type `%T'",
6494 (code
== POINTER_TYPE
) ? "pointer" : "reference",
6497 last_file
= input_filename
;
6500 return error_mark_node
;
6502 else if (code
== POINTER_TYPE
)
6503 r
= build_pointer_type (type
);
6505 r
= build_reference_type (type
);
6506 r
= cp_build_qualified_type_real (r
, TYPE_QUALS (t
), complain
);
6508 /* Will this ever be needed for TYPE_..._TO values? */
6514 r
= tsubst (TYPE_OFFSET_BASETYPE (t
), args
, complain
, in_decl
);
6515 if (r
== error_mark_node
|| !IS_AGGR_TYPE (r
))
6519 Type deduction may fail for any of the following
6522 -- Attempting to create "pointer to member of T" when T
6523 is not a class type. */
6525 cp_error ("creating pointer to member of non-class type `%T'",
6527 return error_mark_node
;
6529 return build_offset_type (r
, type
);
6537 fntype
= tsubst_function_type (t
, args
, complain
, in_decl
);
6538 if (fntype
== error_mark_node
)
6539 return error_mark_node
;
6541 /* Substitue the exception specification. */
6542 raises
= TYPE_RAISES_EXCEPTIONS (t
);
6545 tree list
= NULL_TREE
;
6547 if (! TREE_VALUE (raises
))
6550 for (; raises
!= NULL_TREE
; raises
= TREE_CHAIN (raises
))
6552 tree spec
= TREE_VALUE (raises
);
6554 spec
= tsubst (spec
, args
, complain
, in_decl
);
6555 if (spec
== error_mark_node
)
6557 list
= add_exception_specifier (list
, spec
, complain
);
6559 fntype
= build_exception_variant (fntype
, list
);
6565 tree domain
= tsubst (TYPE_DOMAIN (t
), args
, complain
, in_decl
);
6566 if (domain
== error_mark_node
)
6567 return error_mark_node
;
6569 /* As an optimization, we avoid regenerating the array type if
6570 it will obviously be the same as T. */
6571 if (type
== TREE_TYPE (t
) && domain
== TYPE_DOMAIN (t
))
6574 /* These checks should match the ones in grokdeclarator.
6578 The deduction may fail for any of the following reasons:
6580 -- Attempting to create an array with an element type that
6581 is void, a function type, or a reference type. */
6582 if (TREE_CODE (type
) == VOID_TYPE
6583 || TREE_CODE (type
) == FUNCTION_TYPE
6584 || TREE_CODE (type
) == REFERENCE_TYPE
)
6587 cp_error ("creating array of `%T'", type
);
6588 return error_mark_node
;
6591 r
= build_cplus_array_type (type
, domain
);
6598 tree e1
= tsubst (TREE_OPERAND (t
, 0), args
, complain
,
6600 tree e2
= tsubst (TREE_OPERAND (t
, 1), args
, complain
,
6603 if (e1
== error_mark_node
|| e2
== error_mark_node
)
6604 return error_mark_node
;
6606 return fold (build (TREE_CODE (t
), TREE_TYPE (t
), e1
, e2
));
6612 tree e
= tsubst (TREE_OPERAND (t
, 0), args
, complain
,
6614 if (e
== error_mark_node
)
6615 return error_mark_node
;
6617 return fold (build (TREE_CODE (t
), TREE_TYPE (t
), e
));
6622 tree ctx
= tsubst_aggr_type (TYPE_CONTEXT (t
), args
, complain
,
6623 in_decl
, /*entering_scope=*/1);
6624 tree f
= tsubst_copy (TYPENAME_TYPE_FULLNAME (t
), args
,
6627 if (ctx
== error_mark_node
|| f
== error_mark_node
)
6628 return error_mark_node
;
6630 if (!IS_AGGR_TYPE (ctx
))
6633 cp_error ("`%T' is not a class, struct, or union type",
6635 return error_mark_node
;
6637 else if (!uses_template_parms (ctx
) && !TYPE_BEING_DEFINED (ctx
))
6639 /* Normally, make_typename_type does not require that the CTX
6640 have complete type in order to allow things like:
6642 template <class T> struct S { typename S<T>::X Y; };
6644 But, such constructs have already been resolved by this
6645 point, so here CTX really should have complete type, unless
6646 it's a partial instantiation. */
6647 ctx
= complete_type (ctx
);
6648 if (!COMPLETE_TYPE_P (ctx
))
6651 incomplete_type_error (NULL_TREE
, ctx
);
6652 return error_mark_node
;
6656 f
= make_typename_type (ctx
, f
, complain
);
6657 if (f
== error_mark_node
)
6659 return cp_build_qualified_type_real (f
,
6661 | CP_TYPE_QUALS (t
),
6667 tree e
= tsubst (TREE_OPERAND (t
, 0), args
, complain
,
6669 if (e
== error_mark_node
)
6670 return error_mark_node
;
6671 return make_pointer_declarator (type
, e
);
6676 tree e
= tsubst (TREE_OPERAND (t
, 0), args
, complain
,
6678 if (e
== error_mark_node
)
6679 return error_mark_node
;
6680 return make_reference_declarator (type
, e
);
6685 tree e1
= tsubst (TREE_OPERAND (t
, 0), args
, complain
,
6687 tree e2
= tsubst_expr (TREE_OPERAND (t
, 1), args
, complain
,
6689 if (e1
== error_mark_node
|| e2
== error_mark_node
)
6690 return error_mark_node
;
6692 return build_parse_node (ARRAY_REF
, e1
, e2
, tsubst_expr
);
6697 tree e1
= tsubst (TREE_OPERAND (t
, 0), args
, complain
,
6699 tree e2
= (tsubst_call_declarator_parms
6700 (CALL_DECLARATOR_PARMS (t
), args
, complain
, in_decl
));
6701 tree e3
= tsubst (CALL_DECLARATOR_EXCEPTION_SPEC (t
), args
,
6704 if (e1
== error_mark_node
|| e2
== error_mark_node
6705 || e3
== error_mark_node
)
6706 return error_mark_node
;
6708 return make_call_declarator (e1
, e2
, CALL_DECLARATOR_QUALS (t
), e3
);
6713 tree e1
= tsubst (TREE_OPERAND (t
, 0), args
, complain
,
6715 tree e2
= tsubst (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
6716 if (e1
== error_mark_node
|| e2
== error_mark_node
)
6717 return error_mark_node
;
6719 return build_parse_node (TREE_CODE (t
), e1
, e2
);
6724 tree e1
= tsubst_expr (TYPE_FIELDS (t
), args
, complain
,
6726 if (e1
== error_mark_node
)
6727 return error_mark_node
;
6729 return TREE_TYPE (e1
);
6739 /* This code should match declare_hidden_char_array in
6741 name
= (*decl_printable_name
) (current_function_decl
, 2);
6742 len
= strlen (name
) + 1;
6743 type
= build_array_type (char_type_node
,
6744 build_index_type (build_int_2 (len
, 0)));
6745 str
= build_string (len
, name
);
6746 TREE_TYPE (str
) = type
;
6751 sorry ("use of `%s' in template",
6752 tree_code_name
[(int) TREE_CODE (t
)]);
6753 return error_mark_node
;
6757 /* Like tsubst, but deals with expressions. This function just replaces
6758 template parms; to finish processing the resultant expression, use
6762 tsubst_copy (t
, args
, complain
, in_decl
)
6767 enum tree_code code
;
6770 if (t
== NULL_TREE
|| t
== error_mark_node
)
6773 code
= TREE_CODE (t
);
6778 return do_identifier (DECL_NAME (t
), 0, NULL_TREE
);
6785 if (!DECL_CONTEXT (t
))
6786 /* This is a global enumeration constant. */
6789 /* Unfortunately, we cannot just call lookup_name here.
6792 template <int I> int f() {
6794 struct S { void g() { E e = a; } };
6797 When we instantiate f<7>::S::g(), say, lookup_name is not
6798 clever enough to find f<7>::a. */
6800 = tsubst_aggr_type (TREE_TYPE (t
), args
, complain
, in_decl
,
6801 /*entering_scope=*/0);
6803 for (v
= TYPE_VALUES (enum_type
);
6806 if (TREE_PURPOSE (v
) == DECL_NAME (t
))
6807 return TREE_VALUE (v
);
6809 /* We didn't find the name. That should never happen; if
6810 name-lookup found it during preliminary parsing, we
6811 should find it again here during instantiation. */
6812 my_friendly_abort (0);
6817 if (DECL_CONTEXT (t
))
6821 ctx
= tsubst_aggr_type (DECL_CONTEXT (t
), args
, complain
, in_decl
,
6822 /*entering_scope=*/1);
6823 if (ctx
!= DECL_CONTEXT (t
))
6824 return lookup_field (ctx
, DECL_NAME (t
), 0, 0);
6830 if (DECL_LANG_SPECIFIC (t
) && DECL_TEMPLATE_INFO (t
))
6831 t
= tsubst (t
, args
, complain
, in_decl
);
6836 if (is_member_template (t
))
6837 return tsubst (t
, args
, complain
, in_decl
);
6843 /* We must tsbust into a LOOKUP_EXPR in case the names to
6844 which it refers is a conversion operator; in that case the
6845 name will change. We avoid making unnecessary copies,
6848 tree id
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
6850 if (id
!= TREE_OPERAND (t
, 0))
6852 r
= build_nt (LOOKUP_EXPR
, id
);
6853 LOOKUP_EXPR_GLOBAL (r
) = LOOKUP_EXPR_GLOBAL (t
);
6861 case REINTERPRET_CAST_EXPR
:
6862 case CONST_CAST_EXPR
:
6863 case STATIC_CAST_EXPR
:
6864 case DYNAMIC_CAST_EXPR
:
6867 (code
, tsubst (TREE_TYPE (t
), args
, complain
, in_decl
),
6868 tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
));
6871 case PREDECREMENT_EXPR
:
6872 case PREINCREMENT_EXPR
:
6873 case POSTDECREMENT_EXPR
:
6874 case POSTINCREMENT_EXPR
:
6876 case TRUTH_NOT_EXPR
:
6879 case CONVERT_EXPR
: /* Unary + */
6888 (code
, tsubst (TREE_TYPE (t
), args
, complain
, in_decl
),
6889 tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
));
6894 case TRUNC_DIV_EXPR
:
6896 case FLOOR_DIV_EXPR
:
6897 case ROUND_DIV_EXPR
:
6898 case EXACT_DIV_EXPR
:
6900 case BIT_ANDTC_EXPR
:
6903 case TRUNC_MOD_EXPR
:
6904 case FLOOR_MOD_EXPR
:
6905 case TRUTH_ANDIF_EXPR
:
6906 case TRUTH_ORIF_EXPR
:
6907 case TRUTH_AND_EXPR
:
6928 (code
, tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
),
6929 tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
));
6933 tree fn
= TREE_OPERAND (t
, 0);
6934 if (is_overloaded_fn (fn
))
6935 fn
= tsubst_copy (get_first_fn (fn
), args
, complain
, in_decl
);
6937 /* Sometimes FN is a LOOKUP_EXPR. */
6938 fn
= tsubst_copy (fn
, args
, complain
, in_decl
);
6940 (code
, fn
, tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
,
6945 case METHOD_CALL_EXPR
:
6947 tree name
= TREE_OPERAND (t
, 0);
6948 if (TREE_CODE (name
) == BIT_NOT_EXPR
)
6950 name
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
6952 name
= build1 (BIT_NOT_EXPR
, NULL_TREE
, name
);
6954 else if (TREE_CODE (name
) == SCOPE_REF
6955 && TREE_CODE (TREE_OPERAND (name
, 1)) == BIT_NOT_EXPR
)
6957 tree base
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
6959 name
= TREE_OPERAND (name
, 1);
6960 name
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
6962 name
= build1 (BIT_NOT_EXPR
, NULL_TREE
, name
);
6963 name
= build_nt (SCOPE_REF
, base
, name
);
6966 name
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
6968 (code
, name
, tsubst_copy (TREE_OPERAND (t
, 1), args
,
6970 tsubst_copy (TREE_OPERAND (t
, 2), args
, complain
, in_decl
),
6975 /* This processing should really occur in tsubst_expr, However,
6976 tsubst_expr does not recurse into expressions, since it
6977 assumes that there aren't any statements inside them.
6978 Instead, it simply calls build_expr_from_tree. So, we need
6979 to expand the STMT_EXPR here. */
6980 if (!processing_template_decl
)
6982 tree stmt_expr
= begin_stmt_expr ();
6983 tsubst_expr (STMT_EXPR_STMT (t
), args
,
6985 return finish_stmt_expr (stmt_expr
);
6992 case PSEUDO_DTOR_EXPR
:
6995 (code
, tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
),
6996 tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
),
6997 tsubst_copy (TREE_OPERAND (t
, 2), args
, complain
, in_decl
));
7004 (code
, tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
),
7005 tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
),
7006 tsubst_copy (TREE_OPERAND (t
, 2), args
, complain
, in_decl
));
7007 NEW_EXPR_USE_GLOBAL (r
) = NEW_EXPR_USE_GLOBAL (t
);
7014 (code
, tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
),
7015 tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
));
7016 DELETE_EXPR_USE_GLOBAL (r
) = DELETE_EXPR_USE_GLOBAL (t
);
7017 DELETE_EXPR_USE_VEC (r
) = DELETE_EXPR_USE_VEC (t
);
7021 case TEMPLATE_ID_EXPR
:
7023 /* Substituted template arguments */
7024 tree targs
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
,
7027 if (targs
&& TREE_CODE (targs
) == TREE_LIST
)
7030 for (chain
= targs
; chain
; chain
= TREE_CHAIN (chain
))
7031 TREE_VALUE (chain
) = maybe_fold_nontype_arg (TREE_VALUE (chain
));
7036 for (i
= 0; i
< TREE_VEC_LENGTH (targs
); ++i
)
7037 TREE_VEC_ELT (targs
, i
)
7038 = maybe_fold_nontype_arg (TREE_VEC_ELT (targs
, i
));
7041 return lookup_template_function
7042 (tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
), targs
);
7047 tree purpose
, value
, chain
;
7049 if (t
== void_list_node
)
7052 purpose
= TREE_PURPOSE (t
);
7054 purpose
= tsubst_copy (purpose
, args
, complain
, in_decl
);
7055 value
= TREE_VALUE (t
);
7057 value
= tsubst_copy (value
, args
, complain
, in_decl
);
7058 chain
= TREE_CHAIN (t
);
7059 if (chain
&& chain
!= void_type_node
)
7060 chain
= tsubst_copy (chain
, args
, complain
, in_decl
);
7061 if (purpose
== TREE_PURPOSE (t
)
7062 && value
== TREE_VALUE (t
)
7063 && chain
== TREE_CHAIN (t
))
7065 return tree_cons (purpose
, value
, chain
);
7072 case TEMPLATE_TYPE_PARM
:
7073 case TEMPLATE_TEMPLATE_PARM
:
7074 case TEMPLATE_PARM_INDEX
:
7076 case REFERENCE_TYPE
:
7083 return tsubst (t
, args
, complain
, in_decl
);
7085 case IDENTIFIER_NODE
:
7086 if (IDENTIFIER_TYPENAME_P (t
))
7088 tree new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
7090 return mangle_conv_op_name_for_type (new_type
);
7092 return (build_typename_overload (new_type
));
7100 (CONSTRUCTOR
, tsubst (TREE_TYPE (t
), args
, complain
, in_decl
),
7101 NULL_TREE
, tsubst_copy (CONSTRUCTOR_ELTS (t
), args
,
7102 complain
, in_decl
));
7103 TREE_HAS_CONSTRUCTOR (r
) = TREE_HAS_CONSTRUCTOR (t
);
7108 return build_va_arg (tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
,
7110 tsubst (TREE_TYPE (t
), args
, complain
, in_decl
));
7113 return tsubst (t
, args
, complain
, in_decl
);
7120 /* Like tsubst_copy, but also does semantic processing. */
7123 tsubst_expr (t
, args
, complain
, in_decl
)
7130 if (t
== NULL_TREE
|| t
== error_mark_node
)
7133 if (processing_template_decl
)
7134 return tsubst_copy (t
, args
, complain
, in_decl
);
7136 switch (TREE_CODE (t
))
7140 finish_named_return_value
7141 (TREE_OPERAND (t
, 0),
7142 tsubst_expr (TREE_OPERAND (t
, 1), args
, /*complain=*/1, in_decl
));
7143 tsubst_expr (TREE_CHAIN (t
), args
, complain
, in_decl
);
7146 case CTOR_INITIALIZER
:
7148 current_member_init_list
7149 = tsubst_expr_values (TREE_OPERAND (t
, 0), args
);
7150 current_base_init_list
7151 = tsubst_expr_values (TREE_OPERAND (t
, 1), args
);
7153 tsubst_expr (TREE_CHAIN (t
), args
, complain
, in_decl
);
7158 finish_return_stmt (tsubst_expr (RETURN_EXPR (t
),
7159 args
, complain
, in_decl
));
7164 finish_expr_stmt (tsubst_expr (EXPR_STMT_EXPR (t
),
7165 args
, complain
, in_decl
));
7174 decl
= DECL_STMT_DECL (t
);
7175 if (TREE_CODE (decl
) == LABEL_DECL
)
7176 finish_label_decl (DECL_NAME (decl
));
7179 init
= DECL_INITIAL (decl
);
7180 decl
= tsubst (decl
, args
, complain
, in_decl
);
7181 init
= tsubst_expr (init
, args
, complain
, in_decl
);
7183 DECL_INITIAL (decl
) = error_mark_node
;
7184 /* By marking the declaration as instantiated, we avoid
7185 trying to instantiate it. Since instantiate_decl can't
7186 handle local variables, and since we've already done
7187 all that needs to be done, that's the right thing to
7189 if (TREE_CODE (decl
) == VAR_DECL
)
7190 DECL_TEMPLATE_INSTANTIATED (decl
) = 1;
7191 maybe_push_decl (decl
);
7192 cp_finish_decl (decl
, init
, NULL_TREE
, 0);
7202 stmt
= begin_for_stmt ();
7203 for (tmp
= FOR_INIT_STMT (t
); tmp
; tmp
= TREE_CHAIN (tmp
))
7204 tsubst_expr (tmp
, args
, complain
, in_decl
);
7205 finish_for_init_stmt (stmt
);
7206 finish_for_cond (tsubst_expr (FOR_COND (t
), args
,
7209 tmp
= tsubst_expr (FOR_EXPR (t
), args
, complain
, in_decl
);
7210 finish_for_expr (tmp
, stmt
);
7211 tsubst_expr (FOR_BODY (t
), args
, complain
, in_decl
);
7212 finish_for_stmt (tmp
, stmt
);
7219 stmt
= begin_while_stmt ();
7220 finish_while_stmt_cond (tsubst_expr (WHILE_COND (t
),
7221 args
, complain
, in_decl
),
7223 tsubst_expr (WHILE_BODY (t
), args
, complain
, in_decl
);
7224 finish_while_stmt (stmt
);
7231 stmt
= begin_do_stmt ();
7232 tsubst_expr (DO_BODY (t
), args
, complain
, in_decl
);
7233 finish_do_body (stmt
);
7234 finish_do_stmt (tsubst_expr (DO_COND (t
), args
,
7245 stmt
= begin_if_stmt ();
7246 finish_if_stmt_cond (tsubst_expr (IF_COND (t
),
7247 args
, complain
, in_decl
),
7250 if (tmp
= THEN_CLAUSE (t
), tmp
)
7252 tsubst_expr (tmp
, args
, complain
, in_decl
);
7253 finish_then_clause (stmt
);
7256 if (tmp
= ELSE_CLAUSE (t
), tmp
)
7258 begin_else_clause ();
7259 tsubst_expr (tmp
, args
, complain
, in_decl
);
7260 finish_else_clause (stmt
);
7272 stmt
= begin_compound_stmt (COMPOUND_STMT_NO_SCOPE (t
));
7273 for (substmt
= COMPOUND_BODY (t
);
7274 substmt
!= NULL_TREE
;
7275 substmt
= TREE_CHAIN (substmt
))
7276 tsubst_expr (substmt
, args
, complain
, in_decl
);
7277 return finish_compound_stmt (COMPOUND_STMT_NO_SCOPE (t
), stmt
);
7283 finish_break_stmt ();
7288 finish_continue_stmt ();
7296 stmt
= begin_switch_stmt ();
7297 val
= tsubst_expr (SWITCH_COND (t
), args
, complain
, in_decl
);
7298 finish_switch_cond (val
, stmt
);
7299 tsubst_expr (SWITCH_BODY (t
), args
, complain
, in_decl
);
7300 finish_switch_stmt (val
, stmt
);
7306 finish_case_label (tsubst_expr (CASE_LOW (t
), args
, complain
, in_decl
),
7307 tsubst_expr (CASE_HIGH (t
), args
, complain
, in_decl
));
7311 lineno
= STMT_LINENO (t
);
7312 finish_label_stmt (DECL_NAME (LABEL_STMT_LABEL (t
)));
7317 t
= GOTO_DESTINATION (t
);
7318 if (TREE_CODE (t
) != LABEL_DECL
)
7319 /* Computed goto's must be tsubst'd into. On the other hand,
7320 non-computed gotos must not be; the identifier in question
7321 will have no binding. */
7322 t
= tsubst_expr (t
, args
, complain
, in_decl
);
7325 finish_goto_stmt (t
);
7330 finish_asm_stmt (ASM_CV_QUAL (t
),
7331 tsubst_expr (ASM_STRING (t
), args
, complain
, in_decl
),
7332 tsubst_expr (ASM_OUTPUTS (t
), args
, complain
, in_decl
),
7333 tsubst_expr (ASM_INPUTS (t
), args
, complain
, in_decl
),
7334 tsubst_expr (ASM_CLOBBERS (t
), args
, complain
,
7342 stmt
= begin_try_block ();
7343 tsubst_expr (TRY_STMTS (t
), args
, complain
, in_decl
);
7344 finish_cleanup_try_block (stmt
);
7345 finish_cleanup (tsubst_expr (TRY_HANDLERS (t
), args
,
7353 if (FN_TRY_BLOCK_P (t
))
7354 stmt
= begin_function_try_block ();
7356 stmt
= begin_try_block ();
7358 tsubst_expr (TRY_STMTS (t
), args
, complain
, in_decl
);
7360 if (FN_TRY_BLOCK_P (t
))
7361 finish_function_try_block (stmt
);
7363 finish_try_block (stmt
);
7365 handler
= TRY_HANDLERS (t
);
7366 for (; handler
; handler
= TREE_CHAIN (handler
))
7367 tsubst_expr (handler
, args
, complain
, in_decl
);
7368 if (FN_TRY_BLOCK_P (t
))
7369 finish_function_handler_sequence (stmt
);
7371 finish_handler_sequence (stmt
);
7381 stmt
= begin_handler ();
7382 if (HANDLER_PARMS (t
))
7384 decl
= DECL_STMT_DECL (HANDLER_PARMS (t
));
7385 decl
= tsubst (decl
, args
, complain
, in_decl
);
7386 /* Prevent instantiate_decl from trying to instantiate
7387 this variable. We've already done all that needs to be
7389 DECL_TEMPLATE_INSTANTIATED (decl
) = 1;
7393 blocks
= finish_handler_parms (decl
, stmt
);
7394 tsubst_expr (HANDLER_BODY (t
), args
, complain
, in_decl
);
7395 finish_handler (blocks
, stmt
);
7402 tsubst (t
, args
, complain
, NULL_TREE
);
7406 return build_expr_from_tree (tsubst_copy (t
, args
, complain
, in_decl
));
7411 /* TMPL is a TEMPLATE_DECL for a cloned constructor or destructor.
7412 Instantiate it with the ARGS. */
7415 instantiate_clone (tmpl
, args
)
7422 /* Instantiated the cloned function, rather than the clone. */
7423 spec
= instantiate_template (DECL_CLONED_FUNCTION (tmpl
), args
);
7425 /* Then, see if we've already cloned the instantiation. */
7426 for (clone
= TREE_CHAIN (spec
);
7427 clone
&& DECL_CLONED_FUNCTION_P (clone
);
7428 clone
= TREE_CHAIN (clone
))
7429 if (DECL_NAME (clone
) == DECL_NAME (tmpl
))
7432 /* If we haven't, do so know. */
7434 clone_function_decl (spec
, /*update_method_vec_p=*/0);
7437 for (clone
= TREE_CHAIN (spec
);
7438 clone
&& DECL_CLONED_FUNCTION_P (clone
);
7439 clone
= TREE_CHAIN (clone
))
7440 if (DECL_NAME (clone
) == DECL_NAME (tmpl
))
7443 /* We should always have found the clone by now. */
7444 my_friendly_abort (20000411);
7448 /* Instantiate the indicated variable or function template TMPL with
7449 the template arguments in TARG_PTR. */
7452 instantiate_template (tmpl
, targ_ptr
)
7453 tree tmpl
, targ_ptr
;
7461 if (tmpl
== error_mark_node
)
7462 return error_mark_node
;
7464 my_friendly_assert (TREE_CODE (tmpl
) == TEMPLATE_DECL
, 283);
7466 /* If this function is a clone, handle it specially. */
7467 if (DECL_CLONED_FUNCTION_P (tmpl
))
7468 return instantiate_clone (tmpl
, targ_ptr
);
7470 /* Check to see if we already have this specialization. */
7471 spec
= retrieve_specialization (tmpl
, targ_ptr
);
7472 if (spec
!= NULL_TREE
)
7475 gen_tmpl
= most_general_template (tmpl
);
7476 if (tmpl
!= gen_tmpl
)
7478 /* The TMPL is a partial instantiation. To get a full set of
7479 arguments we must add the arguments used to perform the
7480 partial instantiation. */
7481 targ_ptr
= add_outermost_template_args (DECL_TI_ARGS (tmpl
),
7484 /* Check to see if we already have this specialization. */
7485 spec
= retrieve_specialization (gen_tmpl
, targ_ptr
);
7486 if (spec
!= NULL_TREE
)
7490 len
= DECL_NTPARMS (gen_tmpl
);
7491 inner_args
= INNERMOST_TEMPLATE_ARGS (targ_ptr
);
7495 tree t
= TREE_VEC_ELT (inner_args
, i
);
7498 tree nt
= target_type (t
);
7499 if (IS_AGGR_TYPE (nt
) && decl_function_context (TYPE_MAIN_DECL (nt
)))
7501 cp_error ("type `%T' composed from a local class is not a valid template-argument", t
);
7502 cp_error (" trying to instantiate `%D'", gen_tmpl
);
7503 return error_mark_node
;
7508 /* substitute template parameters */
7509 fndecl
= tsubst (DECL_TEMPLATE_RESULT (gen_tmpl
),
7510 targ_ptr
, /*complain=*/1, gen_tmpl
);
7511 /* The DECL_TI_TEMPLATE should always be the immediate parent
7512 template, not the most general template. */
7513 DECL_TI_TEMPLATE (fndecl
) = tmpl
;
7515 if (flag_external_templates
)
7516 add_pending_template (fndecl
);
7521 /* Push the name of the class template into the scope of the instantiation. */
7524 overload_template_name (type
)
7527 tree id
= DECL_NAME (CLASSTYPE_TI_TEMPLATE (type
));
7530 if (IDENTIFIER_CLASS_VALUE (id
)
7531 && TREE_TYPE (IDENTIFIER_CLASS_VALUE (id
)) == type
)
7534 decl
= build_decl (TYPE_DECL
, id
, type
);
7535 SET_DECL_ARTIFICIAL (decl
);
7536 pushdecl_class_level (decl
);
7539 /* The FN is a TEMPLATE_DECL for a function. The ARGS are the
7540 arguments that are being used when calling it. TARGS is a vector
7541 into which the deduced template arguments are placed.
7543 Return zero for success, 2 for an incomplete match that doesn't resolve
7544 all the types, and 1 for complete failure. An error message will be
7545 printed only for an incomplete match.
7547 If FN is a conversion operator, RETURN_TYPE is the type desired as
7548 the result of the conversion operator.
7550 TPARMS is a vector of template parameters.
7552 The EXPLICIT_TARGS are explicit template arguments provided via a
7555 The parameter STRICT is one of:
7558 We are deducing arguments for a function call, as in
7562 We are deducing arguments for a conversion function, as in
7566 We are deducing arguments when calculating the partial
7567 ordering between specializations of function or class
7568 templates, as in [temp.func.order] and [temp.class.order],
7569 when doing an explicit instantiation as in [temp.explicit],
7570 when determining an explicit specialization as in
7571 [temp.expl.spec], or when taking the address of a function
7572 template, as in [temp.deduct.funcaddr].
7574 The other arguments are as for type_unification. */
7577 fn_type_unification (fn
, explicit_targs
, targs
, args
, return_type
,
7579 tree fn
, explicit_targs
, targs
, args
, return_type
;
7580 unification_kind_t strict
;
7586 my_friendly_assert (TREE_CODE (fn
) == TEMPLATE_DECL
, 0);
7588 fntype
= TREE_TYPE (fn
);
7593 The specified template arguments must match the template
7594 parameters in kind (i.e., type, nontype, template), and there
7595 must not be more arguments than there are parameters;
7596 otherwise type deduction fails.
7598 Nontype arguments must match the types of the corresponding
7599 nontype template parameters, or must be convertible to the
7600 types of the corresponding nontype parameters as specified in
7601 _temp.arg.nontype_, otherwise type deduction fails.
7603 All references in the function type of the function template
7604 to the corresponding template parameters are replaced by the
7605 specified template argument values. If a substitution in a
7606 template parameter or in the function type of the function
7607 template results in an invalid type, type deduction fails. */
7609 tree converted_args
;
7612 = (coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (fn
),
7613 explicit_targs
, NULL_TREE
, /*complain=*/0,
7614 /*require_all_arguments=*/0));
7615 if (converted_args
== error_mark_node
)
7618 fntype
= tsubst (fntype
, converted_args
, /*complain=*/0, NULL_TREE
);
7619 if (fntype
== error_mark_node
)
7622 /* Place the explicitly specified arguments in TARGS. */
7623 for (i
= 0; i
< TREE_VEC_LENGTH (targs
); i
++)
7624 TREE_VEC_ELT (targs
, i
) = TREE_VEC_ELT (converted_args
, i
);
7627 parms
= TYPE_ARG_TYPES (fntype
);
7629 if (DECL_CONV_FN_P (fn
))
7631 /* This is a template conversion operator. Remove `this', since
7632 we could be comparing conversions from different classes. */
7633 parms
= TREE_CHAIN (parms
);
7634 args
= TREE_CHAIN (args
);
7635 my_friendly_assert (return_type
!= NULL_TREE
, 20000227);
7640 /* We've been given a return type to match, prepend it. */
7641 parms
= tree_cons (NULL_TREE
, TREE_TYPE (fntype
), parms
);
7642 args
= tree_cons (NULL_TREE
, return_type
, args
);
7645 /* We allow incomplete unification without an error message here
7646 because the standard doesn't seem to explicitly prohibit it. Our
7647 callers must be ready to deal with unification failures in any
7649 result
= type_unification_real (DECL_INNERMOST_TEMPLATE_PARMS (fn
),
7650 targs
, parms
, args
, /*subr=*/0,
7651 strict
, /*allow_incomplete*/1);
7654 /* All is well so far. Now, check:
7658 When all template arguments have been deduced, all uses of
7659 template parameters in nondeduced contexts are replaced with
7660 the corresponding deduced argument values. If the
7661 substitution results in an invalid type, as described above,
7662 type deduction fails. */
7663 if (tsubst (TREE_TYPE (fn
), targs
, /*complain=*/0, NULL_TREE
)
7670 /* Adjust types before performing type deduction, as described in
7671 [temp.deduct.call] and [temp.deduct.conv]. The rules in these two
7672 sections are symmetric. PARM is the type of a function parameter
7673 or the return type of the conversion function. ARG is the type of
7674 the argument passed to the call, or the type of the value
7675 intialized with the result of the conversion function. */
7678 maybe_adjust_types_for_deduction (strict
, parm
, arg
)
7679 unification_kind_t strict
;
7690 /* Swap PARM and ARG throughout the remainder of this
7691 function; the handling is precisely symmetric since PARM
7692 will initialize ARG rather than vice versa. */
7700 /* There is nothing to do in this case. */
7704 my_friendly_abort (0);
7707 if (TREE_CODE (*parm
) != REFERENCE_TYPE
)
7709 /* [temp.deduct.call]
7711 If P is not a reference type:
7713 --If A is an array type, the pointer type produced by the
7714 array-to-pointer standard conversion (_conv.array_) is
7715 used in place of A for type deduction; otherwise,
7717 --If A is a function type, the pointer type produced by
7718 the function-to-pointer standard conversion
7719 (_conv.func_) is used in place of A for type deduction;
7722 --If A is a cv-qualified type, the top level
7723 cv-qualifiers of A's type are ignored for type
7725 if (TREE_CODE (*arg
) == ARRAY_TYPE
)
7726 *arg
= build_pointer_type (TREE_TYPE (*arg
));
7727 else if (TREE_CODE (*arg
) == FUNCTION_TYPE
)
7728 *arg
= build_pointer_type (*arg
);
7730 *arg
= TYPE_MAIN_VARIANT (*arg
);
7733 /* [temp.deduct.call]
7735 If P is a cv-qualified type, the top level cv-qualifiers
7736 of P's type are ignored for type deduction. If P is a
7737 reference type, the type referred to by P is used for
7739 *parm
= TYPE_MAIN_VARIANT (*parm
);
7740 if (TREE_CODE (*parm
) == REFERENCE_TYPE
)
7741 *parm
= TREE_TYPE (*parm
);
7744 /* Like type_unfication.
7746 If SUBR is 1, we're being called recursively (to unify the
7747 arguments of a function or method parameter of a function
7751 type_unification_real (tparms
, targs
, parms
, args
, subr
,
7752 strict
, allow_incomplete
)
7753 tree tparms
, targs
, parms
, args
;
7755 unification_kind_t strict
;
7756 int allow_incomplete
;
7760 int ntparms
= TREE_VEC_LENGTH (tparms
);
7763 my_friendly_assert (TREE_CODE (tparms
) == TREE_VEC
, 289);
7764 my_friendly_assert (parms
== NULL_TREE
7765 || TREE_CODE (parms
) == TREE_LIST
, 290);
7766 /* ARGS could be NULL (via a call from parse.y to
7767 build_x_function_call). */
7769 my_friendly_assert (TREE_CODE (args
) == TREE_LIST
, 291);
7770 my_friendly_assert (ntparms
> 0, 292);
7775 sub_strict
= UNIFY_ALLOW_MORE_CV_QUAL
| UNIFY_ALLOW_DERIVED
;
7779 sub_strict
= UNIFY_ALLOW_LESS_CV_QUAL
;
7783 sub_strict
= UNIFY_ALLOW_NONE
;
7787 my_friendly_abort (0);
7791 && parms
!= void_list_node
7793 && args
!= void_list_node
)
7795 parm
= TREE_VALUE (parms
);
7796 parms
= TREE_CHAIN (parms
);
7797 arg
= TREE_VALUE (args
);
7798 args
= TREE_CHAIN (args
);
7800 if (arg
== error_mark_node
)
7802 if (arg
== unknown_type_node
)
7803 /* We can't deduce anything from this, but we might get all the
7804 template args from other function args. */
7807 /* Conversions will be performed on a function argument that
7808 corresponds with a function parameter that contains only
7809 non-deducible template parameters and explicitly specified
7810 template parameters. */
7811 if (! uses_template_parms (parm
))
7816 type
= TREE_TYPE (arg
);
7823 if (strict
== DEDUCE_EXACT
)
7825 if (same_type_p (parm
, type
))
7829 /* It might work; we shouldn't check now, because we might
7830 get into infinite recursion. Overload resolution will
7839 my_friendly_assert (TREE_TYPE (arg
) != NULL_TREE
, 293);
7840 if (type_unknown_p (arg
))
7842 /* [temp.deduct.type] A template-argument can be deduced from
7843 a pointer to function or pointer to member function
7844 argument if the set of overloaded functions does not
7845 contain function templates and at most one of a set of
7846 overloaded functions provides a unique match. */
7848 if (resolve_overloaded_unification
7849 (tparms
, targs
, parm
, arg
, strict
, sub_strict
)
7854 arg
= TREE_TYPE (arg
);
7858 maybe_adjust_types_for_deduction (strict
, &parm
, &arg
);
7860 switch (unify (tparms
, targs
, parm
, arg
, sub_strict
))
7868 /* Fail if we've reached the end of the parm list, and more args
7869 are present, and the parm list isn't variadic. */
7870 if (args
&& args
!= void_list_node
&& parms
== void_list_node
)
7872 /* Fail if parms are left and they don't have default values. */
7874 && parms
!= void_list_node
7875 && TREE_PURPOSE (parms
) == NULL_TREE
)
7878 for (i
= 0; i
< ntparms
; i
++)
7879 if (TREE_VEC_ELT (targs
, i
) == NULL_TREE
)
7881 if (!allow_incomplete
)
7882 error ("incomplete type unification");
7888 /* Subroutine of type_unification_real. Args are like the variables at the
7889 call site. ARG is an overloaded function (or template-id); we try
7890 deducing template args from each of the overloads, and if only one
7891 succeeds, we go with that. Modifies TARGS and returns 0 on success. */
7894 resolve_overloaded_unification (tparms
, targs
, parm
, arg
, strict
,
7896 tree tparms
, targs
, parm
, arg
;
7897 unification_kind_t strict
;
7900 tree tempargs
= copy_node (targs
);
7903 if (TREE_CODE (arg
) == ADDR_EXPR
)
7904 arg
= TREE_OPERAND (arg
, 0);
7906 if (TREE_CODE (arg
) == COMPONENT_REF
)
7907 /* Handle `&x' where `x' is some static or non-static member
7909 arg
= TREE_OPERAND (arg
, 1);
7911 if (TREE_CODE (arg
) == OFFSET_REF
)
7912 arg
= TREE_OPERAND (arg
, 1);
7914 /* Strip baselink information. */
7915 while (TREE_CODE (arg
) == TREE_LIST
)
7916 arg
= TREE_VALUE (arg
);
7918 if (TREE_CODE (arg
) == TEMPLATE_ID_EXPR
)
7920 /* If we got some explicit template args, we need to plug them into
7921 the affected templates before we try to unify, in case the
7922 explicit args will completely resolve the templates in question. */
7924 tree expl_subargs
= TREE_OPERAND (arg
, 1);
7925 arg
= TREE_OPERAND (arg
, 0);
7927 for (; arg
; arg
= OVL_NEXT (arg
))
7929 tree fn
= OVL_CURRENT (arg
);
7932 if (TREE_CODE (fn
) != TEMPLATE_DECL
)
7935 subargs
= get_bindings_overload (fn
, DECL_TEMPLATE_RESULT (fn
),
7939 elem
= tsubst (TREE_TYPE (fn
), subargs
, /*complain=*/0,
7941 if (TREE_CODE (elem
) == METHOD_TYPE
)
7942 elem
= build_ptrmemfunc_type (build_pointer_type (elem
));
7943 good
+= try_one_overload (tparms
, targs
, tempargs
, parm
, elem
,
7944 strict
, sub_strict
);
7948 else if (TREE_CODE (arg
) == OVERLOAD
)
7950 for (; arg
; arg
= OVL_NEXT (arg
))
7952 tree type
= TREE_TYPE (OVL_CURRENT (arg
));
7953 if (TREE_CODE (type
) == METHOD_TYPE
)
7954 type
= build_ptrmemfunc_type (build_pointer_type (type
));
7955 good
+= try_one_overload (tparms
, targs
, tempargs
, parm
,
7957 strict
, sub_strict
);
7961 my_friendly_abort (981006);
7963 /* [temp.deduct.type] A template-argument can be deduced from a pointer
7964 to function or pointer to member function argument if the set of
7965 overloaded functions does not contain function templates and at most
7966 one of a set of overloaded functions provides a unique match.
7968 So if we found multiple possibilities, we return success but don't
7973 int i
= TREE_VEC_LENGTH (targs
);
7975 if (TREE_VEC_ELT (tempargs
, i
))
7976 TREE_VEC_ELT (targs
, i
) = TREE_VEC_ELT (tempargs
, i
);
7984 /* Subroutine of resolve_overloaded_unification; does deduction for a single
7985 overload. Fills TARGS with any deduced arguments, or error_mark_node if
7986 different overloads deduce different arguments for a given parm.
7987 Returns 1 on success. */
7990 try_one_overload (tparms
, orig_targs
, targs
, parm
, arg
, strict
,
7992 tree tparms
, orig_targs
, targs
, parm
, arg
;
7993 unification_kind_t strict
;
8000 /* [temp.deduct.type] A template-argument can be deduced from a pointer
8001 to function or pointer to member function argument if the set of
8002 overloaded functions does not contain function templates and at most
8003 one of a set of overloaded functions provides a unique match.
8005 So if this is a template, just return success. */
8007 if (uses_template_parms (arg
))
8010 maybe_adjust_types_for_deduction (strict
, &parm
, &arg
);
8012 /* We don't copy orig_targs for this because if we have already deduced
8013 some template args from previous args, unify would complain when we
8014 try to deduce a template parameter for the same argument, even though
8015 there isn't really a conflict. */
8016 nargs
= TREE_VEC_LENGTH (targs
);
8017 tempargs
= make_tree_vec (nargs
);
8019 if (unify (tparms
, tempargs
, parm
, arg
, sub_strict
) != 0)
8022 /* First make sure we didn't deduce anything that conflicts with
8023 explicitly specified args. */
8024 for (i
= nargs
; i
--; )
8026 tree elt
= TREE_VEC_ELT (tempargs
, i
);
8027 tree oldelt
= TREE_VEC_ELT (orig_targs
, i
);
8029 if (elt
== NULL_TREE
)
8031 else if (uses_template_parms (elt
))
8033 /* Since we're unifying against ourselves, we will fill in template
8034 args used in the function parm list with our own template parms.
8036 TREE_VEC_ELT (tempargs
, i
) = NULL_TREE
;
8039 else if (oldelt
&& ! template_args_equal (oldelt
, elt
))
8043 for (i
= nargs
; i
--; )
8045 tree elt
= TREE_VEC_ELT (tempargs
, i
);
8048 TREE_VEC_ELT (targs
, i
) = elt
;
8054 /* PARM is a template class (perhaps with unbound template
8055 parameters). ARG is a fully instantiated type. If ARG can be
8056 bound to PARM, return ARG, otherwise return NULL_TREE. TPARMS and
8057 TARGS are as for unify. */
8060 try_class_unification (tparms
, targs
, parm
, arg
)
8069 if (!CLASSTYPE_TEMPLATE_INFO (arg
)
8070 || CLASSTYPE_TI_TEMPLATE (arg
) != CLASSTYPE_TI_TEMPLATE (parm
))
8073 /* We need to make a new template argument vector for the call to
8074 unify. If we used TARGS, we'd clutter it up with the result of
8075 the attempted unification, even if this class didn't work out.
8076 We also don't want to commit ourselves to all the unifications
8077 we've already done, since unification is supposed to be done on
8078 an argument-by-argument basis. In other words, consider the
8079 following pathological case:
8081 template <int I, int J, int K>
8084 template <int I, int J>
8085 struct S<I, J, 2> : public S<I, I, I>, S<J, J, J> {};
8087 template <int I, int J, int K>
8088 void f(S<I, J, K>, S<I, I, I>);
8097 Now, by the time we consider the unification involving `s2', we
8098 already know that we must have `f<0, 0, 0>'. But, even though
8099 `S<0, 1, 2>' is derived from `S<0, 0, 0>', the code is not legal
8100 because there are two ways to unify base classes of S<0, 1, 2>
8101 with S<I, I, I>. If we kept the already deduced knowledge, we
8102 would reject the possibility I=1. */
8103 copy_of_targs
= make_tree_vec (TREE_VEC_LENGTH (targs
));
8104 i
= unify (tparms
, copy_of_targs
, CLASSTYPE_TI_ARGS (parm
),
8105 CLASSTYPE_TI_ARGS (arg
), UNIFY_ALLOW_NONE
);
8107 /* If unification failed, we're done. */
8114 /* Subroutine of get_template_base. RVAL, if non-NULL, is a base we
8115 have alreay discovered to be satisfactory. ARG_BINFO is the binfo
8116 for the base class of ARG that we are currently examining. */
8119 get_template_base_recursive (tparms
, targs
, parm
,
8120 arg_binfo
, rval
, flags
)
8130 tree arg
= BINFO_TYPE (arg_binfo
);
8132 if (!(flags
& GTB_IGNORE_TYPE
))
8134 tree r
= try_class_unification (tparms
, targs
,
8137 /* If there is more than one satisfactory baseclass, then:
8141 If they yield more than one possible deduced A, the type
8145 if (r
&& rval
&& !same_type_p (r
, rval
))
8146 return error_mark_node
;
8151 binfos
= BINFO_BASETYPES (arg_binfo
);
8152 n_baselinks
= binfos
? TREE_VEC_LENGTH (binfos
) : 0;
8154 /* Process base types. */
8155 for (i
= 0; i
< n_baselinks
; i
++)
8157 tree base_binfo
= TREE_VEC_ELT (binfos
, i
);
8160 /* Skip this base, if we've already seen it. */
8161 if (BINFO_MARKED (base_binfo
))
8165 (flags
& GTB_VIA_VIRTUAL
) || TREE_VIA_VIRTUAL (base_binfo
);
8167 /* When searching for a non-virtual, we cannot mark virtually
8170 SET_BINFO_MARKED (base_binfo
);
8172 rval
= get_template_base_recursive (tparms
, targs
,
8176 GTB_VIA_VIRTUAL
* this_virtual
);
8178 /* If we discovered more than one matching base class, we can
8180 if (rval
== error_mark_node
)
8181 return error_mark_node
;
8187 /* Given a template type PARM and a class type ARG, find the unique
8188 base type in ARG that is an instance of PARM. We do not examine
8189 ARG itself; only its base-classes. If there is no appropriate base
8190 class, return NULL_TREE. If there is more than one, return
8191 error_mark_node. PARM may be the type of a partial specialization,
8192 as well as a plain template type. Used by unify. */
8195 get_template_base (tparms
, targs
, parm
, arg
)
8204 my_friendly_assert (IS_AGGR_TYPE_CODE (TREE_CODE (arg
)), 92);
8206 arg_binfo
= TYPE_BINFO (complete_type (arg
));
8207 rval
= get_template_base_recursive (tparms
, targs
,
8212 /* Since get_template_base_recursive marks the bases classes, we
8213 must unmark them here. */
8214 dfs_walk (arg_binfo
, dfs_unmark
, markedp
, 0);
8219 /* Returns the level of DECL, which declares a template parameter. */
8222 template_decl_level (decl
)
8225 switch (TREE_CODE (decl
))
8229 return TEMPLATE_TYPE_LEVEL (TREE_TYPE (decl
));
8232 return TEMPLATE_PARM_LEVEL (DECL_INITIAL (decl
));
8235 my_friendly_abort (0);
8240 /* Decide whether ARG can be unified with PARM, considering only the
8241 cv-qualifiers of each type, given STRICT as documented for unify.
8242 Returns non-zero iff the unification is OK on that basis.*/
8245 check_cv_quals_for_unify (strict
, arg
, parm
)
8250 if (!(strict
& UNIFY_ALLOW_MORE_CV_QUAL
)
8251 && !at_least_as_qualified_p (arg
, parm
))
8254 if (!(strict
& UNIFY_ALLOW_LESS_CV_QUAL
)
8255 && !at_least_as_qualified_p (parm
, arg
))
8261 /* Takes parameters as for type_unification. Returns 0 if the
8262 type deduction suceeds, 1 otherwise. The parameter STRICT is a
8263 bitwise or of the following flags:
8266 Require an exact match between PARM and ARG.
8267 UNIFY_ALLOW_MORE_CV_QUAL:
8268 Allow the deduced ARG to be more cv-qualified than ARG.
8269 UNIFY_ALLOW_LESS_CV_QUAL:
8270 Allow the deduced ARG to be less cv-qualified than ARG.
8271 UNIFY_ALLOW_DERIVED:
8272 Allow the deduced ARG to be a template base class of ARG,
8273 or a pointer to a template base class of the type pointed to by
8275 UNIFY_ALLOW_INTEGER:
8276 Allow any integral type to be deduced. See the TEMPLATE_PARM_INDEX
8277 case for more information. */
8280 unify (tparms
, targs
, parm
, arg
, strict
)
8281 tree tparms
, targs
, parm
, arg
;
8288 /* I don't think this will do the right thing with respect to types.
8289 But the only case I've seen it in so far has been array bounds, where
8290 signedness is the only information lost, and I think that will be
8292 while (TREE_CODE (parm
) == NOP_EXPR
)
8293 parm
= TREE_OPERAND (parm
, 0);
8295 if (arg
== error_mark_node
)
8297 if (arg
== unknown_type_node
)
8298 /* We can't deduce anything from this, but we might get all the
8299 template args from other function args. */
8302 /* If PARM uses template parameters, then we can't bail out here,
8303 even if ARG == PARM, since we won't record unifications for the
8304 template parameters. We might need them if we're trying to
8305 figure out which of two things is more specialized. */
8306 if (arg
== parm
&& !uses_template_parms (parm
))
8309 /* Immediately reject some pairs that won't unify because of
8310 cv-qualification mismatches. */
8311 if (TREE_CODE (arg
) == TREE_CODE (parm
)
8313 /* We check the cv-qualifiers when unifying with template type
8314 parameters below. We want to allow ARG `const T' to unify with
8315 PARM `T' for example, when computing which of two templates
8316 is more specialized, for example. */
8317 && TREE_CODE (arg
) != TEMPLATE_TYPE_PARM
8318 && !check_cv_quals_for_unify (strict
, arg
, parm
))
8321 switch (TREE_CODE (parm
))
8324 /* In a type which contains a nested-name-specifier, template
8325 argument values cannot be deduced for template parameters used
8326 within the nested-name-specifier. */
8329 case TEMPLATE_TYPE_PARM
:
8330 case TEMPLATE_TEMPLATE_PARM
:
8331 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, 0));
8333 if (TEMPLATE_TYPE_LEVEL (parm
)
8334 != template_decl_level (tparm
))
8335 /* The PARM is not one we're trying to unify. Just check
8336 to see if it matches ARG. */
8337 return (TREE_CODE (arg
) == TREE_CODE (parm
)
8338 && same_type_p (parm
, arg
)) ? 0 : 1;
8339 idx
= TEMPLATE_TYPE_IDX (parm
);
8340 targ
= TREE_VEC_ELT (targs
, idx
);
8341 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, idx
));
8343 /* Check for mixed types and values. */
8344 if ((TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
8345 && TREE_CODE (tparm
) != TYPE_DECL
)
8346 || (TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
8347 && TREE_CODE (tparm
) != TEMPLATE_DECL
))
8350 if (TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
)
8352 if (TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (parm
))
8354 /* We arrive here when PARM does not involve template
8357 /* ARG must be constructed from a template class. */
8358 if (TREE_CODE (arg
) != RECORD_TYPE
|| !CLASSTYPE_TEMPLATE_INFO (arg
))
8362 tree parmtmpl
= TYPE_TI_TEMPLATE (parm
);
8363 tree parmvec
= TYPE_TI_ARGS (parm
);
8364 tree argvec
= CLASSTYPE_TI_ARGS (arg
);
8366 = DECL_INNERMOST_TEMPLATE_PARMS (CLASSTYPE_TI_TEMPLATE (arg
));
8369 /* The parameter and argument roles have to be switched here
8370 in order to handle default arguments properly. For example,
8371 template<template <class> class TT> void f(TT<int>)
8372 should be able to accept vector<int> which comes from
8373 template <class T, class Allocator = allocator>
8376 if (coerce_template_parms (argtmplvec
, parmvec
, parmtmpl
, 0, 1)
8380 /* Deduce arguments T, i from TT<T> or TT<i>.
8381 We check each element of PARMVEC and ARGVEC individually
8382 rather than the whole TREE_VEC since they can have
8383 different number of elements. */
8385 for (i
= 0; i
< TREE_VEC_LENGTH (parmvec
); ++i
)
8387 tree t
= TREE_VEC_ELT (parmvec
, i
);
8389 if (unify (tparms
, targs
, t
,
8390 TREE_VEC_ELT (argvec
, i
),
8395 arg
= CLASSTYPE_TI_TEMPLATE (arg
);
8400 /* If PARM is `const T' and ARG is only `int', we don't have
8401 a match unless we are allowing additional qualification.
8402 If ARG is `const int' and PARM is just `T' that's OK;
8403 that binds `const int' to `T'. */
8404 if (!check_cv_quals_for_unify (strict
| UNIFY_ALLOW_LESS_CV_QUAL
,
8408 /* Consider the case where ARG is `const volatile int' and
8409 PARM is `const T'. Then, T should be `volatile int'. */
8411 cp_build_qualified_type_real (arg
,
8413 & ~CP_TYPE_QUALS (parm
),
8415 if (arg
== error_mark_node
)
8419 /* Simple cases: Value already set, does match or doesn't. */
8420 if (targ
!= NULL_TREE
&& same_type_p (targ
, arg
))
8425 /* Make sure that ARG is not a variable-sized array. (Note that
8426 were talking about variable-sized arrays (like `int[n]'),
8427 rather than arrays of unknown size (like `int[]').) We'll
8428 get very confused by such a type since the bound of the array
8429 will not be computable in an instantiation. Besides, such
8430 types are not allowed in ISO C++, so we can do as we please
8432 if (TREE_CODE (arg
) == ARRAY_TYPE
8433 && !uses_template_parms (arg
)
8434 && (TREE_CODE (TYPE_MAX_VALUE (TYPE_DOMAIN (arg
)))
8438 TREE_VEC_ELT (targs
, idx
) = arg
;
8441 case TEMPLATE_PARM_INDEX
:
8442 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, 0));
8444 if (TEMPLATE_PARM_LEVEL (parm
)
8445 != template_decl_level (tparm
))
8446 /* The PARM is not one we're trying to unify. Just check
8447 to see if it matches ARG. */
8448 return (TREE_CODE (arg
) == TREE_CODE (parm
)
8449 && cp_tree_equal (parm
, arg
) > 0) ? 0 : 1;
8451 idx
= TEMPLATE_PARM_IDX (parm
);
8452 targ
= TREE_VEC_ELT (targs
, idx
);
8456 int i
= (cp_tree_equal (targ
, arg
) > 0);
8462 my_friendly_abort (42);
8465 /* [temp.deduct.type] If, in the declaration of a function template
8466 with a non-type template-parameter, the non-type
8467 template-parameter is used in an expression in the function
8468 parameter-list and, if the corresponding template-argument is
8469 deduced, the template-argument type shall match the type of the
8470 template-parameter exactly, except that a template-argument
8471 deduced from an array bound may be of any integral type. */
8472 if (same_type_p (TREE_TYPE (arg
), TREE_TYPE (parm
)))
8474 else if ((strict
& UNIFY_ALLOW_INTEGER
)
8475 && (TREE_CODE (TREE_TYPE (parm
)) == INTEGER_TYPE
8476 || TREE_CODE (TREE_TYPE (parm
)) == BOOLEAN_TYPE
))
8481 TREE_VEC_ELT (targs
, idx
) = arg
;
8488 if (TREE_CODE (arg
) != POINTER_TYPE
)
8491 /* [temp.deduct.call]
8493 A can be another pointer or pointer to member type that can
8494 be converted to the deduced A via a qualification
8495 conversion (_conv.qual_).
8497 We pass down STRICT here rather than UNIFY_ALLOW_NONE.
8498 This will allow for additional cv-qualification of the
8499 pointed-to types if appropriate. In general, this is a bit
8500 too generous; we are only supposed to allow qualification
8501 conversions and this method will allow an ARG of char** and
8502 a deduced ARG of const char**. However, overload
8503 resolution will subsequently invalidate the candidate, so
8504 this is probably OK. */
8505 sub_strict
= strict
;
8507 if (TREE_CODE (TREE_TYPE (arg
)) != RECORD_TYPE
)
8508 /* The derived-to-base conversion only persists through one
8509 level of pointers. */
8510 sub_strict
&= ~UNIFY_ALLOW_DERIVED
;
8512 return unify (tparms
, targs
, TREE_TYPE (parm
),
8513 TREE_TYPE (arg
), sub_strict
);
8516 case REFERENCE_TYPE
:
8517 if (TREE_CODE (arg
) != REFERENCE_TYPE
)
8519 return unify (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
8523 if (TREE_CODE (arg
) != ARRAY_TYPE
)
8525 if ((TYPE_DOMAIN (parm
) == NULL_TREE
)
8526 != (TYPE_DOMAIN (arg
) == NULL_TREE
))
8528 if (TYPE_DOMAIN (parm
) != NULL_TREE
8529 && unify (tparms
, targs
, TYPE_DOMAIN (parm
),
8530 TYPE_DOMAIN (arg
), UNIFY_ALLOW_NONE
) != 0)
8532 return unify (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
8540 if (TREE_CODE (arg
) != TREE_CODE (parm
))
8543 if (TREE_CODE (parm
) == INTEGER_TYPE
8544 && TREE_CODE (TYPE_MAX_VALUE (parm
)) != INTEGER_CST
)
8546 if (TYPE_MIN_VALUE (parm
) && TYPE_MIN_VALUE (arg
)
8547 && unify (tparms
, targs
, TYPE_MIN_VALUE (parm
),
8548 TYPE_MIN_VALUE (arg
), UNIFY_ALLOW_INTEGER
))
8550 if (TYPE_MAX_VALUE (parm
) && TYPE_MAX_VALUE (arg
)
8551 && unify (tparms
, targs
, TYPE_MAX_VALUE (parm
),
8552 TYPE_MAX_VALUE (arg
), UNIFY_ALLOW_INTEGER
))
8555 /* We have already checked cv-qualification at the top of the
8557 else if (!same_type_ignoring_top_level_qualifiers_p (arg
, parm
))
8560 /* As far as unification is concerned, this wins. Later checks
8561 will invalidate it if necessary. */
8564 /* Types INTEGER_CST and MINUS_EXPR can come from array bounds. */
8565 /* Type INTEGER_CST can come from ordinary constant template args. */
8567 while (TREE_CODE (arg
) == NOP_EXPR
)
8568 arg
= TREE_OPERAND (arg
, 0);
8570 if (TREE_CODE (arg
) != INTEGER_CST
)
8572 return !tree_int_cst_equal (parm
, arg
);
8577 if (TREE_CODE (arg
) != TREE_VEC
)
8579 if (TREE_VEC_LENGTH (parm
) != TREE_VEC_LENGTH (arg
))
8581 for (i
= 0; i
< TREE_VEC_LENGTH (parm
); ++i
)
8582 if (unify (tparms
, targs
,
8583 TREE_VEC_ELT (parm
, i
), TREE_VEC_ELT (arg
, i
),
8591 if (TREE_CODE (arg
) != TREE_CODE (parm
))
8594 if (TYPE_PTRMEMFUNC_P (parm
))
8596 if (!TYPE_PTRMEMFUNC_P (arg
))
8599 return unify (tparms
, targs
,
8600 TYPE_PTRMEMFUNC_FN_TYPE (parm
),
8601 TYPE_PTRMEMFUNC_FN_TYPE (arg
),
8605 if (CLASSTYPE_TEMPLATE_INFO (parm
))
8609 if (strict
& UNIFY_ALLOW_DERIVED
)
8611 /* First, we try to unify the PARM and ARG directly. */
8612 t
= try_class_unification (tparms
, targs
,
8617 /* Fallback to the special case allowed in
8620 If P is a class, and P has the form
8621 template-id, then A can be a derived class of
8622 the deduced A. Likewise, if P is a pointer to
8623 a class of the form template-id, A can be a
8624 pointer to a derived class pointed to by the
8626 t
= get_template_base (tparms
, targs
,
8629 if (! t
|| t
== error_mark_node
)
8633 else if (CLASSTYPE_TEMPLATE_INFO (arg
)
8634 && (CLASSTYPE_TI_TEMPLATE (parm
)
8635 == CLASSTYPE_TI_TEMPLATE (arg
)))
8636 /* Perhaps PARM is something like S<U> and ARG is S<int>.
8637 Then, we should unify `int' and `U'. */
8640 /* There's no chance of unication succeeding. */
8643 return unify (tparms
, targs
, CLASSTYPE_TI_ARGS (parm
),
8644 CLASSTYPE_TI_ARGS (t
), UNIFY_ALLOW_NONE
);
8646 else if (!same_type_ignoring_top_level_qualifiers_p (parm
, arg
))
8652 if (TREE_CODE (arg
) != TREE_CODE (parm
))
8655 if (unify (tparms
, targs
, TREE_TYPE (parm
),
8656 TREE_TYPE (arg
), UNIFY_ALLOW_NONE
))
8658 return type_unification_real (tparms
, targs
, TYPE_ARG_TYPES (parm
),
8659 TYPE_ARG_TYPES (arg
), 1,
8663 if (TREE_CODE (arg
) != OFFSET_TYPE
)
8665 if (unify (tparms
, targs
, TYPE_OFFSET_BASETYPE (parm
),
8666 TYPE_OFFSET_BASETYPE (arg
), UNIFY_ALLOW_NONE
))
8668 return unify (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
8672 if (arg
!= decl_constant_value (parm
))
8677 /* Matched cases are handled by the ARG == PARM test above. */
8681 if (TREE_CODE (TREE_OPERAND (parm
, 1)) == INTEGER_CST
)
8683 /* We handle this case specially, since it comes up with
8684 arrays. In particular, something like:
8686 template <int N> void f(int (&x)[N]);
8688 Here, we are trying to unify the range type, which
8689 looks like [0 ... (N - 1)]. */
8691 t1
= TREE_OPERAND (parm
, 0);
8692 t2
= TREE_OPERAND (parm
, 1);
8694 t
= fold (build (PLUS_EXPR
, integer_type_node
, arg
, t2
));
8696 return unify (tparms
, targs
, t1
, t
, strict
);
8698 /* else fall through */
8701 if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (TREE_CODE (parm
))))
8702 /* We're looking at an expression. This can happen with
8706 void foo(S<I>, S<I + 2>);
8708 This is a "nondeduced context":
8712 The nondeduced contexts are:
8714 --A type that is a template-id in which one or more of
8715 the template-arguments is an expression that references
8716 a template-parameter.
8718 In these cases, we assume deduction succeeded, but don't
8719 actually infer any unifications. */
8722 sorry ("use of `%s' in template type unification",
8723 tree_code_name
[(int) TREE_CODE (parm
)]);
8729 /* Called if RESULT is explicitly instantiated, or is a member of an
8730 explicitly instantiated class, or if using -frepo and the
8731 instantiation of RESULT has been assigned to this file. */
8734 mark_decl_instantiated (result
, extern_p
)
8738 if (TREE_CODE (result
) != FUNCTION_DECL
)
8739 /* The TREE_PUBLIC flag for function declarations will have been
8740 set correctly by tsubst. */
8741 TREE_PUBLIC (result
) = 1;
8743 /* We used to set this unconditionally; we moved that to
8744 do_decl_instantiation so it wouldn't get set on members of
8745 explicit class template instantiations. But we still need to set
8746 it here for the 'extern template' case in order to suppress
8747 implicit instantiations. */
8749 SET_DECL_EXPLICIT_INSTANTIATION (result
);
8753 DECL_INTERFACE_KNOWN (result
) = 1;
8754 DECL_NOT_REALLY_EXTERN (result
) = 1;
8756 /* Always make artificials weak. */
8757 if (DECL_ARTIFICIAL (result
) && flag_weak
)
8758 comdat_linkage (result
);
8759 /* For WIN32 we also want to put explicit instantiations in
8760 linkonce sections. */
8761 else if (TREE_PUBLIC (result
))
8762 maybe_make_one_only (result
);
8764 else if (TREE_CODE (result
) == FUNCTION_DECL
)
8768 /* Given two function templates PAT1 and PAT2, and explicit template
8769 arguments EXPLICIT_ARGS return:
8771 1 if PAT1 is more specialized than PAT2 as described in [temp.func.order].
8772 -1 if PAT2 is more specialized than PAT1.
8773 0 if neither is more specialized. */
8776 more_specialized (pat1
, pat2
, explicit_args
)
8777 tree pat1
, pat2
, explicit_args
;
8783 = get_bindings_overload (pat1
, DECL_TEMPLATE_RESULT (pat2
), explicit_args
);
8788 = get_bindings_overload (pat2
, DECL_TEMPLATE_RESULT (pat1
), explicit_args
);
8795 /* Given two class template specialization list nodes PAT1 and PAT2, return:
8797 1 if PAT1 is more specialized than PAT2 as described in [temp.class.order].
8798 -1 if PAT2 is more specialized than PAT1.
8799 0 if neither is more specialized. */
8802 more_specialized_class (pat1
, pat2
)
8808 targs
= get_class_bindings (TREE_VALUE (pat1
), TREE_PURPOSE (pat1
),
8809 TREE_PURPOSE (pat2
));
8813 targs
= get_class_bindings (TREE_VALUE (pat2
), TREE_PURPOSE (pat2
),
8814 TREE_PURPOSE (pat1
));
8821 /* Return the template arguments that will produce the function signature
8822 DECL from the function template FN, with the explicit template
8823 arguments EXPLICIT_ARGS. If CHECK_RETTYPE is 1, the return type must
8824 also match. Return NULL_TREE if no satisfactory arguments could be
8828 get_bindings_real (fn
, decl
, explicit_args
, check_rettype
)
8829 tree fn
, decl
, explicit_args
;
8832 int ntparms
= DECL_NTPARMS (fn
);
8833 tree targs
= make_tree_vec (ntparms
);
8835 tree decl_arg_types
;
8838 /* Substitute the explicit template arguments into the type of DECL.
8839 The call to fn_type_unification will handle substitution into the
8841 decl_type
= TREE_TYPE (decl
);
8842 if (explicit_args
&& uses_template_parms (decl_type
))
8845 tree converted_args
;
8847 if (DECL_TEMPLATE_INFO (decl
))
8848 tmpl
= DECL_TI_TEMPLATE (decl
);
8850 /* We can get here for some illegal specializations. */
8854 = (coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (tmpl
),
8855 explicit_args
, NULL_TREE
,
8857 /*require_all_arguments=*/0));
8858 if (converted_args
== error_mark_node
)
8861 decl_type
= tsubst (decl_type
, converted_args
, /*complain=*/0,
8863 if (decl_type
== error_mark_node
)
8867 /* If FN is a static member function, adjust the type of DECL
8869 decl_arg_types
= TYPE_ARG_TYPES (decl_type
);
8870 if (DECL_STATIC_FUNCTION_P (fn
)
8871 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
8872 decl_arg_types
= TREE_CHAIN (decl_arg_types
);
8874 i
= fn_type_unification (fn
, explicit_args
, targs
,
8876 (check_rettype
|| DECL_CONV_FN_P (fn
)
8877 ? TREE_TYPE (decl_type
) : NULL_TREE
),
8886 /* For most uses, we want to check the return type. */
8889 get_bindings (fn
, decl
, explicit_args
)
8890 tree fn
, decl
, explicit_args
;
8892 return get_bindings_real (fn
, decl
, explicit_args
, 1);
8895 /* But for more_specialized, we only care about the parameter types. */
8898 get_bindings_overload (fn
, decl
, explicit_args
)
8899 tree fn
, decl
, explicit_args
;
8901 return get_bindings_real (fn
, decl
, explicit_args
, 0);
8904 /* Return the innermost template arguments that, when applied to a
8905 template specialization whose innermost template parameters are
8906 TPARMS, and whose specialization arguments are ARGS, yield the
8909 For example, suppose we have:
8911 template <class T, class U> struct S {};
8912 template <class T> struct S<T*, int> {};
8914 Then, suppose we want to get `S<double*, int>'. The TPARMS will be
8915 {T}, the PARMS will be {T*, int} and the ARGS will be {double*,
8916 int}. The resulting vector will be {double}, indicating that `T'
8917 is bound to `double'. */
8920 get_class_bindings (tparms
, parms
, args
)
8921 tree tparms
, parms
, args
;
8923 int i
, ntparms
= TREE_VEC_LENGTH (tparms
);
8924 tree vec
= make_tree_vec (ntparms
);
8926 args
= INNERMOST_TEMPLATE_ARGS (args
);
8928 if (unify (tparms
, vec
, parms
, args
, UNIFY_ALLOW_NONE
))
8931 for (i
= 0; i
< ntparms
; ++i
)
8932 if (! TREE_VEC_ELT (vec
, i
))
8938 /* In INSTANTIATIONS is a list of <INSTANTIATION, TEMPLATE> pairs.
8939 Pick the most specialized template, and return the corresponding
8940 instantiation, or if there is no corresponding instantiation, the
8941 template itself. EXPLICIT_ARGS is any template arguments explicity
8942 mentioned in a template-id. If there is no most specialized
8943 template, error_mark_node is returned. If there are no templates
8944 at all, NULL_TREE is returned. */
8947 most_specialized_instantiation (instantiations
, explicit_args
)
8948 tree instantiations
;
8954 if (!instantiations
)
8957 champ
= instantiations
;
8958 for (fn
= TREE_CHAIN (instantiations
); fn
; fn
= TREE_CHAIN (fn
))
8960 fate
= more_specialized (TREE_VALUE (champ
),
8961 TREE_VALUE (fn
), explicit_args
);
8968 fn
= TREE_CHAIN (fn
);
8970 return error_mark_node
;
8976 for (fn
= instantiations
; fn
&& fn
!= champ
; fn
= TREE_CHAIN (fn
))
8978 fate
= more_specialized (TREE_VALUE (champ
),
8979 TREE_VALUE (fn
), explicit_args
);
8981 return error_mark_node
;
8984 return TREE_PURPOSE (champ
) ? TREE_PURPOSE (champ
) : TREE_VALUE (champ
);
8987 /* Return the most specialized of the list of templates in FNS that can
8988 produce an instantiation matching DECL, given the explicit template
8989 arguments EXPLICIT_ARGS. */
8992 most_specialized (fns
, decl
, explicit_args
)
8993 tree fns
, decl
, explicit_args
;
8995 tree candidates
= NULL_TREE
;
8998 for (fn
= fns
; fn
; fn
= TREE_CHAIN (fn
))
9000 tree candidate
= TREE_VALUE (fn
);
9002 args
= get_bindings (candidate
, decl
, explicit_args
);
9004 candidates
= tree_cons (NULL_TREE
, candidate
, candidates
);
9007 return most_specialized_instantiation (candidates
, explicit_args
);
9010 /* If DECL is a specialization of some template, return the most
9011 general such template. Otherwise, returns NULL_TREE.
9015 template <class T> struct S { template <class U> void f(U); };
9017 if TMPL is `template <class U> void S<int>::f(U)' this will return
9018 the full template. This function will not trace past partial
9019 specializations, however. For example, given in addition:
9021 template <class T> struct S<T*> { template <class U> void f(U); };
9023 if TMPL is `template <class U> void S<int*>::f(U)' this will return
9024 `template <class T> template <class U> S<T*>::f(U)'. */
9027 most_general_template (decl
)
9030 /* If DECL is a FUNCTION_DECL, find the TEMPLATE_DECL of which it is
9031 an immediate specialization. */
9032 if (TREE_CODE (decl
) == FUNCTION_DECL
)
9034 if (DECL_TEMPLATE_INFO (decl
)) {
9035 decl
= DECL_TI_TEMPLATE (decl
);
9037 /* The DECL_TI_TEMPLATE can be an IDENTIFIER_NODE for a
9039 if (TREE_CODE (decl
) != TEMPLATE_DECL
)
9045 /* Look for more and more general templates. */
9046 while (DECL_TEMPLATE_INFO (decl
))
9048 /* The DECL_TI_TEMPLATE can be a LOOKUP_EXPR or IDENTIFIER_NODE
9049 in some cases. (See cp-tree.h for details.) */
9050 if (TREE_CODE (DECL_TI_TEMPLATE (decl
)) != TEMPLATE_DECL
)
9053 /* Stop if we run into an explicitly specialized class template. */
9054 if (!DECL_NAMESPACE_SCOPE_P (decl
)
9055 && DECL_CONTEXT (decl
)
9056 && CLASSTYPE_TEMPLATE_SPECIALIZATION (DECL_CONTEXT (decl
)))
9059 decl
= DECL_TI_TEMPLATE (decl
);
9065 /* Return the most specialized of the class template specializations
9066 of TMPL which can produce an instantiation matching ARGS, or
9067 error_mark_node if the choice is ambiguous. */
9070 most_specialized_class (tmpl
, args
)
9074 tree list
= NULL_TREE
;
9079 tmpl
= most_general_template (tmpl
);
9080 for (t
= DECL_TEMPLATE_SPECIALIZATIONS (tmpl
); t
; t
= TREE_CHAIN (t
))
9083 = get_class_bindings (TREE_VALUE (t
), TREE_PURPOSE (t
), args
);
9086 list
= decl_tree_cons (TREE_PURPOSE (t
), TREE_VALUE (t
), list
);
9087 TREE_TYPE (list
) = TREE_TYPE (t
);
9097 for (; t
; t
= TREE_CHAIN (t
))
9099 fate
= more_specialized_class (champ
, t
);
9108 return error_mark_node
;
9114 for (t
= list
; t
&& t
!= champ
; t
= TREE_CHAIN (t
))
9116 fate
= more_specialized_class (champ
, t
);
9118 return error_mark_node
;
9124 /* called from the parser. */
9127 do_decl_instantiation (declspecs
, declarator
, storage
)
9128 tree declspecs
, declarator
, storage
;
9130 tree decl
= grokdeclarator (declarator
, declspecs
, NORMAL
, 0, NULL_TREE
);
9131 tree result
= NULL_TREE
;
9135 /* An error ocurred, for which grokdeclarator has already issued
9136 an appropriate message. */
9138 else if (! DECL_LANG_SPECIFIC (decl
))
9140 cp_error ("explicit instantiation of non-template `%#D'", decl
);
9143 else if (TREE_CODE (decl
) == VAR_DECL
)
9145 /* There is an asymmetry here in the way VAR_DECLs and
9146 FUNCTION_DECLs are handled by grokdeclarator. In the case of
9147 the latter, the DECL we get back will be marked as a
9148 template instantiation, and the appropriate
9149 DECL_TEMPLATE_INFO will be set up. This does not happen for
9150 VAR_DECLs so we do the lookup here. Probably, grokdeclarator
9151 should handle VAR_DECLs as it currently handles
9153 result
= lookup_field (DECL_CONTEXT (decl
), DECL_NAME (decl
), 0, 0);
9154 if (result
&& TREE_CODE (result
) != VAR_DECL
)
9156 cp_error ("no matching template for `%D' found", result
);
9160 else if (TREE_CODE (decl
) != FUNCTION_DECL
)
9162 cp_error ("explicit instantiation of `%#D'", decl
);
9168 /* Check for various error cases. Note that if the explicit
9169 instantiation is legal the RESULT will currently be marked as an
9170 *implicit* instantiation; DECL_EXPLICIT_INSTANTIATION is not set
9171 until we get here. */
9173 if (DECL_TEMPLATE_SPECIALIZATION (result
))
9177 No program shall both explicitly instantiate and explicitly
9178 specialize a template. */
9179 cp_pedwarn ("explicit instantiation of `%#D' after", result
);
9180 cp_pedwarn_at ("explicit specialization here", result
);
9183 else if (DECL_EXPLICIT_INSTANTIATION (result
))
9187 No program shall explicitly instantiate any template more
9190 We check DECL_INTERFACE_KNOWN so as not to complain when the first
9191 instantiation was `extern' and the second is not, and EXTERN_P for
9192 the opposite case. If -frepo, chances are we already got marked
9193 as an explicit instantion because of the repo file. */
9194 if (DECL_INTERFACE_KNOWN (result
) && !extern_p
&& !flag_use_repository
)
9195 cp_pedwarn ("duplicate explicit instantiation of `%#D'", result
);
9197 /* If we've already instantiated the template, just return now. */
9198 if (DECL_INTERFACE_KNOWN (result
))
9201 else if (!DECL_IMPLICIT_INSTANTIATION (result
))
9203 cp_error ("no matching template for `%D' found", result
);
9206 else if (!DECL_TEMPLATE_INFO (result
))
9208 cp_pedwarn ("explicit instantiation of non-template `%#D'", result
);
9212 if (flag_external_templates
)
9215 if (storage
== NULL_TREE
)
9217 else if (storage
== ridpointers
[(int) RID_EXTERN
])
9220 cp_pedwarn ("ISO C++ forbids the use of `extern' on explicit instantiations");
9224 cp_error ("storage class `%D' applied to template instantiation",
9227 SET_DECL_EXPLICIT_INSTANTIATION (result
);
9228 mark_decl_instantiated (result
, extern_p
);
9229 repo_template_instantiated (result
, extern_p
);
9231 instantiate_decl (result
, /*defer_ok=*/1);
9235 mark_class_instantiated (t
, extern_p
)
9239 SET_CLASSTYPE_EXPLICIT_INSTANTIATION (t
);
9240 SET_CLASSTYPE_INTERFACE_KNOWN (t
);
9241 CLASSTYPE_INTERFACE_ONLY (t
) = extern_p
;
9242 CLASSTYPE_VTABLE_NEEDS_WRITING (t
) = ! extern_p
;
9243 TYPE_DECL_SUPPRESS_DEBUG (TYPE_NAME (t
)) = extern_p
;
9246 CLASSTYPE_DEBUG_REQUESTED (t
) = 1;
9247 rest_of_type_compilation (t
, 1);
9252 do_type_instantiation (t
, storage
)
9259 if (TREE_CODE (t
) == TYPE_DECL
)
9262 if (! CLASS_TYPE_P (t
) || ! CLASSTYPE_TEMPLATE_INFO (t
))
9264 cp_error ("explicit instantiation of non-template type `%T'", t
);
9270 /* With -fexternal-templates, explicit instantiations are treated the same
9271 as implicit ones. */
9272 if (flag_external_templates
)
9275 if (!COMPLETE_TYPE_P (t
))
9277 cp_error ("explicit instantiation of `%#T' before definition of template",
9282 if (storage
!= NULL_TREE
)
9285 cp_pedwarn("ISO C++ forbids the use of `%s' on explicit instantiations",
9286 IDENTIFIER_POINTER (storage
));
9288 if (storage
== ridpointers
[(int) RID_INLINE
])
9290 else if (storage
== ridpointers
[(int) RID_EXTERN
])
9292 else if (storage
== ridpointers
[(int) RID_STATIC
])
9296 cp_error ("storage class `%D' applied to template instantiation",
9302 if (CLASSTYPE_TEMPLATE_SPECIALIZATION (t
))
9306 No program shall both explicitly instantiate and explicitly
9307 specialize a template. */
9308 cp_error ("explicit instantiation of `%#T' after", t
);
9309 cp_error_at ("explicit specialization here", t
);
9312 else if (CLASSTYPE_EXPLICIT_INSTANTIATION (t
))
9316 No program shall explicitly instantiate any template more
9319 If CLASSTYPE_INTERFACE_ONLY, then the first explicit instantiation
9320 was `extern'. If EXTERN_P then the second is. If -frepo, chances
9321 are we already got marked as an explicit instantion because of the
9322 repo file. All these cases are OK. */
9323 if (!CLASSTYPE_INTERFACE_ONLY (t
) && !extern_p
&& !flag_use_repository
)
9324 cp_pedwarn ("duplicate explicit instantiation of `%#T'", t
);
9326 /* If we've already instantiated the template, just return now. */
9327 if (!CLASSTYPE_INTERFACE_ONLY (t
))
9331 mark_class_instantiated (t
, extern_p
);
9332 repo_template_instantiated (t
, extern_p
);
9340 /* In contrast to implicit instantiation, where only the
9341 declarations, and not the definitions, of members are
9342 instantiated, we have here:
9346 The explicit instantiation of a class template specialization
9347 implies the instantiation of all of its members not
9348 previously explicitly specialized in the translation unit
9349 containing the explicit instantiation.
9351 Of course, we can't instantiate member template classes, since
9352 we don't have any arguments for them. Note that the standard
9353 is unclear on whether the instatiation of the members are
9354 *explicit* instantiations or not. We choose to be generous,
9355 and not set DECL_EXPLICIT_INSTANTIATION. Therefore, we allow
9356 the explicit instantiation of a class where some of the members
9357 have no definition in the current translation unit. */
9360 for (tmp
= TYPE_METHODS (t
); tmp
; tmp
= TREE_CHAIN (tmp
))
9361 if (TREE_CODE (tmp
) == FUNCTION_DECL
9362 && DECL_TEMPLATE_INSTANTIATION (tmp
))
9364 mark_decl_instantiated (tmp
, extern_p
);
9365 repo_template_instantiated (tmp
, extern_p
);
9367 instantiate_decl (tmp
, /*defer_ok=*/1);
9370 for (tmp
= TYPE_FIELDS (t
); tmp
; tmp
= TREE_CHAIN (tmp
))
9371 if (TREE_CODE (tmp
) == VAR_DECL
&& DECL_TEMPLATE_INSTANTIATION (tmp
))
9373 mark_decl_instantiated (tmp
, extern_p
);
9374 repo_template_instantiated (tmp
, extern_p
);
9376 instantiate_decl (tmp
, /*defer_ok=*/1);
9379 for (tmp
= CLASSTYPE_TAGS (t
); tmp
; tmp
= TREE_CHAIN (tmp
))
9380 if (IS_AGGR_TYPE (TREE_VALUE (tmp
))
9381 && !uses_template_parms (CLASSTYPE_TI_ARGS (TREE_VALUE (tmp
))))
9382 do_type_instantiation (TYPE_MAIN_DECL (TREE_VALUE (tmp
)), storage
);
9386 /* Given a function DECL, which is a specialization of TMPL, modify
9387 DECL to be a re-instantiation of TMPL with the same template
9388 arguments. TMPL should be the template into which tsubst'ing
9389 should occur for DECL, not the most general template.
9391 One reason for doing this is a scenario like this:
9394 void f(const T&, int i);
9396 void g() { f(3, 7); }
9399 void f(const T& t, const int i) { }
9401 Note that when the template is first instantiated, with
9402 instantiate_template, the resulting DECL will have no name for the
9403 first parameter, and the wrong type for the second. So, when we go
9404 to instantiate the DECL, we regenerate it. */
9407 regenerate_decl_from_template (decl
, tmpl
)
9411 /* The most general version of TMPL. */
9413 /* The arguments used to instantiate DECL, from the most general
9420 args
= DECL_TI_ARGS (decl
);
9421 code_pattern
= DECL_TEMPLATE_RESULT (tmpl
);
9423 /* Unregister the specialization so that when we tsubst we will not
9424 just return DECL. We don't have to unregister DECL from TMPL
9425 because if would only be registered there if it were a partial
9426 instantiation of a specialization, which it isn't: it's a full
9428 gen_tmpl
= most_general_template (tmpl
);
9429 unregistered
= unregister_specialization (decl
, gen_tmpl
);
9431 /* If the DECL was not unregistered then something peculiar is
9432 happening: we created a specialization but did not call
9433 register_specialization for it. */
9434 my_friendly_assert (unregistered
, 0);
9436 if (TREE_CODE (decl
) == VAR_DECL
)
9437 /* Make sure that we can see identifiers, and compute access
9438 correctly, for the class members used in the declaration of
9439 this static variable. */
9440 pushclass (DECL_CONTEXT (decl
), 2);
9442 /* Do the substitution to get the new declaration. */
9443 new_decl
= tsubst (code_pattern
, args
, /*complain=*/1, NULL_TREE
);
9445 if (TREE_CODE (decl
) == VAR_DECL
)
9447 /* Set up DECL_INITIAL, since tsubst doesn't. */
9448 DECL_INITIAL (new_decl
) =
9449 tsubst_expr (DECL_INITIAL (code_pattern
), args
,
9450 /*complain=*/1, DECL_TI_TEMPLATE (decl
));
9451 /* Pop the class context we pushed above. */
9454 else if (TREE_CODE (decl
) == FUNCTION_DECL
)
9456 /* Convince duplicate_decls to use the DECL_ARGUMENTS from the
9458 DECL_INITIAL (new_decl
) = error_mark_node
;
9459 /* And don't complain about a duplicate definition. */
9460 DECL_INITIAL (decl
) = NULL_TREE
;
9463 /* The immediate parent of the new template is still whatever it was
9464 before, even though tsubst sets DECL_TI_TEMPLATE up as the most
9465 general template. We also reset the DECL_ASSEMBLER_NAME since
9466 tsubst always calculates the name as if the function in question
9467 were really a template instance, and sometimes, with friend
9468 functions, this is not so. See tsubst_friend_function for
9470 DECL_TI_TEMPLATE (new_decl
) = DECL_TI_TEMPLATE (decl
);
9471 DECL_ASSEMBLER_NAME (new_decl
) = DECL_ASSEMBLER_NAME (decl
);
9472 DECL_RTL (new_decl
) = DECL_RTL (decl
);
9473 DECL_USE_TEMPLATE (new_decl
) = DECL_USE_TEMPLATE (decl
);
9475 /* Call duplicate decls to merge the old and new declarations. */
9476 duplicate_decls (new_decl
, decl
);
9478 /* Now, re-register the specialization. */
9479 register_specialization (decl
, gen_tmpl
, args
);
9482 /* Produce the definition of D, a _DECL generated from a template. If
9483 DEFER_OK is non-zero, then we don't have to actually do the
9484 instantiation now; we just have to do it sometime. */
9487 instantiate_decl (d
, defer_ok
)
9491 tree tmpl
= DECL_TI_TEMPLATE (d
);
9492 tree args
= DECL_TI_ARGS (d
);
9497 int pattern_defined
;
9499 const char *file
= input_filename
;
9501 /* This function should only be used to instantiate templates for
9502 functions and static member variables. */
9503 my_friendly_assert (TREE_CODE (d
) == FUNCTION_DECL
9504 || TREE_CODE (d
) == VAR_DECL
, 0);
9506 /* Don't instantiate cloned functions. Instead, instantiate the
9507 functions they cloned. */
9508 if (TREE_CODE (d
) == FUNCTION_DECL
&& DECL_CLONED_FUNCTION_P (d
))
9509 d
= DECL_CLONED_FUNCTION (d
);
9511 if (DECL_TEMPLATE_INSTANTIATED (d
))
9512 /* D has already been instantiated. It might seem reasonable to
9513 check whether or not D is an explict instantiation, and, if so,
9514 stop here. But when an explicit instantiation is deferred
9515 until the end of the compilation, DECL_EXPLICIT_INSTANTIATION
9516 is set, even though we still need to do the instantiation. */
9519 /* If we already have a specialization of this declaration, then
9520 there's no reason to instantiate it. Note that
9521 retrieve_specialization gives us both instantiations and
9522 specializations, so we must explicitly check
9523 DECL_TEMPLATE_SPECIALIZATION. */
9524 gen_tmpl
= most_general_template (tmpl
);
9525 spec
= retrieve_specialization (gen_tmpl
, args
);
9526 if (spec
!= NULL_TREE
&& DECL_TEMPLATE_SPECIALIZATION (spec
))
9529 /* This needs to happen before any tsubsting. */
9530 if (! push_tinst_level (d
))
9533 /* Set TD to the template whose DECL_TEMPLATE_RESULT is the pattern
9534 for the instantiation. This is not always the most general
9535 template. Consider, for example:
9538 struct S { template <class U> void f();
9539 template <> void f<int>(); };
9541 and an instantiation of S<double>::f<int>. We want TD to be the
9542 specialization S<T>::f<int>, not the more general S<T>::f<U>. */
9544 while (/* An instantiation cannot have a definition, so we need a
9545 more general template. */
9546 DECL_TEMPLATE_INSTANTIATION (td
)
9547 /* We must also deal with friend templates. Given:
9549 template <class T> struct S {
9550 template <class U> friend void f() {};
9553 S<int>::f<U> say, is not an instantiation of S<T>::f<U>,
9554 so far as the language is concerned, but that's still
9555 where we get the pattern for the instantiation from. On
9556 ther hand, if the definition comes outside the class, say:
9558 template <class T> struct S {
9559 template <class U> friend void f();
9561 template <class U> friend void f() {}
9563 we don't need to look any further. That's what the check for
9564 DECL_INITIAL is for. */
9565 || (TREE_CODE (d
) == FUNCTION_DECL
9566 && DECL_FRIEND_PSEUDO_TEMPLATE_INSTANTIATION (td
)
9567 && !DECL_INITIAL (DECL_TEMPLATE_RESULT (td
))))
9569 /* The present template, TD, should not be a definition. If it
9570 were a definition, we should be using it! Note that we
9571 cannot restructure the loop to just keep going until we find
9572 a template with a definition, since that might go too far if
9573 a specialization was declared, but not defined. */
9574 my_friendly_assert (!(TREE_CODE (d
) == VAR_DECL
9575 && !DECL_IN_AGGR_P (DECL_TEMPLATE_RESULT (td
))),
9578 /* Fetch the more general template. */
9579 td
= DECL_TI_TEMPLATE (td
);
9582 code_pattern
= DECL_TEMPLATE_RESULT (td
);
9584 if (TREE_CODE (d
) == FUNCTION_DECL
)
9585 pattern_defined
= (DECL_SAVED_TREE (code_pattern
) != NULL_TREE
);
9587 pattern_defined
= ! DECL_IN_AGGR_P (code_pattern
);
9589 push_to_top_level ();
9590 lineno
= DECL_SOURCE_LINE (d
);
9591 input_filename
= DECL_SOURCE_FILE (d
);
9593 if (pattern_defined
)
9595 repo_template_used (d
);
9597 if (flag_external_templates
&& ! DECL_INTERFACE_KNOWN (d
))
9599 if (flag_alt_external_templates
)
9601 if (interface_unknown
)
9602 warn_if_unknown_interface (d
);
9604 else if (DECL_INTERFACE_KNOWN (code_pattern
))
9606 DECL_INTERFACE_KNOWN (d
) = 1;
9607 DECL_NOT_REALLY_EXTERN (d
) = ! DECL_EXTERNAL (code_pattern
);
9610 warn_if_unknown_interface (code_pattern
);
9614 import_export_decl (d
);
9617 /* Reject all external templates except inline functions. */
9618 if (DECL_INTERFACE_KNOWN (d
)
9619 && ! DECL_NOT_REALLY_EXTERN (d
)
9620 && ! (TREE_CODE (d
) == FUNCTION_DECL
&& DECL_INLINE (d
)))
9623 /* We need to set up DECL_INITIAL regardless of pattern_defined if
9624 the variable is a static const initialized in the class body. */
9625 if (TREE_CODE (d
) == VAR_DECL
9626 && TREE_READONLY (d
)
9627 && DECL_INITIAL (d
) == NULL_TREE
9628 && DECL_INITIAL (code_pattern
) != NULL_TREE
)
9630 /* Defer all other templates, unless we have been explicitly
9631 forbidden from doing so. We restore the source position here
9632 because it's used by add_pending_template. */
9633 else if (! pattern_defined
|| defer_ok
)
9636 input_filename
= file
;
9638 if (at_eof
&& !pattern_defined
9639 && DECL_EXPLICIT_INSTANTIATION (d
))
9642 The definition of a non-exported function template, a
9643 non-exported member function template, or a non-exported
9644 member function or static data member of a class template
9645 shall be present in every translation unit in which it is
9646 explicitly instantiated. */
9647 cp_error ("explicit instantiation of `%D' but no definition available",
9650 add_pending_template (d
);
9654 /* We're now committed to instantiating this template. Mark it as
9655 instantiated so that recursive calls to instantiate_decl do not
9656 try to instantiate it again. */
9657 DECL_TEMPLATE_INSTANTIATED (d
) = 1;
9659 /* Regenerate the declaration in case the template has been modified
9660 by a subsequent redeclaration. */
9661 regenerate_decl_from_template (d
, td
);
9663 /* We already set the file and line above. Reset them now in case
9664 they changed as a result of calling regenerate_decl_from_template. */
9665 lineno
= DECL_SOURCE_LINE (d
);
9666 input_filename
= DECL_SOURCE_FILE (d
);
9668 if (TREE_CODE (d
) == VAR_DECL
)
9670 DECL_IN_AGGR_P (d
) = 0;
9671 if (DECL_INTERFACE_KNOWN (d
))
9672 DECL_EXTERNAL (d
) = ! DECL_NOT_REALLY_EXTERN (d
);
9675 DECL_EXTERNAL (d
) = 1;
9676 DECL_NOT_REALLY_EXTERN (d
) = 1;
9678 cp_finish_decl (d
, DECL_INITIAL (d
), NULL_TREE
, 0);
9680 else if (TREE_CODE (d
) == FUNCTION_DECL
)
9682 htab_t saved_local_specializations
;
9684 /* Save away the current list, in case we are instantiating one
9685 template from within the body of another. */
9686 saved_local_specializations
= local_specializations
;
9688 /* Set up the list of local specializations. */
9689 local_specializations
= htab_create (37,
9694 /* Set up context. */
9695 start_function (NULL_TREE
, d
, NULL_TREE
, SF_PRE_PARSED
);
9696 store_parm_decls ();
9698 /* We already set up __FUNCTION__, etc., so we don't want to do
9700 current_function_name_declared
= 1;
9702 /* Substitute into the body of the function. */
9703 tsubst_expr (DECL_SAVED_TREE (code_pattern
), args
,
9704 /*complain=*/1, tmpl
);
9706 /* We don't need the local specializations any more. */
9707 htab_delete (local_specializations
);
9708 local_specializations
= saved_local_specializations
;
9710 /* Finish the function. */
9711 expand_body (finish_function (0));
9714 /* We're not deferring instantiation any more. */
9715 TI_PENDING_TEMPLATE_FLAG (DECL_TEMPLATE_INFO (d
)) = 0;
9719 input_filename
= file
;
9721 pop_from_top_level ();
9727 /* Run through the list of templates that we wish we could
9728 instantiate, and instantiate any we can. */
9731 instantiate_pending_templates ()
9734 int instantiated_something
= 0;
9741 t
= &pending_templates
;
9744 tree instantiation
= TREE_VALUE (*t
);
9746 reopen_tinst_level (TREE_PURPOSE (*t
));
9748 if (TYPE_P (instantiation
))
9752 if (!COMPLETE_TYPE_P (instantiation
))
9754 instantiate_class_template (instantiation
);
9755 if (CLASSTYPE_TEMPLATE_INSTANTIATION (instantiation
))
9756 for (fn
= TYPE_METHODS (instantiation
);
9758 fn
= TREE_CHAIN (fn
))
9759 if (! DECL_ARTIFICIAL (fn
))
9760 instantiate_decl (fn
, /*defer_ok=*/0);
9761 if (COMPLETE_TYPE_P (instantiation
))
9763 instantiated_something
= 1;
9768 if (COMPLETE_TYPE_P (instantiation
))
9769 /* If INSTANTIATION has been instantiated, then we don't
9770 need to consider it again in the future. */
9771 *t
= TREE_CHAIN (*t
);
9773 t
= &TREE_CHAIN (*t
);
9777 if (!DECL_TEMPLATE_SPECIALIZATION (instantiation
)
9778 && !DECL_TEMPLATE_INSTANTIATED (instantiation
))
9780 instantiation
= instantiate_decl (instantiation
,
9782 if (DECL_TEMPLATE_INSTANTIATED (instantiation
))
9784 instantiated_something
= 1;
9789 if (DECL_TEMPLATE_SPECIALIZATION (instantiation
)
9790 || DECL_TEMPLATE_INSTANTIATED (instantiation
))
9791 /* If INSTANTIATION has been instantiated, then we don't
9792 need to consider it again in the future. */
9793 *t
= TREE_CHAIN (*t
);
9795 t
= &TREE_CHAIN (*t
);
9800 /* Go through the things that are template instantiations if we are
9801 using guiding declarations. */
9802 t
= &maybe_templates
;
9809 fn
= TREE_VALUE (*t
);
9811 if (DECL_INITIAL (fn
))
9812 /* If the FN is already defined, then it was either already
9813 instantiated or, even though guiding declarations were
9814 allowed, a non-template definition was provided. */
9818 template = TREE_PURPOSE (*t
);
9819 args
= get_bindings (template, fn
, NULL_TREE
);
9820 fn
= instantiate_template (template, args
);
9821 instantiate_decl (fn
, /*defer_ok=*/0);
9825 /* Remove this entry from the chain. */
9826 *t
= TREE_CHAIN (*t
);
9828 maybe_template_tail
= t
;
9832 return instantiated_something
;
9835 /* Substitute ARGVEC into T, which is a TREE_LIST. In particular, it
9836 is an initializer list: the TREE_PURPOSEs are DECLs, and the
9837 TREE_VALUEs are initializer values. Used by instantiate_decl. */
9840 tsubst_expr_values (t
, argvec
)
9843 tree first
= NULL_TREE
;
9846 for (; t
; t
= TREE_CHAIN (t
))
9848 tree pur
= tsubst_copy (TREE_PURPOSE (t
), argvec
,
9849 /*complain=*/1, NULL_TREE
);
9850 tree val
= tsubst_expr (TREE_VALUE (t
), argvec
, /*complain=*/1,
9852 *p
= build_tree_list (pur
, val
);
9853 p
= &TREE_CHAIN (*p
);
9858 /* D is an undefined function declaration in the presence of templates with
9859 the same name, listed in FNS. If one of them can produce D as an
9860 instantiation, remember this so we can instantiate it at EOF if D has
9861 not been defined by that time. */
9864 add_maybe_template (d
, fns
)
9869 if (DECL_MAYBE_TEMPLATE (d
))
9872 t
= most_specialized (fns
, d
, NULL_TREE
);
9875 if (t
== error_mark_node
)
9877 cp_error ("ambiguous template instantiation for `%D'", d
);
9881 *maybe_template_tail
= tree_cons (t
, d
, NULL_TREE
);
9882 maybe_template_tail
= &TREE_CHAIN (*maybe_template_tail
);
9883 DECL_MAYBE_TEMPLATE (d
) = 1;
9886 /* Set CURRENT_ACCESS_SPECIFIER based on the protection of DECL. */
9889 set_current_access_from_decl (decl
)
9892 if (TREE_PRIVATE (decl
))
9893 current_access_specifier
= access_private_node
;
9894 else if (TREE_PROTECTED (decl
))
9895 current_access_specifier
= access_protected_node
;
9897 current_access_specifier
= access_public_node
;
9900 /* Instantiate an enumerated type. TAG is the template type, NEWTAG
9901 is the instantiation (which should have been created with
9902 start_enum) and ARGS are the template arguments to use. */
9905 tsubst_enum (tag
, newtag
, args
)
9912 for (e
= TYPE_VALUES (tag
); e
; e
= TREE_CHAIN (e
))
9916 /* Note that in a template enum, the TREE_VALUE is the
9917 CONST_DECL, not the corresponding INTEGER_CST. */
9918 value
= tsubst_expr (DECL_INITIAL (TREE_VALUE (e
)),
9919 args
, /*complain=*/1,
9922 /* Give this enumeration constant the correct access. */
9923 set_current_access_from_decl (TREE_VALUE (e
));
9925 /* Actually build the enumerator itself. */
9926 build_enumerator (TREE_PURPOSE (e
), value
, newtag
);
9929 finish_enum (newtag
);
9932 /* DECL is a FUNCTION_DECL that is a template specialization. Return
9933 its type -- but without substituting the innermost set of template
9934 arguments. So, innermost set of template parameters will appear in
9935 the type. If CONTEXTP is non-NULL, then the partially substituted
9936 DECL_CONTEXT (if any) will also be filled in. Similarly, TPARMSP
9937 will be filled in with the substituted template parameters, if it
9941 get_mostly_instantiated_function_type (decl
, contextp
, tparmsp
)
9946 tree context
= NULL_TREE
;
9953 tmpl
= most_general_template (DECL_TI_TEMPLATE (decl
));
9954 targs
= DECL_TI_ARGS (decl
);
9955 tparms
= DECL_TEMPLATE_PARMS (tmpl
);
9956 parm_depth
= TMPL_PARMS_DEPTH (tparms
);
9958 /* There should be as many levels of arguments as there are levels
9960 my_friendly_assert (parm_depth
== TMPL_ARGS_DEPTH (targs
), 0);
9962 fn_type
= TREE_TYPE (tmpl
);
9963 if (DECL_STATIC_FUNCTION_P (decl
))
9964 context
= DECL_CONTEXT (decl
);
9966 if (parm_depth
== 1)
9967 /* No substitution is necessary. */
9974 /* Replace the innermost level of the TARGS with NULL_TREEs to
9975 let tsubst know not to subsitute for those parameters. */
9976 partial_args
= make_tree_vec (TREE_VEC_LENGTH (targs
));
9977 for (i
= 1; i
< TMPL_ARGS_DEPTH (targs
); ++i
)
9978 SET_TMPL_ARGS_LEVEL (partial_args
, i
,
9979 TMPL_ARGS_LEVEL (targs
, i
));
9980 SET_TMPL_ARGS_LEVEL (partial_args
,
9981 TMPL_ARGS_DEPTH (targs
),
9982 make_tree_vec (DECL_NTPARMS (tmpl
)));
9984 /* Now, do the (partial) substitution to figure out the
9985 appropriate function type. */
9986 fn_type
= tsubst (fn_type
, partial_args
, /*complain=*/1, NULL_TREE
);
9987 if (DECL_STATIC_FUNCTION_P (decl
))
9988 context
= tsubst (context
, partial_args
, /*complain=*/1, NULL_TREE
);
9990 /* Substitute into the template parameters to obtain the real
9991 innermost set of parameters. This step is important if the
9992 innermost set of template parameters contains value
9993 parameters whose types depend on outer template parameters. */
9994 TREE_VEC_LENGTH (partial_args
)--;
9995 tparms
= tsubst_template_parms (tparms
, partial_args
, /*complain=*/1);
9999 *contextp
= context
;
10006 /* Set the DECL_ASSEMBLER_NAME for DECL, which is a FUNCTION_DECL that
10007 is either an instantiation or specialization of a template
10011 set_mangled_name_for_template_decl (decl
)
10014 tree context
= NULL_TREE
;
10021 my_friendly_assert (TREE_CODE (decl
) == FUNCTION_DECL
, 0);
10022 my_friendly_assert (DECL_TEMPLATE_INFO (decl
) != NULL_TREE
, 0);
10024 /* Under the new ABI, we don't need special machinery. */
10027 set_mangled_name_for_decl (decl
);
10031 /* The names of template functions must be mangled so as to indicate
10032 what template is being specialized with what template arguments.
10033 For example, each of the following three functions must get
10034 different mangled names:
10037 template <> void f<7>(int);
10038 template <> void f<8>(int); */
10040 targs
= DECL_TI_ARGS (decl
);
10041 if (uses_template_parms (targs
))
10042 /* This DECL is for a partial instantiation. There's no need to
10043 mangle the name of such an entity. */
10046 /* We now compute the PARMS and RET_TYPE to give to
10047 build_decl_overload_real. The PARMS and RET_TYPE are the
10048 parameter and return types of the template, after all but the
10049 innermost template arguments have been substituted, not the
10050 parameter and return types of the function DECL. For example,
10053 template <class T> T f(T);
10055 both PARMS and RET_TYPE should be `T' even if DECL is `int f(int)'.
10056 A more subtle example is:
10058 template <class T> struct S { template <class U> void f(T, U); }
10060 Here, if DECL is `void S<int>::f(int, double)', PARMS should be
10061 {int, U}. Thus, the args that we want to subsitute into the
10062 return and parameter type for the function are those in TARGS,
10063 with the innermost level omitted. */
10064 fn_type
= get_mostly_instantiated_function_type (decl
, &context
, &tparms
);
10066 /* Now, get the innermost parameters and arguments, and figure out
10067 the parameter and return types. */
10068 tparms
= INNERMOST_TEMPLATE_PARMS (tparms
);
10069 targs
= INNERMOST_TEMPLATE_ARGS (targs
);
10070 ret_type
= TREE_TYPE (fn_type
);
10071 parm_types
= TYPE_ARG_TYPES (fn_type
);
10073 /* For a static member function, we generate a fake `this' pointer,
10074 for the purposes of mangling. This indicates of which class the
10075 function is a member. Because of:
10079 There shall not be a static and a nonstatic member function
10080 with the same name and the same parameter types
10082 we don't have to worry that this will result in a clash with a
10083 non-static member function. */
10084 if (DECL_STATIC_FUNCTION_P (decl
))
10085 parm_types
= hash_tree_chain (build_pointer_type (context
), parm_types
);
10087 /* There should be the same number of template parameters as
10088 template arguments. */
10089 my_friendly_assert (TREE_VEC_LENGTH (tparms
) == TREE_VEC_LENGTH (targs
),
10092 /* Actually set the DECL_ASSEMBLER_NAME. */
10093 DECL_ASSEMBLER_NAME (decl
)
10094 = build_decl_overload_real (decl
, parm_types
, ret_type
,
10096 DECL_FUNCTION_MEMBER_P (decl
)
10097 + DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (decl
));