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 DECL_ARTIFICIAL (decl
) = 1;
351 DECL_INITIAL (decl
) = DECL_INITIAL (parm
);
352 SET_DECL_TEMPLATE_PARM_P (decl
);
358 my_friendly_abort (0);
363 /* Restore the template parameter context for a member template or
364 a friend template defined in a class definition. */
367 maybe_begin_member_template_processing (decl
)
373 if (inline_needs_template_parms (decl
))
375 parms
= DECL_TEMPLATE_PARMS (most_general_template (decl
));
376 levels
= TMPL_PARMS_DEPTH (parms
) - processing_template_decl
;
378 if (DECL_TEMPLATE_SPECIALIZATION (decl
))
381 parms
= TREE_CHAIN (parms
);
384 push_inline_template_parms_recursive (parms
, levels
);
387 /* Remember how many levels of template parameters we pushed so that
388 we can pop them later. */
389 if (!inline_parm_levels
)
390 VARRAY_INT_INIT (inline_parm_levels
, 4, "inline_parm_levels");
391 if (inline_parm_levels_used
== inline_parm_levels
->num_elements
)
392 VARRAY_GROW (inline_parm_levels
, 2 * inline_parm_levels_used
);
393 VARRAY_INT (inline_parm_levels
, inline_parm_levels_used
) = levels
;
394 ++inline_parm_levels_used
;
397 /* Undo the effects of begin_member_template_processing. */
400 maybe_end_member_template_processing ()
404 if (!inline_parm_levels_used
)
407 --inline_parm_levels_used
;
409 i
< VARRAY_INT (inline_parm_levels
, inline_parm_levels_used
);
412 --processing_template_decl
;
413 current_template_parms
= TREE_CHAIN (current_template_parms
);
418 /* Returns non-zero iff T is a member template function. We must be
421 template <class T> class C { void f(); }
423 Here, f is a template function, and a member, but not a member
424 template. This function does not concern itself with the origin of
425 T, only its present state. So if we have
427 template <class T> class C { template <class U> void f(U); }
429 then neither C<int>::f<char> nor C<T>::f<double> is considered
430 to be a member template. But, `template <class U> void
431 C<int>::f(U)' is considered a member template. */
434 is_member_template (t
)
437 if (!DECL_FUNCTION_TEMPLATE_P (t
))
438 /* Anything that isn't a function or a template function is
439 certainly not a member template. */
442 /* A local class can't have member templates. */
443 if (decl_function_context (t
))
446 return (DECL_FUNCTION_MEMBER_P (DECL_TEMPLATE_RESULT (t
))
447 /* If there are more levels of template parameters than
448 there are template classes surrounding the declaration,
449 then we have a member template. */
450 && (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (t
)) >
451 template_class_depth (DECL_CONTEXT (t
))));
455 /* Returns non-zero iff T is a member template class. See
456 is_member_template for a description of what precisely constitutes
457 a member template. */
460 is_member_template_class (t
)
463 if (!DECL_CLASS_TEMPLATE_P (t
))
464 /* Anything that isn't a class template, is certainly not a member
468 if (!DECL_CLASS_SCOPE_P (t
))
469 /* Anything whose context isn't a class type is surely not a
473 /* If there are more levels of template parameters than there are
474 template classes surrounding the declaration, then we have a
476 return (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (t
)) >
477 template_class_depth (DECL_CONTEXT (t
)));
481 /* Return a new template argument vector which contains all of ARGS,
482 but has as its innermost set of arguments the EXTRA_ARGS. */
485 add_to_template_args (args
, extra_args
)
494 extra_depth
= TMPL_ARGS_DEPTH (extra_args
);
495 new_args
= make_tree_vec (TMPL_ARGS_DEPTH (args
) + extra_depth
);
497 for (i
= 1; i
<= TMPL_ARGS_DEPTH (args
); ++i
)
498 SET_TMPL_ARGS_LEVEL (new_args
, i
, TMPL_ARGS_LEVEL (args
, i
));
500 for (j
= 1; j
<= extra_depth
; ++j
, ++i
)
501 SET_TMPL_ARGS_LEVEL (new_args
, i
, TMPL_ARGS_LEVEL (extra_args
, j
));
506 /* Like add_to_template_args, but only the outermost ARGS are added to
507 the EXTRA_ARGS. In particular, all but TMPL_ARGS_DEPTH
508 (EXTRA_ARGS) levels are added. This function is used to combine
509 the template arguments from a partial instantiation with the
510 template arguments used to attain the full instantiation from the
511 partial instantiation. */
514 add_outermost_template_args (args
, extra_args
)
520 /* If there are more levels of EXTRA_ARGS than there are ARGS,
521 something very fishy is going on. */
522 my_friendly_assert (TMPL_ARGS_DEPTH (args
) >= TMPL_ARGS_DEPTH (extra_args
),
525 /* If *all* the new arguments will be the EXTRA_ARGS, just return
527 if (TMPL_ARGS_DEPTH (args
) == TMPL_ARGS_DEPTH (extra_args
))
530 /* For the moment, we make ARGS look like it contains fewer levels. */
531 TREE_VEC_LENGTH (args
) -= TMPL_ARGS_DEPTH (extra_args
);
533 new_args
= add_to_template_args (args
, extra_args
);
535 /* Now, we restore ARGS to its full dimensions. */
536 TREE_VEC_LENGTH (args
) += TMPL_ARGS_DEPTH (extra_args
);
541 /* Return the N levels of innermost template arguments from the ARGS. */
544 get_innermost_template_args (args
, n
)
552 my_friendly_assert (n
>= 0, 20000603);
554 /* If N is 1, just return the innermost set of template arguments. */
556 return TMPL_ARGS_LEVEL (args
, TMPL_ARGS_DEPTH (args
));
558 /* If we're not removing anything, just return the arguments we were
560 extra_levels
= TMPL_ARGS_DEPTH (args
) - n
;
561 my_friendly_assert (extra_levels
>= 0, 20000603);
562 if (extra_levels
== 0)
565 /* Make a new set of arguments, not containing the outer arguments. */
566 new_args
= make_tree_vec (n
);
567 for (i
= 1; i
<= n
; ++i
)
568 SET_TMPL_ARGS_LEVEL (new_args
, i
,
569 TMPL_ARGS_LEVEL (args
, i
+ extra_levels
));
574 /* We've got a template header coming up; push to a new level for storing
578 begin_template_parm_list ()
580 /* We use a non-tag-transparent scope here, which causes pushtag to
581 put tags in this scope, rather than in the enclosing class or
582 namespace scope. This is the right thing, since we want
583 TEMPLATE_DECLS, and not TYPE_DECLS for template classes. For a
584 global template class, push_template_decl handles putting the
585 TEMPLATE_DECL into top-level scope. For a nested template class,
588 template <class T> struct S1 {
589 template <class T> struct S2 {};
592 pushtag contains special code to call pushdecl_with_scope on the
593 TEMPLATE_DECL for S2. */
594 begin_scope (sk_template_parms
);
595 ++processing_template_decl
;
596 ++processing_template_parmlist
;
597 note_template_header (0);
600 /* This routine is called when a specialization is declared. If it is
601 illegal to declare a specialization here, an error is reported. */
604 check_specialization_scope ()
606 tree scope
= current_scope ();
610 An explicit specialization shall be declared in the namespace of
611 which the template is a member, or, for member templates, in the
612 namespace of which the enclosing class or enclosing class
613 template is a member. An explicit specialization of a member
614 function, member class or static data member of a class template
615 shall be declared in the namespace of which the class template
617 if (scope
&& TREE_CODE (scope
) != NAMESPACE_DECL
)
618 cp_error ("explicit specialization in non-namespace scope `%D'",
623 In an explicit specialization declaration for a member of a class
624 template or a member template that appears in namespace scope,
625 the member template and some of its enclosing class templates may
626 remain unspecialized, except that the declaration shall not
627 explicitly specialize a class member template if its enclosing
628 class templates are not explicitly specialized as well. */
629 if (current_template_parms
)
630 cp_error ("enclosing class templates are not explicitly specialized");
633 /* We've just seen template <>. */
636 begin_specialization ()
638 begin_scope (sk_template_spec
);
639 note_template_header (1);
640 check_specialization_scope ();
643 /* Called at then end of processing a declaration 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 DECL_ARTIFICIAL (decl
) = 1;
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 (TREE_CODE (template) != TEMPLATE_DECL
)
3790 cp_error ("non-template type `%T' used as a template", d1
);
3792 cp_error_at ("for template declaration `%D'", in_decl
);
3793 return error_mark_node
;
3796 if (DECL_TEMPLATE_TEMPLATE_PARM_P (template))
3798 /* Create a new TEMPLATE_DECL and TEMPLATE_TEMPLATE_PARM node to store
3799 template arguments */
3804 parmlist
= DECL_INNERMOST_TEMPLATE_PARMS (template);
3806 arglist2
= coerce_template_parms (parmlist
, arglist
, template, 1, 1);
3807 if (arglist2
== error_mark_node
)
3808 return error_mark_node
;
3810 parm
= copy_template_template_parm (TREE_TYPE (template), arglist2
);
3811 TYPE_SIZE (parm
) = 0;
3816 tree template_type
= TREE_TYPE (template);
3819 tree found
= NULL_TREE
;
3822 int is_partial_instantiation
;
3824 gen_tmpl
= most_general_template (template);
3825 parmlist
= DECL_TEMPLATE_PARMS (gen_tmpl
);
3826 parm_depth
= TMPL_PARMS_DEPTH (parmlist
);
3827 arg_depth
= TMPL_ARGS_DEPTH (arglist
);
3829 if (arg_depth
== 1 && parm_depth
> 1)
3831 /* We've been given an incomplete set of template arguments.
3834 template <class T> struct S1 {
3835 template <class U> struct S2 {};
3836 template <class U> struct S2<U*> {};
3839 we will be called with an ARGLIST of `U*', but the
3840 TEMPLATE will be `template <class T> template
3841 <class U> struct S1<T>::S2'. We must fill in the missing
3844 = add_outermost_template_args (TYPE_TI_ARGS (TREE_TYPE (template)),
3846 arg_depth
= TMPL_ARGS_DEPTH (arglist
);
3849 /* Now we should enough arguments. */
3850 my_friendly_assert (parm_depth
== arg_depth
, 0);
3852 /* From here on, we're only interested in the most general
3854 template = gen_tmpl
;
3856 /* Calculate the BOUND_ARGS. These will be the args that are
3857 actually tsubst'd into the definition to create the
3861 /* We have multiple levels of arguments to coerce, at once. */
3863 int saved_depth
= TMPL_ARGS_DEPTH (arglist
);
3865 tree bound_args
= make_tree_vec (parm_depth
);
3867 for (i
= saved_depth
,
3868 t
= DECL_TEMPLATE_PARMS (template);
3869 i
> 0 && t
!= NULL_TREE
;
3870 --i
, t
= TREE_CHAIN (t
))
3872 tree a
= coerce_template_parms (TREE_VALUE (t
),
3873 arglist
, template, 1, 1);
3874 SET_TMPL_ARGS_LEVEL (bound_args
, i
, a
);
3876 /* We temporarily reduce the length of the ARGLIST so
3877 that coerce_template_parms will see only the arguments
3878 corresponding to the template parameters it is
3880 TREE_VEC_LENGTH (arglist
)--;
3883 /* Restore the ARGLIST to its full size. */
3884 TREE_VEC_LENGTH (arglist
) = saved_depth
;
3886 arglist
= bound_args
;
3890 = coerce_template_parms (INNERMOST_TEMPLATE_PARMS (parmlist
),
3891 INNERMOST_TEMPLATE_ARGS (arglist
),
3894 if (arglist
== error_mark_node
)
3895 /* We were unable to bind the arguments. */
3896 return error_mark_node
;
3898 /* In the scope of a template class, explicit references to the
3899 template class refer to the type of the template, not any
3900 instantiation of it. For example, in:
3902 template <class T> class C { void f(C<T>); }
3904 the `C<T>' is just the same as `C'. Outside of the
3905 class, however, such a reference is an instantiation. */
3906 if (comp_template_args (TYPE_TI_ARGS (template_type
),
3909 found
= template_type
;
3911 if (!entering_scope
&& PRIMARY_TEMPLATE_P (template))
3915 /* Note that we use DECL_CONTEXT, rather than
3916 CP_DECL_CONTEXT, so that the termination test is
3917 always just `ctx'. We're not interested in namepace
3919 for (ctx
= current_class_type
;
3921 ctx
= (TYPE_P (ctx
)) ? TYPE_CONTEXT (ctx
) : DECL_CONTEXT (ctx
))
3922 if (same_type_p (ctx
, template_type
))
3926 /* We're not in the scope of the class, so the
3927 TEMPLATE_TYPE is not the type we want after
3935 for (found
= DECL_TEMPLATE_INSTANTIATIONS (template);
3936 found
; found
= TREE_CHAIN (found
))
3937 if (comp_template_args (TREE_PURPOSE (found
), arglist
))
3941 found
= TREE_VALUE (found
);
3947 /* This type is a "partial instantiation" if any of the template
3948 arguments still inolve template parameters. Note that we set
3949 IS_PARTIAL_INSTANTIATION for partial specializations as
3951 is_partial_instantiation
= uses_template_parms (arglist
);
3953 if (!is_partial_instantiation
3954 && !PRIMARY_TEMPLATE_P (template)
3955 && TREE_CODE (CP_DECL_CONTEXT (template)) == NAMESPACE_DECL
)
3957 found
= xref_tag_from_type (TREE_TYPE (template),
3958 DECL_NAME (template),
3963 context
= tsubst (DECL_CONTEXT (template), arglist
,
3964 /*complain=*/0, in_decl
);
3966 context
= global_namespace
;
3968 /* Create the type. */
3969 if (TREE_CODE (template_type
) == ENUMERAL_TYPE
)
3971 if (!is_partial_instantiation
)
3972 t
= start_enum (TYPE_IDENTIFIER (template_type
));
3974 /* We don't want to call start_enum for this type, since
3975 the values for the enumeration constants may involve
3976 template parameters. And, no one should be interested
3977 in the enumeration constants for such a type. */
3978 t
= make_node (ENUMERAL_TYPE
);
3982 t
= make_aggr_type (TREE_CODE (template_type
));
3983 CLASSTYPE_DECLARED_CLASS (t
)
3984 = CLASSTYPE_DECLARED_CLASS (template_type
);
3985 CLASSTYPE_GOT_SEMICOLON (t
) = 1;
3986 SET_CLASSTYPE_IMPLICIT_INSTANTIATION (t
);
3987 TYPE_FOR_JAVA (t
) = TYPE_FOR_JAVA (template_type
);
3989 /* A local class. Make sure the decl gets registered properly. */
3990 if (context
== current_function_decl
)
3991 pushtag (DECL_NAME (template), t
, 0);
3994 /* If we called start_enum or pushtag above, this information
3995 will already be set up. */
3998 TYPE_CONTEXT (t
) = FROB_CONTEXT (context
);
4000 type_decl
= create_implicit_typedef (DECL_NAME (template), t
);
4001 DECL_CONTEXT (type_decl
) = TYPE_CONTEXT (t
);
4002 TYPE_STUB_DECL (t
) = type_decl
;
4003 DECL_SOURCE_FILE (type_decl
)
4004 = DECL_SOURCE_FILE (TYPE_STUB_DECL (template_type
));
4005 DECL_SOURCE_LINE (type_decl
)
4006 = DECL_SOURCE_LINE (TYPE_STUB_DECL (template_type
));
4009 type_decl
= TYPE_NAME (t
);
4011 /* Set up the template information. We have to figure out which
4012 template is the immediate parent if this is a full
4014 if (parm_depth
== 1 || is_partial_instantiation
4015 || !PRIMARY_TEMPLATE_P (template))
4016 /* This case is easy; there are no member templates involved. */
4020 /* This is a full instantiation of a member template. There
4021 should be some partial instantiation of which this is an
4024 for (found
= DECL_TEMPLATE_INSTANTIATIONS (template);
4025 found
; found
= TREE_CHAIN (found
))
4028 tree tmpl
= CLASSTYPE_TI_TEMPLATE (TREE_VALUE (found
));
4030 /* We only want partial instantiations, here, not
4031 specializations or full instantiations. */
4032 if (CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_VALUE (found
))
4033 || !uses_template_parms (TREE_VALUE (found
)))
4036 /* Temporarily reduce by one the number of levels in the
4037 ARGLIST and in FOUND so as to avoid comparing the
4038 last set of arguments. */
4039 TREE_VEC_LENGTH (arglist
)--;
4040 TREE_VEC_LENGTH (TREE_PURPOSE (found
)) --;
4042 /* See if the arguments match. If they do, then TMPL is
4043 the partial instantiation we want. */
4044 success
= comp_template_args (TREE_PURPOSE (found
), arglist
);
4046 /* Restore the argument vectors to their full size. */
4047 TREE_VEC_LENGTH (arglist
)++;
4048 TREE_VEC_LENGTH (TREE_PURPOSE (found
))++;
4058 my_friendly_abort (0);
4061 SET_TYPE_TEMPLATE_INFO (t
,
4062 tree_cons (found
, arglist
, NULL_TREE
));
4063 DECL_TEMPLATE_INSTANTIATIONS (template)
4064 = tree_cons (arglist
, t
,
4065 DECL_TEMPLATE_INSTANTIATIONS (template));
4067 if (TREE_CODE (t
) == ENUMERAL_TYPE
4068 && !is_partial_instantiation
)
4069 /* Now that the type has been registered on the instantiations
4070 list, we set up the enumerators. Because the enumeration
4071 constants may involve the enumeration type itself, we make
4072 sure to register the type first, and then create the
4073 constants. That way, doing tsubst_expr for the enumeration
4074 constants won't result in recursive calls here; we'll find
4075 the instantiation and exit above. */
4076 tsubst_enum (template_type
, t
, arglist
);
4078 /* Reset the name of the type, now that CLASSTYPE_TEMPLATE_INFO
4080 if (TREE_CODE (t
) != ENUMERAL_TYPE
)
4081 DECL_NAME (type_decl
) = classtype_mangled_name (t
);
4082 DECL_ASSEMBLER_NAME (type_decl
) = DECL_NAME (type_decl
);
4083 if (!is_partial_instantiation
)
4086 DECL_ASSEMBLER_NAME (type_decl
) = mangle_decl (type_decl
);
4088 DECL_ASSEMBLER_NAME (type_decl
)
4089 = get_identifier (build_overload_name (t
, 1, 1));
4091 /* For backwards compatibility; code that uses
4092 -fexternal-templates expects looking up a template to
4093 instantiate it. I think DDD still relies on this.
4094 (jason 8/20/1998) */
4095 if (TREE_CODE (t
) != ENUMERAL_TYPE
4096 && flag_external_templates
4097 && CLASSTYPE_INTERFACE_KNOWN (TREE_TYPE (template))
4098 && ! CLASSTYPE_INTERFACE_ONLY (TREE_TYPE (template)))
4099 add_pending_template (t
);
4102 /* If the type makes use of template parameters, the
4103 code that generates debugging information will crash. */
4104 DECL_IGNORED_P (TYPE_STUB_DECL (t
)) = 1;
4116 /* Called from for_each_template_parm via walk_tree. */
4119 for_each_template_parm_r (tp
, walk_subtrees
, d
)
4125 struct pair_fn_data
*pfd
= (struct pair_fn_data
*) d
;
4126 tree_fn_t fn
= pfd
->fn
;
4127 void *data
= pfd
->data
;
4130 && for_each_template_parm (TYPE_CONTEXT (t
), fn
, data
))
4131 return error_mark_node
;
4133 switch (TREE_CODE (t
))
4136 if (TYPE_PTRMEMFUNC_P (t
))
4142 if (!TYPE_TEMPLATE_INFO (t
))
4144 else if (for_each_template_parm (TREE_VALUE (TYPE_TEMPLATE_INFO (t
)),
4146 return error_mark_node
;
4150 /* Since we're not going to walk subtrees, we have to do this
4152 if (for_each_template_parm (TYPE_METHOD_BASETYPE (t
), fn
, data
))
4153 return error_mark_node
;
4156 /* Check the return type. */
4157 if (for_each_template_parm (TREE_TYPE (t
), fn
, data
))
4158 return error_mark_node
;
4160 /* Check the parameter types. Since default arguments are not
4161 instantiated until they are needed, the TYPE_ARG_TYPES may
4162 contain expressions that involve template parameters. But,
4163 no-one should be looking at them yet. And, once they're
4164 instantiated, they don't contain template parameters, so
4165 there's no point in looking at them then, either. */
4169 for (parm
= TYPE_ARG_TYPES (t
); parm
; parm
= TREE_CHAIN (parm
))
4170 if (for_each_template_parm (TREE_VALUE (parm
), fn
, data
))
4171 return error_mark_node
;
4173 /* Since we've already handled the TYPE_ARG_TYPES, we don't
4174 want walk_tree walking into them itself. */
4181 if (DECL_LANG_SPECIFIC (t
) && DECL_TEMPLATE_INFO (t
)
4182 && for_each_template_parm (DECL_TI_ARGS (t
), fn
, data
))
4183 return error_mark_node
;
4188 if (DECL_CONTEXT (t
)
4189 && for_each_template_parm (DECL_CONTEXT (t
), fn
, data
))
4190 return error_mark_node
;
4193 case TEMPLATE_TEMPLATE_PARM
:
4194 /* Record template parameters such as `T' inside `TT<T>'. */
4195 if (TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (t
)
4196 && for_each_template_parm (TYPE_TI_ARGS (t
), fn
, data
))
4197 return error_mark_node
;
4200 case TEMPLATE_TYPE_PARM
:
4201 case TEMPLATE_PARM_INDEX
:
4202 if (fn
&& (*fn
)(t
, data
))
4203 return error_mark_node
;
4205 return error_mark_node
;
4209 /* A template template parameter is encountered */
4210 if (DECL_TEMPLATE_TEMPLATE_PARM_P (t
)
4211 && for_each_template_parm (TREE_TYPE (t
), fn
, data
))
4212 return error_mark_node
;
4214 /* Already substituted template template parameter */
4219 if (!fn
|| for_each_template_parm (TYPENAME_TYPE_FULLNAME (t
), fn
, data
))
4220 return error_mark_node
;
4224 if (TREE_TYPE (t
) && TYPE_PTRMEMFUNC_P (TREE_TYPE (t
))
4225 && for_each_template_parm (TYPE_PTRMEMFUNC_FN_TYPE
4226 (TREE_TYPE (t
)), fn
, data
))
4227 return error_mark_node
;
4232 /* If there's no type, then this thing must be some expression
4233 involving template parameters. */
4234 if (!fn
&& !TREE_TYPE (t
))
4235 return error_mark_node
;
4240 case REINTERPRET_CAST_EXPR
:
4241 case CONST_CAST_EXPR
:
4242 case STATIC_CAST_EXPR
:
4243 case DYNAMIC_CAST_EXPR
:
4248 case PSEUDO_DTOR_EXPR
:
4250 return error_mark_node
;
4257 /* We didn't find any template parameters we liked. */
4261 /* For each TEMPLATE_TYPE_PARM, TEMPLATE_TEMPLATE_PARM, or
4262 TEMPLATE_PARM_INDEX in T, call FN with the parameter and the DATA.
4263 If FN returns non-zero, the iteration is terminated, and
4264 for_each_template_parm returns 1. Otherwise, the iteration
4265 continues. If FN never returns a non-zero value, the value
4266 returned by for_each_template_parm is 0. If FN is NULL, it is
4267 considered to be the function which always returns 1. */
4270 for_each_template_parm (t
, fn
, data
)
4275 struct pair_fn_data pfd
;
4281 /* Walk the tree. */
4282 return walk_tree (&t
, for_each_template_parm_r
, &pfd
) != NULL_TREE
;
4286 uses_template_parms (t
)
4289 return for_each_template_parm (t
, 0, 0);
4292 static int tinst_depth
;
4293 extern int max_tinst_depth
;
4294 #ifdef GATHER_STATISTICS
4297 static int tinst_level_tick
;
4298 static int last_template_error_tick
;
4300 /* Print out all the template instantiations that we are currently
4301 working on. If ERR, we are being called from cp_thing, so do
4302 the right thing for an error message. */
4305 print_template_context (err
)
4308 tree p
= current_tinst_level
;
4310 const char *file
= input_filename
;
4314 if (current_function_decl
!= TINST_DECL (p
)
4315 && current_function_decl
!= NULL_TREE
)
4316 /* We can get here during the processing of some synthesized
4317 method. Then, TINST_DECL (p) will be the function that's causing
4322 if (current_function_decl
== TINST_DECL (p
))
4323 /* Avoid redundancy with the the "In function" line. */;
4325 fprintf (stderr
, "%s: In instantiation of `%s':\n",
4326 file
, decl_as_string (TINST_DECL (p
),
4327 TS_DECL_TYPE
| TS_FUNC_NORETURN
));
4329 line
= TINST_LINE (p
);
4330 file
= TINST_FILE (p
);
4335 for (; p
; p
= TREE_CHAIN (p
))
4337 fprintf (stderr
, "%s:%d: instantiated from `%s'\n", file
, line
,
4338 decl_as_string (TINST_DECL (p
),
4339 TS_DECL_TYPE
| TS_FUNC_NORETURN
));
4340 line
= TINST_LINE (p
);
4341 file
= TINST_FILE (p
);
4343 fprintf (stderr
, "%s:%d: instantiated from here\n", file
, line
);
4346 /* Called from cp_thing to print the template context for an error. */
4349 maybe_print_template_context ()
4351 if (last_template_error_tick
== tinst_level_tick
4352 || current_tinst_level
== 0)
4355 last_template_error_tick
= tinst_level_tick
;
4356 print_template_context (1);
4359 /* We're starting to instantiate D; record the template instantiation context
4360 for diagnostics and to restore it later. */
4363 push_tinst_level (d
)
4368 if (tinst_depth
>= max_tinst_depth
)
4370 /* If the instantiation in question still has unbound template parms,
4371 we don't really care if we can't instantiate it, so just return.
4372 This happens with base instantiation for implicit `typename'. */
4373 if (uses_template_parms (d
))
4376 last_template_error_tick
= tinst_level_tick
;
4377 cp_error ("template instantiation depth exceeds maximum of %d (use -ftemplate-depth-NN to increase the maximum) instantiating `%D'",
4378 max_tinst_depth
, d
);
4380 print_template_context (0);
4385 new = build_expr_wfl (d
, input_filename
, lineno
, 0);
4386 TREE_CHAIN (new) = current_tinst_level
;
4387 current_tinst_level
= new;
4390 #ifdef GATHER_STATISTICS
4391 if (tinst_depth
> depth_reached
)
4392 depth_reached
= tinst_depth
;
4399 /* We're done instantiating this template; return to the instantiation
4405 tree old
= current_tinst_level
;
4407 /* Restore the filename and line number stashed away when we started
4408 this instantiation. */
4409 lineno
= TINST_LINE (old
);
4410 input_filename
= TINST_FILE (old
);
4411 extract_interface_info ();
4413 current_tinst_level
= TREE_CHAIN (old
);
4418 /* We're instantiating a deferred template; restore the template
4419 instantiation context in which the instantiation was requested, which
4420 is one step out from LEVEL. */
4423 reopen_tinst_level (level
)
4429 for (t
= level
; t
; t
= TREE_CHAIN (t
))
4432 current_tinst_level
= level
;
4436 /* Return the outermost template instantiation context, for use with
4437 -falt-external-templates. */
4442 tree p
= current_tinst_level
;
4445 for (; TREE_CHAIN (p
) ; p
= TREE_CHAIN (p
))
4450 /* DECL is a friend FUNCTION_DECL or TEMPLATE_DECL. ARGS is the
4451 vector of template arguments, as for tsubst.
4453 Returns an appropriate tsbust'd friend declaration. */
4456 tsubst_friend_function (decl
, args
)
4462 const char *file
= input_filename
;
4464 lineno
= DECL_SOURCE_LINE (decl
);
4465 input_filename
= DECL_SOURCE_FILE (decl
);
4467 if (TREE_CODE (decl
) == FUNCTION_DECL
4468 && DECL_TEMPLATE_INSTANTIATION (decl
)
4469 && TREE_CODE (DECL_TI_TEMPLATE (decl
)) != TEMPLATE_DECL
)
4470 /* This was a friend declared with an explicit template
4471 argument list, e.g.:
4475 to indicate that f was a template instantiation, not a new
4476 function declaration. Now, we have to figure out what
4477 instantiation of what template. */
4484 = lookup_template_function (tsubst_expr (DECL_TI_TEMPLATE (decl
),
4485 args
, /*complain=*/1,
4487 tsubst (DECL_TI_ARGS (decl
),
4488 args
, /*complain=*/1,
4490 new_friend
= tsubst (decl
, args
, /*complain=*/1, NULL_TREE
);
4491 tmpl
= determine_specialization (template_id
, new_friend
,
4493 /*need_member_template=*/0);
4494 new_friend
= instantiate_template (tmpl
, new_args
);
4498 new_friend
= tsubst (decl
, args
, /*complain=*/1, NULL_TREE
);
4500 /* The NEW_FRIEND will look like an instantiation, to the
4501 compiler, but is not an instantiation from the point of view of
4502 the language. For example, we might have had:
4504 template <class T> struct S {
4505 template <class U> friend void f(T, U);
4508 Then, in S<int>, template <class U> void f(int, U) is not an
4509 instantiation of anything. */
4510 DECL_USE_TEMPLATE (new_friend
) = 0;
4511 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
4513 DECL_USE_TEMPLATE (DECL_TEMPLATE_RESULT (new_friend
)) = 0;
4514 DECL_SAVED_TREE (DECL_TEMPLATE_RESULT (new_friend
))
4515 = DECL_SAVED_TREE (DECL_TEMPLATE_RESULT (decl
));
4518 /* The mangled name for the NEW_FRIEND is incorrect. The call to
4519 tsubst will have resulted in a call to
4520 set_mangled_name_for_template_decl. But, the function is not a
4521 template instantiation and should not be mangled like one.
4522 Therefore, we remangle the function name. We don't have to do
4523 this if the NEW_FRIEND is a template since
4524 set_mangled_name_for_template_decl doesn't do anything if the
4525 function declaration still uses template arguments. */
4526 if (TREE_CODE (new_friend
) != TEMPLATE_DECL
)
4528 set_mangled_name_for_decl (new_friend
);
4529 DECL_RTL (new_friend
) = 0;
4530 make_decl_rtl (new_friend
, NULL_PTR
, 1);
4533 if (DECL_NAMESPACE_SCOPE_P (new_friend
))
4536 tree new_friend_template_info
;
4537 tree new_friend_result_template_info
;
4539 int new_friend_is_defn
;
4541 /* We must save some information from NEW_FRIEND before calling
4542 duplicate decls since that function will free NEW_FRIEND if
4544 new_friend_template_info
= DECL_TEMPLATE_INFO (new_friend
);
4545 if (TREE_CODE (new_friend
) == TEMPLATE_DECL
)
4547 /* This declaration is a `primary' template. */
4548 DECL_PRIMARY_TEMPLATE (new_friend
) = new_friend
;
4551 = DECL_INITIAL (DECL_TEMPLATE_RESULT (new_friend
)) != NULL_TREE
;
4552 new_friend_result_template_info
4553 = DECL_TEMPLATE_INFO (DECL_TEMPLATE_RESULT (new_friend
));
4557 new_friend_is_defn
= DECL_INITIAL (new_friend
) != NULL_TREE
;
4558 new_friend_result_template_info
= NULL_TREE
;
4561 /* Inside pushdecl_namespace_level, we will push into the
4562 current namespace. However, the friend function should go
4563 into the namespace of the template. */
4564 ns
= decl_namespace_context (new_friend
);
4565 push_nested_namespace (ns
);
4566 old_decl
= pushdecl_namespace_level (new_friend
);
4567 pop_nested_namespace (ns
);
4569 if (old_decl
!= new_friend
)
4571 /* This new friend declaration matched an existing
4572 declaration. For example, given:
4574 template <class T> void f(T);
4575 template <class U> class C {
4576 template <class T> friend void f(T) {}
4579 the friend declaration actually provides the definition
4580 of `f', once C has been instantiated for some type. So,
4581 old_decl will be the out-of-class template declaration,
4582 while new_friend is the in-class definition.
4584 But, if `f' was called before this point, the
4585 instantiation of `f' will have DECL_TI_ARGS corresponding
4586 to `T' but not to `U', references to which might appear
4587 in the definition of `f'. Previously, the most general
4588 template for an instantiation of `f' was the out-of-class
4589 version; now it is the in-class version. Therefore, we
4590 run through all specialization of `f', adding to their
4591 DECL_TI_ARGS appropriately. In particular, they need a
4592 new set of outer arguments, corresponding to the
4593 arguments for this class instantiation.
4595 The same situation can arise with something like this:
4598 template <class T> class C {
4602 when `C<int>' is instantiated. Now, `f(int)' is defined
4605 if (!new_friend_is_defn
)
4606 /* On the other hand, if the in-class declaration does
4607 *not* provide a definition, then we don't want to alter
4608 existing definitions. We can just leave everything
4613 /* Overwrite whatever template info was there before, if
4614 any, with the new template information pertaining to
4616 DECL_TEMPLATE_INFO (old_decl
) = new_friend_template_info
;
4618 if (TREE_CODE (old_decl
) != TEMPLATE_DECL
)
4619 /* duplicate_decls will take care of this case. */
4624 tree new_friend_args
;
4626 DECL_TEMPLATE_INFO (DECL_TEMPLATE_RESULT (old_decl
))
4627 = new_friend_result_template_info
;
4629 new_friend_args
= TI_ARGS (new_friend_template_info
);
4630 for (t
= DECL_TEMPLATE_SPECIALIZATIONS (old_decl
);
4634 tree spec
= TREE_VALUE (t
);
4637 = add_outermost_template_args (new_friend_args
,
4638 DECL_TI_ARGS (spec
));
4641 /* Now, since specializations are always supposed to
4642 hang off of the most general template, we must move
4644 t
= most_general_template (old_decl
);
4647 DECL_TEMPLATE_SPECIALIZATIONS (t
)
4648 = chainon (DECL_TEMPLATE_SPECIALIZATIONS (t
),
4649 DECL_TEMPLATE_SPECIALIZATIONS (old_decl
));
4650 DECL_TEMPLATE_SPECIALIZATIONS (old_decl
) = NULL_TREE
;
4655 /* The information from NEW_FRIEND has been merged into OLD_DECL
4656 by duplicate_decls. */
4657 new_friend
= old_decl
;
4660 else if (COMPLETE_TYPE_P (DECL_CONTEXT (new_friend
)))
4662 /* Check to see that the declaration is really present, and,
4663 possibly obtain an improved declaration. */
4664 tree fn
= check_classfn (DECL_CONTEXT (new_friend
),
4673 input_filename
= file
;
4677 /* FRIEND_TMPL is a friend TEMPLATE_DECL. ARGS is the vector of
4678 template arguments, as for tsubst.
4680 Returns an appropriate tsbust'd friend type or error_mark_node on
4684 tsubst_friend_class (friend_tmpl
, args
)
4691 /* First, we look for a class template. */
4692 tmpl
= lookup_name (DECL_NAME (friend_tmpl
), /*prefer_type=*/0);
4694 /* But, if we don't find one, it might be because we're in a
4695 situation like this:
4703 Here, in the scope of (say) S<int>, `S' is bound to a TYPE_DECL
4704 for `S<int>', not the TEMPLATE_DECL. */
4705 if (!tmpl
|| !DECL_CLASS_TEMPLATE_P (tmpl
))
4707 tmpl
= lookup_name (DECL_NAME (friend_tmpl
), /*prefer_type=*/1);
4708 tmpl
= maybe_get_template_decl_from_type_decl (tmpl
);
4711 if (tmpl
&& DECL_CLASS_TEMPLATE_P (tmpl
))
4713 /* The friend template has already been declared. Just
4714 check to see that the declarations match, and install any new
4715 default parameters. We must tsubst the default parameters,
4716 of course. We only need the innermost template parameters
4717 because that is all that redeclare_class_template will look
4720 = tsubst_template_parms (DECL_TEMPLATE_PARMS (friend_tmpl
),
4721 args
, /*complain=*/1);
4723 return error_mark_node
;
4724 redeclare_class_template (TREE_TYPE (tmpl
), parms
);
4725 friend_type
= TREE_TYPE (tmpl
);
4729 /* The friend template has not already been declared. In this
4730 case, the instantiation of the template class will cause the
4731 injection of this template into the global scope. */
4732 tmpl
= tsubst (friend_tmpl
, args
, /*complain=*/1, NULL_TREE
);
4734 /* The new TMPL is not an instantiation of anything, so we
4735 forget its origins. We don't reset CLASSTYPE_TI_TEMPLATE for
4736 the new type because that is supposed to be the corresponding
4737 template decl, i.e., TMPL. */
4738 DECL_USE_TEMPLATE (tmpl
) = 0;
4739 DECL_TEMPLATE_INFO (tmpl
) = NULL_TREE
;
4740 CLASSTYPE_USE_TEMPLATE (TREE_TYPE (tmpl
)) = 0;
4742 /* Inject this template into the global scope. */
4743 friend_type
= TREE_TYPE (pushdecl_top_level (tmpl
));
4750 instantiate_class_template (type
)
4753 tree
template, args
, pattern
, t
;
4756 if (type
== error_mark_node
)
4757 return error_mark_node
;
4759 if (TYPE_BEING_DEFINED (type
) || COMPLETE_TYPE_P (type
))
4762 /* Figure out which template is being instantiated. */
4763 template = most_general_template (CLASSTYPE_TI_TEMPLATE (type
));
4764 my_friendly_assert (TREE_CODE (template) == TEMPLATE_DECL
, 279);
4766 /* Figure out which arguments are being used to do the
4768 args
= CLASSTYPE_TI_ARGS (type
);
4769 PARTIAL_INSTANTIATION_P (type
) = uses_template_parms (args
);
4771 if (pedantic
&& PARTIAL_INSTANTIATION_P (type
))
4772 /* If this is a partial instantiation, then we can't instantiate
4773 the type; there's no telling whether or not one of the
4774 template parameters might eventually be instantiated to some
4775 value that results in a specialization being used. For
4787 Now, the `S<U>' in `f<int>' is the specialization, not an
4788 instantiation of the original template. */
4791 /* Determine what specialization of the original template to
4793 if (PARTIAL_INSTANTIATION_P (type
))
4794 /* There's no telling which specialization is appropriate at this
4795 point. Since all peeking at the innards of this partial
4796 instantiation are extensions (like the "implicit typename"
4797 extension, which allows users to omit the keyword `typename' on
4798 names that are declared as types in template base classes), we
4799 are free to do what we please.
4801 Trying to figure out which partial instantiation to use can
4802 cause a crash. (Some of the template arguments don't even have
4803 types.) So, we just use the most general version. */
4807 t
= most_specialized_class (template, args
);
4809 if (t
== error_mark_node
)
4811 const char *str
= "candidates are:";
4812 cp_error ("ambiguous class template instantiation for `%#T'", type
);
4813 for (t
= DECL_TEMPLATE_SPECIALIZATIONS (template); t
;
4816 if (get_class_bindings (TREE_VALUE (t
), TREE_PURPOSE (t
),
4819 cp_error_at ("%s %+#T", str
, TREE_TYPE (t
));
4823 TYPE_BEING_DEFINED (type
) = 1;
4824 return error_mark_node
;
4829 pattern
= TREE_TYPE (t
);
4831 pattern
= TREE_TYPE (template);
4833 /* If the template we're instantiating is incomplete, then clearly
4834 there's nothing we can do. */
4835 if (!COMPLETE_TYPE_P (pattern
))
4838 /* If this is a partial instantiation, don't tsubst anything. We will
4839 only use this type for implicit typename, so the actual contents don't
4840 matter. All that matters is whether a particular name is a type. */
4841 if (PARTIAL_INSTANTIATION_P (type
))
4843 /* The fields set here must be kept in sync with those cleared
4844 in begin_class_definition. */
4845 TYPE_BINFO_BASETYPES (type
) = TYPE_BINFO_BASETYPES (pattern
);
4846 TYPE_FIELDS (type
) = TYPE_FIELDS (pattern
);
4847 TYPE_METHODS (type
) = TYPE_METHODS (pattern
);
4848 CLASSTYPE_TAGS (type
) = CLASSTYPE_TAGS (pattern
);
4849 CLASSTYPE_VBASECLASSES (type
) = CLASSTYPE_VBASECLASSES (pattern
);
4851 /* Pretend that the type is complete, so that we will look
4852 inside it during name lookup and such. */
4853 TYPE_SIZE (type
) = bitsize_zero_node
;
4857 /* If we've recursively instantiated too many templates, stop. */
4858 if (! push_tinst_level (type
))
4861 /* Now we're really doing the instantiation. Mark the type as in
4862 the process of being defined. */
4863 TYPE_BEING_DEFINED (type
) = 1;
4865 maybe_push_to_top_level (uses_template_parms (type
));
4869 /* This TYPE is actually a instantiation of of a partial
4870 specialization. We replace the innermost set of ARGS with
4871 the arguments appropriate for substitution. For example,
4874 template <class T> struct S {};
4875 template <class T> struct S<T*> {};
4877 and supposing that we are instantiating S<int*>, ARGS will
4878 present be {int*} but we need {int}. */
4880 = get_class_bindings (TREE_VALUE (t
), TREE_PURPOSE (t
),
4883 /* If there were multiple levels in ARGS, replacing the
4884 innermost level would alter CLASSTYPE_TI_ARGS, which we don't
4885 want, so we make a copy first. */
4886 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (args
))
4888 args
= copy_node (args
);
4889 SET_TMPL_ARGS_LEVEL (args
, TMPL_ARGS_DEPTH (args
), inner_args
);
4895 if (flag_external_templates
)
4897 if (flag_alt_external_templates
)
4899 CLASSTYPE_INTERFACE_ONLY (type
) = interface_only
;
4900 SET_CLASSTYPE_INTERFACE_UNKNOWN_X (type
, interface_unknown
);
4901 CLASSTYPE_VTABLE_NEEDS_WRITING (type
)
4902 = (! CLASSTYPE_INTERFACE_ONLY (type
)
4903 && CLASSTYPE_INTERFACE_KNOWN (type
));
4907 CLASSTYPE_INTERFACE_ONLY (type
) = CLASSTYPE_INTERFACE_ONLY (pattern
);
4908 SET_CLASSTYPE_INTERFACE_UNKNOWN_X
4909 (type
, CLASSTYPE_INTERFACE_UNKNOWN (pattern
));
4910 CLASSTYPE_VTABLE_NEEDS_WRITING (type
)
4911 = (! CLASSTYPE_INTERFACE_ONLY (type
)
4912 && CLASSTYPE_INTERFACE_KNOWN (type
));
4917 SET_CLASSTYPE_INTERFACE_UNKNOWN (type
);
4918 CLASSTYPE_VTABLE_NEEDS_WRITING (type
) = 1;
4921 TYPE_HAS_CONSTRUCTOR (type
) = TYPE_HAS_CONSTRUCTOR (pattern
);
4922 TYPE_HAS_DESTRUCTOR (type
) = TYPE_HAS_DESTRUCTOR (pattern
);
4923 TYPE_OVERLOADS_CALL_EXPR (type
) = TYPE_OVERLOADS_CALL_EXPR (pattern
);
4924 TYPE_OVERLOADS_ARRAY_REF (type
) = TYPE_OVERLOADS_ARRAY_REF (pattern
);
4925 TYPE_OVERLOADS_ARROW (type
) = TYPE_OVERLOADS_ARROW (pattern
);
4926 TYPE_HAS_NEW_OPERATOR (type
) = TYPE_HAS_NEW_OPERATOR (pattern
);
4927 TYPE_HAS_ARRAY_NEW_OPERATOR (type
) = TYPE_HAS_ARRAY_NEW_OPERATOR (pattern
);
4928 TYPE_GETS_DELETE (type
) = TYPE_GETS_DELETE (pattern
);
4929 TYPE_VEC_DELETE_TAKES_SIZE (type
) = TYPE_VEC_DELETE_TAKES_SIZE (pattern
);
4930 TYPE_HAS_ASSIGN_REF (type
) = TYPE_HAS_ASSIGN_REF (pattern
);
4931 TYPE_HAS_CONST_ASSIGN_REF (type
) = TYPE_HAS_CONST_ASSIGN_REF (pattern
);
4932 TYPE_HAS_ABSTRACT_ASSIGN_REF (type
) = TYPE_HAS_ABSTRACT_ASSIGN_REF (pattern
);
4933 TYPE_HAS_INIT_REF (type
) = TYPE_HAS_INIT_REF (pattern
);
4934 TYPE_HAS_CONST_INIT_REF (type
) = TYPE_HAS_CONST_INIT_REF (pattern
);
4935 TYPE_HAS_DEFAULT_CONSTRUCTOR (type
) = TYPE_HAS_DEFAULT_CONSTRUCTOR (pattern
);
4936 TYPE_HAS_CONVERSION (type
) = TYPE_HAS_CONVERSION (pattern
);
4937 TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (type
)
4938 = TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (pattern
);
4939 TYPE_USES_MULTIPLE_INHERITANCE (type
)
4940 = TYPE_USES_MULTIPLE_INHERITANCE (pattern
);
4941 TYPE_USES_VIRTUAL_BASECLASSES (type
)
4942 = TYPE_USES_VIRTUAL_BASECLASSES (pattern
);
4943 TYPE_PACKED (type
) = TYPE_PACKED (pattern
);
4944 TYPE_ALIGN (type
) = TYPE_ALIGN (pattern
);
4945 TYPE_USER_ALIGN (type
) = TYPE_USER_ALIGN (pattern
);
4946 TYPE_FOR_JAVA (type
) = TYPE_FOR_JAVA (pattern
); /* For libjava's JArray<T> */
4947 if (ANON_AGGR_TYPE_P (pattern
))
4948 SET_ANON_AGGR_TYPE_P (type
);
4950 if (TYPE_BINFO_BASETYPES (pattern
))
4952 tree base_list
= NULL_TREE
;
4953 tree pbases
= TYPE_BINFO_BASETYPES (pattern
);
4956 /* Substitute into each of the bases to determine the actual
4958 for (i
= 0; i
< TREE_VEC_LENGTH (pbases
); ++i
)
4964 pbase
= TREE_VEC_ELT (pbases
, i
);
4966 /* Substitue to figure out the base class. */
4967 base
= tsubst (BINFO_TYPE (pbase
), args
,
4968 /*complain=*/1, NULL_TREE
);
4969 if (base
== error_mark_node
)
4972 /* Calculate the correct access node. */
4973 if (TREE_VIA_VIRTUAL (pbase
))
4975 if (TREE_VIA_PUBLIC (pbase
))
4976 access
= access_public_virtual_node
;
4977 else if (TREE_VIA_PROTECTED (pbase
))
4978 access
= access_protected_virtual_node
;
4980 access
= access_private_virtual_node
;
4984 if (TREE_VIA_PUBLIC (pbase
))
4985 access
= access_public_node
;
4986 else if (TREE_VIA_PROTECTED (pbase
))
4987 access
= access_protected_node
;
4989 access
= access_private_node
;
4992 base_list
= tree_cons (access
, base
, base_list
);
4995 /* The list is now in reverse order; correct that. */
4996 base_list
= nreverse (base_list
);
4998 /* Now call xref_basetypes to set up all the base-class
5000 xref_basetypes (TREE_CODE (pattern
) == RECORD_TYPE
5001 ? (CLASSTYPE_DECLARED_CLASS (pattern
)
5002 ? class_type_node
: record_type_node
)
5004 DECL_NAME (TYPE_NAME (pattern
)),
5009 /* Now that our base classes are set up, enter the scope of the
5010 class, so that name lookups into base classes, etc. will work
5011 corectly. This is precisely analagous to what we do in
5012 begin_class_definition when defining an ordinary non-template
5014 pushclass (type
, 1);
5016 for (t
= CLASSTYPE_TAGS (pattern
); t
; t
= TREE_CHAIN (t
))
5018 tree tag
= TREE_VALUE (t
);
5019 tree name
= TYPE_IDENTIFIER (tag
);
5022 newtag
= tsubst (tag
, args
, /*complain=*/1, NULL_TREE
);
5023 if (TREE_CODE (newtag
) != ENUMERAL_TYPE
)
5025 if (TYPE_LANG_SPECIFIC (tag
) && CLASSTYPE_IS_TEMPLATE (tag
))
5026 /* Unfortunately, lookup_template_class sets
5027 CLASSTYPE_IMPLICIT_INSTANTIATION for a partial
5028 instantiation (i.e., for the type of a member template
5029 class nested within a template class.) This behavior is
5030 required for maybe_process_partial_specialization to work
5031 correctly, but is not accurate in this case; the TAG is not
5032 an instantiation of anything. (The corresponding
5033 TEMPLATE_DECL is an instantiation, but the TYPE is not.) */
5034 CLASSTYPE_USE_TEMPLATE (newtag
) = 0;
5036 /* Now, we call pushtag to put this NEWTAG into the scope of
5037 TYPE. We first set up the IDENTIFIER_TYPE_VALUE to avoid
5038 pushtag calling push_template_decl. We don't have to do
5039 this for enums because it will already have been done in
5042 SET_IDENTIFIER_TYPE_VALUE (name
, newtag
);
5043 pushtag (name
, newtag
, /*globalize=*/0);
5047 /* Don't replace enum constants here. */
5048 for (t
= TYPE_FIELDS (pattern
); t
; t
= TREE_CHAIN (t
))
5049 if (TREE_CODE (t
) != CONST_DECL
)
5053 /* The the file and line for this declaration, to assist in
5054 error message reporting. Since we called push_tinst_level
5055 above, we don't need to restore these. */
5056 lineno
= DECL_SOURCE_LINE (t
);
5057 input_filename
= DECL_SOURCE_FILE (t
);
5059 r
= tsubst (t
, args
, /*complain=*/1, NULL_TREE
);
5060 if (TREE_CODE (r
) == VAR_DECL
)
5064 if (DECL_DEFINED_IN_CLASS_P (r
))
5065 init
= tsubst_expr (DECL_INITIAL (t
), args
,
5066 /*complain=*/1, NULL_TREE
);
5070 finish_static_data_member_decl (r
, init
,
5071 /*asmspec_tree=*/NULL_TREE
,
5074 if (DECL_DEFINED_IN_CLASS_P (r
))
5075 check_static_variable_definition (r
, TREE_TYPE (r
));
5078 /* R will have a TREE_CHAIN if and only if it has already been
5079 processed by finish_member_declaration. This can happen
5080 if, for example, it is a TYPE_DECL for a class-scoped
5081 ENUMERAL_TYPE; such a thing will already have been added to
5082 the field list by tsubst_enum above. */
5083 if (!TREE_CHAIN (r
))
5085 set_current_access_from_decl (r
);
5086 finish_member_declaration (r
);
5090 /* Set up the list (TYPE_METHODS) and vector (CLASSTYPE_METHOD_VEC)
5091 for this instantiation. */
5092 for (t
= TYPE_METHODS (pattern
); t
; t
= TREE_CHAIN (t
))
5094 tree r
= tsubst (t
, args
, /*complain=*/1, NULL_TREE
);
5095 set_current_access_from_decl (r
);
5096 finish_member_declaration (r
);
5099 /* Construct the DECL_FRIENDLIST for the new class type. */
5100 typedecl
= TYPE_MAIN_DECL (type
);
5101 for (t
= DECL_FRIENDLIST (TYPE_MAIN_DECL (pattern
));
5107 for (friends
= TREE_VALUE (t
);
5108 friends
!= NULL_TREE
;
5109 friends
= TREE_CHAIN (friends
))
5110 if (TREE_PURPOSE (friends
) == error_mark_node
)
5112 tsubst_friend_function (TREE_VALUE (friends
),
5115 my_friendly_abort (20000216);
5118 for (t
= CLASSTYPE_FRIEND_CLASSES (pattern
);
5122 tree friend_type
= TREE_VALUE (t
);
5123 tree new_friend_type
;
5125 if (TREE_CODE (friend_type
) == TEMPLATE_DECL
)
5126 new_friend_type
= tsubst_friend_class (friend_type
, args
);
5127 else if (uses_template_parms (friend_type
))
5128 new_friend_type
= tsubst (friend_type
, args
, /*complain=*/1,
5132 tree ns
= decl_namespace_context (TYPE_MAIN_DECL (friend_type
));
5134 /* The call to xref_tag_from_type does injection for friend
5136 push_nested_namespace (ns
);
5138 xref_tag_from_type (friend_type
, NULL_TREE
, 1);
5139 pop_nested_namespace (ns
);
5142 if (TREE_CODE (friend_type
) == TEMPLATE_DECL
)
5143 /* Trick make_friend_class into realizing that the friend
5144 we're adding is a template, not an ordinary class. It's
5145 important that we use make_friend_class since it will
5146 perform some error-checking and output cross-reference
5148 ++processing_template_decl
;
5150 if (new_friend_type
!= error_mark_node
)
5151 make_friend_class (type
, new_friend_type
);
5153 if (TREE_CODE (friend_type
) == TEMPLATE_DECL
)
5154 --processing_template_decl
;
5157 for (t
= TYPE_FIELDS (type
); t
; t
= TREE_CHAIN (t
))
5158 if (TREE_CODE (t
) == FIELD_DECL
)
5160 TREE_TYPE (t
) = complete_type (TREE_TYPE (t
));
5161 require_complete_type (t
);
5164 /* Set the file and line number information to whatever is given for
5165 the class itself. This puts error messages involving generated
5166 implicit functions at a predictable point, and the same point
5167 that would be used for non-template classes. */
5168 lineno
= DECL_SOURCE_LINE (typedecl
);
5169 input_filename
= DECL_SOURCE_FILE (typedecl
);
5171 unreverse_member_declarations (type
);
5172 finish_struct_1 (type
);
5173 CLASSTYPE_GOT_SEMICOLON (type
) = 1;
5175 /* Clear this now so repo_template_used is happy. */
5176 TYPE_BEING_DEFINED (type
) = 0;
5177 repo_template_used (type
);
5179 /* Now that the class is complete, instantiate default arguments for
5180 any member functions. We don't do this earlier because the
5181 default arguments may reference members of the class. */
5182 if (!PRIMARY_TEMPLATE_P (template))
5183 for (t
= TYPE_METHODS (type
); t
; t
= TREE_CHAIN (t
))
5184 if (TREE_CODE (t
) == FUNCTION_DECL
5185 /* Implicitly generated member functions will not have tmplate
5186 information; they are not instantiations, but instead are
5187 created "fresh" for each instantiation. */
5188 && DECL_TEMPLATE_INFO (t
))
5189 tsubst_default_arguments (t
);
5192 pop_from_top_level ();
5202 if (t1
== NULL_TREE
)
5203 return t2
== NULL_TREE
;
5204 if (t2
== NULL_TREE
)
5206 /* Don't care if one declares its arg const and the other doesn't -- the
5207 main variant of the arg type is all that matters. */
5208 if (TYPE_MAIN_VARIANT (TREE_VALUE (t1
))
5209 != TYPE_MAIN_VARIANT (TREE_VALUE (t2
)))
5211 return list_eq (TREE_CHAIN (t1
), TREE_CHAIN (t2
));
5214 /* If arg is a non-type template parameter that does not depend on template
5215 arguments, fold it like we weren't in the body of a template. */
5218 maybe_fold_nontype_arg (arg
)
5221 /* If we're not in a template, ARG is already as simple as it's going to
5222 get, and trying to reprocess the trees will break. */
5223 if (! processing_template_decl
)
5226 if (!TYPE_P (arg
) && !uses_template_parms (arg
))
5228 /* Sometimes, one of the args was an expression involving a
5229 template constant parameter, like N - 1. Now that we've
5230 tsubst'd, we might have something like 2 - 1. This will
5231 confuse lookup_template_class, so we do constant folding
5232 here. We have to unset processing_template_decl, to
5233 fool build_expr_from_tree() into building an actual
5236 int saved_processing_template_decl
= processing_template_decl
;
5237 processing_template_decl
= 0;
5238 arg
= fold (build_expr_from_tree (arg
));
5239 processing_template_decl
= saved_processing_template_decl
;
5244 /* Substitute ARGS into the vector of template arguments T. */
5247 tsubst_template_arg_vector (t
, args
, complain
)
5252 int len
= TREE_VEC_LENGTH (t
), need_new
= 0, i
;
5253 tree
*elts
= (tree
*) alloca (len
* sizeof (tree
));
5255 bzero ((char *) elts
, len
* sizeof (tree
));
5257 for (i
= 0; i
< len
; i
++)
5259 if (TREE_VEC_ELT (t
, i
) != NULL_TREE
5260 && TREE_CODE (TREE_VEC_ELT (t
, i
)) == TREE_VEC
)
5261 elts
[i
] = tsubst_template_arg_vector (TREE_VEC_ELT (t
, i
),
5264 elts
[i
] = maybe_fold_nontype_arg
5265 (tsubst_expr (TREE_VEC_ELT (t
, i
), args
, complain
,
5268 if (elts
[i
] == error_mark_node
)
5269 return error_mark_node
;
5271 if (elts
[i
] != TREE_VEC_ELT (t
, i
))
5278 t
= make_tree_vec (len
);
5279 for (i
= 0; i
< len
; i
++)
5280 TREE_VEC_ELT (t
, i
) = elts
[i
];
5285 /* Return the result of substituting ARGS into the template parameters
5286 given by PARMS. If there are m levels of ARGS and m + n levels of
5287 PARMS, then the result will contain n levels of PARMS. For
5288 example, if PARMS is `template <class T> template <class U>
5289 template <T*, U, class V>' and ARGS is {{int}, {double}} then the
5290 result will be `template <int*, double, class V>'. */
5293 tsubst_template_parms (parms
, args
, complain
)
5301 for (new_parms
= &r
;
5302 TMPL_PARMS_DEPTH (parms
) > TMPL_ARGS_DEPTH (args
);
5303 new_parms
= &(TREE_CHAIN (*new_parms
)),
5304 parms
= TREE_CHAIN (parms
))
5307 make_tree_vec (TREE_VEC_LENGTH (TREE_VALUE (parms
)));
5310 for (i
= 0; i
< TREE_VEC_LENGTH (new_vec
); ++i
)
5312 tree default_value
=
5313 TREE_PURPOSE (TREE_VEC_ELT (TREE_VALUE (parms
), i
));
5315 TREE_VALUE (TREE_VEC_ELT (TREE_VALUE (parms
), i
));
5317 TREE_VEC_ELT (new_vec
, i
)
5318 = build_tree_list (tsubst (default_value
, args
, complain
,
5320 tsubst (parm_decl
, args
, complain
,
5325 tree_cons (build_int_2 (0, (TMPL_PARMS_DEPTH (parms
)
5326 - TMPL_ARGS_DEPTH (args
))),
5327 new_vec
, NULL_TREE
);
5333 /* Substitute the ARGS into the indicated aggregate (or enumeration)
5334 type T. If T is not an aggregate or enumeration type, it is
5335 handled as if by tsubst. IN_DECL is as for tsubst. If
5336 ENTERING_SCOPE is non-zero, T is the context for a template which
5337 we are presently tsubst'ing. Return the subsituted value. */
5340 tsubst_aggr_type (t
, args
, complain
, in_decl
, entering_scope
)
5350 switch (TREE_CODE (t
))
5353 if (TYPE_PTRMEMFUNC_P (t
))
5355 tree r
= build_ptrmemfunc_type
5356 (tsubst (TYPE_PTRMEMFUNC_FN_TYPE (t
), args
, complain
, in_decl
));
5357 return cp_build_qualified_type_real (r
, TYPE_QUALS (t
),
5361 /* else fall through */
5364 if (TYPE_TEMPLATE_INFO (t
))
5370 /* First, determine the context for the type we are looking
5372 if (TYPE_CONTEXT (t
) != NULL_TREE
)
5373 context
= tsubst_aggr_type (TYPE_CONTEXT (t
), args
,
5375 in_decl
, /*entering_scope=*/1);
5377 context
= NULL_TREE
;
5379 /* Then, figure out what arguments are appropriate for the
5380 type we are trying to find. For example, given:
5382 template <class T> struct S;
5383 template <class T, class U> void f(T, U) { S<U> su; }
5385 and supposing that we are instantiating f<int, double>,
5386 then our ARGS will be {int, double}, but, when looking up
5387 S we only want {double}. */
5388 argvec
= tsubst_template_arg_vector (TYPE_TI_ARGS (t
), args
,
5390 if (argvec
== error_mark_node
)
5391 return error_mark_node
;
5393 r
= lookup_template_class (t
, argvec
, in_decl
, context
,
5396 return cp_build_qualified_type_real (r
, TYPE_QUALS (t
),
5400 /* This is not a template type, so there's nothing to do. */
5404 return tsubst (t
, args
, complain
, in_decl
);
5408 /* Substitute into the default argument ARG (a default argument for
5409 FN), which has the indicated TYPE. */
5412 tsubst_default_argument (fn
, type
, arg
)
5417 /* This default argument came from a template. Instantiate the
5418 default argument here, not in tsubst. In the case of
5427 we must be careful to do name lookup in the scope of S<T>,
5428 rather than in the current class. */
5429 if (DECL_CLASS_SCOPE_P (fn
))
5430 pushclass (DECL_CONTEXT (fn
), 2);
5432 arg
= tsubst_expr (arg
, DECL_TI_ARGS (fn
), /*complain=*/1, NULL_TREE
);
5434 if (DECL_CLASS_SCOPE_P (fn
))
5437 /* Make sure the default argument is reasonable. */
5438 arg
= check_default_argument (type
, arg
);
5443 /* Substitute into all the default arguments for FN. */
5446 tsubst_default_arguments (fn
)
5452 tmpl_args
= DECL_TI_ARGS (fn
);
5454 /* If this function is not yet instantiated, we certainly don't need
5455 its default arguments. */
5456 if (uses_template_parms (tmpl_args
))
5459 for (arg
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
5461 arg
= TREE_CHAIN (arg
))
5462 if (TREE_PURPOSE (arg
))
5463 TREE_PURPOSE (arg
) = tsubst_default_argument (fn
,
5465 TREE_PURPOSE (arg
));
5468 /* Substitute the ARGS into the T, which is a _DECL. TYPE is the
5469 (already computed) substitution of ARGS into TREE_TYPE (T), if
5470 appropriate. Return the result of the substitution. IN_DECL is as
5474 tsubst_decl (t
, args
, type
, in_decl
)
5481 const char *saved_filename
;
5484 /* Set the filename and linenumber to improve error-reporting. */
5485 saved_lineno
= lineno
;
5486 saved_filename
= input_filename
;
5487 lineno
= DECL_SOURCE_LINE (t
);
5488 input_filename
= DECL_SOURCE_FILE (t
);
5490 switch (TREE_CODE (t
))
5494 /* We can get here when processing a member template function
5495 of a template class. */
5496 tree decl
= DECL_TEMPLATE_RESULT (t
);
5498 int is_template_template_parm
= DECL_TEMPLATE_TEMPLATE_PARM_P (t
);
5500 if (!is_template_template_parm
)
5502 /* We might already have an instance of this template.
5503 The ARGS are for the surrounding class type, so the
5504 full args contain the tsubst'd args for the context,
5505 plus the innermost args from the template decl. */
5506 tree tmpl_args
= DECL_CLASS_TEMPLATE_P (t
)
5507 ? CLASSTYPE_TI_ARGS (TREE_TYPE (t
))
5508 : DECL_TI_ARGS (DECL_TEMPLATE_RESULT (t
));
5511 full_args
= tsubst_template_arg_vector (tmpl_args
, args
,
5514 /* tsubst_template_arg_vector doesn't copy the vector if
5515 nothing changed. But, *something* should have
5517 my_friendly_assert (full_args
!= tmpl_args
, 0);
5519 spec
= retrieve_specialization (t
, full_args
);
5520 if (spec
!= NULL_TREE
)
5527 /* Make a new template decl. It will be similar to the
5528 original, but will record the current template arguments.
5529 We also create a new function declaration, which is just
5530 like the old one, but points to this new template, rather
5531 than the old one. */
5533 my_friendly_assert (DECL_LANG_SPECIFIC (r
) != 0, 0);
5534 TREE_CHAIN (r
) = NULL_TREE
;
5536 if (is_template_template_parm
)
5538 tree new_decl
= tsubst (decl
, args
, /*complain=*/1, in_decl
);
5539 DECL_TEMPLATE_RESULT (r
) = new_decl
;
5540 TREE_TYPE (r
) = TREE_TYPE (new_decl
);
5545 = tsubst_aggr_type (DECL_CONTEXT (t
), args
,
5546 /*complain=*/1, in_decl
,
5547 /*entering_scope=*/1);
5548 DECL_VIRTUAL_CONTEXT (r
)
5549 = tsubst_aggr_type (DECL_VIRTUAL_CONTEXT (t
), args
,
5550 /*complain=*/1, in_decl
,
5551 /*entering_scope=*/1);
5552 DECL_TEMPLATE_INFO (r
) = build_tree_list (t
, args
);
5554 if (TREE_CODE (decl
) == TYPE_DECL
)
5556 tree new_type
= tsubst (TREE_TYPE (t
), args
,
5557 /*complain=*/1, in_decl
);
5558 TREE_TYPE (r
) = new_type
;
5559 CLASSTYPE_TI_TEMPLATE (new_type
) = r
;
5560 DECL_TEMPLATE_RESULT (r
) = TYPE_MAIN_DECL (new_type
);
5561 DECL_TI_ARGS (r
) = CLASSTYPE_TI_ARGS (new_type
);
5565 tree new_decl
= tsubst (decl
, args
, /*complain=*/1, in_decl
);
5567 DECL_TEMPLATE_RESULT (r
) = new_decl
;
5568 DECL_TI_TEMPLATE (new_decl
) = r
;
5569 TREE_TYPE (r
) = TREE_TYPE (new_decl
);
5570 DECL_TI_ARGS (r
) = DECL_TI_ARGS (new_decl
);
5573 SET_DECL_IMPLICIT_INSTANTIATION (r
);
5574 DECL_TEMPLATE_INSTANTIATIONS (r
) = NULL_TREE
;
5575 DECL_TEMPLATE_SPECIALIZATIONS (r
) = NULL_TREE
;
5577 /* The template parameters for this new template are all the
5578 template parameters for the old template, except the
5579 outermost level of parameters. */
5580 DECL_TEMPLATE_PARMS (r
)
5581 = tsubst_template_parms (DECL_TEMPLATE_PARMS (t
), args
,
5584 if (PRIMARY_TEMPLATE_P (t
))
5585 DECL_PRIMARY_TEMPLATE (r
) = r
;
5587 /* We don't partially instantiate partial specializations. */
5588 if (TREE_CODE (decl
) == TYPE_DECL
)
5591 /* Record this partial instantiation. */
5592 register_specialization (r
, t
,
5593 DECL_TI_ARGS (DECL_TEMPLATE_RESULT (r
)));
5601 tree argvec
= NULL_TREE
;
5608 /* Nobody should be tsubst'ing into non-template functions. */
5609 my_friendly_assert (DECL_TEMPLATE_INFO (t
) != NULL_TREE
, 0);
5611 if (TREE_CODE (DECL_TI_TEMPLATE (t
)) == TEMPLATE_DECL
)
5615 /* Calculate the most general template of which R is a
5616 specialization, and the complete set of arguments used to
5618 gen_tmpl
= most_general_template (DECL_TI_TEMPLATE (t
));
5620 = tsubst_template_arg_vector (DECL_TI_ARGS
5621 (DECL_TEMPLATE_RESULT (gen_tmpl
)),
5622 args
, /*complain=*/1);
5624 /* Check to see if we already have this specialization. */
5625 spec
= retrieve_specialization (gen_tmpl
, argvec
);
5633 /* We can see more levels of arguments than parameters if
5634 there was a specialization of a member template, like
5637 template <class T> struct S { template <class U> void f(); }
5638 template <> template <class U> void S<int>::f(U);
5640 Here, we'll be subtituting into the specialization,
5641 because that's where we can find the code we actually
5642 want to generate, but we'll have enough arguments for
5643 the most general template.
5645 We also deal with the peculiar case:
5647 template <class T> struct S {
5648 template <class U> friend void f();
5650 template <class U> void f() {}
5652 template void f<double>();
5654 Here, the ARGS for the instantiation of will be {int,
5655 double}. But, we only need as many ARGS as there are
5656 levels of template parameters in CODE_PATTERN. We are
5657 careful not to get fooled into reducing the ARGS in
5660 template <class T> struct S { template <class U> void f(U); }
5661 template <class T> template <> void S<T>::f(int) {}
5663 which we can spot because the pattern will be a
5664 specialization in this case. */
5665 args_depth
= TMPL_ARGS_DEPTH (args
);
5667 TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (DECL_TI_TEMPLATE (t
)));
5668 if (args_depth
> parms_depth
5669 && !DECL_TEMPLATE_SPECIALIZATION (t
))
5670 args
= get_innermost_template_args (args
, parms_depth
);
5674 /* This special case arises when we have something like this:
5676 template <class T> struct S {
5677 friend void f<int>(int, double);
5680 Here, the DECL_TI_TEMPLATE for the friend declaration
5681 will be a LOOKUP_EXPR or an IDENTIFIER_NODE. We are
5682 being called from tsubst_friend_function, and we want
5683 only to create a new decl (R) with appropriate types so
5684 that we can call determine_specialization. */
5685 my_friendly_assert ((TREE_CODE (DECL_TI_TEMPLATE (t
))
5687 || (TREE_CODE (DECL_TI_TEMPLATE (t
))
5688 == IDENTIFIER_NODE
), 0);
5689 gen_tmpl
= NULL_TREE
;
5692 if (DECL_CLASS_SCOPE_P (t
))
5694 if (DECL_NAME (t
) == constructor_name (DECL_CONTEXT (t
)))
5698 ctx
= tsubst_aggr_type (DECL_CONTEXT (t
), args
,
5700 /*entering_scope=*/1);
5705 ctx
= DECL_CONTEXT (t
);
5707 type
= tsubst (type
, args
, /*complain=*/1, in_decl
);
5708 if (type
== error_mark_node
)
5709 return error_mark_node
;
5711 /* We do NOT check for matching decls pushed separately at this
5712 point, as they may not represent instantiations of this
5713 template, and in any case are considered separate under the
5714 discrete model. Instead, see add_maybe_template. */
5716 DECL_USE_TEMPLATE (r
) = 0;
5717 TREE_TYPE (r
) = type
;
5719 DECL_CONTEXT (r
) = ctx
;
5720 DECL_VIRTUAL_CONTEXT (r
)
5721 = tsubst_aggr_type (DECL_VIRTUAL_CONTEXT (t
), args
,
5723 /*entering_scope=*/1);
5725 if (member
&& DECL_CONV_FN_P (r
))
5727 /* Type-conversion operator. Reconstruct the name, in
5728 case it's the name of one of the template's parameters. */
5730 DECL_NAME (r
) = mangle_conv_op_name_for_type (TREE_TYPE (type
));
5732 DECL_NAME (r
) = build_typename_overload (TREE_TYPE (type
));
5735 DECL_ARGUMENTS (r
) = tsubst (DECL_ARGUMENTS (t
), args
,
5737 DECL_TEMPLATE_RESULT (r
) = NULL_TREE
;
5739 TREE_STATIC (r
) = 0;
5740 TREE_PUBLIC (r
) = TREE_PUBLIC (t
);
5741 DECL_EXTERNAL (r
) = 1;
5742 DECL_INTERFACE_KNOWN (r
) = 0;
5743 DECL_DEFER_OUTPUT (r
) = 0;
5744 TREE_CHAIN (r
) = NULL_TREE
;
5745 DECL_PENDING_INLINE_INFO (r
) = 0;
5746 DECL_PENDING_INLINE_P (r
) = 0;
5747 DECL_SAVED_TREE (r
) = NULL_TREE
;
5749 if (DECL_CLONED_FUNCTION (r
))
5751 DECL_CLONED_FUNCTION (r
) = tsubst (DECL_CLONED_FUNCTION (t
),
5752 args
, /*complain=*/1, t
);
5753 TREE_CHAIN (r
) = TREE_CHAIN (DECL_CLONED_FUNCTION (r
));
5754 TREE_CHAIN (DECL_CLONED_FUNCTION (r
)) = r
;
5757 /* Set up the DECL_TEMPLATE_INFO for R and compute its mangled
5758 name. There's no need to do this in the special friend
5759 case mentioned above where GEN_TMPL is NULL. */
5762 DECL_TEMPLATE_INFO (r
)
5763 = tree_cons (gen_tmpl
, argvec
, NULL_TREE
);
5764 SET_DECL_IMPLICIT_INSTANTIATION (r
);
5765 register_specialization (r
, gen_tmpl
, argvec
);
5767 /* Set the mangled name for R. */
5768 if (DECL_DESTRUCTOR_P (t
))
5771 set_mangled_name_for_decl (r
);
5773 DECL_ASSEMBLER_NAME (r
) = build_destructor_name (ctx
);
5777 /* Instantiations of template functions must be mangled
5778 specially, in order to conform to 14.5.5.1
5779 [temp.over.link]. */
5780 tree tmpl
= DECL_TI_TEMPLATE (t
);
5782 /* TMPL will be NULL if this is a specialization of a
5783 member function of a template class. */
5784 if (name_mangling_version
< 1
5785 || tmpl
== NULL_TREE
5786 || (member
&& !is_member_template (tmpl
)
5787 && !DECL_TEMPLATE_INFO (tmpl
)))
5788 set_mangled_name_for_decl (r
);
5790 set_mangled_name_for_template_decl (r
);
5794 make_decl_rtl (r
, NULL_PTR
, 1);
5796 /* Like grokfndecl. If we don't do this, pushdecl will
5797 mess up our TREE_CHAIN because it doesn't find a
5798 previous decl. Sigh. */
5800 && ! uses_template_parms (r
)
5801 && (IDENTIFIER_GLOBAL_VALUE (DECL_ASSEMBLER_NAME (r
))
5803 SET_IDENTIFIER_GLOBAL_VALUE (DECL_ASSEMBLER_NAME (r
), r
);
5805 /* We're not supposed to instantiate default arguments
5806 until they are called, for a template. But, for a
5809 template <class T> void f ()
5810 { extern void g(int i = T()); }
5812 we should do the substitution when the template is
5813 instantiated. We handle the member function case in
5814 instantiate_class_template since the default arguments
5815 might refer to other members of the class. */
5817 && !PRIMARY_TEMPLATE_P (gen_tmpl
)
5818 && !uses_template_parms (argvec
))
5819 tsubst_default_arguments (r
);
5822 /* Copy the list of befriending classes. */
5823 for (friends
= &DECL_BEFRIENDING_CLASSES (r
);
5825 friends
= &TREE_CHAIN (*friends
))
5827 *friends
= copy_node (*friends
);
5828 TREE_VALUE (*friends
) = tsubst (TREE_VALUE (*friends
),
5829 args
, /*complain=*/1,
5833 if (DECL_CONSTRUCTOR_P (r
) || DECL_DESTRUCTOR_P (r
))
5835 maybe_retrofit_in_chrg (r
);
5836 if (DECL_CONSTRUCTOR_P (r
))
5837 grok_ctor_properties (ctx
, r
);
5839 else if (IDENTIFIER_OPNAME_P (DECL_NAME (r
)))
5840 grok_op_properties (r
, DECL_VIRTUAL_P (r
), DECL_FRIEND_P (r
));
5847 TREE_TYPE (r
) = type
;
5848 c_apply_type_quals_to_decl (CP_TYPE_QUALS (type
), r
);
5850 if (TREE_CODE (DECL_INITIAL (r
)) != TEMPLATE_PARM_INDEX
)
5851 DECL_INITIAL (r
) = TREE_TYPE (r
);
5853 DECL_INITIAL (r
) = tsubst (DECL_INITIAL (r
), args
,
5854 /*complain=*/1, in_decl
);
5856 DECL_CONTEXT (r
) = NULL_TREE
;
5857 if (PROMOTE_PROTOTYPES
5858 && (TREE_CODE (type
) == INTEGER_TYPE
5859 || TREE_CODE (type
) == ENUMERAL_TYPE
)
5860 && TYPE_PRECISION (type
) < TYPE_PRECISION (integer_type_node
))
5861 DECL_ARG_TYPE (r
) = integer_type_node
;
5863 TREE_CHAIN (r
) = tsubst (TREE_CHAIN (t
), args
,
5864 /*complain=*/1, TREE_CHAIN (t
));
5871 TREE_TYPE (r
) = type
;
5872 c_apply_type_quals_to_decl (CP_TYPE_QUALS (type
), r
);
5874 /* We don't have to set DECL_CONTEXT here; it is set by
5875 finish_member_declaration. */
5876 DECL_INITIAL (r
) = tsubst_expr (DECL_INITIAL (t
), args
,
5877 /*complain=*/1, in_decl
);
5878 TREE_CHAIN (r
) = NULL_TREE
;
5879 if (TREE_CODE (type
) == VOID_TYPE
)
5880 cp_error_at ("instantiation of `%D' as type void", r
);
5888 = tsubst_copy (DECL_INITIAL (t
), args
, /*complain=*/1, in_decl
);
5889 TREE_CHAIN (r
) = NULL_TREE
;
5894 if (TREE_CODE (type
) == TEMPLATE_TEMPLATE_PARM
5895 || t
== TYPE_MAIN_DECL (TREE_TYPE (t
)))
5897 /* If this is the canonical decl, we don't have to mess with
5898 instantiations, and often we can't (for typename, template
5899 type parms and such). Note that TYPE_NAME is not correct for
5900 the above test if we've copied the type for a typedef. */
5901 r
= TYPE_NAME (type
);
5909 tree argvec
= NULL_TREE
;
5910 tree gen_tmpl
= NULL_TREE
;
5912 tree tmpl
= NULL_TREE
;
5916 /* Assume this is a non-local variable. */
5919 if (TYPE_P (CP_DECL_CONTEXT (t
)))
5920 ctx
= tsubst_aggr_type (DECL_CONTEXT (t
), args
,
5922 in_decl
, /*entering_scope=*/1);
5925 /* Subsequent calls to pushdecl will fill this in. */
5927 if (!DECL_NAMESPACE_SCOPE_P (t
))
5931 /* Check to see if we already have this specialization. */
5934 tmpl
= DECL_TI_TEMPLATE (t
);
5935 gen_tmpl
= most_general_template (tmpl
);
5936 argvec
= tsubst (DECL_TI_ARGS (t
), args
, /*complain=*/1, in_decl
);
5937 spec
= retrieve_specialization (gen_tmpl
, argvec
);
5940 spec
= retrieve_local_specialization (t
);
5949 TREE_TYPE (r
) = type
;
5950 c_apply_type_quals_to_decl (CP_TYPE_QUALS (type
), r
);
5951 DECL_CONTEXT (r
) = ctx
;
5953 /* Don't try to expand the initializer until someone tries to use
5954 this variable; otherwise we run into circular dependencies. */
5955 DECL_INITIAL (r
) = NULL_TREE
;
5957 DECL_SIZE (r
) = DECL_SIZE_UNIT (r
) = 0;
5959 /* For __PRETTY_FUNCTION__ we have to adjust the initializer. */
5960 if (DECL_PRETTY_FUNCTION_P (r
))
5962 DECL_INITIAL (r
) = tsubst (DECL_INITIAL (t
),
5966 TREE_TYPE (r
) = TREE_TYPE (DECL_INITIAL (r
));
5969 /* Even if the original location is out of scope, the newly
5970 substituted one is not. */
5971 if (TREE_CODE (r
) == VAR_DECL
)
5972 DECL_DEAD_FOR_LOCAL (r
) = 0;
5976 /* A static data member declaration is always marked
5977 external when it is declared in-class, even if an
5978 initializer is present. We mimic the non-template
5980 DECL_EXTERNAL (r
) = 1;
5982 register_specialization (r
, gen_tmpl
, argvec
);
5983 DECL_TEMPLATE_INFO (r
) = tree_cons (tmpl
, argvec
, NULL_TREE
);
5984 SET_DECL_IMPLICIT_INSTANTIATION (r
);
5987 register_local_specialization (r
, t
);
5989 TREE_CHAIN (r
) = NULL_TREE
;
5990 if (TREE_CODE (r
) == VAR_DECL
&& TREE_CODE (type
) == VOID_TYPE
)
5991 cp_error_at ("instantiation of `%D' as type void", r
);
5996 my_friendly_abort (0);
5999 /* Restore the file and line information. */
6000 lineno
= saved_lineno
;
6001 input_filename
= saved_filename
;
6006 /* Substitue into the ARG_TYPES of a function type. */
6009 tsubst_arg_types (arg_types
, args
, complain
, in_decl
)
6015 tree remaining_arg_types
;
6018 if (!arg_types
|| arg_types
== void_list_node
)
6021 remaining_arg_types
= tsubst_arg_types (TREE_CHAIN (arg_types
),
6022 args
, complain
, in_decl
);
6023 if (remaining_arg_types
== error_mark_node
)
6024 return error_mark_node
;
6026 type
= tsubst (TREE_VALUE (arg_types
), args
, complain
, in_decl
);
6027 if (type
== error_mark_node
)
6028 return error_mark_node
;
6030 /* Do array-to-pointer, function-to-pointer conversion, and ignore
6031 top-level qualifiers as required. */
6032 type
= TYPE_MAIN_VARIANT (type_decays_to (type
));
6034 /* Note that we do not substitute into default arguments here. The
6035 standard mandates that they be instantiated only when needed,
6036 which is done in build_over_call. */
6037 return hash_tree_cons (TREE_PURPOSE (arg_types
), type
,
6038 remaining_arg_types
);
6042 /* Substitute into a FUNCTION_TYPE or METHOD_TYPE. This routine does
6043 *not* handle the exception-specification for FNTYPE, because the
6044 initial substitution of explicitly provided template parameters
6045 during argument deduction forbids substitution into the
6046 exception-specification:
6050 All references in the function type of the function template to the
6051 corresponding template parameters are replaced by the specified tem-
6052 plate argument values. If a substitution in a template parameter or
6053 in the function type of the function template results in an invalid
6054 type, type deduction fails. [Note: The equivalent substitution in
6055 exception specifications is done only when the function is instanti-
6056 ated, at which point a program is ill-formed if the substitution
6057 results in an invalid type.] */
6060 tsubst_function_type (t
, args
, complain
, in_decl
)
6070 /* The TYPE_CONTEXT is not used for function/method types. */
6071 my_friendly_assert (TYPE_CONTEXT (t
) == NULL_TREE
, 0);
6073 /* Substitue the return type. */
6074 return_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
6075 if (return_type
== error_mark_node
)
6076 return error_mark_node
;
6078 /* Substitue the argument types. */
6079 arg_types
= tsubst_arg_types (TYPE_ARG_TYPES (t
), args
,
6081 if (arg_types
== error_mark_node
)
6082 return error_mark_node
;
6084 /* Construct a new type node and return it. */
6085 if (TREE_CODE (t
) == FUNCTION_TYPE
)
6086 fntype
= build_function_type (return_type
, arg_types
);
6089 tree r
= TREE_TYPE (TREE_VALUE (arg_types
));
6090 if (! IS_AGGR_TYPE (r
))
6094 Type deduction may fail for any of the following
6097 -- Attempting to create "pointer to member of T" when T
6098 is not a class type. */
6100 cp_error ("creating pointer to member function of non-class type `%T'",
6102 return error_mark_node
;
6105 fntype
= build_cplus_method_type (r
, return_type
, TREE_CHAIN
6108 fntype
= build_qualified_type (fntype
, TYPE_QUALS (t
));
6109 fntype
= build_type_attribute_variant (fntype
, TYPE_ATTRIBUTES (t
));
6114 /* Substitute into the PARMS of a call-declarator. */
6117 tsubst_call_declarator_parms (parms
, args
, complain
, in_decl
)
6127 if (!parms
|| parms
== void_list_node
)
6130 new_parms
= tsubst_call_declarator_parms (TREE_CHAIN (parms
),
6131 args
, complain
, in_decl
);
6133 /* Figure out the type of this parameter. */
6134 type
= tsubst (TREE_VALUE (parms
), args
, complain
, in_decl
);
6136 /* Figure out the default argument as well. Note that we use
6137 tsubst_expr since the default argument is really an expression. */
6138 defarg
= tsubst_expr (TREE_PURPOSE (parms
), args
, complain
, in_decl
);
6140 /* Chain this parameter on to the front of those we have already
6141 processed. We don't use hash_tree_cons because that function
6142 doesn't check TREE_PARMLIST. */
6143 new_parms
= tree_cons (defarg
, type
, new_parms
);
6145 /* And note that these are parameters. */
6146 TREE_PARMLIST (new_parms
) = 1;
6151 /* Take the tree structure T and replace template parameters used
6152 therein with the argument vector ARGS. IN_DECL is an associated
6153 decl for diagnostics. If an error occurs, returns ERROR_MARK_NODE.
6154 An appropriate error message is issued only if COMPLAIN is
6155 non-zero. Note that we must be relatively non-tolerant of
6156 extensions here, in order to preserve conformance; if we allow
6157 substitutions that should not be allowed, we may allow argument
6158 deductions that should not succeed, and therefore report ambiguous
6159 overload situations where there are none. In theory, we could
6160 allow the substitution, but indicate that it should have failed,
6161 and allow our caller to make sure that the right thing happens, but
6162 we don't try to do this yet.
6164 This function is used for dealing with types, decls and the like;
6165 for expressions, use tsubst_expr or tsubst_copy. */
6168 tsubst (t
, args
, complain
, in_decl
)
6175 if (t
== NULL_TREE
|| t
== error_mark_node
6176 || t
== integer_type_node
6177 || t
== void_type_node
6178 || t
== char_type_node
6179 || TREE_CODE (t
) == NAMESPACE_DECL
)
6182 if (TREE_CODE (t
) == IDENTIFIER_NODE
)
6183 type
= IDENTIFIER_TYPE_VALUE (t
);
6185 type
= TREE_TYPE (t
);
6186 if (type
== unknown_type_node
)
6187 my_friendly_abort (42);
6189 if (type
&& TREE_CODE (t
) != FUNCTION_DECL
6190 && TREE_CODE (t
) != TYPENAME_TYPE
6191 && TREE_CODE (t
) != TEMPLATE_DECL
6192 && TREE_CODE (t
) != IDENTIFIER_NODE
6193 && TREE_CODE (t
) != FUNCTION_TYPE
6194 && TREE_CODE (t
) != METHOD_TYPE
)
6195 type
= tsubst (type
, args
, complain
, in_decl
);
6196 if (type
== error_mark_node
)
6197 return error_mark_node
;
6200 return tsubst_decl (t
, args
, type
, in_decl
);
6202 switch (TREE_CODE (t
))
6207 return tsubst_aggr_type (t
, args
, complain
, in_decl
,
6208 /*entering_scope=*/0);
6211 case IDENTIFIER_NODE
:
6223 if (t
== integer_type_node
)
6226 if (TREE_CODE (TYPE_MIN_VALUE (t
)) == INTEGER_CST
6227 && TREE_CODE (TYPE_MAX_VALUE (t
)) == INTEGER_CST
)
6231 tree max
, omax
= TREE_OPERAND (TYPE_MAX_VALUE (t
), 0);
6233 max
= tsubst_expr (omax
, args
, complain
, in_decl
);
6234 if (max
== error_mark_node
)
6235 return error_mark_node
;
6237 /* See if we can reduce this expression to something simpler. */
6238 max
= maybe_fold_nontype_arg (max
);
6239 if (!processing_template_decl
)
6240 max
= decl_constant_value (max
);
6242 if (processing_template_decl
6243 /* When providing explicit arguments to a template
6244 function, but leaving some arguments for subsequent
6245 deduction, MAX may be template-dependent even if we're
6246 not PROCESSING_TEMPLATE_DECL. We still need to check for
6247 template parms, though; MAX won't be an INTEGER_CST for
6248 dynamic arrays, either. */
6249 || (TREE_CODE (max
) != INTEGER_CST
6250 && uses_template_parms (max
)))
6252 tree itype
= make_node (INTEGER_TYPE
);
6253 TYPE_MIN_VALUE (itype
) = size_zero_node
;
6254 TYPE_MAX_VALUE (itype
) = build_min (MINUS_EXPR
, sizetype
, max
,
6259 if (integer_zerop (omax
))
6261 /* Still allow an explicit array of size zero. */
6263 pedwarn ("creating array with size zero");
6265 else if (integer_zerop (max
)
6266 || (TREE_CODE (max
) == INTEGER_CST
6267 && INT_CST_LT (max
, integer_zero_node
)))
6271 Type deduction may fail for any of the following
6274 Attempting to create an array with a size that is
6275 zero or negative. */
6277 cp_error ("creating array with size zero (`%E')", max
);
6279 return error_mark_node
;
6282 return compute_array_index_type (NULL_TREE
, max
);
6285 case TEMPLATE_TYPE_PARM
:
6286 case TEMPLATE_TEMPLATE_PARM
:
6287 case TEMPLATE_PARM_INDEX
:
6295 if (TREE_CODE (t
) == TEMPLATE_TYPE_PARM
6296 || TREE_CODE (t
) == TEMPLATE_TEMPLATE_PARM
)
6298 idx
= TEMPLATE_TYPE_IDX (t
);
6299 level
= TEMPLATE_TYPE_LEVEL (t
);
6303 idx
= TEMPLATE_PARM_IDX (t
);
6304 level
= TEMPLATE_PARM_LEVEL (t
);
6307 if (TREE_VEC_LENGTH (args
) > 0)
6309 tree arg
= NULL_TREE
;
6311 levels
= TMPL_ARGS_DEPTH (args
);
6312 if (level
<= levels
)
6313 arg
= TMPL_ARG (args
, level
, idx
);
6315 if (arg
== error_mark_node
)
6316 return error_mark_node
;
6317 else if (arg
!= NULL_TREE
)
6319 if (TREE_CODE (t
) == TEMPLATE_TYPE_PARM
)
6321 my_friendly_assert (TYPE_P (arg
), 0);
6322 return cp_build_qualified_type_real
6323 (arg
, CP_TYPE_QUALS (arg
) | CP_TYPE_QUALS (t
),
6326 else if (TREE_CODE (t
) == TEMPLATE_TEMPLATE_PARM
)
6328 if (TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (t
))
6330 /* We are processing a type constructed from
6331 a template template parameter */
6332 tree argvec
= tsubst (TYPE_TI_ARGS (t
),
6333 args
, complain
, in_decl
);
6334 if (argvec
== error_mark_node
)
6335 return error_mark_node
;
6337 /* We can get a TEMPLATE_TEMPLATE_PARM here when
6338 we are resolving nested-types in the signature of
6339 a member function templates.
6340 Otherwise ARG is a TEMPLATE_DECL and is the real
6341 template to be instantiated. */
6342 if (TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
)
6343 arg
= TYPE_NAME (arg
);
6345 r
= lookup_template_class (arg
,
6348 /*entering_scope=*/0);
6349 return cp_build_qualified_type_real (r
,
6354 /* We are processing a template argument list. */
6362 my_friendly_abort (981018);
6365 /* This can happen during the attempted tsubst'ing in
6366 unify. This means that we don't yet have any information
6367 about the template parameter in question. */
6370 /* If we get here, we must have been looking at a parm for a
6371 more deeply nested template. Make a new version of this
6372 template parameter, but with a lower level. */
6373 switch (TREE_CODE (t
))
6375 case TEMPLATE_TYPE_PARM
:
6376 case TEMPLATE_TEMPLATE_PARM
:
6377 if (CP_TYPE_QUALS (t
))
6379 r
= tsubst (TYPE_MAIN_VARIANT (t
), args
, complain
, in_decl
);
6380 r
= cp_build_qualified_type_real (r
, CP_TYPE_QUALS (t
),
6386 TEMPLATE_TYPE_PARM_INDEX (r
)
6387 = reduce_template_parm_level (TEMPLATE_TYPE_PARM_INDEX (t
),
6389 TYPE_STUB_DECL (r
) = TYPE_NAME (r
) = TEMPLATE_TYPE_DECL (r
);
6390 TYPE_MAIN_VARIANT (r
) = r
;
6391 TYPE_POINTER_TO (r
) = NULL_TREE
;
6392 TYPE_REFERENCE_TO (r
) = NULL_TREE
;
6394 if (TREE_CODE (t
) == TEMPLATE_TEMPLATE_PARM
6395 && TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (t
))
6397 tree argvec
= tsubst (TYPE_TI_ARGS (t
), args
,
6399 if (argvec
== error_mark_node
)
6400 return error_mark_node
;
6402 TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (r
)
6403 = tree_cons (TYPE_TI_TEMPLATE (t
), argvec
, NULL_TREE
);
6408 case TEMPLATE_PARM_INDEX
:
6409 r
= reduce_template_parm_level (t
, type
, levels
);
6413 my_friendly_abort (0);
6421 tree purpose
, value
, chain
, result
;
6423 if (t
== void_list_node
)
6426 purpose
= TREE_PURPOSE (t
);
6429 purpose
= tsubst (purpose
, args
, complain
, in_decl
);
6430 if (purpose
== error_mark_node
)
6431 return error_mark_node
;
6433 value
= TREE_VALUE (t
);
6436 value
= tsubst (value
, args
, complain
, in_decl
);
6437 if (value
== error_mark_node
)
6438 return error_mark_node
;
6440 chain
= TREE_CHAIN (t
);
6441 if (chain
&& chain
!= void_type_node
)
6443 chain
= tsubst (chain
, args
, complain
, in_decl
);
6444 if (chain
== error_mark_node
)
6445 return error_mark_node
;
6447 if (purpose
== TREE_PURPOSE (t
)
6448 && value
== TREE_VALUE (t
)
6449 && chain
== TREE_CHAIN (t
))
6451 result
= hash_tree_cons (purpose
, value
, chain
);
6452 TREE_PARMLIST (result
) = TREE_PARMLIST (t
);
6456 if (type
!= NULL_TREE
)
6458 /* A binfo node. We always need to make a copy, of the node
6459 itself and of its BINFO_BASETYPES. */
6463 /* Make sure type isn't a typedef copy. */
6464 type
= BINFO_TYPE (TYPE_BINFO (type
));
6466 TREE_TYPE (t
) = complete_type (type
);
6467 if (IS_AGGR_TYPE (type
))
6469 BINFO_VTABLE (t
) = TYPE_BINFO_VTABLE (type
);
6470 BINFO_VIRTUALS (t
) = TYPE_BINFO_VIRTUALS (type
);
6471 if (TYPE_BINFO_BASETYPES (type
) != NULL_TREE
)
6472 BINFO_BASETYPES (t
) = copy_node (TYPE_BINFO_BASETYPES (type
));
6477 /* Otherwise, a vector of template arguments. */
6478 return tsubst_template_arg_vector (t
, args
, complain
);
6481 case REFERENCE_TYPE
:
6483 enum tree_code code
;
6485 if (type
== TREE_TYPE (t
))
6488 code
= TREE_CODE (t
);
6493 Type deduction may fail for any of the following
6496 -- Attempting to create a pointer to reference type.
6497 -- Attempting to create a reference to a reference type or
6498 a reference to void. */
6499 if (TREE_CODE (type
) == REFERENCE_TYPE
6500 || (code
== REFERENCE_TYPE
&& TREE_CODE (type
) == VOID_TYPE
))
6502 static int last_line
= 0;
6503 static const char* last_file
= 0;
6505 /* We keep track of the last time we issued this error
6506 message to avoid spewing a ton of messages during a
6507 single bad template instantiation. */
6508 if (complain
&& (last_line
!= lineno
||
6509 last_file
!= input_filename
))
6511 if (TREE_CODE (type
) == VOID_TYPE
)
6512 cp_error ("forming reference to void");
6514 cp_error ("forming %s to reference type `%T'",
6515 (code
== POINTER_TYPE
) ? "pointer" : "reference",
6518 last_file
= input_filename
;
6521 return error_mark_node
;
6523 else if (code
== POINTER_TYPE
)
6524 r
= build_pointer_type (type
);
6526 r
= build_reference_type (type
);
6527 r
= cp_build_qualified_type_real (r
, TYPE_QUALS (t
), complain
);
6529 if (r
!= error_mark_node
)
6530 /* Will this ever be needed for TYPE_..._TO values? */
6537 r
= tsubst (TYPE_OFFSET_BASETYPE (t
), args
, complain
, in_decl
);
6538 if (r
== error_mark_node
|| !IS_AGGR_TYPE (r
))
6542 Type deduction may fail for any of the following
6545 -- Attempting to create "pointer to member of T" when T
6546 is not a class type. */
6548 cp_error ("creating pointer to member of non-class type `%T'",
6550 return error_mark_node
;
6552 return build_offset_type (r
, type
);
6560 fntype
= tsubst_function_type (t
, args
, complain
, in_decl
);
6561 if (fntype
== error_mark_node
)
6562 return error_mark_node
;
6564 /* Substitue the exception specification. */
6565 raises
= TYPE_RAISES_EXCEPTIONS (t
);
6568 tree list
= NULL_TREE
;
6570 if (! TREE_VALUE (raises
))
6573 for (; raises
!= NULL_TREE
; raises
= TREE_CHAIN (raises
))
6575 tree spec
= TREE_VALUE (raises
);
6577 spec
= tsubst (spec
, args
, complain
, in_decl
);
6578 if (spec
== error_mark_node
)
6580 list
= add_exception_specifier (list
, spec
, complain
);
6582 fntype
= build_exception_variant (fntype
, list
);
6588 tree domain
= tsubst (TYPE_DOMAIN (t
), args
, complain
, in_decl
);
6589 if (domain
== error_mark_node
)
6590 return error_mark_node
;
6592 /* As an optimization, we avoid regenerating the array type if
6593 it will obviously be the same as T. */
6594 if (type
== TREE_TYPE (t
) && domain
== TYPE_DOMAIN (t
))
6597 /* These checks should match the ones in grokdeclarator.
6601 The deduction may fail for any of the following reasons:
6603 -- Attempting to create an array with an element type that
6604 is void, a function type, or a reference type. */
6605 if (TREE_CODE (type
) == VOID_TYPE
6606 || TREE_CODE (type
) == FUNCTION_TYPE
6607 || TREE_CODE (type
) == REFERENCE_TYPE
)
6610 cp_error ("creating array of `%T'", type
);
6611 return error_mark_node
;
6614 r
= build_cplus_array_type (type
, domain
);
6621 tree e1
= tsubst (TREE_OPERAND (t
, 0), args
, complain
,
6623 tree e2
= tsubst (TREE_OPERAND (t
, 1), args
, complain
,
6626 if (e1
== error_mark_node
|| e2
== error_mark_node
)
6627 return error_mark_node
;
6629 return fold (build (TREE_CODE (t
), TREE_TYPE (t
), e1
, e2
));
6635 tree e
= tsubst (TREE_OPERAND (t
, 0), args
, complain
,
6637 if (e
== error_mark_node
)
6638 return error_mark_node
;
6640 return fold (build (TREE_CODE (t
), TREE_TYPE (t
), e
));
6645 tree ctx
= tsubst_aggr_type (TYPE_CONTEXT (t
), args
, complain
,
6646 in_decl
, /*entering_scope=*/1);
6647 tree f
= tsubst_copy (TYPENAME_TYPE_FULLNAME (t
), args
,
6650 if (ctx
== error_mark_node
|| f
== error_mark_node
)
6651 return error_mark_node
;
6653 if (!IS_AGGR_TYPE (ctx
))
6656 cp_error ("`%T' is not a class, struct, or union type",
6658 return error_mark_node
;
6660 else if (!uses_template_parms (ctx
) && !TYPE_BEING_DEFINED (ctx
))
6662 /* Normally, make_typename_type does not require that the CTX
6663 have complete type in order to allow things like:
6665 template <class T> struct S { typename S<T>::X Y; };
6667 But, such constructs have already been resolved by this
6668 point, so here CTX really should have complete type, unless
6669 it's a partial instantiation. */
6670 ctx
= complete_type (ctx
);
6671 if (!COMPLETE_TYPE_P (ctx
))
6674 incomplete_type_error (NULL_TREE
, ctx
);
6675 return error_mark_node
;
6679 f
= make_typename_type (ctx
, f
, complain
);
6680 if (f
== error_mark_node
)
6682 return cp_build_qualified_type_real (f
,
6684 | CP_TYPE_QUALS (t
),
6690 tree e
= tsubst (TREE_OPERAND (t
, 0), args
, complain
,
6692 if (e
== error_mark_node
)
6693 return error_mark_node
;
6694 return make_pointer_declarator (type
, e
);
6699 tree e
= tsubst (TREE_OPERAND (t
, 0), args
, complain
,
6701 if (e
== error_mark_node
)
6702 return error_mark_node
;
6703 return make_reference_declarator (type
, e
);
6708 tree e1
= tsubst (TREE_OPERAND (t
, 0), args
, complain
,
6710 tree e2
= tsubst_expr (TREE_OPERAND (t
, 1), args
, complain
,
6712 if (e1
== error_mark_node
|| e2
== error_mark_node
)
6713 return error_mark_node
;
6715 return build_parse_node (ARRAY_REF
, e1
, e2
, tsubst_expr
);
6720 tree e1
= tsubst (TREE_OPERAND (t
, 0), args
, complain
,
6722 tree e2
= (tsubst_call_declarator_parms
6723 (CALL_DECLARATOR_PARMS (t
), args
, complain
, in_decl
));
6724 tree e3
= tsubst (CALL_DECLARATOR_EXCEPTION_SPEC (t
), args
,
6727 if (e1
== error_mark_node
|| e2
== error_mark_node
6728 || e3
== error_mark_node
)
6729 return error_mark_node
;
6731 return make_call_declarator (e1
, e2
, CALL_DECLARATOR_QUALS (t
), e3
);
6736 tree e1
= tsubst (TREE_OPERAND (t
, 0), args
, complain
,
6738 tree e2
= tsubst (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
6739 if (e1
== error_mark_node
|| e2
== error_mark_node
)
6740 return error_mark_node
;
6742 return build_parse_node (TREE_CODE (t
), e1
, e2
);
6747 tree e1
= tsubst_expr (TYPE_FIELDS (t
), args
, complain
,
6749 if (e1
== error_mark_node
)
6750 return error_mark_node
;
6752 return TREE_TYPE (e1
);
6762 /* This code should match declare_hidden_char_array in
6764 name
= (*decl_printable_name
) (current_function_decl
, 2);
6765 len
= strlen (name
) + 1;
6766 type
= build_array_type (char_type_node
,
6767 build_index_type (build_int_2 (len
, 0)));
6768 str
= build_string (len
, name
);
6769 TREE_TYPE (str
) = type
;
6774 sorry ("use of `%s' in template",
6775 tree_code_name
[(int) TREE_CODE (t
)]);
6776 return error_mark_node
;
6780 /* Like tsubst, but deals with expressions. This function just replaces
6781 template parms; to finish processing the resultant expression, use
6785 tsubst_copy (t
, args
, complain
, in_decl
)
6790 enum tree_code code
;
6793 if (t
== NULL_TREE
|| t
== error_mark_node
)
6796 code
= TREE_CODE (t
);
6801 return do_identifier (DECL_NAME (t
), 0, NULL_TREE
);
6808 if (!DECL_CONTEXT (t
))
6809 /* This is a global enumeration constant. */
6812 /* Unfortunately, we cannot just call lookup_name here.
6815 template <int I> int f() {
6817 struct S { void g() { E e = a; } };
6820 When we instantiate f<7>::S::g(), say, lookup_name is not
6821 clever enough to find f<7>::a. */
6823 = tsubst_aggr_type (TREE_TYPE (t
), args
, complain
, in_decl
,
6824 /*entering_scope=*/0);
6826 for (v
= TYPE_VALUES (enum_type
);
6829 if (TREE_PURPOSE (v
) == DECL_NAME (t
))
6830 return TREE_VALUE (v
);
6832 /* We didn't find the name. That should never happen; if
6833 name-lookup found it during preliminary parsing, we
6834 should find it again here during instantiation. */
6835 my_friendly_abort (0);
6840 if (DECL_CONTEXT (t
))
6844 ctx
= tsubst_aggr_type (DECL_CONTEXT (t
), args
, complain
, in_decl
,
6845 /*entering_scope=*/1);
6846 if (ctx
!= DECL_CONTEXT (t
))
6847 return lookup_field (ctx
, DECL_NAME (t
), 0, 0);
6853 if (DECL_LANG_SPECIFIC (t
) && DECL_TEMPLATE_INFO (t
))
6854 t
= tsubst (t
, args
, complain
, in_decl
);
6859 if (is_member_template (t
))
6860 return tsubst (t
, args
, complain
, in_decl
);
6866 /* We must tsbust into a LOOKUP_EXPR in case the names to
6867 which it refers is a conversion operator; in that case the
6868 name will change. We avoid making unnecessary copies,
6871 tree id
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
6873 if (id
!= TREE_OPERAND (t
, 0))
6875 r
= build_nt (LOOKUP_EXPR
, id
);
6876 LOOKUP_EXPR_GLOBAL (r
) = LOOKUP_EXPR_GLOBAL (t
);
6884 case REINTERPRET_CAST_EXPR
:
6885 case CONST_CAST_EXPR
:
6886 case STATIC_CAST_EXPR
:
6887 case DYNAMIC_CAST_EXPR
:
6890 (code
, tsubst (TREE_TYPE (t
), args
, complain
, in_decl
),
6891 tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
));
6894 case PREDECREMENT_EXPR
:
6895 case PREINCREMENT_EXPR
:
6896 case POSTDECREMENT_EXPR
:
6897 case POSTINCREMENT_EXPR
:
6899 case TRUTH_NOT_EXPR
:
6902 case CONVERT_EXPR
: /* Unary + */
6911 (code
, tsubst (TREE_TYPE (t
), args
, complain
, in_decl
),
6912 tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
));
6917 case TRUNC_DIV_EXPR
:
6919 case FLOOR_DIV_EXPR
:
6920 case ROUND_DIV_EXPR
:
6921 case EXACT_DIV_EXPR
:
6923 case BIT_ANDTC_EXPR
:
6926 case TRUNC_MOD_EXPR
:
6927 case FLOOR_MOD_EXPR
:
6928 case TRUTH_ANDIF_EXPR
:
6929 case TRUTH_ORIF_EXPR
:
6930 case TRUTH_AND_EXPR
:
6951 (code
, tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
),
6952 tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
));
6956 tree fn
= TREE_OPERAND (t
, 0);
6957 if (is_overloaded_fn (fn
))
6958 fn
= tsubst_copy (get_first_fn (fn
), args
, complain
, in_decl
);
6960 /* Sometimes FN is a LOOKUP_EXPR. */
6961 fn
= tsubst_copy (fn
, args
, complain
, in_decl
);
6963 (code
, fn
, tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
,
6968 case METHOD_CALL_EXPR
:
6970 tree name
= TREE_OPERAND (t
, 0);
6971 if (TREE_CODE (name
) == BIT_NOT_EXPR
)
6973 name
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
6975 name
= build1 (BIT_NOT_EXPR
, NULL_TREE
, name
);
6977 else if (TREE_CODE (name
) == SCOPE_REF
6978 && TREE_CODE (TREE_OPERAND (name
, 1)) == BIT_NOT_EXPR
)
6980 tree base
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
6982 name
= TREE_OPERAND (name
, 1);
6983 name
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
6985 name
= build1 (BIT_NOT_EXPR
, NULL_TREE
, name
);
6986 name
= build_nt (SCOPE_REF
, base
, name
);
6989 name
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
6991 (code
, name
, tsubst_copy (TREE_OPERAND (t
, 1), args
,
6993 tsubst_copy (TREE_OPERAND (t
, 2), args
, complain
, in_decl
),
6998 /* This processing should really occur in tsubst_expr, However,
6999 tsubst_expr does not recurse into expressions, since it
7000 assumes that there aren't any statements inside them.
7001 Instead, it simply calls build_expr_from_tree. So, we need
7002 to expand the STMT_EXPR here. */
7003 if (!processing_template_decl
)
7005 tree stmt_expr
= begin_stmt_expr ();
7006 tsubst_expr (STMT_EXPR_STMT (t
), args
,
7008 return finish_stmt_expr (stmt_expr
);
7015 case PSEUDO_DTOR_EXPR
:
7018 (code
, tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
),
7019 tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
),
7020 tsubst_copy (TREE_OPERAND (t
, 2), args
, complain
, in_decl
));
7027 (code
, tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
),
7028 tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
),
7029 tsubst_copy (TREE_OPERAND (t
, 2), args
, complain
, in_decl
));
7030 NEW_EXPR_USE_GLOBAL (r
) = NEW_EXPR_USE_GLOBAL (t
);
7037 (code
, tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
),
7038 tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
));
7039 DELETE_EXPR_USE_GLOBAL (r
) = DELETE_EXPR_USE_GLOBAL (t
);
7040 DELETE_EXPR_USE_VEC (r
) = DELETE_EXPR_USE_VEC (t
);
7044 case TEMPLATE_ID_EXPR
:
7046 /* Substituted template arguments */
7047 tree targs
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
,
7050 if (targs
&& TREE_CODE (targs
) == TREE_LIST
)
7053 for (chain
= targs
; chain
; chain
= TREE_CHAIN (chain
))
7054 TREE_VALUE (chain
) = maybe_fold_nontype_arg (TREE_VALUE (chain
));
7059 for (i
= 0; i
< TREE_VEC_LENGTH (targs
); ++i
)
7060 TREE_VEC_ELT (targs
, i
)
7061 = maybe_fold_nontype_arg (TREE_VEC_ELT (targs
, i
));
7064 return lookup_template_function
7065 (tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
), targs
);
7070 tree purpose
, value
, chain
;
7072 if (t
== void_list_node
)
7075 purpose
= TREE_PURPOSE (t
);
7077 purpose
= tsubst_copy (purpose
, args
, complain
, in_decl
);
7078 value
= TREE_VALUE (t
);
7080 value
= tsubst_copy (value
, args
, complain
, in_decl
);
7081 chain
= TREE_CHAIN (t
);
7082 if (chain
&& chain
!= void_type_node
)
7083 chain
= tsubst_copy (chain
, args
, complain
, in_decl
);
7084 if (purpose
== TREE_PURPOSE (t
)
7085 && value
== TREE_VALUE (t
)
7086 && chain
== TREE_CHAIN (t
))
7088 return tree_cons (purpose
, value
, chain
);
7095 case TEMPLATE_TYPE_PARM
:
7096 case TEMPLATE_TEMPLATE_PARM
:
7097 case TEMPLATE_PARM_INDEX
:
7099 case REFERENCE_TYPE
:
7106 return tsubst (t
, args
, complain
, in_decl
);
7108 case IDENTIFIER_NODE
:
7109 if (IDENTIFIER_TYPENAME_P (t
))
7111 tree new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
7113 return mangle_conv_op_name_for_type (new_type
);
7115 return (build_typename_overload (new_type
));
7123 (CONSTRUCTOR
, tsubst (TREE_TYPE (t
), args
, complain
, in_decl
),
7124 NULL_TREE
, tsubst_copy (CONSTRUCTOR_ELTS (t
), args
,
7125 complain
, in_decl
));
7126 TREE_HAS_CONSTRUCTOR (r
) = TREE_HAS_CONSTRUCTOR (t
);
7131 return build_x_va_arg (tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
,
7133 tsubst (TREE_TYPE (t
), args
, complain
, in_decl
));
7136 return tsubst (t
, args
, complain
, in_decl
);
7143 /* Like tsubst_copy, but also does semantic processing. */
7146 tsubst_expr (t
, args
, complain
, in_decl
)
7153 if (t
== NULL_TREE
|| t
== error_mark_node
)
7156 if (processing_template_decl
)
7157 return tsubst_copy (t
, args
, complain
, in_decl
);
7159 switch (TREE_CODE (t
))
7163 finish_named_return_value
7164 (TREE_OPERAND (t
, 0),
7165 tsubst_expr (TREE_OPERAND (t
, 1), args
, /*complain=*/1, in_decl
));
7166 tsubst_expr (TREE_CHAIN (t
), args
, complain
, in_decl
);
7169 case CTOR_INITIALIZER
:
7171 tree member_init_list
;
7172 tree base_init_list
;
7176 = tsubst_initializer_list (TREE_OPERAND (t
, 0), args
);
7178 = tsubst_initializer_list (TREE_OPERAND (t
, 1), args
);
7179 setup_vtbl_ptr (member_init_list
, base_init_list
);
7180 tsubst_expr (TREE_CHAIN (t
), args
, complain
, in_decl
);
7186 finish_return_stmt (tsubst_expr (RETURN_EXPR (t
),
7187 args
, complain
, in_decl
));
7192 finish_expr_stmt (tsubst_expr (EXPR_STMT_EXPR (t
),
7193 args
, complain
, in_decl
));
7202 decl
= DECL_STMT_DECL (t
);
7203 if (TREE_CODE (decl
) == LABEL_DECL
)
7204 finish_label_decl (DECL_NAME (decl
));
7207 init
= DECL_INITIAL (decl
);
7208 decl
= tsubst (decl
, args
, complain
, in_decl
);
7209 init
= tsubst_expr (init
, args
, complain
, in_decl
);
7211 DECL_INITIAL (decl
) = error_mark_node
;
7212 /* By marking the declaration as instantiated, we avoid
7213 trying to instantiate it. Since instantiate_decl can't
7214 handle local variables, and since we've already done
7215 all that needs to be done, that's the right thing to
7217 if (TREE_CODE (decl
) == VAR_DECL
)
7218 DECL_TEMPLATE_INSTANTIATED (decl
) = 1;
7219 maybe_push_decl (decl
);
7220 cp_finish_decl (decl
, init
, NULL_TREE
, 0);
7230 stmt
= begin_for_stmt ();
7231 for (tmp
= FOR_INIT_STMT (t
); tmp
; tmp
= TREE_CHAIN (tmp
))
7232 tsubst_expr (tmp
, args
, complain
, in_decl
);
7233 finish_for_init_stmt (stmt
);
7234 finish_for_cond (tsubst_expr (FOR_COND (t
), args
,
7237 tmp
= tsubst_expr (FOR_EXPR (t
), args
, complain
, in_decl
);
7238 finish_for_expr (tmp
, stmt
);
7239 tsubst_expr (FOR_BODY (t
), args
, complain
, in_decl
);
7240 finish_for_stmt (stmt
);
7247 stmt
= begin_while_stmt ();
7248 finish_while_stmt_cond (tsubst_expr (WHILE_COND (t
),
7249 args
, complain
, in_decl
),
7251 tsubst_expr (WHILE_BODY (t
), args
, complain
, in_decl
);
7252 finish_while_stmt (stmt
);
7259 stmt
= begin_do_stmt ();
7260 tsubst_expr (DO_BODY (t
), args
, complain
, in_decl
);
7261 finish_do_body (stmt
);
7262 finish_do_stmt (tsubst_expr (DO_COND (t
), args
,
7273 stmt
= begin_if_stmt ();
7274 finish_if_stmt_cond (tsubst_expr (IF_COND (t
),
7275 args
, complain
, in_decl
),
7278 if (tmp
= THEN_CLAUSE (t
), tmp
)
7280 tsubst_expr (tmp
, args
, complain
, in_decl
);
7281 finish_then_clause (stmt
);
7284 if (tmp
= ELSE_CLAUSE (t
), tmp
)
7286 begin_else_clause ();
7287 tsubst_expr (tmp
, args
, complain
, in_decl
);
7288 finish_else_clause (stmt
);
7300 stmt
= begin_compound_stmt (COMPOUND_STMT_NO_SCOPE (t
));
7301 for (substmt
= COMPOUND_BODY (t
);
7302 substmt
!= NULL_TREE
;
7303 substmt
= TREE_CHAIN (substmt
))
7304 tsubst_expr (substmt
, args
, complain
, in_decl
);
7305 return finish_compound_stmt (COMPOUND_STMT_NO_SCOPE (t
), stmt
);
7311 finish_break_stmt ();
7316 finish_continue_stmt ();
7324 stmt
= begin_switch_stmt ();
7325 val
= tsubst_expr (SWITCH_COND (t
), args
, complain
, in_decl
);
7326 finish_switch_cond (val
, stmt
);
7327 tsubst_expr (SWITCH_BODY (t
), args
, complain
, in_decl
);
7328 finish_switch_stmt (stmt
);
7334 finish_case_label (tsubst_expr (CASE_LOW (t
), args
, complain
, in_decl
),
7335 tsubst_expr (CASE_HIGH (t
), args
, complain
, in_decl
));
7339 lineno
= STMT_LINENO (t
);
7340 finish_label_stmt (DECL_NAME (LABEL_STMT_LABEL (t
)));
7345 t
= GOTO_DESTINATION (t
);
7346 if (TREE_CODE (t
) != LABEL_DECL
)
7347 /* Computed goto's must be tsubst'd into. On the other hand,
7348 non-computed gotos must not be; the identifier in question
7349 will have no binding. */
7350 t
= tsubst_expr (t
, args
, complain
, in_decl
);
7353 finish_goto_stmt (t
);
7358 finish_asm_stmt (ASM_CV_QUAL (t
),
7359 tsubst_expr (ASM_STRING (t
), args
, complain
, in_decl
),
7360 tsubst_expr (ASM_OUTPUTS (t
), args
, complain
, in_decl
),
7361 tsubst_expr (ASM_INPUTS (t
), args
, complain
, in_decl
),
7362 tsubst_expr (ASM_CLOBBERS (t
), args
, complain
,
7370 stmt
= begin_try_block ();
7371 tsubst_expr (TRY_STMTS (t
), args
, complain
, in_decl
);
7372 finish_cleanup_try_block (stmt
);
7373 finish_cleanup (tsubst_expr (TRY_HANDLERS (t
), args
,
7381 if (FN_TRY_BLOCK_P (t
))
7382 stmt
= begin_function_try_block ();
7384 stmt
= begin_try_block ();
7386 tsubst_expr (TRY_STMTS (t
), args
, complain
, in_decl
);
7388 if (FN_TRY_BLOCK_P (t
))
7389 finish_function_try_block (stmt
);
7391 finish_try_block (stmt
);
7393 handler
= TRY_HANDLERS (t
);
7394 for (; handler
; handler
= TREE_CHAIN (handler
))
7395 tsubst_expr (handler
, args
, complain
, in_decl
);
7396 if (FN_TRY_BLOCK_P (t
))
7397 finish_function_handler_sequence (stmt
);
7399 finish_handler_sequence (stmt
);
7409 stmt
= begin_handler ();
7410 if (HANDLER_PARMS (t
))
7412 decl
= DECL_STMT_DECL (HANDLER_PARMS (t
));
7413 decl
= tsubst (decl
, args
, complain
, in_decl
);
7414 /* Prevent instantiate_decl from trying to instantiate
7415 this variable. We've already done all that needs to be
7417 DECL_TEMPLATE_INSTANTIATED (decl
) = 1;
7421 blocks
= finish_handler_parms (decl
, stmt
);
7422 tsubst_expr (HANDLER_BODY (t
), args
, complain
, in_decl
);
7423 finish_handler (blocks
, stmt
);
7430 tsubst (t
, args
, complain
, NULL_TREE
);
7434 return build_expr_from_tree (tsubst_copy (t
, args
, complain
, in_decl
));
7439 /* TMPL is a TEMPLATE_DECL for a cloned constructor or destructor.
7440 Instantiate it with the ARGS. */
7443 instantiate_clone (tmpl
, args
)
7450 /* Instantiated the cloned function, rather than the clone. */
7451 spec
= instantiate_template (DECL_CLONED_FUNCTION (tmpl
), args
);
7453 /* Then, see if we've already cloned the instantiation. */
7454 for (clone
= TREE_CHAIN (spec
);
7455 clone
&& DECL_CLONED_FUNCTION_P (clone
);
7456 clone
= TREE_CHAIN (clone
))
7457 if (DECL_NAME (clone
) == DECL_NAME (tmpl
))
7460 /* If we haven't, do so know. */
7462 clone_function_decl (spec
, /*update_method_vec_p=*/0);
7465 for (clone
= TREE_CHAIN (spec
);
7466 clone
&& DECL_CLONED_FUNCTION_P (clone
);
7467 clone
= TREE_CHAIN (clone
))
7468 if (DECL_NAME (clone
) == DECL_NAME (tmpl
))
7471 /* We should always have found the clone by now. */
7472 my_friendly_abort (20000411);
7476 /* Instantiate the indicated variable or function template TMPL with
7477 the template arguments in TARG_PTR. */
7480 instantiate_template (tmpl
, targ_ptr
)
7481 tree tmpl
, targ_ptr
;
7489 if (tmpl
== error_mark_node
)
7490 return error_mark_node
;
7492 my_friendly_assert (TREE_CODE (tmpl
) == TEMPLATE_DECL
, 283);
7494 /* If this function is a clone, handle it specially. */
7495 if (DECL_CLONED_FUNCTION_P (tmpl
))
7496 return instantiate_clone (tmpl
, targ_ptr
);
7498 /* Check to see if we already have this specialization. */
7499 spec
= retrieve_specialization (tmpl
, targ_ptr
);
7500 if (spec
!= NULL_TREE
)
7503 gen_tmpl
= most_general_template (tmpl
);
7504 if (tmpl
!= gen_tmpl
)
7506 /* The TMPL is a partial instantiation. To get a full set of
7507 arguments we must add the arguments used to perform the
7508 partial instantiation. */
7509 targ_ptr
= add_outermost_template_args (DECL_TI_ARGS (tmpl
),
7512 /* Check to see if we already have this specialization. */
7513 spec
= retrieve_specialization (gen_tmpl
, targ_ptr
);
7514 if (spec
!= NULL_TREE
)
7518 len
= DECL_NTPARMS (gen_tmpl
);
7519 inner_args
= INNERMOST_TEMPLATE_ARGS (targ_ptr
);
7523 tree t
= TREE_VEC_ELT (inner_args
, i
);
7526 tree nt
= target_type (t
);
7527 if (IS_AGGR_TYPE (nt
) && decl_function_context (TYPE_MAIN_DECL (nt
)))
7529 cp_error ("type `%T' composed from a local class is not a valid template-argument", t
);
7530 cp_error (" trying to instantiate `%D'", gen_tmpl
);
7531 return error_mark_node
;
7536 /* substitute template parameters */
7537 fndecl
= tsubst (DECL_TEMPLATE_RESULT (gen_tmpl
),
7538 targ_ptr
, /*complain=*/1, gen_tmpl
);
7539 /* The DECL_TI_TEMPLATE should always be the immediate parent
7540 template, not the most general template. */
7541 DECL_TI_TEMPLATE (fndecl
) = tmpl
;
7543 if (flag_external_templates
)
7544 add_pending_template (fndecl
);
7549 /* Push the name of the class template into the scope of the instantiation. */
7552 overload_template_name (type
)
7555 tree id
= DECL_NAME (CLASSTYPE_TI_TEMPLATE (type
));
7558 if (IDENTIFIER_CLASS_VALUE (id
)
7559 && TREE_TYPE (IDENTIFIER_CLASS_VALUE (id
)) == type
)
7562 decl
= build_decl (TYPE_DECL
, id
, type
);
7563 DECL_ARTIFICIAL (decl
) = 1;
7564 pushdecl_class_level (decl
);
7567 /* The FN is a TEMPLATE_DECL for a function. The ARGS are the
7568 arguments that are being used when calling it. TARGS is a vector
7569 into which the deduced template arguments are placed.
7571 Return zero for success, 2 for an incomplete match that doesn't resolve
7572 all the types, and 1 for complete failure. An error message will be
7573 printed only for an incomplete match.
7575 If FN is a conversion operator, RETURN_TYPE is the type desired as
7576 the result of the conversion operator.
7578 TPARMS is a vector of template parameters.
7580 The EXPLICIT_TARGS are explicit template arguments provided via a
7583 The parameter STRICT is one of:
7586 We are deducing arguments for a function call, as in
7590 We are deducing arguments for a conversion function, as in
7594 We are deducing arguments when calculating the partial
7595 ordering between specializations of function or class
7596 templates, as in [temp.func.order] and [temp.class.order],
7597 when doing an explicit instantiation as in [temp.explicit],
7598 when determining an explicit specialization as in
7599 [temp.expl.spec], or when taking the address of a function
7600 template, as in [temp.deduct.funcaddr].
7602 The other arguments are as for type_unification. */
7605 fn_type_unification (fn
, explicit_targs
, targs
, args
, return_type
,
7607 tree fn
, explicit_targs
, targs
, args
, return_type
;
7608 unification_kind_t strict
;
7614 my_friendly_assert (TREE_CODE (fn
) == TEMPLATE_DECL
, 0);
7616 fntype
= TREE_TYPE (fn
);
7621 The specified template arguments must match the template
7622 parameters in kind (i.e., type, nontype, template), and there
7623 must not be more arguments than there are parameters;
7624 otherwise type deduction fails.
7626 Nontype arguments must match the types of the corresponding
7627 nontype template parameters, or must be convertible to the
7628 types of the corresponding nontype parameters as specified in
7629 _temp.arg.nontype_, otherwise type deduction fails.
7631 All references in the function type of the function template
7632 to the corresponding template parameters are replaced by the
7633 specified template argument values. If a substitution in a
7634 template parameter or in the function type of the function
7635 template results in an invalid type, type deduction fails. */
7637 tree converted_args
;
7640 = (coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (fn
),
7641 explicit_targs
, NULL_TREE
, /*complain=*/0,
7642 /*require_all_arguments=*/0));
7643 if (converted_args
== error_mark_node
)
7646 fntype
= tsubst (fntype
, converted_args
, /*complain=*/0, NULL_TREE
);
7647 if (fntype
== error_mark_node
)
7650 /* Place the explicitly specified arguments in TARGS. */
7651 for (i
= 0; i
< TREE_VEC_LENGTH (targs
); i
++)
7652 TREE_VEC_ELT (targs
, i
) = TREE_VEC_ELT (converted_args
, i
);
7655 parms
= TYPE_ARG_TYPES (fntype
);
7657 if (DECL_CONV_FN_P (fn
))
7659 /* This is a template conversion operator. Remove `this', since
7660 we could be comparing conversions from different classes. */
7661 parms
= TREE_CHAIN (parms
);
7662 args
= TREE_CHAIN (args
);
7663 my_friendly_assert (return_type
!= NULL_TREE
, 20000227);
7668 /* We've been given a return type to match, prepend it. */
7669 parms
= tree_cons (NULL_TREE
, TREE_TYPE (fntype
), parms
);
7670 args
= tree_cons (NULL_TREE
, return_type
, args
);
7673 /* We allow incomplete unification without an error message here
7674 because the standard doesn't seem to explicitly prohibit it. Our
7675 callers must be ready to deal with unification failures in any
7677 result
= type_unification_real (DECL_INNERMOST_TEMPLATE_PARMS (fn
),
7678 targs
, parms
, args
, /*subr=*/0,
7679 strict
, /*allow_incomplete*/1);
7682 /* All is well so far. Now, check:
7686 When all template arguments have been deduced, all uses of
7687 template parameters in nondeduced contexts are replaced with
7688 the corresponding deduced argument values. If the
7689 substitution results in an invalid type, as described above,
7690 type deduction fails. */
7691 if (tsubst (TREE_TYPE (fn
), targs
, /*complain=*/0, NULL_TREE
)
7698 /* Adjust types before performing type deduction, as described in
7699 [temp.deduct.call] and [temp.deduct.conv]. The rules in these two
7700 sections are symmetric. PARM is the type of a function parameter
7701 or the return type of the conversion function. ARG is the type of
7702 the argument passed to the call, or the type of the value
7703 intialized with the result of the conversion function. */
7706 maybe_adjust_types_for_deduction (strict
, parm
, arg
)
7707 unification_kind_t strict
;
7718 /* Swap PARM and ARG throughout the remainder of this
7719 function; the handling is precisely symmetric since PARM
7720 will initialize ARG rather than vice versa. */
7728 /* There is nothing to do in this case. */
7732 my_friendly_abort (0);
7735 if (TREE_CODE (*parm
) != REFERENCE_TYPE
)
7737 /* [temp.deduct.call]
7739 If P is not a reference type:
7741 --If A is an array type, the pointer type produced by the
7742 array-to-pointer standard conversion (_conv.array_) is
7743 used in place of A for type deduction; otherwise,
7745 --If A is a function type, the pointer type produced by
7746 the function-to-pointer standard conversion
7747 (_conv.func_) is used in place of A for type deduction;
7750 --If A is a cv-qualified type, the top level
7751 cv-qualifiers of A's type are ignored for type
7753 if (TREE_CODE (*arg
) == ARRAY_TYPE
)
7754 *arg
= build_pointer_type (TREE_TYPE (*arg
));
7755 else if (TREE_CODE (*arg
) == FUNCTION_TYPE
)
7756 *arg
= build_pointer_type (*arg
);
7758 *arg
= TYPE_MAIN_VARIANT (*arg
);
7761 /* [temp.deduct.call]
7763 If P is a cv-qualified type, the top level cv-qualifiers
7764 of P's type are ignored for type deduction. If P is a
7765 reference type, the type referred to by P is used for
7767 *parm
= TYPE_MAIN_VARIANT (*parm
);
7768 if (TREE_CODE (*parm
) == REFERENCE_TYPE
)
7769 *parm
= TREE_TYPE (*parm
);
7772 /* Like type_unfication.
7774 If SUBR is 1, we're being called recursively (to unify the
7775 arguments of a function or method parameter of a function
7779 type_unification_real (tparms
, targs
, parms
, args
, subr
,
7780 strict
, allow_incomplete
)
7781 tree tparms
, targs
, parms
, args
;
7783 unification_kind_t strict
;
7784 int allow_incomplete
;
7788 int ntparms
= TREE_VEC_LENGTH (tparms
);
7791 my_friendly_assert (TREE_CODE (tparms
) == TREE_VEC
, 289);
7792 my_friendly_assert (parms
== NULL_TREE
7793 || TREE_CODE (parms
) == TREE_LIST
, 290);
7794 /* ARGS could be NULL (via a call from parse.y to
7795 build_x_function_call). */
7797 my_friendly_assert (TREE_CODE (args
) == TREE_LIST
, 291);
7798 my_friendly_assert (ntparms
> 0, 292);
7803 sub_strict
= UNIFY_ALLOW_MORE_CV_QUAL
| UNIFY_ALLOW_DERIVED
;
7807 sub_strict
= UNIFY_ALLOW_LESS_CV_QUAL
;
7811 sub_strict
= UNIFY_ALLOW_NONE
;
7815 my_friendly_abort (0);
7819 && parms
!= void_list_node
7821 && args
!= void_list_node
)
7823 parm
= TREE_VALUE (parms
);
7824 parms
= TREE_CHAIN (parms
);
7825 arg
= TREE_VALUE (args
);
7826 args
= TREE_CHAIN (args
);
7828 if (arg
== error_mark_node
)
7830 if (arg
== unknown_type_node
)
7831 /* We can't deduce anything from this, but we might get all the
7832 template args from other function args. */
7835 /* Conversions will be performed on a function argument that
7836 corresponds with a function parameter that contains only
7837 non-deducible template parameters and explicitly specified
7838 template parameters. */
7839 if (! uses_template_parms (parm
))
7844 type
= TREE_TYPE (arg
);
7851 if (strict
== DEDUCE_EXACT
)
7853 if (same_type_p (parm
, type
))
7857 /* It might work; we shouldn't check now, because we might
7858 get into infinite recursion. Overload resolution will
7867 my_friendly_assert (TREE_TYPE (arg
) != NULL_TREE
, 293);
7868 if (type_unknown_p (arg
))
7870 /* [temp.deduct.type] A template-argument can be deduced from
7871 a pointer to function or pointer to member function
7872 argument if the set of overloaded functions does not
7873 contain function templates and at most one of a set of
7874 overloaded functions provides a unique match. */
7876 if (resolve_overloaded_unification
7877 (tparms
, targs
, parm
, arg
, strict
, sub_strict
)
7882 arg
= TREE_TYPE (arg
);
7886 maybe_adjust_types_for_deduction (strict
, &parm
, &arg
);
7888 switch (unify (tparms
, targs
, parm
, arg
, sub_strict
))
7896 /* Fail if we've reached the end of the parm list, and more args
7897 are present, and the parm list isn't variadic. */
7898 if (args
&& args
!= void_list_node
&& parms
== void_list_node
)
7900 /* Fail if parms are left and they don't have default values. */
7902 && parms
!= void_list_node
7903 && TREE_PURPOSE (parms
) == NULL_TREE
)
7906 for (i
= 0; i
< ntparms
; i
++)
7907 if (TREE_VEC_ELT (targs
, i
) == NULL_TREE
)
7909 if (!allow_incomplete
)
7910 error ("incomplete type unification");
7916 /* Subroutine of type_unification_real. Args are like the variables at the
7917 call site. ARG is an overloaded function (or template-id); we try
7918 deducing template args from each of the overloads, and if only one
7919 succeeds, we go with that. Modifies TARGS and returns 0 on success. */
7922 resolve_overloaded_unification (tparms
, targs
, parm
, arg
, strict
,
7924 tree tparms
, targs
, parm
, arg
;
7925 unification_kind_t strict
;
7928 tree tempargs
= copy_node (targs
);
7931 if (TREE_CODE (arg
) == ADDR_EXPR
)
7932 arg
= TREE_OPERAND (arg
, 0);
7934 if (TREE_CODE (arg
) == COMPONENT_REF
)
7935 /* Handle `&x' where `x' is some static or non-static member
7937 arg
= TREE_OPERAND (arg
, 1);
7939 if (TREE_CODE (arg
) == OFFSET_REF
)
7940 arg
= TREE_OPERAND (arg
, 1);
7942 /* Strip baselink information. */
7943 while (TREE_CODE (arg
) == TREE_LIST
)
7944 arg
= TREE_VALUE (arg
);
7946 if (TREE_CODE (arg
) == TEMPLATE_ID_EXPR
)
7948 /* If we got some explicit template args, we need to plug them into
7949 the affected templates before we try to unify, in case the
7950 explicit args will completely resolve the templates in question. */
7952 tree expl_subargs
= TREE_OPERAND (arg
, 1);
7953 arg
= TREE_OPERAND (arg
, 0);
7955 for (; arg
; arg
= OVL_NEXT (arg
))
7957 tree fn
= OVL_CURRENT (arg
);
7960 if (TREE_CODE (fn
) != TEMPLATE_DECL
)
7963 subargs
= get_bindings_overload (fn
, DECL_TEMPLATE_RESULT (fn
),
7967 elem
= tsubst (TREE_TYPE (fn
), subargs
, /*complain=*/0,
7969 if (TREE_CODE (elem
) == METHOD_TYPE
)
7970 elem
= build_ptrmemfunc_type (build_pointer_type (elem
));
7971 good
+= try_one_overload (tparms
, targs
, tempargs
, parm
, elem
,
7972 strict
, sub_strict
);
7976 else if (TREE_CODE (arg
) == OVERLOAD
)
7978 for (; arg
; arg
= OVL_NEXT (arg
))
7980 tree type
= TREE_TYPE (OVL_CURRENT (arg
));
7981 if (TREE_CODE (type
) == METHOD_TYPE
)
7982 type
= build_ptrmemfunc_type (build_pointer_type (type
));
7983 good
+= try_one_overload (tparms
, targs
, tempargs
, parm
,
7985 strict
, sub_strict
);
7989 my_friendly_abort (981006);
7991 /* [temp.deduct.type] A template-argument can be deduced from a pointer
7992 to function or pointer to member function argument if the set of
7993 overloaded functions does not contain function templates and at most
7994 one of a set of overloaded functions provides a unique match.
7996 So if we found multiple possibilities, we return success but don't
8001 int i
= TREE_VEC_LENGTH (targs
);
8003 if (TREE_VEC_ELT (tempargs
, i
))
8004 TREE_VEC_ELT (targs
, i
) = TREE_VEC_ELT (tempargs
, i
);
8012 /* Subroutine of resolve_overloaded_unification; does deduction for a single
8013 overload. Fills TARGS with any deduced arguments, or error_mark_node if
8014 different overloads deduce different arguments for a given parm.
8015 Returns 1 on success. */
8018 try_one_overload (tparms
, orig_targs
, targs
, parm
, arg
, strict
,
8020 tree tparms
, orig_targs
, targs
, parm
, arg
;
8021 unification_kind_t strict
;
8028 /* [temp.deduct.type] A template-argument can be deduced from a pointer
8029 to function or pointer to member function argument if the set of
8030 overloaded functions does not contain function templates and at most
8031 one of a set of overloaded functions provides a unique match.
8033 So if this is a template, just return success. */
8035 if (uses_template_parms (arg
))
8038 maybe_adjust_types_for_deduction (strict
, &parm
, &arg
);
8040 /* We don't copy orig_targs for this because if we have already deduced
8041 some template args from previous args, unify would complain when we
8042 try to deduce a template parameter for the same argument, even though
8043 there isn't really a conflict. */
8044 nargs
= TREE_VEC_LENGTH (targs
);
8045 tempargs
= make_tree_vec (nargs
);
8047 if (unify (tparms
, tempargs
, parm
, arg
, sub_strict
) != 0)
8050 /* First make sure we didn't deduce anything that conflicts with
8051 explicitly specified args. */
8052 for (i
= nargs
; i
--; )
8054 tree elt
= TREE_VEC_ELT (tempargs
, i
);
8055 tree oldelt
= TREE_VEC_ELT (orig_targs
, i
);
8057 if (elt
== NULL_TREE
)
8059 else if (uses_template_parms (elt
))
8061 /* Since we're unifying against ourselves, we will fill in template
8062 args used in the function parm list with our own template parms.
8064 TREE_VEC_ELT (tempargs
, i
) = NULL_TREE
;
8067 else if (oldelt
&& ! template_args_equal (oldelt
, elt
))
8071 for (i
= nargs
; i
--; )
8073 tree elt
= TREE_VEC_ELT (tempargs
, i
);
8076 TREE_VEC_ELT (targs
, i
) = elt
;
8082 /* PARM is a template class (perhaps with unbound template
8083 parameters). ARG is a fully instantiated type. If ARG can be
8084 bound to PARM, return ARG, otherwise return NULL_TREE. TPARMS and
8085 TARGS are as for unify. */
8088 try_class_unification (tparms
, targs
, parm
, arg
)
8097 if (!CLASSTYPE_TEMPLATE_INFO (arg
)
8098 || CLASSTYPE_TI_TEMPLATE (arg
) != CLASSTYPE_TI_TEMPLATE (parm
))
8101 /* We need to make a new template argument vector for the call to
8102 unify. If we used TARGS, we'd clutter it up with the result of
8103 the attempted unification, even if this class didn't work out.
8104 We also don't want to commit ourselves to all the unifications
8105 we've already done, since unification is supposed to be done on
8106 an argument-by-argument basis. In other words, consider the
8107 following pathological case:
8109 template <int I, int J, int K>
8112 template <int I, int J>
8113 struct S<I, J, 2> : public S<I, I, I>, S<J, J, J> {};
8115 template <int I, int J, int K>
8116 void f(S<I, J, K>, S<I, I, I>);
8125 Now, by the time we consider the unification involving `s2', we
8126 already know that we must have `f<0, 0, 0>'. But, even though
8127 `S<0, 1, 2>' is derived from `S<0, 0, 0>', the code is not legal
8128 because there are two ways to unify base classes of S<0, 1, 2>
8129 with S<I, I, I>. If we kept the already deduced knowledge, we
8130 would reject the possibility I=1. */
8131 copy_of_targs
= make_tree_vec (TREE_VEC_LENGTH (targs
));
8132 i
= unify (tparms
, copy_of_targs
, CLASSTYPE_TI_ARGS (parm
),
8133 CLASSTYPE_TI_ARGS (arg
), UNIFY_ALLOW_NONE
);
8135 /* If unification failed, we're done. */
8142 /* Subroutine of get_template_base. RVAL, if non-NULL, is a base we
8143 have alreay discovered to be satisfactory. ARG_BINFO is the binfo
8144 for the base class of ARG that we are currently examining. */
8147 get_template_base_recursive (tparms
, targs
, parm
,
8148 arg_binfo
, rval
, flags
)
8158 tree arg
= BINFO_TYPE (arg_binfo
);
8160 if (!(flags
& GTB_IGNORE_TYPE
))
8162 tree r
= try_class_unification (tparms
, targs
,
8165 /* If there is more than one satisfactory baseclass, then:
8169 If they yield more than one possible deduced A, the type
8173 if (r
&& rval
&& !same_type_p (r
, rval
))
8174 return error_mark_node
;
8179 binfos
= BINFO_BASETYPES (arg_binfo
);
8180 n_baselinks
= binfos
? TREE_VEC_LENGTH (binfos
) : 0;
8182 /* Process base types. */
8183 for (i
= 0; i
< n_baselinks
; i
++)
8185 tree base_binfo
= TREE_VEC_ELT (binfos
, i
);
8188 /* Skip this base, if we've already seen it. */
8189 if (BINFO_MARKED (base_binfo
))
8193 (flags
& GTB_VIA_VIRTUAL
) || TREE_VIA_VIRTUAL (base_binfo
);
8195 /* When searching for a non-virtual, we cannot mark virtually
8198 SET_BINFO_MARKED (base_binfo
);
8200 rval
= get_template_base_recursive (tparms
, targs
,
8204 GTB_VIA_VIRTUAL
* this_virtual
);
8206 /* If we discovered more than one matching base class, we can
8208 if (rval
== error_mark_node
)
8209 return error_mark_node
;
8215 /* Given a template type PARM and a class type ARG, find the unique
8216 base type in ARG that is an instance of PARM. We do not examine
8217 ARG itself; only its base-classes. If there is no appropriate base
8218 class, return NULL_TREE. If there is more than one, return
8219 error_mark_node. PARM may be the type of a partial specialization,
8220 as well as a plain template type. Used by unify. */
8223 get_template_base (tparms
, targs
, parm
, arg
)
8232 my_friendly_assert (IS_AGGR_TYPE_CODE (TREE_CODE (arg
)), 92);
8234 arg_binfo
= TYPE_BINFO (complete_type (arg
));
8235 rval
= get_template_base_recursive (tparms
, targs
,
8240 /* Since get_template_base_recursive marks the bases classes, we
8241 must unmark them here. */
8242 dfs_walk (arg_binfo
, dfs_unmark
, markedp
, 0);
8247 /* Returns the level of DECL, which declares a template parameter. */
8250 template_decl_level (decl
)
8253 switch (TREE_CODE (decl
))
8257 return TEMPLATE_TYPE_LEVEL (TREE_TYPE (decl
));
8260 return TEMPLATE_PARM_LEVEL (DECL_INITIAL (decl
));
8263 my_friendly_abort (0);
8268 /* Decide whether ARG can be unified with PARM, considering only the
8269 cv-qualifiers of each type, given STRICT as documented for unify.
8270 Returns non-zero iff the unification is OK on that basis.*/
8273 check_cv_quals_for_unify (strict
, arg
, parm
)
8278 if (!(strict
& UNIFY_ALLOW_MORE_CV_QUAL
)
8279 && !at_least_as_qualified_p (arg
, parm
))
8282 if (!(strict
& UNIFY_ALLOW_LESS_CV_QUAL
)
8283 && !at_least_as_qualified_p (parm
, arg
))
8289 /* Takes parameters as for type_unification. Returns 0 if the
8290 type deduction suceeds, 1 otherwise. The parameter STRICT is a
8291 bitwise or of the following flags:
8294 Require an exact match between PARM and ARG.
8295 UNIFY_ALLOW_MORE_CV_QUAL:
8296 Allow the deduced ARG to be more cv-qualified than ARG.
8297 UNIFY_ALLOW_LESS_CV_QUAL:
8298 Allow the deduced ARG to be less cv-qualified than ARG.
8299 UNIFY_ALLOW_DERIVED:
8300 Allow the deduced ARG to be a template base class of ARG,
8301 or a pointer to a template base class of the type pointed to by
8303 UNIFY_ALLOW_INTEGER:
8304 Allow any integral type to be deduced. See the TEMPLATE_PARM_INDEX
8305 case for more information. */
8308 unify (tparms
, targs
, parm
, arg
, strict
)
8309 tree tparms
, targs
, parm
, arg
;
8316 /* I don't think this will do the right thing with respect to types.
8317 But the only case I've seen it in so far has been array bounds, where
8318 signedness is the only information lost, and I think that will be
8320 while (TREE_CODE (parm
) == NOP_EXPR
)
8321 parm
= TREE_OPERAND (parm
, 0);
8323 if (arg
== error_mark_node
)
8325 if (arg
== unknown_type_node
)
8326 /* We can't deduce anything from this, but we might get all the
8327 template args from other function args. */
8330 /* If PARM uses template parameters, then we can't bail out here,
8331 even if ARG == PARM, since we won't record unifications for the
8332 template parameters. We might need them if we're trying to
8333 figure out which of two things is more specialized. */
8334 if (arg
== parm
&& !uses_template_parms (parm
))
8337 /* Immediately reject some pairs that won't unify because of
8338 cv-qualification mismatches. */
8339 if (TREE_CODE (arg
) == TREE_CODE (parm
)
8341 /* We check the cv-qualifiers when unifying with template type
8342 parameters below. We want to allow ARG `const T' to unify with
8343 PARM `T' for example, when computing which of two templates
8344 is more specialized, for example. */
8345 && TREE_CODE (arg
) != TEMPLATE_TYPE_PARM
8346 && !check_cv_quals_for_unify (strict
, arg
, parm
))
8349 switch (TREE_CODE (parm
))
8352 /* In a type which contains a nested-name-specifier, template
8353 argument values cannot be deduced for template parameters used
8354 within the nested-name-specifier. */
8357 case TEMPLATE_TYPE_PARM
:
8358 case TEMPLATE_TEMPLATE_PARM
:
8359 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, 0));
8361 if (TEMPLATE_TYPE_LEVEL (parm
)
8362 != template_decl_level (tparm
))
8363 /* The PARM is not one we're trying to unify. Just check
8364 to see if it matches ARG. */
8365 return (TREE_CODE (arg
) == TREE_CODE (parm
)
8366 && same_type_p (parm
, arg
)) ? 0 : 1;
8367 idx
= TEMPLATE_TYPE_IDX (parm
);
8368 targ
= TREE_VEC_ELT (targs
, idx
);
8369 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, idx
));
8371 /* Check for mixed types and values. */
8372 if ((TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
8373 && TREE_CODE (tparm
) != TYPE_DECL
)
8374 || (TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
8375 && TREE_CODE (tparm
) != TEMPLATE_DECL
))
8378 if (TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
)
8380 if (TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (parm
))
8382 /* We arrive here when PARM does not involve template
8385 /* ARG must be constructed from a template class. */
8386 if (TREE_CODE (arg
) != RECORD_TYPE
|| !CLASSTYPE_TEMPLATE_INFO (arg
))
8390 tree parmtmpl
= TYPE_TI_TEMPLATE (parm
);
8391 tree parmvec
= TYPE_TI_ARGS (parm
);
8392 tree argvec
= CLASSTYPE_TI_ARGS (arg
);
8394 = DECL_INNERMOST_TEMPLATE_PARMS (CLASSTYPE_TI_TEMPLATE (arg
));
8397 /* The parameter and argument roles have to be switched here
8398 in order to handle default arguments properly. For example,
8399 template<template <class> class TT> void f(TT<int>)
8400 should be able to accept vector<int> which comes from
8401 template <class T, class Allocator = allocator>
8404 if (coerce_template_parms (argtmplvec
, parmvec
, parmtmpl
, 0, 1)
8408 /* Deduce arguments T, i from TT<T> or TT<i>.
8409 We check each element of PARMVEC and ARGVEC individually
8410 rather than the whole TREE_VEC since they can have
8411 different number of elements. */
8413 for (i
= 0; i
< TREE_VEC_LENGTH (parmvec
); ++i
)
8415 tree t
= TREE_VEC_ELT (parmvec
, i
);
8417 if (unify (tparms
, targs
, t
,
8418 TREE_VEC_ELT (argvec
, i
),
8423 arg
= CLASSTYPE_TI_TEMPLATE (arg
);
8428 /* If PARM is `const T' and ARG is only `int', we don't have
8429 a match unless we are allowing additional qualification.
8430 If ARG is `const int' and PARM is just `T' that's OK;
8431 that binds `const int' to `T'. */
8432 if (!check_cv_quals_for_unify (strict
| UNIFY_ALLOW_LESS_CV_QUAL
,
8436 /* Consider the case where ARG is `const volatile int' and
8437 PARM is `const T'. Then, T should be `volatile int'. */
8439 cp_build_qualified_type_real (arg
,
8441 & ~CP_TYPE_QUALS (parm
),
8443 if (arg
== error_mark_node
)
8447 /* Simple cases: Value already set, does match or doesn't. */
8448 if (targ
!= NULL_TREE
&& same_type_p (targ
, arg
))
8453 /* Make sure that ARG is not a variable-sized array. (Note that
8454 were talking about variable-sized arrays (like `int[n]'),
8455 rather than arrays of unknown size (like `int[]').) We'll
8456 get very confused by such a type since the bound of the array
8457 will not be computable in an instantiation. Besides, such
8458 types are not allowed in ISO C++, so we can do as we please
8460 if (TREE_CODE (arg
) == ARRAY_TYPE
8461 && !uses_template_parms (arg
)
8462 && (TREE_CODE (TYPE_MAX_VALUE (TYPE_DOMAIN (arg
)))
8466 TREE_VEC_ELT (targs
, idx
) = arg
;
8469 case TEMPLATE_PARM_INDEX
:
8470 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, 0));
8472 if (TEMPLATE_PARM_LEVEL (parm
)
8473 != template_decl_level (tparm
))
8474 /* The PARM is not one we're trying to unify. Just check
8475 to see if it matches ARG. */
8476 return (TREE_CODE (arg
) == TREE_CODE (parm
)
8477 && cp_tree_equal (parm
, arg
) > 0) ? 0 : 1;
8479 idx
= TEMPLATE_PARM_IDX (parm
);
8480 targ
= TREE_VEC_ELT (targs
, idx
);
8484 int i
= (cp_tree_equal (targ
, arg
) > 0);
8490 my_friendly_abort (42);
8493 /* [temp.deduct.type] If, in the declaration of a function template
8494 with a non-type template-parameter, the non-type
8495 template-parameter is used in an expression in the function
8496 parameter-list and, if the corresponding template-argument is
8497 deduced, the template-argument type shall match the type of the
8498 template-parameter exactly, except that a template-argument
8499 deduced from an array bound may be of any integral type. */
8500 if (same_type_p (TREE_TYPE (arg
), TREE_TYPE (parm
)))
8502 else if ((strict
& UNIFY_ALLOW_INTEGER
)
8503 && (TREE_CODE (TREE_TYPE (parm
)) == INTEGER_TYPE
8504 || TREE_CODE (TREE_TYPE (parm
)) == BOOLEAN_TYPE
))
8509 TREE_VEC_ELT (targs
, idx
) = arg
;
8516 if (TREE_CODE (arg
) != POINTER_TYPE
)
8519 /* [temp.deduct.call]
8521 A can be another pointer or pointer to member type that can
8522 be converted to the deduced A via a qualification
8523 conversion (_conv.qual_).
8525 We pass down STRICT here rather than UNIFY_ALLOW_NONE.
8526 This will allow for additional cv-qualification of the
8527 pointed-to types if appropriate. In general, this is a bit
8528 too generous; we are only supposed to allow qualification
8529 conversions and this method will allow an ARG of char** and
8530 a deduced ARG of const char**. However, overload
8531 resolution will subsequently invalidate the candidate, so
8532 this is probably OK. */
8533 sub_strict
= strict
;
8535 if (TREE_CODE (TREE_TYPE (arg
)) != RECORD_TYPE
)
8536 /* The derived-to-base conversion only persists through one
8537 level of pointers. */
8538 sub_strict
&= ~UNIFY_ALLOW_DERIVED
;
8540 return unify (tparms
, targs
, TREE_TYPE (parm
),
8541 TREE_TYPE (arg
), sub_strict
);
8544 case REFERENCE_TYPE
:
8545 if (TREE_CODE (arg
) != REFERENCE_TYPE
)
8547 return unify (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
8551 if (TREE_CODE (arg
) != ARRAY_TYPE
)
8553 if ((TYPE_DOMAIN (parm
) == NULL_TREE
)
8554 != (TYPE_DOMAIN (arg
) == NULL_TREE
))
8556 if (TYPE_DOMAIN (parm
) != NULL_TREE
8557 && unify (tparms
, targs
, TYPE_DOMAIN (parm
),
8558 TYPE_DOMAIN (arg
), UNIFY_ALLOW_NONE
) != 0)
8560 return unify (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
8568 if (TREE_CODE (arg
) != TREE_CODE (parm
))
8571 if (TREE_CODE (parm
) == INTEGER_TYPE
8572 && TREE_CODE (TYPE_MAX_VALUE (parm
)) != INTEGER_CST
)
8574 if (TYPE_MIN_VALUE (parm
) && TYPE_MIN_VALUE (arg
)
8575 && unify (tparms
, targs
, TYPE_MIN_VALUE (parm
),
8576 TYPE_MIN_VALUE (arg
), UNIFY_ALLOW_INTEGER
))
8578 if (TYPE_MAX_VALUE (parm
) && TYPE_MAX_VALUE (arg
)
8579 && unify (tparms
, targs
, TYPE_MAX_VALUE (parm
),
8580 TYPE_MAX_VALUE (arg
), UNIFY_ALLOW_INTEGER
))
8583 /* We have already checked cv-qualification at the top of the
8585 else if (!same_type_ignoring_top_level_qualifiers_p (arg
, parm
))
8588 /* As far as unification is concerned, this wins. Later checks
8589 will invalidate it if necessary. */
8592 /* Types INTEGER_CST and MINUS_EXPR can come from array bounds. */
8593 /* Type INTEGER_CST can come from ordinary constant template args. */
8595 while (TREE_CODE (arg
) == NOP_EXPR
)
8596 arg
= TREE_OPERAND (arg
, 0);
8598 if (TREE_CODE (arg
) != INTEGER_CST
)
8600 return !tree_int_cst_equal (parm
, arg
);
8605 if (TREE_CODE (arg
) != TREE_VEC
)
8607 if (TREE_VEC_LENGTH (parm
) != TREE_VEC_LENGTH (arg
))
8609 for (i
= 0; i
< TREE_VEC_LENGTH (parm
); ++i
)
8610 if (unify (tparms
, targs
,
8611 TREE_VEC_ELT (parm
, i
), TREE_VEC_ELT (arg
, i
),
8619 if (TREE_CODE (arg
) != TREE_CODE (parm
))
8622 if (TYPE_PTRMEMFUNC_P (parm
))
8624 if (!TYPE_PTRMEMFUNC_P (arg
))
8627 return unify (tparms
, targs
,
8628 TYPE_PTRMEMFUNC_FN_TYPE (parm
),
8629 TYPE_PTRMEMFUNC_FN_TYPE (arg
),
8633 if (CLASSTYPE_TEMPLATE_INFO (parm
))
8637 if (strict
& UNIFY_ALLOW_DERIVED
)
8639 /* First, we try to unify the PARM and ARG directly. */
8640 t
= try_class_unification (tparms
, targs
,
8645 /* Fallback to the special case allowed in
8648 If P is a class, and P has the form
8649 template-id, then A can be a derived class of
8650 the deduced A. Likewise, if P is a pointer to
8651 a class of the form template-id, A can be a
8652 pointer to a derived class pointed to by the
8654 t
= get_template_base (tparms
, targs
,
8657 if (! t
|| t
== error_mark_node
)
8661 else if (CLASSTYPE_TEMPLATE_INFO (arg
)
8662 && (CLASSTYPE_TI_TEMPLATE (parm
)
8663 == CLASSTYPE_TI_TEMPLATE (arg
)))
8664 /* Perhaps PARM is something like S<U> and ARG is S<int>.
8665 Then, we should unify `int' and `U'. */
8668 /* There's no chance of unication succeeding. */
8671 return unify (tparms
, targs
, CLASSTYPE_TI_ARGS (parm
),
8672 CLASSTYPE_TI_ARGS (t
), UNIFY_ALLOW_NONE
);
8674 else if (!same_type_ignoring_top_level_qualifiers_p (parm
, arg
))
8680 if (TREE_CODE (arg
) != TREE_CODE (parm
))
8683 if (unify (tparms
, targs
, TREE_TYPE (parm
),
8684 TREE_TYPE (arg
), UNIFY_ALLOW_NONE
))
8686 return type_unification_real (tparms
, targs
, TYPE_ARG_TYPES (parm
),
8687 TYPE_ARG_TYPES (arg
), 1,
8691 if (TREE_CODE (arg
) != OFFSET_TYPE
)
8693 if (unify (tparms
, targs
, TYPE_OFFSET_BASETYPE (parm
),
8694 TYPE_OFFSET_BASETYPE (arg
), UNIFY_ALLOW_NONE
))
8696 return unify (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
8700 if (arg
!= decl_constant_value (parm
))
8705 /* Matched cases are handled by the ARG == PARM test above. */
8709 if (TREE_CODE (TREE_OPERAND (parm
, 1)) == INTEGER_CST
)
8711 /* We handle this case specially, since it comes up with
8712 arrays. In particular, something like:
8714 template <int N> void f(int (&x)[N]);
8716 Here, we are trying to unify the range type, which
8717 looks like [0 ... (N - 1)]. */
8719 t1
= TREE_OPERAND (parm
, 0);
8720 t2
= TREE_OPERAND (parm
, 1);
8722 t
= fold (build (PLUS_EXPR
, integer_type_node
, arg
, t2
));
8724 return unify (tparms
, targs
, t1
, t
, strict
);
8726 /* else fall through */
8729 if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (TREE_CODE (parm
))))
8730 /* We're looking at an expression. This can happen with
8734 void foo(S<I>, S<I + 2>);
8736 This is a "nondeduced context":
8740 The nondeduced contexts are:
8742 --A type that is a template-id in which one or more of
8743 the template-arguments is an expression that references
8744 a template-parameter.
8746 In these cases, we assume deduction succeeded, but don't
8747 actually infer any unifications. */
8750 sorry ("use of `%s' in template type unification",
8751 tree_code_name
[(int) TREE_CODE (parm
)]);
8757 /* Called if RESULT is explicitly instantiated, or is a member of an
8758 explicitly instantiated class, or if using -frepo and the
8759 instantiation of RESULT has been assigned to this file. */
8762 mark_decl_instantiated (result
, extern_p
)
8766 if (TREE_CODE (result
) != FUNCTION_DECL
)
8767 /* The TREE_PUBLIC flag for function declarations will have been
8768 set correctly by tsubst. */
8769 TREE_PUBLIC (result
) = 1;
8771 /* We used to set this unconditionally; we moved that to
8772 do_decl_instantiation so it wouldn't get set on members of
8773 explicit class template instantiations. But we still need to set
8774 it here for the 'extern template' case in order to suppress
8775 implicit instantiations. */
8777 SET_DECL_EXPLICIT_INSTANTIATION (result
);
8781 DECL_INTERFACE_KNOWN (result
) = 1;
8782 DECL_NOT_REALLY_EXTERN (result
) = 1;
8784 /* Always make artificials weak. */
8785 if (DECL_ARTIFICIAL (result
) && flag_weak
)
8786 comdat_linkage (result
);
8787 /* For WIN32 we also want to put explicit instantiations in
8788 linkonce sections. */
8789 else if (TREE_PUBLIC (result
))
8790 maybe_make_one_only (result
);
8792 else if (TREE_CODE (result
) == FUNCTION_DECL
)
8796 /* Given two function templates PAT1 and PAT2, and explicit template
8797 arguments EXPLICIT_ARGS return:
8799 1 if PAT1 is more specialized than PAT2 as described in [temp.func.order].
8800 -1 if PAT2 is more specialized than PAT1.
8801 0 if neither is more specialized. */
8804 more_specialized (pat1
, pat2
, explicit_args
)
8805 tree pat1
, pat2
, explicit_args
;
8811 = get_bindings_overload (pat1
, DECL_TEMPLATE_RESULT (pat2
), explicit_args
);
8816 = get_bindings_overload (pat2
, DECL_TEMPLATE_RESULT (pat1
), explicit_args
);
8823 /* Given two class template specialization list nodes PAT1 and PAT2, return:
8825 1 if PAT1 is more specialized than PAT2 as described in [temp.class.order].
8826 -1 if PAT2 is more specialized than PAT1.
8827 0 if neither is more specialized. */
8830 more_specialized_class (pat1
, pat2
)
8836 targs
= get_class_bindings (TREE_VALUE (pat1
), TREE_PURPOSE (pat1
),
8837 TREE_PURPOSE (pat2
));
8841 targs
= get_class_bindings (TREE_VALUE (pat2
), TREE_PURPOSE (pat2
),
8842 TREE_PURPOSE (pat1
));
8849 /* Return the template arguments that will produce the function signature
8850 DECL from the function template FN, with the explicit template
8851 arguments EXPLICIT_ARGS. If CHECK_RETTYPE is 1, the return type must
8852 also match. Return NULL_TREE if no satisfactory arguments could be
8856 get_bindings_real (fn
, decl
, explicit_args
, check_rettype
)
8857 tree fn
, decl
, explicit_args
;
8860 int ntparms
= DECL_NTPARMS (fn
);
8861 tree targs
= make_tree_vec (ntparms
);
8863 tree decl_arg_types
;
8866 /* Substitute the explicit template arguments into the type of DECL.
8867 The call to fn_type_unification will handle substitution into the
8869 decl_type
= TREE_TYPE (decl
);
8870 if (explicit_args
&& uses_template_parms (decl_type
))
8873 tree converted_args
;
8875 if (DECL_TEMPLATE_INFO (decl
))
8876 tmpl
= DECL_TI_TEMPLATE (decl
);
8878 /* We can get here for some illegal specializations. */
8882 = (coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (tmpl
),
8883 explicit_args
, NULL_TREE
,
8885 /*require_all_arguments=*/0));
8886 if (converted_args
== error_mark_node
)
8889 decl_type
= tsubst (decl_type
, converted_args
, /*complain=*/0,
8891 if (decl_type
== error_mark_node
)
8895 /* If FN is a static member function, adjust the type of DECL
8897 decl_arg_types
= TYPE_ARG_TYPES (decl_type
);
8898 if (DECL_STATIC_FUNCTION_P (fn
)
8899 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
8900 decl_arg_types
= TREE_CHAIN (decl_arg_types
);
8902 i
= fn_type_unification (fn
, explicit_args
, targs
,
8904 (check_rettype
|| DECL_CONV_FN_P (fn
)
8905 ? TREE_TYPE (decl_type
) : NULL_TREE
),
8914 /* For most uses, we want to check the return type. */
8917 get_bindings (fn
, decl
, explicit_args
)
8918 tree fn
, decl
, explicit_args
;
8920 return get_bindings_real (fn
, decl
, explicit_args
, 1);
8923 /* But for more_specialized, we only care about the parameter types. */
8926 get_bindings_overload (fn
, decl
, explicit_args
)
8927 tree fn
, decl
, explicit_args
;
8929 return get_bindings_real (fn
, decl
, explicit_args
, 0);
8932 /* Return the innermost template arguments that, when applied to a
8933 template specialization whose innermost template parameters are
8934 TPARMS, and whose specialization arguments are ARGS, yield the
8937 For example, suppose we have:
8939 template <class T, class U> struct S {};
8940 template <class T> struct S<T*, int> {};
8942 Then, suppose we want to get `S<double*, int>'. The TPARMS will be
8943 {T}, the PARMS will be {T*, int} and the ARGS will be {double*,
8944 int}. The resulting vector will be {double}, indicating that `T'
8945 is bound to `double'. */
8948 get_class_bindings (tparms
, parms
, args
)
8949 tree tparms
, parms
, args
;
8951 int i
, ntparms
= TREE_VEC_LENGTH (tparms
);
8952 tree vec
= make_tree_vec (ntparms
);
8954 args
= INNERMOST_TEMPLATE_ARGS (args
);
8956 if (unify (tparms
, vec
, parms
, args
, UNIFY_ALLOW_NONE
))
8959 for (i
= 0; i
< ntparms
; ++i
)
8960 if (! TREE_VEC_ELT (vec
, i
))
8966 /* In INSTANTIATIONS is a list of <INSTANTIATION, TEMPLATE> pairs.
8967 Pick the most specialized template, and return the corresponding
8968 instantiation, or if there is no corresponding instantiation, the
8969 template itself. EXPLICIT_ARGS is any template arguments explicity
8970 mentioned in a template-id. If there is no most specialized
8971 template, error_mark_node is returned. If there are no templates
8972 at all, NULL_TREE is returned. */
8975 most_specialized_instantiation (instantiations
, explicit_args
)
8976 tree instantiations
;
8982 if (!instantiations
)
8985 champ
= instantiations
;
8986 for (fn
= TREE_CHAIN (instantiations
); fn
; fn
= TREE_CHAIN (fn
))
8988 fate
= more_specialized (TREE_VALUE (champ
),
8989 TREE_VALUE (fn
), explicit_args
);
8996 fn
= TREE_CHAIN (fn
);
8998 return error_mark_node
;
9004 for (fn
= instantiations
; fn
&& fn
!= champ
; fn
= TREE_CHAIN (fn
))
9006 fate
= more_specialized (TREE_VALUE (champ
),
9007 TREE_VALUE (fn
), explicit_args
);
9009 return error_mark_node
;
9012 return TREE_PURPOSE (champ
) ? TREE_PURPOSE (champ
) : TREE_VALUE (champ
);
9015 /* Return the most specialized of the list of templates in FNS that can
9016 produce an instantiation matching DECL, given the explicit template
9017 arguments EXPLICIT_ARGS. */
9020 most_specialized (fns
, decl
, explicit_args
)
9021 tree fns
, decl
, explicit_args
;
9023 tree candidates
= NULL_TREE
;
9026 for (fn
= fns
; fn
; fn
= TREE_CHAIN (fn
))
9028 tree candidate
= TREE_VALUE (fn
);
9030 args
= get_bindings (candidate
, decl
, explicit_args
);
9032 candidates
= tree_cons (NULL_TREE
, candidate
, candidates
);
9035 return most_specialized_instantiation (candidates
, explicit_args
);
9038 /* If DECL is a specialization of some template, return the most
9039 general such template. Otherwise, returns NULL_TREE.
9043 template <class T> struct S { template <class U> void f(U); };
9045 if TMPL is `template <class U> void S<int>::f(U)' this will return
9046 the full template. This function will not trace past partial
9047 specializations, however. For example, given in addition:
9049 template <class T> struct S<T*> { template <class U> void f(U); };
9051 if TMPL is `template <class U> void S<int*>::f(U)' this will return
9052 `template <class T> template <class U> S<T*>::f(U)'. */
9055 most_general_template (decl
)
9058 /* If DECL is a FUNCTION_DECL, find the TEMPLATE_DECL of which it is
9059 an immediate specialization. */
9060 if (TREE_CODE (decl
) == FUNCTION_DECL
)
9062 if (DECL_TEMPLATE_INFO (decl
)) {
9063 decl
= DECL_TI_TEMPLATE (decl
);
9065 /* The DECL_TI_TEMPLATE can be an IDENTIFIER_NODE for a
9067 if (TREE_CODE (decl
) != TEMPLATE_DECL
)
9073 /* Look for more and more general templates. */
9074 while (DECL_TEMPLATE_INFO (decl
))
9076 /* The DECL_TI_TEMPLATE can be a LOOKUP_EXPR or IDENTIFIER_NODE
9077 in some cases. (See cp-tree.h for details.) */
9078 if (TREE_CODE (DECL_TI_TEMPLATE (decl
)) != TEMPLATE_DECL
)
9081 /* Stop if we run into an explicitly specialized class template. */
9082 if (!DECL_NAMESPACE_SCOPE_P (decl
)
9083 && DECL_CONTEXT (decl
)
9084 && CLASSTYPE_TEMPLATE_SPECIALIZATION (DECL_CONTEXT (decl
)))
9087 decl
= DECL_TI_TEMPLATE (decl
);
9093 /* Return the most specialized of the class template specializations
9094 of TMPL which can produce an instantiation matching ARGS, or
9095 error_mark_node if the choice is ambiguous. */
9098 most_specialized_class (tmpl
, args
)
9102 tree list
= NULL_TREE
;
9107 tmpl
= most_general_template (tmpl
);
9108 for (t
= DECL_TEMPLATE_SPECIALIZATIONS (tmpl
); t
; t
= TREE_CHAIN (t
))
9111 = get_class_bindings (TREE_VALUE (t
), TREE_PURPOSE (t
), args
);
9114 list
= decl_tree_cons (TREE_PURPOSE (t
), TREE_VALUE (t
), list
);
9115 TREE_TYPE (list
) = TREE_TYPE (t
);
9125 for (; t
; t
= TREE_CHAIN (t
))
9127 fate
= more_specialized_class (champ
, t
);
9136 return error_mark_node
;
9142 for (t
= list
; t
&& t
!= champ
; t
= TREE_CHAIN (t
))
9144 fate
= more_specialized_class (champ
, t
);
9146 return error_mark_node
;
9152 /* called from the parser. */
9155 do_decl_instantiation (declspecs
, declarator
, storage
)
9156 tree declspecs
, declarator
, storage
;
9158 tree decl
= grokdeclarator (declarator
, declspecs
, NORMAL
, 0, NULL_TREE
);
9159 tree result
= NULL_TREE
;
9163 /* An error ocurred, for which grokdeclarator has already issued
9164 an appropriate message. */
9166 else if (! DECL_LANG_SPECIFIC (decl
))
9168 cp_error ("explicit instantiation of non-template `%#D'", decl
);
9171 else if (TREE_CODE (decl
) == VAR_DECL
)
9173 /* There is an asymmetry here in the way VAR_DECLs and
9174 FUNCTION_DECLs are handled by grokdeclarator. In the case of
9175 the latter, the DECL we get back will be marked as a
9176 template instantiation, and the appropriate
9177 DECL_TEMPLATE_INFO will be set up. This does not happen for
9178 VAR_DECLs so we do the lookup here. Probably, grokdeclarator
9179 should handle VAR_DECLs as it currently handles
9181 result
= lookup_field (DECL_CONTEXT (decl
), DECL_NAME (decl
), 0, 0);
9182 if (result
&& TREE_CODE (result
) != VAR_DECL
)
9184 cp_error ("no matching template for `%D' found", result
);
9188 else if (TREE_CODE (decl
) != FUNCTION_DECL
)
9190 cp_error ("explicit instantiation of `%#D'", decl
);
9196 /* Check for various error cases. Note that if the explicit
9197 instantiation is legal the RESULT will currently be marked as an
9198 *implicit* instantiation; DECL_EXPLICIT_INSTANTIATION is not set
9199 until we get here. */
9201 if (DECL_TEMPLATE_SPECIALIZATION (result
))
9205 No program shall both explicitly instantiate and explicitly
9206 specialize a template. */
9207 cp_pedwarn ("explicit instantiation of `%#D' after", result
);
9208 cp_pedwarn_at ("explicit specialization here", result
);
9211 else if (DECL_EXPLICIT_INSTANTIATION (result
))
9215 No program shall explicitly instantiate any template more
9218 We check DECL_INTERFACE_KNOWN so as not to complain when the first
9219 instantiation was `extern' and the second is not, and EXTERN_P for
9220 the opposite case. If -frepo, chances are we already got marked
9221 as an explicit instantion because of the repo file. */
9222 if (DECL_INTERFACE_KNOWN (result
) && !extern_p
&& !flag_use_repository
)
9223 cp_pedwarn ("duplicate explicit instantiation of `%#D'", result
);
9225 /* If we've already instantiated the template, just return now. */
9226 if (DECL_INTERFACE_KNOWN (result
))
9229 else if (!DECL_IMPLICIT_INSTANTIATION (result
))
9231 cp_error ("no matching template for `%D' found", result
);
9234 else if (!DECL_TEMPLATE_INFO (result
))
9236 cp_pedwarn ("explicit instantiation of non-template `%#D'", result
);
9240 if (flag_external_templates
)
9243 if (storage
== NULL_TREE
)
9245 else if (storage
== ridpointers
[(int) RID_EXTERN
])
9248 cp_pedwarn ("ISO C++ forbids the use of `extern' on explicit instantiations");
9252 cp_error ("storage class `%D' applied to template instantiation",
9255 SET_DECL_EXPLICIT_INSTANTIATION (result
);
9256 mark_decl_instantiated (result
, extern_p
);
9257 repo_template_instantiated (result
, extern_p
);
9259 instantiate_decl (result
, /*defer_ok=*/1);
9263 mark_class_instantiated (t
, extern_p
)
9267 SET_CLASSTYPE_EXPLICIT_INSTANTIATION (t
);
9268 SET_CLASSTYPE_INTERFACE_KNOWN (t
);
9269 CLASSTYPE_INTERFACE_ONLY (t
) = extern_p
;
9270 CLASSTYPE_VTABLE_NEEDS_WRITING (t
) = ! extern_p
;
9271 TYPE_DECL_SUPPRESS_DEBUG (TYPE_NAME (t
)) = extern_p
;
9274 CLASSTYPE_DEBUG_REQUESTED (t
) = 1;
9275 rest_of_type_compilation (t
, 1);
9279 /* Perform an explicit instantiation of template class T. STORAGE, if
9280 non-null, is the RID for extern, inline or static. COMPLAIN is
9281 non-zero if this is called from the parser, zero if called recursively,
9282 since the standard is unclear (as detailed below). */
9285 do_type_instantiation (t
, storage
, complain
)
9293 if (TREE_CODE (t
) == TYPE_DECL
)
9296 if (! CLASS_TYPE_P (t
) || ! CLASSTYPE_TEMPLATE_INFO (t
))
9298 cp_error ("explicit instantiation of non-template type `%T'", t
);
9304 /* With -fexternal-templates, explicit instantiations are treated the same
9305 as implicit ones. */
9306 if (flag_external_templates
)
9309 if (!COMPLETE_TYPE_P (t
))
9312 cp_error ("explicit instantiation of `%#T' before definition of template",
9317 if (storage
!= NULL_TREE
)
9320 cp_pedwarn("ISO C++ forbids the use of `%s' on explicit instantiations",
9321 IDENTIFIER_POINTER (storage
));
9323 if (storage
== ridpointers
[(int) RID_INLINE
])
9325 else if (storage
== ridpointers
[(int) RID_EXTERN
])
9327 else if (storage
== ridpointers
[(int) RID_STATIC
])
9331 cp_error ("storage class `%D' applied to template instantiation",
9337 if (CLASSTYPE_TEMPLATE_SPECIALIZATION (t
))
9341 No program shall both explicitly instantiate and explicitly
9342 specialize a template. */
9345 cp_error ("explicit instantiation of `%#T' after", t
);
9346 cp_error_at ("explicit specialization here", t
);
9350 else if (CLASSTYPE_EXPLICIT_INSTANTIATION (t
))
9354 No program shall explicitly instantiate any template more
9357 If CLASSTYPE_INTERFACE_ONLY, then the first explicit instantiation
9358 was `extern'. If EXTERN_P then the second is. If -frepo, chances
9359 are we already got marked as an explicit instantion because of the
9360 repo file. All these cases are OK. */
9361 if (!CLASSTYPE_INTERFACE_ONLY (t
) && !extern_p
&& !flag_use_repository
9363 cp_pedwarn ("duplicate explicit instantiation of `%#T'", t
);
9365 /* If we've already instantiated the template, just return now. */
9366 if (!CLASSTYPE_INTERFACE_ONLY (t
))
9370 mark_class_instantiated (t
, extern_p
);
9371 repo_template_instantiated (t
, extern_p
);
9379 /* In contrast to implicit instantiation, where only the
9380 declarations, and not the definitions, of members are
9381 instantiated, we have here:
9385 The explicit instantiation of a class template specialization
9386 implies the instantiation of all of its members not
9387 previously explicitly specialized in the translation unit
9388 containing the explicit instantiation.
9390 Of course, we can't instantiate member template classes, since
9391 we don't have any arguments for them. Note that the standard
9392 is unclear on whether the instatiation of the members are
9393 *explicit* instantiations or not. We choose to be generous,
9394 and not set DECL_EXPLICIT_INSTANTIATION. Therefore, we allow
9395 the explicit instantiation of a class where some of the members
9396 have no definition in the current translation unit. */
9399 for (tmp
= TYPE_METHODS (t
); tmp
; tmp
= TREE_CHAIN (tmp
))
9400 if (TREE_CODE (tmp
) == FUNCTION_DECL
9401 && DECL_TEMPLATE_INSTANTIATION (tmp
))
9403 mark_decl_instantiated (tmp
, extern_p
);
9404 repo_template_instantiated (tmp
, extern_p
);
9406 instantiate_decl (tmp
, /*defer_ok=*/1);
9409 for (tmp
= TYPE_FIELDS (t
); tmp
; tmp
= TREE_CHAIN (tmp
))
9410 if (TREE_CODE (tmp
) == VAR_DECL
&& DECL_TEMPLATE_INSTANTIATION (tmp
))
9412 mark_decl_instantiated (tmp
, extern_p
);
9413 repo_template_instantiated (tmp
, extern_p
);
9415 instantiate_decl (tmp
, /*defer_ok=*/1);
9418 for (tmp
= CLASSTYPE_TAGS (t
); tmp
; tmp
= TREE_CHAIN (tmp
))
9419 if (IS_AGGR_TYPE (TREE_VALUE (tmp
))
9420 && !uses_template_parms (CLASSTYPE_TI_ARGS (TREE_VALUE (tmp
))))
9421 do_type_instantiation (TYPE_MAIN_DECL (TREE_VALUE (tmp
)), storage
, 0);
9425 /* Given a function DECL, which is a specialization of TMPL, modify
9426 DECL to be a re-instantiation of TMPL with the same template
9427 arguments. TMPL should be the template into which tsubst'ing
9428 should occur for DECL, not the most general template.
9430 One reason for doing this is a scenario like this:
9433 void f(const T&, int i);
9435 void g() { f(3, 7); }
9438 void f(const T& t, const int i) { }
9440 Note that when the template is first instantiated, with
9441 instantiate_template, the resulting DECL will have no name for the
9442 first parameter, and the wrong type for the second. So, when we go
9443 to instantiate the DECL, we regenerate it. */
9446 regenerate_decl_from_template (decl
, tmpl
)
9450 /* The most general version of TMPL. */
9452 /* The arguments used to instantiate DECL, from the most general
9459 args
= DECL_TI_ARGS (decl
);
9460 code_pattern
= DECL_TEMPLATE_RESULT (tmpl
);
9462 /* Unregister the specialization so that when we tsubst we will not
9463 just return DECL. We don't have to unregister DECL from TMPL
9464 because if would only be registered there if it were a partial
9465 instantiation of a specialization, which it isn't: it's a full
9467 gen_tmpl
= most_general_template (tmpl
);
9468 unregistered
= unregister_specialization (decl
, gen_tmpl
);
9470 /* If the DECL was not unregistered then something peculiar is
9471 happening: we created a specialization but did not call
9472 register_specialization for it. */
9473 my_friendly_assert (unregistered
, 0);
9475 if (TREE_CODE (decl
) == VAR_DECL
)
9476 /* Make sure that we can see identifiers, and compute access
9477 correctly, for the class members used in the declaration of
9478 this static variable. */
9479 pushclass (DECL_CONTEXT (decl
), 2);
9481 /* Do the substitution to get the new declaration. */
9482 new_decl
= tsubst (code_pattern
, args
, /*complain=*/1, NULL_TREE
);
9484 if (TREE_CODE (decl
) == VAR_DECL
)
9486 /* Set up DECL_INITIAL, since tsubst doesn't. */
9487 DECL_INITIAL (new_decl
) =
9488 tsubst_expr (DECL_INITIAL (code_pattern
), args
,
9489 /*complain=*/1, DECL_TI_TEMPLATE (decl
));
9490 /* Pop the class context we pushed above. */
9493 else if (TREE_CODE (decl
) == FUNCTION_DECL
)
9495 /* Convince duplicate_decls to use the DECL_ARGUMENTS from the
9497 DECL_INITIAL (new_decl
) = error_mark_node
;
9498 /* And don't complain about a duplicate definition. */
9499 DECL_INITIAL (decl
) = NULL_TREE
;
9502 /* The immediate parent of the new template is still whatever it was
9503 before, even though tsubst sets DECL_TI_TEMPLATE up as the most
9504 general template. We also reset the DECL_ASSEMBLER_NAME since
9505 tsubst always calculates the name as if the function in question
9506 were really a template instance, and sometimes, with friend
9507 functions, this is not so. See tsubst_friend_function for
9509 DECL_TI_TEMPLATE (new_decl
) = DECL_TI_TEMPLATE (decl
);
9510 DECL_ASSEMBLER_NAME (new_decl
) = DECL_ASSEMBLER_NAME (decl
);
9511 DECL_RTL (new_decl
) = DECL_RTL (decl
);
9512 DECL_USE_TEMPLATE (new_decl
) = DECL_USE_TEMPLATE (decl
);
9514 /* Call duplicate decls to merge the old and new declarations. */
9515 duplicate_decls (new_decl
, decl
);
9517 /* Now, re-register the specialization. */
9518 register_specialization (decl
, gen_tmpl
, args
);
9521 /* Produce the definition of D, a _DECL generated from a template. If
9522 DEFER_OK is non-zero, then we don't have to actually do the
9523 instantiation now; we just have to do it sometime. */
9526 instantiate_decl (d
, defer_ok
)
9530 tree tmpl
= DECL_TI_TEMPLATE (d
);
9531 tree args
= DECL_TI_ARGS (d
);
9536 int pattern_defined
;
9538 const char *file
= input_filename
;
9540 /* This function should only be used to instantiate templates for
9541 functions and static member variables. */
9542 my_friendly_assert (TREE_CODE (d
) == FUNCTION_DECL
9543 || TREE_CODE (d
) == VAR_DECL
, 0);
9545 /* Don't instantiate cloned functions. Instead, instantiate the
9546 functions they cloned. */
9547 if (TREE_CODE (d
) == FUNCTION_DECL
&& DECL_CLONED_FUNCTION_P (d
))
9548 d
= DECL_CLONED_FUNCTION (d
);
9550 if (DECL_TEMPLATE_INSTANTIATED (d
))
9551 /* D has already been instantiated. It might seem reasonable to
9552 check whether or not D is an explict instantiation, and, if so,
9553 stop here. But when an explicit instantiation is deferred
9554 until the end of the compilation, DECL_EXPLICIT_INSTANTIATION
9555 is set, even though we still need to do the instantiation. */
9558 /* If we already have a specialization of this declaration, then
9559 there's no reason to instantiate it. Note that
9560 retrieve_specialization gives us both instantiations and
9561 specializations, so we must explicitly check
9562 DECL_TEMPLATE_SPECIALIZATION. */
9563 gen_tmpl
= most_general_template (tmpl
);
9564 spec
= retrieve_specialization (gen_tmpl
, args
);
9565 if (spec
!= NULL_TREE
&& DECL_TEMPLATE_SPECIALIZATION (spec
))
9568 /* This needs to happen before any tsubsting. */
9569 if (! push_tinst_level (d
))
9572 timevar_push (TV_PARSE
);
9574 /* Set TD to the template whose DECL_TEMPLATE_RESULT is the pattern
9575 for the instantiation. This is not always the most general
9576 template. Consider, for example:
9579 struct S { template <class U> void f();
9580 template <> void f<int>(); };
9582 and an instantiation of S<double>::f<int>. We want TD to be the
9583 specialization S<T>::f<int>, not the more general S<T>::f<U>. */
9585 while (/* An instantiation cannot have a definition, so we need a
9586 more general template. */
9587 DECL_TEMPLATE_INSTANTIATION (td
)
9588 /* We must also deal with friend templates. Given:
9590 template <class T> struct S {
9591 template <class U> friend void f() {};
9594 S<int>::f<U> say, is not an instantiation of S<T>::f<U>,
9595 so far as the language is concerned, but that's still
9596 where we get the pattern for the instantiation from. On
9597 ther hand, if the definition comes outside the class, say:
9599 template <class T> struct S {
9600 template <class U> friend void f();
9602 template <class U> friend void f() {}
9604 we don't need to look any further. That's what the check for
9605 DECL_INITIAL is for. */
9606 || (TREE_CODE (d
) == FUNCTION_DECL
9607 && DECL_FRIEND_PSEUDO_TEMPLATE_INSTANTIATION (td
)
9608 && !DECL_INITIAL (DECL_TEMPLATE_RESULT (td
))))
9610 /* The present template, TD, should not be a definition. If it
9611 were a definition, we should be using it! Note that we
9612 cannot restructure the loop to just keep going until we find
9613 a template with a definition, since that might go too far if
9614 a specialization was declared, but not defined. */
9615 my_friendly_assert (!(TREE_CODE (d
) == VAR_DECL
9616 && !DECL_IN_AGGR_P (DECL_TEMPLATE_RESULT (td
))),
9619 /* Fetch the more general template. */
9620 td
= DECL_TI_TEMPLATE (td
);
9623 code_pattern
= DECL_TEMPLATE_RESULT (td
);
9625 if (TREE_CODE (d
) == FUNCTION_DECL
)
9626 pattern_defined
= (DECL_SAVED_TREE (code_pattern
) != NULL_TREE
);
9628 pattern_defined
= ! DECL_IN_AGGR_P (code_pattern
);
9630 push_to_top_level ();
9631 lineno
= DECL_SOURCE_LINE (d
);
9632 input_filename
= DECL_SOURCE_FILE (d
);
9634 if (pattern_defined
)
9636 repo_template_used (d
);
9638 if (flag_external_templates
&& ! DECL_INTERFACE_KNOWN (d
))
9640 if (flag_alt_external_templates
)
9642 if (interface_unknown
)
9643 warn_if_unknown_interface (d
);
9645 else if (DECL_INTERFACE_KNOWN (code_pattern
))
9647 DECL_INTERFACE_KNOWN (d
) = 1;
9648 DECL_NOT_REALLY_EXTERN (d
) = ! DECL_EXTERNAL (code_pattern
);
9651 warn_if_unknown_interface (code_pattern
);
9655 import_export_decl (d
);
9658 /* Reject all external templates except inline functions. */
9659 if (DECL_INTERFACE_KNOWN (d
)
9660 && ! DECL_NOT_REALLY_EXTERN (d
)
9661 && ! (TREE_CODE (d
) == FUNCTION_DECL
&& DECL_INLINE (d
)))
9664 /* We need to set up DECL_INITIAL regardless of pattern_defined if
9665 the variable is a static const initialized in the class body. */
9666 if (TREE_CODE (d
) == VAR_DECL
9667 && TREE_READONLY (d
)
9668 && DECL_INITIAL (d
) == NULL_TREE
9669 && DECL_INITIAL (code_pattern
) != NULL_TREE
)
9671 /* Defer all other templates, unless we have been explicitly
9672 forbidden from doing so. We restore the source position here
9673 because it's used by add_pending_template. */
9674 else if (! pattern_defined
|| defer_ok
)
9677 input_filename
= file
;
9679 if (at_eof
&& !pattern_defined
9680 && DECL_EXPLICIT_INSTANTIATION (d
))
9683 The definition of a non-exported function template, a
9684 non-exported member function template, or a non-exported
9685 member function or static data member of a class template
9686 shall be present in every translation unit in which it is
9687 explicitly instantiated. */
9688 cp_error ("explicit instantiation of `%D' but no definition available",
9691 add_pending_template (d
);
9695 /* We're now committed to instantiating this template. Mark it as
9696 instantiated so that recursive calls to instantiate_decl do not
9697 try to instantiate it again. */
9698 DECL_TEMPLATE_INSTANTIATED (d
) = 1;
9700 /* Regenerate the declaration in case the template has been modified
9701 by a subsequent redeclaration. */
9702 regenerate_decl_from_template (d
, td
);
9704 /* We already set the file and line above. Reset them now in case
9705 they changed as a result of calling regenerate_decl_from_template. */
9706 lineno
= DECL_SOURCE_LINE (d
);
9707 input_filename
= DECL_SOURCE_FILE (d
);
9709 if (TREE_CODE (d
) == VAR_DECL
)
9711 DECL_IN_AGGR_P (d
) = 0;
9712 if (DECL_INTERFACE_KNOWN (d
))
9713 DECL_EXTERNAL (d
) = ! DECL_NOT_REALLY_EXTERN (d
);
9716 DECL_EXTERNAL (d
) = 1;
9717 DECL_NOT_REALLY_EXTERN (d
) = 1;
9719 cp_finish_decl (d
, DECL_INITIAL (d
), NULL_TREE
, 0);
9721 else if (TREE_CODE (d
) == FUNCTION_DECL
)
9723 htab_t saved_local_specializations
;
9725 /* Save away the current list, in case we are instantiating one
9726 template from within the body of another. */
9727 saved_local_specializations
= local_specializations
;
9729 /* Set up the list of local specializations. */
9730 local_specializations
= htab_create (37,
9735 /* Set up context. */
9736 start_function (NULL_TREE
, d
, NULL_TREE
, SF_PRE_PARSED
);
9737 store_parm_decls ();
9739 /* We already set up __FUNCTION__, etc., so we don't want to do
9741 cp_function_chain
->name_declared
= 1;
9743 /* Substitute into the body of the function. */
9744 tsubst_expr (DECL_SAVED_TREE (code_pattern
), args
,
9745 /*complain=*/1, tmpl
);
9747 /* We don't need the local specializations any more. */
9748 htab_delete (local_specializations
);
9749 local_specializations
= saved_local_specializations
;
9751 /* Finish the function. */
9752 expand_body (finish_function (0));
9755 /* We're not deferring instantiation any more. */
9756 TI_PENDING_TEMPLATE_FLAG (DECL_TEMPLATE_INFO (d
)) = 0;
9760 input_filename
= file
;
9762 pop_from_top_level ();
9765 timevar_pop (TV_PARSE
);
9770 /* Run through the list of templates that we wish we could
9771 instantiate, and instantiate any we can. */
9774 instantiate_pending_templates ()
9777 int instantiated_something
= 0;
9784 t
= &pending_templates
;
9787 tree instantiation
= TREE_VALUE (*t
);
9789 reopen_tinst_level (TREE_PURPOSE (*t
));
9791 if (TYPE_P (instantiation
))
9795 if (!COMPLETE_TYPE_P (instantiation
))
9797 instantiate_class_template (instantiation
);
9798 if (CLASSTYPE_TEMPLATE_INSTANTIATION (instantiation
))
9799 for (fn
= TYPE_METHODS (instantiation
);
9801 fn
= TREE_CHAIN (fn
))
9802 if (! DECL_ARTIFICIAL (fn
))
9803 instantiate_decl (fn
, /*defer_ok=*/0);
9804 if (COMPLETE_TYPE_P (instantiation
))
9806 instantiated_something
= 1;
9811 if (COMPLETE_TYPE_P (instantiation
))
9812 /* If INSTANTIATION has been instantiated, then we don't
9813 need to consider it again in the future. */
9814 *t
= TREE_CHAIN (*t
);
9816 t
= &TREE_CHAIN (*t
);
9820 if (!DECL_TEMPLATE_SPECIALIZATION (instantiation
)
9821 && !DECL_TEMPLATE_INSTANTIATED (instantiation
))
9823 instantiation
= instantiate_decl (instantiation
,
9825 if (DECL_TEMPLATE_INSTANTIATED (instantiation
))
9827 instantiated_something
= 1;
9832 if (DECL_TEMPLATE_SPECIALIZATION (instantiation
)
9833 || DECL_TEMPLATE_INSTANTIATED (instantiation
))
9834 /* If INSTANTIATION has been instantiated, then we don't
9835 need to consider it again in the future. */
9836 *t
= TREE_CHAIN (*t
);
9838 t
= &TREE_CHAIN (*t
);
9841 current_tinst_level
= NULL_TREE
;
9845 /* Go through the things that are template instantiations if we are
9846 using guiding declarations. */
9847 t
= &maybe_templates
;
9854 fn
= TREE_VALUE (*t
);
9856 if (DECL_INITIAL (fn
))
9857 /* If the FN is already defined, then it was either already
9858 instantiated or, even though guiding declarations were
9859 allowed, a non-template definition was provided. */
9863 template = TREE_PURPOSE (*t
);
9864 args
= get_bindings (template, fn
, NULL_TREE
);
9865 fn
= instantiate_template (template, args
);
9866 instantiate_decl (fn
, /*defer_ok=*/0);
9870 /* Remove this entry from the chain. */
9871 *t
= TREE_CHAIN (*t
);
9873 maybe_template_tail
= t
;
9877 return instantiated_something
;
9880 /* Substitute ARGVEC into T, which is a list of initializers for
9881 either base class or a non-static data member. The TREE_PURPOSEs
9882 are DECLs, and the TREE_VALUEs are the initializer values. Used by
9883 instantiate_decl. */
9886 tsubst_initializer_list (t
, argvec
)
9889 tree first
= NULL_TREE
;
9892 for (; t
; t
= TREE_CHAIN (t
))
9898 decl
= tsubst_copy (TREE_PURPOSE (t
), argvec
, /*complain=*/1,
9900 init
= tsubst_expr (TREE_VALUE (t
), argvec
, /*complain=*/1,
9905 else if (TREE_CODE (init
) == TREE_LIST
)
9906 for (val
= init
; val
; val
= TREE_CHAIN (val
))
9907 TREE_VALUE (val
) = convert_from_reference (TREE_VALUE (val
));
9909 init
= convert_from_reference (init
);
9911 *p
= build_tree_list (decl
, init
);
9912 p
= &TREE_CHAIN (*p
);
9917 /* D is an undefined function declaration in the presence of templates with
9918 the same name, listed in FNS. If one of them can produce D as an
9919 instantiation, remember this so we can instantiate it at EOF if D has
9920 not been defined by that time. */
9923 add_maybe_template (d
, fns
)
9928 if (DECL_MAYBE_TEMPLATE (d
))
9931 t
= most_specialized (fns
, d
, NULL_TREE
);
9934 if (t
== error_mark_node
)
9936 cp_error ("ambiguous template instantiation for `%D'", d
);
9940 *maybe_template_tail
= tree_cons (t
, d
, NULL_TREE
);
9941 maybe_template_tail
= &TREE_CHAIN (*maybe_template_tail
);
9942 DECL_MAYBE_TEMPLATE (d
) = 1;
9945 /* Set CURRENT_ACCESS_SPECIFIER based on the protection of DECL. */
9948 set_current_access_from_decl (decl
)
9951 if (TREE_PRIVATE (decl
))
9952 current_access_specifier
= access_private_node
;
9953 else if (TREE_PROTECTED (decl
))
9954 current_access_specifier
= access_protected_node
;
9956 current_access_specifier
= access_public_node
;
9959 /* Instantiate an enumerated type. TAG is the template type, NEWTAG
9960 is the instantiation (which should have been created with
9961 start_enum) and ARGS are the template arguments to use. */
9964 tsubst_enum (tag
, newtag
, args
)
9971 for (e
= TYPE_VALUES (tag
); e
; e
= TREE_CHAIN (e
))
9975 /* Note that in a template enum, the TREE_VALUE is the
9976 CONST_DECL, not the corresponding INTEGER_CST. */
9977 value
= tsubst_expr (DECL_INITIAL (TREE_VALUE (e
)),
9978 args
, /*complain=*/1,
9981 /* Give this enumeration constant the correct access. */
9982 set_current_access_from_decl (TREE_VALUE (e
));
9984 /* Actually build the enumerator itself. */
9985 build_enumerator (TREE_PURPOSE (e
), value
, newtag
);
9988 finish_enum (newtag
);
9991 /* DECL is a FUNCTION_DECL that is a template specialization. Return
9992 its type -- but without substituting the innermost set of template
9993 arguments. So, innermost set of template parameters will appear in
9994 the type. If CONTEXTP is non-NULL, then the partially substituted
9995 DECL_CONTEXT (if any) will also be filled in. Similarly, TPARMSP
9996 will be filled in with the substituted template parameters, if it
10000 get_mostly_instantiated_function_type (decl
, contextp
, tparmsp
)
10005 tree context
= NULL_TREE
;
10012 tmpl
= most_general_template (DECL_TI_TEMPLATE (decl
));
10013 targs
= DECL_TI_ARGS (decl
);
10014 tparms
= DECL_TEMPLATE_PARMS (tmpl
);
10015 parm_depth
= TMPL_PARMS_DEPTH (tparms
);
10017 /* There should be as many levels of arguments as there are levels
10019 my_friendly_assert (parm_depth
== TMPL_ARGS_DEPTH (targs
), 0);
10021 fn_type
= TREE_TYPE (tmpl
);
10022 if (DECL_STATIC_FUNCTION_P (decl
))
10023 context
= DECL_CONTEXT (decl
);
10025 if (parm_depth
== 1)
10026 /* No substitution is necessary. */
10033 /* Replace the innermost level of the TARGS with NULL_TREEs to
10034 let tsubst know not to subsitute for those parameters. */
10035 partial_args
= make_tree_vec (TREE_VEC_LENGTH (targs
));
10036 for (i
= 1; i
< TMPL_ARGS_DEPTH (targs
); ++i
)
10037 SET_TMPL_ARGS_LEVEL (partial_args
, i
,
10038 TMPL_ARGS_LEVEL (targs
, i
));
10039 SET_TMPL_ARGS_LEVEL (partial_args
,
10040 TMPL_ARGS_DEPTH (targs
),
10041 make_tree_vec (DECL_NTPARMS (tmpl
)));
10043 /* Now, do the (partial) substitution to figure out the
10044 appropriate function type. */
10045 fn_type
= tsubst (fn_type
, partial_args
, /*complain=*/1, NULL_TREE
);
10046 if (DECL_STATIC_FUNCTION_P (decl
))
10047 context
= tsubst (context
, partial_args
, /*complain=*/1, NULL_TREE
);
10049 /* Substitute into the template parameters to obtain the real
10050 innermost set of parameters. This step is important if the
10051 innermost set of template parameters contains value
10052 parameters whose types depend on outer template parameters. */
10053 TREE_VEC_LENGTH (partial_args
)--;
10054 tparms
= tsubst_template_parms (tparms
, partial_args
, /*complain=*/1);
10058 *contextp
= context
;
10065 /* Set the DECL_ASSEMBLER_NAME for DECL, which is a FUNCTION_DECL that
10066 is either an instantiation or specialization of a template
10070 set_mangled_name_for_template_decl (decl
)
10073 tree context
= NULL_TREE
;
10080 my_friendly_assert (TREE_CODE (decl
) == FUNCTION_DECL
, 0);
10081 my_friendly_assert (DECL_TEMPLATE_INFO (decl
) != NULL_TREE
, 0);
10083 /* Under the new ABI, we don't need special machinery. */
10086 set_mangled_name_for_decl (decl
);
10090 /* The names of template functions must be mangled so as to indicate
10091 what template is being specialized with what template arguments.
10092 For example, each of the following three functions must get
10093 different mangled names:
10096 template <> void f<7>(int);
10097 template <> void f<8>(int); */
10099 targs
= DECL_TI_ARGS (decl
);
10100 if (uses_template_parms (targs
))
10101 /* This DECL is for a partial instantiation. There's no need to
10102 mangle the name of such an entity. */
10105 /* We now compute the PARMS and RET_TYPE to give to
10106 build_decl_overload_real. The PARMS and RET_TYPE are the
10107 parameter and return types of the template, after all but the
10108 innermost template arguments have been substituted, not the
10109 parameter and return types of the function DECL. For example,
10112 template <class T> T f(T);
10114 both PARMS and RET_TYPE should be `T' even if DECL is `int f(int)'.
10115 A more subtle example is:
10117 template <class T> struct S { template <class U> void f(T, U); }
10119 Here, if DECL is `void S<int>::f(int, double)', PARMS should be
10120 {int, U}. Thus, the args that we want to subsitute into the
10121 return and parameter type for the function are those in TARGS,
10122 with the innermost level omitted. */
10123 fn_type
= get_mostly_instantiated_function_type (decl
, &context
, &tparms
);
10125 /* Now, get the innermost parameters and arguments, and figure out
10126 the parameter and return types. */
10127 tparms
= INNERMOST_TEMPLATE_PARMS (tparms
);
10128 targs
= INNERMOST_TEMPLATE_ARGS (targs
);
10129 ret_type
= TREE_TYPE (fn_type
);
10130 parm_types
= TYPE_ARG_TYPES (fn_type
);
10132 /* For a static member function, we generate a fake `this' pointer,
10133 for the purposes of mangling. This indicates of which class the
10134 function is a member. Because of:
10138 There shall not be a static and a nonstatic member function
10139 with the same name and the same parameter types
10141 we don't have to worry that this will result in a clash with a
10142 non-static member function. */
10143 if (DECL_STATIC_FUNCTION_P (decl
))
10144 parm_types
= hash_tree_chain (build_pointer_type (context
), parm_types
);
10146 /* There should be the same number of template parameters as
10147 template arguments. */
10148 my_friendly_assert (TREE_VEC_LENGTH (tparms
) == TREE_VEC_LENGTH (targs
),
10151 /* Actually set the DECL_ASSEMBLER_NAME. */
10152 DECL_ASSEMBLER_NAME (decl
)
10153 = build_decl_overload_real (decl
, parm_types
, ret_type
,
10155 DECL_FUNCTION_MEMBER_P (decl
)
10156 + DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (decl
));