1 /* Handle parameterized types (templates) for GNU C++.
2 Copyright (C) 1992, 93-97, 1998, 1999 Free Software Foundation, Inc.
3 Written by Ken Raeburn (raeburn@cygnus.com) while at Watchmaker Computing.
4 Rewritten by Jason Merrill (jason@cygnus.com).
6 This file is part of GNU CC.
8 GNU CC is free software; you can redistribute it and/or modify
9 it under the terms of the GNU General Public License as published by
10 the Free Software Foundation; either version 2, or (at your option)
13 GNU CC is distributed in the hope that it will be useful,
14 but WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 GNU General Public License for more details.
18 You should have received a copy of the GNU General Public License
19 along with GNU CC; see the file COPYING. If not, write to
20 the Free Software Foundation, 59 Temple Place - Suite 330,
21 Boston, MA 02111-1307, USA. */
23 /* Known bugs or deficiencies include:
25 all methods must be provided in header files; can't use a source
26 file that contains only the method templates and "just win". */
43 /* The type of functions taking a tree, and some additional data, and
45 typedef int (*tree_fn_t
) PROTO((tree
, void*));
47 extern struct obstack permanent_obstack
;
50 extern char *input_filename
;
51 struct pending_inline
*pending_template_expansions
;
53 tree current_template_parms
;
54 HOST_WIDE_INT processing_template_decl
;
56 tree pending_templates
;
57 static tree
*template_tail
= &pending_templates
;
60 static tree
*maybe_template_tail
= &maybe_templates
;
62 int minimal_parse_mode
;
64 int processing_specialization
;
65 int processing_explicit_instantiation
;
66 int processing_template_parmlist
;
67 static int template_header_count
;
69 static tree saved_trees
;
71 #define obstack_chunk_alloc xmalloc
72 #define obstack_chunk_free free
74 #define UNIFY_ALLOW_NONE 0
75 #define UNIFY_ALLOW_MORE_CV_QUAL 1
76 #define UNIFY_ALLOW_LESS_CV_QUAL 2
77 #define UNIFY_ALLOW_DERIVED 4
78 #define UNIFY_ALLOW_INTEGER 8
80 #define GTB_VIA_VIRTUAL 1 /* The base class we are examining is
81 virtual, or a base class of a virtual
83 #define GTB_IGNORE_TYPE 2 /* We don't need to try to unify the current
84 type with the desired type. */
86 static int resolve_overloaded_unification
PROTO((tree
, tree
, tree
, tree
,
87 unification_kind_t
, int));
88 static int try_one_overload
PROTO((tree
, tree
, tree
, tree
, tree
,
89 unification_kind_t
, int));
90 static int unify
PROTO((tree
, tree
, tree
, tree
, int));
91 static void add_pending_template
PROTO((tree
));
92 static int push_tinst_level
PROTO((tree
));
93 static tree classtype_mangled_name
PROTO((tree
));
94 static char *mangle_class_name_for_template
PROTO((char *, tree
, tree
));
95 static tree tsubst_expr_values
PROTO((tree
, tree
));
96 static int list_eq
PROTO((tree
, tree
));
97 static tree get_class_bindings
PROTO((tree
, tree
, tree
));
98 static tree coerce_template_parms
PROTO((tree
, tree
, tree
, int, int));
99 static void tsubst_enum
PROTO((tree
, tree
, tree
));
100 static tree add_to_template_args
PROTO((tree
, tree
));
101 static tree add_outermost_template_args
PROTO((tree
, tree
));
102 static void maybe_adjust_types_for_deduction
PROTO((unification_kind_t
, tree
*,
104 static int type_unification_real
PROTO((tree
, tree
, tree
, tree
,
105 int, unification_kind_t
, int));
106 static void note_template_header
PROTO((int));
107 static tree maybe_fold_nontype_arg
PROTO((tree
));
108 static tree convert_nontype_argument
PROTO((tree
, tree
));
109 static tree convert_template_argument
PROTO ((tree
, tree
, tree
, int,
111 static tree get_bindings_overload
PROTO((tree
, tree
, tree
));
112 static int for_each_template_parm
PROTO((tree
, tree_fn_t
, void*));
113 static tree build_template_parm_index
PROTO((int, int, int, tree
, tree
));
114 static int inline_needs_template_parms
PROTO((tree
));
115 static void push_inline_template_parms_recursive
PROTO((tree
, int));
116 static tree retrieve_specialization
PROTO((tree
, tree
));
117 static tree register_specialization
PROTO((tree
, tree
, tree
));
118 static int unregister_specialization
PROTO((tree
, tree
));
119 static tree reduce_template_parm_level
PROTO((tree
, tree
, int));
120 static tree build_template_decl
PROTO((tree
, tree
));
121 static int mark_template_parm
PROTO((tree
, void *));
122 static tree tsubst_friend_function
PROTO((tree
, tree
));
123 static tree tsubst_friend_class
PROTO((tree
, tree
));
124 static tree get_bindings_real
PROTO((tree
, tree
, tree
, int));
125 static int template_decl_level
PROTO((tree
));
126 static tree maybe_get_template_decl_from_type_decl
PROTO((tree
));
127 static int check_cv_quals_for_unify
PROTO((int, tree
, tree
));
128 static tree tsubst_template_arg_vector
PROTO((tree
, tree
, int));
129 static tree tsubst_template_parms
PROTO((tree
, tree
, int));
130 static void regenerate_decl_from_template
PROTO((tree
, tree
));
131 static tree most_specialized
PROTO((tree
, tree
, tree
));
132 static tree most_specialized_class
PROTO((tree
, tree
));
133 static tree most_general_template
PROTO((tree
));
134 static void set_mangled_name_for_template_decl
PROTO((tree
));
135 static int template_class_depth_real
PROTO((tree
, int));
136 static tree tsubst_aggr_type
PROTO((tree
, tree
, int, tree
, int));
137 static tree tsubst_decl
PROTO((tree
, tree
, tree
, tree
));
138 static tree tsubst_arg_types
PROTO((tree
, tree
, int, tree
));
139 static tree tsubst_function_type
PROTO((tree
, tree
, int, tree
));
140 static void check_specialization_scope
PROTO((void));
141 static tree process_partial_specialization
PROTO((tree
));
142 static void set_current_access_from_decl
PROTO((tree
));
143 static void check_default_tmpl_args
PROTO((tree
, tree
, int, int));
144 static tree tsubst_call_declarator_parms
PROTO((tree
, tree
, int, tree
));
145 static tree get_template_base_recursive
PROTO((tree
, tree
,
146 tree
, tree
, tree
, int));
147 static tree get_template_base
PROTO((tree
, tree
, tree
, tree
));
148 static tree try_class_unification
PROTO((tree
, tree
, tree
, tree
));
149 static int coerce_template_template_parms
PROTO((tree
, tree
, int,
151 static tree determine_specialization
PROTO((tree
, tree
, tree
*, int));
152 static int template_args_equal
PROTO((tree
, tree
));
153 static void print_template_context
PROTO((int));
155 /* We use TREE_VECs to hold template arguments. If there is only one
156 level of template arguments, then the TREE_VEC contains the
157 arguments directly. If there is more than one level of template
158 arguments, then each entry in the TREE_VEC is itself a TREE_VEC,
159 containing the template arguments for a single level. The first
160 entry in the outer TREE_VEC is the outermost level of template
161 parameters; the last is the innermost.
163 It is incorrect to ever form a template argument vector containing
164 only one level of arguments, but which is a TREE_VEC containing as
165 its only entry the TREE_VEC for that level. */
167 /* Non-zero if the template arguments is actually a vector of vectors,
168 rather than just a vector. */
169 #define TMPL_ARGS_HAVE_MULTIPLE_LEVELS(NODE) \
171 && TREE_CODE (NODE) == TREE_VEC \
172 && TREE_VEC_LENGTH (NODE) > 0 \
173 && TREE_VEC_ELT (NODE, 0) != NULL_TREE \
174 && TREE_CODE (TREE_VEC_ELT (NODE, 0)) == TREE_VEC)
176 /* The depth of a template argument vector. When called directly by
177 the parser, we use a TREE_LIST rather than a TREE_VEC to represent
178 template arguments. In fact, we may even see NULL_TREE if there
179 are no template arguments. In both of those cases, there is only
180 one level of template arguments. */
181 #define TMPL_ARGS_DEPTH(NODE) \
182 (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (NODE) ? TREE_VEC_LENGTH (NODE) : 1)
184 /* The LEVELth level of the template ARGS. Note that template
185 parameter levels are indexed from 1, not from 0. */
186 #define TMPL_ARGS_LEVEL(ARGS, LEVEL) \
187 (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (ARGS) \
188 ? TREE_VEC_ELT ((ARGS), (LEVEL) - 1) : ARGS)
190 /* Set the LEVELth level of the template ARGS to VAL. This macro does
191 not work with single-level argument vectors. */
192 #define SET_TMPL_ARGS_LEVEL(ARGS, LEVEL, VAL) \
193 (TREE_VEC_ELT ((ARGS), (LEVEL) - 1) = (VAL))
195 /* Accesses the IDXth parameter in the LEVELth level of the ARGS. */
196 #define TMPL_ARG(ARGS, LEVEL, IDX) \
197 (TREE_VEC_ELT (TMPL_ARGS_LEVEL (ARGS, LEVEL), IDX))
199 /* Set the IDXth element in the LEVELth level of ARGS to VAL. This
200 macro does not work with single-level argument vectors. */
201 #define SET_TMPL_ARG(ARGS, LEVEL, IDX, VAL) \
202 (TREE_VEC_ELT (TREE_VEC_ELT ((ARGS), (LEVEL) - 1), (IDX)) = (VAL))
204 /* Given a single level of template arguments in NODE, return the
205 number of arguments. */
206 #define NUM_TMPL_ARGS(NODE) \
207 ((NODE) == NULL_TREE ? 0 \
208 : (TREE_CODE (NODE) == TREE_VEC \
209 ? TREE_VEC_LENGTH (NODE) : list_length (NODE)))
211 /* The number of levels of template parameters given by NODE. */
212 #define TMPL_PARMS_DEPTH(NODE) \
213 (TREE_INT_CST_HIGH (TREE_PURPOSE (NODE)))
215 /* Do any processing required when DECL (a member template declaration
216 using TEMPLATE_PARAMETERS as its innermost parameter list) is
217 finished. Returns the TEMPLATE_DECL corresponding to DECL, unless
218 it is a specialization, in which case the DECL itself is returned. */
221 finish_member_template_decl (decl
)
224 if (decl
== NULL_TREE
|| decl
== void_type_node
)
226 else if (decl
== error_mark_node
)
227 /* By returning NULL_TREE, the parser will just ignore this
228 declaration. We have already issued the error. */
230 else if (TREE_CODE (decl
) == TREE_LIST
)
232 /* Assume that the class is the only declspec. */
233 decl
= TREE_VALUE (decl
);
234 if (IS_AGGR_TYPE (decl
) && CLASSTYPE_TEMPLATE_INFO (decl
)
235 && ! CLASSTYPE_TEMPLATE_SPECIALIZATION (decl
))
237 tree tmpl
= CLASSTYPE_TI_TEMPLATE (decl
);
238 check_member_template (tmpl
);
243 else if (DECL_TEMPLATE_INFO (decl
))
245 if (!DECL_TEMPLATE_SPECIALIZATION (decl
))
247 check_member_template (DECL_TI_TEMPLATE (decl
));
248 return DECL_TI_TEMPLATE (decl
);
254 cp_error ("invalid member template declaration `%D'", decl
);
256 return error_mark_node
;
259 /* Returns the template nesting level of the indicated class TYPE.
269 A<T>::B<U> has depth two, while A<T> has depth one.
270 Both A<T>::B<int> and A<int>::B<U> have depth one, if
271 COUNT_SPECIALIZATIONS is 0 or if they are instantiations, not
274 This function is guaranteed to return 0 if passed NULL_TREE so
275 that, for example, `template_class_depth (current_class_type)' is
279 template_class_depth_real (type
, count_specializations
)
281 int count_specializations
;
286 type
&& TREE_CODE (type
) != NAMESPACE_DECL
;
287 type
= (TREE_CODE (type
) == FUNCTION_DECL
)
288 ? DECL_REAL_CONTEXT (type
) : TYPE_CONTEXT (type
))
290 if (TREE_CODE (type
) != FUNCTION_DECL
)
292 if (CLASSTYPE_TEMPLATE_INFO (type
)
293 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (type
))
294 && ((count_specializations
295 && CLASSTYPE_TEMPLATE_SPECIALIZATION (type
))
296 || uses_template_parms (CLASSTYPE_TI_ARGS (type
))))
301 if (DECL_TEMPLATE_INFO (type
)
302 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (type
))
303 && ((count_specializations
304 && DECL_TEMPLATE_SPECIALIZATION (type
))
305 || uses_template_parms (DECL_TI_ARGS (type
))))
313 /* Returns the template nesting level of the indicated class TYPE.
314 Like template_class_depth_real, but instantiations do not count in
318 template_class_depth (type
)
321 return template_class_depth_real (type
, /*count_specializations=*/0);
324 /* Returns 1 if processing DECL as part of do_pending_inlines
325 needs us to push template parms. */
328 inline_needs_template_parms (decl
)
331 if (! DECL_TEMPLATE_INFO (decl
))
334 return (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (most_general_template (decl
)))
335 > (processing_template_decl
+ DECL_TEMPLATE_SPECIALIZATION (decl
)));
338 /* Subroutine of maybe_begin_member_template_processing.
339 Push the template parms in PARMS, starting from LEVELS steps into the
340 chain, and ending at the beginning, since template parms are listed
344 push_inline_template_parms_recursive (parmlist
, levels
)
348 tree parms
= TREE_VALUE (parmlist
);
352 push_inline_template_parms_recursive (TREE_CHAIN (parmlist
), levels
- 1);
354 ++processing_template_decl
;
355 current_template_parms
356 = tree_cons (build_int_2 (0, processing_template_decl
),
357 parms
, current_template_parms
);
358 TEMPLATE_PARMS_FOR_INLINE (current_template_parms
) = 1;
361 for (i
= 0; i
< TREE_VEC_LENGTH (parms
); ++i
)
363 tree parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
364 my_friendly_assert (TREE_CODE_CLASS (TREE_CODE (parm
)) == 'd', 0);
366 switch (TREE_CODE (parm
))
375 /* Make a CONST_DECL as is done in process_template_parm.
376 It is ugly that we recreate this here; the original
377 version built in process_template_parm is no longer
379 tree decl
= build_decl (CONST_DECL
, DECL_NAME (parm
),
381 SET_DECL_ARTIFICIAL (decl
);
382 DECL_INITIAL (decl
) = DECL_INITIAL (parm
);
383 DECL_TEMPLATE_PARM_P (decl
) = 1;
389 my_friendly_abort (0);
394 /* Restore the template parameter context for a member template or
395 a friend template defined in a class definition. */
398 maybe_begin_member_template_processing (decl
)
404 if (! inline_needs_template_parms (decl
))
407 parms
= DECL_TEMPLATE_PARMS (most_general_template (decl
));
409 levels
= TMPL_PARMS_DEPTH (parms
) - processing_template_decl
;
411 if (DECL_TEMPLATE_SPECIALIZATION (decl
))
414 parms
= TREE_CHAIN (parms
);
417 push_inline_template_parms_recursive (parms
, levels
);
420 /* Undo the effects of begin_member_template_processing. */
423 maybe_end_member_template_processing ()
425 if (! processing_template_decl
)
428 while (current_template_parms
429 && TEMPLATE_PARMS_FOR_INLINE (current_template_parms
))
431 --processing_template_decl
;
432 current_template_parms
= TREE_CHAIN (current_template_parms
);
437 /* Returns non-zero iff T is a member template function. We must be
440 template <class T> class C { void f(); }
442 Here, f is a template function, and a member, but not a member
443 template. This function does not concern itself with the origin of
444 T, only its present state. So if we have
446 template <class T> class C { template <class U> void f(U); }
448 then neither C<int>::f<char> nor C<T>::f<double> is considered
449 to be a member template. But, `template <class U> void
450 C<int>::f(U)' is considered a member template. */
453 is_member_template (t
)
456 if (!DECL_FUNCTION_TEMPLATE_P (t
))
457 /* Anything that isn't a function or a template function is
458 certainly not a member template. */
461 /* A local class can't have member templates. */
462 if (hack_decl_function_context (t
))
465 return (DECL_FUNCTION_MEMBER_P (DECL_TEMPLATE_RESULT (t
))
466 /* If there are more levels of template parameters than
467 there are template classes surrounding the declaration,
468 then we have a member template. */
469 && (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (t
)) >
470 template_class_depth (DECL_CLASS_CONTEXT (t
))));
474 /* Returns non-zero iff T is a member template class. See
475 is_member_template for a description of what precisely constitutes
476 a member template. */
479 is_member_template_class (t
)
482 if (!DECL_CLASS_TEMPLATE_P (t
))
483 /* Anything that isn't a class template, is certainly not a member
487 if (!DECL_CLASS_SCOPE_P (t
))
488 /* Anything whose context isn't a class type is surely not a
492 /* If there are more levels of template parameters than there are
493 template classes surrounding the declaration, then we have a
495 return (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (t
)) >
496 template_class_depth (DECL_CONTEXT (t
)));
500 /* Return a new template argument vector which contains all of ARGS,
501 but has as its innermost set of arguments the EXTRA_ARGS. The
502 resulting vector will be built on a temporary obstack, and so must
503 be explicitly copied to the permanent obstack, if required. */
506 add_to_template_args (args
, extra_args
)
515 extra_depth
= TMPL_ARGS_DEPTH (extra_args
);
516 new_args
= make_temp_vec (TMPL_ARGS_DEPTH (args
) + extra_depth
);
518 for (i
= 1; i
<= TMPL_ARGS_DEPTH (args
); ++i
)
519 SET_TMPL_ARGS_LEVEL (new_args
, i
, TMPL_ARGS_LEVEL (args
, i
));
521 for (j
= 1; j
<= extra_depth
; ++j
, ++i
)
522 SET_TMPL_ARGS_LEVEL (new_args
, i
, TMPL_ARGS_LEVEL (extra_args
, j
));
527 /* Like add_to_template_args, but only the outermost ARGS are added to
528 the EXTRA_ARGS. In particular, all but TMPL_ARGS_DEPTH
529 (EXTRA_ARGS) levels are added. This function is used to combine
530 the template arguments from a partial instantiation with the
531 template arguments used to attain the full instantiation from the
532 partial instantiation. */
535 add_outermost_template_args (args
, extra_args
)
541 /* If there are more levels of EXTRA_ARGS than there are ARGS,
542 something very fishy is going on. */
543 my_friendly_assert (TMPL_ARGS_DEPTH (args
) >= TMPL_ARGS_DEPTH (extra_args
),
546 /* If *all* the new arguments will be the EXTRA_ARGS, just return
548 if (TMPL_ARGS_DEPTH (args
) == TMPL_ARGS_DEPTH (extra_args
))
551 /* For the moment, we make ARGS look like it contains fewer levels. */
552 TREE_VEC_LENGTH (args
) -= TMPL_ARGS_DEPTH (extra_args
);
554 new_args
= add_to_template_args (args
, extra_args
);
556 /* Now, we restore ARGS to its full dimensions. */
557 TREE_VEC_LENGTH (args
) += TMPL_ARGS_DEPTH (extra_args
);
562 /* We've got a template header coming up; push to a new level for storing
566 begin_template_parm_list ()
568 /* We use a non-tag-transparent scope here, which causes pushtag to
569 put tags in this scope, rather than in the enclosing class or
570 namespace scope. This is the right thing, since we want
571 TEMPLATE_DECLS, and not TYPE_DECLS for template classes. For a
572 global template class, push_template_decl handles putting the
573 TEMPLATE_DECL into top-level scope. For a nested template class,
576 template <class T> struct S1 {
577 template <class T> struct S2 {};
580 pushtag contains special code to call pushdecl_with_scope on the
581 TEMPLATE_DECL for S2. */
583 declare_pseudo_global_level ();
584 ++processing_template_decl
;
585 ++processing_template_parmlist
;
586 note_template_header (0);
589 /* This routine is called when a specialization is declared. If it is
590 illegal to declare a specialization here, an error is reported. */
593 check_specialization_scope ()
595 tree scope
= current_scope ();
599 An explicit specialization shall be declared in the namespace of
600 which the template is a member, or, for member templates, in the
601 namespace of which the enclosing class or enclosing class
602 template is a member. An explicit specialization of a member
603 function, member class or static data member of a class template
604 shall be declared in the namespace of which the class template
606 if (scope
&& TREE_CODE (scope
) != NAMESPACE_DECL
)
607 cp_error ("explicit specialization in non-namespace scope `%D'",
612 In an explicit specialization declaration for a member of a class
613 template or a member template that appears in namespace scope,
614 the member template and some of its enclosing class templates may
615 remain unspecialized, except that the declaration shall not
616 explicitly specialize a class member template if its enclosing
617 class templates are not explicitly specialized as well. */
618 if (current_template_parms
)
619 cp_error ("enclosing class templates are not explicitly specialized");
622 /* We've just seen template <>. */
625 begin_specialization ()
627 note_template_header (1);
628 check_specialization_scope ();
631 /* Called at then end of processing a declaration preceeded by
635 end_specialization ()
637 reset_specialization ();
640 /* Any template <>'s that we have seen thus far are not referring to a
641 function specialization. */
644 reset_specialization ()
646 processing_specialization
= 0;
647 template_header_count
= 0;
650 /* We've just seen a template header. If SPECIALIZATION is non-zero,
651 it was of the form template <>. */
654 note_template_header (specialization
)
657 processing_specialization
= specialization
;
658 template_header_count
++;
661 /* We're beginning an explicit instantiation. */
664 begin_explicit_instantiation ()
666 ++processing_explicit_instantiation
;
671 end_explicit_instantiation ()
673 my_friendly_assert(processing_explicit_instantiation
> 0, 0);
674 --processing_explicit_instantiation
;
677 /* The TYPE is being declared. If it is a template type, that means it
678 is a partial specialization. Do appropriate error-checking. */
681 maybe_process_partial_specialization (type
)
684 if (IS_AGGR_TYPE (type
) && CLASSTYPE_USE_TEMPLATE (type
))
686 if (CLASSTYPE_IMPLICIT_INSTANTIATION (type
)
687 && TYPE_SIZE (type
) == NULL_TREE
)
689 if (current_namespace
690 != decl_namespace_context (CLASSTYPE_TI_TEMPLATE (type
)))
692 cp_pedwarn ("specializing `%#T' in different namespace", type
);
693 cp_pedwarn_at (" from definition of `%#D'",
694 CLASSTYPE_TI_TEMPLATE (type
));
696 SET_CLASSTYPE_TEMPLATE_SPECIALIZATION (type
);
697 if (processing_template_decl
)
698 push_template_decl (TYPE_MAIN_DECL (type
));
700 else if (CLASSTYPE_TEMPLATE_INSTANTIATION (type
))
701 cp_error ("specialization of `%T' after instantiation", type
);
703 else if (processing_specialization
)
704 cp_error ("explicit specialization of non-template `%T'", type
);
707 /* Retrieve the specialization (in the sense of [temp.spec] - a
708 specialization is either an instantiation or an explicit
709 specialization) of TMPL for the given template ARGS. If there is
710 no such specialization, return NULL_TREE. The ARGS are a vector of
711 arguments, or a vector of vectors of arguments, in the case of
712 templates with more than one level of parameters. */
715 retrieve_specialization (tmpl
, args
)
721 my_friendly_assert (TREE_CODE (tmpl
) == TEMPLATE_DECL
, 0);
723 /* There should be as many levels of arguments as there are
724 levels of parameters. */
725 my_friendly_assert (TMPL_ARGS_DEPTH (args
)
726 == TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl
)),
729 for (s
= DECL_TEMPLATE_SPECIALIZATIONS (tmpl
);
732 if (comp_template_args (TREE_PURPOSE (s
), args
))
733 return TREE_VALUE (s
);
738 /* Returns non-zero iff DECL is a specialization of TMPL. */
741 is_specialization_of (decl
, tmpl
)
747 if (TREE_CODE (decl
) == FUNCTION_DECL
)
751 t
= DECL_TEMPLATE_INFO (t
) ? DECL_TI_TEMPLATE (t
) : NULL_TREE
)
757 my_friendly_assert (TREE_CODE (decl
) == TYPE_DECL
, 0);
759 for (t
= TREE_TYPE (decl
);
761 t
= CLASSTYPE_USE_TEMPLATE (t
)
762 ? TREE_TYPE (CLASSTYPE_TI_TEMPLATE (t
)) : NULL_TREE
)
763 if (same_type_p (TYPE_MAIN_VARIANT (t
),
764 TYPE_MAIN_VARIANT (TREE_TYPE (tmpl
))))
771 /* Register the specialization SPEC as a specialization of TMPL with
772 the indicated ARGS. Returns SPEC, or an equivalent prior
773 declaration, if available. */
776 register_specialization (spec
, tmpl
, args
)
783 my_friendly_assert (TREE_CODE (tmpl
) == TEMPLATE_DECL
, 0);
785 if (TREE_CODE (spec
) == FUNCTION_DECL
786 && uses_template_parms (DECL_TI_ARGS (spec
)))
787 /* This is the FUNCTION_DECL for a partial instantiation. Don't
788 register it; we want the corresponding TEMPLATE_DECL instead.
789 We use `uses_template_parms (DECL_TI_ARGS (spec))' rather than
790 the more obvious `uses_template_parms (spec)' to avoid problems
791 with default function arguments. In particular, given
794 template <class T> void f(T t1, T t = T())
796 the default argument expression is not substituted for in an
797 instantiation unless and until it is actually needed. */
800 /* There should be as many levels of arguments as there are
801 levels of parameters. */
802 my_friendly_assert (TMPL_ARGS_DEPTH (args
)
803 == TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl
)),
806 for (s
= DECL_TEMPLATE_SPECIALIZATIONS (tmpl
);
809 if (comp_template_args (TREE_PURPOSE (s
), args
))
811 tree fn
= TREE_VALUE (s
);
813 if (DECL_TEMPLATE_SPECIALIZATION (spec
))
815 if (DECL_TEMPLATE_INSTANTIATION (fn
))
818 || DECL_EXPLICIT_INSTANTIATION (fn
))
820 cp_error ("specialization of %D after instantiation",
826 /* This situation should occur only if the first
827 specialization is an implicit instantiation,
828 the second is an explicit specialization, and
829 the implicit instantiation has not yet been
830 used. That situation can occur if we have
831 implicitly instantiated a member function and
832 then specialized it later.
834 We can also wind up here if a friend
835 declaration that looked like an instantiation
836 turns out to be a specialization:
838 template <class T> void foo(T);
839 class S { friend void foo<>(int) };
840 template <> void foo(int);
842 We transform the existing DECL in place so that
843 any pointers to it become pointers to the
846 If there was a definition for the template, but
847 not for the specialization, we want this to
848 look as if there is no definition, and vice
850 DECL_INITIAL (fn
) = NULL_TREE
;
851 duplicate_decls (spec
, fn
);
856 else if (DECL_TEMPLATE_SPECIALIZATION (fn
))
858 duplicate_decls (spec
, fn
);
864 DECL_TEMPLATE_SPECIALIZATIONS (tmpl
)
865 = perm_tree_cons (args
, spec
, DECL_TEMPLATE_SPECIALIZATIONS (tmpl
));
870 /* Unregister the specialization SPEC as a specialization of TMPL.
871 Returns nonzero if the SPEC was listed as a specialization of
875 unregister_specialization (spec
, tmpl
)
881 for (s
= &DECL_TEMPLATE_SPECIALIZATIONS (tmpl
);
883 s
= &TREE_CHAIN (*s
))
884 if (TREE_VALUE (*s
) == spec
)
886 *s
= TREE_CHAIN (*s
);
893 /* Print the list of candidate FNS in an error message. */
896 print_candidates (fns
)
901 const char *str
= "candidates are:";
903 for (fn
= fns
; fn
!= NULL_TREE
; fn
= TREE_CHAIN (fn
))
907 for (f
= TREE_VALUE (fn
); f
; f
= OVL_NEXT (f
))
908 cp_error_at ("%s %+#D", str
, OVL_CURRENT (f
));
913 /* Returns the template (one of the functions given by TEMPLATE_ID)
914 which can be specialized to match the indicated DECL with the
915 explicit template args given in TEMPLATE_ID. The DECL may be
916 NULL_TREE if none is available. In that case, the functions in
917 TEMPLATE_ID are non-members.
919 If NEED_MEMBER_TEMPLATE is non-zero the function is known to be a
920 specialization of a member template.
922 The template args (those explicitly specified and those deduced)
923 are output in a newly created vector *TARGS_OUT.
925 If it is impossible to determine the result, an error message is
926 issued. The error_mark_node is returned to indicate failure. */
929 determine_specialization (template_id
, decl
, targs_out
,
930 need_member_template
)
934 int need_member_template
;
940 tree candidates
= NULL_TREE
;
941 tree templates
= NULL_TREE
;
943 *targs_out
= NULL_TREE
;
945 if (template_id
== error_mark_node
)
946 return error_mark_node
;
948 fns
= TREE_OPERAND (template_id
, 0);
949 explicit_targs
= TREE_OPERAND (template_id
, 1);
951 if (fns
== error_mark_node
)
952 return error_mark_node
;
954 /* Check for baselinks. */
955 if (TREE_CODE (fns
) == TREE_LIST
)
956 fns
= TREE_VALUE (fns
);
958 for (; fns
; fns
= OVL_NEXT (fns
))
962 fn
= OVL_CURRENT (fns
);
964 if (TREE_CODE (fn
) == TEMPLATE_DECL
)
965 /* DECL might be a specialization of FN. */
967 else if (need_member_template
)
968 /* FN is an ordinary member function, and we need a
969 specialization of a member template. */
971 else if (TREE_CODE (fn
) != FUNCTION_DECL
)
972 /* We can get IDENTIFIER_NODEs here in certain erroneous
975 else if (!DECL_FUNCTION_MEMBER_P (fn
))
976 /* This is just an ordinary non-member function. Nothing can
977 be a specialization of that. */
983 /* This is an ordinary member function. However, since
984 we're here, we can assume it's enclosing class is a
985 template class. For example,
987 template <typename T> struct S { void f(); };
988 template <> void S<int>::f() {}
990 Here, S<int>::f is a non-template, but S<int> is a
991 template class. If FN has the same type as DECL, we
992 might be in business. */
993 if (!same_type_p (TREE_TYPE (TREE_TYPE (decl
)),
994 TREE_TYPE (TREE_TYPE (fn
))))
995 /* The return types differ. */
998 /* Adjust the type of DECL in case FN is a static member. */
999 decl_arg_types
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
1000 if (DECL_STATIC_FUNCTION_P (fn
)
1001 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
1002 decl_arg_types
= TREE_CHAIN (decl_arg_types
);
1004 if (compparms (TYPE_ARG_TYPES (TREE_TYPE (fn
)),
1007 candidates
= tree_cons (NULL_TREE
, fn
, candidates
);
1012 /* See whether this function might be a specialization of this
1014 targs
= get_bindings (tmpl
, decl
, explicit_targs
);
1017 /* We cannot deduce template arguments that when used to
1018 specialize TMPL will produce DECL. */
1021 /* Save this template, and the arguments deduced. */
1022 templates
= scratch_tree_cons (targs
, tmpl
, templates
);
1025 if (templates
&& TREE_CHAIN (templates
))
1031 It is possible for a specialization with a given function
1032 signature to be instantiated from more than one function
1033 template. In such cases, explicit specification of the
1034 template arguments must be used to uniquely identify the
1035 function template specialization being specialized.
1037 Note that here, there's no suggestion that we're supposed to
1038 determine which of the candidate templates is most
1039 specialized. However, we, also have:
1043 Partial ordering of overloaded function template
1044 declarations is used in the following contexts to select
1045 the function template to which a function template
1046 specialization refers:
1048 -- when an explicit specialization refers to a function
1051 So, we do use the partial ordering rules, at least for now.
1052 This extension can only serve to make illegal programs legal,
1053 so it's safe. And, there is strong anecdotal evidence that
1054 the committee intended the partial ordering rules to apply;
1055 the EDG front-end has that behavior, and John Spicer claims
1056 that the committee simply forgot to delete the wording in
1057 [temp.expl.spec]. */
1058 tree tmpl
= most_specialized (templates
, decl
, explicit_targs
);
1059 if (tmpl
&& tmpl
!= error_mark_node
)
1061 targs
= get_bindings (tmpl
, decl
, explicit_targs
);
1062 templates
= scratch_tree_cons (targs
, tmpl
, NULL_TREE
);
1066 if (templates
== NULL_TREE
&& candidates
== NULL_TREE
)
1068 cp_error_at ("template-id `%D' for `%+D' does not match any template declaration",
1070 return error_mark_node
;
1072 else if ((templates
&& TREE_CHAIN (templates
))
1073 || (candidates
&& TREE_CHAIN (candidates
))
1074 || (templates
&& candidates
))
1076 cp_error_at ("ambiguous template specialization `%D' for `%+D'",
1078 chainon (candidates
, templates
);
1079 print_candidates (candidates
);
1080 return error_mark_node
;
1083 /* We have one, and exactly one, match. */
1086 /* It was a specialization of an ordinary member function in a
1088 *targs_out
= copy_node (DECL_TI_ARGS (TREE_VALUE (candidates
)));
1089 return DECL_TI_TEMPLATE (TREE_VALUE (candidates
));
1092 /* It was a specialization of a template. */
1093 targs
= DECL_TI_ARGS (DECL_RESULT (TREE_VALUE (templates
)));
1094 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (targs
))
1096 *targs_out
= copy_node (targs
);
1097 SET_TMPL_ARGS_LEVEL (*targs_out
,
1098 TMPL_ARGS_DEPTH (*targs_out
),
1099 TREE_PURPOSE (templates
));
1102 *targs_out
= TREE_PURPOSE (templates
);
1103 return TREE_VALUE (templates
);
1106 /* Check to see if the function just declared, as indicated in
1107 DECLARATOR, and in DECL, is a specialization of a function
1108 template. We may also discover that the declaration is an explicit
1109 instantiation at this point.
1111 Returns DECL, or an equivalent declaration that should be used
1112 instead if all goes well. Issues an error message if something is
1113 amiss. Returns error_mark_node if the error is not easily
1116 FLAGS is a bitmask consisting of the following flags:
1118 2: The function has a definition.
1119 4: The function is a friend.
1121 The TEMPLATE_COUNT is the number of references to qualifying
1122 template classes that appeared in the name of the function. For
1125 template <class T> struct S { void f(); };
1128 the TEMPLATE_COUNT would be 1. However, explicitly specialized
1129 classes are not counted in the TEMPLATE_COUNT, so that in
1131 template <class T> struct S {};
1132 template <> struct S<int> { void f(); }
1133 template <> void S<int>::f();
1135 the TEMPLATE_COUNT would be 0. (Note that this declaration is
1136 illegal; there should be no template <>.)
1138 If the function is a specialization, it is marked as such via
1139 DECL_TEMPLATE_SPECIALIZATION. Furthermore, its DECL_TEMPLATE_INFO
1140 is set up correctly, and it is added to the list of specializations
1141 for that template. */
1144 check_explicit_specialization (declarator
, decl
, template_count
, flags
)
1150 int have_def
= flags
& 2;
1151 int is_friend
= flags
& 4;
1152 int specialization
= 0;
1153 int explicit_instantiation
= 0;
1154 int member_specialization
= 0;
1156 tree ctype
= DECL_CLASS_CONTEXT (decl
);
1157 tree dname
= DECL_NAME (decl
);
1159 if (processing_specialization
)
1161 /* The last template header was of the form template <>. */
1163 if (template_header_count
> template_count
)
1165 /* There were more template headers than qualifying template
1167 if (template_header_count
- template_count
> 1)
1168 /* There shouldn't be that many template parameter lists.
1169 There can be at most one parameter list for every
1170 qualifying class, plus one for the function itself. */
1171 cp_error ("too many template parameter lists in declaration of `%D'", decl
);
1173 SET_DECL_TEMPLATE_SPECIALIZATION (decl
);
1175 member_specialization
= 1;
1179 else if (template_header_count
== template_count
)
1181 /* The counts are equal. So, this might be a
1182 specialization, but it is not a specialization of a
1183 member template. It might be something like
1185 template <class T> struct S {
1189 void S<int>::f(int i) {} */
1191 SET_DECL_TEMPLATE_SPECIALIZATION (decl
);
1195 /* This cannot be an explicit specialization. There are not
1196 enough headers for all of the qualifying classes. For
1197 example, we might have:
1200 void S<int>::T<char>::f();
1202 But, we're missing another template <>. */
1203 cp_error("too few template parameter lists in declaration of `%D'", decl
);
1207 else if (processing_explicit_instantiation
)
1209 if (template_header_count
)
1210 cp_error ("template parameter list used in explicit instantiation");
1213 cp_error ("definition provided for explicit instantiation");
1215 explicit_instantiation
= 1;
1217 else if (ctype
!= NULL_TREE
1218 && !TYPE_BEING_DEFINED (ctype
)
1219 && CLASSTYPE_TEMPLATE_INSTANTIATION (ctype
)
1222 /* This case catches outdated code that looks like this:
1224 template <class T> struct S { void f(); };
1225 void S<int>::f() {} // Missing template <>
1227 We disable this check when the type is being defined to
1228 avoid complaining about default compiler-generated
1229 constructors, destructors, and assignment operators.
1230 Since the type is an instantiation, not a specialization,
1231 these are the only functions that can be defined before
1232 the class is complete. */
1235 template <class T> void S<int>::f() {}
1237 if (template_header_count
)
1239 cp_error ("template parameters specified in specialization");
1245 ("explicit specialization not preceded by `template <>'");
1247 SET_DECL_TEMPLATE_SPECIALIZATION (decl
);
1249 else if (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
)
1252 /* This could be something like:
1254 template <class T> void f(T);
1255 class S { friend void f<>(int); } */
1259 /* This case handles bogus declarations like template <>
1260 template <class T> void f<int>(); */
1262 cp_error ("template-id `%D' in declaration of primary template",
1268 if (specialization
|| member_specialization
)
1270 tree t
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
1271 for (; t
; t
= TREE_CHAIN (t
))
1272 if (TREE_PURPOSE (t
))
1275 ("default argument specified in explicit specialization");
1278 if (current_lang_name
== lang_name_c
)
1279 cp_error ("template specialization with C linkage");
1282 if (specialization
|| member_specialization
|| explicit_instantiation
)
1284 tree tmpl
= NULL_TREE
;
1285 tree targs
= NULL_TREE
;
1287 /* Make sure that the declarator is a TEMPLATE_ID_EXPR. */
1288 if (TREE_CODE (declarator
) != TEMPLATE_ID_EXPR
)
1292 my_friendly_assert (TREE_CODE (declarator
) == IDENTIFIER_NODE
,
1295 fns
= IDENTIFIER_NAMESPACE_VALUE (dname
);
1300 lookup_template_function (fns
, NULL_TREE
);
1303 if (declarator
== error_mark_node
)
1304 return error_mark_node
;
1306 if (ctype
!= NULL_TREE
&& TYPE_BEING_DEFINED (ctype
))
1308 if (!explicit_instantiation
)
1309 /* A specialization in class scope. This is illegal,
1310 but the error will already have been flagged by
1311 check_specialization_scope. */
1312 return error_mark_node
;
1315 /* It's not legal to write an explicit instantiation in
1318 class C { template void f(); }
1320 This case is caught by the parser. However, on
1323 template class C { void f(); };
1325 (which is illegal) we can get here. The error will be
1332 else if (TREE_CODE (TREE_OPERAND (declarator
, 0)) == LOOKUP_EXPR
)
1334 /* A friend declaration. We can't do much, because we don't
1335 know what this resolves to, yet. */
1336 my_friendly_assert (is_friend
!= 0, 0);
1337 my_friendly_assert (!explicit_instantiation
, 0);
1338 SET_DECL_IMPLICIT_INSTANTIATION (decl
);
1341 else if (ctype
!= NULL_TREE
1342 && (TREE_CODE (TREE_OPERAND (declarator
, 0)) ==
1345 /* Find the list of functions in ctype that have the same
1346 name as the declared function. */
1347 tree name
= TREE_OPERAND (declarator
, 0);
1348 tree fns
= NULL_TREE
;
1351 if (name
== constructor_name (ctype
)
1352 || name
== constructor_name_full (ctype
))
1354 int is_constructor
= DECL_CONSTRUCTOR_P (decl
);
1356 if (is_constructor
? !TYPE_HAS_CONSTRUCTOR (ctype
)
1357 : !TYPE_HAS_DESTRUCTOR (ctype
))
1359 /* From [temp.expl.spec]:
1361 If such an explicit specialization for the member
1362 of a class template names an implicitly-declared
1363 special member function (clause _special_), the
1364 program is ill-formed.
1366 Similar language is found in [temp.explicit]. */
1367 cp_error ("specialization of implicitly-declared special member function");
1368 return error_mark_node
;
1371 name
= is_constructor
? ctor_identifier
: dtor_identifier
;
1374 if (!IDENTIFIER_TYPENAME_P (name
))
1376 idx
= lookup_fnfields_1 (ctype
, name
);
1378 fns
= TREE_VEC_ELT (CLASSTYPE_METHOD_VEC (ctype
), idx
);
1384 /* For a type-conversion operator, we cannot do a
1385 name-based lookup. We might be looking for `operator
1386 int' which will be a specialization of `operator T'.
1387 So, we find *all* the conversion operators, and then
1388 select from them. */
1391 methods
= CLASSTYPE_METHOD_VEC (ctype
);
1393 for (idx
= 2; idx
< TREE_VEC_LENGTH (methods
); ++idx
)
1395 tree ovl
= TREE_VEC_ELT (methods
, idx
);
1397 if (!ovl
|| !DECL_CONV_FN_P (OVL_CURRENT (ovl
)))
1398 /* There are no more conversion functions. */
1401 /* Glue all these conversion functions together
1402 with those we already have. */
1403 for (; ovl
; ovl
= OVL_NEXT (ovl
))
1404 fns
= ovl_cons (OVL_CURRENT (ovl
), fns
);
1408 if (fns
== NULL_TREE
)
1410 cp_error ("no member function `%s' declared in `%T'",
1411 IDENTIFIER_POINTER (name
),
1413 return error_mark_node
;
1416 TREE_OPERAND (declarator
, 0) = fns
;
1419 /* Figure out what exactly is being specialized at this point.
1420 Note that for an explicit instantiation, even one for a
1421 member function, we cannot tell apriori whether the
1422 instantiation is for a member template, or just a member
1423 function of a template class. Even if a member template is
1424 being instantiated, the member template arguments may be
1425 elided if they can be deduced from the rest of the
1427 tmpl
= determine_specialization (declarator
, decl
,
1429 member_specialization
);
1431 if (!tmpl
|| tmpl
== error_mark_node
)
1432 /* We couldn't figure out what this declaration was
1434 return error_mark_node
;
1437 tree gen_tmpl
= most_general_template (tmpl
);
1439 if (explicit_instantiation
)
1441 /* We don't set DECL_EXPLICIT_INSTANTIATION here; that
1442 is done by do_decl_instantiation later. */
1444 int arg_depth
= TMPL_ARGS_DEPTH (targs
);
1445 int parm_depth
= TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl
));
1447 if (arg_depth
> parm_depth
)
1449 /* If TMPL is not the most general template (for
1450 example, if TMPL is a friend template that is
1451 injected into namespace scope), then there will
1452 be too many levels fo TARGS. Remove some of them
1457 new_targs
= make_temp_vec (parm_depth
);
1458 for (i
= arg_depth
- parm_depth
; i
< arg_depth
; ++i
)
1459 TREE_VEC_ELT (new_targs
, i
- (arg_depth
- parm_depth
))
1460 = TREE_VEC_ELT (targs
, i
);
1464 decl
= instantiate_template (tmpl
, targs
);
1468 /* If we though that the DECL was a member function, but it
1469 turns out to be specializing a static member function,
1470 make DECL a static member function as well. */
1471 if (DECL_STATIC_FUNCTION_P (tmpl
)
1472 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
1474 revert_static_member_fn (&decl
, 0, 0);
1475 last_function_parms
= TREE_CHAIN (last_function_parms
);
1478 /* Set up the DECL_TEMPLATE_INFO for DECL. */
1479 DECL_TEMPLATE_INFO (decl
)
1480 = perm_tree_cons (tmpl
, targs
, NULL_TREE
);
1482 /* Mangle the function name appropriately. Note that we do
1483 not mangle specializations of non-template member
1484 functions of template classes, e.g. with
1486 template <class T> struct S { void f(); }
1488 and given the specialization
1490 template <> void S<int>::f() {}
1492 we do not mangle S<int>::f() here. That's because it's
1493 just an ordinary member function and doesn't need special
1494 treatment. We do this here so that the ordinary,
1495 non-template, name-mangling algorith will not be used
1497 if ((is_member_template (tmpl
) || ctype
== NULL_TREE
)
1498 && name_mangling_version
>= 1)
1499 set_mangled_name_for_template_decl (decl
);
1501 if (is_friend
&& !have_def
)
1502 /* This is not really a declaration of a specialization.
1503 It's just the name of an instantiation. But, it's not
1504 a request for an instantiation, either. */
1505 SET_DECL_IMPLICIT_INSTANTIATION (decl
);
1507 /* Register this specialization so that we can find it
1509 decl
= register_specialization (decl
, gen_tmpl
, targs
);
1516 /* TYPE is being declared. Verify that the use of template headers
1517 and such is reasonable. Issue error messages if not. */
1520 maybe_check_template_type (type
)
1523 if (template_header_count
)
1525 /* We are in the scope of some `template <...>' header. */
1528 = template_class_depth_real (TYPE_CONTEXT (type
),
1529 /*count_specializations=*/1);
1531 if (template_header_count
<= context_depth
)
1532 /* This is OK; the template headers are for the context. We
1533 are actually too lenient here; like
1534 check_explicit_specialization we should consider the number
1535 of template types included in the actual declaration. For
1538 template <class T> struct S {
1539 template <class U> template <class V>
1545 template <class T> struct S {
1546 template <class U> struct I;
1549 template <class T> template <class U.
1554 else if (template_header_count
> context_depth
+ 1)
1555 /* There are two many template parameter lists. */
1556 cp_error ("too many template parameter lists in declaration of `%T'", type
);
1560 /* Returns 1 iff PARMS1 and PARMS2 are identical sets of template
1561 parameters. These are represented in the same format used for
1562 DECL_TEMPLATE_PARMS. */
1564 int comp_template_parms (parms1
, parms2
)
1571 if (parms1
== parms2
)
1574 for (p1
= parms1
, p2
= parms2
;
1575 p1
!= NULL_TREE
&& p2
!= NULL_TREE
;
1576 p1
= TREE_CHAIN (p1
), p2
= TREE_CHAIN (p2
))
1578 tree t1
= TREE_VALUE (p1
);
1579 tree t2
= TREE_VALUE (p2
);
1582 my_friendly_assert (TREE_CODE (t1
) == TREE_VEC
, 0);
1583 my_friendly_assert (TREE_CODE (t2
) == TREE_VEC
, 0);
1585 if (TREE_VEC_LENGTH (t1
) != TREE_VEC_LENGTH (t2
))
1588 for (i
= 0; i
< TREE_VEC_LENGTH (t2
); ++i
)
1590 tree parm1
= TREE_VALUE (TREE_VEC_ELT (t1
, i
));
1591 tree parm2
= TREE_VALUE (TREE_VEC_ELT (t2
, i
));
1593 if (TREE_CODE (parm1
) != TREE_CODE (parm2
))
1596 if (TREE_CODE (parm1
) == TEMPLATE_TYPE_PARM
)
1598 else if (!same_type_p (TREE_TYPE (parm1
), TREE_TYPE (parm2
)))
1603 if ((p1
!= NULL_TREE
) != (p2
!= NULL_TREE
))
1604 /* One set of parameters has more parameters lists than the
1611 /* Complain if DECL shadows a template parameter.
1613 [temp.local]: A template-parameter shall not be redeclared within its
1614 scope (including nested scopes). */
1617 check_template_shadow (decl
)
1622 /* If we're not in a template, we can't possibly shadow a template
1624 if (!current_template_parms
)
1627 /* Figure out what we're shadowing. */
1628 if (TREE_CODE (decl
) == OVERLOAD
)
1629 decl
= OVL_CURRENT (decl
);
1630 olddecl
= IDENTIFIER_VALUE (DECL_NAME (decl
));
1632 /* If there's no previous binding for this name, we're not shadowing
1633 anything, let alone a template parameter. */
1637 /* If we're not shadowing a template parameter, we're done. Note
1638 that OLDDECL might be an OVERLOAD (or perhaps even an
1639 ERROR_MARK), so we can't just blithely assume it to be a _DECL
1641 if (TREE_CODE_CLASS (TREE_CODE (olddecl
)) != 'd'
1642 || !DECL_TEMPLATE_PARM_P (olddecl
))
1645 /* We check for decl != olddecl to avoid bogus errors for using a
1646 name inside a class. We check TPFI to avoid duplicate errors for
1647 inline member templates. */
1649 || TEMPLATE_PARMS_FOR_INLINE (current_template_parms
))
1652 cp_error_at ("declaration of `%#D'", decl
);
1653 cp_error_at (" shadows template parm `%#D'", olddecl
);
1656 /* Return a new TEMPLATE_PARM_INDEX with the indicated INDEX, LEVEL,
1657 ORIG_LEVEL, DECL, and TYPE. */
1660 build_template_parm_index (index
, level
, orig_level
, decl
, type
)
1667 tree t
= make_node (TEMPLATE_PARM_INDEX
);
1668 TEMPLATE_PARM_IDX (t
) = index
;
1669 TEMPLATE_PARM_LEVEL (t
) = level
;
1670 TEMPLATE_PARM_ORIG_LEVEL (t
) = orig_level
;
1671 TEMPLATE_PARM_DECL (t
) = decl
;
1672 TREE_TYPE (t
) = type
;
1677 /* Return a TEMPLATE_PARM_INDEX, similar to INDEX, but whose
1678 TEMPLATE_PARM_LEVEL has been decreased by LEVELS. If such a
1679 TEMPLATE_PARM_INDEX already exists, it is returned; otherwise, a
1680 new one is created. */
1683 reduce_template_parm_level (index
, type
, levels
)
1688 if (TEMPLATE_PARM_DESCENDANTS (index
) == NULL_TREE
1689 || (TEMPLATE_PARM_LEVEL (TEMPLATE_PARM_DESCENDANTS (index
))
1690 != TEMPLATE_PARM_LEVEL (index
) - levels
))
1693 = build_decl (TREE_CODE (TEMPLATE_PARM_DECL (index
)),
1694 DECL_NAME (TEMPLATE_PARM_DECL (index
)),
1697 = build_template_parm_index (TEMPLATE_PARM_IDX (index
),
1698 TEMPLATE_PARM_LEVEL (index
) - levels
,
1699 TEMPLATE_PARM_ORIG_LEVEL (index
),
1701 TEMPLATE_PARM_DESCENDANTS (index
) = t
;
1703 /* Template template parameters need this. */
1704 DECL_TEMPLATE_PARMS (decl
)
1705 = DECL_TEMPLATE_PARMS (TEMPLATE_PARM_DECL (index
));
1708 return TEMPLATE_PARM_DESCENDANTS (index
);
1711 /* Process information from new template parameter NEXT and append it to the
1712 LIST being built. */
1715 process_template_parm (list
, next
)
1724 my_friendly_assert (TREE_CODE (parm
) == TREE_LIST
, 259);
1725 defval
= TREE_PURPOSE (parm
);
1726 parm
= TREE_VALUE (parm
);
1727 is_type
= TREE_PURPOSE (parm
) == class_type_node
;
1731 tree p
= TREE_VALUE (tree_last (list
));
1733 if (TREE_CODE (p
) == TYPE_DECL
)
1734 idx
= TEMPLATE_TYPE_IDX (TREE_TYPE (p
));
1735 else if (TREE_CODE (p
) == TEMPLATE_DECL
)
1736 idx
= TEMPLATE_TYPE_IDX (TREE_TYPE (DECL_TEMPLATE_RESULT (p
)));
1738 idx
= TEMPLATE_PARM_IDX (DECL_INITIAL (p
));
1746 my_friendly_assert (TREE_CODE (TREE_PURPOSE (parm
)) == TREE_LIST
, 260);
1747 /* is a const-param */
1748 parm
= grokdeclarator (TREE_VALUE (parm
), TREE_PURPOSE (parm
),
1749 PARM
, 0, NULL_TREE
);
1753 The top-level cv-qualifiers on the template-parameter are
1754 ignored when determining its type. */
1755 TREE_TYPE (parm
) = TYPE_MAIN_VARIANT (TREE_TYPE (parm
));
1757 /* A template parameter is not modifiable. */
1758 TREE_READONLY (parm
) = 1;
1759 if (IS_AGGR_TYPE (TREE_TYPE (parm
))
1760 && TREE_CODE (TREE_TYPE (parm
)) != TEMPLATE_TYPE_PARM
1761 && TREE_CODE (TREE_TYPE (parm
)) != TYPENAME_TYPE
)
1763 cp_error ("`%#T' is not a valid type for a template constant parameter",
1765 if (DECL_NAME (parm
) == NULL_TREE
)
1766 error (" a template type parameter must begin with `class' or `typename'");
1767 TREE_TYPE (parm
) = void_type_node
;
1770 && (TREE_CODE (TREE_TYPE (parm
)) == REAL_TYPE
1771 || TREE_CODE (TREE_TYPE (parm
)) == COMPLEX_TYPE
))
1772 cp_pedwarn ("`%T' is not a valid type for a template constant parameter",
1774 if (TREE_PERMANENT (parm
) == 0)
1776 parm
= copy_node (parm
);
1777 TREE_PERMANENT (parm
) = 1;
1779 decl
= build_decl (CONST_DECL
, DECL_NAME (parm
), TREE_TYPE (parm
));
1780 DECL_INITIAL (parm
) = DECL_INITIAL (decl
)
1781 = build_template_parm_index (idx
, processing_template_decl
,
1782 processing_template_decl
,
1783 decl
, TREE_TYPE (parm
));
1788 parm
= TREE_VALUE (parm
);
1790 if (parm
&& TREE_CODE (parm
) == TEMPLATE_DECL
)
1792 t
= make_lang_type (TEMPLATE_TEMPLATE_PARM
);
1793 /* This is for distinguishing between real templates and template
1794 template parameters */
1795 TREE_TYPE (parm
) = t
;
1796 TREE_TYPE (DECL_TEMPLATE_RESULT (parm
)) = t
;
1801 t
= make_lang_type (TEMPLATE_TYPE_PARM
);
1802 /* parm is either IDENTIFIER_NODE or NULL_TREE */
1803 decl
= build_decl (TYPE_DECL
, parm
, t
);
1806 TYPE_NAME (t
) = decl
;
1807 TYPE_STUB_DECL (t
) = decl
;
1809 TEMPLATE_TYPE_PARM_INDEX (t
)
1810 = build_template_parm_index (idx
, processing_template_decl
,
1811 processing_template_decl
,
1812 decl
, TREE_TYPE (parm
));
1814 SET_DECL_ARTIFICIAL (decl
);
1815 DECL_TEMPLATE_PARM_P (decl
) = 1;
1817 parm
= build_tree_list (defval
, parm
);
1818 return chainon (list
, parm
);
1821 /* The end of a template parameter list has been reached. Process the
1822 tree list into a parameter vector, converting each parameter into a more
1823 useful form. Type parameters are saved as IDENTIFIER_NODEs, and others
1827 end_template_parm_list (parms
)
1832 tree saved_parmlist
= make_tree_vec (list_length (parms
));
1834 current_template_parms
1835 = tree_cons (build_int_2 (0, processing_template_decl
),
1836 saved_parmlist
, current_template_parms
);
1838 for (parm
= parms
, nparms
= 0; parm
; parm
= TREE_CHAIN (parm
), nparms
++)
1839 TREE_VEC_ELT (saved_parmlist
, nparms
) = parm
;
1841 --processing_template_parmlist
;
1843 return saved_parmlist
;
1846 /* end_template_decl is called after a template declaration is seen. */
1849 end_template_decl ()
1851 reset_specialization ();
1853 if (! processing_template_decl
)
1856 /* This matches the pushlevel in begin_template_parm_list. */
1859 --processing_template_decl
;
1860 current_template_parms
= TREE_CHAIN (current_template_parms
);
1861 (void) get_pending_sizes (); /* Why? */
1864 /* Given a template argument vector containing the template PARMS.
1865 The innermost PARMS are given first. */
1868 current_template_args ()
1871 tree args
= NULL_TREE
;
1872 int length
= TMPL_PARMS_DEPTH (current_template_parms
);
1875 /* If there is only one level of template parameters, we do not
1876 create a TREE_VEC of TREE_VECs. Instead, we return a single
1877 TREE_VEC containing the arguments. */
1879 args
= make_tree_vec (length
);
1881 for (header
= current_template_parms
; header
; header
= TREE_CHAIN (header
))
1883 tree a
= copy_node (TREE_VALUE (header
));
1886 TREE_TYPE (a
) = NULL_TREE
;
1887 for (i
= TREE_VEC_LENGTH (a
) - 1; i
>= 0; --i
)
1889 tree t
= TREE_VEC_ELT (a
, i
);
1891 /* T will be a list if we are called from within a
1892 begin/end_template_parm_list pair, but a vector directly
1893 if within a begin/end_member_template_processing pair. */
1894 if (TREE_CODE (t
) == TREE_LIST
)
1898 if (TREE_CODE (t
) == TYPE_DECL
1899 || TREE_CODE (t
) == TEMPLATE_DECL
)
1902 t
= DECL_INITIAL (t
);
1903 TREE_VEC_ELT (a
, i
) = t
;
1908 TREE_VEC_ELT (args
, --l
) = a
;
1916 /* Return a TEMPLATE_DECL corresponding to DECL, using the indicated
1917 template PARMS. Used by push_template_decl below. */
1920 build_template_decl (decl
, parms
)
1924 tree tmpl
= build_lang_decl (TEMPLATE_DECL
, DECL_NAME (decl
), NULL_TREE
);
1925 DECL_TEMPLATE_PARMS (tmpl
) = parms
;
1926 DECL_CONTEXT (tmpl
) = DECL_CONTEXT (decl
);
1927 if (DECL_LANG_SPECIFIC (decl
))
1929 DECL_CLASS_CONTEXT (tmpl
) = DECL_CLASS_CONTEXT (decl
);
1930 DECL_STATIC_FUNCTION_P (tmpl
) = DECL_STATIC_FUNCTION_P (decl
);
1931 DECL_CONSTRUCTOR_P (tmpl
) = DECL_CONSTRUCTOR_P (decl
);
1937 struct template_parm_data
1939 /* The level of the template parameters we are currently
1943 /* The index of the specialization argument we are currently
1947 /* An array whose size is the number of template parameters. The
1948 elements are non-zero if the parameter has been used in any one
1949 of the arguments processed so far. */
1952 /* An array whose size is the number of template arguments. The
1953 elements are non-zero if the argument makes use of template
1954 parameters of this level. */
1955 int* arg_uses_template_parms
;
1958 /* Subroutine of push_template_decl used to see if each template
1959 parameter in a partial specialization is used in the explicit
1960 argument list. If T is of the LEVEL given in DATA (which is
1961 treated as a template_parm_data*), then DATA->PARMS is marked
1965 mark_template_parm (t
, data
)
1971 struct template_parm_data
* tpd
= (struct template_parm_data
*) data
;
1973 if (TREE_CODE (t
) == TEMPLATE_PARM_INDEX
)
1975 level
= TEMPLATE_PARM_LEVEL (t
);
1976 idx
= TEMPLATE_PARM_IDX (t
);
1980 level
= TEMPLATE_TYPE_LEVEL (t
);
1981 idx
= TEMPLATE_TYPE_IDX (t
);
1984 if (level
== tpd
->level
)
1986 tpd
->parms
[idx
] = 1;
1987 tpd
->arg_uses_template_parms
[tpd
->current_arg
] = 1;
1990 /* Return zero so that for_each_template_parm will continue the
1991 traversal of the tree; we want to mark *every* template parm. */
1995 /* Process the partial specialization DECL. */
1998 process_partial_specialization (decl
)
2001 tree type
= TREE_TYPE (decl
);
2002 tree maintmpl
= CLASSTYPE_TI_TEMPLATE (type
);
2003 tree specargs
= CLASSTYPE_TI_ARGS (type
);
2004 tree inner_args
= innermost_args (specargs
);
2005 tree inner_parms
= INNERMOST_TEMPLATE_PARMS (current_template_parms
);
2006 tree main_inner_parms
= DECL_INNERMOST_TEMPLATE_PARMS (maintmpl
);
2007 int nargs
= TREE_VEC_LENGTH (inner_args
);
2008 int ntparms
= TREE_VEC_LENGTH (inner_parms
);
2010 int did_error_intro
= 0;
2011 struct template_parm_data tpd
;
2012 struct template_parm_data tpd2
;
2014 /* We check that each of the template parameters given in the
2015 partial specialization is used in the argument list to the
2016 specialization. For example:
2018 template <class T> struct S;
2019 template <class T> struct S<T*>;
2021 The second declaration is OK because `T*' uses the template
2022 parameter T, whereas
2024 template <class T> struct S<int>;
2026 is no good. Even trickier is:
2037 The S2<T> declaration is actually illegal; it is a
2038 full-specialization. Of course,
2041 struct S2<T (*)(U)>;
2043 or some such would have been OK. */
2044 tpd
.level
= TMPL_PARMS_DEPTH (current_template_parms
);
2045 tpd
.parms
= alloca (sizeof (int) * ntparms
);
2046 bzero ((PTR
) tpd
.parms
, sizeof (int) * ntparms
);
2048 tpd
.arg_uses_template_parms
= alloca (sizeof (int) * nargs
);
2049 bzero ((PTR
) tpd
.arg_uses_template_parms
, sizeof (int) * nargs
);
2050 for (i
= 0; i
< nargs
; ++i
)
2052 tpd
.current_arg
= i
;
2053 for_each_template_parm (TREE_VEC_ELT (inner_args
, i
),
2054 &mark_template_parm
,
2057 for (i
= 0; i
< ntparms
; ++i
)
2058 if (tpd
.parms
[i
] == 0)
2060 /* One of the template parms was not used in the
2062 if (!did_error_intro
)
2064 cp_error ("template parameters not used in partial specialization:");
2065 did_error_intro
= 1;
2069 TREE_VALUE (TREE_VEC_ELT (inner_parms
, i
)));
2072 /* [temp.class.spec]
2074 The argument list of the specialization shall not be identical to
2075 the implicit argument list of the primary template. */
2076 if (comp_template_args (inner_args
,
2077 innermost_args (CLASSTYPE_TI_ARGS (TREE_TYPE
2079 cp_error ("partial specialization `%T' does not specialize any template arguments", type
);
2081 /* [temp.class.spec]
2083 A partially specialized non-type argument expression shall not
2084 involve template parameters of the partial specialization except
2085 when the argument expression is a simple identifier.
2087 The type of a template parameter corresponding to a specialized
2088 non-type argument shall not be dependent on a parameter of the
2090 my_friendly_assert (nargs
== DECL_NTPARMS (maintmpl
), 0);
2092 for (i
= 0; i
< nargs
; ++i
)
2094 tree arg
= TREE_VEC_ELT (inner_args
, i
);
2095 if (/* These first two lines are the `non-type' bit. */
2096 TREE_CODE_CLASS (TREE_CODE (arg
)) != 't'
2097 && TREE_CODE (arg
) != TEMPLATE_DECL
2098 /* This next line is the `argument expression is not just a
2099 simple identifier' condition and also the `specialized
2100 non-type argument' bit. */
2101 && TREE_CODE (arg
) != TEMPLATE_PARM_INDEX
)
2103 if (tpd
.arg_uses_template_parms
[i
])
2104 cp_error ("template argument `%E' involves template parameter(s)", arg
);
2107 /* Look at the corresponding template parameter,
2108 marking which template parameters its type depends
2111 TREE_TYPE (TREE_VALUE (TREE_VEC_ELT (main_inner_parms
,
2116 /* We haven't yet initialized TPD2. Do so now. */
2117 tpd2
.arg_uses_template_parms
2118 = (int*) alloca (sizeof (int) * nargs
);
2119 /* The number of parameters here is the number in the
2120 main template, which, as checked in the assertion
2122 tpd2
.parms
= (int*) alloca (sizeof (int) * nargs
);
2124 TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (maintmpl
));
2127 /* Mark the template parameters. But this time, we're
2128 looking for the template parameters of the main
2129 template, not in the specialization. */
2130 tpd2
.current_arg
= i
;
2131 tpd2
.arg_uses_template_parms
[i
] = 0;
2132 bzero ((PTR
) tpd2
.parms
, sizeof (int) * nargs
);
2133 for_each_template_parm (type
,
2134 &mark_template_parm
,
2137 if (tpd2
.arg_uses_template_parms
[i
])
2139 /* The type depended on some template parameters.
2140 If they are fully specialized in the
2141 specialization, that's OK. */
2143 for (j
= 0; j
< nargs
; ++j
)
2144 if (tpd2
.parms
[j
] != 0
2145 && tpd
.arg_uses_template_parms
[j
])
2147 cp_error ("type `%T' of template argument `%E' depends on template parameter(s)",
2157 if (retrieve_specialization (maintmpl
, specargs
))
2158 /* We've already got this specialization. */
2161 DECL_TEMPLATE_SPECIALIZATIONS (maintmpl
) = CLASSTYPE_TI_SPEC_INFO (type
)
2162 = perm_tree_cons (inner_args
, inner_parms
,
2163 DECL_TEMPLATE_SPECIALIZATIONS (maintmpl
));
2164 TREE_TYPE (DECL_TEMPLATE_SPECIALIZATIONS (maintmpl
)) = type
;
2168 /* Check that a template declaration's use of default arguments is not
2169 invalid. Here, PARMS are the template parameters. IS_PRIMARY is
2170 non-zero if DECL is the thing declared by a primary template.
2171 IS_PARTIAL is non-zero if DECL is a partial specialization. */
2174 check_default_tmpl_args (decl
, parms
, is_primary
, is_partial
)
2181 int last_level_to_check
;
2185 A default template-argument shall not be specified in a
2186 function template declaration or a function template definition, nor
2187 in the template-parameter-list of the definition of a member of a
2190 if (current_class_type
2191 && !TYPE_BEING_DEFINED (current_class_type
)
2192 && DECL_REAL_CONTEXT (decl
) == current_class_type
2193 && DECL_LANG_SPECIFIC (decl
)
2194 && DECL_DEFINED_IN_CLASS_P (decl
))
2195 /* We already checked these parameters when the template was
2196 declared, so there's no need to do it again now. This is an
2197 inline member function definition. */
2200 if (TREE_CODE (decl
) != TYPE_DECL
|| is_partial
|| !is_primary
)
2201 /* For an ordinary class template, default template arguments are
2202 allowed at the innermost level, e.g.:
2203 template <class T = int>
2205 but, in a partial specialization, they're not allowed even
2206 there, as we have in [temp.class.spec]:
2208 The template parameter list of a specialization shall not
2209 contain default template argument values.
2211 So, for a partial specialization, or for a function template,
2212 we look at all of them. */
2215 /* But, for a primary class template that is not a partial
2216 specialization we look at all template parameters except the
2218 parms
= TREE_CHAIN (parms
);
2220 /* Figure out what error message to issue. */
2221 if (TREE_CODE (decl
) == FUNCTION_DECL
)
2222 msg
= "default argument for template parameter in function template `%D'";
2223 else if (is_partial
)
2224 msg
= "default argument in partial specialization `%D'";
2226 msg
= "default argument for template parameter for class enclosing `%D'";
2228 if (current_class_type
&& TYPE_BEING_DEFINED (current_class_type
))
2229 /* If we're inside a class definition, there's no need to
2230 examine the parameters to the class itself. On the one
2231 hand, they will be checked when the class is defined, and,
2232 on the other, default arguments are legal in things like:
2233 template <class T = double>
2234 struct S { template <class U> void f(U); };
2235 Here the default argument for `S' has no bearing on the
2236 declaration of `f'. */
2237 last_level_to_check
= template_class_depth (current_class_type
) + 1;
2239 /* Check everything. */
2240 last_level_to_check
= 0;
2242 for (; parms
&& TMPL_PARMS_DEPTH (parms
) >= last_level_to_check
;
2243 parms
= TREE_CHAIN (parms
))
2245 tree inner_parms
= TREE_VALUE (parms
);
2248 ntparms
= TREE_VEC_LENGTH (inner_parms
);
2249 for (i
= 0; i
< ntparms
; ++i
)
2250 if (TREE_PURPOSE (TREE_VEC_ELT (inner_parms
, i
)))
2254 cp_error (msg
, decl
);
2258 /* Clear out the default argument so that we are not
2260 TREE_PURPOSE (TREE_VEC_ELT (inner_parms
, i
)) = NULL_TREE
;
2263 /* At this point, if we're still interested in issuing messages,
2264 they must apply to classes surrounding the object declared. */
2266 msg
= "default argument for template parameter for class enclosing `%D'";
2270 /* Creates a TEMPLATE_DECL for the indicated DECL using the template
2271 parameters given by current_template_args, or reuses a
2272 previously existing one, if appropriate. Returns the DECL, or an
2273 equivalent one, if it is replaced via a call to duplicate_decls.
2275 If IS_FRIEND is non-zero, DECL is a friend declaration. */
2278 push_template_decl_real (decl
, is_friend
)
2289 /* See if this is a partial specialization. */
2290 is_partial
= (TREE_CODE (decl
) == TYPE_DECL
&& DECL_ARTIFICIAL (decl
)
2291 && TREE_CODE (TREE_TYPE (decl
)) != ENUMERAL_TYPE
2292 && CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_TYPE (decl
)));
2294 is_friend
|= (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_FRIEND_P (decl
));
2297 /* For a friend, we want the context of the friend function, not
2298 the type of which it is a friend. */
2299 ctx
= DECL_CONTEXT (decl
);
2300 else if (DECL_REAL_CONTEXT (decl
)
2301 && TREE_CODE (DECL_REAL_CONTEXT (decl
)) != NAMESPACE_DECL
)
2302 /* In the case of a virtual function, we want the class in which
2304 ctx
= DECL_REAL_CONTEXT (decl
);
2306 /* Otherwise, if we're currently definining some class, the DECL
2307 is assumed to be a member of the class. */
2308 ctx
= current_class_type
;
2310 if (ctx
&& TREE_CODE (ctx
) == NAMESPACE_DECL
)
2313 if (!DECL_CONTEXT (decl
))
2314 DECL_CONTEXT (decl
) = FROB_CONTEXT (current_namespace
);
2316 /* For determining whether this is a primary template or not, we're really
2317 interested in the lexical context, not the true context. */
2319 info
= current_class_type
;
2323 /* See if this is a primary template. */
2324 if (info
&& TREE_CODE (info
) == FUNCTION_DECL
)
2326 /* Note that template_class_depth returns 0 if given NULL_TREE, so
2327 this next line works even when we are at global scope. */
2328 else if (processing_template_decl
> template_class_depth (info
))
2335 if (current_lang_name
== lang_name_c
)
2336 cp_error ("template with C linkage");
2337 if (TREE_CODE (decl
) == TYPE_DECL
&& ANON_AGGRNAME_P (DECL_NAME (decl
)))
2338 cp_error ("template class without a name");
2339 if (TREE_CODE (decl
) == TYPE_DECL
2340 && TREE_CODE (TREE_TYPE (decl
)) == ENUMERAL_TYPE
)
2341 cp_error ("template declaration of `%#T'", TREE_TYPE (decl
));
2344 /* Check to see that the rules regarding the use of default
2345 arguments are not being violated. */
2346 check_default_tmpl_args (decl
, current_template_parms
,
2347 primary
, is_partial
);
2350 return process_partial_specialization (decl
);
2352 args
= current_template_args ();
2355 || TREE_CODE (ctx
) == FUNCTION_DECL
2356 || TYPE_BEING_DEFINED (ctx
)
2357 || (is_friend
&& !DECL_TEMPLATE_INFO (decl
)))
2359 if (DECL_LANG_SPECIFIC (decl
)
2360 && DECL_TEMPLATE_INFO (decl
)
2361 && DECL_TI_TEMPLATE (decl
))
2362 tmpl
= DECL_TI_TEMPLATE (decl
);
2365 tmpl
= build_template_decl (decl
, current_template_parms
);
2367 if (DECL_LANG_SPECIFIC (decl
)
2368 && DECL_TEMPLATE_SPECIALIZATION (decl
))
2370 /* A specialization of a member template of a template
2372 SET_DECL_TEMPLATE_SPECIALIZATION (tmpl
);
2373 DECL_TEMPLATE_INFO (tmpl
) = DECL_TEMPLATE_INFO (decl
);
2374 DECL_TEMPLATE_INFO (decl
) = NULL_TREE
;
2380 tree a
, t
, current
, parms
;
2383 if (CLASSTYPE_TEMPLATE_INSTANTIATION (ctx
))
2384 cp_error ("must specialize `%#T' before defining member `%#D'",
2386 if (TREE_CODE (decl
) == TYPE_DECL
)
2388 if ((IS_AGGR_TYPE_CODE (TREE_CODE (TREE_TYPE (decl
)))
2389 || TREE_CODE (TREE_TYPE (decl
)) == ENUMERAL_TYPE
)
2390 && TYPE_TEMPLATE_INFO (TREE_TYPE (decl
))
2391 && TYPE_TI_TEMPLATE (TREE_TYPE (decl
)))
2392 tmpl
= TYPE_TI_TEMPLATE (TREE_TYPE (decl
));
2395 cp_error ("`%D' does not declare a template type", decl
);
2399 else if (! DECL_TEMPLATE_INFO (decl
))
2401 cp_error ("template definition of non-template `%#D'", decl
);
2405 tmpl
= DECL_TI_TEMPLATE (decl
);
2407 if (is_member_template (tmpl
)
2408 && DECL_FUNCTION_TEMPLATE_P (tmpl
)
2409 && DECL_TEMPLATE_INFO (decl
) && DECL_TI_ARGS (decl
)
2410 && DECL_TEMPLATE_SPECIALIZATION (decl
))
2414 /* The declaration is a specialization of a member
2415 template, declared outside the class. Therefore, the
2416 innermost template arguments will be NULL, so we
2417 replace them with the arguments determined by the
2418 earlier call to check_explicit_specialization. */
2419 args
= DECL_TI_ARGS (decl
);
2422 = build_template_decl (decl
, current_template_parms
);
2423 DECL_TEMPLATE_RESULT (new_tmpl
) = decl
;
2424 TREE_TYPE (new_tmpl
) = TREE_TYPE (decl
);
2425 DECL_TI_TEMPLATE (decl
) = new_tmpl
;
2426 SET_DECL_TEMPLATE_SPECIALIZATION (new_tmpl
);
2427 DECL_TEMPLATE_INFO (new_tmpl
) =
2428 perm_tree_cons (tmpl
, args
, NULL_TREE
);
2430 register_specialization (new_tmpl
, tmpl
, args
);
2434 /* Make sure the template headers we got make sense. */
2436 parms
= DECL_TEMPLATE_PARMS (tmpl
);
2437 i
= TMPL_PARMS_DEPTH (parms
);
2438 if (TMPL_ARGS_DEPTH (args
) != i
)
2440 cp_error ("expected %d levels of template parms for `%#D', got %d",
2441 i
, decl
, TMPL_ARGS_DEPTH (args
));
2444 for (current
= decl
; i
> 0; --i
, parms
= TREE_CHAIN (parms
))
2446 a
= TMPL_ARGS_LEVEL (args
, i
);
2447 t
= INNERMOST_TEMPLATE_PARMS (parms
);
2449 if (TREE_VEC_LENGTH (t
) != TREE_VEC_LENGTH (a
))
2451 if (current
== decl
)
2452 cp_error ("got %d template parameters for `%#D'",
2453 TREE_VEC_LENGTH (a
), decl
);
2455 cp_error ("got %d template parameters for `%#T'",
2456 TREE_VEC_LENGTH (a
), current
);
2457 cp_error (" but %d required", TREE_VEC_LENGTH (t
));
2460 /* Perhaps we should also check that the parms are used in the
2461 appropriate qualifying scopes in the declarator? */
2463 if (current
== decl
)
2466 current
= TYPE_CONTEXT (current
);
2470 DECL_TEMPLATE_RESULT (tmpl
) = decl
;
2471 TREE_TYPE (tmpl
) = TREE_TYPE (decl
);
2473 /* Push template declarations for global functions and types. Note
2474 that we do not try to push a global template friend declared in a
2475 template class; such a thing may well depend on the template
2476 parameters of the class. */
2478 && !(is_friend
&& template_class_depth (current_class_type
) > 0))
2479 tmpl
= pushdecl_namespace_level (tmpl
);
2482 DECL_PRIMARY_TEMPLATE (tmpl
) = tmpl
;
2484 info
= perm_tree_cons (tmpl
, args
, NULL_TREE
);
2486 if (TREE_CODE (decl
) == TYPE_DECL
&& DECL_ARTIFICIAL (decl
))
2488 SET_TYPE_TEMPLATE_INFO (TREE_TYPE (tmpl
), info
);
2489 if ((!ctx
|| TREE_CODE (ctx
) != FUNCTION_DECL
)
2490 && TREE_CODE (TREE_TYPE (decl
)) != ENUMERAL_TYPE
)
2491 DECL_NAME (decl
) = classtype_mangled_name (TREE_TYPE (decl
));
2493 else if (! DECL_LANG_SPECIFIC (decl
))
2494 cp_error ("template declaration of `%#D'", decl
);
2496 DECL_TEMPLATE_INFO (decl
) = info
;
2498 return DECL_TEMPLATE_RESULT (tmpl
);
2502 push_template_decl (decl
)
2505 return push_template_decl_real (decl
, 0);
2508 /* Called when a class template TYPE is redeclared with the indicated
2509 template PARMS, e.g.:
2511 template <class T> struct S;
2512 template <class T> struct S {}; */
2515 redeclare_class_template (type
, parms
)
2523 if (!TYPE_TEMPLATE_INFO (type
))
2525 cp_error ("`%T' is not a template type", type
);
2529 tmpl
= TYPE_TI_TEMPLATE (type
);
2530 if (!PRIMARY_TEMPLATE_P (tmpl
))
2531 /* The type is nested in some template class. Nothing to worry
2532 about here; there are no new template parameters for the nested
2536 parms
= INNERMOST_TEMPLATE_PARMS (parms
);
2537 tmpl_parms
= DECL_INNERMOST_TEMPLATE_PARMS (tmpl
);
2539 if (TREE_VEC_LENGTH (parms
) != TREE_VEC_LENGTH (tmpl_parms
))
2541 cp_error_at ("previous declaration `%D'", tmpl
);
2542 cp_error ("used %d template parameter%s instead of %d",
2543 TREE_VEC_LENGTH (tmpl_parms
),
2544 TREE_VEC_LENGTH (tmpl_parms
) == 1 ? "" : "s",
2545 TREE_VEC_LENGTH (parms
));
2549 for (i
= 0; i
< TREE_VEC_LENGTH (tmpl_parms
); ++i
)
2551 tree tmpl_parm
= TREE_VALUE (TREE_VEC_ELT (tmpl_parms
, i
));
2552 tree parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
2553 tree tmpl_default
= TREE_PURPOSE (TREE_VEC_ELT (tmpl_parms
, i
));
2554 tree parm_default
= TREE_PURPOSE (TREE_VEC_ELT (parms
, i
));
2556 if (TREE_CODE (tmpl_parm
) != TREE_CODE (parm
))
2558 cp_error_at ("template parameter `%#D'", tmpl_parm
);
2559 cp_error ("redeclared here as `%#D'", parm
);
2563 if (tmpl_default
!= NULL_TREE
&& parm_default
!= NULL_TREE
)
2565 /* We have in [temp.param]:
2567 A template-parameter may not be given default arguments
2568 by two different declarations in the same scope. */
2569 cp_error ("redefinition of default argument for `%#D'", parm
);
2570 cp_error_at (" original definition appeared here", tmpl_parm
);
2574 if (parm_default
!= NULL_TREE
)
2575 /* Update the previous template parameters (which are the ones
2576 that will really count) with the new default value. */
2577 TREE_PURPOSE (TREE_VEC_ELT (tmpl_parms
, i
)) = parm_default
;
2581 /* Attempt to convert the non-type template parameter EXPR to the
2582 indicated TYPE. If the conversion is successful, return the
2583 converted value. If the conversion is unsuccesful, return
2584 NULL_TREE if we issued an error message, or error_mark_node if we
2585 did not. We issue error messages for out-and-out bad template
2586 parameters, but not simply because the conversion failed, since we
2587 might be just trying to do argument deduction. By the time this
2588 function is called, neither TYPE nor EXPR may make use of template
2592 convert_nontype_argument (type
, expr
)
2596 tree expr_type
= TREE_TYPE (expr
);
2598 /* A template-argument for a non-type, non-template
2599 template-parameter shall be one of:
2601 --an integral constant-expression of integral or enumeration
2604 --the name of a non-type template-parameter; or
2606 --the name of an object or function with external linkage,
2607 including function templates and function template-ids but
2608 excluding non-static class members, expressed as id-expression;
2611 --the address of an object or function with external linkage,
2612 including function templates and function template-ids but
2613 excluding non-static class members, expressed as & id-expression
2614 where the & is optional if the name refers to a function or
2617 --a pointer to member expressed as described in _expr.unary.op_. */
2619 /* An integral constant-expression can include const variables
2621 if (INTEGRAL_TYPE_P (expr_type
) && TREE_READONLY_DECL_P (expr
))
2622 expr
= decl_constant_value (expr
);
2624 if (is_overloaded_fn (expr
))
2625 /* OK for now. We'll check that it has external linkage later.
2626 Check this first since if expr_type is the unknown_type_node
2627 we would otherwise complain below. */
2629 else if (TYPE_PTRMEM_P (expr_type
)
2630 || TYPE_PTRMEMFUNC_P (expr_type
))
2632 if (TREE_CODE (expr
) != PTRMEM_CST
)
2635 else if (TYPE_PTR_P (expr_type
)
2636 || TYPE_PTRMEM_P (expr_type
)
2637 || TREE_CODE (expr_type
) == ARRAY_TYPE
2638 || TREE_CODE (type
) == REFERENCE_TYPE
2639 /* If expr is the address of an overloaded function, we
2640 will get the unknown_type_node at this point. */
2641 || expr_type
== unknown_type_node
)
2647 if (TREE_CODE (type
) == REFERENCE_TYPE
2648 || TREE_CODE (expr_type
) == ARRAY_TYPE
)
2652 if (TREE_CODE (e
) != ADDR_EXPR
)
2655 cp_error ("`%E' is not a valid template argument", expr
);
2656 if (TYPE_PTR_P (expr_type
))
2658 if (TREE_CODE (TREE_TYPE (expr_type
)) == FUNCTION_TYPE
)
2659 cp_error ("it must be the address of a function with external linkage");
2661 cp_error ("it must be the address of an object with external linkage");
2663 else if (TYPE_PTRMEM_P (expr_type
)
2664 || TYPE_PTRMEMFUNC_P (expr_type
))
2665 cp_error ("it must be a pointer-to-member of the form `&X::Y'");
2670 referent
= TREE_OPERAND (e
, 0);
2671 STRIP_NOPS (referent
);
2674 if (TREE_CODE (referent
) == STRING_CST
)
2676 cp_error ("string literal %E is not a valid template argument",
2678 error ("because it is the address of an object with static linkage");
2682 if (is_overloaded_fn (referent
))
2683 /* We'll check that it has external linkage later. */
2685 else if (TREE_CODE (referent
) != VAR_DECL
)
2687 else if (!TREE_PUBLIC (referent
))
2689 cp_error ("address of non-extern `%E' cannot be used as template argument", referent
);
2690 return error_mark_node
;
2693 else if (INTEGRAL_TYPE_P (expr_type
)
2694 || TYPE_PTRMEM_P (expr_type
)
2695 || TYPE_PTRMEMFUNC_P (expr_type
)
2696 /* The next two are g++ extensions. */
2697 || TREE_CODE (expr_type
) == REAL_TYPE
2698 || TREE_CODE (expr_type
) == COMPLEX_TYPE
)
2700 if (! TREE_CONSTANT (expr
))
2703 cp_error ("non-constant `%E' cannot be used as template argument",
2710 cp_error ("object `%E' cannot be used as template argument", expr
);
2714 switch (TREE_CODE (type
))
2719 /* For a non-type template-parameter of integral or enumeration
2720 type, integral promotions (_conv.prom_) and integral
2721 conversions (_conv.integral_) are applied. */
2722 if (!INTEGRAL_TYPE_P (expr_type
))
2723 return error_mark_node
;
2725 /* It's safe to call digest_init in this case; we know we're
2726 just converting one integral constant expression to another. */
2727 expr
= digest_init (type
, expr
, (tree
*) 0);
2729 if (TREE_CODE (expr
) != INTEGER_CST
)
2730 /* Curiously, some TREE_CONSTANT integral expressions do not
2731 simplify to integer constants. For example, `3 % 0',
2732 remains a TRUNC_MOD_EXPR. */
2739 /* These are g++ extensions. */
2740 if (TREE_CODE (expr_type
) != TREE_CODE (type
))
2741 return error_mark_node
;
2743 expr
= digest_init (type
, expr
, (tree
*) 0);
2745 if (TREE_CODE (expr
) != REAL_CST
)
2752 tree type_pointed_to
= TREE_TYPE (type
);
2754 if (TYPE_PTRMEM_P (type
))
2758 /* For a non-type template-parameter of type pointer to data
2759 member, qualification conversions (_conv.qual_) are
2761 e
= perform_qualification_conversions (type
, expr
);
2762 if (TREE_CODE (e
) == NOP_EXPR
)
2764 /* The call to perform_qualification_conversions will
2765 insert a NOP_EXPR over EXPR to do express
2766 conversion, if necessary. But, that will confuse
2767 us if we use this (converted) template parameter to
2768 instantiate another template; then the thing will
2769 not look like a valid template argument. So, just
2770 make a new constant, of the appropriate type. */
2771 e
= make_node (PTRMEM_CST
);
2772 TREE_TYPE (e
) = type
;
2773 PTRMEM_CST_MEMBER (e
) = PTRMEM_CST_MEMBER (expr
);
2777 else if (TREE_CODE (type_pointed_to
) == FUNCTION_TYPE
)
2779 /* For a non-type template-parameter of type pointer to
2780 function, only the function-to-pointer conversion
2781 (_conv.func_) is applied. If the template-argument
2782 represents a set of overloaded functions (or a pointer to
2783 such), the matching function is selected from the set
2788 if (TREE_CODE (expr
) == ADDR_EXPR
)
2789 fns
= TREE_OPERAND (expr
, 0);
2793 fn
= instantiate_type (type_pointed_to
, fns
, 0);
2795 if (fn
== error_mark_node
)
2796 return error_mark_node
;
2798 if (!TREE_PUBLIC (fn
))
2800 if (really_overloaded_fn (fns
))
2801 return error_mark_node
;
2806 expr
= build_unary_op (ADDR_EXPR
, fn
, 0);
2808 my_friendly_assert (same_type_p (type
, TREE_TYPE (expr
)),
2814 /* For a non-type template-parameter of type pointer to
2815 object, qualification conversions (_conv.qual_) and the
2816 array-to-pointer conversion (_conv.array_) are applied.
2817 [Note: In particular, neither the null pointer conversion
2818 (_conv.ptr_) nor the derived-to-base conversion
2819 (_conv.ptr_) are applied. Although 0 is a valid
2820 template-argument for a non-type template-parameter of
2821 integral type, it is not a valid template-argument for a
2822 non-type template-parameter of pointer type.]
2824 The call to decay_conversion performs the
2825 array-to-pointer conversion, if appropriate. */
2826 expr
= decay_conversion (expr
);
2828 if (expr
== error_mark_node
)
2829 return error_mark_node
;
2831 return perform_qualification_conversions (type
, expr
);
2836 case REFERENCE_TYPE
:
2838 tree type_referred_to
= TREE_TYPE (type
);
2840 if (TREE_CODE (type_referred_to
) == FUNCTION_TYPE
)
2842 /* For a non-type template-parameter of type reference to
2843 function, no conversions apply. If the
2844 template-argument represents a set of overloaded
2845 functions, the matching function is selected from the
2846 set (_over.over_). */
2850 fn
= instantiate_type (type_referred_to
, fns
, 0);
2852 if (fn
== error_mark_node
)
2853 return error_mark_node
;
2855 if (!TREE_PUBLIC (fn
))
2857 if (really_overloaded_fn (fns
))
2858 /* Don't issue an error here; we might get a different
2859 function if the overloading had worked out
2861 return error_mark_node
;
2866 my_friendly_assert (same_type_p (type_referred_to
,
2874 /* For a non-type template-parameter of type reference to
2875 object, no conversions apply. The type referred to by the
2876 reference may be more cv-qualified than the (otherwise
2877 identical) type of the template-argument. The
2878 template-parameter is bound directly to the
2879 template-argument, which must be an lvalue. */
2880 if ((TYPE_MAIN_VARIANT (expr_type
)
2881 != TYPE_MAIN_VARIANT (type_referred_to
))
2882 || !at_least_as_qualified_p (type_referred_to
,
2884 || !real_lvalue_p (expr
))
2885 return error_mark_node
;
2894 if (!TYPE_PTRMEMFUNC_P (type
))
2895 /* This handles templates like
2896 template<class T, T t> void f();
2897 when T is substituted with any class. The second template
2898 parameter becomes invalid and the template candidate is
2900 return error_mark_node
;
2902 /* For a non-type template-parameter of type pointer to member
2903 function, no conversions apply. If the template-argument
2904 represents a set of overloaded member functions, the
2905 matching member function is selected from the set
2908 if (!TYPE_PTRMEMFUNC_P (expr_type
) &&
2909 expr_type
!= unknown_type_node
)
2910 return error_mark_node
;
2912 if (TREE_CODE (expr
) == PTRMEM_CST
)
2914 /* A ptr-to-member constant. */
2915 if (!same_type_p (type
, expr_type
))
2916 return error_mark_node
;
2921 if (TREE_CODE (expr
) != ADDR_EXPR
)
2922 return error_mark_node
;
2924 expr
= instantiate_type (type
, expr
, 0);
2926 if (expr
== error_mark_node
)
2927 return error_mark_node
;
2929 my_friendly_assert (same_type_p (type
, TREE_TYPE (expr
)),
2936 /* All non-type parameters must have one of these types. */
2937 my_friendly_abort (0);
2941 return error_mark_node
;
2944 /* Return 1 if PARM_PARMS and ARG_PARMS matches using rule for
2945 template template parameters. Both PARM_PARMS and ARG_PARMS are
2946 vectors of TREE_LIST nodes containing TYPE_DECL, TEMPLATE_DECL
2949 ARG_PARMS may contain more parameters than PARM_PARMS. If this is
2950 the case, then extra parameters must have default arguments.
2952 Consider the example:
2953 template <class T, class Allocator = allocator> class vector;
2954 template<template <class U> class TT> class C;
2956 C<vector> is a valid instantiation. PARM_PARMS for the above code
2957 contains a TYPE_DECL (for U), ARG_PARMS contains two TYPE_DECLs (for
2958 T and Allocator) and OUTER_ARGS contains the argument that is used to
2959 substitute the TT parameter. */
2962 coerce_template_template_parms (parm_parms
, arg_parms
, complain
,
2963 in_decl
, outer_args
)
2964 tree parm_parms
, arg_parms
;
2966 tree in_decl
, outer_args
;
2968 int nparms
, nargs
, i
;
2971 my_friendly_assert (TREE_CODE (parm_parms
) == TREE_VEC
, 0);
2972 my_friendly_assert (TREE_CODE (arg_parms
) == TREE_VEC
, 0);
2974 nparms
= TREE_VEC_LENGTH (parm_parms
);
2975 nargs
= TREE_VEC_LENGTH (arg_parms
);
2977 /* The rule here is opposite of coerce_template_parms. */
2980 && TREE_PURPOSE (TREE_VEC_ELT (arg_parms
, nparms
)) == NULL_TREE
))
2983 for (i
= 0; i
< nparms
; ++i
)
2985 parm
= TREE_VALUE (TREE_VEC_ELT (parm_parms
, i
));
2986 arg
= TREE_VALUE (TREE_VEC_ELT (arg_parms
, i
));
2988 if (arg
== NULL_TREE
|| arg
== error_mark_node
2989 || parm
== NULL_TREE
|| parm
== error_mark_node
)
2992 if (TREE_CODE (arg
) != TREE_CODE (parm
))
2995 switch (TREE_CODE (parm
))
3001 /* We encounter instantiations of templates like
3002 template <template <template <class> class> class TT>
3005 tree parmparm
= DECL_INNERMOST_TEMPLATE_PARMS (parm
);
3006 tree argparm
= DECL_INNERMOST_TEMPLATE_PARMS (arg
);
3008 if (!coerce_template_template_parms (parmparm
, argparm
,
3016 /* The tsubst call is used to handle cases such as
3017 template <class T, template <T> class TT> class D;
3018 i.e. the parameter list of TT depends on earlier parameters. */
3019 if (!same_type_p (tsubst (TREE_TYPE (parm
), outer_args
,
3026 my_friendly_abort (0);
3032 /* Convert the indicated template ARG as necessary to match the
3033 indicated template PARM. Returns the converted ARG, or
3034 error_mark_node if the conversion was unsuccessful. Error messages
3035 are issued if COMPLAIN is non-zero. This conversion is for the Ith
3036 parameter in the parameter list. ARGS is the full set of template
3037 arguments deduced so far. */
3040 convert_template_argument (parm
, arg
, args
, complain
, i
, in_decl
)
3050 int is_type
, requires_type
, is_tmpl_type
, requires_tmpl_type
;
3052 inner_args
= innermost_args (args
);
3054 if (TREE_CODE (arg
) == TREE_LIST
3055 && TREE_TYPE (arg
) != NULL_TREE
3056 && TREE_CODE (TREE_TYPE (arg
)) == OFFSET_TYPE
)
3058 /* The template argument was the name of some
3059 member function. That's usually
3060 illegal, but static members are OK. In any
3061 case, grab the underlying fields/functions
3062 and issue an error later if required. */
3063 arg
= TREE_VALUE (arg
);
3064 TREE_TYPE (arg
) = unknown_type_node
;
3067 requires_tmpl_type
= TREE_CODE (parm
) == TEMPLATE_DECL
;
3068 requires_type
= (TREE_CODE (parm
) == TYPE_DECL
3069 || requires_tmpl_type
);
3071 /* Check if it is a class template. If REQUIRES_TMPL_TYPE is true,
3072 we also accept implicitly created TYPE_DECL as a valid argument.
3073 This is necessary to handle the case where we pass a template name
3074 to a template template parameter in a scope where we've derived from
3075 in instantiation of that template, so the template name refers to that
3076 instantiation. We really ought to handle this better. */
3078 = ((TREE_CODE (arg
) == TEMPLATE_DECL
3079 && TREE_CODE (DECL_TEMPLATE_RESULT (arg
)) == TYPE_DECL
)
3080 || (TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
3081 && !TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (arg
))
3082 || (TREE_CODE (arg
) == RECORD_TYPE
3083 && CLASSTYPE_TEMPLATE_INFO (arg
)
3084 && TREE_CODE (TYPE_NAME (arg
)) == TYPE_DECL
3085 && DECL_ARTIFICIAL (TYPE_NAME (arg
))
3086 && requires_tmpl_type
3087 && is_base_of_enclosing_class (arg
, current_class_type
)));
3088 if (is_tmpl_type
&& TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
)
3089 arg
= TYPE_STUB_DECL (arg
);
3090 else if (is_tmpl_type
&& TREE_CODE (arg
) == RECORD_TYPE
)
3091 arg
= CLASSTYPE_TI_TEMPLATE (arg
);
3093 is_type
= TREE_CODE_CLASS (TREE_CODE (arg
)) == 't' || is_tmpl_type
;
3095 if (requires_type
&& ! is_type
&& TREE_CODE (arg
) == SCOPE_REF
3096 && TREE_CODE (TREE_OPERAND (arg
, 0)) == TEMPLATE_TYPE_PARM
)
3098 cp_pedwarn ("to refer to a type member of a template parameter,");
3099 cp_pedwarn (" use `typename %E'", arg
);
3101 arg
= make_typename_type (TREE_OPERAND (arg
, 0),
3102 TREE_OPERAND (arg
, 1));
3105 if (is_type
!= requires_type
)
3111 cp_error ("type/value mismatch at argument %d in template parameter list for `%D'",
3114 cp_error (" expected a constant of type `%T', got `%T'",
3116 (is_tmpl_type
? DECL_NAME (arg
) : arg
));
3118 cp_error (" expected a type, got `%E'", arg
);
3121 return error_mark_node
;
3123 if (is_tmpl_type
^ requires_tmpl_type
)
3125 if (in_decl
&& complain
)
3127 cp_error ("type/value mismatch at argument %d in template parameter list for `%D'",
3130 cp_error (" expected a type, got `%T'", DECL_NAME (arg
));
3132 cp_error (" expected a class template, got `%T'", arg
);
3134 return error_mark_node
;
3139 if (requires_tmpl_type
)
3141 tree parmparm
= DECL_INNERMOST_TEMPLATE_PARMS (parm
);
3142 tree argparm
= DECL_INNERMOST_TEMPLATE_PARMS (arg
);
3144 if (coerce_template_template_parms (parmparm
, argparm
, complain
,
3145 in_decl
, inner_args
))
3149 /* TEMPLATE_TEMPLATE_PARM node is preferred over
3151 if (val
!= error_mark_node
3152 && DECL_TEMPLATE_TEMPLATE_PARM_P (val
))
3153 val
= TREE_TYPE (val
);
3157 if (in_decl
&& complain
)
3159 cp_error ("type/value mismatch at argument %d in template parameter list for `%D'",
3161 cp_error (" expected a template of type `%D', got `%D'", parm
, arg
);
3164 val
= error_mark_node
;
3169 val
= groktypename (arg
);
3170 if (! processing_template_decl
)
3172 /* [basic.link]: A name with no linkage (notably, the
3173 name of a class or enumeration declared in a local
3174 scope) shall not be used to declare an entity with
3175 linkage. This implies that names with no linkage
3176 cannot be used as template arguments. */
3177 tree t
= no_linkage_check (val
);
3180 if (ANON_AGGRNAME_P (TYPE_IDENTIFIER (t
)))
3182 ("template-argument `%T' uses anonymous type", val
);
3185 ("template-argument `%T' uses local type `%T'",
3187 return error_mark_node
;
3194 tree t
= tsubst (TREE_TYPE (parm
), args
, complain
, in_decl
);
3196 if (processing_template_decl
)
3197 arg
= maybe_fold_nontype_arg (arg
);
3199 if (!uses_template_parms (arg
) && !uses_template_parms (t
))
3200 /* We used to call digest_init here. However, digest_init
3201 will report errors, which we don't want when complain
3202 is zero. More importantly, digest_init will try too
3203 hard to convert things: for example, `0' should not be
3204 converted to pointer type at this point according to
3205 the standard. Accepting this is not merely an
3206 extension, since deciding whether or not these
3207 conversions can occur is part of determining which
3208 function template to call, or whether a given epxlicit
3209 argument specification is legal. */
3210 val
= convert_nontype_argument (t
, arg
);
3214 if (val
== NULL_TREE
)
3215 val
= error_mark_node
;
3216 else if (val
== error_mark_node
&& complain
)
3217 cp_error ("could not convert template argument `%E' to `%T'",
3224 /* Convert all template arguments to their appropriate types, and
3225 return a vector containing the innermost resulting template
3226 arguments. If any error occurs, return error_mark_node, and, if
3227 COMPLAIN is non-zero, issue an error message. Some error messages
3228 are issued even if COMPLAIN is zero; for instance, if a template
3229 argument is composed from a local class.
3231 If REQUIRE_ALL_ARGUMENTS is non-zero, all arguments must be
3232 provided in ARGLIST, or else trailing parameters must have default
3233 values. If REQUIRE_ALL_ARGUMENTS is zero, we will attempt argument
3234 deduction for any unspecified trailing arguments.
3236 The resulting TREE_VEC is allocated on a temporary obstack, and
3237 must be explicitly copied if it will be permanent. */
3240 coerce_template_parms (parms
, args
, in_decl
,
3242 require_all_arguments
)
3246 int require_all_arguments
;
3248 int nparms
, nargs
, i
, lost
= 0;
3251 tree new_inner_args
;
3253 inner_args
= innermost_args (args
);
3254 nargs
= NUM_TMPL_ARGS (inner_args
);
3255 nparms
= TREE_VEC_LENGTH (parms
);
3259 && require_all_arguments
3260 && TREE_PURPOSE (TREE_VEC_ELT (parms
, nargs
)) == NULL_TREE
))
3264 cp_error ("wrong number of template arguments (%d, should be %d)",
3268 cp_error_at ("provided for `%D'", in_decl
);
3271 return error_mark_node
;
3274 new_inner_args
= make_temp_vec (nparms
);
3275 new_args
= add_outermost_template_args (args
, new_inner_args
);
3276 for (i
= 0; i
< nparms
; i
++)
3281 /* Get the Ith template parameter. */
3282 parm
= TREE_VEC_ELT (parms
, i
);
3284 /* Calculate the Ith argument. */
3285 if (inner_args
&& TREE_CODE (inner_args
) == TREE_LIST
)
3287 arg
= TREE_VALUE (inner_args
);
3288 inner_args
= TREE_CHAIN (inner_args
);
3291 arg
= TREE_VEC_ELT (inner_args
, i
);
3292 /* If no template argument was supplied, look for a default
3294 else if (TREE_PURPOSE (parm
) == NULL_TREE
)
3296 /* There was no default value. */
3297 my_friendly_assert (!require_all_arguments
, 0);
3300 else if (TREE_CODE (TREE_VALUE (parm
)) == TYPE_DECL
)
3301 arg
= tsubst (TREE_PURPOSE (parm
), new_args
, complain
, in_decl
);
3303 arg
= tsubst_expr (TREE_PURPOSE (parm
), new_args
, complain
,
3306 /* Now, convert the Ith argument, as necessary. */
3307 if (arg
== NULL_TREE
)
3308 /* We're out of arguments. */
3310 my_friendly_assert (!require_all_arguments
, 0);
3313 else if (arg
== error_mark_node
)
3315 cp_error ("template argument %d is invalid", i
+ 1);
3316 arg
= error_mark_node
;
3319 arg
= convert_template_argument (TREE_VALUE (parm
),
3320 arg
, new_args
, complain
, i
,
3323 if (arg
== error_mark_node
)
3325 TREE_VEC_ELT (new_inner_args
, i
) = arg
;
3329 return error_mark_node
;
3331 return new_inner_args
;
3334 /* Returns 1 if template args OT and NT are equivalent. */
3337 template_args_equal (ot
, nt
)
3342 if (TREE_CODE (nt
) != TREE_CODE (ot
))
3344 if (TREE_CODE (nt
) == TREE_VEC
)
3345 /* For member templates */
3346 return comp_template_args (ot
, nt
);
3347 else if (TREE_CODE_CLASS (TREE_CODE (ot
)) == 't')
3348 return same_type_p (ot
, nt
);
3350 return (cp_tree_equal (ot
, nt
) > 0);
3353 /* Returns 1 iff the OLDARGS and NEWARGS are in fact identical sets
3354 of template arguments. Returns 0 otherwise. */
3357 comp_template_args (oldargs
, newargs
)
3358 tree oldargs
, newargs
;
3362 if (TREE_VEC_LENGTH (oldargs
) != TREE_VEC_LENGTH (newargs
))
3365 for (i
= 0; i
< TREE_VEC_LENGTH (oldargs
); ++i
)
3367 tree nt
= TREE_VEC_ELT (newargs
, i
);
3368 tree ot
= TREE_VEC_ELT (oldargs
, i
);
3370 if (! template_args_equal (ot
, nt
))
3376 /* Given class template name and parameter list, produce a user-friendly name
3377 for the instantiation. */
3380 mangle_class_name_for_template (name
, parms
, arglist
)
3382 tree parms
, arglist
;
3384 static struct obstack scratch_obstack
;
3385 static char *scratch_firstobj
;
3388 if (!scratch_firstobj
)
3389 gcc_obstack_init (&scratch_obstack
);
3391 obstack_free (&scratch_obstack
, scratch_firstobj
);
3392 scratch_firstobj
= obstack_alloc (&scratch_obstack
, 1);
3394 #define ccat(c) obstack_1grow (&scratch_obstack, (c));
3395 #define cat(s) obstack_grow (&scratch_obstack, (s), strlen (s))
3399 nparms
= TREE_VEC_LENGTH (parms
);
3400 arglist
= innermost_args (arglist
);
3401 my_friendly_assert (nparms
== TREE_VEC_LENGTH (arglist
), 268);
3402 for (i
= 0; i
< nparms
; i
++)
3404 tree parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
3405 tree arg
= TREE_VEC_ELT (arglist
, i
);
3410 if (TREE_CODE (parm
) == TYPE_DECL
)
3412 cat (type_as_string_real (arg
, 0, 1));
3415 else if (TREE_CODE (parm
) == TEMPLATE_DECL
)
3417 if (TREE_CODE (arg
) == TEMPLATE_DECL
)
3419 /* Already substituted with real template. Just output
3420 the template name here */
3421 tree context
= DECL_CONTEXT (arg
);
3424 my_friendly_assert (TREE_CODE (context
) == NAMESPACE_DECL
, 980422);
3425 cat(decl_as_string (DECL_CONTEXT (arg
), 0));
3428 cat (IDENTIFIER_POINTER (DECL_NAME (arg
)));
3431 /* Output the parameter declaration */
3432 cat (type_as_string_real (arg
, 0, 1));
3436 my_friendly_assert (TREE_CODE (parm
) == PARM_DECL
, 269);
3438 if (TREE_CODE (arg
) == TREE_LIST
)
3440 /* New list cell was built because old chain link was in
3442 my_friendly_assert (TREE_PURPOSE (arg
) == NULL_TREE
, 270);
3443 arg
= TREE_VALUE (arg
);
3445 /* No need to check arglist against parmlist here; we did that
3446 in coerce_template_parms, called from lookup_template_class. */
3447 cat (expr_as_string (arg
, 0));
3450 char *bufp
= obstack_next_free (&scratch_obstack
);
3452 while (bufp
[offset
- 1] == ' ')
3454 obstack_blank_fast (&scratch_obstack
, offset
);
3456 /* B<C<char> >, not B<C<char>> */
3457 if (bufp
[offset
- 1] == '>')
3462 return (char *) obstack_base (&scratch_obstack
);
3466 classtype_mangled_name (t
)
3469 if (CLASSTYPE_TEMPLATE_INFO (t
)
3470 /* Specializations have already had their names set up in
3471 lookup_template_class. */
3472 && !CLASSTYPE_TEMPLATE_SPECIALIZATION (t
))
3474 tree tmpl
= most_general_template (CLASSTYPE_TI_TEMPLATE (t
));
3476 /* For non-primary templates, the template parameters are
3477 implicit from their surrounding context. */
3478 if (PRIMARY_TEMPLATE_P (tmpl
))
3480 tree name
= DECL_NAME (tmpl
);
3481 char *mangled_name
= mangle_class_name_for_template
3482 (IDENTIFIER_POINTER (name
),
3483 DECL_INNERMOST_TEMPLATE_PARMS (tmpl
),
3484 CLASSTYPE_TI_ARGS (t
));
3485 tree id
= get_identifier (mangled_name
);
3486 IDENTIFIER_TEMPLATE (id
) = name
;
3491 return TYPE_IDENTIFIER (t
);
3495 add_pending_template (d
)
3500 if (TREE_CODE_CLASS (TREE_CODE (d
)) == 't')
3501 ti
= CLASSTYPE_TEMPLATE_INFO (d
);
3503 ti
= DECL_TEMPLATE_INFO (d
);
3505 if (TI_PENDING_TEMPLATE_FLAG (ti
))
3508 *template_tail
= perm_tree_cons
3509 (build_srcloc_here (), d
, NULL_TREE
);
3510 template_tail
= &TREE_CHAIN (*template_tail
);
3511 TI_PENDING_TEMPLATE_FLAG (ti
) = 1;
3515 /* Return a TEMPLATE_ID_EXPR corresponding to the indicated FNS (which
3516 may be either a _DECL or an overloaded function or an
3517 IDENTIFIER_NODE), and ARGLIST. */
3520 lookup_template_function (fns
, arglist
)
3525 if (fns
== NULL_TREE
)
3527 cp_error ("non-template used as template");
3528 return error_mark_node
;
3531 type
= TREE_TYPE (fns
);
3532 if (TREE_CODE (fns
) == OVERLOAD
|| !type
)
3533 type
= unknown_type_node
;
3535 if (processing_template_decl
)
3536 return build_min (TEMPLATE_ID_EXPR
, type
, fns
, arglist
);
3538 return build (TEMPLATE_ID_EXPR
, type
, fns
, arglist
);
3541 /* Within the scope of a template class S<T>, the name S gets bound
3542 (in build_self_reference) to a TYPE_DECL for the class, not a
3543 TEMPLATE_DECL. If DECL is a TYPE_DECL for current_class_type,
3544 or one of its enclosing classes, and that type is a template,
3545 return the associated TEMPLATE_DECL. Otherwise, the original
3546 DECL is returned. */
3549 maybe_get_template_decl_from_type_decl (decl
)
3552 return (decl
!= NULL_TREE
3553 && TREE_CODE (decl
) == TYPE_DECL
3554 && DECL_ARTIFICIAL (decl
)
3555 && CLASSTYPE_TEMPLATE_INFO (TREE_TYPE (decl
)))
3556 ? CLASSTYPE_TI_TEMPLATE (TREE_TYPE (decl
)) : decl
;
3559 /* Given an IDENTIFIER_NODE (type TEMPLATE_DECL) and a chain of
3560 parameters, find the desired type.
3562 D1 is the PTYPENAME terminal, and ARGLIST is the list of arguments.
3563 (Actually ARGLIST may be either a TREE_LIST or a TREE_VEC. It will
3564 be a TREE_LIST if called directly from the parser, and a TREE_VEC
3565 otherwise.) Since ARGLIST is build on the decl_obstack, we must
3566 copy it here to keep it from being reclaimed when the decl storage
3569 IN_DECL, if non-NULL, is the template declaration we are trying to
3572 If ENTERING_SCOPE is non-zero, we are about to enter the scope of
3573 the class we are looking up.
3575 If the template class is really a local class in a template
3576 function, then the FUNCTION_CONTEXT is the function in which it is
3577 being instantiated. */
3580 lookup_template_class (d1
, arglist
, in_decl
, context
, entering_scope
)
3586 tree
template = NULL_TREE
, parmlist
;
3589 if (TREE_CODE (d1
) == IDENTIFIER_NODE
)
3591 if (IDENTIFIER_VALUE (d1
)
3592 && DECL_TEMPLATE_TEMPLATE_PARM_P (IDENTIFIER_VALUE (d1
)))
3593 template = IDENTIFIER_VALUE (d1
);
3597 push_decl_namespace (context
);
3598 if (current_class_type
!= NULL_TREE
)
3600 maybe_get_template_decl_from_type_decl
3601 (IDENTIFIER_CLASS_VALUE (d1
));
3602 if (template == NULL_TREE
)
3603 template = lookup_name_nonclass (d1
);
3605 pop_decl_namespace ();
3608 context
= DECL_CONTEXT (template);
3610 else if (TREE_CODE (d1
) == TYPE_DECL
&& IS_AGGR_TYPE (TREE_TYPE (d1
)))
3612 tree type
= TREE_TYPE (d1
);
3614 /* If we are declaring a constructor, say A<T>::A<T>, we will get
3615 an implicit typename for the second A. Deal with it. */
3616 if (TREE_CODE (type
) == TYPENAME_TYPE
&& TREE_TYPE (type
))
3617 type
= TREE_TYPE (type
);
3619 if (CLASSTYPE_TEMPLATE_INFO (type
))
3621 template = CLASSTYPE_TI_TEMPLATE (type
);
3622 d1
= DECL_NAME (template);
3625 else if (TREE_CODE (d1
) == ENUMERAL_TYPE
3626 || (TREE_CODE_CLASS (TREE_CODE (d1
)) == 't'
3627 && IS_AGGR_TYPE (d1
)))
3629 template = TYPE_TI_TEMPLATE (d1
);
3630 d1
= DECL_NAME (template);
3632 else if (TREE_CODE (d1
) == TEMPLATE_DECL
3633 && TREE_CODE (DECL_RESULT (d1
)) == TYPE_DECL
)
3636 d1
= DECL_NAME (template);
3637 context
= DECL_CONTEXT (template);
3640 my_friendly_abort (272);
3642 /* With something like `template <class T> class X class X { ... };'
3643 we could end up with D1 having nothing but an IDENTIFIER_VALUE.
3644 We don't want to do that, but we have to deal with the situation,
3645 so let's give them some syntax errors to chew on instead of a
3649 cp_error ("`%T' is not a template", d1
);
3650 return error_mark_node
;
3653 if (context
== NULL_TREE
)
3654 context
= global_namespace
;
3656 if (TREE_CODE (template) != TEMPLATE_DECL
)
3658 cp_error ("non-template type `%T' used as a template", d1
);
3660 cp_error_at ("for template declaration `%D'", in_decl
);
3661 return error_mark_node
;
3664 if (DECL_TEMPLATE_TEMPLATE_PARM_P (template))
3666 /* Create a new TEMPLATE_DECL and TEMPLATE_TEMPLATE_PARM node to store
3667 template arguments */
3669 tree parm
= copy_template_template_parm (TREE_TYPE (template));
3670 tree template2
= TYPE_STUB_DECL (parm
);
3673 parmlist
= DECL_INNERMOST_TEMPLATE_PARMS (template);
3675 arglist2
= coerce_template_parms (parmlist
, arglist
, template, 1, 1);
3676 if (arglist2
== error_mark_node
)
3677 return error_mark_node
;
3679 arglist2
= copy_to_permanent (arglist2
);
3680 TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (parm
)
3681 = perm_tree_cons (template2
, arglist2
, NULL_TREE
);
3682 TYPE_SIZE (parm
) = 0;
3687 tree template_type
= TREE_TYPE (template);
3690 tree found
= NULL_TREE
;
3693 int is_partial_instantiation
;
3695 gen_tmpl
= most_general_template (template);
3696 parmlist
= DECL_TEMPLATE_PARMS (gen_tmpl
);
3697 parm_depth
= TMPL_PARMS_DEPTH (parmlist
);
3698 arg_depth
= TMPL_ARGS_DEPTH (arglist
);
3700 /* We build up the coerced arguments and such on the
3701 momentary_obstack. */
3704 if (arg_depth
== 1 && parm_depth
> 1)
3706 /* We've been given an incomplete set of template arguments.
3709 template <class T> struct S1 {
3710 template <class U> struct S2 {};
3711 template <class U> struct S2<U*> {};
3714 we will be called with an ARGLIST of `U*', but the
3715 TEMPLATE will be `template <class T> template
3716 <class U> struct S1<T>::S2'. We must fill in the missing
3719 = add_outermost_template_args (TYPE_TI_ARGS (TREE_TYPE (template)),
3721 arg_depth
= TMPL_ARGS_DEPTH (arglist
);
3724 /* Now we should enough arguments. */
3725 my_friendly_assert (parm_depth
== arg_depth
, 0);
3727 /* From here on, we're only interested in the most general
3729 template = gen_tmpl
;
3731 /* Calculate the BOUND_ARGS. These will be the args that are
3732 actually tsubst'd into the definition to create the
3736 /* We have multiple levels of arguments to coerce, at once. */
3738 int saved_depth
= TMPL_ARGS_DEPTH (arglist
);
3740 tree bound_args
= make_temp_vec (parm_depth
);
3742 for (i
= saved_depth
,
3743 t
= DECL_TEMPLATE_PARMS (template);
3744 i
> 0 && t
!= NULL_TREE
;
3745 --i
, t
= TREE_CHAIN (t
))
3747 tree a
= coerce_template_parms (TREE_VALUE (t
),
3748 arglist
, template, 1, 1);
3749 SET_TMPL_ARGS_LEVEL (bound_args
, i
, a
);
3751 /* We temporarily reduce the length of the ARGLIST so
3752 that coerce_template_parms will see only the arguments
3753 corresponding to the template parameters it is
3755 TREE_VEC_LENGTH (arglist
)--;
3758 /* Restore the ARGLIST to its full size. */
3759 TREE_VEC_LENGTH (arglist
) = saved_depth
;
3761 arglist
= bound_args
;
3765 = coerce_template_parms (INNERMOST_TEMPLATE_PARMS (parmlist
),
3766 innermost_args (arglist
),
3769 if (arglist
== error_mark_node
)
3770 /* We were unable to bind the arguments. */
3771 return error_mark_node
;
3773 /* In the scope of a template class, explicit references to the
3774 template class refer to the type of the template, not any
3775 instantiation of it. For example, in:
3777 template <class T> class C { void f(C<T>); }
3779 the `C<T>' is just the same as `C'. Outside of the
3780 class, however, such a reference is an instantiation. */
3781 if (comp_template_args (TYPE_TI_ARGS (template_type
),
3784 found
= template_type
;
3786 if (!entering_scope
&& PRIMARY_TEMPLATE_P (template))
3790 /* Note that we use DECL_CONTEXT, rather than
3791 CP_DECL_CONTEXT, so that the termination test is
3792 always just `ctx'. We're not interested in namepace
3794 for (ctx
= current_class_type
;
3796 ctx
= (TREE_CODE_CLASS (TREE_CODE (ctx
)) == 't')
3797 ? TYPE_CONTEXT (ctx
) : DECL_CONTEXT (ctx
))
3798 if (same_type_p (ctx
, template_type
))
3802 /* We're not in the scope of the class, so the
3803 TEMPLATE_TYPE is not the type we want after
3811 for (found
= DECL_TEMPLATE_INSTANTIATIONS (template);
3812 found
; found
= TREE_CHAIN (found
))
3813 if (comp_template_args (TREE_PURPOSE (found
), arglist
))
3817 found
= TREE_VALUE (found
);
3826 /* Since we didn't find the type, we'll have to create it.
3827 Since we'll be saving this type on the
3828 DECL_TEMPLATE_INSTANTIATIONS list, it must be permanent. */
3829 push_obstacks (&permanent_obstack
, &permanent_obstack
);
3831 /* This type is a "partial instantiation" if any of the template
3832 arguments still inolve template parameters. Note that we set
3833 IS_PARTIAL_INSTANTIATION for partial specializations as
3835 is_partial_instantiation
= uses_template_parms (arglist
);
3837 /* Create the type. */
3838 if (TREE_CODE (template_type
) == ENUMERAL_TYPE
)
3840 if (!is_partial_instantiation
)
3841 t
= start_enum (TYPE_IDENTIFIER (template_type
));
3843 /* We don't want to call start_enum for this type, since
3844 the values for the enumeration constants may involve
3845 template parameters. And, no one should be interested
3846 in the enumeration constants for such a type. */
3847 t
= make_node (ENUMERAL_TYPE
);
3851 t
= make_lang_type (TREE_CODE (template_type
));
3852 CLASSTYPE_DECLARED_CLASS (t
)
3853 = CLASSTYPE_DECLARED_CLASS (template_type
);
3854 CLASSTYPE_GOT_SEMICOLON (t
) = 1;
3855 SET_CLASSTYPE_IMPLICIT_INSTANTIATION (t
);
3856 TYPE_FOR_JAVA (t
) = TYPE_FOR_JAVA (template_type
);
3859 /* If we called start_enum above, this information will already
3863 TYPE_CONTEXT (t
) = FROB_CONTEXT (context
);
3865 /* Create a stub TYPE_DECL for it. */
3866 type_decl
= build_decl (TYPE_DECL
, DECL_NAME (template), t
);
3867 SET_DECL_ARTIFICIAL (type_decl
);
3868 DECL_CONTEXT (type_decl
) = TYPE_CONTEXT (t
);
3869 DECL_SOURCE_FILE (type_decl
)
3870 = DECL_SOURCE_FILE (TYPE_STUB_DECL (template_type
));
3871 DECL_SOURCE_LINE (type_decl
)
3872 = DECL_SOURCE_LINE (TYPE_STUB_DECL (template_type
));
3873 TYPE_STUB_DECL (t
) = TYPE_NAME (t
) = type_decl
;
3876 type_decl
= TYPE_NAME (t
);
3878 /* Set up the template information. We have to figure out which
3879 template is the immediate parent if this is a full
3881 if (parm_depth
== 1 || is_partial_instantiation
3882 || !PRIMARY_TEMPLATE_P (template))
3883 /* This case is easy; there are no member templates involved. */
3887 /* This is a full instantiation of a member template. There
3888 should be some partial instantiation of which this is an
3891 for (found
= DECL_TEMPLATE_INSTANTIATIONS (template);
3892 found
; found
= TREE_CHAIN (found
))
3895 tree tmpl
= CLASSTYPE_TI_TEMPLATE (TREE_VALUE (found
));
3897 /* We only want partial instantiations, here, not
3898 specializations or full instantiations. */
3899 if (CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_VALUE (found
))
3900 || !uses_template_parms (TREE_VALUE (found
)))
3903 /* Temporarily reduce by one the number of levels in the
3904 ARGLIST and in FOUND so as to avoid comparing the
3905 last set of arguments. */
3906 TREE_VEC_LENGTH (arglist
)--;
3907 TREE_VEC_LENGTH (TREE_PURPOSE (found
)) --;
3909 /* See if the arguments match. If they do, then TMPL is
3910 the partial instantiation we want. */
3911 success
= comp_template_args (TREE_PURPOSE (found
), arglist
);
3913 /* Restore the argument vectors to their full size. */
3914 TREE_VEC_LENGTH (arglist
)++;
3915 TREE_VEC_LENGTH (TREE_PURPOSE (found
))++;
3925 my_friendly_abort (0);
3928 arglist
= copy_to_permanent (arglist
);
3929 SET_TYPE_TEMPLATE_INFO (t
,
3930 tree_cons (found
, arglist
, NULL_TREE
));
3931 DECL_TEMPLATE_INSTANTIATIONS (template)
3932 = tree_cons (arglist
, t
,
3933 DECL_TEMPLATE_INSTANTIATIONS (template));
3935 if (TREE_CODE (t
) == ENUMERAL_TYPE
3936 && !is_partial_instantiation
)
3937 /* Now that the type has been registered on the instantiations
3938 list, we set up the enumerators. Because the enumeration
3939 constants may involve the enumeration type itself, we make
3940 sure to register the type first, and then create the
3941 constants. That way, doing tsubst_expr for the enumeration
3942 constants won't result in recursive calls here; we'll find
3943 the instantiation and exit above. */
3944 tsubst_enum (template_type
, t
, arglist
);
3946 /* We're done with the permanent obstack, now. */
3948 /* We're also done with the momentary allocation we started
3952 /* Reset the name of the type, now that CLASSTYPE_TEMPLATE_INFO
3954 if (TREE_CODE (t
) != ENUMERAL_TYPE
)
3955 DECL_NAME (type_decl
) = classtype_mangled_name (t
);
3956 DECL_ASSEMBLER_NAME (type_decl
) = DECL_NAME (type_decl
);
3957 if (!is_partial_instantiation
)
3959 DECL_ASSEMBLER_NAME (type_decl
)
3960 = get_identifier (build_overload_name (t
, 1, 1));
3962 /* For backwards compatibility; code that uses
3963 -fexternal-templates expects looking up a template to
3964 instantiate it. I think DDD still relies on this.
3965 (jason 8/20/1998) */
3966 if (TREE_CODE (t
) != ENUMERAL_TYPE
3967 && flag_external_templates
3968 && CLASSTYPE_INTERFACE_KNOWN (TREE_TYPE (template))
3969 && ! CLASSTYPE_INTERFACE_ONLY (TREE_TYPE (template)))
3970 add_pending_template (t
);
3973 /* If the type makes use of template parameters, the
3974 code that generates debugging information will crash. */
3975 DECL_IGNORED_P (TYPE_STUB_DECL (t
)) = 1;
3981 /* For each TEMPLATE_TYPE_PARM, TEMPLATE_TEMPLATE_PARM, or
3982 TEMPLATE_PARM_INDEX in T, call FN with the parameter and the DATA.
3983 If FN returns non-zero, the iteration is terminated, and
3984 for_each_template_parm returns 1. Otherwise, the iteration
3985 continues. If FN never returns a non-zero value, the value
3986 returned by for_each_template_parm is 0. If FN is NULL, it is
3987 considered to be the function which always returns 1. */
3990 for_each_template_parm (t
, fn
, data
)
3998 if (TREE_CODE_CLASS (TREE_CODE (t
)) == 't'
3999 && for_each_template_parm (TYPE_CONTEXT (t
), fn
, data
))
4002 switch (TREE_CODE (t
))
4006 /* We assume that the object must be instantiated in order to build
4007 the COMPONENT_REF, so we test only whether the type of the
4008 COMPONENT_REF uses template parms. */
4009 return for_each_template_parm (TREE_TYPE (t
), fn
, data
);
4012 return (for_each_template_parm (TREE_OPERAND (t
, 0), fn
, data
)
4013 || for_each_template_parm (TREE_OPERAND (t
, 1), fn
, data
));
4015 case IDENTIFIER_NODE
:
4016 if (!IDENTIFIER_TEMPLATE (t
))
4018 my_friendly_abort (42);
4020 /* aggregates of tree nodes */
4023 int i
= TREE_VEC_LENGTH (t
);
4025 if (for_each_template_parm (TREE_VEC_ELT (t
, i
), fn
, data
))
4030 if (for_each_template_parm (TREE_PURPOSE (t
), fn
, data
)
4031 || for_each_template_parm (TREE_VALUE (t
), fn
, data
))
4033 return for_each_template_parm (TREE_CHAIN (t
), fn
, data
);
4036 if (for_each_template_parm (OVL_FUNCTION (t
), fn
, data
))
4038 return for_each_template_parm (OVL_CHAIN (t
), fn
, data
);
4040 /* constructed type nodes */
4042 case REFERENCE_TYPE
:
4043 return for_each_template_parm (TREE_TYPE (t
), fn
, data
);
4046 if (TYPE_PTRMEMFUNC_FLAG (t
))
4047 return for_each_template_parm (TYPE_PTRMEMFUNC_FN_TYPE (t
),
4053 if (! TYPE_TEMPLATE_INFO (t
))
4055 return for_each_template_parm (TREE_VALUE
4056 (TYPE_TEMPLATE_INFO (t
)),
4059 if (for_each_template_parm (TYPE_METHOD_BASETYPE (t
), fn
, data
))
4064 /* Check the parameter types. Since default arguments are not
4065 instantiated until they are needed, the TYPE_ARG_TYPES may
4066 contain expressions that involve template parameters. But,
4067 no-one should be looking at them yet. And, once they're
4068 instantiated, they don't contain template parameters, so
4069 there's no point in looking at them then, either. */
4073 for (parm
= TYPE_ARG_TYPES (t
); parm
; parm
= TREE_CHAIN (parm
))
4074 if (for_each_template_parm (TREE_VALUE (parm
), fn
, data
))
4078 /* Check the return type, too. */
4079 return for_each_template_parm (TREE_TYPE (t
), fn
, data
);
4082 if (for_each_template_parm (TYPE_DOMAIN (t
), fn
, data
))
4084 return for_each_template_parm (TREE_TYPE (t
), fn
, data
);
4086 if (for_each_template_parm (TYPE_OFFSET_BASETYPE (t
), fn
, data
))
4088 return for_each_template_parm (TREE_TYPE (t
), fn
, data
);
4092 return for_each_template_parm (TREE_TYPE (t
), fn
, data
);
4095 /* A template template parameter is encountered */
4096 if (DECL_TEMPLATE_TEMPLATE_PARM_P (t
))
4097 return for_each_template_parm (TREE_TYPE (t
), fn
, data
);
4098 /* Already substituted template template parameter */
4102 if (for_each_template_parm (DECL_INITIAL (t
), fn
, data
))
4104 goto check_type_and_context
;
4108 /* ??? What about FIELD_DECLs? */
4109 if (DECL_LANG_SPECIFIC (t
) && DECL_TEMPLATE_INFO (t
)
4110 && for_each_template_parm (DECL_TI_ARGS (t
), fn
, data
))
4114 check_type_and_context
:
4115 if (for_each_template_parm (TREE_TYPE (t
), fn
, data
))
4117 if (DECL_CONTEXT (t
)
4118 && for_each_template_parm (DECL_CONTEXT (t
), fn
, data
))
4123 return (for_each_template_parm (TREE_OPERAND (t
, 0), fn
, data
)
4124 || for_each_template_parm (TREE_OPERAND (t
, 1), fn
, data
));
4127 return for_each_template_parm (TREE_OPERAND (t
, 0), fn
, data
);
4129 /* template parm nodes */
4130 case TEMPLATE_TEMPLATE_PARM
:
4131 /* Record template parameters such as `T' inside `TT<T>'. */
4132 if (TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (t
)
4133 && for_each_template_parm (TYPE_TI_ARGS (t
), fn
, data
))
4135 case TEMPLATE_TYPE_PARM
:
4136 case TEMPLATE_PARM_INDEX
:
4138 return (*fn
)(t
, data
);
4142 /* simple type nodes */
4144 if (for_each_template_parm (TYPE_MIN_VALUE (t
), fn
, data
))
4146 return for_each_template_parm (TYPE_MAX_VALUE (t
), fn
, data
);
4152 case NAMESPACE_DECL
:
4162 /* Non-error_mark_node ERROR_MARKs are bad things. */
4163 my_friendly_assert (t
== error_mark_node
, 274);
4172 return for_each_template_parm (TREE_TYPE (t
), fn
, data
);
4175 return for_each_template_parm (TREE_OPERAND (t
, 0), fn
, data
);
4178 if (TREE_TYPE (t
) && TYPE_PTRMEMFUNC_P (TREE_TYPE (t
)))
4179 return for_each_template_parm (TYPE_PTRMEMFUNC_FN_TYPE
4180 (TREE_TYPE (t
)), fn
, data
);
4181 return for_each_template_parm (TREE_OPERAND (t
, 1), fn
, data
);
4185 case REINTERPRET_CAST_EXPR
:
4186 case CONST_CAST_EXPR
:
4187 case STATIC_CAST_EXPR
:
4188 case DYNAMIC_CAST_EXPR
:
4196 return for_each_template_parm (TREE_OPERAND (t
, 0), fn
, data
);
4199 switch (TREE_CODE_CLASS (TREE_CODE (t
)))
4207 for (i
= first_rtl_op (TREE_CODE (t
)); --i
>= 0;)
4208 if (for_each_template_parm (TREE_OPERAND (t
, i
), fn
, data
))
4215 sorry ("testing %s for template parms",
4216 tree_code_name
[(int) TREE_CODE (t
)]);
4217 my_friendly_abort (82);
4224 uses_template_parms (t
)
4227 return for_each_template_parm (t
, 0, 0);
4230 static struct tinst_level
*current_tinst_level
;
4231 static struct tinst_level
*free_tinst_level
;
4232 static int tinst_depth
;
4233 extern int max_tinst_depth
;
4234 #ifdef GATHER_STATISTICS
4237 int tinst_level_tick
;
4238 int last_template_error_tick
;
4240 /* Print out all the template instantiations that we are currently
4241 working on. If ERR, we are being called from cp_thing, so do
4242 the right thing for an error message. */
4245 print_template_context (err
)
4248 struct tinst_level
*p
= current_tinst_level
;
4250 char *file
= input_filename
;
4254 if (current_function_decl
!= p
->decl
4255 && current_function_decl
!= NULL_TREE
)
4256 /* We can get here during the processing of some synthesized
4257 method. Then, p->decl will be the function that's causing
4262 if (current_function_decl
== p
->decl
)
4263 /* Avoid redundancy with the the "In function" line. */;
4265 fprintf (stderr
, "%s: In instantiation of `%s':\n",
4266 file
, decl_as_string (p
->decl
, 0));
4274 for (; p
; p
= p
->next
)
4276 fprintf (stderr
, "%s:%d: instantiated from `%s'\n", file
, line
,
4277 decl_as_string (p
->decl
, 0));
4281 fprintf (stderr
, "%s:%d: instantiated from here\n", file
, line
);
4284 /* Called from cp_thing to print the template context for an error. */
4287 maybe_print_template_context ()
4289 if (last_template_error_tick
== tinst_level_tick
4290 || current_tinst_level
== 0)
4293 last_template_error_tick
= tinst_level_tick
;
4294 print_template_context (1);
4298 push_tinst_level (d
)
4301 struct tinst_level
*new;
4303 if (tinst_depth
>= max_tinst_depth
)
4305 /* If the instantiation in question still has unbound template parms,
4306 we don't really care if we can't instantiate it, so just return.
4307 This happens with base instantiation for implicit `typename'. */
4308 if (uses_template_parms (d
))
4311 last_template_error_tick
= tinst_level_tick
;
4312 error ("template instantiation depth exceeds maximum of %d",
4314 error (" (use -ftemplate-depth-NN to increase the maximum)");
4315 cp_error (" instantiating `%D'", d
);
4317 print_template_context (0);
4322 if (free_tinst_level
)
4324 new = free_tinst_level
;
4325 free_tinst_level
= new->next
;
4328 new = (struct tinst_level
*) xmalloc (sizeof (struct tinst_level
));
4332 new->file
= input_filename
;
4333 new->next
= current_tinst_level
;
4334 current_tinst_level
= new;
4337 #ifdef GATHER_STATISTICS
4338 if (tinst_depth
> depth_reached
)
4339 depth_reached
= tinst_depth
;
4349 struct tinst_level
*old
= current_tinst_level
;
4351 /* Restore the filename and line number stashed away when we started
4352 this instantiation. */
4354 input_filename
= old
->file
;
4355 extract_interface_info ();
4357 current_tinst_level
= old
->next
;
4358 old
->next
= free_tinst_level
;
4359 free_tinst_level
= old
;
4364 struct tinst_level
*
4367 struct tinst_level
*p
= current_tinst_level
;
4370 for (; p
->next
; p
= p
->next
)
4375 /* DECL is a friend FUNCTION_DECL or TEMPLATE_DECL. ARGS is the
4376 vector of template arguments, as for tsubst.
4378 Returns an appropriate tsbust'd friend declaration. */
4381 tsubst_friend_function (decl
, args
)
4387 char *file
= input_filename
;
4389 lineno
= DECL_SOURCE_LINE (decl
);
4390 input_filename
= DECL_SOURCE_FILE (decl
);
4392 if (TREE_CODE (decl
) == FUNCTION_DECL
4393 && DECL_TEMPLATE_INSTANTIATION (decl
)
4394 && TREE_CODE (DECL_TI_TEMPLATE (decl
)) != TEMPLATE_DECL
)
4395 /* This was a friend declared with an explicit template
4396 argument list, e.g.:
4400 to indicate that f was a template instantiation, not a new
4401 function declaration. Now, we have to figure out what
4402 instantiation of what template. */
4409 = lookup_template_function (tsubst_expr (DECL_TI_TEMPLATE (decl
),
4410 args
, /*complain=*/1,
4412 tsubst (DECL_TI_ARGS (decl
),
4413 args
, /*complain=*/1,
4415 /* FIXME: The decl we create via the next tsubst could be
4416 created on a temporary obstack. */
4417 new_friend
= tsubst (decl
, args
, /*complain=*/1, NULL_TREE
);
4418 tmpl
= determine_specialization (template_id
, new_friend
,
4420 /*need_member_template=*/0);
4421 new_friend
= instantiate_template (tmpl
, new_args
);
4425 new_friend
= tsubst (decl
, args
, /*complain=*/1, NULL_TREE
);
4427 /* The NEW_FRIEND will look like an instantiation, to the
4428 compiler, but is not an instantiation from the point of view of
4429 the language. For example, we might have had:
4431 template <class T> struct S {
4432 template <class U> friend void f(T, U);
4435 Then, in S<int>, template <class U> void f(int, U) is not an
4436 instantiation of anything. */
4437 DECL_USE_TEMPLATE (new_friend
) = 0;
4438 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
4439 DECL_USE_TEMPLATE (DECL_TEMPLATE_RESULT (new_friend
)) = 0;
4441 /* The mangled name for the NEW_FRIEND is incorrect. The call to
4442 tsubst will have resulted in a call to
4443 set_mangled_name_for_template_decl. But, the function is not a
4444 template instantiation and should not be mangled like one.
4445 Therefore, we remangle the function name. We don't have to do
4446 this if the NEW_FRIEND is a template since
4447 set_mangled_name_for_template_decl doesn't do anything if the
4448 function declaration still uses template arguments. */
4449 if (TREE_CODE (new_friend
) != TEMPLATE_DECL
)
4451 set_mangled_name_for_decl (new_friend
);
4452 DECL_RTL (new_friend
) = 0;
4453 make_decl_rtl (new_friend
, NULL_PTR
, 1);
4456 if (DECL_NAMESPACE_SCOPE_P (new_friend
))
4459 tree new_friend_template_info
;
4460 tree new_friend_result_template_info
;
4461 int new_friend_is_defn
;
4463 /* We must save some information from NEW_FRIEND before calling
4464 duplicate decls since that function will free NEW_FRIEND if
4466 new_friend_template_info
= DECL_TEMPLATE_INFO (new_friend
);
4467 if (TREE_CODE (new_friend
) == TEMPLATE_DECL
)
4469 /* This declaration is a `primary' template. */
4470 DECL_PRIMARY_TEMPLATE (new_friend
) = new_friend
;
4473 = DECL_INITIAL (DECL_RESULT (new_friend
)) != NULL_TREE
;
4474 new_friend_result_template_info
4475 = DECL_TEMPLATE_INFO (DECL_RESULT (new_friend
));
4479 new_friend_is_defn
= DECL_INITIAL (new_friend
) != NULL_TREE
;
4480 new_friend_result_template_info
= NULL_TREE
;
4483 old_decl
= pushdecl_namespace_level (new_friend
);
4485 if (old_decl
!= new_friend
)
4487 /* This new friend declaration matched an existing
4488 declaration. For example, given:
4490 template <class T> void f(T);
4491 template <class U> class C {
4492 template <class T> friend void f(T) {}
4495 the friend declaration actually provides the definition
4496 of `f', once C has been instantiated for some type. So,
4497 old_decl will be the out-of-class template declaration,
4498 while new_friend is the in-class definition.
4500 But, if `f' was called before this point, the
4501 instantiation of `f' will have DECL_TI_ARGS corresponding
4502 to `T' but not to `U', references to which might appear
4503 in the definition of `f'. Previously, the most general
4504 template for an instantiation of `f' was the out-of-class
4505 version; now it is the in-class version. Therefore, we
4506 run through all specialization of `f', adding to their
4507 DECL_TI_ARGS appropriately. In particular, they need a
4508 new set of outer arguments, corresponding to the
4509 arguments for this class instantiation.
4511 The same situation can arise with something like this:
4514 template <class T> class C {
4518 when `C<int>' is instantiated. Now, `f(int)' is defined
4521 if (!new_friend_is_defn
)
4522 /* On the other hand, if the in-class declaration does
4523 *not* provide a definition, then we don't want to alter
4524 existing definitions. We can just leave everything
4529 /* Overwrite whatever template info was there before, if
4530 any, with the new template information pertaining to
4532 DECL_TEMPLATE_INFO (old_decl
) = new_friend_template_info
;
4534 if (TREE_CODE (old_decl
) != TEMPLATE_DECL
)
4535 /* duplicate_decls will take care of this case. */
4540 tree new_friend_args
;
4542 DECL_TEMPLATE_INFO (DECL_RESULT (old_decl
))
4543 = new_friend_result_template_info
;
4545 new_friend_args
= TI_ARGS (new_friend_template_info
);
4546 for (t
= DECL_TEMPLATE_SPECIALIZATIONS (old_decl
);
4550 tree spec
= TREE_VALUE (t
);
4553 = add_outermost_template_args (new_friend_args
,
4554 DECL_TI_ARGS (spec
));
4556 = copy_to_permanent (DECL_TI_ARGS (spec
));
4559 /* Now, since specializations are always supposed to
4560 hang off of the most general template, we must move
4562 t
= most_general_template (old_decl
);
4565 DECL_TEMPLATE_SPECIALIZATIONS (t
)
4566 = chainon (DECL_TEMPLATE_SPECIALIZATIONS (t
),
4567 DECL_TEMPLATE_SPECIALIZATIONS (old_decl
));
4568 DECL_TEMPLATE_SPECIALIZATIONS (old_decl
) = NULL_TREE
;
4573 /* The information from NEW_FRIEND has been merged into OLD_DECL
4574 by duplicate_decls. */
4575 new_friend
= old_decl
;
4578 else if (TYPE_SIZE (DECL_CONTEXT (new_friend
)))
4580 /* Check to see that the declaration is really present, and,
4581 possibly obtain an improved declaration. */
4582 tree fn
= check_classfn (DECL_CONTEXT (new_friend
),
4591 input_filename
= file
;
4595 /* FRIEND_TMPL is a friend TEMPLATE_DECL. ARGS is the vector of
4596 template arguments, as for tsubst.
4598 Returns an appropriate tsbust'd friend type. */
4601 tsubst_friend_class (friend_tmpl
, args
)
4608 /* First, we look for a class template. */
4609 tmpl
= lookup_name (DECL_NAME (friend_tmpl
), /*prefer_type=*/0);
4611 /* But, if we don't find one, it might be because we're in a
4612 situation like this:
4620 Here, in the scope of (say) S<int>, `S' is bound to a TYPE_DECL
4621 for `S<int>', not the TEMPLATE_DECL. */
4622 if (!DECL_CLASS_TEMPLATE_P (tmpl
))
4624 tmpl
= lookup_name (DECL_NAME (friend_tmpl
), /*prefer_type=*/1);
4625 tmpl
= maybe_get_template_decl_from_type_decl (tmpl
);
4628 if (tmpl
&& DECL_CLASS_TEMPLATE_P (tmpl
))
4630 /* The friend template has already been declared. Just
4631 check to see that the declarations match, and install any new
4632 default parameters. We must tsubst the default parameters,
4633 of course. We only need the innermost template parameters
4634 because that is all that redeclare_class_template will look
4637 = tsubst_template_parms (DECL_TEMPLATE_PARMS (friend_tmpl
),
4638 args
, /*complain=*/1);
4639 redeclare_class_template (TREE_TYPE (tmpl
), parms
);
4640 friend_type
= TREE_TYPE (tmpl
);
4644 /* The friend template has not already been declared. In this
4645 case, the instantiation of the template class will cause the
4646 injection of this template into the global scope. */
4647 tmpl
= tsubst (friend_tmpl
, args
, /*complain=*/1, NULL_TREE
);
4649 /* The new TMPL is not an instantiation of anything, so we
4650 forget its origins. We don't reset CLASSTYPE_TI_TEMPLATE for
4651 the new type because that is supposed to be the corresponding
4652 template decl, i.e., TMPL. */
4653 DECL_USE_TEMPLATE (tmpl
) = 0;
4654 DECL_TEMPLATE_INFO (tmpl
) = NULL_TREE
;
4655 CLASSTYPE_USE_TEMPLATE (TREE_TYPE (tmpl
)) = 0;
4657 /* Inject this template into the global scope. */
4658 friend_type
= TREE_TYPE (pushdecl_top_level (tmpl
));
4665 instantiate_class_template (type
)
4668 tree
template, args
, pattern
, t
;
4671 if (type
== error_mark_node
)
4672 return error_mark_node
;
4674 if (TYPE_BEING_DEFINED (type
) || TYPE_SIZE (type
))
4677 /* We want to allocate temporary vectors of template arguments and
4678 template argument expressions on the momentary obstack, not on
4679 the expression obstack. Otherwise, all the space allocated in
4680 argument coercion and such is simply lost. */
4683 /* Figure out which template is being instantiated. */
4684 template = most_general_template (CLASSTYPE_TI_TEMPLATE (type
));
4685 my_friendly_assert (TREE_CODE (template) == TEMPLATE_DECL
, 279);
4687 /* Figure out which arguments are being used to do the
4689 args
= CLASSTYPE_TI_ARGS (type
);
4690 PARTIAL_INSTANTIATION_P (type
) = uses_template_parms (args
);
4692 if (pedantic
&& PARTIAL_INSTANTIATION_P (type
))
4693 /* If this is a partial instantiation, then we can't instantiate
4694 the type; there's no telling whether or not one of the
4695 template parameters might eventually be instantiated to some
4696 value that results in a specialization being used. For
4708 Now, the `S<U>' in `f<int>' is the specialization, not an
4709 instantiation of the original template. */
4712 /* Determine what specialization of the original template to
4714 if (PARTIAL_INSTANTIATION_P (type
))
4715 /* There's no telling which specialization is appropriate at this
4716 point. Since all peeking at the innards of this partial
4717 instantiation are extensions (like the "implicit typename"
4718 extension, which allows users to omit the keyword `typename' on
4719 names that are declared as types in template base classes), we
4720 are free to do what we please.
4722 Trying to figure out which partial instantiation to use can
4723 cause a crash. (Some of the template arguments don't even have
4724 types.) So, we just use the most general version. */
4728 t
= most_specialized_class (template, args
);
4730 if (t
== error_mark_node
)
4732 const char *str
= "candidates are:";
4733 cp_error ("ambiguous class template instantiation for `%#T'", type
);
4734 for (t
= DECL_TEMPLATE_SPECIALIZATIONS (template); t
;
4737 if (get_class_bindings (TREE_VALUE (t
), TREE_PURPOSE (t
),
4740 cp_error_at ("%s %+#T", str
, TREE_TYPE (t
));
4744 TYPE_BEING_DEFINED (type
) = 1;
4745 type
= error_mark_node
;
4751 pattern
= TREE_TYPE (t
);
4753 pattern
= TREE_TYPE (template);
4755 /* If the template we're instantiating is incomplete, then clearly
4756 there's nothing we can do. */
4757 if (TYPE_SIZE (pattern
) == NULL_TREE
)
4760 /* If this is a partial instantiation, don't tsubst anything. We will
4761 only use this type for implicit typename, so the actual contents don't
4762 matter. All that matters is whether a particular name is a type. */
4763 if (PARTIAL_INSTANTIATION_P (type
))
4765 /* The fields set here must be kept in sync with those cleared
4766 in begin_class_definition. */
4767 TYPE_BINFO_BASETYPES (type
) = TYPE_BINFO_BASETYPES (pattern
);
4768 TYPE_FIELDS (type
) = TYPE_FIELDS (pattern
);
4769 TYPE_METHODS (type
) = TYPE_METHODS (pattern
);
4770 CLASSTYPE_TAGS (type
) = CLASSTYPE_TAGS (pattern
);
4771 /* Pretend that the type is complete, so that we will look
4772 inside it during name lookup and such. */
4773 TYPE_SIZE (type
) = integer_zero_node
;
4777 /* If we've recursively instantiated too many templates, stop. */
4778 if (! push_tinst_level (type
))
4781 /* Now we're really doing the instantiation. Mark the type as in
4782 the process of being defined. */
4783 TYPE_BEING_DEFINED (type
) = 1;
4785 maybe_push_to_top_level (uses_template_parms (type
));
4789 /* This TYPE is actually a instantiation of of a partial
4790 specialization. We replace the innermost set of ARGS with
4791 the arguments appropriate for substitution. For example,
4794 template <class T> struct S {};
4795 template <class T> struct S<T*> {};
4797 and supposing that we are instantiating S<int*>, ARGS will
4798 present be {int*} but we need {int}. */
4800 = get_class_bindings (TREE_VALUE (t
), TREE_PURPOSE (t
),
4803 /* If there were multiple levels in ARGS, replacing the
4804 innermost level would alter CLASSTYPE_TI_ARGS, which we don't
4805 want, so we make a copy first. */
4806 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (args
))
4808 args
= copy_node (args
);
4809 SET_TMPL_ARGS_LEVEL (args
, TMPL_ARGS_DEPTH (args
), inner_args
);
4815 if (flag_external_templates
)
4817 if (flag_alt_external_templates
)
4819 CLASSTYPE_INTERFACE_ONLY (type
) = interface_only
;
4820 SET_CLASSTYPE_INTERFACE_UNKNOWN_X (type
, interface_unknown
);
4821 CLASSTYPE_VTABLE_NEEDS_WRITING (type
)
4822 = (! CLASSTYPE_INTERFACE_ONLY (type
)
4823 && CLASSTYPE_INTERFACE_KNOWN (type
));
4827 CLASSTYPE_INTERFACE_ONLY (type
) = CLASSTYPE_INTERFACE_ONLY (pattern
);
4828 SET_CLASSTYPE_INTERFACE_UNKNOWN_X
4829 (type
, CLASSTYPE_INTERFACE_UNKNOWN (pattern
));
4830 CLASSTYPE_VTABLE_NEEDS_WRITING (type
)
4831 = (! CLASSTYPE_INTERFACE_ONLY (type
)
4832 && CLASSTYPE_INTERFACE_KNOWN (type
));
4837 SET_CLASSTYPE_INTERFACE_UNKNOWN (type
);
4838 CLASSTYPE_VTABLE_NEEDS_WRITING (type
) = 1;
4841 TYPE_HAS_CONSTRUCTOR (type
) = TYPE_HAS_CONSTRUCTOR (pattern
);
4842 TYPE_HAS_DESTRUCTOR (type
) = TYPE_HAS_DESTRUCTOR (pattern
);
4843 TYPE_OVERLOADS_CALL_EXPR (type
) = TYPE_OVERLOADS_CALL_EXPR (pattern
);
4844 TYPE_OVERLOADS_ARRAY_REF (type
) = TYPE_OVERLOADS_ARRAY_REF (pattern
);
4845 TYPE_OVERLOADS_ARROW (type
) = TYPE_OVERLOADS_ARROW (pattern
);
4846 TYPE_GETS_NEW (type
) = TYPE_GETS_NEW (pattern
);
4847 TYPE_GETS_DELETE (type
) = TYPE_GETS_DELETE (pattern
);
4848 TYPE_VEC_DELETE_TAKES_SIZE (type
) = TYPE_VEC_DELETE_TAKES_SIZE (pattern
);
4849 TYPE_HAS_ASSIGN_REF (type
) = TYPE_HAS_ASSIGN_REF (pattern
);
4850 TYPE_HAS_CONST_ASSIGN_REF (type
) = TYPE_HAS_CONST_ASSIGN_REF (pattern
);
4851 TYPE_HAS_ABSTRACT_ASSIGN_REF (type
) = TYPE_HAS_ABSTRACT_ASSIGN_REF (pattern
);
4852 TYPE_HAS_INIT_REF (type
) = TYPE_HAS_INIT_REF (pattern
);
4853 TYPE_HAS_CONST_INIT_REF (type
) = TYPE_HAS_CONST_INIT_REF (pattern
);
4854 TYPE_HAS_DEFAULT_CONSTRUCTOR (type
) = TYPE_HAS_DEFAULT_CONSTRUCTOR (pattern
);
4855 TYPE_HAS_CONVERSION (type
) = TYPE_HAS_CONVERSION (pattern
);
4856 TYPE_USES_COMPLEX_INHERITANCE (type
)
4857 = TYPE_USES_COMPLEX_INHERITANCE (pattern
);
4858 TYPE_USES_MULTIPLE_INHERITANCE (type
)
4859 = TYPE_USES_MULTIPLE_INHERITANCE (pattern
);
4860 TYPE_USES_VIRTUAL_BASECLASSES (type
)
4861 = TYPE_USES_VIRTUAL_BASECLASSES (pattern
);
4862 TYPE_PACKED (type
) = TYPE_PACKED (pattern
);
4863 TYPE_ALIGN (type
) = TYPE_ALIGN (pattern
);
4864 TYPE_FOR_JAVA (type
) = TYPE_FOR_JAVA (pattern
); /* For libjava's JArray<T> */
4865 if (ANON_UNION_TYPE_P (pattern
))
4866 SET_ANON_UNION_TYPE_P (type
);
4868 /* We must copy the arguments to the permanent obstack since
4869 during the tsubst'ing below they may wind up in the
4870 DECL_TI_ARGS of some instantiated member template. */
4871 args
= copy_to_permanent (args
);
4873 if (TYPE_BINFO_BASETYPES (pattern
))
4875 tree base_list
= NULL_TREE
;
4876 tree pbases
= TYPE_BINFO_BASETYPES (pattern
);
4879 /* Substitute into each of the bases to determine the actual
4881 for (i
= 0; i
< TREE_VEC_LENGTH (pbases
); ++i
)
4887 pbase
= TREE_VEC_ELT (pbases
, i
);
4889 /* Substitue to figure out the base class. */
4890 base
= tsubst (BINFO_TYPE (pbase
), args
,
4891 /*complain=*/1, NULL_TREE
);
4892 if (base
== error_mark_node
)
4895 /* Calculate the correct access node. */
4896 if (TREE_VIA_VIRTUAL (pbase
))
4898 if (TREE_VIA_PUBLIC (pbase
))
4899 access
= access_public_virtual_node
;
4900 else if (TREE_VIA_PROTECTED (pbase
))
4901 access
= access_protected_virtual_node
;
4903 access
= access_private_virtual_node
;
4907 if (TREE_VIA_PUBLIC (pbase
))
4908 access
= access_public_node
;
4909 else if (TREE_VIA_PROTECTED (pbase
))
4910 access
= access_protected_node
;
4912 access
= access_private_node
;
4915 base_list
= tree_cons (access
, base
, base_list
);
4918 /* The list is now in reverse order; correct that. */
4919 base_list
= nreverse (base_list
);
4921 /* Now call xref_basetypes to set up all the base-class
4923 xref_basetypes (TREE_CODE (pattern
) == RECORD_TYPE
4924 ? (CLASSTYPE_DECLARED_CLASS (pattern
)
4925 ? class_type_node
: record_type_node
)
4927 DECL_NAME (TYPE_NAME (pattern
)),
4932 /* Now that our base classes are set up, enter the scope of the
4933 class, so that name lookups into base classes, etc. will work
4934 corectly. This is precisely analagous to what we do in
4935 begin_class_definition when defining an ordinary non-template
4937 pushclass (type
, 1);
4939 for (t
= CLASSTYPE_TAGS (pattern
); t
; t
= TREE_CHAIN (t
))
4941 tree tag
= TREE_VALUE (t
);
4942 tree name
= TYPE_IDENTIFIER (tag
);
4945 newtag
= tsubst (tag
, args
, /*complain=*/1, NULL_TREE
);
4946 if (TREE_CODE (newtag
) != ENUMERAL_TYPE
)
4948 if (TYPE_LANG_SPECIFIC (tag
) && CLASSTYPE_IS_TEMPLATE (tag
))
4949 /* Unfortunately, lookup_template_class sets
4950 CLASSTYPE_IMPLICIT_INSTANTIATION for a partial
4951 instantiation (i.e., for the type of a member template
4952 class nested within a template class.) This behavior is
4953 required for maybe_process_partial_specialization to work
4954 correctly, but is not accurate in this case; the TAG is not
4955 an instantiation of anything. (The corresponding
4956 TEMPLATE_DECL is an instantiation, but the TYPE is not.) */
4957 CLASSTYPE_USE_TEMPLATE (newtag
) = 0;
4959 /* Now, we call pushtag to put this NEWTAG into the scope of
4960 TYPE. We first set up the IDENTIFIER_TYPE_VALUE to avoid
4961 pushtag calling push_template_decl. We don't have to do
4962 this for enums because it will already have been done in
4965 SET_IDENTIFIER_TYPE_VALUE (name
, newtag
);
4966 pushtag (name
, newtag
, /*globalize=*/0);
4970 /* Don't replace enum constants here. */
4971 for (t
= TYPE_FIELDS (pattern
); t
; t
= TREE_CHAIN (t
))
4972 if (TREE_CODE (t
) != CONST_DECL
)
4976 /* The the file and line for this declaration, to assist in
4977 error message reporting. Since we called push_tinst_level
4978 above, we don't need to restore these. */
4979 lineno
= DECL_SOURCE_LINE (t
);
4980 input_filename
= DECL_SOURCE_FILE (t
);
4982 r
= tsubst (t
, args
, /*complain=*/1, NULL_TREE
);
4983 if (TREE_CODE (r
) == VAR_DECL
)
4987 if (DECL_DEFINED_IN_CLASS_P (r
))
4988 init
= tsubst_expr (DECL_INITIAL (t
), args
,
4989 /*complain=*/1, NULL_TREE
);
4993 finish_static_data_member_decl (r
, init
,
4994 /*asmspec_tree=*/NULL_TREE
,
4998 if (DECL_DEFINED_IN_CLASS_P (r
))
4999 check_static_variable_definition (r
, TREE_TYPE (r
));
5002 /* R will have a TREE_CHAIN if and only if it has already been
5003 processed by finish_member_declaration. This can happen
5004 if, for example, it is a TYPE_DECL for a class-scoped
5005 ENUMERAL_TYPE; such a thing will already have been added to
5006 the field list by tsubst_enum above. */
5007 if (!TREE_CHAIN (r
))
5009 set_current_access_from_decl (r
);
5010 finish_member_declaration (r
);
5014 /* Set up the list (TYPE_METHODS) and vector (CLASSTYPE_METHOD_VEC)
5015 for this instantiation. */
5016 for (t
= TYPE_METHODS (pattern
); t
; t
= TREE_CHAIN (t
))
5018 tree r
= tsubst (t
, args
, /*complain=*/1, NULL_TREE
);
5019 set_current_access_from_decl (r
);
5020 finish_member_declaration (r
);
5023 /* Construct the DECL_FRIENDLIST for the new class type. */
5024 typedecl
= TYPE_MAIN_DECL (type
);
5025 for (t
= DECL_FRIENDLIST (TYPE_MAIN_DECL (pattern
));
5031 for (friends
= TREE_VALUE (t
);
5032 friends
!= NULL_TREE
;
5033 friends
= TREE_CHAIN (friends
))
5034 if (TREE_PURPOSE (friends
) == error_mark_node
)
5036 tsubst_friend_function (TREE_VALUE (friends
),
5040 tsubst_copy (TREE_PURPOSE (t
), args
,
5041 /*complain=*/1, NULL_TREE
),
5042 tsubst (TREE_PURPOSE (friends
), args
,
5043 /*complain=*/1, NULL_TREE
));
5046 for (t
= CLASSTYPE_FRIEND_CLASSES (pattern
);
5050 tree friend_type
= TREE_VALUE (t
);
5051 tree new_friend_type
;
5053 if (TREE_CODE (friend_type
) == TEMPLATE_DECL
)
5054 new_friend_type
= tsubst_friend_class (friend_type
, args
);
5055 else if (uses_template_parms (friend_type
))
5056 new_friend_type
= tsubst (friend_type
, args
, /*complain=*/1,
5059 /* The call to xref_tag_from_type does injection for friend
5062 xref_tag_from_type (friend_type
, NULL_TREE
, 1);
5065 if (TREE_CODE (friend_type
) == TEMPLATE_DECL
)
5066 /* Trick make_friend_class into realizing that the friend
5067 we're adding is a template, not an ordinary class. It's
5068 important that we use make_friend_class since it will
5069 perform some error-checking and output cross-reference
5071 ++processing_template_decl
;
5073 make_friend_class (type
, new_friend_type
);
5075 if (TREE_CODE (friend_type
) == TEMPLATE_DECL
)
5076 --processing_template_decl
;
5079 /* This does injection for friend functions. */
5080 if (!processing_template_decl
)
5082 t
= tsubst (DECL_TEMPLATE_INJECT (template), args
,
5083 /*complain=*/1, NULL_TREE
);
5085 for (; t
; t
= TREE_CHAIN (t
))
5087 tree d
= TREE_VALUE (t
);
5089 if (TREE_CODE (d
) == TYPE_DECL
)
5090 /* Already injected. */;
5096 for (t
= TYPE_FIELDS (type
); t
; t
= TREE_CHAIN (t
))
5097 if (TREE_CODE (t
) == FIELD_DECL
)
5099 TREE_TYPE (t
) = complete_type (TREE_TYPE (t
));
5100 require_complete_type (t
);
5103 /* Set the file and line number information to whatever is given for
5104 the class itself. This puts error messages involving generated
5105 implicit functions at a predictable point, and the same point
5106 that would be used for non-template classes. */
5107 lineno
= DECL_SOURCE_LINE (typedecl
);
5108 input_filename
= DECL_SOURCE_FILE (typedecl
);
5110 unreverse_member_declarations (type
);
5111 type
= finish_struct_1 (type
, 0);
5112 CLASSTYPE_GOT_SEMICOLON (type
) = 1;
5114 /* Clear this now so repo_template_used is happy. */
5115 TYPE_BEING_DEFINED (type
) = 0;
5116 repo_template_used (type
);
5119 pop_from_top_level ();
5132 if (t1
== NULL_TREE
)
5133 return t2
== NULL_TREE
;
5134 if (t2
== NULL_TREE
)
5136 /* Don't care if one declares its arg const and the other doesn't -- the
5137 main variant of the arg type is all that matters. */
5138 if (TYPE_MAIN_VARIANT (TREE_VALUE (t1
))
5139 != TYPE_MAIN_VARIANT (TREE_VALUE (t2
)))
5141 return list_eq (TREE_CHAIN (t1
), TREE_CHAIN (t2
));
5144 /* If arg is a non-type template parameter that does not depend on template
5145 arguments, fold it like we weren't in the body of a template. */
5148 maybe_fold_nontype_arg (arg
)
5151 if (TREE_CODE_CLASS (TREE_CODE (arg
)) != 't'
5152 && !uses_template_parms (arg
))
5154 /* Sometimes, one of the args was an expression involving a
5155 template constant parameter, like N - 1. Now that we've
5156 tsubst'd, we might have something like 2 - 1. This will
5157 confuse lookup_template_class, so we do constant folding
5158 here. We have to unset processing_template_decl, to
5159 fool build_expr_from_tree() into building an actual
5162 int saved_processing_template_decl
= processing_template_decl
;
5163 processing_template_decl
= 0;
5164 arg
= fold (build_expr_from_tree (arg
));
5165 processing_template_decl
= saved_processing_template_decl
;
5170 /* Return the TREE_VEC with the arguments for the innermost template header,
5171 where ARGS is either that or the VEC of VECs for all the
5175 innermost_args (args
)
5178 return TMPL_ARGS_LEVEL (args
, TMPL_ARGS_DEPTH (args
));
5181 /* Substitute ARGS into the vector of template arguments T. */
5184 tsubst_template_arg_vector (t
, args
, complain
)
5189 int len
= TREE_VEC_LENGTH (t
), need_new
= 0, i
;
5190 tree
*elts
= (tree
*) alloca (len
* sizeof (tree
));
5192 bzero ((char *) elts
, len
* sizeof (tree
));
5194 for (i
= 0; i
< len
; i
++)
5196 if (TREE_VEC_ELT (t
, i
) != NULL_TREE
5197 && TREE_CODE (TREE_VEC_ELT (t
, i
)) == TREE_VEC
)
5198 elts
[i
] = tsubst_template_arg_vector (TREE_VEC_ELT (t
, i
),
5201 elts
[i
] = maybe_fold_nontype_arg
5202 (tsubst_expr (TREE_VEC_ELT (t
, i
), args
, complain
,
5205 if (elts
[i
] != TREE_VEC_ELT (t
, i
))
5212 t
= make_temp_vec (len
);
5213 for (i
= 0; i
< len
; i
++)
5214 TREE_VEC_ELT (t
, i
) = elts
[i
];
5219 /* Return the result of substituting ARGS into the template parameters
5220 given by PARMS. If there are m levels of ARGS and m + n levels of
5221 PARMS, then the result will contain n levels of PARMS. For
5222 example, if PARMS is `template <class T> template <class U>
5223 template <T*, U, class V>' and ARGS is {{int}, {double}} then the
5224 result will be `template <int*, double, class V>'. */
5227 tsubst_template_parms (parms
, args
, complain
)
5233 tree
* new_parms
= &r
;
5235 for (new_parms
= &r
;
5236 TMPL_PARMS_DEPTH (parms
) > TMPL_ARGS_DEPTH (args
);
5237 new_parms
= &(TREE_CHAIN (*new_parms
)),
5238 parms
= TREE_CHAIN (parms
))
5241 make_tree_vec (TREE_VEC_LENGTH (TREE_VALUE (parms
)));
5244 for (i
= 0; i
< TREE_VEC_LENGTH (new_vec
); ++i
)
5246 tree default_value
=
5247 TREE_PURPOSE (TREE_VEC_ELT (TREE_VALUE (parms
), i
));
5249 TREE_VALUE (TREE_VEC_ELT (TREE_VALUE (parms
), i
));
5251 TREE_VEC_ELT (new_vec
, i
)
5252 = build_tree_list (tsubst (default_value
, args
, complain
,
5254 tsubst (parm_decl
, args
, complain
,
5259 tree_cons (build_int_2 (0, (TMPL_PARMS_DEPTH (parms
)
5260 - TMPL_ARGS_DEPTH (args
))),
5261 new_vec
, NULL_TREE
);
5267 /* Substitute the ARGS into the indicated aggregate (or enumeration)
5268 type T. If T is not an aggregate or enumeration type, it is
5269 handled as if by tsubst. IN_DECL is as for tsubst. If
5270 ENTERING_SCOPE is non-zero, T is the context for a template which
5271 we are presently tsubst'ing. Return the subsituted value. */
5274 tsubst_aggr_type (t
, args
, complain
, in_decl
, entering_scope
)
5284 switch (TREE_CODE (t
))
5287 if (TYPE_PTRMEMFUNC_P (t
))
5289 tree r
= build_ptrmemfunc_type
5290 (tsubst (TYPE_PTRMEMFUNC_FN_TYPE (t
), args
, complain
, in_decl
));
5291 return cp_build_qualified_type (r
, TYPE_QUALS (t
));
5294 /* else fall through */
5297 if (TYPE_TEMPLATE_INFO (t
))
5303 /* First, determine the context for the type we are looking
5305 if (TYPE_CONTEXT (t
) != NULL_TREE
)
5306 context
= tsubst_aggr_type (TYPE_CONTEXT (t
), args
,
5308 in_decl
, /*entering_scope=*/1);
5310 context
= NULL_TREE
;
5312 /* Then, figure out what arguments are appropriate for the
5313 type we are trying to find. For example, given:
5315 template <class T> struct S;
5316 template <class T, class U> void f(T, U) { S<U> su; }
5318 and supposing that we are instantiating f<int, double>,
5319 then our ARGS will be {int, double}, but, when looking up
5320 S we only want {double}. */
5322 argvec
= tsubst_template_arg_vector (TYPE_TI_ARGS (t
), args
,
5325 r
= lookup_template_class (t
, argvec
, in_decl
, context
,
5329 return cp_build_qualified_type (r
, TYPE_QUALS (t
));
5332 /* This is not a template type, so there's nothing to do. */
5336 return tsubst (t
, args
, complain
, in_decl
);
5340 /* Substitute the ARGS into the T, which is a _DECL. TYPE is the
5341 (already computed) substitution of ARGS into TREE_TYPE (T), if
5342 appropriate. Return the result of the substitution. IN_DECL is as
5346 tsubst_decl (t
, args
, type
, in_decl
)
5353 char* saved_filename
;
5356 /* Set the filename and linenumber to improve error-reporting. */
5357 saved_lineno
= lineno
;
5358 saved_filename
= input_filename
;
5359 lineno
= DECL_SOURCE_LINE (t
);
5360 input_filename
= DECL_SOURCE_FILE (t
);
5362 switch (TREE_CODE (t
))
5366 /* We can get here when processing a member template function
5367 of a template class. */
5368 tree decl
= DECL_TEMPLATE_RESULT (t
);
5370 int is_template_template_parm
= DECL_TEMPLATE_TEMPLATE_PARM_P (t
);
5372 if (!is_template_template_parm
)
5374 /* We might already have an instance of this template.
5375 The ARGS are for the surrounding class type, so the
5376 full args contain the tsubst'd args for the context,
5377 plus the innermost args from the template decl. */
5378 tree tmpl_args
= DECL_CLASS_TEMPLATE_P (t
)
5379 ? CLASSTYPE_TI_ARGS (TREE_TYPE (t
))
5380 : DECL_TI_ARGS (DECL_RESULT (t
));
5384 full_args
= tsubst_template_arg_vector (tmpl_args
, args
,
5387 /* tsubst_template_arg_vector doesn't copy the vector if
5388 nothing changed. But, *something* should have
5390 my_friendly_assert (full_args
!= tmpl_args
, 0);
5392 spec
= retrieve_specialization (t
, full_args
);
5394 if (spec
!= NULL_TREE
)
5401 /* Make a new template decl. It will be similar to the
5402 original, but will record the current template arguments.
5403 We also create a new function declaration, which is just
5404 like the old one, but points to this new template, rather
5405 than the old one. */
5408 my_friendly_assert (DECL_LANG_SPECIFIC (r
) != 0, 0);
5409 TREE_CHAIN (r
) = NULL_TREE
;
5411 if (is_template_template_parm
)
5413 tree new_decl
= tsubst (decl
, args
, /*complain=*/1, in_decl
);
5414 DECL_RESULT (r
) = new_decl
;
5415 TREE_TYPE (r
) = TREE_TYPE (new_decl
);
5420 = tsubst_aggr_type (DECL_CONTEXT (t
), args
, /*complain=*/1,
5421 in_decl
, /*entering_scope=*/1);
5422 DECL_CLASS_CONTEXT (r
)
5423 = tsubst_aggr_type (DECL_CLASS_CONTEXT (t
), args
,
5424 /*complain=*/1, in_decl
,
5425 /*entering_scope=*/1);
5426 DECL_TEMPLATE_INFO (r
) = build_tree_list (t
, args
);
5428 if (TREE_CODE (decl
) == TYPE_DECL
)
5430 tree new_type
= tsubst (TREE_TYPE (t
), args
,
5431 /*complain=*/1, in_decl
);
5432 TREE_TYPE (r
) = new_type
;
5433 CLASSTYPE_TI_TEMPLATE (new_type
) = r
;
5434 DECL_RESULT (r
) = TYPE_MAIN_DECL (new_type
);
5435 DECL_TI_ARGS (r
) = CLASSTYPE_TI_ARGS (new_type
);
5439 tree new_decl
= tsubst (decl
, args
, /*complain=*/1, in_decl
);
5440 DECL_RESULT (r
) = new_decl
;
5441 DECL_TI_TEMPLATE (new_decl
) = r
;
5442 TREE_TYPE (r
) = TREE_TYPE (new_decl
);
5443 DECL_TI_ARGS (r
) = DECL_TI_ARGS (new_decl
);
5446 SET_DECL_IMPLICIT_INSTANTIATION (r
);
5447 DECL_TEMPLATE_INSTANTIATIONS (r
) = NULL_TREE
;
5448 DECL_TEMPLATE_SPECIALIZATIONS (r
) = NULL_TREE
;
5450 /* The template parameters for this new template are all the
5451 template parameters for the old template, except the
5452 outermost level of parameters. */
5453 DECL_TEMPLATE_PARMS (r
)
5454 = tsubst_template_parms (DECL_TEMPLATE_PARMS (t
), args
,
5457 if (PRIMARY_TEMPLATE_P (t
))
5458 DECL_PRIMARY_TEMPLATE (r
) = r
;
5460 /* We don't partially instantiate partial specializations. */
5461 if (TREE_CODE (decl
) == TYPE_DECL
)
5464 for (spec
= DECL_TEMPLATE_SPECIALIZATIONS (t
);
5466 spec
= TREE_CHAIN (spec
))
5468 /* It helps to consider example here. Consider:
5479 Now, for example, we are instantiating S<int>::f(U u).
5480 We want to make a template:
5485 It will have a specialization, for the case U = int*, of
5489 void S<int>::f<int*>(int*);
5491 This specialization will be an instantiation of
5492 the specialization given in the declaration of S, with
5493 argument list int*. */
5495 tree fn
= TREE_VALUE (spec
);
5499 if (!DECL_TEMPLATE_SPECIALIZATION (fn
))
5500 /* Instantiations are on the same list, but they're of
5501 no concern to us. */
5504 if (TREE_CODE (fn
) != TEMPLATE_DECL
)
5505 /* A full specialization. There's no need to record
5509 spec_args
= tsubst (DECL_TI_ARGS (fn
), args
,
5510 /*complain=*/1, in_decl
);
5511 new_fn
= tsubst (DECL_RESULT (most_general_template (fn
)),
5512 spec_args
, /*complain=*/1, in_decl
);
5513 DECL_TI_TEMPLATE (new_fn
) = fn
;
5514 register_specialization (new_fn
, r
,
5515 innermost_args (spec_args
));
5518 /* Record this partial instantiation. */
5519 register_specialization (r
, t
,
5520 DECL_TI_ARGS (DECL_RESULT (r
)));
5528 tree argvec
= NULL_TREE
;
5535 /* Nobody should be tsubst'ing into non-template functions. */
5536 my_friendly_assert (DECL_TEMPLATE_INFO (t
) != NULL_TREE
, 0);
5538 if (TREE_CODE (DECL_TI_TEMPLATE (t
)) == TEMPLATE_DECL
)
5542 /* Allocate template arguments on the momentary obstack,
5543 in case we don't need to keep them. */
5546 /* Calculate the most general template of which R is a
5547 specialization, and the complete set of arguments used to
5549 gen_tmpl
= most_general_template (DECL_TI_TEMPLATE (t
));
5551 = tsubst_template_arg_vector (DECL_TI_ARGS
5552 (DECL_TEMPLATE_RESULT (gen_tmpl
)),
5553 args
, /*complain=*/1);
5555 /* Check to see if we already have this specialization. */
5556 spec
= retrieve_specialization (gen_tmpl
, argvec
);
5565 /* We're going to need to keep the ARGVEC, so we copy it
5567 argvec
= copy_to_permanent (argvec
);
5570 /* Here, we deal with the peculiar case:
5572 template <class T> struct S {
5573 template <class U> friend void f();
5575 template <class U> friend void f() {}
5577 template void f<double>();
5579 Here, the ARGS for the instantiation of will be {int,
5580 double}. But, we only need as many ARGS as there are
5581 levels of template parameters in CODE_PATTERN. We are
5582 careful not to get fooled into reducing the ARGS in
5585 template <class T> struct S { template <class U> void f(U); }
5586 template <class T> template <> void S<T>::f(int) {}
5588 which we can spot because the pattern will be a
5589 specialization in this case. */
5590 args_depth
= TMPL_ARGS_DEPTH (args
);
5592 TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (DECL_TI_TEMPLATE (t
)));
5593 if (args_depth
> parms_depth
5594 && !DECL_TEMPLATE_SPECIALIZATION (t
))
5596 my_friendly_assert (DECL_FRIEND_P (t
), 0);
5598 if (parms_depth
> 1)
5602 args
= make_temp_vec (parms_depth
);
5603 for (i
= 0; i
< parms_depth
; ++i
)
5604 TREE_VEC_ELT (args
, i
) =
5605 TREE_VEC_ELT (args
, i
+ (args_depth
- parms_depth
));
5608 args
= TREE_VEC_ELT (args
, args_depth
- parms_depth
);
5613 /* This special case arises when we have something like this:
5615 template <class T> struct S {
5616 friend void f<int>(int, double);
5619 Here, the DECL_TI_TEMPLATE for the friend declaration
5620 will be a LOOKUP_EXPR or an IDENTIFIER_NODE. We are
5621 being called from tsubst_friend_function, and we want
5622 only to create a new decl (R) with appropriate types so
5623 that we can call determine_specialization. */
5624 my_friendly_assert ((TREE_CODE (DECL_TI_TEMPLATE (t
))
5626 || (TREE_CODE (DECL_TI_TEMPLATE (t
))
5627 == IDENTIFIER_NODE
), 0);
5628 gen_tmpl
= NULL_TREE
;
5631 if (DECL_CLASS_SCOPE_P (t
))
5633 if (DECL_NAME (t
) == constructor_name (DECL_CONTEXT (t
)))
5637 ctx
= tsubst_aggr_type (DECL_CLASS_CONTEXT (t
), args
,
5639 /*entering_scope=*/1);
5646 type
= tsubst (type
, args
, /*complain=*/1, in_decl
);
5648 /* We do NOT check for matching decls pushed separately at this
5649 point, as they may not represent instantiations of this
5650 template, and in any case are considered separate under the
5651 discrete model. Instead, see add_maybe_template. */
5655 DECL_USE_TEMPLATE (r
) = 0;
5656 TREE_TYPE (r
) = type
;
5659 = tsubst_aggr_type (DECL_CONTEXT (t
), args
, /*complain=*/1, t
,
5660 /*entering_scope=*/1);
5661 DECL_CLASS_CONTEXT (r
) = ctx
;
5663 if (member
&& IDENTIFIER_TYPENAME_P (DECL_NAME (r
)))
5664 /* Type-conversion operator. Reconstruct the name, in
5665 case it's the name of one of the template's parameters. */
5666 DECL_NAME (r
) = build_typename_overload (TREE_TYPE (type
));
5668 DECL_ARGUMENTS (r
) = tsubst (DECL_ARGUMENTS (t
), args
,
5670 DECL_MAIN_VARIANT (r
) = r
;
5671 DECL_RESULT (r
) = NULL_TREE
;
5673 TREE_STATIC (r
) = 0;
5674 TREE_PUBLIC (r
) = TREE_PUBLIC (t
);
5675 DECL_EXTERNAL (r
) = 1;
5676 DECL_INTERFACE_KNOWN (r
) = 0;
5677 DECL_DEFER_OUTPUT (r
) = 0;
5678 TREE_CHAIN (r
) = NULL_TREE
;
5679 DECL_PENDING_INLINE_INFO (r
) = 0;
5682 /* Set up the DECL_TEMPLATE_INFO for R and compute its mangled
5683 name. There's no need to do this in the special friend
5684 case mentioned above where GEN_TMPL is NULL. */
5687 /* The ARGVEC was built on the momentary obstack. Make it
5689 argvec
= copy_to_permanent (argvec
);
5690 DECL_TEMPLATE_INFO (r
)
5691 = perm_tree_cons (gen_tmpl
, argvec
, NULL_TREE
);
5692 SET_DECL_IMPLICIT_INSTANTIATION (r
);
5693 register_specialization (r
, gen_tmpl
, argvec
);
5695 /* Set the mangled name for R. */
5696 if (DECL_DESTRUCTOR_P (t
))
5697 DECL_ASSEMBLER_NAME (r
) = build_destructor_name (ctx
);
5700 /* Instantiations of template functions must be mangled
5701 specially, in order to conform to 14.5.5.1
5702 [temp.over.link]. */
5703 tree tmpl
= DECL_TI_TEMPLATE (t
);
5705 /* TMPL will be NULL if this is a specialization of a
5706 member function of a template class. */
5707 if (name_mangling_version
< 1
5708 || tmpl
== NULL_TREE
5709 || (member
&& !is_member_template (tmpl
)
5710 && !DECL_TEMPLATE_INFO (tmpl
)))
5711 set_mangled_name_for_decl (r
);
5713 set_mangled_name_for_template_decl (r
);
5717 make_decl_rtl (r
, NULL_PTR
, 1);
5719 /* Like grokfndecl. If we don't do this, pushdecl will
5720 mess up our TREE_CHAIN because it doesn't find a
5721 previous decl. Sigh. */
5723 && ! uses_template_parms (r
)
5724 && (IDENTIFIER_GLOBAL_VALUE (DECL_ASSEMBLER_NAME (r
))
5726 SET_IDENTIFIER_GLOBAL_VALUE (DECL_ASSEMBLER_NAME (r
), r
);
5729 /* Copy the list of befriending classes. */
5730 for (friends
= &DECL_BEFRIENDING_CLASSES (r
);
5732 friends
= &TREE_CHAIN (*friends
))
5734 *friends
= copy_node (*friends
);
5735 TREE_VALUE (*friends
) = tsubst (TREE_VALUE (*friends
),
5736 args
, /*complain=*/1,
5740 if (DECL_CONSTRUCTOR_P (r
))
5742 maybe_retrofit_in_chrg (r
);
5743 grok_ctor_properties (ctx
, r
);
5745 if (IDENTIFIER_OPNAME_P (DECL_NAME (r
)))
5746 grok_op_properties (r
, DECL_VIRTUAL_P (r
), DECL_FRIEND_P (r
));
5753 TREE_TYPE (r
) = type
;
5754 c_apply_type_quals_to_decl (CP_TYPE_QUALS (type
), r
);
5756 if (TREE_CODE (DECL_INITIAL (r
)) != TEMPLATE_PARM_INDEX
)
5757 DECL_INITIAL (r
) = TREE_TYPE (r
);
5759 DECL_INITIAL (r
) = tsubst (DECL_INITIAL (r
), args
,
5760 /*complain=*/1, in_decl
);
5762 DECL_CONTEXT (r
) = NULL_TREE
;
5763 #ifdef PROMOTE_PROTOTYPES
5764 if ((TREE_CODE (type
) == INTEGER_TYPE
5765 || TREE_CODE (type
) == ENUMERAL_TYPE
)
5766 && TYPE_PRECISION (type
) < TYPE_PRECISION (integer_type_node
))
5767 DECL_ARG_TYPE (r
) = integer_type_node
;
5770 TREE_CHAIN (r
) = tsubst (TREE_CHAIN (t
), args
,
5771 /*complain=*/1, TREE_CHAIN (t
));
5779 TREE_TYPE (r
) = type
;
5780 c_apply_type_quals_to_decl (CP_TYPE_QUALS (type
), r
);
5782 /* We don't have to set DECL_CONTEXT here; it is set by
5783 finish_member_declaration. */
5784 DECL_INITIAL (r
) = tsubst_expr (DECL_INITIAL (t
), args
,
5785 /*complain=*/1, in_decl
);
5786 TREE_CHAIN (r
) = NULL_TREE
;
5787 if (TREE_CODE (type
) == VOID_TYPE
)
5788 cp_error_at ("instantiation of `%D' as type void", r
);
5796 = tsubst_copy (DECL_INITIAL (t
), args
, /*complain=*/1, in_decl
);
5797 TREE_CHAIN (r
) = NULL_TREE
;
5807 tree ctx
= tsubst_aggr_type (DECL_CONTEXT (t
), args
,
5809 in_decl
, /*entering_scope=*/1);
5811 /* Nobody should be tsubst'ing into non-template variables. */
5812 my_friendly_assert (DECL_LANG_SPECIFIC (t
)
5813 && DECL_TEMPLATE_INFO (t
) != NULL_TREE
, 0);
5815 /* Check to see if we already have this specialization. */
5816 tmpl
= DECL_TI_TEMPLATE (t
);
5817 gen_tmpl
= most_general_template (tmpl
);
5818 argvec
= tsubst (DECL_TI_ARGS (t
), args
, /*complain=*/1, in_decl
);
5819 spec
= retrieve_specialization (gen_tmpl
, argvec
);
5828 TREE_TYPE (r
) = type
;
5829 c_apply_type_quals_to_decl (CP_TYPE_QUALS (type
), r
);
5830 DECL_CONTEXT (r
) = ctx
;
5832 /* Don't try to expand the initializer until someone tries to use
5833 this variable; otherwise we run into circular dependencies. */
5834 DECL_INITIAL (r
) = NULL_TREE
;
5838 DECL_CLASS_CONTEXT (r
) = DECL_CONTEXT (r
);
5840 /* A static data member declaration is always marked external
5841 when it is declared in-class, even if an initializer is
5842 present. We mimic the non-template processing here. */
5843 DECL_EXTERNAL (r
) = 1;
5845 DECL_TEMPLATE_INFO (r
) = perm_tree_cons (tmpl
, argvec
, NULL_TREE
);
5846 SET_DECL_IMPLICIT_INSTANTIATION (r
);
5847 register_specialization (r
, gen_tmpl
, argvec
);
5849 TREE_CHAIN (r
) = NULL_TREE
;
5850 if (TREE_CODE (type
) == VOID_TYPE
)
5851 cp_error_at ("instantiation of `%D' as type void", r
);
5856 if (t
== TYPE_NAME (TREE_TYPE (t
)))
5857 r
= TYPE_NAME (type
);
5861 TREE_TYPE (r
) = type
;
5862 DECL_CONTEXT (r
) = current_class_type
;
5863 TREE_CHAIN (r
) = NULL_TREE
;
5868 my_friendly_abort (0);
5871 /* Restore the file and line information. */
5872 lineno
= saved_lineno
;
5873 input_filename
= saved_filename
;
5878 /* Substitue into the ARG_TYPES of a function type. */
5881 tsubst_arg_types (arg_types
, args
, complain
, in_decl
)
5887 tree remaining_arg_types
;
5890 if (!arg_types
|| arg_types
== void_list_node
)
5893 remaining_arg_types
= tsubst_arg_types (TREE_CHAIN (arg_types
),
5894 args
, complain
, in_decl
);
5895 if (remaining_arg_types
== error_mark_node
)
5896 return error_mark_node
;
5898 type
= tsubst (TREE_VALUE (arg_types
), args
, complain
, in_decl
);
5899 if (type
== error_mark_node
)
5900 return error_mark_node
;
5902 /* Do array-to-pointer, function-to-pointer conversion, and ignore
5903 top-level qualifiers as required. */
5904 type
= TYPE_MAIN_VARIANT (type_decays_to (type
));
5906 /* Note that we do not substitute into default arguments here. The
5907 standard mandates that they be instantiated only when needed,
5908 which is done in build_over_call. */
5909 return hash_tree_cons (TREE_PURPOSE (arg_types
), type
,
5910 remaining_arg_types
);
5914 /* Substitute into a FUNCTION_TYPE or METHOD_TYPE. This routine does
5915 *not* handle the exception-specification for FNTYPE, because the
5916 initial substitution of explicitly provided template parameters
5917 during argument deduction forbids substitution into the
5918 exception-specification:
5922 All references in the function type of the function template to the
5923 corresponding template parameters are replaced by the specified tem-
5924 plate argument values. If a substitution in a template parameter or
5925 in the function type of the function template results in an invalid
5926 type, type deduction fails. [Note: The equivalent substitution in
5927 exception specifications is done only when the function is instanti-
5928 ated, at which point a program is ill-formed if the substitution
5929 results in an invalid type.] */
5932 tsubst_function_type (t
, args
, complain
, in_decl
)
5942 /* The TYPE_CONTEXT is not used for function/method types. */
5943 my_friendly_assert (TYPE_CONTEXT (t
) == NULL_TREE
, 0);
5945 /* Substitue the return type. */
5946 return_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
5947 if (return_type
== error_mark_node
)
5948 return error_mark_node
;
5950 /* Substitue the argument types. */
5951 arg_types
= tsubst_arg_types (TYPE_ARG_TYPES (t
), args
,
5953 if (arg_types
== error_mark_node
)
5954 return error_mark_node
;
5956 /* Construct a new type node and return it. */
5957 if (TREE_CODE (t
) == FUNCTION_TYPE
)
5958 fntype
= build_function_type (return_type
, arg_types
);
5961 tree r
= TREE_TYPE (TREE_VALUE (arg_types
));
5962 if (! IS_AGGR_TYPE (r
))
5966 Type deduction may fail for any of the following
5969 -- Attempting to create "pointer to member of T" when T
5970 is not a class type. */
5972 cp_error ("creating pointer to member function of non-class type `%T'",
5974 return error_mark_node
;
5977 fntype
= build_cplus_method_type (r
, return_type
, TREE_CHAIN
5980 fntype
= build_qualified_type (fntype
, TYPE_QUALS (t
));
5981 fntype
= build_type_attribute_variant (fntype
, TYPE_ATTRIBUTES (t
));
5986 /* Substitute into the PARMS of a call-declarator. */
5989 tsubst_call_declarator_parms (parms
, args
, complain
, in_decl
)
5999 if (!parms
|| parms
== void_list_node
)
6002 new_parms
= tsubst_call_declarator_parms (TREE_CHAIN (parms
),
6003 args
, complain
, in_decl
);
6005 /* Figure out the type of this parameter. */
6006 type
= tsubst (TREE_VALUE (parms
), args
, complain
, in_decl
);
6008 /* Figure out the default argument as well. Note that we use
6009 tsubst_expr since the default argument is really an expression. */
6010 defarg
= tsubst_expr (TREE_PURPOSE (parms
), args
, complain
, in_decl
);
6012 /* Chain this parameter on to the front of those we have already
6013 processed. We don't use hash_tree_cons because that function
6014 doesn't check TREE_PARMLIST. */
6015 new_parms
= tree_cons (defarg
, type
, new_parms
);
6017 /* And note that these are parameters. */
6018 TREE_PARMLIST (new_parms
) = 1;
6023 /* Take the tree structure T and replace template parameters used
6024 therein with the argument vector ARGS. IN_DECL is an associated
6025 decl for diagnostics. If an error occurs, returns ERROR_MARK_NODE.
6026 An appropriate error message is issued only if COMPLAIN is
6027 non-zero. Note that we must be relatively non-tolerant of
6028 extensions here, in order to preserve conformance; if we allow
6029 substitutions that should not be allowed, we may allow argument
6030 deductions that should not succeed, and therefore report ambiguous
6031 overload situations where there are none. In theory, we could
6032 allow the substitution, but indicate that it should have failed,
6033 and allow our caller to make sure that the right thing happens, but
6034 we don't try to do this yet.
6036 This function is used for dealing with types, decls and the like;
6037 for expressions, use tsubst_expr or tsubst_copy. */
6040 tsubst (t
, args
, complain
, in_decl
)
6047 if (t
== NULL_TREE
|| t
== error_mark_node
6048 || t
== integer_type_node
6049 || t
== void_type_node
6050 || t
== char_type_node
6051 || TREE_CODE (t
) == NAMESPACE_DECL
)
6054 if (TREE_CODE (t
) == IDENTIFIER_NODE
)
6055 type
= IDENTIFIER_TYPE_VALUE (t
);
6057 type
= TREE_TYPE (t
);
6058 if (type
== unknown_type_node
)
6059 my_friendly_abort (42);
6061 if (type
&& TREE_CODE (t
) != FUNCTION_DECL
6062 && TREE_CODE (t
) != TYPENAME_TYPE
6063 && TREE_CODE (t
) != TEMPLATE_DECL
6064 && TREE_CODE (t
) != IDENTIFIER_NODE
6065 && TREE_CODE (t
) != FUNCTION_TYPE
6066 && TREE_CODE (t
) != METHOD_TYPE
)
6067 type
= tsubst (type
, args
, complain
, in_decl
);
6068 if (type
== error_mark_node
)
6069 return error_mark_node
;
6071 if (TREE_CODE_CLASS (TREE_CODE (t
)) == 'd')
6072 return tsubst_decl (t
, args
, type
, in_decl
);
6074 switch (TREE_CODE (t
))
6079 return tsubst_aggr_type (t
, args
, complain
, in_decl
,
6080 /*entering_scope=*/0);
6083 case IDENTIFIER_NODE
:
6095 if (t
== integer_type_node
)
6098 if (TREE_CODE (TYPE_MIN_VALUE (t
)) == INTEGER_CST
6099 && TREE_CODE (TYPE_MAX_VALUE (t
)) == INTEGER_CST
)
6103 tree max
, omax
= TREE_OPERAND (TYPE_MAX_VALUE (t
), 0);
6105 max
= tsubst_expr (omax
, args
, complain
, in_decl
);
6106 if (max
== error_mark_node
)
6107 return error_mark_node
;
6109 if (processing_template_decl
)
6111 tree itype
= make_node (INTEGER_TYPE
);
6112 TYPE_MIN_VALUE (itype
) = size_zero_node
;
6113 TYPE_MAX_VALUE (itype
) = build_min (MINUS_EXPR
, sizetype
, max
,
6118 if (integer_zerop (omax
))
6120 /* Still allow an explicit array of size zero. */
6122 pedwarn ("creating array with size zero");
6124 else if (integer_zerop (max
) || INT_CST_LT (max
, integer_zero_node
))
6128 Type deduction may fail for any of the following
6131 Attempting to create an array with a size that is
6132 zero or negative. */
6134 cp_error ("creating array with size `%E'", max
);
6136 return error_mark_node
;
6139 max
= fold (build_binary_op (MINUS_EXPR
, max
, integer_one_node
, 1));
6140 if (!TREE_PERMANENT (max
) && !allocation_temporary_p ())
6141 max
= copy_to_permanent (max
);
6142 return build_index_type (max
);
6145 case TEMPLATE_TYPE_PARM
:
6146 case TEMPLATE_TEMPLATE_PARM
:
6147 case TEMPLATE_PARM_INDEX
:
6155 if (TREE_CODE (t
) == TEMPLATE_TYPE_PARM
6156 || TREE_CODE (t
) == TEMPLATE_TEMPLATE_PARM
)
6158 idx
= TEMPLATE_TYPE_IDX (t
);
6159 level
= TEMPLATE_TYPE_LEVEL (t
);
6163 idx
= TEMPLATE_PARM_IDX (t
);
6164 level
= TEMPLATE_PARM_LEVEL (t
);
6167 if (TREE_VEC_LENGTH (args
) > 0)
6169 tree arg
= NULL_TREE
;
6171 levels
= TMPL_ARGS_DEPTH (args
);
6172 if (level
<= levels
)
6173 arg
= TMPL_ARG (args
, level
, idx
);
6175 if (arg
== error_mark_node
)
6176 return error_mark_node
;
6177 else if (arg
!= NULL_TREE
)
6179 if (TREE_CODE (t
) == TEMPLATE_TYPE_PARM
)
6181 my_friendly_assert (TREE_CODE_CLASS (TREE_CODE (arg
))
6183 return cp_build_qualified_type
6184 (arg
, CP_TYPE_QUALS (arg
) | CP_TYPE_QUALS (t
));
6186 else if (TREE_CODE (t
) == TEMPLATE_TEMPLATE_PARM
)
6188 if (TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (t
))
6190 /* We are processing a type constructed from
6191 a template template parameter */
6192 tree argvec
= tsubst (TYPE_TI_ARGS (t
),
6193 args
, complain
, in_decl
);
6194 if (argvec
== error_mark_node
)
6195 return error_mark_node
;
6197 /* We can get a TEMPLATE_TEMPLATE_PARM here when
6198 we are resolving nested-types in the signature of
6199 a member function templates.
6200 Otherwise ARG is a TEMPLATE_DECL and is the real
6201 template to be instantiated. */
6202 if (TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
)
6203 arg
= TYPE_NAME (arg
);
6205 r
= lookup_template_class (DECL_NAME (arg
),
6208 /*entering_scope=*/0);
6209 return cp_build_qualified_type (r
, TYPE_QUALS (t
));
6212 /* We are processing a template argument list. */
6220 my_friendly_abort (981018);
6223 /* This can happen during the attempted tsubst'ing in
6224 unify. This means that we don't yet have any information
6225 about the template parameter in question. */
6228 /* If we get here, we must have been looking at a parm for a
6229 more deeply nested template. Make a new version of this
6230 template parameter, but with a lower level. */
6231 switch (TREE_CODE (t
))
6233 case TEMPLATE_TYPE_PARM
:
6234 case TEMPLATE_TEMPLATE_PARM
:
6236 TEMPLATE_TYPE_PARM_INDEX (r
)
6237 = reduce_template_parm_level (TEMPLATE_TYPE_PARM_INDEX (t
),
6239 TYPE_STUB_DECL (r
) = TYPE_NAME (r
) = TEMPLATE_TYPE_DECL (r
);
6240 TYPE_MAIN_VARIANT (r
) = r
;
6241 TYPE_POINTER_TO (r
) = NULL_TREE
;
6242 TYPE_REFERENCE_TO (r
) = NULL_TREE
;
6244 if (TREE_CODE (t
) == TEMPLATE_TEMPLATE_PARM
6245 && TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (t
))
6247 tree argvec
= tsubst (TYPE_TI_ARGS (t
), args
,
6249 if (argvec
== error_mark_node
)
6250 return error_mark_node
;
6252 TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (r
)
6253 = perm_tree_cons (TYPE_NAME (t
), argvec
, NULL_TREE
);
6257 case TEMPLATE_PARM_INDEX
:
6258 r
= reduce_template_parm_level (t
, type
, levels
);
6262 my_friendly_abort (0);
6270 tree purpose
, value
, chain
, result
;
6272 if (t
== void_list_node
)
6275 purpose
= TREE_PURPOSE (t
);
6278 purpose
= tsubst (purpose
, args
, complain
, in_decl
);
6279 if (purpose
== error_mark_node
)
6280 return error_mark_node
;
6282 value
= TREE_VALUE (t
);
6285 value
= tsubst (value
, args
, complain
, in_decl
);
6286 if (value
== error_mark_node
)
6287 return error_mark_node
;
6289 chain
= TREE_CHAIN (t
);
6290 if (chain
&& chain
!= void_type_node
)
6292 chain
= tsubst (chain
, args
, complain
, in_decl
);
6293 if (chain
== error_mark_node
)
6294 return error_mark_node
;
6296 if (purpose
== TREE_PURPOSE (t
)
6297 && value
== TREE_VALUE (t
)
6298 && chain
== TREE_CHAIN (t
))
6300 result
= hash_tree_cons (purpose
, value
, chain
);
6301 TREE_PARMLIST (result
) = TREE_PARMLIST (t
);
6305 if (type
!= NULL_TREE
)
6307 /* A binfo node. We always need to make a copy, of the node
6308 itself and of its BINFO_BASETYPES. */
6312 /* Make sure type isn't a typedef copy. */
6313 type
= BINFO_TYPE (TYPE_BINFO (type
));
6315 TREE_TYPE (t
) = complete_type (type
);
6316 if (IS_AGGR_TYPE (type
))
6318 BINFO_VTABLE (t
) = TYPE_BINFO_VTABLE (type
);
6319 BINFO_VIRTUALS (t
) = TYPE_BINFO_VIRTUALS (type
);
6320 if (TYPE_BINFO_BASETYPES (type
) != NULL_TREE
)
6321 BINFO_BASETYPES (t
) = copy_node (TYPE_BINFO_BASETYPES (type
));
6326 /* Otherwise, a vector of template arguments. */
6327 return tsubst_template_arg_vector (t
, args
, complain
);
6330 case REFERENCE_TYPE
:
6332 enum tree_code code
;
6334 if (type
== TREE_TYPE (t
))
6337 code
= TREE_CODE (t
);
6342 Type deduction may fail for any of the following
6345 -- Attempting to create a pointer to reference type.
6346 -- Attempting to create a reference to a reference type or
6347 a reference to void. */
6348 if (TREE_CODE (type
) == REFERENCE_TYPE
6349 || (code
== REFERENCE_TYPE
&& TREE_CODE (type
) == VOID_TYPE
))
6351 static int last_line
= 0;
6352 static char* last_file
= 0;
6354 /* We keep track of the last time we issued this error
6355 message to avoid spewing a ton of messages during a
6356 single bad template instantiation. */
6357 if (complain
&& (last_line
!= lineno
||
6358 last_file
!= input_filename
))
6360 if (TREE_CODE (type
) == VOID_TYPE
)
6361 cp_error ("forming reference to void");
6363 cp_error ("forming %s to reference type `%T'",
6364 (code
== POINTER_TYPE
) ? "pointer" : "reference",
6367 last_file
= input_filename
;
6370 return error_mark_node
;
6372 else if (code
== POINTER_TYPE
)
6373 r
= build_pointer_type (type
);
6375 r
= build_reference_type (type
);
6376 r
= cp_build_qualified_type (r
, TYPE_QUALS (t
));
6378 /* Will this ever be needed for TYPE_..._TO values? */
6384 r
= tsubst (TYPE_OFFSET_BASETYPE (t
), args
, complain
, in_decl
);
6385 if (r
== error_mark_node
|| !IS_AGGR_TYPE (r
))
6389 Type deduction may fail for any of the following
6392 -- Attempting to create "pointer to member of T" when T
6393 is not a class type. */
6395 cp_error ("creating pointer to member of non-class type `%T'",
6397 return error_mark_node
;
6399 return build_offset_type (r
, type
);
6407 fntype
= tsubst_function_type (t
, args
, complain
, in_decl
);
6408 if (fntype
== error_mark_node
)
6409 return error_mark_node
;
6411 /* Substitue the exception specification. */
6412 raises
= TYPE_RAISES_EXCEPTIONS (t
);
6415 raises
= tsubst (raises
, args
, complain
, in_decl
);
6416 if (raises
== error_mark_node
)
6418 fntype
= build_exception_variant (fntype
, raises
);
6424 tree domain
= tsubst (TYPE_DOMAIN (t
), args
, complain
, in_decl
);
6425 if (domain
== error_mark_node
)
6426 return error_mark_node
;
6428 /* As an optimization, we avoid regenerating the array type if
6429 it will obviously be the same as T. */
6430 if (type
== TREE_TYPE (t
) && domain
== TYPE_DOMAIN (t
))
6433 /* These checks should match the ones in grokdeclarator.
6437 The deduction may fail for any of the following reasons:
6439 -- Attempting to create an array with an element type that
6440 is void, a function type, or a reference type. */
6441 if (TREE_CODE (type
) == VOID_TYPE
6442 || TREE_CODE (type
) == FUNCTION_TYPE
6443 || TREE_CODE (type
) == REFERENCE_TYPE
)
6446 cp_error ("creating array of `%T'", type
);
6447 return error_mark_node
;
6450 r
= build_cplus_array_type (type
, domain
);
6457 tree e1
= tsubst (TREE_OPERAND (t
, 0), args
, complain
,
6459 tree e2
= tsubst (TREE_OPERAND (t
, 1), args
, complain
,
6462 if (e1
== error_mark_node
|| e2
== error_mark_node
)
6463 return error_mark_node
;
6465 return fold (build (TREE_CODE (t
), TREE_TYPE (t
), e1
, e2
));
6471 tree e
= tsubst (TREE_OPERAND (t
, 0), args
, complain
,
6473 if (e
== error_mark_node
)
6474 return error_mark_node
;
6476 return fold (build (TREE_CODE (t
), TREE_TYPE (t
), e
));
6481 tree ctx
= tsubst_aggr_type (TYPE_CONTEXT (t
), args
, complain
,
6482 in_decl
, /*entering_scope=*/1);
6483 tree f
= tsubst_copy (TYPENAME_TYPE_FULLNAME (t
), args
,
6486 if (ctx
== error_mark_node
|| f
== error_mark_node
)
6487 return error_mark_node
;
6489 if (!IS_AGGR_TYPE (ctx
))
6492 cp_error ("`%T' is not a class, struct, or union type",
6494 return error_mark_node
;
6496 else if (!uses_template_parms (ctx
) && !TYPE_BEING_DEFINED (ctx
))
6498 /* Normally, make_typename_type does not require that the CTX
6499 have complete type in order to allow things like:
6501 template <class T> struct S { typename S<T>::X Y; };
6503 But, such constructs have already been resolved by this
6504 point, so here CTX really should have complete type, unless
6505 it's a partial instantiation. */
6506 ctx
= complete_type (ctx
);
6507 if (!TYPE_SIZE (ctx
))
6510 incomplete_type_error (NULL_TREE
, ctx
);
6511 return error_mark_node
;
6515 f
= make_typename_type (ctx
, f
);
6516 return cp_build_qualified_type (f
,
6518 | CP_TYPE_QUALS (t
));
6523 tree e
= tsubst (TREE_OPERAND (t
, 0), args
, complain
,
6525 if (e
== error_mark_node
)
6526 return error_mark_node
;
6527 return make_pointer_declarator (type
, e
);
6532 tree e
= tsubst (TREE_OPERAND (t
, 0), args
, complain
,
6534 if (e
== error_mark_node
)
6535 return error_mark_node
;
6536 return make_reference_declarator (type
, e
);
6541 tree e1
= tsubst (TREE_OPERAND (t
, 0), args
, complain
,
6543 tree e2
= tsubst_expr (TREE_OPERAND (t
, 1), args
, complain
,
6545 if (e1
== error_mark_node
|| e2
== error_mark_node
)
6546 return error_mark_node
;
6548 return build_parse_node (ARRAY_REF
, e1
, e2
, tsubst_expr
);
6553 tree e1
= tsubst (TREE_OPERAND (t
, 0), args
, complain
,
6555 tree e2
= tsubst_call_declarator_parms (TREE_OPERAND (t
, 1), args
,
6557 tree e3
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
6559 if (e1
== error_mark_node
|| e2
== error_mark_node
6560 || e3
== error_mark_node
)
6561 return error_mark_node
;
6563 return make_call_declarator (e1
, e2
, TREE_OPERAND (t
, 2), e3
);
6568 tree e1
= tsubst (TREE_OPERAND (t
, 0), args
, complain
,
6570 tree e2
= tsubst (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
6571 if (e1
== error_mark_node
|| e2
== error_mark_node
)
6572 return error_mark_node
;
6574 return build_parse_node (TREE_CODE (t
), e1
, e2
);
6579 tree e1
= tsubst_expr (TYPE_FIELDS (t
), args
, complain
,
6581 if (e1
== error_mark_node
)
6582 return error_mark_node
;
6584 return TREE_TYPE (e1
);
6588 sorry ("use of `%s' in template",
6589 tree_code_name
[(int) TREE_CODE (t
)]);
6590 return error_mark_node
;
6597 emit_line_note (input_filename
, lineno
);
6601 expand_start_bindings (0);
6608 int saved_warn_unused
= 0;
6610 if (processing_template_decl
)
6612 saved_warn_unused
= warn_unused
;
6615 expand_end_bindings (getdecls (), kept_level_p (), 0);
6616 if (processing_template_decl
)
6617 warn_unused
= saved_warn_unused
;
6618 t
= poplevel (kept_level_p (), 1, 0);
6623 /* Like tsubst, but deals with expressions. This function just replaces
6624 template parms; to finish processing the resultant expression, use
6628 tsubst_copy (t
, args
, complain
, in_decl
)
6633 enum tree_code code
;
6636 if (t
== NULL_TREE
|| t
== error_mark_node
)
6639 code
= TREE_CODE (t
);
6644 return do_identifier (DECL_NAME (t
), 0, NULL_TREE
);
6651 if (!DECL_CONTEXT (t
))
6652 /* This is a global enumeration constant. */
6655 /* Unfortunately, we cannot just call lookup_name here.
6658 template <int I> int f() {
6660 struct S { void g() { E e = a; } };
6663 When we instantiate f<7>::S::g(), say, lookup_name is not
6664 clever enough to find f<7>::a. */
6666 = tsubst_aggr_type (TREE_TYPE (t
), args
, complain
, in_decl
,
6667 /*entering_scope=*/0);
6669 for (v
= TYPE_VALUES (enum_type
);
6672 if (TREE_PURPOSE (v
) == DECL_NAME (t
))
6673 return TREE_VALUE (v
);
6675 /* We didn't find the name. That should never happen; if
6676 name-lookup found it during preliminary parsing, we
6677 should find it again here during instantiation. */
6678 my_friendly_abort (0);
6683 if (DECL_CONTEXT (t
))
6687 ctx
= tsubst_aggr_type (DECL_CONTEXT (t
), args
, complain
, in_decl
,
6688 /*entering_scope=*/1);
6689 if (ctx
!= DECL_CONTEXT (t
))
6690 return lookup_field (ctx
, DECL_NAME (t
), 0, 0);
6696 if (DECL_LANG_SPECIFIC (t
) && DECL_TEMPLATE_INFO (t
))
6697 t
= tsubst (t
, args
, complain
, in_decl
);
6702 if (is_member_template (t
))
6703 return tsubst (t
, args
, complain
, in_decl
);
6709 /* We must tsbust into a LOOKUP_EXPR in case the names to
6710 which it refers is a conversion operator; in that case the
6711 name will change. We avoid making unnecessary copies,
6714 tree id
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
6716 if (id
!= TREE_OPERAND (t
, 0))
6718 r
= build_nt (LOOKUP_EXPR
, id
);
6719 LOOKUP_EXPR_GLOBAL (r
) = LOOKUP_EXPR_GLOBAL (t
);
6727 case REINTERPRET_CAST_EXPR
:
6728 case CONST_CAST_EXPR
:
6729 case STATIC_CAST_EXPR
:
6730 case DYNAMIC_CAST_EXPR
:
6733 (code
, tsubst (TREE_TYPE (t
), args
, complain
, in_decl
),
6734 tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
));
6737 case PREDECREMENT_EXPR
:
6738 case PREINCREMENT_EXPR
:
6739 case POSTDECREMENT_EXPR
:
6740 case POSTINCREMENT_EXPR
:
6742 case TRUTH_NOT_EXPR
:
6745 case CONVERT_EXPR
: /* Unary + */
6752 (code
, tsubst (TREE_TYPE (t
), args
, complain
, in_decl
),
6753 tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
));
6758 case TRUNC_DIV_EXPR
:
6760 case FLOOR_DIV_EXPR
:
6761 case ROUND_DIV_EXPR
:
6762 case EXACT_DIV_EXPR
:
6764 case BIT_ANDTC_EXPR
:
6767 case TRUNC_MOD_EXPR
:
6768 case FLOOR_MOD_EXPR
:
6769 case TRUTH_ANDIF_EXPR
:
6770 case TRUTH_ORIF_EXPR
:
6771 case TRUTH_AND_EXPR
:
6792 (code
, tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
),
6793 tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
));
6797 tree fn
= TREE_OPERAND (t
, 0);
6798 if (is_overloaded_fn (fn
))
6799 fn
= tsubst_copy (get_first_fn (fn
), args
, complain
, in_decl
);
6801 /* Sometimes FN is a LOOKUP_EXPR. */
6802 fn
= tsubst_copy (fn
, args
, complain
, in_decl
);
6804 (code
, fn
, tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
,
6809 case METHOD_CALL_EXPR
:
6811 tree name
= TREE_OPERAND (t
, 0);
6812 if (TREE_CODE (name
) == BIT_NOT_EXPR
)
6814 name
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
6816 name
= build1 (BIT_NOT_EXPR
, NULL_TREE
, name
);
6818 else if (TREE_CODE (name
) == SCOPE_REF
6819 && TREE_CODE (TREE_OPERAND (name
, 1)) == BIT_NOT_EXPR
)
6821 tree base
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
6823 name
= TREE_OPERAND (name
, 1);
6824 name
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
6826 name
= build1 (BIT_NOT_EXPR
, NULL_TREE
, name
);
6827 name
= build_nt (SCOPE_REF
, base
, name
);
6830 name
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
6832 (code
, name
, tsubst_copy (TREE_OPERAND (t
, 1), args
,
6834 tsubst_copy (TREE_OPERAND (t
, 2), args
, complain
, in_decl
),
6843 (code
, tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
),
6844 tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
),
6845 tsubst_copy (TREE_OPERAND (t
, 2), args
, complain
, in_decl
));
6847 if (code
== BIND_EXPR
&& !processing_template_decl
)
6849 /* This processing should really occur in tsubst_expr,
6850 However, tsubst_expr does not recurse into expressions,
6851 since it assumes that there aren't any statements
6852 inside them. Instead, it simply calls
6853 build_expr_from_tree. So, we need to expand the
6855 tree rtl_expr
= begin_stmt_expr ();
6856 tree block
= tsubst_expr (TREE_OPERAND (r
, 1), args
,
6858 r
= finish_stmt_expr (rtl_expr
, block
);
6867 (code
, tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
),
6868 tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
),
6869 tsubst_copy (TREE_OPERAND (t
, 2), args
, complain
, in_decl
));
6870 NEW_EXPR_USE_GLOBAL (r
) = NEW_EXPR_USE_GLOBAL (t
);
6877 (code
, tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
),
6878 tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
));
6879 DELETE_EXPR_USE_GLOBAL (r
) = DELETE_EXPR_USE_GLOBAL (t
);
6880 DELETE_EXPR_USE_VEC (r
) = DELETE_EXPR_USE_VEC (t
);
6884 case TEMPLATE_ID_EXPR
:
6886 /* Substituted template arguments */
6887 tree targs
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
,
6890 for (chain
= targs
; chain
; chain
= TREE_CHAIN (chain
))
6891 TREE_VALUE (chain
) = maybe_fold_nontype_arg (TREE_VALUE (chain
));
6893 return lookup_template_function
6894 (tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
), targs
);
6899 tree purpose
, value
, chain
;
6901 if (t
== void_list_node
)
6904 purpose
= TREE_PURPOSE (t
);
6906 purpose
= tsubst_copy (purpose
, args
, complain
, in_decl
);
6907 value
= TREE_VALUE (t
);
6909 value
= tsubst_copy (value
, args
, complain
, in_decl
);
6910 chain
= TREE_CHAIN (t
);
6911 if (chain
&& chain
!= void_type_node
)
6912 chain
= tsubst_copy (chain
, args
, complain
, in_decl
);
6913 if (purpose
== TREE_PURPOSE (t
)
6914 && value
== TREE_VALUE (t
)
6915 && chain
== TREE_CHAIN (t
))
6917 return tree_cons (purpose
, value
, chain
);
6924 case TEMPLATE_TYPE_PARM
:
6925 case TEMPLATE_TEMPLATE_PARM
:
6926 case TEMPLATE_PARM_INDEX
:
6928 case REFERENCE_TYPE
:
6935 return tsubst (t
, args
, complain
, in_decl
);
6937 case IDENTIFIER_NODE
:
6938 if (IDENTIFIER_TYPENAME_P (t
)
6939 /* Make sure it's not just a variable named `__opr', for instance,
6940 which can occur in some existing code. */
6942 return build_typename_overload
6943 (tsubst (TREE_TYPE (t
), args
, complain
, in_decl
));
6950 (CONSTRUCTOR
, tsubst (TREE_TYPE (t
), args
, complain
, in_decl
),
6951 NULL_TREE
, tsubst_copy (CONSTRUCTOR_ELTS (t
), args
,
6952 complain
, in_decl
));
6953 TREE_HAS_CONSTRUCTOR (r
) = TREE_HAS_CONSTRUCTOR (t
);
6962 /* Like tsubst_copy, but also does semantic processing and RTL expansion. */
6965 tsubst_expr (t
, args
, complain
, in_decl
)
6970 if (t
== NULL_TREE
|| t
== error_mark_node
)
6973 if (processing_template_decl
)
6974 return tsubst_copy (t
, args
, complain
, in_decl
);
6976 switch (TREE_CODE (t
))
6979 lineno
= TREE_COMPLEXITY (t
);
6980 finish_return_stmt (tsubst_expr (RETURN_EXPR (t
),
6981 args
, complain
, in_decl
));
6985 lineno
= TREE_COMPLEXITY (t
);
6986 finish_expr_stmt (tsubst_expr (EXPR_STMT_EXPR (t
),
6987 args
, complain
, in_decl
));
6992 int i
= suspend_momentary ();
6995 lineno
= TREE_COMPLEXITY (t
);
6996 emit_line_note (input_filename
, lineno
);
6998 (tsubst (TREE_OPERAND (t
, 0), args
, complain
, in_decl
),
6999 tsubst (TREE_OPERAND (t
, 1), args
, complain
, in_decl
),
7000 TREE_OPERAND (t
, 2) != 0, NULL_TREE
, NULL_TREE
);
7001 init
= tsubst_expr (TREE_OPERAND (t
, 2), args
, complain
, in_decl
);
7003 (dcl
, init
, NULL_TREE
, 1, /*init ? LOOKUP_ONLYCONVERTING :*/ 0);
7004 resume_momentary (i
);
7011 lineno
= TREE_COMPLEXITY (t
);
7014 for (tmp
= FOR_INIT_STMT (t
); tmp
; tmp
= TREE_CHAIN (tmp
))
7015 tsubst_expr (tmp
, args
, complain
, in_decl
);
7016 finish_for_init_stmt (NULL_TREE
);
7017 finish_for_cond (tsubst_expr (FOR_COND (t
), args
,
7020 tmp
= tsubst_expr (FOR_EXPR (t
), args
, complain
, in_decl
);
7021 finish_for_expr (tmp
, NULL_TREE
);
7022 tsubst_expr (FOR_BODY (t
), args
, complain
, in_decl
);
7023 finish_for_stmt (tmp
, NULL_TREE
);
7029 lineno
= TREE_COMPLEXITY (t
);
7030 begin_while_stmt ();
7031 finish_while_stmt_cond (tsubst_expr (WHILE_COND (t
),
7032 args
, complain
, in_decl
),
7034 tsubst_expr (WHILE_BODY (t
), args
, complain
, in_decl
);
7035 finish_while_stmt (NULL_TREE
);
7041 lineno
= TREE_COMPLEXITY (t
);
7043 tsubst_expr (DO_BODY (t
), args
, complain
, in_decl
);
7044 finish_do_body (NULL_TREE
);
7045 finish_do_stmt (tsubst_expr (DO_COND (t
), args
,
7055 lineno
= TREE_COMPLEXITY (t
);
7057 finish_if_stmt_cond (tsubst_expr (IF_COND (t
),
7058 args
, complain
, in_decl
),
7061 if (tmp
= THEN_CLAUSE (t
), tmp
)
7063 tsubst_expr (tmp
, args
, complain
, in_decl
);
7064 finish_then_clause (NULL_TREE
);
7067 if (tmp
= ELSE_CLAUSE (t
), tmp
)
7069 begin_else_clause ();
7070 tsubst_expr (tmp
, args
, complain
, in_decl
);
7071 finish_else_clause (NULL_TREE
);
7082 lineno
= TREE_COMPLEXITY (t
);
7083 begin_compound_stmt (COMPOUND_STMT_NO_SCOPE (t
));
7084 for (substmt
= COMPOUND_BODY (t
);
7085 substmt
!= NULL_TREE
;
7086 substmt
= TREE_CHAIN (substmt
))
7087 tsubst_expr (substmt
, args
, complain
, in_decl
);
7088 return finish_compound_stmt (COMPOUND_STMT_NO_SCOPE (t
),
7094 lineno
= TREE_COMPLEXITY (t
);
7095 finish_break_stmt ();
7099 lineno
= TREE_COMPLEXITY (t
);
7100 finish_continue_stmt ();
7107 lineno
= TREE_COMPLEXITY (t
);
7108 begin_switch_stmt ();
7109 val
= tsubst_expr (SWITCH_COND (t
), args
, complain
, in_decl
);
7110 finish_switch_cond (val
);
7112 if (tmp
= TREE_OPERAND (t
, 1), tmp
)
7113 tsubst_expr (tmp
, args
, complain
, in_decl
);
7115 finish_switch_stmt (val
, NULL_TREE
);
7120 finish_case_label (tsubst_expr (CASE_LOW (t
), args
, complain
, in_decl
),
7121 tsubst_expr (CASE_HIGH (t
), args
, complain
, in_decl
));
7125 t
= define_label (DECL_SOURCE_FILE (t
), DECL_SOURCE_LINE (t
),
7132 lineno
= TREE_COMPLEXITY (t
);
7133 t
= GOTO_DESTINATION (t
);
7134 if (TREE_CODE (t
) != IDENTIFIER_NODE
)
7135 /* Computed goto's must be tsubst'd into. On the other hand,
7136 non-computed gotos must not be; the identifier in question
7137 will have no binding. */
7138 t
= tsubst_expr (t
, args
, complain
, in_decl
);
7139 finish_goto_stmt (t
);
7143 lineno
= TREE_COMPLEXITY (t
);
7144 finish_asm_stmt (tsubst_expr (ASM_CV_QUAL (t
), args
, complain
, in_decl
),
7145 tsubst_expr (ASM_STRING (t
), args
, complain
, in_decl
),
7146 tsubst_expr (ASM_OUTPUTS (t
), args
, complain
, in_decl
),
7147 tsubst_expr (ASM_INPUTS (t
), args
, complain
, in_decl
),
7148 tsubst_expr (ASM_CLOBBERS (t
), args
, complain
,
7153 lineno
= TREE_COMPLEXITY (t
);
7155 tsubst_expr (TRY_STMTS (t
), args
, complain
, in_decl
);
7156 finish_try_block (NULL_TREE
);
7158 tree handler
= TRY_HANDLERS (t
);
7159 for (; handler
; handler
= TREE_CHAIN (handler
))
7160 tsubst_expr (handler
, args
, complain
, in_decl
);
7162 finish_handler_sequence (NULL_TREE
);
7166 lineno
= TREE_COMPLEXITY (t
);
7168 if (HANDLER_PARMS (t
))
7170 tree d
= HANDLER_PARMS (t
);
7171 expand_start_catch_block
7172 (tsubst (TREE_OPERAND (d
, 1), args
, complain
, in_decl
),
7173 tsubst (TREE_OPERAND (d
, 0), args
, complain
, in_decl
));
7176 expand_start_catch_block (NULL_TREE
, NULL_TREE
);
7177 finish_handler_parms (NULL_TREE
);
7178 tsubst_expr (HANDLER_BODY (t
), args
, complain
, in_decl
);
7179 finish_handler (NULL_TREE
);
7183 lineno
= TREE_COMPLEXITY (t
);
7185 if (TREE_CODE (t
) == ENUMERAL_TYPE
)
7186 tsubst (t
, args
, complain
, NULL_TREE
);
7190 return build_expr_from_tree (tsubst_copy (t
, args
, complain
, in_decl
));
7195 /* Instantiate the indicated variable or function template TMPL with
7196 the template arguments in TARG_PTR. */
7199 instantiate_template (tmpl
, targ_ptr
)
7200 tree tmpl
, targ_ptr
;
7206 struct obstack
*old_fmp_obstack
;
7207 extern struct obstack
*function_maybepermanent_obstack
;
7210 if (tmpl
== error_mark_node
)
7211 return error_mark_node
;
7213 my_friendly_assert (TREE_CODE (tmpl
) == TEMPLATE_DECL
, 283);
7215 /* Check to see if we already have this specialization. */
7216 spec
= retrieve_specialization (tmpl
, targ_ptr
);
7217 if (spec
!= NULL_TREE
)
7220 if (DECL_TEMPLATE_INFO (tmpl
))
7222 /* The TMPL is a partial instantiation. To get a full set of
7223 arguments we must add the arguments used to perform the
7224 partial instantiation. */
7225 targ_ptr
= add_outermost_template_args (DECL_TI_ARGS (tmpl
),
7227 gen_tmpl
= most_general_template (tmpl
);
7229 /* Check to see if we already have this specialization. */
7230 spec
= retrieve_specialization (gen_tmpl
, targ_ptr
);
7231 if (spec
!= NULL_TREE
)
7237 push_obstacks (&permanent_obstack
, &permanent_obstack
);
7238 old_fmp_obstack
= function_maybepermanent_obstack
;
7239 function_maybepermanent_obstack
= &permanent_obstack
;
7241 len
= DECL_NTPARMS (gen_tmpl
);
7242 inner_args
= innermost_args (targ_ptr
);
7246 tree t
= TREE_VEC_ELT (inner_args
, i
);
7247 if (TREE_CODE_CLASS (TREE_CODE (t
)) == 't')
7249 tree nt
= target_type (t
);
7250 if (IS_AGGR_TYPE (nt
) && decl_function_context (TYPE_MAIN_DECL (nt
)))
7252 cp_error ("type `%T' composed from a local class is not a valid template-argument", t
);
7253 cp_error (" trying to instantiate `%D'", gen_tmpl
);
7254 fndecl
= error_mark_node
;
7259 targ_ptr
= copy_to_permanent (targ_ptr
);
7261 /* substitute template parameters */
7262 fndecl
= tsubst (DECL_RESULT (gen_tmpl
), targ_ptr
, /*complain=*/1, gen_tmpl
);
7263 /* The DECL_TI_TEMPLATE should always be the immediate parent
7264 template, not the most general template. */
7265 DECL_TI_TEMPLATE (fndecl
) = tmpl
;
7267 if (flag_external_templates
)
7268 add_pending_template (fndecl
);
7271 function_maybepermanent_obstack
= old_fmp_obstack
;
7277 /* Push the name of the class template into the scope of the instantiation. */
7280 overload_template_name (type
)
7283 tree id
= DECL_NAME (CLASSTYPE_TI_TEMPLATE (type
));
7286 if (IDENTIFIER_CLASS_VALUE (id
)
7287 && TREE_TYPE (IDENTIFIER_CLASS_VALUE (id
)) == type
)
7290 decl
= build_decl (TYPE_DECL
, id
, type
);
7291 SET_DECL_ARTIFICIAL (decl
);
7292 pushdecl_class_level (decl
);
7295 /* The FN is a TEMPLATE_DECL for a function. The ARGS are the
7296 arguments that are being used when calling it. TARGS is a vector
7297 into which the deduced template arguments are placed.
7299 Return zero for success, 2 for an incomplete match that doesn't resolve
7300 all the types, and 1 for complete failure. An error message will be
7301 printed only for an incomplete match.
7303 If FN is a conversion operator, RETURN_TYPE is the type desired as
7304 the result of the conversion operator.
7306 TPARMS is a vector of template parameters.
7308 The EXPLICIT_TARGS are explicit template arguments provided via a
7311 The parameter STRICT is one of:
7314 We are deducing arguments for a function call, as in
7318 We are deducing arguments for a conversion function, as in
7322 We are deducing arguments when calculating the partial
7323 ordering between specializations of function or class
7324 templates, as in [temp.func.order] and [temp.class.order],
7325 when doing an explicit instantiation as in [temp.explicit],
7326 when determining an explicit specialization as in
7327 [temp.expl.spec], or when taking the address of a function
7328 template, as in [temp.deduct.funcaddr].
7330 The other arguments are as for type_unification. */
7333 fn_type_unification (fn
, explicit_targs
, targs
, args
, return_type
,
7335 tree fn
, explicit_targs
, targs
, args
, return_type
;
7336 unification_kind_t strict
;
7341 my_friendly_assert (TREE_CODE (fn
) == TEMPLATE_DECL
, 0);
7343 fntype
= TREE_TYPE (fn
);
7348 The specified template arguments must match the template
7349 parameters in kind (i.e., type, nontype, template), and there
7350 must not be more arguments than there are parameters;
7351 otherwise type deduction fails.
7353 Nontype arguments must match the types of the corresponding
7354 nontype template parameters, or must be convertible to the
7355 types of the corresponding nontype parameters as specified in
7356 _temp.arg.nontype_, otherwise type deduction fails.
7358 All references in the function type of the function template
7359 to the corresponding template parameters are replaced by the
7360 specified template argument values. If a substitution in a
7361 template parameter or in the function type of the function
7362 template results in an invalid type, type deduction fails. */
7364 tree converted_args
;
7367 = (coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (fn
),
7368 explicit_targs
, NULL_TREE
, /*complain=*/0,
7369 /*require_all_arguments=*/0));
7370 if (converted_args
== error_mark_node
)
7373 fntype
= tsubst (fntype
, converted_args
, /*complain=*/0, NULL_TREE
);
7374 if (fntype
== error_mark_node
)
7377 /* Place the explicitly specified arguments in TARGS. */
7378 for (i
= 0; i
< TREE_VEC_LENGTH (targs
); i
++)
7379 TREE_VEC_ELT (targs
, i
) = TREE_VEC_ELT (converted_args
, i
);
7382 parms
= TYPE_ARG_TYPES (fntype
);
7384 if (DECL_CONV_FN_P (fn
))
7386 /* This is a template conversion operator. Use the return types
7387 as well as the argument types. We use it instead of 'this', since
7388 we could be comparing conversions from different classes. */
7389 parms
= scratch_tree_cons (NULL_TREE
, TREE_TYPE (fntype
),
7390 TREE_CHAIN (parms
));
7391 args
= scratch_tree_cons (NULL_TREE
, return_type
, TREE_CHAIN (args
));
7394 /* We allow incomplete unification without an error message here
7395 because the standard doesn't seem to explicitly prohibit it. Our
7396 callers must be ready to deal with unification failures in any
7398 return type_unification_real (DECL_INNERMOST_TEMPLATE_PARMS (fn
),
7399 targs
, parms
, args
, /*subr=*/0,
7400 strict
, /*allow_incomplete*/1);
7403 /* Adjust types before performing type deduction, as described in
7404 [temp.deduct.call] and [temp.deduct.conv]. The rules in these two
7405 sections are symmetric. PARM is the type of a function parameter
7406 or the return type of the conversion function. ARG is the type of
7407 the argument passed to the call, or the type of the value
7408 intialized with the result of the conversion function. */
7411 maybe_adjust_types_for_deduction (strict
, parm
, arg
)
7412 unification_kind_t strict
;
7423 /* Swap PARM and ARG throughout the remainder of this
7424 function; the handling is precisely symmetric since PARM
7425 will initialize ARG rather than vice versa. */
7433 /* There is nothing to do in this case. */
7437 my_friendly_abort (0);
7440 if (TREE_CODE (*parm
) != REFERENCE_TYPE
)
7442 /* [temp.deduct.call]
7444 If P is not a reference type:
7446 --If A is an array type, the pointer type produced by the
7447 array-to-pointer standard conversion (_conv.array_) is
7448 used in place of A for type deduction; otherwise,
7450 --If A is a function type, the pointer type produced by
7451 the function-to-pointer standard conversion
7452 (_conv.func_) is used in place of A for type deduction;
7455 --If A is a cv-qualified type, the top level
7456 cv-qualifiers of A's type are ignored for type
7458 if (TREE_CODE (*arg
) == ARRAY_TYPE
)
7459 *arg
= build_pointer_type (TREE_TYPE (*arg
));
7460 else if (TREE_CODE (*arg
) == FUNCTION_TYPE
)
7461 *arg
= build_pointer_type (*arg
);
7463 *arg
= TYPE_MAIN_VARIANT (*arg
);
7466 /* [temp.deduct.call]
7468 If P is a cv-qualified type, the top level cv-qualifiers
7469 of P's type are ignored for type deduction. If P is a
7470 reference type, the type referred to by P is used for
7472 *parm
= TYPE_MAIN_VARIANT (*parm
);
7473 if (TREE_CODE (*parm
) == REFERENCE_TYPE
)
7474 *parm
= TREE_TYPE (*parm
);
7477 /* Like type_unfication.
7479 If SUBR is 1, we're being called recursively (to unify the
7480 arguments of a function or method parameter of a function
7484 type_unification_real (tparms
, targs
, parms
, args
, subr
,
7485 strict
, allow_incomplete
)
7486 tree tparms
, targs
, parms
, args
;
7488 unification_kind_t strict
;
7489 int allow_incomplete
;
7493 int ntparms
= TREE_VEC_LENGTH (tparms
);
7496 my_friendly_assert (TREE_CODE (tparms
) == TREE_VEC
, 289);
7497 my_friendly_assert (parms
== NULL_TREE
7498 || TREE_CODE (parms
) == TREE_LIST
, 290);
7499 /* ARGS could be NULL (via a call from parse.y to
7500 build_x_function_call). */
7502 my_friendly_assert (TREE_CODE (args
) == TREE_LIST
, 291);
7503 my_friendly_assert (ntparms
> 0, 292);
7508 sub_strict
= UNIFY_ALLOW_MORE_CV_QUAL
| UNIFY_ALLOW_DERIVED
;
7512 sub_strict
= UNIFY_ALLOW_LESS_CV_QUAL
;
7516 sub_strict
= UNIFY_ALLOW_NONE
;
7520 my_friendly_abort (0);
7524 && parms
!= void_list_node
7526 && args
!= void_list_node
)
7528 parm
= TREE_VALUE (parms
);
7529 parms
= TREE_CHAIN (parms
);
7530 arg
= TREE_VALUE (args
);
7531 args
= TREE_CHAIN (args
);
7533 if (arg
== error_mark_node
)
7535 if (arg
== unknown_type_node
)
7536 /* We can't deduce anything from this, but we might get all the
7537 template args from other function args. */
7540 /* Conversions will be performed on a function argument that
7541 corresponds with a function parameter that contains only
7542 non-deducible template parameters and explicitly specified
7543 template parameters. */
7544 if (! uses_template_parms (parm
))
7548 if (TREE_CODE_CLASS (TREE_CODE (arg
)) != 't')
7549 type
= TREE_TYPE (arg
);
7556 if (strict
== DEDUCE_EXACT
)
7558 if (same_type_p (parm
, type
))
7562 /* It might work; we shouldn't check now, because we might
7563 get into infinite recursion. Overload resolution will
7570 if (TREE_CODE_CLASS (TREE_CODE (arg
)) != 't')
7572 my_friendly_assert (TREE_TYPE (arg
) != NULL_TREE
, 293);
7573 if (type_unknown_p (arg
))
7575 /* [temp.deduct.type] A template-argument can be deduced from
7576 a pointer to function or pointer to member function
7577 argument if the set of overloaded functions does not
7578 contain function templates and at most one of a set of
7579 overloaded functions provides a unique match. */
7581 if (resolve_overloaded_unification
7582 (tparms
, targs
, parm
, arg
, strict
, sub_strict
)
7587 arg
= TREE_TYPE (arg
);
7591 maybe_adjust_types_for_deduction (strict
, &parm
, &arg
);
7593 switch (unify (tparms
, targs
, parm
, arg
, sub_strict
))
7601 /* Fail if we've reached the end of the parm list, and more args
7602 are present, and the parm list isn't variadic. */
7603 if (args
&& args
!= void_list_node
&& parms
== void_list_node
)
7605 /* Fail if parms are left and they don't have default values. */
7607 && parms
!= void_list_node
7608 && TREE_PURPOSE (parms
) == NULL_TREE
)
7611 for (i
= 0; i
< ntparms
; i
++)
7612 if (TREE_VEC_ELT (targs
, i
) == NULL_TREE
)
7614 if (!allow_incomplete
)
7615 error ("incomplete type unification");
7621 /* Subroutine of type_unification_real. Args are like the variables at the
7622 call site. ARG is an overloaded function (or template-id); we try
7623 deducing template args from each of the overloads, and if only one
7624 succeeds, we go with that. Modifies TARGS and returns 0 on success. */
7627 resolve_overloaded_unification (tparms
, targs
, parm
, arg
, strict
,
7629 tree tparms
, targs
, parm
, arg
;
7630 unification_kind_t strict
;
7633 tree tempargs
= copy_node (targs
);
7636 if (TREE_CODE (arg
) == ADDR_EXPR
)
7637 arg
= TREE_OPERAND (arg
, 0);
7639 if (TREE_CODE (arg
) == COMPONENT_REF
)
7640 /* Handle `&x' where `x' is some static or non-static member
7642 arg
= TREE_OPERAND (arg
, 1);
7644 /* Strip baselink information. */
7645 while (TREE_CODE (arg
) == TREE_LIST
)
7646 arg
= TREE_VALUE (arg
);
7648 if (TREE_CODE (arg
) == TEMPLATE_ID_EXPR
)
7650 /* If we got some explicit template args, we need to plug them into
7651 the affected templates before we try to unify, in case the
7652 explicit args will completely resolve the templates in question. */
7654 tree expl_subargs
= TREE_OPERAND (arg
, 1);
7655 arg
= TREE_OPERAND (arg
, 0);
7657 for (; arg
; arg
= OVL_NEXT (arg
))
7659 tree fn
= OVL_CURRENT (arg
);
7662 if (TREE_CODE (fn
) != TEMPLATE_DECL
)
7665 subargs
= get_bindings_overload (fn
, DECL_RESULT (fn
), expl_subargs
);
7668 elem
= tsubst (TREE_TYPE (fn
), subargs
, /*complain=*/0,
7670 if (TREE_CODE (elem
) == METHOD_TYPE
)
7671 elem
= build_ptrmemfunc_type (build_pointer_type (elem
));
7672 good
+= try_one_overload (tparms
, targs
, tempargs
, parm
, elem
,
7673 strict
, sub_strict
);
7677 else if (TREE_CODE (arg
) == OVERLOAD
)
7679 for (; arg
; arg
= OVL_NEXT (arg
))
7681 tree type
= TREE_TYPE (OVL_CURRENT (arg
));
7682 if (TREE_CODE (type
) == METHOD_TYPE
)
7683 type
= build_ptrmemfunc_type (build_pointer_type (type
));
7684 good
+= try_one_overload (tparms
, targs
, tempargs
, parm
,
7686 strict
, sub_strict
);
7690 my_friendly_abort (981006);
7692 /* [temp.deduct.type] A template-argument can be deduced from a pointer
7693 to function or pointer to member function argument if the set of
7694 overloaded functions does not contain function templates and at most
7695 one of a set of overloaded functions provides a unique match.
7697 So if we found multiple possibilities, we return success but don't
7702 int i
= TREE_VEC_LENGTH (targs
);
7704 if (TREE_VEC_ELT (tempargs
, i
))
7705 TREE_VEC_ELT (targs
, i
) = TREE_VEC_ELT (tempargs
, i
);
7713 /* Subroutine of resolve_overloaded_unification; does deduction for a single
7714 overload. Fills TARGS with any deduced arguments, or error_mark_node if
7715 different overloads deduce different arguments for a given parm.
7716 Returns 1 on success. */
7719 try_one_overload (tparms
, orig_targs
, targs
, parm
, arg
, strict
,
7721 tree tparms
, orig_targs
, targs
, parm
, arg
;
7722 unification_kind_t strict
;
7729 /* [temp.deduct.type] A template-argument can be deduced from a pointer
7730 to function or pointer to member function argument if the set of
7731 overloaded functions does not contain function templates and at most
7732 one of a set of overloaded functions provides a unique match.
7734 So if this is a template, just return success. */
7736 if (uses_template_parms (arg
))
7739 maybe_adjust_types_for_deduction (strict
, &parm
, &arg
);
7741 /* We don't copy orig_targs for this because if we have already deduced
7742 some template args from previous args, unify would complain when we
7743 try to deduce a template parameter for the same argument, even though
7744 there isn't really a conflict. */
7745 nargs
= TREE_VEC_LENGTH (targs
);
7746 tempargs
= make_scratch_vec (nargs
);
7748 if (unify (tparms
, tempargs
, parm
, arg
, sub_strict
) != 0)
7751 /* First make sure we didn't deduce anything that conflicts with
7752 explicitly specified args. */
7753 for (i
= nargs
; i
--; )
7755 tree elt
= TREE_VEC_ELT (tempargs
, i
);
7756 tree oldelt
= TREE_VEC_ELT (orig_targs
, i
);
7758 if (elt
== NULL_TREE
)
7760 else if (uses_template_parms (elt
))
7762 /* Since we're unifying against ourselves, we will fill in template
7763 args used in the function parm list with our own template parms.
7765 TREE_VEC_ELT (tempargs
, i
) = NULL_TREE
;
7768 else if (oldelt
&& ! template_args_equal (oldelt
, elt
))
7772 for (i
= nargs
; i
--; )
7774 tree elt
= TREE_VEC_ELT (tempargs
, i
);
7777 TREE_VEC_ELT (targs
, i
) = elt
;
7783 /* PARM is a template class (perhaps with unbound template
7784 parameters). ARG is a fully instantiated type. If ARG can be
7785 bound to PARM, return ARG, otherwise return NULL_TREE. TPARMS and
7786 TARGS are as for unify. */
7789 try_class_unification (tparms
, targs
, parm
, arg
)
7798 if (!CLASSTYPE_TEMPLATE_INFO (arg
)
7799 || CLASSTYPE_TI_TEMPLATE (arg
) != CLASSTYPE_TI_TEMPLATE (parm
))
7802 /* We need to make a new template argument vector for the call to
7803 unify. If we used TARGS, we'd clutter it up with the result of
7804 the attempted unification, even if this class didn't work out.
7805 We also don't want to commit ourselves to all the unifications
7806 we've already done, since unification is supposed to be done on
7807 an argument-by-argument basis. In other words, consider the
7808 following pathological case:
7810 template <int I, int J, int K>
7813 template <int I, int J>
7814 struct S<I, J, 2> : public S<I, I, I>, S<J, J, J> {};
7816 template <int I, int J, int K>
7817 void f(S<I, J, K>, S<I, I, I>);
7826 Now, by the time we consider the unification involving `s2', we
7827 already know that we must have `f<0, 0, 0>'. But, even though
7828 `S<0, 1, 2>' is derived from `S<0, 0, 0>', the code is not legal
7829 because there are two ways to unify base classes of S<0, 1, 2>
7830 with S<I, I, I>. If we kept the already deduced knowledge, we
7831 would reject the possibility I=1. */
7833 copy_of_targs
= make_temp_vec (TREE_VEC_LENGTH (targs
));
7834 i
= unify (tparms
, copy_of_targs
, CLASSTYPE_TI_ARGS (parm
),
7835 CLASSTYPE_TI_ARGS (arg
), UNIFY_ALLOW_NONE
);
7838 /* If unification failed, we're done. */
7845 /* Subroutine of get_template_base. RVAL, if non-NULL, is a base we
7846 have alreay discovered to be satisfactory. ARG_BINFO is the binfo
7847 for the base class of ARG that we are currently examining. */
7850 get_template_base_recursive (tparms
, targs
, parm
,
7851 arg_binfo
, rval
, flags
)
7861 tree arg
= BINFO_TYPE (arg_binfo
);
7863 if (!(flags
& GTB_IGNORE_TYPE
))
7865 tree r
= try_class_unification (tparms
, targs
,
7868 /* If there is more than one satisfactory baseclass, then:
7872 If they yield more than one possible deduced A, the type
7876 if (r
&& rval
&& !same_type_p (r
, rval
))
7877 return error_mark_node
;
7882 binfos
= BINFO_BASETYPES (arg_binfo
);
7883 n_baselinks
= binfos
? TREE_VEC_LENGTH (binfos
) : 0;
7885 /* Process base types. */
7886 for (i
= 0; i
< n_baselinks
; i
++)
7888 tree base_binfo
= TREE_VEC_ELT (binfos
, i
);
7891 /* Skip this base, if we've already seen it. */
7892 if (BINFO_MARKED (base_binfo
))
7896 (flags
& GTB_VIA_VIRTUAL
) || TREE_VIA_VIRTUAL (base_binfo
);
7898 /* When searching for a non-virtual, we cannot mark virtually
7901 SET_BINFO_MARKED (base_binfo
);
7903 rval
= get_template_base_recursive (tparms
, targs
,
7907 GTB_VIA_VIRTUAL
* this_virtual
);
7909 /* If we discovered more than one matching base class, we can
7911 if (rval
== error_mark_node
)
7912 return error_mark_node
;
7918 /* Given a template type PARM and a class type ARG, find the unique
7919 base type in ARG that is an instance of PARM. We do not examine
7920 ARG itself; only its base-classes. If there is no appropriate base
7921 class, return NULL_TREE. If there is more than one, return
7922 error_mark_node. PARM may be the type of a partial specialization,
7923 as well as a plain template type. Used by unify. */
7926 get_template_base (tparms
, targs
, parm
, arg
)
7935 my_friendly_assert (IS_AGGR_TYPE_CODE (TREE_CODE (arg
)), 92);
7937 arg_binfo
= TYPE_BINFO (complete_type (arg
));
7938 rval
= get_template_base_recursive (tparms
, targs
,
7943 /* Since get_template_base_recursive marks the bases classes, we
7944 must unmark them here. */
7945 dfs_walk (arg_binfo
, dfs_unmark
, markedp
, 0);
7950 /* Returns the level of DECL, which declares a template parameter. */
7953 template_decl_level (decl
)
7956 switch (TREE_CODE (decl
))
7960 return TEMPLATE_TYPE_LEVEL (TREE_TYPE (decl
));
7963 return TEMPLATE_PARM_LEVEL (DECL_INITIAL (decl
));
7966 my_friendly_abort (0);
7971 /* Decide whether ARG can be unified with PARM, considering only the
7972 cv-qualifiers of each type, given STRICT as documented for unify.
7973 Returns non-zero iff the unification is OK on that basis.*/
7976 check_cv_quals_for_unify (strict
, arg
, parm
)
7981 return !((!(strict
& UNIFY_ALLOW_MORE_CV_QUAL
)
7982 && !at_least_as_qualified_p (arg
, parm
))
7983 || (!(strict
& UNIFY_ALLOW_LESS_CV_QUAL
)
7984 && (!at_least_as_qualified_p (parm
, arg
))));
7987 /* Takes parameters as for type_unification. Returns 0 if the
7988 type deduction suceeds, 1 otherwise. The parameter STRICT is a
7989 bitwise or of the following flags:
7992 Require an exact match between PARM and ARG.
7993 UNIFY_ALLOW_MORE_CV_QUAL:
7994 Allow the deduced ARG to be more cv-qualified than ARG.
7995 UNIFY_ALLOW_LESS_CV_QUAL:
7996 Allow the deduced ARG to be less cv-qualified than ARG.
7997 UNIFY_ALLOW_DERIVED:
7998 Allow the deduced ARG to be a template base class of ARG,
7999 or a pointer to a template base class of the type pointed to by
8001 UNIFY_ALLOW_INTEGER:
8002 Allow any integral type to be deduced. See the TEMPLATE_PARM_INDEX
8003 case for more information. */
8006 unify (tparms
, targs
, parm
, arg
, strict
)
8007 tree tparms
, targs
, parm
, arg
;
8014 /* I don't think this will do the right thing with respect to types.
8015 But the only case I've seen it in so far has been array bounds, where
8016 signedness is the only information lost, and I think that will be
8018 while (TREE_CODE (parm
) == NOP_EXPR
)
8019 parm
= TREE_OPERAND (parm
, 0);
8021 if (arg
== error_mark_node
)
8023 if (arg
== unknown_type_node
)
8024 /* We can't deduce anything from this, but we might get all the
8025 template args from other function args. */
8028 /* If PARM uses template parameters, then we can't bail out here,
8029 even if ARG == PARM, since we won't record unifications for the
8030 template parameters. We might need them if we're trying to
8031 figure out which of two things is more specialized. */
8032 if (arg
== parm
&& !uses_template_parms (parm
))
8035 /* Immediately reject some pairs that won't unify because of
8036 cv-qualification mismatches. */
8037 if (TREE_CODE (arg
) == TREE_CODE (parm
)
8038 && TREE_CODE_CLASS (TREE_CODE (arg
)) == 't'
8039 /* We check the cv-qualifiers when unifying with template type
8040 parameters below. We want to allow ARG `const T' to unify with
8041 PARM `T' for example, when computing which of two templates
8042 is more specialized, for example. */
8043 && TREE_CODE (arg
) != TEMPLATE_TYPE_PARM
8044 && !check_cv_quals_for_unify (strict
, arg
, parm
))
8047 switch (TREE_CODE (parm
))
8050 /* In a type which contains a nested-name-specifier, template
8051 argument values cannot be deduced for template parameters used
8052 within the nested-name-specifier. */
8055 case TEMPLATE_TYPE_PARM
:
8056 case TEMPLATE_TEMPLATE_PARM
:
8057 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, 0));
8059 if (TEMPLATE_TYPE_LEVEL (parm
)
8060 != template_decl_level (tparm
))
8061 /* The PARM is not one we're trying to unify. Just check
8062 to see if it matches ARG. */
8063 return (TREE_CODE (arg
) == TREE_CODE (parm
)
8064 && same_type_p (parm
, arg
)) ? 0 : 1;
8065 idx
= TEMPLATE_TYPE_IDX (parm
);
8066 targ
= TREE_VEC_ELT (targs
, idx
);
8067 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, idx
));
8069 /* Check for mixed types and values. */
8070 if ((TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
8071 && TREE_CODE (tparm
) != TYPE_DECL
)
8072 || (TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
8073 && TREE_CODE (tparm
) != TEMPLATE_DECL
))
8076 if (TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
)
8078 if (TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (parm
))
8080 /* We arrive here when PARM does not involve template
8083 /* ARG must be constructed from a template class. */
8084 if (TREE_CODE (arg
) != RECORD_TYPE
|| !CLASSTYPE_TEMPLATE_INFO (arg
))
8088 tree parmtmpl
= TYPE_TI_TEMPLATE (parm
);
8089 tree parmvec
= TYPE_TI_ARGS (parm
);
8090 tree argvec
= CLASSTYPE_TI_ARGS (arg
);
8092 = DECL_INNERMOST_TEMPLATE_PARMS (CLASSTYPE_TI_TEMPLATE (arg
));
8095 /* The parameter and argument roles have to be switched here
8096 in order to handle default arguments properly. For example,
8097 template<template <class> class TT> void f(TT<int>)
8098 should be able to accept vector<int> which comes from
8099 template <class T, class Allocator = allocator>
8102 if (coerce_template_parms (argtmplvec
, parmvec
, parmtmpl
, 0, 1)
8106 /* Deduce arguments T, i from TT<T> or TT<i>.
8107 We check each element of PARMVEC and ARGVEC individually
8108 rather than the whole TREE_VEC since they can have
8109 different number of elements. */
8111 for (i
= 0; i
< TREE_VEC_LENGTH (parmvec
); ++i
)
8113 tree t
= TREE_VEC_ELT (parmvec
, i
);
8115 if (unify (tparms
, targs
, t
,
8116 TREE_VEC_ELT (argvec
, i
),
8121 arg
= CLASSTYPE_TI_TEMPLATE (arg
);
8126 /* If PARM is `const T' and ARG is only `int', we don't have
8127 a match unless we are allowing additional qualification.
8128 If ARG is `const int' and PARM is just `T' that's OK;
8129 that binds `const int' to `T'. */
8130 if (!check_cv_quals_for_unify (strict
| UNIFY_ALLOW_LESS_CV_QUAL
,
8134 /* Consider the case where ARG is `const volatile int' and
8135 PARM is `const T'. Then, T should be `volatile int'. */
8137 cp_build_qualified_type (arg
,
8139 & ~CP_TYPE_QUALS (parm
));
8142 /* Simple cases: Value already set, does match or doesn't. */
8143 if (targ
!= NULL_TREE
&& same_type_p (targ
, arg
))
8148 /* Make sure that ARG is not a variable-sized array. (Note that
8149 were talking about variable-sized arrays (like `int[n]'),
8150 rather than arrays of unknown size (like `int[]').) We'll
8151 get very confused by such a type since the bound of the array
8152 will not be computable in an instantiation. Besides, such
8153 types are not allowed in ISO C++, so we can do as we please
8155 if (TREE_CODE (arg
) == ARRAY_TYPE
8156 && !uses_template_parms (arg
)
8157 && (TREE_CODE (TYPE_MAX_VALUE (TYPE_DOMAIN (arg
)))
8161 TREE_VEC_ELT (targs
, idx
) = arg
;
8164 case TEMPLATE_PARM_INDEX
:
8165 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, 0));
8167 if (TEMPLATE_PARM_LEVEL (parm
)
8168 != template_decl_level (tparm
))
8169 /* The PARM is not one we're trying to unify. Just check
8170 to see if it matches ARG. */
8171 return (TREE_CODE (arg
) == TREE_CODE (parm
)
8172 && cp_tree_equal (parm
, arg
) > 0) ? 0 : 1;
8174 idx
= TEMPLATE_PARM_IDX (parm
);
8175 targ
= TREE_VEC_ELT (targs
, idx
);
8179 int i
= (cp_tree_equal (targ
, arg
) > 0);
8185 my_friendly_abort (42);
8188 /* [temp.deduct.type] If, in the declaration of a function template
8189 with a non-type template-parameter, the non-type
8190 template-parameter is used in an expression in the function
8191 parameter-list and, if the corresponding template-argument is
8192 deduced, the template-argument type shall match the type of the
8193 template-parameter exactly, except that a template-argument
8194 deduced from an array bound may be of any integral type. */
8195 if (same_type_p (TREE_TYPE (arg
), TREE_TYPE (parm
)))
8197 else if ((strict
& UNIFY_ALLOW_INTEGER
)
8198 && (TREE_CODE (TREE_TYPE (parm
)) == INTEGER_TYPE
8199 || TREE_CODE (TREE_TYPE (parm
)) == BOOLEAN_TYPE
))
8204 TREE_VEC_ELT (targs
, idx
) = copy_to_permanent (arg
);
8211 if (TREE_CODE (arg
) == RECORD_TYPE
&& TYPE_PTRMEMFUNC_FLAG (arg
))
8212 return (unify (tparms
, targs
, parm
,
8213 TYPE_PTRMEMFUNC_FN_TYPE (arg
), strict
));
8215 if (TREE_CODE (arg
) != POINTER_TYPE
)
8218 /* [temp.deduct.call]
8220 A can be another pointer or pointer to member type that can
8221 be converted to the deduced A via a qualification
8222 conversion (_conv.qual_).
8224 We pass down STRICT here rather than UNIFY_ALLOW_NONE.
8225 This will allow for additional cv-qualification of the
8226 pointed-to types if appropriate. In general, this is a bit
8227 too generous; we are only supposed to allow qualification
8228 conversions and this method will allow an ARG of char** and
8229 a deduced ARG of const char**. However, overload
8230 resolution will subsequently invalidate the candidate, so
8231 this is probably OK. */
8232 sub_strict
= strict
;
8234 if (TREE_CODE (TREE_TYPE (arg
)) != RECORD_TYPE
8235 || TYPE_PTRMEMFUNC_FLAG (TREE_TYPE (arg
)))
8236 /* The derived-to-base conversion only persists through one
8237 level of pointers. */
8238 sub_strict
&= ~UNIFY_ALLOW_DERIVED
;
8240 return unify (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE
8244 case REFERENCE_TYPE
:
8245 if (TREE_CODE (arg
) != REFERENCE_TYPE
)
8247 return unify (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
8251 if (TREE_CODE (arg
) != ARRAY_TYPE
)
8253 if ((TYPE_DOMAIN (parm
) == NULL_TREE
)
8254 != (TYPE_DOMAIN (arg
) == NULL_TREE
))
8256 if (TYPE_DOMAIN (parm
) != NULL_TREE
8257 && unify (tparms
, targs
, TYPE_DOMAIN (parm
),
8258 TYPE_DOMAIN (arg
), UNIFY_ALLOW_NONE
) != 0)
8260 return unify (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
8268 if (TREE_CODE (arg
) != TREE_CODE (parm
))
8271 if (TREE_CODE (parm
) == INTEGER_TYPE
8272 && TREE_CODE (TYPE_MAX_VALUE (parm
)) != INTEGER_CST
)
8274 if (TYPE_MIN_VALUE (parm
) && TYPE_MIN_VALUE (arg
)
8275 && unify (tparms
, targs
, TYPE_MIN_VALUE (parm
),
8276 TYPE_MIN_VALUE (arg
), UNIFY_ALLOW_INTEGER
))
8278 if (TYPE_MAX_VALUE (parm
) && TYPE_MAX_VALUE (arg
)
8279 && unify (tparms
, targs
, TYPE_MAX_VALUE (parm
),
8280 TYPE_MAX_VALUE (arg
), UNIFY_ALLOW_INTEGER
))
8283 /* We use the TYPE_MAIN_VARIANT since we have already
8284 checked cv-qualification at the top of the
8286 else if (!same_type_p (TYPE_MAIN_VARIANT (arg
),
8287 TYPE_MAIN_VARIANT (parm
)))
8290 /* As far as unification is concerned, this wins. Later checks
8291 will invalidate it if necessary. */
8294 /* Types INTEGER_CST and MINUS_EXPR can come from array bounds. */
8295 /* Type INTEGER_CST can come from ordinary constant template args. */
8297 while (TREE_CODE (arg
) == NOP_EXPR
)
8298 arg
= TREE_OPERAND (arg
, 0);
8300 if (TREE_CODE (arg
) != INTEGER_CST
)
8302 return !tree_int_cst_equal (parm
, arg
);
8307 if (TREE_CODE (arg
) != TREE_VEC
)
8309 if (TREE_VEC_LENGTH (parm
) != TREE_VEC_LENGTH (arg
))
8311 for (i
= TREE_VEC_LENGTH (parm
) - 1; i
>= 0; i
--)
8312 if (unify (tparms
, targs
,
8313 TREE_VEC_ELT (parm
, i
), TREE_VEC_ELT (arg
, i
),
8321 if (TYPE_PTRMEMFUNC_FLAG (parm
))
8322 return unify (tparms
, targs
, TYPE_PTRMEMFUNC_FN_TYPE (parm
),
8325 if (TREE_CODE (arg
) != TREE_CODE (parm
))
8328 if (CLASSTYPE_TEMPLATE_INFO (parm
))
8332 if (strict
& UNIFY_ALLOW_DERIVED
)
8334 /* First, we try to unify the PARM and ARG directly. */
8335 t
= try_class_unification (tparms
, targs
,
8340 /* Fallback to the special case allowed in
8343 If P is a class, and P has the form
8344 template-id, then A can be a derived class of
8345 the deduced A. Likewise, if P is a pointer to
8346 a class of the form template-id, A can be a
8347 pointer to a derived class pointed to by the
8349 t
= get_template_base (tparms
, targs
,
8352 if (! t
|| t
== error_mark_node
)
8356 else if (CLASSTYPE_TEMPLATE_INFO (arg
)
8357 && (CLASSTYPE_TI_TEMPLATE (parm
)
8358 == CLASSTYPE_TI_TEMPLATE (arg
)))
8359 /* Perhaps PARM is something like S<U> and ARG is S<int>.
8360 Then, we should unify `int' and `U'. */
8363 /* There's no chance of unication succeeding. */
8366 return unify (tparms
, targs
, CLASSTYPE_TI_ARGS (parm
),
8367 CLASSTYPE_TI_ARGS (t
), UNIFY_ALLOW_NONE
);
8369 else if (!same_type_p (TYPE_MAIN_VARIANT (parm
),
8370 TYPE_MAIN_VARIANT (arg
)))
8376 if (TREE_CODE (arg
) != TREE_CODE (parm
))
8379 if (unify (tparms
, targs
, TREE_TYPE (parm
),
8380 TREE_TYPE (arg
), UNIFY_ALLOW_NONE
))
8382 return type_unification_real (tparms
, targs
, TYPE_ARG_TYPES (parm
),
8383 TYPE_ARG_TYPES (arg
), 1,
8387 if (TREE_CODE (arg
) != OFFSET_TYPE
)
8389 if (unify (tparms
, targs
, TYPE_OFFSET_BASETYPE (parm
),
8390 TYPE_OFFSET_BASETYPE (arg
), UNIFY_ALLOW_NONE
))
8392 return unify (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
8396 if (arg
!= decl_constant_value (parm
))
8401 /* Matched cases are handled by the ARG == PARM test above. */
8405 if (TREE_CODE (TREE_OPERAND (parm
, 1)) == INTEGER_CST
)
8407 /* We handle this case specially, since it comes up with
8408 arrays. In particular, something like:
8410 template <int N> void f(int (&x)[N]);
8412 Here, we are trying to unify the range type, which
8413 looks like [0 ... (N - 1)]. */
8415 t1
= TREE_OPERAND (parm
, 0);
8416 t2
= TREE_OPERAND (parm
, 1);
8418 /* Should this be a regular fold? */
8419 t
= maybe_fold_nontype_arg (build (PLUS_EXPR
,
8423 return unify (tparms
, targs
, t1
, t
, strict
);
8425 /* else fall through */
8428 if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (TREE_CODE (parm
))))
8429 /* We're looking at an expression. This can happen with
8433 void foo(S<I>, S<I + 2>);
8435 This is a "nondeduced context":
8439 The nondeduced contexts are:
8441 --A type that is a template-id in which one or more of
8442 the template-arguments is an expression that references
8443 a template-parameter.
8445 In these cases, we assume deduction succeeded, but don't
8446 actually infer any unifications. */
8449 sorry ("use of `%s' in template type unification",
8450 tree_code_name
[(int) TREE_CODE (parm
)]);
8456 /* Called if RESULT is explicitly instantiated, or is a member of an
8457 explicitly instantiated class, or if using -frepo and the
8458 instantiation of RESULT has been assigned to this file. */
8461 mark_decl_instantiated (result
, extern_p
)
8465 if (TREE_CODE (result
) != FUNCTION_DECL
)
8466 /* The TREE_PUBLIC flag for function declarations will have been
8467 set correctly by tsubst. */
8468 TREE_PUBLIC (result
) = 1;
8472 DECL_INTERFACE_KNOWN (result
) = 1;
8473 DECL_NOT_REALLY_EXTERN (result
) = 1;
8475 /* Always make artificials weak. */
8476 if (DECL_ARTIFICIAL (result
) && flag_weak
)
8477 comdat_linkage (result
);
8478 /* For WIN32 we also want to put explicit instantiations in
8479 linkonce sections. */
8480 else if (TREE_PUBLIC (result
))
8481 maybe_make_one_only (result
);
8483 else if (TREE_CODE (result
) == FUNCTION_DECL
)
8484 mark_inline_for_output (result
);
8487 /* Given two function templates PAT1 and PAT2, and explicit template
8488 arguments EXPLICIT_ARGS return:
8490 1 if PAT1 is more specialized than PAT2 as described in [temp.func.order].
8491 -1 if PAT2 is more specialized than PAT1.
8492 0 if neither is more specialized. */
8495 more_specialized (pat1
, pat2
, explicit_args
)
8496 tree pat1
, pat2
, explicit_args
;
8501 targs
= get_bindings_overload (pat1
, DECL_RESULT (pat2
), explicit_args
);
8505 targs
= get_bindings_overload (pat2
, DECL_RESULT (pat1
), explicit_args
);
8512 /* Given two class template specialization list nodes PAT1 and PAT2, return:
8514 1 if PAT1 is more specialized than PAT2 as described in [temp.class.order].
8515 -1 if PAT2 is more specialized than PAT1.
8516 0 if neither is more specialized. */
8519 more_specialized_class (pat1
, pat2
)
8525 targs
= get_class_bindings (TREE_VALUE (pat1
), TREE_PURPOSE (pat1
),
8526 TREE_PURPOSE (pat2
));
8530 targs
= get_class_bindings (TREE_VALUE (pat2
), TREE_PURPOSE (pat2
),
8531 TREE_PURPOSE (pat1
));
8538 /* Return the template arguments that will produce the function signature
8539 DECL from the function template FN, with the explicit template
8540 arguments EXPLICIT_ARGS. If CHECK_RETTYPE is 1, the return type must
8541 also match. Return NULL_TREE if no satisfactory arguments could be
8545 get_bindings_real (fn
, decl
, explicit_args
, check_rettype
)
8546 tree fn
, decl
, explicit_args
;
8549 int ntparms
= DECL_NTPARMS (fn
);
8550 tree targs
= make_scratch_vec (ntparms
);
8552 tree decl_arg_types
;
8555 /* Substitute the explicit template arguments into the type of DECL.
8556 The call to fn_type_unification will handle substitution into the
8558 decl_type
= TREE_TYPE (decl
);
8559 if (explicit_args
&& uses_template_parms (decl_type
))
8562 tree converted_args
;
8564 if (DECL_TEMPLATE_INFO (decl
))
8565 tmpl
= DECL_TI_TEMPLATE (decl
);
8567 /* We can get here for some illegal specializations. */
8571 = (coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (tmpl
),
8572 explicit_args
, NULL_TREE
,
8574 /*require_all_arguments=*/0));
8575 if (converted_args
== error_mark_node
)
8578 decl_type
= tsubst (decl_type
, converted_args
, /*complain=*/0,
8580 if (decl_type
== error_mark_node
)
8584 /* If FN is a static member function, adjust the type of DECL
8586 decl_arg_types
= TYPE_ARG_TYPES (decl_type
);
8587 if (DECL_STATIC_FUNCTION_P (fn
)
8588 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
8589 decl_arg_types
= TREE_CHAIN (decl_arg_types
);
8591 i
= fn_type_unification (fn
, explicit_args
, targs
,
8593 TREE_TYPE (decl_type
),
8601 /* Check to see that the resulting return type is also OK. */
8602 tree t
= tsubst (TREE_TYPE (TREE_TYPE (fn
)), targs
,
8603 /*complain=*/0, NULL_TREE
);
8605 if (!same_type_p (t
, TREE_TYPE (TREE_TYPE (decl
))))
8612 /* For most uses, we want to check the return type. */
8615 get_bindings (fn
, decl
, explicit_args
)
8616 tree fn
, decl
, explicit_args
;
8618 return get_bindings_real (fn
, decl
, explicit_args
, 1);
8621 /* But for more_specialized, we only care about the parameter types. */
8624 get_bindings_overload (fn
, decl
, explicit_args
)
8625 tree fn
, decl
, explicit_args
;
8627 return get_bindings_real (fn
, decl
, explicit_args
, 0);
8630 /* Return the innermost template arguments that, when applied to a
8631 template specialization whose innermost template parameters are
8632 TPARMS, and whose specialization arguments are ARGS, yield the
8635 For example, suppose we have:
8637 template <class T, class U> struct S {};
8638 template <class T> struct S<T*, int> {};
8640 Then, suppose we want to get `S<double*, int>'. The TPARMS will be
8641 {T}, the PARMS will be {T*, int} and the ARGS will be {double*,
8642 int}. The resulting vector will be {double}, indicating that `T'
8643 is bound to `double'. */
8646 get_class_bindings (tparms
, parms
, args
)
8647 tree tparms
, parms
, args
;
8649 int i
, ntparms
= TREE_VEC_LENGTH (tparms
);
8650 tree vec
= make_temp_vec (ntparms
);
8652 args
= innermost_args (args
);
8654 if (unify (tparms
, vec
, parms
, args
, UNIFY_ALLOW_NONE
))
8657 for (i
= 0; i
< ntparms
; ++i
)
8658 if (! TREE_VEC_ELT (vec
, i
))
8664 /* In INSTANTIATIONS is a list of <INSTANTIATION, TEMPLATE> pairs.
8665 Pick the most specialized template, and return the corresponding
8666 instantiation, or if there is no corresponding instantiation, the
8667 template itself. EXPLICIT_ARGS is any template arguments explicity
8668 mentioned in a template-id. If there is no most specialized
8669 tempalte, error_mark_node is returned. If there are no templates
8670 at all, NULL_TREE is returned. */
8673 most_specialized_instantiation (instantiations
, explicit_args
)
8674 tree instantiations
;
8680 if (!instantiations
)
8683 champ
= instantiations
;
8684 for (fn
= TREE_CHAIN (instantiations
); fn
; fn
= TREE_CHAIN (fn
))
8686 fate
= more_specialized (TREE_VALUE (champ
),
8687 TREE_VALUE (fn
), explicit_args
);
8694 fn
= TREE_CHAIN (fn
);
8696 return error_mark_node
;
8702 for (fn
= instantiations
; fn
&& fn
!= champ
; fn
= TREE_CHAIN (fn
))
8704 fate
= more_specialized (TREE_VALUE (champ
),
8705 TREE_VALUE (fn
), explicit_args
);
8707 return error_mark_node
;
8710 return TREE_PURPOSE (champ
) ? TREE_PURPOSE (champ
) : TREE_VALUE (champ
);
8713 /* Return the most specialized of the list of templates in FNS that can
8714 produce an instantiation matching DECL, given the explicit template
8715 arguments EXPLICIT_ARGS. */
8718 most_specialized (fns
, decl
, explicit_args
)
8719 tree fns
, decl
, explicit_args
;
8721 tree candidates
= NULL_TREE
;
8724 for (fn
= fns
; fn
; fn
= TREE_CHAIN (fn
))
8726 tree candidate
= TREE_VALUE (fn
);
8728 args
= get_bindings (candidate
, decl
, explicit_args
);
8730 candidates
= scratch_tree_cons (NULL_TREE
, candidate
,
8734 return most_specialized_instantiation (candidates
, explicit_args
);
8737 /* If DECL is a specialization of some template, return the most
8738 general such template. For example, given:
8740 template <class T> struct S { template <class U> void f(U); };
8742 if TMPL is `template <class U> void S<int>::f(U)' this will return
8743 the full template. This function will not trace past partial
8744 specializations, however. For example, given in addition:
8746 template <class T> struct S<T*> { template <class U> void f(U); };
8748 if TMPL is `template <class U> void S<int*>::f(U)' this will return
8749 `template <class T> template <class U> S<T*>::f(U)'. */
8752 most_general_template (decl
)
8755 while (DECL_TEMPLATE_INFO (decl
))
8756 decl
= DECL_TI_TEMPLATE (decl
);
8761 /* Return the most specialized of the class template specializations
8762 of TMPL which can produce an instantiation matching ARGS, or
8763 error_mark_node if the choice is ambiguous. */
8766 most_specialized_class (tmpl
, args
)
8770 tree list
= NULL_TREE
;
8775 tmpl
= most_general_template (tmpl
);
8776 for (t
= DECL_TEMPLATE_SPECIALIZATIONS (tmpl
); t
; t
= TREE_CHAIN (t
))
8779 = get_class_bindings (TREE_VALUE (t
), TREE_PURPOSE (t
), args
);
8782 list
= decl_tree_cons (TREE_PURPOSE (t
), TREE_VALUE (t
), list
);
8783 TREE_TYPE (list
) = TREE_TYPE (t
);
8793 for (; t
; t
= TREE_CHAIN (t
))
8795 fate
= more_specialized_class (champ
, t
);
8804 return error_mark_node
;
8810 for (t
= list
; t
&& t
!= champ
; t
= TREE_CHAIN (t
))
8812 fate
= more_specialized_class (champ
, t
);
8814 return error_mark_node
;
8820 /* called from the parser. */
8823 do_decl_instantiation (declspecs
, declarator
, storage
)
8824 tree declspecs
, declarator
, storage
;
8826 tree decl
= grokdeclarator (declarator
, declspecs
, NORMAL
, 0, NULL_TREE
);
8827 tree result
= NULL_TREE
;
8830 if (! DECL_LANG_SPECIFIC (decl
))
8832 cp_error ("explicit instantiation of non-template `%#D'", decl
);
8835 else if (TREE_CODE (decl
) == VAR_DECL
)
8837 /* There is an asymmetry here in the way VAR_DECLs and
8838 FUNCTION_DECLs are handled by grokdeclarator. In the case of
8839 the latter, the DECL we get back will be marked as a
8840 template instantiation, and the appropriate
8841 DECL_TEMPLATE_INFO will be set up. This does not happen for
8842 VAR_DECLs so we do the lookup here. Probably, grokdeclarator
8843 should handle VAR_DECLs as it currently handles
8845 result
= lookup_field (DECL_CONTEXT (decl
), DECL_NAME (decl
), 0, 0);
8846 if (result
&& TREE_CODE (result
) != VAR_DECL
)
8848 cp_error ("no matching template for `%D' found", result
);
8852 else if (TREE_CODE (decl
) != FUNCTION_DECL
)
8854 cp_error ("explicit instantiation of `%#D'", decl
);
8860 /* Check for various error cases. Note that if the explicit
8861 instantiation is legal the RESULT will currently be marked as an
8862 *implicit* instantiation; DECL_EXPLICIT_INSTANTIATION is not set
8863 until we get here. */
8865 if (DECL_TEMPLATE_SPECIALIZATION (result
))
8869 No program shall both explicitly instantiate and explicitly
8870 specialize a template. */
8871 cp_error ("explicit instantiation of `%#D' after", result
);
8872 cp_error_at ("explicit specialization here", result
);
8875 else if (DECL_EXPLICIT_INSTANTIATION (result
))
8879 No program shall explicitly instantiate any template more
8882 We check DECL_INTERFACE_KNOWN so as not to complain when the
8883 first instantiation was `extern' and the second is not, and
8884 EXTERN_P for the opposite case. */
8885 if (DECL_INTERFACE_KNOWN (result
) && !extern_p
)
8886 cp_error ("duplicate explicit instantiation of `%#D'", result
);
8888 /* If we've already instantiated the template, just return now. */
8889 if (DECL_INTERFACE_KNOWN (result
))
8892 else if (!DECL_IMPLICIT_INSTANTIATION (result
))
8894 cp_error ("no matching template for `%D' found", result
);
8897 else if (!DECL_TEMPLATE_INFO (result
))
8899 cp_pedwarn ("explicit instantiation of non-template `%#D'", result
);
8903 if (flag_external_templates
)
8906 if (storage
== NULL_TREE
)
8908 else if (storage
== ridpointers
[(int) RID_EXTERN
])
8911 cp_pedwarn ("ANSI C++ forbids the use of `extern' on explicit instantiations");
8915 cp_error ("storage class `%D' applied to template instantiation",
8918 SET_DECL_EXPLICIT_INSTANTIATION (result
);
8919 mark_decl_instantiated (result
, extern_p
);
8920 repo_template_instantiated (result
, extern_p
);
8922 instantiate_decl (result
);
8926 mark_class_instantiated (t
, extern_p
)
8930 SET_CLASSTYPE_EXPLICIT_INSTANTIATION (t
);
8931 SET_CLASSTYPE_INTERFACE_KNOWN (t
);
8932 CLASSTYPE_INTERFACE_ONLY (t
) = extern_p
;
8933 CLASSTYPE_VTABLE_NEEDS_WRITING (t
) = ! extern_p
;
8934 TYPE_DECL_SUPPRESS_DEBUG (TYPE_NAME (t
)) = extern_p
;
8937 CLASSTYPE_DEBUG_REQUESTED (t
) = 1;
8938 rest_of_type_compilation (t
, 1);
8943 do_type_instantiation (t
, storage
)
8950 if (TREE_CODE (t
) == TYPE_DECL
)
8953 if (! CLASS_TYPE_P (t
) || ! CLASSTYPE_TEMPLATE_INFO (t
))
8955 cp_error ("explicit instantiation of non-template type `%T'", t
);
8961 /* With -fexternal-templates, explicit instantiations are treated the same
8962 as implicit ones. */
8963 if (flag_external_templates
)
8966 if (TYPE_SIZE (t
) == NULL_TREE
)
8968 cp_error ("explicit instantiation of `%#T' before definition of template",
8973 if (storage
!= NULL_TREE
)
8976 cp_pedwarn("ANSI C++ forbids the use of `%s' on explicit instantiations",
8977 IDENTIFIER_POINTER (storage
));
8979 if (storage
== ridpointers
[(int) RID_INLINE
])
8981 else if (storage
== ridpointers
[(int) RID_EXTERN
])
8983 else if (storage
== ridpointers
[(int) RID_STATIC
])
8987 cp_error ("storage class `%D' applied to template instantiation",
8993 if (CLASSTYPE_TEMPLATE_SPECIALIZATION (t
))
8997 No program shall both explicitly instantiate and explicitly
8998 specialize a template. */
8999 cp_error ("explicit instantiation of `%#T' after", t
);
9000 cp_error_at ("explicit specialization here", t
);
9003 else if (CLASSTYPE_EXPLICIT_INSTANTIATION (t
))
9007 No program shall explicitly instantiate any template more
9010 If CLASSTYPE_INTERFACE_ONLY, then the first explicit
9011 instantiation was `extern', and if EXTERN_P then the second
9012 is. Both cases are OK. */
9013 if (!CLASSTYPE_INTERFACE_ONLY (t
) && !extern_p
)
9014 cp_error ("duplicate explicit instantiation of `%#T'", t
);
9016 /* If we've already instantiated the template, just return now. */
9017 if (!CLASSTYPE_INTERFACE_ONLY (t
))
9021 mark_class_instantiated (t
, extern_p
);
9022 repo_template_instantiated (t
, extern_p
);
9030 /* In contrast to implicit instantiation, where only the
9031 declarations, and not the definitions, of members are
9032 instantiated, we have here:
9036 The explicit instantiation of a class template specialization
9037 implies the instantiation of all of its members not
9038 previously explicitly specialized in the translation unit
9039 containing the explicit instantiation.
9041 Of course, we can't instantiate member template classes, since
9042 we don't have any arguments for them. Note that the standard
9043 is unclear on whether the instatiation of the members are
9044 *explicit* instantiations or not. We choose to be generous,
9045 and not set DECL_EXPLICIT_INSTANTIATION. Therefore, we allow
9046 the explicit instantiation of a class where some of the members
9047 have no definition in the current translation unit. */
9050 for (tmp
= TYPE_METHODS (t
); tmp
; tmp
= TREE_CHAIN (tmp
))
9051 if (TREE_CODE (tmp
) == FUNCTION_DECL
9052 && DECL_TEMPLATE_INSTANTIATION (tmp
))
9054 mark_decl_instantiated (tmp
, extern_p
);
9055 repo_template_instantiated (tmp
, extern_p
);
9057 instantiate_decl (tmp
);
9060 for (tmp
= TYPE_FIELDS (t
); tmp
; tmp
= TREE_CHAIN (tmp
))
9061 if (TREE_CODE (tmp
) == VAR_DECL
&& DECL_TEMPLATE_INSTANTIATION (tmp
))
9063 mark_decl_instantiated (tmp
, extern_p
);
9064 repo_template_instantiated (tmp
, extern_p
);
9066 instantiate_decl (tmp
);
9069 for (tmp
= CLASSTYPE_TAGS (t
); tmp
; tmp
= TREE_CHAIN (tmp
))
9070 if (IS_AGGR_TYPE (TREE_VALUE (tmp
))
9071 && !uses_template_parms (CLASSTYPE_TI_ARGS (TREE_VALUE (tmp
))))
9072 do_type_instantiation (TYPE_MAIN_DECL (TREE_VALUE (tmp
)), storage
);
9076 /* Given a function DECL, which is a specialization of TMPL, modify
9077 DECL to be a re-instantiation of TMPL with the same template
9078 arguments. TMPL should be the template into which tsubst'ing
9079 should occur for DECL, not the most general template.
9081 One reason for doing this is a scenario like this:
9084 void f(const T&, int i);
9086 void g() { f(3, 7); }
9089 void f(const T& t, const int i) { }
9091 Note that when the template is first instantiated, with
9092 instantiate_template, the resulting DECL will have no name for the
9093 first parameter, and the wrong type for the second. So, when we go
9094 to instantiate the DECL, we regenerate it. */
9097 regenerate_decl_from_template (decl
, tmpl
)
9107 args
= DECL_TI_ARGS (decl
);
9108 code_pattern
= DECL_TEMPLATE_RESULT (tmpl
);
9110 /* Unregister the specialization so that when we tsubst we will not
9111 just return DECL. We don't have to unregister DECL from TMPL
9112 because if would only be registered there if it were a partial
9113 instantiation of a specialization, which it isn't: it's a full
9115 gen_tmpl
= most_general_template (tmpl
);
9116 unregistered
= unregister_specialization (decl
, gen_tmpl
);
9118 /* If the DECL was not unregistered then something peculiar is
9119 happening: we created a specialization but did not call
9120 register_specialization for it. */
9121 my_friendly_assert (unregistered
, 0);
9123 if (TREE_CODE (decl
) == VAR_DECL
)
9124 /* Make sure that we can see identifiers, and compute access
9125 correctly, for the class members used in the declaration of
9126 this static variable. */
9127 pushclass (DECL_CONTEXT (decl
), 2);
9129 /* Do the substitution to get the new declaration. */
9130 new_decl
= tsubst (code_pattern
, args
, /*complain=*/1, NULL_TREE
);
9132 if (TREE_CODE (decl
) == VAR_DECL
)
9134 /* Set up DECL_INITIAL, since tsubst doesn't. */
9135 DECL_INITIAL (new_decl
) =
9136 tsubst_expr (DECL_INITIAL (code_pattern
), args
,
9137 /*complain=*/1, DECL_TI_TEMPLATE (decl
));
9138 /* Pop the class context we pushed above. */
9141 else if (TREE_CODE (decl
) == FUNCTION_DECL
)
9143 /* Convince duplicate_decls to use the DECL_ARGUMENTS from the
9145 DECL_INITIAL (new_decl
) = error_mark_node
;
9146 /* And don't complain about a duplicate definition. */
9147 DECL_INITIAL (decl
) = NULL_TREE
;
9150 /* The immediate parent of the new template is still whatever it was
9151 before, even though tsubst sets DECL_TI_TEMPLATE up as the most
9152 general template. We also reset the DECL_ASSEMBLER_NAME since
9153 tsubst always calculates the name as if the function in question
9154 were really a template instance, and sometimes, with friend
9155 functions, this is not so. See tsubst_friend_function for
9157 DECL_TI_TEMPLATE (new_decl
) = DECL_TI_TEMPLATE (decl
);
9158 DECL_ASSEMBLER_NAME (new_decl
) = DECL_ASSEMBLER_NAME (decl
);
9159 DECL_RTL (new_decl
) = DECL_RTL (decl
);
9161 /* Call duplicate decls to merge the old and new declarations. */
9162 duplicate_decls (new_decl
, decl
);
9164 /* Now, re-register the specialization. */
9165 register_specialization (decl
, gen_tmpl
, args
);
9168 /* Produce the definition of D, a _DECL generated from a template. */
9171 instantiate_decl (d
)
9174 tree tmpl
= DECL_TI_TEMPLATE (d
);
9175 tree args
= DECL_TI_ARGS (d
);
9180 int nested
= in_function_p ();
9181 int pattern_defined
;
9183 char *file
= input_filename
;
9185 /* This function should only be used to instantiate templates for
9186 functions and static member variables. */
9187 my_friendly_assert (TREE_CODE (d
) == FUNCTION_DECL
9188 || TREE_CODE (d
) == VAR_DECL
, 0);
9190 if (DECL_TEMPLATE_INSTANTIATED (d
))
9191 /* D has already been instantiated. It might seem reasonable to
9192 check whether or not D is an explict instantiation, and, if so,
9193 stop here. But when an explicit instantiation is deferred
9194 until the end of the compilation, DECL_EXPLICIT_INSTANTIATION
9195 is set, even though we still need to do the instantiation. */
9198 /* If we already have a specialization of this declaration, then
9199 there's no reason to instantiate it. Note that
9200 retrieve_specialization gives us both instantiations and
9201 specializations, so we must explicitly check
9202 DECL_TEMPLATE_SPECIALIZATION. */
9203 gen_tmpl
= most_general_template (tmpl
);
9204 spec
= retrieve_specialization (gen_tmpl
, args
);
9205 if (spec
!= NULL_TREE
&& DECL_TEMPLATE_SPECIALIZATION (spec
))
9208 /* This needs to happen before any tsubsting. */
9209 if (! push_tinst_level (d
))
9212 /* Set TD to the template whose DECL_TEMPLATE_RESULT is the pattern
9213 for the instantiation. This is not always the most general
9214 template. Consider, for example:
9217 struct S { template <class U> void f();
9218 template <> void f<int>(); };
9220 and an instantiation of S<double>::f<int>. We want TD to be the
9221 specialization S<T>::f<int>, not the more general S<T>::f<U>. */
9224 /* An instantiation cannot have a definition, so we need a
9225 more general template. */
9226 DECL_TEMPLATE_INSTANTIATION (td
)
9227 /* We must also deal with friend templates. Given:
9229 template <class T> struct S {
9230 template <class U> friend void f() {};
9233 S<int>::f<U> say, is not an instantiation of S<T>::f<U>,
9234 so far as the language is concerned, but that's still
9235 where we get the pattern for the instantiation from. On
9236 ther hand, if the definition comes outside the class, say:
9238 template <class T> struct S {
9239 template <class U> friend void f();
9241 template <class U> friend void f() {}
9243 we don't need to look any further. That's what the check for
9244 DECL_INITIAL is for. */
9245 || (TREE_CODE (d
) == FUNCTION_DECL
9246 && DECL_FRIEND_PSEUDO_TEMPLATE_INSTANTIATION (td
)
9247 && !DECL_INITIAL (DECL_TEMPLATE_RESULT (td
)));
9250 /* The present template, TD, should not be a definition. If it
9251 were a definition, we should be using it! Note that we
9252 cannot restructure the loop to just keep going until we find
9253 a template with a definition, since that might go too far if
9254 a specialization was declared, but not defined. */
9255 my_friendly_assert (!(TREE_CODE (d
) == VAR_DECL
9256 && !DECL_IN_AGGR_P (DECL_TEMPLATE_RESULT (td
))),
9259 /* Fetch the more general template. */
9260 td
= DECL_TI_TEMPLATE (td
);
9263 code_pattern
= DECL_TEMPLATE_RESULT (td
);
9265 if (TREE_CODE (d
) == FUNCTION_DECL
)
9266 pattern_defined
= (DECL_INITIAL (code_pattern
) != NULL_TREE
);
9268 pattern_defined
= ! DECL_IN_AGGR_P (code_pattern
);
9270 push_to_top_level ();
9271 lineno
= DECL_SOURCE_LINE (d
);
9272 input_filename
= DECL_SOURCE_FILE (d
);
9274 if (pattern_defined
)
9276 repo_template_used (d
);
9278 if (flag_external_templates
&& ! DECL_INTERFACE_KNOWN (d
))
9280 if (flag_alt_external_templates
)
9282 if (interface_unknown
)
9283 warn_if_unknown_interface (d
);
9285 else if (DECL_INTERFACE_KNOWN (code_pattern
))
9287 DECL_INTERFACE_KNOWN (d
) = 1;
9288 DECL_NOT_REALLY_EXTERN (d
) = ! DECL_EXTERNAL (code_pattern
);
9291 warn_if_unknown_interface (code_pattern
);
9295 import_export_decl (d
);
9298 /* Reject all external templates except inline functions. */
9299 if (DECL_INTERFACE_KNOWN (d
)
9300 && ! DECL_NOT_REALLY_EXTERN (d
)
9301 && ! (TREE_CODE (d
) == FUNCTION_DECL
&& DECL_INLINE (d
)))
9304 if (TREE_CODE (d
) == VAR_DECL
9305 && TREE_READONLY (d
)
9306 && DECL_INITIAL (d
) == NULL_TREE
9307 && DECL_INITIAL (code_pattern
) != NULL_TREE
)
9308 /* We need to set up DECL_INITIAL regardless of pattern_defined if
9309 the variable is a static const initialized in the class body. */;
9310 else if (! pattern_defined
9311 || (! (TREE_CODE (d
) == FUNCTION_DECL
&& DECL_INLINE (d
) && nested
)
9314 /* Defer all templates except inline functions used in another
9315 function. We restore the source position here because it's used
9316 by add_pending_template. */
9318 input_filename
= file
;
9320 if (at_eof
&& !pattern_defined
9321 && DECL_EXPLICIT_INSTANTIATION (d
))
9324 The definition of a non-exported function template, a
9325 non-exported member function template, or a non-exported
9326 member function or static data member of a class template
9327 shall be present in every translation unit in which it is
9328 explicitly instantiated. */
9329 cp_error ("explicit instantiation of `%D' but no definition available",
9332 add_pending_template (d
);
9336 /* We're now committed to instantiating this template. Mark it as
9337 instantiated so that recursive calls to instantiate_decl do not
9338 try to instantiate it again. */
9339 DECL_TEMPLATE_INSTANTIATED (d
) = 1;
9341 /* Regenerate the declaration in case the template has been modified
9342 by a subsequent redeclaration. */
9343 regenerate_decl_from_template (d
, td
);
9345 /* We already set the file and line above. Reset them now in case
9346 they changed as a result of calling regenerate_decl_from_template. */
9347 lineno
= DECL_SOURCE_LINE (d
);
9348 input_filename
= DECL_SOURCE_FILE (d
);
9350 if (TREE_CODE (d
) == VAR_DECL
)
9352 DECL_IN_AGGR_P (d
) = 0;
9353 if (DECL_INTERFACE_KNOWN (d
))
9354 DECL_EXTERNAL (d
) = ! DECL_NOT_REALLY_EXTERN (d
);
9357 DECL_EXTERNAL (d
) = 1;
9358 DECL_NOT_REALLY_EXTERN (d
) = 1;
9360 cp_finish_decl (d
, DECL_INITIAL (d
), NULL_TREE
, 0, 0);
9362 else if (TREE_CODE (d
) == FUNCTION_DECL
)
9364 tree t
= DECL_SAVED_TREE (code_pattern
);
9366 start_function (NULL_TREE
, d
, NULL_TREE
, 1);
9367 store_parm_decls ();
9369 if (t
&& TREE_CODE (t
) == RETURN_INIT
)
9372 (TREE_OPERAND (t
, 0),
9373 tsubst_expr (TREE_OPERAND (t
, 1), args
, /*complain=*/1, tmpl
));
9377 if (t
&& TREE_CODE (t
) == CTOR_INITIALIZER
)
9379 current_member_init_list
9380 = tsubst_expr_values (TREE_OPERAND (t
, 0), args
);
9381 current_base_init_list
9382 = tsubst_expr_values (TREE_OPERAND (t
, 1), args
);
9387 /* Always keep the BLOCK node associated with the outermost
9388 pair of curly braces of a function. These are needed
9389 for correct operation of dwarfout.c. */
9392 my_friendly_assert (TREE_CODE (t
) == COMPOUND_STMT
, 42);
9393 tsubst_expr (t
, args
, /*complain=*/1, tmpl
);
9395 finish_function (lineno
, 0, nested
);
9400 input_filename
= file
;
9402 pop_from_top_level ();
9408 /* Substitute ARGVEC into T, which is a TREE_LIST. In particular, it
9409 is an initializer list: the TREE_PURPOSEs are DECLs, and the
9410 TREE_VALUEs are initializer values. Used by instantiate_decl. */
9413 tsubst_expr_values (t
, argvec
)
9416 tree first
= NULL_TREE
;
9419 for (; t
; t
= TREE_CHAIN (t
))
9421 tree pur
= tsubst_copy (TREE_PURPOSE (t
), argvec
,
9422 /*complain=*/1, NULL_TREE
);
9423 tree val
= tsubst_expr (TREE_VALUE (t
), argvec
, /*complain=*/1,
9425 *p
= build_tree_list (pur
, val
);
9426 p
= &TREE_CHAIN (*p
);
9437 last_tree
= TREE_CHAIN (last_tree
) = t
;
9444 saved_trees
= tree_cons (NULL_TREE
, last_tree
, saved_trees
);
9445 last_tree
= NULL_TREE
;
9452 my_friendly_assert (saved_trees
!= NULL_TREE
, 0);
9454 last_tree
= TREE_VALUE (saved_trees
);
9455 saved_trees
= TREE_CHAIN (saved_trees
);
9458 /* D is an undefined function declaration in the presence of templates with
9459 the same name, listed in FNS. If one of them can produce D as an
9460 instantiation, remember this so we can instantiate it at EOF if D has
9461 not been defined by that time. */
9464 add_maybe_template (d
, fns
)
9469 if (DECL_MAYBE_TEMPLATE (d
))
9472 t
= most_specialized (fns
, d
, NULL_TREE
);
9475 if (t
== error_mark_node
)
9477 cp_error ("ambiguous template instantiation for `%D'", d
);
9481 *maybe_template_tail
= perm_tree_cons (t
, d
, NULL_TREE
);
9482 maybe_template_tail
= &TREE_CHAIN (*maybe_template_tail
);
9483 DECL_MAYBE_TEMPLATE (d
) = 1;
9486 /* Set CURRENT_ACCESS_SPECIFIER based on the protection of DECL. */
9489 set_current_access_from_decl (decl
)
9492 if (TREE_PRIVATE (decl
))
9493 current_access_specifier
= access_private_node
;
9494 else if (TREE_PROTECTED (decl
))
9495 current_access_specifier
= access_protected_node
;
9497 current_access_specifier
= access_public_node
;
9500 /* Instantiate an enumerated type. TAG is the template type, NEWTAG
9501 is the instantiation (which should have been created with
9502 start_enum) and ARGS are the template arguments to use. */
9505 tsubst_enum (tag
, newtag
, args
)
9512 for (e
= TYPE_VALUES (tag
); e
; e
= TREE_CHAIN (e
))
9517 /* Note that in a template enum, the TREE_VALUE is the
9518 CONST_DECL, not the corresponding INTEGER_CST. */
9519 value
= tsubst_expr (DECL_INITIAL (TREE_VALUE (e
)),
9520 args
, /*complain=*/1,
9523 /* Give this enumeration constant the correct access. */
9524 set_current_access_from_decl (TREE_VALUE (e
));
9526 /* Actually build the enumerator itself. */
9527 elt
= build_enumerator (TREE_PURPOSE (e
), value
, newtag
);
9529 /* We save the enumerators we have built so far in the
9530 TYPE_VALUES so that if the enumeration constants for
9531 subsequent enumerators involve those for previous ones,
9532 tsubst_copy will be able to find them. */
9533 TREE_CHAIN (elt
) = TYPE_VALUES (newtag
);
9534 TYPE_VALUES (newtag
) = elt
;
9537 finish_enum (newtag
);
9540 /* Set the DECL_ASSEMBLER_NAME for DECL, which is a FUNCTION_DECL that
9541 is either an instantiation or specialization of a template
9545 set_mangled_name_for_template_decl (decl
)
9548 tree saved_namespace
;
9549 tree context
= NULL_TREE
;
9558 my_friendly_assert (TREE_CODE (decl
) == FUNCTION_DECL
, 0);
9559 my_friendly_assert (DECL_TEMPLATE_INFO (decl
) != NULL_TREE
, 0);
9561 /* The names of template functions must be mangled so as to indicate
9562 what template is being specialized with what template arguments.
9563 For example, each of the following three functions must get
9564 different mangled names:
9567 template <> void f<7>(int);
9568 template <> void f<8>(int); */
9570 targs
= DECL_TI_ARGS (decl
);
9571 if (uses_template_parms (targs
))
9572 /* This DECL is for a partial instantiation. There's no need to
9573 mangle the name of such an entity. */
9576 tmpl
= most_general_template (DECL_TI_TEMPLATE (decl
));
9577 tparms
= DECL_TEMPLATE_PARMS (tmpl
);
9578 parm_depth
= TMPL_PARMS_DEPTH (tparms
);
9580 /* There should be as many levels of arguments as there are levels
9582 my_friendly_assert (parm_depth
== TMPL_ARGS_DEPTH (targs
), 0);
9584 /* We now compute the PARMS and RET_TYPE to give to
9585 build_decl_overload_real. The PARMS and RET_TYPE are the
9586 parameter and return types of the template, after all but the
9587 innermost template arguments have been substituted, not the
9588 parameter and return types of the function DECL. For example,
9591 template <class T> T f(T);
9593 both PARMS and RET_TYPE should be `T' even if DECL is `int f(int)'.
9594 A more subtle example is:
9596 template <class T> struct S { template <class U> void f(T, U); }
9598 Here, if DECL is `void S<int>::f(int, double)', PARMS should be
9599 {int, U}. Thus, the args that we want to subsitute into the
9600 return and parameter type for the function are those in TARGS,
9601 with the innermost level omitted. */
9602 fn_type
= TREE_TYPE (tmpl
);
9603 if (DECL_STATIC_FUNCTION_P (decl
))
9604 context
= DECL_CLASS_CONTEXT (decl
);
9606 if (parm_depth
== 1)
9607 /* No substitution is necessary. */
9614 /* Replace the innermost level of the TARGS with NULL_TREEs to
9615 let tsubst know not to subsitute for those parameters. */
9616 partial_args
= make_temp_vec (TREE_VEC_LENGTH (targs
));
9617 for (i
= 1; i
< TMPL_ARGS_DEPTH (targs
); ++i
)
9618 SET_TMPL_ARGS_LEVEL (partial_args
, i
,
9619 TMPL_ARGS_LEVEL (targs
, i
));
9620 SET_TMPL_ARGS_LEVEL (partial_args
,
9621 TMPL_ARGS_DEPTH (targs
),
9622 make_temp_vec (DECL_NTPARMS (tmpl
)));
9624 /* Now, do the (partial) substitution to figure out the
9625 appropriate function type. */
9626 fn_type
= tsubst (fn_type
, partial_args
, /*complain=*/1, NULL_TREE
);
9627 if (DECL_STATIC_FUNCTION_P (decl
))
9628 context
= tsubst (context
, partial_args
, /*complain=*/1, NULL_TREE
);
9630 /* Substitute into the template parameters to obtain the real
9631 innermost set of parameters. This step is important if the
9632 innermost set of template parameters contains value
9633 parameters whose types depend on outer template parameters. */
9634 TREE_VEC_LENGTH (partial_args
)--;
9635 tparms
= tsubst_template_parms (tparms
, partial_args
, /*complain=*/1);
9638 /* Now, get the innermost parameters and arguments, and figure out
9639 the parameter and return types. */
9640 tparms
= INNERMOST_TEMPLATE_PARMS (tparms
);
9641 targs
= innermost_args (targs
);
9642 ret_type
= TREE_TYPE (fn_type
);
9643 parm_types
= TYPE_ARG_TYPES (fn_type
);
9645 /* For a static member function, we generate a fake `this' pointer,
9646 for the purposes of mangling. This indicates of which class the
9647 function is a member. Because of:
9651 There shall not be a static and a nonstatic member function
9652 with the same name and the same parameter types
9654 we don't have to worry that this will result in a clash with a
9655 non-static member function. */
9656 if (DECL_STATIC_FUNCTION_P (decl
))
9657 parm_types
= hash_tree_chain (build_pointer_type (context
), parm_types
);
9659 /* There should be the same number of template parameters as
9660 template arguments. */
9661 my_friendly_assert (TREE_VEC_LENGTH (tparms
) == TREE_VEC_LENGTH (targs
),
9664 /* If the template is in a namespace, we need to put that into the
9665 mangled name. Unfortunately, build_decl_overload_real does not
9666 get the decl to mangle, so it relies on the current
9667 namespace. Therefore, we set that here temporarily. */
9668 my_friendly_assert (TREE_CODE_CLASS (TREE_CODE (decl
)) == 'd', 980702);
9669 saved_namespace
= current_namespace
;
9670 current_namespace
= CP_DECL_CONTEXT (decl
);
9672 /* Actually set the DCL_ASSEMBLER_NAME. */
9673 DECL_ASSEMBLER_NAME (decl
)
9674 = build_decl_overload_real (DECL_NAME (decl
), parm_types
, ret_type
,
9676 DECL_FUNCTION_MEMBER_P (decl
)
9677 + DECL_CONSTRUCTOR_P (decl
));
9679 /* Restore the previously active namespace. */
9680 current_namespace
= saved_namespace
;