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 if (uses_template_parms (declarator
))
1304 cp_error ("partial specialization `%D' of function template",
1307 cp_error ("template-id `%D' in declaration of primary template",
1312 if (ctype
&& CLASSTYPE_TEMPLATE_INSTANTIATION (ctype
))
1313 /* This is a specialization of a member template, without
1314 specialization the containing class. Something like:
1316 template <class T> struct S {
1317 template <class U> void f (U);
1319 template <> template <class U> void S<int>::f(U) {}
1321 That's a specialization -- but of the entire template. */
1326 my_friendly_abort (20000309);
1329 if (specialization
|| member_specialization
)
1331 tree t
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
1332 for (; t
; t
= TREE_CHAIN (t
))
1333 if (TREE_PURPOSE (t
))
1336 ("default argument specified in explicit specialization");
1339 if (current_lang_name
== lang_name_c
)
1340 cp_error ("template specialization with C linkage");
1343 if (specialization
|| member_specialization
|| explicit_instantiation
)
1345 tree tmpl
= NULL_TREE
;
1346 tree targs
= NULL_TREE
;
1348 /* Make sure that the declarator is a TEMPLATE_ID_EXPR. */
1349 if (TREE_CODE (declarator
) != TEMPLATE_ID_EXPR
)
1353 my_friendly_assert (TREE_CODE (declarator
) == IDENTIFIER_NODE
,
1356 fns
= IDENTIFIER_NAMESPACE_VALUE (dname
);
1361 lookup_template_function (fns
, NULL_TREE
);
1364 if (declarator
== error_mark_node
)
1365 return error_mark_node
;
1367 if (ctype
!= NULL_TREE
&& TYPE_BEING_DEFINED (ctype
))
1369 if (!explicit_instantiation
)
1370 /* A specialization in class scope. This is illegal,
1371 but the error will already have been flagged by
1372 check_specialization_scope. */
1373 return error_mark_node
;
1376 /* It's not legal to write an explicit instantiation in
1379 class C { template void f(); }
1381 This case is caught by the parser. However, on
1384 template class C { void f(); };
1386 (which is illegal) we can get here. The error will be
1393 else if (TREE_CODE (TREE_OPERAND (declarator
, 0)) == LOOKUP_EXPR
)
1395 /* A friend declaration. We can't do much, because we don't
1396 know what this resolves to, yet. */
1397 my_friendly_assert (is_friend
!= 0, 0);
1398 my_friendly_assert (!explicit_instantiation
, 0);
1399 SET_DECL_IMPLICIT_INSTANTIATION (decl
);
1402 else if (ctype
!= NULL_TREE
1403 && (TREE_CODE (TREE_OPERAND (declarator
, 0)) ==
1406 /* Find the list of functions in ctype that have the same
1407 name as the declared function. */
1408 tree name
= TREE_OPERAND (declarator
, 0);
1409 tree fns
= NULL_TREE
;
1412 if (name
== constructor_name (ctype
)
1413 || name
== constructor_name_full (ctype
))
1415 int is_constructor
= DECL_CONSTRUCTOR_P (decl
);
1417 if (is_constructor
? !TYPE_HAS_CONSTRUCTOR (ctype
)
1418 : !TYPE_HAS_DESTRUCTOR (ctype
))
1420 /* From [temp.expl.spec]:
1422 If such an explicit specialization for the member
1423 of a class template names an implicitly-declared
1424 special member function (clause _special_), the
1425 program is ill-formed.
1427 Similar language is found in [temp.explicit]. */
1428 cp_error ("specialization of implicitly-declared special member function");
1429 return error_mark_node
;
1432 name
= is_constructor
? ctor_identifier
: dtor_identifier
;
1435 if (!DECL_CONV_FN_P (decl
))
1437 idx
= lookup_fnfields_1 (ctype
, name
);
1439 fns
= TREE_VEC_ELT (CLASSTYPE_METHOD_VEC (ctype
), idx
);
1445 /* For a type-conversion operator, we cannot do a
1446 name-based lookup. We might be looking for `operator
1447 int' which will be a specialization of `operator T'.
1448 So, we find *all* the conversion operators, and then
1449 select from them. */
1452 methods
= CLASSTYPE_METHOD_VEC (ctype
);
1454 for (idx
= 2; idx
< TREE_VEC_LENGTH (methods
); ++idx
)
1456 tree ovl
= TREE_VEC_ELT (methods
, idx
);
1458 if (!ovl
|| !DECL_CONV_FN_P (OVL_CURRENT (ovl
)))
1459 /* There are no more conversion functions. */
1462 /* Glue all these conversion functions together
1463 with those we already have. */
1464 for (; ovl
; ovl
= OVL_NEXT (ovl
))
1465 fns
= ovl_cons (OVL_CURRENT (ovl
), fns
);
1469 if (fns
== NULL_TREE
)
1471 cp_error ("no member function `%D' declared in `%T'",
1473 return error_mark_node
;
1476 TREE_OPERAND (declarator
, 0) = fns
;
1479 /* Figure out what exactly is being specialized at this point.
1480 Note that for an explicit instantiation, even one for a
1481 member function, we cannot tell apriori whether the
1482 instantiation is for a member template, or just a member
1483 function of a template class. Even if a member template is
1484 being instantiated, the member template arguments may be
1485 elided if they can be deduced from the rest of the
1487 tmpl
= determine_specialization (declarator
, decl
,
1489 member_specialization
);
1491 if (!tmpl
|| tmpl
== error_mark_node
)
1492 /* We couldn't figure out what this declaration was
1494 return error_mark_node
;
1497 tree gen_tmpl
= most_general_template (tmpl
);
1499 if (explicit_instantiation
)
1501 /* We don't set DECL_EXPLICIT_INSTANTIATION here; that
1502 is done by do_decl_instantiation later. */
1504 int arg_depth
= TMPL_ARGS_DEPTH (targs
);
1505 int parm_depth
= TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl
));
1507 if (arg_depth
> parm_depth
)
1509 /* If TMPL is not the most general template (for
1510 example, if TMPL is a friend template that is
1511 injected into namespace scope), then there will
1512 be too many levels fo TARGS. Remove some of them
1517 new_targs
= make_tree_vec (parm_depth
);
1518 for (i
= arg_depth
- parm_depth
; i
< arg_depth
; ++i
)
1519 TREE_VEC_ELT (new_targs
, i
- (arg_depth
- parm_depth
))
1520 = TREE_VEC_ELT (targs
, i
);
1524 return instantiate_template (tmpl
, targs
);
1527 /* If this is a specialization of a member template of a
1528 template class. In we want to return the TEMPLATE_DECL,
1529 not the specialization of it. */
1530 if (tsk
== tsk_template
)
1532 SET_DECL_TEMPLATE_SPECIALIZATION (tmpl
);
1533 DECL_INITIAL (DECL_TEMPLATE_RESULT (tmpl
)) = NULL_TREE
;
1537 /* If we though that the DECL was a member function, but it
1538 turns out to be specializing a static member function,
1539 make DECL a static member function as well. */
1540 if (DECL_STATIC_FUNCTION_P (tmpl
)
1541 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
1543 revert_static_member_fn (decl
);
1544 last_function_parms
= TREE_CHAIN (last_function_parms
);
1547 /* Set up the DECL_TEMPLATE_INFO for DECL. */
1548 DECL_TEMPLATE_INFO (decl
) = tree_cons (tmpl
, targs
, NULL_TREE
);
1550 /* Mangle the function name appropriately. Note that we do
1551 not mangle specializations of non-template member
1552 functions of template classes, e.g. with
1554 template <class T> struct S { void f(); }
1556 and given the specialization
1558 template <> void S<int>::f() {}
1560 we do not mangle S<int>::f() here. That's because it's
1561 just an ordinary member function and doesn't need special
1562 treatment. We do this here so that the ordinary,
1563 non-template, name-mangling algorithm will not be used
1565 if ((is_member_template (tmpl
) || ctype
== NULL_TREE
)
1566 && name_mangling_version
>= 1)
1567 set_mangled_name_for_template_decl (decl
);
1569 if (is_friend
&& !have_def
)
1570 /* This is not really a declaration of a specialization.
1571 It's just the name of an instantiation. But, it's not
1572 a request for an instantiation, either. */
1573 SET_DECL_IMPLICIT_INSTANTIATION (decl
);
1575 /* Register this specialization so that we can find it
1577 decl
= register_specialization (decl
, gen_tmpl
, targs
);
1584 /* TYPE is being declared. Verify that the use of template headers
1585 and such is reasonable. Issue error messages if not. */
1588 maybe_check_template_type (type
)
1591 if (template_header_count
)
1593 /* We are in the scope of some `template <...>' header. */
1596 = template_class_depth_real (TYPE_CONTEXT (type
),
1597 /*count_specializations=*/1);
1599 if (template_header_count
<= context_depth
)
1600 /* This is OK; the template headers are for the context. We
1601 are actually too lenient here; like
1602 check_explicit_specialization we should consider the number
1603 of template types included in the actual declaration. For
1606 template <class T> struct S {
1607 template <class U> template <class V>
1613 template <class T> struct S {
1614 template <class U> struct I;
1617 template <class T> template <class U.
1622 else if (template_header_count
> context_depth
+ 1)
1623 /* There are two many template parameter lists. */
1624 cp_error ("too many template parameter lists in declaration of `%T'", type
);
1628 /* Returns 1 iff PARMS1 and PARMS2 are identical sets of template
1629 parameters. These are represented in the same format used for
1630 DECL_TEMPLATE_PARMS. */
1632 int comp_template_parms (parms1
, parms2
)
1639 if (parms1
== parms2
)
1642 for (p1
= parms1
, p2
= parms2
;
1643 p1
!= NULL_TREE
&& p2
!= NULL_TREE
;
1644 p1
= TREE_CHAIN (p1
), p2
= TREE_CHAIN (p2
))
1646 tree t1
= TREE_VALUE (p1
);
1647 tree t2
= TREE_VALUE (p2
);
1650 my_friendly_assert (TREE_CODE (t1
) == TREE_VEC
, 0);
1651 my_friendly_assert (TREE_CODE (t2
) == TREE_VEC
, 0);
1653 if (TREE_VEC_LENGTH (t1
) != TREE_VEC_LENGTH (t2
))
1656 for (i
= 0; i
< TREE_VEC_LENGTH (t2
); ++i
)
1658 tree parm1
= TREE_VALUE (TREE_VEC_ELT (t1
, i
));
1659 tree parm2
= TREE_VALUE (TREE_VEC_ELT (t2
, i
));
1661 if (TREE_CODE (parm1
) != TREE_CODE (parm2
))
1664 if (TREE_CODE (parm1
) == TEMPLATE_TYPE_PARM
)
1666 else if (!same_type_p (TREE_TYPE (parm1
), TREE_TYPE (parm2
)))
1671 if ((p1
!= NULL_TREE
) != (p2
!= NULL_TREE
))
1672 /* One set of parameters has more parameters lists than the
1679 /* Complain if DECL shadows a template parameter.
1681 [temp.local]: A template-parameter shall not be redeclared within its
1682 scope (including nested scopes). */
1685 check_template_shadow (decl
)
1690 /* If we're not in a template, we can't possibly shadow a template
1692 if (!current_template_parms
)
1695 /* Figure out what we're shadowing. */
1696 if (TREE_CODE (decl
) == OVERLOAD
)
1697 decl
= OVL_CURRENT (decl
);
1698 olddecl
= IDENTIFIER_VALUE (DECL_NAME (decl
));
1700 /* If there's no previous binding for this name, we're not shadowing
1701 anything, let alone a template parameter. */
1705 /* If we're not shadowing a template parameter, we're done. Note
1706 that OLDDECL might be an OVERLOAD (or perhaps even an
1707 ERROR_MARK), so we can't just blithely assume it to be a _DECL
1709 if (!DECL_P (olddecl
) || !DECL_TEMPLATE_PARM_P (olddecl
))
1712 /* We check for decl != olddecl to avoid bogus errors for using a
1713 name inside a class. We check TPFI to avoid duplicate errors for
1714 inline member templates. */
1716 || TEMPLATE_PARMS_FOR_INLINE (current_template_parms
))
1719 cp_error_at ("declaration of `%#D'", decl
);
1720 cp_error_at (" shadows template parm `%#D'", olddecl
);
1723 /* Return a new TEMPLATE_PARM_INDEX with the indicated INDEX, LEVEL,
1724 ORIG_LEVEL, DECL, and TYPE. */
1727 build_template_parm_index (index
, level
, orig_level
, decl
, type
)
1734 tree t
= make_node (TEMPLATE_PARM_INDEX
);
1735 TEMPLATE_PARM_IDX (t
) = index
;
1736 TEMPLATE_PARM_LEVEL (t
) = level
;
1737 TEMPLATE_PARM_ORIG_LEVEL (t
) = orig_level
;
1738 TEMPLATE_PARM_DECL (t
) = decl
;
1739 TREE_TYPE (t
) = type
;
1744 /* Return a TEMPLATE_PARM_INDEX, similar to INDEX, but whose
1745 TEMPLATE_PARM_LEVEL has been decreased by LEVELS. If such a
1746 TEMPLATE_PARM_INDEX already exists, it is returned; otherwise, a
1747 new one is created. */
1750 reduce_template_parm_level (index
, type
, levels
)
1755 if (TEMPLATE_PARM_DESCENDANTS (index
) == NULL_TREE
1756 || (TEMPLATE_PARM_LEVEL (TEMPLATE_PARM_DESCENDANTS (index
))
1757 != TEMPLATE_PARM_LEVEL (index
) - levels
))
1760 = build_decl (TREE_CODE (TEMPLATE_PARM_DECL (index
)),
1761 DECL_NAME (TEMPLATE_PARM_DECL (index
)),
1764 = build_template_parm_index (TEMPLATE_PARM_IDX (index
),
1765 TEMPLATE_PARM_LEVEL (index
) - levels
,
1766 TEMPLATE_PARM_ORIG_LEVEL (index
),
1768 TEMPLATE_PARM_DESCENDANTS (index
) = t
;
1770 /* Template template parameters need this. */
1771 DECL_TEMPLATE_PARMS (decl
)
1772 = DECL_TEMPLATE_PARMS (TEMPLATE_PARM_DECL (index
));
1775 return TEMPLATE_PARM_DESCENDANTS (index
);
1778 /* Process information from new template parameter NEXT and append it to the
1779 LIST being built. */
1782 process_template_parm (list
, next
)
1791 my_friendly_assert (TREE_CODE (parm
) == TREE_LIST
, 259);
1792 defval
= TREE_PURPOSE (parm
);
1793 parm
= TREE_VALUE (parm
);
1794 is_type
= TREE_PURPOSE (parm
) == class_type_node
;
1798 tree p
= TREE_VALUE (tree_last (list
));
1800 if (TREE_CODE (p
) == TYPE_DECL
|| TREE_CODE (p
) == TEMPLATE_DECL
)
1801 idx
= TEMPLATE_TYPE_IDX (TREE_TYPE (p
));
1803 idx
= TEMPLATE_PARM_IDX (DECL_INITIAL (p
));
1811 my_friendly_assert (TREE_CODE (TREE_PURPOSE (parm
)) == TREE_LIST
, 260);
1812 /* is a const-param */
1813 parm
= grokdeclarator (TREE_VALUE (parm
), TREE_PURPOSE (parm
),
1814 PARM
, 0, NULL_TREE
);
1818 The top-level cv-qualifiers on the template-parameter are
1819 ignored when determining its type. */
1820 TREE_TYPE (parm
) = TYPE_MAIN_VARIANT (TREE_TYPE (parm
));
1822 /* A template parameter is not modifiable. */
1823 TREE_READONLY (parm
) = 1;
1824 if (IS_AGGR_TYPE (TREE_TYPE (parm
))
1825 && TREE_CODE (TREE_TYPE (parm
)) != TEMPLATE_TYPE_PARM
1826 && TREE_CODE (TREE_TYPE (parm
)) != TYPENAME_TYPE
)
1828 cp_error ("`%#T' is not a valid type for a template constant parameter",
1830 if (DECL_NAME (parm
) == NULL_TREE
)
1831 error (" a template type parameter must begin with `class' or `typename'");
1832 TREE_TYPE (parm
) = void_type_node
;
1835 && (TREE_CODE (TREE_TYPE (parm
)) == REAL_TYPE
1836 || TREE_CODE (TREE_TYPE (parm
)) == COMPLEX_TYPE
))
1837 cp_pedwarn ("`%T' is not a valid type for a template constant parameter",
1839 decl
= build_decl (CONST_DECL
, DECL_NAME (parm
), TREE_TYPE (parm
));
1840 DECL_INITIAL (parm
) = DECL_INITIAL (decl
)
1841 = build_template_parm_index (idx
, processing_template_decl
,
1842 processing_template_decl
,
1843 decl
, TREE_TYPE (parm
));
1848 parm
= TREE_VALUE (parm
);
1850 if (parm
&& TREE_CODE (parm
) == TEMPLATE_DECL
)
1852 t
= make_aggr_type (TEMPLATE_TEMPLATE_PARM
);
1853 /* This is for distinguishing between real templates and template
1854 template parameters */
1855 TREE_TYPE (parm
) = t
;
1856 TREE_TYPE (DECL_TEMPLATE_RESULT (parm
)) = t
;
1861 t
= make_aggr_type (TEMPLATE_TYPE_PARM
);
1862 /* parm is either IDENTIFIER_NODE or NULL_TREE */
1863 decl
= build_decl (TYPE_DECL
, parm
, t
);
1866 TYPE_NAME (t
) = decl
;
1867 TYPE_STUB_DECL (t
) = decl
;
1869 TEMPLATE_TYPE_PARM_INDEX (t
)
1870 = build_template_parm_index (idx
, processing_template_decl
,
1871 processing_template_decl
,
1872 decl
, TREE_TYPE (parm
));
1874 SET_DECL_ARTIFICIAL (decl
);
1875 SET_DECL_TEMPLATE_PARM_P (decl
);
1877 parm
= build_tree_list (defval
, parm
);
1878 return chainon (list
, parm
);
1881 /* The end of a template parameter list has been reached. Process the
1882 tree list into a parameter vector, converting each parameter into a more
1883 useful form. Type parameters are saved as IDENTIFIER_NODEs, and others
1887 end_template_parm_list (parms
)
1892 tree saved_parmlist
= make_tree_vec (list_length (parms
));
1894 current_template_parms
1895 = tree_cons (build_int_2 (0, processing_template_decl
),
1896 saved_parmlist
, current_template_parms
);
1898 for (parm
= parms
, nparms
= 0;
1900 parm
= TREE_CHAIN (parm
), nparms
++)
1901 TREE_VEC_ELT (saved_parmlist
, nparms
) = parm
;
1903 --processing_template_parmlist
;
1905 return saved_parmlist
;
1908 /* end_template_decl is called after a template declaration is seen. */
1911 end_template_decl ()
1913 reset_specialization ();
1915 if (! processing_template_decl
)
1918 /* This matches the pushlevel in begin_template_parm_list. */
1921 --processing_template_decl
;
1922 current_template_parms
= TREE_CHAIN (current_template_parms
);
1925 /* Given a template argument vector containing the template PARMS.
1926 The innermost PARMS are given first. */
1929 current_template_args ()
1932 tree args
= NULL_TREE
;
1933 int length
= TMPL_PARMS_DEPTH (current_template_parms
);
1936 /* If there is only one level of template parameters, we do not
1937 create a TREE_VEC of TREE_VECs. Instead, we return a single
1938 TREE_VEC containing the arguments. */
1940 args
= make_tree_vec (length
);
1942 for (header
= current_template_parms
; header
; header
= TREE_CHAIN (header
))
1944 tree a
= copy_node (TREE_VALUE (header
));
1947 TREE_TYPE (a
) = NULL_TREE
;
1948 for (i
= TREE_VEC_LENGTH (a
) - 1; i
>= 0; --i
)
1950 tree t
= TREE_VEC_ELT (a
, i
);
1952 /* T will be a list if we are called from within a
1953 begin/end_template_parm_list pair, but a vector directly
1954 if within a begin/end_member_template_processing pair. */
1955 if (TREE_CODE (t
) == TREE_LIST
)
1959 if (TREE_CODE (t
) == TYPE_DECL
1960 || TREE_CODE (t
) == TEMPLATE_DECL
)
1963 t
= DECL_INITIAL (t
);
1964 TREE_VEC_ELT (a
, i
) = t
;
1969 TREE_VEC_ELT (args
, --l
) = a
;
1977 /* Return a TEMPLATE_DECL corresponding to DECL, using the indicated
1978 template PARMS. Used by push_template_decl below. */
1981 build_template_decl (decl
, parms
)
1985 tree tmpl
= build_lang_decl (TEMPLATE_DECL
, DECL_NAME (decl
), NULL_TREE
);
1986 DECL_TEMPLATE_PARMS (tmpl
) = parms
;
1987 DECL_CONTEXT (tmpl
) = DECL_CONTEXT (decl
);
1988 if (DECL_LANG_SPECIFIC (decl
))
1990 DECL_VIRTUAL_CONTEXT (tmpl
) = DECL_VIRTUAL_CONTEXT (decl
);
1991 DECL_STATIC_FUNCTION_P (tmpl
) = DECL_STATIC_FUNCTION_P (decl
);
1992 DECL_CONSTRUCTOR_P (tmpl
) = DECL_CONSTRUCTOR_P (decl
);
1993 DECL_NONCONVERTING_P (tmpl
) = DECL_NONCONVERTING_P (decl
);
1994 DECL_ASSIGNMENT_OPERATOR_P (tmpl
) = DECL_ASSIGNMENT_OPERATOR_P (decl
);
1995 if (DECL_OVERLOADED_OPERATOR_P (decl
))
1996 SET_OVERLOADED_OPERATOR_CODE (tmpl
,
1997 DECL_OVERLOADED_OPERATOR_P (decl
));
2003 struct template_parm_data
2005 /* The level of the template parameters we are currently
2009 /* The index of the specialization argument we are currently
2013 /* An array whose size is the number of template parameters. The
2014 elements are non-zero if the parameter has been used in any one
2015 of the arguments processed so far. */
2018 /* An array whose size is the number of template arguments. The
2019 elements are non-zero if the argument makes use of template
2020 parameters of this level. */
2021 int* arg_uses_template_parms
;
2024 /* Subroutine of push_template_decl used to see if each template
2025 parameter in a partial specialization is used in the explicit
2026 argument list. If T is of the LEVEL given in DATA (which is
2027 treated as a template_parm_data*), then DATA->PARMS is marked
2031 mark_template_parm (t
, data
)
2037 struct template_parm_data
* tpd
= (struct template_parm_data
*) data
;
2039 if (TREE_CODE (t
) == TEMPLATE_PARM_INDEX
)
2041 level
= TEMPLATE_PARM_LEVEL (t
);
2042 idx
= TEMPLATE_PARM_IDX (t
);
2046 level
= TEMPLATE_TYPE_LEVEL (t
);
2047 idx
= TEMPLATE_TYPE_IDX (t
);
2050 if (level
== tpd
->level
)
2052 tpd
->parms
[idx
] = 1;
2053 tpd
->arg_uses_template_parms
[tpd
->current_arg
] = 1;
2056 /* Return zero so that for_each_template_parm will continue the
2057 traversal of the tree; we want to mark *every* template parm. */
2061 /* Process the partial specialization DECL. */
2064 process_partial_specialization (decl
)
2067 tree type
= TREE_TYPE (decl
);
2068 tree maintmpl
= CLASSTYPE_TI_TEMPLATE (type
);
2069 tree specargs
= CLASSTYPE_TI_ARGS (type
);
2070 tree inner_args
= INNERMOST_TEMPLATE_ARGS (specargs
);
2071 tree inner_parms
= INNERMOST_TEMPLATE_PARMS (current_template_parms
);
2072 tree main_inner_parms
= DECL_INNERMOST_TEMPLATE_PARMS (maintmpl
);
2073 int nargs
= TREE_VEC_LENGTH (inner_args
);
2074 int ntparms
= TREE_VEC_LENGTH (inner_parms
);
2076 int did_error_intro
= 0;
2077 struct template_parm_data tpd
;
2078 struct template_parm_data tpd2
;
2080 /* We check that each of the template parameters given in the
2081 partial specialization is used in the argument list to the
2082 specialization. For example:
2084 template <class T> struct S;
2085 template <class T> struct S<T*>;
2087 The second declaration is OK because `T*' uses the template
2088 parameter T, whereas
2090 template <class T> struct S<int>;
2092 is no good. Even trickier is:
2103 The S2<T> declaration is actually illegal; it is a
2104 full-specialization. Of course,
2107 struct S2<T (*)(U)>;
2109 or some such would have been OK. */
2110 tpd
.level
= TMPL_PARMS_DEPTH (current_template_parms
);
2111 tpd
.parms
= alloca (sizeof (int) * ntparms
);
2112 bzero ((PTR
) tpd
.parms
, sizeof (int) * ntparms
);
2114 tpd
.arg_uses_template_parms
= alloca (sizeof (int) * nargs
);
2115 bzero ((PTR
) tpd
.arg_uses_template_parms
, sizeof (int) * nargs
);
2116 for (i
= 0; i
< nargs
; ++i
)
2118 tpd
.current_arg
= i
;
2119 for_each_template_parm (TREE_VEC_ELT (inner_args
, i
),
2120 &mark_template_parm
,
2123 for (i
= 0; i
< ntparms
; ++i
)
2124 if (tpd
.parms
[i
] == 0)
2126 /* One of the template parms was not used in the
2128 if (!did_error_intro
)
2130 cp_error ("template parameters not used in partial specialization:");
2131 did_error_intro
= 1;
2135 TREE_VALUE (TREE_VEC_ELT (inner_parms
, i
)));
2138 /* [temp.class.spec]
2140 The argument list of the specialization shall not be identical to
2141 the implicit argument list of the primary template. */
2142 if (comp_template_args
2144 INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (TREE_TYPE
2146 cp_error ("partial specialization `%T' does not specialize any template arguments", type
);
2148 /* [temp.class.spec]
2150 A partially specialized non-type argument expression shall not
2151 involve template parameters of the partial specialization except
2152 when the argument expression is a simple identifier.
2154 The type of a template parameter corresponding to a specialized
2155 non-type argument shall not be dependent on a parameter of the
2157 my_friendly_assert (nargs
== DECL_NTPARMS (maintmpl
), 0);
2159 for (i
= 0; i
< nargs
; ++i
)
2161 tree arg
= TREE_VEC_ELT (inner_args
, i
);
2162 if (/* These first two lines are the `non-type' bit. */
2164 && TREE_CODE (arg
) != TEMPLATE_DECL
2165 /* This next line is the `argument expression is not just a
2166 simple identifier' condition and also the `specialized
2167 non-type argument' bit. */
2168 && TREE_CODE (arg
) != TEMPLATE_PARM_INDEX
)
2170 if (tpd
.arg_uses_template_parms
[i
])
2171 cp_error ("template argument `%E' involves template parameter(s)", arg
);
2174 /* Look at the corresponding template parameter,
2175 marking which template parameters its type depends
2178 TREE_TYPE (TREE_VALUE (TREE_VEC_ELT (main_inner_parms
,
2183 /* We haven't yet initialized TPD2. Do so now. */
2184 tpd2
.arg_uses_template_parms
2185 = (int*) alloca (sizeof (int) * nargs
);
2186 /* The number of parameters here is the number in the
2187 main template, which, as checked in the assertion
2189 tpd2
.parms
= (int*) alloca (sizeof (int) * nargs
);
2191 TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (maintmpl
));
2194 /* Mark the template parameters. But this time, we're
2195 looking for the template parameters of the main
2196 template, not in the specialization. */
2197 tpd2
.current_arg
= i
;
2198 tpd2
.arg_uses_template_parms
[i
] = 0;
2199 bzero ((PTR
) tpd2
.parms
, sizeof (int) * nargs
);
2200 for_each_template_parm (type
,
2201 &mark_template_parm
,
2204 if (tpd2
.arg_uses_template_parms
[i
])
2206 /* The type depended on some template parameters.
2207 If they are fully specialized in the
2208 specialization, that's OK. */
2210 for (j
= 0; j
< nargs
; ++j
)
2211 if (tpd2
.parms
[j
] != 0
2212 && tpd
.arg_uses_template_parms
[j
])
2214 cp_error ("type `%T' of template argument `%E' depends on template parameter(s)",
2224 if (retrieve_specialization (maintmpl
, specargs
))
2225 /* We've already got this specialization. */
2228 DECL_TEMPLATE_SPECIALIZATIONS (maintmpl
)
2229 = tree_cons (inner_args
, inner_parms
,
2230 DECL_TEMPLATE_SPECIALIZATIONS (maintmpl
));
2231 TREE_TYPE (DECL_TEMPLATE_SPECIALIZATIONS (maintmpl
)) = type
;
2235 /* Check that a template declaration's use of default arguments is not
2236 invalid. Here, PARMS are the template parameters. IS_PRIMARY is
2237 non-zero if DECL is the thing declared by a primary template.
2238 IS_PARTIAL is non-zero if DECL is a partial specialization. */
2241 check_default_tmpl_args (decl
, parms
, is_primary
, is_partial
)
2248 int last_level_to_check
;
2253 A default template-argument shall not be specified in a
2254 function template declaration or a function template definition, nor
2255 in the template-parameter-list of the definition of a member of a
2258 if (TREE_CODE (CP_DECL_CONTEXT (decl
)) == FUNCTION_DECL
)
2259 /* You can't have a function template declaration in a local
2260 scope, nor you can you define a member of a class template in a
2264 if (current_class_type
2265 && !TYPE_BEING_DEFINED (current_class_type
)
2266 && DECL_LANG_SPECIFIC (decl
)
2267 /* If this is either a friend defined in the scope of the class
2268 or a member function. */
2269 && ((DECL_CONTEXT (decl
)
2270 && same_type_p (DECL_CONTEXT (decl
), current_class_type
))
2271 || (DECL_FRIEND_CONTEXT (decl
)
2272 && same_type_p (DECL_FRIEND_CONTEXT (decl
),
2273 current_class_type
)))
2274 /* And, if it was a member function, it really was defined in
2275 the scope of the class. */
2276 && (!DECL_FUNCTION_MEMBER_P (decl
) || DECL_DEFINED_IN_CLASS_P (decl
)))
2277 /* We already checked these parameters when the template was
2278 declared, so there's no need to do it again now. This function
2279 was defined in class scope, but we're processing it's body now
2280 that the class is complete. */
2285 If a template-parameter has a default template-argument, all
2286 subsequent template-parameters shall have a default
2287 template-argument supplied. */
2288 for (parm_level
= parms
; parm_level
; parm_level
= TREE_CHAIN (parm_level
))
2290 tree inner_parms
= TREE_VALUE (parm_level
);
2291 int ntparms
= TREE_VEC_LENGTH (inner_parms
);
2292 int seen_def_arg_p
= 0;
2295 for (i
= 0; i
< ntparms
; ++i
)
2297 tree parm
= TREE_VEC_ELT (inner_parms
, i
);
2298 if (TREE_PURPOSE (parm
))
2300 else if (seen_def_arg_p
)
2302 cp_error ("no default argument for `%D'", TREE_VALUE (parm
));
2303 /* For better subsequent error-recovery, we indicate that
2304 there should have been a default argument. */
2305 TREE_PURPOSE (parm
) = error_mark_node
;
2310 if (TREE_CODE (decl
) != TYPE_DECL
|| is_partial
|| !is_primary
)
2311 /* For an ordinary class template, default template arguments are
2312 allowed at the innermost level, e.g.:
2313 template <class T = int>
2315 but, in a partial specialization, they're not allowed even
2316 there, as we have in [temp.class.spec]:
2318 The template parameter list of a specialization shall not
2319 contain default template argument values.
2321 So, for a partial specialization, or for a function template,
2322 we look at all of them. */
2325 /* But, for a primary class template that is not a partial
2326 specialization we look at all template parameters except the
2328 parms
= TREE_CHAIN (parms
);
2330 /* Figure out what error message to issue. */
2331 if (TREE_CODE (decl
) == FUNCTION_DECL
)
2332 msg
= "default argument for template parameter in function template `%D'";
2333 else if (is_partial
)
2334 msg
= "default argument in partial specialization `%D'";
2336 msg
= "default argument for template parameter for class enclosing `%D'";
2338 if (current_class_type
&& TYPE_BEING_DEFINED (current_class_type
))
2339 /* If we're inside a class definition, there's no need to
2340 examine the parameters to the class itself. On the one
2341 hand, they will be checked when the class is defined, and,
2342 on the other, default arguments are legal in things like:
2343 template <class T = double>
2344 struct S { template <class U> void f(U); };
2345 Here the default argument for `S' has no bearing on the
2346 declaration of `f'. */
2347 last_level_to_check
= template_class_depth (current_class_type
) + 1;
2349 /* Check everything. */
2350 last_level_to_check
= 0;
2352 for (parm_level
= parms
;
2353 parm_level
&& TMPL_PARMS_DEPTH (parm_level
) >= last_level_to_check
;
2354 parm_level
= TREE_CHAIN (parm_level
))
2356 tree inner_parms
= TREE_VALUE (parm_level
);
2360 ntparms
= TREE_VEC_LENGTH (inner_parms
);
2361 for (i
= 0; i
< ntparms
; ++i
)
2362 if (TREE_PURPOSE (TREE_VEC_ELT (inner_parms
, i
)))
2366 cp_error (msg
, decl
);
2370 /* Clear out the default argument so that we are not
2372 TREE_PURPOSE (TREE_VEC_ELT (inner_parms
, i
)) = NULL_TREE
;
2375 /* At this point, if we're still interested in issuing messages,
2376 they must apply to classes surrounding the object declared. */
2378 msg
= "default argument for template parameter for class enclosing `%D'";
2382 /* Creates a TEMPLATE_DECL for the indicated DECL using the template
2383 parameters given by current_template_args, or reuses a
2384 previously existing one, if appropriate. Returns the DECL, or an
2385 equivalent one, if it is replaced via a call to duplicate_decls.
2387 If IS_FRIEND is non-zero, DECL is a friend declaration. */
2390 push_template_decl_real (decl
, is_friend
)
2400 int new_template_p
= 0;
2402 /* See if this is a partial specialization. */
2403 is_partial
= (DECL_IMPLICIT_TYPEDEF_P (decl
)
2404 && TREE_CODE (TREE_TYPE (decl
)) != ENUMERAL_TYPE
2405 && CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_TYPE (decl
)));
2407 is_friend
|= (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_FRIEND_P (decl
));
2410 /* For a friend, we want the context of the friend function, not
2411 the type of which it is a friend. */
2412 ctx
= DECL_CONTEXT (decl
);
2413 else if (CP_DECL_CONTEXT (decl
)
2414 && TREE_CODE (CP_DECL_CONTEXT (decl
)) != NAMESPACE_DECL
)
2415 /* In the case of a virtual function, we want the class in which
2417 ctx
= CP_DECL_CONTEXT (decl
);
2419 /* Otherwise, if we're currently definining some class, the DECL
2420 is assumed to be a member of the class. */
2421 ctx
= current_scope ();
2423 if (ctx
&& TREE_CODE (ctx
) == NAMESPACE_DECL
)
2426 if (!DECL_CONTEXT (decl
))
2427 DECL_CONTEXT (decl
) = FROB_CONTEXT (current_namespace
);
2429 /* See if this is a primary template. */
2430 primary
= template_parm_scope_p ();
2434 if (current_lang_name
== lang_name_c
)
2435 cp_error ("template with C linkage");
2436 else if (TREE_CODE (decl
) == TYPE_DECL
2437 && ANON_AGGRNAME_P (DECL_NAME (decl
)))
2438 cp_error ("template class without a name");
2439 else if ((DECL_IMPLICIT_TYPEDEF_P (decl
)
2440 && CLASS_TYPE_P (TREE_TYPE (decl
)))
2441 || (TREE_CODE (decl
) == VAR_DECL
&& ctx
&& CLASS_TYPE_P (ctx
))
2442 || TREE_CODE (decl
) == FUNCTION_DECL
)
2445 cp_error ("template declaration of `%#D'", decl
);
2448 /* Check to see that the rules regarding the use of default
2449 arguments are not being violated. */
2450 check_default_tmpl_args (decl
, current_template_parms
,
2451 primary
, is_partial
);
2454 return process_partial_specialization (decl
);
2456 args
= current_template_args ();
2459 || TREE_CODE (ctx
) == FUNCTION_DECL
2460 || TYPE_BEING_DEFINED (ctx
)
2461 || (is_friend
&& !DECL_TEMPLATE_INFO (decl
)))
2463 if (DECL_LANG_SPECIFIC (decl
)
2464 && DECL_TEMPLATE_INFO (decl
)
2465 && DECL_TI_TEMPLATE (decl
))
2466 tmpl
= DECL_TI_TEMPLATE (decl
);
2467 /* If DECL is a TYPE_DECL for a class-template, then there won't
2468 be DECL_LANG_SPECIFIC. The information equivalent to
2469 DECL_TEMPLATE_INFO is found in TYPE_TEMPLATE_INFO instead. */
2470 else if (DECL_IMPLICIT_TYPEDEF_P (decl
)
2471 && TYPE_TEMPLATE_INFO (TREE_TYPE (decl
))
2472 && TYPE_TI_TEMPLATE (TREE_TYPE (decl
)))
2474 /* Since a template declaration already existed for this
2475 class-type, we must be redeclaring it here. Make sure
2476 that the redeclaration is legal. */
2477 redeclare_class_template (TREE_TYPE (decl
),
2478 current_template_parms
);
2479 /* We don't need to create a new TEMPLATE_DECL; just use the
2480 one we already had. */
2481 tmpl
= TYPE_TI_TEMPLATE (TREE_TYPE (decl
));
2485 tmpl
= build_template_decl (decl
, current_template_parms
);
2488 if (DECL_LANG_SPECIFIC (decl
)
2489 && DECL_TEMPLATE_SPECIALIZATION (decl
))
2491 /* A specialization of a member template of a template
2493 SET_DECL_TEMPLATE_SPECIALIZATION (tmpl
);
2494 DECL_TEMPLATE_INFO (tmpl
) = DECL_TEMPLATE_INFO (decl
);
2495 DECL_TEMPLATE_INFO (decl
) = NULL_TREE
;
2501 tree a
, t
, current
, parms
;
2504 if (TREE_CODE (decl
) == TYPE_DECL
)
2506 if ((IS_AGGR_TYPE_CODE (TREE_CODE (TREE_TYPE (decl
)))
2507 || TREE_CODE (TREE_TYPE (decl
)) == ENUMERAL_TYPE
)
2508 && TYPE_TEMPLATE_INFO (TREE_TYPE (decl
))
2509 && TYPE_TI_TEMPLATE (TREE_TYPE (decl
)))
2510 tmpl
= TYPE_TI_TEMPLATE (TREE_TYPE (decl
));
2513 cp_error ("`%D' does not declare a template type", decl
);
2517 else if (! DECL_TEMPLATE_INFO (decl
))
2519 cp_error ("template definition of non-template `%#D'", decl
);
2523 tmpl
= DECL_TI_TEMPLATE (decl
);
2525 if (is_member_template (tmpl
)
2526 && DECL_FUNCTION_TEMPLATE_P (tmpl
)
2527 && DECL_TEMPLATE_INFO (decl
) && DECL_TI_ARGS (decl
)
2528 && DECL_TEMPLATE_SPECIALIZATION (decl
))
2532 /* The declaration is a specialization of a member
2533 template, declared outside the class. Therefore, the
2534 innermost template arguments will be NULL, so we
2535 replace them with the arguments determined by the
2536 earlier call to check_explicit_specialization. */
2537 args
= DECL_TI_ARGS (decl
);
2540 = build_template_decl (decl
, current_template_parms
);
2541 DECL_TEMPLATE_RESULT (new_tmpl
) = decl
;
2542 TREE_TYPE (new_tmpl
) = TREE_TYPE (decl
);
2543 DECL_TI_TEMPLATE (decl
) = new_tmpl
;
2544 SET_DECL_TEMPLATE_SPECIALIZATION (new_tmpl
);
2545 DECL_TEMPLATE_INFO (new_tmpl
)
2546 = tree_cons (tmpl
, args
, NULL_TREE
);
2548 register_specialization (new_tmpl
,
2549 most_general_template (tmpl
),
2554 /* Make sure the template headers we got make sense. */
2556 parms
= DECL_TEMPLATE_PARMS (tmpl
);
2557 i
= TMPL_PARMS_DEPTH (parms
);
2558 if (TMPL_ARGS_DEPTH (args
) != i
)
2560 cp_error ("expected %d levels of template parms for `%#D', got %d",
2561 i
, decl
, TMPL_ARGS_DEPTH (args
));
2564 for (current
= decl
; i
> 0; --i
, parms
= TREE_CHAIN (parms
))
2566 a
= TMPL_ARGS_LEVEL (args
, i
);
2567 t
= INNERMOST_TEMPLATE_PARMS (parms
);
2569 if (TREE_VEC_LENGTH (t
) != TREE_VEC_LENGTH (a
))
2571 if (current
== decl
)
2572 cp_error ("got %d template parameters for `%#D'",
2573 TREE_VEC_LENGTH (a
), decl
);
2575 cp_error ("got %d template parameters for `%#T'",
2576 TREE_VEC_LENGTH (a
), current
);
2577 cp_error (" but %d required", TREE_VEC_LENGTH (t
));
2580 /* Perhaps we should also check that the parms are used in the
2581 appropriate qualifying scopes in the declarator? */
2583 if (current
== decl
)
2586 current
= TYPE_CONTEXT (current
);
2590 DECL_TEMPLATE_RESULT (tmpl
) = decl
;
2591 TREE_TYPE (tmpl
) = TREE_TYPE (decl
);
2593 /* Push template declarations for global functions and types. Note
2594 that we do not try to push a global template friend declared in a
2595 template class; such a thing may well depend on the template
2596 parameters of the class. */
2597 if (new_template_p
&& !ctx
2598 && !(is_friend
&& template_class_depth (current_class_type
) > 0))
2599 tmpl
= pushdecl_namespace_level (tmpl
);
2602 DECL_PRIMARY_TEMPLATE (tmpl
) = tmpl
;
2604 info
= tree_cons (tmpl
, args
, NULL_TREE
);
2606 if (DECL_IMPLICIT_TYPEDEF_P (decl
))
2608 SET_TYPE_TEMPLATE_INFO (TREE_TYPE (tmpl
), info
);
2609 if ((!ctx
|| TREE_CODE (ctx
) != FUNCTION_DECL
)
2610 && TREE_CODE (TREE_TYPE (decl
)) != ENUMERAL_TYPE
)
2611 DECL_NAME (decl
) = classtype_mangled_name (TREE_TYPE (decl
));
2613 else if (DECL_LANG_SPECIFIC (decl
))
2614 DECL_TEMPLATE_INFO (decl
) = info
;
2616 return DECL_TEMPLATE_RESULT (tmpl
);
2620 push_template_decl (decl
)
2623 return push_template_decl_real (decl
, 0);
2626 /* Called when a class template TYPE is redeclared with the indicated
2627 template PARMS, e.g.:
2629 template <class T> struct S;
2630 template <class T> struct S {}; */
2633 redeclare_class_template (type
, parms
)
2641 if (!TYPE_TEMPLATE_INFO (type
))
2643 cp_error ("`%T' is not a template type", type
);
2647 tmpl
= TYPE_TI_TEMPLATE (type
);
2648 if (!PRIMARY_TEMPLATE_P (tmpl
))
2649 /* The type is nested in some template class. Nothing to worry
2650 about here; there are no new template parameters for the nested
2654 parms
= INNERMOST_TEMPLATE_PARMS (parms
);
2655 tmpl_parms
= DECL_INNERMOST_TEMPLATE_PARMS (tmpl
);
2657 if (TREE_VEC_LENGTH (parms
) != TREE_VEC_LENGTH (tmpl_parms
))
2659 cp_error_at ("previous declaration `%D'", tmpl
);
2660 cp_error ("used %d template parameter%s instead of %d",
2661 TREE_VEC_LENGTH (tmpl_parms
),
2662 TREE_VEC_LENGTH (tmpl_parms
) == 1 ? "" : "s",
2663 TREE_VEC_LENGTH (parms
));
2667 for (i
= 0; i
< TREE_VEC_LENGTH (tmpl_parms
); ++i
)
2669 tree tmpl_parm
= TREE_VALUE (TREE_VEC_ELT (tmpl_parms
, i
));
2670 tree parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
2671 tree tmpl_default
= TREE_PURPOSE (TREE_VEC_ELT (tmpl_parms
, i
));
2672 tree parm_default
= TREE_PURPOSE (TREE_VEC_ELT (parms
, i
));
2674 if (TREE_CODE (tmpl_parm
) != TREE_CODE (parm
))
2676 cp_error_at ("template parameter `%#D'", tmpl_parm
);
2677 cp_error ("redeclared here as `%#D'", parm
);
2681 if (tmpl_default
!= NULL_TREE
&& parm_default
!= NULL_TREE
)
2683 /* We have in [temp.param]:
2685 A template-parameter may not be given default arguments
2686 by two different declarations in the same scope. */
2687 cp_error ("redefinition of default argument for `%#D'", parm
);
2688 cp_error_at (" original definition appeared here", tmpl_parm
);
2692 if (parm_default
!= NULL_TREE
)
2693 /* Update the previous template parameters (which are the ones
2694 that will really count) with the new default value. */
2695 TREE_PURPOSE (TREE_VEC_ELT (tmpl_parms
, i
)) = parm_default
;
2696 else if (tmpl_default
!= NULL_TREE
)
2697 /* Update the new parameters, too; they'll be used as the
2698 parameters for any members. */
2699 TREE_PURPOSE (TREE_VEC_ELT (parms
, i
)) = tmpl_default
;
2703 /* Attempt to convert the non-type template parameter EXPR to the
2704 indicated TYPE. If the conversion is successful, return the
2705 converted value. If the conversion is unsuccesful, return
2706 NULL_TREE if we issued an error message, or error_mark_node if we
2707 did not. We issue error messages for out-and-out bad template
2708 parameters, but not simply because the conversion failed, since we
2709 might be just trying to do argument deduction. By the time this
2710 function is called, neither TYPE nor EXPR may make use of template
2714 convert_nontype_argument (type
, expr
)
2718 tree expr_type
= TREE_TYPE (expr
);
2720 /* A template-argument for a non-type, non-template
2721 template-parameter shall be one of:
2723 --an integral constant-expression of integral or enumeration
2726 --the name of a non-type template-parameter; or
2728 --the name of an object or function with external linkage,
2729 including function templates and function template-ids but
2730 excluding non-static class members, expressed as id-expression;
2733 --the address of an object or function with external linkage,
2734 including function templates and function template-ids but
2735 excluding non-static class members, expressed as & id-expression
2736 where the & is optional if the name refers to a function or
2739 --a pointer to member expressed as described in _expr.unary.op_. */
2741 /* An integral constant-expression can include const variables or
2742 enumerators. Simplify things by folding them to their values,
2743 unless we're about to bind the declaration to a reference
2745 if (INTEGRAL_TYPE_P (expr_type
)
2746 && TREE_CODE (type
) != REFERENCE_TYPE
)
2747 expr
= decl_constant_value (expr
);
2749 if (is_overloaded_fn (expr
))
2750 /* OK for now. We'll check that it has external linkage later.
2751 Check this first since if expr_type is the unknown_type_node
2752 we would otherwise complain below. */
2754 else if (TYPE_PTRMEM_P (expr_type
)
2755 || TYPE_PTRMEMFUNC_P (expr_type
))
2757 if (TREE_CODE (expr
) != PTRMEM_CST
)
2760 else if (TYPE_PTR_P (expr_type
)
2761 || TYPE_PTRMEM_P (expr_type
)
2762 || TREE_CODE (expr_type
) == ARRAY_TYPE
2763 || TREE_CODE (type
) == REFERENCE_TYPE
2764 /* If expr is the address of an overloaded function, we
2765 will get the unknown_type_node at this point. */
2766 || expr_type
== unknown_type_node
)
2772 if (TREE_CODE (expr_type
) == ARRAY_TYPE
2773 || (TREE_CODE (type
) == REFERENCE_TYPE
2774 && TREE_CODE (e
) != ADDR_EXPR
))
2778 if (TREE_CODE (e
) != ADDR_EXPR
)
2781 cp_error ("`%E' is not a valid template argument", expr
);
2782 if (TYPE_PTR_P (expr_type
))
2784 if (TREE_CODE (TREE_TYPE (expr_type
)) == FUNCTION_TYPE
)
2785 cp_error ("it must be the address of a function with external linkage");
2787 cp_error ("it must be the address of an object with external linkage");
2789 else if (TYPE_PTRMEM_P (expr_type
)
2790 || TYPE_PTRMEMFUNC_P (expr_type
))
2791 cp_error ("it must be a pointer-to-member of the form `&X::Y'");
2796 referent
= TREE_OPERAND (e
, 0);
2797 STRIP_NOPS (referent
);
2800 if (TREE_CODE (referent
) == STRING_CST
)
2802 cp_error ("string literal %E is not a valid template argument because it is the address of an object with static linkage",
2807 if (is_overloaded_fn (referent
))
2808 /* We'll check that it has external linkage later. */
2810 else if (TREE_CODE (referent
) != VAR_DECL
)
2812 else if (!TREE_PUBLIC (referent
))
2814 cp_error ("address of non-extern `%E' cannot be used as template argument", referent
);
2815 return error_mark_node
;
2818 else if (INTEGRAL_TYPE_P (expr_type
)
2819 || TYPE_PTRMEM_P (expr_type
)
2820 || TYPE_PTRMEMFUNC_P (expr_type
)
2821 /* The next two are g++ extensions. */
2822 || TREE_CODE (expr_type
) == REAL_TYPE
2823 || TREE_CODE (expr_type
) == COMPLEX_TYPE
)
2825 if (! TREE_CONSTANT (expr
))
2828 cp_error ("non-constant `%E' cannot be used as template argument",
2835 cp_error ("object `%E' cannot be used as template argument", expr
);
2839 switch (TREE_CODE (type
))
2844 /* For a non-type template-parameter of integral or enumeration
2845 type, integral promotions (_conv.prom_) and integral
2846 conversions (_conv.integral_) are applied. */
2847 if (!INTEGRAL_TYPE_P (expr_type
))
2848 return error_mark_node
;
2850 /* It's safe to call digest_init in this case; we know we're
2851 just converting one integral constant expression to another. */
2852 expr
= digest_init (type
, expr
, (tree
*) 0);
2854 if (TREE_CODE (expr
) != INTEGER_CST
)
2855 /* Curiously, some TREE_CONSTANT integral expressions do not
2856 simplify to integer constants. For example, `3 % 0',
2857 remains a TRUNC_MOD_EXPR. */
2864 /* These are g++ extensions. */
2865 if (TREE_CODE (expr_type
) != TREE_CODE (type
))
2866 return error_mark_node
;
2868 expr
= digest_init (type
, expr
, (tree
*) 0);
2870 if (TREE_CODE (expr
) != REAL_CST
)
2877 tree type_pointed_to
= TREE_TYPE (type
);
2879 if (TYPE_PTRMEM_P (type
))
2883 /* For a non-type template-parameter of type pointer to data
2884 member, qualification conversions (_conv.qual_) are
2886 e
= perform_qualification_conversions (type
, expr
);
2887 if (TREE_CODE (e
) == NOP_EXPR
)
2888 /* The call to perform_qualification_conversions will
2889 insert a NOP_EXPR over EXPR to do express conversion,
2890 if necessary. But, that will confuse us if we use
2891 this (converted) template parameter to instantiate
2892 another template; then the thing will not look like a
2893 valid template argument. So, just make a new
2894 constant, of the appropriate type. */
2895 e
= make_ptrmem_cst (type
, PTRMEM_CST_MEMBER (expr
));
2898 else if (TREE_CODE (type_pointed_to
) == FUNCTION_TYPE
)
2900 /* For a non-type template-parameter of type pointer to
2901 function, only the function-to-pointer conversion
2902 (_conv.func_) is applied. If the template-argument
2903 represents a set of overloaded functions (or a pointer to
2904 such), the matching function is selected from the set
2909 if (TREE_CODE (expr
) == ADDR_EXPR
)
2910 fns
= TREE_OPERAND (expr
, 0);
2914 fn
= instantiate_type (type_pointed_to
, fns
, 0);
2916 if (fn
== error_mark_node
)
2917 return error_mark_node
;
2919 if (!TREE_PUBLIC (fn
))
2921 if (really_overloaded_fn (fns
))
2922 return error_mark_node
;
2927 expr
= build_unary_op (ADDR_EXPR
, fn
, 0);
2929 my_friendly_assert (same_type_p (type
, TREE_TYPE (expr
)),
2935 /* For a non-type template-parameter of type pointer to
2936 object, qualification conversions (_conv.qual_) and the
2937 array-to-pointer conversion (_conv.array_) are applied.
2938 [Note: In particular, neither the null pointer conversion
2939 (_conv.ptr_) nor the derived-to-base conversion
2940 (_conv.ptr_) are applied. Although 0 is a valid
2941 template-argument for a non-type template-parameter of
2942 integral type, it is not a valid template-argument for a
2943 non-type template-parameter of pointer type.]
2945 The call to decay_conversion performs the
2946 array-to-pointer conversion, if appropriate. */
2947 expr
= decay_conversion (expr
);
2949 if (expr
== error_mark_node
)
2950 return error_mark_node
;
2952 return perform_qualification_conversions (type
, expr
);
2957 case REFERENCE_TYPE
:
2959 tree type_referred_to
= TREE_TYPE (type
);
2961 /* If this expression already has reference type, get the
2962 underling object. */
2963 if (TREE_CODE (expr_type
) == REFERENCE_TYPE
)
2965 my_friendly_assert (TREE_CODE (expr
) == ADDR_EXPR
, 20000604);
2966 expr
= TREE_OPERAND (expr
, 0);
2967 expr_type
= TREE_TYPE (expr
);
2970 if (TREE_CODE (type_referred_to
) == FUNCTION_TYPE
)
2972 /* For a non-type template-parameter of type reference to
2973 function, no conversions apply. If the
2974 template-argument represents a set of overloaded
2975 functions, the matching function is selected from the
2976 set (_over.over_). */
2979 fn
= instantiate_type (type_referred_to
, expr
, 0);
2981 if (fn
== error_mark_node
)
2982 return error_mark_node
;
2984 if (!TREE_PUBLIC (fn
))
2986 if (really_overloaded_fn (expr
))
2987 /* Don't issue an error here; we might get a different
2988 function if the overloading had worked out
2990 return error_mark_node
;
2995 my_friendly_assert (same_type_p (type_referred_to
,
3003 /* For a non-type template-parameter of type reference to
3004 object, no conversions apply. The type referred to by the
3005 reference may be more cv-qualified than the (otherwise
3006 identical) type of the template-argument. The
3007 template-parameter is bound directly to the
3008 template-argument, which must be an lvalue. */
3009 if (!same_type_p (TYPE_MAIN_VARIANT (expr_type
),
3010 TYPE_MAIN_VARIANT (type_referred_to
))
3011 || !at_least_as_qualified_p (type_referred_to
,
3013 || !real_lvalue_p (expr
))
3014 return error_mark_node
;
3017 mark_addressable (expr
);
3018 return build1 (ADDR_EXPR
, type
, expr
);
3024 if (!TYPE_PTRMEMFUNC_P (type
))
3025 /* This handles templates like
3026 template<class T, T t> void f();
3027 when T is substituted with any class. The second template
3028 parameter becomes invalid and the template candidate is
3030 return error_mark_node
;
3032 /* For a non-type template-parameter of type pointer to member
3033 function, no conversions apply. If the template-argument
3034 represents a set of overloaded member functions, the
3035 matching member function is selected from the set
3038 if (!TYPE_PTRMEMFUNC_P (expr_type
) &&
3039 expr_type
!= unknown_type_node
)
3040 return error_mark_node
;
3042 if (TREE_CODE (expr
) == PTRMEM_CST
)
3044 /* A ptr-to-member constant. */
3045 if (!same_type_p (type
, expr_type
))
3046 return error_mark_node
;
3051 if (TREE_CODE (expr
) != ADDR_EXPR
)
3052 return error_mark_node
;
3054 expr
= instantiate_type (type
, expr
, 0);
3056 if (expr
== error_mark_node
)
3057 return error_mark_node
;
3059 my_friendly_assert (same_type_p (type
, TREE_TYPE (expr
)),
3066 /* All non-type parameters must have one of these types. */
3067 my_friendly_abort (0);
3071 return error_mark_node
;
3074 /* Return 1 if PARM_PARMS and ARG_PARMS matches using rule for
3075 template template parameters. Both PARM_PARMS and ARG_PARMS are
3076 vectors of TREE_LIST nodes containing TYPE_DECL, TEMPLATE_DECL
3079 ARG_PARMS may contain more parameters than PARM_PARMS. If this is
3080 the case, then extra parameters must have default arguments.
3082 Consider the example:
3083 template <class T, class Allocator = allocator> class vector;
3084 template<template <class U> class TT> class C;
3086 C<vector> is a valid instantiation. PARM_PARMS for the above code
3087 contains a TYPE_DECL (for U), ARG_PARMS contains two TYPE_DECLs (for
3088 T and Allocator) and OUTER_ARGS contains the argument that is used to
3089 substitute the TT parameter. */
3092 coerce_template_template_parms (parm_parms
, arg_parms
, complain
,
3093 in_decl
, outer_args
)
3094 tree parm_parms
, arg_parms
;
3096 tree in_decl
, outer_args
;
3098 int nparms
, nargs
, i
;
3101 my_friendly_assert (TREE_CODE (parm_parms
) == TREE_VEC
, 0);
3102 my_friendly_assert (TREE_CODE (arg_parms
) == TREE_VEC
, 0);
3104 nparms
= TREE_VEC_LENGTH (parm_parms
);
3105 nargs
= TREE_VEC_LENGTH (arg_parms
);
3107 /* The rule here is opposite of coerce_template_parms. */
3110 && TREE_PURPOSE (TREE_VEC_ELT (arg_parms
, nparms
)) == NULL_TREE
))
3113 for (i
= 0; i
< nparms
; ++i
)
3115 parm
= TREE_VALUE (TREE_VEC_ELT (parm_parms
, i
));
3116 arg
= TREE_VALUE (TREE_VEC_ELT (arg_parms
, i
));
3118 if (arg
== NULL_TREE
|| arg
== error_mark_node
3119 || parm
== NULL_TREE
|| parm
== error_mark_node
)
3122 if (TREE_CODE (arg
) != TREE_CODE (parm
))
3125 switch (TREE_CODE (parm
))
3131 /* We encounter instantiations of templates like
3132 template <template <template <class> class> class TT>
3135 tree parmparm
= DECL_INNERMOST_TEMPLATE_PARMS (parm
);
3136 tree argparm
= DECL_INNERMOST_TEMPLATE_PARMS (arg
);
3138 if (!coerce_template_template_parms (parmparm
, argparm
,
3146 /* The tsubst call is used to handle cases such as
3147 template <class T, template <T> class TT> class D;
3148 i.e. the parameter list of TT depends on earlier parameters. */
3149 if (!same_type_p (tsubst (TREE_TYPE (parm
), outer_args
,
3156 my_friendly_abort (0);
3162 /* Convert the indicated template ARG as necessary to match the
3163 indicated template PARM. Returns the converted ARG, or
3164 error_mark_node if the conversion was unsuccessful. Error messages
3165 are issued if COMPLAIN is non-zero. This conversion is for the Ith
3166 parameter in the parameter list. ARGS is the full set of template
3167 arguments deduced so far. */
3170 convert_template_argument (parm
, arg
, args
, complain
, i
, in_decl
)
3180 int is_type
, requires_type
, is_tmpl_type
, requires_tmpl_type
;
3182 inner_args
= INNERMOST_TEMPLATE_ARGS (args
);
3184 if (TREE_CODE (arg
) == TREE_LIST
3185 && TREE_TYPE (arg
) != NULL_TREE
3186 && TREE_CODE (TREE_TYPE (arg
)) == OFFSET_TYPE
)
3188 /* The template argument was the name of some
3189 member function. That's usually
3190 illegal, but static members are OK. In any
3191 case, grab the underlying fields/functions
3192 and issue an error later if required. */
3193 arg
= TREE_VALUE (arg
);
3194 TREE_TYPE (arg
) = unknown_type_node
;
3197 requires_tmpl_type
= TREE_CODE (parm
) == TEMPLATE_DECL
;
3198 requires_type
= (TREE_CODE (parm
) == TYPE_DECL
3199 || requires_tmpl_type
);
3201 /* Check if it is a class template. If REQUIRES_TMPL_TYPE is true,
3202 we also accept implicitly created TYPE_DECL as a valid argument.
3203 This is necessary to handle the case where we pass a template name
3204 to a template template parameter in a scope where we've derived from
3205 in instantiation of that template, so the template name refers to that
3206 instantiation. We really ought to handle this better. */
3208 = ((TREE_CODE (arg
) == TEMPLATE_DECL
3209 && TREE_CODE (DECL_TEMPLATE_RESULT (arg
)) == TYPE_DECL
)
3210 || (TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
3211 && !TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (arg
))
3212 || (TREE_CODE (arg
) == RECORD_TYPE
3213 && CLASSTYPE_TEMPLATE_INFO (arg
)
3214 && TREE_CODE (TYPE_NAME (arg
)) == TYPE_DECL
3215 && DECL_ARTIFICIAL (TYPE_NAME (arg
))
3216 && requires_tmpl_type
3217 && is_base_of_enclosing_class (arg
, current_class_type
)));
3218 if (is_tmpl_type
&& TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
)
3219 arg
= TYPE_STUB_DECL (arg
);
3220 else if (is_tmpl_type
&& TREE_CODE (arg
) == RECORD_TYPE
)
3221 arg
= CLASSTYPE_TI_TEMPLATE (arg
);
3223 is_type
= TYPE_P (arg
) || is_tmpl_type
;
3225 if (requires_type
&& ! is_type
&& TREE_CODE (arg
) == SCOPE_REF
3226 && TREE_CODE (TREE_OPERAND (arg
, 0)) == TEMPLATE_TYPE_PARM
)
3228 cp_pedwarn ("to refer to a type member of a template parameter, use `typename %E'", arg
);
3230 arg
= make_typename_type (TREE_OPERAND (arg
, 0),
3231 TREE_OPERAND (arg
, 1),
3235 if (is_type
!= requires_type
)
3241 cp_error ("type/value mismatch at argument %d in template parameter list for `%D'",
3244 cp_error (" expected a constant of type `%T', got `%T'",
3246 (is_tmpl_type
? DECL_NAME (arg
) : arg
));
3248 cp_error (" expected a type, got `%E'", arg
);
3251 return error_mark_node
;
3253 if (is_tmpl_type
^ requires_tmpl_type
)
3255 if (in_decl
&& complain
)
3257 cp_error ("type/value mismatch at argument %d in template parameter list for `%D'",
3260 cp_error (" expected a type, got `%T'", DECL_NAME (arg
));
3262 cp_error (" expected a class template, got `%T'", arg
);
3264 return error_mark_node
;
3269 if (requires_tmpl_type
)
3271 tree parmparm
= DECL_INNERMOST_TEMPLATE_PARMS (parm
);
3272 tree argparm
= DECL_INNERMOST_TEMPLATE_PARMS (arg
);
3274 if (coerce_template_template_parms (parmparm
, argparm
, complain
,
3275 in_decl
, inner_args
))
3279 /* TEMPLATE_TEMPLATE_PARM node is preferred over
3281 if (val
!= error_mark_node
3282 && DECL_TEMPLATE_TEMPLATE_PARM_P (val
))
3283 val
= TREE_TYPE (val
);
3287 if (in_decl
&& complain
)
3289 cp_error ("type/value mismatch at argument %d in template parameter list for `%D'",
3291 cp_error (" expected a template of type `%D', got `%D'", parm
, arg
);
3294 val
= error_mark_node
;
3299 val
= groktypename (arg
);
3300 if (! processing_template_decl
)
3302 /* [basic.link]: A name with no linkage (notably, the
3303 name of a class or enumeration declared in a local
3304 scope) shall not be used to declare an entity with
3305 linkage. This implies that names with no linkage
3306 cannot be used as template arguments. */
3307 tree t
= no_linkage_check (val
);
3310 if (ANON_AGGRNAME_P (TYPE_IDENTIFIER (t
)))
3312 ("template-argument `%T' uses anonymous type", val
);
3315 ("template-argument `%T' uses local type `%T'",
3317 return error_mark_node
;
3324 tree t
= tsubst (TREE_TYPE (parm
), args
, complain
, in_decl
);
3326 if (processing_template_decl
)
3327 arg
= maybe_fold_nontype_arg (arg
);
3329 if (!uses_template_parms (arg
) && !uses_template_parms (t
))
3330 /* We used to call digest_init here. However, digest_init
3331 will report errors, which we don't want when complain
3332 is zero. More importantly, digest_init will try too
3333 hard to convert things: for example, `0' should not be
3334 converted to pointer type at this point according to
3335 the standard. Accepting this is not merely an
3336 extension, since deciding whether or not these
3337 conversions can occur is part of determining which
3338 function template to call, or whether a given epxlicit
3339 argument specification is legal. */
3340 val
= convert_nontype_argument (t
, arg
);
3344 if (val
== NULL_TREE
)
3345 val
= error_mark_node
;
3346 else if (val
== error_mark_node
&& complain
)
3347 cp_error ("could not convert template argument `%E' to `%T'",
3354 /* Convert all template arguments to their appropriate types, and
3355 return a vector containing the innermost resulting template
3356 arguments. If any error occurs, return error_mark_node, and, if
3357 COMPLAIN is non-zero, issue an error message. Some error messages
3358 are issued even if COMPLAIN is zero; for instance, if a template
3359 argument is composed from a local class.
3361 If REQUIRE_ALL_ARGUMENTS is non-zero, all arguments must be
3362 provided in ARGLIST, or else trailing parameters must have default
3363 values. If REQUIRE_ALL_ARGUMENTS is zero, we will attempt argument
3364 deduction for any unspecified trailing arguments. */
3367 coerce_template_parms (parms
, args
, in_decl
,
3369 require_all_arguments
)
3373 int require_all_arguments
;
3375 int nparms
, nargs
, i
, lost
= 0;
3378 tree new_inner_args
;
3380 inner_args
= INNERMOST_TEMPLATE_ARGS (args
);
3381 nargs
= NUM_TMPL_ARGS (inner_args
);
3382 nparms
= TREE_VEC_LENGTH (parms
);
3386 && require_all_arguments
3387 && TREE_PURPOSE (TREE_VEC_ELT (parms
, nargs
)) == NULL_TREE
))
3391 cp_error ("wrong number of template arguments (%d, should be %d)",
3395 cp_error_at ("provided for `%D'", in_decl
);
3398 return error_mark_node
;
3401 new_inner_args
= make_tree_vec (nparms
);
3402 new_args
= add_outermost_template_args (args
, new_inner_args
);
3403 for (i
= 0; i
< nparms
; i
++)
3408 /* Get the Ith template parameter. */
3409 parm
= TREE_VEC_ELT (parms
, i
);
3411 /* Calculate the Ith argument. */
3412 if (inner_args
&& TREE_CODE (inner_args
) == TREE_LIST
)
3414 arg
= TREE_VALUE (inner_args
);
3415 inner_args
= TREE_CHAIN (inner_args
);
3418 arg
= TREE_VEC_ELT (inner_args
, i
);
3419 /* If no template argument was supplied, look for a default
3421 else if (TREE_PURPOSE (parm
) == NULL_TREE
)
3423 /* There was no default value. */
3424 my_friendly_assert (!require_all_arguments
, 0);
3427 else if (TREE_CODE (TREE_VALUE (parm
)) == TYPE_DECL
)
3428 arg
= tsubst (TREE_PURPOSE (parm
), new_args
, complain
, in_decl
);
3430 arg
= tsubst_expr (TREE_PURPOSE (parm
), new_args
, complain
,
3433 /* Now, convert the Ith argument, as necessary. */
3434 if (arg
== NULL_TREE
)
3435 /* We're out of arguments. */
3437 my_friendly_assert (!require_all_arguments
, 0);
3440 else if (arg
== error_mark_node
)
3442 cp_error ("template argument %d is invalid", i
+ 1);
3443 arg
= error_mark_node
;
3446 arg
= convert_template_argument (TREE_VALUE (parm
),
3447 arg
, new_args
, complain
, i
,
3450 if (arg
== error_mark_node
)
3452 TREE_VEC_ELT (new_inner_args
, i
) = arg
;
3456 return error_mark_node
;
3458 return new_inner_args
;
3461 /* Returns 1 if template args OT and NT are equivalent. */
3464 template_args_equal (ot
, nt
)
3469 if (TREE_CODE (nt
) != TREE_CODE (ot
))
3471 if (TREE_CODE (nt
) == TREE_VEC
)
3472 /* For member templates */
3473 return comp_template_args (ot
, nt
);
3474 else if (TYPE_P (ot
))
3475 return same_type_p (ot
, nt
);
3477 return (cp_tree_equal (ot
, nt
) > 0);
3480 /* Returns 1 iff the OLDARGS and NEWARGS are in fact identical sets
3481 of template arguments. Returns 0 otherwise. */
3484 comp_template_args (oldargs
, newargs
)
3485 tree oldargs
, newargs
;
3489 if (TREE_VEC_LENGTH (oldargs
) != TREE_VEC_LENGTH (newargs
))
3492 for (i
= 0; i
< TREE_VEC_LENGTH (oldargs
); ++i
)
3494 tree nt
= TREE_VEC_ELT (newargs
, i
);
3495 tree ot
= TREE_VEC_ELT (oldargs
, i
);
3497 if (! template_args_equal (ot
, nt
))
3503 /* Given class template name and parameter list, produce a user-friendly name
3504 for the instantiation. */
3507 mangle_class_name_for_template (name
, parms
, arglist
)
3509 tree parms
, arglist
;
3511 static struct obstack scratch_obstack
;
3512 static char *scratch_firstobj
;
3515 if (!scratch_firstobj
)
3516 gcc_obstack_init (&scratch_obstack
);
3518 obstack_free (&scratch_obstack
, scratch_firstobj
);
3519 scratch_firstobj
= obstack_alloc (&scratch_obstack
, 1);
3521 #define ccat(c) obstack_1grow (&scratch_obstack, (c));
3522 #define cat(s) obstack_grow (&scratch_obstack, (s), strlen (s))
3526 nparms
= TREE_VEC_LENGTH (parms
);
3527 arglist
= INNERMOST_TEMPLATE_ARGS (arglist
);
3528 my_friendly_assert (nparms
== TREE_VEC_LENGTH (arglist
), 268);
3529 for (i
= 0; i
< nparms
; i
++)
3531 tree parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
3532 tree arg
= TREE_VEC_ELT (arglist
, i
);
3537 if (TREE_CODE (parm
) == TYPE_DECL
)
3539 cat (type_as_string (arg
, TS_CHASE_TYPEDEFS
));
3542 else if (TREE_CODE (parm
) == TEMPLATE_DECL
)
3544 if (TREE_CODE (arg
) == TEMPLATE_DECL
)
3546 /* Already substituted with real template. Just output
3547 the template name here */
3548 tree context
= DECL_CONTEXT (arg
);
3551 /* The template may be defined in a namespace, or
3552 may be a member template. */
3553 my_friendly_assert (TREE_CODE (context
) == NAMESPACE_DECL
3554 || CLASS_TYPE_P (context
),
3556 cat(decl_as_string (DECL_CONTEXT (arg
), 0));
3559 cat (IDENTIFIER_POINTER (DECL_NAME (arg
)));
3562 /* Output the parameter declaration */
3563 cat (type_as_string (arg
, TS_CHASE_TYPEDEFS
));
3567 my_friendly_assert (TREE_CODE (parm
) == PARM_DECL
, 269);
3569 if (TREE_CODE (arg
) == TREE_LIST
)
3571 /* New list cell was built because old chain link was in
3573 my_friendly_assert (TREE_PURPOSE (arg
) == NULL_TREE
, 270);
3574 arg
= TREE_VALUE (arg
);
3576 /* No need to check arglist against parmlist here; we did that
3577 in coerce_template_parms, called from lookup_template_class. */
3578 cat (expr_as_string (arg
, 0));
3581 char *bufp
= obstack_next_free (&scratch_obstack
);
3583 while (bufp
[offset
- 1] == ' ')
3585 obstack_blank_fast (&scratch_obstack
, offset
);
3587 /* B<C<char> >, not B<C<char>> */
3588 if (bufp
[offset
- 1] == '>')
3593 return (char *) obstack_base (&scratch_obstack
);
3597 classtype_mangled_name (t
)
3600 if (CLASSTYPE_TEMPLATE_INFO (t
)
3601 /* Specializations have already had their names set up in
3602 lookup_template_class. */
3603 && !CLASSTYPE_TEMPLATE_SPECIALIZATION (t
))
3605 tree tmpl
= most_general_template (CLASSTYPE_TI_TEMPLATE (t
));
3607 /* For non-primary templates, the template parameters are
3608 implicit from their surrounding context. */
3609 if (PRIMARY_TEMPLATE_P (tmpl
))
3611 tree name
= DECL_NAME (tmpl
);
3612 char *mangled_name
= mangle_class_name_for_template
3613 (IDENTIFIER_POINTER (name
),
3614 DECL_INNERMOST_TEMPLATE_PARMS (tmpl
),
3615 CLASSTYPE_TI_ARGS (t
));
3616 tree id
= get_identifier (mangled_name
);
3617 IDENTIFIER_TEMPLATE (id
) = name
;
3622 return TYPE_IDENTIFIER (t
);
3626 add_pending_template (d
)
3629 tree ti
= (TYPE_P (d
)
3630 ? CLASSTYPE_TEMPLATE_INFO (d
)
3631 : DECL_TEMPLATE_INFO (d
));
3634 if (TI_PENDING_TEMPLATE_FLAG (ti
))
3637 /* We are called both from instantiate_decl, where we've already had a
3638 tinst_level pushed, and instantiate_template, where we haven't.
3640 level
= !(current_tinst_level
&& TINST_DECL (current_tinst_level
) == d
);
3643 push_tinst_level (d
);
3645 *template_tail
= tree_cons (current_tinst_level
, d
, NULL_TREE
);
3646 template_tail
= &TREE_CHAIN (*template_tail
);
3647 TI_PENDING_TEMPLATE_FLAG (ti
) = 1;
3654 /* Return a TEMPLATE_ID_EXPR corresponding to the indicated FNS (which
3655 may be either a _DECL or an overloaded function or an
3656 IDENTIFIER_NODE), and ARGLIST. */
3659 lookup_template_function (fns
, arglist
)
3664 if (fns
== NULL_TREE
)
3666 cp_error ("non-template used as template");
3667 return error_mark_node
;
3670 type
= TREE_TYPE (fns
);
3671 if (TREE_CODE (fns
) == OVERLOAD
|| !type
)
3672 type
= unknown_type_node
;
3674 if (processing_template_decl
)
3675 return build_min (TEMPLATE_ID_EXPR
, type
, fns
, arglist
);
3677 return build (TEMPLATE_ID_EXPR
, type
, fns
, arglist
);
3680 /* Within the scope of a template class S<T>, the name S gets bound
3681 (in build_self_reference) to a TYPE_DECL for the class, not a
3682 TEMPLATE_DECL. If DECL is a TYPE_DECL for current_class_type,
3683 or one of its enclosing classes, and that type is a template,
3684 return the associated TEMPLATE_DECL. Otherwise, the original
3685 DECL is returned. */
3688 maybe_get_template_decl_from_type_decl (decl
)
3691 return (decl
!= NULL_TREE
3692 && TREE_CODE (decl
) == TYPE_DECL
3693 && DECL_ARTIFICIAL (decl
)
3694 && CLASS_TYPE_P (TREE_TYPE (decl
))
3695 && CLASSTYPE_TEMPLATE_INFO (TREE_TYPE (decl
)))
3696 ? CLASSTYPE_TI_TEMPLATE (TREE_TYPE (decl
)) : decl
;
3699 /* Given an IDENTIFIER_NODE (type TEMPLATE_DECL) and a chain of
3700 parameters, find the desired type.
3702 D1 is the PTYPENAME terminal, and ARGLIST is the list of arguments.
3703 (Actually ARGLIST may be either a TREE_LIST or a TREE_VEC. It will
3704 be a TREE_LIST if called directly from the parser, and a TREE_VEC
3705 otherwise.) Since ARGLIST is build on the temp_decl_obstack, we must
3706 copy it here to keep it from being reclaimed when the decl storage
3709 IN_DECL, if non-NULL, is the template declaration we are trying to
3712 If ENTERING_SCOPE is non-zero, we are about to enter the scope of
3713 the class we are looking up.
3715 If the template class is really a local class in a template
3716 function, then the FUNCTION_CONTEXT is the function in which it is
3717 being instantiated. */
3720 lookup_template_class (d1
, arglist
, in_decl
, context
, entering_scope
)
3726 tree
template = NULL_TREE
, parmlist
;
3729 if (TREE_CODE (d1
) == IDENTIFIER_NODE
)
3731 if (IDENTIFIER_VALUE (d1
)
3732 && DECL_TEMPLATE_TEMPLATE_PARM_P (IDENTIFIER_VALUE (d1
)))
3733 template = IDENTIFIER_VALUE (d1
);
3737 push_decl_namespace (context
);
3738 template = lookup_name (d1
, /*prefer_type=*/0);
3739 template = maybe_get_template_decl_from_type_decl (template);
3741 pop_decl_namespace ();
3744 context
= DECL_CONTEXT (template);
3746 else if (TREE_CODE (d1
) == TYPE_DECL
&& IS_AGGR_TYPE (TREE_TYPE (d1
)))
3748 tree type
= TREE_TYPE (d1
);
3750 /* If we are declaring a constructor, say A<T>::A<T>, we will get
3751 an implicit typename for the second A. Deal with it. */
3752 if (TREE_CODE (type
) == TYPENAME_TYPE
&& TREE_TYPE (type
))
3753 type
= TREE_TYPE (type
);
3755 if (CLASSTYPE_TEMPLATE_INFO (type
))
3757 template = CLASSTYPE_TI_TEMPLATE (type
);
3758 d1
= DECL_NAME (template);
3761 else if (TREE_CODE (d1
) == ENUMERAL_TYPE
3762 || (TYPE_P (d1
) && IS_AGGR_TYPE (d1
)))
3764 template = TYPE_TI_TEMPLATE (d1
);
3765 d1
= DECL_NAME (template);
3767 else if (TREE_CODE (d1
) == TEMPLATE_DECL
3768 && TREE_CODE (DECL_TEMPLATE_RESULT (d1
)) == TYPE_DECL
)
3771 d1
= DECL_NAME (template);
3772 context
= DECL_CONTEXT (template);
3775 my_friendly_abort (272);
3777 /* With something like `template <class T> class X class X { ... };'
3778 we could end up with D1 having nothing but an IDENTIFIER_VALUE.
3779 We don't want to do that, but we have to deal with the situation,
3780 so let's give them some syntax errors to chew on instead of a
3784 cp_error ("`%T' is not a template", d1
);
3785 return error_mark_node
;
3788 if (context
== NULL_TREE
)
3789 context
= global_namespace
;
3791 if (TREE_CODE (template) != TEMPLATE_DECL
)
3793 cp_error ("non-template type `%T' used as a template", d1
);
3795 cp_error_at ("for template declaration `%D'", in_decl
);
3796 return error_mark_node
;
3799 if (DECL_TEMPLATE_TEMPLATE_PARM_P (template))
3801 /* Create a new TEMPLATE_DECL and TEMPLATE_TEMPLATE_PARM node to store
3802 template arguments */
3807 parmlist
= DECL_INNERMOST_TEMPLATE_PARMS (template);
3809 arglist2
= coerce_template_parms (parmlist
, arglist
, template, 1, 1);
3810 if (arglist2
== error_mark_node
)
3811 return error_mark_node
;
3813 parm
= copy_template_template_parm (TREE_TYPE (template), arglist2
);
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
)
4511 DECL_USE_TEMPLATE (DECL_TEMPLATE_RESULT (new_friend
)) = 0;
4512 DECL_SAVED_TREE (DECL_TEMPLATE_RESULT (new_friend
))
4513 = DECL_SAVED_TREE (DECL_TEMPLATE_RESULT (decl
));
4516 /* The mangled name for the NEW_FRIEND is incorrect. The call to
4517 tsubst will have resulted in a call to
4518 set_mangled_name_for_template_decl. But, the function is not a
4519 template instantiation and should not be mangled like one.
4520 Therefore, we remangle the function name. We don't have to do
4521 this if the NEW_FRIEND is a template since
4522 set_mangled_name_for_template_decl doesn't do anything if the
4523 function declaration still uses template arguments. */
4524 if (TREE_CODE (new_friend
) != TEMPLATE_DECL
)
4526 set_mangled_name_for_decl (new_friend
);
4527 DECL_RTL (new_friend
) = 0;
4528 make_decl_rtl (new_friend
, NULL_PTR
, 1);
4531 if (DECL_NAMESPACE_SCOPE_P (new_friend
))
4534 tree new_friend_template_info
;
4535 tree new_friend_result_template_info
;
4537 int new_friend_is_defn
;
4539 /* We must save some information from NEW_FRIEND before calling
4540 duplicate decls since that function will free NEW_FRIEND if
4542 new_friend_template_info
= DECL_TEMPLATE_INFO (new_friend
);
4543 if (TREE_CODE (new_friend
) == TEMPLATE_DECL
)
4545 /* This declaration is a `primary' template. */
4546 DECL_PRIMARY_TEMPLATE (new_friend
) = new_friend
;
4549 = DECL_INITIAL (DECL_TEMPLATE_RESULT (new_friend
)) != NULL_TREE
;
4550 new_friend_result_template_info
4551 = DECL_TEMPLATE_INFO (DECL_TEMPLATE_RESULT (new_friend
));
4555 new_friend_is_defn
= DECL_INITIAL (new_friend
) != NULL_TREE
;
4556 new_friend_result_template_info
= NULL_TREE
;
4559 /* Inside pushdecl_namespace_level, we will push into the
4560 current namespace. However, the friend function should go
4561 into the namespace of the template. */
4562 ns
= decl_namespace_context (new_friend
);
4563 push_nested_namespace (ns
);
4564 old_decl
= pushdecl_namespace_level (new_friend
);
4565 pop_nested_namespace (ns
);
4567 if (old_decl
!= new_friend
)
4569 /* This new friend declaration matched an existing
4570 declaration. For example, given:
4572 template <class T> void f(T);
4573 template <class U> class C {
4574 template <class T> friend void f(T) {}
4577 the friend declaration actually provides the definition
4578 of `f', once C has been instantiated for some type. So,
4579 old_decl will be the out-of-class template declaration,
4580 while new_friend is the in-class definition.
4582 But, if `f' was called before this point, the
4583 instantiation of `f' will have DECL_TI_ARGS corresponding
4584 to `T' but not to `U', references to which might appear
4585 in the definition of `f'. Previously, the most general
4586 template for an instantiation of `f' was the out-of-class
4587 version; now it is the in-class version. Therefore, we
4588 run through all specialization of `f', adding to their
4589 DECL_TI_ARGS appropriately. In particular, they need a
4590 new set of outer arguments, corresponding to the
4591 arguments for this class instantiation.
4593 The same situation can arise with something like this:
4596 template <class T> class C {
4600 when `C<int>' is instantiated. Now, `f(int)' is defined
4603 if (!new_friend_is_defn
)
4604 /* On the other hand, if the in-class declaration does
4605 *not* provide a definition, then we don't want to alter
4606 existing definitions. We can just leave everything
4611 /* Overwrite whatever template info was there before, if
4612 any, with the new template information pertaining to
4614 DECL_TEMPLATE_INFO (old_decl
) = new_friend_template_info
;
4616 if (TREE_CODE (old_decl
) != TEMPLATE_DECL
)
4617 /* duplicate_decls will take care of this case. */
4622 tree new_friend_args
;
4624 DECL_TEMPLATE_INFO (DECL_TEMPLATE_RESULT (old_decl
))
4625 = new_friend_result_template_info
;
4627 new_friend_args
= TI_ARGS (new_friend_template_info
);
4628 for (t
= DECL_TEMPLATE_SPECIALIZATIONS (old_decl
);
4632 tree spec
= TREE_VALUE (t
);
4635 = add_outermost_template_args (new_friend_args
,
4636 DECL_TI_ARGS (spec
));
4639 /* Now, since specializations are always supposed to
4640 hang off of the most general template, we must move
4642 t
= most_general_template (old_decl
);
4645 DECL_TEMPLATE_SPECIALIZATIONS (t
)
4646 = chainon (DECL_TEMPLATE_SPECIALIZATIONS (t
),
4647 DECL_TEMPLATE_SPECIALIZATIONS (old_decl
));
4648 DECL_TEMPLATE_SPECIALIZATIONS (old_decl
) = NULL_TREE
;
4653 /* The information from NEW_FRIEND has been merged into OLD_DECL
4654 by duplicate_decls. */
4655 new_friend
= old_decl
;
4658 else if (COMPLETE_TYPE_P (DECL_CONTEXT (new_friend
)))
4660 /* Check to see that the declaration is really present, and,
4661 possibly obtain an improved declaration. */
4662 tree fn
= check_classfn (DECL_CONTEXT (new_friend
),
4671 input_filename
= file
;
4675 /* FRIEND_TMPL is a friend TEMPLATE_DECL. ARGS is the vector of
4676 template arguments, as for tsubst.
4678 Returns an appropriate tsbust'd friend type. */
4681 tsubst_friend_class (friend_tmpl
, args
)
4688 /* First, we look for a class template. */
4689 tmpl
= lookup_name (DECL_NAME (friend_tmpl
), /*prefer_type=*/0);
4691 /* But, if we don't find one, it might be because we're in a
4692 situation like this:
4700 Here, in the scope of (say) S<int>, `S' is bound to a TYPE_DECL
4701 for `S<int>', not the TEMPLATE_DECL. */
4702 if (!tmpl
|| !DECL_CLASS_TEMPLATE_P (tmpl
))
4704 tmpl
= lookup_name (DECL_NAME (friend_tmpl
), /*prefer_type=*/1);
4705 tmpl
= maybe_get_template_decl_from_type_decl (tmpl
);
4708 if (tmpl
&& DECL_CLASS_TEMPLATE_P (tmpl
))
4710 /* The friend template has already been declared. Just
4711 check to see that the declarations match, and install any new
4712 default parameters. We must tsubst the default parameters,
4713 of course. We only need the innermost template parameters
4714 because that is all that redeclare_class_template will look
4717 = tsubst_template_parms (DECL_TEMPLATE_PARMS (friend_tmpl
),
4718 args
, /*complain=*/1);
4719 redeclare_class_template (TREE_TYPE (tmpl
), parms
);
4720 friend_type
= TREE_TYPE (tmpl
);
4724 /* The friend template has not already been declared. In this
4725 case, the instantiation of the template class will cause the
4726 injection of this template into the global scope. */
4727 tmpl
= tsubst (friend_tmpl
, args
, /*complain=*/1, NULL_TREE
);
4729 /* The new TMPL is not an instantiation of anything, so we
4730 forget its origins. We don't reset CLASSTYPE_TI_TEMPLATE for
4731 the new type because that is supposed to be the corresponding
4732 template decl, i.e., TMPL. */
4733 DECL_USE_TEMPLATE (tmpl
) = 0;
4734 DECL_TEMPLATE_INFO (tmpl
) = NULL_TREE
;
4735 CLASSTYPE_USE_TEMPLATE (TREE_TYPE (tmpl
)) = 0;
4737 /* Inject this template into the global scope. */
4738 friend_type
= TREE_TYPE (pushdecl_top_level (tmpl
));
4745 instantiate_class_template (type
)
4748 tree
template, args
, pattern
, t
;
4751 if (type
== error_mark_node
)
4752 return error_mark_node
;
4754 if (TYPE_BEING_DEFINED (type
) || COMPLETE_TYPE_P (type
))
4757 /* Figure out which template is being instantiated. */
4758 template = most_general_template (CLASSTYPE_TI_TEMPLATE (type
));
4759 my_friendly_assert (TREE_CODE (template) == TEMPLATE_DECL
, 279);
4761 /* Figure out which arguments are being used to do the
4763 args
= CLASSTYPE_TI_ARGS (type
);
4764 PARTIAL_INSTANTIATION_P (type
) = uses_template_parms (args
);
4766 if (pedantic
&& PARTIAL_INSTANTIATION_P (type
))
4767 /* If this is a partial instantiation, then we can't instantiate
4768 the type; there's no telling whether or not one of the
4769 template parameters might eventually be instantiated to some
4770 value that results in a specialization being used. For
4782 Now, the `S<U>' in `f<int>' is the specialization, not an
4783 instantiation of the original template. */
4786 /* Determine what specialization of the original template to
4788 if (PARTIAL_INSTANTIATION_P (type
))
4789 /* There's no telling which specialization is appropriate at this
4790 point. Since all peeking at the innards of this partial
4791 instantiation are extensions (like the "implicit typename"
4792 extension, which allows users to omit the keyword `typename' on
4793 names that are declared as types in template base classes), we
4794 are free to do what we please.
4796 Trying to figure out which partial instantiation to use can
4797 cause a crash. (Some of the template arguments don't even have
4798 types.) So, we just use the most general version. */
4802 t
= most_specialized_class (template, args
);
4804 if (t
== error_mark_node
)
4806 const char *str
= "candidates are:";
4807 cp_error ("ambiguous class template instantiation for `%#T'", type
);
4808 for (t
= DECL_TEMPLATE_SPECIALIZATIONS (template); t
;
4811 if (get_class_bindings (TREE_VALUE (t
), TREE_PURPOSE (t
),
4814 cp_error_at ("%s %+#T", str
, TREE_TYPE (t
));
4818 TYPE_BEING_DEFINED (type
) = 1;
4819 return error_mark_node
;
4824 pattern
= TREE_TYPE (t
);
4826 pattern
= TREE_TYPE (template);
4828 /* If the template we're instantiating is incomplete, then clearly
4829 there's nothing we can do. */
4830 if (!COMPLETE_TYPE_P (pattern
))
4833 /* If this is a partial instantiation, don't tsubst anything. We will
4834 only use this type for implicit typename, so the actual contents don't
4835 matter. All that matters is whether a particular name is a type. */
4836 if (PARTIAL_INSTANTIATION_P (type
))
4838 /* The fields set here must be kept in sync with those cleared
4839 in begin_class_definition. */
4840 TYPE_BINFO_BASETYPES (type
) = TYPE_BINFO_BASETYPES (pattern
);
4841 TYPE_FIELDS (type
) = TYPE_FIELDS (pattern
);
4842 TYPE_METHODS (type
) = TYPE_METHODS (pattern
);
4843 CLASSTYPE_TAGS (type
) = CLASSTYPE_TAGS (pattern
);
4844 /* Pretend that the type is complete, so that we will look
4845 inside it during name lookup and such. */
4846 TYPE_SIZE (type
) = bitsize_zero_node
;
4850 /* If we've recursively instantiated too many templates, stop. */
4851 if (! push_tinst_level (type
))
4854 /* Now we're really doing the instantiation. Mark the type as in
4855 the process of being defined. */
4856 TYPE_BEING_DEFINED (type
) = 1;
4858 maybe_push_to_top_level (uses_template_parms (type
));
4862 /* This TYPE is actually a instantiation of of a partial
4863 specialization. We replace the innermost set of ARGS with
4864 the arguments appropriate for substitution. For example,
4867 template <class T> struct S {};
4868 template <class T> struct S<T*> {};
4870 and supposing that we are instantiating S<int*>, ARGS will
4871 present be {int*} but we need {int}. */
4873 = get_class_bindings (TREE_VALUE (t
), TREE_PURPOSE (t
),
4876 /* If there were multiple levels in ARGS, replacing the
4877 innermost level would alter CLASSTYPE_TI_ARGS, which we don't
4878 want, so we make a copy first. */
4879 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (args
))
4881 args
= copy_node (args
);
4882 SET_TMPL_ARGS_LEVEL (args
, TMPL_ARGS_DEPTH (args
), inner_args
);
4888 if (flag_external_templates
)
4890 if (flag_alt_external_templates
)
4892 CLASSTYPE_INTERFACE_ONLY (type
) = interface_only
;
4893 SET_CLASSTYPE_INTERFACE_UNKNOWN_X (type
, interface_unknown
);
4894 CLASSTYPE_VTABLE_NEEDS_WRITING (type
)
4895 = (! CLASSTYPE_INTERFACE_ONLY (type
)
4896 && CLASSTYPE_INTERFACE_KNOWN (type
));
4900 CLASSTYPE_INTERFACE_ONLY (type
) = CLASSTYPE_INTERFACE_ONLY (pattern
);
4901 SET_CLASSTYPE_INTERFACE_UNKNOWN_X
4902 (type
, CLASSTYPE_INTERFACE_UNKNOWN (pattern
));
4903 CLASSTYPE_VTABLE_NEEDS_WRITING (type
)
4904 = (! CLASSTYPE_INTERFACE_ONLY (type
)
4905 && CLASSTYPE_INTERFACE_KNOWN (type
));
4910 SET_CLASSTYPE_INTERFACE_UNKNOWN (type
);
4911 CLASSTYPE_VTABLE_NEEDS_WRITING (type
) = 1;
4914 TYPE_HAS_CONSTRUCTOR (type
) = TYPE_HAS_CONSTRUCTOR (pattern
);
4915 TYPE_HAS_DESTRUCTOR (type
) = TYPE_HAS_DESTRUCTOR (pattern
);
4916 TYPE_OVERLOADS_CALL_EXPR (type
) = TYPE_OVERLOADS_CALL_EXPR (pattern
);
4917 TYPE_OVERLOADS_ARRAY_REF (type
) = TYPE_OVERLOADS_ARRAY_REF (pattern
);
4918 TYPE_OVERLOADS_ARROW (type
) = TYPE_OVERLOADS_ARROW (pattern
);
4919 TYPE_HAS_NEW_OPERATOR (type
) = TYPE_HAS_NEW_OPERATOR (pattern
);
4920 TYPE_HAS_ARRAY_NEW_OPERATOR (type
) = TYPE_HAS_ARRAY_NEW_OPERATOR (pattern
);
4921 TYPE_GETS_DELETE (type
) = TYPE_GETS_DELETE (pattern
);
4922 TYPE_VEC_DELETE_TAKES_SIZE (type
) = TYPE_VEC_DELETE_TAKES_SIZE (pattern
);
4923 TYPE_HAS_ASSIGN_REF (type
) = TYPE_HAS_ASSIGN_REF (pattern
);
4924 TYPE_HAS_CONST_ASSIGN_REF (type
) = TYPE_HAS_CONST_ASSIGN_REF (pattern
);
4925 TYPE_HAS_ABSTRACT_ASSIGN_REF (type
) = TYPE_HAS_ABSTRACT_ASSIGN_REF (pattern
);
4926 TYPE_HAS_INIT_REF (type
) = TYPE_HAS_INIT_REF (pattern
);
4927 TYPE_HAS_CONST_INIT_REF (type
) = TYPE_HAS_CONST_INIT_REF (pattern
);
4928 TYPE_HAS_DEFAULT_CONSTRUCTOR (type
) = TYPE_HAS_DEFAULT_CONSTRUCTOR (pattern
);
4929 TYPE_HAS_CONVERSION (type
) = TYPE_HAS_CONVERSION (pattern
);
4930 TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (type
)
4931 = TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (pattern
);
4932 TYPE_USES_MULTIPLE_INHERITANCE (type
)
4933 = TYPE_USES_MULTIPLE_INHERITANCE (pattern
);
4934 TYPE_USES_VIRTUAL_BASECLASSES (type
)
4935 = TYPE_USES_VIRTUAL_BASECLASSES (pattern
);
4936 TYPE_PACKED (type
) = TYPE_PACKED (pattern
);
4937 TYPE_ALIGN (type
) = TYPE_ALIGN (pattern
);
4938 TYPE_USER_ALIGN (type
) = TYPE_USER_ALIGN (pattern
);
4939 TYPE_FOR_JAVA (type
) = TYPE_FOR_JAVA (pattern
); /* For libjava's JArray<T> */
4940 if (ANON_AGGR_TYPE_P (pattern
))
4941 SET_ANON_AGGR_TYPE_P (type
);
4943 if (TYPE_BINFO_BASETYPES (pattern
))
4945 tree base_list
= NULL_TREE
;
4946 tree pbases
= TYPE_BINFO_BASETYPES (pattern
);
4949 /* Substitute into each of the bases to determine the actual
4951 for (i
= 0; i
< TREE_VEC_LENGTH (pbases
); ++i
)
4957 pbase
= TREE_VEC_ELT (pbases
, i
);
4959 /* Substitue to figure out the base class. */
4960 base
= tsubst (BINFO_TYPE (pbase
), args
,
4961 /*complain=*/1, NULL_TREE
);
4962 if (base
== error_mark_node
)
4965 /* Calculate the correct access node. */
4966 if (TREE_VIA_VIRTUAL (pbase
))
4968 if (TREE_VIA_PUBLIC (pbase
))
4969 access
= access_public_virtual_node
;
4970 else if (TREE_VIA_PROTECTED (pbase
))
4971 access
= access_protected_virtual_node
;
4973 access
= access_private_virtual_node
;
4977 if (TREE_VIA_PUBLIC (pbase
))
4978 access
= access_public_node
;
4979 else if (TREE_VIA_PROTECTED (pbase
))
4980 access
= access_protected_node
;
4982 access
= access_private_node
;
4985 base_list
= tree_cons (access
, base
, base_list
);
4988 /* The list is now in reverse order; correct that. */
4989 base_list
= nreverse (base_list
);
4991 /* Now call xref_basetypes to set up all the base-class
4993 xref_basetypes (TREE_CODE (pattern
) == RECORD_TYPE
4994 ? (CLASSTYPE_DECLARED_CLASS (pattern
)
4995 ? class_type_node
: record_type_node
)
4997 DECL_NAME (TYPE_NAME (pattern
)),
5002 /* Now that our base classes are set up, enter the scope of the
5003 class, so that name lookups into base classes, etc. will work
5004 corectly. This is precisely analagous to what we do in
5005 begin_class_definition when defining an ordinary non-template
5007 pushclass (type
, 1);
5009 for (t
= CLASSTYPE_TAGS (pattern
); t
; t
= TREE_CHAIN (t
))
5011 tree tag
= TREE_VALUE (t
);
5012 tree name
= TYPE_IDENTIFIER (tag
);
5015 newtag
= tsubst (tag
, args
, /*complain=*/1, NULL_TREE
);
5016 if (TREE_CODE (newtag
) != ENUMERAL_TYPE
)
5018 if (TYPE_LANG_SPECIFIC (tag
) && CLASSTYPE_IS_TEMPLATE (tag
))
5019 /* Unfortunately, lookup_template_class sets
5020 CLASSTYPE_IMPLICIT_INSTANTIATION for a partial
5021 instantiation (i.e., for the type of a member template
5022 class nested within a template class.) This behavior is
5023 required for maybe_process_partial_specialization to work
5024 correctly, but is not accurate in this case; the TAG is not
5025 an instantiation of anything. (The corresponding
5026 TEMPLATE_DECL is an instantiation, but the TYPE is not.) */
5027 CLASSTYPE_USE_TEMPLATE (newtag
) = 0;
5029 /* Now, we call pushtag to put this NEWTAG into the scope of
5030 TYPE. We first set up the IDENTIFIER_TYPE_VALUE to avoid
5031 pushtag calling push_template_decl. We don't have to do
5032 this for enums because it will already have been done in
5035 SET_IDENTIFIER_TYPE_VALUE (name
, newtag
);
5036 pushtag (name
, newtag
, /*globalize=*/0);
5040 /* Don't replace enum constants here. */
5041 for (t
= TYPE_FIELDS (pattern
); t
; t
= TREE_CHAIN (t
))
5042 if (TREE_CODE (t
) != CONST_DECL
)
5046 /* The the file and line for this declaration, to assist in
5047 error message reporting. Since we called push_tinst_level
5048 above, we don't need to restore these. */
5049 lineno
= DECL_SOURCE_LINE (t
);
5050 input_filename
= DECL_SOURCE_FILE (t
);
5052 r
= tsubst (t
, args
, /*complain=*/1, NULL_TREE
);
5053 if (TREE_CODE (r
) == VAR_DECL
)
5057 if (DECL_DEFINED_IN_CLASS_P (r
))
5058 init
= tsubst_expr (DECL_INITIAL (t
), args
,
5059 /*complain=*/1, NULL_TREE
);
5063 finish_static_data_member_decl (r
, init
,
5064 /*asmspec_tree=*/NULL_TREE
,
5067 if (DECL_DEFINED_IN_CLASS_P (r
))
5068 check_static_variable_definition (r
, TREE_TYPE (r
));
5071 /* R will have a TREE_CHAIN if and only if it has already been
5072 processed by finish_member_declaration. This can happen
5073 if, for example, it is a TYPE_DECL for a class-scoped
5074 ENUMERAL_TYPE; such a thing will already have been added to
5075 the field list by tsubst_enum above. */
5076 if (!TREE_CHAIN (r
))
5078 set_current_access_from_decl (r
);
5079 finish_member_declaration (r
);
5083 /* Set up the list (TYPE_METHODS) and vector (CLASSTYPE_METHOD_VEC)
5084 for this instantiation. */
5085 for (t
= TYPE_METHODS (pattern
); t
; t
= TREE_CHAIN (t
))
5087 tree r
= tsubst (t
, args
, /*complain=*/1, NULL_TREE
);
5088 set_current_access_from_decl (r
);
5089 finish_member_declaration (r
);
5092 /* Construct the DECL_FRIENDLIST for the new class type. */
5093 typedecl
= TYPE_MAIN_DECL (type
);
5094 for (t
= DECL_FRIENDLIST (TYPE_MAIN_DECL (pattern
));
5100 for (friends
= TREE_VALUE (t
);
5101 friends
!= NULL_TREE
;
5102 friends
= TREE_CHAIN (friends
))
5103 if (TREE_PURPOSE (friends
) == error_mark_node
)
5105 tsubst_friend_function (TREE_VALUE (friends
),
5108 my_friendly_abort (20000216);
5111 for (t
= CLASSTYPE_FRIEND_CLASSES (pattern
);
5115 tree friend_type
= TREE_VALUE (t
);
5116 tree new_friend_type
;
5118 if (TREE_CODE (friend_type
) == TEMPLATE_DECL
)
5119 new_friend_type
= tsubst_friend_class (friend_type
, args
);
5120 else if (uses_template_parms (friend_type
))
5121 new_friend_type
= tsubst (friend_type
, args
, /*complain=*/1,
5125 tree ns
= decl_namespace_context (TYPE_MAIN_DECL (friend_type
));
5127 /* The call to xref_tag_from_type does injection for friend
5129 push_nested_namespace (ns
);
5131 xref_tag_from_type (friend_type
, NULL_TREE
, 1);
5132 pop_nested_namespace (ns
);
5135 if (TREE_CODE (friend_type
) == TEMPLATE_DECL
)
5136 /* Trick make_friend_class into realizing that the friend
5137 we're adding is a template, not an ordinary class. It's
5138 important that we use make_friend_class since it will
5139 perform some error-checking and output cross-reference
5141 ++processing_template_decl
;
5143 make_friend_class (type
, new_friend_type
);
5145 if (TREE_CODE (friend_type
) == TEMPLATE_DECL
)
5146 --processing_template_decl
;
5149 for (t
= TYPE_FIELDS (type
); t
; t
= TREE_CHAIN (t
))
5150 if (TREE_CODE (t
) == FIELD_DECL
)
5152 TREE_TYPE (t
) = complete_type (TREE_TYPE (t
));
5153 require_complete_type (t
);
5156 /* Set the file and line number information to whatever is given for
5157 the class itself. This puts error messages involving generated
5158 implicit functions at a predictable point, and the same point
5159 that would be used for non-template classes. */
5160 lineno
= DECL_SOURCE_LINE (typedecl
);
5161 input_filename
= DECL_SOURCE_FILE (typedecl
);
5163 unreverse_member_declarations (type
);
5164 finish_struct_1 (type
);
5165 CLASSTYPE_GOT_SEMICOLON (type
) = 1;
5167 /* Clear this now so repo_template_used is happy. */
5168 TYPE_BEING_DEFINED (type
) = 0;
5169 repo_template_used (type
);
5171 /* Now that the class is complete, instantiate default arguments for
5172 any member functions. We don't do this earlier because the
5173 default arguments may reference members of the class. */
5174 if (!PRIMARY_TEMPLATE_P (template))
5175 for (t
= TYPE_METHODS (type
); t
; t
= TREE_CHAIN (t
))
5176 if (TREE_CODE (t
) == FUNCTION_DECL
5177 /* Implicitly generated member functions will not have tmplate
5178 information; they are not instantiations, but instead are
5179 created "fresh" for each instantiation. */
5180 && DECL_TEMPLATE_INFO (t
))
5181 tsubst_default_arguments (t
);
5184 pop_from_top_level ();
5194 if (t1
== NULL_TREE
)
5195 return t2
== NULL_TREE
;
5196 if (t2
== NULL_TREE
)
5198 /* Don't care if one declares its arg const and the other doesn't -- the
5199 main variant of the arg type is all that matters. */
5200 if (TYPE_MAIN_VARIANT (TREE_VALUE (t1
))
5201 != TYPE_MAIN_VARIANT (TREE_VALUE (t2
)))
5203 return list_eq (TREE_CHAIN (t1
), TREE_CHAIN (t2
));
5206 /* If arg is a non-type template parameter that does not depend on template
5207 arguments, fold it like we weren't in the body of a template. */
5210 maybe_fold_nontype_arg (arg
)
5213 /* If we're not in a template, ARG is already as simple as it's going to
5214 get, and trying to reprocess the trees will break. */
5215 if (! processing_template_decl
)
5218 if (!TYPE_P (arg
) && !uses_template_parms (arg
))
5220 /* Sometimes, one of the args was an expression involving a
5221 template constant parameter, like N - 1. Now that we've
5222 tsubst'd, we might have something like 2 - 1. This will
5223 confuse lookup_template_class, so we do constant folding
5224 here. We have to unset processing_template_decl, to
5225 fool build_expr_from_tree() into building an actual
5228 int saved_processing_template_decl
= processing_template_decl
;
5229 processing_template_decl
= 0;
5230 arg
= fold (build_expr_from_tree (arg
));
5231 processing_template_decl
= saved_processing_template_decl
;
5236 /* Substitute ARGS into the vector of template arguments T. */
5239 tsubst_template_arg_vector (t
, args
, complain
)
5244 int len
= TREE_VEC_LENGTH (t
), need_new
= 0, i
;
5245 tree
*elts
= (tree
*) alloca (len
* sizeof (tree
));
5247 bzero ((char *) elts
, len
* sizeof (tree
));
5249 for (i
= 0; i
< len
; i
++)
5251 if (TREE_VEC_ELT (t
, i
) != NULL_TREE
5252 && TREE_CODE (TREE_VEC_ELT (t
, i
)) == TREE_VEC
)
5253 elts
[i
] = tsubst_template_arg_vector (TREE_VEC_ELT (t
, i
),
5256 elts
[i
] = maybe_fold_nontype_arg
5257 (tsubst_expr (TREE_VEC_ELT (t
, i
), args
, complain
,
5260 if (elts
[i
] != TREE_VEC_ELT (t
, i
))
5267 t
= make_tree_vec (len
);
5268 for (i
= 0; i
< len
; i
++)
5269 TREE_VEC_ELT (t
, i
) = elts
[i
];
5274 /* Return the result of substituting ARGS into the template parameters
5275 given by PARMS. If there are m levels of ARGS and m + n levels of
5276 PARMS, then the result will contain n levels of PARMS. For
5277 example, if PARMS is `template <class T> template <class U>
5278 template <T*, U, class V>' and ARGS is {{int}, {double}} then the
5279 result will be `template <int*, double, class V>'. */
5282 tsubst_template_parms (parms
, args
, complain
)
5290 for (new_parms
= &r
;
5291 TMPL_PARMS_DEPTH (parms
) > TMPL_ARGS_DEPTH (args
);
5292 new_parms
= &(TREE_CHAIN (*new_parms
)),
5293 parms
= TREE_CHAIN (parms
))
5296 make_tree_vec (TREE_VEC_LENGTH (TREE_VALUE (parms
)));
5299 for (i
= 0; i
< TREE_VEC_LENGTH (new_vec
); ++i
)
5301 tree default_value
=
5302 TREE_PURPOSE (TREE_VEC_ELT (TREE_VALUE (parms
), i
));
5304 TREE_VALUE (TREE_VEC_ELT (TREE_VALUE (parms
), i
));
5306 TREE_VEC_ELT (new_vec
, i
)
5307 = build_tree_list (tsubst (default_value
, args
, complain
,
5309 tsubst (parm_decl
, args
, complain
,
5314 tree_cons (build_int_2 (0, (TMPL_PARMS_DEPTH (parms
)
5315 - TMPL_ARGS_DEPTH (args
))),
5316 new_vec
, NULL_TREE
);
5322 /* Substitute the ARGS into the indicated aggregate (or enumeration)
5323 type T. If T is not an aggregate or enumeration type, it is
5324 handled as if by tsubst. IN_DECL is as for tsubst. If
5325 ENTERING_SCOPE is non-zero, T is the context for a template which
5326 we are presently tsubst'ing. Return the subsituted value. */
5329 tsubst_aggr_type (t
, args
, complain
, in_decl
, entering_scope
)
5339 switch (TREE_CODE (t
))
5342 if (TYPE_PTRMEMFUNC_P (t
))
5344 tree r
= build_ptrmemfunc_type
5345 (tsubst (TYPE_PTRMEMFUNC_FN_TYPE (t
), args
, complain
, in_decl
));
5346 return cp_build_qualified_type_real (r
, TYPE_QUALS (t
),
5350 /* else fall through */
5353 if (TYPE_TEMPLATE_INFO (t
))
5359 /* First, determine the context for the type we are looking
5361 if (TYPE_CONTEXT (t
) != NULL_TREE
)
5362 context
= tsubst_aggr_type (TYPE_CONTEXT (t
), args
,
5364 in_decl
, /*entering_scope=*/1);
5366 context
= NULL_TREE
;
5368 /* Then, figure out what arguments are appropriate for the
5369 type we are trying to find. For example, given:
5371 template <class T> struct S;
5372 template <class T, class U> void f(T, U) { S<U> su; }
5374 and supposing that we are instantiating f<int, double>,
5375 then our ARGS will be {int, double}, but, when looking up
5376 S we only want {double}. */
5377 argvec
= tsubst_template_arg_vector (TYPE_TI_ARGS (t
), args
,
5380 r
= lookup_template_class (t
, argvec
, in_decl
, context
,
5383 return cp_build_qualified_type_real (r
, TYPE_QUALS (t
),
5387 /* This is not a template type, so there's nothing to do. */
5391 return tsubst (t
, args
, complain
, in_decl
);
5395 /* Substitute into the default argument ARG (a default argument for
5396 FN), which has the indicated TYPE. */
5399 tsubst_default_argument (fn
, type
, arg
)
5404 /* This default argument came from a template. Instantiate the
5405 default argument here, not in tsubst. In the case of
5414 we must be careful to do name lookup in the scope of S<T>,
5415 rather than in the current class. */
5416 if (DECL_CLASS_SCOPE_P (fn
))
5417 pushclass (DECL_CONTEXT (fn
), 2);
5419 arg
= tsubst_expr (arg
, DECL_TI_ARGS (fn
), /*complain=*/1, NULL_TREE
);
5421 if (DECL_CLASS_SCOPE_P (fn
))
5424 /* Make sure the default argument is reasonable. */
5425 arg
= check_default_argument (type
, arg
);
5430 /* Substitute into all the default arguments for FN. */
5433 tsubst_default_arguments (fn
)
5439 tmpl_args
= DECL_TI_ARGS (fn
);
5441 /* If this function is not yet instantiated, we certainly don't need
5442 its default arguments. */
5443 if (uses_template_parms (tmpl_args
))
5446 for (arg
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
5448 arg
= TREE_CHAIN (arg
))
5449 if (TREE_PURPOSE (arg
))
5450 TREE_PURPOSE (arg
) = tsubst_default_argument (fn
,
5452 TREE_PURPOSE (arg
));
5455 /* Substitute the ARGS into the T, which is a _DECL. TYPE is the
5456 (already computed) substitution of ARGS into TREE_TYPE (T), if
5457 appropriate. Return the result of the substitution. IN_DECL is as
5461 tsubst_decl (t
, args
, type
, in_decl
)
5468 const char *saved_filename
;
5471 /* Set the filename and linenumber to improve error-reporting. */
5472 saved_lineno
= lineno
;
5473 saved_filename
= input_filename
;
5474 lineno
= DECL_SOURCE_LINE (t
);
5475 input_filename
= DECL_SOURCE_FILE (t
);
5477 switch (TREE_CODE (t
))
5481 /* We can get here when processing a member template function
5482 of a template class. */
5483 tree decl
= DECL_TEMPLATE_RESULT (t
);
5485 int is_template_template_parm
= DECL_TEMPLATE_TEMPLATE_PARM_P (t
);
5487 if (!is_template_template_parm
)
5489 /* We might already have an instance of this template.
5490 The ARGS are for the surrounding class type, so the
5491 full args contain the tsubst'd args for the context,
5492 plus the innermost args from the template decl. */
5493 tree tmpl_args
= DECL_CLASS_TEMPLATE_P (t
)
5494 ? CLASSTYPE_TI_ARGS (TREE_TYPE (t
))
5495 : DECL_TI_ARGS (DECL_TEMPLATE_RESULT (t
));
5498 full_args
= tsubst_template_arg_vector (tmpl_args
, args
,
5501 /* tsubst_template_arg_vector doesn't copy the vector if
5502 nothing changed. But, *something* should have
5504 my_friendly_assert (full_args
!= tmpl_args
, 0);
5506 spec
= retrieve_specialization (t
, full_args
);
5507 if (spec
!= NULL_TREE
)
5514 /* Make a new template decl. It will be similar to the
5515 original, but will record the current template arguments.
5516 We also create a new function declaration, which is just
5517 like the old one, but points to this new template, rather
5518 than the old one. */
5520 my_friendly_assert (DECL_LANG_SPECIFIC (r
) != 0, 0);
5521 TREE_CHAIN (r
) = NULL_TREE
;
5523 if (is_template_template_parm
)
5525 tree new_decl
= tsubst (decl
, args
, /*complain=*/1, in_decl
);
5526 DECL_TEMPLATE_RESULT (r
) = new_decl
;
5527 TREE_TYPE (r
) = TREE_TYPE (new_decl
);
5532 = tsubst_aggr_type (DECL_CONTEXT (t
), args
,
5533 /*complain=*/1, in_decl
,
5534 /*entering_scope=*/1);
5535 DECL_VIRTUAL_CONTEXT (r
)
5536 = tsubst_aggr_type (DECL_VIRTUAL_CONTEXT (t
), args
,
5537 /*complain=*/1, in_decl
,
5538 /*entering_scope=*/1);
5539 DECL_TEMPLATE_INFO (r
) = build_tree_list (t
, args
);
5541 if (TREE_CODE (decl
) == TYPE_DECL
)
5543 tree new_type
= tsubst (TREE_TYPE (t
), args
,
5544 /*complain=*/1, in_decl
);
5545 TREE_TYPE (r
) = new_type
;
5546 CLASSTYPE_TI_TEMPLATE (new_type
) = r
;
5547 DECL_TEMPLATE_RESULT (r
) = TYPE_MAIN_DECL (new_type
);
5548 DECL_TI_ARGS (r
) = CLASSTYPE_TI_ARGS (new_type
);
5552 tree new_decl
= tsubst (decl
, args
, /*complain=*/1, in_decl
);
5554 DECL_TEMPLATE_RESULT (r
) = new_decl
;
5555 DECL_TI_TEMPLATE (new_decl
) = r
;
5556 TREE_TYPE (r
) = TREE_TYPE (new_decl
);
5557 DECL_TI_ARGS (r
) = DECL_TI_ARGS (new_decl
);
5560 SET_DECL_IMPLICIT_INSTANTIATION (r
);
5561 DECL_TEMPLATE_INSTANTIATIONS (r
) = NULL_TREE
;
5562 DECL_TEMPLATE_SPECIALIZATIONS (r
) = NULL_TREE
;
5564 /* The template parameters for this new template are all the
5565 template parameters for the old template, except the
5566 outermost level of parameters. */
5567 DECL_TEMPLATE_PARMS (r
)
5568 = tsubst_template_parms (DECL_TEMPLATE_PARMS (t
), args
,
5571 if (PRIMARY_TEMPLATE_P (t
))
5572 DECL_PRIMARY_TEMPLATE (r
) = r
;
5574 /* We don't partially instantiate partial specializations. */
5575 if (TREE_CODE (decl
) == TYPE_DECL
)
5578 /* Record this partial instantiation. */
5579 register_specialization (r
, t
,
5580 DECL_TI_ARGS (DECL_TEMPLATE_RESULT (r
)));
5588 tree argvec
= NULL_TREE
;
5595 /* Nobody should be tsubst'ing into non-template functions. */
5596 my_friendly_assert (DECL_TEMPLATE_INFO (t
) != NULL_TREE
, 0);
5598 if (TREE_CODE (DECL_TI_TEMPLATE (t
)) == TEMPLATE_DECL
)
5602 /* Calculate the most general template of which R is a
5603 specialization, and the complete set of arguments used to
5605 gen_tmpl
= most_general_template (DECL_TI_TEMPLATE (t
));
5607 = tsubst_template_arg_vector (DECL_TI_ARGS
5608 (DECL_TEMPLATE_RESULT (gen_tmpl
)),
5609 args
, /*complain=*/1);
5611 /* Check to see if we already have this specialization. */
5612 spec
= retrieve_specialization (gen_tmpl
, argvec
);
5620 /* We can see more levels of arguments than parameters if
5621 there was a specialization of a member template, like
5624 template <class T> struct S { template <class U> void f(); }
5625 template <> template <class U> void S<int>::f(U);
5627 Here, we'll be subtituting into the specialization,
5628 because that's where we can find the code we actually
5629 want to generate, but we'll have enough arguments for
5630 the most general template.
5632 We also deal with the peculiar case:
5634 template <class T> struct S {
5635 template <class U> friend void f();
5637 template <class U> void f() {}
5639 template void f<double>();
5641 Here, the ARGS for the instantiation of will be {int,
5642 double}. But, we only need as many ARGS as there are
5643 levels of template parameters in CODE_PATTERN. We are
5644 careful not to get fooled into reducing the ARGS in
5647 template <class T> struct S { template <class U> void f(U); }
5648 template <class T> template <> void S<T>::f(int) {}
5650 which we can spot because the pattern will be a
5651 specialization in this case. */
5652 args_depth
= TMPL_ARGS_DEPTH (args
);
5654 TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (DECL_TI_TEMPLATE (t
)));
5655 if (args_depth
> parms_depth
5656 && !DECL_TEMPLATE_SPECIALIZATION (t
))
5657 args
= get_innermost_template_args (args
, parms_depth
);
5661 /* This special case arises when we have something like this:
5663 template <class T> struct S {
5664 friend void f<int>(int, double);
5667 Here, the DECL_TI_TEMPLATE for the friend declaration
5668 will be a LOOKUP_EXPR or an IDENTIFIER_NODE. We are
5669 being called from tsubst_friend_function, and we want
5670 only to create a new decl (R) with appropriate types so
5671 that we can call determine_specialization. */
5672 my_friendly_assert ((TREE_CODE (DECL_TI_TEMPLATE (t
))
5674 || (TREE_CODE (DECL_TI_TEMPLATE (t
))
5675 == IDENTIFIER_NODE
), 0);
5676 gen_tmpl
= NULL_TREE
;
5679 if (DECL_CLASS_SCOPE_P (t
))
5681 if (DECL_NAME (t
) == constructor_name (DECL_CONTEXT (t
)))
5685 ctx
= tsubst_aggr_type (DECL_CONTEXT (t
), args
,
5687 /*entering_scope=*/1);
5692 ctx
= DECL_CONTEXT (t
);
5694 type
= tsubst (type
, args
, /*complain=*/1, in_decl
);
5695 if (type
== error_mark_node
)
5696 return error_mark_node
;
5698 /* We do NOT check for matching decls pushed separately at this
5699 point, as they may not represent instantiations of this
5700 template, and in any case are considered separate under the
5701 discrete model. Instead, see add_maybe_template. */
5703 DECL_USE_TEMPLATE (r
) = 0;
5704 TREE_TYPE (r
) = type
;
5706 DECL_CONTEXT (r
) = ctx
;
5707 DECL_VIRTUAL_CONTEXT (r
)
5708 = tsubst_aggr_type (DECL_VIRTUAL_CONTEXT (t
), args
,
5710 /*entering_scope=*/1);
5712 if (member
&& DECL_CONV_FN_P (r
))
5714 /* Type-conversion operator. Reconstruct the name, in
5715 case it's the name of one of the template's parameters. */
5717 DECL_NAME (r
) = mangle_conv_op_name_for_type (TREE_TYPE (type
));
5719 DECL_NAME (r
) = build_typename_overload (TREE_TYPE (type
));
5722 DECL_ARGUMENTS (r
) = tsubst (DECL_ARGUMENTS (t
), args
,
5724 DECL_TEMPLATE_RESULT (r
) = NULL_TREE
;
5726 TREE_STATIC (r
) = 0;
5727 TREE_PUBLIC (r
) = TREE_PUBLIC (t
);
5728 DECL_EXTERNAL (r
) = 1;
5729 DECL_INTERFACE_KNOWN (r
) = 0;
5730 DECL_DEFER_OUTPUT (r
) = 0;
5731 TREE_CHAIN (r
) = NULL_TREE
;
5732 DECL_PENDING_INLINE_INFO (r
) = 0;
5733 DECL_PENDING_INLINE_P (r
) = 0;
5734 DECL_SAVED_TREE (r
) = NULL_TREE
;
5736 if (DECL_CLONED_FUNCTION (r
))
5738 DECL_CLONED_FUNCTION (r
) = tsubst (DECL_CLONED_FUNCTION (t
),
5739 args
, /*complain=*/1, t
);
5740 TREE_CHAIN (r
) = TREE_CHAIN (DECL_CLONED_FUNCTION (r
));
5741 TREE_CHAIN (DECL_CLONED_FUNCTION (r
)) = r
;
5744 /* Set up the DECL_TEMPLATE_INFO for R and compute its mangled
5745 name. There's no need to do this in the special friend
5746 case mentioned above where GEN_TMPL is NULL. */
5749 DECL_TEMPLATE_INFO (r
)
5750 = tree_cons (gen_tmpl
, argvec
, NULL_TREE
);
5751 SET_DECL_IMPLICIT_INSTANTIATION (r
);
5752 register_specialization (r
, gen_tmpl
, argvec
);
5754 /* Set the mangled name for R. */
5755 if (DECL_DESTRUCTOR_P (t
))
5758 set_mangled_name_for_decl (r
);
5760 DECL_ASSEMBLER_NAME (r
) = build_destructor_name (ctx
);
5764 /* Instantiations of template functions must be mangled
5765 specially, in order to conform to 14.5.5.1
5766 [temp.over.link]. */
5767 tree tmpl
= DECL_TI_TEMPLATE (t
);
5769 /* TMPL will be NULL if this is a specialization of a
5770 member function of a template class. */
5771 if (name_mangling_version
< 1
5772 || tmpl
== NULL_TREE
5773 || (member
&& !is_member_template (tmpl
)
5774 && !DECL_TEMPLATE_INFO (tmpl
)))
5775 set_mangled_name_for_decl (r
);
5777 set_mangled_name_for_template_decl (r
);
5781 make_decl_rtl (r
, NULL_PTR
, 1);
5783 /* Like grokfndecl. If we don't do this, pushdecl will
5784 mess up our TREE_CHAIN because it doesn't find a
5785 previous decl. Sigh. */
5787 && ! uses_template_parms (r
)
5788 && (IDENTIFIER_GLOBAL_VALUE (DECL_ASSEMBLER_NAME (r
))
5790 SET_IDENTIFIER_GLOBAL_VALUE (DECL_ASSEMBLER_NAME (r
), r
);
5792 /* We're not supposed to instantiate default arguments
5793 until they are called, for a template. But, for a
5796 template <class T> void f ()
5797 { extern void g(int i = T()); }
5799 we should do the substitution when the template is
5800 instantiated. We handle the member function case in
5801 instantiate_class_template since the default arguments
5802 might refer to other members of the class. */
5804 && !PRIMARY_TEMPLATE_P (gen_tmpl
)
5805 && !uses_template_parms (argvec
))
5806 tsubst_default_arguments (r
);
5809 /* Copy the list of befriending classes. */
5810 for (friends
= &DECL_BEFRIENDING_CLASSES (r
);
5812 friends
= &TREE_CHAIN (*friends
))
5814 *friends
= copy_node (*friends
);
5815 TREE_VALUE (*friends
) = tsubst (TREE_VALUE (*friends
),
5816 args
, /*complain=*/1,
5820 if (DECL_CONSTRUCTOR_P (r
) || DECL_DESTRUCTOR_P (r
))
5822 maybe_retrofit_in_chrg (r
);
5823 if (DECL_CONSTRUCTOR_P (r
))
5824 grok_ctor_properties (ctx
, r
);
5826 else if (IDENTIFIER_OPNAME_P (DECL_NAME (r
)))
5827 grok_op_properties (r
, DECL_VIRTUAL_P (r
), DECL_FRIEND_P (r
));
5834 TREE_TYPE (r
) = type
;
5835 c_apply_type_quals_to_decl (CP_TYPE_QUALS (type
), r
);
5837 if (TREE_CODE (DECL_INITIAL (r
)) != TEMPLATE_PARM_INDEX
)
5838 DECL_INITIAL (r
) = TREE_TYPE (r
);
5840 DECL_INITIAL (r
) = tsubst (DECL_INITIAL (r
), args
,
5841 /*complain=*/1, in_decl
);
5843 DECL_CONTEXT (r
) = NULL_TREE
;
5844 if (PROMOTE_PROTOTYPES
5845 && (TREE_CODE (type
) == INTEGER_TYPE
5846 || TREE_CODE (type
) == ENUMERAL_TYPE
)
5847 && TYPE_PRECISION (type
) < TYPE_PRECISION (integer_type_node
))
5848 DECL_ARG_TYPE (r
) = integer_type_node
;
5850 TREE_CHAIN (r
) = tsubst (TREE_CHAIN (t
), args
,
5851 /*complain=*/1, TREE_CHAIN (t
));
5858 TREE_TYPE (r
) = type
;
5859 c_apply_type_quals_to_decl (CP_TYPE_QUALS (type
), r
);
5861 /* We don't have to set DECL_CONTEXT here; it is set by
5862 finish_member_declaration. */
5863 DECL_INITIAL (r
) = tsubst_expr (DECL_INITIAL (t
), args
,
5864 /*complain=*/1, in_decl
);
5865 TREE_CHAIN (r
) = NULL_TREE
;
5866 if (TREE_CODE (type
) == VOID_TYPE
)
5867 cp_error_at ("instantiation of `%D' as type void", r
);
5875 = tsubst_copy (DECL_INITIAL (t
), args
, /*complain=*/1, in_decl
);
5876 TREE_CHAIN (r
) = NULL_TREE
;
5881 if (TREE_CODE (type
) == TEMPLATE_TEMPLATE_PARM
5882 || t
== TYPE_MAIN_DECL (TREE_TYPE (t
)))
5884 /* If this is the canonical decl, we don't have to mess with
5885 instantiations, and often we can't (for typename, template
5886 type parms and such). Note that TYPE_NAME is not correct for
5887 the above test if we've copied the type for a typedef. */
5888 r
= TYPE_NAME (type
);
5896 tree argvec
= NULL_TREE
;
5897 tree gen_tmpl
= NULL_TREE
;
5899 tree tmpl
= NULL_TREE
;
5903 /* Assume this is a non-local variable. */
5906 if (TYPE_P (CP_DECL_CONTEXT (t
)))
5907 ctx
= tsubst_aggr_type (DECL_CONTEXT (t
), args
,
5909 in_decl
, /*entering_scope=*/1);
5912 /* Subsequent calls to pushdecl will fill this in. */
5914 if (!DECL_NAMESPACE_SCOPE_P (t
))
5918 /* Check to see if we already have this specialization. */
5921 tmpl
= DECL_TI_TEMPLATE (t
);
5922 gen_tmpl
= most_general_template (tmpl
);
5923 argvec
= tsubst (DECL_TI_ARGS (t
), args
, /*complain=*/1, in_decl
);
5924 spec
= retrieve_specialization (gen_tmpl
, argvec
);
5927 spec
= retrieve_local_specialization (t
);
5936 TREE_TYPE (r
) = type
;
5937 c_apply_type_quals_to_decl (CP_TYPE_QUALS (type
), r
);
5938 DECL_CONTEXT (r
) = ctx
;
5940 /* Don't try to expand the initializer until someone tries to use
5941 this variable; otherwise we run into circular dependencies. */
5942 DECL_INITIAL (r
) = NULL_TREE
;
5944 DECL_SIZE (r
) = DECL_SIZE_UNIT (r
) = 0;
5946 /* For __PRETTY_FUNCTION__ we have to adjust the initializer. */
5947 if (DECL_PRETTY_FUNCTION_P (r
))
5949 DECL_INITIAL (r
) = tsubst (DECL_INITIAL (t
),
5953 TREE_TYPE (r
) = TREE_TYPE (DECL_INITIAL (r
));
5956 /* Even if the original location is out of scope, the newly
5957 substituted one is not. */
5958 if (TREE_CODE (r
) == VAR_DECL
)
5959 DECL_DEAD_FOR_LOCAL (r
) = 0;
5963 /* A static data member declaration is always marked
5964 external when it is declared in-class, even if an
5965 initializer is present. We mimic the non-template
5967 DECL_EXTERNAL (r
) = 1;
5969 register_specialization (r
, gen_tmpl
, argvec
);
5970 DECL_TEMPLATE_INFO (r
) = tree_cons (tmpl
, argvec
, NULL_TREE
);
5971 SET_DECL_IMPLICIT_INSTANTIATION (r
);
5974 register_local_specialization (r
, t
);
5976 TREE_CHAIN (r
) = NULL_TREE
;
5977 if (TREE_CODE (r
) == VAR_DECL
&& TREE_CODE (type
) == VOID_TYPE
)
5978 cp_error_at ("instantiation of `%D' as type void", r
);
5983 my_friendly_abort (0);
5986 /* Restore the file and line information. */
5987 lineno
= saved_lineno
;
5988 input_filename
= saved_filename
;
5993 /* Substitue into the ARG_TYPES of a function type. */
5996 tsubst_arg_types (arg_types
, args
, complain
, in_decl
)
6002 tree remaining_arg_types
;
6005 if (!arg_types
|| arg_types
== void_list_node
)
6008 remaining_arg_types
= tsubst_arg_types (TREE_CHAIN (arg_types
),
6009 args
, complain
, in_decl
);
6010 if (remaining_arg_types
== error_mark_node
)
6011 return error_mark_node
;
6013 type
= tsubst (TREE_VALUE (arg_types
), args
, complain
, in_decl
);
6014 if (type
== error_mark_node
)
6015 return error_mark_node
;
6017 /* Do array-to-pointer, function-to-pointer conversion, and ignore
6018 top-level qualifiers as required. */
6019 type
= TYPE_MAIN_VARIANT (type_decays_to (type
));
6021 /* Note that we do not substitute into default arguments here. The
6022 standard mandates that they be instantiated only when needed,
6023 which is done in build_over_call. */
6024 return hash_tree_cons (TREE_PURPOSE (arg_types
), type
,
6025 remaining_arg_types
);
6029 /* Substitute into a FUNCTION_TYPE or METHOD_TYPE. This routine does
6030 *not* handle the exception-specification for FNTYPE, because the
6031 initial substitution of explicitly provided template parameters
6032 during argument deduction forbids substitution into the
6033 exception-specification:
6037 All references in the function type of the function template to the
6038 corresponding template parameters are replaced by the specified tem-
6039 plate argument values. If a substitution in a template parameter or
6040 in the function type of the function template results in an invalid
6041 type, type deduction fails. [Note: The equivalent substitution in
6042 exception specifications is done only when the function is instanti-
6043 ated, at which point a program is ill-formed if the substitution
6044 results in an invalid type.] */
6047 tsubst_function_type (t
, args
, complain
, in_decl
)
6057 /* The TYPE_CONTEXT is not used for function/method types. */
6058 my_friendly_assert (TYPE_CONTEXT (t
) == NULL_TREE
, 0);
6060 /* Substitue the return type. */
6061 return_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
6062 if (return_type
== error_mark_node
)
6063 return error_mark_node
;
6065 /* Substitue the argument types. */
6066 arg_types
= tsubst_arg_types (TYPE_ARG_TYPES (t
), args
,
6068 if (arg_types
== error_mark_node
)
6069 return error_mark_node
;
6071 /* Construct a new type node and return it. */
6072 if (TREE_CODE (t
) == FUNCTION_TYPE
)
6073 fntype
= build_function_type (return_type
, arg_types
);
6076 tree r
= TREE_TYPE (TREE_VALUE (arg_types
));
6077 if (! IS_AGGR_TYPE (r
))
6081 Type deduction may fail for any of the following
6084 -- Attempting to create "pointer to member of T" when T
6085 is not a class type. */
6087 cp_error ("creating pointer to member function of non-class type `%T'",
6089 return error_mark_node
;
6092 fntype
= build_cplus_method_type (r
, return_type
, TREE_CHAIN
6095 fntype
= build_qualified_type (fntype
, TYPE_QUALS (t
));
6096 fntype
= build_type_attribute_variant (fntype
, TYPE_ATTRIBUTES (t
));
6101 /* Substitute into the PARMS of a call-declarator. */
6104 tsubst_call_declarator_parms (parms
, args
, complain
, in_decl
)
6114 if (!parms
|| parms
== void_list_node
)
6117 new_parms
= tsubst_call_declarator_parms (TREE_CHAIN (parms
),
6118 args
, complain
, in_decl
);
6120 /* Figure out the type of this parameter. */
6121 type
= tsubst (TREE_VALUE (parms
), args
, complain
, in_decl
);
6123 /* Figure out the default argument as well. Note that we use
6124 tsubst_expr since the default argument is really an expression. */
6125 defarg
= tsubst_expr (TREE_PURPOSE (parms
), args
, complain
, in_decl
);
6127 /* Chain this parameter on to the front of those we have already
6128 processed. We don't use hash_tree_cons because that function
6129 doesn't check TREE_PARMLIST. */
6130 new_parms
= tree_cons (defarg
, type
, new_parms
);
6132 /* And note that these are parameters. */
6133 TREE_PARMLIST (new_parms
) = 1;
6138 /* Take the tree structure T and replace template parameters used
6139 therein with the argument vector ARGS. IN_DECL is an associated
6140 decl for diagnostics. If an error occurs, returns ERROR_MARK_NODE.
6141 An appropriate error message is issued only if COMPLAIN is
6142 non-zero. Note that we must be relatively non-tolerant of
6143 extensions here, in order to preserve conformance; if we allow
6144 substitutions that should not be allowed, we may allow argument
6145 deductions that should not succeed, and therefore report ambiguous
6146 overload situations where there are none. In theory, we could
6147 allow the substitution, but indicate that it should have failed,
6148 and allow our caller to make sure that the right thing happens, but
6149 we don't try to do this yet.
6151 This function is used for dealing with types, decls and the like;
6152 for expressions, use tsubst_expr or tsubst_copy. */
6155 tsubst (t
, args
, complain
, in_decl
)
6162 if (t
== NULL_TREE
|| t
== error_mark_node
6163 || t
== integer_type_node
6164 || t
== void_type_node
6165 || t
== char_type_node
6166 || TREE_CODE (t
) == NAMESPACE_DECL
)
6169 if (TREE_CODE (t
) == IDENTIFIER_NODE
)
6170 type
= IDENTIFIER_TYPE_VALUE (t
);
6172 type
= TREE_TYPE (t
);
6173 if (type
== unknown_type_node
)
6174 my_friendly_abort (42);
6176 if (type
&& TREE_CODE (t
) != FUNCTION_DECL
6177 && TREE_CODE (t
) != TYPENAME_TYPE
6178 && TREE_CODE (t
) != TEMPLATE_DECL
6179 && TREE_CODE (t
) != IDENTIFIER_NODE
6180 && TREE_CODE (t
) != FUNCTION_TYPE
6181 && TREE_CODE (t
) != METHOD_TYPE
)
6182 type
= tsubst (type
, args
, complain
, in_decl
);
6183 if (type
== error_mark_node
)
6184 return error_mark_node
;
6187 return tsubst_decl (t
, args
, type
, in_decl
);
6189 switch (TREE_CODE (t
))
6194 return tsubst_aggr_type (t
, args
, complain
, in_decl
,
6195 /*entering_scope=*/0);
6198 case IDENTIFIER_NODE
:
6210 if (t
== integer_type_node
)
6213 if (TREE_CODE (TYPE_MIN_VALUE (t
)) == INTEGER_CST
6214 && TREE_CODE (TYPE_MAX_VALUE (t
)) == INTEGER_CST
)
6218 tree max
, omax
= TREE_OPERAND (TYPE_MAX_VALUE (t
), 0);
6220 max
= tsubst_expr (omax
, args
, complain
, in_decl
);
6221 if (max
== error_mark_node
)
6222 return error_mark_node
;
6224 /* See if we can reduce this expression to something simpler. */
6225 max
= maybe_fold_nontype_arg (max
);
6226 if (!processing_template_decl
)
6227 max
= decl_constant_value (max
);
6229 if (processing_template_decl
6230 /* When providing explicit arguments to a template
6231 function, but leaving some arguments for subsequent
6232 deduction, MAX may be template-dependent even if we're
6233 not PROCESSING_TEMPLATE_DECL. We still need to check for
6234 template parms, though; MAX won't be an INTEGER_CST for
6235 dynamic arrays, either. */
6236 || (TREE_CODE (max
) != INTEGER_CST
6237 && uses_template_parms (max
)))
6239 tree itype
= make_node (INTEGER_TYPE
);
6240 TYPE_MIN_VALUE (itype
) = size_zero_node
;
6241 TYPE_MAX_VALUE (itype
) = build_min (MINUS_EXPR
, sizetype
, max
,
6246 if (integer_zerop (omax
))
6248 /* Still allow an explicit array of size zero. */
6250 pedwarn ("creating array with size zero");
6252 else if (integer_zerop (max
)
6253 || (TREE_CODE (max
) == INTEGER_CST
6254 && INT_CST_LT (max
, integer_zero_node
)))
6258 Type deduction may fail for any of the following
6261 Attempting to create an array with a size that is
6262 zero or negative. */
6264 cp_error ("creating array with size zero (`%E')", max
);
6266 return error_mark_node
;
6269 return compute_array_index_type (NULL_TREE
, max
);
6272 case TEMPLATE_TYPE_PARM
:
6273 case TEMPLATE_TEMPLATE_PARM
:
6274 case TEMPLATE_PARM_INDEX
:
6282 if (TREE_CODE (t
) == TEMPLATE_TYPE_PARM
6283 || TREE_CODE (t
) == TEMPLATE_TEMPLATE_PARM
)
6285 idx
= TEMPLATE_TYPE_IDX (t
);
6286 level
= TEMPLATE_TYPE_LEVEL (t
);
6290 idx
= TEMPLATE_PARM_IDX (t
);
6291 level
= TEMPLATE_PARM_LEVEL (t
);
6294 if (TREE_VEC_LENGTH (args
) > 0)
6296 tree arg
= NULL_TREE
;
6298 levels
= TMPL_ARGS_DEPTH (args
);
6299 if (level
<= levels
)
6300 arg
= TMPL_ARG (args
, level
, idx
);
6302 if (arg
== error_mark_node
)
6303 return error_mark_node
;
6304 else if (arg
!= NULL_TREE
)
6306 if (TREE_CODE (t
) == TEMPLATE_TYPE_PARM
)
6308 my_friendly_assert (TYPE_P (arg
), 0);
6309 return cp_build_qualified_type_real
6310 (arg
, CP_TYPE_QUALS (arg
) | CP_TYPE_QUALS (t
),
6313 else if (TREE_CODE (t
) == TEMPLATE_TEMPLATE_PARM
)
6315 if (TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (t
))
6317 /* We are processing a type constructed from
6318 a template template parameter */
6319 tree argvec
= tsubst (TYPE_TI_ARGS (t
),
6320 args
, complain
, in_decl
);
6321 if (argvec
== error_mark_node
)
6322 return error_mark_node
;
6324 /* We can get a TEMPLATE_TEMPLATE_PARM here when
6325 we are resolving nested-types in the signature of
6326 a member function templates.
6327 Otherwise ARG is a TEMPLATE_DECL and is the real
6328 template to be instantiated. */
6329 if (TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
)
6330 arg
= TYPE_NAME (arg
);
6332 r
= lookup_template_class (arg
,
6335 /*entering_scope=*/0);
6336 return cp_build_qualified_type_real (r
,
6341 /* We are processing a template argument list. */
6349 my_friendly_abort (981018);
6352 /* This can happen during the attempted tsubst'ing in
6353 unify. This means that we don't yet have any information
6354 about the template parameter in question. */
6357 /* If we get here, we must have been looking at a parm for a
6358 more deeply nested template. Make a new version of this
6359 template parameter, but with a lower level. */
6360 switch (TREE_CODE (t
))
6362 case TEMPLATE_TYPE_PARM
:
6363 case TEMPLATE_TEMPLATE_PARM
:
6364 if (CP_TYPE_QUALS (t
))
6366 r
= tsubst (TYPE_MAIN_VARIANT (t
), args
, complain
, in_decl
);
6367 r
= cp_build_qualified_type_real (r
, CP_TYPE_QUALS (t
),
6373 TEMPLATE_TYPE_PARM_INDEX (r
)
6374 = reduce_template_parm_level (TEMPLATE_TYPE_PARM_INDEX (t
),
6376 TYPE_STUB_DECL (r
) = TYPE_NAME (r
) = TEMPLATE_TYPE_DECL (r
);
6377 TYPE_MAIN_VARIANT (r
) = r
;
6378 TYPE_POINTER_TO (r
) = NULL_TREE
;
6379 TYPE_REFERENCE_TO (r
) = NULL_TREE
;
6381 if (TREE_CODE (t
) == TEMPLATE_TEMPLATE_PARM
6382 && TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (t
))
6384 tree argvec
= tsubst (TYPE_TI_ARGS (t
), args
,
6386 if (argvec
== error_mark_node
)
6387 return error_mark_node
;
6389 TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (r
)
6390 = tree_cons (TYPE_TI_TEMPLATE (t
), argvec
, NULL_TREE
);
6395 case TEMPLATE_PARM_INDEX
:
6396 r
= reduce_template_parm_level (t
, type
, levels
);
6400 my_friendly_abort (0);
6408 tree purpose
, value
, chain
, result
;
6410 if (t
== void_list_node
)
6413 purpose
= TREE_PURPOSE (t
);
6416 purpose
= tsubst (purpose
, args
, complain
, in_decl
);
6417 if (purpose
== error_mark_node
)
6418 return error_mark_node
;
6420 value
= TREE_VALUE (t
);
6423 value
= tsubst (value
, args
, complain
, in_decl
);
6424 if (value
== error_mark_node
)
6425 return error_mark_node
;
6427 chain
= TREE_CHAIN (t
);
6428 if (chain
&& chain
!= void_type_node
)
6430 chain
= tsubst (chain
, args
, complain
, in_decl
);
6431 if (chain
== error_mark_node
)
6432 return error_mark_node
;
6434 if (purpose
== TREE_PURPOSE (t
)
6435 && value
== TREE_VALUE (t
)
6436 && chain
== TREE_CHAIN (t
))
6438 result
= hash_tree_cons (purpose
, value
, chain
);
6439 TREE_PARMLIST (result
) = TREE_PARMLIST (t
);
6443 if (type
!= NULL_TREE
)
6445 /* A binfo node. We always need to make a copy, of the node
6446 itself and of its BINFO_BASETYPES. */
6450 /* Make sure type isn't a typedef copy. */
6451 type
= BINFO_TYPE (TYPE_BINFO (type
));
6453 TREE_TYPE (t
) = complete_type (type
);
6454 if (IS_AGGR_TYPE (type
))
6456 BINFO_VTABLE (t
) = TYPE_BINFO_VTABLE (type
);
6457 BINFO_VIRTUALS (t
) = TYPE_BINFO_VIRTUALS (type
);
6458 if (TYPE_BINFO_BASETYPES (type
) != NULL_TREE
)
6459 BINFO_BASETYPES (t
) = copy_node (TYPE_BINFO_BASETYPES (type
));
6464 /* Otherwise, a vector of template arguments. */
6465 return tsubst_template_arg_vector (t
, args
, complain
);
6468 case REFERENCE_TYPE
:
6470 enum tree_code code
;
6472 if (type
== TREE_TYPE (t
))
6475 code
= TREE_CODE (t
);
6480 Type deduction may fail for any of the following
6483 -- Attempting to create a pointer to reference type.
6484 -- Attempting to create a reference to a reference type or
6485 a reference to void. */
6486 if (TREE_CODE (type
) == REFERENCE_TYPE
6487 || (code
== REFERENCE_TYPE
&& TREE_CODE (type
) == VOID_TYPE
))
6489 static int last_line
= 0;
6490 static const char* last_file
= 0;
6492 /* We keep track of the last time we issued this error
6493 message to avoid spewing a ton of messages during a
6494 single bad template instantiation. */
6495 if (complain
&& (last_line
!= lineno
||
6496 last_file
!= input_filename
))
6498 if (TREE_CODE (type
) == VOID_TYPE
)
6499 cp_error ("forming reference to void");
6501 cp_error ("forming %s to reference type `%T'",
6502 (code
== POINTER_TYPE
) ? "pointer" : "reference",
6505 last_file
= input_filename
;
6508 return error_mark_node
;
6510 else if (code
== POINTER_TYPE
)
6511 r
= build_pointer_type (type
);
6513 r
= build_reference_type (type
);
6514 r
= cp_build_qualified_type_real (r
, TYPE_QUALS (t
), complain
);
6516 /* Will this ever be needed for TYPE_..._TO values? */
6522 r
= tsubst (TYPE_OFFSET_BASETYPE (t
), args
, complain
, in_decl
);
6523 if (r
== error_mark_node
|| !IS_AGGR_TYPE (r
))
6527 Type deduction may fail for any of the following
6530 -- Attempting to create "pointer to member of T" when T
6531 is not a class type. */
6533 cp_error ("creating pointer to member of non-class type `%T'",
6535 return error_mark_node
;
6537 return build_offset_type (r
, type
);
6545 fntype
= tsubst_function_type (t
, args
, complain
, in_decl
);
6546 if (fntype
== error_mark_node
)
6547 return error_mark_node
;
6549 /* Substitue the exception specification. */
6550 raises
= TYPE_RAISES_EXCEPTIONS (t
);
6553 tree list
= NULL_TREE
;
6555 if (! TREE_VALUE (raises
))
6558 for (; raises
!= NULL_TREE
; raises
= TREE_CHAIN (raises
))
6560 tree spec
= TREE_VALUE (raises
);
6562 spec
= tsubst (spec
, args
, complain
, in_decl
);
6563 if (spec
== error_mark_node
)
6565 list
= add_exception_specifier (list
, spec
, complain
);
6567 fntype
= build_exception_variant (fntype
, list
);
6573 tree domain
= tsubst (TYPE_DOMAIN (t
), args
, complain
, in_decl
);
6574 if (domain
== error_mark_node
)
6575 return error_mark_node
;
6577 /* As an optimization, we avoid regenerating the array type if
6578 it will obviously be the same as T. */
6579 if (type
== TREE_TYPE (t
) && domain
== TYPE_DOMAIN (t
))
6582 /* These checks should match the ones in grokdeclarator.
6586 The deduction may fail for any of the following reasons:
6588 -- Attempting to create an array with an element type that
6589 is void, a function type, or a reference type. */
6590 if (TREE_CODE (type
) == VOID_TYPE
6591 || TREE_CODE (type
) == FUNCTION_TYPE
6592 || TREE_CODE (type
) == REFERENCE_TYPE
)
6595 cp_error ("creating array of `%T'", type
);
6596 return error_mark_node
;
6599 r
= build_cplus_array_type (type
, domain
);
6606 tree e1
= tsubst (TREE_OPERAND (t
, 0), args
, complain
,
6608 tree e2
= tsubst (TREE_OPERAND (t
, 1), args
, complain
,
6611 if (e1
== error_mark_node
|| e2
== error_mark_node
)
6612 return error_mark_node
;
6614 return fold (build (TREE_CODE (t
), TREE_TYPE (t
), e1
, e2
));
6620 tree e
= tsubst (TREE_OPERAND (t
, 0), args
, complain
,
6622 if (e
== error_mark_node
)
6623 return error_mark_node
;
6625 return fold (build (TREE_CODE (t
), TREE_TYPE (t
), e
));
6630 tree ctx
= tsubst_aggr_type (TYPE_CONTEXT (t
), args
, complain
,
6631 in_decl
, /*entering_scope=*/1);
6632 tree f
= tsubst_copy (TYPENAME_TYPE_FULLNAME (t
), args
,
6635 if (ctx
== error_mark_node
|| f
== error_mark_node
)
6636 return error_mark_node
;
6638 if (!IS_AGGR_TYPE (ctx
))
6641 cp_error ("`%T' is not a class, struct, or union type",
6643 return error_mark_node
;
6645 else if (!uses_template_parms (ctx
) && !TYPE_BEING_DEFINED (ctx
))
6647 /* Normally, make_typename_type does not require that the CTX
6648 have complete type in order to allow things like:
6650 template <class T> struct S { typename S<T>::X Y; };
6652 But, such constructs have already been resolved by this
6653 point, so here CTX really should have complete type, unless
6654 it's a partial instantiation. */
6655 ctx
= complete_type (ctx
);
6656 if (!COMPLETE_TYPE_P (ctx
))
6659 incomplete_type_error (NULL_TREE
, ctx
);
6660 return error_mark_node
;
6664 f
= make_typename_type (ctx
, f
, complain
);
6665 if (f
== error_mark_node
)
6667 return cp_build_qualified_type_real (f
,
6669 | CP_TYPE_QUALS (t
),
6675 tree e
= tsubst (TREE_OPERAND (t
, 0), args
, complain
,
6677 if (e
== error_mark_node
)
6678 return error_mark_node
;
6679 return make_pointer_declarator (type
, e
);
6684 tree e
= tsubst (TREE_OPERAND (t
, 0), args
, complain
,
6686 if (e
== error_mark_node
)
6687 return error_mark_node
;
6688 return make_reference_declarator (type
, e
);
6693 tree e1
= tsubst (TREE_OPERAND (t
, 0), args
, complain
,
6695 tree e2
= tsubst_expr (TREE_OPERAND (t
, 1), args
, complain
,
6697 if (e1
== error_mark_node
|| e2
== error_mark_node
)
6698 return error_mark_node
;
6700 return build_parse_node (ARRAY_REF
, e1
, e2
, tsubst_expr
);
6705 tree e1
= tsubst (TREE_OPERAND (t
, 0), args
, complain
,
6707 tree e2
= (tsubst_call_declarator_parms
6708 (CALL_DECLARATOR_PARMS (t
), args
, complain
, in_decl
));
6709 tree e3
= tsubst (CALL_DECLARATOR_EXCEPTION_SPEC (t
), args
,
6712 if (e1
== error_mark_node
|| e2
== error_mark_node
6713 || e3
== error_mark_node
)
6714 return error_mark_node
;
6716 return make_call_declarator (e1
, e2
, CALL_DECLARATOR_QUALS (t
), e3
);
6721 tree e1
= tsubst (TREE_OPERAND (t
, 0), args
, complain
,
6723 tree e2
= tsubst (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
6724 if (e1
== error_mark_node
|| e2
== error_mark_node
)
6725 return error_mark_node
;
6727 return build_parse_node (TREE_CODE (t
), e1
, e2
);
6732 tree e1
= tsubst_expr (TYPE_FIELDS (t
), args
, complain
,
6734 if (e1
== error_mark_node
)
6735 return error_mark_node
;
6737 return TREE_TYPE (e1
);
6747 /* This code should match declare_hidden_char_array in
6749 name
= (*decl_printable_name
) (current_function_decl
, 2);
6750 len
= strlen (name
) + 1;
6751 type
= build_array_type (char_type_node
,
6752 build_index_type (build_int_2 (len
, 0)));
6753 str
= build_string (len
, name
);
6754 TREE_TYPE (str
) = type
;
6759 sorry ("use of `%s' in template",
6760 tree_code_name
[(int) TREE_CODE (t
)]);
6761 return error_mark_node
;
6765 /* Like tsubst, but deals with expressions. This function just replaces
6766 template parms; to finish processing the resultant expression, use
6770 tsubst_copy (t
, args
, complain
, in_decl
)
6775 enum tree_code code
;
6778 if (t
== NULL_TREE
|| t
== error_mark_node
)
6781 code
= TREE_CODE (t
);
6786 return do_identifier (DECL_NAME (t
), 0, NULL_TREE
);
6793 if (!DECL_CONTEXT (t
))
6794 /* This is a global enumeration constant. */
6797 /* Unfortunately, we cannot just call lookup_name here.
6800 template <int I> int f() {
6802 struct S { void g() { E e = a; } };
6805 When we instantiate f<7>::S::g(), say, lookup_name is not
6806 clever enough to find f<7>::a. */
6808 = tsubst_aggr_type (TREE_TYPE (t
), args
, complain
, in_decl
,
6809 /*entering_scope=*/0);
6811 for (v
= TYPE_VALUES (enum_type
);
6814 if (TREE_PURPOSE (v
) == DECL_NAME (t
))
6815 return TREE_VALUE (v
);
6817 /* We didn't find the name. That should never happen; if
6818 name-lookup found it during preliminary parsing, we
6819 should find it again here during instantiation. */
6820 my_friendly_abort (0);
6825 if (DECL_CONTEXT (t
))
6829 ctx
= tsubst_aggr_type (DECL_CONTEXT (t
), args
, complain
, in_decl
,
6830 /*entering_scope=*/1);
6831 if (ctx
!= DECL_CONTEXT (t
))
6832 return lookup_field (ctx
, DECL_NAME (t
), 0, 0);
6838 if (DECL_LANG_SPECIFIC (t
) && DECL_TEMPLATE_INFO (t
))
6839 t
= tsubst (t
, args
, complain
, in_decl
);
6844 if (is_member_template (t
))
6845 return tsubst (t
, args
, complain
, in_decl
);
6851 /* We must tsbust into a LOOKUP_EXPR in case the names to
6852 which it refers is a conversion operator; in that case the
6853 name will change. We avoid making unnecessary copies,
6856 tree id
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
6858 if (id
!= TREE_OPERAND (t
, 0))
6860 r
= build_nt (LOOKUP_EXPR
, id
);
6861 LOOKUP_EXPR_GLOBAL (r
) = LOOKUP_EXPR_GLOBAL (t
);
6869 case REINTERPRET_CAST_EXPR
:
6870 case CONST_CAST_EXPR
:
6871 case STATIC_CAST_EXPR
:
6872 case DYNAMIC_CAST_EXPR
:
6875 (code
, tsubst (TREE_TYPE (t
), args
, complain
, in_decl
),
6876 tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
));
6879 case PREDECREMENT_EXPR
:
6880 case PREINCREMENT_EXPR
:
6881 case POSTDECREMENT_EXPR
:
6882 case POSTINCREMENT_EXPR
:
6884 case TRUTH_NOT_EXPR
:
6887 case CONVERT_EXPR
: /* Unary + */
6896 (code
, tsubst (TREE_TYPE (t
), args
, complain
, in_decl
),
6897 tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
));
6902 case TRUNC_DIV_EXPR
:
6904 case FLOOR_DIV_EXPR
:
6905 case ROUND_DIV_EXPR
:
6906 case EXACT_DIV_EXPR
:
6908 case BIT_ANDTC_EXPR
:
6911 case TRUNC_MOD_EXPR
:
6912 case FLOOR_MOD_EXPR
:
6913 case TRUTH_ANDIF_EXPR
:
6914 case TRUTH_ORIF_EXPR
:
6915 case TRUTH_AND_EXPR
:
6936 (code
, tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
),
6937 tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
));
6941 tree fn
= TREE_OPERAND (t
, 0);
6942 if (is_overloaded_fn (fn
))
6943 fn
= tsubst_copy (get_first_fn (fn
), args
, complain
, in_decl
);
6945 /* Sometimes FN is a LOOKUP_EXPR. */
6946 fn
= tsubst_copy (fn
, args
, complain
, in_decl
);
6948 (code
, fn
, tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
,
6953 case METHOD_CALL_EXPR
:
6955 tree name
= TREE_OPERAND (t
, 0);
6956 if (TREE_CODE (name
) == BIT_NOT_EXPR
)
6958 name
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
6960 name
= build1 (BIT_NOT_EXPR
, NULL_TREE
, name
);
6962 else if (TREE_CODE (name
) == SCOPE_REF
6963 && TREE_CODE (TREE_OPERAND (name
, 1)) == BIT_NOT_EXPR
)
6965 tree base
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
6967 name
= TREE_OPERAND (name
, 1);
6968 name
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
6970 name
= build1 (BIT_NOT_EXPR
, NULL_TREE
, name
);
6971 name
= build_nt (SCOPE_REF
, base
, name
);
6974 name
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
6976 (code
, name
, tsubst_copy (TREE_OPERAND (t
, 1), args
,
6978 tsubst_copy (TREE_OPERAND (t
, 2), args
, complain
, in_decl
),
6983 /* This processing should really occur in tsubst_expr, However,
6984 tsubst_expr does not recurse into expressions, since it
6985 assumes that there aren't any statements inside them.
6986 Instead, it simply calls build_expr_from_tree. So, we need
6987 to expand the STMT_EXPR here. */
6988 if (!processing_template_decl
)
6990 tree stmt_expr
= begin_stmt_expr ();
6991 tsubst_expr (STMT_EXPR_STMT (t
), args
,
6993 return finish_stmt_expr (stmt_expr
);
7000 case PSEUDO_DTOR_EXPR
:
7003 (code
, tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
),
7004 tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
),
7005 tsubst_copy (TREE_OPERAND (t
, 2), args
, complain
, in_decl
));
7012 (code
, tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
),
7013 tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
),
7014 tsubst_copy (TREE_OPERAND (t
, 2), args
, complain
, in_decl
));
7015 NEW_EXPR_USE_GLOBAL (r
) = NEW_EXPR_USE_GLOBAL (t
);
7022 (code
, tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
),
7023 tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
));
7024 DELETE_EXPR_USE_GLOBAL (r
) = DELETE_EXPR_USE_GLOBAL (t
);
7025 DELETE_EXPR_USE_VEC (r
) = DELETE_EXPR_USE_VEC (t
);
7029 case TEMPLATE_ID_EXPR
:
7031 /* Substituted template arguments */
7032 tree targs
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
,
7035 if (targs
&& TREE_CODE (targs
) == TREE_LIST
)
7038 for (chain
= targs
; chain
; chain
= TREE_CHAIN (chain
))
7039 TREE_VALUE (chain
) = maybe_fold_nontype_arg (TREE_VALUE (chain
));
7044 for (i
= 0; i
< TREE_VEC_LENGTH (targs
); ++i
)
7045 TREE_VEC_ELT (targs
, i
)
7046 = maybe_fold_nontype_arg (TREE_VEC_ELT (targs
, i
));
7049 return lookup_template_function
7050 (tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
), targs
);
7055 tree purpose
, value
, chain
;
7057 if (t
== void_list_node
)
7060 purpose
= TREE_PURPOSE (t
);
7062 purpose
= tsubst_copy (purpose
, args
, complain
, in_decl
);
7063 value
= TREE_VALUE (t
);
7065 value
= tsubst_copy (value
, args
, complain
, in_decl
);
7066 chain
= TREE_CHAIN (t
);
7067 if (chain
&& chain
!= void_type_node
)
7068 chain
= tsubst_copy (chain
, args
, complain
, in_decl
);
7069 if (purpose
== TREE_PURPOSE (t
)
7070 && value
== TREE_VALUE (t
)
7071 && chain
== TREE_CHAIN (t
))
7073 return tree_cons (purpose
, value
, chain
);
7080 case TEMPLATE_TYPE_PARM
:
7081 case TEMPLATE_TEMPLATE_PARM
:
7082 case TEMPLATE_PARM_INDEX
:
7084 case REFERENCE_TYPE
:
7091 return tsubst (t
, args
, complain
, in_decl
);
7093 case IDENTIFIER_NODE
:
7094 if (IDENTIFIER_TYPENAME_P (t
))
7096 tree new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
7098 return mangle_conv_op_name_for_type (new_type
);
7100 return (build_typename_overload (new_type
));
7108 (CONSTRUCTOR
, tsubst (TREE_TYPE (t
), args
, complain
, in_decl
),
7109 NULL_TREE
, tsubst_copy (CONSTRUCTOR_ELTS (t
), args
,
7110 complain
, in_decl
));
7111 TREE_HAS_CONSTRUCTOR (r
) = TREE_HAS_CONSTRUCTOR (t
);
7116 return build_x_va_arg (tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
,
7118 tsubst (TREE_TYPE (t
), args
, complain
, in_decl
));
7121 return tsubst (t
, args
, complain
, in_decl
);
7128 /* Like tsubst_copy, but also does semantic processing. */
7131 tsubst_expr (t
, args
, complain
, in_decl
)
7138 if (t
== NULL_TREE
|| t
== error_mark_node
)
7141 if (processing_template_decl
)
7142 return tsubst_copy (t
, args
, complain
, in_decl
);
7144 switch (TREE_CODE (t
))
7148 finish_named_return_value
7149 (TREE_OPERAND (t
, 0),
7150 tsubst_expr (TREE_OPERAND (t
, 1), args
, /*complain=*/1, in_decl
));
7151 tsubst_expr (TREE_CHAIN (t
), args
, complain
, in_decl
);
7154 case CTOR_INITIALIZER
:
7156 tree member_init_list
;
7157 tree base_init_list
;
7161 = tsubst_initializer_list (TREE_OPERAND (t
, 0), args
);
7163 = tsubst_initializer_list (TREE_OPERAND (t
, 1), args
);
7164 setup_vtbl_ptr (member_init_list
, base_init_list
);
7165 tsubst_expr (TREE_CHAIN (t
), args
, complain
, in_decl
);
7171 finish_return_stmt (tsubst_expr (RETURN_EXPR (t
),
7172 args
, complain
, in_decl
));
7177 finish_expr_stmt (tsubst_expr (EXPR_STMT_EXPR (t
),
7178 args
, complain
, in_decl
));
7187 decl
= DECL_STMT_DECL (t
);
7188 if (TREE_CODE (decl
) == LABEL_DECL
)
7189 finish_label_decl (DECL_NAME (decl
));
7192 init
= DECL_INITIAL (decl
);
7193 decl
= tsubst (decl
, args
, complain
, in_decl
);
7194 init
= tsubst_expr (init
, args
, complain
, in_decl
);
7196 DECL_INITIAL (decl
) = error_mark_node
;
7197 /* By marking the declaration as instantiated, we avoid
7198 trying to instantiate it. Since instantiate_decl can't
7199 handle local variables, and since we've already done
7200 all that needs to be done, that's the right thing to
7202 if (TREE_CODE (decl
) == VAR_DECL
)
7203 DECL_TEMPLATE_INSTANTIATED (decl
) = 1;
7204 maybe_push_decl (decl
);
7205 cp_finish_decl (decl
, init
, NULL_TREE
, 0);
7215 stmt
= begin_for_stmt ();
7216 for (tmp
= FOR_INIT_STMT (t
); tmp
; tmp
= TREE_CHAIN (tmp
))
7217 tsubst_expr (tmp
, args
, complain
, in_decl
);
7218 finish_for_init_stmt (stmt
);
7219 finish_for_cond (tsubst_expr (FOR_COND (t
), args
,
7222 tmp
= tsubst_expr (FOR_EXPR (t
), args
, complain
, in_decl
);
7223 finish_for_expr (tmp
, stmt
);
7224 tsubst_expr (FOR_BODY (t
), args
, complain
, in_decl
);
7225 finish_for_stmt (stmt
);
7232 stmt
= begin_while_stmt ();
7233 finish_while_stmt_cond (tsubst_expr (WHILE_COND (t
),
7234 args
, complain
, in_decl
),
7236 tsubst_expr (WHILE_BODY (t
), args
, complain
, in_decl
);
7237 finish_while_stmt (stmt
);
7244 stmt
= begin_do_stmt ();
7245 tsubst_expr (DO_BODY (t
), args
, complain
, in_decl
);
7246 finish_do_body (stmt
);
7247 finish_do_stmt (tsubst_expr (DO_COND (t
), args
,
7258 stmt
= begin_if_stmt ();
7259 finish_if_stmt_cond (tsubst_expr (IF_COND (t
),
7260 args
, complain
, in_decl
),
7263 if (tmp
= THEN_CLAUSE (t
), tmp
)
7265 tsubst_expr (tmp
, args
, complain
, in_decl
);
7266 finish_then_clause (stmt
);
7269 if (tmp
= ELSE_CLAUSE (t
), tmp
)
7271 begin_else_clause ();
7272 tsubst_expr (tmp
, args
, complain
, in_decl
);
7273 finish_else_clause (stmt
);
7285 stmt
= begin_compound_stmt (COMPOUND_STMT_NO_SCOPE (t
));
7286 for (substmt
= COMPOUND_BODY (t
);
7287 substmt
!= NULL_TREE
;
7288 substmt
= TREE_CHAIN (substmt
))
7289 tsubst_expr (substmt
, args
, complain
, in_decl
);
7290 return finish_compound_stmt (COMPOUND_STMT_NO_SCOPE (t
), stmt
);
7296 finish_break_stmt ();
7301 finish_continue_stmt ();
7309 stmt
= begin_switch_stmt ();
7310 val
= tsubst_expr (SWITCH_COND (t
), args
, complain
, in_decl
);
7311 finish_switch_cond (val
, stmt
);
7312 tsubst_expr (SWITCH_BODY (t
), args
, complain
, in_decl
);
7313 finish_switch_stmt (stmt
);
7319 finish_case_label (tsubst_expr (CASE_LOW (t
), args
, complain
, in_decl
),
7320 tsubst_expr (CASE_HIGH (t
), args
, complain
, in_decl
));
7324 lineno
= STMT_LINENO (t
);
7325 finish_label_stmt (DECL_NAME (LABEL_STMT_LABEL (t
)));
7330 t
= GOTO_DESTINATION (t
);
7331 if (TREE_CODE (t
) != LABEL_DECL
)
7332 /* Computed goto's must be tsubst'd into. On the other hand,
7333 non-computed gotos must not be; the identifier in question
7334 will have no binding. */
7335 t
= tsubst_expr (t
, args
, complain
, in_decl
);
7338 finish_goto_stmt (t
);
7343 finish_asm_stmt (ASM_CV_QUAL (t
),
7344 tsubst_expr (ASM_STRING (t
), args
, complain
, in_decl
),
7345 tsubst_expr (ASM_OUTPUTS (t
), args
, complain
, in_decl
),
7346 tsubst_expr (ASM_INPUTS (t
), args
, complain
, in_decl
),
7347 tsubst_expr (ASM_CLOBBERS (t
), args
, complain
,
7355 stmt
= begin_try_block ();
7356 tsubst_expr (TRY_STMTS (t
), args
, complain
, in_decl
);
7357 finish_cleanup_try_block (stmt
);
7358 finish_cleanup (tsubst_expr (TRY_HANDLERS (t
), args
,
7366 if (FN_TRY_BLOCK_P (t
))
7367 stmt
= begin_function_try_block ();
7369 stmt
= begin_try_block ();
7371 tsubst_expr (TRY_STMTS (t
), args
, complain
, in_decl
);
7373 if (FN_TRY_BLOCK_P (t
))
7374 finish_function_try_block (stmt
);
7376 finish_try_block (stmt
);
7378 handler
= TRY_HANDLERS (t
);
7379 for (; handler
; handler
= TREE_CHAIN (handler
))
7380 tsubst_expr (handler
, args
, complain
, in_decl
);
7381 if (FN_TRY_BLOCK_P (t
))
7382 finish_function_handler_sequence (stmt
);
7384 finish_handler_sequence (stmt
);
7394 stmt
= begin_handler ();
7395 if (HANDLER_PARMS (t
))
7397 decl
= DECL_STMT_DECL (HANDLER_PARMS (t
));
7398 decl
= tsubst (decl
, args
, complain
, in_decl
);
7399 /* Prevent instantiate_decl from trying to instantiate
7400 this variable. We've already done all that needs to be
7402 DECL_TEMPLATE_INSTANTIATED (decl
) = 1;
7406 blocks
= finish_handler_parms (decl
, stmt
);
7407 tsubst_expr (HANDLER_BODY (t
), args
, complain
, in_decl
);
7408 finish_handler (blocks
, stmt
);
7415 tsubst (t
, args
, complain
, NULL_TREE
);
7419 return build_expr_from_tree (tsubst_copy (t
, args
, complain
, in_decl
));
7424 /* TMPL is a TEMPLATE_DECL for a cloned constructor or destructor.
7425 Instantiate it with the ARGS. */
7428 instantiate_clone (tmpl
, args
)
7435 /* Instantiated the cloned function, rather than the clone. */
7436 spec
= instantiate_template (DECL_CLONED_FUNCTION (tmpl
), args
);
7438 /* Then, see if we've already cloned the instantiation. */
7439 for (clone
= TREE_CHAIN (spec
);
7440 clone
&& DECL_CLONED_FUNCTION_P (clone
);
7441 clone
= TREE_CHAIN (clone
))
7442 if (DECL_NAME (clone
) == DECL_NAME (tmpl
))
7445 /* If we haven't, do so know. */
7447 clone_function_decl (spec
, /*update_method_vec_p=*/0);
7450 for (clone
= TREE_CHAIN (spec
);
7451 clone
&& DECL_CLONED_FUNCTION_P (clone
);
7452 clone
= TREE_CHAIN (clone
))
7453 if (DECL_NAME (clone
) == DECL_NAME (tmpl
))
7456 /* We should always have found the clone by now. */
7457 my_friendly_abort (20000411);
7461 /* Instantiate the indicated variable or function template TMPL with
7462 the template arguments in TARG_PTR. */
7465 instantiate_template (tmpl
, targ_ptr
)
7466 tree tmpl
, targ_ptr
;
7474 if (tmpl
== error_mark_node
)
7475 return error_mark_node
;
7477 my_friendly_assert (TREE_CODE (tmpl
) == TEMPLATE_DECL
, 283);
7479 /* If this function is a clone, handle it specially. */
7480 if (DECL_CLONED_FUNCTION_P (tmpl
))
7481 return instantiate_clone (tmpl
, targ_ptr
);
7483 /* Check to see if we already have this specialization. */
7484 spec
= retrieve_specialization (tmpl
, targ_ptr
);
7485 if (spec
!= NULL_TREE
)
7488 gen_tmpl
= most_general_template (tmpl
);
7489 if (tmpl
!= gen_tmpl
)
7491 /* The TMPL is a partial instantiation. To get a full set of
7492 arguments we must add the arguments used to perform the
7493 partial instantiation. */
7494 targ_ptr
= add_outermost_template_args (DECL_TI_ARGS (tmpl
),
7497 /* Check to see if we already have this specialization. */
7498 spec
= retrieve_specialization (gen_tmpl
, targ_ptr
);
7499 if (spec
!= NULL_TREE
)
7503 len
= DECL_NTPARMS (gen_tmpl
);
7504 inner_args
= INNERMOST_TEMPLATE_ARGS (targ_ptr
);
7508 tree t
= TREE_VEC_ELT (inner_args
, i
);
7511 tree nt
= target_type (t
);
7512 if (IS_AGGR_TYPE (nt
) && decl_function_context (TYPE_MAIN_DECL (nt
)))
7514 cp_error ("type `%T' composed from a local class is not a valid template-argument", t
);
7515 cp_error (" trying to instantiate `%D'", gen_tmpl
);
7516 return error_mark_node
;
7521 /* substitute template parameters */
7522 fndecl
= tsubst (DECL_TEMPLATE_RESULT (gen_tmpl
),
7523 targ_ptr
, /*complain=*/1, gen_tmpl
);
7524 /* The DECL_TI_TEMPLATE should always be the immediate parent
7525 template, not the most general template. */
7526 DECL_TI_TEMPLATE (fndecl
) = tmpl
;
7528 if (flag_external_templates
)
7529 add_pending_template (fndecl
);
7534 /* Push the name of the class template into the scope of the instantiation. */
7537 overload_template_name (type
)
7540 tree id
= DECL_NAME (CLASSTYPE_TI_TEMPLATE (type
));
7543 if (IDENTIFIER_CLASS_VALUE (id
)
7544 && TREE_TYPE (IDENTIFIER_CLASS_VALUE (id
)) == type
)
7547 decl
= build_decl (TYPE_DECL
, id
, type
);
7548 SET_DECL_ARTIFICIAL (decl
);
7549 pushdecl_class_level (decl
);
7552 /* The FN is a TEMPLATE_DECL for a function. The ARGS are the
7553 arguments that are being used when calling it. TARGS is a vector
7554 into which the deduced template arguments are placed.
7556 Return zero for success, 2 for an incomplete match that doesn't resolve
7557 all the types, and 1 for complete failure. An error message will be
7558 printed only for an incomplete match.
7560 If FN is a conversion operator, RETURN_TYPE is the type desired as
7561 the result of the conversion operator.
7563 TPARMS is a vector of template parameters.
7565 The EXPLICIT_TARGS are explicit template arguments provided via a
7568 The parameter STRICT is one of:
7571 We are deducing arguments for a function call, as in
7575 We are deducing arguments for a conversion function, as in
7579 We are deducing arguments when calculating the partial
7580 ordering between specializations of function or class
7581 templates, as in [temp.func.order] and [temp.class.order],
7582 when doing an explicit instantiation as in [temp.explicit],
7583 when determining an explicit specialization as in
7584 [temp.expl.spec], or when taking the address of a function
7585 template, as in [temp.deduct.funcaddr].
7587 The other arguments are as for type_unification. */
7590 fn_type_unification (fn
, explicit_targs
, targs
, args
, return_type
,
7592 tree fn
, explicit_targs
, targs
, args
, return_type
;
7593 unification_kind_t strict
;
7599 my_friendly_assert (TREE_CODE (fn
) == TEMPLATE_DECL
, 0);
7601 fntype
= TREE_TYPE (fn
);
7606 The specified template arguments must match the template
7607 parameters in kind (i.e., type, nontype, template), and there
7608 must not be more arguments than there are parameters;
7609 otherwise type deduction fails.
7611 Nontype arguments must match the types of the corresponding
7612 nontype template parameters, or must be convertible to the
7613 types of the corresponding nontype parameters as specified in
7614 _temp.arg.nontype_, otherwise type deduction fails.
7616 All references in the function type of the function template
7617 to the corresponding template parameters are replaced by the
7618 specified template argument values. If a substitution in a
7619 template parameter or in the function type of the function
7620 template results in an invalid type, type deduction fails. */
7622 tree converted_args
;
7625 = (coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (fn
),
7626 explicit_targs
, NULL_TREE
, /*complain=*/0,
7627 /*require_all_arguments=*/0));
7628 if (converted_args
== error_mark_node
)
7631 fntype
= tsubst (fntype
, converted_args
, /*complain=*/0, NULL_TREE
);
7632 if (fntype
== error_mark_node
)
7635 /* Place the explicitly specified arguments in TARGS. */
7636 for (i
= 0; i
< TREE_VEC_LENGTH (targs
); i
++)
7637 TREE_VEC_ELT (targs
, i
) = TREE_VEC_ELT (converted_args
, i
);
7640 parms
= TYPE_ARG_TYPES (fntype
);
7642 if (DECL_CONV_FN_P (fn
))
7644 /* This is a template conversion operator. Remove `this', since
7645 we could be comparing conversions from different classes. */
7646 parms
= TREE_CHAIN (parms
);
7647 args
= TREE_CHAIN (args
);
7648 my_friendly_assert (return_type
!= NULL_TREE
, 20000227);
7653 /* We've been given a return type to match, prepend it. */
7654 parms
= tree_cons (NULL_TREE
, TREE_TYPE (fntype
), parms
);
7655 args
= tree_cons (NULL_TREE
, return_type
, args
);
7658 /* We allow incomplete unification without an error message here
7659 because the standard doesn't seem to explicitly prohibit it. Our
7660 callers must be ready to deal with unification failures in any
7662 result
= type_unification_real (DECL_INNERMOST_TEMPLATE_PARMS (fn
),
7663 targs
, parms
, args
, /*subr=*/0,
7664 strict
, /*allow_incomplete*/1);
7667 /* All is well so far. Now, check:
7671 When all template arguments have been deduced, all uses of
7672 template parameters in nondeduced contexts are replaced with
7673 the corresponding deduced argument values. If the
7674 substitution results in an invalid type, as described above,
7675 type deduction fails. */
7676 if (tsubst (TREE_TYPE (fn
), targs
, /*complain=*/0, NULL_TREE
)
7683 /* Adjust types before performing type deduction, as described in
7684 [temp.deduct.call] and [temp.deduct.conv]. The rules in these two
7685 sections are symmetric. PARM is the type of a function parameter
7686 or the return type of the conversion function. ARG is the type of
7687 the argument passed to the call, or the type of the value
7688 intialized with the result of the conversion function. */
7691 maybe_adjust_types_for_deduction (strict
, parm
, arg
)
7692 unification_kind_t strict
;
7703 /* Swap PARM and ARG throughout the remainder of this
7704 function; the handling is precisely symmetric since PARM
7705 will initialize ARG rather than vice versa. */
7713 /* There is nothing to do in this case. */
7717 my_friendly_abort (0);
7720 if (TREE_CODE (*parm
) != REFERENCE_TYPE
)
7722 /* [temp.deduct.call]
7724 If P is not a reference type:
7726 --If A is an array type, the pointer type produced by the
7727 array-to-pointer standard conversion (_conv.array_) is
7728 used in place of A for type deduction; otherwise,
7730 --If A is a function type, the pointer type produced by
7731 the function-to-pointer standard conversion
7732 (_conv.func_) is used in place of A for type deduction;
7735 --If A is a cv-qualified type, the top level
7736 cv-qualifiers of A's type are ignored for type
7738 if (TREE_CODE (*arg
) == ARRAY_TYPE
)
7739 *arg
= build_pointer_type (TREE_TYPE (*arg
));
7740 else if (TREE_CODE (*arg
) == FUNCTION_TYPE
)
7741 *arg
= build_pointer_type (*arg
);
7743 *arg
= TYPE_MAIN_VARIANT (*arg
);
7746 /* [temp.deduct.call]
7748 If P is a cv-qualified type, the top level cv-qualifiers
7749 of P's type are ignored for type deduction. If P is a
7750 reference type, the type referred to by P is used for
7752 *parm
= TYPE_MAIN_VARIANT (*parm
);
7753 if (TREE_CODE (*parm
) == REFERENCE_TYPE
)
7754 *parm
= TREE_TYPE (*parm
);
7757 /* Like type_unfication.
7759 If SUBR is 1, we're being called recursively (to unify the
7760 arguments of a function or method parameter of a function
7764 type_unification_real (tparms
, targs
, parms
, args
, subr
,
7765 strict
, allow_incomplete
)
7766 tree tparms
, targs
, parms
, args
;
7768 unification_kind_t strict
;
7769 int allow_incomplete
;
7773 int ntparms
= TREE_VEC_LENGTH (tparms
);
7776 my_friendly_assert (TREE_CODE (tparms
) == TREE_VEC
, 289);
7777 my_friendly_assert (parms
== NULL_TREE
7778 || TREE_CODE (parms
) == TREE_LIST
, 290);
7779 /* ARGS could be NULL (via a call from parse.y to
7780 build_x_function_call). */
7782 my_friendly_assert (TREE_CODE (args
) == TREE_LIST
, 291);
7783 my_friendly_assert (ntparms
> 0, 292);
7788 sub_strict
= UNIFY_ALLOW_MORE_CV_QUAL
| UNIFY_ALLOW_DERIVED
;
7792 sub_strict
= UNIFY_ALLOW_LESS_CV_QUAL
;
7796 sub_strict
= UNIFY_ALLOW_NONE
;
7800 my_friendly_abort (0);
7804 && parms
!= void_list_node
7806 && args
!= void_list_node
)
7808 parm
= TREE_VALUE (parms
);
7809 parms
= TREE_CHAIN (parms
);
7810 arg
= TREE_VALUE (args
);
7811 args
= TREE_CHAIN (args
);
7813 if (arg
== error_mark_node
)
7815 if (arg
== unknown_type_node
)
7816 /* We can't deduce anything from this, but we might get all the
7817 template args from other function args. */
7820 /* Conversions will be performed on a function argument that
7821 corresponds with a function parameter that contains only
7822 non-deducible template parameters and explicitly specified
7823 template parameters. */
7824 if (! uses_template_parms (parm
))
7829 type
= TREE_TYPE (arg
);
7836 if (strict
== DEDUCE_EXACT
)
7838 if (same_type_p (parm
, type
))
7842 /* It might work; we shouldn't check now, because we might
7843 get into infinite recursion. Overload resolution will
7852 my_friendly_assert (TREE_TYPE (arg
) != NULL_TREE
, 293);
7853 if (type_unknown_p (arg
))
7855 /* [temp.deduct.type] A template-argument can be deduced from
7856 a pointer to function or pointer to member function
7857 argument if the set of overloaded functions does not
7858 contain function templates and at most one of a set of
7859 overloaded functions provides a unique match. */
7861 if (resolve_overloaded_unification
7862 (tparms
, targs
, parm
, arg
, strict
, sub_strict
)
7867 arg
= TREE_TYPE (arg
);
7871 maybe_adjust_types_for_deduction (strict
, &parm
, &arg
);
7873 switch (unify (tparms
, targs
, parm
, arg
, sub_strict
))
7881 /* Fail if we've reached the end of the parm list, and more args
7882 are present, and the parm list isn't variadic. */
7883 if (args
&& args
!= void_list_node
&& parms
== void_list_node
)
7885 /* Fail if parms are left and they don't have default values. */
7887 && parms
!= void_list_node
7888 && TREE_PURPOSE (parms
) == NULL_TREE
)
7891 for (i
= 0; i
< ntparms
; i
++)
7892 if (TREE_VEC_ELT (targs
, i
) == NULL_TREE
)
7894 if (!allow_incomplete
)
7895 error ("incomplete type unification");
7901 /* Subroutine of type_unification_real. Args are like the variables at the
7902 call site. ARG is an overloaded function (or template-id); we try
7903 deducing template args from each of the overloads, and if only one
7904 succeeds, we go with that. Modifies TARGS and returns 0 on success. */
7907 resolve_overloaded_unification (tparms
, targs
, parm
, arg
, strict
,
7909 tree tparms
, targs
, parm
, arg
;
7910 unification_kind_t strict
;
7913 tree tempargs
= copy_node (targs
);
7916 if (TREE_CODE (arg
) == ADDR_EXPR
)
7917 arg
= TREE_OPERAND (arg
, 0);
7919 if (TREE_CODE (arg
) == COMPONENT_REF
)
7920 /* Handle `&x' where `x' is some static or non-static member
7922 arg
= TREE_OPERAND (arg
, 1);
7924 if (TREE_CODE (arg
) == OFFSET_REF
)
7925 arg
= TREE_OPERAND (arg
, 1);
7927 /* Strip baselink information. */
7928 while (TREE_CODE (arg
) == TREE_LIST
)
7929 arg
= TREE_VALUE (arg
);
7931 if (TREE_CODE (arg
) == TEMPLATE_ID_EXPR
)
7933 /* If we got some explicit template args, we need to plug them into
7934 the affected templates before we try to unify, in case the
7935 explicit args will completely resolve the templates in question. */
7937 tree expl_subargs
= TREE_OPERAND (arg
, 1);
7938 arg
= TREE_OPERAND (arg
, 0);
7940 for (; arg
; arg
= OVL_NEXT (arg
))
7942 tree fn
= OVL_CURRENT (arg
);
7945 if (TREE_CODE (fn
) != TEMPLATE_DECL
)
7948 subargs
= get_bindings_overload (fn
, DECL_TEMPLATE_RESULT (fn
),
7952 elem
= tsubst (TREE_TYPE (fn
), subargs
, /*complain=*/0,
7954 if (TREE_CODE (elem
) == METHOD_TYPE
)
7955 elem
= build_ptrmemfunc_type (build_pointer_type (elem
));
7956 good
+= try_one_overload (tparms
, targs
, tempargs
, parm
, elem
,
7957 strict
, sub_strict
);
7961 else if (TREE_CODE (arg
) == OVERLOAD
)
7963 for (; arg
; arg
= OVL_NEXT (arg
))
7965 tree type
= TREE_TYPE (OVL_CURRENT (arg
));
7966 if (TREE_CODE (type
) == METHOD_TYPE
)
7967 type
= build_ptrmemfunc_type (build_pointer_type (type
));
7968 good
+= try_one_overload (tparms
, targs
, tempargs
, parm
,
7970 strict
, sub_strict
);
7974 my_friendly_abort (981006);
7976 /* [temp.deduct.type] A template-argument can be deduced from a pointer
7977 to function or pointer to member function argument if the set of
7978 overloaded functions does not contain function templates and at most
7979 one of a set of overloaded functions provides a unique match.
7981 So if we found multiple possibilities, we return success but don't
7986 int i
= TREE_VEC_LENGTH (targs
);
7988 if (TREE_VEC_ELT (tempargs
, i
))
7989 TREE_VEC_ELT (targs
, i
) = TREE_VEC_ELT (tempargs
, i
);
7997 /* Subroutine of resolve_overloaded_unification; does deduction for a single
7998 overload. Fills TARGS with any deduced arguments, or error_mark_node if
7999 different overloads deduce different arguments for a given parm.
8000 Returns 1 on success. */
8003 try_one_overload (tparms
, orig_targs
, targs
, parm
, arg
, strict
,
8005 tree tparms
, orig_targs
, targs
, parm
, arg
;
8006 unification_kind_t strict
;
8013 /* [temp.deduct.type] A template-argument can be deduced from a pointer
8014 to function or pointer to member function argument if the set of
8015 overloaded functions does not contain function templates and at most
8016 one of a set of overloaded functions provides a unique match.
8018 So if this is a template, just return success. */
8020 if (uses_template_parms (arg
))
8023 maybe_adjust_types_for_deduction (strict
, &parm
, &arg
);
8025 /* We don't copy orig_targs for this because if we have already deduced
8026 some template args from previous args, unify would complain when we
8027 try to deduce a template parameter for the same argument, even though
8028 there isn't really a conflict. */
8029 nargs
= TREE_VEC_LENGTH (targs
);
8030 tempargs
= make_tree_vec (nargs
);
8032 if (unify (tparms
, tempargs
, parm
, arg
, sub_strict
) != 0)
8035 /* First make sure we didn't deduce anything that conflicts with
8036 explicitly specified args. */
8037 for (i
= nargs
; i
--; )
8039 tree elt
= TREE_VEC_ELT (tempargs
, i
);
8040 tree oldelt
= TREE_VEC_ELT (orig_targs
, i
);
8042 if (elt
== NULL_TREE
)
8044 else if (uses_template_parms (elt
))
8046 /* Since we're unifying against ourselves, we will fill in template
8047 args used in the function parm list with our own template parms.
8049 TREE_VEC_ELT (tempargs
, i
) = NULL_TREE
;
8052 else if (oldelt
&& ! template_args_equal (oldelt
, elt
))
8056 for (i
= nargs
; i
--; )
8058 tree elt
= TREE_VEC_ELT (tempargs
, i
);
8061 TREE_VEC_ELT (targs
, i
) = elt
;
8067 /* PARM is a template class (perhaps with unbound template
8068 parameters). ARG is a fully instantiated type. If ARG can be
8069 bound to PARM, return ARG, otherwise return NULL_TREE. TPARMS and
8070 TARGS are as for unify. */
8073 try_class_unification (tparms
, targs
, parm
, arg
)
8082 if (!CLASSTYPE_TEMPLATE_INFO (arg
)
8083 || CLASSTYPE_TI_TEMPLATE (arg
) != CLASSTYPE_TI_TEMPLATE (parm
))
8086 /* We need to make a new template argument vector for the call to
8087 unify. If we used TARGS, we'd clutter it up with the result of
8088 the attempted unification, even if this class didn't work out.
8089 We also don't want to commit ourselves to all the unifications
8090 we've already done, since unification is supposed to be done on
8091 an argument-by-argument basis. In other words, consider the
8092 following pathological case:
8094 template <int I, int J, int K>
8097 template <int I, int J>
8098 struct S<I, J, 2> : public S<I, I, I>, S<J, J, J> {};
8100 template <int I, int J, int K>
8101 void f(S<I, J, K>, S<I, I, I>);
8110 Now, by the time we consider the unification involving `s2', we
8111 already know that we must have `f<0, 0, 0>'. But, even though
8112 `S<0, 1, 2>' is derived from `S<0, 0, 0>', the code is not legal
8113 because there are two ways to unify base classes of S<0, 1, 2>
8114 with S<I, I, I>. If we kept the already deduced knowledge, we
8115 would reject the possibility I=1. */
8116 copy_of_targs
= make_tree_vec (TREE_VEC_LENGTH (targs
));
8117 i
= unify (tparms
, copy_of_targs
, CLASSTYPE_TI_ARGS (parm
),
8118 CLASSTYPE_TI_ARGS (arg
), UNIFY_ALLOW_NONE
);
8120 /* If unification failed, we're done. */
8127 /* Subroutine of get_template_base. RVAL, if non-NULL, is a base we
8128 have alreay discovered to be satisfactory. ARG_BINFO is the binfo
8129 for the base class of ARG that we are currently examining. */
8132 get_template_base_recursive (tparms
, targs
, parm
,
8133 arg_binfo
, rval
, flags
)
8143 tree arg
= BINFO_TYPE (arg_binfo
);
8145 if (!(flags
& GTB_IGNORE_TYPE
))
8147 tree r
= try_class_unification (tparms
, targs
,
8150 /* If there is more than one satisfactory baseclass, then:
8154 If they yield more than one possible deduced A, the type
8158 if (r
&& rval
&& !same_type_p (r
, rval
))
8159 return error_mark_node
;
8164 binfos
= BINFO_BASETYPES (arg_binfo
);
8165 n_baselinks
= binfos
? TREE_VEC_LENGTH (binfos
) : 0;
8167 /* Process base types. */
8168 for (i
= 0; i
< n_baselinks
; i
++)
8170 tree base_binfo
= TREE_VEC_ELT (binfos
, i
);
8173 /* Skip this base, if we've already seen it. */
8174 if (BINFO_MARKED (base_binfo
))
8178 (flags
& GTB_VIA_VIRTUAL
) || TREE_VIA_VIRTUAL (base_binfo
);
8180 /* When searching for a non-virtual, we cannot mark virtually
8183 SET_BINFO_MARKED (base_binfo
);
8185 rval
= get_template_base_recursive (tparms
, targs
,
8189 GTB_VIA_VIRTUAL
* this_virtual
);
8191 /* If we discovered more than one matching base class, we can
8193 if (rval
== error_mark_node
)
8194 return error_mark_node
;
8200 /* Given a template type PARM and a class type ARG, find the unique
8201 base type in ARG that is an instance of PARM. We do not examine
8202 ARG itself; only its base-classes. If there is no appropriate base
8203 class, return NULL_TREE. If there is more than one, return
8204 error_mark_node. PARM may be the type of a partial specialization,
8205 as well as a plain template type. Used by unify. */
8208 get_template_base (tparms
, targs
, parm
, arg
)
8217 my_friendly_assert (IS_AGGR_TYPE_CODE (TREE_CODE (arg
)), 92);
8219 arg_binfo
= TYPE_BINFO (complete_type (arg
));
8220 rval
= get_template_base_recursive (tparms
, targs
,
8225 /* Since get_template_base_recursive marks the bases classes, we
8226 must unmark them here. */
8227 dfs_walk (arg_binfo
, dfs_unmark
, markedp
, 0);
8232 /* Returns the level of DECL, which declares a template parameter. */
8235 template_decl_level (decl
)
8238 switch (TREE_CODE (decl
))
8242 return TEMPLATE_TYPE_LEVEL (TREE_TYPE (decl
));
8245 return TEMPLATE_PARM_LEVEL (DECL_INITIAL (decl
));
8248 my_friendly_abort (0);
8253 /* Decide whether ARG can be unified with PARM, considering only the
8254 cv-qualifiers of each type, given STRICT as documented for unify.
8255 Returns non-zero iff the unification is OK on that basis.*/
8258 check_cv_quals_for_unify (strict
, arg
, parm
)
8263 if (!(strict
& UNIFY_ALLOW_MORE_CV_QUAL
)
8264 && !at_least_as_qualified_p (arg
, parm
))
8267 if (!(strict
& UNIFY_ALLOW_LESS_CV_QUAL
)
8268 && !at_least_as_qualified_p (parm
, arg
))
8274 /* Takes parameters as for type_unification. Returns 0 if the
8275 type deduction suceeds, 1 otherwise. The parameter STRICT is a
8276 bitwise or of the following flags:
8279 Require an exact match between PARM and ARG.
8280 UNIFY_ALLOW_MORE_CV_QUAL:
8281 Allow the deduced ARG to be more cv-qualified than ARG.
8282 UNIFY_ALLOW_LESS_CV_QUAL:
8283 Allow the deduced ARG to be less cv-qualified than ARG.
8284 UNIFY_ALLOW_DERIVED:
8285 Allow the deduced ARG to be a template base class of ARG,
8286 or a pointer to a template base class of the type pointed to by
8288 UNIFY_ALLOW_INTEGER:
8289 Allow any integral type to be deduced. See the TEMPLATE_PARM_INDEX
8290 case for more information. */
8293 unify (tparms
, targs
, parm
, arg
, strict
)
8294 tree tparms
, targs
, parm
, arg
;
8301 /* I don't think this will do the right thing with respect to types.
8302 But the only case I've seen it in so far has been array bounds, where
8303 signedness is the only information lost, and I think that will be
8305 while (TREE_CODE (parm
) == NOP_EXPR
)
8306 parm
= TREE_OPERAND (parm
, 0);
8308 if (arg
== error_mark_node
)
8310 if (arg
== unknown_type_node
)
8311 /* We can't deduce anything from this, but we might get all the
8312 template args from other function args. */
8315 /* If PARM uses template parameters, then we can't bail out here,
8316 even if ARG == PARM, since we won't record unifications for the
8317 template parameters. We might need them if we're trying to
8318 figure out which of two things is more specialized. */
8319 if (arg
== parm
&& !uses_template_parms (parm
))
8322 /* Immediately reject some pairs that won't unify because of
8323 cv-qualification mismatches. */
8324 if (TREE_CODE (arg
) == TREE_CODE (parm
)
8326 /* We check the cv-qualifiers when unifying with template type
8327 parameters below. We want to allow ARG `const T' to unify with
8328 PARM `T' for example, when computing which of two templates
8329 is more specialized, for example. */
8330 && TREE_CODE (arg
) != TEMPLATE_TYPE_PARM
8331 && !check_cv_quals_for_unify (strict
, arg
, parm
))
8334 switch (TREE_CODE (parm
))
8337 /* In a type which contains a nested-name-specifier, template
8338 argument values cannot be deduced for template parameters used
8339 within the nested-name-specifier. */
8342 case TEMPLATE_TYPE_PARM
:
8343 case TEMPLATE_TEMPLATE_PARM
:
8344 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, 0));
8346 if (TEMPLATE_TYPE_LEVEL (parm
)
8347 != template_decl_level (tparm
))
8348 /* The PARM is not one we're trying to unify. Just check
8349 to see if it matches ARG. */
8350 return (TREE_CODE (arg
) == TREE_CODE (parm
)
8351 && same_type_p (parm
, arg
)) ? 0 : 1;
8352 idx
= TEMPLATE_TYPE_IDX (parm
);
8353 targ
= TREE_VEC_ELT (targs
, idx
);
8354 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, idx
));
8356 /* Check for mixed types and values. */
8357 if ((TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
8358 && TREE_CODE (tparm
) != TYPE_DECL
)
8359 || (TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
8360 && TREE_CODE (tparm
) != TEMPLATE_DECL
))
8363 if (TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
)
8365 if (TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (parm
))
8367 /* We arrive here when PARM does not involve template
8370 /* ARG must be constructed from a template class. */
8371 if (TREE_CODE (arg
) != RECORD_TYPE
|| !CLASSTYPE_TEMPLATE_INFO (arg
))
8375 tree parmtmpl
= TYPE_TI_TEMPLATE (parm
);
8376 tree parmvec
= TYPE_TI_ARGS (parm
);
8377 tree argvec
= CLASSTYPE_TI_ARGS (arg
);
8379 = DECL_INNERMOST_TEMPLATE_PARMS (CLASSTYPE_TI_TEMPLATE (arg
));
8382 /* The parameter and argument roles have to be switched here
8383 in order to handle default arguments properly. For example,
8384 template<template <class> class TT> void f(TT<int>)
8385 should be able to accept vector<int> which comes from
8386 template <class T, class Allocator = allocator>
8389 if (coerce_template_parms (argtmplvec
, parmvec
, parmtmpl
, 0, 1)
8393 /* Deduce arguments T, i from TT<T> or TT<i>.
8394 We check each element of PARMVEC and ARGVEC individually
8395 rather than the whole TREE_VEC since they can have
8396 different number of elements. */
8398 for (i
= 0; i
< TREE_VEC_LENGTH (parmvec
); ++i
)
8400 tree t
= TREE_VEC_ELT (parmvec
, i
);
8402 if (unify (tparms
, targs
, t
,
8403 TREE_VEC_ELT (argvec
, i
),
8408 arg
= CLASSTYPE_TI_TEMPLATE (arg
);
8413 /* If PARM is `const T' and ARG is only `int', we don't have
8414 a match unless we are allowing additional qualification.
8415 If ARG is `const int' and PARM is just `T' that's OK;
8416 that binds `const int' to `T'. */
8417 if (!check_cv_quals_for_unify (strict
| UNIFY_ALLOW_LESS_CV_QUAL
,
8421 /* Consider the case where ARG is `const volatile int' and
8422 PARM is `const T'. Then, T should be `volatile int'. */
8424 cp_build_qualified_type_real (arg
,
8426 & ~CP_TYPE_QUALS (parm
),
8428 if (arg
== error_mark_node
)
8432 /* Simple cases: Value already set, does match or doesn't. */
8433 if (targ
!= NULL_TREE
&& same_type_p (targ
, arg
))
8438 /* Make sure that ARG is not a variable-sized array. (Note that
8439 were talking about variable-sized arrays (like `int[n]'),
8440 rather than arrays of unknown size (like `int[]').) We'll
8441 get very confused by such a type since the bound of the array
8442 will not be computable in an instantiation. Besides, such
8443 types are not allowed in ISO C++, so we can do as we please
8445 if (TREE_CODE (arg
) == ARRAY_TYPE
8446 && !uses_template_parms (arg
)
8447 && (TREE_CODE (TYPE_MAX_VALUE (TYPE_DOMAIN (arg
)))
8451 TREE_VEC_ELT (targs
, idx
) = arg
;
8454 case TEMPLATE_PARM_INDEX
:
8455 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, 0));
8457 if (TEMPLATE_PARM_LEVEL (parm
)
8458 != template_decl_level (tparm
))
8459 /* The PARM is not one we're trying to unify. Just check
8460 to see if it matches ARG. */
8461 return (TREE_CODE (arg
) == TREE_CODE (parm
)
8462 && cp_tree_equal (parm
, arg
) > 0) ? 0 : 1;
8464 idx
= TEMPLATE_PARM_IDX (parm
);
8465 targ
= TREE_VEC_ELT (targs
, idx
);
8469 int i
= (cp_tree_equal (targ
, arg
) > 0);
8475 my_friendly_abort (42);
8478 /* [temp.deduct.type] If, in the declaration of a function template
8479 with a non-type template-parameter, the non-type
8480 template-parameter is used in an expression in the function
8481 parameter-list and, if the corresponding template-argument is
8482 deduced, the template-argument type shall match the type of the
8483 template-parameter exactly, except that a template-argument
8484 deduced from an array bound may be of any integral type. */
8485 if (same_type_p (TREE_TYPE (arg
), TREE_TYPE (parm
)))
8487 else if ((strict
& UNIFY_ALLOW_INTEGER
)
8488 && (TREE_CODE (TREE_TYPE (parm
)) == INTEGER_TYPE
8489 || TREE_CODE (TREE_TYPE (parm
)) == BOOLEAN_TYPE
))
8494 TREE_VEC_ELT (targs
, idx
) = arg
;
8501 if (TREE_CODE (arg
) != POINTER_TYPE
)
8504 /* [temp.deduct.call]
8506 A can be another pointer or pointer to member type that can
8507 be converted to the deduced A via a qualification
8508 conversion (_conv.qual_).
8510 We pass down STRICT here rather than UNIFY_ALLOW_NONE.
8511 This will allow for additional cv-qualification of the
8512 pointed-to types if appropriate. In general, this is a bit
8513 too generous; we are only supposed to allow qualification
8514 conversions and this method will allow an ARG of char** and
8515 a deduced ARG of const char**. However, overload
8516 resolution will subsequently invalidate the candidate, so
8517 this is probably OK. */
8518 sub_strict
= strict
;
8520 if (TREE_CODE (TREE_TYPE (arg
)) != RECORD_TYPE
)
8521 /* The derived-to-base conversion only persists through one
8522 level of pointers. */
8523 sub_strict
&= ~UNIFY_ALLOW_DERIVED
;
8525 return unify (tparms
, targs
, TREE_TYPE (parm
),
8526 TREE_TYPE (arg
), sub_strict
);
8529 case REFERENCE_TYPE
:
8530 if (TREE_CODE (arg
) != REFERENCE_TYPE
)
8532 return unify (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
8536 if (TREE_CODE (arg
) != ARRAY_TYPE
)
8538 if ((TYPE_DOMAIN (parm
) == NULL_TREE
)
8539 != (TYPE_DOMAIN (arg
) == NULL_TREE
))
8541 if (TYPE_DOMAIN (parm
) != NULL_TREE
8542 && unify (tparms
, targs
, TYPE_DOMAIN (parm
),
8543 TYPE_DOMAIN (arg
), UNIFY_ALLOW_NONE
) != 0)
8545 return unify (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
8553 if (TREE_CODE (arg
) != TREE_CODE (parm
))
8556 if (TREE_CODE (parm
) == INTEGER_TYPE
8557 && TREE_CODE (TYPE_MAX_VALUE (parm
)) != INTEGER_CST
)
8559 if (TYPE_MIN_VALUE (parm
) && TYPE_MIN_VALUE (arg
)
8560 && unify (tparms
, targs
, TYPE_MIN_VALUE (parm
),
8561 TYPE_MIN_VALUE (arg
), UNIFY_ALLOW_INTEGER
))
8563 if (TYPE_MAX_VALUE (parm
) && TYPE_MAX_VALUE (arg
)
8564 && unify (tparms
, targs
, TYPE_MAX_VALUE (parm
),
8565 TYPE_MAX_VALUE (arg
), UNIFY_ALLOW_INTEGER
))
8568 /* We have already checked cv-qualification at the top of the
8570 else if (!same_type_ignoring_top_level_qualifiers_p (arg
, parm
))
8573 /* As far as unification is concerned, this wins. Later checks
8574 will invalidate it if necessary. */
8577 /* Types INTEGER_CST and MINUS_EXPR can come from array bounds. */
8578 /* Type INTEGER_CST can come from ordinary constant template args. */
8580 while (TREE_CODE (arg
) == NOP_EXPR
)
8581 arg
= TREE_OPERAND (arg
, 0);
8583 if (TREE_CODE (arg
) != INTEGER_CST
)
8585 return !tree_int_cst_equal (parm
, arg
);
8590 if (TREE_CODE (arg
) != TREE_VEC
)
8592 if (TREE_VEC_LENGTH (parm
) != TREE_VEC_LENGTH (arg
))
8594 for (i
= 0; i
< TREE_VEC_LENGTH (parm
); ++i
)
8595 if (unify (tparms
, targs
,
8596 TREE_VEC_ELT (parm
, i
), TREE_VEC_ELT (arg
, i
),
8604 if (TREE_CODE (arg
) != TREE_CODE (parm
))
8607 if (TYPE_PTRMEMFUNC_P (parm
))
8609 if (!TYPE_PTRMEMFUNC_P (arg
))
8612 return unify (tparms
, targs
,
8613 TYPE_PTRMEMFUNC_FN_TYPE (parm
),
8614 TYPE_PTRMEMFUNC_FN_TYPE (arg
),
8618 if (CLASSTYPE_TEMPLATE_INFO (parm
))
8622 if (strict
& UNIFY_ALLOW_DERIVED
)
8624 /* First, we try to unify the PARM and ARG directly. */
8625 t
= try_class_unification (tparms
, targs
,
8630 /* Fallback to the special case allowed in
8633 If P is a class, and P has the form
8634 template-id, then A can be a derived class of
8635 the deduced A. Likewise, if P is a pointer to
8636 a class of the form template-id, A can be a
8637 pointer to a derived class pointed to by the
8639 t
= get_template_base (tparms
, targs
,
8642 if (! t
|| t
== error_mark_node
)
8646 else if (CLASSTYPE_TEMPLATE_INFO (arg
)
8647 && (CLASSTYPE_TI_TEMPLATE (parm
)
8648 == CLASSTYPE_TI_TEMPLATE (arg
)))
8649 /* Perhaps PARM is something like S<U> and ARG is S<int>.
8650 Then, we should unify `int' and `U'. */
8653 /* There's no chance of unication succeeding. */
8656 return unify (tparms
, targs
, CLASSTYPE_TI_ARGS (parm
),
8657 CLASSTYPE_TI_ARGS (t
), UNIFY_ALLOW_NONE
);
8659 else if (!same_type_ignoring_top_level_qualifiers_p (parm
, arg
))
8665 if (TREE_CODE (arg
) != TREE_CODE (parm
))
8668 if (unify (tparms
, targs
, TREE_TYPE (parm
),
8669 TREE_TYPE (arg
), UNIFY_ALLOW_NONE
))
8671 return type_unification_real (tparms
, targs
, TYPE_ARG_TYPES (parm
),
8672 TYPE_ARG_TYPES (arg
), 1,
8676 if (TREE_CODE (arg
) != OFFSET_TYPE
)
8678 if (unify (tparms
, targs
, TYPE_OFFSET_BASETYPE (parm
),
8679 TYPE_OFFSET_BASETYPE (arg
), UNIFY_ALLOW_NONE
))
8681 return unify (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
8685 if (arg
!= decl_constant_value (parm
))
8690 /* Matched cases are handled by the ARG == PARM test above. */
8694 if (TREE_CODE (TREE_OPERAND (parm
, 1)) == INTEGER_CST
)
8696 /* We handle this case specially, since it comes up with
8697 arrays. In particular, something like:
8699 template <int N> void f(int (&x)[N]);
8701 Here, we are trying to unify the range type, which
8702 looks like [0 ... (N - 1)]. */
8704 t1
= TREE_OPERAND (parm
, 0);
8705 t2
= TREE_OPERAND (parm
, 1);
8707 t
= fold (build (PLUS_EXPR
, integer_type_node
, arg
, t2
));
8709 return unify (tparms
, targs
, t1
, t
, strict
);
8711 /* else fall through */
8714 if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (TREE_CODE (parm
))))
8715 /* We're looking at an expression. This can happen with
8719 void foo(S<I>, S<I + 2>);
8721 This is a "nondeduced context":
8725 The nondeduced contexts are:
8727 --A type that is a template-id in which one or more of
8728 the template-arguments is an expression that references
8729 a template-parameter.
8731 In these cases, we assume deduction succeeded, but don't
8732 actually infer any unifications. */
8735 sorry ("use of `%s' in template type unification",
8736 tree_code_name
[(int) TREE_CODE (parm
)]);
8742 /* Called if RESULT is explicitly instantiated, or is a member of an
8743 explicitly instantiated class, or if using -frepo and the
8744 instantiation of RESULT has been assigned to this file. */
8747 mark_decl_instantiated (result
, extern_p
)
8751 if (TREE_CODE (result
) != FUNCTION_DECL
)
8752 /* The TREE_PUBLIC flag for function declarations will have been
8753 set correctly by tsubst. */
8754 TREE_PUBLIC (result
) = 1;
8756 /* We used to set this unconditionally; we moved that to
8757 do_decl_instantiation so it wouldn't get set on members of
8758 explicit class template instantiations. But we still need to set
8759 it here for the 'extern template' case in order to suppress
8760 implicit instantiations. */
8762 SET_DECL_EXPLICIT_INSTANTIATION (result
);
8766 DECL_INTERFACE_KNOWN (result
) = 1;
8767 DECL_NOT_REALLY_EXTERN (result
) = 1;
8769 /* Always make artificials weak. */
8770 if (DECL_ARTIFICIAL (result
) && flag_weak
)
8771 comdat_linkage (result
);
8772 /* For WIN32 we also want to put explicit instantiations in
8773 linkonce sections. */
8774 else if (TREE_PUBLIC (result
))
8775 maybe_make_one_only (result
);
8777 else if (TREE_CODE (result
) == FUNCTION_DECL
)
8781 /* Given two function templates PAT1 and PAT2, and explicit template
8782 arguments EXPLICIT_ARGS return:
8784 1 if PAT1 is more specialized than PAT2 as described in [temp.func.order].
8785 -1 if PAT2 is more specialized than PAT1.
8786 0 if neither is more specialized. */
8789 more_specialized (pat1
, pat2
, explicit_args
)
8790 tree pat1
, pat2
, explicit_args
;
8796 = get_bindings_overload (pat1
, DECL_TEMPLATE_RESULT (pat2
), explicit_args
);
8801 = get_bindings_overload (pat2
, DECL_TEMPLATE_RESULT (pat1
), explicit_args
);
8808 /* Given two class template specialization list nodes PAT1 and PAT2, return:
8810 1 if PAT1 is more specialized than PAT2 as described in [temp.class.order].
8811 -1 if PAT2 is more specialized than PAT1.
8812 0 if neither is more specialized. */
8815 more_specialized_class (pat1
, pat2
)
8821 targs
= get_class_bindings (TREE_VALUE (pat1
), TREE_PURPOSE (pat1
),
8822 TREE_PURPOSE (pat2
));
8826 targs
= get_class_bindings (TREE_VALUE (pat2
), TREE_PURPOSE (pat2
),
8827 TREE_PURPOSE (pat1
));
8834 /* Return the template arguments that will produce the function signature
8835 DECL from the function template FN, with the explicit template
8836 arguments EXPLICIT_ARGS. If CHECK_RETTYPE is 1, the return type must
8837 also match. Return NULL_TREE if no satisfactory arguments could be
8841 get_bindings_real (fn
, decl
, explicit_args
, check_rettype
)
8842 tree fn
, decl
, explicit_args
;
8845 int ntparms
= DECL_NTPARMS (fn
);
8846 tree targs
= make_tree_vec (ntparms
);
8848 tree decl_arg_types
;
8851 /* Substitute the explicit template arguments into the type of DECL.
8852 The call to fn_type_unification will handle substitution into the
8854 decl_type
= TREE_TYPE (decl
);
8855 if (explicit_args
&& uses_template_parms (decl_type
))
8858 tree converted_args
;
8860 if (DECL_TEMPLATE_INFO (decl
))
8861 tmpl
= DECL_TI_TEMPLATE (decl
);
8863 /* We can get here for some illegal specializations. */
8867 = (coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (tmpl
),
8868 explicit_args
, NULL_TREE
,
8870 /*require_all_arguments=*/0));
8871 if (converted_args
== error_mark_node
)
8874 decl_type
= tsubst (decl_type
, converted_args
, /*complain=*/0,
8876 if (decl_type
== error_mark_node
)
8880 /* If FN is a static member function, adjust the type of DECL
8882 decl_arg_types
= TYPE_ARG_TYPES (decl_type
);
8883 if (DECL_STATIC_FUNCTION_P (fn
)
8884 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
8885 decl_arg_types
= TREE_CHAIN (decl_arg_types
);
8887 i
= fn_type_unification (fn
, explicit_args
, targs
,
8889 (check_rettype
|| DECL_CONV_FN_P (fn
)
8890 ? TREE_TYPE (decl_type
) : NULL_TREE
),
8899 /* For most uses, we want to check the return type. */
8902 get_bindings (fn
, decl
, explicit_args
)
8903 tree fn
, decl
, explicit_args
;
8905 return get_bindings_real (fn
, decl
, explicit_args
, 1);
8908 /* But for more_specialized, we only care about the parameter types. */
8911 get_bindings_overload (fn
, decl
, explicit_args
)
8912 tree fn
, decl
, explicit_args
;
8914 return get_bindings_real (fn
, decl
, explicit_args
, 0);
8917 /* Return the innermost template arguments that, when applied to a
8918 template specialization whose innermost template parameters are
8919 TPARMS, and whose specialization arguments are ARGS, yield the
8922 For example, suppose we have:
8924 template <class T, class U> struct S {};
8925 template <class T> struct S<T*, int> {};
8927 Then, suppose we want to get `S<double*, int>'. The TPARMS will be
8928 {T}, the PARMS will be {T*, int} and the ARGS will be {double*,
8929 int}. The resulting vector will be {double}, indicating that `T'
8930 is bound to `double'. */
8933 get_class_bindings (tparms
, parms
, args
)
8934 tree tparms
, parms
, args
;
8936 int i
, ntparms
= TREE_VEC_LENGTH (tparms
);
8937 tree vec
= make_tree_vec (ntparms
);
8939 args
= INNERMOST_TEMPLATE_ARGS (args
);
8941 if (unify (tparms
, vec
, parms
, args
, UNIFY_ALLOW_NONE
))
8944 for (i
= 0; i
< ntparms
; ++i
)
8945 if (! TREE_VEC_ELT (vec
, i
))
8951 /* In INSTANTIATIONS is a list of <INSTANTIATION, TEMPLATE> pairs.
8952 Pick the most specialized template, and return the corresponding
8953 instantiation, or if there is no corresponding instantiation, the
8954 template itself. EXPLICIT_ARGS is any template arguments explicity
8955 mentioned in a template-id. If there is no most specialized
8956 template, error_mark_node is returned. If there are no templates
8957 at all, NULL_TREE is returned. */
8960 most_specialized_instantiation (instantiations
, explicit_args
)
8961 tree instantiations
;
8967 if (!instantiations
)
8970 champ
= instantiations
;
8971 for (fn
= TREE_CHAIN (instantiations
); fn
; fn
= TREE_CHAIN (fn
))
8973 fate
= more_specialized (TREE_VALUE (champ
),
8974 TREE_VALUE (fn
), explicit_args
);
8981 fn
= TREE_CHAIN (fn
);
8983 return error_mark_node
;
8989 for (fn
= instantiations
; fn
&& fn
!= champ
; fn
= TREE_CHAIN (fn
))
8991 fate
= more_specialized (TREE_VALUE (champ
),
8992 TREE_VALUE (fn
), explicit_args
);
8994 return error_mark_node
;
8997 return TREE_PURPOSE (champ
) ? TREE_PURPOSE (champ
) : TREE_VALUE (champ
);
9000 /* Return the most specialized of the list of templates in FNS that can
9001 produce an instantiation matching DECL, given the explicit template
9002 arguments EXPLICIT_ARGS. */
9005 most_specialized (fns
, decl
, explicit_args
)
9006 tree fns
, decl
, explicit_args
;
9008 tree candidates
= NULL_TREE
;
9011 for (fn
= fns
; fn
; fn
= TREE_CHAIN (fn
))
9013 tree candidate
= TREE_VALUE (fn
);
9015 args
= get_bindings (candidate
, decl
, explicit_args
);
9017 candidates
= tree_cons (NULL_TREE
, candidate
, candidates
);
9020 return most_specialized_instantiation (candidates
, explicit_args
);
9023 /* If DECL is a specialization of some template, return the most
9024 general such template. Otherwise, returns NULL_TREE.
9028 template <class T> struct S { template <class U> void f(U); };
9030 if TMPL is `template <class U> void S<int>::f(U)' this will return
9031 the full template. This function will not trace past partial
9032 specializations, however. For example, given in addition:
9034 template <class T> struct S<T*> { template <class U> void f(U); };
9036 if TMPL is `template <class U> void S<int*>::f(U)' this will return
9037 `template <class T> template <class U> S<T*>::f(U)'. */
9040 most_general_template (decl
)
9043 /* If DECL is a FUNCTION_DECL, find the TEMPLATE_DECL of which it is
9044 an immediate specialization. */
9045 if (TREE_CODE (decl
) == FUNCTION_DECL
)
9047 if (DECL_TEMPLATE_INFO (decl
)) {
9048 decl
= DECL_TI_TEMPLATE (decl
);
9050 /* The DECL_TI_TEMPLATE can be an IDENTIFIER_NODE for a
9052 if (TREE_CODE (decl
) != TEMPLATE_DECL
)
9058 /* Look for more and more general templates. */
9059 while (DECL_TEMPLATE_INFO (decl
))
9061 /* The DECL_TI_TEMPLATE can be a LOOKUP_EXPR or IDENTIFIER_NODE
9062 in some cases. (See cp-tree.h for details.) */
9063 if (TREE_CODE (DECL_TI_TEMPLATE (decl
)) != TEMPLATE_DECL
)
9066 /* Stop if we run into an explicitly specialized class template. */
9067 if (!DECL_NAMESPACE_SCOPE_P (decl
)
9068 && DECL_CONTEXT (decl
)
9069 && CLASSTYPE_TEMPLATE_SPECIALIZATION (DECL_CONTEXT (decl
)))
9072 decl
= DECL_TI_TEMPLATE (decl
);
9078 /* Return the most specialized of the class template specializations
9079 of TMPL which can produce an instantiation matching ARGS, or
9080 error_mark_node if the choice is ambiguous. */
9083 most_specialized_class (tmpl
, args
)
9087 tree list
= NULL_TREE
;
9092 tmpl
= most_general_template (tmpl
);
9093 for (t
= DECL_TEMPLATE_SPECIALIZATIONS (tmpl
); t
; t
= TREE_CHAIN (t
))
9096 = get_class_bindings (TREE_VALUE (t
), TREE_PURPOSE (t
), args
);
9099 list
= decl_tree_cons (TREE_PURPOSE (t
), TREE_VALUE (t
), list
);
9100 TREE_TYPE (list
) = TREE_TYPE (t
);
9110 for (; t
; t
= TREE_CHAIN (t
))
9112 fate
= more_specialized_class (champ
, t
);
9121 return error_mark_node
;
9127 for (t
= list
; t
&& t
!= champ
; t
= TREE_CHAIN (t
))
9129 fate
= more_specialized_class (champ
, t
);
9131 return error_mark_node
;
9137 /* called from the parser. */
9140 do_decl_instantiation (declspecs
, declarator
, storage
)
9141 tree declspecs
, declarator
, storage
;
9143 tree decl
= grokdeclarator (declarator
, declspecs
, NORMAL
, 0, NULL_TREE
);
9144 tree result
= NULL_TREE
;
9148 /* An error ocurred, for which grokdeclarator has already issued
9149 an appropriate message. */
9151 else if (! DECL_LANG_SPECIFIC (decl
))
9153 cp_error ("explicit instantiation of non-template `%#D'", decl
);
9156 else if (TREE_CODE (decl
) == VAR_DECL
)
9158 /* There is an asymmetry here in the way VAR_DECLs and
9159 FUNCTION_DECLs are handled by grokdeclarator. In the case of
9160 the latter, the DECL we get back will be marked as a
9161 template instantiation, and the appropriate
9162 DECL_TEMPLATE_INFO will be set up. This does not happen for
9163 VAR_DECLs so we do the lookup here. Probably, grokdeclarator
9164 should handle VAR_DECLs as it currently handles
9166 result
= lookup_field (DECL_CONTEXT (decl
), DECL_NAME (decl
), 0, 0);
9167 if (result
&& TREE_CODE (result
) != VAR_DECL
)
9169 cp_error ("no matching template for `%D' found", result
);
9173 else if (TREE_CODE (decl
) != FUNCTION_DECL
)
9175 cp_error ("explicit instantiation of `%#D'", decl
);
9181 /* Check for various error cases. Note that if the explicit
9182 instantiation is legal the RESULT will currently be marked as an
9183 *implicit* instantiation; DECL_EXPLICIT_INSTANTIATION is not set
9184 until we get here. */
9186 if (DECL_TEMPLATE_SPECIALIZATION (result
))
9190 No program shall both explicitly instantiate and explicitly
9191 specialize a template. */
9192 cp_pedwarn ("explicit instantiation of `%#D' after", result
);
9193 cp_pedwarn_at ("explicit specialization here", result
);
9196 else if (DECL_EXPLICIT_INSTANTIATION (result
))
9200 No program shall explicitly instantiate any template more
9203 We check DECL_INTERFACE_KNOWN so as not to complain when the first
9204 instantiation was `extern' and the second is not, and EXTERN_P for
9205 the opposite case. If -frepo, chances are we already got marked
9206 as an explicit instantion because of the repo file. */
9207 if (DECL_INTERFACE_KNOWN (result
) && !extern_p
&& !flag_use_repository
)
9208 cp_pedwarn ("duplicate explicit instantiation of `%#D'", result
);
9210 /* If we've already instantiated the template, just return now. */
9211 if (DECL_INTERFACE_KNOWN (result
))
9214 else if (!DECL_IMPLICIT_INSTANTIATION (result
))
9216 cp_error ("no matching template for `%D' found", result
);
9219 else if (!DECL_TEMPLATE_INFO (result
))
9221 cp_pedwarn ("explicit instantiation of non-template `%#D'", result
);
9225 if (flag_external_templates
)
9228 if (storage
== NULL_TREE
)
9230 else if (storage
== ridpointers
[(int) RID_EXTERN
])
9233 cp_pedwarn ("ISO C++ forbids the use of `extern' on explicit instantiations");
9237 cp_error ("storage class `%D' applied to template instantiation",
9240 SET_DECL_EXPLICIT_INSTANTIATION (result
);
9241 mark_decl_instantiated (result
, extern_p
);
9242 repo_template_instantiated (result
, extern_p
);
9244 instantiate_decl (result
, /*defer_ok=*/1);
9248 mark_class_instantiated (t
, extern_p
)
9252 SET_CLASSTYPE_EXPLICIT_INSTANTIATION (t
);
9253 SET_CLASSTYPE_INTERFACE_KNOWN (t
);
9254 CLASSTYPE_INTERFACE_ONLY (t
) = extern_p
;
9255 CLASSTYPE_VTABLE_NEEDS_WRITING (t
) = ! extern_p
;
9256 TYPE_DECL_SUPPRESS_DEBUG (TYPE_NAME (t
)) = extern_p
;
9259 CLASSTYPE_DEBUG_REQUESTED (t
) = 1;
9260 rest_of_type_compilation (t
, 1);
9265 do_type_instantiation (t
, storage
)
9272 if (TREE_CODE (t
) == TYPE_DECL
)
9275 if (! CLASS_TYPE_P (t
) || ! CLASSTYPE_TEMPLATE_INFO (t
))
9277 cp_error ("explicit instantiation of non-template type `%T'", t
);
9283 /* With -fexternal-templates, explicit instantiations are treated the same
9284 as implicit ones. */
9285 if (flag_external_templates
)
9288 if (!COMPLETE_TYPE_P (t
))
9290 cp_error ("explicit instantiation of `%#T' before definition of template",
9295 if (storage
!= NULL_TREE
)
9298 cp_pedwarn("ISO C++ forbids the use of `%s' on explicit instantiations",
9299 IDENTIFIER_POINTER (storage
));
9301 if (storage
== ridpointers
[(int) RID_INLINE
])
9303 else if (storage
== ridpointers
[(int) RID_EXTERN
])
9305 else if (storage
== ridpointers
[(int) RID_STATIC
])
9309 cp_error ("storage class `%D' applied to template instantiation",
9315 if (CLASSTYPE_TEMPLATE_SPECIALIZATION (t
))
9319 No program shall both explicitly instantiate and explicitly
9320 specialize a template. */
9321 cp_error ("explicit instantiation of `%#T' after", t
);
9322 cp_error_at ("explicit specialization here", t
);
9325 else if (CLASSTYPE_EXPLICIT_INSTANTIATION (t
))
9329 No program shall explicitly instantiate any template more
9332 If CLASSTYPE_INTERFACE_ONLY, then the first explicit instantiation
9333 was `extern'. If EXTERN_P then the second is. If -frepo, chances
9334 are we already got marked as an explicit instantion because of the
9335 repo file. All these cases are OK. */
9336 if (!CLASSTYPE_INTERFACE_ONLY (t
) && !extern_p
&& !flag_use_repository
)
9337 cp_pedwarn ("duplicate explicit instantiation of `%#T'", t
);
9339 /* If we've already instantiated the template, just return now. */
9340 if (!CLASSTYPE_INTERFACE_ONLY (t
))
9344 mark_class_instantiated (t
, extern_p
);
9345 repo_template_instantiated (t
, extern_p
);
9353 /* In contrast to implicit instantiation, where only the
9354 declarations, and not the definitions, of members are
9355 instantiated, we have here:
9359 The explicit instantiation of a class template specialization
9360 implies the instantiation of all of its members not
9361 previously explicitly specialized in the translation unit
9362 containing the explicit instantiation.
9364 Of course, we can't instantiate member template classes, since
9365 we don't have any arguments for them. Note that the standard
9366 is unclear on whether the instatiation of the members are
9367 *explicit* instantiations or not. We choose to be generous,
9368 and not set DECL_EXPLICIT_INSTANTIATION. Therefore, we allow
9369 the explicit instantiation of a class where some of the members
9370 have no definition in the current translation unit. */
9373 for (tmp
= TYPE_METHODS (t
); tmp
; tmp
= TREE_CHAIN (tmp
))
9374 if (TREE_CODE (tmp
) == FUNCTION_DECL
9375 && DECL_TEMPLATE_INSTANTIATION (tmp
))
9377 mark_decl_instantiated (tmp
, extern_p
);
9378 repo_template_instantiated (tmp
, extern_p
);
9380 instantiate_decl (tmp
, /*defer_ok=*/1);
9383 for (tmp
= TYPE_FIELDS (t
); tmp
; tmp
= TREE_CHAIN (tmp
))
9384 if (TREE_CODE (tmp
) == VAR_DECL
&& DECL_TEMPLATE_INSTANTIATION (tmp
))
9386 mark_decl_instantiated (tmp
, extern_p
);
9387 repo_template_instantiated (tmp
, extern_p
);
9389 instantiate_decl (tmp
, /*defer_ok=*/1);
9392 for (tmp
= CLASSTYPE_TAGS (t
); tmp
; tmp
= TREE_CHAIN (tmp
))
9393 if (IS_AGGR_TYPE (TREE_VALUE (tmp
))
9394 && !uses_template_parms (CLASSTYPE_TI_ARGS (TREE_VALUE (tmp
))))
9395 do_type_instantiation (TYPE_MAIN_DECL (TREE_VALUE (tmp
)), storage
);
9399 /* Given a function DECL, which is a specialization of TMPL, modify
9400 DECL to be a re-instantiation of TMPL with the same template
9401 arguments. TMPL should be the template into which tsubst'ing
9402 should occur for DECL, not the most general template.
9404 One reason for doing this is a scenario like this:
9407 void f(const T&, int i);
9409 void g() { f(3, 7); }
9412 void f(const T& t, const int i) { }
9414 Note that when the template is first instantiated, with
9415 instantiate_template, the resulting DECL will have no name for the
9416 first parameter, and the wrong type for the second. So, when we go
9417 to instantiate the DECL, we regenerate it. */
9420 regenerate_decl_from_template (decl
, tmpl
)
9424 /* The most general version of TMPL. */
9426 /* The arguments used to instantiate DECL, from the most general
9433 args
= DECL_TI_ARGS (decl
);
9434 code_pattern
= DECL_TEMPLATE_RESULT (tmpl
);
9436 /* Unregister the specialization so that when we tsubst we will not
9437 just return DECL. We don't have to unregister DECL from TMPL
9438 because if would only be registered there if it were a partial
9439 instantiation of a specialization, which it isn't: it's a full
9441 gen_tmpl
= most_general_template (tmpl
);
9442 unregistered
= unregister_specialization (decl
, gen_tmpl
);
9444 /* If the DECL was not unregistered then something peculiar is
9445 happening: we created a specialization but did not call
9446 register_specialization for it. */
9447 my_friendly_assert (unregistered
, 0);
9449 if (TREE_CODE (decl
) == VAR_DECL
)
9450 /* Make sure that we can see identifiers, and compute access
9451 correctly, for the class members used in the declaration of
9452 this static variable. */
9453 pushclass (DECL_CONTEXT (decl
), 2);
9455 /* Do the substitution to get the new declaration. */
9456 new_decl
= tsubst (code_pattern
, args
, /*complain=*/1, NULL_TREE
);
9458 if (TREE_CODE (decl
) == VAR_DECL
)
9460 /* Set up DECL_INITIAL, since tsubst doesn't. */
9461 DECL_INITIAL (new_decl
) =
9462 tsubst_expr (DECL_INITIAL (code_pattern
), args
,
9463 /*complain=*/1, DECL_TI_TEMPLATE (decl
));
9464 /* Pop the class context we pushed above. */
9467 else if (TREE_CODE (decl
) == FUNCTION_DECL
)
9469 /* Convince duplicate_decls to use the DECL_ARGUMENTS from the
9471 DECL_INITIAL (new_decl
) = error_mark_node
;
9472 /* And don't complain about a duplicate definition. */
9473 DECL_INITIAL (decl
) = NULL_TREE
;
9476 /* The immediate parent of the new template is still whatever it was
9477 before, even though tsubst sets DECL_TI_TEMPLATE up as the most
9478 general template. We also reset the DECL_ASSEMBLER_NAME since
9479 tsubst always calculates the name as if the function in question
9480 were really a template instance, and sometimes, with friend
9481 functions, this is not so. See tsubst_friend_function for
9483 DECL_TI_TEMPLATE (new_decl
) = DECL_TI_TEMPLATE (decl
);
9484 DECL_ASSEMBLER_NAME (new_decl
) = DECL_ASSEMBLER_NAME (decl
);
9485 DECL_RTL (new_decl
) = DECL_RTL (decl
);
9486 DECL_USE_TEMPLATE (new_decl
) = DECL_USE_TEMPLATE (decl
);
9488 /* Call duplicate decls to merge the old and new declarations. */
9489 duplicate_decls (new_decl
, decl
);
9491 /* Now, re-register the specialization. */
9492 register_specialization (decl
, gen_tmpl
, args
);
9495 /* Produce the definition of D, a _DECL generated from a template. If
9496 DEFER_OK is non-zero, then we don't have to actually do the
9497 instantiation now; we just have to do it sometime. */
9500 instantiate_decl (d
, defer_ok
)
9504 tree tmpl
= DECL_TI_TEMPLATE (d
);
9505 tree args
= DECL_TI_ARGS (d
);
9510 int pattern_defined
;
9512 const char *file
= input_filename
;
9514 /* This function should only be used to instantiate templates for
9515 functions and static member variables. */
9516 my_friendly_assert (TREE_CODE (d
) == FUNCTION_DECL
9517 || TREE_CODE (d
) == VAR_DECL
, 0);
9519 /* Don't instantiate cloned functions. Instead, instantiate the
9520 functions they cloned. */
9521 if (TREE_CODE (d
) == FUNCTION_DECL
&& DECL_CLONED_FUNCTION_P (d
))
9522 d
= DECL_CLONED_FUNCTION (d
);
9524 if (DECL_TEMPLATE_INSTANTIATED (d
))
9525 /* D has already been instantiated. It might seem reasonable to
9526 check whether or not D is an explict instantiation, and, if so,
9527 stop here. But when an explicit instantiation is deferred
9528 until the end of the compilation, DECL_EXPLICIT_INSTANTIATION
9529 is set, even though we still need to do the instantiation. */
9532 /* If we already have a specialization of this declaration, then
9533 there's no reason to instantiate it. Note that
9534 retrieve_specialization gives us both instantiations and
9535 specializations, so we must explicitly check
9536 DECL_TEMPLATE_SPECIALIZATION. */
9537 gen_tmpl
= most_general_template (tmpl
);
9538 spec
= retrieve_specialization (gen_tmpl
, args
);
9539 if (spec
!= NULL_TREE
&& DECL_TEMPLATE_SPECIALIZATION (spec
))
9542 /* This needs to happen before any tsubsting. */
9543 if (! push_tinst_level (d
))
9546 timevar_push (TV_PARSE
);
9548 /* Set TD to the template whose DECL_TEMPLATE_RESULT is the pattern
9549 for the instantiation. This is not always the most general
9550 template. Consider, for example:
9553 struct S { template <class U> void f();
9554 template <> void f<int>(); };
9556 and an instantiation of S<double>::f<int>. We want TD to be the
9557 specialization S<T>::f<int>, not the more general S<T>::f<U>. */
9559 while (/* An instantiation cannot have a definition, so we need a
9560 more general template. */
9561 DECL_TEMPLATE_INSTANTIATION (td
)
9562 /* We must also deal with friend templates. Given:
9564 template <class T> struct S {
9565 template <class U> friend void f() {};
9568 S<int>::f<U> say, is not an instantiation of S<T>::f<U>,
9569 so far as the language is concerned, but that's still
9570 where we get the pattern for the instantiation from. On
9571 ther hand, if the definition comes outside the class, say:
9573 template <class T> struct S {
9574 template <class U> friend void f();
9576 template <class U> friend void f() {}
9578 we don't need to look any further. That's what the check for
9579 DECL_INITIAL is for. */
9580 || (TREE_CODE (d
) == FUNCTION_DECL
9581 && DECL_FRIEND_PSEUDO_TEMPLATE_INSTANTIATION (td
)
9582 && !DECL_INITIAL (DECL_TEMPLATE_RESULT (td
))))
9584 /* The present template, TD, should not be a definition. If it
9585 were a definition, we should be using it! Note that we
9586 cannot restructure the loop to just keep going until we find
9587 a template with a definition, since that might go too far if
9588 a specialization was declared, but not defined. */
9589 my_friendly_assert (!(TREE_CODE (d
) == VAR_DECL
9590 && !DECL_IN_AGGR_P (DECL_TEMPLATE_RESULT (td
))),
9593 /* Fetch the more general template. */
9594 td
= DECL_TI_TEMPLATE (td
);
9597 code_pattern
= DECL_TEMPLATE_RESULT (td
);
9599 if (TREE_CODE (d
) == FUNCTION_DECL
)
9600 pattern_defined
= (DECL_SAVED_TREE (code_pattern
) != NULL_TREE
);
9602 pattern_defined
= ! DECL_IN_AGGR_P (code_pattern
);
9604 push_to_top_level ();
9605 lineno
= DECL_SOURCE_LINE (d
);
9606 input_filename
= DECL_SOURCE_FILE (d
);
9608 if (pattern_defined
)
9610 repo_template_used (d
);
9612 if (flag_external_templates
&& ! DECL_INTERFACE_KNOWN (d
))
9614 if (flag_alt_external_templates
)
9616 if (interface_unknown
)
9617 warn_if_unknown_interface (d
);
9619 else if (DECL_INTERFACE_KNOWN (code_pattern
))
9621 DECL_INTERFACE_KNOWN (d
) = 1;
9622 DECL_NOT_REALLY_EXTERN (d
) = ! DECL_EXTERNAL (code_pattern
);
9625 warn_if_unknown_interface (code_pattern
);
9629 import_export_decl (d
);
9632 /* Reject all external templates except inline functions. */
9633 if (DECL_INTERFACE_KNOWN (d
)
9634 && ! DECL_NOT_REALLY_EXTERN (d
)
9635 && ! (TREE_CODE (d
) == FUNCTION_DECL
&& DECL_INLINE (d
)))
9638 /* We need to set up DECL_INITIAL regardless of pattern_defined if
9639 the variable is a static const initialized in the class body. */
9640 if (TREE_CODE (d
) == VAR_DECL
9641 && TREE_READONLY (d
)
9642 && DECL_INITIAL (d
) == NULL_TREE
9643 && DECL_INITIAL (code_pattern
) != NULL_TREE
)
9645 /* Defer all other templates, unless we have been explicitly
9646 forbidden from doing so. We restore the source position here
9647 because it's used by add_pending_template. */
9648 else if (! pattern_defined
|| defer_ok
)
9651 input_filename
= file
;
9653 if (at_eof
&& !pattern_defined
9654 && DECL_EXPLICIT_INSTANTIATION (d
))
9657 The definition of a non-exported function template, a
9658 non-exported member function template, or a non-exported
9659 member function or static data member of a class template
9660 shall be present in every translation unit in which it is
9661 explicitly instantiated. */
9662 cp_error ("explicit instantiation of `%D' but no definition available",
9665 add_pending_template (d
);
9669 /* We're now committed to instantiating this template. Mark it as
9670 instantiated so that recursive calls to instantiate_decl do not
9671 try to instantiate it again. */
9672 DECL_TEMPLATE_INSTANTIATED (d
) = 1;
9674 /* Regenerate the declaration in case the template has been modified
9675 by a subsequent redeclaration. */
9676 regenerate_decl_from_template (d
, td
);
9678 /* We already set the file and line above. Reset them now in case
9679 they changed as a result of calling regenerate_decl_from_template. */
9680 lineno
= DECL_SOURCE_LINE (d
);
9681 input_filename
= DECL_SOURCE_FILE (d
);
9683 if (TREE_CODE (d
) == VAR_DECL
)
9685 DECL_IN_AGGR_P (d
) = 0;
9686 if (DECL_INTERFACE_KNOWN (d
))
9687 DECL_EXTERNAL (d
) = ! DECL_NOT_REALLY_EXTERN (d
);
9690 DECL_EXTERNAL (d
) = 1;
9691 DECL_NOT_REALLY_EXTERN (d
) = 1;
9693 cp_finish_decl (d
, DECL_INITIAL (d
), NULL_TREE
, 0);
9695 else if (TREE_CODE (d
) == FUNCTION_DECL
)
9697 htab_t saved_local_specializations
;
9699 /* Save away the current list, in case we are instantiating one
9700 template from within the body of another. */
9701 saved_local_specializations
= local_specializations
;
9703 /* Set up the list of local specializations. */
9704 local_specializations
= htab_create (37,
9709 /* Set up context. */
9710 start_function (NULL_TREE
, d
, NULL_TREE
, SF_PRE_PARSED
);
9711 store_parm_decls ();
9713 /* We already set up __FUNCTION__, etc., so we don't want to do
9715 current_function_name_declared
= 1;
9717 /* Substitute into the body of the function. */
9718 tsubst_expr (DECL_SAVED_TREE (code_pattern
), args
,
9719 /*complain=*/1, tmpl
);
9721 /* We don't need the local specializations any more. */
9722 htab_delete (local_specializations
);
9723 local_specializations
= saved_local_specializations
;
9725 /* Finish the function. */
9726 expand_body (finish_function (0));
9729 /* We're not deferring instantiation any more. */
9730 TI_PENDING_TEMPLATE_FLAG (DECL_TEMPLATE_INFO (d
)) = 0;
9734 input_filename
= file
;
9736 pop_from_top_level ();
9739 timevar_pop (TV_PARSE
);
9744 /* Run through the list of templates that we wish we could
9745 instantiate, and instantiate any we can. */
9748 instantiate_pending_templates ()
9751 int instantiated_something
= 0;
9758 t
= &pending_templates
;
9761 tree instantiation
= TREE_VALUE (*t
);
9763 reopen_tinst_level (TREE_PURPOSE (*t
));
9765 if (TYPE_P (instantiation
))
9769 if (!COMPLETE_TYPE_P (instantiation
))
9771 instantiate_class_template (instantiation
);
9772 if (CLASSTYPE_TEMPLATE_INSTANTIATION (instantiation
))
9773 for (fn
= TYPE_METHODS (instantiation
);
9775 fn
= TREE_CHAIN (fn
))
9776 if (! DECL_ARTIFICIAL (fn
))
9777 instantiate_decl (fn
, /*defer_ok=*/0);
9778 if (COMPLETE_TYPE_P (instantiation
))
9780 instantiated_something
= 1;
9785 if (COMPLETE_TYPE_P (instantiation
))
9786 /* If INSTANTIATION has been instantiated, then we don't
9787 need to consider it again in the future. */
9788 *t
= TREE_CHAIN (*t
);
9790 t
= &TREE_CHAIN (*t
);
9794 if (!DECL_TEMPLATE_SPECIALIZATION (instantiation
)
9795 && !DECL_TEMPLATE_INSTANTIATED (instantiation
))
9797 instantiation
= instantiate_decl (instantiation
,
9799 if (DECL_TEMPLATE_INSTANTIATED (instantiation
))
9801 instantiated_something
= 1;
9806 if (DECL_TEMPLATE_SPECIALIZATION (instantiation
)
9807 || DECL_TEMPLATE_INSTANTIATED (instantiation
))
9808 /* If INSTANTIATION has been instantiated, then we don't
9809 need to consider it again in the future. */
9810 *t
= TREE_CHAIN (*t
);
9812 t
= &TREE_CHAIN (*t
);
9817 /* Go through the things that are template instantiations if we are
9818 using guiding declarations. */
9819 t
= &maybe_templates
;
9826 fn
= TREE_VALUE (*t
);
9828 if (DECL_INITIAL (fn
))
9829 /* If the FN is already defined, then it was either already
9830 instantiated or, even though guiding declarations were
9831 allowed, a non-template definition was provided. */
9835 template = TREE_PURPOSE (*t
);
9836 args
= get_bindings (template, fn
, NULL_TREE
);
9837 fn
= instantiate_template (template, args
);
9838 instantiate_decl (fn
, /*defer_ok=*/0);
9842 /* Remove this entry from the chain. */
9843 *t
= TREE_CHAIN (*t
);
9845 maybe_template_tail
= t
;
9849 return instantiated_something
;
9852 /* Substitute ARGVEC into T, which is a list of initializers for
9853 either base class or a non-static data member. The TREE_PURPOSEs
9854 are DECLs, and the TREE_VALUEs are the initializer values. Used by
9855 instantiate_decl. */
9858 tsubst_initializer_list (t
, argvec
)
9861 tree first
= NULL_TREE
;
9864 for (; t
; t
= TREE_CHAIN (t
))
9870 decl
= tsubst_copy (TREE_PURPOSE (t
), argvec
, /*complain=*/1,
9872 init
= tsubst_expr (TREE_VALUE (t
), argvec
, /*complain=*/1,
9877 else if (TREE_CODE (init
) == TREE_LIST
)
9878 for (val
= init
; val
; val
= TREE_CHAIN (val
))
9879 TREE_VALUE (val
) = convert_from_reference (TREE_VALUE (val
));
9881 init
= convert_from_reference (init
);
9883 *p
= build_tree_list (decl
, init
);
9884 p
= &TREE_CHAIN (*p
);
9889 /* D is an undefined function declaration in the presence of templates with
9890 the same name, listed in FNS. If one of them can produce D as an
9891 instantiation, remember this so we can instantiate it at EOF if D has
9892 not been defined by that time. */
9895 add_maybe_template (d
, fns
)
9900 if (DECL_MAYBE_TEMPLATE (d
))
9903 t
= most_specialized (fns
, d
, NULL_TREE
);
9906 if (t
== error_mark_node
)
9908 cp_error ("ambiguous template instantiation for `%D'", d
);
9912 *maybe_template_tail
= tree_cons (t
, d
, NULL_TREE
);
9913 maybe_template_tail
= &TREE_CHAIN (*maybe_template_tail
);
9914 DECL_MAYBE_TEMPLATE (d
) = 1;
9917 /* Set CURRENT_ACCESS_SPECIFIER based on the protection of DECL. */
9920 set_current_access_from_decl (decl
)
9923 if (TREE_PRIVATE (decl
))
9924 current_access_specifier
= access_private_node
;
9925 else if (TREE_PROTECTED (decl
))
9926 current_access_specifier
= access_protected_node
;
9928 current_access_specifier
= access_public_node
;
9931 /* Instantiate an enumerated type. TAG is the template type, NEWTAG
9932 is the instantiation (which should have been created with
9933 start_enum) and ARGS are the template arguments to use. */
9936 tsubst_enum (tag
, newtag
, args
)
9943 for (e
= TYPE_VALUES (tag
); e
; e
= TREE_CHAIN (e
))
9947 /* Note that in a template enum, the TREE_VALUE is the
9948 CONST_DECL, not the corresponding INTEGER_CST. */
9949 value
= tsubst_expr (DECL_INITIAL (TREE_VALUE (e
)),
9950 args
, /*complain=*/1,
9953 /* Give this enumeration constant the correct access. */
9954 set_current_access_from_decl (TREE_VALUE (e
));
9956 /* Actually build the enumerator itself. */
9957 build_enumerator (TREE_PURPOSE (e
), value
, newtag
);
9960 finish_enum (newtag
);
9963 /* DECL is a FUNCTION_DECL that is a template specialization. Return
9964 its type -- but without substituting the innermost set of template
9965 arguments. So, innermost set of template parameters will appear in
9966 the type. If CONTEXTP is non-NULL, then the partially substituted
9967 DECL_CONTEXT (if any) will also be filled in. Similarly, TPARMSP
9968 will be filled in with the substituted template parameters, if it
9972 get_mostly_instantiated_function_type (decl
, contextp
, tparmsp
)
9977 tree context
= NULL_TREE
;
9984 tmpl
= most_general_template (DECL_TI_TEMPLATE (decl
));
9985 targs
= DECL_TI_ARGS (decl
);
9986 tparms
= DECL_TEMPLATE_PARMS (tmpl
);
9987 parm_depth
= TMPL_PARMS_DEPTH (tparms
);
9989 /* There should be as many levels of arguments as there are levels
9991 my_friendly_assert (parm_depth
== TMPL_ARGS_DEPTH (targs
), 0);
9993 fn_type
= TREE_TYPE (tmpl
);
9994 if (DECL_STATIC_FUNCTION_P (decl
))
9995 context
= DECL_CONTEXT (decl
);
9997 if (parm_depth
== 1)
9998 /* No substitution is necessary. */
10005 /* Replace the innermost level of the TARGS with NULL_TREEs to
10006 let tsubst know not to subsitute for those parameters. */
10007 partial_args
= make_tree_vec (TREE_VEC_LENGTH (targs
));
10008 for (i
= 1; i
< TMPL_ARGS_DEPTH (targs
); ++i
)
10009 SET_TMPL_ARGS_LEVEL (partial_args
, i
,
10010 TMPL_ARGS_LEVEL (targs
, i
));
10011 SET_TMPL_ARGS_LEVEL (partial_args
,
10012 TMPL_ARGS_DEPTH (targs
),
10013 make_tree_vec (DECL_NTPARMS (tmpl
)));
10015 /* Now, do the (partial) substitution to figure out the
10016 appropriate function type. */
10017 fn_type
= tsubst (fn_type
, partial_args
, /*complain=*/1, NULL_TREE
);
10018 if (DECL_STATIC_FUNCTION_P (decl
))
10019 context
= tsubst (context
, partial_args
, /*complain=*/1, NULL_TREE
);
10021 /* Substitute into the template parameters to obtain the real
10022 innermost set of parameters. This step is important if the
10023 innermost set of template parameters contains value
10024 parameters whose types depend on outer template parameters. */
10025 TREE_VEC_LENGTH (partial_args
)--;
10026 tparms
= tsubst_template_parms (tparms
, partial_args
, /*complain=*/1);
10030 *contextp
= context
;
10037 /* Set the DECL_ASSEMBLER_NAME for DECL, which is a FUNCTION_DECL that
10038 is either an instantiation or specialization of a template
10042 set_mangled_name_for_template_decl (decl
)
10045 tree context
= NULL_TREE
;
10052 my_friendly_assert (TREE_CODE (decl
) == FUNCTION_DECL
, 0);
10053 my_friendly_assert (DECL_TEMPLATE_INFO (decl
) != NULL_TREE
, 0);
10055 /* Under the new ABI, we don't need special machinery. */
10058 set_mangled_name_for_decl (decl
);
10062 /* The names of template functions must be mangled so as to indicate
10063 what template is being specialized with what template arguments.
10064 For example, each of the following three functions must get
10065 different mangled names:
10068 template <> void f<7>(int);
10069 template <> void f<8>(int); */
10071 targs
= DECL_TI_ARGS (decl
);
10072 if (uses_template_parms (targs
))
10073 /* This DECL is for a partial instantiation. There's no need to
10074 mangle the name of such an entity. */
10077 /* We now compute the PARMS and RET_TYPE to give to
10078 build_decl_overload_real. The PARMS and RET_TYPE are the
10079 parameter and return types of the template, after all but the
10080 innermost template arguments have been substituted, not the
10081 parameter and return types of the function DECL. For example,
10084 template <class T> T f(T);
10086 both PARMS and RET_TYPE should be `T' even if DECL is `int f(int)'.
10087 A more subtle example is:
10089 template <class T> struct S { template <class U> void f(T, U); }
10091 Here, if DECL is `void S<int>::f(int, double)', PARMS should be
10092 {int, U}. Thus, the args that we want to subsitute into the
10093 return and parameter type for the function are those in TARGS,
10094 with the innermost level omitted. */
10095 fn_type
= get_mostly_instantiated_function_type (decl
, &context
, &tparms
);
10097 /* Now, get the innermost parameters and arguments, and figure out
10098 the parameter and return types. */
10099 tparms
= INNERMOST_TEMPLATE_PARMS (tparms
);
10100 targs
= INNERMOST_TEMPLATE_ARGS (targs
);
10101 ret_type
= TREE_TYPE (fn_type
);
10102 parm_types
= TYPE_ARG_TYPES (fn_type
);
10104 /* For a static member function, we generate a fake `this' pointer,
10105 for the purposes of mangling. This indicates of which class the
10106 function is a member. Because of:
10110 There shall not be a static and a nonstatic member function
10111 with the same name and the same parameter types
10113 we don't have to worry that this will result in a clash with a
10114 non-static member function. */
10115 if (DECL_STATIC_FUNCTION_P (decl
))
10116 parm_types
= hash_tree_chain (build_pointer_type (context
), parm_types
);
10118 /* There should be the same number of template parameters as
10119 template arguments. */
10120 my_friendly_assert (TREE_VEC_LENGTH (tparms
) == TREE_VEC_LENGTH (targs
),
10123 /* Actually set the DECL_ASSEMBLER_NAME. */
10124 DECL_ASSEMBLER_NAME (decl
)
10125 = build_decl_overload_real (decl
, parm_types
, ret_type
,
10127 DECL_FUNCTION_MEMBER_P (decl
)
10128 + DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (decl
));