1 /* Handle parameterized types (templates) for GNU C++.
2 Copyright (C) 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000
3 Free Software Foundation, Inc.
4 Written by Ken Raeburn (raeburn@cygnus.com) while at Watchmaker Computing.
5 Rewritten by Jason Merrill (jason@cygnus.com).
7 This file is part of GNU CC.
9 GNU CC is free software; you can redistribute it and/or modify
10 it under the terms of the GNU General Public License as published by
11 the Free Software Foundation; either version 2, or (at your option)
14 GNU CC is distributed in the hope that it will be useful,
15 but WITHOUT ANY WARRANTY; without even the implied warranty of
16 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
17 GNU General Public License for more details.
19 You should have received a copy of the GNU General Public License
20 along with GNU CC; see the file COPYING. If not, write to
21 the Free Software Foundation, 59 Temple Place - Suite 330,
22 Boston, MA 02111-1307, USA. */
24 /* Known bugs or deficiencies include:
26 all methods must be provided in header files; can't use a source
27 file that contains only the method templates and "just win". */
49 /* The type of functions taking a tree, and some additional data, and
51 typedef int (*tree_fn_t
) PARAMS ((tree
, void*));
53 extern struct obstack permanent_obstack
;
55 /* The PENDING_TEMPLATES is a TREE_LIST of templates whose
56 instantiations have been deferred, either because their definitions
57 were not yet available, or because we were putting off doing the
58 work. The TREE_PURPOSE of each entry is a SRCLOC indicating where
59 the instantiate request occurred; the TREE_VALUE is a either a DECL
60 (for a function or static data member), or a TYPE (for a class)
61 indicating what we are hoping to instantiate. */
62 static tree pending_templates
;
63 static tree
*template_tail
= &pending_templates
;
65 static tree maybe_templates
;
66 static tree
*maybe_template_tail
= &maybe_templates
;
68 int processing_template_parmlist
;
69 static int template_header_count
;
71 static tree saved_trees
;
72 static varray_type inline_parm_levels
;
73 static size_t inline_parm_levels_used
;
75 tree current_tinst_level
;
77 /* A map from local variable declarations in the body of the template
78 presently being instantiated to the corresponding instantiated
80 static htab_t local_specializations
;
82 #define obstack_chunk_alloc xmalloc
83 #define obstack_chunk_free free
85 #define UNIFY_ALLOW_NONE 0
86 #define UNIFY_ALLOW_MORE_CV_QUAL 1
87 #define UNIFY_ALLOW_LESS_CV_QUAL 2
88 #define UNIFY_ALLOW_DERIVED 4
89 #define UNIFY_ALLOW_INTEGER 8
91 #define GTB_VIA_VIRTUAL 1 /* The base class we are examining is
92 virtual, or a base class of a virtual
94 #define GTB_IGNORE_TYPE 2 /* We don't need to try to unify the current
95 type with the desired type. */
97 static int resolve_overloaded_unification
PARAMS ((tree
, tree
, tree
, tree
,
98 unification_kind_t
, int));
99 static int try_one_overload
PARAMS ((tree
, tree
, tree
, tree
, tree
,
100 unification_kind_t
, int));
101 static int unify
PARAMS ((tree
, tree
, tree
, tree
, int));
102 static void add_pending_template
PARAMS ((tree
));
103 static int push_tinst_level
PARAMS ((tree
));
104 static void reopen_tinst_level
PARAMS ((tree
));
105 static tree classtype_mangled_name
PARAMS ((tree
));
106 static char *mangle_class_name_for_template
PARAMS ((char *, tree
, tree
));
107 static tree tsubst_initializer_list
PARAMS ((tree
, tree
));
108 static int list_eq
PARAMS ((tree
, tree
));
109 static tree get_class_bindings
PARAMS ((tree
, tree
, tree
));
110 static tree coerce_template_parms
PARAMS ((tree
, tree
, tree
, int, int));
111 static void tsubst_enum
PARAMS ((tree
, tree
, tree
));
112 static tree add_to_template_args
PARAMS ((tree
, tree
));
113 static tree add_outermost_template_args
PARAMS ((tree
, tree
));
114 static void maybe_adjust_types_for_deduction
PARAMS ((unification_kind_t
, tree
*,
116 static int type_unification_real
PARAMS ((tree
, tree
, tree
, tree
,
117 int, unification_kind_t
, int));
118 static void note_template_header
PARAMS ((int));
119 static tree maybe_fold_nontype_arg
PARAMS ((tree
));
120 static tree convert_nontype_argument
PARAMS ((tree
, tree
));
121 static tree convert_template_argument
PARAMS ((tree
, tree
, tree
, int,
123 static tree get_bindings_overload
PARAMS ((tree
, tree
, tree
));
124 static int for_each_template_parm
PARAMS ((tree
, tree_fn_t
, void*));
125 static tree build_template_parm_index
PARAMS ((int, int, int, tree
, tree
));
126 static int inline_needs_template_parms
PARAMS ((tree
));
127 static void push_inline_template_parms_recursive
PARAMS ((tree
, int));
128 static tree retrieve_specialization
PARAMS ((tree
, tree
));
129 static tree retrieve_local_specialization
PARAMS ((tree
));
130 static tree register_specialization
PARAMS ((tree
, tree
, tree
));
131 static tree register_local_specialization
PARAMS ((tree
, tree
));
132 static int unregister_specialization
PARAMS ((tree
, tree
));
133 static tree reduce_template_parm_level
PARAMS ((tree
, tree
, int));
134 static tree build_template_decl
PARAMS ((tree
, tree
));
135 static int mark_template_parm
PARAMS ((tree
, void *));
136 static tree tsubst_friend_function
PARAMS ((tree
, tree
));
137 static tree tsubst_friend_class
PARAMS ((tree
, tree
));
138 static tree get_bindings_real
PARAMS ((tree
, tree
, tree
, int));
139 static int template_decl_level
PARAMS ((tree
));
140 static tree maybe_get_template_decl_from_type_decl
PARAMS ((tree
));
141 static int check_cv_quals_for_unify
PARAMS ((int, tree
, tree
));
142 static tree tsubst_template_arg_vector
PARAMS ((tree
, tree
, int));
143 static tree tsubst_template_parms
PARAMS ((tree
, tree
, int));
144 static void regenerate_decl_from_template
PARAMS ((tree
, tree
));
145 static tree most_specialized
PARAMS ((tree
, tree
, tree
));
146 static tree most_specialized_class
PARAMS ((tree
, tree
));
147 static void set_mangled_name_for_template_decl
PARAMS ((tree
));
148 static int template_class_depth_real
PARAMS ((tree
, int));
149 static tree tsubst_aggr_type
PARAMS ((tree
, tree
, int, tree
, int));
150 static tree tsubst_decl
PARAMS ((tree
, tree
, tree
, tree
));
151 static tree tsubst_arg_types
PARAMS ((tree
, tree
, int, tree
));
152 static tree tsubst_function_type
PARAMS ((tree
, tree
, int, tree
));
153 static void check_specialization_scope
PARAMS ((void));
154 static tree process_partial_specialization
PARAMS ((tree
));
155 static void set_current_access_from_decl
PARAMS ((tree
));
156 static void check_default_tmpl_args
PARAMS ((tree
, tree
, int, int));
157 static tree tsubst_call_declarator_parms
PARAMS ((tree
, tree
, int, tree
));
158 static tree get_template_base_recursive
PARAMS ((tree
, tree
,
159 tree
, tree
, tree
, int));
160 static tree get_template_base
PARAMS ((tree
, tree
, tree
, tree
));
161 static tree try_class_unification
PARAMS ((tree
, tree
, tree
, tree
));
162 static int coerce_template_template_parms
PARAMS ((tree
, tree
, int,
164 static tree determine_specialization
PARAMS ((tree
, tree
, tree
*, int));
165 static int template_args_equal
PARAMS ((tree
, tree
));
166 static void print_template_context
PARAMS ((int));
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 SET_DECL_ARTIFICIAL (decl
);
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 preceeded 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_speciailization, 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
);
939 /* Print the list of candidate FNS in an error message. */
942 print_candidates (fns
)
947 const char *str
= "candidates are:";
949 for (fn
= fns
; fn
!= NULL_TREE
; fn
= TREE_CHAIN (fn
))
953 for (f
= TREE_VALUE (fn
); f
; f
= OVL_NEXT (f
))
954 cp_error_at ("%s %+#D", str
, OVL_CURRENT (f
));
959 /* Returns the template (one of the functions given by TEMPLATE_ID)
960 which can be specialized to match the indicated DECL with the
961 explicit template args given in TEMPLATE_ID. The DECL may be
962 NULL_TREE if none is available. In that case, the functions in
963 TEMPLATE_ID are non-members.
965 If NEED_MEMBER_TEMPLATE is non-zero the function is known to be a
966 specialization of a member template.
968 The template args (those explicitly specified and those deduced)
969 are output in a newly created vector *TARGS_OUT.
971 If it is impossible to determine the result, an error message is
972 issued. The error_mark_node is returned to indicate failure. */
975 determine_specialization (template_id
, decl
, targs_out
,
976 need_member_template
)
980 int need_member_template
;
985 tree candidates
= NULL_TREE
;
986 tree templates
= NULL_TREE
;
988 *targs_out
= NULL_TREE
;
990 if (template_id
== error_mark_node
)
991 return error_mark_node
;
993 fns
= TREE_OPERAND (template_id
, 0);
994 explicit_targs
= TREE_OPERAND (template_id
, 1);
996 if (fns
== error_mark_node
)
997 return error_mark_node
;
999 /* Check for baselinks. */
1000 if (BASELINK_P (fns
))
1001 fns
= TREE_VALUE (fns
);
1003 if (!is_overloaded_fn (fns
))
1005 cp_error ("`%D' is not a function template", fns
);
1006 return error_mark_node
;
1009 for (; fns
; fns
= OVL_NEXT (fns
))
1013 tree fn
= OVL_CURRENT (fns
);
1015 if (TREE_CODE (fn
) == TEMPLATE_DECL
)
1016 /* DECL might be a specialization of FN. */
1018 else if (need_member_template
)
1019 /* FN is an ordinary member function, and we need a
1020 specialization of a member template. */
1022 else if (TREE_CODE (fn
) != FUNCTION_DECL
)
1023 /* We can get IDENTIFIER_NODEs here in certain erroneous
1026 else if (!DECL_FUNCTION_MEMBER_P (fn
))
1027 /* This is just an ordinary non-member function. Nothing can
1028 be a specialization of that. */
1032 tree decl_arg_types
;
1034 /* This is an ordinary member function. However, since
1035 we're here, we can assume it's enclosing class is a
1036 template class. For example,
1038 template <typename T> struct S { void f(); };
1039 template <> void S<int>::f() {}
1041 Here, S<int>::f is a non-template, but S<int> is a
1042 template class. If FN has the same type as DECL, we
1043 might be in business. */
1044 if (!same_type_p (TREE_TYPE (TREE_TYPE (decl
)),
1045 TREE_TYPE (TREE_TYPE (fn
))))
1046 /* The return types differ. */
1049 /* Adjust the type of DECL in case FN is a static member. */
1050 decl_arg_types
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
1051 if (DECL_STATIC_FUNCTION_P (fn
)
1052 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
1053 decl_arg_types
= TREE_CHAIN (decl_arg_types
);
1055 if (compparms (TYPE_ARG_TYPES (TREE_TYPE (fn
)),
1058 candidates
= tree_cons (NULL_TREE
, fn
, candidates
);
1063 /* See whether this function might be a specialization of this
1065 targs
= get_bindings (tmpl
, decl
, explicit_targs
);
1068 /* We cannot deduce template arguments that when used to
1069 specialize TMPL will produce DECL. */
1072 /* Save this template, and the arguments deduced. */
1073 templates
= tree_cons (targs
, tmpl
, templates
);
1076 if (templates
&& TREE_CHAIN (templates
))
1082 It is possible for a specialization with a given function
1083 signature to be instantiated from more than one function
1084 template. In such cases, explicit specification of the
1085 template arguments must be used to uniquely identify the
1086 function template specialization being specialized.
1088 Note that here, there's no suggestion that we're supposed to
1089 determine which of the candidate templates is most
1090 specialized. However, we, also have:
1094 Partial ordering of overloaded function template
1095 declarations is used in the following contexts to select
1096 the function template to which a function template
1097 specialization refers:
1099 -- when an explicit specialization refers to a function
1102 So, we do use the partial ordering rules, at least for now.
1103 This extension can only serve to make illegal programs legal,
1104 so it's safe. And, there is strong anecdotal evidence that
1105 the committee intended the partial ordering rules to apply;
1106 the EDG front-end has that behavior, and John Spicer claims
1107 that the committee simply forgot to delete the wording in
1108 [temp.expl.spec]. */
1109 tree tmpl
= most_specialized (templates
, decl
, explicit_targs
);
1110 if (tmpl
&& tmpl
!= error_mark_node
)
1112 targs
= get_bindings (tmpl
, decl
, explicit_targs
);
1113 templates
= tree_cons (targs
, tmpl
, NULL_TREE
);
1117 if (templates
== NULL_TREE
&& candidates
== NULL_TREE
)
1119 cp_error_at ("template-id `%D' for `%+D' does not match any template declaration",
1121 return error_mark_node
;
1123 else if ((templates
&& TREE_CHAIN (templates
))
1124 || (candidates
&& TREE_CHAIN (candidates
))
1125 || (templates
&& candidates
))
1127 cp_error_at ("ambiguous template specialization `%D' for `%+D'",
1129 chainon (candidates
, templates
);
1130 print_candidates (candidates
);
1131 return error_mark_node
;
1134 /* We have one, and exactly one, match. */
1137 /* It was a specialization of an ordinary member function in a
1139 *targs_out
= copy_node (DECL_TI_ARGS (TREE_VALUE (candidates
)));
1140 return DECL_TI_TEMPLATE (TREE_VALUE (candidates
));
1143 /* It was a specialization of a template. */
1144 targs
= DECL_TI_ARGS (DECL_TEMPLATE_RESULT (TREE_VALUE (templates
)));
1145 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (targs
))
1147 *targs_out
= copy_node (targs
);
1148 SET_TMPL_ARGS_LEVEL (*targs_out
,
1149 TMPL_ARGS_DEPTH (*targs_out
),
1150 TREE_PURPOSE (templates
));
1153 *targs_out
= TREE_PURPOSE (templates
);
1154 return TREE_VALUE (templates
);
1157 /* Check to see if the function just declared, as indicated in
1158 DECLARATOR, and in DECL, is a specialization of a function
1159 template. We may also discover that the declaration is an explicit
1160 instantiation at this point.
1162 Returns DECL, or an equivalent declaration that should be used
1163 instead if all goes well. Issues an error message if something is
1164 amiss. Returns error_mark_node if the error is not easily
1167 FLAGS is a bitmask consisting of the following flags:
1169 2: The function has a definition.
1170 4: The function is a friend.
1172 The TEMPLATE_COUNT is the number of references to qualifying
1173 template classes that appeared in the name of the function. For
1176 template <class T> struct S { void f(); };
1179 the TEMPLATE_COUNT would be 1. However, explicitly specialized
1180 classes are not counted in the TEMPLATE_COUNT, so that in
1182 template <class T> struct S {};
1183 template <> struct S<int> { void f(); }
1184 template <> void S<int>::f();
1186 the TEMPLATE_COUNT would be 0. (Note that this declaration is
1187 illegal; there should be no template <>.)
1189 If the function is a specialization, it is marked as such via
1190 DECL_TEMPLATE_SPECIALIZATION. Furthermore, its DECL_TEMPLATE_INFO
1191 is set up correctly, and it is added to the list of specializations
1192 for that template. */
1195 check_explicit_specialization (declarator
, decl
, template_count
, flags
)
1201 int have_def
= flags
& 2;
1202 int is_friend
= flags
& 4;
1203 int specialization
= 0;
1204 int explicit_instantiation
= 0;
1205 int member_specialization
= 0;
1206 tree ctype
= DECL_CLASS_CONTEXT (decl
);
1207 tree dname
= DECL_NAME (decl
);
1210 tsk
= current_tmpl_spec_kind (template_count
);
1215 if (processing_specialization
)
1218 SET_DECL_TEMPLATE_SPECIALIZATION (decl
);
1220 else if (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
)
1223 /* This could be something like:
1225 template <class T> void f(T);
1226 class S { friend void f<>(int); } */
1230 /* This case handles bogus declarations like template <>
1231 template <class T> void f<int>(); */
1233 cp_error ("template-id `%D' in declaration of primary template",
1240 case tsk_invalid_member_spec
:
1241 /* The error has already been reported in
1242 check_specialization_scope. */
1243 return error_mark_node
;
1245 case tsk_invalid_expl_inst
:
1246 cp_error ("template parameter list used in explicit instantiation");
1252 cp_error ("definition provided for explicit instantiation");
1254 explicit_instantiation
= 1;
1257 case tsk_excessive_parms
:
1258 cp_error ("too many template parameter lists in declaration of `%D'",
1260 return error_mark_node
;
1264 SET_DECL_TEMPLATE_SPECIALIZATION (decl
);
1266 member_specialization
= 1;
1271 case tsk_insufficient_parms
:
1272 if (template_header_count
)
1274 cp_error("too few template parameter lists in declaration of `%D'",
1278 else if (ctype
!= NULL_TREE
1279 && !TYPE_BEING_DEFINED (ctype
)
1280 && CLASSTYPE_TEMPLATE_INSTANTIATION (ctype
)
1283 /* For backwards compatibility, we accept:
1285 template <class T> struct S { void f(); };
1286 void S<int>::f() {} // Missing template <>
1288 That used to be legal C++. */
1291 ("explicit specialization not preceded by `template <>'");
1293 SET_DECL_TEMPLATE_SPECIALIZATION (decl
);
1298 if (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
)
1300 /* This case handles bogus declarations like template <>
1301 template <class T> void f<int>(); */
1303 cp_error ("template-id `%D' in declaration of primary template",
1308 if (ctype
&& CLASSTYPE_TEMPLATE_INSTANTIATION (ctype
))
1309 /* This is a specialization of a member template, without
1310 specialization the containing class. Something like:
1312 template <class T> struct S {
1313 template <class U> void f (U);
1315 template <> template <class U> void S<int>::f(U) {}
1317 That's a specialization -- but of the entire template. */
1322 my_friendly_abort (20000309);
1325 if (specialization
|| member_specialization
)
1327 tree t
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
1328 for (; t
; t
= TREE_CHAIN (t
))
1329 if (TREE_PURPOSE (t
))
1332 ("default argument specified in explicit specialization");
1335 if (current_lang_name
== lang_name_c
)
1336 cp_error ("template specialization with C linkage");
1339 if (specialization
|| member_specialization
|| explicit_instantiation
)
1341 tree tmpl
= NULL_TREE
;
1342 tree targs
= NULL_TREE
;
1344 /* Make sure that the declarator is a TEMPLATE_ID_EXPR. */
1345 if (TREE_CODE (declarator
) != TEMPLATE_ID_EXPR
)
1349 my_friendly_assert (TREE_CODE (declarator
) == IDENTIFIER_NODE
,
1352 fns
= IDENTIFIER_NAMESPACE_VALUE (dname
);
1357 lookup_template_function (fns
, NULL_TREE
);
1360 if (declarator
== error_mark_node
)
1361 return error_mark_node
;
1363 if (ctype
!= NULL_TREE
&& TYPE_BEING_DEFINED (ctype
))
1365 if (!explicit_instantiation
)
1366 /* A specialization in class scope. This is illegal,
1367 but the error will already have been flagged by
1368 check_specialization_scope. */
1369 return error_mark_node
;
1372 /* It's not legal to write an explicit instantiation in
1375 class C { template void f(); }
1377 This case is caught by the parser. However, on
1380 template class C { void f(); };
1382 (which is illegal) we can get here. The error will be
1389 else if (TREE_CODE (TREE_OPERAND (declarator
, 0)) == LOOKUP_EXPR
)
1391 /* A friend declaration. We can't do much, because we don't
1392 know what this resolves to, yet. */
1393 my_friendly_assert (is_friend
!= 0, 0);
1394 my_friendly_assert (!explicit_instantiation
, 0);
1395 SET_DECL_IMPLICIT_INSTANTIATION (decl
);
1398 else if (ctype
!= NULL_TREE
1399 && (TREE_CODE (TREE_OPERAND (declarator
, 0)) ==
1402 /* Find the list of functions in ctype that have the same
1403 name as the declared function. */
1404 tree name
= TREE_OPERAND (declarator
, 0);
1405 tree fns
= NULL_TREE
;
1408 if (name
== constructor_name (ctype
)
1409 || name
== constructor_name_full (ctype
))
1411 int is_constructor
= DECL_CONSTRUCTOR_P (decl
);
1413 if (is_constructor
? !TYPE_HAS_CONSTRUCTOR (ctype
)
1414 : !TYPE_HAS_DESTRUCTOR (ctype
))
1416 /* From [temp.expl.spec]:
1418 If such an explicit specialization for the member
1419 of a class template names an implicitly-declared
1420 special member function (clause _special_), the
1421 program is ill-formed.
1423 Similar language is found in [temp.explicit]. */
1424 cp_error ("specialization of implicitly-declared special member function");
1425 return error_mark_node
;
1428 name
= is_constructor
? ctor_identifier
: dtor_identifier
;
1431 if (!DECL_CONV_FN_P (decl
))
1433 idx
= lookup_fnfields_1 (ctype
, name
);
1435 fns
= TREE_VEC_ELT (CLASSTYPE_METHOD_VEC (ctype
), idx
);
1441 /* For a type-conversion operator, we cannot do a
1442 name-based lookup. We might be looking for `operator
1443 int' which will be a specialization of `operator T'.
1444 So, we find *all* the conversion operators, and then
1445 select from them. */
1448 methods
= CLASSTYPE_METHOD_VEC (ctype
);
1450 for (idx
= 2; idx
< TREE_VEC_LENGTH (methods
); ++idx
)
1452 tree ovl
= TREE_VEC_ELT (methods
, idx
);
1454 if (!ovl
|| !DECL_CONV_FN_P (OVL_CURRENT (ovl
)))
1455 /* There are no more conversion functions. */
1458 /* Glue all these conversion functions together
1459 with those we already have. */
1460 for (; ovl
; ovl
= OVL_NEXT (ovl
))
1461 fns
= ovl_cons (OVL_CURRENT (ovl
), fns
);
1465 if (fns
== NULL_TREE
)
1467 cp_error ("no member function `%D' declared in `%T'",
1469 return error_mark_node
;
1472 TREE_OPERAND (declarator
, 0) = fns
;
1475 /* Figure out what exactly is being specialized at this point.
1476 Note that for an explicit instantiation, even one for a
1477 member function, we cannot tell apriori whether the
1478 instantiation is for a member template, or just a member
1479 function of a template class. Even if a member template is
1480 being instantiated, the member template arguments may be
1481 elided if they can be deduced from the rest of the
1483 tmpl
= determine_specialization (declarator
, decl
,
1485 member_specialization
);
1487 if (!tmpl
|| tmpl
== error_mark_node
)
1488 /* We couldn't figure out what this declaration was
1490 return error_mark_node
;
1493 tree gen_tmpl
= most_general_template (tmpl
);
1495 if (explicit_instantiation
)
1497 /* We don't set DECL_EXPLICIT_INSTANTIATION here; that
1498 is done by do_decl_instantiation later. */
1500 int arg_depth
= TMPL_ARGS_DEPTH (targs
);
1501 int parm_depth
= TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl
));
1503 if (arg_depth
> parm_depth
)
1505 /* If TMPL is not the most general template (for
1506 example, if TMPL is a friend template that is
1507 injected into namespace scope), then there will
1508 be too many levels fo TARGS. Remove some of them
1513 new_targs
= make_tree_vec (parm_depth
);
1514 for (i
= arg_depth
- parm_depth
; i
< arg_depth
; ++i
)
1515 TREE_VEC_ELT (new_targs
, i
- (arg_depth
- parm_depth
))
1516 = TREE_VEC_ELT (targs
, i
);
1520 return instantiate_template (tmpl
, targs
);
1523 /* If this is a specialization of a member template of a
1524 template class. In we want to return the TEMPLATE_DECL,
1525 not the specialization of it. */
1526 if (tsk
== tsk_template
)
1528 SET_DECL_TEMPLATE_SPECIALIZATION (tmpl
);
1529 DECL_INITIAL (DECL_TEMPLATE_RESULT (tmpl
)) = NULL_TREE
;
1533 /* If we though that the DECL was a member function, but it
1534 turns out to be specializing a static member function,
1535 make DECL a static member function as well. */
1536 if (DECL_STATIC_FUNCTION_P (tmpl
)
1537 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
1539 revert_static_member_fn (decl
);
1540 last_function_parms
= TREE_CHAIN (last_function_parms
);
1543 /* Set up the DECL_TEMPLATE_INFO for DECL. */
1544 DECL_TEMPLATE_INFO (decl
) = tree_cons (tmpl
, targs
, NULL_TREE
);
1546 /* Mangle the function name appropriately. Note that we do
1547 not mangle specializations of non-template member
1548 functions of template classes, e.g. with
1550 template <class T> struct S { void f(); }
1552 and given the specialization
1554 template <> void S<int>::f() {}
1556 we do not mangle S<int>::f() here. That's because it's
1557 just an ordinary member function and doesn't need special
1558 treatment. We do this here so that the ordinary,
1559 non-template, name-mangling algorithm will not be used
1561 if ((is_member_template (tmpl
) || ctype
== NULL_TREE
)
1562 && name_mangling_version
>= 1)
1563 set_mangled_name_for_template_decl (decl
);
1565 if (is_friend
&& !have_def
)
1566 /* This is not really a declaration of a specialization.
1567 It's just the name of an instantiation. But, it's not
1568 a request for an instantiation, either. */
1569 SET_DECL_IMPLICIT_INSTANTIATION (decl
);
1571 /* Register this specialization so that we can find it
1573 decl
= register_specialization (decl
, gen_tmpl
, targs
);
1580 /* TYPE is being declared. Verify that the use of template headers
1581 and such is reasonable. Issue error messages if not. */
1584 maybe_check_template_type (type
)
1587 if (template_header_count
)
1589 /* We are in the scope of some `template <...>' header. */
1592 = template_class_depth_real (TYPE_CONTEXT (type
),
1593 /*count_specializations=*/1);
1595 if (template_header_count
<= context_depth
)
1596 /* This is OK; the template headers are for the context. We
1597 are actually too lenient here; like
1598 check_explicit_specialization we should consider the number
1599 of template types included in the actual declaration. For
1602 template <class T> struct S {
1603 template <class U> template <class V>
1609 template <class T> struct S {
1610 template <class U> struct I;
1613 template <class T> template <class U.
1618 else if (template_header_count
> context_depth
+ 1)
1619 /* There are two many template parameter lists. */
1620 cp_error ("too many template parameter lists in declaration of `%T'", type
);
1624 /* Returns 1 iff PARMS1 and PARMS2 are identical sets of template
1625 parameters. These are represented in the same format used for
1626 DECL_TEMPLATE_PARMS. */
1628 int comp_template_parms (parms1
, parms2
)
1635 if (parms1
== parms2
)
1638 for (p1
= parms1
, p2
= parms2
;
1639 p1
!= NULL_TREE
&& p2
!= NULL_TREE
;
1640 p1
= TREE_CHAIN (p1
), p2
= TREE_CHAIN (p2
))
1642 tree t1
= TREE_VALUE (p1
);
1643 tree t2
= TREE_VALUE (p2
);
1646 my_friendly_assert (TREE_CODE (t1
) == TREE_VEC
, 0);
1647 my_friendly_assert (TREE_CODE (t2
) == TREE_VEC
, 0);
1649 if (TREE_VEC_LENGTH (t1
) != TREE_VEC_LENGTH (t2
))
1652 for (i
= 0; i
< TREE_VEC_LENGTH (t2
); ++i
)
1654 tree parm1
= TREE_VALUE (TREE_VEC_ELT (t1
, i
));
1655 tree parm2
= TREE_VALUE (TREE_VEC_ELT (t2
, i
));
1657 if (TREE_CODE (parm1
) != TREE_CODE (parm2
))
1660 if (TREE_CODE (parm1
) == TEMPLATE_TYPE_PARM
)
1662 else if (!same_type_p (TREE_TYPE (parm1
), TREE_TYPE (parm2
)))
1667 if ((p1
!= NULL_TREE
) != (p2
!= NULL_TREE
))
1668 /* One set of parameters has more parameters lists than the
1675 /* Complain if DECL shadows a template parameter.
1677 [temp.local]: A template-parameter shall not be redeclared within its
1678 scope (including nested scopes). */
1681 check_template_shadow (decl
)
1686 /* If we're not in a template, we can't possibly shadow a template
1688 if (!current_template_parms
)
1691 /* Figure out what we're shadowing. */
1692 if (TREE_CODE (decl
) == OVERLOAD
)
1693 decl
= OVL_CURRENT (decl
);
1694 olddecl
= IDENTIFIER_VALUE (DECL_NAME (decl
));
1696 /* If there's no previous binding for this name, we're not shadowing
1697 anything, let alone a template parameter. */
1701 /* If we're not shadowing a template parameter, we're done. Note
1702 that OLDDECL might be an OVERLOAD (or perhaps even an
1703 ERROR_MARK), so we can't just blithely assume it to be a _DECL
1705 if (!DECL_P (olddecl
) || !DECL_TEMPLATE_PARM_P (olddecl
))
1708 /* We check for decl != olddecl to avoid bogus errors for using a
1709 name inside a class. We check TPFI to avoid duplicate errors for
1710 inline member templates. */
1712 || TEMPLATE_PARMS_FOR_INLINE (current_template_parms
))
1715 cp_error_at ("declaration of `%#D'", decl
);
1716 cp_error_at (" shadows template parm `%#D'", olddecl
);
1719 /* Return a new TEMPLATE_PARM_INDEX with the indicated INDEX, LEVEL,
1720 ORIG_LEVEL, DECL, and TYPE. */
1723 build_template_parm_index (index
, level
, orig_level
, decl
, type
)
1730 tree t
= make_node (TEMPLATE_PARM_INDEX
);
1731 TEMPLATE_PARM_IDX (t
) = index
;
1732 TEMPLATE_PARM_LEVEL (t
) = level
;
1733 TEMPLATE_PARM_ORIG_LEVEL (t
) = orig_level
;
1734 TEMPLATE_PARM_DECL (t
) = decl
;
1735 TREE_TYPE (t
) = type
;
1740 /* Return a TEMPLATE_PARM_INDEX, similar to INDEX, but whose
1741 TEMPLATE_PARM_LEVEL has been decreased by LEVELS. If such a
1742 TEMPLATE_PARM_INDEX already exists, it is returned; otherwise, a
1743 new one is created. */
1746 reduce_template_parm_level (index
, type
, levels
)
1751 if (TEMPLATE_PARM_DESCENDANTS (index
) == NULL_TREE
1752 || (TEMPLATE_PARM_LEVEL (TEMPLATE_PARM_DESCENDANTS (index
))
1753 != TEMPLATE_PARM_LEVEL (index
) - levels
))
1756 = build_decl (TREE_CODE (TEMPLATE_PARM_DECL (index
)),
1757 DECL_NAME (TEMPLATE_PARM_DECL (index
)),
1760 = build_template_parm_index (TEMPLATE_PARM_IDX (index
),
1761 TEMPLATE_PARM_LEVEL (index
) - levels
,
1762 TEMPLATE_PARM_ORIG_LEVEL (index
),
1764 TEMPLATE_PARM_DESCENDANTS (index
) = t
;
1766 /* Template template parameters need this. */
1767 DECL_TEMPLATE_PARMS (decl
)
1768 = DECL_TEMPLATE_PARMS (TEMPLATE_PARM_DECL (index
));
1771 return TEMPLATE_PARM_DESCENDANTS (index
);
1774 /* Process information from new template parameter NEXT and append it to the
1775 LIST being built. */
1778 process_template_parm (list
, next
)
1787 my_friendly_assert (TREE_CODE (parm
) == TREE_LIST
, 259);
1788 defval
= TREE_PURPOSE (parm
);
1789 parm
= TREE_VALUE (parm
);
1790 is_type
= TREE_PURPOSE (parm
) == class_type_node
;
1794 tree p
= TREE_VALUE (tree_last (list
));
1796 if (TREE_CODE (p
) == TYPE_DECL
)
1797 idx
= TEMPLATE_TYPE_IDX (TREE_TYPE (p
));
1798 else if (TREE_CODE (p
) == TEMPLATE_DECL
)
1799 idx
= TEMPLATE_TYPE_IDX (TREE_TYPE (DECL_TEMPLATE_RESULT (p
)));
1801 idx
= TEMPLATE_PARM_IDX (DECL_INITIAL (p
));
1809 my_friendly_assert (TREE_CODE (TREE_PURPOSE (parm
)) == TREE_LIST
, 260);
1810 /* is a const-param */
1811 parm
= grokdeclarator (TREE_VALUE (parm
), TREE_PURPOSE (parm
),
1812 PARM
, 0, NULL_TREE
);
1816 The top-level cv-qualifiers on the template-parameter are
1817 ignored when determining its type. */
1818 TREE_TYPE (parm
) = TYPE_MAIN_VARIANT (TREE_TYPE (parm
));
1820 /* A template parameter is not modifiable. */
1821 TREE_READONLY (parm
) = 1;
1822 if (IS_AGGR_TYPE (TREE_TYPE (parm
))
1823 && TREE_CODE (TREE_TYPE (parm
)) != TEMPLATE_TYPE_PARM
1824 && TREE_CODE (TREE_TYPE (parm
)) != TYPENAME_TYPE
)
1826 cp_error ("`%#T' is not a valid type for a template constant parameter",
1828 if (DECL_NAME (parm
) == NULL_TREE
)
1829 error (" a template type parameter must begin with `class' or `typename'");
1830 TREE_TYPE (parm
) = void_type_node
;
1833 && (TREE_CODE (TREE_TYPE (parm
)) == REAL_TYPE
1834 || TREE_CODE (TREE_TYPE (parm
)) == COMPLEX_TYPE
))
1835 cp_pedwarn ("`%T' is not a valid type for a template constant parameter",
1837 decl
= build_decl (CONST_DECL
, DECL_NAME (parm
), TREE_TYPE (parm
));
1838 DECL_INITIAL (parm
) = DECL_INITIAL (decl
)
1839 = build_template_parm_index (idx
, processing_template_decl
,
1840 processing_template_decl
,
1841 decl
, TREE_TYPE (parm
));
1846 parm
= TREE_VALUE (parm
);
1848 if (parm
&& TREE_CODE (parm
) == TEMPLATE_DECL
)
1850 t
= make_aggr_type (TEMPLATE_TEMPLATE_PARM
);
1851 /* This is for distinguishing between real templates and template
1852 template parameters */
1853 TREE_TYPE (parm
) = t
;
1854 TREE_TYPE (DECL_TEMPLATE_RESULT (parm
)) = t
;
1859 t
= make_aggr_type (TEMPLATE_TYPE_PARM
);
1860 /* parm is either IDENTIFIER_NODE or NULL_TREE */
1861 decl
= build_decl (TYPE_DECL
, parm
, t
);
1864 TYPE_NAME (t
) = decl
;
1865 TYPE_STUB_DECL (t
) = decl
;
1867 TEMPLATE_TYPE_PARM_INDEX (t
)
1868 = build_template_parm_index (idx
, processing_template_decl
,
1869 processing_template_decl
,
1870 decl
, TREE_TYPE (parm
));
1872 SET_DECL_ARTIFICIAL (decl
);
1873 SET_DECL_TEMPLATE_PARM_P (decl
);
1875 parm
= build_tree_list (defval
, parm
);
1876 return chainon (list
, parm
);
1879 /* The end of a template parameter list has been reached. Process the
1880 tree list into a parameter vector, converting each parameter into a more
1881 useful form. Type parameters are saved as IDENTIFIER_NODEs, and others
1885 end_template_parm_list (parms
)
1890 tree saved_parmlist
= make_tree_vec (list_length (parms
));
1892 current_template_parms
1893 = tree_cons (build_int_2 (0, processing_template_decl
),
1894 saved_parmlist
, current_template_parms
);
1896 for (parm
= parms
, nparms
= 0;
1898 parm
= TREE_CHAIN (parm
), nparms
++)
1899 TREE_VEC_ELT (saved_parmlist
, nparms
) = parm
;
1901 --processing_template_parmlist
;
1903 return saved_parmlist
;
1906 /* end_template_decl is called after a template declaration is seen. */
1909 end_template_decl ()
1911 reset_specialization ();
1913 if (! processing_template_decl
)
1916 /* This matches the pushlevel in begin_template_parm_list. */
1919 --processing_template_decl
;
1920 current_template_parms
= TREE_CHAIN (current_template_parms
);
1923 /* Given a template argument vector containing the template PARMS.
1924 The innermost PARMS are given first. */
1927 current_template_args ()
1930 tree args
= NULL_TREE
;
1931 int length
= TMPL_PARMS_DEPTH (current_template_parms
);
1934 /* If there is only one level of template parameters, we do not
1935 create a TREE_VEC of TREE_VECs. Instead, we return a single
1936 TREE_VEC containing the arguments. */
1938 args
= make_tree_vec (length
);
1940 for (header
= current_template_parms
; header
; header
= TREE_CHAIN (header
))
1942 tree a
= copy_node (TREE_VALUE (header
));
1945 TREE_TYPE (a
) = NULL_TREE
;
1946 for (i
= TREE_VEC_LENGTH (a
) - 1; i
>= 0; --i
)
1948 tree t
= TREE_VEC_ELT (a
, i
);
1950 /* T will be a list if we are called from within a
1951 begin/end_template_parm_list pair, but a vector directly
1952 if within a begin/end_member_template_processing pair. */
1953 if (TREE_CODE (t
) == TREE_LIST
)
1957 if (TREE_CODE (t
) == TYPE_DECL
1958 || TREE_CODE (t
) == TEMPLATE_DECL
)
1961 t
= DECL_INITIAL (t
);
1962 TREE_VEC_ELT (a
, i
) = t
;
1967 TREE_VEC_ELT (args
, --l
) = a
;
1975 /* Return a TEMPLATE_DECL corresponding to DECL, using the indicated
1976 template PARMS. Used by push_template_decl below. */
1979 build_template_decl (decl
, parms
)
1983 tree tmpl
= build_lang_decl (TEMPLATE_DECL
, DECL_NAME (decl
), NULL_TREE
);
1984 DECL_TEMPLATE_PARMS (tmpl
) = parms
;
1985 DECL_CONTEXT (tmpl
) = DECL_CONTEXT (decl
);
1986 if (DECL_LANG_SPECIFIC (decl
))
1988 DECL_VIRTUAL_CONTEXT (tmpl
) = DECL_VIRTUAL_CONTEXT (decl
);
1989 DECL_STATIC_FUNCTION_P (tmpl
) = DECL_STATIC_FUNCTION_P (decl
);
1990 DECL_CONSTRUCTOR_P (tmpl
) = DECL_CONSTRUCTOR_P (decl
);
1991 DECL_NONCONVERTING_P (tmpl
) = DECL_NONCONVERTING_P (decl
);
1992 DECL_ASSIGNMENT_OPERATOR_P (tmpl
) = DECL_ASSIGNMENT_OPERATOR_P (decl
);
1993 if (DECL_OVERLOADED_OPERATOR_P (decl
))
1994 SET_OVERLOADED_OPERATOR_CODE (tmpl
,
1995 DECL_OVERLOADED_OPERATOR_P (decl
));
2001 struct template_parm_data
2003 /* The level of the template parameters we are currently
2007 /* The index of the specialization argument we are currently
2011 /* An array whose size is the number of template parameters. The
2012 elements are non-zero if the parameter has been used in any one
2013 of the arguments processed so far. */
2016 /* An array whose size is the number of template arguments. The
2017 elements are non-zero if the argument makes use of template
2018 parameters of this level. */
2019 int* arg_uses_template_parms
;
2022 /* Subroutine of push_template_decl used to see if each template
2023 parameter in a partial specialization is used in the explicit
2024 argument list. If T is of the LEVEL given in DATA (which is
2025 treated as a template_parm_data*), then DATA->PARMS is marked
2029 mark_template_parm (t
, data
)
2035 struct template_parm_data
* tpd
= (struct template_parm_data
*) data
;
2037 if (TREE_CODE (t
) == TEMPLATE_PARM_INDEX
)
2039 level
= TEMPLATE_PARM_LEVEL (t
);
2040 idx
= TEMPLATE_PARM_IDX (t
);
2044 level
= TEMPLATE_TYPE_LEVEL (t
);
2045 idx
= TEMPLATE_TYPE_IDX (t
);
2048 if (level
== tpd
->level
)
2050 tpd
->parms
[idx
] = 1;
2051 tpd
->arg_uses_template_parms
[tpd
->current_arg
] = 1;
2054 /* Return zero so that for_each_template_parm will continue the
2055 traversal of the tree; we want to mark *every* template parm. */
2059 /* Process the partial specialization DECL. */
2062 process_partial_specialization (decl
)
2065 tree type
= TREE_TYPE (decl
);
2066 tree maintmpl
= CLASSTYPE_TI_TEMPLATE (type
);
2067 tree specargs
= CLASSTYPE_TI_ARGS (type
);
2068 tree inner_args
= INNERMOST_TEMPLATE_ARGS (specargs
);
2069 tree inner_parms
= INNERMOST_TEMPLATE_PARMS (current_template_parms
);
2070 tree main_inner_parms
= DECL_INNERMOST_TEMPLATE_PARMS (maintmpl
);
2071 int nargs
= TREE_VEC_LENGTH (inner_args
);
2072 int ntparms
= TREE_VEC_LENGTH (inner_parms
);
2074 int did_error_intro
= 0;
2075 struct template_parm_data tpd
;
2076 struct template_parm_data tpd2
;
2078 /* We check that each of the template parameters given in the
2079 partial specialization is used in the argument list to the
2080 specialization. For example:
2082 template <class T> struct S;
2083 template <class T> struct S<T*>;
2085 The second declaration is OK because `T*' uses the template
2086 parameter T, whereas
2088 template <class T> struct S<int>;
2090 is no good. Even trickier is:
2101 The S2<T> declaration is actually illegal; it is a
2102 full-specialization. Of course,
2105 struct S2<T (*)(U)>;
2107 or some such would have been OK. */
2108 tpd
.level
= TMPL_PARMS_DEPTH (current_template_parms
);
2109 tpd
.parms
= alloca (sizeof (int) * ntparms
);
2110 bzero ((PTR
) tpd
.parms
, sizeof (int) * ntparms
);
2112 tpd
.arg_uses_template_parms
= alloca (sizeof (int) * nargs
);
2113 bzero ((PTR
) tpd
.arg_uses_template_parms
, sizeof (int) * nargs
);
2114 for (i
= 0; i
< nargs
; ++i
)
2116 tpd
.current_arg
= i
;
2117 for_each_template_parm (TREE_VEC_ELT (inner_args
, i
),
2118 &mark_template_parm
,
2121 for (i
= 0; i
< ntparms
; ++i
)
2122 if (tpd
.parms
[i
] == 0)
2124 /* One of the template parms was not used in the
2126 if (!did_error_intro
)
2128 cp_error ("template parameters not used in partial specialization:");
2129 did_error_intro
= 1;
2133 TREE_VALUE (TREE_VEC_ELT (inner_parms
, i
)));
2136 /* [temp.class.spec]
2138 The argument list of the specialization shall not be identical to
2139 the implicit argument list of the primary template. */
2140 if (comp_template_args
2142 INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (TREE_TYPE
2144 cp_error ("partial specialization `%T' does not specialize any template arguments", type
);
2146 /* [temp.class.spec]
2148 A partially specialized non-type argument expression shall not
2149 involve template parameters of the partial specialization except
2150 when the argument expression is a simple identifier.
2152 The type of a template parameter corresponding to a specialized
2153 non-type argument shall not be dependent on a parameter of the
2155 my_friendly_assert (nargs
== DECL_NTPARMS (maintmpl
), 0);
2157 for (i
= 0; i
< nargs
; ++i
)
2159 tree arg
= TREE_VEC_ELT (inner_args
, i
);
2160 if (/* These first two lines are the `non-type' bit. */
2162 && TREE_CODE (arg
) != TEMPLATE_DECL
2163 /* This next line is the `argument expression is not just a
2164 simple identifier' condition and also the `specialized
2165 non-type argument' bit. */
2166 && TREE_CODE (arg
) != TEMPLATE_PARM_INDEX
)
2168 if (tpd
.arg_uses_template_parms
[i
])
2169 cp_error ("template argument `%E' involves template parameter(s)", arg
);
2172 /* Look at the corresponding template parameter,
2173 marking which template parameters its type depends
2176 TREE_TYPE (TREE_VALUE (TREE_VEC_ELT (main_inner_parms
,
2181 /* We haven't yet initialized TPD2. Do so now. */
2182 tpd2
.arg_uses_template_parms
2183 = (int*) alloca (sizeof (int) * nargs
);
2184 /* The number of parameters here is the number in the
2185 main template, which, as checked in the assertion
2187 tpd2
.parms
= (int*) alloca (sizeof (int) * nargs
);
2189 TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (maintmpl
));
2192 /* Mark the template parameters. But this time, we're
2193 looking for the template parameters of the main
2194 template, not in the specialization. */
2195 tpd2
.current_arg
= i
;
2196 tpd2
.arg_uses_template_parms
[i
] = 0;
2197 bzero ((PTR
) tpd2
.parms
, sizeof (int) * nargs
);
2198 for_each_template_parm (type
,
2199 &mark_template_parm
,
2202 if (tpd2
.arg_uses_template_parms
[i
])
2204 /* The type depended on some template parameters.
2205 If they are fully specialized in the
2206 specialization, that's OK. */
2208 for (j
= 0; j
< nargs
; ++j
)
2209 if (tpd2
.parms
[j
] != 0
2210 && tpd
.arg_uses_template_parms
[j
])
2212 cp_error ("type `%T' of template argument `%E' depends on template parameter(s)",
2222 if (retrieve_specialization (maintmpl
, specargs
))
2223 /* We've already got this specialization. */
2226 DECL_TEMPLATE_SPECIALIZATIONS (maintmpl
)
2227 = tree_cons (inner_args
, inner_parms
,
2228 DECL_TEMPLATE_SPECIALIZATIONS (maintmpl
));
2229 TREE_TYPE (DECL_TEMPLATE_SPECIALIZATIONS (maintmpl
)) = type
;
2233 /* Check that a template declaration's use of default arguments is not
2234 invalid. Here, PARMS are the template parameters. IS_PRIMARY is
2235 non-zero if DECL is the thing declared by a primary template.
2236 IS_PARTIAL is non-zero if DECL is a partial specialization. */
2239 check_default_tmpl_args (decl
, parms
, is_primary
, is_partial
)
2246 int last_level_to_check
;
2251 A default template-argument shall not be specified in a
2252 function template declaration or a function template definition, nor
2253 in the template-parameter-list of the definition of a member of a
2256 if (TREE_CODE (CP_DECL_CONTEXT (decl
)) == FUNCTION_DECL
)
2257 /* You can't have a function template declaration in a local
2258 scope, nor you can you define a member of a class template in a
2262 if (current_class_type
2263 && !TYPE_BEING_DEFINED (current_class_type
)
2264 && DECL_LANG_SPECIFIC (decl
)
2265 /* If this is either a friend defined in the scope of the class
2266 or a member function. */
2267 && ((DECL_CONTEXT (decl
)
2268 && same_type_p (DECL_CONTEXT (decl
), current_class_type
))
2269 || (DECL_FRIEND_CONTEXT (decl
)
2270 && same_type_p (DECL_FRIEND_CONTEXT (decl
),
2271 current_class_type
)))
2272 /* And, if it was a member function, it really was defined in
2273 the scope of the class. */
2274 && (!DECL_FUNCTION_MEMBER_P (decl
) || DECL_DEFINED_IN_CLASS_P (decl
)))
2275 /* We already checked these parameters when the template was
2276 declared, so there's no need to do it again now. This function
2277 was defined in class scope, but we're processing it's body now
2278 that the class is complete. */
2283 If a template-parameter has a default template-argument, all
2284 subsequent template-parameters shall have a default
2285 template-argument supplied. */
2286 for (parm_level
= parms
; parm_level
; parm_level
= TREE_CHAIN (parm_level
))
2288 tree inner_parms
= TREE_VALUE (parm_level
);
2289 int ntparms
= TREE_VEC_LENGTH (inner_parms
);
2290 int seen_def_arg_p
= 0;
2293 for (i
= 0; i
< ntparms
; ++i
)
2295 tree parm
= TREE_VEC_ELT (inner_parms
, i
);
2296 if (TREE_PURPOSE (parm
))
2298 else if (seen_def_arg_p
)
2300 cp_error ("no default argument for `%D'", TREE_VALUE (parm
));
2301 /* For better subsequent error-recovery, we indicate that
2302 there should have been a default argument. */
2303 TREE_PURPOSE (parm
) = error_mark_node
;
2308 if (TREE_CODE (decl
) != TYPE_DECL
|| is_partial
|| !is_primary
)
2309 /* For an ordinary class template, default template arguments are
2310 allowed at the innermost level, e.g.:
2311 template <class T = int>
2313 but, in a partial specialization, they're not allowed even
2314 there, as we have in [temp.class.spec]:
2316 The template parameter list of a specialization shall not
2317 contain default template argument values.
2319 So, for a partial specialization, or for a function template,
2320 we look at all of them. */
2323 /* But, for a primary class template that is not a partial
2324 specialization we look at all template parameters except the
2326 parms
= TREE_CHAIN (parms
);
2328 /* Figure out what error message to issue. */
2329 if (TREE_CODE (decl
) == FUNCTION_DECL
)
2330 msg
= "default argument for template parameter in function template `%D'";
2331 else if (is_partial
)
2332 msg
= "default argument in partial specialization `%D'";
2334 msg
= "default argument for template parameter for class enclosing `%D'";
2336 if (current_class_type
&& TYPE_BEING_DEFINED (current_class_type
))
2337 /* If we're inside a class definition, there's no need to
2338 examine the parameters to the class itself. On the one
2339 hand, they will be checked when the class is defined, and,
2340 on the other, default arguments are legal in things like:
2341 template <class T = double>
2342 struct S { template <class U> void f(U); };
2343 Here the default argument for `S' has no bearing on the
2344 declaration of `f'. */
2345 last_level_to_check
= template_class_depth (current_class_type
) + 1;
2347 /* Check everything. */
2348 last_level_to_check
= 0;
2350 for (parm_level
= parms
;
2351 parm_level
&& TMPL_PARMS_DEPTH (parm_level
) >= last_level_to_check
;
2352 parm_level
= TREE_CHAIN (parm_level
))
2354 tree inner_parms
= TREE_VALUE (parm_level
);
2358 ntparms
= TREE_VEC_LENGTH (inner_parms
);
2359 for (i
= 0; i
< ntparms
; ++i
)
2360 if (TREE_PURPOSE (TREE_VEC_ELT (inner_parms
, i
)))
2364 cp_error (msg
, decl
);
2368 /* Clear out the default argument so that we are not
2370 TREE_PURPOSE (TREE_VEC_ELT (inner_parms
, i
)) = NULL_TREE
;
2373 /* At this point, if we're still interested in issuing messages,
2374 they must apply to classes surrounding the object declared. */
2376 msg
= "default argument for template parameter for class enclosing `%D'";
2380 /* Creates a TEMPLATE_DECL for the indicated DECL using the template
2381 parameters given by current_template_args, or reuses a
2382 previously existing one, if appropriate. Returns the DECL, or an
2383 equivalent one, if it is replaced via a call to duplicate_decls.
2385 If IS_FRIEND is non-zero, DECL is a friend declaration. */
2388 push_template_decl_real (decl
, is_friend
)
2398 int new_template_p
= 0;
2400 /* See if this is a partial specialization. */
2401 is_partial
= (DECL_IMPLICIT_TYPEDEF_P (decl
)
2402 && TREE_CODE (TREE_TYPE (decl
)) != ENUMERAL_TYPE
2403 && CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_TYPE (decl
)));
2405 is_friend
|= (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_FRIEND_P (decl
));
2408 /* For a friend, we want the context of the friend function, not
2409 the type of which it is a friend. */
2410 ctx
= DECL_CONTEXT (decl
);
2411 else if (CP_DECL_CONTEXT (decl
)
2412 && TREE_CODE (CP_DECL_CONTEXT (decl
)) != NAMESPACE_DECL
)
2413 /* In the case of a virtual function, we want the class in which
2415 ctx
= CP_DECL_CONTEXT (decl
);
2417 /* Otherwise, if we're currently definining some class, the DECL
2418 is assumed to be a member of the class. */
2419 ctx
= current_scope ();
2421 if (ctx
&& TREE_CODE (ctx
) == NAMESPACE_DECL
)
2424 if (!DECL_CONTEXT (decl
))
2425 DECL_CONTEXT (decl
) = FROB_CONTEXT (current_namespace
);
2427 /* See if this is a primary template. */
2428 primary
= template_parm_scope_p ();
2432 if (current_lang_name
== lang_name_c
)
2433 cp_error ("template with C linkage");
2434 else if (TREE_CODE (decl
) == TYPE_DECL
2435 && ANON_AGGRNAME_P (DECL_NAME (decl
)))
2436 cp_error ("template class without a name");
2437 else if ((DECL_IMPLICIT_TYPEDEF_P (decl
)
2438 && CLASS_TYPE_P (TREE_TYPE (decl
)))
2439 || (TREE_CODE (decl
) == VAR_DECL
&& ctx
&& CLASS_TYPE_P (ctx
))
2440 || TREE_CODE (decl
) == FUNCTION_DECL
)
2443 cp_error ("template declaration of `%#D'", decl
);
2446 /* Check to see that the rules regarding the use of default
2447 arguments are not being violated. */
2448 check_default_tmpl_args (decl
, current_template_parms
,
2449 primary
, is_partial
);
2452 return process_partial_specialization (decl
);
2454 args
= current_template_args ();
2457 || TREE_CODE (ctx
) == FUNCTION_DECL
2458 || TYPE_BEING_DEFINED (ctx
)
2459 || (is_friend
&& !DECL_TEMPLATE_INFO (decl
)))
2461 if (DECL_LANG_SPECIFIC (decl
)
2462 && DECL_TEMPLATE_INFO (decl
)
2463 && DECL_TI_TEMPLATE (decl
))
2464 tmpl
= DECL_TI_TEMPLATE (decl
);
2465 /* If DECL is a TYPE_DECL for a class-template, then there won't
2466 be DECL_LANG_SPECIFIC. The information equivalent to
2467 DECL_TEMPLATE_INFO is found in TYPE_TEMPLATE_INFO instead. */
2468 else if (DECL_IMPLICIT_TYPEDEF_P (decl
)
2469 && TYPE_TEMPLATE_INFO (TREE_TYPE (decl
))
2470 && TYPE_TI_TEMPLATE (TREE_TYPE (decl
)))
2472 /* Since a template declaration already existed for this
2473 class-type, we must be redeclaring it here. Make sure
2474 that the redeclaration is legal. */
2475 redeclare_class_template (TREE_TYPE (decl
),
2476 current_template_parms
);
2477 /* We don't need to create a new TEMPLATE_DECL; just use the
2478 one we already had. */
2479 tmpl
= TYPE_TI_TEMPLATE (TREE_TYPE (decl
));
2483 tmpl
= build_template_decl (decl
, current_template_parms
);
2486 if (DECL_LANG_SPECIFIC (decl
)
2487 && DECL_TEMPLATE_SPECIALIZATION (decl
))
2489 /* A specialization of a member template of a template
2491 SET_DECL_TEMPLATE_SPECIALIZATION (tmpl
);
2492 DECL_TEMPLATE_INFO (tmpl
) = DECL_TEMPLATE_INFO (decl
);
2493 DECL_TEMPLATE_INFO (decl
) = NULL_TREE
;
2499 tree a
, t
, current
, parms
;
2502 if (TREE_CODE (decl
) == TYPE_DECL
)
2504 if ((IS_AGGR_TYPE_CODE (TREE_CODE (TREE_TYPE (decl
)))
2505 || TREE_CODE (TREE_TYPE (decl
)) == ENUMERAL_TYPE
)
2506 && TYPE_TEMPLATE_INFO (TREE_TYPE (decl
))
2507 && TYPE_TI_TEMPLATE (TREE_TYPE (decl
)))
2508 tmpl
= TYPE_TI_TEMPLATE (TREE_TYPE (decl
));
2511 cp_error ("`%D' does not declare a template type", decl
);
2515 else if (! DECL_TEMPLATE_INFO (decl
))
2517 cp_error ("template definition of non-template `%#D'", decl
);
2521 tmpl
= DECL_TI_TEMPLATE (decl
);
2523 if (is_member_template (tmpl
)
2524 && DECL_FUNCTION_TEMPLATE_P (tmpl
)
2525 && DECL_TEMPLATE_INFO (decl
) && DECL_TI_ARGS (decl
)
2526 && DECL_TEMPLATE_SPECIALIZATION (decl
))
2530 /* The declaration is a specialization of a member
2531 template, declared outside the class. Therefore, the
2532 innermost template arguments will be NULL, so we
2533 replace them with the arguments determined by the
2534 earlier call to check_explicit_specialization. */
2535 args
= DECL_TI_ARGS (decl
);
2538 = build_template_decl (decl
, current_template_parms
);
2539 DECL_TEMPLATE_RESULT (new_tmpl
) = decl
;
2540 TREE_TYPE (new_tmpl
) = TREE_TYPE (decl
);
2541 DECL_TI_TEMPLATE (decl
) = new_tmpl
;
2542 SET_DECL_TEMPLATE_SPECIALIZATION (new_tmpl
);
2543 DECL_TEMPLATE_INFO (new_tmpl
)
2544 = tree_cons (tmpl
, args
, NULL_TREE
);
2546 register_specialization (new_tmpl
,
2547 most_general_template (tmpl
),
2552 /* Make sure the template headers we got make sense. */
2554 parms
= DECL_TEMPLATE_PARMS (tmpl
);
2555 i
= TMPL_PARMS_DEPTH (parms
);
2556 if (TMPL_ARGS_DEPTH (args
) != i
)
2558 cp_error ("expected %d levels of template parms for `%#D', got %d",
2559 i
, decl
, TMPL_ARGS_DEPTH (args
));
2562 for (current
= decl
; i
> 0; --i
, parms
= TREE_CHAIN (parms
))
2564 a
= TMPL_ARGS_LEVEL (args
, i
);
2565 t
= INNERMOST_TEMPLATE_PARMS (parms
);
2567 if (TREE_VEC_LENGTH (t
) != TREE_VEC_LENGTH (a
))
2569 if (current
== decl
)
2570 cp_error ("got %d template parameters for `%#D'",
2571 TREE_VEC_LENGTH (a
), decl
);
2573 cp_error ("got %d template parameters for `%#T'",
2574 TREE_VEC_LENGTH (a
), current
);
2575 cp_error (" but %d required", TREE_VEC_LENGTH (t
));
2578 /* Perhaps we should also check that the parms are used in the
2579 appropriate qualifying scopes in the declarator? */
2581 if (current
== decl
)
2584 current
= TYPE_CONTEXT (current
);
2588 DECL_TEMPLATE_RESULT (tmpl
) = decl
;
2589 TREE_TYPE (tmpl
) = TREE_TYPE (decl
);
2591 /* Push template declarations for global functions and types. Note
2592 that we do not try to push a global template friend declared in a
2593 template class; such a thing may well depend on the template
2594 parameters of the class. */
2595 if (new_template_p
&& !ctx
2596 && !(is_friend
&& template_class_depth (current_class_type
) > 0))
2597 tmpl
= pushdecl_namespace_level (tmpl
);
2600 DECL_PRIMARY_TEMPLATE (tmpl
) = tmpl
;
2602 info
= tree_cons (tmpl
, args
, NULL_TREE
);
2604 if (DECL_IMPLICIT_TYPEDEF_P (decl
))
2606 SET_TYPE_TEMPLATE_INFO (TREE_TYPE (tmpl
), info
);
2607 if ((!ctx
|| TREE_CODE (ctx
) != FUNCTION_DECL
)
2608 && TREE_CODE (TREE_TYPE (decl
)) != ENUMERAL_TYPE
)
2609 DECL_NAME (decl
) = classtype_mangled_name (TREE_TYPE (decl
));
2611 else if (DECL_LANG_SPECIFIC (decl
))
2612 DECL_TEMPLATE_INFO (decl
) = info
;
2614 return DECL_TEMPLATE_RESULT (tmpl
);
2618 push_template_decl (decl
)
2621 return push_template_decl_real (decl
, 0);
2624 /* Called when a class template TYPE is redeclared with the indicated
2625 template PARMS, e.g.:
2627 template <class T> struct S;
2628 template <class T> struct S {}; */
2631 redeclare_class_template (type
, parms
)
2639 if (!TYPE_TEMPLATE_INFO (type
))
2641 cp_error ("`%T' is not a template type", type
);
2645 tmpl
= TYPE_TI_TEMPLATE (type
);
2646 if (!PRIMARY_TEMPLATE_P (tmpl
))
2647 /* The type is nested in some template class. Nothing to worry
2648 about here; there are no new template parameters for the nested
2652 parms
= INNERMOST_TEMPLATE_PARMS (parms
);
2653 tmpl_parms
= DECL_INNERMOST_TEMPLATE_PARMS (tmpl
);
2655 if (TREE_VEC_LENGTH (parms
) != TREE_VEC_LENGTH (tmpl_parms
))
2657 cp_error_at ("previous declaration `%D'", tmpl
);
2658 cp_error ("used %d template parameter%s instead of %d",
2659 TREE_VEC_LENGTH (tmpl_parms
),
2660 TREE_VEC_LENGTH (tmpl_parms
) == 1 ? "" : "s",
2661 TREE_VEC_LENGTH (parms
));
2665 for (i
= 0; i
< TREE_VEC_LENGTH (tmpl_parms
); ++i
)
2667 tree tmpl_parm
= TREE_VALUE (TREE_VEC_ELT (tmpl_parms
, i
));
2668 tree parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
2669 tree tmpl_default
= TREE_PURPOSE (TREE_VEC_ELT (tmpl_parms
, i
));
2670 tree parm_default
= TREE_PURPOSE (TREE_VEC_ELT (parms
, i
));
2672 if (TREE_CODE (tmpl_parm
) != TREE_CODE (parm
))
2674 cp_error_at ("template parameter `%#D'", tmpl_parm
);
2675 cp_error ("redeclared here as `%#D'", parm
);
2679 if (tmpl_default
!= NULL_TREE
&& parm_default
!= NULL_TREE
)
2681 /* We have in [temp.param]:
2683 A template-parameter may not be given default arguments
2684 by two different declarations in the same scope. */
2685 cp_error ("redefinition of default argument for `%#D'", parm
);
2686 cp_error_at (" original definition appeared here", tmpl_parm
);
2690 if (parm_default
!= NULL_TREE
)
2691 /* Update the previous template parameters (which are the ones
2692 that will really count) with the new default value. */
2693 TREE_PURPOSE (TREE_VEC_ELT (tmpl_parms
, i
)) = parm_default
;
2694 else if (tmpl_default
!= NULL_TREE
)
2695 /* Update the new parameters, too; they'll be used as the
2696 parameters for any members. */
2697 TREE_PURPOSE (TREE_VEC_ELT (parms
, i
)) = tmpl_default
;
2701 /* Attempt to convert the non-type template parameter EXPR to the
2702 indicated TYPE. If the conversion is successful, return the
2703 converted value. If the conversion is unsuccesful, return
2704 NULL_TREE if we issued an error message, or error_mark_node if we
2705 did not. We issue error messages for out-and-out bad template
2706 parameters, but not simply because the conversion failed, since we
2707 might be just trying to do argument deduction. By the time this
2708 function is called, neither TYPE nor EXPR may make use of template
2712 convert_nontype_argument (type
, expr
)
2716 tree expr_type
= TREE_TYPE (expr
);
2718 /* A template-argument for a non-type, non-template
2719 template-parameter shall be one of:
2721 --an integral constant-expression of integral or enumeration
2724 --the name of a non-type template-parameter; or
2726 --the name of an object or function with external linkage,
2727 including function templates and function template-ids but
2728 excluding non-static class members, expressed as id-expression;
2731 --the address of an object or function with external linkage,
2732 including function templates and function template-ids but
2733 excluding non-static class members, expressed as & id-expression
2734 where the & is optional if the name refers to a function or
2737 --a pointer to member expressed as described in _expr.unary.op_. */
2739 /* An integral constant-expression can include const variables or
2740 enumerators. Simplify things by folding them to their values,
2741 unless we're about to bind the declaration to a reference
2743 if (INTEGRAL_TYPE_P (expr_type
)
2744 && TREE_CODE (type
) != REFERENCE_TYPE
)
2745 expr
= decl_constant_value (expr
);
2747 if (is_overloaded_fn (expr
))
2748 /* OK for now. We'll check that it has external linkage later.
2749 Check this first since if expr_type is the unknown_type_node
2750 we would otherwise complain below. */
2752 else if (TYPE_PTRMEM_P (expr_type
)
2753 || TYPE_PTRMEMFUNC_P (expr_type
))
2755 if (TREE_CODE (expr
) != PTRMEM_CST
)
2758 else if (TYPE_PTR_P (expr_type
)
2759 || TYPE_PTRMEM_P (expr_type
)
2760 || TREE_CODE (expr_type
) == ARRAY_TYPE
2761 || TREE_CODE (type
) == REFERENCE_TYPE
2762 /* If expr is the address of an overloaded function, we
2763 will get the unknown_type_node at this point. */
2764 || expr_type
== unknown_type_node
)
2770 if (TREE_CODE (expr_type
) == ARRAY_TYPE
2771 || (TREE_CODE (type
) == REFERENCE_TYPE
2772 && TREE_CODE (e
) != ADDR_EXPR
))
2776 if (TREE_CODE (e
) != ADDR_EXPR
)
2779 cp_error ("`%E' is not a valid template argument", expr
);
2780 if (TYPE_PTR_P (expr_type
))
2782 if (TREE_CODE (TREE_TYPE (expr_type
)) == FUNCTION_TYPE
)
2783 cp_error ("it must be the address of a function with external linkage");
2785 cp_error ("it must be the address of an object with external linkage");
2787 else if (TYPE_PTRMEM_P (expr_type
)
2788 || TYPE_PTRMEMFUNC_P (expr_type
))
2789 cp_error ("it must be a pointer-to-member of the form `&X::Y'");
2794 referent
= TREE_OPERAND (e
, 0);
2795 STRIP_NOPS (referent
);
2798 if (TREE_CODE (referent
) == STRING_CST
)
2800 cp_error ("string literal %E is not a valid template argument because it is the address of an object with static linkage",
2805 if (is_overloaded_fn (referent
))
2806 /* We'll check that it has external linkage later. */
2808 else if (TREE_CODE (referent
) != VAR_DECL
)
2810 else if (!TREE_PUBLIC (referent
))
2812 cp_error ("address of non-extern `%E' cannot be used as template argument", referent
);
2813 return error_mark_node
;
2816 else if (INTEGRAL_TYPE_P (expr_type
)
2817 || TYPE_PTRMEM_P (expr_type
)
2818 || TYPE_PTRMEMFUNC_P (expr_type
)
2819 /* The next two are g++ extensions. */
2820 || TREE_CODE (expr_type
) == REAL_TYPE
2821 || TREE_CODE (expr_type
) == COMPLEX_TYPE
)
2823 if (! TREE_CONSTANT (expr
))
2826 cp_error ("non-constant `%E' cannot be used as template argument",
2833 cp_error ("object `%E' cannot be used as template argument", expr
);
2837 switch (TREE_CODE (type
))
2842 /* For a non-type template-parameter of integral or enumeration
2843 type, integral promotions (_conv.prom_) and integral
2844 conversions (_conv.integral_) are applied. */
2845 if (!INTEGRAL_TYPE_P (expr_type
))
2846 return error_mark_node
;
2848 /* It's safe to call digest_init in this case; we know we're
2849 just converting one integral constant expression to another. */
2850 expr
= digest_init (type
, expr
, (tree
*) 0);
2852 if (TREE_CODE (expr
) != INTEGER_CST
)
2853 /* Curiously, some TREE_CONSTANT integral expressions do not
2854 simplify to integer constants. For example, `3 % 0',
2855 remains a TRUNC_MOD_EXPR. */
2862 /* These are g++ extensions. */
2863 if (TREE_CODE (expr_type
) != TREE_CODE (type
))
2864 return error_mark_node
;
2866 expr
= digest_init (type
, expr
, (tree
*) 0);
2868 if (TREE_CODE (expr
) != REAL_CST
)
2875 tree type_pointed_to
= TREE_TYPE (type
);
2877 if (TYPE_PTRMEM_P (type
))
2881 /* For a non-type template-parameter of type pointer to data
2882 member, qualification conversions (_conv.qual_) are
2884 e
= perform_qualification_conversions (type
, expr
);
2885 if (TREE_CODE (e
) == NOP_EXPR
)
2886 /* The call to perform_qualification_conversions will
2887 insert a NOP_EXPR over EXPR to do express conversion,
2888 if necessary. But, that will confuse us if we use
2889 this (converted) template parameter to instantiate
2890 another template; then the thing will not look like a
2891 valid template argument. So, just make a new
2892 constant, of the appropriate type. */
2893 e
= make_ptrmem_cst (type
, PTRMEM_CST_MEMBER (expr
));
2896 else if (TREE_CODE (type_pointed_to
) == FUNCTION_TYPE
)
2898 /* For a non-type template-parameter of type pointer to
2899 function, only the function-to-pointer conversion
2900 (_conv.func_) is applied. If the template-argument
2901 represents a set of overloaded functions (or a pointer to
2902 such), the matching function is selected from the set
2907 if (TREE_CODE (expr
) == ADDR_EXPR
)
2908 fns
= TREE_OPERAND (expr
, 0);
2912 fn
= instantiate_type (type_pointed_to
, fns
, 0);
2914 if (fn
== error_mark_node
)
2915 return error_mark_node
;
2917 if (!TREE_PUBLIC (fn
))
2919 if (really_overloaded_fn (fns
))
2920 return error_mark_node
;
2925 expr
= build_unary_op (ADDR_EXPR
, fn
, 0);
2927 my_friendly_assert (same_type_p (type
, TREE_TYPE (expr
)),
2933 /* For a non-type template-parameter of type pointer to
2934 object, qualification conversions (_conv.qual_) and the
2935 array-to-pointer conversion (_conv.array_) are applied.
2936 [Note: In particular, neither the null pointer conversion
2937 (_conv.ptr_) nor the derived-to-base conversion
2938 (_conv.ptr_) are applied. Although 0 is a valid
2939 template-argument for a non-type template-parameter of
2940 integral type, it is not a valid template-argument for a
2941 non-type template-parameter of pointer type.]
2943 The call to decay_conversion performs the
2944 array-to-pointer conversion, if appropriate. */
2945 expr
= decay_conversion (expr
);
2947 if (expr
== error_mark_node
)
2948 return error_mark_node
;
2950 return perform_qualification_conversions (type
, expr
);
2955 case REFERENCE_TYPE
:
2957 tree type_referred_to
= TREE_TYPE (type
);
2959 /* If this expression already has reference type, get the
2960 underling object. */
2961 if (TREE_CODE (expr_type
) == REFERENCE_TYPE
)
2963 my_friendly_assert (TREE_CODE (expr
) == ADDR_EXPR
, 20000604);
2964 expr
= TREE_OPERAND (expr
, 0);
2965 expr_type
= TREE_TYPE (expr
);
2968 if (TREE_CODE (type_referred_to
) == FUNCTION_TYPE
)
2970 /* For a non-type template-parameter of type reference to
2971 function, no conversions apply. If the
2972 template-argument represents a set of overloaded
2973 functions, the matching function is selected from the
2974 set (_over.over_). */
2977 fn
= instantiate_type (type_referred_to
, expr
, 0);
2979 if (fn
== error_mark_node
)
2980 return error_mark_node
;
2982 if (!TREE_PUBLIC (fn
))
2984 if (really_overloaded_fn (expr
))
2985 /* Don't issue an error here; we might get a different
2986 function if the overloading had worked out
2988 return error_mark_node
;
2993 my_friendly_assert (same_type_p (type_referred_to
,
3001 /* For a non-type template-parameter of type reference to
3002 object, no conversions apply. The type referred to by the
3003 reference may be more cv-qualified than the (otherwise
3004 identical) type of the template-argument. The
3005 template-parameter is bound directly to the
3006 template-argument, which must be an lvalue. */
3007 if (!same_type_p (TYPE_MAIN_VARIANT (expr_type
),
3008 TYPE_MAIN_VARIANT (type_referred_to
))
3009 || !at_least_as_qualified_p (type_referred_to
,
3011 || !real_lvalue_p (expr
))
3012 return error_mark_node
;
3015 mark_addressable (expr
);
3016 return build1 (ADDR_EXPR
, type
, expr
);
3022 if (!TYPE_PTRMEMFUNC_P (type
))
3023 /* This handles templates like
3024 template<class T, T t> void f();
3025 when T is substituted with any class. The second template
3026 parameter becomes invalid and the template candidate is
3028 return error_mark_node
;
3030 /* For a non-type template-parameter of type pointer to member
3031 function, no conversions apply. If the template-argument
3032 represents a set of overloaded member functions, the
3033 matching member function is selected from the set
3036 if (!TYPE_PTRMEMFUNC_P (expr_type
) &&
3037 expr_type
!= unknown_type_node
)
3038 return error_mark_node
;
3040 if (TREE_CODE (expr
) == PTRMEM_CST
)
3042 /* A ptr-to-member constant. */
3043 if (!same_type_p (type
, expr_type
))
3044 return error_mark_node
;
3049 if (TREE_CODE (expr
) != ADDR_EXPR
)
3050 return error_mark_node
;
3052 expr
= instantiate_type (type
, expr
, 0);
3054 if (expr
== error_mark_node
)
3055 return error_mark_node
;
3057 my_friendly_assert (same_type_p (type
, TREE_TYPE (expr
)),
3064 /* All non-type parameters must have one of these types. */
3065 my_friendly_abort (0);
3069 return error_mark_node
;
3072 /* Return 1 if PARM_PARMS and ARG_PARMS matches using rule for
3073 template template parameters. Both PARM_PARMS and ARG_PARMS are
3074 vectors of TREE_LIST nodes containing TYPE_DECL, TEMPLATE_DECL
3077 ARG_PARMS may contain more parameters than PARM_PARMS. If this is
3078 the case, then extra parameters must have default arguments.
3080 Consider the example:
3081 template <class T, class Allocator = allocator> class vector;
3082 template<template <class U> class TT> class C;
3084 C<vector> is a valid instantiation. PARM_PARMS for the above code
3085 contains a TYPE_DECL (for U), ARG_PARMS contains two TYPE_DECLs (for
3086 T and Allocator) and OUTER_ARGS contains the argument that is used to
3087 substitute the TT parameter. */
3090 coerce_template_template_parms (parm_parms
, arg_parms
, complain
,
3091 in_decl
, outer_args
)
3092 tree parm_parms
, arg_parms
;
3094 tree in_decl
, outer_args
;
3096 int nparms
, nargs
, i
;
3099 my_friendly_assert (TREE_CODE (parm_parms
) == TREE_VEC
, 0);
3100 my_friendly_assert (TREE_CODE (arg_parms
) == TREE_VEC
, 0);
3102 nparms
= TREE_VEC_LENGTH (parm_parms
);
3103 nargs
= TREE_VEC_LENGTH (arg_parms
);
3105 /* The rule here is opposite of coerce_template_parms. */
3108 && TREE_PURPOSE (TREE_VEC_ELT (arg_parms
, nparms
)) == NULL_TREE
))
3111 for (i
= 0; i
< nparms
; ++i
)
3113 parm
= TREE_VALUE (TREE_VEC_ELT (parm_parms
, i
));
3114 arg
= TREE_VALUE (TREE_VEC_ELT (arg_parms
, i
));
3116 if (arg
== NULL_TREE
|| arg
== error_mark_node
3117 || parm
== NULL_TREE
|| parm
== error_mark_node
)
3120 if (TREE_CODE (arg
) != TREE_CODE (parm
))
3123 switch (TREE_CODE (parm
))
3129 /* We encounter instantiations of templates like
3130 template <template <template <class> class> class TT>
3133 tree parmparm
= DECL_INNERMOST_TEMPLATE_PARMS (parm
);
3134 tree argparm
= DECL_INNERMOST_TEMPLATE_PARMS (arg
);
3136 if (!coerce_template_template_parms (parmparm
, argparm
,
3144 /* The tsubst call is used to handle cases such as
3145 template <class T, template <T> class TT> class D;
3146 i.e. the parameter list of TT depends on earlier parameters. */
3147 if (!same_type_p (tsubst (TREE_TYPE (parm
), outer_args
,
3154 my_friendly_abort (0);
3160 /* Convert the indicated template ARG as necessary to match the
3161 indicated template PARM. Returns the converted ARG, or
3162 error_mark_node if the conversion was unsuccessful. Error messages
3163 are issued if COMPLAIN is non-zero. This conversion is for the Ith
3164 parameter in the parameter list. ARGS is the full set of template
3165 arguments deduced so far. */
3168 convert_template_argument (parm
, arg
, args
, complain
, i
, in_decl
)
3178 int is_type
, requires_type
, is_tmpl_type
, requires_tmpl_type
;
3180 inner_args
= INNERMOST_TEMPLATE_ARGS (args
);
3182 if (TREE_CODE (arg
) == TREE_LIST
3183 && TREE_TYPE (arg
) != NULL_TREE
3184 && TREE_CODE (TREE_TYPE (arg
)) == OFFSET_TYPE
)
3186 /* The template argument was the name of some
3187 member function. That's usually
3188 illegal, but static members are OK. In any
3189 case, grab the underlying fields/functions
3190 and issue an error later if required. */
3191 arg
= TREE_VALUE (arg
);
3192 TREE_TYPE (arg
) = unknown_type_node
;
3195 requires_tmpl_type
= TREE_CODE (parm
) == TEMPLATE_DECL
;
3196 requires_type
= (TREE_CODE (parm
) == TYPE_DECL
3197 || requires_tmpl_type
);
3199 /* Check if it is a class template. If REQUIRES_TMPL_TYPE is true,
3200 we also accept implicitly created TYPE_DECL as a valid argument.
3201 This is necessary to handle the case where we pass a template name
3202 to a template template parameter in a scope where we've derived from
3203 in instantiation of that template, so the template name refers to that
3204 instantiation. We really ought to handle this better. */
3206 = ((TREE_CODE (arg
) == TEMPLATE_DECL
3207 && TREE_CODE (DECL_TEMPLATE_RESULT (arg
)) == TYPE_DECL
)
3208 || (TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
3209 && !TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (arg
))
3210 || (TREE_CODE (arg
) == RECORD_TYPE
3211 && CLASSTYPE_TEMPLATE_INFO (arg
)
3212 && TREE_CODE (TYPE_NAME (arg
)) == TYPE_DECL
3213 && DECL_ARTIFICIAL (TYPE_NAME (arg
))
3214 && requires_tmpl_type
3215 && is_base_of_enclosing_class (arg
, current_class_type
)));
3216 if (is_tmpl_type
&& TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
)
3217 arg
= TYPE_STUB_DECL (arg
);
3218 else if (is_tmpl_type
&& TREE_CODE (arg
) == RECORD_TYPE
)
3219 arg
= CLASSTYPE_TI_TEMPLATE (arg
);
3221 is_type
= TYPE_P (arg
) || is_tmpl_type
;
3223 if (requires_type
&& ! is_type
&& TREE_CODE (arg
) == SCOPE_REF
3224 && TREE_CODE (TREE_OPERAND (arg
, 0)) == TEMPLATE_TYPE_PARM
)
3226 cp_pedwarn ("to refer to a type member of a template parameter, use `typename %E'", arg
);
3228 arg
= make_typename_type (TREE_OPERAND (arg
, 0),
3229 TREE_OPERAND (arg
, 1),
3233 if (is_type
!= requires_type
)
3239 cp_error ("type/value mismatch at argument %d in template parameter list for `%D'",
3242 cp_error (" expected a constant of type `%T', got `%T'",
3244 (is_tmpl_type
? DECL_NAME (arg
) : arg
));
3246 cp_error (" expected a type, got `%E'", arg
);
3249 return error_mark_node
;
3251 if (is_tmpl_type
^ requires_tmpl_type
)
3253 if (in_decl
&& complain
)
3255 cp_error ("type/value mismatch at argument %d in template parameter list for `%D'",
3258 cp_error (" expected a type, got `%T'", DECL_NAME (arg
));
3260 cp_error (" expected a class template, got `%T'", arg
);
3262 return error_mark_node
;
3267 if (requires_tmpl_type
)
3269 tree parmparm
= DECL_INNERMOST_TEMPLATE_PARMS (parm
);
3270 tree argparm
= DECL_INNERMOST_TEMPLATE_PARMS (arg
);
3272 if (coerce_template_template_parms (parmparm
, argparm
, complain
,
3273 in_decl
, inner_args
))
3277 /* TEMPLATE_TEMPLATE_PARM node is preferred over
3279 if (val
!= error_mark_node
3280 && DECL_TEMPLATE_TEMPLATE_PARM_P (val
))
3281 val
= TREE_TYPE (val
);
3285 if (in_decl
&& complain
)
3287 cp_error ("type/value mismatch at argument %d in template parameter list for `%D'",
3289 cp_error (" expected a template of type `%D', got `%D'", parm
, arg
);
3292 val
= error_mark_node
;
3297 val
= groktypename (arg
);
3298 if (! processing_template_decl
)
3300 /* [basic.link]: A name with no linkage (notably, the
3301 name of a class or enumeration declared in a local
3302 scope) shall not be used to declare an entity with
3303 linkage. This implies that names with no linkage
3304 cannot be used as template arguments. */
3305 tree t
= no_linkage_check (val
);
3308 if (ANON_AGGRNAME_P (TYPE_IDENTIFIER (t
)))
3310 ("template-argument `%T' uses anonymous type", val
);
3313 ("template-argument `%T' uses local type `%T'",
3315 return error_mark_node
;
3322 tree t
= tsubst (TREE_TYPE (parm
), args
, complain
, in_decl
);
3324 if (processing_template_decl
)
3325 arg
= maybe_fold_nontype_arg (arg
);
3327 if (!uses_template_parms (arg
) && !uses_template_parms (t
))
3328 /* We used to call digest_init here. However, digest_init
3329 will report errors, which we don't want when complain
3330 is zero. More importantly, digest_init will try too
3331 hard to convert things: for example, `0' should not be
3332 converted to pointer type at this point according to
3333 the standard. Accepting this is not merely an
3334 extension, since deciding whether or not these
3335 conversions can occur is part of determining which
3336 function template to call, or whether a given epxlicit
3337 argument specification is legal. */
3338 val
= convert_nontype_argument (t
, arg
);
3342 if (val
== NULL_TREE
)
3343 val
= error_mark_node
;
3344 else if (val
== error_mark_node
&& complain
)
3345 cp_error ("could not convert template argument `%E' to `%T'",
3352 /* Convert all template arguments to their appropriate types, and
3353 return a vector containing the innermost resulting template
3354 arguments. If any error occurs, return error_mark_node, and, if
3355 COMPLAIN is non-zero, issue an error message. Some error messages
3356 are issued even if COMPLAIN is zero; for instance, if a template
3357 argument is composed from a local class.
3359 If REQUIRE_ALL_ARGUMENTS is non-zero, all arguments must be
3360 provided in ARGLIST, or else trailing parameters must have default
3361 values. If REQUIRE_ALL_ARGUMENTS is zero, we will attempt argument
3362 deduction for any unspecified trailing arguments. */
3365 coerce_template_parms (parms
, args
, in_decl
,
3367 require_all_arguments
)
3371 int require_all_arguments
;
3373 int nparms
, nargs
, i
, lost
= 0;
3376 tree new_inner_args
;
3378 inner_args
= INNERMOST_TEMPLATE_ARGS (args
);
3379 nargs
= NUM_TMPL_ARGS (inner_args
);
3380 nparms
= TREE_VEC_LENGTH (parms
);
3384 && require_all_arguments
3385 && TREE_PURPOSE (TREE_VEC_ELT (parms
, nargs
)) == NULL_TREE
))
3389 cp_error ("wrong number of template arguments (%d, should be %d)",
3393 cp_error_at ("provided for `%D'", in_decl
);
3396 return error_mark_node
;
3399 new_inner_args
= make_tree_vec (nparms
);
3400 new_args
= add_outermost_template_args (args
, new_inner_args
);
3401 for (i
= 0; i
< nparms
; i
++)
3406 /* Get the Ith template parameter. */
3407 parm
= TREE_VEC_ELT (parms
, i
);
3409 /* Calculate the Ith argument. */
3410 if (inner_args
&& TREE_CODE (inner_args
) == TREE_LIST
)
3412 arg
= TREE_VALUE (inner_args
);
3413 inner_args
= TREE_CHAIN (inner_args
);
3416 arg
= TREE_VEC_ELT (inner_args
, i
);
3417 /* If no template argument was supplied, look for a default
3419 else if (TREE_PURPOSE (parm
) == NULL_TREE
)
3421 /* There was no default value. */
3422 my_friendly_assert (!require_all_arguments
, 0);
3425 else if (TREE_CODE (TREE_VALUE (parm
)) == TYPE_DECL
)
3426 arg
= tsubst (TREE_PURPOSE (parm
), new_args
, complain
, in_decl
);
3428 arg
= tsubst_expr (TREE_PURPOSE (parm
), new_args
, complain
,
3431 /* Now, convert the Ith argument, as necessary. */
3432 if (arg
== NULL_TREE
)
3433 /* We're out of arguments. */
3435 my_friendly_assert (!require_all_arguments
, 0);
3438 else if (arg
== error_mark_node
)
3440 cp_error ("template argument %d is invalid", i
+ 1);
3441 arg
= error_mark_node
;
3444 arg
= convert_template_argument (TREE_VALUE (parm
),
3445 arg
, new_args
, complain
, i
,
3448 if (arg
== error_mark_node
)
3450 TREE_VEC_ELT (new_inner_args
, i
) = arg
;
3454 return error_mark_node
;
3456 return new_inner_args
;
3459 /* Returns 1 if template args OT and NT are equivalent. */
3462 template_args_equal (ot
, nt
)
3467 if (TREE_CODE (nt
) != TREE_CODE (ot
))
3469 if (TREE_CODE (nt
) == TREE_VEC
)
3470 /* For member templates */
3471 return comp_template_args (ot
, nt
);
3472 else if (TYPE_P (ot
))
3473 return same_type_p (ot
, nt
);
3475 return (cp_tree_equal (ot
, nt
) > 0);
3478 /* Returns 1 iff the OLDARGS and NEWARGS are in fact identical sets
3479 of template arguments. Returns 0 otherwise. */
3482 comp_template_args (oldargs
, newargs
)
3483 tree oldargs
, newargs
;
3487 if (TREE_VEC_LENGTH (oldargs
) != TREE_VEC_LENGTH (newargs
))
3490 for (i
= 0; i
< TREE_VEC_LENGTH (oldargs
); ++i
)
3492 tree nt
= TREE_VEC_ELT (newargs
, i
);
3493 tree ot
= TREE_VEC_ELT (oldargs
, i
);
3495 if (! template_args_equal (ot
, nt
))
3501 /* Given class template name and parameter list, produce a user-friendly name
3502 for the instantiation. */
3505 mangle_class_name_for_template (name
, parms
, arglist
)
3507 tree parms
, arglist
;
3509 static struct obstack scratch_obstack
;
3510 static char *scratch_firstobj
;
3513 if (!scratch_firstobj
)
3514 gcc_obstack_init (&scratch_obstack
);
3516 obstack_free (&scratch_obstack
, scratch_firstobj
);
3517 scratch_firstobj
= obstack_alloc (&scratch_obstack
, 1);
3519 #define ccat(c) obstack_1grow (&scratch_obstack, (c));
3520 #define cat(s) obstack_grow (&scratch_obstack, (s), strlen (s))
3524 nparms
= TREE_VEC_LENGTH (parms
);
3525 arglist
= INNERMOST_TEMPLATE_ARGS (arglist
);
3526 my_friendly_assert (nparms
== TREE_VEC_LENGTH (arglist
), 268);
3527 for (i
= 0; i
< nparms
; i
++)
3529 tree parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
3530 tree arg
= TREE_VEC_ELT (arglist
, i
);
3535 if (TREE_CODE (parm
) == TYPE_DECL
)
3537 cat (type_as_string (arg
, TS_CHASE_TYPEDEFS
));
3540 else if (TREE_CODE (parm
) == TEMPLATE_DECL
)
3542 if (TREE_CODE (arg
) == TEMPLATE_DECL
)
3544 /* Already substituted with real template. Just output
3545 the template name here */
3546 tree context
= DECL_CONTEXT (arg
);
3549 /* The template may be defined in a namespace, or
3550 may be a member template. */
3551 my_friendly_assert (TREE_CODE (context
) == NAMESPACE_DECL
3552 || CLASS_TYPE_P (context
),
3554 cat(decl_as_string (DECL_CONTEXT (arg
), 0));
3557 cat (IDENTIFIER_POINTER (DECL_NAME (arg
)));
3560 /* Output the parameter declaration */
3561 cat (type_as_string (arg
, TS_CHASE_TYPEDEFS
));
3565 my_friendly_assert (TREE_CODE (parm
) == PARM_DECL
, 269);
3567 if (TREE_CODE (arg
) == TREE_LIST
)
3569 /* New list cell was built because old chain link was in
3571 my_friendly_assert (TREE_PURPOSE (arg
) == NULL_TREE
, 270);
3572 arg
= TREE_VALUE (arg
);
3574 /* No need to check arglist against parmlist here; we did that
3575 in coerce_template_parms, called from lookup_template_class. */
3576 cat (expr_as_string (arg
, 0));
3579 char *bufp
= obstack_next_free (&scratch_obstack
);
3581 while (bufp
[offset
- 1] == ' ')
3583 obstack_blank_fast (&scratch_obstack
, offset
);
3585 /* B<C<char> >, not B<C<char>> */
3586 if (bufp
[offset
- 1] == '>')
3591 return (char *) obstack_base (&scratch_obstack
);
3595 classtype_mangled_name (t
)
3598 if (CLASSTYPE_TEMPLATE_INFO (t
)
3599 /* Specializations have already had their names set up in
3600 lookup_template_class. */
3601 && !CLASSTYPE_TEMPLATE_SPECIALIZATION (t
))
3603 tree tmpl
= most_general_template (CLASSTYPE_TI_TEMPLATE (t
));
3605 /* For non-primary templates, the template parameters are
3606 implicit from their surrounding context. */
3607 if (PRIMARY_TEMPLATE_P (tmpl
))
3609 tree name
= DECL_NAME (tmpl
);
3610 char *mangled_name
= mangle_class_name_for_template
3611 (IDENTIFIER_POINTER (name
),
3612 DECL_INNERMOST_TEMPLATE_PARMS (tmpl
),
3613 CLASSTYPE_TI_ARGS (t
));
3614 tree id
= get_identifier (mangled_name
);
3615 IDENTIFIER_TEMPLATE (id
) = name
;
3620 return TYPE_IDENTIFIER (t
);
3624 add_pending_template (d
)
3627 tree ti
= (TYPE_P (d
)
3628 ? CLASSTYPE_TEMPLATE_INFO (d
)
3629 : DECL_TEMPLATE_INFO (d
));
3632 if (TI_PENDING_TEMPLATE_FLAG (ti
))
3635 /* We are called both from instantiate_decl, where we've already had a
3636 tinst_level pushed, and instantiate_template, where we haven't.
3638 level
= !(current_tinst_level
&& TINST_DECL (current_tinst_level
) == d
);
3641 push_tinst_level (d
);
3643 *template_tail
= tree_cons (current_tinst_level
, d
, NULL_TREE
);
3644 template_tail
= &TREE_CHAIN (*template_tail
);
3645 TI_PENDING_TEMPLATE_FLAG (ti
) = 1;
3652 /* Return a TEMPLATE_ID_EXPR corresponding to the indicated FNS (which
3653 may be either a _DECL or an overloaded function or an
3654 IDENTIFIER_NODE), and ARGLIST. */
3657 lookup_template_function (fns
, arglist
)
3662 if (fns
== NULL_TREE
)
3664 cp_error ("non-template used as template");
3665 return error_mark_node
;
3668 type
= TREE_TYPE (fns
);
3669 if (TREE_CODE (fns
) == OVERLOAD
|| !type
)
3670 type
= unknown_type_node
;
3672 if (processing_template_decl
)
3673 return build_min (TEMPLATE_ID_EXPR
, type
, fns
, arglist
);
3675 return build (TEMPLATE_ID_EXPR
, type
, fns
, arglist
);
3678 /* Within the scope of a template class S<T>, the name S gets bound
3679 (in build_self_reference) to a TYPE_DECL for the class, not a
3680 TEMPLATE_DECL. If DECL is a TYPE_DECL for current_class_type,
3681 or one of its enclosing classes, and that type is a template,
3682 return the associated TEMPLATE_DECL. Otherwise, the original
3683 DECL is returned. */
3686 maybe_get_template_decl_from_type_decl (decl
)
3689 return (decl
!= NULL_TREE
3690 && TREE_CODE (decl
) == TYPE_DECL
3691 && DECL_ARTIFICIAL (decl
)
3692 && CLASS_TYPE_P (TREE_TYPE (decl
))
3693 && CLASSTYPE_TEMPLATE_INFO (TREE_TYPE (decl
)))
3694 ? CLASSTYPE_TI_TEMPLATE (TREE_TYPE (decl
)) : decl
;
3697 /* Given an IDENTIFIER_NODE (type TEMPLATE_DECL) and a chain of
3698 parameters, find the desired type.
3700 D1 is the PTYPENAME terminal, and ARGLIST is the list of arguments.
3701 (Actually ARGLIST may be either a TREE_LIST or a TREE_VEC. It will
3702 be a TREE_LIST if called directly from the parser, and a TREE_VEC
3703 otherwise.) Since ARGLIST is build on the temp_decl_obstack, we must
3704 copy it here to keep it from being reclaimed when the decl storage
3707 IN_DECL, if non-NULL, is the template declaration we are trying to
3710 If ENTERING_SCOPE is non-zero, we are about to enter the scope of
3711 the class we are looking up.
3713 If the template class is really a local class in a template
3714 function, then the FUNCTION_CONTEXT is the function in which it is
3715 being instantiated. */
3718 lookup_template_class (d1
, arglist
, in_decl
, context
, entering_scope
)
3724 tree
template = NULL_TREE
, parmlist
;
3727 if (TREE_CODE (d1
) == IDENTIFIER_NODE
)
3729 if (IDENTIFIER_VALUE (d1
)
3730 && DECL_TEMPLATE_TEMPLATE_PARM_P (IDENTIFIER_VALUE (d1
)))
3731 template = IDENTIFIER_VALUE (d1
);
3735 push_decl_namespace (context
);
3736 template = lookup_name (d1
, /*prefer_type=*/0);
3737 template = maybe_get_template_decl_from_type_decl (template);
3739 pop_decl_namespace ();
3742 context
= DECL_CONTEXT (template);
3744 else if (TREE_CODE (d1
) == TYPE_DECL
&& IS_AGGR_TYPE (TREE_TYPE (d1
)))
3746 tree type
= TREE_TYPE (d1
);
3748 /* If we are declaring a constructor, say A<T>::A<T>, we will get
3749 an implicit typename for the second A. Deal with it. */
3750 if (TREE_CODE (type
) == TYPENAME_TYPE
&& TREE_TYPE (type
))
3751 type
= TREE_TYPE (type
);
3753 if (CLASSTYPE_TEMPLATE_INFO (type
))
3755 template = CLASSTYPE_TI_TEMPLATE (type
);
3756 d1
= DECL_NAME (template);
3759 else if (TREE_CODE (d1
) == ENUMERAL_TYPE
3760 || (TYPE_P (d1
) && IS_AGGR_TYPE (d1
)))
3762 template = TYPE_TI_TEMPLATE (d1
);
3763 d1
= DECL_NAME (template);
3765 else if (TREE_CODE (d1
) == TEMPLATE_DECL
3766 && TREE_CODE (DECL_TEMPLATE_RESULT (d1
)) == TYPE_DECL
)
3769 d1
= DECL_NAME (template);
3770 context
= DECL_CONTEXT (template);
3773 my_friendly_abort (272);
3775 /* With something like `template <class T> class X class X { ... };'
3776 we could end up with D1 having nothing but an IDENTIFIER_VALUE.
3777 We don't want to do that, but we have to deal with the situation,
3778 so let's give them some syntax errors to chew on instead of a
3782 cp_error ("`%T' is not a template", d1
);
3783 return error_mark_node
;
3786 if (context
== NULL_TREE
)
3787 context
= global_namespace
;
3789 if (TREE_CODE (template) != TEMPLATE_DECL
)
3791 cp_error ("non-template type `%T' used as a template", d1
);
3793 cp_error_at ("for template declaration `%D'", in_decl
);
3794 return error_mark_node
;
3797 if (DECL_TEMPLATE_TEMPLATE_PARM_P (template))
3799 /* Create a new TEMPLATE_DECL and TEMPLATE_TEMPLATE_PARM node to store
3800 template arguments */
3802 tree parm
= copy_template_template_parm (TREE_TYPE (template));
3803 tree template2
= TYPE_STUB_DECL (parm
);
3806 parmlist
= DECL_INNERMOST_TEMPLATE_PARMS (template);
3808 arglist2
= coerce_template_parms (parmlist
, arglist
, template, 1, 1);
3809 if (arglist2
== error_mark_node
)
3810 return error_mark_node
;
3812 TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (parm
)
3813 = tree_cons (template2
, arglist2
, NULL_TREE
);
3814 TYPE_SIZE (parm
) = 0;
3819 tree template_type
= TREE_TYPE (template);
3822 tree found
= NULL_TREE
;
3825 int is_partial_instantiation
;
3827 gen_tmpl
= most_general_template (template);
3828 parmlist
= DECL_TEMPLATE_PARMS (gen_tmpl
);
3829 parm_depth
= TMPL_PARMS_DEPTH (parmlist
);
3830 arg_depth
= TMPL_ARGS_DEPTH (arglist
);
3832 if (arg_depth
== 1 && parm_depth
> 1)
3834 /* We've been given an incomplete set of template arguments.
3837 template <class T> struct S1 {
3838 template <class U> struct S2 {};
3839 template <class U> struct S2<U*> {};
3842 we will be called with an ARGLIST of `U*', but the
3843 TEMPLATE will be `template <class T> template
3844 <class U> struct S1<T>::S2'. We must fill in the missing
3847 = add_outermost_template_args (TYPE_TI_ARGS (TREE_TYPE (template)),
3849 arg_depth
= TMPL_ARGS_DEPTH (arglist
);
3852 /* Now we should enough arguments. */
3853 my_friendly_assert (parm_depth
== arg_depth
, 0);
3855 /* From here on, we're only interested in the most general
3857 template = gen_tmpl
;
3859 /* Calculate the BOUND_ARGS. These will be the args that are
3860 actually tsubst'd into the definition to create the
3864 /* We have multiple levels of arguments to coerce, at once. */
3866 int saved_depth
= TMPL_ARGS_DEPTH (arglist
);
3868 tree bound_args
= make_tree_vec (parm_depth
);
3870 for (i
= saved_depth
,
3871 t
= DECL_TEMPLATE_PARMS (template);
3872 i
> 0 && t
!= NULL_TREE
;
3873 --i
, t
= TREE_CHAIN (t
))
3875 tree a
= coerce_template_parms (TREE_VALUE (t
),
3876 arglist
, template, 1, 1);
3877 SET_TMPL_ARGS_LEVEL (bound_args
, i
, a
);
3879 /* We temporarily reduce the length of the ARGLIST so
3880 that coerce_template_parms will see only the arguments
3881 corresponding to the template parameters it is
3883 TREE_VEC_LENGTH (arglist
)--;
3886 /* Restore the ARGLIST to its full size. */
3887 TREE_VEC_LENGTH (arglist
) = saved_depth
;
3889 arglist
= bound_args
;
3893 = coerce_template_parms (INNERMOST_TEMPLATE_PARMS (parmlist
),
3894 INNERMOST_TEMPLATE_ARGS (arglist
),
3897 if (arglist
== error_mark_node
)
3898 /* We were unable to bind the arguments. */
3899 return error_mark_node
;
3901 /* In the scope of a template class, explicit references to the
3902 template class refer to the type of the template, not any
3903 instantiation of it. For example, in:
3905 template <class T> class C { void f(C<T>); }
3907 the `C<T>' is just the same as `C'. Outside of the
3908 class, however, such a reference is an instantiation. */
3909 if (comp_template_args (TYPE_TI_ARGS (template_type
),
3912 found
= template_type
;
3914 if (!entering_scope
&& PRIMARY_TEMPLATE_P (template))
3918 /* Note that we use DECL_CONTEXT, rather than
3919 CP_DECL_CONTEXT, so that the termination test is
3920 always just `ctx'. We're not interested in namepace
3922 for (ctx
= current_class_type
;
3924 ctx
= (TYPE_P (ctx
)) ? TYPE_CONTEXT (ctx
) : DECL_CONTEXT (ctx
))
3925 if (same_type_p (ctx
, template_type
))
3929 /* We're not in the scope of the class, so the
3930 TEMPLATE_TYPE is not the type we want after
3938 for (found
= DECL_TEMPLATE_INSTANTIATIONS (template);
3939 found
; found
= TREE_CHAIN (found
))
3940 if (comp_template_args (TREE_PURPOSE (found
), arglist
))
3944 found
= TREE_VALUE (found
);
3950 /* This type is a "partial instantiation" if any of the template
3951 arguments still inolve template parameters. Note that we set
3952 IS_PARTIAL_INSTANTIATION for partial specializations as
3954 is_partial_instantiation
= uses_template_parms (arglist
);
3956 if (!is_partial_instantiation
3957 && !PRIMARY_TEMPLATE_P (template)
3958 && TREE_CODE (CP_DECL_CONTEXT (template)) == NAMESPACE_DECL
)
3960 found
= xref_tag_from_type (TREE_TYPE (template),
3961 DECL_NAME (template),
3966 /* Create the type. */
3967 if (TREE_CODE (template_type
) == ENUMERAL_TYPE
)
3969 if (!is_partial_instantiation
)
3970 t
= start_enum (TYPE_IDENTIFIER (template_type
));
3972 /* We don't want to call start_enum for this type, since
3973 the values for the enumeration constants may involve
3974 template parameters. And, no one should be interested
3975 in the enumeration constants for such a type. */
3976 t
= make_node (ENUMERAL_TYPE
);
3980 t
= make_aggr_type (TREE_CODE (template_type
));
3981 CLASSTYPE_DECLARED_CLASS (t
)
3982 = CLASSTYPE_DECLARED_CLASS (template_type
);
3983 CLASSTYPE_GOT_SEMICOLON (t
) = 1;
3984 SET_CLASSTYPE_IMPLICIT_INSTANTIATION (t
);
3985 TYPE_FOR_JAVA (t
) = TYPE_FOR_JAVA (template_type
);
3987 /* A local class. Make sure the decl gets registered properly. */
3988 if (context
== current_function_decl
)
3989 pushtag (DECL_NAME (template), t
, 0);
3992 /* If we called start_enum or pushtag above, this information
3993 will already be set up. */
3996 TYPE_CONTEXT (t
) = FROB_CONTEXT (context
);
3998 type_decl
= create_implicit_typedef (DECL_NAME (template), t
);
3999 DECL_CONTEXT (type_decl
) = TYPE_CONTEXT (t
);
4000 TYPE_STUB_DECL (t
) = type_decl
;
4001 DECL_SOURCE_FILE (type_decl
)
4002 = DECL_SOURCE_FILE (TYPE_STUB_DECL (template_type
));
4003 DECL_SOURCE_LINE (type_decl
)
4004 = DECL_SOURCE_LINE (TYPE_STUB_DECL (template_type
));
4007 type_decl
= TYPE_NAME (t
);
4009 /* Set up the template information. We have to figure out which
4010 template is the immediate parent if this is a full
4012 if (parm_depth
== 1 || is_partial_instantiation
4013 || !PRIMARY_TEMPLATE_P (template))
4014 /* This case is easy; there are no member templates involved. */
4018 /* This is a full instantiation of a member template. There
4019 should be some partial instantiation of which this is an
4022 for (found
= DECL_TEMPLATE_INSTANTIATIONS (template);
4023 found
; found
= TREE_CHAIN (found
))
4026 tree tmpl
= CLASSTYPE_TI_TEMPLATE (TREE_VALUE (found
));
4028 /* We only want partial instantiations, here, not
4029 specializations or full instantiations. */
4030 if (CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_VALUE (found
))
4031 || !uses_template_parms (TREE_VALUE (found
)))
4034 /* Temporarily reduce by one the number of levels in the
4035 ARGLIST and in FOUND so as to avoid comparing the
4036 last set of arguments. */
4037 TREE_VEC_LENGTH (arglist
)--;
4038 TREE_VEC_LENGTH (TREE_PURPOSE (found
)) --;
4040 /* See if the arguments match. If they do, then TMPL is
4041 the partial instantiation we want. */
4042 success
= comp_template_args (TREE_PURPOSE (found
), arglist
);
4044 /* Restore the argument vectors to their full size. */
4045 TREE_VEC_LENGTH (arglist
)++;
4046 TREE_VEC_LENGTH (TREE_PURPOSE (found
))++;
4056 my_friendly_abort (0);
4059 SET_TYPE_TEMPLATE_INFO (t
,
4060 tree_cons (found
, arglist
, NULL_TREE
));
4061 DECL_TEMPLATE_INSTANTIATIONS (template)
4062 = tree_cons (arglist
, t
,
4063 DECL_TEMPLATE_INSTANTIATIONS (template));
4065 if (TREE_CODE (t
) == ENUMERAL_TYPE
4066 && !is_partial_instantiation
)
4067 /* Now that the type has been registered on the instantiations
4068 list, we set up the enumerators. Because the enumeration
4069 constants may involve the enumeration type itself, we make
4070 sure to register the type first, and then create the
4071 constants. That way, doing tsubst_expr for the enumeration
4072 constants won't result in recursive calls here; we'll find
4073 the instantiation and exit above. */
4074 tsubst_enum (template_type
, t
, arglist
);
4076 /* Reset the name of the type, now that CLASSTYPE_TEMPLATE_INFO
4078 if (TREE_CODE (t
) != ENUMERAL_TYPE
)
4079 DECL_NAME (type_decl
) = classtype_mangled_name (t
);
4080 DECL_ASSEMBLER_NAME (type_decl
) = DECL_NAME (type_decl
);
4081 if (!is_partial_instantiation
)
4084 DECL_ASSEMBLER_NAME (type_decl
) = mangle_decl (type_decl
);
4086 DECL_ASSEMBLER_NAME (type_decl
)
4087 = get_identifier (build_overload_name (t
, 1, 1));
4089 /* For backwards compatibility; code that uses
4090 -fexternal-templates expects looking up a template to
4091 instantiate it. I think DDD still relies on this.
4092 (jason 8/20/1998) */
4093 if (TREE_CODE (t
) != ENUMERAL_TYPE
4094 && flag_external_templates
4095 && CLASSTYPE_INTERFACE_KNOWN (TREE_TYPE (template))
4096 && ! CLASSTYPE_INTERFACE_ONLY (TREE_TYPE (template)))
4097 add_pending_template (t
);
4100 /* If the type makes use of template parameters, the
4101 code that generates debugging information will crash. */
4102 DECL_IGNORED_P (TYPE_STUB_DECL (t
)) = 1;
4114 /* Called from for_each_template_parm via walk_tree. */
4117 for_each_template_parm_r (tp
, walk_subtrees
, d
)
4123 struct pair_fn_data
*pfd
= (struct pair_fn_data
*) d
;
4124 tree_fn_t fn
= pfd
->fn
;
4125 void *data
= pfd
->data
;
4128 && for_each_template_parm (TYPE_CONTEXT (t
), fn
, data
))
4129 return error_mark_node
;
4131 switch (TREE_CODE (t
))
4134 if (TYPE_PTRMEMFUNC_FLAG (t
))
4140 if (!TYPE_TEMPLATE_INFO (t
))
4142 else if (for_each_template_parm (TREE_VALUE (TYPE_TEMPLATE_INFO (t
)),
4144 return error_mark_node
;
4148 /* Since we're not going to walk subtrees, we have to do this
4150 if (for_each_template_parm (TYPE_METHOD_BASETYPE (t
), fn
, data
))
4151 return error_mark_node
;
4154 /* Check the return type. */
4155 if (for_each_template_parm (TREE_TYPE (t
), fn
, data
))
4156 return error_mark_node
;
4158 /* Check the parameter types. Since default arguments are not
4159 instantiated until they are needed, the TYPE_ARG_TYPES may
4160 contain expressions that involve template parameters. But,
4161 no-one should be looking at them yet. And, once they're
4162 instantiated, they don't contain template parameters, so
4163 there's no point in looking at them then, either. */
4167 for (parm
= TYPE_ARG_TYPES (t
); parm
; parm
= TREE_CHAIN (parm
))
4168 if (for_each_template_parm (TREE_VALUE (parm
), fn
, data
))
4169 return error_mark_node
;
4171 /* Since we've already handled the TYPE_ARG_TYPES, we don't
4172 want walk_tree walking into them itself. */
4179 if (DECL_LANG_SPECIFIC (t
) && DECL_TEMPLATE_INFO (t
)
4180 && for_each_template_parm (DECL_TI_ARGS (t
), fn
, data
))
4181 return error_mark_node
;
4186 if (DECL_CONTEXT (t
)
4187 && for_each_template_parm (DECL_CONTEXT (t
), fn
, data
))
4188 return error_mark_node
;
4191 case TEMPLATE_TEMPLATE_PARM
:
4192 /* Record template parameters such as `T' inside `TT<T>'. */
4193 if (TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (t
)
4194 && for_each_template_parm (TYPE_TI_ARGS (t
), fn
, data
))
4195 return error_mark_node
;
4198 case TEMPLATE_TYPE_PARM
:
4199 case TEMPLATE_PARM_INDEX
:
4200 if (fn
&& (*fn
)(t
, data
))
4201 return error_mark_node
;
4203 return error_mark_node
;
4207 /* A template template parameter is encountered */
4208 if (DECL_TEMPLATE_TEMPLATE_PARM_P (t
)
4209 && for_each_template_parm (TREE_TYPE (t
), fn
, data
))
4210 return error_mark_node
;
4212 /* Already substituted template template parameter */
4217 if (!fn
|| for_each_template_parm (TYPENAME_TYPE_FULLNAME (t
), fn
, data
))
4218 return error_mark_node
;
4222 if (TREE_TYPE (t
) && TYPE_PTRMEMFUNC_P (TREE_TYPE (t
))
4223 && for_each_template_parm (TYPE_PTRMEMFUNC_FN_TYPE
4224 (TREE_TYPE (t
)), fn
, data
))
4225 return error_mark_node
;
4230 /* If there's no type, then this thing must be some expression
4231 involving template parameters. */
4232 if (!fn
&& !TREE_TYPE (t
))
4233 return error_mark_node
;
4238 case REINTERPRET_CAST_EXPR
:
4239 case CONST_CAST_EXPR
:
4240 case STATIC_CAST_EXPR
:
4241 case DYNAMIC_CAST_EXPR
:
4246 case PSEUDO_DTOR_EXPR
:
4248 return error_mark_node
;
4255 /* We didn't find any template parameters we liked. */
4259 /* For each TEMPLATE_TYPE_PARM, TEMPLATE_TEMPLATE_PARM, or
4260 TEMPLATE_PARM_INDEX in T, call FN with the parameter and the DATA.
4261 If FN returns non-zero, the iteration is terminated, and
4262 for_each_template_parm returns 1. Otherwise, the iteration
4263 continues. If FN never returns a non-zero value, the value
4264 returned by for_each_template_parm is 0. If FN is NULL, it is
4265 considered to be the function which always returns 1. */
4268 for_each_template_parm (t
, fn
, data
)
4273 struct pair_fn_data pfd
;
4279 /* Walk the tree. */
4280 return walk_tree (&t
, for_each_template_parm_r
, &pfd
) != NULL_TREE
;
4284 uses_template_parms (t
)
4287 return for_each_template_parm (t
, 0, 0);
4290 static int tinst_depth
;
4291 extern int max_tinst_depth
;
4292 #ifdef GATHER_STATISTICS
4295 static int tinst_level_tick
;
4296 static int last_template_error_tick
;
4298 /* Print out all the template instantiations that we are currently
4299 working on. If ERR, we are being called from cp_thing, so do
4300 the right thing for an error message. */
4303 print_template_context (err
)
4306 tree p
= current_tinst_level
;
4308 const char *file
= input_filename
;
4312 if (current_function_decl
!= TINST_DECL (p
)
4313 && current_function_decl
!= NULL_TREE
)
4314 /* We can get here during the processing of some synthesized
4315 method. Then, TINST_DECL (p) will be the function that's causing
4320 if (current_function_decl
== TINST_DECL (p
))
4321 /* Avoid redundancy with the the "In function" line. */;
4323 fprintf (stderr
, "%s: In instantiation of `%s':\n",
4324 file
, decl_as_string (TINST_DECL (p
),
4325 TS_DECL_TYPE
| TS_FUNC_NORETURN
));
4327 line
= TINST_LINE (p
);
4328 file
= TINST_FILE (p
);
4333 for (; p
; p
= TREE_CHAIN (p
))
4335 fprintf (stderr
, "%s:%d: instantiated from `%s'\n", file
, line
,
4336 decl_as_string (TINST_DECL (p
),
4337 TS_DECL_TYPE
| TS_FUNC_NORETURN
));
4338 line
= TINST_LINE (p
);
4339 file
= TINST_FILE (p
);
4341 fprintf (stderr
, "%s:%d: instantiated from here\n", file
, line
);
4344 /* Called from cp_thing to print the template context for an error. */
4347 maybe_print_template_context ()
4349 if (last_template_error_tick
== tinst_level_tick
4350 || current_tinst_level
== 0)
4353 last_template_error_tick
= tinst_level_tick
;
4354 print_template_context (1);
4357 /* We're starting to instantiate D; record the template instantiation context
4358 for diagnostics and to restore it later. */
4361 push_tinst_level (d
)
4366 if (tinst_depth
>= max_tinst_depth
)
4368 /* If the instantiation in question still has unbound template parms,
4369 we don't really care if we can't instantiate it, so just return.
4370 This happens with base instantiation for implicit `typename'. */
4371 if (uses_template_parms (d
))
4374 last_template_error_tick
= tinst_level_tick
;
4375 cp_error ("template instantiation depth exceeds maximum of %d (use -ftemplate-depth-NN to increase the maximum) instantiating `%D'",
4376 max_tinst_depth
, d
);
4378 print_template_context (0);
4383 new = build_expr_wfl (d
, input_filename
, lineno
, 0);
4384 TREE_CHAIN (new) = current_tinst_level
;
4385 current_tinst_level
= new;
4388 #ifdef GATHER_STATISTICS
4389 if (tinst_depth
> depth_reached
)
4390 depth_reached
= tinst_depth
;
4397 /* We're done instantiating this template; return to the instantiation
4403 tree old
= current_tinst_level
;
4405 /* Restore the filename and line number stashed away when we started
4406 this instantiation. */
4407 lineno
= TINST_LINE (old
);
4408 input_filename
= TINST_FILE (old
);
4409 extract_interface_info ();
4411 current_tinst_level
= TREE_CHAIN (old
);
4416 /* We're instantiating a deferred template; restore the template
4417 instantiation context in which the instantiation was requested, which
4418 is one step out from LEVEL. */
4421 reopen_tinst_level (level
)
4427 for (t
= level
; t
; t
= TREE_CHAIN (t
))
4430 current_tinst_level
= level
;
4434 /* Return the outermost template instantiation context, for use with
4435 -falt-external-templates. */
4440 tree p
= current_tinst_level
;
4443 for (; TREE_CHAIN (p
) ; p
= TREE_CHAIN (p
))
4448 /* DECL is a friend FUNCTION_DECL or TEMPLATE_DECL. ARGS is the
4449 vector of template arguments, as for tsubst.
4451 Returns an appropriate tsbust'd friend declaration. */
4454 tsubst_friend_function (decl
, args
)
4460 const char *file
= input_filename
;
4462 lineno
= DECL_SOURCE_LINE (decl
);
4463 input_filename
= DECL_SOURCE_FILE (decl
);
4465 if (TREE_CODE (decl
) == FUNCTION_DECL
4466 && DECL_TEMPLATE_INSTANTIATION (decl
)
4467 && TREE_CODE (DECL_TI_TEMPLATE (decl
)) != TEMPLATE_DECL
)
4468 /* This was a friend declared with an explicit template
4469 argument list, e.g.:
4473 to indicate that f was a template instantiation, not a new
4474 function declaration. Now, we have to figure out what
4475 instantiation of what template. */
4482 = lookup_template_function (tsubst_expr (DECL_TI_TEMPLATE (decl
),
4483 args
, /*complain=*/1,
4485 tsubst (DECL_TI_ARGS (decl
),
4486 args
, /*complain=*/1,
4488 new_friend
= tsubst (decl
, args
, /*complain=*/1, NULL_TREE
);
4489 tmpl
= determine_specialization (template_id
, new_friend
,
4491 /*need_member_template=*/0);
4492 new_friend
= instantiate_template (tmpl
, new_args
);
4496 new_friend
= tsubst (decl
, args
, /*complain=*/1, NULL_TREE
);
4498 /* The NEW_FRIEND will look like an instantiation, to the
4499 compiler, but is not an instantiation from the point of view of
4500 the language. For example, we might have had:
4502 template <class T> struct S {
4503 template <class U> friend void f(T, U);
4506 Then, in S<int>, template <class U> void f(int, U) is not an
4507 instantiation of anything. */
4508 DECL_USE_TEMPLATE (new_friend
) = 0;
4509 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
4510 DECL_USE_TEMPLATE (DECL_TEMPLATE_RESULT (new_friend
)) = 0;
4512 /* The mangled name for the NEW_FRIEND is incorrect. The call to
4513 tsubst will have resulted in a call to
4514 set_mangled_name_for_template_decl. But, the function is not a
4515 template instantiation and should not be mangled like one.
4516 Therefore, we remangle the function name. We don't have to do
4517 this if the NEW_FRIEND is a template since
4518 set_mangled_name_for_template_decl doesn't do anything if the
4519 function declaration still uses template arguments. */
4520 if (TREE_CODE (new_friend
) != TEMPLATE_DECL
)
4522 set_mangled_name_for_decl (new_friend
);
4523 DECL_RTL (new_friend
) = 0;
4524 make_decl_rtl (new_friend
, NULL_PTR
, 1);
4527 if (DECL_NAMESPACE_SCOPE_P (new_friend
))
4530 tree new_friend_template_info
;
4531 tree new_friend_result_template_info
;
4533 int new_friend_is_defn
;
4535 /* We must save some information from NEW_FRIEND before calling
4536 duplicate decls since that function will free NEW_FRIEND if
4538 new_friend_template_info
= DECL_TEMPLATE_INFO (new_friend
);
4539 if (TREE_CODE (new_friend
) == TEMPLATE_DECL
)
4541 /* This declaration is a `primary' template. */
4542 DECL_PRIMARY_TEMPLATE (new_friend
) = new_friend
;
4545 = DECL_INITIAL (DECL_TEMPLATE_RESULT (new_friend
)) != NULL_TREE
;
4546 new_friend_result_template_info
4547 = DECL_TEMPLATE_INFO (DECL_TEMPLATE_RESULT (new_friend
));
4551 new_friend_is_defn
= DECL_INITIAL (new_friend
) != NULL_TREE
;
4552 new_friend_result_template_info
= NULL_TREE
;
4555 /* Inside pushdecl_namespace_level, we will push into the
4556 current namespace. However, the friend function should go
4557 into the namespace of the template. */
4558 ns
= decl_namespace_context (new_friend
);
4559 push_nested_namespace (ns
);
4560 old_decl
= pushdecl_namespace_level (new_friend
);
4561 pop_nested_namespace (ns
);
4563 if (old_decl
!= new_friend
)
4565 /* This new friend declaration matched an existing
4566 declaration. For example, given:
4568 template <class T> void f(T);
4569 template <class U> class C {
4570 template <class T> friend void f(T) {}
4573 the friend declaration actually provides the definition
4574 of `f', once C has been instantiated for some type. So,
4575 old_decl will be the out-of-class template declaration,
4576 while new_friend is the in-class definition.
4578 But, if `f' was called before this point, the
4579 instantiation of `f' will have DECL_TI_ARGS corresponding
4580 to `T' but not to `U', references to which might appear
4581 in the definition of `f'. Previously, the most general
4582 template for an instantiation of `f' was the out-of-class
4583 version; now it is the in-class version. Therefore, we
4584 run through all specialization of `f', adding to their
4585 DECL_TI_ARGS appropriately. In particular, they need a
4586 new set of outer arguments, corresponding to the
4587 arguments for this class instantiation.
4589 The same situation can arise with something like this:
4592 template <class T> class C {
4596 when `C<int>' is instantiated. Now, `f(int)' is defined
4599 if (!new_friend_is_defn
)
4600 /* On the other hand, if the in-class declaration does
4601 *not* provide a definition, then we don't want to alter
4602 existing definitions. We can just leave everything
4607 /* Overwrite whatever template info was there before, if
4608 any, with the new template information pertaining to
4610 DECL_TEMPLATE_INFO (old_decl
) = new_friend_template_info
;
4612 if (TREE_CODE (old_decl
) != TEMPLATE_DECL
)
4613 /* duplicate_decls will take care of this case. */
4618 tree new_friend_args
;
4620 DECL_TEMPLATE_INFO (DECL_TEMPLATE_RESULT (old_decl
))
4621 = new_friend_result_template_info
;
4623 new_friend_args
= TI_ARGS (new_friend_template_info
);
4624 for (t
= DECL_TEMPLATE_SPECIALIZATIONS (old_decl
);
4628 tree spec
= TREE_VALUE (t
);
4631 = add_outermost_template_args (new_friend_args
,
4632 DECL_TI_ARGS (spec
));
4635 /* Now, since specializations are always supposed to
4636 hang off of the most general template, we must move
4638 t
= most_general_template (old_decl
);
4641 DECL_TEMPLATE_SPECIALIZATIONS (t
)
4642 = chainon (DECL_TEMPLATE_SPECIALIZATIONS (t
),
4643 DECL_TEMPLATE_SPECIALIZATIONS (old_decl
));
4644 DECL_TEMPLATE_SPECIALIZATIONS (old_decl
) = NULL_TREE
;
4649 /* The information from NEW_FRIEND has been merged into OLD_DECL
4650 by duplicate_decls. */
4651 new_friend
= old_decl
;
4654 else if (COMPLETE_TYPE_P (DECL_CONTEXT (new_friend
)))
4656 /* Check to see that the declaration is really present, and,
4657 possibly obtain an improved declaration. */
4658 tree fn
= check_classfn (DECL_CONTEXT (new_friend
),
4667 input_filename
= file
;
4671 /* FRIEND_TMPL is a friend TEMPLATE_DECL. ARGS is the vector of
4672 template arguments, as for tsubst.
4674 Returns an appropriate tsbust'd friend type. */
4677 tsubst_friend_class (friend_tmpl
, args
)
4684 /* First, we look for a class template. */
4685 tmpl
= lookup_name (DECL_NAME (friend_tmpl
), /*prefer_type=*/0);
4687 /* But, if we don't find one, it might be because we're in a
4688 situation like this:
4696 Here, in the scope of (say) S<int>, `S' is bound to a TYPE_DECL
4697 for `S<int>', not the TEMPLATE_DECL. */
4698 if (!tmpl
|| !DECL_CLASS_TEMPLATE_P (tmpl
))
4700 tmpl
= lookup_name (DECL_NAME (friend_tmpl
), /*prefer_type=*/1);
4701 tmpl
= maybe_get_template_decl_from_type_decl (tmpl
);
4704 if (tmpl
&& DECL_CLASS_TEMPLATE_P (tmpl
))
4706 /* The friend template has already been declared. Just
4707 check to see that the declarations match, and install any new
4708 default parameters. We must tsubst the default parameters,
4709 of course. We only need the innermost template parameters
4710 because that is all that redeclare_class_template will look
4713 = tsubst_template_parms (DECL_TEMPLATE_PARMS (friend_tmpl
),
4714 args
, /*complain=*/1);
4715 redeclare_class_template (TREE_TYPE (tmpl
), parms
);
4716 friend_type
= TREE_TYPE (tmpl
);
4720 /* The friend template has not already been declared. In this
4721 case, the instantiation of the template class will cause the
4722 injection of this template into the global scope. */
4723 tmpl
= tsubst (friend_tmpl
, args
, /*complain=*/1, NULL_TREE
);
4725 /* The new TMPL is not an instantiation of anything, so we
4726 forget its origins. We don't reset CLASSTYPE_TI_TEMPLATE for
4727 the new type because that is supposed to be the corresponding
4728 template decl, i.e., TMPL. */
4729 DECL_USE_TEMPLATE (tmpl
) = 0;
4730 DECL_TEMPLATE_INFO (tmpl
) = NULL_TREE
;
4731 CLASSTYPE_USE_TEMPLATE (TREE_TYPE (tmpl
)) = 0;
4733 /* Inject this template into the global scope. */
4734 friend_type
= TREE_TYPE (pushdecl_top_level (tmpl
));
4741 instantiate_class_template (type
)
4744 tree
template, args
, pattern
, t
;
4747 if (type
== error_mark_node
)
4748 return error_mark_node
;
4750 if (TYPE_BEING_DEFINED (type
) || COMPLETE_TYPE_P (type
))
4753 /* Figure out which template is being instantiated. */
4754 template = most_general_template (CLASSTYPE_TI_TEMPLATE (type
));
4755 my_friendly_assert (TREE_CODE (template) == TEMPLATE_DECL
, 279);
4757 /* Figure out which arguments are being used to do the
4759 args
= CLASSTYPE_TI_ARGS (type
);
4760 PARTIAL_INSTANTIATION_P (type
) = uses_template_parms (args
);
4762 if (pedantic
&& PARTIAL_INSTANTIATION_P (type
))
4763 /* If this is a partial instantiation, then we can't instantiate
4764 the type; there's no telling whether or not one of the
4765 template parameters might eventually be instantiated to some
4766 value that results in a specialization being used. For
4778 Now, the `S<U>' in `f<int>' is the specialization, not an
4779 instantiation of the original template. */
4782 /* Determine what specialization of the original template to
4784 if (PARTIAL_INSTANTIATION_P (type
))
4785 /* There's no telling which specialization is appropriate at this
4786 point. Since all peeking at the innards of this partial
4787 instantiation are extensions (like the "implicit typename"
4788 extension, which allows users to omit the keyword `typename' on
4789 names that are declared as types in template base classes), we
4790 are free to do what we please.
4792 Trying to figure out which partial instantiation to use can
4793 cause a crash. (Some of the template arguments don't even have
4794 types.) So, we just use the most general version. */
4798 t
= most_specialized_class (template, args
);
4800 if (t
== error_mark_node
)
4802 const char *str
= "candidates are:";
4803 cp_error ("ambiguous class template instantiation for `%#T'", type
);
4804 for (t
= DECL_TEMPLATE_SPECIALIZATIONS (template); t
;
4807 if (get_class_bindings (TREE_VALUE (t
), TREE_PURPOSE (t
),
4810 cp_error_at ("%s %+#T", str
, TREE_TYPE (t
));
4814 TYPE_BEING_DEFINED (type
) = 1;
4815 return error_mark_node
;
4820 pattern
= TREE_TYPE (t
);
4822 pattern
= TREE_TYPE (template);
4824 /* If the template we're instantiating is incomplete, then clearly
4825 there's nothing we can do. */
4826 if (!COMPLETE_TYPE_P (pattern
))
4829 /* If this is a partial instantiation, don't tsubst anything. We will
4830 only use this type for implicit typename, so the actual contents don't
4831 matter. All that matters is whether a particular name is a type. */
4832 if (PARTIAL_INSTANTIATION_P (type
))
4834 /* The fields set here must be kept in sync with those cleared
4835 in begin_class_definition. */
4836 TYPE_BINFO_BASETYPES (type
) = TYPE_BINFO_BASETYPES (pattern
);
4837 TYPE_FIELDS (type
) = TYPE_FIELDS (pattern
);
4838 TYPE_METHODS (type
) = TYPE_METHODS (pattern
);
4839 CLASSTYPE_TAGS (type
) = CLASSTYPE_TAGS (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 /* Substitue 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 corectly. This is precisely analagous 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 make_friend_class (type
, new_friend_type
);
5141 if (TREE_CODE (friend_type
) == TEMPLATE_DECL
)
5142 --processing_template_decl
;
5145 for (t
= TYPE_FIELDS (type
); t
; t
= TREE_CHAIN (t
))
5146 if (TREE_CODE (t
) == FIELD_DECL
)
5148 TREE_TYPE (t
) = complete_type (TREE_TYPE (t
));
5149 require_complete_type (t
);
5152 /* Set the file and line number information to whatever is given for
5153 the class itself. This puts error messages involving generated
5154 implicit functions at a predictable point, and the same point
5155 that would be used for non-template classes. */
5156 lineno
= DECL_SOURCE_LINE (typedecl
);
5157 input_filename
= DECL_SOURCE_FILE (typedecl
);
5159 unreverse_member_declarations (type
);
5160 finish_struct_1 (type
);
5161 CLASSTYPE_GOT_SEMICOLON (type
) = 1;
5163 /* Clear this now so repo_template_used is happy. */
5164 TYPE_BEING_DEFINED (type
) = 0;
5165 repo_template_used (type
);
5167 /* Now that the class is complete, instantiate default arguments for
5168 any member functions. We don't do this earlier because the
5169 default arguments may reference members of the class. */
5170 if (!PRIMARY_TEMPLATE_P (template))
5171 for (t
= TYPE_METHODS (type
); t
; t
= TREE_CHAIN (t
))
5172 if (TREE_CODE (t
) == FUNCTION_DECL
5173 /* Implicitly generated member functions will not have tmplate
5174 information; they are not instantiations, but instead are
5175 created "fresh" for each instantiation. */
5176 && DECL_TEMPLATE_INFO (t
))
5177 tsubst_default_arguments (t
);
5180 pop_from_top_level ();
5190 if (t1
== NULL_TREE
)
5191 return t2
== NULL_TREE
;
5192 if (t2
== NULL_TREE
)
5194 /* Don't care if one declares its arg const and the other doesn't -- the
5195 main variant of the arg type is all that matters. */
5196 if (TYPE_MAIN_VARIANT (TREE_VALUE (t1
))
5197 != TYPE_MAIN_VARIANT (TREE_VALUE (t2
)))
5199 return list_eq (TREE_CHAIN (t1
), TREE_CHAIN (t2
));
5202 /* If arg is a non-type template parameter that does not depend on template
5203 arguments, fold it like we weren't in the body of a template. */
5206 maybe_fold_nontype_arg (arg
)
5209 /* If we're not in a template, ARG is already as simple as it's going to
5210 get, and trying to reprocess the trees will break. */
5211 if (! processing_template_decl
)
5214 if (!TYPE_P (arg
) && !uses_template_parms (arg
))
5216 /* Sometimes, one of the args was an expression involving a
5217 template constant parameter, like N - 1. Now that we've
5218 tsubst'd, we might have something like 2 - 1. This will
5219 confuse lookup_template_class, so we do constant folding
5220 here. We have to unset processing_template_decl, to
5221 fool build_expr_from_tree() into building an actual
5224 int saved_processing_template_decl
= processing_template_decl
;
5225 processing_template_decl
= 0;
5226 arg
= fold (build_expr_from_tree (arg
));
5227 processing_template_decl
= saved_processing_template_decl
;
5232 /* Substitute ARGS into the vector of template arguments T. */
5235 tsubst_template_arg_vector (t
, args
, complain
)
5240 int len
= TREE_VEC_LENGTH (t
), need_new
= 0, i
;
5241 tree
*elts
= (tree
*) alloca (len
* sizeof (tree
));
5243 bzero ((char *) elts
, len
* sizeof (tree
));
5245 for (i
= 0; i
< len
; i
++)
5247 if (TREE_VEC_ELT (t
, i
) != NULL_TREE
5248 && TREE_CODE (TREE_VEC_ELT (t
, i
)) == TREE_VEC
)
5249 elts
[i
] = tsubst_template_arg_vector (TREE_VEC_ELT (t
, i
),
5252 elts
[i
] = maybe_fold_nontype_arg
5253 (tsubst_expr (TREE_VEC_ELT (t
, i
), args
, complain
,
5256 if (elts
[i
] != TREE_VEC_ELT (t
, i
))
5263 t
= make_tree_vec (len
);
5264 for (i
= 0; i
< len
; i
++)
5265 TREE_VEC_ELT (t
, i
) = elts
[i
];
5270 /* Return the result of substituting ARGS into the template parameters
5271 given by PARMS. If there are m levels of ARGS and m + n levels of
5272 PARMS, then the result will contain n levels of PARMS. For
5273 example, if PARMS is `template <class T> template <class U>
5274 template <T*, U, class V>' and ARGS is {{int}, {double}} then the
5275 result will be `template <int*, double, class V>'. */
5278 tsubst_template_parms (parms
, args
, complain
)
5286 for (new_parms
= &r
;
5287 TMPL_PARMS_DEPTH (parms
) > TMPL_ARGS_DEPTH (args
);
5288 new_parms
= &(TREE_CHAIN (*new_parms
)),
5289 parms
= TREE_CHAIN (parms
))
5292 make_tree_vec (TREE_VEC_LENGTH (TREE_VALUE (parms
)));
5295 for (i
= 0; i
< TREE_VEC_LENGTH (new_vec
); ++i
)
5297 tree default_value
=
5298 TREE_PURPOSE (TREE_VEC_ELT (TREE_VALUE (parms
), i
));
5300 TREE_VALUE (TREE_VEC_ELT (TREE_VALUE (parms
), i
));
5302 TREE_VEC_ELT (new_vec
, i
)
5303 = build_tree_list (tsubst (default_value
, args
, complain
,
5305 tsubst (parm_decl
, args
, complain
,
5310 tree_cons (build_int_2 (0, (TMPL_PARMS_DEPTH (parms
)
5311 - TMPL_ARGS_DEPTH (args
))),
5312 new_vec
, NULL_TREE
);
5318 /* Substitute the ARGS into the indicated aggregate (or enumeration)
5319 type T. If T is not an aggregate or enumeration type, it is
5320 handled as if by tsubst. IN_DECL is as for tsubst. If
5321 ENTERING_SCOPE is non-zero, T is the context for a template which
5322 we are presently tsubst'ing. Return the subsituted value. */
5325 tsubst_aggr_type (t
, args
, complain
, in_decl
, entering_scope
)
5335 switch (TREE_CODE (t
))
5338 if (TYPE_PTRMEMFUNC_P (t
))
5340 tree r
= build_ptrmemfunc_type
5341 (tsubst (TYPE_PTRMEMFUNC_FN_TYPE (t
), args
, complain
, in_decl
));
5342 return cp_build_qualified_type_real (r
, TYPE_QUALS (t
),
5346 /* else fall through */
5349 if (TYPE_TEMPLATE_INFO (t
))
5355 /* First, determine the context for the type we are looking
5357 if (TYPE_CONTEXT (t
) != NULL_TREE
)
5358 context
= tsubst_aggr_type (TYPE_CONTEXT (t
), args
,
5360 in_decl
, /*entering_scope=*/1);
5362 context
= NULL_TREE
;
5364 /* Then, figure out what arguments are appropriate for the
5365 type we are trying to find. For example, given:
5367 template <class T> struct S;
5368 template <class T, class U> void f(T, U) { S<U> su; }
5370 and supposing that we are instantiating f<int, double>,
5371 then our ARGS will be {int, double}, but, when looking up
5372 S we only want {double}. */
5373 argvec
= tsubst_template_arg_vector (TYPE_TI_ARGS (t
), args
,
5376 r
= lookup_template_class (t
, argvec
, in_decl
, context
,
5379 return cp_build_qualified_type_real (r
, TYPE_QUALS (t
),
5383 /* This is not a template type, so there's nothing to do. */
5387 return tsubst (t
, args
, complain
, in_decl
);
5391 /* Substitute into the default argument ARG (a default argument for
5392 FN), which has the indicated TYPE. */
5395 tsubst_default_argument (fn
, type
, arg
)
5400 /* This default argument came from a template. Instantiate the
5401 default argument here, not in tsubst. In the case of
5410 we must be careful to do name lookup in the scope of S<T>,
5411 rather than in the current class. */
5412 if (DECL_CLASS_SCOPE_P (fn
))
5413 pushclass (DECL_CONTEXT (fn
), 2);
5415 arg
= tsubst_expr (arg
, DECL_TI_ARGS (fn
), /*complain=*/1, NULL_TREE
);
5417 if (DECL_CLASS_SCOPE_P (fn
))
5420 /* Make sure the default argument is reasonable. */
5421 arg
= check_default_argument (type
, arg
);
5426 /* Substitute into all the default arguments for FN. */
5429 tsubst_default_arguments (fn
)
5435 tmpl_args
= DECL_TI_ARGS (fn
);
5437 /* If this function is not yet instantiated, we certainly don't need
5438 its default arguments. */
5439 if (uses_template_parms (tmpl_args
))
5442 for (arg
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
5444 arg
= TREE_CHAIN (arg
))
5445 if (TREE_PURPOSE (arg
))
5446 TREE_PURPOSE (arg
) = tsubst_default_argument (fn
,
5448 TREE_PURPOSE (arg
));
5451 /* Substitute the ARGS into the T, which is a _DECL. TYPE is the
5452 (already computed) substitution of ARGS into TREE_TYPE (T), if
5453 appropriate. Return the result of the substitution. IN_DECL is as
5457 tsubst_decl (t
, args
, type
, in_decl
)
5464 const char *saved_filename
;
5467 /* Set the filename and linenumber to improve error-reporting. */
5468 saved_lineno
= lineno
;
5469 saved_filename
= input_filename
;
5470 lineno
= DECL_SOURCE_LINE (t
);
5471 input_filename
= DECL_SOURCE_FILE (t
);
5473 switch (TREE_CODE (t
))
5477 /* We can get here when processing a member template function
5478 of a template class. */
5479 tree decl
= DECL_TEMPLATE_RESULT (t
);
5481 int is_template_template_parm
= DECL_TEMPLATE_TEMPLATE_PARM_P (t
);
5483 if (!is_template_template_parm
)
5485 /* We might already have an instance of this template.
5486 The ARGS are for the surrounding class type, so the
5487 full args contain the tsubst'd args for the context,
5488 plus the innermost args from the template decl. */
5489 tree tmpl_args
= DECL_CLASS_TEMPLATE_P (t
)
5490 ? CLASSTYPE_TI_ARGS (TREE_TYPE (t
))
5491 : DECL_TI_ARGS (DECL_TEMPLATE_RESULT (t
));
5494 full_args
= tsubst_template_arg_vector (tmpl_args
, args
,
5497 /* tsubst_template_arg_vector doesn't copy the vector if
5498 nothing changed. But, *something* should have
5500 my_friendly_assert (full_args
!= tmpl_args
, 0);
5502 spec
= retrieve_specialization (t
, full_args
);
5503 if (spec
!= NULL_TREE
)
5510 /* Make a new template decl. It will be similar to the
5511 original, but will record the current template arguments.
5512 We also create a new function declaration, which is just
5513 like the old one, but points to this new template, rather
5514 than the old one. */
5516 my_friendly_assert (DECL_LANG_SPECIFIC (r
) != 0, 0);
5517 TREE_CHAIN (r
) = NULL_TREE
;
5519 if (is_template_template_parm
)
5521 tree new_decl
= tsubst (decl
, args
, /*complain=*/1, in_decl
);
5522 DECL_TEMPLATE_RESULT (r
) = new_decl
;
5523 TREE_TYPE (r
) = TREE_TYPE (new_decl
);
5528 = tsubst_aggr_type (DECL_CONTEXT (t
), args
,
5529 /*complain=*/1, in_decl
,
5530 /*entering_scope=*/1);
5531 DECL_VIRTUAL_CONTEXT (r
)
5532 = tsubst_aggr_type (DECL_VIRTUAL_CONTEXT (t
), args
,
5533 /*complain=*/1, in_decl
,
5534 /*entering_scope=*/1);
5535 DECL_TEMPLATE_INFO (r
) = build_tree_list (t
, args
);
5537 if (TREE_CODE (decl
) == TYPE_DECL
)
5539 tree new_type
= tsubst (TREE_TYPE (t
), args
,
5540 /*complain=*/1, in_decl
);
5541 TREE_TYPE (r
) = new_type
;
5542 CLASSTYPE_TI_TEMPLATE (new_type
) = r
;
5543 DECL_TEMPLATE_RESULT (r
) = TYPE_MAIN_DECL (new_type
);
5544 DECL_TI_ARGS (r
) = CLASSTYPE_TI_ARGS (new_type
);
5548 tree new_decl
= tsubst (decl
, args
, /*complain=*/1, in_decl
);
5550 DECL_TEMPLATE_RESULT (r
) = new_decl
;
5551 DECL_TI_TEMPLATE (new_decl
) = r
;
5552 TREE_TYPE (r
) = TREE_TYPE (new_decl
);
5553 DECL_TI_ARGS (r
) = DECL_TI_ARGS (new_decl
);
5556 SET_DECL_IMPLICIT_INSTANTIATION (r
);
5557 DECL_TEMPLATE_INSTANTIATIONS (r
) = NULL_TREE
;
5558 DECL_TEMPLATE_SPECIALIZATIONS (r
) = NULL_TREE
;
5560 /* The template parameters for this new template are all the
5561 template parameters for the old template, except the
5562 outermost level of parameters. */
5563 DECL_TEMPLATE_PARMS (r
)
5564 = tsubst_template_parms (DECL_TEMPLATE_PARMS (t
), args
,
5567 if (PRIMARY_TEMPLATE_P (t
))
5568 DECL_PRIMARY_TEMPLATE (r
) = r
;
5570 /* We don't partially instantiate partial specializations. */
5571 if (TREE_CODE (decl
) == TYPE_DECL
)
5574 /* Record this partial instantiation. */
5575 register_specialization (r
, t
,
5576 DECL_TI_ARGS (DECL_TEMPLATE_RESULT (r
)));
5584 tree argvec
= NULL_TREE
;
5591 /* Nobody should be tsubst'ing into non-template functions. */
5592 my_friendly_assert (DECL_TEMPLATE_INFO (t
) != NULL_TREE
, 0);
5594 if (TREE_CODE (DECL_TI_TEMPLATE (t
)) == TEMPLATE_DECL
)
5598 /* Calculate the most general template of which R is a
5599 specialization, and the complete set of arguments used to
5601 gen_tmpl
= most_general_template (DECL_TI_TEMPLATE (t
));
5603 = tsubst_template_arg_vector (DECL_TI_ARGS
5604 (DECL_TEMPLATE_RESULT (gen_tmpl
)),
5605 args
, /*complain=*/1);
5607 /* Check to see if we already have this specialization. */
5608 spec
= retrieve_specialization (gen_tmpl
, argvec
);
5616 /* We can see more levels of arguments than parameters if
5617 there was a specialization of a member template, like
5620 template <class T> struct S { template <class U> void f(); }
5621 template <> template <class U> void S<int>::f(U);
5623 Here, we'll be subtituting into the specialization,
5624 because that's where we can find the code we actually
5625 want to generate, but we'll have enough arguments for
5626 the most general template.
5628 We also deal with the peculiar case:
5630 template <class T> struct S {
5631 template <class U> friend void f();
5633 template <class U> void f() {}
5635 template void f<double>();
5637 Here, the ARGS for the instantiation of will be {int,
5638 double}. But, we only need as many ARGS as there are
5639 levels of template parameters in CODE_PATTERN. We are
5640 careful not to get fooled into reducing the ARGS in
5643 template <class T> struct S { template <class U> void f(U); }
5644 template <class T> template <> void S<T>::f(int) {}
5646 which we can spot because the pattern will be a
5647 specialization in this case. */
5648 args_depth
= TMPL_ARGS_DEPTH (args
);
5650 TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (DECL_TI_TEMPLATE (t
)));
5651 if (args_depth
> parms_depth
5652 && !DECL_TEMPLATE_SPECIALIZATION (t
))
5653 args
= get_innermost_template_args (args
, parms_depth
);
5657 /* This special case arises when we have something like this:
5659 template <class T> struct S {
5660 friend void f<int>(int, double);
5663 Here, the DECL_TI_TEMPLATE for the friend declaration
5664 will be a LOOKUP_EXPR or an IDENTIFIER_NODE. We are
5665 being called from tsubst_friend_function, and we want
5666 only to create a new decl (R) with appropriate types so
5667 that we can call determine_specialization. */
5668 my_friendly_assert ((TREE_CODE (DECL_TI_TEMPLATE (t
))
5670 || (TREE_CODE (DECL_TI_TEMPLATE (t
))
5671 == IDENTIFIER_NODE
), 0);
5672 gen_tmpl
= NULL_TREE
;
5675 if (DECL_CLASS_SCOPE_P (t
))
5677 if (DECL_NAME (t
) == constructor_name (DECL_CONTEXT (t
)))
5681 ctx
= tsubst_aggr_type (DECL_CONTEXT (t
), args
,
5683 /*entering_scope=*/1);
5688 ctx
= DECL_CONTEXT (t
);
5690 type
= tsubst (type
, args
, /*complain=*/1, in_decl
);
5691 if (type
== error_mark_node
)
5692 return error_mark_node
;
5694 /* We do NOT check for matching decls pushed separately at this
5695 point, as they may not represent instantiations of this
5696 template, and in any case are considered separate under the
5697 discrete model. Instead, see add_maybe_template. */
5699 DECL_USE_TEMPLATE (r
) = 0;
5700 TREE_TYPE (r
) = type
;
5702 DECL_CONTEXT (r
) = ctx
;
5703 DECL_VIRTUAL_CONTEXT (r
)
5704 = tsubst_aggr_type (DECL_VIRTUAL_CONTEXT (t
), args
,
5706 /*entering_scope=*/1);
5708 if (member
&& DECL_CONV_FN_P (r
))
5710 /* Type-conversion operator. Reconstruct the name, in
5711 case it's the name of one of the template's parameters. */
5713 DECL_NAME (r
) = mangle_conv_op_name_for_type (TREE_TYPE (type
));
5715 DECL_NAME (r
) = build_typename_overload (TREE_TYPE (type
));
5718 DECL_ARGUMENTS (r
) = tsubst (DECL_ARGUMENTS (t
), args
,
5720 DECL_TEMPLATE_RESULT (r
) = NULL_TREE
;
5722 TREE_STATIC (r
) = 0;
5723 TREE_PUBLIC (r
) = TREE_PUBLIC (t
);
5724 DECL_EXTERNAL (r
) = 1;
5725 DECL_INTERFACE_KNOWN (r
) = 0;
5726 DECL_DEFER_OUTPUT (r
) = 0;
5727 TREE_CHAIN (r
) = NULL_TREE
;
5728 DECL_PENDING_INLINE_INFO (r
) = 0;
5729 DECL_PENDING_INLINE_P (r
) = 0;
5731 if (DECL_CLONED_FUNCTION (r
))
5733 DECL_CLONED_FUNCTION (r
) = tsubst (DECL_CLONED_FUNCTION (t
),
5734 args
, /*complain=*/1, t
);
5735 TREE_CHAIN (r
) = TREE_CHAIN (DECL_CLONED_FUNCTION (r
));
5736 TREE_CHAIN (DECL_CLONED_FUNCTION (r
)) = r
;
5739 /* Set up the DECL_TEMPLATE_INFO for R and compute its mangled
5740 name. There's no need to do this in the special friend
5741 case mentioned above where GEN_TMPL is NULL. */
5744 DECL_TEMPLATE_INFO (r
)
5745 = tree_cons (gen_tmpl
, argvec
, NULL_TREE
);
5746 SET_DECL_IMPLICIT_INSTANTIATION (r
);
5747 register_specialization (r
, gen_tmpl
, argvec
);
5749 /* Set the mangled name for R. */
5750 if (DECL_DESTRUCTOR_P (t
))
5753 set_mangled_name_for_decl (r
);
5755 DECL_ASSEMBLER_NAME (r
) = build_destructor_name (ctx
);
5759 /* Instantiations of template functions must be mangled
5760 specially, in order to conform to 14.5.5.1
5761 [temp.over.link]. */
5762 tree tmpl
= DECL_TI_TEMPLATE (t
);
5764 /* TMPL will be NULL if this is a specialization of a
5765 member function of a template class. */
5766 if (name_mangling_version
< 1
5767 || tmpl
== NULL_TREE
5768 || (member
&& !is_member_template (tmpl
)
5769 && !DECL_TEMPLATE_INFO (tmpl
)))
5770 set_mangled_name_for_decl (r
);
5772 set_mangled_name_for_template_decl (r
);
5776 make_decl_rtl (r
, NULL_PTR
, 1);
5778 /* Like grokfndecl. If we don't do this, pushdecl will
5779 mess up our TREE_CHAIN because it doesn't find a
5780 previous decl. Sigh. */
5782 && ! uses_template_parms (r
)
5783 && (IDENTIFIER_GLOBAL_VALUE (DECL_ASSEMBLER_NAME (r
))
5785 SET_IDENTIFIER_GLOBAL_VALUE (DECL_ASSEMBLER_NAME (r
), r
);
5787 /* We're not supposed to instantiate default arguments
5788 until they are called, for a template. But, for a
5791 template <class T> void f ()
5792 { extern void g(int i = T()); }
5794 we should do the substitution when the template is
5795 instantiated. We handle the member function case in
5796 instantiate_class_template since the default arguments
5797 might refer to other members of the class. */
5799 && !PRIMARY_TEMPLATE_P (gen_tmpl
)
5800 && !uses_template_parms (argvec
))
5801 tsubst_default_arguments (r
);
5804 /* Copy the list of befriending classes. */
5805 for (friends
= &DECL_BEFRIENDING_CLASSES (r
);
5807 friends
= &TREE_CHAIN (*friends
))
5809 *friends
= copy_node (*friends
);
5810 TREE_VALUE (*friends
) = tsubst (TREE_VALUE (*friends
),
5811 args
, /*complain=*/1,
5815 if (DECL_CONSTRUCTOR_P (r
) || DECL_DESTRUCTOR_P (r
))
5817 maybe_retrofit_in_chrg (r
);
5818 if (DECL_CONSTRUCTOR_P (r
))
5819 grok_ctor_properties (ctx
, r
);
5821 else if (IDENTIFIER_OPNAME_P (DECL_NAME (r
)))
5822 grok_op_properties (r
, DECL_VIRTUAL_P (r
), DECL_FRIEND_P (r
));
5829 TREE_TYPE (r
) = type
;
5830 c_apply_type_quals_to_decl (CP_TYPE_QUALS (type
), r
);
5832 if (TREE_CODE (DECL_INITIAL (r
)) != TEMPLATE_PARM_INDEX
)
5833 DECL_INITIAL (r
) = TREE_TYPE (r
);
5835 DECL_INITIAL (r
) = tsubst (DECL_INITIAL (r
), args
,
5836 /*complain=*/1, in_decl
);
5838 DECL_CONTEXT (r
) = NULL_TREE
;
5839 if (PROMOTE_PROTOTYPES
5840 && (TREE_CODE (type
) == INTEGER_TYPE
5841 || TREE_CODE (type
) == ENUMERAL_TYPE
)
5842 && TYPE_PRECISION (type
) < TYPE_PRECISION (integer_type_node
))
5843 DECL_ARG_TYPE (r
) = integer_type_node
;
5845 TREE_CHAIN (r
) = tsubst (TREE_CHAIN (t
), args
,
5846 /*complain=*/1, TREE_CHAIN (t
));
5853 TREE_TYPE (r
) = type
;
5854 c_apply_type_quals_to_decl (CP_TYPE_QUALS (type
), r
);
5856 /* We don't have to set DECL_CONTEXT here; it is set by
5857 finish_member_declaration. */
5858 DECL_INITIAL (r
) = tsubst_expr (DECL_INITIAL (t
), args
,
5859 /*complain=*/1, in_decl
);
5860 TREE_CHAIN (r
) = NULL_TREE
;
5861 if (TREE_CODE (type
) == VOID_TYPE
)
5862 cp_error_at ("instantiation of `%D' as type void", r
);
5870 = tsubst_copy (DECL_INITIAL (t
), args
, /*complain=*/1, in_decl
);
5871 TREE_CHAIN (r
) = NULL_TREE
;
5876 if (DECL_IMPLICIT_TYPEDEF_P (t
))
5878 /* For an implicit typedef, we just want the implicit
5879 typedef for the tsubst'd type. We've already got the
5880 tsubst'd type, as TYPE, so we just need it's associated
5882 r
= TYPE_NAME (type
);
5885 else if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
5886 || TREE_CODE (type
) == TEMPLATE_TEMPLATE_PARM
)
5888 /* For a template type parameter, we don't have to do
5889 anything special. */
5890 r
= TYPE_NAME (type
);
5898 tree argvec
= NULL_TREE
;
5899 tree gen_tmpl
= NULL_TREE
;
5901 tree tmpl
= NULL_TREE
;
5905 /* Assume this is a non-local variable. */
5908 if (TYPE_P (CP_DECL_CONTEXT (t
)))
5909 ctx
= tsubst_aggr_type (DECL_CONTEXT (t
), args
,
5911 in_decl
, /*entering_scope=*/1);
5914 /* Subsequent calls to pushdecl will fill this in. */
5916 if (!DECL_NAMESPACE_SCOPE_P (t
))
5920 /* Check to see if we already have this specialization. */
5923 tmpl
= DECL_TI_TEMPLATE (t
);
5924 gen_tmpl
= most_general_template (tmpl
);
5925 argvec
= tsubst (DECL_TI_ARGS (t
), args
, /*complain=*/1, in_decl
);
5926 spec
= retrieve_specialization (gen_tmpl
, argvec
);
5929 spec
= retrieve_local_specialization (t
);
5938 TREE_TYPE (r
) = type
;
5939 c_apply_type_quals_to_decl (CP_TYPE_QUALS (type
), r
);
5940 DECL_CONTEXT (r
) = ctx
;
5942 /* Don't try to expand the initializer until someone tries to use
5943 this variable; otherwise we run into circular dependencies. */
5944 DECL_INITIAL (r
) = NULL_TREE
;
5946 DECL_SIZE (r
) = DECL_SIZE_UNIT (r
) = 0;
5948 /* For __PRETTY_FUNCTION__ we have to adjust the initializer. */
5949 if (DECL_PRETTY_FUNCTION_P (r
))
5951 DECL_INITIAL (r
) = tsubst (DECL_INITIAL (t
),
5955 TREE_TYPE (r
) = TREE_TYPE (DECL_INITIAL (r
));
5958 /* Even if the original location is out of scope, the newly
5959 substituted one is not. */
5960 if (TREE_CODE (r
) == VAR_DECL
)
5961 DECL_DEAD_FOR_LOCAL (r
) = 0;
5965 /* A static data member declaration is always marked
5966 external when it is declared in-class, even if an
5967 initializer is present. We mimic the non-template
5969 DECL_EXTERNAL (r
) = 1;
5971 register_specialization (r
, gen_tmpl
, argvec
);
5972 DECL_TEMPLATE_INFO (r
) = tree_cons (tmpl
, argvec
, NULL_TREE
);
5973 SET_DECL_IMPLICIT_INSTANTIATION (r
);
5976 register_local_specialization (r
, t
);
5978 TREE_CHAIN (r
) = NULL_TREE
;
5979 if (TREE_CODE (r
) == VAR_DECL
&& TREE_CODE (type
) == VOID_TYPE
)
5980 cp_error_at ("instantiation of `%D' as type void", r
);
5985 my_friendly_abort (0);
5988 /* Restore the file and line information. */
5989 lineno
= saved_lineno
;
5990 input_filename
= saved_filename
;
5995 /* Substitue into the ARG_TYPES of a function type. */
5998 tsubst_arg_types (arg_types
, args
, complain
, in_decl
)
6004 tree remaining_arg_types
;
6007 if (!arg_types
|| arg_types
== void_list_node
)
6010 remaining_arg_types
= tsubst_arg_types (TREE_CHAIN (arg_types
),
6011 args
, complain
, in_decl
);
6012 if (remaining_arg_types
== error_mark_node
)
6013 return error_mark_node
;
6015 type
= tsubst (TREE_VALUE (arg_types
), args
, complain
, in_decl
);
6016 if (type
== error_mark_node
)
6017 return error_mark_node
;
6019 /* Do array-to-pointer, function-to-pointer conversion, and ignore
6020 top-level qualifiers as required. */
6021 type
= TYPE_MAIN_VARIANT (type_decays_to (type
));
6023 /* Note that we do not substitute into default arguments here. The
6024 standard mandates that they be instantiated only when needed,
6025 which is done in build_over_call. */
6026 return hash_tree_cons (TREE_PURPOSE (arg_types
), type
,
6027 remaining_arg_types
);
6031 /* Substitute into a FUNCTION_TYPE or METHOD_TYPE. This routine does
6032 *not* handle the exception-specification for FNTYPE, because the
6033 initial substitution of explicitly provided template parameters
6034 during argument deduction forbids substitution into the
6035 exception-specification:
6039 All references in the function type of the function template to the
6040 corresponding template parameters are replaced by the specified tem-
6041 plate argument values. If a substitution in a template parameter or
6042 in the function type of the function template results in an invalid
6043 type, type deduction fails. [Note: The equivalent substitution in
6044 exception specifications is done only when the function is instanti-
6045 ated, at which point a program is ill-formed if the substitution
6046 results in an invalid type.] */
6049 tsubst_function_type (t
, args
, complain
, in_decl
)
6059 /* The TYPE_CONTEXT is not used for function/method types. */
6060 my_friendly_assert (TYPE_CONTEXT (t
) == NULL_TREE
, 0);
6062 /* Substitue the return type. */
6063 return_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
6064 if (return_type
== error_mark_node
)
6065 return error_mark_node
;
6067 /* Substitue the argument types. */
6068 arg_types
= tsubst_arg_types (TYPE_ARG_TYPES (t
), args
,
6070 if (arg_types
== error_mark_node
)
6071 return error_mark_node
;
6073 /* Construct a new type node and return it. */
6074 if (TREE_CODE (t
) == FUNCTION_TYPE
)
6075 fntype
= build_function_type (return_type
, arg_types
);
6078 tree r
= TREE_TYPE (TREE_VALUE (arg_types
));
6079 if (! IS_AGGR_TYPE (r
))
6083 Type deduction may fail for any of the following
6086 -- Attempting to create "pointer to member of T" when T
6087 is not a class type. */
6089 cp_error ("creating pointer to member function of non-class type `%T'",
6091 return error_mark_node
;
6094 fntype
= build_cplus_method_type (r
, return_type
, TREE_CHAIN
6097 fntype
= build_qualified_type (fntype
, TYPE_QUALS (t
));
6098 fntype
= build_type_attribute_variant (fntype
, TYPE_ATTRIBUTES (t
));
6103 /* Substitute into the PARMS of a call-declarator. */
6106 tsubst_call_declarator_parms (parms
, args
, complain
, in_decl
)
6116 if (!parms
|| parms
== void_list_node
)
6119 new_parms
= tsubst_call_declarator_parms (TREE_CHAIN (parms
),
6120 args
, complain
, in_decl
);
6122 /* Figure out the type of this parameter. */
6123 type
= tsubst (TREE_VALUE (parms
), args
, complain
, in_decl
);
6125 /* Figure out the default argument as well. Note that we use
6126 tsubst_expr since the default argument is really an expression. */
6127 defarg
= tsubst_expr (TREE_PURPOSE (parms
), args
, complain
, in_decl
);
6129 /* Chain this parameter on to the front of those we have already
6130 processed. We don't use hash_tree_cons because that function
6131 doesn't check TREE_PARMLIST. */
6132 new_parms
= tree_cons (defarg
, type
, new_parms
);
6134 /* And note that these are parameters. */
6135 TREE_PARMLIST (new_parms
) = 1;
6140 /* Take the tree structure T and replace template parameters used
6141 therein with the argument vector ARGS. IN_DECL is an associated
6142 decl for diagnostics. If an error occurs, returns ERROR_MARK_NODE.
6143 An appropriate error message is issued only if COMPLAIN is
6144 non-zero. Note that we must be relatively non-tolerant of
6145 extensions here, in order to preserve conformance; if we allow
6146 substitutions that should not be allowed, we may allow argument
6147 deductions that should not succeed, and therefore report ambiguous
6148 overload situations where there are none. In theory, we could
6149 allow the substitution, but indicate that it should have failed,
6150 and allow our caller to make sure that the right thing happens, but
6151 we don't try to do this yet.
6153 This function is used for dealing with types, decls and the like;
6154 for expressions, use tsubst_expr or tsubst_copy. */
6157 tsubst (t
, args
, complain
, in_decl
)
6164 if (t
== NULL_TREE
|| t
== error_mark_node
6165 || t
== integer_type_node
6166 || t
== void_type_node
6167 || t
== char_type_node
6168 || TREE_CODE (t
) == NAMESPACE_DECL
)
6171 if (TREE_CODE (t
) == IDENTIFIER_NODE
)
6172 type
= IDENTIFIER_TYPE_VALUE (t
);
6174 type
= TREE_TYPE (t
);
6175 if (type
== unknown_type_node
)
6176 my_friendly_abort (42);
6178 if (type
&& TREE_CODE (t
) != FUNCTION_DECL
6179 && TREE_CODE (t
) != TYPENAME_TYPE
6180 && TREE_CODE (t
) != TEMPLATE_DECL
6181 && TREE_CODE (t
) != IDENTIFIER_NODE
6182 && TREE_CODE (t
) != FUNCTION_TYPE
6183 && TREE_CODE (t
) != METHOD_TYPE
)
6184 type
= tsubst (type
, args
, complain
, in_decl
);
6185 if (type
== error_mark_node
)
6186 return error_mark_node
;
6189 return tsubst_decl (t
, args
, type
, in_decl
);
6191 switch (TREE_CODE (t
))
6196 return tsubst_aggr_type (t
, args
, complain
, in_decl
,
6197 /*entering_scope=*/0);
6200 case IDENTIFIER_NODE
:
6212 if (t
== integer_type_node
)
6215 if (TREE_CODE (TYPE_MIN_VALUE (t
)) == INTEGER_CST
6216 && TREE_CODE (TYPE_MAX_VALUE (t
)) == INTEGER_CST
)
6220 tree max
, omax
= TREE_OPERAND (TYPE_MAX_VALUE (t
), 0);
6222 max
= tsubst_expr (omax
, args
, complain
, in_decl
);
6223 if (max
== error_mark_node
)
6224 return error_mark_node
;
6226 /* See if we can reduce this expression to something simpler. */
6227 max
= maybe_fold_nontype_arg (max
);
6228 if (!processing_template_decl
)
6229 max
= decl_constant_value (max
);
6231 if (processing_template_decl
6232 /* When providing explicit arguments to a template
6233 function, but leaving some arguments for subsequent
6234 deduction, MAX may be template-dependent even if we're
6235 not PROCESSING_TEMPLATE_DECL. We still need to check for
6236 template parms, though; MAX won't be an INTEGER_CST for
6237 dynamic arrays, either. */
6238 || (TREE_CODE (max
) != INTEGER_CST
6239 && uses_template_parms (max
)))
6241 tree itype
= make_node (INTEGER_TYPE
);
6242 TYPE_MIN_VALUE (itype
) = size_zero_node
;
6243 TYPE_MAX_VALUE (itype
) = build_min (MINUS_EXPR
, sizetype
, max
,
6248 if (integer_zerop (omax
))
6250 /* Still allow an explicit array of size zero. */
6252 pedwarn ("creating array with size zero");
6254 else if (integer_zerop (max
)
6255 || (TREE_CODE (max
) == INTEGER_CST
6256 && INT_CST_LT (max
, integer_zero_node
)))
6260 Type deduction may fail for any of the following
6263 Attempting to create an array with a size that is
6264 zero or negative. */
6266 cp_error ("creating array with size zero (`%E')", max
);
6268 return error_mark_node
;
6271 return compute_array_index_type (NULL_TREE
, max
);
6274 case TEMPLATE_TYPE_PARM
:
6275 case TEMPLATE_TEMPLATE_PARM
:
6276 case TEMPLATE_PARM_INDEX
:
6284 if (TREE_CODE (t
) == TEMPLATE_TYPE_PARM
6285 || TREE_CODE (t
) == TEMPLATE_TEMPLATE_PARM
)
6287 idx
= TEMPLATE_TYPE_IDX (t
);
6288 level
= TEMPLATE_TYPE_LEVEL (t
);
6292 idx
= TEMPLATE_PARM_IDX (t
);
6293 level
= TEMPLATE_PARM_LEVEL (t
);
6296 if (TREE_VEC_LENGTH (args
) > 0)
6298 tree arg
= NULL_TREE
;
6300 levels
= TMPL_ARGS_DEPTH (args
);
6301 if (level
<= levels
)
6302 arg
= TMPL_ARG (args
, level
, idx
);
6304 if (arg
== error_mark_node
)
6305 return error_mark_node
;
6306 else if (arg
!= NULL_TREE
)
6308 if (TREE_CODE (t
) == TEMPLATE_TYPE_PARM
)
6310 my_friendly_assert (TYPE_P (arg
), 0);
6311 return cp_build_qualified_type_real
6312 (arg
, CP_TYPE_QUALS (arg
) | CP_TYPE_QUALS (t
),
6315 else if (TREE_CODE (t
) == TEMPLATE_TEMPLATE_PARM
)
6317 if (TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (t
))
6319 /* We are processing a type constructed from
6320 a template template parameter */
6321 tree argvec
= tsubst (TYPE_TI_ARGS (t
),
6322 args
, complain
, in_decl
);
6323 if (argvec
== error_mark_node
)
6324 return error_mark_node
;
6326 /* We can get a TEMPLATE_TEMPLATE_PARM here when
6327 we are resolving nested-types in the signature of
6328 a member function templates.
6329 Otherwise ARG is a TEMPLATE_DECL and is the real
6330 template to be instantiated. */
6331 if (TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
)
6332 arg
= TYPE_NAME (arg
);
6334 r
= lookup_template_class (DECL_NAME (arg
),
6337 /*entering_scope=*/0);
6338 return cp_build_qualified_type_real (r
,
6343 /* We are processing a template argument list. */
6351 my_friendly_abort (981018);
6354 /* This can happen during the attempted tsubst'ing in
6355 unify. This means that we don't yet have any information
6356 about the template parameter in question. */
6359 /* If we get here, we must have been looking at a parm for a
6360 more deeply nested template. Make a new version of this
6361 template parameter, but with a lower level. */
6362 switch (TREE_CODE (t
))
6364 case TEMPLATE_TYPE_PARM
:
6365 case TEMPLATE_TEMPLATE_PARM
:
6367 TEMPLATE_TYPE_PARM_INDEX (r
)
6368 = reduce_template_parm_level (TEMPLATE_TYPE_PARM_INDEX (t
),
6370 TYPE_STUB_DECL (r
) = TYPE_NAME (r
) = TEMPLATE_TYPE_DECL (r
);
6371 TYPE_MAIN_VARIANT (r
) = r
;
6372 TYPE_POINTER_TO (r
) = NULL_TREE
;
6373 TYPE_REFERENCE_TO (r
) = NULL_TREE
;
6375 if (TREE_CODE (t
) == TEMPLATE_TEMPLATE_PARM
6376 && TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (t
))
6378 tree argvec
= tsubst (TYPE_TI_ARGS (t
), args
,
6380 if (argvec
== error_mark_node
)
6381 return error_mark_node
;
6383 TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (r
)
6384 = tree_cons (TYPE_NAME (t
), argvec
, NULL_TREE
);
6388 case TEMPLATE_PARM_INDEX
:
6389 r
= reduce_template_parm_level (t
, type
, levels
);
6393 my_friendly_abort (0);
6401 tree purpose
, value
, chain
, result
;
6403 if (t
== void_list_node
)
6406 purpose
= TREE_PURPOSE (t
);
6409 purpose
= tsubst (purpose
, args
, complain
, in_decl
);
6410 if (purpose
== error_mark_node
)
6411 return error_mark_node
;
6413 value
= TREE_VALUE (t
);
6416 value
= tsubst (value
, args
, complain
, in_decl
);
6417 if (value
== error_mark_node
)
6418 return error_mark_node
;
6420 chain
= TREE_CHAIN (t
);
6421 if (chain
&& chain
!= void_type_node
)
6423 chain
= tsubst (chain
, args
, complain
, in_decl
);
6424 if (chain
== error_mark_node
)
6425 return error_mark_node
;
6427 if (purpose
== TREE_PURPOSE (t
)
6428 && value
== TREE_VALUE (t
)
6429 && chain
== TREE_CHAIN (t
))
6431 result
= hash_tree_cons (purpose
, value
, chain
);
6432 TREE_PARMLIST (result
) = TREE_PARMLIST (t
);
6436 if (type
!= NULL_TREE
)
6438 /* A binfo node. We always need to make a copy, of the node
6439 itself and of its BINFO_BASETYPES. */
6443 /* Make sure type isn't a typedef copy. */
6444 type
= BINFO_TYPE (TYPE_BINFO (type
));
6446 TREE_TYPE (t
) = complete_type (type
);
6447 if (IS_AGGR_TYPE (type
))
6449 BINFO_VTABLE (t
) = TYPE_BINFO_VTABLE (type
);
6450 BINFO_VIRTUALS (t
) = TYPE_BINFO_VIRTUALS (type
);
6451 if (TYPE_BINFO_BASETYPES (type
) != NULL_TREE
)
6452 BINFO_BASETYPES (t
) = copy_node (TYPE_BINFO_BASETYPES (type
));
6457 /* Otherwise, a vector of template arguments. */
6458 return tsubst_template_arg_vector (t
, args
, complain
);
6461 case REFERENCE_TYPE
:
6463 enum tree_code code
;
6465 if (type
== TREE_TYPE (t
))
6468 code
= TREE_CODE (t
);
6473 Type deduction may fail for any of the following
6476 -- Attempting to create a pointer to reference type.
6477 -- Attempting to create a reference to a reference type or
6478 a reference to void. */
6479 if (TREE_CODE (type
) == REFERENCE_TYPE
6480 || (code
== REFERENCE_TYPE
&& TREE_CODE (type
) == VOID_TYPE
))
6482 static int last_line
= 0;
6483 static const char* last_file
= 0;
6485 /* We keep track of the last time we issued this error
6486 message to avoid spewing a ton of messages during a
6487 single bad template instantiation. */
6488 if (complain
&& (last_line
!= lineno
||
6489 last_file
!= input_filename
))
6491 if (TREE_CODE (type
) == VOID_TYPE
)
6492 cp_error ("forming reference to void");
6494 cp_error ("forming %s to reference type `%T'",
6495 (code
== POINTER_TYPE
) ? "pointer" : "reference",
6498 last_file
= input_filename
;
6501 return error_mark_node
;
6503 else if (code
== POINTER_TYPE
)
6504 r
= build_pointer_type (type
);
6506 r
= build_reference_type (type
);
6507 r
= cp_build_qualified_type_real (r
, TYPE_QUALS (t
), complain
);
6509 /* Will this ever be needed for TYPE_..._TO values? */
6515 r
= tsubst (TYPE_OFFSET_BASETYPE (t
), args
, complain
, in_decl
);
6516 if (r
== error_mark_node
|| !IS_AGGR_TYPE (r
))
6520 Type deduction may fail for any of the following
6523 -- Attempting to create "pointer to member of T" when T
6524 is not a class type. */
6526 cp_error ("creating pointer to member of non-class type `%T'",
6528 return error_mark_node
;
6530 return build_offset_type (r
, type
);
6538 fntype
= tsubst_function_type (t
, args
, complain
, in_decl
);
6539 if (fntype
== error_mark_node
)
6540 return error_mark_node
;
6542 /* Substitue the exception specification. */
6543 raises
= TYPE_RAISES_EXCEPTIONS (t
);
6546 tree list
= NULL_TREE
;
6548 if (! TREE_VALUE (raises
))
6551 for (; raises
!= NULL_TREE
; raises
= TREE_CHAIN (raises
))
6553 tree spec
= TREE_VALUE (raises
);
6555 spec
= tsubst (spec
, args
, complain
, in_decl
);
6556 if (spec
== error_mark_node
)
6558 list
= add_exception_specifier (list
, spec
, complain
);
6560 fntype
= build_exception_variant (fntype
, list
);
6566 tree domain
= tsubst (TYPE_DOMAIN (t
), args
, complain
, in_decl
);
6567 if (domain
== error_mark_node
)
6568 return error_mark_node
;
6570 /* As an optimization, we avoid regenerating the array type if
6571 it will obviously be the same as T. */
6572 if (type
== TREE_TYPE (t
) && domain
== TYPE_DOMAIN (t
))
6575 /* These checks should match the ones in grokdeclarator.
6579 The deduction may fail for any of the following reasons:
6581 -- Attempting to create an array with an element type that
6582 is void, a function type, or a reference type. */
6583 if (TREE_CODE (type
) == VOID_TYPE
6584 || TREE_CODE (type
) == FUNCTION_TYPE
6585 || TREE_CODE (type
) == REFERENCE_TYPE
)
6588 cp_error ("creating array of `%T'", type
);
6589 return error_mark_node
;
6592 r
= build_cplus_array_type (type
, domain
);
6599 tree e1
= tsubst (TREE_OPERAND (t
, 0), args
, complain
,
6601 tree e2
= tsubst (TREE_OPERAND (t
, 1), args
, complain
,
6604 if (e1
== error_mark_node
|| e2
== error_mark_node
)
6605 return error_mark_node
;
6607 return fold (build (TREE_CODE (t
), TREE_TYPE (t
), e1
, e2
));
6613 tree e
= tsubst (TREE_OPERAND (t
, 0), args
, complain
,
6615 if (e
== error_mark_node
)
6616 return error_mark_node
;
6618 return fold (build (TREE_CODE (t
), TREE_TYPE (t
), e
));
6623 tree ctx
= tsubst_aggr_type (TYPE_CONTEXT (t
), args
, complain
,
6624 in_decl
, /*entering_scope=*/1);
6625 tree f
= tsubst_copy (TYPENAME_TYPE_FULLNAME (t
), args
,
6628 if (ctx
== error_mark_node
|| f
== error_mark_node
)
6629 return error_mark_node
;
6631 if (!IS_AGGR_TYPE (ctx
))
6634 cp_error ("`%T' is not a class, struct, or union type",
6636 return error_mark_node
;
6638 else if (!uses_template_parms (ctx
) && !TYPE_BEING_DEFINED (ctx
))
6640 /* Normally, make_typename_type does not require that the CTX
6641 have complete type in order to allow things like:
6643 template <class T> struct S { typename S<T>::X Y; };
6645 But, such constructs have already been resolved by this
6646 point, so here CTX really should have complete type, unless
6647 it's a partial instantiation. */
6648 ctx
= complete_type (ctx
);
6649 if (!COMPLETE_TYPE_P (ctx
))
6652 incomplete_type_error (NULL_TREE
, ctx
);
6653 return error_mark_node
;
6657 f
= make_typename_type (ctx
, f
, complain
);
6658 if (f
== error_mark_node
)
6660 return cp_build_qualified_type_real (f
,
6662 | CP_TYPE_QUALS (t
),
6668 tree e
= tsubst (TREE_OPERAND (t
, 0), args
, complain
,
6670 if (e
== error_mark_node
)
6671 return error_mark_node
;
6672 return make_pointer_declarator (type
, e
);
6677 tree e
= tsubst (TREE_OPERAND (t
, 0), args
, complain
,
6679 if (e
== error_mark_node
)
6680 return error_mark_node
;
6681 return make_reference_declarator (type
, e
);
6686 tree e1
= tsubst (TREE_OPERAND (t
, 0), args
, complain
,
6688 tree e2
= tsubst_expr (TREE_OPERAND (t
, 1), args
, complain
,
6690 if (e1
== error_mark_node
|| e2
== error_mark_node
)
6691 return error_mark_node
;
6693 return build_parse_node (ARRAY_REF
, e1
, e2
, tsubst_expr
);
6698 tree e1
= tsubst (TREE_OPERAND (t
, 0), args
, complain
,
6700 tree e2
= (tsubst_call_declarator_parms
6701 (CALL_DECLARATOR_PARMS (t
), args
, complain
, in_decl
));
6702 tree e3
= tsubst (CALL_DECLARATOR_EXCEPTION_SPEC (t
), args
,
6705 if (e1
== error_mark_node
|| e2
== error_mark_node
6706 || e3
== error_mark_node
)
6707 return error_mark_node
;
6709 return make_call_declarator (e1
, e2
, CALL_DECLARATOR_QUALS (t
), e3
);
6714 tree e1
= tsubst (TREE_OPERAND (t
, 0), args
, complain
,
6716 tree e2
= tsubst (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
6717 if (e1
== error_mark_node
|| e2
== error_mark_node
)
6718 return error_mark_node
;
6720 return build_parse_node (TREE_CODE (t
), e1
, e2
);
6725 tree e1
= tsubst_expr (TYPE_FIELDS (t
), args
, complain
,
6727 if (e1
== error_mark_node
)
6728 return error_mark_node
;
6730 return TREE_TYPE (e1
);
6740 /* This code should match declare_hidden_char_array in
6742 name
= (*decl_printable_name
) (current_function_decl
, 2);
6743 len
= strlen (name
) + 1;
6744 type
= build_array_type (char_type_node
,
6745 build_index_type (build_int_2 (len
, 0)));
6746 str
= build_string (len
, name
);
6747 TREE_TYPE (str
) = type
;
6752 sorry ("use of `%s' in template",
6753 tree_code_name
[(int) TREE_CODE (t
)]);
6754 return error_mark_node
;
6758 /* Like tsubst, but deals with expressions. This function just replaces
6759 template parms; to finish processing the resultant expression, use
6763 tsubst_copy (t
, args
, complain
, in_decl
)
6768 enum tree_code code
;
6771 if (t
== NULL_TREE
|| t
== error_mark_node
)
6774 code
= TREE_CODE (t
);
6779 return do_identifier (DECL_NAME (t
), 0, NULL_TREE
);
6786 if (!DECL_CONTEXT (t
))
6787 /* This is a global enumeration constant. */
6790 /* Unfortunately, we cannot just call lookup_name here.
6793 template <int I> int f() {
6795 struct S { void g() { E e = a; } };
6798 When we instantiate f<7>::S::g(), say, lookup_name is not
6799 clever enough to find f<7>::a. */
6801 = tsubst_aggr_type (TREE_TYPE (t
), args
, complain
, in_decl
,
6802 /*entering_scope=*/0);
6804 for (v
= TYPE_VALUES (enum_type
);
6807 if (TREE_PURPOSE (v
) == DECL_NAME (t
))
6808 return TREE_VALUE (v
);
6810 /* We didn't find the name. That should never happen; if
6811 name-lookup found it during preliminary parsing, we
6812 should find it again here during instantiation. */
6813 my_friendly_abort (0);
6818 if (DECL_CONTEXT (t
))
6822 ctx
= tsubst_aggr_type (DECL_CONTEXT (t
), args
, complain
, in_decl
,
6823 /*entering_scope=*/1);
6824 if (ctx
!= DECL_CONTEXT (t
))
6825 return lookup_field (ctx
, DECL_NAME (t
), 0, 0);
6831 if (DECL_LANG_SPECIFIC (t
) && DECL_TEMPLATE_INFO (t
))
6832 t
= tsubst (t
, args
, complain
, in_decl
);
6837 if (is_member_template (t
))
6838 return tsubst (t
, args
, complain
, in_decl
);
6844 /* We must tsbust into a LOOKUP_EXPR in case the names to
6845 which it refers is a conversion operator; in that case the
6846 name will change. We avoid making unnecessary copies,
6849 tree id
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
6851 if (id
!= TREE_OPERAND (t
, 0))
6853 r
= build_nt (LOOKUP_EXPR
, id
);
6854 LOOKUP_EXPR_GLOBAL (r
) = LOOKUP_EXPR_GLOBAL (t
);
6862 case REINTERPRET_CAST_EXPR
:
6863 case CONST_CAST_EXPR
:
6864 case STATIC_CAST_EXPR
:
6865 case DYNAMIC_CAST_EXPR
:
6868 (code
, tsubst (TREE_TYPE (t
), args
, complain
, in_decl
),
6869 tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
));
6872 case PREDECREMENT_EXPR
:
6873 case PREINCREMENT_EXPR
:
6874 case POSTDECREMENT_EXPR
:
6875 case POSTINCREMENT_EXPR
:
6877 case TRUTH_NOT_EXPR
:
6880 case CONVERT_EXPR
: /* Unary + */
6889 (code
, tsubst (TREE_TYPE (t
), args
, complain
, in_decl
),
6890 tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
));
6895 case TRUNC_DIV_EXPR
:
6897 case FLOOR_DIV_EXPR
:
6898 case ROUND_DIV_EXPR
:
6899 case EXACT_DIV_EXPR
:
6901 case BIT_ANDTC_EXPR
:
6904 case TRUNC_MOD_EXPR
:
6905 case FLOOR_MOD_EXPR
:
6906 case TRUTH_ANDIF_EXPR
:
6907 case TRUTH_ORIF_EXPR
:
6908 case TRUTH_AND_EXPR
:
6929 (code
, tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
),
6930 tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
));
6934 tree fn
= TREE_OPERAND (t
, 0);
6935 if (is_overloaded_fn (fn
))
6936 fn
= tsubst_copy (get_first_fn (fn
), args
, complain
, in_decl
);
6938 /* Sometimes FN is a LOOKUP_EXPR. */
6939 fn
= tsubst_copy (fn
, args
, complain
, in_decl
);
6941 (code
, fn
, tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
,
6946 case METHOD_CALL_EXPR
:
6948 tree name
= TREE_OPERAND (t
, 0);
6949 if (TREE_CODE (name
) == BIT_NOT_EXPR
)
6951 name
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
6953 name
= build1 (BIT_NOT_EXPR
, NULL_TREE
, name
);
6955 else if (TREE_CODE (name
) == SCOPE_REF
6956 && TREE_CODE (TREE_OPERAND (name
, 1)) == BIT_NOT_EXPR
)
6958 tree base
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
6960 name
= TREE_OPERAND (name
, 1);
6961 name
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
6963 name
= build1 (BIT_NOT_EXPR
, NULL_TREE
, name
);
6964 name
= build_nt (SCOPE_REF
, base
, name
);
6967 name
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
6969 (code
, name
, tsubst_copy (TREE_OPERAND (t
, 1), args
,
6971 tsubst_copy (TREE_OPERAND (t
, 2), args
, complain
, in_decl
),
6976 /* This processing should really occur in tsubst_expr, However,
6977 tsubst_expr does not recurse into expressions, since it
6978 assumes that there aren't any statements inside them.
6979 Instead, it simply calls build_expr_from_tree. So, we need
6980 to expand the STMT_EXPR here. */
6981 if (!processing_template_decl
)
6983 tree stmt_expr
= begin_stmt_expr ();
6984 tsubst_expr (STMT_EXPR_STMT (t
), args
,
6986 return finish_stmt_expr (stmt_expr
);
6993 case PSEUDO_DTOR_EXPR
:
6996 (code
, tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
),
6997 tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
),
6998 tsubst_copy (TREE_OPERAND (t
, 2), args
, complain
, in_decl
));
7005 (code
, tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
),
7006 tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
),
7007 tsubst_copy (TREE_OPERAND (t
, 2), args
, complain
, in_decl
));
7008 NEW_EXPR_USE_GLOBAL (r
) = NEW_EXPR_USE_GLOBAL (t
);
7015 (code
, tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
),
7016 tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
));
7017 DELETE_EXPR_USE_GLOBAL (r
) = DELETE_EXPR_USE_GLOBAL (t
);
7018 DELETE_EXPR_USE_VEC (r
) = DELETE_EXPR_USE_VEC (t
);
7022 case TEMPLATE_ID_EXPR
:
7024 /* Substituted template arguments */
7025 tree targs
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
,
7028 if (targs
&& TREE_CODE (targs
) == TREE_LIST
)
7031 for (chain
= targs
; chain
; chain
= TREE_CHAIN (chain
))
7032 TREE_VALUE (chain
) = maybe_fold_nontype_arg (TREE_VALUE (chain
));
7037 for (i
= 0; i
< TREE_VEC_LENGTH (targs
); ++i
)
7038 TREE_VEC_ELT (targs
, i
)
7039 = maybe_fold_nontype_arg (TREE_VEC_ELT (targs
, i
));
7042 return lookup_template_function
7043 (tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
), targs
);
7048 tree purpose
, value
, chain
;
7050 if (t
== void_list_node
)
7053 purpose
= TREE_PURPOSE (t
);
7055 purpose
= tsubst_copy (purpose
, args
, complain
, in_decl
);
7056 value
= TREE_VALUE (t
);
7058 value
= tsubst_copy (value
, args
, complain
, in_decl
);
7059 chain
= TREE_CHAIN (t
);
7060 if (chain
&& chain
!= void_type_node
)
7061 chain
= tsubst_copy (chain
, args
, complain
, in_decl
);
7062 if (purpose
== TREE_PURPOSE (t
)
7063 && value
== TREE_VALUE (t
)
7064 && chain
== TREE_CHAIN (t
))
7066 return tree_cons (purpose
, value
, chain
);
7073 case TEMPLATE_TYPE_PARM
:
7074 case TEMPLATE_TEMPLATE_PARM
:
7075 case TEMPLATE_PARM_INDEX
:
7077 case REFERENCE_TYPE
:
7084 return tsubst (t
, args
, complain
, in_decl
);
7086 case IDENTIFIER_NODE
:
7087 if (IDENTIFIER_TYPENAME_P (t
))
7089 tree new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
7091 return mangle_conv_op_name_for_type (new_type
);
7093 return (build_typename_overload (new_type
));
7101 (CONSTRUCTOR
, tsubst (TREE_TYPE (t
), args
, complain
, in_decl
),
7102 NULL_TREE
, tsubst_copy (CONSTRUCTOR_ELTS (t
), args
,
7103 complain
, in_decl
));
7104 TREE_HAS_CONSTRUCTOR (r
) = TREE_HAS_CONSTRUCTOR (t
);
7109 return build_va_arg (tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
,
7111 tsubst (TREE_TYPE (t
), args
, complain
, in_decl
));
7114 return tsubst (t
, args
, complain
, in_decl
);
7121 /* Like tsubst_copy, but also does semantic processing. */
7124 tsubst_expr (t
, args
, complain
, in_decl
)
7131 if (t
== NULL_TREE
|| t
== error_mark_node
)
7134 if (processing_template_decl
)
7135 return tsubst_copy (t
, args
, complain
, in_decl
);
7137 switch (TREE_CODE (t
))
7141 finish_named_return_value
7142 (TREE_OPERAND (t
, 0),
7143 tsubst_expr (TREE_OPERAND (t
, 1), args
, /*complain=*/1, in_decl
));
7144 tsubst_expr (TREE_CHAIN (t
), args
, complain
, in_decl
);
7147 case CTOR_INITIALIZER
:
7149 tree member_init_list
;
7150 tree base_init_list
;
7154 = tsubst_initializer_list (TREE_OPERAND (t
, 0), args
);
7156 = tsubst_initializer_list (TREE_OPERAND (t
, 1), args
);
7157 setup_vtbl_ptr (member_init_list
, base_init_list
);
7158 tsubst_expr (TREE_CHAIN (t
), args
, complain
, in_decl
);
7164 finish_return_stmt (tsubst_expr (RETURN_EXPR (t
),
7165 args
, complain
, in_decl
));
7170 finish_expr_stmt (tsubst_expr (EXPR_STMT_EXPR (t
),
7171 args
, complain
, in_decl
));
7180 decl
= DECL_STMT_DECL (t
);
7181 if (TREE_CODE (decl
) == LABEL_DECL
)
7182 finish_label_decl (DECL_NAME (decl
));
7185 init
= DECL_INITIAL (decl
);
7186 decl
= tsubst (decl
, args
, complain
, in_decl
);
7187 init
= tsubst_expr (init
, args
, complain
, in_decl
);
7189 DECL_INITIAL (decl
) = error_mark_node
;
7190 /* By marking the declaration as instantiated, we avoid
7191 trying to instantiate it. Since instantiate_decl can't
7192 handle local variables, and since we've already done
7193 all that needs to be done, that's the right thing to
7195 if (TREE_CODE (decl
) == VAR_DECL
)
7196 DECL_TEMPLATE_INSTANTIATED (decl
) = 1;
7197 maybe_push_decl (decl
);
7198 cp_finish_decl (decl
, init
, NULL_TREE
, 0);
7208 stmt
= begin_for_stmt ();
7209 for (tmp
= FOR_INIT_STMT (t
); tmp
; tmp
= TREE_CHAIN (tmp
))
7210 tsubst_expr (tmp
, args
, complain
, in_decl
);
7211 finish_for_init_stmt (stmt
);
7212 finish_for_cond (tsubst_expr (FOR_COND (t
), args
,
7215 tmp
= tsubst_expr (FOR_EXPR (t
), args
, complain
, in_decl
);
7216 finish_for_expr (tmp
, stmt
);
7217 tsubst_expr (FOR_BODY (t
), args
, complain
, in_decl
);
7218 finish_for_stmt (tmp
, stmt
);
7225 stmt
= begin_while_stmt ();
7226 finish_while_stmt_cond (tsubst_expr (WHILE_COND (t
),
7227 args
, complain
, in_decl
),
7229 tsubst_expr (WHILE_BODY (t
), args
, complain
, in_decl
);
7230 finish_while_stmt (stmt
);
7237 stmt
= begin_do_stmt ();
7238 tsubst_expr (DO_BODY (t
), args
, complain
, in_decl
);
7239 finish_do_body (stmt
);
7240 finish_do_stmt (tsubst_expr (DO_COND (t
), args
,
7251 stmt
= begin_if_stmt ();
7252 finish_if_stmt_cond (tsubst_expr (IF_COND (t
),
7253 args
, complain
, in_decl
),
7256 if (tmp
= THEN_CLAUSE (t
), tmp
)
7258 tsubst_expr (tmp
, args
, complain
, in_decl
);
7259 finish_then_clause (stmt
);
7262 if (tmp
= ELSE_CLAUSE (t
), tmp
)
7264 begin_else_clause ();
7265 tsubst_expr (tmp
, args
, complain
, in_decl
);
7266 finish_else_clause (stmt
);
7278 stmt
= begin_compound_stmt (COMPOUND_STMT_NO_SCOPE (t
));
7279 for (substmt
= COMPOUND_BODY (t
);
7280 substmt
!= NULL_TREE
;
7281 substmt
= TREE_CHAIN (substmt
))
7282 tsubst_expr (substmt
, args
, complain
, in_decl
);
7283 return finish_compound_stmt (COMPOUND_STMT_NO_SCOPE (t
), stmt
);
7289 finish_break_stmt ();
7294 finish_continue_stmt ();
7302 stmt
= begin_switch_stmt ();
7303 val
= tsubst_expr (SWITCH_COND (t
), args
, complain
, in_decl
);
7304 finish_switch_cond (val
, stmt
);
7305 tsubst_expr (SWITCH_BODY (t
), args
, complain
, in_decl
);
7306 finish_switch_stmt (val
, stmt
);
7312 finish_case_label (tsubst_expr (CASE_LOW (t
), args
, complain
, in_decl
),
7313 tsubst_expr (CASE_HIGH (t
), args
, complain
, in_decl
));
7317 lineno
= STMT_LINENO (t
);
7318 finish_label_stmt (DECL_NAME (LABEL_STMT_LABEL (t
)));
7323 t
= GOTO_DESTINATION (t
);
7324 if (TREE_CODE (t
) != LABEL_DECL
)
7325 /* Computed goto's must be tsubst'd into. On the other hand,
7326 non-computed gotos must not be; the identifier in question
7327 will have no binding. */
7328 t
= tsubst_expr (t
, args
, complain
, in_decl
);
7331 finish_goto_stmt (t
);
7336 finish_asm_stmt (ASM_CV_QUAL (t
),
7337 tsubst_expr (ASM_STRING (t
), args
, complain
, in_decl
),
7338 tsubst_expr (ASM_OUTPUTS (t
), args
, complain
, in_decl
),
7339 tsubst_expr (ASM_INPUTS (t
), args
, complain
, in_decl
),
7340 tsubst_expr (ASM_CLOBBERS (t
), args
, complain
,
7348 stmt
= begin_try_block ();
7349 tsubst_expr (TRY_STMTS (t
), args
, complain
, in_decl
);
7350 finish_cleanup_try_block (stmt
);
7351 finish_cleanup (tsubst_expr (TRY_HANDLERS (t
), args
,
7359 if (FN_TRY_BLOCK_P (t
))
7360 stmt
= begin_function_try_block ();
7362 stmt
= begin_try_block ();
7364 tsubst_expr (TRY_STMTS (t
), args
, complain
, in_decl
);
7366 if (FN_TRY_BLOCK_P (t
))
7367 finish_function_try_block (stmt
);
7369 finish_try_block (stmt
);
7371 handler
= TRY_HANDLERS (t
);
7372 for (; handler
; handler
= TREE_CHAIN (handler
))
7373 tsubst_expr (handler
, args
, complain
, in_decl
);
7374 if (FN_TRY_BLOCK_P (t
))
7375 finish_function_handler_sequence (stmt
);
7377 finish_handler_sequence (stmt
);
7387 stmt
= begin_handler ();
7388 if (HANDLER_PARMS (t
))
7390 decl
= DECL_STMT_DECL (HANDLER_PARMS (t
));
7391 decl
= tsubst (decl
, args
, complain
, in_decl
);
7392 /* Prevent instantiate_decl from trying to instantiate
7393 this variable. We've already done all that needs to be
7395 DECL_TEMPLATE_INSTANTIATED (decl
) = 1;
7399 blocks
= finish_handler_parms (decl
, stmt
);
7400 tsubst_expr (HANDLER_BODY (t
), args
, complain
, in_decl
);
7401 finish_handler (blocks
, stmt
);
7408 tsubst (t
, args
, complain
, NULL_TREE
);
7412 return build_expr_from_tree (tsubst_copy (t
, args
, complain
, in_decl
));
7417 /* TMPL is a TEMPLATE_DECL for a cloned constructor or destructor.
7418 Instantiate it with the ARGS. */
7421 instantiate_clone (tmpl
, args
)
7428 /* Instantiated the cloned function, rather than the clone. */
7429 spec
= instantiate_template (DECL_CLONED_FUNCTION (tmpl
), args
);
7431 /* Then, see if we've already cloned the instantiation. */
7432 for (clone
= TREE_CHAIN (spec
);
7433 clone
&& DECL_CLONED_FUNCTION_P (clone
);
7434 clone
= TREE_CHAIN (clone
))
7435 if (DECL_NAME (clone
) == DECL_NAME (tmpl
))
7438 /* If we haven't, do so know. */
7440 clone_function_decl (spec
, /*update_method_vec_p=*/0);
7443 for (clone
= TREE_CHAIN (spec
);
7444 clone
&& DECL_CLONED_FUNCTION_P (clone
);
7445 clone
= TREE_CHAIN (clone
))
7446 if (DECL_NAME (clone
) == DECL_NAME (tmpl
))
7449 /* We should always have found the clone by now. */
7450 my_friendly_abort (20000411);
7454 /* Instantiate the indicated variable or function template TMPL with
7455 the template arguments in TARG_PTR. */
7458 instantiate_template (tmpl
, targ_ptr
)
7459 tree tmpl
, targ_ptr
;
7467 if (tmpl
== error_mark_node
)
7468 return error_mark_node
;
7470 my_friendly_assert (TREE_CODE (tmpl
) == TEMPLATE_DECL
, 283);
7472 /* If this function is a clone, handle it specially. */
7473 if (DECL_CLONED_FUNCTION_P (tmpl
))
7474 return instantiate_clone (tmpl
, targ_ptr
);
7476 /* Check to see if we already have this specialization. */
7477 spec
= retrieve_specialization (tmpl
, targ_ptr
);
7478 if (spec
!= NULL_TREE
)
7481 gen_tmpl
= most_general_template (tmpl
);
7482 if (tmpl
!= gen_tmpl
)
7484 /* The TMPL is a partial instantiation. To get a full set of
7485 arguments we must add the arguments used to perform the
7486 partial instantiation. */
7487 targ_ptr
= add_outermost_template_args (DECL_TI_ARGS (tmpl
),
7490 /* Check to see if we already have this specialization. */
7491 spec
= retrieve_specialization (gen_tmpl
, targ_ptr
);
7492 if (spec
!= NULL_TREE
)
7496 len
= DECL_NTPARMS (gen_tmpl
);
7497 inner_args
= INNERMOST_TEMPLATE_ARGS (targ_ptr
);
7501 tree t
= TREE_VEC_ELT (inner_args
, i
);
7504 tree nt
= target_type (t
);
7505 if (IS_AGGR_TYPE (nt
) && decl_function_context (TYPE_MAIN_DECL (nt
)))
7507 cp_error ("type `%T' composed from a local class is not a valid template-argument", t
);
7508 cp_error (" trying to instantiate `%D'", gen_tmpl
);
7509 return error_mark_node
;
7514 /* substitute template parameters */
7515 fndecl
= tsubst (DECL_TEMPLATE_RESULT (gen_tmpl
),
7516 targ_ptr
, /*complain=*/1, gen_tmpl
);
7517 /* The DECL_TI_TEMPLATE should always be the immediate parent
7518 template, not the most general template. */
7519 DECL_TI_TEMPLATE (fndecl
) = tmpl
;
7521 if (flag_external_templates
)
7522 add_pending_template (fndecl
);
7527 /* Push the name of the class template into the scope of the instantiation. */
7530 overload_template_name (type
)
7533 tree id
= DECL_NAME (CLASSTYPE_TI_TEMPLATE (type
));
7536 if (IDENTIFIER_CLASS_VALUE (id
)
7537 && TREE_TYPE (IDENTIFIER_CLASS_VALUE (id
)) == type
)
7540 decl
= build_decl (TYPE_DECL
, id
, type
);
7541 SET_DECL_ARTIFICIAL (decl
);
7542 pushdecl_class_level (decl
);
7545 /* The FN is a TEMPLATE_DECL for a function. The ARGS are the
7546 arguments that are being used when calling it. TARGS is a vector
7547 into which the deduced template arguments are placed.
7549 Return zero for success, 2 for an incomplete match that doesn't resolve
7550 all the types, and 1 for complete failure. An error message will be
7551 printed only for an incomplete match.
7553 If FN is a conversion operator, RETURN_TYPE is the type desired as
7554 the result of the conversion operator.
7556 TPARMS is a vector of template parameters.
7558 The EXPLICIT_TARGS are explicit template arguments provided via a
7561 The parameter STRICT is one of:
7564 We are deducing arguments for a function call, as in
7568 We are deducing arguments for a conversion function, as in
7572 We are deducing arguments when calculating the partial
7573 ordering between specializations of function or class
7574 templates, as in [temp.func.order] and [temp.class.order],
7575 when doing an explicit instantiation as in [temp.explicit],
7576 when determining an explicit specialization as in
7577 [temp.expl.spec], or when taking the address of a function
7578 template, as in [temp.deduct.funcaddr].
7580 The other arguments are as for type_unification. */
7583 fn_type_unification (fn
, explicit_targs
, targs
, args
, return_type
,
7585 tree fn
, explicit_targs
, targs
, args
, return_type
;
7586 unification_kind_t strict
;
7592 my_friendly_assert (TREE_CODE (fn
) == TEMPLATE_DECL
, 0);
7594 fntype
= TREE_TYPE (fn
);
7599 The specified template arguments must match the template
7600 parameters in kind (i.e., type, nontype, template), and there
7601 must not be more arguments than there are parameters;
7602 otherwise type deduction fails.
7604 Nontype arguments must match the types of the corresponding
7605 nontype template parameters, or must be convertible to the
7606 types of the corresponding nontype parameters as specified in
7607 _temp.arg.nontype_, otherwise type deduction fails.
7609 All references in the function type of the function template
7610 to the corresponding template parameters are replaced by the
7611 specified template argument values. If a substitution in a
7612 template parameter or in the function type of the function
7613 template results in an invalid type, type deduction fails. */
7615 tree converted_args
;
7618 = (coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (fn
),
7619 explicit_targs
, NULL_TREE
, /*complain=*/0,
7620 /*require_all_arguments=*/0));
7621 if (converted_args
== error_mark_node
)
7624 fntype
= tsubst (fntype
, converted_args
, /*complain=*/0, NULL_TREE
);
7625 if (fntype
== error_mark_node
)
7628 /* Place the explicitly specified arguments in TARGS. */
7629 for (i
= 0; i
< TREE_VEC_LENGTH (targs
); i
++)
7630 TREE_VEC_ELT (targs
, i
) = TREE_VEC_ELT (converted_args
, i
);
7633 parms
= TYPE_ARG_TYPES (fntype
);
7635 if (DECL_CONV_FN_P (fn
))
7637 /* This is a template conversion operator. Remove `this', since
7638 we could be comparing conversions from different classes. */
7639 parms
= TREE_CHAIN (parms
);
7640 args
= TREE_CHAIN (args
);
7641 my_friendly_assert (return_type
!= NULL_TREE
, 20000227);
7646 /* We've been given a return type to match, prepend it. */
7647 parms
= tree_cons (NULL_TREE
, TREE_TYPE (fntype
), parms
);
7648 args
= tree_cons (NULL_TREE
, return_type
, args
);
7651 /* We allow incomplete unification without an error message here
7652 because the standard doesn't seem to explicitly prohibit it. Our
7653 callers must be ready to deal with unification failures in any
7655 result
= type_unification_real (DECL_INNERMOST_TEMPLATE_PARMS (fn
),
7656 targs
, parms
, args
, /*subr=*/0,
7657 strict
, /*allow_incomplete*/1);
7660 /* All is well so far. Now, check:
7664 When all template arguments have been deduced, all uses of
7665 template parameters in nondeduced contexts are replaced with
7666 the corresponding deduced argument values. If the
7667 substitution results in an invalid type, as described above,
7668 type deduction fails. */
7669 if (tsubst (TREE_TYPE (fn
), targs
, /*complain=*/0, NULL_TREE
)
7676 /* Adjust types before performing type deduction, as described in
7677 [temp.deduct.call] and [temp.deduct.conv]. The rules in these two
7678 sections are symmetric. PARM is the type of a function parameter
7679 or the return type of the conversion function. ARG is the type of
7680 the argument passed to the call, or the type of the value
7681 intialized with the result of the conversion function. */
7684 maybe_adjust_types_for_deduction (strict
, parm
, arg
)
7685 unification_kind_t strict
;
7696 /* Swap PARM and ARG throughout the remainder of this
7697 function; the handling is precisely symmetric since PARM
7698 will initialize ARG rather than vice versa. */
7706 /* There is nothing to do in this case. */
7710 my_friendly_abort (0);
7713 if (TREE_CODE (*parm
) != REFERENCE_TYPE
)
7715 /* [temp.deduct.call]
7717 If P is not a reference type:
7719 --If A is an array type, the pointer type produced by the
7720 array-to-pointer standard conversion (_conv.array_) is
7721 used in place of A for type deduction; otherwise,
7723 --If A is a function type, the pointer type produced by
7724 the function-to-pointer standard conversion
7725 (_conv.func_) is used in place of A for type deduction;
7728 --If A is a cv-qualified type, the top level
7729 cv-qualifiers of A's type are ignored for type
7731 if (TREE_CODE (*arg
) == ARRAY_TYPE
)
7732 *arg
= build_pointer_type (TREE_TYPE (*arg
));
7733 else if (TREE_CODE (*arg
) == FUNCTION_TYPE
)
7734 *arg
= build_pointer_type (*arg
);
7736 *arg
= TYPE_MAIN_VARIANT (*arg
);
7739 /* [temp.deduct.call]
7741 If P is a cv-qualified type, the top level cv-qualifiers
7742 of P's type are ignored for type deduction. If P is a
7743 reference type, the type referred to by P is used for
7745 *parm
= TYPE_MAIN_VARIANT (*parm
);
7746 if (TREE_CODE (*parm
) == REFERENCE_TYPE
)
7747 *parm
= TREE_TYPE (*parm
);
7750 /* Like type_unfication.
7752 If SUBR is 1, we're being called recursively (to unify the
7753 arguments of a function or method parameter of a function
7757 type_unification_real (tparms
, targs
, parms
, args
, subr
,
7758 strict
, allow_incomplete
)
7759 tree tparms
, targs
, parms
, args
;
7761 unification_kind_t strict
;
7762 int allow_incomplete
;
7766 int ntparms
= TREE_VEC_LENGTH (tparms
);
7769 my_friendly_assert (TREE_CODE (tparms
) == TREE_VEC
, 289);
7770 my_friendly_assert (parms
== NULL_TREE
7771 || TREE_CODE (parms
) == TREE_LIST
, 290);
7772 /* ARGS could be NULL (via a call from parse.y to
7773 build_x_function_call). */
7775 my_friendly_assert (TREE_CODE (args
) == TREE_LIST
, 291);
7776 my_friendly_assert (ntparms
> 0, 292);
7781 sub_strict
= UNIFY_ALLOW_MORE_CV_QUAL
| UNIFY_ALLOW_DERIVED
;
7785 sub_strict
= UNIFY_ALLOW_LESS_CV_QUAL
;
7789 sub_strict
= UNIFY_ALLOW_NONE
;
7793 my_friendly_abort (0);
7797 && parms
!= void_list_node
7799 && args
!= void_list_node
)
7801 parm
= TREE_VALUE (parms
);
7802 parms
= TREE_CHAIN (parms
);
7803 arg
= TREE_VALUE (args
);
7804 args
= TREE_CHAIN (args
);
7806 if (arg
== error_mark_node
)
7808 if (arg
== unknown_type_node
)
7809 /* We can't deduce anything from this, but we might get all the
7810 template args from other function args. */
7813 /* Conversions will be performed on a function argument that
7814 corresponds with a function parameter that contains only
7815 non-deducible template parameters and explicitly specified
7816 template parameters. */
7817 if (! uses_template_parms (parm
))
7822 type
= TREE_TYPE (arg
);
7829 if (strict
== DEDUCE_EXACT
)
7831 if (same_type_p (parm
, type
))
7835 /* It might work; we shouldn't check now, because we might
7836 get into infinite recursion. Overload resolution will
7845 my_friendly_assert (TREE_TYPE (arg
) != NULL_TREE
, 293);
7846 if (type_unknown_p (arg
))
7848 /* [temp.deduct.type] A template-argument can be deduced from
7849 a pointer to function or pointer to member function
7850 argument if the set of overloaded functions does not
7851 contain function templates and at most one of a set of
7852 overloaded functions provides a unique match. */
7854 if (resolve_overloaded_unification
7855 (tparms
, targs
, parm
, arg
, strict
, sub_strict
)
7860 arg
= TREE_TYPE (arg
);
7864 maybe_adjust_types_for_deduction (strict
, &parm
, &arg
);
7866 switch (unify (tparms
, targs
, parm
, arg
, sub_strict
))
7874 /* Fail if we've reached the end of the parm list, and more args
7875 are present, and the parm list isn't variadic. */
7876 if (args
&& args
!= void_list_node
&& parms
== void_list_node
)
7878 /* Fail if parms are left and they don't have default values. */
7880 && parms
!= void_list_node
7881 && TREE_PURPOSE (parms
) == NULL_TREE
)
7884 for (i
= 0; i
< ntparms
; i
++)
7885 if (TREE_VEC_ELT (targs
, i
) == NULL_TREE
)
7887 if (!allow_incomplete
)
7888 error ("incomplete type unification");
7894 /* Subroutine of type_unification_real. Args are like the variables at the
7895 call site. ARG is an overloaded function (or template-id); we try
7896 deducing template args from each of the overloads, and if only one
7897 succeeds, we go with that. Modifies TARGS and returns 0 on success. */
7900 resolve_overloaded_unification (tparms
, targs
, parm
, arg
, strict
,
7902 tree tparms
, targs
, parm
, arg
;
7903 unification_kind_t strict
;
7906 tree tempargs
= copy_node (targs
);
7909 if (TREE_CODE (arg
) == ADDR_EXPR
)
7910 arg
= TREE_OPERAND (arg
, 0);
7912 if (TREE_CODE (arg
) == COMPONENT_REF
)
7913 /* Handle `&x' where `x' is some static or non-static member
7915 arg
= TREE_OPERAND (arg
, 1);
7917 if (TREE_CODE (arg
) == OFFSET_REF
)
7918 arg
= TREE_OPERAND (arg
, 1);
7920 /* Strip baselink information. */
7921 while (TREE_CODE (arg
) == TREE_LIST
)
7922 arg
= TREE_VALUE (arg
);
7924 if (TREE_CODE (arg
) == TEMPLATE_ID_EXPR
)
7926 /* If we got some explicit template args, we need to plug them into
7927 the affected templates before we try to unify, in case the
7928 explicit args will completely resolve the templates in question. */
7930 tree expl_subargs
= TREE_OPERAND (arg
, 1);
7931 arg
= TREE_OPERAND (arg
, 0);
7933 for (; arg
; arg
= OVL_NEXT (arg
))
7935 tree fn
= OVL_CURRENT (arg
);
7938 if (TREE_CODE (fn
) != TEMPLATE_DECL
)
7941 subargs
= get_bindings_overload (fn
, DECL_TEMPLATE_RESULT (fn
),
7945 elem
= tsubst (TREE_TYPE (fn
), subargs
, /*complain=*/0,
7947 if (TREE_CODE (elem
) == METHOD_TYPE
)
7948 elem
= build_ptrmemfunc_type (build_pointer_type (elem
));
7949 good
+= try_one_overload (tparms
, targs
, tempargs
, parm
, elem
,
7950 strict
, sub_strict
);
7954 else if (TREE_CODE (arg
) == OVERLOAD
)
7956 for (; arg
; arg
= OVL_NEXT (arg
))
7958 tree type
= TREE_TYPE (OVL_CURRENT (arg
));
7959 if (TREE_CODE (type
) == METHOD_TYPE
)
7960 type
= build_ptrmemfunc_type (build_pointer_type (type
));
7961 good
+= try_one_overload (tparms
, targs
, tempargs
, parm
,
7963 strict
, sub_strict
);
7967 my_friendly_abort (981006);
7969 /* [temp.deduct.type] A template-argument can be deduced from a pointer
7970 to function or pointer to member function argument if the set of
7971 overloaded functions does not contain function templates and at most
7972 one of a set of overloaded functions provides a unique match.
7974 So if we found multiple possibilities, we return success but don't
7979 int i
= TREE_VEC_LENGTH (targs
);
7981 if (TREE_VEC_ELT (tempargs
, i
))
7982 TREE_VEC_ELT (targs
, i
) = TREE_VEC_ELT (tempargs
, i
);
7990 /* Subroutine of resolve_overloaded_unification; does deduction for a single
7991 overload. Fills TARGS with any deduced arguments, or error_mark_node if
7992 different overloads deduce different arguments for a given parm.
7993 Returns 1 on success. */
7996 try_one_overload (tparms
, orig_targs
, targs
, parm
, arg
, strict
,
7998 tree tparms
, orig_targs
, targs
, parm
, arg
;
7999 unification_kind_t strict
;
8006 /* [temp.deduct.type] A template-argument can be deduced from a pointer
8007 to function or pointer to member function argument if the set of
8008 overloaded functions does not contain function templates and at most
8009 one of a set of overloaded functions provides a unique match.
8011 So if this is a template, just return success. */
8013 if (uses_template_parms (arg
))
8016 maybe_adjust_types_for_deduction (strict
, &parm
, &arg
);
8018 /* We don't copy orig_targs for this because if we have already deduced
8019 some template args from previous args, unify would complain when we
8020 try to deduce a template parameter for the same argument, even though
8021 there isn't really a conflict. */
8022 nargs
= TREE_VEC_LENGTH (targs
);
8023 tempargs
= make_tree_vec (nargs
);
8025 if (unify (tparms
, tempargs
, parm
, arg
, sub_strict
) != 0)
8028 /* First make sure we didn't deduce anything that conflicts with
8029 explicitly specified args. */
8030 for (i
= nargs
; i
--; )
8032 tree elt
= TREE_VEC_ELT (tempargs
, i
);
8033 tree oldelt
= TREE_VEC_ELT (orig_targs
, i
);
8035 if (elt
== NULL_TREE
)
8037 else if (uses_template_parms (elt
))
8039 /* Since we're unifying against ourselves, we will fill in template
8040 args used in the function parm list with our own template parms.
8042 TREE_VEC_ELT (tempargs
, i
) = NULL_TREE
;
8045 else if (oldelt
&& ! template_args_equal (oldelt
, elt
))
8049 for (i
= nargs
; i
--; )
8051 tree elt
= TREE_VEC_ELT (tempargs
, i
);
8054 TREE_VEC_ELT (targs
, i
) = elt
;
8060 /* PARM is a template class (perhaps with unbound template
8061 parameters). ARG is a fully instantiated type. If ARG can be
8062 bound to PARM, return ARG, otherwise return NULL_TREE. TPARMS and
8063 TARGS are as for unify. */
8066 try_class_unification (tparms
, targs
, parm
, arg
)
8075 if (!CLASSTYPE_TEMPLATE_INFO (arg
)
8076 || CLASSTYPE_TI_TEMPLATE (arg
) != CLASSTYPE_TI_TEMPLATE (parm
))
8079 /* We need to make a new template argument vector for the call to
8080 unify. If we used TARGS, we'd clutter it up with the result of
8081 the attempted unification, even if this class didn't work out.
8082 We also don't want to commit ourselves to all the unifications
8083 we've already done, since unification is supposed to be done on
8084 an argument-by-argument basis. In other words, consider the
8085 following pathological case:
8087 template <int I, int J, int K>
8090 template <int I, int J>
8091 struct S<I, J, 2> : public S<I, I, I>, S<J, J, J> {};
8093 template <int I, int J, int K>
8094 void f(S<I, J, K>, S<I, I, I>);
8103 Now, by the time we consider the unification involving `s2', we
8104 already know that we must have `f<0, 0, 0>'. But, even though
8105 `S<0, 1, 2>' is derived from `S<0, 0, 0>', the code is not legal
8106 because there are two ways to unify base classes of S<0, 1, 2>
8107 with S<I, I, I>. If we kept the already deduced knowledge, we
8108 would reject the possibility I=1. */
8109 copy_of_targs
= make_tree_vec (TREE_VEC_LENGTH (targs
));
8110 i
= unify (tparms
, copy_of_targs
, CLASSTYPE_TI_ARGS (parm
),
8111 CLASSTYPE_TI_ARGS (arg
), UNIFY_ALLOW_NONE
);
8113 /* If unification failed, we're done. */
8120 /* Subroutine of get_template_base. RVAL, if non-NULL, is a base we
8121 have alreay discovered to be satisfactory. ARG_BINFO is the binfo
8122 for the base class of ARG that we are currently examining. */
8125 get_template_base_recursive (tparms
, targs
, parm
,
8126 arg_binfo
, rval
, flags
)
8136 tree arg
= BINFO_TYPE (arg_binfo
);
8138 if (!(flags
& GTB_IGNORE_TYPE
))
8140 tree r
= try_class_unification (tparms
, targs
,
8143 /* If there is more than one satisfactory baseclass, then:
8147 If they yield more than one possible deduced A, the type
8151 if (r
&& rval
&& !same_type_p (r
, rval
))
8152 return error_mark_node
;
8157 binfos
= BINFO_BASETYPES (arg_binfo
);
8158 n_baselinks
= binfos
? TREE_VEC_LENGTH (binfos
) : 0;
8160 /* Process base types. */
8161 for (i
= 0; i
< n_baselinks
; i
++)
8163 tree base_binfo
= TREE_VEC_ELT (binfos
, i
);
8166 /* Skip this base, if we've already seen it. */
8167 if (BINFO_MARKED (base_binfo
))
8171 (flags
& GTB_VIA_VIRTUAL
) || TREE_VIA_VIRTUAL (base_binfo
);
8173 /* When searching for a non-virtual, we cannot mark virtually
8176 SET_BINFO_MARKED (base_binfo
);
8178 rval
= get_template_base_recursive (tparms
, targs
,
8182 GTB_VIA_VIRTUAL
* this_virtual
);
8184 /* If we discovered more than one matching base class, we can
8186 if (rval
== error_mark_node
)
8187 return error_mark_node
;
8193 /* Given a template type PARM and a class type ARG, find the unique
8194 base type in ARG that is an instance of PARM. We do not examine
8195 ARG itself; only its base-classes. If there is no appropriate base
8196 class, return NULL_TREE. If there is more than one, return
8197 error_mark_node. PARM may be the type of a partial specialization,
8198 as well as a plain template type. Used by unify. */
8201 get_template_base (tparms
, targs
, parm
, arg
)
8210 my_friendly_assert (IS_AGGR_TYPE_CODE (TREE_CODE (arg
)), 92);
8212 arg_binfo
= TYPE_BINFO (complete_type (arg
));
8213 rval
= get_template_base_recursive (tparms
, targs
,
8218 /* Since get_template_base_recursive marks the bases classes, we
8219 must unmark them here. */
8220 dfs_walk (arg_binfo
, dfs_unmark
, markedp
, 0);
8225 /* Returns the level of DECL, which declares a template parameter. */
8228 template_decl_level (decl
)
8231 switch (TREE_CODE (decl
))
8235 return TEMPLATE_TYPE_LEVEL (TREE_TYPE (decl
));
8238 return TEMPLATE_PARM_LEVEL (DECL_INITIAL (decl
));
8241 my_friendly_abort (0);
8246 /* Decide whether ARG can be unified with PARM, considering only the
8247 cv-qualifiers of each type, given STRICT as documented for unify.
8248 Returns non-zero iff the unification is OK on that basis.*/
8251 check_cv_quals_for_unify (strict
, arg
, parm
)
8256 if (!(strict
& UNIFY_ALLOW_MORE_CV_QUAL
)
8257 && !at_least_as_qualified_p (arg
, parm
))
8260 if (!(strict
& UNIFY_ALLOW_LESS_CV_QUAL
)
8261 && !at_least_as_qualified_p (parm
, arg
))
8267 /* Takes parameters as for type_unification. Returns 0 if the
8268 type deduction suceeds, 1 otherwise. The parameter STRICT is a
8269 bitwise or of the following flags:
8272 Require an exact match between PARM and ARG.
8273 UNIFY_ALLOW_MORE_CV_QUAL:
8274 Allow the deduced ARG to be more cv-qualified than ARG.
8275 UNIFY_ALLOW_LESS_CV_QUAL:
8276 Allow the deduced ARG to be less cv-qualified than ARG.
8277 UNIFY_ALLOW_DERIVED:
8278 Allow the deduced ARG to be a template base class of ARG,
8279 or a pointer to a template base class of the type pointed to by
8281 UNIFY_ALLOW_INTEGER:
8282 Allow any integral type to be deduced. See the TEMPLATE_PARM_INDEX
8283 case for more information. */
8286 unify (tparms
, targs
, parm
, arg
, strict
)
8287 tree tparms
, targs
, parm
, arg
;
8294 /* I don't think this will do the right thing with respect to types.
8295 But the only case I've seen it in so far has been array bounds, where
8296 signedness is the only information lost, and I think that will be
8298 while (TREE_CODE (parm
) == NOP_EXPR
)
8299 parm
= TREE_OPERAND (parm
, 0);
8301 if (arg
== error_mark_node
)
8303 if (arg
== unknown_type_node
)
8304 /* We can't deduce anything from this, but we might get all the
8305 template args from other function args. */
8308 /* If PARM uses template parameters, then we can't bail out here,
8309 even if ARG == PARM, since we won't record unifications for the
8310 template parameters. We might need them if we're trying to
8311 figure out which of two things is more specialized. */
8312 if (arg
== parm
&& !uses_template_parms (parm
))
8315 /* Immediately reject some pairs that won't unify because of
8316 cv-qualification mismatches. */
8317 if (TREE_CODE (arg
) == TREE_CODE (parm
)
8319 /* We check the cv-qualifiers when unifying with template type
8320 parameters below. We want to allow ARG `const T' to unify with
8321 PARM `T' for example, when computing which of two templates
8322 is more specialized, for example. */
8323 && TREE_CODE (arg
) != TEMPLATE_TYPE_PARM
8324 && !check_cv_quals_for_unify (strict
, arg
, parm
))
8327 switch (TREE_CODE (parm
))
8330 /* In a type which contains a nested-name-specifier, template
8331 argument values cannot be deduced for template parameters used
8332 within the nested-name-specifier. */
8335 case TEMPLATE_TYPE_PARM
:
8336 case TEMPLATE_TEMPLATE_PARM
:
8337 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, 0));
8339 if (TEMPLATE_TYPE_LEVEL (parm
)
8340 != template_decl_level (tparm
))
8341 /* The PARM is not one we're trying to unify. Just check
8342 to see if it matches ARG. */
8343 return (TREE_CODE (arg
) == TREE_CODE (parm
)
8344 && same_type_p (parm
, arg
)) ? 0 : 1;
8345 idx
= TEMPLATE_TYPE_IDX (parm
);
8346 targ
= TREE_VEC_ELT (targs
, idx
);
8347 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, idx
));
8349 /* Check for mixed types and values. */
8350 if ((TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
8351 && TREE_CODE (tparm
) != TYPE_DECL
)
8352 || (TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
8353 && TREE_CODE (tparm
) != TEMPLATE_DECL
))
8356 if (TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
)
8358 if (TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (parm
))
8360 /* We arrive here when PARM does not involve template
8363 /* ARG must be constructed from a template class. */
8364 if (TREE_CODE (arg
) != RECORD_TYPE
|| !CLASSTYPE_TEMPLATE_INFO (arg
))
8368 tree parmtmpl
= TYPE_TI_TEMPLATE (parm
);
8369 tree parmvec
= TYPE_TI_ARGS (parm
);
8370 tree argvec
= CLASSTYPE_TI_ARGS (arg
);
8372 = DECL_INNERMOST_TEMPLATE_PARMS (CLASSTYPE_TI_TEMPLATE (arg
));
8375 /* The parameter and argument roles have to be switched here
8376 in order to handle default arguments properly. For example,
8377 template<template <class> class TT> void f(TT<int>)
8378 should be able to accept vector<int> which comes from
8379 template <class T, class Allocator = allocator>
8382 if (coerce_template_parms (argtmplvec
, parmvec
, parmtmpl
, 0, 1)
8386 /* Deduce arguments T, i from TT<T> or TT<i>.
8387 We check each element of PARMVEC and ARGVEC individually
8388 rather than the whole TREE_VEC since they can have
8389 different number of elements. */
8391 for (i
= 0; i
< TREE_VEC_LENGTH (parmvec
); ++i
)
8393 tree t
= TREE_VEC_ELT (parmvec
, i
);
8395 if (unify (tparms
, targs
, t
,
8396 TREE_VEC_ELT (argvec
, i
),
8401 arg
= CLASSTYPE_TI_TEMPLATE (arg
);
8406 /* If PARM is `const T' and ARG is only `int', we don't have
8407 a match unless we are allowing additional qualification.
8408 If ARG is `const int' and PARM is just `T' that's OK;
8409 that binds `const int' to `T'. */
8410 if (!check_cv_quals_for_unify (strict
| UNIFY_ALLOW_LESS_CV_QUAL
,
8414 /* Consider the case where ARG is `const volatile int' and
8415 PARM is `const T'. Then, T should be `volatile int'. */
8417 cp_build_qualified_type_real (arg
,
8419 & ~CP_TYPE_QUALS (parm
),
8421 if (arg
== error_mark_node
)
8425 /* Simple cases: Value already set, does match or doesn't. */
8426 if (targ
!= NULL_TREE
&& same_type_p (targ
, arg
))
8431 /* Make sure that ARG is not a variable-sized array. (Note that
8432 were talking about variable-sized arrays (like `int[n]'),
8433 rather than arrays of unknown size (like `int[]').) We'll
8434 get very confused by such a type since the bound of the array
8435 will not be computable in an instantiation. Besides, such
8436 types are not allowed in ISO C++, so we can do as we please
8438 if (TREE_CODE (arg
) == ARRAY_TYPE
8439 && !uses_template_parms (arg
)
8440 && (TREE_CODE (TYPE_MAX_VALUE (TYPE_DOMAIN (arg
)))
8444 TREE_VEC_ELT (targs
, idx
) = arg
;
8447 case TEMPLATE_PARM_INDEX
:
8448 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, 0));
8450 if (TEMPLATE_PARM_LEVEL (parm
)
8451 != template_decl_level (tparm
))
8452 /* The PARM is not one we're trying to unify. Just check
8453 to see if it matches ARG. */
8454 return (TREE_CODE (arg
) == TREE_CODE (parm
)
8455 && cp_tree_equal (parm
, arg
) > 0) ? 0 : 1;
8457 idx
= TEMPLATE_PARM_IDX (parm
);
8458 targ
= TREE_VEC_ELT (targs
, idx
);
8462 int i
= (cp_tree_equal (targ
, arg
) > 0);
8468 my_friendly_abort (42);
8471 /* [temp.deduct.type] If, in the declaration of a function template
8472 with a non-type template-parameter, the non-type
8473 template-parameter is used in an expression in the function
8474 parameter-list and, if the corresponding template-argument is
8475 deduced, the template-argument type shall match the type of the
8476 template-parameter exactly, except that a template-argument
8477 deduced from an array bound may be of any integral type. */
8478 if (same_type_p (TREE_TYPE (arg
), TREE_TYPE (parm
)))
8480 else if ((strict
& UNIFY_ALLOW_INTEGER
)
8481 && (TREE_CODE (TREE_TYPE (parm
)) == INTEGER_TYPE
8482 || TREE_CODE (TREE_TYPE (parm
)) == BOOLEAN_TYPE
))
8487 TREE_VEC_ELT (targs
, idx
) = arg
;
8494 if (TREE_CODE (arg
) != POINTER_TYPE
)
8497 /* [temp.deduct.call]
8499 A can be another pointer or pointer to member type that can
8500 be converted to the deduced A via a qualification
8501 conversion (_conv.qual_).
8503 We pass down STRICT here rather than UNIFY_ALLOW_NONE.
8504 This will allow for additional cv-qualification of the
8505 pointed-to types if appropriate. In general, this is a bit
8506 too generous; we are only supposed to allow qualification
8507 conversions and this method will allow an ARG of char** and
8508 a deduced ARG of const char**. However, overload
8509 resolution will subsequently invalidate the candidate, so
8510 this is probably OK. */
8511 sub_strict
= strict
;
8513 if (TREE_CODE (TREE_TYPE (arg
)) != RECORD_TYPE
)
8514 /* The derived-to-base conversion only persists through one
8515 level of pointers. */
8516 sub_strict
&= ~UNIFY_ALLOW_DERIVED
;
8518 return unify (tparms
, targs
, TREE_TYPE (parm
),
8519 TREE_TYPE (arg
), sub_strict
);
8522 case REFERENCE_TYPE
:
8523 if (TREE_CODE (arg
) != REFERENCE_TYPE
)
8525 return unify (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
8529 if (TREE_CODE (arg
) != ARRAY_TYPE
)
8531 if ((TYPE_DOMAIN (parm
) == NULL_TREE
)
8532 != (TYPE_DOMAIN (arg
) == NULL_TREE
))
8534 if (TYPE_DOMAIN (parm
) != NULL_TREE
8535 && unify (tparms
, targs
, TYPE_DOMAIN (parm
),
8536 TYPE_DOMAIN (arg
), UNIFY_ALLOW_NONE
) != 0)
8538 return unify (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
8546 if (TREE_CODE (arg
) != TREE_CODE (parm
))
8549 if (TREE_CODE (parm
) == INTEGER_TYPE
8550 && TREE_CODE (TYPE_MAX_VALUE (parm
)) != INTEGER_CST
)
8552 if (TYPE_MIN_VALUE (parm
) && TYPE_MIN_VALUE (arg
)
8553 && unify (tparms
, targs
, TYPE_MIN_VALUE (parm
),
8554 TYPE_MIN_VALUE (arg
), UNIFY_ALLOW_INTEGER
))
8556 if (TYPE_MAX_VALUE (parm
) && TYPE_MAX_VALUE (arg
)
8557 && unify (tparms
, targs
, TYPE_MAX_VALUE (parm
),
8558 TYPE_MAX_VALUE (arg
), UNIFY_ALLOW_INTEGER
))
8561 /* We have already checked cv-qualification at the top of the
8563 else if (!same_type_ignoring_top_level_qualifiers_p (arg
, parm
))
8566 /* As far as unification is concerned, this wins. Later checks
8567 will invalidate it if necessary. */
8570 /* Types INTEGER_CST and MINUS_EXPR can come from array bounds. */
8571 /* Type INTEGER_CST can come from ordinary constant template args. */
8573 while (TREE_CODE (arg
) == NOP_EXPR
)
8574 arg
= TREE_OPERAND (arg
, 0);
8576 if (TREE_CODE (arg
) != INTEGER_CST
)
8578 return !tree_int_cst_equal (parm
, arg
);
8583 if (TREE_CODE (arg
) != TREE_VEC
)
8585 if (TREE_VEC_LENGTH (parm
) != TREE_VEC_LENGTH (arg
))
8587 for (i
= 0; i
< TREE_VEC_LENGTH (parm
); ++i
)
8588 if (unify (tparms
, targs
,
8589 TREE_VEC_ELT (parm
, i
), TREE_VEC_ELT (arg
, i
),
8597 if (TREE_CODE (arg
) != TREE_CODE (parm
))
8600 if (TYPE_PTRMEMFUNC_P (parm
))
8602 if (!TYPE_PTRMEMFUNC_P (arg
))
8605 return unify (tparms
, targs
,
8606 TYPE_PTRMEMFUNC_FN_TYPE (parm
),
8607 TYPE_PTRMEMFUNC_FN_TYPE (arg
),
8611 if (CLASSTYPE_TEMPLATE_INFO (parm
))
8615 if (strict
& UNIFY_ALLOW_DERIVED
)
8617 /* First, we try to unify the PARM and ARG directly. */
8618 t
= try_class_unification (tparms
, targs
,
8623 /* Fallback to the special case allowed in
8626 If P is a class, and P has the form
8627 template-id, then A can be a derived class of
8628 the deduced A. Likewise, if P is a pointer to
8629 a class of the form template-id, A can be a
8630 pointer to a derived class pointed to by the
8632 t
= get_template_base (tparms
, targs
,
8635 if (! t
|| t
== error_mark_node
)
8639 else if (CLASSTYPE_TEMPLATE_INFO (arg
)
8640 && (CLASSTYPE_TI_TEMPLATE (parm
)
8641 == CLASSTYPE_TI_TEMPLATE (arg
)))
8642 /* Perhaps PARM is something like S<U> and ARG is S<int>.
8643 Then, we should unify `int' and `U'. */
8646 /* There's no chance of unication succeeding. */
8649 return unify (tparms
, targs
, CLASSTYPE_TI_ARGS (parm
),
8650 CLASSTYPE_TI_ARGS (t
), UNIFY_ALLOW_NONE
);
8652 else if (!same_type_ignoring_top_level_qualifiers_p (parm
, arg
))
8658 if (TREE_CODE (arg
) != TREE_CODE (parm
))
8661 if (unify (tparms
, targs
, TREE_TYPE (parm
),
8662 TREE_TYPE (arg
), UNIFY_ALLOW_NONE
))
8664 return type_unification_real (tparms
, targs
, TYPE_ARG_TYPES (parm
),
8665 TYPE_ARG_TYPES (arg
), 1,
8669 if (TREE_CODE (arg
) != OFFSET_TYPE
)
8671 if (unify (tparms
, targs
, TYPE_OFFSET_BASETYPE (parm
),
8672 TYPE_OFFSET_BASETYPE (arg
), UNIFY_ALLOW_NONE
))
8674 return unify (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
8678 if (arg
!= decl_constant_value (parm
))
8683 /* Matched cases are handled by the ARG == PARM test above. */
8687 if (TREE_CODE (TREE_OPERAND (parm
, 1)) == INTEGER_CST
)
8689 /* We handle this case specially, since it comes up with
8690 arrays. In particular, something like:
8692 template <int N> void f(int (&x)[N]);
8694 Here, we are trying to unify the range type, which
8695 looks like [0 ... (N - 1)]. */
8697 t1
= TREE_OPERAND (parm
, 0);
8698 t2
= TREE_OPERAND (parm
, 1);
8700 t
= fold (build (PLUS_EXPR
, integer_type_node
, arg
, t2
));
8702 return unify (tparms
, targs
, t1
, t
, strict
);
8704 /* else fall through */
8707 if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (TREE_CODE (parm
))))
8708 /* We're looking at an expression. This can happen with
8712 void foo(S<I>, S<I + 2>);
8714 This is a "nondeduced context":
8718 The nondeduced contexts are:
8720 --A type that is a template-id in which one or more of
8721 the template-arguments is an expression that references
8722 a template-parameter.
8724 In these cases, we assume deduction succeeded, but don't
8725 actually infer any unifications. */
8728 sorry ("use of `%s' in template type unification",
8729 tree_code_name
[(int) TREE_CODE (parm
)]);
8735 /* Called if RESULT is explicitly instantiated, or is a member of an
8736 explicitly instantiated class, or if using -frepo and the
8737 instantiation of RESULT has been assigned to this file. */
8740 mark_decl_instantiated (result
, extern_p
)
8744 if (TREE_CODE (result
) != FUNCTION_DECL
)
8745 /* The TREE_PUBLIC flag for function declarations will have been
8746 set correctly by tsubst. */
8747 TREE_PUBLIC (result
) = 1;
8749 /* We used to set this unconditionally; we moved that to
8750 do_decl_instantiation so it wouldn't get set on members of
8751 explicit class template instantiations. But we still need to set
8752 it here for the 'extern template' case in order to suppress
8753 implicit instantiations. */
8755 SET_DECL_EXPLICIT_INSTANTIATION (result
);
8759 DECL_INTERFACE_KNOWN (result
) = 1;
8760 DECL_NOT_REALLY_EXTERN (result
) = 1;
8762 /* Always make artificials weak. */
8763 if (DECL_ARTIFICIAL (result
) && flag_weak
)
8764 comdat_linkage (result
);
8765 /* For WIN32 we also want to put explicit instantiations in
8766 linkonce sections. */
8767 else if (TREE_PUBLIC (result
))
8768 maybe_make_one_only (result
);
8770 else if (TREE_CODE (result
) == FUNCTION_DECL
)
8774 /* Given two function templates PAT1 and PAT2, and explicit template
8775 arguments EXPLICIT_ARGS return:
8777 1 if PAT1 is more specialized than PAT2 as described in [temp.func.order].
8778 -1 if PAT2 is more specialized than PAT1.
8779 0 if neither is more specialized. */
8782 more_specialized (pat1
, pat2
, explicit_args
)
8783 tree pat1
, pat2
, explicit_args
;
8789 = get_bindings_overload (pat1
, DECL_TEMPLATE_RESULT (pat2
), explicit_args
);
8794 = get_bindings_overload (pat2
, DECL_TEMPLATE_RESULT (pat1
), explicit_args
);
8801 /* Given two class template specialization list nodes PAT1 and PAT2, return:
8803 1 if PAT1 is more specialized than PAT2 as described in [temp.class.order].
8804 -1 if PAT2 is more specialized than PAT1.
8805 0 if neither is more specialized. */
8808 more_specialized_class (pat1
, pat2
)
8814 targs
= get_class_bindings (TREE_VALUE (pat1
), TREE_PURPOSE (pat1
),
8815 TREE_PURPOSE (pat2
));
8819 targs
= get_class_bindings (TREE_VALUE (pat2
), TREE_PURPOSE (pat2
),
8820 TREE_PURPOSE (pat1
));
8827 /* Return the template arguments that will produce the function signature
8828 DECL from the function template FN, with the explicit template
8829 arguments EXPLICIT_ARGS. If CHECK_RETTYPE is 1, the return type must
8830 also match. Return NULL_TREE if no satisfactory arguments could be
8834 get_bindings_real (fn
, decl
, explicit_args
, check_rettype
)
8835 tree fn
, decl
, explicit_args
;
8838 int ntparms
= DECL_NTPARMS (fn
);
8839 tree targs
= make_tree_vec (ntparms
);
8841 tree decl_arg_types
;
8844 /* Substitute the explicit template arguments into the type of DECL.
8845 The call to fn_type_unification will handle substitution into the
8847 decl_type
= TREE_TYPE (decl
);
8848 if (explicit_args
&& uses_template_parms (decl_type
))
8851 tree converted_args
;
8853 if (DECL_TEMPLATE_INFO (decl
))
8854 tmpl
= DECL_TI_TEMPLATE (decl
);
8856 /* We can get here for some illegal specializations. */
8860 = (coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (tmpl
),
8861 explicit_args
, NULL_TREE
,
8863 /*require_all_arguments=*/0));
8864 if (converted_args
== error_mark_node
)
8867 decl_type
= tsubst (decl_type
, converted_args
, /*complain=*/0,
8869 if (decl_type
== error_mark_node
)
8873 /* If FN is a static member function, adjust the type of DECL
8875 decl_arg_types
= TYPE_ARG_TYPES (decl_type
);
8876 if (DECL_STATIC_FUNCTION_P (fn
)
8877 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
8878 decl_arg_types
= TREE_CHAIN (decl_arg_types
);
8880 i
= fn_type_unification (fn
, explicit_args
, targs
,
8882 (check_rettype
|| DECL_CONV_FN_P (fn
)
8883 ? TREE_TYPE (decl_type
) : NULL_TREE
),
8892 /* For most uses, we want to check the return type. */
8895 get_bindings (fn
, decl
, explicit_args
)
8896 tree fn
, decl
, explicit_args
;
8898 return get_bindings_real (fn
, decl
, explicit_args
, 1);
8901 /* But for more_specialized, we only care about the parameter types. */
8904 get_bindings_overload (fn
, decl
, explicit_args
)
8905 tree fn
, decl
, explicit_args
;
8907 return get_bindings_real (fn
, decl
, explicit_args
, 0);
8910 /* Return the innermost template arguments that, when applied to a
8911 template specialization whose innermost template parameters are
8912 TPARMS, and whose specialization arguments are ARGS, yield the
8915 For example, suppose we have:
8917 template <class T, class U> struct S {};
8918 template <class T> struct S<T*, int> {};
8920 Then, suppose we want to get `S<double*, int>'. The TPARMS will be
8921 {T}, the PARMS will be {T*, int} and the ARGS will be {double*,
8922 int}. The resulting vector will be {double}, indicating that `T'
8923 is bound to `double'. */
8926 get_class_bindings (tparms
, parms
, args
)
8927 tree tparms
, parms
, args
;
8929 int i
, ntparms
= TREE_VEC_LENGTH (tparms
);
8930 tree vec
= make_tree_vec (ntparms
);
8932 args
= INNERMOST_TEMPLATE_ARGS (args
);
8934 if (unify (tparms
, vec
, parms
, args
, UNIFY_ALLOW_NONE
))
8937 for (i
= 0; i
< ntparms
; ++i
)
8938 if (! TREE_VEC_ELT (vec
, i
))
8944 /* In INSTANTIATIONS is a list of <INSTANTIATION, TEMPLATE> pairs.
8945 Pick the most specialized template, and return the corresponding
8946 instantiation, or if there is no corresponding instantiation, the
8947 template itself. EXPLICIT_ARGS is any template arguments explicity
8948 mentioned in a template-id. If there is no most specialized
8949 template, error_mark_node is returned. If there are no templates
8950 at all, NULL_TREE is returned. */
8953 most_specialized_instantiation (instantiations
, explicit_args
)
8954 tree instantiations
;
8960 if (!instantiations
)
8963 champ
= instantiations
;
8964 for (fn
= TREE_CHAIN (instantiations
); fn
; fn
= TREE_CHAIN (fn
))
8966 fate
= more_specialized (TREE_VALUE (champ
),
8967 TREE_VALUE (fn
), explicit_args
);
8974 fn
= TREE_CHAIN (fn
);
8976 return error_mark_node
;
8982 for (fn
= instantiations
; fn
&& fn
!= champ
; fn
= TREE_CHAIN (fn
))
8984 fate
= more_specialized (TREE_VALUE (champ
),
8985 TREE_VALUE (fn
), explicit_args
);
8987 return error_mark_node
;
8990 return TREE_PURPOSE (champ
) ? TREE_PURPOSE (champ
) : TREE_VALUE (champ
);
8993 /* Return the most specialized of the list of templates in FNS that can
8994 produce an instantiation matching DECL, given the explicit template
8995 arguments EXPLICIT_ARGS. */
8998 most_specialized (fns
, decl
, explicit_args
)
8999 tree fns
, decl
, explicit_args
;
9001 tree candidates
= NULL_TREE
;
9004 for (fn
= fns
; fn
; fn
= TREE_CHAIN (fn
))
9006 tree candidate
= TREE_VALUE (fn
);
9008 args
= get_bindings (candidate
, decl
, explicit_args
);
9010 candidates
= tree_cons (NULL_TREE
, candidate
, candidates
);
9013 return most_specialized_instantiation (candidates
, explicit_args
);
9016 /* If DECL is a specialization of some template, return the most
9017 general such template. Otherwise, returns NULL_TREE.
9021 template <class T> struct S { template <class U> void f(U); };
9023 if TMPL is `template <class U> void S<int>::f(U)' this will return
9024 the full template. This function will not trace past partial
9025 specializations, however. For example, given in addition:
9027 template <class T> struct S<T*> { template <class U> void f(U); };
9029 if TMPL is `template <class U> void S<int*>::f(U)' this will return
9030 `template <class T> template <class U> S<T*>::f(U)'. */
9033 most_general_template (decl
)
9036 /* If DECL is a FUNCTION_DECL, find the TEMPLATE_DECL of which it is
9037 an immediate specialization. */
9038 if (TREE_CODE (decl
) == FUNCTION_DECL
)
9040 if (DECL_TEMPLATE_INFO (decl
)) {
9041 decl
= DECL_TI_TEMPLATE (decl
);
9043 /* The DECL_TI_TEMPLATE can be an IDENTIFIER_NODE for a
9045 if (TREE_CODE (decl
) != TEMPLATE_DECL
)
9051 /* Look for more and more general templates. */
9052 while (DECL_TEMPLATE_INFO (decl
))
9054 /* The DECL_TI_TEMPLATE can be a LOOKUP_EXPR or IDENTIFIER_NODE
9055 in some cases. (See cp-tree.h for details.) */
9056 if (TREE_CODE (DECL_TI_TEMPLATE (decl
)) != TEMPLATE_DECL
)
9059 /* Stop if we run into an explicitly specialized class template. */
9060 if (!DECL_NAMESPACE_SCOPE_P (decl
)
9061 && DECL_CONTEXT (decl
)
9062 && CLASSTYPE_TEMPLATE_SPECIALIZATION (DECL_CONTEXT (decl
)))
9065 decl
= DECL_TI_TEMPLATE (decl
);
9071 /* Return the most specialized of the class template specializations
9072 of TMPL which can produce an instantiation matching ARGS, or
9073 error_mark_node if the choice is ambiguous. */
9076 most_specialized_class (tmpl
, args
)
9080 tree list
= NULL_TREE
;
9085 tmpl
= most_general_template (tmpl
);
9086 for (t
= DECL_TEMPLATE_SPECIALIZATIONS (tmpl
); t
; t
= TREE_CHAIN (t
))
9089 = get_class_bindings (TREE_VALUE (t
), TREE_PURPOSE (t
), args
);
9092 list
= decl_tree_cons (TREE_PURPOSE (t
), TREE_VALUE (t
), list
);
9093 TREE_TYPE (list
) = TREE_TYPE (t
);
9103 for (; t
; t
= TREE_CHAIN (t
))
9105 fate
= more_specialized_class (champ
, t
);
9114 return error_mark_node
;
9120 for (t
= list
; t
&& t
!= champ
; t
= TREE_CHAIN (t
))
9122 fate
= more_specialized_class (champ
, t
);
9124 return error_mark_node
;
9130 /* called from the parser. */
9133 do_decl_instantiation (declspecs
, declarator
, storage
)
9134 tree declspecs
, declarator
, storage
;
9136 tree decl
= grokdeclarator (declarator
, declspecs
, NORMAL
, 0, NULL_TREE
);
9137 tree result
= NULL_TREE
;
9141 /* An error ocurred, for which grokdeclarator has already issued
9142 an appropriate message. */
9144 else if (! DECL_LANG_SPECIFIC (decl
))
9146 cp_error ("explicit instantiation of non-template `%#D'", decl
);
9149 else if (TREE_CODE (decl
) == VAR_DECL
)
9151 /* There is an asymmetry here in the way VAR_DECLs and
9152 FUNCTION_DECLs are handled by grokdeclarator. In the case of
9153 the latter, the DECL we get back will be marked as a
9154 template instantiation, and the appropriate
9155 DECL_TEMPLATE_INFO will be set up. This does not happen for
9156 VAR_DECLs so we do the lookup here. Probably, grokdeclarator
9157 should handle VAR_DECLs as it currently handles
9159 result
= lookup_field (DECL_CONTEXT (decl
), DECL_NAME (decl
), 0, 0);
9160 if (result
&& TREE_CODE (result
) != VAR_DECL
)
9162 cp_error ("no matching template for `%D' found", result
);
9166 else if (TREE_CODE (decl
) != FUNCTION_DECL
)
9168 cp_error ("explicit instantiation of `%#D'", decl
);
9174 /* Check for various error cases. Note that if the explicit
9175 instantiation is legal the RESULT will currently be marked as an
9176 *implicit* instantiation; DECL_EXPLICIT_INSTANTIATION is not set
9177 until we get here. */
9179 if (DECL_TEMPLATE_SPECIALIZATION (result
))
9183 No program shall both explicitly instantiate and explicitly
9184 specialize a template. */
9185 cp_pedwarn ("explicit instantiation of `%#D' after", result
);
9186 cp_pedwarn_at ("explicit specialization here", result
);
9189 else if (DECL_EXPLICIT_INSTANTIATION (result
))
9193 No program shall explicitly instantiate any template more
9196 We check DECL_INTERFACE_KNOWN so as not to complain when the first
9197 instantiation was `extern' and the second is not, and EXTERN_P for
9198 the opposite case. If -frepo, chances are we already got marked
9199 as an explicit instantion because of the repo file. */
9200 if (DECL_INTERFACE_KNOWN (result
) && !extern_p
&& !flag_use_repository
)
9201 cp_pedwarn ("duplicate explicit instantiation of `%#D'", result
);
9203 /* If we've already instantiated the template, just return now. */
9204 if (DECL_INTERFACE_KNOWN (result
))
9207 else if (!DECL_IMPLICIT_INSTANTIATION (result
))
9209 cp_error ("no matching template for `%D' found", result
);
9212 else if (!DECL_TEMPLATE_INFO (result
))
9214 cp_pedwarn ("explicit instantiation of non-template `%#D'", result
);
9218 if (flag_external_templates
)
9221 if (storage
== NULL_TREE
)
9223 else if (storage
== ridpointers
[(int) RID_EXTERN
])
9226 cp_pedwarn ("ISO C++ forbids the use of `extern' on explicit instantiations");
9230 cp_error ("storage class `%D' applied to template instantiation",
9233 SET_DECL_EXPLICIT_INSTANTIATION (result
);
9234 mark_decl_instantiated (result
, extern_p
);
9235 repo_template_instantiated (result
, extern_p
);
9237 instantiate_decl (result
, /*defer_ok=*/1);
9241 mark_class_instantiated (t
, extern_p
)
9245 SET_CLASSTYPE_EXPLICIT_INSTANTIATION (t
);
9246 SET_CLASSTYPE_INTERFACE_KNOWN (t
);
9247 CLASSTYPE_INTERFACE_ONLY (t
) = extern_p
;
9248 CLASSTYPE_VTABLE_NEEDS_WRITING (t
) = ! extern_p
;
9249 TYPE_DECL_SUPPRESS_DEBUG (TYPE_NAME (t
)) = extern_p
;
9252 CLASSTYPE_DEBUG_REQUESTED (t
) = 1;
9253 rest_of_type_compilation (t
, 1);
9258 do_type_instantiation (t
, storage
)
9265 if (TREE_CODE (t
) == TYPE_DECL
)
9268 if (! CLASS_TYPE_P (t
) || ! CLASSTYPE_TEMPLATE_INFO (t
))
9270 cp_error ("explicit instantiation of non-template type `%T'", t
);
9276 /* With -fexternal-templates, explicit instantiations are treated the same
9277 as implicit ones. */
9278 if (flag_external_templates
)
9281 if (!COMPLETE_TYPE_P (t
))
9283 cp_error ("explicit instantiation of `%#T' before definition of template",
9288 if (storage
!= NULL_TREE
)
9291 cp_pedwarn("ISO C++ forbids the use of `%s' on explicit instantiations",
9292 IDENTIFIER_POINTER (storage
));
9294 if (storage
== ridpointers
[(int) RID_INLINE
])
9296 else if (storage
== ridpointers
[(int) RID_EXTERN
])
9298 else if (storage
== ridpointers
[(int) RID_STATIC
])
9302 cp_error ("storage class `%D' applied to template instantiation",
9308 if (CLASSTYPE_TEMPLATE_SPECIALIZATION (t
))
9312 No program shall both explicitly instantiate and explicitly
9313 specialize a template. */
9314 cp_error ("explicit instantiation of `%#T' after", t
);
9315 cp_error_at ("explicit specialization here", t
);
9318 else if (CLASSTYPE_EXPLICIT_INSTANTIATION (t
))
9322 No program shall explicitly instantiate any template more
9325 If CLASSTYPE_INTERFACE_ONLY, then the first explicit instantiation
9326 was `extern'. If EXTERN_P then the second is. If -frepo, chances
9327 are we already got marked as an explicit instantion because of the
9328 repo file. All these cases are OK. */
9329 if (!CLASSTYPE_INTERFACE_ONLY (t
) && !extern_p
&& !flag_use_repository
)
9330 cp_pedwarn ("duplicate explicit instantiation of `%#T'", t
);
9332 /* If we've already instantiated the template, just return now. */
9333 if (!CLASSTYPE_INTERFACE_ONLY (t
))
9337 mark_class_instantiated (t
, extern_p
);
9338 repo_template_instantiated (t
, extern_p
);
9346 /* In contrast to implicit instantiation, where only the
9347 declarations, and not the definitions, of members are
9348 instantiated, we have here:
9352 The explicit instantiation of a class template specialization
9353 implies the instantiation of all of its members not
9354 previously explicitly specialized in the translation unit
9355 containing the explicit instantiation.
9357 Of course, we can't instantiate member template classes, since
9358 we don't have any arguments for them. Note that the standard
9359 is unclear on whether the instatiation of the members are
9360 *explicit* instantiations or not. We choose to be generous,
9361 and not set DECL_EXPLICIT_INSTANTIATION. Therefore, we allow
9362 the explicit instantiation of a class where some of the members
9363 have no definition in the current translation unit. */
9366 for (tmp
= TYPE_METHODS (t
); tmp
; tmp
= TREE_CHAIN (tmp
))
9367 if (TREE_CODE (tmp
) == FUNCTION_DECL
9368 && DECL_TEMPLATE_INSTANTIATION (tmp
))
9370 mark_decl_instantiated (tmp
, extern_p
);
9371 repo_template_instantiated (tmp
, extern_p
);
9373 instantiate_decl (tmp
, /*defer_ok=*/1);
9376 for (tmp
= TYPE_FIELDS (t
); tmp
; tmp
= TREE_CHAIN (tmp
))
9377 if (TREE_CODE (tmp
) == VAR_DECL
&& DECL_TEMPLATE_INSTANTIATION (tmp
))
9379 mark_decl_instantiated (tmp
, extern_p
);
9380 repo_template_instantiated (tmp
, extern_p
);
9382 instantiate_decl (tmp
, /*defer_ok=*/1);
9385 for (tmp
= CLASSTYPE_TAGS (t
); tmp
; tmp
= TREE_CHAIN (tmp
))
9386 if (IS_AGGR_TYPE (TREE_VALUE (tmp
))
9387 && !uses_template_parms (CLASSTYPE_TI_ARGS (TREE_VALUE (tmp
))))
9388 do_type_instantiation (TYPE_MAIN_DECL (TREE_VALUE (tmp
)), storage
);
9392 /* Given a function DECL, which is a specialization of TMPL, modify
9393 DECL to be a re-instantiation of TMPL with the same template
9394 arguments. TMPL should be the template into which tsubst'ing
9395 should occur for DECL, not the most general template.
9397 One reason for doing this is a scenario like this:
9400 void f(const T&, int i);
9402 void g() { f(3, 7); }
9405 void f(const T& t, const int i) { }
9407 Note that when the template is first instantiated, with
9408 instantiate_template, the resulting DECL will have no name for the
9409 first parameter, and the wrong type for the second. So, when we go
9410 to instantiate the DECL, we regenerate it. */
9413 regenerate_decl_from_template (decl
, tmpl
)
9417 /* The most general version of TMPL. */
9419 /* The arguments used to instantiate DECL, from the most general
9426 args
= DECL_TI_ARGS (decl
);
9427 code_pattern
= DECL_TEMPLATE_RESULT (tmpl
);
9429 /* Unregister the specialization so that when we tsubst we will not
9430 just return DECL. We don't have to unregister DECL from TMPL
9431 because if would only be registered there if it were a partial
9432 instantiation of a specialization, which it isn't: it's a full
9434 gen_tmpl
= most_general_template (tmpl
);
9435 unregistered
= unregister_specialization (decl
, gen_tmpl
);
9437 /* If the DECL was not unregistered then something peculiar is
9438 happening: we created a specialization but did not call
9439 register_specialization for it. */
9440 my_friendly_assert (unregistered
, 0);
9442 if (TREE_CODE (decl
) == VAR_DECL
)
9443 /* Make sure that we can see identifiers, and compute access
9444 correctly, for the class members used in the declaration of
9445 this static variable. */
9446 pushclass (DECL_CONTEXT (decl
), 2);
9448 /* Do the substitution to get the new declaration. */
9449 new_decl
= tsubst (code_pattern
, args
, /*complain=*/1, NULL_TREE
);
9451 if (TREE_CODE (decl
) == VAR_DECL
)
9453 /* Set up DECL_INITIAL, since tsubst doesn't. */
9454 DECL_INITIAL (new_decl
) =
9455 tsubst_expr (DECL_INITIAL (code_pattern
), args
,
9456 /*complain=*/1, DECL_TI_TEMPLATE (decl
));
9457 /* Pop the class context we pushed above. */
9460 else if (TREE_CODE (decl
) == FUNCTION_DECL
)
9462 /* Convince duplicate_decls to use the DECL_ARGUMENTS from the
9464 DECL_INITIAL (new_decl
) = error_mark_node
;
9465 /* And don't complain about a duplicate definition. */
9466 DECL_INITIAL (decl
) = NULL_TREE
;
9469 /* The immediate parent of the new template is still whatever it was
9470 before, even though tsubst sets DECL_TI_TEMPLATE up as the most
9471 general template. We also reset the DECL_ASSEMBLER_NAME since
9472 tsubst always calculates the name as if the function in question
9473 were really a template instance, and sometimes, with friend
9474 functions, this is not so. See tsubst_friend_function for
9476 DECL_TI_TEMPLATE (new_decl
) = DECL_TI_TEMPLATE (decl
);
9477 DECL_ASSEMBLER_NAME (new_decl
) = DECL_ASSEMBLER_NAME (decl
);
9478 DECL_RTL (new_decl
) = DECL_RTL (decl
);
9479 DECL_USE_TEMPLATE (new_decl
) = DECL_USE_TEMPLATE (decl
);
9481 /* Call duplicate decls to merge the old and new declarations. */
9482 duplicate_decls (new_decl
, decl
);
9484 /* Now, re-register the specialization. */
9485 register_specialization (decl
, gen_tmpl
, args
);
9488 /* Produce the definition of D, a _DECL generated from a template. If
9489 DEFER_OK is non-zero, then we don't have to actually do the
9490 instantiation now; we just have to do it sometime. */
9493 instantiate_decl (d
, defer_ok
)
9497 tree tmpl
= DECL_TI_TEMPLATE (d
);
9498 tree args
= DECL_TI_ARGS (d
);
9503 int pattern_defined
;
9505 const char *file
= input_filename
;
9507 /* This function should only be used to instantiate templates for
9508 functions and static member variables. */
9509 my_friendly_assert (TREE_CODE (d
) == FUNCTION_DECL
9510 || TREE_CODE (d
) == VAR_DECL
, 0);
9512 /* Don't instantiate cloned functions. Instead, instantiate the
9513 functions they cloned. */
9514 if (TREE_CODE (d
) == FUNCTION_DECL
&& DECL_CLONED_FUNCTION_P (d
))
9515 d
= DECL_CLONED_FUNCTION (d
);
9517 if (DECL_TEMPLATE_INSTANTIATED (d
))
9518 /* D has already been instantiated. It might seem reasonable to
9519 check whether or not D is an explict instantiation, and, if so,
9520 stop here. But when an explicit instantiation is deferred
9521 until the end of the compilation, DECL_EXPLICIT_INSTANTIATION
9522 is set, even though we still need to do the instantiation. */
9525 /* If we already have a specialization of this declaration, then
9526 there's no reason to instantiate it. Note that
9527 retrieve_specialization gives us both instantiations and
9528 specializations, so we must explicitly check
9529 DECL_TEMPLATE_SPECIALIZATION. */
9530 gen_tmpl
= most_general_template (tmpl
);
9531 spec
= retrieve_specialization (gen_tmpl
, args
);
9532 if (spec
!= NULL_TREE
&& DECL_TEMPLATE_SPECIALIZATION (spec
))
9535 /* This needs to happen before any tsubsting. */
9536 if (! push_tinst_level (d
))
9539 timevar_push (TV_PARSE
);
9541 /* Set TD to the template whose DECL_TEMPLATE_RESULT is the pattern
9542 for the instantiation. This is not always the most general
9543 template. Consider, for example:
9546 struct S { template <class U> void f();
9547 template <> void f<int>(); };
9549 and an instantiation of S<double>::f<int>. We want TD to be the
9550 specialization S<T>::f<int>, not the more general S<T>::f<U>. */
9552 while (/* An instantiation cannot have a definition, so we need a
9553 more general template. */
9554 DECL_TEMPLATE_INSTANTIATION (td
)
9555 /* We must also deal with friend templates. Given:
9557 template <class T> struct S {
9558 template <class U> friend void f() {};
9561 S<int>::f<U> say, is not an instantiation of S<T>::f<U>,
9562 so far as the language is concerned, but that's still
9563 where we get the pattern for the instantiation from. On
9564 ther hand, if the definition comes outside the class, say:
9566 template <class T> struct S {
9567 template <class U> friend void f();
9569 template <class U> friend void f() {}
9571 we don't need to look any further. That's what the check for
9572 DECL_INITIAL is for. */
9573 || (TREE_CODE (d
) == FUNCTION_DECL
9574 && DECL_FRIEND_PSEUDO_TEMPLATE_INSTANTIATION (td
)
9575 && !DECL_INITIAL (DECL_TEMPLATE_RESULT (td
))))
9577 /* The present template, TD, should not be a definition. If it
9578 were a definition, we should be using it! Note that we
9579 cannot restructure the loop to just keep going until we find
9580 a template with a definition, since that might go too far if
9581 a specialization was declared, but not defined. */
9582 my_friendly_assert (!(TREE_CODE (d
) == VAR_DECL
9583 && !DECL_IN_AGGR_P (DECL_TEMPLATE_RESULT (td
))),
9586 /* Fetch the more general template. */
9587 td
= DECL_TI_TEMPLATE (td
);
9590 code_pattern
= DECL_TEMPLATE_RESULT (td
);
9592 if (TREE_CODE (d
) == FUNCTION_DECL
)
9593 pattern_defined
= (DECL_SAVED_TREE (code_pattern
) != NULL_TREE
);
9595 pattern_defined
= ! DECL_IN_AGGR_P (code_pattern
);
9597 push_to_top_level ();
9598 lineno
= DECL_SOURCE_LINE (d
);
9599 input_filename
= DECL_SOURCE_FILE (d
);
9601 if (pattern_defined
)
9603 repo_template_used (d
);
9605 if (flag_external_templates
&& ! DECL_INTERFACE_KNOWN (d
))
9607 if (flag_alt_external_templates
)
9609 if (interface_unknown
)
9610 warn_if_unknown_interface (d
);
9612 else if (DECL_INTERFACE_KNOWN (code_pattern
))
9614 DECL_INTERFACE_KNOWN (d
) = 1;
9615 DECL_NOT_REALLY_EXTERN (d
) = ! DECL_EXTERNAL (code_pattern
);
9618 warn_if_unknown_interface (code_pattern
);
9622 import_export_decl (d
);
9625 /* Reject all external templates except inline functions. */
9626 if (DECL_INTERFACE_KNOWN (d
)
9627 && ! DECL_NOT_REALLY_EXTERN (d
)
9628 && ! (TREE_CODE (d
) == FUNCTION_DECL
&& DECL_INLINE (d
)))
9631 /* We need to set up DECL_INITIAL regardless of pattern_defined if
9632 the variable is a static const initialized in the class body. */
9633 if (TREE_CODE (d
) == VAR_DECL
9634 && TREE_READONLY (d
)
9635 && DECL_INITIAL (d
) == NULL_TREE
9636 && DECL_INITIAL (code_pattern
) != NULL_TREE
)
9638 /* Defer all other templates, unless we have been explicitly
9639 forbidden from doing so. We restore the source position here
9640 because it's used by add_pending_template. */
9641 else if (! pattern_defined
|| defer_ok
)
9644 input_filename
= file
;
9646 if (at_eof
&& !pattern_defined
9647 && DECL_EXPLICIT_INSTANTIATION (d
))
9650 The definition of a non-exported function template, a
9651 non-exported member function template, or a non-exported
9652 member function or static data member of a class template
9653 shall be present in every translation unit in which it is
9654 explicitly instantiated. */
9655 cp_error ("explicit instantiation of `%D' but no definition available",
9658 add_pending_template (d
);
9662 /* We're now committed to instantiating this template. Mark it as
9663 instantiated so that recursive calls to instantiate_decl do not
9664 try to instantiate it again. */
9665 DECL_TEMPLATE_INSTANTIATED (d
) = 1;
9667 /* Regenerate the declaration in case the template has been modified
9668 by a subsequent redeclaration. */
9669 regenerate_decl_from_template (d
, td
);
9671 /* We already set the file and line above. Reset them now in case
9672 they changed as a result of calling regenerate_decl_from_template. */
9673 lineno
= DECL_SOURCE_LINE (d
);
9674 input_filename
= DECL_SOURCE_FILE (d
);
9676 if (TREE_CODE (d
) == VAR_DECL
)
9678 DECL_IN_AGGR_P (d
) = 0;
9679 if (DECL_INTERFACE_KNOWN (d
))
9680 DECL_EXTERNAL (d
) = ! DECL_NOT_REALLY_EXTERN (d
);
9683 DECL_EXTERNAL (d
) = 1;
9684 DECL_NOT_REALLY_EXTERN (d
) = 1;
9686 cp_finish_decl (d
, DECL_INITIAL (d
), NULL_TREE
, 0);
9688 else if (TREE_CODE (d
) == FUNCTION_DECL
)
9690 htab_t saved_local_specializations
;
9692 /* Save away the current list, in case we are instantiating one
9693 template from within the body of another. */
9694 saved_local_specializations
= local_specializations
;
9696 /* Set up the list of local specializations. */
9697 local_specializations
= htab_create (37,
9702 /* Set up context. */
9703 start_function (NULL_TREE
, d
, NULL_TREE
, SF_PRE_PARSED
);
9704 store_parm_decls ();
9706 /* We already set up __FUNCTION__, etc., so we don't want to do
9708 current_function_name_declared
= 1;
9710 /* Substitute into the body of the function. */
9711 tsubst_expr (DECL_SAVED_TREE (code_pattern
), args
,
9712 /*complain=*/1, tmpl
);
9714 /* We don't need the local specializations any more. */
9715 htab_delete (local_specializations
);
9716 local_specializations
= saved_local_specializations
;
9718 /* Finish the function. */
9719 expand_body (finish_function (0));
9722 /* We're not deferring instantiation any more. */
9723 TI_PENDING_TEMPLATE_FLAG (DECL_TEMPLATE_INFO (d
)) = 0;
9727 input_filename
= file
;
9729 pop_from_top_level ();
9732 timevar_pop (TV_PARSE
);
9737 /* Run through the list of templates that we wish we could
9738 instantiate, and instantiate any we can. */
9741 instantiate_pending_templates ()
9744 int instantiated_something
= 0;
9751 t
= &pending_templates
;
9754 tree instantiation
= TREE_VALUE (*t
);
9756 reopen_tinst_level (TREE_PURPOSE (*t
));
9758 if (TYPE_P (instantiation
))
9762 if (!COMPLETE_TYPE_P (instantiation
))
9764 instantiate_class_template (instantiation
);
9765 if (CLASSTYPE_TEMPLATE_INSTANTIATION (instantiation
))
9766 for (fn
= TYPE_METHODS (instantiation
);
9768 fn
= TREE_CHAIN (fn
))
9769 if (! DECL_ARTIFICIAL (fn
))
9770 instantiate_decl (fn
, /*defer_ok=*/0);
9771 if (COMPLETE_TYPE_P (instantiation
))
9773 instantiated_something
= 1;
9778 if (COMPLETE_TYPE_P (instantiation
))
9779 /* If INSTANTIATION has been instantiated, then we don't
9780 need to consider it again in the future. */
9781 *t
= TREE_CHAIN (*t
);
9783 t
= &TREE_CHAIN (*t
);
9787 if (!DECL_TEMPLATE_SPECIALIZATION (instantiation
)
9788 && !DECL_TEMPLATE_INSTANTIATED (instantiation
))
9790 instantiation
= instantiate_decl (instantiation
,
9792 if (DECL_TEMPLATE_INSTANTIATED (instantiation
))
9794 instantiated_something
= 1;
9799 if (DECL_TEMPLATE_SPECIALIZATION (instantiation
)
9800 || DECL_TEMPLATE_INSTANTIATED (instantiation
))
9801 /* If INSTANTIATION has been instantiated, then we don't
9802 need to consider it again in the future. */
9803 *t
= TREE_CHAIN (*t
);
9805 t
= &TREE_CHAIN (*t
);
9810 /* Go through the things that are template instantiations if we are
9811 using guiding declarations. */
9812 t
= &maybe_templates
;
9819 fn
= TREE_VALUE (*t
);
9821 if (DECL_INITIAL (fn
))
9822 /* If the FN is already defined, then it was either already
9823 instantiated or, even though guiding declarations were
9824 allowed, a non-template definition was provided. */
9828 template = TREE_PURPOSE (*t
);
9829 args
= get_bindings (template, fn
, NULL_TREE
);
9830 fn
= instantiate_template (template, args
);
9831 instantiate_decl (fn
, /*defer_ok=*/0);
9835 /* Remove this entry from the chain. */
9836 *t
= TREE_CHAIN (*t
);
9838 maybe_template_tail
= t
;
9842 return instantiated_something
;
9845 /* Substitute ARGVEC into T, which is a list of initializers for
9846 either base class or a non-static data member. The TREE_PURPOSEs
9847 are DECLs, and the TREE_VALUEs are the initializer values. Used by
9848 instantiate_decl. */
9851 tsubst_initializer_list (t
, argvec
)
9854 tree first
= NULL_TREE
;
9857 for (; t
; t
= TREE_CHAIN (t
))
9863 decl
= tsubst_copy (TREE_PURPOSE (t
), argvec
, /*complain=*/1,
9865 init
= tsubst_expr (TREE_VALUE (t
), argvec
, /*complain=*/1,
9870 else if (TREE_CODE (init
) == TREE_LIST
)
9871 for (val
= init
; val
; val
= TREE_CHAIN (val
))
9872 TREE_VALUE (val
) = convert_from_reference (TREE_VALUE (val
));
9874 init
= convert_from_reference (init
);
9876 *p
= build_tree_list (decl
, init
);
9877 p
= &TREE_CHAIN (*p
);
9882 /* D is an undefined function declaration in the presence of templates with
9883 the same name, listed in FNS. If one of them can produce D as an
9884 instantiation, remember this so we can instantiate it at EOF if D has
9885 not been defined by that time. */
9888 add_maybe_template (d
, fns
)
9893 if (DECL_MAYBE_TEMPLATE (d
))
9896 t
= most_specialized (fns
, d
, NULL_TREE
);
9899 if (t
== error_mark_node
)
9901 cp_error ("ambiguous template instantiation for `%D'", d
);
9905 *maybe_template_tail
= tree_cons (t
, d
, NULL_TREE
);
9906 maybe_template_tail
= &TREE_CHAIN (*maybe_template_tail
);
9907 DECL_MAYBE_TEMPLATE (d
) = 1;
9910 /* Set CURRENT_ACCESS_SPECIFIER based on the protection of DECL. */
9913 set_current_access_from_decl (decl
)
9916 if (TREE_PRIVATE (decl
))
9917 current_access_specifier
= access_private_node
;
9918 else if (TREE_PROTECTED (decl
))
9919 current_access_specifier
= access_protected_node
;
9921 current_access_specifier
= access_public_node
;
9924 /* Instantiate an enumerated type. TAG is the template type, NEWTAG
9925 is the instantiation (which should have been created with
9926 start_enum) and ARGS are the template arguments to use. */
9929 tsubst_enum (tag
, newtag
, args
)
9936 for (e
= TYPE_VALUES (tag
); e
; e
= TREE_CHAIN (e
))
9940 /* Note that in a template enum, the TREE_VALUE is the
9941 CONST_DECL, not the corresponding INTEGER_CST. */
9942 value
= tsubst_expr (DECL_INITIAL (TREE_VALUE (e
)),
9943 args
, /*complain=*/1,
9946 /* Give this enumeration constant the correct access. */
9947 set_current_access_from_decl (TREE_VALUE (e
));
9949 /* Actually build the enumerator itself. */
9950 build_enumerator (TREE_PURPOSE (e
), value
, newtag
);
9953 finish_enum (newtag
);
9956 /* DECL is a FUNCTION_DECL that is a template specialization. Return
9957 its type -- but without substituting the innermost set of template
9958 arguments. So, innermost set of template parameters will appear in
9959 the type. If CONTEXTP is non-NULL, then the partially substituted
9960 DECL_CONTEXT (if any) will also be filled in. Similarly, TPARMSP
9961 will be filled in with the substituted template parameters, if it
9965 get_mostly_instantiated_function_type (decl
, contextp
, tparmsp
)
9970 tree context
= NULL_TREE
;
9977 tmpl
= most_general_template (DECL_TI_TEMPLATE (decl
));
9978 targs
= DECL_TI_ARGS (decl
);
9979 tparms
= DECL_TEMPLATE_PARMS (tmpl
);
9980 parm_depth
= TMPL_PARMS_DEPTH (tparms
);
9982 /* There should be as many levels of arguments as there are levels
9984 my_friendly_assert (parm_depth
== TMPL_ARGS_DEPTH (targs
), 0);
9986 fn_type
= TREE_TYPE (tmpl
);
9987 if (DECL_STATIC_FUNCTION_P (decl
))
9988 context
= DECL_CONTEXT (decl
);
9990 if (parm_depth
== 1)
9991 /* No substitution is necessary. */
9998 /* Replace the innermost level of the TARGS with NULL_TREEs to
9999 let tsubst know not to subsitute for those parameters. */
10000 partial_args
= make_tree_vec (TREE_VEC_LENGTH (targs
));
10001 for (i
= 1; i
< TMPL_ARGS_DEPTH (targs
); ++i
)
10002 SET_TMPL_ARGS_LEVEL (partial_args
, i
,
10003 TMPL_ARGS_LEVEL (targs
, i
));
10004 SET_TMPL_ARGS_LEVEL (partial_args
,
10005 TMPL_ARGS_DEPTH (targs
),
10006 make_tree_vec (DECL_NTPARMS (tmpl
)));
10008 /* Now, do the (partial) substitution to figure out the
10009 appropriate function type. */
10010 fn_type
= tsubst (fn_type
, partial_args
, /*complain=*/1, NULL_TREE
);
10011 if (DECL_STATIC_FUNCTION_P (decl
))
10012 context
= tsubst (context
, partial_args
, /*complain=*/1, NULL_TREE
);
10014 /* Substitute into the template parameters to obtain the real
10015 innermost set of parameters. This step is important if the
10016 innermost set of template parameters contains value
10017 parameters whose types depend on outer template parameters. */
10018 TREE_VEC_LENGTH (partial_args
)--;
10019 tparms
= tsubst_template_parms (tparms
, partial_args
, /*complain=*/1);
10023 *contextp
= context
;
10030 /* Set the DECL_ASSEMBLER_NAME for DECL, which is a FUNCTION_DECL that
10031 is either an instantiation or specialization of a template
10035 set_mangled_name_for_template_decl (decl
)
10038 tree context
= NULL_TREE
;
10045 my_friendly_assert (TREE_CODE (decl
) == FUNCTION_DECL
, 0);
10046 my_friendly_assert (DECL_TEMPLATE_INFO (decl
) != NULL_TREE
, 0);
10048 /* Under the new ABI, we don't need special machinery. */
10051 set_mangled_name_for_decl (decl
);
10055 /* The names of template functions must be mangled so as to indicate
10056 what template is being specialized with what template arguments.
10057 For example, each of the following three functions must get
10058 different mangled names:
10061 template <> void f<7>(int);
10062 template <> void f<8>(int); */
10064 targs
= DECL_TI_ARGS (decl
);
10065 if (uses_template_parms (targs
))
10066 /* This DECL is for a partial instantiation. There's no need to
10067 mangle the name of such an entity. */
10070 /* We now compute the PARMS and RET_TYPE to give to
10071 build_decl_overload_real. The PARMS and RET_TYPE are the
10072 parameter and return types of the template, after all but the
10073 innermost template arguments have been substituted, not the
10074 parameter and return types of the function DECL. For example,
10077 template <class T> T f(T);
10079 both PARMS and RET_TYPE should be `T' even if DECL is `int f(int)'.
10080 A more subtle example is:
10082 template <class T> struct S { template <class U> void f(T, U); }
10084 Here, if DECL is `void S<int>::f(int, double)', PARMS should be
10085 {int, U}. Thus, the args that we want to subsitute into the
10086 return and parameter type for the function are those in TARGS,
10087 with the innermost level omitted. */
10088 fn_type
= get_mostly_instantiated_function_type (decl
, &context
, &tparms
);
10090 /* Now, get the innermost parameters and arguments, and figure out
10091 the parameter and return types. */
10092 tparms
= INNERMOST_TEMPLATE_PARMS (tparms
);
10093 targs
= INNERMOST_TEMPLATE_ARGS (targs
);
10094 ret_type
= TREE_TYPE (fn_type
);
10095 parm_types
= TYPE_ARG_TYPES (fn_type
);
10097 /* For a static member function, we generate a fake `this' pointer,
10098 for the purposes of mangling. This indicates of which class the
10099 function is a member. Because of:
10103 There shall not be a static and a nonstatic member function
10104 with the same name and the same parameter types
10106 we don't have to worry that this will result in a clash with a
10107 non-static member function. */
10108 if (DECL_STATIC_FUNCTION_P (decl
))
10109 parm_types
= hash_tree_chain (build_pointer_type (context
), parm_types
);
10111 /* There should be the same number of template parameters as
10112 template arguments. */
10113 my_friendly_assert (TREE_VEC_LENGTH (tparms
) == TREE_VEC_LENGTH (targs
),
10116 /* Actually set the DECL_ASSEMBLER_NAME. */
10117 DECL_ASSEMBLER_NAME (decl
)
10118 = build_decl_overload_real (decl
, parm_types
, ret_type
,
10120 DECL_FUNCTION_MEMBER_P (decl
)
10121 + DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (decl
));