1 /* Handle parameterized types (templates) for GNU C++.
2 Copyright (C) 1992, 93-97, 1998, 1999 Free Software Foundation, Inc.
3 Written by Ken Raeburn (raeburn@cygnus.com) while at Watchmaker Computing.
4 Rewritten by Jason Merrill (jason@cygnus.com).
6 This file is part of GNU CC.
8 GNU CC is free software; you can redistribute it and/or modify
9 it under the terms of the GNU General Public License as published by
10 the Free Software Foundation; either version 2, or (at your option)
13 GNU CC is distributed in the hope that it will be useful,
14 but WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 GNU General Public License for more details.
18 You should have received a copy of the GNU General Public License
19 along with GNU CC; see the file COPYING. If not, write to
20 the Free Software Foundation, 59 Temple Place - Suite 330,
21 Boston, MA 02111-1307, USA. */
23 /* Known bugs or deficiencies include:
25 all methods must be provided in header files; can't use a source
26 file that contains only the method templates and "just win". */
43 /* The type of functions taking a tree, and some additional data, and
45 typedef int (*tree_fn_t
) PROTO((tree
, void*));
47 extern struct obstack permanent_obstack
;
50 extern char *input_filename
;
51 struct pending_inline
*pending_template_expansions
;
53 tree current_template_parms
;
54 HOST_WIDE_INT processing_template_decl
;
56 tree pending_templates
;
57 static tree
*template_tail
= &pending_templates
;
60 static tree
*maybe_template_tail
= &maybe_templates
;
62 int minimal_parse_mode
;
64 int processing_specialization
;
65 int processing_explicit_instantiation
;
66 int processing_template_parmlist
;
67 static int template_header_count
;
69 static tree saved_trees
;
71 #define obstack_chunk_alloc xmalloc
72 #define obstack_chunk_free free
74 #define UNIFY_ALLOW_NONE 0
75 #define UNIFY_ALLOW_MORE_CV_QUAL 1
76 #define UNIFY_ALLOW_LESS_CV_QUAL 2
77 #define UNIFY_ALLOW_DERIVED 4
78 #define UNIFY_ALLOW_INTEGER 8
80 static int unify
PROTO((tree
, tree
, tree
, tree
, int, int*));
81 static int resolve_overloaded_unification
PROTO((tree
, tree
, tree
, tree
,
82 unification_kind_t
, int,
84 static int try_one_overload
PROTO((tree
, tree
, tree
, tree
, tree
,
85 unification_kind_t
, int, int*));
86 static int unify
PROTO((tree
, tree
, tree
, tree
, int, int*));
87 static void add_pending_template
PROTO((tree
));
88 static int push_tinst_level
PROTO((tree
));
89 static tree classtype_mangled_name
PROTO((tree
));
90 static char *mangle_class_name_for_template
PROTO((char *, tree
, tree
));
91 static tree tsubst_expr_values
PROTO((tree
, tree
));
92 static int list_eq
PROTO((tree
, tree
));
93 static tree get_class_bindings
PROTO((tree
, tree
, tree
));
94 static tree coerce_template_parms
PROTO((tree
, tree
, tree
, int, int));
95 static void tsubst_enum
PROTO((tree
, tree
, tree
));
96 static tree add_to_template_args
PROTO((tree
, tree
));
97 static tree add_outermost_template_args
PROTO((tree
, tree
));
98 static void maybe_adjust_types_for_deduction
PROTO((unification_kind_t
, tree
*,
100 static int type_unification_real
PROTO((tree
, tree
, tree
, tree
,
101 int, unification_kind_t
, int, int*));
102 static void note_template_header
PROTO((int));
103 static tree maybe_fold_nontype_arg
PROTO((tree
));
104 static tree convert_nontype_argument
PROTO((tree
, tree
));
105 static tree convert_template_argument
PROTO ((tree
, tree
, tree
, int,
107 static tree get_bindings_overload
PROTO((tree
, tree
, tree
));
108 static int for_each_template_parm
PROTO((tree
, tree_fn_t
, void*));
109 static tree build_template_parm_index
PROTO((int, int, int, tree
, tree
));
110 static int inline_needs_template_parms
PROTO((tree
));
111 static void push_inline_template_parms_recursive
PROTO((tree
, int));
112 static tree retrieve_specialization
PROTO((tree
, tree
));
113 static tree register_specialization
PROTO((tree
, tree
, tree
));
114 static int unregister_specialization
PROTO((tree
, 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 tree most_specialized
PROTO((tree
, tree
, tree
));
128 static tree most_specialized_class
PROTO((tree
, tree
));
129 static tree most_general_template
PROTO((tree
));
130 static void set_mangled_name_for_template_decl
PROTO((tree
));
131 static int template_class_depth_real
PROTO((tree
, int));
132 static tree tsubst_aggr_type
PROTO((tree
, tree
, tree
, int));
133 static tree tsubst_decl
PROTO((tree
, tree
, tree
, tree
));
134 static tree tsubst_arg_types
PROTO((tree
, tree
, tree
));
135 static void check_specialization_scope
PROTO((void));
136 static tree process_partial_specialization
PROTO((tree
));
137 static void set_current_access_from_decl
PROTO((tree
));
138 static void check_default_tmpl_args
PROTO((tree
, tree
, int, int));
139 static tree tsubst_call_declarator_parms
PROTO((tree
, tree
, tree
));
141 /* We use TREE_VECs to hold template arguments. If there is only one
142 level of template arguments, then the TREE_VEC contains the
143 arguments directly. If there is more than one level of template
144 arguments, then each entry in the TREE_VEC is itself a TREE_VEC,
145 containing the template arguments for a single level. The first
146 entry in the outer TREE_VEC is the outermost level of template
147 parameters; the last is the innermost.
149 It is incorrect to ever form a template argument vector containing
150 only one level of arguments, but which is a TREE_VEC containing as
151 its only entry the TREE_VEC for that level. */
153 /* Non-zero if the template arguments is actually a vector of vectors,
154 rather than just a vector. */
155 #define TMPL_ARGS_HAVE_MULTIPLE_LEVELS(NODE) \
157 && TREE_CODE (NODE) == TREE_VEC \
158 && TREE_VEC_LENGTH (NODE) > 0 \
159 && TREE_VEC_ELT (NODE, 0) != NULL_TREE \
160 && TREE_CODE (TREE_VEC_ELT (NODE, 0)) == TREE_VEC)
162 /* The depth of a template argument vector. When called directly by
163 the parser, we use a TREE_LIST rather than a TREE_VEC to represent
164 template arguments. In fact, we may even see NULL_TREE if there
165 are no template arguments. In both of those cases, there is only
166 one level of template arguments. */
167 #define TMPL_ARGS_DEPTH(NODE) \
168 (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (NODE) ? TREE_VEC_LENGTH (NODE) : 1)
170 /* The LEVELth level of the template ARGS. Note that template
171 parameter levels are indexed from 1, not from 0. */
172 #define TMPL_ARGS_LEVEL(ARGS, LEVEL) \
173 (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (ARGS) \
174 ? TREE_VEC_ELT ((ARGS), (LEVEL) - 1) : ARGS)
176 /* Set the LEVELth level of the template ARGS to VAL. This macro does
177 not work with single-level argument vectors. */
178 #define SET_TMPL_ARGS_LEVEL(ARGS, LEVEL, VAL) \
179 (TREE_VEC_ELT ((ARGS), (LEVEL) - 1) = (VAL))
181 /* Accesses the IDXth parameter in the LEVELth level of the ARGS. */
182 #define TMPL_ARG(ARGS, LEVEL, IDX) \
183 (TREE_VEC_ELT (TMPL_ARGS_LEVEL (ARGS, LEVEL), IDX))
185 /* Set the IDXth element in the LEVELth level of ARGS to VAL. This
186 macro does not work with single-level argument vectors. */
187 #define SET_TMPL_ARG(ARGS, LEVEL, IDX, VAL) \
188 (TREE_VEC_ELT (TREE_VEC_ELT ((ARGS), (LEVEL) - 1), (IDX)) = (VAL))
190 /* Given a single level of template arguments in NODE, return the
191 number of arguments. */
192 #define NUM_TMPL_ARGS(NODE) \
193 ((NODE) == NULL_TREE ? 0 \
194 : (TREE_CODE (NODE) == TREE_VEC \
195 ? TREE_VEC_LENGTH (NODE) : list_length (NODE)))
197 /* The number of levels of template parameters given by NODE. */
198 #define TMPL_PARMS_DEPTH(NODE) \
199 (TREE_INT_CST_HIGH (TREE_PURPOSE (NODE)))
201 /* Do any processing required when DECL (a member template declaration
202 using TEMPLATE_PARAMETERS as its innermost parameter list) is
203 finished. Returns the TEMPLATE_DECL corresponding to DECL, unless
204 it is a specialization, in which case the DECL itself is returned. */
207 finish_member_template_decl (decl
)
210 if (decl
== NULL_TREE
|| decl
== void_type_node
)
212 else if (decl
== error_mark_node
)
213 /* By returning NULL_TREE, the parser will just ignore this
214 declaration. We have already issued the error. */
216 else if (TREE_CODE (decl
) == TREE_LIST
)
218 /* Assume that the class is the only declspec. */
219 decl
= TREE_VALUE (decl
);
220 if (IS_AGGR_TYPE (decl
) && CLASSTYPE_TEMPLATE_INFO (decl
)
221 && ! CLASSTYPE_TEMPLATE_SPECIALIZATION (decl
))
223 tree tmpl
= CLASSTYPE_TI_TEMPLATE (decl
);
224 check_member_template (tmpl
);
229 else if (DECL_TEMPLATE_INFO (decl
))
231 if (!DECL_TEMPLATE_SPECIALIZATION (decl
))
233 check_member_template (DECL_TI_TEMPLATE (decl
));
234 return DECL_TI_TEMPLATE (decl
);
240 cp_error ("invalid member template declaration `%D'", decl
);
242 return error_mark_node
;
245 /* Returns the template nesting level of the indicated class TYPE.
255 A<T>::B<U> has depth two, while A<T> has depth one.
256 Both A<T>::B<int> and A<int>::B<U> have depth one, if
257 COUNT_SPECIALIZATIONS is 0 or if they are instantiations, not
260 This function is guaranteed to return 0 if passed NULL_TREE so
261 that, for example, `template_class_depth (current_class_type)' is
265 template_class_depth_real (type
, count_specializations
)
267 int count_specializations
;
272 type
&& TREE_CODE (type
) != NAMESPACE_DECL
;
273 type
= (TREE_CODE (type
) == FUNCTION_DECL
)
274 ? DECL_REAL_CONTEXT (type
) : TYPE_CONTEXT (type
))
276 if (TREE_CODE (type
) != FUNCTION_DECL
)
278 if (CLASSTYPE_TEMPLATE_INFO (type
)
279 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (type
))
280 && ((count_specializations
281 && CLASSTYPE_TEMPLATE_SPECIALIZATION (type
))
282 || uses_template_parms (CLASSTYPE_TI_ARGS (type
))))
287 if (DECL_TEMPLATE_INFO (type
)
288 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (type
))
289 && ((count_specializations
290 && DECL_TEMPLATE_SPECIALIZATION (type
))
291 || uses_template_parms (DECL_TI_ARGS (type
))))
299 /* Returns the template nesting level of the indicated class TYPE.
300 Like template_class_depth_real, but instantiations do not count in
304 template_class_depth (type
)
307 return template_class_depth_real (type
, /*count_specializations=*/0);
310 /* Returns 1 if processing DECL as part of do_pending_inlines
311 needs us to push template parms. */
314 inline_needs_template_parms (decl
)
317 if (! DECL_TEMPLATE_INFO (decl
))
320 return (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (most_general_template (decl
)))
321 > (processing_template_decl
+ DECL_TEMPLATE_SPECIALIZATION (decl
)));
324 /* Subroutine of maybe_begin_member_template_processing.
325 Push the template parms in PARMS, starting from LEVELS steps into the
326 chain, and ending at the beginning, since template parms are listed
330 push_inline_template_parms_recursive (parmlist
, levels
)
334 tree parms
= TREE_VALUE (parmlist
);
338 push_inline_template_parms_recursive (TREE_CHAIN (parmlist
), levels
- 1);
340 ++processing_template_decl
;
341 current_template_parms
342 = tree_cons (build_int_2 (0, processing_template_decl
),
343 parms
, current_template_parms
);
344 TEMPLATE_PARMS_FOR_INLINE (current_template_parms
) = 1;
347 for (i
= 0; i
< TREE_VEC_LENGTH (parms
); ++i
)
349 tree parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
350 my_friendly_assert (TREE_CODE_CLASS (TREE_CODE (parm
)) == 'd', 0);
352 switch (TREE_CODE (parm
))
361 /* Make a CONST_DECL as is done in process_template_parm.
362 It is ugly that we recreate this here; the original
363 version built in process_template_parm is no longer
365 tree decl
= build_decl (CONST_DECL
, DECL_NAME (parm
),
367 SET_DECL_ARTIFICIAL (decl
);
368 DECL_INITIAL (decl
) = DECL_INITIAL (parm
);
369 DECL_TEMPLATE_PARM_P (decl
) = 1;
375 my_friendly_abort (0);
380 /* Restore the template parameter context for a member template or
381 a friend template defined in a class definition. */
384 maybe_begin_member_template_processing (decl
)
390 if (! inline_needs_template_parms (decl
))
393 parms
= DECL_TEMPLATE_PARMS (most_general_template (decl
));
395 levels
= TMPL_PARMS_DEPTH (parms
) - processing_template_decl
;
397 if (DECL_TEMPLATE_SPECIALIZATION (decl
))
400 parms
= TREE_CHAIN (parms
);
403 push_inline_template_parms_recursive (parms
, levels
);
406 /* Undo the effects of begin_member_template_processing. */
409 maybe_end_member_template_processing ()
411 if (! processing_template_decl
)
414 while (current_template_parms
415 && TEMPLATE_PARMS_FOR_INLINE (current_template_parms
))
417 --processing_template_decl
;
418 current_template_parms
= TREE_CHAIN (current_template_parms
);
423 /* Returns non-zero iff T is a member template function. We must be
426 template <class T> class C { void f(); }
428 Here, f is a template function, and a member, but not a member
429 template. This function does not concern itself with the origin of
430 T, only its present state. So if we have
432 template <class T> class C { template <class U> void f(U); }
434 then neither C<int>::f<char> nor C<T>::f<double> is considered
435 to be a member template. But, `template <class U> void
436 C<int>::f(U)' is considered a member template. */
439 is_member_template (t
)
442 if (!DECL_FUNCTION_TEMPLATE_P (t
))
443 /* Anything that isn't a function or a template function is
444 certainly not a member template. */
447 /* A local class can't have member templates. */
448 if (hack_decl_function_context (t
))
451 return (DECL_FUNCTION_MEMBER_P (DECL_TEMPLATE_RESULT (t
))
452 /* If there are more levels of template parameters than
453 there are template classes surrounding the declaration,
454 then we have a member template. */
455 && (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (t
)) >
456 template_class_depth (DECL_CLASS_CONTEXT (t
))));
460 /* Returns non-zero iff T is a member template class. See
461 is_member_template for a description of what precisely constitutes
462 a member template. */
465 is_member_template_class (t
)
468 if (!DECL_CLASS_TEMPLATE_P (t
))
469 /* Anything that isn't a class template, is certainly not a member
473 if (!DECL_CLASS_SCOPE_P (t
))
474 /* Anything whose context isn't a class type is surely not a
478 /* If there are more levels of template parameters than there are
479 template classes surrounding the declaration, then we have a
481 return (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (t
)) >
482 template_class_depth (DECL_CONTEXT (t
)));
486 /* Return a new template argument vector which contains all of ARGS,
487 but has as its innermost set of arguments the EXTRA_ARGS. The
488 resulting vector will be built on a temporary obstack, and so must
489 be explicitly copied to the permanent obstack, if required. */
492 add_to_template_args (args
, extra_args
)
501 extra_depth
= TMPL_ARGS_DEPTH (extra_args
);
502 new_args
= make_temp_vec (TMPL_ARGS_DEPTH (args
) + extra_depth
);
504 for (i
= 1; i
<= TMPL_ARGS_DEPTH (args
); ++i
)
505 SET_TMPL_ARGS_LEVEL (new_args
, i
, TMPL_ARGS_LEVEL (args
, i
));
507 for (j
= 1; j
<= extra_depth
; ++j
, ++i
)
508 SET_TMPL_ARGS_LEVEL (new_args
, i
, TMPL_ARGS_LEVEL (extra_args
, j
));
513 /* Like add_to_template_args, but only the outermost ARGS are added to
514 the EXTRA_ARGS. In particular, all but TMPL_ARGS_DEPTH
515 (EXTRA_ARGS) levels are added. This function is used to combine
516 the template arguments from a partial instantiation with the
517 template arguments used to attain the full instantiation from the
518 partial instantiation. */
521 add_outermost_template_args (args
, extra_args
)
527 /* If there are more levels of EXTRA_ARGS than there are ARGS,
528 something very fishy is going on. */
529 my_friendly_assert (TMPL_ARGS_DEPTH (args
) >= TMPL_ARGS_DEPTH (extra_args
),
532 /* If *all* the new arguments will be the EXTRA_ARGS, just return
534 if (TMPL_ARGS_DEPTH (args
) == TMPL_ARGS_DEPTH (extra_args
))
537 /* For the moment, we make ARGS look like it contains fewer levels. */
538 TREE_VEC_LENGTH (args
) -= TMPL_ARGS_DEPTH (extra_args
);
540 new_args
= add_to_template_args (args
, extra_args
);
542 /* Now, we restore ARGS to its full dimensions. */
543 TREE_VEC_LENGTH (args
) += TMPL_ARGS_DEPTH (extra_args
);
548 /* We've got a template header coming up; push to a new level for storing
552 begin_template_parm_list ()
554 /* We use a non-tag-transparent scope here, which causes pushtag to
555 put tags in this scope, rather than in the enclosing class or
556 namespace scope. This is the right thing, since we want
557 TEMPLATE_DECLS, and not TYPE_DECLS for template classes. For a
558 global template class, push_template_decl handles putting the
559 TEMPLATE_DECL into top-level scope. For a nested template class,
562 template <class T> struct S1 {
563 template <class T> struct S2 {};
566 pushtag contains special code to call pushdecl_with_scope on the
567 TEMPLATE_DECL for S2. */
569 declare_pseudo_global_level ();
570 ++processing_template_decl
;
571 ++processing_template_parmlist
;
572 note_template_header (0);
575 /* This routine is called when a specialization is declared. If it is
576 illegal to declare a specialization here, an error is reported. */
579 check_specialization_scope ()
581 tree scope
= current_scope ();
585 An explicit specialization shall be declared in the namespace of
586 which the template is a member, or, for member templates, in the
587 namespace of which the enclosing class or enclosing class
588 template is a member. An explicit specialization of a member
589 function, member class or static data member of a class template
590 shall be declared in the namespace of which the class template
592 if (scope
&& TREE_CODE (scope
) != NAMESPACE_DECL
)
593 cp_error ("explicit specialization in non-namespace scope `%D'",
598 In an explicit specialization declaration for a member of a class
599 template or a member template that appears in namespace scope,
600 the member template and some of its enclosing class templates may
601 remain unspecialized, except that the declaration shall not
602 explicitly specialize a class member template if its enclosing
603 class templates are not explicitly specialized as well. */
604 if (current_template_parms
)
605 cp_error ("enclosing class templates are not explicitly specialized");
608 /* We've just seen template <>. */
611 begin_specialization ()
613 note_template_header (1);
614 check_specialization_scope ();
617 /* Called at then end of processing a declaration preceeded by
621 end_specialization ()
623 reset_specialization ();
626 /* Any template <>'s that we have seen thus far are not referring to a
627 function specialization. */
630 reset_specialization ()
632 processing_specialization
= 0;
633 template_header_count
= 0;
636 /* We've just seen a template header. If SPECIALIZATION is non-zero,
637 it was of the form template <>. */
640 note_template_header (specialization
)
643 processing_specialization
= specialization
;
644 template_header_count
++;
647 /* We're beginning an explicit instantiation. */
650 begin_explicit_instantiation ()
652 ++processing_explicit_instantiation
;
657 end_explicit_instantiation ()
659 my_friendly_assert(processing_explicit_instantiation
> 0, 0);
660 --processing_explicit_instantiation
;
663 /* The TYPE is being declared. If it is a template type, that means it
664 is a partial specialization. Do appropriate error-checking. */
667 maybe_process_partial_specialization (type
)
670 if (IS_AGGR_TYPE (type
) && CLASSTYPE_USE_TEMPLATE (type
))
672 if (CLASSTYPE_IMPLICIT_INSTANTIATION (type
)
673 && TYPE_SIZE (type
) == NULL_TREE
)
675 SET_CLASSTYPE_TEMPLATE_SPECIALIZATION (type
);
676 if (processing_template_decl
)
677 push_template_decl (TYPE_MAIN_DECL (type
));
679 else if (CLASSTYPE_TEMPLATE_INSTANTIATION (type
))
680 cp_error ("specialization of `%T' after instantiation", type
);
684 /* Retrieve the specialization (in the sense of [temp.spec] - a
685 specialization is either an instantiation or an explicit
686 specialization) of TMPL for the given template ARGS. If there is
687 no such specialization, return NULL_TREE. The ARGS are a vector of
688 arguments, or a vector of vectors of arguments, in the case of
689 templates with more than one level of parameters. */
692 retrieve_specialization (tmpl
, args
)
698 my_friendly_assert (TREE_CODE (tmpl
) == TEMPLATE_DECL
, 0);
700 /* There should be as many levels of arguments as there are
701 levels of parameters. */
702 my_friendly_assert (TMPL_ARGS_DEPTH (args
)
703 == TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl
)),
706 for (s
= DECL_TEMPLATE_SPECIALIZATIONS (tmpl
);
709 if (comp_template_args (TREE_PURPOSE (s
), args
))
710 return TREE_VALUE (s
);
715 /* Returns non-zero iff DECL is a specialization of TMPL. */
718 is_specialization_of (decl
, tmpl
)
724 if (TREE_CODE (decl
) == FUNCTION_DECL
)
728 t
= DECL_TEMPLATE_INFO (t
) ? DECL_TI_TEMPLATE (t
) : NULL_TREE
)
734 my_friendly_assert (TREE_CODE (decl
) == TYPE_DECL
, 0);
736 for (t
= TREE_TYPE (decl
);
738 t
= CLASSTYPE_USE_TEMPLATE (t
)
739 ? TREE_TYPE (CLASSTYPE_TI_TEMPLATE (t
)) : NULL_TREE
)
740 if (same_type_p (TYPE_MAIN_VARIANT (t
),
741 TYPE_MAIN_VARIANT (TREE_TYPE (tmpl
))))
748 /* Register the specialization SPEC as a specialization of TMPL with
749 the indicated ARGS. Returns SPEC, or an equivalent prior
750 declaration, if available. */
753 register_specialization (spec
, tmpl
, args
)
760 my_friendly_assert (TREE_CODE (tmpl
) == TEMPLATE_DECL
, 0);
762 if (TREE_CODE (spec
) == FUNCTION_DECL
763 && uses_template_parms (DECL_TI_ARGS (spec
)))
764 /* This is the FUNCTION_DECL for a partial instantiation. Don't
765 register it; we want the corresponding TEMPLATE_DECL instead.
766 We use `uses_template_parms (DECL_TI_ARGS (spec))' rather than
767 the more obvious `uses_template_parms (spec)' to avoid problems
768 with default function arguments. In particular, given
771 template <class T> void f(T t1, T t = T())
773 the default argument expression is not substituted for in an
774 instantiation unless and until it is actually needed. */
777 /* There should be as many levels of arguments as there are
778 levels of parameters. */
779 my_friendly_assert (TMPL_ARGS_DEPTH (args
)
780 == TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl
)),
783 for (s
= DECL_TEMPLATE_SPECIALIZATIONS (tmpl
);
786 if (comp_template_args (TREE_PURPOSE (s
), args
))
788 tree fn
= TREE_VALUE (s
);
790 if (DECL_TEMPLATE_SPECIALIZATION (spec
))
792 if (DECL_TEMPLATE_INSTANTIATION (fn
))
795 || DECL_EXPLICIT_INSTANTIATION (fn
))
797 cp_error ("specialization of %D after instantiation",
803 /* This situation should occur only if the first
804 specialization is an implicit instantiation,
805 the second is an explicit specialization, and
806 the implicit instantiation has not yet been
807 used. That situation can occur if we have
808 implicitly instantiated a member function and
809 then specialized it later.
811 We can also wind up here if a friend
812 declaration that looked like an instantiation
813 turns out to be a specialization:
815 template <class T> void foo(T);
816 class S { friend void foo<>(int) };
817 template <> void foo(int);
819 We transform the existing DECL in place so that
820 any pointers to it become pointers to the
823 If there was a definition for the template, but
824 not for the specialization, we want this to
825 look as if there is no definition, and vice
827 DECL_INITIAL (fn
) = NULL_TREE
;
828 duplicate_decls (spec
, fn
);
833 else if (DECL_TEMPLATE_SPECIALIZATION (fn
))
835 duplicate_decls (spec
, fn
);
841 DECL_TEMPLATE_SPECIALIZATIONS (tmpl
)
842 = perm_tree_cons (args
, spec
, DECL_TEMPLATE_SPECIALIZATIONS (tmpl
));
847 /* Unregister the specialization SPEC as a specialization of TMPL.
848 Returns nonzero if the SPEC was listed as a specialization of
852 unregister_specialization (spec
, tmpl
)
858 for (s
= &DECL_TEMPLATE_SPECIALIZATIONS (tmpl
);
860 s
= &TREE_CHAIN (*s
))
861 if (TREE_VALUE (*s
) == spec
)
863 *s
= TREE_CHAIN (*s
);
870 /* Print the list of candidate FNS in an error message. */
873 print_candidates (fns
)
878 char* str
= "candidates are:";
880 for (fn
= fns
; fn
!= NULL_TREE
; fn
= TREE_CHAIN (fn
))
882 cp_error_at ("%s %+#D", str
, TREE_VALUE (fn
));
887 /* Returns the template (one of the functions given by TEMPLATE_ID)
888 which can be specialized to match the indicated DECL with the
889 explicit template args given in TEMPLATE_ID. If
890 NEED_MEMBER_TEMPLATE is true the function is a specialization of a
891 member template. The template args (those explicitly specified and
892 those deduced) are output in a newly created vector *TARGS_OUT. If
893 it is impossible to determine the result, an error message is
894 issued, unless COMPLAIN is 0. The DECL may be NULL_TREE if none is
898 determine_specialization (template_id
, decl
, targs_out
,
899 need_member_template
,
904 int need_member_template
;
908 tree templates
= NULL_TREE
;
911 *targs_out
= NULL_TREE
;
913 if (template_id
== error_mark_node
)
914 return error_mark_node
;
916 fns
= TREE_OPERAND (template_id
, 0);
917 targs_in
= TREE_OPERAND (template_id
, 1);
919 if (fns
== error_mark_node
)
920 return error_mark_node
;
922 /* Check for baselinks. */
923 if (TREE_CODE (fns
) == TREE_LIST
)
924 fns
= TREE_VALUE (fns
);
926 for (; fns
; fns
= OVL_NEXT (fns
))
930 fn
= OVL_CURRENT (fns
);
931 if (!need_member_template
932 && TREE_CODE (fn
) == FUNCTION_DECL
933 && DECL_FUNCTION_MEMBER_P (fn
)
934 && DECL_USE_TEMPLATE (fn
)
935 && DECL_TI_TEMPLATE (fn
))
936 /* We can get here when processing something like:
937 template <class T> class X { void f(); }
938 template <> void X<int>::f() {}
939 We're specializing a member function, but not a member
941 tmpl
= DECL_TI_TEMPLATE (fn
);
942 else if (TREE_CODE (fn
) != TEMPLATE_DECL
943 || (need_member_template
&& !is_member_template (fn
)))
948 if (list_length (targs_in
) > DECL_NTPARMS (tmpl
))
951 if (decl
== NULL_TREE
)
953 /* Unify against ourselves to make sure that the args we have
954 make sense and there aren't any undeducible parms. It's OK if
955 not all the parms are specified; they might be deduced
957 tree targs
= get_bindings_overload (tmpl
, DECL_RESULT (tmpl
),
961 /* Unification was successful. */
962 templates
= scratch_tree_cons (targs
, tmpl
, templates
);
965 templates
= scratch_tree_cons (NULL_TREE
, tmpl
, templates
);
968 if (decl
!= NULL_TREE
)
970 tree tmpl
= most_specialized (templates
, decl
, targs_in
);
974 if (tmpl
== error_mark_node
)
976 else if (tmpl
== NULL_TREE
)
979 inner_args
= get_bindings (tmpl
, decl
, targs_in
);
980 tmpl_args
= DECL_TI_ARGS (DECL_RESULT (tmpl
));
981 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (tmpl_args
))
983 *targs_out
= copy_node (tmpl_args
);
984 SET_TMPL_ARGS_LEVEL (*targs_out
,
985 TMPL_ARGS_DEPTH (*targs_out
),
989 *targs_out
= inner_args
;
994 if (templates
== NULL_TREE
)
999 cp_error_at ("template-id `%D' for `%+D' does not match any template declaration",
1001 return error_mark_node
;
1005 else if (TREE_CHAIN (templates
) != NULL_TREE
1006 || uses_template_parms (TREE_PURPOSE (templates
)))
1011 cp_error_at ("ambiguous template specialization `%D' for `%+D'",
1013 print_candidates (templates
);
1014 return error_mark_node
;
1019 /* We have one, and exactly one, match. */
1020 *targs_out
= TREE_PURPOSE (templates
);
1021 return TREE_VALUE (templates
);
1024 /* Check to see if the function just declared, as indicated in
1025 DECLARATOR, and in DECL, is a specialization of a function
1026 template. We may also discover that the declaration is an explicit
1027 instantiation at this point.
1029 Returns DECL, or an equivalent declaration that should be used
1032 FLAGS is a bitmask consisting of the following flags:
1034 2: The function has a definition.
1035 4: The function is a friend.
1037 The TEMPLATE_COUNT is the number of references to qualifying
1038 template classes that appeared in the name of the function. For
1041 template <class T> struct S { void f(); };
1044 the TEMPLATE_COUNT would be 1. However, explicitly specialized
1045 classes are not counted in the TEMPLATE_COUNT, so that in
1047 template <class T> struct S {};
1048 template <> struct S<int> { void f(); }
1049 template <> void S<int>::f();
1051 the TEMPLATE_COUNT would be 0. (Note that this declaration is
1052 illegal; there should be no template <>.)
1054 If the function is a specialization, it is marked as such via
1055 DECL_TEMPLATE_SPECIALIZATION. Furthermore, its DECL_TEMPLATE_INFO
1056 is set up correctly, and it is added to the list of specializations
1057 for that template. */
1060 check_explicit_specialization (declarator
, decl
, template_count
, flags
)
1066 int have_def
= flags
& 2;
1067 int is_friend
= flags
& 4;
1068 int specialization
= 0;
1069 int explicit_instantiation
= 0;
1070 int member_specialization
= 0;
1072 tree ctype
= DECL_CLASS_CONTEXT (decl
);
1073 tree dname
= DECL_NAME (decl
);
1075 if (processing_specialization
)
1077 /* The last template header was of the form template <>. */
1079 if (template_header_count
> template_count
)
1081 /* There were more template headers than qualifying template
1083 if (template_header_count
- template_count
> 1)
1084 /* There shouldn't be that many template parameter
1085 lists. There can be at most one parameter list for
1086 every qualifying class, plus one for the function
1088 cp_error ("too many template parameter lists in declaration of `%D'", decl
);
1090 SET_DECL_TEMPLATE_SPECIALIZATION (decl
);
1092 member_specialization
= 1;
1096 else if (template_header_count
== template_count
)
1098 /* The counts are equal. So, this might be a
1099 specialization, but it is not a specialization of a
1100 member template. It might be something like
1102 template <class T> struct S {
1106 void S<int>::f(int i) {} */
1108 SET_DECL_TEMPLATE_SPECIALIZATION (decl
);
1112 /* This cannot be an explicit specialization. There are not
1113 enough headers for all of the qualifying classes. For
1114 example, we might have:
1117 void S<int>::T<char>::f();
1119 But, we're missing another template <>. */
1120 cp_error("too few template parameter lists in declaration of `%D'", decl
);
1124 else if (processing_explicit_instantiation
)
1126 if (template_header_count
)
1127 cp_error ("template parameter list used in explicit instantiation");
1130 cp_error ("definition provided for explicit instantiation");
1132 explicit_instantiation
= 1;
1134 else if (ctype
!= NULL_TREE
1135 && !TYPE_BEING_DEFINED (ctype
)
1136 && CLASSTYPE_TEMPLATE_INSTANTIATION (ctype
)
1139 /* This case catches outdated code that looks like this:
1141 template <class T> struct S { void f(); };
1142 void S<int>::f() {} // Missing template <>
1144 We disable this check when the type is being defined to
1145 avoid complaining about default compiler-generated
1146 constructors, destructors, and assignment operators.
1147 Since the type is an instantiation, not a specialization,
1148 these are the only functions that can be defined before
1149 the class is complete. */
1152 template <class T> void S<int>::f() {}
1154 if (template_header_count
)
1156 cp_error ("template parameters specified in specialization");
1162 ("explicit specialization not preceded by `template <>'");
1164 SET_DECL_TEMPLATE_SPECIALIZATION (decl
);
1166 else if (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
)
1169 /* This could be something like:
1171 template <class T> void f(T);
1172 class S { friend void f<>(int); } */
1176 /* This case handles bogus declarations like template <>
1177 template <class T> void f<int>(); */
1179 cp_error ("template-id `%D' in declaration of primary template",
1185 if (specialization
|| member_specialization
)
1187 tree t
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
1188 for (; t
; t
= TREE_CHAIN (t
))
1189 if (TREE_PURPOSE (t
))
1192 ("default argument specified in explicit specialization");
1195 if (current_lang_name
== lang_name_c
)
1196 cp_error ("template specialization with C linkage");
1199 if (specialization
|| member_specialization
|| explicit_instantiation
)
1202 tree tmpl
= NULL_TREE
;
1203 tree targs
= NULL_TREE
;
1205 /* Make sure that the declarator is a TEMPLATE_ID_EXPR. */
1206 if (TREE_CODE (declarator
) != TEMPLATE_ID_EXPR
)
1210 my_friendly_assert (TREE_CODE (declarator
) == IDENTIFIER_NODE
,
1213 fns
= IDENTIFIER_NAMESPACE_VALUE (dname
);
1218 lookup_template_function (fns
, NULL_TREE
);
1221 if (declarator
== error_mark_node
)
1222 return error_mark_node
;
1224 if (TREE_CODE (TREE_OPERAND (declarator
, 0)) == LOOKUP_EXPR
)
1226 /* A friend declaration. We can't do much, because we don't
1227 know what this resolves to, yet. */
1228 my_friendly_assert (is_friend
!= 0, 0);
1229 my_friendly_assert (!explicit_instantiation
, 0);
1230 SET_DECL_IMPLICIT_INSTANTIATION (decl
);
1234 if (ctype
!= NULL_TREE
&& TYPE_BEING_DEFINED (ctype
))
1236 if (!explicit_instantiation
)
1237 /* A specialization in class scope. This is illegal,
1238 but the error will already have been flagged by
1239 check_specialization_scope. */
1240 return error_mark_node
;
1243 /* It's not legal to write an explicit instantiation in
1246 class C { template void f(); }
1248 This case is caught by the parser. However, on
1251 template class C { void f(); };
1253 (which is illegal) we can get here. The error will be
1260 else if (ctype
!= NULL_TREE
1261 && (TREE_CODE (TREE_OPERAND (declarator
, 0)) ==
1264 /* Find the list of functions in ctype that have the same
1265 name as the declared function. */
1266 tree name
= TREE_OPERAND (declarator
, 0);
1269 if (name
== constructor_name (ctype
)
1270 || name
== constructor_name_full (ctype
))
1272 int is_constructor
= DECL_CONSTRUCTOR_P (decl
);
1274 if (is_constructor
? !TYPE_HAS_CONSTRUCTOR (ctype
)
1275 : !TYPE_HAS_DESTRUCTOR (ctype
))
1277 /* From [temp.expl.spec]:
1279 If such an explicit specialization for the member
1280 of a class template names an implicitly-declared
1281 special member function (clause _special_), the
1282 program is ill-formed.
1284 Similar language is found in [temp.explicit]. */
1285 cp_error ("specialization of implicitly-declared special member function");
1290 name
= is_constructor
? ctor_identifier
: dtor_identifier
;
1293 fns
= lookup_fnfields (TYPE_BINFO (ctype
), name
, 1);
1295 if (fns
== NULL_TREE
)
1297 cp_error ("no member function `%s' declared in `%T'",
1298 IDENTIFIER_POINTER (name
),
1303 TREE_OPERAND (declarator
, 0) = fns
;
1306 /* Figure out what exactly is being specialized at this point.
1307 Note that for an explicit instantiation, even one for a
1308 member function, we cannot tell apriori whether the
1309 instantiation is for a member template, or just a member
1310 function of a template class. Even if a member template is
1311 being instantiated, the member template arguments may be
1312 elided if they can be deduced from the rest of the
1314 tmpl
= determine_specialization (declarator
, decl
,
1316 member_specialization
,
1319 if (tmpl
&& tmpl
!= error_mark_node
)
1321 gen_tmpl
= most_general_template (tmpl
);
1323 if (explicit_instantiation
)
1325 /* We don't set DECL_EXPLICIT_INSTANTIATION here; that
1326 is done by do_decl_instantiation later. */
1327 decl
= instantiate_template (tmpl
, innermost_args (targs
));
1331 /* If we though that the DECL was a member function, but it
1332 turns out to be specializing a static member function,
1333 make DECL a static member function as well. */
1334 if (DECL_STATIC_FUNCTION_P (tmpl
)
1335 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
1337 revert_static_member_fn (&decl
, 0, 0);
1338 last_function_parms
= TREE_CHAIN (last_function_parms
);
1341 /* Set up the DECL_TEMPLATE_INFO for DECL. */
1342 DECL_TEMPLATE_INFO (decl
)
1343 = perm_tree_cons (tmpl
, targs
, NULL_TREE
);
1345 /* Mangle the function name appropriately. Note that we do
1346 not mangle specializations of non-template member
1347 functions of template classes, e.g. with
1349 template <class T> struct S { void f(); }
1351 and given the specialization
1353 template <> void S<int>::f() {}
1355 we do not mangle S<int>::f() here. That's because it's
1356 just an ordinary member function and doesn't need special
1357 treatment. We do this here so that the ordinary,
1358 non-template, name-mangling algorith will not be used
1360 if ((is_member_template (tmpl
) || ctype
== NULL_TREE
)
1361 && name_mangling_version
>= 1)
1362 set_mangled_name_for_template_decl (decl
);
1364 if (is_friend
&& !have_def
)
1365 /* This is not really a declaration of a specialization.
1366 It's just the name of an instantiation. But, it's not
1367 a request for an instantiation, either. */
1368 SET_DECL_IMPLICIT_INSTANTIATION (decl
);
1370 /* Register this specialization so that we can find it
1372 decl
= register_specialization (decl
, gen_tmpl
, targs
);
1381 /* TYPE is being declared. Verify that the use of template headers
1382 and such is reasonable. Issue error messages if not. */
1385 maybe_check_template_type (type
)
1388 if (template_header_count
)
1390 /* We are in the scope of some `template <...>' header. */
1393 = template_class_depth_real (TYPE_CONTEXT (type
),
1394 /*count_specializations=*/1);
1396 if (template_header_count
<= context_depth
)
1397 /* This is OK; the template headers are for the context. We
1398 are actually too lenient here; like
1399 check_explicit_specialization we should consider the number
1400 of template types included in the actual declaration. For
1403 template <class T> struct S {
1404 template <class U> template <class V>
1410 template <class T> struct S {
1411 template <class U> struct I;
1414 template <class T> template <class U.
1419 else if (template_header_count
> context_depth
+ 1)
1420 /* There are two many template parameter lists. */
1421 cp_error ("too many template parameter lists in declaration of `%T'", type
);
1425 /* Returns 1 iff PARMS1 and PARMS2 are identical sets of template
1426 parameters. These are represented in the same format used for
1427 DECL_TEMPLATE_PARMS. */
1429 int comp_template_parms (parms1
, parms2
)
1436 if (parms1
== parms2
)
1439 for (p1
= parms1
, p2
= parms2
;
1440 p1
!= NULL_TREE
&& p2
!= NULL_TREE
;
1441 p1
= TREE_CHAIN (p1
), p2
= TREE_CHAIN (p2
))
1443 tree t1
= TREE_VALUE (p1
);
1444 tree t2
= TREE_VALUE (p2
);
1447 my_friendly_assert (TREE_CODE (t1
) == TREE_VEC
, 0);
1448 my_friendly_assert (TREE_CODE (t2
) == TREE_VEC
, 0);
1450 if (TREE_VEC_LENGTH (t1
) != TREE_VEC_LENGTH (t2
))
1453 for (i
= 0; i
< TREE_VEC_LENGTH (t2
); ++i
)
1455 tree parm1
= TREE_VALUE (TREE_VEC_ELT (t1
, i
));
1456 tree parm2
= TREE_VALUE (TREE_VEC_ELT (t2
, i
));
1458 if (TREE_CODE (parm1
) != TREE_CODE (parm2
))
1461 if (TREE_CODE (parm1
) == TEMPLATE_TYPE_PARM
)
1463 else if (!same_type_p (TREE_TYPE (parm1
), TREE_TYPE (parm2
)))
1468 if ((p1
!= NULL_TREE
) != (p2
!= NULL_TREE
))
1469 /* One set of parameters has more parameters lists than the
1476 /* Complain if DECL shadows a template parameter.
1478 [temp.local]: A template-parameter shall not be redeclared within its
1479 scope (including nested scopes). */
1482 check_template_shadow (decl
)
1485 tree olddecl
= IDENTIFIER_VALUE (DECL_NAME (decl
));
1487 if (current_template_parms
&& olddecl
)
1489 /* We check for decl != olddecl to avoid bogus errors for using a
1490 name inside a class. We check TPFI to avoid duplicate errors for
1491 inline member templates. */
1492 if (decl
!= olddecl
&& DECL_TEMPLATE_PARM_P (olddecl
)
1493 && ! TEMPLATE_PARMS_FOR_INLINE (current_template_parms
))
1495 cp_error_at ("declaration of `%#D'", decl
);
1496 cp_error_at (" shadows template parm `%#D'", olddecl
);
1501 /* Return a new TEMPLATE_PARM_INDEX with the indicated INDEX, LEVEL,
1502 ORIG_LEVEL, DECL, and TYPE. */
1505 build_template_parm_index (index
, level
, orig_level
, decl
, type
)
1512 tree t
= make_node (TEMPLATE_PARM_INDEX
);
1513 TEMPLATE_PARM_IDX (t
) = index
;
1514 TEMPLATE_PARM_LEVEL (t
) = level
;
1515 TEMPLATE_PARM_ORIG_LEVEL (t
) = orig_level
;
1516 TEMPLATE_PARM_DECL (t
) = decl
;
1517 TREE_TYPE (t
) = type
;
1522 /* Return a TEMPLATE_PARM_INDEX, similar to INDEX, but whose
1523 TEMPLATE_PARM_LEVEL has been decreased by LEVELS. If such a
1524 TEMPLATE_PARM_INDEX already exists, it is returned; otherwise, a
1525 new one is created. */
1528 reduce_template_parm_level (index
, type
, levels
)
1533 if (TEMPLATE_PARM_DESCENDANTS (index
) == NULL_TREE
1534 || (TEMPLATE_PARM_LEVEL (TEMPLATE_PARM_DESCENDANTS (index
))
1535 != TEMPLATE_PARM_LEVEL (index
) - levels
))
1538 = build_decl (TREE_CODE (TEMPLATE_PARM_DECL (index
)),
1539 DECL_NAME (TEMPLATE_PARM_DECL (index
)),
1542 = build_template_parm_index (TEMPLATE_PARM_IDX (index
),
1543 TEMPLATE_PARM_LEVEL (index
) - levels
,
1544 TEMPLATE_PARM_ORIG_LEVEL (index
),
1546 TEMPLATE_PARM_DESCENDANTS (index
) = t
;
1548 /* Template template parameters need this. */
1549 DECL_TEMPLATE_PARMS (decl
)
1550 = DECL_TEMPLATE_PARMS (TEMPLATE_PARM_DECL (index
));
1553 return TEMPLATE_PARM_DESCENDANTS (index
);
1556 /* Process information from new template parameter NEXT and append it to the
1557 LIST being built. */
1560 process_template_parm (list
, next
)
1569 my_friendly_assert (TREE_CODE (parm
) == TREE_LIST
, 259);
1570 defval
= TREE_PURPOSE (parm
);
1571 parm
= TREE_VALUE (parm
);
1572 is_type
= TREE_PURPOSE (parm
) == class_type_node
;
1576 tree p
= TREE_VALUE (tree_last (list
));
1578 if (TREE_CODE (p
) == TYPE_DECL
)
1579 idx
= TEMPLATE_TYPE_IDX (TREE_TYPE (p
));
1580 else if (TREE_CODE (p
) == TEMPLATE_DECL
)
1581 idx
= TEMPLATE_TYPE_IDX (TREE_TYPE (DECL_TEMPLATE_RESULT (p
)));
1583 idx
= TEMPLATE_PARM_IDX (DECL_INITIAL (p
));
1591 my_friendly_assert (TREE_CODE (TREE_PURPOSE (parm
)) == TREE_LIST
, 260);
1592 /* is a const-param */
1593 parm
= grokdeclarator (TREE_VALUE (parm
), TREE_PURPOSE (parm
),
1594 PARM
, 0, NULL_TREE
);
1598 The top-level cv-qualifiers on the template-parameter are
1599 ignored when determining its type. */
1600 TREE_TYPE (parm
) = TYPE_MAIN_VARIANT (TREE_TYPE (parm
));
1602 /* A template parameter is not modifiable. */
1603 TREE_READONLY (parm
) = 1;
1604 if (IS_AGGR_TYPE (TREE_TYPE (parm
))
1605 && TREE_CODE (TREE_TYPE (parm
)) != TEMPLATE_TYPE_PARM
1606 && TREE_CODE (TREE_TYPE (parm
)) != TYPENAME_TYPE
)
1608 cp_error ("`%#T' is not a valid type for a template constant parameter",
1610 if (DECL_NAME (parm
) == NULL_TREE
)
1611 error (" a template type parameter must begin with `class' or `typename'");
1612 TREE_TYPE (parm
) = void_type_node
;
1615 && (TREE_CODE (TREE_TYPE (parm
)) == REAL_TYPE
1616 || TREE_CODE (TREE_TYPE (parm
)) == COMPLEX_TYPE
))
1617 cp_pedwarn ("`%T' is not a valid type for a template constant parameter",
1619 if (TREE_PERMANENT (parm
) == 0)
1621 parm
= copy_node (parm
);
1622 TREE_PERMANENT (parm
) = 1;
1624 decl
= build_decl (CONST_DECL
, DECL_NAME (parm
), TREE_TYPE (parm
));
1625 DECL_INITIAL (parm
) = DECL_INITIAL (decl
)
1626 = build_template_parm_index (idx
, processing_template_decl
,
1627 processing_template_decl
,
1628 decl
, TREE_TYPE (parm
));
1633 parm
= TREE_VALUE (parm
);
1635 if (parm
&& TREE_CODE (parm
) == TEMPLATE_DECL
)
1637 t
= make_lang_type (TEMPLATE_TEMPLATE_PARM
);
1638 /* This is for distinguishing between real templates and template
1639 template parameters */
1640 TREE_TYPE (parm
) = t
;
1641 TREE_TYPE (DECL_TEMPLATE_RESULT (parm
)) = t
;
1646 t
= make_lang_type (TEMPLATE_TYPE_PARM
);
1647 /* parm is either IDENTIFIER_NODE or NULL_TREE */
1648 decl
= build_decl (TYPE_DECL
, parm
, t
);
1651 TYPE_NAME (t
) = decl
;
1652 TYPE_STUB_DECL (t
) = decl
;
1654 TEMPLATE_TYPE_PARM_INDEX (t
)
1655 = build_template_parm_index (idx
, processing_template_decl
,
1656 processing_template_decl
,
1657 decl
, TREE_TYPE (parm
));
1659 SET_DECL_ARTIFICIAL (decl
);
1660 DECL_TEMPLATE_PARM_P (decl
) = 1;
1662 parm
= build_tree_list (defval
, parm
);
1663 return chainon (list
, parm
);
1666 /* The end of a template parameter list has been reached. Process the
1667 tree list into a parameter vector, converting each parameter into a more
1668 useful form. Type parameters are saved as IDENTIFIER_NODEs, and others
1672 end_template_parm_list (parms
)
1677 tree saved_parmlist
= make_tree_vec (list_length (parms
));
1679 current_template_parms
1680 = tree_cons (build_int_2 (0, processing_template_decl
),
1681 saved_parmlist
, current_template_parms
);
1683 for (parm
= parms
, nparms
= 0; parm
; parm
= TREE_CHAIN (parm
), nparms
++)
1684 TREE_VEC_ELT (saved_parmlist
, nparms
) = parm
;
1686 --processing_template_parmlist
;
1688 return saved_parmlist
;
1691 /* end_template_decl is called after a template declaration is seen. */
1694 end_template_decl ()
1696 reset_specialization ();
1698 if (! processing_template_decl
)
1701 /* This matches the pushlevel in begin_template_parm_list. */
1704 --processing_template_decl
;
1705 current_template_parms
= TREE_CHAIN (current_template_parms
);
1706 (void) get_pending_sizes (); /* Why? */
1709 /* Given a template argument vector containing the template PARMS.
1710 The innermost PARMS are given first. */
1713 current_template_args ()
1716 tree args
= NULL_TREE
;
1717 int length
= TMPL_PARMS_DEPTH (current_template_parms
);
1720 /* If there is only one level of template parameters, we do not
1721 create a TREE_VEC of TREE_VECs. Instead, we return a single
1722 TREE_VEC containing the arguments. */
1724 args
= make_tree_vec (length
);
1726 for (header
= current_template_parms
; header
; header
= TREE_CHAIN (header
))
1728 tree a
= copy_node (TREE_VALUE (header
));
1731 TREE_TYPE (a
) = NULL_TREE
;
1732 for (i
= TREE_VEC_LENGTH (a
) - 1; i
>= 0; --i
)
1734 tree t
= TREE_VEC_ELT (a
, i
);
1736 /* T will be a list if we are called from within a
1737 begin/end_template_parm_list pair, but a vector directly
1738 if within a begin/end_member_template_processing pair. */
1739 if (TREE_CODE (t
) == TREE_LIST
)
1743 if (TREE_CODE (t
) == TYPE_DECL
1744 || TREE_CODE (t
) == TEMPLATE_DECL
)
1747 t
= DECL_INITIAL (t
);
1748 TREE_VEC_ELT (a
, i
) = t
;
1753 TREE_VEC_ELT (args
, --l
) = a
;
1761 /* Return a TEMPLATE_DECL corresponding to DECL, using the indicated
1762 template PARMS. Used by push_template_decl below. */
1765 build_template_decl (decl
, parms
)
1769 tree tmpl
= build_lang_decl (TEMPLATE_DECL
, DECL_NAME (decl
), NULL_TREE
);
1770 DECL_TEMPLATE_PARMS (tmpl
) = parms
;
1771 DECL_CONTEXT (tmpl
) = DECL_CONTEXT (decl
);
1772 if (DECL_LANG_SPECIFIC (decl
))
1774 DECL_CLASS_CONTEXT (tmpl
) = DECL_CLASS_CONTEXT (decl
);
1775 DECL_STATIC_FUNCTION_P (tmpl
) =
1776 DECL_STATIC_FUNCTION_P (decl
);
1782 struct template_parm_data
1784 /* The level of the template parameters we are currently
1788 /* The index of the specialization argument we are currently
1792 /* An array whose size is the number of template parameters. The
1793 elements are non-zero if the parameter has been used in any one
1794 of the arguments processed so far. */
1797 /* An array whose size is the number of template arguments. The
1798 elements are non-zero if the argument makes use of template
1799 parameters of this level. */
1800 int* arg_uses_template_parms
;
1803 /* Subroutine of push_template_decl used to see if each template
1804 parameter in a partial specialization is used in the explicit
1805 argument list. If T is of the LEVEL given in DATA (which is
1806 treated as a template_parm_data*), then DATA->PARMS is marked
1810 mark_template_parm (t
, data
)
1816 struct template_parm_data
* tpd
= (struct template_parm_data
*) data
;
1818 if (TREE_CODE (t
) == TEMPLATE_PARM_INDEX
)
1820 level
= TEMPLATE_PARM_LEVEL (t
);
1821 idx
= TEMPLATE_PARM_IDX (t
);
1825 level
= TEMPLATE_TYPE_LEVEL (t
);
1826 idx
= TEMPLATE_TYPE_IDX (t
);
1829 if (level
== tpd
->level
)
1831 tpd
->parms
[idx
] = 1;
1832 tpd
->arg_uses_template_parms
[tpd
->current_arg
] = 1;
1835 /* Return zero so that for_each_template_parm will continue the
1836 traversal of the tree; we want to mark *every* template parm. */
1840 /* Process the partial specialization DECL. */
1843 process_partial_specialization (decl
)
1846 tree type
= TREE_TYPE (decl
);
1847 tree maintmpl
= CLASSTYPE_TI_TEMPLATE (type
);
1848 tree specargs
= CLASSTYPE_TI_ARGS (type
);
1849 tree inner_args
= innermost_args (specargs
);
1850 tree inner_parms
= INNERMOST_TEMPLATE_PARMS (current_template_parms
);
1851 tree main_inner_parms
= DECL_INNERMOST_TEMPLATE_PARMS (maintmpl
);
1852 int nargs
= TREE_VEC_LENGTH (inner_args
);
1853 int ntparms
= TREE_VEC_LENGTH (inner_parms
);
1855 int did_error_intro
= 0;
1856 struct template_parm_data tpd
;
1857 struct template_parm_data tpd2
;
1859 /* We check that each of the template parameters given in the
1860 partial specialization is used in the argument list to the
1861 specialization. For example:
1863 template <class T> struct S;
1864 template <class T> struct S<T*>;
1866 The second declaration is OK because `T*' uses the template
1867 parameter T, whereas
1869 template <class T> struct S<int>;
1871 is no good. Even trickier is:
1882 The S2<T> declaration is actually illegal; it is a
1883 full-specialization. Of course,
1886 struct S2<T (*)(U)>;
1888 or some such would have been OK. */
1889 tpd
.level
= TMPL_PARMS_DEPTH (current_template_parms
);
1890 tpd
.parms
= alloca (sizeof (int) * ntparms
);
1891 bzero ((PTR
) tpd
.parms
, sizeof (int) * ntparms
);
1893 tpd
.arg_uses_template_parms
= alloca (sizeof (int) * nargs
);
1894 bzero ((PTR
) tpd
.arg_uses_template_parms
, sizeof (int) * nargs
);
1895 for (i
= 0; i
< nargs
; ++i
)
1897 tpd
.current_arg
= i
;
1898 for_each_template_parm (TREE_VEC_ELT (inner_args
, i
),
1899 &mark_template_parm
,
1902 for (i
= 0; i
< ntparms
; ++i
)
1903 if (tpd
.parms
[i
] == 0)
1905 /* One of the template parms was not used in the
1907 if (!did_error_intro
)
1909 cp_error ("template parameters not used in partial specialization:");
1910 did_error_intro
= 1;
1914 TREE_VALUE (TREE_VEC_ELT (inner_parms
, i
)));
1917 /* [temp.class.spec]
1919 The argument list of the specialization shall not be identical to
1920 the implicit argument list of the primary template. */
1921 if (comp_template_args (inner_args
,
1922 innermost_args (CLASSTYPE_TI_ARGS (TREE_TYPE
1924 cp_error ("partial specialization `%T' does not specialize any template arguments", type
);
1926 /* [temp.class.spec]
1928 A partially specialized non-type argument expression shall not
1929 involve template parameters of the partial specialization except
1930 when the argument expression is a simple identifier.
1932 The type of a template parameter corresponding to a specialized
1933 non-type argument shall not be dependent on a parameter of the
1935 my_friendly_assert (nargs
== DECL_NTPARMS (maintmpl
), 0);
1937 for (i
= 0; i
< nargs
; ++i
)
1939 tree arg
= TREE_VEC_ELT (inner_args
, i
);
1940 if (/* These first two lines are the `non-type' bit. */
1941 TREE_CODE_CLASS (TREE_CODE (arg
)) != 't'
1942 && TREE_CODE (arg
) != TEMPLATE_DECL
1943 /* This next line is the `argument expression is not just a
1944 simple identifier' condition and also the `specialized
1945 non-type argument' bit. */
1946 && TREE_CODE (arg
) != TEMPLATE_PARM_INDEX
)
1948 if (tpd
.arg_uses_template_parms
[i
])
1949 cp_error ("template argument `%E' involves template parameter(s)", arg
);
1952 /* Look at the corresponding template parameter,
1953 marking which template parameters its type depends
1956 TREE_TYPE (TREE_VALUE (TREE_VEC_ELT (main_inner_parms
,
1961 /* We haven't yet initialized TPD2. Do so now. */
1962 tpd2
.arg_uses_template_parms
1963 = (int*) alloca (sizeof (int) * nargs
);
1964 /* The number of parameters here is the number in the
1965 main template, which, as checked in the assertion
1967 tpd2
.parms
= (int*) alloca (sizeof (int) * nargs
);
1969 TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (maintmpl
));
1972 /* Mark the template parameters. But this time, we're
1973 looking for the template parameters of the main
1974 template, not in the specialization. */
1975 tpd2
.current_arg
= i
;
1976 tpd2
.arg_uses_template_parms
[i
] = 0;
1977 bzero ((PTR
) tpd2
.parms
, sizeof (int) * nargs
);
1978 for_each_template_parm (type
,
1979 &mark_template_parm
,
1982 if (tpd2
.arg_uses_template_parms
[i
])
1984 /* The type depended on some template parameters.
1985 If they are fully specialized in the
1986 specialization, that's OK. */
1988 for (j
= 0; j
< nargs
; ++j
)
1989 if (tpd2
.parms
[j
] != 0
1990 && tpd
.arg_uses_template_parms
[j
])
1992 cp_error ("type `%T' of template argument `%E' depends on template parameter(s)",
2002 if (retrieve_specialization (maintmpl
, specargs
))
2003 /* We've already got this specialization. */
2006 DECL_TEMPLATE_SPECIALIZATIONS (maintmpl
) = CLASSTYPE_TI_SPEC_INFO (type
)
2007 = perm_tree_cons (inner_args
, inner_parms
,
2008 DECL_TEMPLATE_SPECIALIZATIONS (maintmpl
));
2009 TREE_TYPE (DECL_TEMPLATE_SPECIALIZATIONS (maintmpl
)) = type
;
2013 /* Check that a template declaration's use of default arguments is not
2014 invalid. Here, PARMS are the template parameters. IS_PRIMARY is
2015 non-zero if DECL is the thing declared by a primary template.
2016 IS_PARTIAL is non-zero if DECL is a partial specialization. */
2019 check_default_tmpl_args (decl
, parms
, is_primary
, is_partial
)
2026 int last_level_to_check
;
2030 A default template-argument shall not be specified in a
2031 function template declaration or a function template definition, nor
2032 in the template-parameter-list of the definition of a member of a
2035 if (current_class_type
2036 && !TYPE_BEING_DEFINED (current_class_type
)
2037 && DECL_REAL_CONTEXT (decl
) == current_class_type
2038 && DECL_DEFINED_IN_CLASS_P (decl
))
2039 /* We already checked these parameters when the template was
2040 declared, so there's no need to do it again now. This is an
2041 inline member function definition. */
2044 if (TREE_CODE (decl
) != TYPE_DECL
|| is_partial
|| !is_primary
)
2045 /* For an ordinary class template, default template arguments are
2046 allowed at the innermost level, e.g.:
2047 template <class T = int>
2049 but, in a partial specialization, they're not allowed even
2050 there, as we have in [temp.class.spec]:
2052 The template parameter list of a specialization shall not
2053 contain default template argument values.
2055 So, for a partial specialization, or for a function template,
2056 we look at all of them. */
2059 /* But, for a primary class template that is not a partial
2060 specialization we look at all template parameters except the
2062 parms
= TREE_CHAIN (parms
);
2064 /* Figure out what error message to issue. */
2065 if (TREE_CODE (decl
) == FUNCTION_DECL
)
2066 msg
= "default argument for template parameter in function template `%D'";
2067 else if (is_partial
)
2068 msg
= "default argument in partial specialization `%D'";
2070 msg
= "default argument for template parameter for class enclosing `%D'";
2072 if (current_class_type
&& TYPE_BEING_DEFINED (current_class_type
))
2073 /* If we're inside a class definition, there's no need to
2074 examine the parameters to the class itself. On the one
2075 hand, they will be checked when the class is defined, and,
2076 on the other, default arguments are legal in things like:
2077 template <class T = double>
2078 struct S { template <class U> void f(U); };
2079 Here the default argument for `S' has no bearing on the
2080 declaration of `f'. */
2081 last_level_to_check
= template_class_depth (current_class_type
) + 1;
2083 /* Check everything. */
2084 last_level_to_check
= 0;
2086 for (; parms
&& TMPL_PARMS_DEPTH (parms
) >= last_level_to_check
;
2087 parms
= TREE_CHAIN (parms
))
2089 tree inner_parms
= TREE_VALUE (parms
);
2092 ntparms
= TREE_VEC_LENGTH (inner_parms
);
2093 for (i
= 0; i
< ntparms
; ++i
)
2094 if (TREE_PURPOSE (TREE_VEC_ELT (inner_parms
, i
)))
2098 cp_error (msg
, decl
);
2102 /* Clear out the default argument so that we are not
2104 TREE_PURPOSE (TREE_VEC_ELT (inner_parms
, i
)) = NULL_TREE
;
2107 /* At this point, if we're still interested in issuing messages,
2108 they must apply to classes surrounding the object declared. */
2110 msg
= "default argument for template parameter for class enclosing `%D'";
2114 /* Creates a TEMPLATE_DECL for the indicated DECL using the template
2115 parameters given by current_template_args, or reuses a
2116 previously existing one, if appropriate. Returns the DECL, or an
2117 equivalent one, if it is replaced via a call to duplicate_decls.
2119 If IS_FRIEND is non-zero, DECL is a friend declaration. */
2122 push_template_decl_real (decl
, is_friend
)
2133 /* See if this is a partial specialization. */
2134 is_partial
= (TREE_CODE (decl
) == TYPE_DECL
&& DECL_ARTIFICIAL (decl
)
2135 && TREE_CODE (TREE_TYPE (decl
)) != ENUMERAL_TYPE
2136 && CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_TYPE (decl
)));
2138 is_friend
|= (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_FRIEND_P (decl
));
2141 /* For a friend, we want the context of the friend function, not
2142 the type of which it is a friend. */
2143 ctx
= DECL_CONTEXT (decl
);
2144 else if (DECL_REAL_CONTEXT (decl
)
2145 && TREE_CODE (DECL_REAL_CONTEXT (decl
)) != NAMESPACE_DECL
)
2146 /* In the case of a virtual function, we want the class in which
2148 ctx
= DECL_REAL_CONTEXT (decl
);
2150 /* Otherwise, if we're currently definining some class, the DECL
2151 is assumed to be a member of the class. */
2152 ctx
= current_class_type
;
2154 if (ctx
&& TREE_CODE (ctx
) == NAMESPACE_DECL
)
2157 if (!DECL_CONTEXT (decl
))
2158 DECL_CONTEXT (decl
) = FROB_CONTEXT (current_namespace
);
2160 /* For determining whether this is a primary template or not, we're really
2161 interested in the lexical context, not the true context. */
2163 info
= current_class_type
;
2167 /* See if this is a primary template. */
2168 if (info
&& TREE_CODE (info
) == FUNCTION_DECL
)
2170 /* Note that template_class_depth returns 0 if given NULL_TREE, so
2171 this next line works even when we are at global scope. */
2172 else if (processing_template_decl
> template_class_depth (info
))
2179 if (current_lang_name
== lang_name_c
)
2180 cp_error ("template with C linkage");
2181 if (TREE_CODE (decl
) == TYPE_DECL
&& ANON_AGGRNAME_P (DECL_NAME (decl
)))
2182 cp_error ("template class without a name");
2183 if (TREE_CODE (decl
) == TYPE_DECL
2184 && TREE_CODE (TREE_TYPE (decl
)) == ENUMERAL_TYPE
)
2185 cp_error ("template declaration of `%#T'", TREE_TYPE (decl
));
2188 /* Check to see that the rules regarding the use of default
2189 arguments are not being violated. */
2190 check_default_tmpl_args (decl
, current_template_parms
,
2191 primary
, is_partial
);
2194 return process_partial_specialization (decl
);
2196 args
= current_template_args ();
2199 || TREE_CODE (ctx
) == FUNCTION_DECL
2200 || TYPE_BEING_DEFINED (ctx
)
2201 || (is_friend
&& !DECL_TEMPLATE_INFO (decl
)))
2203 if (DECL_LANG_SPECIFIC (decl
)
2204 && DECL_TEMPLATE_INFO (decl
)
2205 && DECL_TI_TEMPLATE (decl
))
2206 tmpl
= DECL_TI_TEMPLATE (decl
);
2209 tmpl
= build_template_decl (decl
, current_template_parms
);
2211 if (DECL_LANG_SPECIFIC (decl
)
2212 && DECL_TEMPLATE_SPECIALIZATION (decl
))
2214 /* A specialization of a member template of a template
2216 SET_DECL_TEMPLATE_SPECIALIZATION (tmpl
);
2217 DECL_TEMPLATE_INFO (tmpl
) = DECL_TEMPLATE_INFO (decl
);
2218 DECL_TEMPLATE_INFO (decl
) = NULL_TREE
;
2224 tree a
, t
, current
, parms
;
2227 if (CLASSTYPE_TEMPLATE_INSTANTIATION (ctx
))
2228 cp_error ("must specialize `%#T' before defining member `%#D'",
2230 if (TREE_CODE (decl
) == TYPE_DECL
)
2232 if ((IS_AGGR_TYPE_CODE (TREE_CODE (TREE_TYPE (decl
)))
2233 || TREE_CODE (TREE_TYPE (decl
)) == ENUMERAL_TYPE
)
2234 && TYPE_TEMPLATE_INFO (TREE_TYPE (decl
))
2235 && TYPE_TI_TEMPLATE (TREE_TYPE (decl
)))
2236 tmpl
= TYPE_TI_TEMPLATE (TREE_TYPE (decl
));
2239 cp_error ("`%D' does not declare a template type", decl
);
2243 else if (! DECL_TEMPLATE_INFO (decl
))
2245 cp_error ("template definition of non-template `%#D'", decl
);
2249 tmpl
= DECL_TI_TEMPLATE (decl
);
2251 if (is_member_template (tmpl
)
2252 && DECL_FUNCTION_TEMPLATE_P (tmpl
)
2253 && DECL_TEMPLATE_INFO (decl
) && DECL_TI_ARGS (decl
)
2254 && DECL_TEMPLATE_SPECIALIZATION (decl
))
2258 /* The declaration is a specialization of a member
2259 template, declared outside the class. Therefore, the
2260 innermost template arguments will be NULL, so we
2261 replace them with the arguments determined by the
2262 earlier call to check_explicit_specialization. */
2263 args
= DECL_TI_ARGS (decl
);
2266 = build_template_decl (decl
, current_template_parms
);
2267 DECL_TEMPLATE_RESULT (new_tmpl
) = decl
;
2268 TREE_TYPE (new_tmpl
) = TREE_TYPE (decl
);
2269 DECL_TI_TEMPLATE (decl
) = new_tmpl
;
2270 SET_DECL_TEMPLATE_SPECIALIZATION (new_tmpl
);
2271 DECL_TEMPLATE_INFO (new_tmpl
) =
2272 perm_tree_cons (tmpl
, args
, NULL_TREE
);
2274 register_specialization (new_tmpl
, tmpl
, args
);
2278 /* Make sure the template headers we got make sense. */
2280 parms
= DECL_TEMPLATE_PARMS (tmpl
);
2281 i
= TMPL_PARMS_DEPTH (parms
);
2282 if (TMPL_ARGS_DEPTH (args
) != i
)
2284 cp_error ("expected %d levels of template parms for `%#D', got %d",
2285 i
, decl
, TMPL_ARGS_DEPTH (args
));
2288 for (current
= decl
; i
> 0; --i
, parms
= TREE_CHAIN (parms
))
2290 a
= TMPL_ARGS_LEVEL (args
, i
);
2291 t
= INNERMOST_TEMPLATE_PARMS (parms
);
2293 if (TREE_VEC_LENGTH (t
) != TREE_VEC_LENGTH (a
))
2295 if (current
== decl
)
2296 cp_error ("got %d template parameters for `%#D'",
2297 TREE_VEC_LENGTH (a
), decl
);
2299 cp_error ("got %d template parameters for `%#T'",
2300 TREE_VEC_LENGTH (a
), current
);
2301 cp_error (" but %d required", TREE_VEC_LENGTH (t
));
2304 /* Perhaps we should also check that the parms are used in the
2305 appropriate qualifying scopes in the declarator? */
2307 if (current
== decl
)
2310 current
= TYPE_CONTEXT (current
);
2314 DECL_TEMPLATE_RESULT (tmpl
) = decl
;
2315 TREE_TYPE (tmpl
) = TREE_TYPE (decl
);
2317 /* Push template declarations for global functions and types. Note
2318 that we do not try to push a global template friend declared in a
2319 template class; such a thing may well depend on the template
2320 parameters of the class. */
2322 && !(is_friend
&& template_class_depth (current_class_type
) > 0))
2323 tmpl
= pushdecl_namespace_level (tmpl
);
2326 DECL_PRIMARY_TEMPLATE (tmpl
) = tmpl
;
2328 info
= perm_tree_cons (tmpl
, args
, NULL_TREE
);
2330 if (TREE_CODE (decl
) == TYPE_DECL
&& DECL_ARTIFICIAL (decl
))
2332 SET_TYPE_TEMPLATE_INFO (TREE_TYPE (tmpl
), info
);
2333 if ((!ctx
|| TREE_CODE (ctx
) != FUNCTION_DECL
)
2334 && TREE_CODE (TREE_TYPE (decl
)) != ENUMERAL_TYPE
)
2335 DECL_NAME (decl
) = classtype_mangled_name (TREE_TYPE (decl
));
2337 else if (! DECL_LANG_SPECIFIC (decl
))
2338 cp_error ("template declaration of `%#D'", decl
);
2340 DECL_TEMPLATE_INFO (decl
) = info
;
2342 return DECL_TEMPLATE_RESULT (tmpl
);
2346 push_template_decl (decl
)
2349 return push_template_decl_real (decl
, 0);
2352 /* Called when a class template TYPE is redeclared with the indicated
2353 template PARMS, e.g.:
2355 template <class T> struct S;
2356 template <class T> struct S {}; */
2359 redeclare_class_template (type
, parms
)
2363 tree tmpl
= CLASSTYPE_TI_TEMPLATE (type
);
2367 if (!PRIMARY_TEMPLATE_P (tmpl
))
2368 /* The type is nested in some template class. Nothing to worry
2369 about here; there are no new template parameters for the nested
2373 parms
= INNERMOST_TEMPLATE_PARMS (parms
);
2374 tmpl_parms
= DECL_INNERMOST_TEMPLATE_PARMS (tmpl
);
2376 if (TREE_VEC_LENGTH (parms
) != TREE_VEC_LENGTH (tmpl_parms
))
2378 cp_error_at ("previous declaration `%D'", tmpl
);
2379 cp_error ("used %d template parameter%s instead of %d",
2380 TREE_VEC_LENGTH (tmpl_parms
),
2381 TREE_VEC_LENGTH (tmpl_parms
) == 1 ? "" : "s",
2382 TREE_VEC_LENGTH (parms
));
2386 for (i
= 0; i
< TREE_VEC_LENGTH (tmpl_parms
); ++i
)
2388 tree tmpl_parm
= TREE_VALUE (TREE_VEC_ELT (tmpl_parms
, i
));
2389 tree parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
2390 tree tmpl_default
= TREE_PURPOSE (TREE_VEC_ELT (tmpl_parms
, i
));
2391 tree parm_default
= TREE_PURPOSE (TREE_VEC_ELT (parms
, i
));
2393 if (TREE_CODE (tmpl_parm
) != TREE_CODE (parm
))
2395 cp_error_at ("template parameter `%#D'", tmpl_parm
);
2396 cp_error ("redeclared here as `%#D'", parm
);
2400 if (tmpl_default
!= NULL_TREE
&& parm_default
!= NULL_TREE
)
2402 /* We have in [temp.param]:
2404 A template-parameter may not be given default arguments
2405 by two different declarations in the same scope. */
2406 cp_error ("redefinition of default argument for `%#D'", parm
);
2407 cp_error_at (" original definition appeared here", tmpl_parm
);
2411 if (parm_default
!= NULL_TREE
)
2412 /* Update the previous template parameters (which are the ones
2413 that will really count) with the new default value. */
2414 TREE_PURPOSE (TREE_VEC_ELT (tmpl_parms
, i
)) = parm_default
;
2418 /* Attempt to convert the non-type template parameter EXPR to the
2419 indicated TYPE. If the conversion is successful, return the
2420 converted value. If the conversion is unsuccesful, return
2421 NULL_TREE if we issued an error message, or error_mark_node if we
2422 did not. We issue error messages for out-and-out bad template
2423 parameters, but not simply because the conversion failed, since we
2424 might be just trying to do argument deduction. By the time this
2425 function is called, neither TYPE nor EXPR may make use of template
2429 convert_nontype_argument (type
, expr
)
2433 tree expr_type
= TREE_TYPE (expr
);
2435 /* A template-argument for a non-type, non-template
2436 template-parameter shall be one of:
2438 --an integral constant-expression of integral or enumeration
2441 --the name of a non-type template-parameter; or
2443 --the name of an object or function with external linkage,
2444 including function templates and function template-ids but
2445 excluding non-static class members, expressed as id-expression;
2448 --the address of an object or function with external linkage,
2449 including function templates and function template-ids but
2450 excluding non-static class members, expressed as & id-expression
2451 where the & is optional if the name refers to a function or
2454 --a pointer to member expressed as described in _expr.unary.op_. */
2456 /* An integral constant-expression can include const variables
2458 if (INTEGRAL_TYPE_P (expr_type
) && TREE_READONLY_DECL_P (expr
))
2459 expr
= decl_constant_value (expr
);
2461 if (is_overloaded_fn (expr
))
2462 /* OK for now. We'll check that it has external linkage later.
2463 Check this first since if expr_type is the unknown_type_node
2464 we would otherwise complain below. */
2466 else if (TYPE_PTR_P (expr_type
)
2467 || TREE_CODE (expr_type
) == ARRAY_TYPE
2468 || TREE_CODE (type
) == REFERENCE_TYPE
2469 /* If expr is the address of an overloaded function, we
2470 will get the unknown_type_node at this point. */
2471 || expr_type
== unknown_type_node
)
2477 if (TREE_CODE (type
) == REFERENCE_TYPE
2478 || TREE_CODE (expr_type
) == ARRAY_TYPE
)
2482 if (TREE_CODE (e
) != ADDR_EXPR
)
2485 cp_error ("`%E' is not a valid template argument", expr
);
2486 error ("it must be %s%s with external linkage",
2487 TREE_CODE (TREE_TYPE (expr
)) == POINTER_TYPE
2488 ? "a pointer to " : "",
2489 TREE_CODE (TREE_TYPE (TREE_TYPE (expr
))) == FUNCTION_TYPE
2490 ? "a function" : "an object");
2494 referent
= TREE_OPERAND (e
, 0);
2495 STRIP_NOPS (referent
);
2498 if (TREE_CODE (referent
) == STRING_CST
)
2500 cp_error ("string literal %E is not a valid template argument",
2502 error ("because it is the address of an object with static linkage");
2506 if (is_overloaded_fn (referent
))
2507 /* We'll check that it has external linkage later. */
2509 else if (TREE_CODE (referent
) != VAR_DECL
)
2511 else if (!TREE_PUBLIC (referent
))
2513 cp_error ("address of non-extern `%E' cannot be used as template argument", referent
);
2514 return error_mark_node
;
2517 else if (INTEGRAL_TYPE_P (expr_type
)
2518 || TYPE_PTRMEM_P (expr_type
)
2519 || TYPE_PTRMEMFUNC_P (expr_type
)
2520 /* The next two are g++ extensions. */
2521 || TREE_CODE (expr_type
) == REAL_TYPE
2522 || TREE_CODE (expr_type
) == COMPLEX_TYPE
)
2524 if (! TREE_CONSTANT (expr
))
2527 cp_error ("non-constant `%E' cannot be used as template argument",
2534 cp_error ("object `%E' cannot be used as template argument", expr
);
2538 switch (TREE_CODE (type
))
2543 /* For a non-type template-parameter of integral or enumeration
2544 type, integral promotions (_conv.prom_) and integral
2545 conversions (_conv.integral_) are applied. */
2546 if (!INTEGRAL_TYPE_P (expr_type
))
2547 return error_mark_node
;
2549 /* It's safe to call digest_init in this case; we know we're
2550 just converting one integral constant expression to another. */
2551 expr
= digest_init (type
, expr
, (tree
*) 0);
2553 if (TREE_CODE (expr
) != INTEGER_CST
)
2554 /* Curiously, some TREE_CONSTANT integral expressions do not
2555 simplify to integer constants. For example, `3 % 0',
2556 remains a TRUNC_MOD_EXPR. */
2563 /* These are g++ extensions. */
2564 if (TREE_CODE (expr_type
) != TREE_CODE (type
))
2565 return error_mark_node
;
2567 expr
= digest_init (type
, expr
, (tree
*) 0);
2569 if (TREE_CODE (expr
) != REAL_CST
)
2576 tree type_pointed_to
= TREE_TYPE (type
);
2578 if (TYPE_PTRMEM_P (type
))
2579 /* For a non-type template-parameter of type pointer to data
2580 member, qualification conversions (_conv.qual_) are
2582 return perform_qualification_conversions (type
, expr
);
2583 else if (TREE_CODE (type_pointed_to
) == FUNCTION_TYPE
)
2585 /* For a non-type template-parameter of type pointer to
2586 function, only the function-to-pointer conversion
2587 (_conv.func_) is applied. If the template-argument
2588 represents a set of overloaded functions (or a pointer to
2589 such), the matching function is selected from the set
2594 if (TREE_CODE (expr
) == ADDR_EXPR
)
2595 fns
= TREE_OPERAND (expr
, 0);
2599 fn
= instantiate_type (type_pointed_to
, fns
, 0);
2601 if (fn
== error_mark_node
)
2602 return error_mark_node
;
2604 if (!TREE_PUBLIC (fn
))
2606 if (really_overloaded_fn (fns
))
2607 return error_mark_node
;
2612 expr
= build_unary_op (ADDR_EXPR
, fn
, 0);
2614 my_friendly_assert (same_type_p (type
, TREE_TYPE (expr
)),
2620 /* For a non-type template-parameter of type pointer to
2621 object, qualification conversions (_conv.qual_) and the
2622 array-to-pointer conversion (_conv.array_) are applied.
2623 [Note: In particular, neither the null pointer conversion
2624 (_conv.ptr_) nor the derived-to-base conversion
2625 (_conv.ptr_) are applied. Although 0 is a valid
2626 template-argument for a non-type template-parameter of
2627 integral type, it is not a valid template-argument for a
2628 non-type template-parameter of pointer type.]
2630 The call to decay_conversion performs the
2631 array-to-pointer conversion, if appropriate. */
2632 expr
= decay_conversion (expr
);
2634 if (expr
== error_mark_node
)
2635 return error_mark_node
;
2637 return perform_qualification_conversions (type
, expr
);
2642 case REFERENCE_TYPE
:
2644 tree type_referred_to
= TREE_TYPE (type
);
2646 if (TREE_CODE (type_referred_to
) == FUNCTION_TYPE
)
2648 /* For a non-type template-parameter of type reference to
2649 function, no conversions apply. If the
2650 template-argument represents a set of overloaded
2651 functions, the matching function is selected from the
2652 set (_over.over_). */
2656 fn
= instantiate_type (type_referred_to
, fns
, 0);
2658 if (fn
== error_mark_node
)
2659 return error_mark_node
;
2661 if (!TREE_PUBLIC (fn
))
2663 if (really_overloaded_fn (fns
))
2664 /* Don't issue an error here; we might get a different
2665 function if the overloading had worked out
2667 return error_mark_node
;
2672 my_friendly_assert (same_type_p (type_referred_to
,
2680 /* For a non-type template-parameter of type reference to
2681 object, no conversions apply. The type referred to by the
2682 reference may be more cv-qualified than the (otherwise
2683 identical) type of the template-argument. The
2684 template-parameter is bound directly to the
2685 template-argument, which must be an lvalue. */
2686 if ((TYPE_MAIN_VARIANT (expr_type
)
2687 != TYPE_MAIN_VARIANT (type_referred_to
))
2688 || !at_least_as_qualified_p (type_referred_to
,
2690 || !real_lvalue_p (expr
))
2691 return error_mark_node
;
2700 if (!TYPE_PTRMEMFUNC_P (type
))
2701 /* This handles templates like
2702 template<class T, T t> void f();
2703 when T is substituted with any class. The second template
2704 parameter becomes invalid and the template candidate is
2706 return error_mark_node
;
2708 /* For a non-type template-parameter of type pointer to member
2709 function, no conversions apply. If the template-argument
2710 represents a set of overloaded member functions, the
2711 matching member function is selected from the set
2714 if (!TYPE_PTRMEMFUNC_P (expr_type
) &&
2715 expr_type
!= unknown_type_node
)
2716 return error_mark_node
;
2718 if (TREE_CODE (expr
) == CONSTRUCTOR
)
2720 /* A ptr-to-member constant. */
2721 if (!same_type_p (type
, expr_type
))
2722 return error_mark_node
;
2727 if (TREE_CODE (expr
) != ADDR_EXPR
)
2728 return error_mark_node
;
2730 expr
= instantiate_type (type
, expr
, 0);
2732 if (expr
== error_mark_node
)
2733 return error_mark_node
;
2735 my_friendly_assert (same_type_p (type
, TREE_TYPE (expr
)),
2742 /* All non-type parameters must have one of these types. */
2743 my_friendly_abort (0);
2747 return error_mark_node
;
2750 /* Return 1 if PARM_PARMS and ARG_PARMS matches using rule for
2751 template template parameters. Both PARM_PARMS and ARG_PARMS are
2752 vectors of TREE_LIST nodes containing TYPE_DECL, TEMPLATE_DECL
2755 ARG_PARMS may contain more parameters than PARM_PARMS. If this is
2756 the case, then extra parameters must have default arguments.
2758 Consider the example:
2759 template <class T, class Allocator = allocator> class vector;
2760 template<template <class U> class TT> class C;
2762 C<vector> is a valid instantiation. PARM_PARMS for the above code
2763 contains a TYPE_DECL (for U), ARG_PARMS contains two TYPE_DECLs (for
2764 T and Allocator) and OUTER_ARGS contains the argument that is used to
2765 substitute the TT parameter. */
2768 coerce_template_template_parms (parm_parms
, arg_parms
, in_decl
, outer_args
)
2769 tree parm_parms
, arg_parms
, in_decl
, outer_args
;
2771 int nparms
, nargs
, i
;
2774 my_friendly_assert (TREE_CODE (parm_parms
) == TREE_VEC
, 0);
2775 my_friendly_assert (TREE_CODE (arg_parms
) == TREE_VEC
, 0);
2777 nparms
= TREE_VEC_LENGTH (parm_parms
);
2778 nargs
= TREE_VEC_LENGTH (arg_parms
);
2780 /* The rule here is opposite of coerce_template_parms. */
2783 && TREE_PURPOSE (TREE_VEC_ELT (arg_parms
, nparms
)) == NULL_TREE
))
2786 for (i
= 0; i
< nparms
; ++i
)
2788 parm
= TREE_VALUE (TREE_VEC_ELT (parm_parms
, i
));
2789 arg
= TREE_VALUE (TREE_VEC_ELT (arg_parms
, i
));
2791 if (arg
== NULL_TREE
|| arg
== error_mark_node
2792 || parm
== NULL_TREE
|| parm
== error_mark_node
)
2795 if (TREE_CODE (arg
) != TREE_CODE (parm
))
2798 switch (TREE_CODE (parm
))
2804 /* We encounter instantiations of templates like
2805 template <template <template <class> class> class TT>
2807 sorry ("nested template template parameter");
2811 /* The tsubst call is used to handle cases such as
2812 template <class T, template <T> class TT> class D;
2813 i.e. the parameter list of TT depends on earlier parameters. */
2814 if (!same_type_p (tsubst (TREE_TYPE (parm
), outer_args
, in_decl
),
2820 my_friendly_abort (0);
2826 /* Convert the indicated template ARG as necessary to match the
2827 indicated template PARM. Returns the converted ARG, or
2828 error_mark_node if the conversion was unsuccessful. Error messages
2829 are issued if COMPLAIN is non-zero. This conversion is for the Ith
2830 parameter in the parameter list. ARGS is the full set of template
2831 arguments deduced so far. */
2834 convert_template_argument (parm
, arg
, args
, complain
, i
, in_decl
)
2844 int is_type
, requires_type
, is_tmpl_type
, requires_tmpl_type
;
2846 inner_args
= innermost_args (args
);
2848 if (TREE_CODE (arg
) == TREE_LIST
2849 && TREE_TYPE (arg
) != NULL_TREE
2850 && TREE_CODE (TREE_TYPE (arg
)) == OFFSET_TYPE
)
2852 /* The template argument was the name of some
2853 member function. That's usually
2854 illegal, but static members are OK. In any
2855 case, grab the underlying fields/functions
2856 and issue an error later if required. */
2857 arg
= TREE_VALUE (arg
);
2858 TREE_TYPE (arg
) = unknown_type_node
;
2861 requires_tmpl_type
= TREE_CODE (parm
) == TEMPLATE_DECL
;
2862 requires_type
= (TREE_CODE (parm
) == TYPE_DECL
2863 || requires_tmpl_type
);
2865 /* Check if it is a class template. If REQUIRES_TMPL_TYPE is true,
2866 we also accept implicitly created TYPE_DECL as a valid argument.
2867 This is necessary to handle the case where we pass a template name
2868 to a template template parameter in a scope where we've derived from
2869 in instantiation of that template, so the template name refers to that
2870 instantiation. We really ought to handle this better. */
2872 = ((TREE_CODE (arg
) == TEMPLATE_DECL
2873 && TREE_CODE (DECL_TEMPLATE_RESULT (arg
)) == TYPE_DECL
)
2874 || (TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
2875 && !TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (arg
))
2876 || (TREE_CODE (arg
) == RECORD_TYPE
2877 && CLASSTYPE_TEMPLATE_INFO (arg
)
2878 && TREE_CODE (TYPE_NAME (arg
)) == TYPE_DECL
2879 && DECL_ARTIFICIAL (TYPE_NAME (arg
))
2880 && requires_tmpl_type
2881 && is_base_of_enclosing_class (arg
, current_class_type
)));
2882 if (is_tmpl_type
&& TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
)
2883 arg
= TYPE_STUB_DECL (arg
);
2884 else if (is_tmpl_type
&& TREE_CODE (arg
) == RECORD_TYPE
)
2885 arg
= CLASSTYPE_TI_TEMPLATE (arg
);
2887 is_type
= TREE_CODE_CLASS (TREE_CODE (arg
)) == 't' || is_tmpl_type
;
2889 if (requires_type
&& ! is_type
&& TREE_CODE (arg
) == SCOPE_REF
2890 && TREE_CODE (TREE_OPERAND (arg
, 0)) == TEMPLATE_TYPE_PARM
)
2892 cp_pedwarn ("to refer to a type member of a template parameter,");
2893 cp_pedwarn (" use `typename %E'", arg
);
2895 arg
= make_typename_type (TREE_OPERAND (arg
, 0),
2896 TREE_OPERAND (arg
, 1));
2899 if (is_type
!= requires_type
)
2905 cp_error ("type/value mismatch at argument %d in template parameter list for `%D'",
2908 cp_error (" expected a constant of type `%T', got `%T'",
2910 (is_tmpl_type
? DECL_NAME (arg
) : arg
));
2912 cp_error (" expected a type, got `%E'", arg
);
2915 return error_mark_node
;
2917 if (is_tmpl_type
^ requires_tmpl_type
)
2919 if (in_decl
&& complain
)
2921 cp_error ("type/value mismatch at argument %d in template parameter list for `%D'",
2924 cp_error (" expected a type, got `%T'", DECL_NAME (arg
));
2926 cp_error (" expected a class template, got `%T'", arg
);
2928 return error_mark_node
;
2933 if (requires_tmpl_type
)
2935 tree parmparm
= DECL_INNERMOST_TEMPLATE_PARMS (parm
);
2936 tree argparm
= DECL_INNERMOST_TEMPLATE_PARMS (arg
);
2938 if (coerce_template_template_parms (parmparm
, argparm
,
2939 in_decl
, inner_args
))
2943 /* TEMPLATE_TEMPLATE_PARM node is preferred over
2945 if (val
!= error_mark_node
2946 && DECL_TEMPLATE_TEMPLATE_PARM_P (val
))
2947 val
= TREE_TYPE (val
);
2951 if (in_decl
&& complain
)
2953 cp_error ("type/value mismatch at argument %d in template parameter list for `%D'",
2955 cp_error (" expected a template of type `%D', got `%D'", parm
, arg
);
2958 val
= error_mark_node
;
2963 val
= groktypename (arg
);
2964 if (! processing_template_decl
)
2966 /* [basic.link]: A name with no linkage (notably, the
2967 name of a class or enumeration declared in a local
2968 scope) shall not be used to declare an entity with
2969 linkage. This implies that names with no linkage
2970 cannot be used as template arguments. */
2971 tree t
= no_linkage_check (val
);
2974 if (ANON_AGGRNAME_P (TYPE_IDENTIFIER (t
)))
2976 ("template-argument `%T' uses anonymous type", val
);
2979 ("template-argument `%T' uses local type `%T'",
2981 return error_mark_node
;
2988 tree t
= tsubst (TREE_TYPE (parm
), args
, in_decl
);
2990 if (processing_template_decl
)
2991 arg
= maybe_fold_nontype_arg (arg
);
2993 if (!uses_template_parms (arg
) && !uses_template_parms (t
))
2994 /* We used to call digest_init here. However, digest_init
2995 will report errors, which we don't want when complain
2996 is zero. More importantly, digest_init will try too
2997 hard to convert things: for example, `0' should not be
2998 converted to pointer type at this point according to
2999 the standard. Accepting this is not merely an
3000 extension, since deciding whether or not these
3001 conversions can occur is part of determining which
3002 function template to call, or whether a given epxlicit
3003 argument specification is legal. */
3004 val
= convert_nontype_argument (t
, arg
);
3008 if (val
== NULL_TREE
)
3009 val
= error_mark_node
;
3010 else if (val
== error_mark_node
&& complain
)
3011 cp_error ("could not convert template argument `%E' to `%T'",
3018 /* Convert all template arguments to their appropriate types, and
3019 return a vector containing the innermost resulting template
3020 arguments. If any error occurs, return error_mark_node, and, if
3021 COMPLAIN is non-zero, issue an error message. Some error messages
3022 are issued even if COMPLAIN is zero; for instance, if a template
3023 argument is composed from a local class.
3025 If REQUIRE_ALL_ARGUMENTS is non-zero, all arguments must be
3026 provided in ARGLIST, or else trailing parameters must have default
3027 values. If REQUIRE_ALL_ARGUMENTS is zero, we will attempt argument
3028 deduction for any unspecified trailing arguments.
3030 The resulting TREE_VEC is allocated on a temporary obstack, and
3031 must be explicitly copied if it will be permanent. */
3034 coerce_template_parms (parms
, args
, in_decl
,
3036 require_all_arguments
)
3040 int require_all_arguments
;
3042 int nparms
, nargs
, i
, lost
= 0;
3045 tree new_inner_args
;
3047 inner_args
= innermost_args (args
);
3048 nargs
= NUM_TMPL_ARGS (inner_args
);
3049 nparms
= TREE_VEC_LENGTH (parms
);
3053 && require_all_arguments
3054 && TREE_PURPOSE (TREE_VEC_ELT (parms
, nargs
)) == NULL_TREE
))
3058 cp_error ("wrong number of template arguments (%d, should be %d)",
3062 cp_error_at ("provided for `%D'", in_decl
);
3065 return error_mark_node
;
3068 new_inner_args
= make_temp_vec (nparms
);
3069 new_args
= add_outermost_template_args (args
, new_inner_args
);
3070 for (i
= 0; i
< nparms
; i
++)
3075 /* Get the Ith template parameter. */
3076 parm
= TREE_VEC_ELT (parms
, i
);
3078 /* Calculate the Ith argument. */
3079 if (inner_args
&& TREE_CODE (inner_args
) == TREE_LIST
)
3081 arg
= TREE_VALUE (inner_args
);
3082 inner_args
= TREE_CHAIN (inner_args
);
3085 arg
= TREE_VEC_ELT (inner_args
, i
);
3086 /* If no template argument was supplied, look for a default
3088 else if (TREE_PURPOSE (parm
) == NULL_TREE
)
3090 /* There was no default value. */
3091 my_friendly_assert (!require_all_arguments
, 0);
3094 else if (TREE_CODE (TREE_VALUE (parm
)) == TYPE_DECL
)
3095 arg
= tsubst (TREE_PURPOSE (parm
), new_args
, in_decl
);
3097 arg
= tsubst_expr (TREE_PURPOSE (parm
), new_args
, in_decl
);
3099 /* Now, convert the Ith argument, as necessary. */
3100 if (arg
== NULL_TREE
)
3101 /* We're out of arguments. */
3103 my_friendly_assert (!require_all_arguments
, 0);
3106 else if (arg
== error_mark_node
)
3108 cp_error ("template argument %d is invalid", i
+ 1);
3109 arg
= error_mark_node
;
3112 arg
= convert_template_argument (TREE_VALUE (parm
),
3113 arg
, new_args
, complain
, i
,
3116 if (arg
== error_mark_node
)
3118 TREE_VEC_ELT (new_inner_args
, i
) = arg
;
3122 return error_mark_node
;
3124 return new_inner_args
;
3127 /* Returns 1 if template args OT and NT are equivalent. */
3130 template_args_equal (ot
, nt
)
3135 if (TREE_CODE (nt
) != TREE_CODE (ot
))
3137 if (TREE_CODE (nt
) == TREE_VEC
)
3138 /* For member templates */
3139 return comp_template_args (ot
, nt
);
3140 else if (TREE_CODE_CLASS (TREE_CODE (ot
)) == 't')
3141 return same_type_p (ot
, nt
);
3143 return (cp_tree_equal (ot
, nt
) > 0);
3146 /* Returns 1 iff the OLDARGS and NEWARGS are in fact identical sets
3147 of template arguments. Returns 0 otherwise. */
3150 comp_template_args (oldargs
, newargs
)
3151 tree oldargs
, newargs
;
3155 if (TREE_VEC_LENGTH (oldargs
) != TREE_VEC_LENGTH (newargs
))
3158 for (i
= 0; i
< TREE_VEC_LENGTH (oldargs
); ++i
)
3160 tree nt
= TREE_VEC_ELT (newargs
, i
);
3161 tree ot
= TREE_VEC_ELT (oldargs
, i
);
3163 if (! template_args_equal (ot
, nt
))
3169 /* Given class template name and parameter list, produce a user-friendly name
3170 for the instantiation. */
3173 mangle_class_name_for_template (name
, parms
, arglist
)
3175 tree parms
, arglist
;
3177 static struct obstack scratch_obstack
;
3178 static char *scratch_firstobj
;
3181 if (!scratch_firstobj
)
3182 gcc_obstack_init (&scratch_obstack
);
3184 obstack_free (&scratch_obstack
, scratch_firstobj
);
3185 scratch_firstobj
= obstack_alloc (&scratch_obstack
, 1);
3187 #define ccat(c) obstack_1grow (&scratch_obstack, (c));
3188 #define cat(s) obstack_grow (&scratch_obstack, (s), strlen (s))
3192 nparms
= TREE_VEC_LENGTH (parms
);
3193 arglist
= innermost_args (arglist
);
3194 my_friendly_assert (nparms
== TREE_VEC_LENGTH (arglist
), 268);
3195 for (i
= 0; i
< nparms
; i
++)
3197 tree parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
3198 tree arg
= TREE_VEC_ELT (arglist
, i
);
3203 if (TREE_CODE (parm
) == TYPE_DECL
)
3205 cat (type_as_string_real (arg
, 0, 1));
3208 else if (TREE_CODE (parm
) == TEMPLATE_DECL
)
3210 if (TREE_CODE (arg
) == TEMPLATE_DECL
)
3212 /* Already substituted with real template. Just output
3213 the template name here */
3214 tree context
= DECL_CONTEXT (arg
);
3217 my_friendly_assert (TREE_CODE (context
) == NAMESPACE_DECL
, 980422);
3218 cat(decl_as_string (DECL_CONTEXT (arg
), 0));
3221 cat (IDENTIFIER_POINTER (DECL_NAME (arg
)));
3224 /* Output the parameter declaration */
3225 cat (type_as_string_real (arg
, 0, 1));
3229 my_friendly_assert (TREE_CODE (parm
) == PARM_DECL
, 269);
3231 if (TREE_CODE (arg
) == TREE_LIST
)
3233 /* New list cell was built because old chain link was in
3235 my_friendly_assert (TREE_PURPOSE (arg
) == NULL_TREE
, 270);
3236 arg
= TREE_VALUE (arg
);
3238 /* No need to check arglist against parmlist here; we did that
3239 in coerce_template_parms, called from lookup_template_class. */
3240 cat (expr_as_string (arg
, 0));
3243 char *bufp
= obstack_next_free (&scratch_obstack
);
3245 while (bufp
[offset
- 1] == ' ')
3247 obstack_blank_fast (&scratch_obstack
, offset
);
3249 /* B<C<char> >, not B<C<char>> */
3250 if (bufp
[offset
- 1] == '>')
3255 return (char *) obstack_base (&scratch_obstack
);
3259 classtype_mangled_name (t
)
3262 if (CLASSTYPE_TEMPLATE_INFO (t
)
3263 /* Specializations have already had their names set up in
3264 lookup_template_class. */
3265 && !CLASSTYPE_TEMPLATE_SPECIALIZATION (t
))
3267 tree tmpl
= most_general_template (CLASSTYPE_TI_TEMPLATE (t
));
3269 /* For non-primary templates, the template parameters are
3270 implicit from their surrounding context. */
3271 if (PRIMARY_TEMPLATE_P (tmpl
))
3273 tree name
= DECL_NAME (tmpl
);
3274 char *mangled_name
= mangle_class_name_for_template
3275 (IDENTIFIER_POINTER (name
),
3276 DECL_INNERMOST_TEMPLATE_PARMS (tmpl
),
3277 CLASSTYPE_TI_ARGS (t
));
3278 tree id
= get_identifier (mangled_name
);
3279 IDENTIFIER_TEMPLATE (id
) = name
;
3284 return TYPE_IDENTIFIER (t
);
3288 add_pending_template (d
)
3293 if (TREE_CODE_CLASS (TREE_CODE (d
)) == 't')
3294 ti
= CLASSTYPE_TEMPLATE_INFO (d
);
3296 ti
= DECL_TEMPLATE_INFO (d
);
3298 if (TI_PENDING_TEMPLATE_FLAG (ti
))
3301 *template_tail
= perm_tree_cons
3302 (build_srcloc_here (), d
, NULL_TREE
);
3303 template_tail
= &TREE_CHAIN (*template_tail
);
3304 TI_PENDING_TEMPLATE_FLAG (ti
) = 1;
3308 /* Return a TEMPLATE_ID_EXPR corresponding to the indicated FNS (which
3309 may be either a _DECL or an overloaded function or an
3310 IDENTIFIER_NODE), and ARGLIST. */
3313 lookup_template_function (fns
, arglist
)
3318 if (fns
== NULL_TREE
)
3320 cp_error ("non-template used as template");
3321 return error_mark_node
;
3324 type
= TREE_TYPE (fns
);
3325 if (TREE_CODE (fns
) == OVERLOAD
|| !type
)
3326 type
= unknown_type_node
;
3328 if (processing_template_decl
)
3329 return build_min (TEMPLATE_ID_EXPR
, type
, fns
, arglist
);
3331 return build (TEMPLATE_ID_EXPR
, type
, fns
, arglist
);
3334 /* Within the scope of a template class S<T>, the name S gets bound
3335 (in build_self_reference) to a TYPE_DECL for the class, not a
3336 TEMPLATE_DECL. If DECL is a TYPE_DECL for current_class_type,
3337 or one of its enclosing classes, and that type is a template,
3338 return the associated TEMPLATE_DECL. Otherwise, the original
3339 DECL is returned. */
3342 maybe_get_template_decl_from_type_decl (decl
)
3345 return (decl
!= NULL_TREE
3346 && TREE_CODE (decl
) == TYPE_DECL
3347 && DECL_ARTIFICIAL (decl
)
3348 && CLASSTYPE_TEMPLATE_INFO (TREE_TYPE (decl
)))
3349 ? CLASSTYPE_TI_TEMPLATE (TREE_TYPE (decl
)) : decl
;
3352 /* Given an IDENTIFIER_NODE (type TEMPLATE_DECL) and a chain of
3353 parameters, find the desired type.
3355 D1 is the PTYPENAME terminal, and ARGLIST is the list of arguments.
3356 (Actually ARGLIST may be either a TREE_LIST or a TREE_VEC. It will
3357 be a TREE_LIST if called directly from the parser, and a TREE_VEC
3358 otherwise.) Since ARGLIST is build on the decl_obstack, we must
3359 copy it here to keep it from being reclaimed when the decl storage
3362 IN_DECL, if non-NULL, is the template declaration we are trying to
3365 If ENTERING_SCOPE is non-zero, we are about to enter the scope of
3366 the class we are looking up.
3368 If the template class is really a local class in a template
3369 function, then the FUNCTION_CONTEXT is the function in which it is
3370 being instantiated. */
3373 lookup_template_class (d1
, arglist
, in_decl
, context
, entering_scope
)
3379 tree
template = NULL_TREE
, parmlist
;
3382 if (TREE_CODE (d1
) == IDENTIFIER_NODE
)
3384 if (IDENTIFIER_VALUE (d1
)
3385 && DECL_TEMPLATE_TEMPLATE_PARM_P (IDENTIFIER_VALUE (d1
)))
3386 template = IDENTIFIER_VALUE (d1
);
3390 push_decl_namespace (context
);
3391 if (current_class_type
!= NULL_TREE
)
3393 maybe_get_template_decl_from_type_decl
3394 (IDENTIFIER_CLASS_VALUE (d1
));
3395 if (template == NULL_TREE
)
3396 template = lookup_name_nonclass (d1
);
3398 pop_decl_namespace ();
3401 context
= DECL_CONTEXT (template);
3403 else if (TREE_CODE (d1
) == TYPE_DECL
&& IS_AGGR_TYPE (TREE_TYPE (d1
)))
3405 if (CLASSTYPE_TEMPLATE_INFO (TREE_TYPE (d1
)))
3407 template = CLASSTYPE_TI_TEMPLATE (TREE_TYPE (d1
));
3408 d1
= DECL_NAME (template);
3411 else if (TREE_CODE (d1
) == ENUMERAL_TYPE
3412 || (TREE_CODE_CLASS (TREE_CODE (d1
)) == 't'
3413 && IS_AGGR_TYPE (d1
)))
3415 template = TYPE_TI_TEMPLATE (d1
);
3416 d1
= DECL_NAME (template);
3418 else if (TREE_CODE (d1
) == TEMPLATE_DECL
3419 && TREE_CODE (DECL_RESULT (d1
)) == TYPE_DECL
)
3422 d1
= DECL_NAME (template);
3423 context
= DECL_CONTEXT (template);
3426 my_friendly_abort (272);
3428 /* With something like `template <class T> class X class X { ... };'
3429 we could end up with D1 having nothing but an IDENTIFIER_VALUE.
3430 We don't want to do that, but we have to deal with the situation,
3431 so let's give them some syntax errors to chew on instead of a
3435 cp_error ("`%T' is not a template", d1
);
3436 return error_mark_node
;
3439 if (context
== NULL_TREE
)
3440 context
= global_namespace
;
3442 if (TREE_CODE (template) != TEMPLATE_DECL
)
3444 cp_error ("non-template type `%T' used as a template", d1
);
3446 cp_error_at ("for template declaration `%D'", in_decl
);
3447 return error_mark_node
;
3450 if (DECL_TEMPLATE_TEMPLATE_PARM_P (template))
3452 /* Create a new TEMPLATE_DECL and TEMPLATE_TEMPLATE_PARM node to store
3453 template arguments */
3455 tree parm
= copy_template_template_parm (TREE_TYPE (template));
3456 tree template2
= TYPE_STUB_DECL (parm
);
3459 parmlist
= DECL_INNERMOST_TEMPLATE_PARMS (template);
3461 arglist2
= coerce_template_parms (parmlist
, arglist
, template, 1, 1);
3462 if (arglist2
== error_mark_node
)
3463 return error_mark_node
;
3465 arglist2
= copy_to_permanent (arglist2
);
3466 TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (parm
)
3467 = perm_tree_cons (template2
, arglist2
, NULL_TREE
);
3468 TYPE_SIZE (parm
) = 0;
3473 tree template_type
= TREE_TYPE (template);
3475 tree found
= NULL_TREE
;
3478 int is_partial_instantiation
;
3480 template = most_general_template (template);
3481 parmlist
= DECL_TEMPLATE_PARMS (template);
3482 parm_depth
= TMPL_PARMS_DEPTH (parmlist
);
3483 arg_depth
= TMPL_ARGS_DEPTH (arglist
);
3485 /* We build up the coerced arguments and such on the
3486 momentary_obstack. */
3489 if (arg_depth
== 1 && parm_depth
> 1)
3491 /* We've been given an incomplete set of template arguments.
3494 template <class T> struct S1 {
3495 template <class U> struct S2 {};
3496 template <class U> struct S2<U*> {};
3499 we will be called with an ARGLIST of `U*', but the
3500 TEMPLATE will be `template <class T> template
3501 <class U> struct S1<T>::S2'. We must fill in the missing
3503 my_friendly_assert (context
!= NULL_TREE
, 0);
3504 while (!IS_AGGR_TYPE_CODE (TREE_CODE (context
))
3505 && context
!= global_namespace
)
3506 context
= DECL_REAL_CONTEXT (context
);
3508 if (context
== global_namespace
)
3509 /* This is bad. We cannot get enough arguments, even from
3510 the surrounding context, to resolve this class. One
3511 case where this might happen is (illegal) code like:
3519 We should catch this error sooner (at the opening curly
3520 for `S', but it is better to be safe than sorry here. */
3522 cp_error ("invalid use of `%D'", template);
3523 return error_mark_node
;
3526 arglist
= add_to_template_args (TYPE_TI_ARGS (context
),
3528 arg_depth
= TMPL_ARGS_DEPTH (arglist
);
3531 my_friendly_assert (parm_depth
== arg_depth
, 0);
3533 /* Calculate the BOUND_ARGS. These will be the args that are
3534 actually tsubst'd into the definition to create the
3538 /* We have multiple levels of arguments to coerce, at once. */
3540 int saved_depth
= TMPL_ARGS_DEPTH (arglist
);
3542 tree bound_args
= make_temp_vec (parm_depth
);
3544 for (i
= saved_depth
,
3545 t
= DECL_TEMPLATE_PARMS (template);
3546 i
> 0 && t
!= NULL_TREE
;
3547 --i
, t
= TREE_CHAIN (t
))
3549 tree a
= coerce_template_parms (TREE_VALUE (t
),
3550 arglist
, template, 1, 1);
3551 SET_TMPL_ARGS_LEVEL (bound_args
, i
, a
);
3553 /* We temporarily reduce the length of the ARGLIST so
3554 that coerce_template_parms will see only the arguments
3555 corresponding to the template parameters it is
3557 TREE_VEC_LENGTH (arglist
)--;
3560 /* Restore the ARGLIST to its full size. */
3561 TREE_VEC_LENGTH (arglist
) = saved_depth
;
3563 arglist
= bound_args
;
3567 = coerce_template_parms (INNERMOST_TEMPLATE_PARMS (parmlist
),
3568 innermost_args (arglist
),
3571 if (arglist
== error_mark_node
)
3572 /* We were unable to bind the arguments. */
3573 return error_mark_node
;
3575 /* In the scope of a template class, explicit references to the
3576 template class refer to the type of the template, not any
3577 instantiation of it. For example, in:
3579 template <class T> class C { void f(C<T>); }
3581 the `C<T>' is just the same as `C'. Outside of the
3582 class, however, such a reference is an instantiation. */
3583 if (comp_template_args (TYPE_TI_ARGS (template_type
),
3586 found
= template_type
;
3588 if (!entering_scope
&& PRIMARY_TEMPLATE_P (template))
3592 /* Note that we use DECL_CONTEXT, rather than
3593 CP_DECL_CONTEXT, so that the termination test is
3594 always just `ctx'. We're not interested in namepace
3596 for (ctx
= current_class_type
;
3598 ctx
= (TREE_CODE_CLASS (TREE_CODE (ctx
)) == 't')
3599 ? TYPE_CONTEXT (ctx
) : DECL_CONTEXT (ctx
))
3600 if (same_type_p (ctx
, template_type
))
3604 /* We're not in the scope of the class, so the
3605 TEMPLATE_TYPE is not the type we want after
3613 for (found
= DECL_TEMPLATE_INSTANTIATIONS (template);
3614 found
; found
= TREE_CHAIN (found
))
3615 if (comp_template_args (TREE_PURPOSE (found
), arglist
))
3619 found
= TREE_VALUE (found
);
3628 /* Since we didn't find the type, we'll have to create it.
3629 Since we'll be saving this type on the
3630 DECL_TEMPLATE_INSTANTIATIONS list, it must be permanent. */
3631 push_obstacks (&permanent_obstack
, &permanent_obstack
);
3633 /* This type is a "partial instantiation" if any of the template
3634 arguments still inolve template parameters. Note that we set
3635 IS_PARTIAL_INSTANTIATION for partial specializations as
3637 is_partial_instantiation
= uses_template_parms (arglist
);
3639 /* Create the type. */
3640 if (TREE_CODE (template_type
) == ENUMERAL_TYPE
)
3642 if (!is_partial_instantiation
)
3643 t
= start_enum (TYPE_IDENTIFIER (template_type
));
3645 /* We don't want to call start_enum for this type, since
3646 the values for the enumeration constants may involve
3647 template parameters. And, no one should be interested
3648 in the enumeration constants for such a type. */
3649 t
= make_node (ENUMERAL_TYPE
);
3653 t
= make_lang_type (TREE_CODE (template_type
));
3654 CLASSTYPE_DECLARED_CLASS (t
)
3655 = CLASSTYPE_DECLARED_CLASS (template_type
);
3656 CLASSTYPE_GOT_SEMICOLON (t
) = 1;
3657 SET_CLASSTYPE_IMPLICIT_INSTANTIATION (t
);
3658 TYPE_FOR_JAVA (t
) = TYPE_FOR_JAVA (template_type
);
3661 /* If we called start_enum above, this information will already
3665 TYPE_CONTEXT (t
) = FROB_CONTEXT (context
);
3667 /* Create a stub TYPE_DECL for it. */
3668 type_decl
= build_decl (TYPE_DECL
, DECL_NAME (template), t
);
3669 SET_DECL_ARTIFICIAL (type_decl
);
3670 DECL_CONTEXT (type_decl
) = TYPE_CONTEXT (t
);
3671 DECL_SOURCE_FILE (type_decl
)
3672 = DECL_SOURCE_FILE (TYPE_STUB_DECL (template_type
));
3673 DECL_SOURCE_LINE (type_decl
)
3674 = DECL_SOURCE_LINE (TYPE_STUB_DECL (template_type
));
3675 TYPE_STUB_DECL (t
) = TYPE_NAME (t
) = type_decl
;
3678 type_decl
= TYPE_NAME (t
);
3680 /* Set up the template information. We have to figure out which
3681 template is the immediate parent if this is a full
3683 if (parm_depth
== 1 || is_partial_instantiation
3684 || !PRIMARY_TEMPLATE_P (template))
3685 /* This case is easy; there are no member templates involved. */
3689 /* This is a full instantiation of a member template. There
3690 should be some partial instantiation of which this is an
3693 for (found
= DECL_TEMPLATE_INSTANTIATIONS (template);
3694 found
; found
= TREE_CHAIN (found
))
3697 tree tmpl
= CLASSTYPE_TI_TEMPLATE (TREE_VALUE (found
));
3699 /* We only want partial instantiations, here, not
3700 specializations or full instantiations. */
3701 if (CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_VALUE (found
))
3702 || !uses_template_parms (TREE_VALUE (found
)))
3705 /* Temporarily reduce by one the number of levels in the
3706 ARGLIST and in FOUND so as to avoid comparing the
3707 last set of arguments. */
3708 TREE_VEC_LENGTH (arglist
)--;
3709 TREE_VEC_LENGTH (TREE_PURPOSE (found
)) --;
3711 /* See if the arguments match. If they do, then TMPL is
3712 the partial instantiation we want. */
3713 success
= comp_template_args (TREE_PURPOSE (found
), arglist
);
3715 /* Restore the argument vectors to their full size. */
3716 TREE_VEC_LENGTH (arglist
)++;
3717 TREE_VEC_LENGTH (TREE_PURPOSE (found
))++;
3727 my_friendly_abort (0);
3730 arglist
= copy_to_permanent (arglist
);
3731 SET_TYPE_TEMPLATE_INFO (t
,
3732 tree_cons (found
, arglist
, NULL_TREE
));
3733 DECL_TEMPLATE_INSTANTIATIONS (template)
3734 = tree_cons (arglist
, t
,
3735 DECL_TEMPLATE_INSTANTIATIONS (template));
3737 if (TREE_CODE (t
) == ENUMERAL_TYPE
3738 && !is_partial_instantiation
)
3739 /* Now that the type has been registered on the instantiations
3740 list, we set up the enumerators. Because the enumeration
3741 constants may involve the enumeration type itself, we make
3742 sure to register the type first, and then create the
3743 constants. That way, doing tsubst_expr for the enumeration
3744 constants won't result in recursive calls here; we'll find
3745 the instantiation and exit above. */
3746 tsubst_enum (template_type
, t
, arglist
);
3748 /* We're done with the permanent obstack, now. */
3750 /* We're also done with the momentary allocation we started
3754 /* Reset the name of the type, now that CLASSTYPE_TEMPLATE_INFO
3756 if (TREE_CODE (t
) != ENUMERAL_TYPE
)
3757 DECL_NAME (type_decl
) = classtype_mangled_name (t
);
3758 DECL_ASSEMBLER_NAME (type_decl
) = DECL_NAME (type_decl
);
3759 if (!is_partial_instantiation
)
3761 DECL_ASSEMBLER_NAME (type_decl
)
3762 = get_identifier (build_overload_name (t
, 1, 1));
3764 /* For backwards compatibility; code that uses
3765 -fexternal-templates expects looking up a template to
3766 instantiate it. I think DDD still relies on this.
3767 (jason 8/20/1998) */
3768 if (TREE_CODE (t
) != ENUMERAL_TYPE
3769 && flag_external_templates
3770 && CLASSTYPE_INTERFACE_KNOWN (TREE_TYPE (template))
3771 && ! CLASSTYPE_INTERFACE_ONLY (TREE_TYPE (template)))
3772 add_pending_template (t
);
3775 /* If the type makes use of template parameters, the
3776 code that generates debugging information will crash. */
3777 DECL_IGNORED_P (TYPE_STUB_DECL (t
)) = 1;
3783 /* For each TEMPLATE_TYPE_PARM, TEMPLATE_TEMPLATE_PARM, or
3784 TEMPLATE_PARM_INDEX in T, call FN with the parameter and the DATA.
3785 If FN returns non-zero, the iteration is terminated, and
3786 for_each_template_parm returns 1. Otherwise, the iteration
3787 continues. If FN never returns a non-zero value, the value
3788 returned by for_each_template_parm is 0. If FN is NULL, it is
3789 considered to be the function which always returns 1. */
3792 for_each_template_parm (t
, fn
, data
)
3800 if (TREE_CODE_CLASS (TREE_CODE (t
)) == 't'
3801 && for_each_template_parm (TYPE_CONTEXT (t
), fn
, data
))
3804 switch (TREE_CODE (t
))
3808 /* We assume that the object must be instantiated in order to build
3809 the COMPONENT_REF, so we test only whether the type of the
3810 COMPONENT_REF uses template parms. */
3811 return for_each_template_parm (TREE_TYPE (t
), fn
, data
);
3814 return (for_each_template_parm (TREE_OPERAND (t
, 0), fn
, data
)
3815 || for_each_template_parm (TREE_OPERAND (t
, 1), fn
, data
));
3817 case IDENTIFIER_NODE
:
3818 if (!IDENTIFIER_TEMPLATE (t
))
3820 my_friendly_abort (42);
3822 /* aggregates of tree nodes */
3825 int i
= TREE_VEC_LENGTH (t
);
3827 if (for_each_template_parm (TREE_VEC_ELT (t
, i
), fn
, data
))
3832 if (for_each_template_parm (TREE_PURPOSE (t
), fn
, data
)
3833 || for_each_template_parm (TREE_VALUE (t
), fn
, data
))
3835 return for_each_template_parm (TREE_CHAIN (t
), fn
, data
);
3838 if (for_each_template_parm (OVL_FUNCTION (t
), fn
, data
))
3840 return for_each_template_parm (OVL_CHAIN (t
), fn
, data
);
3842 /* constructed type nodes */
3844 case REFERENCE_TYPE
:
3845 return for_each_template_parm (TREE_TYPE (t
), fn
, data
);
3848 if (TYPE_PTRMEMFUNC_FLAG (t
))
3849 return for_each_template_parm (TYPE_PTRMEMFUNC_FN_TYPE (t
),
3855 if (! TYPE_TEMPLATE_INFO (t
))
3857 return for_each_template_parm (TREE_VALUE
3858 (TYPE_TEMPLATE_INFO (t
)),
3861 if (for_each_template_parm (TYPE_METHOD_BASETYPE (t
), fn
, data
))
3866 /* Check the parameter types. Since default arguments are not
3867 instantiated until they are needed, the TYPE_ARG_TYPES may
3868 contain expressions that involve template parameters. But,
3869 no-one should be looking at them yet. And, once they're
3870 instantiated, they don't contain template parameters, so
3871 there's no point in looking at them then, either. */
3875 for (parm
= TYPE_ARG_TYPES (t
); parm
; parm
= TREE_CHAIN (parm
))
3876 if (for_each_template_parm (TREE_VALUE (parm
), fn
, data
))
3880 /* Check the return type, too. */
3881 return for_each_template_parm (TREE_TYPE (t
), fn
, data
);
3884 if (for_each_template_parm (TYPE_DOMAIN (t
), fn
, data
))
3886 return for_each_template_parm (TREE_TYPE (t
), fn
, data
);
3888 if (for_each_template_parm (TYPE_OFFSET_BASETYPE (t
), fn
, data
))
3890 return for_each_template_parm (TREE_TYPE (t
), fn
, data
);
3894 return for_each_template_parm (TREE_TYPE (t
), fn
, data
);
3897 /* A template template parameter is encountered */
3898 if (DECL_TEMPLATE_TEMPLATE_PARM_P (t
))
3899 return for_each_template_parm (TREE_TYPE (t
), fn
, data
);
3900 /* Already substituted template template parameter */
3904 if (for_each_template_parm (DECL_INITIAL (t
), fn
, data
))
3906 goto check_type_and_context
;
3910 /* ??? What about FIELD_DECLs? */
3911 if (DECL_LANG_SPECIFIC (t
) && DECL_TEMPLATE_INFO (t
)
3912 && for_each_template_parm (DECL_TI_ARGS (t
), fn
, data
))
3916 check_type_and_context
:
3917 if (for_each_template_parm (TREE_TYPE (t
), fn
, data
))
3919 if (DECL_CONTEXT (t
)
3920 && for_each_template_parm (DECL_CONTEXT (t
), fn
, data
))
3925 return (for_each_template_parm (TREE_OPERAND (t
, 0), fn
, data
)
3926 || for_each_template_parm (TREE_OPERAND (t
, 1), fn
, data
));
3929 return for_each_template_parm (TREE_OPERAND (t
, 0), fn
, data
);
3931 /* template parm nodes */
3932 case TEMPLATE_TEMPLATE_PARM
:
3933 /* Record template parameters such as `T' inside `TT<T>'. */
3934 if (TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (t
)
3935 && for_each_template_parm (TYPE_TI_ARGS (t
), fn
, data
))
3937 case TEMPLATE_TYPE_PARM
:
3938 case TEMPLATE_PARM_INDEX
:
3940 return (*fn
)(t
, data
);
3944 /* simple type nodes */
3946 if (for_each_template_parm (TYPE_MIN_VALUE (t
), fn
, data
))
3948 return for_each_template_parm (TYPE_MAX_VALUE (t
), fn
, data
);
3954 case NAMESPACE_DECL
:
3964 /* Non-error_mark_node ERROR_MARKs are bad things. */
3965 my_friendly_assert (t
== error_mark_node
, 274);
3974 return for_each_template_parm (TREE_TYPE (t
), fn
, data
);
3977 return for_each_template_parm (TREE_OPERAND (t
, 0), fn
, data
);
3980 if (TREE_TYPE (t
) && TYPE_PTRMEMFUNC_P (TREE_TYPE (t
)))
3981 return for_each_template_parm (TYPE_PTRMEMFUNC_FN_TYPE
3982 (TREE_TYPE (t
)), fn
, data
);
3983 return for_each_template_parm (TREE_OPERAND (t
, 1), fn
, data
);
3987 case REINTERPRET_CAST_EXPR
:
3988 case CONST_CAST_EXPR
:
3989 case STATIC_CAST_EXPR
:
3990 case DYNAMIC_CAST_EXPR
:
3998 return for_each_template_parm (TREE_OPERAND (t
, 0), fn
, data
);
4001 switch (TREE_CODE_CLASS (TREE_CODE (t
)))
4009 for (i
= first_rtl_op (TREE_CODE (t
)); --i
>= 0;)
4010 if (for_each_template_parm (TREE_OPERAND (t
, i
), fn
, data
))
4017 sorry ("testing %s for template parms",
4018 tree_code_name
[(int) TREE_CODE (t
)]);
4019 my_friendly_abort (82);
4026 uses_template_parms (t
)
4029 return for_each_template_parm (t
, 0, 0);
4032 static struct tinst_level
*current_tinst_level
;
4033 static struct tinst_level
*free_tinst_level
;
4034 static int tinst_depth
;
4035 extern int max_tinst_depth
;
4036 #ifdef GATHER_STATISTICS
4039 int tinst_level_tick
;
4040 int last_template_error_tick
;
4042 /* Print out all the template instantiations that we are currently
4043 working on. If ERR, we are being called from cp_thing, so do
4044 the right thing for an error message. */
4047 print_template_context (err
)
4050 struct tinst_level
*p
= current_tinst_level
;
4052 char *file
= input_filename
;
4056 if (current_function_decl
!= p
->decl
4057 && current_function_decl
!= NULL_TREE
)
4058 /* We can get here during the processing of some synthesized
4059 method. Then, p->decl will be the function that's causing
4064 if (current_function_decl
== p
->decl
)
4065 /* Avoid redundancy with the the "In function" line. */;
4067 fprintf (stderr
, "%s: In instantiation of `%s':\n",
4068 file
, decl_as_string (p
->decl
, 0));
4076 for (; p
; p
= p
->next
)
4078 fprintf (stderr
, "%s:%d: instantiated from `%s'\n", file
, line
,
4079 decl_as_string (p
->decl
, 0));
4083 fprintf (stderr
, "%s:%d: instantiated from here\n", file
, line
);
4086 /* Called from cp_thing to print the template context for an error. */
4089 maybe_print_template_context ()
4091 if (last_template_error_tick
== tinst_level_tick
4092 || current_tinst_level
== 0)
4095 last_template_error_tick
= tinst_level_tick
;
4096 print_template_context (1);
4100 push_tinst_level (d
)
4103 struct tinst_level
*new;
4105 if (tinst_depth
>= max_tinst_depth
)
4107 /* If the instantiation in question still has unbound template parms,
4108 we don't really care if we can't instantiate it, so just return.
4109 This happens with base instantiation for implicit `typename'. */
4110 if (uses_template_parms (d
))
4113 last_template_error_tick
= tinst_level_tick
;
4114 error ("template instantiation depth exceeds maximum of %d",
4116 error (" (use -ftemplate-depth-NN to increase the maximum)");
4117 cp_error (" instantiating `%D'", d
);
4119 print_template_context (0);
4124 if (free_tinst_level
)
4126 new = free_tinst_level
;
4127 free_tinst_level
= new->next
;
4130 new = (struct tinst_level
*) xmalloc (sizeof (struct tinst_level
));
4134 new->file
= input_filename
;
4135 new->next
= current_tinst_level
;
4136 current_tinst_level
= new;
4139 #ifdef GATHER_STATISTICS
4140 if (tinst_depth
> depth_reached
)
4141 depth_reached
= tinst_depth
;
4151 struct tinst_level
*old
= current_tinst_level
;
4153 /* Restore the filename and line number stashed away when we started
4154 this instantiation. */
4156 input_filename
= old
->file
;
4157 extract_interface_info ();
4159 current_tinst_level
= old
->next
;
4160 old
->next
= free_tinst_level
;
4161 free_tinst_level
= old
;
4166 struct tinst_level
*
4169 struct tinst_level
*p
= current_tinst_level
;
4172 for (; p
->next
; p
= p
->next
)
4177 /* DECL is a friend FUNCTION_DECL or TEMPLATE_DECL. ARGS is the
4178 vector of template arguments, as for tsubst.
4180 Returns an appropriate tsbust'd friend declaration. */
4183 tsubst_friend_function (decl
, args
)
4189 char *file
= input_filename
;
4191 lineno
= DECL_SOURCE_LINE (decl
);
4192 input_filename
= DECL_SOURCE_FILE (decl
);
4194 if (TREE_CODE (decl
) == FUNCTION_DECL
4195 && DECL_TEMPLATE_INSTANTIATION (decl
)
4196 && TREE_CODE (DECL_TI_TEMPLATE (decl
)) != TEMPLATE_DECL
)
4197 /* This was a friend declared with an explicit template
4198 argument list, e.g.:
4202 to indicate that f was a template instantiation, not a new
4203 function declaration. Now, we have to figure out what
4204 instantiation of what template. */
4211 = lookup_template_function (tsubst_expr (DECL_TI_TEMPLATE (decl
),
4213 tsubst (DECL_TI_ARGS (decl
),
4215 /* FIXME: The decl we create via the next tsubst could be
4216 created on a temporary obstack. */
4217 new_friend
= tsubst (decl
, args
, NULL_TREE
);
4218 tmpl
= determine_specialization (template_id
, new_friend
,
4220 /*need_member_template=*/0,
4222 new_friend
= instantiate_template (tmpl
, new_args
);
4226 new_friend
= tsubst (decl
, args
, NULL_TREE
);
4228 /* The NEW_FRIEND will look like an instantiation, to the
4229 compiler, but is not an instantiation from the point of view of
4230 the language. For example, we might have had:
4232 template <class T> struct S {
4233 template <class U> friend void f(T, U);
4236 Then, in S<int>, template <class U> void f(int, U) is not an
4237 instantiation of anything. */
4238 DECL_USE_TEMPLATE (new_friend
) = 0;
4239 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
4240 DECL_USE_TEMPLATE (DECL_TEMPLATE_RESULT (new_friend
)) = 0;
4242 /* The mangled name for the NEW_FRIEND is incorrect. The call to
4243 tsubst will have resulted in a call to
4244 set_mangled_name_for_template_decl. But, the function is not a
4245 template instantiation and should not be mangled like one.
4246 Therefore, we remangle the function name. We don't have to do
4247 this if the NEW_FRIEND is a template since
4248 set_mangled_name_for_template_decl doesn't do anything if the
4249 function declaration still uses template arguments. */
4250 if (TREE_CODE (new_friend
) != TEMPLATE_DECL
)
4252 set_mangled_name_for_decl (new_friend
);
4253 DECL_RTL (new_friend
) = 0;
4254 make_decl_rtl (new_friend
, NULL_PTR
, 1);
4257 if (DECL_NAMESPACE_SCOPE_P (new_friend
))
4260 tree new_friend_template_info
;
4261 tree new_friend_result_template_info
;
4262 int new_friend_is_defn
;
4264 /* We must save some information from NEW_FRIEND before calling
4265 duplicate decls since that function will free NEW_FRIEND if
4267 new_friend_template_info
= DECL_TEMPLATE_INFO (new_friend
);
4268 if (TREE_CODE (new_friend
) == TEMPLATE_DECL
)
4270 /* This declaration is a `primary' template. */
4271 DECL_PRIMARY_TEMPLATE (new_friend
) = new_friend
;
4274 = DECL_INITIAL (DECL_RESULT (new_friend
)) != NULL_TREE
;
4275 new_friend_result_template_info
4276 = DECL_TEMPLATE_INFO (DECL_RESULT (new_friend
));
4280 new_friend_is_defn
= DECL_INITIAL (new_friend
) != NULL_TREE
;
4281 new_friend_result_template_info
= NULL_TREE
;
4284 old_decl
= pushdecl_namespace_level (new_friend
);
4286 if (old_decl
!= new_friend
)
4288 /* This new friend declaration matched an existing
4289 declaration. For example, given:
4291 template <class T> void f(T);
4292 template <class U> class C {
4293 template <class T> friend void f(T) {}
4296 the friend declaration actually provides the definition
4297 of `f', once C has been instantiated for some type. So,
4298 old_decl will be the out-of-class template declaration,
4299 while new_friend is the in-class definition.
4301 But, if `f' was called before this point, the
4302 instantiation of `f' will have DECL_TI_ARGS corresponding
4303 to `T' but not to `U', references to which might appear
4304 in the definition of `f'. Previously, the most general
4305 template for an instantiation of `f' was the out-of-class
4306 version; now it is the in-class version. Therefore, we
4307 run through all specialization of `f', adding to their
4308 DECL_TI_ARGS appropriately. In particular, they need a
4309 new set of outer arguments, corresponding to the
4310 arguments for this class instantiation.
4312 The same situation can arise with something like this:
4315 template <class T> class C {
4319 when `C<int>' is instantiated. Now, `f(int)' is defined
4322 if (!new_friend_is_defn
)
4323 /* On the other hand, if the in-class declaration does
4324 *not* provide a definition, then we don't want to alter
4325 existing definitions. We can just leave everything
4330 /* Overwrite whatever template info was there before, if
4331 any, with the new template information pertaining to
4333 DECL_TEMPLATE_INFO (old_decl
) = new_friend_template_info
;
4335 if (TREE_CODE (old_decl
) != TEMPLATE_DECL
)
4336 /* duplicate_decls will take care of this case. */
4341 tree new_friend_args
;
4343 DECL_TEMPLATE_INFO (DECL_RESULT (old_decl
))
4344 = new_friend_result_template_info
;
4346 new_friend_args
= TI_ARGS (new_friend_template_info
);
4347 for (t
= DECL_TEMPLATE_SPECIALIZATIONS (old_decl
);
4351 tree spec
= TREE_VALUE (t
);
4354 = add_outermost_template_args (new_friend_args
,
4355 DECL_TI_ARGS (spec
));
4357 = copy_to_permanent (DECL_TI_ARGS (spec
));
4360 /* Now, since specializations are always supposed to
4361 hang off of the most general template, we must move
4363 t
= most_general_template (old_decl
);
4366 DECL_TEMPLATE_SPECIALIZATIONS (t
)
4367 = chainon (DECL_TEMPLATE_SPECIALIZATIONS (t
),
4368 DECL_TEMPLATE_SPECIALIZATIONS (old_decl
));
4369 DECL_TEMPLATE_SPECIALIZATIONS (old_decl
) = NULL_TREE
;
4374 /* The information from NEW_FRIEND has been merged into OLD_DECL
4375 by duplicate_decls. */
4376 new_friend
= old_decl
;
4379 else if (TYPE_SIZE (DECL_CONTEXT (new_friend
)))
4381 /* Check to see that the declaration is really present, and,
4382 possibly obtain an improved declaration. */
4383 tree fn
= check_classfn (DECL_CONTEXT (new_friend
),
4392 input_filename
= file
;
4396 /* FRIEND_TMPL is a friend TEMPLATE_DECL. ARGS is the vector of
4397 template arguments, as for tsubst.
4399 Returns an appropriate tsbust'd friend type. */
4402 tsubst_friend_class (friend_tmpl
, args
)
4407 tree tmpl
= lookup_name (DECL_NAME (friend_tmpl
), 1);
4409 tmpl
= maybe_get_template_decl_from_type_decl (tmpl
);
4411 if (tmpl
!= NULL_TREE
&& DECL_CLASS_TEMPLATE_P (tmpl
))
4413 /* The friend template has already been declared. Just
4414 check to see that the declarations match, and install any new
4415 default parameters. We must tsubst the default parameters,
4416 of course. We only need the innermost template parameters
4417 because that is all that redeclare_class_template will look
4420 = tsubst_template_parms (DECL_TEMPLATE_PARMS (friend_tmpl
),
4422 redeclare_class_template (TREE_TYPE (tmpl
), parms
);
4423 friend_type
= TREE_TYPE (tmpl
);
4427 /* The friend template has not already been declared. In this
4428 case, the instantiation of the template class will cause the
4429 injection of this template into the global scope. */
4430 tmpl
= tsubst (friend_tmpl
, args
, NULL_TREE
);
4432 /* The new TMPL is not an instantiation of anything, so we
4433 forget its origins. We don't reset CLASSTYPE_TI_TEMPLATE for
4434 the new type because that is supposed to be the corresponding
4435 template decl, i.e., TMPL. */
4436 DECL_USE_TEMPLATE (tmpl
) = 0;
4437 DECL_TEMPLATE_INFO (tmpl
) = NULL_TREE
;
4438 CLASSTYPE_USE_TEMPLATE (TREE_TYPE (tmpl
)) = 0;
4440 /* Inject this template into the global scope. */
4441 friend_type
= TREE_TYPE (pushdecl_top_level (tmpl
));
4448 instantiate_class_template (type
)
4451 tree
template, args
, pattern
, t
;
4454 if (type
== error_mark_node
)
4455 return error_mark_node
;
4457 if (TYPE_BEING_DEFINED (type
) || TYPE_SIZE (type
))
4460 /* We want to allocate temporary vectors of template arguments and
4461 template argument expressions on the momentary obstack, not on
4462 the expression obstack. Otherwise, all the space allocated in
4463 argument coercion and such is simply lost. */
4466 /* Figure out which template is being instantiated. */
4467 template = most_general_template (CLASSTYPE_TI_TEMPLATE (type
));
4468 my_friendly_assert (TREE_CODE (template) == TEMPLATE_DECL
, 279);
4470 /* Figure out which arguments are being used to do the
4472 args
= CLASSTYPE_TI_ARGS (type
);
4473 PARTIAL_INSTANTIATION_P (type
) = uses_template_parms (args
);
4475 if (pedantic
&& PARTIAL_INSTANTIATION_P (type
))
4476 /* If this is a partial instantiation, then we can't instantiate
4477 the type; there's no telling whether or not one of the
4478 template parameters might eventually be instantiated to some
4479 value that results in a specialization being used. For
4491 Now, the `S<U>' in `f<int>' is the specialization, not an
4492 instantiation of the original template. */
4495 /* Determine what specialization of the original template to
4497 if (PARTIAL_INSTANTIATION_P (type
))
4498 /* There's no telling which specialization is appropriate at this
4499 point. Since all peeking at the innards of this partial
4500 instantiation are extensions (like the "implicit typename"
4501 extension, which allows users to omit the keyword `typename' on
4502 names that are declared as types in template base classes), we
4503 are free to do what we please.
4505 Trying to figure out which partial instantiation to use can
4506 cause a crash. (Some of the template arguments don't even have
4507 types.) So, we just use the most general version. */
4511 t
= most_specialized_class (template, args
);
4513 if (t
== error_mark_node
)
4515 char *str
= "candidates are:";
4516 cp_error ("ambiguous class template instantiation for `%#T'", type
);
4517 for (t
= DECL_TEMPLATE_SPECIALIZATIONS (template); t
;
4520 if (get_class_bindings (TREE_VALUE (t
), TREE_PURPOSE (t
),
4523 cp_error_at ("%s %+#T", str
, TREE_TYPE (t
));
4527 TYPE_BEING_DEFINED (type
) = 1;
4528 type
= error_mark_node
;
4534 pattern
= TREE_TYPE (t
);
4536 pattern
= TREE_TYPE (template);
4538 /* If the template we're instantiating is incomplete, then clearly
4539 there's nothing we can do. */
4540 if (TYPE_SIZE (pattern
) == NULL_TREE
)
4543 /* If this is a partial instantiation, don't tsubst anything. We will
4544 only use this type for implicit typename, so the actual contents don't
4545 matter. All that matters is whether a particular name is a type. */
4546 if (PARTIAL_INSTANTIATION_P (type
))
4548 /* The fields set here must be kept in sync with those cleared
4549 in begin_class_definition. */
4550 TYPE_BINFO_BASETYPES (type
) = TYPE_BINFO_BASETYPES (pattern
);
4551 TYPE_FIELDS (type
) = TYPE_FIELDS (pattern
);
4552 TYPE_METHODS (type
) = TYPE_METHODS (pattern
);
4553 CLASSTYPE_TAGS (type
) = CLASSTYPE_TAGS (pattern
);
4554 /* Pretend that the type is complete, so that we will look
4555 inside it during name lookup and such. */
4556 TYPE_SIZE (type
) = integer_zero_node
;
4560 /* If we've recursively instantiated too many templates, stop. */
4561 if (! push_tinst_level (type
))
4564 /* Now we're really doing the instantiation. Mark the type as in
4565 the process of being defined. */
4566 TYPE_BEING_DEFINED (type
) = 1;
4568 maybe_push_to_top_level (uses_template_parms (type
));
4569 pushclass (type
, 0);
4573 /* This TYPE is actually a instantiation of of a partial
4574 specialization. We replace the innermost set of ARGS with
4575 the arguments appropriate for substitution. For example,
4578 template <class T> struct S {};
4579 template <class T> struct S<T*> {};
4581 and supposing that we are instantiating S<int*>, ARGS will
4582 present be {int*} but we need {int}. */
4584 = get_class_bindings (TREE_VALUE (t
), TREE_PURPOSE (t
),
4587 /* If there were multiple levels in ARGS, replacing the
4588 innermost level would alter CLASSTYPE_TI_ARGS, which we don't
4589 want, so we make a copy first. */
4590 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (args
))
4592 args
= copy_node (args
);
4593 SET_TMPL_ARGS_LEVEL (args
, TMPL_ARGS_DEPTH (args
), inner_args
);
4599 if (flag_external_templates
)
4601 if (flag_alt_external_templates
)
4603 CLASSTYPE_INTERFACE_ONLY (type
) = interface_only
;
4604 SET_CLASSTYPE_INTERFACE_UNKNOWN_X (type
, interface_unknown
);
4605 CLASSTYPE_VTABLE_NEEDS_WRITING (type
)
4606 = (! CLASSTYPE_INTERFACE_ONLY (type
)
4607 && CLASSTYPE_INTERFACE_KNOWN (type
));
4611 CLASSTYPE_INTERFACE_ONLY (type
) = CLASSTYPE_INTERFACE_ONLY (pattern
);
4612 SET_CLASSTYPE_INTERFACE_UNKNOWN_X
4613 (type
, CLASSTYPE_INTERFACE_UNKNOWN (pattern
));
4614 CLASSTYPE_VTABLE_NEEDS_WRITING (type
)
4615 = (! CLASSTYPE_INTERFACE_ONLY (type
)
4616 && CLASSTYPE_INTERFACE_KNOWN (type
));
4621 SET_CLASSTYPE_INTERFACE_UNKNOWN (type
);
4622 CLASSTYPE_VTABLE_NEEDS_WRITING (type
) = 1;
4625 TYPE_HAS_CONSTRUCTOR (type
) = TYPE_HAS_CONSTRUCTOR (pattern
);
4626 TYPE_HAS_DESTRUCTOR (type
) = TYPE_HAS_DESTRUCTOR (pattern
);
4627 TYPE_HAS_ASSIGNMENT (type
) = TYPE_HAS_ASSIGNMENT (pattern
);
4628 TYPE_OVERLOADS_CALL_EXPR (type
) = TYPE_OVERLOADS_CALL_EXPR (pattern
);
4629 TYPE_OVERLOADS_ARRAY_REF (type
) = TYPE_OVERLOADS_ARRAY_REF (pattern
);
4630 TYPE_OVERLOADS_ARROW (type
) = TYPE_OVERLOADS_ARROW (pattern
);
4631 TYPE_GETS_NEW (type
) = TYPE_GETS_NEW (pattern
);
4632 TYPE_GETS_DELETE (type
) = TYPE_GETS_DELETE (pattern
);
4633 TYPE_VEC_DELETE_TAKES_SIZE (type
) = TYPE_VEC_DELETE_TAKES_SIZE (pattern
);
4634 TYPE_HAS_ASSIGN_REF (type
) = TYPE_HAS_ASSIGN_REF (pattern
);
4635 TYPE_HAS_CONST_ASSIGN_REF (type
) = TYPE_HAS_CONST_ASSIGN_REF (pattern
);
4636 TYPE_HAS_ABSTRACT_ASSIGN_REF (type
) = TYPE_HAS_ABSTRACT_ASSIGN_REF (pattern
);
4637 TYPE_HAS_INIT_REF (type
) = TYPE_HAS_INIT_REF (pattern
);
4638 TYPE_HAS_CONST_INIT_REF (type
) = TYPE_HAS_CONST_INIT_REF (pattern
);
4639 TYPE_HAS_DEFAULT_CONSTRUCTOR (type
) = TYPE_HAS_DEFAULT_CONSTRUCTOR (pattern
);
4640 TYPE_HAS_CONVERSION (type
) = TYPE_HAS_CONVERSION (pattern
);
4641 TYPE_USES_COMPLEX_INHERITANCE (type
)
4642 = TYPE_USES_COMPLEX_INHERITANCE (pattern
);
4643 TYPE_USES_MULTIPLE_INHERITANCE (type
)
4644 = TYPE_USES_MULTIPLE_INHERITANCE (pattern
);
4645 TYPE_USES_VIRTUAL_BASECLASSES (type
)
4646 = TYPE_USES_VIRTUAL_BASECLASSES (pattern
);
4647 TYPE_PACKED (type
) = TYPE_PACKED (pattern
);
4648 TYPE_ALIGN (type
) = TYPE_ALIGN (pattern
);
4649 TYPE_FOR_JAVA (type
) = TYPE_FOR_JAVA (pattern
); /* For libjava's JArray<T> */
4651 /* We must copy the arguments to the permanent obstack since
4652 during the tsubst'ing below they may wind up in the
4653 DECL_TI_ARGS of some instantiated member template. */
4654 args
= copy_to_permanent (args
);
4657 tree binfo
= TYPE_BINFO (type
);
4658 tree pbases
= TYPE_BINFO_BASETYPES (pattern
);
4664 int len
= TREE_VEC_LENGTH (pbases
);
4665 bases
= make_tree_vec (len
);
4666 for (i
= 0; i
< len
; ++i
)
4670 TREE_VEC_ELT (bases
, i
) = elt
4671 = tsubst (TREE_VEC_ELT (pbases
, i
), args
, NULL_TREE
);
4672 BINFO_INHERITANCE_CHAIN (elt
) = binfo
;
4674 basetype
= TREE_TYPE (elt
);
4676 if (! IS_AGGR_TYPE (basetype
))
4678 ("base type `%T' of `%T' fails to be a struct or class type",
4680 else if (TYPE_SIZE (complete_type (basetype
)) == NULL_TREE
)
4681 cp_error ("base class `%T' of `%T' has incomplete type",
4684 /* These are set up in xref_basetypes for normal classes, so
4685 we have to handle them here for template bases. */
4687 unshare_base_binfos (elt
);
4689 if (TYPE_USES_VIRTUAL_BASECLASSES (basetype
))
4691 TYPE_USES_VIRTUAL_BASECLASSES (type
) = 1;
4692 TYPE_USES_COMPLEX_INHERITANCE (type
) = 1;
4694 TYPE_GETS_NEW (type
) |= TYPE_GETS_NEW (basetype
);
4695 TYPE_GETS_DELETE (type
) |= TYPE_GETS_DELETE (basetype
);
4697 /* Don't initialize this until the vector is filled out, or
4698 lookups will crash. */
4699 BINFO_BASETYPES (binfo
) = bases
;
4703 for (t
= CLASSTYPE_TAGS (pattern
); t
; t
= TREE_CHAIN (t
))
4705 tree tag
= TREE_VALUE (t
);
4706 tree name
= TYPE_IDENTIFIER (tag
);
4709 newtag
= tsubst (tag
, args
, NULL_TREE
);
4710 if (TREE_CODE (newtag
) != ENUMERAL_TYPE
)
4712 if (TYPE_LANG_SPECIFIC (tag
) && CLASSTYPE_IS_TEMPLATE (tag
))
4713 /* Unfortunately, lookup_template_class sets
4714 CLASSTYPE_IMPLICIT_INSTANTIATION for a partial
4715 instantiation (i.e., for the type of a member template
4716 class nested within a template class.) This behavior is
4717 required for maybe_process_partial_specialization to work
4718 correctly, but is not accurate in this case; the TAG is not
4719 an instantiation of anything. (The corresponding
4720 TEMPLATE_DECL is an instantiation, but the TYPE is not.) */
4721 CLASSTYPE_USE_TEMPLATE (newtag
) = 0;
4723 /* Now, we call pushtag to put this NEWTAG into the scope of
4724 TYPE. We first set up the IDENTIFIER_TYPE_VALUE to avoid
4725 pushtag calling push_template_decl. We don't have to do
4726 this for enums because it will already have been done in
4729 SET_IDENTIFIER_TYPE_VALUE (name
, newtag
);
4730 pushtag (name
, newtag
, /*globalize=*/0);
4734 /* Don't replace enum constants here. */
4735 for (t
= TYPE_FIELDS (pattern
); t
; t
= TREE_CHAIN (t
))
4736 if (TREE_CODE (t
) != CONST_DECL
)
4740 /* The the file and line for this declaration, to assist in
4741 error message reporting. Since we called push_tinst_level
4742 above, we don't need to restore these. */
4743 lineno
= DECL_SOURCE_LINE (t
);
4744 input_filename
= DECL_SOURCE_FILE (t
);
4746 r
= tsubst (t
, args
, NULL_TREE
);
4747 if (TREE_CODE (r
) == VAR_DECL
)
4749 pending_statics
= perm_tree_cons (NULL_TREE
, r
, pending_statics
);
4750 /* Perhaps we should do more of grokfield here. */
4752 DECL_IN_AGGR_P (r
) = 1;
4753 DECL_EXTERNAL (r
) = 1;
4754 cp_finish_decl (r
, DECL_INITIAL (r
), NULL_TREE
, 0, 0);
4755 if (DECL_DEFINED_IN_CLASS_P (r
))
4756 check_static_variable_definition (r
, TREE_TYPE (r
));
4759 /* R will have a TREE_CHAIN if and only if it has already been
4760 processed by finish_member_declaration. This can happen
4761 if, for example, it is a TYPE_DECL for a class-scoped
4762 ENUMERAL_TYPE; such a thing will already have been added to
4763 the field list by tsubst_enum above. */
4764 if (!TREE_CHAIN (r
))
4766 set_current_access_from_decl (r
);
4767 finish_member_declaration (r
);
4771 /* Set up the list (TYPE_METHODS) and vector (CLASSTYPE_METHOD_VEC)
4772 for this instantiation. */
4773 for (t
= TYPE_METHODS (pattern
); t
; t
= TREE_CHAIN (t
))
4775 tree r
= tsubst (t
, args
, NULL_TREE
);
4776 set_current_access_from_decl (r
);
4777 finish_member_declaration (r
);
4780 /* Construct the DECL_FRIENDLIST for the new class type. */
4781 typedecl
= TYPE_MAIN_DECL (type
);
4782 for (t
= DECL_FRIENDLIST (TYPE_MAIN_DECL (pattern
));
4788 DECL_FRIENDLIST (typedecl
)
4789 = tree_cons (TREE_PURPOSE (t
), NULL_TREE
,
4790 DECL_FRIENDLIST (typedecl
));
4792 for (friends
= TREE_VALUE (t
);
4793 friends
!= NULL_TREE
;
4794 friends
= TREE_CHAIN (friends
))
4796 if (TREE_PURPOSE (friends
) == error_mark_node
)
4798 TREE_VALUE (DECL_FRIENDLIST (typedecl
))
4799 = tree_cons (error_mark_node
,
4800 tsubst_friend_function (TREE_VALUE (friends
),
4802 TREE_VALUE (DECL_FRIENDLIST (typedecl
)));
4806 TREE_VALUE (DECL_FRIENDLIST (typedecl
))
4807 = tree_cons (tsubst (TREE_PURPOSE (friends
), args
, NULL_TREE
),
4809 TREE_VALUE (DECL_FRIENDLIST (typedecl
)));
4815 for (t
= CLASSTYPE_FRIEND_CLASSES (pattern
);
4819 tree friend_type
= TREE_VALUE (t
);
4820 tree new_friend_type
;
4822 if (TREE_CODE (friend_type
) == TEMPLATE_DECL
)
4823 new_friend_type
= tsubst_friend_class (friend_type
, args
);
4824 else if (uses_template_parms (friend_type
))
4825 new_friend_type
= tsubst (friend_type
, args
, NULL_TREE
);
4827 /* The call to xref_tag_from_type does injection for friend
4830 xref_tag_from_type (friend_type
, NULL_TREE
, 1);
4833 if (TREE_CODE (friend_type
) == TEMPLATE_DECL
)
4834 /* Trick make_friend_class into realizing that the friend
4835 we're adding is a template, not an ordinary class. It's
4836 important that we use make_friend_class since it will
4837 perform some error-checking and output cross-reference
4839 ++processing_template_decl
;
4841 make_friend_class (type
, new_friend_type
);
4843 if (TREE_CODE (friend_type
) == TEMPLATE_DECL
)
4844 --processing_template_decl
;
4847 /* This does injection for friend functions. */
4848 if (!processing_template_decl
)
4850 t
= tsubst (DECL_TEMPLATE_INJECT (template), args
, NULL_TREE
);
4852 for (; t
; t
= TREE_CHAIN (t
))
4854 tree d
= TREE_VALUE (t
);
4856 if (TREE_CODE (d
) == TYPE_DECL
)
4857 /* Already injected. */;
4863 for (t
= TYPE_FIELDS (type
); t
; t
= TREE_CHAIN (t
))
4864 if (TREE_CODE (t
) == FIELD_DECL
)
4866 TREE_TYPE (t
) = complete_type (TREE_TYPE (t
));
4867 require_complete_type (t
);
4870 /* Set the file and line number information to whatever is given for
4871 the class itself. This puts error messages involving generated
4872 implicit functions at a predictable point, and the same point
4873 that would be used for non-template classes. */
4874 lineno
= DECL_SOURCE_LINE (typedecl
);
4875 input_filename
= DECL_SOURCE_FILE (typedecl
);
4877 unreverse_member_declarations (type
);
4878 type
= finish_struct_1 (type
, 0);
4879 CLASSTYPE_GOT_SEMICOLON (type
) = 1;
4881 /* Clear this now so repo_template_used is happy. */
4882 TYPE_BEING_DEFINED (type
) = 0;
4883 repo_template_used (type
);
4886 pop_from_top_level ();
4899 if (t1
== NULL_TREE
)
4900 return t2
== NULL_TREE
;
4901 if (t2
== NULL_TREE
)
4903 /* Don't care if one declares its arg const and the other doesn't -- the
4904 main variant of the arg type is all that matters. */
4905 if (TYPE_MAIN_VARIANT (TREE_VALUE (t1
))
4906 != TYPE_MAIN_VARIANT (TREE_VALUE (t2
)))
4908 return list_eq (TREE_CHAIN (t1
), TREE_CHAIN (t2
));
4911 /* If arg is a non-type template parameter that does not depend on template
4912 arguments, fold it like we weren't in the body of a template. */
4915 maybe_fold_nontype_arg (arg
)
4918 if (TREE_CODE_CLASS (TREE_CODE (arg
)) != 't'
4919 && !uses_template_parms (arg
))
4921 /* Sometimes, one of the args was an expression involving a
4922 template constant parameter, like N - 1. Now that we've
4923 tsubst'd, we might have something like 2 - 1. This will
4924 confuse lookup_template_class, so we do constant folding
4925 here. We have to unset processing_template_decl, to
4926 fool build_expr_from_tree() into building an actual
4929 int saved_processing_template_decl
= processing_template_decl
;
4930 processing_template_decl
= 0;
4931 arg
= fold (build_expr_from_tree (arg
));
4932 processing_template_decl
= saved_processing_template_decl
;
4937 /* Return the TREE_VEC with the arguments for the innermost template header,
4938 where ARGS is either that or the VEC of VECs for all the
4942 innermost_args (args
)
4945 return TMPL_ARGS_LEVEL (args
, TMPL_ARGS_DEPTH (args
));
4948 /* Substitute ARGS into the vector of template arguments T. */
4951 tsubst_template_arg_vector (t
, args
)
4955 int len
= TREE_VEC_LENGTH (t
), need_new
= 0, i
;
4956 tree
*elts
= (tree
*) alloca (len
* sizeof (tree
));
4958 bzero ((char *) elts
, len
* sizeof (tree
));
4960 for (i
= 0; i
< len
; i
++)
4962 if (TREE_VEC_ELT (t
, i
) != NULL_TREE
4963 && TREE_CODE (TREE_VEC_ELT (t
, i
)) == TREE_VEC
)
4964 elts
[i
] = tsubst_template_arg_vector (TREE_VEC_ELT (t
, i
), args
);
4966 elts
[i
] = maybe_fold_nontype_arg
4967 (tsubst_expr (TREE_VEC_ELT (t
, i
), args
, NULL_TREE
));
4969 if (elts
[i
] != TREE_VEC_ELT (t
, i
))
4976 t
= make_temp_vec (len
);
4977 for (i
= 0; i
< len
; i
++)
4978 TREE_VEC_ELT (t
, i
) = elts
[i
];
4983 /* Return the result of substituting ARGS into the template parameters
4984 given by PARMS. If there are m levels of ARGS and m + n levels of
4985 PARMS, then the result will contain n levels of PARMS. For
4986 example, if PARMS is `template <class T> template <class U>
4987 template <T*, U, class V>' and ARGS is {{int}, {double}} then the
4988 result will be `template <int*, double, class V>'. */
4991 tsubst_template_parms (parms
, args
)
4996 tree
* new_parms
= &r
;
4998 for (new_parms
= &r
;
4999 TMPL_PARMS_DEPTH (parms
) > TMPL_ARGS_DEPTH (args
);
5000 new_parms
= &(TREE_CHAIN (*new_parms
)),
5001 parms
= TREE_CHAIN (parms
))
5004 make_tree_vec (TREE_VEC_LENGTH (TREE_VALUE (parms
)));
5007 for (i
= 0; i
< TREE_VEC_LENGTH (new_vec
); ++i
)
5009 tree default_value
=
5010 TREE_PURPOSE (TREE_VEC_ELT (TREE_VALUE (parms
), i
));
5012 TREE_VALUE (TREE_VEC_ELT (TREE_VALUE (parms
), i
));
5014 TREE_VEC_ELT (new_vec
, i
)
5015 = build_tree_list (tsubst (default_value
, args
, NULL_TREE
),
5016 tsubst (parm_decl
, args
, NULL_TREE
));
5021 tree_cons (build_int_2 (0, (TMPL_PARMS_DEPTH (parms
)
5022 - TMPL_ARGS_DEPTH (args
))),
5023 new_vec
, NULL_TREE
);
5029 /* Substitute the ARGS into the indicated aggregate (or enumeration)
5030 type T. If T is not an aggregate or enumeration type, it is
5031 handled as if by tsubst. IN_DECL is as for tsubst. If
5032 ENTERING_SCOPE is non-zero, T is the context for a template which
5033 we are presently tsubst'ing. Return the subsituted value. */
5036 tsubst_aggr_type (t
, args
, in_decl
, entering_scope
)
5045 switch (TREE_CODE (t
))
5048 if (TYPE_PTRMEMFUNC_P (t
))
5050 tree r
= build_ptrmemfunc_type
5051 (tsubst (TYPE_PTRMEMFUNC_FN_TYPE (t
), args
, in_decl
));
5052 return cp_build_qualified_type (r
, TYPE_QUALS (t
));
5055 /* else fall through */
5058 if (TYPE_TEMPLATE_INFO (t
))
5064 /* First, determine the context for the type we are looking
5066 if (TYPE_CONTEXT (t
) != NULL_TREE
)
5067 context
= tsubst_aggr_type (TYPE_CONTEXT (t
), args
,
5068 in_decl
, /*entering_scope=*/1);
5070 context
= NULL_TREE
;
5072 /* Then, figure out what arguments are appropriate for the
5073 type we are trying to find. For example, given:
5075 template <class T> struct S;
5076 template <class T, class U> void f(T, U) { S<U> su; }
5078 and supposing that we are instantiating f<int, double>,
5079 then our ARGS will be {int, double}, but, when looking up
5080 S we only want {double}. */
5082 argvec
= tsubst_template_arg_vector (TYPE_TI_ARGS (t
), args
);
5084 r
= lookup_template_class (t
, argvec
, in_decl
, context
,
5088 return cp_build_qualified_type (r
, TYPE_QUALS (t
));
5091 /* This is not a template type, so there's nothing to do. */
5095 return tsubst (t
, args
, in_decl
);
5099 /* Substitute the ARGS into the T, which is a _DECL. TYPE is the
5100 (already computed) substitution of ARGS into TREE_TYPE (T), if
5101 appropriate. Return the result of the substitution. IN_DECL is as
5105 tsubst_decl (t
, args
, type
, in_decl
)
5112 char* saved_filename
;
5115 /* Set the filename and linenumber to improve error-reporting. */
5116 saved_lineno
= lineno
;
5117 saved_filename
= input_filename
;
5118 lineno
= DECL_SOURCE_LINE (t
);
5119 input_filename
= DECL_SOURCE_FILE (t
);
5121 switch (TREE_CODE (t
))
5125 /* We can get here when processing a member template function
5126 of a template class. */
5127 tree decl
= DECL_TEMPLATE_RESULT (t
);
5129 int is_template_template_parm
= DECL_TEMPLATE_TEMPLATE_PARM_P (t
);
5131 if (!is_template_template_parm
)
5133 /* We might already have an instance of this template.
5134 The ARGS are for the surrounding class type, so the
5135 full args contain the tsubst'd args for the context,
5136 plus the innermost args from the template decl. */
5137 tree tmpl_args
= DECL_CLASS_TEMPLATE_P (t
)
5138 ? CLASSTYPE_TI_ARGS (TREE_TYPE (t
))
5139 : DECL_TI_ARGS (DECL_RESULT (t
));
5143 full_args
= tsubst_template_arg_vector (tmpl_args
, args
);
5145 /* tsubst_template_arg_vector doesn't copy the vector if
5146 nothing changed. But, *something* should have
5148 my_friendly_assert (full_args
!= tmpl_args
, 0);
5150 spec
= retrieve_specialization (t
, full_args
);
5152 if (spec
!= NULL_TREE
)
5159 /* Make a new template decl. It will be similar to the
5160 original, but will record the current template arguments.
5161 We also create a new function declaration, which is just
5162 like the old one, but points to this new template, rather
5163 than the old one. */
5166 my_friendly_assert (DECL_LANG_SPECIFIC (r
) != 0, 0);
5167 TREE_CHAIN (r
) = NULL_TREE
;
5169 if (is_template_template_parm
)
5171 tree new_decl
= tsubst (decl
, args
, in_decl
);
5172 DECL_RESULT (r
) = new_decl
;
5173 TREE_TYPE (r
) = TREE_TYPE (new_decl
);
5178 = tsubst_aggr_type (DECL_CONTEXT (t
), args
, in_decl
,
5179 /*entering_scope=*/1);
5180 DECL_CLASS_CONTEXT (r
)
5181 = tsubst_aggr_type (DECL_CLASS_CONTEXT (t
), args
, in_decl
,
5182 /*entering_scope=*/1);
5183 DECL_TEMPLATE_INFO (r
) = build_tree_list (t
, args
);
5185 if (TREE_CODE (decl
) == TYPE_DECL
)
5187 tree new_type
= tsubst (TREE_TYPE (t
), args
, in_decl
);
5188 TREE_TYPE (r
) = new_type
;
5189 CLASSTYPE_TI_TEMPLATE (new_type
) = r
;
5190 DECL_RESULT (r
) = TYPE_MAIN_DECL (new_type
);
5191 DECL_TI_ARGS (r
) = CLASSTYPE_TI_ARGS (new_type
);
5195 tree new_decl
= tsubst (decl
, args
, in_decl
);
5196 DECL_RESULT (r
) = new_decl
;
5197 DECL_TI_TEMPLATE (new_decl
) = r
;
5198 TREE_TYPE (r
) = TREE_TYPE (new_decl
);
5199 DECL_TI_ARGS (r
) = DECL_TI_ARGS (new_decl
);
5202 SET_DECL_IMPLICIT_INSTANTIATION (r
);
5203 DECL_TEMPLATE_INSTANTIATIONS (r
) = NULL_TREE
;
5204 DECL_TEMPLATE_SPECIALIZATIONS (r
) = NULL_TREE
;
5206 /* The template parameters for this new template are all the
5207 template parameters for the old template, except the
5208 outermost level of parameters. */
5209 DECL_TEMPLATE_PARMS (r
)
5210 = tsubst_template_parms (DECL_TEMPLATE_PARMS (t
), args
);
5212 if (PRIMARY_TEMPLATE_P (t
))
5213 DECL_PRIMARY_TEMPLATE (r
) = r
;
5215 /* We don't partially instantiate partial specializations. */
5216 if (TREE_CODE (decl
) == TYPE_DECL
)
5219 for (spec
= DECL_TEMPLATE_SPECIALIZATIONS (t
);
5221 spec
= TREE_CHAIN (spec
))
5223 /* It helps to consider example here. Consider:
5234 Now, for example, we are instantiating S<int>::f(U u).
5235 We want to make a template:
5240 It will have a specialization, for the case U = int*, of
5244 void S<int>::f<int*>(int*);
5246 This specialization will be an instantiation of
5247 the specialization given in the declaration of S, with
5248 argument list int*. */
5250 tree fn
= TREE_VALUE (spec
);
5254 if (!DECL_TEMPLATE_SPECIALIZATION (fn
))
5255 /* Instantiations are on the same list, but they're of
5256 no concern to us. */
5259 if (TREE_CODE (fn
) != TEMPLATE_DECL
)
5260 /* A full specialization. There's no need to record
5264 spec_args
= tsubst (DECL_TI_ARGS (fn
), args
, in_decl
);
5265 new_fn
= tsubst (DECL_RESULT (most_general_template (fn
)),
5266 spec_args
, in_decl
);
5267 DECL_TI_TEMPLATE (new_fn
) = fn
;
5268 register_specialization (new_fn
, r
,
5269 innermost_args (spec_args
));
5272 /* Record this partial instantiation. */
5273 register_specialization (r
, t
,
5274 DECL_TI_ARGS (DECL_RESULT (r
)));
5282 tree argvec
= NULL_TREE
;
5288 /* Nobody should be tsubst'ing into non-template functions. */
5289 my_friendly_assert (DECL_TEMPLATE_INFO (t
) != NULL_TREE
, 0);
5291 if (TREE_CODE (DECL_TI_TEMPLATE (t
)) == TEMPLATE_DECL
)
5295 /* Allocate template arguments on the momentary obstack,
5296 in case we don't need to keep them. */
5299 /* Calculate the most general template of which R is a
5300 specialization, and the complete set of arguments used to
5302 gen_tmpl
= most_general_template (DECL_TI_TEMPLATE (t
));
5304 = tsubst_template_arg_vector (DECL_TI_ARGS
5305 (DECL_TEMPLATE_RESULT (gen_tmpl
)),
5308 /* Check to see if we already have this specialization. */
5309 spec
= retrieve_specialization (gen_tmpl
, argvec
);
5318 /* We're going to need to keep the ARGVEC, so we copy it
5320 argvec
= copy_to_permanent (argvec
);
5323 /* Here, we deal with the peculiar case:
5325 template <class T> struct S {
5326 template <class U> friend void f();
5328 template <class U> friend void f() {}
5330 template void f<double>();
5332 Here, the ARGS for the instantiation of will be {int,
5333 double}. But, we only need as many ARGS as there are
5334 levels of template parameters in CODE_PATTERN. We are
5335 careful not to get fooled into reducing the ARGS in
5338 template <class T> struct S { template <class U> void f(U); }
5339 template <class T> template <> void S<T>::f(int) {}
5341 which we can spot because the pattern will be a
5342 specialization in this case. */
5343 args_depth
= TMPL_ARGS_DEPTH (args
);
5345 TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (DECL_TI_TEMPLATE (t
)));
5346 if (args_depth
> parms_depth
5347 && !DECL_TEMPLATE_SPECIALIZATION (t
))
5349 my_friendly_assert (DECL_FRIEND_P (t
), 0);
5351 if (parms_depth
> 1)
5355 args
= make_temp_vec (parms_depth
);
5356 for (i
= 0; i
< parms_depth
; ++i
)
5357 TREE_VEC_ELT (args
, i
) =
5358 TREE_VEC_ELT (args
, i
+ (args_depth
- parms_depth
));
5361 args
= TREE_VEC_ELT (args
, args_depth
- parms_depth
);
5366 /* This special case arises when we have something like this:
5368 template <class T> struct S {
5369 friend void f<int>(int, double);
5372 Here, the DECL_TI_TEMPLATE for the friend declaration
5373 will be a LOOKUP_EXPR or an IDENTIFIER_NODE. We are
5374 being called from tsubst_friend_function, and we want
5375 only to create a new decl (R) with appropriate types so
5376 that we can call determine_specialization. */
5377 my_friendly_assert ((TREE_CODE (DECL_TI_TEMPLATE (t
))
5379 || (TREE_CODE (DECL_TI_TEMPLATE (t
))
5380 == IDENTIFIER_NODE
), 0);
5381 gen_tmpl
= NULL_TREE
;
5384 if (DECL_CLASS_SCOPE_P (t
))
5386 if (DECL_NAME (t
) == constructor_name (DECL_CONTEXT (t
)))
5390 ctx
= tsubst_aggr_type (DECL_CLASS_CONTEXT (t
), args
, t
,
5391 /*entering_scope=*/1);
5398 type
= tsubst (type
, args
, in_decl
);
5400 /* We do NOT check for matching decls pushed separately at this
5401 point, as they may not represent instantiations of this
5402 template, and in any case are considered separate under the
5403 discrete model. Instead, see add_maybe_template. */
5407 DECL_USE_TEMPLATE (r
) = 0;
5408 TREE_TYPE (r
) = type
;
5411 = tsubst_aggr_type (DECL_CONTEXT (t
), args
, t
, /*entering_scope=*/1);
5412 DECL_CLASS_CONTEXT (r
) = ctx
;
5414 if (member
&& IDENTIFIER_TYPENAME_P (DECL_NAME (r
)))
5415 /* Type-conversion operator. Reconstruct the name, in
5416 case it's the name of one of the template's parameters. */
5417 DECL_NAME (r
) = build_typename_overload (TREE_TYPE (type
));
5419 DECL_ARGUMENTS (r
) = tsubst (DECL_ARGUMENTS (t
), args
, t
);
5420 DECL_MAIN_VARIANT (r
) = r
;
5421 DECL_RESULT (r
) = NULL_TREE
;
5423 TREE_STATIC (r
) = 0;
5424 TREE_PUBLIC (r
) = TREE_PUBLIC (t
);
5425 DECL_EXTERNAL (r
) = 1;
5426 DECL_INTERFACE_KNOWN (r
) = 0;
5427 DECL_DEFER_OUTPUT (r
) = 0;
5428 TREE_CHAIN (r
) = NULL_TREE
;
5429 DECL_PENDING_INLINE_INFO (r
) = 0;
5432 /* Set up the DECL_TEMPLATE_INFO for R and compute its mangled
5433 name. There's no need to do this in the special friend
5434 case mentioned above where GEN_TMPL is NULL. */
5437 /* The ARGVEC was built on the momentary obstack. Make it
5439 argvec
= copy_to_permanent (argvec
);
5440 DECL_TEMPLATE_INFO (r
)
5441 = perm_tree_cons (gen_tmpl
, argvec
, NULL_TREE
);
5442 SET_DECL_IMPLICIT_INSTANTIATION (r
);
5443 register_specialization (r
, gen_tmpl
, argvec
);
5445 /* Set the mangled name for R. */
5446 if (DECL_DESTRUCTOR_P (t
))
5447 DECL_ASSEMBLER_NAME (r
) = build_destructor_name (ctx
);
5450 /* Instantiations of template functions must be mangled
5451 specially, in order to conform to 14.5.5.1
5452 [temp.over.link]. */
5453 tree tmpl
= DECL_TI_TEMPLATE (t
);
5455 /* TMPL will be NULL if this is a specialization of a
5456 member function of a template class. */
5457 if (name_mangling_version
< 1
5458 || tmpl
== NULL_TREE
5459 || (member
&& !is_member_template (tmpl
)
5460 && !DECL_TEMPLATE_INFO (tmpl
)))
5461 set_mangled_name_for_decl (r
);
5463 set_mangled_name_for_template_decl (r
);
5467 make_decl_rtl (r
, NULL_PTR
, 1);
5469 /* Like grokfndecl. If we don't do this, pushdecl will
5470 mess up our TREE_CHAIN because it doesn't find a
5471 previous decl. Sigh. */
5473 && ! uses_template_parms (r
)
5474 && (IDENTIFIER_GLOBAL_VALUE (DECL_ASSEMBLER_NAME (r
))
5476 SET_IDENTIFIER_GLOBAL_VALUE (DECL_ASSEMBLER_NAME (r
), r
);
5479 if (DECL_CONSTRUCTOR_P (r
))
5481 maybe_retrofit_in_chrg (r
);
5482 grok_ctor_properties (ctx
, r
);
5484 if (IDENTIFIER_OPNAME_P (DECL_NAME (r
)))
5485 grok_op_properties (r
, DECL_VIRTUAL_P (r
), DECL_FRIEND_P (r
));
5492 TREE_TYPE (r
) = type
;
5493 if (TREE_CODE (DECL_INITIAL (r
)) != TEMPLATE_PARM_INDEX
)
5494 DECL_INITIAL (r
) = TREE_TYPE (r
);
5496 DECL_INITIAL (r
) = tsubst (DECL_INITIAL (r
), args
, in_decl
);
5498 DECL_CONTEXT (r
) = NULL_TREE
;
5499 #ifdef PROMOTE_PROTOTYPES
5500 if ((TREE_CODE (type
) == INTEGER_TYPE
5501 || TREE_CODE (type
) == ENUMERAL_TYPE
)
5502 && TYPE_PRECISION (type
) < TYPE_PRECISION (integer_type_node
))
5503 DECL_ARG_TYPE (r
) = integer_type_node
;
5506 TREE_CHAIN (r
) = tsubst (TREE_CHAIN (t
), args
, TREE_CHAIN (t
));
5513 TREE_TYPE (r
) = type
;
5516 DECL_FIELD_CONTEXT (r
) = tsubst (DECL_FIELD_CONTEXT (t
), args
, in_decl
);
5518 DECL_INITIAL (r
) = tsubst_expr (DECL_INITIAL (t
), args
, in_decl
);
5519 TREE_CHAIN (r
) = NULL_TREE
;
5520 if (TREE_CODE (type
) == VOID_TYPE
)
5521 cp_error_at ("instantiation of `%D' as type void", r
);
5529 = tsubst_copy (DECL_INITIAL (t
), args
, in_decl
);
5530 TREE_CHAIN (r
) = NULL_TREE
;
5540 tree ctx
= tsubst_aggr_type (DECL_CONTEXT (t
), args
, in_decl
,
5541 /*entering_scope=*/1);
5543 /* Nobody should be tsubst'ing into non-template variables. */
5544 my_friendly_assert (DECL_LANG_SPECIFIC (t
)
5545 && DECL_TEMPLATE_INFO (t
) != NULL_TREE
, 0);
5547 /* Check to see if we already have this specialization. */
5548 tmpl
= DECL_TI_TEMPLATE (t
);
5549 gen_tmpl
= most_general_template (tmpl
);
5550 argvec
= tsubst (DECL_TI_ARGS (t
), args
, in_decl
);
5551 spec
= retrieve_specialization (gen_tmpl
, argvec
);
5560 TREE_TYPE (r
) = type
;
5561 DECL_CONTEXT (r
) = ctx
;
5562 if (TREE_STATIC (r
))
5563 DECL_ASSEMBLER_NAME (r
)
5564 = build_static_name (DECL_CONTEXT (r
), DECL_NAME (r
));
5566 /* Don't try to expand the initializer until someone tries to use
5567 this variable; otherwise we run into circular dependencies. */
5568 DECL_INITIAL (r
) = NULL_TREE
;
5572 DECL_CLASS_CONTEXT (r
) = DECL_CONTEXT (r
);
5574 DECL_TEMPLATE_INFO (r
) = perm_tree_cons (tmpl
, argvec
, NULL_TREE
);
5575 SET_DECL_IMPLICIT_INSTANTIATION (r
);
5576 register_specialization (r
, gen_tmpl
, argvec
);
5578 TREE_CHAIN (r
) = NULL_TREE
;
5579 if (TREE_CODE (type
) == VOID_TYPE
)
5580 cp_error_at ("instantiation of `%D' as type void", r
);
5585 if (t
== TYPE_NAME (TREE_TYPE (t
)))
5586 r
= TYPE_NAME (type
);
5590 TREE_TYPE (r
) = type
;
5591 DECL_CONTEXT (r
) = current_class_type
;
5592 TREE_CHAIN (r
) = NULL_TREE
;
5597 my_friendly_abort (0);
5600 /* Restore the file and line information. */
5601 lineno
= saved_lineno
;
5602 input_filename
= saved_filename
;
5607 /* Substitue into the ARG_TYPES of a function type. */
5610 tsubst_arg_types (arg_types
, args
, in_decl
)
5615 tree remaining_arg_types
;
5618 if (!arg_types
|| arg_types
== void_list_node
)
5621 remaining_arg_types
= tsubst_arg_types (TREE_CHAIN (arg_types
),
5624 /* We use TYPE_MAIN_VARIANT is because top-level qualifiers don't
5625 matter on function types. */
5626 type
= TYPE_MAIN_VARIANT (type_decays_to
5627 (tsubst (TREE_VALUE (arg_types
),
5630 /* Note that we do not substitute into default arguments here. The
5631 standard mandates that they be instantiated only when needed,
5632 which is done in build_over_call. */
5633 return hash_tree_cons_simple (TREE_PURPOSE (arg_types
), type
,
5634 remaining_arg_types
);
5638 /* Substitute into the PARMS of a call-declarator. */
5641 tsubst_call_declarator_parms (parms
, args
, in_decl
)
5650 if (!parms
|| parms
== void_list_node
)
5653 new_parms
= tsubst_call_declarator_parms (TREE_CHAIN (parms
),
5656 /* Figure out the type of this parameter. */
5657 type
= tsubst (TREE_VALUE (parms
), args
, in_decl
);
5659 /* Figure out the default argument as well. Note that we use
5660 tsubst_copy since the default argument is really an
5662 defarg
= tsubst_expr (TREE_PURPOSE (parms
), args
, in_decl
);
5664 /* Chain this parameter on to the front of those we have already
5665 processed. We don't use hash_tree_cons because that function
5666 doesn't check TREE_PARMLIST. */
5667 new_parms
= tree_cons (defarg
, type
, new_parms
);
5669 /* And note that these are parameters. */
5670 TREE_PARMLIST (new_parms
) = 1;
5675 /* Take the tree structure T and replace template parameters used therein
5676 with the argument vector ARGS. IN_DECL is an associated decl for
5679 tsubst is used for dealing with types, decls and the like; for
5680 expressions, use tsubst_expr or tsubst_copy. */
5683 tsubst (t
, args
, in_decl
)
5689 if (t
== NULL_TREE
|| t
== error_mark_node
5690 || t
== integer_type_node
5691 || t
== void_type_node
5692 || t
== char_type_node
5693 || TREE_CODE (t
) == NAMESPACE_DECL
)
5696 if (TREE_CODE (t
) == IDENTIFIER_NODE
)
5697 type
= IDENTIFIER_TYPE_VALUE (t
);
5699 type
= TREE_TYPE (t
);
5700 if (type
== unknown_type_node
)
5701 my_friendly_abort (42);
5703 if (type
&& TREE_CODE (t
) != FUNCTION_DECL
5704 && TREE_CODE (t
) != TYPENAME_TYPE
5705 && TREE_CODE (t
) != TEMPLATE_DECL
5706 && TREE_CODE (t
) != IDENTIFIER_NODE
)
5707 type
= tsubst (type
, args
, in_decl
);
5709 if (TREE_CODE_CLASS (TREE_CODE (t
)) == 'd')
5710 return tsubst_decl (t
, args
, type
, in_decl
);
5712 switch (TREE_CODE (t
))
5717 return tsubst_aggr_type (t
, args
, in_decl
, /*entering_scope=*/0);
5720 case IDENTIFIER_NODE
:
5732 if (t
== integer_type_node
)
5735 if (TREE_CODE (TYPE_MIN_VALUE (t
)) == INTEGER_CST
5736 && TREE_CODE (TYPE_MAX_VALUE (t
)) == INTEGER_CST
)
5740 tree max
= TREE_OPERAND (TYPE_MAX_VALUE (t
), 0);
5742 max
= tsubst_expr (max
, args
, in_decl
);
5743 if (processing_template_decl
)
5745 tree itype
= make_node (INTEGER_TYPE
);
5746 TYPE_MIN_VALUE (itype
) = size_zero_node
;
5747 TYPE_MAX_VALUE (itype
) = build_min (MINUS_EXPR
, sizetype
, max
,
5752 if (pedantic
&& integer_zerop (max
))
5753 pedwarn ("creating array with size zero");
5754 else if (INT_CST_LT (max
, integer_zero_node
))
5756 cp_error ("creating array with size `%E'", max
);
5757 max
= integer_one_node
;
5760 max
= fold (build_binary_op (MINUS_EXPR
, max
, integer_one_node
, 1));
5761 if (!TREE_PERMANENT (max
) && !allocation_temporary_p ())
5762 max
= copy_to_permanent (max
);
5763 return build_index_type (max
);
5766 case TEMPLATE_TYPE_PARM
:
5767 case TEMPLATE_TEMPLATE_PARM
:
5768 case TEMPLATE_PARM_INDEX
:
5776 if (TREE_CODE (t
) == TEMPLATE_TYPE_PARM
5777 || TREE_CODE (t
) == TEMPLATE_TEMPLATE_PARM
)
5779 idx
= TEMPLATE_TYPE_IDX (t
);
5780 level
= TEMPLATE_TYPE_LEVEL (t
);
5784 idx
= TEMPLATE_PARM_IDX (t
);
5785 level
= TEMPLATE_PARM_LEVEL (t
);
5788 if (TREE_VEC_LENGTH (args
) > 0)
5790 tree arg
= NULL_TREE
;
5792 levels
= TMPL_ARGS_DEPTH (args
);
5793 if (level
<= levels
)
5794 arg
= TMPL_ARG (args
, level
, idx
);
5796 if (arg
== error_mark_node
)
5797 return error_mark_node
;
5798 else if (arg
!= NULL_TREE
)
5800 if (TREE_CODE (t
) == TEMPLATE_TYPE_PARM
)
5802 my_friendly_assert (TREE_CODE_CLASS (TREE_CODE (arg
))
5804 return cp_build_qualified_type
5805 (arg
, CP_TYPE_QUALS (arg
) | CP_TYPE_QUALS (t
));
5807 else if (TREE_CODE (t
) == TEMPLATE_TEMPLATE_PARM
)
5809 if (TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (t
))
5811 /* We are processing a type constructed from
5812 a template template parameter */
5813 tree argvec
= tsubst (TYPE_TI_ARGS (t
),
5816 /* We can get a TEMPLATE_TEMPLATE_PARM here when
5817 we are resolving nested-types in the signature of
5818 a member function templates.
5819 Otherwise ARG is a TEMPLATE_DECL and is the real
5820 template to be instantiated. */
5821 if (TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
)
5822 arg
= TYPE_NAME (arg
);
5824 r
= lookup_template_class (DECL_NAME (arg
),
5827 /*entering_scope=*/0);
5828 return cp_build_qualified_type (r
, TYPE_QUALS (t
));
5831 /* We are processing a template argument list. */
5839 my_friendly_abort (981018);
5842 /* This can happen during the attempted tsubst'ing in
5843 unify. This means that we don't yet have any information
5844 about the template parameter in question. */
5847 /* If we get here, we must have been looking at a parm for a
5848 more deeply nested template. Make a new version of this
5849 template parameter, but with a lower level. */
5850 switch (TREE_CODE (t
))
5852 case TEMPLATE_TYPE_PARM
:
5853 case TEMPLATE_TEMPLATE_PARM
:
5855 TEMPLATE_TYPE_PARM_INDEX (r
)
5856 = reduce_template_parm_level (TEMPLATE_TYPE_PARM_INDEX (t
),
5858 TYPE_STUB_DECL (r
) = TYPE_NAME (r
) = TEMPLATE_TYPE_DECL (r
);
5859 TYPE_MAIN_VARIANT (r
) = r
;
5860 TYPE_POINTER_TO (r
) = NULL_TREE
;
5861 TYPE_REFERENCE_TO (r
) = NULL_TREE
;
5863 if (TREE_CODE (t
) == TEMPLATE_TEMPLATE_PARM
5864 && TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (t
))
5866 tree argvec
= tsubst (TYPE_TI_ARGS (t
), args
, in_decl
);
5867 TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (r
)
5868 = perm_tree_cons (TYPE_NAME (t
), argvec
, NULL_TREE
);
5872 case TEMPLATE_PARM_INDEX
:
5873 r
= reduce_template_parm_level (t
, type
, levels
);
5877 my_friendly_abort (0);
5885 tree purpose
, value
, chain
, result
;
5886 int via_public
, via_virtual
, via_protected
;
5888 if (t
== void_list_node
)
5891 via_public
= TREE_VIA_PUBLIC (t
);
5892 via_protected
= TREE_VIA_PROTECTED (t
);
5893 via_virtual
= TREE_VIA_VIRTUAL (t
);
5895 purpose
= TREE_PURPOSE (t
);
5897 purpose
= tsubst (purpose
, args
, in_decl
);
5898 value
= TREE_VALUE (t
);
5900 value
= tsubst (value
, args
, in_decl
);
5901 chain
= TREE_CHAIN (t
);
5902 if (chain
&& chain
!= void_type_node
)
5903 chain
= tsubst (chain
, args
, in_decl
);
5904 if (purpose
== TREE_PURPOSE (t
)
5905 && value
== TREE_VALUE (t
)
5906 && chain
== TREE_CHAIN (t
))
5908 result
= hash_tree_cons (via_public
, via_virtual
, via_protected
,
5909 purpose
, value
, chain
);
5910 TREE_PARMLIST (result
) = TREE_PARMLIST (t
);
5914 if (type
!= NULL_TREE
)
5916 /* A binfo node. We always need to make a copy, of the node
5917 itself and of its BINFO_BASETYPES. */
5921 /* Make sure type isn't a typedef copy. */
5922 type
= BINFO_TYPE (TYPE_BINFO (type
));
5924 TREE_TYPE (t
) = complete_type (type
);
5925 if (IS_AGGR_TYPE (type
))
5927 BINFO_VTABLE (t
) = TYPE_BINFO_VTABLE (type
);
5928 BINFO_VIRTUALS (t
) = TYPE_BINFO_VIRTUALS (type
);
5929 if (TYPE_BINFO_BASETYPES (type
) != NULL_TREE
)
5930 BINFO_BASETYPES (t
) = copy_node (TYPE_BINFO_BASETYPES (type
));
5935 /* Otherwise, a vector of template arguments. */
5936 return tsubst_template_arg_vector (t
, args
);
5939 case REFERENCE_TYPE
:
5941 enum tree_code code
;
5943 if (type
== TREE_TYPE (t
))
5946 code
= TREE_CODE (t
);
5947 if (TREE_CODE (type
) == REFERENCE_TYPE
5948 || (code
== REFERENCE_TYPE
&& TREE_CODE (type
) == VOID_TYPE
))
5950 static int last_line
= 0;
5951 static char* last_file
= 0;
5953 /* We keep track of the last time we issued this error
5954 message to avoid spewing a ton of messages during a
5955 single bad template instantiation. */
5956 if (last_line
!= lineno
||
5957 last_file
!= input_filename
)
5959 if (TREE_CODE (type
) == VOID_TYPE
)
5960 cp_error ("forming reference to void");
5962 cp_error ("forming %s to reference type `%T'",
5963 (code
== POINTER_TYPE
) ? "pointer" : "reference",
5966 last_file
= input_filename
;
5969 /* Use the underlying type in an attempt at error
5970 recovery; maybe the user meant vector<int> and wrote
5971 vector<int&>, or some such. */
5972 if (code
== REFERENCE_TYPE
)
5975 r
= build_pointer_type (TREE_TYPE (type
));
5977 else if (code
== POINTER_TYPE
)
5978 r
= build_pointer_type (type
);
5980 r
= build_reference_type (type
);
5981 r
= cp_build_qualified_type (r
, TYPE_QUALS (t
));
5983 /* Will this ever be needed for TYPE_..._TO values? */
5989 r
= tsubst (TYPE_OFFSET_BASETYPE (t
), args
, in_decl
);
5990 if (! IS_AGGR_TYPE (r
))
5991 cp_error ("creating pointer to member of non-class type `%T'", r
);
5992 return build_offset_type (r
, type
);
6001 /* The TYPE_CONTEXT is not used for function/method types. */
6002 my_friendly_assert (TYPE_CONTEXT (t
) == NULL_TREE
, 0);
6004 /* Substitue the argument types. */
6005 arg_types
= tsubst_arg_types (TYPE_ARG_TYPES (t
), args
, in_decl
);
6007 /* Construct a new type node and return it. */
6008 if (TREE_CODE (t
) == FUNCTION_TYPE
)
6009 fntype
= build_function_type (type
, arg_types
);
6012 r
= TREE_TYPE (TREE_VALUE (arg_types
));
6013 if (! IS_AGGR_TYPE (r
))
6014 cp_error ("creating pointer to member function of non-class type `%T'",
6017 fntype
= build_cplus_method_type (r
, type
, TREE_CHAIN (arg_types
));
6019 fntype
= build_qualified_type (fntype
, TYPE_QUALS (t
));
6021 /* Substitue the exception specification. */
6022 raises
= TYPE_RAISES_EXCEPTIONS (t
);
6025 raises
= tsubst (raises
, args
, in_decl
);
6026 fntype
= build_exception_variant (fntype
, raises
);
6032 tree domain
= tsubst (TYPE_DOMAIN (t
), args
, in_decl
);
6033 if (type
== TREE_TYPE (t
) && domain
== TYPE_DOMAIN (t
))
6036 /* These checks should match the ones in grokdeclarator. */
6037 if (TREE_CODE (type
) == VOID_TYPE
)
6039 cp_error ("creating array of void");
6040 type
= build_pointer_type (type
);
6042 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
6044 cp_error ("creating array of functions `%T'", type
);
6045 type
= build_pointer_type (type
);
6047 else if (TREE_CODE (type
) == REFERENCE_TYPE
)
6049 cp_error ("creating array of references `%T'", type
);
6050 type
= TREE_TYPE (type
);
6053 r
= build_cplus_array_type (type
, domain
);
6059 return fold (build (TREE_CODE (t
), TREE_TYPE (t
),
6060 tsubst (TREE_OPERAND (t
, 0), args
, in_decl
),
6061 tsubst (TREE_OPERAND (t
, 1), args
, in_decl
)));
6065 return fold (build1 (TREE_CODE (t
), TREE_TYPE (t
),
6066 tsubst (TREE_OPERAND (t
, 0), args
, in_decl
)));
6070 tree ctx
= tsubst_aggr_type (TYPE_CONTEXT (t
), args
, in_decl
,
6071 /*entering_scope=*/1);
6072 tree f
= tsubst_copy (TYPENAME_TYPE_FULLNAME (t
), args
, in_decl
);
6074 /* Normally, make_typename_type does not require that the CTX
6075 have complete type in order to allow things like:
6077 template <class T> struct S { typename S<T>::X Y; };
6079 But, such constructs have already been resolved by this
6080 point, so here CTX really should have complete type, unless
6081 it's a partial instantiation. */
6082 if (!uses_template_parms (ctx
)
6083 && !complete_type_or_else (ctx
))
6084 return error_mark_node
;
6086 f
= make_typename_type (ctx
, f
);
6087 return cp_build_qualified_type (f
,
6089 | CP_TYPE_QUALS (t
));
6093 return make_pointer_declarator
6094 (type
, tsubst (TREE_OPERAND (t
, 0), args
, in_decl
));
6097 return make_reference_declarator
6098 (type
, tsubst (TREE_OPERAND (t
, 0), args
, in_decl
));
6101 return build_parse_node
6102 (ARRAY_REF
, tsubst (TREE_OPERAND (t
, 0), args
, in_decl
),
6103 tsubst_expr (TREE_OPERAND (t
, 1), args
, in_decl
));
6106 return make_call_declarator
6107 (tsubst (TREE_OPERAND (t
, 0), args
, in_decl
),
6108 tsubst_call_declarator_parms (TREE_OPERAND (t
, 1), args
, in_decl
),
6109 TREE_OPERAND (t
, 2),
6110 tsubst (TREE_TYPE (t
), args
, in_decl
));
6113 return build_parse_node
6114 (TREE_CODE (t
), tsubst (TREE_OPERAND (t
, 0), args
, in_decl
),
6115 tsubst (TREE_OPERAND (t
, 1), args
, in_decl
));
6118 return TREE_TYPE (tsubst_expr (TYPE_FIELDS (t
), args
, in_decl
));
6121 sorry ("use of `%s' in template",
6122 tree_code_name
[(int) TREE_CODE (t
)]);
6123 return error_mark_node
;
6130 emit_line_note (input_filename
, lineno
);
6134 expand_start_bindings (0);
6141 int saved_warn_unused
= 0;
6143 if (processing_template_decl
)
6145 saved_warn_unused
= warn_unused
;
6148 expand_end_bindings (getdecls (), kept_level_p (), 0);
6149 if (processing_template_decl
)
6150 warn_unused
= saved_warn_unused
;
6151 t
= poplevel (kept_level_p (), 1, 0);
6156 /* Like tsubst, but deals with expressions. This function just replaces
6157 template parms; to finish processing the resultant expression, use
6161 tsubst_copy (t
, args
, in_decl
)
6165 enum tree_code code
;
6168 if (t
== NULL_TREE
|| t
== error_mark_node
)
6171 code
= TREE_CODE (t
);
6176 return do_identifier (DECL_NAME (t
), 0, NULL_TREE
);
6183 if (!DECL_CONTEXT (t
))
6184 /* This is a global enumeration constant. */
6187 /* Unfortunately, we cannot just call lookup_name here.
6190 template <int I> int f() {
6192 struct S { void g() { E e = a; } };
6195 When we instantiate f<7>::S::g(), say, lookup_name is not
6196 clever enough to find f<7>::a. */
6198 = tsubst_aggr_type (TREE_TYPE (t
), args
, in_decl
,
6199 /*entering_scope=*/0);
6201 for (v
= TYPE_VALUES (enum_type
);
6204 if (TREE_PURPOSE (v
) == DECL_NAME (t
))
6205 return TREE_VALUE (v
);
6207 /* We didn't find the name. That should never happen; if
6208 name-lookup found it during preliminary parsing, we
6209 should find it again here during instantiation. */
6210 my_friendly_abort (0);
6215 if (DECL_CONTEXT (t
))
6219 ctx
= tsubst_aggr_type (DECL_CONTEXT (t
), args
, in_decl
,
6220 /*entering_scope=*/1);
6221 if (ctx
!= DECL_CONTEXT (t
))
6222 return lookup_field (ctx
, DECL_NAME (t
), 0, 0);
6228 if (DECL_LANG_SPECIFIC (t
) && DECL_TEMPLATE_INFO (t
))
6229 t
= tsubst (t
, args
, in_decl
);
6234 if (is_member_template (t
))
6235 return tsubst (t
, args
, in_decl
);
6241 /* We must tsbust into a LOOKUP_EXPR in case the names to
6242 which it refers is a conversion operator; in that case the
6243 name will change. We avoid making unnecessary copies,
6246 tree id
= tsubst_copy (TREE_OPERAND (t
, 0), args
, in_decl
);
6248 if (id
!= TREE_OPERAND (t
, 0))
6250 r
= build_nt (LOOKUP_EXPR
, id
);
6251 LOOKUP_EXPR_GLOBAL (r
) = LOOKUP_EXPR_GLOBAL (t
);
6259 case REINTERPRET_CAST_EXPR
:
6260 case CONST_CAST_EXPR
:
6261 case STATIC_CAST_EXPR
:
6262 case DYNAMIC_CAST_EXPR
:
6265 (code
, tsubst (TREE_TYPE (t
), args
, in_decl
),
6266 tsubst_copy (TREE_OPERAND (t
, 0), args
, in_decl
));
6269 case PREDECREMENT_EXPR
:
6270 case PREINCREMENT_EXPR
:
6271 case POSTDECREMENT_EXPR
:
6272 case POSTINCREMENT_EXPR
:
6274 case TRUTH_NOT_EXPR
:
6277 case CONVERT_EXPR
: /* Unary + */
6285 tsubst_copy (TREE_OPERAND (t
, 0), args
, in_decl
));
6290 case TRUNC_DIV_EXPR
:
6292 case FLOOR_DIV_EXPR
:
6293 case ROUND_DIV_EXPR
:
6294 case EXACT_DIV_EXPR
:
6296 case BIT_ANDTC_EXPR
:
6299 case TRUNC_MOD_EXPR
:
6300 case FLOOR_MOD_EXPR
:
6301 case TRUTH_ANDIF_EXPR
:
6302 case TRUTH_ORIF_EXPR
:
6303 case TRUTH_AND_EXPR
:
6324 (code
, tsubst_copy (TREE_OPERAND (t
, 0), args
, in_decl
),
6325 tsubst_copy (TREE_OPERAND (t
, 1), args
, in_decl
));
6329 tree fn
= TREE_OPERAND (t
, 0);
6330 if (is_overloaded_fn (fn
))
6331 fn
= tsubst_copy (get_first_fn (fn
), args
, in_decl
);
6333 /* Sometimes FN is a LOOKUP_EXPR. */
6334 fn
= tsubst_copy (fn
, args
, in_decl
);
6336 (code
, fn
, tsubst_copy (TREE_OPERAND (t
, 1), args
, in_decl
),
6340 case METHOD_CALL_EXPR
:
6342 tree name
= TREE_OPERAND (t
, 0);
6343 if (TREE_CODE (name
) == BIT_NOT_EXPR
)
6345 name
= tsubst_copy (TREE_OPERAND (name
, 0), args
, in_decl
);
6346 name
= build1 (BIT_NOT_EXPR
, NULL_TREE
, name
);
6348 else if (TREE_CODE (name
) == SCOPE_REF
6349 && TREE_CODE (TREE_OPERAND (name
, 1)) == BIT_NOT_EXPR
)
6351 tree base
= tsubst_copy (TREE_OPERAND (name
, 0), args
, in_decl
);
6352 name
= TREE_OPERAND (name
, 1);
6353 name
= tsubst_copy (TREE_OPERAND (name
, 0), args
, in_decl
);
6354 name
= build1 (BIT_NOT_EXPR
, NULL_TREE
, name
);
6355 name
= build_nt (SCOPE_REF
, base
, name
);
6358 name
= tsubst_copy (TREE_OPERAND (t
, 0), args
, in_decl
);
6360 (code
, name
, tsubst_copy (TREE_OPERAND (t
, 1), args
, in_decl
),
6361 tsubst_copy (TREE_OPERAND (t
, 2), args
, in_decl
),
6370 (code
, tsubst_copy (TREE_OPERAND (t
, 0), args
, in_decl
),
6371 tsubst_copy (TREE_OPERAND (t
, 1), args
, in_decl
),
6372 tsubst_copy (TREE_OPERAND (t
, 2), args
, in_decl
));
6374 if (code
== BIND_EXPR
&& !processing_template_decl
)
6376 /* This processing should really occur in tsubst_expr,
6377 However, tsubst_expr does not recurse into expressions,
6378 since it assumes that there aren't any statements
6379 inside them. Instead, it simply calls
6380 build_expr_from_tree. So, we need to expand the
6382 tree rtl_expr
= begin_stmt_expr ();
6383 tree block
= tsubst_expr (TREE_OPERAND (r
, 1), args
, in_decl
);
6384 r
= finish_stmt_expr (rtl_expr
, block
);
6393 (code
, tsubst_copy (TREE_OPERAND (t
, 0), args
, in_decl
),
6394 tsubst_copy (TREE_OPERAND (t
, 1), args
, in_decl
),
6395 tsubst_copy (TREE_OPERAND (t
, 2), args
, in_decl
));
6396 NEW_EXPR_USE_GLOBAL (r
) = NEW_EXPR_USE_GLOBAL (t
);
6403 (code
, tsubst_copy (TREE_OPERAND (t
, 0), args
, in_decl
),
6404 tsubst_copy (TREE_OPERAND (t
, 1), args
, in_decl
));
6405 DELETE_EXPR_USE_GLOBAL (r
) = DELETE_EXPR_USE_GLOBAL (t
);
6406 DELETE_EXPR_USE_VEC (r
) = DELETE_EXPR_USE_VEC (t
);
6410 case TEMPLATE_ID_EXPR
:
6412 /* Substituted template arguments */
6413 tree targs
= tsubst_copy (TREE_OPERAND (t
, 1), args
, in_decl
);
6415 for (chain
= targs
; chain
; chain
= TREE_CHAIN (chain
))
6416 TREE_VALUE (chain
) = maybe_fold_nontype_arg (TREE_VALUE (chain
));
6418 return lookup_template_function
6419 (tsubst_copy (TREE_OPERAND (t
, 0), args
, in_decl
), targs
);
6424 tree purpose
, value
, chain
;
6426 if (t
== void_list_node
)
6429 purpose
= TREE_PURPOSE (t
);
6431 purpose
= tsubst_copy (purpose
, args
, in_decl
);
6432 value
= TREE_VALUE (t
);
6434 value
= tsubst_copy (value
, args
, in_decl
);
6435 chain
= TREE_CHAIN (t
);
6436 if (chain
&& chain
!= void_type_node
)
6437 chain
= tsubst_copy (chain
, args
, in_decl
);
6438 if (purpose
== TREE_PURPOSE (t
)
6439 && value
== TREE_VALUE (t
)
6440 && chain
== TREE_CHAIN (t
))
6442 return tree_cons (purpose
, value
, chain
);
6449 case TEMPLATE_TYPE_PARM
:
6450 case TEMPLATE_TEMPLATE_PARM
:
6451 case TEMPLATE_PARM_INDEX
:
6453 case REFERENCE_TYPE
:
6460 return tsubst (t
, args
, in_decl
);
6462 case IDENTIFIER_NODE
:
6463 if (IDENTIFIER_TYPENAME_P (t
)
6464 /* Make sure it's not just a variable named `__opr', for instance,
6465 which can occur in some existing code. */
6467 return build_typename_overload
6468 (tsubst (TREE_TYPE (t
), args
, in_decl
));
6475 (CONSTRUCTOR
, tsubst (TREE_TYPE (t
), args
, in_decl
), NULL_TREE
,
6476 tsubst_copy (CONSTRUCTOR_ELTS (t
), args
, in_decl
));
6477 TREE_HAS_CONSTRUCTOR (r
) = TREE_HAS_CONSTRUCTOR (t
);
6486 /* Like tsubst_copy, but also does semantic processing and RTL expansion. */
6489 tsubst_expr (t
, args
, in_decl
)
6493 if (t
== NULL_TREE
|| t
== error_mark_node
)
6496 if (processing_template_decl
)
6497 return tsubst_copy (t
, args
, in_decl
);
6499 switch (TREE_CODE (t
))
6502 lineno
= TREE_COMPLEXITY (t
);
6503 finish_return_stmt (tsubst_expr (RETURN_EXPR (t
),
6508 lineno
= TREE_COMPLEXITY (t
);
6509 finish_expr_stmt (tsubst_expr (EXPR_STMT_EXPR (t
),
6515 int i
= suspend_momentary ();
6518 lineno
= TREE_COMPLEXITY (t
);
6519 emit_line_note (input_filename
, lineno
);
6521 (tsubst (TREE_OPERAND (t
, 0), args
, in_decl
),
6522 tsubst (TREE_OPERAND (t
, 1), args
, in_decl
),
6523 TREE_OPERAND (t
, 2) != 0, NULL_TREE
, NULL_TREE
);
6524 init
= tsubst_expr (TREE_OPERAND (t
, 2), args
, in_decl
);
6526 (dcl
, init
, NULL_TREE
, 1, /*init ? LOOKUP_ONLYCONVERTING :*/ 0);
6527 resume_momentary (i
);
6534 lineno
= TREE_COMPLEXITY (t
);
6537 for (tmp
= FOR_INIT_STMT (t
); tmp
; tmp
= TREE_CHAIN (tmp
))
6538 tsubst_expr (tmp
, args
, in_decl
);
6539 finish_for_init_stmt (NULL_TREE
);
6540 finish_for_cond (tsubst_expr (FOR_COND (t
), args
,
6543 tmp
= tsubst_expr (FOR_EXPR (t
), args
, in_decl
);
6544 finish_for_expr (tmp
, NULL_TREE
);
6545 tsubst_expr (FOR_BODY (t
), args
, in_decl
);
6546 finish_for_stmt (tmp
, NULL_TREE
);
6552 lineno
= TREE_COMPLEXITY (t
);
6553 begin_while_stmt ();
6554 finish_while_stmt_cond (tsubst_expr (WHILE_COND (t
),
6557 tsubst_expr (WHILE_BODY (t
), args
, in_decl
);
6558 finish_while_stmt (NULL_TREE
);
6564 lineno
= TREE_COMPLEXITY (t
);
6566 tsubst_expr (DO_BODY (t
), args
, in_decl
);
6567 finish_do_body (NULL_TREE
);
6568 finish_do_stmt (tsubst_expr (DO_COND (t
), args
,
6578 lineno
= TREE_COMPLEXITY (t
);
6580 finish_if_stmt_cond (tsubst_expr (IF_COND (t
),
6584 if (tmp
= THEN_CLAUSE (t
), tmp
)
6586 tsubst_expr (tmp
, args
, in_decl
);
6587 finish_then_clause (NULL_TREE
);
6590 if (tmp
= ELSE_CLAUSE (t
), tmp
)
6592 begin_else_clause ();
6593 tsubst_expr (tmp
, args
, in_decl
);
6594 finish_else_clause (NULL_TREE
);
6605 lineno
= TREE_COMPLEXITY (t
);
6606 begin_compound_stmt (COMPOUND_STMT_NO_SCOPE (t
));
6607 for (substmt
= COMPOUND_BODY (t
);
6608 substmt
!= NULL_TREE
;
6609 substmt
= TREE_CHAIN (substmt
))
6610 tsubst_expr (substmt
, args
, in_decl
);
6611 return finish_compound_stmt (COMPOUND_STMT_NO_SCOPE (t
),
6617 lineno
= TREE_COMPLEXITY (t
);
6618 finish_break_stmt ();
6622 lineno
= TREE_COMPLEXITY (t
);
6623 finish_continue_stmt ();
6630 lineno
= TREE_COMPLEXITY (t
);
6631 begin_switch_stmt ();
6632 val
= tsubst_expr (SWITCH_COND (t
), args
, in_decl
);
6633 finish_switch_cond (val
);
6635 if (tmp
= TREE_OPERAND (t
, 1), tmp
)
6636 tsubst_expr (tmp
, args
, in_decl
);
6638 finish_switch_stmt (val
, NULL_TREE
);
6643 finish_case_label (tsubst_expr (CASE_LOW (t
), args
, in_decl
),
6644 tsubst_expr (CASE_HIGH (t
), args
, in_decl
));
6648 t
= define_label (DECL_SOURCE_FILE (t
), DECL_SOURCE_LINE (t
),
6655 lineno
= TREE_COMPLEXITY (t
);
6656 t
= GOTO_DESTINATION (t
);
6657 if (TREE_CODE (t
) != IDENTIFIER_NODE
)
6658 /* Computed goto's must be tsubst'd into. On the other hand,
6659 non-computed gotos must not be; the identifier in question
6660 will have no binding. */
6661 t
= tsubst_expr (t
, args
, in_decl
);
6662 finish_goto_stmt (t
);
6666 lineno
= TREE_COMPLEXITY (t
);
6667 finish_asm_stmt (tsubst_expr (ASM_CV_QUAL (t
), args
, in_decl
),
6668 tsubst_expr (ASM_STRING (t
), args
, in_decl
),
6669 tsubst_expr (ASM_OUTPUTS (t
), args
, in_decl
),
6670 tsubst_expr (ASM_INPUTS (t
), args
, in_decl
),
6671 tsubst_expr (ASM_CLOBBERS (t
), args
, in_decl
));
6675 lineno
= TREE_COMPLEXITY (t
);
6677 tsubst_expr (TRY_STMTS (t
), args
, in_decl
);
6678 finish_try_block (NULL_TREE
);
6680 tree handler
= TRY_HANDLERS (t
);
6681 for (; handler
; handler
= TREE_CHAIN (handler
))
6682 tsubst_expr (handler
, args
, in_decl
);
6684 finish_handler_sequence (NULL_TREE
);
6688 lineno
= TREE_COMPLEXITY (t
);
6690 if (HANDLER_PARMS (t
))
6692 tree d
= HANDLER_PARMS (t
);
6693 expand_start_catch_block
6694 (tsubst (TREE_OPERAND (d
, 1), args
, in_decl
),
6695 tsubst (TREE_OPERAND (d
, 0), args
, in_decl
));
6698 expand_start_catch_block (NULL_TREE
, NULL_TREE
);
6699 finish_handler_parms (NULL_TREE
);
6700 tsubst_expr (HANDLER_BODY (t
), args
, in_decl
);
6701 finish_handler (NULL_TREE
);
6705 lineno
= TREE_COMPLEXITY (t
);
6707 if (TREE_CODE (t
) == ENUMERAL_TYPE
)
6708 tsubst (t
, args
, NULL_TREE
);
6712 return build_expr_from_tree (tsubst_copy (t
, args
, in_decl
));
6717 /* Instantiate the indicated variable or function template TMPL with
6718 the template arguments in TARG_PTR. */
6721 instantiate_template (tmpl
, targ_ptr
)
6722 tree tmpl
, targ_ptr
;
6728 struct obstack
*old_fmp_obstack
;
6729 extern struct obstack
*function_maybepermanent_obstack
;
6732 if (tmpl
== error_mark_node
)
6733 return error_mark_node
;
6735 my_friendly_assert (TREE_CODE (tmpl
) == TEMPLATE_DECL
, 283);
6737 /* Check to see if we already have this specialization. */
6738 spec
= retrieve_specialization (tmpl
, targ_ptr
);
6739 if (spec
!= NULL_TREE
)
6742 if (DECL_TEMPLATE_INFO (tmpl
))
6744 /* The TMPL is a partial instantiation. To get a full set of
6745 arguments we must add the arguments used to perform the
6746 partial instantiation. */
6747 targ_ptr
= add_outermost_template_args (DECL_TI_ARGS (tmpl
),
6749 gen_tmpl
= most_general_template (tmpl
);
6751 /* Check to see if we already have this specialization. */
6752 spec
= retrieve_specialization (gen_tmpl
, targ_ptr
);
6753 if (spec
!= NULL_TREE
)
6759 push_obstacks (&permanent_obstack
, &permanent_obstack
);
6760 old_fmp_obstack
= function_maybepermanent_obstack
;
6761 function_maybepermanent_obstack
= &permanent_obstack
;
6763 len
= DECL_NTPARMS (gen_tmpl
);
6764 inner_args
= innermost_args (targ_ptr
);
6768 tree t
= TREE_VEC_ELT (inner_args
, i
);
6769 if (TREE_CODE_CLASS (TREE_CODE (t
)) == 't')
6771 tree nt
= target_type (t
);
6772 if (IS_AGGR_TYPE (nt
) && decl_function_context (TYPE_MAIN_DECL (nt
)))
6774 cp_error ("type `%T' composed from a local class is not a valid template-argument", t
);
6775 cp_error (" trying to instantiate `%D'", gen_tmpl
);
6776 fndecl
= error_mark_node
;
6781 targ_ptr
= copy_to_permanent (targ_ptr
);
6783 /* substitute template parameters */
6784 fndecl
= tsubst (DECL_RESULT (gen_tmpl
), targ_ptr
, gen_tmpl
);
6785 /* The DECL_TI_TEMPLATE should always be the immediate parent
6786 template, not the most general template. */
6787 DECL_TI_TEMPLATE (fndecl
) = tmpl
;
6789 if (flag_external_templates
)
6790 add_pending_template (fndecl
);
6793 function_maybepermanent_obstack
= old_fmp_obstack
;
6799 /* Push the name of the class template into the scope of the instantiation. */
6802 overload_template_name (type
)
6805 tree id
= DECL_NAME (CLASSTYPE_TI_TEMPLATE (type
));
6808 if (IDENTIFIER_CLASS_VALUE (id
)
6809 && TREE_TYPE (IDENTIFIER_CLASS_VALUE (id
)) == type
)
6812 decl
= build_decl (TYPE_DECL
, id
, type
);
6813 SET_DECL_ARTIFICIAL (decl
);
6814 pushdecl_class_level (decl
);
6817 /* Like type_unification but designed specially to handle conversion
6820 The FN is a TEMPLATE_DECL for a function. The ARGS are the
6821 arguments that are being used when calling it.
6823 If FN is a conversion operator, RETURN_TYPE is the type desired as
6824 the result of the conversion operator.
6826 The EXTRA_FN_ARG, if any, is the type of an additional
6827 parameter to be added to the beginning of FN's parameter list.
6829 The other arguments are as for type_unification. */
6832 fn_type_unification (fn
, explicit_targs
, targs
, args
, return_type
,
6833 strict
, extra_fn_arg
)
6834 tree fn
, explicit_targs
, targs
, args
, return_type
;
6835 unification_kind_t strict
;
6840 my_friendly_assert (TREE_CODE (fn
) == TEMPLATE_DECL
, 0);
6842 parms
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
6844 if (DECL_CONV_FN_P (fn
))
6846 /* This is a template conversion operator. Use the return types
6847 as well as the argument types. */
6848 parms
= scratch_tree_cons (NULL_TREE
,
6849 TREE_TYPE (TREE_TYPE (fn
)),
6851 args
= scratch_tree_cons (NULL_TREE
, return_type
, args
);
6854 if (extra_fn_arg
!= NULL_TREE
)
6855 parms
= scratch_tree_cons (NULL_TREE
, extra_fn_arg
, parms
);
6857 /* We allow incomplete unification without an error message here
6858 because the standard doesn't seem to explicitly prohibit it. Our
6859 callers must be ready to deal with unification failures in any
6861 return type_unification (DECL_INNERMOST_TEMPLATE_PARMS (fn
),
6870 /* Type unification.
6872 We have a function template signature with one or more references to
6873 template parameters, and a parameter list we wish to fit to this
6874 template. If possible, produce a list of parameters for the template
6875 which will cause it to fit the supplied parameter list.
6877 Return zero for success, 2 for an incomplete match that doesn't resolve
6878 all the types, and 1 for complete failure. An error message will be
6879 printed only for an incomplete match.
6881 TPARMS[NTPARMS] is an array of template parameter types.
6883 TARGS[NTPARMS] is the array into which the deduced template
6884 parameter values are placed. PARMS is the function template's
6885 signature (using TEMPLATE_PARM_IDX nodes), and ARGS is the argument
6886 list we're trying to match against it.
6888 The EXPLICIT_TARGS are explicit template arguments provided via a
6891 The parameter STRICT is one of:
6894 We are deducing arguments for a function call, as in
6898 We are deducing arguments for a conversion function, as in
6902 We are deducing arguments when calculating the partial
6903 ordering between specializations of function or class
6904 templates, as in [temp.func.order] and [temp.class.order],
6905 when doing an explicit instantiation as in [temp.explicit],
6906 when determining an explicit specialization as in
6907 [temp.expl.spec], or when taking the address of a function
6908 template, as in [temp.deduct.funcaddr]. */
6911 type_unification (tparms
, targs
, parms
, args
, explicit_targs
,
6912 strict
, allow_incomplete
)
6913 tree tparms
, targs
, parms
, args
, explicit_targs
;
6914 unification_kind_t strict
;
6915 int allow_incomplete
;
6920 for (i
= 0; i
< TREE_VEC_LENGTH (tparms
); i
++)
6921 TREE_VEC_ELT (targs
, i
) = NULL_TREE
;
6923 if (explicit_targs
!= NULL_TREE
)
6926 arg_vec
= coerce_template_parms (tparms
, explicit_targs
, NULL_TREE
, 0,
6929 if (arg_vec
== error_mark_node
)
6932 explicit_mask
= alloca (sizeof (int) * TREE_VEC_LENGTH (targs
));
6933 bzero ((char *) explicit_mask
, sizeof(int) * TREE_VEC_LENGTH (targs
));
6936 i
< TREE_VEC_LENGTH (arg_vec
)
6937 && TREE_VEC_ELT (arg_vec
, i
) != NULL_TREE
;
6940 TREE_VEC_ELT (targs
, i
) = TREE_VEC_ELT (arg_vec
, i
);
6941 /* Let unify know that this argument was explicit. */
6942 explicit_mask
[i
] = 1;
6949 type_unification_real (tparms
, targs
, parms
, args
, 0,
6950 strict
, allow_incomplete
, explicit_mask
);
6953 /* Adjust types before performing type deduction, as described in
6954 [temp.deduct.call] and [temp.deduct.conv]. The rules in these two
6955 sections are symmetric. PARM is the type of a function parameter
6956 or the return type of the conversion function. ARG is the type of
6957 the argument passed to the call, or the type of the value
6958 intialized with the result of the conversion function. */
6961 maybe_adjust_types_for_deduction (strict
, parm
, arg
)
6962 unification_kind_t strict
;
6973 /* Swap PARM and ARG throughout the remainder of this
6974 function; the handling is precisely symmetric since PARM
6975 will initialize ARG rather than vice versa. */
6983 /* There is nothing to do in this case. */
6987 my_friendly_abort (0);
6990 if (TREE_CODE (*parm
) != REFERENCE_TYPE
)
6992 /* [temp.deduct.call]
6994 If P is not a reference type:
6996 --If A is an array type, the pointer type produced by the
6997 array-to-pointer standard conversion (_conv.array_) is
6998 used in place of A for type deduction; otherwise,
7000 --If A is a function type, the pointer type produced by
7001 the function-to-pointer standard conversion
7002 (_conv.func_) is used in place of A for type deduction;
7005 --If A is a cv-qualified type, the top level
7006 cv-qualifiers of A's type are ignored for type
7008 if (TREE_CODE (*arg
) == ARRAY_TYPE
)
7009 *arg
= build_pointer_type (TREE_TYPE (*arg
));
7010 else if (TREE_CODE (*arg
) == FUNCTION_TYPE
)
7011 *arg
= build_pointer_type (*arg
);
7013 *arg
= TYPE_MAIN_VARIANT (*arg
);
7016 /* [temp.deduct.call]
7018 If P is a cv-qualified type, the top level cv-qualifiers
7019 of P's type are ignored for type deduction. If P is a
7020 reference type, the type referred to by P is used for
7022 *parm
= TYPE_MAIN_VARIANT (*parm
);
7023 if (TREE_CODE (*parm
) == REFERENCE_TYPE
)
7024 *parm
= TREE_TYPE (*parm
);
7027 /* Like type_unfication. EXPLICIT_MASK, if non-NULL, is an array of
7028 integers, with ones in positions corresponding to arguments in
7029 targs that were provided explicitly, and zeros elsewhere.
7031 If SUBR is 1, we're being called recursively (to unify the
7032 arguments of a function or method parameter of a function
7036 type_unification_real (tparms
, targs
, parms
, args
, subr
,
7037 strict
, allow_incomplete
, explicit_mask
)
7038 tree tparms
, targs
, parms
, args
;
7040 unification_kind_t strict
;
7041 int allow_incomplete
;
7046 int ntparms
= TREE_VEC_LENGTH (tparms
);
7049 my_friendly_assert (TREE_CODE (tparms
) == TREE_VEC
, 289);
7050 my_friendly_assert (parms
== NULL_TREE
7051 || TREE_CODE (parms
) == TREE_LIST
, 290);
7052 /* ARGS could be NULL (via a call from parse.y to
7053 build_x_function_call). */
7055 my_friendly_assert (TREE_CODE (args
) == TREE_LIST
, 291);
7056 my_friendly_assert (ntparms
> 0, 292);
7061 sub_strict
= UNIFY_ALLOW_MORE_CV_QUAL
| UNIFY_ALLOW_DERIVED
;
7065 sub_strict
= UNIFY_ALLOW_LESS_CV_QUAL
;
7069 sub_strict
= UNIFY_ALLOW_NONE
;
7073 my_friendly_abort (0);
7077 && parms
!= void_list_node
7079 && args
!= void_list_node
)
7081 parm
= TREE_VALUE (parms
);
7082 parms
= TREE_CHAIN (parms
);
7083 arg
= TREE_VALUE (args
);
7084 args
= TREE_CHAIN (args
);
7086 if (arg
== error_mark_node
)
7088 if (arg
== unknown_type_node
)
7089 /* We can't deduce anything from this, but we might get all the
7090 template args from other function args. */
7093 /* Conversions will be performed on a function argument that
7094 corresponds with a function parameter that contains only
7095 non-deducible template parameters and explicitly specified
7096 template parameters. */
7097 if (! uses_template_parms (parm
))
7101 if (TREE_CODE_CLASS (TREE_CODE (arg
)) != 't')
7102 type
= TREE_TYPE (arg
);
7109 if (strict
== DEDUCE_EXACT
)
7111 if (same_type_p (parm
, type
))
7115 /* It might work; we shouldn't check now, because we might
7116 get into infinite recursion. Overload resolution will
7124 if (TREE_CODE (arg
) == VAR_DECL
)
7125 arg
= TREE_TYPE (arg
);
7126 else if (TREE_CODE_CLASS (TREE_CODE (arg
)) == 'e')
7127 arg
= TREE_TYPE (arg
);
7129 if (TREE_CODE_CLASS (TREE_CODE (arg
)) != 't')
7131 my_friendly_assert (TREE_TYPE (arg
) != NULL_TREE
, 293);
7132 if (type_unknown_p (arg
))
7134 /* [temp.deduct.type] A template-argument can be deduced from
7135 a pointer to function or pointer to member function
7136 argument if the set of overloaded functions does not
7137 contain function templates and at most one of a set of
7138 overloaded functions provides a unique match. */
7140 if (resolve_overloaded_unification
7141 (tparms
, targs
, parm
, arg
, strict
, sub_strict
, explicit_mask
)
7146 arg
= TREE_TYPE (arg
);
7150 maybe_adjust_types_for_deduction (strict
, &parm
, &arg
);
7152 switch (unify (tparms
, targs
, parm
, arg
, sub_strict
,
7161 /* Fail if we've reached the end of the parm list, and more args
7162 are present, and the parm list isn't variadic. */
7163 if (args
&& args
!= void_list_node
&& parms
== void_list_node
)
7165 /* Fail if parms are left and they don't have default values. */
7167 && parms
!= void_list_node
7168 && TREE_PURPOSE (parms
) == NULL_TREE
)
7171 for (i
= 0; i
< ntparms
; i
++)
7172 if (TREE_VEC_ELT (targs
, i
) == NULL_TREE
)
7174 if (!allow_incomplete
)
7175 error ("incomplete type unification");
7181 /* Subroutine of type_unification_real. Args are like the variables at the
7182 call site. ARG is an overloaded function (or template-id); we try
7183 deducing template args from each of the overloads, and if only one
7184 succeeds, we go with that. Modifies TARGS and returns 0 on success. */
7187 resolve_overloaded_unification (tparms
, targs
, parm
, arg
, strict
,
7188 sub_strict
, explicit_mask
)
7189 tree tparms
, targs
, parm
, arg
;
7190 unification_kind_t strict
;
7194 tree tempargs
= copy_node (targs
);
7197 if (TREE_CODE (arg
) == ADDR_EXPR
)
7198 arg
= TREE_OPERAND (arg
, 0);
7200 if (TREE_CODE (arg
) == COMPONENT_REF
)
7201 /* Handle `&x' where `x' is some static or non-static member
7203 arg
= TREE_OPERAND (arg
, 1);
7205 /* Strip baselink information. */
7206 while (TREE_CODE (arg
) == TREE_LIST
)
7207 arg
= TREE_VALUE (arg
);
7209 if (TREE_CODE (arg
) == TEMPLATE_ID_EXPR
)
7211 /* If we got some explicit template args, we need to plug them into
7212 the affected templates before we try to unify, in case the
7213 explicit args will completely resolve the templates in question. */
7215 tree expl_subargs
= TREE_OPERAND (arg
, 1);
7216 arg
= TREE_OPERAND (arg
, 0);
7218 for (; arg
; arg
= OVL_NEXT (arg
))
7220 tree fn
= OVL_CURRENT (arg
);
7223 if (TREE_CODE (fn
) != TEMPLATE_DECL
)
7226 subargs
= get_bindings_overload (fn
, DECL_RESULT (fn
), expl_subargs
);
7229 elem
= tsubst (TREE_TYPE (fn
), subargs
, NULL_TREE
);
7230 if (TREE_CODE (elem
) == METHOD_TYPE
)
7231 elem
= build_ptrmemfunc_type (build_pointer_type (elem
));
7232 good
+= try_one_overload (tparms
, targs
, tempargs
, parm
, elem
,
7233 strict
, sub_strict
, explicit_mask
);
7237 else if (TREE_CODE (arg
) == OVERLOAD
)
7239 for (; arg
; arg
= OVL_NEXT (arg
))
7241 tree type
= TREE_TYPE (OVL_CURRENT (arg
));
7242 if (TREE_CODE (type
) == METHOD_TYPE
)
7243 type
= build_ptrmemfunc_type (build_pointer_type (type
));
7244 good
+= try_one_overload (tparms
, targs
, tempargs
, parm
,
7246 strict
, sub_strict
, explicit_mask
);
7250 my_friendly_abort (981006);
7252 /* [temp.deduct.type] A template-argument can be deduced from a pointer
7253 to function or pointer to member function argument if the set of
7254 overloaded functions does not contain function templates and at most
7255 one of a set of overloaded functions provides a unique match.
7257 So if we found multiple possibilities, we return success but don't
7262 int i
= TREE_VEC_LENGTH (targs
);
7264 if (TREE_VEC_ELT (tempargs
, i
))
7265 TREE_VEC_ELT (targs
, i
) = TREE_VEC_ELT (tempargs
, i
);
7273 /* Subroutine of resolve_overloaded_unification; does deduction for a single
7274 overload. Fills TARGS with any deduced arguments, or error_mark_node if
7275 different overloads deduce different arguments for a given parm.
7276 Returns 1 on success. */
7279 try_one_overload (tparms
, orig_targs
, targs
, parm
, arg
, strict
,
7280 sub_strict
, explicit_mask
)
7281 tree tparms
, orig_targs
, targs
, parm
, arg
;
7282 unification_kind_t strict
;
7290 /* [temp.deduct.type] A template-argument can be deduced from a pointer
7291 to function or pointer to member function argument if the set of
7292 overloaded functions does not contain function templates and at most
7293 one of a set of overloaded functions provides a unique match.
7295 So if this is a template, just return success. */
7297 if (uses_template_parms (arg
))
7300 maybe_adjust_types_for_deduction (strict
, &parm
, &arg
);
7302 /* We don't copy orig_targs for this because if we have already deduced
7303 some template args from previous args, unify would complain when we
7304 try to deduce a template parameter for the same argument, even though
7305 there isn't really a conflict. */
7306 nargs
= TREE_VEC_LENGTH (targs
);
7307 tempargs
= make_scratch_vec (nargs
);
7309 if (unify (tparms
, tempargs
, parm
, arg
, sub_strict
, explicit_mask
) != 0)
7312 /* First make sure we didn't deduce anything that conflicts with
7313 explicitly specified args. */
7314 for (i
= nargs
; i
--; )
7316 tree elt
= TREE_VEC_ELT (tempargs
, i
);
7317 tree oldelt
= TREE_VEC_ELT (orig_targs
, i
);
7319 if (elt
== NULL_TREE
)
7321 else if (uses_template_parms (elt
))
7323 /* Since we're unifying against ourselves, we will fill in template
7324 args used in the function parm list with our own template parms.
7326 TREE_VEC_ELT (tempargs
, i
) = NULL_TREE
;
7329 else if (oldelt
&& ! template_args_equal (oldelt
, elt
))
7333 for (i
= nargs
; i
--; )
7335 tree elt
= TREE_VEC_ELT (tempargs
, i
);
7338 TREE_VEC_ELT (targs
, i
) = elt
;
7344 /* Returns the level of DECL, which declares a template parameter. */
7347 template_decl_level (decl
)
7350 switch (TREE_CODE (decl
))
7354 return TEMPLATE_TYPE_LEVEL (TREE_TYPE (decl
));
7357 return TEMPLATE_PARM_LEVEL (DECL_INITIAL (decl
));
7360 my_friendly_abort (0);
7365 /* Decide whether ARG can be unified with PARM, considering only the
7366 cv-qualifiers of each type, given STRICT as documented for unify.
7367 Returns non-zero iff the unification is OK on that basis.*/
7370 check_cv_quals_for_unify (strict
, arg
, parm
)
7375 return !((!(strict
& UNIFY_ALLOW_MORE_CV_QUAL
)
7376 && !at_least_as_qualified_p (arg
, parm
))
7377 || (!(strict
& UNIFY_ALLOW_LESS_CV_QUAL
)
7378 && (!at_least_as_qualified_p (parm
, arg
))));
7381 /* Takes parameters as for type_unification. Returns 0 if the
7382 type deduction suceeds, 1 otherwise. The parameter STRICT is a
7383 bitwise or of the following flags:
7386 Require an exact match between PARM and ARG.
7387 UNIFY_ALLOW_MORE_CV_QUAL:
7388 Allow the deduced ARG to be more cv-qualified than ARG.
7389 UNIFY_ALLOW_LESS_CV_QUAL:
7390 Allow the deduced ARG to be less cv-qualified than ARG.
7391 UNIFY_ALLOW_DERIVED:
7392 Allow the deduced ARG to be a template base class of ARG,
7393 or a pointer to a template base class of the type pointed to by
7395 UNIFY_ALLOW_INTEGER:
7396 Allow any integral type to be deduced. See the TEMPLATE_PARM_INDEX
7397 case for more information. */
7400 unify (tparms
, targs
, parm
, arg
, strict
, explicit_mask
)
7401 tree tparms
, targs
, parm
, arg
;
7409 /* I don't think this will do the right thing with respect to types.
7410 But the only case I've seen it in so far has been array bounds, where
7411 signedness is the only information lost, and I think that will be
7413 while (TREE_CODE (parm
) == NOP_EXPR
)
7414 parm
= TREE_OPERAND (parm
, 0);
7416 if (arg
== error_mark_node
)
7418 if (arg
== unknown_type_node
)
7419 /* We can't deduce anything from this, but we might get all the
7420 template args from other function args. */
7423 /* If PARM uses template parameters, then we can't bail out here,
7424 even if ARG == PARM, since we won't record unifications for the
7425 template parameters. We might need them if we're trying to
7426 figure out which of two things is more specialized. */
7427 if (arg
== parm
&& !uses_template_parms (parm
))
7430 /* Immediately reject some pairs that won't unify because of
7431 cv-qualification mismatches. */
7432 if (TREE_CODE (arg
) == TREE_CODE (parm
)
7433 && TREE_CODE_CLASS (TREE_CODE (arg
)) == 't'
7434 /* We check the cv-qualifiers when unifying with template type
7435 parameters below. We want to allow ARG `const T' to unify with
7436 PARM `T' for example, when computing which of two templates
7437 is more specialized, for example. */
7438 && TREE_CODE (arg
) != TEMPLATE_TYPE_PARM
7439 && !check_cv_quals_for_unify (strict
, arg
, parm
))
7442 switch (TREE_CODE (parm
))
7445 /* In a type which contains a nested-name-specifier, template
7446 argument values cannot be deduced for template parameters used
7447 within the nested-name-specifier. */
7450 case TEMPLATE_TYPE_PARM
:
7451 case TEMPLATE_TEMPLATE_PARM
:
7452 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, 0));
7454 if (TEMPLATE_TYPE_LEVEL (parm
)
7455 != template_decl_level (tparm
))
7456 /* The PARM is not one we're trying to unify. Just check
7457 to see if it matches ARG. */
7458 return (TREE_CODE (arg
) == TREE_CODE (parm
)
7459 && same_type_p (parm
, arg
)) ? 0 : 1;
7460 idx
= TEMPLATE_TYPE_IDX (parm
);
7461 targ
= TREE_VEC_ELT (targs
, idx
);
7462 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, idx
));
7464 /* Check for mixed types and values. */
7465 if ((TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
7466 && TREE_CODE (tparm
) != TYPE_DECL
)
7467 || (TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
7468 && TREE_CODE (tparm
) != TEMPLATE_DECL
))
7471 if (!strict
&& targ
!= NULL_TREE
7472 && explicit_mask
&& explicit_mask
[idx
])
7473 /* An explicit template argument. Don't even try to match
7474 here; the overload resolution code will manage check to
7475 see whether the call is legal. */
7478 if (TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
)
7480 if (TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (parm
))
7482 /* We arrive here when PARM does not involve template
7485 /* ARG must be constructed from a template class. */
7486 if (TREE_CODE (arg
) != RECORD_TYPE
|| !CLASSTYPE_TEMPLATE_INFO (arg
))
7490 tree parmtmpl
= TYPE_TI_TEMPLATE (parm
);
7491 tree parmvec
= TYPE_TI_ARGS (parm
);
7492 tree argvec
= CLASSTYPE_TI_ARGS (arg
);
7494 = DECL_INNERMOST_TEMPLATE_PARMS (CLASSTYPE_TI_TEMPLATE (arg
));
7497 /* The parameter and argument roles have to be switched here
7498 in order to handle default arguments properly. For example,
7499 template<template <class> class TT> void f(TT<int>)
7500 should be able to accept vector<int> which comes from
7501 template <class T, class Allocator = allocator>
7504 if (coerce_template_parms (argtmplvec
, parmvec
, parmtmpl
, 1, 1)
7508 /* Deduce arguments T, i from TT<T> or TT<i>.
7509 We check each element of PARMVEC and ARGVEC individually
7510 rather than the whole TREE_VEC since they can have
7511 different number of elements. */
7513 for (i
= 0; i
< TREE_VEC_LENGTH (parmvec
); ++i
)
7515 tree t
= TREE_VEC_ELT (parmvec
, i
);
7517 if (unify (tparms
, targs
, t
,
7518 TREE_VEC_ELT (argvec
, i
),
7519 UNIFY_ALLOW_NONE
, explicit_mask
))
7523 arg
= CLASSTYPE_TI_TEMPLATE (arg
);
7528 /* If PARM is `const T' and ARG is only `int', we don't have
7529 a match unless we are allowing additional qualification.
7530 If ARG is `const int' and PARM is just `T' that's OK;
7531 that binds `const int' to `T'. */
7532 if (!check_cv_quals_for_unify (strict
| UNIFY_ALLOW_LESS_CV_QUAL
,
7536 /* Consider the case where ARG is `const volatile int' and
7537 PARM is `const T'. Then, T should be `volatile int'. */
7539 cp_build_qualified_type (arg
,
7541 & ~CP_TYPE_QUALS (parm
));
7544 /* Simple cases: Value already set, does match or doesn't. */
7545 if (targ
!= NULL_TREE
7546 && (same_type_p (targ
, arg
)
7547 || (explicit_mask
&& explicit_mask
[idx
])))
7552 /* Make sure that ARG is not a variable-sized array. (Note that
7553 were talking about variable-sized arrays (like `int[n]'),
7554 rather than arrays of unknown size (like `int[]').) We'll
7555 get very confused by such a type since the bound of the array
7556 will not be computable in an instantiation. Besides, such
7557 types are not allowed in ISO C++, so we can do as we please
7559 if (TREE_CODE (arg
) == ARRAY_TYPE
7560 && !uses_template_parms (arg
)
7561 && (TREE_CODE (TYPE_MAX_VALUE (TYPE_DOMAIN (arg
)))
7565 TREE_VEC_ELT (targs
, idx
) = arg
;
7568 case TEMPLATE_PARM_INDEX
:
7569 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, 0));
7571 if (TEMPLATE_PARM_LEVEL (parm
)
7572 != template_decl_level (tparm
))
7573 /* The PARM is not one we're trying to unify. Just check
7574 to see if it matches ARG. */
7575 return (TREE_CODE (arg
) == TREE_CODE (parm
)
7576 && cp_tree_equal (parm
, arg
) > 0) ? 0 : 1;
7578 idx
= TEMPLATE_PARM_IDX (parm
);
7579 targ
= TREE_VEC_ELT (targs
, idx
);
7583 int i
= (cp_tree_equal (targ
, arg
) > 0);
7589 my_friendly_abort (42);
7592 /* [temp.deduct.type] If, in the declaration of a function template
7593 with a non-type template-parameter, the non-type
7594 template-parameter is used in an expression in the function
7595 parameter-list and, if the corresponding template-argument is
7596 deduced, the template-argument type shall match the type of the
7597 template-parameter exactly, except that a template-argument
7598 deduced from an array bound may be of any integral type. */
7599 if (same_type_p (TREE_TYPE (arg
), TREE_TYPE (parm
)))
7601 else if ((strict
& UNIFY_ALLOW_INTEGER
)
7602 && (TREE_CODE (TREE_TYPE (parm
)) == INTEGER_TYPE
7603 || TREE_CODE (TREE_TYPE (parm
)) == BOOLEAN_TYPE
))
7608 TREE_VEC_ELT (targs
, idx
) = copy_to_permanent (arg
);
7615 if (TREE_CODE (arg
) == RECORD_TYPE
&& TYPE_PTRMEMFUNC_FLAG (arg
))
7616 return (unify (tparms
, targs
, parm
,
7617 TYPE_PTRMEMFUNC_FN_TYPE (arg
), strict
,
7620 if (TREE_CODE (arg
) != POINTER_TYPE
)
7623 /* [temp.deduct.call]
7625 A can be another pointer or pointer to member type that can
7626 be converted to the deduced A via a qualification
7627 conversion (_conv.qual_).
7629 We pass down STRICT here rather than UNIFY_ALLOW_NONE.
7630 This will allow for additional cv-qualification of the
7631 pointed-to types if appropriate. In general, this is a bit
7632 too generous; we are only supposed to allow qualification
7633 conversions and this method will allow an ARG of char** and
7634 a deduced ARG of const char**. However, overload
7635 resolution will subsequently invalidate the candidate, so
7636 this is probably OK. */
7637 sub_strict
= strict
;
7639 if (TREE_CODE (TREE_TYPE (arg
)) != RECORD_TYPE
7640 || TYPE_PTRMEMFUNC_FLAG (TREE_TYPE (arg
)))
7641 /* The derived-to-base conversion only persists through one
7642 level of pointers. */
7643 sub_strict
&= ~UNIFY_ALLOW_DERIVED
;
7645 return unify (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE
7646 (arg
), sub_strict
, explicit_mask
);
7649 case REFERENCE_TYPE
:
7650 if (TREE_CODE (arg
) != REFERENCE_TYPE
)
7652 return unify (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
7653 UNIFY_ALLOW_NONE
, explicit_mask
);
7656 if (TREE_CODE (arg
) != ARRAY_TYPE
)
7658 if ((TYPE_DOMAIN (parm
) == NULL_TREE
)
7659 != (TYPE_DOMAIN (arg
) == NULL_TREE
))
7661 if (TYPE_DOMAIN (parm
) != NULL_TREE
7662 && unify (tparms
, targs
, TYPE_DOMAIN (parm
),
7663 TYPE_DOMAIN (arg
), UNIFY_ALLOW_NONE
, explicit_mask
) != 0)
7665 return unify (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
7666 UNIFY_ALLOW_NONE
, explicit_mask
);
7673 if (TREE_CODE (arg
) != TREE_CODE (parm
))
7676 if (TREE_CODE (parm
) == INTEGER_TYPE
7677 && TREE_CODE (TYPE_MAX_VALUE (parm
)) != INTEGER_CST
)
7679 if (TYPE_MIN_VALUE (parm
) && TYPE_MIN_VALUE (arg
)
7680 && unify (tparms
, targs
, TYPE_MIN_VALUE (parm
),
7681 TYPE_MIN_VALUE (arg
), UNIFY_ALLOW_INTEGER
,
7684 if (TYPE_MAX_VALUE (parm
) && TYPE_MAX_VALUE (arg
)
7685 && unify (tparms
, targs
, TYPE_MAX_VALUE (parm
),
7686 TYPE_MAX_VALUE (arg
), UNIFY_ALLOW_INTEGER
,
7690 /* We use the TYPE_MAIN_VARIANT since we have already
7691 checked cv-qualification at the top of the
7693 else if (!same_type_p (TYPE_MAIN_VARIANT (arg
),
7694 TYPE_MAIN_VARIANT (parm
)))
7697 /* As far as unification is concerned, this wins. Later checks
7698 will invalidate it if necessary. */
7701 /* Types INTEGER_CST and MINUS_EXPR can come from array bounds. */
7702 /* Type INTEGER_CST can come from ordinary constant template args. */
7704 while (TREE_CODE (arg
) == NOP_EXPR
)
7705 arg
= TREE_OPERAND (arg
, 0);
7707 if (TREE_CODE (arg
) != INTEGER_CST
)
7709 return !tree_int_cst_equal (parm
, arg
);
7714 if (TREE_CODE (arg
) != TREE_VEC
)
7716 if (TREE_VEC_LENGTH (parm
) != TREE_VEC_LENGTH (arg
))
7718 for (i
= TREE_VEC_LENGTH (parm
) - 1; i
>= 0; i
--)
7719 if (unify (tparms
, targs
,
7720 TREE_VEC_ELT (parm
, i
), TREE_VEC_ELT (arg
, i
),
7721 UNIFY_ALLOW_NONE
, explicit_mask
))
7728 if (TYPE_PTRMEMFUNC_FLAG (parm
))
7729 return unify (tparms
, targs
, TYPE_PTRMEMFUNC_FN_TYPE (parm
),
7730 arg
, strict
, explicit_mask
);
7732 if (TREE_CODE (arg
) != TREE_CODE (parm
))
7735 if (CLASSTYPE_TEMPLATE_INFO (parm
))
7738 if (strict
& UNIFY_ALLOW_DERIVED
)
7739 /* [temp.deduct.call]
7741 If P is a class, and P has the form template-id, then A
7742 can be a derived class of the deduced A. Likewise, if
7743 P is a pointer to a class of the form template-id, A
7744 can be a pointer to a derived class pointed to by the
7747 The call to get_template_base also handles the case
7748 where PARM and ARG are the same type, i.e., where no
7749 derivation is involved. */
7750 t
= get_template_base (CLASSTYPE_TI_TEMPLATE (parm
), arg
);
7751 else if (CLASSTYPE_TEMPLATE_INFO (arg
)
7752 && (CLASSTYPE_TI_TEMPLATE (parm
)
7753 == CLASSTYPE_TI_TEMPLATE (arg
)))
7754 /* Perhaps PARM is something like S<U> and ARG is S<int>.
7755 Then, we should unify `int' and `U'. */
7758 if (! t
|| t
== error_mark_node
)
7761 return unify (tparms
, targs
, CLASSTYPE_TI_ARGS (parm
),
7762 CLASSTYPE_TI_ARGS (t
), UNIFY_ALLOW_NONE
,
7765 else if (!same_type_p (TYPE_MAIN_VARIANT (parm
),
7766 TYPE_MAIN_VARIANT (arg
)))
7772 if (TREE_CODE (arg
) != TREE_CODE (parm
))
7775 if (unify (tparms
, targs
, TREE_TYPE (parm
),
7776 TREE_TYPE (arg
), UNIFY_ALLOW_NONE
, explicit_mask
))
7778 return type_unification_real (tparms
, targs
, TYPE_ARG_TYPES (parm
),
7779 TYPE_ARG_TYPES (arg
), 1,
7780 DEDUCE_EXACT
, 0, explicit_mask
);
7783 if (TREE_CODE (arg
) != OFFSET_TYPE
)
7785 if (unify (tparms
, targs
, TYPE_OFFSET_BASETYPE (parm
),
7786 TYPE_OFFSET_BASETYPE (arg
), UNIFY_ALLOW_NONE
, explicit_mask
))
7788 return unify (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
7789 strict
, explicit_mask
);
7792 if (arg
!= decl_constant_value (parm
))
7797 /* Matched cases are handled by the ARG == PARM test above. */
7801 if (TREE_CODE (TREE_OPERAND (parm
, 1)) == INTEGER_CST
)
7803 /* We handle this case specially, since it comes up with
7804 arrays. In particular, something like:
7806 template <int N> void f(int (&x)[N]);
7808 Here, we are trying to unify the range type, which
7809 looks like [0 ... (N - 1)]. */
7811 t1
= TREE_OPERAND (parm
, 0);
7812 t2
= TREE_OPERAND (parm
, 1);
7814 /* Should this be a regular fold? */
7815 t
= maybe_fold_nontype_arg (build (PLUS_EXPR
,
7819 return unify (tparms
, targs
, t1
, t
, strict
, explicit_mask
);
7821 /* else fall through */
7824 if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (TREE_CODE (parm
))))
7826 /* We're looking at an expression. This can happen with
7830 void foo(S<I>, S<I + 2>);
7832 If the call looked like:
7834 foo(S<2>(), S<4>());
7836 we would have already matched `I' with `2'. Now, we'd
7837 like to know if `4' matches `I + 2'. So, we substitute
7838 into that expression, and fold constants, in the hope of
7841 maybe_fold_nontype_arg (tsubst_expr (parm
, targs
, NULL_TREE
));
7842 tree a
= maybe_fold_nontype_arg (arg
);
7844 if (!IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (TREE_CODE (t
))))
7845 /* Good, we mangaged to simplify the exression. */
7846 return unify (tparms
, targs
, t
, a
, UNIFY_ALLOW_NONE
,
7849 /* Bad, we couldn't simplify this. Assume it doesn't
7854 sorry ("use of `%s' in template type unification",
7855 tree_code_name
[(int) TREE_CODE (parm
)]);
7861 /* Called if RESULT is explicitly instantiated, or is a member of an
7862 explicitly instantiated class, or if using -frepo and the
7863 instantiation of RESULT has been assigned to this file. */
7866 mark_decl_instantiated (result
, extern_p
)
7870 if (TREE_CODE (result
) != FUNCTION_DECL
)
7871 /* The TREE_PUBLIC flag for function declarations will have been
7872 set correctly by tsubst. */
7873 TREE_PUBLIC (result
) = 1;
7877 DECL_INTERFACE_KNOWN (result
) = 1;
7878 DECL_NOT_REALLY_EXTERN (result
) = 1;
7880 /* Always make artificials weak. */
7881 if (DECL_ARTIFICIAL (result
) && flag_weak
)
7882 comdat_linkage (result
);
7883 /* For WIN32 we also want to put explicit instantiations in
7884 linkonce sections. */
7885 else if (TREE_PUBLIC (result
))
7886 maybe_make_one_only (result
);
7888 else if (TREE_CODE (result
) == FUNCTION_DECL
)
7889 mark_inline_for_output (result
);
7892 /* Given two function templates PAT1 and PAT2, and explicit template
7893 arguments EXPLICIT_ARGS return:
7895 1 if PAT1 is more specialized than PAT2 as described in [temp.func.order].
7896 -1 if PAT2 is more specialized than PAT1.
7897 0 if neither is more specialized. */
7900 more_specialized (pat1
, pat2
, explicit_args
)
7901 tree pat1
, pat2
, explicit_args
;
7906 targs
= get_bindings_overload (pat1
, pat2
, explicit_args
);
7910 targs
= get_bindings_overload (pat2
, pat1
, explicit_args
);
7917 /* Given two class template specialization list nodes PAT1 and PAT2, return:
7919 1 if PAT1 is more specialized than PAT2 as described in [temp.class.order].
7920 -1 if PAT2 is more specialized than PAT1.
7921 0 if neither is more specialized. */
7924 more_specialized_class (pat1
, pat2
)
7930 targs
= get_class_bindings (TREE_VALUE (pat1
), TREE_PURPOSE (pat1
),
7931 TREE_PURPOSE (pat2
));
7935 targs
= get_class_bindings (TREE_VALUE (pat2
), TREE_PURPOSE (pat2
),
7936 TREE_PURPOSE (pat1
));
7943 /* Return the template arguments that will produce the function signature
7944 DECL from the function template FN, with the explicit template
7945 arguments EXPLICIT_ARGS. If CHECK_RETTYPE is 1, the return type must
7949 get_bindings_real (fn
, decl
, explicit_args
, check_rettype
)
7950 tree fn
, decl
, explicit_args
;
7953 int ntparms
= DECL_NTPARMS (fn
);
7954 tree targs
= make_scratch_vec (ntparms
);
7955 tree decl_arg_types
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
7956 tree extra_fn_arg
= NULL_TREE
;
7959 if (DECL_STATIC_FUNCTION_P (fn
)
7960 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
7962 /* Sometimes we are trying to figure out what's being
7963 specialized by a declaration that looks like a method, and it
7964 turns out to be a static member function. */
7965 if (CLASSTYPE_TEMPLATE_INFO (DECL_REAL_CONTEXT (fn
))
7966 && !is_member_template (fn
))
7967 /* The natural thing to do here seems to be to remove the
7968 spurious `this' parameter from the DECL, but that prevents
7969 unification from making use of the class type. So,
7970 instead, we have fn_type_unification add to the parameters
7972 extra_fn_arg
= build_pointer_type (DECL_REAL_CONTEXT (fn
));
7974 /* In this case, though, adding the extra_fn_arg can confuse
7975 things, so we remove from decl_arg_types instead. */
7976 decl_arg_types
= TREE_CHAIN (decl_arg_types
);
7979 i
= fn_type_unification (fn
, explicit_args
, targs
,
7981 TREE_TYPE (TREE_TYPE (decl
)),
7990 /* Check to see that the resulting return type is also OK. */
7991 tree t
= tsubst (TREE_TYPE (TREE_TYPE (fn
)), targs
,
7994 if (!same_type_p (t
, TREE_TYPE (TREE_TYPE (decl
))))
8001 /* For most uses, we want to check the return type. */
8004 get_bindings (fn
, decl
, explicit_args
)
8005 tree fn
, decl
, explicit_args
;
8007 return get_bindings_real (fn
, decl
, explicit_args
, 1);
8010 /* But for more_specialized, we only care about the parameter types. */
8013 get_bindings_overload (fn
, decl
, explicit_args
)
8014 tree fn
, decl
, explicit_args
;
8016 return get_bindings_real (fn
, decl
, explicit_args
, 0);
8019 /* Return the innermost template arguments that, when applied to a
8020 template specialization whose innermost template parameters are
8021 TPARMS, and whose specialization arguments are ARGS, yield the
8024 For example, suppose we have:
8026 template <class T, class U> struct S {};
8027 template <class T> struct S<T*, int> {};
8029 Then, suppose we want to get `S<double*, int>'. The TPARMS will be
8030 {T}, the PARMS will be {T*, int} and the ARGS will be {double*,
8031 int}. The resulting vector will be {double}, indicating that `T'
8032 is bound to `double'. */
8035 get_class_bindings (tparms
, parms
, args
)
8036 tree tparms
, parms
, args
;
8038 int i
, ntparms
= TREE_VEC_LENGTH (tparms
);
8039 tree vec
= make_temp_vec (ntparms
);
8041 args
= innermost_args (args
);
8043 for (i
= 0; i
< TREE_VEC_LENGTH (parms
); ++i
)
8045 switch (unify (tparms
, vec
,
8046 TREE_VEC_ELT (parms
, i
), TREE_VEC_ELT (args
, i
),
8047 UNIFY_ALLOW_NONE
, 0))
8056 for (i
= 0; i
< ntparms
; ++i
)
8057 if (! TREE_VEC_ELT (vec
, i
))
8063 /* In INSTANTIATIONS is a list of <INSTANTIATION, TEMPLATE> pairs.
8064 Pick the most specialized template, and return the corresponding
8065 instantiation, or if there is no corresponding instantiation, the
8066 template itself. EXPLICIT_ARGS is any template arguments explicity
8067 mentioned in a template-id. If there is no most specialized
8068 tempalte, error_mark_node is returned. If there are no templates
8069 at all, NULL_TREE is returned. */
8072 most_specialized_instantiation (instantiations
, explicit_args
)
8073 tree instantiations
;
8079 if (!instantiations
)
8082 champ
= instantiations
;
8083 for (fn
= TREE_CHAIN (instantiations
); fn
; fn
= TREE_CHAIN (fn
))
8085 fate
= more_specialized (TREE_VALUE (champ
),
8086 TREE_VALUE (fn
), explicit_args
);
8093 fn
= TREE_CHAIN (fn
);
8095 return error_mark_node
;
8101 for (fn
= instantiations
; fn
&& fn
!= champ
; fn
= TREE_CHAIN (fn
))
8103 fate
= more_specialized (TREE_VALUE (champ
),
8104 TREE_VALUE (fn
), explicit_args
);
8106 return error_mark_node
;
8109 return TREE_PURPOSE (champ
) ? TREE_PURPOSE (champ
) : TREE_VALUE (champ
);
8112 /* Return the most specialized of the list of templates in FNS that can
8113 produce an instantiation matching DECL, given the explicit template
8114 arguments EXPLICIT_ARGS. */
8117 most_specialized (fns
, decl
, explicit_args
)
8118 tree fns
, decl
, explicit_args
;
8120 tree candidates
= NULL_TREE
;
8123 for (fn
= fns
; fn
; fn
= TREE_CHAIN (fn
))
8125 tree candidate
= TREE_VALUE (fn
);
8127 args
= get_bindings (candidate
, decl
, explicit_args
);
8129 candidates
= scratch_tree_cons (NULL_TREE
, candidate
,
8133 return most_specialized_instantiation (candidates
, explicit_args
);
8136 /* If DECL is a specialization of some template, return the most
8137 general such template. For example, given:
8139 template <class T> struct S { template <class U> void f(U); };
8141 if TMPL is `template <class U> void S<int>::f(U)' this will return
8142 the full template. This function will not trace past partial
8143 specializations, however. For example, given in addition:
8145 template <class T> struct S<T*> { template <class U> void f(U); };
8147 if TMPL is `template <class U> void S<int*>::f(U)' this will return
8148 `template <class T> template <class U> S<T*>::f(U)'. */
8151 most_general_template (decl
)
8154 while (DECL_TEMPLATE_INFO (decl
))
8155 decl
= DECL_TI_TEMPLATE (decl
);
8160 /* Return the most specialized of the class template specializations
8161 of TMPL which can produce an instantiation matching ARGS, or
8162 error_mark_node if the choice is ambiguous. */
8165 most_specialized_class (tmpl
, args
)
8169 tree list
= NULL_TREE
;
8174 tmpl
= most_general_template (tmpl
);
8175 for (t
= DECL_TEMPLATE_SPECIALIZATIONS (tmpl
); t
; t
= TREE_CHAIN (t
))
8178 = get_class_bindings (TREE_VALUE (t
), TREE_PURPOSE (t
), args
);
8181 list
= decl_tree_cons (TREE_PURPOSE (t
), TREE_VALUE (t
), list
);
8182 TREE_TYPE (list
) = TREE_TYPE (t
);
8192 for (; t
; t
= TREE_CHAIN (t
))
8194 fate
= more_specialized_class (champ
, t
);
8203 return error_mark_node
;
8209 for (t
= list
; t
&& t
!= champ
; t
= TREE_CHAIN (t
))
8211 fate
= more_specialized_class (champ
, t
);
8213 return error_mark_node
;
8219 /* called from the parser. */
8222 do_decl_instantiation (declspecs
, declarator
, storage
)
8223 tree declspecs
, declarator
, storage
;
8225 tree decl
= grokdeclarator (declarator
, declspecs
, NORMAL
, 0, NULL_TREE
);
8226 tree result
= NULL_TREE
;
8229 if (! DECL_LANG_SPECIFIC (decl
))
8231 cp_error ("explicit instantiation of non-template `%#D'", decl
);
8234 else if (TREE_CODE (decl
) == VAR_DECL
)
8236 /* There is an asymmetry here in the way VAR_DECLs and
8237 FUNCTION_DECLs are handled by grokdeclarator. In the case of
8238 the latter, the DECL we get back will be marked as a
8239 template instantiation, and the appropriate
8240 DECL_TEMPLATE_INFO will be set up. This does not happen for
8241 VAR_DECLs so we do the lookup here. Probably, grokdeclarator
8242 should handle VAR_DECLs as it currently handles
8244 result
= lookup_field (DECL_CONTEXT (decl
), DECL_NAME (decl
), 0, 0);
8245 if (result
&& TREE_CODE (result
) != VAR_DECL
)
8247 cp_error ("no matching template for `%D' found", result
);
8251 else if (TREE_CODE (decl
) != FUNCTION_DECL
)
8253 cp_error ("explicit instantiation of `%#D'", decl
);
8259 /* Check for various error cases. Note that if the explicit
8260 instantiation is legal the RESULT will currently be marked as an
8261 *implicit* instantiation; DECL_EXPLICIT_INSTANTIATION is not set
8262 until we get here. */
8264 if (DECL_TEMPLATE_SPECIALIZATION (result
))
8268 No program shall both explicitly instantiate and explicitly
8269 specialize a template. */
8270 cp_error ("explicit instantiation of `%#D' after", result
);
8271 cp_error_at ("explicit specialization here", result
);
8274 else if (DECL_EXPLICIT_INSTANTIATION (result
))
8278 No program shall explicitly instantiate any template more
8281 We check DECL_INTERFACE_KNOWN so as not to complain when the
8282 first instantiation was `extern' and the second is not, and
8283 EXTERN_P for the opposite case. */
8284 if (DECL_INTERFACE_KNOWN (result
) && !extern_p
)
8285 cp_error ("duplicate explicit instantiation of `%#D'", result
);
8287 /* If we've already instantiated the template, just return now. */
8288 if (DECL_INTERFACE_KNOWN (result
))
8291 else if (!DECL_IMPLICIT_INSTANTIATION (result
))
8293 cp_error ("no matching template for `%D' found", result
);
8296 else if (!DECL_TEMPLATE_INFO (result
))
8298 cp_pedwarn ("explicit instantiation of non-template `%#D'", result
);
8302 if (flag_external_templates
)
8305 if (storage
== NULL_TREE
)
8307 else if (storage
== ridpointers
[(int) RID_EXTERN
])
8310 cp_pedwarn ("ANSI C++ forbids the use of `extern' on explicit instantiations");
8314 cp_error ("storage class `%D' applied to template instantiation",
8317 SET_DECL_EXPLICIT_INSTANTIATION (result
);
8318 mark_decl_instantiated (result
, extern_p
);
8319 repo_template_instantiated (result
, extern_p
);
8321 instantiate_decl (result
);
8325 mark_class_instantiated (t
, extern_p
)
8329 SET_CLASSTYPE_EXPLICIT_INSTANTIATION (t
);
8330 SET_CLASSTYPE_INTERFACE_KNOWN (t
);
8331 CLASSTYPE_INTERFACE_ONLY (t
) = extern_p
;
8332 CLASSTYPE_VTABLE_NEEDS_WRITING (t
) = ! extern_p
;
8333 TYPE_DECL_SUPPRESS_DEBUG (TYPE_NAME (t
)) = extern_p
;
8336 CLASSTYPE_DEBUG_REQUESTED (t
) = 1;
8337 rest_of_type_compilation (t
, 1);
8342 do_type_instantiation (t
, storage
)
8349 if (TREE_CODE (t
) == TYPE_DECL
)
8352 if (! CLASS_TYPE_P (t
) || ! CLASSTYPE_TEMPLATE_INFO (t
))
8354 cp_error ("explicit instantiation of non-template type `%T'", t
);
8360 /* With -fexternal-templates, explicit instantiations are treated the same
8361 as implicit ones. */
8362 if (flag_external_templates
)
8365 if (TYPE_SIZE (t
) == NULL_TREE
)
8367 cp_error ("explicit instantiation of `%#T' before definition of template",
8372 if (storage
!= NULL_TREE
)
8375 cp_pedwarn("ANSI C++ forbids the use of `%s' on explicit instantiations",
8376 IDENTIFIER_POINTER (storage
));
8378 if (storage
== ridpointers
[(int) RID_INLINE
])
8380 else if (storage
== ridpointers
[(int) RID_EXTERN
])
8382 else if (storage
== ridpointers
[(int) RID_STATIC
])
8386 cp_error ("storage class `%D' applied to template instantiation",
8392 if (CLASSTYPE_TEMPLATE_SPECIALIZATION (t
))
8396 No program shall both explicitly instantiate and explicitly
8397 specialize a template. */
8398 cp_error ("explicit instantiation of `%#T' after", t
);
8399 cp_error_at ("explicit specialization here", t
);
8402 else if (CLASSTYPE_EXPLICIT_INSTANTIATION (t
))
8406 No program shall explicitly instantiate any template more
8409 If CLASSTYPE_INTERFACE_ONLY, then the first explicit
8410 instantiation was `extern', and if EXTERN_P then the second
8411 is. Both cases are OK. */
8412 if (!CLASSTYPE_INTERFACE_ONLY (t
) && !extern_p
)
8413 cp_error ("duplicate explicit instantiation of `%#T'", t
);
8415 /* If we've already instantiated the template, just return now. */
8416 if (!CLASSTYPE_INTERFACE_ONLY (t
))
8420 mark_class_instantiated (t
, extern_p
);
8421 repo_template_instantiated (t
, extern_p
);
8429 /* In contrast to implicit instantiation, where only the
8430 declarations, and not the definitions, of members are
8431 instantiated, we have here:
8435 The explicit instantiation of a class template specialization
8436 implies the instantiation of all of its members not
8437 previously explicitly specialized in the translation unit
8438 containing the explicit instantiation.
8440 Of course, we can't instantiate member template classes, since
8441 we don't have any arguments for them. Note that the standard
8442 is unclear on whether the instatiation of the members are
8443 *explicit* instantiations or not. We choose to be generous,
8444 and not set DECL_EXPLICIT_INSTANTIATION. Therefore, we allow
8445 the explicit instantiation of a class where some of the members
8446 have no definition in the current translation unit. */
8449 for (tmp
= TYPE_METHODS (t
); tmp
; tmp
= TREE_CHAIN (tmp
))
8450 if (TREE_CODE (tmp
) == FUNCTION_DECL
8451 && DECL_TEMPLATE_INSTANTIATION (tmp
))
8453 mark_decl_instantiated (tmp
, extern_p
);
8454 repo_template_instantiated (tmp
, extern_p
);
8456 instantiate_decl (tmp
);
8459 for (tmp
= TYPE_FIELDS (t
); tmp
; tmp
= TREE_CHAIN (tmp
))
8460 if (TREE_CODE (tmp
) == VAR_DECL
&& DECL_TEMPLATE_INSTANTIATION (tmp
))
8462 mark_decl_instantiated (tmp
, extern_p
);
8463 repo_template_instantiated (tmp
, extern_p
);
8465 instantiate_decl (tmp
);
8468 for (tmp
= CLASSTYPE_TAGS (t
); tmp
; tmp
= TREE_CHAIN (tmp
))
8469 if (IS_AGGR_TYPE (TREE_VALUE (tmp
))
8470 && !uses_template_parms (CLASSTYPE_TI_ARGS (TREE_VALUE (tmp
))))
8471 do_type_instantiation (TYPE_MAIN_DECL (TREE_VALUE (tmp
)), storage
);
8475 /* Given a function DECL, which is a specialization of TMPL, modify
8476 DECL to be a re-instantiation of TMPL with the same template
8477 arguments. TMPL should be the template into which tsubst'ing
8478 should occur for DECL, not the most general template.
8480 One reason for doing this is a scenario like this:
8483 void f(const T&, int i);
8485 void g() { f(3, 7); }
8488 void f(const T& t, const int i) { }
8490 Note that when the template is first instantiated, with
8491 instantiate_template, the resulting DECL will have no name for the
8492 first parameter, and the wrong type for the second. So, when we go
8493 to instantiate the DECL, we regenerate it. */
8496 regenerate_decl_from_template (decl
, tmpl
)
8506 args
= DECL_TI_ARGS (decl
);
8507 code_pattern
= DECL_TEMPLATE_RESULT (tmpl
);
8509 /* Unregister the specialization so that when we tsubst we will not
8510 just return DECL. We don't have to unregister DECL from TMPL
8511 because if would only be registered there if it were a partial
8512 instantiation of a specialization, which it isn't: it's a full
8514 gen_tmpl
= most_general_template (tmpl
);
8515 unregistered
= unregister_specialization (decl
, gen_tmpl
);
8517 /* If the DECL was not unregistered then something peculiar is
8518 happening: we created a specialization but did not call
8519 register_specialization for it. */
8520 my_friendly_assert (unregistered
, 0);
8522 if (TREE_CODE (decl
) == VAR_DECL
)
8523 /* Make sure that we can see identifiers, and compute access
8524 correctly, for the class members used in the declaration of
8525 this static variable. */
8526 pushclass (DECL_CONTEXT (decl
), 2);
8528 /* Do the substitution to get the new declaration. */
8529 new_decl
= tsubst (code_pattern
, args
, NULL_TREE
);
8531 if (TREE_CODE (decl
) == VAR_DECL
)
8533 /* Set up DECL_INITIAL, since tsubst doesn't. */
8534 DECL_INITIAL (new_decl
) =
8535 tsubst_expr (DECL_INITIAL (code_pattern
), args
,
8536 DECL_TI_TEMPLATE (decl
));
8537 /* Pop the class context we pushed above. */
8541 if (TREE_CODE (decl
) == FUNCTION_DECL
)
8543 /* Convince duplicate_decls to use the DECL_ARGUMENTS from the
8545 DECL_INITIAL (new_decl
) = error_mark_node
;
8546 /* And don't complain about a duplicate definition. */
8547 DECL_INITIAL (decl
) = NULL_TREE
;
8550 /* The immediate parent of the new template is still whatever it was
8551 before, even though tsubst sets DECL_TI_TEMPLATE up as the most
8552 general template. We also reset the DECL_ASSEMBLER_NAME since
8553 tsubst always calculates the name as if the function in question
8554 were really a template instance, and sometimes, with friend
8555 functions, this is not so. See tsubst_friend_function for
8557 DECL_TI_TEMPLATE (new_decl
) = DECL_TI_TEMPLATE (decl
);
8558 DECL_ASSEMBLER_NAME (new_decl
) = DECL_ASSEMBLER_NAME (decl
);
8559 DECL_RTL (new_decl
) = DECL_RTL (decl
);
8561 /* Call duplicate decls to merge the old and new declarations. */
8562 duplicate_decls (new_decl
, decl
);
8564 /* Now, re-register the specialization. */
8565 register_specialization (decl
, gen_tmpl
, args
);
8568 /* Produce the definition of D, a _DECL generated from a template. */
8571 instantiate_decl (d
)
8574 tree tmpl
= DECL_TI_TEMPLATE (d
);
8575 tree args
= DECL_TI_ARGS (d
);
8580 int nested
= in_function_p ();
8581 int pattern_defined
;
8583 char *file
= input_filename
;
8585 /* This function should only be used to instantiate templates for
8586 functions and static member variables. */
8587 my_friendly_assert (TREE_CODE (d
) == FUNCTION_DECL
8588 || TREE_CODE (d
) == VAR_DECL
, 0);
8590 if (DECL_TEMPLATE_INSTANTIATED (d
))
8591 /* D has already been instantiated. It might seem reasonable to
8592 check whether or not D is an explict instantiation, and, if so,
8593 stop here. But when an explicit instantiation is deferred
8594 until the end of the compilation, DECL_EXPLICIT_INSTANTIATION
8595 is set, even though we still need to do the instantiation. */
8598 /* If we already have a specialization of this declaration, then
8599 there's no reason to instantiate it. Note that
8600 retrieve_specialization gives us both instantiations and
8601 specializations, so we must explicitly check
8602 DECL_TEMPLATE_SPECIALIZATION. */
8603 gen_tmpl
= most_general_template (tmpl
);
8604 spec
= retrieve_specialization (gen_tmpl
, args
);
8605 if (spec
!= NULL_TREE
&& DECL_TEMPLATE_SPECIALIZATION (spec
))
8608 /* This needs to happen before any tsubsting. */
8609 if (! push_tinst_level (d
))
8612 /* Set TD to the template whose DECL_TEMPLATE_RESULT is the pattern
8613 for the instantiation. This is not always the most general
8614 template. Consider, for example:
8617 struct S { template <class U> void f();
8618 template <> void f<int>(); };
8620 and an instantiation of S<double>::f<int>. We want TD to be the
8621 specialization S<T>::f<int>, not the more general S<T>::f<U>. */
8624 /* An instantiation cannot have a definition, so we need a
8625 more general template. */
8626 DECL_TEMPLATE_INSTANTIATION (td
)
8627 /* We must also deal with friend templates. Given:
8629 template <class T> struct S {
8630 template <class U> friend void f() {};
8633 S<int>::f<U> say, is not an instantiation of S<T>::f<U>,
8634 so far as the language is concerned, but that's still
8635 where we get the pattern for the instantiation from. On
8636 ther hand, if the definition comes outside the class, say:
8638 template <class T> struct S {
8639 template <class U> friend void f();
8641 template <class U> friend void f() {}
8643 we don't need to look any further. That's what the check for
8644 DECL_INITIAL is for. */
8645 || (TREE_CODE (d
) == FUNCTION_DECL
8646 && DECL_FRIEND_PSEUDO_TEMPLATE_INSTANTIATION (td
)
8647 && !DECL_INITIAL (DECL_TEMPLATE_RESULT (td
)));
8650 /* The present template, TD, should not be a definition. If it
8651 were a definition, we should be using it! Note that we
8652 cannot restructure the loop to just keep going until we find
8653 a template with a definition, since that might go too far if
8654 a specialization was declared, but not defined. */
8655 my_friendly_assert (!(TREE_CODE (d
) == VAR_DECL
8656 && !DECL_IN_AGGR_P (DECL_TEMPLATE_RESULT (td
))),
8659 /* Fetch the more general template. */
8660 td
= DECL_TI_TEMPLATE (td
);
8663 code_pattern
= DECL_TEMPLATE_RESULT (td
);
8665 if (TREE_CODE (d
) == FUNCTION_DECL
)
8666 pattern_defined
= (DECL_INITIAL (code_pattern
) != NULL_TREE
);
8668 pattern_defined
= ! DECL_IN_AGGR_P (code_pattern
);
8670 push_to_top_level ();
8671 lineno
= DECL_SOURCE_LINE (d
);
8672 input_filename
= DECL_SOURCE_FILE (d
);
8674 if (pattern_defined
)
8676 repo_template_used (d
);
8678 if (flag_external_templates
&& ! DECL_INTERFACE_KNOWN (d
))
8680 if (flag_alt_external_templates
)
8682 if (interface_unknown
)
8683 warn_if_unknown_interface (d
);
8685 else if (DECL_INTERFACE_KNOWN (code_pattern
))
8687 DECL_INTERFACE_KNOWN (d
) = 1;
8688 DECL_NOT_REALLY_EXTERN (d
) = ! DECL_EXTERNAL (code_pattern
);
8691 warn_if_unknown_interface (code_pattern
);
8695 import_export_decl (d
);
8698 /* Reject all external templates except inline functions. */
8699 if (DECL_INTERFACE_KNOWN (d
)
8700 && ! DECL_NOT_REALLY_EXTERN (d
)
8701 && ! (TREE_CODE (d
) == FUNCTION_DECL
&& DECL_INLINE (d
)))
8704 if (TREE_CODE (d
) == VAR_DECL
8705 && TREE_READONLY (d
)
8706 && DECL_INITIAL (d
) == NULL_TREE
8707 && DECL_INITIAL (code_pattern
) != NULL_TREE
)
8708 /* We need to set up DECL_INITIAL regardless of pattern_defined if
8709 the variable is a static const initialized in the class body. */;
8710 else if (! pattern_defined
8711 || (! (TREE_CODE (d
) == FUNCTION_DECL
&& DECL_INLINE (d
) && nested
)
8714 /* Defer all templates except inline functions used in another
8715 function. We restore the source position here because it's used
8716 by add_pending_template. */
8718 input_filename
= file
;
8720 if (at_eof
&& !pattern_defined
8721 && DECL_EXPLICIT_INSTANTIATION (d
))
8724 The definition of a non-exported function template, a
8725 non-exported member function template, or a non-exported
8726 member function or static data member of a class template
8727 shall be present in every translation unit in which it is
8728 explicitly instantiated. */
8729 cp_error ("explicit instantiation of `%D' but no definition available",
8732 add_pending_template (d
);
8736 regenerate_decl_from_template (d
, td
);
8737 DECL_TEMPLATE_INSTANTIATED (d
) = 1;
8739 /* We already set the file and line above. Reset them now in case
8740 they changed as a result of calling regenerate_decl_from_template. */
8741 lineno
= DECL_SOURCE_LINE (d
);
8742 input_filename
= DECL_SOURCE_FILE (d
);
8744 if (TREE_CODE (d
) == VAR_DECL
)
8746 DECL_IN_AGGR_P (d
) = 0;
8747 if (DECL_INTERFACE_KNOWN (d
))
8748 DECL_EXTERNAL (d
) = ! DECL_NOT_REALLY_EXTERN (d
);
8751 DECL_EXTERNAL (d
) = 1;
8752 DECL_NOT_REALLY_EXTERN (d
) = 1;
8754 cp_finish_decl (d
, DECL_INITIAL (d
), NULL_TREE
, 0, 0);
8756 else if (TREE_CODE (d
) == FUNCTION_DECL
)
8758 tree t
= DECL_SAVED_TREE (code_pattern
);
8760 start_function (NULL_TREE
, d
, NULL_TREE
, 1);
8761 store_parm_decls ();
8763 if (t
&& TREE_CODE (t
) == RETURN_INIT
)
8766 (TREE_OPERAND (t
, 0),
8767 tsubst_expr (TREE_OPERAND (t
, 1), args
, tmpl
));
8771 if (t
&& TREE_CODE (t
) == CTOR_INITIALIZER
)
8773 current_member_init_list
8774 = tsubst_expr_values (TREE_OPERAND (t
, 0), args
);
8775 current_base_init_list
8776 = tsubst_expr_values (TREE_OPERAND (t
, 1), args
);
8781 /* Always keep the BLOCK node associated with the outermost
8782 pair of curly braces of a function. These are needed
8783 for correct operation of dwarfout.c. */
8786 my_friendly_assert (TREE_CODE (t
) == COMPOUND_STMT
, 42);
8787 tsubst_expr (t
, args
, tmpl
);
8789 finish_function (lineno
, 0, nested
);
8794 input_filename
= file
;
8796 pop_from_top_level ();
8803 tsubst_expr_values (t
, argvec
)
8806 tree first
= NULL_TREE
;
8809 for (; t
; t
= TREE_CHAIN (t
))
8811 tree pur
= tsubst_copy (TREE_PURPOSE (t
), argvec
, NULL_TREE
);
8812 tree val
= tsubst_expr (TREE_VALUE (t
), argvec
, NULL_TREE
);
8813 *p
= build_tree_list (pur
, val
);
8814 p
= &TREE_CHAIN (*p
);
8825 last_tree
= TREE_CHAIN (last_tree
) = t
;
8832 saved_trees
= tree_cons (NULL_TREE
, last_tree
, saved_trees
);
8833 last_tree
= NULL_TREE
;
8840 my_friendly_assert (saved_trees
!= NULL_TREE
, 0);
8842 last_tree
= TREE_VALUE (saved_trees
);
8843 saved_trees
= TREE_CHAIN (saved_trees
);
8846 /* D is an undefined function declaration in the presence of templates with
8847 the same name, listed in FNS. If one of them can produce D as an
8848 instantiation, remember this so we can instantiate it at EOF if D has
8849 not been defined by that time. */
8852 add_maybe_template (d
, fns
)
8857 if (DECL_MAYBE_TEMPLATE (d
))
8860 t
= most_specialized (fns
, d
, NULL_TREE
);
8863 if (t
== error_mark_node
)
8865 cp_error ("ambiguous template instantiation for `%D'", d
);
8869 *maybe_template_tail
= perm_tree_cons (t
, d
, NULL_TREE
);
8870 maybe_template_tail
= &TREE_CHAIN (*maybe_template_tail
);
8871 DECL_MAYBE_TEMPLATE (d
) = 1;
8874 /* Set CURRENT_ACCESS_SPECIFIER based on the protection of DECL. */
8877 set_current_access_from_decl (decl
)
8880 if (TREE_PRIVATE (decl
))
8881 current_access_specifier
= access_private_node
;
8882 else if (TREE_PROTECTED (decl
))
8883 current_access_specifier
= access_protected_node
;
8885 current_access_specifier
= access_public_node
;
8888 /* Instantiate an enumerated type. TAG is the template type, NEWTAG
8889 is the instantiation (which should have been created with
8890 start_enum) and ARGS are the template arguments to use. */
8893 tsubst_enum (tag
, newtag
, args
)
8900 for (e
= TYPE_VALUES (tag
); e
; e
= TREE_CHAIN (e
))
8905 /* Note that in a template enum, the TREE_VALUE is the
8906 CONST_DECL, not the corresponding INTEGER_CST. */
8907 value
= tsubst_expr (DECL_INITIAL (TREE_VALUE (e
)),
8911 /* Give this enumeration constant the correct access. */
8912 set_current_access_from_decl (TREE_VALUE (e
));
8914 /* Actually build the enumerator itself. */
8915 elt
= build_enumerator (TREE_PURPOSE (e
), value
, newtag
);
8917 /* We save the enumerators we have built so far in the
8918 TYPE_VALUES so that if the enumeration constants for
8919 subsequent enumerators involve those for previous ones,
8920 tsubst_copy will be able to find them. */
8921 TREE_CHAIN (elt
) = TYPE_VALUES (newtag
);
8922 TYPE_VALUES (newtag
) = elt
;
8925 finish_enum (newtag
);
8928 /* Set the DECL_ASSEMBLER_NAME for DECL, which is a FUNCTION_DECL that
8929 is either an instantiation or specialization of a template
8933 set_mangled_name_for_template_decl (decl
)
8936 tree saved_namespace
;
8937 tree context
= NULL_TREE
;
8946 my_friendly_assert (TREE_CODE (decl
) == FUNCTION_DECL
, 0);
8947 my_friendly_assert (DECL_TEMPLATE_INFO (decl
) != NULL_TREE
, 0);
8949 /* The names of template functions must be mangled so as to indicate
8950 what template is being specialized with what template arguments.
8951 For example, each of the following three functions must get
8952 different mangled names:
8955 template <> void f<7>(int);
8956 template <> void f<8>(int); */
8958 targs
= DECL_TI_ARGS (decl
);
8959 if (uses_template_parms (targs
))
8960 /* This DECL is for a partial instantiation. There's no need to
8961 mangle the name of such an entity. */
8964 tmpl
= most_general_template (DECL_TI_TEMPLATE (decl
));
8965 tparms
= DECL_TEMPLATE_PARMS (tmpl
);
8966 parm_depth
= TMPL_PARMS_DEPTH (tparms
);
8968 /* There should be as many levels of arguments as there are levels
8970 my_friendly_assert (parm_depth
== TMPL_ARGS_DEPTH (targs
), 0);
8972 /* We now compute the PARMS and RET_TYPE to give to
8973 build_decl_overload_real. The PARMS and RET_TYPE are the
8974 parameter and return types of the template, after all but the
8975 innermost template arguments have been substituted, not the
8976 parameter and return types of the function DECL. For example,
8979 template <class T> T f(T);
8981 both PARMS and RET_TYPE should be `T' even if DECL is `int f(int)'.
8982 A more subtle example is:
8984 template <class T> struct S { template <class U> void f(T, U); }
8986 Here, if DECL is `void S<int>::f(int, double)', PARMS should be
8987 {int, U}. Thus, the args that we want to subsitute into the
8988 return and parameter type for the function are those in TARGS,
8989 with the innermost level omitted. */
8990 fn_type
= TREE_TYPE (tmpl
);
8991 if (DECL_STATIC_FUNCTION_P (decl
))
8992 context
= DECL_CLASS_CONTEXT (decl
);
8994 if (parm_depth
== 1)
8995 /* No substitution is necessary. */
9002 /* Replace the innermost level of the TARGS with NULL_TREEs to
9003 let tsubst know not to subsitute for those parameters. */
9004 partial_args
= make_temp_vec (TREE_VEC_LENGTH (targs
));
9005 for (i
= 1; i
< TMPL_ARGS_DEPTH (targs
); ++i
)
9006 SET_TMPL_ARGS_LEVEL (partial_args
, i
,
9007 TMPL_ARGS_LEVEL (targs
, i
));
9008 SET_TMPL_ARGS_LEVEL (partial_args
,
9009 TMPL_ARGS_DEPTH (targs
),
9010 make_temp_vec (DECL_NTPARMS (tmpl
)));
9012 /* Now, do the (partial) substitution to figure out the
9013 appropriate function type. */
9014 fn_type
= tsubst (fn_type
, partial_args
, NULL_TREE
);
9015 if (DECL_STATIC_FUNCTION_P (decl
))
9016 context
= tsubst (context
, partial_args
, NULL_TREE
);
9018 /* Substitute into the template parameters to obtain the real
9019 innermost set of parameters. This step is important if the
9020 innermost set of template parameters contains value
9021 parameters whose types depend on outer template parameters. */
9022 TREE_VEC_LENGTH (partial_args
)--;
9023 tparms
= tsubst_template_parms (tparms
, partial_args
);
9026 /* Now, get the innermost parameters and arguments, and figure out
9027 the parameter and return types. */
9028 tparms
= INNERMOST_TEMPLATE_PARMS (tparms
);
9029 targs
= innermost_args (targs
);
9030 ret_type
= TREE_TYPE (fn_type
);
9031 parm_types
= TYPE_ARG_TYPES (fn_type
);
9033 /* For a static member function, we generate a fake `this' pointer,
9034 for the purposes of mangling. This indicates of which class the
9035 function is a member. Because of:
9039 There shall not be a static and a nonstatic member function
9040 with the same name and the same parameter types
9042 we don't have to worry that this will result in a clash with a
9043 non-static member function. */
9044 if (DECL_STATIC_FUNCTION_P (decl
))
9045 parm_types
= hash_tree_chain (build_pointer_type (context
), parm_types
);
9047 /* There should be the same number of template parameters as
9048 template arguments. */
9049 my_friendly_assert (TREE_VEC_LENGTH (tparms
) == TREE_VEC_LENGTH (targs
),
9052 /* If the template is in a namespace, we need to put that into the
9053 mangled name. Unfortunately, build_decl_overload_real does not
9054 get the decl to mangle, so it relies on the current
9055 namespace. Therefore, we set that here temporarily. */
9056 my_friendly_assert (TREE_CODE_CLASS (TREE_CODE (decl
)) == 'd', 980702);
9057 saved_namespace
= current_namespace
;
9058 current_namespace
= CP_DECL_CONTEXT (decl
);
9060 /* Actually set the DCL_ASSEMBLER_NAME. */
9061 DECL_ASSEMBLER_NAME (decl
)
9062 = build_decl_overload_real (DECL_NAME (decl
), parm_types
, ret_type
,
9064 DECL_FUNCTION_MEMBER_P (decl
)
9065 + DECL_CONSTRUCTOR_P (decl
));
9067 /* Restore the previously active namespace. */
9068 current_namespace
= saved_namespace
;