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, 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 tree get_bindings_order
PARAMS ((tree
, tree
, int));
124 static int for_each_template_parm
PARAMS ((tree
, tree_fn_t
, void*));
125 static tree build_template_parm_index
PARAMS ((int, int, int, tree
, tree
));
126 static int inline_needs_template_parms
PARAMS ((tree
));
127 static void push_inline_template_parms_recursive
PARAMS ((tree
, int));
128 static tree retrieve_specialization
PARAMS ((tree
, tree
));
129 static tree retrieve_local_specialization
PARAMS ((tree
));
130 static tree register_specialization
PARAMS ((tree
, tree
, tree
));
131 static void register_local_specialization
PARAMS ((tree
, tree
));
132 static int unregister_specialization
PARAMS ((tree
, tree
));
133 static tree reduce_template_parm_level
PARAMS ((tree
, tree
, int));
134 static tree build_template_decl
PARAMS ((tree
, tree
));
135 static int mark_template_parm
PARAMS ((tree
, void *));
136 static tree tsubst_friend_function
PARAMS ((tree
, tree
));
137 static tree tsubst_friend_class
PARAMS ((tree
, tree
));
138 static tree get_bindings_real
PARAMS ((tree
, tree
, tree
, int, int));
139 static int template_decl_level
PARAMS ((tree
));
140 static tree maybe_get_template_decl_from_type_decl
PARAMS ((tree
));
141 static int check_cv_quals_for_unify
PARAMS ((int, tree
, tree
));
142 static tree tsubst_template_arg_vector
PARAMS ((tree
, tree
, int));
143 static tree tsubst_template_parms
PARAMS ((tree
, tree
, int));
144 static void regenerate_decl_from_template
PARAMS ((tree
, tree
));
145 static tree most_specialized
PARAMS ((tree
, tree
, tree
));
146 static tree most_specialized_class
PARAMS ((tree
, tree
));
147 static void set_mangled_name_for_template_decl
PARAMS ((tree
));
148 static int template_class_depth_real
PARAMS ((tree
, int));
149 static tree tsubst_aggr_type
PARAMS ((tree
, tree
, int, tree
, int));
150 static tree tsubst_decl
PARAMS ((tree
, tree
, tree
, tree
));
151 static tree tsubst_arg_types
PARAMS ((tree
, tree
, int, tree
));
152 static tree tsubst_function_type
PARAMS ((tree
, tree
, int, tree
));
153 static void check_specialization_scope
PARAMS ((void));
154 static tree process_partial_specialization
PARAMS ((tree
));
155 static void set_current_access_from_decl
PARAMS ((tree
));
156 static void check_default_tmpl_args
PARAMS ((tree
, tree
, int, int));
157 static tree tsubst_call_declarator_parms
PARAMS ((tree
, tree
, int, tree
));
158 static tree get_template_base_recursive
PARAMS ((tree
, tree
,
159 tree
, tree
, tree
, int));
160 static tree get_template_base
PARAMS ((tree
, tree
, tree
, tree
));
161 static int verify_class_unification
PARAMS ((tree
, tree
, tree
));
162 static tree try_class_unification
PARAMS ((tree
, tree
, tree
, tree
));
163 static int coerce_template_template_parms
PARAMS ((tree
, tree
, int,
165 static tree determine_specialization
PARAMS ((tree
, tree
, tree
*, int));
166 static int template_args_equal
PARAMS ((tree
, tree
));
167 static void tsubst_default_arguments
PARAMS ((tree
));
168 static tree for_each_template_parm_r
PARAMS ((tree
*, int *, void *));
169 static tree instantiate_clone
PARAMS ((tree
, tree
));
171 /* Called once to initialize pt.c. */
176 ggc_add_tree_root (&pending_templates
, 1);
177 ggc_add_tree_root (&maybe_templates
, 1);
178 ggc_add_tree_root (&saved_trees
, 1);
179 ggc_add_tree_root (¤t_tinst_level
, 1);
182 /* Do any processing required when DECL (a member template declaration
183 using TEMPLATE_PARAMETERS as its innermost parameter list) is
184 finished. Returns the TEMPLATE_DECL corresponding to DECL, unless
185 it is a specialization, in which case the DECL itself is returned. */
188 finish_member_template_decl (decl
)
191 if (decl
== NULL_TREE
|| decl
== void_type_node
)
193 else if (decl
== error_mark_node
)
194 /* By returning NULL_TREE, the parser will just ignore this
195 declaration. We have already issued the error. */
197 else if (TREE_CODE (decl
) == TREE_LIST
)
199 /* Assume that the class is the only declspec. */
200 decl
= TREE_VALUE (decl
);
201 if (IS_AGGR_TYPE (decl
) && CLASSTYPE_TEMPLATE_INFO (decl
)
202 && ! CLASSTYPE_TEMPLATE_SPECIALIZATION (decl
))
204 tree tmpl
= CLASSTYPE_TI_TEMPLATE (decl
);
205 check_member_template (tmpl
);
210 else if (TREE_CODE (decl
) == FIELD_DECL
)
211 cp_error ("data member `%D' cannot be a member template", decl
);
212 else if (DECL_TEMPLATE_INFO (decl
))
214 if (!DECL_TEMPLATE_SPECIALIZATION (decl
))
216 check_member_template (DECL_TI_TEMPLATE (decl
));
217 return DECL_TI_TEMPLATE (decl
);
223 cp_error ("invalid member template declaration `%D'", decl
);
225 return error_mark_node
;
228 /* Returns the template nesting level of the indicated class TYPE.
238 A<T>::B<U> has depth two, while A<T> has depth one.
239 Both A<T>::B<int> and A<int>::B<U> have depth one, if
240 COUNT_SPECIALIZATIONS is 0 or if they are instantiations, not
243 This function is guaranteed to return 0 if passed NULL_TREE so
244 that, for example, `template_class_depth (current_class_type)' is
248 template_class_depth_real (type
, count_specializations
)
250 int count_specializations
;
255 type
&& TREE_CODE (type
) != NAMESPACE_DECL
;
256 type
= (TREE_CODE (type
) == FUNCTION_DECL
)
257 ? CP_DECL_CONTEXT (type
) : TYPE_CONTEXT (type
))
259 if (TREE_CODE (type
) != FUNCTION_DECL
)
261 if (CLASSTYPE_TEMPLATE_INFO (type
)
262 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (type
))
263 && ((count_specializations
264 && CLASSTYPE_TEMPLATE_SPECIALIZATION (type
))
265 || uses_template_parms (CLASSTYPE_TI_ARGS (type
))))
270 if (DECL_TEMPLATE_INFO (type
)
271 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (type
))
272 && ((count_specializations
273 && DECL_TEMPLATE_SPECIALIZATION (type
))
274 || uses_template_parms (DECL_TI_ARGS (type
))))
282 /* Returns the template nesting level of the indicated class TYPE.
283 Like template_class_depth_real, but instantiations do not count in
287 template_class_depth (type
)
290 return template_class_depth_real (type
, /*count_specializations=*/0);
293 /* Returns 1 if processing DECL as part of do_pending_inlines
294 needs us to push template parms. */
297 inline_needs_template_parms (decl
)
300 if (! DECL_TEMPLATE_INFO (decl
))
303 return (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (most_general_template (decl
)))
304 > (processing_template_decl
+ DECL_TEMPLATE_SPECIALIZATION (decl
)));
307 /* Subroutine of maybe_begin_member_template_processing.
308 Push the template parms in PARMS, starting from LEVELS steps into the
309 chain, and ending at the beginning, since template parms are listed
313 push_inline_template_parms_recursive (parmlist
, levels
)
317 tree parms
= TREE_VALUE (parmlist
);
321 push_inline_template_parms_recursive (TREE_CHAIN (parmlist
), levels
- 1);
323 ++processing_template_decl
;
324 current_template_parms
325 = tree_cons (size_int (processing_template_decl
),
326 parms
, current_template_parms
);
327 TEMPLATE_PARMS_FOR_INLINE (current_template_parms
) = 1;
330 for (i
= 0; i
< TREE_VEC_LENGTH (parms
); ++i
)
332 tree parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
333 my_friendly_assert (DECL_P (parm
), 0);
335 switch (TREE_CODE (parm
))
344 /* Make a CONST_DECL as is done in process_template_parm.
345 It is ugly that we recreate this here; the original
346 version built in process_template_parm is no longer
348 tree decl
= build_decl (CONST_DECL
, DECL_NAME (parm
),
350 DECL_ARTIFICIAL (decl
) = 1;
351 DECL_INITIAL (decl
) = DECL_INITIAL (parm
);
352 SET_DECL_TEMPLATE_PARM_P (decl
);
358 my_friendly_abort (0);
363 /* Restore the template parameter context for a member template or
364 a friend template defined in a class definition. */
367 maybe_begin_member_template_processing (decl
)
373 if (inline_needs_template_parms (decl
))
375 parms
= DECL_TEMPLATE_PARMS (most_general_template (decl
));
376 levels
= TMPL_PARMS_DEPTH (parms
) - processing_template_decl
;
378 if (DECL_TEMPLATE_SPECIALIZATION (decl
))
381 parms
= TREE_CHAIN (parms
);
384 push_inline_template_parms_recursive (parms
, levels
);
387 /* Remember how many levels of template parameters we pushed so that
388 we can pop them later. */
389 if (!inline_parm_levels
)
390 VARRAY_INT_INIT (inline_parm_levels
, 4, "inline_parm_levels");
391 if (inline_parm_levels_used
== inline_parm_levels
->num_elements
)
392 VARRAY_GROW (inline_parm_levels
, 2 * inline_parm_levels_used
);
393 VARRAY_INT (inline_parm_levels
, inline_parm_levels_used
) = levels
;
394 ++inline_parm_levels_used
;
397 /* Undo the effects of begin_member_template_processing. */
400 maybe_end_member_template_processing ()
404 if (!inline_parm_levels_used
)
407 --inline_parm_levels_used
;
409 i
< VARRAY_INT (inline_parm_levels
, inline_parm_levels_used
);
412 --processing_template_decl
;
413 current_template_parms
= TREE_CHAIN (current_template_parms
);
418 /* Returns non-zero iff T is a member template function. We must be
421 template <class T> class C { void f(); }
423 Here, f is a template function, and a member, but not a member
424 template. This function does not concern itself with the origin of
425 T, only its present state. So if we have
427 template <class T> class C { template <class U> void f(U); }
429 then neither C<int>::f<char> nor C<T>::f<double> is considered
430 to be a member template. But, `template <class U> void
431 C<int>::f(U)' is considered a member template. */
434 is_member_template (t
)
437 if (!DECL_FUNCTION_TEMPLATE_P (t
))
438 /* Anything that isn't a function or a template function is
439 certainly not a member template. */
442 /* A local class can't have member templates. */
443 if (decl_function_context (t
))
446 return (DECL_FUNCTION_MEMBER_P (DECL_TEMPLATE_RESULT (t
))
447 /* If there are more levels of template parameters than
448 there are template classes surrounding the declaration,
449 then we have a member template. */
450 && (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (t
)) >
451 template_class_depth (DECL_CONTEXT (t
))));
455 /* Returns non-zero iff T is a member template class. See
456 is_member_template for a description of what precisely constitutes
457 a member template. */
460 is_member_template_class (t
)
463 if (!DECL_CLASS_TEMPLATE_P (t
))
464 /* Anything that isn't a class template, is certainly not a member
468 if (!DECL_CLASS_SCOPE_P (t
))
469 /* Anything whose context isn't a class type is surely not a
473 /* If there are more levels of template parameters than there are
474 template classes surrounding the declaration, then we have a
476 return (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (t
)) >
477 template_class_depth (DECL_CONTEXT (t
)));
481 /* Return a new template argument vector which contains all of ARGS,
482 but has as its innermost set of arguments the EXTRA_ARGS. */
485 add_to_template_args (args
, extra_args
)
494 extra_depth
= TMPL_ARGS_DEPTH (extra_args
);
495 new_args
= make_tree_vec (TMPL_ARGS_DEPTH (args
) + extra_depth
);
497 for (i
= 1; i
<= TMPL_ARGS_DEPTH (args
); ++i
)
498 SET_TMPL_ARGS_LEVEL (new_args
, i
, TMPL_ARGS_LEVEL (args
, i
));
500 for (j
= 1; j
<= extra_depth
; ++j
, ++i
)
501 SET_TMPL_ARGS_LEVEL (new_args
, i
, TMPL_ARGS_LEVEL (extra_args
, j
));
506 /* Like add_to_template_args, but only the outermost ARGS are added to
507 the EXTRA_ARGS. In particular, all but TMPL_ARGS_DEPTH
508 (EXTRA_ARGS) levels are added. This function is used to combine
509 the template arguments from a partial instantiation with the
510 template arguments used to attain the full instantiation from the
511 partial instantiation. */
514 add_outermost_template_args (args
, extra_args
)
520 /* If there are more levels of EXTRA_ARGS than there are ARGS,
521 something very fishy is going on. */
522 my_friendly_assert (TMPL_ARGS_DEPTH (args
) >= TMPL_ARGS_DEPTH (extra_args
),
525 /* If *all* the new arguments will be the EXTRA_ARGS, just return
527 if (TMPL_ARGS_DEPTH (args
) == TMPL_ARGS_DEPTH (extra_args
))
530 /* For the moment, we make ARGS look like it contains fewer levels. */
531 TREE_VEC_LENGTH (args
) -= TMPL_ARGS_DEPTH (extra_args
);
533 new_args
= add_to_template_args (args
, extra_args
);
535 /* Now, we restore ARGS to its full dimensions. */
536 TREE_VEC_LENGTH (args
) += TMPL_ARGS_DEPTH (extra_args
);
541 /* Return the N levels of innermost template arguments from the ARGS. */
544 get_innermost_template_args (args
, n
)
552 my_friendly_assert (n
>= 0, 20000603);
554 /* If N is 1, just return the innermost set of template arguments. */
556 return TMPL_ARGS_LEVEL (args
, TMPL_ARGS_DEPTH (args
));
558 /* If we're not removing anything, just return the arguments we were
560 extra_levels
= TMPL_ARGS_DEPTH (args
) - n
;
561 my_friendly_assert (extra_levels
>= 0, 20000603);
562 if (extra_levels
== 0)
565 /* Make a new set of arguments, not containing the outer arguments. */
566 new_args
= make_tree_vec (n
);
567 for (i
= 1; i
<= n
; ++i
)
568 SET_TMPL_ARGS_LEVEL (new_args
, i
,
569 TMPL_ARGS_LEVEL (args
, i
+ extra_levels
));
574 /* We've got a template header coming up; push to a new level for storing
578 begin_template_parm_list ()
580 /* We use a non-tag-transparent scope here, which causes pushtag to
581 put tags in this scope, rather than in the enclosing class or
582 namespace scope. This is the right thing, since we want
583 TEMPLATE_DECLS, and not TYPE_DECLS for template classes. For a
584 global template class, push_template_decl handles putting the
585 TEMPLATE_DECL into top-level scope. For a nested template class,
588 template <class T> struct S1 {
589 template <class T> struct S2 {};
592 pushtag contains special code to call pushdecl_with_scope on the
593 TEMPLATE_DECL for S2. */
594 begin_scope (sk_template_parms
);
595 ++processing_template_decl
;
596 ++processing_template_parmlist
;
597 note_template_header (0);
600 /* This routine is called when a specialization is declared. If it is
601 illegal to declare a specialization here, an error is reported. */
604 check_specialization_scope ()
606 tree scope
= current_scope ();
610 An explicit specialization shall be declared in the namespace of
611 which the template is a member, or, for member templates, in the
612 namespace of which the enclosing class or enclosing class
613 template is a member. An explicit specialization of a member
614 function, member class or static data member of a class template
615 shall be declared in the namespace of which the class template
617 if (scope
&& TREE_CODE (scope
) != NAMESPACE_DECL
)
618 cp_error ("explicit specialization in non-namespace scope `%D'",
623 In an explicit specialization declaration for a member of a class
624 template or a member template that appears in namespace scope,
625 the member template and some of its enclosing class templates may
626 remain unspecialized, except that the declaration shall not
627 explicitly specialize a class member template if its enclosing
628 class templates are not explicitly specialized as well. */
629 if (current_template_parms
)
630 cp_error ("enclosing class templates are not explicitly specialized");
633 /* We've just seen template <>. */
636 begin_specialization ()
638 begin_scope (sk_template_spec
);
639 note_template_header (1);
640 check_specialization_scope ();
643 /* Called at then end of processing a declaration preceded by
647 end_specialization ()
650 reset_specialization ();
653 /* Any template <>'s that we have seen thus far are not referring to a
654 function specialization. */
657 reset_specialization ()
659 processing_specialization
= 0;
660 template_header_count
= 0;
663 /* We've just seen a template header. If SPECIALIZATION is non-zero,
664 it was of the form template <>. */
667 note_template_header (specialization
)
670 processing_specialization
= specialization
;
671 template_header_count
++;
674 /* We're beginning an explicit instantiation. */
677 begin_explicit_instantiation ()
679 ++processing_explicit_instantiation
;
684 end_explicit_instantiation ()
686 my_friendly_assert(processing_explicit_instantiation
> 0, 0);
687 --processing_explicit_instantiation
;
690 /* The TYPE is being declared. If it is a template type, that means it
691 is a partial specialization. Do appropriate error-checking. */
694 maybe_process_partial_specialization (type
)
697 if (IS_AGGR_TYPE (type
) && CLASSTYPE_USE_TEMPLATE (type
))
699 if (CLASSTYPE_IMPLICIT_INSTANTIATION (type
)
700 && !COMPLETE_TYPE_P (type
))
702 if (current_namespace
703 != decl_namespace_context (CLASSTYPE_TI_TEMPLATE (type
)))
705 cp_pedwarn ("specializing `%#T' in different namespace", type
);
706 cp_pedwarn_at (" from definition of `%#D'",
707 CLASSTYPE_TI_TEMPLATE (type
));
709 SET_CLASSTYPE_TEMPLATE_SPECIALIZATION (type
);
710 if (processing_template_decl
)
711 push_template_decl (TYPE_MAIN_DECL (type
));
713 else if (CLASSTYPE_TEMPLATE_INSTANTIATION (type
))
714 cp_error ("specialization of `%T' after instantiation", type
);
716 else if (processing_specialization
)
717 cp_error ("explicit specialization of non-template `%T'", type
);
720 /* Retrieve the specialization (in the sense of [temp.spec] - a
721 specialization is either an instantiation or an explicit
722 specialization) of TMPL for the given template ARGS. If there is
723 no such specialization, return NULL_TREE. The ARGS are a vector of
724 arguments, or a vector of vectors of arguments, in the case of
725 templates with more than one level of parameters. */
728 retrieve_specialization (tmpl
, args
)
734 my_friendly_assert (TREE_CODE (tmpl
) == TEMPLATE_DECL
, 0);
736 /* There should be as many levels of arguments as there are
737 levels of parameters. */
738 my_friendly_assert (TMPL_ARGS_DEPTH (args
)
739 == TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl
)),
742 for (s
= DECL_TEMPLATE_SPECIALIZATIONS (tmpl
);
745 if (comp_template_args (TREE_PURPOSE (s
), args
))
746 return TREE_VALUE (s
);
751 /* Like retrieve_specialization, but for local declarations. */
754 retrieve_local_specialization (tmpl
)
757 return (tree
) htab_find (local_specializations
, tmpl
);
760 /* Returns non-zero iff DECL is a specialization of TMPL. */
763 is_specialization_of (decl
, tmpl
)
769 if (TREE_CODE (decl
) == FUNCTION_DECL
)
773 t
= DECL_TEMPLATE_INFO (t
) ? DECL_TI_TEMPLATE (t
) : NULL_TREE
)
779 my_friendly_assert (TREE_CODE (decl
) == TYPE_DECL
, 0);
781 for (t
= TREE_TYPE (decl
);
783 t
= CLASSTYPE_USE_TEMPLATE (t
)
784 ? TREE_TYPE (CLASSTYPE_TI_TEMPLATE (t
)) : NULL_TREE
)
785 if (same_type_ignoring_top_level_qualifiers_p (t
, TREE_TYPE (tmpl
)))
792 /* Register the specialization SPEC as a specialization of TMPL with
793 the indicated ARGS. Returns SPEC, or an equivalent prior
794 declaration, if available. */
797 register_specialization (spec
, tmpl
, args
)
804 my_friendly_assert (TREE_CODE (tmpl
) == TEMPLATE_DECL
, 0);
806 if (TREE_CODE (spec
) == FUNCTION_DECL
807 && uses_template_parms (DECL_TI_ARGS (spec
)))
808 /* This is the FUNCTION_DECL for a partial instantiation. Don't
809 register it; we want the corresponding TEMPLATE_DECL instead.
810 We use `uses_template_parms (DECL_TI_ARGS (spec))' rather than
811 the more obvious `uses_template_parms (spec)' to avoid problems
812 with default function arguments. In particular, given
815 template <class T> void f(T t1, T t = T())
817 the default argument expression is not substituted for in an
818 instantiation unless and until it is actually needed. */
821 /* There should be as many levels of arguments as there are
822 levels of parameters. */
823 my_friendly_assert (TMPL_ARGS_DEPTH (args
)
824 == TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl
)),
827 for (s
= DECL_TEMPLATE_SPECIALIZATIONS (tmpl
);
831 tree fn
= TREE_VALUE (s
);
833 /* We can sometimes try to re-register a specialization that we've
834 already got. In particular, regenerate_decl_from_template
835 calls duplicate_decls which will update the specialization
836 list. But, we'll still get called again here anyhow. It's
837 more convenient to simply allow this than to try to prevent it. */
840 else if (comp_template_args (TREE_PURPOSE (s
), args
))
842 if (DECL_TEMPLATE_SPECIALIZATION (spec
))
844 if (DECL_TEMPLATE_INSTANTIATION (fn
))
847 || DECL_EXPLICIT_INSTANTIATION (fn
))
849 cp_error ("specialization of %D after instantiation",
855 /* This situation should occur only if the first
856 specialization is an implicit instantiation,
857 the second is an explicit specialization, and
858 the implicit instantiation has not yet been
859 used. That situation can occur if we have
860 implicitly instantiated a member function and
861 then specialized it later.
863 We can also wind up here if a friend
864 declaration that looked like an instantiation
865 turns out to be a specialization:
867 template <class T> void foo(T);
868 class S { friend void foo<>(int) };
869 template <> void foo(int);
871 We transform the existing DECL in place so that
872 any pointers to it become pointers to the
875 If there was a definition for the template, but
876 not for the specialization, we want this to
877 look as if there is no definition, and vice
879 DECL_INITIAL (fn
) = NULL_TREE
;
880 duplicate_decls (spec
, fn
);
885 else if (DECL_TEMPLATE_SPECIALIZATION (fn
))
887 duplicate_decls (spec
, fn
);
894 DECL_TEMPLATE_SPECIALIZATIONS (tmpl
)
895 = tree_cons (args
, spec
, DECL_TEMPLATE_SPECIALIZATIONS (tmpl
));
900 /* Unregister the specialization SPEC as a specialization of TMPL.
901 Returns nonzero if the SPEC was listed as a specialization of
905 unregister_specialization (spec
, tmpl
)
911 for (s
= &DECL_TEMPLATE_SPECIALIZATIONS (tmpl
);
913 s
= &TREE_CHAIN (*s
))
914 if (TREE_VALUE (*s
) == spec
)
916 *s
= TREE_CHAIN (*s
);
923 /* Like register_specialization, but for local declarations. We are
924 registering SPEC, an instantiation of TMPL. */
927 register_local_specialization (spec
, tmpl
)
933 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 of 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 /* Inherit default function arguments from the template
1546 DECL is specializing. */
1548 tree t1
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
1549 tree t2
= TYPE_ARG_TYPES (TREE_TYPE (DECL_TEMPLATE_RESULT (tmpl
)));
1551 /* DECL may contain more parameters than TMPL due to the extra
1552 in-charge parameter in constructors and destructors. */
1553 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
1554 t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
);
1555 if (DECL_HAS_IN_CHARGE_PARM_P (decl
))
1556 t1
= TREE_CHAIN (t1
);
1558 /* Note that we do not need to reparse default arguments,
1559 since explicit specialization cannot be declared in
1560 class scope as in [temp.expl.spec]. */
1561 for (; t1
&& t2
; t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
))
1563 if (TREE_PURPOSE (t2
))
1564 TREE_PURPOSE (t1
) = TREE_PURPOSE (t2
);
1567 my_friendly_assert (t1
== NULL_TREE
&& t2
== NULL_TREE
, 20001211);
1570 /* Set up the DECL_TEMPLATE_INFO for DECL. */
1571 DECL_TEMPLATE_INFO (decl
) = tree_cons (tmpl
, targs
, NULL_TREE
);
1573 /* Mangle the function name appropriately. Note that we do
1574 not mangle specializations of non-template member
1575 functions of template classes, e.g. with
1577 template <class T> struct S { void f(); }
1579 and given the specialization
1581 template <> void S<int>::f() {}
1583 we do not mangle S<int>::f() here. That's because it's
1584 just an ordinary member function and doesn't need special
1585 treatment. We do this here so that the ordinary,
1586 non-template, name-mangling algorithm will not be used
1588 if ((is_member_template (tmpl
) || ctype
== NULL_TREE
)
1589 && name_mangling_version
>= 1)
1590 set_mangled_name_for_template_decl (decl
);
1592 if (is_friend
&& !have_def
)
1593 /* This is not really a declaration of a specialization.
1594 It's just the name of an instantiation. But, it's not
1595 a request for an instantiation, either. */
1596 SET_DECL_IMPLICIT_INSTANTIATION (decl
);
1598 /* Register this specialization so that we can find it
1600 decl
= register_specialization (decl
, gen_tmpl
, targs
);
1607 /* TYPE is being declared. Verify that the use of template headers
1608 and such is reasonable. Issue error messages if not. */
1611 maybe_check_template_type (type
)
1614 if (template_header_count
)
1616 /* We are in the scope of some `template <...>' header. */
1619 = template_class_depth_real (TYPE_CONTEXT (type
),
1620 /*count_specializations=*/1);
1622 if (template_header_count
<= context_depth
)
1623 /* This is OK; the template headers are for the context. We
1624 are actually too lenient here; like
1625 check_explicit_specialization we should consider the number
1626 of template types included in the actual declaration. For
1629 template <class T> struct S {
1630 template <class U> template <class V>
1636 template <class T> struct S {
1637 template <class U> struct I;
1640 template <class T> template <class U.
1645 else if (template_header_count
> context_depth
+ 1)
1646 /* There are two many template parameter lists. */
1647 cp_error ("too many template parameter lists in declaration of `%T'", type
);
1651 /* Returns 1 iff PARMS1 and PARMS2 are identical sets of template
1652 parameters. These are represented in the same format used for
1653 DECL_TEMPLATE_PARMS. */
1655 int comp_template_parms (parms1
, parms2
)
1662 if (parms1
== parms2
)
1665 for (p1
= parms1
, p2
= parms2
;
1666 p1
!= NULL_TREE
&& p2
!= NULL_TREE
;
1667 p1
= TREE_CHAIN (p1
), p2
= TREE_CHAIN (p2
))
1669 tree t1
= TREE_VALUE (p1
);
1670 tree t2
= TREE_VALUE (p2
);
1673 my_friendly_assert (TREE_CODE (t1
) == TREE_VEC
, 0);
1674 my_friendly_assert (TREE_CODE (t2
) == TREE_VEC
, 0);
1676 if (TREE_VEC_LENGTH (t1
) != TREE_VEC_LENGTH (t2
))
1679 for (i
= 0; i
< TREE_VEC_LENGTH (t2
); ++i
)
1681 tree parm1
= TREE_VALUE (TREE_VEC_ELT (t1
, i
));
1682 tree parm2
= TREE_VALUE (TREE_VEC_ELT (t2
, i
));
1684 if (TREE_CODE (parm1
) != TREE_CODE (parm2
))
1687 if (TREE_CODE (parm1
) == TEMPLATE_TYPE_PARM
)
1689 else if (!same_type_p (TREE_TYPE (parm1
), TREE_TYPE (parm2
)))
1694 if ((p1
!= NULL_TREE
) != (p2
!= NULL_TREE
))
1695 /* One set of parameters has more parameters lists than the
1702 /* Complain if DECL shadows a template parameter.
1704 [temp.local]: A template-parameter shall not be redeclared within its
1705 scope (including nested scopes). */
1708 check_template_shadow (decl
)
1713 /* If we're not in a template, we can't possibly shadow a template
1715 if (!current_template_parms
)
1718 /* Figure out what we're shadowing. */
1719 if (TREE_CODE (decl
) == OVERLOAD
)
1720 decl
= OVL_CURRENT (decl
);
1721 olddecl
= IDENTIFIER_VALUE (DECL_NAME (decl
));
1723 /* If there's no previous binding for this name, we're not shadowing
1724 anything, let alone a template parameter. */
1728 /* If we're not shadowing a template parameter, we're done. Note
1729 that OLDDECL might be an OVERLOAD (or perhaps even an
1730 ERROR_MARK), so we can't just blithely assume it to be a _DECL
1732 if (!DECL_P (olddecl
) || !DECL_TEMPLATE_PARM_P (olddecl
))
1735 /* We check for decl != olddecl to avoid bogus errors for using a
1736 name inside a class. We check TPFI to avoid duplicate errors for
1737 inline member templates. */
1739 || TEMPLATE_PARMS_FOR_INLINE (current_template_parms
))
1742 cp_error_at ("declaration of `%#D'", decl
);
1743 cp_error_at (" shadows template parm `%#D'", olddecl
);
1746 /* Return a new TEMPLATE_PARM_INDEX with the indicated INDEX, LEVEL,
1747 ORIG_LEVEL, DECL, and TYPE. */
1750 build_template_parm_index (index
, level
, orig_level
, decl
, type
)
1757 tree t
= make_node (TEMPLATE_PARM_INDEX
);
1758 TEMPLATE_PARM_IDX (t
) = index
;
1759 TEMPLATE_PARM_LEVEL (t
) = level
;
1760 TEMPLATE_PARM_ORIG_LEVEL (t
) = orig_level
;
1761 TEMPLATE_PARM_DECL (t
) = decl
;
1762 TREE_TYPE (t
) = type
;
1767 /* Return a TEMPLATE_PARM_INDEX, similar to INDEX, but whose
1768 TEMPLATE_PARM_LEVEL has been decreased by LEVELS. If such a
1769 TEMPLATE_PARM_INDEX already exists, it is returned; otherwise, a
1770 new one is created. */
1773 reduce_template_parm_level (index
, type
, levels
)
1778 if (TEMPLATE_PARM_DESCENDANTS (index
) == NULL_TREE
1779 || (TEMPLATE_PARM_LEVEL (TEMPLATE_PARM_DESCENDANTS (index
))
1780 != TEMPLATE_PARM_LEVEL (index
) - levels
))
1783 = build_decl (TREE_CODE (TEMPLATE_PARM_DECL (index
)),
1784 DECL_NAME (TEMPLATE_PARM_DECL (index
)),
1787 = build_template_parm_index (TEMPLATE_PARM_IDX (index
),
1788 TEMPLATE_PARM_LEVEL (index
) - levels
,
1789 TEMPLATE_PARM_ORIG_LEVEL (index
),
1791 TEMPLATE_PARM_DESCENDANTS (index
) = t
;
1793 DECL_ARTIFICIAL (decl
) = 1;
1794 SET_DECL_TEMPLATE_PARM_P (decl
);
1796 /* Template template parameters need this. */
1797 DECL_TEMPLATE_PARMS (decl
)
1798 = DECL_TEMPLATE_PARMS (TEMPLATE_PARM_DECL (index
));
1801 return TEMPLATE_PARM_DESCENDANTS (index
);
1804 /* Process information from new template parameter NEXT and append it to the
1805 LIST being built. */
1808 process_template_parm (list
, next
)
1817 my_friendly_assert (TREE_CODE (parm
) == TREE_LIST
, 259);
1818 defval
= TREE_PURPOSE (parm
);
1819 parm
= TREE_VALUE (parm
);
1820 is_type
= TREE_PURPOSE (parm
) == class_type_node
;
1824 tree p
= TREE_VALUE (tree_last (list
));
1826 if (TREE_CODE (p
) == TYPE_DECL
|| TREE_CODE (p
) == TEMPLATE_DECL
)
1827 idx
= TEMPLATE_TYPE_IDX (TREE_TYPE (p
));
1829 idx
= TEMPLATE_PARM_IDX (DECL_INITIAL (p
));
1837 my_friendly_assert (TREE_CODE (TREE_PURPOSE (parm
)) == TREE_LIST
, 260);
1838 /* is a const-param */
1839 parm
= grokdeclarator (TREE_VALUE (parm
), TREE_PURPOSE (parm
),
1840 PARM
, 0, NULL_TREE
);
1844 The top-level cv-qualifiers on the template-parameter are
1845 ignored when determining its type. */
1846 TREE_TYPE (parm
) = TYPE_MAIN_VARIANT (TREE_TYPE (parm
));
1848 /* A template parameter is not modifiable. */
1849 TREE_READONLY (parm
) = 1;
1850 if (IS_AGGR_TYPE (TREE_TYPE (parm
))
1851 && TREE_CODE (TREE_TYPE (parm
)) != TEMPLATE_TYPE_PARM
1852 && TREE_CODE (TREE_TYPE (parm
)) != TYPENAME_TYPE
)
1854 cp_error ("`%#T' is not a valid type for a template constant parameter",
1856 if (DECL_NAME (parm
) == NULL_TREE
)
1857 error (" a template type parameter must begin with `class' or `typename'");
1858 TREE_TYPE (parm
) = void_type_node
;
1861 && (TREE_CODE (TREE_TYPE (parm
)) == REAL_TYPE
1862 || TREE_CODE (TREE_TYPE (parm
)) == COMPLEX_TYPE
))
1863 cp_pedwarn ("`%T' is not a valid type for a template constant parameter",
1865 decl
= build_decl (CONST_DECL
, DECL_NAME (parm
), TREE_TYPE (parm
));
1866 DECL_INITIAL (parm
) = DECL_INITIAL (decl
)
1867 = build_template_parm_index (idx
, processing_template_decl
,
1868 processing_template_decl
,
1869 decl
, TREE_TYPE (parm
));
1874 parm
= TREE_VALUE (parm
);
1876 if (parm
&& TREE_CODE (parm
) == TEMPLATE_DECL
)
1878 t
= make_aggr_type (TEMPLATE_TEMPLATE_PARM
);
1879 /* This is for distinguishing between real templates and template
1880 template parameters */
1881 TREE_TYPE (parm
) = t
;
1882 TREE_TYPE (DECL_TEMPLATE_RESULT (parm
)) = t
;
1887 t
= make_aggr_type (TEMPLATE_TYPE_PARM
);
1888 /* parm is either IDENTIFIER_NODE or NULL_TREE */
1889 decl
= build_decl (TYPE_DECL
, parm
, t
);
1892 TYPE_NAME (t
) = decl
;
1893 TYPE_STUB_DECL (t
) = decl
;
1895 TEMPLATE_TYPE_PARM_INDEX (t
)
1896 = build_template_parm_index (idx
, processing_template_decl
,
1897 processing_template_decl
,
1898 decl
, TREE_TYPE (parm
));
1900 DECL_ARTIFICIAL (decl
) = 1;
1901 SET_DECL_TEMPLATE_PARM_P (decl
);
1903 parm
= build_tree_list (defval
, parm
);
1904 return chainon (list
, parm
);
1907 /* The end of a template parameter list has been reached. Process the
1908 tree list into a parameter vector, converting each parameter into a more
1909 useful form. Type parameters are saved as IDENTIFIER_NODEs, and others
1913 end_template_parm_list (parms
)
1918 tree saved_parmlist
= make_tree_vec (list_length (parms
));
1920 current_template_parms
1921 = tree_cons (size_int (processing_template_decl
),
1922 saved_parmlist
, current_template_parms
);
1924 for (parm
= parms
, nparms
= 0;
1926 parm
= TREE_CHAIN (parm
), nparms
++)
1927 TREE_VEC_ELT (saved_parmlist
, nparms
) = parm
;
1929 --processing_template_parmlist
;
1931 return saved_parmlist
;
1934 /* end_template_decl is called after a template declaration is seen. */
1937 end_template_decl ()
1939 reset_specialization ();
1941 if (! processing_template_decl
)
1944 /* This matches the pushlevel in begin_template_parm_list. */
1947 --processing_template_decl
;
1948 current_template_parms
= TREE_CHAIN (current_template_parms
);
1951 /* Given a template argument vector containing the template PARMS.
1952 The innermost PARMS are given first. */
1955 current_template_args ()
1958 tree args
= NULL_TREE
;
1959 int length
= TMPL_PARMS_DEPTH (current_template_parms
);
1962 /* If there is only one level of template parameters, we do not
1963 create a TREE_VEC of TREE_VECs. Instead, we return a single
1964 TREE_VEC containing the arguments. */
1966 args
= make_tree_vec (length
);
1968 for (header
= current_template_parms
; header
; header
= TREE_CHAIN (header
))
1970 tree a
= copy_node (TREE_VALUE (header
));
1973 TREE_TYPE (a
) = NULL_TREE
;
1974 for (i
= TREE_VEC_LENGTH (a
) - 1; i
>= 0; --i
)
1976 tree t
= TREE_VEC_ELT (a
, i
);
1978 /* T will be a list if we are called from within a
1979 begin/end_template_parm_list pair, but a vector directly
1980 if within a begin/end_member_template_processing pair. */
1981 if (TREE_CODE (t
) == TREE_LIST
)
1985 if (TREE_CODE (t
) == TYPE_DECL
1986 || TREE_CODE (t
) == TEMPLATE_DECL
)
1989 t
= DECL_INITIAL (t
);
1990 TREE_VEC_ELT (a
, i
) = t
;
1995 TREE_VEC_ELT (args
, --l
) = a
;
2003 /* Return a TEMPLATE_DECL corresponding to DECL, using the indicated
2004 template PARMS. Used by push_template_decl below. */
2007 build_template_decl (decl
, parms
)
2011 tree tmpl
= build_lang_decl (TEMPLATE_DECL
, DECL_NAME (decl
), NULL_TREE
);
2012 DECL_TEMPLATE_PARMS (tmpl
) = parms
;
2013 DECL_CONTEXT (tmpl
) = DECL_CONTEXT (decl
);
2014 if (DECL_LANG_SPECIFIC (decl
))
2016 if (CAN_HAVE_FULL_LANG_DECL_P (decl
))
2017 DECL_VIRTUAL_CONTEXT (tmpl
) = DECL_VIRTUAL_CONTEXT (decl
);
2018 DECL_STATIC_FUNCTION_P (tmpl
) = DECL_STATIC_FUNCTION_P (decl
);
2019 DECL_CONSTRUCTOR_P (tmpl
) = DECL_CONSTRUCTOR_P (decl
);
2020 DECL_NONCONVERTING_P (tmpl
) = DECL_NONCONVERTING_P (decl
);
2021 DECL_ASSIGNMENT_OPERATOR_P (tmpl
) = DECL_ASSIGNMENT_OPERATOR_P (decl
);
2022 if (DECL_OVERLOADED_OPERATOR_P (decl
))
2023 SET_OVERLOADED_OPERATOR_CODE (tmpl
,
2024 DECL_OVERLOADED_OPERATOR_P (decl
));
2030 struct template_parm_data
2032 /* The level of the template parameters we are currently
2036 /* The index of the specialization argument we are currently
2040 /* An array whose size is the number of template parameters. The
2041 elements are non-zero if the parameter has been used in any one
2042 of the arguments processed so far. */
2045 /* An array whose size is the number of template arguments. The
2046 elements are non-zero if the argument makes use of template
2047 parameters of this level. */
2048 int* arg_uses_template_parms
;
2051 /* Subroutine of push_template_decl used to see if each template
2052 parameter in a partial specialization is used in the explicit
2053 argument list. If T is of the LEVEL given in DATA (which is
2054 treated as a template_parm_data*), then DATA->PARMS is marked
2058 mark_template_parm (t
, data
)
2064 struct template_parm_data
* tpd
= (struct template_parm_data
*) data
;
2066 if (TREE_CODE (t
) == TEMPLATE_PARM_INDEX
)
2068 level
= TEMPLATE_PARM_LEVEL (t
);
2069 idx
= TEMPLATE_PARM_IDX (t
);
2073 level
= TEMPLATE_TYPE_LEVEL (t
);
2074 idx
= TEMPLATE_TYPE_IDX (t
);
2077 if (level
== tpd
->level
)
2079 tpd
->parms
[idx
] = 1;
2080 tpd
->arg_uses_template_parms
[tpd
->current_arg
] = 1;
2083 /* Return zero so that for_each_template_parm will continue the
2084 traversal of the tree; we want to mark *every* template parm. */
2088 /* Process the partial specialization DECL. */
2091 process_partial_specialization (decl
)
2094 tree type
= TREE_TYPE (decl
);
2095 tree maintmpl
= CLASSTYPE_TI_TEMPLATE (type
);
2096 tree specargs
= CLASSTYPE_TI_ARGS (type
);
2097 tree inner_args
= INNERMOST_TEMPLATE_ARGS (specargs
);
2098 tree inner_parms
= INNERMOST_TEMPLATE_PARMS (current_template_parms
);
2099 tree main_inner_parms
= DECL_INNERMOST_TEMPLATE_PARMS (maintmpl
);
2100 int nargs
= TREE_VEC_LENGTH (inner_args
);
2101 int ntparms
= TREE_VEC_LENGTH (inner_parms
);
2103 int did_error_intro
= 0;
2104 struct template_parm_data tpd
;
2105 struct template_parm_data tpd2
;
2107 /* We check that each of the template parameters given in the
2108 partial specialization is used in the argument list to the
2109 specialization. For example:
2111 template <class T> struct S;
2112 template <class T> struct S<T*>;
2114 The second declaration is OK because `T*' uses the template
2115 parameter T, whereas
2117 template <class T> struct S<int>;
2119 is no good. Even trickier is:
2130 The S2<T> declaration is actually illegal; it is a
2131 full-specialization. Of course,
2134 struct S2<T (*)(U)>;
2136 or some such would have been OK. */
2137 tpd
.level
= TMPL_PARMS_DEPTH (current_template_parms
);
2138 tpd
.parms
= alloca (sizeof (int) * ntparms
);
2139 memset ((PTR
) tpd
.parms
, 0, sizeof (int) * ntparms
);
2141 tpd
.arg_uses_template_parms
= alloca (sizeof (int) * nargs
);
2142 memset ((PTR
) tpd
.arg_uses_template_parms
, 0, sizeof (int) * nargs
);
2143 for (i
= 0; i
< nargs
; ++i
)
2145 tpd
.current_arg
= i
;
2146 for_each_template_parm (TREE_VEC_ELT (inner_args
, i
),
2147 &mark_template_parm
,
2150 for (i
= 0; i
< ntparms
; ++i
)
2151 if (tpd
.parms
[i
] == 0)
2153 /* One of the template parms was not used in the
2155 if (!did_error_intro
)
2157 cp_error ("template parameters not used in partial specialization:");
2158 did_error_intro
= 1;
2162 TREE_VALUE (TREE_VEC_ELT (inner_parms
, i
)));
2165 /* [temp.class.spec]
2167 The argument list of the specialization shall not be identical to
2168 the implicit argument list of the primary template. */
2169 if (comp_template_args
2171 INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (TREE_TYPE
2173 cp_error ("partial specialization `%T' does not specialize any template arguments", type
);
2175 /* [temp.class.spec]
2177 A partially specialized non-type argument expression shall not
2178 involve template parameters of the partial specialization except
2179 when the argument expression is a simple identifier.
2181 The type of a template parameter corresponding to a specialized
2182 non-type argument shall not be dependent on a parameter of the
2184 my_friendly_assert (nargs
== DECL_NTPARMS (maintmpl
), 0);
2186 for (i
= 0; i
< nargs
; ++i
)
2188 tree arg
= TREE_VEC_ELT (inner_args
, i
);
2189 if (/* These first two lines are the `non-type' bit. */
2191 && TREE_CODE (arg
) != TEMPLATE_DECL
2192 /* This next line is the `argument expression is not just a
2193 simple identifier' condition and also the `specialized
2194 non-type argument' bit. */
2195 && TREE_CODE (arg
) != TEMPLATE_PARM_INDEX
)
2197 if (tpd
.arg_uses_template_parms
[i
])
2198 cp_error ("template argument `%E' involves template parameter(s)", arg
);
2201 /* Look at the corresponding template parameter,
2202 marking which template parameters its type depends
2205 TREE_TYPE (TREE_VALUE (TREE_VEC_ELT (main_inner_parms
,
2210 /* We haven't yet initialized TPD2. Do so now. */
2211 tpd2
.arg_uses_template_parms
2212 = (int*) alloca (sizeof (int) * nargs
);
2213 /* The number of parameters here is the number in the
2214 main template, which, as checked in the assertion
2216 tpd2
.parms
= (int*) alloca (sizeof (int) * nargs
);
2218 TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (maintmpl
));
2221 /* Mark the template parameters. But this time, we're
2222 looking for the template parameters of the main
2223 template, not in the specialization. */
2224 tpd2
.current_arg
= i
;
2225 tpd2
.arg_uses_template_parms
[i
] = 0;
2226 memset ((PTR
) tpd2
.parms
, 0, sizeof (int) * nargs
);
2227 for_each_template_parm (type
,
2228 &mark_template_parm
,
2231 if (tpd2
.arg_uses_template_parms
[i
])
2233 /* The type depended on some template parameters.
2234 If they are fully specialized in the
2235 specialization, that's OK. */
2237 for (j
= 0; j
< nargs
; ++j
)
2238 if (tpd2
.parms
[j
] != 0
2239 && tpd
.arg_uses_template_parms
[j
])
2241 cp_error ("type `%T' of template argument `%E' depends on template parameter(s)",
2251 if (retrieve_specialization (maintmpl
, specargs
))
2252 /* We've already got this specialization. */
2255 DECL_TEMPLATE_SPECIALIZATIONS (maintmpl
)
2256 = tree_cons (inner_args
, inner_parms
,
2257 DECL_TEMPLATE_SPECIALIZATIONS (maintmpl
));
2258 TREE_TYPE (DECL_TEMPLATE_SPECIALIZATIONS (maintmpl
)) = type
;
2262 /* Check that a template declaration's use of default arguments is not
2263 invalid. Here, PARMS are the template parameters. IS_PRIMARY is
2264 non-zero if DECL is the thing declared by a primary template.
2265 IS_PARTIAL is non-zero if DECL is a partial specialization. */
2268 check_default_tmpl_args (decl
, parms
, is_primary
, is_partial
)
2275 int last_level_to_check
;
2280 A default template-argument shall not be specified in a
2281 function template declaration or a function template definition, nor
2282 in the template-parameter-list of the definition of a member of a
2285 if (TREE_CODE (CP_DECL_CONTEXT (decl
)) == FUNCTION_DECL
)
2286 /* You can't have a function template declaration in a local
2287 scope, nor you can you define a member of a class template in a
2291 if (current_class_type
2292 && !TYPE_BEING_DEFINED (current_class_type
)
2293 && DECL_LANG_SPECIFIC (decl
)
2294 /* If this is either a friend defined in the scope of the class
2295 or a member function. */
2296 && ((DECL_CONTEXT (decl
)
2297 && same_type_p (DECL_CONTEXT (decl
), current_class_type
))
2298 || (DECL_FRIEND_CONTEXT (decl
)
2299 && same_type_p (DECL_FRIEND_CONTEXT (decl
),
2300 current_class_type
)))
2301 /* And, if it was a member function, it really was defined in
2302 the scope of the class. */
2303 && (!DECL_FUNCTION_MEMBER_P (decl
) || DECL_DEFINED_IN_CLASS_P (decl
)))
2304 /* We already checked these parameters when the template was
2305 declared, so there's no need to do it again now. This function
2306 was defined in class scope, but we're processing it's body now
2307 that the class is complete. */
2312 If a template-parameter has a default template-argument, all
2313 subsequent template-parameters shall have a default
2314 template-argument supplied. */
2315 for (parm_level
= parms
; parm_level
; parm_level
= TREE_CHAIN (parm_level
))
2317 tree inner_parms
= TREE_VALUE (parm_level
);
2318 int ntparms
= TREE_VEC_LENGTH (inner_parms
);
2319 int seen_def_arg_p
= 0;
2322 for (i
= 0; i
< ntparms
; ++i
)
2324 tree parm
= TREE_VEC_ELT (inner_parms
, i
);
2325 if (TREE_PURPOSE (parm
))
2327 else if (seen_def_arg_p
)
2329 cp_error ("no default argument for `%D'", TREE_VALUE (parm
));
2330 /* For better subsequent error-recovery, we indicate that
2331 there should have been a default argument. */
2332 TREE_PURPOSE (parm
) = error_mark_node
;
2337 if (TREE_CODE (decl
) != TYPE_DECL
|| is_partial
|| !is_primary
)
2338 /* For an ordinary class template, default template arguments are
2339 allowed at the innermost level, e.g.:
2340 template <class T = int>
2342 but, in a partial specialization, they're not allowed even
2343 there, as we have in [temp.class.spec]:
2345 The template parameter list of a specialization shall not
2346 contain default template argument values.
2348 So, for a partial specialization, or for a function template,
2349 we look at all of them. */
2352 /* But, for a primary class template that is not a partial
2353 specialization we look at all template parameters except the
2355 parms
= TREE_CHAIN (parms
);
2357 /* Figure out what error message to issue. */
2358 if (TREE_CODE (decl
) == FUNCTION_DECL
)
2359 msg
= "default argument for template parameter in function template `%D'";
2360 else if (is_partial
)
2361 msg
= "default argument in partial specialization `%D'";
2363 msg
= "default argument for template parameter for class enclosing `%D'";
2365 if (current_class_type
&& TYPE_BEING_DEFINED (current_class_type
))
2366 /* If we're inside a class definition, there's no need to
2367 examine the parameters to the class itself. On the one
2368 hand, they will be checked when the class is defined, and,
2369 on the other, default arguments are legal in things like:
2370 template <class T = double>
2371 struct S { template <class U> void f(U); };
2372 Here the default argument for `S' has no bearing on the
2373 declaration of `f'. */
2374 last_level_to_check
= template_class_depth (current_class_type
) + 1;
2376 /* Check everything. */
2377 last_level_to_check
= 0;
2379 for (parm_level
= parms
;
2380 parm_level
&& TMPL_PARMS_DEPTH (parm_level
) >= last_level_to_check
;
2381 parm_level
= TREE_CHAIN (parm_level
))
2383 tree inner_parms
= TREE_VALUE (parm_level
);
2387 ntparms
= TREE_VEC_LENGTH (inner_parms
);
2388 for (i
= 0; i
< ntparms
; ++i
)
2389 if (TREE_PURPOSE (TREE_VEC_ELT (inner_parms
, i
)))
2393 cp_error (msg
, decl
);
2397 /* Clear out the default argument so that we are not
2399 TREE_PURPOSE (TREE_VEC_ELT (inner_parms
, i
)) = NULL_TREE
;
2402 /* At this point, if we're still interested in issuing messages,
2403 they must apply to classes surrounding the object declared. */
2405 msg
= "default argument for template parameter for class enclosing `%D'";
2409 /* Creates a TEMPLATE_DECL for the indicated DECL using the template
2410 parameters given by current_template_args, or reuses a
2411 previously existing one, if appropriate. Returns the DECL, or an
2412 equivalent one, if it is replaced via a call to duplicate_decls.
2414 If IS_FRIEND is non-zero, DECL is a friend declaration. */
2417 push_template_decl_real (decl
, is_friend
)
2427 int new_template_p
= 0;
2429 /* See if this is a partial specialization. */
2430 is_partial
= (DECL_IMPLICIT_TYPEDEF_P (decl
)
2431 && TREE_CODE (TREE_TYPE (decl
)) != ENUMERAL_TYPE
2432 && CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_TYPE (decl
)));
2434 is_friend
|= (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_FRIEND_P (decl
));
2437 /* For a friend, we want the context of the friend function, not
2438 the type of which it is a friend. */
2439 ctx
= DECL_CONTEXT (decl
);
2440 else if (CP_DECL_CONTEXT (decl
)
2441 && TREE_CODE (CP_DECL_CONTEXT (decl
)) != NAMESPACE_DECL
)
2442 /* In the case of a virtual function, we want the class in which
2444 ctx
= CP_DECL_CONTEXT (decl
);
2446 /* Otherwise, if we're currently defining some class, the DECL
2447 is assumed to be a member of the class. */
2448 ctx
= current_scope ();
2450 if (ctx
&& TREE_CODE (ctx
) == NAMESPACE_DECL
)
2453 if (!DECL_CONTEXT (decl
))
2454 DECL_CONTEXT (decl
) = FROB_CONTEXT (current_namespace
);
2456 /* See if this is a primary template. */
2457 primary
= template_parm_scope_p ();
2461 if (current_lang_name
== lang_name_c
)
2462 cp_error ("template with C linkage");
2463 else if (TREE_CODE (decl
) == TYPE_DECL
2464 && ANON_AGGRNAME_P (DECL_NAME (decl
)))
2465 cp_error ("template class without a name");
2466 else if ((DECL_IMPLICIT_TYPEDEF_P (decl
)
2467 && CLASS_TYPE_P (TREE_TYPE (decl
)))
2468 || (TREE_CODE (decl
) == VAR_DECL
&& ctx
&& CLASS_TYPE_P (ctx
))
2469 || TREE_CODE (decl
) == FUNCTION_DECL
)
2472 cp_error ("template declaration of `%#D'", decl
);
2475 /* Check to see that the rules regarding the use of default
2476 arguments are not being violated. */
2477 check_default_tmpl_args (decl
, current_template_parms
,
2478 primary
, is_partial
);
2481 return process_partial_specialization (decl
);
2483 args
= current_template_args ();
2486 || TREE_CODE (ctx
) == FUNCTION_DECL
2487 || TYPE_BEING_DEFINED (ctx
)
2488 || (is_friend
&& !DECL_TEMPLATE_INFO (decl
)))
2490 if (DECL_LANG_SPECIFIC (decl
)
2491 && DECL_TEMPLATE_INFO (decl
)
2492 && DECL_TI_TEMPLATE (decl
))
2493 tmpl
= DECL_TI_TEMPLATE (decl
);
2494 /* If DECL is a TYPE_DECL for a class-template, then there won't
2495 be DECL_LANG_SPECIFIC. The information equivalent to
2496 DECL_TEMPLATE_INFO is found in TYPE_TEMPLATE_INFO instead. */
2497 else if (DECL_IMPLICIT_TYPEDEF_P (decl
)
2498 && TYPE_TEMPLATE_INFO (TREE_TYPE (decl
))
2499 && TYPE_TI_TEMPLATE (TREE_TYPE (decl
)))
2501 /* Since a template declaration already existed for this
2502 class-type, we must be redeclaring it here. Make sure
2503 that the redeclaration is legal. */
2504 redeclare_class_template (TREE_TYPE (decl
),
2505 current_template_parms
);
2506 /* We don't need to create a new TEMPLATE_DECL; just use the
2507 one we already had. */
2508 tmpl
= TYPE_TI_TEMPLATE (TREE_TYPE (decl
));
2512 tmpl
= build_template_decl (decl
, current_template_parms
);
2515 if (DECL_LANG_SPECIFIC (decl
)
2516 && DECL_TEMPLATE_SPECIALIZATION (decl
))
2518 /* A specialization of a member template of a template
2520 SET_DECL_TEMPLATE_SPECIALIZATION (tmpl
);
2521 DECL_TEMPLATE_INFO (tmpl
) = DECL_TEMPLATE_INFO (decl
);
2522 DECL_TEMPLATE_INFO (decl
) = NULL_TREE
;
2528 tree a
, t
, current
, parms
;
2531 if (TREE_CODE (decl
) == TYPE_DECL
)
2533 if ((IS_AGGR_TYPE_CODE (TREE_CODE (TREE_TYPE (decl
)))
2534 || TREE_CODE (TREE_TYPE (decl
)) == ENUMERAL_TYPE
)
2535 && TYPE_TEMPLATE_INFO (TREE_TYPE (decl
))
2536 && TYPE_TI_TEMPLATE (TREE_TYPE (decl
)))
2537 tmpl
= TYPE_TI_TEMPLATE (TREE_TYPE (decl
));
2540 cp_error ("`%D' does not declare a template type", decl
);
2544 else if (! DECL_TEMPLATE_INFO (decl
))
2546 cp_error ("template definition of non-template `%#D'", decl
);
2550 tmpl
= DECL_TI_TEMPLATE (decl
);
2552 if (is_member_template (tmpl
)
2553 && DECL_FUNCTION_TEMPLATE_P (tmpl
)
2554 && DECL_TEMPLATE_INFO (decl
) && DECL_TI_ARGS (decl
)
2555 && DECL_TEMPLATE_SPECIALIZATION (decl
))
2559 /* The declaration is a specialization of a member
2560 template, declared outside the class. Therefore, the
2561 innermost template arguments will be NULL, so we
2562 replace them with the arguments determined by the
2563 earlier call to check_explicit_specialization. */
2564 args
= DECL_TI_ARGS (decl
);
2567 = build_template_decl (decl
, current_template_parms
);
2568 DECL_TEMPLATE_RESULT (new_tmpl
) = decl
;
2569 TREE_TYPE (new_tmpl
) = TREE_TYPE (decl
);
2570 DECL_TI_TEMPLATE (decl
) = new_tmpl
;
2571 SET_DECL_TEMPLATE_SPECIALIZATION (new_tmpl
);
2572 DECL_TEMPLATE_INFO (new_tmpl
)
2573 = tree_cons (tmpl
, args
, NULL_TREE
);
2575 register_specialization (new_tmpl
,
2576 most_general_template (tmpl
),
2581 /* Make sure the template headers we got make sense. */
2583 parms
= DECL_TEMPLATE_PARMS (tmpl
);
2584 i
= TMPL_PARMS_DEPTH (parms
);
2585 if (TMPL_ARGS_DEPTH (args
) != i
)
2587 cp_error ("expected %d levels of template parms for `%#D', got %d",
2588 i
, decl
, TMPL_ARGS_DEPTH (args
));
2591 for (current
= decl
; i
> 0; --i
, parms
= TREE_CHAIN (parms
))
2593 a
= TMPL_ARGS_LEVEL (args
, i
);
2594 t
= INNERMOST_TEMPLATE_PARMS (parms
);
2596 if (TREE_VEC_LENGTH (t
) != TREE_VEC_LENGTH (a
))
2598 if (current
== decl
)
2599 cp_error ("got %d template parameters for `%#D'",
2600 TREE_VEC_LENGTH (a
), decl
);
2602 cp_error ("got %d template parameters for `%#T'",
2603 TREE_VEC_LENGTH (a
), current
);
2604 cp_error (" but %d required", TREE_VEC_LENGTH (t
));
2607 /* Perhaps we should also check that the parms are used in the
2608 appropriate qualifying scopes in the declarator? */
2610 if (current
== decl
)
2613 current
= TYPE_CONTEXT (current
);
2617 DECL_TEMPLATE_RESULT (tmpl
) = decl
;
2618 TREE_TYPE (tmpl
) = TREE_TYPE (decl
);
2620 /* Push template declarations for global functions and types. Note
2621 that we do not try to push a global template friend declared in a
2622 template class; such a thing may well depend on the template
2623 parameters of the class. */
2624 if (new_template_p
&& !ctx
2625 && !(is_friend
&& template_class_depth (current_class_type
) > 0))
2626 tmpl
= pushdecl_namespace_level (tmpl
);
2629 DECL_PRIMARY_TEMPLATE (tmpl
) = tmpl
;
2631 info
= tree_cons (tmpl
, args
, NULL_TREE
);
2633 if (DECL_IMPLICIT_TYPEDEF_P (decl
))
2635 SET_TYPE_TEMPLATE_INFO (TREE_TYPE (tmpl
), info
);
2636 if ((!ctx
|| TREE_CODE (ctx
) != FUNCTION_DECL
)
2637 && TREE_CODE (TREE_TYPE (decl
)) != ENUMERAL_TYPE
)
2638 DECL_NAME (decl
) = classtype_mangled_name (TREE_TYPE (decl
));
2640 else if (DECL_LANG_SPECIFIC (decl
))
2641 DECL_TEMPLATE_INFO (decl
) = info
;
2643 return DECL_TEMPLATE_RESULT (tmpl
);
2647 push_template_decl (decl
)
2650 return push_template_decl_real (decl
, 0);
2653 /* Called when a class template TYPE is redeclared with the indicated
2654 template PARMS, e.g.:
2656 template <class T> struct S;
2657 template <class T> struct S {}; */
2660 redeclare_class_template (type
, parms
)
2668 if (!TYPE_TEMPLATE_INFO (type
))
2670 cp_error ("`%T' is not a template type", type
);
2674 tmpl
= TYPE_TI_TEMPLATE (type
);
2675 if (!PRIMARY_TEMPLATE_P (tmpl
))
2676 /* The type is nested in some template class. Nothing to worry
2677 about here; there are no new template parameters for the nested
2681 parms
= INNERMOST_TEMPLATE_PARMS (parms
);
2682 tmpl_parms
= DECL_INNERMOST_TEMPLATE_PARMS (tmpl
);
2684 if (TREE_VEC_LENGTH (parms
) != TREE_VEC_LENGTH (tmpl_parms
))
2686 cp_error_at ("previous declaration `%D'", tmpl
);
2687 cp_error ("used %d template parameter%s instead of %d",
2688 TREE_VEC_LENGTH (tmpl_parms
),
2689 TREE_VEC_LENGTH (tmpl_parms
) == 1 ? "" : "s",
2690 TREE_VEC_LENGTH (parms
));
2694 for (i
= 0; i
< TREE_VEC_LENGTH (tmpl_parms
); ++i
)
2696 tree tmpl_parm
= TREE_VALUE (TREE_VEC_ELT (tmpl_parms
, i
));
2697 tree parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
2698 tree tmpl_default
= TREE_PURPOSE (TREE_VEC_ELT (tmpl_parms
, i
));
2699 tree parm_default
= TREE_PURPOSE (TREE_VEC_ELT (parms
, i
));
2701 if (TREE_CODE (tmpl_parm
) != TREE_CODE (parm
))
2703 cp_error_at ("template parameter `%#D'", tmpl_parm
);
2704 cp_error ("redeclared here as `%#D'", parm
);
2708 if (tmpl_default
!= NULL_TREE
&& parm_default
!= NULL_TREE
)
2710 /* We have in [temp.param]:
2712 A template-parameter may not be given default arguments
2713 by two different declarations in the same scope. */
2714 cp_error ("redefinition of default argument for `%#D'", parm
);
2715 cp_error_at (" original definition appeared here", tmpl_parm
);
2719 if (parm_default
!= NULL_TREE
)
2720 /* Update the previous template parameters (which are the ones
2721 that will really count) with the new default value. */
2722 TREE_PURPOSE (TREE_VEC_ELT (tmpl_parms
, i
)) = parm_default
;
2723 else if (tmpl_default
!= NULL_TREE
)
2724 /* Update the new parameters, too; they'll be used as the
2725 parameters for any members. */
2726 TREE_PURPOSE (TREE_VEC_ELT (parms
, i
)) = tmpl_default
;
2730 /* Attempt to convert the non-type template parameter EXPR to the
2731 indicated TYPE. If the conversion is successful, return the
2732 converted value. If the conversion is unsuccessful, return
2733 NULL_TREE if we issued an error message, or error_mark_node if we
2734 did not. We issue error messages for out-and-out bad template
2735 parameters, but not simply because the conversion failed, since we
2736 might be just trying to do argument deduction. By the time this
2737 function is called, neither TYPE nor EXPR may make use of template
2741 convert_nontype_argument (type
, expr
)
2745 tree expr_type
= TREE_TYPE (expr
);
2747 /* A template-argument for a non-type, non-template
2748 template-parameter shall be one of:
2750 --an integral constant-expression of integral or enumeration
2753 --the name of a non-type template-parameter; or
2755 --the name of an object or function with external linkage,
2756 including function templates and function template-ids but
2757 excluding non-static class members, expressed as id-expression;
2760 --the address of an object or function with external linkage,
2761 including function templates and function template-ids but
2762 excluding non-static class members, expressed as & id-expression
2763 where the & is optional if the name refers to a function or
2766 --a pointer to member expressed as described in _expr.unary.op_. */
2768 /* An integral constant-expression can include const variables or
2769 enumerators. Simplify things by folding them to their values,
2770 unless we're about to bind the declaration to a reference
2772 if (INTEGRAL_TYPE_P (expr_type
)
2773 && TREE_CODE (type
) != REFERENCE_TYPE
)
2774 expr
= decl_constant_value (expr
);
2776 if (is_overloaded_fn (expr
))
2777 /* OK for now. We'll check that it has external linkage later.
2778 Check this first since if expr_type is the unknown_type_node
2779 we would otherwise complain below. */
2781 else if (TYPE_PTRMEM_P (expr_type
)
2782 || TYPE_PTRMEMFUNC_P (expr_type
))
2784 if (TREE_CODE (expr
) != PTRMEM_CST
)
2787 else if (TYPE_PTR_P (expr_type
)
2788 || TYPE_PTRMEM_P (expr_type
)
2789 || TREE_CODE (expr_type
) == ARRAY_TYPE
2790 || TREE_CODE (type
) == REFERENCE_TYPE
2791 /* If expr is the address of an overloaded function, we
2792 will get the unknown_type_node at this point. */
2793 || expr_type
== unknown_type_node
)
2799 if (TREE_CODE (expr_type
) == ARRAY_TYPE
2800 || (TREE_CODE (type
) == REFERENCE_TYPE
2801 && TREE_CODE (e
) != ADDR_EXPR
))
2805 if (TREE_CODE (e
) != ADDR_EXPR
)
2808 cp_error ("`%E' is not a valid template argument", expr
);
2809 if (TYPE_PTR_P (expr_type
))
2811 if (TREE_CODE (TREE_TYPE (expr_type
)) == FUNCTION_TYPE
)
2812 cp_error ("it must be the address of a function with external linkage");
2814 cp_error ("it must be the address of an object with external linkage");
2816 else if (TYPE_PTRMEM_P (expr_type
)
2817 || TYPE_PTRMEMFUNC_P (expr_type
))
2818 cp_error ("it must be a pointer-to-member of the form `&X::Y'");
2823 referent
= TREE_OPERAND (e
, 0);
2824 STRIP_NOPS (referent
);
2827 if (TREE_CODE (referent
) == STRING_CST
)
2829 cp_error ("string literal %E is not a valid template argument because it is the address of an object with static linkage",
2834 if (is_overloaded_fn (referent
))
2835 /* We'll check that it has external linkage later. */
2837 else if (TREE_CODE (referent
) != VAR_DECL
)
2839 else if (!DECL_EXTERNAL_LINKAGE_P (referent
))
2841 cp_error ("address of non-extern `%E' cannot be used as template argument", referent
);
2842 return error_mark_node
;
2845 else if (INTEGRAL_TYPE_P (expr_type
)
2846 || TYPE_PTRMEM_P (expr_type
)
2847 || TYPE_PTRMEMFUNC_P (expr_type
)
2848 /* The next two are g++ extensions. */
2849 || TREE_CODE (expr_type
) == REAL_TYPE
2850 || TREE_CODE (expr_type
) == COMPLEX_TYPE
)
2852 if (! TREE_CONSTANT (expr
))
2855 cp_error ("non-constant `%E' cannot be used as template argument",
2862 cp_error ("object `%E' cannot be used as template argument", expr
);
2866 switch (TREE_CODE (type
))
2871 /* For a non-type template-parameter of integral or enumeration
2872 type, integral promotions (_conv.prom_) and integral
2873 conversions (_conv.integral_) are applied. */
2874 if (!INTEGRAL_TYPE_P (expr_type
))
2875 return error_mark_node
;
2877 /* It's safe to call digest_init in this case; we know we're
2878 just converting one integral constant expression to another. */
2879 expr
= digest_init (type
, expr
, (tree
*) 0);
2881 if (TREE_CODE (expr
) != INTEGER_CST
)
2882 /* Curiously, some TREE_CONSTANT integral expressions do not
2883 simplify to integer constants. For example, `3 % 0',
2884 remains a TRUNC_MOD_EXPR. */
2891 /* These are g++ extensions. */
2892 if (TREE_CODE (expr_type
) != TREE_CODE (type
))
2893 return error_mark_node
;
2895 expr
= digest_init (type
, expr
, (tree
*) 0);
2897 if (TREE_CODE (expr
) != REAL_CST
)
2904 tree type_pointed_to
= TREE_TYPE (type
);
2906 if (TYPE_PTRMEM_P (type
))
2910 /* For a non-type template-parameter of type pointer to data
2911 member, qualification conversions (_conv.qual_) are
2913 e
= perform_qualification_conversions (type
, expr
);
2914 if (TREE_CODE (e
) == NOP_EXPR
)
2915 /* The call to perform_qualification_conversions will
2916 insert a NOP_EXPR over EXPR to do express conversion,
2917 if necessary. But, that will confuse us if we use
2918 this (converted) template parameter to instantiate
2919 another template; then the thing will not look like a
2920 valid template argument. So, just make a new
2921 constant, of the appropriate type. */
2922 e
= make_ptrmem_cst (type
, PTRMEM_CST_MEMBER (expr
));
2925 else if (TREE_CODE (type_pointed_to
) == FUNCTION_TYPE
)
2927 /* For a non-type template-parameter of type pointer to
2928 function, only the function-to-pointer conversion
2929 (_conv.func_) is applied. If the template-argument
2930 represents a set of overloaded functions (or a pointer to
2931 such), the matching function is selected from the set
2936 if (TREE_CODE (expr
) == ADDR_EXPR
)
2937 fns
= TREE_OPERAND (expr
, 0);
2941 fn
= instantiate_type (type_pointed_to
, fns
, itf_none
);
2943 if (fn
== error_mark_node
)
2944 return error_mark_node
;
2946 if (!DECL_EXTERNAL_LINKAGE_P (fn
))
2948 if (really_overloaded_fn (fns
))
2949 return error_mark_node
;
2954 expr
= build_unary_op (ADDR_EXPR
, fn
, 0);
2956 my_friendly_assert (same_type_p (type
, TREE_TYPE (expr
)),
2962 /* For a non-type template-parameter of type pointer to
2963 object, qualification conversions (_conv.qual_) and the
2964 array-to-pointer conversion (_conv.array_) are applied.
2965 [Note: In particular, neither the null pointer conversion
2966 (_conv.ptr_) nor the derived-to-base conversion
2967 (_conv.ptr_) are applied. Although 0 is a valid
2968 template-argument for a non-type template-parameter of
2969 integral type, it is not a valid template-argument for a
2970 non-type template-parameter of pointer type.]
2972 The call to decay_conversion performs the
2973 array-to-pointer conversion, if appropriate. */
2974 expr
= decay_conversion (expr
);
2976 if (expr
== error_mark_node
)
2977 return error_mark_node
;
2979 return perform_qualification_conversions (type
, expr
);
2984 case REFERENCE_TYPE
:
2986 tree type_referred_to
= TREE_TYPE (type
);
2988 /* If this expression already has reference type, get the
2989 underling object. */
2990 if (TREE_CODE (expr_type
) == REFERENCE_TYPE
)
2992 my_friendly_assert (TREE_CODE (expr
) == ADDR_EXPR
, 20000604);
2993 expr
= TREE_OPERAND (expr
, 0);
2994 expr_type
= TREE_TYPE (expr
);
2997 if (TREE_CODE (type_referred_to
) == FUNCTION_TYPE
)
2999 /* For a non-type template-parameter of type reference to
3000 function, no conversions apply. If the
3001 template-argument represents a set of overloaded
3002 functions, the matching function is selected from the
3003 set (_over.over_). */
3006 fn
= instantiate_type (type_referred_to
, expr
, itf_none
);
3008 if (fn
== error_mark_node
)
3009 return error_mark_node
;
3011 if (!DECL_EXTERNAL_LINKAGE_P (fn
))
3013 if (really_overloaded_fn (expr
))
3014 /* Don't issue an error here; we might get a different
3015 function if the overloading had worked out
3017 return error_mark_node
;
3022 my_friendly_assert (same_type_p (type_referred_to
,
3030 /* For a non-type template-parameter of type reference to
3031 object, no conversions apply. The type referred to by the
3032 reference may be more cv-qualified than the (otherwise
3033 identical) type of the template-argument. The
3034 template-parameter is bound directly to the
3035 template-argument, which must be an lvalue. */
3036 if (!same_type_p (TYPE_MAIN_VARIANT (expr_type
),
3037 TYPE_MAIN_VARIANT (type_referred_to
))
3038 || !at_least_as_qualified_p (type_referred_to
,
3040 || !real_lvalue_p (expr
))
3041 return error_mark_node
;
3044 mark_addressable (expr
);
3045 return build1 (ADDR_EXPR
, type
, expr
);
3051 if (!TYPE_PTRMEMFUNC_P (type
))
3052 /* This handles templates like
3053 template<class T, T t> void f();
3054 when T is substituted with any class. The second template
3055 parameter becomes invalid and the template candidate is
3057 return error_mark_node
;
3059 /* For a non-type template-parameter of type pointer to member
3060 function, no conversions apply. If the template-argument
3061 represents a set of overloaded member functions, the
3062 matching member function is selected from the set
3065 if (!TYPE_PTRMEMFUNC_P (expr_type
) &&
3066 expr_type
!= unknown_type_node
)
3067 return error_mark_node
;
3069 if (TREE_CODE (expr
) == PTRMEM_CST
)
3071 /* A ptr-to-member constant. */
3072 if (!same_type_p (type
, expr_type
))
3073 return error_mark_node
;
3078 if (TREE_CODE (expr
) != ADDR_EXPR
)
3079 return error_mark_node
;
3081 expr
= instantiate_type (type
, expr
, itf_none
);
3083 if (expr
== error_mark_node
)
3084 return error_mark_node
;
3086 my_friendly_assert (same_type_p (type
, TREE_TYPE (expr
)),
3093 /* All non-type parameters must have one of these types. */
3094 my_friendly_abort (0);
3098 return error_mark_node
;
3101 /* Return 1 if PARM_PARMS and ARG_PARMS matches using rule for
3102 template template parameters. Both PARM_PARMS and ARG_PARMS are
3103 vectors of TREE_LIST nodes containing TYPE_DECL, TEMPLATE_DECL
3106 ARG_PARMS may contain more parameters than PARM_PARMS. If this is
3107 the case, then extra parameters must have default arguments.
3109 Consider the example:
3110 template <class T, class Allocator = allocator> class vector;
3111 template<template <class U> class TT> class C;
3113 C<vector> is a valid instantiation. PARM_PARMS for the above code
3114 contains a TYPE_DECL (for U), ARG_PARMS contains two TYPE_DECLs (for
3115 T and Allocator) and OUTER_ARGS contains the argument that is used to
3116 substitute the TT parameter. */
3119 coerce_template_template_parms (parm_parms
, arg_parms
, complain
,
3120 in_decl
, outer_args
)
3121 tree parm_parms
, arg_parms
;
3123 tree in_decl
, outer_args
;
3125 int nparms
, nargs
, i
;
3128 my_friendly_assert (TREE_CODE (parm_parms
) == TREE_VEC
, 0);
3129 my_friendly_assert (TREE_CODE (arg_parms
) == TREE_VEC
, 0);
3131 nparms
= TREE_VEC_LENGTH (parm_parms
);
3132 nargs
= TREE_VEC_LENGTH (arg_parms
);
3134 /* The rule here is opposite of coerce_template_parms. */
3137 && TREE_PURPOSE (TREE_VEC_ELT (arg_parms
, nparms
)) == NULL_TREE
))
3140 for (i
= 0; i
< nparms
; ++i
)
3142 parm
= TREE_VALUE (TREE_VEC_ELT (parm_parms
, i
));
3143 arg
= TREE_VALUE (TREE_VEC_ELT (arg_parms
, i
));
3145 if (arg
== NULL_TREE
|| arg
== error_mark_node
3146 || parm
== NULL_TREE
|| parm
== error_mark_node
)
3149 if (TREE_CODE (arg
) != TREE_CODE (parm
))
3152 switch (TREE_CODE (parm
))
3158 /* We encounter instantiations of templates like
3159 template <template <template <class> class> class TT>
3162 tree parmparm
= DECL_INNERMOST_TEMPLATE_PARMS (parm
);
3163 tree argparm
= DECL_INNERMOST_TEMPLATE_PARMS (arg
);
3165 if (!coerce_template_template_parms (parmparm
, argparm
,
3173 /* The tsubst call is used to handle cases such as
3174 template <class T, template <T> class TT> class D;
3175 i.e. the parameter list of TT depends on earlier parameters. */
3176 if (!same_type_p (tsubst (TREE_TYPE (parm
), outer_args
,
3183 my_friendly_abort (0);
3189 /* Convert the indicated template ARG as necessary to match the
3190 indicated template PARM. Returns the converted ARG, or
3191 error_mark_node if the conversion was unsuccessful. Error messages
3192 are issued if COMPLAIN is non-zero. This conversion is for the Ith
3193 parameter in the parameter list. ARGS is the full set of template
3194 arguments deduced so far. */
3197 convert_template_argument (parm
, arg
, args
, complain
, i
, in_decl
)
3207 int is_type
, requires_type
, is_tmpl_type
, requires_tmpl_type
;
3209 inner_args
= INNERMOST_TEMPLATE_ARGS (args
);
3211 if (TREE_CODE (arg
) == TREE_LIST
3212 && TREE_TYPE (arg
) != NULL_TREE
3213 && TREE_CODE (TREE_TYPE (arg
)) == OFFSET_TYPE
)
3215 /* The template argument was the name of some
3216 member function. That's usually
3217 illegal, but static members are OK. In any
3218 case, grab the underlying fields/functions
3219 and issue an error later if required. */
3220 arg
= TREE_VALUE (arg
);
3221 TREE_TYPE (arg
) = unknown_type_node
;
3224 requires_tmpl_type
= TREE_CODE (parm
) == TEMPLATE_DECL
;
3225 requires_type
= (TREE_CODE (parm
) == TYPE_DECL
3226 || requires_tmpl_type
);
3228 /* Check if it is a class template. If REQUIRES_TMPL_TYPE is true,
3229 we also accept implicitly created TYPE_DECL as a valid argument.
3230 This is necessary to handle the case where we pass a template name
3231 to a template template parameter in a scope where we've derived from
3232 in instantiation of that template, so the template name refers to that
3233 instantiation. We really ought to handle this better. */
3235 = ((TREE_CODE (arg
) == TEMPLATE_DECL
3236 && TREE_CODE (DECL_TEMPLATE_RESULT (arg
)) == TYPE_DECL
)
3237 || TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
3238 || (TREE_CODE (arg
) == RECORD_TYPE
3239 && CLASSTYPE_TEMPLATE_INFO (arg
)
3240 && TREE_CODE (TYPE_NAME (arg
)) == TYPE_DECL
3241 && DECL_ARTIFICIAL (TYPE_NAME (arg
))
3242 && requires_tmpl_type
3243 && is_base_of_enclosing_class (arg
, current_class_type
)));
3244 if (is_tmpl_type
&& TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
)
3245 arg
= TYPE_STUB_DECL (arg
);
3246 else if (is_tmpl_type
&& TREE_CODE (arg
) == RECORD_TYPE
)
3247 arg
= CLASSTYPE_TI_TEMPLATE (arg
);
3249 is_type
= TYPE_P (arg
) || is_tmpl_type
;
3251 if (requires_type
&& ! is_type
&& TREE_CODE (arg
) == SCOPE_REF
3252 && TREE_CODE (TREE_OPERAND (arg
, 0)) == TEMPLATE_TYPE_PARM
)
3254 cp_pedwarn ("to refer to a type member of a template parameter, use `typename %E'", arg
);
3256 arg
= make_typename_type (TREE_OPERAND (arg
, 0),
3257 TREE_OPERAND (arg
, 1),
3261 if (is_type
!= requires_type
)
3267 cp_error ("type/value mismatch at argument %d in template parameter list for `%D'",
3270 cp_error (" expected a constant of type `%T', got `%T'",
3272 (is_tmpl_type
? DECL_NAME (arg
) : arg
));
3274 cp_error (" expected a type, got `%E'", arg
);
3277 return error_mark_node
;
3279 if (is_tmpl_type
^ requires_tmpl_type
)
3281 if (in_decl
&& complain
)
3283 cp_error ("type/value mismatch at argument %d in template parameter list for `%D'",
3286 cp_error (" expected a type, got `%T'", DECL_NAME (arg
));
3288 cp_error (" expected a class template, got `%T'", arg
);
3290 return error_mark_node
;
3295 if (requires_tmpl_type
)
3297 tree parmparm
= DECL_INNERMOST_TEMPLATE_PARMS (parm
);
3298 tree argparm
= DECL_INNERMOST_TEMPLATE_PARMS (arg
);
3300 if (coerce_template_template_parms (parmparm
, argparm
, complain
,
3301 in_decl
, inner_args
))
3305 /* TEMPLATE_TEMPLATE_PARM node is preferred over
3307 if (val
!= error_mark_node
3308 && DECL_TEMPLATE_TEMPLATE_PARM_P (val
))
3309 val
= TREE_TYPE (val
);
3313 if (in_decl
&& complain
)
3315 cp_error ("type/value mismatch at argument %d in template parameter list for `%D'",
3317 cp_error (" expected a template of type `%D', got `%D'", parm
, arg
);
3320 val
= error_mark_node
;
3325 val
= groktypename (arg
);
3326 if (! processing_template_decl
)
3328 /* [basic.link]: A name with no linkage (notably, the
3329 name of a class or enumeration declared in a local
3330 scope) shall not be used to declare an entity with
3331 linkage. This implies that names with no linkage
3332 cannot be used as template arguments. */
3333 tree t
= no_linkage_check (val
);
3336 if (ANON_AGGRNAME_P (TYPE_IDENTIFIER (t
)))
3338 ("template-argument `%T' uses anonymous type", val
);
3341 ("template-argument `%T' uses local type `%T'",
3343 return error_mark_node
;
3350 tree t
= tsubst (TREE_TYPE (parm
), args
, complain
, in_decl
);
3352 if (processing_template_decl
)
3353 arg
= maybe_fold_nontype_arg (arg
);
3355 if (!uses_template_parms (arg
) && !uses_template_parms (t
))
3356 /* We used to call digest_init here. However, digest_init
3357 will report errors, which we don't want when complain
3358 is zero. More importantly, digest_init will try too
3359 hard to convert things: for example, `0' should not be
3360 converted to pointer type at this point according to
3361 the standard. Accepting this is not merely an
3362 extension, since deciding whether or not these
3363 conversions can occur is part of determining which
3364 function template to call, or whether a given explicit
3365 argument specification is legal. */
3366 val
= convert_nontype_argument (t
, arg
);
3370 if (val
== NULL_TREE
)
3371 val
= error_mark_node
;
3372 else if (val
== error_mark_node
&& complain
)
3373 cp_error ("could not convert template argument `%E' to `%T'",
3380 /* Convert all template arguments to their appropriate types, and
3381 return a vector containing the innermost resulting template
3382 arguments. If any error occurs, return error_mark_node, and, if
3383 COMPLAIN is non-zero, issue an error message. Some error messages
3384 are issued even if COMPLAIN is zero; for instance, if a template
3385 argument is composed from a local class.
3387 If REQUIRE_ALL_ARGUMENTS is non-zero, all arguments must be
3388 provided in ARGLIST, or else trailing parameters must have default
3389 values. If REQUIRE_ALL_ARGUMENTS is zero, we will attempt argument
3390 deduction for any unspecified trailing arguments. */
3393 coerce_template_parms (parms
, args
, in_decl
,
3395 require_all_arguments
)
3399 int require_all_arguments
;
3401 int nparms
, nargs
, i
, lost
= 0;
3404 tree new_inner_args
;
3406 inner_args
= INNERMOST_TEMPLATE_ARGS (args
);
3407 nargs
= NUM_TMPL_ARGS (inner_args
);
3408 nparms
= TREE_VEC_LENGTH (parms
);
3412 && require_all_arguments
3413 && TREE_PURPOSE (TREE_VEC_ELT (parms
, nargs
)) == NULL_TREE
))
3417 cp_error ("wrong number of template arguments (%d, should be %d)",
3421 cp_error_at ("provided for `%D'", in_decl
);
3424 return error_mark_node
;
3427 new_inner_args
= make_tree_vec (nparms
);
3428 new_args
= add_outermost_template_args (args
, new_inner_args
);
3429 for (i
= 0; i
< nparms
; i
++)
3434 /* Get the Ith template parameter. */
3435 parm
= TREE_VEC_ELT (parms
, i
);
3437 /* Calculate the Ith argument. */
3438 if (inner_args
&& TREE_CODE (inner_args
) == TREE_LIST
)
3440 arg
= TREE_VALUE (inner_args
);
3441 inner_args
= TREE_CHAIN (inner_args
);
3444 arg
= TREE_VEC_ELT (inner_args
, i
);
3445 /* If no template argument was supplied, look for a default
3447 else if (TREE_PURPOSE (parm
) == NULL_TREE
)
3449 /* There was no default value. */
3450 my_friendly_assert (!require_all_arguments
, 0);
3453 else if (TREE_CODE (TREE_VALUE (parm
)) == TYPE_DECL
)
3454 arg
= tsubst (TREE_PURPOSE (parm
), new_args
, complain
, in_decl
);
3456 arg
= tsubst_expr (TREE_PURPOSE (parm
), new_args
, complain
,
3459 /* Now, convert the Ith argument, as necessary. */
3460 if (arg
== NULL_TREE
)
3461 /* We're out of arguments. */
3463 my_friendly_assert (!require_all_arguments
, 0);
3466 else if (arg
== error_mark_node
)
3468 cp_error ("template argument %d is invalid", i
+ 1);
3469 arg
= error_mark_node
;
3472 arg
= convert_template_argument (TREE_VALUE (parm
),
3473 arg
, new_args
, complain
, i
,
3476 if (arg
== error_mark_node
)
3478 TREE_VEC_ELT (new_inner_args
, i
) = arg
;
3482 return error_mark_node
;
3484 return new_inner_args
;
3487 /* Returns 1 if template args OT and NT are equivalent. */
3490 template_args_equal (ot
, nt
)
3496 if (TREE_CODE (nt
) == TREE_VEC
)
3497 /* For member templates */
3498 return TREE_CODE (ot
) == TREE_VEC
&& comp_template_args (ot
, nt
);
3499 else if (TYPE_P (nt
))
3500 return TYPE_P (ot
) && same_type_p (ot
, nt
);
3501 else if (TREE_CODE (ot
) == TREE_VEC
|| TYPE_P (ot
))
3504 return (cp_tree_equal (ot
, nt
) > 0);
3507 /* Returns 1 iff the OLDARGS and NEWARGS are in fact identical sets
3508 of template arguments. Returns 0 otherwise. */
3511 comp_template_args (oldargs
, newargs
)
3512 tree oldargs
, newargs
;
3516 if (TREE_VEC_LENGTH (oldargs
) != TREE_VEC_LENGTH (newargs
))
3519 for (i
= 0; i
< TREE_VEC_LENGTH (oldargs
); ++i
)
3521 tree nt
= TREE_VEC_ELT (newargs
, i
);
3522 tree ot
= TREE_VEC_ELT (oldargs
, i
);
3524 if (! template_args_equal (ot
, nt
))
3530 /* Given class template name and parameter list, produce a user-friendly name
3531 for the instantiation. */
3534 mangle_class_name_for_template (name
, parms
, arglist
)
3536 tree parms
, arglist
;
3538 static struct obstack scratch_obstack
;
3539 static char *scratch_firstobj
;
3542 if (!scratch_firstobj
)
3543 gcc_obstack_init (&scratch_obstack
);
3545 obstack_free (&scratch_obstack
, scratch_firstobj
);
3546 scratch_firstobj
= obstack_alloc (&scratch_obstack
, 1);
3548 #define ccat(c) obstack_1grow (&scratch_obstack, (c));
3549 #define cat(s) obstack_grow (&scratch_obstack, (s), strlen (s))
3553 nparms
= TREE_VEC_LENGTH (parms
);
3554 arglist
= INNERMOST_TEMPLATE_ARGS (arglist
);
3555 my_friendly_assert (nparms
== TREE_VEC_LENGTH (arglist
), 268);
3556 for (i
= 0; i
< nparms
; i
++)
3558 tree parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
3559 tree arg
= TREE_VEC_ELT (arglist
, i
);
3564 if (TREE_CODE (parm
) == TYPE_DECL
)
3566 cat (type_as_string (arg
, TFF_CHASE_TYPEDEF
));
3569 else if (TREE_CODE (parm
) == TEMPLATE_DECL
)
3571 if (TREE_CODE (arg
) == TEMPLATE_DECL
)
3573 /* Already substituted with real template. Just output
3574 the template name here */
3575 tree context
= DECL_CONTEXT (arg
);
3578 /* The template may be defined in a namespace, or
3579 may be a member template. */
3580 my_friendly_assert (TREE_CODE (context
) == NAMESPACE_DECL
3581 || CLASS_TYPE_P (context
),
3583 cat(decl_as_string (DECL_CONTEXT (arg
), TFF_PLAIN_IDENTIFIER
));
3586 cat (IDENTIFIER_POINTER (DECL_NAME (arg
)));
3589 /* Output the parameter declaration */
3590 cat (type_as_string (arg
, TFF_CHASE_TYPEDEF
));
3594 my_friendly_assert (TREE_CODE (parm
) == PARM_DECL
, 269);
3596 if (TREE_CODE (arg
) == TREE_LIST
)
3598 /* New list cell was built because old chain link was in
3600 my_friendly_assert (TREE_PURPOSE (arg
) == NULL_TREE
, 270);
3601 arg
= TREE_VALUE (arg
);
3603 /* No need to check arglist against parmlist here; we did that
3604 in coerce_template_parms, called from lookup_template_class. */
3605 cat (expr_as_string (arg
, TFF_PLAIN_IDENTIFIER
));
3608 char *bufp
= obstack_next_free (&scratch_obstack
);
3610 while (bufp
[offset
- 1] == ' ')
3612 obstack_blank_fast (&scratch_obstack
, offset
);
3614 /* B<C<char> >, not B<C<char>> */
3615 if (bufp
[offset
- 1] == '>')
3620 return (char *) obstack_base (&scratch_obstack
);
3624 classtype_mangled_name (t
)
3627 if (CLASSTYPE_TEMPLATE_INFO (t
)
3628 /* Specializations have already had their names set up in
3629 lookup_template_class. */
3630 && !CLASSTYPE_TEMPLATE_SPECIALIZATION (t
))
3632 tree tmpl
= most_general_template (CLASSTYPE_TI_TEMPLATE (t
));
3634 /* For non-primary templates, the template parameters are
3635 implicit from their surrounding context. */
3636 if (PRIMARY_TEMPLATE_P (tmpl
))
3638 tree name
= DECL_NAME (tmpl
);
3639 char *mangled_name
= mangle_class_name_for_template
3640 (IDENTIFIER_POINTER (name
),
3641 DECL_INNERMOST_TEMPLATE_PARMS (tmpl
),
3642 CLASSTYPE_TI_ARGS (t
));
3643 tree id
= get_identifier (mangled_name
);
3644 IDENTIFIER_TEMPLATE (id
) = name
;
3649 return TYPE_IDENTIFIER (t
);
3653 add_pending_template (d
)
3656 tree ti
= (TYPE_P (d
)
3657 ? CLASSTYPE_TEMPLATE_INFO (d
)
3658 : DECL_TEMPLATE_INFO (d
));
3661 if (TI_PENDING_TEMPLATE_FLAG (ti
))
3664 /* We are called both from instantiate_decl, where we've already had a
3665 tinst_level pushed, and instantiate_template, where we haven't.
3667 level
= !(current_tinst_level
&& TINST_DECL (current_tinst_level
) == d
);
3670 push_tinst_level (d
);
3672 *template_tail
= tree_cons (current_tinst_level
, d
, NULL_TREE
);
3673 template_tail
= &TREE_CHAIN (*template_tail
);
3674 TI_PENDING_TEMPLATE_FLAG (ti
) = 1;
3681 /* Return a TEMPLATE_ID_EXPR corresponding to the indicated FNS (which
3682 may be either a _DECL or an overloaded function or an
3683 IDENTIFIER_NODE), and ARGLIST. */
3686 lookup_template_function (fns
, arglist
)
3691 if (fns
== NULL_TREE
)
3693 cp_error ("non-template used as template");
3694 return error_mark_node
;
3697 type
= TREE_TYPE (fns
);
3698 if (TREE_CODE (fns
) == OVERLOAD
|| !type
)
3699 type
= unknown_type_node
;
3701 if (processing_template_decl
)
3702 return build_min (TEMPLATE_ID_EXPR
, type
, fns
, arglist
);
3704 return build (TEMPLATE_ID_EXPR
, type
, fns
, arglist
);
3707 /* Within the scope of a template class S<T>, the name S gets bound
3708 (in build_self_reference) to a TYPE_DECL for the class, not a
3709 TEMPLATE_DECL. If DECL is a TYPE_DECL for current_class_type,
3710 or one of its enclosing classes, and that type is a template,
3711 return the associated TEMPLATE_DECL. Otherwise, the original
3712 DECL is returned. */
3715 maybe_get_template_decl_from_type_decl (decl
)
3718 return (decl
!= NULL_TREE
3719 && TREE_CODE (decl
) == TYPE_DECL
3720 && DECL_ARTIFICIAL (decl
)
3721 && CLASS_TYPE_P (TREE_TYPE (decl
))
3722 && CLASSTYPE_TEMPLATE_INFO (TREE_TYPE (decl
)))
3723 ? CLASSTYPE_TI_TEMPLATE (TREE_TYPE (decl
)) : decl
;
3726 /* Given an IDENTIFIER_NODE (type TEMPLATE_DECL) and a chain of
3727 parameters, find the desired type.
3729 D1 is the PTYPENAME terminal, and ARGLIST is the list of arguments.
3730 (Actually ARGLIST may be either a TREE_LIST or a TREE_VEC. It will
3731 be a TREE_LIST if called directly from the parser, and a TREE_VEC
3734 IN_DECL, if non-NULL, is the template declaration we are trying to
3737 If ENTERING_SCOPE is non-zero, we are about to enter the scope of
3738 the class we are looking up.
3740 If the template class is really a local class in a template
3741 function, then the FUNCTION_CONTEXT is the function in which it is
3742 being instantiated. */
3745 lookup_template_class (d1
, arglist
, in_decl
, context
, entering_scope
)
3751 tree
template = NULL_TREE
, parmlist
;
3754 if (TREE_CODE (d1
) == IDENTIFIER_NODE
)
3756 if (IDENTIFIER_VALUE (d1
)
3757 && DECL_TEMPLATE_TEMPLATE_PARM_P (IDENTIFIER_VALUE (d1
)))
3758 template = IDENTIFIER_VALUE (d1
);
3762 push_decl_namespace (context
);
3763 template = lookup_name (d1
, /*prefer_type=*/0);
3764 template = maybe_get_template_decl_from_type_decl (template);
3766 pop_decl_namespace ();
3769 context
= DECL_CONTEXT (template);
3771 else if (TREE_CODE (d1
) == TYPE_DECL
&& IS_AGGR_TYPE (TREE_TYPE (d1
)))
3773 tree type
= TREE_TYPE (d1
);
3775 /* If we are declaring a constructor, say A<T>::A<T>, we will get
3776 an implicit typename for the second A. Deal with it. */
3777 if (TREE_CODE (type
) == TYPENAME_TYPE
&& TREE_TYPE (type
))
3778 type
= TREE_TYPE (type
);
3780 if (CLASSTYPE_TEMPLATE_INFO (type
))
3782 template = CLASSTYPE_TI_TEMPLATE (type
);
3783 d1
= DECL_NAME (template);
3786 else if (TREE_CODE (d1
) == ENUMERAL_TYPE
3787 || (TYPE_P (d1
) && IS_AGGR_TYPE (d1
)))
3789 template = TYPE_TI_TEMPLATE (d1
);
3790 d1
= DECL_NAME (template);
3792 else if (TREE_CODE (d1
) == TEMPLATE_DECL
3793 && TREE_CODE (DECL_TEMPLATE_RESULT (d1
)) == TYPE_DECL
)
3796 d1
= DECL_NAME (template);
3797 context
= DECL_CONTEXT (template);
3800 /* With something like `template <class T> class X class X { ... };'
3801 we could end up with D1 having nothing but an IDENTIFIER_VALUE.
3802 We don't want to do that, but we have to deal with the situation,
3803 so let's give them some syntax errors to chew on instead of a
3804 crash. Alternatively D1 might not be a template type at all. */
3807 cp_error ("`%T' is not a template", d1
);
3808 return error_mark_node
;
3811 if (TREE_CODE (template) != TEMPLATE_DECL
)
3813 cp_error ("non-template type `%T' used as a template", d1
);
3815 cp_error_at ("for template declaration `%D'", in_decl
);
3816 return error_mark_node
;
3819 if (DECL_TEMPLATE_TEMPLATE_PARM_P (template))
3821 /* Create a new TEMPLATE_DECL and TEMPLATE_TEMPLATE_PARM node to store
3822 template arguments */
3827 parmlist
= DECL_INNERMOST_TEMPLATE_PARMS (template);
3829 arglist2
= coerce_template_parms (parmlist
, arglist
, template, 1, 1);
3830 if (arglist2
== error_mark_node
)
3831 return error_mark_node
;
3833 parm
= copy_template_template_parm (TREE_TYPE (template), arglist2
);
3834 TYPE_SIZE (parm
) = 0;
3839 tree template_type
= TREE_TYPE (template);
3842 tree found
= NULL_TREE
;
3846 int is_partial_instantiation
;
3848 gen_tmpl
= most_general_template (template);
3849 parmlist
= DECL_TEMPLATE_PARMS (gen_tmpl
);
3850 parm_depth
= TMPL_PARMS_DEPTH (parmlist
);
3851 arg_depth
= TMPL_ARGS_DEPTH (arglist
);
3853 if (arg_depth
== 1 && parm_depth
> 1)
3855 /* We've been given an incomplete set of template arguments.
3858 template <class T> struct S1 {
3859 template <class U> struct S2 {};
3860 template <class U> struct S2<U*> {};
3863 we will be called with an ARGLIST of `U*', but the
3864 TEMPLATE will be `template <class T> template
3865 <class U> struct S1<T>::S2'. We must fill in the missing
3868 = add_outermost_template_args (TYPE_TI_ARGS (TREE_TYPE (template)),
3870 arg_depth
= TMPL_ARGS_DEPTH (arglist
);
3873 /* Now we should enough arguments. */
3874 my_friendly_assert (parm_depth
== arg_depth
, 0);
3876 /* From here on, we're only interested in the most general
3878 template = gen_tmpl
;
3880 /* Calculate the BOUND_ARGS. These will be the args that are
3881 actually tsubst'd into the definition to create the
3885 /* We have multiple levels of arguments to coerce, at once. */
3887 int saved_depth
= TMPL_ARGS_DEPTH (arglist
);
3889 tree bound_args
= make_tree_vec (parm_depth
);
3891 for (i
= saved_depth
,
3892 t
= DECL_TEMPLATE_PARMS (template);
3893 i
> 0 && t
!= NULL_TREE
;
3894 --i
, t
= TREE_CHAIN (t
))
3896 tree a
= coerce_template_parms (TREE_VALUE (t
),
3897 arglist
, template, 1, 1);
3898 SET_TMPL_ARGS_LEVEL (bound_args
, i
, a
);
3900 /* We temporarily reduce the length of the ARGLIST so
3901 that coerce_template_parms will see only the arguments
3902 corresponding to the template parameters it is
3904 TREE_VEC_LENGTH (arglist
)--;
3907 /* Restore the ARGLIST to its full size. */
3908 TREE_VEC_LENGTH (arglist
) = saved_depth
;
3910 arglist
= bound_args
;
3914 = coerce_template_parms (INNERMOST_TEMPLATE_PARMS (parmlist
),
3915 INNERMOST_TEMPLATE_ARGS (arglist
),
3918 if (arglist
== error_mark_node
)
3919 /* We were unable to bind the arguments. */
3920 return error_mark_node
;
3922 /* In the scope of a template class, explicit references to the
3923 template class refer to the type of the template, not any
3924 instantiation of it. For example, in:
3926 template <class T> class C { void f(C<T>); }
3928 the `C<T>' is just the same as `C'. Outside of the
3929 class, however, such a reference is an instantiation. */
3930 if (comp_template_args (TYPE_TI_ARGS (template_type
),
3933 found
= template_type
;
3935 if (!entering_scope
&& PRIMARY_TEMPLATE_P (template))
3939 /* Note that we use DECL_CONTEXT, rather than
3940 CP_DECL_CONTEXT, so that the termination test is
3941 always just `ctx'. We're not interested in namespace
3943 for (ctx
= current_class_type
;
3945 ctx
= (TYPE_P (ctx
)) ? TYPE_CONTEXT (ctx
) : DECL_CONTEXT (ctx
))
3946 if (same_type_p (ctx
, template_type
))
3950 /* We're not in the scope of the class, so the
3951 TEMPLATE_TYPE is not the type we want after
3959 for (tp
= &DECL_TEMPLATE_INSTANTIATIONS (template);
3961 tp
= &TREE_CHAIN (*tp
))
3962 if (comp_template_args (TREE_PURPOSE (*tp
), arglist
))
3966 /* Use the move-to-front heuristic to speed up future
3968 *tp
= TREE_CHAIN (*tp
);
3970 = DECL_TEMPLATE_INSTANTIATIONS (template);
3971 DECL_TEMPLATE_INSTANTIATIONS (template) = found
;
3973 return TREE_VALUE (found
);
3976 /* This type is a "partial instantiation" if any of the template
3977 arguments still involve template parameters. Note that we set
3978 IS_PARTIAL_INSTANTIATION for partial specializations as
3980 is_partial_instantiation
= uses_template_parms (arglist
);
3982 if (!is_partial_instantiation
3983 && !PRIMARY_TEMPLATE_P (template)
3984 && TREE_CODE (CP_DECL_CONTEXT (template)) == NAMESPACE_DECL
)
3986 found
= xref_tag_from_type (TREE_TYPE (template),
3987 DECL_NAME (template),
3992 context
= tsubst (DECL_CONTEXT (template), arglist
,
3993 /*complain=*/0, in_decl
);
3995 context
= global_namespace
;
3997 /* Create the type. */
3998 if (TREE_CODE (template_type
) == ENUMERAL_TYPE
)
4000 if (!is_partial_instantiation
)
4002 set_current_access_from_decl (TYPE_NAME (template_type
));
4003 t
= start_enum (TYPE_IDENTIFIER (template_type
));
4006 /* We don't want to call start_enum for this type, since
4007 the values for the enumeration constants may involve
4008 template parameters. And, no one should be interested
4009 in the enumeration constants for such a type. */
4010 t
= make_node (ENUMERAL_TYPE
);
4014 t
= make_aggr_type (TREE_CODE (template_type
));
4015 CLASSTYPE_DECLARED_CLASS (t
)
4016 = CLASSTYPE_DECLARED_CLASS (template_type
);
4017 CLASSTYPE_GOT_SEMICOLON (t
) = 1;
4018 SET_CLASSTYPE_IMPLICIT_INSTANTIATION (t
);
4019 TYPE_FOR_JAVA (t
) = TYPE_FOR_JAVA (template_type
);
4021 /* A local class. Make sure the decl gets registered properly. */
4022 if (context
== current_function_decl
)
4023 pushtag (DECL_NAME (template), t
, 0);
4026 /* If we called start_enum or pushtag above, this information
4027 will already be set up. */
4030 TYPE_CONTEXT (t
) = FROB_CONTEXT (context
);
4032 type_decl
= create_implicit_typedef (DECL_NAME (template), t
);
4033 DECL_CONTEXT (type_decl
) = TYPE_CONTEXT (t
);
4034 TYPE_STUB_DECL (t
) = type_decl
;
4035 DECL_SOURCE_FILE (type_decl
)
4036 = DECL_SOURCE_FILE (TYPE_STUB_DECL (template_type
));
4037 DECL_SOURCE_LINE (type_decl
)
4038 = DECL_SOURCE_LINE (TYPE_STUB_DECL (template_type
));
4041 type_decl
= TYPE_NAME (t
);
4043 /* Set up the template information. We have to figure out which
4044 template is the immediate parent if this is a full
4046 if (parm_depth
== 1 || is_partial_instantiation
4047 || !PRIMARY_TEMPLATE_P (template))
4048 /* This case is easy; there are no member templates involved. */
4052 /* This is a full instantiation of a member template. Look
4053 for a partial instantiation of which this is an instance. */
4055 for (found
= DECL_TEMPLATE_INSTANTIATIONS (template);
4056 found
; found
= TREE_CHAIN (found
))
4059 tree tmpl
= CLASSTYPE_TI_TEMPLATE (TREE_VALUE (found
));
4061 /* We only want partial instantiations, here, not
4062 specializations or full instantiations. */
4063 if (CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_VALUE (found
))
4064 || !uses_template_parms (TREE_VALUE (found
)))
4067 /* Temporarily reduce by one the number of levels in the
4068 ARGLIST and in FOUND so as to avoid comparing the
4069 last set of arguments. */
4070 TREE_VEC_LENGTH (arglist
)--;
4071 TREE_VEC_LENGTH (TREE_PURPOSE (found
)) --;
4073 /* See if the arguments match. If they do, then TMPL is
4074 the partial instantiation we want. */
4075 success
= comp_template_args (TREE_PURPOSE (found
), arglist
);
4077 /* Restore the argument vectors to their full size. */
4078 TREE_VEC_LENGTH (arglist
)++;
4079 TREE_VEC_LENGTH (TREE_PURPOSE (found
))++;
4090 /* There was no partial instantiation. This happens
4091 where C<T> is a member template of A<T> and it's used
4094 template <typename T> struct B { A<T>::C<int> m; };
4097 Create the partial instantiation.
4099 TREE_VEC_LENGTH (arglist
)--;
4100 template = tsubst (template, arglist
, /*complain=*/0, NULL_TREE
);
4101 TREE_VEC_LENGTH (arglist
)++;
4106 SET_TYPE_TEMPLATE_INFO (t
, tree_cons (found
, arglist
, NULL_TREE
));
4107 DECL_TEMPLATE_INSTANTIATIONS (template)
4108 = tree_cons (arglist
, t
,
4109 DECL_TEMPLATE_INSTANTIATIONS (template));
4111 if (TREE_CODE (t
) == ENUMERAL_TYPE
4112 && !is_partial_instantiation
)
4113 /* Now that the type has been registered on the instantiations
4114 list, we set up the enumerators. Because the enumeration
4115 constants may involve the enumeration type itself, we make
4116 sure to register the type first, and then create the
4117 constants. That way, doing tsubst_expr for the enumeration
4118 constants won't result in recursive calls here; we'll find
4119 the instantiation and exit above. */
4120 tsubst_enum (template_type
, t
, arglist
);
4122 /* Reset the name of the type, now that CLASSTYPE_TEMPLATE_INFO
4124 if (TREE_CODE (t
) != ENUMERAL_TYPE
)
4125 DECL_NAME (type_decl
) = classtype_mangled_name (t
);
4126 DECL_ASSEMBLER_NAME (type_decl
) = DECL_NAME (type_decl
);
4127 if (!is_partial_instantiation
)
4130 DECL_ASSEMBLER_NAME (type_decl
) = mangle_decl (type_decl
);
4132 DECL_ASSEMBLER_NAME (type_decl
)
4133 = get_identifier (build_overload_name (t
, 1, 1));
4135 /* For backwards compatibility; code that uses
4136 -fexternal-templates expects looking up a template to
4137 instantiate it. I think DDD still relies on this.
4138 (jason 8/20/1998) */
4139 if (TREE_CODE (t
) != ENUMERAL_TYPE
4140 && flag_external_templates
4141 && CLASSTYPE_INTERFACE_KNOWN (TREE_TYPE (template))
4142 && ! CLASSTYPE_INTERFACE_ONLY (TREE_TYPE (template)))
4143 add_pending_template (t
);
4146 /* If the type makes use of template parameters, the
4147 code that generates debugging information will crash. */
4148 DECL_IGNORED_P (TYPE_STUB_DECL (t
)) = 1;
4160 /* Called from for_each_template_parm via walk_tree. */
4163 for_each_template_parm_r (tp
, walk_subtrees
, d
)
4169 struct pair_fn_data
*pfd
= (struct pair_fn_data
*) d
;
4170 tree_fn_t fn
= pfd
->fn
;
4171 void *data
= pfd
->data
;
4174 && for_each_template_parm (TYPE_CONTEXT (t
), fn
, data
))
4175 return error_mark_node
;
4177 switch (TREE_CODE (t
))
4180 if (TYPE_PTRMEMFUNC_P (t
))
4186 if (!TYPE_TEMPLATE_INFO (t
))
4188 else if (for_each_template_parm (TREE_VALUE (TYPE_TEMPLATE_INFO (t
)),
4190 return error_mark_node
;
4194 /* Since we're not going to walk subtrees, we have to do this
4196 if (for_each_template_parm (TYPE_METHOD_BASETYPE (t
), fn
, data
))
4197 return error_mark_node
;
4201 /* Check the return type. */
4202 if (for_each_template_parm (TREE_TYPE (t
), fn
, data
))
4203 return error_mark_node
;
4205 /* Check the parameter types. Since default arguments are not
4206 instantiated until they are needed, the TYPE_ARG_TYPES may
4207 contain expressions that involve template parameters. But,
4208 no-one should be looking at them yet. And, once they're
4209 instantiated, they don't contain template parameters, so
4210 there's no point in looking at them then, either. */
4214 for (parm
= TYPE_ARG_TYPES (t
); parm
; parm
= TREE_CHAIN (parm
))
4215 if (for_each_template_parm (TREE_VALUE (parm
), fn
, data
))
4216 return error_mark_node
;
4218 /* Since we've already handled the TYPE_ARG_TYPES, we don't
4219 want walk_tree walking into them itself. */
4226 if (DECL_LANG_SPECIFIC (t
) && DECL_TEMPLATE_INFO (t
)
4227 && for_each_template_parm (DECL_TI_ARGS (t
), fn
, data
))
4228 return error_mark_node
;
4233 if (DECL_CONTEXT (t
)
4234 && for_each_template_parm (DECL_CONTEXT (t
), fn
, data
))
4235 return error_mark_node
;
4238 case BOUND_TEMPLATE_TEMPLATE_PARM
:
4239 /* Record template parameters such as `T' inside `TT<T>'. */
4240 if (for_each_template_parm (TYPE_TI_ARGS (t
), fn
, data
))
4241 return error_mark_node
;
4244 case TEMPLATE_TEMPLATE_PARM
:
4245 case TEMPLATE_TYPE_PARM
:
4246 case TEMPLATE_PARM_INDEX
:
4247 if (fn
&& (*fn
)(t
, data
))
4248 return error_mark_node
;
4250 return error_mark_node
;
4254 /* A template template parameter is encountered */
4255 if (DECL_TEMPLATE_TEMPLATE_PARM_P (t
)
4256 && for_each_template_parm (TREE_TYPE (t
), fn
, data
))
4257 return error_mark_node
;
4259 /* Already substituted template template parameter */
4264 if (!fn
|| for_each_template_parm (TYPENAME_TYPE_FULLNAME (t
), fn
, data
))
4265 return error_mark_node
;
4269 if (TREE_TYPE (t
) && TYPE_PTRMEMFUNC_P (TREE_TYPE (t
))
4270 && for_each_template_parm (TYPE_PTRMEMFUNC_FN_TYPE
4271 (TREE_TYPE (t
)), fn
, data
))
4272 return error_mark_node
;
4277 /* If there's no type, then this thing must be some expression
4278 involving template parameters. */
4279 if (!fn
&& !TREE_TYPE (t
))
4280 return error_mark_node
;
4285 case REINTERPRET_CAST_EXPR
:
4286 case CONST_CAST_EXPR
:
4287 case STATIC_CAST_EXPR
:
4288 case DYNAMIC_CAST_EXPR
:
4293 case PSEUDO_DTOR_EXPR
:
4295 return error_mark_node
;
4302 /* We didn't find any template parameters we liked. */
4306 /* For each TEMPLATE_TYPE_PARM, TEMPLATE_TEMPLATE_PARM,
4307 BOUND_TEMPLATE_TEMPLATE_PARM or TEMPLATE_PARM_INDEX in T,
4308 call FN with the parameter and the DATA.
4309 If FN returns non-zero, the iteration is terminated, and
4310 for_each_template_parm returns 1. Otherwise, the iteration
4311 continues. If FN never returns a non-zero value, the value
4312 returned by for_each_template_parm is 0. If FN is NULL, it is
4313 considered to be the function which always returns 1. */
4316 for_each_template_parm (t
, fn
, data
)
4321 struct pair_fn_data pfd
;
4327 /* Walk the tree. (Conceptually, we would like to walk without
4328 duplicates, but for_each_template_parm_r recursively calls
4329 for_each_template_parm, so we would need to reorganize a fair
4330 bit to use walk_tree_without_duplicates.) */
4331 return walk_tree (&t
,
4332 for_each_template_parm_r
,
4338 uses_template_parms (t
)
4341 return for_each_template_parm (t
, 0, 0);
4344 static int tinst_depth
;
4345 extern int max_tinst_depth
;
4346 #ifdef GATHER_STATISTICS
4349 static int tinst_level_tick
;
4350 static int last_template_error_tick
;
4352 /* We're starting to instantiate D; record the template instantiation context
4353 for diagnostics and to restore it later. */
4356 push_tinst_level (d
)
4361 if (tinst_depth
>= max_tinst_depth
)
4363 /* If the instantiation in question still has unbound template parms,
4364 we don't really care if we can't instantiate it, so just return.
4365 This happens with base instantiation for implicit `typename'. */
4366 if (uses_template_parms (d
))
4369 last_template_error_tick
= tinst_level_tick
;
4370 cp_error ("template instantiation depth exceeds maximum of %d (use -ftemplate-depth-NN to increase the maximum) instantiating `%D'",
4371 max_tinst_depth
, d
);
4373 print_instantiation_context ();
4378 new = build_expr_wfl (d
, input_filename
, lineno
, 0);
4379 TREE_CHAIN (new) = current_tinst_level
;
4380 current_tinst_level
= new;
4383 #ifdef GATHER_STATISTICS
4384 if (tinst_depth
> depth_reached
)
4385 depth_reached
= tinst_depth
;
4392 /* We're done instantiating this template; return to the instantiation
4398 tree old
= current_tinst_level
;
4400 /* Restore the filename and line number stashed away when we started
4401 this instantiation. */
4402 lineno
= TINST_LINE (old
);
4403 input_filename
= TINST_FILE (old
);
4404 extract_interface_info ();
4406 current_tinst_level
= TREE_CHAIN (old
);
4411 /* We're instantiating a deferred template; restore the template
4412 instantiation context in which the instantiation was requested, which
4413 is one step out from LEVEL. */
4416 reopen_tinst_level (level
)
4422 for (t
= level
; t
; t
= TREE_CHAIN (t
))
4425 current_tinst_level
= level
;
4429 /* Return the outermost template instantiation context, for use with
4430 -falt-external-templates. */
4435 tree p
= current_tinst_level
;
4438 for (; TREE_CHAIN (p
) ; p
= TREE_CHAIN (p
))
4443 /* DECL is a friend FUNCTION_DECL or TEMPLATE_DECL. ARGS is the
4444 vector of template arguments, as for tsubst.
4446 Returns an appropriate tsubst'd friend declaration. */
4449 tsubst_friend_function (decl
, args
)
4455 const char *file
= input_filename
;
4457 lineno
= DECL_SOURCE_LINE (decl
);
4458 input_filename
= DECL_SOURCE_FILE (decl
);
4460 if (TREE_CODE (decl
) == FUNCTION_DECL
4461 && DECL_TEMPLATE_INSTANTIATION (decl
)
4462 && TREE_CODE (DECL_TI_TEMPLATE (decl
)) != TEMPLATE_DECL
)
4463 /* This was a friend declared with an explicit template
4464 argument list, e.g.:
4468 to indicate that f was a template instantiation, not a new
4469 function declaration. Now, we have to figure out what
4470 instantiation of what template. */
4472 tree template_id
, arglist
, fns
;
4475 tree ns
= CP_DECL_CONTEXT (TYPE_MAIN_DECL (current_class_type
));
4477 /* Friend functions are looked up in the containing namespace scope.
4478 We must enter that scope, to avoid finding member functions of the
4479 current cless with same name. */
4480 push_nested_namespace (ns
);
4481 fns
= tsubst_expr (DECL_TI_TEMPLATE (decl
), args
,
4482 /*complain=*/1, NULL_TREE
);
4483 pop_nested_namespace (ns
);
4484 arglist
= tsubst (DECL_TI_ARGS (decl
), args
,
4485 /*complain=*/1, NULL_TREE
);
4486 template_id
= lookup_template_function (fns
, arglist
);
4488 new_friend
= tsubst (decl
, args
, /*complain=*/1, NULL_TREE
);
4489 tmpl
= determine_specialization (template_id
, new_friend
,
4491 /*need_member_template=*/0);
4492 new_friend
= instantiate_template (tmpl
, new_args
);
4496 new_friend
= tsubst (decl
, args
, /*complain=*/1, NULL_TREE
);
4498 /* The NEW_FRIEND will look like an instantiation, to the
4499 compiler, but is not an instantiation from the point of view of
4500 the language. For example, we might have had:
4502 template <class T> struct S {
4503 template <class U> friend void f(T, U);
4506 Then, in S<int>, template <class U> void f(int, U) is not an
4507 instantiation of anything. */
4508 DECL_USE_TEMPLATE (new_friend
) = 0;
4509 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
4511 DECL_USE_TEMPLATE (DECL_TEMPLATE_RESULT (new_friend
)) = 0;
4512 DECL_SAVED_TREE (DECL_TEMPLATE_RESULT (new_friend
))
4513 = DECL_SAVED_TREE (DECL_TEMPLATE_RESULT (decl
));
4516 /* The mangled name for the NEW_FRIEND is incorrect. The call to
4517 tsubst will have resulted in a call to
4518 set_mangled_name_for_template_decl. But, the function is not a
4519 template instantiation and should not be mangled like one.
4520 Therefore, we remangle the function name. We don't have to do
4521 this if the NEW_FRIEND is a template since
4522 set_mangled_name_for_template_decl doesn't do anything if the
4523 function declaration still uses template arguments. */
4524 if (TREE_CODE (new_friend
) != TEMPLATE_DECL
)
4526 set_mangled_name_for_decl (new_friend
);
4527 DECL_RTL (new_friend
) = 0;
4528 make_decl_rtl (new_friend
, NULL_PTR
, 1);
4531 if (DECL_NAMESPACE_SCOPE_P (new_friend
))
4534 tree new_friend_template_info
;
4535 tree new_friend_result_template_info
;
4537 int new_friend_is_defn
;
4539 /* We must save some information from NEW_FRIEND before calling
4540 duplicate decls since that function will free NEW_FRIEND if
4542 new_friend_template_info
= DECL_TEMPLATE_INFO (new_friend
);
4543 if (TREE_CODE (new_friend
) == TEMPLATE_DECL
)
4545 /* This declaration is a `primary' template. */
4546 DECL_PRIMARY_TEMPLATE (new_friend
) = new_friend
;
4549 = DECL_INITIAL (DECL_TEMPLATE_RESULT (new_friend
)) != NULL_TREE
;
4550 new_friend_result_template_info
4551 = DECL_TEMPLATE_INFO (DECL_TEMPLATE_RESULT (new_friend
));
4555 new_friend_is_defn
= DECL_INITIAL (new_friend
) != NULL_TREE
;
4556 new_friend_result_template_info
= NULL_TREE
;
4559 /* Inside pushdecl_namespace_level, we will push into the
4560 current namespace. However, the friend function should go
4561 into the namespace of the template. */
4562 ns
= decl_namespace_context (new_friend
);
4563 push_nested_namespace (ns
);
4564 old_decl
= pushdecl_namespace_level (new_friend
);
4565 pop_nested_namespace (ns
);
4567 if (old_decl
!= new_friend
)
4569 /* This new friend declaration matched an existing
4570 declaration. For example, given:
4572 template <class T> void f(T);
4573 template <class U> class C {
4574 template <class T> friend void f(T) {}
4577 the friend declaration actually provides the definition
4578 of `f', once C has been instantiated for some type. So,
4579 old_decl will be the out-of-class template declaration,
4580 while new_friend is the in-class definition.
4582 But, if `f' was called before this point, the
4583 instantiation of `f' will have DECL_TI_ARGS corresponding
4584 to `T' but not to `U', references to which might appear
4585 in the definition of `f'. Previously, the most general
4586 template for an instantiation of `f' was the out-of-class
4587 version; now it is the in-class version. Therefore, we
4588 run through all specialization of `f', adding to their
4589 DECL_TI_ARGS appropriately. In particular, they need a
4590 new set of outer arguments, corresponding to the
4591 arguments for this class instantiation.
4593 The same situation can arise with something like this:
4596 template <class T> class C {
4600 when `C<int>' is instantiated. Now, `f(int)' is defined
4603 if (!new_friend_is_defn
)
4604 /* On the other hand, if the in-class declaration does
4605 *not* provide a definition, then we don't want to alter
4606 existing definitions. We can just leave everything
4611 /* Overwrite whatever template info was there before, if
4612 any, with the new template information pertaining to
4614 DECL_TEMPLATE_INFO (old_decl
) = new_friend_template_info
;
4616 if (TREE_CODE (old_decl
) != TEMPLATE_DECL
)
4617 /* duplicate_decls will take care of this case. */
4622 tree new_friend_args
;
4624 DECL_TEMPLATE_INFO (DECL_TEMPLATE_RESULT (old_decl
))
4625 = new_friend_result_template_info
;
4627 new_friend_args
= TI_ARGS (new_friend_template_info
);
4628 for (t
= DECL_TEMPLATE_SPECIALIZATIONS (old_decl
);
4632 tree spec
= TREE_VALUE (t
);
4635 = add_outermost_template_args (new_friend_args
,
4636 DECL_TI_ARGS (spec
));
4639 /* Now, since specializations are always supposed to
4640 hang off of the most general template, we must move
4642 t
= most_general_template (old_decl
);
4645 DECL_TEMPLATE_SPECIALIZATIONS (t
)
4646 = chainon (DECL_TEMPLATE_SPECIALIZATIONS (t
),
4647 DECL_TEMPLATE_SPECIALIZATIONS (old_decl
));
4648 DECL_TEMPLATE_SPECIALIZATIONS (old_decl
) = NULL_TREE
;
4653 /* The information from NEW_FRIEND has been merged into OLD_DECL
4654 by duplicate_decls. */
4655 new_friend
= old_decl
;
4658 else if (COMPLETE_TYPE_P (DECL_CONTEXT (new_friend
)))
4660 /* Check to see that the declaration is really present, and,
4661 possibly obtain an improved declaration. */
4662 tree fn
= check_classfn (DECL_CONTEXT (new_friend
),
4671 input_filename
= file
;
4675 /* FRIEND_TMPL is a friend TEMPLATE_DECL. ARGS is the vector of
4676 template arguments, as for tsubst.
4678 Returns an appropriate tsubst'd friend type or error_mark_node on
4682 tsubst_friend_class (friend_tmpl
, args
)
4689 /* First, we look for a class template. */
4690 tmpl
= lookup_name (DECL_NAME (friend_tmpl
), /*prefer_type=*/0);
4692 /* But, if we don't find one, it might be because we're in a
4693 situation like this:
4701 Here, in the scope of (say) S<int>, `S' is bound to a TYPE_DECL
4702 for `S<int>', not the TEMPLATE_DECL. */
4703 if (!tmpl
|| !DECL_CLASS_TEMPLATE_P (tmpl
))
4705 tmpl
= lookup_name (DECL_NAME (friend_tmpl
), /*prefer_type=*/1);
4706 tmpl
= maybe_get_template_decl_from_type_decl (tmpl
);
4709 if (tmpl
&& DECL_CLASS_TEMPLATE_P (tmpl
))
4711 /* The friend template has already been declared. Just
4712 check to see that the declarations match, and install any new
4713 default parameters. We must tsubst the default parameters,
4714 of course. We only need the innermost template parameters
4715 because that is all that redeclare_class_template will look
4718 = tsubst_template_parms (DECL_TEMPLATE_PARMS (friend_tmpl
),
4719 args
, /*complain=*/1);
4721 return error_mark_node
;
4722 redeclare_class_template (TREE_TYPE (tmpl
), parms
);
4723 friend_type
= TREE_TYPE (tmpl
);
4727 /* The friend template has not already been declared. In this
4728 case, the instantiation of the template class will cause the
4729 injection of this template into the global scope. */
4730 tmpl
= tsubst (friend_tmpl
, args
, /*complain=*/1, NULL_TREE
);
4732 /* The new TMPL is not an instantiation of anything, so we
4733 forget its origins. We don't reset CLASSTYPE_TI_TEMPLATE for
4734 the new type because that is supposed to be the corresponding
4735 template decl, i.e., TMPL. */
4736 DECL_USE_TEMPLATE (tmpl
) = 0;
4737 DECL_TEMPLATE_INFO (tmpl
) = NULL_TREE
;
4738 CLASSTYPE_USE_TEMPLATE (TREE_TYPE (tmpl
)) = 0;
4740 /* Inject this template into the global scope. */
4741 friend_type
= TREE_TYPE (pushdecl_top_level (tmpl
));
4748 instantiate_class_template (type
)
4751 tree
template, args
, pattern
, t
;
4754 if (type
== error_mark_node
)
4755 return error_mark_node
;
4757 if (TYPE_BEING_DEFINED (type
) || COMPLETE_TYPE_P (type
))
4760 /* Figure out which template is being instantiated. */
4761 template = most_general_template (CLASSTYPE_TI_TEMPLATE (type
));
4762 my_friendly_assert (TREE_CODE (template) == TEMPLATE_DECL
, 279);
4764 /* Figure out which arguments are being used to do the
4766 args
= CLASSTYPE_TI_ARGS (type
);
4767 PARTIAL_INSTANTIATION_P (type
) = uses_template_parms (args
);
4769 if (pedantic
&& PARTIAL_INSTANTIATION_P (type
))
4770 /* If this is a partial instantiation, then we can't instantiate
4771 the type; there's no telling whether or not one of the
4772 template parameters might eventually be instantiated to some
4773 value that results in a specialization being used. For
4785 Now, the `S<U>' in `f<int>' is the specialization, not an
4786 instantiation of the original template. */
4789 /* Determine what specialization of the original template to
4791 if (PARTIAL_INSTANTIATION_P (type
))
4792 /* There's no telling which specialization is appropriate at this
4793 point. Since all peeking at the innards of this partial
4794 instantiation are extensions (like the "implicit typename"
4795 extension, which allows users to omit the keyword `typename' on
4796 names that are declared as types in template base classes), we
4797 are free to do what we please.
4799 Trying to figure out which partial instantiation to use can
4800 cause a crash. (Some of the template arguments don't even have
4801 types.) So, we just use the most general version. */
4805 t
= most_specialized_class (template, args
);
4807 if (t
== error_mark_node
)
4809 const char *str
= "candidates are:";
4810 cp_error ("ambiguous class template instantiation for `%#T'", type
);
4811 for (t
= DECL_TEMPLATE_SPECIALIZATIONS (template); t
;
4814 if (get_class_bindings (TREE_VALUE (t
), TREE_PURPOSE (t
),
4817 cp_error_at ("%s %+#T", str
, TREE_TYPE (t
));
4821 TYPE_BEING_DEFINED (type
) = 1;
4822 return error_mark_node
;
4827 pattern
= TREE_TYPE (t
);
4829 pattern
= TREE_TYPE (template);
4831 /* If the template we're instantiating is incomplete, then clearly
4832 there's nothing we can do. */
4833 if (!COMPLETE_TYPE_P (pattern
))
4836 /* If this is a partial instantiation, don't tsubst anything. We will
4837 only use this type for implicit typename, so the actual contents don't
4838 matter. All that matters is whether a particular name is a type. */
4839 if (PARTIAL_INSTANTIATION_P (type
))
4841 /* The fields set here must be kept in sync with those cleared
4842 in begin_class_definition. */
4843 TYPE_BINFO_BASETYPES (type
) = TYPE_BINFO_BASETYPES (pattern
);
4844 TYPE_FIELDS (type
) = TYPE_FIELDS (pattern
);
4845 TYPE_METHODS (type
) = TYPE_METHODS (pattern
);
4846 CLASSTYPE_TAGS (type
) = CLASSTYPE_TAGS (pattern
);
4847 CLASSTYPE_VBASECLASSES (type
) = CLASSTYPE_VBASECLASSES (pattern
);
4849 /* Pretend that the type is complete, so that we will look
4850 inside it during name lookup and such. */
4851 TYPE_SIZE (type
) = bitsize_zero_node
;
4855 /* If we've recursively instantiated too many templates, stop. */
4856 if (! push_tinst_level (type
))
4859 /* Now we're really doing the instantiation. Mark the type as in
4860 the process of being defined. */
4861 TYPE_BEING_DEFINED (type
) = 1;
4863 maybe_push_to_top_level (uses_template_parms (type
));
4867 /* This TYPE is actually a instantiation of of a partial
4868 specialization. We replace the innermost set of ARGS with
4869 the arguments appropriate for substitution. For example,
4872 template <class T> struct S {};
4873 template <class T> struct S<T*> {};
4875 and supposing that we are instantiating S<int*>, ARGS will
4876 present be {int*} but we need {int}. */
4878 = get_class_bindings (TREE_VALUE (t
), TREE_PURPOSE (t
),
4881 /* If there were multiple levels in ARGS, replacing the
4882 innermost level would alter CLASSTYPE_TI_ARGS, which we don't
4883 want, so we make a copy first. */
4884 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (args
))
4886 args
= copy_node (args
);
4887 SET_TMPL_ARGS_LEVEL (args
, TMPL_ARGS_DEPTH (args
), inner_args
);
4893 if (flag_external_templates
)
4895 if (flag_alt_external_templates
)
4897 CLASSTYPE_INTERFACE_ONLY (type
) = interface_only
;
4898 SET_CLASSTYPE_INTERFACE_UNKNOWN_X (type
, interface_unknown
);
4899 CLASSTYPE_VTABLE_NEEDS_WRITING (type
)
4900 = (! CLASSTYPE_INTERFACE_ONLY (type
)
4901 && CLASSTYPE_INTERFACE_KNOWN (type
));
4905 CLASSTYPE_INTERFACE_ONLY (type
) = CLASSTYPE_INTERFACE_ONLY (pattern
);
4906 SET_CLASSTYPE_INTERFACE_UNKNOWN_X
4907 (type
, CLASSTYPE_INTERFACE_UNKNOWN (pattern
));
4908 CLASSTYPE_VTABLE_NEEDS_WRITING (type
)
4909 = (! CLASSTYPE_INTERFACE_ONLY (type
)
4910 && CLASSTYPE_INTERFACE_KNOWN (type
));
4915 SET_CLASSTYPE_INTERFACE_UNKNOWN (type
);
4916 CLASSTYPE_VTABLE_NEEDS_WRITING (type
) = 1;
4919 TYPE_HAS_CONSTRUCTOR (type
) = TYPE_HAS_CONSTRUCTOR (pattern
);
4920 TYPE_HAS_DESTRUCTOR (type
) = TYPE_HAS_DESTRUCTOR (pattern
);
4921 TYPE_OVERLOADS_CALL_EXPR (type
) = TYPE_OVERLOADS_CALL_EXPR (pattern
);
4922 TYPE_OVERLOADS_ARRAY_REF (type
) = TYPE_OVERLOADS_ARRAY_REF (pattern
);
4923 TYPE_OVERLOADS_ARROW (type
) = TYPE_OVERLOADS_ARROW (pattern
);
4924 TYPE_HAS_NEW_OPERATOR (type
) = TYPE_HAS_NEW_OPERATOR (pattern
);
4925 TYPE_HAS_ARRAY_NEW_OPERATOR (type
) = TYPE_HAS_ARRAY_NEW_OPERATOR (pattern
);
4926 TYPE_GETS_DELETE (type
) = TYPE_GETS_DELETE (pattern
);
4927 TYPE_VEC_DELETE_TAKES_SIZE (type
) = TYPE_VEC_DELETE_TAKES_SIZE (pattern
);
4928 TYPE_HAS_ASSIGN_REF (type
) = TYPE_HAS_ASSIGN_REF (pattern
);
4929 TYPE_HAS_CONST_ASSIGN_REF (type
) = TYPE_HAS_CONST_ASSIGN_REF (pattern
);
4930 TYPE_HAS_ABSTRACT_ASSIGN_REF (type
) = TYPE_HAS_ABSTRACT_ASSIGN_REF (pattern
);
4931 TYPE_HAS_INIT_REF (type
) = TYPE_HAS_INIT_REF (pattern
);
4932 TYPE_HAS_CONST_INIT_REF (type
) = TYPE_HAS_CONST_INIT_REF (pattern
);
4933 TYPE_HAS_DEFAULT_CONSTRUCTOR (type
) = TYPE_HAS_DEFAULT_CONSTRUCTOR (pattern
);
4934 TYPE_HAS_CONVERSION (type
) = TYPE_HAS_CONVERSION (pattern
);
4935 TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (type
)
4936 = TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (pattern
);
4937 TYPE_USES_MULTIPLE_INHERITANCE (type
)
4938 = TYPE_USES_MULTIPLE_INHERITANCE (pattern
);
4939 TYPE_USES_VIRTUAL_BASECLASSES (type
)
4940 = TYPE_USES_VIRTUAL_BASECLASSES (pattern
);
4941 TYPE_PACKED (type
) = TYPE_PACKED (pattern
);
4942 TYPE_ALIGN (type
) = TYPE_ALIGN (pattern
);
4943 TYPE_USER_ALIGN (type
) = TYPE_USER_ALIGN (pattern
);
4944 TYPE_FOR_JAVA (type
) = TYPE_FOR_JAVA (pattern
); /* For libjava's JArray<T> */
4945 if (ANON_AGGR_TYPE_P (pattern
))
4946 SET_ANON_AGGR_TYPE_P (type
);
4948 if (TYPE_BINFO_BASETYPES (pattern
))
4950 tree base_list
= NULL_TREE
;
4951 tree pbases
= TYPE_BINFO_BASETYPES (pattern
);
4954 /* Substitute into each of the bases to determine the actual
4956 for (i
= 0; i
< TREE_VEC_LENGTH (pbases
); ++i
)
4962 pbase
= TREE_VEC_ELT (pbases
, i
);
4964 /* Substitute to figure out the base class. */
4965 base
= tsubst (BINFO_TYPE (pbase
), args
,
4966 /*complain=*/1, NULL_TREE
);
4967 if (base
== error_mark_node
)
4970 /* Calculate the correct access node. */
4971 if (TREE_VIA_VIRTUAL (pbase
))
4973 if (TREE_VIA_PUBLIC (pbase
))
4974 access
= access_public_virtual_node
;
4975 else if (TREE_VIA_PROTECTED (pbase
))
4976 access
= access_protected_virtual_node
;
4978 access
= access_private_virtual_node
;
4982 if (TREE_VIA_PUBLIC (pbase
))
4983 access
= access_public_node
;
4984 else if (TREE_VIA_PROTECTED (pbase
))
4985 access
= access_protected_node
;
4987 access
= access_private_node
;
4990 base_list
= tree_cons (access
, base
, base_list
);
4993 /* The list is now in reverse order; correct that. */
4994 base_list
= nreverse (base_list
);
4996 /* Now call xref_basetypes to set up all the base-class
4998 xref_basetypes (TREE_CODE (pattern
) == RECORD_TYPE
4999 ? (CLASSTYPE_DECLARED_CLASS (pattern
)
5000 ? class_type_node
: record_type_node
)
5002 DECL_NAME (TYPE_NAME (pattern
)),
5007 /* Now that our base classes are set up, enter the scope of the
5008 class, so that name lookups into base classes, etc. will work
5009 correctly. This is precisely analogous to what we do in
5010 begin_class_definition when defining an ordinary non-template
5012 pushclass (type
, 1);
5014 for (t
= CLASSTYPE_TAGS (pattern
); t
; t
= TREE_CHAIN (t
))
5016 tree tag
= TREE_VALUE (t
);
5017 tree name
= TYPE_IDENTIFIER (tag
);
5020 newtag
= tsubst (tag
, args
, /*complain=*/1, NULL_TREE
);
5021 if (TREE_CODE (newtag
) != ENUMERAL_TYPE
)
5023 if (TYPE_LANG_SPECIFIC (tag
) && CLASSTYPE_IS_TEMPLATE (tag
))
5024 /* Unfortunately, lookup_template_class sets
5025 CLASSTYPE_IMPLICIT_INSTANTIATION for a partial
5026 instantiation (i.e., for the type of a member template
5027 class nested within a template class.) This behavior is
5028 required for maybe_process_partial_specialization to work
5029 correctly, but is not accurate in this case; the TAG is not
5030 an instantiation of anything. (The corresponding
5031 TEMPLATE_DECL is an instantiation, but the TYPE is not.) */
5032 CLASSTYPE_USE_TEMPLATE (newtag
) = 0;
5034 /* Now, we call pushtag to put this NEWTAG into the scope of
5035 TYPE. We first set up the IDENTIFIER_TYPE_VALUE to avoid
5036 pushtag calling push_template_decl. We don't have to do
5037 this for enums because it will already have been done in
5040 SET_IDENTIFIER_TYPE_VALUE (name
, newtag
);
5041 pushtag (name
, newtag
, /*globalize=*/0);
5045 /* Don't replace enum constants here. */
5046 for (t
= TYPE_FIELDS (pattern
); t
; t
= TREE_CHAIN (t
))
5047 if (TREE_CODE (t
) != CONST_DECL
)
5051 /* The the file and line for this declaration, to assist in
5052 error message reporting. Since we called push_tinst_level
5053 above, we don't need to restore these. */
5054 lineno
= DECL_SOURCE_LINE (t
);
5055 input_filename
= DECL_SOURCE_FILE (t
);
5057 r
= tsubst (t
, args
, /*complain=*/1, NULL_TREE
);
5058 if (TREE_CODE (r
) == VAR_DECL
)
5062 if (DECL_DEFINED_IN_CLASS_P (r
))
5063 init
= tsubst_expr (DECL_INITIAL (t
), args
,
5064 /*complain=*/1, NULL_TREE
);
5068 finish_static_data_member_decl (r
, init
,
5069 /*asmspec_tree=*/NULL_TREE
,
5072 if (DECL_DEFINED_IN_CLASS_P (r
))
5073 check_static_variable_definition (r
, TREE_TYPE (r
));
5076 /* R will have a TREE_CHAIN if and only if it has already been
5077 processed by finish_member_declaration. This can happen
5078 if, for example, it is a TYPE_DECL for a class-scoped
5079 ENUMERAL_TYPE; such a thing will already have been added to
5080 the field list by tsubst_enum above. */
5081 if (!TREE_CHAIN (r
))
5083 set_current_access_from_decl (r
);
5084 finish_member_declaration (r
);
5088 /* Set up the list (TYPE_METHODS) and vector (CLASSTYPE_METHOD_VEC)
5089 for this instantiation. */
5090 for (t
= TYPE_METHODS (pattern
); t
; t
= TREE_CHAIN (t
))
5092 tree r
= tsubst (t
, args
, /*complain=*/1, NULL_TREE
);
5093 set_current_access_from_decl (r
);
5094 finish_member_declaration (r
);
5097 /* Construct the DECL_FRIENDLIST for the new class type. */
5098 typedecl
= TYPE_MAIN_DECL (type
);
5099 for (t
= DECL_FRIENDLIST (TYPE_MAIN_DECL (pattern
));
5105 for (friends
= TREE_VALUE (t
);
5106 friends
!= NULL_TREE
;
5107 friends
= TREE_CHAIN (friends
))
5108 if (TREE_PURPOSE (friends
) == error_mark_node
)
5110 tsubst_friend_function (TREE_VALUE (friends
),
5113 my_friendly_abort (20000216);
5116 for (t
= CLASSTYPE_FRIEND_CLASSES (pattern
);
5120 tree friend_type
= TREE_VALUE (t
);
5121 tree new_friend_type
;
5123 if (TREE_CODE (friend_type
) == TEMPLATE_DECL
)
5124 new_friend_type
= tsubst_friend_class (friend_type
, args
);
5125 else if (uses_template_parms (friend_type
))
5126 new_friend_type
= tsubst (friend_type
, args
, /*complain=*/1,
5130 tree ns
= decl_namespace_context (TYPE_MAIN_DECL (friend_type
));
5132 /* The call to xref_tag_from_type does injection for friend
5134 push_nested_namespace (ns
);
5136 xref_tag_from_type (friend_type
, NULL_TREE
, 1);
5137 pop_nested_namespace (ns
);
5140 if (TREE_CODE (friend_type
) == TEMPLATE_DECL
)
5141 /* Trick make_friend_class into realizing that the friend
5142 we're adding is a template, not an ordinary class. It's
5143 important that we use make_friend_class since it will
5144 perform some error-checking and output cross-reference
5146 ++processing_template_decl
;
5148 if (new_friend_type
!= error_mark_node
)
5149 make_friend_class (type
, new_friend_type
);
5151 if (TREE_CODE (friend_type
) == TEMPLATE_DECL
)
5152 --processing_template_decl
;
5155 for (t
= TYPE_FIELDS (type
); t
; t
= TREE_CHAIN (t
))
5156 if (TREE_CODE (t
) == FIELD_DECL
)
5158 TREE_TYPE (t
) = complete_type (TREE_TYPE (t
));
5159 require_complete_type (t
);
5162 /* Set the file and line number information to whatever is given for
5163 the class itself. This puts error messages involving generated
5164 implicit functions at a predictable point, and the same point
5165 that would be used for non-template classes. */
5166 lineno
= DECL_SOURCE_LINE (typedecl
);
5167 input_filename
= DECL_SOURCE_FILE (typedecl
);
5169 unreverse_member_declarations (type
);
5170 finish_struct_1 (type
);
5171 CLASSTYPE_GOT_SEMICOLON (type
) = 1;
5173 /* Clear this now so repo_template_used is happy. */
5174 TYPE_BEING_DEFINED (type
) = 0;
5175 repo_template_used (type
);
5177 /* Now that the class is complete, instantiate default arguments for
5178 any member functions. We don't do this earlier because the
5179 default arguments may reference members of the class. */
5180 if (!PRIMARY_TEMPLATE_P (template))
5181 for (t
= TYPE_METHODS (type
); t
; t
= TREE_CHAIN (t
))
5182 if (TREE_CODE (t
) == FUNCTION_DECL
5183 /* Implicitly generated member functions will not have template
5184 information; they are not instantiations, but instead are
5185 created "fresh" for each instantiation. */
5186 && DECL_TEMPLATE_INFO (t
))
5187 tsubst_default_arguments (t
);
5190 pop_from_top_level ();
5200 if (t1
== NULL_TREE
)
5201 return t2
== NULL_TREE
;
5202 if (t2
== NULL_TREE
)
5204 /* Don't care if one declares its arg const and the other doesn't -- the
5205 main variant of the arg type is all that matters. */
5206 if (TYPE_MAIN_VARIANT (TREE_VALUE (t1
))
5207 != TYPE_MAIN_VARIANT (TREE_VALUE (t2
)))
5209 return list_eq (TREE_CHAIN (t1
), TREE_CHAIN (t2
));
5212 /* If arg is a non-type template parameter that does not depend on template
5213 arguments, fold it like we weren't in the body of a template. */
5216 maybe_fold_nontype_arg (arg
)
5219 /* If we're not in a template, ARG is already as simple as it's going to
5220 get, and trying to reprocess the trees will break. */
5221 if (! processing_template_decl
)
5224 if (!TYPE_P (arg
) && !uses_template_parms (arg
))
5226 /* Sometimes, one of the args was an expression involving a
5227 template constant parameter, like N - 1. Now that we've
5228 tsubst'd, we might have something like 2 - 1. This will
5229 confuse lookup_template_class, so we do constant folding
5230 here. We have to unset processing_template_decl, to
5231 fool build_expr_from_tree() into building an actual
5234 int saved_processing_template_decl
= processing_template_decl
;
5235 processing_template_decl
= 0;
5236 arg
= fold (build_expr_from_tree (arg
));
5237 processing_template_decl
= saved_processing_template_decl
;
5242 /* Substitute ARGS into the vector of template arguments T. */
5245 tsubst_template_arg_vector (t
, args
, complain
)
5250 int len
= TREE_VEC_LENGTH (t
), need_new
= 0, i
;
5251 tree
*elts
= (tree
*) alloca (len
* sizeof (tree
));
5253 memset ((char *) elts
, 0, len
* sizeof (tree
));
5255 for (i
= 0; i
< len
; i
++)
5257 if (TREE_VEC_ELT (t
, i
) != NULL_TREE
5258 && TREE_CODE (TREE_VEC_ELT (t
, i
)) == TREE_VEC
)
5259 elts
[i
] = tsubst_template_arg_vector (TREE_VEC_ELT (t
, i
),
5262 elts
[i
] = maybe_fold_nontype_arg
5263 (tsubst_expr (TREE_VEC_ELT (t
, i
), args
, complain
,
5266 if (elts
[i
] == error_mark_node
)
5267 return error_mark_node
;
5269 if (elts
[i
] != TREE_VEC_ELT (t
, i
))
5276 t
= make_tree_vec (len
);
5277 for (i
= 0; i
< len
; i
++)
5278 TREE_VEC_ELT (t
, i
) = elts
[i
];
5283 /* Return the result of substituting ARGS into the template parameters
5284 given by PARMS. If there are m levels of ARGS and m + n levels of
5285 PARMS, then the result will contain n levels of PARMS. For
5286 example, if PARMS is `template <class T> template <class U>
5287 template <T*, U, class V>' and ARGS is {{int}, {double}} then the
5288 result will be `template <int*, double, class V>'. */
5291 tsubst_template_parms (parms
, args
, complain
)
5299 for (new_parms
= &r
;
5300 TMPL_PARMS_DEPTH (parms
) > TMPL_ARGS_DEPTH (args
);
5301 new_parms
= &(TREE_CHAIN (*new_parms
)),
5302 parms
= TREE_CHAIN (parms
))
5305 make_tree_vec (TREE_VEC_LENGTH (TREE_VALUE (parms
)));
5308 for (i
= 0; i
< TREE_VEC_LENGTH (new_vec
); ++i
)
5310 tree default_value
=
5311 TREE_PURPOSE (TREE_VEC_ELT (TREE_VALUE (parms
), i
));
5313 TREE_VALUE (TREE_VEC_ELT (TREE_VALUE (parms
), i
));
5315 TREE_VEC_ELT (new_vec
, i
)
5316 = build_tree_list (tsubst (default_value
, args
, complain
,
5318 tsubst (parm_decl
, args
, complain
,
5323 tree_cons (size_int (TMPL_PARMS_DEPTH (parms
)
5324 - TMPL_ARGS_DEPTH (args
)),
5325 new_vec
, NULL_TREE
);
5331 /* Substitute the ARGS into the indicated aggregate (or enumeration)
5332 type T. If T is not an aggregate or enumeration type, it is
5333 handled as if by tsubst. IN_DECL is as for tsubst. If
5334 ENTERING_SCOPE is non-zero, T is the context for a template which
5335 we are presently tsubst'ing. Return the substituted value. */
5338 tsubst_aggr_type (t
, args
, complain
, in_decl
, entering_scope
)
5348 switch (TREE_CODE (t
))
5351 if (TYPE_PTRMEMFUNC_P (t
))
5353 tree r
= build_ptrmemfunc_type
5354 (tsubst (TYPE_PTRMEMFUNC_FN_TYPE (t
), args
, complain
, in_decl
));
5355 return cp_build_qualified_type_real (r
, TYPE_QUALS (t
),
5359 /* else fall through */
5362 if (TYPE_TEMPLATE_INFO (t
))
5368 /* First, determine the context for the type we are looking
5370 if (TYPE_CONTEXT (t
) != NULL_TREE
)
5371 context
= tsubst_aggr_type (TYPE_CONTEXT (t
), args
,
5373 in_decl
, /*entering_scope=*/1);
5375 context
= NULL_TREE
;
5377 /* Then, figure out what arguments are appropriate for the
5378 type we are trying to find. For example, given:
5380 template <class T> struct S;
5381 template <class T, class U> void f(T, U) { S<U> su; }
5383 and supposing that we are instantiating f<int, double>,
5384 then our ARGS will be {int, double}, but, when looking up
5385 S we only want {double}. */
5386 argvec
= tsubst_template_arg_vector (TYPE_TI_ARGS (t
), args
,
5388 if (argvec
== error_mark_node
)
5389 return error_mark_node
;
5391 r
= lookup_template_class (t
, argvec
, in_decl
, context
,
5394 return cp_build_qualified_type_real (r
, TYPE_QUALS (t
),
5398 /* This is not a template type, so there's nothing to do. */
5402 return tsubst (t
, args
, complain
, in_decl
);
5406 /* Substitute into the default argument ARG (a default argument for
5407 FN), which has the indicated TYPE. */
5410 tsubst_default_argument (fn
, type
, arg
)
5415 /* This default argument came from a template. Instantiate the
5416 default argument here, not in tsubst. In the case of
5425 we must be careful to do name lookup in the scope of S<T>,
5426 rather than in the current class. */
5427 if (DECL_CLASS_SCOPE_P (fn
))
5428 pushclass (DECL_CONTEXT (fn
), 2);
5430 arg
= tsubst_expr (arg
, DECL_TI_ARGS (fn
), /*complain=*/1, NULL_TREE
);
5432 if (DECL_CLASS_SCOPE_P (fn
))
5435 /* Make sure the default argument is reasonable. */
5436 arg
= check_default_argument (type
, arg
);
5441 /* Substitute into all the default arguments for FN. */
5444 tsubst_default_arguments (fn
)
5450 tmpl_args
= DECL_TI_ARGS (fn
);
5452 /* If this function is not yet instantiated, we certainly don't need
5453 its default arguments. */
5454 if (uses_template_parms (tmpl_args
))
5457 for (arg
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
5459 arg
= TREE_CHAIN (arg
))
5460 if (TREE_PURPOSE (arg
))
5461 TREE_PURPOSE (arg
) = tsubst_default_argument (fn
,
5463 TREE_PURPOSE (arg
));
5466 /* Substitute the ARGS into the T, which is a _DECL. TYPE is the
5467 (already computed) substitution of ARGS into TREE_TYPE (T), if
5468 appropriate. Return the result of the substitution. IN_DECL is as
5472 tsubst_decl (t
, args
, type
, in_decl
)
5479 const char *saved_filename
;
5482 /* Set the filename and linenumber to improve error-reporting. */
5483 saved_lineno
= lineno
;
5484 saved_filename
= input_filename
;
5485 lineno
= DECL_SOURCE_LINE (t
);
5486 input_filename
= DECL_SOURCE_FILE (t
);
5488 switch (TREE_CODE (t
))
5492 /* We can get here when processing a member template function
5493 of a template class. */
5494 tree decl
= DECL_TEMPLATE_RESULT (t
);
5496 int is_template_template_parm
= DECL_TEMPLATE_TEMPLATE_PARM_P (t
);
5498 if (!is_template_template_parm
)
5500 /* We might already have an instance of this template.
5501 The ARGS are for the surrounding class type, so the
5502 full args contain the tsubst'd args for the context,
5503 plus the innermost args from the template decl. */
5504 tree tmpl_args
= DECL_CLASS_TEMPLATE_P (t
)
5505 ? CLASSTYPE_TI_ARGS (TREE_TYPE (t
))
5506 : DECL_TI_ARGS (DECL_TEMPLATE_RESULT (t
));
5509 full_args
= tsubst_template_arg_vector (tmpl_args
, args
,
5512 /* tsubst_template_arg_vector doesn't copy the vector if
5513 nothing changed. But, *something* should have
5515 my_friendly_assert (full_args
!= tmpl_args
, 0);
5517 spec
= retrieve_specialization (t
, full_args
);
5518 if (spec
!= NULL_TREE
)
5525 /* Make a new template decl. It will be similar to the
5526 original, but will record the current template arguments.
5527 We also create a new function declaration, which is just
5528 like the old one, but points to this new template, rather
5529 than the old one. */
5531 my_friendly_assert (DECL_LANG_SPECIFIC (r
) != 0, 0);
5532 TREE_CHAIN (r
) = NULL_TREE
;
5534 if (is_template_template_parm
)
5536 tree new_decl
= tsubst (decl
, args
, /*complain=*/1, in_decl
);
5537 DECL_TEMPLATE_RESULT (r
) = new_decl
;
5538 TREE_TYPE (r
) = TREE_TYPE (new_decl
);
5543 = tsubst_aggr_type (DECL_CONTEXT (t
), args
,
5544 /*complain=*/1, in_decl
,
5545 /*entering_scope=*/1);
5546 DECL_VIRTUAL_CONTEXT (r
)
5547 = tsubst_aggr_type (DECL_VIRTUAL_CONTEXT (t
), args
,
5548 /*complain=*/1, in_decl
,
5549 /*entering_scope=*/1);
5550 DECL_TEMPLATE_INFO (r
) = build_tree_list (t
, args
);
5552 if (TREE_CODE (decl
) == TYPE_DECL
)
5554 tree new_type
= tsubst (TREE_TYPE (t
), args
,
5555 /*complain=*/1, in_decl
);
5556 TREE_TYPE (r
) = new_type
;
5557 CLASSTYPE_TI_TEMPLATE (new_type
) = r
;
5558 DECL_TEMPLATE_RESULT (r
) = TYPE_MAIN_DECL (new_type
);
5559 DECL_TI_ARGS (r
) = CLASSTYPE_TI_ARGS (new_type
);
5563 tree new_decl
= tsubst (decl
, args
, /*complain=*/1, in_decl
);
5565 DECL_TEMPLATE_RESULT (r
) = new_decl
;
5566 DECL_TI_TEMPLATE (new_decl
) = r
;
5567 TREE_TYPE (r
) = TREE_TYPE (new_decl
);
5568 DECL_TI_ARGS (r
) = DECL_TI_ARGS (new_decl
);
5571 SET_DECL_IMPLICIT_INSTANTIATION (r
);
5572 DECL_TEMPLATE_INSTANTIATIONS (r
) = NULL_TREE
;
5573 DECL_TEMPLATE_SPECIALIZATIONS (r
) = NULL_TREE
;
5575 /* The template parameters for this new template are all the
5576 template parameters for the old template, except the
5577 outermost level of parameters. */
5578 DECL_TEMPLATE_PARMS (r
)
5579 = tsubst_template_parms (DECL_TEMPLATE_PARMS (t
), args
,
5582 if (PRIMARY_TEMPLATE_P (t
))
5583 DECL_PRIMARY_TEMPLATE (r
) = r
;
5585 /* We don't partially instantiate partial specializations. */
5586 if (TREE_CODE (decl
) == TYPE_DECL
)
5589 /* Record this partial instantiation. */
5590 register_specialization (r
, t
,
5591 DECL_TI_ARGS (DECL_TEMPLATE_RESULT (r
)));
5599 tree argvec
= NULL_TREE
;
5606 /* Nobody should be tsubst'ing into non-template functions. */
5607 my_friendly_assert (DECL_TEMPLATE_INFO (t
) != NULL_TREE
, 0);
5609 if (TREE_CODE (DECL_TI_TEMPLATE (t
)) == TEMPLATE_DECL
)
5613 /* Calculate the most general template of which R is a
5614 specialization, and the complete set of arguments used to
5616 gen_tmpl
= most_general_template (DECL_TI_TEMPLATE (t
));
5618 = tsubst_template_arg_vector (DECL_TI_ARGS
5619 (DECL_TEMPLATE_RESULT (gen_tmpl
)),
5620 args
, /*complain=*/1);
5622 /* Check to see if we already have this specialization. */
5623 spec
= retrieve_specialization (gen_tmpl
, argvec
);
5631 /* We can see more levels of arguments than parameters if
5632 there was a specialization of a member template, like
5635 template <class T> struct S { template <class U> void f(); }
5636 template <> template <class U> void S<int>::f(U);
5638 Here, we'll be substituting into the specialization,
5639 because that's where we can find the code we actually
5640 want to generate, but we'll have enough arguments for
5641 the most general template.
5643 We also deal with the peculiar case:
5645 template <class T> struct S {
5646 template <class U> friend void f();
5648 template <class U> void f() {}
5650 template void f<double>();
5652 Here, the ARGS for the instantiation of will be {int,
5653 double}. But, we only need as many ARGS as there are
5654 levels of template parameters in CODE_PATTERN. We are
5655 careful not to get fooled into reducing the ARGS in
5658 template <class T> struct S { template <class U> void f(U); }
5659 template <class T> template <> void S<T>::f(int) {}
5661 which we can spot because the pattern will be a
5662 specialization in this case. */
5663 args_depth
= TMPL_ARGS_DEPTH (args
);
5665 TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (DECL_TI_TEMPLATE (t
)));
5666 if (args_depth
> parms_depth
5667 && !DECL_TEMPLATE_SPECIALIZATION (t
))
5668 args
= get_innermost_template_args (args
, parms_depth
);
5672 /* This special case arises when we have something like this:
5674 template <class T> struct S {
5675 friend void f<int>(int, double);
5678 Here, the DECL_TI_TEMPLATE for the friend declaration
5679 will be a LOOKUP_EXPR or an IDENTIFIER_NODE. We are
5680 being called from tsubst_friend_function, and we want
5681 only to create a new decl (R) with appropriate types so
5682 that we can call determine_specialization. */
5683 my_friendly_assert ((TREE_CODE (DECL_TI_TEMPLATE (t
))
5685 || (TREE_CODE (DECL_TI_TEMPLATE (t
))
5686 == IDENTIFIER_NODE
), 0);
5687 gen_tmpl
= NULL_TREE
;
5690 if (DECL_CLASS_SCOPE_P (t
))
5692 if (DECL_NAME (t
) == constructor_name (DECL_CONTEXT (t
)))
5696 ctx
= tsubst_aggr_type (DECL_CONTEXT (t
), args
,
5698 /*entering_scope=*/1);
5703 ctx
= DECL_CONTEXT (t
);
5705 type
= tsubst (type
, args
, /*complain=*/1, in_decl
);
5706 if (type
== error_mark_node
)
5707 return error_mark_node
;
5709 /* We do NOT check for matching decls pushed separately at this
5710 point, as they may not represent instantiations of this
5711 template, and in any case are considered separate under the
5714 DECL_USE_TEMPLATE (r
) = 0;
5715 TREE_TYPE (r
) = type
;
5717 DECL_CONTEXT (r
) = ctx
;
5718 DECL_VIRTUAL_CONTEXT (r
)
5719 = tsubst_aggr_type (DECL_VIRTUAL_CONTEXT (t
), args
,
5721 /*entering_scope=*/1);
5723 if (member
&& DECL_CONV_FN_P (r
))
5725 /* Type-conversion operator. Reconstruct the name, in
5726 case it's the name of one of the template's parameters. */
5728 DECL_NAME (r
) = mangle_conv_op_name_for_type (TREE_TYPE (type
));
5730 DECL_NAME (r
) = build_typename_overload (TREE_TYPE (type
));
5733 DECL_ARGUMENTS (r
) = tsubst (DECL_ARGUMENTS (t
), args
,
5735 DECL_RESULT (r
) = NULL_TREE
;
5737 TREE_STATIC (r
) = 0;
5738 TREE_PUBLIC (r
) = TREE_PUBLIC (t
);
5739 DECL_EXTERNAL (r
) = 1;
5740 DECL_INTERFACE_KNOWN (r
) = 0;
5741 DECL_DEFER_OUTPUT (r
) = 0;
5742 TREE_CHAIN (r
) = NULL_TREE
;
5743 DECL_PENDING_INLINE_INFO (r
) = 0;
5744 DECL_PENDING_INLINE_P (r
) = 0;
5745 DECL_SAVED_TREE (r
) = NULL_TREE
;
5747 if (DECL_CLONED_FUNCTION (r
))
5749 DECL_CLONED_FUNCTION (r
) = tsubst (DECL_CLONED_FUNCTION (t
),
5750 args
, /*complain=*/1, t
);
5751 TREE_CHAIN (r
) = TREE_CHAIN (DECL_CLONED_FUNCTION (r
));
5752 TREE_CHAIN (DECL_CLONED_FUNCTION (r
)) = r
;
5755 /* Set up the DECL_TEMPLATE_INFO for R and compute its mangled
5756 name. There's no need to do this in the special friend
5757 case mentioned above where GEN_TMPL is NULL. */
5760 DECL_TEMPLATE_INFO (r
)
5761 = tree_cons (gen_tmpl
, argvec
, NULL_TREE
);
5762 SET_DECL_IMPLICIT_INSTANTIATION (r
);
5763 register_specialization (r
, gen_tmpl
, argvec
);
5765 /* Set the mangled name for R. */
5766 if (DECL_DESTRUCTOR_P (t
))
5769 set_mangled_name_for_decl (r
);
5771 DECL_ASSEMBLER_NAME (r
) = build_destructor_name (ctx
);
5775 /* Instantiations of template functions must be mangled
5776 specially, in order to conform to 14.5.5.1
5777 [temp.over.link]. */
5778 tree tmpl
= DECL_TI_TEMPLATE (t
);
5780 /* TMPL will be NULL if this is a specialization of a
5781 member function of a template class. */
5782 if (name_mangling_version
< 1
5783 || tmpl
== NULL_TREE
5784 || (member
&& !is_member_template (tmpl
)
5785 && !DECL_TEMPLATE_INFO (tmpl
)))
5786 set_mangled_name_for_decl (r
);
5788 set_mangled_name_for_template_decl (r
);
5792 make_decl_rtl (r
, NULL_PTR
, 1);
5794 /* Like grokfndecl. If we don't do this, pushdecl will
5795 mess up our TREE_CHAIN because it doesn't find a
5796 previous decl. Sigh. */
5798 && ! uses_template_parms (r
)
5799 && (IDENTIFIER_GLOBAL_VALUE (DECL_ASSEMBLER_NAME (r
))
5801 SET_IDENTIFIER_GLOBAL_VALUE (DECL_ASSEMBLER_NAME (r
), r
);
5803 /* We're not supposed to instantiate default arguments
5804 until they are called, for a template. But, for a
5807 template <class T> void f ()
5808 { extern void g(int i = T()); }
5810 we should do the substitution when the template is
5811 instantiated. We handle the member function case in
5812 instantiate_class_template since the default arguments
5813 might refer to other members of the class. */
5815 && !PRIMARY_TEMPLATE_P (gen_tmpl
)
5816 && !uses_template_parms (argvec
))
5817 tsubst_default_arguments (r
);
5820 /* Copy the list of befriending classes. */
5821 for (friends
= &DECL_BEFRIENDING_CLASSES (r
);
5823 friends
= &TREE_CHAIN (*friends
))
5825 *friends
= copy_node (*friends
);
5826 TREE_VALUE (*friends
) = tsubst (TREE_VALUE (*friends
),
5827 args
, /*complain=*/1,
5831 if (DECL_CONSTRUCTOR_P (r
) || DECL_DESTRUCTOR_P (r
))
5833 maybe_retrofit_in_chrg (r
);
5834 if (DECL_CONSTRUCTOR_P (r
))
5835 grok_ctor_properties (ctx
, r
);
5836 /* If this is an instantiation of a member template, clone it.
5837 If it isn't, that'll be handled by
5838 clone_constructors_and_destructors. */
5839 if (PRIMARY_TEMPLATE_P (gen_tmpl
))
5840 clone_function_decl(r
, /*update_method_vec_p=*/0);
5842 else if (IDENTIFIER_OPNAME_P (DECL_NAME (r
)))
5843 grok_op_properties (r
, DECL_VIRTUAL_P (r
), DECL_FRIEND_P (r
));
5850 TREE_TYPE (r
) = type
;
5851 c_apply_type_quals_to_decl (CP_TYPE_QUALS (type
), r
);
5853 if (TREE_CODE (DECL_INITIAL (r
)) != TEMPLATE_PARM_INDEX
)
5854 DECL_INITIAL (r
) = TREE_TYPE (r
);
5856 DECL_INITIAL (r
) = tsubst (DECL_INITIAL (r
), args
,
5857 /*complain=*/1, in_decl
);
5859 DECL_CONTEXT (r
) = NULL_TREE
;
5860 if (PROMOTE_PROTOTYPES
5861 && (TREE_CODE (type
) == INTEGER_TYPE
5862 || TREE_CODE (type
) == ENUMERAL_TYPE
)
5863 && TYPE_PRECISION (type
) < TYPE_PRECISION (integer_type_node
))
5864 DECL_ARG_TYPE (r
) = integer_type_node
;
5866 TREE_CHAIN (r
) = tsubst (TREE_CHAIN (t
), args
,
5867 /*complain=*/1, TREE_CHAIN (t
));
5874 TREE_TYPE (r
) = type
;
5875 c_apply_type_quals_to_decl (CP_TYPE_QUALS (type
), r
);
5877 /* We don't have to set DECL_CONTEXT here; it is set by
5878 finish_member_declaration. */
5879 DECL_INITIAL (r
) = tsubst_expr (DECL_INITIAL (t
), args
,
5880 /*complain=*/1, in_decl
);
5881 TREE_CHAIN (r
) = NULL_TREE
;
5882 if (TREE_CODE (type
) == VOID_TYPE
)
5883 cp_error_at ("instantiation of `%D' as type void", r
);
5891 = tsubst_copy (DECL_INITIAL (t
), args
, /*complain=*/1, in_decl
);
5892 TREE_CHAIN (r
) = NULL_TREE
;
5897 if (TREE_CODE (type
) == TEMPLATE_TEMPLATE_PARM
5898 || t
== TYPE_MAIN_DECL (TREE_TYPE (t
)))
5900 /* If this is the canonical decl, we don't have to mess with
5901 instantiations, and often we can't (for typename, template
5902 type parms and such). Note that TYPE_NAME is not correct for
5903 the above test if we've copied the type for a typedef. */
5904 r
= TYPE_NAME (type
);
5912 tree argvec
= NULL_TREE
;
5913 tree gen_tmpl
= NULL_TREE
;
5915 tree tmpl
= NULL_TREE
;
5919 /* Assume this is a non-local variable. */
5922 if (TYPE_P (CP_DECL_CONTEXT (t
)))
5923 ctx
= tsubst_aggr_type (DECL_CONTEXT (t
), args
,
5925 in_decl
, /*entering_scope=*/1);
5928 /* Subsequent calls to pushdecl will fill this in. */
5930 if (!DECL_NAMESPACE_SCOPE_P (t
))
5934 /* Check to see if we already have this specialization. */
5937 tmpl
= DECL_TI_TEMPLATE (t
);
5938 gen_tmpl
= most_general_template (tmpl
);
5939 argvec
= tsubst (DECL_TI_ARGS (t
), args
, /*complain=*/1, in_decl
);
5940 spec
= retrieve_specialization (gen_tmpl
, argvec
);
5943 spec
= retrieve_local_specialization (t
);
5952 TREE_TYPE (r
) = type
;
5953 c_apply_type_quals_to_decl (CP_TYPE_QUALS (type
), r
);
5954 DECL_CONTEXT (r
) = ctx
;
5956 /* Don't try to expand the initializer until someone tries to use
5957 this variable; otherwise we run into circular dependencies. */
5958 DECL_INITIAL (r
) = NULL_TREE
;
5960 DECL_SIZE (r
) = DECL_SIZE_UNIT (r
) = 0;
5962 /* For __PRETTY_FUNCTION__ we have to adjust the initializer. */
5963 if (DECL_PRETTY_FUNCTION_P (r
))
5965 DECL_INITIAL (r
) = tsubst (DECL_INITIAL (t
),
5969 TREE_TYPE (r
) = TREE_TYPE (DECL_INITIAL (r
));
5972 /* Even if the original location is out of scope, the newly
5973 substituted one is not. */
5974 if (TREE_CODE (r
) == VAR_DECL
)
5975 DECL_DEAD_FOR_LOCAL (r
) = 0;
5979 /* A static data member declaration is always marked
5980 external when it is declared in-class, even if an
5981 initializer is present. We mimic the non-template
5983 DECL_EXTERNAL (r
) = 1;
5985 register_specialization (r
, gen_tmpl
, argvec
);
5986 DECL_TEMPLATE_INFO (r
) = tree_cons (tmpl
, argvec
, NULL_TREE
);
5987 SET_DECL_IMPLICIT_INSTANTIATION (r
);
5990 register_local_specialization (r
, t
);
5992 TREE_CHAIN (r
) = NULL_TREE
;
5993 if (TREE_CODE (r
) == VAR_DECL
&& TREE_CODE (type
) == VOID_TYPE
)
5994 cp_error_at ("instantiation of `%D' as type void", r
);
5999 my_friendly_abort (0);
6002 /* Restore the file and line information. */
6003 lineno
= saved_lineno
;
6004 input_filename
= saved_filename
;
6009 /* Substitue into the ARG_TYPES of a function type. */
6012 tsubst_arg_types (arg_types
, args
, complain
, in_decl
)
6018 tree remaining_arg_types
;
6021 if (!arg_types
|| arg_types
== void_list_node
)
6024 remaining_arg_types
= tsubst_arg_types (TREE_CHAIN (arg_types
),
6025 args
, complain
, in_decl
);
6026 if (remaining_arg_types
== error_mark_node
)
6027 return error_mark_node
;
6029 type
= tsubst (TREE_VALUE (arg_types
), args
, complain
, in_decl
);
6030 if (type
== error_mark_node
)
6031 return error_mark_node
;
6033 /* Do array-to-pointer, function-to-pointer conversion, and ignore
6034 top-level qualifiers as required. */
6035 type
= TYPE_MAIN_VARIANT (type_decays_to (type
));
6037 /* Note that we do not substitute into default arguments here. The
6038 standard mandates that they be instantiated only when needed,
6039 which is done in build_over_call. */
6040 return hash_tree_cons (TREE_PURPOSE (arg_types
), type
,
6041 remaining_arg_types
);
6045 /* Substitute into a FUNCTION_TYPE or METHOD_TYPE. This routine does
6046 *not* handle the exception-specification for FNTYPE, because the
6047 initial substitution of explicitly provided template parameters
6048 during argument deduction forbids substitution into the
6049 exception-specification:
6053 All references in the function type of the function template to the
6054 corresponding template parameters are replaced by the specified tem-
6055 plate argument values. If a substitution in a template parameter or
6056 in the function type of the function template results in an invalid
6057 type, type deduction fails. [Note: The equivalent substitution in
6058 exception specifications is done only when the function is instanti-
6059 ated, at which point a program is ill-formed if the substitution
6060 results in an invalid type.] */
6063 tsubst_function_type (t
, args
, complain
, in_decl
)
6073 /* The TYPE_CONTEXT is not used for function/method types. */
6074 my_friendly_assert (TYPE_CONTEXT (t
) == NULL_TREE
, 0);
6076 /* Substitue the return type. */
6077 return_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
6078 if (return_type
== error_mark_node
)
6079 return error_mark_node
;
6081 /* Substitue the argument types. */
6082 arg_types
= tsubst_arg_types (TYPE_ARG_TYPES (t
), args
,
6084 if (arg_types
== error_mark_node
)
6085 return error_mark_node
;
6087 /* Construct a new type node and return it. */
6088 if (TREE_CODE (t
) == FUNCTION_TYPE
)
6089 fntype
= build_function_type (return_type
, arg_types
);
6092 tree r
= TREE_TYPE (TREE_VALUE (arg_types
));
6093 if (! IS_AGGR_TYPE (r
))
6097 Type deduction may fail for any of the following
6100 -- Attempting to create "pointer to member of T" when T
6101 is not a class type. */
6103 cp_error ("creating pointer to member function of non-class type `%T'",
6105 return error_mark_node
;
6108 fntype
= build_cplus_method_type (r
, return_type
, TREE_CHAIN
6111 fntype
= build_qualified_type (fntype
, TYPE_QUALS (t
));
6112 fntype
= build_type_attribute_variant (fntype
, TYPE_ATTRIBUTES (t
));
6117 /* Substitute into the PARMS of a call-declarator. */
6120 tsubst_call_declarator_parms (parms
, args
, complain
, in_decl
)
6130 if (!parms
|| parms
== void_list_node
)
6133 new_parms
= tsubst_call_declarator_parms (TREE_CHAIN (parms
),
6134 args
, complain
, in_decl
);
6136 /* Figure out the type of this parameter. */
6137 type
= tsubst (TREE_VALUE (parms
), args
, complain
, in_decl
);
6139 /* Figure out the default argument as well. Note that we use
6140 tsubst_expr since the default argument is really an expression. */
6141 defarg
= tsubst_expr (TREE_PURPOSE (parms
), args
, complain
, in_decl
);
6143 /* Chain this parameter on to the front of those we have already
6144 processed. We don't use hash_tree_cons because that function
6145 doesn't check TREE_PARMLIST. */
6146 new_parms
= tree_cons (defarg
, type
, new_parms
);
6148 /* And note that these are parameters. */
6149 TREE_PARMLIST (new_parms
) = 1;
6154 /* Take the tree structure T and replace template parameters used
6155 therein with the argument vector ARGS. IN_DECL is an associated
6156 decl for diagnostics. If an error occurs, returns ERROR_MARK_NODE.
6157 An appropriate error message is issued only if COMPLAIN is
6158 non-zero. Note that we must be relatively non-tolerant of
6159 extensions here, in order to preserve conformance; if we allow
6160 substitutions that should not be allowed, we may allow argument
6161 deductions that should not succeed, and therefore report ambiguous
6162 overload situations where there are none. In theory, we could
6163 allow the substitution, but indicate that it should have failed,
6164 and allow our caller to make sure that the right thing happens, but
6165 we don't try to do this yet.
6167 This function is used for dealing with types, decls and the like;
6168 for expressions, use tsubst_expr or tsubst_copy. */
6171 tsubst (t
, args
, complain
, in_decl
)
6178 if (t
== NULL_TREE
|| t
== error_mark_node
6179 || t
== integer_type_node
6180 || t
== void_type_node
6181 || t
== char_type_node
6182 || TREE_CODE (t
) == NAMESPACE_DECL
)
6185 if (TREE_CODE (t
) == IDENTIFIER_NODE
)
6186 type
= IDENTIFIER_TYPE_VALUE (t
);
6188 type
= TREE_TYPE (t
);
6189 if (type
== unknown_type_node
)
6190 my_friendly_abort (42);
6192 if (type
&& TREE_CODE (t
) != FUNCTION_DECL
6193 && TREE_CODE (t
) != TYPENAME_TYPE
6194 && TREE_CODE (t
) != TEMPLATE_DECL
6195 && TREE_CODE (t
) != IDENTIFIER_NODE
6196 && TREE_CODE (t
) != FUNCTION_TYPE
6197 && TREE_CODE (t
) != METHOD_TYPE
)
6198 type
= tsubst (type
, args
, complain
, in_decl
);
6199 if (type
== error_mark_node
)
6200 return error_mark_node
;
6203 return tsubst_decl (t
, args
, type
, in_decl
);
6205 switch (TREE_CODE (t
))
6210 return tsubst_aggr_type (t
, args
, complain
, in_decl
,
6211 /*entering_scope=*/0);
6214 case IDENTIFIER_NODE
:
6227 if (t
== integer_type_node
)
6230 if (TREE_CODE (TYPE_MIN_VALUE (t
)) == INTEGER_CST
6231 && TREE_CODE (TYPE_MAX_VALUE (t
)) == INTEGER_CST
)
6235 tree max
, omax
= TREE_OPERAND (TYPE_MAX_VALUE (t
), 0);
6237 max
= tsubst_expr (omax
, args
, complain
, in_decl
);
6238 if (max
== error_mark_node
)
6239 return error_mark_node
;
6241 /* See if we can reduce this expression to something simpler. */
6242 max
= maybe_fold_nontype_arg (max
);
6243 if (!processing_template_decl
)
6244 max
= decl_constant_value (max
);
6246 if (processing_template_decl
6247 /* When providing explicit arguments to a template
6248 function, but leaving some arguments for subsequent
6249 deduction, MAX may be template-dependent even if we're
6250 not PROCESSING_TEMPLATE_DECL. We still need to check for
6251 template parms, though; MAX won't be an INTEGER_CST for
6252 dynamic arrays, either. */
6253 || (TREE_CODE (max
) != INTEGER_CST
6254 && uses_template_parms (max
)))
6256 tree itype
= make_node (INTEGER_TYPE
);
6257 TYPE_MIN_VALUE (itype
) = size_zero_node
;
6258 TYPE_MAX_VALUE (itype
) = build_min (MINUS_EXPR
, sizetype
, max
,
6263 if (integer_zerop (omax
))
6265 /* Still allow an explicit array of size zero. */
6267 pedwarn ("creating array with size zero");
6269 else if (integer_zerop (max
)
6270 || (TREE_CODE (max
) == INTEGER_CST
6271 && INT_CST_LT (max
, integer_zero_node
)))
6275 Type deduction may fail for any of the following
6278 Attempting to create an array with a size that is
6279 zero or negative. */
6281 cp_error ("creating array with size zero (`%E')", max
);
6283 return error_mark_node
;
6286 return compute_array_index_type (NULL_TREE
, max
);
6289 case TEMPLATE_TYPE_PARM
:
6290 case TEMPLATE_TEMPLATE_PARM
:
6291 case BOUND_TEMPLATE_TEMPLATE_PARM
:
6292 case TEMPLATE_PARM_INDEX
:
6300 if (TREE_CODE (t
) == TEMPLATE_TYPE_PARM
6301 || TREE_CODE (t
) == TEMPLATE_TEMPLATE_PARM
6302 || TREE_CODE (t
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
6304 idx
= TEMPLATE_TYPE_IDX (t
);
6305 level
= TEMPLATE_TYPE_LEVEL (t
);
6309 idx
= TEMPLATE_PARM_IDX (t
);
6310 level
= TEMPLATE_PARM_LEVEL (t
);
6313 if (TREE_VEC_LENGTH (args
) > 0)
6315 tree arg
= NULL_TREE
;
6317 levels
= TMPL_ARGS_DEPTH (args
);
6318 if (level
<= levels
)
6319 arg
= TMPL_ARG (args
, level
, idx
);
6321 if (arg
== error_mark_node
)
6322 return error_mark_node
;
6323 else if (arg
!= NULL_TREE
)
6325 if (TREE_CODE (t
) == TEMPLATE_TYPE_PARM
)
6327 my_friendly_assert (TYPE_P (arg
), 0);
6328 return cp_build_qualified_type_real
6329 (arg
, CP_TYPE_QUALS (arg
) | CP_TYPE_QUALS (t
),
6332 else if (TREE_CODE (t
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
6334 /* We are processing a type constructed from
6335 a template template parameter */
6336 tree argvec
= tsubst (TYPE_TI_ARGS (t
),
6337 args
, complain
, in_decl
);
6338 if (argvec
== error_mark_node
)
6339 return error_mark_node
;
6341 /* We can get a TEMPLATE_TEMPLATE_PARM here when
6342 we are resolving nested-types in the signature of
6343 a member function templates.
6344 Otherwise ARG is a TEMPLATE_DECL and is the real
6345 template to be instantiated. */
6346 if (TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
)
6347 arg
= TYPE_NAME (arg
);
6349 r
= lookup_template_class (arg
,
6352 /*entering_scope=*/0);
6353 return cp_build_qualified_type_real (r
,
6358 /* TEMPLATE_TEMPLATE_PARM or TEMPLATE_PARM_INDEX. */
6363 my_friendly_abort (981018);
6366 /* This can happen during the attempted tsubst'ing in
6367 unify. This means that we don't yet have any information
6368 about the template parameter in question. */
6371 /* If we get here, we must have been looking at a parm for a
6372 more deeply nested template. Make a new version of this
6373 template parameter, but with a lower level. */
6374 switch (TREE_CODE (t
))
6376 case TEMPLATE_TYPE_PARM
:
6377 case TEMPLATE_TEMPLATE_PARM
:
6378 case BOUND_TEMPLATE_TEMPLATE_PARM
:
6379 if (CP_TYPE_QUALS (t
))
6381 r
= tsubst (TYPE_MAIN_VARIANT (t
), args
, complain
, in_decl
);
6382 r
= cp_build_qualified_type_real (r
, CP_TYPE_QUALS (t
),
6388 TEMPLATE_TYPE_PARM_INDEX (r
)
6389 = reduce_template_parm_level (TEMPLATE_TYPE_PARM_INDEX (t
),
6391 TYPE_STUB_DECL (r
) = TYPE_NAME (r
) = TEMPLATE_TYPE_DECL (r
);
6392 TYPE_MAIN_VARIANT (r
) = r
;
6393 TYPE_POINTER_TO (r
) = NULL_TREE
;
6394 TYPE_REFERENCE_TO (r
) = NULL_TREE
;
6396 if (TREE_CODE (t
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
6398 tree argvec
= tsubst (TYPE_TI_ARGS (t
), args
,
6400 if (argvec
== error_mark_node
)
6401 return error_mark_node
;
6403 TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (r
)
6404 = tree_cons (TYPE_TI_TEMPLATE (t
), argvec
, NULL_TREE
);
6409 case TEMPLATE_PARM_INDEX
:
6410 r
= reduce_template_parm_level (t
, type
, levels
);
6414 my_friendly_abort (0);
6422 tree purpose
, value
, chain
, result
;
6424 if (t
== void_list_node
)
6427 purpose
= TREE_PURPOSE (t
);
6430 purpose
= tsubst (purpose
, args
, complain
, in_decl
);
6431 if (purpose
== error_mark_node
)
6432 return error_mark_node
;
6434 value
= TREE_VALUE (t
);
6437 value
= tsubst (value
, args
, complain
, in_decl
);
6438 if (value
== error_mark_node
)
6439 return error_mark_node
;
6441 chain
= TREE_CHAIN (t
);
6442 if (chain
&& chain
!= void_type_node
)
6444 chain
= tsubst (chain
, args
, complain
, in_decl
);
6445 if (chain
== error_mark_node
)
6446 return error_mark_node
;
6448 if (purpose
== TREE_PURPOSE (t
)
6449 && value
== TREE_VALUE (t
)
6450 && chain
== TREE_CHAIN (t
))
6452 result
= hash_tree_cons (purpose
, value
, chain
);
6453 TREE_PARMLIST (result
) = TREE_PARMLIST (t
);
6457 if (type
!= NULL_TREE
)
6459 /* A binfo node. We always need to make a copy, of the node
6460 itself and of its BINFO_BASETYPES. */
6464 /* Make sure type isn't a typedef copy. */
6465 type
= BINFO_TYPE (TYPE_BINFO (type
));
6467 TREE_TYPE (t
) = complete_type (type
);
6468 if (IS_AGGR_TYPE (type
))
6470 BINFO_VTABLE (t
) = TYPE_BINFO_VTABLE (type
);
6471 BINFO_VIRTUALS (t
) = TYPE_BINFO_VIRTUALS (type
);
6472 if (TYPE_BINFO_BASETYPES (type
) != NULL_TREE
)
6473 BINFO_BASETYPES (t
) = copy_node (TYPE_BINFO_BASETYPES (type
));
6478 /* Otherwise, a vector of template arguments. */
6479 return tsubst_template_arg_vector (t
, args
, complain
);
6482 case REFERENCE_TYPE
:
6484 enum tree_code code
;
6486 if (type
== TREE_TYPE (t
))
6489 code
= TREE_CODE (t
);
6494 Type deduction may fail for any of the following
6497 -- Attempting to create a pointer to reference type.
6498 -- Attempting to create a reference to a reference type or
6499 a reference to void. */
6500 if (TREE_CODE (type
) == REFERENCE_TYPE
6501 || (code
== REFERENCE_TYPE
&& TREE_CODE (type
) == VOID_TYPE
))
6503 static int last_line
= 0;
6504 static const char* last_file
= 0;
6506 /* We keep track of the last time we issued this error
6507 message to avoid spewing a ton of messages during a
6508 single bad template instantiation. */
6509 if (complain
&& (last_line
!= lineno
||
6510 last_file
!= input_filename
))
6512 if (TREE_CODE (type
) == VOID_TYPE
)
6513 cp_error ("forming reference to void");
6515 cp_error ("forming %s to reference type `%T'",
6516 (code
== POINTER_TYPE
) ? "pointer" : "reference",
6519 last_file
= input_filename
;
6522 return error_mark_node
;
6524 else if (code
== POINTER_TYPE
)
6525 r
= build_pointer_type (type
);
6527 r
= build_reference_type (type
);
6528 r
= cp_build_qualified_type_real (r
, TYPE_QUALS (t
), complain
);
6530 if (r
!= error_mark_node
)
6531 /* Will this ever be needed for TYPE_..._TO values? */
6538 r
= tsubst (TYPE_OFFSET_BASETYPE (t
), args
, complain
, in_decl
);
6539 if (r
== error_mark_node
|| !IS_AGGR_TYPE (r
))
6543 Type deduction may fail for any of the following
6546 -- Attempting to create "pointer to member of T" when T
6547 is not a class type. */
6549 cp_error ("creating pointer to member of non-class type `%T'",
6551 return error_mark_node
;
6553 return build_offset_type (r
, type
);
6561 fntype
= tsubst_function_type (t
, args
, complain
, in_decl
);
6562 if (fntype
== error_mark_node
)
6563 return error_mark_node
;
6565 /* Substitue the exception specification. */
6566 raises
= TYPE_RAISES_EXCEPTIONS (t
);
6569 tree list
= NULL_TREE
;
6571 if (! TREE_VALUE (raises
))
6574 for (; raises
!= NULL_TREE
; raises
= TREE_CHAIN (raises
))
6576 tree spec
= TREE_VALUE (raises
);
6578 spec
= tsubst (spec
, args
, complain
, in_decl
);
6579 if (spec
== error_mark_node
)
6581 list
= add_exception_specifier (list
, spec
, complain
);
6583 fntype
= build_exception_variant (fntype
, list
);
6589 tree domain
= tsubst (TYPE_DOMAIN (t
), args
, complain
, in_decl
);
6590 if (domain
== error_mark_node
)
6591 return error_mark_node
;
6593 /* As an optimization, we avoid regenerating the array type if
6594 it will obviously be the same as T. */
6595 if (type
== TREE_TYPE (t
) && domain
== TYPE_DOMAIN (t
))
6598 /* These checks should match the ones in grokdeclarator.
6602 The deduction may fail for any of the following reasons:
6604 -- Attempting to create an array with an element type that
6605 is void, a function type, or a reference type. */
6606 if (TREE_CODE (type
) == VOID_TYPE
6607 || TREE_CODE (type
) == FUNCTION_TYPE
6608 || TREE_CODE (type
) == REFERENCE_TYPE
)
6611 cp_error ("creating array of `%T'", type
);
6612 return error_mark_node
;
6615 r
= build_cplus_array_type (type
, domain
);
6622 tree e1
= tsubst (TREE_OPERAND (t
, 0), args
, complain
,
6624 tree e2
= tsubst (TREE_OPERAND (t
, 1), args
, complain
,
6627 if (e1
== error_mark_node
|| e2
== error_mark_node
)
6628 return error_mark_node
;
6630 return fold (build (TREE_CODE (t
), TREE_TYPE (t
), e1
, e2
));
6636 tree e
= tsubst (TREE_OPERAND (t
, 0), args
, complain
,
6638 if (e
== error_mark_node
)
6639 return error_mark_node
;
6641 return fold (build (TREE_CODE (t
), TREE_TYPE (t
), e
));
6646 tree ctx
= tsubst_aggr_type (TYPE_CONTEXT (t
), args
, complain
,
6647 in_decl
, /*entering_scope=*/1);
6648 tree f
= tsubst_copy (TYPENAME_TYPE_FULLNAME (t
), args
,
6651 if (ctx
== error_mark_node
|| f
== error_mark_node
)
6652 return error_mark_node
;
6654 if (!IS_AGGR_TYPE (ctx
))
6657 cp_error ("`%T' is not a class, struct, or union type",
6659 return error_mark_node
;
6661 else if (!uses_template_parms (ctx
) && !TYPE_BEING_DEFINED (ctx
))
6663 /* Normally, make_typename_type does not require that the CTX
6664 have complete type in order to allow things like:
6666 template <class T> struct S { typename S<T>::X Y; };
6668 But, such constructs have already been resolved by this
6669 point, so here CTX really should have complete type, unless
6670 it's a partial instantiation. */
6671 ctx
= complete_type (ctx
);
6672 if (!COMPLETE_TYPE_P (ctx
))
6675 incomplete_type_error (NULL_TREE
, ctx
);
6676 return error_mark_node
;
6680 f
= make_typename_type (ctx
, f
, complain
);
6681 if (f
== error_mark_node
)
6683 return cp_build_qualified_type_real (f
,
6685 | CP_TYPE_QUALS (t
),
6691 tree e
= tsubst (TREE_OPERAND (t
, 0), args
, complain
,
6693 if (e
== error_mark_node
)
6694 return error_mark_node
;
6695 return make_pointer_declarator (type
, e
);
6700 tree e
= tsubst (TREE_OPERAND (t
, 0), args
, complain
,
6702 if (e
== error_mark_node
)
6703 return error_mark_node
;
6704 return make_reference_declarator (type
, e
);
6709 tree e1
= tsubst (TREE_OPERAND (t
, 0), args
, complain
,
6711 tree e2
= tsubst_expr (TREE_OPERAND (t
, 1), args
, complain
,
6713 if (e1
== error_mark_node
|| e2
== error_mark_node
)
6714 return error_mark_node
;
6716 return build_parse_node (ARRAY_REF
, e1
, e2
, tsubst_expr
);
6721 tree e1
= tsubst (TREE_OPERAND (t
, 0), args
, complain
,
6723 tree e2
= (tsubst_call_declarator_parms
6724 (CALL_DECLARATOR_PARMS (t
), args
, complain
, in_decl
));
6725 tree e3
= tsubst (CALL_DECLARATOR_EXCEPTION_SPEC (t
), args
,
6728 if (e1
== error_mark_node
|| e2
== error_mark_node
6729 || e3
== error_mark_node
)
6730 return error_mark_node
;
6732 return make_call_declarator (e1
, e2
, CALL_DECLARATOR_QUALS (t
), e3
);
6737 tree e1
= tsubst (TREE_OPERAND (t
, 0), args
, complain
,
6739 tree e2
= tsubst (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
6740 if (e1
== error_mark_node
|| e2
== error_mark_node
)
6741 return error_mark_node
;
6743 return build_parse_node (TREE_CODE (t
), e1
, e2
);
6748 tree e1
= tsubst_expr (TYPE_FIELDS (t
), args
, complain
,
6750 if (e1
== error_mark_node
)
6751 return error_mark_node
;
6753 return TREE_TYPE (e1
);
6763 /* This code should match declare_hidden_char_array in
6765 name
= (*decl_printable_name
) (current_function_decl
, 2);
6766 len
= strlen (name
) + 1;
6767 type
= build_array_type (char_type_node
,
6768 build_index_type (size_int (len
)));
6769 str
= build_string (len
, name
);
6770 TREE_TYPE (str
) = type
;
6775 sorry ("use of `%s' in template",
6776 tree_code_name
[(int) TREE_CODE (t
)]);
6777 return error_mark_node
;
6781 /* Like tsubst, but deals with expressions. This function just replaces
6782 template parms; to finish processing the resultant expression, use
6786 tsubst_copy (t
, args
, complain
, in_decl
)
6791 enum tree_code code
;
6794 if (t
== NULL_TREE
|| t
== error_mark_node
)
6797 code
= TREE_CODE (t
);
6802 return do_identifier (DECL_NAME (t
), 0, NULL_TREE
);
6809 if (!DECL_CONTEXT (t
))
6810 /* This is a global enumeration constant. */
6813 /* Unfortunately, we cannot just call lookup_name here.
6816 template <int I> int f() {
6818 struct S { void g() { E e = a; } };
6821 When we instantiate f<7>::S::g(), say, lookup_name is not
6822 clever enough to find f<7>::a. */
6824 = tsubst_aggr_type (TREE_TYPE (t
), args
, complain
, in_decl
,
6825 /*entering_scope=*/0);
6827 for (v
= TYPE_VALUES (enum_type
);
6830 if (TREE_PURPOSE (v
) == DECL_NAME (t
))
6831 return TREE_VALUE (v
);
6833 /* We didn't find the name. That should never happen; if
6834 name-lookup found it during preliminary parsing, we
6835 should find it again here during instantiation. */
6836 my_friendly_abort (0);
6841 if (DECL_CONTEXT (t
))
6845 ctx
= tsubst_aggr_type (DECL_CONTEXT (t
), args
, complain
, in_decl
,
6846 /*entering_scope=*/1);
6847 if (ctx
!= DECL_CONTEXT (t
))
6848 return lookup_field (ctx
, DECL_NAME (t
), 0, 0);
6854 if (DECL_LANG_SPECIFIC (t
) && DECL_TEMPLATE_INFO (t
))
6855 t
= tsubst (t
, args
, complain
, in_decl
);
6860 if (is_member_template (t
))
6861 return tsubst (t
, args
, complain
, in_decl
);
6867 /* We must tsbust into a LOOKUP_EXPR in case the names to
6868 which it refers is a conversion operator; in that case the
6869 name will change. We avoid making unnecessary copies,
6872 tree id
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
6874 if (id
!= TREE_OPERAND (t
, 0))
6876 r
= build_nt (LOOKUP_EXPR
, id
);
6877 LOOKUP_EXPR_GLOBAL (r
) = LOOKUP_EXPR_GLOBAL (t
);
6885 case REINTERPRET_CAST_EXPR
:
6886 case CONST_CAST_EXPR
:
6887 case STATIC_CAST_EXPR
:
6888 case DYNAMIC_CAST_EXPR
:
6891 (code
, tsubst (TREE_TYPE (t
), args
, complain
, in_decl
),
6892 tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
));
6895 case PREDECREMENT_EXPR
:
6896 case PREINCREMENT_EXPR
:
6897 case POSTDECREMENT_EXPR
:
6898 case POSTINCREMENT_EXPR
:
6900 case TRUTH_NOT_EXPR
:
6903 case CONVERT_EXPR
: /* Unary + */
6912 (code
, tsubst (TREE_TYPE (t
), args
, complain
, in_decl
),
6913 tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
));
6918 case TRUNC_DIV_EXPR
:
6920 case FLOOR_DIV_EXPR
:
6921 case ROUND_DIV_EXPR
:
6922 case EXACT_DIV_EXPR
:
6924 case BIT_ANDTC_EXPR
:
6927 case TRUNC_MOD_EXPR
:
6928 case FLOOR_MOD_EXPR
:
6929 case TRUTH_ANDIF_EXPR
:
6930 case TRUTH_ORIF_EXPR
:
6931 case TRUTH_AND_EXPR
:
6952 (code
, tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
),
6953 tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
));
6957 tree fn
= TREE_OPERAND (t
, 0);
6958 if (is_overloaded_fn (fn
))
6959 fn
= tsubst_copy (get_first_fn (fn
), args
, complain
, in_decl
);
6961 /* Sometimes FN is a LOOKUP_EXPR. */
6962 fn
= tsubst_copy (fn
, args
, complain
, in_decl
);
6964 (code
, fn
, tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
,
6969 case METHOD_CALL_EXPR
:
6971 tree name
= TREE_OPERAND (t
, 0);
6972 if (TREE_CODE (name
) == BIT_NOT_EXPR
)
6974 name
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
6976 name
= build1 (BIT_NOT_EXPR
, NULL_TREE
, name
);
6978 else if (TREE_CODE (name
) == SCOPE_REF
6979 && TREE_CODE (TREE_OPERAND (name
, 1)) == BIT_NOT_EXPR
)
6981 tree base
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
6983 name
= TREE_OPERAND (name
, 1);
6984 name
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
6986 name
= build1 (BIT_NOT_EXPR
, NULL_TREE
, name
);
6987 name
= build_nt (SCOPE_REF
, base
, name
);
6990 name
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
6992 (code
, name
, tsubst_copy (TREE_OPERAND (t
, 1), args
,
6994 tsubst_copy (TREE_OPERAND (t
, 2), args
, complain
, in_decl
),
6999 /* This processing should really occur in tsubst_expr, However,
7000 tsubst_expr does not recurse into expressions, since it
7001 assumes that there aren't any statements inside them.
7002 Instead, it simply calls build_expr_from_tree. So, we need
7003 to expand the STMT_EXPR here. */
7004 if (!processing_template_decl
)
7006 tree stmt_expr
= begin_stmt_expr ();
7007 tsubst_expr (STMT_EXPR_STMT (t
), args
,
7009 return finish_stmt_expr (stmt_expr
);
7016 case PSEUDO_DTOR_EXPR
:
7019 (code
, tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
),
7020 tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
),
7021 tsubst_copy (TREE_OPERAND (t
, 2), args
, complain
, in_decl
));
7028 (code
, tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
),
7029 tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
),
7030 tsubst_copy (TREE_OPERAND (t
, 2), args
, complain
, in_decl
));
7031 NEW_EXPR_USE_GLOBAL (r
) = NEW_EXPR_USE_GLOBAL (t
);
7038 (code
, tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
),
7039 tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
));
7040 DELETE_EXPR_USE_GLOBAL (r
) = DELETE_EXPR_USE_GLOBAL (t
);
7041 DELETE_EXPR_USE_VEC (r
) = DELETE_EXPR_USE_VEC (t
);
7045 case TEMPLATE_ID_EXPR
:
7047 /* Substituted template arguments */
7048 tree targs
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
,
7051 if (targs
&& TREE_CODE (targs
) == TREE_LIST
)
7054 for (chain
= targs
; chain
; chain
= TREE_CHAIN (chain
))
7055 TREE_VALUE (chain
) = maybe_fold_nontype_arg (TREE_VALUE (chain
));
7060 for (i
= 0; i
< TREE_VEC_LENGTH (targs
); ++i
)
7061 TREE_VEC_ELT (targs
, i
)
7062 = maybe_fold_nontype_arg (TREE_VEC_ELT (targs
, i
));
7065 return lookup_template_function
7066 (tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
), targs
);
7071 tree purpose
, value
, chain
;
7073 if (t
== void_list_node
)
7076 purpose
= TREE_PURPOSE (t
);
7078 purpose
= tsubst_copy (purpose
, args
, complain
, in_decl
);
7079 value
= TREE_VALUE (t
);
7081 value
= tsubst_copy (value
, args
, complain
, in_decl
);
7082 chain
= TREE_CHAIN (t
);
7083 if (chain
&& chain
!= void_type_node
)
7084 chain
= tsubst_copy (chain
, args
, complain
, in_decl
);
7085 if (purpose
== TREE_PURPOSE (t
)
7086 && value
== TREE_VALUE (t
)
7087 && chain
== TREE_CHAIN (t
))
7089 return tree_cons (purpose
, value
, chain
);
7096 case TEMPLATE_TYPE_PARM
:
7097 case TEMPLATE_TEMPLATE_PARM
:
7098 case BOUND_TEMPLATE_TEMPLATE_PARM
:
7099 case TEMPLATE_PARM_INDEX
:
7101 case REFERENCE_TYPE
:
7108 return tsubst (t
, args
, complain
, in_decl
);
7110 case IDENTIFIER_NODE
:
7111 if (IDENTIFIER_TYPENAME_P (t
))
7113 tree new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
7115 return mangle_conv_op_name_for_type (new_type
);
7117 return (build_typename_overload (new_type
));
7125 (CONSTRUCTOR
, tsubst (TREE_TYPE (t
), args
, complain
, in_decl
),
7126 NULL_TREE
, tsubst_copy (CONSTRUCTOR_ELTS (t
), args
,
7127 complain
, in_decl
));
7128 TREE_HAS_CONSTRUCTOR (r
) = TREE_HAS_CONSTRUCTOR (t
);
7133 return build_x_va_arg (tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
,
7135 tsubst (TREE_TYPE (t
), args
, complain
, in_decl
));
7138 return tsubst (t
, args
, complain
, in_decl
);
7145 /* Like tsubst_copy, but also does semantic processing. */
7148 tsubst_expr (t
, args
, complain
, in_decl
)
7155 if (t
== NULL_TREE
|| t
== error_mark_node
)
7158 if (processing_template_decl
)
7159 return tsubst_copy (t
, args
, complain
, in_decl
);
7161 switch (TREE_CODE (t
))
7165 finish_named_return_value
7166 (TREE_OPERAND (t
, 0),
7167 tsubst_expr (TREE_OPERAND (t
, 1), args
, /*complain=*/1, in_decl
));
7168 tsubst_expr (TREE_CHAIN (t
), args
, complain
, in_decl
);
7171 case CTOR_INITIALIZER
:
7173 tree member_init_list
;
7174 tree base_init_list
;
7178 = tsubst_initializer_list (TREE_OPERAND (t
, 0), args
);
7180 = tsubst_initializer_list (TREE_OPERAND (t
, 1), args
);
7181 setup_vtbl_ptr (member_init_list
, base_init_list
);
7182 tsubst_expr (TREE_CHAIN (t
), args
, complain
, in_decl
);
7188 finish_return_stmt (tsubst_expr (RETURN_EXPR (t
),
7189 args
, complain
, in_decl
));
7194 finish_expr_stmt (tsubst_expr (EXPR_STMT_EXPR (t
),
7195 args
, complain
, in_decl
));
7204 decl
= DECL_STMT_DECL (t
);
7205 if (TREE_CODE (decl
) == LABEL_DECL
)
7206 finish_label_decl (DECL_NAME (decl
));
7209 init
= DECL_INITIAL (decl
);
7210 decl
= tsubst (decl
, args
, complain
, in_decl
);
7211 init
= tsubst_expr (init
, args
, complain
, in_decl
);
7212 if (decl
!= error_mark_node
)
7214 if (TREE_CODE (decl
) != TYPE_DECL
)
7215 /* Make sure the type is instantiated now. */
7216 complete_type (TREE_TYPE (decl
));
7218 DECL_INITIAL (decl
) = error_mark_node
;
7219 /* By marking the declaration as instantiated, we avoid
7220 trying to instantiate it. Since instantiate_decl can't
7221 handle local variables, and since we've already done
7222 all that needs to be done, that's the right thing to
7224 if (TREE_CODE (decl
) == VAR_DECL
)
7225 DECL_TEMPLATE_INSTANTIATED (decl
) = 1;
7226 maybe_push_decl (decl
);
7227 cp_finish_decl (decl
, init
, NULL_TREE
, 0);
7238 stmt
= begin_for_stmt ();
7239 for (tmp
= FOR_INIT_STMT (t
); tmp
; tmp
= TREE_CHAIN (tmp
))
7240 tsubst_expr (tmp
, args
, complain
, in_decl
);
7241 finish_for_init_stmt (stmt
);
7242 finish_for_cond (tsubst_expr (FOR_COND (t
), args
,
7245 tmp
= tsubst_expr (FOR_EXPR (t
), args
, complain
, in_decl
);
7246 finish_for_expr (tmp
, stmt
);
7247 tsubst_expr (FOR_BODY (t
), args
, complain
, in_decl
);
7248 finish_for_stmt (stmt
);
7255 stmt
= begin_while_stmt ();
7256 finish_while_stmt_cond (tsubst_expr (WHILE_COND (t
),
7257 args
, complain
, in_decl
),
7259 tsubst_expr (WHILE_BODY (t
), args
, complain
, in_decl
);
7260 finish_while_stmt (stmt
);
7267 stmt
= begin_do_stmt ();
7268 tsubst_expr (DO_BODY (t
), args
, complain
, in_decl
);
7269 finish_do_body (stmt
);
7270 finish_do_stmt (tsubst_expr (DO_COND (t
), args
,
7281 stmt
= begin_if_stmt ();
7282 finish_if_stmt_cond (tsubst_expr (IF_COND (t
),
7283 args
, complain
, in_decl
),
7286 if (tmp
= THEN_CLAUSE (t
), tmp
)
7288 tsubst_expr (tmp
, args
, complain
, in_decl
);
7289 finish_then_clause (stmt
);
7292 if (tmp
= ELSE_CLAUSE (t
), tmp
)
7294 begin_else_clause ();
7295 tsubst_expr (tmp
, args
, complain
, in_decl
);
7296 finish_else_clause (stmt
);
7308 stmt
= begin_compound_stmt (COMPOUND_STMT_NO_SCOPE (t
));
7309 for (substmt
= COMPOUND_BODY (t
);
7310 substmt
!= NULL_TREE
;
7311 substmt
= TREE_CHAIN (substmt
))
7312 tsubst_expr (substmt
, args
, complain
, in_decl
);
7313 return finish_compound_stmt (COMPOUND_STMT_NO_SCOPE (t
), stmt
);
7319 finish_break_stmt ();
7324 finish_continue_stmt ();
7332 stmt
= begin_switch_stmt ();
7333 val
= tsubst_expr (SWITCH_COND (t
), args
, complain
, in_decl
);
7334 finish_switch_cond (val
, stmt
);
7335 tsubst_expr (SWITCH_BODY (t
), args
, complain
, in_decl
);
7336 finish_switch_stmt (stmt
);
7342 finish_case_label (tsubst_expr (CASE_LOW (t
), args
, complain
, in_decl
),
7343 tsubst_expr (CASE_HIGH (t
), args
, complain
,
7348 lineno
= STMT_LINENO (t
);
7349 finish_label_stmt (DECL_NAME (LABEL_STMT_LABEL (t
)));
7354 t
= GOTO_DESTINATION (t
);
7355 if (TREE_CODE (t
) != LABEL_DECL
)
7356 /* Computed goto's must be tsubst'd into. On the other hand,
7357 non-computed gotos must not be; the identifier in question
7358 will have no binding. */
7359 t
= tsubst_expr (t
, args
, complain
, in_decl
);
7362 finish_goto_stmt (t
);
7367 finish_asm_stmt (ASM_CV_QUAL (t
),
7368 tsubst_expr (ASM_STRING (t
), args
, complain
, in_decl
),
7369 tsubst_expr (ASM_OUTPUTS (t
), args
, complain
, in_decl
),
7370 tsubst_expr (ASM_INPUTS (t
), args
, complain
, in_decl
),
7371 tsubst_expr (ASM_CLOBBERS (t
), args
, complain
,
7379 stmt
= begin_try_block ();
7380 tsubst_expr (TRY_STMTS (t
), args
, complain
, in_decl
);
7381 finish_cleanup_try_block (stmt
);
7382 finish_cleanup (tsubst_expr (TRY_HANDLERS (t
), args
,
7390 if (FN_TRY_BLOCK_P (t
))
7391 stmt
= begin_function_try_block ();
7393 stmt
= begin_try_block ();
7395 tsubst_expr (TRY_STMTS (t
), args
, complain
, in_decl
);
7397 if (FN_TRY_BLOCK_P (t
))
7398 finish_function_try_block (stmt
);
7400 finish_try_block (stmt
);
7402 handler
= TRY_HANDLERS (t
);
7403 for (; handler
; handler
= TREE_CHAIN (handler
))
7404 tsubst_expr (handler
, args
, complain
, in_decl
);
7405 if (FN_TRY_BLOCK_P (t
))
7406 finish_function_handler_sequence (stmt
);
7408 finish_handler_sequence (stmt
);
7418 stmt
= begin_handler ();
7419 if (HANDLER_PARMS (t
))
7421 decl
= DECL_STMT_DECL (HANDLER_PARMS (t
));
7422 decl
= tsubst (decl
, args
, complain
, in_decl
);
7423 /* Prevent instantiate_decl from trying to instantiate
7424 this variable. We've already done all that needs to be
7426 DECL_TEMPLATE_INSTANTIATED (decl
) = 1;
7430 blocks
= finish_handler_parms (decl
, stmt
);
7431 tsubst_expr (HANDLER_BODY (t
), args
, complain
, in_decl
);
7432 finish_handler (blocks
, stmt
);
7439 tsubst (t
, args
, complain
, NULL_TREE
);
7443 return build_expr_from_tree (tsubst_copy (t
, args
, complain
, in_decl
));
7448 /* TMPL is a TEMPLATE_DECL for a cloned constructor or destructor.
7449 Instantiate it with the ARGS. */
7452 instantiate_clone (tmpl
, args
)
7459 /* Instantiated the cloned function, rather than the clone. */
7460 spec
= instantiate_template (DECL_CLONED_FUNCTION (tmpl
), args
);
7462 /* Then, see if we've already cloned the instantiation. */
7463 for (clone
= TREE_CHAIN (spec
);
7464 clone
&& DECL_CLONED_FUNCTION_P (clone
);
7465 clone
= TREE_CHAIN (clone
))
7466 if (DECL_NAME (clone
) == DECL_NAME (tmpl
))
7469 /* If we haven't, do so know. */
7471 clone_function_decl (spec
, /*update_method_vec_p=*/0);
7474 for (clone
= TREE_CHAIN (spec
);
7475 clone
&& DECL_CLONED_FUNCTION_P (clone
);
7476 clone
= TREE_CHAIN (clone
))
7477 if (DECL_NAME (clone
) == DECL_NAME (tmpl
))
7480 /* We should always have found the clone by now. */
7481 my_friendly_abort (20000411);
7485 /* Instantiate the indicated variable or function template TMPL with
7486 the template arguments in TARG_PTR. */
7489 instantiate_template (tmpl
, targ_ptr
)
7490 tree tmpl
, targ_ptr
;
7499 if (tmpl
== error_mark_node
)
7500 return error_mark_node
;
7502 my_friendly_assert (TREE_CODE (tmpl
) == TEMPLATE_DECL
, 283);
7504 /* If this function is a clone, handle it specially. */
7505 if (DECL_CLONED_FUNCTION_P (tmpl
))
7506 return instantiate_clone (tmpl
, targ_ptr
);
7508 /* Check to see if we already have this specialization. */
7509 spec
= retrieve_specialization (tmpl
, targ_ptr
);
7510 if (spec
!= NULL_TREE
)
7513 gen_tmpl
= most_general_template (tmpl
);
7514 if (tmpl
!= gen_tmpl
)
7516 /* The TMPL is a partial instantiation. To get a full set of
7517 arguments we must add the arguments used to perform the
7518 partial instantiation. */
7519 targ_ptr
= add_outermost_template_args (DECL_TI_ARGS (tmpl
),
7522 /* Check to see if we already have this specialization. */
7523 spec
= retrieve_specialization (gen_tmpl
, targ_ptr
);
7524 if (spec
!= NULL_TREE
)
7528 len
= DECL_NTPARMS (gen_tmpl
);
7529 inner_args
= INNERMOST_TEMPLATE_ARGS (targ_ptr
);
7533 tree t
= TREE_VEC_ELT (inner_args
, i
);
7536 tree nt
= target_type (t
);
7537 if (IS_AGGR_TYPE (nt
) && decl_function_context (TYPE_MAIN_DECL (nt
)))
7539 cp_error ("type `%T' composed from a local class is not a valid template-argument", t
);
7540 cp_error (" trying to instantiate `%D'", gen_tmpl
);
7541 return error_mark_node
;
7546 /* substitute template parameters */
7547 fndecl
= tsubst (DECL_TEMPLATE_RESULT (gen_tmpl
),
7548 targ_ptr
, /*complain=*/1, gen_tmpl
);
7549 /* The DECL_TI_TEMPLATE should always be the immediate parent
7550 template, not the most general template. */
7551 DECL_TI_TEMPLATE (fndecl
) = tmpl
;
7553 if (flag_external_templates
)
7554 add_pending_template (fndecl
);
7556 /* If we've just instantiated the main entry point for a function,
7557 instantiate all the alternate entry points as well. */
7558 for (clone
= TREE_CHAIN (gen_tmpl
);
7559 clone
&& DECL_CLONED_FUNCTION_P (clone
);
7560 clone
= TREE_CHAIN (clone
))
7561 instantiate_template (clone
, targ_ptr
);
7566 /* The FN is a TEMPLATE_DECL for a function. The ARGS are the
7567 arguments that are being used when calling it. TARGS is a vector
7568 into which the deduced template arguments are placed.
7570 Return zero for success, 2 for an incomplete match that doesn't resolve
7571 all the types, and 1 for complete failure. An error message will be
7572 printed only for an incomplete match.
7574 If FN is a conversion operator, or we are trying to produce a specific
7575 specialization, RETURN_TYPE is the return type desired.
7577 The EXPLICIT_TARGS are explicit template arguments provided via a
7580 The parameter STRICT is one of:
7583 We are deducing arguments for a function call, as in
7587 We are deducing arguments for a conversion function, as in
7591 We are deducing arguments when calculating the partial
7592 ordering between specializations of function or class
7593 templates, as in [temp.func.order] and [temp.class.order],
7594 when doing an explicit instantiation as in [temp.explicit],
7595 when determining an explicit specialization as in
7596 [temp.expl.spec], or when taking the address of a function
7597 template, as in [temp.deduct.funcaddr].
7599 LEN is the number of parms to consider before returning success, or -1
7600 for all. This is used in partial ordering to avoid comparing parms for
7601 which no actual argument was passed, since they are not considered in
7602 overload resolution (and are explicitly excluded from consideration in
7603 partial ordering in [temp.func.order]/6). */
7606 fn_type_unification (fn
, explicit_targs
, targs
, args
, return_type
,
7608 tree fn
, explicit_targs
, targs
, args
, return_type
;
7609 unification_kind_t strict
;
7616 my_friendly_assert (TREE_CODE (fn
) == TEMPLATE_DECL
, 0);
7618 fntype
= TREE_TYPE (fn
);
7623 The specified template arguments must match the template
7624 parameters in kind (i.e., type, nontype, template), and there
7625 must not be more arguments than there are parameters;
7626 otherwise type deduction fails.
7628 Nontype arguments must match the types of the corresponding
7629 nontype template parameters, or must be convertible to the
7630 types of the corresponding nontype parameters as specified in
7631 _temp.arg.nontype_, otherwise type deduction fails.
7633 All references in the function type of the function template
7634 to the corresponding template parameters are replaced by the
7635 specified template argument values. If a substitution in a
7636 template parameter or in the function type of the function
7637 template results in an invalid type, type deduction fails. */
7639 tree converted_args
;
7642 = (coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (fn
),
7643 explicit_targs
, NULL_TREE
, /*complain=*/0,
7644 /*require_all_arguments=*/0));
7645 if (converted_args
== error_mark_node
)
7648 fntype
= tsubst (fntype
, converted_args
, /*complain=*/0, NULL_TREE
);
7649 if (fntype
== error_mark_node
)
7652 /* Place the explicitly specified arguments in TARGS. */
7653 for (i
= 0; i
< TREE_VEC_LENGTH (targs
); i
++)
7654 TREE_VEC_ELT (targs
, i
) = TREE_VEC_ELT (converted_args
, i
);
7657 parms
= TYPE_ARG_TYPES (fntype
);
7658 /* Never do unification on the 'this' parameter. */
7659 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
))
7660 parms
= TREE_CHAIN (parms
);
7664 /* We've been given a return type to match, prepend it. */
7665 parms
= tree_cons (NULL_TREE
, TREE_TYPE (fntype
), parms
);
7666 args
= tree_cons (NULL_TREE
, return_type
, args
);
7671 /* We allow incomplete unification without an error message here
7672 because the standard doesn't seem to explicitly prohibit it. Our
7673 callers must be ready to deal with unification failures in any
7675 result
= type_unification_real (DECL_INNERMOST_TEMPLATE_PARMS (fn
),
7676 targs
, parms
, args
, /*subr=*/0,
7677 strict
, /*allow_incomplete*/1, len
);
7680 /* All is well so far. Now, check:
7684 When all template arguments have been deduced, all uses of
7685 template parameters in nondeduced contexts are replaced with
7686 the corresponding deduced argument values. If the
7687 substitution results in an invalid type, as described above,
7688 type deduction fails. */
7689 if (tsubst (TREE_TYPE (fn
), targs
, /*complain=*/0, NULL_TREE
)
7696 /* Adjust types before performing type deduction, as described in
7697 [temp.deduct.call] and [temp.deduct.conv]. The rules in these two
7698 sections are symmetric. PARM is the type of a function parameter
7699 or the return type of the conversion function. ARG is the type of
7700 the argument passed to the call, or the type of the value
7701 initialized with the result of the conversion function. */
7704 maybe_adjust_types_for_deduction (strict
, parm
, arg
)
7705 unification_kind_t strict
;
7716 /* Swap PARM and ARG throughout the remainder of this
7717 function; the handling is precisely symmetric since PARM
7718 will initialize ARG rather than vice versa. */
7726 /* There is nothing to do in this case. */
7730 my_friendly_abort (0);
7733 if (TREE_CODE (*parm
) != REFERENCE_TYPE
)
7735 /* [temp.deduct.call]
7737 If P is not a reference type:
7739 --If A is an array type, the pointer type produced by the
7740 array-to-pointer standard conversion (_conv.array_) is
7741 used in place of A for type deduction; otherwise,
7743 --If A is a function type, the pointer type produced by
7744 the function-to-pointer standard conversion
7745 (_conv.func_) is used in place of A for type deduction;
7748 --If A is a cv-qualified type, the top level
7749 cv-qualifiers of A's type are ignored for type
7751 if (TREE_CODE (*arg
) == ARRAY_TYPE
)
7752 *arg
= build_pointer_type (TREE_TYPE (*arg
));
7753 else if (TREE_CODE (*arg
) == FUNCTION_TYPE
)
7754 *arg
= build_pointer_type (*arg
);
7756 *arg
= TYPE_MAIN_VARIANT (*arg
);
7759 /* [temp.deduct.call]
7761 If P is a cv-qualified type, the top level cv-qualifiers
7762 of P's type are ignored for type deduction. If P is a
7763 reference type, the type referred to by P is used for
7765 *parm
= TYPE_MAIN_VARIANT (*parm
);
7766 if (TREE_CODE (*parm
) == REFERENCE_TYPE
)
7767 *parm
= TREE_TYPE (*parm
);
7770 /* Most parms like fn_type_unification.
7772 If SUBR is 1, we're being called recursively (to unify the
7773 arguments of a function or method parameter of a function
7777 type_unification_real (tparms
, targs
, parms
, args
, subr
,
7778 strict
, allow_incomplete
, len
)
7779 tree tparms
, targs
, parms
, args
;
7781 unification_kind_t strict
;
7782 int allow_incomplete
, len
;
7786 int ntparms
= TREE_VEC_LENGTH (tparms
);
7789 my_friendly_assert (TREE_CODE (tparms
) == TREE_VEC
, 289);
7790 my_friendly_assert (parms
== NULL_TREE
7791 || TREE_CODE (parms
) == TREE_LIST
, 290);
7792 /* ARGS could be NULL (via a call from parse.y to
7793 build_x_function_call). */
7795 my_friendly_assert (TREE_CODE (args
) == TREE_LIST
, 291);
7796 my_friendly_assert (ntparms
> 0, 292);
7801 sub_strict
= UNIFY_ALLOW_MORE_CV_QUAL
| UNIFY_ALLOW_DERIVED
;
7805 sub_strict
= UNIFY_ALLOW_LESS_CV_QUAL
;
7809 sub_strict
= UNIFY_ALLOW_NONE
;
7813 my_friendly_abort (0);
7820 && parms
!= void_list_node
7822 && args
!= void_list_node
)
7824 parm
= TREE_VALUE (parms
);
7825 parms
= TREE_CHAIN (parms
);
7826 arg
= TREE_VALUE (args
);
7827 args
= TREE_CHAIN (args
);
7829 if (arg
== error_mark_node
)
7831 if (arg
== unknown_type_node
)
7832 /* We can't deduce anything from this, but we might get all the
7833 template args from other function args. */
7836 /* Conversions will be performed on a function argument that
7837 corresponds with a function parameter that contains only
7838 non-deducible template parameters and explicitly specified
7839 template parameters. */
7840 if (! uses_template_parms (parm
))
7845 type
= TREE_TYPE (arg
);
7852 if (strict
== DEDUCE_EXACT
)
7854 if (same_type_p (parm
, type
))
7858 /* It might work; we shouldn't check now, because we might
7859 get into infinite recursion. Overload resolution will
7868 my_friendly_assert (TREE_TYPE (arg
) != NULL_TREE
, 293);
7869 if (type_unknown_p (arg
))
7871 /* [temp.deduct.type] A template-argument can be deduced from
7872 a pointer to function or pointer to member function
7873 argument if the set of overloaded functions does not
7874 contain function templates and at most one of a set of
7875 overloaded functions provides a unique match. */
7877 if (resolve_overloaded_unification
7878 (tparms
, targs
, parm
, arg
, strict
, sub_strict
)
7883 arg
= TREE_TYPE (arg
);
7887 maybe_adjust_types_for_deduction (strict
, &parm
, &arg
);
7889 if (unify (tparms
, targs
, parm
, arg
, sub_strict
))
7892 /* Are we done with the interesting parms? */
7896 /* Fail if we've reached the end of the parm list, and more args
7897 are present, and the parm list isn't variadic. */
7898 if (args
&& args
!= void_list_node
&& parms
== void_list_node
)
7900 /* Fail if parms are left and they don't have default values. */
7902 && parms
!= void_list_node
7903 && TREE_PURPOSE (parms
) == NULL_TREE
)
7906 for (i
= 0; i
< ntparms
; i
++)
7907 if (TREE_VEC_ELT (targs
, i
) == NULL_TREE
)
7909 if (!allow_incomplete
)
7910 error ("incomplete type unification");
7916 /* Subroutine of type_unification_real. Args are like the variables at the
7917 call site. ARG is an overloaded function (or template-id); we try
7918 deducing template args from each of the overloads, and if only one
7919 succeeds, we go with that. Modifies TARGS and returns 0 on success. */
7922 resolve_overloaded_unification (tparms
, targs
, parm
, arg
, strict
,
7924 tree tparms
, targs
, parm
, arg
;
7925 unification_kind_t strict
;
7928 tree tempargs
= copy_node (targs
);
7931 if (TREE_CODE (arg
) == ADDR_EXPR
)
7932 arg
= TREE_OPERAND (arg
, 0);
7934 if (TREE_CODE (arg
) == COMPONENT_REF
)
7935 /* Handle `&x' where `x' is some static or non-static member
7937 arg
= TREE_OPERAND (arg
, 1);
7939 if (TREE_CODE (arg
) == OFFSET_REF
)
7940 arg
= TREE_OPERAND (arg
, 1);
7942 /* Strip baselink information. */
7943 while (TREE_CODE (arg
) == TREE_LIST
)
7944 arg
= TREE_VALUE (arg
);
7946 if (TREE_CODE (arg
) == TEMPLATE_ID_EXPR
)
7948 /* If we got some explicit template args, we need to plug them into
7949 the affected templates before we try to unify, in case the
7950 explicit args will completely resolve the templates in question. */
7952 tree expl_subargs
= TREE_OPERAND (arg
, 1);
7953 arg
= TREE_OPERAND (arg
, 0);
7955 for (; arg
; arg
= OVL_NEXT (arg
))
7957 tree fn
= OVL_CURRENT (arg
);
7960 if (TREE_CODE (fn
) != TEMPLATE_DECL
)
7963 subargs
= get_bindings_overload (fn
, DECL_TEMPLATE_RESULT (fn
),
7967 elem
= tsubst (TREE_TYPE (fn
), subargs
, /*complain=*/0,
7969 if (TREE_CODE (elem
) == METHOD_TYPE
)
7970 elem
= build_ptrmemfunc_type (build_pointer_type (elem
));
7971 good
+= try_one_overload (tparms
, targs
, tempargs
, parm
, elem
,
7972 strict
, sub_strict
);
7976 else if (TREE_CODE (arg
) == OVERLOAD
)
7978 for (; arg
; arg
= OVL_NEXT (arg
))
7980 tree type
= TREE_TYPE (OVL_CURRENT (arg
));
7981 if (TREE_CODE (type
) == METHOD_TYPE
)
7982 type
= build_ptrmemfunc_type (build_pointer_type (type
));
7983 good
+= try_one_overload (tparms
, targs
, tempargs
, parm
,
7985 strict
, sub_strict
);
7989 my_friendly_abort (981006);
7991 /* [temp.deduct.type] A template-argument can be deduced from a pointer
7992 to function or pointer to member function argument if the set of
7993 overloaded functions does not contain function templates and at most
7994 one of a set of overloaded functions provides a unique match.
7996 So if we found multiple possibilities, we return success but don't
8001 int i
= TREE_VEC_LENGTH (targs
);
8003 if (TREE_VEC_ELT (tempargs
, i
))
8004 TREE_VEC_ELT (targs
, i
) = TREE_VEC_ELT (tempargs
, i
);
8012 /* Subroutine of resolve_overloaded_unification; does deduction for a single
8013 overload. Fills TARGS with any deduced arguments, or error_mark_node if
8014 different overloads deduce different arguments for a given parm.
8015 Returns 1 on success. */
8018 try_one_overload (tparms
, orig_targs
, targs
, parm
, arg
, strict
,
8020 tree tparms
, orig_targs
, targs
, parm
, arg
;
8021 unification_kind_t strict
;
8028 /* [temp.deduct.type] A template-argument can be deduced from a pointer
8029 to function or pointer to member function argument if the set of
8030 overloaded functions does not contain function templates and at most
8031 one of a set of overloaded functions provides a unique match.
8033 So if this is a template, just return success. */
8035 if (uses_template_parms (arg
))
8038 maybe_adjust_types_for_deduction (strict
, &parm
, &arg
);
8040 /* We don't copy orig_targs for this because if we have already deduced
8041 some template args from previous args, unify would complain when we
8042 try to deduce a template parameter for the same argument, even though
8043 there isn't really a conflict. */
8044 nargs
= TREE_VEC_LENGTH (targs
);
8045 tempargs
= make_tree_vec (nargs
);
8047 if (unify (tparms
, tempargs
, parm
, arg
, sub_strict
) != 0)
8050 /* First make sure we didn't deduce anything that conflicts with
8051 explicitly specified args. */
8052 for (i
= nargs
; i
--; )
8054 tree elt
= TREE_VEC_ELT (tempargs
, i
);
8055 tree oldelt
= TREE_VEC_ELT (orig_targs
, i
);
8057 if (elt
== NULL_TREE
)
8059 else if (uses_template_parms (elt
))
8061 /* Since we're unifying against ourselves, we will fill in template
8062 args used in the function parm list with our own template parms.
8064 TREE_VEC_ELT (tempargs
, i
) = NULL_TREE
;
8067 else if (oldelt
&& ! template_args_equal (oldelt
, elt
))
8071 for (i
= nargs
; i
--; )
8073 tree elt
= TREE_VEC_ELT (tempargs
, i
);
8076 TREE_VEC_ELT (targs
, i
) = elt
;
8082 /* Verify that nondeduce template argument agrees with the type
8083 obtained from argument deduction. Return nonzero if the
8088 struct A { typedef int X; };
8089 template <class T, class U> struct C {};
8090 template <class T> struct C<T, typename T::X> {};
8092 Then with the instantiation `C<A, int>', we can deduce that
8093 `T' is `A' but unify () does not check whether `typename T::X'
8094 is `int'. This function ensure that they agree.
8096 TARGS, PARMS are the same as the arguments of unify.
8097 ARGS contains template arguments from all levels. */
8100 verify_class_unification (targs
, parms
, args
)
8101 tree targs
, parms
, args
;
8104 int nparms
= TREE_VEC_LENGTH (parms
);
8105 tree new_parms
= tsubst (parms
, add_outermost_template_args (args
, targs
),
8106 /*complain=*/0, NULL_TREE
);
8107 if (new_parms
== error_mark_node
)
8110 args
= INNERMOST_TEMPLATE_ARGS (args
);
8112 for (i
= 0; i
< nparms
; i
++)
8114 tree parm
= TREE_VEC_ELT (new_parms
, i
);
8115 tree arg
= TREE_VEC_ELT (args
, i
);
8117 /* In case we are deducing from a function argument of a function
8118 templates, some parameters may not be deduced yet. So we
8119 make sure that only fully substituted elements of PARM are
8122 if (!uses_template_parms (parm
) && !template_args_equal (parm
, arg
))
8128 /* PARM is a template class (perhaps with unbound template
8129 parameters). ARG is a fully instantiated type. If ARG can be
8130 bound to PARM, return ARG, otherwise return NULL_TREE. TPARMS and
8131 TARGS are as for unify. */
8134 try_class_unification (tparms
, targs
, parm
, arg
)
8142 if (!CLASSTYPE_TEMPLATE_INFO (arg
)
8143 || CLASSTYPE_TI_TEMPLATE (arg
) != CLASSTYPE_TI_TEMPLATE (parm
))
8146 /* We need to make a new template argument vector for the call to
8147 unify. If we used TARGS, we'd clutter it up with the result of
8148 the attempted unification, even if this class didn't work out.
8149 We also don't want to commit ourselves to all the unifications
8150 we've already done, since unification is supposed to be done on
8151 an argument-by-argument basis. In other words, consider the
8152 following pathological case:
8154 template <int I, int J, int K>
8157 template <int I, int J>
8158 struct S<I, J, 2> : public S<I, I, I>, S<J, J, J> {};
8160 template <int I, int J, int K>
8161 void f(S<I, J, K>, S<I, I, I>);
8170 Now, by the time we consider the unification involving `s2', we
8171 already know that we must have `f<0, 0, 0>'. But, even though
8172 `S<0, 1, 2>' is derived from `S<0, 0, 0>', the code is not legal
8173 because there are two ways to unify base classes of S<0, 1, 2>
8174 with S<I, I, I>. If we kept the already deduced knowledge, we
8175 would reject the possibility I=1. */
8176 copy_of_targs
= make_tree_vec (TREE_VEC_LENGTH (targs
));
8178 /* If unification failed, we're done. */
8179 if (unify (tparms
, copy_of_targs
, CLASSTYPE_TI_ARGS (parm
),
8180 CLASSTYPE_TI_ARGS (arg
), UNIFY_ALLOW_NONE
))
8186 /* Subroutine of get_template_base. RVAL, if non-NULL, is a base we
8187 have already discovered to be satisfactory. ARG_BINFO is the binfo
8188 for the base class of ARG that we are currently examining. */
8191 get_template_base_recursive (tparms
, targs
, parm
,
8192 arg_binfo
, rval
, flags
)
8202 tree arg
= BINFO_TYPE (arg_binfo
);
8204 if (!(flags
& GTB_IGNORE_TYPE
))
8206 tree r
= try_class_unification (tparms
, targs
,
8209 /* If there is more than one satisfactory baseclass, then:
8213 If they yield more than one possible deduced A, the type
8217 if (r
&& rval
&& !same_type_p (r
, rval
))
8218 return error_mark_node
;
8223 binfos
= BINFO_BASETYPES (arg_binfo
);
8224 n_baselinks
= binfos
? TREE_VEC_LENGTH (binfos
) : 0;
8226 /* Process base types. */
8227 for (i
= 0; i
< n_baselinks
; i
++)
8229 tree base_binfo
= TREE_VEC_ELT (binfos
, i
);
8232 /* Skip this base, if we've already seen it. */
8233 if (BINFO_MARKED (base_binfo
))
8237 (flags
& GTB_VIA_VIRTUAL
) || TREE_VIA_VIRTUAL (base_binfo
);
8239 /* When searching for a non-virtual, we cannot mark virtually
8242 SET_BINFO_MARKED (base_binfo
);
8244 rval
= get_template_base_recursive (tparms
, targs
,
8248 GTB_VIA_VIRTUAL
* this_virtual
);
8250 /* If we discovered more than one matching base class, we can
8252 if (rval
== error_mark_node
)
8253 return error_mark_node
;
8259 /* Given a template type PARM and a class type ARG, find the unique
8260 base type in ARG that is an instance of PARM. We do not examine
8261 ARG itself; only its base-classes. If there is no appropriate base
8262 class, return NULL_TREE. If there is more than one, return
8263 error_mark_node. PARM may be the type of a partial specialization,
8264 as well as a plain template type. Used by unify. */
8267 get_template_base (tparms
, targs
, parm
, arg
)
8276 my_friendly_assert (IS_AGGR_TYPE_CODE (TREE_CODE (arg
)), 92);
8278 arg_binfo
= TYPE_BINFO (complete_type (arg
));
8279 rval
= get_template_base_recursive (tparms
, targs
,
8284 /* Since get_template_base_recursive marks the bases classes, we
8285 must unmark them here. */
8286 dfs_walk (arg_binfo
, dfs_unmark
, markedp
, 0);
8291 /* Returns the level of DECL, which declares a template parameter. */
8294 template_decl_level (decl
)
8297 switch (TREE_CODE (decl
))
8301 return TEMPLATE_TYPE_LEVEL (TREE_TYPE (decl
));
8304 return TEMPLATE_PARM_LEVEL (DECL_INITIAL (decl
));
8307 my_friendly_abort (0);
8312 /* Decide whether ARG can be unified with PARM, considering only the
8313 cv-qualifiers of each type, given STRICT as documented for unify.
8314 Returns non-zero iff the unification is OK on that basis.*/
8317 check_cv_quals_for_unify (strict
, arg
, parm
)
8322 if (!(strict
& UNIFY_ALLOW_MORE_CV_QUAL
)
8323 && !at_least_as_qualified_p (arg
, parm
))
8326 if (!(strict
& UNIFY_ALLOW_LESS_CV_QUAL
)
8327 && !at_least_as_qualified_p (parm
, arg
))
8333 /* Takes parameters as for type_unification. Returns 0 if the
8334 type deduction succeeds, 1 otherwise. The parameter STRICT is a
8335 bitwise or of the following flags:
8338 Require an exact match between PARM and ARG.
8339 UNIFY_ALLOW_MORE_CV_QUAL:
8340 Allow the deduced ARG to be more cv-qualified than ARG.
8341 UNIFY_ALLOW_LESS_CV_QUAL:
8342 Allow the deduced ARG to be less cv-qualified than ARG.
8343 UNIFY_ALLOW_DERIVED:
8344 Allow the deduced ARG to be a template base class of ARG,
8345 or a pointer to a template base class of the type pointed to by
8347 UNIFY_ALLOW_INTEGER:
8348 Allow any integral type to be deduced. See the TEMPLATE_PARM_INDEX
8349 case for more information. */
8352 unify (tparms
, targs
, parm
, arg
, strict
)
8353 tree tparms
, targs
, parm
, arg
;
8360 /* I don't think this will do the right thing with respect to types.
8361 But the only case I've seen it in so far has been array bounds, where
8362 signedness is the only information lost, and I think that will be
8364 while (TREE_CODE (parm
) == NOP_EXPR
)
8365 parm
= TREE_OPERAND (parm
, 0);
8367 if (arg
== error_mark_node
)
8369 if (arg
== unknown_type_node
)
8370 /* We can't deduce anything from this, but we might get all the
8371 template args from other function args. */
8374 /* If PARM uses template parameters, then we can't bail out here,
8375 even if ARG == PARM, since we won't record unifications for the
8376 template parameters. We might need them if we're trying to
8377 figure out which of two things is more specialized. */
8378 if (arg
== parm
&& !uses_template_parms (parm
))
8381 /* Immediately reject some pairs that won't unify because of
8382 cv-qualification mismatches. */
8383 if (TREE_CODE (arg
) == TREE_CODE (parm
)
8385 /* We check the cv-qualifiers when unifying with template type
8386 parameters below. We want to allow ARG `const T' to unify with
8387 PARM `T' for example, when computing which of two templates
8388 is more specialized, for example. */
8389 && TREE_CODE (arg
) != TEMPLATE_TYPE_PARM
8390 && !check_cv_quals_for_unify (strict
, arg
, parm
))
8393 switch (TREE_CODE (parm
))
8396 /* In a type which contains a nested-name-specifier, template
8397 argument values cannot be deduced for template parameters used
8398 within the nested-name-specifier. */
8401 case TEMPLATE_TYPE_PARM
:
8402 case TEMPLATE_TEMPLATE_PARM
:
8403 case BOUND_TEMPLATE_TEMPLATE_PARM
:
8404 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, 0));
8406 if (TEMPLATE_TYPE_LEVEL (parm
)
8407 != template_decl_level (tparm
))
8408 /* The PARM is not one we're trying to unify. Just check
8409 to see if it matches ARG. */
8410 return (TREE_CODE (arg
) == TREE_CODE (parm
)
8411 && same_type_p (parm
, arg
)) ? 0 : 1;
8412 idx
= TEMPLATE_TYPE_IDX (parm
);
8413 targ
= TREE_VEC_ELT (targs
, idx
);
8414 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, idx
));
8416 /* Check for mixed types and values. */
8417 if ((TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
8418 && TREE_CODE (tparm
) != TYPE_DECL
)
8419 || (TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
8420 && TREE_CODE (tparm
) != TEMPLATE_DECL
))
8423 if (TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
8425 /* ARG must be constructed from a template class or a template
8426 template parameter. */
8427 if (TREE_CODE (arg
) != BOUND_TEMPLATE_TEMPLATE_PARM
8428 && (TREE_CODE (arg
) != RECORD_TYPE
|| !CLASSTYPE_TEMPLATE_INFO (arg
)))
8432 tree parmtmpl
= TYPE_TI_TEMPLATE (parm
);
8433 tree parmvec
= TYPE_TI_ARGS (parm
);
8434 tree argvec
= TYPE_TI_ARGS (arg
);
8436 = DECL_INNERMOST_TEMPLATE_PARMS (TYPE_TI_TEMPLATE (arg
));
8439 /* The parameter and argument roles have to be switched here
8440 in order to handle default arguments properly. For example,
8441 template<template <class> class TT> void f(TT<int>)
8442 should be able to accept vector<int> which comes from
8443 template <class T, class Allocator = allocator>
8446 if (coerce_template_parms (argtmplvec
, parmvec
, parmtmpl
, 0, 1)
8450 /* Deduce arguments T, i from TT<T> or TT<i>.
8451 We check each element of PARMVEC and ARGVEC individually
8452 rather than the whole TREE_VEC since they can have
8453 different number of elements. */
8455 for (i
= 0; i
< TREE_VEC_LENGTH (parmvec
); ++i
)
8457 tree t
= TREE_VEC_ELT (parmvec
, i
);
8459 if (unify (tparms
, targs
, t
,
8460 TREE_VEC_ELT (argvec
, i
),
8465 arg
= TYPE_TI_TEMPLATE (arg
);
8467 /* Fall through to deduce template name. */
8470 if (TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
8471 || TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
8473 /* Deduce template name TT from TT, TT<>, TT<T> and TT<i>. */
8475 /* Simple cases: Value already set, does match or doesn't. */
8476 if (targ
!= NULL_TREE
&& template_args_equal (targ
, arg
))
8483 /* If PARM is `const T' and ARG is only `int', we don't have
8484 a match unless we are allowing additional qualification.
8485 If ARG is `const int' and PARM is just `T' that's OK;
8486 that binds `const int' to `T'. */
8487 if (!check_cv_quals_for_unify (strict
| UNIFY_ALLOW_LESS_CV_QUAL
,
8491 /* Consider the case where ARG is `const volatile int' and
8492 PARM is `const T'. Then, T should be `volatile int'. */
8494 cp_build_qualified_type_real (arg
,
8496 & ~CP_TYPE_QUALS (parm
),
8498 if (arg
== error_mark_node
)
8501 /* Simple cases: Value already set, does match or doesn't. */
8502 if (targ
!= NULL_TREE
&& same_type_p (targ
, arg
))
8508 /* Make sure that ARG is not a variable-sized array. (Note that
8509 were talking about variable-sized arrays (like `int[n]'),
8510 rather than arrays of unknown size (like `int[]').) We'll
8511 get very confused by such a type since the bound of the array
8512 will not be computable in an instantiation. Besides, such
8513 types are not allowed in ISO C++, so we can do as we please
8515 if (TREE_CODE (arg
) == ARRAY_TYPE
8516 && !uses_template_parms (arg
)
8517 && (TREE_CODE (TYPE_MAX_VALUE (TYPE_DOMAIN (arg
)))
8521 TREE_VEC_ELT (targs
, idx
) = arg
;
8524 case TEMPLATE_PARM_INDEX
:
8525 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, 0));
8527 if (TEMPLATE_PARM_LEVEL (parm
)
8528 != template_decl_level (tparm
))
8529 /* The PARM is not one we're trying to unify. Just check
8530 to see if it matches ARG. */
8531 return (TREE_CODE (arg
) == TREE_CODE (parm
)
8532 && cp_tree_equal (parm
, arg
) > 0) ? 0 : 1;
8534 idx
= TEMPLATE_PARM_IDX (parm
);
8535 targ
= TREE_VEC_ELT (targs
, idx
);
8539 int i
= (cp_tree_equal (targ
, arg
) > 0);
8545 my_friendly_abort (42);
8548 /* [temp.deduct.type] If, in the declaration of a function template
8549 with a non-type template-parameter, the non-type
8550 template-parameter is used in an expression in the function
8551 parameter-list and, if the corresponding template-argument is
8552 deduced, the template-argument type shall match the type of the
8553 template-parameter exactly, except that a template-argument
8554 deduced from an array bound may be of any integral type.
8555 The non-type parameter might use already deduced type parameters. */
8556 if (same_type_p (TREE_TYPE (arg
),
8557 tsubst (TREE_TYPE (parm
), targs
, 0, NULL_TREE
)))
8559 else if ((strict
& UNIFY_ALLOW_INTEGER
)
8560 && (TREE_CODE (TREE_TYPE (parm
)) == INTEGER_TYPE
8561 || TREE_CODE (TREE_TYPE (parm
)) == BOOLEAN_TYPE
))
8566 TREE_VEC_ELT (targs
, idx
) = arg
;
8573 if (TREE_CODE (arg
) != POINTER_TYPE
)
8576 /* [temp.deduct.call]
8578 A can be another pointer or pointer to member type that can
8579 be converted to the deduced A via a qualification
8580 conversion (_conv.qual_).
8582 We pass down STRICT here rather than UNIFY_ALLOW_NONE.
8583 This will allow for additional cv-qualification of the
8584 pointed-to types if appropriate. In general, this is a bit
8585 too generous; we are only supposed to allow qualification
8586 conversions and this method will allow an ARG of char** and
8587 a deduced ARG of const char**. However, overload
8588 resolution will subsequently invalidate the candidate, so
8589 this is probably OK. */
8590 sub_strict
= strict
;
8592 if (TREE_CODE (TREE_TYPE (arg
)) != RECORD_TYPE
)
8593 /* The derived-to-base conversion only persists through one
8594 level of pointers. */
8595 sub_strict
&= ~UNIFY_ALLOW_DERIVED
;
8597 return unify (tparms
, targs
, TREE_TYPE (parm
),
8598 TREE_TYPE (arg
), sub_strict
);
8601 case REFERENCE_TYPE
:
8602 if (TREE_CODE (arg
) != REFERENCE_TYPE
)
8604 return unify (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
8608 if (TREE_CODE (arg
) != ARRAY_TYPE
)
8610 if ((TYPE_DOMAIN (parm
) == NULL_TREE
)
8611 != (TYPE_DOMAIN (arg
) == NULL_TREE
))
8613 if (TYPE_DOMAIN (parm
) != NULL_TREE
8614 && unify (tparms
, targs
, TYPE_DOMAIN (parm
),
8615 TYPE_DOMAIN (arg
), UNIFY_ALLOW_NONE
) != 0)
8617 return unify (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
8626 if (TREE_CODE (arg
) != TREE_CODE (parm
))
8629 if (TREE_CODE (parm
) == INTEGER_TYPE
8630 && TREE_CODE (TYPE_MAX_VALUE (parm
)) != INTEGER_CST
)
8632 if (TYPE_MIN_VALUE (parm
) && TYPE_MIN_VALUE (arg
)
8633 && unify (tparms
, targs
, TYPE_MIN_VALUE (parm
),
8634 TYPE_MIN_VALUE (arg
), UNIFY_ALLOW_INTEGER
))
8636 if (TYPE_MAX_VALUE (parm
) && TYPE_MAX_VALUE (arg
)
8637 && unify (tparms
, targs
, TYPE_MAX_VALUE (parm
),
8638 TYPE_MAX_VALUE (arg
), UNIFY_ALLOW_INTEGER
))
8641 /* We have already checked cv-qualification at the top of the
8643 else if (!same_type_ignoring_top_level_qualifiers_p (arg
, parm
))
8646 /* As far as unification is concerned, this wins. Later checks
8647 will invalidate it if necessary. */
8650 /* Types INTEGER_CST and MINUS_EXPR can come from array bounds. */
8651 /* Type INTEGER_CST can come from ordinary constant template args. */
8653 while (TREE_CODE (arg
) == NOP_EXPR
)
8654 arg
= TREE_OPERAND (arg
, 0);
8656 if (TREE_CODE (arg
) != INTEGER_CST
)
8658 return !tree_int_cst_equal (parm
, arg
);
8663 if (TREE_CODE (arg
) != TREE_VEC
)
8665 if (TREE_VEC_LENGTH (parm
) != TREE_VEC_LENGTH (arg
))
8667 for (i
= 0; i
< TREE_VEC_LENGTH (parm
); ++i
)
8668 if (unify (tparms
, targs
,
8669 TREE_VEC_ELT (parm
, i
), TREE_VEC_ELT (arg
, i
),
8677 if (TREE_CODE (arg
) != TREE_CODE (parm
))
8680 if (TYPE_PTRMEMFUNC_P (parm
))
8682 if (!TYPE_PTRMEMFUNC_P (arg
))
8685 return unify (tparms
, targs
,
8686 TYPE_PTRMEMFUNC_FN_TYPE (parm
),
8687 TYPE_PTRMEMFUNC_FN_TYPE (arg
),
8691 if (CLASSTYPE_TEMPLATE_INFO (parm
))
8695 if (strict
& UNIFY_ALLOW_DERIVED
)
8697 /* First, we try to unify the PARM and ARG directly. */
8698 t
= try_class_unification (tparms
, targs
,
8703 /* Fallback to the special case allowed in
8706 If P is a class, and P has the form
8707 template-id, then A can be a derived class of
8708 the deduced A. Likewise, if P is a pointer to
8709 a class of the form template-id, A can be a
8710 pointer to a derived class pointed to by the
8712 t
= get_template_base (tparms
, targs
,
8715 if (! t
|| t
== error_mark_node
)
8719 else if (CLASSTYPE_TEMPLATE_INFO (arg
)
8720 && (CLASSTYPE_TI_TEMPLATE (parm
)
8721 == CLASSTYPE_TI_TEMPLATE (arg
)))
8722 /* Perhaps PARM is something like S<U> and ARG is S<int>.
8723 Then, we should unify `int' and `U'. */
8726 /* There's no chance of unification succeeding. */
8729 return unify (tparms
, targs
, CLASSTYPE_TI_ARGS (parm
),
8730 CLASSTYPE_TI_ARGS (t
), UNIFY_ALLOW_NONE
);
8732 else if (!same_type_ignoring_top_level_qualifiers_p (parm
, arg
))
8738 if (TREE_CODE (arg
) != TREE_CODE (parm
))
8741 if (unify (tparms
, targs
, TREE_TYPE (parm
),
8742 TREE_TYPE (arg
), UNIFY_ALLOW_NONE
))
8744 return type_unification_real (tparms
, targs
, TYPE_ARG_TYPES (parm
),
8745 TYPE_ARG_TYPES (arg
), 1,
8746 DEDUCE_EXACT
, 0, -1);
8749 if (TREE_CODE (arg
) != OFFSET_TYPE
)
8751 if (unify (tparms
, targs
, TYPE_OFFSET_BASETYPE (parm
),
8752 TYPE_OFFSET_BASETYPE (arg
), UNIFY_ALLOW_NONE
))
8754 return unify (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
8758 if (arg
!= decl_constant_value (parm
))
8763 /* Matched cases are handled by the ARG == PARM test above. */
8767 if (TREE_CODE (TREE_OPERAND (parm
, 1)) == INTEGER_CST
)
8769 /* We handle this case specially, since it comes up with
8770 arrays. In particular, something like:
8772 template <int N> void f(int (&x)[N]);
8774 Here, we are trying to unify the range type, which
8775 looks like [0 ... (N - 1)]. */
8777 t1
= TREE_OPERAND (parm
, 0);
8778 t2
= TREE_OPERAND (parm
, 1);
8780 t
= fold (build (PLUS_EXPR
, integer_type_node
, arg
, t2
));
8782 return unify (tparms
, targs
, t1
, t
, strict
);
8784 /* else fall through */
8787 if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (TREE_CODE (parm
))))
8790 /* We're looking at an expression. This can happen with
8794 void foo(S<I>, S<I + 2>);
8796 This is a "nondeduced context":
8800 The nondeduced contexts are:
8802 --A type that is a template-id in which one or more of
8803 the template-arguments is an expression that references
8804 a template-parameter.
8806 In these cases, we assume deduction succeeded, but don't
8807 actually infer any unifications. */
8809 if (!uses_template_parms (parm
)
8810 && !template_args_equal (parm
, arg
))
8816 sorry ("use of `%s' in template type unification",
8817 tree_code_name
[(int) TREE_CODE (parm
)]);
8823 /* Called if RESULT is explicitly instantiated, or is a member of an
8824 explicitly instantiated class, or if using -frepo and the
8825 instantiation of RESULT has been assigned to this file. */
8828 mark_decl_instantiated (result
, extern_p
)
8832 if (TREE_CODE (result
) != FUNCTION_DECL
)
8833 /* The TREE_PUBLIC flag for function declarations will have been
8834 set correctly by tsubst. */
8835 TREE_PUBLIC (result
) = 1;
8837 /* We used to set this unconditionally; we moved that to
8838 do_decl_instantiation so it wouldn't get set on members of
8839 explicit class template instantiations. But we still need to set
8840 it here for the 'extern template' case in order to suppress
8841 implicit instantiations. */
8843 SET_DECL_EXPLICIT_INSTANTIATION (result
);
8847 DECL_INTERFACE_KNOWN (result
) = 1;
8848 DECL_NOT_REALLY_EXTERN (result
) = 1;
8850 /* Always make artificials weak. */
8851 if (DECL_ARTIFICIAL (result
) && flag_weak
)
8852 comdat_linkage (result
);
8853 /* For WIN32 we also want to put explicit instantiations in
8854 linkonce sections. */
8855 else if (TREE_PUBLIC (result
))
8856 maybe_make_one_only (result
);
8858 else if (TREE_CODE (result
) == FUNCTION_DECL
)
8862 /* Given two function templates PAT1 and PAT2, return:
8864 1 if PAT1 is more specialized than PAT2 as described in [temp.func.order].
8865 -1 if PAT2 is more specialized than PAT1.
8866 0 if neither is more specialized.
8868 LEN is passed through to fn_type_unification. */
8871 more_specialized (pat1
, pat2
, len
)
8878 targs
= get_bindings_order (pat1
, DECL_TEMPLATE_RESULT (pat2
), len
);
8882 targs
= get_bindings_order (pat2
, DECL_TEMPLATE_RESULT (pat1
), len
);
8889 /* Given two class template specialization list nodes PAT1 and PAT2, return:
8891 1 if PAT1 is more specialized than PAT2 as described in [temp.class.order].
8892 -1 if PAT2 is more specialized than PAT1.
8893 0 if neither is more specialized. */
8896 more_specialized_class (pat1
, pat2
)
8902 targs
= get_class_bindings (TREE_VALUE (pat1
), TREE_PURPOSE (pat1
),
8903 TREE_PURPOSE (pat2
));
8907 targs
= get_class_bindings (TREE_VALUE (pat2
), TREE_PURPOSE (pat2
),
8908 TREE_PURPOSE (pat1
));
8915 /* Return the template arguments that will produce the function signature
8916 DECL from the function template FN, with the explicit template
8917 arguments EXPLICIT_ARGS. If CHECK_RETTYPE is 1, the return type must
8918 also match. Return NULL_TREE if no satisfactory arguments could be
8919 found. LEN is passed through to fn_type_unification. */
8922 get_bindings_real (fn
, decl
, explicit_args
, check_rettype
, len
)
8923 tree fn
, decl
, explicit_args
;
8924 int check_rettype
, len
;
8926 int ntparms
= DECL_NTPARMS (fn
);
8927 tree targs
= make_tree_vec (ntparms
);
8929 tree decl_arg_types
;
8932 /* Substitute the explicit template arguments into the type of DECL.
8933 The call to fn_type_unification will handle substitution into the
8935 decl_type
= TREE_TYPE (decl
);
8936 if (explicit_args
&& uses_template_parms (decl_type
))
8939 tree converted_args
;
8941 if (DECL_TEMPLATE_INFO (decl
))
8942 tmpl
= DECL_TI_TEMPLATE (decl
);
8944 /* We can get here for some illegal specializations. */
8948 = (coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (tmpl
),
8949 explicit_args
, NULL_TREE
,
8951 /*require_all_arguments=*/0));
8952 if (converted_args
== error_mark_node
)
8955 decl_type
= tsubst (decl_type
, converted_args
, /*complain=*/0,
8957 if (decl_type
== error_mark_node
)
8961 decl_arg_types
= TYPE_ARG_TYPES (decl_type
);
8962 /* Never do unification on the 'this' parameter. */
8963 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
8964 decl_arg_types
= TREE_CHAIN (decl_arg_types
);
8966 i
= fn_type_unification (fn
, explicit_args
, targs
,
8968 (check_rettype
|| DECL_CONV_FN_P (fn
)
8969 ? TREE_TYPE (decl_type
) : NULL_TREE
),
8978 /* For most uses, we want to check the return type. */
8981 get_bindings (fn
, decl
, explicit_args
)
8982 tree fn
, decl
, explicit_args
;
8984 return get_bindings_real (fn
, decl
, explicit_args
, 1, -1);
8987 /* But for resolve_overloaded_unification, we only care about the parameter
8991 get_bindings_overload (fn
, decl
, explicit_args
)
8992 tree fn
, decl
, explicit_args
;
8994 return get_bindings_real (fn
, decl
, explicit_args
, 0, -1);
8997 /* And for more_specialized, we want to be able to stop partway. */
9000 get_bindings_order (fn
, decl
, len
)
9004 return get_bindings_real (fn
, decl
, NULL_TREE
, 0, len
);
9007 /* Return the innermost template arguments that, when applied to a
9008 template specialization whose innermost template parameters are
9009 TPARMS, and whose specialization arguments are ARGS, yield the
9012 For example, suppose we have:
9014 template <class T, class U> struct S {};
9015 template <class T> struct S<T*, int> {};
9017 Then, suppose we want to get `S<double*, int>'. The TPARMS will be
9018 {T}, the PARMS will be {T*, int} and the ARGS will be {double*,
9019 int}. The resulting vector will be {double}, indicating that `T'
9020 is bound to `double'. */
9023 get_class_bindings (tparms
, parms
, args
)
9024 tree tparms
, parms
, args
;
9026 int i
, ntparms
= TREE_VEC_LENGTH (tparms
);
9027 tree vec
= make_tree_vec (ntparms
);
9029 if (unify (tparms
, vec
, parms
, INNERMOST_TEMPLATE_ARGS (args
),
9033 for (i
= 0; i
< ntparms
; ++i
)
9034 if (! TREE_VEC_ELT (vec
, i
))
9037 if (verify_class_unification (vec
, parms
, args
))
9043 /* In INSTANTIATIONS is a list of <INSTANTIATION, TEMPLATE> pairs.
9044 Pick the most specialized template, and return the corresponding
9045 instantiation, or if there is no corresponding instantiation, the
9046 template itself. If there is no most specialized template,
9047 error_mark_node is returned. If there are no templates at all,
9048 NULL_TREE is returned. */
9051 most_specialized_instantiation (instantiations
)
9052 tree instantiations
;
9057 if (!instantiations
)
9060 champ
= instantiations
;
9061 for (fn
= TREE_CHAIN (instantiations
); fn
; fn
= TREE_CHAIN (fn
))
9063 fate
= more_specialized (TREE_VALUE (champ
), TREE_VALUE (fn
), -1);
9070 fn
= TREE_CHAIN (fn
);
9072 return error_mark_node
;
9078 for (fn
= instantiations
; fn
&& fn
!= champ
; fn
= TREE_CHAIN (fn
))
9080 fate
= more_specialized (TREE_VALUE (champ
), TREE_VALUE (fn
), -1);
9082 return error_mark_node
;
9085 return TREE_PURPOSE (champ
) ? TREE_PURPOSE (champ
) : TREE_VALUE (champ
);
9088 /* Return the most specialized of the list of templates in FNS that can
9089 produce an instantiation matching DECL, given the explicit template
9090 arguments EXPLICIT_ARGS. */
9093 most_specialized (fns
, decl
, explicit_args
)
9094 tree fns
, decl
, explicit_args
;
9096 tree candidates
= NULL_TREE
;
9099 for (fn
= fns
; fn
; fn
= TREE_CHAIN (fn
))
9101 tree candidate
= TREE_VALUE (fn
);
9103 args
= get_bindings (candidate
, decl
, explicit_args
);
9105 candidates
= tree_cons (NULL_TREE
, candidate
, candidates
);
9108 return most_specialized_instantiation (candidates
);
9111 /* If DECL is a specialization of some template, return the most
9112 general such template. Otherwise, returns NULL_TREE.
9116 template <class T> struct S { template <class U> void f(U); };
9118 if TMPL is `template <class U> void S<int>::f(U)' this will return
9119 the full template. This function will not trace past partial
9120 specializations, however. For example, given in addition:
9122 template <class T> struct S<T*> { template <class U> void f(U); };
9124 if TMPL is `template <class U> void S<int*>::f(U)' this will return
9125 `template <class T> template <class U> S<T*>::f(U)'. */
9128 most_general_template (decl
)
9131 /* If DECL is a FUNCTION_DECL, find the TEMPLATE_DECL of which it is
9132 an immediate specialization. */
9133 if (TREE_CODE (decl
) == FUNCTION_DECL
)
9135 if (DECL_TEMPLATE_INFO (decl
)) {
9136 decl
= DECL_TI_TEMPLATE (decl
);
9138 /* The DECL_TI_TEMPLATE can be an IDENTIFIER_NODE for a
9140 if (TREE_CODE (decl
) != TEMPLATE_DECL
)
9146 /* Look for more and more general templates. */
9147 while (DECL_TEMPLATE_INFO (decl
))
9149 /* The DECL_TI_TEMPLATE can be a LOOKUP_EXPR or IDENTIFIER_NODE
9150 in some cases. (See cp-tree.h for details.) */
9151 if (TREE_CODE (DECL_TI_TEMPLATE (decl
)) != TEMPLATE_DECL
)
9154 /* Stop if we run into an explicitly specialized class template. */
9155 if (!DECL_NAMESPACE_SCOPE_P (decl
)
9156 && DECL_CONTEXT (decl
)
9157 && CLASSTYPE_TEMPLATE_SPECIALIZATION (DECL_CONTEXT (decl
)))
9160 decl
= DECL_TI_TEMPLATE (decl
);
9166 /* Return the most specialized of the class template specializations
9167 of TMPL which can produce an instantiation matching ARGS, or
9168 error_mark_node if the choice is ambiguous. */
9171 most_specialized_class (tmpl
, args
)
9175 tree list
= NULL_TREE
;
9180 tmpl
= most_general_template (tmpl
);
9181 for (t
= DECL_TEMPLATE_SPECIALIZATIONS (tmpl
); t
; t
= TREE_CHAIN (t
))
9184 = get_class_bindings (TREE_VALUE (t
), TREE_PURPOSE (t
), args
);
9187 list
= tree_cons (TREE_PURPOSE (t
), TREE_VALUE (t
), list
);
9188 TREE_TYPE (list
) = TREE_TYPE (t
);
9198 for (; t
; t
= TREE_CHAIN (t
))
9200 fate
= more_specialized_class (champ
, t
);
9209 return error_mark_node
;
9215 for (t
= list
; t
&& t
!= champ
; t
= TREE_CHAIN (t
))
9217 fate
= more_specialized_class (champ
, t
);
9219 return error_mark_node
;
9225 /* called from the parser. */
9228 do_decl_instantiation (declspecs
, declarator
, storage
)
9229 tree declspecs
, declarator
, storage
;
9231 tree decl
= grokdeclarator (declarator
, declspecs
, NORMAL
, 0, NULL_TREE
);
9232 tree result
= NULL_TREE
;
9236 /* An error occurred, for which grokdeclarator has already issued
9237 an appropriate message. */
9239 else if (! DECL_LANG_SPECIFIC (decl
))
9241 cp_error ("explicit instantiation of non-template `%#D'", decl
);
9244 else if (TREE_CODE (decl
) == VAR_DECL
)
9246 /* There is an asymmetry here in the way VAR_DECLs and
9247 FUNCTION_DECLs are handled by grokdeclarator. In the case of
9248 the latter, the DECL we get back will be marked as a
9249 template instantiation, and the appropriate
9250 DECL_TEMPLATE_INFO will be set up. This does not happen for
9251 VAR_DECLs so we do the lookup here. Probably, grokdeclarator
9252 should handle VAR_DECLs as it currently handles
9254 result
= lookup_field (DECL_CONTEXT (decl
), DECL_NAME (decl
), 0, 0);
9255 if (result
&& TREE_CODE (result
) != VAR_DECL
)
9257 cp_error ("no matching template for `%D' found", result
);
9261 else if (TREE_CODE (decl
) != FUNCTION_DECL
)
9263 cp_error ("explicit instantiation of `%#D'", decl
);
9269 /* Check for various error cases. Note that if the explicit
9270 instantiation is legal the RESULT will currently be marked as an
9271 *implicit* instantiation; DECL_EXPLICIT_INSTANTIATION is not set
9272 until we get here. */
9274 if (DECL_TEMPLATE_SPECIALIZATION (result
))
9278 No program shall both explicitly instantiate and explicitly
9279 specialize a template. */
9280 cp_pedwarn ("explicit instantiation of `%#D' after", result
);
9281 cp_pedwarn_at ("explicit specialization here", result
);
9284 else if (DECL_EXPLICIT_INSTANTIATION (result
))
9288 No program shall explicitly instantiate any template more
9291 We check DECL_INTERFACE_KNOWN so as not to complain when the first
9292 instantiation was `extern' and the second is not, and EXTERN_P for
9293 the opposite case. If -frepo, chances are we already got marked
9294 as an explicit instantiation because of the repo file. */
9295 if (DECL_INTERFACE_KNOWN (result
) && !extern_p
&& !flag_use_repository
)
9296 cp_pedwarn ("duplicate explicit instantiation of `%#D'", result
);
9298 /* If we've already instantiated the template, just return now. */
9299 if (DECL_INTERFACE_KNOWN (result
))
9302 else if (!DECL_IMPLICIT_INSTANTIATION (result
))
9304 cp_error ("no matching template for `%D' found", result
);
9307 else if (!DECL_TEMPLATE_INFO (result
))
9309 cp_pedwarn ("explicit instantiation of non-template `%#D'", result
);
9313 if (flag_external_templates
)
9316 if (storage
== NULL_TREE
)
9318 else if (storage
== ridpointers
[(int) RID_EXTERN
])
9321 cp_pedwarn ("ISO C++ forbids the use of `extern' on explicit instantiations");
9325 cp_error ("storage class `%D' applied to template instantiation",
9328 SET_DECL_EXPLICIT_INSTANTIATION (result
);
9329 mark_decl_instantiated (result
, extern_p
);
9330 repo_template_instantiated (result
, extern_p
);
9332 instantiate_decl (result
, /*defer_ok=*/1);
9336 mark_class_instantiated (t
, extern_p
)
9340 SET_CLASSTYPE_EXPLICIT_INSTANTIATION (t
);
9341 SET_CLASSTYPE_INTERFACE_KNOWN (t
);
9342 CLASSTYPE_INTERFACE_ONLY (t
) = extern_p
;
9343 CLASSTYPE_VTABLE_NEEDS_WRITING (t
) = ! extern_p
;
9344 TYPE_DECL_SUPPRESS_DEBUG (TYPE_NAME (t
)) = extern_p
;
9347 CLASSTYPE_DEBUG_REQUESTED (t
) = 1;
9348 rest_of_type_compilation (t
, 1);
9352 /* Perform an explicit instantiation of template class T. STORAGE, if
9353 non-null, is the RID for extern, inline or static. COMPLAIN is
9354 non-zero if this is called from the parser, zero if called recursively,
9355 since the standard is unclear (as detailed below). */
9358 do_type_instantiation (t
, storage
, complain
)
9366 if (TREE_CODE (t
) == TYPE_DECL
)
9369 if (! CLASS_TYPE_P (t
) || ! CLASSTYPE_TEMPLATE_INFO (t
))
9371 cp_error ("explicit instantiation of non-template type `%T'", t
);
9377 /* With -fexternal-templates, explicit instantiations are treated the same
9378 as implicit ones. */
9379 if (flag_external_templates
)
9382 if (!COMPLETE_TYPE_P (t
))
9385 cp_error ("explicit instantiation of `%#T' before definition of template",
9390 if (storage
!= NULL_TREE
)
9393 cp_pedwarn("ISO C++ forbids the use of `%s' on explicit instantiations",
9394 IDENTIFIER_POINTER (storage
));
9396 if (storage
== ridpointers
[(int) RID_INLINE
])
9398 else if (storage
== ridpointers
[(int) RID_EXTERN
])
9400 else if (storage
== ridpointers
[(int) RID_STATIC
])
9404 cp_error ("storage class `%D' applied to template instantiation",
9410 if (CLASSTYPE_TEMPLATE_SPECIALIZATION (t
))
9414 No program shall both explicitly instantiate and explicitly
9415 specialize a template. */
9418 cp_error ("explicit instantiation of `%#T' after", t
);
9419 cp_error_at ("explicit specialization here", t
);
9423 else if (CLASSTYPE_EXPLICIT_INSTANTIATION (t
))
9427 No program shall explicitly instantiate any template more
9430 If CLASSTYPE_INTERFACE_ONLY, then the first explicit instantiation
9431 was `extern'. If EXTERN_P then the second is. If -frepo, chances
9432 are we already got marked as an explicit instantion because of the
9433 repo file. All these cases are OK. */
9434 if (!CLASSTYPE_INTERFACE_ONLY (t
) && !extern_p
&& !flag_use_repository
9436 cp_pedwarn ("duplicate explicit instantiation of `%#T'", t
);
9438 /* If we've already instantiated the template, just return now. */
9439 if (!CLASSTYPE_INTERFACE_ONLY (t
))
9443 mark_class_instantiated (t
, extern_p
);
9444 repo_template_instantiated (t
, extern_p
);
9452 /* In contrast to implicit instantiation, where only the
9453 declarations, and not the definitions, of members are
9454 instantiated, we have here:
9458 The explicit instantiation of a class template specialization
9459 implies the instantiation of all of its members not
9460 previously explicitly specialized in the translation unit
9461 containing the explicit instantiation.
9463 Of course, we can't instantiate member template classes, since
9464 we don't have any arguments for them. Note that the standard
9465 is unclear on whether the instantiation of the members are
9466 *explicit* instantiations or not. We choose to be generous,
9467 and not set DECL_EXPLICIT_INSTANTIATION. Therefore, we allow
9468 the explicit instantiation of a class where some of the members
9469 have no definition in the current translation unit. */
9472 for (tmp
= TYPE_METHODS (t
); tmp
; tmp
= TREE_CHAIN (tmp
))
9473 if (TREE_CODE (tmp
) == FUNCTION_DECL
9474 && DECL_TEMPLATE_INSTANTIATION (tmp
))
9476 mark_decl_instantiated (tmp
, extern_p
);
9477 repo_template_instantiated (tmp
, extern_p
);
9479 instantiate_decl (tmp
, /*defer_ok=*/1);
9482 for (tmp
= TYPE_FIELDS (t
); tmp
; tmp
= TREE_CHAIN (tmp
))
9483 if (TREE_CODE (tmp
) == VAR_DECL
&& DECL_TEMPLATE_INSTANTIATION (tmp
))
9485 mark_decl_instantiated (tmp
, extern_p
);
9486 repo_template_instantiated (tmp
, extern_p
);
9488 instantiate_decl (tmp
, /*defer_ok=*/1);
9491 for (tmp
= CLASSTYPE_TAGS (t
); tmp
; tmp
= TREE_CHAIN (tmp
))
9492 if (IS_AGGR_TYPE (TREE_VALUE (tmp
))
9493 && !uses_template_parms (CLASSTYPE_TI_ARGS (TREE_VALUE (tmp
))))
9494 do_type_instantiation (TYPE_MAIN_DECL (TREE_VALUE (tmp
)), storage
, 0);
9498 /* Given a function DECL, which is a specialization of TMPL, modify
9499 DECL to be a re-instantiation of TMPL with the same template
9500 arguments. TMPL should be the template into which tsubst'ing
9501 should occur for DECL, not the most general template.
9503 One reason for doing this is a scenario like this:
9506 void f(const T&, int i);
9508 void g() { f(3, 7); }
9511 void f(const T& t, const int i) { }
9513 Note that when the template is first instantiated, with
9514 instantiate_template, the resulting DECL will have no name for the
9515 first parameter, and the wrong type for the second. So, when we go
9516 to instantiate the DECL, we regenerate it. */
9519 regenerate_decl_from_template (decl
, tmpl
)
9523 /* The most general version of TMPL. */
9525 /* The arguments used to instantiate DECL, from the most general
9532 args
= DECL_TI_ARGS (decl
);
9533 code_pattern
= DECL_TEMPLATE_RESULT (tmpl
);
9535 /* Unregister the specialization so that when we tsubst we will not
9536 just return DECL. We don't have to unregister DECL from TMPL
9537 because if would only be registered there if it were a partial
9538 instantiation of a specialization, which it isn't: it's a full
9540 gen_tmpl
= most_general_template (tmpl
);
9541 unregistered
= unregister_specialization (decl
, gen_tmpl
);
9543 /* If the DECL was not unregistered then something peculiar is
9544 happening: we created a specialization but did not call
9545 register_specialization for it. */
9546 my_friendly_assert (unregistered
, 0);
9548 if (TREE_CODE (decl
) == VAR_DECL
)
9549 /* Make sure that we can see identifiers, and compute access
9550 correctly, for the class members used in the declaration of
9551 this static variable. */
9552 pushclass (DECL_CONTEXT (decl
), 2);
9554 /* Do the substitution to get the new declaration. */
9555 new_decl
= tsubst (code_pattern
, args
, /*complain=*/1, NULL_TREE
);
9557 if (TREE_CODE (decl
) == VAR_DECL
)
9559 /* Set up DECL_INITIAL, since tsubst doesn't. */
9560 DECL_INITIAL (new_decl
) =
9561 tsubst_expr (DECL_INITIAL (code_pattern
), args
,
9562 /*complain=*/1, DECL_TI_TEMPLATE (decl
));
9563 /* Pop the class context we pushed above. */
9566 else if (TREE_CODE (decl
) == FUNCTION_DECL
)
9568 /* Convince duplicate_decls to use the DECL_ARGUMENTS from the
9570 DECL_INITIAL (new_decl
) = error_mark_node
;
9571 /* And don't complain about a duplicate definition. */
9572 DECL_INITIAL (decl
) = NULL_TREE
;
9575 /* The immediate parent of the new template is still whatever it was
9576 before, even though tsubst sets DECL_TI_TEMPLATE up as the most
9577 general template. We also reset the DECL_ASSEMBLER_NAME since
9578 tsubst always calculates the name as if the function in question
9579 were really a template instance, and sometimes, with friend
9580 functions, this is not so. See tsubst_friend_function for
9582 DECL_TI_TEMPLATE (new_decl
) = DECL_TI_TEMPLATE (decl
);
9583 DECL_ASSEMBLER_NAME (new_decl
) = DECL_ASSEMBLER_NAME (decl
);
9584 DECL_RTL (new_decl
) = DECL_RTL (decl
);
9585 DECL_USE_TEMPLATE (new_decl
) = DECL_USE_TEMPLATE (decl
);
9587 /* Call duplicate decls to merge the old and new declarations. */
9588 duplicate_decls (new_decl
, decl
);
9590 /* Now, re-register the specialization. */
9591 register_specialization (decl
, gen_tmpl
, args
);
9594 /* Produce the definition of D, a _DECL generated from a template. If
9595 DEFER_OK is non-zero, then we don't have to actually do the
9596 instantiation now; we just have to do it sometime. */
9599 instantiate_decl (d
, defer_ok
)
9603 tree tmpl
= DECL_TI_TEMPLATE (d
);
9604 tree args
= DECL_TI_ARGS (d
);
9609 int pattern_defined
;
9612 const char *file
= input_filename
;
9614 /* This function should only be used to instantiate templates for
9615 functions and static member variables. */
9616 my_friendly_assert (TREE_CODE (d
) == FUNCTION_DECL
9617 || TREE_CODE (d
) == VAR_DECL
, 0);
9619 /* Don't instantiate cloned functions. Instead, instantiate the
9620 functions they cloned. */
9621 if (TREE_CODE (d
) == FUNCTION_DECL
&& DECL_CLONED_FUNCTION_P (d
))
9622 d
= DECL_CLONED_FUNCTION (d
);
9624 if (DECL_TEMPLATE_INSTANTIATED (d
))
9625 /* D has already been instantiated. It might seem reasonable to
9626 check whether or not D is an explicit instantiation, and, if so,
9627 stop here. But when an explicit instantiation is deferred
9628 until the end of the compilation, DECL_EXPLICIT_INSTANTIATION
9629 is set, even though we still need to do the instantiation. */
9632 /* If we already have a specialization of this declaration, then
9633 there's no reason to instantiate it. Note that
9634 retrieve_specialization gives us both instantiations and
9635 specializations, so we must explicitly check
9636 DECL_TEMPLATE_SPECIALIZATION. */
9637 gen_tmpl
= most_general_template (tmpl
);
9638 spec
= retrieve_specialization (gen_tmpl
, args
);
9639 if (spec
!= NULL_TREE
&& DECL_TEMPLATE_SPECIALIZATION (spec
))
9642 /* This needs to happen before any tsubsting. */
9643 if (! push_tinst_level (d
))
9646 timevar_push (TV_PARSE
);
9648 /* Set TD to the template whose DECL_TEMPLATE_RESULT is the pattern
9649 for the instantiation. This is not always the most general
9650 template. Consider, for example:
9653 struct S { template <class U> void f();
9654 template <> void f<int>(); };
9656 and an instantiation of S<double>::f<int>. We want TD to be the
9657 specialization S<T>::f<int>, not the more general S<T>::f<U>. */
9659 while (/* An instantiation cannot have a definition, so we need a
9660 more general template. */
9661 DECL_TEMPLATE_INSTANTIATION (td
)
9662 /* We must also deal with friend templates. Given:
9664 template <class T> struct S {
9665 template <class U> friend void f() {};
9668 S<int>::f<U> say, is not an instantiation of S<T>::f<U>,
9669 so far as the language is concerned, but that's still
9670 where we get the pattern for the instantiation from. On
9671 other hand, if the definition comes outside the class, say:
9673 template <class T> struct S {
9674 template <class U> friend void f();
9676 template <class U> friend void f() {}
9678 we don't need to look any further. That's what the check for
9679 DECL_INITIAL is for. */
9680 || (TREE_CODE (d
) == FUNCTION_DECL
9681 && DECL_FRIEND_PSEUDO_TEMPLATE_INSTANTIATION (td
)
9682 && !DECL_INITIAL (DECL_TEMPLATE_RESULT (td
))))
9684 /* The present template, TD, should not be a definition. If it
9685 were a definition, we should be using it! Note that we
9686 cannot restructure the loop to just keep going until we find
9687 a template with a definition, since that might go too far if
9688 a specialization was declared, but not defined. */
9689 my_friendly_assert (!(TREE_CODE (d
) == VAR_DECL
9690 && !DECL_IN_AGGR_P (DECL_TEMPLATE_RESULT (td
))),
9693 /* Fetch the more general template. */
9694 td
= DECL_TI_TEMPLATE (td
);
9697 code_pattern
= DECL_TEMPLATE_RESULT (td
);
9699 if (TREE_CODE (d
) == FUNCTION_DECL
)
9700 pattern_defined
= (DECL_SAVED_TREE (code_pattern
) != NULL_TREE
);
9702 pattern_defined
= ! DECL_IN_AGGR_P (code_pattern
);
9704 lineno
= DECL_SOURCE_LINE (d
);
9705 input_filename
= DECL_SOURCE_FILE (d
);
9707 if (pattern_defined
)
9709 repo_template_used (d
);
9711 if (flag_external_templates
&& ! DECL_INTERFACE_KNOWN (d
))
9713 if (flag_alt_external_templates
)
9715 if (interface_unknown
)
9716 warn_if_unknown_interface (d
);
9718 else if (DECL_INTERFACE_KNOWN (code_pattern
))
9720 DECL_INTERFACE_KNOWN (d
) = 1;
9721 DECL_NOT_REALLY_EXTERN (d
) = ! DECL_EXTERNAL (code_pattern
);
9724 warn_if_unknown_interface (code_pattern
);
9728 import_export_decl (d
);
9731 /* We need to set up DECL_INITIAL regardless of pattern_defined if
9732 the variable is a static const initialized in the class body. */
9733 if (TREE_CODE (d
) == VAR_DECL
9734 && TREE_READONLY (d
)
9735 && DECL_INITIAL (d
) == NULL_TREE
9736 && DECL_INITIAL (code_pattern
) != NULL_TREE
)
9738 /* Reject all external templates except inline functions. */
9739 else if (DECL_INTERFACE_KNOWN (d
)
9740 && ! DECL_NOT_REALLY_EXTERN (d
)
9741 && ! (TREE_CODE (d
) == FUNCTION_DECL
&& DECL_INLINE (d
)))
9743 /* Defer all other templates, unless we have been explicitly
9744 forbidden from doing so. We restore the source position here
9745 because it's used by add_pending_template. */
9746 else if (! pattern_defined
|| defer_ok
)
9749 input_filename
= file
;
9751 if (at_eof
&& !pattern_defined
9752 && DECL_EXPLICIT_INSTANTIATION (d
))
9755 The definition of a non-exported function template, a
9756 non-exported member function template, or a non-exported
9757 member function or static data member of a class template
9758 shall be present in every translation unit in which it is
9759 explicitly instantiated. */
9760 cp_error ("explicit instantiation of `%D' but no definition available",
9763 add_pending_template (d
);
9767 need_push
= !global_bindings_p ();
9769 push_to_top_level ();
9771 /* We're now committed to instantiating this template. Mark it as
9772 instantiated so that recursive calls to instantiate_decl do not
9773 try to instantiate it again. */
9774 DECL_TEMPLATE_INSTANTIATED (d
) = 1;
9776 /* Regenerate the declaration in case the template has been modified
9777 by a subsequent redeclaration. */
9778 regenerate_decl_from_template (d
, td
);
9780 /* We already set the file and line above. Reset them now in case
9781 they changed as a result of calling regenerate_decl_from_template. */
9782 lineno
= DECL_SOURCE_LINE (d
);
9783 input_filename
= DECL_SOURCE_FILE (d
);
9785 if (TREE_CODE (d
) == VAR_DECL
)
9787 DECL_IN_AGGR_P (d
) = 0;
9788 if (DECL_INTERFACE_KNOWN (d
))
9789 DECL_EXTERNAL (d
) = ! DECL_NOT_REALLY_EXTERN (d
);
9792 DECL_EXTERNAL (d
) = 1;
9793 DECL_NOT_REALLY_EXTERN (d
) = 1;
9795 cp_finish_decl (d
, DECL_INITIAL (d
), NULL_TREE
, 0);
9797 else if (TREE_CODE (d
) == FUNCTION_DECL
)
9799 htab_t saved_local_specializations
;
9801 /* Save away the current list, in case we are instantiating one
9802 template from within the body of another. */
9803 saved_local_specializations
= local_specializations
;
9805 /* Set up the list of local specializations. */
9806 local_specializations
= htab_create (37,
9811 /* Set up context. */
9812 start_function (NULL_TREE
, d
, NULL_TREE
, SF_PRE_PARSED
);
9814 /* We already set up __FUNCTION__, etc., so we don't want to do
9816 function_name_declared_p
= 1;
9818 /* Substitute into the body of the function. */
9819 tsubst_expr (DECL_SAVED_TREE (code_pattern
), args
,
9820 /*complain=*/1, tmpl
);
9822 /* We don't need the local specializations any more. */
9823 htab_delete (local_specializations
);
9824 local_specializations
= saved_local_specializations
;
9826 /* Finish the function. */
9827 expand_body (finish_function (0));
9830 /* We're not deferring instantiation any more. */
9831 TI_PENDING_TEMPLATE_FLAG (DECL_TEMPLATE_INFO (d
)) = 0;
9834 pop_from_top_level ();
9838 input_filename
= file
;
9842 timevar_pop (TV_PARSE
);
9847 /* Run through the list of templates that we wish we could
9848 instantiate, and instantiate any we can. */
9851 instantiate_pending_templates ()
9854 int instantiated_something
= 0;
9861 t
= &pending_templates
;
9864 tree instantiation
= TREE_VALUE (*t
);
9866 reopen_tinst_level (TREE_PURPOSE (*t
));
9868 if (TYPE_P (instantiation
))
9872 if (!COMPLETE_TYPE_P (instantiation
))
9874 instantiate_class_template (instantiation
);
9875 if (CLASSTYPE_TEMPLATE_INSTANTIATION (instantiation
))
9876 for (fn
= TYPE_METHODS (instantiation
);
9878 fn
= TREE_CHAIN (fn
))
9879 if (! DECL_ARTIFICIAL (fn
))
9880 instantiate_decl (fn
, /*defer_ok=*/0);
9881 if (COMPLETE_TYPE_P (instantiation
))
9883 instantiated_something
= 1;
9888 if (COMPLETE_TYPE_P (instantiation
))
9889 /* If INSTANTIATION has been instantiated, then we don't
9890 need to consider it again in the future. */
9891 *t
= TREE_CHAIN (*t
);
9893 t
= &TREE_CHAIN (*t
);
9897 if (!DECL_TEMPLATE_SPECIALIZATION (instantiation
)
9898 && !DECL_TEMPLATE_INSTANTIATED (instantiation
))
9900 instantiation
= instantiate_decl (instantiation
,
9902 if (DECL_TEMPLATE_INSTANTIATED (instantiation
))
9904 instantiated_something
= 1;
9909 if (DECL_TEMPLATE_SPECIALIZATION (instantiation
)
9910 || DECL_TEMPLATE_INSTANTIATED (instantiation
))
9911 /* If INSTANTIATION has been instantiated, then we don't
9912 need to consider it again in the future. */
9913 *t
= TREE_CHAIN (*t
);
9915 t
= &TREE_CHAIN (*t
);
9918 current_tinst_level
= NULL_TREE
;
9922 /* Go through the things that are template instantiations if we are
9923 using guiding declarations. */
9924 t
= &maybe_templates
;
9931 fn
= TREE_VALUE (*t
);
9933 if (DECL_INITIAL (fn
))
9934 /* If the FN is already defined, then it was either already
9935 instantiated or, even though guiding declarations were
9936 allowed, a non-template definition was provided. */
9940 template = TREE_PURPOSE (*t
);
9941 args
= get_bindings (template, fn
, NULL_TREE
);
9942 fn
= instantiate_template (template, args
);
9943 instantiate_decl (fn
, /*defer_ok=*/0);
9947 /* Remove this entry from the chain. */
9948 *t
= TREE_CHAIN (*t
);
9950 maybe_template_tail
= t
;
9954 return instantiated_something
;
9957 /* Substitute ARGVEC into T, which is a list of initializers for
9958 either base class or a non-static data member. The TREE_PURPOSEs
9959 are DECLs, and the TREE_VALUEs are the initializer values. Used by
9960 instantiate_decl. */
9963 tsubst_initializer_list (t
, argvec
)
9966 tree first
= NULL_TREE
;
9969 for (; t
; t
= TREE_CHAIN (t
))
9975 decl
= tsubst_copy (TREE_PURPOSE (t
), argvec
, /*complain=*/1,
9977 init
= tsubst_expr (TREE_VALUE (t
), argvec
, /*complain=*/1,
9982 else if (TREE_CODE (init
) == TREE_LIST
)
9983 for (val
= init
; val
; val
= TREE_CHAIN (val
))
9984 TREE_VALUE (val
) = convert_from_reference (TREE_VALUE (val
));
9986 init
= convert_from_reference (init
);
9988 *p
= build_tree_list (decl
, init
);
9989 p
= &TREE_CHAIN (*p
);
9994 /* Set CURRENT_ACCESS_SPECIFIER based on the protection of DECL. */
9997 set_current_access_from_decl (decl
)
10000 if (TREE_PRIVATE (decl
))
10001 current_access_specifier
= access_private_node
;
10002 else if (TREE_PROTECTED (decl
))
10003 current_access_specifier
= access_protected_node
;
10005 current_access_specifier
= access_public_node
;
10008 /* Instantiate an enumerated type. TAG is the template type, NEWTAG
10009 is the instantiation (which should have been created with
10010 start_enum) and ARGS are the template arguments to use. */
10013 tsubst_enum (tag
, newtag
, args
)
10020 for (e
= TYPE_VALUES (tag
); e
; e
= TREE_CHAIN (e
))
10024 /* Note that in a template enum, the TREE_VALUE is the
10025 CONST_DECL, not the corresponding INTEGER_CST. */
10026 value
= tsubst_expr (DECL_INITIAL (TREE_VALUE (e
)),
10027 args
, /*complain=*/1,
10030 /* Give this enumeration constant the correct access. */
10031 set_current_access_from_decl (TREE_VALUE (e
));
10033 /* Actually build the enumerator itself. */
10034 build_enumerator (TREE_PURPOSE (e
), value
, newtag
);
10037 finish_enum (newtag
);
10038 DECL_SOURCE_LINE (TYPE_NAME (newtag
)) = DECL_SOURCE_LINE (TYPE_NAME (tag
));
10039 DECL_SOURCE_FILE (TYPE_NAME (newtag
)) = DECL_SOURCE_FILE (TYPE_NAME (tag
));
10042 /* DECL is a FUNCTION_DECL that is a template specialization. Return
10043 its type -- but without substituting the innermost set of template
10044 arguments. So, innermost set of template parameters will appear in
10045 the type. If CONTEXTP is non-NULL, then the partially substituted
10046 DECL_CONTEXT (if any) will also be filled in. Similarly, TPARMSP
10047 will be filled in with the substituted template parameters, if it
10051 get_mostly_instantiated_function_type (decl
, contextp
, tparmsp
)
10056 tree context
= NULL_TREE
;
10063 tmpl
= most_general_template (DECL_TI_TEMPLATE (decl
));
10064 targs
= DECL_TI_ARGS (decl
);
10065 tparms
= DECL_TEMPLATE_PARMS (tmpl
);
10066 parm_depth
= TMPL_PARMS_DEPTH (tparms
);
10068 /* There should be as many levels of arguments as there are levels
10070 my_friendly_assert (parm_depth
== TMPL_ARGS_DEPTH (targs
), 0);
10072 fn_type
= TREE_TYPE (tmpl
);
10073 if (DECL_STATIC_FUNCTION_P (decl
))
10074 context
= DECL_CONTEXT (decl
);
10076 if (parm_depth
== 1)
10077 /* No substitution is necessary. */
10084 /* Replace the innermost level of the TARGS with NULL_TREEs to
10085 let tsubst know not to substitute for those parameters. */
10086 partial_args
= make_tree_vec (TREE_VEC_LENGTH (targs
));
10087 for (i
= 1; i
< TMPL_ARGS_DEPTH (targs
); ++i
)
10088 SET_TMPL_ARGS_LEVEL (partial_args
, i
,
10089 TMPL_ARGS_LEVEL (targs
, i
));
10090 SET_TMPL_ARGS_LEVEL (partial_args
,
10091 TMPL_ARGS_DEPTH (targs
),
10092 make_tree_vec (DECL_NTPARMS (tmpl
)));
10094 /* Now, do the (partial) substitution to figure out the
10095 appropriate function type. */
10096 fn_type
= tsubst (fn_type
, partial_args
, /*complain=*/1, NULL_TREE
);
10097 if (DECL_STATIC_FUNCTION_P (decl
))
10098 context
= tsubst (context
, partial_args
, /*complain=*/1, NULL_TREE
);
10100 /* Substitute into the template parameters to obtain the real
10101 innermost set of parameters. This step is important if the
10102 innermost set of template parameters contains value
10103 parameters whose types depend on outer template parameters. */
10104 TREE_VEC_LENGTH (partial_args
)--;
10105 tparms
= tsubst_template_parms (tparms
, partial_args
, /*complain=*/1);
10109 *contextp
= context
;
10116 /* Set the DECL_ASSEMBLER_NAME for DECL, which is a FUNCTION_DECL that
10117 is either an instantiation or specialization of a template
10121 set_mangled_name_for_template_decl (decl
)
10124 tree context
= NULL_TREE
;
10131 my_friendly_assert (TREE_CODE (decl
) == FUNCTION_DECL
, 0);
10132 my_friendly_assert (DECL_TEMPLATE_INFO (decl
) != NULL_TREE
, 0);
10134 /* Under the new ABI, we don't need special machinery. */
10137 set_mangled_name_for_decl (decl
);
10141 /* The names of template functions must be mangled so as to indicate
10142 what template is being specialized with what template arguments.
10143 For example, each of the following three functions must get
10144 different mangled names:
10147 template <> void f<7>(int);
10148 template <> void f<8>(int); */
10150 targs
= DECL_TI_ARGS (decl
);
10151 if (uses_template_parms (targs
))
10152 /* This DECL is for a partial instantiation. There's no need to
10153 mangle the name of such an entity. */
10156 /* We now compute the PARMS and RET_TYPE to give to
10157 build_decl_overload_real. The PARMS and RET_TYPE are the
10158 parameter and return types of the template, after all but the
10159 innermost template arguments have been substituted, not the
10160 parameter and return types of the function DECL. For example,
10163 template <class T> T f(T);
10165 both PARMS and RET_TYPE should be `T' even if DECL is `int f(int)'.
10166 A more subtle example is:
10168 template <class T> struct S { template <class U> void f(T, U); }
10170 Here, if DECL is `void S<int>::f(int, double)', PARMS should be
10171 {int, U}. Thus, the args that we want to subsitute into the
10172 return and parameter type for the function are those in TARGS,
10173 with the innermost level omitted. */
10174 fn_type
= get_mostly_instantiated_function_type (decl
, &context
, &tparms
);
10176 /* Now, get the innermost parameters and arguments, and figure out
10177 the parameter and return types. */
10178 tparms
= INNERMOST_TEMPLATE_PARMS (tparms
);
10179 targs
= INNERMOST_TEMPLATE_ARGS (targs
);
10180 ret_type
= TREE_TYPE (fn_type
);
10181 parm_types
= TYPE_ARG_TYPES (fn_type
);
10183 /* For a static member function, we generate a fake `this' pointer,
10184 for the purposes of mangling. This indicates of which class the
10185 function is a member. Because of:
10189 There shall not be a static and a nonstatic member function
10190 with the same name and the same parameter types
10192 we don't have to worry that this will result in a clash with a
10193 non-static member function. */
10194 if (DECL_STATIC_FUNCTION_P (decl
))
10195 parm_types
= hash_tree_chain (build_pointer_type (context
), parm_types
);
10197 /* There should be the same number of template parameters as
10198 template arguments. */
10199 my_friendly_assert (TREE_VEC_LENGTH (tparms
) == TREE_VEC_LENGTH (targs
),
10202 /* Actually set the DECL_ASSEMBLER_NAME. */
10203 DECL_ASSEMBLER_NAME (decl
)
10204 = build_decl_overload_real (decl
, parm_types
, ret_type
,
10206 DECL_FUNCTION_MEMBER_P (decl
)
10207 + DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (decl
));
10210 /* Return truthvalue if we're processing a template different from
10211 the last one involved in diagnostics. */
10213 problematic_instantiation_changed ()
10215 return last_template_error_tick
!= tinst_level_tick
;
10218 /* Remember current template involved in diagnostics. */
10220 record_last_problematic_instantiation ()
10222 last_template_error_tick
= tinst_level_tick
;
10226 current_instantiation ()
10228 return current_tinst_level
;