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
))
3965 *tp
= TREE_CHAIN (*tp
);
3967 = DECL_TEMPLATE_INSTANTIATIONS (template);
3968 DECL_TEMPLATE_INSTANTIATIONS (template) = found
;
3969 return TREE_VALUE (found
);
3972 /* This type is a "partial instantiation" if any of the template
3973 arguments still involve template parameters. Note that we set
3974 IS_PARTIAL_INSTANTIATION for partial specializations as
3976 is_partial_instantiation
= uses_template_parms (arglist
);
3978 if (!is_partial_instantiation
3979 && !PRIMARY_TEMPLATE_P (template)
3980 && TREE_CODE (CP_DECL_CONTEXT (template)) == NAMESPACE_DECL
)
3982 found
= xref_tag_from_type (TREE_TYPE (template),
3983 DECL_NAME (template),
3988 context
= tsubst (DECL_CONTEXT (template), arglist
,
3989 /*complain=*/0, in_decl
);
3991 context
= global_namespace
;
3993 /* Create the type. */
3994 if (TREE_CODE (template_type
) == ENUMERAL_TYPE
)
3996 if (!is_partial_instantiation
)
3998 set_current_access_from_decl (TYPE_NAME (template_type
));
3999 t
= start_enum (TYPE_IDENTIFIER (template_type
));
4002 /* We don't want to call start_enum for this type, since
4003 the values for the enumeration constants may involve
4004 template parameters. And, no one should be interested
4005 in the enumeration constants for such a type. */
4006 t
= make_node (ENUMERAL_TYPE
);
4010 t
= make_aggr_type (TREE_CODE (template_type
));
4011 CLASSTYPE_DECLARED_CLASS (t
)
4012 = CLASSTYPE_DECLARED_CLASS (template_type
);
4013 CLASSTYPE_GOT_SEMICOLON (t
) = 1;
4014 SET_CLASSTYPE_IMPLICIT_INSTANTIATION (t
);
4015 TYPE_FOR_JAVA (t
) = TYPE_FOR_JAVA (template_type
);
4017 /* A local class. Make sure the decl gets registered properly. */
4018 if (context
== current_function_decl
)
4019 pushtag (DECL_NAME (template), t
, 0);
4022 /* If we called start_enum or pushtag above, this information
4023 will already be set up. */
4026 TYPE_CONTEXT (t
) = FROB_CONTEXT (context
);
4028 type_decl
= create_implicit_typedef (DECL_NAME (template), t
);
4029 DECL_CONTEXT (type_decl
) = TYPE_CONTEXT (t
);
4030 TYPE_STUB_DECL (t
) = type_decl
;
4031 DECL_SOURCE_FILE (type_decl
)
4032 = DECL_SOURCE_FILE (TYPE_STUB_DECL (template_type
));
4033 DECL_SOURCE_LINE (type_decl
)
4034 = DECL_SOURCE_LINE (TYPE_STUB_DECL (template_type
));
4037 type_decl
= TYPE_NAME (t
);
4039 /* Set up the template information. We have to figure out which
4040 template is the immediate parent if this is a full
4042 if (parm_depth
== 1 || is_partial_instantiation
4043 || !PRIMARY_TEMPLATE_P (template))
4044 /* This case is easy; there are no member templates involved. */
4048 /* This is a full instantiation of a member template. Look
4049 for a partial instantiation of which this is an instance. */
4051 for (found
= DECL_TEMPLATE_INSTANTIATIONS (template);
4052 found
; found
= TREE_CHAIN (found
))
4055 tree tmpl
= CLASSTYPE_TI_TEMPLATE (TREE_VALUE (found
));
4057 /* We only want partial instantiations, here, not
4058 specializations or full instantiations. */
4059 if (CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_VALUE (found
))
4060 || !uses_template_parms (TREE_VALUE (found
)))
4063 /* Temporarily reduce by one the number of levels in the
4064 ARGLIST and in FOUND so as to avoid comparing the
4065 last set of arguments. */
4066 TREE_VEC_LENGTH (arglist
)--;
4067 TREE_VEC_LENGTH (TREE_PURPOSE (found
)) --;
4069 /* See if the arguments match. If they do, then TMPL is
4070 the partial instantiation we want. */
4071 success
= comp_template_args (TREE_PURPOSE (found
), arglist
);
4073 /* Restore the argument vectors to their full size. */
4074 TREE_VEC_LENGTH (arglist
)++;
4075 TREE_VEC_LENGTH (TREE_PURPOSE (found
))++;
4086 /* There was no partial instantiation. This happens
4087 where C<T> is a member template of A<T> and it's used
4090 template <typename T> struct B { A<T>::C<int> m; };
4093 Create the partial instantiation.
4095 TREE_VEC_LENGTH (arglist
)--;
4096 template = tsubst (template, arglist
, /*complain=*/0, NULL_TREE
);
4097 TREE_VEC_LENGTH (arglist
)++;
4102 SET_TYPE_TEMPLATE_INFO (t
, tree_cons (found
, arglist
, NULL_TREE
));
4103 DECL_TEMPLATE_INSTANTIATIONS (template)
4104 = tree_cons (arglist
, t
,
4105 DECL_TEMPLATE_INSTANTIATIONS (template));
4107 if (TREE_CODE (t
) == ENUMERAL_TYPE
4108 && !is_partial_instantiation
)
4109 /* Now that the type has been registered on the instantiations
4110 list, we set up the enumerators. Because the enumeration
4111 constants may involve the enumeration type itself, we make
4112 sure to register the type first, and then create the
4113 constants. That way, doing tsubst_expr for the enumeration
4114 constants won't result in recursive calls here; we'll find
4115 the instantiation and exit above. */
4116 tsubst_enum (template_type
, t
, arglist
);
4118 /* Reset the name of the type, now that CLASSTYPE_TEMPLATE_INFO
4120 if (TREE_CODE (t
) != ENUMERAL_TYPE
)
4121 DECL_NAME (type_decl
) = classtype_mangled_name (t
);
4122 DECL_ASSEMBLER_NAME (type_decl
) = DECL_NAME (type_decl
);
4123 if (!is_partial_instantiation
)
4126 DECL_ASSEMBLER_NAME (type_decl
) = mangle_decl (type_decl
);
4128 DECL_ASSEMBLER_NAME (type_decl
)
4129 = get_identifier (build_overload_name (t
, 1, 1));
4131 /* For backwards compatibility; code that uses
4132 -fexternal-templates expects looking up a template to
4133 instantiate it. I think DDD still relies on this.
4134 (jason 8/20/1998) */
4135 if (TREE_CODE (t
) != ENUMERAL_TYPE
4136 && flag_external_templates
4137 && CLASSTYPE_INTERFACE_KNOWN (TREE_TYPE (template))
4138 && ! CLASSTYPE_INTERFACE_ONLY (TREE_TYPE (template)))
4139 add_pending_template (t
);
4142 /* If the type makes use of template parameters, the
4143 code that generates debugging information will crash. */
4144 DECL_IGNORED_P (TYPE_STUB_DECL (t
)) = 1;
4156 /* Called from for_each_template_parm via walk_tree. */
4159 for_each_template_parm_r (tp
, walk_subtrees
, d
)
4165 struct pair_fn_data
*pfd
= (struct pair_fn_data
*) d
;
4166 tree_fn_t fn
= pfd
->fn
;
4167 void *data
= pfd
->data
;
4170 && for_each_template_parm (TYPE_CONTEXT (t
), fn
, data
))
4171 return error_mark_node
;
4173 switch (TREE_CODE (t
))
4176 if (TYPE_PTRMEMFUNC_P (t
))
4182 if (!TYPE_TEMPLATE_INFO (t
))
4184 else if (for_each_template_parm (TREE_VALUE (TYPE_TEMPLATE_INFO (t
)),
4186 return error_mark_node
;
4190 /* Since we're not going to walk subtrees, we have to do this
4192 if (for_each_template_parm (TYPE_METHOD_BASETYPE (t
), fn
, data
))
4193 return error_mark_node
;
4196 /* Check the return type. */
4197 if (for_each_template_parm (TREE_TYPE (t
), fn
, data
))
4198 return error_mark_node
;
4200 /* Check the parameter types. Since default arguments are not
4201 instantiated until they are needed, the TYPE_ARG_TYPES may
4202 contain expressions that involve template parameters. But,
4203 no-one should be looking at them yet. And, once they're
4204 instantiated, they don't contain template parameters, so
4205 there's no point in looking at them then, either. */
4209 for (parm
= TYPE_ARG_TYPES (t
); parm
; parm
= TREE_CHAIN (parm
))
4210 if (for_each_template_parm (TREE_VALUE (parm
), fn
, data
))
4211 return error_mark_node
;
4213 /* Since we've already handled the TYPE_ARG_TYPES, we don't
4214 want walk_tree walking into them itself. */
4221 if (DECL_LANG_SPECIFIC (t
) && DECL_TEMPLATE_INFO (t
)
4222 && for_each_template_parm (DECL_TI_ARGS (t
), fn
, data
))
4223 return error_mark_node
;
4228 if (DECL_CONTEXT (t
)
4229 && for_each_template_parm (DECL_CONTEXT (t
), fn
, data
))
4230 return error_mark_node
;
4233 case BOUND_TEMPLATE_TEMPLATE_PARM
:
4234 /* Record template parameters such as `T' inside `TT<T>'. */
4235 if (for_each_template_parm (TYPE_TI_ARGS (t
), fn
, data
))
4236 return error_mark_node
;
4239 case TEMPLATE_TEMPLATE_PARM
:
4240 case TEMPLATE_TYPE_PARM
:
4241 case TEMPLATE_PARM_INDEX
:
4242 if (fn
&& (*fn
)(t
, data
))
4243 return error_mark_node
;
4245 return error_mark_node
;
4249 /* A template template parameter is encountered */
4250 if (DECL_TEMPLATE_TEMPLATE_PARM_P (t
)
4251 && for_each_template_parm (TREE_TYPE (t
), fn
, data
))
4252 return error_mark_node
;
4254 /* Already substituted template template parameter */
4259 if (!fn
|| for_each_template_parm (TYPENAME_TYPE_FULLNAME (t
), fn
, data
))
4260 return error_mark_node
;
4264 if (TREE_TYPE (t
) && TYPE_PTRMEMFUNC_P (TREE_TYPE (t
))
4265 && for_each_template_parm (TYPE_PTRMEMFUNC_FN_TYPE
4266 (TREE_TYPE (t
)), fn
, data
))
4267 return error_mark_node
;
4272 /* If there's no type, then this thing must be some expression
4273 involving template parameters. */
4274 if (!fn
&& !TREE_TYPE (t
))
4275 return error_mark_node
;
4280 case REINTERPRET_CAST_EXPR
:
4281 case CONST_CAST_EXPR
:
4282 case STATIC_CAST_EXPR
:
4283 case DYNAMIC_CAST_EXPR
:
4288 case PSEUDO_DTOR_EXPR
:
4290 return error_mark_node
;
4297 /* We didn't find any template parameters we liked. */
4301 /* For each TEMPLATE_TYPE_PARM, TEMPLATE_TEMPLATE_PARM,
4302 BOUND_TEMPLATE_TEMPLATE_PARM or TEMPLATE_PARM_INDEX in T,
4303 call FN with the parameter and the DATA.
4304 If FN returns non-zero, the iteration is terminated, and
4305 for_each_template_parm returns 1. Otherwise, the iteration
4306 continues. If FN never returns a non-zero value, the value
4307 returned by for_each_template_parm is 0. If FN is NULL, it is
4308 considered to be the function which always returns 1. */
4311 for_each_template_parm (t
, fn
, data
)
4316 struct pair_fn_data pfd
;
4322 /* Walk the tree. */
4323 return walk_tree_without_duplicates (&t
,
4324 for_each_template_parm_r
,
4329 uses_template_parms (t
)
4332 return for_each_template_parm (t
, 0, 0);
4335 static int tinst_depth
;
4336 extern int max_tinst_depth
;
4337 #ifdef GATHER_STATISTICS
4340 static int tinst_level_tick
;
4341 static int last_template_error_tick
;
4343 /* We're starting to instantiate D; record the template instantiation context
4344 for diagnostics and to restore it later. */
4347 push_tinst_level (d
)
4352 if (tinst_depth
>= max_tinst_depth
)
4354 /* If the instantiation in question still has unbound template parms,
4355 we don't really care if we can't instantiate it, so just return.
4356 This happens with base instantiation for implicit `typename'. */
4357 if (uses_template_parms (d
))
4360 last_template_error_tick
= tinst_level_tick
;
4361 cp_error ("template instantiation depth exceeds maximum of %d (use -ftemplate-depth-NN to increase the maximum) instantiating `%D'",
4362 max_tinst_depth
, d
);
4364 print_instantiation_context ();
4369 new = build_expr_wfl (d
, input_filename
, lineno
, 0);
4370 TREE_CHAIN (new) = current_tinst_level
;
4371 current_tinst_level
= new;
4374 #ifdef GATHER_STATISTICS
4375 if (tinst_depth
> depth_reached
)
4376 depth_reached
= tinst_depth
;
4383 /* We're done instantiating this template; return to the instantiation
4389 tree old
= current_tinst_level
;
4391 /* Restore the filename and line number stashed away when we started
4392 this instantiation. */
4393 lineno
= TINST_LINE (old
);
4394 input_filename
= TINST_FILE (old
);
4395 extract_interface_info ();
4397 current_tinst_level
= TREE_CHAIN (old
);
4402 /* We're instantiating a deferred template; restore the template
4403 instantiation context in which the instantiation was requested, which
4404 is one step out from LEVEL. */
4407 reopen_tinst_level (level
)
4413 for (t
= level
; t
; t
= TREE_CHAIN (t
))
4416 current_tinst_level
= level
;
4420 /* Return the outermost template instantiation context, for use with
4421 -falt-external-templates. */
4426 tree p
= current_tinst_level
;
4429 for (; TREE_CHAIN (p
) ; p
= TREE_CHAIN (p
))
4434 /* DECL is a friend FUNCTION_DECL or TEMPLATE_DECL. ARGS is the
4435 vector of template arguments, as for tsubst.
4437 Returns an appropriate tsubst'd friend declaration. */
4440 tsubst_friend_function (decl
, args
)
4446 const char *file
= input_filename
;
4448 lineno
= DECL_SOURCE_LINE (decl
);
4449 input_filename
= DECL_SOURCE_FILE (decl
);
4451 if (TREE_CODE (decl
) == FUNCTION_DECL
4452 && DECL_TEMPLATE_INSTANTIATION (decl
)
4453 && TREE_CODE (DECL_TI_TEMPLATE (decl
)) != TEMPLATE_DECL
)
4454 /* This was a friend declared with an explicit template
4455 argument list, e.g.:
4459 to indicate that f was a template instantiation, not a new
4460 function declaration. Now, we have to figure out what
4461 instantiation of what template. */
4463 tree template_id
, arglist
, fns
;
4466 tree ns
= CP_DECL_CONTEXT (TYPE_MAIN_DECL (current_class_type
));
4468 /* Friend functions are looked up in the containing namespace scope.
4469 We must enter that scope, to avoid finding member functions of the
4470 current cless with same name. */
4471 push_nested_namespace (ns
);
4472 fns
= tsubst_expr (DECL_TI_TEMPLATE (decl
), args
,
4473 /*complain=*/1, NULL_TREE
);
4474 pop_nested_namespace (ns
);
4475 arglist
= tsubst (DECL_TI_ARGS (decl
), args
,
4476 /*complain=*/1, NULL_TREE
);
4477 template_id
= lookup_template_function (fns
, arglist
);
4479 new_friend
= tsubst (decl
, args
, /*complain=*/1, NULL_TREE
);
4480 tmpl
= determine_specialization (template_id
, new_friend
,
4482 /*need_member_template=*/0);
4483 new_friend
= instantiate_template (tmpl
, new_args
);
4487 new_friend
= tsubst (decl
, args
, /*complain=*/1, NULL_TREE
);
4489 /* The NEW_FRIEND will look like an instantiation, to the
4490 compiler, but is not an instantiation from the point of view of
4491 the language. For example, we might have had:
4493 template <class T> struct S {
4494 template <class U> friend void f(T, U);
4497 Then, in S<int>, template <class U> void f(int, U) is not an
4498 instantiation of anything. */
4499 DECL_USE_TEMPLATE (new_friend
) = 0;
4500 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
4502 DECL_USE_TEMPLATE (DECL_TEMPLATE_RESULT (new_friend
)) = 0;
4503 DECL_SAVED_TREE (DECL_TEMPLATE_RESULT (new_friend
))
4504 = DECL_SAVED_TREE (DECL_TEMPLATE_RESULT (decl
));
4507 /* The mangled name for the NEW_FRIEND is incorrect. The call to
4508 tsubst will have resulted in a call to
4509 set_mangled_name_for_template_decl. But, the function is not a
4510 template instantiation and should not be mangled like one.
4511 Therefore, we remangle the function name. We don't have to do
4512 this if the NEW_FRIEND is a template since
4513 set_mangled_name_for_template_decl doesn't do anything if the
4514 function declaration still uses template arguments. */
4515 if (TREE_CODE (new_friend
) != TEMPLATE_DECL
)
4517 set_mangled_name_for_decl (new_friend
);
4518 DECL_RTL (new_friend
) = 0;
4519 make_decl_rtl (new_friend
, NULL_PTR
, 1);
4522 if (DECL_NAMESPACE_SCOPE_P (new_friend
))
4525 tree new_friend_template_info
;
4526 tree new_friend_result_template_info
;
4528 int new_friend_is_defn
;
4530 /* We must save some information from NEW_FRIEND before calling
4531 duplicate decls since that function will free NEW_FRIEND if
4533 new_friend_template_info
= DECL_TEMPLATE_INFO (new_friend
);
4534 if (TREE_CODE (new_friend
) == TEMPLATE_DECL
)
4536 /* This declaration is a `primary' template. */
4537 DECL_PRIMARY_TEMPLATE (new_friend
) = new_friend
;
4540 = DECL_INITIAL (DECL_TEMPLATE_RESULT (new_friend
)) != NULL_TREE
;
4541 new_friend_result_template_info
4542 = DECL_TEMPLATE_INFO (DECL_TEMPLATE_RESULT (new_friend
));
4546 new_friend_is_defn
= DECL_INITIAL (new_friend
) != NULL_TREE
;
4547 new_friend_result_template_info
= NULL_TREE
;
4550 /* Inside pushdecl_namespace_level, we will push into the
4551 current namespace. However, the friend function should go
4552 into the namespace of the template. */
4553 ns
= decl_namespace_context (new_friend
);
4554 push_nested_namespace (ns
);
4555 old_decl
= pushdecl_namespace_level (new_friend
);
4556 pop_nested_namespace (ns
);
4558 if (old_decl
!= new_friend
)
4560 /* This new friend declaration matched an existing
4561 declaration. For example, given:
4563 template <class T> void f(T);
4564 template <class U> class C {
4565 template <class T> friend void f(T) {}
4568 the friend declaration actually provides the definition
4569 of `f', once C has been instantiated for some type. So,
4570 old_decl will be the out-of-class template declaration,
4571 while new_friend is the in-class definition.
4573 But, if `f' was called before this point, the
4574 instantiation of `f' will have DECL_TI_ARGS corresponding
4575 to `T' but not to `U', references to which might appear
4576 in the definition of `f'. Previously, the most general
4577 template for an instantiation of `f' was the out-of-class
4578 version; now it is the in-class version. Therefore, we
4579 run through all specialization of `f', adding to their
4580 DECL_TI_ARGS appropriately. In particular, they need a
4581 new set of outer arguments, corresponding to the
4582 arguments for this class instantiation.
4584 The same situation can arise with something like this:
4587 template <class T> class C {
4591 when `C<int>' is instantiated. Now, `f(int)' is defined
4594 if (!new_friend_is_defn
)
4595 /* On the other hand, if the in-class declaration does
4596 *not* provide a definition, then we don't want to alter
4597 existing definitions. We can just leave everything
4602 /* Overwrite whatever template info was there before, if
4603 any, with the new template information pertaining to
4605 DECL_TEMPLATE_INFO (old_decl
) = new_friend_template_info
;
4607 if (TREE_CODE (old_decl
) != TEMPLATE_DECL
)
4608 /* duplicate_decls will take care of this case. */
4613 tree new_friend_args
;
4615 DECL_TEMPLATE_INFO (DECL_TEMPLATE_RESULT (old_decl
))
4616 = new_friend_result_template_info
;
4618 new_friend_args
= TI_ARGS (new_friend_template_info
);
4619 for (t
= DECL_TEMPLATE_SPECIALIZATIONS (old_decl
);
4623 tree spec
= TREE_VALUE (t
);
4626 = add_outermost_template_args (new_friend_args
,
4627 DECL_TI_ARGS (spec
));
4630 /* Now, since specializations are always supposed to
4631 hang off of the most general template, we must move
4633 t
= most_general_template (old_decl
);
4636 DECL_TEMPLATE_SPECIALIZATIONS (t
)
4637 = chainon (DECL_TEMPLATE_SPECIALIZATIONS (t
),
4638 DECL_TEMPLATE_SPECIALIZATIONS (old_decl
));
4639 DECL_TEMPLATE_SPECIALIZATIONS (old_decl
) = NULL_TREE
;
4644 /* The information from NEW_FRIEND has been merged into OLD_DECL
4645 by duplicate_decls. */
4646 new_friend
= old_decl
;
4649 else if (COMPLETE_TYPE_P (DECL_CONTEXT (new_friend
)))
4651 /* Check to see that the declaration is really present, and,
4652 possibly obtain an improved declaration. */
4653 tree fn
= check_classfn (DECL_CONTEXT (new_friend
),
4662 input_filename
= file
;
4666 /* FRIEND_TMPL is a friend TEMPLATE_DECL. ARGS is the vector of
4667 template arguments, as for tsubst.
4669 Returns an appropriate tsubst'd friend type or error_mark_node on
4673 tsubst_friend_class (friend_tmpl
, args
)
4680 /* First, we look for a class template. */
4681 tmpl
= lookup_name (DECL_NAME (friend_tmpl
), /*prefer_type=*/0);
4683 /* But, if we don't find one, it might be because we're in a
4684 situation like this:
4692 Here, in the scope of (say) S<int>, `S' is bound to a TYPE_DECL
4693 for `S<int>', not the TEMPLATE_DECL. */
4694 if (!tmpl
|| !DECL_CLASS_TEMPLATE_P (tmpl
))
4696 tmpl
= lookup_name (DECL_NAME (friend_tmpl
), /*prefer_type=*/1);
4697 tmpl
= maybe_get_template_decl_from_type_decl (tmpl
);
4700 if (tmpl
&& DECL_CLASS_TEMPLATE_P (tmpl
))
4702 /* The friend template has already been declared. Just
4703 check to see that the declarations match, and install any new
4704 default parameters. We must tsubst the default parameters,
4705 of course. We only need the innermost template parameters
4706 because that is all that redeclare_class_template will look
4709 = tsubst_template_parms (DECL_TEMPLATE_PARMS (friend_tmpl
),
4710 args
, /*complain=*/1);
4712 return error_mark_node
;
4713 redeclare_class_template (TREE_TYPE (tmpl
), parms
);
4714 friend_type
= TREE_TYPE (tmpl
);
4718 /* The friend template has not already been declared. In this
4719 case, the instantiation of the template class will cause the
4720 injection of this template into the global scope. */
4721 tmpl
= tsubst (friend_tmpl
, args
, /*complain=*/1, NULL_TREE
);
4723 /* The new TMPL is not an instantiation of anything, so we
4724 forget its origins. We don't reset CLASSTYPE_TI_TEMPLATE for
4725 the new type because that is supposed to be the corresponding
4726 template decl, i.e., TMPL. */
4727 DECL_USE_TEMPLATE (tmpl
) = 0;
4728 DECL_TEMPLATE_INFO (tmpl
) = NULL_TREE
;
4729 CLASSTYPE_USE_TEMPLATE (TREE_TYPE (tmpl
)) = 0;
4731 /* Inject this template into the global scope. */
4732 friend_type
= TREE_TYPE (pushdecl_top_level (tmpl
));
4739 instantiate_class_template (type
)
4742 tree
template, args
, pattern
, t
;
4745 if (type
== error_mark_node
)
4746 return error_mark_node
;
4748 if (TYPE_BEING_DEFINED (type
) || COMPLETE_TYPE_P (type
))
4751 /* Figure out which template is being instantiated. */
4752 template = most_general_template (CLASSTYPE_TI_TEMPLATE (type
));
4753 my_friendly_assert (TREE_CODE (template) == TEMPLATE_DECL
, 279);
4755 /* Figure out which arguments are being used to do the
4757 args
= CLASSTYPE_TI_ARGS (type
);
4758 PARTIAL_INSTANTIATION_P (type
) = uses_template_parms (args
);
4760 if (pedantic
&& PARTIAL_INSTANTIATION_P (type
))
4761 /* If this is a partial instantiation, then we can't instantiate
4762 the type; there's no telling whether or not one of the
4763 template parameters might eventually be instantiated to some
4764 value that results in a specialization being used. For
4776 Now, the `S<U>' in `f<int>' is the specialization, not an
4777 instantiation of the original template. */
4780 /* Determine what specialization of the original template to
4782 if (PARTIAL_INSTANTIATION_P (type
))
4783 /* There's no telling which specialization is appropriate at this
4784 point. Since all peeking at the innards of this partial
4785 instantiation are extensions (like the "implicit typename"
4786 extension, which allows users to omit the keyword `typename' on
4787 names that are declared as types in template base classes), we
4788 are free to do what we please.
4790 Trying to figure out which partial instantiation to use can
4791 cause a crash. (Some of the template arguments don't even have
4792 types.) So, we just use the most general version. */
4796 t
= most_specialized_class (template, args
);
4798 if (t
== error_mark_node
)
4800 const char *str
= "candidates are:";
4801 cp_error ("ambiguous class template instantiation for `%#T'", type
);
4802 for (t
= DECL_TEMPLATE_SPECIALIZATIONS (template); t
;
4805 if (get_class_bindings (TREE_VALUE (t
), TREE_PURPOSE (t
),
4808 cp_error_at ("%s %+#T", str
, TREE_TYPE (t
));
4812 TYPE_BEING_DEFINED (type
) = 1;
4813 return error_mark_node
;
4818 pattern
= TREE_TYPE (t
);
4820 pattern
= TREE_TYPE (template);
4822 /* If the template we're instantiating is incomplete, then clearly
4823 there's nothing we can do. */
4824 if (!COMPLETE_TYPE_P (pattern
))
4827 /* If this is a partial instantiation, don't tsubst anything. We will
4828 only use this type for implicit typename, so the actual contents don't
4829 matter. All that matters is whether a particular name is a type. */
4830 if (PARTIAL_INSTANTIATION_P (type
))
4832 /* The fields set here must be kept in sync with those cleared
4833 in begin_class_definition. */
4834 TYPE_BINFO_BASETYPES (type
) = TYPE_BINFO_BASETYPES (pattern
);
4835 TYPE_FIELDS (type
) = TYPE_FIELDS (pattern
);
4836 TYPE_METHODS (type
) = TYPE_METHODS (pattern
);
4837 CLASSTYPE_TAGS (type
) = CLASSTYPE_TAGS (pattern
);
4838 CLASSTYPE_VBASECLASSES (type
) = CLASSTYPE_VBASECLASSES (pattern
);
4840 /* Pretend that the type is complete, so that we will look
4841 inside it during name lookup and such. */
4842 TYPE_SIZE (type
) = bitsize_zero_node
;
4846 /* If we've recursively instantiated too many templates, stop. */
4847 if (! push_tinst_level (type
))
4850 /* Now we're really doing the instantiation. Mark the type as in
4851 the process of being defined. */
4852 TYPE_BEING_DEFINED (type
) = 1;
4854 maybe_push_to_top_level (uses_template_parms (type
));
4858 /* This TYPE is actually a instantiation of of a partial
4859 specialization. We replace the innermost set of ARGS with
4860 the arguments appropriate for substitution. For example,
4863 template <class T> struct S {};
4864 template <class T> struct S<T*> {};
4866 and supposing that we are instantiating S<int*>, ARGS will
4867 present be {int*} but we need {int}. */
4869 = get_class_bindings (TREE_VALUE (t
), TREE_PURPOSE (t
),
4872 /* If there were multiple levels in ARGS, replacing the
4873 innermost level would alter CLASSTYPE_TI_ARGS, which we don't
4874 want, so we make a copy first. */
4875 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (args
))
4877 args
= copy_node (args
);
4878 SET_TMPL_ARGS_LEVEL (args
, TMPL_ARGS_DEPTH (args
), inner_args
);
4884 if (flag_external_templates
)
4886 if (flag_alt_external_templates
)
4888 CLASSTYPE_INTERFACE_ONLY (type
) = interface_only
;
4889 SET_CLASSTYPE_INTERFACE_UNKNOWN_X (type
, interface_unknown
);
4890 CLASSTYPE_VTABLE_NEEDS_WRITING (type
)
4891 = (! CLASSTYPE_INTERFACE_ONLY (type
)
4892 && CLASSTYPE_INTERFACE_KNOWN (type
));
4896 CLASSTYPE_INTERFACE_ONLY (type
) = CLASSTYPE_INTERFACE_ONLY (pattern
);
4897 SET_CLASSTYPE_INTERFACE_UNKNOWN_X
4898 (type
, CLASSTYPE_INTERFACE_UNKNOWN (pattern
));
4899 CLASSTYPE_VTABLE_NEEDS_WRITING (type
)
4900 = (! CLASSTYPE_INTERFACE_ONLY (type
)
4901 && CLASSTYPE_INTERFACE_KNOWN (type
));
4906 SET_CLASSTYPE_INTERFACE_UNKNOWN (type
);
4907 CLASSTYPE_VTABLE_NEEDS_WRITING (type
) = 1;
4910 TYPE_HAS_CONSTRUCTOR (type
) = TYPE_HAS_CONSTRUCTOR (pattern
);
4911 TYPE_HAS_DESTRUCTOR (type
) = TYPE_HAS_DESTRUCTOR (pattern
);
4912 TYPE_OVERLOADS_CALL_EXPR (type
) = TYPE_OVERLOADS_CALL_EXPR (pattern
);
4913 TYPE_OVERLOADS_ARRAY_REF (type
) = TYPE_OVERLOADS_ARRAY_REF (pattern
);
4914 TYPE_OVERLOADS_ARROW (type
) = TYPE_OVERLOADS_ARROW (pattern
);
4915 TYPE_HAS_NEW_OPERATOR (type
) = TYPE_HAS_NEW_OPERATOR (pattern
);
4916 TYPE_HAS_ARRAY_NEW_OPERATOR (type
) = TYPE_HAS_ARRAY_NEW_OPERATOR (pattern
);
4917 TYPE_GETS_DELETE (type
) = TYPE_GETS_DELETE (pattern
);
4918 TYPE_VEC_DELETE_TAKES_SIZE (type
) = TYPE_VEC_DELETE_TAKES_SIZE (pattern
);
4919 TYPE_HAS_ASSIGN_REF (type
) = TYPE_HAS_ASSIGN_REF (pattern
);
4920 TYPE_HAS_CONST_ASSIGN_REF (type
) = TYPE_HAS_CONST_ASSIGN_REF (pattern
);
4921 TYPE_HAS_ABSTRACT_ASSIGN_REF (type
) = TYPE_HAS_ABSTRACT_ASSIGN_REF (pattern
);
4922 TYPE_HAS_INIT_REF (type
) = TYPE_HAS_INIT_REF (pattern
);
4923 TYPE_HAS_CONST_INIT_REF (type
) = TYPE_HAS_CONST_INIT_REF (pattern
);
4924 TYPE_HAS_DEFAULT_CONSTRUCTOR (type
) = TYPE_HAS_DEFAULT_CONSTRUCTOR (pattern
);
4925 TYPE_HAS_CONVERSION (type
) = TYPE_HAS_CONVERSION (pattern
);
4926 TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (type
)
4927 = TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (pattern
);
4928 TYPE_USES_MULTIPLE_INHERITANCE (type
)
4929 = TYPE_USES_MULTIPLE_INHERITANCE (pattern
);
4930 TYPE_USES_VIRTUAL_BASECLASSES (type
)
4931 = TYPE_USES_VIRTUAL_BASECLASSES (pattern
);
4932 TYPE_PACKED (type
) = TYPE_PACKED (pattern
);
4933 TYPE_ALIGN (type
) = TYPE_ALIGN (pattern
);
4934 TYPE_USER_ALIGN (type
) = TYPE_USER_ALIGN (pattern
);
4935 TYPE_FOR_JAVA (type
) = TYPE_FOR_JAVA (pattern
); /* For libjava's JArray<T> */
4936 if (ANON_AGGR_TYPE_P (pattern
))
4937 SET_ANON_AGGR_TYPE_P (type
);
4939 if (TYPE_BINFO_BASETYPES (pattern
))
4941 tree base_list
= NULL_TREE
;
4942 tree pbases
= TYPE_BINFO_BASETYPES (pattern
);
4945 /* Substitute into each of the bases to determine the actual
4947 for (i
= 0; i
< TREE_VEC_LENGTH (pbases
); ++i
)
4953 pbase
= TREE_VEC_ELT (pbases
, i
);
4955 /* Substitute to figure out the base class. */
4956 base
= tsubst (BINFO_TYPE (pbase
), args
,
4957 /*complain=*/1, NULL_TREE
);
4958 if (base
== error_mark_node
)
4961 /* Calculate the correct access node. */
4962 if (TREE_VIA_VIRTUAL (pbase
))
4964 if (TREE_VIA_PUBLIC (pbase
))
4965 access
= access_public_virtual_node
;
4966 else if (TREE_VIA_PROTECTED (pbase
))
4967 access
= access_protected_virtual_node
;
4969 access
= access_private_virtual_node
;
4973 if (TREE_VIA_PUBLIC (pbase
))
4974 access
= access_public_node
;
4975 else if (TREE_VIA_PROTECTED (pbase
))
4976 access
= access_protected_node
;
4978 access
= access_private_node
;
4981 base_list
= tree_cons (access
, base
, base_list
);
4984 /* The list is now in reverse order; correct that. */
4985 base_list
= nreverse (base_list
);
4987 /* Now call xref_basetypes to set up all the base-class
4989 xref_basetypes (TREE_CODE (pattern
) == RECORD_TYPE
4990 ? (CLASSTYPE_DECLARED_CLASS (pattern
)
4991 ? class_type_node
: record_type_node
)
4993 DECL_NAME (TYPE_NAME (pattern
)),
4998 /* Now that our base classes are set up, enter the scope of the
4999 class, so that name lookups into base classes, etc. will work
5000 correctly. This is precisely analogous to what we do in
5001 begin_class_definition when defining an ordinary non-template
5003 pushclass (type
, 1);
5005 for (t
= CLASSTYPE_TAGS (pattern
); t
; t
= TREE_CHAIN (t
))
5007 tree tag
= TREE_VALUE (t
);
5008 tree name
= TYPE_IDENTIFIER (tag
);
5011 newtag
= tsubst (tag
, args
, /*complain=*/1, NULL_TREE
);
5012 if (TREE_CODE (newtag
) != ENUMERAL_TYPE
)
5014 if (TYPE_LANG_SPECIFIC (tag
) && CLASSTYPE_IS_TEMPLATE (tag
))
5015 /* Unfortunately, lookup_template_class sets
5016 CLASSTYPE_IMPLICIT_INSTANTIATION for a partial
5017 instantiation (i.e., for the type of a member template
5018 class nested within a template class.) This behavior is
5019 required for maybe_process_partial_specialization to work
5020 correctly, but is not accurate in this case; the TAG is not
5021 an instantiation of anything. (The corresponding
5022 TEMPLATE_DECL is an instantiation, but the TYPE is not.) */
5023 CLASSTYPE_USE_TEMPLATE (newtag
) = 0;
5025 /* Now, we call pushtag to put this NEWTAG into the scope of
5026 TYPE. We first set up the IDENTIFIER_TYPE_VALUE to avoid
5027 pushtag calling push_template_decl. We don't have to do
5028 this for enums because it will already have been done in
5031 SET_IDENTIFIER_TYPE_VALUE (name
, newtag
);
5032 pushtag (name
, newtag
, /*globalize=*/0);
5036 /* Don't replace enum constants here. */
5037 for (t
= TYPE_FIELDS (pattern
); t
; t
= TREE_CHAIN (t
))
5038 if (TREE_CODE (t
) != CONST_DECL
)
5042 /* The the file and line for this declaration, to assist in
5043 error message reporting. Since we called push_tinst_level
5044 above, we don't need to restore these. */
5045 lineno
= DECL_SOURCE_LINE (t
);
5046 input_filename
= DECL_SOURCE_FILE (t
);
5048 r
= tsubst (t
, args
, /*complain=*/1, NULL_TREE
);
5049 if (TREE_CODE (r
) == VAR_DECL
)
5053 if (DECL_DEFINED_IN_CLASS_P (r
))
5054 init
= tsubst_expr (DECL_INITIAL (t
), args
,
5055 /*complain=*/1, NULL_TREE
);
5059 finish_static_data_member_decl (r
, init
,
5060 /*asmspec_tree=*/NULL_TREE
,
5063 if (DECL_DEFINED_IN_CLASS_P (r
))
5064 check_static_variable_definition (r
, TREE_TYPE (r
));
5067 /* R will have a TREE_CHAIN if and only if it has already been
5068 processed by finish_member_declaration. This can happen
5069 if, for example, it is a TYPE_DECL for a class-scoped
5070 ENUMERAL_TYPE; such a thing will already have been added to
5071 the field list by tsubst_enum above. */
5072 if (!TREE_CHAIN (r
))
5074 set_current_access_from_decl (r
);
5075 finish_member_declaration (r
);
5079 /* Set up the list (TYPE_METHODS) and vector (CLASSTYPE_METHOD_VEC)
5080 for this instantiation. */
5081 for (t
= TYPE_METHODS (pattern
); t
; t
= TREE_CHAIN (t
))
5083 tree r
= tsubst (t
, args
, /*complain=*/1, NULL_TREE
);
5084 set_current_access_from_decl (r
);
5085 finish_member_declaration (r
);
5088 /* Construct the DECL_FRIENDLIST for the new class type. */
5089 typedecl
= TYPE_MAIN_DECL (type
);
5090 for (t
= DECL_FRIENDLIST (TYPE_MAIN_DECL (pattern
));
5096 for (friends
= TREE_VALUE (t
);
5097 friends
!= NULL_TREE
;
5098 friends
= TREE_CHAIN (friends
))
5099 if (TREE_PURPOSE (friends
) == error_mark_node
)
5101 tsubst_friend_function (TREE_VALUE (friends
),
5104 my_friendly_abort (20000216);
5107 for (t
= CLASSTYPE_FRIEND_CLASSES (pattern
);
5111 tree friend_type
= TREE_VALUE (t
);
5112 tree new_friend_type
;
5114 if (TREE_CODE (friend_type
) == TEMPLATE_DECL
)
5115 new_friend_type
= tsubst_friend_class (friend_type
, args
);
5116 else if (uses_template_parms (friend_type
))
5117 new_friend_type
= tsubst (friend_type
, args
, /*complain=*/1,
5121 tree ns
= decl_namespace_context (TYPE_MAIN_DECL (friend_type
));
5123 /* The call to xref_tag_from_type does injection for friend
5125 push_nested_namespace (ns
);
5127 xref_tag_from_type (friend_type
, NULL_TREE
, 1);
5128 pop_nested_namespace (ns
);
5131 if (TREE_CODE (friend_type
) == TEMPLATE_DECL
)
5132 /* Trick make_friend_class into realizing that the friend
5133 we're adding is a template, not an ordinary class. It's
5134 important that we use make_friend_class since it will
5135 perform some error-checking and output cross-reference
5137 ++processing_template_decl
;
5139 if (new_friend_type
!= error_mark_node
)
5140 make_friend_class (type
, new_friend_type
);
5142 if (TREE_CODE (friend_type
) == TEMPLATE_DECL
)
5143 --processing_template_decl
;
5146 for (t
= TYPE_FIELDS (type
); t
; t
= TREE_CHAIN (t
))
5147 if (TREE_CODE (t
) == FIELD_DECL
)
5149 TREE_TYPE (t
) = complete_type (TREE_TYPE (t
));
5150 require_complete_type (t
);
5153 /* Set the file and line number information to whatever is given for
5154 the class itself. This puts error messages involving generated
5155 implicit functions at a predictable point, and the same point
5156 that would be used for non-template classes. */
5157 lineno
= DECL_SOURCE_LINE (typedecl
);
5158 input_filename
= DECL_SOURCE_FILE (typedecl
);
5160 unreverse_member_declarations (type
);
5161 finish_struct_1 (type
);
5162 CLASSTYPE_GOT_SEMICOLON (type
) = 1;
5164 /* Clear this now so repo_template_used is happy. */
5165 TYPE_BEING_DEFINED (type
) = 0;
5166 repo_template_used (type
);
5168 /* Now that the class is complete, instantiate default arguments for
5169 any member functions. We don't do this earlier because the
5170 default arguments may reference members of the class. */
5171 if (!PRIMARY_TEMPLATE_P (template))
5172 for (t
= TYPE_METHODS (type
); t
; t
= TREE_CHAIN (t
))
5173 if (TREE_CODE (t
) == FUNCTION_DECL
5174 /* Implicitly generated member functions will not have template
5175 information; they are not instantiations, but instead are
5176 created "fresh" for each instantiation. */
5177 && DECL_TEMPLATE_INFO (t
))
5178 tsubst_default_arguments (t
);
5181 pop_from_top_level ();
5191 if (t1
== NULL_TREE
)
5192 return t2
== NULL_TREE
;
5193 if (t2
== NULL_TREE
)
5195 /* Don't care if one declares its arg const and the other doesn't -- the
5196 main variant of the arg type is all that matters. */
5197 if (TYPE_MAIN_VARIANT (TREE_VALUE (t1
))
5198 != TYPE_MAIN_VARIANT (TREE_VALUE (t2
)))
5200 return list_eq (TREE_CHAIN (t1
), TREE_CHAIN (t2
));
5203 /* If arg is a non-type template parameter that does not depend on template
5204 arguments, fold it like we weren't in the body of a template. */
5207 maybe_fold_nontype_arg (arg
)
5210 /* If we're not in a template, ARG is already as simple as it's going to
5211 get, and trying to reprocess the trees will break. */
5212 if (! processing_template_decl
)
5215 if (!TYPE_P (arg
) && !uses_template_parms (arg
))
5217 /* Sometimes, one of the args was an expression involving a
5218 template constant parameter, like N - 1. Now that we've
5219 tsubst'd, we might have something like 2 - 1. This will
5220 confuse lookup_template_class, so we do constant folding
5221 here. We have to unset processing_template_decl, to
5222 fool build_expr_from_tree() into building an actual
5225 int saved_processing_template_decl
= processing_template_decl
;
5226 processing_template_decl
= 0;
5227 arg
= fold (build_expr_from_tree (arg
));
5228 processing_template_decl
= saved_processing_template_decl
;
5233 /* Substitute ARGS into the vector of template arguments T. */
5236 tsubst_template_arg_vector (t
, args
, complain
)
5241 int len
= TREE_VEC_LENGTH (t
), need_new
= 0, i
;
5242 tree
*elts
= (tree
*) alloca (len
* sizeof (tree
));
5244 memset ((char *) elts
, 0, len
* sizeof (tree
));
5246 for (i
= 0; i
< len
; i
++)
5248 if (TREE_VEC_ELT (t
, i
) != NULL_TREE
5249 && TREE_CODE (TREE_VEC_ELT (t
, i
)) == TREE_VEC
)
5250 elts
[i
] = tsubst_template_arg_vector (TREE_VEC_ELT (t
, i
),
5253 elts
[i
] = maybe_fold_nontype_arg
5254 (tsubst_expr (TREE_VEC_ELT (t
, i
), args
, complain
,
5257 if (elts
[i
] == error_mark_node
)
5258 return error_mark_node
;
5260 if (elts
[i
] != TREE_VEC_ELT (t
, i
))
5267 t
= make_tree_vec (len
);
5268 for (i
= 0; i
< len
; i
++)
5269 TREE_VEC_ELT (t
, i
) = elts
[i
];
5274 /* Return the result of substituting ARGS into the template parameters
5275 given by PARMS. If there are m levels of ARGS and m + n levels of
5276 PARMS, then the result will contain n levels of PARMS. For
5277 example, if PARMS is `template <class T> template <class U>
5278 template <T*, U, class V>' and ARGS is {{int}, {double}} then the
5279 result will be `template <int*, double, class V>'. */
5282 tsubst_template_parms (parms
, args
, complain
)
5290 for (new_parms
= &r
;
5291 TMPL_PARMS_DEPTH (parms
) > TMPL_ARGS_DEPTH (args
);
5292 new_parms
= &(TREE_CHAIN (*new_parms
)),
5293 parms
= TREE_CHAIN (parms
))
5296 make_tree_vec (TREE_VEC_LENGTH (TREE_VALUE (parms
)));
5299 for (i
= 0; i
< TREE_VEC_LENGTH (new_vec
); ++i
)
5301 tree default_value
=
5302 TREE_PURPOSE (TREE_VEC_ELT (TREE_VALUE (parms
), i
));
5304 TREE_VALUE (TREE_VEC_ELT (TREE_VALUE (parms
), i
));
5306 TREE_VEC_ELT (new_vec
, i
)
5307 = build_tree_list (tsubst (default_value
, args
, complain
,
5309 tsubst (parm_decl
, args
, complain
,
5314 tree_cons (build_int_2 (0, (TMPL_PARMS_DEPTH (parms
)
5315 - TMPL_ARGS_DEPTH (args
))),
5316 new_vec
, NULL_TREE
);
5322 /* Substitute the ARGS into the indicated aggregate (or enumeration)
5323 type T. If T is not an aggregate or enumeration type, it is
5324 handled as if by tsubst. IN_DECL is as for tsubst. If
5325 ENTERING_SCOPE is non-zero, T is the context for a template which
5326 we are presently tsubst'ing. Return the substituted value. */
5329 tsubst_aggr_type (t
, args
, complain
, in_decl
, entering_scope
)
5339 switch (TREE_CODE (t
))
5342 if (TYPE_PTRMEMFUNC_P (t
))
5344 tree r
= build_ptrmemfunc_type
5345 (tsubst (TYPE_PTRMEMFUNC_FN_TYPE (t
), args
, complain
, in_decl
));
5346 return cp_build_qualified_type_real (r
, TYPE_QUALS (t
),
5350 /* else fall through */
5353 if (TYPE_TEMPLATE_INFO (t
))
5359 /* First, determine the context for the type we are looking
5361 if (TYPE_CONTEXT (t
) != NULL_TREE
)
5362 context
= tsubst_aggr_type (TYPE_CONTEXT (t
), args
,
5364 in_decl
, /*entering_scope=*/1);
5366 context
= NULL_TREE
;
5368 /* Then, figure out what arguments are appropriate for the
5369 type we are trying to find. For example, given:
5371 template <class T> struct S;
5372 template <class T, class U> void f(T, U) { S<U> su; }
5374 and supposing that we are instantiating f<int, double>,
5375 then our ARGS will be {int, double}, but, when looking up
5376 S we only want {double}. */
5377 argvec
= tsubst_template_arg_vector (TYPE_TI_ARGS (t
), args
,
5379 if (argvec
== error_mark_node
)
5380 return error_mark_node
;
5382 r
= lookup_template_class (t
, argvec
, in_decl
, context
,
5385 return cp_build_qualified_type_real (r
, TYPE_QUALS (t
),
5389 /* This is not a template type, so there's nothing to do. */
5393 return tsubst (t
, args
, complain
, in_decl
);
5397 /* Substitute into the default argument ARG (a default argument for
5398 FN), which has the indicated TYPE. */
5401 tsubst_default_argument (fn
, type
, arg
)
5406 /* This default argument came from a template. Instantiate the
5407 default argument here, not in tsubst. In the case of
5416 we must be careful to do name lookup in the scope of S<T>,
5417 rather than in the current class. */
5418 if (DECL_CLASS_SCOPE_P (fn
))
5419 pushclass (DECL_CONTEXT (fn
), 2);
5421 arg
= tsubst_expr (arg
, DECL_TI_ARGS (fn
), /*complain=*/1, NULL_TREE
);
5423 if (DECL_CLASS_SCOPE_P (fn
))
5426 /* Make sure the default argument is reasonable. */
5427 arg
= check_default_argument (type
, arg
);
5432 /* Substitute into all the default arguments for FN. */
5435 tsubst_default_arguments (fn
)
5441 tmpl_args
= DECL_TI_ARGS (fn
);
5443 /* If this function is not yet instantiated, we certainly don't need
5444 its default arguments. */
5445 if (uses_template_parms (tmpl_args
))
5448 for (arg
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
5450 arg
= TREE_CHAIN (arg
))
5451 if (TREE_PURPOSE (arg
))
5452 TREE_PURPOSE (arg
) = tsubst_default_argument (fn
,
5454 TREE_PURPOSE (arg
));
5457 /* Substitute the ARGS into the T, which is a _DECL. TYPE is the
5458 (already computed) substitution of ARGS into TREE_TYPE (T), if
5459 appropriate. Return the result of the substitution. IN_DECL is as
5463 tsubst_decl (t
, args
, type
, in_decl
)
5470 const char *saved_filename
;
5473 /* Set the filename and linenumber to improve error-reporting. */
5474 saved_lineno
= lineno
;
5475 saved_filename
= input_filename
;
5476 lineno
= DECL_SOURCE_LINE (t
);
5477 input_filename
= DECL_SOURCE_FILE (t
);
5479 switch (TREE_CODE (t
))
5483 /* We can get here when processing a member template function
5484 of a template class. */
5485 tree decl
= DECL_TEMPLATE_RESULT (t
);
5487 int is_template_template_parm
= DECL_TEMPLATE_TEMPLATE_PARM_P (t
);
5489 if (!is_template_template_parm
)
5491 /* We might already have an instance of this template.
5492 The ARGS are for the surrounding class type, so the
5493 full args contain the tsubst'd args for the context,
5494 plus the innermost args from the template decl. */
5495 tree tmpl_args
= DECL_CLASS_TEMPLATE_P (t
)
5496 ? CLASSTYPE_TI_ARGS (TREE_TYPE (t
))
5497 : DECL_TI_ARGS (DECL_TEMPLATE_RESULT (t
));
5500 full_args
= tsubst_template_arg_vector (tmpl_args
, args
,
5503 /* tsubst_template_arg_vector doesn't copy the vector if
5504 nothing changed. But, *something* should have
5506 my_friendly_assert (full_args
!= tmpl_args
, 0);
5508 spec
= retrieve_specialization (t
, full_args
);
5509 if (spec
!= NULL_TREE
)
5516 /* Make a new template decl. It will be similar to the
5517 original, but will record the current template arguments.
5518 We also create a new function declaration, which is just
5519 like the old one, but points to this new template, rather
5520 than the old one. */
5522 my_friendly_assert (DECL_LANG_SPECIFIC (r
) != 0, 0);
5523 TREE_CHAIN (r
) = NULL_TREE
;
5525 if (is_template_template_parm
)
5527 tree new_decl
= tsubst (decl
, args
, /*complain=*/1, in_decl
);
5528 DECL_TEMPLATE_RESULT (r
) = new_decl
;
5529 TREE_TYPE (r
) = TREE_TYPE (new_decl
);
5534 = tsubst_aggr_type (DECL_CONTEXT (t
), args
,
5535 /*complain=*/1, in_decl
,
5536 /*entering_scope=*/1);
5537 DECL_VIRTUAL_CONTEXT (r
)
5538 = tsubst_aggr_type (DECL_VIRTUAL_CONTEXT (t
), args
,
5539 /*complain=*/1, in_decl
,
5540 /*entering_scope=*/1);
5541 DECL_TEMPLATE_INFO (r
) = build_tree_list (t
, args
);
5543 if (TREE_CODE (decl
) == TYPE_DECL
)
5545 tree new_type
= tsubst (TREE_TYPE (t
), args
,
5546 /*complain=*/1, in_decl
);
5547 TREE_TYPE (r
) = new_type
;
5548 CLASSTYPE_TI_TEMPLATE (new_type
) = r
;
5549 DECL_TEMPLATE_RESULT (r
) = TYPE_MAIN_DECL (new_type
);
5550 DECL_TI_ARGS (r
) = CLASSTYPE_TI_ARGS (new_type
);
5554 tree new_decl
= tsubst (decl
, args
, /*complain=*/1, in_decl
);
5556 DECL_TEMPLATE_RESULT (r
) = new_decl
;
5557 DECL_TI_TEMPLATE (new_decl
) = r
;
5558 TREE_TYPE (r
) = TREE_TYPE (new_decl
);
5559 DECL_TI_ARGS (r
) = DECL_TI_ARGS (new_decl
);
5562 SET_DECL_IMPLICIT_INSTANTIATION (r
);
5563 DECL_TEMPLATE_INSTANTIATIONS (r
) = NULL_TREE
;
5564 DECL_TEMPLATE_SPECIALIZATIONS (r
) = NULL_TREE
;
5566 /* The template parameters for this new template are all the
5567 template parameters for the old template, except the
5568 outermost level of parameters. */
5569 DECL_TEMPLATE_PARMS (r
)
5570 = tsubst_template_parms (DECL_TEMPLATE_PARMS (t
), args
,
5573 if (PRIMARY_TEMPLATE_P (t
))
5574 DECL_PRIMARY_TEMPLATE (r
) = r
;
5576 /* We don't partially instantiate partial specializations. */
5577 if (TREE_CODE (decl
) == TYPE_DECL
)
5580 /* Record this partial instantiation. */
5581 register_specialization (r
, t
,
5582 DECL_TI_ARGS (DECL_TEMPLATE_RESULT (r
)));
5590 tree argvec
= NULL_TREE
;
5597 /* Nobody should be tsubst'ing into non-template functions. */
5598 my_friendly_assert (DECL_TEMPLATE_INFO (t
) != NULL_TREE
, 0);
5600 if (TREE_CODE (DECL_TI_TEMPLATE (t
)) == TEMPLATE_DECL
)
5604 /* Calculate the most general template of which R is a
5605 specialization, and the complete set of arguments used to
5607 gen_tmpl
= most_general_template (DECL_TI_TEMPLATE (t
));
5609 = tsubst_template_arg_vector (DECL_TI_ARGS
5610 (DECL_TEMPLATE_RESULT (gen_tmpl
)),
5611 args
, /*complain=*/1);
5613 /* Check to see if we already have this specialization. */
5614 spec
= retrieve_specialization (gen_tmpl
, argvec
);
5622 /* We can see more levels of arguments than parameters if
5623 there was a specialization of a member template, like
5626 template <class T> struct S { template <class U> void f(); }
5627 template <> template <class U> void S<int>::f(U);
5629 Here, we'll be substituting into the specialization,
5630 because that's where we can find the code we actually
5631 want to generate, but we'll have enough arguments for
5632 the most general template.
5634 We also deal with the peculiar case:
5636 template <class T> struct S {
5637 template <class U> friend void f();
5639 template <class U> void f() {}
5641 template void f<double>();
5643 Here, the ARGS for the instantiation of will be {int,
5644 double}. But, we only need as many ARGS as there are
5645 levels of template parameters in CODE_PATTERN. We are
5646 careful not to get fooled into reducing the ARGS in
5649 template <class T> struct S { template <class U> void f(U); }
5650 template <class T> template <> void S<T>::f(int) {}
5652 which we can spot because the pattern will be a
5653 specialization in this case. */
5654 args_depth
= TMPL_ARGS_DEPTH (args
);
5656 TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (DECL_TI_TEMPLATE (t
)));
5657 if (args_depth
> parms_depth
5658 && !DECL_TEMPLATE_SPECIALIZATION (t
))
5659 args
= get_innermost_template_args (args
, parms_depth
);
5663 /* This special case arises when we have something like this:
5665 template <class T> struct S {
5666 friend void f<int>(int, double);
5669 Here, the DECL_TI_TEMPLATE for the friend declaration
5670 will be a LOOKUP_EXPR or an IDENTIFIER_NODE. We are
5671 being called from tsubst_friend_function, and we want
5672 only to create a new decl (R) with appropriate types so
5673 that we can call determine_specialization. */
5674 my_friendly_assert ((TREE_CODE (DECL_TI_TEMPLATE (t
))
5676 || (TREE_CODE (DECL_TI_TEMPLATE (t
))
5677 == IDENTIFIER_NODE
), 0);
5678 gen_tmpl
= NULL_TREE
;
5681 if (DECL_CLASS_SCOPE_P (t
))
5683 if (DECL_NAME (t
) == constructor_name (DECL_CONTEXT (t
)))
5687 ctx
= tsubst_aggr_type (DECL_CONTEXT (t
), args
,
5689 /*entering_scope=*/1);
5694 ctx
= DECL_CONTEXT (t
);
5696 type
= tsubst (type
, args
, /*complain=*/1, in_decl
);
5697 if (type
== error_mark_node
)
5698 return error_mark_node
;
5700 /* We do NOT check for matching decls pushed separately at this
5701 point, as they may not represent instantiations of this
5702 template, and in any case are considered separate under the
5705 DECL_USE_TEMPLATE (r
) = 0;
5706 TREE_TYPE (r
) = type
;
5708 DECL_CONTEXT (r
) = ctx
;
5709 DECL_VIRTUAL_CONTEXT (r
)
5710 = tsubst_aggr_type (DECL_VIRTUAL_CONTEXT (t
), args
,
5712 /*entering_scope=*/1);
5714 if (member
&& DECL_CONV_FN_P (r
))
5716 /* Type-conversion operator. Reconstruct the name, in
5717 case it's the name of one of the template's parameters. */
5719 DECL_NAME (r
) = mangle_conv_op_name_for_type (TREE_TYPE (type
));
5721 DECL_NAME (r
) = build_typename_overload (TREE_TYPE (type
));
5724 DECL_ARGUMENTS (r
) = tsubst (DECL_ARGUMENTS (t
), args
,
5726 DECL_RESULT (r
) = NULL_TREE
;
5728 TREE_STATIC (r
) = 0;
5729 TREE_PUBLIC (r
) = TREE_PUBLIC (t
);
5730 DECL_EXTERNAL (r
) = 1;
5731 DECL_INTERFACE_KNOWN (r
) = 0;
5732 DECL_DEFER_OUTPUT (r
) = 0;
5733 TREE_CHAIN (r
) = NULL_TREE
;
5734 DECL_PENDING_INLINE_INFO (r
) = 0;
5735 DECL_PENDING_INLINE_P (r
) = 0;
5736 DECL_SAVED_TREE (r
) = NULL_TREE
;
5738 if (DECL_CLONED_FUNCTION (r
))
5740 DECL_CLONED_FUNCTION (r
) = tsubst (DECL_CLONED_FUNCTION (t
),
5741 args
, /*complain=*/1, t
);
5742 TREE_CHAIN (r
) = TREE_CHAIN (DECL_CLONED_FUNCTION (r
));
5743 TREE_CHAIN (DECL_CLONED_FUNCTION (r
)) = r
;
5746 /* Set up the DECL_TEMPLATE_INFO for R and compute its mangled
5747 name. There's no need to do this in the special friend
5748 case mentioned above where GEN_TMPL is NULL. */
5751 DECL_TEMPLATE_INFO (r
)
5752 = tree_cons (gen_tmpl
, argvec
, NULL_TREE
);
5753 SET_DECL_IMPLICIT_INSTANTIATION (r
);
5754 register_specialization (r
, gen_tmpl
, argvec
);
5756 /* Set the mangled name for R. */
5757 if (DECL_DESTRUCTOR_P (t
))
5760 set_mangled_name_for_decl (r
);
5762 DECL_ASSEMBLER_NAME (r
) = build_destructor_name (ctx
);
5766 /* Instantiations of template functions must be mangled
5767 specially, in order to conform to 14.5.5.1
5768 [temp.over.link]. */
5769 tree tmpl
= DECL_TI_TEMPLATE (t
);
5771 /* TMPL will be NULL if this is a specialization of a
5772 member function of a template class. */
5773 if (name_mangling_version
< 1
5774 || tmpl
== NULL_TREE
5775 || (member
&& !is_member_template (tmpl
)
5776 && !DECL_TEMPLATE_INFO (tmpl
)))
5777 set_mangled_name_for_decl (r
);
5779 set_mangled_name_for_template_decl (r
);
5783 make_decl_rtl (r
, NULL_PTR
, 1);
5785 /* Like grokfndecl. If we don't do this, pushdecl will
5786 mess up our TREE_CHAIN because it doesn't find a
5787 previous decl. Sigh. */
5789 && ! uses_template_parms (r
)
5790 && (IDENTIFIER_GLOBAL_VALUE (DECL_ASSEMBLER_NAME (r
))
5792 SET_IDENTIFIER_GLOBAL_VALUE (DECL_ASSEMBLER_NAME (r
), r
);
5794 /* We're not supposed to instantiate default arguments
5795 until they are called, for a template. But, for a
5798 template <class T> void f ()
5799 { extern void g(int i = T()); }
5801 we should do the substitution when the template is
5802 instantiated. We handle the member function case in
5803 instantiate_class_template since the default arguments
5804 might refer to other members of the class. */
5806 && !PRIMARY_TEMPLATE_P (gen_tmpl
)
5807 && !uses_template_parms (argvec
))
5808 tsubst_default_arguments (r
);
5811 /* Copy the list of befriending classes. */
5812 for (friends
= &DECL_BEFRIENDING_CLASSES (r
);
5814 friends
= &TREE_CHAIN (*friends
))
5816 *friends
= copy_node (*friends
);
5817 TREE_VALUE (*friends
) = tsubst (TREE_VALUE (*friends
),
5818 args
, /*complain=*/1,
5822 if (DECL_CONSTRUCTOR_P (r
) || DECL_DESTRUCTOR_P (r
))
5824 maybe_retrofit_in_chrg (r
);
5825 if (DECL_CONSTRUCTOR_P (r
))
5826 grok_ctor_properties (ctx
, r
);
5827 /* If this is an instantiation of a member template, clone it.
5828 If it isn't, that'll be handled by
5829 clone_constructors_and_destructors. */
5830 if (PRIMARY_TEMPLATE_P (gen_tmpl
))
5831 clone_function_decl(r
, /*update_method_vec_p=*/0);
5833 else if (IDENTIFIER_OPNAME_P (DECL_NAME (r
)))
5834 grok_op_properties (r
, DECL_VIRTUAL_P (r
), DECL_FRIEND_P (r
));
5841 TREE_TYPE (r
) = type
;
5842 c_apply_type_quals_to_decl (CP_TYPE_QUALS (type
), r
);
5844 if (TREE_CODE (DECL_INITIAL (r
)) != TEMPLATE_PARM_INDEX
)
5845 DECL_INITIAL (r
) = TREE_TYPE (r
);
5847 DECL_INITIAL (r
) = tsubst (DECL_INITIAL (r
), args
,
5848 /*complain=*/1, in_decl
);
5850 DECL_CONTEXT (r
) = NULL_TREE
;
5851 if (PROMOTE_PROTOTYPES
5852 && (TREE_CODE (type
) == INTEGER_TYPE
5853 || TREE_CODE (type
) == ENUMERAL_TYPE
)
5854 && TYPE_PRECISION (type
) < TYPE_PRECISION (integer_type_node
))
5855 DECL_ARG_TYPE (r
) = integer_type_node
;
5857 TREE_CHAIN (r
) = tsubst (TREE_CHAIN (t
), args
,
5858 /*complain=*/1, TREE_CHAIN (t
));
5865 TREE_TYPE (r
) = type
;
5866 c_apply_type_quals_to_decl (CP_TYPE_QUALS (type
), r
);
5868 /* We don't have to set DECL_CONTEXT here; it is set by
5869 finish_member_declaration. */
5870 DECL_INITIAL (r
) = tsubst_expr (DECL_INITIAL (t
), args
,
5871 /*complain=*/1, in_decl
);
5872 TREE_CHAIN (r
) = NULL_TREE
;
5873 if (TREE_CODE (type
) == VOID_TYPE
)
5874 cp_error_at ("instantiation of `%D' as type void", r
);
5882 = tsubst_copy (DECL_INITIAL (t
), args
, /*complain=*/1, in_decl
);
5883 TREE_CHAIN (r
) = NULL_TREE
;
5888 if (TREE_CODE (type
) == TEMPLATE_TEMPLATE_PARM
5889 || t
== TYPE_MAIN_DECL (TREE_TYPE (t
)))
5891 /* If this is the canonical decl, we don't have to mess with
5892 instantiations, and often we can't (for typename, template
5893 type parms and such). Note that TYPE_NAME is not correct for
5894 the above test if we've copied the type for a typedef. */
5895 r
= TYPE_NAME (type
);
5903 tree argvec
= NULL_TREE
;
5904 tree gen_tmpl
= NULL_TREE
;
5906 tree tmpl
= NULL_TREE
;
5910 /* Assume this is a non-local variable. */
5913 if (TYPE_P (CP_DECL_CONTEXT (t
)))
5914 ctx
= tsubst_aggr_type (DECL_CONTEXT (t
), args
,
5916 in_decl
, /*entering_scope=*/1);
5919 /* Subsequent calls to pushdecl will fill this in. */
5921 if (!DECL_NAMESPACE_SCOPE_P (t
))
5925 /* Check to see if we already have this specialization. */
5928 tmpl
= DECL_TI_TEMPLATE (t
);
5929 gen_tmpl
= most_general_template (tmpl
);
5930 argvec
= tsubst (DECL_TI_ARGS (t
), args
, /*complain=*/1, in_decl
);
5931 spec
= retrieve_specialization (gen_tmpl
, argvec
);
5934 spec
= retrieve_local_specialization (t
);
5943 TREE_TYPE (r
) = type
;
5944 c_apply_type_quals_to_decl (CP_TYPE_QUALS (type
), r
);
5945 DECL_CONTEXT (r
) = ctx
;
5947 /* Don't try to expand the initializer until someone tries to use
5948 this variable; otherwise we run into circular dependencies. */
5949 DECL_INITIAL (r
) = NULL_TREE
;
5951 DECL_SIZE (r
) = DECL_SIZE_UNIT (r
) = 0;
5953 /* For __PRETTY_FUNCTION__ we have to adjust the initializer. */
5954 if (DECL_PRETTY_FUNCTION_P (r
))
5956 DECL_INITIAL (r
) = tsubst (DECL_INITIAL (t
),
5960 TREE_TYPE (r
) = TREE_TYPE (DECL_INITIAL (r
));
5963 /* Even if the original location is out of scope, the newly
5964 substituted one is not. */
5965 if (TREE_CODE (r
) == VAR_DECL
)
5966 DECL_DEAD_FOR_LOCAL (r
) = 0;
5970 /* A static data member declaration is always marked
5971 external when it is declared in-class, even if an
5972 initializer is present. We mimic the non-template
5974 DECL_EXTERNAL (r
) = 1;
5976 register_specialization (r
, gen_tmpl
, argvec
);
5977 DECL_TEMPLATE_INFO (r
) = tree_cons (tmpl
, argvec
, NULL_TREE
);
5978 SET_DECL_IMPLICIT_INSTANTIATION (r
);
5981 register_local_specialization (r
, t
);
5983 TREE_CHAIN (r
) = NULL_TREE
;
5984 if (TREE_CODE (r
) == VAR_DECL
&& TREE_CODE (type
) == VOID_TYPE
)
5985 cp_error_at ("instantiation of `%D' as type void", r
);
5990 my_friendly_abort (0);
5993 /* Restore the file and line information. */
5994 lineno
= saved_lineno
;
5995 input_filename
= saved_filename
;
6000 /* Substitue into the ARG_TYPES of a function type. */
6003 tsubst_arg_types (arg_types
, args
, complain
, in_decl
)
6009 tree remaining_arg_types
;
6012 if (!arg_types
|| arg_types
== void_list_node
)
6015 remaining_arg_types
= tsubst_arg_types (TREE_CHAIN (arg_types
),
6016 args
, complain
, in_decl
);
6017 if (remaining_arg_types
== error_mark_node
)
6018 return error_mark_node
;
6020 type
= tsubst (TREE_VALUE (arg_types
), args
, complain
, in_decl
);
6021 if (type
== error_mark_node
)
6022 return error_mark_node
;
6024 /* Do array-to-pointer, function-to-pointer conversion, and ignore
6025 top-level qualifiers as required. */
6026 type
= TYPE_MAIN_VARIANT (type_decays_to (type
));
6028 /* Note that we do not substitute into default arguments here. The
6029 standard mandates that they be instantiated only when needed,
6030 which is done in build_over_call. */
6031 return hash_tree_cons (TREE_PURPOSE (arg_types
), type
,
6032 remaining_arg_types
);
6036 /* Substitute into a FUNCTION_TYPE or METHOD_TYPE. This routine does
6037 *not* handle the exception-specification for FNTYPE, because the
6038 initial substitution of explicitly provided template parameters
6039 during argument deduction forbids substitution into the
6040 exception-specification:
6044 All references in the function type of the function template to the
6045 corresponding template parameters are replaced by the specified tem-
6046 plate argument values. If a substitution in a template parameter or
6047 in the function type of the function template results in an invalid
6048 type, type deduction fails. [Note: The equivalent substitution in
6049 exception specifications is done only when the function is instanti-
6050 ated, at which point a program is ill-formed if the substitution
6051 results in an invalid type.] */
6054 tsubst_function_type (t
, args
, complain
, in_decl
)
6064 /* The TYPE_CONTEXT is not used for function/method types. */
6065 my_friendly_assert (TYPE_CONTEXT (t
) == NULL_TREE
, 0);
6067 /* Substitue the return type. */
6068 return_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
6069 if (return_type
== error_mark_node
)
6070 return error_mark_node
;
6072 /* Substitue the argument types. */
6073 arg_types
= tsubst_arg_types (TYPE_ARG_TYPES (t
), args
,
6075 if (arg_types
== error_mark_node
)
6076 return error_mark_node
;
6078 /* Construct a new type node and return it. */
6079 if (TREE_CODE (t
) == FUNCTION_TYPE
)
6080 fntype
= build_function_type (return_type
, arg_types
);
6083 tree r
= TREE_TYPE (TREE_VALUE (arg_types
));
6084 if (! IS_AGGR_TYPE (r
))
6088 Type deduction may fail for any of the following
6091 -- Attempting to create "pointer to member of T" when T
6092 is not a class type. */
6094 cp_error ("creating pointer to member function of non-class type `%T'",
6096 return error_mark_node
;
6099 fntype
= build_cplus_method_type (r
, return_type
, TREE_CHAIN
6102 fntype
= build_qualified_type (fntype
, TYPE_QUALS (t
));
6103 fntype
= build_type_attribute_variant (fntype
, TYPE_ATTRIBUTES (t
));
6108 /* Substitute into the PARMS of a call-declarator. */
6111 tsubst_call_declarator_parms (parms
, args
, complain
, in_decl
)
6121 if (!parms
|| parms
== void_list_node
)
6124 new_parms
= tsubst_call_declarator_parms (TREE_CHAIN (parms
),
6125 args
, complain
, in_decl
);
6127 /* Figure out the type of this parameter. */
6128 type
= tsubst (TREE_VALUE (parms
), args
, complain
, in_decl
);
6130 /* Figure out the default argument as well. Note that we use
6131 tsubst_expr since the default argument is really an expression. */
6132 defarg
= tsubst_expr (TREE_PURPOSE (parms
), args
, complain
, in_decl
);
6134 /* Chain this parameter on to the front of those we have already
6135 processed. We don't use hash_tree_cons because that function
6136 doesn't check TREE_PARMLIST. */
6137 new_parms
= tree_cons (defarg
, type
, new_parms
);
6139 /* And note that these are parameters. */
6140 TREE_PARMLIST (new_parms
) = 1;
6145 /* Take the tree structure T and replace template parameters used
6146 therein with the argument vector ARGS. IN_DECL is an associated
6147 decl for diagnostics. If an error occurs, returns ERROR_MARK_NODE.
6148 An appropriate error message is issued only if COMPLAIN is
6149 non-zero. Note that we must be relatively non-tolerant of
6150 extensions here, in order to preserve conformance; if we allow
6151 substitutions that should not be allowed, we may allow argument
6152 deductions that should not succeed, and therefore report ambiguous
6153 overload situations where there are none. In theory, we could
6154 allow the substitution, but indicate that it should have failed,
6155 and allow our caller to make sure that the right thing happens, but
6156 we don't try to do this yet.
6158 This function is used for dealing with types, decls and the like;
6159 for expressions, use tsubst_expr or tsubst_copy. */
6162 tsubst (t
, args
, complain
, in_decl
)
6169 if (t
== NULL_TREE
|| t
== error_mark_node
6170 || t
== integer_type_node
6171 || t
== void_type_node
6172 || t
== char_type_node
6173 || TREE_CODE (t
) == NAMESPACE_DECL
)
6176 if (TREE_CODE (t
) == IDENTIFIER_NODE
)
6177 type
= IDENTIFIER_TYPE_VALUE (t
);
6179 type
= TREE_TYPE (t
);
6180 if (type
== unknown_type_node
)
6181 my_friendly_abort (42);
6183 if (type
&& TREE_CODE (t
) != FUNCTION_DECL
6184 && TREE_CODE (t
) != TYPENAME_TYPE
6185 && TREE_CODE (t
) != TEMPLATE_DECL
6186 && TREE_CODE (t
) != IDENTIFIER_NODE
6187 && TREE_CODE (t
) != FUNCTION_TYPE
6188 && TREE_CODE (t
) != METHOD_TYPE
)
6189 type
= tsubst (type
, args
, complain
, in_decl
);
6190 if (type
== error_mark_node
)
6191 return error_mark_node
;
6194 return tsubst_decl (t
, args
, type
, in_decl
);
6196 switch (TREE_CODE (t
))
6201 return tsubst_aggr_type (t
, args
, complain
, in_decl
,
6202 /*entering_scope=*/0);
6205 case IDENTIFIER_NODE
:
6218 if (t
== integer_type_node
)
6221 if (TREE_CODE (TYPE_MIN_VALUE (t
)) == INTEGER_CST
6222 && TREE_CODE (TYPE_MAX_VALUE (t
)) == INTEGER_CST
)
6226 tree max
, omax
= TREE_OPERAND (TYPE_MAX_VALUE (t
), 0);
6228 max
= tsubst_expr (omax
, args
, complain
, in_decl
);
6229 if (max
== error_mark_node
)
6230 return error_mark_node
;
6232 /* See if we can reduce this expression to something simpler. */
6233 max
= maybe_fold_nontype_arg (max
);
6234 if (!processing_template_decl
)
6235 max
= decl_constant_value (max
);
6237 if (processing_template_decl
6238 /* When providing explicit arguments to a template
6239 function, but leaving some arguments for subsequent
6240 deduction, MAX may be template-dependent even if we're
6241 not PROCESSING_TEMPLATE_DECL. We still need to check for
6242 template parms, though; MAX won't be an INTEGER_CST for
6243 dynamic arrays, either. */
6244 || (TREE_CODE (max
) != INTEGER_CST
6245 && uses_template_parms (max
)))
6247 tree itype
= make_node (INTEGER_TYPE
);
6248 TYPE_MIN_VALUE (itype
) = size_zero_node
;
6249 TYPE_MAX_VALUE (itype
) = build_min (MINUS_EXPR
, sizetype
, max
,
6254 if (integer_zerop (omax
))
6256 /* Still allow an explicit array of size zero. */
6258 pedwarn ("creating array with size zero");
6260 else if (integer_zerop (max
)
6261 || (TREE_CODE (max
) == INTEGER_CST
6262 && INT_CST_LT (max
, integer_zero_node
)))
6266 Type deduction may fail for any of the following
6269 Attempting to create an array with a size that is
6270 zero or negative. */
6272 cp_error ("creating array with size zero (`%E')", max
);
6274 return error_mark_node
;
6277 return compute_array_index_type (NULL_TREE
, max
);
6280 case TEMPLATE_TYPE_PARM
:
6281 case TEMPLATE_TEMPLATE_PARM
:
6282 case BOUND_TEMPLATE_TEMPLATE_PARM
:
6283 case TEMPLATE_PARM_INDEX
:
6291 if (TREE_CODE (t
) == TEMPLATE_TYPE_PARM
6292 || TREE_CODE (t
) == TEMPLATE_TEMPLATE_PARM
6293 || TREE_CODE (t
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
6295 idx
= TEMPLATE_TYPE_IDX (t
);
6296 level
= TEMPLATE_TYPE_LEVEL (t
);
6300 idx
= TEMPLATE_PARM_IDX (t
);
6301 level
= TEMPLATE_PARM_LEVEL (t
);
6304 if (TREE_VEC_LENGTH (args
) > 0)
6306 tree arg
= NULL_TREE
;
6308 levels
= TMPL_ARGS_DEPTH (args
);
6309 if (level
<= levels
)
6310 arg
= TMPL_ARG (args
, level
, idx
);
6312 if (arg
== error_mark_node
)
6313 return error_mark_node
;
6314 else if (arg
!= NULL_TREE
)
6316 if (TREE_CODE (t
) == TEMPLATE_TYPE_PARM
)
6318 my_friendly_assert (TYPE_P (arg
), 0);
6319 return cp_build_qualified_type_real
6320 (arg
, CP_TYPE_QUALS (arg
) | CP_TYPE_QUALS (t
),
6323 else if (TREE_CODE (t
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
6325 /* We are processing a type constructed from
6326 a template template parameter */
6327 tree argvec
= tsubst (TYPE_TI_ARGS (t
),
6328 args
, complain
, in_decl
);
6329 if (argvec
== error_mark_node
)
6330 return error_mark_node
;
6332 /* We can get a TEMPLATE_TEMPLATE_PARM here when
6333 we are resolving nested-types in the signature of
6334 a member function templates.
6335 Otherwise ARG is a TEMPLATE_DECL and is the real
6336 template to be instantiated. */
6337 if (TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
)
6338 arg
= TYPE_NAME (arg
);
6340 r
= lookup_template_class (arg
,
6343 /*entering_scope=*/0);
6344 return cp_build_qualified_type_real (r
,
6349 /* TEMPLATE_TEMPLATE_PARM or TEMPLATE_PARM_INDEX. */
6354 my_friendly_abort (981018);
6357 /* This can happen during the attempted tsubst'ing in
6358 unify. This means that we don't yet have any information
6359 about the template parameter in question. */
6362 /* If we get here, we must have been looking at a parm for a
6363 more deeply nested template. Make a new version of this
6364 template parameter, but with a lower level. */
6365 switch (TREE_CODE (t
))
6367 case TEMPLATE_TYPE_PARM
:
6368 case TEMPLATE_TEMPLATE_PARM
:
6369 case BOUND_TEMPLATE_TEMPLATE_PARM
:
6370 if (CP_TYPE_QUALS (t
))
6372 r
= tsubst (TYPE_MAIN_VARIANT (t
), args
, complain
, in_decl
);
6373 r
= cp_build_qualified_type_real (r
, CP_TYPE_QUALS (t
),
6379 TEMPLATE_TYPE_PARM_INDEX (r
)
6380 = reduce_template_parm_level (TEMPLATE_TYPE_PARM_INDEX (t
),
6382 TYPE_STUB_DECL (r
) = TYPE_NAME (r
) = TEMPLATE_TYPE_DECL (r
);
6383 TYPE_MAIN_VARIANT (r
) = r
;
6384 TYPE_POINTER_TO (r
) = NULL_TREE
;
6385 TYPE_REFERENCE_TO (r
) = NULL_TREE
;
6387 if (TREE_CODE (t
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
6389 tree argvec
= tsubst (TYPE_TI_ARGS (t
), args
,
6391 if (argvec
== error_mark_node
)
6392 return error_mark_node
;
6394 TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (r
)
6395 = tree_cons (TYPE_TI_TEMPLATE (t
), argvec
, NULL_TREE
);
6400 case TEMPLATE_PARM_INDEX
:
6401 r
= reduce_template_parm_level (t
, type
, levels
);
6405 my_friendly_abort (0);
6413 tree purpose
, value
, chain
, result
;
6415 if (t
== void_list_node
)
6418 purpose
= TREE_PURPOSE (t
);
6421 purpose
= tsubst (purpose
, args
, complain
, in_decl
);
6422 if (purpose
== error_mark_node
)
6423 return error_mark_node
;
6425 value
= TREE_VALUE (t
);
6428 value
= tsubst (value
, args
, complain
, in_decl
);
6429 if (value
== error_mark_node
)
6430 return error_mark_node
;
6432 chain
= TREE_CHAIN (t
);
6433 if (chain
&& chain
!= void_type_node
)
6435 chain
= tsubst (chain
, args
, complain
, in_decl
);
6436 if (chain
== error_mark_node
)
6437 return error_mark_node
;
6439 if (purpose
== TREE_PURPOSE (t
)
6440 && value
== TREE_VALUE (t
)
6441 && chain
== TREE_CHAIN (t
))
6443 result
= hash_tree_cons (purpose
, value
, chain
);
6444 TREE_PARMLIST (result
) = TREE_PARMLIST (t
);
6448 if (type
!= NULL_TREE
)
6450 /* A binfo node. We always need to make a copy, of the node
6451 itself and of its BINFO_BASETYPES. */
6455 /* Make sure type isn't a typedef copy. */
6456 type
= BINFO_TYPE (TYPE_BINFO (type
));
6458 TREE_TYPE (t
) = complete_type (type
);
6459 if (IS_AGGR_TYPE (type
))
6461 BINFO_VTABLE (t
) = TYPE_BINFO_VTABLE (type
);
6462 BINFO_VIRTUALS (t
) = TYPE_BINFO_VIRTUALS (type
);
6463 if (TYPE_BINFO_BASETYPES (type
) != NULL_TREE
)
6464 BINFO_BASETYPES (t
) = copy_node (TYPE_BINFO_BASETYPES (type
));
6469 /* Otherwise, a vector of template arguments. */
6470 return tsubst_template_arg_vector (t
, args
, complain
);
6473 case REFERENCE_TYPE
:
6475 enum tree_code code
;
6477 if (type
== TREE_TYPE (t
))
6480 code
= TREE_CODE (t
);
6485 Type deduction may fail for any of the following
6488 -- Attempting to create a pointer to reference type.
6489 -- Attempting to create a reference to a reference type or
6490 a reference to void. */
6491 if (TREE_CODE (type
) == REFERENCE_TYPE
6492 || (code
== REFERENCE_TYPE
&& TREE_CODE (type
) == VOID_TYPE
))
6494 static int last_line
= 0;
6495 static const char* last_file
= 0;
6497 /* We keep track of the last time we issued this error
6498 message to avoid spewing a ton of messages during a
6499 single bad template instantiation. */
6500 if (complain
&& (last_line
!= lineno
||
6501 last_file
!= input_filename
))
6503 if (TREE_CODE (type
) == VOID_TYPE
)
6504 cp_error ("forming reference to void");
6506 cp_error ("forming %s to reference type `%T'",
6507 (code
== POINTER_TYPE
) ? "pointer" : "reference",
6510 last_file
= input_filename
;
6513 return error_mark_node
;
6515 else if (code
== POINTER_TYPE
)
6516 r
= build_pointer_type (type
);
6518 r
= build_reference_type (type
);
6519 r
= cp_build_qualified_type_real (r
, TYPE_QUALS (t
), complain
);
6521 if (r
!= error_mark_node
)
6522 /* Will this ever be needed for TYPE_..._TO values? */
6529 r
= tsubst (TYPE_OFFSET_BASETYPE (t
), args
, complain
, in_decl
);
6530 if (r
== error_mark_node
|| !IS_AGGR_TYPE (r
))
6534 Type deduction may fail for any of the following
6537 -- Attempting to create "pointer to member of T" when T
6538 is not a class type. */
6540 cp_error ("creating pointer to member of non-class type `%T'",
6542 return error_mark_node
;
6544 return build_offset_type (r
, type
);
6552 fntype
= tsubst_function_type (t
, args
, complain
, in_decl
);
6553 if (fntype
== error_mark_node
)
6554 return error_mark_node
;
6556 /* Substitue the exception specification. */
6557 raises
= TYPE_RAISES_EXCEPTIONS (t
);
6560 tree list
= NULL_TREE
;
6562 if (! TREE_VALUE (raises
))
6565 for (; raises
!= NULL_TREE
; raises
= TREE_CHAIN (raises
))
6567 tree spec
= TREE_VALUE (raises
);
6569 spec
= tsubst (spec
, args
, complain
, in_decl
);
6570 if (spec
== error_mark_node
)
6572 list
= add_exception_specifier (list
, spec
, complain
);
6574 fntype
= build_exception_variant (fntype
, list
);
6580 tree domain
= tsubst (TYPE_DOMAIN (t
), args
, complain
, in_decl
);
6581 if (domain
== error_mark_node
)
6582 return error_mark_node
;
6584 /* As an optimization, we avoid regenerating the array type if
6585 it will obviously be the same as T. */
6586 if (type
== TREE_TYPE (t
) && domain
== TYPE_DOMAIN (t
))
6589 /* These checks should match the ones in grokdeclarator.
6593 The deduction may fail for any of the following reasons:
6595 -- Attempting to create an array with an element type that
6596 is void, a function type, or a reference type. */
6597 if (TREE_CODE (type
) == VOID_TYPE
6598 || TREE_CODE (type
) == FUNCTION_TYPE
6599 || TREE_CODE (type
) == REFERENCE_TYPE
)
6602 cp_error ("creating array of `%T'", type
);
6603 return error_mark_node
;
6606 r
= build_cplus_array_type (type
, domain
);
6613 tree e1
= tsubst (TREE_OPERAND (t
, 0), args
, complain
,
6615 tree e2
= tsubst (TREE_OPERAND (t
, 1), args
, complain
,
6618 if (e1
== error_mark_node
|| e2
== error_mark_node
)
6619 return error_mark_node
;
6621 return fold (build (TREE_CODE (t
), TREE_TYPE (t
), e1
, e2
));
6627 tree e
= tsubst (TREE_OPERAND (t
, 0), args
, complain
,
6629 if (e
== error_mark_node
)
6630 return error_mark_node
;
6632 return fold (build (TREE_CODE (t
), TREE_TYPE (t
), e
));
6637 tree ctx
= tsubst_aggr_type (TYPE_CONTEXT (t
), args
, complain
,
6638 in_decl
, /*entering_scope=*/1);
6639 tree f
= tsubst_copy (TYPENAME_TYPE_FULLNAME (t
), args
,
6642 if (ctx
== error_mark_node
|| f
== error_mark_node
)
6643 return error_mark_node
;
6645 if (!IS_AGGR_TYPE (ctx
))
6648 cp_error ("`%T' is not a class, struct, or union type",
6650 return error_mark_node
;
6652 else if (!uses_template_parms (ctx
) && !TYPE_BEING_DEFINED (ctx
))
6654 /* Normally, make_typename_type does not require that the CTX
6655 have complete type in order to allow things like:
6657 template <class T> struct S { typename S<T>::X Y; };
6659 But, such constructs have already been resolved by this
6660 point, so here CTX really should have complete type, unless
6661 it's a partial instantiation. */
6662 ctx
= complete_type (ctx
);
6663 if (!COMPLETE_TYPE_P (ctx
))
6666 incomplete_type_error (NULL_TREE
, ctx
);
6667 return error_mark_node
;
6671 f
= make_typename_type (ctx
, f
, complain
);
6672 if (f
== error_mark_node
)
6674 return cp_build_qualified_type_real (f
,
6676 | CP_TYPE_QUALS (t
),
6682 tree e
= tsubst (TREE_OPERAND (t
, 0), args
, complain
,
6684 if (e
== error_mark_node
)
6685 return error_mark_node
;
6686 return make_pointer_declarator (type
, e
);
6691 tree e
= tsubst (TREE_OPERAND (t
, 0), args
, complain
,
6693 if (e
== error_mark_node
)
6694 return error_mark_node
;
6695 return make_reference_declarator (type
, e
);
6700 tree e1
= tsubst (TREE_OPERAND (t
, 0), args
, complain
,
6702 tree e2
= tsubst_expr (TREE_OPERAND (t
, 1), args
, complain
,
6704 if (e1
== error_mark_node
|| e2
== error_mark_node
)
6705 return error_mark_node
;
6707 return build_parse_node (ARRAY_REF
, e1
, e2
, tsubst_expr
);
6712 tree e1
= tsubst (TREE_OPERAND (t
, 0), args
, complain
,
6714 tree e2
= (tsubst_call_declarator_parms
6715 (CALL_DECLARATOR_PARMS (t
), args
, complain
, in_decl
));
6716 tree e3
= tsubst (CALL_DECLARATOR_EXCEPTION_SPEC (t
), args
,
6719 if (e1
== error_mark_node
|| e2
== error_mark_node
6720 || e3
== error_mark_node
)
6721 return error_mark_node
;
6723 return make_call_declarator (e1
, e2
, CALL_DECLARATOR_QUALS (t
), e3
);
6728 tree e1
= tsubst (TREE_OPERAND (t
, 0), args
, complain
,
6730 tree e2
= tsubst (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
6731 if (e1
== error_mark_node
|| e2
== error_mark_node
)
6732 return error_mark_node
;
6734 return build_parse_node (TREE_CODE (t
), e1
, e2
);
6739 tree e1
= tsubst_expr (TYPE_FIELDS (t
), args
, complain
,
6741 if (e1
== error_mark_node
)
6742 return error_mark_node
;
6744 return TREE_TYPE (e1
);
6754 /* This code should match declare_hidden_char_array in
6756 name
= (*decl_printable_name
) (current_function_decl
, 2);
6757 len
= strlen (name
) + 1;
6758 type
= build_array_type (char_type_node
,
6759 build_index_type (build_int_2 (len
, 0)));
6760 str
= build_string (len
, name
);
6761 TREE_TYPE (str
) = type
;
6766 sorry ("use of `%s' in template",
6767 tree_code_name
[(int) TREE_CODE (t
)]);
6768 return error_mark_node
;
6772 /* Like tsubst, but deals with expressions. This function just replaces
6773 template parms; to finish processing the resultant expression, use
6777 tsubst_copy (t
, args
, complain
, in_decl
)
6782 enum tree_code code
;
6785 if (t
== NULL_TREE
|| t
== error_mark_node
)
6788 code
= TREE_CODE (t
);
6793 return do_identifier (DECL_NAME (t
), 0, NULL_TREE
);
6800 if (!DECL_CONTEXT (t
))
6801 /* This is a global enumeration constant. */
6804 /* Unfortunately, we cannot just call lookup_name here.
6807 template <int I> int f() {
6809 struct S { void g() { E e = a; } };
6812 When we instantiate f<7>::S::g(), say, lookup_name is not
6813 clever enough to find f<7>::a. */
6815 = tsubst_aggr_type (TREE_TYPE (t
), args
, complain
, in_decl
,
6816 /*entering_scope=*/0);
6818 for (v
= TYPE_VALUES (enum_type
);
6821 if (TREE_PURPOSE (v
) == DECL_NAME (t
))
6822 return TREE_VALUE (v
);
6824 /* We didn't find the name. That should never happen; if
6825 name-lookup found it during preliminary parsing, we
6826 should find it again here during instantiation. */
6827 my_friendly_abort (0);
6832 if (DECL_CONTEXT (t
))
6836 ctx
= tsubst_aggr_type (DECL_CONTEXT (t
), args
, complain
, in_decl
,
6837 /*entering_scope=*/1);
6838 if (ctx
!= DECL_CONTEXT (t
))
6839 return lookup_field (ctx
, DECL_NAME (t
), 0, 0);
6845 if (DECL_LANG_SPECIFIC (t
) && DECL_TEMPLATE_INFO (t
))
6846 t
= tsubst (t
, args
, complain
, in_decl
);
6851 if (is_member_template (t
))
6852 return tsubst (t
, args
, complain
, in_decl
);
6858 /* We must tsbust into a LOOKUP_EXPR in case the names to
6859 which it refers is a conversion operator; in that case the
6860 name will change. We avoid making unnecessary copies,
6863 tree id
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
6865 if (id
!= TREE_OPERAND (t
, 0))
6867 r
= build_nt (LOOKUP_EXPR
, id
);
6868 LOOKUP_EXPR_GLOBAL (r
) = LOOKUP_EXPR_GLOBAL (t
);
6876 case REINTERPRET_CAST_EXPR
:
6877 case CONST_CAST_EXPR
:
6878 case STATIC_CAST_EXPR
:
6879 case DYNAMIC_CAST_EXPR
:
6882 (code
, tsubst (TREE_TYPE (t
), args
, complain
, in_decl
),
6883 tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
));
6886 case PREDECREMENT_EXPR
:
6887 case PREINCREMENT_EXPR
:
6888 case POSTDECREMENT_EXPR
:
6889 case POSTINCREMENT_EXPR
:
6891 case TRUTH_NOT_EXPR
:
6894 case CONVERT_EXPR
: /* Unary + */
6903 (code
, tsubst (TREE_TYPE (t
), args
, complain
, in_decl
),
6904 tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
));
6909 case TRUNC_DIV_EXPR
:
6911 case FLOOR_DIV_EXPR
:
6912 case ROUND_DIV_EXPR
:
6913 case EXACT_DIV_EXPR
:
6915 case BIT_ANDTC_EXPR
:
6918 case TRUNC_MOD_EXPR
:
6919 case FLOOR_MOD_EXPR
:
6920 case TRUTH_ANDIF_EXPR
:
6921 case TRUTH_ORIF_EXPR
:
6922 case TRUTH_AND_EXPR
:
6943 (code
, tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
),
6944 tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
));
6948 tree fn
= TREE_OPERAND (t
, 0);
6949 if (is_overloaded_fn (fn
))
6950 fn
= tsubst_copy (get_first_fn (fn
), args
, complain
, in_decl
);
6952 /* Sometimes FN is a LOOKUP_EXPR. */
6953 fn
= tsubst_copy (fn
, args
, complain
, in_decl
);
6955 (code
, fn
, tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
,
6960 case METHOD_CALL_EXPR
:
6962 tree name
= TREE_OPERAND (t
, 0);
6963 if (TREE_CODE (name
) == BIT_NOT_EXPR
)
6965 name
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
6967 name
= build1 (BIT_NOT_EXPR
, NULL_TREE
, name
);
6969 else if (TREE_CODE (name
) == SCOPE_REF
6970 && TREE_CODE (TREE_OPERAND (name
, 1)) == BIT_NOT_EXPR
)
6972 tree base
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
6974 name
= TREE_OPERAND (name
, 1);
6975 name
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
6977 name
= build1 (BIT_NOT_EXPR
, NULL_TREE
, name
);
6978 name
= build_nt (SCOPE_REF
, base
, name
);
6981 name
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
6983 (code
, name
, tsubst_copy (TREE_OPERAND (t
, 1), args
,
6985 tsubst_copy (TREE_OPERAND (t
, 2), args
, complain
, in_decl
),
6990 /* This processing should really occur in tsubst_expr, However,
6991 tsubst_expr does not recurse into expressions, since it
6992 assumes that there aren't any statements inside them.
6993 Instead, it simply calls build_expr_from_tree. So, we need
6994 to expand the STMT_EXPR here. */
6995 if (!processing_template_decl
)
6997 tree stmt_expr
= begin_stmt_expr ();
6998 tsubst_expr (STMT_EXPR_STMT (t
), args
,
7000 return finish_stmt_expr (stmt_expr
);
7007 case PSEUDO_DTOR_EXPR
:
7010 (code
, tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
),
7011 tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
),
7012 tsubst_copy (TREE_OPERAND (t
, 2), args
, complain
, in_decl
));
7019 (code
, tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
),
7020 tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
),
7021 tsubst_copy (TREE_OPERAND (t
, 2), args
, complain
, in_decl
));
7022 NEW_EXPR_USE_GLOBAL (r
) = NEW_EXPR_USE_GLOBAL (t
);
7029 (code
, tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
),
7030 tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
));
7031 DELETE_EXPR_USE_GLOBAL (r
) = DELETE_EXPR_USE_GLOBAL (t
);
7032 DELETE_EXPR_USE_VEC (r
) = DELETE_EXPR_USE_VEC (t
);
7036 case TEMPLATE_ID_EXPR
:
7038 /* Substituted template arguments */
7039 tree targs
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
,
7042 if (targs
&& TREE_CODE (targs
) == TREE_LIST
)
7045 for (chain
= targs
; chain
; chain
= TREE_CHAIN (chain
))
7046 TREE_VALUE (chain
) = maybe_fold_nontype_arg (TREE_VALUE (chain
));
7051 for (i
= 0; i
< TREE_VEC_LENGTH (targs
); ++i
)
7052 TREE_VEC_ELT (targs
, i
)
7053 = maybe_fold_nontype_arg (TREE_VEC_ELT (targs
, i
));
7056 return lookup_template_function
7057 (tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
), targs
);
7062 tree purpose
, value
, chain
;
7064 if (t
== void_list_node
)
7067 purpose
= TREE_PURPOSE (t
);
7069 purpose
= tsubst_copy (purpose
, args
, complain
, in_decl
);
7070 value
= TREE_VALUE (t
);
7072 value
= tsubst_copy (value
, args
, complain
, in_decl
);
7073 chain
= TREE_CHAIN (t
);
7074 if (chain
&& chain
!= void_type_node
)
7075 chain
= tsubst_copy (chain
, args
, complain
, in_decl
);
7076 if (purpose
== TREE_PURPOSE (t
)
7077 && value
== TREE_VALUE (t
)
7078 && chain
== TREE_CHAIN (t
))
7080 return tree_cons (purpose
, value
, chain
);
7087 case TEMPLATE_TYPE_PARM
:
7088 case TEMPLATE_TEMPLATE_PARM
:
7089 case BOUND_TEMPLATE_TEMPLATE_PARM
:
7090 case TEMPLATE_PARM_INDEX
:
7092 case REFERENCE_TYPE
:
7099 return tsubst (t
, args
, complain
, in_decl
);
7101 case IDENTIFIER_NODE
:
7102 if (IDENTIFIER_TYPENAME_P (t
))
7104 tree new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
7106 return mangle_conv_op_name_for_type (new_type
);
7108 return (build_typename_overload (new_type
));
7116 (CONSTRUCTOR
, tsubst (TREE_TYPE (t
), args
, complain
, in_decl
),
7117 NULL_TREE
, tsubst_copy (CONSTRUCTOR_ELTS (t
), args
,
7118 complain
, in_decl
));
7119 TREE_HAS_CONSTRUCTOR (r
) = TREE_HAS_CONSTRUCTOR (t
);
7124 return build_x_va_arg (tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
,
7126 tsubst (TREE_TYPE (t
), args
, complain
, in_decl
));
7129 return tsubst (t
, args
, complain
, in_decl
);
7136 /* Like tsubst_copy, but also does semantic processing. */
7139 tsubst_expr (t
, args
, complain
, in_decl
)
7146 if (t
== NULL_TREE
|| t
== error_mark_node
)
7149 if (processing_template_decl
)
7150 return tsubst_copy (t
, args
, complain
, in_decl
);
7152 switch (TREE_CODE (t
))
7156 finish_named_return_value
7157 (TREE_OPERAND (t
, 0),
7158 tsubst_expr (TREE_OPERAND (t
, 1), args
, /*complain=*/1, in_decl
));
7159 tsubst_expr (TREE_CHAIN (t
), args
, complain
, in_decl
);
7162 case CTOR_INITIALIZER
:
7164 tree member_init_list
;
7165 tree base_init_list
;
7169 = tsubst_initializer_list (TREE_OPERAND (t
, 0), args
);
7171 = tsubst_initializer_list (TREE_OPERAND (t
, 1), args
);
7172 setup_vtbl_ptr (member_init_list
, base_init_list
);
7173 tsubst_expr (TREE_CHAIN (t
), args
, complain
, in_decl
);
7179 finish_return_stmt (tsubst_expr (RETURN_EXPR (t
),
7180 args
, complain
, in_decl
));
7185 finish_expr_stmt (tsubst_expr (EXPR_STMT_EXPR (t
),
7186 args
, complain
, in_decl
));
7195 decl
= DECL_STMT_DECL (t
);
7196 if (TREE_CODE (decl
) == LABEL_DECL
)
7197 finish_label_decl (DECL_NAME (decl
));
7200 init
= DECL_INITIAL (decl
);
7201 decl
= tsubst (decl
, args
, complain
, in_decl
);
7202 init
= tsubst_expr (init
, args
, complain
, in_decl
);
7203 if (decl
!= error_mark_node
)
7205 if (TREE_CODE (decl
) != TYPE_DECL
)
7206 /* Make sure the type is instantiated now. */
7207 complete_type (TREE_TYPE (decl
));
7209 DECL_INITIAL (decl
) = error_mark_node
;
7210 /* By marking the declaration as instantiated, we avoid
7211 trying to instantiate it. Since instantiate_decl can't
7212 handle local variables, and since we've already done
7213 all that needs to be done, that's the right thing to
7215 if (TREE_CODE (decl
) == VAR_DECL
)
7216 DECL_TEMPLATE_INSTANTIATED (decl
) = 1;
7217 maybe_push_decl (decl
);
7218 cp_finish_decl (decl
, init
, NULL_TREE
, 0);
7229 stmt
= begin_for_stmt ();
7230 for (tmp
= FOR_INIT_STMT (t
); tmp
; tmp
= TREE_CHAIN (tmp
))
7231 tsubst_expr (tmp
, args
, complain
, in_decl
);
7232 finish_for_init_stmt (stmt
);
7233 finish_for_cond (tsubst_expr (FOR_COND (t
), args
,
7236 tmp
= tsubst_expr (FOR_EXPR (t
), args
, complain
, in_decl
);
7237 finish_for_expr (tmp
, stmt
);
7238 tsubst_expr (FOR_BODY (t
), args
, complain
, in_decl
);
7239 finish_for_stmt (stmt
);
7246 stmt
= begin_while_stmt ();
7247 finish_while_stmt_cond (tsubst_expr (WHILE_COND (t
),
7248 args
, complain
, in_decl
),
7250 tsubst_expr (WHILE_BODY (t
), args
, complain
, in_decl
);
7251 finish_while_stmt (stmt
);
7258 stmt
= begin_do_stmt ();
7259 tsubst_expr (DO_BODY (t
), args
, complain
, in_decl
);
7260 finish_do_body (stmt
);
7261 finish_do_stmt (tsubst_expr (DO_COND (t
), args
,
7272 stmt
= begin_if_stmt ();
7273 finish_if_stmt_cond (tsubst_expr (IF_COND (t
),
7274 args
, complain
, in_decl
),
7277 if (tmp
= THEN_CLAUSE (t
), tmp
)
7279 tsubst_expr (tmp
, args
, complain
, in_decl
);
7280 finish_then_clause (stmt
);
7283 if (tmp
= ELSE_CLAUSE (t
), tmp
)
7285 begin_else_clause ();
7286 tsubst_expr (tmp
, args
, complain
, in_decl
);
7287 finish_else_clause (stmt
);
7299 stmt
= begin_compound_stmt (COMPOUND_STMT_NO_SCOPE (t
));
7300 for (substmt
= COMPOUND_BODY (t
);
7301 substmt
!= NULL_TREE
;
7302 substmt
= TREE_CHAIN (substmt
))
7303 tsubst_expr (substmt
, args
, complain
, in_decl
);
7304 return finish_compound_stmt (COMPOUND_STMT_NO_SCOPE (t
), stmt
);
7310 finish_break_stmt ();
7315 finish_continue_stmt ();
7323 stmt
= begin_switch_stmt ();
7324 val
= tsubst_expr (SWITCH_COND (t
), args
, complain
, in_decl
);
7325 finish_switch_cond (val
, stmt
);
7326 tsubst_expr (SWITCH_BODY (t
), args
, complain
, in_decl
);
7327 finish_switch_stmt (stmt
);
7333 finish_case_label (tsubst_expr (CASE_LOW (t
), args
, complain
, in_decl
),
7334 tsubst_expr (CASE_HIGH (t
), args
, complain
,
7339 lineno
= STMT_LINENO (t
);
7340 finish_label_stmt (DECL_NAME (LABEL_STMT_LABEL (t
)));
7345 t
= GOTO_DESTINATION (t
);
7346 if (TREE_CODE (t
) != LABEL_DECL
)
7347 /* Computed goto's must be tsubst'd into. On the other hand,
7348 non-computed gotos must not be; the identifier in question
7349 will have no binding. */
7350 t
= tsubst_expr (t
, args
, complain
, in_decl
);
7353 finish_goto_stmt (t
);
7358 finish_asm_stmt (ASM_CV_QUAL (t
),
7359 tsubst_expr (ASM_STRING (t
), args
, complain
, in_decl
),
7360 tsubst_expr (ASM_OUTPUTS (t
), args
, complain
, in_decl
),
7361 tsubst_expr (ASM_INPUTS (t
), args
, complain
, in_decl
),
7362 tsubst_expr (ASM_CLOBBERS (t
), args
, complain
,
7370 stmt
= begin_try_block ();
7371 tsubst_expr (TRY_STMTS (t
), args
, complain
, in_decl
);
7372 finish_cleanup_try_block (stmt
);
7373 finish_cleanup (tsubst_expr (TRY_HANDLERS (t
), args
,
7381 if (FN_TRY_BLOCK_P (t
))
7382 stmt
= begin_function_try_block ();
7384 stmt
= begin_try_block ();
7386 tsubst_expr (TRY_STMTS (t
), args
, complain
, in_decl
);
7388 if (FN_TRY_BLOCK_P (t
))
7389 finish_function_try_block (stmt
);
7391 finish_try_block (stmt
);
7393 handler
= TRY_HANDLERS (t
);
7394 for (; handler
; handler
= TREE_CHAIN (handler
))
7395 tsubst_expr (handler
, args
, complain
, in_decl
);
7396 if (FN_TRY_BLOCK_P (t
))
7397 finish_function_handler_sequence (stmt
);
7399 finish_handler_sequence (stmt
);
7409 stmt
= begin_handler ();
7410 if (HANDLER_PARMS (t
))
7412 decl
= DECL_STMT_DECL (HANDLER_PARMS (t
));
7413 decl
= tsubst (decl
, args
, complain
, in_decl
);
7414 /* Prevent instantiate_decl from trying to instantiate
7415 this variable. We've already done all that needs to be
7417 DECL_TEMPLATE_INSTANTIATED (decl
) = 1;
7421 blocks
= finish_handler_parms (decl
, stmt
);
7422 tsubst_expr (HANDLER_BODY (t
), args
, complain
, in_decl
);
7423 finish_handler (blocks
, stmt
);
7430 tsubst (t
, args
, complain
, NULL_TREE
);
7434 return build_expr_from_tree (tsubst_copy (t
, args
, complain
, in_decl
));
7439 /* TMPL is a TEMPLATE_DECL for a cloned constructor or destructor.
7440 Instantiate it with the ARGS. */
7443 instantiate_clone (tmpl
, args
)
7450 /* Instantiated the cloned function, rather than the clone. */
7451 spec
= instantiate_template (DECL_CLONED_FUNCTION (tmpl
), args
);
7453 /* Then, see if we've already cloned the instantiation. */
7454 for (clone
= TREE_CHAIN (spec
);
7455 clone
&& DECL_CLONED_FUNCTION_P (clone
);
7456 clone
= TREE_CHAIN (clone
))
7457 if (DECL_NAME (clone
) == DECL_NAME (tmpl
))
7460 /* If we haven't, do so know. */
7462 clone_function_decl (spec
, /*update_method_vec_p=*/0);
7465 for (clone
= TREE_CHAIN (spec
);
7466 clone
&& DECL_CLONED_FUNCTION_P (clone
);
7467 clone
= TREE_CHAIN (clone
))
7468 if (DECL_NAME (clone
) == DECL_NAME (tmpl
))
7471 /* We should always have found the clone by now. */
7472 my_friendly_abort (20000411);
7476 /* Instantiate the indicated variable or function template TMPL with
7477 the template arguments in TARG_PTR. */
7480 instantiate_template (tmpl
, targ_ptr
)
7481 tree tmpl
, targ_ptr
;
7490 if (tmpl
== error_mark_node
)
7491 return error_mark_node
;
7493 my_friendly_assert (TREE_CODE (tmpl
) == TEMPLATE_DECL
, 283);
7495 /* If this function is a clone, handle it specially. */
7496 if (DECL_CLONED_FUNCTION_P (tmpl
))
7497 return instantiate_clone (tmpl
, targ_ptr
);
7499 /* Check to see if we already have this specialization. */
7500 spec
= retrieve_specialization (tmpl
, targ_ptr
);
7501 if (spec
!= NULL_TREE
)
7504 gen_tmpl
= most_general_template (tmpl
);
7505 if (tmpl
!= gen_tmpl
)
7507 /* The TMPL is a partial instantiation. To get a full set of
7508 arguments we must add the arguments used to perform the
7509 partial instantiation. */
7510 targ_ptr
= add_outermost_template_args (DECL_TI_ARGS (tmpl
),
7513 /* Check to see if we already have this specialization. */
7514 spec
= retrieve_specialization (gen_tmpl
, targ_ptr
);
7515 if (spec
!= NULL_TREE
)
7519 len
= DECL_NTPARMS (gen_tmpl
);
7520 inner_args
= INNERMOST_TEMPLATE_ARGS (targ_ptr
);
7524 tree t
= TREE_VEC_ELT (inner_args
, i
);
7527 tree nt
= target_type (t
);
7528 if (IS_AGGR_TYPE (nt
) && decl_function_context (TYPE_MAIN_DECL (nt
)))
7530 cp_error ("type `%T' composed from a local class is not a valid template-argument", t
);
7531 cp_error (" trying to instantiate `%D'", gen_tmpl
);
7532 return error_mark_node
;
7537 /* substitute template parameters */
7538 fndecl
= tsubst (DECL_TEMPLATE_RESULT (gen_tmpl
),
7539 targ_ptr
, /*complain=*/1, gen_tmpl
);
7540 /* The DECL_TI_TEMPLATE should always be the immediate parent
7541 template, not the most general template. */
7542 DECL_TI_TEMPLATE (fndecl
) = tmpl
;
7544 if (flag_external_templates
)
7545 add_pending_template (fndecl
);
7547 /* If we've just instantiated the main entry point for a function,
7548 instantiate all the alternate entry points as well. */
7549 for (clone
= TREE_CHAIN (gen_tmpl
);
7550 clone
&& DECL_CLONED_FUNCTION_P (clone
);
7551 clone
= TREE_CHAIN (clone
))
7552 instantiate_template (clone
, targ_ptr
);
7557 /* Push the name of the class template into the scope of the instantiation. */
7560 overload_template_name (type
)
7563 tree id
= DECL_NAME (CLASSTYPE_TI_TEMPLATE (type
));
7566 if (IDENTIFIER_CLASS_VALUE (id
)
7567 && TREE_TYPE (IDENTIFIER_CLASS_VALUE (id
)) == type
)
7570 decl
= build_decl (TYPE_DECL
, id
, type
);
7571 DECL_ARTIFICIAL (decl
) = 1;
7572 pushdecl_class_level (decl
);
7575 /* The FN is a TEMPLATE_DECL for a function. The ARGS are the
7576 arguments that are being used when calling it. TARGS is a vector
7577 into which the deduced template arguments are placed.
7579 Return zero for success, 2 for an incomplete match that doesn't resolve
7580 all the types, and 1 for complete failure. An error message will be
7581 printed only for an incomplete match.
7583 If FN is a conversion operator, or we are trying to produce a specific
7584 specialization, RETURN_TYPE is the return type desired.
7586 The EXPLICIT_TARGS are explicit template arguments provided via a
7589 The parameter STRICT is one of:
7592 We are deducing arguments for a function call, as in
7596 We are deducing arguments for a conversion function, as in
7600 We are deducing arguments when calculating the partial
7601 ordering between specializations of function or class
7602 templates, as in [temp.func.order] and [temp.class.order],
7603 when doing an explicit instantiation as in [temp.explicit],
7604 when determining an explicit specialization as in
7605 [temp.expl.spec], or when taking the address of a function
7606 template, as in [temp.deduct.funcaddr].
7608 LEN is the number of parms to consider before returning success, or -1
7609 for all. This is used in partial ordering to avoid comparing parms for
7610 which no actual argument was passed, since they are not considered in
7611 overload resolution (and are explicitly excluded from consideration in
7612 partial ordering in [temp.func.order]/6). */
7615 fn_type_unification (fn
, explicit_targs
, targs
, args
, return_type
,
7617 tree fn
, explicit_targs
, targs
, args
, return_type
;
7618 unification_kind_t strict
;
7625 my_friendly_assert (TREE_CODE (fn
) == TEMPLATE_DECL
, 0);
7627 fntype
= TREE_TYPE (fn
);
7632 The specified template arguments must match the template
7633 parameters in kind (i.e., type, nontype, template), and there
7634 must not be more arguments than there are parameters;
7635 otherwise type deduction fails.
7637 Nontype arguments must match the types of the corresponding
7638 nontype template parameters, or must be convertible to the
7639 types of the corresponding nontype parameters as specified in
7640 _temp.arg.nontype_, otherwise type deduction fails.
7642 All references in the function type of the function template
7643 to the corresponding template parameters are replaced by the
7644 specified template argument values. If a substitution in a
7645 template parameter or in the function type of the function
7646 template results in an invalid type, type deduction fails. */
7648 tree converted_args
;
7651 = (coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (fn
),
7652 explicit_targs
, NULL_TREE
, /*complain=*/0,
7653 /*require_all_arguments=*/0));
7654 if (converted_args
== error_mark_node
)
7657 fntype
= tsubst (fntype
, converted_args
, /*complain=*/0, NULL_TREE
);
7658 if (fntype
== error_mark_node
)
7661 /* Place the explicitly specified arguments in TARGS. */
7662 for (i
= 0; i
< TREE_VEC_LENGTH (targs
); i
++)
7663 TREE_VEC_ELT (targs
, i
) = TREE_VEC_ELT (converted_args
, i
);
7666 parms
= TYPE_ARG_TYPES (fntype
);
7667 /* Never do unification on the 'this' parameter. */
7668 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
))
7669 parms
= TREE_CHAIN (parms
);
7673 /* We've been given a return type to match, prepend it. */
7674 parms
= tree_cons (NULL_TREE
, TREE_TYPE (fntype
), parms
);
7675 args
= tree_cons (NULL_TREE
, return_type
, args
);
7680 /* We allow incomplete unification without an error message here
7681 because the standard doesn't seem to explicitly prohibit it. Our
7682 callers must be ready to deal with unification failures in any
7684 result
= type_unification_real (DECL_INNERMOST_TEMPLATE_PARMS (fn
),
7685 targs
, parms
, args
, /*subr=*/0,
7686 strict
, /*allow_incomplete*/1, len
);
7689 /* All is well so far. Now, check:
7693 When all template arguments have been deduced, all uses of
7694 template parameters in nondeduced contexts are replaced with
7695 the corresponding deduced argument values. If the
7696 substitution results in an invalid type, as described above,
7697 type deduction fails. */
7698 if (tsubst (TREE_TYPE (fn
), targs
, /*complain=*/0, NULL_TREE
)
7705 /* Adjust types before performing type deduction, as described in
7706 [temp.deduct.call] and [temp.deduct.conv]. The rules in these two
7707 sections are symmetric. PARM is the type of a function parameter
7708 or the return type of the conversion function. ARG is the type of
7709 the argument passed to the call, or the type of the value
7710 initialized with the result of the conversion function. */
7713 maybe_adjust_types_for_deduction (strict
, parm
, arg
)
7714 unification_kind_t strict
;
7725 /* Swap PARM and ARG throughout the remainder of this
7726 function; the handling is precisely symmetric since PARM
7727 will initialize ARG rather than vice versa. */
7735 /* There is nothing to do in this case. */
7739 my_friendly_abort (0);
7742 if (TREE_CODE (*parm
) != REFERENCE_TYPE
)
7744 /* [temp.deduct.call]
7746 If P is not a reference type:
7748 --If A is an array type, the pointer type produced by the
7749 array-to-pointer standard conversion (_conv.array_) is
7750 used in place of A for type deduction; otherwise,
7752 --If A is a function type, the pointer type produced by
7753 the function-to-pointer standard conversion
7754 (_conv.func_) is used in place of A for type deduction;
7757 --If A is a cv-qualified type, the top level
7758 cv-qualifiers of A's type are ignored for type
7760 if (TREE_CODE (*arg
) == ARRAY_TYPE
)
7761 *arg
= build_pointer_type (TREE_TYPE (*arg
));
7762 else if (TREE_CODE (*arg
) == FUNCTION_TYPE
)
7763 *arg
= build_pointer_type (*arg
);
7765 *arg
= TYPE_MAIN_VARIANT (*arg
);
7768 /* [temp.deduct.call]
7770 If P is a cv-qualified type, the top level cv-qualifiers
7771 of P's type are ignored for type deduction. If P is a
7772 reference type, the type referred to by P is used for
7774 *parm
= TYPE_MAIN_VARIANT (*parm
);
7775 if (TREE_CODE (*parm
) == REFERENCE_TYPE
)
7776 *parm
= TREE_TYPE (*parm
);
7779 /* Most parms like fn_type_unification.
7781 If SUBR is 1, we're being called recursively (to unify the
7782 arguments of a function or method parameter of a function
7786 type_unification_real (tparms
, targs
, parms
, args
, subr
,
7787 strict
, allow_incomplete
, len
)
7788 tree tparms
, targs
, parms
, args
;
7790 unification_kind_t strict
;
7791 int allow_incomplete
, len
;
7795 int ntparms
= TREE_VEC_LENGTH (tparms
);
7798 my_friendly_assert (TREE_CODE (tparms
) == TREE_VEC
, 289);
7799 my_friendly_assert (parms
== NULL_TREE
7800 || TREE_CODE (parms
) == TREE_LIST
, 290);
7801 /* ARGS could be NULL (via a call from parse.y to
7802 build_x_function_call). */
7804 my_friendly_assert (TREE_CODE (args
) == TREE_LIST
, 291);
7805 my_friendly_assert (ntparms
> 0, 292);
7810 sub_strict
= UNIFY_ALLOW_MORE_CV_QUAL
| UNIFY_ALLOW_DERIVED
;
7814 sub_strict
= UNIFY_ALLOW_LESS_CV_QUAL
;
7818 sub_strict
= UNIFY_ALLOW_NONE
;
7822 my_friendly_abort (0);
7829 && parms
!= void_list_node
7831 && args
!= void_list_node
)
7833 parm
= TREE_VALUE (parms
);
7834 parms
= TREE_CHAIN (parms
);
7835 arg
= TREE_VALUE (args
);
7836 args
= TREE_CHAIN (args
);
7838 if (arg
== error_mark_node
)
7840 if (arg
== unknown_type_node
)
7841 /* We can't deduce anything from this, but we might get all the
7842 template args from other function args. */
7845 /* Conversions will be performed on a function argument that
7846 corresponds with a function parameter that contains only
7847 non-deducible template parameters and explicitly specified
7848 template parameters. */
7849 if (! uses_template_parms (parm
))
7854 type
= TREE_TYPE (arg
);
7861 if (strict
== DEDUCE_EXACT
)
7863 if (same_type_p (parm
, type
))
7867 /* It might work; we shouldn't check now, because we might
7868 get into infinite recursion. Overload resolution will
7877 my_friendly_assert (TREE_TYPE (arg
) != NULL_TREE
, 293);
7878 if (type_unknown_p (arg
))
7880 /* [temp.deduct.type] A template-argument can be deduced from
7881 a pointer to function or pointer to member function
7882 argument if the set of overloaded functions does not
7883 contain function templates and at most one of a set of
7884 overloaded functions provides a unique match. */
7886 if (resolve_overloaded_unification
7887 (tparms
, targs
, parm
, arg
, strict
, sub_strict
)
7892 arg
= TREE_TYPE (arg
);
7896 maybe_adjust_types_for_deduction (strict
, &parm
, &arg
);
7898 if (unify (tparms
, targs
, parm
, arg
, sub_strict
))
7901 /* Are we done with the interesting parms? */
7905 /* Fail if we've reached the end of the parm list, and more args
7906 are present, and the parm list isn't variadic. */
7907 if (args
&& args
!= void_list_node
&& parms
== void_list_node
)
7909 /* Fail if parms are left and they don't have default values. */
7911 && parms
!= void_list_node
7912 && TREE_PURPOSE (parms
) == NULL_TREE
)
7915 for (i
= 0; i
< ntparms
; i
++)
7916 if (TREE_VEC_ELT (targs
, i
) == NULL_TREE
)
7918 if (!allow_incomplete
)
7919 error ("incomplete type unification");
7925 /* Subroutine of type_unification_real. Args are like the variables at the
7926 call site. ARG is an overloaded function (or template-id); we try
7927 deducing template args from each of the overloads, and if only one
7928 succeeds, we go with that. Modifies TARGS and returns 0 on success. */
7931 resolve_overloaded_unification (tparms
, targs
, parm
, arg
, strict
,
7933 tree tparms
, targs
, parm
, arg
;
7934 unification_kind_t strict
;
7937 tree tempargs
= copy_node (targs
);
7940 if (TREE_CODE (arg
) == ADDR_EXPR
)
7941 arg
= TREE_OPERAND (arg
, 0);
7943 if (TREE_CODE (arg
) == COMPONENT_REF
)
7944 /* Handle `&x' where `x' is some static or non-static member
7946 arg
= TREE_OPERAND (arg
, 1);
7948 if (TREE_CODE (arg
) == OFFSET_REF
)
7949 arg
= TREE_OPERAND (arg
, 1);
7951 /* Strip baselink information. */
7952 while (TREE_CODE (arg
) == TREE_LIST
)
7953 arg
= TREE_VALUE (arg
);
7955 if (TREE_CODE (arg
) == TEMPLATE_ID_EXPR
)
7957 /* If we got some explicit template args, we need to plug them into
7958 the affected templates before we try to unify, in case the
7959 explicit args will completely resolve the templates in question. */
7961 tree expl_subargs
= TREE_OPERAND (arg
, 1);
7962 arg
= TREE_OPERAND (arg
, 0);
7964 for (; arg
; arg
= OVL_NEXT (arg
))
7966 tree fn
= OVL_CURRENT (arg
);
7969 if (TREE_CODE (fn
) != TEMPLATE_DECL
)
7972 subargs
= get_bindings_overload (fn
, DECL_TEMPLATE_RESULT (fn
),
7976 elem
= tsubst (TREE_TYPE (fn
), subargs
, /*complain=*/0,
7978 if (TREE_CODE (elem
) == METHOD_TYPE
)
7979 elem
= build_ptrmemfunc_type (build_pointer_type (elem
));
7980 good
+= try_one_overload (tparms
, targs
, tempargs
, parm
, elem
,
7981 strict
, sub_strict
);
7985 else if (TREE_CODE (arg
) == OVERLOAD
)
7987 for (; arg
; arg
= OVL_NEXT (arg
))
7989 tree type
= TREE_TYPE (OVL_CURRENT (arg
));
7990 if (TREE_CODE (type
) == METHOD_TYPE
)
7991 type
= build_ptrmemfunc_type (build_pointer_type (type
));
7992 good
+= try_one_overload (tparms
, targs
, tempargs
, parm
,
7994 strict
, sub_strict
);
7998 my_friendly_abort (981006);
8000 /* [temp.deduct.type] A template-argument can be deduced from a pointer
8001 to function or pointer to member function argument if the set of
8002 overloaded functions does not contain function templates and at most
8003 one of a set of overloaded functions provides a unique match.
8005 So if we found multiple possibilities, we return success but don't
8010 int i
= TREE_VEC_LENGTH (targs
);
8012 if (TREE_VEC_ELT (tempargs
, i
))
8013 TREE_VEC_ELT (targs
, i
) = TREE_VEC_ELT (tempargs
, i
);
8021 /* Subroutine of resolve_overloaded_unification; does deduction for a single
8022 overload. Fills TARGS with any deduced arguments, or error_mark_node if
8023 different overloads deduce different arguments for a given parm.
8024 Returns 1 on success. */
8027 try_one_overload (tparms
, orig_targs
, targs
, parm
, arg
, strict
,
8029 tree tparms
, orig_targs
, targs
, parm
, arg
;
8030 unification_kind_t strict
;
8037 /* [temp.deduct.type] A template-argument can be deduced from a pointer
8038 to function or pointer to member function argument if the set of
8039 overloaded functions does not contain function templates and at most
8040 one of a set of overloaded functions provides a unique match.
8042 So if this is a template, just return success. */
8044 if (uses_template_parms (arg
))
8047 maybe_adjust_types_for_deduction (strict
, &parm
, &arg
);
8049 /* We don't copy orig_targs for this because if we have already deduced
8050 some template args from previous args, unify would complain when we
8051 try to deduce a template parameter for the same argument, even though
8052 there isn't really a conflict. */
8053 nargs
= TREE_VEC_LENGTH (targs
);
8054 tempargs
= make_tree_vec (nargs
);
8056 if (unify (tparms
, tempargs
, parm
, arg
, sub_strict
) != 0)
8059 /* First make sure we didn't deduce anything that conflicts with
8060 explicitly specified args. */
8061 for (i
= nargs
; i
--; )
8063 tree elt
= TREE_VEC_ELT (tempargs
, i
);
8064 tree oldelt
= TREE_VEC_ELT (orig_targs
, i
);
8066 if (elt
== NULL_TREE
)
8068 else if (uses_template_parms (elt
))
8070 /* Since we're unifying against ourselves, we will fill in template
8071 args used in the function parm list with our own template parms.
8073 TREE_VEC_ELT (tempargs
, i
) = NULL_TREE
;
8076 else if (oldelt
&& ! template_args_equal (oldelt
, elt
))
8080 for (i
= nargs
; i
--; )
8082 tree elt
= TREE_VEC_ELT (tempargs
, i
);
8085 TREE_VEC_ELT (targs
, i
) = elt
;
8091 /* Verify that nondeduce template argument agrees with the type
8092 obtained from argument deduction. Return nonzero if the
8097 struct A { typedef int X; };
8098 template <class T, class U> struct C {};
8099 template <class T> struct C<T, typename T::X> {};
8101 Then with the instantiation `C<A, int>', we can deduce that
8102 `T' is `A' but unify () does not check whether `typename T::X'
8103 is `int'. This function ensure that they agree.
8105 TARGS, PARMS are the same as the arguments of unify.
8106 ARGS contains template arguments from all levels. */
8109 verify_class_unification (targs
, parms
, args
)
8110 tree targs
, parms
, args
;
8113 int nparms
= TREE_VEC_LENGTH (parms
);
8114 tree new_parms
= tsubst (parms
, add_outermost_template_args (args
, targs
),
8115 /*complain=*/0, NULL_TREE
);
8116 if (new_parms
== error_mark_node
)
8119 args
= INNERMOST_TEMPLATE_ARGS (args
);
8121 for (i
= 0; i
< nparms
; i
++)
8123 tree parm
= TREE_VEC_ELT (new_parms
, i
);
8124 tree arg
= TREE_VEC_ELT (args
, i
);
8126 /* In case we are deducing from a function argument of a function
8127 templates, some parameters may not be deduced yet. So we
8128 make sure that only fully substituted elements of PARM are
8131 if (!uses_template_parms (parm
) && !template_args_equal (parm
, arg
))
8137 /* PARM is a template class (perhaps with unbound template
8138 parameters). ARG is a fully instantiated type. If ARG can be
8139 bound to PARM, return ARG, otherwise return NULL_TREE. TPARMS and
8140 TARGS are as for unify. */
8143 try_class_unification (tparms
, targs
, parm
, arg
)
8151 if (!CLASSTYPE_TEMPLATE_INFO (arg
)
8152 || CLASSTYPE_TI_TEMPLATE (arg
) != CLASSTYPE_TI_TEMPLATE (parm
))
8155 /* We need to make a new template argument vector for the call to
8156 unify. If we used TARGS, we'd clutter it up with the result of
8157 the attempted unification, even if this class didn't work out.
8158 We also don't want to commit ourselves to all the unifications
8159 we've already done, since unification is supposed to be done on
8160 an argument-by-argument basis. In other words, consider the
8161 following pathological case:
8163 template <int I, int J, int K>
8166 template <int I, int J>
8167 struct S<I, J, 2> : public S<I, I, I>, S<J, J, J> {};
8169 template <int I, int J, int K>
8170 void f(S<I, J, K>, S<I, I, I>);
8179 Now, by the time we consider the unification involving `s2', we
8180 already know that we must have `f<0, 0, 0>'. But, even though
8181 `S<0, 1, 2>' is derived from `S<0, 0, 0>', the code is not legal
8182 because there are two ways to unify base classes of S<0, 1, 2>
8183 with S<I, I, I>. If we kept the already deduced knowledge, we
8184 would reject the possibility I=1. */
8185 copy_of_targs
= make_tree_vec (TREE_VEC_LENGTH (targs
));
8187 /* If unification failed, we're done. */
8188 if (unify (tparms
, copy_of_targs
, CLASSTYPE_TI_ARGS (parm
),
8189 CLASSTYPE_TI_ARGS (arg
), UNIFY_ALLOW_NONE
))
8195 /* Subroutine of get_template_base. RVAL, if non-NULL, is a base we
8196 have already discovered to be satisfactory. ARG_BINFO is the binfo
8197 for the base class of ARG that we are currently examining. */
8200 get_template_base_recursive (tparms
, targs
, parm
,
8201 arg_binfo
, rval
, flags
)
8211 tree arg
= BINFO_TYPE (arg_binfo
);
8213 if (!(flags
& GTB_IGNORE_TYPE
))
8215 tree r
= try_class_unification (tparms
, targs
,
8218 /* If there is more than one satisfactory baseclass, then:
8222 If they yield more than one possible deduced A, the type
8226 if (r
&& rval
&& !same_type_p (r
, rval
))
8227 return error_mark_node
;
8232 binfos
= BINFO_BASETYPES (arg_binfo
);
8233 n_baselinks
= binfos
? TREE_VEC_LENGTH (binfos
) : 0;
8235 /* Process base types. */
8236 for (i
= 0; i
< n_baselinks
; i
++)
8238 tree base_binfo
= TREE_VEC_ELT (binfos
, i
);
8241 /* Skip this base, if we've already seen it. */
8242 if (BINFO_MARKED (base_binfo
))
8246 (flags
& GTB_VIA_VIRTUAL
) || TREE_VIA_VIRTUAL (base_binfo
);
8248 /* When searching for a non-virtual, we cannot mark virtually
8251 SET_BINFO_MARKED (base_binfo
);
8253 rval
= get_template_base_recursive (tparms
, targs
,
8257 GTB_VIA_VIRTUAL
* this_virtual
);
8259 /* If we discovered more than one matching base class, we can
8261 if (rval
== error_mark_node
)
8262 return error_mark_node
;
8268 /* Given a template type PARM and a class type ARG, find the unique
8269 base type in ARG that is an instance of PARM. We do not examine
8270 ARG itself; only its base-classes. If there is no appropriate base
8271 class, return NULL_TREE. If there is more than one, return
8272 error_mark_node. PARM may be the type of a partial specialization,
8273 as well as a plain template type. Used by unify. */
8276 get_template_base (tparms
, targs
, parm
, arg
)
8285 my_friendly_assert (IS_AGGR_TYPE_CODE (TREE_CODE (arg
)), 92);
8287 arg_binfo
= TYPE_BINFO (complete_type (arg
));
8288 rval
= get_template_base_recursive (tparms
, targs
,
8293 /* Since get_template_base_recursive marks the bases classes, we
8294 must unmark them here. */
8295 dfs_walk (arg_binfo
, dfs_unmark
, markedp
, 0);
8300 /* Returns the level of DECL, which declares a template parameter. */
8303 template_decl_level (decl
)
8306 switch (TREE_CODE (decl
))
8310 return TEMPLATE_TYPE_LEVEL (TREE_TYPE (decl
));
8313 return TEMPLATE_PARM_LEVEL (DECL_INITIAL (decl
));
8316 my_friendly_abort (0);
8321 /* Decide whether ARG can be unified with PARM, considering only the
8322 cv-qualifiers of each type, given STRICT as documented for unify.
8323 Returns non-zero iff the unification is OK on that basis.*/
8326 check_cv_quals_for_unify (strict
, arg
, parm
)
8331 if (!(strict
& UNIFY_ALLOW_MORE_CV_QUAL
)
8332 && !at_least_as_qualified_p (arg
, parm
))
8335 if (!(strict
& UNIFY_ALLOW_LESS_CV_QUAL
)
8336 && !at_least_as_qualified_p (parm
, arg
))
8342 /* Takes parameters as for type_unification. Returns 0 if the
8343 type deduction succeeds, 1 otherwise. The parameter STRICT is a
8344 bitwise or of the following flags:
8347 Require an exact match between PARM and ARG.
8348 UNIFY_ALLOW_MORE_CV_QUAL:
8349 Allow the deduced ARG to be more cv-qualified than ARG.
8350 UNIFY_ALLOW_LESS_CV_QUAL:
8351 Allow the deduced ARG to be less cv-qualified than ARG.
8352 UNIFY_ALLOW_DERIVED:
8353 Allow the deduced ARG to be a template base class of ARG,
8354 or a pointer to a template base class of the type pointed to by
8356 UNIFY_ALLOW_INTEGER:
8357 Allow any integral type to be deduced. See the TEMPLATE_PARM_INDEX
8358 case for more information. */
8361 unify (tparms
, targs
, parm
, arg
, strict
)
8362 tree tparms
, targs
, parm
, arg
;
8369 /* I don't think this will do the right thing with respect to types.
8370 But the only case I've seen it in so far has been array bounds, where
8371 signedness is the only information lost, and I think that will be
8373 while (TREE_CODE (parm
) == NOP_EXPR
)
8374 parm
= TREE_OPERAND (parm
, 0);
8376 if (arg
== error_mark_node
)
8378 if (arg
== unknown_type_node
)
8379 /* We can't deduce anything from this, but we might get all the
8380 template args from other function args. */
8383 /* If PARM uses template parameters, then we can't bail out here,
8384 even if ARG == PARM, since we won't record unifications for the
8385 template parameters. We might need them if we're trying to
8386 figure out which of two things is more specialized. */
8387 if (arg
== parm
&& !uses_template_parms (parm
))
8390 /* Immediately reject some pairs that won't unify because of
8391 cv-qualification mismatches. */
8392 if (TREE_CODE (arg
) == TREE_CODE (parm
)
8394 /* We check the cv-qualifiers when unifying with template type
8395 parameters below. We want to allow ARG `const T' to unify with
8396 PARM `T' for example, when computing which of two templates
8397 is more specialized, for example. */
8398 && TREE_CODE (arg
) != TEMPLATE_TYPE_PARM
8399 && !check_cv_quals_for_unify (strict
, arg
, parm
))
8402 switch (TREE_CODE (parm
))
8405 /* In a type which contains a nested-name-specifier, template
8406 argument values cannot be deduced for template parameters used
8407 within the nested-name-specifier. */
8410 case TEMPLATE_TYPE_PARM
:
8411 case TEMPLATE_TEMPLATE_PARM
:
8412 case BOUND_TEMPLATE_TEMPLATE_PARM
:
8413 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, 0));
8415 if (TEMPLATE_TYPE_LEVEL (parm
)
8416 != template_decl_level (tparm
))
8417 /* The PARM is not one we're trying to unify. Just check
8418 to see if it matches ARG. */
8419 return (TREE_CODE (arg
) == TREE_CODE (parm
)
8420 && same_type_p (parm
, arg
)) ? 0 : 1;
8421 idx
= TEMPLATE_TYPE_IDX (parm
);
8422 targ
= TREE_VEC_ELT (targs
, idx
);
8423 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, idx
));
8425 /* Check for mixed types and values. */
8426 if ((TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
8427 && TREE_CODE (tparm
) != TYPE_DECL
)
8428 || (TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
8429 && TREE_CODE (tparm
) != TEMPLATE_DECL
))
8432 if (TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
8434 /* ARG must be constructed from a template class or a template
8435 template parameter. */
8436 if (TREE_CODE (arg
) != BOUND_TEMPLATE_TEMPLATE_PARM
8437 && (TREE_CODE (arg
) != RECORD_TYPE
|| !CLASSTYPE_TEMPLATE_INFO (arg
)))
8441 tree parmtmpl
= TYPE_TI_TEMPLATE (parm
);
8442 tree parmvec
= TYPE_TI_ARGS (parm
);
8443 tree argvec
= TYPE_TI_ARGS (arg
);
8445 = DECL_INNERMOST_TEMPLATE_PARMS (TYPE_TI_TEMPLATE (arg
));
8448 /* The parameter and argument roles have to be switched here
8449 in order to handle default arguments properly. For example,
8450 template<template <class> class TT> void f(TT<int>)
8451 should be able to accept vector<int> which comes from
8452 template <class T, class Allocator = allocator>
8455 if (coerce_template_parms (argtmplvec
, parmvec
, parmtmpl
, 0, 1)
8459 /* Deduce arguments T, i from TT<T> or TT<i>.
8460 We check each element of PARMVEC and ARGVEC individually
8461 rather than the whole TREE_VEC since they can have
8462 different number of elements. */
8464 for (i
= 0; i
< TREE_VEC_LENGTH (parmvec
); ++i
)
8466 tree t
= TREE_VEC_ELT (parmvec
, i
);
8468 if (unify (tparms
, targs
, t
,
8469 TREE_VEC_ELT (argvec
, i
),
8474 arg
= TYPE_TI_TEMPLATE (arg
);
8476 /* Fall through to deduce template name. */
8479 if (TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
8480 || TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
8482 /* Deduce template name TT from TT, TT<>, TT<T> and TT<i>. */
8484 /* Simple cases: Value already set, does match or doesn't. */
8485 if (targ
!= NULL_TREE
&& template_args_equal (targ
, arg
))
8492 /* If PARM is `const T' and ARG is only `int', we don't have
8493 a match unless we are allowing additional qualification.
8494 If ARG is `const int' and PARM is just `T' that's OK;
8495 that binds `const int' to `T'. */
8496 if (!check_cv_quals_for_unify (strict
| UNIFY_ALLOW_LESS_CV_QUAL
,
8500 /* Consider the case where ARG is `const volatile int' and
8501 PARM is `const T'. Then, T should be `volatile int'. */
8503 cp_build_qualified_type_real (arg
,
8505 & ~CP_TYPE_QUALS (parm
),
8507 if (arg
== error_mark_node
)
8510 /* Simple cases: Value already set, does match or doesn't. */
8511 if (targ
!= NULL_TREE
&& same_type_p (targ
, arg
))
8517 /* Make sure that ARG is not a variable-sized array. (Note that
8518 were talking about variable-sized arrays (like `int[n]'),
8519 rather than arrays of unknown size (like `int[]').) We'll
8520 get very confused by such a type since the bound of the array
8521 will not be computable in an instantiation. Besides, such
8522 types are not allowed in ISO C++, so we can do as we please
8524 if (TREE_CODE (arg
) == ARRAY_TYPE
8525 && !uses_template_parms (arg
)
8526 && (TREE_CODE (TYPE_MAX_VALUE (TYPE_DOMAIN (arg
)))
8530 TREE_VEC_ELT (targs
, idx
) = arg
;
8533 case TEMPLATE_PARM_INDEX
:
8534 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, 0));
8536 if (TEMPLATE_PARM_LEVEL (parm
)
8537 != template_decl_level (tparm
))
8538 /* The PARM is not one we're trying to unify. Just check
8539 to see if it matches ARG. */
8540 return (TREE_CODE (arg
) == TREE_CODE (parm
)
8541 && cp_tree_equal (parm
, arg
) > 0) ? 0 : 1;
8543 idx
= TEMPLATE_PARM_IDX (parm
);
8544 targ
= TREE_VEC_ELT (targs
, idx
);
8548 int i
= (cp_tree_equal (targ
, arg
) > 0);
8554 my_friendly_abort (42);
8557 /* [temp.deduct.type] If, in the declaration of a function template
8558 with a non-type template-parameter, the non-type
8559 template-parameter is used in an expression in the function
8560 parameter-list and, if the corresponding template-argument is
8561 deduced, the template-argument type shall match the type of the
8562 template-parameter exactly, except that a template-argument
8563 deduced from an array bound may be of any integral type.
8564 The non-type parameter might use already deduced type parameters. */
8565 if (same_type_p (TREE_TYPE (arg
),
8566 tsubst (TREE_TYPE (parm
), targs
, 0, NULL_TREE
)))
8568 else if ((strict
& UNIFY_ALLOW_INTEGER
)
8569 && (TREE_CODE (TREE_TYPE (parm
)) == INTEGER_TYPE
8570 || TREE_CODE (TREE_TYPE (parm
)) == BOOLEAN_TYPE
))
8575 TREE_VEC_ELT (targs
, idx
) = arg
;
8582 if (TREE_CODE (arg
) != POINTER_TYPE
)
8585 /* [temp.deduct.call]
8587 A can be another pointer or pointer to member type that can
8588 be converted to the deduced A via a qualification
8589 conversion (_conv.qual_).
8591 We pass down STRICT here rather than UNIFY_ALLOW_NONE.
8592 This will allow for additional cv-qualification of the
8593 pointed-to types if appropriate. In general, this is a bit
8594 too generous; we are only supposed to allow qualification
8595 conversions and this method will allow an ARG of char** and
8596 a deduced ARG of const char**. However, overload
8597 resolution will subsequently invalidate the candidate, so
8598 this is probably OK. */
8599 sub_strict
= strict
;
8601 if (TREE_CODE (TREE_TYPE (arg
)) != RECORD_TYPE
)
8602 /* The derived-to-base conversion only persists through one
8603 level of pointers. */
8604 sub_strict
&= ~UNIFY_ALLOW_DERIVED
;
8606 return unify (tparms
, targs
, TREE_TYPE (parm
),
8607 TREE_TYPE (arg
), sub_strict
);
8610 case REFERENCE_TYPE
:
8611 if (TREE_CODE (arg
) != REFERENCE_TYPE
)
8613 return unify (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
8617 if (TREE_CODE (arg
) != ARRAY_TYPE
)
8619 if ((TYPE_DOMAIN (parm
) == NULL_TREE
)
8620 != (TYPE_DOMAIN (arg
) == NULL_TREE
))
8622 if (TYPE_DOMAIN (parm
) != NULL_TREE
8623 && unify (tparms
, targs
, TYPE_DOMAIN (parm
),
8624 TYPE_DOMAIN (arg
), UNIFY_ALLOW_NONE
) != 0)
8626 return unify (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
8635 if (TREE_CODE (arg
) != TREE_CODE (parm
))
8638 if (TREE_CODE (parm
) == INTEGER_TYPE
8639 && TREE_CODE (TYPE_MAX_VALUE (parm
)) != INTEGER_CST
)
8641 if (TYPE_MIN_VALUE (parm
) && TYPE_MIN_VALUE (arg
)
8642 && unify (tparms
, targs
, TYPE_MIN_VALUE (parm
),
8643 TYPE_MIN_VALUE (arg
), UNIFY_ALLOW_INTEGER
))
8645 if (TYPE_MAX_VALUE (parm
) && TYPE_MAX_VALUE (arg
)
8646 && unify (tparms
, targs
, TYPE_MAX_VALUE (parm
),
8647 TYPE_MAX_VALUE (arg
), UNIFY_ALLOW_INTEGER
))
8650 /* We have already checked cv-qualification at the top of the
8652 else if (!same_type_ignoring_top_level_qualifiers_p (arg
, parm
))
8655 /* As far as unification is concerned, this wins. Later checks
8656 will invalidate it if necessary. */
8659 /* Types INTEGER_CST and MINUS_EXPR can come from array bounds. */
8660 /* Type INTEGER_CST can come from ordinary constant template args. */
8662 while (TREE_CODE (arg
) == NOP_EXPR
)
8663 arg
= TREE_OPERAND (arg
, 0);
8665 if (TREE_CODE (arg
) != INTEGER_CST
)
8667 return !tree_int_cst_equal (parm
, arg
);
8672 if (TREE_CODE (arg
) != TREE_VEC
)
8674 if (TREE_VEC_LENGTH (parm
) != TREE_VEC_LENGTH (arg
))
8676 for (i
= 0; i
< TREE_VEC_LENGTH (parm
); ++i
)
8677 if (unify (tparms
, targs
,
8678 TREE_VEC_ELT (parm
, i
), TREE_VEC_ELT (arg
, i
),
8686 if (TREE_CODE (arg
) != TREE_CODE (parm
))
8689 if (TYPE_PTRMEMFUNC_P (parm
))
8691 if (!TYPE_PTRMEMFUNC_P (arg
))
8694 return unify (tparms
, targs
,
8695 TYPE_PTRMEMFUNC_FN_TYPE (parm
),
8696 TYPE_PTRMEMFUNC_FN_TYPE (arg
),
8700 if (CLASSTYPE_TEMPLATE_INFO (parm
))
8704 if (strict
& UNIFY_ALLOW_DERIVED
)
8706 /* First, we try to unify the PARM and ARG directly. */
8707 t
= try_class_unification (tparms
, targs
,
8712 /* Fallback to the special case allowed in
8715 If P is a class, and P has the form
8716 template-id, then A can be a derived class of
8717 the deduced A. Likewise, if P is a pointer to
8718 a class of the form template-id, A can be a
8719 pointer to a derived class pointed to by the
8721 t
= get_template_base (tparms
, targs
,
8724 if (! t
|| t
== error_mark_node
)
8728 else if (CLASSTYPE_TEMPLATE_INFO (arg
)
8729 && (CLASSTYPE_TI_TEMPLATE (parm
)
8730 == CLASSTYPE_TI_TEMPLATE (arg
)))
8731 /* Perhaps PARM is something like S<U> and ARG is S<int>.
8732 Then, we should unify `int' and `U'. */
8735 /* There's no chance of unification succeeding. */
8738 return unify (tparms
, targs
, CLASSTYPE_TI_ARGS (parm
),
8739 CLASSTYPE_TI_ARGS (t
), UNIFY_ALLOW_NONE
);
8741 else if (!same_type_ignoring_top_level_qualifiers_p (parm
, arg
))
8747 if (TREE_CODE (arg
) != TREE_CODE (parm
))
8750 if (unify (tparms
, targs
, TREE_TYPE (parm
),
8751 TREE_TYPE (arg
), UNIFY_ALLOW_NONE
))
8753 return type_unification_real (tparms
, targs
, TYPE_ARG_TYPES (parm
),
8754 TYPE_ARG_TYPES (arg
), 1,
8755 DEDUCE_EXACT
, 0, -1);
8758 if (TREE_CODE (arg
) != OFFSET_TYPE
)
8760 if (unify (tparms
, targs
, TYPE_OFFSET_BASETYPE (parm
),
8761 TYPE_OFFSET_BASETYPE (arg
), UNIFY_ALLOW_NONE
))
8763 return unify (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
8767 if (arg
!= decl_constant_value (parm
))
8772 /* Matched cases are handled by the ARG == PARM test above. */
8776 if (TREE_CODE (TREE_OPERAND (parm
, 1)) == INTEGER_CST
)
8778 /* We handle this case specially, since it comes up with
8779 arrays. In particular, something like:
8781 template <int N> void f(int (&x)[N]);
8783 Here, we are trying to unify the range type, which
8784 looks like [0 ... (N - 1)]. */
8786 t1
= TREE_OPERAND (parm
, 0);
8787 t2
= TREE_OPERAND (parm
, 1);
8789 t
= fold (build (PLUS_EXPR
, integer_type_node
, arg
, t2
));
8791 return unify (tparms
, targs
, t1
, t
, strict
);
8793 /* else fall through */
8796 if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (TREE_CODE (parm
))))
8799 /* We're looking at an expression. This can happen with
8803 void foo(S<I>, S<I + 2>);
8805 This is a "nondeduced context":
8809 The nondeduced contexts are:
8811 --A type that is a template-id in which one or more of
8812 the template-arguments is an expression that references
8813 a template-parameter.
8815 In these cases, we assume deduction succeeded, but don't
8816 actually infer any unifications. */
8818 if (!uses_template_parms (parm
)
8819 && !template_args_equal (parm
, arg
))
8825 sorry ("use of `%s' in template type unification",
8826 tree_code_name
[(int) TREE_CODE (parm
)]);
8832 /* Called if RESULT is explicitly instantiated, or is a member of an
8833 explicitly instantiated class, or if using -frepo and the
8834 instantiation of RESULT has been assigned to this file. */
8837 mark_decl_instantiated (result
, extern_p
)
8841 if (TREE_CODE (result
) != FUNCTION_DECL
)
8842 /* The TREE_PUBLIC flag for function declarations will have been
8843 set correctly by tsubst. */
8844 TREE_PUBLIC (result
) = 1;
8846 /* We used to set this unconditionally; we moved that to
8847 do_decl_instantiation so it wouldn't get set on members of
8848 explicit class template instantiations. But we still need to set
8849 it here for the 'extern template' case in order to suppress
8850 implicit instantiations. */
8852 SET_DECL_EXPLICIT_INSTANTIATION (result
);
8856 DECL_INTERFACE_KNOWN (result
) = 1;
8857 DECL_NOT_REALLY_EXTERN (result
) = 1;
8859 /* Always make artificials weak. */
8860 if (DECL_ARTIFICIAL (result
) && flag_weak
)
8861 comdat_linkage (result
);
8862 /* For WIN32 we also want to put explicit instantiations in
8863 linkonce sections. */
8864 else if (TREE_PUBLIC (result
))
8865 maybe_make_one_only (result
);
8867 else if (TREE_CODE (result
) == FUNCTION_DECL
)
8871 /* Given two function templates PAT1 and PAT2, return:
8873 1 if PAT1 is more specialized than PAT2 as described in [temp.func.order].
8874 -1 if PAT2 is more specialized than PAT1.
8875 0 if neither is more specialized.
8877 LEN is passed through to fn_type_unification. */
8880 more_specialized (pat1
, pat2
, len
)
8887 targs
= get_bindings_order (pat1
, DECL_TEMPLATE_RESULT (pat2
), len
);
8891 targs
= get_bindings_order (pat2
, DECL_TEMPLATE_RESULT (pat1
), len
);
8898 /* Given two class template specialization list nodes PAT1 and PAT2, return:
8900 1 if PAT1 is more specialized than PAT2 as described in [temp.class.order].
8901 -1 if PAT2 is more specialized than PAT1.
8902 0 if neither is more specialized. */
8905 more_specialized_class (pat1
, pat2
)
8911 targs
= get_class_bindings (TREE_VALUE (pat1
), TREE_PURPOSE (pat1
),
8912 TREE_PURPOSE (pat2
));
8916 targs
= get_class_bindings (TREE_VALUE (pat2
), TREE_PURPOSE (pat2
),
8917 TREE_PURPOSE (pat1
));
8924 /* Return the template arguments that will produce the function signature
8925 DECL from the function template FN, with the explicit template
8926 arguments EXPLICIT_ARGS. If CHECK_RETTYPE is 1, the return type must
8927 also match. Return NULL_TREE if no satisfactory arguments could be
8928 found. LEN is passed through to fn_type_unification. */
8931 get_bindings_real (fn
, decl
, explicit_args
, check_rettype
, len
)
8932 tree fn
, decl
, explicit_args
;
8933 int check_rettype
, len
;
8935 int ntparms
= DECL_NTPARMS (fn
);
8936 tree targs
= make_tree_vec (ntparms
);
8938 tree decl_arg_types
;
8941 /* Substitute the explicit template arguments into the type of DECL.
8942 The call to fn_type_unification will handle substitution into the
8944 decl_type
= TREE_TYPE (decl
);
8945 if (explicit_args
&& uses_template_parms (decl_type
))
8948 tree converted_args
;
8950 if (DECL_TEMPLATE_INFO (decl
))
8951 tmpl
= DECL_TI_TEMPLATE (decl
);
8953 /* We can get here for some illegal specializations. */
8957 = (coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (tmpl
),
8958 explicit_args
, NULL_TREE
,
8960 /*require_all_arguments=*/0));
8961 if (converted_args
== error_mark_node
)
8964 decl_type
= tsubst (decl_type
, converted_args
, /*complain=*/0,
8966 if (decl_type
== error_mark_node
)
8970 decl_arg_types
= TYPE_ARG_TYPES (decl_type
);
8971 /* Never do unification on the 'this' parameter. */
8972 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
8973 decl_arg_types
= TREE_CHAIN (decl_arg_types
);
8975 i
= fn_type_unification (fn
, explicit_args
, targs
,
8977 (check_rettype
|| DECL_CONV_FN_P (fn
)
8978 ? TREE_TYPE (decl_type
) : NULL_TREE
),
8987 /* For most uses, we want to check the return type. */
8990 get_bindings (fn
, decl
, explicit_args
)
8991 tree fn
, decl
, explicit_args
;
8993 return get_bindings_real (fn
, decl
, explicit_args
, 1, -1);
8996 /* But for resolve_overloaded_unification, we only care about the parameter
9000 get_bindings_overload (fn
, decl
, explicit_args
)
9001 tree fn
, decl
, explicit_args
;
9003 return get_bindings_real (fn
, decl
, explicit_args
, 0, -1);
9006 /* And for more_specialized, we want to be able to stop partway. */
9009 get_bindings_order (fn
, decl
, len
)
9013 return get_bindings_real (fn
, decl
, NULL_TREE
, 0, len
);
9016 /* Return the innermost template arguments that, when applied to a
9017 template specialization whose innermost template parameters are
9018 TPARMS, and whose specialization arguments are ARGS, yield the
9021 For example, suppose we have:
9023 template <class T, class U> struct S {};
9024 template <class T> struct S<T*, int> {};
9026 Then, suppose we want to get `S<double*, int>'. The TPARMS will be
9027 {T}, the PARMS will be {T*, int} and the ARGS will be {double*,
9028 int}. The resulting vector will be {double}, indicating that `T'
9029 is bound to `double'. */
9032 get_class_bindings (tparms
, parms
, args
)
9033 tree tparms
, parms
, args
;
9035 int i
, ntparms
= TREE_VEC_LENGTH (tparms
);
9036 tree vec
= make_tree_vec (ntparms
);
9038 if (unify (tparms
, vec
, parms
, INNERMOST_TEMPLATE_ARGS (args
),
9042 for (i
= 0; i
< ntparms
; ++i
)
9043 if (! TREE_VEC_ELT (vec
, i
))
9046 if (verify_class_unification (vec
, parms
, args
))
9052 /* In INSTANTIATIONS is a list of <INSTANTIATION, TEMPLATE> pairs.
9053 Pick the most specialized template, and return the corresponding
9054 instantiation, or if there is no corresponding instantiation, the
9055 template itself. If there is no most specialized template,
9056 error_mark_node is returned. If there are no templates at all,
9057 NULL_TREE is returned. */
9060 most_specialized_instantiation (instantiations
)
9061 tree instantiations
;
9066 if (!instantiations
)
9069 champ
= instantiations
;
9070 for (fn
= TREE_CHAIN (instantiations
); fn
; fn
= TREE_CHAIN (fn
))
9072 fate
= more_specialized (TREE_VALUE (champ
), TREE_VALUE (fn
), -1);
9079 fn
= TREE_CHAIN (fn
);
9081 return error_mark_node
;
9087 for (fn
= instantiations
; fn
&& fn
!= champ
; fn
= TREE_CHAIN (fn
))
9089 fate
= more_specialized (TREE_VALUE (champ
), TREE_VALUE (fn
), -1);
9091 return error_mark_node
;
9094 return TREE_PURPOSE (champ
) ? TREE_PURPOSE (champ
) : TREE_VALUE (champ
);
9097 /* Return the most specialized of the list of templates in FNS that can
9098 produce an instantiation matching DECL, given the explicit template
9099 arguments EXPLICIT_ARGS. */
9102 most_specialized (fns
, decl
, explicit_args
)
9103 tree fns
, decl
, explicit_args
;
9105 tree candidates
= NULL_TREE
;
9108 for (fn
= fns
; fn
; fn
= TREE_CHAIN (fn
))
9110 tree candidate
= TREE_VALUE (fn
);
9112 args
= get_bindings (candidate
, decl
, explicit_args
);
9114 candidates
= tree_cons (NULL_TREE
, candidate
, candidates
);
9117 return most_specialized_instantiation (candidates
);
9120 /* If DECL is a specialization of some template, return the most
9121 general such template. Otherwise, returns NULL_TREE.
9125 template <class T> struct S { template <class U> void f(U); };
9127 if TMPL is `template <class U> void S<int>::f(U)' this will return
9128 the full template. This function will not trace past partial
9129 specializations, however. For example, given in addition:
9131 template <class T> struct S<T*> { template <class U> void f(U); };
9133 if TMPL is `template <class U> void S<int*>::f(U)' this will return
9134 `template <class T> template <class U> S<T*>::f(U)'. */
9137 most_general_template (decl
)
9140 /* If DECL is a FUNCTION_DECL, find the TEMPLATE_DECL of which it is
9141 an immediate specialization. */
9142 if (TREE_CODE (decl
) == FUNCTION_DECL
)
9144 if (DECL_TEMPLATE_INFO (decl
)) {
9145 decl
= DECL_TI_TEMPLATE (decl
);
9147 /* The DECL_TI_TEMPLATE can be an IDENTIFIER_NODE for a
9149 if (TREE_CODE (decl
) != TEMPLATE_DECL
)
9155 /* Look for more and more general templates. */
9156 while (DECL_TEMPLATE_INFO (decl
))
9158 /* The DECL_TI_TEMPLATE can be a LOOKUP_EXPR or IDENTIFIER_NODE
9159 in some cases. (See cp-tree.h for details.) */
9160 if (TREE_CODE (DECL_TI_TEMPLATE (decl
)) != TEMPLATE_DECL
)
9163 /* Stop if we run into an explicitly specialized class template. */
9164 if (!DECL_NAMESPACE_SCOPE_P (decl
)
9165 && DECL_CONTEXT (decl
)
9166 && CLASSTYPE_TEMPLATE_SPECIALIZATION (DECL_CONTEXT (decl
)))
9169 decl
= DECL_TI_TEMPLATE (decl
);
9175 /* Return the most specialized of the class template specializations
9176 of TMPL which can produce an instantiation matching ARGS, or
9177 error_mark_node if the choice is ambiguous. */
9180 most_specialized_class (tmpl
, args
)
9184 tree list
= NULL_TREE
;
9189 tmpl
= most_general_template (tmpl
);
9190 for (t
= DECL_TEMPLATE_SPECIALIZATIONS (tmpl
); t
; t
= TREE_CHAIN (t
))
9193 = get_class_bindings (TREE_VALUE (t
), TREE_PURPOSE (t
), args
);
9196 list
= tree_cons (TREE_PURPOSE (t
), TREE_VALUE (t
), list
);
9197 TREE_TYPE (list
) = TREE_TYPE (t
);
9207 for (; t
; t
= TREE_CHAIN (t
))
9209 fate
= more_specialized_class (champ
, t
);
9218 return error_mark_node
;
9224 for (t
= list
; t
&& t
!= champ
; t
= TREE_CHAIN (t
))
9226 fate
= more_specialized_class (champ
, t
);
9228 return error_mark_node
;
9234 /* called from the parser. */
9237 do_decl_instantiation (declspecs
, declarator
, storage
)
9238 tree declspecs
, declarator
, storage
;
9240 tree decl
= grokdeclarator (declarator
, declspecs
, NORMAL
, 0, NULL_TREE
);
9241 tree result
= NULL_TREE
;
9245 /* An error occurred, for which grokdeclarator has already issued
9246 an appropriate message. */
9248 else if (! DECL_LANG_SPECIFIC (decl
))
9250 cp_error ("explicit instantiation of non-template `%#D'", decl
);
9253 else if (TREE_CODE (decl
) == VAR_DECL
)
9255 /* There is an asymmetry here in the way VAR_DECLs and
9256 FUNCTION_DECLs are handled by grokdeclarator. In the case of
9257 the latter, the DECL we get back will be marked as a
9258 template instantiation, and the appropriate
9259 DECL_TEMPLATE_INFO will be set up. This does not happen for
9260 VAR_DECLs so we do the lookup here. Probably, grokdeclarator
9261 should handle VAR_DECLs as it currently handles
9263 result
= lookup_field (DECL_CONTEXT (decl
), DECL_NAME (decl
), 0, 0);
9264 if (result
&& TREE_CODE (result
) != VAR_DECL
)
9266 cp_error ("no matching template for `%D' found", result
);
9270 else if (TREE_CODE (decl
) != FUNCTION_DECL
)
9272 cp_error ("explicit instantiation of `%#D'", decl
);
9278 /* Check for various error cases. Note that if the explicit
9279 instantiation is legal the RESULT will currently be marked as an
9280 *implicit* instantiation; DECL_EXPLICIT_INSTANTIATION is not set
9281 until we get here. */
9283 if (DECL_TEMPLATE_SPECIALIZATION (result
))
9287 No program shall both explicitly instantiate and explicitly
9288 specialize a template. */
9289 cp_pedwarn ("explicit instantiation of `%#D' after", result
);
9290 cp_pedwarn_at ("explicit specialization here", result
);
9293 else if (DECL_EXPLICIT_INSTANTIATION (result
))
9297 No program shall explicitly instantiate any template more
9300 We check DECL_INTERFACE_KNOWN so as not to complain when the first
9301 instantiation was `extern' and the second is not, and EXTERN_P for
9302 the opposite case. If -frepo, chances are we already got marked
9303 as an explicit instantiation because of the repo file. */
9304 if (DECL_INTERFACE_KNOWN (result
) && !extern_p
&& !flag_use_repository
)
9305 cp_pedwarn ("duplicate explicit instantiation of `%#D'", result
);
9307 /* If we've already instantiated the template, just return now. */
9308 if (DECL_INTERFACE_KNOWN (result
))
9311 else if (!DECL_IMPLICIT_INSTANTIATION (result
))
9313 cp_error ("no matching template for `%D' found", result
);
9316 else if (!DECL_TEMPLATE_INFO (result
))
9318 cp_pedwarn ("explicit instantiation of non-template `%#D'", result
);
9322 if (flag_external_templates
)
9325 if (storage
== NULL_TREE
)
9327 else if (storage
== ridpointers
[(int) RID_EXTERN
])
9330 cp_pedwarn ("ISO C++ forbids the use of `extern' on explicit instantiations");
9334 cp_error ("storage class `%D' applied to template instantiation",
9337 SET_DECL_EXPLICIT_INSTANTIATION (result
);
9338 mark_decl_instantiated (result
, extern_p
);
9339 repo_template_instantiated (result
, extern_p
);
9341 instantiate_decl (result
, /*defer_ok=*/1);
9345 mark_class_instantiated (t
, extern_p
)
9349 SET_CLASSTYPE_EXPLICIT_INSTANTIATION (t
);
9350 SET_CLASSTYPE_INTERFACE_KNOWN (t
);
9351 CLASSTYPE_INTERFACE_ONLY (t
) = extern_p
;
9352 CLASSTYPE_VTABLE_NEEDS_WRITING (t
) = ! extern_p
;
9353 TYPE_DECL_SUPPRESS_DEBUG (TYPE_NAME (t
)) = extern_p
;
9356 CLASSTYPE_DEBUG_REQUESTED (t
) = 1;
9357 rest_of_type_compilation (t
, 1);
9361 /* Perform an explicit instantiation of template class T. STORAGE, if
9362 non-null, is the RID for extern, inline or static. COMPLAIN is
9363 non-zero if this is called from the parser, zero if called recursively,
9364 since the standard is unclear (as detailed below). */
9367 do_type_instantiation (t
, storage
, complain
)
9375 if (TREE_CODE (t
) == TYPE_DECL
)
9378 if (! CLASS_TYPE_P (t
) || ! CLASSTYPE_TEMPLATE_INFO (t
))
9380 cp_error ("explicit instantiation of non-template type `%T'", t
);
9386 /* With -fexternal-templates, explicit instantiations are treated the same
9387 as implicit ones. */
9388 if (flag_external_templates
)
9391 if (!COMPLETE_TYPE_P (t
))
9394 cp_error ("explicit instantiation of `%#T' before definition of template",
9399 if (storage
!= NULL_TREE
)
9402 cp_pedwarn("ISO C++ forbids the use of `%s' on explicit instantiations",
9403 IDENTIFIER_POINTER (storage
));
9405 if (storage
== ridpointers
[(int) RID_INLINE
])
9407 else if (storage
== ridpointers
[(int) RID_EXTERN
])
9409 else if (storage
== ridpointers
[(int) RID_STATIC
])
9413 cp_error ("storage class `%D' applied to template instantiation",
9419 if (CLASSTYPE_TEMPLATE_SPECIALIZATION (t
))
9423 No program shall both explicitly instantiate and explicitly
9424 specialize a template. */
9427 cp_error ("explicit instantiation of `%#T' after", t
);
9428 cp_error_at ("explicit specialization here", t
);
9432 else if (CLASSTYPE_EXPLICIT_INSTANTIATION (t
))
9436 No program shall explicitly instantiate any template more
9439 If CLASSTYPE_INTERFACE_ONLY, then the first explicit instantiation
9440 was `extern'. If EXTERN_P then the second is. If -frepo, chances
9441 are we already got marked as an explicit instantion because of the
9442 repo file. All these cases are OK. */
9443 if (!CLASSTYPE_INTERFACE_ONLY (t
) && !extern_p
&& !flag_use_repository
9445 cp_pedwarn ("duplicate explicit instantiation of `%#T'", t
);
9447 /* If we've already instantiated the template, just return now. */
9448 if (!CLASSTYPE_INTERFACE_ONLY (t
))
9452 mark_class_instantiated (t
, extern_p
);
9453 repo_template_instantiated (t
, extern_p
);
9461 /* In contrast to implicit instantiation, where only the
9462 declarations, and not the definitions, of members are
9463 instantiated, we have here:
9467 The explicit instantiation of a class template specialization
9468 implies the instantiation of all of its members not
9469 previously explicitly specialized in the translation unit
9470 containing the explicit instantiation.
9472 Of course, we can't instantiate member template classes, since
9473 we don't have any arguments for them. Note that the standard
9474 is unclear on whether the instantiation of the members are
9475 *explicit* instantiations or not. We choose to be generous,
9476 and not set DECL_EXPLICIT_INSTANTIATION. Therefore, we allow
9477 the explicit instantiation of a class where some of the members
9478 have no definition in the current translation unit. */
9481 for (tmp
= TYPE_METHODS (t
); tmp
; tmp
= TREE_CHAIN (tmp
))
9482 if (TREE_CODE (tmp
) == FUNCTION_DECL
9483 && DECL_TEMPLATE_INSTANTIATION (tmp
))
9485 mark_decl_instantiated (tmp
, extern_p
);
9486 repo_template_instantiated (tmp
, extern_p
);
9488 instantiate_decl (tmp
, /*defer_ok=*/1);
9491 for (tmp
= TYPE_FIELDS (t
); tmp
; tmp
= TREE_CHAIN (tmp
))
9492 if (TREE_CODE (tmp
) == VAR_DECL
&& DECL_TEMPLATE_INSTANTIATION (tmp
))
9494 mark_decl_instantiated (tmp
, extern_p
);
9495 repo_template_instantiated (tmp
, extern_p
);
9497 instantiate_decl (tmp
, /*defer_ok=*/1);
9500 for (tmp
= CLASSTYPE_TAGS (t
); tmp
; tmp
= TREE_CHAIN (tmp
))
9501 if (IS_AGGR_TYPE (TREE_VALUE (tmp
))
9502 && !uses_template_parms (CLASSTYPE_TI_ARGS (TREE_VALUE (tmp
))))
9503 do_type_instantiation (TYPE_MAIN_DECL (TREE_VALUE (tmp
)), storage
, 0);
9507 /* Given a function DECL, which is a specialization of TMPL, modify
9508 DECL to be a re-instantiation of TMPL with the same template
9509 arguments. TMPL should be the template into which tsubst'ing
9510 should occur for DECL, not the most general template.
9512 One reason for doing this is a scenario like this:
9515 void f(const T&, int i);
9517 void g() { f(3, 7); }
9520 void f(const T& t, const int i) { }
9522 Note that when the template is first instantiated, with
9523 instantiate_template, the resulting DECL will have no name for the
9524 first parameter, and the wrong type for the second. So, when we go
9525 to instantiate the DECL, we regenerate it. */
9528 regenerate_decl_from_template (decl
, tmpl
)
9532 /* The most general version of TMPL. */
9534 /* The arguments used to instantiate DECL, from the most general
9541 args
= DECL_TI_ARGS (decl
);
9542 code_pattern
= DECL_TEMPLATE_RESULT (tmpl
);
9544 /* Unregister the specialization so that when we tsubst we will not
9545 just return DECL. We don't have to unregister DECL from TMPL
9546 because if would only be registered there if it were a partial
9547 instantiation of a specialization, which it isn't: it's a full
9549 gen_tmpl
= most_general_template (tmpl
);
9550 unregistered
= unregister_specialization (decl
, gen_tmpl
);
9552 /* If the DECL was not unregistered then something peculiar is
9553 happening: we created a specialization but did not call
9554 register_specialization for it. */
9555 my_friendly_assert (unregistered
, 0);
9557 if (TREE_CODE (decl
) == VAR_DECL
)
9558 /* Make sure that we can see identifiers, and compute access
9559 correctly, for the class members used in the declaration of
9560 this static variable. */
9561 pushclass (DECL_CONTEXT (decl
), 2);
9563 /* Do the substitution to get the new declaration. */
9564 new_decl
= tsubst (code_pattern
, args
, /*complain=*/1, NULL_TREE
);
9566 if (TREE_CODE (decl
) == VAR_DECL
)
9568 /* Set up DECL_INITIAL, since tsubst doesn't. */
9569 DECL_INITIAL (new_decl
) =
9570 tsubst_expr (DECL_INITIAL (code_pattern
), args
,
9571 /*complain=*/1, DECL_TI_TEMPLATE (decl
));
9572 /* Pop the class context we pushed above. */
9575 else if (TREE_CODE (decl
) == FUNCTION_DECL
)
9577 /* Convince duplicate_decls to use the DECL_ARGUMENTS from the
9579 DECL_INITIAL (new_decl
) = error_mark_node
;
9580 /* And don't complain about a duplicate definition. */
9581 DECL_INITIAL (decl
) = NULL_TREE
;
9584 /* The immediate parent of the new template is still whatever it was
9585 before, even though tsubst sets DECL_TI_TEMPLATE up as the most
9586 general template. We also reset the DECL_ASSEMBLER_NAME since
9587 tsubst always calculates the name as if the function in question
9588 were really a template instance, and sometimes, with friend
9589 functions, this is not so. See tsubst_friend_function for
9591 DECL_TI_TEMPLATE (new_decl
) = DECL_TI_TEMPLATE (decl
);
9592 DECL_ASSEMBLER_NAME (new_decl
) = DECL_ASSEMBLER_NAME (decl
);
9593 DECL_RTL (new_decl
) = DECL_RTL (decl
);
9594 DECL_USE_TEMPLATE (new_decl
) = DECL_USE_TEMPLATE (decl
);
9596 /* Call duplicate decls to merge the old and new declarations. */
9597 duplicate_decls (new_decl
, decl
);
9599 /* Now, re-register the specialization. */
9600 register_specialization (decl
, gen_tmpl
, args
);
9603 /* Produce the definition of D, a _DECL generated from a template. If
9604 DEFER_OK is non-zero, then we don't have to actually do the
9605 instantiation now; we just have to do it sometime. */
9608 instantiate_decl (d
, defer_ok
)
9612 tree tmpl
= DECL_TI_TEMPLATE (d
);
9613 tree args
= DECL_TI_ARGS (d
);
9618 int pattern_defined
;
9620 const char *file
= input_filename
;
9622 /* This function should only be used to instantiate templates for
9623 functions and static member variables. */
9624 my_friendly_assert (TREE_CODE (d
) == FUNCTION_DECL
9625 || TREE_CODE (d
) == VAR_DECL
, 0);
9627 /* Don't instantiate cloned functions. Instead, instantiate the
9628 functions they cloned. */
9629 if (TREE_CODE (d
) == FUNCTION_DECL
&& DECL_CLONED_FUNCTION_P (d
))
9630 d
= DECL_CLONED_FUNCTION (d
);
9632 if (DECL_TEMPLATE_INSTANTIATED (d
))
9633 /* D has already been instantiated. It might seem reasonable to
9634 check whether or not D is an explicit instantiation, and, if so,
9635 stop here. But when an explicit instantiation is deferred
9636 until the end of the compilation, DECL_EXPLICIT_INSTANTIATION
9637 is set, even though we still need to do the instantiation. */
9640 /* If we already have a specialization of this declaration, then
9641 there's no reason to instantiate it. Note that
9642 retrieve_specialization gives us both instantiations and
9643 specializations, so we must explicitly check
9644 DECL_TEMPLATE_SPECIALIZATION. */
9645 gen_tmpl
= most_general_template (tmpl
);
9646 spec
= retrieve_specialization (gen_tmpl
, args
);
9647 if (spec
!= NULL_TREE
&& DECL_TEMPLATE_SPECIALIZATION (spec
))
9650 /* This needs to happen before any tsubsting. */
9651 if (! push_tinst_level (d
))
9654 timevar_push (TV_PARSE
);
9656 /* Set TD to the template whose DECL_TEMPLATE_RESULT is the pattern
9657 for the instantiation. This is not always the most general
9658 template. Consider, for example:
9661 struct S { template <class U> void f();
9662 template <> void f<int>(); };
9664 and an instantiation of S<double>::f<int>. We want TD to be the
9665 specialization S<T>::f<int>, not the more general S<T>::f<U>. */
9667 while (/* An instantiation cannot have a definition, so we need a
9668 more general template. */
9669 DECL_TEMPLATE_INSTANTIATION (td
)
9670 /* We must also deal with friend templates. Given:
9672 template <class T> struct S {
9673 template <class U> friend void f() {};
9676 S<int>::f<U> say, is not an instantiation of S<T>::f<U>,
9677 so far as the language is concerned, but that's still
9678 where we get the pattern for the instantiation from. On
9679 other hand, if the definition comes outside the class, say:
9681 template <class T> struct S {
9682 template <class U> friend void f();
9684 template <class U> friend void f() {}
9686 we don't need to look any further. That's what the check for
9687 DECL_INITIAL is for. */
9688 || (TREE_CODE (d
) == FUNCTION_DECL
9689 && DECL_FRIEND_PSEUDO_TEMPLATE_INSTANTIATION (td
)
9690 && !DECL_INITIAL (DECL_TEMPLATE_RESULT (td
))))
9692 /* The present template, TD, should not be a definition. If it
9693 were a definition, we should be using it! Note that we
9694 cannot restructure the loop to just keep going until we find
9695 a template with a definition, since that might go too far if
9696 a specialization was declared, but not defined. */
9697 my_friendly_assert (!(TREE_CODE (d
) == VAR_DECL
9698 && !DECL_IN_AGGR_P (DECL_TEMPLATE_RESULT (td
))),
9701 /* Fetch the more general template. */
9702 td
= DECL_TI_TEMPLATE (td
);
9705 code_pattern
= DECL_TEMPLATE_RESULT (td
);
9707 if (TREE_CODE (d
) == FUNCTION_DECL
)
9708 pattern_defined
= (DECL_SAVED_TREE (code_pattern
) != NULL_TREE
);
9710 pattern_defined
= ! DECL_IN_AGGR_P (code_pattern
);
9712 lineno
= DECL_SOURCE_LINE (d
);
9713 input_filename
= DECL_SOURCE_FILE (d
);
9715 if (pattern_defined
)
9717 repo_template_used (d
);
9719 if (flag_external_templates
&& ! DECL_INTERFACE_KNOWN (d
))
9721 if (flag_alt_external_templates
)
9723 if (interface_unknown
)
9724 warn_if_unknown_interface (d
);
9726 else if (DECL_INTERFACE_KNOWN (code_pattern
))
9728 DECL_INTERFACE_KNOWN (d
) = 1;
9729 DECL_NOT_REALLY_EXTERN (d
) = ! DECL_EXTERNAL (code_pattern
);
9732 warn_if_unknown_interface (code_pattern
);
9736 import_export_decl (d
);
9739 /* We need to set up DECL_INITIAL regardless of pattern_defined if
9740 the variable is a static const initialized in the class body. */
9741 if (TREE_CODE (d
) == VAR_DECL
9742 && TREE_READONLY (d
)
9743 && DECL_INITIAL (d
) == NULL_TREE
9744 && DECL_INITIAL (code_pattern
) != NULL_TREE
)
9746 /* Reject all external templates except inline functions. */
9747 else if (DECL_INTERFACE_KNOWN (d
)
9748 && ! DECL_NOT_REALLY_EXTERN (d
)
9749 && ! (TREE_CODE (d
) == FUNCTION_DECL
&& DECL_INLINE (d
)))
9751 /* Defer all other templates, unless we have been explicitly
9752 forbidden from doing so. We restore the source position here
9753 because it's used by add_pending_template. */
9754 else if (! pattern_defined
|| defer_ok
)
9757 input_filename
= file
;
9759 if (at_eof
&& !pattern_defined
9760 && DECL_EXPLICIT_INSTANTIATION (d
))
9763 The definition of a non-exported function template, a
9764 non-exported member function template, or a non-exported
9765 member function or static data member of a class template
9766 shall be present in every translation unit in which it is
9767 explicitly instantiated. */
9768 cp_error ("explicit instantiation of `%D' but no definition available",
9771 add_pending_template (d
);
9775 push_to_top_level ();
9777 /* We're now committed to instantiating this template. Mark it as
9778 instantiated so that recursive calls to instantiate_decl do not
9779 try to instantiate it again. */
9780 DECL_TEMPLATE_INSTANTIATED (d
) = 1;
9782 /* Regenerate the declaration in case the template has been modified
9783 by a subsequent redeclaration. */
9784 regenerate_decl_from_template (d
, td
);
9786 /* We already set the file and line above. Reset them now in case
9787 they changed as a result of calling regenerate_decl_from_template. */
9788 lineno
= DECL_SOURCE_LINE (d
);
9789 input_filename
= DECL_SOURCE_FILE (d
);
9791 if (TREE_CODE (d
) == VAR_DECL
)
9793 DECL_IN_AGGR_P (d
) = 0;
9794 if (DECL_INTERFACE_KNOWN (d
))
9795 DECL_EXTERNAL (d
) = ! DECL_NOT_REALLY_EXTERN (d
);
9798 DECL_EXTERNAL (d
) = 1;
9799 DECL_NOT_REALLY_EXTERN (d
) = 1;
9801 cp_finish_decl (d
, DECL_INITIAL (d
), NULL_TREE
, 0);
9803 else if (TREE_CODE (d
) == FUNCTION_DECL
)
9805 htab_t saved_local_specializations
;
9807 /* Save away the current list, in case we are instantiating one
9808 template from within the body of another. */
9809 saved_local_specializations
= local_specializations
;
9811 /* Set up the list of local specializations. */
9812 local_specializations
= htab_create (37,
9817 /* Set up context. */
9818 start_function (NULL_TREE
, d
, NULL_TREE
, SF_PRE_PARSED
);
9820 /* We already set up __FUNCTION__, etc., so we don't want to do
9822 function_name_declared_p
= 1;
9824 /* Substitute into the body of the function. */
9825 tsubst_expr (DECL_SAVED_TREE (code_pattern
), args
,
9826 /*complain=*/1, tmpl
);
9828 /* We don't need the local specializations any more. */
9829 htab_delete (local_specializations
);
9830 local_specializations
= saved_local_specializations
;
9832 /* Finish the function. */
9833 expand_body (finish_function (0));
9836 /* We're not deferring instantiation any more. */
9837 TI_PENDING_TEMPLATE_FLAG (DECL_TEMPLATE_INFO (d
)) = 0;
9839 pop_from_top_level ();
9843 input_filename
= file
;
9847 timevar_pop (TV_PARSE
);
9852 /* Run through the list of templates that we wish we could
9853 instantiate, and instantiate any we can. */
9856 instantiate_pending_templates ()
9859 int instantiated_something
= 0;
9866 t
= &pending_templates
;
9869 tree instantiation
= TREE_VALUE (*t
);
9871 reopen_tinst_level (TREE_PURPOSE (*t
));
9873 if (TYPE_P (instantiation
))
9877 if (!COMPLETE_TYPE_P (instantiation
))
9879 instantiate_class_template (instantiation
);
9880 if (CLASSTYPE_TEMPLATE_INSTANTIATION (instantiation
))
9881 for (fn
= TYPE_METHODS (instantiation
);
9883 fn
= TREE_CHAIN (fn
))
9884 if (! DECL_ARTIFICIAL (fn
))
9885 instantiate_decl (fn
, /*defer_ok=*/0);
9886 if (COMPLETE_TYPE_P (instantiation
))
9888 instantiated_something
= 1;
9893 if (COMPLETE_TYPE_P (instantiation
))
9894 /* If INSTANTIATION has been instantiated, then we don't
9895 need to consider it again in the future. */
9896 *t
= TREE_CHAIN (*t
);
9898 t
= &TREE_CHAIN (*t
);
9902 if (!DECL_TEMPLATE_SPECIALIZATION (instantiation
)
9903 && !DECL_TEMPLATE_INSTANTIATED (instantiation
))
9905 instantiation
= instantiate_decl (instantiation
,
9907 if (DECL_TEMPLATE_INSTANTIATED (instantiation
))
9909 instantiated_something
= 1;
9914 if (DECL_TEMPLATE_SPECIALIZATION (instantiation
)
9915 || DECL_TEMPLATE_INSTANTIATED (instantiation
))
9916 /* If INSTANTIATION has been instantiated, then we don't
9917 need to consider it again in the future. */
9918 *t
= TREE_CHAIN (*t
);
9920 t
= &TREE_CHAIN (*t
);
9923 current_tinst_level
= NULL_TREE
;
9927 /* Go through the things that are template instantiations if we are
9928 using guiding declarations. */
9929 t
= &maybe_templates
;
9936 fn
= TREE_VALUE (*t
);
9938 if (DECL_INITIAL (fn
))
9939 /* If the FN is already defined, then it was either already
9940 instantiated or, even though guiding declarations were
9941 allowed, a non-template definition was provided. */
9945 template = TREE_PURPOSE (*t
);
9946 args
= get_bindings (template, fn
, NULL_TREE
);
9947 fn
= instantiate_template (template, args
);
9948 instantiate_decl (fn
, /*defer_ok=*/0);
9952 /* Remove this entry from the chain. */
9953 *t
= TREE_CHAIN (*t
);
9955 maybe_template_tail
= t
;
9959 return instantiated_something
;
9962 /* Substitute ARGVEC into T, which is a list of initializers for
9963 either base class or a non-static data member. The TREE_PURPOSEs
9964 are DECLs, and the TREE_VALUEs are the initializer values. Used by
9965 instantiate_decl. */
9968 tsubst_initializer_list (t
, argvec
)
9971 tree first
= NULL_TREE
;
9974 for (; t
; t
= TREE_CHAIN (t
))
9980 decl
= tsubst_copy (TREE_PURPOSE (t
), argvec
, /*complain=*/1,
9982 init
= tsubst_expr (TREE_VALUE (t
), argvec
, /*complain=*/1,
9987 else if (TREE_CODE (init
) == TREE_LIST
)
9988 for (val
= init
; val
; val
= TREE_CHAIN (val
))
9989 TREE_VALUE (val
) = convert_from_reference (TREE_VALUE (val
));
9991 init
= convert_from_reference (init
);
9993 *p
= build_tree_list (decl
, init
);
9994 p
= &TREE_CHAIN (*p
);
9999 /* Set CURRENT_ACCESS_SPECIFIER based on the protection of DECL. */
10002 set_current_access_from_decl (decl
)
10005 if (TREE_PRIVATE (decl
))
10006 current_access_specifier
= access_private_node
;
10007 else if (TREE_PROTECTED (decl
))
10008 current_access_specifier
= access_protected_node
;
10010 current_access_specifier
= access_public_node
;
10013 /* Instantiate an enumerated type. TAG is the template type, NEWTAG
10014 is the instantiation (which should have been created with
10015 start_enum) and ARGS are the template arguments to use. */
10018 tsubst_enum (tag
, newtag
, args
)
10025 for (e
= TYPE_VALUES (tag
); e
; e
= TREE_CHAIN (e
))
10029 /* Note that in a template enum, the TREE_VALUE is the
10030 CONST_DECL, not the corresponding INTEGER_CST. */
10031 value
= tsubst_expr (DECL_INITIAL (TREE_VALUE (e
)),
10032 args
, /*complain=*/1,
10035 /* Give this enumeration constant the correct access. */
10036 set_current_access_from_decl (TREE_VALUE (e
));
10038 /* Actually build the enumerator itself. */
10039 build_enumerator (TREE_PURPOSE (e
), value
, newtag
);
10042 finish_enum (newtag
);
10043 DECL_SOURCE_LINE (TYPE_NAME (newtag
)) = DECL_SOURCE_LINE (TYPE_NAME (tag
));
10044 DECL_SOURCE_FILE (TYPE_NAME (newtag
)) = DECL_SOURCE_FILE (TYPE_NAME (tag
));
10047 /* DECL is a FUNCTION_DECL that is a template specialization. Return
10048 its type -- but without substituting the innermost set of template
10049 arguments. So, innermost set of template parameters will appear in
10050 the type. If CONTEXTP is non-NULL, then the partially substituted
10051 DECL_CONTEXT (if any) will also be filled in. Similarly, TPARMSP
10052 will be filled in with the substituted template parameters, if it
10056 get_mostly_instantiated_function_type (decl
, contextp
, tparmsp
)
10061 tree context
= NULL_TREE
;
10068 tmpl
= most_general_template (DECL_TI_TEMPLATE (decl
));
10069 targs
= DECL_TI_ARGS (decl
);
10070 tparms
= DECL_TEMPLATE_PARMS (tmpl
);
10071 parm_depth
= TMPL_PARMS_DEPTH (tparms
);
10073 /* There should be as many levels of arguments as there are levels
10075 my_friendly_assert (parm_depth
== TMPL_ARGS_DEPTH (targs
), 0);
10077 fn_type
= TREE_TYPE (tmpl
);
10078 if (DECL_STATIC_FUNCTION_P (decl
))
10079 context
= DECL_CONTEXT (decl
);
10081 if (parm_depth
== 1)
10082 /* No substitution is necessary. */
10089 /* Replace the innermost level of the TARGS with NULL_TREEs to
10090 let tsubst know not to substitute for those parameters. */
10091 partial_args
= make_tree_vec (TREE_VEC_LENGTH (targs
));
10092 for (i
= 1; i
< TMPL_ARGS_DEPTH (targs
); ++i
)
10093 SET_TMPL_ARGS_LEVEL (partial_args
, i
,
10094 TMPL_ARGS_LEVEL (targs
, i
));
10095 SET_TMPL_ARGS_LEVEL (partial_args
,
10096 TMPL_ARGS_DEPTH (targs
),
10097 make_tree_vec (DECL_NTPARMS (tmpl
)));
10099 /* Now, do the (partial) substitution to figure out the
10100 appropriate function type. */
10101 fn_type
= tsubst (fn_type
, partial_args
, /*complain=*/1, NULL_TREE
);
10102 if (DECL_STATIC_FUNCTION_P (decl
))
10103 context
= tsubst (context
, partial_args
, /*complain=*/1, NULL_TREE
);
10105 /* Substitute into the template parameters to obtain the real
10106 innermost set of parameters. This step is important if the
10107 innermost set of template parameters contains value
10108 parameters whose types depend on outer template parameters. */
10109 TREE_VEC_LENGTH (partial_args
)--;
10110 tparms
= tsubst_template_parms (tparms
, partial_args
, /*complain=*/1);
10114 *contextp
= context
;
10121 /* Set the DECL_ASSEMBLER_NAME for DECL, which is a FUNCTION_DECL that
10122 is either an instantiation or specialization of a template
10126 set_mangled_name_for_template_decl (decl
)
10129 tree context
= NULL_TREE
;
10136 my_friendly_assert (TREE_CODE (decl
) == FUNCTION_DECL
, 0);
10137 my_friendly_assert (DECL_TEMPLATE_INFO (decl
) != NULL_TREE
, 0);
10139 /* Under the new ABI, we don't need special machinery. */
10142 set_mangled_name_for_decl (decl
);
10146 /* The names of template functions must be mangled so as to indicate
10147 what template is being specialized with what template arguments.
10148 For example, each of the following three functions must get
10149 different mangled names:
10152 template <> void f<7>(int);
10153 template <> void f<8>(int); */
10155 targs
= DECL_TI_ARGS (decl
);
10156 if (uses_template_parms (targs
))
10157 /* This DECL is for a partial instantiation. There's no need to
10158 mangle the name of such an entity. */
10161 /* We now compute the PARMS and RET_TYPE to give to
10162 build_decl_overload_real. The PARMS and RET_TYPE are the
10163 parameter and return types of the template, after all but the
10164 innermost template arguments have been substituted, not the
10165 parameter and return types of the function DECL. For example,
10168 template <class T> T f(T);
10170 both PARMS and RET_TYPE should be `T' even if DECL is `int f(int)'.
10171 A more subtle example is:
10173 template <class T> struct S { template <class U> void f(T, U); }
10175 Here, if DECL is `void S<int>::f(int, double)', PARMS should be
10176 {int, U}. Thus, the args that we want to subsitute into the
10177 return and parameter type for the function are those in TARGS,
10178 with the innermost level omitted. */
10179 fn_type
= get_mostly_instantiated_function_type (decl
, &context
, &tparms
);
10181 /* Now, get the innermost parameters and arguments, and figure out
10182 the parameter and return types. */
10183 tparms
= INNERMOST_TEMPLATE_PARMS (tparms
);
10184 targs
= INNERMOST_TEMPLATE_ARGS (targs
);
10185 ret_type
= TREE_TYPE (fn_type
);
10186 parm_types
= TYPE_ARG_TYPES (fn_type
);
10188 /* For a static member function, we generate a fake `this' pointer,
10189 for the purposes of mangling. This indicates of which class the
10190 function is a member. Because of:
10194 There shall not be a static and a nonstatic member function
10195 with the same name and the same parameter types
10197 we don't have to worry that this will result in a clash with a
10198 non-static member function. */
10199 if (DECL_STATIC_FUNCTION_P (decl
))
10200 parm_types
= hash_tree_chain (build_pointer_type (context
), parm_types
);
10202 /* There should be the same number of template parameters as
10203 template arguments. */
10204 my_friendly_assert (TREE_VEC_LENGTH (tparms
) == TREE_VEC_LENGTH (targs
),
10207 /* Actually set the DECL_ASSEMBLER_NAME. */
10208 DECL_ASSEMBLER_NAME (decl
)
10209 = build_decl_overload_real (decl
, parm_types
, ret_type
,
10211 DECL_FUNCTION_MEMBER_P (decl
)
10212 + DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (decl
));
10215 /* Return truthvalue if we're processing a template different from
10216 the last one involved in diagnostics. */
10218 problematic_instantiation_changed ()
10220 return last_template_error_tick
!= tinst_level_tick
;
10223 /* Remember current template involved in diagnostics. */
10225 record_last_problematic_instantiation ()
10227 last_template_error_tick
= tinst_level_tick
;
10231 current_instantiation ()
10233 return current_tinst_level
;