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". */
49 /* The type of functions taking a tree, and some additional data, and
51 typedef int (*tree_fn_t
) PARAMS ((tree
, void*));
53 extern struct obstack permanent_obstack
;
55 /* The PENDING_TEMPLATES is a TREE_LIST of templates whose
56 instantiations have been deferred, either because their definitions
57 were not yet available, or because we were putting off doing the
58 work. The TREE_PURPOSE of each entry is a SRCLOC indicating where
59 the instantiate request occurred; the TREE_VALUE is a either a DECL
60 (for a function or static data member), or a TYPE (for a class)
61 indicating what we are hoping to instantiate. */
62 static tree pending_templates
;
63 static tree
*template_tail
= &pending_templates
;
65 static tree maybe_templates
;
66 static tree
*maybe_template_tail
= &maybe_templates
;
68 int processing_template_parmlist
;
69 static int template_header_count
;
71 static tree saved_trees
;
72 static varray_type inline_parm_levels
;
73 static size_t inline_parm_levels_used
;
75 static tree current_tinst_level
;
77 /* A map from local variable declarations in the body of the template
78 presently being instantiated to the corresponding instantiated
80 static htab_t local_specializations
;
82 #define obstack_chunk_alloc xmalloc
83 #define obstack_chunk_free free
85 #define UNIFY_ALLOW_NONE 0
86 #define UNIFY_ALLOW_MORE_CV_QUAL 1
87 #define UNIFY_ALLOW_LESS_CV_QUAL 2
88 #define UNIFY_ALLOW_DERIVED 4
89 #define UNIFY_ALLOW_INTEGER 8
91 #define GTB_VIA_VIRTUAL 1 /* The base class we are examining is
92 virtual, or a base class of a virtual
94 #define GTB_IGNORE_TYPE 2 /* We don't need to try to unify the current
95 type with the desired type. */
97 static int resolve_overloaded_unification
PARAMS ((tree
, tree
, tree
, tree
,
98 unification_kind_t
, int));
99 static int try_one_overload
PARAMS ((tree
, tree
, tree
, tree
, tree
,
100 unification_kind_t
, int));
101 static int unify
PARAMS ((tree
, tree
, tree
, tree
, int));
102 static void add_pending_template
PARAMS ((tree
));
103 static int push_tinst_level
PARAMS ((tree
));
104 static void reopen_tinst_level
PARAMS ((tree
));
105 static tree classtype_mangled_name
PARAMS ((tree
));
106 static char *mangle_class_name_for_template
PARAMS ((const char *, tree
, tree
));
107 static tree tsubst_initializer_list
PARAMS ((tree
, tree
));
108 static int list_eq
PARAMS ((tree
, tree
));
109 static tree get_class_bindings
PARAMS ((tree
, tree
, tree
));
110 static tree coerce_template_parms
PARAMS ((tree
, tree
, tree
, int, int));
111 static void tsubst_enum
PARAMS ((tree
, tree
, tree
));
112 static tree add_to_template_args
PARAMS ((tree
, tree
));
113 static tree add_outermost_template_args
PARAMS ((tree
, tree
));
114 static void maybe_adjust_types_for_deduction
PARAMS ((unification_kind_t
, tree
*,
116 static int type_unification_real
PARAMS ((tree
, tree
, tree
, tree
,
117 int, unification_kind_t
, int));
118 static void note_template_header
PARAMS ((int));
119 static tree maybe_fold_nontype_arg
PARAMS ((tree
));
120 static tree convert_nontype_argument
PARAMS ((tree
, tree
));
121 static tree convert_template_argument
PARAMS ((tree
, tree
, tree
, int,
123 static tree get_bindings_overload
PARAMS ((tree
, tree
, tree
));
124 static int for_each_template_parm
PARAMS ((tree
, tree_fn_t
, void*));
125 static tree build_template_parm_index
PARAMS ((int, int, int, tree
, tree
));
126 static int inline_needs_template_parms
PARAMS ((tree
));
127 static void push_inline_template_parms_recursive
PARAMS ((tree
, int));
128 static tree retrieve_specialization
PARAMS ((tree
, tree
));
129 static tree retrieve_local_specialization
PARAMS ((tree
));
130 static tree register_specialization
PARAMS ((tree
, tree
, tree
));
131 static tree register_local_specialization
PARAMS ((tree
, tree
));
132 static int unregister_specialization
PARAMS ((tree
, tree
));
133 static tree reduce_template_parm_level
PARAMS ((tree
, tree
, int));
134 static tree build_template_decl
PARAMS ((tree
, tree
));
135 static int mark_template_parm
PARAMS ((tree
, void *));
136 static tree tsubst_friend_function
PARAMS ((tree
, tree
));
137 static tree tsubst_friend_class
PARAMS ((tree
, tree
));
138 static tree get_bindings_real
PARAMS ((tree
, tree
, tree
, int));
139 static int template_decl_level
PARAMS ((tree
));
140 static tree maybe_get_template_decl_from_type_decl
PARAMS ((tree
));
141 static int check_cv_quals_for_unify
PARAMS ((int, tree
, tree
));
142 static tree tsubst_template_arg_vector
PARAMS ((tree
, tree
, int));
143 static tree tsubst_template_parms
PARAMS ((tree
, tree
, int));
144 static void regenerate_decl_from_template
PARAMS ((tree
, tree
));
145 static tree most_specialized
PARAMS ((tree
, tree
, tree
));
146 static tree most_specialized_class
PARAMS ((tree
, tree
));
147 static void set_mangled_name_for_template_decl
PARAMS ((tree
));
148 static int template_class_depth_real
PARAMS ((tree
, int));
149 static tree tsubst_aggr_type
PARAMS ((tree
, tree
, int, tree
, int));
150 static tree tsubst_decl
PARAMS ((tree
, tree
, tree
, tree
));
151 static tree tsubst_arg_types
PARAMS ((tree
, tree
, int, tree
));
152 static tree tsubst_function_type
PARAMS ((tree
, tree
, int, tree
));
153 static void check_specialization_scope
PARAMS ((void));
154 static tree process_partial_specialization
PARAMS ((tree
));
155 static void set_current_access_from_decl
PARAMS ((tree
));
156 static void check_default_tmpl_args
PARAMS ((tree
, tree
, int, int));
157 static tree tsubst_call_declarator_parms
PARAMS ((tree
, tree
, int, tree
));
158 static tree get_template_base_recursive
PARAMS ((tree
, tree
,
159 tree
, tree
, tree
, int));
160 static tree get_template_base
PARAMS ((tree
, tree
, tree
, tree
));
161 static tree try_class_unification
PARAMS ((tree
, tree
, tree
, tree
));
162 static int coerce_template_template_parms
PARAMS ((tree
, tree
, int,
164 static tree determine_specialization
PARAMS ((tree
, tree
, tree
*, int));
165 static int template_args_equal
PARAMS ((tree
, tree
));
166 static void tsubst_default_arguments
PARAMS ((tree
));
167 static tree for_each_template_parm_r
PARAMS ((tree
*, int *, void *));
168 static tree instantiate_clone
PARAMS ((tree
, tree
));
170 /* Called once to initialize pt.c. */
175 ggc_add_tree_root (&pending_templates
, 1);
176 ggc_add_tree_root (&maybe_templates
, 1);
177 ggc_add_tree_root (&saved_trees
, 1);
178 ggc_add_tree_root (¤t_tinst_level
, 1);
181 /* Do any processing required when DECL (a member template declaration
182 using TEMPLATE_PARAMETERS as its innermost parameter list) is
183 finished. Returns the TEMPLATE_DECL corresponding to DECL, unless
184 it is a specialization, in which case the DECL itself is returned. */
187 finish_member_template_decl (decl
)
190 if (decl
== NULL_TREE
|| decl
== void_type_node
)
192 else if (decl
== error_mark_node
)
193 /* By returning NULL_TREE, the parser will just ignore this
194 declaration. We have already issued the error. */
196 else if (TREE_CODE (decl
) == TREE_LIST
)
198 /* Assume that the class is the only declspec. */
199 decl
= TREE_VALUE (decl
);
200 if (IS_AGGR_TYPE (decl
) && CLASSTYPE_TEMPLATE_INFO (decl
)
201 && ! CLASSTYPE_TEMPLATE_SPECIALIZATION (decl
))
203 tree tmpl
= CLASSTYPE_TI_TEMPLATE (decl
);
204 check_member_template (tmpl
);
209 else if (TREE_CODE (decl
) == FIELD_DECL
)
210 cp_error ("data member `%D' cannot be a member template", decl
);
211 else if (DECL_TEMPLATE_INFO (decl
))
213 if (!DECL_TEMPLATE_SPECIALIZATION (decl
))
215 check_member_template (DECL_TI_TEMPLATE (decl
));
216 return DECL_TI_TEMPLATE (decl
);
222 cp_error ("invalid member template declaration `%D'", decl
);
224 return error_mark_node
;
227 /* Returns the template nesting level of the indicated class TYPE.
237 A<T>::B<U> has depth two, while A<T> has depth one.
238 Both A<T>::B<int> and A<int>::B<U> have depth one, if
239 COUNT_SPECIALIZATIONS is 0 or if they are instantiations, not
242 This function is guaranteed to return 0 if passed NULL_TREE so
243 that, for example, `template_class_depth (current_class_type)' is
247 template_class_depth_real (type
, count_specializations
)
249 int count_specializations
;
254 type
&& TREE_CODE (type
) != NAMESPACE_DECL
;
255 type
= (TREE_CODE (type
) == FUNCTION_DECL
)
256 ? CP_DECL_CONTEXT (type
) : TYPE_CONTEXT (type
))
258 if (TREE_CODE (type
) != FUNCTION_DECL
)
260 if (CLASSTYPE_TEMPLATE_INFO (type
)
261 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (type
))
262 && ((count_specializations
263 && CLASSTYPE_TEMPLATE_SPECIALIZATION (type
))
264 || uses_template_parms (CLASSTYPE_TI_ARGS (type
))))
269 if (DECL_TEMPLATE_INFO (type
)
270 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (type
))
271 && ((count_specializations
272 && DECL_TEMPLATE_SPECIALIZATION (type
))
273 || uses_template_parms (DECL_TI_ARGS (type
))))
281 /* Returns the template nesting level of the indicated class TYPE.
282 Like template_class_depth_real, but instantiations do not count in
286 template_class_depth (type
)
289 return template_class_depth_real (type
, /*count_specializations=*/0);
292 /* Returns 1 if processing DECL as part of do_pending_inlines
293 needs us to push template parms. */
296 inline_needs_template_parms (decl
)
299 if (! DECL_TEMPLATE_INFO (decl
))
302 return (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (most_general_template (decl
)))
303 > (processing_template_decl
+ DECL_TEMPLATE_SPECIALIZATION (decl
)));
306 /* Subroutine of maybe_begin_member_template_processing.
307 Push the template parms in PARMS, starting from LEVELS steps into the
308 chain, and ending at the beginning, since template parms are listed
312 push_inline_template_parms_recursive (parmlist
, levels
)
316 tree parms
= TREE_VALUE (parmlist
);
320 push_inline_template_parms_recursive (TREE_CHAIN (parmlist
), levels
- 1);
322 ++processing_template_decl
;
323 current_template_parms
324 = tree_cons (build_int_2 (0, processing_template_decl
),
325 parms
, current_template_parms
);
326 TEMPLATE_PARMS_FOR_INLINE (current_template_parms
) = 1;
329 for (i
= 0; i
< TREE_VEC_LENGTH (parms
); ++i
)
331 tree parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
332 my_friendly_assert (DECL_P (parm
), 0);
334 switch (TREE_CODE (parm
))
343 /* Make a CONST_DECL as is done in process_template_parm.
344 It is ugly that we recreate this here; the original
345 version built in process_template_parm is no longer
347 tree decl
= build_decl (CONST_DECL
, DECL_NAME (parm
),
349 DECL_ARTIFICIAL (decl
) = 1;
350 DECL_INITIAL (decl
) = DECL_INITIAL (parm
);
351 SET_DECL_TEMPLATE_PARM_P (decl
);
357 my_friendly_abort (0);
362 /* Restore the template parameter context for a member template or
363 a friend template defined in a class definition. */
366 maybe_begin_member_template_processing (decl
)
372 if (inline_needs_template_parms (decl
))
374 parms
= DECL_TEMPLATE_PARMS (most_general_template (decl
));
375 levels
= TMPL_PARMS_DEPTH (parms
) - processing_template_decl
;
377 if (DECL_TEMPLATE_SPECIALIZATION (decl
))
380 parms
= TREE_CHAIN (parms
);
383 push_inline_template_parms_recursive (parms
, levels
);
386 /* Remember how many levels of template parameters we pushed so that
387 we can pop them later. */
388 if (!inline_parm_levels
)
389 VARRAY_INT_INIT (inline_parm_levels
, 4, "inline_parm_levels");
390 if (inline_parm_levels_used
== inline_parm_levels
->num_elements
)
391 VARRAY_GROW (inline_parm_levels
, 2 * inline_parm_levels_used
);
392 VARRAY_INT (inline_parm_levels
, inline_parm_levels_used
) = levels
;
393 ++inline_parm_levels_used
;
396 /* Undo the effects of begin_member_template_processing. */
399 maybe_end_member_template_processing ()
403 if (!inline_parm_levels_used
)
406 --inline_parm_levels_used
;
408 i
< VARRAY_INT (inline_parm_levels
, inline_parm_levels_used
);
411 --processing_template_decl
;
412 current_template_parms
= TREE_CHAIN (current_template_parms
);
417 /* Returns non-zero iff T is a member template function. We must be
420 template <class T> class C { void f(); }
422 Here, f is a template function, and a member, but not a member
423 template. This function does not concern itself with the origin of
424 T, only its present state. So if we have
426 template <class T> class C { template <class U> void f(U); }
428 then neither C<int>::f<char> nor C<T>::f<double> is considered
429 to be a member template. But, `template <class U> void
430 C<int>::f(U)' is considered a member template. */
433 is_member_template (t
)
436 if (!DECL_FUNCTION_TEMPLATE_P (t
))
437 /* Anything that isn't a function or a template function is
438 certainly not a member template. */
441 /* A local class can't have member templates. */
442 if (decl_function_context (t
))
445 return (DECL_FUNCTION_MEMBER_P (DECL_TEMPLATE_RESULT (t
))
446 /* If there are more levels of template parameters than
447 there are template classes surrounding the declaration,
448 then we have a member template. */
449 && (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (t
)) >
450 template_class_depth (DECL_CONTEXT (t
))));
454 /* Returns non-zero iff T is a member template class. See
455 is_member_template for a description of what precisely constitutes
456 a member template. */
459 is_member_template_class (t
)
462 if (!DECL_CLASS_TEMPLATE_P (t
))
463 /* Anything that isn't a class template, is certainly not a member
467 if (!DECL_CLASS_SCOPE_P (t
))
468 /* Anything whose context isn't a class type is surely not a
472 /* If there are more levels of template parameters than there are
473 template classes surrounding the declaration, then we have a
475 return (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (t
)) >
476 template_class_depth (DECL_CONTEXT (t
)));
480 /* Return a new template argument vector which contains all of ARGS,
481 but has as its innermost set of arguments the EXTRA_ARGS. */
484 add_to_template_args (args
, extra_args
)
493 extra_depth
= TMPL_ARGS_DEPTH (extra_args
);
494 new_args
= make_tree_vec (TMPL_ARGS_DEPTH (args
) + extra_depth
);
496 for (i
= 1; i
<= TMPL_ARGS_DEPTH (args
); ++i
)
497 SET_TMPL_ARGS_LEVEL (new_args
, i
, TMPL_ARGS_LEVEL (args
, i
));
499 for (j
= 1; j
<= extra_depth
; ++j
, ++i
)
500 SET_TMPL_ARGS_LEVEL (new_args
, i
, TMPL_ARGS_LEVEL (extra_args
, j
));
505 /* Like add_to_template_args, but only the outermost ARGS are added to
506 the EXTRA_ARGS. In particular, all but TMPL_ARGS_DEPTH
507 (EXTRA_ARGS) levels are added. This function is used to combine
508 the template arguments from a partial instantiation with the
509 template arguments used to attain the full instantiation from the
510 partial instantiation. */
513 add_outermost_template_args (args
, extra_args
)
519 /* If there are more levels of EXTRA_ARGS than there are ARGS,
520 something very fishy is going on. */
521 my_friendly_assert (TMPL_ARGS_DEPTH (args
) >= TMPL_ARGS_DEPTH (extra_args
),
524 /* If *all* the new arguments will be the EXTRA_ARGS, just return
526 if (TMPL_ARGS_DEPTH (args
) == TMPL_ARGS_DEPTH (extra_args
))
529 /* For the moment, we make ARGS look like it contains fewer levels. */
530 TREE_VEC_LENGTH (args
) -= TMPL_ARGS_DEPTH (extra_args
);
532 new_args
= add_to_template_args (args
, extra_args
);
534 /* Now, we restore ARGS to its full dimensions. */
535 TREE_VEC_LENGTH (args
) += TMPL_ARGS_DEPTH (extra_args
);
540 /* Return the N levels of innermost template arguments from the ARGS. */
543 get_innermost_template_args (args
, n
)
551 my_friendly_assert (n
>= 0, 20000603);
553 /* If N is 1, just return the innermost set of template arguments. */
555 return TMPL_ARGS_LEVEL (args
, TMPL_ARGS_DEPTH (args
));
557 /* If we're not removing anything, just return the arguments we were
559 extra_levels
= TMPL_ARGS_DEPTH (args
) - n
;
560 my_friendly_assert (extra_levels
>= 0, 20000603);
561 if (extra_levels
== 0)
564 /* Make a new set of arguments, not containing the outer arguments. */
565 new_args
= make_tree_vec (n
);
566 for (i
= 1; i
<= n
; ++i
)
567 SET_TMPL_ARGS_LEVEL (new_args
, i
,
568 TMPL_ARGS_LEVEL (args
, i
+ extra_levels
));
573 /* We've got a template header coming up; push to a new level for storing
577 begin_template_parm_list ()
579 /* We use a non-tag-transparent scope here, which causes pushtag to
580 put tags in this scope, rather than in the enclosing class or
581 namespace scope. This is the right thing, since we want
582 TEMPLATE_DECLS, and not TYPE_DECLS for template classes. For a
583 global template class, push_template_decl handles putting the
584 TEMPLATE_DECL into top-level scope. For a nested template class,
587 template <class T> struct S1 {
588 template <class T> struct S2 {};
591 pushtag contains special code to call pushdecl_with_scope on the
592 TEMPLATE_DECL for S2. */
593 begin_scope (sk_template_parms
);
594 ++processing_template_decl
;
595 ++processing_template_parmlist
;
596 note_template_header (0);
599 /* This routine is called when a specialization is declared. If it is
600 illegal to declare a specialization here, an error is reported. */
603 check_specialization_scope ()
605 tree scope
= current_scope ();
609 An explicit specialization shall be declared in the namespace of
610 which the template is a member, or, for member templates, in the
611 namespace of which the enclosing class or enclosing class
612 template is a member. An explicit specialization of a member
613 function, member class or static data member of a class template
614 shall be declared in the namespace of which the class template
616 if (scope
&& TREE_CODE (scope
) != NAMESPACE_DECL
)
617 cp_error ("explicit specialization in non-namespace scope `%D'",
622 In an explicit specialization declaration for a member of a class
623 template or a member template that appears in namespace scope,
624 the member template and some of its enclosing class templates may
625 remain unspecialized, except that the declaration shall not
626 explicitly specialize a class member template if its enclosing
627 class templates are not explicitly specialized as well. */
628 if (current_template_parms
)
629 cp_error ("enclosing class templates are not explicitly specialized");
632 /* We've just seen template <>. */
635 begin_specialization ()
637 begin_scope (sk_template_spec
);
638 note_template_header (1);
639 check_specialization_scope ();
642 /* Called at then end of processing a declaration 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 if (uses_template_parms (declarator
))
1303 cp_error ("partial specialization `%D' of function template",
1306 cp_error ("template-id `%D' in declaration of primary template",
1311 if (ctype
&& CLASSTYPE_TEMPLATE_INSTANTIATION (ctype
))
1312 /* This is a specialization of a member template, without
1313 specialization the containing class. Something like:
1315 template <class T> struct S {
1316 template <class U> void f (U);
1318 template <> template <class U> void S<int>::f(U) {}
1320 That's a specialization -- but of the entire template. */
1325 my_friendly_abort (20000309);
1328 if (specialization
|| member_specialization
)
1330 tree t
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
1331 for (; t
; t
= TREE_CHAIN (t
))
1332 if (TREE_PURPOSE (t
))
1335 ("default argument specified in explicit specialization");
1338 if (current_lang_name
== lang_name_c
)
1339 cp_error ("template specialization with C linkage");
1342 if (specialization
|| member_specialization
|| explicit_instantiation
)
1344 tree tmpl
= NULL_TREE
;
1345 tree targs
= NULL_TREE
;
1347 /* Make sure that the declarator is a TEMPLATE_ID_EXPR. */
1348 if (TREE_CODE (declarator
) != TEMPLATE_ID_EXPR
)
1352 my_friendly_assert (TREE_CODE (declarator
) == IDENTIFIER_NODE
,
1355 fns
= IDENTIFIER_NAMESPACE_VALUE (dname
);
1360 lookup_template_function (fns
, NULL_TREE
);
1363 if (declarator
== error_mark_node
)
1364 return error_mark_node
;
1366 if (ctype
!= NULL_TREE
&& TYPE_BEING_DEFINED (ctype
))
1368 if (!explicit_instantiation
)
1369 /* A specialization in class scope. This is illegal,
1370 but the error will already have been flagged by
1371 check_specialization_scope. */
1372 return error_mark_node
;
1375 /* It's not legal to write an explicit instantiation in
1378 class C { template void f(); }
1380 This case is caught by the parser. However, on
1383 template class C { void f(); };
1385 (which is illegal) we can get here. The error will be
1392 else if (TREE_CODE (TREE_OPERAND (declarator
, 0)) == LOOKUP_EXPR
)
1394 /* A friend declaration. We can't do much, because we don't
1395 know what this resolves to, yet. */
1396 my_friendly_assert (is_friend
!= 0, 0);
1397 my_friendly_assert (!explicit_instantiation
, 0);
1398 SET_DECL_IMPLICIT_INSTANTIATION (decl
);
1401 else if (ctype
!= NULL_TREE
1402 && (TREE_CODE (TREE_OPERAND (declarator
, 0)) ==
1405 /* Find the list of functions in ctype that have the same
1406 name as the declared function. */
1407 tree name
= TREE_OPERAND (declarator
, 0);
1408 tree fns
= NULL_TREE
;
1411 if (name
== constructor_name (ctype
)
1412 || name
== constructor_name_full (ctype
))
1414 int is_constructor
= DECL_CONSTRUCTOR_P (decl
);
1416 if (is_constructor
? !TYPE_HAS_CONSTRUCTOR (ctype
)
1417 : !TYPE_HAS_DESTRUCTOR (ctype
))
1419 /* From [temp.expl.spec]:
1421 If such an explicit specialization for the member
1422 of a class template names an implicitly-declared
1423 special member function (clause _special_), the
1424 program is ill-formed.
1426 Similar language is found in [temp.explicit]. */
1427 cp_error ("specialization of implicitly-declared special member function");
1428 return error_mark_node
;
1431 name
= is_constructor
? ctor_identifier
: dtor_identifier
;
1434 if (!DECL_CONV_FN_P (decl
))
1436 idx
= lookup_fnfields_1 (ctype
, name
);
1438 fns
= TREE_VEC_ELT (CLASSTYPE_METHOD_VEC (ctype
), idx
);
1444 /* For a type-conversion operator, we cannot do a
1445 name-based lookup. We might be looking for `operator
1446 int' which will be a specialization of `operator T'.
1447 So, we find *all* the conversion operators, and then
1448 select from them. */
1451 methods
= CLASSTYPE_METHOD_VEC (ctype
);
1453 for (idx
= 2; idx
< TREE_VEC_LENGTH (methods
); ++idx
)
1455 tree ovl
= TREE_VEC_ELT (methods
, idx
);
1457 if (!ovl
|| !DECL_CONV_FN_P (OVL_CURRENT (ovl
)))
1458 /* There are no more conversion functions. */
1461 /* Glue all these conversion functions together
1462 with those we already have. */
1463 for (; ovl
; ovl
= OVL_NEXT (ovl
))
1464 fns
= ovl_cons (OVL_CURRENT (ovl
), fns
);
1468 if (fns
== NULL_TREE
)
1470 cp_error ("no member function `%D' declared in `%T'",
1472 return error_mark_node
;
1475 TREE_OPERAND (declarator
, 0) = fns
;
1478 /* Figure out what exactly is being specialized at this point.
1479 Note that for an explicit instantiation, even one for a
1480 member function, we cannot tell apriori whether the
1481 instantiation is for a member template, or just a member
1482 function of a template class. Even if a member template is
1483 being instantiated, the member template arguments may be
1484 elided if they can be deduced from the rest of the
1486 tmpl
= determine_specialization (declarator
, decl
,
1488 member_specialization
);
1490 if (!tmpl
|| tmpl
== error_mark_node
)
1491 /* We couldn't figure out what this declaration was
1493 return error_mark_node
;
1496 tree gen_tmpl
= most_general_template (tmpl
);
1498 if (explicit_instantiation
)
1500 /* We don't set DECL_EXPLICIT_INSTANTIATION here; that
1501 is done by do_decl_instantiation later. */
1503 int arg_depth
= TMPL_ARGS_DEPTH (targs
);
1504 int parm_depth
= TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl
));
1506 if (arg_depth
> parm_depth
)
1508 /* If TMPL is not the most general template (for
1509 example, if TMPL is a friend template that is
1510 injected into namespace scope), then there will
1511 be too many levels fo TARGS. Remove some of them
1516 new_targs
= make_tree_vec (parm_depth
);
1517 for (i
= arg_depth
- parm_depth
; i
< arg_depth
; ++i
)
1518 TREE_VEC_ELT (new_targs
, i
- (arg_depth
- parm_depth
))
1519 = TREE_VEC_ELT (targs
, i
);
1523 return instantiate_template (tmpl
, targs
);
1526 /* If this is a specialization of a member template of a
1527 template class. In we want to return the TEMPLATE_DECL,
1528 not the specialization of it. */
1529 if (tsk
== tsk_template
)
1531 SET_DECL_TEMPLATE_SPECIALIZATION (tmpl
);
1532 DECL_INITIAL (DECL_TEMPLATE_RESULT (tmpl
)) = NULL_TREE
;
1536 /* If we though that the DECL was a member function, but it
1537 turns out to be specializing a static member function,
1538 make DECL a static member function as well. */
1539 if (DECL_STATIC_FUNCTION_P (tmpl
)
1540 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
1542 revert_static_member_fn (decl
);
1543 last_function_parms
= TREE_CHAIN (last_function_parms
);
1546 /* Set up the DECL_TEMPLATE_INFO for DECL. */
1547 DECL_TEMPLATE_INFO (decl
) = tree_cons (tmpl
, targs
, NULL_TREE
);
1549 /* Mangle the function name appropriately. Note that we do
1550 not mangle specializations of non-template member
1551 functions of template classes, e.g. with
1553 template <class T> struct S { void f(); }
1555 and given the specialization
1557 template <> void S<int>::f() {}
1559 we do not mangle S<int>::f() here. That's because it's
1560 just an ordinary member function and doesn't need special
1561 treatment. We do this here so that the ordinary,
1562 non-template, name-mangling algorithm will not be used
1564 if ((is_member_template (tmpl
) || ctype
== NULL_TREE
)
1565 && name_mangling_version
>= 1)
1566 set_mangled_name_for_template_decl (decl
);
1568 if (is_friend
&& !have_def
)
1569 /* This is not really a declaration of a specialization.
1570 It's just the name of an instantiation. But, it's not
1571 a request for an instantiation, either. */
1572 SET_DECL_IMPLICIT_INSTANTIATION (decl
);
1574 /* Register this specialization so that we can find it
1576 decl
= register_specialization (decl
, gen_tmpl
, targs
);
1583 /* TYPE is being declared. Verify that the use of template headers
1584 and such is reasonable. Issue error messages if not. */
1587 maybe_check_template_type (type
)
1590 if (template_header_count
)
1592 /* We are in the scope of some `template <...>' header. */
1595 = template_class_depth_real (TYPE_CONTEXT (type
),
1596 /*count_specializations=*/1);
1598 if (template_header_count
<= context_depth
)
1599 /* This is OK; the template headers are for the context. We
1600 are actually too lenient here; like
1601 check_explicit_specialization we should consider the number
1602 of template types included in the actual declaration. For
1605 template <class T> struct S {
1606 template <class U> template <class V>
1612 template <class T> struct S {
1613 template <class U> struct I;
1616 template <class T> template <class U.
1621 else if (template_header_count
> context_depth
+ 1)
1622 /* There are two many template parameter lists. */
1623 cp_error ("too many template parameter lists in declaration of `%T'", type
);
1627 /* Returns 1 iff PARMS1 and PARMS2 are identical sets of template
1628 parameters. These are represented in the same format used for
1629 DECL_TEMPLATE_PARMS. */
1631 int comp_template_parms (parms1
, parms2
)
1638 if (parms1
== parms2
)
1641 for (p1
= parms1
, p2
= parms2
;
1642 p1
!= NULL_TREE
&& p2
!= NULL_TREE
;
1643 p1
= TREE_CHAIN (p1
), p2
= TREE_CHAIN (p2
))
1645 tree t1
= TREE_VALUE (p1
);
1646 tree t2
= TREE_VALUE (p2
);
1649 my_friendly_assert (TREE_CODE (t1
) == TREE_VEC
, 0);
1650 my_friendly_assert (TREE_CODE (t2
) == TREE_VEC
, 0);
1652 if (TREE_VEC_LENGTH (t1
) != TREE_VEC_LENGTH (t2
))
1655 for (i
= 0; i
< TREE_VEC_LENGTH (t2
); ++i
)
1657 tree parm1
= TREE_VALUE (TREE_VEC_ELT (t1
, i
));
1658 tree parm2
= TREE_VALUE (TREE_VEC_ELT (t2
, i
));
1660 if (TREE_CODE (parm1
) != TREE_CODE (parm2
))
1663 if (TREE_CODE (parm1
) == TEMPLATE_TYPE_PARM
)
1665 else if (!same_type_p (TREE_TYPE (parm1
), TREE_TYPE (parm2
)))
1670 if ((p1
!= NULL_TREE
) != (p2
!= NULL_TREE
))
1671 /* One set of parameters has more parameters lists than the
1678 /* Complain if DECL shadows a template parameter.
1680 [temp.local]: A template-parameter shall not be redeclared within its
1681 scope (including nested scopes). */
1684 check_template_shadow (decl
)
1689 /* If we're not in a template, we can't possibly shadow a template
1691 if (!current_template_parms
)
1694 /* Figure out what we're shadowing. */
1695 if (TREE_CODE (decl
) == OVERLOAD
)
1696 decl
= OVL_CURRENT (decl
);
1697 olddecl
= IDENTIFIER_VALUE (DECL_NAME (decl
));
1699 /* If there's no previous binding for this name, we're not shadowing
1700 anything, let alone a template parameter. */
1704 /* If we're not shadowing a template parameter, we're done. Note
1705 that OLDDECL might be an OVERLOAD (or perhaps even an
1706 ERROR_MARK), so we can't just blithely assume it to be a _DECL
1708 if (!DECL_P (olddecl
) || !DECL_TEMPLATE_PARM_P (olddecl
))
1711 /* We check for decl != olddecl to avoid bogus errors for using a
1712 name inside a class. We check TPFI to avoid duplicate errors for
1713 inline member templates. */
1715 || TEMPLATE_PARMS_FOR_INLINE (current_template_parms
))
1718 cp_error_at ("declaration of `%#D'", decl
);
1719 cp_error_at (" shadows template parm `%#D'", olddecl
);
1722 /* Return a new TEMPLATE_PARM_INDEX with the indicated INDEX, LEVEL,
1723 ORIG_LEVEL, DECL, and TYPE. */
1726 build_template_parm_index (index
, level
, orig_level
, decl
, type
)
1733 tree t
= make_node (TEMPLATE_PARM_INDEX
);
1734 TEMPLATE_PARM_IDX (t
) = index
;
1735 TEMPLATE_PARM_LEVEL (t
) = level
;
1736 TEMPLATE_PARM_ORIG_LEVEL (t
) = orig_level
;
1737 TEMPLATE_PARM_DECL (t
) = decl
;
1738 TREE_TYPE (t
) = type
;
1743 /* Return a TEMPLATE_PARM_INDEX, similar to INDEX, but whose
1744 TEMPLATE_PARM_LEVEL has been decreased by LEVELS. If such a
1745 TEMPLATE_PARM_INDEX already exists, it is returned; otherwise, a
1746 new one is created. */
1749 reduce_template_parm_level (index
, type
, levels
)
1754 if (TEMPLATE_PARM_DESCENDANTS (index
) == NULL_TREE
1755 || (TEMPLATE_PARM_LEVEL (TEMPLATE_PARM_DESCENDANTS (index
))
1756 != TEMPLATE_PARM_LEVEL (index
) - levels
))
1759 = build_decl (TREE_CODE (TEMPLATE_PARM_DECL (index
)),
1760 DECL_NAME (TEMPLATE_PARM_DECL (index
)),
1763 = build_template_parm_index (TEMPLATE_PARM_IDX (index
),
1764 TEMPLATE_PARM_LEVEL (index
) - levels
,
1765 TEMPLATE_PARM_ORIG_LEVEL (index
),
1767 TEMPLATE_PARM_DESCENDANTS (index
) = t
;
1769 /* Template template parameters need this. */
1770 DECL_TEMPLATE_PARMS (decl
)
1771 = DECL_TEMPLATE_PARMS (TEMPLATE_PARM_DECL (index
));
1774 return TEMPLATE_PARM_DESCENDANTS (index
);
1777 /* Process information from new template parameter NEXT and append it to the
1778 LIST being built. */
1781 process_template_parm (list
, next
)
1790 my_friendly_assert (TREE_CODE (parm
) == TREE_LIST
, 259);
1791 defval
= TREE_PURPOSE (parm
);
1792 parm
= TREE_VALUE (parm
);
1793 is_type
= TREE_PURPOSE (parm
) == class_type_node
;
1797 tree p
= TREE_VALUE (tree_last (list
));
1799 if (TREE_CODE (p
) == TYPE_DECL
|| TREE_CODE (p
) == TEMPLATE_DECL
)
1800 idx
= TEMPLATE_TYPE_IDX (TREE_TYPE (p
));
1802 idx
= TEMPLATE_PARM_IDX (DECL_INITIAL (p
));
1810 my_friendly_assert (TREE_CODE (TREE_PURPOSE (parm
)) == TREE_LIST
, 260);
1811 /* is a const-param */
1812 parm
= grokdeclarator (TREE_VALUE (parm
), TREE_PURPOSE (parm
),
1813 PARM
, 0, NULL_TREE
);
1817 The top-level cv-qualifiers on the template-parameter are
1818 ignored when determining its type. */
1819 TREE_TYPE (parm
) = TYPE_MAIN_VARIANT (TREE_TYPE (parm
));
1821 /* A template parameter is not modifiable. */
1822 TREE_READONLY (parm
) = 1;
1823 if (IS_AGGR_TYPE (TREE_TYPE (parm
))
1824 && TREE_CODE (TREE_TYPE (parm
)) != TEMPLATE_TYPE_PARM
1825 && TREE_CODE (TREE_TYPE (parm
)) != TYPENAME_TYPE
)
1827 cp_error ("`%#T' is not a valid type for a template constant parameter",
1829 if (DECL_NAME (parm
) == NULL_TREE
)
1830 error (" a template type parameter must begin with `class' or `typename'");
1831 TREE_TYPE (parm
) = void_type_node
;
1834 && (TREE_CODE (TREE_TYPE (parm
)) == REAL_TYPE
1835 || TREE_CODE (TREE_TYPE (parm
)) == COMPLEX_TYPE
))
1836 cp_pedwarn ("`%T' is not a valid type for a template constant parameter",
1838 decl
= build_decl (CONST_DECL
, DECL_NAME (parm
), TREE_TYPE (parm
));
1839 DECL_INITIAL (parm
) = DECL_INITIAL (decl
)
1840 = build_template_parm_index (idx
, processing_template_decl
,
1841 processing_template_decl
,
1842 decl
, TREE_TYPE (parm
));
1847 parm
= TREE_VALUE (parm
);
1849 if (parm
&& TREE_CODE (parm
) == TEMPLATE_DECL
)
1851 t
= make_aggr_type (TEMPLATE_TEMPLATE_PARM
);
1852 /* This is for distinguishing between real templates and template
1853 template parameters */
1854 TREE_TYPE (parm
) = t
;
1855 TREE_TYPE (DECL_TEMPLATE_RESULT (parm
)) = t
;
1860 t
= make_aggr_type (TEMPLATE_TYPE_PARM
);
1861 /* parm is either IDENTIFIER_NODE or NULL_TREE */
1862 decl
= build_decl (TYPE_DECL
, parm
, t
);
1865 TYPE_NAME (t
) = decl
;
1866 TYPE_STUB_DECL (t
) = decl
;
1868 TEMPLATE_TYPE_PARM_INDEX (t
)
1869 = build_template_parm_index (idx
, processing_template_decl
,
1870 processing_template_decl
,
1871 decl
, TREE_TYPE (parm
));
1873 DECL_ARTIFICIAL (decl
) = 1;
1874 SET_DECL_TEMPLATE_PARM_P (decl
);
1876 parm
= build_tree_list (defval
, parm
);
1877 return chainon (list
, parm
);
1880 /* The end of a template parameter list has been reached. Process the
1881 tree list into a parameter vector, converting each parameter into a more
1882 useful form. Type parameters are saved as IDENTIFIER_NODEs, and others
1886 end_template_parm_list (parms
)
1891 tree saved_parmlist
= make_tree_vec (list_length (parms
));
1893 current_template_parms
1894 = tree_cons (build_int_2 (0, processing_template_decl
),
1895 saved_parmlist
, current_template_parms
);
1897 for (parm
= parms
, nparms
= 0;
1899 parm
= TREE_CHAIN (parm
), nparms
++)
1900 TREE_VEC_ELT (saved_parmlist
, nparms
) = parm
;
1902 --processing_template_parmlist
;
1904 return saved_parmlist
;
1907 /* end_template_decl is called after a template declaration is seen. */
1910 end_template_decl ()
1912 reset_specialization ();
1914 if (! processing_template_decl
)
1917 /* This matches the pushlevel in begin_template_parm_list. */
1920 --processing_template_decl
;
1921 current_template_parms
= TREE_CHAIN (current_template_parms
);
1924 /* Given a template argument vector containing the template PARMS.
1925 The innermost PARMS are given first. */
1928 current_template_args ()
1931 tree args
= NULL_TREE
;
1932 int length
= TMPL_PARMS_DEPTH (current_template_parms
);
1935 /* If there is only one level of template parameters, we do not
1936 create a TREE_VEC of TREE_VECs. Instead, we return a single
1937 TREE_VEC containing the arguments. */
1939 args
= make_tree_vec (length
);
1941 for (header
= current_template_parms
; header
; header
= TREE_CHAIN (header
))
1943 tree a
= copy_node (TREE_VALUE (header
));
1946 TREE_TYPE (a
) = NULL_TREE
;
1947 for (i
= TREE_VEC_LENGTH (a
) - 1; i
>= 0; --i
)
1949 tree t
= TREE_VEC_ELT (a
, i
);
1951 /* T will be a list if we are called from within a
1952 begin/end_template_parm_list pair, but a vector directly
1953 if within a begin/end_member_template_processing pair. */
1954 if (TREE_CODE (t
) == TREE_LIST
)
1958 if (TREE_CODE (t
) == TYPE_DECL
1959 || TREE_CODE (t
) == TEMPLATE_DECL
)
1962 t
= DECL_INITIAL (t
);
1963 TREE_VEC_ELT (a
, i
) = t
;
1968 TREE_VEC_ELT (args
, --l
) = a
;
1976 /* Return a TEMPLATE_DECL corresponding to DECL, using the indicated
1977 template PARMS. Used by push_template_decl below. */
1980 build_template_decl (decl
, parms
)
1984 tree tmpl
= build_lang_decl (TEMPLATE_DECL
, DECL_NAME (decl
), NULL_TREE
);
1985 DECL_TEMPLATE_PARMS (tmpl
) = parms
;
1986 DECL_CONTEXT (tmpl
) = DECL_CONTEXT (decl
);
1987 if (DECL_LANG_SPECIFIC (decl
))
1989 DECL_VIRTUAL_CONTEXT (tmpl
) = DECL_VIRTUAL_CONTEXT (decl
);
1990 DECL_STATIC_FUNCTION_P (tmpl
) = DECL_STATIC_FUNCTION_P (decl
);
1991 DECL_CONSTRUCTOR_P (tmpl
) = DECL_CONSTRUCTOR_P (decl
);
1992 DECL_NONCONVERTING_P (tmpl
) = DECL_NONCONVERTING_P (decl
);
1993 DECL_ASSIGNMENT_OPERATOR_P (tmpl
) = DECL_ASSIGNMENT_OPERATOR_P (decl
);
1994 if (DECL_OVERLOADED_OPERATOR_P (decl
))
1995 SET_OVERLOADED_OPERATOR_CODE (tmpl
,
1996 DECL_OVERLOADED_OPERATOR_P (decl
));
2002 struct template_parm_data
2004 /* The level of the template parameters we are currently
2008 /* The index of the specialization argument we are currently
2012 /* An array whose size is the number of template parameters. The
2013 elements are non-zero if the parameter has been used in any one
2014 of the arguments processed so far. */
2017 /* An array whose size is the number of template arguments. The
2018 elements are non-zero if the argument makes use of template
2019 parameters of this level. */
2020 int* arg_uses_template_parms
;
2023 /* Subroutine of push_template_decl used to see if each template
2024 parameter in a partial specialization is used in the explicit
2025 argument list. If T is of the LEVEL given in DATA (which is
2026 treated as a template_parm_data*), then DATA->PARMS is marked
2030 mark_template_parm (t
, data
)
2036 struct template_parm_data
* tpd
= (struct template_parm_data
*) data
;
2038 if (TREE_CODE (t
) == TEMPLATE_PARM_INDEX
)
2040 level
= TEMPLATE_PARM_LEVEL (t
);
2041 idx
= TEMPLATE_PARM_IDX (t
);
2045 level
= TEMPLATE_TYPE_LEVEL (t
);
2046 idx
= TEMPLATE_TYPE_IDX (t
);
2049 if (level
== tpd
->level
)
2051 tpd
->parms
[idx
] = 1;
2052 tpd
->arg_uses_template_parms
[tpd
->current_arg
] = 1;
2055 /* Return zero so that for_each_template_parm will continue the
2056 traversal of the tree; we want to mark *every* template parm. */
2060 /* Process the partial specialization DECL. */
2063 process_partial_specialization (decl
)
2066 tree type
= TREE_TYPE (decl
);
2067 tree maintmpl
= CLASSTYPE_TI_TEMPLATE (type
);
2068 tree specargs
= CLASSTYPE_TI_ARGS (type
);
2069 tree inner_args
= INNERMOST_TEMPLATE_ARGS (specargs
);
2070 tree inner_parms
= INNERMOST_TEMPLATE_PARMS (current_template_parms
);
2071 tree main_inner_parms
= DECL_INNERMOST_TEMPLATE_PARMS (maintmpl
);
2072 int nargs
= TREE_VEC_LENGTH (inner_args
);
2073 int ntparms
= TREE_VEC_LENGTH (inner_parms
);
2075 int did_error_intro
= 0;
2076 struct template_parm_data tpd
;
2077 struct template_parm_data tpd2
;
2079 /* We check that each of the template parameters given in the
2080 partial specialization is used in the argument list to the
2081 specialization. For example:
2083 template <class T> struct S;
2084 template <class T> struct S<T*>;
2086 The second declaration is OK because `T*' uses the template
2087 parameter T, whereas
2089 template <class T> struct S<int>;
2091 is no good. Even trickier is:
2102 The S2<T> declaration is actually illegal; it is a
2103 full-specialization. Of course,
2106 struct S2<T (*)(U)>;
2108 or some such would have been OK. */
2109 tpd
.level
= TMPL_PARMS_DEPTH (current_template_parms
);
2110 tpd
.parms
= alloca (sizeof (int) * ntparms
);
2111 bzero ((PTR
) tpd
.parms
, sizeof (int) * ntparms
);
2113 tpd
.arg_uses_template_parms
= alloca (sizeof (int) * nargs
);
2114 bzero ((PTR
) tpd
.arg_uses_template_parms
, sizeof (int) * nargs
);
2115 for (i
= 0; i
< nargs
; ++i
)
2117 tpd
.current_arg
= i
;
2118 for_each_template_parm (TREE_VEC_ELT (inner_args
, i
),
2119 &mark_template_parm
,
2122 for (i
= 0; i
< ntparms
; ++i
)
2123 if (tpd
.parms
[i
] == 0)
2125 /* One of the template parms was not used in the
2127 if (!did_error_intro
)
2129 cp_error ("template parameters not used in partial specialization:");
2130 did_error_intro
= 1;
2134 TREE_VALUE (TREE_VEC_ELT (inner_parms
, i
)));
2137 /* [temp.class.spec]
2139 The argument list of the specialization shall not be identical to
2140 the implicit argument list of the primary template. */
2141 if (comp_template_args
2143 INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (TREE_TYPE
2145 cp_error ("partial specialization `%T' does not specialize any template arguments", type
);
2147 /* [temp.class.spec]
2149 A partially specialized non-type argument expression shall not
2150 involve template parameters of the partial specialization except
2151 when the argument expression is a simple identifier.
2153 The type of a template parameter corresponding to a specialized
2154 non-type argument shall not be dependent on a parameter of the
2156 my_friendly_assert (nargs
== DECL_NTPARMS (maintmpl
), 0);
2158 for (i
= 0; i
< nargs
; ++i
)
2160 tree arg
= TREE_VEC_ELT (inner_args
, i
);
2161 if (/* These first two lines are the `non-type' bit. */
2163 && TREE_CODE (arg
) != TEMPLATE_DECL
2164 /* This next line is the `argument expression is not just a
2165 simple identifier' condition and also the `specialized
2166 non-type argument' bit. */
2167 && TREE_CODE (arg
) != TEMPLATE_PARM_INDEX
)
2169 if (tpd
.arg_uses_template_parms
[i
])
2170 cp_error ("template argument `%E' involves template parameter(s)", arg
);
2173 /* Look at the corresponding template parameter,
2174 marking which template parameters its type depends
2177 TREE_TYPE (TREE_VALUE (TREE_VEC_ELT (main_inner_parms
,
2182 /* We haven't yet initialized TPD2. Do so now. */
2183 tpd2
.arg_uses_template_parms
2184 = (int*) alloca (sizeof (int) * nargs
);
2185 /* The number of parameters here is the number in the
2186 main template, which, as checked in the assertion
2188 tpd2
.parms
= (int*) alloca (sizeof (int) * nargs
);
2190 TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (maintmpl
));
2193 /* Mark the template parameters. But this time, we're
2194 looking for the template parameters of the main
2195 template, not in the specialization. */
2196 tpd2
.current_arg
= i
;
2197 tpd2
.arg_uses_template_parms
[i
] = 0;
2198 bzero ((PTR
) tpd2
.parms
, sizeof (int) * nargs
);
2199 for_each_template_parm (type
,
2200 &mark_template_parm
,
2203 if (tpd2
.arg_uses_template_parms
[i
])
2205 /* The type depended on some template parameters.
2206 If they are fully specialized in the
2207 specialization, that's OK. */
2209 for (j
= 0; j
< nargs
; ++j
)
2210 if (tpd2
.parms
[j
] != 0
2211 && tpd
.arg_uses_template_parms
[j
])
2213 cp_error ("type `%T' of template argument `%E' depends on template parameter(s)",
2223 if (retrieve_specialization (maintmpl
, specargs
))
2224 /* We've already got this specialization. */
2227 DECL_TEMPLATE_SPECIALIZATIONS (maintmpl
)
2228 = tree_cons (inner_args
, inner_parms
,
2229 DECL_TEMPLATE_SPECIALIZATIONS (maintmpl
));
2230 TREE_TYPE (DECL_TEMPLATE_SPECIALIZATIONS (maintmpl
)) = type
;
2234 /* Check that a template declaration's use of default arguments is not
2235 invalid. Here, PARMS are the template parameters. IS_PRIMARY is
2236 non-zero if DECL is the thing declared by a primary template.
2237 IS_PARTIAL is non-zero if DECL is a partial specialization. */
2240 check_default_tmpl_args (decl
, parms
, is_primary
, is_partial
)
2247 int last_level_to_check
;
2252 A default template-argument shall not be specified in a
2253 function template declaration or a function template definition, nor
2254 in the template-parameter-list of the definition of a member of a
2257 if (TREE_CODE (CP_DECL_CONTEXT (decl
)) == FUNCTION_DECL
)
2258 /* You can't have a function template declaration in a local
2259 scope, nor you can you define a member of a class template in a
2263 if (current_class_type
2264 && !TYPE_BEING_DEFINED (current_class_type
)
2265 && DECL_LANG_SPECIFIC (decl
)
2266 /* If this is either a friend defined in the scope of the class
2267 or a member function. */
2268 && ((DECL_CONTEXT (decl
)
2269 && same_type_p (DECL_CONTEXT (decl
), current_class_type
))
2270 || (DECL_FRIEND_CONTEXT (decl
)
2271 && same_type_p (DECL_FRIEND_CONTEXT (decl
),
2272 current_class_type
)))
2273 /* And, if it was a member function, it really was defined in
2274 the scope of the class. */
2275 && (!DECL_FUNCTION_MEMBER_P (decl
) || DECL_DEFINED_IN_CLASS_P (decl
)))
2276 /* We already checked these parameters when the template was
2277 declared, so there's no need to do it again now. This function
2278 was defined in class scope, but we're processing it's body now
2279 that the class is complete. */
2284 If a template-parameter has a default template-argument, all
2285 subsequent template-parameters shall have a default
2286 template-argument supplied. */
2287 for (parm_level
= parms
; parm_level
; parm_level
= TREE_CHAIN (parm_level
))
2289 tree inner_parms
= TREE_VALUE (parm_level
);
2290 int ntparms
= TREE_VEC_LENGTH (inner_parms
);
2291 int seen_def_arg_p
= 0;
2294 for (i
= 0; i
< ntparms
; ++i
)
2296 tree parm
= TREE_VEC_ELT (inner_parms
, i
);
2297 if (TREE_PURPOSE (parm
))
2299 else if (seen_def_arg_p
)
2301 cp_error ("no default argument for `%D'", TREE_VALUE (parm
));
2302 /* For better subsequent error-recovery, we indicate that
2303 there should have been a default argument. */
2304 TREE_PURPOSE (parm
) = error_mark_node
;
2309 if (TREE_CODE (decl
) != TYPE_DECL
|| is_partial
|| !is_primary
)
2310 /* For an ordinary class template, default template arguments are
2311 allowed at the innermost level, e.g.:
2312 template <class T = int>
2314 but, in a partial specialization, they're not allowed even
2315 there, as we have in [temp.class.spec]:
2317 The template parameter list of a specialization shall not
2318 contain default template argument values.
2320 So, for a partial specialization, or for a function template,
2321 we look at all of them. */
2324 /* But, for a primary class template that is not a partial
2325 specialization we look at all template parameters except the
2327 parms
= TREE_CHAIN (parms
);
2329 /* Figure out what error message to issue. */
2330 if (TREE_CODE (decl
) == FUNCTION_DECL
)
2331 msg
= "default argument for template parameter in function template `%D'";
2332 else if (is_partial
)
2333 msg
= "default argument in partial specialization `%D'";
2335 msg
= "default argument for template parameter for class enclosing `%D'";
2337 if (current_class_type
&& TYPE_BEING_DEFINED (current_class_type
))
2338 /* If we're inside a class definition, there's no need to
2339 examine the parameters to the class itself. On the one
2340 hand, they will be checked when the class is defined, and,
2341 on the other, default arguments are legal in things like:
2342 template <class T = double>
2343 struct S { template <class U> void f(U); };
2344 Here the default argument for `S' has no bearing on the
2345 declaration of `f'. */
2346 last_level_to_check
= template_class_depth (current_class_type
) + 1;
2348 /* Check everything. */
2349 last_level_to_check
= 0;
2351 for (parm_level
= parms
;
2352 parm_level
&& TMPL_PARMS_DEPTH (parm_level
) >= last_level_to_check
;
2353 parm_level
= TREE_CHAIN (parm_level
))
2355 tree inner_parms
= TREE_VALUE (parm_level
);
2359 ntparms
= TREE_VEC_LENGTH (inner_parms
);
2360 for (i
= 0; i
< ntparms
; ++i
)
2361 if (TREE_PURPOSE (TREE_VEC_ELT (inner_parms
, i
)))
2365 cp_error (msg
, decl
);
2369 /* Clear out the default argument so that we are not
2371 TREE_PURPOSE (TREE_VEC_ELT (inner_parms
, i
)) = NULL_TREE
;
2374 /* At this point, if we're still interested in issuing messages,
2375 they must apply to classes surrounding the object declared. */
2377 msg
= "default argument for template parameter for class enclosing `%D'";
2381 /* Creates a TEMPLATE_DECL for the indicated DECL using the template
2382 parameters given by current_template_args, or reuses a
2383 previously existing one, if appropriate. Returns the DECL, or an
2384 equivalent one, if it is replaced via a call to duplicate_decls.
2386 If IS_FRIEND is non-zero, DECL is a friend declaration. */
2389 push_template_decl_real (decl
, is_friend
)
2399 int new_template_p
= 0;
2401 /* See if this is a partial specialization. */
2402 is_partial
= (DECL_IMPLICIT_TYPEDEF_P (decl
)
2403 && TREE_CODE (TREE_TYPE (decl
)) != ENUMERAL_TYPE
2404 && CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_TYPE (decl
)));
2406 is_friend
|= (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_FRIEND_P (decl
));
2409 /* For a friend, we want the context of the friend function, not
2410 the type of which it is a friend. */
2411 ctx
= DECL_CONTEXT (decl
);
2412 else if (CP_DECL_CONTEXT (decl
)
2413 && TREE_CODE (CP_DECL_CONTEXT (decl
)) != NAMESPACE_DECL
)
2414 /* In the case of a virtual function, we want the class in which
2416 ctx
= CP_DECL_CONTEXT (decl
);
2418 /* Otherwise, if we're currently definining some class, the DECL
2419 is assumed to be a member of the class. */
2420 ctx
= current_scope ();
2422 if (ctx
&& TREE_CODE (ctx
) == NAMESPACE_DECL
)
2425 if (!DECL_CONTEXT (decl
))
2426 DECL_CONTEXT (decl
) = FROB_CONTEXT (current_namespace
);
2428 /* See if this is a primary template. */
2429 primary
= template_parm_scope_p ();
2433 if (current_lang_name
== lang_name_c
)
2434 cp_error ("template with C linkage");
2435 else if (TREE_CODE (decl
) == TYPE_DECL
2436 && ANON_AGGRNAME_P (DECL_NAME (decl
)))
2437 cp_error ("template class without a name");
2438 else if ((DECL_IMPLICIT_TYPEDEF_P (decl
)
2439 && CLASS_TYPE_P (TREE_TYPE (decl
)))
2440 || (TREE_CODE (decl
) == VAR_DECL
&& ctx
&& CLASS_TYPE_P (ctx
))
2441 || TREE_CODE (decl
) == FUNCTION_DECL
)
2444 cp_error ("template declaration of `%#D'", decl
);
2447 /* Check to see that the rules regarding the use of default
2448 arguments are not being violated. */
2449 check_default_tmpl_args (decl
, current_template_parms
,
2450 primary
, is_partial
);
2453 return process_partial_specialization (decl
);
2455 args
= current_template_args ();
2458 || TREE_CODE (ctx
) == FUNCTION_DECL
2459 || TYPE_BEING_DEFINED (ctx
)
2460 || (is_friend
&& !DECL_TEMPLATE_INFO (decl
)))
2462 if (DECL_LANG_SPECIFIC (decl
)
2463 && DECL_TEMPLATE_INFO (decl
)
2464 && DECL_TI_TEMPLATE (decl
))
2465 tmpl
= DECL_TI_TEMPLATE (decl
);
2466 /* If DECL is a TYPE_DECL for a class-template, then there won't
2467 be DECL_LANG_SPECIFIC. The information equivalent to
2468 DECL_TEMPLATE_INFO is found in TYPE_TEMPLATE_INFO instead. */
2469 else if (DECL_IMPLICIT_TYPEDEF_P (decl
)
2470 && TYPE_TEMPLATE_INFO (TREE_TYPE (decl
))
2471 && TYPE_TI_TEMPLATE (TREE_TYPE (decl
)))
2473 /* Since a template declaration already existed for this
2474 class-type, we must be redeclaring it here. Make sure
2475 that the redeclaration is legal. */
2476 redeclare_class_template (TREE_TYPE (decl
),
2477 current_template_parms
);
2478 /* We don't need to create a new TEMPLATE_DECL; just use the
2479 one we already had. */
2480 tmpl
= TYPE_TI_TEMPLATE (TREE_TYPE (decl
));
2484 tmpl
= build_template_decl (decl
, current_template_parms
);
2487 if (DECL_LANG_SPECIFIC (decl
)
2488 && DECL_TEMPLATE_SPECIALIZATION (decl
))
2490 /* A specialization of a member template of a template
2492 SET_DECL_TEMPLATE_SPECIALIZATION (tmpl
);
2493 DECL_TEMPLATE_INFO (tmpl
) = DECL_TEMPLATE_INFO (decl
);
2494 DECL_TEMPLATE_INFO (decl
) = NULL_TREE
;
2500 tree a
, t
, current
, parms
;
2503 if (TREE_CODE (decl
) == TYPE_DECL
)
2505 if ((IS_AGGR_TYPE_CODE (TREE_CODE (TREE_TYPE (decl
)))
2506 || TREE_CODE (TREE_TYPE (decl
)) == ENUMERAL_TYPE
)
2507 && TYPE_TEMPLATE_INFO (TREE_TYPE (decl
))
2508 && TYPE_TI_TEMPLATE (TREE_TYPE (decl
)))
2509 tmpl
= TYPE_TI_TEMPLATE (TREE_TYPE (decl
));
2512 cp_error ("`%D' does not declare a template type", decl
);
2516 else if (! DECL_TEMPLATE_INFO (decl
))
2518 cp_error ("template definition of non-template `%#D'", decl
);
2522 tmpl
= DECL_TI_TEMPLATE (decl
);
2524 if (is_member_template (tmpl
)
2525 && DECL_FUNCTION_TEMPLATE_P (tmpl
)
2526 && DECL_TEMPLATE_INFO (decl
) && DECL_TI_ARGS (decl
)
2527 && DECL_TEMPLATE_SPECIALIZATION (decl
))
2531 /* The declaration is a specialization of a member
2532 template, declared outside the class. Therefore, the
2533 innermost template arguments will be NULL, so we
2534 replace them with the arguments determined by the
2535 earlier call to check_explicit_specialization. */
2536 args
= DECL_TI_ARGS (decl
);
2539 = build_template_decl (decl
, current_template_parms
);
2540 DECL_TEMPLATE_RESULT (new_tmpl
) = decl
;
2541 TREE_TYPE (new_tmpl
) = TREE_TYPE (decl
);
2542 DECL_TI_TEMPLATE (decl
) = new_tmpl
;
2543 SET_DECL_TEMPLATE_SPECIALIZATION (new_tmpl
);
2544 DECL_TEMPLATE_INFO (new_tmpl
)
2545 = tree_cons (tmpl
, args
, NULL_TREE
);
2547 register_specialization (new_tmpl
,
2548 most_general_template (tmpl
),
2553 /* Make sure the template headers we got make sense. */
2555 parms
= DECL_TEMPLATE_PARMS (tmpl
);
2556 i
= TMPL_PARMS_DEPTH (parms
);
2557 if (TMPL_ARGS_DEPTH (args
) != i
)
2559 cp_error ("expected %d levels of template parms for `%#D', got %d",
2560 i
, decl
, TMPL_ARGS_DEPTH (args
));
2563 for (current
= decl
; i
> 0; --i
, parms
= TREE_CHAIN (parms
))
2565 a
= TMPL_ARGS_LEVEL (args
, i
);
2566 t
= INNERMOST_TEMPLATE_PARMS (parms
);
2568 if (TREE_VEC_LENGTH (t
) != TREE_VEC_LENGTH (a
))
2570 if (current
== decl
)
2571 cp_error ("got %d template parameters for `%#D'",
2572 TREE_VEC_LENGTH (a
), decl
);
2574 cp_error ("got %d template parameters for `%#T'",
2575 TREE_VEC_LENGTH (a
), current
);
2576 cp_error (" but %d required", TREE_VEC_LENGTH (t
));
2579 /* Perhaps we should also check that the parms are used in the
2580 appropriate qualifying scopes in the declarator? */
2582 if (current
== decl
)
2585 current
= TYPE_CONTEXT (current
);
2589 DECL_TEMPLATE_RESULT (tmpl
) = decl
;
2590 TREE_TYPE (tmpl
) = TREE_TYPE (decl
);
2592 /* Push template declarations for global functions and types. Note
2593 that we do not try to push a global template friend declared in a
2594 template class; such a thing may well depend on the template
2595 parameters of the class. */
2596 if (new_template_p
&& !ctx
2597 && !(is_friend
&& template_class_depth (current_class_type
) > 0))
2598 tmpl
= pushdecl_namespace_level (tmpl
);
2601 DECL_PRIMARY_TEMPLATE (tmpl
) = tmpl
;
2603 info
= tree_cons (tmpl
, args
, NULL_TREE
);
2605 if (DECL_IMPLICIT_TYPEDEF_P (decl
))
2607 SET_TYPE_TEMPLATE_INFO (TREE_TYPE (tmpl
), info
);
2608 if ((!ctx
|| TREE_CODE (ctx
) != FUNCTION_DECL
)
2609 && TREE_CODE (TREE_TYPE (decl
)) != ENUMERAL_TYPE
)
2610 DECL_NAME (decl
) = classtype_mangled_name (TREE_TYPE (decl
));
2612 else if (DECL_LANG_SPECIFIC (decl
))
2613 DECL_TEMPLATE_INFO (decl
) = info
;
2615 return DECL_TEMPLATE_RESULT (tmpl
);
2619 push_template_decl (decl
)
2622 return push_template_decl_real (decl
, 0);
2625 /* Called when a class template TYPE is redeclared with the indicated
2626 template PARMS, e.g.:
2628 template <class T> struct S;
2629 template <class T> struct S {}; */
2632 redeclare_class_template (type
, parms
)
2640 if (!TYPE_TEMPLATE_INFO (type
))
2642 cp_error ("`%T' is not a template type", type
);
2646 tmpl
= TYPE_TI_TEMPLATE (type
);
2647 if (!PRIMARY_TEMPLATE_P (tmpl
))
2648 /* The type is nested in some template class. Nothing to worry
2649 about here; there are no new template parameters for the nested
2653 parms
= INNERMOST_TEMPLATE_PARMS (parms
);
2654 tmpl_parms
= DECL_INNERMOST_TEMPLATE_PARMS (tmpl
);
2656 if (TREE_VEC_LENGTH (parms
) != TREE_VEC_LENGTH (tmpl_parms
))
2658 cp_error_at ("previous declaration `%D'", tmpl
);
2659 cp_error ("used %d template parameter%s instead of %d",
2660 TREE_VEC_LENGTH (tmpl_parms
),
2661 TREE_VEC_LENGTH (tmpl_parms
) == 1 ? "" : "s",
2662 TREE_VEC_LENGTH (parms
));
2666 for (i
= 0; i
< TREE_VEC_LENGTH (tmpl_parms
); ++i
)
2668 tree tmpl_parm
= TREE_VALUE (TREE_VEC_ELT (tmpl_parms
, i
));
2669 tree parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
2670 tree tmpl_default
= TREE_PURPOSE (TREE_VEC_ELT (tmpl_parms
, i
));
2671 tree parm_default
= TREE_PURPOSE (TREE_VEC_ELT (parms
, i
));
2673 if (TREE_CODE (tmpl_parm
) != TREE_CODE (parm
))
2675 cp_error_at ("template parameter `%#D'", tmpl_parm
);
2676 cp_error ("redeclared here as `%#D'", parm
);
2680 if (tmpl_default
!= NULL_TREE
&& parm_default
!= NULL_TREE
)
2682 /* We have in [temp.param]:
2684 A template-parameter may not be given default arguments
2685 by two different declarations in the same scope. */
2686 cp_error ("redefinition of default argument for `%#D'", parm
);
2687 cp_error_at (" original definition appeared here", tmpl_parm
);
2691 if (parm_default
!= NULL_TREE
)
2692 /* Update the previous template parameters (which are the ones
2693 that will really count) with the new default value. */
2694 TREE_PURPOSE (TREE_VEC_ELT (tmpl_parms
, i
)) = parm_default
;
2695 else if (tmpl_default
!= NULL_TREE
)
2696 /* Update the new parameters, too; they'll be used as the
2697 parameters for any members. */
2698 TREE_PURPOSE (TREE_VEC_ELT (parms
, i
)) = tmpl_default
;
2702 /* Attempt to convert the non-type template parameter EXPR to the
2703 indicated TYPE. If the conversion is successful, return the
2704 converted value. If the conversion is unsuccesful, return
2705 NULL_TREE if we issued an error message, or error_mark_node if we
2706 did not. We issue error messages for out-and-out bad template
2707 parameters, but not simply because the conversion failed, since we
2708 might be just trying to do argument deduction. By the time this
2709 function is called, neither TYPE nor EXPR may make use of template
2713 convert_nontype_argument (type
, expr
)
2717 tree expr_type
= TREE_TYPE (expr
);
2719 /* A template-argument for a non-type, non-template
2720 template-parameter shall be one of:
2722 --an integral constant-expression of integral or enumeration
2725 --the name of a non-type template-parameter; or
2727 --the name of an object or function with external linkage,
2728 including function templates and function template-ids but
2729 excluding non-static class members, expressed as id-expression;
2732 --the address of an object or function with external linkage,
2733 including function templates and function template-ids but
2734 excluding non-static class members, expressed as & id-expression
2735 where the & is optional if the name refers to a function or
2738 --a pointer to member expressed as described in _expr.unary.op_. */
2740 /* An integral constant-expression can include const variables or
2741 enumerators. Simplify things by folding them to their values,
2742 unless we're about to bind the declaration to a reference
2744 if (INTEGRAL_TYPE_P (expr_type
)
2745 && TREE_CODE (type
) != REFERENCE_TYPE
)
2746 expr
= decl_constant_value (expr
);
2748 if (is_overloaded_fn (expr
))
2749 /* OK for now. We'll check that it has external linkage later.
2750 Check this first since if expr_type is the unknown_type_node
2751 we would otherwise complain below. */
2753 else if (TYPE_PTRMEM_P (expr_type
)
2754 || TYPE_PTRMEMFUNC_P (expr_type
))
2756 if (TREE_CODE (expr
) != PTRMEM_CST
)
2759 else if (TYPE_PTR_P (expr_type
)
2760 || TYPE_PTRMEM_P (expr_type
)
2761 || TREE_CODE (expr_type
) == ARRAY_TYPE
2762 || TREE_CODE (type
) == REFERENCE_TYPE
2763 /* If expr is the address of an overloaded function, we
2764 will get the unknown_type_node at this point. */
2765 || expr_type
== unknown_type_node
)
2771 if (TREE_CODE (expr_type
) == ARRAY_TYPE
2772 || (TREE_CODE (type
) == REFERENCE_TYPE
2773 && TREE_CODE (e
) != ADDR_EXPR
))
2777 if (TREE_CODE (e
) != ADDR_EXPR
)
2780 cp_error ("`%E' is not a valid template argument", expr
);
2781 if (TYPE_PTR_P (expr_type
))
2783 if (TREE_CODE (TREE_TYPE (expr_type
)) == FUNCTION_TYPE
)
2784 cp_error ("it must be the address of a function with external linkage");
2786 cp_error ("it must be the address of an object with external linkage");
2788 else if (TYPE_PTRMEM_P (expr_type
)
2789 || TYPE_PTRMEMFUNC_P (expr_type
))
2790 cp_error ("it must be a pointer-to-member of the form `&X::Y'");
2795 referent
= TREE_OPERAND (e
, 0);
2796 STRIP_NOPS (referent
);
2799 if (TREE_CODE (referent
) == STRING_CST
)
2801 cp_error ("string literal %E is not a valid template argument because it is the address of an object with static linkage",
2806 if (is_overloaded_fn (referent
))
2807 /* We'll check that it has external linkage later. */
2809 else if (TREE_CODE (referent
) != VAR_DECL
)
2811 else if (!TREE_PUBLIC (referent
))
2813 cp_error ("address of non-extern `%E' cannot be used as template argument", referent
);
2814 return error_mark_node
;
2817 else if (INTEGRAL_TYPE_P (expr_type
)
2818 || TYPE_PTRMEM_P (expr_type
)
2819 || TYPE_PTRMEMFUNC_P (expr_type
)
2820 /* The next two are g++ extensions. */
2821 || TREE_CODE (expr_type
) == REAL_TYPE
2822 || TREE_CODE (expr_type
) == COMPLEX_TYPE
)
2824 if (! TREE_CONSTANT (expr
))
2827 cp_error ("non-constant `%E' cannot be used as template argument",
2834 cp_error ("object `%E' cannot be used as template argument", expr
);
2838 switch (TREE_CODE (type
))
2843 /* For a non-type template-parameter of integral or enumeration
2844 type, integral promotions (_conv.prom_) and integral
2845 conversions (_conv.integral_) are applied. */
2846 if (!INTEGRAL_TYPE_P (expr_type
))
2847 return error_mark_node
;
2849 /* It's safe to call digest_init in this case; we know we're
2850 just converting one integral constant expression to another. */
2851 expr
= digest_init (type
, expr
, (tree
*) 0);
2853 if (TREE_CODE (expr
) != INTEGER_CST
)
2854 /* Curiously, some TREE_CONSTANT integral expressions do not
2855 simplify to integer constants. For example, `3 % 0',
2856 remains a TRUNC_MOD_EXPR. */
2863 /* These are g++ extensions. */
2864 if (TREE_CODE (expr_type
) != TREE_CODE (type
))
2865 return error_mark_node
;
2867 expr
= digest_init (type
, expr
, (tree
*) 0);
2869 if (TREE_CODE (expr
) != REAL_CST
)
2876 tree type_pointed_to
= TREE_TYPE (type
);
2878 if (TYPE_PTRMEM_P (type
))
2882 /* For a non-type template-parameter of type pointer to data
2883 member, qualification conversions (_conv.qual_) are
2885 e
= perform_qualification_conversions (type
, expr
);
2886 if (TREE_CODE (e
) == NOP_EXPR
)
2887 /* The call to perform_qualification_conversions will
2888 insert a NOP_EXPR over EXPR to do express conversion,
2889 if necessary. But, that will confuse us if we use
2890 this (converted) template parameter to instantiate
2891 another template; then the thing will not look like a
2892 valid template argument. So, just make a new
2893 constant, of the appropriate type. */
2894 e
= make_ptrmem_cst (type
, PTRMEM_CST_MEMBER (expr
));
2897 else if (TREE_CODE (type_pointed_to
) == FUNCTION_TYPE
)
2899 /* For a non-type template-parameter of type pointer to
2900 function, only the function-to-pointer conversion
2901 (_conv.func_) is applied. If the template-argument
2902 represents a set of overloaded functions (or a pointer to
2903 such), the matching function is selected from the set
2908 if (TREE_CODE (expr
) == ADDR_EXPR
)
2909 fns
= TREE_OPERAND (expr
, 0);
2913 fn
= instantiate_type (type_pointed_to
, fns
, itf_none
);
2915 if (fn
== error_mark_node
)
2916 return error_mark_node
;
2918 if (!TREE_PUBLIC (fn
))
2920 if (really_overloaded_fn (fns
))
2921 return error_mark_node
;
2926 expr
= build_unary_op (ADDR_EXPR
, fn
, 0);
2928 my_friendly_assert (same_type_p (type
, TREE_TYPE (expr
)),
2934 /* For a non-type template-parameter of type pointer to
2935 object, qualification conversions (_conv.qual_) and the
2936 array-to-pointer conversion (_conv.array_) are applied.
2937 [Note: In particular, neither the null pointer conversion
2938 (_conv.ptr_) nor the derived-to-base conversion
2939 (_conv.ptr_) are applied. Although 0 is a valid
2940 template-argument for a non-type template-parameter of
2941 integral type, it is not a valid template-argument for a
2942 non-type template-parameter of pointer type.]
2944 The call to decay_conversion performs the
2945 array-to-pointer conversion, if appropriate. */
2946 expr
= decay_conversion (expr
);
2948 if (expr
== error_mark_node
)
2949 return error_mark_node
;
2951 return perform_qualification_conversions (type
, expr
);
2956 case REFERENCE_TYPE
:
2958 tree type_referred_to
= TREE_TYPE (type
);
2960 /* If this expression already has reference type, get the
2961 underling object. */
2962 if (TREE_CODE (expr_type
) == REFERENCE_TYPE
)
2964 my_friendly_assert (TREE_CODE (expr
) == ADDR_EXPR
, 20000604);
2965 expr
= TREE_OPERAND (expr
, 0);
2966 expr_type
= TREE_TYPE (expr
);
2969 if (TREE_CODE (type_referred_to
) == FUNCTION_TYPE
)
2971 /* For a non-type template-parameter of type reference to
2972 function, no conversions apply. If the
2973 template-argument represents a set of overloaded
2974 functions, the matching function is selected from the
2975 set (_over.over_). */
2978 fn
= instantiate_type (type_referred_to
, expr
, itf_none
);
2980 if (fn
== error_mark_node
)
2981 return error_mark_node
;
2983 if (!TREE_PUBLIC (fn
))
2985 if (really_overloaded_fn (expr
))
2986 /* Don't issue an error here; we might get a different
2987 function if the overloading had worked out
2989 return error_mark_node
;
2994 my_friendly_assert (same_type_p (type_referred_to
,
3002 /* For a non-type template-parameter of type reference to
3003 object, no conversions apply. The type referred to by the
3004 reference may be more cv-qualified than the (otherwise
3005 identical) type of the template-argument. The
3006 template-parameter is bound directly to the
3007 template-argument, which must be an lvalue. */
3008 if (!same_type_p (TYPE_MAIN_VARIANT (expr_type
),
3009 TYPE_MAIN_VARIANT (type_referred_to
))
3010 || !at_least_as_qualified_p (type_referred_to
,
3012 || !real_lvalue_p (expr
))
3013 return error_mark_node
;
3016 mark_addressable (expr
);
3017 return build1 (ADDR_EXPR
, type
, expr
);
3023 if (!TYPE_PTRMEMFUNC_P (type
))
3024 /* This handles templates like
3025 template<class T, T t> void f();
3026 when T is substituted with any class. The second template
3027 parameter becomes invalid and the template candidate is
3029 return error_mark_node
;
3031 /* For a non-type template-parameter of type pointer to member
3032 function, no conversions apply. If the template-argument
3033 represents a set of overloaded member functions, the
3034 matching member function is selected from the set
3037 if (!TYPE_PTRMEMFUNC_P (expr_type
) &&
3038 expr_type
!= unknown_type_node
)
3039 return error_mark_node
;
3041 if (TREE_CODE (expr
) == PTRMEM_CST
)
3043 /* A ptr-to-member constant. */
3044 if (!same_type_p (type
, expr_type
))
3045 return error_mark_node
;
3050 if (TREE_CODE (expr
) != ADDR_EXPR
)
3051 return error_mark_node
;
3053 expr
= instantiate_type (type
, expr
, itf_none
);
3055 if (expr
== error_mark_node
)
3056 return error_mark_node
;
3058 my_friendly_assert (same_type_p (type
, TREE_TYPE (expr
)),
3065 /* All non-type parameters must have one of these types. */
3066 my_friendly_abort (0);
3070 return error_mark_node
;
3073 /* Return 1 if PARM_PARMS and ARG_PARMS matches using rule for
3074 template template parameters. Both PARM_PARMS and ARG_PARMS are
3075 vectors of TREE_LIST nodes containing TYPE_DECL, TEMPLATE_DECL
3078 ARG_PARMS may contain more parameters than PARM_PARMS. If this is
3079 the case, then extra parameters must have default arguments.
3081 Consider the example:
3082 template <class T, class Allocator = allocator> class vector;
3083 template<template <class U> class TT> class C;
3085 C<vector> is a valid instantiation. PARM_PARMS for the above code
3086 contains a TYPE_DECL (for U), ARG_PARMS contains two TYPE_DECLs (for
3087 T and Allocator) and OUTER_ARGS contains the argument that is used to
3088 substitute the TT parameter. */
3091 coerce_template_template_parms (parm_parms
, arg_parms
, complain
,
3092 in_decl
, outer_args
)
3093 tree parm_parms
, arg_parms
;
3095 tree in_decl
, outer_args
;
3097 int nparms
, nargs
, i
;
3100 my_friendly_assert (TREE_CODE (parm_parms
) == TREE_VEC
, 0);
3101 my_friendly_assert (TREE_CODE (arg_parms
) == TREE_VEC
, 0);
3103 nparms
= TREE_VEC_LENGTH (parm_parms
);
3104 nargs
= TREE_VEC_LENGTH (arg_parms
);
3106 /* The rule here is opposite of coerce_template_parms. */
3109 && TREE_PURPOSE (TREE_VEC_ELT (arg_parms
, nparms
)) == NULL_TREE
))
3112 for (i
= 0; i
< nparms
; ++i
)
3114 parm
= TREE_VALUE (TREE_VEC_ELT (parm_parms
, i
));
3115 arg
= TREE_VALUE (TREE_VEC_ELT (arg_parms
, i
));
3117 if (arg
== NULL_TREE
|| arg
== error_mark_node
3118 || parm
== NULL_TREE
|| parm
== error_mark_node
)
3121 if (TREE_CODE (arg
) != TREE_CODE (parm
))
3124 switch (TREE_CODE (parm
))
3130 /* We encounter instantiations of templates like
3131 template <template <template <class> class> class TT>
3134 tree parmparm
= DECL_INNERMOST_TEMPLATE_PARMS (parm
);
3135 tree argparm
= DECL_INNERMOST_TEMPLATE_PARMS (arg
);
3137 if (!coerce_template_template_parms (parmparm
, argparm
,
3145 /* The tsubst call is used to handle cases such as
3146 template <class T, template <T> class TT> class D;
3147 i.e. the parameter list of TT depends on earlier parameters. */
3148 if (!same_type_p (tsubst (TREE_TYPE (parm
), outer_args
,
3155 my_friendly_abort (0);
3161 /* Convert the indicated template ARG as necessary to match the
3162 indicated template PARM. Returns the converted ARG, or
3163 error_mark_node if the conversion was unsuccessful. Error messages
3164 are issued if COMPLAIN is non-zero. This conversion is for the Ith
3165 parameter in the parameter list. ARGS is the full set of template
3166 arguments deduced so far. */
3169 convert_template_argument (parm
, arg
, args
, complain
, i
, in_decl
)
3179 int is_type
, requires_type
, is_tmpl_type
, requires_tmpl_type
;
3181 inner_args
= INNERMOST_TEMPLATE_ARGS (args
);
3183 if (TREE_CODE (arg
) == TREE_LIST
3184 && TREE_TYPE (arg
) != NULL_TREE
3185 && TREE_CODE (TREE_TYPE (arg
)) == OFFSET_TYPE
)
3187 /* The template argument was the name of some
3188 member function. That's usually
3189 illegal, but static members are OK. In any
3190 case, grab the underlying fields/functions
3191 and issue an error later if required. */
3192 arg
= TREE_VALUE (arg
);
3193 TREE_TYPE (arg
) = unknown_type_node
;
3196 requires_tmpl_type
= TREE_CODE (parm
) == TEMPLATE_DECL
;
3197 requires_type
= (TREE_CODE (parm
) == TYPE_DECL
3198 || requires_tmpl_type
);
3200 /* Check if it is a class template. If REQUIRES_TMPL_TYPE is true,
3201 we also accept implicitly created TYPE_DECL as a valid argument.
3202 This is necessary to handle the case where we pass a template name
3203 to a template template parameter in a scope where we've derived from
3204 in instantiation of that template, so the template name refers to that
3205 instantiation. We really ought to handle this better. */
3207 = ((TREE_CODE (arg
) == TEMPLATE_DECL
3208 && TREE_CODE (DECL_TEMPLATE_RESULT (arg
)) == TYPE_DECL
)
3209 || (TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
3210 && !TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (arg
))
3211 || (TREE_CODE (arg
) == RECORD_TYPE
3212 && CLASSTYPE_TEMPLATE_INFO (arg
)
3213 && TREE_CODE (TYPE_NAME (arg
)) == TYPE_DECL
3214 && DECL_ARTIFICIAL (TYPE_NAME (arg
))
3215 && requires_tmpl_type
3216 && is_base_of_enclosing_class (arg
, current_class_type
)));
3217 if (is_tmpl_type
&& TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
)
3218 arg
= TYPE_STUB_DECL (arg
);
3219 else if (is_tmpl_type
&& TREE_CODE (arg
) == RECORD_TYPE
)
3220 arg
= CLASSTYPE_TI_TEMPLATE (arg
);
3222 is_type
= TYPE_P (arg
) || is_tmpl_type
;
3224 if (requires_type
&& ! is_type
&& TREE_CODE (arg
) == SCOPE_REF
3225 && TREE_CODE (TREE_OPERAND (arg
, 0)) == TEMPLATE_TYPE_PARM
)
3227 cp_pedwarn ("to refer to a type member of a template parameter, use `typename %E'", arg
);
3229 arg
= make_typename_type (TREE_OPERAND (arg
, 0),
3230 TREE_OPERAND (arg
, 1),
3234 if (is_type
!= requires_type
)
3240 cp_error ("type/value mismatch at argument %d in template parameter list for `%D'",
3243 cp_error (" expected a constant of type `%T', got `%T'",
3245 (is_tmpl_type
? DECL_NAME (arg
) : arg
));
3247 cp_error (" expected a type, got `%E'", arg
);
3250 return error_mark_node
;
3252 if (is_tmpl_type
^ requires_tmpl_type
)
3254 if (in_decl
&& complain
)
3256 cp_error ("type/value mismatch at argument %d in template parameter list for `%D'",
3259 cp_error (" expected a type, got `%T'", DECL_NAME (arg
));
3261 cp_error (" expected a class template, got `%T'", arg
);
3263 return error_mark_node
;
3268 if (requires_tmpl_type
)
3270 tree parmparm
= DECL_INNERMOST_TEMPLATE_PARMS (parm
);
3271 tree argparm
= DECL_INNERMOST_TEMPLATE_PARMS (arg
);
3273 if (coerce_template_template_parms (parmparm
, argparm
, complain
,
3274 in_decl
, inner_args
))
3278 /* TEMPLATE_TEMPLATE_PARM node is preferred over
3280 if (val
!= error_mark_node
3281 && DECL_TEMPLATE_TEMPLATE_PARM_P (val
))
3282 val
= TREE_TYPE (val
);
3286 if (in_decl
&& complain
)
3288 cp_error ("type/value mismatch at argument %d in template parameter list for `%D'",
3290 cp_error (" expected a template of type `%D', got `%D'", parm
, arg
);
3293 val
= error_mark_node
;
3298 val
= groktypename (arg
);
3299 if (! processing_template_decl
)
3301 /* [basic.link]: A name with no linkage (notably, the
3302 name of a class or enumeration declared in a local
3303 scope) shall not be used to declare an entity with
3304 linkage. This implies that names with no linkage
3305 cannot be used as template arguments. */
3306 tree t
= no_linkage_check (val
);
3309 if (ANON_AGGRNAME_P (TYPE_IDENTIFIER (t
)))
3311 ("template-argument `%T' uses anonymous type", val
);
3314 ("template-argument `%T' uses local type `%T'",
3316 return error_mark_node
;
3323 tree t
= tsubst (TREE_TYPE (parm
), args
, complain
, in_decl
);
3325 if (processing_template_decl
)
3326 arg
= maybe_fold_nontype_arg (arg
);
3328 if (!uses_template_parms (arg
) && !uses_template_parms (t
))
3329 /* We used to call digest_init here. However, digest_init
3330 will report errors, which we don't want when complain
3331 is zero. More importantly, digest_init will try too
3332 hard to convert things: for example, `0' should not be
3333 converted to pointer type at this point according to
3334 the standard. Accepting this is not merely an
3335 extension, since deciding whether or not these
3336 conversions can occur is part of determining which
3337 function template to call, or whether a given epxlicit
3338 argument specification is legal. */
3339 val
= convert_nontype_argument (t
, arg
);
3343 if (val
== NULL_TREE
)
3344 val
= error_mark_node
;
3345 else if (val
== error_mark_node
&& complain
)
3346 cp_error ("could not convert template argument `%E' to `%T'",
3353 /* Convert all template arguments to their appropriate types, and
3354 return a vector containing the innermost resulting template
3355 arguments. If any error occurs, return error_mark_node, and, if
3356 COMPLAIN is non-zero, issue an error message. Some error messages
3357 are issued even if COMPLAIN is zero; for instance, if a template
3358 argument is composed from a local class.
3360 If REQUIRE_ALL_ARGUMENTS is non-zero, all arguments must be
3361 provided in ARGLIST, or else trailing parameters must have default
3362 values. If REQUIRE_ALL_ARGUMENTS is zero, we will attempt argument
3363 deduction for any unspecified trailing arguments. */
3366 coerce_template_parms (parms
, args
, in_decl
,
3368 require_all_arguments
)
3372 int require_all_arguments
;
3374 int nparms
, nargs
, i
, lost
= 0;
3377 tree new_inner_args
;
3379 inner_args
= INNERMOST_TEMPLATE_ARGS (args
);
3380 nargs
= NUM_TMPL_ARGS (inner_args
);
3381 nparms
= TREE_VEC_LENGTH (parms
);
3385 && require_all_arguments
3386 && TREE_PURPOSE (TREE_VEC_ELT (parms
, nargs
)) == NULL_TREE
))
3390 cp_error ("wrong number of template arguments (%d, should be %d)",
3394 cp_error_at ("provided for `%D'", in_decl
);
3397 return error_mark_node
;
3400 new_inner_args
= make_tree_vec (nparms
);
3401 new_args
= add_outermost_template_args (args
, new_inner_args
);
3402 for (i
= 0; i
< nparms
; i
++)
3407 /* Get the Ith template parameter. */
3408 parm
= TREE_VEC_ELT (parms
, i
);
3410 /* Calculate the Ith argument. */
3411 if (inner_args
&& TREE_CODE (inner_args
) == TREE_LIST
)
3413 arg
= TREE_VALUE (inner_args
);
3414 inner_args
= TREE_CHAIN (inner_args
);
3417 arg
= TREE_VEC_ELT (inner_args
, i
);
3418 /* If no template argument was supplied, look for a default
3420 else if (TREE_PURPOSE (parm
) == NULL_TREE
)
3422 /* There was no default value. */
3423 my_friendly_assert (!require_all_arguments
, 0);
3426 else if (TREE_CODE (TREE_VALUE (parm
)) == TYPE_DECL
)
3427 arg
= tsubst (TREE_PURPOSE (parm
), new_args
, complain
, in_decl
);
3429 arg
= tsubst_expr (TREE_PURPOSE (parm
), new_args
, complain
,
3432 /* Now, convert the Ith argument, as necessary. */
3433 if (arg
== NULL_TREE
)
3434 /* We're out of arguments. */
3436 my_friendly_assert (!require_all_arguments
, 0);
3439 else if (arg
== error_mark_node
)
3441 cp_error ("template argument %d is invalid", i
+ 1);
3442 arg
= error_mark_node
;
3445 arg
= convert_template_argument (TREE_VALUE (parm
),
3446 arg
, new_args
, complain
, i
,
3449 if (arg
== error_mark_node
)
3451 TREE_VEC_ELT (new_inner_args
, i
) = arg
;
3455 return error_mark_node
;
3457 return new_inner_args
;
3460 /* Returns 1 if template args OT and NT are equivalent. */
3463 template_args_equal (ot
, nt
)
3468 if (TREE_CODE (nt
) != TREE_CODE (ot
))
3470 if (TREE_CODE (nt
) == TREE_VEC
)
3471 /* For member templates */
3472 return comp_template_args (ot
, nt
);
3473 else if (TYPE_P (ot
))
3474 return same_type_p (ot
, nt
);
3476 return (cp_tree_equal (ot
, nt
) > 0);
3479 /* Returns 1 iff the OLDARGS and NEWARGS are in fact identical sets
3480 of template arguments. Returns 0 otherwise. */
3483 comp_template_args (oldargs
, newargs
)
3484 tree oldargs
, newargs
;
3488 if (TREE_VEC_LENGTH (oldargs
) != TREE_VEC_LENGTH (newargs
))
3491 for (i
= 0; i
< TREE_VEC_LENGTH (oldargs
); ++i
)
3493 tree nt
= TREE_VEC_ELT (newargs
, i
);
3494 tree ot
= TREE_VEC_ELT (oldargs
, i
);
3496 if (! template_args_equal (ot
, nt
))
3502 /* Given class template name and parameter list, produce a user-friendly name
3503 for the instantiation. */
3506 mangle_class_name_for_template (name
, parms
, arglist
)
3508 tree parms
, arglist
;
3510 static struct obstack scratch_obstack
;
3511 static char *scratch_firstobj
;
3514 if (!scratch_firstobj
)
3515 gcc_obstack_init (&scratch_obstack
);
3517 obstack_free (&scratch_obstack
, scratch_firstobj
);
3518 scratch_firstobj
= obstack_alloc (&scratch_obstack
, 1);
3520 #define ccat(c) obstack_1grow (&scratch_obstack, (c));
3521 #define cat(s) obstack_grow (&scratch_obstack, (s), strlen (s))
3525 nparms
= TREE_VEC_LENGTH (parms
);
3526 arglist
= INNERMOST_TEMPLATE_ARGS (arglist
);
3527 my_friendly_assert (nparms
== TREE_VEC_LENGTH (arglist
), 268);
3528 for (i
= 0; i
< nparms
; i
++)
3530 tree parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
3531 tree arg
= TREE_VEC_ELT (arglist
, i
);
3536 if (TREE_CODE (parm
) == TYPE_DECL
)
3538 cat (type_as_string (arg
, TS_CHASE_TYPEDEFS
));
3541 else if (TREE_CODE (parm
) == TEMPLATE_DECL
)
3543 if (TREE_CODE (arg
) == TEMPLATE_DECL
)
3545 /* Already substituted with real template. Just output
3546 the template name here */
3547 tree context
= DECL_CONTEXT (arg
);
3550 /* The template may be defined in a namespace, or
3551 may be a member template. */
3552 my_friendly_assert (TREE_CODE (context
) == NAMESPACE_DECL
3553 || CLASS_TYPE_P (context
),
3555 cat(decl_as_string (DECL_CONTEXT (arg
), 0));
3558 cat (IDENTIFIER_POINTER (DECL_NAME (arg
)));
3561 /* Output the parameter declaration */
3562 cat (type_as_string (arg
, TS_CHASE_TYPEDEFS
));
3566 my_friendly_assert (TREE_CODE (parm
) == PARM_DECL
, 269);
3568 if (TREE_CODE (arg
) == TREE_LIST
)
3570 /* New list cell was built because old chain link was in
3572 my_friendly_assert (TREE_PURPOSE (arg
) == NULL_TREE
, 270);
3573 arg
= TREE_VALUE (arg
);
3575 /* No need to check arglist against parmlist here; we did that
3576 in coerce_template_parms, called from lookup_template_class. */
3577 cat (expr_as_string (arg
, 0));
3580 char *bufp
= obstack_next_free (&scratch_obstack
);
3582 while (bufp
[offset
- 1] == ' ')
3584 obstack_blank_fast (&scratch_obstack
, offset
);
3586 /* B<C<char> >, not B<C<char>> */
3587 if (bufp
[offset
- 1] == '>')
3592 return (char *) obstack_base (&scratch_obstack
);
3596 classtype_mangled_name (t
)
3599 if (CLASSTYPE_TEMPLATE_INFO (t
)
3600 /* Specializations have already had their names set up in
3601 lookup_template_class. */
3602 && !CLASSTYPE_TEMPLATE_SPECIALIZATION (t
))
3604 tree tmpl
= most_general_template (CLASSTYPE_TI_TEMPLATE (t
));
3606 /* For non-primary templates, the template parameters are
3607 implicit from their surrounding context. */
3608 if (PRIMARY_TEMPLATE_P (tmpl
))
3610 tree name
= DECL_NAME (tmpl
);
3611 char *mangled_name
= mangle_class_name_for_template
3612 (IDENTIFIER_POINTER (name
),
3613 DECL_INNERMOST_TEMPLATE_PARMS (tmpl
),
3614 CLASSTYPE_TI_ARGS (t
));
3615 tree id
= get_identifier (mangled_name
);
3616 IDENTIFIER_TEMPLATE (id
) = name
;
3621 return TYPE_IDENTIFIER (t
);
3625 add_pending_template (d
)
3628 tree ti
= (TYPE_P (d
)
3629 ? CLASSTYPE_TEMPLATE_INFO (d
)
3630 : DECL_TEMPLATE_INFO (d
));
3633 if (TI_PENDING_TEMPLATE_FLAG (ti
))
3636 /* We are called both from instantiate_decl, where we've already had a
3637 tinst_level pushed, and instantiate_template, where we haven't.
3639 level
= !(current_tinst_level
&& TINST_DECL (current_tinst_level
) == d
);
3642 push_tinst_level (d
);
3644 *template_tail
= tree_cons (current_tinst_level
, d
, NULL_TREE
);
3645 template_tail
= &TREE_CHAIN (*template_tail
);
3646 TI_PENDING_TEMPLATE_FLAG (ti
) = 1;
3653 /* Return a TEMPLATE_ID_EXPR corresponding to the indicated FNS (which
3654 may be either a _DECL or an overloaded function or an
3655 IDENTIFIER_NODE), and ARGLIST. */
3658 lookup_template_function (fns
, arglist
)
3663 if (fns
== NULL_TREE
)
3665 cp_error ("non-template used as template");
3666 return error_mark_node
;
3669 type
= TREE_TYPE (fns
);
3670 if (TREE_CODE (fns
) == OVERLOAD
|| !type
)
3671 type
= unknown_type_node
;
3673 if (processing_template_decl
)
3674 return build_min (TEMPLATE_ID_EXPR
, type
, fns
, arglist
);
3676 return build (TEMPLATE_ID_EXPR
, type
, fns
, arglist
);
3679 /* Within the scope of a template class S<T>, the name S gets bound
3680 (in build_self_reference) to a TYPE_DECL for the class, not a
3681 TEMPLATE_DECL. If DECL is a TYPE_DECL for current_class_type,
3682 or one of its enclosing classes, and that type is a template,
3683 return the associated TEMPLATE_DECL. Otherwise, the original
3684 DECL is returned. */
3687 maybe_get_template_decl_from_type_decl (decl
)
3690 return (decl
!= NULL_TREE
3691 && TREE_CODE (decl
) == TYPE_DECL
3692 && DECL_ARTIFICIAL (decl
)
3693 && CLASS_TYPE_P (TREE_TYPE (decl
))
3694 && CLASSTYPE_TEMPLATE_INFO (TREE_TYPE (decl
)))
3695 ? CLASSTYPE_TI_TEMPLATE (TREE_TYPE (decl
)) : decl
;
3698 /* Given an IDENTIFIER_NODE (type TEMPLATE_DECL) and a chain of
3699 parameters, find the desired type.
3701 D1 is the PTYPENAME terminal, and ARGLIST is the list of arguments.
3702 (Actually ARGLIST may be either a TREE_LIST or a TREE_VEC. It will
3703 be a TREE_LIST if called directly from the parser, and a TREE_VEC
3704 otherwise.) Since ARGLIST is build on the temp_decl_obstack, we must
3705 copy it here to keep it from being reclaimed when the decl storage
3708 IN_DECL, if non-NULL, is the template declaration we are trying to
3711 If ENTERING_SCOPE is non-zero, we are about to enter the scope of
3712 the class we are looking up.
3714 If the template class is really a local class in a template
3715 function, then the FUNCTION_CONTEXT is the function in which it is
3716 being instantiated. */
3719 lookup_template_class (d1
, arglist
, in_decl
, context
, entering_scope
)
3725 tree
template = NULL_TREE
, parmlist
;
3728 if (TREE_CODE (d1
) == IDENTIFIER_NODE
)
3730 if (IDENTIFIER_VALUE (d1
)
3731 && DECL_TEMPLATE_TEMPLATE_PARM_P (IDENTIFIER_VALUE (d1
)))
3732 template = IDENTIFIER_VALUE (d1
);
3736 push_decl_namespace (context
);
3737 template = lookup_name (d1
, /*prefer_type=*/0);
3738 template = maybe_get_template_decl_from_type_decl (template);
3740 pop_decl_namespace ();
3743 context
= DECL_CONTEXT (template);
3745 else if (TREE_CODE (d1
) == TYPE_DECL
&& IS_AGGR_TYPE (TREE_TYPE (d1
)))
3747 tree type
= TREE_TYPE (d1
);
3749 /* If we are declaring a constructor, say A<T>::A<T>, we will get
3750 an implicit typename for the second A. Deal with it. */
3751 if (TREE_CODE (type
) == TYPENAME_TYPE
&& TREE_TYPE (type
))
3752 type
= TREE_TYPE (type
);
3754 if (CLASSTYPE_TEMPLATE_INFO (type
))
3756 template = CLASSTYPE_TI_TEMPLATE (type
);
3757 d1
= DECL_NAME (template);
3760 else if (TREE_CODE (d1
) == ENUMERAL_TYPE
3761 || (TYPE_P (d1
) && IS_AGGR_TYPE (d1
)))
3763 template = TYPE_TI_TEMPLATE (d1
);
3764 d1
= DECL_NAME (template);
3766 else if (TREE_CODE (d1
) == TEMPLATE_DECL
3767 && TREE_CODE (DECL_TEMPLATE_RESULT (d1
)) == TYPE_DECL
)
3770 d1
= DECL_NAME (template);
3771 context
= DECL_CONTEXT (template);
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
3778 crash. Alternatively D1 might not be a template type at all. */
3781 cp_error ("`%T' is not a template", d1
);
3782 return error_mark_node
;
3785 if (TREE_CODE (template) != TEMPLATE_DECL
)
3787 cp_error ("non-template type `%T' used as a template", d1
);
3789 cp_error_at ("for template declaration `%D'", in_decl
);
3790 return error_mark_node
;
3793 if (DECL_TEMPLATE_TEMPLATE_PARM_P (template))
3795 /* Create a new TEMPLATE_DECL and TEMPLATE_TEMPLATE_PARM node to store
3796 template arguments */
3801 parmlist
= DECL_INNERMOST_TEMPLATE_PARMS (template);
3803 arglist2
= coerce_template_parms (parmlist
, arglist
, template, 1, 1);
3804 if (arglist2
== error_mark_node
)
3805 return error_mark_node
;
3807 parm
= copy_template_template_parm (TREE_TYPE (template), arglist2
);
3808 TYPE_SIZE (parm
) = 0;
3813 tree template_type
= TREE_TYPE (template);
3816 tree found
= NULL_TREE
;
3819 int is_partial_instantiation
;
3821 gen_tmpl
= most_general_template (template);
3822 parmlist
= DECL_TEMPLATE_PARMS (gen_tmpl
);
3823 parm_depth
= TMPL_PARMS_DEPTH (parmlist
);
3824 arg_depth
= TMPL_ARGS_DEPTH (arglist
);
3826 if (arg_depth
== 1 && parm_depth
> 1)
3828 /* We've been given an incomplete set of template arguments.
3831 template <class T> struct S1 {
3832 template <class U> struct S2 {};
3833 template <class U> struct S2<U*> {};
3836 we will be called with an ARGLIST of `U*', but the
3837 TEMPLATE will be `template <class T> template
3838 <class U> struct S1<T>::S2'. We must fill in the missing
3841 = add_outermost_template_args (TYPE_TI_ARGS (TREE_TYPE (template)),
3843 arg_depth
= TMPL_ARGS_DEPTH (arglist
);
3846 /* Now we should enough arguments. */
3847 my_friendly_assert (parm_depth
== arg_depth
, 0);
3849 /* From here on, we're only interested in the most general
3851 template = gen_tmpl
;
3853 /* Calculate the BOUND_ARGS. These will be the args that are
3854 actually tsubst'd into the definition to create the
3858 /* We have multiple levels of arguments to coerce, at once. */
3860 int saved_depth
= TMPL_ARGS_DEPTH (arglist
);
3862 tree bound_args
= make_tree_vec (parm_depth
);
3864 for (i
= saved_depth
,
3865 t
= DECL_TEMPLATE_PARMS (template);
3866 i
> 0 && t
!= NULL_TREE
;
3867 --i
, t
= TREE_CHAIN (t
))
3869 tree a
= coerce_template_parms (TREE_VALUE (t
),
3870 arglist
, template, 1, 1);
3871 SET_TMPL_ARGS_LEVEL (bound_args
, i
, a
);
3873 /* We temporarily reduce the length of the ARGLIST so
3874 that coerce_template_parms will see only the arguments
3875 corresponding to the template parameters it is
3877 TREE_VEC_LENGTH (arglist
)--;
3880 /* Restore the ARGLIST to its full size. */
3881 TREE_VEC_LENGTH (arglist
) = saved_depth
;
3883 arglist
= bound_args
;
3887 = coerce_template_parms (INNERMOST_TEMPLATE_PARMS (parmlist
),
3888 INNERMOST_TEMPLATE_ARGS (arglist
),
3891 if (arglist
== error_mark_node
)
3892 /* We were unable to bind the arguments. */
3893 return error_mark_node
;
3895 /* In the scope of a template class, explicit references to the
3896 template class refer to the type of the template, not any
3897 instantiation of it. For example, in:
3899 template <class T> class C { void f(C<T>); }
3901 the `C<T>' is just the same as `C'. Outside of the
3902 class, however, such a reference is an instantiation. */
3903 if (comp_template_args (TYPE_TI_ARGS (template_type
),
3906 found
= template_type
;
3908 if (!entering_scope
&& PRIMARY_TEMPLATE_P (template))
3912 /* Note that we use DECL_CONTEXT, rather than
3913 CP_DECL_CONTEXT, so that the termination test is
3914 always just `ctx'. We're not interested in namepace
3916 for (ctx
= current_class_type
;
3918 ctx
= (TYPE_P (ctx
)) ? TYPE_CONTEXT (ctx
) : DECL_CONTEXT (ctx
))
3919 if (same_type_p (ctx
, template_type
))
3923 /* We're not in the scope of the class, so the
3924 TEMPLATE_TYPE is not the type we want after
3932 for (found
= DECL_TEMPLATE_INSTANTIATIONS (template);
3933 found
; found
= TREE_CHAIN (found
))
3934 if (comp_template_args (TREE_PURPOSE (found
), arglist
))
3938 found
= TREE_VALUE (found
);
3944 /* This type is a "partial instantiation" if any of the template
3945 arguments still inolve template parameters. Note that we set
3946 IS_PARTIAL_INSTANTIATION for partial specializations as
3948 is_partial_instantiation
= uses_template_parms (arglist
);
3950 if (!is_partial_instantiation
3951 && !PRIMARY_TEMPLATE_P (template)
3952 && TREE_CODE (CP_DECL_CONTEXT (template)) == NAMESPACE_DECL
)
3954 found
= xref_tag_from_type (TREE_TYPE (template),
3955 DECL_NAME (template),
3960 context
= tsubst (DECL_CONTEXT (template), arglist
,
3961 /*complain=*/0, in_decl
);
3963 context
= global_namespace
;
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_P (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 /* We're starting to instantiate D; record the template instantiation context
4298 for diagnostics and to restore it later. */
4301 push_tinst_level (d
)
4306 if (tinst_depth
>= max_tinst_depth
)
4308 /* If the instantiation in question still has unbound template parms,
4309 we don't really care if we can't instantiate it, so just return.
4310 This happens with base instantiation for implicit `typename'. */
4311 if (uses_template_parms (d
))
4314 last_template_error_tick
= tinst_level_tick
;
4315 cp_error ("template instantiation depth exceeds maximum of %d (use -ftemplate-depth-NN to increase the maximum) instantiating `%D'",
4316 max_tinst_depth
, d
);
4318 print_instantiation_context ();
4323 new = build_expr_wfl (d
, input_filename
, lineno
, 0);
4324 TREE_CHAIN (new) = current_tinst_level
;
4325 current_tinst_level
= new;
4328 #ifdef GATHER_STATISTICS
4329 if (tinst_depth
> depth_reached
)
4330 depth_reached
= tinst_depth
;
4337 /* We're done instantiating this template; return to the instantiation
4343 tree old
= current_tinst_level
;
4345 /* Restore the filename and line number stashed away when we started
4346 this instantiation. */
4347 lineno
= TINST_LINE (old
);
4348 input_filename
= TINST_FILE (old
);
4349 extract_interface_info ();
4351 current_tinst_level
= TREE_CHAIN (old
);
4356 /* We're instantiating a deferred template; restore the template
4357 instantiation context in which the instantiation was requested, which
4358 is one step out from LEVEL. */
4361 reopen_tinst_level (level
)
4367 for (t
= level
; t
; t
= TREE_CHAIN (t
))
4370 current_tinst_level
= level
;
4374 /* Return the outermost template instantiation context, for use with
4375 -falt-external-templates. */
4380 tree p
= current_tinst_level
;
4383 for (; TREE_CHAIN (p
) ; p
= TREE_CHAIN (p
))
4388 /* DECL is a friend FUNCTION_DECL or TEMPLATE_DECL. ARGS is the
4389 vector of template arguments, as for tsubst.
4391 Returns an appropriate tsbust'd friend declaration. */
4394 tsubst_friend_function (decl
, args
)
4400 const char *file
= input_filename
;
4402 lineno
= DECL_SOURCE_LINE (decl
);
4403 input_filename
= DECL_SOURCE_FILE (decl
);
4405 if (TREE_CODE (decl
) == FUNCTION_DECL
4406 && DECL_TEMPLATE_INSTANTIATION (decl
)
4407 && TREE_CODE (DECL_TI_TEMPLATE (decl
)) != TEMPLATE_DECL
)
4408 /* This was a friend declared with an explicit template
4409 argument list, e.g.:
4413 to indicate that f was a template instantiation, not a new
4414 function declaration. Now, we have to figure out what
4415 instantiation of what template. */
4422 = lookup_template_function (tsubst_expr (DECL_TI_TEMPLATE (decl
),
4423 args
, /*complain=*/1,
4425 tsubst (DECL_TI_ARGS (decl
),
4426 args
, /*complain=*/1,
4428 new_friend
= tsubst (decl
, args
, /*complain=*/1, NULL_TREE
);
4429 tmpl
= determine_specialization (template_id
, new_friend
,
4431 /*need_member_template=*/0);
4432 new_friend
= instantiate_template (tmpl
, new_args
);
4436 new_friend
= tsubst (decl
, args
, /*complain=*/1, NULL_TREE
);
4438 /* The NEW_FRIEND will look like an instantiation, to the
4439 compiler, but is not an instantiation from the point of view of
4440 the language. For example, we might have had:
4442 template <class T> struct S {
4443 template <class U> friend void f(T, U);
4446 Then, in S<int>, template <class U> void f(int, U) is not an
4447 instantiation of anything. */
4448 DECL_USE_TEMPLATE (new_friend
) = 0;
4449 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
4451 DECL_USE_TEMPLATE (DECL_TEMPLATE_RESULT (new_friend
)) = 0;
4452 DECL_SAVED_TREE (DECL_TEMPLATE_RESULT (new_friend
))
4453 = DECL_SAVED_TREE (DECL_TEMPLATE_RESULT (decl
));
4456 /* The mangled name for the NEW_FRIEND is incorrect. The call to
4457 tsubst will have resulted in a call to
4458 set_mangled_name_for_template_decl. But, the function is not a
4459 template instantiation and should not be mangled like one.
4460 Therefore, we remangle the function name. We don't have to do
4461 this if the NEW_FRIEND is a template since
4462 set_mangled_name_for_template_decl doesn't do anything if the
4463 function declaration still uses template arguments. */
4464 if (TREE_CODE (new_friend
) != TEMPLATE_DECL
)
4466 set_mangled_name_for_decl (new_friend
);
4467 DECL_RTL (new_friend
) = 0;
4468 make_decl_rtl (new_friend
, NULL_PTR
, 1);
4471 if (DECL_NAMESPACE_SCOPE_P (new_friend
))
4474 tree new_friend_template_info
;
4475 tree new_friend_result_template_info
;
4477 int new_friend_is_defn
;
4479 /* We must save some information from NEW_FRIEND before calling
4480 duplicate decls since that function will free NEW_FRIEND if
4482 new_friend_template_info
= DECL_TEMPLATE_INFO (new_friend
);
4483 if (TREE_CODE (new_friend
) == TEMPLATE_DECL
)
4485 /* This declaration is a `primary' template. */
4486 DECL_PRIMARY_TEMPLATE (new_friend
) = new_friend
;
4489 = DECL_INITIAL (DECL_TEMPLATE_RESULT (new_friend
)) != NULL_TREE
;
4490 new_friend_result_template_info
4491 = DECL_TEMPLATE_INFO (DECL_TEMPLATE_RESULT (new_friend
));
4495 new_friend_is_defn
= DECL_INITIAL (new_friend
) != NULL_TREE
;
4496 new_friend_result_template_info
= NULL_TREE
;
4499 /* Inside pushdecl_namespace_level, we will push into the
4500 current namespace. However, the friend function should go
4501 into the namespace of the template. */
4502 ns
= decl_namespace_context (new_friend
);
4503 push_nested_namespace (ns
);
4504 old_decl
= pushdecl_namespace_level (new_friend
);
4505 pop_nested_namespace (ns
);
4507 if (old_decl
!= new_friend
)
4509 /* This new friend declaration matched an existing
4510 declaration. For example, given:
4512 template <class T> void f(T);
4513 template <class U> class C {
4514 template <class T> friend void f(T) {}
4517 the friend declaration actually provides the definition
4518 of `f', once C has been instantiated for some type. So,
4519 old_decl will be the out-of-class template declaration,
4520 while new_friend is the in-class definition.
4522 But, if `f' was called before this point, the
4523 instantiation of `f' will have DECL_TI_ARGS corresponding
4524 to `T' but not to `U', references to which might appear
4525 in the definition of `f'. Previously, the most general
4526 template for an instantiation of `f' was the out-of-class
4527 version; now it is the in-class version. Therefore, we
4528 run through all specialization of `f', adding to their
4529 DECL_TI_ARGS appropriately. In particular, they need a
4530 new set of outer arguments, corresponding to the
4531 arguments for this class instantiation.
4533 The same situation can arise with something like this:
4536 template <class T> class C {
4540 when `C<int>' is instantiated. Now, `f(int)' is defined
4543 if (!new_friend_is_defn
)
4544 /* On the other hand, if the in-class declaration does
4545 *not* provide a definition, then we don't want to alter
4546 existing definitions. We can just leave everything
4551 /* Overwrite whatever template info was there before, if
4552 any, with the new template information pertaining to
4554 DECL_TEMPLATE_INFO (old_decl
) = new_friend_template_info
;
4556 if (TREE_CODE (old_decl
) != TEMPLATE_DECL
)
4557 /* duplicate_decls will take care of this case. */
4562 tree new_friend_args
;
4564 DECL_TEMPLATE_INFO (DECL_TEMPLATE_RESULT (old_decl
))
4565 = new_friend_result_template_info
;
4567 new_friend_args
= TI_ARGS (new_friend_template_info
);
4568 for (t
= DECL_TEMPLATE_SPECIALIZATIONS (old_decl
);
4572 tree spec
= TREE_VALUE (t
);
4575 = add_outermost_template_args (new_friend_args
,
4576 DECL_TI_ARGS (spec
));
4579 /* Now, since specializations are always supposed to
4580 hang off of the most general template, we must move
4582 t
= most_general_template (old_decl
);
4585 DECL_TEMPLATE_SPECIALIZATIONS (t
)
4586 = chainon (DECL_TEMPLATE_SPECIALIZATIONS (t
),
4587 DECL_TEMPLATE_SPECIALIZATIONS (old_decl
));
4588 DECL_TEMPLATE_SPECIALIZATIONS (old_decl
) = NULL_TREE
;
4593 /* The information from NEW_FRIEND has been merged into OLD_DECL
4594 by duplicate_decls. */
4595 new_friend
= old_decl
;
4598 else if (COMPLETE_TYPE_P (DECL_CONTEXT (new_friend
)))
4600 /* Check to see that the declaration is really present, and,
4601 possibly obtain an improved declaration. */
4602 tree fn
= check_classfn (DECL_CONTEXT (new_friend
),
4611 input_filename
= file
;
4615 /* FRIEND_TMPL is a friend TEMPLATE_DECL. ARGS is the vector of
4616 template arguments, as for tsubst.
4618 Returns an appropriate tsbust'd friend type or error_mark_node on
4622 tsubst_friend_class (friend_tmpl
, args
)
4629 /* First, we look for a class template. */
4630 tmpl
= lookup_name (DECL_NAME (friend_tmpl
), /*prefer_type=*/0);
4632 /* But, if we don't find one, it might be because we're in a
4633 situation like this:
4641 Here, in the scope of (say) S<int>, `S' is bound to a TYPE_DECL
4642 for `S<int>', not the TEMPLATE_DECL. */
4643 if (!tmpl
|| !DECL_CLASS_TEMPLATE_P (tmpl
))
4645 tmpl
= lookup_name (DECL_NAME (friend_tmpl
), /*prefer_type=*/1);
4646 tmpl
= maybe_get_template_decl_from_type_decl (tmpl
);
4649 if (tmpl
&& DECL_CLASS_TEMPLATE_P (tmpl
))
4651 /* The friend template has already been declared. Just
4652 check to see that the declarations match, and install any new
4653 default parameters. We must tsubst the default parameters,
4654 of course. We only need the innermost template parameters
4655 because that is all that redeclare_class_template will look
4658 = tsubst_template_parms (DECL_TEMPLATE_PARMS (friend_tmpl
),
4659 args
, /*complain=*/1);
4661 return error_mark_node
;
4662 redeclare_class_template (TREE_TYPE (tmpl
), parms
);
4663 friend_type
= TREE_TYPE (tmpl
);
4667 /* The friend template has not already been declared. In this
4668 case, the instantiation of the template class will cause the
4669 injection of this template into the global scope. */
4670 tmpl
= tsubst (friend_tmpl
, args
, /*complain=*/1, NULL_TREE
);
4672 /* The new TMPL is not an instantiation of anything, so we
4673 forget its origins. We don't reset CLASSTYPE_TI_TEMPLATE for
4674 the new type because that is supposed to be the corresponding
4675 template decl, i.e., TMPL. */
4676 DECL_USE_TEMPLATE (tmpl
) = 0;
4677 DECL_TEMPLATE_INFO (tmpl
) = NULL_TREE
;
4678 CLASSTYPE_USE_TEMPLATE (TREE_TYPE (tmpl
)) = 0;
4680 /* Inject this template into the global scope. */
4681 friend_type
= TREE_TYPE (pushdecl_top_level (tmpl
));
4688 instantiate_class_template (type
)
4691 tree
template, args
, pattern
, t
;
4694 if (type
== error_mark_node
)
4695 return error_mark_node
;
4697 if (TYPE_BEING_DEFINED (type
) || COMPLETE_TYPE_P (type
))
4700 /* Figure out which template is being instantiated. */
4701 template = most_general_template (CLASSTYPE_TI_TEMPLATE (type
));
4702 my_friendly_assert (TREE_CODE (template) == TEMPLATE_DECL
, 279);
4704 /* Figure out which arguments are being used to do the
4706 args
= CLASSTYPE_TI_ARGS (type
);
4707 PARTIAL_INSTANTIATION_P (type
) = uses_template_parms (args
);
4709 if (pedantic
&& PARTIAL_INSTANTIATION_P (type
))
4710 /* If this is a partial instantiation, then we can't instantiate
4711 the type; there's no telling whether or not one of the
4712 template parameters might eventually be instantiated to some
4713 value that results in a specialization being used. For
4725 Now, the `S<U>' in `f<int>' is the specialization, not an
4726 instantiation of the original template. */
4729 /* Determine what specialization of the original template to
4731 if (PARTIAL_INSTANTIATION_P (type
))
4732 /* There's no telling which specialization is appropriate at this
4733 point. Since all peeking at the innards of this partial
4734 instantiation are extensions (like the "implicit typename"
4735 extension, which allows users to omit the keyword `typename' on
4736 names that are declared as types in template base classes), we
4737 are free to do what we please.
4739 Trying to figure out which partial instantiation to use can
4740 cause a crash. (Some of the template arguments don't even have
4741 types.) So, we just use the most general version. */
4745 t
= most_specialized_class (template, args
);
4747 if (t
== error_mark_node
)
4749 const char *str
= "candidates are:";
4750 cp_error ("ambiguous class template instantiation for `%#T'", type
);
4751 for (t
= DECL_TEMPLATE_SPECIALIZATIONS (template); t
;
4754 if (get_class_bindings (TREE_VALUE (t
), TREE_PURPOSE (t
),
4757 cp_error_at ("%s %+#T", str
, TREE_TYPE (t
));
4761 TYPE_BEING_DEFINED (type
) = 1;
4762 return error_mark_node
;
4767 pattern
= TREE_TYPE (t
);
4769 pattern
= TREE_TYPE (template);
4771 /* If the template we're instantiating is incomplete, then clearly
4772 there's nothing we can do. */
4773 if (!COMPLETE_TYPE_P (pattern
))
4776 /* If this is a partial instantiation, don't tsubst anything. We will
4777 only use this type for implicit typename, so the actual contents don't
4778 matter. All that matters is whether a particular name is a type. */
4779 if (PARTIAL_INSTANTIATION_P (type
))
4781 /* The fields set here must be kept in sync with those cleared
4782 in begin_class_definition. */
4783 TYPE_BINFO_BASETYPES (type
) = TYPE_BINFO_BASETYPES (pattern
);
4784 TYPE_FIELDS (type
) = TYPE_FIELDS (pattern
);
4785 TYPE_METHODS (type
) = TYPE_METHODS (pattern
);
4786 CLASSTYPE_TAGS (type
) = CLASSTYPE_TAGS (pattern
);
4787 CLASSTYPE_VBASECLASSES (type
) = CLASSTYPE_VBASECLASSES (pattern
);
4789 /* Pretend that the type is complete, so that we will look
4790 inside it during name lookup and such. */
4791 TYPE_SIZE (type
) = bitsize_zero_node
;
4795 /* If we've recursively instantiated too many templates, stop. */
4796 if (! push_tinst_level (type
))
4799 /* Now we're really doing the instantiation. Mark the type as in
4800 the process of being defined. */
4801 TYPE_BEING_DEFINED (type
) = 1;
4803 maybe_push_to_top_level (uses_template_parms (type
));
4807 /* This TYPE is actually a instantiation of of a partial
4808 specialization. We replace the innermost set of ARGS with
4809 the arguments appropriate for substitution. For example,
4812 template <class T> struct S {};
4813 template <class T> struct S<T*> {};
4815 and supposing that we are instantiating S<int*>, ARGS will
4816 present be {int*} but we need {int}. */
4818 = get_class_bindings (TREE_VALUE (t
), TREE_PURPOSE (t
),
4821 /* If there were multiple levels in ARGS, replacing the
4822 innermost level would alter CLASSTYPE_TI_ARGS, which we don't
4823 want, so we make a copy first. */
4824 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (args
))
4826 args
= copy_node (args
);
4827 SET_TMPL_ARGS_LEVEL (args
, TMPL_ARGS_DEPTH (args
), inner_args
);
4833 if (flag_external_templates
)
4835 if (flag_alt_external_templates
)
4837 CLASSTYPE_INTERFACE_ONLY (type
) = interface_only
;
4838 SET_CLASSTYPE_INTERFACE_UNKNOWN_X (type
, interface_unknown
);
4839 CLASSTYPE_VTABLE_NEEDS_WRITING (type
)
4840 = (! CLASSTYPE_INTERFACE_ONLY (type
)
4841 && CLASSTYPE_INTERFACE_KNOWN (type
));
4845 CLASSTYPE_INTERFACE_ONLY (type
) = CLASSTYPE_INTERFACE_ONLY (pattern
);
4846 SET_CLASSTYPE_INTERFACE_UNKNOWN_X
4847 (type
, CLASSTYPE_INTERFACE_UNKNOWN (pattern
));
4848 CLASSTYPE_VTABLE_NEEDS_WRITING (type
)
4849 = (! CLASSTYPE_INTERFACE_ONLY (type
)
4850 && CLASSTYPE_INTERFACE_KNOWN (type
));
4855 SET_CLASSTYPE_INTERFACE_UNKNOWN (type
);
4856 CLASSTYPE_VTABLE_NEEDS_WRITING (type
) = 1;
4859 TYPE_HAS_CONSTRUCTOR (type
) = TYPE_HAS_CONSTRUCTOR (pattern
);
4860 TYPE_HAS_DESTRUCTOR (type
) = TYPE_HAS_DESTRUCTOR (pattern
);
4861 TYPE_OVERLOADS_CALL_EXPR (type
) = TYPE_OVERLOADS_CALL_EXPR (pattern
);
4862 TYPE_OVERLOADS_ARRAY_REF (type
) = TYPE_OVERLOADS_ARRAY_REF (pattern
);
4863 TYPE_OVERLOADS_ARROW (type
) = TYPE_OVERLOADS_ARROW (pattern
);
4864 TYPE_HAS_NEW_OPERATOR (type
) = TYPE_HAS_NEW_OPERATOR (pattern
);
4865 TYPE_HAS_ARRAY_NEW_OPERATOR (type
) = TYPE_HAS_ARRAY_NEW_OPERATOR (pattern
);
4866 TYPE_GETS_DELETE (type
) = TYPE_GETS_DELETE (pattern
);
4867 TYPE_VEC_DELETE_TAKES_SIZE (type
) = TYPE_VEC_DELETE_TAKES_SIZE (pattern
);
4868 TYPE_HAS_ASSIGN_REF (type
) = TYPE_HAS_ASSIGN_REF (pattern
);
4869 TYPE_HAS_CONST_ASSIGN_REF (type
) = TYPE_HAS_CONST_ASSIGN_REF (pattern
);
4870 TYPE_HAS_ABSTRACT_ASSIGN_REF (type
) = TYPE_HAS_ABSTRACT_ASSIGN_REF (pattern
);
4871 TYPE_HAS_INIT_REF (type
) = TYPE_HAS_INIT_REF (pattern
);
4872 TYPE_HAS_CONST_INIT_REF (type
) = TYPE_HAS_CONST_INIT_REF (pattern
);
4873 TYPE_HAS_DEFAULT_CONSTRUCTOR (type
) = TYPE_HAS_DEFAULT_CONSTRUCTOR (pattern
);
4874 TYPE_HAS_CONVERSION (type
) = TYPE_HAS_CONVERSION (pattern
);
4875 TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (type
)
4876 = TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (pattern
);
4877 TYPE_USES_MULTIPLE_INHERITANCE (type
)
4878 = TYPE_USES_MULTIPLE_INHERITANCE (pattern
);
4879 TYPE_USES_VIRTUAL_BASECLASSES (type
)
4880 = TYPE_USES_VIRTUAL_BASECLASSES (pattern
);
4881 TYPE_PACKED (type
) = TYPE_PACKED (pattern
);
4882 TYPE_ALIGN (type
) = TYPE_ALIGN (pattern
);
4883 TYPE_USER_ALIGN (type
) = TYPE_USER_ALIGN (pattern
);
4884 TYPE_FOR_JAVA (type
) = TYPE_FOR_JAVA (pattern
); /* For libjava's JArray<T> */
4885 if (ANON_AGGR_TYPE_P (pattern
))
4886 SET_ANON_AGGR_TYPE_P (type
);
4888 if (TYPE_BINFO_BASETYPES (pattern
))
4890 tree base_list
= NULL_TREE
;
4891 tree pbases
= TYPE_BINFO_BASETYPES (pattern
);
4894 /* Substitute into each of the bases to determine the actual
4896 for (i
= 0; i
< TREE_VEC_LENGTH (pbases
); ++i
)
4902 pbase
= TREE_VEC_ELT (pbases
, i
);
4904 /* Substitue to figure out the base class. */
4905 base
= tsubst (BINFO_TYPE (pbase
), args
,
4906 /*complain=*/1, NULL_TREE
);
4907 if (base
== error_mark_node
)
4910 /* Calculate the correct access node. */
4911 if (TREE_VIA_VIRTUAL (pbase
))
4913 if (TREE_VIA_PUBLIC (pbase
))
4914 access
= access_public_virtual_node
;
4915 else if (TREE_VIA_PROTECTED (pbase
))
4916 access
= access_protected_virtual_node
;
4918 access
= access_private_virtual_node
;
4922 if (TREE_VIA_PUBLIC (pbase
))
4923 access
= access_public_node
;
4924 else if (TREE_VIA_PROTECTED (pbase
))
4925 access
= access_protected_node
;
4927 access
= access_private_node
;
4930 base_list
= tree_cons (access
, base
, base_list
);
4933 /* The list is now in reverse order; correct that. */
4934 base_list
= nreverse (base_list
);
4936 /* Now call xref_basetypes to set up all the base-class
4938 xref_basetypes (TREE_CODE (pattern
) == RECORD_TYPE
4939 ? (CLASSTYPE_DECLARED_CLASS (pattern
)
4940 ? class_type_node
: record_type_node
)
4942 DECL_NAME (TYPE_NAME (pattern
)),
4947 /* Now that our base classes are set up, enter the scope of the
4948 class, so that name lookups into base classes, etc. will work
4949 corectly. This is precisely analagous to what we do in
4950 begin_class_definition when defining an ordinary non-template
4952 pushclass (type
, 1);
4954 for (t
= CLASSTYPE_TAGS (pattern
); t
; t
= TREE_CHAIN (t
))
4956 tree tag
= TREE_VALUE (t
);
4957 tree name
= TYPE_IDENTIFIER (tag
);
4960 newtag
= tsubst (tag
, args
, /*complain=*/1, NULL_TREE
);
4961 if (TREE_CODE (newtag
) != ENUMERAL_TYPE
)
4963 if (TYPE_LANG_SPECIFIC (tag
) && CLASSTYPE_IS_TEMPLATE (tag
))
4964 /* Unfortunately, lookup_template_class sets
4965 CLASSTYPE_IMPLICIT_INSTANTIATION for a partial
4966 instantiation (i.e., for the type of a member template
4967 class nested within a template class.) This behavior is
4968 required for maybe_process_partial_specialization to work
4969 correctly, but is not accurate in this case; the TAG is not
4970 an instantiation of anything. (The corresponding
4971 TEMPLATE_DECL is an instantiation, but the TYPE is not.) */
4972 CLASSTYPE_USE_TEMPLATE (newtag
) = 0;
4974 /* Now, we call pushtag to put this NEWTAG into the scope of
4975 TYPE. We first set up the IDENTIFIER_TYPE_VALUE to avoid
4976 pushtag calling push_template_decl. We don't have to do
4977 this for enums because it will already have been done in
4980 SET_IDENTIFIER_TYPE_VALUE (name
, newtag
);
4981 pushtag (name
, newtag
, /*globalize=*/0);
4985 /* Don't replace enum constants here. */
4986 for (t
= TYPE_FIELDS (pattern
); t
; t
= TREE_CHAIN (t
))
4987 if (TREE_CODE (t
) != CONST_DECL
)
4991 /* The the file and line for this declaration, to assist in
4992 error message reporting. Since we called push_tinst_level
4993 above, we don't need to restore these. */
4994 lineno
= DECL_SOURCE_LINE (t
);
4995 input_filename
= DECL_SOURCE_FILE (t
);
4997 r
= tsubst (t
, args
, /*complain=*/1, NULL_TREE
);
4998 if (TREE_CODE (r
) == VAR_DECL
)
5002 if (DECL_DEFINED_IN_CLASS_P (r
))
5003 init
= tsubst_expr (DECL_INITIAL (t
), args
,
5004 /*complain=*/1, NULL_TREE
);
5008 finish_static_data_member_decl (r
, init
,
5009 /*asmspec_tree=*/NULL_TREE
,
5012 if (DECL_DEFINED_IN_CLASS_P (r
))
5013 check_static_variable_definition (r
, TREE_TYPE (r
));
5016 /* R will have a TREE_CHAIN if and only if it has already been
5017 processed by finish_member_declaration. This can happen
5018 if, for example, it is a TYPE_DECL for a class-scoped
5019 ENUMERAL_TYPE; such a thing will already have been added to
5020 the field list by tsubst_enum above. */
5021 if (!TREE_CHAIN (r
))
5023 set_current_access_from_decl (r
);
5024 finish_member_declaration (r
);
5028 /* Set up the list (TYPE_METHODS) and vector (CLASSTYPE_METHOD_VEC)
5029 for this instantiation. */
5030 for (t
= TYPE_METHODS (pattern
); t
; t
= TREE_CHAIN (t
))
5032 tree r
= tsubst (t
, args
, /*complain=*/1, NULL_TREE
);
5033 set_current_access_from_decl (r
);
5034 finish_member_declaration (r
);
5037 /* Construct the DECL_FRIENDLIST for the new class type. */
5038 typedecl
= TYPE_MAIN_DECL (type
);
5039 for (t
= DECL_FRIENDLIST (TYPE_MAIN_DECL (pattern
));
5045 for (friends
= TREE_VALUE (t
);
5046 friends
!= NULL_TREE
;
5047 friends
= TREE_CHAIN (friends
))
5048 if (TREE_PURPOSE (friends
) == error_mark_node
)
5050 tsubst_friend_function (TREE_VALUE (friends
),
5053 my_friendly_abort (20000216);
5056 for (t
= CLASSTYPE_FRIEND_CLASSES (pattern
);
5060 tree friend_type
= TREE_VALUE (t
);
5061 tree new_friend_type
;
5063 if (TREE_CODE (friend_type
) == TEMPLATE_DECL
)
5064 new_friend_type
= tsubst_friend_class (friend_type
, args
);
5065 else if (uses_template_parms (friend_type
))
5066 new_friend_type
= tsubst (friend_type
, args
, /*complain=*/1,
5070 tree ns
= decl_namespace_context (TYPE_MAIN_DECL (friend_type
));
5072 /* The call to xref_tag_from_type does injection for friend
5074 push_nested_namespace (ns
);
5076 xref_tag_from_type (friend_type
, NULL_TREE
, 1);
5077 pop_nested_namespace (ns
);
5080 if (TREE_CODE (friend_type
) == TEMPLATE_DECL
)
5081 /* Trick make_friend_class into realizing that the friend
5082 we're adding is a template, not an ordinary class. It's
5083 important that we use make_friend_class since it will
5084 perform some error-checking and output cross-reference
5086 ++processing_template_decl
;
5088 if (new_friend_type
!= error_mark_node
)
5089 make_friend_class (type
, new_friend_type
);
5091 if (TREE_CODE (friend_type
) == TEMPLATE_DECL
)
5092 --processing_template_decl
;
5095 for (t
= TYPE_FIELDS (type
); t
; t
= TREE_CHAIN (t
))
5096 if (TREE_CODE (t
) == FIELD_DECL
)
5098 TREE_TYPE (t
) = complete_type (TREE_TYPE (t
));
5099 require_complete_type (t
);
5102 /* Set the file and line number information to whatever is given for
5103 the class itself. This puts error messages involving generated
5104 implicit functions at a predictable point, and the same point
5105 that would be used for non-template classes. */
5106 lineno
= DECL_SOURCE_LINE (typedecl
);
5107 input_filename
= DECL_SOURCE_FILE (typedecl
);
5109 unreverse_member_declarations (type
);
5110 finish_struct_1 (type
);
5111 CLASSTYPE_GOT_SEMICOLON (type
) = 1;
5113 /* Clear this now so repo_template_used is happy. */
5114 TYPE_BEING_DEFINED (type
) = 0;
5115 repo_template_used (type
);
5117 /* Now that the class is complete, instantiate default arguments for
5118 any member functions. We don't do this earlier because the
5119 default arguments may reference members of the class. */
5120 if (!PRIMARY_TEMPLATE_P (template))
5121 for (t
= TYPE_METHODS (type
); t
; t
= TREE_CHAIN (t
))
5122 if (TREE_CODE (t
) == FUNCTION_DECL
5123 /* Implicitly generated member functions will not have tmplate
5124 information; they are not instantiations, but instead are
5125 created "fresh" for each instantiation. */
5126 && DECL_TEMPLATE_INFO (t
))
5127 tsubst_default_arguments (t
);
5130 pop_from_top_level ();
5140 if (t1
== NULL_TREE
)
5141 return t2
== NULL_TREE
;
5142 if (t2
== NULL_TREE
)
5144 /* Don't care if one declares its arg const and the other doesn't -- the
5145 main variant of the arg type is all that matters. */
5146 if (TYPE_MAIN_VARIANT (TREE_VALUE (t1
))
5147 != TYPE_MAIN_VARIANT (TREE_VALUE (t2
)))
5149 return list_eq (TREE_CHAIN (t1
), TREE_CHAIN (t2
));
5152 /* If arg is a non-type template parameter that does not depend on template
5153 arguments, fold it like we weren't in the body of a template. */
5156 maybe_fold_nontype_arg (arg
)
5159 /* If we're not in a template, ARG is already as simple as it's going to
5160 get, and trying to reprocess the trees will break. */
5161 if (! processing_template_decl
)
5164 if (!TYPE_P (arg
) && !uses_template_parms (arg
))
5166 /* Sometimes, one of the args was an expression involving a
5167 template constant parameter, like N - 1. Now that we've
5168 tsubst'd, we might have something like 2 - 1. This will
5169 confuse lookup_template_class, so we do constant folding
5170 here. We have to unset processing_template_decl, to
5171 fool build_expr_from_tree() into building an actual
5174 int saved_processing_template_decl
= processing_template_decl
;
5175 processing_template_decl
= 0;
5176 arg
= fold (build_expr_from_tree (arg
));
5177 processing_template_decl
= saved_processing_template_decl
;
5182 /* Substitute ARGS into the vector of template arguments T. */
5185 tsubst_template_arg_vector (t
, args
, complain
)
5190 int len
= TREE_VEC_LENGTH (t
), need_new
= 0, i
;
5191 tree
*elts
= (tree
*) alloca (len
* sizeof (tree
));
5193 bzero ((char *) elts
, len
* sizeof (tree
));
5195 for (i
= 0; i
< len
; i
++)
5197 if (TREE_VEC_ELT (t
, i
) != NULL_TREE
5198 && TREE_CODE (TREE_VEC_ELT (t
, i
)) == TREE_VEC
)
5199 elts
[i
] = tsubst_template_arg_vector (TREE_VEC_ELT (t
, i
),
5202 elts
[i
] = maybe_fold_nontype_arg
5203 (tsubst_expr (TREE_VEC_ELT (t
, i
), args
, complain
,
5206 if (elts
[i
] == error_mark_node
)
5207 return error_mark_node
;
5209 if (elts
[i
] != TREE_VEC_ELT (t
, i
))
5216 t
= make_tree_vec (len
);
5217 for (i
= 0; i
< len
; i
++)
5218 TREE_VEC_ELT (t
, i
) = elts
[i
];
5223 /* Return the result of substituting ARGS into the template parameters
5224 given by PARMS. If there are m levels of ARGS and m + n levels of
5225 PARMS, then the result will contain n levels of PARMS. For
5226 example, if PARMS is `template <class T> template <class U>
5227 template <T*, U, class V>' and ARGS is {{int}, {double}} then the
5228 result will be `template <int*, double, class V>'. */
5231 tsubst_template_parms (parms
, args
, complain
)
5239 for (new_parms
= &r
;
5240 TMPL_PARMS_DEPTH (parms
) > TMPL_ARGS_DEPTH (args
);
5241 new_parms
= &(TREE_CHAIN (*new_parms
)),
5242 parms
= TREE_CHAIN (parms
))
5245 make_tree_vec (TREE_VEC_LENGTH (TREE_VALUE (parms
)));
5248 for (i
= 0; i
< TREE_VEC_LENGTH (new_vec
); ++i
)
5250 tree default_value
=
5251 TREE_PURPOSE (TREE_VEC_ELT (TREE_VALUE (parms
), i
));
5253 TREE_VALUE (TREE_VEC_ELT (TREE_VALUE (parms
), i
));
5255 TREE_VEC_ELT (new_vec
, i
)
5256 = build_tree_list (tsubst (default_value
, args
, complain
,
5258 tsubst (parm_decl
, args
, complain
,
5263 tree_cons (build_int_2 (0, (TMPL_PARMS_DEPTH (parms
)
5264 - TMPL_ARGS_DEPTH (args
))),
5265 new_vec
, NULL_TREE
);
5271 /* Substitute the ARGS into the indicated aggregate (or enumeration)
5272 type T. If T is not an aggregate or enumeration type, it is
5273 handled as if by tsubst. IN_DECL is as for tsubst. If
5274 ENTERING_SCOPE is non-zero, T is the context for a template which
5275 we are presently tsubst'ing. Return the subsituted value. */
5278 tsubst_aggr_type (t
, args
, complain
, in_decl
, entering_scope
)
5288 switch (TREE_CODE (t
))
5291 if (TYPE_PTRMEMFUNC_P (t
))
5293 tree r
= build_ptrmemfunc_type
5294 (tsubst (TYPE_PTRMEMFUNC_FN_TYPE (t
), args
, complain
, in_decl
));
5295 return cp_build_qualified_type_real (r
, TYPE_QUALS (t
),
5299 /* else fall through */
5302 if (TYPE_TEMPLATE_INFO (t
))
5308 /* First, determine the context for the type we are looking
5310 if (TYPE_CONTEXT (t
) != NULL_TREE
)
5311 context
= tsubst_aggr_type (TYPE_CONTEXT (t
), args
,
5313 in_decl
, /*entering_scope=*/1);
5315 context
= NULL_TREE
;
5317 /* Then, figure out what arguments are appropriate for the
5318 type we are trying to find. For example, given:
5320 template <class T> struct S;
5321 template <class T, class U> void f(T, U) { S<U> su; }
5323 and supposing that we are instantiating f<int, double>,
5324 then our ARGS will be {int, double}, but, when looking up
5325 S we only want {double}. */
5326 argvec
= tsubst_template_arg_vector (TYPE_TI_ARGS (t
), args
,
5328 if (argvec
== error_mark_node
)
5329 return error_mark_node
;
5331 r
= lookup_template_class (t
, argvec
, in_decl
, context
,
5334 return cp_build_qualified_type_real (r
, TYPE_QUALS (t
),
5338 /* This is not a template type, so there's nothing to do. */
5342 return tsubst (t
, args
, complain
, in_decl
);
5346 /* Substitute into the default argument ARG (a default argument for
5347 FN), which has the indicated TYPE. */
5350 tsubst_default_argument (fn
, type
, arg
)
5355 /* This default argument came from a template. Instantiate the
5356 default argument here, not in tsubst. In the case of
5365 we must be careful to do name lookup in the scope of S<T>,
5366 rather than in the current class. */
5367 if (DECL_CLASS_SCOPE_P (fn
))
5368 pushclass (DECL_CONTEXT (fn
), 2);
5370 arg
= tsubst_expr (arg
, DECL_TI_ARGS (fn
), /*complain=*/1, NULL_TREE
);
5372 if (DECL_CLASS_SCOPE_P (fn
))
5375 /* Make sure the default argument is reasonable. */
5376 arg
= check_default_argument (type
, arg
);
5381 /* Substitute into all the default arguments for FN. */
5384 tsubst_default_arguments (fn
)
5390 tmpl_args
= DECL_TI_ARGS (fn
);
5392 /* If this function is not yet instantiated, we certainly don't need
5393 its default arguments. */
5394 if (uses_template_parms (tmpl_args
))
5397 for (arg
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
5399 arg
= TREE_CHAIN (arg
))
5400 if (TREE_PURPOSE (arg
))
5401 TREE_PURPOSE (arg
) = tsubst_default_argument (fn
,
5403 TREE_PURPOSE (arg
));
5406 /* Substitute the ARGS into the T, which is a _DECL. TYPE is the
5407 (already computed) substitution of ARGS into TREE_TYPE (T), if
5408 appropriate. Return the result of the substitution. IN_DECL is as
5412 tsubst_decl (t
, args
, type
, in_decl
)
5419 const char *saved_filename
;
5422 /* Set the filename and linenumber to improve error-reporting. */
5423 saved_lineno
= lineno
;
5424 saved_filename
= input_filename
;
5425 lineno
= DECL_SOURCE_LINE (t
);
5426 input_filename
= DECL_SOURCE_FILE (t
);
5428 switch (TREE_CODE (t
))
5432 /* We can get here when processing a member template function
5433 of a template class. */
5434 tree decl
= DECL_TEMPLATE_RESULT (t
);
5436 int is_template_template_parm
= DECL_TEMPLATE_TEMPLATE_PARM_P (t
);
5438 if (!is_template_template_parm
)
5440 /* We might already have an instance of this template.
5441 The ARGS are for the surrounding class type, so the
5442 full args contain the tsubst'd args for the context,
5443 plus the innermost args from the template decl. */
5444 tree tmpl_args
= DECL_CLASS_TEMPLATE_P (t
)
5445 ? CLASSTYPE_TI_ARGS (TREE_TYPE (t
))
5446 : DECL_TI_ARGS (DECL_TEMPLATE_RESULT (t
));
5449 full_args
= tsubst_template_arg_vector (tmpl_args
, args
,
5452 /* tsubst_template_arg_vector doesn't copy the vector if
5453 nothing changed. But, *something* should have
5455 my_friendly_assert (full_args
!= tmpl_args
, 0);
5457 spec
= retrieve_specialization (t
, full_args
);
5458 if (spec
!= NULL_TREE
)
5465 /* Make a new template decl. It will be similar to the
5466 original, but will record the current template arguments.
5467 We also create a new function declaration, which is just
5468 like the old one, but points to this new template, rather
5469 than the old one. */
5471 my_friendly_assert (DECL_LANG_SPECIFIC (r
) != 0, 0);
5472 TREE_CHAIN (r
) = NULL_TREE
;
5474 if (is_template_template_parm
)
5476 tree new_decl
= tsubst (decl
, args
, /*complain=*/1, in_decl
);
5477 DECL_TEMPLATE_RESULT (r
) = new_decl
;
5478 TREE_TYPE (r
) = TREE_TYPE (new_decl
);
5483 = tsubst_aggr_type (DECL_CONTEXT (t
), args
,
5484 /*complain=*/1, in_decl
,
5485 /*entering_scope=*/1);
5486 DECL_VIRTUAL_CONTEXT (r
)
5487 = tsubst_aggr_type (DECL_VIRTUAL_CONTEXT (t
), args
,
5488 /*complain=*/1, in_decl
,
5489 /*entering_scope=*/1);
5490 DECL_TEMPLATE_INFO (r
) = build_tree_list (t
, args
);
5492 if (TREE_CODE (decl
) == TYPE_DECL
)
5494 tree new_type
= tsubst (TREE_TYPE (t
), args
,
5495 /*complain=*/1, in_decl
);
5496 TREE_TYPE (r
) = new_type
;
5497 CLASSTYPE_TI_TEMPLATE (new_type
) = r
;
5498 DECL_TEMPLATE_RESULT (r
) = TYPE_MAIN_DECL (new_type
);
5499 DECL_TI_ARGS (r
) = CLASSTYPE_TI_ARGS (new_type
);
5503 tree new_decl
= tsubst (decl
, args
, /*complain=*/1, in_decl
);
5505 DECL_TEMPLATE_RESULT (r
) = new_decl
;
5506 DECL_TI_TEMPLATE (new_decl
) = r
;
5507 TREE_TYPE (r
) = TREE_TYPE (new_decl
);
5508 DECL_TI_ARGS (r
) = DECL_TI_ARGS (new_decl
);
5511 SET_DECL_IMPLICIT_INSTANTIATION (r
);
5512 DECL_TEMPLATE_INSTANTIATIONS (r
) = NULL_TREE
;
5513 DECL_TEMPLATE_SPECIALIZATIONS (r
) = NULL_TREE
;
5515 /* The template parameters for this new template are all the
5516 template parameters for the old template, except the
5517 outermost level of parameters. */
5518 DECL_TEMPLATE_PARMS (r
)
5519 = tsubst_template_parms (DECL_TEMPLATE_PARMS (t
), args
,
5522 if (PRIMARY_TEMPLATE_P (t
))
5523 DECL_PRIMARY_TEMPLATE (r
) = r
;
5525 /* We don't partially instantiate partial specializations. */
5526 if (TREE_CODE (decl
) == TYPE_DECL
)
5529 /* Record this partial instantiation. */
5530 register_specialization (r
, t
,
5531 DECL_TI_ARGS (DECL_TEMPLATE_RESULT (r
)));
5539 tree argvec
= NULL_TREE
;
5546 /* Nobody should be tsubst'ing into non-template functions. */
5547 my_friendly_assert (DECL_TEMPLATE_INFO (t
) != NULL_TREE
, 0);
5549 if (TREE_CODE (DECL_TI_TEMPLATE (t
)) == TEMPLATE_DECL
)
5553 /* Calculate the most general template of which R is a
5554 specialization, and the complete set of arguments used to
5556 gen_tmpl
= most_general_template (DECL_TI_TEMPLATE (t
));
5558 = tsubst_template_arg_vector (DECL_TI_ARGS
5559 (DECL_TEMPLATE_RESULT (gen_tmpl
)),
5560 args
, /*complain=*/1);
5562 /* Check to see if we already have this specialization. */
5563 spec
= retrieve_specialization (gen_tmpl
, argvec
);
5571 /* We can see more levels of arguments than parameters if
5572 there was a specialization of a member template, like
5575 template <class T> struct S { template <class U> void f(); }
5576 template <> template <class U> void S<int>::f(U);
5578 Here, we'll be subtituting into the specialization,
5579 because that's where we can find the code we actually
5580 want to generate, but we'll have enough arguments for
5581 the most general template.
5583 We also deal with the peculiar case:
5585 template <class T> struct S {
5586 template <class U> friend void f();
5588 template <class U> void f() {}
5590 template void f<double>();
5592 Here, the ARGS for the instantiation of will be {int,
5593 double}. But, we only need as many ARGS as there are
5594 levels of template parameters in CODE_PATTERN. We are
5595 careful not to get fooled into reducing the ARGS in
5598 template <class T> struct S { template <class U> void f(U); }
5599 template <class T> template <> void S<T>::f(int) {}
5601 which we can spot because the pattern will be a
5602 specialization in this case. */
5603 args_depth
= TMPL_ARGS_DEPTH (args
);
5605 TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (DECL_TI_TEMPLATE (t
)));
5606 if (args_depth
> parms_depth
5607 && !DECL_TEMPLATE_SPECIALIZATION (t
))
5608 args
= get_innermost_template_args (args
, parms_depth
);
5612 /* This special case arises when we have something like this:
5614 template <class T> struct S {
5615 friend void f<int>(int, double);
5618 Here, the DECL_TI_TEMPLATE for the friend declaration
5619 will be a LOOKUP_EXPR or an IDENTIFIER_NODE. We are
5620 being called from tsubst_friend_function, and we want
5621 only to create a new decl (R) with appropriate types so
5622 that we can call determine_specialization. */
5623 my_friendly_assert ((TREE_CODE (DECL_TI_TEMPLATE (t
))
5625 || (TREE_CODE (DECL_TI_TEMPLATE (t
))
5626 == IDENTIFIER_NODE
), 0);
5627 gen_tmpl
= NULL_TREE
;
5630 if (DECL_CLASS_SCOPE_P (t
))
5632 if (DECL_NAME (t
) == constructor_name (DECL_CONTEXT (t
)))
5636 ctx
= tsubst_aggr_type (DECL_CONTEXT (t
), args
,
5638 /*entering_scope=*/1);
5643 ctx
= DECL_CONTEXT (t
);
5645 type
= tsubst (type
, args
, /*complain=*/1, in_decl
);
5646 if (type
== error_mark_node
)
5647 return error_mark_node
;
5649 /* We do NOT check for matching decls pushed separately at this
5650 point, as they may not represent instantiations of this
5651 template, and in any case are considered separate under the
5652 discrete model. Instead, see add_maybe_template. */
5654 DECL_USE_TEMPLATE (r
) = 0;
5655 TREE_TYPE (r
) = type
;
5657 DECL_CONTEXT (r
) = ctx
;
5658 DECL_VIRTUAL_CONTEXT (r
)
5659 = tsubst_aggr_type (DECL_VIRTUAL_CONTEXT (t
), args
,
5661 /*entering_scope=*/1);
5663 if (member
&& DECL_CONV_FN_P (r
))
5665 /* Type-conversion operator. Reconstruct the name, in
5666 case it's the name of one of the template's parameters. */
5668 DECL_NAME (r
) = mangle_conv_op_name_for_type (TREE_TYPE (type
));
5670 DECL_NAME (r
) = build_typename_overload (TREE_TYPE (type
));
5673 DECL_ARGUMENTS (r
) = tsubst (DECL_ARGUMENTS (t
), args
,
5675 DECL_TEMPLATE_RESULT (r
) = NULL_TREE
;
5677 TREE_STATIC (r
) = 0;
5678 TREE_PUBLIC (r
) = TREE_PUBLIC (t
);
5679 DECL_EXTERNAL (r
) = 1;
5680 DECL_INTERFACE_KNOWN (r
) = 0;
5681 DECL_DEFER_OUTPUT (r
) = 0;
5682 TREE_CHAIN (r
) = NULL_TREE
;
5683 DECL_PENDING_INLINE_INFO (r
) = 0;
5684 DECL_PENDING_INLINE_P (r
) = 0;
5685 DECL_SAVED_TREE (r
) = NULL_TREE
;
5687 if (DECL_CLONED_FUNCTION (r
))
5689 DECL_CLONED_FUNCTION (r
) = tsubst (DECL_CLONED_FUNCTION (t
),
5690 args
, /*complain=*/1, t
);
5691 TREE_CHAIN (r
) = TREE_CHAIN (DECL_CLONED_FUNCTION (r
));
5692 TREE_CHAIN (DECL_CLONED_FUNCTION (r
)) = r
;
5695 /* Set up the DECL_TEMPLATE_INFO for R and compute its mangled
5696 name. There's no need to do this in the special friend
5697 case mentioned above where GEN_TMPL is NULL. */
5700 DECL_TEMPLATE_INFO (r
)
5701 = tree_cons (gen_tmpl
, argvec
, NULL_TREE
);
5702 SET_DECL_IMPLICIT_INSTANTIATION (r
);
5703 register_specialization (r
, gen_tmpl
, argvec
);
5705 /* Set the mangled name for R. */
5706 if (DECL_DESTRUCTOR_P (t
))
5709 set_mangled_name_for_decl (r
);
5711 DECL_ASSEMBLER_NAME (r
) = build_destructor_name (ctx
);
5715 /* Instantiations of template functions must be mangled
5716 specially, in order to conform to 14.5.5.1
5717 [temp.over.link]. */
5718 tree tmpl
= DECL_TI_TEMPLATE (t
);
5720 /* TMPL will be NULL if this is a specialization of a
5721 member function of a template class. */
5722 if (name_mangling_version
< 1
5723 || tmpl
== NULL_TREE
5724 || (member
&& !is_member_template (tmpl
)
5725 && !DECL_TEMPLATE_INFO (tmpl
)))
5726 set_mangled_name_for_decl (r
);
5728 set_mangled_name_for_template_decl (r
);
5732 make_decl_rtl (r
, NULL_PTR
, 1);
5734 /* Like grokfndecl. If we don't do this, pushdecl will
5735 mess up our TREE_CHAIN because it doesn't find a
5736 previous decl. Sigh. */
5738 && ! uses_template_parms (r
)
5739 && (IDENTIFIER_GLOBAL_VALUE (DECL_ASSEMBLER_NAME (r
))
5741 SET_IDENTIFIER_GLOBAL_VALUE (DECL_ASSEMBLER_NAME (r
), r
);
5743 /* We're not supposed to instantiate default arguments
5744 until they are called, for a template. But, for a
5747 template <class T> void f ()
5748 { extern void g(int i = T()); }
5750 we should do the substitution when the template is
5751 instantiated. We handle the member function case in
5752 instantiate_class_template since the default arguments
5753 might refer to other members of the class. */
5755 && !PRIMARY_TEMPLATE_P (gen_tmpl
)
5756 && !uses_template_parms (argvec
))
5757 tsubst_default_arguments (r
);
5760 /* Copy the list of befriending classes. */
5761 for (friends
= &DECL_BEFRIENDING_CLASSES (r
);
5763 friends
= &TREE_CHAIN (*friends
))
5765 *friends
= copy_node (*friends
);
5766 TREE_VALUE (*friends
) = tsubst (TREE_VALUE (*friends
),
5767 args
, /*complain=*/1,
5771 if (DECL_CONSTRUCTOR_P (r
) || DECL_DESTRUCTOR_P (r
))
5773 maybe_retrofit_in_chrg (r
);
5774 if (DECL_CONSTRUCTOR_P (r
))
5775 grok_ctor_properties (ctx
, r
);
5777 else if (IDENTIFIER_OPNAME_P (DECL_NAME (r
)))
5778 grok_op_properties (r
, DECL_VIRTUAL_P (r
), DECL_FRIEND_P (r
));
5785 TREE_TYPE (r
) = type
;
5786 c_apply_type_quals_to_decl (CP_TYPE_QUALS (type
), r
);
5788 if (TREE_CODE (DECL_INITIAL (r
)) != TEMPLATE_PARM_INDEX
)
5789 DECL_INITIAL (r
) = TREE_TYPE (r
);
5791 DECL_INITIAL (r
) = tsubst (DECL_INITIAL (r
), args
,
5792 /*complain=*/1, in_decl
);
5794 DECL_CONTEXT (r
) = NULL_TREE
;
5795 if (PROMOTE_PROTOTYPES
5796 && (TREE_CODE (type
) == INTEGER_TYPE
5797 || TREE_CODE (type
) == ENUMERAL_TYPE
)
5798 && TYPE_PRECISION (type
) < TYPE_PRECISION (integer_type_node
))
5799 DECL_ARG_TYPE (r
) = integer_type_node
;
5801 TREE_CHAIN (r
) = tsubst (TREE_CHAIN (t
), args
,
5802 /*complain=*/1, TREE_CHAIN (t
));
5809 TREE_TYPE (r
) = type
;
5810 c_apply_type_quals_to_decl (CP_TYPE_QUALS (type
), r
);
5812 /* We don't have to set DECL_CONTEXT here; it is set by
5813 finish_member_declaration. */
5814 DECL_INITIAL (r
) = tsubst_expr (DECL_INITIAL (t
), args
,
5815 /*complain=*/1, in_decl
);
5816 TREE_CHAIN (r
) = NULL_TREE
;
5817 if (TREE_CODE (type
) == VOID_TYPE
)
5818 cp_error_at ("instantiation of `%D' as type void", r
);
5826 = tsubst_copy (DECL_INITIAL (t
), args
, /*complain=*/1, in_decl
);
5827 TREE_CHAIN (r
) = NULL_TREE
;
5832 if (TREE_CODE (type
) == TEMPLATE_TEMPLATE_PARM
5833 || t
== TYPE_MAIN_DECL (TREE_TYPE (t
)))
5835 /* If this is the canonical decl, we don't have to mess with
5836 instantiations, and often we can't (for typename, template
5837 type parms and such). Note that TYPE_NAME is not correct for
5838 the above test if we've copied the type for a typedef. */
5839 r
= TYPE_NAME (type
);
5847 tree argvec
= NULL_TREE
;
5848 tree gen_tmpl
= NULL_TREE
;
5850 tree tmpl
= NULL_TREE
;
5854 /* Assume this is a non-local variable. */
5857 if (TYPE_P (CP_DECL_CONTEXT (t
)))
5858 ctx
= tsubst_aggr_type (DECL_CONTEXT (t
), args
,
5860 in_decl
, /*entering_scope=*/1);
5863 /* Subsequent calls to pushdecl will fill this in. */
5865 if (!DECL_NAMESPACE_SCOPE_P (t
))
5869 /* Check to see if we already have this specialization. */
5872 tmpl
= DECL_TI_TEMPLATE (t
);
5873 gen_tmpl
= most_general_template (tmpl
);
5874 argvec
= tsubst (DECL_TI_ARGS (t
), args
, /*complain=*/1, in_decl
);
5875 spec
= retrieve_specialization (gen_tmpl
, argvec
);
5878 spec
= retrieve_local_specialization (t
);
5887 TREE_TYPE (r
) = type
;
5888 c_apply_type_quals_to_decl (CP_TYPE_QUALS (type
), r
);
5889 DECL_CONTEXT (r
) = ctx
;
5891 /* Don't try to expand the initializer until someone tries to use
5892 this variable; otherwise we run into circular dependencies. */
5893 DECL_INITIAL (r
) = NULL_TREE
;
5895 DECL_SIZE (r
) = DECL_SIZE_UNIT (r
) = 0;
5897 /* For __PRETTY_FUNCTION__ we have to adjust the initializer. */
5898 if (DECL_PRETTY_FUNCTION_P (r
))
5900 DECL_INITIAL (r
) = tsubst (DECL_INITIAL (t
),
5904 TREE_TYPE (r
) = TREE_TYPE (DECL_INITIAL (r
));
5907 /* Even if the original location is out of scope, the newly
5908 substituted one is not. */
5909 if (TREE_CODE (r
) == VAR_DECL
)
5910 DECL_DEAD_FOR_LOCAL (r
) = 0;
5914 /* A static data member declaration is always marked
5915 external when it is declared in-class, even if an
5916 initializer is present. We mimic the non-template
5918 DECL_EXTERNAL (r
) = 1;
5920 register_specialization (r
, gen_tmpl
, argvec
);
5921 DECL_TEMPLATE_INFO (r
) = tree_cons (tmpl
, argvec
, NULL_TREE
);
5922 SET_DECL_IMPLICIT_INSTANTIATION (r
);
5925 register_local_specialization (r
, t
);
5927 TREE_CHAIN (r
) = NULL_TREE
;
5928 if (TREE_CODE (r
) == VAR_DECL
&& TREE_CODE (type
) == VOID_TYPE
)
5929 cp_error_at ("instantiation of `%D' as type void", r
);
5934 my_friendly_abort (0);
5937 /* Restore the file and line information. */
5938 lineno
= saved_lineno
;
5939 input_filename
= saved_filename
;
5944 /* Substitue into the ARG_TYPES of a function type. */
5947 tsubst_arg_types (arg_types
, args
, complain
, in_decl
)
5953 tree remaining_arg_types
;
5956 if (!arg_types
|| arg_types
== void_list_node
)
5959 remaining_arg_types
= tsubst_arg_types (TREE_CHAIN (arg_types
),
5960 args
, complain
, in_decl
);
5961 if (remaining_arg_types
== error_mark_node
)
5962 return error_mark_node
;
5964 type
= tsubst (TREE_VALUE (arg_types
), args
, complain
, in_decl
);
5965 if (type
== error_mark_node
)
5966 return error_mark_node
;
5968 /* Do array-to-pointer, function-to-pointer conversion, and ignore
5969 top-level qualifiers as required. */
5970 type
= TYPE_MAIN_VARIANT (type_decays_to (type
));
5972 /* Note that we do not substitute into default arguments here. The
5973 standard mandates that they be instantiated only when needed,
5974 which is done in build_over_call. */
5975 return hash_tree_cons (TREE_PURPOSE (arg_types
), type
,
5976 remaining_arg_types
);
5980 /* Substitute into a FUNCTION_TYPE or METHOD_TYPE. This routine does
5981 *not* handle the exception-specification for FNTYPE, because the
5982 initial substitution of explicitly provided template parameters
5983 during argument deduction forbids substitution into the
5984 exception-specification:
5988 All references in the function type of the function template to the
5989 corresponding template parameters are replaced by the specified tem-
5990 plate argument values. If a substitution in a template parameter or
5991 in the function type of the function template results in an invalid
5992 type, type deduction fails. [Note: The equivalent substitution in
5993 exception specifications is done only when the function is instanti-
5994 ated, at which point a program is ill-formed if the substitution
5995 results in an invalid type.] */
5998 tsubst_function_type (t
, args
, complain
, in_decl
)
6008 /* The TYPE_CONTEXT is not used for function/method types. */
6009 my_friendly_assert (TYPE_CONTEXT (t
) == NULL_TREE
, 0);
6011 /* Substitue the return type. */
6012 return_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
6013 if (return_type
== error_mark_node
)
6014 return error_mark_node
;
6016 /* Substitue the argument types. */
6017 arg_types
= tsubst_arg_types (TYPE_ARG_TYPES (t
), args
,
6019 if (arg_types
== error_mark_node
)
6020 return error_mark_node
;
6022 /* Construct a new type node and return it. */
6023 if (TREE_CODE (t
) == FUNCTION_TYPE
)
6024 fntype
= build_function_type (return_type
, arg_types
);
6027 tree r
= TREE_TYPE (TREE_VALUE (arg_types
));
6028 if (! IS_AGGR_TYPE (r
))
6032 Type deduction may fail for any of the following
6035 -- Attempting to create "pointer to member of T" when T
6036 is not a class type. */
6038 cp_error ("creating pointer to member function of non-class type `%T'",
6040 return error_mark_node
;
6043 fntype
= build_cplus_method_type (r
, return_type
, TREE_CHAIN
6046 fntype
= build_qualified_type (fntype
, TYPE_QUALS (t
));
6047 fntype
= build_type_attribute_variant (fntype
, TYPE_ATTRIBUTES (t
));
6052 /* Substitute into the PARMS of a call-declarator. */
6055 tsubst_call_declarator_parms (parms
, args
, complain
, in_decl
)
6065 if (!parms
|| parms
== void_list_node
)
6068 new_parms
= tsubst_call_declarator_parms (TREE_CHAIN (parms
),
6069 args
, complain
, in_decl
);
6071 /* Figure out the type of this parameter. */
6072 type
= tsubst (TREE_VALUE (parms
), args
, complain
, in_decl
);
6074 /* Figure out the default argument as well. Note that we use
6075 tsubst_expr since the default argument is really an expression. */
6076 defarg
= tsubst_expr (TREE_PURPOSE (parms
), args
, complain
, in_decl
);
6078 /* Chain this parameter on to the front of those we have already
6079 processed. We don't use hash_tree_cons because that function
6080 doesn't check TREE_PARMLIST. */
6081 new_parms
= tree_cons (defarg
, type
, new_parms
);
6083 /* And note that these are parameters. */
6084 TREE_PARMLIST (new_parms
) = 1;
6089 /* Take the tree structure T and replace template parameters used
6090 therein with the argument vector ARGS. IN_DECL is an associated
6091 decl for diagnostics. If an error occurs, returns ERROR_MARK_NODE.
6092 An appropriate error message is issued only if COMPLAIN is
6093 non-zero. Note that we must be relatively non-tolerant of
6094 extensions here, in order to preserve conformance; if we allow
6095 substitutions that should not be allowed, we may allow argument
6096 deductions that should not succeed, and therefore report ambiguous
6097 overload situations where there are none. In theory, we could
6098 allow the substitution, but indicate that it should have failed,
6099 and allow our caller to make sure that the right thing happens, but
6100 we don't try to do this yet.
6102 This function is used for dealing with types, decls and the like;
6103 for expressions, use tsubst_expr or tsubst_copy. */
6106 tsubst (t
, args
, complain
, in_decl
)
6113 if (t
== NULL_TREE
|| t
== error_mark_node
6114 || t
== integer_type_node
6115 || t
== void_type_node
6116 || t
== char_type_node
6117 || TREE_CODE (t
) == NAMESPACE_DECL
)
6120 if (TREE_CODE (t
) == IDENTIFIER_NODE
)
6121 type
= IDENTIFIER_TYPE_VALUE (t
);
6123 type
= TREE_TYPE (t
);
6124 if (type
== unknown_type_node
)
6125 my_friendly_abort (42);
6127 if (type
&& TREE_CODE (t
) != FUNCTION_DECL
6128 && TREE_CODE (t
) != TYPENAME_TYPE
6129 && TREE_CODE (t
) != TEMPLATE_DECL
6130 && TREE_CODE (t
) != IDENTIFIER_NODE
6131 && TREE_CODE (t
) != FUNCTION_TYPE
6132 && TREE_CODE (t
) != METHOD_TYPE
)
6133 type
= tsubst (type
, args
, complain
, in_decl
);
6134 if (type
== error_mark_node
)
6135 return error_mark_node
;
6138 return tsubst_decl (t
, args
, type
, in_decl
);
6140 switch (TREE_CODE (t
))
6145 return tsubst_aggr_type (t
, args
, complain
, in_decl
,
6146 /*entering_scope=*/0);
6149 case IDENTIFIER_NODE
:
6161 if (t
== integer_type_node
)
6164 if (TREE_CODE (TYPE_MIN_VALUE (t
)) == INTEGER_CST
6165 && TREE_CODE (TYPE_MAX_VALUE (t
)) == INTEGER_CST
)
6169 tree max
, omax
= TREE_OPERAND (TYPE_MAX_VALUE (t
), 0);
6171 max
= tsubst_expr (omax
, args
, complain
, in_decl
);
6172 if (max
== error_mark_node
)
6173 return error_mark_node
;
6175 /* See if we can reduce this expression to something simpler. */
6176 max
= maybe_fold_nontype_arg (max
);
6177 if (!processing_template_decl
)
6178 max
= decl_constant_value (max
);
6180 if (processing_template_decl
6181 /* When providing explicit arguments to a template
6182 function, but leaving some arguments for subsequent
6183 deduction, MAX may be template-dependent even if we're
6184 not PROCESSING_TEMPLATE_DECL. We still need to check for
6185 template parms, though; MAX won't be an INTEGER_CST for
6186 dynamic arrays, either. */
6187 || (TREE_CODE (max
) != INTEGER_CST
6188 && uses_template_parms (max
)))
6190 tree itype
= make_node (INTEGER_TYPE
);
6191 TYPE_MIN_VALUE (itype
) = size_zero_node
;
6192 TYPE_MAX_VALUE (itype
) = build_min (MINUS_EXPR
, sizetype
, max
,
6197 if (integer_zerop (omax
))
6199 /* Still allow an explicit array of size zero. */
6201 pedwarn ("creating array with size zero");
6203 else if (integer_zerop (max
)
6204 || (TREE_CODE (max
) == INTEGER_CST
6205 && INT_CST_LT (max
, integer_zero_node
)))
6209 Type deduction may fail for any of the following
6212 Attempting to create an array with a size that is
6213 zero or negative. */
6215 cp_error ("creating array with size zero (`%E')", max
);
6217 return error_mark_node
;
6220 return compute_array_index_type (NULL_TREE
, max
);
6223 case TEMPLATE_TYPE_PARM
:
6224 case TEMPLATE_TEMPLATE_PARM
:
6225 case TEMPLATE_PARM_INDEX
:
6233 if (TREE_CODE (t
) == TEMPLATE_TYPE_PARM
6234 || TREE_CODE (t
) == TEMPLATE_TEMPLATE_PARM
)
6236 idx
= TEMPLATE_TYPE_IDX (t
);
6237 level
= TEMPLATE_TYPE_LEVEL (t
);
6241 idx
= TEMPLATE_PARM_IDX (t
);
6242 level
= TEMPLATE_PARM_LEVEL (t
);
6245 if (TREE_VEC_LENGTH (args
) > 0)
6247 tree arg
= NULL_TREE
;
6249 levels
= TMPL_ARGS_DEPTH (args
);
6250 if (level
<= levels
)
6251 arg
= TMPL_ARG (args
, level
, idx
);
6253 if (arg
== error_mark_node
)
6254 return error_mark_node
;
6255 else if (arg
!= NULL_TREE
)
6257 if (TREE_CODE (t
) == TEMPLATE_TYPE_PARM
)
6259 my_friendly_assert (TYPE_P (arg
), 0);
6260 return cp_build_qualified_type_real
6261 (arg
, CP_TYPE_QUALS (arg
) | CP_TYPE_QUALS (t
),
6264 else if (TREE_CODE (t
) == TEMPLATE_TEMPLATE_PARM
)
6266 if (TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (t
))
6268 /* We are processing a type constructed from
6269 a template template parameter */
6270 tree argvec
= tsubst (TYPE_TI_ARGS (t
),
6271 args
, complain
, in_decl
);
6272 if (argvec
== error_mark_node
)
6273 return error_mark_node
;
6275 /* We can get a TEMPLATE_TEMPLATE_PARM here when
6276 we are resolving nested-types in the signature of
6277 a member function templates.
6278 Otherwise ARG is a TEMPLATE_DECL and is the real
6279 template to be instantiated. */
6280 if (TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
)
6281 arg
= TYPE_NAME (arg
);
6283 r
= lookup_template_class (arg
,
6286 /*entering_scope=*/0);
6287 return cp_build_qualified_type_real (r
,
6292 /* We are processing a template argument list. */
6300 my_friendly_abort (981018);
6303 /* This can happen during the attempted tsubst'ing in
6304 unify. This means that we don't yet have any information
6305 about the template parameter in question. */
6308 /* If we get here, we must have been looking at a parm for a
6309 more deeply nested template. Make a new version of this
6310 template parameter, but with a lower level. */
6311 switch (TREE_CODE (t
))
6313 case TEMPLATE_TYPE_PARM
:
6314 case TEMPLATE_TEMPLATE_PARM
:
6315 if (CP_TYPE_QUALS (t
))
6317 r
= tsubst (TYPE_MAIN_VARIANT (t
), args
, complain
, in_decl
);
6318 r
= cp_build_qualified_type_real (r
, CP_TYPE_QUALS (t
),
6324 TEMPLATE_TYPE_PARM_INDEX (r
)
6325 = reduce_template_parm_level (TEMPLATE_TYPE_PARM_INDEX (t
),
6327 TYPE_STUB_DECL (r
) = TYPE_NAME (r
) = TEMPLATE_TYPE_DECL (r
);
6328 TYPE_MAIN_VARIANT (r
) = r
;
6329 TYPE_POINTER_TO (r
) = NULL_TREE
;
6330 TYPE_REFERENCE_TO (r
) = NULL_TREE
;
6332 if (TREE_CODE (t
) == TEMPLATE_TEMPLATE_PARM
6333 && TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (t
))
6335 tree argvec
= tsubst (TYPE_TI_ARGS (t
), args
,
6337 if (argvec
== error_mark_node
)
6338 return error_mark_node
;
6340 TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (r
)
6341 = tree_cons (TYPE_TI_TEMPLATE (t
), argvec
, NULL_TREE
);
6346 case TEMPLATE_PARM_INDEX
:
6347 r
= reduce_template_parm_level (t
, type
, levels
);
6351 my_friendly_abort (0);
6359 tree purpose
, value
, chain
, result
;
6361 if (t
== void_list_node
)
6364 purpose
= TREE_PURPOSE (t
);
6367 purpose
= tsubst (purpose
, args
, complain
, in_decl
);
6368 if (purpose
== error_mark_node
)
6369 return error_mark_node
;
6371 value
= TREE_VALUE (t
);
6374 value
= tsubst (value
, args
, complain
, in_decl
);
6375 if (value
== error_mark_node
)
6376 return error_mark_node
;
6378 chain
= TREE_CHAIN (t
);
6379 if (chain
&& chain
!= void_type_node
)
6381 chain
= tsubst (chain
, args
, complain
, in_decl
);
6382 if (chain
== error_mark_node
)
6383 return error_mark_node
;
6385 if (purpose
== TREE_PURPOSE (t
)
6386 && value
== TREE_VALUE (t
)
6387 && chain
== TREE_CHAIN (t
))
6389 result
= hash_tree_cons (purpose
, value
, chain
);
6390 TREE_PARMLIST (result
) = TREE_PARMLIST (t
);
6394 if (type
!= NULL_TREE
)
6396 /* A binfo node. We always need to make a copy, of the node
6397 itself and of its BINFO_BASETYPES. */
6401 /* Make sure type isn't a typedef copy. */
6402 type
= BINFO_TYPE (TYPE_BINFO (type
));
6404 TREE_TYPE (t
) = complete_type (type
);
6405 if (IS_AGGR_TYPE (type
))
6407 BINFO_VTABLE (t
) = TYPE_BINFO_VTABLE (type
);
6408 BINFO_VIRTUALS (t
) = TYPE_BINFO_VIRTUALS (type
);
6409 if (TYPE_BINFO_BASETYPES (type
) != NULL_TREE
)
6410 BINFO_BASETYPES (t
) = copy_node (TYPE_BINFO_BASETYPES (type
));
6415 /* Otherwise, a vector of template arguments. */
6416 return tsubst_template_arg_vector (t
, args
, complain
);
6419 case REFERENCE_TYPE
:
6421 enum tree_code code
;
6423 if (type
== TREE_TYPE (t
))
6426 code
= TREE_CODE (t
);
6431 Type deduction may fail for any of the following
6434 -- Attempting to create a pointer to reference type.
6435 -- Attempting to create a reference to a reference type or
6436 a reference to void. */
6437 if (TREE_CODE (type
) == REFERENCE_TYPE
6438 || (code
== REFERENCE_TYPE
&& TREE_CODE (type
) == VOID_TYPE
))
6440 static int last_line
= 0;
6441 static const char* last_file
= 0;
6443 /* We keep track of the last time we issued this error
6444 message to avoid spewing a ton of messages during a
6445 single bad template instantiation. */
6446 if (complain
&& (last_line
!= lineno
||
6447 last_file
!= input_filename
))
6449 if (TREE_CODE (type
) == VOID_TYPE
)
6450 cp_error ("forming reference to void");
6452 cp_error ("forming %s to reference type `%T'",
6453 (code
== POINTER_TYPE
) ? "pointer" : "reference",
6456 last_file
= input_filename
;
6459 return error_mark_node
;
6461 else if (code
== POINTER_TYPE
)
6462 r
= build_pointer_type (type
);
6464 r
= build_reference_type (type
);
6465 r
= cp_build_qualified_type_real (r
, TYPE_QUALS (t
), complain
);
6467 if (r
!= error_mark_node
)
6468 /* Will this ever be needed for TYPE_..._TO values? */
6475 r
= tsubst (TYPE_OFFSET_BASETYPE (t
), args
, complain
, in_decl
);
6476 if (r
== error_mark_node
|| !IS_AGGR_TYPE (r
))
6480 Type deduction may fail for any of the following
6483 -- Attempting to create "pointer to member of T" when T
6484 is not a class type. */
6486 cp_error ("creating pointer to member of non-class type `%T'",
6488 return error_mark_node
;
6490 return build_offset_type (r
, type
);
6498 fntype
= tsubst_function_type (t
, args
, complain
, in_decl
);
6499 if (fntype
== error_mark_node
)
6500 return error_mark_node
;
6502 /* Substitue the exception specification. */
6503 raises
= TYPE_RAISES_EXCEPTIONS (t
);
6506 tree list
= NULL_TREE
;
6508 if (! TREE_VALUE (raises
))
6511 for (; raises
!= NULL_TREE
; raises
= TREE_CHAIN (raises
))
6513 tree spec
= TREE_VALUE (raises
);
6515 spec
= tsubst (spec
, args
, complain
, in_decl
);
6516 if (spec
== error_mark_node
)
6518 list
= add_exception_specifier (list
, spec
, complain
);
6520 fntype
= build_exception_variant (fntype
, list
);
6526 tree domain
= tsubst (TYPE_DOMAIN (t
), args
, complain
, in_decl
);
6527 if (domain
== error_mark_node
)
6528 return error_mark_node
;
6530 /* As an optimization, we avoid regenerating the array type if
6531 it will obviously be the same as T. */
6532 if (type
== TREE_TYPE (t
) && domain
== TYPE_DOMAIN (t
))
6535 /* These checks should match the ones in grokdeclarator.
6539 The deduction may fail for any of the following reasons:
6541 -- Attempting to create an array with an element type that
6542 is void, a function type, or a reference type. */
6543 if (TREE_CODE (type
) == VOID_TYPE
6544 || TREE_CODE (type
) == FUNCTION_TYPE
6545 || TREE_CODE (type
) == REFERENCE_TYPE
)
6548 cp_error ("creating array of `%T'", type
);
6549 return error_mark_node
;
6552 r
= build_cplus_array_type (type
, domain
);
6559 tree e1
= tsubst (TREE_OPERAND (t
, 0), args
, complain
,
6561 tree e2
= tsubst (TREE_OPERAND (t
, 1), args
, complain
,
6564 if (e1
== error_mark_node
|| e2
== error_mark_node
)
6565 return error_mark_node
;
6567 return fold (build (TREE_CODE (t
), TREE_TYPE (t
), e1
, e2
));
6573 tree e
= tsubst (TREE_OPERAND (t
, 0), args
, complain
,
6575 if (e
== error_mark_node
)
6576 return error_mark_node
;
6578 return fold (build (TREE_CODE (t
), TREE_TYPE (t
), e
));
6583 tree ctx
= tsubst_aggr_type (TYPE_CONTEXT (t
), args
, complain
,
6584 in_decl
, /*entering_scope=*/1);
6585 tree f
= tsubst_copy (TYPENAME_TYPE_FULLNAME (t
), args
,
6588 if (ctx
== error_mark_node
|| f
== error_mark_node
)
6589 return error_mark_node
;
6591 if (!IS_AGGR_TYPE (ctx
))
6594 cp_error ("`%T' is not a class, struct, or union type",
6596 return error_mark_node
;
6598 else if (!uses_template_parms (ctx
) && !TYPE_BEING_DEFINED (ctx
))
6600 /* Normally, make_typename_type does not require that the CTX
6601 have complete type in order to allow things like:
6603 template <class T> struct S { typename S<T>::X Y; };
6605 But, such constructs have already been resolved by this
6606 point, so here CTX really should have complete type, unless
6607 it's a partial instantiation. */
6608 ctx
= complete_type (ctx
);
6609 if (!COMPLETE_TYPE_P (ctx
))
6612 incomplete_type_error (NULL_TREE
, ctx
);
6613 return error_mark_node
;
6617 f
= make_typename_type (ctx
, f
, complain
);
6618 if (f
== error_mark_node
)
6620 return cp_build_qualified_type_real (f
,
6622 | CP_TYPE_QUALS (t
),
6628 tree e
= tsubst (TREE_OPERAND (t
, 0), args
, complain
,
6630 if (e
== error_mark_node
)
6631 return error_mark_node
;
6632 return make_pointer_declarator (type
, e
);
6637 tree e
= tsubst (TREE_OPERAND (t
, 0), args
, complain
,
6639 if (e
== error_mark_node
)
6640 return error_mark_node
;
6641 return make_reference_declarator (type
, e
);
6646 tree e1
= tsubst (TREE_OPERAND (t
, 0), args
, complain
,
6648 tree e2
= tsubst_expr (TREE_OPERAND (t
, 1), args
, complain
,
6650 if (e1
== error_mark_node
|| e2
== error_mark_node
)
6651 return error_mark_node
;
6653 return build_parse_node (ARRAY_REF
, e1
, e2
, tsubst_expr
);
6658 tree e1
= tsubst (TREE_OPERAND (t
, 0), args
, complain
,
6660 tree e2
= (tsubst_call_declarator_parms
6661 (CALL_DECLARATOR_PARMS (t
), args
, complain
, in_decl
));
6662 tree e3
= tsubst (CALL_DECLARATOR_EXCEPTION_SPEC (t
), args
,
6665 if (e1
== error_mark_node
|| e2
== error_mark_node
6666 || e3
== error_mark_node
)
6667 return error_mark_node
;
6669 return make_call_declarator (e1
, e2
, CALL_DECLARATOR_QUALS (t
), e3
);
6674 tree e1
= tsubst (TREE_OPERAND (t
, 0), args
, complain
,
6676 tree e2
= tsubst (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
6677 if (e1
== error_mark_node
|| e2
== error_mark_node
)
6678 return error_mark_node
;
6680 return build_parse_node (TREE_CODE (t
), e1
, e2
);
6685 tree e1
= tsubst_expr (TYPE_FIELDS (t
), args
, complain
,
6687 if (e1
== error_mark_node
)
6688 return error_mark_node
;
6690 return TREE_TYPE (e1
);
6700 /* This code should match declare_hidden_char_array in
6702 name
= (*decl_printable_name
) (current_function_decl
, 2);
6703 len
= strlen (name
) + 1;
6704 type
= build_array_type (char_type_node
,
6705 build_index_type (build_int_2 (len
, 0)));
6706 str
= build_string (len
, name
);
6707 TREE_TYPE (str
) = type
;
6712 sorry ("use of `%s' in template",
6713 tree_code_name
[(int) TREE_CODE (t
)]);
6714 return error_mark_node
;
6718 /* Like tsubst, but deals with expressions. This function just replaces
6719 template parms; to finish processing the resultant expression, use
6723 tsubst_copy (t
, args
, complain
, in_decl
)
6728 enum tree_code code
;
6731 if (t
== NULL_TREE
|| t
== error_mark_node
)
6734 code
= TREE_CODE (t
);
6739 return do_identifier (DECL_NAME (t
), 0, NULL_TREE
);
6746 if (!DECL_CONTEXT (t
))
6747 /* This is a global enumeration constant. */
6750 /* Unfortunately, we cannot just call lookup_name here.
6753 template <int I> int f() {
6755 struct S { void g() { E e = a; } };
6758 When we instantiate f<7>::S::g(), say, lookup_name is not
6759 clever enough to find f<7>::a. */
6761 = tsubst_aggr_type (TREE_TYPE (t
), args
, complain
, in_decl
,
6762 /*entering_scope=*/0);
6764 for (v
= TYPE_VALUES (enum_type
);
6767 if (TREE_PURPOSE (v
) == DECL_NAME (t
))
6768 return TREE_VALUE (v
);
6770 /* We didn't find the name. That should never happen; if
6771 name-lookup found it during preliminary parsing, we
6772 should find it again here during instantiation. */
6773 my_friendly_abort (0);
6778 if (DECL_CONTEXT (t
))
6782 ctx
= tsubst_aggr_type (DECL_CONTEXT (t
), args
, complain
, in_decl
,
6783 /*entering_scope=*/1);
6784 if (ctx
!= DECL_CONTEXT (t
))
6785 return lookup_field (ctx
, DECL_NAME (t
), 0, 0);
6791 if (DECL_LANG_SPECIFIC (t
) && DECL_TEMPLATE_INFO (t
))
6792 t
= tsubst (t
, args
, complain
, in_decl
);
6797 if (is_member_template (t
))
6798 return tsubst (t
, args
, complain
, in_decl
);
6804 /* We must tsbust into a LOOKUP_EXPR in case the names to
6805 which it refers is a conversion operator; in that case the
6806 name will change. We avoid making unnecessary copies,
6809 tree id
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
6811 if (id
!= TREE_OPERAND (t
, 0))
6813 r
= build_nt (LOOKUP_EXPR
, id
);
6814 LOOKUP_EXPR_GLOBAL (r
) = LOOKUP_EXPR_GLOBAL (t
);
6822 case REINTERPRET_CAST_EXPR
:
6823 case CONST_CAST_EXPR
:
6824 case STATIC_CAST_EXPR
:
6825 case DYNAMIC_CAST_EXPR
:
6828 (code
, tsubst (TREE_TYPE (t
), args
, complain
, in_decl
),
6829 tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
));
6832 case PREDECREMENT_EXPR
:
6833 case PREINCREMENT_EXPR
:
6834 case POSTDECREMENT_EXPR
:
6835 case POSTINCREMENT_EXPR
:
6837 case TRUTH_NOT_EXPR
:
6840 case CONVERT_EXPR
: /* Unary + */
6849 (code
, tsubst (TREE_TYPE (t
), args
, complain
, in_decl
),
6850 tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
));
6855 case TRUNC_DIV_EXPR
:
6857 case FLOOR_DIV_EXPR
:
6858 case ROUND_DIV_EXPR
:
6859 case EXACT_DIV_EXPR
:
6861 case BIT_ANDTC_EXPR
:
6864 case TRUNC_MOD_EXPR
:
6865 case FLOOR_MOD_EXPR
:
6866 case TRUTH_ANDIF_EXPR
:
6867 case TRUTH_ORIF_EXPR
:
6868 case TRUTH_AND_EXPR
:
6889 (code
, tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
),
6890 tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
));
6894 tree fn
= TREE_OPERAND (t
, 0);
6895 if (is_overloaded_fn (fn
))
6896 fn
= tsubst_copy (get_first_fn (fn
), args
, complain
, in_decl
);
6898 /* Sometimes FN is a LOOKUP_EXPR. */
6899 fn
= tsubst_copy (fn
, args
, complain
, in_decl
);
6901 (code
, fn
, tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
,
6906 case METHOD_CALL_EXPR
:
6908 tree name
= TREE_OPERAND (t
, 0);
6909 if (TREE_CODE (name
) == BIT_NOT_EXPR
)
6911 name
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
6913 name
= build1 (BIT_NOT_EXPR
, NULL_TREE
, name
);
6915 else if (TREE_CODE (name
) == SCOPE_REF
6916 && TREE_CODE (TREE_OPERAND (name
, 1)) == BIT_NOT_EXPR
)
6918 tree base
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
6920 name
= TREE_OPERAND (name
, 1);
6921 name
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
6923 name
= build1 (BIT_NOT_EXPR
, NULL_TREE
, name
);
6924 name
= build_nt (SCOPE_REF
, base
, name
);
6927 name
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
6929 (code
, name
, tsubst_copy (TREE_OPERAND (t
, 1), args
,
6931 tsubst_copy (TREE_OPERAND (t
, 2), args
, complain
, in_decl
),
6936 /* This processing should really occur in tsubst_expr, However,
6937 tsubst_expr does not recurse into expressions, since it
6938 assumes that there aren't any statements inside them.
6939 Instead, it simply calls build_expr_from_tree. So, we need
6940 to expand the STMT_EXPR here. */
6941 if (!processing_template_decl
)
6943 tree stmt_expr
= begin_stmt_expr ();
6944 tsubst_expr (STMT_EXPR_STMT (t
), args
,
6946 return finish_stmt_expr (stmt_expr
);
6953 case PSEUDO_DTOR_EXPR
:
6956 (code
, tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
),
6957 tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
),
6958 tsubst_copy (TREE_OPERAND (t
, 2), args
, complain
, in_decl
));
6965 (code
, tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
),
6966 tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
),
6967 tsubst_copy (TREE_OPERAND (t
, 2), args
, complain
, in_decl
));
6968 NEW_EXPR_USE_GLOBAL (r
) = NEW_EXPR_USE_GLOBAL (t
);
6975 (code
, tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
),
6976 tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
));
6977 DELETE_EXPR_USE_GLOBAL (r
) = DELETE_EXPR_USE_GLOBAL (t
);
6978 DELETE_EXPR_USE_VEC (r
) = DELETE_EXPR_USE_VEC (t
);
6982 case TEMPLATE_ID_EXPR
:
6984 /* Substituted template arguments */
6985 tree targs
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
,
6988 if (targs
&& TREE_CODE (targs
) == TREE_LIST
)
6991 for (chain
= targs
; chain
; chain
= TREE_CHAIN (chain
))
6992 TREE_VALUE (chain
) = maybe_fold_nontype_arg (TREE_VALUE (chain
));
6997 for (i
= 0; i
< TREE_VEC_LENGTH (targs
); ++i
)
6998 TREE_VEC_ELT (targs
, i
)
6999 = maybe_fold_nontype_arg (TREE_VEC_ELT (targs
, i
));
7002 return lookup_template_function
7003 (tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
), targs
);
7008 tree purpose
, value
, chain
;
7010 if (t
== void_list_node
)
7013 purpose
= TREE_PURPOSE (t
);
7015 purpose
= tsubst_copy (purpose
, args
, complain
, in_decl
);
7016 value
= TREE_VALUE (t
);
7018 value
= tsubst_copy (value
, args
, complain
, in_decl
);
7019 chain
= TREE_CHAIN (t
);
7020 if (chain
&& chain
!= void_type_node
)
7021 chain
= tsubst_copy (chain
, args
, complain
, in_decl
);
7022 if (purpose
== TREE_PURPOSE (t
)
7023 && value
== TREE_VALUE (t
)
7024 && chain
== TREE_CHAIN (t
))
7026 return tree_cons (purpose
, value
, chain
);
7033 case TEMPLATE_TYPE_PARM
:
7034 case TEMPLATE_TEMPLATE_PARM
:
7035 case TEMPLATE_PARM_INDEX
:
7037 case REFERENCE_TYPE
:
7044 return tsubst (t
, args
, complain
, in_decl
);
7046 case IDENTIFIER_NODE
:
7047 if (IDENTIFIER_TYPENAME_P (t
))
7049 tree new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
7051 return mangle_conv_op_name_for_type (new_type
);
7053 return (build_typename_overload (new_type
));
7061 (CONSTRUCTOR
, tsubst (TREE_TYPE (t
), args
, complain
, in_decl
),
7062 NULL_TREE
, tsubst_copy (CONSTRUCTOR_ELTS (t
), args
,
7063 complain
, in_decl
));
7064 TREE_HAS_CONSTRUCTOR (r
) = TREE_HAS_CONSTRUCTOR (t
);
7069 return build_x_va_arg (tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
,
7071 tsubst (TREE_TYPE (t
), args
, complain
, in_decl
));
7074 return tsubst (t
, args
, complain
, in_decl
);
7081 /* Like tsubst_copy, but also does semantic processing. */
7084 tsubst_expr (t
, args
, complain
, in_decl
)
7091 if (t
== NULL_TREE
|| t
== error_mark_node
)
7094 if (processing_template_decl
)
7095 return tsubst_copy (t
, args
, complain
, in_decl
);
7097 switch (TREE_CODE (t
))
7101 finish_named_return_value
7102 (TREE_OPERAND (t
, 0),
7103 tsubst_expr (TREE_OPERAND (t
, 1), args
, /*complain=*/1, in_decl
));
7104 tsubst_expr (TREE_CHAIN (t
), args
, complain
, in_decl
);
7107 case CTOR_INITIALIZER
:
7109 tree member_init_list
;
7110 tree base_init_list
;
7114 = tsubst_initializer_list (TREE_OPERAND (t
, 0), args
);
7116 = tsubst_initializer_list (TREE_OPERAND (t
, 1), args
);
7117 setup_vtbl_ptr (member_init_list
, base_init_list
);
7118 tsubst_expr (TREE_CHAIN (t
), args
, complain
, in_decl
);
7124 finish_return_stmt (tsubst_expr (RETURN_EXPR (t
),
7125 args
, complain
, in_decl
));
7130 finish_expr_stmt (tsubst_expr (EXPR_STMT_EXPR (t
),
7131 args
, complain
, in_decl
));
7140 decl
= DECL_STMT_DECL (t
);
7141 if (TREE_CODE (decl
) == LABEL_DECL
)
7142 finish_label_decl (DECL_NAME (decl
));
7145 init
= DECL_INITIAL (decl
);
7146 decl
= tsubst (decl
, args
, complain
, in_decl
);
7147 init
= tsubst_expr (init
, args
, complain
, in_decl
);
7149 DECL_INITIAL (decl
) = error_mark_node
;
7150 /* By marking the declaration as instantiated, we avoid
7151 trying to instantiate it. Since instantiate_decl can't
7152 handle local variables, and since we've already done
7153 all that needs to be done, that's the right thing to
7155 if (TREE_CODE (decl
) == VAR_DECL
)
7156 DECL_TEMPLATE_INSTANTIATED (decl
) = 1;
7157 maybe_push_decl (decl
);
7158 cp_finish_decl (decl
, init
, NULL_TREE
, 0);
7168 stmt
= begin_for_stmt ();
7169 for (tmp
= FOR_INIT_STMT (t
); tmp
; tmp
= TREE_CHAIN (tmp
))
7170 tsubst_expr (tmp
, args
, complain
, in_decl
);
7171 finish_for_init_stmt (stmt
);
7172 finish_for_cond (tsubst_expr (FOR_COND (t
), args
,
7175 tmp
= tsubst_expr (FOR_EXPR (t
), args
, complain
, in_decl
);
7176 finish_for_expr (tmp
, stmt
);
7177 tsubst_expr (FOR_BODY (t
), args
, complain
, in_decl
);
7178 finish_for_stmt (stmt
);
7185 stmt
= begin_while_stmt ();
7186 finish_while_stmt_cond (tsubst_expr (WHILE_COND (t
),
7187 args
, complain
, in_decl
),
7189 tsubst_expr (WHILE_BODY (t
), args
, complain
, in_decl
);
7190 finish_while_stmt (stmt
);
7197 stmt
= begin_do_stmt ();
7198 tsubst_expr (DO_BODY (t
), args
, complain
, in_decl
);
7199 finish_do_body (stmt
);
7200 finish_do_stmt (tsubst_expr (DO_COND (t
), args
,
7211 stmt
= begin_if_stmt ();
7212 finish_if_stmt_cond (tsubst_expr (IF_COND (t
),
7213 args
, complain
, in_decl
),
7216 if (tmp
= THEN_CLAUSE (t
), tmp
)
7218 tsubst_expr (tmp
, args
, complain
, in_decl
);
7219 finish_then_clause (stmt
);
7222 if (tmp
= ELSE_CLAUSE (t
), tmp
)
7224 begin_else_clause ();
7225 tsubst_expr (tmp
, args
, complain
, in_decl
);
7226 finish_else_clause (stmt
);
7238 stmt
= begin_compound_stmt (COMPOUND_STMT_NO_SCOPE (t
));
7239 for (substmt
= COMPOUND_BODY (t
);
7240 substmt
!= NULL_TREE
;
7241 substmt
= TREE_CHAIN (substmt
))
7242 tsubst_expr (substmt
, args
, complain
, in_decl
);
7243 return finish_compound_stmt (COMPOUND_STMT_NO_SCOPE (t
), stmt
);
7249 finish_break_stmt ();
7254 finish_continue_stmt ();
7262 stmt
= begin_switch_stmt ();
7263 val
= tsubst_expr (SWITCH_COND (t
), args
, complain
, in_decl
);
7264 finish_switch_cond (val
, stmt
);
7265 tsubst_expr (SWITCH_BODY (t
), args
, complain
, in_decl
);
7266 finish_switch_stmt (stmt
);
7272 finish_case_label (tsubst_expr (CASE_LOW (t
), args
, complain
, in_decl
),
7273 tsubst_expr (CASE_HIGH (t
), args
, complain
, in_decl
));
7277 lineno
= STMT_LINENO (t
);
7278 finish_label_stmt (DECL_NAME (LABEL_STMT_LABEL (t
)));
7283 t
= GOTO_DESTINATION (t
);
7284 if (TREE_CODE (t
) != LABEL_DECL
)
7285 /* Computed goto's must be tsubst'd into. On the other hand,
7286 non-computed gotos must not be; the identifier in question
7287 will have no binding. */
7288 t
= tsubst_expr (t
, args
, complain
, in_decl
);
7291 finish_goto_stmt (t
);
7296 finish_asm_stmt (ASM_CV_QUAL (t
),
7297 tsubst_expr (ASM_STRING (t
), args
, complain
, in_decl
),
7298 tsubst_expr (ASM_OUTPUTS (t
), args
, complain
, in_decl
),
7299 tsubst_expr (ASM_INPUTS (t
), args
, complain
, in_decl
),
7300 tsubst_expr (ASM_CLOBBERS (t
), args
, complain
,
7308 stmt
= begin_try_block ();
7309 tsubst_expr (TRY_STMTS (t
), args
, complain
, in_decl
);
7310 finish_cleanup_try_block (stmt
);
7311 finish_cleanup (tsubst_expr (TRY_HANDLERS (t
), args
,
7319 if (FN_TRY_BLOCK_P (t
))
7320 stmt
= begin_function_try_block ();
7322 stmt
= begin_try_block ();
7324 tsubst_expr (TRY_STMTS (t
), args
, complain
, in_decl
);
7326 if (FN_TRY_BLOCK_P (t
))
7327 finish_function_try_block (stmt
);
7329 finish_try_block (stmt
);
7331 handler
= TRY_HANDLERS (t
);
7332 for (; handler
; handler
= TREE_CHAIN (handler
))
7333 tsubst_expr (handler
, args
, complain
, in_decl
);
7334 if (FN_TRY_BLOCK_P (t
))
7335 finish_function_handler_sequence (stmt
);
7337 finish_handler_sequence (stmt
);
7347 stmt
= begin_handler ();
7348 if (HANDLER_PARMS (t
))
7350 decl
= DECL_STMT_DECL (HANDLER_PARMS (t
));
7351 decl
= tsubst (decl
, args
, complain
, in_decl
);
7352 /* Prevent instantiate_decl from trying to instantiate
7353 this variable. We've already done all that needs to be
7355 DECL_TEMPLATE_INSTANTIATED (decl
) = 1;
7359 blocks
= finish_handler_parms (decl
, stmt
);
7360 tsubst_expr (HANDLER_BODY (t
), args
, complain
, in_decl
);
7361 finish_handler (blocks
, stmt
);
7368 tsubst (t
, args
, complain
, NULL_TREE
);
7372 return build_expr_from_tree (tsubst_copy (t
, args
, complain
, in_decl
));
7377 /* TMPL is a TEMPLATE_DECL for a cloned constructor or destructor.
7378 Instantiate it with the ARGS. */
7381 instantiate_clone (tmpl
, args
)
7388 /* Instantiated the cloned function, rather than the clone. */
7389 spec
= instantiate_template (DECL_CLONED_FUNCTION (tmpl
), args
);
7391 /* Then, see if we've already cloned the instantiation. */
7392 for (clone
= TREE_CHAIN (spec
);
7393 clone
&& DECL_CLONED_FUNCTION_P (clone
);
7394 clone
= TREE_CHAIN (clone
))
7395 if (DECL_NAME (clone
) == DECL_NAME (tmpl
))
7398 /* If we haven't, do so know. */
7400 clone_function_decl (spec
, /*update_method_vec_p=*/0);
7403 for (clone
= TREE_CHAIN (spec
);
7404 clone
&& DECL_CLONED_FUNCTION_P (clone
);
7405 clone
= TREE_CHAIN (clone
))
7406 if (DECL_NAME (clone
) == DECL_NAME (tmpl
))
7409 /* We should always have found the clone by now. */
7410 my_friendly_abort (20000411);
7414 /* Instantiate the indicated variable or function template TMPL with
7415 the template arguments in TARG_PTR. */
7418 instantiate_template (tmpl
, targ_ptr
)
7419 tree tmpl
, targ_ptr
;
7428 if (tmpl
== error_mark_node
)
7429 return error_mark_node
;
7431 my_friendly_assert (TREE_CODE (tmpl
) == TEMPLATE_DECL
, 283);
7433 /* If this function is a clone, handle it specially. */
7434 if (DECL_CLONED_FUNCTION_P (tmpl
))
7435 return instantiate_clone (tmpl
, targ_ptr
);
7437 /* Check to see if we already have this specialization. */
7438 spec
= retrieve_specialization (tmpl
, targ_ptr
);
7439 if (spec
!= NULL_TREE
)
7442 gen_tmpl
= most_general_template (tmpl
);
7443 if (tmpl
!= gen_tmpl
)
7445 /* The TMPL is a partial instantiation. To get a full set of
7446 arguments we must add the arguments used to perform the
7447 partial instantiation. */
7448 targ_ptr
= add_outermost_template_args (DECL_TI_ARGS (tmpl
),
7451 /* Check to see if we already have this specialization. */
7452 spec
= retrieve_specialization (gen_tmpl
, targ_ptr
);
7453 if (spec
!= NULL_TREE
)
7457 len
= DECL_NTPARMS (gen_tmpl
);
7458 inner_args
= INNERMOST_TEMPLATE_ARGS (targ_ptr
);
7462 tree t
= TREE_VEC_ELT (inner_args
, i
);
7465 tree nt
= target_type (t
);
7466 if (IS_AGGR_TYPE (nt
) && decl_function_context (TYPE_MAIN_DECL (nt
)))
7468 cp_error ("type `%T' composed from a local class is not a valid template-argument", t
);
7469 cp_error (" trying to instantiate `%D'", gen_tmpl
);
7470 return error_mark_node
;
7475 /* substitute template parameters */
7476 fndecl
= tsubst (DECL_TEMPLATE_RESULT (gen_tmpl
),
7477 targ_ptr
, /*complain=*/1, gen_tmpl
);
7478 /* The DECL_TI_TEMPLATE should always be the immediate parent
7479 template, not the most general template. */
7480 DECL_TI_TEMPLATE (fndecl
) = tmpl
;
7482 if (flag_external_templates
)
7483 add_pending_template (fndecl
);
7485 /* If we've just instantiated the main entry point for a function,
7486 instantiate all the alternate entry points as well. */
7487 for (clone
= TREE_CHAIN (gen_tmpl
);
7488 clone
&& DECL_CLONED_FUNCTION_P (clone
);
7489 clone
= TREE_CHAIN (clone
))
7490 instantiate_template (clone
, targ_ptr
);
7495 /* Push the name of the class template into the scope of the instantiation. */
7498 overload_template_name (type
)
7501 tree id
= DECL_NAME (CLASSTYPE_TI_TEMPLATE (type
));
7504 if (IDENTIFIER_CLASS_VALUE (id
)
7505 && TREE_TYPE (IDENTIFIER_CLASS_VALUE (id
)) == type
)
7508 decl
= build_decl (TYPE_DECL
, id
, type
);
7509 DECL_ARTIFICIAL (decl
) = 1;
7510 pushdecl_class_level (decl
);
7513 /* The FN is a TEMPLATE_DECL for a function. The ARGS are the
7514 arguments that are being used when calling it. TARGS is a vector
7515 into which the deduced template arguments are placed.
7517 Return zero for success, 2 for an incomplete match that doesn't resolve
7518 all the types, and 1 for complete failure. An error message will be
7519 printed only for an incomplete match.
7521 If FN is a conversion operator, RETURN_TYPE is the type desired as
7522 the result of the conversion operator.
7524 TPARMS is a vector of template parameters.
7526 The EXPLICIT_TARGS are explicit template arguments provided via a
7529 The parameter STRICT is one of:
7532 We are deducing arguments for a function call, as in
7536 We are deducing arguments for a conversion function, as in
7540 We are deducing arguments when calculating the partial
7541 ordering between specializations of function or class
7542 templates, as in [temp.func.order] and [temp.class.order],
7543 when doing an explicit instantiation as in [temp.explicit],
7544 when determining an explicit specialization as in
7545 [temp.expl.spec], or when taking the address of a function
7546 template, as in [temp.deduct.funcaddr].
7548 The other arguments are as for type_unification. */
7551 fn_type_unification (fn
, explicit_targs
, targs
, args
, return_type
,
7553 tree fn
, explicit_targs
, targs
, args
, return_type
;
7554 unification_kind_t strict
;
7560 my_friendly_assert (TREE_CODE (fn
) == TEMPLATE_DECL
, 0);
7562 fntype
= TREE_TYPE (fn
);
7567 The specified template arguments must match the template
7568 parameters in kind (i.e., type, nontype, template), and there
7569 must not be more arguments than there are parameters;
7570 otherwise type deduction fails.
7572 Nontype arguments must match the types of the corresponding
7573 nontype template parameters, or must be convertible to the
7574 types of the corresponding nontype parameters as specified in
7575 _temp.arg.nontype_, otherwise type deduction fails.
7577 All references in the function type of the function template
7578 to the corresponding template parameters are replaced by the
7579 specified template argument values. If a substitution in a
7580 template parameter or in the function type of the function
7581 template results in an invalid type, type deduction fails. */
7583 tree converted_args
;
7586 = (coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (fn
),
7587 explicit_targs
, NULL_TREE
, /*complain=*/0,
7588 /*require_all_arguments=*/0));
7589 if (converted_args
== error_mark_node
)
7592 fntype
= tsubst (fntype
, converted_args
, /*complain=*/0, NULL_TREE
);
7593 if (fntype
== error_mark_node
)
7596 /* Place the explicitly specified arguments in TARGS. */
7597 for (i
= 0; i
< TREE_VEC_LENGTH (targs
); i
++)
7598 TREE_VEC_ELT (targs
, i
) = TREE_VEC_ELT (converted_args
, i
);
7601 parms
= TYPE_ARG_TYPES (fntype
);
7603 if (DECL_CONV_FN_P (fn
))
7605 /* This is a template conversion operator. Remove `this', since
7606 we could be comparing conversions from different classes. */
7607 parms
= TREE_CHAIN (parms
);
7608 args
= TREE_CHAIN (args
);
7609 my_friendly_assert (return_type
!= NULL_TREE
, 20000227);
7614 /* We've been given a return type to match, prepend it. */
7615 parms
= tree_cons (NULL_TREE
, TREE_TYPE (fntype
), parms
);
7616 args
= tree_cons (NULL_TREE
, return_type
, args
);
7619 /* We allow incomplete unification without an error message here
7620 because the standard doesn't seem to explicitly prohibit it. Our
7621 callers must be ready to deal with unification failures in any
7623 result
= type_unification_real (DECL_INNERMOST_TEMPLATE_PARMS (fn
),
7624 targs
, parms
, args
, /*subr=*/0,
7625 strict
, /*allow_incomplete*/1);
7628 /* All is well so far. Now, check:
7632 When all template arguments have been deduced, all uses of
7633 template parameters in nondeduced contexts are replaced with
7634 the corresponding deduced argument values. If the
7635 substitution results in an invalid type, as described above,
7636 type deduction fails. */
7637 if (tsubst (TREE_TYPE (fn
), targs
, /*complain=*/0, NULL_TREE
)
7644 /* Adjust types before performing type deduction, as described in
7645 [temp.deduct.call] and [temp.deduct.conv]. The rules in these two
7646 sections are symmetric. PARM is the type of a function parameter
7647 or the return type of the conversion function. ARG is the type of
7648 the argument passed to the call, or the type of the value
7649 intialized with the result of the conversion function. */
7652 maybe_adjust_types_for_deduction (strict
, parm
, arg
)
7653 unification_kind_t strict
;
7664 /* Swap PARM and ARG throughout the remainder of this
7665 function; the handling is precisely symmetric since PARM
7666 will initialize ARG rather than vice versa. */
7674 /* There is nothing to do in this case. */
7678 my_friendly_abort (0);
7681 if (TREE_CODE (*parm
) != REFERENCE_TYPE
)
7683 /* [temp.deduct.call]
7685 If P is not a reference type:
7687 --If A is an array type, the pointer type produced by the
7688 array-to-pointer standard conversion (_conv.array_) is
7689 used in place of A for type deduction; otherwise,
7691 --If A is a function type, the pointer type produced by
7692 the function-to-pointer standard conversion
7693 (_conv.func_) is used in place of A for type deduction;
7696 --If A is a cv-qualified type, the top level
7697 cv-qualifiers of A's type are ignored for type
7699 if (TREE_CODE (*arg
) == ARRAY_TYPE
)
7700 *arg
= build_pointer_type (TREE_TYPE (*arg
));
7701 else if (TREE_CODE (*arg
) == FUNCTION_TYPE
)
7702 *arg
= build_pointer_type (*arg
);
7704 *arg
= TYPE_MAIN_VARIANT (*arg
);
7707 /* [temp.deduct.call]
7709 If P is a cv-qualified type, the top level cv-qualifiers
7710 of P's type are ignored for type deduction. If P is a
7711 reference type, the type referred to by P is used for
7713 *parm
= TYPE_MAIN_VARIANT (*parm
);
7714 if (TREE_CODE (*parm
) == REFERENCE_TYPE
)
7715 *parm
= TREE_TYPE (*parm
);
7718 /* Like type_unfication.
7720 If SUBR is 1, we're being called recursively (to unify the
7721 arguments of a function or method parameter of a function
7725 type_unification_real (tparms
, targs
, parms
, args
, subr
,
7726 strict
, allow_incomplete
)
7727 tree tparms
, targs
, parms
, args
;
7729 unification_kind_t strict
;
7730 int allow_incomplete
;
7734 int ntparms
= TREE_VEC_LENGTH (tparms
);
7737 my_friendly_assert (TREE_CODE (tparms
) == TREE_VEC
, 289);
7738 my_friendly_assert (parms
== NULL_TREE
7739 || TREE_CODE (parms
) == TREE_LIST
, 290);
7740 /* ARGS could be NULL (via a call from parse.y to
7741 build_x_function_call). */
7743 my_friendly_assert (TREE_CODE (args
) == TREE_LIST
, 291);
7744 my_friendly_assert (ntparms
> 0, 292);
7749 sub_strict
= UNIFY_ALLOW_MORE_CV_QUAL
| UNIFY_ALLOW_DERIVED
;
7753 sub_strict
= UNIFY_ALLOW_LESS_CV_QUAL
;
7757 sub_strict
= UNIFY_ALLOW_NONE
;
7761 my_friendly_abort (0);
7765 && parms
!= void_list_node
7767 && args
!= void_list_node
)
7769 parm
= TREE_VALUE (parms
);
7770 parms
= TREE_CHAIN (parms
);
7771 arg
= TREE_VALUE (args
);
7772 args
= TREE_CHAIN (args
);
7774 if (arg
== error_mark_node
)
7776 if (arg
== unknown_type_node
)
7777 /* We can't deduce anything from this, but we might get all the
7778 template args from other function args. */
7781 /* Conversions will be performed on a function argument that
7782 corresponds with a function parameter that contains only
7783 non-deducible template parameters and explicitly specified
7784 template parameters. */
7785 if (! uses_template_parms (parm
))
7790 type
= TREE_TYPE (arg
);
7797 if (strict
== DEDUCE_EXACT
)
7799 if (same_type_p (parm
, type
))
7803 /* It might work; we shouldn't check now, because we might
7804 get into infinite recursion. Overload resolution will
7813 my_friendly_assert (TREE_TYPE (arg
) != NULL_TREE
, 293);
7814 if (type_unknown_p (arg
))
7816 /* [temp.deduct.type] A template-argument can be deduced from
7817 a pointer to function or pointer to member function
7818 argument if the set of overloaded functions does not
7819 contain function templates and at most one of a set of
7820 overloaded functions provides a unique match. */
7822 if (resolve_overloaded_unification
7823 (tparms
, targs
, parm
, arg
, strict
, sub_strict
)
7828 arg
= TREE_TYPE (arg
);
7832 maybe_adjust_types_for_deduction (strict
, &parm
, &arg
);
7834 switch (unify (tparms
, targs
, parm
, arg
, sub_strict
))
7842 /* Fail if we've reached the end of the parm list, and more args
7843 are present, and the parm list isn't variadic. */
7844 if (args
&& args
!= void_list_node
&& parms
== void_list_node
)
7846 /* Fail if parms are left and they don't have default values. */
7848 && parms
!= void_list_node
7849 && TREE_PURPOSE (parms
) == NULL_TREE
)
7852 for (i
= 0; i
< ntparms
; i
++)
7853 if (TREE_VEC_ELT (targs
, i
) == NULL_TREE
)
7855 if (!allow_incomplete
)
7856 error ("incomplete type unification");
7862 /* Subroutine of type_unification_real. Args are like the variables at the
7863 call site. ARG is an overloaded function (or template-id); we try
7864 deducing template args from each of the overloads, and if only one
7865 succeeds, we go with that. Modifies TARGS and returns 0 on success. */
7868 resolve_overloaded_unification (tparms
, targs
, parm
, arg
, strict
,
7870 tree tparms
, targs
, parm
, arg
;
7871 unification_kind_t strict
;
7874 tree tempargs
= copy_node (targs
);
7877 if (TREE_CODE (arg
) == ADDR_EXPR
)
7878 arg
= TREE_OPERAND (arg
, 0);
7880 if (TREE_CODE (arg
) == COMPONENT_REF
)
7881 /* Handle `&x' where `x' is some static or non-static member
7883 arg
= TREE_OPERAND (arg
, 1);
7885 if (TREE_CODE (arg
) == OFFSET_REF
)
7886 arg
= TREE_OPERAND (arg
, 1);
7888 /* Strip baselink information. */
7889 while (TREE_CODE (arg
) == TREE_LIST
)
7890 arg
= TREE_VALUE (arg
);
7892 if (TREE_CODE (arg
) == TEMPLATE_ID_EXPR
)
7894 /* If we got some explicit template args, we need to plug them into
7895 the affected templates before we try to unify, in case the
7896 explicit args will completely resolve the templates in question. */
7898 tree expl_subargs
= TREE_OPERAND (arg
, 1);
7899 arg
= TREE_OPERAND (arg
, 0);
7901 for (; arg
; arg
= OVL_NEXT (arg
))
7903 tree fn
= OVL_CURRENT (arg
);
7906 if (TREE_CODE (fn
) != TEMPLATE_DECL
)
7909 subargs
= get_bindings_overload (fn
, DECL_TEMPLATE_RESULT (fn
),
7913 elem
= tsubst (TREE_TYPE (fn
), subargs
, /*complain=*/0,
7915 if (TREE_CODE (elem
) == METHOD_TYPE
)
7916 elem
= build_ptrmemfunc_type (build_pointer_type (elem
));
7917 good
+= try_one_overload (tparms
, targs
, tempargs
, parm
, elem
,
7918 strict
, sub_strict
);
7922 else if (TREE_CODE (arg
) == OVERLOAD
)
7924 for (; arg
; arg
= OVL_NEXT (arg
))
7926 tree type
= TREE_TYPE (OVL_CURRENT (arg
));
7927 if (TREE_CODE (type
) == METHOD_TYPE
)
7928 type
= build_ptrmemfunc_type (build_pointer_type (type
));
7929 good
+= try_one_overload (tparms
, targs
, tempargs
, parm
,
7931 strict
, sub_strict
);
7935 my_friendly_abort (981006);
7937 /* [temp.deduct.type] A template-argument can be deduced from a pointer
7938 to function or pointer to member function argument if the set of
7939 overloaded functions does not contain function templates and at most
7940 one of a set of overloaded functions provides a unique match.
7942 So if we found multiple possibilities, we return success but don't
7947 int i
= TREE_VEC_LENGTH (targs
);
7949 if (TREE_VEC_ELT (tempargs
, i
))
7950 TREE_VEC_ELT (targs
, i
) = TREE_VEC_ELT (tempargs
, i
);
7958 /* Subroutine of resolve_overloaded_unification; does deduction for a single
7959 overload. Fills TARGS with any deduced arguments, or error_mark_node if
7960 different overloads deduce different arguments for a given parm.
7961 Returns 1 on success. */
7964 try_one_overload (tparms
, orig_targs
, targs
, parm
, arg
, strict
,
7966 tree tparms
, orig_targs
, targs
, parm
, arg
;
7967 unification_kind_t strict
;
7974 /* [temp.deduct.type] A template-argument can be deduced from a pointer
7975 to function or pointer to member function argument if the set of
7976 overloaded functions does not contain function templates and at most
7977 one of a set of overloaded functions provides a unique match.
7979 So if this is a template, just return success. */
7981 if (uses_template_parms (arg
))
7984 maybe_adjust_types_for_deduction (strict
, &parm
, &arg
);
7986 /* We don't copy orig_targs for this because if we have already deduced
7987 some template args from previous args, unify would complain when we
7988 try to deduce a template parameter for the same argument, even though
7989 there isn't really a conflict. */
7990 nargs
= TREE_VEC_LENGTH (targs
);
7991 tempargs
= make_tree_vec (nargs
);
7993 if (unify (tparms
, tempargs
, parm
, arg
, sub_strict
) != 0)
7996 /* First make sure we didn't deduce anything that conflicts with
7997 explicitly specified args. */
7998 for (i
= nargs
; i
--; )
8000 tree elt
= TREE_VEC_ELT (tempargs
, i
);
8001 tree oldelt
= TREE_VEC_ELT (orig_targs
, i
);
8003 if (elt
== NULL_TREE
)
8005 else if (uses_template_parms (elt
))
8007 /* Since we're unifying against ourselves, we will fill in template
8008 args used in the function parm list with our own template parms.
8010 TREE_VEC_ELT (tempargs
, i
) = NULL_TREE
;
8013 else if (oldelt
&& ! template_args_equal (oldelt
, elt
))
8017 for (i
= nargs
; i
--; )
8019 tree elt
= TREE_VEC_ELT (tempargs
, i
);
8022 TREE_VEC_ELT (targs
, i
) = elt
;
8028 /* PARM is a template class (perhaps with unbound template
8029 parameters). ARG is a fully instantiated type. If ARG can be
8030 bound to PARM, return ARG, otherwise return NULL_TREE. TPARMS and
8031 TARGS are as for unify. */
8034 try_class_unification (tparms
, targs
, parm
, arg
)
8043 if (!CLASSTYPE_TEMPLATE_INFO (arg
)
8044 || CLASSTYPE_TI_TEMPLATE (arg
) != CLASSTYPE_TI_TEMPLATE (parm
))
8047 /* We need to make a new template argument vector for the call to
8048 unify. If we used TARGS, we'd clutter it up with the result of
8049 the attempted unification, even if this class didn't work out.
8050 We also don't want to commit ourselves to all the unifications
8051 we've already done, since unification is supposed to be done on
8052 an argument-by-argument basis. In other words, consider the
8053 following pathological case:
8055 template <int I, int J, int K>
8058 template <int I, int J>
8059 struct S<I, J, 2> : public S<I, I, I>, S<J, J, J> {};
8061 template <int I, int J, int K>
8062 void f(S<I, J, K>, S<I, I, I>);
8071 Now, by the time we consider the unification involving `s2', we
8072 already know that we must have `f<0, 0, 0>'. But, even though
8073 `S<0, 1, 2>' is derived from `S<0, 0, 0>', the code is not legal
8074 because there are two ways to unify base classes of S<0, 1, 2>
8075 with S<I, I, I>. If we kept the already deduced knowledge, we
8076 would reject the possibility I=1. */
8077 copy_of_targs
= make_tree_vec (TREE_VEC_LENGTH (targs
));
8078 i
= unify (tparms
, copy_of_targs
, CLASSTYPE_TI_ARGS (parm
),
8079 CLASSTYPE_TI_ARGS (arg
), UNIFY_ALLOW_NONE
);
8081 /* If unification failed, we're done. */
8088 /* Subroutine of get_template_base. RVAL, if non-NULL, is a base we
8089 have alreay discovered to be satisfactory. ARG_BINFO is the binfo
8090 for the base class of ARG that we are currently examining. */
8093 get_template_base_recursive (tparms
, targs
, parm
,
8094 arg_binfo
, rval
, flags
)
8104 tree arg
= BINFO_TYPE (arg_binfo
);
8106 if (!(flags
& GTB_IGNORE_TYPE
))
8108 tree r
= try_class_unification (tparms
, targs
,
8111 /* If there is more than one satisfactory baseclass, then:
8115 If they yield more than one possible deduced A, the type
8119 if (r
&& rval
&& !same_type_p (r
, rval
))
8120 return error_mark_node
;
8125 binfos
= BINFO_BASETYPES (arg_binfo
);
8126 n_baselinks
= binfos
? TREE_VEC_LENGTH (binfos
) : 0;
8128 /* Process base types. */
8129 for (i
= 0; i
< n_baselinks
; i
++)
8131 tree base_binfo
= TREE_VEC_ELT (binfos
, i
);
8134 /* Skip this base, if we've already seen it. */
8135 if (BINFO_MARKED (base_binfo
))
8139 (flags
& GTB_VIA_VIRTUAL
) || TREE_VIA_VIRTUAL (base_binfo
);
8141 /* When searching for a non-virtual, we cannot mark virtually
8144 SET_BINFO_MARKED (base_binfo
);
8146 rval
= get_template_base_recursive (tparms
, targs
,
8150 GTB_VIA_VIRTUAL
* this_virtual
);
8152 /* If we discovered more than one matching base class, we can
8154 if (rval
== error_mark_node
)
8155 return error_mark_node
;
8161 /* Given a template type PARM and a class type ARG, find the unique
8162 base type in ARG that is an instance of PARM. We do not examine
8163 ARG itself; only its base-classes. If there is no appropriate base
8164 class, return NULL_TREE. If there is more than one, return
8165 error_mark_node. PARM may be the type of a partial specialization,
8166 as well as a plain template type. Used by unify. */
8169 get_template_base (tparms
, targs
, parm
, arg
)
8178 my_friendly_assert (IS_AGGR_TYPE_CODE (TREE_CODE (arg
)), 92);
8180 arg_binfo
= TYPE_BINFO (complete_type (arg
));
8181 rval
= get_template_base_recursive (tparms
, targs
,
8186 /* Since get_template_base_recursive marks the bases classes, we
8187 must unmark them here. */
8188 dfs_walk (arg_binfo
, dfs_unmark
, markedp
, 0);
8193 /* Returns the level of DECL, which declares a template parameter. */
8196 template_decl_level (decl
)
8199 switch (TREE_CODE (decl
))
8203 return TEMPLATE_TYPE_LEVEL (TREE_TYPE (decl
));
8206 return TEMPLATE_PARM_LEVEL (DECL_INITIAL (decl
));
8209 my_friendly_abort (0);
8214 /* Decide whether ARG can be unified with PARM, considering only the
8215 cv-qualifiers of each type, given STRICT as documented for unify.
8216 Returns non-zero iff the unification is OK on that basis.*/
8219 check_cv_quals_for_unify (strict
, arg
, parm
)
8224 if (!(strict
& UNIFY_ALLOW_MORE_CV_QUAL
)
8225 && !at_least_as_qualified_p (arg
, parm
))
8228 if (!(strict
& UNIFY_ALLOW_LESS_CV_QUAL
)
8229 && !at_least_as_qualified_p (parm
, arg
))
8235 /* Takes parameters as for type_unification. Returns 0 if the
8236 type deduction suceeds, 1 otherwise. The parameter STRICT is a
8237 bitwise or of the following flags:
8240 Require an exact match between PARM and ARG.
8241 UNIFY_ALLOW_MORE_CV_QUAL:
8242 Allow the deduced ARG to be more cv-qualified than ARG.
8243 UNIFY_ALLOW_LESS_CV_QUAL:
8244 Allow the deduced ARG to be less cv-qualified than ARG.
8245 UNIFY_ALLOW_DERIVED:
8246 Allow the deduced ARG to be a template base class of ARG,
8247 or a pointer to a template base class of the type pointed to by
8249 UNIFY_ALLOW_INTEGER:
8250 Allow any integral type to be deduced. See the TEMPLATE_PARM_INDEX
8251 case for more information. */
8254 unify (tparms
, targs
, parm
, arg
, strict
)
8255 tree tparms
, targs
, parm
, arg
;
8262 /* I don't think this will do the right thing with respect to types.
8263 But the only case I've seen it in so far has been array bounds, where
8264 signedness is the only information lost, and I think that will be
8266 while (TREE_CODE (parm
) == NOP_EXPR
)
8267 parm
= TREE_OPERAND (parm
, 0);
8269 if (arg
== error_mark_node
)
8271 if (arg
== unknown_type_node
)
8272 /* We can't deduce anything from this, but we might get all the
8273 template args from other function args. */
8276 /* If PARM uses template parameters, then we can't bail out here,
8277 even if ARG == PARM, since we won't record unifications for the
8278 template parameters. We might need them if we're trying to
8279 figure out which of two things is more specialized. */
8280 if (arg
== parm
&& !uses_template_parms (parm
))
8283 /* Immediately reject some pairs that won't unify because of
8284 cv-qualification mismatches. */
8285 if (TREE_CODE (arg
) == TREE_CODE (parm
)
8287 /* We check the cv-qualifiers when unifying with template type
8288 parameters below. We want to allow ARG `const T' to unify with
8289 PARM `T' for example, when computing which of two templates
8290 is more specialized, for example. */
8291 && TREE_CODE (arg
) != TEMPLATE_TYPE_PARM
8292 && !check_cv_quals_for_unify (strict
, arg
, parm
))
8295 switch (TREE_CODE (parm
))
8298 /* In a type which contains a nested-name-specifier, template
8299 argument values cannot be deduced for template parameters used
8300 within the nested-name-specifier. */
8303 case TEMPLATE_TYPE_PARM
:
8304 case TEMPLATE_TEMPLATE_PARM
:
8305 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, 0));
8307 if (TEMPLATE_TYPE_LEVEL (parm
)
8308 != template_decl_level (tparm
))
8309 /* The PARM is not one we're trying to unify. Just check
8310 to see if it matches ARG. */
8311 return (TREE_CODE (arg
) == TREE_CODE (parm
)
8312 && same_type_p (parm
, arg
)) ? 0 : 1;
8313 idx
= TEMPLATE_TYPE_IDX (parm
);
8314 targ
= TREE_VEC_ELT (targs
, idx
);
8315 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, idx
));
8317 /* Check for mixed types and values. */
8318 if ((TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
8319 && TREE_CODE (tparm
) != TYPE_DECL
)
8320 || (TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
8321 && TREE_CODE (tparm
) != TEMPLATE_DECL
))
8324 if (TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
)
8326 if (TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (parm
))
8328 /* We arrive here when PARM does not involve template
8331 /* ARG must be constructed from a template class. */
8332 if (TREE_CODE (arg
) != RECORD_TYPE
|| !CLASSTYPE_TEMPLATE_INFO (arg
))
8336 tree parmtmpl
= TYPE_TI_TEMPLATE (parm
);
8337 tree parmvec
= TYPE_TI_ARGS (parm
);
8338 tree argvec
= CLASSTYPE_TI_ARGS (arg
);
8340 = DECL_INNERMOST_TEMPLATE_PARMS (CLASSTYPE_TI_TEMPLATE (arg
));
8343 /* The parameter and argument roles have to be switched here
8344 in order to handle default arguments properly. For example,
8345 template<template <class> class TT> void f(TT<int>)
8346 should be able to accept vector<int> which comes from
8347 template <class T, class Allocator = allocator>
8350 if (coerce_template_parms (argtmplvec
, parmvec
, parmtmpl
, 0, 1)
8354 /* Deduce arguments T, i from TT<T> or TT<i>.
8355 We check each element of PARMVEC and ARGVEC individually
8356 rather than the whole TREE_VEC since they can have
8357 different number of elements. */
8359 for (i
= 0; i
< TREE_VEC_LENGTH (parmvec
); ++i
)
8361 tree t
= TREE_VEC_ELT (parmvec
, i
);
8363 if (unify (tparms
, targs
, t
,
8364 TREE_VEC_ELT (argvec
, i
),
8369 arg
= CLASSTYPE_TI_TEMPLATE (arg
);
8374 /* If PARM is `const T' and ARG is only `int', we don't have
8375 a match unless we are allowing additional qualification.
8376 If ARG is `const int' and PARM is just `T' that's OK;
8377 that binds `const int' to `T'. */
8378 if (!check_cv_quals_for_unify (strict
| UNIFY_ALLOW_LESS_CV_QUAL
,
8382 /* Consider the case where ARG is `const volatile int' and
8383 PARM is `const T'. Then, T should be `volatile int'. */
8385 cp_build_qualified_type_real (arg
,
8387 & ~CP_TYPE_QUALS (parm
),
8389 if (arg
== error_mark_node
)
8393 /* Simple cases: Value already set, does match or doesn't. */
8394 if (targ
!= NULL_TREE
&& same_type_p (targ
, arg
))
8399 /* Make sure that ARG is not a variable-sized array. (Note that
8400 were talking about variable-sized arrays (like `int[n]'),
8401 rather than arrays of unknown size (like `int[]').) We'll
8402 get very confused by such a type since the bound of the array
8403 will not be computable in an instantiation. Besides, such
8404 types are not allowed in ISO C++, so we can do as we please
8406 if (TREE_CODE (arg
) == ARRAY_TYPE
8407 && !uses_template_parms (arg
)
8408 && (TREE_CODE (TYPE_MAX_VALUE (TYPE_DOMAIN (arg
)))
8412 TREE_VEC_ELT (targs
, idx
) = arg
;
8415 case TEMPLATE_PARM_INDEX
:
8416 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, 0));
8418 if (TEMPLATE_PARM_LEVEL (parm
)
8419 != template_decl_level (tparm
))
8420 /* The PARM is not one we're trying to unify. Just check
8421 to see if it matches ARG. */
8422 return (TREE_CODE (arg
) == TREE_CODE (parm
)
8423 && cp_tree_equal (parm
, arg
) > 0) ? 0 : 1;
8425 idx
= TEMPLATE_PARM_IDX (parm
);
8426 targ
= TREE_VEC_ELT (targs
, idx
);
8430 int i
= (cp_tree_equal (targ
, arg
) > 0);
8436 my_friendly_abort (42);
8439 /* [temp.deduct.type] If, in the declaration of a function template
8440 with a non-type template-parameter, the non-type
8441 template-parameter is used in an expression in the function
8442 parameter-list and, if the corresponding template-argument is
8443 deduced, the template-argument type shall match the type of the
8444 template-parameter exactly, except that a template-argument
8445 deduced from an array bound may be of any integral type. */
8446 if (same_type_p (TREE_TYPE (arg
), TREE_TYPE (parm
)))
8448 else if ((strict
& UNIFY_ALLOW_INTEGER
)
8449 && (TREE_CODE (TREE_TYPE (parm
)) == INTEGER_TYPE
8450 || TREE_CODE (TREE_TYPE (parm
)) == BOOLEAN_TYPE
))
8455 TREE_VEC_ELT (targs
, idx
) = arg
;
8462 if (TREE_CODE (arg
) != POINTER_TYPE
)
8465 /* [temp.deduct.call]
8467 A can be another pointer or pointer to member type that can
8468 be converted to the deduced A via a qualification
8469 conversion (_conv.qual_).
8471 We pass down STRICT here rather than UNIFY_ALLOW_NONE.
8472 This will allow for additional cv-qualification of the
8473 pointed-to types if appropriate. In general, this is a bit
8474 too generous; we are only supposed to allow qualification
8475 conversions and this method will allow an ARG of char** and
8476 a deduced ARG of const char**. However, overload
8477 resolution will subsequently invalidate the candidate, so
8478 this is probably OK. */
8479 sub_strict
= strict
;
8481 if (TREE_CODE (TREE_TYPE (arg
)) != RECORD_TYPE
)
8482 /* The derived-to-base conversion only persists through one
8483 level of pointers. */
8484 sub_strict
&= ~UNIFY_ALLOW_DERIVED
;
8486 return unify (tparms
, targs
, TREE_TYPE (parm
),
8487 TREE_TYPE (arg
), sub_strict
);
8490 case REFERENCE_TYPE
:
8491 if (TREE_CODE (arg
) != REFERENCE_TYPE
)
8493 return unify (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
8497 if (TREE_CODE (arg
) != ARRAY_TYPE
)
8499 if ((TYPE_DOMAIN (parm
) == NULL_TREE
)
8500 != (TYPE_DOMAIN (arg
) == NULL_TREE
))
8502 if (TYPE_DOMAIN (parm
) != NULL_TREE
8503 && unify (tparms
, targs
, TYPE_DOMAIN (parm
),
8504 TYPE_DOMAIN (arg
), UNIFY_ALLOW_NONE
) != 0)
8506 return unify (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
8514 if (TREE_CODE (arg
) != TREE_CODE (parm
))
8517 if (TREE_CODE (parm
) == INTEGER_TYPE
8518 && TREE_CODE (TYPE_MAX_VALUE (parm
)) != INTEGER_CST
)
8520 if (TYPE_MIN_VALUE (parm
) && TYPE_MIN_VALUE (arg
)
8521 && unify (tparms
, targs
, TYPE_MIN_VALUE (parm
),
8522 TYPE_MIN_VALUE (arg
), UNIFY_ALLOW_INTEGER
))
8524 if (TYPE_MAX_VALUE (parm
) && TYPE_MAX_VALUE (arg
)
8525 && unify (tparms
, targs
, TYPE_MAX_VALUE (parm
),
8526 TYPE_MAX_VALUE (arg
), UNIFY_ALLOW_INTEGER
))
8529 /* We have already checked cv-qualification at the top of the
8531 else if (!same_type_ignoring_top_level_qualifiers_p (arg
, parm
))
8534 /* As far as unification is concerned, this wins. Later checks
8535 will invalidate it if necessary. */
8538 /* Types INTEGER_CST and MINUS_EXPR can come from array bounds. */
8539 /* Type INTEGER_CST can come from ordinary constant template args. */
8541 while (TREE_CODE (arg
) == NOP_EXPR
)
8542 arg
= TREE_OPERAND (arg
, 0);
8544 if (TREE_CODE (arg
) != INTEGER_CST
)
8546 return !tree_int_cst_equal (parm
, arg
);
8551 if (TREE_CODE (arg
) != TREE_VEC
)
8553 if (TREE_VEC_LENGTH (parm
) != TREE_VEC_LENGTH (arg
))
8555 for (i
= 0; i
< TREE_VEC_LENGTH (parm
); ++i
)
8556 if (unify (tparms
, targs
,
8557 TREE_VEC_ELT (parm
, i
), TREE_VEC_ELT (arg
, i
),
8565 if (TREE_CODE (arg
) != TREE_CODE (parm
))
8568 if (TYPE_PTRMEMFUNC_P (parm
))
8570 if (!TYPE_PTRMEMFUNC_P (arg
))
8573 return unify (tparms
, targs
,
8574 TYPE_PTRMEMFUNC_FN_TYPE (parm
),
8575 TYPE_PTRMEMFUNC_FN_TYPE (arg
),
8579 if (CLASSTYPE_TEMPLATE_INFO (parm
))
8583 if (strict
& UNIFY_ALLOW_DERIVED
)
8585 /* First, we try to unify the PARM and ARG directly. */
8586 t
= try_class_unification (tparms
, targs
,
8591 /* Fallback to the special case allowed in
8594 If P is a class, and P has the form
8595 template-id, then A can be a derived class of
8596 the deduced A. Likewise, if P is a pointer to
8597 a class of the form template-id, A can be a
8598 pointer to a derived class pointed to by the
8600 t
= get_template_base (tparms
, targs
,
8603 if (! t
|| t
== error_mark_node
)
8607 else if (CLASSTYPE_TEMPLATE_INFO (arg
)
8608 && (CLASSTYPE_TI_TEMPLATE (parm
)
8609 == CLASSTYPE_TI_TEMPLATE (arg
)))
8610 /* Perhaps PARM is something like S<U> and ARG is S<int>.
8611 Then, we should unify `int' and `U'. */
8614 /* There's no chance of unication succeeding. */
8617 return unify (tparms
, targs
, CLASSTYPE_TI_ARGS (parm
),
8618 CLASSTYPE_TI_ARGS (t
), UNIFY_ALLOW_NONE
);
8620 else if (!same_type_ignoring_top_level_qualifiers_p (parm
, arg
))
8626 if (TREE_CODE (arg
) != TREE_CODE (parm
))
8629 if (unify (tparms
, targs
, TREE_TYPE (parm
),
8630 TREE_TYPE (arg
), UNIFY_ALLOW_NONE
))
8632 return type_unification_real (tparms
, targs
, TYPE_ARG_TYPES (parm
),
8633 TYPE_ARG_TYPES (arg
), 1,
8637 if (TREE_CODE (arg
) != OFFSET_TYPE
)
8639 if (unify (tparms
, targs
, TYPE_OFFSET_BASETYPE (parm
),
8640 TYPE_OFFSET_BASETYPE (arg
), UNIFY_ALLOW_NONE
))
8642 return unify (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
8646 if (arg
!= decl_constant_value (parm
))
8651 /* Matched cases are handled by the ARG == PARM test above. */
8655 if (TREE_CODE (TREE_OPERAND (parm
, 1)) == INTEGER_CST
)
8657 /* We handle this case specially, since it comes up with
8658 arrays. In particular, something like:
8660 template <int N> void f(int (&x)[N]);
8662 Here, we are trying to unify the range type, which
8663 looks like [0 ... (N - 1)]. */
8665 t1
= TREE_OPERAND (parm
, 0);
8666 t2
= TREE_OPERAND (parm
, 1);
8668 t
= fold (build (PLUS_EXPR
, integer_type_node
, arg
, t2
));
8670 return unify (tparms
, targs
, t1
, t
, strict
);
8672 /* else fall through */
8675 if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (TREE_CODE (parm
))))
8676 /* We're looking at an expression. This can happen with
8680 void foo(S<I>, S<I + 2>);
8682 This is a "nondeduced context":
8686 The nondeduced contexts are:
8688 --A type that is a template-id in which one or more of
8689 the template-arguments is an expression that references
8690 a template-parameter.
8692 In these cases, we assume deduction succeeded, but don't
8693 actually infer any unifications. */
8696 sorry ("use of `%s' in template type unification",
8697 tree_code_name
[(int) TREE_CODE (parm
)]);
8703 /* Called if RESULT is explicitly instantiated, or is a member of an
8704 explicitly instantiated class, or if using -frepo and the
8705 instantiation of RESULT has been assigned to this file. */
8708 mark_decl_instantiated (result
, extern_p
)
8712 if (TREE_CODE (result
) != FUNCTION_DECL
)
8713 /* The TREE_PUBLIC flag for function declarations will have been
8714 set correctly by tsubst. */
8715 TREE_PUBLIC (result
) = 1;
8717 /* We used to set this unconditionally; we moved that to
8718 do_decl_instantiation so it wouldn't get set on members of
8719 explicit class template instantiations. But we still need to set
8720 it here for the 'extern template' case in order to suppress
8721 implicit instantiations. */
8723 SET_DECL_EXPLICIT_INSTANTIATION (result
);
8727 DECL_INTERFACE_KNOWN (result
) = 1;
8728 DECL_NOT_REALLY_EXTERN (result
) = 1;
8730 /* Always make artificials weak. */
8731 if (DECL_ARTIFICIAL (result
) && flag_weak
)
8732 comdat_linkage (result
);
8733 /* For WIN32 we also want to put explicit instantiations in
8734 linkonce sections. */
8735 else if (TREE_PUBLIC (result
))
8736 maybe_make_one_only (result
);
8738 else if (TREE_CODE (result
) == FUNCTION_DECL
)
8742 /* Given two function templates PAT1 and PAT2, and explicit template
8743 arguments EXPLICIT_ARGS return:
8745 1 if PAT1 is more specialized than PAT2 as described in [temp.func.order].
8746 -1 if PAT2 is more specialized than PAT1.
8747 0 if neither is more specialized. */
8750 more_specialized (pat1
, pat2
, explicit_args
)
8751 tree pat1
, pat2
, explicit_args
;
8757 = get_bindings_overload (pat1
, DECL_TEMPLATE_RESULT (pat2
), explicit_args
);
8762 = get_bindings_overload (pat2
, DECL_TEMPLATE_RESULT (pat1
), explicit_args
);
8769 /* Given two class template specialization list nodes PAT1 and PAT2, return:
8771 1 if PAT1 is more specialized than PAT2 as described in [temp.class.order].
8772 -1 if PAT2 is more specialized than PAT1.
8773 0 if neither is more specialized. */
8776 more_specialized_class (pat1
, pat2
)
8782 targs
= get_class_bindings (TREE_VALUE (pat1
), TREE_PURPOSE (pat1
),
8783 TREE_PURPOSE (pat2
));
8787 targs
= get_class_bindings (TREE_VALUE (pat2
), TREE_PURPOSE (pat2
),
8788 TREE_PURPOSE (pat1
));
8795 /* Return the template arguments that will produce the function signature
8796 DECL from the function template FN, with the explicit template
8797 arguments EXPLICIT_ARGS. If CHECK_RETTYPE is 1, the return type must
8798 also match. Return NULL_TREE if no satisfactory arguments could be
8802 get_bindings_real (fn
, decl
, explicit_args
, check_rettype
)
8803 tree fn
, decl
, explicit_args
;
8806 int ntparms
= DECL_NTPARMS (fn
);
8807 tree targs
= make_tree_vec (ntparms
);
8809 tree decl_arg_types
;
8812 /* Substitute the explicit template arguments into the type of DECL.
8813 The call to fn_type_unification will handle substitution into the
8815 decl_type
= TREE_TYPE (decl
);
8816 if (explicit_args
&& uses_template_parms (decl_type
))
8819 tree converted_args
;
8821 if (DECL_TEMPLATE_INFO (decl
))
8822 tmpl
= DECL_TI_TEMPLATE (decl
);
8824 /* We can get here for some illegal specializations. */
8828 = (coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (tmpl
),
8829 explicit_args
, NULL_TREE
,
8831 /*require_all_arguments=*/0));
8832 if (converted_args
== error_mark_node
)
8835 decl_type
= tsubst (decl_type
, converted_args
, /*complain=*/0,
8837 if (decl_type
== error_mark_node
)
8841 /* If FN is a static member function, adjust the type of DECL
8843 decl_arg_types
= TYPE_ARG_TYPES (decl_type
);
8844 if (DECL_STATIC_FUNCTION_P (fn
)
8845 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
8846 decl_arg_types
= TREE_CHAIN (decl_arg_types
);
8848 i
= fn_type_unification (fn
, explicit_args
, targs
,
8850 (check_rettype
|| DECL_CONV_FN_P (fn
)
8851 ? TREE_TYPE (decl_type
) : NULL_TREE
),
8860 /* For most uses, we want to check the return type. */
8863 get_bindings (fn
, decl
, explicit_args
)
8864 tree fn
, decl
, explicit_args
;
8866 return get_bindings_real (fn
, decl
, explicit_args
, 1);
8869 /* But for more_specialized, we only care about the parameter types. */
8872 get_bindings_overload (fn
, decl
, explicit_args
)
8873 tree fn
, decl
, explicit_args
;
8875 return get_bindings_real (fn
, decl
, explicit_args
, 0);
8878 /* Return the innermost template arguments that, when applied to a
8879 template specialization whose innermost template parameters are
8880 TPARMS, and whose specialization arguments are ARGS, yield the
8883 For example, suppose we have:
8885 template <class T, class U> struct S {};
8886 template <class T> struct S<T*, int> {};
8888 Then, suppose we want to get `S<double*, int>'. The TPARMS will be
8889 {T}, the PARMS will be {T*, int} and the ARGS will be {double*,
8890 int}. The resulting vector will be {double}, indicating that `T'
8891 is bound to `double'. */
8894 get_class_bindings (tparms
, parms
, args
)
8895 tree tparms
, parms
, args
;
8897 int i
, ntparms
= TREE_VEC_LENGTH (tparms
);
8898 tree vec
= make_tree_vec (ntparms
);
8900 args
= INNERMOST_TEMPLATE_ARGS (args
);
8902 if (unify (tparms
, vec
, parms
, args
, UNIFY_ALLOW_NONE
))
8905 for (i
= 0; i
< ntparms
; ++i
)
8906 if (! TREE_VEC_ELT (vec
, i
))
8912 /* In INSTANTIATIONS is a list of <INSTANTIATION, TEMPLATE> pairs.
8913 Pick the most specialized template, and return the corresponding
8914 instantiation, or if there is no corresponding instantiation, the
8915 template itself. EXPLICIT_ARGS is any template arguments explicity
8916 mentioned in a template-id. If there is no most specialized
8917 template, error_mark_node is returned. If there are no templates
8918 at all, NULL_TREE is returned. */
8921 most_specialized_instantiation (instantiations
, explicit_args
)
8922 tree instantiations
;
8928 if (!instantiations
)
8931 champ
= instantiations
;
8932 for (fn
= TREE_CHAIN (instantiations
); fn
; fn
= TREE_CHAIN (fn
))
8934 fate
= more_specialized (TREE_VALUE (champ
),
8935 TREE_VALUE (fn
), explicit_args
);
8942 fn
= TREE_CHAIN (fn
);
8944 return error_mark_node
;
8950 for (fn
= instantiations
; fn
&& fn
!= champ
; fn
= TREE_CHAIN (fn
))
8952 fate
= more_specialized (TREE_VALUE (champ
),
8953 TREE_VALUE (fn
), explicit_args
);
8955 return error_mark_node
;
8958 return TREE_PURPOSE (champ
) ? TREE_PURPOSE (champ
) : TREE_VALUE (champ
);
8961 /* Return the most specialized of the list of templates in FNS that can
8962 produce an instantiation matching DECL, given the explicit template
8963 arguments EXPLICIT_ARGS. */
8966 most_specialized (fns
, decl
, explicit_args
)
8967 tree fns
, decl
, explicit_args
;
8969 tree candidates
= NULL_TREE
;
8972 for (fn
= fns
; fn
; fn
= TREE_CHAIN (fn
))
8974 tree candidate
= TREE_VALUE (fn
);
8976 args
= get_bindings (candidate
, decl
, explicit_args
);
8978 candidates
= tree_cons (NULL_TREE
, candidate
, candidates
);
8981 return most_specialized_instantiation (candidates
, explicit_args
);
8984 /* If DECL is a specialization of some template, return the most
8985 general such template. Otherwise, returns NULL_TREE.
8989 template <class T> struct S { template <class U> void f(U); };
8991 if TMPL is `template <class U> void S<int>::f(U)' this will return
8992 the full template. This function will not trace past partial
8993 specializations, however. For example, given in addition:
8995 template <class T> struct S<T*> { template <class U> void f(U); };
8997 if TMPL is `template <class U> void S<int*>::f(U)' this will return
8998 `template <class T> template <class U> S<T*>::f(U)'. */
9001 most_general_template (decl
)
9004 /* If DECL is a FUNCTION_DECL, find the TEMPLATE_DECL of which it is
9005 an immediate specialization. */
9006 if (TREE_CODE (decl
) == FUNCTION_DECL
)
9008 if (DECL_TEMPLATE_INFO (decl
)) {
9009 decl
= DECL_TI_TEMPLATE (decl
);
9011 /* The DECL_TI_TEMPLATE can be an IDENTIFIER_NODE for a
9013 if (TREE_CODE (decl
) != TEMPLATE_DECL
)
9019 /* Look for more and more general templates. */
9020 while (DECL_TEMPLATE_INFO (decl
))
9022 /* The DECL_TI_TEMPLATE can be a LOOKUP_EXPR or IDENTIFIER_NODE
9023 in some cases. (See cp-tree.h for details.) */
9024 if (TREE_CODE (DECL_TI_TEMPLATE (decl
)) != TEMPLATE_DECL
)
9027 /* Stop if we run into an explicitly specialized class template. */
9028 if (!DECL_NAMESPACE_SCOPE_P (decl
)
9029 && DECL_CONTEXT (decl
)
9030 && CLASSTYPE_TEMPLATE_SPECIALIZATION (DECL_CONTEXT (decl
)))
9033 decl
= DECL_TI_TEMPLATE (decl
);
9039 /* Return the most specialized of the class template specializations
9040 of TMPL which can produce an instantiation matching ARGS, or
9041 error_mark_node if the choice is ambiguous. */
9044 most_specialized_class (tmpl
, args
)
9048 tree list
= NULL_TREE
;
9053 tmpl
= most_general_template (tmpl
);
9054 for (t
= DECL_TEMPLATE_SPECIALIZATIONS (tmpl
); t
; t
= TREE_CHAIN (t
))
9057 = get_class_bindings (TREE_VALUE (t
), TREE_PURPOSE (t
), args
);
9060 list
= decl_tree_cons (TREE_PURPOSE (t
), TREE_VALUE (t
), list
);
9061 TREE_TYPE (list
) = TREE_TYPE (t
);
9071 for (; t
; t
= TREE_CHAIN (t
))
9073 fate
= more_specialized_class (champ
, t
);
9082 return error_mark_node
;
9088 for (t
= list
; t
&& t
!= champ
; t
= TREE_CHAIN (t
))
9090 fate
= more_specialized_class (champ
, t
);
9092 return error_mark_node
;
9098 /* called from the parser. */
9101 do_decl_instantiation (declspecs
, declarator
, storage
)
9102 tree declspecs
, declarator
, storage
;
9104 tree decl
= grokdeclarator (declarator
, declspecs
, NORMAL
, 0, NULL_TREE
);
9105 tree result
= NULL_TREE
;
9109 /* An error ocurred, for which grokdeclarator has already issued
9110 an appropriate message. */
9112 else if (! DECL_LANG_SPECIFIC (decl
))
9114 cp_error ("explicit instantiation of non-template `%#D'", decl
);
9117 else if (TREE_CODE (decl
) == VAR_DECL
)
9119 /* There is an asymmetry here in the way VAR_DECLs and
9120 FUNCTION_DECLs are handled by grokdeclarator. In the case of
9121 the latter, the DECL we get back will be marked as a
9122 template instantiation, and the appropriate
9123 DECL_TEMPLATE_INFO will be set up. This does not happen for
9124 VAR_DECLs so we do the lookup here. Probably, grokdeclarator
9125 should handle VAR_DECLs as it currently handles
9127 result
= lookup_field (DECL_CONTEXT (decl
), DECL_NAME (decl
), 0, 0);
9128 if (result
&& TREE_CODE (result
) != VAR_DECL
)
9130 cp_error ("no matching template for `%D' found", result
);
9134 else if (TREE_CODE (decl
) != FUNCTION_DECL
)
9136 cp_error ("explicit instantiation of `%#D'", decl
);
9142 /* Check for various error cases. Note that if the explicit
9143 instantiation is legal the RESULT will currently be marked as an
9144 *implicit* instantiation; DECL_EXPLICIT_INSTANTIATION is not set
9145 until we get here. */
9147 if (DECL_TEMPLATE_SPECIALIZATION (result
))
9151 No program shall both explicitly instantiate and explicitly
9152 specialize a template. */
9153 cp_pedwarn ("explicit instantiation of `%#D' after", result
);
9154 cp_pedwarn_at ("explicit specialization here", result
);
9157 else if (DECL_EXPLICIT_INSTANTIATION (result
))
9161 No program shall explicitly instantiate any template more
9164 We check DECL_INTERFACE_KNOWN so as not to complain when the first
9165 instantiation was `extern' and the second is not, and EXTERN_P for
9166 the opposite case. If -frepo, chances are we already got marked
9167 as an explicit instantion because of the repo file. */
9168 if (DECL_INTERFACE_KNOWN (result
) && !extern_p
&& !flag_use_repository
)
9169 cp_pedwarn ("duplicate explicit instantiation of `%#D'", result
);
9171 /* If we've already instantiated the template, just return now. */
9172 if (DECL_INTERFACE_KNOWN (result
))
9175 else if (!DECL_IMPLICIT_INSTANTIATION (result
))
9177 cp_error ("no matching template for `%D' found", result
);
9180 else if (!DECL_TEMPLATE_INFO (result
))
9182 cp_pedwarn ("explicit instantiation of non-template `%#D'", result
);
9186 if (flag_external_templates
)
9189 if (storage
== NULL_TREE
)
9191 else if (storage
== ridpointers
[(int) RID_EXTERN
])
9194 cp_pedwarn ("ISO C++ forbids the use of `extern' on explicit instantiations");
9198 cp_error ("storage class `%D' applied to template instantiation",
9201 SET_DECL_EXPLICIT_INSTANTIATION (result
);
9202 mark_decl_instantiated (result
, extern_p
);
9203 repo_template_instantiated (result
, extern_p
);
9205 instantiate_decl (result
, /*defer_ok=*/1);
9209 mark_class_instantiated (t
, extern_p
)
9213 SET_CLASSTYPE_EXPLICIT_INSTANTIATION (t
);
9214 SET_CLASSTYPE_INTERFACE_KNOWN (t
);
9215 CLASSTYPE_INTERFACE_ONLY (t
) = extern_p
;
9216 CLASSTYPE_VTABLE_NEEDS_WRITING (t
) = ! extern_p
;
9217 TYPE_DECL_SUPPRESS_DEBUG (TYPE_NAME (t
)) = extern_p
;
9220 CLASSTYPE_DEBUG_REQUESTED (t
) = 1;
9221 rest_of_type_compilation (t
, 1);
9225 /* Perform an explicit instantiation of template class T. STORAGE, if
9226 non-null, is the RID for extern, inline or static. COMPLAIN is
9227 non-zero if this is called from the parser, zero if called recursively,
9228 since the standard is unclear (as detailed below). */
9231 do_type_instantiation (t
, storage
, complain
)
9239 if (TREE_CODE (t
) == TYPE_DECL
)
9242 if (! CLASS_TYPE_P (t
) || ! CLASSTYPE_TEMPLATE_INFO (t
))
9244 cp_error ("explicit instantiation of non-template type `%T'", t
);
9250 /* With -fexternal-templates, explicit instantiations are treated the same
9251 as implicit ones. */
9252 if (flag_external_templates
)
9255 if (!COMPLETE_TYPE_P (t
))
9258 cp_error ("explicit instantiation of `%#T' before definition of template",
9263 if (storage
!= NULL_TREE
)
9266 cp_pedwarn("ISO C++ forbids the use of `%s' on explicit instantiations",
9267 IDENTIFIER_POINTER (storage
));
9269 if (storage
== ridpointers
[(int) RID_INLINE
])
9271 else if (storage
== ridpointers
[(int) RID_EXTERN
])
9273 else if (storage
== ridpointers
[(int) RID_STATIC
])
9277 cp_error ("storage class `%D' applied to template instantiation",
9283 if (CLASSTYPE_TEMPLATE_SPECIALIZATION (t
))
9287 No program shall both explicitly instantiate and explicitly
9288 specialize a template. */
9291 cp_error ("explicit instantiation of `%#T' after", t
);
9292 cp_error_at ("explicit specialization here", t
);
9296 else if (CLASSTYPE_EXPLICIT_INSTANTIATION (t
))
9300 No program shall explicitly instantiate any template more
9303 If CLASSTYPE_INTERFACE_ONLY, then the first explicit instantiation
9304 was `extern'. If EXTERN_P then the second is. If -frepo, chances
9305 are we already got marked as an explicit instantion because of the
9306 repo file. All these cases are OK. */
9307 if (!CLASSTYPE_INTERFACE_ONLY (t
) && !extern_p
&& !flag_use_repository
9309 cp_pedwarn ("duplicate explicit instantiation of `%#T'", t
);
9311 /* If we've already instantiated the template, just return now. */
9312 if (!CLASSTYPE_INTERFACE_ONLY (t
))
9316 mark_class_instantiated (t
, extern_p
);
9317 repo_template_instantiated (t
, extern_p
);
9325 /* In contrast to implicit instantiation, where only the
9326 declarations, and not the definitions, of members are
9327 instantiated, we have here:
9331 The explicit instantiation of a class template specialization
9332 implies the instantiation of all of its members not
9333 previously explicitly specialized in the translation unit
9334 containing the explicit instantiation.
9336 Of course, we can't instantiate member template classes, since
9337 we don't have any arguments for them. Note that the standard
9338 is unclear on whether the instatiation of the members are
9339 *explicit* instantiations or not. We choose to be generous,
9340 and not set DECL_EXPLICIT_INSTANTIATION. Therefore, we allow
9341 the explicit instantiation of a class where some of the members
9342 have no definition in the current translation unit. */
9345 for (tmp
= TYPE_METHODS (t
); tmp
; tmp
= TREE_CHAIN (tmp
))
9346 if (TREE_CODE (tmp
) == FUNCTION_DECL
9347 && DECL_TEMPLATE_INSTANTIATION (tmp
))
9349 mark_decl_instantiated (tmp
, extern_p
);
9350 repo_template_instantiated (tmp
, extern_p
);
9352 instantiate_decl (tmp
, /*defer_ok=*/1);
9355 for (tmp
= TYPE_FIELDS (t
); tmp
; tmp
= TREE_CHAIN (tmp
))
9356 if (TREE_CODE (tmp
) == VAR_DECL
&& DECL_TEMPLATE_INSTANTIATION (tmp
))
9358 mark_decl_instantiated (tmp
, extern_p
);
9359 repo_template_instantiated (tmp
, extern_p
);
9361 instantiate_decl (tmp
, /*defer_ok=*/1);
9364 for (tmp
= CLASSTYPE_TAGS (t
); tmp
; tmp
= TREE_CHAIN (tmp
))
9365 if (IS_AGGR_TYPE (TREE_VALUE (tmp
))
9366 && !uses_template_parms (CLASSTYPE_TI_ARGS (TREE_VALUE (tmp
))))
9367 do_type_instantiation (TYPE_MAIN_DECL (TREE_VALUE (tmp
)), storage
, 0);
9371 /* Given a function DECL, which is a specialization of TMPL, modify
9372 DECL to be a re-instantiation of TMPL with the same template
9373 arguments. TMPL should be the template into which tsubst'ing
9374 should occur for DECL, not the most general template.
9376 One reason for doing this is a scenario like this:
9379 void f(const T&, int i);
9381 void g() { f(3, 7); }
9384 void f(const T& t, const int i) { }
9386 Note that when the template is first instantiated, with
9387 instantiate_template, the resulting DECL will have no name for the
9388 first parameter, and the wrong type for the second. So, when we go
9389 to instantiate the DECL, we regenerate it. */
9392 regenerate_decl_from_template (decl
, tmpl
)
9396 /* The most general version of TMPL. */
9398 /* The arguments used to instantiate DECL, from the most general
9405 args
= DECL_TI_ARGS (decl
);
9406 code_pattern
= DECL_TEMPLATE_RESULT (tmpl
);
9408 /* Unregister the specialization so that when we tsubst we will not
9409 just return DECL. We don't have to unregister DECL from TMPL
9410 because if would only be registered there if it were a partial
9411 instantiation of a specialization, which it isn't: it's a full
9413 gen_tmpl
= most_general_template (tmpl
);
9414 unregistered
= unregister_specialization (decl
, gen_tmpl
);
9416 /* If the DECL was not unregistered then something peculiar is
9417 happening: we created a specialization but did not call
9418 register_specialization for it. */
9419 my_friendly_assert (unregistered
, 0);
9421 if (TREE_CODE (decl
) == VAR_DECL
)
9422 /* Make sure that we can see identifiers, and compute access
9423 correctly, for the class members used in the declaration of
9424 this static variable. */
9425 pushclass (DECL_CONTEXT (decl
), 2);
9427 /* Do the substitution to get the new declaration. */
9428 new_decl
= tsubst (code_pattern
, args
, /*complain=*/1, NULL_TREE
);
9430 if (TREE_CODE (decl
) == VAR_DECL
)
9432 /* Set up DECL_INITIAL, since tsubst doesn't. */
9433 DECL_INITIAL (new_decl
) =
9434 tsubst_expr (DECL_INITIAL (code_pattern
), args
,
9435 /*complain=*/1, DECL_TI_TEMPLATE (decl
));
9436 /* Pop the class context we pushed above. */
9439 else if (TREE_CODE (decl
) == FUNCTION_DECL
)
9441 /* Convince duplicate_decls to use the DECL_ARGUMENTS from the
9443 DECL_INITIAL (new_decl
) = error_mark_node
;
9444 /* And don't complain about a duplicate definition. */
9445 DECL_INITIAL (decl
) = NULL_TREE
;
9448 /* The immediate parent of the new template is still whatever it was
9449 before, even though tsubst sets DECL_TI_TEMPLATE up as the most
9450 general template. We also reset the DECL_ASSEMBLER_NAME since
9451 tsubst always calculates the name as if the function in question
9452 were really a template instance, and sometimes, with friend
9453 functions, this is not so. See tsubst_friend_function for
9455 DECL_TI_TEMPLATE (new_decl
) = DECL_TI_TEMPLATE (decl
);
9456 DECL_ASSEMBLER_NAME (new_decl
) = DECL_ASSEMBLER_NAME (decl
);
9457 DECL_RTL (new_decl
) = DECL_RTL (decl
);
9458 DECL_USE_TEMPLATE (new_decl
) = DECL_USE_TEMPLATE (decl
);
9460 /* Call duplicate decls to merge the old and new declarations. */
9461 duplicate_decls (new_decl
, decl
);
9463 /* Now, re-register the specialization. */
9464 register_specialization (decl
, gen_tmpl
, args
);
9467 /* Produce the definition of D, a _DECL generated from a template. If
9468 DEFER_OK is non-zero, then we don't have to actually do the
9469 instantiation now; we just have to do it sometime. */
9472 instantiate_decl (d
, defer_ok
)
9476 tree tmpl
= DECL_TI_TEMPLATE (d
);
9477 tree args
= DECL_TI_ARGS (d
);
9482 int pattern_defined
;
9484 const char *file
= input_filename
;
9486 /* This function should only be used to instantiate templates for
9487 functions and static member variables. */
9488 my_friendly_assert (TREE_CODE (d
) == FUNCTION_DECL
9489 || TREE_CODE (d
) == VAR_DECL
, 0);
9491 /* Don't instantiate cloned functions. Instead, instantiate the
9492 functions they cloned. */
9493 if (TREE_CODE (d
) == FUNCTION_DECL
&& DECL_CLONED_FUNCTION_P (d
))
9494 d
= DECL_CLONED_FUNCTION (d
);
9496 if (DECL_TEMPLATE_INSTANTIATED (d
))
9497 /* D has already been instantiated. It might seem reasonable to
9498 check whether or not D is an explict instantiation, and, if so,
9499 stop here. But when an explicit instantiation is deferred
9500 until the end of the compilation, DECL_EXPLICIT_INSTANTIATION
9501 is set, even though we still need to do the instantiation. */
9504 /* If we already have a specialization of this declaration, then
9505 there's no reason to instantiate it. Note that
9506 retrieve_specialization gives us both instantiations and
9507 specializations, so we must explicitly check
9508 DECL_TEMPLATE_SPECIALIZATION. */
9509 gen_tmpl
= most_general_template (tmpl
);
9510 spec
= retrieve_specialization (gen_tmpl
, args
);
9511 if (spec
!= NULL_TREE
&& DECL_TEMPLATE_SPECIALIZATION (spec
))
9514 /* This needs to happen before any tsubsting. */
9515 if (! push_tinst_level (d
))
9518 timevar_push (TV_PARSE
);
9520 /* Set TD to the template whose DECL_TEMPLATE_RESULT is the pattern
9521 for the instantiation. This is not always the most general
9522 template. Consider, for example:
9525 struct S { template <class U> void f();
9526 template <> void f<int>(); };
9528 and an instantiation of S<double>::f<int>. We want TD to be the
9529 specialization S<T>::f<int>, not the more general S<T>::f<U>. */
9531 while (/* An instantiation cannot have a definition, so we need a
9532 more general template. */
9533 DECL_TEMPLATE_INSTANTIATION (td
)
9534 /* We must also deal with friend templates. Given:
9536 template <class T> struct S {
9537 template <class U> friend void f() {};
9540 S<int>::f<U> say, is not an instantiation of S<T>::f<U>,
9541 so far as the language is concerned, but that's still
9542 where we get the pattern for the instantiation from. On
9543 ther hand, if the definition comes outside the class, say:
9545 template <class T> struct S {
9546 template <class U> friend void f();
9548 template <class U> friend void f() {}
9550 we don't need to look any further. That's what the check for
9551 DECL_INITIAL is for. */
9552 || (TREE_CODE (d
) == FUNCTION_DECL
9553 && DECL_FRIEND_PSEUDO_TEMPLATE_INSTANTIATION (td
)
9554 && !DECL_INITIAL (DECL_TEMPLATE_RESULT (td
))))
9556 /* The present template, TD, should not be a definition. If it
9557 were a definition, we should be using it! Note that we
9558 cannot restructure the loop to just keep going until we find
9559 a template with a definition, since that might go too far if
9560 a specialization was declared, but not defined. */
9561 my_friendly_assert (!(TREE_CODE (d
) == VAR_DECL
9562 && !DECL_IN_AGGR_P (DECL_TEMPLATE_RESULT (td
))),
9565 /* Fetch the more general template. */
9566 td
= DECL_TI_TEMPLATE (td
);
9569 code_pattern
= DECL_TEMPLATE_RESULT (td
);
9571 if (TREE_CODE (d
) == FUNCTION_DECL
)
9572 pattern_defined
= (DECL_SAVED_TREE (code_pattern
) != NULL_TREE
);
9574 pattern_defined
= ! DECL_IN_AGGR_P (code_pattern
);
9576 push_to_top_level ();
9577 lineno
= DECL_SOURCE_LINE (d
);
9578 input_filename
= DECL_SOURCE_FILE (d
);
9580 if (pattern_defined
)
9582 repo_template_used (d
);
9584 if (flag_external_templates
&& ! DECL_INTERFACE_KNOWN (d
))
9586 if (flag_alt_external_templates
)
9588 if (interface_unknown
)
9589 warn_if_unknown_interface (d
);
9591 else if (DECL_INTERFACE_KNOWN (code_pattern
))
9593 DECL_INTERFACE_KNOWN (d
) = 1;
9594 DECL_NOT_REALLY_EXTERN (d
) = ! DECL_EXTERNAL (code_pattern
);
9597 warn_if_unknown_interface (code_pattern
);
9601 import_export_decl (d
);
9604 /* Reject all external templates except inline functions. */
9605 if (DECL_INTERFACE_KNOWN (d
)
9606 && ! DECL_NOT_REALLY_EXTERN (d
)
9607 && ! (TREE_CODE (d
) == FUNCTION_DECL
&& DECL_INLINE (d
)))
9610 /* We need to set up DECL_INITIAL regardless of pattern_defined if
9611 the variable is a static const initialized in the class body. */
9612 if (TREE_CODE (d
) == VAR_DECL
9613 && TREE_READONLY (d
)
9614 && DECL_INITIAL (d
) == NULL_TREE
9615 && DECL_INITIAL (code_pattern
) != NULL_TREE
)
9617 /* Defer all other templates, unless we have been explicitly
9618 forbidden from doing so. We restore the source position here
9619 because it's used by add_pending_template. */
9620 else if (! pattern_defined
|| defer_ok
)
9623 input_filename
= file
;
9625 if (at_eof
&& !pattern_defined
9626 && DECL_EXPLICIT_INSTANTIATION (d
))
9629 The definition of a non-exported function template, a
9630 non-exported member function template, or a non-exported
9631 member function or static data member of a class template
9632 shall be present in every translation unit in which it is
9633 explicitly instantiated. */
9634 cp_error ("explicit instantiation of `%D' but no definition available",
9637 add_pending_template (d
);
9641 /* We're now committed to instantiating this template. Mark it as
9642 instantiated so that recursive calls to instantiate_decl do not
9643 try to instantiate it again. */
9644 DECL_TEMPLATE_INSTANTIATED (d
) = 1;
9646 /* Regenerate the declaration in case the template has been modified
9647 by a subsequent redeclaration. */
9648 regenerate_decl_from_template (d
, td
);
9650 /* We already set the file and line above. Reset them now in case
9651 they changed as a result of calling regenerate_decl_from_template. */
9652 lineno
= DECL_SOURCE_LINE (d
);
9653 input_filename
= DECL_SOURCE_FILE (d
);
9655 if (TREE_CODE (d
) == VAR_DECL
)
9657 DECL_IN_AGGR_P (d
) = 0;
9658 if (DECL_INTERFACE_KNOWN (d
))
9659 DECL_EXTERNAL (d
) = ! DECL_NOT_REALLY_EXTERN (d
);
9662 DECL_EXTERNAL (d
) = 1;
9663 DECL_NOT_REALLY_EXTERN (d
) = 1;
9665 cp_finish_decl (d
, DECL_INITIAL (d
), NULL_TREE
, 0);
9667 else if (TREE_CODE (d
) == FUNCTION_DECL
)
9669 htab_t saved_local_specializations
;
9671 /* Save away the current list, in case we are instantiating one
9672 template from within the body of another. */
9673 saved_local_specializations
= local_specializations
;
9675 /* Set up the list of local specializations. */
9676 local_specializations
= htab_create (37,
9681 /* Set up context. */
9682 start_function (NULL_TREE
, d
, NULL_TREE
, SF_PRE_PARSED
);
9683 store_parm_decls ();
9685 /* We already set up __FUNCTION__, etc., so we don't want to do
9687 cp_function_chain
->name_declared
= 1;
9689 /* Substitute into the body of the function. */
9690 tsubst_expr (DECL_SAVED_TREE (code_pattern
), args
,
9691 /*complain=*/1, tmpl
);
9693 /* We don't need the local specializations any more. */
9694 htab_delete (local_specializations
);
9695 local_specializations
= saved_local_specializations
;
9697 /* Finish the function. */
9698 expand_body (finish_function (0));
9701 /* We're not deferring instantiation any more. */
9702 TI_PENDING_TEMPLATE_FLAG (DECL_TEMPLATE_INFO (d
)) = 0;
9706 input_filename
= file
;
9708 pop_from_top_level ();
9711 timevar_pop (TV_PARSE
);
9716 /* Run through the list of templates that we wish we could
9717 instantiate, and instantiate any we can. */
9720 instantiate_pending_templates ()
9723 int instantiated_something
= 0;
9730 t
= &pending_templates
;
9733 tree instantiation
= TREE_VALUE (*t
);
9735 reopen_tinst_level (TREE_PURPOSE (*t
));
9737 if (TYPE_P (instantiation
))
9741 if (!COMPLETE_TYPE_P (instantiation
))
9743 instantiate_class_template (instantiation
);
9744 if (CLASSTYPE_TEMPLATE_INSTANTIATION (instantiation
))
9745 for (fn
= TYPE_METHODS (instantiation
);
9747 fn
= TREE_CHAIN (fn
))
9748 if (! DECL_ARTIFICIAL (fn
))
9749 instantiate_decl (fn
, /*defer_ok=*/0);
9750 if (COMPLETE_TYPE_P (instantiation
))
9752 instantiated_something
= 1;
9757 if (COMPLETE_TYPE_P (instantiation
))
9758 /* If INSTANTIATION has been instantiated, then we don't
9759 need to consider it again in the future. */
9760 *t
= TREE_CHAIN (*t
);
9762 t
= &TREE_CHAIN (*t
);
9766 if (!DECL_TEMPLATE_SPECIALIZATION (instantiation
)
9767 && !DECL_TEMPLATE_INSTANTIATED (instantiation
))
9769 instantiation
= instantiate_decl (instantiation
,
9771 if (DECL_TEMPLATE_INSTANTIATED (instantiation
))
9773 instantiated_something
= 1;
9778 if (DECL_TEMPLATE_SPECIALIZATION (instantiation
)
9779 || DECL_TEMPLATE_INSTANTIATED (instantiation
))
9780 /* If INSTANTIATION has been instantiated, then we don't
9781 need to consider it again in the future. */
9782 *t
= TREE_CHAIN (*t
);
9784 t
= &TREE_CHAIN (*t
);
9787 current_tinst_level
= NULL_TREE
;
9791 /* Go through the things that are template instantiations if we are
9792 using guiding declarations. */
9793 t
= &maybe_templates
;
9800 fn
= TREE_VALUE (*t
);
9802 if (DECL_INITIAL (fn
))
9803 /* If the FN is already defined, then it was either already
9804 instantiated or, even though guiding declarations were
9805 allowed, a non-template definition was provided. */
9809 template = TREE_PURPOSE (*t
);
9810 args
= get_bindings (template, fn
, NULL_TREE
);
9811 fn
= instantiate_template (template, args
);
9812 instantiate_decl (fn
, /*defer_ok=*/0);
9816 /* Remove this entry from the chain. */
9817 *t
= TREE_CHAIN (*t
);
9819 maybe_template_tail
= t
;
9823 return instantiated_something
;
9826 /* Substitute ARGVEC into T, which is a list of initializers for
9827 either base class or a non-static data member. The TREE_PURPOSEs
9828 are DECLs, and the TREE_VALUEs are the initializer values. Used by
9829 instantiate_decl. */
9832 tsubst_initializer_list (t
, argvec
)
9835 tree first
= NULL_TREE
;
9838 for (; t
; t
= TREE_CHAIN (t
))
9844 decl
= tsubst_copy (TREE_PURPOSE (t
), argvec
, /*complain=*/1,
9846 init
= tsubst_expr (TREE_VALUE (t
), argvec
, /*complain=*/1,
9851 else if (TREE_CODE (init
) == TREE_LIST
)
9852 for (val
= init
; val
; val
= TREE_CHAIN (val
))
9853 TREE_VALUE (val
) = convert_from_reference (TREE_VALUE (val
));
9855 init
= convert_from_reference (init
);
9857 *p
= build_tree_list (decl
, init
);
9858 p
= &TREE_CHAIN (*p
);
9863 /* D is an undefined function declaration in the presence of templates with
9864 the same name, listed in FNS. If one of them can produce D as an
9865 instantiation, remember this so we can instantiate it at EOF if D has
9866 not been defined by that time. */
9869 add_maybe_template (d
, fns
)
9874 if (DECL_MAYBE_TEMPLATE (d
))
9877 t
= most_specialized (fns
, d
, NULL_TREE
);
9880 if (t
== error_mark_node
)
9882 cp_error ("ambiguous template instantiation for `%D'", d
);
9886 *maybe_template_tail
= tree_cons (t
, d
, NULL_TREE
);
9887 maybe_template_tail
= &TREE_CHAIN (*maybe_template_tail
);
9888 DECL_MAYBE_TEMPLATE (d
) = 1;
9891 /* Set CURRENT_ACCESS_SPECIFIER based on the protection of DECL. */
9894 set_current_access_from_decl (decl
)
9897 if (TREE_PRIVATE (decl
))
9898 current_access_specifier
= access_private_node
;
9899 else if (TREE_PROTECTED (decl
))
9900 current_access_specifier
= access_protected_node
;
9902 current_access_specifier
= access_public_node
;
9905 /* Instantiate an enumerated type. TAG is the template type, NEWTAG
9906 is the instantiation (which should have been created with
9907 start_enum) and ARGS are the template arguments to use. */
9910 tsubst_enum (tag
, newtag
, args
)
9917 for (e
= TYPE_VALUES (tag
); e
; e
= TREE_CHAIN (e
))
9921 /* Note that in a template enum, the TREE_VALUE is the
9922 CONST_DECL, not the corresponding INTEGER_CST. */
9923 value
= tsubst_expr (DECL_INITIAL (TREE_VALUE (e
)),
9924 args
, /*complain=*/1,
9927 /* Give this enumeration constant the correct access. */
9928 set_current_access_from_decl (TREE_VALUE (e
));
9930 /* Actually build the enumerator itself. */
9931 build_enumerator (TREE_PURPOSE (e
), value
, newtag
);
9934 finish_enum (newtag
);
9937 /* DECL is a FUNCTION_DECL that is a template specialization. Return
9938 its type -- but without substituting the innermost set of template
9939 arguments. So, innermost set of template parameters will appear in
9940 the type. If CONTEXTP is non-NULL, then the partially substituted
9941 DECL_CONTEXT (if any) will also be filled in. Similarly, TPARMSP
9942 will be filled in with the substituted template parameters, if it
9946 get_mostly_instantiated_function_type (decl
, contextp
, tparmsp
)
9951 tree context
= NULL_TREE
;
9958 tmpl
= most_general_template (DECL_TI_TEMPLATE (decl
));
9959 targs
= DECL_TI_ARGS (decl
);
9960 tparms
= DECL_TEMPLATE_PARMS (tmpl
);
9961 parm_depth
= TMPL_PARMS_DEPTH (tparms
);
9963 /* There should be as many levels of arguments as there are levels
9965 my_friendly_assert (parm_depth
== TMPL_ARGS_DEPTH (targs
), 0);
9967 fn_type
= TREE_TYPE (tmpl
);
9968 if (DECL_STATIC_FUNCTION_P (decl
))
9969 context
= DECL_CONTEXT (decl
);
9971 if (parm_depth
== 1)
9972 /* No substitution is necessary. */
9979 /* Replace the innermost level of the TARGS with NULL_TREEs to
9980 let tsubst know not to subsitute for those parameters. */
9981 partial_args
= make_tree_vec (TREE_VEC_LENGTH (targs
));
9982 for (i
= 1; i
< TMPL_ARGS_DEPTH (targs
); ++i
)
9983 SET_TMPL_ARGS_LEVEL (partial_args
, i
,
9984 TMPL_ARGS_LEVEL (targs
, i
));
9985 SET_TMPL_ARGS_LEVEL (partial_args
,
9986 TMPL_ARGS_DEPTH (targs
),
9987 make_tree_vec (DECL_NTPARMS (tmpl
)));
9989 /* Now, do the (partial) substitution to figure out the
9990 appropriate function type. */
9991 fn_type
= tsubst (fn_type
, partial_args
, /*complain=*/1, NULL_TREE
);
9992 if (DECL_STATIC_FUNCTION_P (decl
))
9993 context
= tsubst (context
, partial_args
, /*complain=*/1, NULL_TREE
);
9995 /* Substitute into the template parameters to obtain the real
9996 innermost set of parameters. This step is important if the
9997 innermost set of template parameters contains value
9998 parameters whose types depend on outer template parameters. */
9999 TREE_VEC_LENGTH (partial_args
)--;
10000 tparms
= tsubst_template_parms (tparms
, partial_args
, /*complain=*/1);
10004 *contextp
= context
;
10011 /* Set the DECL_ASSEMBLER_NAME for DECL, which is a FUNCTION_DECL that
10012 is either an instantiation or specialization of a template
10016 set_mangled_name_for_template_decl (decl
)
10019 tree context
= NULL_TREE
;
10026 my_friendly_assert (TREE_CODE (decl
) == FUNCTION_DECL
, 0);
10027 my_friendly_assert (DECL_TEMPLATE_INFO (decl
) != NULL_TREE
, 0);
10029 /* Under the new ABI, we don't need special machinery. */
10032 set_mangled_name_for_decl (decl
);
10036 /* The names of template functions must be mangled so as to indicate
10037 what template is being specialized with what template arguments.
10038 For example, each of the following three functions must get
10039 different mangled names:
10042 template <> void f<7>(int);
10043 template <> void f<8>(int); */
10045 targs
= DECL_TI_ARGS (decl
);
10046 if (uses_template_parms (targs
))
10047 /* This DECL is for a partial instantiation. There's no need to
10048 mangle the name of such an entity. */
10051 /* We now compute the PARMS and RET_TYPE to give to
10052 build_decl_overload_real. The PARMS and RET_TYPE are the
10053 parameter and return types of the template, after all but the
10054 innermost template arguments have been substituted, not the
10055 parameter and return types of the function DECL. For example,
10058 template <class T> T f(T);
10060 both PARMS and RET_TYPE should be `T' even if DECL is `int f(int)'.
10061 A more subtle example is:
10063 template <class T> struct S { template <class U> void f(T, U); }
10065 Here, if DECL is `void S<int>::f(int, double)', PARMS should be
10066 {int, U}. Thus, the args that we want to subsitute into the
10067 return and parameter type for the function are those in TARGS,
10068 with the innermost level omitted. */
10069 fn_type
= get_mostly_instantiated_function_type (decl
, &context
, &tparms
);
10071 /* Now, get the innermost parameters and arguments, and figure out
10072 the parameter and return types. */
10073 tparms
= INNERMOST_TEMPLATE_PARMS (tparms
);
10074 targs
= INNERMOST_TEMPLATE_ARGS (targs
);
10075 ret_type
= TREE_TYPE (fn_type
);
10076 parm_types
= TYPE_ARG_TYPES (fn_type
);
10078 /* For a static member function, we generate a fake `this' pointer,
10079 for the purposes of mangling. This indicates of which class the
10080 function is a member. Because of:
10084 There shall not be a static and a nonstatic member function
10085 with the same name and the same parameter types
10087 we don't have to worry that this will result in a clash with a
10088 non-static member function. */
10089 if (DECL_STATIC_FUNCTION_P (decl
))
10090 parm_types
= hash_tree_chain (build_pointer_type (context
), parm_types
);
10092 /* There should be the same number of template parameters as
10093 template arguments. */
10094 my_friendly_assert (TREE_VEC_LENGTH (tparms
) == TREE_VEC_LENGTH (targs
),
10097 /* Actually set the DECL_ASSEMBLER_NAME. */
10098 DECL_ASSEMBLER_NAME (decl
)
10099 = build_decl_overload_real (decl
, parm_types
, ret_type
,
10101 DECL_FUNCTION_MEMBER_P (decl
)
10102 + DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (decl
));
10105 /* Return truthvalue if we're processing a template different from
10106 the last one involved in diagnotics. */
10108 problematic_instantiation_changed ()
10110 return last_template_error_tick
!= tinst_level_tick
;
10113 /* Remember current template involved in diagnostics. */
10115 record_last_problematic_instantiation ()
10117 last_template_error_tick
= tinst_level_tick
;
10121 current_instantiation ()
10123 return current_tinst_level
;