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 (build_int_2 (0, 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 (build_int_2 (0, 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
;
4200 /* Check the return type. */
4201 if (for_each_template_parm (TREE_TYPE (t
), fn
, data
))
4202 return error_mark_node
;
4204 /* Check the parameter types. Since default arguments are not
4205 instantiated until they are needed, the TYPE_ARG_TYPES may
4206 contain expressions that involve template parameters. But,
4207 no-one should be looking at them yet. And, once they're
4208 instantiated, they don't contain template parameters, so
4209 there's no point in looking at them then, either. */
4213 for (parm
= TYPE_ARG_TYPES (t
); parm
; parm
= TREE_CHAIN (parm
))
4214 if (for_each_template_parm (TREE_VALUE (parm
), fn
, data
))
4215 return error_mark_node
;
4217 /* Since we've already handled the TYPE_ARG_TYPES, we don't
4218 want walk_tree walking into them itself. */
4225 if (DECL_LANG_SPECIFIC (t
) && DECL_TEMPLATE_INFO (t
)
4226 && for_each_template_parm (DECL_TI_ARGS (t
), fn
, data
))
4227 return error_mark_node
;
4232 if (DECL_CONTEXT (t
)
4233 && for_each_template_parm (DECL_CONTEXT (t
), fn
, data
))
4234 return error_mark_node
;
4237 case BOUND_TEMPLATE_TEMPLATE_PARM
:
4238 /* Record template parameters such as `T' inside `TT<T>'. */
4239 if (for_each_template_parm (TYPE_TI_ARGS (t
), fn
, data
))
4240 return error_mark_node
;
4243 case TEMPLATE_TEMPLATE_PARM
:
4244 case TEMPLATE_TYPE_PARM
:
4245 case TEMPLATE_PARM_INDEX
:
4246 if (fn
&& (*fn
)(t
, data
))
4247 return error_mark_node
;
4249 return error_mark_node
;
4253 /* A template template parameter is encountered */
4254 if (DECL_TEMPLATE_TEMPLATE_PARM_P (t
)
4255 && for_each_template_parm (TREE_TYPE (t
), fn
, data
))
4256 return error_mark_node
;
4258 /* Already substituted template template parameter */
4263 if (!fn
|| for_each_template_parm (TYPENAME_TYPE_FULLNAME (t
), fn
, data
))
4264 return error_mark_node
;
4268 if (TREE_TYPE (t
) && TYPE_PTRMEMFUNC_P (TREE_TYPE (t
))
4269 && for_each_template_parm (TYPE_PTRMEMFUNC_FN_TYPE
4270 (TREE_TYPE (t
)), fn
, data
))
4271 return error_mark_node
;
4276 /* If there's no type, then this thing must be some expression
4277 involving template parameters. */
4278 if (!fn
&& !TREE_TYPE (t
))
4279 return error_mark_node
;
4284 case REINTERPRET_CAST_EXPR
:
4285 case CONST_CAST_EXPR
:
4286 case STATIC_CAST_EXPR
:
4287 case DYNAMIC_CAST_EXPR
:
4292 case PSEUDO_DTOR_EXPR
:
4294 return error_mark_node
;
4301 /* We didn't find any template parameters we liked. */
4305 /* For each TEMPLATE_TYPE_PARM, TEMPLATE_TEMPLATE_PARM,
4306 BOUND_TEMPLATE_TEMPLATE_PARM or TEMPLATE_PARM_INDEX in T,
4307 call FN with the parameter and the DATA.
4308 If FN returns non-zero, the iteration is terminated, and
4309 for_each_template_parm returns 1. Otherwise, the iteration
4310 continues. If FN never returns a non-zero value, the value
4311 returned by for_each_template_parm is 0. If FN is NULL, it is
4312 considered to be the function which always returns 1. */
4315 for_each_template_parm (t
, fn
, data
)
4320 struct pair_fn_data pfd
;
4326 /* Walk the tree. */
4327 return walk_tree_without_duplicates (&t
,
4328 for_each_template_parm_r
,
4333 uses_template_parms (t
)
4336 return for_each_template_parm (t
, 0, 0);
4339 static int tinst_depth
;
4340 extern int max_tinst_depth
;
4341 #ifdef GATHER_STATISTICS
4344 static int tinst_level_tick
;
4345 static int last_template_error_tick
;
4347 /* We're starting to instantiate D; record the template instantiation context
4348 for diagnostics and to restore it later. */
4351 push_tinst_level (d
)
4356 if (tinst_depth
>= max_tinst_depth
)
4358 /* If the instantiation in question still has unbound template parms,
4359 we don't really care if we can't instantiate it, so just return.
4360 This happens with base instantiation for implicit `typename'. */
4361 if (uses_template_parms (d
))
4364 last_template_error_tick
= tinst_level_tick
;
4365 cp_error ("template instantiation depth exceeds maximum of %d (use -ftemplate-depth-NN to increase the maximum) instantiating `%D'",
4366 max_tinst_depth
, d
);
4368 print_instantiation_context ();
4373 new = build_expr_wfl (d
, input_filename
, lineno
, 0);
4374 TREE_CHAIN (new) = current_tinst_level
;
4375 current_tinst_level
= new;
4378 #ifdef GATHER_STATISTICS
4379 if (tinst_depth
> depth_reached
)
4380 depth_reached
= tinst_depth
;
4387 /* We're done instantiating this template; return to the instantiation
4393 tree old
= current_tinst_level
;
4395 /* Restore the filename and line number stashed away when we started
4396 this instantiation. */
4397 lineno
= TINST_LINE (old
);
4398 input_filename
= TINST_FILE (old
);
4399 extract_interface_info ();
4401 current_tinst_level
= TREE_CHAIN (old
);
4406 /* We're instantiating a deferred template; restore the template
4407 instantiation context in which the instantiation was requested, which
4408 is one step out from LEVEL. */
4411 reopen_tinst_level (level
)
4417 for (t
= level
; t
; t
= TREE_CHAIN (t
))
4420 current_tinst_level
= level
;
4424 /* Return the outermost template instantiation context, for use with
4425 -falt-external-templates. */
4430 tree p
= current_tinst_level
;
4433 for (; TREE_CHAIN (p
) ; p
= TREE_CHAIN (p
))
4438 /* DECL is a friend FUNCTION_DECL or TEMPLATE_DECL. ARGS is the
4439 vector of template arguments, as for tsubst.
4441 Returns an appropriate tsubst'd friend declaration. */
4444 tsubst_friend_function (decl
, args
)
4450 const char *file
= input_filename
;
4452 lineno
= DECL_SOURCE_LINE (decl
);
4453 input_filename
= DECL_SOURCE_FILE (decl
);
4455 if (TREE_CODE (decl
) == FUNCTION_DECL
4456 && DECL_TEMPLATE_INSTANTIATION (decl
)
4457 && TREE_CODE (DECL_TI_TEMPLATE (decl
)) != TEMPLATE_DECL
)
4458 /* This was a friend declared with an explicit template
4459 argument list, e.g.:
4463 to indicate that f was a template instantiation, not a new
4464 function declaration. Now, we have to figure out what
4465 instantiation of what template. */
4467 tree template_id
, arglist
, fns
;
4470 tree ns
= CP_DECL_CONTEXT (TYPE_MAIN_DECL (current_class_type
));
4472 /* Friend functions are looked up in the containing namespace scope.
4473 We must enter that scope, to avoid finding member functions of the
4474 current cless with same name. */
4475 push_nested_namespace (ns
);
4476 fns
= tsubst_expr (DECL_TI_TEMPLATE (decl
), args
,
4477 /*complain=*/1, NULL_TREE
);
4478 pop_nested_namespace (ns
);
4479 arglist
= tsubst (DECL_TI_ARGS (decl
), args
,
4480 /*complain=*/1, NULL_TREE
);
4481 template_id
= lookup_template_function (fns
, arglist
);
4483 new_friend
= tsubst (decl
, args
, /*complain=*/1, NULL_TREE
);
4484 tmpl
= determine_specialization (template_id
, new_friend
,
4486 /*need_member_template=*/0);
4487 new_friend
= instantiate_template (tmpl
, new_args
);
4491 new_friend
= tsubst (decl
, args
, /*complain=*/1, NULL_TREE
);
4493 /* The NEW_FRIEND will look like an instantiation, to the
4494 compiler, but is not an instantiation from the point of view of
4495 the language. For example, we might have had:
4497 template <class T> struct S {
4498 template <class U> friend void f(T, U);
4501 Then, in S<int>, template <class U> void f(int, U) is not an
4502 instantiation of anything. */
4503 DECL_USE_TEMPLATE (new_friend
) = 0;
4504 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
4506 DECL_USE_TEMPLATE (DECL_TEMPLATE_RESULT (new_friend
)) = 0;
4507 DECL_SAVED_TREE (DECL_TEMPLATE_RESULT (new_friend
))
4508 = DECL_SAVED_TREE (DECL_TEMPLATE_RESULT (decl
));
4511 /* The mangled name for the NEW_FRIEND is incorrect. The call to
4512 tsubst will have resulted in a call to
4513 set_mangled_name_for_template_decl. But, the function is not a
4514 template instantiation and should not be mangled like one.
4515 Therefore, we remangle the function name. We don't have to do
4516 this if the NEW_FRIEND is a template since
4517 set_mangled_name_for_template_decl doesn't do anything if the
4518 function declaration still uses template arguments. */
4519 if (TREE_CODE (new_friend
) != TEMPLATE_DECL
)
4521 set_mangled_name_for_decl (new_friend
);
4522 DECL_RTL (new_friend
) = 0;
4523 make_decl_rtl (new_friend
, NULL_PTR
, 1);
4526 if (DECL_NAMESPACE_SCOPE_P (new_friend
))
4529 tree new_friend_template_info
;
4530 tree new_friend_result_template_info
;
4532 int new_friend_is_defn
;
4534 /* We must save some information from NEW_FRIEND before calling
4535 duplicate decls since that function will free NEW_FRIEND if
4537 new_friend_template_info
= DECL_TEMPLATE_INFO (new_friend
);
4538 if (TREE_CODE (new_friend
) == TEMPLATE_DECL
)
4540 /* This declaration is a `primary' template. */
4541 DECL_PRIMARY_TEMPLATE (new_friend
) = new_friend
;
4544 = DECL_INITIAL (DECL_TEMPLATE_RESULT (new_friend
)) != NULL_TREE
;
4545 new_friend_result_template_info
4546 = DECL_TEMPLATE_INFO (DECL_TEMPLATE_RESULT (new_friend
));
4550 new_friend_is_defn
= DECL_INITIAL (new_friend
) != NULL_TREE
;
4551 new_friend_result_template_info
= NULL_TREE
;
4554 /* Inside pushdecl_namespace_level, we will push into the
4555 current namespace. However, the friend function should go
4556 into the namespace of the template. */
4557 ns
= decl_namespace_context (new_friend
);
4558 push_nested_namespace (ns
);
4559 old_decl
= pushdecl_namespace_level (new_friend
);
4560 pop_nested_namespace (ns
);
4562 if (old_decl
!= new_friend
)
4564 /* This new friend declaration matched an existing
4565 declaration. For example, given:
4567 template <class T> void f(T);
4568 template <class U> class C {
4569 template <class T> friend void f(T) {}
4572 the friend declaration actually provides the definition
4573 of `f', once C has been instantiated for some type. So,
4574 old_decl will be the out-of-class template declaration,
4575 while new_friend is the in-class definition.
4577 But, if `f' was called before this point, the
4578 instantiation of `f' will have DECL_TI_ARGS corresponding
4579 to `T' but not to `U', references to which might appear
4580 in the definition of `f'. Previously, the most general
4581 template for an instantiation of `f' was the out-of-class
4582 version; now it is the in-class version. Therefore, we
4583 run through all specialization of `f', adding to their
4584 DECL_TI_ARGS appropriately. In particular, they need a
4585 new set of outer arguments, corresponding to the
4586 arguments for this class instantiation.
4588 The same situation can arise with something like this:
4591 template <class T> class C {
4595 when `C<int>' is instantiated. Now, `f(int)' is defined
4598 if (!new_friend_is_defn
)
4599 /* On the other hand, if the in-class declaration does
4600 *not* provide a definition, then we don't want to alter
4601 existing definitions. We can just leave everything
4606 /* Overwrite whatever template info was there before, if
4607 any, with the new template information pertaining to
4609 DECL_TEMPLATE_INFO (old_decl
) = new_friend_template_info
;
4611 if (TREE_CODE (old_decl
) != TEMPLATE_DECL
)
4612 /* duplicate_decls will take care of this case. */
4617 tree new_friend_args
;
4619 DECL_TEMPLATE_INFO (DECL_TEMPLATE_RESULT (old_decl
))
4620 = new_friend_result_template_info
;
4622 new_friend_args
= TI_ARGS (new_friend_template_info
);
4623 for (t
= DECL_TEMPLATE_SPECIALIZATIONS (old_decl
);
4627 tree spec
= TREE_VALUE (t
);
4630 = add_outermost_template_args (new_friend_args
,
4631 DECL_TI_ARGS (spec
));
4634 /* Now, since specializations are always supposed to
4635 hang off of the most general template, we must move
4637 t
= most_general_template (old_decl
);
4640 DECL_TEMPLATE_SPECIALIZATIONS (t
)
4641 = chainon (DECL_TEMPLATE_SPECIALIZATIONS (t
),
4642 DECL_TEMPLATE_SPECIALIZATIONS (old_decl
));
4643 DECL_TEMPLATE_SPECIALIZATIONS (old_decl
) = NULL_TREE
;
4648 /* The information from NEW_FRIEND has been merged into OLD_DECL
4649 by duplicate_decls. */
4650 new_friend
= old_decl
;
4653 else if (COMPLETE_TYPE_P (DECL_CONTEXT (new_friend
)))
4655 /* Check to see that the declaration is really present, and,
4656 possibly obtain an improved declaration. */
4657 tree fn
= check_classfn (DECL_CONTEXT (new_friend
),
4666 input_filename
= file
;
4670 /* FRIEND_TMPL is a friend TEMPLATE_DECL. ARGS is the vector of
4671 template arguments, as for tsubst.
4673 Returns an appropriate tsubst'd friend type or error_mark_node on
4677 tsubst_friend_class (friend_tmpl
, args
)
4684 /* First, we look for a class template. */
4685 tmpl
= lookup_name (DECL_NAME (friend_tmpl
), /*prefer_type=*/0);
4687 /* But, if we don't find one, it might be because we're in a
4688 situation like this:
4696 Here, in the scope of (say) S<int>, `S' is bound to a TYPE_DECL
4697 for `S<int>', not the TEMPLATE_DECL. */
4698 if (!tmpl
|| !DECL_CLASS_TEMPLATE_P (tmpl
))
4700 tmpl
= lookup_name (DECL_NAME (friend_tmpl
), /*prefer_type=*/1);
4701 tmpl
= maybe_get_template_decl_from_type_decl (tmpl
);
4704 if (tmpl
&& DECL_CLASS_TEMPLATE_P (tmpl
))
4706 /* The friend template has already been declared. Just
4707 check to see that the declarations match, and install any new
4708 default parameters. We must tsubst the default parameters,
4709 of course. We only need the innermost template parameters
4710 because that is all that redeclare_class_template will look
4713 = tsubst_template_parms (DECL_TEMPLATE_PARMS (friend_tmpl
),
4714 args
, /*complain=*/1);
4716 return error_mark_node
;
4717 redeclare_class_template (TREE_TYPE (tmpl
), parms
);
4718 friend_type
= TREE_TYPE (tmpl
);
4722 /* The friend template has not already been declared. In this
4723 case, the instantiation of the template class will cause the
4724 injection of this template into the global scope. */
4725 tmpl
= tsubst (friend_tmpl
, args
, /*complain=*/1, NULL_TREE
);
4727 /* The new TMPL is not an instantiation of anything, so we
4728 forget its origins. We don't reset CLASSTYPE_TI_TEMPLATE for
4729 the new type because that is supposed to be the corresponding
4730 template decl, i.e., TMPL. */
4731 DECL_USE_TEMPLATE (tmpl
) = 0;
4732 DECL_TEMPLATE_INFO (tmpl
) = NULL_TREE
;
4733 CLASSTYPE_USE_TEMPLATE (TREE_TYPE (tmpl
)) = 0;
4735 /* Inject this template into the global scope. */
4736 friend_type
= TREE_TYPE (pushdecl_top_level (tmpl
));
4743 instantiate_class_template (type
)
4746 tree
template, args
, pattern
, t
;
4749 if (type
== error_mark_node
)
4750 return error_mark_node
;
4752 if (TYPE_BEING_DEFINED (type
) || COMPLETE_TYPE_P (type
))
4755 /* Figure out which template is being instantiated. */
4756 template = most_general_template (CLASSTYPE_TI_TEMPLATE (type
));
4757 my_friendly_assert (TREE_CODE (template) == TEMPLATE_DECL
, 279);
4759 /* Figure out which arguments are being used to do the
4761 args
= CLASSTYPE_TI_ARGS (type
);
4762 PARTIAL_INSTANTIATION_P (type
) = uses_template_parms (args
);
4764 if (pedantic
&& PARTIAL_INSTANTIATION_P (type
))
4765 /* If this is a partial instantiation, then we can't instantiate
4766 the type; there's no telling whether or not one of the
4767 template parameters might eventually be instantiated to some
4768 value that results in a specialization being used. For
4780 Now, the `S<U>' in `f<int>' is the specialization, not an
4781 instantiation of the original template. */
4784 /* Determine what specialization of the original template to
4786 if (PARTIAL_INSTANTIATION_P (type
))
4787 /* There's no telling which specialization is appropriate at this
4788 point. Since all peeking at the innards of this partial
4789 instantiation are extensions (like the "implicit typename"
4790 extension, which allows users to omit the keyword `typename' on
4791 names that are declared as types in template base classes), we
4792 are free to do what we please.
4794 Trying to figure out which partial instantiation to use can
4795 cause a crash. (Some of the template arguments don't even have
4796 types.) So, we just use the most general version. */
4800 t
= most_specialized_class (template, args
);
4802 if (t
== error_mark_node
)
4804 const char *str
= "candidates are:";
4805 cp_error ("ambiguous class template instantiation for `%#T'", type
);
4806 for (t
= DECL_TEMPLATE_SPECIALIZATIONS (template); t
;
4809 if (get_class_bindings (TREE_VALUE (t
), TREE_PURPOSE (t
),
4812 cp_error_at ("%s %+#T", str
, TREE_TYPE (t
));
4816 TYPE_BEING_DEFINED (type
) = 1;
4817 return error_mark_node
;
4822 pattern
= TREE_TYPE (t
);
4824 pattern
= TREE_TYPE (template);
4826 /* If the template we're instantiating is incomplete, then clearly
4827 there's nothing we can do. */
4828 if (!COMPLETE_TYPE_P (pattern
))
4831 /* If this is a partial instantiation, don't tsubst anything. We will
4832 only use this type for implicit typename, so the actual contents don't
4833 matter. All that matters is whether a particular name is a type. */
4834 if (PARTIAL_INSTANTIATION_P (type
))
4836 /* The fields set here must be kept in sync with those cleared
4837 in begin_class_definition. */
4838 TYPE_BINFO_BASETYPES (type
) = TYPE_BINFO_BASETYPES (pattern
);
4839 TYPE_FIELDS (type
) = TYPE_FIELDS (pattern
);
4840 TYPE_METHODS (type
) = TYPE_METHODS (pattern
);
4841 CLASSTYPE_TAGS (type
) = CLASSTYPE_TAGS (pattern
);
4842 CLASSTYPE_VBASECLASSES (type
) = CLASSTYPE_VBASECLASSES (pattern
);
4844 /* Pretend that the type is complete, so that we will look
4845 inside it during name lookup and such. */
4846 TYPE_SIZE (type
) = bitsize_zero_node
;
4850 /* If we've recursively instantiated too many templates, stop. */
4851 if (! push_tinst_level (type
))
4854 /* Now we're really doing the instantiation. Mark the type as in
4855 the process of being defined. */
4856 TYPE_BEING_DEFINED (type
) = 1;
4858 maybe_push_to_top_level (uses_template_parms (type
));
4862 /* This TYPE is actually a instantiation of of a partial
4863 specialization. We replace the innermost set of ARGS with
4864 the arguments appropriate for substitution. For example,
4867 template <class T> struct S {};
4868 template <class T> struct S<T*> {};
4870 and supposing that we are instantiating S<int*>, ARGS will
4871 present be {int*} but we need {int}. */
4873 = get_class_bindings (TREE_VALUE (t
), TREE_PURPOSE (t
),
4876 /* If there were multiple levels in ARGS, replacing the
4877 innermost level would alter CLASSTYPE_TI_ARGS, which we don't
4878 want, so we make a copy first. */
4879 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (args
))
4881 args
= copy_node (args
);
4882 SET_TMPL_ARGS_LEVEL (args
, TMPL_ARGS_DEPTH (args
), inner_args
);
4888 if (flag_external_templates
)
4890 if (flag_alt_external_templates
)
4892 CLASSTYPE_INTERFACE_ONLY (type
) = interface_only
;
4893 SET_CLASSTYPE_INTERFACE_UNKNOWN_X (type
, interface_unknown
);
4894 CLASSTYPE_VTABLE_NEEDS_WRITING (type
)
4895 = (! CLASSTYPE_INTERFACE_ONLY (type
)
4896 && CLASSTYPE_INTERFACE_KNOWN (type
));
4900 CLASSTYPE_INTERFACE_ONLY (type
) = CLASSTYPE_INTERFACE_ONLY (pattern
);
4901 SET_CLASSTYPE_INTERFACE_UNKNOWN_X
4902 (type
, CLASSTYPE_INTERFACE_UNKNOWN (pattern
));
4903 CLASSTYPE_VTABLE_NEEDS_WRITING (type
)
4904 = (! CLASSTYPE_INTERFACE_ONLY (type
)
4905 && CLASSTYPE_INTERFACE_KNOWN (type
));
4910 SET_CLASSTYPE_INTERFACE_UNKNOWN (type
);
4911 CLASSTYPE_VTABLE_NEEDS_WRITING (type
) = 1;
4914 TYPE_HAS_CONSTRUCTOR (type
) = TYPE_HAS_CONSTRUCTOR (pattern
);
4915 TYPE_HAS_DESTRUCTOR (type
) = TYPE_HAS_DESTRUCTOR (pattern
);
4916 TYPE_OVERLOADS_CALL_EXPR (type
) = TYPE_OVERLOADS_CALL_EXPR (pattern
);
4917 TYPE_OVERLOADS_ARRAY_REF (type
) = TYPE_OVERLOADS_ARRAY_REF (pattern
);
4918 TYPE_OVERLOADS_ARROW (type
) = TYPE_OVERLOADS_ARROW (pattern
);
4919 TYPE_HAS_NEW_OPERATOR (type
) = TYPE_HAS_NEW_OPERATOR (pattern
);
4920 TYPE_HAS_ARRAY_NEW_OPERATOR (type
) = TYPE_HAS_ARRAY_NEW_OPERATOR (pattern
);
4921 TYPE_GETS_DELETE (type
) = TYPE_GETS_DELETE (pattern
);
4922 TYPE_VEC_DELETE_TAKES_SIZE (type
) = TYPE_VEC_DELETE_TAKES_SIZE (pattern
);
4923 TYPE_HAS_ASSIGN_REF (type
) = TYPE_HAS_ASSIGN_REF (pattern
);
4924 TYPE_HAS_CONST_ASSIGN_REF (type
) = TYPE_HAS_CONST_ASSIGN_REF (pattern
);
4925 TYPE_HAS_ABSTRACT_ASSIGN_REF (type
) = TYPE_HAS_ABSTRACT_ASSIGN_REF (pattern
);
4926 TYPE_HAS_INIT_REF (type
) = TYPE_HAS_INIT_REF (pattern
);
4927 TYPE_HAS_CONST_INIT_REF (type
) = TYPE_HAS_CONST_INIT_REF (pattern
);
4928 TYPE_HAS_DEFAULT_CONSTRUCTOR (type
) = TYPE_HAS_DEFAULT_CONSTRUCTOR (pattern
);
4929 TYPE_HAS_CONVERSION (type
) = TYPE_HAS_CONVERSION (pattern
);
4930 TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (type
)
4931 = TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (pattern
);
4932 TYPE_USES_MULTIPLE_INHERITANCE (type
)
4933 = TYPE_USES_MULTIPLE_INHERITANCE (pattern
);
4934 TYPE_USES_VIRTUAL_BASECLASSES (type
)
4935 = TYPE_USES_VIRTUAL_BASECLASSES (pattern
);
4936 TYPE_PACKED (type
) = TYPE_PACKED (pattern
);
4937 TYPE_ALIGN (type
) = TYPE_ALIGN (pattern
);
4938 TYPE_USER_ALIGN (type
) = TYPE_USER_ALIGN (pattern
);
4939 TYPE_FOR_JAVA (type
) = TYPE_FOR_JAVA (pattern
); /* For libjava's JArray<T> */
4940 if (ANON_AGGR_TYPE_P (pattern
))
4941 SET_ANON_AGGR_TYPE_P (type
);
4943 if (TYPE_BINFO_BASETYPES (pattern
))
4945 tree base_list
= NULL_TREE
;
4946 tree pbases
= TYPE_BINFO_BASETYPES (pattern
);
4949 /* Substitute into each of the bases to determine the actual
4951 for (i
= 0; i
< TREE_VEC_LENGTH (pbases
); ++i
)
4957 pbase
= TREE_VEC_ELT (pbases
, i
);
4959 /* Substitute to figure out the base class. */
4960 base
= tsubst (BINFO_TYPE (pbase
), args
,
4961 /*complain=*/1, NULL_TREE
);
4962 if (base
== error_mark_node
)
4965 /* Calculate the correct access node. */
4966 if (TREE_VIA_VIRTUAL (pbase
))
4968 if (TREE_VIA_PUBLIC (pbase
))
4969 access
= access_public_virtual_node
;
4970 else if (TREE_VIA_PROTECTED (pbase
))
4971 access
= access_protected_virtual_node
;
4973 access
= access_private_virtual_node
;
4977 if (TREE_VIA_PUBLIC (pbase
))
4978 access
= access_public_node
;
4979 else if (TREE_VIA_PROTECTED (pbase
))
4980 access
= access_protected_node
;
4982 access
= access_private_node
;
4985 base_list
= tree_cons (access
, base
, base_list
);
4988 /* The list is now in reverse order; correct that. */
4989 base_list
= nreverse (base_list
);
4991 /* Now call xref_basetypes to set up all the base-class
4993 xref_basetypes (TREE_CODE (pattern
) == RECORD_TYPE
4994 ? (CLASSTYPE_DECLARED_CLASS (pattern
)
4995 ? class_type_node
: record_type_node
)
4997 DECL_NAME (TYPE_NAME (pattern
)),
5002 /* Now that our base classes are set up, enter the scope of the
5003 class, so that name lookups into base classes, etc. will work
5004 correctly. This is precisely analogous to what we do in
5005 begin_class_definition when defining an ordinary non-template
5007 pushclass (type
, 1);
5009 for (t
= CLASSTYPE_TAGS (pattern
); t
; t
= TREE_CHAIN (t
))
5011 tree tag
= TREE_VALUE (t
);
5012 tree name
= TYPE_IDENTIFIER (tag
);
5015 newtag
= tsubst (tag
, args
, /*complain=*/1, NULL_TREE
);
5016 if (TREE_CODE (newtag
) != ENUMERAL_TYPE
)
5018 if (TYPE_LANG_SPECIFIC (tag
) && CLASSTYPE_IS_TEMPLATE (tag
))
5019 /* Unfortunately, lookup_template_class sets
5020 CLASSTYPE_IMPLICIT_INSTANTIATION for a partial
5021 instantiation (i.e., for the type of a member template
5022 class nested within a template class.) This behavior is
5023 required for maybe_process_partial_specialization to work
5024 correctly, but is not accurate in this case; the TAG is not
5025 an instantiation of anything. (The corresponding
5026 TEMPLATE_DECL is an instantiation, but the TYPE is not.) */
5027 CLASSTYPE_USE_TEMPLATE (newtag
) = 0;
5029 /* Now, we call pushtag to put this NEWTAG into the scope of
5030 TYPE. We first set up the IDENTIFIER_TYPE_VALUE to avoid
5031 pushtag calling push_template_decl. We don't have to do
5032 this for enums because it will already have been done in
5035 SET_IDENTIFIER_TYPE_VALUE (name
, newtag
);
5036 pushtag (name
, newtag
, /*globalize=*/0);
5040 /* Don't replace enum constants here. */
5041 for (t
= TYPE_FIELDS (pattern
); t
; t
= TREE_CHAIN (t
))
5042 if (TREE_CODE (t
) != CONST_DECL
)
5046 /* The the file and line for this declaration, to assist in
5047 error message reporting. Since we called push_tinst_level
5048 above, we don't need to restore these. */
5049 lineno
= DECL_SOURCE_LINE (t
);
5050 input_filename
= DECL_SOURCE_FILE (t
);
5052 r
= tsubst (t
, args
, /*complain=*/1, NULL_TREE
);
5053 if (TREE_CODE (r
) == VAR_DECL
)
5057 if (DECL_DEFINED_IN_CLASS_P (r
))
5058 init
= tsubst_expr (DECL_INITIAL (t
), args
,
5059 /*complain=*/1, NULL_TREE
);
5063 finish_static_data_member_decl (r
, init
,
5064 /*asmspec_tree=*/NULL_TREE
,
5067 if (DECL_DEFINED_IN_CLASS_P (r
))
5068 check_static_variable_definition (r
, TREE_TYPE (r
));
5071 /* R will have a TREE_CHAIN if and only if it has already been
5072 processed by finish_member_declaration. This can happen
5073 if, for example, it is a TYPE_DECL for a class-scoped
5074 ENUMERAL_TYPE; such a thing will already have been added to
5075 the field list by tsubst_enum above. */
5076 if (!TREE_CHAIN (r
))
5078 set_current_access_from_decl (r
);
5079 finish_member_declaration (r
);
5083 /* Set up the list (TYPE_METHODS) and vector (CLASSTYPE_METHOD_VEC)
5084 for this instantiation. */
5085 for (t
= TYPE_METHODS (pattern
); t
; t
= TREE_CHAIN (t
))
5087 tree r
= tsubst (t
, args
, /*complain=*/1, NULL_TREE
);
5088 set_current_access_from_decl (r
);
5089 finish_member_declaration (r
);
5092 /* Construct the DECL_FRIENDLIST for the new class type. */
5093 typedecl
= TYPE_MAIN_DECL (type
);
5094 for (t
= DECL_FRIENDLIST (TYPE_MAIN_DECL (pattern
));
5100 for (friends
= TREE_VALUE (t
);
5101 friends
!= NULL_TREE
;
5102 friends
= TREE_CHAIN (friends
))
5103 if (TREE_PURPOSE (friends
) == error_mark_node
)
5105 tsubst_friend_function (TREE_VALUE (friends
),
5108 my_friendly_abort (20000216);
5111 for (t
= CLASSTYPE_FRIEND_CLASSES (pattern
);
5115 tree friend_type
= TREE_VALUE (t
);
5116 tree new_friend_type
;
5118 if (TREE_CODE (friend_type
) == TEMPLATE_DECL
)
5119 new_friend_type
= tsubst_friend_class (friend_type
, args
);
5120 else if (uses_template_parms (friend_type
))
5121 new_friend_type
= tsubst (friend_type
, args
, /*complain=*/1,
5125 tree ns
= decl_namespace_context (TYPE_MAIN_DECL (friend_type
));
5127 /* The call to xref_tag_from_type does injection for friend
5129 push_nested_namespace (ns
);
5131 xref_tag_from_type (friend_type
, NULL_TREE
, 1);
5132 pop_nested_namespace (ns
);
5135 if (TREE_CODE (friend_type
) == TEMPLATE_DECL
)
5136 /* Trick make_friend_class into realizing that the friend
5137 we're adding is a template, not an ordinary class. It's
5138 important that we use make_friend_class since it will
5139 perform some error-checking and output cross-reference
5141 ++processing_template_decl
;
5143 if (new_friend_type
!= error_mark_node
)
5144 make_friend_class (type
, new_friend_type
);
5146 if (TREE_CODE (friend_type
) == TEMPLATE_DECL
)
5147 --processing_template_decl
;
5150 for (t
= TYPE_FIELDS (type
); t
; t
= TREE_CHAIN (t
))
5151 if (TREE_CODE (t
) == FIELD_DECL
)
5153 TREE_TYPE (t
) = complete_type (TREE_TYPE (t
));
5154 require_complete_type (t
);
5157 /* Set the file and line number information to whatever is given for
5158 the class itself. This puts error messages involving generated
5159 implicit functions at a predictable point, and the same point
5160 that would be used for non-template classes. */
5161 lineno
= DECL_SOURCE_LINE (typedecl
);
5162 input_filename
= DECL_SOURCE_FILE (typedecl
);
5164 unreverse_member_declarations (type
);
5165 finish_struct_1 (type
);
5166 CLASSTYPE_GOT_SEMICOLON (type
) = 1;
5168 /* Clear this now so repo_template_used is happy. */
5169 TYPE_BEING_DEFINED (type
) = 0;
5170 repo_template_used (type
);
5172 /* Now that the class is complete, instantiate default arguments for
5173 any member functions. We don't do this earlier because the
5174 default arguments may reference members of the class. */
5175 if (!PRIMARY_TEMPLATE_P (template))
5176 for (t
= TYPE_METHODS (type
); t
; t
= TREE_CHAIN (t
))
5177 if (TREE_CODE (t
) == FUNCTION_DECL
5178 /* Implicitly generated member functions will not have template
5179 information; they are not instantiations, but instead are
5180 created "fresh" for each instantiation. */
5181 && DECL_TEMPLATE_INFO (t
))
5182 tsubst_default_arguments (t
);
5185 pop_from_top_level ();
5195 if (t1
== NULL_TREE
)
5196 return t2
== NULL_TREE
;
5197 if (t2
== NULL_TREE
)
5199 /* Don't care if one declares its arg const and the other doesn't -- the
5200 main variant of the arg type is all that matters. */
5201 if (TYPE_MAIN_VARIANT (TREE_VALUE (t1
))
5202 != TYPE_MAIN_VARIANT (TREE_VALUE (t2
)))
5204 return list_eq (TREE_CHAIN (t1
), TREE_CHAIN (t2
));
5207 /* If arg is a non-type template parameter that does not depend on template
5208 arguments, fold it like we weren't in the body of a template. */
5211 maybe_fold_nontype_arg (arg
)
5214 /* If we're not in a template, ARG is already as simple as it's going to
5215 get, and trying to reprocess the trees will break. */
5216 if (! processing_template_decl
)
5219 if (!TYPE_P (arg
) && !uses_template_parms (arg
))
5221 /* Sometimes, one of the args was an expression involving a
5222 template constant parameter, like N - 1. Now that we've
5223 tsubst'd, we might have something like 2 - 1. This will
5224 confuse lookup_template_class, so we do constant folding
5225 here. We have to unset processing_template_decl, to
5226 fool build_expr_from_tree() into building an actual
5229 int saved_processing_template_decl
= processing_template_decl
;
5230 processing_template_decl
= 0;
5231 arg
= fold (build_expr_from_tree (arg
));
5232 processing_template_decl
= saved_processing_template_decl
;
5237 /* Substitute ARGS into the vector of template arguments T. */
5240 tsubst_template_arg_vector (t
, args
, complain
)
5245 int len
= TREE_VEC_LENGTH (t
), need_new
= 0, i
;
5246 tree
*elts
= (tree
*) alloca (len
* sizeof (tree
));
5248 memset ((char *) elts
, 0, len
* sizeof (tree
));
5250 for (i
= 0; i
< len
; i
++)
5252 if (TREE_VEC_ELT (t
, i
) != NULL_TREE
5253 && TREE_CODE (TREE_VEC_ELT (t
, i
)) == TREE_VEC
)
5254 elts
[i
] = tsubst_template_arg_vector (TREE_VEC_ELT (t
, i
),
5257 elts
[i
] = maybe_fold_nontype_arg
5258 (tsubst_expr (TREE_VEC_ELT (t
, i
), args
, complain
,
5261 if (elts
[i
] == error_mark_node
)
5262 return error_mark_node
;
5264 if (elts
[i
] != TREE_VEC_ELT (t
, i
))
5271 t
= make_tree_vec (len
);
5272 for (i
= 0; i
< len
; i
++)
5273 TREE_VEC_ELT (t
, i
) = elts
[i
];
5278 /* Return the result of substituting ARGS into the template parameters
5279 given by PARMS. If there are m levels of ARGS and m + n levels of
5280 PARMS, then the result will contain n levels of PARMS. For
5281 example, if PARMS is `template <class T> template <class U>
5282 template <T*, U, class V>' and ARGS is {{int}, {double}} then the
5283 result will be `template <int*, double, class V>'. */
5286 tsubst_template_parms (parms
, args
, complain
)
5294 for (new_parms
= &r
;
5295 TMPL_PARMS_DEPTH (parms
) > TMPL_ARGS_DEPTH (args
);
5296 new_parms
= &(TREE_CHAIN (*new_parms
)),
5297 parms
= TREE_CHAIN (parms
))
5300 make_tree_vec (TREE_VEC_LENGTH (TREE_VALUE (parms
)));
5303 for (i
= 0; i
< TREE_VEC_LENGTH (new_vec
); ++i
)
5305 tree default_value
=
5306 TREE_PURPOSE (TREE_VEC_ELT (TREE_VALUE (parms
), i
));
5308 TREE_VALUE (TREE_VEC_ELT (TREE_VALUE (parms
), i
));
5310 TREE_VEC_ELT (new_vec
, i
)
5311 = build_tree_list (tsubst (default_value
, args
, complain
,
5313 tsubst (parm_decl
, args
, complain
,
5318 tree_cons (build_int_2 (0, (TMPL_PARMS_DEPTH (parms
)
5319 - TMPL_ARGS_DEPTH (args
))),
5320 new_vec
, NULL_TREE
);
5326 /* Substitute the ARGS into the indicated aggregate (or enumeration)
5327 type T. If T is not an aggregate or enumeration type, it is
5328 handled as if by tsubst. IN_DECL is as for tsubst. If
5329 ENTERING_SCOPE is non-zero, T is the context for a template which
5330 we are presently tsubst'ing. Return the substituted value. */
5333 tsubst_aggr_type (t
, args
, complain
, in_decl
, entering_scope
)
5343 switch (TREE_CODE (t
))
5346 if (TYPE_PTRMEMFUNC_P (t
))
5348 tree r
= build_ptrmemfunc_type
5349 (tsubst (TYPE_PTRMEMFUNC_FN_TYPE (t
), args
, complain
, in_decl
));
5350 return cp_build_qualified_type_real (r
, TYPE_QUALS (t
),
5354 /* else fall through */
5357 if (TYPE_TEMPLATE_INFO (t
))
5363 /* First, determine the context for the type we are looking
5365 if (TYPE_CONTEXT (t
) != NULL_TREE
)
5366 context
= tsubst_aggr_type (TYPE_CONTEXT (t
), args
,
5368 in_decl
, /*entering_scope=*/1);
5370 context
= NULL_TREE
;
5372 /* Then, figure out what arguments are appropriate for the
5373 type we are trying to find. For example, given:
5375 template <class T> struct S;
5376 template <class T, class U> void f(T, U) { S<U> su; }
5378 and supposing that we are instantiating f<int, double>,
5379 then our ARGS will be {int, double}, but, when looking up
5380 S we only want {double}. */
5381 argvec
= tsubst_template_arg_vector (TYPE_TI_ARGS (t
), args
,
5383 if (argvec
== error_mark_node
)
5384 return error_mark_node
;
5386 r
= lookup_template_class (t
, argvec
, in_decl
, context
,
5389 return cp_build_qualified_type_real (r
, TYPE_QUALS (t
),
5393 /* This is not a template type, so there's nothing to do. */
5397 return tsubst (t
, args
, complain
, in_decl
);
5401 /* Substitute into the default argument ARG (a default argument for
5402 FN), which has the indicated TYPE. */
5405 tsubst_default_argument (fn
, type
, arg
)
5410 /* This default argument came from a template. Instantiate the
5411 default argument here, not in tsubst. In the case of
5420 we must be careful to do name lookup in the scope of S<T>,
5421 rather than in the current class. */
5422 if (DECL_CLASS_SCOPE_P (fn
))
5423 pushclass (DECL_CONTEXT (fn
), 2);
5425 arg
= tsubst_expr (arg
, DECL_TI_ARGS (fn
), /*complain=*/1, NULL_TREE
);
5427 if (DECL_CLASS_SCOPE_P (fn
))
5430 /* Make sure the default argument is reasonable. */
5431 arg
= check_default_argument (type
, arg
);
5436 /* Substitute into all the default arguments for FN. */
5439 tsubst_default_arguments (fn
)
5445 tmpl_args
= DECL_TI_ARGS (fn
);
5447 /* If this function is not yet instantiated, we certainly don't need
5448 its default arguments. */
5449 if (uses_template_parms (tmpl_args
))
5452 for (arg
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
5454 arg
= TREE_CHAIN (arg
))
5455 if (TREE_PURPOSE (arg
))
5456 TREE_PURPOSE (arg
) = tsubst_default_argument (fn
,
5458 TREE_PURPOSE (arg
));
5461 /* Substitute the ARGS into the T, which is a _DECL. TYPE is the
5462 (already computed) substitution of ARGS into TREE_TYPE (T), if
5463 appropriate. Return the result of the substitution. IN_DECL is as
5467 tsubst_decl (t
, args
, type
, in_decl
)
5474 const char *saved_filename
;
5477 /* Set the filename and linenumber to improve error-reporting. */
5478 saved_lineno
= lineno
;
5479 saved_filename
= input_filename
;
5480 lineno
= DECL_SOURCE_LINE (t
);
5481 input_filename
= DECL_SOURCE_FILE (t
);
5483 switch (TREE_CODE (t
))
5487 /* We can get here when processing a member template function
5488 of a template class. */
5489 tree decl
= DECL_TEMPLATE_RESULT (t
);
5491 int is_template_template_parm
= DECL_TEMPLATE_TEMPLATE_PARM_P (t
);
5493 if (!is_template_template_parm
)
5495 /* We might already have an instance of this template.
5496 The ARGS are for the surrounding class type, so the
5497 full args contain the tsubst'd args for the context,
5498 plus the innermost args from the template decl. */
5499 tree tmpl_args
= DECL_CLASS_TEMPLATE_P (t
)
5500 ? CLASSTYPE_TI_ARGS (TREE_TYPE (t
))
5501 : DECL_TI_ARGS (DECL_TEMPLATE_RESULT (t
));
5504 full_args
= tsubst_template_arg_vector (tmpl_args
, args
,
5507 /* tsubst_template_arg_vector doesn't copy the vector if
5508 nothing changed. But, *something* should have
5510 my_friendly_assert (full_args
!= tmpl_args
, 0);
5512 spec
= retrieve_specialization (t
, full_args
);
5513 if (spec
!= NULL_TREE
)
5520 /* Make a new template decl. It will be similar to the
5521 original, but will record the current template arguments.
5522 We also create a new function declaration, which is just
5523 like the old one, but points to this new template, rather
5524 than the old one. */
5526 my_friendly_assert (DECL_LANG_SPECIFIC (r
) != 0, 0);
5527 TREE_CHAIN (r
) = NULL_TREE
;
5529 if (is_template_template_parm
)
5531 tree new_decl
= tsubst (decl
, args
, /*complain=*/1, in_decl
);
5532 DECL_TEMPLATE_RESULT (r
) = new_decl
;
5533 TREE_TYPE (r
) = TREE_TYPE (new_decl
);
5538 = tsubst_aggr_type (DECL_CONTEXT (t
), args
,
5539 /*complain=*/1, in_decl
,
5540 /*entering_scope=*/1);
5541 DECL_VIRTUAL_CONTEXT (r
)
5542 = tsubst_aggr_type (DECL_VIRTUAL_CONTEXT (t
), args
,
5543 /*complain=*/1, in_decl
,
5544 /*entering_scope=*/1);
5545 DECL_TEMPLATE_INFO (r
) = build_tree_list (t
, args
);
5547 if (TREE_CODE (decl
) == TYPE_DECL
)
5549 tree new_type
= tsubst (TREE_TYPE (t
), args
,
5550 /*complain=*/1, in_decl
);
5551 TREE_TYPE (r
) = new_type
;
5552 CLASSTYPE_TI_TEMPLATE (new_type
) = r
;
5553 DECL_TEMPLATE_RESULT (r
) = TYPE_MAIN_DECL (new_type
);
5554 DECL_TI_ARGS (r
) = CLASSTYPE_TI_ARGS (new_type
);
5558 tree new_decl
= tsubst (decl
, args
, /*complain=*/1, in_decl
);
5560 DECL_TEMPLATE_RESULT (r
) = new_decl
;
5561 DECL_TI_TEMPLATE (new_decl
) = r
;
5562 TREE_TYPE (r
) = TREE_TYPE (new_decl
);
5563 DECL_TI_ARGS (r
) = DECL_TI_ARGS (new_decl
);
5566 SET_DECL_IMPLICIT_INSTANTIATION (r
);
5567 DECL_TEMPLATE_INSTANTIATIONS (r
) = NULL_TREE
;
5568 DECL_TEMPLATE_SPECIALIZATIONS (r
) = NULL_TREE
;
5570 /* The template parameters for this new template are all the
5571 template parameters for the old template, except the
5572 outermost level of parameters. */
5573 DECL_TEMPLATE_PARMS (r
)
5574 = tsubst_template_parms (DECL_TEMPLATE_PARMS (t
), args
,
5577 if (PRIMARY_TEMPLATE_P (t
))
5578 DECL_PRIMARY_TEMPLATE (r
) = r
;
5580 /* We don't partially instantiate partial specializations. */
5581 if (TREE_CODE (decl
) == TYPE_DECL
)
5584 /* Record this partial instantiation. */
5585 register_specialization (r
, t
,
5586 DECL_TI_ARGS (DECL_TEMPLATE_RESULT (r
)));
5594 tree argvec
= NULL_TREE
;
5601 /* Nobody should be tsubst'ing into non-template functions. */
5602 my_friendly_assert (DECL_TEMPLATE_INFO (t
) != NULL_TREE
, 0);
5604 if (TREE_CODE (DECL_TI_TEMPLATE (t
)) == TEMPLATE_DECL
)
5608 /* Calculate the most general template of which R is a
5609 specialization, and the complete set of arguments used to
5611 gen_tmpl
= most_general_template (DECL_TI_TEMPLATE (t
));
5613 = tsubst_template_arg_vector (DECL_TI_ARGS
5614 (DECL_TEMPLATE_RESULT (gen_tmpl
)),
5615 args
, /*complain=*/1);
5617 /* Check to see if we already have this specialization. */
5618 spec
= retrieve_specialization (gen_tmpl
, argvec
);
5626 /* We can see more levels of arguments than parameters if
5627 there was a specialization of a member template, like
5630 template <class T> struct S { template <class U> void f(); }
5631 template <> template <class U> void S<int>::f(U);
5633 Here, we'll be substituting into the specialization,
5634 because that's where we can find the code we actually
5635 want to generate, but we'll have enough arguments for
5636 the most general template.
5638 We also deal with the peculiar case:
5640 template <class T> struct S {
5641 template <class U> friend void f();
5643 template <class U> void f() {}
5645 template void f<double>();
5647 Here, the ARGS for the instantiation of will be {int,
5648 double}. But, we only need as many ARGS as there are
5649 levels of template parameters in CODE_PATTERN. We are
5650 careful not to get fooled into reducing the ARGS in
5653 template <class T> struct S { template <class U> void f(U); }
5654 template <class T> template <> void S<T>::f(int) {}
5656 which we can spot because the pattern will be a
5657 specialization in this case. */
5658 args_depth
= TMPL_ARGS_DEPTH (args
);
5660 TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (DECL_TI_TEMPLATE (t
)));
5661 if (args_depth
> parms_depth
5662 && !DECL_TEMPLATE_SPECIALIZATION (t
))
5663 args
= get_innermost_template_args (args
, parms_depth
);
5667 /* This special case arises when we have something like this:
5669 template <class T> struct S {
5670 friend void f<int>(int, double);
5673 Here, the DECL_TI_TEMPLATE for the friend declaration
5674 will be a LOOKUP_EXPR or an IDENTIFIER_NODE. We are
5675 being called from tsubst_friend_function, and we want
5676 only to create a new decl (R) with appropriate types so
5677 that we can call determine_specialization. */
5678 my_friendly_assert ((TREE_CODE (DECL_TI_TEMPLATE (t
))
5680 || (TREE_CODE (DECL_TI_TEMPLATE (t
))
5681 == IDENTIFIER_NODE
), 0);
5682 gen_tmpl
= NULL_TREE
;
5685 if (DECL_CLASS_SCOPE_P (t
))
5687 if (DECL_NAME (t
) == constructor_name (DECL_CONTEXT (t
)))
5691 ctx
= tsubst_aggr_type (DECL_CONTEXT (t
), args
,
5693 /*entering_scope=*/1);
5698 ctx
= DECL_CONTEXT (t
);
5700 type
= tsubst (type
, args
, /*complain=*/1, in_decl
);
5701 if (type
== error_mark_node
)
5702 return error_mark_node
;
5704 /* We do NOT check for matching decls pushed separately at this
5705 point, as they may not represent instantiations of this
5706 template, and in any case are considered separate under the
5709 DECL_USE_TEMPLATE (r
) = 0;
5710 TREE_TYPE (r
) = type
;
5712 DECL_CONTEXT (r
) = ctx
;
5713 DECL_VIRTUAL_CONTEXT (r
)
5714 = tsubst_aggr_type (DECL_VIRTUAL_CONTEXT (t
), args
,
5716 /*entering_scope=*/1);
5718 if (member
&& DECL_CONV_FN_P (r
))
5720 /* Type-conversion operator. Reconstruct the name, in
5721 case it's the name of one of the template's parameters. */
5723 DECL_NAME (r
) = mangle_conv_op_name_for_type (TREE_TYPE (type
));
5725 DECL_NAME (r
) = build_typename_overload (TREE_TYPE (type
));
5728 DECL_ARGUMENTS (r
) = tsubst (DECL_ARGUMENTS (t
), args
,
5730 DECL_RESULT (r
) = NULL_TREE
;
5732 TREE_STATIC (r
) = 0;
5733 TREE_PUBLIC (r
) = TREE_PUBLIC (t
);
5734 DECL_EXTERNAL (r
) = 1;
5735 DECL_INTERFACE_KNOWN (r
) = 0;
5736 DECL_DEFER_OUTPUT (r
) = 0;
5737 TREE_CHAIN (r
) = NULL_TREE
;
5738 DECL_PENDING_INLINE_INFO (r
) = 0;
5739 DECL_PENDING_INLINE_P (r
) = 0;
5740 DECL_SAVED_TREE (r
) = NULL_TREE
;
5742 if (DECL_CLONED_FUNCTION (r
))
5744 DECL_CLONED_FUNCTION (r
) = tsubst (DECL_CLONED_FUNCTION (t
),
5745 args
, /*complain=*/1, t
);
5746 TREE_CHAIN (r
) = TREE_CHAIN (DECL_CLONED_FUNCTION (r
));
5747 TREE_CHAIN (DECL_CLONED_FUNCTION (r
)) = r
;
5750 /* Set up the DECL_TEMPLATE_INFO for R and compute its mangled
5751 name. There's no need to do this in the special friend
5752 case mentioned above where GEN_TMPL is NULL. */
5755 DECL_TEMPLATE_INFO (r
)
5756 = tree_cons (gen_tmpl
, argvec
, NULL_TREE
);
5757 SET_DECL_IMPLICIT_INSTANTIATION (r
);
5758 register_specialization (r
, gen_tmpl
, argvec
);
5760 /* Set the mangled name for R. */
5761 if (DECL_DESTRUCTOR_P (t
))
5764 set_mangled_name_for_decl (r
);
5766 DECL_ASSEMBLER_NAME (r
) = build_destructor_name (ctx
);
5770 /* Instantiations of template functions must be mangled
5771 specially, in order to conform to 14.5.5.1
5772 [temp.over.link]. */
5773 tree tmpl
= DECL_TI_TEMPLATE (t
);
5775 /* TMPL will be NULL if this is a specialization of a
5776 member function of a template class. */
5777 if (name_mangling_version
< 1
5778 || tmpl
== NULL_TREE
5779 || (member
&& !is_member_template (tmpl
)
5780 && !DECL_TEMPLATE_INFO (tmpl
)))
5781 set_mangled_name_for_decl (r
);
5783 set_mangled_name_for_template_decl (r
);
5787 make_decl_rtl (r
, NULL_PTR
, 1);
5789 /* Like grokfndecl. If we don't do this, pushdecl will
5790 mess up our TREE_CHAIN because it doesn't find a
5791 previous decl. Sigh. */
5793 && ! uses_template_parms (r
)
5794 && (IDENTIFIER_GLOBAL_VALUE (DECL_ASSEMBLER_NAME (r
))
5796 SET_IDENTIFIER_GLOBAL_VALUE (DECL_ASSEMBLER_NAME (r
), r
);
5798 /* We're not supposed to instantiate default arguments
5799 until they are called, for a template. But, for a
5802 template <class T> void f ()
5803 { extern void g(int i = T()); }
5805 we should do the substitution when the template is
5806 instantiated. We handle the member function case in
5807 instantiate_class_template since the default arguments
5808 might refer to other members of the class. */
5810 && !PRIMARY_TEMPLATE_P (gen_tmpl
)
5811 && !uses_template_parms (argvec
))
5812 tsubst_default_arguments (r
);
5815 /* Copy the list of befriending classes. */
5816 for (friends
= &DECL_BEFRIENDING_CLASSES (r
);
5818 friends
= &TREE_CHAIN (*friends
))
5820 *friends
= copy_node (*friends
);
5821 TREE_VALUE (*friends
) = tsubst (TREE_VALUE (*friends
),
5822 args
, /*complain=*/1,
5826 if (DECL_CONSTRUCTOR_P (r
) || DECL_DESTRUCTOR_P (r
))
5828 maybe_retrofit_in_chrg (r
);
5829 if (DECL_CONSTRUCTOR_P (r
))
5830 grok_ctor_properties (ctx
, r
);
5831 /* If this is an instantiation of a member template, clone it.
5832 If it isn't, that'll be handled by
5833 clone_constructors_and_destructors. */
5834 if (PRIMARY_TEMPLATE_P (gen_tmpl
))
5835 clone_function_decl(r
, /*update_method_vec_p=*/0);
5837 else if (IDENTIFIER_OPNAME_P (DECL_NAME (r
)))
5838 grok_op_properties (r
, DECL_VIRTUAL_P (r
), DECL_FRIEND_P (r
));
5845 TREE_TYPE (r
) = type
;
5846 c_apply_type_quals_to_decl (CP_TYPE_QUALS (type
), r
);
5848 if (TREE_CODE (DECL_INITIAL (r
)) != TEMPLATE_PARM_INDEX
)
5849 DECL_INITIAL (r
) = TREE_TYPE (r
);
5851 DECL_INITIAL (r
) = tsubst (DECL_INITIAL (r
), args
,
5852 /*complain=*/1, in_decl
);
5854 DECL_CONTEXT (r
) = NULL_TREE
;
5855 if (PROMOTE_PROTOTYPES
5856 && (TREE_CODE (type
) == INTEGER_TYPE
5857 || TREE_CODE (type
) == ENUMERAL_TYPE
)
5858 && TYPE_PRECISION (type
) < TYPE_PRECISION (integer_type_node
))
5859 DECL_ARG_TYPE (r
) = integer_type_node
;
5861 TREE_CHAIN (r
) = tsubst (TREE_CHAIN (t
), args
,
5862 /*complain=*/1, TREE_CHAIN (t
));
5869 TREE_TYPE (r
) = type
;
5870 c_apply_type_quals_to_decl (CP_TYPE_QUALS (type
), r
);
5872 /* We don't have to set DECL_CONTEXT here; it is set by
5873 finish_member_declaration. */
5874 DECL_INITIAL (r
) = tsubst_expr (DECL_INITIAL (t
), args
,
5875 /*complain=*/1, in_decl
);
5876 TREE_CHAIN (r
) = NULL_TREE
;
5877 if (TREE_CODE (type
) == VOID_TYPE
)
5878 cp_error_at ("instantiation of `%D' as type void", r
);
5886 = tsubst_copy (DECL_INITIAL (t
), args
, /*complain=*/1, in_decl
);
5887 TREE_CHAIN (r
) = NULL_TREE
;
5892 if (TREE_CODE (type
) == TEMPLATE_TEMPLATE_PARM
5893 || t
== TYPE_MAIN_DECL (TREE_TYPE (t
)))
5895 /* If this is the canonical decl, we don't have to mess with
5896 instantiations, and often we can't (for typename, template
5897 type parms and such). Note that TYPE_NAME is not correct for
5898 the above test if we've copied the type for a typedef. */
5899 r
= TYPE_NAME (type
);
5907 tree argvec
= NULL_TREE
;
5908 tree gen_tmpl
= NULL_TREE
;
5910 tree tmpl
= NULL_TREE
;
5914 /* Assume this is a non-local variable. */
5917 if (TYPE_P (CP_DECL_CONTEXT (t
)))
5918 ctx
= tsubst_aggr_type (DECL_CONTEXT (t
), args
,
5920 in_decl
, /*entering_scope=*/1);
5923 /* Subsequent calls to pushdecl will fill this in. */
5925 if (!DECL_NAMESPACE_SCOPE_P (t
))
5929 /* Check to see if we already have this specialization. */
5932 tmpl
= DECL_TI_TEMPLATE (t
);
5933 gen_tmpl
= most_general_template (tmpl
);
5934 argvec
= tsubst (DECL_TI_ARGS (t
), args
, /*complain=*/1, in_decl
);
5935 spec
= retrieve_specialization (gen_tmpl
, argvec
);
5938 spec
= retrieve_local_specialization (t
);
5947 TREE_TYPE (r
) = type
;
5948 c_apply_type_quals_to_decl (CP_TYPE_QUALS (type
), r
);
5949 DECL_CONTEXT (r
) = ctx
;
5951 /* Don't try to expand the initializer until someone tries to use
5952 this variable; otherwise we run into circular dependencies. */
5953 DECL_INITIAL (r
) = NULL_TREE
;
5955 DECL_SIZE (r
) = DECL_SIZE_UNIT (r
) = 0;
5957 /* For __PRETTY_FUNCTION__ we have to adjust the initializer. */
5958 if (DECL_PRETTY_FUNCTION_P (r
))
5960 DECL_INITIAL (r
) = tsubst (DECL_INITIAL (t
),
5964 TREE_TYPE (r
) = TREE_TYPE (DECL_INITIAL (r
));
5967 /* Even if the original location is out of scope, the newly
5968 substituted one is not. */
5969 if (TREE_CODE (r
) == VAR_DECL
)
5970 DECL_DEAD_FOR_LOCAL (r
) = 0;
5974 /* A static data member declaration is always marked
5975 external when it is declared in-class, even if an
5976 initializer is present. We mimic the non-template
5978 DECL_EXTERNAL (r
) = 1;
5980 register_specialization (r
, gen_tmpl
, argvec
);
5981 DECL_TEMPLATE_INFO (r
) = tree_cons (tmpl
, argvec
, NULL_TREE
);
5982 SET_DECL_IMPLICIT_INSTANTIATION (r
);
5985 register_local_specialization (r
, t
);
5987 TREE_CHAIN (r
) = NULL_TREE
;
5988 if (TREE_CODE (r
) == VAR_DECL
&& TREE_CODE (type
) == VOID_TYPE
)
5989 cp_error_at ("instantiation of `%D' as type void", r
);
5994 my_friendly_abort (0);
5997 /* Restore the file and line information. */
5998 lineno
= saved_lineno
;
5999 input_filename
= saved_filename
;
6004 /* Substitue into the ARG_TYPES of a function type. */
6007 tsubst_arg_types (arg_types
, args
, complain
, in_decl
)
6013 tree remaining_arg_types
;
6016 if (!arg_types
|| arg_types
== void_list_node
)
6019 remaining_arg_types
= tsubst_arg_types (TREE_CHAIN (arg_types
),
6020 args
, complain
, in_decl
);
6021 if (remaining_arg_types
== error_mark_node
)
6022 return error_mark_node
;
6024 type
= tsubst (TREE_VALUE (arg_types
), args
, complain
, in_decl
);
6025 if (type
== error_mark_node
)
6026 return error_mark_node
;
6028 /* Do array-to-pointer, function-to-pointer conversion, and ignore
6029 top-level qualifiers as required. */
6030 type
= TYPE_MAIN_VARIANT (type_decays_to (type
));
6032 /* Note that we do not substitute into default arguments here. The
6033 standard mandates that they be instantiated only when needed,
6034 which is done in build_over_call. */
6035 return hash_tree_cons (TREE_PURPOSE (arg_types
), type
,
6036 remaining_arg_types
);
6040 /* Substitute into a FUNCTION_TYPE or METHOD_TYPE. This routine does
6041 *not* handle the exception-specification for FNTYPE, because the
6042 initial substitution of explicitly provided template parameters
6043 during argument deduction forbids substitution into the
6044 exception-specification:
6048 All references in the function type of the function template to the
6049 corresponding template parameters are replaced by the specified tem-
6050 plate argument values. If a substitution in a template parameter or
6051 in the function type of the function template results in an invalid
6052 type, type deduction fails. [Note: The equivalent substitution in
6053 exception specifications is done only when the function is instanti-
6054 ated, at which point a program is ill-formed if the substitution
6055 results in an invalid type.] */
6058 tsubst_function_type (t
, args
, complain
, in_decl
)
6068 /* The TYPE_CONTEXT is not used for function/method types. */
6069 my_friendly_assert (TYPE_CONTEXT (t
) == NULL_TREE
, 0);
6071 /* Substitue the return type. */
6072 return_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
6073 if (return_type
== error_mark_node
)
6074 return error_mark_node
;
6076 /* Substitue the argument types. */
6077 arg_types
= tsubst_arg_types (TYPE_ARG_TYPES (t
), args
,
6079 if (arg_types
== error_mark_node
)
6080 return error_mark_node
;
6082 /* Construct a new type node and return it. */
6083 if (TREE_CODE (t
) == FUNCTION_TYPE
)
6084 fntype
= build_function_type (return_type
, arg_types
);
6087 tree r
= TREE_TYPE (TREE_VALUE (arg_types
));
6088 if (! IS_AGGR_TYPE (r
))
6092 Type deduction may fail for any of the following
6095 -- Attempting to create "pointer to member of T" when T
6096 is not a class type. */
6098 cp_error ("creating pointer to member function of non-class type `%T'",
6100 return error_mark_node
;
6103 fntype
= build_cplus_method_type (r
, return_type
, TREE_CHAIN
6106 fntype
= build_qualified_type (fntype
, TYPE_QUALS (t
));
6107 fntype
= build_type_attribute_variant (fntype
, TYPE_ATTRIBUTES (t
));
6112 /* Substitute into the PARMS of a call-declarator. */
6115 tsubst_call_declarator_parms (parms
, args
, complain
, in_decl
)
6125 if (!parms
|| parms
== void_list_node
)
6128 new_parms
= tsubst_call_declarator_parms (TREE_CHAIN (parms
),
6129 args
, complain
, in_decl
);
6131 /* Figure out the type of this parameter. */
6132 type
= tsubst (TREE_VALUE (parms
), args
, complain
, in_decl
);
6134 /* Figure out the default argument as well. Note that we use
6135 tsubst_expr since the default argument is really an expression. */
6136 defarg
= tsubst_expr (TREE_PURPOSE (parms
), args
, complain
, in_decl
);
6138 /* Chain this parameter on to the front of those we have already
6139 processed. We don't use hash_tree_cons because that function
6140 doesn't check TREE_PARMLIST. */
6141 new_parms
= tree_cons (defarg
, type
, new_parms
);
6143 /* And note that these are parameters. */
6144 TREE_PARMLIST (new_parms
) = 1;
6149 /* Take the tree structure T and replace template parameters used
6150 therein with the argument vector ARGS. IN_DECL is an associated
6151 decl for diagnostics. If an error occurs, returns ERROR_MARK_NODE.
6152 An appropriate error message is issued only if COMPLAIN is
6153 non-zero. Note that we must be relatively non-tolerant of
6154 extensions here, in order to preserve conformance; if we allow
6155 substitutions that should not be allowed, we may allow argument
6156 deductions that should not succeed, and therefore report ambiguous
6157 overload situations where there are none. In theory, we could
6158 allow the substitution, but indicate that it should have failed,
6159 and allow our caller to make sure that the right thing happens, but
6160 we don't try to do this yet.
6162 This function is used for dealing with types, decls and the like;
6163 for expressions, use tsubst_expr or tsubst_copy. */
6166 tsubst (t
, args
, complain
, in_decl
)
6173 if (t
== NULL_TREE
|| t
== error_mark_node
6174 || t
== integer_type_node
6175 || t
== void_type_node
6176 || t
== char_type_node
6177 || TREE_CODE (t
) == NAMESPACE_DECL
)
6180 if (TREE_CODE (t
) == IDENTIFIER_NODE
)
6181 type
= IDENTIFIER_TYPE_VALUE (t
);
6183 type
= TREE_TYPE (t
);
6184 if (type
== unknown_type_node
)
6185 my_friendly_abort (42);
6187 if (type
&& TREE_CODE (t
) != FUNCTION_DECL
6188 && TREE_CODE (t
) != TYPENAME_TYPE
6189 && TREE_CODE (t
) != TEMPLATE_DECL
6190 && TREE_CODE (t
) != IDENTIFIER_NODE
6191 && TREE_CODE (t
) != FUNCTION_TYPE
6192 && TREE_CODE (t
) != METHOD_TYPE
)
6193 type
= tsubst (type
, args
, complain
, in_decl
);
6194 if (type
== error_mark_node
)
6195 return error_mark_node
;
6198 return tsubst_decl (t
, args
, type
, in_decl
);
6200 switch (TREE_CODE (t
))
6205 return tsubst_aggr_type (t
, args
, complain
, in_decl
,
6206 /*entering_scope=*/0);
6209 case IDENTIFIER_NODE
:
6222 if (t
== integer_type_node
)
6225 if (TREE_CODE (TYPE_MIN_VALUE (t
)) == INTEGER_CST
6226 && TREE_CODE (TYPE_MAX_VALUE (t
)) == INTEGER_CST
)
6230 tree max
, omax
= TREE_OPERAND (TYPE_MAX_VALUE (t
), 0);
6232 max
= tsubst_expr (omax
, args
, complain
, in_decl
);
6233 if (max
== error_mark_node
)
6234 return error_mark_node
;
6236 /* See if we can reduce this expression to something simpler. */
6237 max
= maybe_fold_nontype_arg (max
);
6238 if (!processing_template_decl
)
6239 max
= decl_constant_value (max
);
6241 if (processing_template_decl
6242 /* When providing explicit arguments to a template
6243 function, but leaving some arguments for subsequent
6244 deduction, MAX may be template-dependent even if we're
6245 not PROCESSING_TEMPLATE_DECL. We still need to check for
6246 template parms, though; MAX won't be an INTEGER_CST for
6247 dynamic arrays, either. */
6248 || (TREE_CODE (max
) != INTEGER_CST
6249 && uses_template_parms (max
)))
6251 tree itype
= make_node (INTEGER_TYPE
);
6252 TYPE_MIN_VALUE (itype
) = size_zero_node
;
6253 TYPE_MAX_VALUE (itype
) = build_min (MINUS_EXPR
, sizetype
, max
,
6258 if (integer_zerop (omax
))
6260 /* Still allow an explicit array of size zero. */
6262 pedwarn ("creating array with size zero");
6264 else if (integer_zerop (max
)
6265 || (TREE_CODE (max
) == INTEGER_CST
6266 && INT_CST_LT (max
, integer_zero_node
)))
6270 Type deduction may fail for any of the following
6273 Attempting to create an array with a size that is
6274 zero or negative. */
6276 cp_error ("creating array with size zero (`%E')", max
);
6278 return error_mark_node
;
6281 return compute_array_index_type (NULL_TREE
, max
);
6284 case TEMPLATE_TYPE_PARM
:
6285 case TEMPLATE_TEMPLATE_PARM
:
6286 case BOUND_TEMPLATE_TEMPLATE_PARM
:
6287 case TEMPLATE_PARM_INDEX
:
6295 if (TREE_CODE (t
) == TEMPLATE_TYPE_PARM
6296 || TREE_CODE (t
) == TEMPLATE_TEMPLATE_PARM
6297 || TREE_CODE (t
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
6299 idx
= TEMPLATE_TYPE_IDX (t
);
6300 level
= TEMPLATE_TYPE_LEVEL (t
);
6304 idx
= TEMPLATE_PARM_IDX (t
);
6305 level
= TEMPLATE_PARM_LEVEL (t
);
6308 if (TREE_VEC_LENGTH (args
) > 0)
6310 tree arg
= NULL_TREE
;
6312 levels
= TMPL_ARGS_DEPTH (args
);
6313 if (level
<= levels
)
6314 arg
= TMPL_ARG (args
, level
, idx
);
6316 if (arg
== error_mark_node
)
6317 return error_mark_node
;
6318 else if (arg
!= NULL_TREE
)
6320 if (TREE_CODE (t
) == TEMPLATE_TYPE_PARM
)
6322 my_friendly_assert (TYPE_P (arg
), 0);
6323 return cp_build_qualified_type_real
6324 (arg
, CP_TYPE_QUALS (arg
) | CP_TYPE_QUALS (t
),
6327 else if (TREE_CODE (t
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
6329 /* We are processing a type constructed from
6330 a template template parameter */
6331 tree argvec
= tsubst (TYPE_TI_ARGS (t
),
6332 args
, complain
, in_decl
);
6333 if (argvec
== error_mark_node
)
6334 return error_mark_node
;
6336 /* We can get a TEMPLATE_TEMPLATE_PARM here when
6337 we are resolving nested-types in the signature of
6338 a member function templates.
6339 Otherwise ARG is a TEMPLATE_DECL and is the real
6340 template to be instantiated. */
6341 if (TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
)
6342 arg
= TYPE_NAME (arg
);
6344 r
= lookup_template_class (arg
,
6347 /*entering_scope=*/0);
6348 return cp_build_qualified_type_real (r
,
6353 /* TEMPLATE_TEMPLATE_PARM or TEMPLATE_PARM_INDEX. */
6358 my_friendly_abort (981018);
6361 /* This can happen during the attempted tsubst'ing in
6362 unify. This means that we don't yet have any information
6363 about the template parameter in question. */
6366 /* If we get here, we must have been looking at a parm for a
6367 more deeply nested template. Make a new version of this
6368 template parameter, but with a lower level. */
6369 switch (TREE_CODE (t
))
6371 case TEMPLATE_TYPE_PARM
:
6372 case TEMPLATE_TEMPLATE_PARM
:
6373 case BOUND_TEMPLATE_TEMPLATE_PARM
:
6374 if (CP_TYPE_QUALS (t
))
6376 r
= tsubst (TYPE_MAIN_VARIANT (t
), args
, complain
, in_decl
);
6377 r
= cp_build_qualified_type_real (r
, CP_TYPE_QUALS (t
),
6383 TEMPLATE_TYPE_PARM_INDEX (r
)
6384 = reduce_template_parm_level (TEMPLATE_TYPE_PARM_INDEX (t
),
6386 TYPE_STUB_DECL (r
) = TYPE_NAME (r
) = TEMPLATE_TYPE_DECL (r
);
6387 TYPE_MAIN_VARIANT (r
) = r
;
6388 TYPE_POINTER_TO (r
) = NULL_TREE
;
6389 TYPE_REFERENCE_TO (r
) = NULL_TREE
;
6391 if (TREE_CODE (t
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
6393 tree argvec
= tsubst (TYPE_TI_ARGS (t
), args
,
6395 if (argvec
== error_mark_node
)
6396 return error_mark_node
;
6398 TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (r
)
6399 = tree_cons (TYPE_TI_TEMPLATE (t
), argvec
, NULL_TREE
);
6404 case TEMPLATE_PARM_INDEX
:
6405 r
= reduce_template_parm_level (t
, type
, levels
);
6409 my_friendly_abort (0);
6417 tree purpose
, value
, chain
, result
;
6419 if (t
== void_list_node
)
6422 purpose
= TREE_PURPOSE (t
);
6425 purpose
= tsubst (purpose
, args
, complain
, in_decl
);
6426 if (purpose
== error_mark_node
)
6427 return error_mark_node
;
6429 value
= TREE_VALUE (t
);
6432 value
= tsubst (value
, args
, complain
, in_decl
);
6433 if (value
== error_mark_node
)
6434 return error_mark_node
;
6436 chain
= TREE_CHAIN (t
);
6437 if (chain
&& chain
!= void_type_node
)
6439 chain
= tsubst (chain
, args
, complain
, in_decl
);
6440 if (chain
== error_mark_node
)
6441 return error_mark_node
;
6443 if (purpose
== TREE_PURPOSE (t
)
6444 && value
== TREE_VALUE (t
)
6445 && chain
== TREE_CHAIN (t
))
6447 result
= hash_tree_cons (purpose
, value
, chain
);
6448 TREE_PARMLIST (result
) = TREE_PARMLIST (t
);
6452 if (type
!= NULL_TREE
)
6454 /* A binfo node. We always need to make a copy, of the node
6455 itself and of its BINFO_BASETYPES. */
6459 /* Make sure type isn't a typedef copy. */
6460 type
= BINFO_TYPE (TYPE_BINFO (type
));
6462 TREE_TYPE (t
) = complete_type (type
);
6463 if (IS_AGGR_TYPE (type
))
6465 BINFO_VTABLE (t
) = TYPE_BINFO_VTABLE (type
);
6466 BINFO_VIRTUALS (t
) = TYPE_BINFO_VIRTUALS (type
);
6467 if (TYPE_BINFO_BASETYPES (type
) != NULL_TREE
)
6468 BINFO_BASETYPES (t
) = copy_node (TYPE_BINFO_BASETYPES (type
));
6473 /* Otherwise, a vector of template arguments. */
6474 return tsubst_template_arg_vector (t
, args
, complain
);
6477 case REFERENCE_TYPE
:
6479 enum tree_code code
;
6481 if (type
== TREE_TYPE (t
))
6484 code
= TREE_CODE (t
);
6489 Type deduction may fail for any of the following
6492 -- Attempting to create a pointer to reference type.
6493 -- Attempting to create a reference to a reference type or
6494 a reference to void. */
6495 if (TREE_CODE (type
) == REFERENCE_TYPE
6496 || (code
== REFERENCE_TYPE
&& TREE_CODE (type
) == VOID_TYPE
))
6498 static int last_line
= 0;
6499 static const char* last_file
= 0;
6501 /* We keep track of the last time we issued this error
6502 message to avoid spewing a ton of messages during a
6503 single bad template instantiation. */
6504 if (complain
&& (last_line
!= lineno
||
6505 last_file
!= input_filename
))
6507 if (TREE_CODE (type
) == VOID_TYPE
)
6508 cp_error ("forming reference to void");
6510 cp_error ("forming %s to reference type `%T'",
6511 (code
== POINTER_TYPE
) ? "pointer" : "reference",
6514 last_file
= input_filename
;
6517 return error_mark_node
;
6519 else if (code
== POINTER_TYPE
)
6520 r
= build_pointer_type (type
);
6522 r
= build_reference_type (type
);
6523 r
= cp_build_qualified_type_real (r
, TYPE_QUALS (t
), complain
);
6525 if (r
!= error_mark_node
)
6526 /* Will this ever be needed for TYPE_..._TO values? */
6533 r
= tsubst (TYPE_OFFSET_BASETYPE (t
), args
, complain
, in_decl
);
6534 if (r
== error_mark_node
|| !IS_AGGR_TYPE (r
))
6538 Type deduction may fail for any of the following
6541 -- Attempting to create "pointer to member of T" when T
6542 is not a class type. */
6544 cp_error ("creating pointer to member of non-class type `%T'",
6546 return error_mark_node
;
6548 return build_offset_type (r
, type
);
6556 fntype
= tsubst_function_type (t
, args
, complain
, in_decl
);
6557 if (fntype
== error_mark_node
)
6558 return error_mark_node
;
6560 /* Substitue the exception specification. */
6561 raises
= TYPE_RAISES_EXCEPTIONS (t
);
6564 tree list
= NULL_TREE
;
6566 if (! TREE_VALUE (raises
))
6569 for (; raises
!= NULL_TREE
; raises
= TREE_CHAIN (raises
))
6571 tree spec
= TREE_VALUE (raises
);
6573 spec
= tsubst (spec
, args
, complain
, in_decl
);
6574 if (spec
== error_mark_node
)
6576 list
= add_exception_specifier (list
, spec
, complain
);
6578 fntype
= build_exception_variant (fntype
, list
);
6584 tree domain
= tsubst (TYPE_DOMAIN (t
), args
, complain
, in_decl
);
6585 if (domain
== error_mark_node
)
6586 return error_mark_node
;
6588 /* As an optimization, we avoid regenerating the array type if
6589 it will obviously be the same as T. */
6590 if (type
== TREE_TYPE (t
) && domain
== TYPE_DOMAIN (t
))
6593 /* These checks should match the ones in grokdeclarator.
6597 The deduction may fail for any of the following reasons:
6599 -- Attempting to create an array with an element type that
6600 is void, a function type, or a reference type. */
6601 if (TREE_CODE (type
) == VOID_TYPE
6602 || TREE_CODE (type
) == FUNCTION_TYPE
6603 || TREE_CODE (type
) == REFERENCE_TYPE
)
6606 cp_error ("creating array of `%T'", type
);
6607 return error_mark_node
;
6610 r
= build_cplus_array_type (type
, domain
);
6617 tree e1
= tsubst (TREE_OPERAND (t
, 0), args
, complain
,
6619 tree e2
= tsubst (TREE_OPERAND (t
, 1), args
, complain
,
6622 if (e1
== error_mark_node
|| e2
== error_mark_node
)
6623 return error_mark_node
;
6625 return fold (build (TREE_CODE (t
), TREE_TYPE (t
), e1
, e2
));
6631 tree e
= tsubst (TREE_OPERAND (t
, 0), args
, complain
,
6633 if (e
== error_mark_node
)
6634 return error_mark_node
;
6636 return fold (build (TREE_CODE (t
), TREE_TYPE (t
), e
));
6641 tree ctx
= tsubst_aggr_type (TYPE_CONTEXT (t
), args
, complain
,
6642 in_decl
, /*entering_scope=*/1);
6643 tree f
= tsubst_copy (TYPENAME_TYPE_FULLNAME (t
), args
,
6646 if (ctx
== error_mark_node
|| f
== error_mark_node
)
6647 return error_mark_node
;
6649 if (!IS_AGGR_TYPE (ctx
))
6652 cp_error ("`%T' is not a class, struct, or union type",
6654 return error_mark_node
;
6656 else if (!uses_template_parms (ctx
) && !TYPE_BEING_DEFINED (ctx
))
6658 /* Normally, make_typename_type does not require that the CTX
6659 have complete type in order to allow things like:
6661 template <class T> struct S { typename S<T>::X Y; };
6663 But, such constructs have already been resolved by this
6664 point, so here CTX really should have complete type, unless
6665 it's a partial instantiation. */
6666 ctx
= complete_type (ctx
);
6667 if (!COMPLETE_TYPE_P (ctx
))
6670 incomplete_type_error (NULL_TREE
, ctx
);
6671 return error_mark_node
;
6675 f
= make_typename_type (ctx
, f
, complain
);
6676 if (f
== error_mark_node
)
6678 return cp_build_qualified_type_real (f
,
6680 | CP_TYPE_QUALS (t
),
6686 tree e
= tsubst (TREE_OPERAND (t
, 0), args
, complain
,
6688 if (e
== error_mark_node
)
6689 return error_mark_node
;
6690 return make_pointer_declarator (type
, e
);
6695 tree e
= tsubst (TREE_OPERAND (t
, 0), args
, complain
,
6697 if (e
== error_mark_node
)
6698 return error_mark_node
;
6699 return make_reference_declarator (type
, e
);
6704 tree e1
= tsubst (TREE_OPERAND (t
, 0), args
, complain
,
6706 tree e2
= tsubst_expr (TREE_OPERAND (t
, 1), args
, complain
,
6708 if (e1
== error_mark_node
|| e2
== error_mark_node
)
6709 return error_mark_node
;
6711 return build_parse_node (ARRAY_REF
, e1
, e2
, tsubst_expr
);
6716 tree e1
= tsubst (TREE_OPERAND (t
, 0), args
, complain
,
6718 tree e2
= (tsubst_call_declarator_parms
6719 (CALL_DECLARATOR_PARMS (t
), args
, complain
, in_decl
));
6720 tree e3
= tsubst (CALL_DECLARATOR_EXCEPTION_SPEC (t
), args
,
6723 if (e1
== error_mark_node
|| e2
== error_mark_node
6724 || e3
== error_mark_node
)
6725 return error_mark_node
;
6727 return make_call_declarator (e1
, e2
, CALL_DECLARATOR_QUALS (t
), e3
);
6732 tree e1
= tsubst (TREE_OPERAND (t
, 0), args
, complain
,
6734 tree e2
= tsubst (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
6735 if (e1
== error_mark_node
|| e2
== error_mark_node
)
6736 return error_mark_node
;
6738 return build_parse_node (TREE_CODE (t
), e1
, e2
);
6743 tree e1
= tsubst_expr (TYPE_FIELDS (t
), args
, complain
,
6745 if (e1
== error_mark_node
)
6746 return error_mark_node
;
6748 return TREE_TYPE (e1
);
6758 /* This code should match declare_hidden_char_array in
6760 name
= (*decl_printable_name
) (current_function_decl
, 2);
6761 len
= strlen (name
) + 1;
6762 type
= build_array_type (char_type_node
,
6763 build_index_type (build_int_2 (len
, 0)));
6764 str
= build_string (len
, name
);
6765 TREE_TYPE (str
) = type
;
6770 sorry ("use of `%s' in template",
6771 tree_code_name
[(int) TREE_CODE (t
)]);
6772 return error_mark_node
;
6776 /* Like tsubst, but deals with expressions. This function just replaces
6777 template parms; to finish processing the resultant expression, use
6781 tsubst_copy (t
, args
, complain
, in_decl
)
6786 enum tree_code code
;
6789 if (t
== NULL_TREE
|| t
== error_mark_node
)
6792 code
= TREE_CODE (t
);
6797 return do_identifier (DECL_NAME (t
), 0, NULL_TREE
);
6804 if (!DECL_CONTEXT (t
))
6805 /* This is a global enumeration constant. */
6808 /* Unfortunately, we cannot just call lookup_name here.
6811 template <int I> int f() {
6813 struct S { void g() { E e = a; } };
6816 When we instantiate f<7>::S::g(), say, lookup_name is not
6817 clever enough to find f<7>::a. */
6819 = tsubst_aggr_type (TREE_TYPE (t
), args
, complain
, in_decl
,
6820 /*entering_scope=*/0);
6822 for (v
= TYPE_VALUES (enum_type
);
6825 if (TREE_PURPOSE (v
) == DECL_NAME (t
))
6826 return TREE_VALUE (v
);
6828 /* We didn't find the name. That should never happen; if
6829 name-lookup found it during preliminary parsing, we
6830 should find it again here during instantiation. */
6831 my_friendly_abort (0);
6836 if (DECL_CONTEXT (t
))
6840 ctx
= tsubst_aggr_type (DECL_CONTEXT (t
), args
, complain
, in_decl
,
6841 /*entering_scope=*/1);
6842 if (ctx
!= DECL_CONTEXT (t
))
6843 return lookup_field (ctx
, DECL_NAME (t
), 0, 0);
6849 if (DECL_LANG_SPECIFIC (t
) && DECL_TEMPLATE_INFO (t
))
6850 t
= tsubst (t
, args
, complain
, in_decl
);
6855 if (is_member_template (t
))
6856 return tsubst (t
, args
, complain
, in_decl
);
6862 /* We must tsbust into a LOOKUP_EXPR in case the names to
6863 which it refers is a conversion operator; in that case the
6864 name will change. We avoid making unnecessary copies,
6867 tree id
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
6869 if (id
!= TREE_OPERAND (t
, 0))
6871 r
= build_nt (LOOKUP_EXPR
, id
);
6872 LOOKUP_EXPR_GLOBAL (r
) = LOOKUP_EXPR_GLOBAL (t
);
6880 case REINTERPRET_CAST_EXPR
:
6881 case CONST_CAST_EXPR
:
6882 case STATIC_CAST_EXPR
:
6883 case DYNAMIC_CAST_EXPR
:
6886 (code
, tsubst (TREE_TYPE (t
), args
, complain
, in_decl
),
6887 tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
));
6890 case PREDECREMENT_EXPR
:
6891 case PREINCREMENT_EXPR
:
6892 case POSTDECREMENT_EXPR
:
6893 case POSTINCREMENT_EXPR
:
6895 case TRUTH_NOT_EXPR
:
6898 case CONVERT_EXPR
: /* Unary + */
6907 (code
, tsubst (TREE_TYPE (t
), args
, complain
, in_decl
),
6908 tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
));
6913 case TRUNC_DIV_EXPR
:
6915 case FLOOR_DIV_EXPR
:
6916 case ROUND_DIV_EXPR
:
6917 case EXACT_DIV_EXPR
:
6919 case BIT_ANDTC_EXPR
:
6922 case TRUNC_MOD_EXPR
:
6923 case FLOOR_MOD_EXPR
:
6924 case TRUTH_ANDIF_EXPR
:
6925 case TRUTH_ORIF_EXPR
:
6926 case TRUTH_AND_EXPR
:
6947 (code
, tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
),
6948 tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
));
6952 tree fn
= TREE_OPERAND (t
, 0);
6953 if (is_overloaded_fn (fn
))
6954 fn
= tsubst_copy (get_first_fn (fn
), args
, complain
, in_decl
);
6956 /* Sometimes FN is a LOOKUP_EXPR. */
6957 fn
= tsubst_copy (fn
, args
, complain
, in_decl
);
6959 (code
, fn
, tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
,
6964 case METHOD_CALL_EXPR
:
6966 tree name
= TREE_OPERAND (t
, 0);
6967 if (TREE_CODE (name
) == BIT_NOT_EXPR
)
6969 name
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
6971 name
= build1 (BIT_NOT_EXPR
, NULL_TREE
, name
);
6973 else if (TREE_CODE (name
) == SCOPE_REF
6974 && TREE_CODE (TREE_OPERAND (name
, 1)) == BIT_NOT_EXPR
)
6976 tree base
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
6978 name
= TREE_OPERAND (name
, 1);
6979 name
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
6981 name
= build1 (BIT_NOT_EXPR
, NULL_TREE
, name
);
6982 name
= build_nt (SCOPE_REF
, base
, name
);
6985 name
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
6987 (code
, name
, tsubst_copy (TREE_OPERAND (t
, 1), args
,
6989 tsubst_copy (TREE_OPERAND (t
, 2), args
, complain
, in_decl
),
6994 /* This processing should really occur in tsubst_expr, However,
6995 tsubst_expr does not recurse into expressions, since it
6996 assumes that there aren't any statements inside them.
6997 Instead, it simply calls build_expr_from_tree. So, we need
6998 to expand the STMT_EXPR here. */
6999 if (!processing_template_decl
)
7001 tree stmt_expr
= begin_stmt_expr ();
7002 tsubst_expr (STMT_EXPR_STMT (t
), args
,
7004 return finish_stmt_expr (stmt_expr
);
7011 case PSEUDO_DTOR_EXPR
:
7014 (code
, tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
),
7015 tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
),
7016 tsubst_copy (TREE_OPERAND (t
, 2), args
, complain
, in_decl
));
7023 (code
, tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
),
7024 tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
),
7025 tsubst_copy (TREE_OPERAND (t
, 2), args
, complain
, in_decl
));
7026 NEW_EXPR_USE_GLOBAL (r
) = NEW_EXPR_USE_GLOBAL (t
);
7033 (code
, tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
),
7034 tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
));
7035 DELETE_EXPR_USE_GLOBAL (r
) = DELETE_EXPR_USE_GLOBAL (t
);
7036 DELETE_EXPR_USE_VEC (r
) = DELETE_EXPR_USE_VEC (t
);
7040 case TEMPLATE_ID_EXPR
:
7042 /* Substituted template arguments */
7043 tree targs
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
,
7046 if (targs
&& TREE_CODE (targs
) == TREE_LIST
)
7049 for (chain
= targs
; chain
; chain
= TREE_CHAIN (chain
))
7050 TREE_VALUE (chain
) = maybe_fold_nontype_arg (TREE_VALUE (chain
));
7055 for (i
= 0; i
< TREE_VEC_LENGTH (targs
); ++i
)
7056 TREE_VEC_ELT (targs
, i
)
7057 = maybe_fold_nontype_arg (TREE_VEC_ELT (targs
, i
));
7060 return lookup_template_function
7061 (tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
), targs
);
7066 tree purpose
, value
, chain
;
7068 if (t
== void_list_node
)
7071 purpose
= TREE_PURPOSE (t
);
7073 purpose
= tsubst_copy (purpose
, args
, complain
, in_decl
);
7074 value
= TREE_VALUE (t
);
7076 value
= tsubst_copy (value
, args
, complain
, in_decl
);
7077 chain
= TREE_CHAIN (t
);
7078 if (chain
&& chain
!= void_type_node
)
7079 chain
= tsubst_copy (chain
, args
, complain
, in_decl
);
7080 if (purpose
== TREE_PURPOSE (t
)
7081 && value
== TREE_VALUE (t
)
7082 && chain
== TREE_CHAIN (t
))
7084 return tree_cons (purpose
, value
, chain
);
7091 case TEMPLATE_TYPE_PARM
:
7092 case TEMPLATE_TEMPLATE_PARM
:
7093 case BOUND_TEMPLATE_TEMPLATE_PARM
:
7094 case TEMPLATE_PARM_INDEX
:
7096 case REFERENCE_TYPE
:
7103 return tsubst (t
, args
, complain
, in_decl
);
7105 case IDENTIFIER_NODE
:
7106 if (IDENTIFIER_TYPENAME_P (t
))
7108 tree new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
7110 return mangle_conv_op_name_for_type (new_type
);
7112 return (build_typename_overload (new_type
));
7120 (CONSTRUCTOR
, tsubst (TREE_TYPE (t
), args
, complain
, in_decl
),
7121 NULL_TREE
, tsubst_copy (CONSTRUCTOR_ELTS (t
), args
,
7122 complain
, in_decl
));
7123 TREE_HAS_CONSTRUCTOR (r
) = TREE_HAS_CONSTRUCTOR (t
);
7128 return build_x_va_arg (tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
,
7130 tsubst (TREE_TYPE (t
), args
, complain
, in_decl
));
7133 return tsubst (t
, args
, complain
, in_decl
);
7140 /* Like tsubst_copy, but also does semantic processing. */
7143 tsubst_expr (t
, args
, complain
, in_decl
)
7150 if (t
== NULL_TREE
|| t
== error_mark_node
)
7153 if (processing_template_decl
)
7154 return tsubst_copy (t
, args
, complain
, in_decl
);
7156 switch (TREE_CODE (t
))
7160 finish_named_return_value
7161 (TREE_OPERAND (t
, 0),
7162 tsubst_expr (TREE_OPERAND (t
, 1), args
, /*complain=*/1, in_decl
));
7163 tsubst_expr (TREE_CHAIN (t
), args
, complain
, in_decl
);
7166 case CTOR_INITIALIZER
:
7168 tree member_init_list
;
7169 tree base_init_list
;
7173 = tsubst_initializer_list (TREE_OPERAND (t
, 0), args
);
7175 = tsubst_initializer_list (TREE_OPERAND (t
, 1), args
);
7176 setup_vtbl_ptr (member_init_list
, base_init_list
);
7177 tsubst_expr (TREE_CHAIN (t
), args
, complain
, in_decl
);
7183 finish_return_stmt (tsubst_expr (RETURN_EXPR (t
),
7184 args
, complain
, in_decl
));
7189 finish_expr_stmt (tsubst_expr (EXPR_STMT_EXPR (t
),
7190 args
, complain
, in_decl
));
7199 decl
= DECL_STMT_DECL (t
);
7200 if (TREE_CODE (decl
) == LABEL_DECL
)
7201 finish_label_decl (DECL_NAME (decl
));
7204 init
= DECL_INITIAL (decl
);
7205 decl
= tsubst (decl
, args
, complain
, in_decl
);
7206 init
= tsubst_expr (init
, args
, complain
, in_decl
);
7207 if (decl
!= error_mark_node
)
7209 if (TREE_CODE (decl
) != TYPE_DECL
)
7210 /* Make sure the type is instantiated now. */
7211 complete_type (TREE_TYPE (decl
));
7213 DECL_INITIAL (decl
) = error_mark_node
;
7214 /* By marking the declaration as instantiated, we avoid
7215 trying to instantiate it. Since instantiate_decl can't
7216 handle local variables, and since we've already done
7217 all that needs to be done, that's the right thing to
7219 if (TREE_CODE (decl
) == VAR_DECL
)
7220 DECL_TEMPLATE_INSTANTIATED (decl
) = 1;
7221 maybe_push_decl (decl
);
7222 cp_finish_decl (decl
, init
, NULL_TREE
, 0);
7233 stmt
= begin_for_stmt ();
7234 for (tmp
= FOR_INIT_STMT (t
); tmp
; tmp
= TREE_CHAIN (tmp
))
7235 tsubst_expr (tmp
, args
, complain
, in_decl
);
7236 finish_for_init_stmt (stmt
);
7237 finish_for_cond (tsubst_expr (FOR_COND (t
), args
,
7240 tmp
= tsubst_expr (FOR_EXPR (t
), args
, complain
, in_decl
);
7241 finish_for_expr (tmp
, stmt
);
7242 tsubst_expr (FOR_BODY (t
), args
, complain
, in_decl
);
7243 finish_for_stmt (stmt
);
7250 stmt
= begin_while_stmt ();
7251 finish_while_stmt_cond (tsubst_expr (WHILE_COND (t
),
7252 args
, complain
, in_decl
),
7254 tsubst_expr (WHILE_BODY (t
), args
, complain
, in_decl
);
7255 finish_while_stmt (stmt
);
7262 stmt
= begin_do_stmt ();
7263 tsubst_expr (DO_BODY (t
), args
, complain
, in_decl
);
7264 finish_do_body (stmt
);
7265 finish_do_stmt (tsubst_expr (DO_COND (t
), args
,
7276 stmt
= begin_if_stmt ();
7277 finish_if_stmt_cond (tsubst_expr (IF_COND (t
),
7278 args
, complain
, in_decl
),
7281 if (tmp
= THEN_CLAUSE (t
), tmp
)
7283 tsubst_expr (tmp
, args
, complain
, in_decl
);
7284 finish_then_clause (stmt
);
7287 if (tmp
= ELSE_CLAUSE (t
), tmp
)
7289 begin_else_clause ();
7290 tsubst_expr (tmp
, args
, complain
, in_decl
);
7291 finish_else_clause (stmt
);
7303 stmt
= begin_compound_stmt (COMPOUND_STMT_NO_SCOPE (t
));
7304 for (substmt
= COMPOUND_BODY (t
);
7305 substmt
!= NULL_TREE
;
7306 substmt
= TREE_CHAIN (substmt
))
7307 tsubst_expr (substmt
, args
, complain
, in_decl
);
7308 return finish_compound_stmt (COMPOUND_STMT_NO_SCOPE (t
), stmt
);
7314 finish_break_stmt ();
7319 finish_continue_stmt ();
7327 stmt
= begin_switch_stmt ();
7328 val
= tsubst_expr (SWITCH_COND (t
), args
, complain
, in_decl
);
7329 finish_switch_cond (val
, stmt
);
7330 tsubst_expr (SWITCH_BODY (t
), args
, complain
, in_decl
);
7331 finish_switch_stmt (stmt
);
7337 finish_case_label (tsubst_expr (CASE_LOW (t
), args
, complain
, in_decl
),
7338 tsubst_expr (CASE_HIGH (t
), args
, complain
,
7343 lineno
= STMT_LINENO (t
);
7344 finish_label_stmt (DECL_NAME (LABEL_STMT_LABEL (t
)));
7349 t
= GOTO_DESTINATION (t
);
7350 if (TREE_CODE (t
) != LABEL_DECL
)
7351 /* Computed goto's must be tsubst'd into. On the other hand,
7352 non-computed gotos must not be; the identifier in question
7353 will have no binding. */
7354 t
= tsubst_expr (t
, args
, complain
, in_decl
);
7357 finish_goto_stmt (t
);
7362 finish_asm_stmt (ASM_CV_QUAL (t
),
7363 tsubst_expr (ASM_STRING (t
), args
, complain
, in_decl
),
7364 tsubst_expr (ASM_OUTPUTS (t
), args
, complain
, in_decl
),
7365 tsubst_expr (ASM_INPUTS (t
), args
, complain
, in_decl
),
7366 tsubst_expr (ASM_CLOBBERS (t
), args
, complain
,
7374 stmt
= begin_try_block ();
7375 tsubst_expr (TRY_STMTS (t
), args
, complain
, in_decl
);
7376 finish_cleanup_try_block (stmt
);
7377 finish_cleanup (tsubst_expr (TRY_HANDLERS (t
), args
,
7385 if (FN_TRY_BLOCK_P (t
))
7386 stmt
= begin_function_try_block ();
7388 stmt
= begin_try_block ();
7390 tsubst_expr (TRY_STMTS (t
), args
, complain
, in_decl
);
7392 if (FN_TRY_BLOCK_P (t
))
7393 finish_function_try_block (stmt
);
7395 finish_try_block (stmt
);
7397 handler
= TRY_HANDLERS (t
);
7398 for (; handler
; handler
= TREE_CHAIN (handler
))
7399 tsubst_expr (handler
, args
, complain
, in_decl
);
7400 if (FN_TRY_BLOCK_P (t
))
7401 finish_function_handler_sequence (stmt
);
7403 finish_handler_sequence (stmt
);
7413 stmt
= begin_handler ();
7414 if (HANDLER_PARMS (t
))
7416 decl
= DECL_STMT_DECL (HANDLER_PARMS (t
));
7417 decl
= tsubst (decl
, args
, complain
, in_decl
);
7418 /* Prevent instantiate_decl from trying to instantiate
7419 this variable. We've already done all that needs to be
7421 DECL_TEMPLATE_INSTANTIATED (decl
) = 1;
7425 blocks
= finish_handler_parms (decl
, stmt
);
7426 tsubst_expr (HANDLER_BODY (t
), args
, complain
, in_decl
);
7427 finish_handler (blocks
, stmt
);
7434 tsubst (t
, args
, complain
, NULL_TREE
);
7438 return build_expr_from_tree (tsubst_copy (t
, args
, complain
, in_decl
));
7443 /* TMPL is a TEMPLATE_DECL for a cloned constructor or destructor.
7444 Instantiate it with the ARGS. */
7447 instantiate_clone (tmpl
, args
)
7454 /* Instantiated the cloned function, rather than the clone. */
7455 spec
= instantiate_template (DECL_CLONED_FUNCTION (tmpl
), args
);
7457 /* Then, see if we've already cloned the instantiation. */
7458 for (clone
= TREE_CHAIN (spec
);
7459 clone
&& DECL_CLONED_FUNCTION_P (clone
);
7460 clone
= TREE_CHAIN (clone
))
7461 if (DECL_NAME (clone
) == DECL_NAME (tmpl
))
7464 /* If we haven't, do so know. */
7466 clone_function_decl (spec
, /*update_method_vec_p=*/0);
7469 for (clone
= TREE_CHAIN (spec
);
7470 clone
&& DECL_CLONED_FUNCTION_P (clone
);
7471 clone
= TREE_CHAIN (clone
))
7472 if (DECL_NAME (clone
) == DECL_NAME (tmpl
))
7475 /* We should always have found the clone by now. */
7476 my_friendly_abort (20000411);
7480 /* Instantiate the indicated variable or function template TMPL with
7481 the template arguments in TARG_PTR. */
7484 instantiate_template (tmpl
, targ_ptr
)
7485 tree tmpl
, targ_ptr
;
7494 if (tmpl
== error_mark_node
)
7495 return error_mark_node
;
7497 my_friendly_assert (TREE_CODE (tmpl
) == TEMPLATE_DECL
, 283);
7499 /* If this function is a clone, handle it specially. */
7500 if (DECL_CLONED_FUNCTION_P (tmpl
))
7501 return instantiate_clone (tmpl
, targ_ptr
);
7503 /* Check to see if we already have this specialization. */
7504 spec
= retrieve_specialization (tmpl
, targ_ptr
);
7505 if (spec
!= NULL_TREE
)
7508 gen_tmpl
= most_general_template (tmpl
);
7509 if (tmpl
!= gen_tmpl
)
7511 /* The TMPL is a partial instantiation. To get a full set of
7512 arguments we must add the arguments used to perform the
7513 partial instantiation. */
7514 targ_ptr
= add_outermost_template_args (DECL_TI_ARGS (tmpl
),
7517 /* Check to see if we already have this specialization. */
7518 spec
= retrieve_specialization (gen_tmpl
, targ_ptr
);
7519 if (spec
!= NULL_TREE
)
7523 len
= DECL_NTPARMS (gen_tmpl
);
7524 inner_args
= INNERMOST_TEMPLATE_ARGS (targ_ptr
);
7528 tree t
= TREE_VEC_ELT (inner_args
, i
);
7531 tree nt
= target_type (t
);
7532 if (IS_AGGR_TYPE (nt
) && decl_function_context (TYPE_MAIN_DECL (nt
)))
7534 cp_error ("type `%T' composed from a local class is not a valid template-argument", t
);
7535 cp_error (" trying to instantiate `%D'", gen_tmpl
);
7536 return error_mark_node
;
7541 /* substitute template parameters */
7542 fndecl
= tsubst (DECL_TEMPLATE_RESULT (gen_tmpl
),
7543 targ_ptr
, /*complain=*/1, gen_tmpl
);
7544 /* The DECL_TI_TEMPLATE should always be the immediate parent
7545 template, not the most general template. */
7546 DECL_TI_TEMPLATE (fndecl
) = tmpl
;
7548 if (flag_external_templates
)
7549 add_pending_template (fndecl
);
7551 /* If we've just instantiated the main entry point for a function,
7552 instantiate all the alternate entry points as well. */
7553 for (clone
= TREE_CHAIN (gen_tmpl
);
7554 clone
&& DECL_CLONED_FUNCTION_P (clone
);
7555 clone
= TREE_CHAIN (clone
))
7556 instantiate_template (clone
, targ_ptr
);
7561 /* The FN is a TEMPLATE_DECL for a function. The ARGS are the
7562 arguments that are being used when calling it. TARGS is a vector
7563 into which the deduced template arguments are placed.
7565 Return zero for success, 2 for an incomplete match that doesn't resolve
7566 all the types, and 1 for complete failure. An error message will be
7567 printed only for an incomplete match.
7569 If FN is a conversion operator, or we are trying to produce a specific
7570 specialization, RETURN_TYPE is the return type desired.
7572 The EXPLICIT_TARGS are explicit template arguments provided via a
7575 The parameter STRICT is one of:
7578 We are deducing arguments for a function call, as in
7582 We are deducing arguments for a conversion function, as in
7586 We are deducing arguments when calculating the partial
7587 ordering between specializations of function or class
7588 templates, as in [temp.func.order] and [temp.class.order],
7589 when doing an explicit instantiation as in [temp.explicit],
7590 when determining an explicit specialization as in
7591 [temp.expl.spec], or when taking the address of a function
7592 template, as in [temp.deduct.funcaddr].
7594 LEN is the number of parms to consider before returning success, or -1
7595 for all. This is used in partial ordering to avoid comparing parms for
7596 which no actual argument was passed, since they are not considered in
7597 overload resolution (and are explicitly excluded from consideration in
7598 partial ordering in [temp.func.order]/6). */
7601 fn_type_unification (fn
, explicit_targs
, targs
, args
, return_type
,
7603 tree fn
, explicit_targs
, targs
, args
, return_type
;
7604 unification_kind_t strict
;
7611 my_friendly_assert (TREE_CODE (fn
) == TEMPLATE_DECL
, 0);
7613 fntype
= TREE_TYPE (fn
);
7618 The specified template arguments must match the template
7619 parameters in kind (i.e., type, nontype, template), and there
7620 must not be more arguments than there are parameters;
7621 otherwise type deduction fails.
7623 Nontype arguments must match the types of the corresponding
7624 nontype template parameters, or must be convertible to the
7625 types of the corresponding nontype parameters as specified in
7626 _temp.arg.nontype_, otherwise type deduction fails.
7628 All references in the function type of the function template
7629 to the corresponding template parameters are replaced by the
7630 specified template argument values. If a substitution in a
7631 template parameter or in the function type of the function
7632 template results in an invalid type, type deduction fails. */
7634 tree converted_args
;
7637 = (coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (fn
),
7638 explicit_targs
, NULL_TREE
, /*complain=*/0,
7639 /*require_all_arguments=*/0));
7640 if (converted_args
== error_mark_node
)
7643 fntype
= tsubst (fntype
, converted_args
, /*complain=*/0, NULL_TREE
);
7644 if (fntype
== error_mark_node
)
7647 /* Place the explicitly specified arguments in TARGS. */
7648 for (i
= 0; i
< TREE_VEC_LENGTH (targs
); i
++)
7649 TREE_VEC_ELT (targs
, i
) = TREE_VEC_ELT (converted_args
, i
);
7652 parms
= TYPE_ARG_TYPES (fntype
);
7653 /* Never do unification on the 'this' parameter. */
7654 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
))
7655 parms
= TREE_CHAIN (parms
);
7659 /* We've been given a return type to match, prepend it. */
7660 parms
= tree_cons (NULL_TREE
, TREE_TYPE (fntype
), parms
);
7661 args
= tree_cons (NULL_TREE
, return_type
, args
);
7666 /* We allow incomplete unification without an error message here
7667 because the standard doesn't seem to explicitly prohibit it. Our
7668 callers must be ready to deal with unification failures in any
7670 result
= type_unification_real (DECL_INNERMOST_TEMPLATE_PARMS (fn
),
7671 targs
, parms
, args
, /*subr=*/0,
7672 strict
, /*allow_incomplete*/1, len
);
7675 /* All is well so far. Now, check:
7679 When all template arguments have been deduced, all uses of
7680 template parameters in nondeduced contexts are replaced with
7681 the corresponding deduced argument values. If the
7682 substitution results in an invalid type, as described above,
7683 type deduction fails. */
7684 if (tsubst (TREE_TYPE (fn
), targs
, /*complain=*/0, NULL_TREE
)
7691 /* Adjust types before performing type deduction, as described in
7692 [temp.deduct.call] and [temp.deduct.conv]. The rules in these two
7693 sections are symmetric. PARM is the type of a function parameter
7694 or the return type of the conversion function. ARG is the type of
7695 the argument passed to the call, or the type of the value
7696 initialized with the result of the conversion function. */
7699 maybe_adjust_types_for_deduction (strict
, parm
, arg
)
7700 unification_kind_t strict
;
7711 /* Swap PARM and ARG throughout the remainder of this
7712 function; the handling is precisely symmetric since PARM
7713 will initialize ARG rather than vice versa. */
7721 /* There is nothing to do in this case. */
7725 my_friendly_abort (0);
7728 if (TREE_CODE (*parm
) != REFERENCE_TYPE
)
7730 /* [temp.deduct.call]
7732 If P is not a reference type:
7734 --If A is an array type, the pointer type produced by the
7735 array-to-pointer standard conversion (_conv.array_) is
7736 used in place of A for type deduction; otherwise,
7738 --If A is a function type, the pointer type produced by
7739 the function-to-pointer standard conversion
7740 (_conv.func_) is used in place of A for type deduction;
7743 --If A is a cv-qualified type, the top level
7744 cv-qualifiers of A's type are ignored for type
7746 if (TREE_CODE (*arg
) == ARRAY_TYPE
)
7747 *arg
= build_pointer_type (TREE_TYPE (*arg
));
7748 else if (TREE_CODE (*arg
) == FUNCTION_TYPE
)
7749 *arg
= build_pointer_type (*arg
);
7751 *arg
= TYPE_MAIN_VARIANT (*arg
);
7754 /* [temp.deduct.call]
7756 If P is a cv-qualified type, the top level cv-qualifiers
7757 of P's type are ignored for type deduction. If P is a
7758 reference type, the type referred to by P is used for
7760 *parm
= TYPE_MAIN_VARIANT (*parm
);
7761 if (TREE_CODE (*parm
) == REFERENCE_TYPE
)
7762 *parm
= TREE_TYPE (*parm
);
7765 /* Most parms like fn_type_unification.
7767 If SUBR is 1, we're being called recursively (to unify the
7768 arguments of a function or method parameter of a function
7772 type_unification_real (tparms
, targs
, parms
, args
, subr
,
7773 strict
, allow_incomplete
, len
)
7774 tree tparms
, targs
, parms
, args
;
7776 unification_kind_t strict
;
7777 int allow_incomplete
, len
;
7781 int ntparms
= TREE_VEC_LENGTH (tparms
);
7784 my_friendly_assert (TREE_CODE (tparms
) == TREE_VEC
, 289);
7785 my_friendly_assert (parms
== NULL_TREE
7786 || TREE_CODE (parms
) == TREE_LIST
, 290);
7787 /* ARGS could be NULL (via a call from parse.y to
7788 build_x_function_call). */
7790 my_friendly_assert (TREE_CODE (args
) == TREE_LIST
, 291);
7791 my_friendly_assert (ntparms
> 0, 292);
7796 sub_strict
= UNIFY_ALLOW_MORE_CV_QUAL
| UNIFY_ALLOW_DERIVED
;
7800 sub_strict
= UNIFY_ALLOW_LESS_CV_QUAL
;
7804 sub_strict
= UNIFY_ALLOW_NONE
;
7808 my_friendly_abort (0);
7815 && parms
!= void_list_node
7817 && args
!= void_list_node
)
7819 parm
= TREE_VALUE (parms
);
7820 parms
= TREE_CHAIN (parms
);
7821 arg
= TREE_VALUE (args
);
7822 args
= TREE_CHAIN (args
);
7824 if (arg
== error_mark_node
)
7826 if (arg
== unknown_type_node
)
7827 /* We can't deduce anything from this, but we might get all the
7828 template args from other function args. */
7831 /* Conversions will be performed on a function argument that
7832 corresponds with a function parameter that contains only
7833 non-deducible template parameters and explicitly specified
7834 template parameters. */
7835 if (! uses_template_parms (parm
))
7840 type
= TREE_TYPE (arg
);
7847 if (strict
== DEDUCE_EXACT
)
7849 if (same_type_p (parm
, type
))
7853 /* It might work; we shouldn't check now, because we might
7854 get into infinite recursion. Overload resolution will
7863 my_friendly_assert (TREE_TYPE (arg
) != NULL_TREE
, 293);
7864 if (type_unknown_p (arg
))
7866 /* [temp.deduct.type] A template-argument can be deduced from
7867 a pointer to function or pointer to member function
7868 argument if the set of overloaded functions does not
7869 contain function templates and at most one of a set of
7870 overloaded functions provides a unique match. */
7872 if (resolve_overloaded_unification
7873 (tparms
, targs
, parm
, arg
, strict
, sub_strict
)
7878 arg
= TREE_TYPE (arg
);
7882 maybe_adjust_types_for_deduction (strict
, &parm
, &arg
);
7884 if (unify (tparms
, targs
, parm
, arg
, sub_strict
))
7887 /* Are we done with the interesting parms? */
7891 /* Fail if we've reached the end of the parm list, and more args
7892 are present, and the parm list isn't variadic. */
7893 if (args
&& args
!= void_list_node
&& parms
== void_list_node
)
7895 /* Fail if parms are left and they don't have default values. */
7897 && parms
!= void_list_node
7898 && TREE_PURPOSE (parms
) == NULL_TREE
)
7901 for (i
= 0; i
< ntparms
; i
++)
7902 if (TREE_VEC_ELT (targs
, i
) == NULL_TREE
)
7904 if (!allow_incomplete
)
7905 error ("incomplete type unification");
7911 /* Subroutine of type_unification_real. Args are like the variables at the
7912 call site. ARG is an overloaded function (or template-id); we try
7913 deducing template args from each of the overloads, and if only one
7914 succeeds, we go with that. Modifies TARGS and returns 0 on success. */
7917 resolve_overloaded_unification (tparms
, targs
, parm
, arg
, strict
,
7919 tree tparms
, targs
, parm
, arg
;
7920 unification_kind_t strict
;
7923 tree tempargs
= copy_node (targs
);
7926 if (TREE_CODE (arg
) == ADDR_EXPR
)
7927 arg
= TREE_OPERAND (arg
, 0);
7929 if (TREE_CODE (arg
) == COMPONENT_REF
)
7930 /* Handle `&x' where `x' is some static or non-static member
7932 arg
= TREE_OPERAND (arg
, 1);
7934 if (TREE_CODE (arg
) == OFFSET_REF
)
7935 arg
= TREE_OPERAND (arg
, 1);
7937 /* Strip baselink information. */
7938 while (TREE_CODE (arg
) == TREE_LIST
)
7939 arg
= TREE_VALUE (arg
);
7941 if (TREE_CODE (arg
) == TEMPLATE_ID_EXPR
)
7943 /* If we got some explicit template args, we need to plug them into
7944 the affected templates before we try to unify, in case the
7945 explicit args will completely resolve the templates in question. */
7947 tree expl_subargs
= TREE_OPERAND (arg
, 1);
7948 arg
= TREE_OPERAND (arg
, 0);
7950 for (; arg
; arg
= OVL_NEXT (arg
))
7952 tree fn
= OVL_CURRENT (arg
);
7955 if (TREE_CODE (fn
) != TEMPLATE_DECL
)
7958 subargs
= get_bindings_overload (fn
, DECL_TEMPLATE_RESULT (fn
),
7962 elem
= tsubst (TREE_TYPE (fn
), subargs
, /*complain=*/0,
7964 if (TREE_CODE (elem
) == METHOD_TYPE
)
7965 elem
= build_ptrmemfunc_type (build_pointer_type (elem
));
7966 good
+= try_one_overload (tparms
, targs
, tempargs
, parm
, elem
,
7967 strict
, sub_strict
);
7971 else if (TREE_CODE (arg
) == OVERLOAD
)
7973 for (; arg
; arg
= OVL_NEXT (arg
))
7975 tree type
= TREE_TYPE (OVL_CURRENT (arg
));
7976 if (TREE_CODE (type
) == METHOD_TYPE
)
7977 type
= build_ptrmemfunc_type (build_pointer_type (type
));
7978 good
+= try_one_overload (tparms
, targs
, tempargs
, parm
,
7980 strict
, sub_strict
);
7984 my_friendly_abort (981006);
7986 /* [temp.deduct.type] A template-argument can be deduced from a pointer
7987 to function or pointer to member function argument if the set of
7988 overloaded functions does not contain function templates and at most
7989 one of a set of overloaded functions provides a unique match.
7991 So if we found multiple possibilities, we return success but don't
7996 int i
= TREE_VEC_LENGTH (targs
);
7998 if (TREE_VEC_ELT (tempargs
, i
))
7999 TREE_VEC_ELT (targs
, i
) = TREE_VEC_ELT (tempargs
, i
);
8007 /* Subroutine of resolve_overloaded_unification; does deduction for a single
8008 overload. Fills TARGS with any deduced arguments, or error_mark_node if
8009 different overloads deduce different arguments for a given parm.
8010 Returns 1 on success. */
8013 try_one_overload (tparms
, orig_targs
, targs
, parm
, arg
, strict
,
8015 tree tparms
, orig_targs
, targs
, parm
, arg
;
8016 unification_kind_t strict
;
8023 /* [temp.deduct.type] A template-argument can be deduced from a pointer
8024 to function or pointer to member function argument if the set of
8025 overloaded functions does not contain function templates and at most
8026 one of a set of overloaded functions provides a unique match.
8028 So if this is a template, just return success. */
8030 if (uses_template_parms (arg
))
8033 maybe_adjust_types_for_deduction (strict
, &parm
, &arg
);
8035 /* We don't copy orig_targs for this because if we have already deduced
8036 some template args from previous args, unify would complain when we
8037 try to deduce a template parameter for the same argument, even though
8038 there isn't really a conflict. */
8039 nargs
= TREE_VEC_LENGTH (targs
);
8040 tempargs
= make_tree_vec (nargs
);
8042 if (unify (tparms
, tempargs
, parm
, arg
, sub_strict
) != 0)
8045 /* First make sure we didn't deduce anything that conflicts with
8046 explicitly specified args. */
8047 for (i
= nargs
; i
--; )
8049 tree elt
= TREE_VEC_ELT (tempargs
, i
);
8050 tree oldelt
= TREE_VEC_ELT (orig_targs
, i
);
8052 if (elt
== NULL_TREE
)
8054 else if (uses_template_parms (elt
))
8056 /* Since we're unifying against ourselves, we will fill in template
8057 args used in the function parm list with our own template parms.
8059 TREE_VEC_ELT (tempargs
, i
) = NULL_TREE
;
8062 else if (oldelt
&& ! template_args_equal (oldelt
, elt
))
8066 for (i
= nargs
; i
--; )
8068 tree elt
= TREE_VEC_ELT (tempargs
, i
);
8071 TREE_VEC_ELT (targs
, i
) = elt
;
8077 /* Verify that nondeduce template argument agrees with the type
8078 obtained from argument deduction. Return nonzero if the
8083 struct A { typedef int X; };
8084 template <class T, class U> struct C {};
8085 template <class T> struct C<T, typename T::X> {};
8087 Then with the instantiation `C<A, int>', we can deduce that
8088 `T' is `A' but unify () does not check whether `typename T::X'
8089 is `int'. This function ensure that they agree.
8091 TARGS, PARMS are the same as the arguments of unify.
8092 ARGS contains template arguments from all levels. */
8095 verify_class_unification (targs
, parms
, args
)
8096 tree targs
, parms
, args
;
8099 int nparms
= TREE_VEC_LENGTH (parms
);
8100 tree new_parms
= tsubst (parms
, add_outermost_template_args (args
, targs
),
8101 /*complain=*/0, NULL_TREE
);
8102 if (new_parms
== error_mark_node
)
8105 args
= INNERMOST_TEMPLATE_ARGS (args
);
8107 for (i
= 0; i
< nparms
; i
++)
8109 tree parm
= TREE_VEC_ELT (new_parms
, i
);
8110 tree arg
= TREE_VEC_ELT (args
, i
);
8112 /* In case we are deducing from a function argument of a function
8113 templates, some parameters may not be deduced yet. So we
8114 make sure that only fully substituted elements of PARM are
8117 if (!uses_template_parms (parm
) && !template_args_equal (parm
, arg
))
8123 /* PARM is a template class (perhaps with unbound template
8124 parameters). ARG is a fully instantiated type. If ARG can be
8125 bound to PARM, return ARG, otherwise return NULL_TREE. TPARMS and
8126 TARGS are as for unify. */
8129 try_class_unification (tparms
, targs
, parm
, arg
)
8137 if (!CLASSTYPE_TEMPLATE_INFO (arg
)
8138 || CLASSTYPE_TI_TEMPLATE (arg
) != CLASSTYPE_TI_TEMPLATE (parm
))
8141 /* We need to make a new template argument vector for the call to
8142 unify. If we used TARGS, we'd clutter it up with the result of
8143 the attempted unification, even if this class didn't work out.
8144 We also don't want to commit ourselves to all the unifications
8145 we've already done, since unification is supposed to be done on
8146 an argument-by-argument basis. In other words, consider the
8147 following pathological case:
8149 template <int I, int J, int K>
8152 template <int I, int J>
8153 struct S<I, J, 2> : public S<I, I, I>, S<J, J, J> {};
8155 template <int I, int J, int K>
8156 void f(S<I, J, K>, S<I, I, I>);
8165 Now, by the time we consider the unification involving `s2', we
8166 already know that we must have `f<0, 0, 0>'. But, even though
8167 `S<0, 1, 2>' is derived from `S<0, 0, 0>', the code is not legal
8168 because there are two ways to unify base classes of S<0, 1, 2>
8169 with S<I, I, I>. If we kept the already deduced knowledge, we
8170 would reject the possibility I=1. */
8171 copy_of_targs
= make_tree_vec (TREE_VEC_LENGTH (targs
));
8173 /* If unification failed, we're done. */
8174 if (unify (tparms
, copy_of_targs
, CLASSTYPE_TI_ARGS (parm
),
8175 CLASSTYPE_TI_ARGS (arg
), UNIFY_ALLOW_NONE
))
8181 /* Subroutine of get_template_base. RVAL, if non-NULL, is a base we
8182 have already discovered to be satisfactory. ARG_BINFO is the binfo
8183 for the base class of ARG that we are currently examining. */
8186 get_template_base_recursive (tparms
, targs
, parm
,
8187 arg_binfo
, rval
, flags
)
8197 tree arg
= BINFO_TYPE (arg_binfo
);
8199 if (!(flags
& GTB_IGNORE_TYPE
))
8201 tree r
= try_class_unification (tparms
, targs
,
8204 /* If there is more than one satisfactory baseclass, then:
8208 If they yield more than one possible deduced A, the type
8212 if (r
&& rval
&& !same_type_p (r
, rval
))
8213 return error_mark_node
;
8218 binfos
= BINFO_BASETYPES (arg_binfo
);
8219 n_baselinks
= binfos
? TREE_VEC_LENGTH (binfos
) : 0;
8221 /* Process base types. */
8222 for (i
= 0; i
< n_baselinks
; i
++)
8224 tree base_binfo
= TREE_VEC_ELT (binfos
, i
);
8227 /* Skip this base, if we've already seen it. */
8228 if (BINFO_MARKED (base_binfo
))
8232 (flags
& GTB_VIA_VIRTUAL
) || TREE_VIA_VIRTUAL (base_binfo
);
8234 /* When searching for a non-virtual, we cannot mark virtually
8237 SET_BINFO_MARKED (base_binfo
);
8239 rval
= get_template_base_recursive (tparms
, targs
,
8243 GTB_VIA_VIRTUAL
* this_virtual
);
8245 /* If we discovered more than one matching base class, we can
8247 if (rval
== error_mark_node
)
8248 return error_mark_node
;
8254 /* Given a template type PARM and a class type ARG, find the unique
8255 base type in ARG that is an instance of PARM. We do not examine
8256 ARG itself; only its base-classes. If there is no appropriate base
8257 class, return NULL_TREE. If there is more than one, return
8258 error_mark_node. PARM may be the type of a partial specialization,
8259 as well as a plain template type. Used by unify. */
8262 get_template_base (tparms
, targs
, parm
, arg
)
8271 my_friendly_assert (IS_AGGR_TYPE_CODE (TREE_CODE (arg
)), 92);
8273 arg_binfo
= TYPE_BINFO (complete_type (arg
));
8274 rval
= get_template_base_recursive (tparms
, targs
,
8279 /* Since get_template_base_recursive marks the bases classes, we
8280 must unmark them here. */
8281 dfs_walk (arg_binfo
, dfs_unmark
, markedp
, 0);
8286 /* Returns the level of DECL, which declares a template parameter. */
8289 template_decl_level (decl
)
8292 switch (TREE_CODE (decl
))
8296 return TEMPLATE_TYPE_LEVEL (TREE_TYPE (decl
));
8299 return TEMPLATE_PARM_LEVEL (DECL_INITIAL (decl
));
8302 my_friendly_abort (0);
8307 /* Decide whether ARG can be unified with PARM, considering only the
8308 cv-qualifiers of each type, given STRICT as documented for unify.
8309 Returns non-zero iff the unification is OK on that basis.*/
8312 check_cv_quals_for_unify (strict
, arg
, parm
)
8317 if (!(strict
& UNIFY_ALLOW_MORE_CV_QUAL
)
8318 && !at_least_as_qualified_p (arg
, parm
))
8321 if (!(strict
& UNIFY_ALLOW_LESS_CV_QUAL
)
8322 && !at_least_as_qualified_p (parm
, arg
))
8328 /* Takes parameters as for type_unification. Returns 0 if the
8329 type deduction succeeds, 1 otherwise. The parameter STRICT is a
8330 bitwise or of the following flags:
8333 Require an exact match between PARM and ARG.
8334 UNIFY_ALLOW_MORE_CV_QUAL:
8335 Allow the deduced ARG to be more cv-qualified than ARG.
8336 UNIFY_ALLOW_LESS_CV_QUAL:
8337 Allow the deduced ARG to be less cv-qualified than ARG.
8338 UNIFY_ALLOW_DERIVED:
8339 Allow the deduced ARG to be a template base class of ARG,
8340 or a pointer to a template base class of the type pointed to by
8342 UNIFY_ALLOW_INTEGER:
8343 Allow any integral type to be deduced. See the TEMPLATE_PARM_INDEX
8344 case for more information. */
8347 unify (tparms
, targs
, parm
, arg
, strict
)
8348 tree tparms
, targs
, parm
, arg
;
8355 /* I don't think this will do the right thing with respect to types.
8356 But the only case I've seen it in so far has been array bounds, where
8357 signedness is the only information lost, and I think that will be
8359 while (TREE_CODE (parm
) == NOP_EXPR
)
8360 parm
= TREE_OPERAND (parm
, 0);
8362 if (arg
== error_mark_node
)
8364 if (arg
== unknown_type_node
)
8365 /* We can't deduce anything from this, but we might get all the
8366 template args from other function args. */
8369 /* If PARM uses template parameters, then we can't bail out here,
8370 even if ARG == PARM, since we won't record unifications for the
8371 template parameters. We might need them if we're trying to
8372 figure out which of two things is more specialized. */
8373 if (arg
== parm
&& !uses_template_parms (parm
))
8376 /* Immediately reject some pairs that won't unify because of
8377 cv-qualification mismatches. */
8378 if (TREE_CODE (arg
) == TREE_CODE (parm
)
8380 /* We check the cv-qualifiers when unifying with template type
8381 parameters below. We want to allow ARG `const T' to unify with
8382 PARM `T' for example, when computing which of two templates
8383 is more specialized, for example. */
8384 && TREE_CODE (arg
) != TEMPLATE_TYPE_PARM
8385 && !check_cv_quals_for_unify (strict
, arg
, parm
))
8388 switch (TREE_CODE (parm
))
8391 /* In a type which contains a nested-name-specifier, template
8392 argument values cannot be deduced for template parameters used
8393 within the nested-name-specifier. */
8396 case TEMPLATE_TYPE_PARM
:
8397 case TEMPLATE_TEMPLATE_PARM
:
8398 case BOUND_TEMPLATE_TEMPLATE_PARM
:
8399 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, 0));
8401 if (TEMPLATE_TYPE_LEVEL (parm
)
8402 != template_decl_level (tparm
))
8403 /* The PARM is not one we're trying to unify. Just check
8404 to see if it matches ARG. */
8405 return (TREE_CODE (arg
) == TREE_CODE (parm
)
8406 && same_type_p (parm
, arg
)) ? 0 : 1;
8407 idx
= TEMPLATE_TYPE_IDX (parm
);
8408 targ
= TREE_VEC_ELT (targs
, idx
);
8409 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, idx
));
8411 /* Check for mixed types and values. */
8412 if ((TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
8413 && TREE_CODE (tparm
) != TYPE_DECL
)
8414 || (TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
8415 && TREE_CODE (tparm
) != TEMPLATE_DECL
))
8418 if (TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
8420 /* ARG must be constructed from a template class or a template
8421 template parameter. */
8422 if (TREE_CODE (arg
) != BOUND_TEMPLATE_TEMPLATE_PARM
8423 && (TREE_CODE (arg
) != RECORD_TYPE
|| !CLASSTYPE_TEMPLATE_INFO (arg
)))
8427 tree parmtmpl
= TYPE_TI_TEMPLATE (parm
);
8428 tree parmvec
= TYPE_TI_ARGS (parm
);
8429 tree argvec
= TYPE_TI_ARGS (arg
);
8431 = DECL_INNERMOST_TEMPLATE_PARMS (TYPE_TI_TEMPLATE (arg
));
8434 /* The parameter and argument roles have to be switched here
8435 in order to handle default arguments properly. For example,
8436 template<template <class> class TT> void f(TT<int>)
8437 should be able to accept vector<int> which comes from
8438 template <class T, class Allocator = allocator>
8441 if (coerce_template_parms (argtmplvec
, parmvec
, parmtmpl
, 0, 1)
8445 /* Deduce arguments T, i from TT<T> or TT<i>.
8446 We check each element of PARMVEC and ARGVEC individually
8447 rather than the whole TREE_VEC since they can have
8448 different number of elements. */
8450 for (i
= 0; i
< TREE_VEC_LENGTH (parmvec
); ++i
)
8452 tree t
= TREE_VEC_ELT (parmvec
, i
);
8454 if (unify (tparms
, targs
, t
,
8455 TREE_VEC_ELT (argvec
, i
),
8460 arg
= TYPE_TI_TEMPLATE (arg
);
8462 /* Fall through to deduce template name. */
8465 if (TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
8466 || TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
8468 /* Deduce template name TT from TT, TT<>, TT<T> and TT<i>. */
8470 /* Simple cases: Value already set, does match or doesn't. */
8471 if (targ
!= NULL_TREE
&& template_args_equal (targ
, arg
))
8478 /* If PARM is `const T' and ARG is only `int', we don't have
8479 a match unless we are allowing additional qualification.
8480 If ARG is `const int' and PARM is just `T' that's OK;
8481 that binds `const int' to `T'. */
8482 if (!check_cv_quals_for_unify (strict
| UNIFY_ALLOW_LESS_CV_QUAL
,
8486 /* Consider the case where ARG is `const volatile int' and
8487 PARM is `const T'. Then, T should be `volatile int'. */
8489 cp_build_qualified_type_real (arg
,
8491 & ~CP_TYPE_QUALS (parm
),
8493 if (arg
== error_mark_node
)
8496 /* Simple cases: Value already set, does match or doesn't. */
8497 if (targ
!= NULL_TREE
&& same_type_p (targ
, arg
))
8503 /* Make sure that ARG is not a variable-sized array. (Note that
8504 were talking about variable-sized arrays (like `int[n]'),
8505 rather than arrays of unknown size (like `int[]').) We'll
8506 get very confused by such a type since the bound of the array
8507 will not be computable in an instantiation. Besides, such
8508 types are not allowed in ISO C++, so we can do as we please
8510 if (TREE_CODE (arg
) == ARRAY_TYPE
8511 && !uses_template_parms (arg
)
8512 && (TREE_CODE (TYPE_MAX_VALUE (TYPE_DOMAIN (arg
)))
8516 TREE_VEC_ELT (targs
, idx
) = arg
;
8519 case TEMPLATE_PARM_INDEX
:
8520 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, 0));
8522 if (TEMPLATE_PARM_LEVEL (parm
)
8523 != template_decl_level (tparm
))
8524 /* The PARM is not one we're trying to unify. Just check
8525 to see if it matches ARG. */
8526 return (TREE_CODE (arg
) == TREE_CODE (parm
)
8527 && cp_tree_equal (parm
, arg
) > 0) ? 0 : 1;
8529 idx
= TEMPLATE_PARM_IDX (parm
);
8530 targ
= TREE_VEC_ELT (targs
, idx
);
8534 int i
= (cp_tree_equal (targ
, arg
) > 0);
8540 my_friendly_abort (42);
8543 /* [temp.deduct.type] If, in the declaration of a function template
8544 with a non-type template-parameter, the non-type
8545 template-parameter is used in an expression in the function
8546 parameter-list and, if the corresponding template-argument is
8547 deduced, the template-argument type shall match the type of the
8548 template-parameter exactly, except that a template-argument
8549 deduced from an array bound may be of any integral type.
8550 The non-type parameter might use already deduced type parameters. */
8551 if (same_type_p (TREE_TYPE (arg
),
8552 tsubst (TREE_TYPE (parm
), targs
, 0, NULL_TREE
)))
8554 else if ((strict
& UNIFY_ALLOW_INTEGER
)
8555 && (TREE_CODE (TREE_TYPE (parm
)) == INTEGER_TYPE
8556 || TREE_CODE (TREE_TYPE (parm
)) == BOOLEAN_TYPE
))
8561 TREE_VEC_ELT (targs
, idx
) = arg
;
8568 if (TREE_CODE (arg
) != POINTER_TYPE
)
8571 /* [temp.deduct.call]
8573 A can be another pointer or pointer to member type that can
8574 be converted to the deduced A via a qualification
8575 conversion (_conv.qual_).
8577 We pass down STRICT here rather than UNIFY_ALLOW_NONE.
8578 This will allow for additional cv-qualification of the
8579 pointed-to types if appropriate. In general, this is a bit
8580 too generous; we are only supposed to allow qualification
8581 conversions and this method will allow an ARG of char** and
8582 a deduced ARG of const char**. However, overload
8583 resolution will subsequently invalidate the candidate, so
8584 this is probably OK. */
8585 sub_strict
= strict
;
8587 if (TREE_CODE (TREE_TYPE (arg
)) != RECORD_TYPE
)
8588 /* The derived-to-base conversion only persists through one
8589 level of pointers. */
8590 sub_strict
&= ~UNIFY_ALLOW_DERIVED
;
8592 return unify (tparms
, targs
, TREE_TYPE (parm
),
8593 TREE_TYPE (arg
), sub_strict
);
8596 case REFERENCE_TYPE
:
8597 if (TREE_CODE (arg
) != REFERENCE_TYPE
)
8599 return unify (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
8603 if (TREE_CODE (arg
) != ARRAY_TYPE
)
8605 if ((TYPE_DOMAIN (parm
) == NULL_TREE
)
8606 != (TYPE_DOMAIN (arg
) == NULL_TREE
))
8608 if (TYPE_DOMAIN (parm
) != NULL_TREE
8609 && unify (tparms
, targs
, TYPE_DOMAIN (parm
),
8610 TYPE_DOMAIN (arg
), UNIFY_ALLOW_NONE
) != 0)
8612 return unify (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
8621 if (TREE_CODE (arg
) != TREE_CODE (parm
))
8624 if (TREE_CODE (parm
) == INTEGER_TYPE
8625 && TREE_CODE (TYPE_MAX_VALUE (parm
)) != INTEGER_CST
)
8627 if (TYPE_MIN_VALUE (parm
) && TYPE_MIN_VALUE (arg
)
8628 && unify (tparms
, targs
, TYPE_MIN_VALUE (parm
),
8629 TYPE_MIN_VALUE (arg
), UNIFY_ALLOW_INTEGER
))
8631 if (TYPE_MAX_VALUE (parm
) && TYPE_MAX_VALUE (arg
)
8632 && unify (tparms
, targs
, TYPE_MAX_VALUE (parm
),
8633 TYPE_MAX_VALUE (arg
), UNIFY_ALLOW_INTEGER
))
8636 /* We have already checked cv-qualification at the top of the
8638 else if (!same_type_ignoring_top_level_qualifiers_p (arg
, parm
))
8641 /* As far as unification is concerned, this wins. Later checks
8642 will invalidate it if necessary. */
8645 /* Types INTEGER_CST and MINUS_EXPR can come from array bounds. */
8646 /* Type INTEGER_CST can come from ordinary constant template args. */
8648 while (TREE_CODE (arg
) == NOP_EXPR
)
8649 arg
= TREE_OPERAND (arg
, 0);
8651 if (TREE_CODE (arg
) != INTEGER_CST
)
8653 return !tree_int_cst_equal (parm
, arg
);
8658 if (TREE_CODE (arg
) != TREE_VEC
)
8660 if (TREE_VEC_LENGTH (parm
) != TREE_VEC_LENGTH (arg
))
8662 for (i
= 0; i
< TREE_VEC_LENGTH (parm
); ++i
)
8663 if (unify (tparms
, targs
,
8664 TREE_VEC_ELT (parm
, i
), TREE_VEC_ELT (arg
, i
),
8672 if (TREE_CODE (arg
) != TREE_CODE (parm
))
8675 if (TYPE_PTRMEMFUNC_P (parm
))
8677 if (!TYPE_PTRMEMFUNC_P (arg
))
8680 return unify (tparms
, targs
,
8681 TYPE_PTRMEMFUNC_FN_TYPE (parm
),
8682 TYPE_PTRMEMFUNC_FN_TYPE (arg
),
8686 if (CLASSTYPE_TEMPLATE_INFO (parm
))
8690 if (strict
& UNIFY_ALLOW_DERIVED
)
8692 /* First, we try to unify the PARM and ARG directly. */
8693 t
= try_class_unification (tparms
, targs
,
8698 /* Fallback to the special case allowed in
8701 If P is a class, and P has the form
8702 template-id, then A can be a derived class of
8703 the deduced A. Likewise, if P is a pointer to
8704 a class of the form template-id, A can be a
8705 pointer to a derived class pointed to by the
8707 t
= get_template_base (tparms
, targs
,
8710 if (! t
|| t
== error_mark_node
)
8714 else if (CLASSTYPE_TEMPLATE_INFO (arg
)
8715 && (CLASSTYPE_TI_TEMPLATE (parm
)
8716 == CLASSTYPE_TI_TEMPLATE (arg
)))
8717 /* Perhaps PARM is something like S<U> and ARG is S<int>.
8718 Then, we should unify `int' and `U'. */
8721 /* There's no chance of unification succeeding. */
8724 return unify (tparms
, targs
, CLASSTYPE_TI_ARGS (parm
),
8725 CLASSTYPE_TI_ARGS (t
), UNIFY_ALLOW_NONE
);
8727 else if (!same_type_ignoring_top_level_qualifiers_p (parm
, arg
))
8733 if (TREE_CODE (arg
) != TREE_CODE (parm
))
8736 if (unify (tparms
, targs
, TREE_TYPE (parm
),
8737 TREE_TYPE (arg
), UNIFY_ALLOW_NONE
))
8739 return type_unification_real (tparms
, targs
, TYPE_ARG_TYPES (parm
),
8740 TYPE_ARG_TYPES (arg
), 1,
8741 DEDUCE_EXACT
, 0, -1);
8744 if (TREE_CODE (arg
) != OFFSET_TYPE
)
8746 if (unify (tparms
, targs
, TYPE_OFFSET_BASETYPE (parm
),
8747 TYPE_OFFSET_BASETYPE (arg
), UNIFY_ALLOW_NONE
))
8749 return unify (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
8753 if (arg
!= decl_constant_value (parm
))
8758 /* Matched cases are handled by the ARG == PARM test above. */
8762 if (TREE_CODE (TREE_OPERAND (parm
, 1)) == INTEGER_CST
)
8764 /* We handle this case specially, since it comes up with
8765 arrays. In particular, something like:
8767 template <int N> void f(int (&x)[N]);
8769 Here, we are trying to unify the range type, which
8770 looks like [0 ... (N - 1)]. */
8772 t1
= TREE_OPERAND (parm
, 0);
8773 t2
= TREE_OPERAND (parm
, 1);
8775 t
= fold (build (PLUS_EXPR
, integer_type_node
, arg
, t2
));
8777 return unify (tparms
, targs
, t1
, t
, strict
);
8779 /* else fall through */
8782 if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (TREE_CODE (parm
))))
8785 /* We're looking at an expression. This can happen with
8789 void foo(S<I>, S<I + 2>);
8791 This is a "nondeduced context":
8795 The nondeduced contexts are:
8797 --A type that is a template-id in which one or more of
8798 the template-arguments is an expression that references
8799 a template-parameter.
8801 In these cases, we assume deduction succeeded, but don't
8802 actually infer any unifications. */
8804 if (!uses_template_parms (parm
)
8805 && !template_args_equal (parm
, arg
))
8811 sorry ("use of `%s' in template type unification",
8812 tree_code_name
[(int) TREE_CODE (parm
)]);
8818 /* Called if RESULT is explicitly instantiated, or is a member of an
8819 explicitly instantiated class, or if using -frepo and the
8820 instantiation of RESULT has been assigned to this file. */
8823 mark_decl_instantiated (result
, extern_p
)
8827 if (TREE_CODE (result
) != FUNCTION_DECL
)
8828 /* The TREE_PUBLIC flag for function declarations will have been
8829 set correctly by tsubst. */
8830 TREE_PUBLIC (result
) = 1;
8832 /* We used to set this unconditionally; we moved that to
8833 do_decl_instantiation so it wouldn't get set on members of
8834 explicit class template instantiations. But we still need to set
8835 it here for the 'extern template' case in order to suppress
8836 implicit instantiations. */
8838 SET_DECL_EXPLICIT_INSTANTIATION (result
);
8842 DECL_INTERFACE_KNOWN (result
) = 1;
8843 DECL_NOT_REALLY_EXTERN (result
) = 1;
8845 /* Always make artificials weak. */
8846 if (DECL_ARTIFICIAL (result
) && flag_weak
)
8847 comdat_linkage (result
);
8848 /* For WIN32 we also want to put explicit instantiations in
8849 linkonce sections. */
8850 else if (TREE_PUBLIC (result
))
8851 maybe_make_one_only (result
);
8853 else if (TREE_CODE (result
) == FUNCTION_DECL
)
8857 /* Given two function templates PAT1 and PAT2, return:
8859 1 if PAT1 is more specialized than PAT2 as described in [temp.func.order].
8860 -1 if PAT2 is more specialized than PAT1.
8861 0 if neither is more specialized.
8863 LEN is passed through to fn_type_unification. */
8866 more_specialized (pat1
, pat2
, len
)
8873 targs
= get_bindings_order (pat1
, DECL_TEMPLATE_RESULT (pat2
), len
);
8877 targs
= get_bindings_order (pat2
, DECL_TEMPLATE_RESULT (pat1
), len
);
8884 /* Given two class template specialization list nodes PAT1 and PAT2, return:
8886 1 if PAT1 is more specialized than PAT2 as described in [temp.class.order].
8887 -1 if PAT2 is more specialized than PAT1.
8888 0 if neither is more specialized. */
8891 more_specialized_class (pat1
, pat2
)
8897 targs
= get_class_bindings (TREE_VALUE (pat1
), TREE_PURPOSE (pat1
),
8898 TREE_PURPOSE (pat2
));
8902 targs
= get_class_bindings (TREE_VALUE (pat2
), TREE_PURPOSE (pat2
),
8903 TREE_PURPOSE (pat1
));
8910 /* Return the template arguments that will produce the function signature
8911 DECL from the function template FN, with the explicit template
8912 arguments EXPLICIT_ARGS. If CHECK_RETTYPE is 1, the return type must
8913 also match. Return NULL_TREE if no satisfactory arguments could be
8914 found. LEN is passed through to fn_type_unification. */
8917 get_bindings_real (fn
, decl
, explicit_args
, check_rettype
, len
)
8918 tree fn
, decl
, explicit_args
;
8919 int check_rettype
, len
;
8921 int ntparms
= DECL_NTPARMS (fn
);
8922 tree targs
= make_tree_vec (ntparms
);
8924 tree decl_arg_types
;
8927 /* Substitute the explicit template arguments into the type of DECL.
8928 The call to fn_type_unification will handle substitution into the
8930 decl_type
= TREE_TYPE (decl
);
8931 if (explicit_args
&& uses_template_parms (decl_type
))
8934 tree converted_args
;
8936 if (DECL_TEMPLATE_INFO (decl
))
8937 tmpl
= DECL_TI_TEMPLATE (decl
);
8939 /* We can get here for some illegal specializations. */
8943 = (coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (tmpl
),
8944 explicit_args
, NULL_TREE
,
8946 /*require_all_arguments=*/0));
8947 if (converted_args
== error_mark_node
)
8950 decl_type
= tsubst (decl_type
, converted_args
, /*complain=*/0,
8952 if (decl_type
== error_mark_node
)
8956 decl_arg_types
= TYPE_ARG_TYPES (decl_type
);
8957 /* Never do unification on the 'this' parameter. */
8958 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
8959 decl_arg_types
= TREE_CHAIN (decl_arg_types
);
8961 i
= fn_type_unification (fn
, explicit_args
, targs
,
8963 (check_rettype
|| DECL_CONV_FN_P (fn
)
8964 ? TREE_TYPE (decl_type
) : NULL_TREE
),
8973 /* For most uses, we want to check the return type. */
8976 get_bindings (fn
, decl
, explicit_args
)
8977 tree fn
, decl
, explicit_args
;
8979 return get_bindings_real (fn
, decl
, explicit_args
, 1, -1);
8982 /* But for resolve_overloaded_unification, we only care about the parameter
8986 get_bindings_overload (fn
, decl
, explicit_args
)
8987 tree fn
, decl
, explicit_args
;
8989 return get_bindings_real (fn
, decl
, explicit_args
, 0, -1);
8992 /* And for more_specialized, we want to be able to stop partway. */
8995 get_bindings_order (fn
, decl
, len
)
8999 return get_bindings_real (fn
, decl
, NULL_TREE
, 0, len
);
9002 /* Return the innermost template arguments that, when applied to a
9003 template specialization whose innermost template parameters are
9004 TPARMS, and whose specialization arguments are ARGS, yield the
9007 For example, suppose we have:
9009 template <class T, class U> struct S {};
9010 template <class T> struct S<T*, int> {};
9012 Then, suppose we want to get `S<double*, int>'. The TPARMS will be
9013 {T}, the PARMS will be {T*, int} and the ARGS will be {double*,
9014 int}. The resulting vector will be {double}, indicating that `T'
9015 is bound to `double'. */
9018 get_class_bindings (tparms
, parms
, args
)
9019 tree tparms
, parms
, args
;
9021 int i
, ntparms
= TREE_VEC_LENGTH (tparms
);
9022 tree vec
= make_tree_vec (ntparms
);
9024 if (unify (tparms
, vec
, parms
, INNERMOST_TEMPLATE_ARGS (args
),
9028 for (i
= 0; i
< ntparms
; ++i
)
9029 if (! TREE_VEC_ELT (vec
, i
))
9032 if (verify_class_unification (vec
, parms
, args
))
9038 /* In INSTANTIATIONS is a list of <INSTANTIATION, TEMPLATE> pairs.
9039 Pick the most specialized template, and return the corresponding
9040 instantiation, or if there is no corresponding instantiation, the
9041 template itself. If there is no most specialized template,
9042 error_mark_node is returned. If there are no templates at all,
9043 NULL_TREE is returned. */
9046 most_specialized_instantiation (instantiations
)
9047 tree instantiations
;
9052 if (!instantiations
)
9055 champ
= instantiations
;
9056 for (fn
= TREE_CHAIN (instantiations
); fn
; fn
= TREE_CHAIN (fn
))
9058 fate
= more_specialized (TREE_VALUE (champ
), TREE_VALUE (fn
), -1);
9065 fn
= TREE_CHAIN (fn
);
9067 return error_mark_node
;
9073 for (fn
= instantiations
; fn
&& fn
!= champ
; fn
= TREE_CHAIN (fn
))
9075 fate
= more_specialized (TREE_VALUE (champ
), TREE_VALUE (fn
), -1);
9077 return error_mark_node
;
9080 return TREE_PURPOSE (champ
) ? TREE_PURPOSE (champ
) : TREE_VALUE (champ
);
9083 /* Return the most specialized of the list of templates in FNS that can
9084 produce an instantiation matching DECL, given the explicit template
9085 arguments EXPLICIT_ARGS. */
9088 most_specialized (fns
, decl
, explicit_args
)
9089 tree fns
, decl
, explicit_args
;
9091 tree candidates
= NULL_TREE
;
9094 for (fn
= fns
; fn
; fn
= TREE_CHAIN (fn
))
9096 tree candidate
= TREE_VALUE (fn
);
9098 args
= get_bindings (candidate
, decl
, explicit_args
);
9100 candidates
= tree_cons (NULL_TREE
, candidate
, candidates
);
9103 return most_specialized_instantiation (candidates
);
9106 /* If DECL is a specialization of some template, return the most
9107 general such template. Otherwise, returns NULL_TREE.
9111 template <class T> struct S { template <class U> void f(U); };
9113 if TMPL is `template <class U> void S<int>::f(U)' this will return
9114 the full template. This function will not trace past partial
9115 specializations, however. For example, given in addition:
9117 template <class T> struct S<T*> { template <class U> void f(U); };
9119 if TMPL is `template <class U> void S<int*>::f(U)' this will return
9120 `template <class T> template <class U> S<T*>::f(U)'. */
9123 most_general_template (decl
)
9126 /* If DECL is a FUNCTION_DECL, find the TEMPLATE_DECL of which it is
9127 an immediate specialization. */
9128 if (TREE_CODE (decl
) == FUNCTION_DECL
)
9130 if (DECL_TEMPLATE_INFO (decl
)) {
9131 decl
= DECL_TI_TEMPLATE (decl
);
9133 /* The DECL_TI_TEMPLATE can be an IDENTIFIER_NODE for a
9135 if (TREE_CODE (decl
) != TEMPLATE_DECL
)
9141 /* Look for more and more general templates. */
9142 while (DECL_TEMPLATE_INFO (decl
))
9144 /* The DECL_TI_TEMPLATE can be a LOOKUP_EXPR or IDENTIFIER_NODE
9145 in some cases. (See cp-tree.h for details.) */
9146 if (TREE_CODE (DECL_TI_TEMPLATE (decl
)) != TEMPLATE_DECL
)
9149 /* Stop if we run into an explicitly specialized class template. */
9150 if (!DECL_NAMESPACE_SCOPE_P (decl
)
9151 && DECL_CONTEXT (decl
)
9152 && CLASSTYPE_TEMPLATE_SPECIALIZATION (DECL_CONTEXT (decl
)))
9155 decl
= DECL_TI_TEMPLATE (decl
);
9161 /* Return the most specialized of the class template specializations
9162 of TMPL which can produce an instantiation matching ARGS, or
9163 error_mark_node if the choice is ambiguous. */
9166 most_specialized_class (tmpl
, args
)
9170 tree list
= NULL_TREE
;
9175 tmpl
= most_general_template (tmpl
);
9176 for (t
= DECL_TEMPLATE_SPECIALIZATIONS (tmpl
); t
; t
= TREE_CHAIN (t
))
9179 = get_class_bindings (TREE_VALUE (t
), TREE_PURPOSE (t
), args
);
9182 list
= tree_cons (TREE_PURPOSE (t
), TREE_VALUE (t
), list
);
9183 TREE_TYPE (list
) = TREE_TYPE (t
);
9193 for (; t
; t
= TREE_CHAIN (t
))
9195 fate
= more_specialized_class (champ
, t
);
9204 return error_mark_node
;
9210 for (t
= list
; t
&& t
!= champ
; t
= TREE_CHAIN (t
))
9212 fate
= more_specialized_class (champ
, t
);
9214 return error_mark_node
;
9220 /* called from the parser. */
9223 do_decl_instantiation (declspecs
, declarator
, storage
)
9224 tree declspecs
, declarator
, storage
;
9226 tree decl
= grokdeclarator (declarator
, declspecs
, NORMAL
, 0, NULL_TREE
);
9227 tree result
= NULL_TREE
;
9231 /* An error occurred, for which grokdeclarator has already issued
9232 an appropriate message. */
9234 else if (! DECL_LANG_SPECIFIC (decl
))
9236 cp_error ("explicit instantiation of non-template `%#D'", decl
);
9239 else if (TREE_CODE (decl
) == VAR_DECL
)
9241 /* There is an asymmetry here in the way VAR_DECLs and
9242 FUNCTION_DECLs are handled by grokdeclarator. In the case of
9243 the latter, the DECL we get back will be marked as a
9244 template instantiation, and the appropriate
9245 DECL_TEMPLATE_INFO will be set up. This does not happen for
9246 VAR_DECLs so we do the lookup here. Probably, grokdeclarator
9247 should handle VAR_DECLs as it currently handles
9249 result
= lookup_field (DECL_CONTEXT (decl
), DECL_NAME (decl
), 0, 0);
9250 if (result
&& TREE_CODE (result
) != VAR_DECL
)
9252 cp_error ("no matching template for `%D' found", result
);
9256 else if (TREE_CODE (decl
) != FUNCTION_DECL
)
9258 cp_error ("explicit instantiation of `%#D'", decl
);
9264 /* Check for various error cases. Note that if the explicit
9265 instantiation is legal the RESULT will currently be marked as an
9266 *implicit* instantiation; DECL_EXPLICIT_INSTANTIATION is not set
9267 until we get here. */
9269 if (DECL_TEMPLATE_SPECIALIZATION (result
))
9273 No program shall both explicitly instantiate and explicitly
9274 specialize a template. */
9275 cp_pedwarn ("explicit instantiation of `%#D' after", result
);
9276 cp_pedwarn_at ("explicit specialization here", result
);
9279 else if (DECL_EXPLICIT_INSTANTIATION (result
))
9283 No program shall explicitly instantiate any template more
9286 We check DECL_INTERFACE_KNOWN so as not to complain when the first
9287 instantiation was `extern' and the second is not, and EXTERN_P for
9288 the opposite case. If -frepo, chances are we already got marked
9289 as an explicit instantiation because of the repo file. */
9290 if (DECL_INTERFACE_KNOWN (result
) && !extern_p
&& !flag_use_repository
)
9291 cp_pedwarn ("duplicate explicit instantiation of `%#D'", result
);
9293 /* If we've already instantiated the template, just return now. */
9294 if (DECL_INTERFACE_KNOWN (result
))
9297 else if (!DECL_IMPLICIT_INSTANTIATION (result
))
9299 cp_error ("no matching template for `%D' found", result
);
9302 else if (!DECL_TEMPLATE_INFO (result
))
9304 cp_pedwarn ("explicit instantiation of non-template `%#D'", result
);
9308 if (flag_external_templates
)
9311 if (storage
== NULL_TREE
)
9313 else if (storage
== ridpointers
[(int) RID_EXTERN
])
9316 cp_pedwarn ("ISO C++ forbids the use of `extern' on explicit instantiations");
9320 cp_error ("storage class `%D' applied to template instantiation",
9323 SET_DECL_EXPLICIT_INSTANTIATION (result
);
9324 mark_decl_instantiated (result
, extern_p
);
9325 repo_template_instantiated (result
, extern_p
);
9327 instantiate_decl (result
, /*defer_ok=*/1);
9331 mark_class_instantiated (t
, extern_p
)
9335 SET_CLASSTYPE_EXPLICIT_INSTANTIATION (t
);
9336 SET_CLASSTYPE_INTERFACE_KNOWN (t
);
9337 CLASSTYPE_INTERFACE_ONLY (t
) = extern_p
;
9338 CLASSTYPE_VTABLE_NEEDS_WRITING (t
) = ! extern_p
;
9339 TYPE_DECL_SUPPRESS_DEBUG (TYPE_NAME (t
)) = extern_p
;
9342 CLASSTYPE_DEBUG_REQUESTED (t
) = 1;
9343 rest_of_type_compilation (t
, 1);
9347 /* Perform an explicit instantiation of template class T. STORAGE, if
9348 non-null, is the RID for extern, inline or static. COMPLAIN is
9349 non-zero if this is called from the parser, zero if called recursively,
9350 since the standard is unclear (as detailed below). */
9353 do_type_instantiation (t
, storage
, complain
)
9361 if (TREE_CODE (t
) == TYPE_DECL
)
9364 if (! CLASS_TYPE_P (t
) || ! CLASSTYPE_TEMPLATE_INFO (t
))
9366 cp_error ("explicit instantiation of non-template type `%T'", t
);
9372 /* With -fexternal-templates, explicit instantiations are treated the same
9373 as implicit ones. */
9374 if (flag_external_templates
)
9377 if (!COMPLETE_TYPE_P (t
))
9380 cp_error ("explicit instantiation of `%#T' before definition of template",
9385 if (storage
!= NULL_TREE
)
9388 cp_pedwarn("ISO C++ forbids the use of `%s' on explicit instantiations",
9389 IDENTIFIER_POINTER (storage
));
9391 if (storage
== ridpointers
[(int) RID_INLINE
])
9393 else if (storage
== ridpointers
[(int) RID_EXTERN
])
9395 else if (storage
== ridpointers
[(int) RID_STATIC
])
9399 cp_error ("storage class `%D' applied to template instantiation",
9405 if (CLASSTYPE_TEMPLATE_SPECIALIZATION (t
))
9409 No program shall both explicitly instantiate and explicitly
9410 specialize a template. */
9413 cp_error ("explicit instantiation of `%#T' after", t
);
9414 cp_error_at ("explicit specialization here", t
);
9418 else if (CLASSTYPE_EXPLICIT_INSTANTIATION (t
))
9422 No program shall explicitly instantiate any template more
9425 If CLASSTYPE_INTERFACE_ONLY, then the first explicit instantiation
9426 was `extern'. If EXTERN_P then the second is. If -frepo, chances
9427 are we already got marked as an explicit instantion because of the
9428 repo file. All these cases are OK. */
9429 if (!CLASSTYPE_INTERFACE_ONLY (t
) && !extern_p
&& !flag_use_repository
9431 cp_pedwarn ("duplicate explicit instantiation of `%#T'", t
);
9433 /* If we've already instantiated the template, just return now. */
9434 if (!CLASSTYPE_INTERFACE_ONLY (t
))
9438 mark_class_instantiated (t
, extern_p
);
9439 repo_template_instantiated (t
, extern_p
);
9447 /* In contrast to implicit instantiation, where only the
9448 declarations, and not the definitions, of members are
9449 instantiated, we have here:
9453 The explicit instantiation of a class template specialization
9454 implies the instantiation of all of its members not
9455 previously explicitly specialized in the translation unit
9456 containing the explicit instantiation.
9458 Of course, we can't instantiate member template classes, since
9459 we don't have any arguments for them. Note that the standard
9460 is unclear on whether the instantiation of the members are
9461 *explicit* instantiations or not. We choose to be generous,
9462 and not set DECL_EXPLICIT_INSTANTIATION. Therefore, we allow
9463 the explicit instantiation of a class where some of the members
9464 have no definition in the current translation unit. */
9467 for (tmp
= TYPE_METHODS (t
); tmp
; tmp
= TREE_CHAIN (tmp
))
9468 if (TREE_CODE (tmp
) == FUNCTION_DECL
9469 && DECL_TEMPLATE_INSTANTIATION (tmp
))
9471 mark_decl_instantiated (tmp
, extern_p
);
9472 repo_template_instantiated (tmp
, extern_p
);
9474 instantiate_decl (tmp
, /*defer_ok=*/1);
9477 for (tmp
= TYPE_FIELDS (t
); tmp
; tmp
= TREE_CHAIN (tmp
))
9478 if (TREE_CODE (tmp
) == VAR_DECL
&& DECL_TEMPLATE_INSTANTIATION (tmp
))
9480 mark_decl_instantiated (tmp
, extern_p
);
9481 repo_template_instantiated (tmp
, extern_p
);
9483 instantiate_decl (tmp
, /*defer_ok=*/1);
9486 for (tmp
= CLASSTYPE_TAGS (t
); tmp
; tmp
= TREE_CHAIN (tmp
))
9487 if (IS_AGGR_TYPE (TREE_VALUE (tmp
))
9488 && !uses_template_parms (CLASSTYPE_TI_ARGS (TREE_VALUE (tmp
))))
9489 do_type_instantiation (TYPE_MAIN_DECL (TREE_VALUE (tmp
)), storage
, 0);
9493 /* Given a function DECL, which is a specialization of TMPL, modify
9494 DECL to be a re-instantiation of TMPL with the same template
9495 arguments. TMPL should be the template into which tsubst'ing
9496 should occur for DECL, not the most general template.
9498 One reason for doing this is a scenario like this:
9501 void f(const T&, int i);
9503 void g() { f(3, 7); }
9506 void f(const T& t, const int i) { }
9508 Note that when the template is first instantiated, with
9509 instantiate_template, the resulting DECL will have no name for the
9510 first parameter, and the wrong type for the second. So, when we go
9511 to instantiate the DECL, we regenerate it. */
9514 regenerate_decl_from_template (decl
, tmpl
)
9518 /* The most general version of TMPL. */
9520 /* The arguments used to instantiate DECL, from the most general
9527 args
= DECL_TI_ARGS (decl
);
9528 code_pattern
= DECL_TEMPLATE_RESULT (tmpl
);
9530 /* Unregister the specialization so that when we tsubst we will not
9531 just return DECL. We don't have to unregister DECL from TMPL
9532 because if would only be registered there if it were a partial
9533 instantiation of a specialization, which it isn't: it's a full
9535 gen_tmpl
= most_general_template (tmpl
);
9536 unregistered
= unregister_specialization (decl
, gen_tmpl
);
9538 /* If the DECL was not unregistered then something peculiar is
9539 happening: we created a specialization but did not call
9540 register_specialization for it. */
9541 my_friendly_assert (unregistered
, 0);
9543 if (TREE_CODE (decl
) == VAR_DECL
)
9544 /* Make sure that we can see identifiers, and compute access
9545 correctly, for the class members used in the declaration of
9546 this static variable. */
9547 pushclass (DECL_CONTEXT (decl
), 2);
9549 /* Do the substitution to get the new declaration. */
9550 new_decl
= tsubst (code_pattern
, args
, /*complain=*/1, NULL_TREE
);
9552 if (TREE_CODE (decl
) == VAR_DECL
)
9554 /* Set up DECL_INITIAL, since tsubst doesn't. */
9555 DECL_INITIAL (new_decl
) =
9556 tsubst_expr (DECL_INITIAL (code_pattern
), args
,
9557 /*complain=*/1, DECL_TI_TEMPLATE (decl
));
9558 /* Pop the class context we pushed above. */
9561 else if (TREE_CODE (decl
) == FUNCTION_DECL
)
9563 /* Convince duplicate_decls to use the DECL_ARGUMENTS from the
9565 DECL_INITIAL (new_decl
) = error_mark_node
;
9566 /* And don't complain about a duplicate definition. */
9567 DECL_INITIAL (decl
) = NULL_TREE
;
9570 /* The immediate parent of the new template is still whatever it was
9571 before, even though tsubst sets DECL_TI_TEMPLATE up as the most
9572 general template. We also reset the DECL_ASSEMBLER_NAME since
9573 tsubst always calculates the name as if the function in question
9574 were really a template instance, and sometimes, with friend
9575 functions, this is not so. See tsubst_friend_function for
9577 DECL_TI_TEMPLATE (new_decl
) = DECL_TI_TEMPLATE (decl
);
9578 DECL_ASSEMBLER_NAME (new_decl
) = DECL_ASSEMBLER_NAME (decl
);
9579 DECL_RTL (new_decl
) = DECL_RTL (decl
);
9580 DECL_USE_TEMPLATE (new_decl
) = DECL_USE_TEMPLATE (decl
);
9582 /* Call duplicate decls to merge the old and new declarations. */
9583 duplicate_decls (new_decl
, decl
);
9585 /* Now, re-register the specialization. */
9586 register_specialization (decl
, gen_tmpl
, args
);
9589 /* Produce the definition of D, a _DECL generated from a template. If
9590 DEFER_OK is non-zero, then we don't have to actually do the
9591 instantiation now; we just have to do it sometime. */
9594 instantiate_decl (d
, defer_ok
)
9598 tree tmpl
= DECL_TI_TEMPLATE (d
);
9599 tree args
= DECL_TI_ARGS (d
);
9604 int pattern_defined
;
9607 const char *file
= input_filename
;
9609 /* This function should only be used to instantiate templates for
9610 functions and static member variables. */
9611 my_friendly_assert (TREE_CODE (d
) == FUNCTION_DECL
9612 || TREE_CODE (d
) == VAR_DECL
, 0);
9614 /* Don't instantiate cloned functions. Instead, instantiate the
9615 functions they cloned. */
9616 if (TREE_CODE (d
) == FUNCTION_DECL
&& DECL_CLONED_FUNCTION_P (d
))
9617 d
= DECL_CLONED_FUNCTION (d
);
9619 if (DECL_TEMPLATE_INSTANTIATED (d
))
9620 /* D has already been instantiated. It might seem reasonable to
9621 check whether or not D is an explicit instantiation, and, if so,
9622 stop here. But when an explicit instantiation is deferred
9623 until the end of the compilation, DECL_EXPLICIT_INSTANTIATION
9624 is set, even though we still need to do the instantiation. */
9627 /* If we already have a specialization of this declaration, then
9628 there's no reason to instantiate it. Note that
9629 retrieve_specialization gives us both instantiations and
9630 specializations, so we must explicitly check
9631 DECL_TEMPLATE_SPECIALIZATION. */
9632 gen_tmpl
= most_general_template (tmpl
);
9633 spec
= retrieve_specialization (gen_tmpl
, args
);
9634 if (spec
!= NULL_TREE
&& DECL_TEMPLATE_SPECIALIZATION (spec
))
9637 /* This needs to happen before any tsubsting. */
9638 if (! push_tinst_level (d
))
9641 timevar_push (TV_PARSE
);
9643 /* Set TD to the template whose DECL_TEMPLATE_RESULT is the pattern
9644 for the instantiation. This is not always the most general
9645 template. Consider, for example:
9648 struct S { template <class U> void f();
9649 template <> void f<int>(); };
9651 and an instantiation of S<double>::f<int>. We want TD to be the
9652 specialization S<T>::f<int>, not the more general S<T>::f<U>. */
9654 while (/* An instantiation cannot have a definition, so we need a
9655 more general template. */
9656 DECL_TEMPLATE_INSTANTIATION (td
)
9657 /* We must also deal with friend templates. Given:
9659 template <class T> struct S {
9660 template <class U> friend void f() {};
9663 S<int>::f<U> say, is not an instantiation of S<T>::f<U>,
9664 so far as the language is concerned, but that's still
9665 where we get the pattern for the instantiation from. On
9666 other hand, if the definition comes outside the class, say:
9668 template <class T> struct S {
9669 template <class U> friend void f();
9671 template <class U> friend void f() {}
9673 we don't need to look any further. That's what the check for
9674 DECL_INITIAL is for. */
9675 || (TREE_CODE (d
) == FUNCTION_DECL
9676 && DECL_FRIEND_PSEUDO_TEMPLATE_INSTANTIATION (td
)
9677 && !DECL_INITIAL (DECL_TEMPLATE_RESULT (td
))))
9679 /* The present template, TD, should not be a definition. If it
9680 were a definition, we should be using it! Note that we
9681 cannot restructure the loop to just keep going until we find
9682 a template with a definition, since that might go too far if
9683 a specialization was declared, but not defined. */
9684 my_friendly_assert (!(TREE_CODE (d
) == VAR_DECL
9685 && !DECL_IN_AGGR_P (DECL_TEMPLATE_RESULT (td
))),
9688 /* Fetch the more general template. */
9689 td
= DECL_TI_TEMPLATE (td
);
9692 code_pattern
= DECL_TEMPLATE_RESULT (td
);
9694 if (TREE_CODE (d
) == FUNCTION_DECL
)
9695 pattern_defined
= (DECL_SAVED_TREE (code_pattern
) != NULL_TREE
);
9697 pattern_defined
= ! DECL_IN_AGGR_P (code_pattern
);
9699 lineno
= DECL_SOURCE_LINE (d
);
9700 input_filename
= DECL_SOURCE_FILE (d
);
9702 if (pattern_defined
)
9704 repo_template_used (d
);
9706 if (flag_external_templates
&& ! DECL_INTERFACE_KNOWN (d
))
9708 if (flag_alt_external_templates
)
9710 if (interface_unknown
)
9711 warn_if_unknown_interface (d
);
9713 else if (DECL_INTERFACE_KNOWN (code_pattern
))
9715 DECL_INTERFACE_KNOWN (d
) = 1;
9716 DECL_NOT_REALLY_EXTERN (d
) = ! DECL_EXTERNAL (code_pattern
);
9719 warn_if_unknown_interface (code_pattern
);
9723 import_export_decl (d
);
9726 /* We need to set up DECL_INITIAL regardless of pattern_defined if
9727 the variable is a static const initialized in the class body. */
9728 if (TREE_CODE (d
) == VAR_DECL
9729 && TREE_READONLY (d
)
9730 && DECL_INITIAL (d
) == NULL_TREE
9731 && DECL_INITIAL (code_pattern
) != NULL_TREE
)
9733 /* Reject all external templates except inline functions. */
9734 else if (DECL_INTERFACE_KNOWN (d
)
9735 && ! DECL_NOT_REALLY_EXTERN (d
)
9736 && ! (TREE_CODE (d
) == FUNCTION_DECL
&& DECL_INLINE (d
)))
9738 /* Defer all other templates, unless we have been explicitly
9739 forbidden from doing so. We restore the source position here
9740 because it's used by add_pending_template. */
9741 else if (! pattern_defined
|| defer_ok
)
9744 input_filename
= file
;
9746 if (at_eof
&& !pattern_defined
9747 && DECL_EXPLICIT_INSTANTIATION (d
))
9750 The definition of a non-exported function template, a
9751 non-exported member function template, or a non-exported
9752 member function or static data member of a class template
9753 shall be present in every translation unit in which it is
9754 explicitly instantiated. */
9755 cp_error ("explicit instantiation of `%D' but no definition available",
9758 add_pending_template (d
);
9762 need_push
= !global_bindings_p ();
9764 push_to_top_level ();
9766 /* We're now committed to instantiating this template. Mark it as
9767 instantiated so that recursive calls to instantiate_decl do not
9768 try to instantiate it again. */
9769 DECL_TEMPLATE_INSTANTIATED (d
) = 1;
9771 /* Regenerate the declaration in case the template has been modified
9772 by a subsequent redeclaration. */
9773 regenerate_decl_from_template (d
, td
);
9775 /* We already set the file and line above. Reset them now in case
9776 they changed as a result of calling regenerate_decl_from_template. */
9777 lineno
= DECL_SOURCE_LINE (d
);
9778 input_filename
= DECL_SOURCE_FILE (d
);
9780 if (TREE_CODE (d
) == VAR_DECL
)
9782 DECL_IN_AGGR_P (d
) = 0;
9783 if (DECL_INTERFACE_KNOWN (d
))
9784 DECL_EXTERNAL (d
) = ! DECL_NOT_REALLY_EXTERN (d
);
9787 DECL_EXTERNAL (d
) = 1;
9788 DECL_NOT_REALLY_EXTERN (d
) = 1;
9790 cp_finish_decl (d
, DECL_INITIAL (d
), NULL_TREE
, 0);
9792 else if (TREE_CODE (d
) == FUNCTION_DECL
)
9794 htab_t saved_local_specializations
;
9796 /* Save away the current list, in case we are instantiating one
9797 template from within the body of another. */
9798 saved_local_specializations
= local_specializations
;
9800 /* Set up the list of local specializations. */
9801 local_specializations
= htab_create (37,
9806 /* Set up context. */
9807 start_function (NULL_TREE
, d
, NULL_TREE
, SF_PRE_PARSED
);
9809 /* We already set up __FUNCTION__, etc., so we don't want to do
9811 function_name_declared_p
= 1;
9813 /* Substitute into the body of the function. */
9814 tsubst_expr (DECL_SAVED_TREE (code_pattern
), args
,
9815 /*complain=*/1, tmpl
);
9817 /* We don't need the local specializations any more. */
9818 htab_delete (local_specializations
);
9819 local_specializations
= saved_local_specializations
;
9821 /* Finish the function. */
9822 expand_body (finish_function (0));
9825 /* We're not deferring instantiation any more. */
9826 TI_PENDING_TEMPLATE_FLAG (DECL_TEMPLATE_INFO (d
)) = 0;
9829 pop_from_top_level ();
9833 input_filename
= file
;
9837 timevar_pop (TV_PARSE
);
9842 /* Run through the list of templates that we wish we could
9843 instantiate, and instantiate any we can. */
9846 instantiate_pending_templates ()
9849 int instantiated_something
= 0;
9856 t
= &pending_templates
;
9859 tree instantiation
= TREE_VALUE (*t
);
9861 reopen_tinst_level (TREE_PURPOSE (*t
));
9863 if (TYPE_P (instantiation
))
9867 if (!COMPLETE_TYPE_P (instantiation
))
9869 instantiate_class_template (instantiation
);
9870 if (CLASSTYPE_TEMPLATE_INSTANTIATION (instantiation
))
9871 for (fn
= TYPE_METHODS (instantiation
);
9873 fn
= TREE_CHAIN (fn
))
9874 if (! DECL_ARTIFICIAL (fn
))
9875 instantiate_decl (fn
, /*defer_ok=*/0);
9876 if (COMPLETE_TYPE_P (instantiation
))
9878 instantiated_something
= 1;
9883 if (COMPLETE_TYPE_P (instantiation
))
9884 /* If INSTANTIATION has been instantiated, then we don't
9885 need to consider it again in the future. */
9886 *t
= TREE_CHAIN (*t
);
9888 t
= &TREE_CHAIN (*t
);
9892 if (!DECL_TEMPLATE_SPECIALIZATION (instantiation
)
9893 && !DECL_TEMPLATE_INSTANTIATED (instantiation
))
9895 instantiation
= instantiate_decl (instantiation
,
9897 if (DECL_TEMPLATE_INSTANTIATED (instantiation
))
9899 instantiated_something
= 1;
9904 if (DECL_TEMPLATE_SPECIALIZATION (instantiation
)
9905 || DECL_TEMPLATE_INSTANTIATED (instantiation
))
9906 /* If INSTANTIATION has been instantiated, then we don't
9907 need to consider it again in the future. */
9908 *t
= TREE_CHAIN (*t
);
9910 t
= &TREE_CHAIN (*t
);
9913 current_tinst_level
= NULL_TREE
;
9917 /* Go through the things that are template instantiations if we are
9918 using guiding declarations. */
9919 t
= &maybe_templates
;
9926 fn
= TREE_VALUE (*t
);
9928 if (DECL_INITIAL (fn
))
9929 /* If the FN is already defined, then it was either already
9930 instantiated or, even though guiding declarations were
9931 allowed, a non-template definition was provided. */
9935 template = TREE_PURPOSE (*t
);
9936 args
= get_bindings (template, fn
, NULL_TREE
);
9937 fn
= instantiate_template (template, args
);
9938 instantiate_decl (fn
, /*defer_ok=*/0);
9942 /* Remove this entry from the chain. */
9943 *t
= TREE_CHAIN (*t
);
9945 maybe_template_tail
= t
;
9949 return instantiated_something
;
9952 /* Substitute ARGVEC into T, which is a list of initializers for
9953 either base class or a non-static data member. The TREE_PURPOSEs
9954 are DECLs, and the TREE_VALUEs are the initializer values. Used by
9955 instantiate_decl. */
9958 tsubst_initializer_list (t
, argvec
)
9961 tree first
= NULL_TREE
;
9964 for (; t
; t
= TREE_CHAIN (t
))
9970 decl
= tsubst_copy (TREE_PURPOSE (t
), argvec
, /*complain=*/1,
9972 init
= tsubst_expr (TREE_VALUE (t
), argvec
, /*complain=*/1,
9977 else if (TREE_CODE (init
) == TREE_LIST
)
9978 for (val
= init
; val
; val
= TREE_CHAIN (val
))
9979 TREE_VALUE (val
) = convert_from_reference (TREE_VALUE (val
));
9981 init
= convert_from_reference (init
);
9983 *p
= build_tree_list (decl
, init
);
9984 p
= &TREE_CHAIN (*p
);
9989 /* Set CURRENT_ACCESS_SPECIFIER based on the protection of DECL. */
9992 set_current_access_from_decl (decl
)
9995 if (TREE_PRIVATE (decl
))
9996 current_access_specifier
= access_private_node
;
9997 else if (TREE_PROTECTED (decl
))
9998 current_access_specifier
= access_protected_node
;
10000 current_access_specifier
= access_public_node
;
10003 /* Instantiate an enumerated type. TAG is the template type, NEWTAG
10004 is the instantiation (which should have been created with
10005 start_enum) and ARGS are the template arguments to use. */
10008 tsubst_enum (tag
, newtag
, args
)
10015 for (e
= TYPE_VALUES (tag
); e
; e
= TREE_CHAIN (e
))
10019 /* Note that in a template enum, the TREE_VALUE is the
10020 CONST_DECL, not the corresponding INTEGER_CST. */
10021 value
= tsubst_expr (DECL_INITIAL (TREE_VALUE (e
)),
10022 args
, /*complain=*/1,
10025 /* Give this enumeration constant the correct access. */
10026 set_current_access_from_decl (TREE_VALUE (e
));
10028 /* Actually build the enumerator itself. */
10029 build_enumerator (TREE_PURPOSE (e
), value
, newtag
);
10032 finish_enum (newtag
);
10033 DECL_SOURCE_LINE (TYPE_NAME (newtag
)) = DECL_SOURCE_LINE (TYPE_NAME (tag
));
10034 DECL_SOURCE_FILE (TYPE_NAME (newtag
)) = DECL_SOURCE_FILE (TYPE_NAME (tag
));
10037 /* DECL is a FUNCTION_DECL that is a template specialization. Return
10038 its type -- but without substituting the innermost set of template
10039 arguments. So, innermost set of template parameters will appear in
10040 the type. If CONTEXTP is non-NULL, then the partially substituted
10041 DECL_CONTEXT (if any) will also be filled in. Similarly, TPARMSP
10042 will be filled in with the substituted template parameters, if it
10046 get_mostly_instantiated_function_type (decl
, contextp
, tparmsp
)
10051 tree context
= NULL_TREE
;
10058 tmpl
= most_general_template (DECL_TI_TEMPLATE (decl
));
10059 targs
= DECL_TI_ARGS (decl
);
10060 tparms
= DECL_TEMPLATE_PARMS (tmpl
);
10061 parm_depth
= TMPL_PARMS_DEPTH (tparms
);
10063 /* There should be as many levels of arguments as there are levels
10065 my_friendly_assert (parm_depth
== TMPL_ARGS_DEPTH (targs
), 0);
10067 fn_type
= TREE_TYPE (tmpl
);
10068 if (DECL_STATIC_FUNCTION_P (decl
))
10069 context
= DECL_CONTEXT (decl
);
10071 if (parm_depth
== 1)
10072 /* No substitution is necessary. */
10079 /* Replace the innermost level of the TARGS with NULL_TREEs to
10080 let tsubst know not to substitute for those parameters. */
10081 partial_args
= make_tree_vec (TREE_VEC_LENGTH (targs
));
10082 for (i
= 1; i
< TMPL_ARGS_DEPTH (targs
); ++i
)
10083 SET_TMPL_ARGS_LEVEL (partial_args
, i
,
10084 TMPL_ARGS_LEVEL (targs
, i
));
10085 SET_TMPL_ARGS_LEVEL (partial_args
,
10086 TMPL_ARGS_DEPTH (targs
),
10087 make_tree_vec (DECL_NTPARMS (tmpl
)));
10089 /* Now, do the (partial) substitution to figure out the
10090 appropriate function type. */
10091 fn_type
= tsubst (fn_type
, partial_args
, /*complain=*/1, NULL_TREE
);
10092 if (DECL_STATIC_FUNCTION_P (decl
))
10093 context
= tsubst (context
, partial_args
, /*complain=*/1, NULL_TREE
);
10095 /* Substitute into the template parameters to obtain the real
10096 innermost set of parameters. This step is important if the
10097 innermost set of template parameters contains value
10098 parameters whose types depend on outer template parameters. */
10099 TREE_VEC_LENGTH (partial_args
)--;
10100 tparms
= tsubst_template_parms (tparms
, partial_args
, /*complain=*/1);
10104 *contextp
= context
;
10111 /* Set the DECL_ASSEMBLER_NAME for DECL, which is a FUNCTION_DECL that
10112 is either an instantiation or specialization of a template
10116 set_mangled_name_for_template_decl (decl
)
10119 tree context
= NULL_TREE
;
10126 my_friendly_assert (TREE_CODE (decl
) == FUNCTION_DECL
, 0);
10127 my_friendly_assert (DECL_TEMPLATE_INFO (decl
) != NULL_TREE
, 0);
10129 /* Under the new ABI, we don't need special machinery. */
10132 set_mangled_name_for_decl (decl
);
10136 /* The names of template functions must be mangled so as to indicate
10137 what template is being specialized with what template arguments.
10138 For example, each of the following three functions must get
10139 different mangled names:
10142 template <> void f<7>(int);
10143 template <> void f<8>(int); */
10145 targs
= DECL_TI_ARGS (decl
);
10146 if (uses_template_parms (targs
))
10147 /* This DECL is for a partial instantiation. There's no need to
10148 mangle the name of such an entity. */
10151 /* We now compute the PARMS and RET_TYPE to give to
10152 build_decl_overload_real. The PARMS and RET_TYPE are the
10153 parameter and return types of the template, after all but the
10154 innermost template arguments have been substituted, not the
10155 parameter and return types of the function DECL. For example,
10158 template <class T> T f(T);
10160 both PARMS and RET_TYPE should be `T' even if DECL is `int f(int)'.
10161 A more subtle example is:
10163 template <class T> struct S { template <class U> void f(T, U); }
10165 Here, if DECL is `void S<int>::f(int, double)', PARMS should be
10166 {int, U}. Thus, the args that we want to subsitute into the
10167 return and parameter type for the function are those in TARGS,
10168 with the innermost level omitted. */
10169 fn_type
= get_mostly_instantiated_function_type (decl
, &context
, &tparms
);
10171 /* Now, get the innermost parameters and arguments, and figure out
10172 the parameter and return types. */
10173 tparms
= INNERMOST_TEMPLATE_PARMS (tparms
);
10174 targs
= INNERMOST_TEMPLATE_ARGS (targs
);
10175 ret_type
= TREE_TYPE (fn_type
);
10176 parm_types
= TYPE_ARG_TYPES (fn_type
);
10178 /* For a static member function, we generate a fake `this' pointer,
10179 for the purposes of mangling. This indicates of which class the
10180 function is a member. Because of:
10184 There shall not be a static and a nonstatic member function
10185 with the same name and the same parameter types
10187 we don't have to worry that this will result in a clash with a
10188 non-static member function. */
10189 if (DECL_STATIC_FUNCTION_P (decl
))
10190 parm_types
= hash_tree_chain (build_pointer_type (context
), parm_types
);
10192 /* There should be the same number of template parameters as
10193 template arguments. */
10194 my_friendly_assert (TREE_VEC_LENGTH (tparms
) == TREE_VEC_LENGTH (targs
),
10197 /* Actually set the DECL_ASSEMBLER_NAME. */
10198 DECL_ASSEMBLER_NAME (decl
)
10199 = build_decl_overload_real (decl
, parm_types
, ret_type
,
10201 DECL_FUNCTION_MEMBER_P (decl
)
10202 + DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (decl
));
10205 /* Return truthvalue if we're processing a template different from
10206 the last one involved in diagnostics. */
10208 problematic_instantiation_changed ()
10210 return last_template_error_tick
!= tinst_level_tick
;
10213 /* Remember current template involved in diagnostics. */
10215 record_last_problematic_instantiation ()
10217 last_template_error_tick
= tinst_level_tick
;
10221 current_instantiation ()
10223 return current_tinst_level
;