1 /* Handle parameterized types (templates) for GNU C++.
2 Copyright (C) 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000
3 Free Software Foundation, Inc.
4 Written by Ken Raeburn (raeburn@cygnus.com) while at Watchmaker Computing.
5 Rewritten by Jason Merrill (jason@cygnus.com).
7 This file is part of GNU CC.
9 GNU CC is free software; you can redistribute it and/or modify
10 it under the terms of the GNU General Public License as published by
11 the Free Software Foundation; either version 2, or (at your option)
14 GNU CC is distributed in the hope that it will be useful,
15 but WITHOUT ANY WARRANTY; without even the implied warranty of
16 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
17 GNU General Public License for more details.
19 You should have received a copy of the GNU General Public License
20 along with GNU CC; see the file COPYING. If not, write to
21 the Free Software Foundation, 59 Temple Place - Suite 330,
22 Boston, MA 02111-1307, USA. */
24 /* Known bugs or deficiencies include:
26 all methods must be provided in header files; can't use a source
27 file that contains only the method templates and "just win". */
48 /* The type of functions taking a tree, and some additional data, and
50 typedef int (*tree_fn_t
) PARAMS ((tree
, void*));
52 extern struct obstack permanent_obstack
;
54 /* The PENDING_TEMPLATES is a TREE_LIST of templates whose
55 instantiations have been deferred, either because their definitions
56 were not yet available, or because we were putting off doing the
57 work. The TREE_PURPOSE of each entry is a SRCLOC indicating where
58 the instantiate request occurred; the TREE_VALUE is a either a DECL
59 (for a function or static data member), or a TYPE (for a class)
60 indicating what we are hoping to instantiate. */
61 static tree pending_templates
;
62 static tree
*template_tail
= &pending_templates
;
64 static tree maybe_templates
;
65 static tree
*maybe_template_tail
= &maybe_templates
;
67 int processing_template_parmlist
;
68 static int template_header_count
;
70 static tree saved_trees
;
71 static varray_type inline_parm_levels
;
72 static size_t inline_parm_levels_used
;
74 static tree current_tinst_level
;
76 /* A map from local variable declarations in the body of the template
77 presently being instantiated to the corresponding instantiated
79 static htab_t local_specializations
;
81 #define obstack_chunk_alloc xmalloc
82 #define obstack_chunk_free free
84 #define UNIFY_ALLOW_NONE 0
85 #define UNIFY_ALLOW_MORE_CV_QUAL 1
86 #define UNIFY_ALLOW_LESS_CV_QUAL 2
87 #define UNIFY_ALLOW_DERIVED 4
88 #define UNIFY_ALLOW_INTEGER 8
90 #define GTB_VIA_VIRTUAL 1 /* The base class we are examining is
91 virtual, or a base class of a virtual
93 #define GTB_IGNORE_TYPE 2 /* We don't need to try to unify the current
94 type with the desired type. */
96 static int resolve_overloaded_unification
PARAMS ((tree
, tree
, tree
, tree
,
97 unification_kind_t
, int));
98 static int try_one_overload
PARAMS ((tree
, tree
, tree
, tree
, tree
,
99 unification_kind_t
, int));
100 static int unify
PARAMS ((tree
, tree
, tree
, tree
, int));
101 static void add_pending_template
PARAMS ((tree
));
102 static int push_tinst_level
PARAMS ((tree
));
103 static void reopen_tinst_level
PARAMS ((tree
));
104 static tree classtype_mangled_name
PARAMS ((tree
));
105 static char *mangle_class_name_for_template
PARAMS ((const char *, tree
, tree
));
106 static tree tsubst_initializer_list
PARAMS ((tree
, tree
));
107 static int list_eq
PARAMS ((tree
, tree
));
108 static tree get_class_bindings
PARAMS ((tree
, tree
, tree
));
109 static tree coerce_template_parms
PARAMS ((tree
, tree
, tree
, int, int));
110 static void tsubst_enum
PARAMS ((tree
, tree
, tree
));
111 static tree add_to_template_args
PARAMS ((tree
, tree
));
112 static tree add_outermost_template_args
PARAMS ((tree
, tree
));
113 static void maybe_adjust_types_for_deduction
PARAMS ((unification_kind_t
, tree
*,
115 static int type_unification_real
PARAMS ((tree
, tree
, tree
, tree
,
116 int, unification_kind_t
, int));
117 static void note_template_header
PARAMS ((int));
118 static tree maybe_fold_nontype_arg
PARAMS ((tree
));
119 static tree convert_nontype_argument
PARAMS ((tree
, tree
));
120 static tree convert_template_argument
PARAMS ((tree
, tree
, tree
, int,
122 static tree get_bindings_overload
PARAMS ((tree
, tree
, tree
));
123 static int for_each_template_parm
PARAMS ((tree
, tree_fn_t
, void*));
124 static tree build_template_parm_index
PARAMS ((int, int, int, tree
, tree
));
125 static int inline_needs_template_parms
PARAMS ((tree
));
126 static void push_inline_template_parms_recursive
PARAMS ((tree
, int));
127 static tree retrieve_specialization
PARAMS ((tree
, tree
));
128 static tree retrieve_local_specialization
PARAMS ((tree
));
129 static tree register_specialization
PARAMS ((tree
, tree
, tree
));
130 static tree register_local_specialization
PARAMS ((tree
, tree
));
131 static int unregister_specialization
PARAMS ((tree
, tree
));
132 static tree reduce_template_parm_level
PARAMS ((tree
, tree
, int));
133 static tree build_template_decl
PARAMS ((tree
, tree
));
134 static int mark_template_parm
PARAMS ((tree
, void *));
135 static tree tsubst_friend_function
PARAMS ((tree
, tree
));
136 static tree tsubst_friend_class
PARAMS ((tree
, tree
));
137 static tree get_bindings_real
PARAMS ((tree
, tree
, tree
, int));
138 static int template_decl_level
PARAMS ((tree
));
139 static tree maybe_get_template_decl_from_type_decl
PARAMS ((tree
));
140 static int check_cv_quals_for_unify
PARAMS ((int, tree
, tree
));
141 static tree tsubst_template_arg_vector
PARAMS ((tree
, tree
, int));
142 static tree tsubst_template_parms
PARAMS ((tree
, tree
, int));
143 static void regenerate_decl_from_template
PARAMS ((tree
, tree
));
144 static tree most_specialized
PARAMS ((tree
, tree
, tree
));
145 static tree most_specialized_class
PARAMS ((tree
, tree
));
146 static void set_mangled_name_for_template_decl
PARAMS ((tree
));
147 static int template_class_depth_real
PARAMS ((tree
, int));
148 static tree tsubst_aggr_type
PARAMS ((tree
, tree
, int, tree
, int));
149 static tree tsubst_decl
PARAMS ((tree
, tree
, tree
, tree
));
150 static tree tsubst_arg_types
PARAMS ((tree
, tree
, int, tree
));
151 static tree tsubst_function_type
PARAMS ((tree
, tree
, int, tree
));
152 static void check_specialization_scope
PARAMS ((void));
153 static tree process_partial_specialization
PARAMS ((tree
));
154 static void set_current_access_from_decl
PARAMS ((tree
));
155 static void check_default_tmpl_args
PARAMS ((tree
, tree
, int, int));
156 static tree tsubst_call_declarator_parms
PARAMS ((tree
, tree
, int, tree
));
157 static tree get_template_base_recursive
PARAMS ((tree
, tree
,
158 tree
, tree
, tree
, int));
159 static tree get_template_base
PARAMS ((tree
, tree
, tree
, tree
));
160 static tree try_class_unification
PARAMS ((tree
, tree
, tree
, tree
));
161 static int coerce_template_template_parms
PARAMS ((tree
, tree
, int,
163 static tree determine_specialization
PARAMS ((tree
, tree
, tree
*, int));
164 static int template_args_equal
PARAMS ((tree
, tree
));
165 static void tsubst_default_arguments
PARAMS ((tree
));
166 static tree for_each_template_parm_r
PARAMS ((tree
*, int *, void *));
167 static tree instantiate_clone
PARAMS ((tree
, tree
));
169 /* Called once to initialize pt.c. */
174 ggc_add_tree_root (&pending_templates
, 1);
175 ggc_add_tree_root (&maybe_templates
, 1);
176 ggc_add_tree_root (&saved_trees
, 1);
177 ggc_add_tree_root (¤t_tinst_level
, 1);
180 /* Do any processing required when DECL (a member template declaration
181 using TEMPLATE_PARAMETERS as its innermost parameter list) is
182 finished. Returns the TEMPLATE_DECL corresponding to DECL, unless
183 it is a specialization, in which case the DECL itself is returned. */
186 finish_member_template_decl (decl
)
189 if (decl
== NULL_TREE
|| decl
== void_type_node
)
191 else if (decl
== error_mark_node
)
192 /* By returning NULL_TREE, the parser will just ignore this
193 declaration. We have already issued the error. */
195 else if (TREE_CODE (decl
) == TREE_LIST
)
197 /* Assume that the class is the only declspec. */
198 decl
= TREE_VALUE (decl
);
199 if (IS_AGGR_TYPE (decl
) && CLASSTYPE_TEMPLATE_INFO (decl
)
200 && ! CLASSTYPE_TEMPLATE_SPECIALIZATION (decl
))
202 tree tmpl
= CLASSTYPE_TI_TEMPLATE (decl
);
203 check_member_template (tmpl
);
208 else if (TREE_CODE (decl
) == FIELD_DECL
)
209 cp_error ("data member `%D' cannot be a member template", decl
);
210 else if (DECL_TEMPLATE_INFO (decl
))
212 if (!DECL_TEMPLATE_SPECIALIZATION (decl
))
214 check_member_template (DECL_TI_TEMPLATE (decl
));
215 return DECL_TI_TEMPLATE (decl
);
221 cp_error ("invalid member template declaration `%D'", decl
);
223 return error_mark_node
;
226 /* Returns the template nesting level of the indicated class TYPE.
236 A<T>::B<U> has depth two, while A<T> has depth one.
237 Both A<T>::B<int> and A<int>::B<U> have depth one, if
238 COUNT_SPECIALIZATIONS is 0 or if they are instantiations, not
241 This function is guaranteed to return 0 if passed NULL_TREE so
242 that, for example, `template_class_depth (current_class_type)' is
246 template_class_depth_real (type
, count_specializations
)
248 int count_specializations
;
253 type
&& TREE_CODE (type
) != NAMESPACE_DECL
;
254 type
= (TREE_CODE (type
) == FUNCTION_DECL
)
255 ? CP_DECL_CONTEXT (type
) : TYPE_CONTEXT (type
))
257 if (TREE_CODE (type
) != FUNCTION_DECL
)
259 if (CLASSTYPE_TEMPLATE_INFO (type
)
260 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (type
))
261 && ((count_specializations
262 && CLASSTYPE_TEMPLATE_SPECIALIZATION (type
))
263 || uses_template_parms (CLASSTYPE_TI_ARGS (type
))))
268 if (DECL_TEMPLATE_INFO (type
)
269 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (type
))
270 && ((count_specializations
271 && DECL_TEMPLATE_SPECIALIZATION (type
))
272 || uses_template_parms (DECL_TI_ARGS (type
))))
280 /* Returns the template nesting level of the indicated class TYPE.
281 Like template_class_depth_real, but instantiations do not count in
285 template_class_depth (type
)
288 return template_class_depth_real (type
, /*count_specializations=*/0);
291 /* Returns 1 if processing DECL as part of do_pending_inlines
292 needs us to push template parms. */
295 inline_needs_template_parms (decl
)
298 if (! DECL_TEMPLATE_INFO (decl
))
301 return (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (most_general_template (decl
)))
302 > (processing_template_decl
+ DECL_TEMPLATE_SPECIALIZATION (decl
)));
305 /* Subroutine of maybe_begin_member_template_processing.
306 Push the template parms in PARMS, starting from LEVELS steps into the
307 chain, and ending at the beginning, since template parms are listed
311 push_inline_template_parms_recursive (parmlist
, levels
)
315 tree parms
= TREE_VALUE (parmlist
);
319 push_inline_template_parms_recursive (TREE_CHAIN (parmlist
), levels
- 1);
321 ++processing_template_decl
;
322 current_template_parms
323 = tree_cons (build_int_2 (0, processing_template_decl
),
324 parms
, current_template_parms
);
325 TEMPLATE_PARMS_FOR_INLINE (current_template_parms
) = 1;
328 for (i
= 0; i
< TREE_VEC_LENGTH (parms
); ++i
)
330 tree parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
331 my_friendly_assert (DECL_P (parm
), 0);
333 switch (TREE_CODE (parm
))
342 /* Make a CONST_DECL as is done in process_template_parm.
343 It is ugly that we recreate this here; the original
344 version built in process_template_parm is no longer
346 tree decl
= build_decl (CONST_DECL
, DECL_NAME (parm
),
348 DECL_ARTIFICIAL (decl
) = 1;
349 DECL_INITIAL (decl
) = DECL_INITIAL (parm
);
350 SET_DECL_TEMPLATE_PARM_P (decl
);
356 my_friendly_abort (0);
361 /* Restore the template parameter context for a member template or
362 a friend template defined in a class definition. */
365 maybe_begin_member_template_processing (decl
)
371 if (inline_needs_template_parms (decl
))
373 parms
= DECL_TEMPLATE_PARMS (most_general_template (decl
));
374 levels
= TMPL_PARMS_DEPTH (parms
) - processing_template_decl
;
376 if (DECL_TEMPLATE_SPECIALIZATION (decl
))
379 parms
= TREE_CHAIN (parms
);
382 push_inline_template_parms_recursive (parms
, levels
);
385 /* Remember how many levels of template parameters we pushed so that
386 we can pop them later. */
387 if (!inline_parm_levels
)
388 VARRAY_INT_INIT (inline_parm_levels
, 4, "inline_parm_levels");
389 if (inline_parm_levels_used
== inline_parm_levels
->num_elements
)
390 VARRAY_GROW (inline_parm_levels
, 2 * inline_parm_levels_used
);
391 VARRAY_INT (inline_parm_levels
, inline_parm_levels_used
) = levels
;
392 ++inline_parm_levels_used
;
395 /* Undo the effects of begin_member_template_processing. */
398 maybe_end_member_template_processing ()
402 if (!inline_parm_levels_used
)
405 --inline_parm_levels_used
;
407 i
< VARRAY_INT (inline_parm_levels
, inline_parm_levels_used
);
410 --processing_template_decl
;
411 current_template_parms
= TREE_CHAIN (current_template_parms
);
416 /* Returns non-zero iff T is a member template function. We must be
419 template <class T> class C { void f(); }
421 Here, f is a template function, and a member, but not a member
422 template. This function does not concern itself with the origin of
423 T, only its present state. So if we have
425 template <class T> class C { template <class U> void f(U); }
427 then neither C<int>::f<char> nor C<T>::f<double> is considered
428 to be a member template. But, `template <class U> void
429 C<int>::f(U)' is considered a member template. */
432 is_member_template (t
)
435 if (!DECL_FUNCTION_TEMPLATE_P (t
))
436 /* Anything that isn't a function or a template function is
437 certainly not a member template. */
440 /* A local class can't have member templates. */
441 if (decl_function_context (t
))
444 return (DECL_FUNCTION_MEMBER_P (DECL_TEMPLATE_RESULT (t
))
445 /* If there are more levels of template parameters than
446 there are template classes surrounding the declaration,
447 then we have a member template. */
448 && (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (t
)) >
449 template_class_depth (DECL_CONTEXT (t
))));
453 /* Returns non-zero iff T is a member template class. See
454 is_member_template for a description of what precisely constitutes
455 a member template. */
458 is_member_template_class (t
)
461 if (!DECL_CLASS_TEMPLATE_P (t
))
462 /* Anything that isn't a class template, is certainly not a member
466 if (!DECL_CLASS_SCOPE_P (t
))
467 /* Anything whose context isn't a class type is surely not a
471 /* If there are more levels of template parameters than there are
472 template classes surrounding the declaration, then we have a
474 return (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (t
)) >
475 template_class_depth (DECL_CONTEXT (t
)));
479 /* Return a new template argument vector which contains all of ARGS,
480 but has as its innermost set of arguments the EXTRA_ARGS. */
483 add_to_template_args (args
, extra_args
)
492 extra_depth
= TMPL_ARGS_DEPTH (extra_args
);
493 new_args
= make_tree_vec (TMPL_ARGS_DEPTH (args
) + extra_depth
);
495 for (i
= 1; i
<= TMPL_ARGS_DEPTH (args
); ++i
)
496 SET_TMPL_ARGS_LEVEL (new_args
, i
, TMPL_ARGS_LEVEL (args
, i
));
498 for (j
= 1; j
<= extra_depth
; ++j
, ++i
)
499 SET_TMPL_ARGS_LEVEL (new_args
, i
, TMPL_ARGS_LEVEL (extra_args
, j
));
504 /* Like add_to_template_args, but only the outermost ARGS are added to
505 the EXTRA_ARGS. In particular, all but TMPL_ARGS_DEPTH
506 (EXTRA_ARGS) levels are added. This function is used to combine
507 the template arguments from a partial instantiation with the
508 template arguments used to attain the full instantiation from the
509 partial instantiation. */
512 add_outermost_template_args (args
, extra_args
)
518 /* If there are more levels of EXTRA_ARGS than there are ARGS,
519 something very fishy is going on. */
520 my_friendly_assert (TMPL_ARGS_DEPTH (args
) >= TMPL_ARGS_DEPTH (extra_args
),
523 /* If *all* the new arguments will be the EXTRA_ARGS, just return
525 if (TMPL_ARGS_DEPTH (args
) == TMPL_ARGS_DEPTH (extra_args
))
528 /* For the moment, we make ARGS look like it contains fewer levels. */
529 TREE_VEC_LENGTH (args
) -= TMPL_ARGS_DEPTH (extra_args
);
531 new_args
= add_to_template_args (args
, extra_args
);
533 /* Now, we restore ARGS to its full dimensions. */
534 TREE_VEC_LENGTH (args
) += TMPL_ARGS_DEPTH (extra_args
);
539 /* Return the N levels of innermost template arguments from the ARGS. */
542 get_innermost_template_args (args
, n
)
550 my_friendly_assert (n
>= 0, 20000603);
552 /* If N is 1, just return the innermost set of template arguments. */
554 return TMPL_ARGS_LEVEL (args
, TMPL_ARGS_DEPTH (args
));
556 /* If we're not removing anything, just return the arguments we were
558 extra_levels
= TMPL_ARGS_DEPTH (args
) - n
;
559 my_friendly_assert (extra_levels
>= 0, 20000603);
560 if (extra_levels
== 0)
563 /* Make a new set of arguments, not containing the outer arguments. */
564 new_args
= make_tree_vec (n
);
565 for (i
= 1; i
<= n
; ++i
)
566 SET_TMPL_ARGS_LEVEL (new_args
, i
,
567 TMPL_ARGS_LEVEL (args
, i
+ extra_levels
));
572 /* We've got a template header coming up; push to a new level for storing
576 begin_template_parm_list ()
578 /* We use a non-tag-transparent scope here, which causes pushtag to
579 put tags in this scope, rather than in the enclosing class or
580 namespace scope. This is the right thing, since we want
581 TEMPLATE_DECLS, and not TYPE_DECLS for template classes. For a
582 global template class, push_template_decl handles putting the
583 TEMPLATE_DECL into top-level scope. For a nested template class,
586 template <class T> struct S1 {
587 template <class T> struct S2 {};
590 pushtag contains special code to call pushdecl_with_scope on the
591 TEMPLATE_DECL for S2. */
592 begin_scope (sk_template_parms
);
593 ++processing_template_decl
;
594 ++processing_template_parmlist
;
595 note_template_header (0);
598 /* This routine is called when a specialization is declared. If it is
599 illegal to declare a specialization here, an error is reported. */
602 check_specialization_scope ()
604 tree scope
= current_scope ();
608 An explicit specialization shall be declared in the namespace of
609 which the template is a member, or, for member templates, in the
610 namespace of which the enclosing class or enclosing class
611 template is a member. An explicit specialization of a member
612 function, member class or static data member of a class template
613 shall be declared in the namespace of which the class template
615 if (scope
&& TREE_CODE (scope
) != NAMESPACE_DECL
)
616 cp_error ("explicit specialization in non-namespace scope `%D'",
621 In an explicit specialization declaration for a member of a class
622 template or a member template that appears in namespace scope,
623 the member template and some of its enclosing class templates may
624 remain unspecialized, except that the declaration shall not
625 explicitly specialize a class member template if its enclosing
626 class templates are not explicitly specialized as well. */
627 if (current_template_parms
)
628 cp_error ("enclosing class templates are not explicitly specialized");
631 /* We've just seen template <>. */
634 begin_specialization ()
636 begin_scope (sk_template_spec
);
637 note_template_header (1);
638 check_specialization_scope ();
641 /* Called at then end of processing a declaration preceeded by
645 end_specialization ()
648 reset_specialization ();
651 /* Any template <>'s that we have seen thus far are not referring to a
652 function specialization. */
655 reset_specialization ()
657 processing_specialization
= 0;
658 template_header_count
= 0;
661 /* We've just seen a template header. If SPECIALIZATION is non-zero,
662 it was of the form template <>. */
665 note_template_header (specialization
)
668 processing_specialization
= specialization
;
669 template_header_count
++;
672 /* We're beginning an explicit instantiation. */
675 begin_explicit_instantiation ()
677 ++processing_explicit_instantiation
;
682 end_explicit_instantiation ()
684 my_friendly_assert(processing_explicit_instantiation
> 0, 0);
685 --processing_explicit_instantiation
;
688 /* The TYPE is being declared. If it is a template type, that means it
689 is a partial specialization. Do appropriate error-checking. */
692 maybe_process_partial_specialization (type
)
695 if (IS_AGGR_TYPE (type
) && CLASSTYPE_USE_TEMPLATE (type
))
697 if (CLASSTYPE_IMPLICIT_INSTANTIATION (type
)
698 && !COMPLETE_TYPE_P (type
))
700 if (current_namespace
701 != decl_namespace_context (CLASSTYPE_TI_TEMPLATE (type
)))
703 cp_pedwarn ("specializing `%#T' in different namespace", type
);
704 cp_pedwarn_at (" from definition of `%#D'",
705 CLASSTYPE_TI_TEMPLATE (type
));
707 SET_CLASSTYPE_TEMPLATE_SPECIALIZATION (type
);
708 if (processing_template_decl
)
709 push_template_decl (TYPE_MAIN_DECL (type
));
711 else if (CLASSTYPE_TEMPLATE_INSTANTIATION (type
))
712 cp_error ("specialization of `%T' after instantiation", type
);
714 else if (processing_specialization
)
715 cp_error ("explicit specialization of non-template `%T'", type
);
718 /* Retrieve the specialization (in the sense of [temp.spec] - a
719 specialization is either an instantiation or an explicit
720 specialization) of TMPL for the given template ARGS. If there is
721 no such specialization, return NULL_TREE. The ARGS are a vector of
722 arguments, or a vector of vectors of arguments, in the case of
723 templates with more than one level of parameters. */
726 retrieve_specialization (tmpl
, args
)
732 my_friendly_assert (TREE_CODE (tmpl
) == TEMPLATE_DECL
, 0);
734 /* There should be as many levels of arguments as there are
735 levels of parameters. */
736 my_friendly_assert (TMPL_ARGS_DEPTH (args
)
737 == TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl
)),
740 for (s
= DECL_TEMPLATE_SPECIALIZATIONS (tmpl
);
743 if (comp_template_args (TREE_PURPOSE (s
), args
))
744 return TREE_VALUE (s
);
749 /* Like retrieve_speciailization, but for local declarations. */
752 retrieve_local_specialization (tmpl
)
755 return (tree
) htab_find (local_specializations
, tmpl
);
758 /* Returns non-zero iff DECL is a specialization of TMPL. */
761 is_specialization_of (decl
, tmpl
)
767 if (TREE_CODE (decl
) == FUNCTION_DECL
)
771 t
= DECL_TEMPLATE_INFO (t
) ? DECL_TI_TEMPLATE (t
) : NULL_TREE
)
777 my_friendly_assert (TREE_CODE (decl
) == TYPE_DECL
, 0);
779 for (t
= TREE_TYPE (decl
);
781 t
= CLASSTYPE_USE_TEMPLATE (t
)
782 ? TREE_TYPE (CLASSTYPE_TI_TEMPLATE (t
)) : NULL_TREE
)
783 if (same_type_ignoring_top_level_qualifiers_p (t
, TREE_TYPE (tmpl
)))
790 /* Register the specialization SPEC as a specialization of TMPL with
791 the indicated ARGS. Returns SPEC, or an equivalent prior
792 declaration, if available. */
795 register_specialization (spec
, tmpl
, args
)
802 my_friendly_assert (TREE_CODE (tmpl
) == TEMPLATE_DECL
, 0);
804 if (TREE_CODE (spec
) == FUNCTION_DECL
805 && uses_template_parms (DECL_TI_ARGS (spec
)))
806 /* This is the FUNCTION_DECL for a partial instantiation. Don't
807 register it; we want the corresponding TEMPLATE_DECL instead.
808 We use `uses_template_parms (DECL_TI_ARGS (spec))' rather than
809 the more obvious `uses_template_parms (spec)' to avoid problems
810 with default function arguments. In particular, given
813 template <class T> void f(T t1, T t = T())
815 the default argument expression is not substituted for in an
816 instantiation unless and until it is actually needed. */
819 /* There should be as many levels of arguments as there are
820 levels of parameters. */
821 my_friendly_assert (TMPL_ARGS_DEPTH (args
)
822 == TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl
)),
825 for (s
= DECL_TEMPLATE_SPECIALIZATIONS (tmpl
);
829 tree fn
= TREE_VALUE (s
);
831 /* We can sometimes try to re-register a specialization that we've
832 already got. In particular, regenerate_decl_from_template
833 calls duplicate_decls which will update the specialization
834 list. But, we'll still get called again here anyhow. It's
835 more convenient to simply allow this than to try to prevent it. */
838 else if (comp_template_args (TREE_PURPOSE (s
), args
))
840 if (DECL_TEMPLATE_SPECIALIZATION (spec
))
842 if (DECL_TEMPLATE_INSTANTIATION (fn
))
845 || DECL_EXPLICIT_INSTANTIATION (fn
))
847 cp_error ("specialization of %D after instantiation",
853 /* This situation should occur only if the first
854 specialization is an implicit instantiation,
855 the second is an explicit specialization, and
856 the implicit instantiation has not yet been
857 used. That situation can occur if we have
858 implicitly instantiated a member function and
859 then specialized it later.
861 We can also wind up here if a friend
862 declaration that looked like an instantiation
863 turns out to be a specialization:
865 template <class T> void foo(T);
866 class S { friend void foo<>(int) };
867 template <> void foo(int);
869 We transform the existing DECL in place so that
870 any pointers to it become pointers to the
873 If there was a definition for the template, but
874 not for the specialization, we want this to
875 look as if there is no definition, and vice
877 DECL_INITIAL (fn
) = NULL_TREE
;
878 duplicate_decls (spec
, fn
);
883 else if (DECL_TEMPLATE_SPECIALIZATION (fn
))
885 duplicate_decls (spec
, fn
);
892 DECL_TEMPLATE_SPECIALIZATIONS (tmpl
)
893 = tree_cons (args
, spec
, DECL_TEMPLATE_SPECIALIZATIONS (tmpl
));
898 /* Unregister the specialization SPEC as a specialization of TMPL.
899 Returns nonzero if the SPEC was listed as a specialization of
903 unregister_specialization (spec
, tmpl
)
909 for (s
= &DECL_TEMPLATE_SPECIALIZATIONS (tmpl
);
911 s
= &TREE_CHAIN (*s
))
912 if (TREE_VALUE (*s
) == spec
)
914 *s
= TREE_CHAIN (*s
);
921 /* Like register_specialization, but for local declarations. We are
922 registering SPEC, an instantiation of TMPL. */
925 register_local_specialization (spec
, tmpl
)
931 slot
= htab_find_slot (local_specializations
, tmpl
, INSERT
);
937 /* Print the list of candidate FNS in an error message. */
940 print_candidates (fns
)
945 const char *str
= "candidates are:";
947 for (fn
= fns
; fn
!= NULL_TREE
; fn
= TREE_CHAIN (fn
))
951 for (f
= TREE_VALUE (fn
); f
; f
= OVL_NEXT (f
))
952 cp_error_at ("%s %+#D", str
, OVL_CURRENT (f
));
957 /* Returns the template (one of the functions given by TEMPLATE_ID)
958 which can be specialized to match the indicated DECL with the
959 explicit template args given in TEMPLATE_ID. The DECL may be
960 NULL_TREE if none is available. In that case, the functions in
961 TEMPLATE_ID are non-members.
963 If NEED_MEMBER_TEMPLATE is non-zero the function is known to be a
964 specialization of a member template.
966 The template args (those explicitly specified and those deduced)
967 are output in a newly created vector *TARGS_OUT.
969 If it is impossible to determine the result, an error message is
970 issued. The error_mark_node is returned to indicate failure. */
973 determine_specialization (template_id
, decl
, targs_out
,
974 need_member_template
)
978 int need_member_template
;
983 tree candidates
= NULL_TREE
;
984 tree templates
= NULL_TREE
;
986 *targs_out
= NULL_TREE
;
988 if (template_id
== error_mark_node
)
989 return error_mark_node
;
991 fns
= TREE_OPERAND (template_id
, 0);
992 explicit_targs
= TREE_OPERAND (template_id
, 1);
994 if (fns
== error_mark_node
)
995 return error_mark_node
;
997 /* Check for baselinks. */
998 if (BASELINK_P (fns
))
999 fns
= TREE_VALUE (fns
);
1001 if (!is_overloaded_fn (fns
))
1003 cp_error ("`%D' is not a function template", fns
);
1004 return error_mark_node
;
1007 for (; fns
; fns
= OVL_NEXT (fns
))
1011 tree fn
= OVL_CURRENT (fns
);
1013 if (TREE_CODE (fn
) == TEMPLATE_DECL
)
1014 /* DECL might be a specialization of FN. */
1016 else if (need_member_template
)
1017 /* FN is an ordinary member function, and we need a
1018 specialization of a member template. */
1020 else if (TREE_CODE (fn
) != FUNCTION_DECL
)
1021 /* We can get IDENTIFIER_NODEs here in certain erroneous
1024 else if (!DECL_FUNCTION_MEMBER_P (fn
))
1025 /* This is just an ordinary non-member function. Nothing can
1026 be a specialization of that. */
1030 tree decl_arg_types
;
1032 /* This is an ordinary member function. However, since
1033 we're here, we can assume it's enclosing class is a
1034 template class. For example,
1036 template <typename T> struct S { void f(); };
1037 template <> void S<int>::f() {}
1039 Here, S<int>::f is a non-template, but S<int> is a
1040 template class. If FN has the same type as DECL, we
1041 might be in business. */
1042 if (!same_type_p (TREE_TYPE (TREE_TYPE (decl
)),
1043 TREE_TYPE (TREE_TYPE (fn
))))
1044 /* The return types differ. */
1047 /* Adjust the type of DECL in case FN is a static member. */
1048 decl_arg_types
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
1049 if (DECL_STATIC_FUNCTION_P (fn
)
1050 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
1051 decl_arg_types
= TREE_CHAIN (decl_arg_types
);
1053 if (compparms (TYPE_ARG_TYPES (TREE_TYPE (fn
)),
1056 candidates
= tree_cons (NULL_TREE
, fn
, candidates
);
1061 /* See whether this function might be a specialization of this
1063 targs
= get_bindings (tmpl
, decl
, explicit_targs
);
1066 /* We cannot deduce template arguments that when used to
1067 specialize TMPL will produce DECL. */
1070 /* Save this template, and the arguments deduced. */
1071 templates
= tree_cons (targs
, tmpl
, templates
);
1074 if (templates
&& TREE_CHAIN (templates
))
1080 It is possible for a specialization with a given function
1081 signature to be instantiated from more than one function
1082 template. In such cases, explicit specification of the
1083 template arguments must be used to uniquely identify the
1084 function template specialization being specialized.
1086 Note that here, there's no suggestion that we're supposed to
1087 determine which of the candidate templates is most
1088 specialized. However, we, also have:
1092 Partial ordering of overloaded function template
1093 declarations is used in the following contexts to select
1094 the function template to which a function template
1095 specialization refers:
1097 -- when an explicit specialization refers to a function
1100 So, we do use the partial ordering rules, at least for now.
1101 This extension can only serve to make illegal programs legal,
1102 so it's safe. And, there is strong anecdotal evidence that
1103 the committee intended the partial ordering rules to apply;
1104 the EDG front-end has that behavior, and John Spicer claims
1105 that the committee simply forgot to delete the wording in
1106 [temp.expl.spec]. */
1107 tree tmpl
= most_specialized (templates
, decl
, explicit_targs
);
1108 if (tmpl
&& tmpl
!= error_mark_node
)
1110 targs
= get_bindings (tmpl
, decl
, explicit_targs
);
1111 templates
= tree_cons (targs
, tmpl
, NULL_TREE
);
1115 if (templates
== NULL_TREE
&& candidates
== NULL_TREE
)
1117 cp_error_at ("template-id `%D' for `%+D' does not match any template declaration",
1119 return error_mark_node
;
1121 else if ((templates
&& TREE_CHAIN (templates
))
1122 || (candidates
&& TREE_CHAIN (candidates
))
1123 || (templates
&& candidates
))
1125 cp_error_at ("ambiguous template specialization `%D' for `%+D'",
1127 chainon (candidates
, templates
);
1128 print_candidates (candidates
);
1129 return error_mark_node
;
1132 /* We have one, and exactly one, match. */
1135 /* It was a specialization of an ordinary member function in a
1137 *targs_out
= copy_node (DECL_TI_ARGS (TREE_VALUE (candidates
)));
1138 return DECL_TI_TEMPLATE (TREE_VALUE (candidates
));
1141 /* It was a specialization of a template. */
1142 targs
= DECL_TI_ARGS (DECL_TEMPLATE_RESULT (TREE_VALUE (templates
)));
1143 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (targs
))
1145 *targs_out
= copy_node (targs
);
1146 SET_TMPL_ARGS_LEVEL (*targs_out
,
1147 TMPL_ARGS_DEPTH (*targs_out
),
1148 TREE_PURPOSE (templates
));
1151 *targs_out
= TREE_PURPOSE (templates
);
1152 return TREE_VALUE (templates
);
1155 /* Check to see if the function just declared, as indicated in
1156 DECLARATOR, and in DECL, is a specialization of a function
1157 template. We may also discover that the declaration is an explicit
1158 instantiation at this point.
1160 Returns DECL, or an equivalent declaration that should be used
1161 instead if all goes well. Issues an error message if something is
1162 amiss. Returns error_mark_node if the error is not easily
1165 FLAGS is a bitmask consisting of the following flags:
1167 2: The function has a definition.
1168 4: The function is a friend.
1170 The TEMPLATE_COUNT is the number of references to qualifying
1171 template classes that appeared in the name of the function. For
1174 template <class T> struct S { void f(); };
1177 the TEMPLATE_COUNT would be 1. However, explicitly specialized
1178 classes are not counted in the TEMPLATE_COUNT, so that in
1180 template <class T> struct S {};
1181 template <> struct S<int> { void f(); }
1182 template <> void S<int>::f();
1184 the TEMPLATE_COUNT would be 0. (Note that this declaration is
1185 illegal; there should be no template <>.)
1187 If the function is a specialization, it is marked as such via
1188 DECL_TEMPLATE_SPECIALIZATION. Furthermore, its DECL_TEMPLATE_INFO
1189 is set up correctly, and it is added to the list of specializations
1190 for that template. */
1193 check_explicit_specialization (declarator
, decl
, template_count
, flags
)
1199 int have_def
= flags
& 2;
1200 int is_friend
= flags
& 4;
1201 int specialization
= 0;
1202 int explicit_instantiation
= 0;
1203 int member_specialization
= 0;
1204 tree ctype
= DECL_CLASS_CONTEXT (decl
);
1205 tree dname
= DECL_NAME (decl
);
1208 tsk
= current_tmpl_spec_kind (template_count
);
1213 if (processing_specialization
)
1216 SET_DECL_TEMPLATE_SPECIALIZATION (decl
);
1218 else if (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
)
1221 /* This could be something like:
1223 template <class T> void f(T);
1224 class S { friend void f<>(int); } */
1228 /* This case handles bogus declarations like template <>
1229 template <class T> void f<int>(); */
1231 cp_error ("template-id `%D' in declaration of primary template",
1238 case tsk_invalid_member_spec
:
1239 /* The error has already been reported in
1240 check_specialization_scope. */
1241 return error_mark_node
;
1243 case tsk_invalid_expl_inst
:
1244 cp_error ("template parameter list used in explicit instantiation");
1250 cp_error ("definition provided for explicit instantiation");
1252 explicit_instantiation
= 1;
1255 case tsk_excessive_parms
:
1256 cp_error ("too many template parameter lists in declaration of `%D'",
1258 return error_mark_node
;
1262 SET_DECL_TEMPLATE_SPECIALIZATION (decl
);
1264 member_specialization
= 1;
1269 case tsk_insufficient_parms
:
1270 if (template_header_count
)
1272 cp_error("too few template parameter lists in declaration of `%D'",
1276 else if (ctype
!= NULL_TREE
1277 && !TYPE_BEING_DEFINED (ctype
)
1278 && CLASSTYPE_TEMPLATE_INSTANTIATION (ctype
)
1281 /* For backwards compatibility, we accept:
1283 template <class T> struct S { void f(); };
1284 void S<int>::f() {} // Missing template <>
1286 That used to be legal C++. */
1289 ("explicit specialization not preceded by `template <>'");
1291 SET_DECL_TEMPLATE_SPECIALIZATION (decl
);
1296 if (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
)
1298 /* This case handles bogus declarations like template <>
1299 template <class T> void f<int>(); */
1301 if (uses_template_parms (declarator
))
1302 cp_error ("partial specialization `%D' of function template",
1305 cp_error ("template-id `%D' in declaration of primary template",
1310 if (ctype
&& CLASSTYPE_TEMPLATE_INSTANTIATION (ctype
))
1311 /* This is a specialization of a member template, without
1312 specialization the containing class. Something like:
1314 template <class T> struct S {
1315 template <class U> void f (U);
1317 template <> template <class U> void S<int>::f(U) {}
1319 That's a specialization -- but of the entire template. */
1324 my_friendly_abort (20000309);
1327 if (specialization
|| member_specialization
)
1329 tree t
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
1330 for (; t
; t
= TREE_CHAIN (t
))
1331 if (TREE_PURPOSE (t
))
1334 ("default argument specified in explicit specialization");
1337 if (current_lang_name
== lang_name_c
)
1338 cp_error ("template specialization with C linkage");
1341 if (specialization
|| member_specialization
|| explicit_instantiation
)
1343 tree tmpl
= NULL_TREE
;
1344 tree targs
= NULL_TREE
;
1346 /* Make sure that the declarator is a TEMPLATE_ID_EXPR. */
1347 if (TREE_CODE (declarator
) != TEMPLATE_ID_EXPR
)
1351 my_friendly_assert (TREE_CODE (declarator
) == IDENTIFIER_NODE
,
1354 fns
= IDENTIFIER_NAMESPACE_VALUE (dname
);
1359 lookup_template_function (fns
, NULL_TREE
);
1362 if (declarator
== error_mark_node
)
1363 return error_mark_node
;
1365 if (ctype
!= NULL_TREE
&& TYPE_BEING_DEFINED (ctype
))
1367 if (!explicit_instantiation
)
1368 /* A specialization in class scope. This is illegal,
1369 but the error will already have been flagged by
1370 check_specialization_scope. */
1371 return error_mark_node
;
1374 /* It's not legal to write an explicit instantiation in
1377 class C { template void f(); }
1379 This case is caught by the parser. However, on
1382 template class C { void f(); };
1384 (which is illegal) we can get here. The error will be
1391 else if (TREE_CODE (TREE_OPERAND (declarator
, 0)) == LOOKUP_EXPR
)
1393 /* A friend declaration. We can't do much, because we don't
1394 know what this resolves to, yet. */
1395 my_friendly_assert (is_friend
!= 0, 0);
1396 my_friendly_assert (!explicit_instantiation
, 0);
1397 SET_DECL_IMPLICIT_INSTANTIATION (decl
);
1400 else if (ctype
!= NULL_TREE
1401 && (TREE_CODE (TREE_OPERAND (declarator
, 0)) ==
1404 /* Find the list of functions in ctype that have the same
1405 name as the declared function. */
1406 tree name
= TREE_OPERAND (declarator
, 0);
1407 tree fns
= NULL_TREE
;
1410 if (name
== constructor_name (ctype
)
1411 || name
== constructor_name_full (ctype
))
1413 int is_constructor
= DECL_CONSTRUCTOR_P (decl
);
1415 if (is_constructor
? !TYPE_HAS_CONSTRUCTOR (ctype
)
1416 : !TYPE_HAS_DESTRUCTOR (ctype
))
1418 /* From [temp.expl.spec]:
1420 If such an explicit specialization for the member
1421 of a class template names an implicitly-declared
1422 special member function (clause _special_), the
1423 program is ill-formed.
1425 Similar language is found in [temp.explicit]. */
1426 cp_error ("specialization of implicitly-declared special member function");
1427 return error_mark_node
;
1430 name
= is_constructor
? ctor_identifier
: dtor_identifier
;
1433 if (!DECL_CONV_FN_P (decl
))
1435 idx
= lookup_fnfields_1 (ctype
, name
);
1437 fns
= TREE_VEC_ELT (CLASSTYPE_METHOD_VEC (ctype
), idx
);
1443 /* For a type-conversion operator, we cannot do a
1444 name-based lookup. We might be looking for `operator
1445 int' which will be a specialization of `operator T'.
1446 So, we find *all* the conversion operators, and then
1447 select from them. */
1450 methods
= CLASSTYPE_METHOD_VEC (ctype
);
1452 for (idx
= 2; idx
< TREE_VEC_LENGTH (methods
); ++idx
)
1454 tree ovl
= TREE_VEC_ELT (methods
, idx
);
1456 if (!ovl
|| !DECL_CONV_FN_P (OVL_CURRENT (ovl
)))
1457 /* There are no more conversion functions. */
1460 /* Glue all these conversion functions together
1461 with those we already have. */
1462 for (; ovl
; ovl
= OVL_NEXT (ovl
))
1463 fns
= ovl_cons (OVL_CURRENT (ovl
), fns
);
1467 if (fns
== NULL_TREE
)
1469 cp_error ("no member function `%D' declared in `%T'",
1471 return error_mark_node
;
1474 TREE_OPERAND (declarator
, 0) = fns
;
1477 /* Figure out what exactly is being specialized at this point.
1478 Note that for an explicit instantiation, even one for a
1479 member function, we cannot tell apriori whether the
1480 instantiation is for a member template, or just a member
1481 function of a template class. Even if a member template is
1482 being instantiated, the member template arguments may be
1483 elided if they can be deduced from the rest of the
1485 tmpl
= determine_specialization (declarator
, decl
,
1487 member_specialization
);
1489 if (!tmpl
|| tmpl
== error_mark_node
)
1490 /* We couldn't figure out what this declaration was
1492 return error_mark_node
;
1495 tree gen_tmpl
= most_general_template (tmpl
);
1497 if (explicit_instantiation
)
1499 /* We don't set DECL_EXPLICIT_INSTANTIATION here; that
1500 is done by do_decl_instantiation later. */
1502 int arg_depth
= TMPL_ARGS_DEPTH (targs
);
1503 int parm_depth
= TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl
));
1505 if (arg_depth
> parm_depth
)
1507 /* If TMPL is not the most general template (for
1508 example, if TMPL is a friend template that is
1509 injected into namespace scope), then there will
1510 be too many levels fo TARGS. Remove some of them
1515 new_targs
= make_tree_vec (parm_depth
);
1516 for (i
= arg_depth
- parm_depth
; i
< arg_depth
; ++i
)
1517 TREE_VEC_ELT (new_targs
, i
- (arg_depth
- parm_depth
))
1518 = TREE_VEC_ELT (targs
, i
);
1522 return instantiate_template (tmpl
, targs
);
1525 /* If this is a specialization of a member template of a
1526 template class. In we want to return the TEMPLATE_DECL,
1527 not the specialization of it. */
1528 if (tsk
== tsk_template
)
1530 SET_DECL_TEMPLATE_SPECIALIZATION (tmpl
);
1531 DECL_INITIAL (DECL_TEMPLATE_RESULT (tmpl
)) = NULL_TREE
;
1535 /* If we though that the DECL was a member function, but it
1536 turns out to be specializing a static member function,
1537 make DECL a static member function as well. */
1538 if (DECL_STATIC_FUNCTION_P (tmpl
)
1539 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
1541 revert_static_member_fn (decl
);
1542 last_function_parms
= TREE_CHAIN (last_function_parms
);
1545 /* Set up the DECL_TEMPLATE_INFO for DECL. */
1546 DECL_TEMPLATE_INFO (decl
) = tree_cons (tmpl
, targs
, NULL_TREE
);
1548 /* Mangle the function name appropriately. Note that we do
1549 not mangle specializations of non-template member
1550 functions of template classes, e.g. with
1552 template <class T> struct S { void f(); }
1554 and given the specialization
1556 template <> void S<int>::f() {}
1558 we do not mangle S<int>::f() here. That's because it's
1559 just an ordinary member function and doesn't need special
1560 treatment. We do this here so that the ordinary,
1561 non-template, name-mangling algorithm will not be used
1563 if ((is_member_template (tmpl
) || ctype
== NULL_TREE
)
1564 && name_mangling_version
>= 1)
1565 set_mangled_name_for_template_decl (decl
);
1567 if (is_friend
&& !have_def
)
1568 /* This is not really a declaration of a specialization.
1569 It's just the name of an instantiation. But, it's not
1570 a request for an instantiation, either. */
1571 SET_DECL_IMPLICIT_INSTANTIATION (decl
);
1573 /* Register this specialization so that we can find it
1575 decl
= register_specialization (decl
, gen_tmpl
, targs
);
1582 /* TYPE is being declared. Verify that the use of template headers
1583 and such is reasonable. Issue error messages if not. */
1586 maybe_check_template_type (type
)
1589 if (template_header_count
)
1591 /* We are in the scope of some `template <...>' header. */
1594 = template_class_depth_real (TYPE_CONTEXT (type
),
1595 /*count_specializations=*/1);
1597 if (template_header_count
<= context_depth
)
1598 /* This is OK; the template headers are for the context. We
1599 are actually too lenient here; like
1600 check_explicit_specialization we should consider the number
1601 of template types included in the actual declaration. For
1604 template <class T> struct S {
1605 template <class U> template <class V>
1611 template <class T> struct S {
1612 template <class U> struct I;
1615 template <class T> template <class U.
1620 else if (template_header_count
> context_depth
+ 1)
1621 /* There are two many template parameter lists. */
1622 cp_error ("too many template parameter lists in declaration of `%T'", type
);
1626 /* Returns 1 iff PARMS1 and PARMS2 are identical sets of template
1627 parameters. These are represented in the same format used for
1628 DECL_TEMPLATE_PARMS. */
1630 int comp_template_parms (parms1
, parms2
)
1637 if (parms1
== parms2
)
1640 for (p1
= parms1
, p2
= parms2
;
1641 p1
!= NULL_TREE
&& p2
!= NULL_TREE
;
1642 p1
= TREE_CHAIN (p1
), p2
= TREE_CHAIN (p2
))
1644 tree t1
= TREE_VALUE (p1
);
1645 tree t2
= TREE_VALUE (p2
);
1648 my_friendly_assert (TREE_CODE (t1
) == TREE_VEC
, 0);
1649 my_friendly_assert (TREE_CODE (t2
) == TREE_VEC
, 0);
1651 if (TREE_VEC_LENGTH (t1
) != TREE_VEC_LENGTH (t2
))
1654 for (i
= 0; i
< TREE_VEC_LENGTH (t2
); ++i
)
1656 tree parm1
= TREE_VALUE (TREE_VEC_ELT (t1
, i
));
1657 tree parm2
= TREE_VALUE (TREE_VEC_ELT (t2
, i
));
1659 if (TREE_CODE (parm1
) != TREE_CODE (parm2
))
1662 if (TREE_CODE (parm1
) == TEMPLATE_TYPE_PARM
)
1664 else if (!same_type_p (TREE_TYPE (parm1
), TREE_TYPE (parm2
)))
1669 if ((p1
!= NULL_TREE
) != (p2
!= NULL_TREE
))
1670 /* One set of parameters has more parameters lists than the
1677 /* Complain if DECL shadows a template parameter.
1679 [temp.local]: A template-parameter shall not be redeclared within its
1680 scope (including nested scopes). */
1683 check_template_shadow (decl
)
1688 /* If we're not in a template, we can't possibly shadow a template
1690 if (!current_template_parms
)
1693 /* Figure out what we're shadowing. */
1694 if (TREE_CODE (decl
) == OVERLOAD
)
1695 decl
= OVL_CURRENT (decl
);
1696 olddecl
= IDENTIFIER_VALUE (DECL_NAME (decl
));
1698 /* If there's no previous binding for this name, we're not shadowing
1699 anything, let alone a template parameter. */
1703 /* If we're not shadowing a template parameter, we're done. Note
1704 that OLDDECL might be an OVERLOAD (or perhaps even an
1705 ERROR_MARK), so we can't just blithely assume it to be a _DECL
1707 if (!DECL_P (olddecl
) || !DECL_TEMPLATE_PARM_P (olddecl
))
1710 /* We check for decl != olddecl to avoid bogus errors for using a
1711 name inside a class. We check TPFI to avoid duplicate errors for
1712 inline member templates. */
1714 || TEMPLATE_PARMS_FOR_INLINE (current_template_parms
))
1717 cp_error_at ("declaration of `%#D'", decl
);
1718 cp_error_at (" shadows template parm `%#D'", olddecl
);
1721 /* Return a new TEMPLATE_PARM_INDEX with the indicated INDEX, LEVEL,
1722 ORIG_LEVEL, DECL, and TYPE. */
1725 build_template_parm_index (index
, level
, orig_level
, decl
, type
)
1732 tree t
= make_node (TEMPLATE_PARM_INDEX
);
1733 TEMPLATE_PARM_IDX (t
) = index
;
1734 TEMPLATE_PARM_LEVEL (t
) = level
;
1735 TEMPLATE_PARM_ORIG_LEVEL (t
) = orig_level
;
1736 TEMPLATE_PARM_DECL (t
) = decl
;
1737 TREE_TYPE (t
) = type
;
1742 /* Return a TEMPLATE_PARM_INDEX, similar to INDEX, but whose
1743 TEMPLATE_PARM_LEVEL has been decreased by LEVELS. If such a
1744 TEMPLATE_PARM_INDEX already exists, it is returned; otherwise, a
1745 new one is created. */
1748 reduce_template_parm_level (index
, type
, levels
)
1753 if (TEMPLATE_PARM_DESCENDANTS (index
) == NULL_TREE
1754 || (TEMPLATE_PARM_LEVEL (TEMPLATE_PARM_DESCENDANTS (index
))
1755 != TEMPLATE_PARM_LEVEL (index
) - levels
))
1758 = build_decl (TREE_CODE (TEMPLATE_PARM_DECL (index
)),
1759 DECL_NAME (TEMPLATE_PARM_DECL (index
)),
1762 = build_template_parm_index (TEMPLATE_PARM_IDX (index
),
1763 TEMPLATE_PARM_LEVEL (index
) - levels
,
1764 TEMPLATE_PARM_ORIG_LEVEL (index
),
1766 TEMPLATE_PARM_DESCENDANTS (index
) = t
;
1768 /* Template template parameters need this. */
1769 DECL_TEMPLATE_PARMS (decl
)
1770 = DECL_TEMPLATE_PARMS (TEMPLATE_PARM_DECL (index
));
1773 return TEMPLATE_PARM_DESCENDANTS (index
);
1776 /* Process information from new template parameter NEXT and append it to the
1777 LIST being built. */
1780 process_template_parm (list
, next
)
1789 my_friendly_assert (TREE_CODE (parm
) == TREE_LIST
, 259);
1790 defval
= TREE_PURPOSE (parm
);
1791 parm
= TREE_VALUE (parm
);
1792 is_type
= TREE_PURPOSE (parm
) == class_type_node
;
1796 tree p
= TREE_VALUE (tree_last (list
));
1798 if (TREE_CODE (p
) == TYPE_DECL
|| TREE_CODE (p
) == TEMPLATE_DECL
)
1799 idx
= TEMPLATE_TYPE_IDX (TREE_TYPE (p
));
1801 idx
= TEMPLATE_PARM_IDX (DECL_INITIAL (p
));
1809 my_friendly_assert (TREE_CODE (TREE_PURPOSE (parm
)) == TREE_LIST
, 260);
1810 /* is a const-param */
1811 parm
= grokdeclarator (TREE_VALUE (parm
), TREE_PURPOSE (parm
),
1812 PARM
, 0, NULL_TREE
);
1816 The top-level cv-qualifiers on the template-parameter are
1817 ignored when determining its type. */
1818 TREE_TYPE (parm
) = TYPE_MAIN_VARIANT (TREE_TYPE (parm
));
1820 /* A template parameter is not modifiable. */
1821 TREE_READONLY (parm
) = 1;
1822 if (IS_AGGR_TYPE (TREE_TYPE (parm
))
1823 && TREE_CODE (TREE_TYPE (parm
)) != TEMPLATE_TYPE_PARM
1824 && TREE_CODE (TREE_TYPE (parm
)) != TYPENAME_TYPE
)
1826 cp_error ("`%#T' is not a valid type for a template constant parameter",
1828 if (DECL_NAME (parm
) == NULL_TREE
)
1829 error (" a template type parameter must begin with `class' or `typename'");
1830 TREE_TYPE (parm
) = void_type_node
;
1833 && (TREE_CODE (TREE_TYPE (parm
)) == REAL_TYPE
1834 || TREE_CODE (TREE_TYPE (parm
)) == COMPLEX_TYPE
))
1835 cp_pedwarn ("`%T' is not a valid type for a template constant parameter",
1837 decl
= build_decl (CONST_DECL
, DECL_NAME (parm
), TREE_TYPE (parm
));
1838 DECL_INITIAL (parm
) = DECL_INITIAL (decl
)
1839 = build_template_parm_index (idx
, processing_template_decl
,
1840 processing_template_decl
,
1841 decl
, TREE_TYPE (parm
));
1846 parm
= TREE_VALUE (parm
);
1848 if (parm
&& TREE_CODE (parm
) == TEMPLATE_DECL
)
1850 t
= make_aggr_type (TEMPLATE_TEMPLATE_PARM
);
1851 /* This is for distinguishing between real templates and template
1852 template parameters */
1853 TREE_TYPE (parm
) = t
;
1854 TREE_TYPE (DECL_TEMPLATE_RESULT (parm
)) = t
;
1859 t
= make_aggr_type (TEMPLATE_TYPE_PARM
);
1860 /* parm is either IDENTIFIER_NODE or NULL_TREE */
1861 decl
= build_decl (TYPE_DECL
, parm
, t
);
1864 TYPE_NAME (t
) = decl
;
1865 TYPE_STUB_DECL (t
) = decl
;
1867 TEMPLATE_TYPE_PARM_INDEX (t
)
1868 = build_template_parm_index (idx
, processing_template_decl
,
1869 processing_template_decl
,
1870 decl
, TREE_TYPE (parm
));
1872 DECL_ARTIFICIAL (decl
) = 1;
1873 SET_DECL_TEMPLATE_PARM_P (decl
);
1875 parm
= build_tree_list (defval
, parm
);
1876 return chainon (list
, parm
);
1879 /* The end of a template parameter list has been reached. Process the
1880 tree list into a parameter vector, converting each parameter into a more
1881 useful form. Type parameters are saved as IDENTIFIER_NODEs, and others
1885 end_template_parm_list (parms
)
1890 tree saved_parmlist
= make_tree_vec (list_length (parms
));
1892 current_template_parms
1893 = tree_cons (build_int_2 (0, processing_template_decl
),
1894 saved_parmlist
, current_template_parms
);
1896 for (parm
= parms
, nparms
= 0;
1898 parm
= TREE_CHAIN (parm
), nparms
++)
1899 TREE_VEC_ELT (saved_parmlist
, nparms
) = parm
;
1901 --processing_template_parmlist
;
1903 return saved_parmlist
;
1906 /* end_template_decl is called after a template declaration is seen. */
1909 end_template_decl ()
1911 reset_specialization ();
1913 if (! processing_template_decl
)
1916 /* This matches the pushlevel in begin_template_parm_list. */
1919 --processing_template_decl
;
1920 current_template_parms
= TREE_CHAIN (current_template_parms
);
1923 /* Given a template argument vector containing the template PARMS.
1924 The innermost PARMS are given first. */
1927 current_template_args ()
1930 tree args
= NULL_TREE
;
1931 int length
= TMPL_PARMS_DEPTH (current_template_parms
);
1934 /* If there is only one level of template parameters, we do not
1935 create a TREE_VEC of TREE_VECs. Instead, we return a single
1936 TREE_VEC containing the arguments. */
1938 args
= make_tree_vec (length
);
1940 for (header
= current_template_parms
; header
; header
= TREE_CHAIN (header
))
1942 tree a
= copy_node (TREE_VALUE (header
));
1945 TREE_TYPE (a
) = NULL_TREE
;
1946 for (i
= TREE_VEC_LENGTH (a
) - 1; i
>= 0; --i
)
1948 tree t
= TREE_VEC_ELT (a
, i
);
1950 /* T will be a list if we are called from within a
1951 begin/end_template_parm_list pair, but a vector directly
1952 if within a begin/end_member_template_processing pair. */
1953 if (TREE_CODE (t
) == TREE_LIST
)
1957 if (TREE_CODE (t
) == TYPE_DECL
1958 || TREE_CODE (t
) == TEMPLATE_DECL
)
1961 t
= DECL_INITIAL (t
);
1962 TREE_VEC_ELT (a
, i
) = t
;
1967 TREE_VEC_ELT (args
, --l
) = a
;
1975 /* Return a TEMPLATE_DECL corresponding to DECL, using the indicated
1976 template PARMS. Used by push_template_decl below. */
1979 build_template_decl (decl
, parms
)
1983 tree tmpl
= build_lang_decl (TEMPLATE_DECL
, DECL_NAME (decl
), NULL_TREE
);
1984 DECL_TEMPLATE_PARMS (tmpl
) = parms
;
1985 DECL_CONTEXT (tmpl
) = DECL_CONTEXT (decl
);
1986 if (DECL_LANG_SPECIFIC (decl
))
1988 DECL_VIRTUAL_CONTEXT (tmpl
) = DECL_VIRTUAL_CONTEXT (decl
);
1989 DECL_STATIC_FUNCTION_P (tmpl
) = DECL_STATIC_FUNCTION_P (decl
);
1990 DECL_CONSTRUCTOR_P (tmpl
) = DECL_CONSTRUCTOR_P (decl
);
1991 DECL_NONCONVERTING_P (tmpl
) = DECL_NONCONVERTING_P (decl
);
1992 DECL_ASSIGNMENT_OPERATOR_P (tmpl
) = DECL_ASSIGNMENT_OPERATOR_P (decl
);
1993 if (DECL_OVERLOADED_OPERATOR_P (decl
))
1994 SET_OVERLOADED_OPERATOR_CODE (tmpl
,
1995 DECL_OVERLOADED_OPERATOR_P (decl
));
2001 struct template_parm_data
2003 /* The level of the template parameters we are currently
2007 /* The index of the specialization argument we are currently
2011 /* An array whose size is the number of template parameters. The
2012 elements are non-zero if the parameter has been used in any one
2013 of the arguments processed so far. */
2016 /* An array whose size is the number of template arguments. The
2017 elements are non-zero if the argument makes use of template
2018 parameters of this level. */
2019 int* arg_uses_template_parms
;
2022 /* Subroutine of push_template_decl used to see if each template
2023 parameter in a partial specialization is used in the explicit
2024 argument list. If T is of the LEVEL given in DATA (which is
2025 treated as a template_parm_data*), then DATA->PARMS is marked
2029 mark_template_parm (t
, data
)
2035 struct template_parm_data
* tpd
= (struct template_parm_data
*) data
;
2037 if (TREE_CODE (t
) == TEMPLATE_PARM_INDEX
)
2039 level
= TEMPLATE_PARM_LEVEL (t
);
2040 idx
= TEMPLATE_PARM_IDX (t
);
2044 level
= TEMPLATE_TYPE_LEVEL (t
);
2045 idx
= TEMPLATE_TYPE_IDX (t
);
2048 if (level
== tpd
->level
)
2050 tpd
->parms
[idx
] = 1;
2051 tpd
->arg_uses_template_parms
[tpd
->current_arg
] = 1;
2054 /* Return zero so that for_each_template_parm will continue the
2055 traversal of the tree; we want to mark *every* template parm. */
2059 /* Process the partial specialization DECL. */
2062 process_partial_specialization (decl
)
2065 tree type
= TREE_TYPE (decl
);
2066 tree maintmpl
= CLASSTYPE_TI_TEMPLATE (type
);
2067 tree specargs
= CLASSTYPE_TI_ARGS (type
);
2068 tree inner_args
= INNERMOST_TEMPLATE_ARGS (specargs
);
2069 tree inner_parms
= INNERMOST_TEMPLATE_PARMS (current_template_parms
);
2070 tree main_inner_parms
= DECL_INNERMOST_TEMPLATE_PARMS (maintmpl
);
2071 int nargs
= TREE_VEC_LENGTH (inner_args
);
2072 int ntparms
= TREE_VEC_LENGTH (inner_parms
);
2074 int did_error_intro
= 0;
2075 struct template_parm_data tpd
;
2076 struct template_parm_data tpd2
;
2078 /* We check that each of the template parameters given in the
2079 partial specialization is used in the argument list to the
2080 specialization. For example:
2082 template <class T> struct S;
2083 template <class T> struct S<T*>;
2085 The second declaration is OK because `T*' uses the template
2086 parameter T, whereas
2088 template <class T> struct S<int>;
2090 is no good. Even trickier is:
2101 The S2<T> declaration is actually illegal; it is a
2102 full-specialization. Of course,
2105 struct S2<T (*)(U)>;
2107 or some such would have been OK. */
2108 tpd
.level
= TMPL_PARMS_DEPTH (current_template_parms
);
2109 tpd
.parms
= alloca (sizeof (int) * ntparms
);
2110 bzero ((PTR
) tpd
.parms
, sizeof (int) * ntparms
);
2112 tpd
.arg_uses_template_parms
= alloca (sizeof (int) * nargs
);
2113 bzero ((PTR
) tpd
.arg_uses_template_parms
, sizeof (int) * nargs
);
2114 for (i
= 0; i
< nargs
; ++i
)
2116 tpd
.current_arg
= i
;
2117 for_each_template_parm (TREE_VEC_ELT (inner_args
, i
),
2118 &mark_template_parm
,
2121 for (i
= 0; i
< ntparms
; ++i
)
2122 if (tpd
.parms
[i
] == 0)
2124 /* One of the template parms was not used in the
2126 if (!did_error_intro
)
2128 cp_error ("template parameters not used in partial specialization:");
2129 did_error_intro
= 1;
2133 TREE_VALUE (TREE_VEC_ELT (inner_parms
, i
)));
2136 /* [temp.class.spec]
2138 The argument list of the specialization shall not be identical to
2139 the implicit argument list of the primary template. */
2140 if (comp_template_args
2142 INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (TREE_TYPE
2144 cp_error ("partial specialization `%T' does not specialize any template arguments", type
);
2146 /* [temp.class.spec]
2148 A partially specialized non-type argument expression shall not
2149 involve template parameters of the partial specialization except
2150 when the argument expression is a simple identifier.
2152 The type of a template parameter corresponding to a specialized
2153 non-type argument shall not be dependent on a parameter of the
2155 my_friendly_assert (nargs
== DECL_NTPARMS (maintmpl
), 0);
2157 for (i
= 0; i
< nargs
; ++i
)
2159 tree arg
= TREE_VEC_ELT (inner_args
, i
);
2160 if (/* These first two lines are the `non-type' bit. */
2162 && TREE_CODE (arg
) != TEMPLATE_DECL
2163 /* This next line is the `argument expression is not just a
2164 simple identifier' condition and also the `specialized
2165 non-type argument' bit. */
2166 && TREE_CODE (arg
) != TEMPLATE_PARM_INDEX
)
2168 if (tpd
.arg_uses_template_parms
[i
])
2169 cp_error ("template argument `%E' involves template parameter(s)", arg
);
2172 /* Look at the corresponding template parameter,
2173 marking which template parameters its type depends
2176 TREE_TYPE (TREE_VALUE (TREE_VEC_ELT (main_inner_parms
,
2181 /* We haven't yet initialized TPD2. Do so now. */
2182 tpd2
.arg_uses_template_parms
2183 = (int*) alloca (sizeof (int) * nargs
);
2184 /* The number of parameters here is the number in the
2185 main template, which, as checked in the assertion
2187 tpd2
.parms
= (int*) alloca (sizeof (int) * nargs
);
2189 TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (maintmpl
));
2192 /* Mark the template parameters. But this time, we're
2193 looking for the template parameters of the main
2194 template, not in the specialization. */
2195 tpd2
.current_arg
= i
;
2196 tpd2
.arg_uses_template_parms
[i
] = 0;
2197 bzero ((PTR
) tpd2
.parms
, sizeof (int) * nargs
);
2198 for_each_template_parm (type
,
2199 &mark_template_parm
,
2202 if (tpd2
.arg_uses_template_parms
[i
])
2204 /* The type depended on some template parameters.
2205 If they are fully specialized in the
2206 specialization, that's OK. */
2208 for (j
= 0; j
< nargs
; ++j
)
2209 if (tpd2
.parms
[j
] != 0
2210 && tpd
.arg_uses_template_parms
[j
])
2212 cp_error ("type `%T' of template argument `%E' depends on template parameter(s)",
2222 if (retrieve_specialization (maintmpl
, specargs
))
2223 /* We've already got this specialization. */
2226 DECL_TEMPLATE_SPECIALIZATIONS (maintmpl
)
2227 = tree_cons (inner_args
, inner_parms
,
2228 DECL_TEMPLATE_SPECIALIZATIONS (maintmpl
));
2229 TREE_TYPE (DECL_TEMPLATE_SPECIALIZATIONS (maintmpl
)) = type
;
2233 /* Check that a template declaration's use of default arguments is not
2234 invalid. Here, PARMS are the template parameters. IS_PRIMARY is
2235 non-zero if DECL is the thing declared by a primary template.
2236 IS_PARTIAL is non-zero if DECL is a partial specialization. */
2239 check_default_tmpl_args (decl
, parms
, is_primary
, is_partial
)
2246 int last_level_to_check
;
2251 A default template-argument shall not be specified in a
2252 function template declaration or a function template definition, nor
2253 in the template-parameter-list of the definition of a member of a
2256 if (TREE_CODE (CP_DECL_CONTEXT (decl
)) == FUNCTION_DECL
)
2257 /* You can't have a function template declaration in a local
2258 scope, nor you can you define a member of a class template in a
2262 if (current_class_type
2263 && !TYPE_BEING_DEFINED (current_class_type
)
2264 && DECL_LANG_SPECIFIC (decl
)
2265 /* If this is either a friend defined in the scope of the class
2266 or a member function. */
2267 && ((DECL_CONTEXT (decl
)
2268 && same_type_p (DECL_CONTEXT (decl
), current_class_type
))
2269 || (DECL_FRIEND_CONTEXT (decl
)
2270 && same_type_p (DECL_FRIEND_CONTEXT (decl
),
2271 current_class_type
)))
2272 /* And, if it was a member function, it really was defined in
2273 the scope of the class. */
2274 && (!DECL_FUNCTION_MEMBER_P (decl
) || DECL_DEFINED_IN_CLASS_P (decl
)))
2275 /* We already checked these parameters when the template was
2276 declared, so there's no need to do it again now. This function
2277 was defined in class scope, but we're processing it's body now
2278 that the class is complete. */
2283 If a template-parameter has a default template-argument, all
2284 subsequent template-parameters shall have a default
2285 template-argument supplied. */
2286 for (parm_level
= parms
; parm_level
; parm_level
= TREE_CHAIN (parm_level
))
2288 tree inner_parms
= TREE_VALUE (parm_level
);
2289 int ntparms
= TREE_VEC_LENGTH (inner_parms
);
2290 int seen_def_arg_p
= 0;
2293 for (i
= 0; i
< ntparms
; ++i
)
2295 tree parm
= TREE_VEC_ELT (inner_parms
, i
);
2296 if (TREE_PURPOSE (parm
))
2298 else if (seen_def_arg_p
)
2300 cp_error ("no default argument for `%D'", TREE_VALUE (parm
));
2301 /* For better subsequent error-recovery, we indicate that
2302 there should have been a default argument. */
2303 TREE_PURPOSE (parm
) = error_mark_node
;
2308 if (TREE_CODE (decl
) != TYPE_DECL
|| is_partial
|| !is_primary
)
2309 /* For an ordinary class template, default template arguments are
2310 allowed at the innermost level, e.g.:
2311 template <class T = int>
2313 but, in a partial specialization, they're not allowed even
2314 there, as we have in [temp.class.spec]:
2316 The template parameter list of a specialization shall not
2317 contain default template argument values.
2319 So, for a partial specialization, or for a function template,
2320 we look at all of them. */
2323 /* But, for a primary class template that is not a partial
2324 specialization we look at all template parameters except the
2326 parms
= TREE_CHAIN (parms
);
2328 /* Figure out what error message to issue. */
2329 if (TREE_CODE (decl
) == FUNCTION_DECL
)
2330 msg
= "default argument for template parameter in function template `%D'";
2331 else if (is_partial
)
2332 msg
= "default argument in partial specialization `%D'";
2334 msg
= "default argument for template parameter for class enclosing `%D'";
2336 if (current_class_type
&& TYPE_BEING_DEFINED (current_class_type
))
2337 /* If we're inside a class definition, there's no need to
2338 examine the parameters to the class itself. On the one
2339 hand, they will be checked when the class is defined, and,
2340 on the other, default arguments are legal in things like:
2341 template <class T = double>
2342 struct S { template <class U> void f(U); };
2343 Here the default argument for `S' has no bearing on the
2344 declaration of `f'. */
2345 last_level_to_check
= template_class_depth (current_class_type
) + 1;
2347 /* Check everything. */
2348 last_level_to_check
= 0;
2350 for (parm_level
= parms
;
2351 parm_level
&& TMPL_PARMS_DEPTH (parm_level
) >= last_level_to_check
;
2352 parm_level
= TREE_CHAIN (parm_level
))
2354 tree inner_parms
= TREE_VALUE (parm_level
);
2358 ntparms
= TREE_VEC_LENGTH (inner_parms
);
2359 for (i
= 0; i
< ntparms
; ++i
)
2360 if (TREE_PURPOSE (TREE_VEC_ELT (inner_parms
, i
)))
2364 cp_error (msg
, decl
);
2368 /* Clear out the default argument so that we are not
2370 TREE_PURPOSE (TREE_VEC_ELT (inner_parms
, i
)) = NULL_TREE
;
2373 /* At this point, if we're still interested in issuing messages,
2374 they must apply to classes surrounding the object declared. */
2376 msg
= "default argument for template parameter for class enclosing `%D'";
2380 /* Creates a TEMPLATE_DECL for the indicated DECL using the template
2381 parameters given by current_template_args, or reuses a
2382 previously existing one, if appropriate. Returns the DECL, or an
2383 equivalent one, if it is replaced via a call to duplicate_decls.
2385 If IS_FRIEND is non-zero, DECL is a friend declaration. */
2388 push_template_decl_real (decl
, is_friend
)
2398 int new_template_p
= 0;
2400 /* See if this is a partial specialization. */
2401 is_partial
= (DECL_IMPLICIT_TYPEDEF_P (decl
)
2402 && TREE_CODE (TREE_TYPE (decl
)) != ENUMERAL_TYPE
2403 && CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_TYPE (decl
)));
2405 is_friend
|= (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_FRIEND_P (decl
));
2408 /* For a friend, we want the context of the friend function, not
2409 the type of which it is a friend. */
2410 ctx
= DECL_CONTEXT (decl
);
2411 else if (CP_DECL_CONTEXT (decl
)
2412 && TREE_CODE (CP_DECL_CONTEXT (decl
)) != NAMESPACE_DECL
)
2413 /* In the case of a virtual function, we want the class in which
2415 ctx
= CP_DECL_CONTEXT (decl
);
2417 /* Otherwise, if we're currently definining some class, the DECL
2418 is assumed to be a member of the class. */
2419 ctx
= current_scope ();
2421 if (ctx
&& TREE_CODE (ctx
) == NAMESPACE_DECL
)
2424 if (!DECL_CONTEXT (decl
))
2425 DECL_CONTEXT (decl
) = FROB_CONTEXT (current_namespace
);
2427 /* See if this is a primary template. */
2428 primary
= template_parm_scope_p ();
2432 if (current_lang_name
== lang_name_c
)
2433 cp_error ("template with C linkage");
2434 else if (TREE_CODE (decl
) == TYPE_DECL
2435 && ANON_AGGRNAME_P (DECL_NAME (decl
)))
2436 cp_error ("template class without a name");
2437 else if ((DECL_IMPLICIT_TYPEDEF_P (decl
)
2438 && CLASS_TYPE_P (TREE_TYPE (decl
)))
2439 || (TREE_CODE (decl
) == VAR_DECL
&& ctx
&& CLASS_TYPE_P (ctx
))
2440 || TREE_CODE (decl
) == FUNCTION_DECL
)
2443 cp_error ("template declaration of `%#D'", decl
);
2446 /* Check to see that the rules regarding the use of default
2447 arguments are not being violated. */
2448 check_default_tmpl_args (decl
, current_template_parms
,
2449 primary
, is_partial
);
2452 return process_partial_specialization (decl
);
2454 args
= current_template_args ();
2457 || TREE_CODE (ctx
) == FUNCTION_DECL
2458 || TYPE_BEING_DEFINED (ctx
)
2459 || (is_friend
&& !DECL_TEMPLATE_INFO (decl
)))
2461 if (DECL_LANG_SPECIFIC (decl
)
2462 && DECL_TEMPLATE_INFO (decl
)
2463 && DECL_TI_TEMPLATE (decl
))
2464 tmpl
= DECL_TI_TEMPLATE (decl
);
2465 /* If DECL is a TYPE_DECL for a class-template, then there won't
2466 be DECL_LANG_SPECIFIC. The information equivalent to
2467 DECL_TEMPLATE_INFO is found in TYPE_TEMPLATE_INFO instead. */
2468 else if (DECL_IMPLICIT_TYPEDEF_P (decl
)
2469 && TYPE_TEMPLATE_INFO (TREE_TYPE (decl
))
2470 && TYPE_TI_TEMPLATE (TREE_TYPE (decl
)))
2472 /* Since a template declaration already existed for this
2473 class-type, we must be redeclaring it here. Make sure
2474 that the redeclaration is legal. */
2475 redeclare_class_template (TREE_TYPE (decl
),
2476 current_template_parms
);
2477 /* We don't need to create a new TEMPLATE_DECL; just use the
2478 one we already had. */
2479 tmpl
= TYPE_TI_TEMPLATE (TREE_TYPE (decl
));
2483 tmpl
= build_template_decl (decl
, current_template_parms
);
2486 if (DECL_LANG_SPECIFIC (decl
)
2487 && DECL_TEMPLATE_SPECIALIZATION (decl
))
2489 /* A specialization of a member template of a template
2491 SET_DECL_TEMPLATE_SPECIALIZATION (tmpl
);
2492 DECL_TEMPLATE_INFO (tmpl
) = DECL_TEMPLATE_INFO (decl
);
2493 DECL_TEMPLATE_INFO (decl
) = NULL_TREE
;
2499 tree a
, t
, current
, parms
;
2502 if (TREE_CODE (decl
) == TYPE_DECL
)
2504 if ((IS_AGGR_TYPE_CODE (TREE_CODE (TREE_TYPE (decl
)))
2505 || TREE_CODE (TREE_TYPE (decl
)) == ENUMERAL_TYPE
)
2506 && TYPE_TEMPLATE_INFO (TREE_TYPE (decl
))
2507 && TYPE_TI_TEMPLATE (TREE_TYPE (decl
)))
2508 tmpl
= TYPE_TI_TEMPLATE (TREE_TYPE (decl
));
2511 cp_error ("`%D' does not declare a template type", decl
);
2515 else if (! DECL_TEMPLATE_INFO (decl
))
2517 cp_error ("template definition of non-template `%#D'", decl
);
2521 tmpl
= DECL_TI_TEMPLATE (decl
);
2523 if (is_member_template (tmpl
)
2524 && DECL_FUNCTION_TEMPLATE_P (tmpl
)
2525 && DECL_TEMPLATE_INFO (decl
) && DECL_TI_ARGS (decl
)
2526 && DECL_TEMPLATE_SPECIALIZATION (decl
))
2530 /* The declaration is a specialization of a member
2531 template, declared outside the class. Therefore, the
2532 innermost template arguments will be NULL, so we
2533 replace them with the arguments determined by the
2534 earlier call to check_explicit_specialization. */
2535 args
= DECL_TI_ARGS (decl
);
2538 = build_template_decl (decl
, current_template_parms
);
2539 DECL_TEMPLATE_RESULT (new_tmpl
) = decl
;
2540 TREE_TYPE (new_tmpl
) = TREE_TYPE (decl
);
2541 DECL_TI_TEMPLATE (decl
) = new_tmpl
;
2542 SET_DECL_TEMPLATE_SPECIALIZATION (new_tmpl
);
2543 DECL_TEMPLATE_INFO (new_tmpl
)
2544 = tree_cons (tmpl
, args
, NULL_TREE
);
2546 register_specialization (new_tmpl
,
2547 most_general_template (tmpl
),
2552 /* Make sure the template headers we got make sense. */
2554 parms
= DECL_TEMPLATE_PARMS (tmpl
);
2555 i
= TMPL_PARMS_DEPTH (parms
);
2556 if (TMPL_ARGS_DEPTH (args
) != i
)
2558 cp_error ("expected %d levels of template parms for `%#D', got %d",
2559 i
, decl
, TMPL_ARGS_DEPTH (args
));
2562 for (current
= decl
; i
> 0; --i
, parms
= TREE_CHAIN (parms
))
2564 a
= TMPL_ARGS_LEVEL (args
, i
);
2565 t
= INNERMOST_TEMPLATE_PARMS (parms
);
2567 if (TREE_VEC_LENGTH (t
) != TREE_VEC_LENGTH (a
))
2569 if (current
== decl
)
2570 cp_error ("got %d template parameters for `%#D'",
2571 TREE_VEC_LENGTH (a
), decl
);
2573 cp_error ("got %d template parameters for `%#T'",
2574 TREE_VEC_LENGTH (a
), current
);
2575 cp_error (" but %d required", TREE_VEC_LENGTH (t
));
2578 /* Perhaps we should also check that the parms are used in the
2579 appropriate qualifying scopes in the declarator? */
2581 if (current
== decl
)
2584 current
= TYPE_CONTEXT (current
);
2588 DECL_TEMPLATE_RESULT (tmpl
) = decl
;
2589 TREE_TYPE (tmpl
) = TREE_TYPE (decl
);
2591 /* Push template declarations for global functions and types. Note
2592 that we do not try to push a global template friend declared in a
2593 template class; such a thing may well depend on the template
2594 parameters of the class. */
2595 if (new_template_p
&& !ctx
2596 && !(is_friend
&& template_class_depth (current_class_type
) > 0))
2597 tmpl
= pushdecl_namespace_level (tmpl
);
2600 DECL_PRIMARY_TEMPLATE (tmpl
) = tmpl
;
2602 info
= tree_cons (tmpl
, args
, NULL_TREE
);
2604 if (DECL_IMPLICIT_TYPEDEF_P (decl
))
2606 SET_TYPE_TEMPLATE_INFO (TREE_TYPE (tmpl
), info
);
2607 if ((!ctx
|| TREE_CODE (ctx
) != FUNCTION_DECL
)
2608 && TREE_CODE (TREE_TYPE (decl
)) != ENUMERAL_TYPE
)
2609 DECL_NAME (decl
) = classtype_mangled_name (TREE_TYPE (decl
));
2611 else if (DECL_LANG_SPECIFIC (decl
))
2612 DECL_TEMPLATE_INFO (decl
) = info
;
2614 return DECL_TEMPLATE_RESULT (tmpl
);
2618 push_template_decl (decl
)
2621 return push_template_decl_real (decl
, 0);
2624 /* Called when a class template TYPE is redeclared with the indicated
2625 template PARMS, e.g.:
2627 template <class T> struct S;
2628 template <class T> struct S {}; */
2631 redeclare_class_template (type
, parms
)
2639 if (!TYPE_TEMPLATE_INFO (type
))
2641 cp_error ("`%T' is not a template type", type
);
2645 tmpl
= TYPE_TI_TEMPLATE (type
);
2646 if (!PRIMARY_TEMPLATE_P (tmpl
))
2647 /* The type is nested in some template class. Nothing to worry
2648 about here; there are no new template parameters for the nested
2652 parms
= INNERMOST_TEMPLATE_PARMS (parms
);
2653 tmpl_parms
= DECL_INNERMOST_TEMPLATE_PARMS (tmpl
);
2655 if (TREE_VEC_LENGTH (parms
) != TREE_VEC_LENGTH (tmpl_parms
))
2657 cp_error_at ("previous declaration `%D'", tmpl
);
2658 cp_error ("used %d template parameter%s instead of %d",
2659 TREE_VEC_LENGTH (tmpl_parms
),
2660 TREE_VEC_LENGTH (tmpl_parms
) == 1 ? "" : "s",
2661 TREE_VEC_LENGTH (parms
));
2665 for (i
= 0; i
< TREE_VEC_LENGTH (tmpl_parms
); ++i
)
2667 tree tmpl_parm
= TREE_VALUE (TREE_VEC_ELT (tmpl_parms
, i
));
2668 tree parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
2669 tree tmpl_default
= TREE_PURPOSE (TREE_VEC_ELT (tmpl_parms
, i
));
2670 tree parm_default
= TREE_PURPOSE (TREE_VEC_ELT (parms
, i
));
2672 if (TREE_CODE (tmpl_parm
) != TREE_CODE (parm
))
2674 cp_error_at ("template parameter `%#D'", tmpl_parm
);
2675 cp_error ("redeclared here as `%#D'", parm
);
2679 if (tmpl_default
!= NULL_TREE
&& parm_default
!= NULL_TREE
)
2681 /* We have in [temp.param]:
2683 A template-parameter may not be given default arguments
2684 by two different declarations in the same scope. */
2685 cp_error ("redefinition of default argument for `%#D'", parm
);
2686 cp_error_at (" original definition appeared here", tmpl_parm
);
2690 if (parm_default
!= NULL_TREE
)
2691 /* Update the previous template parameters (which are the ones
2692 that will really count) with the new default value. */
2693 TREE_PURPOSE (TREE_VEC_ELT (tmpl_parms
, i
)) = parm_default
;
2694 else if (tmpl_default
!= NULL_TREE
)
2695 /* Update the new parameters, too; they'll be used as the
2696 parameters for any members. */
2697 TREE_PURPOSE (TREE_VEC_ELT (parms
, i
)) = tmpl_default
;
2701 /* Attempt to convert the non-type template parameter EXPR to the
2702 indicated TYPE. If the conversion is successful, return the
2703 converted value. If the conversion is unsuccesful, return
2704 NULL_TREE if we issued an error message, or error_mark_node if we
2705 did not. We issue error messages for out-and-out bad template
2706 parameters, but not simply because the conversion failed, since we
2707 might be just trying to do argument deduction. By the time this
2708 function is called, neither TYPE nor EXPR may make use of template
2712 convert_nontype_argument (type
, expr
)
2716 tree expr_type
= TREE_TYPE (expr
);
2718 /* A template-argument for a non-type, non-template
2719 template-parameter shall be one of:
2721 --an integral constant-expression of integral or enumeration
2724 --the name of a non-type template-parameter; or
2726 --the name of an object or function with external linkage,
2727 including function templates and function template-ids but
2728 excluding non-static class members, expressed as id-expression;
2731 --the address of an object or function with external linkage,
2732 including function templates and function template-ids but
2733 excluding non-static class members, expressed as & id-expression
2734 where the & is optional if the name refers to a function or
2737 --a pointer to member expressed as described in _expr.unary.op_. */
2739 /* An integral constant-expression can include const variables or
2740 enumerators. Simplify things by folding them to their values,
2741 unless we're about to bind the declaration to a reference
2743 if (INTEGRAL_TYPE_P (expr_type
)
2744 && TREE_CODE (type
) != REFERENCE_TYPE
)
2745 expr
= decl_constant_value (expr
);
2747 if (is_overloaded_fn (expr
))
2748 /* OK for now. We'll check that it has external linkage later.
2749 Check this first since if expr_type is the unknown_type_node
2750 we would otherwise complain below. */
2752 else if (TYPE_PTRMEM_P (expr_type
)
2753 || TYPE_PTRMEMFUNC_P (expr_type
))
2755 if (TREE_CODE (expr
) != PTRMEM_CST
)
2758 else if (TYPE_PTR_P (expr_type
)
2759 || TYPE_PTRMEM_P (expr_type
)
2760 || TREE_CODE (expr_type
) == ARRAY_TYPE
2761 || TREE_CODE (type
) == REFERENCE_TYPE
2762 /* If expr is the address of an overloaded function, we
2763 will get the unknown_type_node at this point. */
2764 || expr_type
== unknown_type_node
)
2770 if (TREE_CODE (expr_type
) == ARRAY_TYPE
2771 || (TREE_CODE (type
) == REFERENCE_TYPE
2772 && TREE_CODE (e
) != ADDR_EXPR
))
2776 if (TREE_CODE (e
) != ADDR_EXPR
)
2779 cp_error ("`%E' is not a valid template argument", expr
);
2780 if (TYPE_PTR_P (expr_type
))
2782 if (TREE_CODE (TREE_TYPE (expr_type
)) == FUNCTION_TYPE
)
2783 cp_error ("it must be the address of a function with external linkage");
2785 cp_error ("it must be the address of an object with external linkage");
2787 else if (TYPE_PTRMEM_P (expr_type
)
2788 || TYPE_PTRMEMFUNC_P (expr_type
))
2789 cp_error ("it must be a pointer-to-member of the form `&X::Y'");
2794 referent
= TREE_OPERAND (e
, 0);
2795 STRIP_NOPS (referent
);
2798 if (TREE_CODE (referent
) == STRING_CST
)
2800 cp_error ("string literal %E is not a valid template argument because it is the address of an object with static linkage",
2805 if (is_overloaded_fn (referent
))
2806 /* We'll check that it has external linkage later. */
2808 else if (TREE_CODE (referent
) != VAR_DECL
)
2810 else if (!TREE_PUBLIC (referent
))
2812 cp_error ("address of non-extern `%E' cannot be used as template argument", referent
);
2813 return error_mark_node
;
2816 else if (INTEGRAL_TYPE_P (expr_type
)
2817 || TYPE_PTRMEM_P (expr_type
)
2818 || TYPE_PTRMEMFUNC_P (expr_type
)
2819 /* The next two are g++ extensions. */
2820 || TREE_CODE (expr_type
) == REAL_TYPE
2821 || TREE_CODE (expr_type
) == COMPLEX_TYPE
)
2823 if (! TREE_CONSTANT (expr
))
2826 cp_error ("non-constant `%E' cannot be used as template argument",
2833 cp_error ("object `%E' cannot be used as template argument", expr
);
2837 switch (TREE_CODE (type
))
2842 /* For a non-type template-parameter of integral or enumeration
2843 type, integral promotions (_conv.prom_) and integral
2844 conversions (_conv.integral_) are applied. */
2845 if (!INTEGRAL_TYPE_P (expr_type
))
2846 return error_mark_node
;
2848 /* It's safe to call digest_init in this case; we know we're
2849 just converting one integral constant expression to another. */
2850 expr
= digest_init (type
, expr
, (tree
*) 0);
2852 if (TREE_CODE (expr
) != INTEGER_CST
)
2853 /* Curiously, some TREE_CONSTANT integral expressions do not
2854 simplify to integer constants. For example, `3 % 0',
2855 remains a TRUNC_MOD_EXPR. */
2862 /* These are g++ extensions. */
2863 if (TREE_CODE (expr_type
) != TREE_CODE (type
))
2864 return error_mark_node
;
2866 expr
= digest_init (type
, expr
, (tree
*) 0);
2868 if (TREE_CODE (expr
) != REAL_CST
)
2875 tree type_pointed_to
= TREE_TYPE (type
);
2877 if (TYPE_PTRMEM_P (type
))
2881 /* For a non-type template-parameter of type pointer to data
2882 member, qualification conversions (_conv.qual_) are
2884 e
= perform_qualification_conversions (type
, expr
);
2885 if (TREE_CODE (e
) == NOP_EXPR
)
2886 /* The call to perform_qualification_conversions will
2887 insert a NOP_EXPR over EXPR to do express conversion,
2888 if necessary. But, that will confuse us if we use
2889 this (converted) template parameter to instantiate
2890 another template; then the thing will not look like a
2891 valid template argument. So, just make a new
2892 constant, of the appropriate type. */
2893 e
= make_ptrmem_cst (type
, PTRMEM_CST_MEMBER (expr
));
2896 else if (TREE_CODE (type_pointed_to
) == FUNCTION_TYPE
)
2898 /* For a non-type template-parameter of type pointer to
2899 function, only the function-to-pointer conversion
2900 (_conv.func_) is applied. If the template-argument
2901 represents a set of overloaded functions (or a pointer to
2902 such), the matching function is selected from the set
2907 if (TREE_CODE (expr
) == ADDR_EXPR
)
2908 fns
= TREE_OPERAND (expr
, 0);
2912 fn
= instantiate_type (type_pointed_to
, fns
, itf_none
);
2914 if (fn
== error_mark_node
)
2915 return error_mark_node
;
2917 if (!TREE_PUBLIC (fn
))
2919 if (really_overloaded_fn (fns
))
2920 return error_mark_node
;
2925 expr
= build_unary_op (ADDR_EXPR
, fn
, 0);
2927 my_friendly_assert (same_type_p (type
, TREE_TYPE (expr
)),
2933 /* For a non-type template-parameter of type pointer to
2934 object, qualification conversions (_conv.qual_) and the
2935 array-to-pointer conversion (_conv.array_) are applied.
2936 [Note: In particular, neither the null pointer conversion
2937 (_conv.ptr_) nor the derived-to-base conversion
2938 (_conv.ptr_) are applied. Although 0 is a valid
2939 template-argument for a non-type template-parameter of
2940 integral type, it is not a valid template-argument for a
2941 non-type template-parameter of pointer type.]
2943 The call to decay_conversion performs the
2944 array-to-pointer conversion, if appropriate. */
2945 expr
= decay_conversion (expr
);
2947 if (expr
== error_mark_node
)
2948 return error_mark_node
;
2950 return perform_qualification_conversions (type
, expr
);
2955 case REFERENCE_TYPE
:
2957 tree type_referred_to
= TREE_TYPE (type
);
2959 /* If this expression already has reference type, get the
2960 underling object. */
2961 if (TREE_CODE (expr_type
) == REFERENCE_TYPE
)
2963 my_friendly_assert (TREE_CODE (expr
) == ADDR_EXPR
, 20000604);
2964 expr
= TREE_OPERAND (expr
, 0);
2965 expr_type
= TREE_TYPE (expr
);
2968 if (TREE_CODE (type_referred_to
) == FUNCTION_TYPE
)
2970 /* For a non-type template-parameter of type reference to
2971 function, no conversions apply. If the
2972 template-argument represents a set of overloaded
2973 functions, the matching function is selected from the
2974 set (_over.over_). */
2977 fn
= instantiate_type (type_referred_to
, expr
, itf_none
);
2979 if (fn
== error_mark_node
)
2980 return error_mark_node
;
2982 if (!TREE_PUBLIC (fn
))
2984 if (really_overloaded_fn (expr
))
2985 /* Don't issue an error here; we might get a different
2986 function if the overloading had worked out
2988 return error_mark_node
;
2993 my_friendly_assert (same_type_p (type_referred_to
,
3001 /* For a non-type template-parameter of type reference to
3002 object, no conversions apply. The type referred to by the
3003 reference may be more cv-qualified than the (otherwise
3004 identical) type of the template-argument. The
3005 template-parameter is bound directly to the
3006 template-argument, which must be an lvalue. */
3007 if (!same_type_p (TYPE_MAIN_VARIANT (expr_type
),
3008 TYPE_MAIN_VARIANT (type_referred_to
))
3009 || !at_least_as_qualified_p (type_referred_to
,
3011 || !real_lvalue_p (expr
))
3012 return error_mark_node
;
3015 mark_addressable (expr
);
3016 return build1 (ADDR_EXPR
, type
, expr
);
3022 if (!TYPE_PTRMEMFUNC_P (type
))
3023 /* This handles templates like
3024 template<class T, T t> void f();
3025 when T is substituted with any class. The second template
3026 parameter becomes invalid and the template candidate is
3028 return error_mark_node
;
3030 /* For a non-type template-parameter of type pointer to member
3031 function, no conversions apply. If the template-argument
3032 represents a set of overloaded member functions, the
3033 matching member function is selected from the set
3036 if (!TYPE_PTRMEMFUNC_P (expr_type
) &&
3037 expr_type
!= unknown_type_node
)
3038 return error_mark_node
;
3040 if (TREE_CODE (expr
) == PTRMEM_CST
)
3042 /* A ptr-to-member constant. */
3043 if (!same_type_p (type
, expr_type
))
3044 return error_mark_node
;
3049 if (TREE_CODE (expr
) != ADDR_EXPR
)
3050 return error_mark_node
;
3052 expr
= instantiate_type (type
, expr
, itf_none
);
3054 if (expr
== error_mark_node
)
3055 return error_mark_node
;
3057 my_friendly_assert (same_type_p (type
, TREE_TYPE (expr
)),
3064 /* All non-type parameters must have one of these types. */
3065 my_friendly_abort (0);
3069 return error_mark_node
;
3072 /* Return 1 if PARM_PARMS and ARG_PARMS matches using rule for
3073 template template parameters. Both PARM_PARMS and ARG_PARMS are
3074 vectors of TREE_LIST nodes containing TYPE_DECL, TEMPLATE_DECL
3077 ARG_PARMS may contain more parameters than PARM_PARMS. If this is
3078 the case, then extra parameters must have default arguments.
3080 Consider the example:
3081 template <class T, class Allocator = allocator> class vector;
3082 template<template <class U> class TT> class C;
3084 C<vector> is a valid instantiation. PARM_PARMS for the above code
3085 contains a TYPE_DECL (for U), ARG_PARMS contains two TYPE_DECLs (for
3086 T and Allocator) and OUTER_ARGS contains the argument that is used to
3087 substitute the TT parameter. */
3090 coerce_template_template_parms (parm_parms
, arg_parms
, complain
,
3091 in_decl
, outer_args
)
3092 tree parm_parms
, arg_parms
;
3094 tree in_decl
, outer_args
;
3096 int nparms
, nargs
, i
;
3099 my_friendly_assert (TREE_CODE (parm_parms
) == TREE_VEC
, 0);
3100 my_friendly_assert (TREE_CODE (arg_parms
) == TREE_VEC
, 0);
3102 nparms
= TREE_VEC_LENGTH (parm_parms
);
3103 nargs
= TREE_VEC_LENGTH (arg_parms
);
3105 /* The rule here is opposite of coerce_template_parms. */
3108 && TREE_PURPOSE (TREE_VEC_ELT (arg_parms
, nparms
)) == NULL_TREE
))
3111 for (i
= 0; i
< nparms
; ++i
)
3113 parm
= TREE_VALUE (TREE_VEC_ELT (parm_parms
, i
));
3114 arg
= TREE_VALUE (TREE_VEC_ELT (arg_parms
, i
));
3116 if (arg
== NULL_TREE
|| arg
== error_mark_node
3117 || parm
== NULL_TREE
|| parm
== error_mark_node
)
3120 if (TREE_CODE (arg
) != TREE_CODE (parm
))
3123 switch (TREE_CODE (parm
))
3129 /* We encounter instantiations of templates like
3130 template <template <template <class> class> class TT>
3133 tree parmparm
= DECL_INNERMOST_TEMPLATE_PARMS (parm
);
3134 tree argparm
= DECL_INNERMOST_TEMPLATE_PARMS (arg
);
3136 if (!coerce_template_template_parms (parmparm
, argparm
,
3144 /* The tsubst call is used to handle cases such as
3145 template <class T, template <T> class TT> class D;
3146 i.e. the parameter list of TT depends on earlier parameters. */
3147 if (!same_type_p (tsubst (TREE_TYPE (parm
), outer_args
,
3154 my_friendly_abort (0);
3160 /* Convert the indicated template ARG as necessary to match the
3161 indicated template PARM. Returns the converted ARG, or
3162 error_mark_node if the conversion was unsuccessful. Error messages
3163 are issued if COMPLAIN is non-zero. This conversion is for the Ith
3164 parameter in the parameter list. ARGS is the full set of template
3165 arguments deduced so far. */
3168 convert_template_argument (parm
, arg
, args
, complain
, i
, in_decl
)
3178 int is_type
, requires_type
, is_tmpl_type
, requires_tmpl_type
;
3180 inner_args
= INNERMOST_TEMPLATE_ARGS (args
);
3182 if (TREE_CODE (arg
) == TREE_LIST
3183 && TREE_TYPE (arg
) != NULL_TREE
3184 && TREE_CODE (TREE_TYPE (arg
)) == OFFSET_TYPE
)
3186 /* The template argument was the name of some
3187 member function. That's usually
3188 illegal, but static members are OK. In any
3189 case, grab the underlying fields/functions
3190 and issue an error later if required. */
3191 arg
= TREE_VALUE (arg
);
3192 TREE_TYPE (arg
) = unknown_type_node
;
3195 requires_tmpl_type
= TREE_CODE (parm
) == TEMPLATE_DECL
;
3196 requires_type
= (TREE_CODE (parm
) == TYPE_DECL
3197 || requires_tmpl_type
);
3199 /* Check if it is a class template. If REQUIRES_TMPL_TYPE is true,
3200 we also accept implicitly created TYPE_DECL as a valid argument.
3201 This is necessary to handle the case where we pass a template name
3202 to a template template parameter in a scope where we've derived from
3203 in instantiation of that template, so the template name refers to that
3204 instantiation. We really ought to handle this better. */
3206 = ((TREE_CODE (arg
) == TEMPLATE_DECL
3207 && TREE_CODE (DECL_TEMPLATE_RESULT (arg
)) == TYPE_DECL
)
3208 || TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
3209 || (TREE_CODE (arg
) == RECORD_TYPE
3210 && CLASSTYPE_TEMPLATE_INFO (arg
)
3211 && TREE_CODE (TYPE_NAME (arg
)) == TYPE_DECL
3212 && DECL_ARTIFICIAL (TYPE_NAME (arg
))
3213 && requires_tmpl_type
3214 && is_base_of_enclosing_class (arg
, current_class_type
)));
3215 if (is_tmpl_type
&& TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
)
3216 arg
= TYPE_STUB_DECL (arg
);
3217 else if (is_tmpl_type
&& TREE_CODE (arg
) == RECORD_TYPE
)
3218 arg
= CLASSTYPE_TI_TEMPLATE (arg
);
3220 is_type
= TYPE_P (arg
) || is_tmpl_type
;
3222 if (requires_type
&& ! is_type
&& TREE_CODE (arg
) == SCOPE_REF
3223 && TREE_CODE (TREE_OPERAND (arg
, 0)) == TEMPLATE_TYPE_PARM
)
3225 cp_pedwarn ("to refer to a type member of a template parameter, use `typename %E'", arg
);
3227 arg
= make_typename_type (TREE_OPERAND (arg
, 0),
3228 TREE_OPERAND (arg
, 1),
3232 if (is_type
!= requires_type
)
3238 cp_error ("type/value mismatch at argument %d in template parameter list for `%D'",
3241 cp_error (" expected a constant of type `%T', got `%T'",
3243 (is_tmpl_type
? DECL_NAME (arg
) : arg
));
3245 cp_error (" expected a type, got `%E'", arg
);
3248 return error_mark_node
;
3250 if (is_tmpl_type
^ requires_tmpl_type
)
3252 if (in_decl
&& complain
)
3254 cp_error ("type/value mismatch at argument %d in template parameter list for `%D'",
3257 cp_error (" expected a type, got `%T'", DECL_NAME (arg
));
3259 cp_error (" expected a class template, got `%T'", arg
);
3261 return error_mark_node
;
3266 if (requires_tmpl_type
)
3268 tree parmparm
= DECL_INNERMOST_TEMPLATE_PARMS (parm
);
3269 tree argparm
= DECL_INNERMOST_TEMPLATE_PARMS (arg
);
3271 if (coerce_template_template_parms (parmparm
, argparm
, complain
,
3272 in_decl
, inner_args
))
3276 /* TEMPLATE_TEMPLATE_PARM node is preferred over
3278 if (val
!= error_mark_node
3279 && DECL_TEMPLATE_TEMPLATE_PARM_P (val
))
3280 val
= TREE_TYPE (val
);
3284 if (in_decl
&& complain
)
3286 cp_error ("type/value mismatch at argument %d in template parameter list for `%D'",
3288 cp_error (" expected a template of type `%D', got `%D'", parm
, arg
);
3291 val
= error_mark_node
;
3296 val
= groktypename (arg
);
3297 if (! processing_template_decl
)
3299 /* [basic.link]: A name with no linkage (notably, the
3300 name of a class or enumeration declared in a local
3301 scope) shall not be used to declare an entity with
3302 linkage. This implies that names with no linkage
3303 cannot be used as template arguments. */
3304 tree t
= no_linkage_check (val
);
3307 if (ANON_AGGRNAME_P (TYPE_IDENTIFIER (t
)))
3309 ("template-argument `%T' uses anonymous type", val
);
3312 ("template-argument `%T' uses local type `%T'",
3314 return error_mark_node
;
3321 tree t
= tsubst (TREE_TYPE (parm
), args
, complain
, in_decl
);
3323 if (processing_template_decl
)
3324 arg
= maybe_fold_nontype_arg (arg
);
3326 if (!uses_template_parms (arg
) && !uses_template_parms (t
))
3327 /* We used to call digest_init here. However, digest_init
3328 will report errors, which we don't want when complain
3329 is zero. More importantly, digest_init will try too
3330 hard to convert things: for example, `0' should not be
3331 converted to pointer type at this point according to
3332 the standard. Accepting this is not merely an
3333 extension, since deciding whether or not these
3334 conversions can occur is part of determining which
3335 function template to call, or whether a given epxlicit
3336 argument specification is legal. */
3337 val
= convert_nontype_argument (t
, arg
);
3341 if (val
== NULL_TREE
)
3342 val
= error_mark_node
;
3343 else if (val
== error_mark_node
&& complain
)
3344 cp_error ("could not convert template argument `%E' to `%T'",
3351 /* Convert all template arguments to their appropriate types, and
3352 return a vector containing the innermost resulting template
3353 arguments. If any error occurs, return error_mark_node, and, if
3354 COMPLAIN is non-zero, issue an error message. Some error messages
3355 are issued even if COMPLAIN is zero; for instance, if a template
3356 argument is composed from a local class.
3358 If REQUIRE_ALL_ARGUMENTS is non-zero, all arguments must be
3359 provided in ARGLIST, or else trailing parameters must have default
3360 values. If REQUIRE_ALL_ARGUMENTS is zero, we will attempt argument
3361 deduction for any unspecified trailing arguments. */
3364 coerce_template_parms (parms
, args
, in_decl
,
3366 require_all_arguments
)
3370 int require_all_arguments
;
3372 int nparms
, nargs
, i
, lost
= 0;
3375 tree new_inner_args
;
3377 inner_args
= INNERMOST_TEMPLATE_ARGS (args
);
3378 nargs
= NUM_TMPL_ARGS (inner_args
);
3379 nparms
= TREE_VEC_LENGTH (parms
);
3383 && require_all_arguments
3384 && TREE_PURPOSE (TREE_VEC_ELT (parms
, nargs
)) == NULL_TREE
))
3388 cp_error ("wrong number of template arguments (%d, should be %d)",
3392 cp_error_at ("provided for `%D'", in_decl
);
3395 return error_mark_node
;
3398 new_inner_args
= make_tree_vec (nparms
);
3399 new_args
= add_outermost_template_args (args
, new_inner_args
);
3400 for (i
= 0; i
< nparms
; i
++)
3405 /* Get the Ith template parameter. */
3406 parm
= TREE_VEC_ELT (parms
, i
);
3408 /* Calculate the Ith argument. */
3409 if (inner_args
&& TREE_CODE (inner_args
) == TREE_LIST
)
3411 arg
= TREE_VALUE (inner_args
);
3412 inner_args
= TREE_CHAIN (inner_args
);
3415 arg
= TREE_VEC_ELT (inner_args
, i
);
3416 /* If no template argument was supplied, look for a default
3418 else if (TREE_PURPOSE (parm
) == NULL_TREE
)
3420 /* There was no default value. */
3421 my_friendly_assert (!require_all_arguments
, 0);
3424 else if (TREE_CODE (TREE_VALUE (parm
)) == TYPE_DECL
)
3425 arg
= tsubst (TREE_PURPOSE (parm
), new_args
, complain
, in_decl
);
3427 arg
= tsubst_expr (TREE_PURPOSE (parm
), new_args
, complain
,
3430 /* Now, convert the Ith argument, as necessary. */
3431 if (arg
== NULL_TREE
)
3432 /* We're out of arguments. */
3434 my_friendly_assert (!require_all_arguments
, 0);
3437 else if (arg
== error_mark_node
)
3439 cp_error ("template argument %d is invalid", i
+ 1);
3440 arg
= error_mark_node
;
3443 arg
= convert_template_argument (TREE_VALUE (parm
),
3444 arg
, new_args
, complain
, i
,
3447 if (arg
== error_mark_node
)
3449 TREE_VEC_ELT (new_inner_args
, i
) = arg
;
3453 return error_mark_node
;
3455 return new_inner_args
;
3458 /* Returns 1 if template args OT and NT are equivalent. */
3461 template_args_equal (ot
, nt
)
3466 if (TREE_CODE (nt
) != TREE_CODE (ot
))
3468 if (TREE_CODE (nt
) == TREE_VEC
)
3469 /* For member templates */
3470 return comp_template_args (ot
, nt
);
3471 else if (TYPE_P (ot
))
3472 return same_type_p (ot
, nt
);
3474 return (cp_tree_equal (ot
, nt
) > 0);
3477 /* Returns 1 iff the OLDARGS and NEWARGS are in fact identical sets
3478 of template arguments. Returns 0 otherwise. */
3481 comp_template_args (oldargs
, newargs
)
3482 tree oldargs
, newargs
;
3486 if (TREE_VEC_LENGTH (oldargs
) != TREE_VEC_LENGTH (newargs
))
3489 for (i
= 0; i
< TREE_VEC_LENGTH (oldargs
); ++i
)
3491 tree nt
= TREE_VEC_ELT (newargs
, i
);
3492 tree ot
= TREE_VEC_ELT (oldargs
, i
);
3494 if (! template_args_equal (ot
, nt
))
3500 /* Given class template name and parameter list, produce a user-friendly name
3501 for the instantiation. */
3504 mangle_class_name_for_template (name
, parms
, arglist
)
3506 tree parms
, arglist
;
3508 static struct obstack scratch_obstack
;
3509 static char *scratch_firstobj
;
3512 if (!scratch_firstobj
)
3513 gcc_obstack_init (&scratch_obstack
);
3515 obstack_free (&scratch_obstack
, scratch_firstobj
);
3516 scratch_firstobj
= obstack_alloc (&scratch_obstack
, 1);
3518 #define ccat(c) obstack_1grow (&scratch_obstack, (c));
3519 #define cat(s) obstack_grow (&scratch_obstack, (s), strlen (s))
3523 nparms
= TREE_VEC_LENGTH (parms
);
3524 arglist
= INNERMOST_TEMPLATE_ARGS (arglist
);
3525 my_friendly_assert (nparms
== TREE_VEC_LENGTH (arglist
), 268);
3526 for (i
= 0; i
< nparms
; i
++)
3528 tree parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
3529 tree arg
= TREE_VEC_ELT (arglist
, i
);
3534 if (TREE_CODE (parm
) == TYPE_DECL
)
3536 cat (type_as_string (arg
, TS_CHASE_TYPEDEFS
));
3539 else if (TREE_CODE (parm
) == TEMPLATE_DECL
)
3541 if (TREE_CODE (arg
) == TEMPLATE_DECL
)
3543 /* Already substituted with real template. Just output
3544 the template name here */
3545 tree context
= DECL_CONTEXT (arg
);
3548 /* The template may be defined in a namespace, or
3549 may be a member template. */
3550 my_friendly_assert (TREE_CODE (context
) == NAMESPACE_DECL
3551 || CLASS_TYPE_P (context
),
3553 cat(decl_as_string (DECL_CONTEXT (arg
), 0));
3556 cat (IDENTIFIER_POINTER (DECL_NAME (arg
)));
3559 /* Output the parameter declaration */
3560 cat (type_as_string (arg
, TS_CHASE_TYPEDEFS
));
3564 my_friendly_assert (TREE_CODE (parm
) == PARM_DECL
, 269);
3566 if (TREE_CODE (arg
) == TREE_LIST
)
3568 /* New list cell was built because old chain link was in
3570 my_friendly_assert (TREE_PURPOSE (arg
) == NULL_TREE
, 270);
3571 arg
= TREE_VALUE (arg
);
3573 /* No need to check arglist against parmlist here; we did that
3574 in coerce_template_parms, called from lookup_template_class. */
3575 cat (expr_as_string (arg
, 0));
3578 char *bufp
= obstack_next_free (&scratch_obstack
);
3580 while (bufp
[offset
- 1] == ' ')
3582 obstack_blank_fast (&scratch_obstack
, offset
);
3584 /* B<C<char> >, not B<C<char>> */
3585 if (bufp
[offset
- 1] == '>')
3590 return (char *) obstack_base (&scratch_obstack
);
3594 classtype_mangled_name (t
)
3597 if (CLASSTYPE_TEMPLATE_INFO (t
)
3598 /* Specializations have already had their names set up in
3599 lookup_template_class. */
3600 && !CLASSTYPE_TEMPLATE_SPECIALIZATION (t
))
3602 tree tmpl
= most_general_template (CLASSTYPE_TI_TEMPLATE (t
));
3604 /* For non-primary templates, the template parameters are
3605 implicit from their surrounding context. */
3606 if (PRIMARY_TEMPLATE_P (tmpl
))
3608 tree name
= DECL_NAME (tmpl
);
3609 char *mangled_name
= mangle_class_name_for_template
3610 (IDENTIFIER_POINTER (name
),
3611 DECL_INNERMOST_TEMPLATE_PARMS (tmpl
),
3612 CLASSTYPE_TI_ARGS (t
));
3613 tree id
= get_identifier (mangled_name
);
3614 IDENTIFIER_TEMPLATE (id
) = name
;
3619 return TYPE_IDENTIFIER (t
);
3623 add_pending_template (d
)
3626 tree ti
= (TYPE_P (d
)
3627 ? CLASSTYPE_TEMPLATE_INFO (d
)
3628 : DECL_TEMPLATE_INFO (d
));
3631 if (TI_PENDING_TEMPLATE_FLAG (ti
))
3634 /* We are called both from instantiate_decl, where we've already had a
3635 tinst_level pushed, and instantiate_template, where we haven't.
3637 level
= !(current_tinst_level
&& TINST_DECL (current_tinst_level
) == d
);
3640 push_tinst_level (d
);
3642 *template_tail
= tree_cons (current_tinst_level
, d
, NULL_TREE
);
3643 template_tail
= &TREE_CHAIN (*template_tail
);
3644 TI_PENDING_TEMPLATE_FLAG (ti
) = 1;
3651 /* Return a TEMPLATE_ID_EXPR corresponding to the indicated FNS (which
3652 may be either a _DECL or an overloaded function or an
3653 IDENTIFIER_NODE), and ARGLIST. */
3656 lookup_template_function (fns
, arglist
)
3661 if (fns
== NULL_TREE
)
3663 cp_error ("non-template used as template");
3664 return error_mark_node
;
3667 type
= TREE_TYPE (fns
);
3668 if (TREE_CODE (fns
) == OVERLOAD
|| !type
)
3669 type
= unknown_type_node
;
3671 if (processing_template_decl
)
3672 return build_min (TEMPLATE_ID_EXPR
, type
, fns
, arglist
);
3674 return build (TEMPLATE_ID_EXPR
, type
, fns
, arglist
);
3677 /* Within the scope of a template class S<T>, the name S gets bound
3678 (in build_self_reference) to a TYPE_DECL for the class, not a
3679 TEMPLATE_DECL. If DECL is a TYPE_DECL for current_class_type,
3680 or one of its enclosing classes, and that type is a template,
3681 return the associated TEMPLATE_DECL. Otherwise, the original
3682 DECL is returned. */
3685 maybe_get_template_decl_from_type_decl (decl
)
3688 return (decl
!= NULL_TREE
3689 && TREE_CODE (decl
) == TYPE_DECL
3690 && DECL_ARTIFICIAL (decl
)
3691 && CLASS_TYPE_P (TREE_TYPE (decl
))
3692 && CLASSTYPE_TEMPLATE_INFO (TREE_TYPE (decl
)))
3693 ? CLASSTYPE_TI_TEMPLATE (TREE_TYPE (decl
)) : decl
;
3696 /* Given an IDENTIFIER_NODE (type TEMPLATE_DECL) and a chain of
3697 parameters, find the desired type.
3699 D1 is the PTYPENAME terminal, and ARGLIST is the list of arguments.
3700 (Actually ARGLIST may be either a TREE_LIST or a TREE_VEC. It will
3701 be a TREE_LIST if called directly from the parser, and a TREE_VEC
3702 otherwise.) Since ARGLIST is build on the temp_decl_obstack, we must
3703 copy it here to keep it from being reclaimed when the decl storage
3706 IN_DECL, if non-NULL, is the template declaration we are trying to
3709 If ENTERING_SCOPE is non-zero, we are about to enter the scope of
3710 the class we are looking up.
3712 If the template class is really a local class in a template
3713 function, then the FUNCTION_CONTEXT is the function in which it is
3714 being instantiated. */
3717 lookup_template_class (d1
, arglist
, in_decl
, context
, entering_scope
)
3723 tree
template = NULL_TREE
, parmlist
;
3726 if (TREE_CODE (d1
) == IDENTIFIER_NODE
)
3728 if (IDENTIFIER_VALUE (d1
)
3729 && DECL_TEMPLATE_TEMPLATE_PARM_P (IDENTIFIER_VALUE (d1
)))
3730 template = IDENTIFIER_VALUE (d1
);
3734 push_decl_namespace (context
);
3735 template = lookup_name (d1
, /*prefer_type=*/0);
3736 template = maybe_get_template_decl_from_type_decl (template);
3738 pop_decl_namespace ();
3741 context
= DECL_CONTEXT (template);
3743 else if (TREE_CODE (d1
) == TYPE_DECL
&& IS_AGGR_TYPE (TREE_TYPE (d1
)))
3745 tree type
= TREE_TYPE (d1
);
3747 /* If we are declaring a constructor, say A<T>::A<T>, we will get
3748 an implicit typename for the second A. Deal with it. */
3749 if (TREE_CODE (type
) == TYPENAME_TYPE
&& TREE_TYPE (type
))
3750 type
= TREE_TYPE (type
);
3752 if (CLASSTYPE_TEMPLATE_INFO (type
))
3754 template = CLASSTYPE_TI_TEMPLATE (type
);
3755 d1
= DECL_NAME (template);
3758 else if (TREE_CODE (d1
) == ENUMERAL_TYPE
3759 || (TYPE_P (d1
) && IS_AGGR_TYPE (d1
)))
3761 template = TYPE_TI_TEMPLATE (d1
);
3762 d1
= DECL_NAME (template);
3764 else if (TREE_CODE (d1
) == TEMPLATE_DECL
3765 && TREE_CODE (DECL_TEMPLATE_RESULT (d1
)) == TYPE_DECL
)
3768 d1
= DECL_NAME (template);
3769 context
= DECL_CONTEXT (template);
3772 /* With something like `template <class T> class X class X { ... };'
3773 we could end up with D1 having nothing but an IDENTIFIER_VALUE.
3774 We don't want to do that, but we have to deal with the situation,
3775 so let's give them some syntax errors to chew on instead of a
3776 crash. Alternatively D1 might not be a template type at all. */
3779 cp_error ("`%T' is not a template", d1
);
3780 return error_mark_node
;
3783 if (TREE_CODE (template) != TEMPLATE_DECL
)
3785 cp_error ("non-template type `%T' used as a template", d1
);
3787 cp_error_at ("for template declaration `%D'", in_decl
);
3788 return error_mark_node
;
3791 if (DECL_TEMPLATE_TEMPLATE_PARM_P (template))
3793 /* Create a new TEMPLATE_DECL and TEMPLATE_TEMPLATE_PARM node to store
3794 template arguments */
3799 parmlist
= DECL_INNERMOST_TEMPLATE_PARMS (template);
3801 arglist2
= coerce_template_parms (parmlist
, arglist
, template, 1, 1);
3802 if (arglist2
== error_mark_node
)
3803 return error_mark_node
;
3805 parm
= copy_template_template_parm (TREE_TYPE (template), arglist2
);
3806 TYPE_SIZE (parm
) = 0;
3811 tree template_type
= TREE_TYPE (template);
3814 tree found
= NULL_TREE
;
3817 int is_partial_instantiation
;
3819 gen_tmpl
= most_general_template (template);
3820 parmlist
= DECL_TEMPLATE_PARMS (gen_tmpl
);
3821 parm_depth
= TMPL_PARMS_DEPTH (parmlist
);
3822 arg_depth
= TMPL_ARGS_DEPTH (arglist
);
3824 if (arg_depth
== 1 && parm_depth
> 1)
3826 /* We've been given an incomplete set of template arguments.
3829 template <class T> struct S1 {
3830 template <class U> struct S2 {};
3831 template <class U> struct S2<U*> {};
3834 we will be called with an ARGLIST of `U*', but the
3835 TEMPLATE will be `template <class T> template
3836 <class U> struct S1<T>::S2'. We must fill in the missing
3839 = add_outermost_template_args (TYPE_TI_ARGS (TREE_TYPE (template)),
3841 arg_depth
= TMPL_ARGS_DEPTH (arglist
);
3844 /* Now we should enough arguments. */
3845 my_friendly_assert (parm_depth
== arg_depth
, 0);
3847 /* From here on, we're only interested in the most general
3849 template = gen_tmpl
;
3851 /* Calculate the BOUND_ARGS. These will be the args that are
3852 actually tsubst'd into the definition to create the
3856 /* We have multiple levels of arguments to coerce, at once. */
3858 int saved_depth
= TMPL_ARGS_DEPTH (arglist
);
3860 tree bound_args
= make_tree_vec (parm_depth
);
3862 for (i
= saved_depth
,
3863 t
= DECL_TEMPLATE_PARMS (template);
3864 i
> 0 && t
!= NULL_TREE
;
3865 --i
, t
= TREE_CHAIN (t
))
3867 tree a
= coerce_template_parms (TREE_VALUE (t
),
3868 arglist
, template, 1, 1);
3869 SET_TMPL_ARGS_LEVEL (bound_args
, i
, a
);
3871 /* We temporarily reduce the length of the ARGLIST so
3872 that coerce_template_parms will see only the arguments
3873 corresponding to the template parameters it is
3875 TREE_VEC_LENGTH (arglist
)--;
3878 /* Restore the ARGLIST to its full size. */
3879 TREE_VEC_LENGTH (arglist
) = saved_depth
;
3881 arglist
= bound_args
;
3885 = coerce_template_parms (INNERMOST_TEMPLATE_PARMS (parmlist
),
3886 INNERMOST_TEMPLATE_ARGS (arglist
),
3889 if (arglist
== error_mark_node
)
3890 /* We were unable to bind the arguments. */
3891 return error_mark_node
;
3893 /* In the scope of a template class, explicit references to the
3894 template class refer to the type of the template, not any
3895 instantiation of it. For example, in:
3897 template <class T> class C { void f(C<T>); }
3899 the `C<T>' is just the same as `C'. Outside of the
3900 class, however, such a reference is an instantiation. */
3901 if (comp_template_args (TYPE_TI_ARGS (template_type
),
3904 found
= template_type
;
3906 if (!entering_scope
&& PRIMARY_TEMPLATE_P (template))
3910 /* Note that we use DECL_CONTEXT, rather than
3911 CP_DECL_CONTEXT, so that the termination test is
3912 always just `ctx'. We're not interested in namepace
3914 for (ctx
= current_class_type
;
3916 ctx
= (TYPE_P (ctx
)) ? TYPE_CONTEXT (ctx
) : DECL_CONTEXT (ctx
))
3917 if (same_type_p (ctx
, template_type
))
3921 /* We're not in the scope of the class, so the
3922 TEMPLATE_TYPE is not the type we want after
3930 for (found
= DECL_TEMPLATE_INSTANTIATIONS (template);
3931 found
; found
= TREE_CHAIN (found
))
3932 if (comp_template_args (TREE_PURPOSE (found
), arglist
))
3936 found
= TREE_VALUE (found
);
3942 /* This type is a "partial instantiation" if any of the template
3943 arguments still inolve template parameters. Note that we set
3944 IS_PARTIAL_INSTANTIATION for partial specializations as
3946 is_partial_instantiation
= uses_template_parms (arglist
);
3948 if (!is_partial_instantiation
3949 && !PRIMARY_TEMPLATE_P (template)
3950 && TREE_CODE (CP_DECL_CONTEXT (template)) == NAMESPACE_DECL
)
3952 found
= xref_tag_from_type (TREE_TYPE (template),
3953 DECL_NAME (template),
3958 context
= tsubst (DECL_CONTEXT (template), arglist
,
3959 /*complain=*/0, in_decl
);
3961 context
= global_namespace
;
3963 /* Create the type. */
3964 if (TREE_CODE (template_type
) == ENUMERAL_TYPE
)
3966 if (!is_partial_instantiation
)
3967 t
= start_enum (TYPE_IDENTIFIER (template_type
));
3969 /* We don't want to call start_enum for this type, since
3970 the values for the enumeration constants may involve
3971 template parameters. And, no one should be interested
3972 in the enumeration constants for such a type. */
3973 t
= make_node (ENUMERAL_TYPE
);
3977 t
= make_aggr_type (TREE_CODE (template_type
));
3978 CLASSTYPE_DECLARED_CLASS (t
)
3979 = CLASSTYPE_DECLARED_CLASS (template_type
);
3980 CLASSTYPE_GOT_SEMICOLON (t
) = 1;
3981 SET_CLASSTYPE_IMPLICIT_INSTANTIATION (t
);
3982 TYPE_FOR_JAVA (t
) = TYPE_FOR_JAVA (template_type
);
3984 /* A local class. Make sure the decl gets registered properly. */
3985 if (context
== current_function_decl
)
3986 pushtag (DECL_NAME (template), t
, 0);
3989 /* If we called start_enum or pushtag above, this information
3990 will already be set up. */
3993 TYPE_CONTEXT (t
) = FROB_CONTEXT (context
);
3995 type_decl
= create_implicit_typedef (DECL_NAME (template), t
);
3996 DECL_CONTEXT (type_decl
) = TYPE_CONTEXT (t
);
3997 TYPE_STUB_DECL (t
) = type_decl
;
3998 DECL_SOURCE_FILE (type_decl
)
3999 = DECL_SOURCE_FILE (TYPE_STUB_DECL (template_type
));
4000 DECL_SOURCE_LINE (type_decl
)
4001 = DECL_SOURCE_LINE (TYPE_STUB_DECL (template_type
));
4004 type_decl
= TYPE_NAME (t
);
4006 /* Set up the template information. We have to figure out which
4007 template is the immediate parent if this is a full
4009 if (parm_depth
== 1 || is_partial_instantiation
4010 || !PRIMARY_TEMPLATE_P (template))
4011 /* This case is easy; there are no member templates involved. */
4015 /* This is a full instantiation of a member template. There
4016 should be some partial instantiation of which this is an
4019 for (found
= DECL_TEMPLATE_INSTANTIATIONS (template);
4020 found
; found
= TREE_CHAIN (found
))
4023 tree tmpl
= CLASSTYPE_TI_TEMPLATE (TREE_VALUE (found
));
4025 /* We only want partial instantiations, here, not
4026 specializations or full instantiations. */
4027 if (CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_VALUE (found
))
4028 || !uses_template_parms (TREE_VALUE (found
)))
4031 /* Temporarily reduce by one the number of levels in the
4032 ARGLIST and in FOUND so as to avoid comparing the
4033 last set of arguments. */
4034 TREE_VEC_LENGTH (arglist
)--;
4035 TREE_VEC_LENGTH (TREE_PURPOSE (found
)) --;
4037 /* See if the arguments match. If they do, then TMPL is
4038 the partial instantiation we want. */
4039 success
= comp_template_args (TREE_PURPOSE (found
), arglist
);
4041 /* Restore the argument vectors to their full size. */
4042 TREE_VEC_LENGTH (arglist
)++;
4043 TREE_VEC_LENGTH (TREE_PURPOSE (found
))++;
4053 my_friendly_abort (0);
4056 SET_TYPE_TEMPLATE_INFO (t
,
4057 tree_cons (found
, arglist
, NULL_TREE
));
4058 DECL_TEMPLATE_INSTANTIATIONS (template)
4059 = tree_cons (arglist
, t
,
4060 DECL_TEMPLATE_INSTANTIATIONS (template));
4062 if (TREE_CODE (t
) == ENUMERAL_TYPE
4063 && !is_partial_instantiation
)
4064 /* Now that the type has been registered on the instantiations
4065 list, we set up the enumerators. Because the enumeration
4066 constants may involve the enumeration type itself, we make
4067 sure to register the type first, and then create the
4068 constants. That way, doing tsubst_expr for the enumeration
4069 constants won't result in recursive calls here; we'll find
4070 the instantiation and exit above. */
4071 tsubst_enum (template_type
, t
, arglist
);
4073 /* Reset the name of the type, now that CLASSTYPE_TEMPLATE_INFO
4075 if (TREE_CODE (t
) != ENUMERAL_TYPE
)
4076 DECL_NAME (type_decl
) = classtype_mangled_name (t
);
4077 DECL_ASSEMBLER_NAME (type_decl
) = DECL_NAME (type_decl
);
4078 if (!is_partial_instantiation
)
4081 DECL_ASSEMBLER_NAME (type_decl
) = mangle_decl (type_decl
);
4083 DECL_ASSEMBLER_NAME (type_decl
)
4084 = get_identifier (build_overload_name (t
, 1, 1));
4086 /* For backwards compatibility; code that uses
4087 -fexternal-templates expects looking up a template to
4088 instantiate it. I think DDD still relies on this.
4089 (jason 8/20/1998) */
4090 if (TREE_CODE (t
) != ENUMERAL_TYPE
4091 && flag_external_templates
4092 && CLASSTYPE_INTERFACE_KNOWN (TREE_TYPE (template))
4093 && ! CLASSTYPE_INTERFACE_ONLY (TREE_TYPE (template)))
4094 add_pending_template (t
);
4097 /* If the type makes use of template parameters, the
4098 code that generates debugging information will crash. */
4099 DECL_IGNORED_P (TYPE_STUB_DECL (t
)) = 1;
4111 /* Called from for_each_template_parm via walk_tree. */
4114 for_each_template_parm_r (tp
, walk_subtrees
, d
)
4120 struct pair_fn_data
*pfd
= (struct pair_fn_data
*) d
;
4121 tree_fn_t fn
= pfd
->fn
;
4122 void *data
= pfd
->data
;
4125 && for_each_template_parm (TYPE_CONTEXT (t
), fn
, data
))
4126 return error_mark_node
;
4128 switch (TREE_CODE (t
))
4131 if (TYPE_PTRMEMFUNC_P (t
))
4137 if (!TYPE_TEMPLATE_INFO (t
))
4139 else if (for_each_template_parm (TREE_VALUE (TYPE_TEMPLATE_INFO (t
)),
4141 return error_mark_node
;
4145 /* Since we're not going to walk subtrees, we have to do this
4147 if (for_each_template_parm (TYPE_METHOD_BASETYPE (t
), fn
, data
))
4148 return error_mark_node
;
4151 /* Check the return type. */
4152 if (for_each_template_parm (TREE_TYPE (t
), fn
, data
))
4153 return error_mark_node
;
4155 /* Check the parameter types. Since default arguments are not
4156 instantiated until they are needed, the TYPE_ARG_TYPES may
4157 contain expressions that involve template parameters. But,
4158 no-one should be looking at them yet. And, once they're
4159 instantiated, they don't contain template parameters, so
4160 there's no point in looking at them then, either. */
4164 for (parm
= TYPE_ARG_TYPES (t
); parm
; parm
= TREE_CHAIN (parm
))
4165 if (for_each_template_parm (TREE_VALUE (parm
), fn
, data
))
4166 return error_mark_node
;
4168 /* Since we've already handled the TYPE_ARG_TYPES, we don't
4169 want walk_tree walking into them itself. */
4176 if (DECL_LANG_SPECIFIC (t
) && DECL_TEMPLATE_INFO (t
)
4177 && for_each_template_parm (DECL_TI_ARGS (t
), fn
, data
))
4178 return error_mark_node
;
4183 if (DECL_CONTEXT (t
)
4184 && for_each_template_parm (DECL_CONTEXT (t
), fn
, data
))
4185 return error_mark_node
;
4188 case BOUND_TEMPLATE_TEMPLATE_PARM
:
4189 /* Record template parameters such as `T' inside `TT<T>'. */
4190 if (for_each_template_parm (TYPE_TI_ARGS (t
), fn
, data
))
4191 return error_mark_node
;
4194 case TEMPLATE_TEMPLATE_PARM
:
4195 case TEMPLATE_TYPE_PARM
:
4196 case TEMPLATE_PARM_INDEX
:
4197 if (fn
&& (*fn
)(t
, data
))
4198 return error_mark_node
;
4200 return error_mark_node
;
4204 /* A template template parameter is encountered */
4205 if (DECL_TEMPLATE_TEMPLATE_PARM_P (t
)
4206 && for_each_template_parm (TREE_TYPE (t
), fn
, data
))
4207 return error_mark_node
;
4209 /* Already substituted template template parameter */
4214 if (!fn
|| for_each_template_parm (TYPENAME_TYPE_FULLNAME (t
), fn
, data
))
4215 return error_mark_node
;
4219 if (TREE_TYPE (t
) && TYPE_PTRMEMFUNC_P (TREE_TYPE (t
))
4220 && for_each_template_parm (TYPE_PTRMEMFUNC_FN_TYPE
4221 (TREE_TYPE (t
)), fn
, data
))
4222 return error_mark_node
;
4227 /* If there's no type, then this thing must be some expression
4228 involving template parameters. */
4229 if (!fn
&& !TREE_TYPE (t
))
4230 return error_mark_node
;
4235 case REINTERPRET_CAST_EXPR
:
4236 case CONST_CAST_EXPR
:
4237 case STATIC_CAST_EXPR
:
4238 case DYNAMIC_CAST_EXPR
:
4243 case PSEUDO_DTOR_EXPR
:
4245 return error_mark_node
;
4252 /* We didn't find any template parameters we liked. */
4256 /* For each TEMPLATE_TYPE_PARM, TEMPLATE_TEMPLATE_PARM,
4257 BOUND_TEMPLATE_TEMPLATE_PARM or TEMPLATE_PARM_INDEX in T,
4258 call FN with the parameter and the DATA.
4259 If FN returns non-zero, the iteration is terminated, and
4260 for_each_template_parm returns 1. Otherwise, the iteration
4261 continues. If FN never returns a non-zero value, the value
4262 returned by for_each_template_parm is 0. If FN is NULL, it is
4263 considered to be the function which always returns 1. */
4266 for_each_template_parm (t
, fn
, data
)
4271 struct pair_fn_data pfd
;
4277 /* Walk the tree. */
4278 return walk_tree_without_duplicates (&t
,
4279 for_each_template_parm_r
,
4284 uses_template_parms (t
)
4287 return for_each_template_parm (t
, 0, 0);
4290 static int tinst_depth
;
4291 extern int max_tinst_depth
;
4292 #ifdef GATHER_STATISTICS
4295 static int tinst_level_tick
;
4296 static int last_template_error_tick
;
4298 /* We're starting to instantiate D; record the template instantiation context
4299 for diagnostics and to restore it later. */
4302 push_tinst_level (d
)
4307 if (tinst_depth
>= max_tinst_depth
)
4309 /* If the instantiation in question still has unbound template parms,
4310 we don't really care if we can't instantiate it, so just return.
4311 This happens with base instantiation for implicit `typename'. */
4312 if (uses_template_parms (d
))
4315 last_template_error_tick
= tinst_level_tick
;
4316 cp_error ("template instantiation depth exceeds maximum of %d (use -ftemplate-depth-NN to increase the maximum) instantiating `%D'",
4317 max_tinst_depth
, d
);
4319 print_instantiation_context ();
4324 new = build_expr_wfl (d
, input_filename
, lineno
, 0);
4325 TREE_CHAIN (new) = current_tinst_level
;
4326 current_tinst_level
= new;
4329 #ifdef GATHER_STATISTICS
4330 if (tinst_depth
> depth_reached
)
4331 depth_reached
= tinst_depth
;
4338 /* We're done instantiating this template; return to the instantiation
4344 tree old
= current_tinst_level
;
4346 /* Restore the filename and line number stashed away when we started
4347 this instantiation. */
4348 lineno
= TINST_LINE (old
);
4349 input_filename
= TINST_FILE (old
);
4350 extract_interface_info ();
4352 current_tinst_level
= TREE_CHAIN (old
);
4357 /* We're instantiating a deferred template; restore the template
4358 instantiation context in which the instantiation was requested, which
4359 is one step out from LEVEL. */
4362 reopen_tinst_level (level
)
4368 for (t
= level
; t
; t
= TREE_CHAIN (t
))
4371 current_tinst_level
= level
;
4375 /* Return the outermost template instantiation context, for use with
4376 -falt-external-templates. */
4381 tree p
= current_tinst_level
;
4384 for (; TREE_CHAIN (p
) ; p
= TREE_CHAIN (p
))
4389 /* DECL is a friend FUNCTION_DECL or TEMPLATE_DECL. ARGS is the
4390 vector of template arguments, as for tsubst.
4392 Returns an appropriate tsbust'd friend declaration. */
4395 tsubst_friend_function (decl
, args
)
4401 const char *file
= input_filename
;
4403 lineno
= DECL_SOURCE_LINE (decl
);
4404 input_filename
= DECL_SOURCE_FILE (decl
);
4406 if (TREE_CODE (decl
) == FUNCTION_DECL
4407 && DECL_TEMPLATE_INSTANTIATION (decl
)
4408 && TREE_CODE (DECL_TI_TEMPLATE (decl
)) != TEMPLATE_DECL
)
4409 /* This was a friend declared with an explicit template
4410 argument list, e.g.:
4414 to indicate that f was a template instantiation, not a new
4415 function declaration. Now, we have to figure out what
4416 instantiation of what template. */
4423 = lookup_template_function (tsubst_expr (DECL_TI_TEMPLATE (decl
),
4424 args
, /*complain=*/1,
4426 tsubst (DECL_TI_ARGS (decl
),
4427 args
, /*complain=*/1,
4429 new_friend
= tsubst (decl
, args
, /*complain=*/1, NULL_TREE
);
4430 tmpl
= determine_specialization (template_id
, new_friend
,
4432 /*need_member_template=*/0);
4433 new_friend
= instantiate_template (tmpl
, new_args
);
4437 new_friend
= tsubst (decl
, args
, /*complain=*/1, NULL_TREE
);
4439 /* The NEW_FRIEND will look like an instantiation, to the
4440 compiler, but is not an instantiation from the point of view of
4441 the language. For example, we might have had:
4443 template <class T> struct S {
4444 template <class U> friend void f(T, U);
4447 Then, in S<int>, template <class U> void f(int, U) is not an
4448 instantiation of anything. */
4449 DECL_USE_TEMPLATE (new_friend
) = 0;
4450 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
4452 DECL_USE_TEMPLATE (DECL_TEMPLATE_RESULT (new_friend
)) = 0;
4453 DECL_SAVED_TREE (DECL_TEMPLATE_RESULT (new_friend
))
4454 = DECL_SAVED_TREE (DECL_TEMPLATE_RESULT (decl
));
4457 /* The mangled name for the NEW_FRIEND is incorrect. The call to
4458 tsubst will have resulted in a call to
4459 set_mangled_name_for_template_decl. But, the function is not a
4460 template instantiation and should not be mangled like one.
4461 Therefore, we remangle the function name. We don't have to do
4462 this if the NEW_FRIEND is a template since
4463 set_mangled_name_for_template_decl doesn't do anything if the
4464 function declaration still uses template arguments. */
4465 if (TREE_CODE (new_friend
) != TEMPLATE_DECL
)
4467 set_mangled_name_for_decl (new_friend
);
4468 DECL_RTL (new_friend
) = 0;
4469 make_decl_rtl (new_friend
, NULL_PTR
, 1);
4472 if (DECL_NAMESPACE_SCOPE_P (new_friend
))
4475 tree new_friend_template_info
;
4476 tree new_friend_result_template_info
;
4478 int new_friend_is_defn
;
4480 /* We must save some information from NEW_FRIEND before calling
4481 duplicate decls since that function will free NEW_FRIEND if
4483 new_friend_template_info
= DECL_TEMPLATE_INFO (new_friend
);
4484 if (TREE_CODE (new_friend
) == TEMPLATE_DECL
)
4486 /* This declaration is a `primary' template. */
4487 DECL_PRIMARY_TEMPLATE (new_friend
) = new_friend
;
4490 = DECL_INITIAL (DECL_TEMPLATE_RESULT (new_friend
)) != NULL_TREE
;
4491 new_friend_result_template_info
4492 = DECL_TEMPLATE_INFO (DECL_TEMPLATE_RESULT (new_friend
));
4496 new_friend_is_defn
= DECL_INITIAL (new_friend
) != NULL_TREE
;
4497 new_friend_result_template_info
= NULL_TREE
;
4500 /* Inside pushdecl_namespace_level, we will push into the
4501 current namespace. However, the friend function should go
4502 into the namespace of the template. */
4503 ns
= decl_namespace_context (new_friend
);
4504 push_nested_namespace (ns
);
4505 old_decl
= pushdecl_namespace_level (new_friend
);
4506 pop_nested_namespace (ns
);
4508 if (old_decl
!= new_friend
)
4510 /* This new friend declaration matched an existing
4511 declaration. For example, given:
4513 template <class T> void f(T);
4514 template <class U> class C {
4515 template <class T> friend void f(T) {}
4518 the friend declaration actually provides the definition
4519 of `f', once C has been instantiated for some type. So,
4520 old_decl will be the out-of-class template declaration,
4521 while new_friend is the in-class definition.
4523 But, if `f' was called before this point, the
4524 instantiation of `f' will have DECL_TI_ARGS corresponding
4525 to `T' but not to `U', references to which might appear
4526 in the definition of `f'. Previously, the most general
4527 template for an instantiation of `f' was the out-of-class
4528 version; now it is the in-class version. Therefore, we
4529 run through all specialization of `f', adding to their
4530 DECL_TI_ARGS appropriately. In particular, they need a
4531 new set of outer arguments, corresponding to the
4532 arguments for this class instantiation.
4534 The same situation can arise with something like this:
4537 template <class T> class C {
4541 when `C<int>' is instantiated. Now, `f(int)' is defined
4544 if (!new_friend_is_defn
)
4545 /* On the other hand, if the in-class declaration does
4546 *not* provide a definition, then we don't want to alter
4547 existing definitions. We can just leave everything
4552 /* Overwrite whatever template info was there before, if
4553 any, with the new template information pertaining to
4555 DECL_TEMPLATE_INFO (old_decl
) = new_friend_template_info
;
4557 if (TREE_CODE (old_decl
) != TEMPLATE_DECL
)
4558 /* duplicate_decls will take care of this case. */
4563 tree new_friend_args
;
4565 DECL_TEMPLATE_INFO (DECL_TEMPLATE_RESULT (old_decl
))
4566 = new_friend_result_template_info
;
4568 new_friend_args
= TI_ARGS (new_friend_template_info
);
4569 for (t
= DECL_TEMPLATE_SPECIALIZATIONS (old_decl
);
4573 tree spec
= TREE_VALUE (t
);
4576 = add_outermost_template_args (new_friend_args
,
4577 DECL_TI_ARGS (spec
));
4580 /* Now, since specializations are always supposed to
4581 hang off of the most general template, we must move
4583 t
= most_general_template (old_decl
);
4586 DECL_TEMPLATE_SPECIALIZATIONS (t
)
4587 = chainon (DECL_TEMPLATE_SPECIALIZATIONS (t
),
4588 DECL_TEMPLATE_SPECIALIZATIONS (old_decl
));
4589 DECL_TEMPLATE_SPECIALIZATIONS (old_decl
) = NULL_TREE
;
4594 /* The information from NEW_FRIEND has been merged into OLD_DECL
4595 by duplicate_decls. */
4596 new_friend
= old_decl
;
4599 else if (COMPLETE_TYPE_P (DECL_CONTEXT (new_friend
)))
4601 /* Check to see that the declaration is really present, and,
4602 possibly obtain an improved declaration. */
4603 tree fn
= check_classfn (DECL_CONTEXT (new_friend
),
4612 input_filename
= file
;
4616 /* FRIEND_TMPL is a friend TEMPLATE_DECL. ARGS is the vector of
4617 template arguments, as for tsubst.
4619 Returns an appropriate tsbust'd friend type or error_mark_node on
4623 tsubst_friend_class (friend_tmpl
, args
)
4630 /* First, we look for a class template. */
4631 tmpl
= lookup_name (DECL_NAME (friend_tmpl
), /*prefer_type=*/0);
4633 /* But, if we don't find one, it might be because we're in a
4634 situation like this:
4642 Here, in the scope of (say) S<int>, `S' is bound to a TYPE_DECL
4643 for `S<int>', not the TEMPLATE_DECL. */
4644 if (!tmpl
|| !DECL_CLASS_TEMPLATE_P (tmpl
))
4646 tmpl
= lookup_name (DECL_NAME (friend_tmpl
), /*prefer_type=*/1);
4647 tmpl
= maybe_get_template_decl_from_type_decl (tmpl
);
4650 if (tmpl
&& DECL_CLASS_TEMPLATE_P (tmpl
))
4652 /* The friend template has already been declared. Just
4653 check to see that the declarations match, and install any new
4654 default parameters. We must tsubst the default parameters,
4655 of course. We only need the innermost template parameters
4656 because that is all that redeclare_class_template will look
4659 = tsubst_template_parms (DECL_TEMPLATE_PARMS (friend_tmpl
),
4660 args
, /*complain=*/1);
4662 return error_mark_node
;
4663 redeclare_class_template (TREE_TYPE (tmpl
), parms
);
4664 friend_type
= TREE_TYPE (tmpl
);
4668 /* The friend template has not already been declared. In this
4669 case, the instantiation of the template class will cause the
4670 injection of this template into the global scope. */
4671 tmpl
= tsubst (friend_tmpl
, args
, /*complain=*/1, NULL_TREE
);
4673 /* The new TMPL is not an instantiation of anything, so we
4674 forget its origins. We don't reset CLASSTYPE_TI_TEMPLATE for
4675 the new type because that is supposed to be the corresponding
4676 template decl, i.e., TMPL. */
4677 DECL_USE_TEMPLATE (tmpl
) = 0;
4678 DECL_TEMPLATE_INFO (tmpl
) = NULL_TREE
;
4679 CLASSTYPE_USE_TEMPLATE (TREE_TYPE (tmpl
)) = 0;
4681 /* Inject this template into the global scope. */
4682 friend_type
= TREE_TYPE (pushdecl_top_level (tmpl
));
4689 instantiate_class_template (type
)
4692 tree
template, args
, pattern
, t
;
4695 if (type
== error_mark_node
)
4696 return error_mark_node
;
4698 if (TYPE_BEING_DEFINED (type
) || COMPLETE_TYPE_P (type
))
4701 /* Figure out which template is being instantiated. */
4702 template = most_general_template (CLASSTYPE_TI_TEMPLATE (type
));
4703 my_friendly_assert (TREE_CODE (template) == TEMPLATE_DECL
, 279);
4705 /* Figure out which arguments are being used to do the
4707 args
= CLASSTYPE_TI_ARGS (type
);
4708 PARTIAL_INSTANTIATION_P (type
) = uses_template_parms (args
);
4710 if (pedantic
&& PARTIAL_INSTANTIATION_P (type
))
4711 /* If this is a partial instantiation, then we can't instantiate
4712 the type; there's no telling whether or not one of the
4713 template parameters might eventually be instantiated to some
4714 value that results in a specialization being used. For
4726 Now, the `S<U>' in `f<int>' is the specialization, not an
4727 instantiation of the original template. */
4730 /* Determine what specialization of the original template to
4732 if (PARTIAL_INSTANTIATION_P (type
))
4733 /* There's no telling which specialization is appropriate at this
4734 point. Since all peeking at the innards of this partial
4735 instantiation are extensions (like the "implicit typename"
4736 extension, which allows users to omit the keyword `typename' on
4737 names that are declared as types in template base classes), we
4738 are free to do what we please.
4740 Trying to figure out which partial instantiation to use can
4741 cause a crash. (Some of the template arguments don't even have
4742 types.) So, we just use the most general version. */
4746 t
= most_specialized_class (template, args
);
4748 if (t
== error_mark_node
)
4750 const char *str
= "candidates are:";
4751 cp_error ("ambiguous class template instantiation for `%#T'", type
);
4752 for (t
= DECL_TEMPLATE_SPECIALIZATIONS (template); t
;
4755 if (get_class_bindings (TREE_VALUE (t
), TREE_PURPOSE (t
),
4758 cp_error_at ("%s %+#T", str
, TREE_TYPE (t
));
4762 TYPE_BEING_DEFINED (type
) = 1;
4763 return error_mark_node
;
4768 pattern
= TREE_TYPE (t
);
4770 pattern
= TREE_TYPE (template);
4772 /* If the template we're instantiating is incomplete, then clearly
4773 there's nothing we can do. */
4774 if (!COMPLETE_TYPE_P (pattern
))
4777 /* If this is a partial instantiation, don't tsubst anything. We will
4778 only use this type for implicit typename, so the actual contents don't
4779 matter. All that matters is whether a particular name is a type. */
4780 if (PARTIAL_INSTANTIATION_P (type
))
4782 /* The fields set here must be kept in sync with those cleared
4783 in begin_class_definition. */
4784 TYPE_BINFO_BASETYPES (type
) = TYPE_BINFO_BASETYPES (pattern
);
4785 TYPE_FIELDS (type
) = TYPE_FIELDS (pattern
);
4786 TYPE_METHODS (type
) = TYPE_METHODS (pattern
);
4787 CLASSTYPE_TAGS (type
) = CLASSTYPE_TAGS (pattern
);
4788 CLASSTYPE_VBASECLASSES (type
) = CLASSTYPE_VBASECLASSES (pattern
);
4790 /* Pretend that the type is complete, so that we will look
4791 inside it during name lookup and such. */
4792 TYPE_SIZE (type
) = bitsize_zero_node
;
4796 /* If we've recursively instantiated too many templates, stop. */
4797 if (! push_tinst_level (type
))
4800 /* Now we're really doing the instantiation. Mark the type as in
4801 the process of being defined. */
4802 TYPE_BEING_DEFINED (type
) = 1;
4804 maybe_push_to_top_level (uses_template_parms (type
));
4808 /* This TYPE is actually a instantiation of of a partial
4809 specialization. We replace the innermost set of ARGS with
4810 the arguments appropriate for substitution. For example,
4813 template <class T> struct S {};
4814 template <class T> struct S<T*> {};
4816 and supposing that we are instantiating S<int*>, ARGS will
4817 present be {int*} but we need {int}. */
4819 = get_class_bindings (TREE_VALUE (t
), TREE_PURPOSE (t
),
4822 /* If there were multiple levels in ARGS, replacing the
4823 innermost level would alter CLASSTYPE_TI_ARGS, which we don't
4824 want, so we make a copy first. */
4825 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (args
))
4827 args
= copy_node (args
);
4828 SET_TMPL_ARGS_LEVEL (args
, TMPL_ARGS_DEPTH (args
), inner_args
);
4834 if (flag_external_templates
)
4836 if (flag_alt_external_templates
)
4838 CLASSTYPE_INTERFACE_ONLY (type
) = interface_only
;
4839 SET_CLASSTYPE_INTERFACE_UNKNOWN_X (type
, interface_unknown
);
4840 CLASSTYPE_VTABLE_NEEDS_WRITING (type
)
4841 = (! CLASSTYPE_INTERFACE_ONLY (type
)
4842 && CLASSTYPE_INTERFACE_KNOWN (type
));
4846 CLASSTYPE_INTERFACE_ONLY (type
) = CLASSTYPE_INTERFACE_ONLY (pattern
);
4847 SET_CLASSTYPE_INTERFACE_UNKNOWN_X
4848 (type
, CLASSTYPE_INTERFACE_UNKNOWN (pattern
));
4849 CLASSTYPE_VTABLE_NEEDS_WRITING (type
)
4850 = (! CLASSTYPE_INTERFACE_ONLY (type
)
4851 && CLASSTYPE_INTERFACE_KNOWN (type
));
4856 SET_CLASSTYPE_INTERFACE_UNKNOWN (type
);
4857 CLASSTYPE_VTABLE_NEEDS_WRITING (type
) = 1;
4860 TYPE_HAS_CONSTRUCTOR (type
) = TYPE_HAS_CONSTRUCTOR (pattern
);
4861 TYPE_HAS_DESTRUCTOR (type
) = TYPE_HAS_DESTRUCTOR (pattern
);
4862 TYPE_OVERLOADS_CALL_EXPR (type
) = TYPE_OVERLOADS_CALL_EXPR (pattern
);
4863 TYPE_OVERLOADS_ARRAY_REF (type
) = TYPE_OVERLOADS_ARRAY_REF (pattern
);
4864 TYPE_OVERLOADS_ARROW (type
) = TYPE_OVERLOADS_ARROW (pattern
);
4865 TYPE_HAS_NEW_OPERATOR (type
) = TYPE_HAS_NEW_OPERATOR (pattern
);
4866 TYPE_HAS_ARRAY_NEW_OPERATOR (type
) = TYPE_HAS_ARRAY_NEW_OPERATOR (pattern
);
4867 TYPE_GETS_DELETE (type
) = TYPE_GETS_DELETE (pattern
);
4868 TYPE_VEC_DELETE_TAKES_SIZE (type
) = TYPE_VEC_DELETE_TAKES_SIZE (pattern
);
4869 TYPE_HAS_ASSIGN_REF (type
) = TYPE_HAS_ASSIGN_REF (pattern
);
4870 TYPE_HAS_CONST_ASSIGN_REF (type
) = TYPE_HAS_CONST_ASSIGN_REF (pattern
);
4871 TYPE_HAS_ABSTRACT_ASSIGN_REF (type
) = TYPE_HAS_ABSTRACT_ASSIGN_REF (pattern
);
4872 TYPE_HAS_INIT_REF (type
) = TYPE_HAS_INIT_REF (pattern
);
4873 TYPE_HAS_CONST_INIT_REF (type
) = TYPE_HAS_CONST_INIT_REF (pattern
);
4874 TYPE_HAS_DEFAULT_CONSTRUCTOR (type
) = TYPE_HAS_DEFAULT_CONSTRUCTOR (pattern
);
4875 TYPE_HAS_CONVERSION (type
) = TYPE_HAS_CONVERSION (pattern
);
4876 TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (type
)
4877 = TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (pattern
);
4878 TYPE_USES_MULTIPLE_INHERITANCE (type
)
4879 = TYPE_USES_MULTIPLE_INHERITANCE (pattern
);
4880 TYPE_USES_VIRTUAL_BASECLASSES (type
)
4881 = TYPE_USES_VIRTUAL_BASECLASSES (pattern
);
4882 TYPE_PACKED (type
) = TYPE_PACKED (pattern
);
4883 TYPE_ALIGN (type
) = TYPE_ALIGN (pattern
);
4884 TYPE_USER_ALIGN (type
) = TYPE_USER_ALIGN (pattern
);
4885 TYPE_FOR_JAVA (type
) = TYPE_FOR_JAVA (pattern
); /* For libjava's JArray<T> */
4886 if (ANON_AGGR_TYPE_P (pattern
))
4887 SET_ANON_AGGR_TYPE_P (type
);
4889 if (TYPE_BINFO_BASETYPES (pattern
))
4891 tree base_list
= NULL_TREE
;
4892 tree pbases
= TYPE_BINFO_BASETYPES (pattern
);
4895 /* Substitute into each of the bases to determine the actual
4897 for (i
= 0; i
< TREE_VEC_LENGTH (pbases
); ++i
)
4903 pbase
= TREE_VEC_ELT (pbases
, i
);
4905 /* Substitue to figure out the base class. */
4906 base
= tsubst (BINFO_TYPE (pbase
), args
,
4907 /*complain=*/1, NULL_TREE
);
4908 if (base
== error_mark_node
)
4911 /* Calculate the correct access node. */
4912 if (TREE_VIA_VIRTUAL (pbase
))
4914 if (TREE_VIA_PUBLIC (pbase
))
4915 access
= access_public_virtual_node
;
4916 else if (TREE_VIA_PROTECTED (pbase
))
4917 access
= access_protected_virtual_node
;
4919 access
= access_private_virtual_node
;
4923 if (TREE_VIA_PUBLIC (pbase
))
4924 access
= access_public_node
;
4925 else if (TREE_VIA_PROTECTED (pbase
))
4926 access
= access_protected_node
;
4928 access
= access_private_node
;
4931 base_list
= tree_cons (access
, base
, base_list
);
4934 /* The list is now in reverse order; correct that. */
4935 base_list
= nreverse (base_list
);
4937 /* Now call xref_basetypes to set up all the base-class
4939 xref_basetypes (TREE_CODE (pattern
) == RECORD_TYPE
4940 ? (CLASSTYPE_DECLARED_CLASS (pattern
)
4941 ? class_type_node
: record_type_node
)
4943 DECL_NAME (TYPE_NAME (pattern
)),
4948 /* Now that our base classes are set up, enter the scope of the
4949 class, so that name lookups into base classes, etc. will work
4950 corectly. This is precisely analagous to what we do in
4951 begin_class_definition when defining an ordinary non-template
4953 pushclass (type
, 1);
4955 for (t
= CLASSTYPE_TAGS (pattern
); t
; t
= TREE_CHAIN (t
))
4957 tree tag
= TREE_VALUE (t
);
4958 tree name
= TYPE_IDENTIFIER (tag
);
4961 newtag
= tsubst (tag
, args
, /*complain=*/1, NULL_TREE
);
4962 if (TREE_CODE (newtag
) != ENUMERAL_TYPE
)
4964 if (TYPE_LANG_SPECIFIC (tag
) && CLASSTYPE_IS_TEMPLATE (tag
))
4965 /* Unfortunately, lookup_template_class sets
4966 CLASSTYPE_IMPLICIT_INSTANTIATION for a partial
4967 instantiation (i.e., for the type of a member template
4968 class nested within a template class.) This behavior is
4969 required for maybe_process_partial_specialization to work
4970 correctly, but is not accurate in this case; the TAG is not
4971 an instantiation of anything. (The corresponding
4972 TEMPLATE_DECL is an instantiation, but the TYPE is not.) */
4973 CLASSTYPE_USE_TEMPLATE (newtag
) = 0;
4975 /* Now, we call pushtag to put this NEWTAG into the scope of
4976 TYPE. We first set up the IDENTIFIER_TYPE_VALUE to avoid
4977 pushtag calling push_template_decl. We don't have to do
4978 this for enums because it will already have been done in
4981 SET_IDENTIFIER_TYPE_VALUE (name
, newtag
);
4982 pushtag (name
, newtag
, /*globalize=*/0);
4986 /* Don't replace enum constants here. */
4987 for (t
= TYPE_FIELDS (pattern
); t
; t
= TREE_CHAIN (t
))
4988 if (TREE_CODE (t
) != CONST_DECL
)
4992 /* The the file and line for this declaration, to assist in
4993 error message reporting. Since we called push_tinst_level
4994 above, we don't need to restore these. */
4995 lineno
= DECL_SOURCE_LINE (t
);
4996 input_filename
= DECL_SOURCE_FILE (t
);
4998 r
= tsubst (t
, args
, /*complain=*/1, NULL_TREE
);
4999 if (TREE_CODE (r
) == VAR_DECL
)
5003 if (DECL_DEFINED_IN_CLASS_P (r
))
5004 init
= tsubst_expr (DECL_INITIAL (t
), args
,
5005 /*complain=*/1, NULL_TREE
);
5009 finish_static_data_member_decl (r
, init
,
5010 /*asmspec_tree=*/NULL_TREE
,
5013 if (DECL_DEFINED_IN_CLASS_P (r
))
5014 check_static_variable_definition (r
, TREE_TYPE (r
));
5017 /* R will have a TREE_CHAIN if and only if it has already been
5018 processed by finish_member_declaration. This can happen
5019 if, for example, it is a TYPE_DECL for a class-scoped
5020 ENUMERAL_TYPE; such a thing will already have been added to
5021 the field list by tsubst_enum above. */
5022 if (!TREE_CHAIN (r
))
5024 set_current_access_from_decl (r
);
5025 finish_member_declaration (r
);
5029 /* Set up the list (TYPE_METHODS) and vector (CLASSTYPE_METHOD_VEC)
5030 for this instantiation. */
5031 for (t
= TYPE_METHODS (pattern
); t
; t
= TREE_CHAIN (t
))
5033 tree r
= tsubst (t
, args
, /*complain=*/1, NULL_TREE
);
5034 set_current_access_from_decl (r
);
5035 finish_member_declaration (r
);
5038 /* Construct the DECL_FRIENDLIST for the new class type. */
5039 typedecl
= TYPE_MAIN_DECL (type
);
5040 for (t
= DECL_FRIENDLIST (TYPE_MAIN_DECL (pattern
));
5046 for (friends
= TREE_VALUE (t
);
5047 friends
!= NULL_TREE
;
5048 friends
= TREE_CHAIN (friends
))
5049 if (TREE_PURPOSE (friends
) == error_mark_node
)
5051 tsubst_friend_function (TREE_VALUE (friends
),
5054 my_friendly_abort (20000216);
5057 for (t
= CLASSTYPE_FRIEND_CLASSES (pattern
);
5061 tree friend_type
= TREE_VALUE (t
);
5062 tree new_friend_type
;
5064 if (TREE_CODE (friend_type
) == TEMPLATE_DECL
)
5065 new_friend_type
= tsubst_friend_class (friend_type
, args
);
5066 else if (uses_template_parms (friend_type
))
5067 new_friend_type
= tsubst (friend_type
, args
, /*complain=*/1,
5071 tree ns
= decl_namespace_context (TYPE_MAIN_DECL (friend_type
));
5073 /* The call to xref_tag_from_type does injection for friend
5075 push_nested_namespace (ns
);
5077 xref_tag_from_type (friend_type
, NULL_TREE
, 1);
5078 pop_nested_namespace (ns
);
5081 if (TREE_CODE (friend_type
) == TEMPLATE_DECL
)
5082 /* Trick make_friend_class into realizing that the friend
5083 we're adding is a template, not an ordinary class. It's
5084 important that we use make_friend_class since it will
5085 perform some error-checking and output cross-reference
5087 ++processing_template_decl
;
5089 if (new_friend_type
!= error_mark_node
)
5090 make_friend_class (type
, new_friend_type
);
5092 if (TREE_CODE (friend_type
) == TEMPLATE_DECL
)
5093 --processing_template_decl
;
5096 for (t
= TYPE_FIELDS (type
); t
; t
= TREE_CHAIN (t
))
5097 if (TREE_CODE (t
) == FIELD_DECL
)
5099 TREE_TYPE (t
) = complete_type (TREE_TYPE (t
));
5100 require_complete_type (t
);
5103 /* Set the file and line number information to whatever is given for
5104 the class itself. This puts error messages involving generated
5105 implicit functions at a predictable point, and the same point
5106 that would be used for non-template classes. */
5107 lineno
= DECL_SOURCE_LINE (typedecl
);
5108 input_filename
= DECL_SOURCE_FILE (typedecl
);
5110 unreverse_member_declarations (type
);
5111 finish_struct_1 (type
);
5112 CLASSTYPE_GOT_SEMICOLON (type
) = 1;
5114 /* Clear this now so repo_template_used is happy. */
5115 TYPE_BEING_DEFINED (type
) = 0;
5116 repo_template_used (type
);
5118 /* Now that the class is complete, instantiate default arguments for
5119 any member functions. We don't do this earlier because the
5120 default arguments may reference members of the class. */
5121 if (!PRIMARY_TEMPLATE_P (template))
5122 for (t
= TYPE_METHODS (type
); t
; t
= TREE_CHAIN (t
))
5123 if (TREE_CODE (t
) == FUNCTION_DECL
5124 /* Implicitly generated member functions will not have tmplate
5125 information; they are not instantiations, but instead are
5126 created "fresh" for each instantiation. */
5127 && DECL_TEMPLATE_INFO (t
))
5128 tsubst_default_arguments (t
);
5131 pop_from_top_level ();
5141 if (t1
== NULL_TREE
)
5142 return t2
== NULL_TREE
;
5143 if (t2
== NULL_TREE
)
5145 /* Don't care if one declares its arg const and the other doesn't -- the
5146 main variant of the arg type is all that matters. */
5147 if (TYPE_MAIN_VARIANT (TREE_VALUE (t1
))
5148 != TYPE_MAIN_VARIANT (TREE_VALUE (t2
)))
5150 return list_eq (TREE_CHAIN (t1
), TREE_CHAIN (t2
));
5153 /* If arg is a non-type template parameter that does not depend on template
5154 arguments, fold it like we weren't in the body of a template. */
5157 maybe_fold_nontype_arg (arg
)
5160 /* If we're not in a template, ARG is already as simple as it's going to
5161 get, and trying to reprocess the trees will break. */
5162 if (! processing_template_decl
)
5165 if (!TYPE_P (arg
) && !uses_template_parms (arg
))
5167 /* Sometimes, one of the args was an expression involving a
5168 template constant parameter, like N - 1. Now that we've
5169 tsubst'd, we might have something like 2 - 1. This will
5170 confuse lookup_template_class, so we do constant folding
5171 here. We have to unset processing_template_decl, to
5172 fool build_expr_from_tree() into building an actual
5175 int saved_processing_template_decl
= processing_template_decl
;
5176 processing_template_decl
= 0;
5177 arg
= fold (build_expr_from_tree (arg
));
5178 processing_template_decl
= saved_processing_template_decl
;
5183 /* Substitute ARGS into the vector of template arguments T. */
5186 tsubst_template_arg_vector (t
, args
, complain
)
5191 int len
= TREE_VEC_LENGTH (t
), need_new
= 0, i
;
5192 tree
*elts
= (tree
*) alloca (len
* sizeof (tree
));
5194 bzero ((char *) elts
, len
* sizeof (tree
));
5196 for (i
= 0; i
< len
; i
++)
5198 if (TREE_VEC_ELT (t
, i
) != NULL_TREE
5199 && TREE_CODE (TREE_VEC_ELT (t
, i
)) == TREE_VEC
)
5200 elts
[i
] = tsubst_template_arg_vector (TREE_VEC_ELT (t
, i
),
5203 elts
[i
] = maybe_fold_nontype_arg
5204 (tsubst_expr (TREE_VEC_ELT (t
, i
), args
, complain
,
5207 if (elts
[i
] == error_mark_node
)
5208 return error_mark_node
;
5210 if (elts
[i
] != TREE_VEC_ELT (t
, i
))
5217 t
= make_tree_vec (len
);
5218 for (i
= 0; i
< len
; i
++)
5219 TREE_VEC_ELT (t
, i
) = elts
[i
];
5224 /* Return the result of substituting ARGS into the template parameters
5225 given by PARMS. If there are m levels of ARGS and m + n levels of
5226 PARMS, then the result will contain n levels of PARMS. For
5227 example, if PARMS is `template <class T> template <class U>
5228 template <T*, U, class V>' and ARGS is {{int}, {double}} then the
5229 result will be `template <int*, double, class V>'. */
5232 tsubst_template_parms (parms
, args
, complain
)
5240 for (new_parms
= &r
;
5241 TMPL_PARMS_DEPTH (parms
) > TMPL_ARGS_DEPTH (args
);
5242 new_parms
= &(TREE_CHAIN (*new_parms
)),
5243 parms
= TREE_CHAIN (parms
))
5246 make_tree_vec (TREE_VEC_LENGTH (TREE_VALUE (parms
)));
5249 for (i
= 0; i
< TREE_VEC_LENGTH (new_vec
); ++i
)
5251 tree default_value
=
5252 TREE_PURPOSE (TREE_VEC_ELT (TREE_VALUE (parms
), i
));
5254 TREE_VALUE (TREE_VEC_ELT (TREE_VALUE (parms
), i
));
5256 TREE_VEC_ELT (new_vec
, i
)
5257 = build_tree_list (tsubst (default_value
, args
, complain
,
5259 tsubst (parm_decl
, args
, complain
,
5264 tree_cons (build_int_2 (0, (TMPL_PARMS_DEPTH (parms
)
5265 - TMPL_ARGS_DEPTH (args
))),
5266 new_vec
, NULL_TREE
);
5272 /* Substitute the ARGS into the indicated aggregate (or enumeration)
5273 type T. If T is not an aggregate or enumeration type, it is
5274 handled as if by tsubst. IN_DECL is as for tsubst. If
5275 ENTERING_SCOPE is non-zero, T is the context for a template which
5276 we are presently tsubst'ing. Return the subsituted value. */
5279 tsubst_aggr_type (t
, args
, complain
, in_decl
, entering_scope
)
5289 switch (TREE_CODE (t
))
5292 if (TYPE_PTRMEMFUNC_P (t
))
5294 tree r
= build_ptrmemfunc_type
5295 (tsubst (TYPE_PTRMEMFUNC_FN_TYPE (t
), args
, complain
, in_decl
));
5296 return cp_build_qualified_type_real (r
, TYPE_QUALS (t
),
5300 /* else fall through */
5303 if (TYPE_TEMPLATE_INFO (t
))
5309 /* First, determine the context for the type we are looking
5311 if (TYPE_CONTEXT (t
) != NULL_TREE
)
5312 context
= tsubst_aggr_type (TYPE_CONTEXT (t
), args
,
5314 in_decl
, /*entering_scope=*/1);
5316 context
= NULL_TREE
;
5318 /* Then, figure out what arguments are appropriate for the
5319 type we are trying to find. For example, given:
5321 template <class T> struct S;
5322 template <class T, class U> void f(T, U) { S<U> su; }
5324 and supposing that we are instantiating f<int, double>,
5325 then our ARGS will be {int, double}, but, when looking up
5326 S we only want {double}. */
5327 argvec
= tsubst_template_arg_vector (TYPE_TI_ARGS (t
), args
,
5329 if (argvec
== error_mark_node
)
5330 return error_mark_node
;
5332 r
= lookup_template_class (t
, argvec
, in_decl
, context
,
5335 return cp_build_qualified_type_real (r
, TYPE_QUALS (t
),
5339 /* This is not a template type, so there's nothing to do. */
5343 return tsubst (t
, args
, complain
, in_decl
);
5347 /* Substitute into the default argument ARG (a default argument for
5348 FN), which has the indicated TYPE. */
5351 tsubst_default_argument (fn
, type
, arg
)
5356 /* This default argument came from a template. Instantiate the
5357 default argument here, not in tsubst. In the case of
5366 we must be careful to do name lookup in the scope of S<T>,
5367 rather than in the current class. */
5368 if (DECL_CLASS_SCOPE_P (fn
))
5369 pushclass (DECL_CONTEXT (fn
), 2);
5371 arg
= tsubst_expr (arg
, DECL_TI_ARGS (fn
), /*complain=*/1, NULL_TREE
);
5373 if (DECL_CLASS_SCOPE_P (fn
))
5376 /* Make sure the default argument is reasonable. */
5377 arg
= check_default_argument (type
, arg
);
5382 /* Substitute into all the default arguments for FN. */
5385 tsubst_default_arguments (fn
)
5391 tmpl_args
= DECL_TI_ARGS (fn
);
5393 /* If this function is not yet instantiated, we certainly don't need
5394 its default arguments. */
5395 if (uses_template_parms (tmpl_args
))
5398 for (arg
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
5400 arg
= TREE_CHAIN (arg
))
5401 if (TREE_PURPOSE (arg
))
5402 TREE_PURPOSE (arg
) = tsubst_default_argument (fn
,
5404 TREE_PURPOSE (arg
));
5407 /* Substitute the ARGS into the T, which is a _DECL. TYPE is the
5408 (already computed) substitution of ARGS into TREE_TYPE (T), if
5409 appropriate. Return the result of the substitution. IN_DECL is as
5413 tsubst_decl (t
, args
, type
, in_decl
)
5420 const char *saved_filename
;
5423 /* Set the filename and linenumber to improve error-reporting. */
5424 saved_lineno
= lineno
;
5425 saved_filename
= input_filename
;
5426 lineno
= DECL_SOURCE_LINE (t
);
5427 input_filename
= DECL_SOURCE_FILE (t
);
5429 switch (TREE_CODE (t
))
5433 /* We can get here when processing a member template function
5434 of a template class. */
5435 tree decl
= DECL_TEMPLATE_RESULT (t
);
5437 int is_template_template_parm
= DECL_TEMPLATE_TEMPLATE_PARM_P (t
);
5439 if (!is_template_template_parm
)
5441 /* We might already have an instance of this template.
5442 The ARGS are for the surrounding class type, so the
5443 full args contain the tsubst'd args for the context,
5444 plus the innermost args from the template decl. */
5445 tree tmpl_args
= DECL_CLASS_TEMPLATE_P (t
)
5446 ? CLASSTYPE_TI_ARGS (TREE_TYPE (t
))
5447 : DECL_TI_ARGS (DECL_TEMPLATE_RESULT (t
));
5450 full_args
= tsubst_template_arg_vector (tmpl_args
, args
,
5453 /* tsubst_template_arg_vector doesn't copy the vector if
5454 nothing changed. But, *something* should have
5456 my_friendly_assert (full_args
!= tmpl_args
, 0);
5458 spec
= retrieve_specialization (t
, full_args
);
5459 if (spec
!= NULL_TREE
)
5466 /* Make a new template decl. It will be similar to the
5467 original, but will record the current template arguments.
5468 We also create a new function declaration, which is just
5469 like the old one, but points to this new template, rather
5470 than the old one. */
5472 my_friendly_assert (DECL_LANG_SPECIFIC (r
) != 0, 0);
5473 TREE_CHAIN (r
) = NULL_TREE
;
5475 if (is_template_template_parm
)
5477 tree new_decl
= tsubst (decl
, args
, /*complain=*/1, in_decl
);
5478 DECL_TEMPLATE_RESULT (r
) = new_decl
;
5479 TREE_TYPE (r
) = TREE_TYPE (new_decl
);
5484 = tsubst_aggr_type (DECL_CONTEXT (t
), args
,
5485 /*complain=*/1, in_decl
,
5486 /*entering_scope=*/1);
5487 DECL_VIRTUAL_CONTEXT (r
)
5488 = tsubst_aggr_type (DECL_VIRTUAL_CONTEXT (t
), args
,
5489 /*complain=*/1, in_decl
,
5490 /*entering_scope=*/1);
5491 DECL_TEMPLATE_INFO (r
) = build_tree_list (t
, args
);
5493 if (TREE_CODE (decl
) == TYPE_DECL
)
5495 tree new_type
= tsubst (TREE_TYPE (t
), args
,
5496 /*complain=*/1, in_decl
);
5497 TREE_TYPE (r
) = new_type
;
5498 CLASSTYPE_TI_TEMPLATE (new_type
) = r
;
5499 DECL_TEMPLATE_RESULT (r
) = TYPE_MAIN_DECL (new_type
);
5500 DECL_TI_ARGS (r
) = CLASSTYPE_TI_ARGS (new_type
);
5504 tree new_decl
= tsubst (decl
, args
, /*complain=*/1, in_decl
);
5506 DECL_TEMPLATE_RESULT (r
) = new_decl
;
5507 DECL_TI_TEMPLATE (new_decl
) = r
;
5508 TREE_TYPE (r
) = TREE_TYPE (new_decl
);
5509 DECL_TI_ARGS (r
) = DECL_TI_ARGS (new_decl
);
5512 SET_DECL_IMPLICIT_INSTANTIATION (r
);
5513 DECL_TEMPLATE_INSTANTIATIONS (r
) = NULL_TREE
;
5514 DECL_TEMPLATE_SPECIALIZATIONS (r
) = NULL_TREE
;
5516 /* The template parameters for this new template are all the
5517 template parameters for the old template, except the
5518 outermost level of parameters. */
5519 DECL_TEMPLATE_PARMS (r
)
5520 = tsubst_template_parms (DECL_TEMPLATE_PARMS (t
), args
,
5523 if (PRIMARY_TEMPLATE_P (t
))
5524 DECL_PRIMARY_TEMPLATE (r
) = r
;
5526 /* We don't partially instantiate partial specializations. */
5527 if (TREE_CODE (decl
) == TYPE_DECL
)
5530 /* Record this partial instantiation. */
5531 register_specialization (r
, t
,
5532 DECL_TI_ARGS (DECL_TEMPLATE_RESULT (r
)));
5540 tree argvec
= NULL_TREE
;
5547 /* Nobody should be tsubst'ing into non-template functions. */
5548 my_friendly_assert (DECL_TEMPLATE_INFO (t
) != NULL_TREE
, 0);
5550 if (TREE_CODE (DECL_TI_TEMPLATE (t
)) == TEMPLATE_DECL
)
5554 /* Calculate the most general template of which R is a
5555 specialization, and the complete set of arguments used to
5557 gen_tmpl
= most_general_template (DECL_TI_TEMPLATE (t
));
5559 = tsubst_template_arg_vector (DECL_TI_ARGS
5560 (DECL_TEMPLATE_RESULT (gen_tmpl
)),
5561 args
, /*complain=*/1);
5563 /* Check to see if we already have this specialization. */
5564 spec
= retrieve_specialization (gen_tmpl
, argvec
);
5572 /* We can see more levels of arguments than parameters if
5573 there was a specialization of a member template, like
5576 template <class T> struct S { template <class U> void f(); }
5577 template <> template <class U> void S<int>::f(U);
5579 Here, we'll be subtituting into the specialization,
5580 because that's where we can find the code we actually
5581 want to generate, but we'll have enough arguments for
5582 the most general template.
5584 We also deal with the peculiar case:
5586 template <class T> struct S {
5587 template <class U> friend void f();
5589 template <class U> void f() {}
5591 template void f<double>();
5593 Here, the ARGS for the instantiation of will be {int,
5594 double}. But, we only need as many ARGS as there are
5595 levels of template parameters in CODE_PATTERN. We are
5596 careful not to get fooled into reducing the ARGS in
5599 template <class T> struct S { template <class U> void f(U); }
5600 template <class T> template <> void S<T>::f(int) {}
5602 which we can spot because the pattern will be a
5603 specialization in this case. */
5604 args_depth
= TMPL_ARGS_DEPTH (args
);
5606 TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (DECL_TI_TEMPLATE (t
)));
5607 if (args_depth
> parms_depth
5608 && !DECL_TEMPLATE_SPECIALIZATION (t
))
5609 args
= get_innermost_template_args (args
, parms_depth
);
5613 /* This special case arises when we have something like this:
5615 template <class T> struct S {
5616 friend void f<int>(int, double);
5619 Here, the DECL_TI_TEMPLATE for the friend declaration
5620 will be a LOOKUP_EXPR or an IDENTIFIER_NODE. We are
5621 being called from tsubst_friend_function, and we want
5622 only to create a new decl (R) with appropriate types so
5623 that we can call determine_specialization. */
5624 my_friendly_assert ((TREE_CODE (DECL_TI_TEMPLATE (t
))
5626 || (TREE_CODE (DECL_TI_TEMPLATE (t
))
5627 == IDENTIFIER_NODE
), 0);
5628 gen_tmpl
= NULL_TREE
;
5631 if (DECL_CLASS_SCOPE_P (t
))
5633 if (DECL_NAME (t
) == constructor_name (DECL_CONTEXT (t
)))
5637 ctx
= tsubst_aggr_type (DECL_CONTEXT (t
), args
,
5639 /*entering_scope=*/1);
5644 ctx
= DECL_CONTEXT (t
);
5646 type
= tsubst (type
, args
, /*complain=*/1, in_decl
);
5647 if (type
== error_mark_node
)
5648 return error_mark_node
;
5650 /* We do NOT check for matching decls pushed separately at this
5651 point, as they may not represent instantiations of this
5652 template, and in any case are considered separate under the
5653 discrete model. Instead, see add_maybe_template. */
5655 DECL_USE_TEMPLATE (r
) = 0;
5656 TREE_TYPE (r
) = type
;
5658 DECL_CONTEXT (r
) = ctx
;
5659 DECL_VIRTUAL_CONTEXT (r
)
5660 = tsubst_aggr_type (DECL_VIRTUAL_CONTEXT (t
), args
,
5662 /*entering_scope=*/1);
5664 if (member
&& DECL_CONV_FN_P (r
))
5666 /* Type-conversion operator. Reconstruct the name, in
5667 case it's the name of one of the template's parameters. */
5669 DECL_NAME (r
) = mangle_conv_op_name_for_type (TREE_TYPE (type
));
5671 DECL_NAME (r
) = build_typename_overload (TREE_TYPE (type
));
5674 DECL_ARGUMENTS (r
) = tsubst (DECL_ARGUMENTS (t
), args
,
5676 DECL_TEMPLATE_RESULT (r
) = NULL_TREE
;
5678 TREE_STATIC (r
) = 0;
5679 TREE_PUBLIC (r
) = TREE_PUBLIC (t
);
5680 DECL_EXTERNAL (r
) = 1;
5681 DECL_INTERFACE_KNOWN (r
) = 0;
5682 DECL_DEFER_OUTPUT (r
) = 0;
5683 TREE_CHAIN (r
) = NULL_TREE
;
5684 DECL_PENDING_INLINE_INFO (r
) = 0;
5685 DECL_PENDING_INLINE_P (r
) = 0;
5686 DECL_SAVED_TREE (r
) = NULL_TREE
;
5688 if (DECL_CLONED_FUNCTION (r
))
5690 DECL_CLONED_FUNCTION (r
) = tsubst (DECL_CLONED_FUNCTION (t
),
5691 args
, /*complain=*/1, t
);
5692 TREE_CHAIN (r
) = TREE_CHAIN (DECL_CLONED_FUNCTION (r
));
5693 TREE_CHAIN (DECL_CLONED_FUNCTION (r
)) = r
;
5696 /* Set up the DECL_TEMPLATE_INFO for R and compute its mangled
5697 name. There's no need to do this in the special friend
5698 case mentioned above where GEN_TMPL is NULL. */
5701 DECL_TEMPLATE_INFO (r
)
5702 = tree_cons (gen_tmpl
, argvec
, NULL_TREE
);
5703 SET_DECL_IMPLICIT_INSTANTIATION (r
);
5704 register_specialization (r
, gen_tmpl
, argvec
);
5706 /* Set the mangled name for R. */
5707 if (DECL_DESTRUCTOR_P (t
))
5710 set_mangled_name_for_decl (r
);
5712 DECL_ASSEMBLER_NAME (r
) = build_destructor_name (ctx
);
5716 /* Instantiations of template functions must be mangled
5717 specially, in order to conform to 14.5.5.1
5718 [temp.over.link]. */
5719 tree tmpl
= DECL_TI_TEMPLATE (t
);
5721 /* TMPL will be NULL if this is a specialization of a
5722 member function of a template class. */
5723 if (name_mangling_version
< 1
5724 || tmpl
== NULL_TREE
5725 || (member
&& !is_member_template (tmpl
)
5726 && !DECL_TEMPLATE_INFO (tmpl
)))
5727 set_mangled_name_for_decl (r
);
5729 set_mangled_name_for_template_decl (r
);
5733 make_decl_rtl (r
, NULL_PTR
, 1);
5735 /* Like grokfndecl. If we don't do this, pushdecl will
5736 mess up our TREE_CHAIN because it doesn't find a
5737 previous decl. Sigh. */
5739 && ! uses_template_parms (r
)
5740 && (IDENTIFIER_GLOBAL_VALUE (DECL_ASSEMBLER_NAME (r
))
5742 SET_IDENTIFIER_GLOBAL_VALUE (DECL_ASSEMBLER_NAME (r
), r
);
5744 /* We're not supposed to instantiate default arguments
5745 until they are called, for a template. But, for a
5748 template <class T> void f ()
5749 { extern void g(int i = T()); }
5751 we should do the substitution when the template is
5752 instantiated. We handle the member function case in
5753 instantiate_class_template since the default arguments
5754 might refer to other members of the class. */
5756 && !PRIMARY_TEMPLATE_P (gen_tmpl
)
5757 && !uses_template_parms (argvec
))
5758 tsubst_default_arguments (r
);
5761 /* Copy the list of befriending classes. */
5762 for (friends
= &DECL_BEFRIENDING_CLASSES (r
);
5764 friends
= &TREE_CHAIN (*friends
))
5766 *friends
= copy_node (*friends
);
5767 TREE_VALUE (*friends
) = tsubst (TREE_VALUE (*friends
),
5768 args
, /*complain=*/1,
5772 if (DECL_CONSTRUCTOR_P (r
) || DECL_DESTRUCTOR_P (r
))
5774 maybe_retrofit_in_chrg (r
);
5775 if (DECL_CONSTRUCTOR_P (r
))
5776 grok_ctor_properties (ctx
, r
);
5778 else if (IDENTIFIER_OPNAME_P (DECL_NAME (r
)))
5779 grok_op_properties (r
, DECL_VIRTUAL_P (r
), DECL_FRIEND_P (r
));
5786 TREE_TYPE (r
) = type
;
5787 c_apply_type_quals_to_decl (CP_TYPE_QUALS (type
), r
);
5789 if (TREE_CODE (DECL_INITIAL (r
)) != TEMPLATE_PARM_INDEX
)
5790 DECL_INITIAL (r
) = TREE_TYPE (r
);
5792 DECL_INITIAL (r
) = tsubst (DECL_INITIAL (r
), args
,
5793 /*complain=*/1, in_decl
);
5795 DECL_CONTEXT (r
) = NULL_TREE
;
5796 if (PROMOTE_PROTOTYPES
5797 && (TREE_CODE (type
) == INTEGER_TYPE
5798 || TREE_CODE (type
) == ENUMERAL_TYPE
)
5799 && TYPE_PRECISION (type
) < TYPE_PRECISION (integer_type_node
))
5800 DECL_ARG_TYPE (r
) = integer_type_node
;
5802 TREE_CHAIN (r
) = tsubst (TREE_CHAIN (t
), args
,
5803 /*complain=*/1, TREE_CHAIN (t
));
5810 TREE_TYPE (r
) = type
;
5811 c_apply_type_quals_to_decl (CP_TYPE_QUALS (type
), r
);
5813 /* We don't have to set DECL_CONTEXT here; it is set by
5814 finish_member_declaration. */
5815 DECL_INITIAL (r
) = tsubst_expr (DECL_INITIAL (t
), args
,
5816 /*complain=*/1, in_decl
);
5817 TREE_CHAIN (r
) = NULL_TREE
;
5818 if (TREE_CODE (type
) == VOID_TYPE
)
5819 cp_error_at ("instantiation of `%D' as type void", r
);
5827 = tsubst_copy (DECL_INITIAL (t
), args
, /*complain=*/1, in_decl
);
5828 TREE_CHAIN (r
) = NULL_TREE
;
5833 if (TREE_CODE (type
) == TEMPLATE_TEMPLATE_PARM
5834 || t
== TYPE_MAIN_DECL (TREE_TYPE (t
)))
5836 /* If this is the canonical decl, we don't have to mess with
5837 instantiations, and often we can't (for typename, template
5838 type parms and such). Note that TYPE_NAME is not correct for
5839 the above test if we've copied the type for a typedef. */
5840 r
= TYPE_NAME (type
);
5848 tree argvec
= NULL_TREE
;
5849 tree gen_tmpl
= NULL_TREE
;
5851 tree tmpl
= NULL_TREE
;
5855 /* Assume this is a non-local variable. */
5858 if (TYPE_P (CP_DECL_CONTEXT (t
)))
5859 ctx
= tsubst_aggr_type (DECL_CONTEXT (t
), args
,
5861 in_decl
, /*entering_scope=*/1);
5864 /* Subsequent calls to pushdecl will fill this in. */
5866 if (!DECL_NAMESPACE_SCOPE_P (t
))
5870 /* Check to see if we already have this specialization. */
5873 tmpl
= DECL_TI_TEMPLATE (t
);
5874 gen_tmpl
= most_general_template (tmpl
);
5875 argvec
= tsubst (DECL_TI_ARGS (t
), args
, /*complain=*/1, in_decl
);
5876 spec
= retrieve_specialization (gen_tmpl
, argvec
);
5879 spec
= retrieve_local_specialization (t
);
5888 TREE_TYPE (r
) = type
;
5889 c_apply_type_quals_to_decl (CP_TYPE_QUALS (type
), r
);
5890 DECL_CONTEXT (r
) = ctx
;
5892 /* Don't try to expand the initializer until someone tries to use
5893 this variable; otherwise we run into circular dependencies. */
5894 DECL_INITIAL (r
) = NULL_TREE
;
5896 DECL_SIZE (r
) = DECL_SIZE_UNIT (r
) = 0;
5898 /* For __PRETTY_FUNCTION__ we have to adjust the initializer. */
5899 if (DECL_PRETTY_FUNCTION_P (r
))
5901 DECL_INITIAL (r
) = tsubst (DECL_INITIAL (t
),
5905 TREE_TYPE (r
) = TREE_TYPE (DECL_INITIAL (r
));
5908 /* Even if the original location is out of scope, the newly
5909 substituted one is not. */
5910 if (TREE_CODE (r
) == VAR_DECL
)
5911 DECL_DEAD_FOR_LOCAL (r
) = 0;
5915 /* A static data member declaration is always marked
5916 external when it is declared in-class, even if an
5917 initializer is present. We mimic the non-template
5919 DECL_EXTERNAL (r
) = 1;
5921 register_specialization (r
, gen_tmpl
, argvec
);
5922 DECL_TEMPLATE_INFO (r
) = tree_cons (tmpl
, argvec
, NULL_TREE
);
5923 SET_DECL_IMPLICIT_INSTANTIATION (r
);
5926 register_local_specialization (r
, t
);
5928 TREE_CHAIN (r
) = NULL_TREE
;
5929 if (TREE_CODE (r
) == VAR_DECL
&& TREE_CODE (type
) == VOID_TYPE
)
5930 cp_error_at ("instantiation of `%D' as type void", r
);
5935 my_friendly_abort (0);
5938 /* Restore the file and line information. */
5939 lineno
= saved_lineno
;
5940 input_filename
= saved_filename
;
5945 /* Substitue into the ARG_TYPES of a function type. */
5948 tsubst_arg_types (arg_types
, args
, complain
, in_decl
)
5954 tree remaining_arg_types
;
5957 if (!arg_types
|| arg_types
== void_list_node
)
5960 remaining_arg_types
= tsubst_arg_types (TREE_CHAIN (arg_types
),
5961 args
, complain
, in_decl
);
5962 if (remaining_arg_types
== error_mark_node
)
5963 return error_mark_node
;
5965 type
= tsubst (TREE_VALUE (arg_types
), args
, complain
, in_decl
);
5966 if (type
== error_mark_node
)
5967 return error_mark_node
;
5969 /* Do array-to-pointer, function-to-pointer conversion, and ignore
5970 top-level qualifiers as required. */
5971 type
= TYPE_MAIN_VARIANT (type_decays_to (type
));
5973 /* Note that we do not substitute into default arguments here. The
5974 standard mandates that they be instantiated only when needed,
5975 which is done in build_over_call. */
5976 return hash_tree_cons (TREE_PURPOSE (arg_types
), type
,
5977 remaining_arg_types
);
5981 /* Substitute into a FUNCTION_TYPE or METHOD_TYPE. This routine does
5982 *not* handle the exception-specification for FNTYPE, because the
5983 initial substitution of explicitly provided template parameters
5984 during argument deduction forbids substitution into the
5985 exception-specification:
5989 All references in the function type of the function template to the
5990 corresponding template parameters are replaced by the specified tem-
5991 plate argument values. If a substitution in a template parameter or
5992 in the function type of the function template results in an invalid
5993 type, type deduction fails. [Note: The equivalent substitution in
5994 exception specifications is done only when the function is instanti-
5995 ated, at which point a program is ill-formed if the substitution
5996 results in an invalid type.] */
5999 tsubst_function_type (t
, args
, complain
, in_decl
)
6009 /* The TYPE_CONTEXT is not used for function/method types. */
6010 my_friendly_assert (TYPE_CONTEXT (t
) == NULL_TREE
, 0);
6012 /* Substitue the return type. */
6013 return_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
6014 if (return_type
== error_mark_node
)
6015 return error_mark_node
;
6017 /* Substitue the argument types. */
6018 arg_types
= tsubst_arg_types (TYPE_ARG_TYPES (t
), args
,
6020 if (arg_types
== error_mark_node
)
6021 return error_mark_node
;
6023 /* Construct a new type node and return it. */
6024 if (TREE_CODE (t
) == FUNCTION_TYPE
)
6025 fntype
= build_function_type (return_type
, arg_types
);
6028 tree r
= TREE_TYPE (TREE_VALUE (arg_types
));
6029 if (! IS_AGGR_TYPE (r
))
6033 Type deduction may fail for any of the following
6036 -- Attempting to create "pointer to member of T" when T
6037 is not a class type. */
6039 cp_error ("creating pointer to member function of non-class type `%T'",
6041 return error_mark_node
;
6044 fntype
= build_cplus_method_type (r
, return_type
, TREE_CHAIN
6047 fntype
= build_qualified_type (fntype
, TYPE_QUALS (t
));
6048 fntype
= build_type_attribute_variant (fntype
, TYPE_ATTRIBUTES (t
));
6053 /* Substitute into the PARMS of a call-declarator. */
6056 tsubst_call_declarator_parms (parms
, args
, complain
, in_decl
)
6066 if (!parms
|| parms
== void_list_node
)
6069 new_parms
= tsubst_call_declarator_parms (TREE_CHAIN (parms
),
6070 args
, complain
, in_decl
);
6072 /* Figure out the type of this parameter. */
6073 type
= tsubst (TREE_VALUE (parms
), args
, complain
, in_decl
);
6075 /* Figure out the default argument as well. Note that we use
6076 tsubst_expr since the default argument is really an expression. */
6077 defarg
= tsubst_expr (TREE_PURPOSE (parms
), args
, complain
, in_decl
);
6079 /* Chain this parameter on to the front of those we have already
6080 processed. We don't use hash_tree_cons because that function
6081 doesn't check TREE_PARMLIST. */
6082 new_parms
= tree_cons (defarg
, type
, new_parms
);
6084 /* And note that these are parameters. */
6085 TREE_PARMLIST (new_parms
) = 1;
6090 /* Take the tree structure T and replace template parameters used
6091 therein with the argument vector ARGS. IN_DECL is an associated
6092 decl for diagnostics. If an error occurs, returns ERROR_MARK_NODE.
6093 An appropriate error message is issued only if COMPLAIN is
6094 non-zero. Note that we must be relatively non-tolerant of
6095 extensions here, in order to preserve conformance; if we allow
6096 substitutions that should not be allowed, we may allow argument
6097 deductions that should not succeed, and therefore report ambiguous
6098 overload situations where there are none. In theory, we could
6099 allow the substitution, but indicate that it should have failed,
6100 and allow our caller to make sure that the right thing happens, but
6101 we don't try to do this yet.
6103 This function is used for dealing with types, decls and the like;
6104 for expressions, use tsubst_expr or tsubst_copy. */
6107 tsubst (t
, args
, complain
, in_decl
)
6114 if (t
== NULL_TREE
|| t
== error_mark_node
6115 || t
== integer_type_node
6116 || t
== void_type_node
6117 || t
== char_type_node
6118 || TREE_CODE (t
) == NAMESPACE_DECL
)
6121 if (TREE_CODE (t
) == IDENTIFIER_NODE
)
6122 type
= IDENTIFIER_TYPE_VALUE (t
);
6124 type
= TREE_TYPE (t
);
6125 if (type
== unknown_type_node
)
6126 my_friendly_abort (42);
6128 if (type
&& TREE_CODE (t
) != FUNCTION_DECL
6129 && TREE_CODE (t
) != TYPENAME_TYPE
6130 && TREE_CODE (t
) != TEMPLATE_DECL
6131 && TREE_CODE (t
) != IDENTIFIER_NODE
6132 && TREE_CODE (t
) != FUNCTION_TYPE
6133 && TREE_CODE (t
) != METHOD_TYPE
)
6134 type
= tsubst (type
, args
, complain
, in_decl
);
6135 if (type
== error_mark_node
)
6136 return error_mark_node
;
6139 return tsubst_decl (t
, args
, type
, in_decl
);
6141 switch (TREE_CODE (t
))
6146 return tsubst_aggr_type (t
, args
, complain
, in_decl
,
6147 /*entering_scope=*/0);
6150 case IDENTIFIER_NODE
:
6162 if (t
== integer_type_node
)
6165 if (TREE_CODE (TYPE_MIN_VALUE (t
)) == INTEGER_CST
6166 && TREE_CODE (TYPE_MAX_VALUE (t
)) == INTEGER_CST
)
6170 tree max
, omax
= TREE_OPERAND (TYPE_MAX_VALUE (t
), 0);
6172 max
= tsubst_expr (omax
, args
, complain
, in_decl
);
6173 if (max
== error_mark_node
)
6174 return error_mark_node
;
6176 /* See if we can reduce this expression to something simpler. */
6177 max
= maybe_fold_nontype_arg (max
);
6178 if (!processing_template_decl
)
6179 max
= decl_constant_value (max
);
6181 if (processing_template_decl
6182 /* When providing explicit arguments to a template
6183 function, but leaving some arguments for subsequent
6184 deduction, MAX may be template-dependent even if we're
6185 not PROCESSING_TEMPLATE_DECL. We still need to check for
6186 template parms, though; MAX won't be an INTEGER_CST for
6187 dynamic arrays, either. */
6188 || (TREE_CODE (max
) != INTEGER_CST
6189 && uses_template_parms (max
)))
6191 tree itype
= make_node (INTEGER_TYPE
);
6192 TYPE_MIN_VALUE (itype
) = size_zero_node
;
6193 TYPE_MAX_VALUE (itype
) = build_min (MINUS_EXPR
, sizetype
, max
,
6198 if (integer_zerop (omax
))
6200 /* Still allow an explicit array of size zero. */
6202 pedwarn ("creating array with size zero");
6204 else if (integer_zerop (max
)
6205 || (TREE_CODE (max
) == INTEGER_CST
6206 && INT_CST_LT (max
, integer_zero_node
)))
6210 Type deduction may fail for any of the following
6213 Attempting to create an array with a size that is
6214 zero or negative. */
6216 cp_error ("creating array with size zero (`%E')", max
);
6218 return error_mark_node
;
6221 return compute_array_index_type (NULL_TREE
, max
);
6224 case TEMPLATE_TYPE_PARM
:
6225 case TEMPLATE_TEMPLATE_PARM
:
6226 case BOUND_TEMPLATE_TEMPLATE_PARM
:
6227 case TEMPLATE_PARM_INDEX
:
6235 if (TREE_CODE (t
) == TEMPLATE_TYPE_PARM
6236 || TREE_CODE (t
) == TEMPLATE_TEMPLATE_PARM
6237 || TREE_CODE (t
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
6239 idx
= TEMPLATE_TYPE_IDX (t
);
6240 level
= TEMPLATE_TYPE_LEVEL (t
);
6244 idx
= TEMPLATE_PARM_IDX (t
);
6245 level
= TEMPLATE_PARM_LEVEL (t
);
6248 if (TREE_VEC_LENGTH (args
) > 0)
6250 tree arg
= NULL_TREE
;
6252 levels
= TMPL_ARGS_DEPTH (args
);
6253 if (level
<= levels
)
6254 arg
= TMPL_ARG (args
, level
, idx
);
6256 if (arg
== error_mark_node
)
6257 return error_mark_node
;
6258 else if (arg
!= NULL_TREE
)
6260 if (TREE_CODE (t
) == TEMPLATE_TYPE_PARM
)
6262 my_friendly_assert (TYPE_P (arg
), 0);
6263 return cp_build_qualified_type_real
6264 (arg
, CP_TYPE_QUALS (arg
) | CP_TYPE_QUALS (t
),
6267 else if (TREE_CODE (t
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
6269 /* We are processing a type constructed from
6270 a template template parameter */
6271 tree argvec
= tsubst (TYPE_TI_ARGS (t
),
6272 args
, complain
, in_decl
);
6273 if (argvec
== error_mark_node
)
6274 return error_mark_node
;
6276 /* We can get a TEMPLATE_TEMPLATE_PARM here when
6277 we are resolving nested-types in the signature of
6278 a member function templates.
6279 Otherwise ARG is a TEMPLATE_DECL and is the real
6280 template to be instantiated. */
6281 if (TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
)
6282 arg
= TYPE_NAME (arg
);
6284 r
= lookup_template_class (arg
,
6287 /*entering_scope=*/0);
6288 return cp_build_qualified_type_real (r
,
6293 /* TEMPLATE_TEMPLATE_PARM or TEMPLATE_PARM_INDEX. */
6298 my_friendly_abort (981018);
6301 /* This can happen during the attempted tsubst'ing in
6302 unify. This means that we don't yet have any information
6303 about the template parameter in question. */
6306 /* If we get here, we must have been looking at a parm for a
6307 more deeply nested template. Make a new version of this
6308 template parameter, but with a lower level. */
6309 switch (TREE_CODE (t
))
6311 case TEMPLATE_TYPE_PARM
:
6312 case TEMPLATE_TEMPLATE_PARM
:
6313 case BOUND_TEMPLATE_TEMPLATE_PARM
:
6314 if (CP_TYPE_QUALS (t
))
6316 r
= tsubst (TYPE_MAIN_VARIANT (t
), args
, complain
, in_decl
);
6317 r
= cp_build_qualified_type_real (r
, CP_TYPE_QUALS (t
),
6323 TEMPLATE_TYPE_PARM_INDEX (r
)
6324 = reduce_template_parm_level (TEMPLATE_TYPE_PARM_INDEX (t
),
6326 TYPE_STUB_DECL (r
) = TYPE_NAME (r
) = TEMPLATE_TYPE_DECL (r
);
6327 TYPE_MAIN_VARIANT (r
) = r
;
6328 TYPE_POINTER_TO (r
) = NULL_TREE
;
6329 TYPE_REFERENCE_TO (r
) = NULL_TREE
;
6331 if (TREE_CODE (t
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
6333 tree argvec
= tsubst (TYPE_TI_ARGS (t
), args
,
6335 if (argvec
== error_mark_node
)
6336 return error_mark_node
;
6338 TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (r
)
6339 = tree_cons (TYPE_TI_TEMPLATE (t
), argvec
, NULL_TREE
);
6344 case TEMPLATE_PARM_INDEX
:
6345 r
= reduce_template_parm_level (t
, type
, levels
);
6349 my_friendly_abort (0);
6357 tree purpose
, value
, chain
, result
;
6359 if (t
== void_list_node
)
6362 purpose
= TREE_PURPOSE (t
);
6365 purpose
= tsubst (purpose
, args
, complain
, in_decl
);
6366 if (purpose
== error_mark_node
)
6367 return error_mark_node
;
6369 value
= TREE_VALUE (t
);
6372 value
= tsubst (value
, args
, complain
, in_decl
);
6373 if (value
== error_mark_node
)
6374 return error_mark_node
;
6376 chain
= TREE_CHAIN (t
);
6377 if (chain
&& chain
!= void_type_node
)
6379 chain
= tsubst (chain
, args
, complain
, in_decl
);
6380 if (chain
== error_mark_node
)
6381 return error_mark_node
;
6383 if (purpose
== TREE_PURPOSE (t
)
6384 && value
== TREE_VALUE (t
)
6385 && chain
== TREE_CHAIN (t
))
6387 result
= hash_tree_cons (purpose
, value
, chain
);
6388 TREE_PARMLIST (result
) = TREE_PARMLIST (t
);
6392 if (type
!= NULL_TREE
)
6394 /* A binfo node. We always need to make a copy, of the node
6395 itself and of its BINFO_BASETYPES. */
6399 /* Make sure type isn't a typedef copy. */
6400 type
= BINFO_TYPE (TYPE_BINFO (type
));
6402 TREE_TYPE (t
) = complete_type (type
);
6403 if (IS_AGGR_TYPE (type
))
6405 BINFO_VTABLE (t
) = TYPE_BINFO_VTABLE (type
);
6406 BINFO_VIRTUALS (t
) = TYPE_BINFO_VIRTUALS (type
);
6407 if (TYPE_BINFO_BASETYPES (type
) != NULL_TREE
)
6408 BINFO_BASETYPES (t
) = copy_node (TYPE_BINFO_BASETYPES (type
));
6413 /* Otherwise, a vector of template arguments. */
6414 return tsubst_template_arg_vector (t
, args
, complain
);
6417 case REFERENCE_TYPE
:
6419 enum tree_code code
;
6421 if (type
== TREE_TYPE (t
))
6424 code
= TREE_CODE (t
);
6429 Type deduction may fail for any of the following
6432 -- Attempting to create a pointer to reference type.
6433 -- Attempting to create a reference to a reference type or
6434 a reference to void. */
6435 if (TREE_CODE (type
) == REFERENCE_TYPE
6436 || (code
== REFERENCE_TYPE
&& TREE_CODE (type
) == VOID_TYPE
))
6438 static int last_line
= 0;
6439 static const char* last_file
= 0;
6441 /* We keep track of the last time we issued this error
6442 message to avoid spewing a ton of messages during a
6443 single bad template instantiation. */
6444 if (complain
&& (last_line
!= lineno
||
6445 last_file
!= input_filename
))
6447 if (TREE_CODE (type
) == VOID_TYPE
)
6448 cp_error ("forming reference to void");
6450 cp_error ("forming %s to reference type `%T'",
6451 (code
== POINTER_TYPE
) ? "pointer" : "reference",
6454 last_file
= input_filename
;
6457 return error_mark_node
;
6459 else if (code
== POINTER_TYPE
)
6460 r
= build_pointer_type (type
);
6462 r
= build_reference_type (type
);
6463 r
= cp_build_qualified_type_real (r
, TYPE_QUALS (t
), complain
);
6465 if (r
!= error_mark_node
)
6466 /* Will this ever be needed for TYPE_..._TO values? */
6473 r
= tsubst (TYPE_OFFSET_BASETYPE (t
), args
, complain
, in_decl
);
6474 if (r
== error_mark_node
|| !IS_AGGR_TYPE (r
))
6478 Type deduction may fail for any of the following
6481 -- Attempting to create "pointer to member of T" when T
6482 is not a class type. */
6484 cp_error ("creating pointer to member of non-class type `%T'",
6486 return error_mark_node
;
6488 return build_offset_type (r
, type
);
6496 fntype
= tsubst_function_type (t
, args
, complain
, in_decl
);
6497 if (fntype
== error_mark_node
)
6498 return error_mark_node
;
6500 /* Substitue the exception specification. */
6501 raises
= TYPE_RAISES_EXCEPTIONS (t
);
6504 tree list
= NULL_TREE
;
6506 if (! TREE_VALUE (raises
))
6509 for (; raises
!= NULL_TREE
; raises
= TREE_CHAIN (raises
))
6511 tree spec
= TREE_VALUE (raises
);
6513 spec
= tsubst (spec
, args
, complain
, in_decl
);
6514 if (spec
== error_mark_node
)
6516 list
= add_exception_specifier (list
, spec
, complain
);
6518 fntype
= build_exception_variant (fntype
, list
);
6524 tree domain
= tsubst (TYPE_DOMAIN (t
), args
, complain
, in_decl
);
6525 if (domain
== error_mark_node
)
6526 return error_mark_node
;
6528 /* As an optimization, we avoid regenerating the array type if
6529 it will obviously be the same as T. */
6530 if (type
== TREE_TYPE (t
) && domain
== TYPE_DOMAIN (t
))
6533 /* These checks should match the ones in grokdeclarator.
6537 The deduction may fail for any of the following reasons:
6539 -- Attempting to create an array with an element type that
6540 is void, a function type, or a reference type. */
6541 if (TREE_CODE (type
) == VOID_TYPE
6542 || TREE_CODE (type
) == FUNCTION_TYPE
6543 || TREE_CODE (type
) == REFERENCE_TYPE
)
6546 cp_error ("creating array of `%T'", type
);
6547 return error_mark_node
;
6550 r
= build_cplus_array_type (type
, domain
);
6557 tree e1
= tsubst (TREE_OPERAND (t
, 0), args
, complain
,
6559 tree e2
= tsubst (TREE_OPERAND (t
, 1), args
, complain
,
6562 if (e1
== error_mark_node
|| e2
== error_mark_node
)
6563 return error_mark_node
;
6565 return fold (build (TREE_CODE (t
), TREE_TYPE (t
), e1
, e2
));
6571 tree e
= tsubst (TREE_OPERAND (t
, 0), args
, complain
,
6573 if (e
== error_mark_node
)
6574 return error_mark_node
;
6576 return fold (build (TREE_CODE (t
), TREE_TYPE (t
), e
));
6581 tree ctx
= tsubst_aggr_type (TYPE_CONTEXT (t
), args
, complain
,
6582 in_decl
, /*entering_scope=*/1);
6583 tree f
= tsubst_copy (TYPENAME_TYPE_FULLNAME (t
), args
,
6586 if (ctx
== error_mark_node
|| f
== error_mark_node
)
6587 return error_mark_node
;
6589 if (!IS_AGGR_TYPE (ctx
))
6592 cp_error ("`%T' is not a class, struct, or union type",
6594 return error_mark_node
;
6596 else if (!uses_template_parms (ctx
) && !TYPE_BEING_DEFINED (ctx
))
6598 /* Normally, make_typename_type does not require that the CTX
6599 have complete type in order to allow things like:
6601 template <class T> struct S { typename S<T>::X Y; };
6603 But, such constructs have already been resolved by this
6604 point, so here CTX really should have complete type, unless
6605 it's a partial instantiation. */
6606 ctx
= complete_type (ctx
);
6607 if (!COMPLETE_TYPE_P (ctx
))
6610 incomplete_type_error (NULL_TREE
, ctx
);
6611 return error_mark_node
;
6615 f
= make_typename_type (ctx
, f
, complain
);
6616 if (f
== error_mark_node
)
6618 return cp_build_qualified_type_real (f
,
6620 | CP_TYPE_QUALS (t
),
6626 tree e
= tsubst (TREE_OPERAND (t
, 0), args
, complain
,
6628 if (e
== error_mark_node
)
6629 return error_mark_node
;
6630 return make_pointer_declarator (type
, e
);
6635 tree e
= tsubst (TREE_OPERAND (t
, 0), args
, complain
,
6637 if (e
== error_mark_node
)
6638 return error_mark_node
;
6639 return make_reference_declarator (type
, e
);
6644 tree e1
= tsubst (TREE_OPERAND (t
, 0), args
, complain
,
6646 tree e2
= tsubst_expr (TREE_OPERAND (t
, 1), args
, complain
,
6648 if (e1
== error_mark_node
|| e2
== error_mark_node
)
6649 return error_mark_node
;
6651 return build_parse_node (ARRAY_REF
, e1
, e2
, tsubst_expr
);
6656 tree e1
= tsubst (TREE_OPERAND (t
, 0), args
, complain
,
6658 tree e2
= (tsubst_call_declarator_parms
6659 (CALL_DECLARATOR_PARMS (t
), args
, complain
, in_decl
));
6660 tree e3
= tsubst (CALL_DECLARATOR_EXCEPTION_SPEC (t
), args
,
6663 if (e1
== error_mark_node
|| e2
== error_mark_node
6664 || e3
== error_mark_node
)
6665 return error_mark_node
;
6667 return make_call_declarator (e1
, e2
, CALL_DECLARATOR_QUALS (t
), e3
);
6672 tree e1
= tsubst (TREE_OPERAND (t
, 0), args
, complain
,
6674 tree e2
= tsubst (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
6675 if (e1
== error_mark_node
|| e2
== error_mark_node
)
6676 return error_mark_node
;
6678 return build_parse_node (TREE_CODE (t
), e1
, e2
);
6683 tree e1
= tsubst_expr (TYPE_FIELDS (t
), args
, complain
,
6685 if (e1
== error_mark_node
)
6686 return error_mark_node
;
6688 return TREE_TYPE (e1
);
6698 /* This code should match declare_hidden_char_array in
6700 name
= (*decl_printable_name
) (current_function_decl
, 2);
6701 len
= strlen (name
) + 1;
6702 type
= build_array_type (char_type_node
,
6703 build_index_type (build_int_2 (len
, 0)));
6704 str
= build_string (len
, name
);
6705 TREE_TYPE (str
) = type
;
6710 sorry ("use of `%s' in template",
6711 tree_code_name
[(int) TREE_CODE (t
)]);
6712 return error_mark_node
;
6716 /* Like tsubst, but deals with expressions. This function just replaces
6717 template parms; to finish processing the resultant expression, use
6721 tsubst_copy (t
, args
, complain
, in_decl
)
6726 enum tree_code code
;
6729 if (t
== NULL_TREE
|| t
== error_mark_node
)
6732 code
= TREE_CODE (t
);
6737 return do_identifier (DECL_NAME (t
), 0, NULL_TREE
);
6744 if (!DECL_CONTEXT (t
))
6745 /* This is a global enumeration constant. */
6748 /* Unfortunately, we cannot just call lookup_name here.
6751 template <int I> int f() {
6753 struct S { void g() { E e = a; } };
6756 When we instantiate f<7>::S::g(), say, lookup_name is not
6757 clever enough to find f<7>::a. */
6759 = tsubst_aggr_type (TREE_TYPE (t
), args
, complain
, in_decl
,
6760 /*entering_scope=*/0);
6762 for (v
= TYPE_VALUES (enum_type
);
6765 if (TREE_PURPOSE (v
) == DECL_NAME (t
))
6766 return TREE_VALUE (v
);
6768 /* We didn't find the name. That should never happen; if
6769 name-lookup found it during preliminary parsing, we
6770 should find it again here during instantiation. */
6771 my_friendly_abort (0);
6776 if (DECL_CONTEXT (t
))
6780 ctx
= tsubst_aggr_type (DECL_CONTEXT (t
), args
, complain
, in_decl
,
6781 /*entering_scope=*/1);
6782 if (ctx
!= DECL_CONTEXT (t
))
6783 return lookup_field (ctx
, DECL_NAME (t
), 0, 0);
6789 if (DECL_LANG_SPECIFIC (t
) && DECL_TEMPLATE_INFO (t
))
6790 t
= tsubst (t
, args
, complain
, in_decl
);
6795 if (is_member_template (t
))
6796 return tsubst (t
, args
, complain
, in_decl
);
6802 /* We must tsbust into a LOOKUP_EXPR in case the names to
6803 which it refers is a conversion operator; in that case the
6804 name will change. We avoid making unnecessary copies,
6807 tree id
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
6809 if (id
!= TREE_OPERAND (t
, 0))
6811 r
= build_nt (LOOKUP_EXPR
, id
);
6812 LOOKUP_EXPR_GLOBAL (r
) = LOOKUP_EXPR_GLOBAL (t
);
6820 case REINTERPRET_CAST_EXPR
:
6821 case CONST_CAST_EXPR
:
6822 case STATIC_CAST_EXPR
:
6823 case DYNAMIC_CAST_EXPR
:
6826 (code
, tsubst (TREE_TYPE (t
), args
, complain
, in_decl
),
6827 tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
));
6830 case PREDECREMENT_EXPR
:
6831 case PREINCREMENT_EXPR
:
6832 case POSTDECREMENT_EXPR
:
6833 case POSTINCREMENT_EXPR
:
6835 case TRUTH_NOT_EXPR
:
6838 case CONVERT_EXPR
: /* Unary + */
6847 (code
, tsubst (TREE_TYPE (t
), args
, complain
, in_decl
),
6848 tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
));
6853 case TRUNC_DIV_EXPR
:
6855 case FLOOR_DIV_EXPR
:
6856 case ROUND_DIV_EXPR
:
6857 case EXACT_DIV_EXPR
:
6859 case BIT_ANDTC_EXPR
:
6862 case TRUNC_MOD_EXPR
:
6863 case FLOOR_MOD_EXPR
:
6864 case TRUTH_ANDIF_EXPR
:
6865 case TRUTH_ORIF_EXPR
:
6866 case TRUTH_AND_EXPR
:
6887 (code
, tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
),
6888 tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
));
6892 tree fn
= TREE_OPERAND (t
, 0);
6893 if (is_overloaded_fn (fn
))
6894 fn
= tsubst_copy (get_first_fn (fn
), args
, complain
, in_decl
);
6896 /* Sometimes FN is a LOOKUP_EXPR. */
6897 fn
= tsubst_copy (fn
, args
, complain
, in_decl
);
6899 (code
, fn
, tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
,
6904 case METHOD_CALL_EXPR
:
6906 tree name
= TREE_OPERAND (t
, 0);
6907 if (TREE_CODE (name
) == BIT_NOT_EXPR
)
6909 name
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
6911 name
= build1 (BIT_NOT_EXPR
, NULL_TREE
, name
);
6913 else if (TREE_CODE (name
) == SCOPE_REF
6914 && TREE_CODE (TREE_OPERAND (name
, 1)) == BIT_NOT_EXPR
)
6916 tree base
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
6918 name
= TREE_OPERAND (name
, 1);
6919 name
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
6921 name
= build1 (BIT_NOT_EXPR
, NULL_TREE
, name
);
6922 name
= build_nt (SCOPE_REF
, base
, name
);
6925 name
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
6927 (code
, name
, tsubst_copy (TREE_OPERAND (t
, 1), args
,
6929 tsubst_copy (TREE_OPERAND (t
, 2), args
, complain
, in_decl
),
6934 /* This processing should really occur in tsubst_expr, However,
6935 tsubst_expr does not recurse into expressions, since it
6936 assumes that there aren't any statements inside them.
6937 Instead, it simply calls build_expr_from_tree. So, we need
6938 to expand the STMT_EXPR here. */
6939 if (!processing_template_decl
)
6941 tree stmt_expr
= begin_stmt_expr ();
6942 tsubst_expr (STMT_EXPR_STMT (t
), args
,
6944 return finish_stmt_expr (stmt_expr
);
6951 case PSEUDO_DTOR_EXPR
:
6954 (code
, tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
),
6955 tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
),
6956 tsubst_copy (TREE_OPERAND (t
, 2), args
, complain
, in_decl
));
6963 (code
, tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
),
6964 tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
),
6965 tsubst_copy (TREE_OPERAND (t
, 2), args
, complain
, in_decl
));
6966 NEW_EXPR_USE_GLOBAL (r
) = NEW_EXPR_USE_GLOBAL (t
);
6973 (code
, tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
),
6974 tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
));
6975 DELETE_EXPR_USE_GLOBAL (r
) = DELETE_EXPR_USE_GLOBAL (t
);
6976 DELETE_EXPR_USE_VEC (r
) = DELETE_EXPR_USE_VEC (t
);
6980 case TEMPLATE_ID_EXPR
:
6982 /* Substituted template arguments */
6983 tree targs
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
,
6986 if (targs
&& TREE_CODE (targs
) == TREE_LIST
)
6989 for (chain
= targs
; chain
; chain
= TREE_CHAIN (chain
))
6990 TREE_VALUE (chain
) = maybe_fold_nontype_arg (TREE_VALUE (chain
));
6995 for (i
= 0; i
< TREE_VEC_LENGTH (targs
); ++i
)
6996 TREE_VEC_ELT (targs
, i
)
6997 = maybe_fold_nontype_arg (TREE_VEC_ELT (targs
, i
));
7000 return lookup_template_function
7001 (tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
), targs
);
7006 tree purpose
, value
, chain
;
7008 if (t
== void_list_node
)
7011 purpose
= TREE_PURPOSE (t
);
7013 purpose
= tsubst_copy (purpose
, args
, complain
, in_decl
);
7014 value
= TREE_VALUE (t
);
7016 value
= tsubst_copy (value
, args
, complain
, in_decl
);
7017 chain
= TREE_CHAIN (t
);
7018 if (chain
&& chain
!= void_type_node
)
7019 chain
= tsubst_copy (chain
, args
, complain
, in_decl
);
7020 if (purpose
== TREE_PURPOSE (t
)
7021 && value
== TREE_VALUE (t
)
7022 && chain
== TREE_CHAIN (t
))
7024 return tree_cons (purpose
, value
, chain
);
7031 case TEMPLATE_TYPE_PARM
:
7032 case TEMPLATE_TEMPLATE_PARM
:
7033 case BOUND_TEMPLATE_TEMPLATE_PARM
:
7034 case TEMPLATE_PARM_INDEX
:
7036 case REFERENCE_TYPE
:
7043 return tsubst (t
, args
, complain
, in_decl
);
7045 case IDENTIFIER_NODE
:
7046 if (IDENTIFIER_TYPENAME_P (t
))
7048 tree new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
7050 return mangle_conv_op_name_for_type (new_type
);
7052 return (build_typename_overload (new_type
));
7060 (CONSTRUCTOR
, tsubst (TREE_TYPE (t
), args
, complain
, in_decl
),
7061 NULL_TREE
, tsubst_copy (CONSTRUCTOR_ELTS (t
), args
,
7062 complain
, in_decl
));
7063 TREE_HAS_CONSTRUCTOR (r
) = TREE_HAS_CONSTRUCTOR (t
);
7068 return build_x_va_arg (tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
,
7070 tsubst (TREE_TYPE (t
), args
, complain
, in_decl
));
7073 return tsubst (t
, args
, complain
, in_decl
);
7080 /* Like tsubst_copy, but also does semantic processing. */
7083 tsubst_expr (t
, args
, complain
, in_decl
)
7090 if (t
== NULL_TREE
|| t
== error_mark_node
)
7093 if (processing_template_decl
)
7094 return tsubst_copy (t
, args
, complain
, in_decl
);
7096 switch (TREE_CODE (t
))
7100 finish_named_return_value
7101 (TREE_OPERAND (t
, 0),
7102 tsubst_expr (TREE_OPERAND (t
, 1), args
, /*complain=*/1, in_decl
));
7103 tsubst_expr (TREE_CHAIN (t
), args
, complain
, in_decl
);
7106 case CTOR_INITIALIZER
:
7108 tree member_init_list
;
7109 tree base_init_list
;
7113 = tsubst_initializer_list (TREE_OPERAND (t
, 0), args
);
7115 = tsubst_initializer_list (TREE_OPERAND (t
, 1), args
);
7116 setup_vtbl_ptr (member_init_list
, base_init_list
);
7117 tsubst_expr (TREE_CHAIN (t
), args
, complain
, in_decl
);
7123 finish_return_stmt (tsubst_expr (RETURN_EXPR (t
),
7124 args
, complain
, in_decl
));
7129 finish_expr_stmt (tsubst_expr (EXPR_STMT_EXPR (t
),
7130 args
, complain
, in_decl
));
7139 decl
= DECL_STMT_DECL (t
);
7140 if (TREE_CODE (decl
) == LABEL_DECL
)
7141 finish_label_decl (DECL_NAME (decl
));
7144 init
= DECL_INITIAL (decl
);
7145 decl
= tsubst (decl
, args
, complain
, in_decl
);
7146 init
= tsubst_expr (init
, args
, complain
, in_decl
);
7148 DECL_INITIAL (decl
) = error_mark_node
;
7149 /* By marking the declaration as instantiated, we avoid
7150 trying to instantiate it. Since instantiate_decl can't
7151 handle local variables, and since we've already done
7152 all that needs to be done, that's the right thing to
7154 if (TREE_CODE (decl
) == VAR_DECL
)
7155 DECL_TEMPLATE_INSTANTIATED (decl
) = 1;
7156 maybe_push_decl (decl
);
7157 cp_finish_decl (decl
, init
, NULL_TREE
, 0);
7167 stmt
= begin_for_stmt ();
7168 for (tmp
= FOR_INIT_STMT (t
); tmp
; tmp
= TREE_CHAIN (tmp
))
7169 tsubst_expr (tmp
, args
, complain
, in_decl
);
7170 finish_for_init_stmt (stmt
);
7171 finish_for_cond (tsubst_expr (FOR_COND (t
), args
,
7174 tmp
= tsubst_expr (FOR_EXPR (t
), args
, complain
, in_decl
);
7175 finish_for_expr (tmp
, stmt
);
7176 tsubst_expr (FOR_BODY (t
), args
, complain
, in_decl
);
7177 finish_for_stmt (stmt
);
7184 stmt
= begin_while_stmt ();
7185 finish_while_stmt_cond (tsubst_expr (WHILE_COND (t
),
7186 args
, complain
, in_decl
),
7188 tsubst_expr (WHILE_BODY (t
), args
, complain
, in_decl
);
7189 finish_while_stmt (stmt
);
7196 stmt
= begin_do_stmt ();
7197 tsubst_expr (DO_BODY (t
), args
, complain
, in_decl
);
7198 finish_do_body (stmt
);
7199 finish_do_stmt (tsubst_expr (DO_COND (t
), args
,
7210 stmt
= begin_if_stmt ();
7211 finish_if_stmt_cond (tsubst_expr (IF_COND (t
),
7212 args
, complain
, in_decl
),
7215 if (tmp
= THEN_CLAUSE (t
), tmp
)
7217 tsubst_expr (tmp
, args
, complain
, in_decl
);
7218 finish_then_clause (stmt
);
7221 if (tmp
= ELSE_CLAUSE (t
), tmp
)
7223 begin_else_clause ();
7224 tsubst_expr (tmp
, args
, complain
, in_decl
);
7225 finish_else_clause (stmt
);
7237 stmt
= begin_compound_stmt (COMPOUND_STMT_NO_SCOPE (t
));
7238 for (substmt
= COMPOUND_BODY (t
);
7239 substmt
!= NULL_TREE
;
7240 substmt
= TREE_CHAIN (substmt
))
7241 tsubst_expr (substmt
, args
, complain
, in_decl
);
7242 return finish_compound_stmt (COMPOUND_STMT_NO_SCOPE (t
), stmt
);
7248 finish_break_stmt ();
7253 finish_continue_stmt ();
7261 stmt
= begin_switch_stmt ();
7262 val
= tsubst_expr (SWITCH_COND (t
), args
, complain
, in_decl
);
7263 finish_switch_cond (val
, stmt
);
7264 tsubst_expr (SWITCH_BODY (t
), args
, complain
, in_decl
);
7265 finish_switch_stmt (stmt
);
7271 finish_case_label (tsubst_expr (CASE_LOW (t
), args
, complain
, in_decl
),
7272 tsubst_expr (CASE_HIGH (t
), args
, complain
, in_decl
));
7276 lineno
= STMT_LINENO (t
);
7277 finish_label_stmt (DECL_NAME (LABEL_STMT_LABEL (t
)));
7282 t
= GOTO_DESTINATION (t
);
7283 if (TREE_CODE (t
) != LABEL_DECL
)
7284 /* Computed goto's must be tsubst'd into. On the other hand,
7285 non-computed gotos must not be; the identifier in question
7286 will have no binding. */
7287 t
= tsubst_expr (t
, args
, complain
, in_decl
);
7290 finish_goto_stmt (t
);
7295 finish_asm_stmt (ASM_CV_QUAL (t
),
7296 tsubst_expr (ASM_STRING (t
), args
, complain
, in_decl
),
7297 tsubst_expr (ASM_OUTPUTS (t
), args
, complain
, in_decl
),
7298 tsubst_expr (ASM_INPUTS (t
), args
, complain
, in_decl
),
7299 tsubst_expr (ASM_CLOBBERS (t
), args
, complain
,
7307 stmt
= begin_try_block ();
7308 tsubst_expr (TRY_STMTS (t
), args
, complain
, in_decl
);
7309 finish_cleanup_try_block (stmt
);
7310 finish_cleanup (tsubst_expr (TRY_HANDLERS (t
), args
,
7318 if (FN_TRY_BLOCK_P (t
))
7319 stmt
= begin_function_try_block ();
7321 stmt
= begin_try_block ();
7323 tsubst_expr (TRY_STMTS (t
), args
, complain
, in_decl
);
7325 if (FN_TRY_BLOCK_P (t
))
7326 finish_function_try_block (stmt
);
7328 finish_try_block (stmt
);
7330 handler
= TRY_HANDLERS (t
);
7331 for (; handler
; handler
= TREE_CHAIN (handler
))
7332 tsubst_expr (handler
, args
, complain
, in_decl
);
7333 if (FN_TRY_BLOCK_P (t
))
7334 finish_function_handler_sequence (stmt
);
7336 finish_handler_sequence (stmt
);
7346 stmt
= begin_handler ();
7347 if (HANDLER_PARMS (t
))
7349 decl
= DECL_STMT_DECL (HANDLER_PARMS (t
));
7350 decl
= tsubst (decl
, args
, complain
, in_decl
);
7351 /* Prevent instantiate_decl from trying to instantiate
7352 this variable. We've already done all that needs to be
7354 DECL_TEMPLATE_INSTANTIATED (decl
) = 1;
7358 blocks
= finish_handler_parms (decl
, stmt
);
7359 tsubst_expr (HANDLER_BODY (t
), args
, complain
, in_decl
);
7360 finish_handler (blocks
, stmt
);
7367 tsubst (t
, args
, complain
, NULL_TREE
);
7371 return build_expr_from_tree (tsubst_copy (t
, args
, complain
, in_decl
));
7376 /* TMPL is a TEMPLATE_DECL for a cloned constructor or destructor.
7377 Instantiate it with the ARGS. */
7380 instantiate_clone (tmpl
, args
)
7387 /* Instantiated the cloned function, rather than the clone. */
7388 spec
= instantiate_template (DECL_CLONED_FUNCTION (tmpl
), args
);
7390 /* Then, see if we've already cloned the instantiation. */
7391 for (clone
= TREE_CHAIN (spec
);
7392 clone
&& DECL_CLONED_FUNCTION_P (clone
);
7393 clone
= TREE_CHAIN (clone
))
7394 if (DECL_NAME (clone
) == DECL_NAME (tmpl
))
7397 /* If we haven't, do so know. */
7399 clone_function_decl (spec
, /*update_method_vec_p=*/0);
7402 for (clone
= TREE_CHAIN (spec
);
7403 clone
&& DECL_CLONED_FUNCTION_P (clone
);
7404 clone
= TREE_CHAIN (clone
))
7405 if (DECL_NAME (clone
) == DECL_NAME (tmpl
))
7408 /* We should always have found the clone by now. */
7409 my_friendly_abort (20000411);
7413 /* Instantiate the indicated variable or function template TMPL with
7414 the template arguments in TARG_PTR. */
7417 instantiate_template (tmpl
, targ_ptr
)
7418 tree tmpl
, targ_ptr
;
7427 if (tmpl
== error_mark_node
)
7428 return error_mark_node
;
7430 my_friendly_assert (TREE_CODE (tmpl
) == TEMPLATE_DECL
, 283);
7432 /* If this function is a clone, handle it specially. */
7433 if (DECL_CLONED_FUNCTION_P (tmpl
))
7434 return instantiate_clone (tmpl
, targ_ptr
);
7436 /* Check to see if we already have this specialization. */
7437 spec
= retrieve_specialization (tmpl
, targ_ptr
);
7438 if (spec
!= NULL_TREE
)
7441 gen_tmpl
= most_general_template (tmpl
);
7442 if (tmpl
!= gen_tmpl
)
7444 /* The TMPL is a partial instantiation. To get a full set of
7445 arguments we must add the arguments used to perform the
7446 partial instantiation. */
7447 targ_ptr
= add_outermost_template_args (DECL_TI_ARGS (tmpl
),
7450 /* Check to see if we already have this specialization. */
7451 spec
= retrieve_specialization (gen_tmpl
, targ_ptr
);
7452 if (spec
!= NULL_TREE
)
7456 len
= DECL_NTPARMS (gen_tmpl
);
7457 inner_args
= INNERMOST_TEMPLATE_ARGS (targ_ptr
);
7461 tree t
= TREE_VEC_ELT (inner_args
, i
);
7464 tree nt
= target_type (t
);
7465 if (IS_AGGR_TYPE (nt
) && decl_function_context (TYPE_MAIN_DECL (nt
)))
7467 cp_error ("type `%T' composed from a local class is not a valid template-argument", t
);
7468 cp_error (" trying to instantiate `%D'", gen_tmpl
);
7469 return error_mark_node
;
7474 /* substitute template parameters */
7475 fndecl
= tsubst (DECL_TEMPLATE_RESULT (gen_tmpl
),
7476 targ_ptr
, /*complain=*/1, gen_tmpl
);
7477 /* The DECL_TI_TEMPLATE should always be the immediate parent
7478 template, not the most general template. */
7479 DECL_TI_TEMPLATE (fndecl
) = tmpl
;
7481 if (flag_external_templates
)
7482 add_pending_template (fndecl
);
7484 /* If we've just instantiated the main entry point for a function,
7485 instantiate all the alternate entry points as well. */
7486 for (clone
= TREE_CHAIN (gen_tmpl
);
7487 clone
&& DECL_CLONED_FUNCTION_P (clone
);
7488 clone
= TREE_CHAIN (clone
))
7489 instantiate_template (clone
, targ_ptr
);
7494 /* Push the name of the class template into the scope of the instantiation. */
7497 overload_template_name (type
)
7500 tree id
= DECL_NAME (CLASSTYPE_TI_TEMPLATE (type
));
7503 if (IDENTIFIER_CLASS_VALUE (id
)
7504 && TREE_TYPE (IDENTIFIER_CLASS_VALUE (id
)) == type
)
7507 decl
= build_decl (TYPE_DECL
, id
, type
);
7508 DECL_ARTIFICIAL (decl
) = 1;
7509 pushdecl_class_level (decl
);
7512 /* The FN is a TEMPLATE_DECL for a function. The ARGS are the
7513 arguments that are being used when calling it. TARGS is a vector
7514 into which the deduced template arguments are placed.
7516 Return zero for success, 2 for an incomplete match that doesn't resolve
7517 all the types, and 1 for complete failure. An error message will be
7518 printed only for an incomplete match.
7520 If FN is a conversion operator, RETURN_TYPE is the type desired as
7521 the result of the conversion operator.
7523 TPARMS is a vector of template parameters.
7525 The EXPLICIT_TARGS are explicit template arguments provided via a
7528 The parameter STRICT is one of:
7531 We are deducing arguments for a function call, as in
7535 We are deducing arguments for a conversion function, as in
7539 We are deducing arguments when calculating the partial
7540 ordering between specializations of function or class
7541 templates, as in [temp.func.order] and [temp.class.order],
7542 when doing an explicit instantiation as in [temp.explicit],
7543 when determining an explicit specialization as in
7544 [temp.expl.spec], or when taking the address of a function
7545 template, as in [temp.deduct.funcaddr].
7547 The other arguments are as for type_unification. */
7550 fn_type_unification (fn
, explicit_targs
, targs
, args
, return_type
,
7552 tree fn
, explicit_targs
, targs
, args
, return_type
;
7553 unification_kind_t strict
;
7559 my_friendly_assert (TREE_CODE (fn
) == TEMPLATE_DECL
, 0);
7561 fntype
= TREE_TYPE (fn
);
7566 The specified template arguments must match the template
7567 parameters in kind (i.e., type, nontype, template), and there
7568 must not be more arguments than there are parameters;
7569 otherwise type deduction fails.
7571 Nontype arguments must match the types of the corresponding
7572 nontype template parameters, or must be convertible to the
7573 types of the corresponding nontype parameters as specified in
7574 _temp.arg.nontype_, otherwise type deduction fails.
7576 All references in the function type of the function template
7577 to the corresponding template parameters are replaced by the
7578 specified template argument values. If a substitution in a
7579 template parameter or in the function type of the function
7580 template results in an invalid type, type deduction fails. */
7582 tree converted_args
;
7585 = (coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (fn
),
7586 explicit_targs
, NULL_TREE
, /*complain=*/0,
7587 /*require_all_arguments=*/0));
7588 if (converted_args
== error_mark_node
)
7591 fntype
= tsubst (fntype
, converted_args
, /*complain=*/0, NULL_TREE
);
7592 if (fntype
== error_mark_node
)
7595 /* Place the explicitly specified arguments in TARGS. */
7596 for (i
= 0; i
< TREE_VEC_LENGTH (targs
); i
++)
7597 TREE_VEC_ELT (targs
, i
) = TREE_VEC_ELT (converted_args
, i
);
7600 parms
= TYPE_ARG_TYPES (fntype
);
7602 if (DECL_CONV_FN_P (fn
))
7604 /* This is a template conversion operator. Remove `this', since
7605 we could be comparing conversions from different classes. */
7606 parms
= TREE_CHAIN (parms
);
7607 args
= TREE_CHAIN (args
);
7608 my_friendly_assert (return_type
!= NULL_TREE
, 20000227);
7613 /* We've been given a return type to match, prepend it. */
7614 parms
= tree_cons (NULL_TREE
, TREE_TYPE (fntype
), parms
);
7615 args
= tree_cons (NULL_TREE
, return_type
, args
);
7618 /* We allow incomplete unification without an error message here
7619 because the standard doesn't seem to explicitly prohibit it. Our
7620 callers must be ready to deal with unification failures in any
7622 result
= type_unification_real (DECL_INNERMOST_TEMPLATE_PARMS (fn
),
7623 targs
, parms
, args
, /*subr=*/0,
7624 strict
, /*allow_incomplete*/1);
7627 /* All is well so far. Now, check:
7631 When all template arguments have been deduced, all uses of
7632 template parameters in nondeduced contexts are replaced with
7633 the corresponding deduced argument values. If the
7634 substitution results in an invalid type, as described above,
7635 type deduction fails. */
7636 if (tsubst (TREE_TYPE (fn
), targs
, /*complain=*/0, NULL_TREE
)
7643 /* Adjust types before performing type deduction, as described in
7644 [temp.deduct.call] and [temp.deduct.conv]. The rules in these two
7645 sections are symmetric. PARM is the type of a function parameter
7646 or the return type of the conversion function. ARG is the type of
7647 the argument passed to the call, or the type of the value
7648 intialized with the result of the conversion function. */
7651 maybe_adjust_types_for_deduction (strict
, parm
, arg
)
7652 unification_kind_t strict
;
7663 /* Swap PARM and ARG throughout the remainder of this
7664 function; the handling is precisely symmetric since PARM
7665 will initialize ARG rather than vice versa. */
7673 /* There is nothing to do in this case. */
7677 my_friendly_abort (0);
7680 if (TREE_CODE (*parm
) != REFERENCE_TYPE
)
7682 /* [temp.deduct.call]
7684 If P is not a reference type:
7686 --If A is an array type, the pointer type produced by the
7687 array-to-pointer standard conversion (_conv.array_) is
7688 used in place of A for type deduction; otherwise,
7690 --If A is a function type, the pointer type produced by
7691 the function-to-pointer standard conversion
7692 (_conv.func_) is used in place of A for type deduction;
7695 --If A is a cv-qualified type, the top level
7696 cv-qualifiers of A's type are ignored for type
7698 if (TREE_CODE (*arg
) == ARRAY_TYPE
)
7699 *arg
= build_pointer_type (TREE_TYPE (*arg
));
7700 else if (TREE_CODE (*arg
) == FUNCTION_TYPE
)
7701 *arg
= build_pointer_type (*arg
);
7703 *arg
= TYPE_MAIN_VARIANT (*arg
);
7706 /* [temp.deduct.call]
7708 If P is a cv-qualified type, the top level cv-qualifiers
7709 of P's type are ignored for type deduction. If P is a
7710 reference type, the type referred to by P is used for
7712 *parm
= TYPE_MAIN_VARIANT (*parm
);
7713 if (TREE_CODE (*parm
) == REFERENCE_TYPE
)
7714 *parm
= TREE_TYPE (*parm
);
7717 /* Like type_unfication.
7719 If SUBR is 1, we're being called recursively (to unify the
7720 arguments of a function or method parameter of a function
7724 type_unification_real (tparms
, targs
, parms
, args
, subr
,
7725 strict
, allow_incomplete
)
7726 tree tparms
, targs
, parms
, args
;
7728 unification_kind_t strict
;
7729 int allow_incomplete
;
7733 int ntparms
= TREE_VEC_LENGTH (tparms
);
7736 my_friendly_assert (TREE_CODE (tparms
) == TREE_VEC
, 289);
7737 my_friendly_assert (parms
== NULL_TREE
7738 || TREE_CODE (parms
) == TREE_LIST
, 290);
7739 /* ARGS could be NULL (via a call from parse.y to
7740 build_x_function_call). */
7742 my_friendly_assert (TREE_CODE (args
) == TREE_LIST
, 291);
7743 my_friendly_assert (ntparms
> 0, 292);
7748 sub_strict
= UNIFY_ALLOW_MORE_CV_QUAL
| UNIFY_ALLOW_DERIVED
;
7752 sub_strict
= UNIFY_ALLOW_LESS_CV_QUAL
;
7756 sub_strict
= UNIFY_ALLOW_NONE
;
7760 my_friendly_abort (0);
7764 && parms
!= void_list_node
7766 && args
!= void_list_node
)
7768 parm
= TREE_VALUE (parms
);
7769 parms
= TREE_CHAIN (parms
);
7770 arg
= TREE_VALUE (args
);
7771 args
= TREE_CHAIN (args
);
7773 if (arg
== error_mark_node
)
7775 if (arg
== unknown_type_node
)
7776 /* We can't deduce anything from this, but we might get all the
7777 template args from other function args. */
7780 /* Conversions will be performed on a function argument that
7781 corresponds with a function parameter that contains only
7782 non-deducible template parameters and explicitly specified
7783 template parameters. */
7784 if (! uses_template_parms (parm
))
7789 type
= TREE_TYPE (arg
);
7796 if (strict
== DEDUCE_EXACT
)
7798 if (same_type_p (parm
, type
))
7802 /* It might work; we shouldn't check now, because we might
7803 get into infinite recursion. Overload resolution will
7812 my_friendly_assert (TREE_TYPE (arg
) != NULL_TREE
, 293);
7813 if (type_unknown_p (arg
))
7815 /* [temp.deduct.type] A template-argument can be deduced from
7816 a pointer to function or pointer to member function
7817 argument if the set of overloaded functions does not
7818 contain function templates and at most one of a set of
7819 overloaded functions provides a unique match. */
7821 if (resolve_overloaded_unification
7822 (tparms
, targs
, parm
, arg
, strict
, sub_strict
)
7827 arg
= TREE_TYPE (arg
);
7831 maybe_adjust_types_for_deduction (strict
, &parm
, &arg
);
7833 if (unify (tparms
, targs
, parm
, arg
, sub_strict
))
7836 /* Fail if we've reached the end of the parm list, and more args
7837 are present, and the parm list isn't variadic. */
7838 if (args
&& args
!= void_list_node
&& parms
== void_list_node
)
7840 /* Fail if parms are left and they don't have default values. */
7842 && parms
!= void_list_node
7843 && TREE_PURPOSE (parms
) == NULL_TREE
)
7846 for (i
= 0; i
< ntparms
; i
++)
7847 if (TREE_VEC_ELT (targs
, i
) == NULL_TREE
)
7849 if (!allow_incomplete
)
7850 error ("incomplete type unification");
7856 /* Subroutine of type_unification_real. Args are like the variables at the
7857 call site. ARG is an overloaded function (or template-id); we try
7858 deducing template args from each of the overloads, and if only one
7859 succeeds, we go with that. Modifies TARGS and returns 0 on success. */
7862 resolve_overloaded_unification (tparms
, targs
, parm
, arg
, strict
,
7864 tree tparms
, targs
, parm
, arg
;
7865 unification_kind_t strict
;
7868 tree tempargs
= copy_node (targs
);
7871 if (TREE_CODE (arg
) == ADDR_EXPR
)
7872 arg
= TREE_OPERAND (arg
, 0);
7874 if (TREE_CODE (arg
) == COMPONENT_REF
)
7875 /* Handle `&x' where `x' is some static or non-static member
7877 arg
= TREE_OPERAND (arg
, 1);
7879 if (TREE_CODE (arg
) == OFFSET_REF
)
7880 arg
= TREE_OPERAND (arg
, 1);
7882 /* Strip baselink information. */
7883 while (TREE_CODE (arg
) == TREE_LIST
)
7884 arg
= TREE_VALUE (arg
);
7886 if (TREE_CODE (arg
) == TEMPLATE_ID_EXPR
)
7888 /* If we got some explicit template args, we need to plug them into
7889 the affected templates before we try to unify, in case the
7890 explicit args will completely resolve the templates in question. */
7892 tree expl_subargs
= TREE_OPERAND (arg
, 1);
7893 arg
= TREE_OPERAND (arg
, 0);
7895 for (; arg
; arg
= OVL_NEXT (arg
))
7897 tree fn
= OVL_CURRENT (arg
);
7900 if (TREE_CODE (fn
) != TEMPLATE_DECL
)
7903 subargs
= get_bindings_overload (fn
, DECL_TEMPLATE_RESULT (fn
),
7907 elem
= tsubst (TREE_TYPE (fn
), subargs
, /*complain=*/0,
7909 if (TREE_CODE (elem
) == METHOD_TYPE
)
7910 elem
= build_ptrmemfunc_type (build_pointer_type (elem
));
7911 good
+= try_one_overload (tparms
, targs
, tempargs
, parm
, elem
,
7912 strict
, sub_strict
);
7916 else if (TREE_CODE (arg
) == OVERLOAD
)
7918 for (; arg
; arg
= OVL_NEXT (arg
))
7920 tree type
= TREE_TYPE (OVL_CURRENT (arg
));
7921 if (TREE_CODE (type
) == METHOD_TYPE
)
7922 type
= build_ptrmemfunc_type (build_pointer_type (type
));
7923 good
+= try_one_overload (tparms
, targs
, tempargs
, parm
,
7925 strict
, sub_strict
);
7929 my_friendly_abort (981006);
7931 /* [temp.deduct.type] A template-argument can be deduced from a pointer
7932 to function or pointer to member function argument if the set of
7933 overloaded functions does not contain function templates and at most
7934 one of a set of overloaded functions provides a unique match.
7936 So if we found multiple possibilities, we return success but don't
7941 int i
= TREE_VEC_LENGTH (targs
);
7943 if (TREE_VEC_ELT (tempargs
, i
))
7944 TREE_VEC_ELT (targs
, i
) = TREE_VEC_ELT (tempargs
, i
);
7952 /* Subroutine of resolve_overloaded_unification; does deduction for a single
7953 overload. Fills TARGS with any deduced arguments, or error_mark_node if
7954 different overloads deduce different arguments for a given parm.
7955 Returns 1 on success. */
7958 try_one_overload (tparms
, orig_targs
, targs
, parm
, arg
, strict
,
7960 tree tparms
, orig_targs
, targs
, parm
, arg
;
7961 unification_kind_t strict
;
7968 /* [temp.deduct.type] A template-argument can be deduced from a pointer
7969 to function or pointer to member function argument if the set of
7970 overloaded functions does not contain function templates and at most
7971 one of a set of overloaded functions provides a unique match.
7973 So if this is a template, just return success. */
7975 if (uses_template_parms (arg
))
7978 maybe_adjust_types_for_deduction (strict
, &parm
, &arg
);
7980 /* We don't copy orig_targs for this because if we have already deduced
7981 some template args from previous args, unify would complain when we
7982 try to deduce a template parameter for the same argument, even though
7983 there isn't really a conflict. */
7984 nargs
= TREE_VEC_LENGTH (targs
);
7985 tempargs
= make_tree_vec (nargs
);
7987 if (unify (tparms
, tempargs
, parm
, arg
, sub_strict
) != 0)
7990 /* First make sure we didn't deduce anything that conflicts with
7991 explicitly specified args. */
7992 for (i
= nargs
; i
--; )
7994 tree elt
= TREE_VEC_ELT (tempargs
, i
);
7995 tree oldelt
= TREE_VEC_ELT (orig_targs
, i
);
7997 if (elt
== NULL_TREE
)
7999 else if (uses_template_parms (elt
))
8001 /* Since we're unifying against ourselves, we will fill in template
8002 args used in the function parm list with our own template parms.
8004 TREE_VEC_ELT (tempargs
, i
) = NULL_TREE
;
8007 else if (oldelt
&& ! template_args_equal (oldelt
, elt
))
8011 for (i
= nargs
; i
--; )
8013 tree elt
= TREE_VEC_ELT (tempargs
, i
);
8016 TREE_VEC_ELT (targs
, i
) = elt
;
8022 /* PARM is a template class (perhaps with unbound template
8023 parameters). ARG is a fully instantiated type. If ARG can be
8024 bound to PARM, return ARG, otherwise return NULL_TREE. TPARMS and
8025 TARGS are as for unify. */
8028 try_class_unification (tparms
, targs
, parm
, arg
)
8037 if (!CLASSTYPE_TEMPLATE_INFO (arg
)
8038 || CLASSTYPE_TI_TEMPLATE (arg
) != CLASSTYPE_TI_TEMPLATE (parm
))
8041 /* We need to make a new template argument vector for the call to
8042 unify. If we used TARGS, we'd clutter it up with the result of
8043 the attempted unification, even if this class didn't work out.
8044 We also don't want to commit ourselves to all the unifications
8045 we've already done, since unification is supposed to be done on
8046 an argument-by-argument basis. In other words, consider the
8047 following pathological case:
8049 template <int I, int J, int K>
8052 template <int I, int J>
8053 struct S<I, J, 2> : public S<I, I, I>, S<J, J, J> {};
8055 template <int I, int J, int K>
8056 void f(S<I, J, K>, S<I, I, I>);
8065 Now, by the time we consider the unification involving `s2', we
8066 already know that we must have `f<0, 0, 0>'. But, even though
8067 `S<0, 1, 2>' is derived from `S<0, 0, 0>', the code is not legal
8068 because there are two ways to unify base classes of S<0, 1, 2>
8069 with S<I, I, I>. If we kept the already deduced knowledge, we
8070 would reject the possibility I=1. */
8071 copy_of_targs
= make_tree_vec (TREE_VEC_LENGTH (targs
));
8072 i
= unify (tparms
, copy_of_targs
, CLASSTYPE_TI_ARGS (parm
),
8073 CLASSTYPE_TI_ARGS (arg
), UNIFY_ALLOW_NONE
);
8075 /* If unification failed, we're done. */
8082 /* Subroutine of get_template_base. RVAL, if non-NULL, is a base we
8083 have alreay discovered to be satisfactory. ARG_BINFO is the binfo
8084 for the base class of ARG that we are currently examining. */
8087 get_template_base_recursive (tparms
, targs
, parm
,
8088 arg_binfo
, rval
, flags
)
8098 tree arg
= BINFO_TYPE (arg_binfo
);
8100 if (!(flags
& GTB_IGNORE_TYPE
))
8102 tree r
= try_class_unification (tparms
, targs
,
8105 /* If there is more than one satisfactory baseclass, then:
8109 If they yield more than one possible deduced A, the type
8113 if (r
&& rval
&& !same_type_p (r
, rval
))
8114 return error_mark_node
;
8119 binfos
= BINFO_BASETYPES (arg_binfo
);
8120 n_baselinks
= binfos
? TREE_VEC_LENGTH (binfos
) : 0;
8122 /* Process base types. */
8123 for (i
= 0; i
< n_baselinks
; i
++)
8125 tree base_binfo
= TREE_VEC_ELT (binfos
, i
);
8128 /* Skip this base, if we've already seen it. */
8129 if (BINFO_MARKED (base_binfo
))
8133 (flags
& GTB_VIA_VIRTUAL
) || TREE_VIA_VIRTUAL (base_binfo
);
8135 /* When searching for a non-virtual, we cannot mark virtually
8138 SET_BINFO_MARKED (base_binfo
);
8140 rval
= get_template_base_recursive (tparms
, targs
,
8144 GTB_VIA_VIRTUAL
* this_virtual
);
8146 /* If we discovered more than one matching base class, we can
8148 if (rval
== error_mark_node
)
8149 return error_mark_node
;
8155 /* Given a template type PARM and a class type ARG, find the unique
8156 base type in ARG that is an instance of PARM. We do not examine
8157 ARG itself; only its base-classes. If there is no appropriate base
8158 class, return NULL_TREE. If there is more than one, return
8159 error_mark_node. PARM may be the type of a partial specialization,
8160 as well as a plain template type. Used by unify. */
8163 get_template_base (tparms
, targs
, parm
, arg
)
8172 my_friendly_assert (IS_AGGR_TYPE_CODE (TREE_CODE (arg
)), 92);
8174 arg_binfo
= TYPE_BINFO (complete_type (arg
));
8175 rval
= get_template_base_recursive (tparms
, targs
,
8180 /* Since get_template_base_recursive marks the bases classes, we
8181 must unmark them here. */
8182 dfs_walk (arg_binfo
, dfs_unmark
, markedp
, 0);
8187 /* Returns the level of DECL, which declares a template parameter. */
8190 template_decl_level (decl
)
8193 switch (TREE_CODE (decl
))
8197 return TEMPLATE_TYPE_LEVEL (TREE_TYPE (decl
));
8200 return TEMPLATE_PARM_LEVEL (DECL_INITIAL (decl
));
8203 my_friendly_abort (0);
8208 /* Decide whether ARG can be unified with PARM, considering only the
8209 cv-qualifiers of each type, given STRICT as documented for unify.
8210 Returns non-zero iff the unification is OK on that basis.*/
8213 check_cv_quals_for_unify (strict
, arg
, parm
)
8218 if (!(strict
& UNIFY_ALLOW_MORE_CV_QUAL
)
8219 && !at_least_as_qualified_p (arg
, parm
))
8222 if (!(strict
& UNIFY_ALLOW_LESS_CV_QUAL
)
8223 && !at_least_as_qualified_p (parm
, arg
))
8229 /* Takes parameters as for type_unification. Returns 0 if the
8230 type deduction suceeds, 1 otherwise. The parameter STRICT is a
8231 bitwise or of the following flags:
8234 Require an exact match between PARM and ARG.
8235 UNIFY_ALLOW_MORE_CV_QUAL:
8236 Allow the deduced ARG to be more cv-qualified than ARG.
8237 UNIFY_ALLOW_LESS_CV_QUAL:
8238 Allow the deduced ARG to be less cv-qualified than ARG.
8239 UNIFY_ALLOW_DERIVED:
8240 Allow the deduced ARG to be a template base class of ARG,
8241 or a pointer to a template base class of the type pointed to by
8243 UNIFY_ALLOW_INTEGER:
8244 Allow any integral type to be deduced. See the TEMPLATE_PARM_INDEX
8245 case for more information. */
8248 unify (tparms
, targs
, parm
, arg
, strict
)
8249 tree tparms
, targs
, parm
, arg
;
8256 /* I don't think this will do the right thing with respect to types.
8257 But the only case I've seen it in so far has been array bounds, where
8258 signedness is the only information lost, and I think that will be
8260 while (TREE_CODE (parm
) == NOP_EXPR
)
8261 parm
= TREE_OPERAND (parm
, 0);
8263 if (arg
== error_mark_node
)
8265 if (arg
== unknown_type_node
)
8266 /* We can't deduce anything from this, but we might get all the
8267 template args from other function args. */
8270 /* If PARM uses template parameters, then we can't bail out here,
8271 even if ARG == PARM, since we won't record unifications for the
8272 template parameters. We might need them if we're trying to
8273 figure out which of two things is more specialized. */
8274 if (arg
== parm
&& !uses_template_parms (parm
))
8277 /* Immediately reject some pairs that won't unify because of
8278 cv-qualification mismatches. */
8279 if (TREE_CODE (arg
) == TREE_CODE (parm
)
8281 /* We check the cv-qualifiers when unifying with template type
8282 parameters below. We want to allow ARG `const T' to unify with
8283 PARM `T' for example, when computing which of two templates
8284 is more specialized, for example. */
8285 && TREE_CODE (arg
) != TEMPLATE_TYPE_PARM
8286 && !check_cv_quals_for_unify (strict
, arg
, parm
))
8289 switch (TREE_CODE (parm
))
8292 /* In a type which contains a nested-name-specifier, template
8293 argument values cannot be deduced for template parameters used
8294 within the nested-name-specifier. */
8297 case TEMPLATE_TYPE_PARM
:
8298 case TEMPLATE_TEMPLATE_PARM
:
8299 case BOUND_TEMPLATE_TEMPLATE_PARM
:
8300 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, 0));
8302 if (TEMPLATE_TYPE_LEVEL (parm
)
8303 != template_decl_level (tparm
))
8304 /* The PARM is not one we're trying to unify. Just check
8305 to see if it matches ARG. */
8306 return (TREE_CODE (arg
) == TREE_CODE (parm
)
8307 && same_type_p (parm
, arg
)) ? 0 : 1;
8308 idx
= TEMPLATE_TYPE_IDX (parm
);
8309 targ
= TREE_VEC_ELT (targs
, idx
);
8310 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, idx
));
8312 /* Check for mixed types and values. */
8313 if ((TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
8314 && TREE_CODE (tparm
) != TYPE_DECL
)
8315 || (TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
8316 && TREE_CODE (tparm
) != TEMPLATE_DECL
))
8319 if (TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
8321 /* ARG must be constructed from a template class. */
8322 if (TREE_CODE (arg
) != RECORD_TYPE
|| !CLASSTYPE_TEMPLATE_INFO (arg
))
8326 tree parmtmpl
= TYPE_TI_TEMPLATE (parm
);
8327 tree parmvec
= TYPE_TI_ARGS (parm
);
8328 tree argvec
= CLASSTYPE_TI_ARGS (arg
);
8330 = DECL_INNERMOST_TEMPLATE_PARMS (CLASSTYPE_TI_TEMPLATE (arg
));
8333 /* The parameter and argument roles have to be switched here
8334 in order to handle default arguments properly. For example,
8335 template<template <class> class TT> void f(TT<int>)
8336 should be able to accept vector<int> which comes from
8337 template <class T, class Allocator = allocator>
8340 if (coerce_template_parms (argtmplvec
, parmvec
, parmtmpl
, 0, 1)
8344 /* Deduce arguments T, i from TT<T> or TT<i>.
8345 We check each element of PARMVEC and ARGVEC individually
8346 rather than the whole TREE_VEC since they can have
8347 different number of elements. */
8349 for (i
= 0; i
< TREE_VEC_LENGTH (parmvec
); ++i
)
8351 tree t
= TREE_VEC_ELT (parmvec
, i
);
8353 if (unify (tparms
, targs
, t
,
8354 TREE_VEC_ELT (argvec
, i
),
8359 arg
= CLASSTYPE_TI_TEMPLATE (arg
);
8361 /* Fall through to deduce template name. */
8364 if (TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
8365 || TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
8367 /* Deduce template name TT from TT, TT<>, TT<T> and TT<i>. */
8369 /* Simple cases: Value already set, does match or doesn't. */
8370 if (targ
!= NULL_TREE
&& template_args_equal (targ
, arg
))
8377 /* If PARM is `const T' and ARG is only `int', we don't have
8378 a match unless we are allowing additional qualification.
8379 If ARG is `const int' and PARM is just `T' that's OK;
8380 that binds `const int' to `T'. */
8381 if (!check_cv_quals_for_unify (strict
| UNIFY_ALLOW_LESS_CV_QUAL
,
8385 /* Consider the case where ARG is `const volatile int' and
8386 PARM is `const T'. Then, T should be `volatile int'. */
8388 cp_build_qualified_type_real (arg
,
8390 & ~CP_TYPE_QUALS (parm
),
8392 if (arg
== error_mark_node
)
8395 /* Simple cases: Value already set, does match or doesn't. */
8396 if (targ
!= NULL_TREE
&& same_type_p (targ
, arg
))
8402 /* Make sure that ARG is not a variable-sized array. (Note that
8403 were talking about variable-sized arrays (like `int[n]'),
8404 rather than arrays of unknown size (like `int[]').) We'll
8405 get very confused by such a type since the bound of the array
8406 will not be computable in an instantiation. Besides, such
8407 types are not allowed in ISO C++, so we can do as we please
8409 if (TREE_CODE (arg
) == ARRAY_TYPE
8410 && !uses_template_parms (arg
)
8411 && (TREE_CODE (TYPE_MAX_VALUE (TYPE_DOMAIN (arg
)))
8415 TREE_VEC_ELT (targs
, idx
) = arg
;
8418 case TEMPLATE_PARM_INDEX
:
8419 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, 0));
8421 if (TEMPLATE_PARM_LEVEL (parm
)
8422 != template_decl_level (tparm
))
8423 /* The PARM is not one we're trying to unify. Just check
8424 to see if it matches ARG. */
8425 return (TREE_CODE (arg
) == TREE_CODE (parm
)
8426 && cp_tree_equal (parm
, arg
) > 0) ? 0 : 1;
8428 idx
= TEMPLATE_PARM_IDX (parm
);
8429 targ
= TREE_VEC_ELT (targs
, idx
);
8433 int i
= (cp_tree_equal (targ
, arg
) > 0);
8439 my_friendly_abort (42);
8442 /* [temp.deduct.type] If, in the declaration of a function template
8443 with a non-type template-parameter, the non-type
8444 template-parameter is used in an expression in the function
8445 parameter-list and, if the corresponding template-argument is
8446 deduced, the template-argument type shall match the type of the
8447 template-parameter exactly, except that a template-argument
8448 deduced from an array bound may be of any integral type.
8449 The non-type parameter might use already deduced type parameters. */
8450 if (same_type_p (TREE_TYPE (arg
),
8451 tsubst (TREE_TYPE (parm
), targs
, 0, NULL_TREE
)))
8453 else if ((strict
& UNIFY_ALLOW_INTEGER
)
8454 && (TREE_CODE (TREE_TYPE (parm
)) == INTEGER_TYPE
8455 || TREE_CODE (TREE_TYPE (parm
)) == BOOLEAN_TYPE
))
8460 TREE_VEC_ELT (targs
, idx
) = arg
;
8467 if (TREE_CODE (arg
) != POINTER_TYPE
)
8470 /* [temp.deduct.call]
8472 A can be another pointer or pointer to member type that can
8473 be converted to the deduced A via a qualification
8474 conversion (_conv.qual_).
8476 We pass down STRICT here rather than UNIFY_ALLOW_NONE.
8477 This will allow for additional cv-qualification of the
8478 pointed-to types if appropriate. In general, this is a bit
8479 too generous; we are only supposed to allow qualification
8480 conversions and this method will allow an ARG of char** and
8481 a deduced ARG of const char**. However, overload
8482 resolution will subsequently invalidate the candidate, so
8483 this is probably OK. */
8484 sub_strict
= strict
;
8486 if (TREE_CODE (TREE_TYPE (arg
)) != RECORD_TYPE
)
8487 /* The derived-to-base conversion only persists through one
8488 level of pointers. */
8489 sub_strict
&= ~UNIFY_ALLOW_DERIVED
;
8491 return unify (tparms
, targs
, TREE_TYPE (parm
),
8492 TREE_TYPE (arg
), sub_strict
);
8495 case REFERENCE_TYPE
:
8496 if (TREE_CODE (arg
) != REFERENCE_TYPE
)
8498 return unify (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
8502 if (TREE_CODE (arg
) != ARRAY_TYPE
)
8504 if ((TYPE_DOMAIN (parm
) == NULL_TREE
)
8505 != (TYPE_DOMAIN (arg
) == NULL_TREE
))
8507 if (TYPE_DOMAIN (parm
) != NULL_TREE
8508 && unify (tparms
, targs
, TYPE_DOMAIN (parm
),
8509 TYPE_DOMAIN (arg
), UNIFY_ALLOW_NONE
) != 0)
8511 return unify (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
8519 if (TREE_CODE (arg
) != TREE_CODE (parm
))
8522 if (TREE_CODE (parm
) == INTEGER_TYPE
8523 && TREE_CODE (TYPE_MAX_VALUE (parm
)) != INTEGER_CST
)
8525 if (TYPE_MIN_VALUE (parm
) && TYPE_MIN_VALUE (arg
)
8526 && unify (tparms
, targs
, TYPE_MIN_VALUE (parm
),
8527 TYPE_MIN_VALUE (arg
), UNIFY_ALLOW_INTEGER
))
8529 if (TYPE_MAX_VALUE (parm
) && TYPE_MAX_VALUE (arg
)
8530 && unify (tparms
, targs
, TYPE_MAX_VALUE (parm
),
8531 TYPE_MAX_VALUE (arg
), UNIFY_ALLOW_INTEGER
))
8534 /* We have already checked cv-qualification at the top of the
8536 else if (!same_type_ignoring_top_level_qualifiers_p (arg
, parm
))
8539 /* As far as unification is concerned, this wins. Later checks
8540 will invalidate it if necessary. */
8543 /* Types INTEGER_CST and MINUS_EXPR can come from array bounds. */
8544 /* Type INTEGER_CST can come from ordinary constant template args. */
8546 while (TREE_CODE (arg
) == NOP_EXPR
)
8547 arg
= TREE_OPERAND (arg
, 0);
8549 if (TREE_CODE (arg
) != INTEGER_CST
)
8551 return !tree_int_cst_equal (parm
, arg
);
8556 if (TREE_CODE (arg
) != TREE_VEC
)
8558 if (TREE_VEC_LENGTH (parm
) != TREE_VEC_LENGTH (arg
))
8560 for (i
= 0; i
< TREE_VEC_LENGTH (parm
); ++i
)
8561 if (unify (tparms
, targs
,
8562 TREE_VEC_ELT (parm
, i
), TREE_VEC_ELT (arg
, i
),
8570 if (TREE_CODE (arg
) != TREE_CODE (parm
))
8573 if (TYPE_PTRMEMFUNC_P (parm
))
8575 if (!TYPE_PTRMEMFUNC_P (arg
))
8578 return unify (tparms
, targs
,
8579 TYPE_PTRMEMFUNC_FN_TYPE (parm
),
8580 TYPE_PTRMEMFUNC_FN_TYPE (arg
),
8584 if (CLASSTYPE_TEMPLATE_INFO (parm
))
8588 if (strict
& UNIFY_ALLOW_DERIVED
)
8590 /* First, we try to unify the PARM and ARG directly. */
8591 t
= try_class_unification (tparms
, targs
,
8596 /* Fallback to the special case allowed in
8599 If P is a class, and P has the form
8600 template-id, then A can be a derived class of
8601 the deduced A. Likewise, if P is a pointer to
8602 a class of the form template-id, A can be a
8603 pointer to a derived class pointed to by the
8605 t
= get_template_base (tparms
, targs
,
8608 if (! t
|| t
== error_mark_node
)
8612 else if (CLASSTYPE_TEMPLATE_INFO (arg
)
8613 && (CLASSTYPE_TI_TEMPLATE (parm
)
8614 == CLASSTYPE_TI_TEMPLATE (arg
)))
8615 /* Perhaps PARM is something like S<U> and ARG is S<int>.
8616 Then, we should unify `int' and `U'. */
8619 /* There's no chance of unication succeeding. */
8622 return unify (tparms
, targs
, CLASSTYPE_TI_ARGS (parm
),
8623 CLASSTYPE_TI_ARGS (t
), UNIFY_ALLOW_NONE
);
8625 else if (!same_type_ignoring_top_level_qualifiers_p (parm
, arg
))
8631 if (TREE_CODE (arg
) != TREE_CODE (parm
))
8634 if (unify (tparms
, targs
, TREE_TYPE (parm
),
8635 TREE_TYPE (arg
), UNIFY_ALLOW_NONE
))
8637 return type_unification_real (tparms
, targs
, TYPE_ARG_TYPES (parm
),
8638 TYPE_ARG_TYPES (arg
), 1,
8642 if (TREE_CODE (arg
) != OFFSET_TYPE
)
8644 if (unify (tparms
, targs
, TYPE_OFFSET_BASETYPE (parm
),
8645 TYPE_OFFSET_BASETYPE (arg
), UNIFY_ALLOW_NONE
))
8647 return unify (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
8651 if (arg
!= decl_constant_value (parm
))
8656 /* Matched cases are handled by the ARG == PARM test above. */
8660 if (TREE_CODE (TREE_OPERAND (parm
, 1)) == INTEGER_CST
)
8662 /* We handle this case specially, since it comes up with
8663 arrays. In particular, something like:
8665 template <int N> void f(int (&x)[N]);
8667 Here, we are trying to unify the range type, which
8668 looks like [0 ... (N - 1)]. */
8670 t1
= TREE_OPERAND (parm
, 0);
8671 t2
= TREE_OPERAND (parm
, 1);
8673 t
= fold (build (PLUS_EXPR
, integer_type_node
, arg
, t2
));
8675 return unify (tparms
, targs
, t1
, t
, strict
);
8677 /* else fall through */
8680 if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (TREE_CODE (parm
))))
8681 /* We're looking at an expression. This can happen with
8685 void foo(S<I>, S<I + 2>);
8687 This is a "nondeduced context":
8691 The nondeduced contexts are:
8693 --A type that is a template-id in which one or more of
8694 the template-arguments is an expression that references
8695 a template-parameter.
8697 In these cases, we assume deduction succeeded, but don't
8698 actually infer any unifications. */
8701 sorry ("use of `%s' in template type unification",
8702 tree_code_name
[(int) TREE_CODE (parm
)]);
8708 /* Called if RESULT is explicitly instantiated, or is a member of an
8709 explicitly instantiated class, or if using -frepo and the
8710 instantiation of RESULT has been assigned to this file. */
8713 mark_decl_instantiated (result
, extern_p
)
8717 if (TREE_CODE (result
) != FUNCTION_DECL
)
8718 /* The TREE_PUBLIC flag for function declarations will have been
8719 set correctly by tsubst. */
8720 TREE_PUBLIC (result
) = 1;
8722 /* We used to set this unconditionally; we moved that to
8723 do_decl_instantiation so it wouldn't get set on members of
8724 explicit class template instantiations. But we still need to set
8725 it here for the 'extern template' case in order to suppress
8726 implicit instantiations. */
8728 SET_DECL_EXPLICIT_INSTANTIATION (result
);
8732 DECL_INTERFACE_KNOWN (result
) = 1;
8733 DECL_NOT_REALLY_EXTERN (result
) = 1;
8735 /* Always make artificials weak. */
8736 if (DECL_ARTIFICIAL (result
) && flag_weak
)
8737 comdat_linkage (result
);
8738 /* For WIN32 we also want to put explicit instantiations in
8739 linkonce sections. */
8740 else if (TREE_PUBLIC (result
))
8741 maybe_make_one_only (result
);
8743 else if (TREE_CODE (result
) == FUNCTION_DECL
)
8747 /* Given two function templates PAT1 and PAT2, and explicit template
8748 arguments EXPLICIT_ARGS return:
8750 1 if PAT1 is more specialized than PAT2 as described in [temp.func.order].
8751 -1 if PAT2 is more specialized than PAT1.
8752 0 if neither is more specialized. */
8755 more_specialized (pat1
, pat2
, explicit_args
)
8756 tree pat1
, pat2
, explicit_args
;
8762 = get_bindings_overload (pat1
, DECL_TEMPLATE_RESULT (pat2
), explicit_args
);
8767 = get_bindings_overload (pat2
, DECL_TEMPLATE_RESULT (pat1
), explicit_args
);
8774 /* Given two class template specialization list nodes PAT1 and PAT2, return:
8776 1 if PAT1 is more specialized than PAT2 as described in [temp.class.order].
8777 -1 if PAT2 is more specialized than PAT1.
8778 0 if neither is more specialized. */
8781 more_specialized_class (pat1
, pat2
)
8787 targs
= get_class_bindings (TREE_VALUE (pat1
), TREE_PURPOSE (pat1
),
8788 TREE_PURPOSE (pat2
));
8792 targs
= get_class_bindings (TREE_VALUE (pat2
), TREE_PURPOSE (pat2
),
8793 TREE_PURPOSE (pat1
));
8800 /* Return the template arguments that will produce the function signature
8801 DECL from the function template FN, with the explicit template
8802 arguments EXPLICIT_ARGS. If CHECK_RETTYPE is 1, the return type must
8803 also match. Return NULL_TREE if no satisfactory arguments could be
8807 get_bindings_real (fn
, decl
, explicit_args
, check_rettype
)
8808 tree fn
, decl
, explicit_args
;
8811 int ntparms
= DECL_NTPARMS (fn
);
8812 tree targs
= make_tree_vec (ntparms
);
8814 tree decl_arg_types
;
8817 /* Substitute the explicit template arguments into the type of DECL.
8818 The call to fn_type_unification will handle substitution into the
8820 decl_type
= TREE_TYPE (decl
);
8821 if (explicit_args
&& uses_template_parms (decl_type
))
8824 tree converted_args
;
8826 if (DECL_TEMPLATE_INFO (decl
))
8827 tmpl
= DECL_TI_TEMPLATE (decl
);
8829 /* We can get here for some illegal specializations. */
8833 = (coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (tmpl
),
8834 explicit_args
, NULL_TREE
,
8836 /*require_all_arguments=*/0));
8837 if (converted_args
== error_mark_node
)
8840 decl_type
= tsubst (decl_type
, converted_args
, /*complain=*/0,
8842 if (decl_type
== error_mark_node
)
8846 /* If FN is a static member function, adjust the type of DECL
8848 decl_arg_types
= TYPE_ARG_TYPES (decl_type
);
8849 if (DECL_STATIC_FUNCTION_P (fn
)
8850 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
8851 decl_arg_types
= TREE_CHAIN (decl_arg_types
);
8853 i
= fn_type_unification (fn
, explicit_args
, targs
,
8855 (check_rettype
|| DECL_CONV_FN_P (fn
)
8856 ? TREE_TYPE (decl_type
) : NULL_TREE
),
8865 /* For most uses, we want to check the return type. */
8868 get_bindings (fn
, decl
, explicit_args
)
8869 tree fn
, decl
, explicit_args
;
8871 return get_bindings_real (fn
, decl
, explicit_args
, 1);
8874 /* But for more_specialized, we only care about the parameter types. */
8877 get_bindings_overload (fn
, decl
, explicit_args
)
8878 tree fn
, decl
, explicit_args
;
8880 return get_bindings_real (fn
, decl
, explicit_args
, 0);
8883 /* Return the innermost template arguments that, when applied to a
8884 template specialization whose innermost template parameters are
8885 TPARMS, and whose specialization arguments are ARGS, yield the
8888 For example, suppose we have:
8890 template <class T, class U> struct S {};
8891 template <class T> struct S<T*, int> {};
8893 Then, suppose we want to get `S<double*, int>'. The TPARMS will be
8894 {T}, the PARMS will be {T*, int} and the ARGS will be {double*,
8895 int}. The resulting vector will be {double}, indicating that `T'
8896 is bound to `double'. */
8899 get_class_bindings (tparms
, parms
, args
)
8900 tree tparms
, parms
, args
;
8902 int i
, ntparms
= TREE_VEC_LENGTH (tparms
);
8903 tree vec
= make_tree_vec (ntparms
);
8905 args
= INNERMOST_TEMPLATE_ARGS (args
);
8907 if (unify (tparms
, vec
, parms
, args
, UNIFY_ALLOW_NONE
))
8910 for (i
= 0; i
< ntparms
; ++i
)
8911 if (! TREE_VEC_ELT (vec
, i
))
8917 /* In INSTANTIATIONS is a list of <INSTANTIATION, TEMPLATE> pairs.
8918 Pick the most specialized template, and return the corresponding
8919 instantiation, or if there is no corresponding instantiation, the
8920 template itself. EXPLICIT_ARGS is any template arguments explicity
8921 mentioned in a template-id. If there is no most specialized
8922 template, error_mark_node is returned. If there are no templates
8923 at all, NULL_TREE is returned. */
8926 most_specialized_instantiation (instantiations
, explicit_args
)
8927 tree instantiations
;
8933 if (!instantiations
)
8936 champ
= instantiations
;
8937 for (fn
= TREE_CHAIN (instantiations
); fn
; fn
= TREE_CHAIN (fn
))
8939 fate
= more_specialized (TREE_VALUE (champ
),
8940 TREE_VALUE (fn
), explicit_args
);
8947 fn
= TREE_CHAIN (fn
);
8949 return error_mark_node
;
8955 for (fn
= instantiations
; fn
&& fn
!= champ
; fn
= TREE_CHAIN (fn
))
8957 fate
= more_specialized (TREE_VALUE (champ
),
8958 TREE_VALUE (fn
), explicit_args
);
8960 return error_mark_node
;
8963 return TREE_PURPOSE (champ
) ? TREE_PURPOSE (champ
) : TREE_VALUE (champ
);
8966 /* Return the most specialized of the list of templates in FNS that can
8967 produce an instantiation matching DECL, given the explicit template
8968 arguments EXPLICIT_ARGS. */
8971 most_specialized (fns
, decl
, explicit_args
)
8972 tree fns
, decl
, explicit_args
;
8974 tree candidates
= NULL_TREE
;
8977 for (fn
= fns
; fn
; fn
= TREE_CHAIN (fn
))
8979 tree candidate
= TREE_VALUE (fn
);
8981 args
= get_bindings (candidate
, decl
, explicit_args
);
8983 candidates
= tree_cons (NULL_TREE
, candidate
, candidates
);
8986 return most_specialized_instantiation (candidates
, explicit_args
);
8989 /* If DECL is a specialization of some template, return the most
8990 general such template. Otherwise, returns NULL_TREE.
8994 template <class T> struct S { template <class U> void f(U); };
8996 if TMPL is `template <class U> void S<int>::f(U)' this will return
8997 the full template. This function will not trace past partial
8998 specializations, however. For example, given in addition:
9000 template <class T> struct S<T*> { template <class U> void f(U); };
9002 if TMPL is `template <class U> void S<int*>::f(U)' this will return
9003 `template <class T> template <class U> S<T*>::f(U)'. */
9006 most_general_template (decl
)
9009 /* If DECL is a FUNCTION_DECL, find the TEMPLATE_DECL of which it is
9010 an immediate specialization. */
9011 if (TREE_CODE (decl
) == FUNCTION_DECL
)
9013 if (DECL_TEMPLATE_INFO (decl
)) {
9014 decl
= DECL_TI_TEMPLATE (decl
);
9016 /* The DECL_TI_TEMPLATE can be an IDENTIFIER_NODE for a
9018 if (TREE_CODE (decl
) != TEMPLATE_DECL
)
9024 /* Look for more and more general templates. */
9025 while (DECL_TEMPLATE_INFO (decl
))
9027 /* The DECL_TI_TEMPLATE can be a LOOKUP_EXPR or IDENTIFIER_NODE
9028 in some cases. (See cp-tree.h for details.) */
9029 if (TREE_CODE (DECL_TI_TEMPLATE (decl
)) != TEMPLATE_DECL
)
9032 /* Stop if we run into an explicitly specialized class template. */
9033 if (!DECL_NAMESPACE_SCOPE_P (decl
)
9034 && DECL_CONTEXT (decl
)
9035 && CLASSTYPE_TEMPLATE_SPECIALIZATION (DECL_CONTEXT (decl
)))
9038 decl
= DECL_TI_TEMPLATE (decl
);
9044 /* Return the most specialized of the class template specializations
9045 of TMPL which can produce an instantiation matching ARGS, or
9046 error_mark_node if the choice is ambiguous. */
9049 most_specialized_class (tmpl
, args
)
9053 tree list
= NULL_TREE
;
9058 tmpl
= most_general_template (tmpl
);
9059 for (t
= DECL_TEMPLATE_SPECIALIZATIONS (tmpl
); t
; t
= TREE_CHAIN (t
))
9062 = get_class_bindings (TREE_VALUE (t
), TREE_PURPOSE (t
), args
);
9065 list
= decl_tree_cons (TREE_PURPOSE (t
), TREE_VALUE (t
), list
);
9066 TREE_TYPE (list
) = TREE_TYPE (t
);
9076 for (; t
; t
= TREE_CHAIN (t
))
9078 fate
= more_specialized_class (champ
, t
);
9087 return error_mark_node
;
9093 for (t
= list
; t
&& t
!= champ
; t
= TREE_CHAIN (t
))
9095 fate
= more_specialized_class (champ
, t
);
9097 return error_mark_node
;
9103 /* called from the parser. */
9106 do_decl_instantiation (declspecs
, declarator
, storage
)
9107 tree declspecs
, declarator
, storage
;
9109 tree decl
= grokdeclarator (declarator
, declspecs
, NORMAL
, 0, NULL_TREE
);
9110 tree result
= NULL_TREE
;
9114 /* An error ocurred, for which grokdeclarator has already issued
9115 an appropriate message. */
9117 else if (! DECL_LANG_SPECIFIC (decl
))
9119 cp_error ("explicit instantiation of non-template `%#D'", decl
);
9122 else if (TREE_CODE (decl
) == VAR_DECL
)
9124 /* There is an asymmetry here in the way VAR_DECLs and
9125 FUNCTION_DECLs are handled by grokdeclarator. In the case of
9126 the latter, the DECL we get back will be marked as a
9127 template instantiation, and the appropriate
9128 DECL_TEMPLATE_INFO will be set up. This does not happen for
9129 VAR_DECLs so we do the lookup here. Probably, grokdeclarator
9130 should handle VAR_DECLs as it currently handles
9132 result
= lookup_field (DECL_CONTEXT (decl
), DECL_NAME (decl
), 0, 0);
9133 if (result
&& TREE_CODE (result
) != VAR_DECL
)
9135 cp_error ("no matching template for `%D' found", result
);
9139 else if (TREE_CODE (decl
) != FUNCTION_DECL
)
9141 cp_error ("explicit instantiation of `%#D'", decl
);
9147 /* Check for various error cases. Note that if the explicit
9148 instantiation is legal the RESULT will currently be marked as an
9149 *implicit* instantiation; DECL_EXPLICIT_INSTANTIATION is not set
9150 until we get here. */
9152 if (DECL_TEMPLATE_SPECIALIZATION (result
))
9156 No program shall both explicitly instantiate and explicitly
9157 specialize a template. */
9158 cp_pedwarn ("explicit instantiation of `%#D' after", result
);
9159 cp_pedwarn_at ("explicit specialization here", result
);
9162 else if (DECL_EXPLICIT_INSTANTIATION (result
))
9166 No program shall explicitly instantiate any template more
9169 We check DECL_INTERFACE_KNOWN so as not to complain when the first
9170 instantiation was `extern' and the second is not, and EXTERN_P for
9171 the opposite case. If -frepo, chances are we already got marked
9172 as an explicit instantion because of the repo file. */
9173 if (DECL_INTERFACE_KNOWN (result
) && !extern_p
&& !flag_use_repository
)
9174 cp_pedwarn ("duplicate explicit instantiation of `%#D'", result
);
9176 /* If we've already instantiated the template, just return now. */
9177 if (DECL_INTERFACE_KNOWN (result
))
9180 else if (!DECL_IMPLICIT_INSTANTIATION (result
))
9182 cp_error ("no matching template for `%D' found", result
);
9185 else if (!DECL_TEMPLATE_INFO (result
))
9187 cp_pedwarn ("explicit instantiation of non-template `%#D'", result
);
9191 if (flag_external_templates
)
9194 if (storage
== NULL_TREE
)
9196 else if (storage
== ridpointers
[(int) RID_EXTERN
])
9199 cp_pedwarn ("ISO C++ forbids the use of `extern' on explicit instantiations");
9203 cp_error ("storage class `%D' applied to template instantiation",
9206 SET_DECL_EXPLICIT_INSTANTIATION (result
);
9207 mark_decl_instantiated (result
, extern_p
);
9208 repo_template_instantiated (result
, extern_p
);
9210 instantiate_decl (result
, /*defer_ok=*/1);
9214 mark_class_instantiated (t
, extern_p
)
9218 SET_CLASSTYPE_EXPLICIT_INSTANTIATION (t
);
9219 SET_CLASSTYPE_INTERFACE_KNOWN (t
);
9220 CLASSTYPE_INTERFACE_ONLY (t
) = extern_p
;
9221 CLASSTYPE_VTABLE_NEEDS_WRITING (t
) = ! extern_p
;
9222 TYPE_DECL_SUPPRESS_DEBUG (TYPE_NAME (t
)) = extern_p
;
9225 CLASSTYPE_DEBUG_REQUESTED (t
) = 1;
9226 rest_of_type_compilation (t
, 1);
9230 /* Perform an explicit instantiation of template class T. STORAGE, if
9231 non-null, is the RID for extern, inline or static. COMPLAIN is
9232 non-zero if this is called from the parser, zero if called recursively,
9233 since the standard is unclear (as detailed below). */
9236 do_type_instantiation (t
, storage
, complain
)
9244 if (TREE_CODE (t
) == TYPE_DECL
)
9247 if (! CLASS_TYPE_P (t
) || ! CLASSTYPE_TEMPLATE_INFO (t
))
9249 cp_error ("explicit instantiation of non-template type `%T'", t
);
9255 /* With -fexternal-templates, explicit instantiations are treated the same
9256 as implicit ones. */
9257 if (flag_external_templates
)
9260 if (!COMPLETE_TYPE_P (t
))
9263 cp_error ("explicit instantiation of `%#T' before definition of template",
9268 if (storage
!= NULL_TREE
)
9271 cp_pedwarn("ISO C++ forbids the use of `%s' on explicit instantiations",
9272 IDENTIFIER_POINTER (storage
));
9274 if (storage
== ridpointers
[(int) RID_INLINE
])
9276 else if (storage
== ridpointers
[(int) RID_EXTERN
])
9278 else if (storage
== ridpointers
[(int) RID_STATIC
])
9282 cp_error ("storage class `%D' applied to template instantiation",
9288 if (CLASSTYPE_TEMPLATE_SPECIALIZATION (t
))
9292 No program shall both explicitly instantiate and explicitly
9293 specialize a template. */
9296 cp_error ("explicit instantiation of `%#T' after", t
);
9297 cp_error_at ("explicit specialization here", t
);
9301 else if (CLASSTYPE_EXPLICIT_INSTANTIATION (t
))
9305 No program shall explicitly instantiate any template more
9308 If CLASSTYPE_INTERFACE_ONLY, then the first explicit instantiation
9309 was `extern'. If EXTERN_P then the second is. If -frepo, chances
9310 are we already got marked as an explicit instantion because of the
9311 repo file. All these cases are OK. */
9312 if (!CLASSTYPE_INTERFACE_ONLY (t
) && !extern_p
&& !flag_use_repository
9314 cp_pedwarn ("duplicate explicit instantiation of `%#T'", t
);
9316 /* If we've already instantiated the template, just return now. */
9317 if (!CLASSTYPE_INTERFACE_ONLY (t
))
9321 mark_class_instantiated (t
, extern_p
);
9322 repo_template_instantiated (t
, extern_p
);
9330 /* In contrast to implicit instantiation, where only the
9331 declarations, and not the definitions, of members are
9332 instantiated, we have here:
9336 The explicit instantiation of a class template specialization
9337 implies the instantiation of all of its members not
9338 previously explicitly specialized in the translation unit
9339 containing the explicit instantiation.
9341 Of course, we can't instantiate member template classes, since
9342 we don't have any arguments for them. Note that the standard
9343 is unclear on whether the instatiation of the members are
9344 *explicit* instantiations or not. We choose to be generous,
9345 and not set DECL_EXPLICIT_INSTANTIATION. Therefore, we allow
9346 the explicit instantiation of a class where some of the members
9347 have no definition in the current translation unit. */
9350 for (tmp
= TYPE_METHODS (t
); tmp
; tmp
= TREE_CHAIN (tmp
))
9351 if (TREE_CODE (tmp
) == FUNCTION_DECL
9352 && DECL_TEMPLATE_INSTANTIATION (tmp
))
9354 mark_decl_instantiated (tmp
, extern_p
);
9355 repo_template_instantiated (tmp
, extern_p
);
9357 instantiate_decl (tmp
, /*defer_ok=*/1);
9360 for (tmp
= TYPE_FIELDS (t
); tmp
; tmp
= TREE_CHAIN (tmp
))
9361 if (TREE_CODE (tmp
) == VAR_DECL
&& DECL_TEMPLATE_INSTANTIATION (tmp
))
9363 mark_decl_instantiated (tmp
, extern_p
);
9364 repo_template_instantiated (tmp
, extern_p
);
9366 instantiate_decl (tmp
, /*defer_ok=*/1);
9369 for (tmp
= CLASSTYPE_TAGS (t
); tmp
; tmp
= TREE_CHAIN (tmp
))
9370 if (IS_AGGR_TYPE (TREE_VALUE (tmp
))
9371 && !uses_template_parms (CLASSTYPE_TI_ARGS (TREE_VALUE (tmp
))))
9372 do_type_instantiation (TYPE_MAIN_DECL (TREE_VALUE (tmp
)), storage
, 0);
9376 /* Given a function DECL, which is a specialization of TMPL, modify
9377 DECL to be a re-instantiation of TMPL with the same template
9378 arguments. TMPL should be the template into which tsubst'ing
9379 should occur for DECL, not the most general template.
9381 One reason for doing this is a scenario like this:
9384 void f(const T&, int i);
9386 void g() { f(3, 7); }
9389 void f(const T& t, const int i) { }
9391 Note that when the template is first instantiated, with
9392 instantiate_template, the resulting DECL will have no name for the
9393 first parameter, and the wrong type for the second. So, when we go
9394 to instantiate the DECL, we regenerate it. */
9397 regenerate_decl_from_template (decl
, tmpl
)
9401 /* The most general version of TMPL. */
9403 /* The arguments used to instantiate DECL, from the most general
9410 args
= DECL_TI_ARGS (decl
);
9411 code_pattern
= DECL_TEMPLATE_RESULT (tmpl
);
9413 /* Unregister the specialization so that when we tsubst we will not
9414 just return DECL. We don't have to unregister DECL from TMPL
9415 because if would only be registered there if it were a partial
9416 instantiation of a specialization, which it isn't: it's a full
9418 gen_tmpl
= most_general_template (tmpl
);
9419 unregistered
= unregister_specialization (decl
, gen_tmpl
);
9421 /* If the DECL was not unregistered then something peculiar is
9422 happening: we created a specialization but did not call
9423 register_specialization for it. */
9424 my_friendly_assert (unregistered
, 0);
9426 if (TREE_CODE (decl
) == VAR_DECL
)
9427 /* Make sure that we can see identifiers, and compute access
9428 correctly, for the class members used in the declaration of
9429 this static variable. */
9430 pushclass (DECL_CONTEXT (decl
), 2);
9432 /* Do the substitution to get the new declaration. */
9433 new_decl
= tsubst (code_pattern
, args
, /*complain=*/1, NULL_TREE
);
9435 if (TREE_CODE (decl
) == VAR_DECL
)
9437 /* Set up DECL_INITIAL, since tsubst doesn't. */
9438 DECL_INITIAL (new_decl
) =
9439 tsubst_expr (DECL_INITIAL (code_pattern
), args
,
9440 /*complain=*/1, DECL_TI_TEMPLATE (decl
));
9441 /* Pop the class context we pushed above. */
9444 else if (TREE_CODE (decl
) == FUNCTION_DECL
)
9446 /* Convince duplicate_decls to use the DECL_ARGUMENTS from the
9448 DECL_INITIAL (new_decl
) = error_mark_node
;
9449 /* And don't complain about a duplicate definition. */
9450 DECL_INITIAL (decl
) = NULL_TREE
;
9453 /* The immediate parent of the new template is still whatever it was
9454 before, even though tsubst sets DECL_TI_TEMPLATE up as the most
9455 general template. We also reset the DECL_ASSEMBLER_NAME since
9456 tsubst always calculates the name as if the function in question
9457 were really a template instance, and sometimes, with friend
9458 functions, this is not so. See tsubst_friend_function for
9460 DECL_TI_TEMPLATE (new_decl
) = DECL_TI_TEMPLATE (decl
);
9461 DECL_ASSEMBLER_NAME (new_decl
) = DECL_ASSEMBLER_NAME (decl
);
9462 DECL_RTL (new_decl
) = DECL_RTL (decl
);
9463 DECL_USE_TEMPLATE (new_decl
) = DECL_USE_TEMPLATE (decl
);
9465 /* Call duplicate decls to merge the old and new declarations. */
9466 duplicate_decls (new_decl
, decl
);
9468 /* Now, re-register the specialization. */
9469 register_specialization (decl
, gen_tmpl
, args
);
9472 /* Produce the definition of D, a _DECL generated from a template. If
9473 DEFER_OK is non-zero, then we don't have to actually do the
9474 instantiation now; we just have to do it sometime. */
9477 instantiate_decl (d
, defer_ok
)
9481 tree tmpl
= DECL_TI_TEMPLATE (d
);
9482 tree args
= DECL_TI_ARGS (d
);
9487 int pattern_defined
;
9489 const char *file
= input_filename
;
9491 /* This function should only be used to instantiate templates for
9492 functions and static member variables. */
9493 my_friendly_assert (TREE_CODE (d
) == FUNCTION_DECL
9494 || TREE_CODE (d
) == VAR_DECL
, 0);
9496 /* Don't instantiate cloned functions. Instead, instantiate the
9497 functions they cloned. */
9498 if (TREE_CODE (d
) == FUNCTION_DECL
&& DECL_CLONED_FUNCTION_P (d
))
9499 d
= DECL_CLONED_FUNCTION (d
);
9501 if (DECL_TEMPLATE_INSTANTIATED (d
))
9502 /* D has already been instantiated. It might seem reasonable to
9503 check whether or not D is an explict instantiation, and, if so,
9504 stop here. But when an explicit instantiation is deferred
9505 until the end of the compilation, DECL_EXPLICIT_INSTANTIATION
9506 is set, even though we still need to do the instantiation. */
9509 /* If we already have a specialization of this declaration, then
9510 there's no reason to instantiate it. Note that
9511 retrieve_specialization gives us both instantiations and
9512 specializations, so we must explicitly check
9513 DECL_TEMPLATE_SPECIALIZATION. */
9514 gen_tmpl
= most_general_template (tmpl
);
9515 spec
= retrieve_specialization (gen_tmpl
, args
);
9516 if (spec
!= NULL_TREE
&& DECL_TEMPLATE_SPECIALIZATION (spec
))
9519 /* This needs to happen before any tsubsting. */
9520 if (! push_tinst_level (d
))
9523 timevar_push (TV_PARSE
);
9525 /* Set TD to the template whose DECL_TEMPLATE_RESULT is the pattern
9526 for the instantiation. This is not always the most general
9527 template. Consider, for example:
9530 struct S { template <class U> void f();
9531 template <> void f<int>(); };
9533 and an instantiation of S<double>::f<int>. We want TD to be the
9534 specialization S<T>::f<int>, not the more general S<T>::f<U>. */
9536 while (/* An instantiation cannot have a definition, so we need a
9537 more general template. */
9538 DECL_TEMPLATE_INSTANTIATION (td
)
9539 /* We must also deal with friend templates. Given:
9541 template <class T> struct S {
9542 template <class U> friend void f() {};
9545 S<int>::f<U> say, is not an instantiation of S<T>::f<U>,
9546 so far as the language is concerned, but that's still
9547 where we get the pattern for the instantiation from. On
9548 ther hand, if the definition comes outside the class, say:
9550 template <class T> struct S {
9551 template <class U> friend void f();
9553 template <class U> friend void f() {}
9555 we don't need to look any further. That's what the check for
9556 DECL_INITIAL is for. */
9557 || (TREE_CODE (d
) == FUNCTION_DECL
9558 && DECL_FRIEND_PSEUDO_TEMPLATE_INSTANTIATION (td
)
9559 && !DECL_INITIAL (DECL_TEMPLATE_RESULT (td
))))
9561 /* The present template, TD, should not be a definition. If it
9562 were a definition, we should be using it! Note that we
9563 cannot restructure the loop to just keep going until we find
9564 a template with a definition, since that might go too far if
9565 a specialization was declared, but not defined. */
9566 my_friendly_assert (!(TREE_CODE (d
) == VAR_DECL
9567 && !DECL_IN_AGGR_P (DECL_TEMPLATE_RESULT (td
))),
9570 /* Fetch the more general template. */
9571 td
= DECL_TI_TEMPLATE (td
);
9574 code_pattern
= DECL_TEMPLATE_RESULT (td
);
9576 if (TREE_CODE (d
) == FUNCTION_DECL
)
9577 pattern_defined
= (DECL_SAVED_TREE (code_pattern
) != NULL_TREE
);
9579 pattern_defined
= ! DECL_IN_AGGR_P (code_pattern
);
9581 push_to_top_level ();
9582 lineno
= DECL_SOURCE_LINE (d
);
9583 input_filename
= DECL_SOURCE_FILE (d
);
9585 if (pattern_defined
)
9587 repo_template_used (d
);
9589 if (flag_external_templates
&& ! DECL_INTERFACE_KNOWN (d
))
9591 if (flag_alt_external_templates
)
9593 if (interface_unknown
)
9594 warn_if_unknown_interface (d
);
9596 else if (DECL_INTERFACE_KNOWN (code_pattern
))
9598 DECL_INTERFACE_KNOWN (d
) = 1;
9599 DECL_NOT_REALLY_EXTERN (d
) = ! DECL_EXTERNAL (code_pattern
);
9602 warn_if_unknown_interface (code_pattern
);
9606 import_export_decl (d
);
9609 /* Reject all external templates except inline functions. */
9610 if (DECL_INTERFACE_KNOWN (d
)
9611 && ! DECL_NOT_REALLY_EXTERN (d
)
9612 && ! (TREE_CODE (d
) == FUNCTION_DECL
&& DECL_INLINE (d
)))
9615 /* We need to set up DECL_INITIAL regardless of pattern_defined if
9616 the variable is a static const initialized in the class body. */
9617 if (TREE_CODE (d
) == VAR_DECL
9618 && TREE_READONLY (d
)
9619 && DECL_INITIAL (d
) == NULL_TREE
9620 && DECL_INITIAL (code_pattern
) != NULL_TREE
)
9622 /* Defer all other templates, unless we have been explicitly
9623 forbidden from doing so. We restore the source position here
9624 because it's used by add_pending_template. */
9625 else if (! pattern_defined
|| defer_ok
)
9628 input_filename
= file
;
9630 if (at_eof
&& !pattern_defined
9631 && DECL_EXPLICIT_INSTANTIATION (d
))
9634 The definition of a non-exported function template, a
9635 non-exported member function template, or a non-exported
9636 member function or static data member of a class template
9637 shall be present in every translation unit in which it is
9638 explicitly instantiated. */
9639 cp_error ("explicit instantiation of `%D' but no definition available",
9642 add_pending_template (d
);
9646 /* We're now committed to instantiating this template. Mark it as
9647 instantiated so that recursive calls to instantiate_decl do not
9648 try to instantiate it again. */
9649 DECL_TEMPLATE_INSTANTIATED (d
) = 1;
9651 /* Regenerate the declaration in case the template has been modified
9652 by a subsequent redeclaration. */
9653 regenerate_decl_from_template (d
, td
);
9655 /* We already set the file and line above. Reset them now in case
9656 they changed as a result of calling regenerate_decl_from_template. */
9657 lineno
= DECL_SOURCE_LINE (d
);
9658 input_filename
= DECL_SOURCE_FILE (d
);
9660 if (TREE_CODE (d
) == VAR_DECL
)
9662 DECL_IN_AGGR_P (d
) = 0;
9663 if (DECL_INTERFACE_KNOWN (d
))
9664 DECL_EXTERNAL (d
) = ! DECL_NOT_REALLY_EXTERN (d
);
9667 DECL_EXTERNAL (d
) = 1;
9668 DECL_NOT_REALLY_EXTERN (d
) = 1;
9670 cp_finish_decl (d
, DECL_INITIAL (d
), NULL_TREE
, 0);
9672 else if (TREE_CODE (d
) == FUNCTION_DECL
)
9674 htab_t saved_local_specializations
;
9676 /* Save away the current list, in case we are instantiating one
9677 template from within the body of another. */
9678 saved_local_specializations
= local_specializations
;
9680 /* Set up the list of local specializations. */
9681 local_specializations
= htab_create (37,
9686 /* Set up context. */
9687 start_function (NULL_TREE
, d
, NULL_TREE
, SF_PRE_PARSED
);
9688 store_parm_decls ();
9690 /* We already set up __FUNCTION__, etc., so we don't want to do
9692 cp_function_chain
->name_declared
= 1;
9694 /* Substitute into the body of the function. */
9695 tsubst_expr (DECL_SAVED_TREE (code_pattern
), args
,
9696 /*complain=*/1, tmpl
);
9698 /* We don't need the local specializations any more. */
9699 htab_delete (local_specializations
);
9700 local_specializations
= saved_local_specializations
;
9702 /* Finish the function. */
9703 expand_body (finish_function (0));
9706 /* We're not deferring instantiation any more. */
9707 TI_PENDING_TEMPLATE_FLAG (DECL_TEMPLATE_INFO (d
)) = 0;
9711 input_filename
= file
;
9713 pop_from_top_level ();
9716 timevar_pop (TV_PARSE
);
9721 /* Run through the list of templates that we wish we could
9722 instantiate, and instantiate any we can. */
9725 instantiate_pending_templates ()
9728 int instantiated_something
= 0;
9735 t
= &pending_templates
;
9738 tree instantiation
= TREE_VALUE (*t
);
9740 reopen_tinst_level (TREE_PURPOSE (*t
));
9742 if (TYPE_P (instantiation
))
9746 if (!COMPLETE_TYPE_P (instantiation
))
9748 instantiate_class_template (instantiation
);
9749 if (CLASSTYPE_TEMPLATE_INSTANTIATION (instantiation
))
9750 for (fn
= TYPE_METHODS (instantiation
);
9752 fn
= TREE_CHAIN (fn
))
9753 if (! DECL_ARTIFICIAL (fn
))
9754 instantiate_decl (fn
, /*defer_ok=*/0);
9755 if (COMPLETE_TYPE_P (instantiation
))
9757 instantiated_something
= 1;
9762 if (COMPLETE_TYPE_P (instantiation
))
9763 /* If INSTANTIATION has been instantiated, then we don't
9764 need to consider it again in the future. */
9765 *t
= TREE_CHAIN (*t
);
9767 t
= &TREE_CHAIN (*t
);
9771 if (!DECL_TEMPLATE_SPECIALIZATION (instantiation
)
9772 && !DECL_TEMPLATE_INSTANTIATED (instantiation
))
9774 instantiation
= instantiate_decl (instantiation
,
9776 if (DECL_TEMPLATE_INSTANTIATED (instantiation
))
9778 instantiated_something
= 1;
9783 if (DECL_TEMPLATE_SPECIALIZATION (instantiation
)
9784 || DECL_TEMPLATE_INSTANTIATED (instantiation
))
9785 /* If INSTANTIATION has been instantiated, then we don't
9786 need to consider it again in the future. */
9787 *t
= TREE_CHAIN (*t
);
9789 t
= &TREE_CHAIN (*t
);
9792 current_tinst_level
= NULL_TREE
;
9796 /* Go through the things that are template instantiations if we are
9797 using guiding declarations. */
9798 t
= &maybe_templates
;
9805 fn
= TREE_VALUE (*t
);
9807 if (DECL_INITIAL (fn
))
9808 /* If the FN is already defined, then it was either already
9809 instantiated or, even though guiding declarations were
9810 allowed, a non-template definition was provided. */
9814 template = TREE_PURPOSE (*t
);
9815 args
= get_bindings (template, fn
, NULL_TREE
);
9816 fn
= instantiate_template (template, args
);
9817 instantiate_decl (fn
, /*defer_ok=*/0);
9821 /* Remove this entry from the chain. */
9822 *t
= TREE_CHAIN (*t
);
9824 maybe_template_tail
= t
;
9828 return instantiated_something
;
9831 /* Substitute ARGVEC into T, which is a list of initializers for
9832 either base class or a non-static data member. The TREE_PURPOSEs
9833 are DECLs, and the TREE_VALUEs are the initializer values. Used by
9834 instantiate_decl. */
9837 tsubst_initializer_list (t
, argvec
)
9840 tree first
= NULL_TREE
;
9843 for (; t
; t
= TREE_CHAIN (t
))
9849 decl
= tsubst_copy (TREE_PURPOSE (t
), argvec
, /*complain=*/1,
9851 init
= tsubst_expr (TREE_VALUE (t
), argvec
, /*complain=*/1,
9856 else if (TREE_CODE (init
) == TREE_LIST
)
9857 for (val
= init
; val
; val
= TREE_CHAIN (val
))
9858 TREE_VALUE (val
) = convert_from_reference (TREE_VALUE (val
));
9860 init
= convert_from_reference (init
);
9862 *p
= build_tree_list (decl
, init
);
9863 p
= &TREE_CHAIN (*p
);
9868 /* D is an undefined function declaration in the presence of templates with
9869 the same name, listed in FNS. If one of them can produce D as an
9870 instantiation, remember this so we can instantiate it at EOF if D has
9871 not been defined by that time. */
9874 add_maybe_template (d
, fns
)
9879 if (DECL_MAYBE_TEMPLATE (d
))
9882 t
= most_specialized (fns
, d
, NULL_TREE
);
9885 if (t
== error_mark_node
)
9887 cp_error ("ambiguous template instantiation for `%D'", d
);
9891 *maybe_template_tail
= tree_cons (t
, d
, NULL_TREE
);
9892 maybe_template_tail
= &TREE_CHAIN (*maybe_template_tail
);
9893 DECL_MAYBE_TEMPLATE (d
) = 1;
9896 /* Set CURRENT_ACCESS_SPECIFIER based on the protection of DECL. */
9899 set_current_access_from_decl (decl
)
9902 if (TREE_PRIVATE (decl
))
9903 current_access_specifier
= access_private_node
;
9904 else if (TREE_PROTECTED (decl
))
9905 current_access_specifier
= access_protected_node
;
9907 current_access_specifier
= access_public_node
;
9910 /* Instantiate an enumerated type. TAG is the template type, NEWTAG
9911 is the instantiation (which should have been created with
9912 start_enum) and ARGS are the template arguments to use. */
9915 tsubst_enum (tag
, newtag
, args
)
9922 for (e
= TYPE_VALUES (tag
); e
; e
= TREE_CHAIN (e
))
9926 /* Note that in a template enum, the TREE_VALUE is the
9927 CONST_DECL, not the corresponding INTEGER_CST. */
9928 value
= tsubst_expr (DECL_INITIAL (TREE_VALUE (e
)),
9929 args
, /*complain=*/1,
9932 /* Give this enumeration constant the correct access. */
9933 set_current_access_from_decl (TREE_VALUE (e
));
9935 /* Actually build the enumerator itself. */
9936 build_enumerator (TREE_PURPOSE (e
), value
, newtag
);
9939 finish_enum (newtag
);
9942 /* DECL is a FUNCTION_DECL that is a template specialization. Return
9943 its type -- but without substituting the innermost set of template
9944 arguments. So, innermost set of template parameters will appear in
9945 the type. If CONTEXTP is non-NULL, then the partially substituted
9946 DECL_CONTEXT (if any) will also be filled in. Similarly, TPARMSP
9947 will be filled in with the substituted template parameters, if it
9951 get_mostly_instantiated_function_type (decl
, contextp
, tparmsp
)
9956 tree context
= NULL_TREE
;
9963 tmpl
= most_general_template (DECL_TI_TEMPLATE (decl
));
9964 targs
= DECL_TI_ARGS (decl
);
9965 tparms
= DECL_TEMPLATE_PARMS (tmpl
);
9966 parm_depth
= TMPL_PARMS_DEPTH (tparms
);
9968 /* There should be as many levels of arguments as there are levels
9970 my_friendly_assert (parm_depth
== TMPL_ARGS_DEPTH (targs
), 0);
9972 fn_type
= TREE_TYPE (tmpl
);
9973 if (DECL_STATIC_FUNCTION_P (decl
))
9974 context
= DECL_CONTEXT (decl
);
9976 if (parm_depth
== 1)
9977 /* No substitution is necessary. */
9984 /* Replace the innermost level of the TARGS with NULL_TREEs to
9985 let tsubst know not to subsitute for those parameters. */
9986 partial_args
= make_tree_vec (TREE_VEC_LENGTH (targs
));
9987 for (i
= 1; i
< TMPL_ARGS_DEPTH (targs
); ++i
)
9988 SET_TMPL_ARGS_LEVEL (partial_args
, i
,
9989 TMPL_ARGS_LEVEL (targs
, i
));
9990 SET_TMPL_ARGS_LEVEL (partial_args
,
9991 TMPL_ARGS_DEPTH (targs
),
9992 make_tree_vec (DECL_NTPARMS (tmpl
)));
9994 /* Now, do the (partial) substitution to figure out the
9995 appropriate function type. */
9996 fn_type
= tsubst (fn_type
, partial_args
, /*complain=*/1, NULL_TREE
);
9997 if (DECL_STATIC_FUNCTION_P (decl
))
9998 context
= tsubst (context
, partial_args
, /*complain=*/1, NULL_TREE
);
10000 /* Substitute into the template parameters to obtain the real
10001 innermost set of parameters. This step is important if the
10002 innermost set of template parameters contains value
10003 parameters whose types depend on outer template parameters. */
10004 TREE_VEC_LENGTH (partial_args
)--;
10005 tparms
= tsubst_template_parms (tparms
, partial_args
, /*complain=*/1);
10009 *contextp
= context
;
10016 /* Set the DECL_ASSEMBLER_NAME for DECL, which is a FUNCTION_DECL that
10017 is either an instantiation or specialization of a template
10021 set_mangled_name_for_template_decl (decl
)
10024 tree context
= NULL_TREE
;
10031 my_friendly_assert (TREE_CODE (decl
) == FUNCTION_DECL
, 0);
10032 my_friendly_assert (DECL_TEMPLATE_INFO (decl
) != NULL_TREE
, 0);
10034 /* Under the new ABI, we don't need special machinery. */
10037 set_mangled_name_for_decl (decl
);
10041 /* The names of template functions must be mangled so as to indicate
10042 what template is being specialized with what template arguments.
10043 For example, each of the following three functions must get
10044 different mangled names:
10047 template <> void f<7>(int);
10048 template <> void f<8>(int); */
10050 targs
= DECL_TI_ARGS (decl
);
10051 if (uses_template_parms (targs
))
10052 /* This DECL is for a partial instantiation. There's no need to
10053 mangle the name of such an entity. */
10056 /* We now compute the PARMS and RET_TYPE to give to
10057 build_decl_overload_real. The PARMS and RET_TYPE are the
10058 parameter and return types of the template, after all but the
10059 innermost template arguments have been substituted, not the
10060 parameter and return types of the function DECL. For example,
10063 template <class T> T f(T);
10065 both PARMS and RET_TYPE should be `T' even if DECL is `int f(int)'.
10066 A more subtle example is:
10068 template <class T> struct S { template <class U> void f(T, U); }
10070 Here, if DECL is `void S<int>::f(int, double)', PARMS should be
10071 {int, U}. Thus, the args that we want to subsitute into the
10072 return and parameter type for the function are those in TARGS,
10073 with the innermost level omitted. */
10074 fn_type
= get_mostly_instantiated_function_type (decl
, &context
, &tparms
);
10076 /* Now, get the innermost parameters and arguments, and figure out
10077 the parameter and return types. */
10078 tparms
= INNERMOST_TEMPLATE_PARMS (tparms
);
10079 targs
= INNERMOST_TEMPLATE_ARGS (targs
);
10080 ret_type
= TREE_TYPE (fn_type
);
10081 parm_types
= TYPE_ARG_TYPES (fn_type
);
10083 /* For a static member function, we generate a fake `this' pointer,
10084 for the purposes of mangling. This indicates of which class the
10085 function is a member. Because of:
10089 There shall not be a static and a nonstatic member function
10090 with the same name and the same parameter types
10092 we don't have to worry that this will result in a clash with a
10093 non-static member function. */
10094 if (DECL_STATIC_FUNCTION_P (decl
))
10095 parm_types
= hash_tree_chain (build_pointer_type (context
), parm_types
);
10097 /* There should be the same number of template parameters as
10098 template arguments. */
10099 my_friendly_assert (TREE_VEC_LENGTH (tparms
) == TREE_VEC_LENGTH (targs
),
10102 /* Actually set the DECL_ASSEMBLER_NAME. */
10103 DECL_ASSEMBLER_NAME (decl
)
10104 = build_decl_overload_real (decl
, parm_types
, ret_type
,
10106 DECL_FUNCTION_MEMBER_P (decl
)
10107 + DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (decl
));
10110 /* Return truthvalue if we're processing a template different from
10111 the last one involved in diagnotics. */
10113 problematic_instantiation_changed ()
10115 return last_template_error_tick
!= tinst_level_tick
;
10118 /* Remember current template involved in diagnostics. */
10120 record_last_problematic_instantiation ()
10122 last_template_error_tick
= tinst_level_tick
;
10126 current_instantiation ()
10128 return current_tinst_level
;