1 /* Handle parameterized types (templates) for GNU C++.
2 Copyright (C) 1992, 93, 94, 95, 96, 1997 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
79 static int unify
PROTO((tree
, tree
, tree
, tree
, int, int*));
80 static int resolve_overloaded_unification
PROTO((tree
, tree
, tree
, tree
,
81 unification_kind_t
, int,
83 static int try_one_overload
PROTO((tree
, tree
, tree
, tree
,
84 unification_kind_t
, int, int*));
85 static int unify
PROTO((tree
, tree
, tree
, tree
, int, int*));
86 static void add_pending_template
PROTO((tree
));
87 static int push_tinst_level
PROTO((tree
));
88 static tree classtype_mangled_name
PROTO((tree
));
89 static char *mangle_class_name_for_template
PROTO((char *, tree
, tree
));
90 static tree tsubst_expr_values
PROTO((tree
, tree
));
91 static int list_eq
PROTO((tree
, tree
));
92 static tree get_class_bindings
PROTO((tree
, tree
, tree
));
93 static tree coerce_template_parms
PROTO((tree
, tree
, tree
, int, int));
94 static void tsubst_enum
PROTO((tree
, tree
, tree
));
95 static tree add_to_template_args
PROTO((tree
, tree
));
96 static tree add_outermost_template_args
PROTO((tree
, tree
));
97 static void maybe_adjust_types_for_deduction
PROTO((unification_kind_t
, tree
*,
99 static int type_unification_real
PROTO((tree
, tree
, tree
, tree
,
100 int, unification_kind_t
, int, int*));
101 static void note_template_header
PROTO((int));
102 static tree maybe_fold_nontype_arg
PROTO((tree
));
103 static tree convert_nontype_argument
PROTO((tree
, tree
));
104 static tree convert_template_argument
PROTO ((tree
, tree
, tree
, int,
106 static tree get_bindings_overload
PROTO((tree
, tree
, tree
));
107 static int for_each_template_parm
PROTO((tree
, tree_fn_t
, void*));
108 static tree build_template_parm_index
PROTO((int, int, int, tree
, tree
));
109 static int inline_needs_template_parms
PROTO((tree
));
110 static void push_inline_template_parms_recursive
PROTO((tree
, int));
111 static tree retrieve_specialization
PROTO((tree
, tree
));
112 static tree register_specialization
PROTO((tree
, tree
, tree
));
113 static int unregister_specialization
PROTO((tree
, tree
));
114 static void print_candidates
PROTO((tree
));
115 static tree reduce_template_parm_level
PROTO((tree
, tree
, int));
116 static tree build_template_decl
PROTO((tree
, tree
));
117 static int mark_template_parm
PROTO((tree
, void *));
118 static tree tsubst_friend_function
PROTO((tree
, tree
));
119 static tree tsubst_friend_class
PROTO((tree
, tree
));
120 static tree get_bindings_real
PROTO((tree
, tree
, tree
, int));
121 static int template_decl_level
PROTO((tree
));
122 static tree maybe_get_template_decl_from_type_decl
PROTO((tree
));
123 static int check_cv_quals_for_unify
PROTO((int, tree
, tree
));
124 static tree tsubst_template_arg_vector
PROTO((tree
, tree
));
125 static tree tsubst_template_parms
PROTO((tree
, tree
));
126 static void regenerate_decl_from_template
PROTO((tree
, tree
));
127 static int is_member_template_class
PROTO((tree
));
128 static tree most_specialized
PROTO((tree
, tree
, tree
));
129 static tree most_specialized_class
PROTO((tree
, tree
));
130 static tree most_general_template
PROTO((tree
));
131 static void set_mangled_name_for_template_decl
PROTO((tree
));
132 static int template_class_depth_real
PROTO((tree
, int));
133 static tree tsubst_aggr_type
PROTO((tree
, tree
, tree
, int));
134 static tree tsubst_decl
PROTO((tree
, tree
, tree
, tree
));
135 static tree tsubst_arg_types
PROTO((tree
, tree
, tree
));
136 static void check_specialization_scope
PROTO((void));
137 static tree process_partial_specialization
PROTO((tree
));
138 static void set_current_access_from_decl
PROTO((tree
));
140 /* We use TREE_VECs to hold template arguments. If there is only one
141 level of template arguments, then the TREE_VEC contains the
142 arguments directly. If there is more than one level of template
143 arguments, then each entry in the TREE_VEC is itself a TREE_VEC,
144 containing the template arguments for a single level. The first
145 entry in the outer TREE_VEC is the outermost level of template
146 parameters; the last is the innermost.
148 It is incorrect to ever form a template argument vector containing
149 only one level of arguments, but which is a TREE_VEC containing as
150 its only entry the TREE_VEC for that level. */
152 /* Non-zero if the template arguments is actually a vector of vectors,
153 rather than just a vector. */
154 #define TMPL_ARGS_HAVE_MULTIPLE_LEVELS(NODE) \
156 && TREE_CODE (NODE) == TREE_VEC \
157 && TREE_VEC_LENGTH (NODE) > 0 \
158 && TREE_VEC_ELT (NODE, 0) != NULL_TREE \
159 && TREE_CODE (TREE_VEC_ELT (NODE, 0)) == TREE_VEC)
161 /* The depth of a template argument vector. When called directly by
162 the parser, we use a TREE_LIST rather than a TREE_VEC to represent
163 template arguments. In fact, we may even see NULL_TREE if there
164 are no template arguments. In both of those cases, there is only
165 one level of template arguments. */
166 #define TMPL_ARGS_DEPTH(NODE) \
167 (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (NODE) ? TREE_VEC_LENGTH (NODE) : 1)
169 /* The LEVELth level of the template ARGS. Note that template
170 parameter levels are indexed from 1, not from 0. */
171 #define TMPL_ARGS_LEVEL(ARGS, LEVEL) \
172 (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (ARGS) \
173 ? TREE_VEC_ELT ((ARGS), (LEVEL) - 1) : ARGS)
175 /* Set the LEVELth level of the template ARGS to VAL. This macro does
176 not work with single-level argument vectors. */
177 #define SET_TMPL_ARGS_LEVEL(ARGS, LEVEL, VAL) \
178 (TREE_VEC_ELT ((ARGS), (LEVEL) - 1) = (VAL))
180 /* Accesses the IDXth parameter in the LEVELth level of the ARGS. */
181 #define TMPL_ARG(ARGS, LEVEL, IDX) \
182 (TREE_VEC_ELT (TMPL_ARGS_LEVEL (ARGS, LEVEL), IDX))
184 /* Set the IDXth element in the LEVELth level of ARGS to VAL. This
185 macro does not work with single-level argument vectors. */
186 #define SET_TMPL_ARG(ARGS, LEVEL, IDX, VAL) \
187 (TREE_VEC_ELT (TREE_VEC_ELT ((ARGS), (LEVEL) - 1), (IDX)) = (VAL))
189 /* Given a single level of template arguments in NODE, return the
190 number of arguments. */
191 #define NUM_TMPL_ARGS(NODE) \
192 ((NODE) == NULL_TREE ? 0 \
193 : (TREE_CODE (NODE) == TREE_VEC \
194 ? TREE_VEC_LENGTH (NODE) : list_length (NODE)))
196 /* The number of levels of template parameters given by NODE. */
197 #define TMPL_PARMS_DEPTH(NODE) \
198 (TREE_INT_CST_HIGH (TREE_PURPOSE (NODE)))
200 /* Do any processing required when DECL (a member template declaration
201 using TEMPLATE_PARAMETERS as its innermost parameter list) is
202 finished. Returns the TEMPLATE_DECL corresponding to DECL, unless
203 it is a specialization, in which case the DECL itself is returned. */
206 finish_member_template_decl (decl
)
209 if (decl
== NULL_TREE
|| decl
== void_type_node
)
211 else if (decl
== error_mark_node
)
212 /* By returning NULL_TREE, the parser will just ignore this
213 declaration. We have already issued the error. */
215 else if (TREE_CODE (decl
) == TREE_LIST
)
217 /* Assume that the class is the only declspec. */
218 decl
= TREE_VALUE (decl
);
219 if (IS_AGGR_TYPE (decl
) && CLASSTYPE_TEMPLATE_INFO (decl
)
220 && ! CLASSTYPE_TEMPLATE_SPECIALIZATION (decl
))
222 tree tmpl
= CLASSTYPE_TI_TEMPLATE (decl
);
223 check_member_template (tmpl
);
228 else if (DECL_TEMPLATE_INFO (decl
))
230 if (!DECL_TEMPLATE_SPECIALIZATION (decl
))
232 check_member_template (DECL_TI_TEMPLATE (decl
));
233 return DECL_TI_TEMPLATE (decl
);
239 cp_error ("invalid member template declaration `%D'", decl
);
241 return error_mark_node
;
244 /* Returns the template nesting level of the indicated class TYPE.
254 A<T>::B<U> has depth two, while A<T> has depth one.
255 Both A<T>::B<int> and A<int>::B<U> have depth one, if
256 COUNT_SPECIALIZATIONS is 0 or if they are instantiations, not
259 This function is guaranteed to return 0 if passed NULL_TREE so
260 that, for example, `template_class_depth (current_class_type)' is
264 template_class_depth_real (type
, count_specializations
)
266 int count_specializations
;
271 type
&& TREE_CODE (type
) != NAMESPACE_DECL
;
272 type
= (TREE_CODE (type
) == FUNCTION_DECL
)
273 ? DECL_REAL_CONTEXT (type
) : TYPE_CONTEXT (type
))
275 if (TREE_CODE (type
) != FUNCTION_DECL
)
277 if (CLASSTYPE_TEMPLATE_INFO (type
)
278 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (type
))
279 && ((count_specializations
280 && CLASSTYPE_TEMPLATE_SPECIALIZATION (type
))
281 || uses_template_parms (CLASSTYPE_TI_ARGS (type
))))
286 if (DECL_TEMPLATE_INFO (type
)
287 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (type
))
288 && ((count_specializations
289 && DECL_TEMPLATE_SPECIALIZATION (type
))
290 || uses_template_parms (DECL_TI_ARGS (type
))))
298 /* Returns the template nesting level of the indicated class TYPE.
299 Like template_class_depth_real, but instantiations do not count in
303 template_class_depth (type
)
306 return template_class_depth_real (type
, /*count_specializations=*/0);
309 /* Returns 1 if processing DECL as part of do_pending_inlines
310 needs us to push template parms. */
313 inline_needs_template_parms (decl
)
316 if (! DECL_TEMPLATE_INFO (decl
))
319 return (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (most_general_template (decl
)))
320 > (processing_template_decl
+ DECL_TEMPLATE_SPECIALIZATION (decl
)));
323 /* Subroutine of maybe_begin_member_template_processing.
324 Push the template parms in PARMS, starting from LEVELS steps into the
325 chain, and ending at the beginning, since template parms are listed
329 push_inline_template_parms_recursive (parmlist
, levels
)
333 tree parms
= TREE_VALUE (parmlist
);
337 push_inline_template_parms_recursive (TREE_CHAIN (parmlist
), levels
- 1);
339 ++processing_template_decl
;
340 current_template_parms
341 = tree_cons (build_int_2 (0, processing_template_decl
),
342 parms
, current_template_parms
);
343 TEMPLATE_PARMS_FOR_INLINE (current_template_parms
) = 1;
346 for (i
= 0; i
< TREE_VEC_LENGTH (parms
); ++i
)
348 tree parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
349 my_friendly_assert (TREE_CODE_CLASS (TREE_CODE (parm
)) == 'd', 0);
351 switch (TREE_CODE (parm
))
360 /* Make a CONST_DECL as is done in process_template_parm. */
361 tree decl
= build_decl (CONST_DECL
, DECL_NAME (parm
),
363 DECL_INITIAL (decl
) = DECL_INITIAL (parm
);
369 my_friendly_abort (0);
374 /* Restore the template parameter context for a member template or
375 a friend template defined in a class definition. */
378 maybe_begin_member_template_processing (decl
)
384 if (! inline_needs_template_parms (decl
))
387 parms
= DECL_TEMPLATE_PARMS (most_general_template (decl
));
389 levels
= TMPL_PARMS_DEPTH (parms
) - processing_template_decl
;
391 if (DECL_TEMPLATE_SPECIALIZATION (decl
))
394 parms
= TREE_CHAIN (parms
);
397 push_inline_template_parms_recursive (parms
, levels
);
400 /* Undo the effects of begin_member_template_processing. */
403 maybe_end_member_template_processing ()
405 if (! processing_template_decl
)
408 while (current_template_parms
409 && TEMPLATE_PARMS_FOR_INLINE (current_template_parms
))
411 --processing_template_decl
;
412 current_template_parms
= TREE_CHAIN (current_template_parms
);
417 /* Returns non-zero iff T is a member template function. We must be
420 template <class T> class C { void f(); }
422 Here, f is a template function, and a member, but not a member
423 template. This function does not concern itself with the origin of
424 T, only its present state. So if we have
426 template <class T> class C { template <class U> void f(U); }
428 then neither C<int>::f<char> nor C<T>::f<double> is considered
429 to be a member template. */
432 is_member_template (t
)
435 if (TREE_CODE (t
) != FUNCTION_DECL
436 && !DECL_FUNCTION_TEMPLATE_P (t
))
437 /* Anything that isn't a function or a template function is
438 certainly not a member template. */
441 /* A local class can't have member templates. */
442 if (hack_decl_function_context (t
))
445 if ((DECL_FUNCTION_MEMBER_P (t
)
446 && !DECL_TEMPLATE_SPECIALIZATION (t
))
447 || (TREE_CODE (t
) == TEMPLATE_DECL
448 && DECL_FUNCTION_MEMBER_P (DECL_TEMPLATE_RESULT (t
))))
452 if (DECL_FUNCTION_TEMPLATE_P (t
))
454 else if (DECL_TEMPLATE_INFO (t
)
455 && DECL_FUNCTION_TEMPLATE_P (DECL_TI_TEMPLATE (t
)))
456 tmpl
= DECL_TI_TEMPLATE (t
);
461 /* If there are more levels of template parameters than
462 there are template classes surrounding the declaration,
463 then we have a member template. */
464 && (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl
)) >
465 template_class_depth (DECL_CLASS_CONTEXT (t
))))
472 /* Returns non-zero iff T is a member template class. See
473 is_member_template for a description of what precisely constitutes
474 a member template. */
477 is_member_template_class (t
)
480 if (!DECL_CLASS_TEMPLATE_P (t
))
481 /* Anything that isn't a class template, is certainly not a member
485 if (!DECL_CLASS_SCOPE_P (t
))
486 /* Anything whose context isn't a class type is surely not a
490 /* If there are more levels of template parameters than there are
491 template classes surrounding the declaration, then we have a
493 return (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (t
)) >
494 template_class_depth (DECL_CONTEXT (t
)));
497 /* Return a new template argument vector which contains all of ARGS,
498 but has as its innermost set of arguments the EXTRA_ARGS. The
499 resulting vector will be built on a temporary obstack, and so must
500 be explicitly copied to the permanent obstack, if required. */
503 add_to_template_args (args
, extra_args
)
512 extra_depth
= TMPL_ARGS_DEPTH (extra_args
);
513 new_args
= make_temp_vec (TMPL_ARGS_DEPTH (args
) + extra_depth
);
515 for (i
= 1; i
<= TMPL_ARGS_DEPTH (args
); ++i
)
516 SET_TMPL_ARGS_LEVEL (new_args
, i
, TMPL_ARGS_LEVEL (args
, i
));
518 for (j
= 1; j
<= extra_depth
; ++j
, ++i
)
519 SET_TMPL_ARGS_LEVEL (new_args
, i
, TMPL_ARGS_LEVEL (extra_args
, j
));
524 /* Like add_to_template_args, but only the outermost ARGS are added to
525 the EXTRA_ARGS. In particular, all but TMPL_ARGS_DEPTH
526 (EXTRA_ARGS) levels are added. This function is used to combine
527 the template arguments from a partial instantiation with the
528 template arguments used to attain the full instantiation from the
529 partial instantiation. */
532 add_outermost_template_args (args
, extra_args
)
538 /* If there are more levels of EXTRA_ARGS than there are ARGS,
539 something very fishy is going on. */
540 my_friendly_assert (TMPL_ARGS_DEPTH (args
) >= TMPL_ARGS_DEPTH (extra_args
),
543 /* If *all* the new arguments will be the EXTRA_ARGS, just return
545 if (TMPL_ARGS_DEPTH (args
) == TMPL_ARGS_DEPTH (extra_args
))
548 /* For the moment, we make ARGS look like it contains fewer levels. */
549 TREE_VEC_LENGTH (args
) -= TMPL_ARGS_DEPTH (extra_args
);
551 new_args
= add_to_template_args (args
, extra_args
);
553 /* Now, we restore ARGS to its full dimensions. */
554 TREE_VEC_LENGTH (args
) += TMPL_ARGS_DEPTH (extra_args
);
559 /* We've got a template header coming up; push to a new level for storing
563 begin_template_parm_list ()
565 /* We use a non-tag-transparent scope here, which causes pushtag to
566 put tags in this scope, rather than in the enclosing class or
567 namespace scope. This is the right thing, since we want
568 TEMPLATE_DECLS, and not TYPE_DECLS for template classes. For a
569 global template class, push_template_decl handles putting the
570 TEMPLATE_DECL into top-level scope. For a nested template class,
573 template <class T> struct S1 {
574 template <class T> struct S2 {};
577 pushtag contains special code to call pushdecl_with_scope on the
578 TEMPLATE_DECL for S2. */
580 declare_pseudo_global_level ();
581 ++processing_template_decl
;
582 ++processing_template_parmlist
;
583 note_template_header (0);
586 /* This routine is called when a specialization is declared. If it is
587 illegal to declare a specialization here, an error is reported. */
590 check_specialization_scope ()
592 tree scope
= current_scope ();
596 An explicit specialization shall be declared in the namespace of
597 which the template is a member, or, for member templates, in the
598 namespace of which the enclosing class or enclosing class
599 template is a member. An explicit specialization of a member
600 function, member class or static data member of a class template
601 shall be declared in the namespace of which the class template
603 if (scope
&& TREE_CODE (scope
) != NAMESPACE_DECL
)
604 cp_error ("explicit specialization in non-namespace scope `%D'",
609 In an explicit specialization declaration for a member of a class
610 template or a member template that appears in namespace scope,
611 the member template and some of its enclosing class templates may
612 remain unspecialized, except that the declaration shall not
613 explicitly specialize a class member template if its enclosing
614 class templates are not explicitly specialized as well. */
615 if (current_template_parms
)
616 cp_error ("enclosing class templates are not explicitly specialized");
619 /* We've just seen template <>. */
622 begin_specialization ()
624 note_template_header (1);
625 check_specialization_scope ();
628 /* Called at then end of processing a declaration preceeded by
632 end_specialization ()
634 reset_specialization ();
637 /* Any template <>'s that we have seen thus far are not referring to a
638 function specialization. */
641 reset_specialization ()
643 processing_specialization
= 0;
644 template_header_count
= 0;
647 /* We've just seen a template header. If SPECIALIZATION is non-zero,
648 it was of the form template <>. */
651 note_template_header (specialization
)
654 processing_specialization
= specialization
;
655 template_header_count
++;
658 /* We're beginning an explicit instantiation. */
661 begin_explicit_instantiation ()
663 ++processing_explicit_instantiation
;
668 end_explicit_instantiation ()
670 my_friendly_assert(processing_explicit_instantiation
> 0, 0);
671 --processing_explicit_instantiation
;
674 /* The TYPE is being declared. If it is a template type, that means it
675 is a partial specialization. Do appropriate error-checking. */
678 maybe_process_partial_specialization (type
)
681 if (IS_AGGR_TYPE (type
) && CLASSTYPE_USE_TEMPLATE (type
))
683 if (CLASSTYPE_IMPLICIT_INSTANTIATION (type
)
684 && TYPE_SIZE (type
) == NULL_TREE
)
686 SET_CLASSTYPE_TEMPLATE_SPECIALIZATION (type
);
687 if (processing_template_decl
)
688 push_template_decl (TYPE_MAIN_DECL (type
));
690 else if (CLASSTYPE_TEMPLATE_INSTANTIATION (type
))
691 cp_error ("specialization of `%T' after instantiation", type
);
695 /* Retrieve the specialization (in the sense of [temp.spec] - a
696 specialization is either an instantiation or an explicit
697 specialization) of TMPL for the given template ARGS. If there is
698 no such specialization, return NULL_TREE. The ARGS are a vector of
699 arguments, or a vector of vectors of arguments, in the case of
700 templates with more than one level of parameters. */
703 retrieve_specialization (tmpl
, args
)
709 my_friendly_assert (TREE_CODE (tmpl
) == TEMPLATE_DECL
, 0);
711 /* There should be as many levels of arguments as there are
712 levels of parameters. */
713 my_friendly_assert (TMPL_ARGS_DEPTH (args
)
714 == TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl
)),
717 for (s
= DECL_TEMPLATE_SPECIALIZATIONS (tmpl
);
720 if (comp_template_args (TREE_PURPOSE (s
), args
))
721 return TREE_VALUE (s
);
726 /* Returns non-zero iff DECL is a specialization of TMPL. */
729 is_specialization_of (decl
, tmpl
)
735 if (TREE_CODE (decl
) == FUNCTION_DECL
)
739 t
= DECL_TEMPLATE_INFO (t
) ? DECL_TI_TEMPLATE (t
) : NULL_TREE
)
745 my_friendly_assert (TREE_CODE (decl
) == TYPE_DECL
, 0);
747 for (t
= TREE_TYPE (decl
);
749 t
= CLASSTYPE_USE_TEMPLATE (t
)
750 ? TREE_TYPE (CLASSTYPE_TI_TEMPLATE (t
)) : NULL_TREE
)
751 if (comptypes (TYPE_MAIN_VARIANT (t
),
752 TYPE_MAIN_VARIANT (TREE_TYPE (tmpl
)), 1))
759 /* Returns nonzero if T1 and T2 are instances of the same template.
760 (They may have different template arguments.) */
763 specializations_of_same_template_p (t1
, t2
)
767 /* For now, we only deal with instances of class templates, since
768 that is the only way in which this function is used. */
770 return (most_general_template (CLASSTYPE_TI_TEMPLATE (t1
))
771 == most_general_template (CLASSTYPE_TI_TEMPLATE (t2
)));
775 /* Register the specialization SPEC as a specialization of TMPL with
776 the indicated ARGS. Returns SPEC, or an equivalent prior
777 declaration, if available. */
780 register_specialization (spec
, tmpl
, args
)
787 my_friendly_assert (TREE_CODE (tmpl
) == TEMPLATE_DECL
, 0);
789 if (TREE_CODE (spec
) == FUNCTION_DECL
790 && uses_template_parms (DECL_TI_ARGS (spec
)))
791 /* This is the FUNCTION_DECL for a partial instantiation. Don't
792 register it; we want the corresponding TEMPLATE_DECL instead.
793 We use `uses_template_parms (DECL_TI_ARGS (spec))' rather than
794 the more obvious `uses_template_parms (spec)' to avoid problems
795 with default function arguments. In particular, given
798 template <class T> void f(T t1, T t = T())
800 the default argument expression is not substituted for in an
801 instantiation unless and until it is actually needed. */
804 /* There should be as many levels of arguments as there are
805 levels of parameters. */
806 my_friendly_assert (TMPL_ARGS_DEPTH (args
)
807 == TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl
)),
810 for (s
= DECL_TEMPLATE_SPECIALIZATIONS (tmpl
);
813 if (comp_template_args (TREE_PURPOSE (s
), args
))
815 tree fn
= TREE_VALUE (s
);
817 if (DECL_TEMPLATE_SPECIALIZATION (spec
))
819 if (DECL_TEMPLATE_INSTANTIATION (fn
))
822 || DECL_EXPLICIT_INSTANTIATION (fn
))
824 cp_error ("specialization of %D after instantiation",
830 /* This situation should occur only if the first
831 specialization is an implicit instantiation,
832 the second is an explicit specialization, and
833 the implicit instantiation has not yet been
834 used. That situation can occur if we have
835 implicitly instantiated a member function and
836 then specialized it later.
838 We can also wind up here if a friend
839 declaration that looked like an instantiation
840 turns out to be a specialization:
842 template <class T> void foo(T);
843 class S { friend void foo<>(int) };
844 template <> void foo(int);
846 We transform the existing DECL in place so that
847 any pointers to it become pointers to the
848 updated declaration. */
849 duplicate_decls (spec
, TREE_VALUE (s
));
850 return TREE_VALUE (s
);
853 else if (DECL_TEMPLATE_SPECIALIZATION (fn
))
855 duplicate_decls (spec
, TREE_VALUE (s
));
856 return TREE_VALUE (s
);
861 DECL_TEMPLATE_SPECIALIZATIONS (tmpl
)
862 = perm_tree_cons (args
, spec
, DECL_TEMPLATE_SPECIALIZATIONS (tmpl
));
867 /* Unregister the specialization SPEC as a specialization of TMPL.
868 Returns nonzero if the SPEC was listed as a specialization of
872 unregister_specialization (spec
, tmpl
)
878 for (s
= &DECL_TEMPLATE_SPECIALIZATIONS (tmpl
);
880 s
= &TREE_CHAIN (*s
))
881 if (TREE_VALUE (*s
) == spec
)
883 *s
= TREE_CHAIN (*s
);
890 /* Print the list of candidate FNS in an error message. */
893 print_candidates (fns
)
898 char* str
= "candidates are:";
900 for (fn
= fns
; fn
!= NULL_TREE
; fn
= TREE_CHAIN (fn
))
902 cp_error_at ("%s %+#D", str
, TREE_VALUE (fn
));
907 /* Returns the template (one of the functions given by TEMPLATE_ID)
908 which can be specialized to match the indicated DECL with the
909 explicit template args given in TEMPLATE_ID. If
910 NEED_MEMBER_TEMPLATE is true the function is a specialization of a
911 member template. The template args (those explicitly specified and
912 those deduced) are output in a newly created vector *TARGS_OUT. If
913 it is impossible to determine the result, an error message is
914 issued, unless COMPLAIN is 0. The DECL may be NULL_TREE if none is
918 determine_specialization (template_id
, decl
, targs_out
,
919 need_member_template
,
924 int need_member_template
;
928 tree templates
= NULL_TREE
;
931 *targs_out
= NULL_TREE
;
933 if (template_id
== error_mark_node
)
934 return error_mark_node
;
936 fns
= TREE_OPERAND (template_id
, 0);
937 targs_in
= TREE_OPERAND (template_id
, 1);
939 if (fns
== error_mark_node
)
940 return error_mark_node
;
942 /* Check for baselinks. */
943 if (TREE_CODE (fns
) == TREE_LIST
)
944 fns
= TREE_VALUE (fns
);
946 for (; fns
; fns
= OVL_NEXT (fns
))
950 fn
= OVL_CURRENT (fns
);
951 if (!need_member_template
952 && TREE_CODE (fn
) == FUNCTION_DECL
953 && DECL_FUNCTION_MEMBER_P (fn
)
954 && DECL_USE_TEMPLATE (fn
)
955 && DECL_TI_TEMPLATE (fn
))
956 /* We can get here when processing something like:
957 template <class T> class X { void f(); }
958 template <> void X<int>::f() {}
959 We're specializing a member function, but not a member
961 tmpl
= DECL_TI_TEMPLATE (fn
);
962 else if (TREE_CODE (fn
) != TEMPLATE_DECL
963 || (need_member_template
&& !is_member_template (fn
)))
968 if (list_length (targs_in
) > DECL_NTPARMS (tmpl
))
971 if (decl
== NULL_TREE
)
973 /* Unify against ourselves to make sure that the args we have
974 make sense and there aren't any undeducible parms. It's OK if
975 not all the parms are specified; they might be deduced
977 tree targs
= get_bindings_overload (tmpl
, DECL_RESULT (tmpl
),
981 /* Unification was successful. */
982 templates
= scratch_tree_cons (targs
, tmpl
, templates
);
985 templates
= scratch_tree_cons (NULL_TREE
, tmpl
, templates
);
988 if (decl
!= NULL_TREE
)
990 tree tmpl
= most_specialized (templates
, decl
, targs_in
);
994 if (tmpl
== error_mark_node
)
996 else if (tmpl
== NULL_TREE
)
999 inner_args
= get_bindings (tmpl
, decl
, targs_in
);
1000 tmpl_args
= DECL_TI_ARGS (DECL_RESULT (tmpl
));
1001 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (tmpl_args
))
1003 *targs_out
= copy_node (tmpl_args
);
1004 SET_TMPL_ARGS_LEVEL (*targs_out
,
1005 TMPL_ARGS_DEPTH (*targs_out
),
1009 *targs_out
= inner_args
;
1014 if (templates
== NULL_TREE
)
1019 cp_error_at ("template-id `%D' for `%+D' does not match any template declaration",
1021 return error_mark_node
;
1025 else if (TREE_CHAIN (templates
) != NULL_TREE
1026 || uses_template_parms (TREE_PURPOSE (templates
)))
1031 cp_error_at ("ambiguous template specialization `%D' for `%+D'",
1033 print_candidates (templates
);
1034 return error_mark_node
;
1039 /* We have one, and exactly one, match. */
1040 *targs_out
= TREE_PURPOSE (templates
);
1041 return TREE_VALUE (templates
);
1044 /* Check to see if the function just declared, as indicated in
1045 DECLARATOR, and in DECL, is a specialization of a function
1046 template. We may also discover that the declaration is an explicit
1047 instantiation at this point.
1049 Returns DECL, or an equivalent declaration that should be used
1052 FLAGS is a bitmask consisting of the following flags:
1054 2: The function has a definition.
1055 4: The function is a friend.
1057 The TEMPLATE_COUNT is the number of references to qualifying
1058 template classes that appeared in the name of the function. For
1061 template <class T> struct S { void f(); };
1064 the TEMPLATE_COUNT would be 1. However, explicitly specialized
1065 classes are not counted in the TEMPLATE_COUNT, so that in
1067 template <class T> struct S {};
1068 template <> struct S<int> { void f(); }
1069 template <> void S<int>::f();
1071 the TEMPLATE_COUNT would be 0. (Note that this declaration is
1072 illegal; there should be no template <>.)
1074 If the function is a specialization, it is marked as such via
1075 DECL_TEMPLATE_SPECIALIZATION. Furthermore, its DECL_TEMPLATE_INFO
1076 is set up correctly, and it is added to the list of specializations
1077 for that template. */
1080 check_explicit_specialization (declarator
, decl
, template_count
, flags
)
1086 int have_def
= flags
& 2;
1087 int is_friend
= flags
& 4;
1088 int specialization
= 0;
1089 int explicit_instantiation
= 0;
1090 int member_specialization
= 0;
1092 tree ctype
= DECL_CLASS_CONTEXT (decl
);
1093 tree dname
= DECL_NAME (decl
);
1095 if (processing_specialization
)
1097 /* The last template header was of the form template <>. */
1099 if (template_header_count
> template_count
)
1101 /* There were more template headers than qualifying template
1103 if (template_header_count
- template_count
> 1)
1104 /* There shouldn't be that many template parameter
1105 lists. There can be at most one parameter list for
1106 every qualifying class, plus one for the function
1108 cp_error ("too many template parameter lists in declaration of `%D'", decl
);
1110 SET_DECL_TEMPLATE_SPECIALIZATION (decl
);
1112 member_specialization
= 1;
1116 else if (template_header_count
== template_count
)
1118 /* The counts are equal. So, this might be a
1119 specialization, but it is not a specialization of a
1120 member template. It might be something like
1122 template <class T> struct S {
1126 void S<int>::f(int i) {} */
1128 SET_DECL_TEMPLATE_SPECIALIZATION (decl
);
1132 /* This cannot be an explicit specialization. There are not
1133 enough headers for all of the qualifying classes. For
1134 example, we might have:
1137 void S<int>::T<char>::f();
1139 But, we're missing another template <>. */
1140 cp_error("too few template parameter lists in declaration of `%D'", decl
);
1144 else if (processing_explicit_instantiation
)
1146 if (template_header_count
)
1147 cp_error ("template parameter list used in explicit instantiation");
1150 cp_error ("definition provided for explicit instantiation");
1152 explicit_instantiation
= 1;
1154 else if (ctype
!= NULL_TREE
1155 && !TYPE_BEING_DEFINED (ctype
)
1156 && CLASSTYPE_TEMPLATE_INSTANTIATION (ctype
)
1159 /* This case catches outdated code that looks like this:
1161 template <class T> struct S { void f(); };
1162 void S<int>::f() {} // Missing template <>
1164 We disable this check when the type is being defined to
1165 avoid complaining about default compiler-generated
1166 constructors, destructors, and assignment operators.
1167 Since the type is an instantiation, not a specialization,
1168 these are the only functions that can be defined before
1169 the class is complete. */
1172 template <class T> void S<int>::f() {}
1174 if (template_header_count
)
1176 cp_error ("template parameters specified in specialization");
1182 ("explicit specialization not preceded by `template <>'");
1184 SET_DECL_TEMPLATE_SPECIALIZATION (decl
);
1186 else if (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
)
1189 /* This could be something like:
1191 template <class T> void f(T);
1192 class S { friend void f<>(int); } */
1196 /* This case handles bogus declarations like template <>
1197 template <class T> void f<int>(); */
1199 cp_error ("template-id `%D' in declaration of primary template",
1205 if (specialization
|| member_specialization
)
1207 tree t
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
1208 for (; t
; t
= TREE_CHAIN (t
))
1209 if (TREE_PURPOSE (t
))
1212 ("default argument specified in explicit specialization");
1217 if (specialization
|| member_specialization
|| explicit_instantiation
)
1220 tree tmpl
= NULL_TREE
;
1221 tree targs
= NULL_TREE
;
1223 /* Make sure that the declarator is a TEMPLATE_ID_EXPR. */
1224 if (TREE_CODE (declarator
) != TEMPLATE_ID_EXPR
)
1228 my_friendly_assert (TREE_CODE (declarator
) == IDENTIFIER_NODE
,
1231 fns
= IDENTIFIER_NAMESPACE_VALUE (dname
);
1236 lookup_template_function (fns
, NULL_TREE
);
1239 if (declarator
== error_mark_node
)
1240 return error_mark_node
;
1242 if (TREE_CODE (TREE_OPERAND (declarator
, 0)) == LOOKUP_EXPR
)
1244 /* A friend declaration. We can't do much, because we don't
1245 know what this resolves to, yet. */
1246 my_friendly_assert (is_friend
!= 0, 0);
1247 my_friendly_assert (!explicit_instantiation
, 0);
1248 SET_DECL_IMPLICIT_INSTANTIATION (decl
);
1252 if (ctype
!= NULL_TREE
&& TYPE_BEING_DEFINED (ctype
))
1254 if (!explicit_instantiation
)
1255 /* A specialization in class scope. This is illegal,
1256 but the error will already have been flagged by
1257 check_specialization_scope. */
1258 return error_mark_node
;
1261 /* It's not legal to write an explicit instantiation in
1264 class C { template void f(); }
1266 This case is caught by the parser. However, on
1269 template class C { void f(); };
1271 (which is illegal) we can get here. The error will be
1278 else if (ctype
!= NULL_TREE
1279 && (TREE_CODE (TREE_OPERAND (declarator
, 0)) ==
1282 /* Find the list of functions in ctype that have the same
1283 name as the declared function. */
1284 tree name
= TREE_OPERAND (declarator
, 0);
1287 if (name
== constructor_name (ctype
)
1288 || name
== constructor_name_full (ctype
))
1290 int is_constructor
= DECL_CONSTRUCTOR_P (decl
);
1292 if (is_constructor
? !TYPE_HAS_CONSTRUCTOR (ctype
)
1293 : !TYPE_HAS_DESTRUCTOR (ctype
))
1295 /* From [temp.expl.spec]:
1297 If such an explicit specialization for the member
1298 of a class template names an implicitly-declared
1299 special member function (clause _special_), the
1300 program is ill-formed.
1302 Similar language is found in [temp.explicit]. */
1303 cp_error ("specialization of implicitly-declared special member function");
1308 name
= is_constructor
? ctor_identifier
: dtor_identifier
;
1311 fns
= lookup_fnfields (TYPE_BINFO (ctype
), name
, 1);
1313 if (fns
== NULL_TREE
)
1315 cp_error ("no member function `%s' declared in `%T'",
1316 IDENTIFIER_POINTER (name
),
1321 TREE_OPERAND (declarator
, 0) = fns
;
1324 /* Figure out what exactly is being specialized at this point.
1325 Note that for an explicit instantiation, even one for a
1326 member function, we cannot tell apriori whether the
1327 instantiation is for a member template, or just a member
1328 function of a template class. Even if a member template is
1329 being instantiated, the member template arguments may be
1330 elided if they can be deduced from the rest of the
1332 tmpl
= determine_specialization (declarator
, decl
,
1334 member_specialization
,
1337 if (tmpl
&& tmpl
!= error_mark_node
)
1339 gen_tmpl
= most_general_template (tmpl
);
1341 if (explicit_instantiation
)
1343 /* We don't set DECL_EXPLICIT_INSTANTIATION here; that
1344 is done by do_decl_instantiation later. */
1345 decl
= instantiate_template (tmpl
, innermost_args (targs
));
1349 /* If we though that the DECL was a member function, but it
1350 turns out to be specializing a static member function,
1351 make DECL a static member function as well. */
1352 if (DECL_STATIC_FUNCTION_P (tmpl
)
1353 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
1355 revert_static_member_fn (&decl
, 0, 0);
1356 last_function_parms
= TREE_CHAIN (last_function_parms
);
1359 /* Set up the DECL_TEMPLATE_INFO for DECL. */
1360 DECL_TEMPLATE_INFO (decl
)
1361 = perm_tree_cons (tmpl
, targs
, NULL_TREE
);
1363 /* Mangle the function name appropriately. Note that we do
1364 not mangle specializations of non-template member
1365 functions of template classes, e.g. with
1367 template <class T> struct S { void f(); }
1369 and given the specialization
1371 template <> void S<int>::f() {}
1373 we do not mangle S<int>::f() here. That's because it's
1374 just an ordinary member function and doesn't need special
1375 treatment. We do this here so that the ordinary,
1376 non-template, name-mangling algorith will not be used
1378 if ((is_member_template (tmpl
) || ctype
== NULL_TREE
)
1379 && name_mangling_version
>= 1)
1380 set_mangled_name_for_template_decl (decl
);
1382 if (is_friend
&& !have_def
)
1383 /* This is not really a declaration of a specialization.
1384 It's just the name of an instantiation. But, it's not
1385 a request for an instantiation, either. */
1386 SET_DECL_IMPLICIT_INSTANTIATION (decl
);
1388 /* Register this specialization so that we can find it
1390 decl
= register_specialization (decl
, gen_tmpl
, targs
);
1399 /* TYPE is being declared. Verify that the use of template headers
1400 and such is reasonable. Issue error messages if not. */
1403 maybe_check_template_type (type
)
1406 if (template_header_count
)
1408 /* We are in the scope of some `template <...>' header. */
1411 = template_class_depth_real (TYPE_CONTEXT (type
),
1412 /*count_specializations=*/1);
1414 if (template_header_count
<= context_depth
)
1415 /* This is OK; the template headers are for the context. We
1416 are actually too lenient here; like
1417 check_explicit_specialization we should consider the number
1418 of template types included in the actual declaration. For
1421 template <class T> struct S {
1422 template <class U> template <class V>
1428 template <class T> struct S {
1429 template <class U> struct I;
1432 template <class T> template <class U.
1437 else if (template_header_count
> context_depth
+ 1)
1438 /* There are two many template parameter lists. */
1439 cp_error ("too many template parameter lists in declaration of `%T'", type
);
1443 /* Returns 1 iff PARMS1 and PARMS2 are identical sets of template
1444 parameters. These are represented in the same format used for
1445 DECL_TEMPLATE_PARMS. */
1447 int comp_template_parms (parms1
, parms2
)
1454 if (parms1
== parms2
)
1457 for (p1
= parms1
, p2
= parms2
;
1458 p1
!= NULL_TREE
&& p2
!= NULL_TREE
;
1459 p1
= TREE_CHAIN (p1
), p2
= TREE_CHAIN (p2
))
1461 tree t1
= TREE_VALUE (p1
);
1462 tree t2
= TREE_VALUE (p2
);
1465 my_friendly_assert (TREE_CODE (t1
) == TREE_VEC
, 0);
1466 my_friendly_assert (TREE_CODE (t2
) == TREE_VEC
, 0);
1468 if (TREE_VEC_LENGTH (t1
) != TREE_VEC_LENGTH (t2
))
1471 for (i
= 0; i
< TREE_VEC_LENGTH (t2
); ++i
)
1473 tree parm1
= TREE_VALUE (TREE_VEC_ELT (t1
, i
));
1474 tree parm2
= TREE_VALUE (TREE_VEC_ELT (t2
, i
));
1476 if (TREE_CODE (parm1
) != TREE_CODE (parm2
))
1479 if (TREE_CODE (parm1
) == TEMPLATE_TYPE_PARM
)
1481 else if (!comptypes (TREE_TYPE (parm1
),
1482 TREE_TYPE (parm2
), 1))
1487 if ((p1
!= NULL_TREE
) != (p2
!= NULL_TREE
))
1488 /* One set of parameters has more parameters lists than the
1496 /* Returns 1 iff old_id is a template parameter. OLD_DECL is the decl
1497 from IDENTIFIER_LOCAL_VALUE (new identifier). */
1499 int decl_template_parm_p (old_decl
)
1502 /* For template template parms. */
1503 if (TREE_CODE (old_decl
) == TEMPLATE_DECL
1504 && TREE_TYPE (old_decl
)
1505 && TREE_CODE (TREE_TYPE (old_decl
)) == TEMPLATE_TEMPLATE_PARM
)
1508 /* For template type parms. */
1509 if (TREE_CODE (old_decl
) == TYPE_DECL
1510 && TREE_TYPE (old_decl
)
1511 && TREE_CODE (TREE_TYPE (old_decl
)) == TEMPLATE_TYPE_PARM
)
1514 /* For template non-type parms. */
1515 if (TREE_CODE (old_decl
) == CONST_DECL
1516 && DECL_INITIAL (old_decl
)
1517 && TREE_CODE (DECL_INITIAL (old_decl
)) == TEMPLATE_PARM_INDEX
)
1524 /* Return a new TEMPLATE_PARM_INDEX with the indicated INDEX, LEVEL,
1525 ORIG_LEVEL, DECL, and TYPE. */
1528 build_template_parm_index (index
, level
, orig_level
, decl
, type
)
1535 tree t
= make_node (TEMPLATE_PARM_INDEX
);
1536 TEMPLATE_PARM_IDX (t
) = index
;
1537 TEMPLATE_PARM_LEVEL (t
) = level
;
1538 TEMPLATE_PARM_ORIG_LEVEL (t
) = orig_level
;
1539 TEMPLATE_PARM_DECL (t
) = decl
;
1540 TREE_TYPE (t
) = type
;
1545 /* Return a TEMPLATE_PARM_INDEX, similar to INDEX, but whose
1546 TEMPLATE_PARM_LEVEL has been decreased by LEVELS. If such a
1547 TEMPLATE_PARM_INDEX already exists, it is returned; otherwise, a
1548 new one is created. */
1551 reduce_template_parm_level (index
, type
, levels
)
1556 if (TEMPLATE_PARM_DESCENDANTS (index
) == NULL_TREE
1557 || (TEMPLATE_PARM_LEVEL (TEMPLATE_PARM_DESCENDANTS (index
))
1558 != TEMPLATE_PARM_LEVEL (index
) - levels
))
1561 = build_decl (TREE_CODE (TEMPLATE_PARM_DECL (index
)),
1562 DECL_NAME (TEMPLATE_PARM_DECL (index
)),
1565 = build_template_parm_index (TEMPLATE_PARM_IDX (index
),
1566 TEMPLATE_PARM_LEVEL (index
) - levels
,
1567 TEMPLATE_PARM_ORIG_LEVEL (index
),
1569 TEMPLATE_PARM_DESCENDANTS (index
) = t
;
1571 /* Template template parameters need this. */
1572 DECL_TEMPLATE_PARMS (decl
)
1573 = DECL_TEMPLATE_PARMS (TEMPLATE_PARM_DECL (index
));
1576 return TEMPLATE_PARM_DESCENDANTS (index
);
1579 /* Process information from new template parameter NEXT and append it to the
1580 LIST being built. */
1583 process_template_parm (list
, next
)
1592 my_friendly_assert (TREE_CODE (parm
) == TREE_LIST
, 259);
1593 defval
= TREE_PURPOSE (parm
);
1594 parm
= TREE_VALUE (parm
);
1595 is_type
= TREE_PURPOSE (parm
) == class_type_node
;
1599 tree p
= TREE_VALUE (tree_last (list
));
1601 if (TREE_CODE (p
) == TYPE_DECL
)
1602 idx
= TEMPLATE_TYPE_IDX (TREE_TYPE (p
));
1603 else if (TREE_CODE (p
) == TEMPLATE_DECL
)
1604 idx
= TEMPLATE_TYPE_IDX (TREE_TYPE (DECL_TEMPLATE_RESULT (p
)));
1606 idx
= TEMPLATE_PARM_IDX (DECL_INITIAL (p
));
1614 my_friendly_assert (TREE_CODE (TREE_PURPOSE (parm
)) == TREE_LIST
, 260);
1615 /* is a const-param */
1616 parm
= grokdeclarator (TREE_VALUE (parm
), TREE_PURPOSE (parm
),
1617 PARM
, 0, NULL_TREE
);
1618 /* A template parameter is not modifiable. */
1619 TREE_READONLY (parm
) = 1;
1620 if (IS_AGGR_TYPE (TREE_TYPE (parm
))
1621 && TREE_CODE (TREE_TYPE (parm
)) != TEMPLATE_TYPE_PARM
1622 && TREE_CODE (TREE_TYPE (parm
)) != TYPENAME_TYPE
)
1624 cp_error ("`%#T' is not a valid type for a template constant parameter",
1626 if (DECL_NAME (parm
) == NULL_TREE
)
1627 error (" a template type parameter must begin with `class' or `typename'");
1628 TREE_TYPE (parm
) = void_type_node
;
1631 && (TREE_CODE (TREE_TYPE (parm
)) == REAL_TYPE
1632 || TREE_CODE (TREE_TYPE (parm
)) == COMPLEX_TYPE
))
1633 cp_pedwarn ("`%T' is not a valid type for a template constant parameter",
1635 if (TREE_PERMANENT (parm
) == 0)
1637 parm
= copy_node (parm
);
1638 TREE_PERMANENT (parm
) = 1;
1640 decl
= build_decl (CONST_DECL
, DECL_NAME (parm
), TREE_TYPE (parm
));
1641 DECL_INITIAL (parm
) = DECL_INITIAL (decl
)
1642 = build_template_parm_index (idx
, processing_template_decl
,
1643 processing_template_decl
,
1644 decl
, TREE_TYPE (parm
));
1649 parm
= TREE_VALUE (parm
);
1651 if (parm
&& TREE_CODE (parm
) == TEMPLATE_DECL
)
1653 t
= make_lang_type (TEMPLATE_TEMPLATE_PARM
);
1654 /* This is for distinguishing between real templates and template
1655 template parameters */
1656 TREE_TYPE (parm
) = t
;
1657 TREE_TYPE (DECL_TEMPLATE_RESULT (parm
)) = t
;
1662 t
= make_lang_type (TEMPLATE_TYPE_PARM
);
1663 /* parm is either IDENTIFIER_NODE or NULL_TREE */
1664 decl
= build_decl (TYPE_DECL
, parm
, t
);
1667 CLASSTYPE_GOT_SEMICOLON (t
) = 1;
1668 TYPE_NAME (t
) = decl
;
1669 TYPE_STUB_DECL (t
) = decl
;
1671 TEMPLATE_TYPE_PARM_INDEX (t
)
1672 = build_template_parm_index (idx
, processing_template_decl
,
1673 processing_template_decl
,
1674 decl
, TREE_TYPE (parm
));
1676 SET_DECL_ARTIFICIAL (decl
);
1678 parm
= build_tree_list (defval
, parm
);
1679 return chainon (list
, parm
);
1682 /* The end of a template parameter list has been reached. Process the
1683 tree list into a parameter vector, converting each parameter into a more
1684 useful form. Type parameters are saved as IDENTIFIER_NODEs, and others
1688 end_template_parm_list (parms
)
1693 tree saved_parmlist
= make_tree_vec (list_length (parms
));
1695 current_template_parms
1696 = tree_cons (build_int_2 (0, processing_template_decl
),
1697 saved_parmlist
, current_template_parms
);
1699 for (parm
= parms
, nparms
= 0; parm
; parm
= TREE_CHAIN (parm
), nparms
++)
1700 TREE_VEC_ELT (saved_parmlist
, nparms
) = parm
;
1702 --processing_template_parmlist
;
1704 return saved_parmlist
;
1707 /* end_template_decl is called after a template declaration is seen. */
1710 end_template_decl ()
1712 reset_specialization ();
1714 if (! processing_template_decl
)
1717 /* This matches the pushlevel in begin_template_parm_list. */
1720 --processing_template_decl
;
1721 current_template_parms
= TREE_CHAIN (current_template_parms
);
1722 (void) get_pending_sizes (); /* Why? */
1725 /* Given a template argument vector containing the template PARMS.
1726 The innermost PARMS are given first. */
1729 current_template_args ()
1732 tree args
= NULL_TREE
;
1733 int length
= TMPL_PARMS_DEPTH (current_template_parms
);
1736 /* If there is only one level of template parameters, we do not
1737 create a TREE_VEC of TREE_VECs. Instead, we return a single
1738 TREE_VEC containing the arguments. */
1740 args
= make_tree_vec (length
);
1742 for (header
= current_template_parms
; header
; header
= TREE_CHAIN (header
))
1744 tree a
= copy_node (TREE_VALUE (header
));
1747 TREE_TYPE (a
) = NULL_TREE
;
1748 for (i
= TREE_VEC_LENGTH (a
) - 1; i
>= 0; --i
)
1750 tree t
= TREE_VEC_ELT (a
, i
);
1752 /* T will be a list if we are called from within a
1753 begin/end_template_parm_list pair, but a vector directly
1754 if within a begin/end_member_template_processing pair. */
1755 if (TREE_CODE (t
) == TREE_LIST
)
1759 if (TREE_CODE (t
) == TYPE_DECL
1760 || TREE_CODE (t
) == TEMPLATE_DECL
)
1763 t
= DECL_INITIAL (t
);
1764 TREE_VEC_ELT (a
, i
) = t
;
1769 TREE_VEC_ELT (args
, --l
) = a
;
1777 /* Return a TEMPLATE_DECL corresponding to DECL, using the indicated
1778 template PARMS. Used by push_template_decl below. */
1781 build_template_decl (decl
, parms
)
1785 tree tmpl
= build_lang_decl (TEMPLATE_DECL
, DECL_NAME (decl
), NULL_TREE
);
1786 DECL_TEMPLATE_PARMS (tmpl
) = parms
;
1787 DECL_CONTEXT (tmpl
) = DECL_CONTEXT (decl
);
1788 if (DECL_LANG_SPECIFIC (decl
))
1790 DECL_CLASS_CONTEXT (tmpl
) = DECL_CLASS_CONTEXT (decl
);
1791 DECL_STATIC_FUNCTION_P (tmpl
) =
1792 DECL_STATIC_FUNCTION_P (decl
);
1798 struct template_parm_data
1800 /* The level of the template parameters we are currently
1804 /* The index of the specialization argument we are currently
1808 /* An array whose size is the number of template parameters. The
1809 elements are non-zero if the parameter has been used in any one
1810 of the arguments processed so far. */
1813 /* An array whose size is the number of template arguments. The
1814 elements are non-zero if the argument makes use of template
1815 parameters of this level. */
1816 int* arg_uses_template_parms
;
1819 /* Subroutine of push_template_decl used to see if each template
1820 parameter in a partial specialization is used in the explicit
1821 argument list. If T is of the LEVEL given in DATA (which is
1822 treated as a template_parm_data*), then DATA->PARMS is marked
1826 mark_template_parm (t
, data
)
1832 struct template_parm_data
* tpd
= (struct template_parm_data
*) data
;
1834 if (TREE_CODE (t
) == TEMPLATE_PARM_INDEX
)
1836 level
= TEMPLATE_PARM_LEVEL (t
);
1837 idx
= TEMPLATE_PARM_IDX (t
);
1841 level
= TEMPLATE_TYPE_LEVEL (t
);
1842 idx
= TEMPLATE_TYPE_IDX (t
);
1845 if (level
== tpd
->level
)
1847 tpd
->parms
[idx
] = 1;
1848 tpd
->arg_uses_template_parms
[tpd
->current_arg
] = 1;
1851 /* Return zero so that for_each_template_parm will continue the
1852 traversal of the tree; we want to mark *every* template parm. */
1856 /* Process the partial specialization DECL. */
1859 process_partial_specialization (decl
)
1862 tree type
= TREE_TYPE (decl
);
1863 tree maintmpl
= CLASSTYPE_TI_TEMPLATE (type
);
1864 tree specargs
= CLASSTYPE_TI_ARGS (type
);
1865 tree inner_args
= innermost_args (specargs
);
1866 tree inner_parms
= INNERMOST_TEMPLATE_PARMS (current_template_parms
);
1867 tree main_inner_parms
= DECL_INNERMOST_TEMPLATE_PARMS (maintmpl
);
1868 int nargs
= TREE_VEC_LENGTH (inner_args
);
1869 int ntparms
= TREE_VEC_LENGTH (inner_parms
);
1871 int did_error_intro
= 0;
1872 int issued_default_arg_message
= 0;
1873 struct template_parm_data tpd
;
1874 struct template_parm_data tpd2
;
1876 /* [temp.class.spec]
1878 The template parameter list of a specialization shall not
1879 contain default template argument values. */
1880 for (i
= 0; i
< ntparms
; ++i
)
1882 if (TREE_PURPOSE (TREE_VEC_ELT (inner_parms
, i
)))
1884 if (!issued_default_arg_message
)
1886 cp_error ("default argument in partial specialization `%T'",
1888 issued_default_arg_message
= 1;
1890 TREE_PURPOSE (TREE_VEC_ELT (inner_parms
, i
)) = NULL_TREE
;
1894 /* We check that each of the template parameters given in the
1895 partial specialization is used in the argument list to the
1896 specialization. For example:
1898 template <class T> struct S;
1899 template <class T> struct S<T*>;
1901 The second declaration is OK because `T*' uses the template
1902 parameter T, whereas
1904 template <class T> struct S<int>;
1906 is no good. Even trickier is:
1917 The S2<T> declaration is actually illegal; it is a
1918 full-specialization. Of course,
1921 struct S2<T (*)(U)>;
1923 or some such would have been OK. */
1924 tpd
.level
= TMPL_PARMS_DEPTH (current_template_parms
);
1925 tpd
.parms
= alloca (sizeof (int) * ntparms
);
1926 bzero (tpd
.parms
, sizeof (int) * ntparms
);
1928 tpd
.arg_uses_template_parms
= alloca (sizeof (int) * nargs
);
1929 bzero (tpd
.arg_uses_template_parms
, sizeof (int) * nargs
);
1930 for (i
= 0; i
< nargs
; ++i
)
1932 tpd
.current_arg
= i
;
1933 for_each_template_parm (TREE_VEC_ELT (inner_args
, i
),
1934 &mark_template_parm
,
1937 for (i
= 0; i
< ntparms
; ++i
)
1938 if (tpd
.parms
[i
] == 0)
1940 /* One of the template parms was not used in the
1942 if (!did_error_intro
)
1944 cp_error ("template parameters not used in partial specialization:");
1945 did_error_intro
= 1;
1949 TREE_VALUE (TREE_VEC_ELT (inner_parms
, i
)));
1952 /* [temp.class.spec]
1954 The argument list of the specialization shall not be identical to
1955 the implicit argument list of the primary template. */
1956 if (comp_template_args (inner_args
,
1957 innermost_args (CLASSTYPE_TI_ARGS (TREE_TYPE
1959 cp_error ("partial specialization `%T' does not specialize any template arguments", type
);
1961 /* [temp.class.spec]
1963 A partially specialized non-type argument expression shall not
1964 involve template parameters of the partial specialization except
1965 when the argument expression is a simple identifier.
1967 The type of a template parameter corresponding to a specialized
1968 non-type argument shall not be dependent on a parameter of the
1970 my_friendly_assert (nargs
== DECL_NTPARMS (maintmpl
), 0);
1972 for (i
= 0; i
< nargs
; ++i
)
1974 tree arg
= TREE_VEC_ELT (inner_args
, i
);
1975 if (/* These first two lines are the `non-type' bit. */
1976 TREE_CODE_CLASS (TREE_CODE (arg
)) != 't'
1977 && TREE_CODE (arg
) != TEMPLATE_DECL
1978 /* This next line is the `argument expression is not just a
1979 simple identifier' condition and also the `specialized
1980 non-type argument' bit. */
1981 && TREE_CODE (arg
) != TEMPLATE_PARM_INDEX
)
1983 if (tpd
.arg_uses_template_parms
[i
])
1984 cp_error ("template argument `%E' involves template parameter(s)", arg
);
1987 /* Look at the corresponding template parameter,
1988 marking which template parameters its type depends
1991 TREE_TYPE (TREE_VALUE (TREE_VEC_ELT (main_inner_parms
,
1996 /* We haven't yet initialized TPD2. Do so now. */
1997 tpd2
.arg_uses_template_parms
1998 = (int*) alloca (sizeof (int) * nargs
);
1999 /* The number of paramters here is the number in the
2000 main template, which, as checked in the assertion
2002 tpd2
.parms
= (int*) alloca (sizeof (int) * nargs
);
2004 TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (maintmpl
));
2007 /* Mark the template paramters. But this time, we're
2008 looking for the template parameters of the main
2009 template, not in the specialization. */
2010 tpd2
.current_arg
= i
;
2011 tpd2
.arg_uses_template_parms
[i
] = 0;
2012 bzero (tpd2
.parms
, sizeof (int) * nargs
);
2013 for_each_template_parm (type
,
2014 &mark_template_parm
,
2017 if (tpd2
.arg_uses_template_parms
[i
])
2019 /* The type depended on some template parameters.
2020 If they are fully specialized in the
2021 specialization, that's OK. */
2023 for (j
= 0; j
< nargs
; ++j
)
2024 if (tpd2
.parms
[j
] != 0
2025 && tpd
.arg_uses_template_parms
[j
])
2027 cp_error ("type `%T' of template argument `%E' depends on template paramter(s)",
2037 if (retrieve_specialization (maintmpl
, specargs
))
2038 /* We've already got this specialization. */
2041 DECL_TEMPLATE_SPECIALIZATIONS (maintmpl
) = CLASSTYPE_TI_SPEC_INFO (type
)
2042 = perm_tree_cons (inner_args
, inner_parms
,
2043 DECL_TEMPLATE_SPECIALIZATIONS (maintmpl
));
2044 TREE_TYPE (DECL_TEMPLATE_SPECIALIZATIONS (maintmpl
)) = type
;
2048 /* Creates a TEMPLATE_DECL for the indicated DECL using the template
2049 parameters given by current_template_args, or reuses a
2050 previously existing one, if appropriate. Returns the DECL, or an
2051 equivalent one, if it is replaced via a call to duplicate_decls.
2053 If IS_FRIEND is non-zero, DECL is a friend declaration. */
2056 push_template_decl_real (decl
, is_friend
)
2066 is_friend
|= (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_FRIEND_P (decl
));
2069 /* For a friend, we want the context of the friend function, not
2070 the type of which it is a friend. */
2071 ctx
= DECL_CONTEXT (decl
);
2072 else if (DECL_REAL_CONTEXT (decl
)
2073 && TREE_CODE (DECL_REAL_CONTEXT (decl
)) != NAMESPACE_DECL
)
2074 /* In the case of a virtual function, we want the class in which
2076 ctx
= DECL_REAL_CONTEXT (decl
);
2078 /* Otherwise, if we're currently definining some class, the DECL
2079 is assumed to be a member of the class. */
2080 ctx
= current_class_type
;
2082 if (ctx
&& TREE_CODE (ctx
) == NAMESPACE_DECL
)
2085 if (!DECL_CONTEXT (decl
))
2086 DECL_CONTEXT (decl
) = FROB_CONTEXT (current_namespace
);
2088 /* For determining whether this is a primary template or not, we're really
2089 interested in the lexical context, not the true context. */
2091 info
= current_class_type
;
2095 if (info
&& TREE_CODE (info
) == FUNCTION_DECL
)
2097 /* Note that template_class_depth returns 0 if given NULL_TREE, so
2098 this next line works even when we are at global scope. */
2099 else if (processing_template_decl
> template_class_depth (info
))
2106 if (current_lang_name
== lang_name_c
)
2107 cp_error ("template with C linkage");
2108 if (TREE_CODE (decl
) == TYPE_DECL
&& ANON_AGGRNAME_P (DECL_NAME (decl
)))
2109 cp_error ("template class without a name");
2110 if (TREE_CODE (decl
) == TYPE_DECL
2111 && TREE_CODE (TREE_TYPE (decl
)) == ENUMERAL_TYPE
)
2112 cp_error ("template declaration of `%#T'", TREE_TYPE (decl
));
2115 /* Partial specialization. */
2116 if (TREE_CODE (decl
) == TYPE_DECL
&& DECL_ARTIFICIAL (decl
)
2117 && TREE_CODE (TREE_TYPE (decl
)) != ENUMERAL_TYPE
2118 && CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_TYPE (decl
)))
2119 return process_partial_specialization (decl
);
2121 args
= current_template_args ();
2124 || TREE_CODE (ctx
) == FUNCTION_DECL
2125 || TYPE_BEING_DEFINED (ctx
)
2126 || (is_friend
&& !DECL_TEMPLATE_INFO (decl
)))
2128 if (DECL_LANG_SPECIFIC (decl
)
2129 && DECL_TEMPLATE_INFO (decl
)
2130 && DECL_TI_TEMPLATE (decl
))
2131 tmpl
= DECL_TI_TEMPLATE (decl
);
2134 tmpl
= build_template_decl (decl
, current_template_parms
);
2136 if (DECL_LANG_SPECIFIC (decl
)
2137 && DECL_TEMPLATE_SPECIALIZATION (decl
))
2139 /* A specialization of a member template of a template
2141 SET_DECL_TEMPLATE_SPECIALIZATION (tmpl
);
2142 DECL_TEMPLATE_INFO (tmpl
) = DECL_TEMPLATE_INFO (decl
);
2143 DECL_TEMPLATE_INFO (decl
) = NULL_TREE
;
2152 if (CLASSTYPE_TEMPLATE_INSTANTIATION (ctx
))
2153 cp_error ("must specialize `%#T' before defining member `%#D'",
2155 if (TREE_CODE (decl
) == TYPE_DECL
)
2157 if ((IS_AGGR_TYPE_CODE (TREE_CODE (TREE_TYPE (decl
)))
2158 || TREE_CODE (TREE_TYPE (decl
)) == ENUMERAL_TYPE
)
2159 && TYPE_TEMPLATE_INFO (TREE_TYPE (decl
))
2160 && TYPE_TI_TEMPLATE (TREE_TYPE (decl
)))
2161 tmpl
= TYPE_TI_TEMPLATE (TREE_TYPE (decl
));
2164 cp_error ("`%D' does not declare a template type", decl
);
2168 else if (! DECL_TEMPLATE_INFO (decl
))
2170 cp_error ("template definition of non-template `%#D'", decl
);
2174 tmpl
= DECL_TI_TEMPLATE (decl
);
2176 if (is_member_template (tmpl
) || is_member_template_class (tmpl
))
2178 if (DECL_FUNCTION_TEMPLATE_P (tmpl
)
2179 && DECL_TEMPLATE_INFO (decl
) && DECL_TI_ARGS (decl
)
2180 && DECL_TEMPLATE_SPECIALIZATION (decl
))
2184 /* The declaration is a specialization of a member
2185 template, declared outside the class. Therefore, the
2186 innermost template arguments will be NULL, so we
2187 replace them with the arguments determined by the
2188 earlier call to check_explicit_specialization. */
2189 args
= DECL_TI_ARGS (decl
);
2192 = build_template_decl (decl
, current_template_parms
);
2193 DECL_TEMPLATE_RESULT (new_tmpl
) = decl
;
2194 TREE_TYPE (new_tmpl
) = TREE_TYPE (decl
);
2195 DECL_TI_TEMPLATE (decl
) = new_tmpl
;
2196 SET_DECL_TEMPLATE_SPECIALIZATION (new_tmpl
);
2197 DECL_TEMPLATE_INFO (new_tmpl
) =
2198 perm_tree_cons (tmpl
, args
, NULL_TREE
);
2200 register_specialization (new_tmpl
, tmpl
, args
);
2204 a
= innermost_args (args
);
2205 t
= DECL_INNERMOST_TEMPLATE_PARMS (tmpl
);
2206 if (TREE_VEC_LENGTH (t
) != TREE_VEC_LENGTH (a
))
2208 cp_error ("got %d template parameters for `%#D'",
2209 TREE_VEC_LENGTH (a
), decl
);
2210 cp_error (" but %d required", TREE_VEC_LENGTH (t
));
2212 if (TMPL_ARGS_DEPTH (args
) > 1)
2213 /* Get the template parameters for the enclosing template
2215 a
= TMPL_ARGS_LEVEL (args
, TMPL_ARGS_DEPTH (args
) - 1);
2220 a
= innermost_args (args
);
2224 if (CLASSTYPE_TEMPLATE_SPECIALIZATION (ctx
))
2226 /* When processing an inline member template of a
2227 specialized class, there is no CLASSTYPE_TI_SPEC_INFO. */
2228 if (CLASSTYPE_TI_SPEC_INFO (ctx
))
2229 t
= TREE_VALUE (CLASSTYPE_TI_SPEC_INFO (ctx
));
2231 else if (CLASSTYPE_TEMPLATE_INFO (ctx
))
2232 t
= DECL_INNERMOST_TEMPLATE_PARMS (CLASSTYPE_TI_TEMPLATE (ctx
));
2234 /* There should be template arguments if and only if there is a
2236 my_friendly_assert((a
!= NULL_TREE
) == (t
!= NULL_TREE
), 0);
2239 && TREE_VEC_LENGTH (t
) != TREE_VEC_LENGTH (a
))
2241 cp_error ("got %d template parameters for `%#D'",
2242 TREE_VEC_LENGTH (a
), decl
);
2243 cp_error (" but `%#T' has %d", ctx
, TREE_VEC_LENGTH (t
));
2247 DECL_TEMPLATE_RESULT (tmpl
) = decl
;
2248 TREE_TYPE (tmpl
) = TREE_TYPE (decl
);
2250 /* Push template declarations for global functions and types. Note
2251 that we do not try to push a global template friend declared in a
2252 template class; such a thing may well depend on the template
2253 parameters of the class. */
2255 && !(is_friend
&& template_class_depth (current_class_type
) > 0))
2256 tmpl
= pushdecl_namespace_level (tmpl
);
2259 DECL_PRIMARY_TEMPLATE (tmpl
) = tmpl
;
2261 info
= perm_tree_cons (tmpl
, args
, NULL_TREE
);
2263 if (TREE_CODE (decl
) == TYPE_DECL
&& DECL_ARTIFICIAL (decl
))
2265 SET_TYPE_TEMPLATE_INFO (TREE_TYPE (tmpl
), info
);
2266 if ((!ctx
|| TREE_CODE (ctx
) != FUNCTION_DECL
)
2267 && TREE_CODE (TREE_TYPE (decl
)) != ENUMERAL_TYPE
)
2268 DECL_NAME (decl
) = classtype_mangled_name (TREE_TYPE (decl
));
2270 else if (! DECL_LANG_SPECIFIC (decl
))
2271 cp_error ("template declaration of `%#D'", decl
);
2273 DECL_TEMPLATE_INFO (decl
) = info
;
2275 return DECL_TEMPLATE_RESULT (tmpl
);
2279 push_template_decl (decl
)
2282 return push_template_decl_real (decl
, 0);
2285 /* Called when a class template TYPE is redeclared with the indicated
2286 template PARMS, e.g.:
2288 template <class T> struct S;
2289 template <class T> struct S {}; */
2292 redeclare_class_template (type
, parms
)
2296 tree tmpl
= CLASSTYPE_TI_TEMPLATE (type
);
2300 if (!PRIMARY_TEMPLATE_P (tmpl
))
2301 /* The type is nested in some template class. Nothing to worry
2302 about here; there are no new template parameters for the nested
2306 parms
= INNERMOST_TEMPLATE_PARMS (parms
);
2307 tmpl_parms
= DECL_INNERMOST_TEMPLATE_PARMS (tmpl
);
2309 if (TREE_VEC_LENGTH (parms
) != TREE_VEC_LENGTH (tmpl_parms
))
2311 cp_error_at ("previous declaration `%D'", tmpl
);
2312 cp_error ("used %d template parameter%s instead of %d",
2313 TREE_VEC_LENGTH (tmpl_parms
),
2314 TREE_VEC_LENGTH (tmpl_parms
) == 1 ? "" : "s",
2315 TREE_VEC_LENGTH (parms
));
2319 for (i
= 0; i
< TREE_VEC_LENGTH (tmpl_parms
); ++i
)
2321 tree tmpl_parm
= TREE_VALUE (TREE_VEC_ELT (tmpl_parms
, i
));
2322 tree parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
2323 tree tmpl_default
= TREE_PURPOSE (TREE_VEC_ELT (tmpl_parms
, i
));
2324 tree parm_default
= TREE_PURPOSE (TREE_VEC_ELT (parms
, i
));
2326 if (TREE_CODE (tmpl_parm
) != TREE_CODE (parm
))
2328 cp_error_at ("template parameter `%#D'", tmpl_parm
);
2329 cp_error ("redeclared here as `%#D'", parm
);
2333 if (tmpl_default
!= NULL_TREE
&& parm_default
!= NULL_TREE
)
2335 /* We have in [temp.param]:
2337 A template-parameter may not be given default arguments
2338 by two different declarations in the same scope. */
2339 cp_error ("redefinition of default argument for `%#D'", parm
);
2340 cp_error_at (" original definition appeared here", tmpl_parm
);
2344 if (parm_default
!= NULL_TREE
)
2345 /* Update the previous template parameters (which are the ones
2346 that will really count) with the new default value. */
2347 TREE_PURPOSE (TREE_VEC_ELT (tmpl_parms
, i
)) = parm_default
;
2351 /* Attempt to convert the non-type template parameter EXPR to the
2352 indicated TYPE. If the conversion is successful, return the
2353 converted value. If the conversion is unsuccesful, return
2354 NULL_TREE if we issued an error message, or error_mark_node if we
2355 did not. We issue error messages for out-and-out bad template
2356 parameters, but not simply because the conversion failed, since we
2357 might be just trying to do argument deduction. By the time this
2358 function is called, neither TYPE nor EXPR may make use of template
2362 convert_nontype_argument (type
, expr
)
2366 tree expr_type
= TREE_TYPE (expr
);
2368 /* A template-argument for a non-type, non-template
2369 template-parameter shall be one of:
2371 --an integral constant-expression of integral or enumeration
2374 --the name of a non-type template-parameter; or
2376 --the name of an object or function with external linkage,
2377 including function templates and function template-ids but
2378 excluding non-static class members, expressed as id-expression;
2381 --the address of an object or function with external linkage,
2382 including function templates and function template-ids but
2383 excluding non-static class members, expressed as & id-expression
2384 where the & is optional if the name refers to a function or
2387 --a pointer to member expressed as described in _expr.unary.op_. */
2389 /* An integral constant-expression can include const variables
2391 if (INTEGRAL_TYPE_P (expr_type
) && TREE_READONLY_DECL_P (expr
))
2392 expr
= decl_constant_value (expr
);
2394 if (is_overloaded_fn (expr
))
2395 /* OK for now. We'll check that it has external linkage later.
2396 Check this first since if expr_type is the unknown_type_node
2397 we would otherwise complain below. */
2399 else if (INTEGRAL_TYPE_P (expr_type
)
2400 || TYPE_PTRMEM_P (expr_type
)
2401 || TYPE_PTRMEMFUNC_P (expr_type
)
2402 /* The next two are g++ extensions. */
2403 || TREE_CODE (expr_type
) == REAL_TYPE
2404 || TREE_CODE (expr_type
) == COMPLEX_TYPE
)
2406 if (! TREE_CONSTANT (expr
))
2409 cp_error ("non-constant `%E' cannot be used as template argument",
2414 else if (TYPE_PTR_P (expr_type
)
2415 /* If expr is the address of an overloaded function, we
2416 will get the unknown_type_node at this point. */
2417 || expr_type
== unknown_type_node
)
2423 if (TREE_CODE (e
) != ADDR_EXPR
)
2426 cp_error ("`%E' is not a valid template argument", expr
);
2427 error ("it must be %s%s with external linkage",
2428 TREE_CODE (TREE_TYPE (expr
)) == POINTER_TYPE
2429 ? "a pointer to " : "",
2430 TREE_CODE (TREE_TYPE (TREE_TYPE (expr
))) == FUNCTION_TYPE
2431 ? "a function" : "an object");
2435 referent
= TREE_OPERAND (e
, 0);
2436 STRIP_NOPS (referent
);
2438 if (TREE_CODE (referent
) == STRING_CST
)
2440 cp_error ("string literal %E is not a valid template argument",
2442 error ("because it is the address of an object with static linkage");
2446 if (is_overloaded_fn (referent
))
2447 /* We'll check that it has external linkage later. */
2449 else if (TREE_CODE (referent
) != VAR_DECL
)
2451 else if (!TREE_PUBLIC (referent
))
2453 cp_error ("address of non-extern `%E' cannot be used as template argument", referent
);
2454 return error_mark_node
;
2457 else if (TREE_CODE (expr
) == VAR_DECL
)
2459 if (!TREE_PUBLIC (expr
))
2464 cp_error ("object `%E' cannot be used as template argument", expr
);
2468 switch (TREE_CODE (type
))
2473 /* For a non-type template-parameter of integral or enumeration
2474 type, integral promotions (_conv.prom_) and integral
2475 conversions (_conv.integral_) are applied. */
2476 if (!INTEGRAL_TYPE_P (expr_type
))
2477 return error_mark_node
;
2479 /* It's safe to call digest_init in this case; we know we're
2480 just converting one integral constant expression to another. */
2481 expr
= digest_init (type
, expr
, (tree
*) 0);
2483 if (TREE_CODE (expr
) != INTEGER_CST
)
2484 /* Curiously, some TREE_CONSTNAT integral expressions do not
2485 simplify to integer constants. For example, `3 % 0',
2486 remains a TRUNC_MOD_EXPR. */
2493 /* These are g++ extensions. */
2494 if (TREE_CODE (expr_type
) != TREE_CODE (type
))
2495 return error_mark_node
;
2497 expr
= digest_init (type
, expr
, (tree
*) 0);
2499 if (TREE_CODE (expr
) != REAL_CST
)
2506 tree type_pointed_to
= TREE_TYPE (type
);
2508 if (TYPE_PTRMEM_P (type
))
2509 /* For a non-type template-parameter of type pointer to data
2510 member, qualification conversions (_conv.qual_) are
2512 return perform_qualification_conversions (type
, expr
);
2513 else if (TREE_CODE (type_pointed_to
) == FUNCTION_TYPE
)
2515 /* For a non-type template-parameter of type pointer to
2516 function, only the function-to-pointer conversion
2517 (_conv.func_) is applied. If the template-argument
2518 represents a set of overloaded functions (or a pointer to
2519 such), the matching function is selected from the set
2524 if (TREE_CODE (expr
) == ADDR_EXPR
)
2525 fns
= TREE_OPERAND (expr
, 0);
2529 fn
= instantiate_type (type_pointed_to
, fns
, 0);
2531 if (fn
== error_mark_node
)
2532 return error_mark_node
;
2534 if (!TREE_PUBLIC (fn
))
2536 if (really_overloaded_fn (fns
))
2537 return error_mark_node
;
2542 expr
= build_unary_op (ADDR_EXPR
, fn
, 0);
2544 my_friendly_assert (comptypes (type
, TREE_TYPE (expr
), 1),
2550 /* For a non-type template-parameter of type pointer to
2551 object, qualification conversions (_conv.qual_) and the
2552 array-to-pointer conversion (_conv.array_) are applied.
2553 [Note: In particular, neither the null pointer conversion
2554 (_conv.ptr_) nor the derived-to-base conversion
2555 (_conv.ptr_) are applied. Although 0 is a valid
2556 template-argument for a non-type template-parameter of
2557 integral type, it is not a valid template-argument for a
2558 non-type template-parameter of pointer type.]
2560 The call to decay_conversion performs the
2561 array-to-pointer conversion, if appropriate. */
2562 expr
= decay_conversion (expr
);
2564 if (expr
== error_mark_node
)
2565 return error_mark_node
;
2567 return perform_qualification_conversions (type
, expr
);
2572 case REFERENCE_TYPE
:
2574 tree type_referred_to
= TREE_TYPE (type
);
2576 if (TREE_CODE (type_referred_to
) == FUNCTION_TYPE
)
2578 /* For a non-type template-parameter of type reference to
2579 function, no conversions apply. If the
2580 template-argument represents a set of overloaded
2581 functions, the matching function is selected from the
2582 set (_over.over_). */
2586 fn
= instantiate_type (type_referred_to
, fns
, 0);
2588 if (!TREE_PUBLIC (fn
))
2590 if (really_overloaded_fn (fns
))
2591 /* Don't issue an error here; we might get a different
2592 function if the overloading had worked out
2594 return error_mark_node
;
2599 if (fn
== error_mark_node
)
2600 return error_mark_node
;
2602 my_friendly_assert (comptypes (type
, TREE_TYPE (fn
), 1),
2609 /* For a non-type template-parameter of type reference to
2610 object, no conversions apply. The type referred to by the
2611 reference may be more cv-qualified than the (otherwise
2612 identical) type of the template-argument. The
2613 template-parameter is bound directly to the
2614 template-argument, which must be an lvalue. */
2615 if (!comptypes (TYPE_MAIN_VARIANT (expr_type
),
2616 TYPE_MAIN_VARIANT (type
), 1)
2617 || (TYPE_READONLY (expr_type
) >
2618 TYPE_READONLY (type_referred_to
))
2619 || (TYPE_VOLATILE (expr_type
) >
2620 TYPE_VOLATILE (type_referred_to
))
2621 || !real_lvalue_p (expr
))
2622 return error_mark_node
;
2634 if (!TYPE_PTRMEMFUNC_P (type
))
2635 /* This handles templates like
2636 template<class T, T t> void f();
2637 when T is substituted with any class. The second template
2638 parameter becomes invalid and the template candidate is
2640 return error_mark_node
;
2642 /* For a non-type template-parameter of type pointer to member
2643 function, no conversions apply. If the template-argument
2644 represents a set of overloaded member functions, the
2645 matching member function is selected from the set
2648 if (!TYPE_PTRMEMFUNC_P (expr_type
) &&
2649 expr_type
!= unknown_type_node
)
2650 return error_mark_node
;
2652 if (TREE_CODE (expr
) == CONSTRUCTOR
)
2654 /* A ptr-to-member constant. */
2655 if (!comptypes (type
, expr_type
, 1))
2656 return error_mark_node
;
2661 if (TREE_CODE (expr
) != ADDR_EXPR
)
2662 return error_mark_node
;
2664 fns
= TREE_OPERAND (expr
, 0);
2666 fn
= instantiate_type (TREE_TYPE (TREE_TYPE (type
)),
2669 if (fn
== error_mark_node
)
2670 return error_mark_node
;
2672 expr
= build_unary_op (ADDR_EXPR
, fn
, 0);
2674 my_friendly_assert (comptypes (type
, TREE_TYPE (expr
), 1),
2681 /* All non-type parameters must have one of these types. */
2682 my_friendly_abort (0);
2686 return error_mark_node
;
2689 /* Return 1 if PARM_PARMS and ARG_PARMS matches using rule for
2690 template template parameters. Both PARM_PARMS and ARG_PARMS are
2691 vectors of TREE_LIST nodes containing TYPE_DECL, TEMPLATE_DECL
2694 ARG_PARMS may contain more parameters than PARM_PARMS. If this is
2695 the case, then extra parameters must have default arguments.
2697 Consider the example:
2698 template <class T, class Allocator = allocator> class vector;
2699 template<template <class U> class TT> class C;
2701 C<vector> is a valid instantiation. PARM_PARMS for the above code
2702 contains a TYPE_DECL (for U), ARG_PARMS contains two TYPE_DECLs (for
2703 T and Allocator) and OUTER_ARGS contains the argument that is used to
2704 substitute the TT parameter. */
2707 coerce_template_template_parms (parm_parms
, arg_parms
, in_decl
, outer_args
)
2708 tree parm_parms
, arg_parms
, in_decl
, outer_args
;
2710 int nparms
, nargs
, i
;
2713 my_friendly_assert (TREE_CODE (parm_parms
) == TREE_VEC
, 0);
2714 my_friendly_assert (TREE_CODE (arg_parms
) == TREE_VEC
, 0);
2716 nparms
= TREE_VEC_LENGTH (parm_parms
);
2717 nargs
= TREE_VEC_LENGTH (arg_parms
);
2719 /* The rule here is opposite of coerce_template_parms. */
2722 && TREE_PURPOSE (TREE_VEC_ELT (arg_parms
, nparms
)) == NULL_TREE
))
2725 for (i
= 0; i
< nparms
; ++i
)
2727 parm
= TREE_VALUE (TREE_VEC_ELT (parm_parms
, i
));
2728 arg
= TREE_VALUE (TREE_VEC_ELT (arg_parms
, i
));
2730 if (arg
== NULL_TREE
|| arg
== error_mark_node
2731 || parm
== NULL_TREE
|| parm
== error_mark_node
)
2734 if (TREE_CODE (arg
) != TREE_CODE (parm
))
2737 switch (TREE_CODE (parm
))
2743 /* We encounter instantiations of templates like
2744 template <template <template <class> class> class TT>
2746 sorry ("nested template template parameter");
2750 /* The tsubst call is used to handle cases such as
2751 template <class T, template <T> class TT> class D;
2752 i.e. the parameter list of TT depends on earlier parameters. */
2753 if (!comptypes (tsubst (TREE_TYPE (parm
), outer_args
, in_decl
),
2754 TREE_TYPE (arg
), 1))
2759 my_friendly_abort (0);
2765 /* Convert the indicated template ARG as necessary to match the
2766 indicated template PARM. Returns the converted ARG, or
2767 error_mark_node if the conversion was unsuccessful. Error messages
2768 are issued if COMPLAIN is non-zero. This conversion is for the Ith
2769 parameter in the parameter list. ARGS is the full set of template
2770 arguments deduced so far. */
2773 convert_template_argument (parm
, arg
, args
, complain
, i
, in_decl
)
2783 int is_type
, requires_type
, is_tmpl_type
, requires_tmpl_type
;
2785 inner_args
= innermost_args (args
);
2787 if (TREE_CODE (arg
) == TREE_LIST
2788 && TREE_TYPE (arg
) != NULL_TREE
2789 && TREE_CODE (TREE_TYPE (arg
)) == OFFSET_TYPE
)
2791 /* The template argument was the name of some
2792 member function. That's usually
2793 illegal, but static members are OK. In any
2794 case, grab the underlying fields/functions
2795 and issue an error later if required. */
2796 arg
= TREE_VALUE (arg
);
2797 TREE_TYPE (arg
) = unknown_type_node
;
2800 requires_tmpl_type
= TREE_CODE (parm
) == TEMPLATE_DECL
;
2801 requires_type
= (TREE_CODE (parm
) == TYPE_DECL
2802 || requires_tmpl_type
);
2804 /* Check if it is a class template. If REQUIRES_TMPL_TYPE is true,
2805 we also accept implicitly created TYPE_DECL as a valid argument.
2806 This is necessary to handle the case where we pass a template name
2807 to a template template parameter in a scope where we've derived from
2808 in instantiation of that template, so the template name refers to that
2809 instantiation. We really ought to handle this better. */
2811 = ((TREE_CODE (arg
) == TEMPLATE_DECL
2812 && TREE_CODE (DECL_TEMPLATE_RESULT (arg
)) == TYPE_DECL
)
2813 || (TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
2814 && !CLASSTYPE_TEMPLATE_INFO (arg
))
2815 || (TREE_CODE (arg
) == RECORD_TYPE
2816 && CLASSTYPE_TEMPLATE_INFO (arg
)
2817 && TREE_CODE (TYPE_NAME (arg
)) == TYPE_DECL
2818 && DECL_ARTIFICIAL (TYPE_NAME (arg
))
2819 && requires_tmpl_type
2820 && is_base_of_enclosing_class (arg
, current_class_type
)));
2821 if (is_tmpl_type
&& TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
)
2822 arg
= TYPE_STUB_DECL (arg
);
2823 else if (is_tmpl_type
&& TREE_CODE (arg
) == RECORD_TYPE
)
2824 arg
= CLASSTYPE_TI_TEMPLATE (arg
);
2826 is_type
= TREE_CODE_CLASS (TREE_CODE (arg
)) == 't' || is_tmpl_type
;
2828 if (requires_type
&& ! is_type
&& TREE_CODE (arg
) == SCOPE_REF
2829 && TREE_CODE (TREE_OPERAND (arg
, 0)) == TEMPLATE_TYPE_PARM
)
2831 cp_pedwarn ("to refer to a type member of a template parameter,");
2832 cp_pedwarn (" use `typename %E'", arg
);
2834 arg
= make_typename_type (TREE_OPERAND (arg
, 0),
2835 TREE_OPERAND (arg
, 1));
2838 if (is_type
!= requires_type
)
2844 cp_error ("type/value mismatch at argument %d in template parameter list for `%D'",
2847 cp_error (" expected a constant of type `%T', got `%T'",
2849 (is_tmpl_type
? DECL_NAME (arg
) : arg
));
2851 cp_error (" expected a type, got `%E'", arg
);
2854 return error_mark_node
;
2856 if (is_tmpl_type
^ requires_tmpl_type
)
2858 if (in_decl
&& complain
)
2860 cp_error ("type/value mismatch at argument %d in template parameter list for `%D'",
2863 cp_error (" expected a type, got `%T'", DECL_NAME (arg
));
2865 cp_error (" expected a class template, got `%T'", arg
);
2867 return error_mark_node
;
2872 if (requires_tmpl_type
)
2874 tree parmparm
= DECL_INNERMOST_TEMPLATE_PARMS (parm
);
2875 tree argparm
= DECL_INNERMOST_TEMPLATE_PARMS (arg
);
2877 if (coerce_template_template_parms (parmparm
, argparm
,
2878 in_decl
, inner_args
))
2882 /* TEMPLATE_TEMPLATE_PARM node is preferred over
2884 if (val
!= error_mark_node
2885 && DECL_TEMPLATE_TEMPLATE_PARM_P (val
))
2886 val
= TREE_TYPE (val
);
2890 if (in_decl
&& complain
)
2892 cp_error ("type/value mismatch at argument %d in template parameter list for `%D'",
2894 cp_error (" expected a template of type `%D', got `%D'", parm
, arg
);
2897 val
= error_mark_node
;
2902 val
= groktypename (arg
);
2903 if (! processing_template_decl
)
2905 /* [basic.link]: A name with no linkage (notably, the
2906 name of a class or enumeration declared in a local
2907 scope) shall not be used to declare an entity with
2908 linkage. This implies that names with no linkage
2909 cannot be used as template arguments. */
2910 tree t
= no_linkage_check (val
);
2913 if (ANON_AGGRNAME_P (TYPE_IDENTIFIER (t
)))
2915 ("template-argument `%T' uses anonymous type", val
);
2918 ("template-argument `%T' uses local type `%T'",
2920 return error_mark_node
;
2927 tree t
= tsubst (TREE_TYPE (parm
), args
, in_decl
);
2929 if (processing_template_decl
)
2930 arg
= maybe_fold_nontype_arg (arg
);
2932 if (!uses_template_parms (arg
) && !uses_template_parms (t
))
2933 /* We used to call digest_init here. However, digest_init
2934 will report errors, which we don't want when complain
2935 is zero. More importantly, digest_init will try too
2936 hard to convert things: for example, `0' should not be
2937 converted to pointer type at this point according to
2938 the standard. Accepting this is not merely an
2939 extension, since deciding whether or not these
2940 conversions can occur is part of determining which
2941 function template to call, or whether a given epxlicit
2942 argument specification is legal. */
2943 val
= convert_nontype_argument (t
, arg
);
2947 if (val
== NULL_TREE
)
2948 val
= error_mark_node
;
2949 else if (val
== error_mark_node
&& complain
)
2950 cp_error ("could not convert template argument `%E' to `%T'",
2957 /* Convert all template arguments to their appropriate types, and
2958 return a vector containing the innermost resulting template
2959 arguments. If any error occurs, return error_mark_node, and, if
2960 COMPLAIN is non-zero, issue an error message. Some error messages
2961 are issued even if COMPLAIN is zero; for instance, if a template
2962 argument is composed from a local class.
2964 If REQUIRE_ALL_ARGUMENTS is non-zero, all arguments must be
2965 provided in ARGLIST, or else trailing parameters must have default
2966 values. If REQUIRE_ALL_ARGUMENTS is zero, we will attempt argument
2967 deduction for any unspecified trailing arguments.
2969 The resulting TREE_VEC is allocated on a temporary obstack, and
2970 must be explicitly copied if it will be permanent. */
2973 coerce_template_parms (parms
, args
, in_decl
,
2975 require_all_arguments
)
2979 int require_all_arguments
;
2981 int nparms
, nargs
, i
, lost
= 0;
2984 tree new_inner_args
;
2986 inner_args
= innermost_args (args
);
2987 nargs
= NUM_TMPL_ARGS (inner_args
);
2988 nparms
= TREE_VEC_LENGTH (parms
);
2992 && require_all_arguments
2993 && TREE_PURPOSE (TREE_VEC_ELT (parms
, nargs
)) == NULL_TREE
))
2997 cp_error ("wrong number of template arguments (%d, should be %d)",
3001 cp_error_at ("provided for `%D'", in_decl
);
3004 return error_mark_node
;
3007 new_inner_args
= make_temp_vec (nparms
);
3008 new_args
= add_outermost_template_args (args
, new_inner_args
);
3009 for (i
= 0; i
< nparms
; i
++)
3014 /* Get the Ith template parameter. */
3015 parm
= TREE_VEC_ELT (parms
, i
);
3017 /* Calculate the Ith argument. */
3018 if (inner_args
&& TREE_CODE (inner_args
) == TREE_LIST
)
3020 arg
= TREE_VALUE (inner_args
);
3021 inner_args
= TREE_CHAIN (inner_args
);
3024 arg
= TREE_VEC_ELT (inner_args
, i
);
3025 /* If no template argument was supplied, look for a default
3027 else if (TREE_PURPOSE (parm
) == NULL_TREE
)
3029 /* There was no default value. */
3030 my_friendly_assert (!require_all_arguments
, 0);
3033 else if (TREE_CODE (TREE_VALUE (parm
)) == TYPE_DECL
)
3034 arg
= tsubst (TREE_PURPOSE (parm
), new_args
, in_decl
);
3036 arg
= tsubst_expr (TREE_PURPOSE (parm
), new_args
, in_decl
);
3038 /* Now, convert the Ith argument, as necessary. */
3039 if (arg
== NULL_TREE
)
3040 /* We're out of arguments. */
3042 my_friendly_assert (!require_all_arguments
, 0);
3045 else if (arg
== error_mark_node
)
3047 cp_error ("template argument %d is invalid", i
+ 1);
3048 arg
= error_mark_node
;
3051 arg
= convert_template_argument (TREE_VALUE (parm
),
3052 arg
, new_args
, complain
, i
,
3055 if (arg
== error_mark_node
)
3057 TREE_VEC_ELT (new_inner_args
, i
) = arg
;
3061 return error_mark_node
;
3063 return new_inner_args
;
3066 /* Returns 1 if template args OT and NT are equivalent. */
3069 template_args_equal (ot
, nt
)
3074 if (TREE_CODE (nt
) != TREE_CODE (ot
))
3076 if (TREE_CODE (nt
) == TREE_VEC
)
3077 /* For member templates */
3078 return comp_template_args (ot
, nt
);
3079 else if (TREE_CODE_CLASS (TREE_CODE (ot
)) == 't')
3080 return comptypes (ot
, nt
, 1);
3082 return (cp_tree_equal (ot
, nt
) > 0);
3085 /* Returns 1 iff the OLDARGS and NEWARGS are in fact identical sets
3086 of template arguments. Returns 0 otherwise. */
3089 comp_template_args (oldargs
, newargs
)
3090 tree oldargs
, newargs
;
3094 if (TREE_VEC_LENGTH (oldargs
) != TREE_VEC_LENGTH (newargs
))
3097 for (i
= 0; i
< TREE_VEC_LENGTH (oldargs
); ++i
)
3099 tree nt
= TREE_VEC_ELT (newargs
, i
);
3100 tree ot
= TREE_VEC_ELT (oldargs
, i
);
3102 if (! template_args_equal (ot
, nt
))
3108 /* Given class template name and parameter list, produce a user-friendly name
3109 for the instantiation. */
3112 mangle_class_name_for_template (name
, parms
, arglist
)
3114 tree parms
, arglist
;
3116 static struct obstack scratch_obstack
;
3117 static char *scratch_firstobj
;
3120 if (!scratch_firstobj
)
3121 gcc_obstack_init (&scratch_obstack
);
3123 obstack_free (&scratch_obstack
, scratch_firstobj
);
3124 scratch_firstobj
= obstack_alloc (&scratch_obstack
, 1);
3126 #define ccat(c) obstack_1grow (&scratch_obstack, (c));
3127 #define cat(s) obstack_grow (&scratch_obstack, (s), strlen (s))
3131 nparms
= TREE_VEC_LENGTH (parms
);
3132 arglist
= innermost_args (arglist
);
3133 my_friendly_assert (nparms
== TREE_VEC_LENGTH (arglist
), 268);
3134 for (i
= 0; i
< nparms
; i
++)
3136 tree parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
3137 tree arg
= TREE_VEC_ELT (arglist
, i
);
3142 if (TREE_CODE (parm
) == TYPE_DECL
)
3144 cat (type_as_string_real (arg
, 0, 1));
3147 else if (TREE_CODE (parm
) == TEMPLATE_DECL
)
3149 if (TREE_CODE (arg
) == TEMPLATE_DECL
)
3151 /* Already substituted with real template. Just output
3152 the template name here */
3153 tree context
= DECL_CONTEXT (arg
);
3156 my_friendly_assert (TREE_CODE (context
) == NAMESPACE_DECL
, 980422);
3157 cat(decl_as_string (DECL_CONTEXT (arg
), 0));
3160 cat (IDENTIFIER_POINTER (DECL_NAME (arg
)));
3163 /* Output the parameter declaration */
3164 cat (type_as_string_real (arg
, 0, 1));
3168 my_friendly_assert (TREE_CODE (parm
) == PARM_DECL
, 269);
3170 if (TREE_CODE (arg
) == TREE_LIST
)
3172 /* New list cell was built because old chain link was in
3174 my_friendly_assert (TREE_PURPOSE (arg
) == NULL_TREE
, 270);
3175 arg
= TREE_VALUE (arg
);
3177 /* No need to check arglist against parmlist here; we did that
3178 in coerce_template_parms, called from lookup_template_class. */
3179 cat (expr_as_string (arg
, 0));
3182 char *bufp
= obstack_next_free (&scratch_obstack
);
3184 while (bufp
[offset
- 1] == ' ')
3186 obstack_blank_fast (&scratch_obstack
, offset
);
3188 /* B<C<char> >, not B<C<char>> */
3189 if (bufp
[offset
- 1] == '>')
3194 return (char *) obstack_base (&scratch_obstack
);
3198 classtype_mangled_name (t
)
3201 if (CLASSTYPE_TEMPLATE_INFO (t
)
3202 /* Specializations have already had their names set up in
3203 lookup_template_class. */
3204 && !CLASSTYPE_TEMPLATE_SPECIALIZATION (t
)
3205 /* For non-primary templates, the template parameters are
3206 implicit from their surrounding context. */
3207 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (t
)))
3209 tree name
= DECL_NAME (CLASSTYPE_TI_TEMPLATE (t
));
3210 char *mangled_name
= mangle_class_name_for_template
3211 (IDENTIFIER_POINTER (name
),
3212 DECL_INNERMOST_TEMPLATE_PARMS (CLASSTYPE_TI_TEMPLATE (t
)),
3213 CLASSTYPE_TI_ARGS (t
));
3214 tree id
= get_identifier (mangled_name
);
3215 IDENTIFIER_TEMPLATE (id
) = name
;
3219 return TYPE_IDENTIFIER (t
);
3223 add_pending_template (d
)
3228 if (TREE_CODE_CLASS (TREE_CODE (d
)) == 't')
3229 ti
= CLASSTYPE_TEMPLATE_INFO (d
);
3231 ti
= DECL_TEMPLATE_INFO (d
);
3233 if (TI_PENDING_TEMPLATE_FLAG (ti
))
3236 *template_tail
= perm_tree_cons
3237 (build_srcloc_here (), d
, NULL_TREE
);
3238 template_tail
= &TREE_CHAIN (*template_tail
);
3239 TI_PENDING_TEMPLATE_FLAG (ti
) = 1;
3243 /* Return a TEMPLATE_ID_EXPR corresponding to the indicated FNS (which
3244 may be either a _DECL or an overloaded function or an
3245 IDENTIFIER_NODE), and ARGLIST. */
3248 lookup_template_function (fns
, arglist
)
3253 if (fns
== NULL_TREE
)
3255 cp_error ("non-template used as template");
3256 return error_mark_node
;
3259 type
= TREE_TYPE (fns
);
3260 if (TREE_CODE (fns
) == OVERLOAD
|| !type
)
3261 type
= unknown_type_node
;
3263 if (processing_template_decl
)
3264 return build_min (TEMPLATE_ID_EXPR
, type
, fns
, arglist
);
3266 return build (TEMPLATE_ID_EXPR
, type
, fns
, arglist
);
3269 /* Within the scope of a template class S<T>, the name S gets bound
3270 (in build_self_reference) to a TYPE_DECL for the class, not a
3271 TEMPLATE_DECL. If DECL is a TYPE_DECL for current_class_type,
3272 or one of its enclosing classes, and that type is a template,
3273 return the associated TEMPLATE_DECL. Otherwise, the original
3274 DECL is returned. */
3277 maybe_get_template_decl_from_type_decl (decl
)
3280 return (decl
!= NULL_TREE
3281 && TREE_CODE (decl
) == TYPE_DECL
3282 && DECL_ARTIFICIAL (decl
)
3283 && CLASSTYPE_TEMPLATE_INFO (TREE_TYPE (decl
)))
3284 ? CLASSTYPE_TI_TEMPLATE (TREE_TYPE (decl
)) : decl
;
3287 /* Given an IDENTIFIER_NODE (type TEMPLATE_DECL) and a chain of
3288 parameters, find the desired type.
3290 D1 is the PTYPENAME terminal, and ARGLIST is the list of arguments.
3291 (Actually ARGLIST may be either a TREE_LIST or a TREE_VEC. It will
3292 be a TREE_LIST if called directly from the parser, and a TREE_VEC
3293 otherwise.) Since ARGLIST is build on the decl_obstack, we must
3294 copy it here to keep it from being reclaimed when the decl storage
3297 IN_DECL, if non-NULL, is the template declaration we are trying to
3300 If ENTERING_SCOPE is non-zero, we are about to enter the scope of
3301 the class we are looking up.
3303 If the template class is really a local class in a template
3304 function, then the FUNCTION_CONTEXT is the function in which it is
3305 being instantiated. */
3308 lookup_template_class (d1
, arglist
, in_decl
, context
, entering_scope
)
3314 tree
template = NULL_TREE
, parmlist
;
3317 if (TREE_CODE (d1
) == IDENTIFIER_NODE
)
3319 if (IDENTIFIER_LOCAL_VALUE (d1
)
3320 && DECL_TEMPLATE_TEMPLATE_PARM_P (IDENTIFIER_LOCAL_VALUE (d1
)))
3321 template = IDENTIFIER_LOCAL_VALUE (d1
);
3325 push_decl_namespace (context
);
3326 if (current_class_type
!= NULL_TREE
)
3328 maybe_get_template_decl_from_type_decl
3329 (IDENTIFIER_CLASS_VALUE (d1
));
3330 if (template == NULL_TREE
)
3331 template = lookup_name_nonclass (d1
);
3333 pop_decl_namespace ();
3336 context
= DECL_CONTEXT (template);
3338 else if (TREE_CODE (d1
) == TYPE_DECL
&& IS_AGGR_TYPE (TREE_TYPE (d1
)))
3340 if (CLASSTYPE_TEMPLATE_INFO (TREE_TYPE (d1
)) == NULL_TREE
)
3341 return error_mark_node
;
3342 template = CLASSTYPE_TI_TEMPLATE (TREE_TYPE (d1
));
3343 d1
= DECL_NAME (template);
3345 else if (TREE_CODE (d1
) == ENUMERAL_TYPE
3346 || (TREE_CODE_CLASS (TREE_CODE (d1
)) == 't'
3347 && IS_AGGR_TYPE (d1
)))
3349 template = TYPE_TI_TEMPLATE (d1
);
3350 d1
= DECL_NAME (template);
3352 else if (TREE_CODE (d1
) == TEMPLATE_DECL
3353 && TREE_CODE (DECL_RESULT (d1
)) == TYPE_DECL
)
3356 d1
= DECL_NAME (template);
3357 context
= DECL_CONTEXT (template);
3360 my_friendly_abort (272);
3362 /* With something like `template <class T> class X class X { ... };'
3363 we could end up with D1 having nothing but an IDENTIFIER_LOCAL_VALUE.
3364 We don't want to do that, but we have to deal with the situation, so
3365 let's give them some syntax errors to chew on instead of a crash. */
3367 return error_mark_node
;
3369 if (context
== NULL_TREE
)
3370 context
= global_namespace
;
3372 if (TREE_CODE (template) != TEMPLATE_DECL
)
3374 cp_error ("non-template type `%T' used as a template", d1
);
3376 cp_error_at ("for template declaration `%D'", in_decl
);
3377 return error_mark_node
;
3380 if (DECL_TEMPLATE_TEMPLATE_PARM_P (template))
3382 /* Create a new TEMPLATE_DECL and TEMPLATE_TEMPLATE_PARM node to store
3383 template arguments */
3385 tree parm
= copy_template_template_parm (TREE_TYPE (template));
3386 tree template2
= TYPE_STUB_DECL (parm
);
3389 CLASSTYPE_GOT_SEMICOLON (parm
) = 1;
3390 parmlist
= DECL_INNERMOST_TEMPLATE_PARMS (template);
3392 arglist2
= coerce_template_parms (parmlist
, arglist
, template, 1, 1);
3393 if (arglist2
== error_mark_node
)
3394 return error_mark_node
;
3396 arglist2
= copy_to_permanent (arglist2
);
3397 CLASSTYPE_TEMPLATE_INFO (parm
)
3398 = perm_tree_cons (template2
, arglist2
, NULL_TREE
);
3399 TYPE_SIZE (parm
) = 0;
3404 tree template_type
= TREE_TYPE (template);
3406 tree found
= NULL_TREE
;
3409 int is_partial_instantiation
;
3411 template = most_general_template (template);
3412 parmlist
= DECL_TEMPLATE_PARMS (template);
3413 parm_depth
= TMPL_PARMS_DEPTH (parmlist
);
3414 arg_depth
= TMPL_ARGS_DEPTH (arglist
);
3416 if (arg_depth
== 1 && parm_depth
> 1)
3418 /* We've been given an incomplete set of template arguments.
3421 template <class T> struct S1 {
3422 template <class U> struct S2 {};
3423 template <class U> struct S2<U*> {};
3426 we will be called with an ARGLIST of `U*', but the
3427 TEMPLATE will be `template <class T> template
3428 <class U> struct S1<T>::S2'. We must fill in the missing
3430 my_friendly_assert (context
!= NULL_TREE
, 0);
3431 while (!IS_AGGR_TYPE_CODE (TREE_CODE (context
))
3432 && context
!= global_namespace
)
3433 context
= DECL_REAL_CONTEXT (context
);
3435 if (context
== global_namespace
)
3436 /* This is bad. We cannot get enough arguments, even from
3437 the surrounding context, to resolve this class. One
3438 case where this might happen is (illegal) code like:
3446 We should catch this error sooner (at the opening curly
3447 for `S', but it is better to be safe than sorry here. */
3449 cp_error ("invalid use of `%D'", template);
3450 return error_mark_node
;
3453 arglist
= add_to_template_args (TYPE_TI_ARGS (context
),
3455 arg_depth
= TMPL_ARGS_DEPTH (arglist
);
3458 my_friendly_assert (parm_depth
== arg_depth
, 0);
3460 /* Calculate the BOUND_ARGS. These will be the args that are
3461 actually tsubst'd into the definition to create the
3465 /* We have multiple levels of arguments to coerce, at once. */
3467 int saved_depth
= TMPL_ARGS_DEPTH (arglist
);
3469 tree bound_args
= make_temp_vec (parm_depth
);
3471 for (i
= saved_depth
,
3472 t
= DECL_TEMPLATE_PARMS (template);
3473 i
> 0 && t
!= NULL_TREE
;
3474 --i
, t
= TREE_CHAIN (t
))
3476 tree a
= coerce_template_parms (TREE_VALUE (t
),
3477 arglist
, template, 1, 1);
3478 SET_TMPL_ARGS_LEVEL (bound_args
, i
, a
);
3480 /* We temporarily reduce the length of the ARGLIST so
3481 that coerce_template_parms will see only the arguments
3482 corresponding to the template parameters it is
3484 TREE_VEC_LENGTH (arglist
)--;
3487 /* Restore the ARGLIST to its full size. */
3488 TREE_VEC_LENGTH (arglist
) = saved_depth
;
3490 arglist
= bound_args
;
3494 = coerce_template_parms (INNERMOST_TEMPLATE_PARMS (parmlist
),
3495 innermost_args (arglist
),
3498 if (arglist
== error_mark_node
)
3499 /* We were unable to bind the arguments. */
3500 return error_mark_node
;
3502 /* In the scope of a template class, explicit references to the
3503 template class refer to the type of the template, not any
3504 instantiation of it. For example, in:
3506 template <class T> class C { void f(C<T>); }
3508 the `C<T>' is just the same as `C'. Outside of the
3509 class, however, such a reference is an instantiation. */
3510 if (comp_template_args (TYPE_TI_ARGS (template_type
),
3513 found
= template_type
;
3515 if (!entering_scope
&& PRIMARY_TEMPLATE_P (template))
3519 /* Note that we use DECL_CONTEXT, rather than
3520 CP_DECL_CONTEXT, so that the termination test is
3521 always just `ctx'. We're not interested in namepace
3523 for (ctx
= current_class_type
;
3525 ctx
= (TREE_CODE_CLASS (TREE_CODE (ctx
)) == 't')
3526 ? TYPE_CONTEXT (ctx
) : DECL_CONTEXT (ctx
))
3527 if (comptypes (ctx
, template_type
, 1))
3531 /* We're not in the scope of the class, so the
3532 TEMPLATE_TYPE is not the type we want after
3540 for (found
= DECL_TEMPLATE_INSTANTIATIONS (template);
3541 found
; found
= TREE_CHAIN (found
))
3542 if (comp_template_args (TREE_PURPOSE (found
), arglist
))
3546 found
= TREE_VALUE (found
);
3551 if (can_free (&permanent_obstack
, arglist
))
3552 obstack_free (&permanent_obstack
, arglist
);
3556 /* Since we didn't find the type, we'll have to create it.
3557 Since we'll be saving this type on the
3558 DECL_TEMPLATE_INSTANTIATIONS list, it must be permanent. */
3559 push_obstacks (&permanent_obstack
, &permanent_obstack
);
3561 /* This type is a "partial instantiation" if any of the template
3562 arguments still inolve template parameters. */
3563 is_partial_instantiation
= uses_template_parms (arglist
);
3565 /* Create the type. */
3566 if (TREE_CODE (template_type
) == ENUMERAL_TYPE
)
3568 if (!is_partial_instantiation
)
3569 t
= start_enum (TYPE_IDENTIFIER (template_type
));
3571 /* We don't want to call start_enum for this type, since
3572 the values for the enumeration constants may involve
3573 template parameters. And, no one should be interested
3574 in the enumeration constants for such a type. */
3575 t
= make_node (ENUMERAL_TYPE
);
3579 t
= make_lang_type (TREE_CODE (template_type
));
3580 CLASSTYPE_DECLARED_CLASS (t
)
3581 = CLASSTYPE_DECLARED_CLASS (template_type
);
3582 CLASSTYPE_GOT_SEMICOLON (t
) = 1;
3583 SET_CLASSTYPE_IMPLICIT_INSTANTIATION (t
);
3584 TYPE_FOR_JAVA (t
) = TYPE_FOR_JAVA (template_type
);
3587 /* If we called start_enum above, this information will already
3591 TYPE_CONTEXT (t
) = FROB_CONTEXT (context
);
3593 /* Create a stub TYPE_DECL for it. */
3594 type_decl
= build_decl (TYPE_DECL
, DECL_NAME (template), t
);
3595 SET_DECL_ARTIFICIAL (type_decl
);
3596 DECL_CONTEXT (type_decl
) = TYPE_CONTEXT (t
);
3597 DECL_SOURCE_FILE (type_decl
)
3598 = DECL_SOURCE_FILE (TYPE_STUB_DECL (template_type
));
3599 DECL_SOURCE_LINE (type_decl
)
3600 = DECL_SOURCE_LINE (TYPE_STUB_DECL (template_type
));
3601 TYPE_STUB_DECL (t
) = TYPE_NAME (t
) = type_decl
;
3604 type_decl
= TYPE_NAME (t
);
3606 /* Set up the template information. */
3607 arglist
= copy_to_permanent (arglist
);
3608 SET_TYPE_TEMPLATE_INFO (t
,
3609 tree_cons (template, arglist
, NULL_TREE
));
3610 DECL_TEMPLATE_INSTANTIATIONS (template)
3611 = tree_cons (arglist
, t
,
3612 DECL_TEMPLATE_INSTANTIATIONS (template));
3614 if (TREE_CODE (t
) == ENUMERAL_TYPE
3615 && !is_partial_instantiation
)
3616 /* Now that the type has been registered on the instantiations
3617 list, we set up the enumerators. Because the enumeration
3618 constants may involve the enumeration type itself, we make
3619 sure to register the type first, and then create the
3620 constants. That way, doing tsubst_expr for the enumeration
3621 constants won't result in recursive calls here; we'll find
3622 the instantiation and exit above. */
3623 tsubst_enum (template_type
, t
, arglist
);
3625 /* We're done with the permanent obstack, now. */
3628 /* Reset the name of the type, now that CLASSTYPE_TEMPLATE_INFO
3630 if (TREE_CODE (t
) != ENUMERAL_TYPE
)
3631 DECL_NAME (type_decl
) = classtype_mangled_name (t
);
3632 DECL_ASSEMBLER_NAME (type_decl
) = DECL_NAME (type_decl
);
3633 if (!is_partial_instantiation
)
3635 DECL_ASSEMBLER_NAME (type_decl
)
3636 = get_identifier (build_overload_name (t
, 1, 1));
3638 /* For backwards compatibility; code that uses
3639 -fexternal-templates expects looking up a template to
3640 instantiate it. I think DDD still relies on this.
3641 (jason 8/20/1998) */
3642 if (TREE_CODE (t
) != ENUMERAL_TYPE
3643 && flag_external_templates
3644 && CLASSTYPE_INTERFACE_KNOWN (TREE_TYPE (template))
3645 && ! CLASSTYPE_INTERFACE_ONLY (TREE_TYPE (template)))
3646 add_pending_template (t
);
3649 /* If the type makes use of template parameters, the
3650 code that generates debugging information will crash. */
3651 DECL_IGNORED_P (TYPE_STUB_DECL (t
)) = 1;
3657 /* For each TEMPLATE_TYPE_PARM, TEMPLATE_TEMPLATE_PARM, or
3658 TEMPLATE_PARM_INDEX in T, call FN with the parameter and the DATA.
3659 If FN returns non-zero, the iteration is terminated, and
3660 for_each_template_parm returns 1. Otherwise, the iteration
3661 continues. If FN never returns a non-zero value, the value
3662 returned by for_each_template_parm is 0. If FN is NULL, it is
3663 considered to be the function which always returns 1. */
3666 for_each_template_parm (t
, fn
, data
)
3674 if (TREE_CODE_CLASS (TREE_CODE (t
)) == 't'
3675 && for_each_template_parm (TYPE_CONTEXT (t
), fn
, data
))
3678 switch (TREE_CODE (t
))
3682 /* We assume that the object must be instantiated in order to build
3683 the COMPONENT_REF, so we test only whether the type of the
3684 COMPONENT_REF uses template parms. */
3685 return for_each_template_parm (TREE_TYPE (t
), fn
, data
);
3687 case IDENTIFIER_NODE
:
3688 if (!IDENTIFIER_TEMPLATE (t
))
3690 my_friendly_abort (42);
3692 /* aggregates of tree nodes */
3695 int i
= TREE_VEC_LENGTH (t
);
3697 if (for_each_template_parm (TREE_VEC_ELT (t
, i
), fn
, data
))
3702 if (for_each_template_parm (TREE_PURPOSE (t
), fn
, data
)
3703 || for_each_template_parm (TREE_VALUE (t
), fn
, data
))
3705 return for_each_template_parm (TREE_CHAIN (t
), fn
, data
);
3708 if (for_each_template_parm (OVL_FUNCTION (t
), fn
, data
))
3710 return for_each_template_parm (OVL_CHAIN (t
), fn
, data
);
3712 /* constructed type nodes */
3714 case REFERENCE_TYPE
:
3715 return for_each_template_parm (TREE_TYPE (t
), fn
, data
);
3718 if (TYPE_PTRMEMFUNC_FLAG (t
))
3719 return for_each_template_parm (TYPE_PTRMEMFUNC_FN_TYPE (t
),
3725 if (! TYPE_TEMPLATE_INFO (t
))
3727 return for_each_template_parm (TREE_VALUE
3728 (TYPE_TEMPLATE_INFO (t
)),
3731 if (for_each_template_parm (TYPE_ARG_TYPES (t
), fn
, data
))
3733 return for_each_template_parm (TREE_TYPE (t
), fn
, data
);
3735 if (for_each_template_parm (TYPE_DOMAIN (t
), fn
, data
))
3737 return for_each_template_parm (TREE_TYPE (t
), fn
, data
);
3739 if (for_each_template_parm (TYPE_OFFSET_BASETYPE (t
), fn
, data
))
3741 return for_each_template_parm (TREE_TYPE (t
), fn
, data
);
3743 if (for_each_template_parm (TYPE_METHOD_BASETYPE (t
), fn
, data
))
3745 if (for_each_template_parm (TYPE_ARG_TYPES (t
), fn
, data
))
3747 return for_each_template_parm (TREE_TYPE (t
), fn
, data
);
3751 return for_each_template_parm (TREE_TYPE (t
), fn
, data
);
3754 /* A template template parameter is encountered */
3755 if (DECL_TEMPLATE_TEMPLATE_PARM_P (t
))
3756 return for_each_template_parm (TREE_TYPE (t
), fn
, data
);
3757 /* Already substituted template template parameter */
3761 if (for_each_template_parm (DECL_INITIAL (t
), fn
, data
))
3763 goto check_type_and_context
;
3767 /* ??? What about FIELD_DECLs? */
3768 if (DECL_LANG_SPECIFIC (t
) && DECL_TEMPLATE_INFO (t
)
3769 && for_each_template_parm (DECL_TI_ARGS (t
), fn
, data
))
3773 check_type_and_context
:
3774 if (for_each_template_parm (TREE_TYPE (t
), fn
, data
))
3776 if (DECL_CONTEXT (t
)
3777 && for_each_template_parm (DECL_CONTEXT (t
), fn
, data
))
3782 return for_each_template_parm (TREE_TYPE (t
), fn
, data
);
3784 return for_each_template_parm (TREE_OPERAND (t
, 0), fn
, data
);
3786 /* template parm nodes */
3787 case TEMPLATE_TEMPLATE_PARM
:
3788 /* Record template parameters such as `T' inside `TT<T>'. */
3789 if (CLASSTYPE_TEMPLATE_INFO (t
)
3790 && for_each_template_parm (CLASSTYPE_TI_ARGS (t
), fn
, data
))
3792 case TEMPLATE_TYPE_PARM
:
3793 case TEMPLATE_PARM_INDEX
:
3795 return (*fn
)(t
, data
);
3799 /* simple type nodes */
3801 if (for_each_template_parm (TYPE_MIN_VALUE (t
), fn
, data
))
3803 return for_each_template_parm (TYPE_MAX_VALUE (t
), fn
, data
);
3809 case NAMESPACE_DECL
:
3819 /* Non-error_mark_node ERROR_MARKs are bad things. */
3820 my_friendly_assert (t
== error_mark_node
, 274);
3829 return for_each_template_parm (TREE_TYPE (t
), fn
, data
);
3832 return for_each_template_parm (TREE_OPERAND (t
, 0), fn
, data
);
3835 if (TREE_TYPE (t
) && TYPE_PTRMEMFUNC_P (TREE_TYPE (t
)))
3836 return for_each_template_parm (TYPE_PTRMEMFUNC_FN_TYPE
3837 (TREE_TYPE (t
)), fn
, data
);
3838 return for_each_template_parm (TREE_OPERAND (t
, 1), fn
, data
);
3842 case REINTERPRET_CAST_EXPR
:
3843 case CONST_CAST_EXPR
:
3844 case STATIC_CAST_EXPR
:
3845 case DYNAMIC_CAST_EXPR
:
3853 return for_each_template_parm (TREE_OPERAND (t
, 0), fn
, data
);
3856 switch (TREE_CODE_CLASS (TREE_CODE (t
)))
3864 for (i
= first_rtl_op (TREE_CODE (t
)); --i
>= 0;)
3865 if (for_each_template_parm (TREE_OPERAND (t
, i
), fn
, data
))
3872 sorry ("testing %s for template parms",
3873 tree_code_name
[(int) TREE_CODE (t
)]);
3874 my_friendly_abort (82);
3881 uses_template_parms (t
)
3884 return for_each_template_parm (t
, 0, 0);
3887 static struct tinst_level
*current_tinst_level
;
3888 static struct tinst_level
*free_tinst_level
;
3889 static int tinst_depth
;
3890 extern int max_tinst_depth
;
3891 #ifdef GATHER_STATISTICS
3894 int tinst_level_tick
;
3895 int last_template_error_tick
;
3897 /* Print out all the template instantiations that we are currently
3898 working on. If ERR, we are being called from cp_thing, so do
3899 the right thing for an error message. */
3902 print_template_context (err
)
3905 struct tinst_level
*p
= current_tinst_level
;
3907 char *file
= input_filename
;
3911 if (current_function_decl
!= p
->decl
3912 && current_function_decl
!= NULL_TREE
)
3913 /* We can get here during the processing of some synthesized
3914 method. Then, p->decl will be the function that's causing
3919 if (current_function_decl
== p
->decl
)
3920 /* Avoid redundancy with the the "In function" line. */;
3922 fprintf (stderr
, "%s: In instantiation of `%s':\n",
3923 file
, decl_as_string (p
->decl
, 0));
3931 for (; p
; p
= p
->next
)
3933 fprintf (stderr
, "%s:%d: instantiated from `%s'\n", file
, line
,
3934 decl_as_string (p
->decl
, 0));
3938 fprintf (stderr
, "%s:%d: instantiated from here\n", file
, line
);
3941 /* Called from cp_thing to print the template context for an error. */
3944 maybe_print_template_context ()
3946 if (last_template_error_tick
== tinst_level_tick
3947 || current_tinst_level
== 0)
3950 last_template_error_tick
= tinst_level_tick
;
3951 print_template_context (1);
3955 push_tinst_level (d
)
3958 struct tinst_level
*new;
3960 if (tinst_depth
>= max_tinst_depth
)
3962 /* If the instantiation in question still has unbound template parms,
3963 we don't really care if we can't instantiate it, so just return.
3964 This happens with base instantiation for implicit `typename'. */
3965 if (uses_template_parms (d
))
3968 last_template_error_tick
= tinst_level_tick
;
3969 error ("template instantiation depth exceeds maximum of %d",
3971 error (" (use -ftemplate-depth-NN to increase the maximum)");
3972 cp_error (" instantiating `%D'", d
);
3974 print_template_context (0);
3979 if (free_tinst_level
)
3981 new = free_tinst_level
;
3982 free_tinst_level
= new->next
;
3985 new = (struct tinst_level
*) xmalloc (sizeof (struct tinst_level
));
3989 new->file
= input_filename
;
3990 new->next
= current_tinst_level
;
3991 current_tinst_level
= new;
3994 #ifdef GATHER_STATISTICS
3995 if (tinst_depth
> depth_reached
)
3996 depth_reached
= tinst_depth
;
4006 struct tinst_level
*old
= current_tinst_level
;
4008 /* Restore the filename and line number stashed away when we started
4009 this instantiation. */
4011 input_filename
= old
->file
;
4012 extract_interface_info ();
4014 current_tinst_level
= old
->next
;
4015 old
->next
= free_tinst_level
;
4016 free_tinst_level
= old
;
4021 struct tinst_level
*
4024 struct tinst_level
*p
= current_tinst_level
;
4027 for (; p
->next
; p
= p
->next
)
4032 /* DECL is a friend FUNCTION_DECL or TEMPLATE_DECL. ARGS is the
4033 vector of template arguments, as for tsubst.
4035 Returns an appropriate tsbust'd friend declaration. */
4038 tsubst_friend_function (decl
, args
)
4044 char *file
= input_filename
;
4046 lineno
= DECL_SOURCE_LINE (decl
);
4047 input_filename
= DECL_SOURCE_FILE (decl
);
4049 if (TREE_CODE (decl
) == FUNCTION_DECL
4050 && DECL_TEMPLATE_INSTANTIATION (decl
)
4051 && TREE_CODE (DECL_TI_TEMPLATE (decl
)) != TEMPLATE_DECL
)
4052 /* This was a friend declared with an explicit template
4053 argument list, e.g.:
4057 to indicate that f was a template instantiation, not a new
4058 function declaration. Now, we have to figure out what
4059 instantiation of what template. */
4066 = lookup_template_function (tsubst_expr (DECL_TI_TEMPLATE (decl
),
4068 tsubst (DECL_TI_ARGS (decl
),
4070 /* FIXME: The decl we create via the next tsubst could be
4071 created on a temporary obstack. */
4072 new_friend
= tsubst (decl
, args
, NULL_TREE
);
4073 tmpl
= determine_specialization (template_id
, new_friend
,
4075 /*need_member_template=*/0,
4077 new_friend
= instantiate_template (tmpl
, new_args
);
4081 new_friend
= tsubst (decl
, args
, NULL_TREE
);
4083 /* The NEW_FRIEND will look like an instantiation, to the
4084 compiler, but is not an instantiation from the point of view of
4085 the language. For example, we might have had:
4087 template <class T> struct S {
4088 template <class U> friend void f(T, U);
4091 Then, in S<int>, template <class U> void f(int, U) is not an
4092 instantiation of anything. */
4093 DECL_USE_TEMPLATE (new_friend
) = 0;
4094 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
4095 DECL_USE_TEMPLATE (DECL_TEMPLATE_RESULT (new_friend
)) = 0;
4097 /* The mangled name for the NEW_FRIEND is incorrect. The call to
4098 tsubst will have resulted in a call to
4099 set_mangled_name_for_template_decl. But, the function is not a
4100 template instantiation and should not be mangled like one.
4101 Therefore, we remangle the function name. We don't have to do
4102 this if the NEW_FRIEND is a template since
4103 set_mangled_name_for_template_decl doesn't do anything if the
4104 function declaration still uses template arguments. */
4105 if (TREE_CODE (new_friend
) != TEMPLATE_DECL
)
4107 set_mangled_name_for_decl (new_friend
);
4108 DECL_RTL (new_friend
) = 0;
4109 make_decl_rtl (new_friend
, NULL_PTR
, 1);
4112 if (DECL_NAMESPACE_SCOPE_P (new_friend
))
4115 tree new_friend_args
;
4117 if (TREE_CODE (new_friend
) == TEMPLATE_DECL
)
4118 /* This declaration is a `primary' template. */
4119 DECL_PRIMARY_TEMPLATE (new_friend
) = new_friend
;
4121 /* We must save the DECL_TI_ARGS for NEW_FRIEND here because
4122 pushdecl may call duplicate_decls which will free NEW_FRIEND
4124 new_friend_args
= DECL_TI_ARGS (new_friend
);
4125 old_decl
= pushdecl_namespace_level (new_friend
);
4127 if (old_decl
!= new_friend
)
4129 /* This new friend declaration matched an existing
4130 declaration. For example, given:
4132 template <class T> void f(T);
4133 template <class U> class C {
4134 template <class T> friend void f(T) {}
4137 the friend declaration actually provides the definition
4138 of `f', once C has been instantiated for some type. So,
4139 old_decl will be the out-of-class template declaration,
4140 while new_friend is the in-class definition.
4142 But, if `f' was called before this point, the
4143 instantiation of `f' will have DECL_TI_ARGS corresponding
4144 to `T' but not to `U', references to which might appear
4145 in the definition of `f'. Previously, the most general
4146 template for an instantiation of `f' was the out-of-class
4147 version; now it is the in-class version. Therefore, we
4148 run through all specialization of `f', adding to their
4149 DECL_TI_ARGS appropriately. In particular, they need a
4150 new set of outer arguments, corresponding to the
4151 arguments for this class instantiation.
4153 The same situation can arise with something like this:
4156 template <class T> class C {
4160 when `C<int>' is instantiated. Now, `f(int)' is defined
4163 if (TREE_CODE (old_decl
) != TEMPLATE_DECL
)
4164 /* duplicate_decls will take care of this case. */
4170 for (t
= DECL_TEMPLATE_SPECIALIZATIONS (old_decl
);
4174 tree spec
= TREE_VALUE (t
);
4177 = add_outermost_template_args (new_friend_args
,
4178 DECL_TI_ARGS (spec
));
4180 = copy_to_permanent (DECL_TI_ARGS (spec
));
4183 /* Now, since specializations are always supposed to
4184 hang off of the most general template, we must move
4186 t
= most_general_template (old_decl
);
4189 DECL_TEMPLATE_SPECIALIZATIONS (t
)
4190 = chainon (DECL_TEMPLATE_SPECIALIZATIONS (t
),
4191 DECL_TEMPLATE_SPECIALIZATIONS (old_decl
));
4192 DECL_TEMPLATE_SPECIALIZATIONS (old_decl
) = NULL_TREE
;
4196 /* The information from NEW_FRIEND has been merged into OLD_DECL
4197 by duplicate_decls. */
4198 new_friend
= old_decl
;
4201 else if (TYPE_SIZE (DECL_CONTEXT (new_friend
)))
4203 /* Check to see that the declaration is really present, and,
4204 possibly obtain an improved declaration. */
4205 tree fn
= check_classfn (DECL_CONTEXT (new_friend
),
4214 input_filename
= file
;
4218 /* FRIEND_TMPL is a friend TEMPLATE_DECL. ARGS is the vector of
4219 template arguments, as for tsubst.
4221 Returns an appropriate tsbust'd friend type. */
4224 tsubst_friend_class (friend_tmpl
, args
)
4229 tree tmpl
= lookup_name (DECL_NAME (friend_tmpl
), 1);
4231 tmpl
= maybe_get_template_decl_from_type_decl (tmpl
);
4233 if (tmpl
!= NULL_TREE
&& DECL_CLASS_TEMPLATE_P (tmpl
))
4235 /* The friend template has already been declared. Just
4236 check to see that the declarations match, and install any new
4237 default parameters. We must tsubst the default parameters,
4238 of course. We only need the innermost template parameters
4239 because that is all that redeclare_class_template will look
4242 = tsubst_template_parms (DECL_TEMPLATE_PARMS (friend_tmpl
),
4244 redeclare_class_template (TREE_TYPE (tmpl
), parms
);
4245 friend_type
= TREE_TYPE (tmpl
);
4249 /* The friend template has not already been declared. In this
4250 case, the instantiation of the template class will cause the
4251 injection of this template into the global scope. */
4252 tmpl
= tsubst (friend_tmpl
, args
, NULL_TREE
);
4254 /* The new TMPL is not an instantiation of anything, so we
4255 forget its origins. We don't reset CLASSTYPE_TI_TEMPLATE for
4256 the new type because that is supposed to be the corresponding
4257 template decl, i.e., TMPL. */
4258 DECL_USE_TEMPLATE (tmpl
) = 0;
4259 DECL_TEMPLATE_INFO (tmpl
) = NULL_TREE
;
4260 CLASSTYPE_USE_TEMPLATE (TREE_TYPE (tmpl
)) = 0;
4262 /* Inject this template into the global scope. */
4263 friend_type
= TREE_TYPE (pushdecl_top_level (tmpl
));
4270 instantiate_class_template (type
)
4273 tree
template, args
, pattern
, t
;
4276 if (type
== error_mark_node
)
4277 return error_mark_node
;
4279 if (TYPE_BEING_DEFINED (type
) || TYPE_SIZE (type
))
4282 template = most_general_template (CLASSTYPE_TI_TEMPLATE (type
));
4283 args
= CLASSTYPE_TI_ARGS (type
);
4284 my_friendly_assert (TREE_CODE (template) == TEMPLATE_DECL
, 279);
4285 t
= most_specialized_class (template, args
);
4287 if (t
== error_mark_node
)
4289 char *str
= "candidates are:";
4290 cp_error ("ambiguous class template instantiation for `%#T'", type
);
4291 for (t
= DECL_TEMPLATE_SPECIALIZATIONS (template); t
; t
= TREE_CHAIN (t
))
4293 if (get_class_bindings (TREE_VALUE (t
), TREE_PURPOSE (t
),
4296 cp_error_at ("%s %+#T", str
, TREE_TYPE (t
));
4300 TYPE_BEING_DEFINED (type
) = 1;
4301 return error_mark_node
;
4304 pattern
= TREE_TYPE (t
);
4306 pattern
= TREE_TYPE (template);
4308 if (TYPE_SIZE (pattern
) == NULL_TREE
)
4313 /* This TYPE is actually a instantiation of of a partial
4314 specialization. We replace the innermost set of ARGS with
4315 the arguments appropriate for substitution. For example,
4318 template <class T> struct S {};
4319 template <class T> struct S<T*> {};
4321 and supposing that we are instantiating S<int*>, ARGS will
4322 present be {int*} but we need {int}. */
4324 = get_class_bindings (TREE_VALUE (t
), TREE_PURPOSE (t
),
4327 /* If there were multiple levels in ARGS, replacing the
4328 innermost level would alter CLASSTYPE_TI_ARGS, which we don't
4329 want, so we make a copy first. */
4330 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (args
))
4332 args
= copy_node (args
);
4333 SET_TMPL_ARGS_LEVEL (args
, TMPL_ARGS_DEPTH (args
), inner_args
);
4339 if (pedantic
&& uses_template_parms (args
))
4341 /* If there are still template parameters amongst the args, then
4342 we can't instantiate the type; there's no telling whether or not one
4343 of the template parameters might eventually be instantiated to some
4344 value that results in a specialization being used. We do the
4345 type as complete so that, for example, declaring one of its
4346 members to be a friend will not be rejected. */
4347 TYPE_SIZE (type
) = integer_zero_node
;
4351 TYPE_BEING_DEFINED (type
) = 1;
4353 if (! push_tinst_level (type
))
4356 maybe_push_to_top_level (uses_template_parms (type
));
4357 pushclass (type
, 0);
4359 /* We must copy the arguments to the permanent obstack since
4360 during the tsubst'ing below they may wind up in the
4361 DECL_TI_ARGS of some instantiated member template. */
4362 args
= copy_to_permanent (args
);
4364 if (flag_external_templates
)
4366 if (flag_alt_external_templates
)
4368 CLASSTYPE_INTERFACE_ONLY (type
) = interface_only
;
4369 SET_CLASSTYPE_INTERFACE_UNKNOWN_X (type
, interface_unknown
);
4370 CLASSTYPE_VTABLE_NEEDS_WRITING (type
)
4371 = (! CLASSTYPE_INTERFACE_ONLY (type
)
4372 && CLASSTYPE_INTERFACE_KNOWN (type
));
4376 CLASSTYPE_INTERFACE_ONLY (type
) = CLASSTYPE_INTERFACE_ONLY (pattern
);
4377 SET_CLASSTYPE_INTERFACE_UNKNOWN_X
4378 (type
, CLASSTYPE_INTERFACE_UNKNOWN (pattern
));
4379 CLASSTYPE_VTABLE_NEEDS_WRITING (type
)
4380 = (! CLASSTYPE_INTERFACE_ONLY (type
)
4381 && CLASSTYPE_INTERFACE_KNOWN (type
));
4386 SET_CLASSTYPE_INTERFACE_UNKNOWN (type
);
4387 CLASSTYPE_VTABLE_NEEDS_WRITING (type
) = 1;
4390 TYPE_HAS_CONSTRUCTOR (type
) = TYPE_HAS_CONSTRUCTOR (pattern
);
4391 TYPE_HAS_DESTRUCTOR (type
) = TYPE_HAS_DESTRUCTOR (pattern
);
4392 TYPE_HAS_ASSIGNMENT (type
) = TYPE_HAS_ASSIGNMENT (pattern
);
4393 TYPE_OVERLOADS_CALL_EXPR (type
) = TYPE_OVERLOADS_CALL_EXPR (pattern
);
4394 TYPE_OVERLOADS_ARRAY_REF (type
) = TYPE_OVERLOADS_ARRAY_REF (pattern
);
4395 TYPE_OVERLOADS_ARROW (type
) = TYPE_OVERLOADS_ARROW (pattern
);
4396 TYPE_GETS_NEW (type
) = TYPE_GETS_NEW (pattern
);
4397 TYPE_GETS_DELETE (type
) = TYPE_GETS_DELETE (pattern
);
4398 TYPE_VEC_DELETE_TAKES_SIZE (type
) = TYPE_VEC_DELETE_TAKES_SIZE (pattern
);
4399 TYPE_HAS_ASSIGN_REF (type
) = TYPE_HAS_ASSIGN_REF (pattern
);
4400 TYPE_HAS_CONST_ASSIGN_REF (type
) = TYPE_HAS_CONST_ASSIGN_REF (pattern
);
4401 TYPE_HAS_ABSTRACT_ASSIGN_REF (type
) = TYPE_HAS_ABSTRACT_ASSIGN_REF (pattern
);
4402 TYPE_HAS_INIT_REF (type
) = TYPE_HAS_INIT_REF (pattern
);
4403 TYPE_HAS_CONST_INIT_REF (type
) = TYPE_HAS_CONST_INIT_REF (pattern
);
4404 TYPE_HAS_DEFAULT_CONSTRUCTOR (type
) = TYPE_HAS_DEFAULT_CONSTRUCTOR (pattern
);
4405 TYPE_HAS_CONVERSION (type
) = TYPE_HAS_CONVERSION (pattern
);
4406 TYPE_USES_COMPLEX_INHERITANCE (type
)
4407 = TYPE_USES_COMPLEX_INHERITANCE (pattern
);
4408 TYPE_USES_MULTIPLE_INHERITANCE (type
)
4409 = TYPE_USES_MULTIPLE_INHERITANCE (pattern
);
4410 TYPE_USES_VIRTUAL_BASECLASSES (type
)
4411 = TYPE_USES_VIRTUAL_BASECLASSES (pattern
);
4412 TYPE_PACKED (type
) = TYPE_PACKED (pattern
);
4413 TYPE_ALIGN (type
) = TYPE_ALIGN (pattern
);
4414 TYPE_FOR_JAVA (type
) = TYPE_FOR_JAVA (pattern
); /* For libjava's JArray<T> */
4416 /* If this is a partial instantiation, don't tsubst anything. We will
4417 only use this type for implicit typename, so the actual contents don't
4418 matter. All that matters is whether a particular name is a type. */
4419 if (uses_template_parms (type
))
4421 TYPE_BINFO_BASETYPES (type
) = TYPE_BINFO_BASETYPES (pattern
);
4422 TYPE_FIELDS (type
) = TYPE_FIELDS (pattern
);
4423 TYPE_METHODS (type
) = TYPE_METHODS (pattern
);
4424 CLASSTYPE_TAGS (type
) = CLASSTYPE_TAGS (pattern
);
4425 TYPE_SIZE (type
) = integer_zero_node
;
4430 tree binfo
= TYPE_BINFO (type
);
4431 tree pbases
= TYPE_BINFO_BASETYPES (pattern
);
4437 int len
= TREE_VEC_LENGTH (pbases
);
4438 bases
= make_tree_vec (len
);
4439 for (i
= 0; i
< len
; ++i
)
4443 TREE_VEC_ELT (bases
, i
) = elt
4444 = tsubst (TREE_VEC_ELT (pbases
, i
), args
, NULL_TREE
);
4445 BINFO_INHERITANCE_CHAIN (elt
) = binfo
;
4447 basetype
= TREE_TYPE (elt
);
4449 if (! IS_AGGR_TYPE (basetype
))
4451 ("base type `%T' of `%T' fails to be a struct or class type",
4453 else if (TYPE_SIZE (complete_type (basetype
)) == NULL_TREE
)
4454 cp_error ("base class `%T' of `%T' has incomplete type",
4457 /* These are set up in xref_basetypes for normal classes, so
4458 we have to handle them here for template bases. */
4460 unshare_base_binfos (elt
);
4462 if (TYPE_USES_VIRTUAL_BASECLASSES (basetype
))
4464 TYPE_USES_VIRTUAL_BASECLASSES (type
) = 1;
4465 TYPE_USES_COMPLEX_INHERITANCE (type
) = 1;
4467 TYPE_GETS_NEW (type
) |= TYPE_GETS_NEW (basetype
);
4468 TYPE_GETS_DELETE (type
) |= TYPE_GETS_DELETE (basetype
);
4470 /* Don't initialize this until the vector is filled out, or
4471 lookups will crash. */
4472 BINFO_BASETYPES (binfo
) = bases
;
4476 for (t
= CLASSTYPE_TAGS (pattern
); t
; t
= TREE_CHAIN (t
))
4478 tree tag
= TREE_VALUE (t
);
4479 tree name
= TYPE_IDENTIFIER (tag
);
4482 newtag
= tsubst (tag
, args
, NULL_TREE
);
4483 if (TREE_CODE (newtag
) != ENUMERAL_TYPE
)
4485 /* Now, we call pushtag to put this NEWTAG into the scope of
4486 TYPE. We first set up the IDENTIFIER_TYPE_VALUE to avoid
4487 pushtag calling push_template_decl. We don't have to do
4488 this for enums because it will already have been done in
4491 SET_IDENTIFIER_TYPE_VALUE (name
, newtag
);
4492 pushtag (name
, newtag
, /*globalize=*/0);
4496 /* Don't replace enum constants here. */
4497 for (t
= TYPE_FIELDS (pattern
); t
; t
= TREE_CHAIN (t
))
4498 if (TREE_CODE (t
) != CONST_DECL
)
4502 /* The the file and line for this declaration, to assist in
4503 error message reporting. Since we called push_tinst_level
4504 above, we don't need to restore these. */
4505 lineno
= DECL_SOURCE_LINE (t
);
4506 input_filename
= DECL_SOURCE_FILE (t
);
4508 r
= tsubst (t
, args
, NULL_TREE
);
4509 if (TREE_CODE (r
) == VAR_DECL
)
4511 pending_statics
= perm_tree_cons (NULL_TREE
, r
, pending_statics
);
4512 /* Perhaps we should do more of grokfield here. */
4514 DECL_IN_AGGR_P (r
) = 1;
4515 DECL_EXTERNAL (r
) = 1;
4516 cp_finish_decl (r
, DECL_INITIAL (r
), NULL_TREE
, 0, 0);
4519 /* R will have a TREE_CHAIN if and only if it has already been
4520 processed by finish_member_declaration. This can happen
4521 if, for example, it is a TYPE_DECL for a class-scoped
4522 ENUMERAL_TYPE; such a thing will already have been added to
4523 the field list by tsubst_enum above. */
4524 if (!TREE_CHAIN (r
))
4526 set_current_access_from_decl (r
);
4527 finish_member_declaration (r
);
4531 /* Set up the list (TYPE_METHODS) and vector (CLASSTYPE_METHOD_VEC)
4532 for this instantiation. */
4533 for (t
= TYPE_METHODS (pattern
); t
; t
= TREE_CHAIN (t
))
4535 tree r
= tsubst (t
, args
, NULL_TREE
);
4536 set_current_access_from_decl (r
);
4537 finish_member_declaration (r
);
4540 /* Construct the DECL_FRIENDLIST for the new class type. */
4541 typedecl
= TYPE_MAIN_DECL (type
);
4542 for (t
= DECL_FRIENDLIST (TYPE_MAIN_DECL (pattern
));
4548 DECL_FRIENDLIST (typedecl
)
4549 = tree_cons (TREE_PURPOSE (t
), NULL_TREE
,
4550 DECL_FRIENDLIST (typedecl
));
4552 for (friends
= TREE_VALUE (t
);
4553 friends
!= NULL_TREE
;
4554 friends
= TREE_CHAIN (friends
))
4556 if (TREE_PURPOSE (friends
) == error_mark_node
)
4558 TREE_VALUE (DECL_FRIENDLIST (typedecl
))
4559 = tree_cons (error_mark_node
,
4560 tsubst_friend_function (TREE_VALUE (friends
),
4562 TREE_VALUE (DECL_FRIENDLIST (typedecl
)));
4566 TREE_VALUE (DECL_FRIENDLIST (typedecl
))
4567 = tree_cons (tsubst (TREE_PURPOSE (friends
), args
, NULL_TREE
),
4569 TREE_VALUE (DECL_FRIENDLIST (typedecl
)));
4575 for (t
= CLASSTYPE_FRIEND_CLASSES (pattern
);
4579 tree friend_type
= TREE_VALUE (t
);
4580 tree new_friend_type
;
4582 if (TREE_CODE (friend_type
) == TEMPLATE_DECL
)
4583 new_friend_type
= tsubst_friend_class (friend_type
, args
);
4584 else if (uses_template_parms (friend_type
))
4585 new_friend_type
= tsubst (friend_type
, args
, NULL_TREE
);
4587 /* The call to xref_tag_from_type does injection for friend
4590 xref_tag_from_type (friend_type
, NULL_TREE
, 1);
4593 if (TREE_CODE (friend_type
) == TEMPLATE_DECL
)
4594 /* Trick make_friend_class into realizing that the friend
4595 we're adding is a template, not an ordinary class. It's
4596 important that we use make_friend_class since it will
4597 perform some error-checking and output cross-reference
4599 ++processing_template_decl
;
4601 make_friend_class (type
, new_friend_type
);
4603 if (TREE_CODE (friend_type
) == TEMPLATE_DECL
)
4604 --processing_template_decl
;
4607 /* This does injection for friend functions. */
4608 if (!processing_template_decl
)
4610 t
= tsubst (DECL_TEMPLATE_INJECT (template), args
, NULL_TREE
);
4612 for (; t
; t
= TREE_CHAIN (t
))
4614 tree d
= TREE_VALUE (t
);
4616 if (TREE_CODE (d
) == TYPE_DECL
)
4617 /* Already injected. */;
4623 for (t
= TYPE_FIELDS (type
); t
; t
= TREE_CHAIN (t
))
4624 if (TREE_CODE (t
) == FIELD_DECL
)
4626 TREE_TYPE (t
) = complete_type (TREE_TYPE (t
));
4627 require_complete_type (t
);
4630 /* Set the file and line number information to whatever is given for
4631 the class itself. This puts error messages involving generated
4632 implicit functions at a predictable point, and the same point
4633 that would be used for non-template classes. */
4634 lineno
= DECL_SOURCE_LINE (typedecl
);
4635 input_filename
= DECL_SOURCE_FILE (typedecl
);
4637 unreverse_member_declarations (type
);
4638 type
= finish_struct_1 (type
, 0);
4639 CLASSTYPE_GOT_SEMICOLON (type
) = 1;
4641 repo_template_used (type
);
4642 if (at_eof
&& TYPE_BINFO_VTABLE (type
) != NULL_TREE
)
4643 finish_prevtable_vardecl (NULL
, TYPE_BINFO_VTABLE (type
));
4646 TYPE_BEING_DEFINED (type
) = 0;
4649 pop_from_top_level ();
4659 if (t1
== NULL_TREE
)
4660 return t2
== NULL_TREE
;
4661 if (t2
== NULL_TREE
)
4663 /* Don't care if one declares its arg const and the other doesn't -- the
4664 main variant of the arg type is all that matters. */
4665 if (TYPE_MAIN_VARIANT (TREE_VALUE (t1
))
4666 != TYPE_MAIN_VARIANT (TREE_VALUE (t2
)))
4668 return list_eq (TREE_CHAIN (t1
), TREE_CHAIN (t2
));
4671 /* If arg is a non-type template parameter that does not depend on template
4672 arguments, fold it like we weren't in the body of a template. */
4675 maybe_fold_nontype_arg (arg
)
4678 if (TREE_CODE_CLASS (TREE_CODE (arg
)) != 't'
4679 && !uses_template_parms (arg
))
4681 /* Sometimes, one of the args was an expression involving a
4682 template constant parameter, like N - 1. Now that we've
4683 tsubst'd, we might have something like 2 - 1. This will
4684 confuse lookup_template_class, so we do constant folding
4685 here. We have to unset processing_template_decl, to
4686 fool build_expr_from_tree() into building an actual
4689 int saved_processing_template_decl
= processing_template_decl
;
4690 processing_template_decl
= 0;
4691 arg
= fold (build_expr_from_tree (arg
));
4692 processing_template_decl
= saved_processing_template_decl
;
4697 /* Return the TREE_VEC with the arguments for the innermost template header,
4698 where ARGS is either that or the VEC of VECs for all the
4702 innermost_args (args
)
4705 return TMPL_ARGS_LEVEL (args
, TMPL_ARGS_DEPTH (args
));
4708 /* Substitute ARGS into the vector of template arguments T. */
4711 tsubst_template_arg_vector (t
, args
)
4715 int len
= TREE_VEC_LENGTH (t
), need_new
= 0, i
;
4716 tree
*elts
= (tree
*) alloca (len
* sizeof (tree
));
4718 bzero ((char *) elts
, len
* sizeof (tree
));
4720 for (i
= 0; i
< len
; i
++)
4722 if (TREE_VEC_ELT (t
, i
) != NULL_TREE
4723 && TREE_CODE (TREE_VEC_ELT (t
, i
)) == TREE_VEC
)
4724 elts
[i
] = tsubst_template_arg_vector (TREE_VEC_ELT (t
, i
), args
);
4726 elts
[i
] = maybe_fold_nontype_arg
4727 (tsubst_expr (TREE_VEC_ELT (t
, i
), args
, NULL_TREE
));
4729 if (elts
[i
] != TREE_VEC_ELT (t
, i
))
4736 t
= make_tree_vec (len
);
4737 for (i
= 0; i
< len
; i
++)
4738 TREE_VEC_ELT (t
, i
) = elts
[i
];
4743 /* Return the result of substituting ARGS into the template parameters
4744 given by PARMS. If there are m levels of ARGS and m + n levels of
4745 PARMS, then the result will contain n levels of PARMS. For
4746 example, if PARMS is `template <class T> template <class U>
4747 template <T*, U, class V>' and ARGS is {{int}, {double}} then the
4748 result will be `template <int*, double, class V>'. */
4751 tsubst_template_parms (parms
, args
)
4756 tree
* new_parms
= &r
;
4758 for (new_parms
= &r
;
4759 TMPL_PARMS_DEPTH (parms
) > TMPL_ARGS_DEPTH (args
);
4760 new_parms
= &(TREE_CHAIN (*new_parms
)),
4761 parms
= TREE_CHAIN (parms
))
4764 make_tree_vec (TREE_VEC_LENGTH (TREE_VALUE (parms
)));
4767 for (i
= 0; i
< TREE_VEC_LENGTH (new_vec
); ++i
)
4769 tree default_value
=
4770 TREE_PURPOSE (TREE_VEC_ELT (TREE_VALUE (parms
), i
));
4772 TREE_VALUE (TREE_VEC_ELT (TREE_VALUE (parms
), i
));
4774 TREE_VEC_ELT (new_vec
, i
)
4775 = build_tree_list (tsubst (default_value
, args
, NULL_TREE
),
4776 tsubst (parm_decl
, args
, NULL_TREE
));
4781 tree_cons (build_int_2 (0, (TMPL_PARMS_DEPTH (parms
)
4782 - TMPL_ARGS_DEPTH (args
))),
4783 new_vec
, NULL_TREE
);
4789 /* Substitute the ARGS into the indicated aggregate (or enumeration)
4790 type T. If T is not an aggregate or enumeration type, it is
4791 handled as if by tsubst. IN_DECL is as for tsubst. If
4792 ENTERING_SCOPE is non-zero, T is the context for a template which
4793 we are presently tsubst'ing. Return the subsituted value. */
4796 tsubst_aggr_type (t
, args
, in_decl
, entering_scope
)
4805 switch (TREE_CODE (t
))
4808 if (TYPE_PTRMEMFUNC_P (t
))
4810 tree r
= build_ptrmemfunc_type
4811 (tsubst (TYPE_PTRMEMFUNC_FN_TYPE (t
), args
, in_decl
));
4812 return cp_build_type_variant (r
, TYPE_READONLY (t
),
4816 /* else fall through */
4819 if (uses_template_parms (t
))
4825 /* First, determine the context for the type we are looking
4827 if (TYPE_CONTEXT (t
) != NULL_TREE
)
4828 context
= tsubst_aggr_type (TYPE_CONTEXT (t
), args
,
4829 in_decl
, /*entering_scope=*/1);
4831 context
= NULL_TREE
;
4833 /* Then, figure out what arguments are appropriate for the
4834 type we are trying to find. For example, given:
4836 template <class T> struct S;
4837 template <class T, class U> void f(T, U) { S<U> su; }
4839 and supposing that we are instantiating f<int, double>,
4840 then our ARGS will be {int, double}, but, when looking up
4841 S we only want {double}. */
4842 argvec
= tsubst (TYPE_TI_ARGS (t
), args
, in_decl
);
4844 r
= lookup_template_class (t
, argvec
, in_decl
, context
,
4847 return cp_build_type_variant (r
, TYPE_READONLY (t
),
4851 /* This is not a template type, so there's nothing to do. */
4855 return tsubst (t
, args
, in_decl
);
4859 /* Substitute the ARGS into the T, which is a _DECL. TYPE is the
4860 (already computed) substitution of ARGS into TREE_TYPE (T), if
4861 appropriate. Return the result of the substitution. IN_DECL is as
4865 tsubst_decl (t
, args
, type
, in_decl
)
4872 char* saved_filename
;
4875 /* Set the filename and linenumber to improve error-reporting. */
4876 saved_lineno
= lineno
;
4877 saved_filename
= input_filename
;
4878 lineno
= DECL_SOURCE_LINE (t
);
4879 input_filename
= DECL_SOURCE_FILE (t
);
4881 switch (TREE_CODE (t
))
4885 /* We can get here when processing a member template function
4886 of a template class. */
4887 tree decl
= DECL_TEMPLATE_RESULT (t
);
4889 int is_template_template_parm
= DECL_TEMPLATE_TEMPLATE_PARM_P (t
);
4891 if (!is_template_template_parm
)
4893 /* We might already have an instance of this template.
4894 The ARGS are for the surrounding class type, so the
4895 full args contain the tsubst'd args for the context,
4896 plus the innermost args from the template decl. */
4897 tree tmpl_args
= DECL_CLASS_TEMPLATE_P (t
)
4898 ? CLASSTYPE_TI_ARGS (TREE_TYPE (t
))
4899 : DECL_TI_ARGS (DECL_RESULT (t
));
4900 tree full_args
= tsubst (tmpl_args
, args
, in_decl
);
4902 /* tsubst_template_arg_vector doesn't copy the vector if
4903 nothing changed. But, *something* should have
4905 my_friendly_assert (full_args
!= tmpl_args
, 0);
4907 spec
= retrieve_specialization (t
, full_args
);
4908 if (spec
!= NULL_TREE
)
4915 /* Make a new template decl. It will be similar to the
4916 original, but will record the current template arguments.
4917 We also create a new function declaration, which is just
4918 like the old one, but points to this new template, rather
4919 than the old one. */
4922 my_friendly_assert (DECL_LANG_SPECIFIC (r
) != 0, 0);
4923 TREE_CHAIN (r
) = NULL_TREE
;
4925 if (is_template_template_parm
)
4927 tree new_decl
= tsubst (decl
, args
, in_decl
);
4928 DECL_RESULT (r
) = new_decl
;
4929 TREE_TYPE (r
) = TREE_TYPE (new_decl
);
4934 = tsubst_aggr_type (DECL_CONTEXT (t
), args
, in_decl
,
4935 /*entering_scope=*/1);
4936 DECL_CLASS_CONTEXT (r
)
4937 = tsubst_aggr_type (DECL_CLASS_CONTEXT (t
), args
, in_decl
,
4938 /*entering_scope=*/1);
4939 DECL_TEMPLATE_INFO (r
) = build_tree_list (t
, args
);
4941 if (TREE_CODE (decl
) == TYPE_DECL
)
4943 tree new_type
= tsubst (TREE_TYPE (t
), args
, in_decl
);
4944 TREE_TYPE (r
) = new_type
;
4945 CLASSTYPE_TI_TEMPLATE (new_type
) = r
;
4946 DECL_RESULT (r
) = TYPE_MAIN_DECL (new_type
);
4947 DECL_TI_ARGS (r
) = CLASSTYPE_TI_ARGS (new_type
);
4951 tree new_decl
= tsubst (decl
, args
, in_decl
);
4952 DECL_RESULT (r
) = new_decl
;
4953 DECL_TI_TEMPLATE (new_decl
) = r
;
4954 TREE_TYPE (r
) = TREE_TYPE (new_decl
);
4955 DECL_TI_ARGS (r
) = DECL_TI_ARGS (new_decl
);
4958 SET_DECL_IMPLICIT_INSTANTIATION (r
);
4959 DECL_TEMPLATE_INSTANTIATIONS (r
) = NULL_TREE
;
4960 DECL_TEMPLATE_SPECIALIZATIONS (r
) = NULL_TREE
;
4962 /* The template parameters for this new template are all the
4963 template parameters for the old template, except the
4964 outermost level of parameters. */
4965 DECL_TEMPLATE_PARMS (r
)
4966 = tsubst_template_parms (DECL_TEMPLATE_PARMS (t
), args
);
4968 if (PRIMARY_TEMPLATE_P (t
))
4969 DECL_PRIMARY_TEMPLATE (r
) = r
;
4971 /* We don't partially instantiate partial specializations. */
4972 if (TREE_CODE (decl
) == TYPE_DECL
)
4975 for (spec
= DECL_TEMPLATE_SPECIALIZATIONS (t
);
4977 spec
= TREE_CHAIN (spec
))
4979 /* It helps to consider example here. Consider:
4990 Now, for example, we are instantiating S<int>::f(U u).
4991 We want to make a template:
4996 It will have a specialization, for the case U = int*, of
5000 void S<int>::f<int*>(int*);
5002 This specialization will be an instantiation of
5003 the specialization given in the declaration of S, with
5004 argument list int*. */
5006 tree fn
= TREE_VALUE (spec
);
5010 if (!DECL_TEMPLATE_SPECIALIZATION (fn
))
5011 /* Instantiations are on the same list, but they're of
5012 no concern to us. */
5015 if (TREE_CODE (fn
) != TEMPLATE_DECL
)
5016 /* A full specialization. There's no need to record
5020 spec_args
= tsubst (DECL_TI_ARGS (fn
), args
, in_decl
);
5021 new_fn
= tsubst (DECL_RESULT (most_general_template (fn
)),
5022 spec_args
, in_decl
);
5023 DECL_TI_TEMPLATE (new_fn
) = fn
;
5024 register_specialization (new_fn
, r
,
5025 innermost_args (spec_args
));
5028 /* Record this partial instantiation. */
5029 register_specialization (r
, t
,
5030 DECL_TI_ARGS (DECL_RESULT (r
)));
5038 tree argvec
= NULL_TREE
;
5044 /* Nobody should be tsubst'ing into non-template functions. */
5045 my_friendly_assert (DECL_TEMPLATE_INFO (t
) != NULL_TREE
, 0);
5047 if (TREE_CODE (DECL_TI_TEMPLATE (t
)) == TEMPLATE_DECL
)
5051 /* Calculate the most general template of which R is a
5052 specialization, and the complete set of arguments used to
5054 gen_tmpl
= most_general_template (DECL_TI_TEMPLATE (t
));
5055 argvec
= tsubst (DECL_TI_ARGS (DECL_TEMPLATE_RESULT (gen_tmpl
)),
5058 /* Check to see if we already have this specialization. */
5059 spec
= retrieve_specialization (gen_tmpl
, argvec
);
5066 /* Here, we deal with the peculiar case:
5068 template <class T> struct S {
5069 template <class U> friend void f();
5071 template <class U> friend void f() {}
5073 template void f<double>();
5075 Here, the ARGS for the instantiation of will be {int,
5076 double}. But, we only need as many ARGS as there are
5077 levels of template parameters in CODE_PATTERN. We are
5078 careful not to get fooled into reducing the ARGS in
5081 template <class T> struct S { template <class U> void f(U); }
5082 template <class T> template <> void S<T>::f(int) {}
5084 which we can spot because the pattern will be a
5085 specialization in this case. */
5086 args_depth
= TMPL_ARGS_DEPTH (args
);
5088 TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (DECL_TI_TEMPLATE (t
)));
5089 if (args_depth
> parms_depth
5090 && !DECL_TEMPLATE_SPECIALIZATION (t
))
5092 my_friendly_assert (DECL_FRIEND_P (t
), 0);
5094 if (parms_depth
> 1)
5098 args
= make_temp_vec (parms_depth
);
5099 for (i
= 0; i
< parms_depth
; ++i
)
5100 TREE_VEC_ELT (args
, i
) =
5101 TREE_VEC_ELT (args
, i
+ (args_depth
- parms_depth
));
5104 args
= TREE_VEC_ELT (args
, args_depth
- parms_depth
);
5109 /* This special case arises when we have something like this:
5111 template <class T> struct S {
5112 friend void f<int>(int, double);
5115 Here, the DECL_TI_TEMPLATE for the friend declaration
5116 will be a LOOKUP_EXPR or an IDENTIFIER_NODE. We are
5117 being called from tsubst_friend_function, and we want
5118 only to create a new decl (R) with appropriate types so
5119 that we can call determine_specialization. */
5120 my_friendly_assert ((TREE_CODE (DECL_TI_TEMPLATE (t
))
5122 || (TREE_CODE (DECL_TI_TEMPLATE (t
))
5123 == IDENTIFIER_NODE
), 0);
5124 gen_tmpl
= NULL_TREE
;
5127 if (DECL_CLASS_SCOPE_P (t
))
5129 if (DECL_NAME (t
) == constructor_name (DECL_CONTEXT (t
)))
5133 ctx
= tsubst_aggr_type (DECL_CLASS_CONTEXT (t
), args
, t
,
5134 /*entering_scope=*/1);
5141 type
= tsubst (type
, args
, in_decl
);
5143 /* We do NOT check for matching decls pushed separately at this
5144 point, as they may not represent instantiations of this
5145 template, and in any case are considered separate under the
5146 discrete model. Instead, see add_maybe_template. */
5150 DECL_USE_TEMPLATE (r
) = 0;
5151 TREE_TYPE (r
) = type
;
5154 = tsubst_aggr_type (DECL_CONTEXT (t
), args
, t
, /*entering_scope=*/1);
5155 DECL_CLASS_CONTEXT (r
) = ctx
;
5157 if (member
&& !strncmp (OPERATOR_TYPENAME_FORMAT
,
5158 IDENTIFIER_POINTER (DECL_NAME (r
)),
5159 sizeof (OPERATOR_TYPENAME_FORMAT
) - 1))
5161 /* Type-conversion operator. Reconstruct the name, in
5162 case it's the name of one of the template's parameters. */
5163 DECL_NAME (r
) = build_typename_overload (TREE_TYPE (type
));
5166 DECL_ARGUMENTS (r
) = tsubst (DECL_ARGUMENTS (t
), args
, t
);
5167 DECL_MAIN_VARIANT (r
) = r
;
5168 DECL_RESULT (r
) = NULL_TREE
;
5169 DECL_INITIAL (r
) = NULL_TREE
;
5171 TREE_STATIC (r
) = 0;
5172 TREE_PUBLIC (r
) = TREE_PUBLIC (t
);
5173 DECL_EXTERNAL (r
) = 1;
5174 DECL_INTERFACE_KNOWN (r
) = 0;
5175 DECL_DEFER_OUTPUT (r
) = 0;
5176 TREE_CHAIN (r
) = NULL_TREE
;
5177 DECL_PENDING_INLINE_INFO (r
) = 0;
5180 if (DECL_CONSTRUCTOR_P (r
))
5182 maybe_retrofit_in_chrg (r
);
5183 grok_ctor_properties (ctx
, r
);
5185 if (IDENTIFIER_OPNAME_P (DECL_NAME (r
)))
5186 grok_op_properties (r
, DECL_VIRTUAL_P (r
), DECL_FRIEND_P (r
));
5188 /* Set up the DECL_TEMPLATE_INFO for R and compute its mangled
5189 name. There's no need to do this in the special friend
5190 case mentioned above where GEN_TMPL is NULL. */
5193 DECL_TEMPLATE_INFO (r
)
5194 = perm_tree_cons (gen_tmpl
, argvec
, NULL_TREE
);
5195 SET_DECL_IMPLICIT_INSTANTIATION (r
);
5196 register_specialization (r
, gen_tmpl
, argvec
);
5198 /* Set the mangled name for R. */
5199 if (DECL_DESTRUCTOR_P (t
))
5200 DECL_ASSEMBLER_NAME (r
) = build_destructor_name (ctx
);
5203 /* Instantiations of template functions must be mangled
5204 specially, in order to conform to 14.5.5.1
5205 [temp.over.link]. */
5206 tree tmpl
= DECL_TI_TEMPLATE (t
);
5208 /* TMPL will be NULL if this is a specialization of a
5209 member function of a template class. */
5210 if (name_mangling_version
< 1
5211 || tmpl
== NULL_TREE
5212 || (member
&& !is_member_template (tmpl
)
5213 && !DECL_TEMPLATE_INFO (tmpl
)))
5214 set_mangled_name_for_decl (r
);
5216 set_mangled_name_for_template_decl (r
);
5220 make_decl_rtl (r
, NULL_PTR
, 1);
5222 /* Like grokfndecl. If we don't do this, pushdecl will
5223 mess up our TREE_CHAIN because it doesn't find a
5224 previous decl. Sigh. */
5226 && (IDENTIFIER_GLOBAL_VALUE (DECL_ASSEMBLER_NAME (r
))
5228 SET_IDENTIFIER_GLOBAL_VALUE (DECL_ASSEMBLER_NAME (r
), r
);
5236 TREE_TYPE (r
) = type
;
5237 if (TREE_CODE (DECL_INITIAL (r
)) != TEMPLATE_PARM_INDEX
)
5238 DECL_INITIAL (r
) = TREE_TYPE (r
);
5240 DECL_INITIAL (r
) = tsubst (DECL_INITIAL (r
), args
, in_decl
);
5242 DECL_CONTEXT (r
) = NULL_TREE
;
5243 #ifdef PROMOTE_PROTOTYPES
5244 if ((TREE_CODE (type
) == INTEGER_TYPE
5245 || TREE_CODE (type
) == ENUMERAL_TYPE
)
5246 && TYPE_PRECISION (type
) < TYPE_PRECISION (integer_type_node
))
5247 DECL_ARG_TYPE (r
) = integer_type_node
;
5250 TREE_CHAIN (r
) = tsubst (TREE_CHAIN (t
), args
, TREE_CHAIN (t
));
5257 TREE_TYPE (r
) = type
;
5260 DECL_FIELD_CONTEXT (r
) = tsubst (DECL_FIELD_CONTEXT (t
), args
, in_decl
);
5262 DECL_INITIAL (r
) = tsubst_expr (DECL_INITIAL (t
), args
, in_decl
);
5263 TREE_CHAIN (r
) = NULL_TREE
;
5264 if (TREE_CODE (type
) == VOID_TYPE
)
5265 cp_error_at ("instantiation of `%D' as type void", r
);
5273 = tsubst_copy (DECL_INITIAL (t
), args
, in_decl
);
5274 TREE_CHAIN (r
) = NULL_TREE
;
5284 tree ctx
= tsubst_aggr_type (DECL_CONTEXT (t
), args
, in_decl
,
5285 /*entering_scope=*/1);
5287 /* Nobody should be tsubst'ing into non-template variables. */
5288 my_friendly_assert (DECL_LANG_SPECIFIC (t
)
5289 && DECL_TEMPLATE_INFO (t
) != NULL_TREE
, 0);
5291 /* Check to see if we already have this specialization. */
5292 tmpl
= DECL_TI_TEMPLATE (t
);
5293 gen_tmpl
= most_general_template (tmpl
);
5294 argvec
= tsubst (DECL_TI_ARGS (t
), args
, in_decl
);
5295 spec
= retrieve_specialization (gen_tmpl
, argvec
);
5304 TREE_TYPE (r
) = type
;
5305 DECL_CONTEXT (r
) = ctx
;
5306 if (TREE_STATIC (r
))
5307 DECL_ASSEMBLER_NAME (r
)
5308 = build_static_name (DECL_CONTEXT (r
), DECL_NAME (r
));
5310 /* Don't try to expand the initializer until someone tries to use
5311 this variable; otherwise we run into circular dependencies. */
5312 DECL_INITIAL (r
) = NULL_TREE
;
5316 DECL_CLASS_CONTEXT (r
) = DECL_CONTEXT (r
);
5318 DECL_TEMPLATE_INFO (r
) = perm_tree_cons (tmpl
, argvec
, NULL_TREE
);
5319 SET_DECL_IMPLICIT_INSTANTIATION (r
);
5320 register_specialization (r
, gen_tmpl
, argvec
);
5322 TREE_CHAIN (r
) = NULL_TREE
;
5323 if (TREE_CODE (type
) == VOID_TYPE
)
5324 cp_error_at ("instantiation of `%D' as type void", r
);
5329 if (t
== TYPE_NAME (TREE_TYPE (t
)))
5330 r
= TYPE_NAME (type
);
5334 TREE_TYPE (r
) = type
;
5335 DECL_CONTEXT (r
) = current_class_type
;
5336 TREE_CHAIN (r
) = NULL_TREE
;
5341 my_friendly_abort (0);
5344 /* Restore the file and line information. */
5345 lineno
= saved_lineno
;
5346 input_filename
= saved_filename
;
5351 /* Substitue into the ARG_TYPES of a function type. */
5354 tsubst_arg_types (arg_types
, args
, in_decl
)
5359 tree remaining_arg_types
;
5362 if (!arg_types
|| arg_types
== void_list_node
)
5365 remaining_arg_types
= tsubst_arg_types (TREE_CHAIN (arg_types
),
5368 /* We use TYPE_MAIN_VARIANT is because top-level qualifiers don't
5369 matter on function types. */
5370 type
= TYPE_MAIN_VARIANT (type_decays_to
5371 (tsubst (TREE_VALUE (arg_types
),
5374 /* Note that we do not substitute into default arguments here. The
5375 standard mandates that they be instantiated only when needed,
5376 which is done in build_over_call. */
5377 return hash_tree_cons_simple (TREE_PURPOSE (arg_types
), type
,
5378 remaining_arg_types
);
5382 /* Take the tree structure T and replace template parameters used therein
5383 with the argument vector ARGS. IN_DECL is an associated decl for
5386 tsubst is used for dealing with types, decls and the like; for
5387 expressions, use tsubst_expr or tsubst_copy. */
5390 tsubst (t
, args
, in_decl
)
5396 if (t
== NULL_TREE
|| t
== error_mark_node
5397 || t
== integer_type_node
5398 || t
== void_type_node
5399 || t
== char_type_node
5400 || TREE_CODE (t
) == NAMESPACE_DECL
)
5403 if (TREE_CODE (t
) == IDENTIFIER_NODE
)
5404 type
= IDENTIFIER_TYPE_VALUE (t
);
5406 type
= TREE_TYPE (t
);
5407 if (type
== unknown_type_node
)
5408 my_friendly_abort (42);
5410 if (type
&& TREE_CODE (t
) != FUNCTION_DECL
5411 && TREE_CODE (t
) != TYPENAME_TYPE
5412 && TREE_CODE (t
) != TEMPLATE_DECL
5413 && TREE_CODE (t
) != IDENTIFIER_NODE
)
5414 type
= tsubst (type
, args
, in_decl
);
5416 if (TREE_CODE_CLASS (TREE_CODE (t
)) == 'd')
5417 return tsubst_decl (t
, args
, type
, in_decl
);
5419 switch (TREE_CODE (t
))
5424 return tsubst_aggr_type (t
, args
, in_decl
, /*entering_scope=*/0);
5427 case IDENTIFIER_NODE
:
5439 if (t
== integer_type_node
)
5442 if (TREE_CODE (TYPE_MIN_VALUE (t
)) == INTEGER_CST
5443 && TREE_CODE (TYPE_MAX_VALUE (t
)) == INTEGER_CST
)
5447 tree max
= TREE_OPERAND (TYPE_MAX_VALUE (t
), 0);
5448 max
= tsubst_expr (max
, args
, in_decl
);
5449 if (processing_template_decl
)
5451 tree itype
= make_node (INTEGER_TYPE
);
5452 TYPE_MIN_VALUE (itype
) = size_zero_node
;
5453 TYPE_MAX_VALUE (itype
) = build_min (MINUS_EXPR
, sizetype
, max
,
5458 max
= fold (build_binary_op (MINUS_EXPR
, max
, integer_one_node
, 1));
5459 return build_index_2_type (size_zero_node
, max
);
5462 case TEMPLATE_TYPE_PARM
:
5463 case TEMPLATE_TEMPLATE_PARM
:
5464 case TEMPLATE_PARM_INDEX
:
5471 if (TREE_CODE (t
) == TEMPLATE_TYPE_PARM
5472 || TREE_CODE (t
) == TEMPLATE_TEMPLATE_PARM
)
5474 idx
= TEMPLATE_TYPE_IDX (t
);
5475 level
= TEMPLATE_TYPE_LEVEL (t
);
5479 idx
= TEMPLATE_PARM_IDX (t
);
5480 level
= TEMPLATE_PARM_LEVEL (t
);
5483 if (TREE_VEC_LENGTH (args
) > 0)
5485 tree arg
= NULL_TREE
;
5487 levels
= TMPL_ARGS_DEPTH (args
);
5488 if (level
<= levels
)
5489 arg
= TMPL_ARG (args
, level
, idx
);
5491 if (arg
== error_mark_node
)
5492 return error_mark_node
;
5493 else if (arg
!= NULL_TREE
)
5495 if (TREE_CODE (t
) == TEMPLATE_TYPE_PARM
)
5497 my_friendly_assert (TREE_CODE_CLASS (TREE_CODE (arg
))
5499 return cp_build_type_variant
5500 (arg
, TYPE_READONLY (arg
) || TYPE_READONLY (t
),
5501 TYPE_VOLATILE (arg
) || TYPE_VOLATILE (t
));
5503 else if (TREE_CODE (t
) == TEMPLATE_TEMPLATE_PARM
)
5505 if (CLASSTYPE_TEMPLATE_INFO (t
))
5507 /* We are processing a type constructed from
5508 a template template parameter */
5509 tree argvec
= tsubst (CLASSTYPE_TI_ARGS (t
),
5513 /* We can get a TEMPLATE_TEMPLATE_PARM here when
5514 we are resolving nested-types in the signature of
5515 a member function templates.
5516 Otherwise ARG is a TEMPLATE_DECL and is the real
5517 template to be instantiated. */
5518 if (TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
)
5519 arg
= TYPE_NAME (arg
);
5521 r
= lookup_template_class (DECL_NAME (arg
),
5524 /*entering_scope=*/0);
5525 return cp_build_type_variant (r
, TYPE_READONLY (t
),
5529 /* We are processing a template argument list. */
5538 /* This can happen during the attempted tsubst'ing in
5539 unify. This means that we don't yet have any information
5540 about the template parameter in question. */
5543 /* If we get here, we must have been looking at a parm for a
5544 more deeply nested template. Make a new version of this
5545 template parameter, but with a lower level. */
5546 switch (TREE_CODE (t
))
5548 case TEMPLATE_TYPE_PARM
:
5549 case TEMPLATE_TEMPLATE_PARM
:
5551 TEMPLATE_TYPE_PARM_INDEX (r
)
5552 = reduce_template_parm_level (TEMPLATE_TYPE_PARM_INDEX (t
),
5554 TYPE_STUB_DECL (r
) = TYPE_NAME (r
) = TEMPLATE_TYPE_DECL (r
);
5555 TYPE_MAIN_VARIANT (r
) = r
;
5556 TYPE_POINTER_TO (r
) = NULL_TREE
;
5557 TYPE_REFERENCE_TO (r
) = NULL_TREE
;
5559 if (TREE_CODE (t
) == TEMPLATE_TEMPLATE_PARM
5560 && CLASSTYPE_TEMPLATE_INFO (t
))
5562 tree argvec
= tsubst (CLASSTYPE_TI_ARGS (t
), args
, in_decl
);
5563 CLASSTYPE_TEMPLATE_INFO (r
)
5564 = perm_tree_cons (TYPE_NAME (t
), argvec
, NULL_TREE
);
5568 case TEMPLATE_PARM_INDEX
:
5569 r
= reduce_template_parm_level (t
, type
, levels
);
5573 my_friendly_abort (0);
5581 tree purpose
, value
, chain
, result
;
5582 int via_public
, via_virtual
, via_protected
;
5584 if (t
== void_list_node
)
5587 via_public
= TREE_VIA_PUBLIC (t
);
5588 via_protected
= TREE_VIA_PROTECTED (t
);
5589 via_virtual
= TREE_VIA_VIRTUAL (t
);
5591 purpose
= TREE_PURPOSE (t
);
5593 purpose
= tsubst (purpose
, args
, in_decl
);
5594 value
= TREE_VALUE (t
);
5596 value
= tsubst (value
, args
, in_decl
);
5597 chain
= TREE_CHAIN (t
);
5598 if (chain
&& chain
!= void_type_node
)
5599 chain
= tsubst (chain
, args
, in_decl
);
5600 if (purpose
== TREE_PURPOSE (t
)
5601 && value
== TREE_VALUE (t
)
5602 && chain
== TREE_CHAIN (t
))
5604 result
= hash_tree_cons (via_public
, via_virtual
, via_protected
,
5605 purpose
, value
, chain
);
5606 TREE_PARMLIST (result
) = TREE_PARMLIST (t
);
5610 if (type
!= NULL_TREE
)
5612 /* A binfo node. We always need to make a copy, of the node
5613 itself and of its BINFO_BASETYPES. */
5617 /* Make sure type isn't a typedef copy. */
5618 type
= BINFO_TYPE (TYPE_BINFO (type
));
5620 TREE_TYPE (t
) = complete_type (type
);
5621 if (IS_AGGR_TYPE (type
))
5623 BINFO_VTABLE (t
) = TYPE_BINFO_VTABLE (type
);
5624 BINFO_VIRTUALS (t
) = TYPE_BINFO_VIRTUALS (type
);
5625 if (TYPE_BINFO_BASETYPES (type
) != NULL_TREE
)
5626 BINFO_BASETYPES (t
) = copy_node (TYPE_BINFO_BASETYPES (type
));
5631 /* Otherwise, a vector of template arguments. */
5632 return tsubst_template_arg_vector (t
, args
);
5635 case REFERENCE_TYPE
:
5638 enum tree_code code
;
5640 if (type
== TREE_TYPE (t
))
5643 code
= TREE_CODE (t
);
5644 if (TREE_CODE (type
) == REFERENCE_TYPE
)
5646 static int last_line
= 0;
5647 static char* last_file
= 0;
5649 /* We keep track of the last time we issued this error
5650 message to avoid spewing a ton of messages during a
5651 single bad template instantiation. */
5652 if (last_line
!= lineno
||
5653 last_file
!= input_filename
)
5655 cp_error ("cannot form type %s to reference type %T during template instantiation",
5656 (code
== POINTER_TYPE
) ? "pointer" : "reference",
5659 last_file
= input_filename
;
5662 /* Use the underlying type in an attempt at error
5663 recovery; maybe the user meant vector<int> and wrote
5664 vector<int&>, or some such. */
5665 if (code
== REFERENCE_TYPE
)
5668 r
= build_pointer_type (TREE_TYPE (type
));
5670 else if (code
== POINTER_TYPE
)
5671 r
= build_pointer_type (type
);
5673 r
= build_reference_type (type
);
5674 r
= cp_build_type_variant (r
, TYPE_READONLY (t
), TYPE_VOLATILE (t
));
5676 /* Will this ever be needed for TYPE_..._TO values? */
5681 return build_offset_type
5682 (tsubst (TYPE_OFFSET_BASETYPE (t
), args
, in_decl
), type
);
5690 /* The TYPE_CONTEXT is not used for function/method types. */
5691 my_friendly_assert (TYPE_CONTEXT (t
) == NULL_TREE
, 0);
5693 /* Substitue the argument types. */
5694 arg_types
= tsubst_arg_types (TYPE_ARG_TYPES (t
), args
, in_decl
);
5696 /* Construct a new type node and return it. */
5697 if (TREE_CODE (t
) == FUNCTION_TYPE
)
5698 fntype
= build_function_type (type
, arg_types
);
5701 = build_cplus_method_type (TREE_TYPE (TREE_VALUE (arg_types
)),
5703 TREE_CHAIN (arg_types
));
5705 fntype
= build_type_variant (fntype
,
5709 /* Substitue the exception specification. */
5710 raises
= TYPE_RAISES_EXCEPTIONS (t
);
5713 raises
= tsubst (raises
, args
, in_decl
);
5714 fntype
= build_exception_variant (fntype
, raises
);
5720 tree domain
= tsubst (TYPE_DOMAIN (t
), args
, in_decl
);
5722 if (type
== TREE_TYPE (t
) && domain
== TYPE_DOMAIN (t
))
5724 r
= build_cplus_array_type (type
, domain
);
5730 return fold (build (TREE_CODE (t
), TREE_TYPE (t
),
5731 tsubst (TREE_OPERAND (t
, 0), args
, in_decl
),
5732 tsubst (TREE_OPERAND (t
, 1), args
, in_decl
)));
5736 return fold (build1 (TREE_CODE (t
), TREE_TYPE (t
),
5737 tsubst (TREE_OPERAND (t
, 0), args
, in_decl
)));
5741 tree ctx
= tsubst_aggr_type (TYPE_CONTEXT (t
), args
, in_decl
,
5742 /*entering_scope=*/1);
5743 tree f
= tsubst_copy (TYPENAME_TYPE_FULLNAME (t
), args
, in_decl
);
5745 /* Normally, make_typename_type does not require that the CTX
5746 have complete type in order to allow things like:
5748 template <class T> struct S { typename S<T>::X Y; };
5750 But, such constructs have already been resolved by this
5751 point, so here CTX really should have complete type, unless
5752 it's a partial instantiation. */
5753 if (!uses_template_parms (ctx
)
5754 && !complete_type_or_else (ctx
))
5755 return error_mark_node
;
5757 f
= make_typename_type (ctx
, f
);
5758 return cp_build_type_variant
5759 (f
, TYPE_READONLY (f
) || TYPE_READONLY (t
),
5760 TYPE_VOLATILE (f
) || TYPE_VOLATILE (t
));
5764 return make_pointer_declarator
5765 (type
, tsubst (TREE_OPERAND (t
, 0), args
, in_decl
));
5768 return make_reference_declarator
5769 (type
, tsubst (TREE_OPERAND (t
, 0), args
, in_decl
));
5772 return build_parse_node
5773 (ARRAY_REF
, tsubst (TREE_OPERAND (t
, 0), args
, in_decl
),
5774 tsubst_expr (TREE_OPERAND (t
, 1), args
, in_decl
));
5777 return make_call_declarator
5778 (tsubst (TREE_OPERAND (t
, 0), args
, in_decl
),
5779 tsubst (TREE_OPERAND (t
, 1), args
, in_decl
),
5780 TREE_OPERAND (t
, 2),
5781 tsubst (TREE_TYPE (t
), args
, in_decl
));
5784 return build_parse_node
5785 (TREE_CODE (t
), tsubst (TREE_OPERAND (t
, 0), args
, in_decl
),
5786 tsubst (TREE_OPERAND (t
, 1), args
, in_decl
));
5789 sorry ("use of `%s' in template",
5790 tree_code_name
[(int) TREE_CODE (t
)]);
5791 return error_mark_node
;
5798 emit_line_note (input_filename
, lineno
);
5802 expand_start_bindings (0);
5809 int saved_warn_unused
= 0;
5811 if (processing_template_decl
)
5813 saved_warn_unused
= warn_unused
;
5816 expand_end_bindings (getdecls (), kept_level_p (), 0);
5817 if (processing_template_decl
)
5818 warn_unused
= saved_warn_unused
;
5819 t
= poplevel (kept_level_p (), 1, 0);
5824 /* Like tsubst, but deals with expressions. This function just replaces
5825 template parms; to finish processing the resultant expression, use
5829 tsubst_copy (t
, args
, in_decl
)
5833 enum tree_code code
;
5835 if (t
== NULL_TREE
|| t
== error_mark_node
)
5838 code
= TREE_CODE (t
);
5843 return do_identifier (DECL_NAME (t
), 0, NULL_TREE
);
5850 if (!DECL_CONTEXT (t
))
5851 /* This is a global enumeration constant. */
5854 /* Unfortunately, we cannot just call lookup_name here.
5857 template <int I> int f() {
5859 struct S { void g() { E e = a; } };
5862 When we instantiate f<7>::S::g(), say, lookup_name is not
5863 clever enough to find f<7>::a. */
5865 = tsubst_aggr_type (TREE_TYPE (t
), args
, in_decl
,
5866 /*entering_scope=*/0);
5868 for (v
= TYPE_VALUES (enum_type
);
5871 if (TREE_PURPOSE (v
) == DECL_NAME (t
))
5872 return TREE_VALUE (v
);
5874 /* We didn't find the name. That should never happen; if
5875 name-lookup found it during preliminary parsing, we
5876 should find it again here during instantiation. */
5877 my_friendly_abort (0);
5882 if (DECL_CONTEXT (t
))
5886 ctx
= tsubst_aggr_type (DECL_CONTEXT (t
), args
, in_decl
,
5887 /*entering_scope=*/1);
5888 if (ctx
!= DECL_CONTEXT (t
))
5889 return lookup_field (ctx
, DECL_NAME (t
), 0, 0);
5895 if (DECL_LANG_SPECIFIC (t
) && DECL_TEMPLATE_INFO (t
))
5896 t
= tsubst (t
, args
, in_decl
);
5901 if (is_member_template (t
))
5902 return tsubst (t
, args
, in_decl
);
5908 /* We must tsbust into a LOOKUP_EXPR in case the names to
5909 which it refers is a conversion operator; in that case the
5910 name will change. We avoid making unnecessary copies,
5913 tree id
= tsubst_copy (TREE_OPERAND (t
, 0), args
, in_decl
);
5915 if (id
!= TREE_OPERAND (t
, 0))
5917 tree r
= build_nt (LOOKUP_EXPR
, id
);
5918 LOOKUP_EXPR_GLOBAL (r
) = LOOKUP_EXPR_GLOBAL (t
);
5926 case REINTERPRET_CAST_EXPR
:
5927 case CONST_CAST_EXPR
:
5928 case STATIC_CAST_EXPR
:
5929 case DYNAMIC_CAST_EXPR
:
5931 (code
, tsubst (TREE_TYPE (t
), args
, in_decl
),
5932 tsubst_copy (TREE_OPERAND (t
, 0), args
, in_decl
));
5935 case PREDECREMENT_EXPR
:
5936 case PREINCREMENT_EXPR
:
5937 case POSTDECREMENT_EXPR
:
5938 case POSTINCREMENT_EXPR
:
5940 case TRUTH_NOT_EXPR
:
5943 case CONVERT_EXPR
: /* Unary + */
5951 tsubst_copy (TREE_OPERAND (t
, 0), args
, in_decl
));
5956 case TRUNC_DIV_EXPR
:
5958 case FLOOR_DIV_EXPR
:
5959 case ROUND_DIV_EXPR
:
5960 case EXACT_DIV_EXPR
:
5962 case BIT_ANDTC_EXPR
:
5965 case TRUNC_MOD_EXPR
:
5966 case FLOOR_MOD_EXPR
:
5967 case TRUTH_ANDIF_EXPR
:
5968 case TRUTH_ORIF_EXPR
:
5969 case TRUTH_AND_EXPR
:
5990 (code
, tsubst_copy (TREE_OPERAND (t
, 0), args
, in_decl
),
5991 tsubst_copy (TREE_OPERAND (t
, 1), args
, in_decl
));
5995 tree fn
= TREE_OPERAND (t
, 0);
5996 if (is_overloaded_fn (fn
))
5997 fn
= tsubst_copy (get_first_fn (fn
), args
, in_decl
);
5999 /* Sometimes FN is a LOOKUP_EXPR. */
6000 fn
= tsubst_copy (fn
, args
, in_decl
);
6002 (code
, fn
, tsubst_copy (TREE_OPERAND (t
, 1), args
, in_decl
),
6006 case METHOD_CALL_EXPR
:
6008 tree name
= TREE_OPERAND (t
, 0);
6009 if (TREE_CODE (name
) == BIT_NOT_EXPR
)
6011 name
= tsubst_copy (TREE_OPERAND (name
, 0), args
, in_decl
);
6012 name
= build1 (BIT_NOT_EXPR
, NULL_TREE
, name
);
6014 else if (TREE_CODE (name
) == SCOPE_REF
6015 && TREE_CODE (TREE_OPERAND (name
, 1)) == BIT_NOT_EXPR
)
6017 tree base
= tsubst_copy (TREE_OPERAND (name
, 0), args
, in_decl
);
6018 name
= TREE_OPERAND (name
, 1);
6019 name
= tsubst_copy (TREE_OPERAND (name
, 0), args
, in_decl
);
6020 name
= build1 (BIT_NOT_EXPR
, NULL_TREE
, name
);
6021 name
= build_nt (SCOPE_REF
, base
, name
);
6024 name
= tsubst_copy (TREE_OPERAND (t
, 0), args
, in_decl
);
6026 (code
, name
, tsubst_copy (TREE_OPERAND (t
, 1), args
, in_decl
),
6027 tsubst_copy (TREE_OPERAND (t
, 2), args
, in_decl
),
6036 (code
, tsubst_copy (TREE_OPERAND (t
, 0), args
, in_decl
),
6037 tsubst_copy (TREE_OPERAND (t
, 1), args
, in_decl
),
6038 tsubst_copy (TREE_OPERAND (t
, 2), args
, in_decl
));
6040 if (code
== BIND_EXPR
&& !processing_template_decl
)
6042 /* This processing should really occur in tsubst_expr,
6043 However, tsubst_expr does not recurse into expressions,
6044 since it assumes that there aren't any statements
6045 inside them. Instead, it simply calls
6046 build_expr_from_tree. So, we need to expand the
6048 tree rtl_expr
= begin_stmt_expr ();
6049 tree block
= tsubst_expr (TREE_OPERAND (r
, 1), args
, in_decl
);
6050 r
= finish_stmt_expr (rtl_expr
, block
);
6059 (code
, tsubst_copy (TREE_OPERAND (t
, 0), args
, in_decl
),
6060 tsubst_copy (TREE_OPERAND (t
, 1), args
, in_decl
),
6061 tsubst_copy (TREE_OPERAND (t
, 2), args
, in_decl
));
6062 NEW_EXPR_USE_GLOBAL (r
) = NEW_EXPR_USE_GLOBAL (t
);
6069 (code
, tsubst_copy (TREE_OPERAND (t
, 0), args
, in_decl
),
6070 tsubst_copy (TREE_OPERAND (t
, 1), args
, in_decl
));
6071 DELETE_EXPR_USE_GLOBAL (r
) = DELETE_EXPR_USE_GLOBAL (t
);
6072 DELETE_EXPR_USE_VEC (r
) = DELETE_EXPR_USE_VEC (t
);
6076 case TEMPLATE_ID_EXPR
:
6078 /* Substituted template arguments */
6079 tree targs
= tsubst_copy (TREE_OPERAND (t
, 1), args
, in_decl
);
6081 for (chain
= targs
; chain
; chain
= TREE_CHAIN (chain
))
6082 TREE_VALUE (chain
) = maybe_fold_nontype_arg (TREE_VALUE (chain
));
6084 return lookup_template_function
6085 (tsubst_copy (TREE_OPERAND (t
, 0), args
, in_decl
), targs
);
6090 tree purpose
, value
, chain
;
6092 if (t
== void_list_node
)
6095 purpose
= TREE_PURPOSE (t
);
6097 purpose
= tsubst_copy (purpose
, args
, in_decl
);
6098 value
= TREE_VALUE (t
);
6100 value
= tsubst_copy (value
, args
, in_decl
);
6101 chain
= TREE_CHAIN (t
);
6102 if (chain
&& chain
!= void_type_node
)
6103 chain
= tsubst_copy (chain
, args
, in_decl
);
6104 if (purpose
== TREE_PURPOSE (t
)
6105 && value
== TREE_VALUE (t
)
6106 && chain
== TREE_CHAIN (t
))
6108 return tree_cons (purpose
, value
, chain
);
6115 case TEMPLATE_TYPE_PARM
:
6116 case TEMPLATE_TEMPLATE_PARM
:
6117 case TEMPLATE_PARM_INDEX
:
6119 case REFERENCE_TYPE
:
6126 return tsubst (t
, args
, in_decl
);
6128 case IDENTIFIER_NODE
:
6129 if (IDENTIFIER_TYPENAME_P (t
)
6130 /* Make sure it's not just a variable named `__opr', for instance,
6131 which can occur in some existing code. */
6133 return build_typename_overload
6134 (tsubst (TREE_TYPE (t
), args
, in_decl
));
6140 (CONSTRUCTOR
, tsubst (TREE_TYPE (t
), args
, in_decl
), NULL_TREE
,
6141 tsubst_copy (CONSTRUCTOR_ELTS (t
), args
, in_decl
));
6148 /* Like tsubst_copy, but also does semantic processing and RTL expansion. */
6151 tsubst_expr (t
, args
, in_decl
)
6155 if (t
== NULL_TREE
|| t
== error_mark_node
)
6158 if (processing_template_decl
)
6159 return tsubst_copy (t
, args
, in_decl
);
6161 switch (TREE_CODE (t
))
6164 lineno
= TREE_COMPLEXITY (t
);
6165 finish_return_stmt (tsubst_expr (RETURN_EXPR (t
),
6170 lineno
= TREE_COMPLEXITY (t
);
6171 finish_expr_stmt (tsubst_expr (EXPR_STMT_EXPR (t
),
6177 int i
= suspend_momentary ();
6180 lineno
= TREE_COMPLEXITY (t
);
6181 emit_line_note (input_filename
, lineno
);
6183 (tsubst (TREE_OPERAND (t
, 0), args
, in_decl
),
6184 tsubst (TREE_OPERAND (t
, 1), args
, in_decl
),
6185 TREE_OPERAND (t
, 2) != 0, NULL_TREE
, NULL_TREE
);
6186 init
= tsubst_expr (TREE_OPERAND (t
, 2), args
, in_decl
);
6188 (dcl
, init
, NULL_TREE
, 1, /*init ? LOOKUP_ONLYCONVERTING :*/ 0);
6189 resume_momentary (i
);
6196 lineno
= TREE_COMPLEXITY (t
);
6199 for (tmp
= FOR_INIT_STMT (t
); tmp
; tmp
= TREE_CHAIN (tmp
))
6200 tsubst_expr (tmp
, args
, in_decl
);
6201 finish_for_init_stmt (NULL_TREE
);
6202 finish_for_cond (tsubst_expr (FOR_COND (t
), args
,
6205 tmp
= tsubst_expr (FOR_EXPR (t
), args
, in_decl
);
6206 finish_for_expr (tmp
, NULL_TREE
);
6207 tsubst_expr (FOR_BODY (t
), args
, in_decl
);
6208 finish_for_stmt (tmp
, NULL_TREE
);
6214 lineno
= TREE_COMPLEXITY (t
);
6215 begin_while_stmt ();
6216 finish_while_stmt_cond (tsubst_expr (WHILE_COND (t
),
6219 tsubst_expr (WHILE_BODY (t
), args
, in_decl
);
6220 finish_while_stmt (NULL_TREE
);
6226 lineno
= TREE_COMPLEXITY (t
);
6228 tsubst_expr (DO_BODY (t
), args
, in_decl
);
6229 finish_do_body (NULL_TREE
);
6230 finish_do_stmt (tsubst_expr (DO_COND (t
), args
,
6240 lineno
= TREE_COMPLEXITY (t
);
6242 finish_if_stmt_cond (tsubst_expr (IF_COND (t
),
6246 if (tmp
= THEN_CLAUSE (t
), tmp
)
6248 tsubst_expr (tmp
, args
, in_decl
);
6249 finish_then_clause (NULL_TREE
);
6252 if (tmp
= ELSE_CLAUSE (t
), tmp
)
6254 begin_else_clause ();
6255 tsubst_expr (tmp
, args
, in_decl
);
6256 finish_else_clause (NULL_TREE
);
6267 lineno
= TREE_COMPLEXITY (t
);
6268 begin_compound_stmt (COMPOUND_STMT_NO_SCOPE (t
));
6269 for (substmt
= COMPOUND_BODY (t
);
6270 substmt
!= NULL_TREE
;
6271 substmt
= TREE_CHAIN (substmt
))
6272 tsubst_expr (substmt
, args
, in_decl
);
6273 return finish_compound_stmt (COMPOUND_STMT_NO_SCOPE (t
),
6279 lineno
= TREE_COMPLEXITY (t
);
6280 finish_break_stmt ();
6284 lineno
= TREE_COMPLEXITY (t
);
6285 finish_continue_stmt ();
6292 lineno
= TREE_COMPLEXITY (t
);
6293 begin_switch_stmt ();
6294 val
= tsubst_expr (SWITCH_COND (t
), args
, in_decl
);
6295 finish_switch_cond (val
);
6297 if (tmp
= TREE_OPERAND (t
, 1), tmp
)
6298 tsubst_expr (tmp
, args
, in_decl
);
6300 finish_switch_stmt (val
, NULL_TREE
);
6305 finish_case_label (tsubst_expr (CASE_LOW (t
), args
, in_decl
),
6306 tsubst_expr (CASE_HIGH (t
), args
, in_decl
));
6310 t
= define_label (DECL_SOURCE_FILE (t
), DECL_SOURCE_LINE (t
),
6317 lineno
= TREE_COMPLEXITY (t
);
6318 t
= GOTO_DESTINATION (t
);
6319 if (TREE_CODE (t
) != IDENTIFIER_NODE
)
6320 /* Computed goto's must be tsubst'd into. On the other hand,
6321 non-computed gotos must not be; the identifier in question
6322 will have no binding. */
6323 t
= tsubst_expr (t
, args
, in_decl
);
6324 finish_goto_stmt (t
);
6328 lineno
= TREE_COMPLEXITY (t
);
6329 finish_asm_stmt (tsubst_expr (ASM_CV_QUAL (t
), args
, in_decl
),
6330 tsubst_expr (ASM_STRING (t
), args
, in_decl
),
6331 tsubst_expr (ASM_OUTPUTS (t
), args
, in_decl
),
6332 tsubst_expr (ASM_INPUTS (t
), args
, in_decl
),
6333 tsubst_expr (ASM_CLOBBERS (t
), args
, in_decl
));
6337 lineno
= TREE_COMPLEXITY (t
);
6339 tsubst_expr (TRY_STMTS (t
), args
, in_decl
);
6340 finish_try_block (NULL_TREE
);
6342 tree handler
= TRY_HANDLERS (t
);
6343 for (; handler
; handler
= TREE_CHAIN (handler
))
6344 tsubst_expr (handler
, args
, in_decl
);
6346 finish_handler_sequence (NULL_TREE
);
6350 lineno
= TREE_COMPLEXITY (t
);
6352 if (HANDLER_PARMS (t
))
6354 tree d
= HANDLER_PARMS (t
);
6355 expand_start_catch_block
6356 (tsubst (TREE_OPERAND (d
, 1), args
, in_decl
),
6357 tsubst (TREE_OPERAND (d
, 0), args
, in_decl
));
6360 expand_start_catch_block (NULL_TREE
, NULL_TREE
);
6361 finish_handler_parms (NULL_TREE
);
6362 tsubst_expr (HANDLER_BODY (t
), args
, in_decl
);
6363 finish_handler (NULL_TREE
);
6367 lineno
= TREE_COMPLEXITY (t
);
6369 if (TREE_CODE (t
) == ENUMERAL_TYPE
)
6370 tsubst (t
, args
, NULL_TREE
);
6374 return build_expr_from_tree (tsubst_copy (t
, args
, in_decl
));
6379 /* Instantiate the indicated variable of function template TMPL with
6380 the template arguments in TARG_PTR. */
6383 instantiate_template (tmpl
, targ_ptr
)
6384 tree tmpl
, targ_ptr
;
6390 struct obstack
*old_fmp_obstack
;
6391 extern struct obstack
*function_maybepermanent_obstack
;
6394 if (tmpl
== error_mark_node
)
6395 return error_mark_node
;
6397 my_friendly_assert (TREE_CODE (tmpl
) == TEMPLATE_DECL
, 283);
6399 /* Check to see if we already have this specialization. */
6400 spec
= retrieve_specialization (tmpl
, targ_ptr
);
6401 if (spec
!= NULL_TREE
)
6404 if (DECL_TEMPLATE_INFO (tmpl
))
6406 /* The TMPL is a partial instantiation. To get a full set of
6407 arguments we must add the arguments used to perform the
6408 partial instantiation. */
6409 targ_ptr
= add_outermost_template_args (DECL_TI_ARGS (tmpl
),
6411 gen_tmpl
= most_general_template (tmpl
);
6413 /* Check to see if we already have this specialization. */
6414 spec
= retrieve_specialization (gen_tmpl
, targ_ptr
);
6415 if (spec
!= NULL_TREE
)
6421 push_obstacks (&permanent_obstack
, &permanent_obstack
);
6422 old_fmp_obstack
= function_maybepermanent_obstack
;
6423 function_maybepermanent_obstack
= &permanent_obstack
;
6425 len
= DECL_NTPARMS (gen_tmpl
);
6426 inner_args
= innermost_args (targ_ptr
);
6430 tree t
= TREE_VEC_ELT (inner_args
, i
);
6431 if (TREE_CODE_CLASS (TREE_CODE (t
)) == 't')
6433 tree nt
= target_type (t
);
6434 if (IS_AGGR_TYPE (nt
) && decl_function_context (TYPE_MAIN_DECL (nt
)))
6436 cp_error ("type `%T' composed from a local class is not a valid template-argument", t
);
6437 cp_error (" trying to instantiate `%D'", gen_tmpl
);
6438 fndecl
= error_mark_node
;
6443 targ_ptr
= copy_to_permanent (targ_ptr
);
6445 /* substitute template parameters */
6446 fndecl
= tsubst (DECL_RESULT (gen_tmpl
), targ_ptr
, gen_tmpl
);
6447 /* The DECL_TI_TEMPLATE should always be the immediate parent
6448 template, not the most general template. */
6449 DECL_TI_TEMPLATE (fndecl
) = tmpl
;
6451 if (flag_external_templates
)
6452 add_pending_template (fndecl
);
6455 function_maybepermanent_obstack
= old_fmp_obstack
;
6461 /* Push the name of the class template into the scope of the instantiation. */
6464 overload_template_name (type
)
6467 tree id
= DECL_NAME (CLASSTYPE_TI_TEMPLATE (type
));
6470 if (IDENTIFIER_CLASS_VALUE (id
)
6471 && TREE_TYPE (IDENTIFIER_CLASS_VALUE (id
)) == type
)
6474 decl
= build_decl (TYPE_DECL
, id
, type
);
6475 SET_DECL_ARTIFICIAL (decl
);
6476 pushdecl_class_level (decl
);
6479 /* Like type_unification but designed specially to handle conversion
6482 The FN is a TEMPLATE_DECL for a function. The ARGS are the
6483 arguments that are being used when calling it.
6485 If FN is a conversion operator, RETURN_TYPE is the type desired as
6486 the result of the conversion operator.
6488 The EXTRA_FN_ARG, if any, is the type of an additional
6489 parameter to be added to the beginning of FN's parameter list.
6491 The other arguments are as for type_unification. */
6494 fn_type_unification (fn
, explicit_targs
, targs
, args
, return_type
,
6495 strict
, extra_fn_arg
)
6496 tree fn
, explicit_targs
, targs
, args
, return_type
;
6497 unification_kind_t strict
;
6502 my_friendly_assert (TREE_CODE (fn
) == TEMPLATE_DECL
, 0);
6504 parms
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
6506 if (IDENTIFIER_TYPENAME_P (DECL_NAME (fn
)))
6508 /* This is a template conversion operator. Use the return types
6509 as well as the argument types. */
6510 parms
= scratch_tree_cons (NULL_TREE
,
6511 TREE_TYPE (TREE_TYPE (fn
)),
6513 args
= scratch_tree_cons (NULL_TREE
, return_type
, args
);
6516 if (extra_fn_arg
!= NULL_TREE
)
6517 parms
= scratch_tree_cons (NULL_TREE
, extra_fn_arg
, parms
);
6519 /* We allow incomplete unification without an error message here
6520 because the standard doesn't seem to explicitly prohibit it. Our
6521 callers must be ready to deal with unification failures in any
6523 return type_unification (DECL_INNERMOST_TEMPLATE_PARMS (fn
),
6532 /* Type unification.
6534 We have a function template signature with one or more references to
6535 template parameters, and a parameter list we wish to fit to this
6536 template. If possible, produce a list of parameters for the template
6537 which will cause it to fit the supplied parameter list.
6539 Return zero for success, 2 for an incomplete match that doesn't resolve
6540 all the types, and 1 for complete failure. An error message will be
6541 printed only for an incomplete match.
6543 TPARMS[NTPARMS] is an array of template parameter types.
6545 TARGS[NTPARMS] is the array into which the deduced template
6546 parameter values are placed. PARMS is the function template's
6547 signature (using TEMPLATE_PARM_IDX nodes), and ARGS is the argument
6548 list we're trying to match against it.
6550 The EXPLICIT_TARGS are explicit template arguments provided via a
6553 The parameter STRICT is one of:
6556 We are deducing arguments for a function call, as in
6560 We are deducing arguments for a conversion function, as in
6564 We are deducing arguments when calculating the partial
6565 ordering between specializations of function or class
6566 templates, as in [temp.func.order] and [temp.class.order],
6567 when doing an explicit instantiation as in [temp.explicit],
6568 when determining an explicit specialization as in
6569 [temp.expl.spec], or when taking the address of a function
6570 template, as in [temp.deduct.funcaddr]. */
6573 type_unification (tparms
, targs
, parms
, args
, explicit_targs
,
6574 strict
, allow_incomplete
)
6575 tree tparms
, targs
, parms
, args
, explicit_targs
;
6576 unification_kind_t strict
;
6577 int allow_incomplete
;
6582 for (i
= 0; i
< TREE_VEC_LENGTH (tparms
); i
++)
6583 TREE_VEC_ELT (targs
, i
) = NULL_TREE
;
6585 if (explicit_targs
!= NULL_TREE
)
6588 arg_vec
= coerce_template_parms (tparms
, explicit_targs
, NULL_TREE
, 0,
6591 if (arg_vec
== error_mark_node
)
6594 explicit_mask
= alloca (sizeof (int) * TREE_VEC_LENGTH (targs
));
6595 bzero ((char *) explicit_mask
, sizeof(int) * TREE_VEC_LENGTH (targs
));
6598 i
< TREE_VEC_LENGTH (arg_vec
)
6599 && TREE_VEC_ELT (arg_vec
, i
) != NULL_TREE
;
6602 TREE_VEC_ELT (targs
, i
) = TREE_VEC_ELT (arg_vec
, i
);
6603 /* Let unify know that this argument was explicit. */
6604 explicit_mask
[i
] = 1;
6611 type_unification_real (tparms
, targs
, parms
, args
, 0,
6612 strict
, allow_incomplete
, explicit_mask
);
6615 /* Adjust types before performing type deduction, as described in
6616 [temp.deduct.call] and [temp.deduct.conv]. The rules in these two
6617 sections are symmetric. PARM is the type of a function parameter
6618 or the return type of the conversion function. ARG is the type of
6619 the argument passed to the call, or the type of the value
6620 intialized with the result of the conversion function. */
6623 maybe_adjust_types_for_deduction (strict
, parm
, arg
)
6624 unification_kind_t strict
;
6635 /* Swap PARM and ARG throughout the remainder of this
6636 function; the handling is precisely symmetric since PARM
6637 will initialize ARG rather than vice versa. */
6645 /* There is nothing to do in this case. */
6649 my_friendly_abort (0);
6652 if (TREE_CODE (*parm
) != REFERENCE_TYPE
)
6654 /* [temp.deduct.call]
6656 If P is not a reference type:
6658 --If A is an array type, the pointer type produced by the
6659 array-to-pointer standard conversion (_conv.array_) is
6660 used in place of A for type deduction; otherwise,
6662 --If A is a function type, the pointer type produced by
6663 the function-to-pointer standard conversion
6664 (_conv.func_) is used in place of A for type deduction;
6667 --If A is a cv-qualified type, the top level
6668 cv-qualifiers of A's type are ignored for type
6670 if (TREE_CODE (*arg
) == ARRAY_TYPE
)
6671 *arg
= build_pointer_type (TREE_TYPE (*arg
));
6672 else if (TREE_CODE (*arg
) == FUNCTION_TYPE
6673 || TREE_CODE (*arg
) == METHOD_TYPE
)
6674 *arg
= build_pointer_type (*arg
);
6676 *arg
= TYPE_MAIN_VARIANT (*arg
);
6679 /* [temp.deduct.call]
6681 If P is a cv-qualified type, the top level cv-qualifiers
6682 of P's type are ignored for type deduction. If P is a
6683 reference type, the type referred to by P is used for
6685 *parm
= TYPE_MAIN_VARIANT (*parm
);
6686 if (TREE_CODE (*parm
) == REFERENCE_TYPE
)
6687 *parm
= TREE_TYPE (*parm
);
6690 /* Like type_unfication. EXPLICIT_MASK, if non-NULL, is an array of
6691 integers, with ones in positions corresponding to arguments in
6692 targs that were provided explicitly, and zeros elsewhere.
6694 If SUBR is 1, we're being called recursively (to unify the
6695 arguments of a function or method parameter of a function
6699 type_unification_real (tparms
, targs
, parms
, args
, subr
,
6700 strict
, allow_incomplete
, explicit_mask
)
6701 tree tparms
, targs
, parms
, args
;
6703 unification_kind_t strict
;
6704 int allow_incomplete
;
6709 int ntparms
= TREE_VEC_LENGTH (tparms
);
6712 my_friendly_assert (TREE_CODE (tparms
) == TREE_VEC
, 289);
6713 my_friendly_assert (parms
== NULL_TREE
6714 || TREE_CODE (parms
) == TREE_LIST
, 290);
6715 /* ARGS could be NULL (via a call from parse.y to
6716 build_x_function_call). */
6718 my_friendly_assert (TREE_CODE (args
) == TREE_LIST
, 291);
6719 my_friendly_assert (ntparms
> 0, 292);
6724 sub_strict
= UNIFY_ALLOW_MORE_CV_QUAL
| UNIFY_ALLOW_DERIVED
;
6728 sub_strict
= UNIFY_ALLOW_LESS_CV_QUAL
;
6732 sub_strict
= UNIFY_ALLOW_NONE
;
6736 my_friendly_abort (0);
6740 && parms
!= void_list_node
6742 && args
!= void_list_node
)
6744 parm
= TREE_VALUE (parms
);
6745 parms
= TREE_CHAIN (parms
);
6746 arg
= TREE_VALUE (args
);
6747 args
= TREE_CHAIN (args
);
6749 if (arg
== error_mark_node
)
6751 if (arg
== unknown_type_node
)
6752 /* We can't deduce anything from this, but we might get all the
6753 template args from other function args. */
6756 /* Conversions will be performed on a function argument that
6757 corresponds with a function parameter that contains only
6758 non-deducible template parameters and explicitly specified
6759 template parameters. */
6760 if (! uses_template_parms (parm
))
6764 if (TREE_CODE_CLASS (TREE_CODE (arg
)) != 't')
6765 type
= TREE_TYPE (arg
);
6772 if (strict
== DEDUCE_EXACT
)
6774 if (comptypes (parm
, type
, 1))
6778 /* It might work; we shouldn't check now, because we might
6779 get into infinite recursion. Overload resolution will
6787 if (TREE_CODE (arg
) == VAR_DECL
)
6788 arg
= TREE_TYPE (arg
);
6789 else if (TREE_CODE_CLASS (TREE_CODE (arg
)) == 'e')
6790 arg
= TREE_TYPE (arg
);
6792 if (TREE_CODE_CLASS (TREE_CODE (arg
)) != 't')
6794 my_friendly_assert (TREE_TYPE (arg
) != NULL_TREE
, 293);
6795 if (type_unknown_p (arg
))
6797 /* [temp.deduct.type] A template-argument can be deduced from
6798 a pointer to function or pointer to member function
6799 argument if the set of overloaded functions does not
6800 contain function templates and at most one of a set of
6801 overloaded functions provides a unique match. */
6803 if (resolve_overloaded_unification
6804 (tparms
, targs
, parm
, arg
, strict
, sub_strict
, explicit_mask
)
6809 arg
= TREE_TYPE (arg
);
6813 maybe_adjust_types_for_deduction (strict
, &parm
, &arg
);
6815 switch (unify (tparms
, targs
, parm
, arg
, sub_strict
,
6824 /* Fail if we've reached the end of the parm list, and more args
6825 are present, and the parm list isn't variadic. */
6826 if (args
&& args
!= void_list_node
&& parms
== void_list_node
)
6828 /* Fail if parms are left and they don't have default values. */
6830 && parms
!= void_list_node
6831 && TREE_PURPOSE (parms
) == NULL_TREE
)
6834 for (i
= 0; i
< ntparms
; i
++)
6835 if (TREE_VEC_ELT (targs
, i
) == NULL_TREE
)
6837 if (!allow_incomplete
)
6838 error ("incomplete type unification");
6844 /* Subroutine of type_unification_real. Args are like the variables at the
6845 call site. ARG is an overloaded function (or template-id); we try
6846 deducing template args from each of the overloads, and if only one
6847 succeeds, we go with that. Modifies TARGS and returns 0 on success. */
6850 resolve_overloaded_unification (tparms
, targs
, parm
, arg
, strict
,
6851 sub_strict
, explicit_mask
)
6852 tree tparms
, targs
, parm
, arg
;
6853 unification_kind_t strict
;
6857 tree tempargs
= copy_node (targs
);
6860 if (TREE_CODE (arg
) == ADDR_EXPR
)
6861 arg
= TREE_OPERAND (arg
, 0);
6862 if (TREE_CODE (arg
) == TEMPLATE_ID_EXPR
)
6864 /* If we got some explicit template args, we need to plug them into
6865 the affected templates before we try to unify, in case the
6866 explicit args will completely resolve the templates in question. */
6868 tree expl_subargs
= TREE_OPERAND (arg
, 1);
6869 arg
= TREE_OPERAND (arg
, 0);
6871 for (; arg
; arg
= OVL_NEXT (arg
))
6873 tree fn
= OVL_CURRENT (arg
);
6876 if (TREE_CODE (fn
) != TEMPLATE_DECL
)
6879 subargs
= get_bindings_overload (fn
, DECL_RESULT (fn
), expl_subargs
);
6882 elem
= tsubst (TREE_TYPE (fn
), subargs
, NULL_TREE
);
6883 good
+= try_one_overload (tparms
, tempargs
, parm
, elem
,
6884 strict
, sub_strict
, explicit_mask
);
6888 else if (TREE_CODE (arg
) == OVERLOAD
)
6890 for (; arg
; arg
= OVL_NEXT (arg
))
6891 good
+= try_one_overload (tparms
, tempargs
, parm
,
6892 TREE_TYPE (OVL_CURRENT (arg
)),
6893 strict
, sub_strict
, explicit_mask
);
6896 my_friendly_abort (981006);
6898 /* [temp.deduct.type] A template-argument can be deduced from a pointer
6899 to function or pointer to member function argument if the set of
6900 overloaded functions does not contain function templates and at most
6901 one of a set of overloaded functions provides a unique match.
6903 So if we found multiple possibilities, we return success but don't
6908 int i
= TREE_VEC_LENGTH (targs
);
6910 if (TREE_VEC_ELT (tempargs
, i
))
6911 TREE_VEC_ELT (targs
, i
) = TREE_VEC_ELT (tempargs
, i
);
6919 /* Subroutine of resolve_overloaded_unification; does deduction for a single
6920 overload. Fills TARGS with any deduced arguments, or error_mark_node if
6921 different overloads deduce different arguments for a given parm.
6922 Returns 1 on success. */
6925 try_one_overload (tparms
, targs
, parm
, arg
, strict
,
6926 sub_strict
, explicit_mask
)
6927 tree tparms
, targs
, parm
, arg
;
6928 unification_kind_t strict
;
6936 /* [temp.deduct.type] A template-argument can be deduced from a pointer
6937 to function or pointer to member function argument if the set of
6938 overloaded functions does not contain function templates and at most
6939 one of a set of overloaded functions provides a unique match.
6941 So if this is a template, just return success. */
6943 if (uses_template_parms (arg
))
6946 maybe_adjust_types_for_deduction (strict
, &parm
, &arg
);
6948 /* We don't copy orig_targs for this because if we have already deduced
6949 some template args from previous args, unify would complain when we
6950 try to deduce a template parameter for the same argument, even though
6951 there isn't really a conflict. */
6952 nargs
= TREE_VEC_LENGTH (targs
);
6953 tempargs
= make_scratch_vec (nargs
);
6955 if (unify (tparms
, tempargs
, parm
, arg
, sub_strict
, explicit_mask
) != 0)
6958 /* First make sure we didn't deduce anything that conflicts with
6959 previously deduced/specified args. */
6960 for (i
= nargs
; i
--; )
6962 tree elt
= TREE_VEC_ELT (tempargs
, i
);
6963 tree oldelt
= TREE_VEC_ELT (targs
, i
);
6965 if (elt
== NULL_TREE
)
6967 else if (uses_template_parms (elt
))
6969 /* Since we're unifying against ourselves, we will fill in template
6970 args used in the function parm list with our own template parms.
6972 TREE_VEC_ELT (tempargs
, i
) = NULL_TREE
;
6975 else if (oldelt
&& ! template_args_equal (oldelt
, elt
))
6979 for (i
= nargs
; i
--; )
6981 tree elt
= TREE_VEC_ELT (tempargs
, i
);
6984 TREE_VEC_ELT (targs
, i
) = elt
;
6990 /* Returns the level of DECL, which declares a template parameter. */
6993 template_decl_level (decl
)
6996 switch (TREE_CODE (decl
))
7000 return TEMPLATE_TYPE_LEVEL (TREE_TYPE (decl
));
7003 return TEMPLATE_PARM_LEVEL (DECL_INITIAL (decl
));
7006 my_friendly_abort (0);
7011 /* Decide whether ARG can be unified with PARM, considering only the
7012 cv-qualifiers of each type, given STRICT as documented for unify.
7013 Returns non-zero iff the unification is OK on that basis.*/
7016 check_cv_quals_for_unify (strict
, arg
, parm
)
7021 return !((!(strict
& UNIFY_ALLOW_MORE_CV_QUAL
)
7022 && (TYPE_READONLY (arg
) < TYPE_READONLY (parm
)
7023 || TYPE_VOLATILE (arg
) < TYPE_VOLATILE (parm
)))
7024 || (!(strict
& UNIFY_ALLOW_LESS_CV_QUAL
)
7025 && (TYPE_READONLY (arg
) > TYPE_READONLY (parm
)
7026 || TYPE_VOLATILE (arg
) > TYPE_VOLATILE (parm
))));
7029 /* Takes parameters as for type_unification. Returns 0 if the
7030 type deduction suceeds, 1 otherwise. The parameter STRICT is a
7031 bitwise or of the following flags:
7034 Require an exact match between PARM and ARG.
7035 UNIFY_ALLOW_MORE_CV_QUAL:
7036 Allow the deduced ARG to be more cv-qualified than ARG.
7037 UNIFY_ALLOW_LESS_CV_QUAL:
7038 Allow the deduced ARG to be less cv-qualified than ARG.
7039 UNIFY_ALLOW_DERIVED:
7040 Allow the deduced ARG to be a template base class of ARG,
7041 or a pointer to a template base class of the type pointed to by
7045 unify (tparms
, targs
, parm
, arg
, strict
, explicit_mask
)
7046 tree tparms
, targs
, parm
, arg
;
7054 /* I don't think this will do the right thing with respect to types.
7055 But the only case I've seen it in so far has been array bounds, where
7056 signedness is the only information lost, and I think that will be
7058 while (TREE_CODE (parm
) == NOP_EXPR
)
7059 parm
= TREE_OPERAND (parm
, 0);
7061 if (arg
== error_mark_node
)
7063 if (arg
== unknown_type_node
)
7064 /* We can't deduce anything from this, but we might get all the
7065 template args from other function args. */
7068 /* If PARM uses template parameters, then we can't bail out here,
7069 even in ARG == PARM, since we won't record unifications for the
7070 template parameters. We might need them if we're trying to
7071 figure out which of two things is more specialized. */
7072 if (arg
== parm
&& !uses_template_parms (parm
))
7075 /* Immediately reject some pairs that won't unify because of
7076 cv-qualification mismatches. */
7077 if (TREE_CODE (arg
) == TREE_CODE (parm
)
7078 && TREE_CODE_CLASS (TREE_CODE (arg
)) == 't'
7079 /* We check the cv-qualifiers when unifying with template type
7080 parameters below. We want to allow ARG `const T' to unify with
7081 PARM `T' for example, when computing which of two templates
7082 is more specialized, for example. */
7083 && TREE_CODE (arg
) != TEMPLATE_TYPE_PARM
7084 && !check_cv_quals_for_unify (strict
, arg
, parm
))
7087 switch (TREE_CODE (parm
))
7090 /* In a type which contains a nested-name-specifier, template
7091 argument values cannot be deduced for template parameters used
7092 within the nested-name-specifier. */
7095 case TEMPLATE_TYPE_PARM
:
7096 case TEMPLATE_TEMPLATE_PARM
:
7097 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, 0));
7099 if (TEMPLATE_TYPE_LEVEL (parm
)
7100 != template_decl_level (tparm
))
7101 /* The PARM is not one we're trying to unify. Just check
7102 to see if it matches ARG. */
7103 return (TREE_CODE (arg
) == TREE_CODE (parm
)
7104 && comptypes (parm
, arg
, 1)) ? 0 : 1;
7105 idx
= TEMPLATE_TYPE_IDX (parm
);
7106 targ
= TREE_VEC_ELT (targs
, idx
);
7107 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, idx
));
7109 /* Check for mixed types and values. */
7110 if ((TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
7111 && TREE_CODE (tparm
) != TYPE_DECL
)
7112 || (TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
7113 && TREE_CODE (tparm
) != TEMPLATE_DECL
))
7116 if (!strict
&& targ
!= NULL_TREE
7117 && explicit_mask
&& explicit_mask
[idx
])
7118 /* An explicit template argument. Don't even try to match
7119 here; the overload resolution code will manage check to
7120 see whether the call is legal. */
7123 if (TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
)
7125 if (CLASSTYPE_TEMPLATE_INFO (parm
))
7127 /* We arrive here when PARM does not involve template
7130 /* ARG must be constructed from a template class. */
7131 if (TREE_CODE (arg
) != RECORD_TYPE
|| !CLASSTYPE_TEMPLATE_INFO (arg
))
7135 tree parmtmpl
= CLASSTYPE_TI_TEMPLATE (parm
);
7136 tree parmvec
= CLASSTYPE_TI_ARGS (parm
);
7137 tree argvec
= CLASSTYPE_TI_ARGS (arg
);
7139 = DECL_INNERMOST_TEMPLATE_PARMS (CLASSTYPE_TI_TEMPLATE (arg
));
7142 /* The parameter and argument roles have to be switched here
7143 in order to handle default arguments properly. For example,
7144 template<template <class> class TT> void f(TT<int>)
7145 should be able to accept vector<int> which comes from
7146 template <class T, class Allocator = allocator>
7149 if (coerce_template_parms (argtmplvec
, parmvec
, parmtmpl
, 1, 1)
7153 /* Deduce arguments T, i from TT<T> or TT<i>. */
7154 for (i
= 0; i
< TREE_VEC_LENGTH (parmvec
); ++i
)
7156 tree t
= TREE_VEC_ELT (parmvec
, i
);
7157 if (TREE_CODE (t
) != TEMPLATE_TYPE_PARM
7158 && TREE_CODE (t
) != TEMPLATE_TEMPLATE_PARM
7159 && TREE_CODE (t
) != TEMPLATE_PARM_INDEX
)
7162 /* This argument can be deduced. */
7164 if (unify (tparms
, targs
, t
,
7165 TREE_VEC_ELT (argvec
, i
),
7166 UNIFY_ALLOW_NONE
, explicit_mask
))
7170 arg
= CLASSTYPE_TI_TEMPLATE (arg
);
7175 /* If PARM is `const T' and ARG is only `int', we don't have
7176 a match unless we are allowing additional qualification.
7177 If ARG is `const int' and PARM is just `T' that's OK;
7178 that binds `const int' to `T'. */
7179 if (!check_cv_quals_for_unify (strict
| UNIFY_ALLOW_LESS_CV_QUAL
,
7183 /* Consider the case where ARG is `const volatile int' and
7184 PARM is `const T'. Then, T should be `volatile int'. */
7186 cp_build_type_variant (arg
,
7187 TYPE_READONLY (arg
) > TYPE_READONLY (parm
),
7188 TYPE_VOLATILE (arg
) > TYPE_VOLATILE (parm
));
7191 /* Simple cases: Value already set, does match or doesn't. */
7192 if (targ
!= NULL_TREE
7193 && (comptypes (targ
, arg
, 1)
7194 || (explicit_mask
&& explicit_mask
[idx
])))
7198 TREE_VEC_ELT (targs
, idx
) = arg
;
7201 case TEMPLATE_PARM_INDEX
:
7202 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, 0));
7204 if (TEMPLATE_PARM_LEVEL (parm
)
7205 != template_decl_level (tparm
))
7206 /* The PARM is not one we're trying to unify. Just check
7207 to see if it matches ARG. */
7208 return (TREE_CODE (arg
) == TREE_CODE (parm
)
7209 && cp_tree_equal (parm
, arg
) > 0) ? 0 : 1;
7211 idx
= TEMPLATE_PARM_IDX (parm
);
7212 targ
= TREE_VEC_ELT (targs
, idx
);
7216 int i
= (cp_tree_equal (targ
, arg
) > 0);
7222 my_friendly_abort (42);
7225 TREE_VEC_ELT (targs
, idx
) = copy_to_permanent (arg
);
7232 if (TREE_CODE (arg
) == RECORD_TYPE
&& TYPE_PTRMEMFUNC_FLAG (arg
))
7233 return (unify (tparms
, targs
, parm
,
7234 TYPE_PTRMEMFUNC_FN_TYPE (arg
), strict
,
7237 if (TREE_CODE (arg
) != POINTER_TYPE
)
7240 /* [temp.deduct.call]
7242 A can be another pointer or pointer to member type that can
7243 be converted to the deduced A via a qualification
7244 conversion (_conv.qual_).
7246 We pass down STRICT here rather than UNIFY_ALLOW_NONE.
7247 This will allow for additional cv-qualification of the
7248 pointed-to types if appropriate. In general, this is a bit
7249 too generous; we are only supposed to allow qualification
7250 conversions and this method will allow an ARG of char** and
7251 a deduced ARG of const char**. However, overload
7252 resolution will subsequently invalidate the candidate, so
7253 this is probably OK. */
7254 sub_strict
= strict
;
7256 if (TREE_CODE (TREE_TYPE (arg
)) != RECORD_TYPE
7257 || TYPE_PTRMEMFUNC_FLAG (TREE_TYPE (arg
)))
7258 /* The derived-to-base conversion only persists through one
7259 level of pointers. */
7260 sub_strict
&= ~UNIFY_ALLOW_DERIVED
;
7262 return unify (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE
7263 (arg
), sub_strict
, explicit_mask
);
7266 case REFERENCE_TYPE
:
7267 if (TREE_CODE (arg
) != REFERENCE_TYPE
)
7269 return unify (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
7270 UNIFY_ALLOW_NONE
, explicit_mask
);
7273 if (TREE_CODE (arg
) != ARRAY_TYPE
)
7275 if ((TYPE_DOMAIN (parm
) == NULL_TREE
)
7276 != (TYPE_DOMAIN (arg
) == NULL_TREE
))
7278 if (TYPE_DOMAIN (parm
) != NULL_TREE
7279 && unify (tparms
, targs
, TYPE_DOMAIN (parm
),
7280 TYPE_DOMAIN (arg
), UNIFY_ALLOW_NONE
, explicit_mask
) != 0)
7282 return unify (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
7283 UNIFY_ALLOW_NONE
, explicit_mask
);
7290 if (TREE_CODE (arg
) != TREE_CODE (parm
))
7293 if (TREE_CODE (parm
) == INTEGER_TYPE
7294 && TREE_CODE (TYPE_MAX_VALUE (parm
)) != INTEGER_CST
)
7296 if (TYPE_MIN_VALUE (parm
) && TYPE_MIN_VALUE (arg
)
7297 && unify (tparms
, targs
, TYPE_MIN_VALUE (parm
),
7298 TYPE_MIN_VALUE (arg
), UNIFY_ALLOW_NONE
, explicit_mask
))
7300 if (TYPE_MAX_VALUE (parm
) && TYPE_MAX_VALUE (arg
)
7301 && unify (tparms
, targs
, TYPE_MAX_VALUE (parm
),
7302 TYPE_MAX_VALUE (arg
), UNIFY_ALLOW_NONE
, explicit_mask
))
7305 /* We use the TYPE_MAIN_VARIANT since we have already
7306 checked cv-qualification at the top of the
7308 else if (!comptypes (TYPE_MAIN_VARIANT (arg
),
7309 TYPE_MAIN_VARIANT (parm
), 1))
7312 /* As far as unification is concerned, this wins. Later checks
7313 will invalidate it if necessary. */
7316 /* Types INTEGER_CST and MINUS_EXPR can come from array bounds. */
7317 /* Type INTEGER_CST can come from ordinary constant template args. */
7319 while (TREE_CODE (arg
) == NOP_EXPR
)
7320 arg
= TREE_OPERAND (arg
, 0);
7322 if (TREE_CODE (arg
) != INTEGER_CST
)
7324 return !tree_int_cst_equal (parm
, arg
);
7329 if (TREE_CODE (arg
) != TREE_VEC
)
7331 if (TREE_VEC_LENGTH (parm
) != TREE_VEC_LENGTH (arg
))
7333 for (i
= TREE_VEC_LENGTH (parm
) - 1; i
>= 0; i
--)
7334 if (unify (tparms
, targs
,
7335 TREE_VEC_ELT (parm
, i
), TREE_VEC_ELT (arg
, i
),
7336 UNIFY_ALLOW_NONE
, explicit_mask
))
7342 if (TYPE_PTRMEMFUNC_FLAG (parm
))
7343 return unify (tparms
, targs
, TYPE_PTRMEMFUNC_FN_TYPE (parm
),
7344 arg
, strict
, explicit_mask
);
7346 if (TREE_CODE (arg
) != RECORD_TYPE
)
7349 if (CLASSTYPE_TEMPLATE_INFO (parm
) && uses_template_parms (parm
))
7352 if (strict
& UNIFY_ALLOW_DERIVED
)
7353 /* [temp.deduct.call]
7355 If P is a class, and P has the form template-id, then A
7356 can be a derived class of the deduced A. Likewise, if
7357 P is a pointer to a class of the form template-id, A
7358 can be a pointer to a derived class pointed to by the
7361 The call to get_template_base also handles the case
7362 where PARM and ARG are the same type, i.e., where no
7363 derivation is involved. */
7364 t
= get_template_base (CLASSTYPE_TI_TEMPLATE (parm
), arg
);
7365 else if (CLASSTYPE_TEMPLATE_INFO (arg
)
7366 && specializations_of_same_template_p (parm
, arg
))
7367 /* Perhaps PARM is something like S<U> and ARG is S<int>.
7368 Then, we should unify `int' and `U'. */
7371 if (! t
|| t
== error_mark_node
)
7374 return unify (tparms
, targs
, CLASSTYPE_TI_ARGS (parm
),
7375 CLASSTYPE_TI_ARGS (t
), UNIFY_ALLOW_NONE
,
7378 else if (!comptypes (TYPE_MAIN_VARIANT (parm
),
7379 TYPE_MAIN_VARIANT (arg
), 1))
7385 if (TREE_CODE (arg
) != TREE_CODE (parm
))
7388 if (unify (tparms
, targs
, TREE_TYPE (parm
),
7389 TREE_TYPE (arg
), UNIFY_ALLOW_NONE
, explicit_mask
))
7391 return type_unification_real (tparms
, targs
, TYPE_ARG_TYPES (parm
),
7392 TYPE_ARG_TYPES (arg
), 1,
7393 DEDUCE_EXACT
, 0, explicit_mask
);
7396 if (TREE_CODE (arg
) != OFFSET_TYPE
)
7398 if (unify (tparms
, targs
, TYPE_OFFSET_BASETYPE (parm
),
7399 TYPE_OFFSET_BASETYPE (arg
), UNIFY_ALLOW_NONE
, explicit_mask
))
7401 return unify (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
7402 UNIFY_ALLOW_NONE
, explicit_mask
);
7405 if (arg
!= decl_constant_value (parm
))
7410 /* Matched cases are handled by the ARG == PARM test above. */
7414 if (TREE_CODE (TREE_OPERAND (parm
, 1)) == INTEGER_CST
)
7416 /* We handle this case specially, since it comes up with
7417 arrays. In particular, something like:
7419 template <int N> void f(int (&x)[N]);
7421 Here, we are trying to unify the range type, which
7422 looks like [0 ... (N - 1)]. */
7424 t1
= TREE_OPERAND (parm
, 0);
7425 t2
= TREE_OPERAND (parm
, 1);
7427 /* Should this be a regular fold? */
7428 t
= maybe_fold_nontype_arg (build (PLUS_EXPR
,
7432 return unify (tparms
, targs
, t1
, t
, UNIFY_ALLOW_NONE
,
7435 /* else fall through */
7438 if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (TREE_CODE (parm
))))
7440 /* We're looking at an expression. This can happen with
7444 void foo(S<I>, S<I + 2>);
7446 If the call looked like:
7448 foo(S<2>(), S<4>());
7450 we would have already matched `I' with `2'. Now, we'd
7451 like to know if `4' matches `I + 2'. So, we substitute
7452 into that expression, and fold constants, in the hope of
7455 maybe_fold_nontype_arg (tsubst_expr (parm
, targs
, NULL_TREE
));
7456 tree a
= maybe_fold_nontype_arg (arg
);
7458 if (!IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (TREE_CODE (t
))))
7459 /* Good, we mangaged to simplify the exression. */
7460 return unify (tparms
, targs
, t
, a
, UNIFY_ALLOW_NONE
,
7463 /* Bad, we couldn't simplify this. Assume it doesn't
7468 sorry ("use of `%s' in template type unification",
7469 tree_code_name
[(int) TREE_CODE (parm
)]);
7475 /* Called if RESULT is explicitly instantiated, or is a member of an
7476 explicitly instantiated class, or if using -frepo and the
7477 instantiation of RESULT has been assigned to this file. */
7480 mark_decl_instantiated (result
, extern_p
)
7484 if (TREE_CODE (result
) != FUNCTION_DECL
)
7485 /* The TREE_PUBLIC flag for function declarations will have been
7486 set correctly by tsubst. */
7487 TREE_PUBLIC (result
) = 1;
7491 DECL_INTERFACE_KNOWN (result
) = 1;
7492 DECL_NOT_REALLY_EXTERN (result
) = 1;
7494 /* Always make artificials weak. */
7495 if (DECL_ARTIFICIAL (result
) && flag_weak
)
7496 comdat_linkage (result
);
7497 /* For WIN32 we also want to put explicit instantiations in
7498 linkonce sections. */
7499 else if (TREE_PUBLIC (result
))
7500 maybe_make_one_only (result
);
7502 else if (TREE_CODE (result
) == FUNCTION_DECL
)
7503 mark_inline_for_output (result
);
7506 /* Given two function templates PAT1 and PAT2, and explicit template
7507 arguments EXPLICIT_ARGS return:
7509 1 if PAT1 is more specialized than PAT2 as described in [temp.func.order].
7510 -1 if PAT2 is more specialized than PAT1.
7511 0 if neither is more specialized. */
7514 more_specialized (pat1
, pat2
, explicit_args
)
7515 tree pat1
, pat2
, explicit_args
;
7520 targs
= get_bindings_overload (pat1
, pat2
, explicit_args
);
7524 targs
= get_bindings_overload (pat2
, pat1
, explicit_args
);
7531 /* Given two class template specialization list nodes PAT1 and PAT2, return:
7533 1 if PAT1 is more specialized than PAT2 as described in [temp.class.order].
7534 -1 if PAT2 is more specialized than PAT1.
7535 0 if neither is more specialized. */
7538 more_specialized_class (pat1
, pat2
)
7544 targs
= get_class_bindings (TREE_VALUE (pat1
), TREE_PURPOSE (pat1
),
7545 TREE_PURPOSE (pat2
));
7549 targs
= get_class_bindings (TREE_VALUE (pat2
), TREE_PURPOSE (pat2
),
7550 TREE_PURPOSE (pat1
));
7557 /* Return the template arguments that will produce the function signature
7558 DECL from the function template FN, with the explicit template
7559 arguments EXPLICIT_ARGS. If CHECK_RETTYPE is 1, the return type must
7563 get_bindings_real (fn
, decl
, explicit_args
, check_rettype
)
7564 tree fn
, decl
, explicit_args
;
7567 int ntparms
= DECL_NTPARMS (fn
);
7568 tree targs
= make_scratch_vec (ntparms
);
7569 tree decl_arg_types
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
7570 tree extra_fn_arg
= NULL_TREE
;
7573 if (DECL_STATIC_FUNCTION_P (fn
)
7574 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
7576 /* Sometimes we are trying to figure out what's being
7577 specialized by a declaration that looks like a method, and it
7578 turns out to be a static member function. */
7579 if (CLASSTYPE_TEMPLATE_INFO (DECL_REAL_CONTEXT (fn
))
7580 && !is_member_template (fn
))
7581 /* The natural thing to do here seems to be to remove the
7582 spurious `this' parameter from the DECL, but that prevents
7583 unification from making use of the class type. So,
7584 instead, we have fn_type_unification add to the parameters
7586 extra_fn_arg
= build_pointer_type (DECL_REAL_CONTEXT (fn
));
7588 /* In this case, though, adding the extra_fn_arg can confuse
7589 things, so we remove from decl_arg_types instead. */
7590 decl_arg_types
= TREE_CHAIN (decl_arg_types
);
7593 i
= fn_type_unification (fn
, explicit_args
, targs
,
7595 TREE_TYPE (TREE_TYPE (decl
)),
7604 /* Check to see that the resulting return type is also OK. */
7605 tree t
= tsubst (TREE_TYPE (TREE_TYPE (fn
)), targs
,
7608 if (!comptypes (t
, TREE_TYPE (TREE_TYPE (decl
)), 1))
7615 /* For most uses, we want to check the return type. */
7618 get_bindings (fn
, decl
, explicit_args
)
7619 tree fn
, decl
, explicit_args
;
7621 return get_bindings_real (fn
, decl
, explicit_args
, 1);
7624 /* But for more_specialized, we only care about the parameter types. */
7627 get_bindings_overload (fn
, decl
, explicit_args
)
7628 tree fn
, decl
, explicit_args
;
7630 return get_bindings_real (fn
, decl
, explicit_args
, 0);
7633 /* Return the innermost template arguments that, when applied to a
7634 template specialization whose innermost template parameters are
7635 TPARMS, and whose specialization arguments are ARGS, yield the
7638 For example, suppose we have:
7640 template <class T, class U> struct S {};
7641 template <class T> struct S<T*, int> {};
7643 Then, suppose we want to get `S<double*, int>'. The TPARMS will be
7644 {T}, the PARMS will be {T*, int} and the ARGS will be {double*,
7645 int}. The resulting vector will be {double}, indicating that `T'
7646 is bound to `double'. */
7649 get_class_bindings (tparms
, parms
, args
)
7650 tree tparms
, parms
, args
;
7652 int i
, ntparms
= TREE_VEC_LENGTH (tparms
);
7653 tree vec
= make_temp_vec (ntparms
);
7655 args
= innermost_args (args
);
7657 for (i
= 0; i
< TREE_VEC_LENGTH (parms
); ++i
)
7659 switch (unify (tparms
, vec
,
7660 TREE_VEC_ELT (parms
, i
), TREE_VEC_ELT (args
, i
),
7661 UNIFY_ALLOW_NONE
, 0))
7670 for (i
= 0; i
< ntparms
; ++i
)
7671 if (! TREE_VEC_ELT (vec
, i
))
7677 /* Return the most specialized of the list of templates in FNS that can
7678 produce an instantiation matching DECL, given the explicit template
7679 arguments EXPLICIT_ARGS. */
7682 most_specialized (fns
, decl
, explicit_args
)
7683 tree fns
, decl
, explicit_args
;
7685 tree candidates
= NULL_TREE
;
7686 tree fn
, champ
, args
;
7689 for (fn
= fns
; fn
; fn
= TREE_CHAIN (fn
))
7691 tree candidate
= TREE_VALUE (fn
);
7693 args
= get_bindings (candidate
, decl
, explicit_args
);
7695 candidates
= scratch_tree_cons (NULL_TREE
, candidate
,
7702 champ
= TREE_VALUE (candidates
);
7703 for (fn
= TREE_CHAIN (candidates
); fn
; fn
= TREE_CHAIN (fn
))
7705 fate
= more_specialized (champ
, TREE_VALUE (fn
), explicit_args
);
7712 fn
= TREE_CHAIN (fn
);
7714 return error_mark_node
;
7716 champ
= TREE_VALUE (fn
);
7720 for (fn
= candidates
; fn
&& TREE_VALUE (fn
) != champ
; fn
= TREE_CHAIN (fn
))
7722 fate
= more_specialized (champ
, TREE_VALUE (fn
), explicit_args
);
7724 return error_mark_node
;
7730 /* If DECL is a specialization of some template, return the most
7731 general such template. For example, given:
7733 template <class T> struct S { template <class U> void f(U); };
7735 if TMPL is `template <class U> void S<int>::f(U)' this will return
7736 the full template. This function will not trace past partial
7737 specializations, however. For example, given in addition:
7739 template <class T> struct S<T*> { template <class U> void f(U); };
7741 if TMPL is `template <class U> void S<int*>::f(U)' this will return
7742 `template <class T> template <class U> S<T*>::f(U)'. */
7745 most_general_template (decl
)
7748 while (DECL_TEMPLATE_INFO (decl
))
7749 decl
= DECL_TI_TEMPLATE (decl
);
7754 /* Return the most specialized of the class template specializations
7755 of TMPL which can produce an instantiation matching ARGS, or
7756 error_mark_node if the choice is ambiguous. */
7759 most_specialized_class (tmpl
, args
)
7763 tree list
= NULL_TREE
;
7768 tmpl
= most_general_template (tmpl
);
7769 for (t
= DECL_TEMPLATE_SPECIALIZATIONS (tmpl
); t
; t
= TREE_CHAIN (t
))
7772 = get_class_bindings (TREE_VALUE (t
), TREE_PURPOSE (t
), args
);
7775 list
= decl_tree_cons (TREE_PURPOSE (t
), TREE_VALUE (t
), list
);
7776 TREE_TYPE (list
) = TREE_TYPE (t
);
7786 for (; t
; t
= TREE_CHAIN (t
))
7788 fate
= more_specialized_class (champ
, t
);
7797 return error_mark_node
;
7803 for (t
= list
; t
&& t
!= champ
; t
= TREE_CHAIN (t
))
7805 fate
= more_specialized_class (champ
, t
);
7807 return error_mark_node
;
7813 /* called from the parser. */
7816 do_decl_instantiation (declspecs
, declarator
, storage
)
7817 tree declspecs
, declarator
, storage
;
7819 tree decl
= grokdeclarator (declarator
, declspecs
, NORMAL
, 0, NULL_TREE
);
7820 tree result
= NULL_TREE
;
7823 if (! DECL_LANG_SPECIFIC (decl
))
7825 cp_error ("explicit instantiation of non-template `%#D'", decl
);
7828 else if (TREE_CODE (decl
) == VAR_DECL
)
7830 /* There is an asymmetry here in the way VAR_DECLs and
7831 FUNCTION_DECLs are handled by grokdeclarator. In the case of
7832 the latter, the DECL we get back will be marked as a
7833 template instantiation, and the appropriate
7834 DECL_TEMPLATE_INFO will be set up. This does not happen for
7835 VAR_DECLs so we do the lookup here. Probably, grokdeclarator
7836 should handle VAR_DECLs as it currently handles
7838 result
= lookup_field (DECL_CONTEXT (decl
), DECL_NAME (decl
), 0, 0);
7839 if (result
&& TREE_CODE (result
) != VAR_DECL
)
7841 cp_error ("no matching template for `%D' found", result
);
7845 else if (TREE_CODE (decl
) != FUNCTION_DECL
)
7847 cp_error ("explicit instantiation of `%#D'", decl
);
7853 /* Check for various error cases. Note that if the explicit
7854 instantiation is legal the RESULT will currently be marked as an
7855 *implicit* instantiation; DECL_EXPLICIT_INSTANTIATION is not set
7856 until we get here. */
7858 if (DECL_TEMPLATE_SPECIALIZATION (result
))
7862 No program shall both explicitly instantiate and explicitly
7863 specialize a template. */
7864 cp_error ("explicit instantiation of `%#D' after", result
);
7865 cp_error_at ("explicit specialization here", result
);
7868 else if (DECL_EXPLICIT_INSTANTIATION (result
))
7872 No program shall explicitly instantiate any template more
7875 We check DECL_INTERFACE_KNOWN so as not to complain when the
7876 first instantiation was `extern' and the second is not, and
7877 EXTERN_P for the opposite case. */
7878 if (DECL_INTERFACE_KNOWN (result
) && !extern_p
)
7879 cp_error ("duplicate explicit instantiation of `%#D'", result
);
7881 /* If we've already instantiated the template, just return now. */
7882 if (DECL_INTERFACE_KNOWN (result
))
7885 else if (!DECL_IMPLICIT_INSTANTIATION (result
))
7887 cp_error ("no matching template for `%D' found", result
);
7890 else if (!DECL_TEMPLATE_INFO (result
))
7892 cp_pedwarn ("explicit instantiation of non-template `%#D'", result
);
7896 if (flag_external_templates
)
7899 if (storage
== NULL_TREE
)
7901 else if (storage
== ridpointers
[(int) RID_EXTERN
])
7904 cp_pedwarn ("ANSI C++ forbids the use of `extern' on explicit instantiations");
7908 cp_error ("storage class `%D' applied to template instantiation",
7911 SET_DECL_EXPLICIT_INSTANTIATION (result
);
7912 mark_decl_instantiated (result
, extern_p
);
7913 repo_template_instantiated (result
, extern_p
);
7915 instantiate_decl (result
);
7919 mark_class_instantiated (t
, extern_p
)
7923 SET_CLASSTYPE_EXPLICIT_INSTANTIATION (t
);
7924 SET_CLASSTYPE_INTERFACE_KNOWN (t
);
7925 CLASSTYPE_INTERFACE_ONLY (t
) = extern_p
;
7926 CLASSTYPE_VTABLE_NEEDS_WRITING (t
) = ! extern_p
;
7927 TYPE_DECL_SUPPRESS_DEBUG (TYPE_NAME (t
)) = extern_p
;
7930 CLASSTYPE_DEBUG_REQUESTED (t
) = 1;
7931 rest_of_type_compilation (t
, 1);
7936 do_type_instantiation (t
, storage
)
7943 if (TREE_CODE (t
) == TYPE_DECL
)
7946 if (! IS_AGGR_TYPE (t
) || ! CLASSTYPE_TEMPLATE_INFO (t
))
7948 cp_error ("explicit instantiation of non-template type `%T'", t
);
7954 /* With -fexternal-templates, explicit instantiations are treated the same
7955 as implicit ones. */
7956 if (flag_external_templates
)
7959 if (TYPE_SIZE (t
) == NULL_TREE
)
7961 cp_error ("explicit instantiation of `%#T' before definition of template",
7966 if (storage
!= NULL_TREE
)
7969 cp_pedwarn("ANSI C++ forbids the use of `%s' on explicit instantiations",
7970 IDENTIFIER_POINTER (storage
));
7972 if (storage
== ridpointers
[(int) RID_INLINE
])
7974 else if (storage
== ridpointers
[(int) RID_EXTERN
])
7976 else if (storage
== ridpointers
[(int) RID_STATIC
])
7980 cp_error ("storage class `%D' applied to template instantiation",
7986 if (CLASSTYPE_TEMPLATE_SPECIALIZATION (t
))
7990 No program shall both explicitly instantiate and explicitly
7991 specialize a template. */
7992 cp_error ("explicit instantiation of `%#T' after", t
);
7993 cp_error_at ("explicit specialization here", t
);
7996 else if (CLASSTYPE_EXPLICIT_INSTANTIATION (t
))
8000 No program shall explicitly instantiate any template more
8003 If CLASSTYPE_INTERFACE_ONLY, then the first explicit
8004 instantiation was `extern', and if EXTERN_P then the second
8005 is. Both cases are OK. */
8006 if (!CLASSTYPE_INTERFACE_ONLY (t
) && !extern_p
)
8007 cp_error ("duplicate explicit instantiation of `%#T'", t
);
8009 /* If we've already instantiated the template, just return now. */
8010 if (!CLASSTYPE_INTERFACE_ONLY (t
))
8014 mark_class_instantiated (t
, extern_p
);
8015 repo_template_instantiated (t
, extern_p
);
8023 /* In contrast to implicit instantiation, where only the
8024 declarations, and not the definitions, of members are
8025 instantiated, we have here:
8029 The explicit instantiation of a class template specialization
8030 implies the instantiation of all of its members not
8031 previously explicitly specialized in the translation unit
8032 containing the explicit instantiation.
8034 Of course, we can't instantiate member template classes, since
8035 we don't have any arguments for them. Note that the standard
8036 is unclear on whether the instatiation of the members are
8037 *explicit* instantiations or not. We choose to be generous,
8038 and not set DECL_EXPLICIT_INSTANTIATION. Therefore, we allow
8039 the explicit instantiation of a class where some of the members
8040 have no definition in the current translation unit. */
8043 for (tmp
= TYPE_METHODS (t
); tmp
; tmp
= TREE_CHAIN (tmp
))
8044 if (TREE_CODE (tmp
) == FUNCTION_DECL
8045 && DECL_TEMPLATE_INSTANTIATION (tmp
))
8047 mark_decl_instantiated (tmp
, extern_p
);
8048 repo_template_instantiated (tmp
, extern_p
);
8050 instantiate_decl (tmp
);
8053 for (tmp
= TYPE_FIELDS (t
); tmp
; tmp
= TREE_CHAIN (tmp
))
8054 if (TREE_CODE (tmp
) == VAR_DECL
&& DECL_TEMPLATE_INSTANTIATION (tmp
))
8056 mark_decl_instantiated (tmp
, extern_p
);
8057 repo_template_instantiated (tmp
, extern_p
);
8059 instantiate_decl (tmp
);
8062 for (tmp
= CLASSTYPE_TAGS (t
); tmp
; tmp
= TREE_CHAIN (tmp
))
8063 if (IS_AGGR_TYPE (TREE_VALUE (tmp
))
8064 && !uses_template_parms (CLASSTYPE_TI_ARGS (TREE_VALUE (tmp
))))
8065 do_type_instantiation (TYPE_MAIN_DECL (TREE_VALUE (tmp
)), storage
);
8069 /* Given a function DECL, which is a specialization of TMPL, modify
8070 DECL to be a re-instantiation of TMPL with the same template
8071 arguments. TMPL should be the template into which tsubst'ing
8072 should occur for DECL, not the most general template.
8074 One reason for doing this is a scenario like this:
8077 void f(const T&, int i);
8079 void g() { f(3, 7); }
8082 void f(const T& t, const int i) { }
8084 Note that when the template is first instantiated, with
8085 instantiate_template, the resulting DECL will have no name for the
8086 first parameter, and the wrong type for the second. So, when we go
8087 to instantiate the DECL, we regenerate it. */
8090 regenerate_decl_from_template (decl
, tmpl
)
8100 args
= DECL_TI_ARGS (decl
);
8101 code_pattern
= DECL_TEMPLATE_RESULT (tmpl
);
8103 /* Unregister the specialization so that when we tsubst we will not
8104 just return DECL. We don't have to unregister DECL from TMPL
8105 because if would only be registered there if it were a partial
8106 instantiation of a specialization, which it isn't: it's a full
8108 gen_tmpl
= most_general_template (tmpl
);
8109 unregistered
= unregister_specialization (decl
, gen_tmpl
);
8111 /* If the DECL was not unregistered then something peculiar is
8112 happening: we created a specialization but did not call
8113 register_specialization for it. */
8114 my_friendly_assert (unregistered
, 0);
8116 if (TREE_CODE (decl
) == VAR_DECL
)
8117 /* Make sure that we can see identifiers, and compute access
8118 correctly, for the class members used in the declaration of
8119 this static variable. */
8120 pushclass (DECL_CONTEXT (decl
), 2);
8122 /* Do the substitution to get the new declaration. */
8123 new_decl
= tsubst (code_pattern
, args
, NULL_TREE
);
8125 if (TREE_CODE (decl
) == VAR_DECL
)
8127 /* Set up DECL_INITIAL, since tsubst doesn't. */
8128 DECL_INITIAL (new_decl
) =
8129 tsubst_expr (DECL_INITIAL (code_pattern
), args
,
8130 DECL_TI_TEMPLATE (decl
));
8131 /* Pop the class context we pushed above. */
8135 if (TREE_CODE (decl
) == FUNCTION_DECL
)
8136 /* Convince duplicate_decls to use the DECL_ARGUMENTS from the
8138 DECL_INITIAL (new_decl
) = error_mark_node
;
8140 /* The immediate parent of the new template is still whatever it was
8141 before, even though tsubst sets DECL_TI_TEMPLATE up as the most
8142 general template. We also reset the DECL_ASSEMBLER_NAME since
8143 tsubst always calculates the name as if the function in question
8144 were really a template instance, and sometimes, with friend
8145 functions, this is not so. See tsubst_friend_function for
8147 DECL_TI_TEMPLATE (new_decl
) = DECL_TI_TEMPLATE (decl
);
8148 DECL_ASSEMBLER_NAME (new_decl
) = DECL_ASSEMBLER_NAME (decl
);
8149 DECL_RTL (new_decl
) = DECL_RTL (decl
);
8151 /* Call duplicate decls to merge the old and new declarations. */
8152 duplicate_decls (new_decl
, decl
);
8154 if (TREE_CODE (decl
) == FUNCTION_DECL
)
8155 DECL_INITIAL (new_decl
) = NULL_TREE
;
8157 /* Now, re-register the specialization. */
8158 register_specialization (decl
, gen_tmpl
, args
);
8161 /* Produce the definition of D, a _DECL generated from a template. */
8164 instantiate_decl (d
)
8167 tree tmpl
= DECL_TI_TEMPLATE (d
);
8168 tree args
= DECL_TI_ARGS (d
);
8173 int nested
= in_function_p ();
8174 int pattern_defined
;
8176 char *file
= input_filename
;
8178 /* This function should only be used to instantiate templates for
8179 functions and static member variables. */
8180 my_friendly_assert (TREE_CODE (d
) == FUNCTION_DECL
8181 || TREE_CODE (d
) == VAR_DECL
, 0);
8183 if ((TREE_CODE (d
) == FUNCTION_DECL
&& DECL_INITIAL (d
))
8184 || (TREE_CODE (d
) == VAR_DECL
&& !DECL_IN_AGGR_P (d
)))
8185 /* D has already been instantiated. It might seem reasonable to
8186 check whether or not D is an explict instantiation, and, if so,
8187 stop here. But when an explicit instantiation is deferred
8188 until the end of the compilation, DECL_EXPLICIT_INSTANTIATION
8189 is set, even though we still need to do the instantiation. */
8192 /* If we already have a specialization of this declaration, then
8193 there's no reason to instantiate it. Note that
8194 retrieve_specialization gives us both instantiations and
8195 specializations, so we must explicitly check
8196 DECL_TEMPLATE_SPECIALIZATION. */
8197 gen_tmpl
= most_general_template (tmpl
);
8198 spec
= retrieve_specialization (gen_tmpl
, args
);
8199 if (spec
!= NULL_TREE
&& DECL_TEMPLATE_SPECIALIZATION (spec
))
8202 /* This needs to happen before any tsubsting. */
8203 if (! push_tinst_level (d
))
8206 /* Set TD to the template whose DECL_TEMPLATE_RESULT is the pattern
8207 for the instantiation. This is not always the most general
8208 template. Consider, for example:
8211 struct S { template <class U> void f();
8212 template <> void f<int>(); };
8214 and an instantiation of S<double>::f<int>. We want TD to be the
8215 specialization S<T>::f<int>, not the more general S<T>::f<U>. */
8218 /* An instantiation cannot have a definition, so we need a
8219 more general template. */
8220 DECL_TEMPLATE_INSTANTIATION (td
)
8221 /* We must also deal with friend templates. Given:
8223 template <class T> struct S {
8224 template <class U> friend void f() {};
8227 S<int>::f<U> say, is not an instantiation of S<T>::f<U>,
8228 so far as the language is concerned, but that's still
8229 where we get the pattern for the instantiation from. On
8230 ther hand, if the definition comes outside the class, say:
8232 template <class T> struct S {
8233 template <class U> friend void f();
8235 template <class U> friend void f() {}
8237 we don't need to look any further. That's what the check for
8238 DECL_INITIAL is for. */
8239 || (TREE_CODE (d
) == FUNCTION_DECL
8240 && DECL_FRIEND_PSEUDO_TEMPLATE_INSTANTIATION (td
)
8241 && !DECL_INITIAL (DECL_TEMPLATE_RESULT (td
)));
8244 /* The present template, TD, should not be a definition. If it
8245 were a definition, we should be using it! Note that we
8246 cannot restructure the loop to just keep going until we find
8247 a template with a definition, since that might go too far if
8248 a specialization was declared, but not defined. */
8249 my_friendly_assert (!(TREE_CODE (d
) == FUNCTION_DECL
8250 && DECL_INITIAL (DECL_TEMPLATE_RESULT (td
))),
8252 my_friendly_assert (!(TREE_CODE (d
) == VAR_DECL
8253 && !DECL_IN_AGGR_P (DECL_TEMPLATE_RESULT (td
))),
8256 /* Fetch the more general template. */
8257 td
= DECL_TI_TEMPLATE (td
);
8260 code_pattern
= DECL_TEMPLATE_RESULT (td
);
8262 if (TREE_CODE (d
) == FUNCTION_DECL
)
8263 pattern_defined
= (DECL_INITIAL (code_pattern
) != NULL_TREE
);
8265 pattern_defined
= ! DECL_IN_AGGR_P (code_pattern
);
8267 push_to_top_level ();
8268 lineno
= DECL_SOURCE_LINE (d
);
8269 input_filename
= DECL_SOURCE_FILE (d
);
8271 if (pattern_defined
)
8273 repo_template_used (d
);
8275 if (flag_external_templates
&& ! DECL_INTERFACE_KNOWN (d
))
8277 if (flag_alt_external_templates
)
8279 if (interface_unknown
)
8280 warn_if_unknown_interface (d
);
8282 else if (DECL_INTERFACE_KNOWN (code_pattern
))
8284 DECL_INTERFACE_KNOWN (d
) = 1;
8285 DECL_NOT_REALLY_EXTERN (d
) = ! DECL_EXTERNAL (code_pattern
);
8288 warn_if_unknown_interface (code_pattern
);
8292 import_export_decl (d
);
8295 /* Reject all external templates except inline functions. */
8296 if (DECL_INTERFACE_KNOWN (d
)
8297 && ! DECL_NOT_REALLY_EXTERN (d
)
8298 && ! (TREE_CODE (d
) == FUNCTION_DECL
&& DECL_INLINE (d
)))
8301 if (TREE_CODE (d
) == VAR_DECL
8302 && TREE_READONLY (d
)
8303 && DECL_INITIAL (d
) == NULL_TREE
8304 && DECL_INITIAL (code_pattern
) != NULL_TREE
)
8305 /* We need to set up DECL_INITIAL regardless of pattern_defined if
8306 the variable is a static const initialized in the class body. */;
8307 else if (! pattern_defined
8308 || (! (TREE_CODE (d
) == FUNCTION_DECL
&& DECL_INLINE (d
) && nested
)
8311 /* Defer all templates except inline functions used in another
8312 function. We restore the source position here because it's used
8313 by add_pending_template. */
8315 input_filename
= file
;
8317 if (at_eof
&& !pattern_defined
8318 && DECL_EXPLICIT_INSTANTIATION (d
))
8321 The definition of a non-exported function template, a
8322 non-exported member function template, or a non-exported
8323 member function or static data member of a class template
8324 shall be present in every translation unit in which it is
8325 explicitly instantiated. */
8326 cp_error ("explicit instantiation of `%D' but no definition available",
8329 add_pending_template (d
);
8333 regenerate_decl_from_template (d
, td
);
8335 /* We already set the file and line above. Reset them now in case
8336 they changed as a result of calling regenerate_decl_from_template. */
8337 lineno
= DECL_SOURCE_LINE (d
);
8338 input_filename
= DECL_SOURCE_FILE (d
);
8340 if (TREE_CODE (d
) == VAR_DECL
)
8342 DECL_IN_AGGR_P (d
) = 0;
8343 if (DECL_INTERFACE_KNOWN (d
))
8344 DECL_EXTERNAL (d
) = ! DECL_NOT_REALLY_EXTERN (d
);
8347 DECL_EXTERNAL (d
) = 1;
8348 DECL_NOT_REALLY_EXTERN (d
) = 1;
8350 cp_finish_decl (d
, DECL_INITIAL (d
), NULL_TREE
, 0, 0);
8352 else if (TREE_CODE (d
) == FUNCTION_DECL
)
8354 tree t
= DECL_SAVED_TREE (code_pattern
);
8356 start_function (NULL_TREE
, d
, NULL_TREE
, 1);
8357 store_parm_decls ();
8359 if (t
&& TREE_CODE (t
) == RETURN_INIT
)
8362 (TREE_OPERAND (t
, 0),
8363 tsubst_expr (TREE_OPERAND (t
, 1), args
, tmpl
));
8367 if (t
&& TREE_CODE (t
) == CTOR_INITIALIZER
)
8369 current_member_init_list
8370 = tsubst_expr_values (TREE_OPERAND (t
, 0), args
);
8371 current_base_init_list
8372 = tsubst_expr_values (TREE_OPERAND (t
, 1), args
);
8377 /* Always keep the BLOCK node associated with the outermost
8378 pair of curly braces of a function. These are needed
8379 for correct operation of dwarfout.c. */
8382 my_friendly_assert (TREE_CODE (t
) == COMPOUND_STMT
, 42);
8383 tsubst_expr (t
, args
, tmpl
);
8385 finish_function (lineno
, 0, nested
);
8390 input_filename
= file
;
8392 pop_from_top_level ();
8399 tsubst_expr_values (t
, argvec
)
8402 tree first
= NULL_TREE
;
8405 for (; t
; t
= TREE_CHAIN (t
))
8407 tree pur
= tsubst_copy (TREE_PURPOSE (t
), argvec
, NULL_TREE
);
8408 tree val
= tsubst_expr (TREE_VALUE (t
), argvec
, NULL_TREE
);
8409 *p
= build_tree_list (pur
, val
);
8410 p
= &TREE_CHAIN (*p
);
8421 last_tree
= TREE_CHAIN (last_tree
) = t
;
8428 saved_trees
= tree_cons (NULL_TREE
, last_tree
, saved_trees
);
8429 last_tree
= NULL_TREE
;
8436 my_friendly_assert (saved_trees
!= NULL_TREE
, 0);
8438 last_tree
= TREE_VALUE (saved_trees
);
8439 saved_trees
= TREE_CHAIN (saved_trees
);
8442 /* D is an undefined function declaration in the presence of templates with
8443 the same name, listed in FNS. If one of them can produce D as an
8444 instantiation, remember this so we can instantiate it at EOF if D has
8445 not been defined by that time. */
8448 add_maybe_template (d
, fns
)
8453 if (DECL_MAYBE_TEMPLATE (d
))
8456 t
= most_specialized (fns
, d
, NULL_TREE
);
8459 if (t
== error_mark_node
)
8461 cp_error ("ambiguous template instantiation for `%D'", d
);
8465 *maybe_template_tail
= perm_tree_cons (t
, d
, NULL_TREE
);
8466 maybe_template_tail
= &TREE_CHAIN (*maybe_template_tail
);
8467 DECL_MAYBE_TEMPLATE (d
) = 1;
8470 /* Set CURRENT_ACCESS_SPECIFIER based on the protection of DECL. */
8473 set_current_access_from_decl (decl
)
8476 if (TREE_PRIVATE (decl
))
8477 current_access_specifier
= access_private_node
;
8478 else if (TREE_PROTECTED (decl
))
8479 current_access_specifier
= access_protected_node
;
8481 current_access_specifier
= access_public_node
;
8484 /* Instantiate an enumerated type. TAG is the template type, NEWTAG
8485 is the instantiation (which should have been created with
8486 start_enum) and ARGS are the template arguments to use. */
8489 tsubst_enum (tag
, newtag
, args
)
8496 for (e
= TYPE_VALUES (tag
); e
; e
= TREE_CHAIN (e
))
8501 /* Note that in a template enum, the TREE_VALUE is the
8502 CONST_DECL, not the corresponding INTEGER_CST. */
8503 value
= tsubst_expr (DECL_INITIAL (TREE_VALUE (e
)),
8507 /* Give this enumeration constant the correct access. */
8508 set_current_access_from_decl (TREE_VALUE (e
));
8510 /* Actually build the enumerator itself. */
8511 elt
= build_enumerator (TREE_PURPOSE (e
), value
, newtag
);
8513 /* We save the enumerators we have built so far in the
8514 TYPE_VALUES so that if the enumeration constants for
8515 subsequent enumerators involve those for previous ones,
8516 tsubst_copy will be able to find them. */
8517 TREE_CHAIN (elt
) = TYPE_VALUES (newtag
);
8518 TYPE_VALUES (newtag
) = elt
;
8521 finish_enum (newtag
);
8524 /* Set the DECL_ASSEMBLER_NAME for DECL, which is a FUNCTION_DECL that
8525 is either an instantiation or specialization of a template
8529 set_mangled_name_for_template_decl (decl
)
8532 tree saved_namespace
;
8533 tree context
= NULL_TREE
;
8542 my_friendly_assert (TREE_CODE (decl
) == FUNCTION_DECL
, 0);
8543 my_friendly_assert (DECL_TEMPLATE_INFO (decl
) != NULL_TREE
, 0);
8545 /* The names of template functions must be mangled so as to indicate
8546 what template is being specialized with what template arguments.
8547 For example, each of the following three functions must get
8548 different mangled names:
8551 template <> void f<7>(int);
8552 template <> void f<8>(int); */
8554 targs
= DECL_TI_ARGS (decl
);
8555 if (uses_template_parms (targs
))
8556 /* This DECL is for a partial instantiation. There's no need to
8557 mangle the name of such an entity. */
8560 tmpl
= most_general_template (DECL_TI_TEMPLATE (decl
));
8561 tparms
= DECL_TEMPLATE_PARMS (tmpl
);
8562 parm_depth
= TMPL_PARMS_DEPTH (tparms
);
8564 /* There should be as many levels of arguments as there are levels
8566 my_friendly_assert (parm_depth
== TMPL_ARGS_DEPTH (targs
), 0);
8568 /* We now compute the PARMS and RET_TYPE to give to
8569 build_decl_overload_real. The PARMS and RET_TYPE are the
8570 parameter and return types of the template, after all but the
8571 innermost template arguments have been substituted, not the
8572 parameter and return types of the function DECL. For example,
8575 template <class T> T f(T);
8577 both PARMS and RET_TYPE should be `T' even if DECL is `int f(int)'.
8578 A more subtle example is:
8580 template <class T> struct S { template <class U> void f(T, U); }
8582 Here, if DECL is `void S<int>::f(int, double)', PARMS should be
8583 {int, U}. Thus, the args that we want to subsitute into the
8584 return and parameter type for the function are those in TARGS,
8585 with the innermost level omitted. */
8586 fn_type
= TREE_TYPE (tmpl
);
8587 if (DECL_STATIC_FUNCTION_P (decl
))
8588 context
= DECL_CLASS_CONTEXT (decl
);
8590 if (parm_depth
== 1)
8591 /* No substitution is necessary. */
8598 /* Replace the innermost level of the TARGS with NULL_TREEs to
8599 let tsubst know not to subsitute for those parameters. */
8600 partial_args
= make_temp_vec (TREE_VEC_LENGTH (targs
));
8601 for (i
= 1; i
< TMPL_ARGS_DEPTH (targs
); ++i
)
8602 SET_TMPL_ARGS_LEVEL (partial_args
, i
,
8603 TMPL_ARGS_LEVEL (targs
, i
));
8604 SET_TMPL_ARGS_LEVEL (partial_args
,
8605 TMPL_ARGS_DEPTH (targs
),
8606 make_temp_vec (DECL_NTPARMS (tmpl
)));
8608 /* Now, do the (partial) substitution to figure out the
8609 appropriate function type. */
8610 fn_type
= tsubst (fn_type
, partial_args
, NULL_TREE
);
8611 if (DECL_STATIC_FUNCTION_P (decl
))
8612 context
= tsubst (context
, partial_args
, NULL_TREE
);
8614 /* Substitute into the template parameters to obtain the real
8615 innermost set of parameters. This step is important if the
8616 innermost set of template parameters contains value
8617 parameters whose types depend on outer template parameters. */
8618 TREE_VEC_LENGTH (partial_args
)--;
8619 tparms
= tsubst_template_parms (tparms
, partial_args
);
8622 /* Now, get the innermost parameters and arguments, and figure out
8623 the parameter and return types. */
8624 tparms
= INNERMOST_TEMPLATE_PARMS (tparms
);
8625 targs
= innermost_args (targs
);
8626 ret_type
= TREE_TYPE (fn_type
);
8627 parm_types
= TYPE_ARG_TYPES (fn_type
);
8629 /* For a static member function, we generate a fake `this' pointer,
8630 for the purposes of mangling. This indicates of which class the
8631 function is a member. Because of:
8635 There shall not be a static and a nonstatic member function
8636 with the same name and the same parameter types
8638 we don't have to worry that this will result in a clash with a
8639 non-static member function. */
8640 if (DECL_STATIC_FUNCTION_P (decl
))
8641 parm_types
= hash_tree_chain (build_pointer_type (context
), parm_types
);
8643 /* There should be the same number of template parameters as
8644 template arguments. */
8645 my_friendly_assert (TREE_VEC_LENGTH (tparms
) == TREE_VEC_LENGTH (targs
),
8648 /* If the template is in a namespace, we need to put that into the
8649 mangled name. Unfortunately, build_decl_overload_real does not
8650 get the decl to mangle, so it relies on the current
8651 namespace. Therefore, we set that here temporarily. */
8652 my_friendly_assert (TREE_CODE_CLASS (TREE_CODE (decl
)) == 'd', 980702);
8653 saved_namespace
= current_namespace
;
8654 current_namespace
= CP_DECL_CONTEXT (decl
);
8656 /* Actually set the DCL_ASSEMBLER_NAME. */
8657 DECL_ASSEMBLER_NAME (decl
)
8658 = build_decl_overload_real (DECL_NAME (decl
), parm_types
, ret_type
,
8660 DECL_FUNCTION_MEMBER_P (decl
)
8661 + DECL_CONSTRUCTOR_P (decl
));
8663 /* Restore the previously active namespace. */
8664 current_namespace
= saved_namespace
;